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
|
/////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2007-2013
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/intrusive for documentation.
//
/////////////////////////////////////////////////////////////////////////////
#include <boost/intrusive/list.hpp>
#include <boost/intrusive/slist.hpp>
#include <boost/intrusive/set.hpp>
#include <boost/intrusive/unordered_set.hpp>
#include <boost/intrusive/splay_set.hpp>
#include <boost/intrusive/avl_set.hpp>
#include <boost/intrusive/sg_set.hpp>
#include <boost/intrusive/treap_set.hpp>
#include <boost/intrusive/bs_set.hpp>
#include <boost/intrusive/pointer_traits.hpp>
#include "smart_ptr.hpp"
#include <vector>
using namespace boost::intrusive;
class MyClass
: public list_base_hook
< void_pointer<smart_ptr<void> >, link_mode<safe_link> >
, public slist_base_hook
< void_pointer<smart_ptr<void> >, link_mode<safe_link> >
, public set_base_hook
< void_pointer<smart_ptr<void> >, link_mode<safe_link> >
, public unordered_set_base_hook
< void_pointer<smart_ptr<void> >, link_mode<safe_link> >
, public avl_set_base_hook
< void_pointer<smart_ptr<void> >, link_mode<safe_link> >
, public bs_set_base_hook
< void_pointer<smart_ptr<void> >, link_mode<safe_link> >
{
int int_;
public:
MyClass(int i)
: int_(i)
{}
friend bool operator<(const MyClass &l, const MyClass &r)
{ return l.int_ < r.int_; }
friend bool operator==(const MyClass &l, const MyClass &r)
{ return l.int_ == r.int_; }
friend std::size_t hash_value(const MyClass &v)
{ return boost::hash_value(v.int_); }
friend bool priority_order(const MyClass &l, const MyClass &r)
{ return l.int_ < r.int_; }
};
//Define a list that will store MyClass using the public base hook
typedef list<MyClass> List;
typedef slist<MyClass> Slist;
typedef set<MyClass> Set;
typedef unordered_set<MyClass> USet;
typedef avl_set<MyClass> AvlSet;
typedef splay_set<MyClass> SplaySet;
typedef treap_set<MyClass> TreapSet;
typedef sg_set<MyClass> SgSet;
typedef bs_set<MyClass> BsSet;
int main()
{
typedef std::vector<MyClass>::iterator VectIt;
typedef std::vector<MyClass>::reverse_iterator VectRit;
//Create several MyClass objects, each one with a different value
std::vector<MyClass> values;
for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
{
List my_list;
Slist my_slist;
Set my_set;
USet::bucket_type buckets[100];
USet my_uset(USet::bucket_traits(pointer_traits<USet::bucket_ptr>::pointer_to(*buckets), 100));
AvlSet my_avlset;
SplaySet my_splayset;
//Now insert them in the reverse order
//in the base hook intrusive list
for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
my_list.push_front(*it);
my_slist.push_front(*it);
my_set.insert(*it);
my_uset.insert(*it);
my_avlset.insert(*it);
my_splayset.insert(*it);
}
//Now test lists
{
List::const_iterator list_it(my_list.cbegin());
Slist::const_iterator slist_it(my_slist.cbegin());
Set::const_reverse_iterator set_rit(my_set.crbegin());
AvlSet::const_reverse_iterator avl_set_rit(my_avlset.crbegin());
SplaySet::const_reverse_iterator splay_set_rit(my_splayset.crbegin());
VectRit vect_it(values.rbegin()), vect_itend(values.rend());
//Test the objects inserted in the base hook list
for(; vect_it != vect_itend
; ++vect_it, ++list_it
, ++slist_it, ++set_rit
, ++avl_set_rit
, ++splay_set_rit
){
if(&*list_it != &*vect_it) return 1;
if(&*slist_it != &*vect_it) return 1;
if(&*set_rit != &*vect_it) return 1;
if(&*avl_set_rit != &*vect_it) return 1;
if(&*splay_set_rit != &*vect_it)return 1;
if(my_uset.find(*set_rit) == my_uset.cend()) return 1;
}
}
}
//Since treap_set, sg_set & bs_set reuse the hook, treat them apart
{
TreapSet my_treapset;
for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
my_treapset.insert(*it);
}
TreapSet::const_reverse_iterator treap_set_rit(my_treapset.crbegin());
VectRit vect_it(values.rbegin()), vect_itend(values.rend());
for(; vect_it != vect_itend; ++vect_it, ++treap_set_rit){
if(&*treap_set_rit != &*vect_it) return 1;
}
}
{
SgSet my_sgset;
for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
my_sgset.insert(*it);
}
SgSet::const_reverse_iterator sg_set_rit(my_sgset.crbegin());
VectRit vect_it(values.rbegin()), vect_itend(values.rend());
for(; vect_it != vect_itend; ++vect_it, ++sg_set_rit){
if(&*sg_set_rit != &*vect_it) return 1;
}
}
{
BsSet my_bsset;
for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
my_bsset.insert(*it);
}
BsSet::const_reverse_iterator bs_set_rit(my_bsset.crbegin());
VectRit vect_it(values.rbegin()), vect_itend(values.rend());
for(; vect_it != vect_itend; ++vect_it, ++bs_set_rit){
if(&*bs_set_rit != &*vect_it) return 1;
}
}
return 0;
}
|
