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;
48 static size_t s_nMaxLoadFactor; // maximum load factor
50 static size_t s_nCuckooInitialSize; // initial size for CuckooMap
51 static size_t s_nCuckooProbesetSize; // CuckooMap probeset size (only for list-based probeset)
52 static size_t s_nCuckooProbesetThreshold; // CUckooMap probeset threshold (o - use default)
54 static size_t s_nFeldmanMap_HeadBits;
55 static size_t s_nFeldmanMap_ArrayBits;
57 static size_t s_nLoadFactor; // current load factor
59 typedef std::string key_type;
61 std::string const* pKey;
62 bool bExists ; // true - key in map, false - key not in map
65 typedef std::vector<value_type> value_vector;
66 static std::vector<std::string> s_arrString;
67 static value_vector s_Data;
69 static void SetUpTestCase();
70 static void TearDownTestCase();
72 static void setup_test_case();
73 static std::vector<size_t> get_load_factors();
76 template <typename Iterator, typename Map>
77 static bool check_result( Iterator const& it, Map const& map )
79 return it != map.end();
81 template <typename Map>
82 static bool check_result( bool b, Map const& )
88 class Worker: public cds_test::thread
90 typedef cds_test::thread base_class;
103 Worker( cds_test::thread_pool& pool, Map& map )
110 Worker( Worker& src )
117 virtual thread * clone()
119 return new Worker( *this );
123 size_t const nPassCount = s_nPassCount;
126 for (size_t nPass = 0; nPass < nPassCount; ++nPass) {
127 auto itEnd = s_Data.cend();
128 for (auto it = s_Data.cbegin(); it != itEnd; ++it) {
129 auto bFound = rMap.contains(*(it->pKey));
131 if (check_result(bFound, rMap))
132 ++m_KeyExists.nSuccess;
134 ++m_KeyExists.nFailed;
136 if (check_result(bFound, rMap))
137 ++m_KeyNotExists.nFailed;
139 ++m_KeyNotExists.nSuccess;
147 template <typename Hash>
148 static void fill_string_array();
151 void test( Map& testMap )
153 typedef Worker<Map> worker;
156 for ( size_t i = 0; i < s_Data.size(); ++i ) {
157 // All keys in arrData are unique, insert() must be successful
158 if ( s_Data[i].bExists ) {
159 EXPECT_TRUE( check_result( testMap.insert( *(s_Data[i].pKey), s_Data[i] ), testMap ));
163 cds_test::thread_pool &pool = get_pool();
164 std::unique_ptr<worker> worker_thread(new worker(pool, testMap));
165 worker_thread->test();
168 additional_cleanup(testMap);
174 ASSERT_GT( s_Data.size(), 0u );
176 Map testMap( *this );
181 void run_bronson_avl_tree() {
182 Map_find_string::s_nPassCount =
183 Map_find_string::s_nBronsonAVLTreeMapPassCount;
188 void run_ellen_bin_tree() {
189 Map_find_string::s_nPassCount =
190 Map_find_string::s_nEllenBinTreeMapPassCount;
196 Map_find_string::s_nPassCount =
197 Map_find_string::s_nFeldmanPassCount;
203 Map_find_string::s_nPassCount =
204 Map_find_string::s_nMichaelMapPassCount;
209 void run_skip_list() {
210 Map_find_string::s_nPassCount =
211 Map_find_string::s_nSkipListMapPassCount;
217 class Map_find_string_stdhash: public Map_find_string
220 static void SetUpTestCase();
225 Map_find_string::run_test<Map>();
229 #if CDS_BUILD_BITS == 64
230 class Map_find_string_city32: public Map_find_string
233 static void SetUpTestCase();
238 Map_find_string::run_test<Map>();
242 class Map_find_string_city64: public Map_find_string
245 static void SetUpTestCase();
250 Map_find_string::run_test<Map>();
254 class Map_find_string_city128: public Map_find_string
257 static void SetUpTestCase();
262 Map_find_string::run_test<Map>();
266 #endif // #if CDS_BUILD_BITS == 64
268 class Map_find_string_LF: public Map_find_string
269 , public ::testing::WithParamInterface<size_t>
275 s_nLoadFactor = GetParam();
276 propout() << std::make_pair( "load_factor", s_nLoadFactor );
277 Map_find_string::run_test<Map>();