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
/
tree
/
test_tree_map_hp.h
diff --git
a/test/unit/tree/test_tree_map_hp.h
b/test/unit/tree/test_tree_map_hp.h
index 33a9cd9879a920adee9f808beff0b202e3c39a0a..d4973fb8b54d7892d0ea28268a35f700f3606144 100644
(file)
--- a/
test/unit/tree/test_tree_map_hp.h
+++ b/
test/unit/tree/test_tree_map_hp.h
@@
-67,8
+67,8
@@
namespace cds_test {
}
for ( auto const& i : arrKeys )
}
for ( auto const& i : arrKeys )
- ASSERT_TRUE( m.insert( i )
);
- ASSERT_FALSE( m.empty()
);
+ ASSERT_TRUE( m.insert( i ));
+ ASSERT_FALSE( m.empty());
ASSERT_CONTAINER_SIZE( m, kkSize );
// get/extract
ASSERT_CONTAINER_SIZE( m, kkSize );
// get/extract
@@
-115,7
+115,7
@@
namespace cds_test {
gp = m.get_with( other_item( i.nKey ), other_less());
ASSERT_TRUE( !gp );
}
gp = m.get_with( other_item( i.nKey ), other_less());
ASSERT_TRUE( !gp );
}
- ASSERT_TRUE( m.empty()
);
+ ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
gp = m.extract_min();
ASSERT_CONTAINER_SIZE( m, 0 );
gp = m.extract_min();
@@
-124,40
+124,40
@@
namespace cds_test {
EXPECT_TRUE( !gp );
for ( auto const& i : arrKeys )
EXPECT_TRUE( !gp );
for ( auto const& i : arrKeys )
- ASSERT_TRUE( m.insert( i )
);
- ASSERT_FALSE( m.empty()
);
+ ASSERT_TRUE( m.insert( i ));
+ ASSERT_FALSE( m.empty());
ASSERT_CONTAINER_SIZE( m, kkSize );
// extract_min
int nKey = -1;
size_t nCount = 0;
ASSERT_CONTAINER_SIZE( m, kkSize );
// extract_min
int nKey = -1;
size_t nCount = 0;
- while ( !m.empty()
) {
+ while ( !m.empty()) {
gp = m.extract_min();
ASSERT_FALSE( !gp );
EXPECT_EQ( gp->first.nKey, nKey + 1 );
nKey = gp->first.nKey;
++nCount;
}
gp = m.extract_min();
ASSERT_FALSE( !gp );
EXPECT_EQ( gp->first.nKey, nKey + 1 );
nKey = gp->first.nKey;
++nCount;
}
- ASSERT_TRUE( m.empty()
);
+ ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
EXPECT_EQ( nCount, kkSize );
// extract_max
for ( auto const& i : arrKeys )
ASSERT_CONTAINER_SIZE( m, 0 );
EXPECT_EQ( nCount, kkSize );
// extract_max
for ( auto const& i : arrKeys )
- ASSERT_TRUE( m.insert( i )
);
- ASSERT_FALSE( m.empty()
);
+ ASSERT_TRUE( m.insert( i ));
+ ASSERT_FALSE( m.empty());
ASSERT_CONTAINER_SIZE( m, kkSize );
nKey = kkSize;
nCount = 0;
ASSERT_CONTAINER_SIZE( m, kkSize );
nKey = kkSize;
nCount = 0;
- while ( !m.empty()
) {
+ while ( !m.empty()) {
gp = m.extract_max();
ASSERT_FALSE( !gp );
EXPECT_EQ( gp->first.nKey, nKey - 1 );
nKey = gp->first.nKey;
++nCount;
}
gp = m.extract_max();
ASSERT_FALSE( !gp );
EXPECT_EQ( gp->first.nKey, nKey - 1 );
nKey = gp->first.nKey;
++nCount;
}
- ASSERT_TRUE( m.empty()
);
+ ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
EXPECT_EQ( nCount, kkSize );
ASSERT_CONTAINER_SIZE( m, 0 );
EXPECT_EQ( nCount, kkSize );