2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 this list of conditions and the following disclaimer in the documentation
17 and/or other materials provided with the distribution.
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #ifndef CDSLIB_CONTAINER_DETAILS_MAKE_SKIP_LIST_SET_H
32 #define CDSLIB_CONTAINER_DETAILS_MAKE_SKIP_LIST_SET_H
34 #include <cds/container/details/skip_list_base.h>
35 #include <cds/details/binary_functor_wrapper.h>
38 namespace cds { namespace container { namespace details {
40 template <typename GC, typename T, typename Traits>
41 struct make_skip_list_set
45 typedef Traits traits;
47 typedef cds::intrusive::skip_list::node< gc > intrusive_node_type;
48 struct node_type: public intrusive_node_type
50 typedef intrusive_node_type base_class;
51 typedef typename base_class::atomic_marked_ptr atomic_marked_ptr;
52 typedef value_type stored_value_type;
55 //atomic_marked_ptr m_arrTower[] ; // allocated together with node_type in single memory block
58 node_type( unsigned int nHeight, atomic_marked_ptr * pTower, Q&& v )
59 : m_Value( std::forward<Q>( v ))
61 init_tower( nHeight, pTower );
64 template <typename Q, typename... Args>
65 node_type( unsigned int nHeight, atomic_marked_ptr * pTower, Q&& q, Args&&... args )
66 : m_Value( std::forward<Q>(q), std::forward<Args>(args)... )
68 init_tower( nHeight, pTower );
74 void init_tower( unsigned nHeight, atomic_marked_ptr* pTower )
77 new ( pTower ) atomic_marked_ptr[nHeight - 1];
78 base_class::make_tower( nHeight, pTower );
83 typedef skip_list::details::node_allocator< node_type, traits> node_allocator;
85 struct node_deallocator {
86 void operator ()( node_type * pNode )
88 node_allocator().Delete( pNode );
92 typedef skip_list::details::dummy_node_builder<intrusive_node_type> dummy_node_builder;
96 value_type const& operator()( node_type const& node ) const
101 typedef typename opt::details::make_comparator< value_type, traits >::type key_comparator;
103 template <typename Less>
104 struct less_wrapper {
105 typedef cds::details::compare_wrapper< node_type, cds::opt::details::make_comparator_from_less<Less>, value_accessor > type;
108 class intrusive_traits: public cds::intrusive::skip_list::make_traits<
109 cds::opt::type_traits< traits >
110 ,cds::intrusive::opt::hook< intrusive::skip_list::base_hook< cds::opt::gc< gc > > >
111 ,cds::intrusive::opt::disposer< node_deallocator >
112 ,cds::intrusive::skip_list::internal_node_builder< dummy_node_builder >
113 ,cds::opt::compare< cds::details::compare_wrapper< node_type, key_comparator, value_accessor > >
117 typedef cds::intrusive::SkipListSet< gc, node_type, intrusive_traits> type;
119 }}} // namespace cds::container::details
122 #endif //#ifndef CDSLIB_CONTAINER_DETAILS_MAKE_SKIP_LIST_SET_H