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
|
// -*- 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 ds_traits_example.cpp
* A basic example showing how to use ds_traits for querying container types
* for their behavior.
*/
// For various associative containers.
#include <ext/pb_assoc/assoc_cntnr.hpp>
// For ds_traits.
#include <ext/pb_assoc/ds_trait.hpp>
// For cout, endl.
#include <iostream>
template<class DS_Category>
void
print_ds_category(DS_Category);
template<>
void
print_ds_category(pb_assoc::cc_hash_ds_tag)
{
std::cout << "Collision-chaining hash based associative-container:" <<
std::endl;
}
template<>
void
print_ds_category(pb_assoc::gp_hash_ds_tag)
{
std::cout << "Probing hash based associative-container:" <<
std::endl;
}
template<>
void
print_ds_category(pb_assoc::rb_tree_ds_tag)
{
std::cout << "Red-black tree associative-container:" <<
std::endl;
}
template<>
void
print_ds_category(pb_assoc::splay_tree_ds_tag)
{
std::cout << "Splay tree associative-container:" <<
std::endl;
}
template<>
void
print_ds_category(pb_assoc::ov_tree_ds_tag)
{
std::cout << "Ordered-vector tree associative-container:" <<
std::endl;
}
template<>
void
print_ds_category(pb_assoc::lu_ds_tag)
{
std::cout << "List-based associative-container:" <<
std::endl;
}
void
print_erase_can_throw(bool can)
{
if (can)
{
std::cout << "Erase can throw" << std::endl;
return;
}
std::cout << "Erase cannot throw" << std::endl;
}
void
print_order_preserving(bool does)
{
if (does)
{
std::cout << "Preserves order" << std::endl;
return;
}
std::cout << "Does not preserve order" << std::endl;
}
void
print_erase_iterators(bool can)
{
if (can)
{
std::cout << "Can erase iterators" << std::endl;
return;
}
std::cout << "Cannot erase iterators" << std::endl;
}
template<class Invalidation_Guarantee>
void
print_invalidation_guarantee(Invalidation_Guarantee);
template<>
void
print_invalidation_guarantee(pb_assoc::basic_invalidation_guarantee)
{
std::cout << "Guarantees only that found references, pointers, and "
"iterators are valid as long as the container object is not "
"modified" << std::endl;
}
template<>
void
print_invalidation_guarantee(pb_assoc::find_invalidation_guarantee)
{
std::cout << "Guarantees that found references, pointers, and "
"find_iterators are valid even if the container object "
"is modified" << std::endl;
}
template<>
void
print_invalidation_guarantee(pb_assoc::range_invalidation_guarantee)
{
std::cout << "Guarantees that iterators remain valid even if the "
"container object is modified" << std::endl;
}
void
print_reverse_iteration(bool does)
{
if (does)
{
std::cout << "Supports reverse iteration" << std::endl;
return;
}
std::cout << "Does not support reverse iteration" << std::endl;
}
void
print_split_join(bool does)
{
if (does)
{
std::cout << "Supports split and join" << std::endl;
return;
}
std::cout << "Does not support split and join" << std::endl;
}
template<class Cntnr>
void
print_container_attributes()
{
// First print out the data-structure category.
print_ds_category(typename Cntnr::ds_category());
// Next is the data-structure traits class of the container.
typedef pb_assoc::ds_traits< Cntnr> traits;
// Now print the attributes of the container.
print_erase_can_throw(traits::erase_can_throw);
print_order_preserving(traits::order_preserving);
print_erase_iterators(traits::erase_iterators);
print_invalidation_guarantee(typename traits::invalidation_guarantee());
print_reverse_iteration(traits::reverse_iteration);
print_split_join(traits::split_join);
std::cout << std::endl << std::endl;
}
int
main()
{
print_container_attributes<pb_assoc::cc_hash_assoc_cntnr<int, char> >();
print_container_attributes<pb_assoc::gp_hash_assoc_cntnr<int, char> >();
print_container_attributes<pb_assoc::tree_assoc_cntnr<int, char> >();
print_container_attributes<pb_assoc::tree_assoc_cntnr<
int,
char,
std::less<int>,
pb_assoc::splay_tree_ds_tag> >();
print_container_attributes<pb_assoc::tree_assoc_cntnr<
int,
char,
std::less<int>,
pb_assoc::ov_tree_ds_tag> >();
print_container_attributes<pb_assoc::lu_assoc_cntnr<int, char> >();
typedef
pb_assoc::lu_assoc_cntnr<
int,
pb_assoc::compound_data_type<
pb_assoc::gp_hash_assoc_cntnr<
char,
pb_assoc::null_data_type> > >
mmap_t;
print_container_attributes<mmap_t>();
}
|
