/*
This file is a part of libcds - Concurrent Data Structures library
- (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+ (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:
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_SET_TEST_FELDMAN_HASHSET_H
void clear_stat()
{
- memset( this, 0, sizeof( *this ) );
+ memset( this, 0, sizeof( *this ));
}
};
template <typename Q>
explicit int_item( Q const& src )
- : nKey( src.key() )
+ : nKey( src.key())
, nVal( 0 )
{}
int_item( int_item&& src )
: nKey( src.nKey )
, nVal( src.nVal )
- , strVal( std::move( src.strVal ) )
+ , strVal( std::move( src.strVal ))
{}
int_item( int k, std::string&& s )
: nKey( k )
, nVal( k * 2 )
- , strVal( std::move( s ) )
+ , strVal( std::move( s ))
{}
explicit int_item( other_item const& s )
- : nKey( s.key() )
+ : nKey( s.key())
, nVal( s.key() * 2 )
{}
}
};
+ struct key_val {
+ int nKey;
+ int nVal;
+
+ key_val()
+ {}
+
+ key_val( int key )
+ : nKey( key )
+ , nVal( key )
+ {}
+
+ key_val( int key, int val )
+ : nKey( key )
+ , nVal( val )
+ {}
+
+ key_val( key_val const& v )
+ : nKey( v.nKey )
+ , nVal( v.nVal )
+ {}
+
+ int key() const
+ {
+ return nKey;
+ }
+ };
+
+ struct int_item2: public key_val, public stat
+ {
+ std::string strVal;
+
+ int_item2()
+ {}
+
+ explicit int_item2( int key )
+ : key_val( key )
+ {}
+
+ int_item2( int key, int val )
+ : key_val( key, val )
+ {}
+
+ int_item2( int_item2 const& v )
+ : key_val( v )
+ , stat()
+ , strVal( v.strVal )
+ {}
+
+ int_item2( int_item2&& v )
+ : key_val( v )
+ , stat()
+ , strVal( std::move( v.strVal ))
+ {}
+
+ int_item2( int k, std::string&& s )
+ : key_val( k, k * 2 )
+ , strVal( std::move( s ))
+ {}
+
+ explicit int_item2( other_item const& s )
+ : key_val( s.key(), s.key() * 2 )
+ {}
+ };
+
+
struct get_hash {
int operator()( int_item const& i ) const
{
}
};
+ struct get_hash2 {
+ key_val const& operator()( int_item2 const& i ) const
+ {
+ return i;
+ }
+
+ key_val operator()( other_item const& i ) const
+ {
+ return key_val( i.key());
+ }
+
+ key_val operator()( int i ) const
+ {
+ return key_val( i );
+ }
+ };
+
struct simple_item_counter {
size_t m_nCount;
}
};
+ struct cmp2 {
+ int operator ()( key_val const& v1, key_val const& v2 ) const
+ {
+ if ( v1.key() < v2.key())
+ return -1;
+ return v1.key() > v2.key() ? 1 : 0;
+ }
+ };
+
struct other_less {
template <typename Q, typename T>
bool operator()( Q const& lhs, T const& rhs ) const
// Precondition: set is empty
// Postcondition: set is empty
- ASSERT_TRUE( s.empty() );
+ ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0 );
size_t const nSetSize = kSize;
data.reserve( kSize );
indices.reserve( kSize );
for ( size_t key = 0; key < kSize; ++key ) {
- data.push_back( value_type( static_cast<int>(key) ) );
+ data.push_back( value_type( static_cast<int>(key)));
indices.push_back( key );
}
- shuffle( indices.begin(), indices.end() );
+ shuffle( indices.begin(), indices.end());
// insert/find
for ( auto idx : indices ) {
auto& i = data[idx];
- ASSERT_FALSE( s.contains( i.nKey ) );
+ ASSERT_FALSE( s.contains( i.nKey ));
ASSERT_FALSE( s.find( i.nKey, []( value_type& ) {} ));
std::pair<bool, bool> updResult;
case 0:
ASSERT_TRUE( s.insert( i ));
ASSERT_FALSE( s.insert( i ));
- updResult = s.update( i, []( value_type& val, value_type * prev )
+ updResult = s.update( i, []( value_type& val, value_type * prev )
{
ASSERT_TRUE( prev != nullptr );
- EXPECT_EQ( val.key(), prev->key() );
+ EXPECT_EQ( val.key(), prev->key());
}, false );
EXPECT_TRUE( updResult.first );
EXPECT_FALSE( updResult.second );
break;
case 1:
- ASSERT_TRUE( s.insert( i.key() ));
- ASSERT_FALSE( s.insert( i.key() ));
+ ASSERT_TRUE( s.insert( i.key()));
+ ASSERT_FALSE( s.insert( i.key()));
updResult = s.update( i.key(), []( value_type& val, value_type * prev )
{
ASSERT_TRUE( prev != nullptr );
- EXPECT_EQ( val.key(), prev->key() );
+ EXPECT_EQ( val.key(), prev->key());
}, false );
EXPECT_TRUE( updResult.first );
EXPECT_FALSE( updResult.second );
case 2:
ASSERT_TRUE( s.insert( i, []( value_type& v ) { ++v.nFindCount; } ));
ASSERT_FALSE( s.insert( i, []( value_type& v ) { ++v.nFindCount; } ));
- ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
+ ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
{
- EXPECT_EQ( v.nFindCount, 1 );
+ EXPECT_EQ( v.nFindCount, 1u );
}));
break;
case 3:
ASSERT_TRUE( s.insert( i.key(), []( value_type& v ) { ++v.nFindCount; } ));
ASSERT_FALSE( s.insert( i.key(), []( value_type& v ) { ++v.nFindCount; } ));
- ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
+ ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
{
- EXPECT_EQ( v.nFindCount, 1 );
+ EXPECT_EQ( v.nFindCount, 1u );
}));
break;
case 4:
updResult = s.update( i, []( value_type& v, value_type * prev )
{
ASSERT_TRUE( prev != nullptr );
- EXPECT_EQ( prev->nUpdateNewCount, 1 );
- EXPECT_EQ( v.key(), prev->key() );
+ EXPECT_EQ( prev->nUpdateNewCount, 1u );
+ EXPECT_EQ( v.key(), prev->key());
++v.nUpdateCount;
}, false );
EXPECT_TRUE( updResult.first );
ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
{
- EXPECT_EQ( v.nUpdateCount, 1 );
- EXPECT_EQ( v.nUpdateNewCount, 0 );
+ EXPECT_EQ( v.nUpdateCount, 1u );
+ EXPECT_EQ( v.nUpdateNewCount, 0u );
}));
break;
case 5:
updResult = s.update( i.key(), []( value_type& v, value_type * prev )
{
ASSERT_TRUE( prev != nullptr );
- EXPECT_EQ( v.key(), prev->key() );
- EXPECT_EQ( prev->nUpdateNewCount, 1 );
- EXPECT_EQ( v.nUpdateNewCount, 0 );
+ EXPECT_EQ( v.key(), prev->key());
+ EXPECT_EQ( prev->nUpdateNewCount, 1u );
+ EXPECT_EQ( v.nUpdateNewCount, 0u );
++v.nUpdateNewCount;
}, false );
EXPECT_TRUE( updResult.first );
ASSERT_TRUE( s.find( i.key(), []( value_type const& v )
{
- EXPECT_EQ( v.nUpdateNewCount, 1 );
- } ) );
+ EXPECT_EQ( v.nUpdateNewCount, 1u );
+ } ));
break;
case 6:
- ASSERT_TRUE( s.emplace( i.key() ) );
- ASSERT_TRUE( s.contains( i.key() ) );
+ ASSERT_TRUE( s.emplace( i.key()));
+ ASSERT_TRUE( s.contains( i.key()));
break;
case 7:
str = "Hello!";
- ASSERT_TRUE( s.emplace( i.key(), std::move( str ) ) );
- EXPECT_TRUE( str.empty() );
+ ASSERT_TRUE( s.emplace( i.key(), std::move( str )));
+ EXPECT_TRUE( str.empty());
ASSERT_TRUE( s.find( i.key(), []( value_type const& v )
{
- EXPECT_EQ( v.strVal, std::string( "Hello!" ) );
- } ) );
+ EXPECT_EQ( v.strVal, std::string( "Hello!" ));
+ } ));
break;
default:
// forgot anything?..
ASSERT_TRUE( false );
}
- ASSERT_TRUE( s.contains( i.nKey ) );
- ASSERT_TRUE( s.find( i.nKey, []( value_type& ) {} ) );
+ ASSERT_TRUE( s.contains( i.nKey ));
+ ASSERT_TRUE( s.find( i.nKey, []( value_type& ) {} ));
}
- ASSERT_FALSE( s.empty() );
+ ASSERT_FALSE( s.empty());
ASSERT_CONTAINER_SIZE( s, nSetSize );
// erase
- shuffle( indices.begin(), indices.end() );
+ shuffle( indices.begin(), indices.end());
for ( auto idx : indices ) {
auto& i = data[idx];
- ASSERT_TRUE( s.contains( i.nKey ) );
+ ASSERT_TRUE( s.contains( i.nKey ));
ASSERT_TRUE( s.find( i.nKey, []( value_type& v )
{
v.nFindCount = 1;
- } ) );
+ } ));
int nKey = i.key() - 1;
switch ( idx % 2 ) {
case 0:
- ASSERT_TRUE( s.erase( i.key() ) );
- ASSERT_FALSE( s.erase( i.key() ) );
+ ASSERT_TRUE( s.erase( i.key()));
+ ASSERT_FALSE( s.erase( i.key()));
break;
case 1:
ASSERT_TRUE( s.erase( i.key(), [&nKey]( value_type const& v )
{
- EXPECT_EQ( v.nFindCount, 1 );
+ EXPECT_EQ( v.nFindCount, 1u );
nKey = v.key();
- } ) );
+ } ));
EXPECT_EQ( i.key(), nKey );
nKey = i.key() - 1;
ASSERT_FALSE( s.erase( i.key(), [&nKey]( value_type const& v )
{
nKey = v.key();
- } ) );
+ } ));
EXPECT_EQ( i.key(), nKey + 1 );
break;
}
- ASSERT_FALSE( s.contains( i.nKey ) );
- ASSERT_FALSE( s.find( i.nKey, []( value_type const& ) {} ) );
+ ASSERT_FALSE( s.contains( i.nKey ));
+ ASSERT_FALSE( s.find( i.nKey, []( value_type const& ) {} ));
}
- ASSERT_TRUE( s.empty() );
- ASSERT_CONTAINER_SIZE( s, 0 );
+ ASSERT_TRUE( s.empty());
+ ASSERT_CONTAINER_SIZE( s, 0u );
// clear
for ( auto& i : data ) {
- ASSERT_TRUE( s.insert( i ) );
+ ASSERT_TRUE( s.insert( i ));
}
{
std::vector< typename Set::level_statistics > lstat;
s.get_level_statistics( lstat );
- EXPECT_EQ( lstat[0].node_capacity, s.head_size() );
+ EXPECT_EQ( lstat[0].node_capacity, s.head_size());
for ( size_t i = 1; i < lstat.size(); ++i ) {
EXPECT_EQ( lstat[i].node_capacity, s.array_node_size());
}
}
- ASSERT_FALSE( s.empty() );
+ ASSERT_FALSE( s.empty());
ASSERT_CONTAINER_SIZE( s, nSetSize );
s.clear();
- ASSERT_TRUE( s.empty() );
- ASSERT_CONTAINER_SIZE( s, 0 );
+ ASSERT_TRUE( s.empty());
+ ASSERT_CONTAINER_SIZE( s, 0u );
- ASSERT_TRUE( s.begin() == s.end() );
- ASSERT_TRUE( s.cbegin() == s.cend() );
- ASSERT_TRUE( s.rbegin() == s.rend() );
- ASSERT_TRUE( s.crbegin() == s.crend() );
+ ASSERT_TRUE( s.begin() == s.end());
+ ASSERT_TRUE( s.cbegin() == s.cend());
+ ASSERT_TRUE( s.rbegin() == s.rend());
+ ASSERT_TRUE( s.crbegin() == s.crend());
}
};
projects / libcds.git / blobdiff