Updated copyright

[libcds.git] / test / unit / intrusive-list / test_intrusive_iterable_list_hp.h

diff --git a/test/unit/intrusive-list/test_intrusive_iterable_list_hp.h b/test/unit/intrusive-list/test_intrusive_iterable_list_hp.h
index 4fbb63db0572a1fc6797f4057cbf20119c16601f..8adb63570bf6bc7a2ac357efcd62e71f6a811f7c 100644 (file)
--- a/test/unit/intrusive-list/test_intrusive_iterable_list_hp.h
+++ b/test/unit/intrusive-list/test_intrusive_iterable_list_hp.h
@@ -1,11 +1,11 @@
 /*
     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/
-    
+
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions are met:
 
@@ -55,7 +55,7 @@ namespace cds_test {
 
             typedef typename List::guarded_ptr guarded_ptr;
 
-            ASSERT_TRUE( l.empty() );
+            ASSERT_TRUE( l.empty());
             ASSERT_CONTAINER_SIZE( l, 0 );
 
             guarded_ptr gp;
@@ -64,16 +64,16 @@ namespace cds_test {
             for ( auto& i : arr ) {
                 gp = l.get( i.nKey );
                 EXPECT_TRUE( !gp );
-                gp = l.get_with( other_item( i.nKey ), other_less() );
+                gp = l.get_with( other_item( i.nKey ), other_less());
                 EXPECT_TRUE( !gp );
 
-                EXPECT_TRUE( l.insert( i ) );
+                EXPECT_TRUE( l.insert( i ));
 
                 gp = l.get( i.nKey );
                 ASSERT_FALSE( !gp );
                 EXPECT_EQ( gp->nKey, i.nKey );
                 EXPECT_EQ( gp->nVal, i.nVal );
-                gp = l.get_with( other_item( i.nKey ), other_less() );
+                gp = l.get_with( other_item( i.nKey ), other_less());
                 ASSERT_FALSE( !gp );
                 EXPECT_EQ( gp->nKey, i.nKey );
                 EXPECT_EQ( gp->nVal, i.nVal );
@@ -84,27 +84,27 @@ namespace cds_test {
                 if ( i & 1 )
                     gp = l.extract( i );
                 else
-                    gp = l.extract_with( other_item( i ), other_less() );
+                    gp = l.extract_with( other_item( i ), other_less());
                 ASSERT_FALSE( !gp );
                 EXPECT_EQ( gp->nKey, i );
 
                 gp = l.extract( i );
                 EXPECT_TRUE( !gp );
-                gp = l.extract_with( other_item( i ), other_less() );
+                gp = l.extract_with( other_item( i ), other_less());
                 EXPECT_TRUE( !gp );
             }
 
-            ASSERT_TRUE( l.empty() );
+            ASSERT_TRUE( l.empty());
             ASSERT_CONTAINER_SIZE( l, 0 );
 
             List::gc::force_dispose();
             for ( auto const& i : arr ) {
                 EXPECT_EQ( i.s.nDisposeCount, 1 );
-                EXPECT_FALSE( l.contains( i ) );
+                EXPECT_FALSE( l.contains( i ));
             }
         }
     };
 
 } // namespace cds_test
 
-#endif // CDSUNIT_LIST_TEST_INTRUSIVE_ITERABLE_LIST_HP_H 
+#endif // CDSUNIT_LIST_TEST_INTRUSIVE_ITERABLE_LIST_HP_H