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_INTRUSIVE_SET_RCU_H
base_class::test( s );
- ASSERT_TRUE( s.empty() );
+ ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0 );
typedef typename Set::value_type value_type;
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());
typename Set::exempt_ptr xp;
typename Set::raw_ptr rp;
rcu_lock l;
rp = s.get( i );
ASSERT_TRUE( !rp );
- rp = s.get( i.key() );
+ rp = s.get( i.key());
ASSERT_TRUE( !rp );
rp = s.get_with( other_item( i.key()), other_less());
ASSERT_TRUE( !rp );
xp = s.extract( i );
ASSERT_TRUE( !xp );
- xp = s.extract( i.key() );
+ xp = s.extract( i.key());
ASSERT_TRUE( !xp );
- xp = s.extract_with( other_item( i.key() ), other_less() );
+ xp = s.extract_with( other_item( i.key()), other_less());
ASSERT_TRUE( !xp );
}
else {
xp = s.extract( i );
ASSERT_TRUE( !xp );
- xp = s.extract( i.key() );
+ xp = s.extract( i.key());
ASSERT_TRUE( !xp );
- xp = s.extract_with( other_item( i.key() ), other_less() );
+ xp = s.extract_with( other_item( i.key()), other_less());
ASSERT_TRUE( !xp );
}
}
// fill set
for ( auto& i : data ) {
i.nDisposeCount = 0;
- ASSERT_TRUE( s.insert( i ) );
+ ASSERT_TRUE( s.insert( i ));
}
// get/extract
{
rcu_lock l;
- EXPECT_EQ( i.nFindCount, 0 );
+ EXPECT_EQ( i.nFindCount, 0u );
rp = s.get( i );
ASSERT_FALSE( !rp );
++rp->nFindCount;
- EXPECT_EQ( i.nFindCount, 1 );
+ EXPECT_EQ( i.nFindCount, 1u );
- rp = s.get( i.key() );
+ rp = s.get( i.key());
ASSERT_FALSE( !rp );
++rp->nFindCount;
- EXPECT_EQ( i.nFindCount, 2 );
+ EXPECT_EQ( i.nFindCount, 2u );
rp = s.get_with( other_item( i.key()), other_less());
ASSERT_FALSE( !rp );
++rp->nFindCount;
- EXPECT_EQ( i.nFindCount, 3 );
+ EXPECT_EQ( i.nFindCount, 3u );
}
if ( Set::c_bExtractLockExternal ) {
{
rcu_lock l;
- EXPECT_EQ( i.nEraseCount, 0 );
+ EXPECT_EQ( i.nEraseCount, 0u );
switch ( i.key() % 3 ) {
case 0:
xp = s.extract( i.key());
xp = s.extract( i );
break;
case 2:
- xp = s.extract_with( other_item( i.key() ), other_less() );
+ xp = s.extract_with( other_item( i.key()), other_less());
break;
}
ASSERT_FALSE( !xp );
++xp->nEraseCount;
}
- EXPECT_EQ( i.nEraseCount, 1 );
+ EXPECT_EQ( i.nEraseCount, 1u );
xp.release();
{
xp = s.extract( i );
ASSERT_TRUE( !xp );
- xp = s.extract( i.key() );
+ xp = s.extract( i.key());
ASSERT_TRUE( !xp );
- xp = s.extract_with( other_item( i.key() ), other_less() );
+ xp = s.extract_with( other_item( i.key()), other_less());
ASSERT_TRUE( !xp );
}
}
else {
- EXPECT_EQ( i.nEraseCount, 0 );
+ EXPECT_EQ( i.nEraseCount, 0u );
switch ( i.key() % 3 ) {
case 0:
xp = s.extract( i.key());
xp = s.extract( i );
break;
case 2:
- xp = s.extract_with( other_item( i.key() ), other_less() );
+ xp = s.extract_with( other_item( i.key()), other_less());
break;
}
ASSERT_FALSE( !xp );
++xp->nEraseCount;
- EXPECT_EQ( i.nEraseCount, 1 );
+ EXPECT_EQ( i.nEraseCount, 1u );
xp = s.extract( i );
ASSERT_TRUE( !xp );
- xp = s.extract( i.key() );
+ xp = s.extract( i.key());
ASSERT_TRUE( !xp );
- xp = s.extract_with( other_item( i.key() ), other_less() );
+ xp = s.extract_with( other_item( i.key()), other_less());
ASSERT_TRUE( !xp );
}
}
- ASSERT_TRUE( s.empty() );
+ ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0 );
// Force retiring cycle
Set::gc::force_dispose();
for ( auto& i : data ) {
- EXPECT_EQ( i.nDisposeCount, 1 );
+ EXPECT_EQ( i.nDisposeCount, 1u );
}
}
};