Lazy ordered single-linked list (template specialization for gc::nogc) More...
#include <cds/container/lazy_list_nogc.h>
Public Types | |
| typedef T | value_type |
| Type of value stored in the list. | |
| typedef base_class::gc | gc |
| Garbage collector used. | |
| typedef base_class::back_off | back_off |
| Back-off strategy used. | |
| typedef options::allocator_type | allocator_type |
| Allocator type used for allocate/deallocate the nodes. | |
| typedef base_class::item_counter | item_counter |
| Item counting policy used. | |
| typedef options::key_comparator | key_comparator |
| key comparision functor | |
| typedef base_class::memory_model | memory_model |
| Memory ordering. See cds::opt::memory_model option. | |
| typedef iterator_type< false > | iterator |
| Returns a forward iterator addressing the first element in a list. | |
| typedef iterator_type< true > | const_iterator |
| Const forward iterator. | |
Public Member Functions | |
| iterator | begin () |
| Returns a forward iterator addressing the first element in a list. | |
| iterator | end () |
| Returns an iterator that addresses the location succeeding the last element in a list. | |
| const_iterator | begin () const |
| Returns a forward const iterator addressing the first element in a list. | |
| const_iterator | end () const |
| Returns an const iterator that addresses the location succeeding the last element in a list. | |
| LazyList () | |
| Default constructor. | |
| ~LazyList () | |
| List desctructor. | |
| template<typename Q > | |
| iterator | insert (const Q &val) |
| Inserts new node. | |
| template<typename... Args> | |
| iterator | emplace (Args &&...args) |
Inserts data of type value_type constructed with std::forward<Args>(args)... | |
| template<typename Q > | |
| std::pair< iterator, bool > | ensure (const Q &val) |
Ensures that the item val exists in the list. | |
| template<typename Q > | |
| iterator | find (const Q &key) |
Find the key val. | |
| bool | empty () const |
| Check if the list is empty. | |
| size_t | size () const |
| Returns list's item count. | |
| void | clear () |
| Clears the list. | |
Additional Inherited Members | |
 Protected Types inherited from cds::intrusive::LazyList< gc::nogc, T, Traits > | |
| typedef T | value_type |
| type of value stored in the list | |
| typedef Traits | options |
| Traits template parameter. | |
| typedef options::hook | hook |
| hook type | |
| typedef hook::node_type | node_type |
| node type | |
| typedef implementation_defined | key_comparator |
| key comparision functor based on opt::compare and opt::less option setter. | |
| typedef options::disposer | disposer |
| disposer used | |
|
typedef get_node_traits < value_type, node_type, hook > ::type | node_traits |
| node traits | |
|
typedef lazy_list::get_link_checker < node_type, options::link_checker >::type | link_checker |
| link checker | |
| typedef gc::nogc | gc |
| Garbage collector. | |
| typedef options::back_off | back_off |
| back-off strategy (not used) | |
| typedef options::item_counter | item_counter |
| Item counting policy used. | |
| typedef options::memory_model | memory_model |
| C++ memory ordering (see lazy_list::type_traits::memory_model) | |
| typedef iterator_type< false > | iterator |
| Forward iterator. | |
| typedef iterator_type< true > | const_iterator |
| Const forward iterator. | |
| typedef node_type * | auxiliary_head |
| Auxiliary head type (for split-list support) | |
| Protected Member Functions inherited from cds::intrusive::LazyList< gc::nogc, T, Traits > | |
| iterator | begin () |
| Returns a forward iterator addressing the first element in a list. | |
| iterator | end () |
| Returns an iterator that addresses the location succeeding the last element in a list. | |
| const_iterator | begin () const |
| Returns a forward const iterator addressing the first element in a list. | |
| const_iterator | end () const |
| Returns an const iterator that addresses the location succeeding the last element in a list. | |
| LazyList () | |
| Default constructor initializes empty list. | |
| ~LazyList () | |
| Destroy list. | |
| bool | insert (value_type &val) |
| Inserts new node. | |
| template<typename Func > | |
| std::pair< bool, bool > | ensure (value_type &val, Func func) |
Ensures that the item exists in the list. | |
| template<typename Q , typename Func > | |
| bool | find (Q &val, Func f) |
Find the key val. | |
| template<typename Q , typename Func > | |
| bool | find (Q const &val, Func f) |
Find the key val. | |
| template<typename Q > | |
| value_type * | find (Q const &val) |
Find the key val. | |
| template<typename Disposer > | |
| void | clear (Disposer disp) |
| Clears the list. | |
| void | clear () |
| Clears the list using default disposer. | |
| bool | empty () const |
| Check if the list is empty. | |
| size_t | size () const |
| Returns list's item count. | |
Detailed Description
template<typename T, typename Traits>
class cds::container::LazyList< gc::nogc, T, Traits >
Lazy ordered single-linked list (template specialization for gc::nogc)
This specialization is intended for so-called persistent usage when no item reclamation may be performed. The class does not support deleting of list item.
See LazyList for description of template parameters.
The interface of the specialization is a little different.
Member Typedef Documentation
| typedef iterator_type<true> cds::container::LazyList< gc::nogc, T, Traits >::const_iterator |
Const forward iterator.
For iterator's features and requirements see iterator
| typedef iterator_type<false> cds::container::LazyList< gc::nogc, T, Traits >::iterator |
Constructor & Destructor Documentation
|
inline |
Default constructor.
Initialize empty list
|
inline |
List desctructor.
Clears the list
Member Function Documentation
|
inline |
|
inline |
Clears the list.
Post-condition: the list is empty
|
inline |
Inserts data of type value_type constructed with std::forward<Args>(args)...
Return an iterator pointing to inserted item if success end() otherwise
This function is available only for compiler that supports variadic template and move semantics
|
inline |
|
inline |
Ensures that the item val exists in the list.
The operation inserts new item if the key val is not found in the list. Otherwise, the function returns an iterator that points to item found.
Returns std::pair<iterator, bool> where first is an iterator pointing to item found or inserted, second is true if new item has been added or false if the item already is in the list.
|
inline |
Find the key val.
The function searches the item with key equal to val and returns an iterator pointed to item found if the key is found, and end() otherwise
|
inline |
Inserts new node.
The function inserts val in the list if the list does not contain an item with key equal to val.
Return an iterator pointing to inserted item if success end() otherwise
|
inline |
Returns list's item count.
The value returned depends on opt::item_counter option. For atomicity::empty_item_counter, this function always returns 0.
Warning: even if you use real item counter and it returns 0, this fact is not mean that the list is empty. To check list emptyness use empty() method.
The documentation for this class was generated from the following file:
- cds/container/lazy_list_nogc.h