2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
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 "test_map_nogc.h"
33 #include <cds/container/lazy_kvlist_nogc.h>
34 #include <cds/container/michael_map_nogc.h>
37 namespace cc = cds::container;
38 typedef cds::gc::nogc gc_type;
40 class MichaelLazyMap_NoGC : public cds_test::container_map_nogc
43 typedef cds_test::container_map_nogc base_class;
52 TEST_F( MichaelLazyMap_NoGC, compare )
54 typedef cc::LazyKVList< gc_type, key_type, value_type,
55 typename cc::lazy_list::make_traits<
56 cds::opt::compare< cmp >
60 typedef cc::MichaelHashMap< gc_type, list_type,
61 typename cc::michael_map::make_traits<
62 cds::opt::hash< hash1 >
66 map_type m( kSize, 2 );
70 TEST_F( MichaelLazyMap_NoGC, less )
72 typedef cc::LazyKVList< gc_type, key_type, value_type,
73 typename cc::lazy_list::make_traits<
74 cds::opt::less< base_class::less >
78 typedef cc::MichaelHashMap< gc_type, list_type,
79 typename cc::michael_map::make_traits<
80 cds::opt::hash< hash1 >
84 map_type m( kSize, 2 );
88 TEST_F( MichaelLazyMap_NoGC, cmpmix )
90 struct list_traits : public cc::lazy_list::traits
92 typedef base_class::less less;
95 typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
97 typedef cc::MichaelHashMap< gc_type, list_type,
98 typename cc::michael_map::make_traits<
99 cds::opt::hash< hash1 >
103 map_type m( kSize, 2 );
107 TEST_F( MichaelLazyMap_NoGC, backoff )
109 struct list_traits : public cc::lazy_list::traits
112 typedef cds::backoff::exponential<cds::backoff::pause, cds::backoff::yield> back_off;
114 typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
116 struct map_traits : public cc::michael_map::traits
119 typedef cds::atomicity::item_counter item_counter;
121 typedef cc::MichaelHashMap< gc_type, list_type, map_traits >map_type;
123 map_type m( kSize, 4 );
127 TEST_F( MichaelLazyMap_NoGC, seq_cst )
129 struct list_traits : public cc::lazy_list::traits
131 typedef base_class::less less;
132 typedef cds::backoff::pause back_off;
133 typedef cds::opt::v::sequential_consistent memory_model;
135 typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
137 struct map_traits : public cc::michael_map::traits
140 typedef cds::atomicity::item_counter item_counter;
142 typedef cc::MichaelHashMap< gc_type, list_type, map_traits >map_type;
144 map_type m( kSize, 4 );
148 TEST_F( MichaelLazyMap_NoGC, mutex )
150 struct list_traits : public cc::lazy_list::traits
152 typedef base_class::less less;
153 typedef cds::backoff::pause back_off;
154 typedef std::mutex lock_type;
156 typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
158 struct map_traits : public cc::michael_map::traits
161 typedef cds::atomicity::item_counter item_counter;
163 typedef cc::MichaelHashMap< gc_type, list_type, map_traits > map_type;
165 map_type m( kSize, 4 );
169 TEST_F( MichaelLazyMap_NoGC, stat )
171 struct list_traits: public cc::lazy_list::traits
173 typedef base_class::less less;
174 typedef cds::backoff::pause back_off;
175 typedef cc::lazy_list::stat<> stat;
177 typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
179 struct map_traits: public cc::michael_map::traits
182 typedef cds::atomicity::item_counter item_counter;
184 typedef cc::MichaelHashMap< gc_type, list_type, map_traits > map_type;
186 map_type m( kSize, 4 );
188 EXPECT_GE( m.statistics().m_nInsertSuccess, 0u );
191 TEST_F( MichaelLazyMap_NoGC, wrapped_stat )
193 struct list_traits: public cc::lazy_list::traits
195 typedef base_class::less less;
196 typedef cds::backoff::pause back_off;
197 typedef cc::lazy_list::wrapped_stat<> stat;
199 typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
201 struct map_traits: public cc::michael_map::traits
204 typedef cds::atomicity::item_counter item_counter;
206 typedef cc::MichaelHashMap< gc_type, list_type, map_traits > map_type;
208 map_type m( kSize, 4 );
210 EXPECT_GE( m.statistics().m_nInsertSuccess, 0u );