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 "map_insdel_string.h"
32 #include <cds_test/hash_func.h>
36 size_t Map_InsDel_string::s_nMapSize = 1000000; // map size
37 size_t Map_InsDel_string::s_nInsertThreadCount = 4; // count of insertion thread
38 size_t Map_InsDel_string::s_nDeleteThreadCount = 4; // count of deletion thread
39 size_t Map_InsDel_string::s_nThreadPassCount = 4; // pass count for each thread
40 size_t Map_InsDel_string::s_nFeldmanPassCount = 100;
41 size_t Map_InsDel_string::s_nBronsonAVLTreeMapPassCount = 100;
42 size_t Map_InsDel_string::s_nEllenBinTreeMapPassCount = 100;
43 size_t Map_InsDel_string::s_nMichaelMapPassCount = 100;
44 size_t Map_InsDel_string::s_nSkipListMapPassCount = 100;
46 size_t Map_InsDel_string::s_nMaxLoadFactor = 8; // maximum load factor
48 size_t Map_InsDel_string::s_nCuckooInitialSize = 1024;// initial size for CuckooSet
49 size_t Map_InsDel_string::s_nCuckooProbesetSize = 16; // CuckooSet probeset size (only for list-based probeset)
50 size_t Map_InsDel_string::s_nCuckooProbesetThreshold = 0; // CuckooSet probeset threshold (0 - use default)
52 size_t Map_InsDel_string::s_nFeldmanMap_HeadBits = 10;
53 size_t Map_InsDel_string::s_nFeldmanMap_ArrayBits = 4;
55 size_t Map_InsDel_string::s_nLoadFactor = 1;
56 std::vector<std::string> Map_InsDel_string::s_arrKeys;
58 void Map_InsDel_string::setup_test_case()
60 cds_test::config const& cfg = get_config( "sequential_real_map_insdel_string" );
62 s_nMapSize = cfg.get_size_t( "MapSize", s_nMapSize );
63 if ( s_nMapSize < 1000 )
66 s_nInsertThreadCount = cfg.get_size_t( "InsertThreadCount", s_nInsertThreadCount );
67 if ( s_nInsertThreadCount == 0 )
68 s_nInsertThreadCount = 2;
70 s_nDeleteThreadCount = cfg.get_size_t( "DeleteThreadCount", s_nDeleteThreadCount );
71 if ( s_nDeleteThreadCount == 0 )
72 s_nDeleteThreadCount = 2;
74 s_nThreadPassCount = cfg.get_size_t( "ThreadPassCount", s_nThreadPassCount );
75 if ( s_nThreadPassCount == 0 )
76 s_nThreadPassCount = 4;
79 cfg.get_size_t("FeldmanPassCount", s_nFeldmanPassCount);
80 if (s_nFeldmanPassCount == 0)
81 s_nFeldmanPassCount = 500;
83 s_nBronsonAVLTreeMapPassCount = cfg.get_size_t(
84 "BronsonAVLTreeMapPassCount", s_nBronsonAVLTreeMapPassCount);
85 if (s_nBronsonAVLTreeMapPassCount == 0)
86 s_nBronsonAVLTreeMapPassCount = 500;
88 s_nEllenBinTreeMapPassCount = cfg.get_size_t(
89 "EllenBinTreeMapPassCount", s_nEllenBinTreeMapPassCount);
90 if (s_nEllenBinTreeMapPassCount == 0)
91 s_nEllenBinTreeMapPassCount = 500;
93 s_nMichaelMapPassCount =
94 cfg.get_size_t("MichaelMapPassCount", s_nMichaelMapPassCount);
95 if (s_nMichaelMapPassCount == 0)
96 s_nMichaelMapPassCount = 500;
98 s_nSkipListMapPassCount =
99 cfg.get_size_t("SkipListMapPassCount", s_nSkipListMapPassCount);
100 if (s_nSkipListMapPassCount == 0)
101 s_nSkipListMapPassCount = 500;
103 s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
104 if ( s_nMaxLoadFactor == 0 )
105 s_nMaxLoadFactor = 1;
107 s_nCuckooInitialSize = cfg.get_size_t( "CuckooInitialSize", s_nCuckooInitialSize );
108 if ( s_nCuckooInitialSize < 256 )
109 s_nCuckooInitialSize = 256;
111 s_nCuckooProbesetSize = cfg.get_size_t( "CuckooProbesetSize", s_nCuckooProbesetSize );
112 if ( s_nCuckooProbesetSize < 8 )
113 s_nCuckooProbesetSize = 8;
115 s_nCuckooProbesetThreshold = cfg.get_size_t( "CuckooProbesetThreshold", s_nCuckooProbesetThreshold );
117 s_nFeldmanMap_HeadBits = cfg.get_size_t( "FeldmanMapHeadBits", s_nFeldmanMap_HeadBits );
118 if ( s_nFeldmanMap_HeadBits == 0 )
119 s_nFeldmanMap_HeadBits = 2;
121 s_nFeldmanMap_ArrayBits = cfg.get_size_t( "FeldmanMapArrayBits", s_nFeldmanMap_ArrayBits );
122 if ( s_nFeldmanMap_ArrayBits == 0 )
123 s_nFeldmanMap_ArrayBits = 2;
126 void Map_InsDel_string::SetUpTestCase()
131 s_arrKeys.reserve( s_nMapSize );
132 std::vector<std::string> dict = load_dictionary();
133 for ( size_t i = 0; i < s_nMapSize; ++i )
134 s_arrKeys.push_back( std::move( dict.at(i)));
137 void Map_InsDel_string::TearDownTestCase()
142 std::vector<size_t> Map_InsDel_string::get_load_factors()
144 cds_test::config const& cfg = get_config( "map_insdel_string" );
146 s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
147 if ( s_nMaxLoadFactor == 0 )
148 s_nMaxLoadFactor = 1;
150 std::vector<size_t> lf;
151 for ( size_t n = 1; n <= s_nMaxLoadFactor; n *= 2 )
157 template <typename Hash>
158 void Map_InsDel_string::fill_string_array()
161 typedef typename hasher::result_type hash_type;
163 std::map<hash_type, size_t> mapHash;
165 std::vector<std::string> dict = load_dictionary();
167 size_t nSize = dict.size();
168 if ( nSize > s_nMapSize )
170 s_arrKeys.reserve( nSize );
172 size_t nDiffHash = 0;
174 for ( size_t i = 0; i < dict.size(); ++i ) {
175 hash_type hash = h( dict.at( i ));
176 if ( mapHash.insert( std::make_pair( hash, i )).second ) {
177 if ( ++nDiffHash >= nSize )
179 s_arrKeys.push_back( std::move( dict.at( i )));
182 s_nMapSize = dict.size();
185 void Map_InsDel_string_stdhash::SetUpTestCase()
188 fill_string_array<std::hash<std::string>>();
191 #if CDS_BUILD_BITS == 64
192 void Map_InsDel_string_city32::SetUpTestCase()
195 fill_string_array<cds_test::city32>();
198 void Map_InsDel_string_city64::SetUpTestCase()
201 fill_string_array<cds_test::city64>();
204 void Map_InsDel_string_city128::SetUpTestCase()
207 fill_string_array<cds_test::city128>();
212 #ifdef CDSTEST_GTEST_INSTANTIATE_TEST_CASE_P_HAS_4TH_ARG
213 static std::string get_test_parameter_name( testing::TestParamInfo<size_t> const& p )
215 return std::to_string( p.param );
217 INSTANTIATE_TEST_CASE_P( a, Map_InsDel_string_LF, ::testing::ValuesIn( Map_InsDel_string::get_load_factors()), get_test_parameter_name );
219 INSTANTIATE_TEST_CASE_P( a, Map_InsDel_string_LF, ::testing::ValuesIn( Map_InsDel_string::get_load_factors()));