Removed redundant spaces

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

diff --git a/test/unit/map/test_feldman_hashmap_hp.h b/test/unit/map/test_feldman_hashmap_hp.h
index 004f30ae310a7ab5a0538f72722fea9000ba9161..3b22a9fba7711f4ca6e88ccbacd529744d3154b3 100644 (file)
--- a/test/unit/map/test_feldman_hashmap_hp.h
+++ b/test/unit/map/test_feldman_hashmap_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_MAP_TEST_FELDMAN_HASHMAP_HP_H
@@ -51,7 +51,7 @@ namespace cds_test {
             ASSERT_TRUE( m.empty());
             ASSERT_CONTAINER_SIZE( m, 0 );
 
-            typedef typename Map::value_type map_pair;
+            //typedef typename Map::value_type map_pair;
             size_t const kkSize = base_class::kSize;
 
             std::vector<key_type> arrKeys;
@@ -68,8 +68,8 @@ namespace cds_test {
             }
 
             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 );
 
             // iterators
@@ -139,13 +139,13 @@ namespace cds_test {
                 gp = m.get( i );
                 ASSERT_TRUE( !gp );
             }
-            ASSERT_TRUE( m.empty() );
+            ASSERT_TRUE( m.empty());
             ASSERT_CONTAINER_SIZE( m, 0 );
 
             // erase_at( iterator )
             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 );
 
             nCount = 0;
@@ -155,55 +155,55 @@ namespace cds_test {
                 ++nCount;
             }
             EXPECT_EQ( nCount, kkSize );
-            ASSERT_TRUE( m.empty() );
+            ASSERT_TRUE( m.empty());
             ASSERT_CONTAINER_SIZE( m, 0 );
 
             // erase_at( reverse_iterator )
             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 );
 
             nCount = 0;
             for ( auto it = m.rbegin(); it != m.rend(); ++it ) {
                 EXPECT_EQ( it->second.nVal, 0 );
-                ASSERT_TRUE( m.erase_at( it ) );
+                ASSERT_TRUE( m.erase_at( it ));
                 ++nCount;
             }
             EXPECT_EQ( nCount, kkSize );
-            ASSERT_TRUE( m.empty() );
+            ASSERT_TRUE( m.empty());
             ASSERT_CONTAINER_SIZE( m, 0 );
 
             // erase_at( const_reverse_iterator )
             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 );
 
             nCount = 0;
             for ( auto it = m.crbegin(); it != m.crend(); ++it ) {
                 EXPECT_EQ( it->second.nVal, 0 );
-                ASSERT_TRUE( m.erase_at( it ) );
+                ASSERT_TRUE( m.erase_at( it ));
                 ++nCount;
             }
             EXPECT_EQ( nCount, kkSize );
-            ASSERT_TRUE( m.empty() );
+            ASSERT_TRUE( m.empty());
             ASSERT_CONTAINER_SIZE( m, 0 );
 
             // erase_at( const_iterator )
             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 );
 
             nCount = 0;
             for ( auto it = m.cbegin(); it != m.cend(); ++it ) {
                 EXPECT_EQ( it->second.nVal, 0 );
-                ASSERT_TRUE( m.erase_at( it ) );
+                ASSERT_TRUE( m.erase_at( it ));
                 ++nCount;
             }
             EXPECT_EQ( nCount, kkSize );
-            ASSERT_TRUE( m.empty() );
+            ASSERT_TRUE( m.empty());
             ASSERT_CONTAINER_SIZE( m, 0 );
         }
     };