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:
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.
+ 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>
+#include "test_map_data.h"
// forward declaration
namespace cds { namespace container {} }
namespace cds_test {
- class container_map_nogc: public fixture
+ class container_map_nogc: public map_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 )
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;
break;
case 1:
it = m.insert( i.nKey );
- ASSERT_FALSE( it == m.end() );
+ 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_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_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_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_FALSE( it == m.end());
ASSERT_TRUE( m.insert( val.strVal, i.nKey ) == m.end());
break;
case 6:
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 ) {
+ ASSERT_FALSE( it == m.end());
+ ASSERT_TRUE( m.insert_with( i, []( map_pair& ) {
EXPECT_TRUE( false );
} ) == m.end());
break;
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 ) {
+ ASSERT_FALSE( it == m.end());
+ ASSERT_TRUE( m.insert_with( i.nKey, []( map_pair& ) {
EXPECT_TRUE( false );
} ) == m.end());
break;
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 ) {
+ 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_TRUE( updResult.first == m.end());
ASSERT_FALSE( updResult.second );
updResult = m.update( i.nKey );
updResult.first->second.nVal = updResult.first->first.nKey;
updResult = m.update( i.nKey, false );
- ASSERT_TRUE( updResult.first != m.end() );
+ 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_TRUE( updResult.first == m.end());
ASSERT_FALSE( updResult.second );
updResult = m.update( i );
break;
case 13:
it = m.emplace( i, i.nKey );
- ASSERT_TRUE( it != m.end() );
+ 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( it != m.end());
ASSERT_TRUE( str.empty());
str = val.strVal;
ASSERT_FALSE( m.emplace( i, std::move( str )) != m.end());
{
std::string str = val.strVal;
it = m.emplace( i, i.nKey, std::move( str ));
- ASSERT_TRUE( it != m.end() );
+ ASSERT_TRUE( it != m.end());
ASSERT_TRUE( str.empty());
str = val.strVal;
ASSERT_FALSE( m.emplace( i, i.nKey, std::move( str )) != m.end());
EXPECT_EQ( it->first.nKey, it->second.nVal );
EXPECT_EQ( std::to_string( it->first.nKey ), it->second.strVal );
}
- ASSERT_FALSE( m.empty() );
+ ASSERT_FALSE( m.empty());
ASSERT_CONTAINER_SIZE( m, kkSize );
- ASSERT_FALSE( m.begin() == m.end() );
- ASSERT_FALSE( m.cbegin() == m.cend() );
+ ASSERT_FALSE( m.begin() == m.end());
+ ASSERT_FALSE( m.cbegin() == m.cend());
// clear
m.clear();
- ASSERT_TRUE( m.empty() );
+ ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
- ASSERT_TRUE( m.begin() == m.end() );
- ASSERT_TRUE( m.cbegin() == m.cend() );
+ ASSERT_TRUE( m.begin() == m.end());
+ ASSERT_TRUE( m.cbegin() == m.cend());
}
};
projects / libcds.git / blobdiff