--- /dev/null
+/*
+ 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_nogc.h"
+
+#include <cds/container/lazy_kvlist_nogc.h>
+#include <cds/container/michael_map_nogc.h>
+
+namespace {
+ namespace cc = cds::container;
+ typedef cds::gc::nogc gc_type;
+
+ class MichaelLazyMap_NoGC : public cds_test::container_map_nogc
+ {
+ protected:
+ typedef cds_test::container_map_nogc base_class;
+
+ //void SetUp()
+ //{}
+
+ //void TearDown()
+ //{}
+ };
+
+ TEST_F( MichaelLazyMap_NoGC, compare )
+ {
+ typedef cc::LazyKVList< gc_type, key_type, value_type,
+ typename cc::lazy_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ > list_type;
+
+ typedef cc::MichaelHashMap< gc_type, list_type,
+ typename cc::michael_map::make_traits<
+ cds::opt::hash< hash1 >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( MichaelLazyMap_NoGC, less )
+ {
+ typedef cc::LazyKVList< gc_type, key_type, value_type,
+ typename cc::lazy_list::make_traits<
+ cds::opt::less< base_class::less >
+ >::type
+ > list_type;
+
+ typedef cc::MichaelHashMap< gc_type, list_type,
+ typename cc::michael_map::make_traits<
+ cds::opt::hash< hash1 >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( MichaelLazyMap_NoGC, cmpmix )
+ {
+ struct list_traits : public cc::lazy_list::traits
+ {
+ typedef base_class::less less;
+ typedef cmp compare;
+ };
+ typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
+
+ typedef cc::MichaelHashMap< gc_type, list_type,
+ typename cc::michael_map::make_traits<
+ cds::opt::hash< hash1 >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( MichaelLazyMap_NoGC, backoff )
+ {
+ struct list_traits : public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::exponential<cds::backoff::pause, cds::backoff::yield> back_off;
+ };
+ typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
+
+ struct map_traits : public cc::michael_map::traits
+ {
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ };
+ typedef cc::MichaelHashMap< gc_type, list_type, map_traits >map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+ TEST_F( MichaelLazyMap_NoGC, seq_cst )
+ {
+ struct list_traits : public cc::lazy_list::traits
+ {
+ typedef base_class::less less;
+ typedef cds::backoff::pause back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+ };
+ typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
+
+ struct map_traits : public cc::michael_map::traits
+ {
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ };
+ typedef cc::MichaelHashMap< gc_type, list_type, map_traits >map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+ TEST_F( MichaelLazyMap_NoGC, mutex )
+ {
+ struct list_traits : public cc::lazy_list::traits
+ {
+ typedef base_class::less less;
+ typedef cds::backoff::pause back_off;
+ typedef std::mutex lock_type;
+ };
+ typedef cc::LazyKVList< gc_type, key_type, value_type, list_traits > list_type;
+
+ struct map_traits : public cc::michael_map::traits
+ {
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ };
+ typedef cc::MichaelHashMap< gc_type, list_type, map_traits >map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+} // namespace
--- /dev/null
+/*
+ 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_nogc.h"
+
+#include <cds/container/michael_kvlist_nogc.h>
+#include <cds/container/michael_map_nogc.h>
+
+namespace {
+ namespace cc = cds::container;
+ typedef cds::gc::nogc gc_type;
+
+ class MichaelMap_NoGC : public cds_test::container_map_nogc
+ {
+ protected:
+ typedef cds_test::container_map_nogc base_class;
+
+ //void SetUp()
+ //{}
+
+ //void TearDown()
+ //{}
+ };
+
+ TEST_F( MichaelMap_NoGC, compare )
+ {
+ typedef cc::MichaelKVList< gc_type, key_type, value_type,
+ typename cc::michael_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ > list_type;
+
+ typedef cc::MichaelHashMap< gc_type, list_type,
+ typename cc::michael_map::make_traits<
+ cds::opt::hash< hash1 >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( MichaelMap_NoGC, less )
+ {
+ typedef cc::MichaelKVList< gc_type, key_type, value_type,
+ typename cc::michael_list::make_traits<
+ cds::opt::less< base_class::less >
+ >::type
+ > list_type;
+
+ typedef cc::MichaelHashMap< gc_type, list_type,
+ typename cc::michael_map::make_traits<
+ cds::opt::hash< hash1 >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( MichaelMap_NoGC, cmpmix )
+ {
+ struct list_traits : public cc::michael_list::traits
+ {
+ typedef base_class::less less;
+ typedef cmp compare;
+ };
+ typedef cc::MichaelKVList< gc_type, key_type, value_type, list_traits > list_type;
+
+ typedef cc::MichaelHashMap< gc_type, list_type,
+ typename cc::michael_map::make_traits<
+ cds::opt::hash< hash1 >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( MichaelMap_NoGC, backoff )
+ {
+ struct list_traits : public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::exponential<cds::backoff::pause, cds::backoff::yield> back_off;
+ };
+ typedef cc::MichaelKVList< gc_type, key_type, value_type, list_traits > list_type;
+
+ struct map_traits : public cc::michael_map::traits
+ {
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ };
+ typedef cc::MichaelHashMap< gc_type, list_type, map_traits > map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+ TEST_F( MichaelMap_NoGC, seq_cst )
+ {
+ struct list_traits : public cc::michael_list::traits
+ {
+ typedef base_class::less less;
+ typedef cds::backoff::pause back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+ };
+ typedef cc::MichaelKVList< gc_type, key_type, value_type, list_traits > list_type;
+
+ struct map_traits : public cc::michael_map::traits
+ {
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ };
+ typedef cc::MichaelHashMap< gc_type, list_type, map_traits > map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+} // namespace
--- /dev/null
+/*
+ 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_MAP_TEST_MAP_NOGC_H
+#define CDSUNIT_MAP_TEST_MAP_NOGC_H
+
+#include <cds_test/check_size.h>
+#include <cds_test/fixture.h>
+
+#include <cds/opt/hash.h>
+
+// forward declaration
+namespace cds { namespace container {} }
+
+namespace cds_test {
+
+ class container_map_nogc: public fixture
+ {
+ public:
+ static size_t const kSize = 1000;
+
+ struct key_type {
+ int nKey;
+
+ explicit key_type( int n )
+ : nKey( n )
+ {}
+
+ explicit key_type( std::string const& str )
+ : nKey( std::stoi( str ))
+ {}
+ };
+
+ 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;
+ }
+ };
+
+ typedef std::pair<key_type const, value_type> 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 hash1 {
+ size_t operator()( int i ) const
+ {
+ return cds::opt::v::hash<int>()( i );
+ }
+
+ size_t operator()( std::string const& str ) const
+ {
+ return cds::opt::v::hash<int>()( std::stoi( str ));
+ }
+
+ template <typename T>
+ size_t operator()( T const& i ) const
+ {
+ return cds::opt::v::hash<int>()(i.nKey);
+ }
+ };
+
+ 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;
+ }
+ };
+
+ protected:
+ template <class Map>
+ 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;
+ typedef typename Map::const_iterator const_iterator;
+ size_t const kkSize = kSize;
+
+ std::vector<key_type> arrKeys;
+ for ( int i = 0; i < static_cast<int>(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<int>( 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& v ) {
+ 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& v ) {
+ 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& v ) {
+ 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
projects / libcds.git / commitdiff