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.
35 class Map_find_string: public cds_test::stress_fixture
38 static size_t s_nThreadCount; // thread count
39 static size_t s_nMapSize; // map size (count of searching item)
40 static size_t s_nPercentExists; // percent of existing keys in searching sequence
41 static size_t s_nPassCount;
42 static size_t s_nBronsonAVLTreeMapPassCount;
43 static size_t s_nEllenBinTreeMapPassCount;
44 static size_t s_nFeldmanPassCount;
45 static size_t s_nMichaelMapPassCount;
46 static size_t s_nSkipListMapPassCount;
47 static size_t s_nSplitListMapPassCount;
49 static size_t s_nMaxLoadFactor; // maximum load factor
51 static size_t s_nCuckooInitialSize; // initial size for CuckooMap
52 static size_t s_nCuckooProbesetSize; // CuckooMap probeset size (only for list-based probeset)
53 static size_t s_nCuckooProbesetThreshold; // CUckooMap probeset threshold (o - use default)
55 static size_t s_nFeldmanMap_HeadBits;
56 static size_t s_nFeldmanMap_ArrayBits;
58 static size_t s_nLoadFactor; // current load factor
60 typedef std::string key_type;
62 std::string const* pKey;
63 bool bExists ; // true - key in map, false - key not in map
66 typedef std::vector<value_type> value_vector;
67 static std::vector<std::string> s_arrString;
68 static value_vector s_Data;
70 static void SetUpTestCase();
71 static void TearDownTestCase();
73 static void setup_test_case();
74 static std::vector<size_t> get_load_factors();
77 template <typename Iterator, typename Map>
78 static bool check_result( Iterator const& it, Map const& map )
80 return it != map.end();
82 template <typename Map>
83 static bool check_result( bool b, Map const& )
89 class Worker: public cds_test::thread
91 typedef cds_test::thread base_class;
104 Worker( cds_test::thread_pool& pool, Map& map )
111 Worker( Worker& src )
118 virtual thread * clone()
120 return new Worker( *this );
124 size_t const nPassCount = s_nPassCount;
127 for (size_t nPass = 0; nPass < nPassCount; ++nPass) {
128 auto itEnd = s_Data.cend();
129 for (auto it = s_Data.cbegin(); it != itEnd; ++it) {
130 auto bFound = rMap.contains(*(it->pKey));
132 if (check_result(bFound, rMap))
133 ++m_KeyExists.nSuccess;
135 ++m_KeyExists.nFailed;
137 if (check_result(bFound, rMap))
138 ++m_KeyNotExists.nFailed;
140 ++m_KeyNotExists.nSuccess;
148 template <typename Hash>
149 static void fill_string_array();
152 void test( Map& testMap )
154 typedef Worker<Map> worker;
157 for ( size_t i = 0; i < s_Data.size(); ++i ) {
158 // All keys in arrData are unique, insert() must be successful
159 if ( s_Data[i].bExists ) {
160 EXPECT_TRUE( check_result( testMap.insert( *(s_Data[i].pKey), s_Data[i] ), testMap ));
164 cds_test::thread_pool &pool = get_pool();
165 std::unique_ptr<worker> worker_thread(new worker(pool, testMap));
166 worker_thread->test();
169 additional_cleanup(testMap);
175 ASSERT_GT( s_Data.size(), 0u );
177 Map testMap( *this );
182 void run_bronson_avl_tree() {
183 Map_find_string::s_nPassCount =
184 Map_find_string::s_nBronsonAVLTreeMapPassCount;
189 void run_ellen_bin_tree() {
190 Map_find_string::s_nPassCount =
191 Map_find_string::s_nEllenBinTreeMapPassCount;
197 Map_find_string::s_nPassCount =
198 Map_find_string::s_nFeldmanPassCount;
204 Map_find_string::s_nPassCount =
205 Map_find_string::s_nMichaelMapPassCount;
210 void run_skip_list() {
211 Map_find_string::s_nPassCount =
212 Map_find_string::s_nSkipListMapPassCount;
217 void run_split_list() {
218 Map_find_string::s_nPassCount =
219 Map_find_string::s_nSplitListMapPassCount;
225 class Map_find_string_stdhash: public Map_find_string
228 static void SetUpTestCase();
233 Map_find_string::run_test<Map>();
237 #if CDS_BUILD_BITS == 64
238 class Map_find_string_city32: public Map_find_string
241 static void SetUpTestCase();
246 Map_find_string::run_test<Map>();
250 class Map_find_string_city64: public Map_find_string
253 static void SetUpTestCase();
258 Map_find_string::run_test<Map>();
262 class Map_find_string_city128: public Map_find_string
265 static void SetUpTestCase();
270 Map_find_string::run_test<Map>();
274 #endif // #if CDS_BUILD_BITS == 64
276 class Map_find_string_LF: public Map_find_string
277 , public ::testing::WithParamInterface<size_t>
283 s_nLoadFactor = GetParam();
284 propout() << std::make_pair( "load_factor", s_nLoadFactor );
285 Map_find_string::run_test<Map>();