Removed redundant spaces

[libcds.git] / test / unit / map / test_map.h

diff --git a/test/unit/map/test_map.h b/test/unit/map/test_map.h
index 5aee1d10ed2f78f08aa3e1ec03f8e7f2de9f475d..6593f3b6c9f1749199330f9c0f9403002d25f56e 100644 (file)
--- a/test/unit/map/test_map.h
+++ b/test/unit/map/test_map.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:
 
@@ -130,7 +130,7 @@ namespace cds_test {
                         v.second.nVal = v.first.nKey;
                         v.second.strVal = std::to_string( v.first.nKey );
                     } ));
-                    EXPECT_FALSE( m.insert_with( i, []( map_pair& v ) {
+                    EXPECT_FALSE( m.insert_with( i, []( map_pair& ) {
                         EXPECT_TRUE( false );
                     } ));
                     break;
@@ -139,7 +139,7 @@ namespace cds_test {
                         v.second.nVal = v.first.nKey;
                         v.second.strVal = std::to_string( v.first.nKey );
                     } ));
-                    EXPECT_FALSE( m.insert_with( i.nKey, []( map_pair& v ) {
+                    EXPECT_FALSE( m.insert_with( i.nKey, []( map_pair& ) {
                         EXPECT_TRUE( false );
                     } ));
                     break;
@@ -148,7 +148,7 @@ namespace cds_test {
                         v.second.nVal = v.first.nKey;
                         v.second.strVal = std::to_string( v.first.nKey );
                     } ));
-                    EXPECT_FALSE( m.insert_with( val.strVal, []( map_pair& v ) {
+                    EXPECT_FALSE( m.insert_with( val.strVal, []( map_pair& ) {
                         EXPECT_TRUE( false );
                     } ));
                     break;
@@ -268,19 +268,19 @@ namespace cds_test {
                     EXPECT_EQ( std::to_string( v.first.nKey ), v.second.strVal );
                 } ));
             }
-            EXPECT_FALSE( m.empty() );
+            EXPECT_FALSE( m.empty());
             EXPECT_CONTAINER_SIZE( m, kkSize );
-            EXPECT_FALSE( m.begin() == m.end() );
-            EXPECT_FALSE( m.cbegin() == m.cend() );
+            EXPECT_FALSE( m.begin() == m.end());
+            EXPECT_FALSE( m.cbegin() == m.cend());
 
-            shuffle( arrKeys.begin(), arrKeys.end() );
+            shuffle( arrKeys.begin(), arrKeys.end());
 
             // erase/find
             for ( auto const& i : arrKeys ) {
-                value_type const& val( arrVals.at( i.nKey ) );
+                value_type const& val( arrVals.at( i.nKey ));
 
                 EXPECT_TRUE( m.contains( i.nKey ));
-                EXPECT_TRUE( m.contains( val.strVal ) );
+                EXPECT_TRUE( m.contains( val.strVal ));
                 EXPECT_TRUE( m.contains( i ));
                 EXPECT_TRUE( m.contains( other_item( i.nKey ), other_less()));
                 EXPECT_TRUE( m.find( i, []( map_pair const& v ) {
@@ -366,7 +366,7 @@ namespace cds_test {
                     EXPECT_TRUE( false );
                 } ));
             }
-            EXPECT_TRUE( m.empty() );
+            EXPECT_TRUE( m.empty());
             EXPECT_CONTAINER_SIZE( m, 0 );
 
             EXPECT_TRUE( m.begin() == m.end());
@@ -376,12 +376,12 @@ namespace cds_test {
             for ( auto const& i : arrKeys )
                 EXPECT_TRUE( m.insert( i ));
 
-            EXPECT_FALSE( m.empty() );
+            EXPECT_FALSE( m.empty());
             EXPECT_CONTAINER_SIZE( m, kkSize );
 
             m.clear();
 
-            EXPECT_TRUE( m.empty() );
+            EXPECT_TRUE( m.empty());
             EXPECT_CONTAINER_SIZE( m, 0 );
         }
     };