2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
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_MICHAEL_KVLIST_RCU_H
32 #define CDSLIB_CONTAINER_MICHAEL_KVLIST_RCU_H
35 #include <functional> // ref
36 #include <cds/container/details/michael_list_base.h>
37 #include <cds/intrusive/michael_list_rcu.h>
38 #include <cds/container/details/make_michael_kvlist.h>
40 namespace cds { namespace container {
42 /// Michael's ordered list (key-value pair), template specialization for \ref cds_urcu_desc "RCU"
43 /** @ingroup cds_nonintrusive_list
44 \anchor cds_nonintrusive_MichaelKVList_rcu
46 This is key-value variation of non-intrusive \ref cds_nonintrusive_MichaelList_rcu "MichaelList".
47 Like standard container, this implementation split a value stored into two part -
48 constant key and alterable value.
50 Usually, ordered single-linked list is used as a building block for the hash table implementation.
51 The complexity of searching is <tt>O(N)</tt>.
54 - \p RCU - one of \ref cds_urcu_gc "RCU type"
55 - \p Key - key type of an item stored in the list. It should be copy-constructible
56 - \p Value - value type stored in a list
57 - \p Traits - type traits, default is \p michael_list::traits
59 @note Before including <tt><cds/container/michael_kvlist_rcu.h></tt> you should include appropriate RCU header file,
60 see \ref cds_urcu_gc "RCU type" for list of existing RCU class and corresponding header files.
62 It is possible to declare option-based list using \p cds::container::michael_list::make_traits metafunction istead of \p Traits template
63 argument. For example, the following traits-based declaration of Michael's list
65 #include <cds/urcu/general_buffered.h>
66 #include <cds/container/michael_kvlist_rcu.h>
67 // Declare comparator for the item
69 int operator ()( int i1, int i2 )
76 struct my_traits: public cds::container::michael_list::traits
78 typedef my_compare compare;
81 // Declare traits-based list
82 typedef cds::container::MichaelKVList< cds::urcu::gc< cds::urcu::general_buffered<> >, int, int, my_traits > traits_based_list;
85 is equivalent for the following option-based list
87 #include <cds/urcu/general_buffered.h>
88 #include <cds/container/michael_kvlist_rcu.h>
90 // my_compare is the same
92 // Declare option-based list
93 typedef cds::container::MichaelKVList< cds::urcu::gc< cds::urcu::general_buffered<> >, int, int,
94 typename cds::container::michael_list::make_traits<
95 cds::container::opt::compare< my_compare > // item comparator option
104 #ifdef CDS_DOXYGEN_INVOKED
105 typename Traits = michael_list::traits
110 class MichaelKVList< cds::urcu::gc<RCU>, Key, Value, Traits >:
111 #ifdef CDS_DOXYGEN_INVOKED
112 protected intrusive::MichaelList< cds::urcu::gc<RCU>, implementation_defined, Traits >
114 protected details::make_michael_kvlist< cds::urcu::gc<RCU>, Key, Value, Traits >::type
118 typedef details::make_michael_kvlist< cds::urcu::gc<RCU>, Key, Value, Traits > maker;
119 typedef typename maker::type base_class;
123 typedef cds::urcu::gc<RCU> gc; ///< Garbage collector
125 #ifdef CDS_DOXYGEN_INVOKED
126 typedef Key key_type; ///< Key type
127 typedef Value mapped_type; ///< Type of value stored in the list
128 typedef std::pair<key_type const, mapped_type> value_type; ///< key/value pair stored in the list
130 typedef typename maker::key_type key_type;
131 typedef typename maker::value_type mapped_type;
132 typedef typename maker::pair_type value_type;
134 typedef Traits traits; ///< List traits
136 typedef typename base_class::back_off back_off; ///< Back-off strategy
137 typedef typename maker::allocator_type allocator_type; ///< Allocator type used for allocate/deallocate the nodes
138 typedef typename base_class::item_counter item_counter; ///< Item counting policy
139 typedef typename maker::key_comparator key_comparator; ///< key comparison functor
140 typedef typename base_class::memory_model memory_model; ///< Memory ordering. See \p michael_list::traits::memory_model
141 typedef typename base_class::rcu_check_deadlock rcu_check_deadlock ; ///< RCU deadlock checking policy
143 typedef typename gc::scoped_lock rcu_lock ; ///< RCU scoped lock
144 static CDS_CONSTEXPR const bool c_bExtractLockExternal = base_class::c_bExtractLockExternal; ///< Group of \p extract_xxx functions do not require external locking
148 typedef typename base_class::value_type node_type;
149 typedef typename maker::cxx_allocator cxx_allocator;
150 typedef typename maker::node_deallocator node_deallocator;
151 typedef typename maker::intrusive_traits::compare intrusive_key_comparator;
153 typedef typename base_class::atomic_node_ptr head_type;
157 /// pointer to extracted node
158 using exempt_ptr = cds::urcu::exempt_ptr< gc, node_type, value_type, typename maker::intrusive_traits::disposer,
159 cds::urcu::details::conventional_exempt_pair_cast<node_type, value_type>
164 struct raw_ptr_converter
166 value_type * operator()( node_type * p ) const
168 return p ? &p->m_Data : nullptr;
171 value_type& operator()( node_type& n ) const
176 value_type const& operator()( node_type const& n ) const
184 /// Result of \p get(), \p get_with() functions - pointer to the node found
185 typedef cds::urcu::raw_ptr_adaptor< value_type, typename base_class::raw_ptr, raw_ptr_converter > raw_ptr;
189 template <typename K>
190 static node_type * alloc_node(const K& key)
192 return cxx_allocator().New( key );
195 template <typename K, typename V>
196 static node_type * alloc_node( const K& key, const V& val )
198 return cxx_allocator().New( key, val );
201 template <typename K, typename... Args>
202 static node_type * alloc_node( K&& key, Args&&... args )
204 return cxx_allocator().MoveNew( std::forward<K>(key), std::forward<Args>(args)...);
207 static void free_node( node_type * pNode )
209 cxx_allocator().Delete( pNode );
212 struct node_disposer {
213 void operator()( node_type * pNode )
218 typedef std::unique_ptr< node_type, node_disposer > scoped_node_ptr;
222 return base_class::m_pHead;
225 head_type& head() const
227 return const_cast<head_type&>( base_class::m_pHead );
233 template <bool IsConst>
234 class iterator_type: protected base_class::template iterator_type<IsConst>
236 typedef typename base_class::template iterator_type<IsConst> iterator_base;
238 iterator_type( head_type const& pNode )
239 : iterator_base( pNode )
242 friend class MichaelKVList;
245 typedef typename cds::details::make_const_type<mapped_type, IsConst>::reference value_ref;
246 typedef typename cds::details::make_const_type<mapped_type, IsConst>::pointer value_ptr;
248 typedef typename cds::details::make_const_type<value_type, IsConst>::reference pair_ref;
249 typedef typename cds::details::make_const_type<value_type, IsConst>::pointer pair_ptr;
254 iterator_type( iterator_type const& src )
255 : iterator_base( src )
258 key_type const& key() const
260 typename iterator_base::value_ptr p = iterator_base::operator ->();
261 assert( p != nullptr );
262 return p->m_Data.first;
265 pair_ptr operator ->() const
267 typename iterator_base::value_ptr p = iterator_base::operator ->();
268 return p ? &(p->m_Data) : nullptr;
271 pair_ref operator *() const
273 typename iterator_base::value_ref p = iterator_base::operator *();
277 value_ref val() const
279 typename iterator_base::value_ptr p = iterator_base::operator ->();
280 assert( p != nullptr );
281 return p->m_Data.second;
285 iterator_type& operator ++()
287 iterator_base::operator ++();
292 bool operator ==(iterator_type<C> const& i ) const
294 return iterator_base::operator ==(i);
297 bool operator !=(iterator_type<C> const& i ) const
299 return iterator_base::operator !=(i);
306 typedef iterator_type<false> iterator;
308 /// Const forward iterator
309 typedef iterator_type<true> const_iterator;
311 /// Returns a forward iterator addressing the first element in a list
313 For empty list \code begin() == end() \endcode
317 return iterator( head() );
320 /// Returns an iterator that addresses the location succeeding the last element in a list
322 Do not use the value returned by <tt>end</tt> function to access any item.
323 Internally, <tt>end</tt> returning value equals to \p nullptr.
325 The returned value can be used only to control reaching the end of the list.
326 For empty list \code begin() == end() \endcode
333 /// Returns a forward const iterator addressing the first element in a list
335 const_iterator begin() const
337 return const_iterator( head() );
339 const_iterator cbegin() const
341 return const_iterator( head() );
345 /// Returns an const iterator that addresses the location succeeding the last element in a list
347 const_iterator end() const
349 return const_iterator();
351 const_iterator cend() const
353 return const_iterator();
358 /// Default constructor
360 Initializes empty list
374 /// Inserts new node with key and default value
376 The function creates a node with \p key and default value, and then inserts the node created into the list.
379 - The \ref key_type should be constructible from value of type \p K.
380 In trivial case, \p K is equal to \ref key_type.
381 - The \ref mapped_type should be default-constructible.
383 The function applies RCU lock internally.
385 Returns \p true if inserting successful, \p false otherwise.
387 template <typename K>
388 bool insert( const K& key )
390 return insert_at( head(), key );
393 /// Inserts new node with a key and a value
395 The function creates a node with \p key and value \p val, and then inserts the node created into the list.
398 - The \ref key_type should be constructible from \p key of type \p K.
399 - The \ref mapped_type should be constructible from \p val of type \p V.
401 The function applies RCU lock internally.
403 Returns \p true if inserting successful, \p false otherwise.
405 template <typename K, typename V>
406 bool insert( const K& key, const V& val )
408 return insert_at( head(), key, val );
411 /// Inserts new node and initialize it by a functor
413 This function inserts new node with key \p key and if inserting is successful then it calls
414 \p func functor with signature
417 void operator()( value_type& item );
421 The argument \p item of user-defined functor \p func is the reference
422 to the list's item inserted. <tt>item.second</tt> is a reference to item's value that may be changed.
423 User-defined functor \p func should guarantee that during changing item's value no any other changes
424 could be made on this list's item by concurrent threads.
426 The key_type should be constructible from value of type \p K.
428 The function allows to split creating of new item into two part:
429 - create item from \p key;
430 - insert new item into the list;
431 - if inserting is successful, initialize the value of item by calling \p func functor
433 This can be useful if complete initialization of object of \p mapped_type is heavyweight and
434 it is preferable that the initialization should be completed only if inserting is successful.
436 The function applies RCU lock internally.
438 @warning See \ref cds_intrusive_item_creating "insert item troubleshooting"
440 template <typename K, typename Func>
441 bool insert_with( const K& key, Func func )
443 return insert_with_at( head(), key, func );
446 /// Ensures that the \p key exists in the list
448 The operation performs inserting or changing data with lock-free manner.
450 If the \p key not found in the list, then the new item created from \p key
451 is inserted into the list (note that in this case the \ref key_type should be
452 copy-constructible from type \p K).
453 Otherwise, the functor \p func is called with item found.
454 The functor \p Func may be a function with signature:
456 void func( bool bNew, value_type& item );
461 void operator()( bool bNew, value_type& item );
466 - \p bNew - \p true if the item has been inserted, \p false otherwise
467 - \p item - item of the list
469 The functor may change any fields of the \p item.second that is \ref mapped_type;
470 however, \p func must guarantee that during changing no any other modifications
471 could be made on this item by concurrent threads.
473 The function applies RCU lock internally.
475 Returns <tt> std::pair<bool, bool> </tt> where \p first is true if operation is successfull,
476 \p second is true if new item has been added or \p false if the item with \p key
477 already is in the list.
479 @warning See \ref cds_intrusive_item_creating "insert item troubleshooting"
481 /// Updates data by \p key
483 The operation performs inserting or replacing the element with lock-free manner.
485 If the \p key not found in the list, then the new item created from \p key
486 will be inserted iff \p bAllowInsert is \p true.
487 (note that in this case the \ref key_type should be constructible from type \p K).
488 Otherwise, if \p key is found, the functor \p func is called with item found.
490 The functor \p Func signature is:
493 void operator()( bool bNew, value_type& item );
497 - \p bNew - \p true if the item has been inserted, \p false otherwise
498 - \p item - the item found or inserted
500 The functor may change any fields of the \p item.second that is \ref mapped_type;
501 however, \p func must guarantee that during changing no any other modifications
502 could be made on this item by concurrent threads.
504 The function applies RCU lock internally.
506 Returns <tt> std::pair<bool, bool> </tt> where \p first is true if operation is successfull,
507 \p second is true if new item has been added or \p false if the item with \p key
510 @warning See \ref cds_intrusive_item_creating "insert item troubleshooting"
512 template <typename K, typename Func>
513 std::pair<bool, bool> update( const K& key, Func func, bool bAllowInsert = true )
515 return update_at( head(), key, func, bAllowInsert );
518 template <typename K, typename Func>
519 CDS_DEPRECATED("ensure() is deprecated, use update()")
520 std::pair<bool, bool> ensure( const K& key, Func f )
522 return update( key, f, true );
526 /// Inserts data of type \ref mapped_type constructed with <tt>std::forward<Args>(args)...</tt>
528 Returns \p true if inserting successful, \p false otherwise.
530 The function applies RCU lock internally.
532 template <typename K, typename... Args>
533 bool emplace( K&& key, Args&&... args )
535 return emplace_at( head(), std::forward<K>(key), std::forward<Args>(args)... );
538 /// Deletes \p key from the list
539 /** \anchor cds_nonintrusive_MichaelKVList_rcu_erase
541 RCU \p synchronize method can be called. RCU should not be locked.
543 Returns \p true if \p key is found and has been deleted, \p false otherwise
545 template <typename K>
546 bool erase( K const& key )
548 return erase_at( head(), key, intrusive_key_comparator() );
551 /// Deletes the item from the list using \p pred predicate for searching
553 The function is an analog of \ref cds_nonintrusive_MichaelKVList_rcu_erase "erase(K const&)"
554 but \p pred is used for key comparing.
555 \p Less functor has the interface like \p std::less.
556 \p pred must imply the same element order as the comparator used for building the list.
558 template <typename K, typename Less>
559 bool erase_with( K const& key, Less pred )
562 return erase_at( head(), key, typename maker::template less_wrapper<Less>::type() );
565 /// Deletes \p key from the list
566 /** \anchor cds_nonintrusive_MichaelKVList_rcu_erase_func
567 The function searches an item with key \p key, calls \p f functor
568 and deletes the item. If \p key is not found, the functor is not called.
570 The functor \p Func interface:
573 void operator()(value_type& val) { ... }
577 RCU \p synchronize method can be called. RCU should not be locked.
579 Return \p true if key is found and deleted, \p false otherwise
583 template <typename K, typename Func>
584 bool erase( K const& key, Func f )
586 return erase_at( head(), key, intrusive_key_comparator(), f );
589 /// Deletes the item from the list using \p pred predicate for searching
591 The function is an analog of \ref cds_nonintrusive_MichaelKVList_rcu_erase_func "erase(K const&, Func)"
592 but \p pred is used for key comparing.
593 \p Less functor has the interface like \p std::less.
594 \p pred must imply the same element order as the comparator used for building the list.
596 template <typename K, typename Less, typename Func>
597 bool erase_with( K const& key, Less pred, Func f )
600 return erase_at( head(), key, typename maker::template less_wrapper<Less>::type(), f );
603 /// Extracts an item from the list
605 @anchor cds_nonintrusive_MichaelKVList_rcu_extract
606 The function searches an item with key equal to \p key in the list,
607 unlinks it from the list, and returns \ref cds::urcu::exempt_ptr "exempt_ptr" pointer to the item found.
608 If \p key is not found the function returns an empty \p exempt_ptr.
610 @note The function does NOT dispose the item found.
611 It just excludes the item from the list and returns a pointer to item found.
612 You shouldn't lock RCU before calling this function.
615 #include <cds/urcu/general_buffered.h>
616 #include <cds/container/michael_kvlist_rcu.h>
618 typedef cds::urcu::gc< general_buffered<> > rcu;
619 typedef cds::container::MichaelKVList< rcu, int, Foo > rcu_michael_list;
621 rcu_michael_list theList;
624 rcu_michael_list::exempt_ptr p;
626 // The RCU should NOT be locked when extract() is called!
627 assert( !rcu::is_locked() );
630 p = theList.extract( 10 );
632 // do something with p
636 // we may safely release extracted pointer here.
637 // release() passes the pointer to RCU reclamation cycle.
641 template <typename K>
642 exempt_ptr extract( K const& key )
644 return exempt_ptr( extract_at( head(), key, intrusive_key_comparator() ));
647 /// Extracts an item from the list using \p pred predicate for searching
649 This function is the analog for \p extract(K const&).
650 The \p pred is a predicate used for key comparing.
651 \p Less has the interface like \p std::less.
652 \p pred must imply the same element order as \ref key_comparator.
654 template <typename K, typename Less>
655 exempt_ptr extract_with( K const& key, Less pred )
658 return exempt_ptr( extract_at( head(), key, typename maker::template less_wrapper<Less>::type() ));
661 /// Checks whether the list contains \p key
663 The function searches the item with key equal to \p key
664 and returns \p true if it is found, and \p false otherwise.
666 The function applies RCU lock internally.
668 template <typename Q>
669 bool contains( Q const& key )
671 return find_at( head(), key, intrusive_key_comparator() );
674 template <typename Q>
675 CDS_DEPRECATED("deprecated, use contains()")
676 bool find( Q const& key )
678 return contains( key );
682 /// Checks whether the map contains \p key using \p pred predicate for searching
684 The function is an analog of <tt>contains( key )</tt> but \p pred is used for key comparing.
685 \p Less functor has the interface like \p std::less.
686 \p Less must imply the same element order as the comparator used for building the list.
688 The function applies RCU lock internally.
690 template <typename Q, typename Less>
691 bool contains( Q const& key, Less pred )
694 return find_at( head(), key, typename maker::template less_wrapper<Less>::type() );
697 template <typename Q, typename Less>
698 CDS_DEPRECATED("deprecated, use contains()")
699 bool find_with( Q const& key, Less pred )
701 return contains( key, pred );
705 /// Finds \p key and performs an action with it
706 /** \anchor cds_nonintrusive_MichaelKVList_rcu_find_func
707 The function searches an item with key equal to \p key and calls the functor \p f for the item found.
708 The interface of \p Func functor is:
711 void operator()( value_type& item );
714 where \p item is the item found.
716 The functor may change <tt>item.second</tt> that is reference to value of node.
717 Note that the function is only guarantee that \p item cannot be deleted during functor is executing.
718 The function does not serialize simultaneous access to the list \p item. If such access is
719 possible you must provide your own synchronization schema to exclude unsafe item modifications.
721 The function makes RCU lock internally.
723 The function returns \p true if \p key is found, \p false otherwise.
725 template <typename Q, typename Func>
726 bool find( Q const& key, Func f )
728 return find_at( head(), key, intrusive_key_comparator(), f );
731 /// Finds the key \p val using \p pred predicate for searching
733 The function is an analog of \ref cds_nonintrusive_MichaelKVList_rcu_find_func "find(Q const&, Func)"
734 but \p pred is used for key comparing.
735 \p Less functor has the interface like \p std::less.
736 \p pred must imply the same element order as the comparator used for building the list.
738 template <typename Q, typename Less, typename Func>
739 bool find_with( Q const& key, Less pred, Func f )
742 return find_at( head(), key, typename maker::template less_wrapper<Less>::type(), f );
745 /// Finds \p key and return the item found
746 /** \anchor cds_nonintrusive_MichaelKVList_rcu_get
747 The function searches the item with \p key and returns the pointer to item found.
748 If \p key is not found it returns an empty \p raw_ptr object.
750 Note the compare functor should accept a parameter of type \p K that can be not the same as \p key_type.
752 RCU should be locked before call of this function.
753 Returned item is valid only while RCU is locked:
755 typedef cds::container::MichaelKVList< cds::urcu::gc< cds::urcu::general_buffered<> >, int, foo, my_traits > ord_list;
758 tyename ord_list::raw_ptr rp;
761 ord_list::rcu_lock lock;
763 rp = theList.get( 5 );
768 // Unlock RCU by rcu_lock destructor
770 // rp can be released at any time after RCU has been unlocked
774 template <typename K>
775 raw_ptr get( K const& key )
777 return get_at( head(), key, intrusive_key_comparator());
780 /// Finds \p key and return the item found
782 The function is an analog of \ref cds_nonintrusive_MichaelKVList_rcu_get "get(K const&)"
783 but \p pred is used for comparing the keys.
785 \p Less functor has the semantics like \p std::less but should take arguments of type \ref key_type and \p K
787 \p pred must imply the same element order as the comparator used for building the list.
789 template <typename K, typename Less>
790 raw_ptr get_with( K const& key, Less pred )
793 return get_at( head(), key, typename maker::template less_wrapper<Less>::type() );
796 /// Checks if the list is empty
799 return base_class::empty();
802 /// Returns list's item count
804 The value returned depends on item counter provided by \p Traits. For \p atomicity::empty_item_counter,
805 this function always returns 0.
807 @note Even if you use real item counter and it returns 0, this fact does not mean that the list
808 is empty. To check list emptyness use \p empty() method.
812 return base_class::size();
817 Post-condition: the list is empty
826 bool insert_node_at( head_type& refHead, node_type * pNode )
828 assert( pNode != nullptr );
829 scoped_node_ptr p( pNode );
830 if ( base_class::insert_at( refHead, *pNode )) {
837 template <typename K>
838 bool insert_at( head_type& refHead, const K& key )
840 return insert_node_at( refHead, alloc_node( key ));
843 template <typename K, typename V>
844 bool insert_at( head_type& refHead, const K& key, const V& val )
846 return insert_node_at( refHead, alloc_node( key, val ));
849 template <typename K, typename Func>
850 bool insert_with_at( head_type& refHead, const K& key, Func f )
852 scoped_node_ptr pNode( alloc_node( key ));
854 if ( base_class::insert_at( refHead, *pNode, [&f](node_type& node){ f( node.m_Data ); })) {
861 template <typename K, typename... Args>
862 bool emplace_at( head_type& refHead, K&& key, Args&&... args )
864 return insert_node_at( refHead, alloc_node( std::forward<K>(key), std::forward<Args>(args)... ));
867 template <typename K, typename Func>
868 std::pair<bool, bool> update_at( head_type& refHead, const K& key, Func f, bool bAllowInsert )
870 scoped_node_ptr pNode( alloc_node( key ));
872 std::pair<bool, bool> ret = base_class::update_at( refHead, *pNode,
873 [&f]( bool bNew, node_type& node, node_type& ){ f( bNew, node.m_Data ); },
875 if ( ret.first && ret.second )
881 template <typename K, typename Compare>
882 bool erase_at( head_type& refHead, K const& key, Compare cmp )
884 return base_class::erase_at( refHead, key, cmp );
887 template <typename K, typename Compare, typename Func>
888 bool erase_at( head_type& refHead, K const& key, Compare cmp, Func f )
890 return base_class::erase_at( refHead, key, cmp, [&f]( node_type const & node ){ f( const_cast<value_type&>(node.m_Data)); });
893 template <typename K, typename Compare>
894 node_type * extract_at( head_type& refHead, K const& key, Compare cmp )
896 return base_class::extract_at( refHead, key, cmp );
899 template <typename K, typename Compare>
900 bool find_at( head_type& refHead, K const& key, Compare cmp )
902 return base_class::find_at( refHead, key, cmp, [](node_type&, K const&) {} );
905 template <typename K, typename Compare, typename Func>
906 bool find_at( head_type& refHead, K& key, Compare cmp, Func f )
908 return base_class::find_at( refHead, key, cmp, [&f](node_type& node, K const&){ f( node.m_Data ); });
911 template <typename K, typename Compare>
912 raw_ptr get_at( head_type& refHead, K const& val, Compare cmp )
914 return raw_ptr( base_class::get_at( refHead, val, cmp ));
920 }} // namespace cds::container
922 #endif // #ifndef CDSLIB_CONTAINER_MICHAEL_KVLIST_RCU_H