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.
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_nMaxLoadFactor; // maximum load factor
44 static size_t s_nCuckooInitialSize; // initial size for CuckooMap
45 static size_t s_nCuckooProbesetSize; // CuckooMap probeset size (only for list-based probeset)
46 static size_t s_nCuckooProbesetThreshold; // CUckooMap probeset threshold (o - use default)
48 static size_t s_nFeldmanMap_HeadBits;
49 static size_t s_nFeldmanMap_ArrayBits;
51 static size_t s_nLoadFactor; // current load factor
53 typedef std::string key_type;
55 std::string const* pKey;
56 bool bExists ; // true - key in map, false - key not in map
59 typedef std::vector<value_type> value_vector;
60 static std::vector<std::string> s_arrString;
61 static value_vector s_Data;
63 static void SetUpTestCase();
64 static void TearDownTestCase();
66 static void setup_test_case();
67 static std::vector<size_t> get_load_factors();
70 template <typename Iterator, typename Map>
71 static bool check_result( Iterator const& it, Map const& map )
73 return it != map.end();
75 template <typename Map>
76 static bool check_result( bool b, Map const& )
82 class Worker: public cds_test::thread
84 typedef cds_test::thread base_class;
97 Worker( cds_test::thread_pool& pool, Map& map )
104 Worker( Worker& src )
111 virtual thread * clone()
113 return new Worker( *this );
117 size_t const nPassCount = s_nPassCount;
120 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
122 auto itEnd = s_Data.cend();
123 for ( auto it = s_Data.cbegin(); it != itEnd; ++it ) {
124 auto bFound = rMap.contains( *(it->pKey) );
126 if ( check_result(bFound, rMap))
127 ++m_KeyExists.nSuccess;
129 ++m_KeyExists.nFailed;
132 if ( check_result(bFound, rMap))
133 ++m_KeyNotExists.nFailed;
135 ++m_KeyNotExists.nSuccess;
140 auto itEnd = s_Data.crend();
141 for ( auto it = s_Data.crbegin(); it != itEnd; ++it ) {
142 auto bFound = rMap.contains( *(it->pKey) );
144 if ( check_result(bFound, rMap))
145 ++m_KeyExists.nSuccess;
147 ++m_KeyExists.nFailed;
150 if ( check_result( bFound, rMap ))
151 ++m_KeyNotExists.nFailed;
153 ++m_KeyNotExists.nSuccess;
162 template <typename Hash>
163 static void fill_string_array();
166 void test( Map& testMap )
168 typedef Worker<Map> worker;
171 for ( size_t i = 0; i < s_Data.size(); ++i ) {
172 // All keys in arrData are unique, insert() must be successful
173 if ( s_Data[i].bExists )
174 EXPECT_TRUE( check_result( testMap.insert( *(s_Data[i].pKey), s_Data[i] ), testMap ));
177 propout() << std::make_pair( "thread_count", s_nThreadCount )
178 << std::make_pair( "map_size", s_nMapSize )
179 << std::make_pair( "percent_exist", s_nPercentExists )
180 << std::make_pair( "pass_count", s_nPassCount );
182 cds_test::thread_pool& pool = get_pool();
183 pool.add( new worker( pool, testMap ), s_nThreadCount );
185 std::chrono::milliseconds duration = pool.run();
187 propout() << std::make_pair( "duration", duration );
189 size_t nExistSuccess = 0;
190 size_t nExistFailed = 0;
191 size_t nMissingSuccess = 0;
192 size_t nMissingFailed = 0;
194 // Postcondition: the number of success searching == the number of map item
195 for ( size_t i = 0; i < pool.size(); ++i ) {
196 worker& w = static_cast<worker&>(pool.get( i ));
197 nExistSuccess += w.m_KeyExists.nSuccess;
198 nExistFailed += w.m_KeyExists.nFailed;
199 nMissingSuccess += w.m_KeyNotExists.nSuccess;
200 nMissingFailed += w.m_KeyNotExists.nFailed;
202 EXPECT_EQ( w.m_KeyExists.nSuccess, s_nMapSize * s_nPassCount ) << "thread " << i;
203 EXPECT_EQ( w.m_KeyExists.nFailed, 0u ) << "thread " << i;
204 EXPECT_EQ( w.m_KeyNotExists.nSuccess, (s_Data.size() - s_nMapSize) * s_nPassCount ) << "thread " << i;
205 EXPECT_EQ( w.m_KeyNotExists.nFailed, 0u ) << "thread " << i;
209 << std::make_pair( "exist_found", nExistSuccess )
210 << std::make_pair( "exist_not_found", nExistFailed ) // must = 0
211 << std::make_pair( "missing_not_found", nMissingSuccess )
212 << std::make_pair( "missing_found", nMissingFailed ); // must = 0
214 check_before_cleanup( testMap );
217 additional_check( testMap );
218 print_stat( propout(), testMap );
219 additional_cleanup( testMap );
225 ASSERT_GT( s_Data.size(), 0u );
227 Map testMap( *this );
232 class Map_find_string_stdhash: public Map_find_string
235 static void SetUpTestCase();
240 Map_find_string::run_test<Map>();
244 #if CDS_BUILD_BITS == 64
245 class Map_find_string_city32: public Map_find_string
248 static void SetUpTestCase();
253 Map_find_string::run_test<Map>();
257 class Map_find_string_city64: public Map_find_string
260 static void SetUpTestCase();
265 Map_find_string::run_test<Map>();
269 class Map_find_string_city128: public Map_find_string
272 static void SetUpTestCase();
277 Map_find_string::run_test<Map>();
281 #endif // #if CDS_BUILD_BITS == 64
283 class Map_find_string_LF: public Map_find_string
284 , public ::testing::WithParamInterface<size_t>
290 s_nLoadFactor = GetParam();
291 propout() << std::make_pair( "load_factor", s_nLoadFactor );
292 Map_find_string::run_test<Map>();