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 node_type * alloc_node()
101 return cxx_allocator().New();
104 static node_type * alloc_node( value_type const& v )
106 return cxx_allocator().New( v );
109 template <typename... Args>
110 static node_type * alloc_node( Args&&... args )
112 return cxx_allocator().MoveNew( std::forward<Args>(args)... );
115 static void free_node( node_type * pNode )
117 cxx_allocator().Delete( pNode );
120 struct node_disposer {
121 void operator()( node_type * pNode )
126 typedef std::unique_ptr< node_type, node_disposer > scoped_node_ptr;
130 return base_class::m_Head;
133 head_type const& head() const
135 return base_class::m_Head;
140 return base_class::m_Tail;
143 head_type const& tail() const
145 return base_class::m_Tail;
151 template <bool IsConst>
152 class iterator_type: protected base_class::template iterator_type<IsConst>
154 typedef typename base_class::template iterator_type<IsConst> iterator_base;
156 iterator_type( head_type const& pNode )
157 : iterator_base( const_cast<head_type *>(&pNode) )
160 explicit iterator_type( const iterator_base& it )
161 : iterator_base( it )
164 friend class LazyList;
167 explicit iterator_type( node_type& pNode )
168 : iterator_base( &pNode )
172 typedef typename cds::details::make_const_type<value_type, IsConst>::pointer value_ptr;
173 typedef typename cds::details::make_const_type<value_type, IsConst>::reference value_ref;
178 iterator_type( const iterator_type& src )
179 : iterator_base( src )
182 value_ptr operator ->() const
184 typename iterator_base::value_ptr p = iterator_base::operator ->();
185 return p ? &(p->m_Value) : nullptr;
188 value_ref operator *() const
190 return (iterator_base::operator *()).m_Value;
194 iterator_type& operator ++()
196 iterator_base::operator ++();
201 iterator_type operator ++(int)
203 return iterator_base::operator ++(0);
207 bool operator ==(iterator_type<C> const& i ) const
209 return iterator_base::operator ==(i);
212 bool operator !=(iterator_type<C> const& i ) const
214 return iterator_base::operator !=(i);
220 /// Returns a forward iterator addressing the first element in a list
222 For empty list \code begin() == end() \endcode
224 typedef iterator_type<false> iterator;
226 /// Const forward iterator
228 For iterator's features and requirements see \ref iterator
230 typedef iterator_type<true> const_iterator;
232 /// Returns a forward iterator addressing the first element in a list
234 For empty list \code begin() == end() \endcode
238 iterator it( head() );
239 ++it ; // skip dummy head node
243 /// Returns an iterator that addresses the location succeeding the last element in a list
245 Do not use the value returned by <tt>end</tt> function to access any item.
247 The returned value can be used only to control reaching the end of the list.
248 For empty list \code begin() == end() \endcode
252 return iterator( tail());
255 /// Returns a forward const iterator addressing the first element in a list
257 const_iterator begin() const
259 const_iterator it( head() );
260 ++it ; // skip dummy head node
263 const_iterator cbegin() const
265 const_iterator it( head() );
266 ++it ; // skip dummy head node
271 /// Returns an const iterator that addresses the location succeeding the last element in a list
273 const_iterator end() const
275 return const_iterator( tail());
277 const_iterator cend() const
279 return const_iterator( tail());
285 iterator node_to_iterator( node_type * pNode )
288 return iterator( *pNode );
294 /// Default constructor
298 /// Desctructor clears the list
306 The function inserts \p val in the list if the list does not contain
307 an item with key equal to \p val.
309 Return an iterator pointing to inserted item if success \ref end() otherwise
311 template <typename Q>
312 iterator insert( Q const& val )
314 return node_to_iterator( insert_at( head(), val ) );
317 /// Inserts data of type \p value_type created from \p args
319 Return an iterator pointing to inserted item if success \ref end() otherwise
321 template <typename... Args>
322 iterator emplace( Args&&... args )
324 return node_to_iterator( emplace_at( head(), std::forward<Args>(args)... ));
329 If \p key is not in the list and \p bAllowInsert is \p true,
331 the function inserts a new item.
332 Otherwise, the function returns an iterator pointing to the item found.
334 Returns <tt> std::pair<iterator, bool> </tt> where \p first is an iterator pointing to
335 item found or inserted, \p second is true if new item has been added or \p false if the item
336 already is in the list.
338 template <typename Q>
339 std::pair<iterator, bool> update( Q const& val, bool bAllowInsert = true )
341 std::pair< node_type *, bool > ret = update_at( head(), val, bAllowInsert );
342 return std::make_pair( node_to_iterator( ret.first ), ret.second );
345 template <typename Q>
346 CDS_DEPRECATED("ensure() is deprecated, use update()")
347 std::pair<iterator, bool> ensure( Q const& val )
349 return update( val, true );
353 /// Checks whether the list contains \p key
355 The function searches the item with key equal to \p key
356 and returns an iterator pointed to item found if the key is found,
357 and \ref end() otherwise
359 template <typename Q>
360 iterator contains( Q const& key )
362 return node_to_iterator( find_at( head(), key, intrusive_key_comparator() ));
365 template <typename Q>
366 CDS_DEPRECATED("deprecated, use contains()")
367 iterator find( Q const& key )
369 return contains( key );
373 /// Checks whether the map contains \p key using \p pred predicate for searching (ordered list version)
375 The function is an analog of <tt>contains( key )</tt> but \p pred is used for key comparing.
376 \p Less functor has the interface like \p std::less.
377 \p Less must imply the same element order as the comparator used for building the list.
379 template <typename Q, typename Less, bool Sort = c_bSort>
380 typename std::enable_if<Sort, iterator>::type contains( Q const& key, Less pred )
383 return node_to_iterator( find_at( head(), key, typename maker::template less_wrapper<Less>::type() ));
386 template <typename Q, typename Less, bool Sort = c_bSort>
387 CDS_DEPRECATED("deprecated, use contains()")
388 typename std::enable_if<Sort, iterator>::type find_with( Q const& key, Less pred )
390 return contains( key, pred );
394 /// Finds the key \p val using \p equal predicate for searching (unordered list version)
396 The function is an analog of <tt>contains( key )</tt> but \p equal is used for key comparing.
397 \p Equal functor has the interface like \p std::equal_to.
399 template <typename Q, typename Equal, bool Sort = c_bSort>
400 typename std::enable_if<!Sort, iterator>::type contains( Q const& key, Equal equal )
403 return node_to_iterator( find_at( head(), key, typename maker::template equal_to_wrapper<Equal>::type() ));
406 template <typename Q, typename Equal, bool Sort = c_bSort>
407 CDS_DEPRECATED("deprecated, use contains()")
408 typename std::enable_if<!Sort, iterator>::type find_with( Q const& key, Equal equal )
410 return contains( key, equal );
414 /// Check if the list is empty
417 return base_class::empty();
420 /// Returns list's item count
422 The value returned depends on \p Traits::item_counter type. For \p atomicity::empty_item_counter,
423 this function always returns 0.
425 @note Even if you use real item counter and it returns 0, this fact is not mean that the list
426 is empty. To check list emptyness use \ref empty() method.
430 return base_class::size();
441 node_type * insert_node_at( head_type& refHead, node_type * pNode )
443 assert( pNode != nullptr );
444 scoped_node_ptr p( pNode );
445 if ( base_class::insert_at( &refHead, *p ))
451 template <typename Q>
452 node_type * insert_at( head_type& refHead, Q const& val )
454 return insert_node_at( refHead, alloc_node( val ));
457 template <typename... Args>
458 node_type * emplace_at( head_type& refHead, Args&&... args )
460 return insert_node_at( refHead, alloc_node( std::forward<Args>(args)... ));
463 template <typename Q>
464 std::pair< node_type *, bool > update_at( head_type& refHead, Q const& val, bool bAllowInsert )
466 scoped_node_ptr pNode( alloc_node( val ));
467 node_type * pItemFound = nullptr;
469 std::pair<bool, bool> ret = base_class::update_at( &refHead, *pNode,
470 [&pItemFound](bool, node_type& item, node_type&){ pItemFound = &item; },
476 return std::make_pair( pItemFound, ret.second );
479 template <typename Q, typename Compare>
480 node_type * find_at( head_type& refHead, Q const& key, Compare cmp )
482 return base_class::find_at( &refHead, key, cmp );
487 }} // namespace cds::container
489 #endif // #ifndef CDSLIB_CONTAINER_LAZY_LIST_NOGC_H