3 #ifndef __CDS_CONTAINER_LAZY_KVLIST_IMPL_H
4 #define __CDS_CONTAINER_LAZY_KVLIST_IMPL_H
8 #include <cds/details/functor_wrapper.h>
9 #include <cds/container/details/guarded_ptr_cast.h>
11 namespace cds { namespace container {
13 /// Lazy ordered list (key-value pair)
14 /** @ingroup cds_nonintrusive_list
15 \anchor cds_nonintrusive_LazyKVList_gc
17 This is key-value variation of non-intrusive LazyList.
18 Like standard container, this implementation split a value stored into two part -
19 constant key and alterable value.
21 Usually, ordered single-linked list is used as a building block for the hash table implementation.
22 The complexity of searching is <tt>O(N)</tt>.
25 - \p GC - garbage collector used
26 - \p Key - key type of an item stored in the list. It should be copy-constructible
27 - \p Value - value type stored in the list
28 - \p Traits - type traits, default is lazy_list::type_traits
30 It is possible to declare option-based list with cds::container::lazy_list::make_traits metafunction istead of \p Traits template
31 argument. For example, the following traits-based declaration of gc::HP lazy list
33 #include <cds/container/lazy_kvlist_hp.h>
34 // Declare comparator for the item
36 int operator ()( int i1, int i2 )
42 // Declare type_traits
43 struct my_traits: public cds::container::lazy_list::type_traits
45 typedef my_compare compare;
48 // Declare traits-based list
49 typedef cds::container::LazyKVList< cds::gc::HP, int, int, my_traits > traits_based_list;
52 is equivalent for the following option-based list
54 #include <cds/container/lazy_kvlist_hp.h>
56 // my_compare is the same
58 // Declare option-based list
59 typedef cds::container::LazyKVList< cds::gc::HP, int, int,
60 typename cds::container::lazy_list::make_traits<
61 cds::container::opt::compare< my_compare > // item comparator option
66 Template argument list \p Options of cds::container::lazy_list::make_traits metafunction are:
67 - opt::compare - key comparison functor. No default functor is provided.
68 If the option is not specified, the opt::less is used.
69 - opt::less - specifies binary predicate used for key comparison. Default is \p std::less<T>.
70 - opt::back_off - back-off strategy used. If the option is not specified, the cds::backoff::empty is used.
71 - opt::item_counter - the type of item counting feature. Default is \ref atomicity::empty_item_counter that is no item counting.
72 - opt::allocator - the allocator used for creating and freeing list's item. Default is \ref CDS_DEFAULT_ALLOCATOR macro.
73 - opt::memory_model - C++ memory ordering model. Can be opt::v::relaxed_ordering (relaxed memory model, the default)
74 or opt::v::sequential_consistent (sequentially consisnent memory model).
77 There are different specializations of this template for each garbage collecting schema used.
78 You should include appropriate .h-file depending on GC you are using:
79 - for gc::HP: \code #include <cds/container/lazy_kvlist_hp.h> \endcode
80 - for gc::PTB: \code #include <cds/container/lazy_kvlist_ptb.h> \endcode
81 - for gc::HRC: \code #include <cds/container/lazy_kvlist_hrc.h> \endcode
82 - for \ref cds_urcu_desc "RCU": \code #include <cds/container/lazy_kvlist_rcu.h> \endcode
83 - for gc::nogc: \code #include <cds/container/lazy_kvlist_nogc.h> \endcode
89 #ifdef CDS_DOXYGEN_INVOKED
90 typename Traits = lazy_list::type_traits
96 #ifdef CDS_DOXYGEN_INVOKED
97 protected intrusive::LazyList< GC, implementation_defined, Traits >
99 protected details::make_lazy_kvlist< GC, Key, Value, Traits >::type
103 typedef details::make_lazy_kvlist< GC, Key, Value, Traits > options;
104 typedef typename options::type base_class;
108 #ifdef CDS_DOXYGEN_INVOKED
109 typedef Key key_type ; ///< Key type
110 typedef Value mapped_type ; ///< Type of value stored in the list
111 typedef std::pair<key_type const, mapped_type> value_type ; ///< key/value pair stored in the list
113 typedef typename options::key_type key_type;
114 typedef typename options::value_type mapped_type;
115 typedef typename options::pair_type value_type;
118 typedef typename base_class::gc gc ; ///< Garbage collector used
119 typedef typename base_class::back_off back_off ; ///< Back-off strategy used
120 typedef typename options::allocator_type allocator_type ; ///< Allocator type used for allocate/deallocate the nodes
121 typedef typename base_class::item_counter item_counter ; ///< Item counting policy used
122 typedef typename options::key_comparator key_comparator ; ///< key comparison functor
123 typedef typename base_class::memory_model memory_model ; ///< Memory ordering. See cds::opt::memory_model option
127 typedef typename base_class::value_type node_type;
128 typedef typename options::cxx_allocator cxx_allocator;
129 typedef typename options::node_deallocator node_deallocator;
130 typedef typename options::type_traits::compare intrusive_key_comparator;
132 typedef typename base_class::node_type head_type;
137 typedef cds::gc::guarded_ptr< gc, node_type, value_type, details::guarded_ptr_cast_map<node_type, value_type> > guarded_ptr;
141 # ifndef CDS_CXX11_LAMBDA_SUPPORT
142 template <typename Func>
143 class insert_functor: protected cds::details::functor_wrapper<Func>
145 typedef cds::details::functor_wrapper<Func> base_class;
147 insert_functor ( Func f )
151 void operator()( node_type& node )
153 base_class::get()( node.m_Data );
157 template <typename Func>
158 class ensure_functor: protected cds::details::functor_wrapper<Func>
160 typedef cds::details::functor_wrapper<Func> base_class;
162 ensure_functor( Func f )
166 void operator ()( bool bNew, node_type& node, node_type& )
168 base_class::get()( bNew, node.m_Data );
172 template <typename Func>
173 class find_functor: protected cds::details::functor_wrapper<Func>
175 typedef cds::details::functor_wrapper<Func> base_class;
177 find_functor( Func f )
181 template <typename Q>
182 void operator ()( node_type& node, Q& )
184 base_class::get()( node.m_Data );
188 template <typename Func>
193 erase_functor( Func f )
197 void operator ()( node_type const & node )
199 cds::unref(m_func)( const_cast<value_type&>(node.m_Data) );
202 # endif // ifndef CDS_CXX11_LAMBDA_SUPPORT
207 template <typename K>
208 static node_type * alloc_node(const K& key)
210 return cxx_allocator().New( key );
213 template <typename K, typename V>
214 static node_type * alloc_node( const K& key, const V& val )
216 return cxx_allocator().New( key, val );
219 template <typename... Args>
220 static node_type * alloc_node( Args&&... args )
222 return cxx_allocator().MoveNew( std::forward<Args>(args)... );
225 static void free_node( node_type * pNode )
227 cxx_allocator().Delete( pNode );
230 struct node_disposer {
231 void operator()( node_type * pNode )
236 typedef std::unique_ptr< node_type, node_disposer > scoped_node_ptr;
240 return *base_class::head();
243 head_type const& head() const
245 return *base_class::head();
250 return *base_class::tail();
253 head_type const& tail() const
255 return *base_class::tail();
262 template <bool IsConst>
263 class iterator_type: protected base_class::template iterator_type<IsConst>
265 typedef typename base_class::template iterator_type<IsConst> iterator_base;
267 iterator_type( head_type const& pNode )
268 : iterator_base( const_cast<head_type *>(&pNode) )
270 iterator_type( head_type const * pNode )
271 : iterator_base( const_cast<head_type *>(pNode) )
274 friend class LazyKVList;
277 typedef typename cds::details::make_const_type<mapped_type, IsConst>::reference value_ref;
278 typedef typename cds::details::make_const_type<mapped_type, IsConst>::pointer value_ptr;
280 typedef typename cds::details::make_const_type<value_type, IsConst>::reference pair_ref;
281 typedef typename cds::details::make_const_type<value_type, IsConst>::pointer pair_ptr;
286 iterator_type( iterator_type const& src )
287 : iterator_base( src )
290 key_type const& key() const
292 typename iterator_base::value_ptr p = iterator_base::operator ->();
293 assert( p != nullptr );
294 return p->m_Data.first;
297 value_ref val() const
299 typename iterator_base::value_ptr p = iterator_base::operator ->();
300 assert( p != nullptr );
301 return p->m_Data.second;
304 pair_ptr operator ->() const
306 typename iterator_base::value_ptr p = iterator_base::operator ->();
307 return p ? &(p->m_Data) : nullptr;
310 pair_ref operator *() const
312 typename iterator_base::value_ref p = iterator_base::operator *();
317 iterator_type& operator ++()
319 iterator_base::operator ++();
324 bool operator ==(iterator_type<C> const& i ) const
326 return iterator_base::operator ==(i);
329 bool operator !=(iterator_type<C> const& i ) const
331 return iterator_base::operator !=(i);
339 The forward iterator for lazy list has some features:
340 - it has no post-increment operator
341 - to protect the value, the iterator contains a GC-specific guard + another guard is required locally for increment operator.
342 For some GC (gc::HP, gc::HRC), a guard is limited resource per thread, so an exception (or assertion) "no free guard"
343 may be thrown if a limit of guard count per thread is exceeded.
344 - The iterator cannot be moved across thread boundary since it contains GC's guard that is thread-private GC data.
345 - Iterator ensures thread-safety even if you delete the item that iterator points to. However, in case of concurrent
346 deleting operations it is no guarantee that you iterate all item in the list.
348 Therefore, the use of iterators in concurrent environment is not good idea. Use the iterator on the concurrent container
349 for debug purpose only.
351 The iterator interface to access item data:
352 - <tt> operator -> </tt> - returns a pointer to \ref value_type for iterator
353 - <tt> operator *</tt> - returns a reference (a const reference for \p const_iterator) to \ref value_type for iterator
354 - <tt> const key_type& key() </tt> - returns a key reference for iterator
355 - <tt> mapped_type& val() </tt> - retuns a value reference for iterator (const reference for \p const_iterator)
357 For both functions the iterator should not be equal to <tt> end() </tt>
359 typedef iterator_type<false> iterator;
361 /// Const forward iterator
363 For iterator's features and requirements see \ref iterator
365 typedef iterator_type<true> const_iterator;
367 /// Returns a forward iterator addressing the first element in a list
369 For empty list \code begin() == end() \endcode
373 iterator it( head() );
374 ++it ; // skip dummy head
378 /// Returns an iterator that addresses the location succeeding the last element in a list
380 Do not use the value returned by <tt>end</tt> function to access any item.
381 Internally, <tt>end</tt> returning value equals to \p nullptr.
383 The returned value can be used only to control reaching the end of the list.
384 For empty list \code begin() == end() \endcode
388 return iterator( tail() );
391 /// Returns a forward const iterator addressing the first element in a list
393 const_iterator begin() const
395 const_iterator it( head() );
396 ++it; // skip dummy head
399 const_iterator cbegin()
401 const_iterator it( head() );
402 ++it; // skip dummy head
407 /// Returns an const iterator that addresses the location succeeding the last element in a list
409 const_iterator end() const
411 return const_iterator( tail());
413 const_iterator cend()
415 return const_iterator( tail());
420 /// Default constructor
422 Initializes empty list
436 /// Inserts new node with key and default value
438 The function creates a node with \p key and default value, and then inserts the node created into the list.
441 - The \ref key_type should be constructible from value of type \p K.
442 In trivial case, \p K is equal to \ref key_type.
443 - The \ref mapped_type should be default-constructible.
445 Returns \p true if inserting successful, \p false otherwise.
447 template <typename K>
448 bool insert( const K& key )
450 return insert_at( head(), key );
453 /// Inserts new node with a key and a value
455 The function creates a node with \p key and value \p val, and then inserts the node created into the list.
458 - The \ref key_type should be constructible from \p key of type \p K.
459 - The \ref mapped_type should be constructible from \p val of type \p V.
461 Returns \p true if inserting successful, \p false otherwise.
463 template <typename K, typename V>
464 bool insert( const K& key, const V& val )
466 // We cannot use insert with functor here
467 // because we cannot lock inserted node for updating
468 // Therefore, we use separate function
469 return insert_at( head(), key, val );
472 /// Inserts new node and initializes it by a functor
474 This function inserts new node with key \p key and if inserting is successful then it calls
475 \p func functor with signature
478 void operator()( value_type& item );
482 The argument \p item of user-defined functor \p func is the reference
483 to the list's item inserted. <tt>item.second</tt> is a reference to item's value that may be changed.
484 User-defined functor \p func should guarantee that during changing item's value no any other changes
485 could be made on this list's item by concurrent threads.
486 The user-defined functor can be passed by reference using <tt>boost::ref</tt>
487 and it is called only if inserting is successful.
489 The key_type should be constructible from value of type \p K.
491 The function allows to split creating of new item into two part:
492 - create item from \p key;
493 - insert new item into the list;
494 - if inserting is successful, initialize the value of item by calling \p func functor
496 This can be useful if complete initialization of object of \p mapped_type is heavyweight and
497 it is preferable that the initialization should be completed only if inserting is successful.
499 template <typename K, typename Func>
500 bool insert_key( const K& key, Func func )
502 return insert_key_at( head(), key, func );
505 /// Inserts data of type \ref mapped_type constructed with <tt>std::forward<Args>(args)...</tt>
507 Returns \p true if inserting successful, \p false otherwise.
509 template <typename... Args>
510 bool emplace( Args&&... args )
512 return emplace_at( head(), std::forward<Args>(args)... );
515 /// Ensures that the \p key exists in the list
517 The operation performs inserting or changing data with lock-free manner.
519 If the \p key not found in the list, then the new item created from \p key
520 is inserted into the list (note that in this case the \ref key_type should be
521 copy-constructible from type \p K).
522 Otherwise, the functor \p func is called with item found.
523 The functor \p Func may be a function with signature:
525 void func( bool bNew, value_type& item );
530 void operator()( bool bNew, value_type& item );
535 - \p bNew - \p true if the item has been inserted, \p false otherwise
536 - \p item - item of the list
538 The functor may change any fields of the \p item.second that is \ref mapped_type;
539 however, \p func must guarantee that during changing no any other modifications
540 could be made on this item by concurrent threads.
542 You may pass \p func argument by reference using <tt>boost::ref</tt>.
544 Returns <tt> std::pair<bool, bool> </tt> where \p first is true if operation is successfull,
545 \p second is true if new item has been added or \p false if the item with \p key
546 already is in the list.
548 template <typename K, typename Func>
549 std::pair<bool, bool> ensure( const K& key, Func f )
551 return ensure_at( head(), key, f );
554 /// Deletes \p key from the list
555 /** \anchor cds_nonintrusive_LazyKVList_hp_erase_val
557 Returns \p true if \p key is found and has been deleted, \p false otherwise
559 template <typename K>
560 bool erase( K const& key )
562 return erase_at( head(), key, intrusive_key_comparator() );
565 /// Deletes the item from the list using \p pred predicate for searching
567 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_erase_val "erase(K const&)"
568 but \p pred is used for key comparing.
569 \p Less functor has the interface like \p std::less.
570 \p pred must imply the same element order as the comparator used for building the list.
572 template <typename K, typename Less>
573 bool erase_with( K const& key, Less pred )
575 return erase_at( head(), key, typename options::template less_wrapper<Less>::type() );
578 /// Deletes \p key from the list
579 /** \anchor cds_nonintrusive_LazyKVList_hp_erase_func
580 The function searches an item with key \p key, calls \p f functor with item found
581 and deletes it. If \p key is not found, the functor is not called.
583 The functor \p Func interface:
586 void operator()(value_type& val) { ... }
589 The functor may be passed by reference with <tt>boost:ref</tt>
591 Returns \p true if key is found and deleted, \p false otherwise
593 template <typename K, typename Func>
594 bool erase( K const& key, Func f )
596 return erase_at( head(), key, intrusive_key_comparator(), f );
599 /// Deletes the item from the list using \p pred predicate for searching
601 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_erase_func "erase(K const&, Func)"
602 but \p pred is used for key comparing.
603 \p Less functor has the interface like \p std::less.
604 \p pred must imply the same element order as the comparator used for building the list.
606 template <typename K, typename Less, typename Func>
607 bool erase_with( K const& key, Less pred, Func f )
609 return erase_at( head(), key, typename options::template less_wrapper<Less>::type(), f );
612 /// Extracts the item from the list with specified \p key
613 /** \anchor cds_nonintrusive_LazyKVList_hp_extract
614 The function searches an item with key equal to \p key,
615 unlinks it from the list, and returns it in \p dest parameter.
616 If the item with key equal to \p key is not found the function returns \p false.
618 Note the compare functor should accept a parameter of type \p K that can be not the same as \p key_type.
620 @note Each \p guarded_ptr object uses the GC's guard that can be limited resource.
624 typedef cds::container::LazyKVList< cds::gc::HP, int, foo, my_traits > ord_list;
628 ord_list::guarded_ptr gp;
629 theList.extract( gp, 5 );
633 // Destructor of gp releases internal HP guard and frees the item
637 template <typename K>
638 bool extract( guarded_ptr& dest, K const& key )
640 return extract_at( head(), dest.guard(), key, intrusive_key_comparator() );
643 /// Extracts the item from the list with comparing functor \p pred
645 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_extract "extract(guarded_ptr&, K const&)"
646 but \p pred predicate is used for key comparing.
648 \p Less functor has the semantics like \p std::less but should take arguments of type \ref key_type and \p K
650 \p pred must imply the same element order as the comparator used for building the list.
652 template <typename K, typename Less>
653 bool extract_with( guarded_ptr& dest, K const& key, Less pred )
655 return extract_at( head(), dest.guard(), key, typename options::template less_wrapper<Less>::type() );
658 /// Finds the key \p key
659 /** \anchor cds_nonintrusive_LazyKVList_hp_find_val
660 The function searches the item with key equal to \p key
661 and returns \p true if it is found, and \p false otherwise
663 template <typename Q>
664 bool find( Q const& key )
666 return find_at( head(), key, intrusive_key_comparator() );
669 /// Finds the key \p val using \p pred predicate for searching
671 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_find_val "find(Q const&)"
672 but \p pred is used for key comparing.
673 \p Less functor has the interface like \p std::less.
674 \p pred must imply the same element order as the comparator used for building the list.
676 template <typename Q, typename Less>
677 bool find_with( Q const& key, Less pred )
679 return find_at( head(), key, typename options::template less_wrapper<Less>::type() );
682 /// Finds the key \p key and performs an action with it
683 /** \anchor cds_nonintrusive_LazyKVList_hp_find_func
684 The function searches an item with key equal to \p key and calls the functor \p f for the item found.
685 The interface of \p Func functor is:
688 void operator()( value_type& item );
691 where \p item is the item found.
693 You may pass \p f argument by reference using <tt>boost::ref</tt> or cds::ref.
695 The functor may change <tt>item.second</tt> that is reference to value of node.
696 Note that the function is only guarantee that \p item cannot be deleted during functor is executing.
697 The function does not serialize simultaneous access to the list \p item. If such access is
698 possible you must provide your own synchronization schema to exclude unsafe item modifications.
700 The function returns \p true if \p key is found, \p false otherwise.
702 template <typename Q, typename Func>
703 bool find( Q const& key, Func f )
705 return find_at( head(), key, intrusive_key_comparator(), f );
708 /// Finds the key \p val using \p pred predicate for searching
710 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_find_func "find(Q&, Func)"
711 but \p pred is used for key comparing.
712 \p Less functor has the interface like \p std::less.
713 \p pred must imply the same element order as the comparator used for building the list.
715 template <typename Q, typename Less, typename Func>
716 bool find_with( Q const& key, Less pred, Func f )
718 return find_at( head(), key, typename options::template less_wrapper<Less>::type(), f );
721 /// Finds \p key and return the item found
722 /** \anchor cds_nonintrusive_LazyKVList_hp_get
723 The function searches the item with key equal to \p key
724 and assigns the item found to guarded pointer \p ptr.
725 The function returns \p true if \p key is found, and \p false otherwise.
726 If \p key is not found the \p ptr parameter is not changed.
728 @note Each \p guarded_ptr object uses one GC's guard which can be limited resource.
732 typedef cds::container::LazyKVList< cds::gc::HP, int, foo, my_traits > ord_list;
736 ord_list::guarded_ptr gp;
737 if ( theList.get( gp, 5 )) {
741 // Destructor of guarded_ptr releases internal HP guard and frees the item
745 Note the compare functor specified for class \p Traits template parameter
746 should accept a parameter of type \p K that can be not the same as \p key_type.
748 template <typename K>
749 bool get( guarded_ptr& ptr, K const& key )
751 return get_at( head(), ptr.guard(), key, intrusive_key_comparator() );
754 /// Finds the key \p val and return the item found
756 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_get "get(guarded_ptr& ptr, K const&)"
757 but \p pred is used for comparing the keys.
759 \p Less functor has the semantics like \p std::less but should take arguments of type \ref key_type and \p K
761 \p pred must imply the same element order as the comparator used for building the list.
763 template <typename K, typename Less>
764 bool get_with( guarded_ptr& ptr, K const& key, Less pred )
766 return get_at( head(), ptr.guard(), key, typename options::template less_wrapper<Less>::type() );
769 /// Checks if the list is empty
772 return base_class::empty();
775 /// Returns list's item count
777 The value returned depends on opt::item_counter option. For atomicity::empty_item_counter,
778 this function always returns 0.
780 <b>Warning</b>: even if you use real item counter and it returns 0, this fact is not mean that the list
781 is empty. To check list emptyness use \ref empty() method.
785 return base_class::size();
790 Post-condition: the list is empty
799 bool insert_node_at( head_type& refHead, node_type * pNode )
801 assert( pNode != nullptr );
802 scoped_node_ptr p( pNode );
804 if ( base_class::insert_at( &refHead, *p )) {
812 template <typename K>
813 bool insert_at( head_type& refHead, const K& key )
815 return insert_node_at( refHead, alloc_node( key ));
818 template <typename K, typename V>
819 bool insert_at( head_type& refHead, const K& key, const V& val )
821 return insert_node_at( refHead, alloc_node( key, val ));
824 template <typename K, typename Func>
825 bool insert_key_at( head_type& refHead, const K& key, Func f )
827 scoped_node_ptr pNode( alloc_node( key ));
829 # ifdef CDS_CXX11_LAMBDA_SUPPORT
830 if ( base_class::insert_at( &refHead, *pNode, [&f](node_type& node){ cds::unref(f)( node.m_Data ); } ))
832 insert_functor<Func> wrapper( f );
833 if ( base_class::insert_at( &refHead, *pNode, cds::ref(wrapper) ))
842 template <typename... Args>
843 bool emplace_at( head_type& refHead, Args&&... args )
845 return insert_node_at( refHead, alloc_node( std::forward<Args>(args)... ));
848 template <typename K, typename Compare>
849 bool erase_at( head_type& refHead, K const& key, Compare cmp )
851 return base_class::erase_at( &refHead, key, cmp );
854 template <typename K, typename Compare, typename Func>
855 bool erase_at( head_type& refHead, K const& key, Compare cmp, Func f )
857 # ifdef CDS_CXX11_LAMBDA_SUPPORT
858 return base_class::erase_at( &refHead, key, cmp, [&f](node_type const & node){cds::unref(f)( const_cast<value_type&>(node.m_Data)); });
860 erase_functor<Func> wrapper( f );
861 return base_class::erase_at( &refHead, key, cmp, cds::ref(wrapper) );
865 template <typename K, typename Compare>
866 bool extract_at( head_type& refHead, typename gc::Guard& dest, K const& key, Compare cmp )
868 return base_class::extract_at( &refHead, dest, key, cmp );
871 template <typename K, typename Func>
872 std::pair<bool, bool> ensure_at( head_type& refHead, const K& key, Func f )
874 scoped_node_ptr pNode( alloc_node( key ));
876 # ifdef CDS_CXX11_LAMBDA_SUPPORT
877 std::pair<bool, bool> ret = base_class::ensure_at( &refHead, *pNode,
878 [&f]( bool bNew, node_type& node, node_type& ){ cds::unref(f)( bNew, node.m_Data ); });
880 ensure_functor<Func> wrapper( f );
881 std::pair<bool, bool> ret = base_class::ensure_at( &refHead, *pNode, cds::ref(wrapper));
883 if ( ret.first && ret.second )
889 template <typename K, typename Compare>
890 bool find_at( head_type& refHead, K const& key, Compare cmp )
892 return base_class::find_at( &refHead, key, cmp );
895 template <typename K, typename Compare, typename Func>
896 bool find_at( head_type& refHead, K& key, Compare cmp, Func f )
898 # ifdef CDS_CXX11_LAMBDA_SUPPORT
899 return base_class::find_at( &refHead, key, cmp, [&f]( node_type& node, K& ){ cds::unref(f)( node.m_Data ); });
901 find_functor<Func> wrapper( f );
902 return base_class::find_at( &refHead, key, cmp, cds::ref(wrapper) );
906 template <typename K, typename Compare>
907 bool get_at( head_type& refHead, typename gc::Guard& guard, K const& key, Compare cmp )
909 return base_class::get_at( &refHead, guard, key, cmp );
915 }} // namespace cds::container
917 #endif // #ifndef __CDS_CONTAINER_LAZY_KVLIST_IMPL_H