X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Ftest%2Funit%2Fmap%2Ftest_map_nogc.h;fp=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Ftest%2Funit%2Fmap%2Ftest_map_nogc.h;h=6aa5e68641a4f5b331dfcc39000b2cf0483e694a;hb=4223430d9168223029c7639149025c79e69b4f37;hp=0000000000000000000000000000000000000000;hpb=7ea7751a31c0388bf888052517be181a2989b113;p=c11concurrency-benchmarks.git diff --git a/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/map/test_map_nogc.h b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/map/test_map_nogc.h new file mode 100644 index 0000000..6aa5e68 --- /dev/null +++ b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/map/test_map_nogc.h @@ -0,0 +1,259 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017 + + 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_MAP_TEST_MAP_NOGC_H +#define CDSUNIT_MAP_TEST_MAP_NOGC_H + +#include "test_map_data.h" + +// forward declaration +namespace cds { namespace container {} } + +namespace cds_test { + + class container_map_nogc: public map_fixture + { + public: + static size_t const kSize = 1000; + + protected: + 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 Map::iterator iterator; + 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 ) != m.end()); + ASSERT_FALSE( m.contains( i ) != m.end()); + ASSERT_FALSE( m.contains( other_item( i.nKey ), other_less()) != m.end()); + + std::pair< iterator, bool > updResult; + iterator it; + switch ( i.nKey % 16 ) { + case 0: + it = m.insert( i ); + ASSERT_FALSE( it == m.end()); + ASSERT_TRUE( m.insert( i ) == m.end()); + it->second.nVal = it->first.nKey; + it->second.strVal = std::to_string( it->first.nKey ); + break; + case 1: + it = m.insert( i.nKey ); + ASSERT_FALSE( it == m.end()); + ASSERT_TRUE( m.insert( i.nKey ) == m.end()); + it->second.nVal = it->first.nKey; + it->second.strVal = std::to_string( it->first.nKey ); + break; + case 2: + it = m.insert( std::to_string( i.nKey )); + ASSERT_FALSE( it == m.end()); + ASSERT_TRUE( m.insert( std::to_string( i.nKey )) == m.end()); + it->second.nVal = it->first.nKey; + it->second.strVal = std::to_string( it->first.nKey ); + break; + case 3: + it = m.insert( i, val ); + ASSERT_FALSE( it == m.end()); + ASSERT_TRUE( m.insert( i, val ) == m.end()); + break; + case 4: + it = m.insert( i.nKey, val.strVal ); + ASSERT_FALSE( it == m.end()); + ASSERT_TRUE( m.insert( i.nKey, val.strVal ) == m.end()); + break; + case 5: + it = m.insert( val.strVal, i.nKey ); + ASSERT_FALSE( it == m.end()); + ASSERT_TRUE( m.insert( val.strVal, i.nKey ) == m.end()); + break; + case 6: + it = m.insert_with( i, []( map_pair& v ) { + v.second.nVal = v.first.nKey; + v.second.strVal = std::to_string( v.first.nKey ); + } ); + ASSERT_FALSE( it == m.end()); + ASSERT_TRUE( m.insert_with( i, []( map_pair& ) { + EXPECT_TRUE( false ); + } ) == m.end()); + break; + case 7: + it = 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( it == m.end()); + ASSERT_TRUE( m.insert_with( i.nKey, []( map_pair& ) { + EXPECT_TRUE( false ); + } ) == m.end()); + break; + case 8: + it = 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( it == m.end()); + ASSERT_TRUE( m.insert_with( val.strVal, []( map_pair& ) { + EXPECT_TRUE( false ); + } ) == m.end()); + break; + case 9: + updResult = m.update( i.nKey, false ); + ASSERT_TRUE( updResult.first == m.end()); + ASSERT_FALSE( updResult.second ); + + updResult = m.update( i.nKey ); + ASSERT_TRUE( updResult.first != m.end()); + ASSERT_TRUE( updResult.second ); + updResult.first->second.nVal = updResult.first->first.nKey; + + updResult = m.update( i.nKey, false ); + ASSERT_TRUE( updResult.first != m.end()); + ASSERT_FALSE( updResult.second ); + EXPECT_EQ( updResult.first->first.nKey, updResult.first->second.nVal ); + updResult.first->second.strVal = std::to_string( updResult.first->second.nVal ); + break; + case 10: + updResult = m.update( i, false ); + ASSERT_TRUE( updResult.first == m.end()); + ASSERT_FALSE( updResult.second ); + + updResult = m.update( i ); + ASSERT_TRUE( updResult.first != m.end()); + ASSERT_TRUE( updResult.second ); + updResult.first->second.nVal = updResult.first->first.nKey; + + updResult = m.update( i ); + ASSERT_TRUE( updResult.first != m.end()); + ASSERT_FALSE( updResult.second ); + EXPECT_EQ( updResult.first->first.nKey, updResult.first->second.nVal ); + updResult.first->second.strVal = std::to_string( updResult.first->second.nVal ); + break; + case 11: + updResult = m.update( val.strVal, false ); + ASSERT_TRUE( updResult.first == m.end()); + ASSERT_FALSE( updResult.second ); + + updResult = m.update( val.strVal ); + ASSERT_TRUE( updResult.first != m.end()); + ASSERT_TRUE( updResult.second ); + updResult.first->second.nVal = updResult.first->first.nKey; + + updResult = m.update( val.strVal, false ); + ASSERT_TRUE( updResult.first != m.end()); + ASSERT_FALSE( updResult.second ); + EXPECT_EQ( updResult.first->first.nKey, updResult.first->second.nVal ); + updResult.first->second.strVal = std::to_string( updResult.first->second.nVal ); + break; + case 12: + it = m.emplace( i.nKey ); + ASSERT_TRUE( it != m.end()); + ASSERT_FALSE( m.emplace( i.nKey ) != m.end()); + it->second.nVal = it->first.nKey; + it->second.strVal = std::to_string( it->first.nKey ); + break; + case 13: + it = m.emplace( i, i.nKey ); + ASSERT_TRUE( it != m.end()); + ASSERT_FALSE( m.emplace( i, i.nKey ) != m.end()); + break; + case 14: + { + std::string str = val.strVal; + it = m.emplace( i, std::move( str )); + ASSERT_TRUE( it != m.end()); + ASSERT_TRUE( str.empty()); + str = val.strVal; + ASSERT_FALSE( m.emplace( i, std::move( str )) != m.end()); + ASSERT_TRUE( str.empty()); + } + break; + case 15: + { + std::string str = val.strVal; + it = m.emplace( i, i.nKey, std::move( str )); + ASSERT_TRUE( it != m.end()); + ASSERT_TRUE( str.empty()); + str = val.strVal; + ASSERT_FALSE( m.emplace( i, i.nKey, std::move( str )) != m.end()); + ASSERT_TRUE( str.empty()); + } + break; + } + + it = m.contains( i.nKey ); + ASSERT_TRUE( it != m.end()); + ASSERT_TRUE( m.contains( i ) == it ); + ASSERT_TRUE( m.contains( other_item( i.nKey ), other_less()) == it ); + EXPECT_EQ( it->first.nKey, it->second.nVal ); + EXPECT_EQ( std::to_string( it->first.nKey ), it->second.strVal ); + } + ASSERT_FALSE( m.empty()); + ASSERT_CONTAINER_SIZE( m, kkSize ); + ASSERT_FALSE( m.begin() == m.end()); + ASSERT_FALSE( m.cbegin() == m.cend()); + + // clear + + m.clear(); + + ASSERT_TRUE( m.empty()); + ASSERT_CONTAINER_SIZE( m, 0 ); + ASSERT_TRUE( m.begin() == m.end()); + ASSERT_TRUE( m.cbegin() == m.cend()); + } + }; + +} // namespace cds_test + +#endif // #ifndef CDSUNIT_MAP_TEST_MAP_NOGC_H