Merged branch 'master' of https://github.com/Nemo1369/libcds

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

diff --git a/test/unit/map/test_skiplist_rcu.h b/test/unit/map/test_skiplist_rcu.h
index 6ef2234fbe6c20217d0b3ec4f0bfc7346ec6f866..61a44cd9342d33cf479e031ec0e4b86ec3ddf9c1 100644 (file)
--- a/test/unit/map/test_skiplist_rcu.h
+++ b/test/unit/map/test_skiplist_rcu.h
@@ -1,7 +1,7 @@
 /*
     This file is a part of libcds - Concurrent Data Structures library
 
-    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
 
     Source code repo: http://github.com/khizmax/libcds/
     Download: http://sourceforge.net/projects/libcds/files/
@@ -51,7 +51,7 @@ protected:
 
         base_class::test( m );
 
-        ASSERT_TRUE( m.empty() );
+        ASSERT_TRUE( m.empty());
         ASSERT_CONTAINER_SIZE( m, 0 );
 
         typedef typename Map::exempt_ptr exempt_ptr;
@@ -65,7 +65,7 @@ protected:
 
         size_t nCount = 0;
         int nKey = 0;
-        while ( !m.empty() ) {
+        while ( !m.empty()) {
             xp = m.extract_min();
             ASSERT_FALSE( !xp );
             EXPECT_EQ( xp->first.nKey, nKey + 1 );
@@ -77,7 +77,7 @@ protected:
         xp = m.extract_max();
         ASSERT_TRUE( !xp );
         EXPECT_EQ( kkSize, nCount );
-        ASSERT_TRUE( m.empty() );
+        ASSERT_TRUE( m.empty());
         ASSERT_CONTAINER_SIZE( m, 0 );
 
         // get_max
@@ -86,7 +86,7 @@ protected:
 
         nKey = kkSize;
         nCount = 0;
-        while ( !m.empty() ) {
+        while ( !m.empty()) {
             xp = m.extract_max();
             ASSERT_FALSE( !xp );
             EXPECT_EQ( xp->first.nKey, nKey - 1 );
@@ -98,7 +98,7 @@ protected:
         xp = m.extract_max();
         ASSERT_TRUE( !xp );
         EXPECT_EQ( kkSize, nCount );
-        ASSERT_TRUE( m.empty() );
+        ASSERT_TRUE( m.empty());
         ASSERT_CONTAINER_SIZE( m, 0 );
     }