summaryrefslogtreecommitdiffstats
path: root/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_31.CPP
blob: 97720e48e6b3e716938132a94f4a03c28368e955 (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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
// Fig. 21.31: fig21_31.cpp

// Standard library search and sort algorithms.

#include <iostream>



using std::cout;

using std::endl;



#include <algorithm>  // algorithm definitions

#include <vector>     // vector class-template definition



bool greater10( int value );  // prototype



int main()

{

   const int SIZE = 10;

   int a[ SIZE ] = { 10, 2, 17, 5, 16, 8, 13, 11, 20, 7 };



   std::vector< int > v( a, a + SIZE );

   std::ostream_iterator< int > output( cout, " " );



   cout << "Vector v contains: ";

   std::copy( v.begin(), v.end(), output );

   

   // locate first occurrence of 16 in v

   std::vector< int >::iterator location;

   location = std::find( v.begin(), v.end(), 16 );



   if ( location != v.end() ) 

      cout << "\n\nFound 16 at location " 

           << ( location - v.begin() );

   else 

      cout << "\n\n16 not found";

   

   // locate first occurrence of 100 in v

   location = std::find( v.begin(), v.end(), 100 );



   if ( location != v.end() ) 

      cout << "\nFound 100 at location " 

           << ( location - v.begin() );

   else 

      cout << "\n100 not found";



   // locate first occurrence of value greater than 10 in v

   location = std::find_if( v.begin(), v.end(), greater10 );



   if ( location != v.end() ) 

      cout << "\n\nThe first value greater than 10 is "

           << *location << "\nfound at location " 

           << ( location - v.begin() );

   else 

      cout << "\n\nNo values greater than 10 were found";



   // sort elements of v

   std::sort( v.begin(), v.end() );



   cout << "\n\nVector v after sort: ";

   std::copy( v.begin(), v.end(), output );



   // use binary_search to locate 13 in v

   if ( std::binary_search( v.begin(), v.end(), 13 ) )

      cout << "\n\n13 was found in v";

   else

      cout << "\n\n13 was not found in v";



   // use binary_search to locate 100 in v

   if ( std::binary_search( v.begin(), v.end(), 100 ) )

      cout << "\n100 was found in v";

   else

      cout << "\n100 was not found in v";



   cout << endl;



   return 0;



} // end main



// determine whether argument is greater than 10

bool greater10( int value ) 

{ 

   return value > 10; 



} // end function greater10



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

 * (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.                     *

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