projects
/
libcds.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Removed redundant spaces
[libcds.git]
/
test
/
unit
/
set
/
test_michael_iterable_hp.h
diff --git
a/test/unit/set/test_michael_iterable_hp.h
b/test/unit/set/test_michael_iterable_hp.h
index ca75015eebfebd277765f30dab88c6a7ac62b299..ba0679b97827d29efe318d2ea17b715f8f30ca3e 100644
(file)
--- a/
test/unit/set/test_michael_iterable_hp.h
+++ b/
test/unit/set/test_michael_iterable_hp.h
@@
-46,7
+46,7
@@
namespace cds_test {
// Precondition: set is empty
// Postcondition: set is empty
// Precondition: set is empty
// Postcondition: set is empty
- EXPECT_TRUE( s.empty()
);
+ EXPECT_TRUE( s.empty());
EXPECT_CONTAINER_SIZE( s, 0 );
base_class::test( s );
EXPECT_CONTAINER_SIZE( s, 0 );
base_class::test( s );
@@
-59,15
+59,15
@@
namespace cds_test {
data.reserve( kSize );
indices.reserve( kSize );
for ( size_t key = 0; key < kSize; ++key ) {
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 );
}
indices.push_back( key );
}
- shuffle( indices.begin(), indices.end()
);
+ shuffle( indices.begin(), indices.end());
for ( auto& i : data ) {
for ( auto& i : data ) {
- EXPECT_TRUE( s.insert( i )
);
+ EXPECT_TRUE( s.insert( i ));
}
}
- EXPECT_FALSE( s.empty()
);
+ EXPECT_FALSE( s.empty());
EXPECT_CONTAINER_SIZE( s, nSetSize );
// iterator test
EXPECT_CONTAINER_SIZE( s, nSetSize );
// iterator test
@@
-89,7
+89,7
@@
namespace cds_test {
EXPECT_TRUE( !gp );
switch ( idx % 3 ) {
case 0:
EXPECT_TRUE( !gp );
switch ( idx % 3 ) {
case 0:
- gp = s.get( i.key()
);
+ gp = s.get( i.key());
ASSERT_FALSE( !gp );
break;
case 1:
ASSERT_FALSE( !gp );
break;
case 1:
@@
-97,11
+97,11
@@
namespace cds_test {
ASSERT_FALSE( !gp );
break;
case 2:
ASSERT_FALSE( !gp );
break;
case 2:
- gp = s.get_with( other_item( i.key()
), other_less()
);
+ gp = s.get_with( other_item( i.key()
), other_less()
);
ASSERT_FALSE( !gp );
}
ASSERT_FALSE( !gp );
}
- EXPECT_EQ( gp->key(), i.key()
);
- EXPECT_EQ( gp->nFindCount,
i.key() * 3
);
+ EXPECT_EQ( gp->key(), i.key());
+ EXPECT_EQ( gp->nFindCount,
static_cast<size_t>( i.key() * 3 )
);
gp->nFindCount *= 2;
gp.release();
gp->nFindCount *= 2;
gp.release();
@@
-114,7
+114,7
@@
namespace cds_test {
EXPECT_TRUE( !gp );
switch ( idx % 3 ) {
case 0:
EXPECT_TRUE( !gp );
switch ( idx % 3 ) {
case 0:
- gp = s.extract( i.key()
);
+ gp = s.extract( i.key());
ASSERT_FALSE( !gp );
break;
case 1:
ASSERT_FALSE( !gp );
break;
case 1:
@@
-122,28
+122,28
@@
namespace cds_test {
ASSERT_FALSE( !gp );
break;
case 2:
ASSERT_FALSE( !gp );
break;
case 2:
- gp = s.extract_with( other_item( i.key()
), other_less()
);
+ gp = s.extract_with( other_item( i.key()
), other_less()
);
ASSERT_FALSE( !gp );
break;
}
ASSERT_FALSE( !gp );
break;
}
- EXPECT_EQ( gp->key(), i.key()
);
- EXPECT_EQ( gp->nFindCount,
i.key() * 6
);
+ EXPECT_EQ( gp->key(), i.key());
+ EXPECT_EQ( gp->nFindCount,
static_cast<size_t>( i.key() * 6 )
);
switch ( idx % 3 ) {
case 0:
switch ( idx % 3 ) {
case 0:
- gp = s.extract( i.key()
);
+ gp = s.extract( i.key());
break;
case 1:
gp = s.extract( i );
break;
case 2:
break;
case 1:
gp = s.extract( i );
break;
case 2:
- gp = s.extract_with( other_item( i.key()
), other_less()
);
+ gp = s.extract_with( other_item( i.key()
), other_less()
);
break;
}
EXPECT_TRUE( !gp );
}
break;
}
EXPECT_TRUE( !gp );
}
- EXPECT_TRUE( s.empty()
);
+ EXPECT_TRUE( s.empty());
EXPECT_CONTAINER_SIZE( s, 0 );
}
EXPECT_CONTAINER_SIZE( s, 0 );
}