X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=test%2Funit%2Fintrusive-set%2Fintrusive_michael_iterable_hp.cpp;h=2554cefff81cbd15f77e39378ba13fe261119db2;hb=744211978eaf0cbcd9139d07b8dfd6f72651b39f;hp=98af775e9d6597ebb5535c2c3adcb4560c6c6c17;hpb=a8ecd3a68632d52c668ef28d37f9289e9b02e46b;p=libcds.git

diff --git a/test/unit/intrusive-set/intrusive_michael_iterable_hp.cpp b/test/unit/intrusive-set/intrusive_michael_iterable_hp.cpp
index 98af775e..2554ceff 100644
--- a/test/unit/intrusive-set/intrusive_michael_iterable_hp.cpp
+++ b/test/unit/intrusive-set/intrusive_michael_iterable_hp.cpp
@@ -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:
 
@@ -144,6 +144,7 @@ namespace {
 
         set_type s( kSize, 2 );
         test( s );
+        EXPECT_GE( s.statistics().m_nInsertSuccess, 0u );
     }
 
     TEST_F( IntrusiveMichaelIterableSet_HP, wrapped_stat )
@@ -166,6 +167,7 @@ namespace {
 
         set_type s( kSize, 2 );
         test( s );
+        EXPECT_GE( s.statistics().m_nInsertSuccess, 0u );
     }
 
 } // namespace