Removed MSVC 14 (VC 2015) projects

[libcds.git] / test / unit / set / michael_lazy_hp.cpp

diff --git a/test/unit/set/michael_lazy_hp.cpp b/test/unit/set/michael_lazy_hp.cpp
index af163397eb5bfdc40f771577f055b4040b82a9bd..149dc701549b719f30e3eda679660f6ee511fff4 100644 (file)
--- a/test/unit/set/michael_lazy_hp.cpp
+++ b/test/unit/set/michael_lazy_hp.cpp
@@ -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:
 
@@ -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.
 */
 
 #include "test_set_hp.h"
@@ -67,7 +67,7 @@ namespace {
             >::type
         > list_type;
 
-        typedef cc::MichaelHashSet< gc_type, list_type, 
+        typedef cc::MichaelHashSet< gc_type, list_type,
             typename cc::michael_set::make_traits<
                 cds::opt::hash< hash_int >
             >::type
@@ -85,7 +85,7 @@ namespace {
             >::type
         > list_type;
 
-        typedef cc::MichaelHashSet< gc_type, list_type, 
+        typedef cc::MichaelHashSet< gc_type, list_type,
             typename cc::michael_set::make_traits<
                 cds::opt::hash< hash_int >
             >::type
@@ -104,7 +104,7 @@ namespace {
         };
         typedef cc::LazyList< gc_type, int_item, list_traits > list_type;
 
-        typedef cc::MichaelHashSet< gc_type, list_type, 
+        typedef cc::MichaelHashSet< gc_type, list_type,
             typename cc::michael_set::make_traits<
                 cds::opt::hash< hash_int >
             >::type
@@ -138,7 +138,7 @@ namespace {
         struct list_traits : public cc::lazy_list::traits
         {
             typedef cmp compare;
-            typedef cds::backoff::exponential<cds::backoff::pause, cds::backoff::yield> back_off;
+            typedef cds::backoff::make_exponential_t<cds::backoff::pause, cds::backoff::yield> back_off;
         };
         typedef cc::LazyList< gc_type, int_item, list_traits > list_type;
 
@@ -195,4 +195,48 @@ namespace {
         test( s );
     }
 
+    TEST_F( MichaelLazySet_HP, stat )
+    {
+        struct list_traits: public cc::lazy_list::traits
+        {
+            typedef base_class::less less;
+            typedef cds::backoff::pause back_off;
+            typedef cc::lazy_list::stat<> stat;
+        };
+        typedef cc::LazyList< gc_type, int_item, list_traits > list_type;
+
+        struct set_traits: public cc::michael_set::traits
+        {
+            typedef hash_int hash;
+            typedef cds::atomicity::item_counter item_counter;
+        };
+        typedef cc::MichaelHashSet< gc_type, list_type, set_traits >set_type;
+
+        set_type s( kSize, 4 );
+        test( s );
+        EXPECT_GE( s.statistics().m_nInsertSuccess, 0u );
+    }
+
+    TEST_F( MichaelLazySet_HP, wrapped_stat )
+    {
+        struct list_traits: public cc::lazy_list::traits
+        {
+            typedef base_class::less less;
+            typedef cds::backoff::pause back_off;
+            typedef cc::lazy_list::wrapped_stat<> stat;
+        };
+        typedef cc::LazyList< gc_type, int_item, list_traits > list_type;
+
+        struct set_traits: public cc::michael_set::traits
+        {
+            typedef hash_int hash;
+            typedef cds::atomicity::item_counter item_counter;
+        };
+        typedef cc::MichaelHashSet< gc_type, list_type, set_traits >set_type;
+
+        set_type s( kSize, 4 );
+        test( s );
+        EXPECT_GE( s.statistics().m_nInsertSuccess, 0u );
+    }
+
 } // namespace