3 // Copyright (C) 2005 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
30 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32 // Permission to use, copy, modify, sell, and distribute this software
33 // is hereby granted without fee, provided that the above copyright
34 // notice appears in all copies, and that both that copyright notice and
35 // this permission notice appear in supporting documentation. None of
36 // the above authors, nor IBM Haifa Research Laboratories, make any
37 // representation about the suitability of this software for any
38 // purpose. It is provided "as is" without express or implied warranty.
41 * @file mapping_level_example.cpp
42 * A basic example showing how to use different mapping levels.
47 // For various associative containers.
48 #include <ext/pb_assoc/assoc_cntnr.hpp>
49 // For compound_data_type.
50 #include <ext/pb_assoc/data_type.hpp>
55 // For unary_function.
58 typedef std::string user_name
;
60 typedef unsigned long machine_id
;
62 typedef std::string process_name
;
64 typedef float running_time
;
67 pb_assoc::lu_assoc_cntnr
<
73 pb_assoc::lu_assoc_cntnr
<
75 pb_assoc::compound_data_type
<
76 pr_name_rn_time_map
> >
80 pb_assoc::lu_assoc_cntnr
<
82 pb_assoc::compound_data_type
<
86 typedef user_machine_pr_map::rebind
<2>::other l2_t
;
88 typedef user_machine_pr_map::rebind
<1>::other l1_t
;
90 struct is_same_proc
: public std::unary_function
<
91 l1_t::iterator::const_reference
,
94 is_same_proc(const process_name
& r_proc
) : m_proc(r_proc
)
100 operator()(l1_t::iterator::const_reference r_val
)
102 return (r_val
.first
.second
== m_proc
);
111 user_machine_pr_map m
;
114 * Following shows different ways to insert into a user_machine_pr_map object.
117 // Josh launches on machine 1 firefox at time 1000.
119 m
["Josh"][1]["firefox"] = 1000;
121 // Ben launches on machine 1 python at time 1003.
122 ((l1_t
& )m
)[std::make_pair(
123 std::make_pair("Ben", 1),
126 // Josh launches on machine 2 buggy at time 1004.
128 m
.find("Josh")->second
[2]["buggy"] = 1004;
130 // Sarah launches on machine 3 kdevelop at time 1010.
132 m
["Sarah"][2].insert(std::make_pair("kdevelop", 1010));
134 // Iterate over all users running applications.
137 std::cout
<< "All users running applications:" << std::endl
;
139 user_machine_pr_map::const_iterator it
= m
.begin();
141 while (it
!= m
.end())
142 std::cout
<< (it
++)->first
<< std::endl
;
145 // Sarah has terminated kdevelop
146 ((l1_t
& )m
).erase(std::make_pair(
147 std::make_pair("Sarah", 2),