Migrated priority queue stress test to gtest framework

[libcds.git] / tests / unit / pqueue / ellen_bintree_pqueue.h

diff --git a/tests/unit/pqueue/ellen_bintree_pqueue.h b/tests/unit/pqueue/ellen_bintree_pqueue.h
deleted file mode 100644 (file)
index f86fa1b..0000000
--- a/tests/unit/pqueue/ellen_bintree_pqueue.h
+++ /dev/null
@@ -1,141 +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.     
-*/
-
-#ifndef CDSUNIT_STD_ELLEN_BINTREE_PQUEUE_H
-#define CDSUNIT_STD_ELLEN_BINTREE_PQUEUE_H
-
-#include <cds/container/ellen_bintree_set_hp.h>
-#include <cds/container/ellen_bintree_set_dhp.h>
-#include <cds/urcu/general_instant.h>
-#include <cds/urcu/general_buffered.h>
-#include <cds/urcu/general_threaded.h>
-#include <cds/urcu/signal_buffered.h>
-#include <cds/urcu/signal_threaded.h>
-#include <cds/container/ellen_bintree_set_rcu.h>
-
-namespace pqueue {
-
-    template <typename GC>
-    struct EllenBinTreePQueue_pop_max
-    {
-        template <typename T, typename Tree>
-        bool operator()( T& dest, Tree& container ) const
-        {
-            typename Tree::guarded_ptr gp( container.extract_max());
-            if ( gp )
-                dest = *gp;
-            return !gp.empty();
-        }
-    };
-
-    template <typename RCU>
-    struct EllenBinTreePQueue_pop_max< cds::urcu::gc<RCU> >
-    {
-        template <typename T, typename Tree>
-        bool operator()( T& dest, Tree& container ) const
-        {
-            typename Tree::exempt_ptr ep( container.extract_max());
-            if ( ep )
-                dest = *ep;
-            return !ep.empty();
-        }
-    };
-
-    template <typename GC>
-    struct EllenBinTreePQueue_pop_min
-    {
-        template <typename T, typename Tree>
-        bool operator()( T& dest, Tree& container ) const
-        {
-            typename Tree::guarded_ptr gp( container.extract_min());
-            if ( gp )
-                dest = *gp;
-            return !gp.empty();
-        }
-    };
-
-    template <typename RCU>
-    struct EllenBinTreePQueue_pop_min< cds::urcu::gc<RCU> >
-    {
-        template <typename T, typename Tree>
-        bool operator()( T& dest, Tree& container ) const
-        {
-            typename Tree::exempt_ptr ep( container.extract_min());
-            if ( ep )
-                dest = *ep;
-            return !ep.empty();
-        }
-    };
-
-    template <typename GC, typename Key, typename T, typename Traits, bool Max=true>
-    class EllenBinTreePQueue: protected cds::container::EllenBinTreeSet< GC, Key, T, Traits >
-    {
-        typedef cds::container::EllenBinTreeSet< GC, Key, T, Traits > base_class;
-        typedef T value_type;
-        template <typename GC2> friend struct EllenBinTreePQueue_pop_max;
-        template <typename GC2> friend struct EllenBinTreePQueue_pop_min;
-
-    public:
-        bool push( value_type const& val )
-        {
-            return base_class::insert( val );
-        }
-
-        bool pop( value_type& dest )
-        {
-            return Max ? EllenBinTreePQueue_pop_max< typename base_class::gc >()( dest, *this )
-                       : EllenBinTreePQueue_pop_min< typename base_class::gc >()( dest, *this );
-        }
-
-        void clear()
-        {
-            base_class::clear();
-        }
-
-        bool empty() const
-        {
-            return base_class::empty();
-        }
-
-        size_t size() const
-        {
-            return base_class::size();
-        }
-
-        typename base_class::stat const& statistics() const
-        {
-            return base_class::statistics();
-        }
-    };
-
-} // namespace pqueue
-
-
-#endif // #ifndef CDSUNIT_STD_ELLEN_BINTREE_PQUEUE_H