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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
|
// file : tests/container/multi-index/driver.cxx
// copyright : Copyright (c) 2009-2013 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#include <map>
#include <list>
#include <string>
#include <cassert>
#include <iostream>
#include <cutl/container/multi-index.hxx>
using namespace std;
using namespace cutl::container;
struct person
{
person (const string& e, const string& f, const string& l, unsigned short a)
: email (e), first (f), last (l), age (a) {}
const string email;
const string first;
const string last;
unsigned short age;
};
struct person_email_set
{
typedef map<key<string>, person> email_map;
typedef map_const_iterator<email_map> const_iterator;
pair<const_iterator, bool>
insert (const person& v)
{
pair<email_map::iterator, bool> r (
email_map_.insert (email_map::value_type (v.email, v)));
const_iterator i (r.first);
if (r.second)
r.first->first.assign (i->email);
return make_pair (i, r.second);
}
const_iterator
find (const string& email) const
{
return email_map_.find (email);
}
const_iterator begin () const {return email_map_.begin ();}
const_iterator end () const {return email_map_.end ();}
private:
email_map email_map_;
};
struct person_name_set
{
typedef key<string, string> name_key;
typedef map<name_key, person> name_map;
typedef map_const_iterator<name_map> const_iterator;
pair<const_iterator, bool>
insert (const person& v)
{
pair<name_map::iterator, bool> r (
name_map_.insert (
name_map::value_type (name_key (v.first, v.last), v)));
const_iterator i (r.first);
if (r.second)
r.first->first.assign (i->first, i->last);
return make_pair (i, r.second);
}
const_iterator
find (const string& first, const string& last) const
{
return name_map_.find (name_key (first, last));
}
const_iterator begin () const {return name_map_.begin ();}
const_iterator end () const {return name_map_.end ();}
private:
name_map name_map_;
};
struct person_email_name_set
{
typedef key<string, string> name_key;
typedef map<name_key, person> name_map;
typedef map_iterator<name_map> iterator;
typedef map_const_iterator<name_map> const_iterator;
typedef map<key<string>, iterator> email_map;
pair<iterator, bool>
insert (const person& v)
{
// First check that we don't have any collisions in the secondary
// indexes.
//
{
email_map::iterator i (email_map_.find (v.email));
if (i != email_map_.end ())
return make_pair (i->second, false);
}
pair<name_map::iterator, bool> r (
name_map_.insert (
name_map::value_type (name_key (v.first, v.last), v)));
iterator i (r.first);
if (r.second)
{
r.first->first.assign (i->first, i->last);
email_map_.insert (email_map::value_type (i->email, i));
}
return make_pair (i, r.second);
}
iterator
find (const string& first, const string& last)
{
return name_map_.find (name_key (first, last));
}
const_iterator
find (const string& first, const string& last) const
{
return name_map_.find (name_key (first, last));
}
iterator
find (const string& email)
{
email_map::iterator i (email_map_.find (email));
return i != email_map_.end () ? i->second : end ();
}
const_iterator
find (const string& email) const
{
email_map::const_iterator i (email_map_.find (email));
return i != email_map_.end () ? i->second : end ();
}
void
erase (iterator i )
{
email_map_.erase (i->email);
name_map_.erase (i);
}
iterator begin () {return name_map_.begin ();}
const_iterator begin () const {return name_map_.begin ();}
iterator end () {return name_map_.end ();}
const_iterator end () const {return name_map_.end ();}
private:
name_map name_map_;
email_map email_map_;
};
struct person_list_email_set
{
typedef list<person> person_list;
typedef person_list::iterator iterator;
typedef person_list::const_iterator const_iterator;
typedef map<key<string>, iterator> email_map;
pair<iterator, bool>
insert (const person& v)
{
// First check that we don't have any collisions in the secondary
// indexes.
//
{
email_map::iterator i (email_map_.find (v.email));
if (i != email_map_.end ())
return make_pair (i->second, false);
}
iterator i (person_list_.insert (end (), v));
email_map_.insert (email_map::value_type (i->email, i));
return make_pair (i, true);
}
iterator
find (const string& email)
{
email_map::iterator i (email_map_.find (email));
return i != email_map_.end () ? i->second : end ();
}
const_iterator
find (const string& email) const
{
email_map::const_iterator i (email_map_.find (email));
return i != email_map_.end () ? i->second : end ();
}
iterator begin () {return person_list_.begin ();}
const_iterator begin () const {return person_list_.begin ();}
iterator end () {return person_list_.end ();}
const_iterator end () const {return person_list_.end ();}
private:
person_list person_list_;
email_map email_map_;
};
int
main ()
{
{
person_email_set s;
assert (s.insert (person ("john@doe.com", "John", "Doe", 20)).second);
assert (s.insert (person ("jane@doe.com", "Jane", "Doe", 21)).second);
assert (!s.insert (person ("john@doe.com", "Johnny", "Doe", 22)).second);
assert (s.find ("john@doe.com") != s.end ());
assert (s.find ("jane@doe.com") != s.end ());
assert (s.find ("john@doe.org") == s.end ());
}
{
person_name_set s;
assert (s.insert (person ("john@doe.com", "John", "Doe", 20)).second);
assert (s.insert (person ("jane@doe.com", "Jane", "Doe", 21)).second);
assert (!s.insert (person ("john@doe.org", "John", "Doe", 22)).second);
assert (s.find ("John", "Doe") != s.end ());
assert (s.find ("Jane", "Doe") != s.end ());
assert (s.find ("Johnny", "Doe") == s.end ());
}
{
person_email_name_set s;
person_email_name_set const& cs (s);
assert (s.insert (person ("john@doe.com", "John", "Doe", 20)).second);
assert (s.insert (person ("jane@doe.com", "Jane", "Doe", 21)).second);
assert (!s.insert (person ("john@doe.org", "John", "Doe", 22)).second);
assert (!s.insert (person ("john@doe.com", "Johnny", "Doe", 23)).second);
assert (s.find ("John", "Doe") != s.end ());
assert (cs.find ("Jane", "Doe") != cs.end ());
assert (s.find ("john@doe.com") != s.end ());
assert (cs.find ("jane@doe.com") != s.end ());
assert (s.find ("Johnny", "Doe") == s.end ());
assert (cs.find ("john@doe.org") == s.end ());
person_email_name_set::iterator i (s.find ("John", "Doe"));
i->age++;
s.erase (i);
assert (s.find ("John", "Doe") == s.end ());
assert (s.find ("john@doe.com") == s.end ());
}
{
person_list_email_set s;
assert (s.insert (person ("john@doe.com", "John", "Doe", 20)).second);
assert (s.insert (person ("jane@doe.com", "Jane", "Doe", 21)).second);
assert (!s.insert (person ("john@doe.com", "Johnny", "Doe", 22)).second);
assert (s.find ("john@doe.com") != s.end ());
assert (s.find ("jane@doe.com") != s.end ());
assert (s.find ("jane@doe.org") == s.end ());
person_list_email_set::iterator i (s.begin ());
assert (i != s.end () && i->email == "john@doe.com");
assert (++i != s.end () && i->email == "jane@doe.com");
assert (++i == s.end ());
}
}
|
