summaryrefslogtreecommitdiffstats
path: root/Bachelor/Prog2/Codebeispiele/8_ch13/fig13_04.cpp
blob: 34f588a44127984f0e74a5c2c86486acbfc9aa56 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
// Fig. 13.4: fig13_04.cpp

// Demonstrating pre-standard new returning 0 when memory 

// is not allocated.

#include <iostream>



using std::cout;



int main()

{

   double *ptr[ 50 ];



   // allocate memory for ptr

   for ( int i = 0; i < 50; i++ ) {

      ptr[ i ] = new double[ 5000000 ];



      // new returns 0 on failure to allocate memory

      if ( ptr[ i ] == 0 ) {

         cout << "Memory allocation failed for ptr[ " 

              << i << " ]\n";



         break;



      } // end if



      // successful memory allocation

      else

         cout << "Allocated 5000000 doubles in ptr[ " 

              << i << " ]\n";



   } // end for



   return 0;



}  // end main



/**************************************************************************

 * (C) Copyright 1992-2003 by Deitel & Associates, Inc. and Prentice      *

 * Hall. All Rights Reserved.                                             *

 *                                                                        *

 * DISCLAIMER: The authors and publisher of this book have used their     *

 * best efforts in preparing the book. These efforts include the          *

 * development, research, and testing of the theories and programs        *

 * to determine their effectiveness. The authors and publisher make       *

 * no warranty of any kind, expressed or implied, with regard to these    *

 * programs or to the documentation contained in these books. The authors *

 * and publisher shall not be liable in any event for incidental or       *

 * consequential damages in connection with, or arising out of, the       *

 * furnishing, performance, or use of these programs.                     *

 *************************************************************************/