X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Fcds%2Fcontainer%2Fdetails%2Fmake_skip_list_set.h;fp=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Fcds%2Fcontainer%2Fdetails%2Fmake_skip_list_set.h;h=c88dd81ed138bc7beda41e320b709774abf7d0d5;hb=4223430d9168223029c7639149025c79e69b4f37;hp=0000000000000000000000000000000000000000;hpb=7ea7751a31c0388bf888052517be181a2989b113;p=c11concurrency-benchmarks.git

diff --git a/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/cds/container/details/make_skip_list_set.h b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/cds/container/details/make_skip_list_set.h
new file mode 100644
index 0000000..c88dd81
--- /dev/null
+++ b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/cds/container/details/make_skip_list_set.h
@@ -0,0 +1,122 @@
+/*
+    This file is a part of libcds - Concurrent Data Structures library
+
+    (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:
+
+    * 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 CDSLIB_CONTAINER_DETAILS_MAKE_SKIP_LIST_SET_H
+#define CDSLIB_CONTAINER_DETAILS_MAKE_SKIP_LIST_SET_H
+
+#include <cds/container/details/skip_list_base.h>
+#include <cds/details/binary_functor_wrapper.h>
+
+//@cond
+namespace cds { namespace container { namespace details {
+
+    template <typename GC, typename T, typename Traits>
+    struct make_skip_list_set
+    {
+        typedef GC      gc;
+        typedef T       value_type;
+        typedef Traits  traits;
+
+        typedef cds::intrusive::skip_list::node< gc >   intrusive_node_type;
+        struct node_type: public intrusive_node_type
+        {
+            typedef intrusive_node_type                     base_class;
+            typedef typename base_class::atomic_marked_ptr  atomic_marked_ptr;
+            typedef value_type                              stored_value_type;
+
+            value_type m_Value;
+            //atomic_marked_ptr m_arrTower[] ;  // allocated together with node_type in single memory block
+
+            template <typename Q>
+            node_type( unsigned int nHeight, atomic_marked_ptr * pTower, Q&& v )
+                : m_Value( std::forward<Q>( v ))
+            {
+                init_tower( nHeight, pTower );
+            }
+
+            template <typename Q, typename... Args>
+            node_type( unsigned int nHeight, atomic_marked_ptr * pTower, Q&& q, Args&&... args )
+                : m_Value( std::forward<Q>(q), std::forward<Args>(args)... )
+            {
+                init_tower( nHeight, pTower );
+            }
+
+            node_type() = delete;
+
+        private:
+            void init_tower( unsigned nHeight, atomic_marked_ptr* pTower )
+            {
+                if ( nHeight > 1 ) {
+                    new ( pTower ) atomic_marked_ptr[nHeight - 1];
+                    base_class::make_tower( nHeight, pTower );
+                }
+            }
+        };
+
+        typedef skip_list::details::node_allocator< node_type, traits> node_allocator;
+
+        struct node_deallocator {
+            void operator ()( node_type * pNode )
+            {
+                node_allocator().Delete( pNode );
+            }
+        };
+
+        typedef skip_list::details::dummy_node_builder<intrusive_node_type> dummy_node_builder;
+
+        struct value_accessor
+        {
+            value_type const& operator()( node_type const& node ) const
+            {
+                return node.m_Value;
+            }
+        };
+        typedef typename opt::details::make_comparator< value_type, traits >::type key_comparator;
+
+        template <typename Less>
+        struct less_wrapper {
+            typedef cds::details::compare_wrapper< node_type, cds::opt::details::make_comparator_from_less<Less>, value_accessor >    type;
+        };
+
+        class intrusive_traits: public cds::intrusive::skip_list::make_traits<
+            cds::opt::type_traits< traits >
+            ,cds::intrusive::opt::hook< intrusive::skip_list::base_hook< cds::opt::gc< gc > > >
+            ,cds::intrusive::opt::disposer< node_deallocator >
+            ,cds::intrusive::skip_list::internal_node_builder< dummy_node_builder >
+            ,cds::opt::compare< cds::details::compare_wrapper< node_type, key_comparator, value_accessor > >
+        >::type
+        {};
+
+        typedef cds::intrusive::SkipListSet< gc, node_type, intrusive_traits>   type;
+    };
+}}} // namespace cds::container::details
+//@endcond
+
+#endif //#ifndef CDSLIB_CONTAINER_DETAILS_MAKE_SKIP_LIST_SET_H