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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
// -*- C++ -*-
// Copyright (C) 2005 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING. If not, write to the Free
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
// USA.
// As a special exception, you may use this file as part of a free software
// library without restriction. Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// the GNU General Public License. This exception does not however
// invalidate any other reasons why the executable file might be covered by
// the GNU General Public License.
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
// Permission to use, copy, modify, sell, and distribute this software
// is hereby granted without fee, provided that the above copyright
// notice appears in all copies, and that both that copyright notice and
// this permission notice appear in supporting documentation. None of
// the above authors, nor IBM Haifa Research Laboratories, make any
// representation about the suitability of this software for any
// purpose. It is provided "as is" without express or implied warranty.
/**
* @file mapping_level_example.cpp
* A basic example showing how to use different mapping levels.
*/
// For cout, endl.
#include <iostream>
// For various associative containers.
#include <ext/pb_assoc/assoc_cntnr.hpp>
// For compound_data_type.
#include <ext/pb_assoc/data_type.hpp>
// For sting.
#include <string>
// For assert.
#include <cassert>
// For unary_function.
#include <functional>
typedef std::string user_name;
typedef unsigned long machine_id;
typedef std::string process_name;
typedef float running_time;
typedef
pb_assoc::lu_assoc_cntnr<
process_name,
running_time>
pr_name_rn_time_map;
typedef
pb_assoc::lu_assoc_cntnr<
machine_id,
pb_assoc::compound_data_type<
pr_name_rn_time_map> >
machine_pr_map;
typedef
pb_assoc::lu_assoc_cntnr<
user_name,
pb_assoc::compound_data_type<
machine_pr_map> >
user_machine_pr_map;
typedef user_machine_pr_map::rebind<2>::other l2_t;
typedef user_machine_pr_map::rebind<1>::other l1_t;
struct is_same_proc : public std::unary_function<
l1_t::iterator::const_reference,
bool>
{
is_same_proc(const process_name& r_proc) : m_proc(r_proc)
{
};
bool
operator()(l1_t::iterator::const_reference r_val)
{
return (r_val.first.second == m_proc);
}
private:
process_name m_proc;
};
int main()
{
user_machine_pr_map m;
/**
* Following shows different ways to insert into a user_machine_pr_map object.
**/
// Josh launches on machine 1 firefox at time 1000.
m["Josh"][1]["firefox"] = 1000;
// Ben launches on machine 1 python at time 1003.
((l1_t& )m)[std::make_pair(
std::make_pair("Ben", 1),
"python")] = 1003;
// Josh launches on machine 2 buggy at time 1004.
m.find("Josh")->second[2]["buggy"] = 1004;
// Sarah launches on machine 3 kdevelop at time 1010.
m["Sarah"][2].insert(std::make_pair("kdevelop", 1010));
// Iterate over all users running applications.
{
std::cout << "All users running applications:" << std::endl;
user_machine_pr_map::const_iterator it = m.begin();
while (it != m.end())
std::cout << (it++)->first << std::endl;
}
// Sarah has terminated kdevelop
((l1_t& )m).erase(std::make_pair(
std::make_pair("Sarah", 2),
"kdevelop"));
}
|
