3 #ifndef __CDS_CONTAINER_DETAILS_MAKE_LAZY_LIST_H
4 #define __CDS_CONTAINER_DETAILS_MAKE_LAZY_LIST_H
6 #include <cds/details/binary_functor_wrapper.h>
8 namespace cds { namespace container {
13 template <class GC, typename T, class Traits>
18 typedef Traits original_type_traits;
20 struct node_type : public intrusive::lazy_list::node<gc, typename original_type_traits::lock_type>
28 node_type( Q const& v )
31 # ifdef CDS_EMPLACE_SUPPORT
32 template <typename... Args>
33 node_type( Args&&... args )
34 : m_Value( std::forward<Args>(args)...)
39 typedef typename original_type_traits::allocator::template rebind<node_type>::other allocator_type;
40 typedef cds::details::Allocator< node_type, allocator_type > cxx_allocator;
42 struct node_deallocator
44 void operator ()( node_type * pNode )
46 cxx_allocator().Delete( pNode );
50 typedef typename opt::details::make_comparator< value_type, original_type_traits >::type key_comparator;
52 struct value_accessor {
53 value_type const & operator()( node_type const & node ) const
59 template <typename Less>
61 typedef cds::details::compare_wrapper< node_type, cds::opt::details::make_comparator_from_less<Less>, value_accessor > type;
64 struct type_traits: public original_type_traits
66 typedef intrusive::lazy_list::base_hook< opt::gc<gc> > hook;
67 typedef node_deallocator disposer;
69 typedef cds::details::compare_wrapper< node_type, key_comparator, value_accessor > compare;
72 typedef intrusive::LazyList<gc, node_type, type_traits> type;
74 } // namespace details
77 }} // namespace cds::container
79 #endif // #ifndef __CDS_CONTAINER_DETAILS_MAKE_MICHAEL_LIST_H