From: khizmax Date: Tue, 5 Apr 2016 19:08:39 +0000 (+0300) Subject: Migrated CuckooMap unit test to gtest framework X-Git-Tag: v2.2.0~294 X-Git-Url: http://plrg.eecs.uci.edu/git/?a=commitdiff_plain;h=32cdba258b6ebf0a92cac603ddb25e3f88eacd91;p=libcds.git Migrated CuckooMap unit test to gtest framework --- diff --git a/projects/Win/vc14/cds.sln b/projects/Win/vc14/cds.sln index 78b4e83f..d2ff19a8 100644 --- a/projects/Win/vc14/cds.sln +++ b/projects/Win/vc14/cds.sln @@ -1,6 +1,6 @@ Microsoft Visual Studio Solution File, Format Version 12.00 # Visual Studio 14 -VisualStudioVersion = 14.0.24720.0 +VisualStudioVersion = 14.0.25123.0 MinimumVisualStudioVersion = 10.0.40219.1 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cds", "cds.vcxproj", "{408FE9BC-44F0-4E6A-89FA-D6F952584239}" EndProject @@ -213,6 +213,11 @@ Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest-map", "gtest-map.vcxp {408FE9BC-44F0-4E6A-89FA-D6F952584239} = {408FE9BC-44F0-4E6A-89FA-D6F952584239} EndProjectSection EndProject +Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest-striped-map", "gtest-striped-map.vcxproj", "{00FD5CB8-E1A4-40CA-B613-30A06A75622B}" + ProjectSection(ProjectDependencies) = postProject + {408FE9BC-44F0-4E6A-89FA-D6F952584239} = {408FE9BC-44F0-4E6A-89FA-D6F952584239} + EndProjectSection +EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 @@ -547,6 +552,18 @@ Global {42B7E892-DDDA-4D00-9AB7-378E0E7E9433}.Release|Win32.Build.0 = Release|Win32 {42B7E892-DDDA-4D00-9AB7-378E0E7E9433}.Release|x64.ActiveCfg = Release|x64 {42B7E892-DDDA-4D00-9AB7-378E0E7E9433}.Release|x64.Build.0 = Release|x64 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.Debug|Win32.ActiveCfg = Debug|Win32 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.Debug|Win32.Build.0 = Debug|Win32 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.Debug|x64.ActiveCfg = Debug|x64 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.Debug|x64.Build.0 = Debug|x64 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.DebugVLD|Win32.ActiveCfg = DebugVLD|Win32 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.DebugVLD|Win32.Build.0 = DebugVLD|Win32 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.DebugVLD|x64.ActiveCfg = DebugVLD|x64 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.DebugVLD|x64.Build.0 = DebugVLD|x64 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.Release|Win32.ActiveCfg = Release|Win32 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.Release|Win32.Build.0 = Release|Win32 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.Release|x64.ActiveCfg = Release|x64 + {00FD5CB8-E1A4-40CA-B613-30A06A75622B}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE @@ -580,6 +597,7 @@ Global {EC1EF263-7E34-4867-9ED9-77AA7963CD4A} = {810490B7-31E5-49AE-8455-CAF99A9658B6} {648021D3-6E18-4B94-88B8-F6A59609E210} = {810490B7-31E5-49AE-8455-CAF99A9658B6} {42B7E892-DDDA-4D00-9AB7-378E0E7E9433} = {810490B7-31E5-49AE-8455-CAF99A9658B6} + {00FD5CB8-E1A4-40CA-B613-30A06A75622B} = {810490B7-31E5-49AE-8455-CAF99A9658B6} EndGlobalSection GlobalSection(DPCodeReviewSolutionGUID) = preSolution DPCodeReviewSolutionGUID = {00000000-0000-0000-0000-000000000000} diff --git a/projects/Win/vc14/gtest-striped-map.vcxproj b/projects/Win/vc14/gtest-striped-map.vcxproj new file mode 100644 index 00000000..79bf993d --- /dev/null +++ b/projects/Win/vc14/gtest-striped-map.vcxproj @@ -0,0 +1,260 @@ + + + + + DebugVLD + Win32 + + + DebugVLD + x64 + + + Debug + Win32 + + + Release + Win32 + + + Debug + x64 + + + Release + x64 + + + + + + 4503 + 4503 + 4503 + 4503 + 4503 + 4503 + CDSUNIT_ENABLE_BOOST_CONTAINER;_SCL_SECURE_NO_WARNINGS;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) + CDSUNIT_ENABLE_BOOST_CONTAINER;_SCL_SECURE_NO_WARNINGS;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) + CDSUNIT_ENABLE_BOOST_CONTAINER;_SCL_SECURE_NO_WARNINGS;WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) + CDSUNIT_ENABLE_BOOST_CONTAINER;_SCL_SECURE_NO_WARNINGS;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) + CDSUNIT_ENABLE_BOOST_CONTAINER;_SCL_SECURE_NO_WARNINGS;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) + CDSUNIT_ENABLE_BOOST_CONTAINER;_SCL_SECURE_NO_WARNINGS;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) + + + + + + + + {00FD5CB8-E1A4-40CA-B613-30A06A75622B} + Win32Proj + striped-map + 8.1 + + + + Application + true + v140 + Unicode + + + Application + true + v140 + Unicode + + + Application + false + v140 + true + Unicode + + + Application + true + v140 + Unicode + + + Application + true + v140 + Unicode + + + Application + false + v140 + true + Unicode + + + + + + + + + + + + + + + + + + + + + + + + + + + true + $(SolutionDir)..\..\..\bin\vc.$(PlatformToolset)\$(Platform)\ + $(SolutionDir)..\..\..\obj\vc.$(PlatformToolset)\$(Platform)\$(ProjectName)\$(Configuration)\ + $(ProjectName)_d + + + true + $(SolutionDir)..\..\..\bin\vc.$(PlatformToolset)\$(Platform)\ + $(SolutionDir)..\..\..\obj\vc.$(PlatformToolset)\$(Platform)\$(ProjectName)\$(Configuration)\ + $(ProjectName)_d + + + true + $(SolutionDir)..\..\..\bin\vc.$(PlatformToolset)\$(Platform)\ + $(SolutionDir)..\..\..\obj\vc.$(PlatformToolset)\$(Platform)\$(ProjectName)\$(Configuration)\ + $(ProjectName)_d + + + true + $(SolutionDir)..\..\..\bin\vc.$(PlatformToolset)\$(Platform)\ + $(SolutionDir)..\..\..\obj\vc.$(PlatformToolset)\$(Platform)\$(ProjectName)\$(Configuration)\ + $(ProjectName)_d + + + false + $(SolutionDir)..\..\..\bin\vc.$(PlatformToolset)\$(Platform)-release\ + $(SolutionDir)..\..\..\obj\vc.$(PlatformToolset)\$(Platform)\$(ProjectName)\$(Configuration)\ + + + false + $(SolutionDir)..\..\..\bin\vc.$(PlatformToolset)\$(Platform)-release\ + $(SolutionDir)..\..\..\obj\vc.$(PlatformToolset)\$(Platform)\$(ProjectName)\$(Configuration)\ + + + + NotUsing + Level3 + Disabled + CDSUNIT_ENABLE_BOOST_CONTAINER;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) + $(SolutionDir)..\..\..;$(GTEST_ROOT)/include;$(SolutionDir)..\..\..\test\include;$(BOOST_PATH);%(AdditionalIncludeDirectories) + /bigobj %(AdditionalOptions) + + + Console + true + $(GTEST_LIB32);$(GTEST_ROOT)/lib/x86;$(BOOST_PATH)/stage32/lib;$(BOOST_PATH)/stage/lib;$(BOOST_PATH)/bin;%(AdditionalLibraryDirectories);$(OutDir) + gtestd.lib;%(AdditionalDependencies) + + + + + NotUsing + Level3 + Disabled + CDSUNIT_ENABLE_BOOST_CONTAINER;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) + $(SolutionDir)..\..\..;$(GTEST_ROOT)/include;$(SolutionDir)..\..\..\test\include;$(BOOST_PATH);%(AdditionalIncludeDirectories) + /bigobj %(AdditionalOptions) + + + Console + true + $(GTEST_LIB32);$(GTEST_ROOT)/lib/x86;$(BOOST_PATH)/stage32/lib;$(BOOST_PATH)/stage/lib;$(BOOST_PATH)/bin;%(AdditionalLibraryDirectories);$(OutDir) + gtestd.lib;%(AdditionalDependencies) + + + + + NotUsing + Level3 + Disabled + CDSUNIT_ENABLE_BOOST_CONTAINER;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) + $(SolutionDir)..\..\..;$(GTEST_ROOT)/include;$(SolutionDir)..\..\..\test\include;$(BOOST_PATH);%(AdditionalIncludeDirectories) + /bigobj %(AdditionalOptions) + + + Console + true + $(GTEST_LIB64);$(GTEST_ROOT)/lib/x64;$(BOOST_PATH)/stage64/lib;$(BOOST_PATH)/bin;%(AdditionalLibraryDirectories);$(OutDir) + gtestd.lib;%(AdditionalDependencies) + + + + + NotUsing + Level3 + Disabled + CDSUNIT_ENABLE_BOOST_CONTAINER;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) + $(SolutionDir)..\..\..;$(GTEST_ROOT)/include;$(SolutionDir)..\..\..\test\include;$(BOOST_PATH);%(AdditionalIncludeDirectories) + /bigobj %(AdditionalOptions) + + + Console + true + $(GTEST_LIB64);$(GTEST_ROOT)/lib/x64;$(BOOST_PATH)/stage64/lib;$(BOOST_PATH)/bin;%(AdditionalLibraryDirectories);$(OutDir) + gtestd.lib;%(AdditionalDependencies) + + + + + Level3 + NotUsing + MaxSpeed + true + true + CDSUNIT_ENABLE_BOOST_CONTAINER;WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) + $(SolutionDir)..\..\..;$(GTEST_ROOT)/include;$(SolutionDir)..\..\..\test\include;$(BOOST_PATH);%(AdditionalIncludeDirectories) + /bigobj %(AdditionalOptions) + + + Console + true + true + true + $(GTEST_LIB32);$(GTEST_ROOT)/lib/x86;$(BOOST_PATH)/stage32/lib;$(BOOST_PATH)/stage/lib;$(BOOST_PATH)/bin;%(AdditionalLibraryDirectories);$(OutDir) + gtest.lib;%(AdditionalDependencies) + + + + + Level3 + NotUsing + MaxSpeed + true + true + CDSUNIT_ENABLE_BOOST_CONTAINER;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) + $(SolutionDir)..\..\..;$(GTEST_ROOT)/include;$(SolutionDir)..\..\..\test\include;$(BOOST_PATH);%(AdditionalIncludeDirectories) + /bigobj %(AdditionalOptions) + + + Console + true + true + true + $(GTEST_LIB64);$(GTEST_ROOT)/lib/x64;$(BOOST_PATH)/stage64/lib;$(BOOST_PATH)/bin;%(AdditionalLibraryDirectories);$(OutDir) + gtest.lib;%(AdditionalDependencies) + + + + + + \ No newline at end of file diff --git a/projects/Win/vc14/gtest-striped-map.vcxproj.filters b/projects/Win/vc14/gtest-striped-map.vcxproj.filters new file mode 100644 index 00000000..3a4078e4 --- /dev/null +++ b/projects/Win/vc14/gtest-striped-map.vcxproj.filters @@ -0,0 +1,33 @@ + + + + + {4FC737F1-C7A5-4376-A066-2A32D752A2FF} + cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx + + + {93995380-89BD-4b04-88EB-625FBE52EBFB} + h;hh;hpp;hxx;hm;inl;inc;xsd + + + {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} + rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms + + + + + Source Files + + + Source Files + + + + + Header Files + + + Header Files + + + \ No newline at end of file diff --git a/test/unit/CMakeLists.txt b/test/unit/CMakeLists.txt index 20a12b2c..218c81ac 100644 --- a/test/unit/CMakeLists.txt +++ b/test/unit/CMakeLists.txt @@ -5,6 +5,7 @@ add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/pqueue) add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/queue) add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/intrusive-set) add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/set) +add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/striped-map) add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/striped-set) add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/stack) diff --git a/test/unit/striped-map/CMakeLists.txt b/test/unit/striped-map/CMakeLists.txt new file mode 100644 index 00000000..a760a6d1 --- /dev/null +++ b/test/unit/striped-map/CMakeLists.txt @@ -0,0 +1,22 @@ +set(PACKAGE_NAME unit-striped-map) + +set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -DCDSUNIT_ENABLE_BOOST_CONTAINER") + +set(CDSGTEST_STRIPED_MAP_SOURCES + ../main.cpp +) + +include_directories( + ${CMAKE_CURRENT_SOURCE_DIR} +) + +add_executable(${PACKAGE_NAME} ${CDSGTEST_STRIPED_MAP_SOURCES}) +target_link_libraries(${PACKAGE_NAME} + ${CDS_SHARED_LIBRARY} + ${GTEST_LIBRARY} + ${Boost_THREAD_LIBRARY} + ${Boost_SYSTEM_LIBRARY} + ${CMAKE_THREAD_LIBS_INIT} +) + +add_test(NAME ${PACKAGE_NAME} COMMAND ${PACKAGE_NAME} WORKING_DIRECTORY ${EXECUTABLE_OUTPUT_PATH}) \ No newline at end of file diff --git a/test/unit/striped-map/cuckoo_map.cpp b/test/unit/striped-map/cuckoo_map.cpp new file mode 100644 index 00000000..a287c969 --- /dev/null +++ b/test/unit/striped-map/cuckoo_map.cpp @@ -0,0 +1,517 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include "test_map.h" + +#include + +namespace { + namespace cc = cds::container; + + class CuckooMap : public cds_test::striped_map + { + protected: + typedef cds_test::striped_map base_class; + + template + void test( Set& m ) + { + // Precondition: set is empty + // Postcondition: set is empty + + base_class::test_< Set::c_isSorted>( m ); + } + + //void SetUp() + //{} + + //void TearDown() + //{} + }; + + struct store_hash_traits: public cc::cuckoo::traits + { + static bool const store_hash = true; + }; + + +//************************************************************ +// striped set + + TEST_F( CuckooMap, striped_list_unordered ) + { + struct map_traits: public cc::cuckoo::traits + { + typedef cds::opt::hash_tuple< hash1, hash2 > hash; + typedef base_class::equal_to equal_to; + typedef cc::cuckoo::list probeset_type; + }; + typedef cc::CuckooMap< key_type, value_type, map_traits > map_type; + + map_type m; + test( m ); + } + + TEST_F( CuckooMap, striped_vector_unordered ) + { + struct map_traits: public cc::cuckoo::traits + { + typedef cds::opt::hash_tuple< hash1, hash2 > hash; + typedef base_class::equal_to equal_to; + typedef cc::cuckoo::vector<4> probeset_type; + }; + typedef cc::CuckooMap< key_type, value_type, map_traits > map_type; + + map_type m( 32, 4 ); + test( m ); + } + + TEST_F( CuckooMap, striped_list_ordered_cmp ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + >::type + > map_type; + + map_type m( 32, 6, 4 ); + test( m ); + } + + TEST_F( CuckooMap, striped_vector_ordered_cmp ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<8>> + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( ht ); + test( m ); + } + + TEST_F( CuckooMap, striped_list_ordered_less ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::less< less > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( 32, 6, 4, ht ); + test( m ); + } + + TEST_F( CuckooMap, striped_vector_ordered_less ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::less< less > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<6>> + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( std::move( ht ) ); + test( m ); + } + + TEST_F( CuckooMap, striped_list_ordered_cmpmix ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( 32, 6, 0, std::move( ht ) ); + test( m ); + } + + TEST_F( CuckooMap, striped_vector_ordered_cmpmix ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<6>> + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( std::move( ht ) ); + test( m ); + } + + TEST_F( CuckooMap, striped_list_ordered_stat ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cds::opt::stat< cc::cuckoo::stat > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + >::type + > map_type; + + map_type m; + test( m ); + } + + TEST_F( CuckooMap, striped_vector_ordered_stat ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cds::opt::stat< cc::cuckoo::stat > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<8>> + >::type + > map_type; + + map_type m; + test( m ); + } + + TEST_F( CuckooMap, striped_list_unordered_storehash ) + { + struct map_traits: public store_hash_traits + { + typedef cds::opt::hash_tuple< hash1, hash2 > hash; + typedef base_class::equal_to equal_to; + typedef cc::cuckoo::list probeset_type; + typedef cc::cuckoo::stat stat; + }; + typedef cc::CuckooMap< key_type, value_type, map_traits > map_type; + + map_type m; + test( m ); + } + + TEST_F( CuckooMap, striped_vector_unordered_storehash ) + { + struct map_traits: public store_hash_traits + { + typedef cds::opt::hash_tuple< hash1, hash2 > hash; + typedef base_class::equal_to equal_to; + typedef cc::cuckoo::stat stat; + typedef cc::cuckoo::vector<4> probeset_type; + }; + typedef cc::CuckooMap< key_type, value_type, map_traits > map_type; + + map_type m( 32, 4 ); + test( m ); + } + + TEST_F( CuckooMap, striped_list_ordered_storehash ) + { + typedef cc::CuckooMap< key_type, value_type + ,cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + ,cc::cuckoo::store_hash< true > + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( 32, 6, 0, std::move( ht )); + test( m ); + } + + TEST_F( CuckooMap, striped_vector_ordered_storehash ) + { + typedef cc::CuckooMap< key_type, value_type + ,cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<6>> + ,cc::cuckoo::store_hash< true > + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( std::move( ht )); + test( m ); + } + + +//************************************************************ +// refinable set + + TEST_F( CuckooMap, refinable_list_unordered ) + { + struct map_traits: public cc::cuckoo::traits + { + typedef cds::opt::hash_tuple< hash1, hash2 > hash; + typedef base_class::equal_to equal_to; + typedef cc::cuckoo::list probeset_type; + typedef cc::cuckoo::refinable<> mutex_policy; + }; + typedef cc::CuckooMap< key_type, value_type, map_traits > map_type; + + map_type m; + test( m ); + } + + TEST_F( CuckooMap, refinable_vector_unordered ) + { + struct map_traits: public cc::cuckoo::traits + { + typedef cc::cuckoo::refinable<> mutex_policy; + typedef cds::opt::hash_tuple< hash1, hash2 > hash; + typedef base_class::equal_to equal_to; + typedef cc::cuckoo::vector<4> probeset_type; + }; + typedef cc::CuckooMap< key_type, value_type, map_traits > map_type; + + map_type m( 32, 4 ); + test( m ); + } + + TEST_F( CuckooMap, refinable_list_ordered_cmp ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + >::type + > map_type; + + map_type m( 32, 6, 4 ); + test( m ); + } + + TEST_F( CuckooMap, refinable_vector_ordered_cmp ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 >> + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<8>> + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( ht ); + test( m ); + } + + TEST_F( CuckooMap, refinable_list_ordered_less ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::less< less > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( 32, 6, 4, ht ); + test( m ); + } + + TEST_F( CuckooMap, refinable_vector_ordered_less ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::less< less > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<6>> + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( std::move( ht ) ); + test( m ); + } + + TEST_F( CuckooMap, refinable_list_ordered_cmpmix ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( 32, 6, 0, std::move( ht ) ); + test( m ); + } + + TEST_F( CuckooMap, refinable_vector_ordered_cmpmix ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<6>> + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( std::move( ht ) ); + test( m ); + } + + TEST_F( CuckooMap, refinable_list_ordered_stat ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cds::opt::stat< cc::cuckoo::stat > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + >::type + > map_type; + + map_type m; + test( m ); + } + + TEST_F( CuckooMap, refinable_vector_ordered_stat ) + { + typedef cc::CuckooMap< key_type, value_type + , cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cds::opt::stat< cc::cuckoo::stat > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<8>> + >::type + > map_type; + + map_type m; + test( m ); + } + + TEST_F( CuckooMap, refinable_list_unordered_storehash ) + { + struct map_traits: public store_hash_traits + { + typedef cc::cuckoo::refinable<> mutex_policy; + typedef cds::opt::hash_tuple< hash1, hash2 > hash; + typedef base_class::equal_to equal_to; + typedef cc::cuckoo::list probeset_type; + typedef cc::cuckoo::stat stat; + }; + typedef cc::CuckooMap< key_type, value_type, map_traits > map_type; + + map_type m; + test( m ); + } + + TEST_F( CuckooMap, refinable_vector_unordered_storehash ) + { + struct map_traits: public store_hash_traits + { + typedef cds::opt::hash_tuple< hash1, hash2 > hash; + typedef cc::cuckoo::refinable<> mutex_policy; + typedef base_class::equal_to equal_to; + typedef cc::cuckoo::stat stat; + typedef cc::cuckoo::vector<4> probeset_type; + }; + typedef cc::CuckooMap< key_type, value_type, map_traits > map_type; + + map_type m( 32, 4 ); + test( m ); + } + + TEST_F( CuckooMap, refinable_list_ordered_storehash ) + { + typedef cc::CuckooMap< key_type, value_type + ,cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::list > + ,cc::cuckoo::store_hash< true > + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( 32, 6, 0, std::move( ht )); + test( m ); + } + + TEST_F( CuckooMap, refinable_vector_ordered_storehash ) + { + typedef cc::CuckooMap< key_type, value_type + ,cc::cuckoo::make_traits< + cds::opt::hash< std::tuple< hash1, hash2 > > + ,cds::opt::mutex_policy< cc::cuckoo::refinable<>> + ,cds::opt::less< less > + ,cds::opt::compare< cmp > + ,cc::cuckoo::probeset_type< cc::cuckoo::vector<6>> + ,cc::cuckoo::store_hash< true > + >::type + > map_type; + + typename map_type::hash_tuple_type ht; + map_type m( std::move( ht )); + test( m ); + } + + +} // namespace diff --git a/test/unit/striped-map/test_map.h b/test/unit/striped-map/test_map.h new file mode 100644 index 00000000..e1e615f4 --- /dev/null +++ b/test/unit/striped-map/test_map.h @@ -0,0 +1,394 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#ifndef CDSUNIT_STRIPED_MAP_TEST_MAP_H +#define CDSUNIT_STRIPED_MAP_TEST_MAP_H + +#include "test_map_data.h" + +// forward declaration +namespace cds { namespace container {} } + +namespace cds_test { + + class striped_map: public striped_map_fixture + { + public: + static size_t const kSize = 1000; + + protected: + template + void test( Map& m ) + { + test_< true >( m ); + } + + template + void test_( Map& m ) + { + // Precondition: map is empty + // Postcondition: map is empty + + ASSERT_TRUE( m.empty()); + ASSERT_CONTAINER_SIZE( m, 0 ); + + typedef typename Map::value_type map_pair; + typedef typename std::conditional< Sorted, other_less, other_equal_to >::type other_predicate; + + size_t const kkSize = kSize; + + std::vector arrKeys; + for ( int i = 0; i < static_cast(kkSize); ++i ) + arrKeys.push_back( key_type( i )); + shuffle( arrKeys.begin(), arrKeys.end()); + + std::vector< value_type > arrVals; + for ( size_t i = 0; i < kkSize; ++i ) { + value_type val; + val.nVal = static_cast( i ); + val.strVal = std::to_string( i ); + arrVals.push_back( val ); + } + + // insert/find + for ( auto const& i : arrKeys ) { + value_type const& val( arrVals.at( i.nKey )); + + ASSERT_FALSE( m.contains( i.nKey )); + ASSERT_FALSE( m.contains( i )); + ASSERT_FALSE( m.contains( other_item( i.nKey ), other_predicate())); + ASSERT_FALSE( m.find( i, []( map_pair const& ) { + ASSERT_TRUE( false ); + } )); + ASSERT_FALSE( m.find( i.nKey, []( map_pair const& ) { + EXPECT_TRUE( false ); + } )); + ASSERT_FALSE( m.find_with( other_item( i.nKey ), other_predicate(), []( map_pair const& ) { + EXPECT_TRUE( false ); + } )); + + std::pair< bool, bool > updResult; + + switch ( i.nKey % 16 ) { + case 0: + ASSERT_TRUE( m.insert( i )); + ASSERT_FALSE( m.insert( i )); + ASSERT_TRUE( m.find( i.nKey, []( map_pair& v ) { + v.second.nVal = v.first.nKey; + v.second.strVal = std::to_string( v.first.nKey ); + } )); + break; + case 1: + ASSERT_TRUE( m.insert( i.nKey )); + ASSERT_FALSE( m.insert( i.nKey )); + ASSERT_TRUE( m.find( i.nKey, []( map_pair& v ) { + v.second.nVal = v.first.nKey; + v.second.strVal = std::to_string( v.first.nKey ); + } )); + break; + case 2: + ASSERT_TRUE( m.insert( std::to_string( i.nKey ))); + ASSERT_FALSE( m.insert( std::to_string( i.nKey ))); + ASSERT_TRUE( m.find( i.nKey, []( map_pair& v ) { + v.second.nVal = v.first.nKey; + v.second.strVal = std::to_string( v.first.nKey ); + } )); + break; + case 3: + ASSERT_TRUE( m.insert( i, val )); + ASSERT_FALSE( m.insert( i, val )); + break; + case 4: + ASSERT_TRUE( m.insert( i.nKey, val.strVal )); + ASSERT_FALSE( m.insert( i.nKey, val.strVal )); + break; + case 5: + ASSERT_TRUE( m.insert( val.strVal, i.nKey )); + ASSERT_FALSE( m.insert( val.strVal, i.nKey )); + break; + case 6: + ASSERT_TRUE( m.insert_with( i, []( map_pair& v ) { + v.second.nVal = v.first.nKey; + v.second.strVal = std::to_string( v.first.nKey ); + } )); + ASSERT_FALSE( m.insert_with( i, []( map_pair& v ) { + EXPECT_TRUE( false ); + } )); + break; + case 7: + ASSERT_TRUE( m.insert_with( i.nKey, []( map_pair& v ) { + v.second.nVal = v.first.nKey; + v.second.strVal = std::to_string( v.first.nKey ); + } )); + ASSERT_FALSE( m.insert_with( i.nKey, []( map_pair& v ) { + EXPECT_TRUE( false ); + } )); + break; + case 8: + ASSERT_TRUE( m.insert_with( val.strVal, []( map_pair& v ) { + v.second.nVal = v.first.nKey; + v.second.strVal = std::to_string( v.first.nKey ); + } )); + ASSERT_FALSE( m.insert_with( val.strVal, []( map_pair& v ) { + EXPECT_TRUE( false ); + } )); + break; + case 9: + updResult = m.update( i.nKey, []( bool, map_pair& ) { + EXPECT_TRUE( false ); + }, false ); + ASSERT_FALSE( updResult.first ); + ASSERT_FALSE( updResult.second ); + + updResult = m.update( i.nKey, []( bool bNew, map_pair& v ) { + EXPECT_TRUE( bNew ); + v.second.nVal = v.first.nKey; + }); + ASSERT_TRUE( updResult.first ); + ASSERT_TRUE( updResult.second ); + + updResult = m.update( i.nKey, []( bool bNew, map_pair& v ) { + EXPECT_FALSE( bNew ); + EXPECT_EQ( v.first.nKey, v.second.nVal ); + v.second.strVal = std::to_string( v.second.nVal ); + } ); + ASSERT_TRUE( updResult.first ); + ASSERT_FALSE( updResult.second ); + break; + case 10: + updResult = m.update( i, []( bool, map_pair& ) { + EXPECT_TRUE( false ); + }, false ); + ASSERT_FALSE( updResult.first ); + ASSERT_FALSE( updResult.second ); + + updResult = m.update( i, []( bool bNew, map_pair& v ) { + EXPECT_TRUE( bNew ); + v.second.nVal = v.first.nKey; + }); + ASSERT_TRUE( updResult.first ); + ASSERT_TRUE( updResult.second ); + + updResult = m.update( i, []( bool bNew, map_pair& v ) { + EXPECT_FALSE( bNew ); + EXPECT_EQ( v.first.nKey, v.second.nVal ); + v.second.strVal = std::to_string( v.second.nVal ); + } ); + ASSERT_TRUE( updResult.first ); + ASSERT_FALSE( updResult.second ); + break; + case 11: + updResult = m.update( val.strVal, []( bool, map_pair& ) { + EXPECT_TRUE( false ); + }, false ); + ASSERT_FALSE( updResult.first ); + ASSERT_FALSE( updResult.second ); + + updResult = m.update( val.strVal, []( bool bNew, map_pair& v ) { + EXPECT_TRUE( bNew ); + v.second.nVal = v.first.nKey; + }); + ASSERT_TRUE( updResult.first ); + ASSERT_TRUE( updResult.second ); + + updResult = m.update( val.strVal, []( bool bNew, map_pair& v ) { + EXPECT_FALSE( bNew ); + EXPECT_EQ( v.first.nKey, v.second.nVal ); + v.second.strVal = std::to_string( v.second.nVal ); + } ); + ASSERT_TRUE( updResult.first ); + ASSERT_FALSE( updResult.second ); + break; + case 12: + ASSERT_TRUE( m.emplace( i.nKey )); + ASSERT_FALSE( m.emplace( i.nKey )); + ASSERT_TRUE( m.find( i.nKey, []( map_pair& v ) { + v.second.nVal = v.first.nKey; + v.second.strVal = std::to_string( v.first.nKey ); + } )); + break; + case 13: + ASSERT_TRUE( m.emplace( i, i.nKey )); + ASSERT_FALSE( m.emplace( i, i.nKey )); + break; + case 14: + { + std::string str = val.strVal; + ASSERT_TRUE( m.emplace( i, std::move( str ))); + ASSERT_TRUE( str.empty()); + str = val.strVal; + ASSERT_FALSE( m.emplace( i, std::move( str ))); + ASSERT_TRUE( str.empty()); + } + break; + case 15: + { + std::string str = val.strVal; + ASSERT_TRUE( m.emplace( i, i.nKey, std::move( str ))); + ASSERT_TRUE( str.empty()); + str = val.strVal; + ASSERT_FALSE( m.emplace( i, i.nKey, std::move( str ))); + ASSERT_TRUE( str.empty()); + } + break; + } + + ASSERT_TRUE( m.contains( i.nKey )); + ASSERT_TRUE( m.contains( i )); + ASSERT_TRUE( m.contains( other_item( i.nKey ), other_predicate())); + ASSERT_TRUE( m.find( i, []( map_pair const& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + } )); + ASSERT_TRUE( m.find( i.nKey, []( map_pair const& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + } )); + ASSERT_TRUE( m.find_with( other_item( i.nKey ), other_predicate(), []( map_pair const& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + } )); + } + ASSERT_FALSE( m.empty() ); + ASSERT_CONTAINER_SIZE( m, kkSize ); + + shuffle( arrKeys.begin(), arrKeys.end() ); + + // erase/find + for ( auto const& i : arrKeys ) { + value_type const& val( arrVals.at( i.nKey ) ); + + ASSERT_TRUE( m.contains( i.nKey )); + ASSERT_TRUE( m.contains( val.strVal ) ); + ASSERT_TRUE( m.contains( i )); + ASSERT_TRUE( m.contains( other_item( i.nKey ), other_predicate())); + ASSERT_TRUE( m.find( i, []( map_pair const& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + } )); + ASSERT_TRUE( m.find( i.nKey, []( map_pair const& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + } )); + ASSERT_TRUE( m.find_with( other_item( i.nKey ), other_predicate(), []( map_pair const& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + } )); + + + switch ( i.nKey % 8 ) { + case 0: + ASSERT_TRUE( m.erase( i )); + ASSERT_FALSE( m.erase( i )); + break; + case 1: + ASSERT_TRUE( m.erase( i.nKey )); + ASSERT_FALSE( m.erase( i.nKey )); + break; + case 2: + ASSERT_TRUE( m.erase( val.strVal )); + ASSERT_FALSE( m.erase( val.strVal )); + break; + case 3: + ASSERT_TRUE( m.erase_with( other_item( i.nKey ), other_predicate())); + ASSERT_FALSE( m.erase_with( other_item( i.nKey ), other_predicate())); + break; + case 4: + ASSERT_TRUE( m.erase( i, []( map_pair& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + })); + ASSERT_FALSE( m.erase( i, []( map_pair& ) { + EXPECT_TRUE( false ); + })); + break; + case 5: + ASSERT_TRUE( m.erase( i.nKey, []( map_pair& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + })); + ASSERT_FALSE( m.erase( i.nKey, []( map_pair& ) { + EXPECT_TRUE( false ); + })); + break; + case 6: + ASSERT_TRUE( m.erase( val.strVal, []( map_pair& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + })); + ASSERT_FALSE( m.erase( val.strVal, []( map_pair& ) { + EXPECT_TRUE( false ); + })); + break; + case 7: + ASSERT_TRUE( m.erase_with( other_item( i.nKey ), other_predicate(), []( map_pair& v ) { + EXPECT_EQ( v.first.nKey, v.second.nVal ); + EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal ); + })); + ASSERT_FALSE( m.erase_with( other_item( i.nKey ), other_predicate(), []( map_pair& ) { + EXPECT_TRUE( false ); + })); + break; + } + + ASSERT_FALSE( m.contains( i.nKey )); + ASSERT_FALSE( m.contains( i )); + ASSERT_FALSE( m.contains( val.strVal )); + ASSERT_FALSE( m.contains( other_item( i.nKey ), other_predicate())); + ASSERT_FALSE( m.find( i, []( map_pair const& ) { + ASSERT_TRUE( false ); + } )); + ASSERT_FALSE( m.find( i.nKey, []( map_pair const& ) { + EXPECT_TRUE( false ); + } )); + ASSERT_FALSE( m.find_with( other_item( i.nKey ), other_predicate(), []( map_pair const& ) { + EXPECT_TRUE( false ); + } )); + } + ASSERT_TRUE( m.empty() ); + ASSERT_CONTAINER_SIZE( m, 0 ); + + // clear + for ( auto const& i : arrKeys ) + ASSERT_TRUE( m.insert( i )); + + ASSERT_FALSE( m.empty() ); + ASSERT_CONTAINER_SIZE( m, kkSize ); + + m.clear(); + + ASSERT_TRUE( m.empty() ); + ASSERT_CONTAINER_SIZE( m, 0 ); + } + }; + +} // namespace cds_test + +#endif // #ifndef CDSUNIT_STRIPED_MAP_TEST_MAP_H diff --git a/test/unit/striped-map/test_map_data.h b/test/unit/striped-map/test_map_data.h new file mode 100644 index 00000000..2e1f3ba3 --- /dev/null +++ b/test/unit/striped-map/test_map_data.h @@ -0,0 +1,302 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#ifndef CDSUNIT_STRIPED_MAP_TEST_MAP_DATA_H +#define CDSUNIT_STRIPED_MAP_TEST_MAP_DATA_H + +#include +#include + +#include + +namespace cds_test { + + class striped_map_fixture: public fixture + { + public: + struct key_type { + int nKey; + + explicit key_type( int n ) + : nKey( n ) + {} + + explicit key_type( std::string const& str ) + : nKey( std::stoi( str )) + {} + + key_type( key_type const& s ) + : nKey( s.nKey ) + {} + }; + + struct value_type { + int nVal; + std::string strVal; + + value_type() + : nVal( 0 ) + {} + + explicit value_type( int n ) + : nVal( n ) + , strVal( std::to_string( n )) + {} + + explicit value_type( std::string const& str ) + : nVal( std::stoi( str )) + , strVal( str ) + {} + + explicit value_type( std::string&& str ) + : nVal( std::stoi( str )) + , strVal( std::move( str )) + {} + + value_type( int n, std::string const& str ) + : nVal( n ) + , strVal( str ) + {} + + value_type( int n, std::string&& str ) + : nVal( n ) + , strVal( std::move( str )) + {} + + value_type( value_type&& v ) + : nVal( v.nVal ) + , strVal( std::move( v.strVal )) + {} + + value_type( value_type const& v ) + : nVal( v.nVal ) + , strVal( v.strVal ) + {} + + value_type& operator=( value_type const& v ) + { + if ( this != &v ) { + nVal = v.nVal; + strVal = v.strVal; + } + return *this; + } + + value_type& operator=( value_type&& v ) + { + if ( this != &v ) { + nVal = v.nVal; + strVal = std::move( v.strVal ); + } + return *this; + } + + value_type& operator=( int i ) + { + nVal = i; + strVal = std::to_string( i ); + return *this; + } + + value_type& operator=( std::string const& s ) + { + nVal = std::stoi( s ); + strVal = s; + return *this; + } + }; + + typedef std::pair pair_type; + + struct less + { + bool operator ()( key_type const& v1, key_type const& v2 ) const + { + return v1.nKey < v2.nKey; + } + + bool operator ()( key_type const& v1, int v2 ) const + { + return v1.nKey < v2; + } + + bool operator ()( int v1, key_type const& v2 ) const + { + return v1 < v2.nKey; + } + + bool operator ()( key_type const& v1, std::string const& v2 ) const + { + return v1.nKey < std::stoi(v2 ); + } + + bool operator ()( std::string const& v1, key_type const& v2 ) const + { + return std::stoi( v1 ) < v2.nKey; + } + }; + + struct cmp { + int operator ()( key_type const& v1, key_type const& v2 ) const + { + if ( v1.nKey < v2.nKey ) + return -1; + return v1.nKey > v2.nKey ? 1 : 0; + } + + int operator ()( key_type const& v1, int v2 ) const + { + if ( v1.nKey < v2 ) + return -1; + return v1.nKey > v2 ? 1 : 0; + } + + int operator ()( int v1, key_type const& v2 ) const + { + if ( v1 < v2.nKey ) + return -1; + return v1 > v2.nKey ? 1 : 0; + } + + int operator ()( key_type const& v1, std::string const& v2 ) const + { + int n2 = std::stoi( v2 ); + if ( v1.nKey < n2 ) + return -1; + return v1.nKey > n2 ? 1 : 0; + } + + int operator ()( std::string const& v1, key_type const& v2 ) const + { + int n1 = std::stoi( v1 ); + if ( n1 < v2.nKey ) + return -1; + return n1 > v2.nKey ? 1 : 0; + } + }; + + struct equal_to + { + bool operator ()( key_type const& v1, key_type const& v2 ) const + { + return v1.nKey == v2.nKey; + } + + bool operator ()( key_type const& v1, int v2 ) const + { + return v1.nKey == v2; + } + + bool operator ()( int v1, key_type const& v2 ) const + { + return v1 == v2.nKey; + } + + bool operator ()( key_type const& v1, std::string const& v2 ) const + { + return v1.nKey == std::stoi( v2 ); + } + + bool operator ()( std::string const& v1, key_type const& v2 ) const + { + return std::stoi( v1 ) == v2.nKey; + } + }; + + struct hash1 { + size_t operator()( int i ) const + { + return cds::opt::v::hash()( i ); + } + + size_t operator()( std::string const& str ) const + { + return cds::opt::v::hash()( std::stoi( str )); + } + + template + size_t operator()( T const& i ) const + { + return cds::opt::v::hash()(i.nKey); + } + }; + + struct hash2: private hash1 + { + typedef hash1 base_class; + + size_t operator()( int i ) const + { + size_t h = ~(base_class::operator()( i )); + return ~h + 0x9e3779b9 + (h << 6) + (h >> 2); + } + template + size_t operator()( const Item& i ) const + { + size_t h = ~(base_class::operator()( i )); + return ~h + 0x9e3779b9 + (h << 6) + (h >> 2); + } + }; + + struct other_item { + int nKey; + + other_item( int key ) + : nKey( key ) + {} + }; + + struct other_less + { + bool operator ()( key_type const& v1, other_item const& v2 ) const + { + return v1.nKey < v2.nKey; + } + bool operator ()( other_item const& v1, key_type const& v2 ) const + { + return v1.nKey < v2.nKey; + } + }; + + struct other_equal_to + { + bool operator ()( key_type const& v1, other_item const& v2 ) const + { + return v1.nKey == v2.nKey; + } + bool operator ()( other_item const& v1, key_type const& v2 ) const + { + return v1.nKey == v2.nKey; + } + }; + }; +} // namespace cds_test + +#endif // CDSUNIT_STRIPED_MAP_TEST_MAP_DATA_H