Go to the documentation of this file.
83 link* last_ =
nullptr;
95 template<
class IteratorType>
100 template<
class IteratorType>
105 template<
class IteratorType>
110 template<
class IteratorType>
142 inline label
size() const noexcept;
145 inline
bool empty() const noexcept;
215 inline link* get_node()
const;
218 inline bool good()
const;
229 inline void prev() =
delete;
271 inline bool good()
const;
282 inline void prev() =
delete;
const_iterator cbegin() const
Iterator to first item in list with const access.
link * next_
Pointer to next entry in list.
link()=default
Default construct.
link * last()
Return last entry.
link * first()
Return first entry.
bool operator==(const const_iterator &iter) const
bool operator!=(const const_iterator &iter) const
const_iterator(const const_iterator &)=default
Copy construct.
link * remove(link *item)
void append(link *item)
Add at tail of list.
void clear()
Clear the list.
static const IteratorType & iterator_rend()=delete
Factory method to return an iterator rend.
iterator begin()
Iterator to first item in list with non-const access.
IteratorType iterator_last() const
Return iterator to last item or end-iterator if list is empty.
void prev()=delete
Cannot move backward through list.
bool operator!=(const eddy &a, const eddy &b)
bool good() const
Pointing at a valid storage node.
tmp< faMatrix< Type > > operator==(const faMatrix< Type > &, const faMatrix< Type > &)
The structure for a singly-linked storage node.
const link * get_node() const
The storage node.
link * removeHead()
Remove and return head.
static const IteratorType & iterator_end()
Factory method to return an iterator end.
bool found() const
Deprecated(2019-01) Pointing at a valid storage node.
void operator=(const SLListBase &)=delete
No copy assignment.
void swap(SLListBase &lst)
Swap the contents of list.
void transfer(SLListBase &lst)
A primitive non-const node iterator.
const_iterator crbegin() const =delete
No reverse iteration.
A primitive const node iterator.
const_iterator & operator=(const const_iterator &)=default
Copy assignment.
const iterator & end()
End of list for iterators.
const const_iterator & crend() const =delete
No reverse iteration.
label size() const noexcept
The number of elements in list.
SLListBase()=default
Default construct.
Base for singly-linked lists.
~SLListBase()=default
Destructor.
class FOAM_DEPRECATED_FOR(2017-05, "Foam::Enum") NamedEnum
friend class const_iterator
void next()
Move forward through list.
bool empty() const noexcept
True if the list is empty.
IteratorType iterator_first() const
Return iterator to first item or end-iterator if list is empty.
const const_iterator & cend() const
End of list for iterators.
void insert(link *item)
Add at head of list.