3 #ifndef __CDS_CONTAINER_LAZY_KVLIST_IMPL_H
4 #define __CDS_CONTAINER_LAZY_KVLIST_IMPL_H
7 #include <cds/details/functor_wrapper.h>
8 #include <cds/details/std/memory.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 #ifdef CDS_EMPLACE_SUPPORT
220 template <typename... Args>
221 static node_type * alloc_node( Args&&... args )
223 return cxx_allocator().MoveNew( std::forward<Args>(args)... );
227 static void free_node( node_type * pNode )
229 cxx_allocator().Delete( pNode );
232 struct node_disposer {
233 void operator()( node_type * pNode )
238 typedef std::unique_ptr< node_type, node_disposer > scoped_node_ptr;
242 return *base_class::head();
245 head_type const& head() const
247 return *base_class::head();
252 return *base_class::tail();
255 head_type const& tail() const
257 return *base_class::tail();
264 template <bool IsConst>
265 class iterator_type: protected base_class::template iterator_type<IsConst>
267 typedef typename base_class::template iterator_type<IsConst> iterator_base;
269 iterator_type( head_type const& pNode )
270 : iterator_base( const_cast<head_type *>(&pNode) )
272 iterator_type( head_type const * pNode )
273 : iterator_base( const_cast<head_type *>(pNode) )
276 friend class LazyKVList;
279 typedef typename cds::details::make_const_type<mapped_type, IsConst>::reference value_ref;
280 typedef typename cds::details::make_const_type<mapped_type, IsConst>::pointer value_ptr;
282 typedef typename cds::details::make_const_type<value_type, IsConst>::reference pair_ref;
283 typedef typename cds::details::make_const_type<value_type, IsConst>::pointer pair_ptr;
288 iterator_type( iterator_type const& src )
289 : iterator_base( src )
292 key_type const& key() const
294 typename iterator_base::value_ptr p = iterator_base::operator ->();
295 assert( p != nullptr );
296 return p->m_Data.first;
299 value_ref val() const
301 typename iterator_base::value_ptr p = iterator_base::operator ->();
302 assert( p != nullptr );
303 return p->m_Data.second;
306 pair_ptr operator ->() const
308 typename iterator_base::value_ptr p = iterator_base::operator ->();
309 return p ? &(p->m_Data) : nullptr;
312 pair_ref operator *() const
314 typename iterator_base::value_ref p = iterator_base::operator *();
319 iterator_type& operator ++()
321 iterator_base::operator ++();
326 bool operator ==(iterator_type<C> const& i ) const
328 return iterator_base::operator ==(i);
331 bool operator !=(iterator_type<C> const& i ) const
333 return iterator_base::operator !=(i);
341 The forward iterator for lazy list has some features:
342 - it has no post-increment operator
343 - to protect the value, the iterator contains a GC-specific guard + another guard is required locally for increment operator.
344 For some GC (gc::HP, gc::HRC), a guard is limited resource per thread, so an exception (or assertion) "no free guard"
345 may be thrown if a limit of guard count per thread is exceeded.
346 - The iterator cannot be moved across thread boundary since it contains GC's guard that is thread-private GC data.
347 - Iterator ensures thread-safety even if you delete the item that iterator points to. However, in case of concurrent
348 deleting operations it is no guarantee that you iterate all item in the list.
350 Therefore, the use of iterators in concurrent environment is not good idea. Use the iterator on the concurrent container
351 for debug purpose only.
353 The iterator interface to access item data:
354 - <tt> operator -> </tt> - returns a pointer to \ref value_type for iterator
355 - <tt> operator *</tt> - returns a reference (a const reference for \p const_iterator) to \ref value_type for iterator
356 - <tt> const key_type& key() </tt> - returns a key reference for iterator
357 - <tt> mapped_type& val() </tt> - retuns a value reference for iterator (const reference for \p const_iterator)
359 For both functions the iterator should not be equal to <tt> end() </tt>
361 typedef iterator_type<false> iterator;
363 /// Const forward iterator
365 For iterator's features and requirements see \ref iterator
367 typedef iterator_type<true> const_iterator;
369 /// Returns a forward iterator addressing the first element in a list
371 For empty list \code begin() == end() \endcode
375 iterator it( head() );
376 ++it ; // skip dummy head
380 /// Returns an iterator that addresses the location succeeding the last element in a list
382 Do not use the value returned by <tt>end</tt> function to access any item.
383 Internally, <tt>end</tt> returning value equals to <tt>NULL</tt>.
385 The returned value can be used only to control reaching the end of the list.
386 For empty list \code begin() == end() \endcode
390 return iterator( tail() );
393 /// Returns a forward const iterator addressing the first element in a list
395 const_iterator begin() const
397 const_iterator it( head() );
398 ++it; // skip dummy head
401 const_iterator cbegin()
403 const_iterator it( head() );
404 ++it; // skip dummy head
409 /// Returns an const iterator that addresses the location succeeding the last element in a list
411 const_iterator end() const
413 return const_iterator( tail());
415 const_iterator cend()
417 return const_iterator( tail());
422 /// Default constructor
424 Initializes empty list
438 /// Inserts new node with key and default value
440 The function creates a node with \p key and default value, and then inserts the node created into the list.
443 - The \ref key_type should be constructible from value of type \p K.
444 In trivial case, \p K is equal to \ref key_type.
445 - The \ref mapped_type should be default-constructible.
447 Returns \p true if inserting successful, \p false otherwise.
449 template <typename K>
450 bool insert( const K& key )
452 return insert_at( head(), key );
455 /// Inserts new node with a key and a value
457 The function creates a node with \p key and value \p val, and then inserts the node created into the list.
460 - The \ref key_type should be constructible from \p key of type \p K.
461 - The \ref mapped_type should be constructible from \p val of type \p V.
463 Returns \p true if inserting successful, \p false otherwise.
465 template <typename K, typename V>
466 bool insert( const K& key, const V& val )
468 // We cannot use insert with functor here
469 // because we cannot lock inserted node for updating
470 // Therefore, we use separate function
471 return insert_at( head(), key, val );
474 /// Inserts new node and initializes it by a functor
476 This function inserts new node with key \p key and if inserting is successful then it calls
477 \p func functor with signature
480 void operator()( value_type& item );
484 The argument \p item of user-defined functor \p func is the reference
485 to the list's item inserted. <tt>item.second</tt> is a reference to item's value that may be changed.
486 User-defined functor \p func should guarantee that during changing item's value no any other changes
487 could be made on this list's item by concurrent threads.
488 The user-defined functor can be passed by reference using <tt>boost::ref</tt>
489 and it is called only if inserting is successful.
491 The key_type should be constructible from value of type \p K.
493 The function allows to split creating of new item into two part:
494 - create item from \p key;
495 - insert new item into the list;
496 - if inserting is successful, initialize the value of item by calling \p func functor
498 This can be useful if complete initialization of object of \p mapped_type is heavyweight and
499 it is preferable that the initialization should be completed only if inserting is successful.
501 template <typename K, typename Func>
502 bool insert_key( const K& key, Func func )
504 return insert_key_at( head(), key, func );
507 # ifdef CDS_EMPLACE_SUPPORT
508 /// Inserts data of type \ref mapped_type constructed with <tt>std::forward<Args>(args)...</tt>
510 Returns \p true if inserting successful, \p false otherwise.
512 @note This function is available only for compiler that supports
513 variadic template and move semantics
515 template <typename... Args>
516 bool emplace( Args&&... args )
518 return emplace_at( head(), std::forward<Args>(args)... );
522 /// Ensures that the \p key exists in the list
524 The operation performs inserting or changing data with lock-free manner.
526 If the \p key not found in the list, then the new item created from \p key
527 is inserted into the list (note that in this case the \ref key_type should be
528 copy-constructible from type \p K).
529 Otherwise, the functor \p func is called with item found.
530 The functor \p Func may be a function with signature:
532 void func( bool bNew, value_type& item );
537 void operator()( bool bNew, value_type& item );
542 - \p bNew - \p true if the item has been inserted, \p false otherwise
543 - \p item - item of the list
545 The functor may change any fields of the \p item.second that is \ref mapped_type;
546 however, \p func must guarantee that during changing no any other modifications
547 could be made on this item by concurrent threads.
549 You may pass \p func argument by reference using <tt>boost::ref</tt>.
551 Returns <tt> std::pair<bool, bool> </tt> where \p first is true if operation is successfull,
552 \p second is true if new item has been added or \p false if the item with \p key
553 already is in the list.
555 template <typename K, typename Func>
556 std::pair<bool, bool> ensure( const K& key, Func f )
558 return ensure_at( head(), key, f );
561 /// Deletes \p key from the list
562 /** \anchor cds_nonintrusive_LazyKVList_hp_erase_val
564 Returns \p true if \p key is found and has been deleted, \p false otherwise
566 template <typename K>
567 bool erase( K const& key )
569 return erase_at( head(), key, intrusive_key_comparator() );
572 /// Deletes the item from the list using \p pred predicate for searching
574 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_erase_val "erase(K const&)"
575 but \p pred is used for key comparing.
576 \p Less functor has the interface like \p std::less.
577 \p pred must imply the same element order as the comparator used for building the list.
579 template <typename K, typename Less>
580 bool erase_with( K const& key, Less pred )
582 return erase_at( head(), key, typename options::template less_wrapper<Less>::type() );
585 /// Deletes \p key from the list
586 /** \anchor cds_nonintrusive_LazyKVList_hp_erase_func
587 The function searches an item with key \p key, calls \p f functor with item found
588 and deletes it. If \p key is not found, the functor is not called.
590 The functor \p Func interface:
593 void operator()(value_type& val) { ... }
596 The functor may be passed by reference with <tt>boost:ref</tt>
598 Returns \p true if key is found and deleted, \p false otherwise
600 template <typename K, typename Func>
601 bool erase( K const& key, Func f )
603 return erase_at( head(), key, intrusive_key_comparator(), f );
606 /// Deletes the item from the list using \p pred predicate for searching
608 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_erase_func "erase(K const&, Func)"
609 but \p pred is used for key comparing.
610 \p Less functor has the interface like \p std::less.
611 \p pred must imply the same element order as the comparator used for building the list.
613 template <typename K, typename Less, typename Func>
614 bool erase_with( K const& key, Less pred, Func f )
616 return erase_at( head(), key, typename options::template less_wrapper<Less>::type(), f );
619 /// Extracts the item from the list with specified \p key
620 /** \anchor cds_nonintrusive_LazyKVList_hp_extract
621 The function searches an item with key equal to \p key,
622 unlinks it from the list, and returns it in \p dest parameter.
623 If the item with key equal to \p key is not found the function returns \p false.
625 Note the compare functor should accept a parameter of type \p K that can be not the same as \p key_type.
627 @note Each \p guarded_ptr object uses the GC's guard that can be limited resource.
631 typedef cds::container::LazyKVList< cds::gc::HP, int, foo, my_traits > ord_list;
635 ord_list::guarded_ptr gp;
636 theList.extract( gp, 5 );
640 // Destructor of gp releases internal HP guard and frees the item
644 template <typename K>
645 bool extract( guarded_ptr& dest, K const& key )
647 return extract_at( head(), dest.guard(), key, intrusive_key_comparator() );
650 /// Extracts the item from the list with comparing functor \p pred
652 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_extract "extract(guarded_ptr&, K const&)"
653 but \p pred predicate is used for key comparing.
655 \p Less functor has the semantics like \p std::less but should take arguments of type \ref key_type and \p K
657 \p pred must imply the same element order as the comparator used for building the list.
659 template <typename K, typename Less>
660 bool extract_with( guarded_ptr& dest, K const& key, Less pred )
662 return extract_at( head(), dest.guard(), key, typename options::template less_wrapper<Less>::type() );
665 /// Finds the key \p key
666 /** \anchor cds_nonintrusive_LazyKVList_hp_find_val
667 The function searches the item with key equal to \p key
668 and returns \p true if it is found, and \p false otherwise
670 template <typename Q>
671 bool find( Q const& key )
673 return find_at( head(), key, intrusive_key_comparator() );
676 /// Finds the key \p val using \p pred predicate for searching
678 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_find_val "find(Q const&)"
679 but \p pred is used for key comparing.
680 \p Less functor has the interface like \p std::less.
681 \p pred must imply the same element order as the comparator used for building the list.
683 template <typename Q, typename Less>
684 bool find_with( Q const& key, Less pred )
686 return find_at( head(), key, typename options::template less_wrapper<Less>::type() );
689 /// Finds the key \p key and performs an action with it
690 /** \anchor cds_nonintrusive_LazyKVList_hp_find_func
691 The function searches an item with key equal to \p key and calls the functor \p f for the item found.
692 The interface of \p Func functor is:
695 void operator()( value_type& item );
698 where \p item is the item found.
700 You may pass \p f argument by reference using <tt>boost::ref</tt> or cds::ref.
702 The functor may change <tt>item.second</tt> that is reference to value of node.
703 Note that the function is only guarantee that \p item cannot be deleted during functor is executing.
704 The function does not serialize simultaneous access to the list \p item. If such access is
705 possible you must provide your own synchronization schema to exclude unsafe item modifications.
707 The function returns \p true if \p key is found, \p false otherwise.
709 template <typename Q, typename Func>
710 bool find( Q const& key, Func f )
712 return find_at( head(), key, intrusive_key_comparator(), f );
715 /// Finds the key \p val using \p pred predicate for searching
717 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_find_func "find(Q&, Func)"
718 but \p pred is used for key comparing.
719 \p Less functor has the interface like \p std::less.
720 \p pred must imply the same element order as the comparator used for building the list.
722 template <typename Q, typename Less, typename Func>
723 bool find_with( Q const& key, Less pred, Func f )
725 return find_at( head(), key, typename options::template less_wrapper<Less>::type(), f );
728 /// Finds \p key and return the item found
729 /** \anchor cds_nonintrusive_LazyKVList_hp_get
730 The function searches the item with key equal to \p key
731 and assigns the item found to guarded pointer \p ptr.
732 The function returns \p true if \p key is found, and \p false otherwise.
733 If \p key is not found the \p ptr parameter is not changed.
735 @note Each \p guarded_ptr object uses one GC's guard which can be limited resource.
739 typedef cds::container::LazyKVList< cds::gc::HP, int, foo, my_traits > ord_list;
743 ord_list::guarded_ptr gp;
744 if ( theList.get( gp, 5 )) {
748 // Destructor of guarded_ptr releases internal HP guard and frees the item
752 Note the compare functor specified for class \p Traits template parameter
753 should accept a parameter of type \p K that can be not the same as \p key_type.
755 template <typename K>
756 bool get( guarded_ptr& ptr, K const& key )
758 return get_at( head(), ptr.guard(), key, intrusive_key_comparator() );
761 /// Finds the key \p val and return the item found
763 The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_get "get(guarded_ptr& ptr, K const&)"
764 but \p pred is used for comparing the keys.
766 \p Less functor has the semantics like \p std::less but should take arguments of type \ref key_type and \p K
768 \p pred must imply the same element order as the comparator used for building the list.
770 template <typename K, typename Less>
771 bool get_with( guarded_ptr& ptr, K const& key, Less pred )
773 return get_at( head(), ptr.guard(), key, typename options::template less_wrapper<Less>::type() );
776 /// Checks if the list is empty
779 return base_class::empty();
782 /// Returns list's item count
784 The value returned depends on opt::item_counter option. For atomicity::empty_item_counter,
785 this function always returns 0.
787 <b>Warning</b>: even if you use real item counter and it returns 0, this fact is not mean that the list
788 is empty. To check list emptyness use \ref empty() method.
792 return base_class::size();
797 Post-condition: the list is empty
806 bool insert_node_at( head_type& refHead, node_type * pNode )
808 assert( pNode != nullptr );
809 scoped_node_ptr p( pNode );
811 if ( base_class::insert_at( &refHead, *p )) {
819 template <typename K>
820 bool insert_at( head_type& refHead, const K& key )
822 return insert_node_at( refHead, alloc_node( key ));
825 template <typename K, typename V>
826 bool insert_at( head_type& refHead, const K& key, const V& val )
828 return insert_node_at( refHead, alloc_node( key, val ));
831 template <typename K, typename Func>
832 bool insert_key_at( head_type& refHead, const K& key, Func f )
834 scoped_node_ptr pNode( alloc_node( key ));
836 # ifdef CDS_CXX11_LAMBDA_SUPPORT
837 if ( base_class::insert_at( &refHead, *pNode, [&f](node_type& node){ cds::unref(f)( node.m_Data ); } ))
839 insert_functor<Func> wrapper( f );
840 if ( base_class::insert_at( &refHead, *pNode, cds::ref(wrapper) ))
849 # ifdef CDS_EMPLACE_SUPPORT
850 template <typename... Args>
851 bool emplace_at( head_type& refHead, Args&&... args )
853 return insert_node_at( refHead, alloc_node( std::forward<Args>(args)... ));
857 template <typename K, typename Compare>
858 bool erase_at( head_type& refHead, K const& key, Compare cmp )
860 return base_class::erase_at( &refHead, key, cmp );
863 template <typename K, typename Compare, typename Func>
864 bool erase_at( head_type& refHead, K const& key, Compare cmp, Func f )
866 # ifdef CDS_CXX11_LAMBDA_SUPPORT
867 return base_class::erase_at( &refHead, key, cmp, [&f](node_type const & node){cds::unref(f)( const_cast<value_type&>(node.m_Data)); });
869 erase_functor<Func> wrapper( f );
870 return base_class::erase_at( &refHead, key, cmp, cds::ref(wrapper) );
874 template <typename K, typename Compare>
875 bool extract_at( head_type& refHead, typename gc::Guard& dest, K const& key, Compare cmp )
877 return base_class::extract_at( &refHead, dest, key, cmp );
880 template <typename K, typename Func>
881 std::pair<bool, bool> ensure_at( head_type& refHead, const K& key, Func f )
883 scoped_node_ptr pNode( alloc_node( key ));
885 # ifdef CDS_CXX11_LAMBDA_SUPPORT
886 std::pair<bool, bool> ret = base_class::ensure_at( &refHead, *pNode,
887 [&f]( bool bNew, node_type& node, node_type& ){ cds::unref(f)( bNew, node.m_Data ); });
889 ensure_functor<Func> wrapper( f );
890 std::pair<bool, bool> ret = base_class::ensure_at( &refHead, *pNode, cds::ref(wrapper));
892 if ( ret.first && ret.second )
898 template <typename K, typename Compare>
899 bool find_at( head_type& refHead, K const& key, Compare cmp )
901 return base_class::find_at( &refHead, key, cmp );
904 template <typename K, typename Compare, typename Func>
905 bool find_at( head_type& refHead, K& key, Compare cmp, Func f )
907 # ifdef CDS_CXX11_LAMBDA_SUPPORT
908 return base_class::find_at( &refHead, key, cmp, [&f]( node_type& node, K& ){ cds::unref(f)( node.m_Data ); });
910 find_functor<Func> wrapper( f );
911 return base_class::find_at( &refHead, key, cmp, cds::ref(wrapper) );
915 template <typename K, typename Compare>
916 bool get_at( head_type& refHead, typename gc::Guard& guard, K const& key, Compare cmp )
918 return base_class::get_at( &refHead, guard, key, cmp );
924 }} // namespace cds::container
926 #endif // #ifndef __CDS_CONTAINER_LAZY_KVLIST_IMPL_H