3 #ifndef __CDS_CONTAINER_MICHAEL_LIST_RCU_H
4 #define __CDS_CONTAINER_MICHAEL_LIST_RCU_H
7 #include <cds/container/michael_list_base.h>
8 #include <cds/intrusive/michael_list_rcu.h>
9 #include <cds/container/details/make_michael_list.h>
10 #include <cds/details/binary_functor_wrapper.h>
12 namespace cds { namespace container {
14 /// Michael's ordered list (template specialization for \ref cds_urcu_desc "RCU")
15 /** @ingroup cds_nonintrusive_list
16 \anchor cds_nonintrusive_MichaelList_rcu
18 Usually, ordered single-linked list is used as a building block for the hash table implementation.
19 The complexity of searching is <tt>O(N)</tt>.
22 - [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"
24 This class is non-intrusive version of \ref cds_intrusive_MichaelList_rcu "cds::intrusive::MichaelList" RCU specialization.
27 - \p RCU - one of \ref cds_urcu_gc "RCU type"
28 - \p T - type stored in the list. The type must be default- and copy-constructible.
29 - \p Traits - type traits, default is michael_list::type_traits
31 The implementation does not divide type \p T into key and value part and
32 may be used as a main building block for hash set containers.
33 The key is a function (or a part) of type \p T, and this function is specified by <tt>Traits::compare</tt> functor
34 or <tt>Traits::less</tt> predicate.
36 \ref cds_nonintrusive_MichaelKVList_rcu "MichaelKVList" is a key-value version of Michael's
37 non-intrusive list that is closer to the C++ std library approach.
39 @note Before including <tt><cds/container/michael_list_rcu.h></tt> you should include appropriate RCU header file,
40 see \ref cds_urcu_gc "RCU type" for list of existing RCU class and corresponding header files.
42 It is possible to declare option-based list with cds::container::michael_list::make_traits metafunction istead of \p Traits template
43 argument. For example, the following traits-based declaration of Michael's list
46 #include <cds/urcu/general_buffered.h>
47 #include <cds/container/michael_list_rcu.h>
48 // Declare comparator for the item
50 int operator ()( int i1, int i2 )
56 // Declare type_traits
57 struct my_traits: public cds::container::michael_list::type_traits
59 typedef my_compare compare;
62 // Declare traits-based list
63 typedef cds::container::MichaelList< cds::urcu::gc< cds::urcu::general_buffered<> >, int, my_traits > traits_based_list;
66 is equivalent for the following option-based list
68 #include <cds/urcu/general_buffered.h>
69 #include <cds/container/michael_list_rcu.h>
71 // my_compare is the same
73 // Declare option-based list
74 typedef cds::container::MichaelList< cds::urcu::gc< cds::urcu::general_buffered<> >, int,
75 typename cds::container::michael_list::make_traits<
76 cds::container::opt::compare< my_compare > // item comparator option
81 Template argument list \p Options of cds::container::michael_list::make_traits metafunction are:
82 - opt::compare - key comparison functor. No default functor is provided.
83 If the option is not specified, the opt::less is used.
84 - opt::less - specifies binary predicate used for key comparison. Default is \p std::less<T>.
85 - opt::back_off - back-off strategy used. If the option is not specified, the cds::backoff::empty is used.
86 - opt::item_counter - the type of item counting feature. Default is \ref atomicity::empty_item_counter that is no item counting.
87 - opt::allocator - the allocator used for creating and freeing list's item. Default is \ref CDS_DEFAULT_ALLOCATOR macro.
88 - opt::memory_model - C++ memory ordering model. Can be opt::v::relaxed_ordering (relaxed memory model, the default)
89 or opt::v::sequential_consistent (sequentially consisnent memory model).
90 - opt::rcu_check_deadlock - a deadlock checking policy. Default is opt::v::rcu_throw_deadlock
95 #ifdef CDS_DOXYGEN_INVOKED
96 typename Traits = michael_list::type_traits
101 class MichaelList< cds::urcu::gc<RCU>, T, Traits > :
102 #ifdef CDS_DOXYGEN_INVOKED
103 protected intrusive::MichaelList< cds::urcu::gc<RCU>, T, Traits >
105 protected details::make_michael_list< cds::urcu::gc<RCU>, T, Traits >::type
109 typedef details::make_michael_list< cds::urcu::gc<RCU>, T, Traits > options;
110 typedef typename options::type base_class;
114 typedef T value_type ; ///< Type of value stored in the list
115 typedef typename base_class::gc gc ; ///< RCU schema used
116 typedef typename base_class::back_off back_off ; ///< Back-off strategy used
117 typedef typename options::allocator_type allocator_type ; ///< Allocator type used for allocate/deallocate the nodes
118 typedef typename base_class::item_counter item_counter ; ///< Item counting policy used
119 typedef typename options::key_comparator key_comparator ; ///< key comparison functor
120 typedef typename base_class::memory_model memory_model ; ///< Memory ordering. See cds::opt::memory_model option
121 typedef typename base_class::rcu_check_deadlock rcu_check_deadlock ; ///< RCU deadlock checking policy
123 typedef typename gc::scoped_lock rcu_lock ; ///< RCU scoped lock
124 static CDS_CONSTEXPR_CONST bool c_bExtractLockExternal = base_class::c_bExtractLockExternal; ///< Group of \p extract_xxx functions require external locking
128 typedef typename base_class::value_type node_type;
129 typedef typename options::cxx_allocator cxx_allocator;
130 typedef typename options::node_deallocator node_deallocator;
131 typedef typename options::type_traits::compare intrusive_key_comparator;
133 typedef typename base_class::atomic_node_ptr head_type;
134 # ifndef CDS_CXX11_LAMBDA_SUPPORT
135 typedef typename base_class::empty_erase_functor empty_erase_functor;
140 typedef cds::urcu::exempt_ptr< gc, node_type, value_type, typename options::type_traits::disposer > exempt_ptr; ///< pointer to extracted node
144 static value_type& node_to_value( node_type& n )
148 static value_type const& node_to_value( node_type const& n )
153 # ifndef CDS_CXX11_LAMBDA_SUPPORT
154 template <typename Func>
155 struct insert_functor
159 insert_functor ( Func f )
163 void operator()( node_type& node )
165 cds::unref(m_func)( node_to_value(node) );
169 template <typename Q, typename Func>
170 struct ensure_functor
175 ensure_functor( Q const& arg, Func f )
180 void operator ()( bool bNew, node_type& node, node_type& )
182 cds::unref(m_func)( bNew, node_to_value(node), m_arg );
186 template <typename Func>
191 find_functor( Func f )
195 template <typename Q>
196 void operator ()( node_type& node, Q& val )
198 cds::unref(m_func)( node_to_value(node), val );
202 struct empty_find_functor
204 template <typename Q>
205 void operator ()( node_type& node, Q& val ) const
209 template <typename Func>
214 erase_functor( Func f )
218 void operator()( node_type const& node )
220 cds::unref(m_func)( node_to_value(node) );
223 #endif // ifndef CDS_CXX11_LAMBDA_SUPPORT
228 template <typename Q>
229 static node_type * alloc_node( Q const& v )
231 return cxx_allocator().New( v );
234 template <typename... Args>
235 static node_type * alloc_node( Args&&... args )
237 return cxx_allocator().MoveNew( std::forward<Args>(args)... );
240 static void free_node( node_type * pNode )
242 cxx_allocator().Delete( pNode );
245 struct node_disposer {
246 void operator()( node_type * pNode )
251 typedef std::unique_ptr< node_type, node_disposer > scoped_node_ptr;
255 return base_class::m_pHead;
258 head_type& head() const
260 return const_cast<head_type&>( base_class::m_pHead );
266 template <bool IsConst>
267 class iterator_type: protected base_class::template iterator_type<IsConst>
269 typedef typename base_class::template iterator_type<IsConst> iterator_base;
271 iterator_type( head_type const& pNode )
272 : iterator_base( pNode )
275 friend class MichaelList;
278 typedef typename cds::details::make_const_type<value_type, IsConst>::pointer value_ptr;
279 typedef typename cds::details::make_const_type<value_type, IsConst>::reference value_ref;
284 iterator_type( iterator_type const& src )
285 : iterator_base( src )
288 value_ptr operator ->() const
290 typename iterator_base::value_ptr p = iterator_base::operator ->();
291 return p ? &(p->m_Value) : nullptr;
294 value_ref operator *() const
296 return (iterator_base::operator *()).m_Value;
300 iterator_type& operator ++()
302 iterator_base::operator ++();
307 bool operator ==(iterator_type<C> const& i ) const
309 return iterator_base::operator ==(i);
312 bool operator !=(iterator_type<C> const& i ) const
314 return iterator_base::operator !=(i);
321 typedef iterator_type<false> iterator;
323 /// Const forward iterator
324 typedef iterator_type<true> const_iterator;
326 /// Returns a forward iterator addressing the first element in a list
328 For empty list \code begin() == end() \endcode
332 return iterator( head() );
335 /// Returns an iterator that addresses the location succeeding the last element in a list
337 Do not use the value returned by <tt>end</tt> function to access any item.
338 Internally, <tt>end</tt> returning value equals to \p nullptr.
340 The returned value can be used only to control reaching the end of the list.
341 For empty list \code begin() == end() \endcode
348 /// Returns a forward const iterator addressing the first element in a list
350 const_iterator begin() const
352 return const_iterator( head() );
354 const_iterator cbegin()
356 return const_iterator( head() );
360 /// Returns an const iterator that addresses the location succeeding the last element in a list
362 const_iterator end() const
364 return const_iterator();
366 const_iterator cend()
368 return const_iterator();
373 /// Default constructor
375 Initialize empty list
391 The function creates a node with copy of \p val value
392 and then inserts the node created into the list.
394 The type \p Q should contain as minimum the complete key of the node.
395 The object of \ref value_type should be constructible from \p val of type \p Q.
396 In trivial case, \p Q is equal to \ref value_type.
398 The function makes RCU lock internally.
400 Returns \p true if inserting successful, \p false otherwise.
402 template <typename Q>
403 bool insert( Q const& val )
405 return insert_at( head(), val );
410 This function inserts new node with default-constructed value and then it calls
411 \p func functor with signature
412 \code void func( value_type& itemValue ) ;\endcode
414 The argument \p itemValue of user-defined functor \p func is the reference
415 to the list's item inserted. User-defined functor \p func should guarantee that during changing
416 item's value no any other changes could be made on this list's item by concurrent threads.
417 The user-defined functor can be passed by reference using <tt>boost::ref</tt>
418 and it is called only if the inserting is success.
420 The type \p Q should contain the complete key of the node.
421 The object of \ref value_type should be constructible from \p key of type \p Q.
423 The function allows to split creating of new item into two part:
424 - create item from \p key with initializing key-fields only;
425 - insert new item into the list;
426 - if inserting is successful, initialize non-key fields of item by calling \p f functor
428 This can be useful if complete initialization of object of \p value_type is heavyweight and
429 it is preferable that the initialization should be completed only if inserting is successful.
431 The function makes RCU lock internally.
433 template <typename Q, typename Func>
434 bool insert( Q const& key, Func func )
436 return insert_at( head(), key, func );
439 /// Ensures that the \p key exists in the list
441 The operation performs inserting or changing data with lock-free manner.
443 If the \p key not found in the list, then the new item created from \p key
444 is inserted into the list. Otherwise, the functor \p func is called with the item found.
445 The functor \p Func should be a function with signature:
447 void func( bool bNew, value_type& item, const Q& val );
452 void operator()( bool bNew, value_type& item, const Q& val );
457 - \p bNew - \p true if the item has been inserted, \p false otherwise
458 - \p item - item of the list
459 - \p val - argument \p key passed into the \p ensure function
461 The functor may change non-key fields of the \p item; however, \p func must guarantee
462 that during changing no any other modifications could be made on this item by concurrent threads.
464 You may pass \p func argument by reference using <tt>boost::ref</tt>.
466 The function makes RCU lock internally.
468 Returns <tt> std::pair<bool, bool> </tt> where \p first is true if operation is successfull,
469 \p second is true if new item has been added or \p false if the item with \p key
470 already is in the list.
472 template <typename Q, typename Func>
473 std::pair<bool, bool> ensure( Q const& key, Func f )
475 return ensure_at( head(), key, f );
478 /// Inserts data of type \ref value_type constructed with <tt>std::forward<Args>(args)...</tt>
480 Returns \p true if inserting successful, \p false otherwise.
482 The function makes RCU lock internally.
484 template <typename... Args>
485 bool emplace( Args&&... args )
487 return emplace_at( head(), std::forward<Args>(args)... );
490 /// Deletes \p key from the list
491 /** \anchor cds_nonintrusive_MichealList_rcu_erase_val
492 Since the key of MichaelList's item type \p T is not explicitly specified,
493 template parameter \p Q defines the key type searching in the list.
494 The list item comparator should be able to compare the type \p T of list item
495 and the value \p key of type \p Q.
497 RCU \p synchronize method can be called. RCU should not be locked.
499 Return \p true if key is found and deleted, \p false otherwise
501 template <typename Q>
502 bool erase( Q const& key )
504 # ifdef CDS_CXX11_LAMBDA_SUPPORT
505 return erase_at( head(), key, intrusive_key_comparator(), [](value_type const&){} );
507 return erase_at( head(), key, intrusive_key_comparator(), empty_erase_functor() );
511 /// Deletes the item from the list using \p pred predicate for searching
513 The function is an analog of \ref cds_nonintrusive_MichealList_rcu_erase_val "erase(Q const&)"
514 but \p pred is used for key comparing.
515 \p Less functor has the interface like \p std::less.
516 \p pred must imply the same element order as the comparator used for building the list.
518 template <typename Q, typename Less>
519 bool erase_with( Q const& key, Less pred )
521 # ifdef CDS_CXX11_LAMBDA_SUPPORT
522 return erase_at( head(), key, typename options::template less_wrapper<Less>::type(), [](value_type const&){} );
524 return erase_at( head(), key, typename options::template less_wrapper<Less>::type(), empty_erase_functor() );
528 /// Deletes \p key from the list
529 /** \anchor cds_nonintrusive_MichaelList_rcu_erase_func
530 The function searches an item with key \p key, calls \p f functor with item found
531 and deletes it. If \p key is not found, the functor is not called.
533 The functor \p Func interface:
536 void operator()(const value_type& val) { ... }
539 The functor may be passed by reference with <tt>boost:ref</tt>
541 Since the key of MichaelList's item type \p T is not explicitly specified,
542 template parameter \p Q defines the key type searching in the list.
543 The list item comparator should be able to compare the type \p T of list item
546 RCU \p synchronize method can be called. RCU should not be locked.
548 Return \p true if key is found and deleted, \p false otherwise
550 template <typename Q, typename Func>
551 bool erase( Q const& key, Func f )
553 return erase_at( head(), key, intrusive_key_comparator(), f );
556 /// Deletes the item from the list using \p pred predicate for searching
558 The function is an analog of \ref cds_nonintrusive_MichaelList_rcu_erase_func "erase(Q const&, Func)"
559 but \p pred is used for key comparing.
560 \p Less functor has the interface like \p std::less.
561 \p pred must imply the same element order as the comparator used for building the list.
563 template <typename Q, typename Less, typename Func>
564 bool erase_with( Q const& key, Less pred, Func f )
566 return erase_at( head(), key, typename options::template less_wrapper<Less>::type(), f );
569 /// Extracts an item from the list
571 @anchor cds_nonintrusive_MichaelList_rcu_extract
572 The function searches an item with key equal to \p val in the list,
573 unlinks it from the list, and returns pointer to an item found in \p dest argument.
574 If the item with the key equal to \p val is not found the function returns \p false.
576 @note The function does NOT call RCU read-side lock or synchronization,
577 and does NOT dispose the item found. It just excludes the item from the list
578 and returns a pointer to item found.
579 You should lock RCU before calling this function.
582 #include <cds/urcu/general_buffered.h>
583 #include <cds/container/michael_list_rcu.h>
585 typedef cds::urcu::gc< general_buffered<> > rcu;
586 typedef cds::container::MichaelList< rcu, Foo > rcu_michael_list;
588 rcu_michael_list theList;
591 rcu_michael_list::exempt_ptr p;
593 // first, we should lock RCU
596 // Now, you can apply extract function
597 // Note that you must not delete the item found inside the RCU lock
598 if ( theList.extract( p, 10 )) {
599 // do something with p
603 // Outside RCU lock section we may safely release extracted pointer.
604 // release() passes the pointer to RCU reclamation cycle.
608 template <typename Q>
609 bool extract( exempt_ptr& dest, Q const& val )
611 dest = extract_at( head(), val, intrusive_key_comparator() );
612 return !dest.empty();
615 /// Extracts an item from the list using \p pred predicate for searching
617 This function is the analog for \ref cds_nonintrusive_MichaelList_rcu_extract "extract(exempt_ptr&, Q const&)".
619 The \p pred is a predicate used for key comparing.
620 \p Less has the interface like \p std::less.
621 \p pred must imply the same element order as \ref key_comparator.
623 template <typename Q, typename Less>
624 bool extract_with( exempt_ptr& dest, Q const& val, Less pred )
626 dest = extract_at( head(), val, typename options::template less_wrapper<Less>::type() );
627 return !dest.empty();
630 /// Finds the key \p key
631 /** \anchor cds_nonintrusive_MichaelList_rcu_find_val
632 The function searches the item with key equal to \p key
633 and returns \p true if it is found, and \p false otherwise.
635 The function makes RCU lock internally.
637 template <typename Q>
638 bool find( Q const& key ) const
640 return find_at( head(), key, intrusive_key_comparator() );
643 /// Finds the key \p val using \p pred predicate for searching
645 The function is an analog of \ref cds_nonintrusive_MichaelList_rcu_find_val "find(Q const&)"
646 but \p pred is used for key comparing.
647 \p Less functor has the interface like \p std::less.
648 \p pred must imply the same element order as the comparator used for building the list.
650 template <typename Q, typename Less>
651 bool find_with( Q const& key, Less pred ) const
653 return find_at( head(), key, typename options::template less_wrapper<Less>::type() );
656 /// Finds the key \p val and performs an action with it
657 /** \anchor cds_nonintrusive_MichaelList_rcu_find_func
658 The function searches an item with key equal to \p val and calls the functor \p f for the item found.
659 The interface of \p Func functor is:
662 void operator()( value_type& item, Q& val );
665 where \p item is the item found, \p val is the <tt>find</tt> function argument.
667 You may pass \p f argument by reference using <tt>boost::ref</tt> or cds::ref.
669 The functor may change non-key fields of \p item. Note that the function is only guarantee
670 that \p item cannot be deleted during functor is executing.
671 The function does not serialize simultaneous access to the list \p item. If such access is
672 possible you must provide your own synchronization schema to exclude unsafe item modifications.
674 The \p val argument is non-const since it can be used as \p f functor destination i.e., the functor
675 may modify both arguments.
677 The function makes RCU lock internally.
679 The function returns \p true if \p val is found, \p false otherwise.
681 template <typename Q, typename Func>
682 bool find( Q& val, Func f ) const
684 return find_at( head(), val, intrusive_key_comparator(), f );
687 /// Finds the key \p val using \p pred predicate for searching
689 The function is an analog of \ref cds_nonintrusive_MichaelList_rcu_find_func "find(Q&, Func)"
690 but \p pred is used for key comparing.
691 \p Less functor has the interface like \p std::less.
692 \p pred must imply the same element order as the comparator used for building the list.
694 template <typename Q, typename Less, typename Func>
695 bool find_with( Q& val, Less pred, Func f ) const
697 return find_at( head(), val, typename options::template less_wrapper<Less>::type(), f );
700 /// Finds the key \p val and performs an action with it
701 /** \anchor cds_nonintrusive_MichaelList_rcu_find_cfunc
702 The function searches an item with key equal to \p val and calls the functor \p f for the item found.
703 The interface of \p Func functor is:
706 void operator()( value_type& item, Q const& val );
709 where \p item is the item found, \p val is the <tt>find</tt> function argument.
711 You may pass \p f argument by reference using <tt>boost::ref</tt> or cds::ref.
713 The functor may change non-key fields of \p item. Note that the function is only guarantee
714 that \p item cannot be deleted during functor is executing.
715 The function does not serialize simultaneous access to the list \p item. If such access is
716 possible you must provide your own synchronization schema to exclude unsafe item modifications.
718 The function makes RCU lock internally.
720 The function returns \p true if \p val is found, \p false otherwise.
722 template <typename Q, typename Func>
723 bool find( Q const& val, Func f ) const
725 return find_at( head(), val, intrusive_key_comparator(), f );
728 /// Finds the key \p val using \p pred predicate for searching
730 The function is an analog of \ref cds_nonintrusive_MichaelList_rcu_find_cfunc "find(Q&, Func)"
731 but \p pred is used for key comparing.
732 \p Less functor has the interface like \p std::less.
733 \p pred must imply the same element order as the comparator used for building the list.
735 template <typename Q, typename Less, typename Func>
736 bool find_with( Q const& val, Less pred, Func f ) const
738 return find_at( head(), val, typename options::template less_wrapper<Less>::type(), f );
741 /// Finds the key \p val and return the item found
742 /** \anchor cds_nonintrusive_MichaelList_rcu_get
743 The function searches the item with key equal to \p val and returns the pointer to item found.
744 If \p val is not found it returns \p nullptr.
746 Note the compare functor should accept a parameter of type \p Q that can be not the same as \p value_type.
748 RCU should be locked before call of this function.
749 Returned item is valid only while RCU is locked:
751 typedef cds::container::MichaelList< cds::urcu::gc< cds::urcu::general_buffered<> >, foo, my_traits > ord_list;
756 ord_list::rcu_lock lock;
758 foo * pVal = theList.get( 5 );
763 // Unlock RCU by rcu_lock destructor
764 // pVal can be freed at any time after RCU has been unlocked
768 template <typename Q>
769 value_type * get( Q const& val ) const
771 return get_at( head(), val, intrusive_key_comparator());
774 /// Finds the key \p val and return the item found
776 The function is an analog of \ref cds_nonintrusive_MichaelList_rcu_get "get(Q const&)"
777 but \p pred is used for comparing the keys.
779 \p Less functor has the semantics like \p std::less but should take arguments of type \ref value_type and \p Q
781 \p pred must imply the same element order as the comparator used for building the list.
783 template <typename Q, typename Less>
784 value_type * get_with( Q const& val, Less pred ) const
786 return get_at( head(), val, typename options::template less_wrapper<Less>::type());
789 /// Checks if the list is empty
792 return base_class::empty();
795 /// Returns list's item count
797 The value returned depends on opt::item_counter option. For atomics::empty_item_counter,
798 this function always returns 0.
800 <b>Warning</b>: even if you use a real item counter and it returns 0, this fact is not mean that the list
801 is empty. To check list emptyness use \ref empty() method.
805 return base_class::size();
810 Post-condition: the list is empty
819 bool insert_node_at( head_type& refHead, node_type * pNode )
822 scoped_node_ptr p(pNode);
823 if ( base_class::insert_at( refHead, *pNode )) {
831 template <typename Q>
832 bool insert_at( head_type& refHead, Q const& val )
834 return insert_node_at( refHead, alloc_node( val ));
837 template <typename Q, typename Func>
838 bool insert_at( head_type& refHead, Q const& key, Func f )
840 scoped_node_ptr pNode( alloc_node( key ));
842 # ifdef CDS_CXX11_LAMBDA_SUPPORT
843 # ifdef CDS_BUG_STATIC_MEMBER_IN_LAMBDA
844 // GCC 4.5,4.6,4.7: node_to_value is unaccessible from lambda,
845 // like as MichaelList::node_to_value that requires to capture *this* despite on node_to_value is static function
846 value_type& (* n2v)( node_type& ) = node_to_value;
847 if ( base_class::insert_at( refHead, *pNode, [&f, n2v]( node_type& node ) { cds::unref(f)( n2v(node) ); } ))
849 if ( base_class::insert_at( refHead, *pNode, [&f]( node_type& node ) { cds::unref(f)( node_to_value(node) ); } ))
852 insert_functor<Func> wrapper( f );
853 if ( base_class::insert_at( refHead, *pNode, cds::ref(wrapper) ))
862 template <typename... Args>
863 bool emplace_at( head_type& refHead, Args&&... args )
865 return insert_node_at( refHead, alloc_node( std::forward<Args>(args) ... ));
868 template <typename Q, typename Compare, typename Func>
869 bool erase_at( head_type& refHead, Q const& key, Compare cmp, Func f )
871 # ifdef CDS_CXX11_LAMBDA_SUPPORT
872 # ifdef CDS_BUG_STATIC_MEMBER_IN_LAMBDA
873 // GCC 4.5-4.7: node_to_value is unaccessible from lambda,
874 // like as MichaelList::node_to_value that requires to capture *this* despite on node_to_value is static function
875 value_type const& (* n2v)( node_type const& ) = node_to_value;
876 return base_class::erase_at( refHead, key, cmp, [&f,n2v](node_type const& node){ cds::unref(f)( n2v(node) ); } );
878 return base_class::erase_at( refHead, key, cmp, [&f](node_type const& node){ cds::unref(f)( node_to_value(node) ); } );
881 erase_functor<Func> wrapper( f );
882 return base_class::erase_at( refHead, key, cmp, cds::ref(wrapper) );
886 template <typename Q, typename Func>
887 std::pair<bool, bool> ensure_at( head_type& refHead, Q const& key, Func f )
889 scoped_node_ptr pNode( alloc_node( key ));
891 # ifdef CDS_CXX11_LAMBDA_SUPPORT
892 # ifdef CDS_BUG_STATIC_MEMBER_IN_LAMBDA
893 // GCC 4.5-4.7: node_to_value is unaccessible from lambda,
894 // like as MichaelList::node_to_value that requires to capture *this* despite on node_to_value is static function
895 value_type& (* n2v)( node_type& ) = node_to_value;
896 std::pair<bool, bool> ret = base_class::ensure_at( refHead, *pNode,
897 [&f, &key, n2v](bool bNew, node_type& node, node_type&){ cds::unref(f)( bNew, n2v(node), key ); });
899 std::pair<bool, bool> ret = base_class::ensure_at( refHead, *pNode,
900 [&f, &key](bool bNew, node_type& node, node_type&){ cds::unref(f)( bNew, node_to_value(node), key ); });
903 ensure_functor<Q, Func> wrapper( key, f );
904 std::pair<bool, bool> ret = base_class::ensure_at( refHead, *pNode, cds::ref(wrapper));
906 if ( ret.first && ret.second )
912 template <typename Q, typename Compare>
913 node_type * extract_at( head_type& refHead, Q const& key, Compare cmp )
915 return base_class::extract_at( refHead, key, cmp );
918 template <typename Q, typename Compare>
919 bool find_at( head_type& refHead, Q const& key, Compare cmp ) const
921 # ifdef CDS_CXX11_LAMBDA_SUPPORT
922 return base_class::find_at( refHead, key, cmp, [](node_type&, Q const &) {} );
924 return base_class::find_at( refHead, key, cmp, empty_find_functor() );
928 template <typename Q, typename Compare, typename Func>
929 bool find_at( head_type& refHead, Q& val, Compare cmp, Func f ) const
931 # ifdef CDS_CXX11_LAMBDA_SUPPORT
932 # ifdef CDS_BUG_STATIC_MEMBER_IN_LAMBDA
933 // GCC 4.5-4.7: node_to_value is unaccessible from lambda,
934 // like as MichaelList::node_to_value that requires to capture *this* despite on node_to_value is static function
935 value_type& (* n2v)( node_type& ) = node_to_value;
936 return base_class::find_at( refHead, val, cmp, [&f, n2v](node_type& node, Q& v){ cds::unref(f)( n2v(node), v ); });
938 return base_class::find_at( refHead, val, cmp, [&f](node_type& node, Q& v){ cds::unref(f)( node_to_value(node), v ); });
941 find_functor<Func> wrapper( f );
942 return base_class::find_at( refHead, val, cmp, cds::ref(wrapper) );
946 template <typename Q, typename Compare>
947 value_type * get_at( head_type& refHead, Q const& val, Compare cmp ) const
949 node_type * pNode = base_class::get_at( refHead, val, cmp );
950 return pNode ? &pNode->m_Value : nullptr;
956 }} // namespace cds::container
958 #endif // #ifndef __CDS_CONTAINER_MICHAEL_LIST_RCU_H