X-Git-Url: http://plrg.eecs.uci.edu/git/?p=libcds.git;a=blobdiff_plain;f=tests%2Ftest-hdr%2Fset%2Fhdr_intrusive_michael_set_rcu_gpb_lazy.cpp;fp=tests%2Ftest-hdr%2Fset%2Fhdr_intrusive_michael_set_rcu_gpb_lazy.cpp;h=0000000000000000000000000000000000000000;hp=a325beb65812b52d962ef8fb89262f6d5f7f7282;hb=cc36eb6fd0970a8ea7c8bfa3ebdf6b6dbd7739ac;hpb=d5a609092b48d81c8a751f4df55b48aa3cfa80bb

diff --git a/tests/test-hdr/set/hdr_intrusive_michael_set_rcu_gpb_lazy.cpp b/tests/test-hdr/set/hdr_intrusive_michael_set_rcu_gpb_lazy.cpp
deleted file mode 100644
index a325beb6..00000000
--- a/tests/test-hdr/set/hdr_intrusive_michael_set_rcu_gpb_lazy.cpp
+++ /dev/null
@@ -1,182 +0,0 @@
-/*
-    This file is a part of libcds - Concurrent Data Structures library
-
-    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
-
-    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:
-
-    * Redistributions of source code must retain the above copyright notice, this
-      list of conditions and the following disclaimer.
-
-    * Redistributions in binary form must reproduce the above copyright notice,
-      this list of conditions and the following disclaimer in the documentation
-      and/or other materials provided with the distribution.
-
-    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-    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.     
-*/
-
-#include "set/hdr_intrusive_set.h"
-#include <cds/urcu/general_buffered.h>
-#include <cds/intrusive/lazy_list_rcu.h>
-#include <cds/intrusive/michael_set_rcu.h>
-
-namespace set {
-    namespace {
-        typedef cds::urcu::gc< cds::urcu::general_buffered<> >   RCU;
-    }
-
-    void IntrusiveHashSetHdrTest::RCU_GPB_base_cmp_lazy()
-    {
-        typedef base_int_item< ci::lazy_list::node<RCU> > item;
-        typedef ci::LazyList< RCU
-            ,item
-            ,ci::lazy_list::make_traits<
-                ci::opt::hook< ci::lazy_list::base_hook< co::gc<RCU> > >
-                ,co::compare< cmp<item> >
-                ,ci::opt::disposer< faked_disposer >
-                ,ci::opt::back_off< cds::backoff::pause >
-            >::type
-        >    bucket_type;
-
-        typedef ci::MichaelHashSet< RCU, bucket_type,
-            ci::michael_set::make_traits<
-                co::hash< hash_int >
-            >::type
-        > set;
-
-        test_rcu_int<set>();
-    }
-
-    void IntrusiveHashSetHdrTest::RCU_GPB_base_less_lazy()
-    {
-        typedef base_int_item< ci::lazy_list::node<RCU> > item;
-        typedef ci::LazyList< RCU
-            ,item
-            ,ci::lazy_list::make_traits<
-                ci::opt::hook< ci::lazy_list::base_hook< co::gc<RCU> > >
-                ,co::less< less<item> >
-                ,ci::opt::disposer< faked_disposer >
-            >::type
-        >    bucket_type;
-
-        typedef ci::MichaelHashSet< RCU, bucket_type,
-            ci::michael_set::make_traits<
-                co::hash< hash_int >
-            >::type
-        > set;
-
-        test_rcu_int<set>();
-    }
-
-    void IntrusiveHashSetHdrTest::RCU_GPB_base_cmpmix_lazy()
-    {
-        typedef base_int_item< ci::lazy_list::node<RCU> > item;
-        typedef ci::LazyList< RCU
-            ,item
-            ,ci::lazy_list::make_traits<
-                ci::opt::hook< ci::lazy_list::base_hook< co::gc<RCU> > >
-                ,co::less< less<item> >
-                ,co::compare< cmp<item> >
-                ,ci::opt::disposer< faked_disposer >
-            >::type
-        >    bucket_type;
-
-        typedef ci::MichaelHashSet< RCU, bucket_type,
-            ci::michael_set::make_traits<
-                co::hash< hash_int >
-                ,co::item_counter< simple_item_counter >
-            >::type
-        > set;
-
-        test_rcu_int<set>();
-    }
-
-    void IntrusiveHashSetHdrTest::RCU_GPB_member_cmp_lazy()
-    {
-        typedef member_int_item< ci::lazy_list::node<RCU> > item;
-        typedef ci::LazyList< RCU
-            ,item
-            ,ci::lazy_list::make_traits<
-                ci::opt::hook< ci::lazy_list::member_hook<
-                    offsetof( item, hMember ),
-                    co::gc<RCU>
-                > >
-                ,co::compare< cmp<item> >
-                ,ci::opt::disposer< faked_disposer >
-            >::type
-        >    bucket_type;
-
-        typedef ci::MichaelHashSet< RCU, bucket_type,
-            ci::michael_set::make_traits<
-                co::hash< hash_int >
-            >::type
-        > set;
-
-        test_rcu_int<set>();
-    }
-
-    void IntrusiveHashSetHdrTest::RCU_GPB_member_less_lazy()
-    {
-        typedef member_int_item< ci::lazy_list::node<RCU> > item;
-        typedef ci::LazyList< RCU
-            ,item
-            ,ci::lazy_list::make_traits<
-                ci::opt::hook< ci::lazy_list::member_hook<
-                    offsetof( item, hMember ),
-                    co::gc<RCU>
-                > >
-                ,co::less< less<item> >
-                ,ci::opt::disposer< faked_disposer >
-            >::type
-        >    bucket_type;
-
-        typedef ci::MichaelHashSet< RCU, bucket_type,
-            ci::michael_set::make_traits<
-                co::hash< hash_int >
-            >::type
-        > set;
-
-        test_rcu_int<set>();
-    }
-
-    void IntrusiveHashSetHdrTest::RCU_GPB_member_cmpmix_lazy()
-    {
-        typedef member_int_item< ci::lazy_list::node<RCU> > item;
-        typedef ci::LazyList< RCU
-            ,item
-            ,ci::lazy_list::make_traits<
-                ci::opt::hook< ci::lazy_list::member_hook<
-                    offsetof( item, hMember ),
-                    co::gc<RCU>
-                > >
-                ,co::compare< cmp<item> >
-                ,co::less< less<item> >
-                ,ci::opt::disposer< faked_disposer >
-            >::type
-        >    bucket_type;
-
-        typedef ci::MichaelHashSet< RCU, bucket_type,
-            ci::michael_set::make_traits<
-                co::hash< hash_int >
-                ,co::item_counter< simple_item_counter >
-            >::type
-        > set;
-
-        test_rcu_int<set>();
-    }
-
-
-} // namespace set