2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
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.
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.
31 #include "tree/hdr_bronson_avltree_map.h"
32 #include <cds/urcu/general_instant.h>
33 #include <cds/container/bronson_avltree_map_rcu.h>
35 #include "unit/print_bronsonavltree_stat.h"
38 namespace cc = cds::container;
39 namespace co = cds::opt;
41 typedef cds::urcu::gc< cds::urcu::general_instant<> > rcu_type;
44 template <typename Tree>
45 void operator()( Tree const& t )
47 std::cout << t.statistics();
52 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_less()
55 cc::bronson_avltree::make_traits<
56 co::less< std::less<key_type> >
57 ,cc::bronson_avltree::relaxed_insert< false >
60 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
61 test<map_type, print_stat>();
64 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_less_stat()
67 cc::bronson_avltree::make_traits<
68 co::less< std::less<key_type> >
69 ,co::stat< cc::bronson_avltree::stat<> >
70 ,cc::bronson_avltree::relaxed_insert< false >
73 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
74 test<map_type, print_stat>();
77 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_cmp()
80 cc::bronson_avltree::make_traits<
81 co::compare< compare >
84 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
85 test<map_type, print_stat>();
88 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_cmp_stat()
91 cc::bronson_avltree::make_traits<
92 co::compare< compare >
93 ,co::stat< cc::bronson_avltree::stat<> >
96 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
97 test<map_type, print_stat>();
100 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_cmpless()
102 struct traits: public
103 cc::bronson_avltree::make_traits<
104 co::compare< compare >
105 ,co::less< std::less<key_type> >
108 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
109 test<map_type, print_stat>();
112 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_less_ic()
114 struct traits: public
115 cc::bronson_avltree::make_traits<
116 co::less< std::less<key_type> >
117 ,co::item_counter< cds::atomicity::item_counter >
120 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
121 test<map_type, print_stat>();
124 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_cmp_ic()
126 struct traits: public
127 cc::bronson_avltree::make_traits<
128 co::compare< compare >
129 ,co::item_counter< cds::atomicity::item_counter >
132 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
133 test<map_type, print_stat>();
136 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_cmp_ic_stat()
138 struct traits: public
139 cc::bronson_avltree::make_traits<
140 co::compare< compare >
141 ,co::item_counter< cds::atomicity::item_counter >
142 ,co::stat< cc::bronson_avltree::stat<> >
145 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
146 test<map_type, print_stat>();
149 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_cmp_ic_stat_yield()
151 struct traits: public
152 cc::bronson_avltree::make_traits<
153 co::compare< compare >
154 ,co::item_counter< cds::atomicity::item_counter >
155 ,co::stat< cc::bronson_avltree::stat<> >
156 ,co::back_off< cds::backoff::yield >
159 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
160 test<map_type, print_stat>();
163 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_less_relaxed_insert()
165 struct traits: public
166 cc::bronson_avltree::make_traits<
167 co::less< std::less<key_type> >
168 ,cc::bronson_avltree::relaxed_insert< true >
171 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
172 test<map_type, print_stat>();
175 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_gpi_less_relaxed_insert_stat()
177 struct traits: public
178 cc::bronson_avltree::make_traits<
179 co::less< std::less<key_type> >
180 ,co::stat< cc::bronson_avltree::stat<> >
181 ,cc::bronson_avltree::relaxed_insert< true >
184 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
185 test<map_type, print_stat>();