summaryrefslogtreecommitdiffstats
path: root/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_21.CPP
blob: 66036aef9cf320a1033f66d1db47bc05cc9c3e19 (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
// Fig. 21.21: fig21_21.cpp

// Standard library class multimap test program.

#include <iostream>



using std::cout;

using std::endl;



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



// define short name for multimap type used in this program

typedef std::multimap< int, double, std::less< int > > mmid;



int main()

{

   mmid pairs;



   cout << "There are currently " << pairs.count( 15 )

        << " pairs with key 15 in the multimap\n";



   // insert two value_type objects in pairs

   pairs.insert( mmid::value_type( 15, 2.7 ) );

   pairs.insert( mmid::value_type( 15, 99.3 ) );

   

   cout << "After inserts, there are " 

        << pairs.count( 15 )

        << " pairs with key 15\n\n";

   

   // insert five value_type objects in pairs

   pairs.insert( mmid::value_type( 30, 111.11 ) );

   pairs.insert( mmid::value_type( 10, 22.22 ) );

   pairs.insert( mmid::value_type( 25, 33.333 ) );

   pairs.insert( mmid::value_type( 20, 9.345 ) );

   pairs.insert( mmid::value_type( 5, 77.54 ) );

   

   cout << "Multimap pairs contains:\nKey\tValue\n";

   

   // use const_iterator to walk through elements of pairs

   for ( mmid::const_iterator iter = pairs.begin();

         iter != pairs.end(); ++iter )

      cout << iter->first << '\t' 

           << iter->second << '\n';



   cout << endl;



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

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