Removed redundant spaces

[libcds.git] / test / unit / tree / test_tree_set_hp.h

diff --git a/test/unit/tree/test_tree_set_hp.h b/test/unit/tree/test_tree_set_hp.h
index b0bed2f5fae0dacbcdfd5047316b22f09356efb3..0d7194cbf14cb6f42d35619c0fd50d412f1a38bd 100644 (file)
--- a/test/unit/tree/test_tree_set_hp.h
+++ b/test/unit/tree/test_tree_set_hp.h
@@ -5,7 +5,7 @@
 
     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:
 
@@ -25,7 +25,7 @@
     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_TREE_SET_HP_H
@@ -46,7 +46,7 @@ namespace cds_test {
             // Precondition: set is empty
             // Postcondition: set is empty
 
-            ASSERT_TRUE( s.empty() );
+            ASSERT_TRUE( s.empty());
             ASSERT_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.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());
 
             for ( auto i : indices ) {
-                ASSERT_TRUE( s.insert( data[i] ) );
+                ASSERT_TRUE( s.insert( data[i] ));
             }
-            ASSERT_FALSE( s.empty() );
+            ASSERT_FALSE( s.empty());
             ASSERT_CONTAINER_SIZE( s, nSetSize );
 
             typedef typename Set::guarded_ptr guarded_ptr;
@@ -80,7 +80,7 @@ namespace cds_test {
                 ASSERT_TRUE( !gp );
                 switch ( idx % 3 ) {
                 case 0:
-                    gp = s.get( i.key() );
+                    gp = s.get( i.key());
                     ASSERT_FALSE( !gp );
                     break;
                 case 1:
@@ -88,10 +88,10 @@ namespace cds_test {
                     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 );
                 }
-                EXPECT_EQ( gp->key(), i.key() );
+                EXPECT_EQ( gp->key(), i.key());
                 gp->nFindCount = gp->key() * 3;
 
                 gp.release();
@@ -104,7 +104,7 @@ namespace cds_test {
                 ASSERT_TRUE( !gp );
                 switch ( idx % 3 ) {
                 case 0:
-                    gp = s.extract( i.key() );
+                    gp = s.extract( i.key());
                     ASSERT_FALSE( !gp );
                     break;
                 case 1:
@@ -112,72 +112,72 @@ namespace cds_test {
                     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;
                 }
-                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 ));
 
                 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:
-                    gp = s.extract_with( other_item( i.key() ), other_less() );
+                    gp = s.extract_with( other_item( i.key()), other_less());
                     break;
                 }
                 ASSERT_TRUE( !gp );
             }
 
-            ASSERT_TRUE( s.empty() );
+            ASSERT_TRUE( s.empty());
             ASSERT_CONTAINER_SIZE( s, 0 );
 
             for ( auto i : indices ) {
-                ASSERT_TRUE( s.insert( data[i] ) );
+                ASSERT_TRUE( s.insert( data[i] ));
             }
-            ASSERT_FALSE( s.empty() );
+            ASSERT_FALSE( s.empty());
             ASSERT_CONTAINER_SIZE( s, nSetSize );
 
             // extract_min
             size_t nCount = 0;
             int nKey = -1;
-            while ( !s.empty() ) {
+            while ( !s.empty()) {
                 gp = s.extract_min();
                 ASSERT_FALSE( !gp );
-                EXPECT_EQ( nKey + 1, gp->key() );
+                EXPECT_EQ( nKey + 1, gp->key());
                 ++nCount;
                 nKey = gp->key();
             }
             gp.release();
             EXPECT_EQ( nCount, nSetSize );
 
-            ASSERT_TRUE( s.empty() );
+            ASSERT_TRUE( s.empty());
             ASSERT_CONTAINER_SIZE( s, 0 );
 
             // extract_max
             for ( auto i : indices ) {
                 ASSERT_TRUE( s.insert( data[i] ));
             }
-            ASSERT_FALSE( s.empty() );
+            ASSERT_FALSE( s.empty());
             ASSERT_CONTAINER_SIZE( s, nSetSize );
 
             nCount = 0;
             nKey = nSetSize;
-            while ( !s.empty() ) {
+            while ( !s.empty()) {
                 gp = s.extract_max();
                 ASSERT_FALSE( !gp );
-                EXPECT_EQ( nKey - 1, gp->key() );
+                EXPECT_EQ( nKey - 1, gp->key());
                 ++nCount;
                 nKey = gp->key();
             }
             gp.release();
             EXPECT_EQ( nCount, nSetSize );
 
-            ASSERT_TRUE( s.empty() );
+            ASSERT_TRUE( s.empty());
             ASSERT_CONTAINER_SIZE( s, 0 );
 
         }