X-Git-Url: http://plrg.eecs.uci.edu/git/?p=libcds.git;a=blobdiff_plain;f=test%2Funit%2Fset%2Fmichael_lazy_hp.cpp;h=f2c8e654f390e5e0247e4264c433c9539efae340;hp=8e3cee2aad04038a16e59336889ae1670801a7e5;hb=2bb66f1d159d044d2c5dad0f0f968abcb6d53287;hpb=f3d187182434846ab9608307037258421101feb9 diff --git a/test/unit/set/michael_lazy_hp.cpp b/test/unit/set/michael_lazy_hp.cpp index 8e3cee2a..f2c8e654 100644 --- 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: @@ -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 @@ -214,6 +214,7 @@ namespace { set_type s( kSize, 4 ); test( s ); + EXPECT_GE( s.statistics().m_nInsertSuccess, 0u ); } TEST_F( MichaelLazySet_HP, wrapped_stat ) @@ -235,6 +236,7 @@ namespace { set_type s( kSize, 4 ); test( s ); + EXPECT_GE( s.statistics().m_nInsertSuccess, 0u ); } } // namespace