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_LAZY_LIST_NOGC_H
32 #define CDSLIB_CONTAINER_LAZY_LIST_NOGC_H
35 #include <cds/container/details/lazy_list_base.h>
36 #include <cds/intrusive/lazy_list_nogc.h>
37 #include <cds/container/details/make_lazy_list.h>
39 namespace cds { namespace container {
41 /// Lazy ordered single-linked list (template specialization for gc::nogc)
42 /** @ingroup cds_nonintrusive_list
43 \anchor cds_nonintrusive_LazyList_nogc
45 This specialization is so-called append-only when no item
46 reclamation may be performed. The class does not support deleting of list item.
48 The list can be ordered if \p Traits::sort is \p true that is default
49 or unordered otherwise. Unordered list can be maintained by \p equal_to
50 relationship (\p Traits::equal_to), but for the ordered list \p less
51 or \p compare relations should be specified in \p Traits.
53 See @ref cds_nonintrusive_LazyList_gc "cds::container::LazyList<cds::gc::nogc, T, Traits>"
57 #ifdef CDS_DOXYGEN_INVOKED
58 typename Traits = lazy_list::traits
63 class LazyList<cds::gc::nogc, T, Traits>:
64 #ifdef CDS_DOXYGEN_INVOKED
65 protected intrusive::LazyList< gc::nogc, T, Traits >
67 protected details::make_lazy_list< cds::gc::nogc, T, Traits >::type
71 typedef details::make_lazy_list< cds::gc::nogc, T, Traits > maker;
72 typedef typename maker::type base_class;
76 typedef cds::gc::nogc gc; ///< Garbage collector
77 typedef T value_type; ///< Type of value stored in the list
78 typedef Traits traits; ///< List traits
80 typedef typename base_class::back_off back_off; ///< Back-off strategy used
81 typedef typename maker::allocator_type allocator_type; ///< Allocator type used for allocate/deallocate the nodes
82 typedef typename base_class::item_counter item_counter; ///< Item counting policy used
83 typedef typename maker::key_comparator key_comparator; ///< key comparing functor
84 typedef typename base_class::memory_model memory_model; ///< Memory ordering. See cds::opt::memory_model option
85 static CDS_CONSTEXPR bool const c_bSort = base_class::c_bSort; ///< List type: ordered (\p true) or unordered (\p false)
89 typedef typename base_class::value_type node_type;
90 typedef typename maker::cxx_allocator cxx_allocator;
91 typedef typename maker::node_deallocator node_deallocator;
92 typedef typename base_class::key_comparator intrusive_key_comparator;
94 typedef typename base_class::node_type head_type;
99 static value_type& node_to_value( node_type& n )
104 static node_type * alloc_node()
106 return cxx_allocator().New();
109 static node_type * alloc_node( value_type const& v )
111 return cxx_allocator().New( v );
114 template <typename... Args>
115 static node_type * alloc_node( Args&&... args )
117 return cxx_allocator().MoveNew( std::forward<Args>(args)... );
120 static void free_node( node_type * pNode )
122 cxx_allocator().Delete( pNode );
125 struct node_disposer {
126 void operator()( node_type * pNode )
131 typedef std::unique_ptr< node_type, node_disposer > scoped_node_ptr;
135 return base_class::m_Head;
138 head_type const& head() const
140 return base_class::m_Head;
145 return base_class::m_Tail;
148 head_type const& tail() const
150 return base_class::m_Tail;
156 template <bool IsConst>
157 class iterator_type: protected base_class::template iterator_type<IsConst>
159 typedef typename base_class::template iterator_type<IsConst> iterator_base;
161 iterator_type( head_type const& pNode )
162 : iterator_base( const_cast<head_type *>(&pNode) )
165 explicit iterator_type( const iterator_base& it )
166 : iterator_base( it )
169 friend class LazyList;
172 explicit iterator_type( node_type& pNode )
173 : iterator_base( &pNode )
177 typedef typename cds::details::make_const_type<value_type, IsConst>::pointer value_ptr;
178 typedef typename cds::details::make_const_type<value_type, IsConst>::reference value_ref;
183 iterator_type( const iterator_type& src )
184 : iterator_base( src )
187 value_ptr operator ->() const
189 typename iterator_base::value_ptr p = iterator_base::operator ->();
190 return p ? &(p->m_Value) : nullptr;
193 value_ref operator *() const
195 return (iterator_base::operator *()).m_Value;
199 iterator_type& operator ++()
201 iterator_base::operator ++();
206 iterator_type operator ++(int)
208 return iterator_base::operator ++(0);
212 bool operator ==(iterator_type<C> const& i ) const
214 return iterator_base::operator ==(i);
217 bool operator !=(iterator_type<C> const& i ) const
219 return iterator_base::operator !=(i);
225 ///@name Forward iterators
227 /// Returns a forward iterator addressing the first element in a list
229 For empty list \code begin() == end() \endcode
231 typedef iterator_type<false> iterator;
233 /// Const forward iterator
235 For iterator's features and requirements see \ref iterator
237 typedef iterator_type<true> const_iterator;
239 /// Returns a forward iterator addressing the first element in a list
241 For empty list \code begin() == end() \endcode
245 iterator it( head() );
246 ++it ; // skip dummy head node
250 /// Returns an iterator that addresses the location succeeding the last element in a list
252 Do not use the value returned by <tt>end</tt> function to access any item.
254 The returned value can be used only to control reaching the end of the list.
255 For empty list \code begin() == end() \endcode
259 return iterator( tail());
262 /// Returns a forward const iterator addressing the first element in a list
263 const_iterator begin() const
265 const_iterator it( head() );
266 ++it ; // skip dummy head node
270 /// Returns a forward const iterator addressing the first element in a list
271 const_iterator cbegin() const
273 const_iterator it( head() );
274 ++it ; // skip dummy head node
278 /// Returns an const iterator that addresses the location succeeding the last element in a list
279 const_iterator end() const
281 return const_iterator( tail());
284 /// Returns an const iterator that addresses the location succeeding the last element in a list
285 const_iterator cend() const
287 return const_iterator( tail());
293 iterator node_to_iterator( node_type * pNode )
296 return iterator( *pNode );
302 /// Default constructor
306 /// Desctructor clears the list
314 The function inserts \p val in the list if the list does not contain
315 an item with key equal to \p val.
317 Return an iterator pointing to inserted item if success \ref end() otherwise
319 template <typename Q>
320 iterator insert( Q const& val )
322 return node_to_iterator( insert_at( head(), val ) );
325 /// Inserts data of type \p value_type created from \p args
327 Return an iterator pointing to inserted item if success \ref end() otherwise
329 template <typename... Args>
330 iterator emplace( Args&&... args )
332 return node_to_iterator( emplace_at( head(), std::forward<Args>(args)... ));
337 If \p key is not in the list and \p bAllowInsert is \p true,
339 the function inserts a new item.
340 Otherwise, the function returns an iterator pointing to the item found.
342 Returns <tt> std::pair<iterator, bool> </tt> where \p first is an iterator pointing to
343 item found or inserted, \p second is true if new item has been added or \p false if the item
344 already is in the list.
346 template <typename Q>
347 std::pair<iterator, bool> update( Q const& val, bool bAllowInsert = true )
349 std::pair< node_type *, bool > ret = update_at( head(), val, bAllowInsert );
350 return std::make_pair( node_to_iterator( ret.first ), ret.second );
353 template <typename Q>
354 CDS_DEPRECATED("ensure() is deprecated, use update()")
355 std::pair<iterator, bool> ensure( Q const& val )
357 return update( val, true );
361 /// Checks whether the list contains \p key
363 The function searches the item with key equal to \p key
364 and returns an iterator pointed to item found if the key is found,
365 and \ref end() otherwise
367 template <typename Q>
368 iterator contains( Q const& key )
370 return node_to_iterator( find_at( head(), key, intrusive_key_comparator() ));
373 template <typename Q>
374 CDS_DEPRECATED("deprecated, use contains()")
375 iterator find( Q const& key )
377 return contains( key );
381 /// Checks whether the map contains \p key using \p pred predicate for searching (ordered list version)
383 The function is an analog of <tt>contains( key )</tt> but \p pred is used for key comparing.
384 \p Less functor has the interface like \p std::less.
385 \p Less must imply the same element order as the comparator used for building the list.
387 template <typename Q, typename Less, bool Sort = c_bSort>
388 typename std::enable_if<Sort, iterator>::type contains( Q const& key, Less pred )
391 return node_to_iterator( find_at( head(), key, typename maker::template less_wrapper<Less>::type() ));
394 template <typename Q, typename Less, bool Sort = c_bSort>
395 CDS_DEPRECATED("deprecated, use contains()")
396 typename std::enable_if<Sort, iterator>::type find_with( Q const& key, Less pred )
398 return contains( key, pred );
402 /// Finds the key \p val using \p equal predicate for searching (unordered list version)
404 The function is an analog of <tt>contains( key )</tt> but \p equal is used for key comparing.
405 \p Equal functor has the interface like \p std::equal_to.
407 template <typename Q, typename Equal, bool Sort = c_bSort>
408 typename std::enable_if<!Sort, iterator>::type contains( Q const& key, Equal equal )
411 return node_to_iterator( find_at( head(), key, typename maker::template equal_to_wrapper<Equal>::type() ));
414 template <typename Q, typename Equal, bool Sort = c_bSort>
415 CDS_DEPRECATED("deprecated, use contains()")
416 typename std::enable_if<!Sort, iterator>::type find_with( Q const& key, Equal equal )
418 return contains( key, equal );
422 /// Check if the list is empty
425 return base_class::empty();
428 /// Returns list's item count
430 The value returned depends on \p Traits::item_counter type. For \p atomicity::empty_item_counter,
431 this function always returns 0.
433 @note Even if you use real item counter and it returns 0, this fact is not mean that the list
434 is empty. To check list emptyness use \ref empty() method.
438 return base_class::size();
449 iterator insert_node( node_type * pNode )
451 return node_to_iterator( insert_node_at( head(), pNode ));
454 node_type * insert_node_at( head_type& refHead, node_type * pNode )
456 assert( pNode != nullptr );
457 scoped_node_ptr p( pNode );
458 if ( base_class::insert_at( &refHead, *p ))
464 template <typename Q>
465 node_type * insert_at( head_type& refHead, Q const& val )
467 return insert_node_at( refHead, alloc_node( val ));
470 template <typename... Args>
471 node_type * emplace_at( head_type& refHead, Args&&... args )
473 return insert_node_at( refHead, alloc_node( std::forward<Args>(args)... ));
476 template <typename Q>
477 std::pair< node_type *, bool > update_at( head_type& refHead, Q const& val, bool bAllowInsert )
479 scoped_node_ptr pNode( alloc_node( val ));
480 node_type * pItemFound = nullptr;
482 std::pair<bool, bool> ret = base_class::update_at( &refHead, *pNode,
483 [&pItemFound](bool, node_type& item, node_type&){ pItemFound = &item; },
489 return std::make_pair( pItemFound, ret.second );
492 template <typename Q, typename Compare>
493 node_type * find_at( head_type& refHead, Q const& key, Compare cmp )
495 return base_class::find_at( &refHead, key, cmp );
500 }} // namespace cds::container
502 #endif // #ifndef CDSLIB_CONTAINER_LAZY_LIST_NOGC_H