Fixed emplace()
[libcds.git] / tests / test-hdr / tree / hdr_intrusive_ellen_bintree_hp_member.cpp
1 /*
2     This file is a part of libcds - Concurrent Data Structures library
3
4     (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
5
6     Source code repo: http://github.com/khizmax/libcds/
7     Download: http://sourceforge.net/projects/libcds/files/
8     
9     Redistribution and use in source and binary forms, with or without
10     modification, are permitted provided that the following conditions are met:
11
12     * Redistributions of source code must retain the above copyright notice, this
13       list of conditions and the following disclaimer.
14
15     * Redistributions in binary form must reproduce the above copyright notice,
16       this list of conditions and the following disclaimer in the documentation
17       and/or other materials provided with the distribution.
18
19     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20     AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21     IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22     DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23     FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24     DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25     SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26     CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27     OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28     OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.     
29 */
30
31 #include "tree/hdr_intrusive_bintree.h"
32 #include <cds/intrusive/ellen_bintree_hp.h>
33
34 #include "tree/hdr_intrusive_ellen_bintree_pool_hp.h"
35 #include "unit/print_ellenbintree_stat.h"
36
37 namespace tree {
38     namespace ci = cds::intrusive;
39     namespace co = cds::opt;
40     namespace {
41         typedef ci::ellen_bintree::node<cds::gc::HP>                        leaf_node;
42         typedef IntrusiveBinTreeHdrTest::member_hook_value< leaf_node >     member_value;
43
44         typedef ci::opt::hook< ci::ellen_bintree::member_hook< offsetof(member_value, hook), co::gc< cds::gc::HP > > > member_hook;
45
46         struct print_stat {
47             template <typename Tree>
48             void operator()( Tree const& t)
49             {
50                 std::cout << t.statistics();
51             }
52         };
53
54         typedef ci::ellen_bintree::internal_node< IntrusiveBinTreeHdrTest::key_type, leaf_node > internal_node;
55         typedef ci::ellen_bintree::update_desc< leaf_node, internal_node >   update_desc;
56     }
57
58     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_less()
59     {
60         struct tree_traits : public ci::ellen_bintree::traits
61         {
62             typedef ci::ellen_bintree::member_hook< offsetof( member_value, hook ), co::gc< cds::gc::HP >> hook;
63             typedef IntrusiveBinTreeHdrTest::key_extractor< member_value > key_extractor;
64             typedef IntrusiveBinTreeHdrTest::less< member_value > less;
65             typedef IntrusiveBinTreeHdrTest::disposer< member_value > disposer;
66         };
67         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
68             ci::ellen_bintree::make_traits<
69                 member_hook
70                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
71                 ,co::less< less< member_value > >
72                 ,ci::opt::disposer< disposer< member_value > >
73             >::type
74         > tree_type;
75
76         test<tree_type, print_stat>();
77     }
78
79     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_less_stat()
80     {
81         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
82             ci::ellen_bintree::make_traits<
83                 member_hook
84                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
85                 ,co::less< less< member_value > >
86                 ,ci::opt::disposer< disposer< member_value > >
87                 ,co::stat< ci::ellen_bintree::stat<> >
88             >::type
89         > tree_type;
90
91         test<tree_type, print_stat>();
92     }
93
94     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_cmp()
95     {
96         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
97             ci::ellen_bintree::make_traits<
98                 member_hook
99                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
100                 ,co::compare< compare< member_value > >
101                 ,ci::opt::disposer< disposer< member_value > >
102             >::type
103         > tree_type;
104
105         test<tree_type, print_stat>();
106     }
107
108     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_cmpless()
109     {
110         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
111             ci::ellen_bintree::make_traits<
112                 member_hook
113                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
114                 ,co::compare< compare< member_value > >
115                 ,co::less< less< member_value > >
116                 ,ci::opt::disposer< disposer< member_value > >
117             >::type
118         > tree_type;
119
120         test<tree_type, print_stat>();
121     }
122
123     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_less_ic()
124     {
125         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
126             ci::ellen_bintree::make_traits<
127                 member_hook
128                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
129                 ,co::less< less< member_value > >
130                 ,ci::opt::disposer< disposer< member_value > >
131                 ,co::item_counter< cds::atomicity::item_counter >
132             >::type
133         > tree_type;
134
135         test<tree_type, print_stat>();
136     }
137
138     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_cmp_ic()
139     {
140         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
141             ci::ellen_bintree::make_traits<
142                 member_hook
143                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
144                 ,co::compare< compare< member_value > >
145                 ,ci::opt::disposer< disposer< member_value > >
146                 ,co::item_counter< cds::atomicity::item_counter >
147             >::type
148         > tree_type;
149
150         test<tree_type, print_stat>();
151     }
152
153     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_cmp_ic_stat()
154     {
155         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
156             ci::ellen_bintree::make_traits<
157                 member_hook
158                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
159                 ,co::compare< compare< member_value > >
160                 ,ci::opt::disposer< disposer< member_value > >
161                 ,co::item_counter< cds::atomicity::item_counter >
162                 ,co::stat< ci::ellen_bintree::stat<> >
163             >::type
164         > tree_type;
165
166         test<tree_type, print_stat>();
167     }
168
169     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_cmp_ic_stat_yield()
170     {
171         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
172             ci::ellen_bintree::make_traits<
173                 member_hook
174                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
175                 ,co::compare< compare< member_value > >
176                 ,ci::opt::disposer< disposer< member_value > >
177                 ,co::item_counter< cds::atomicity::item_counter >
178                 ,co::stat< ci::ellen_bintree::stat<> >
179                 , co::back_off< cds::backoff::yield >
180             >::type
181         > tree_type;
182
183         test<tree_type, print_stat>();
184     }
185
186     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_less_pool()
187     {
188         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
189             ci::ellen_bintree::make_traits<
190                 member_hook
191                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
192                 ,co::less< less< member_value > >
193                 ,ci::opt::disposer< disposer< member_value > >
194                 ,co::node_allocator< cds::memory::pool_allocator< internal_node, ellen_bintree_hp::internal_node_pool_accessor > >
195                 ,ci::ellen_bintree::update_desc_allocator< cds::memory::pool_allocator< update_desc, ellen_bintree_hp::update_desc_pool_accessor > >
196             >::type
197         > tree_type;
198
199         test<tree_type, print_stat>();
200     }
201
202     void IntrusiveBinTreeHdrTest::EllenBinTree_hp_member_less_pool_ic_stat()
203     {
204         typedef ci::EllenBinTree< cds::gc::HP, key_type, member_value,
205             ci::ellen_bintree::make_traits<
206                 member_hook
207                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
208                 ,co::less< less< member_value > >
209                 ,ci::opt::disposer< disposer< member_value > >
210                 ,co::node_allocator< cds::memory::pool_allocator< internal_node, ellen_bintree_hp::internal_node_pool_accessor > >
211                 ,ci::ellen_bintree::update_desc_allocator< cds::memory::pool_allocator< update_desc, ellen_bintree_hp::update_desc_pool_accessor > >
212                 ,co::item_counter< cds::atomicity::item_counter >
213                 ,co::stat< ci::ellen_bintree::stat<> >
214             >::type
215         > tree_type;
216
217         test<tree_type, print_stat>();
218     }
219
220
221 } //namespace tree