Go to the documentation of this file.
54 template<
class LListBase,
class T>
class UILList;
56 template<
class LListBase,
class T>
68 template<
class LListBase,
class T>
128 return static_cast<T*
>(LListBase::first());
134 return static_cast<const T*
>(LListBase::first());
140 return static_cast<T*
>(LListBase::last());
144 const T*
last()
const
146 return static_cast<const T*
>(LListBase::last());
153 return static_cast<T*
>(LListBase::removeHead());
159 return static_cast<T*
>(LListBase::remove(item));
165 return static_cast<T*
>(LListBase::remove(iter));
190 friend Ostream& operator<< <LListBase, T>
214 return static_cast<T*
>(base_iterator::get_node());
219 return *(this->
get());
264 return static_cast<const T*
>(const_base_iterator::get_node());
269 return *(this->
get());
308 return static_cast<T*
>(base_iterator::get_node());
313 return *(this->
get());
352 return static_cast<const T*
>(const_base_iterator::get_node());
357 return *(this->
get());
381 return LListBase::template iterator_first<base_iterator>();
387 return LListBase::template iterator_first<const_base_iterator>();
393 return LListBase::template iterator_last<base_iterator>();
399 return LListBase::template iterator_last<const_base_iterator>();
418 return LListBase::template iterator_end<iterator>();
424 return LListBase::template iterator_end<const_iterator>();
430 return LListBase::template iterator_rend<reverse_iterator>();
436 return LListBase::template iterator_rend<const_reverse_iterator>();
typename LListBase::const_iterator const_base_iterator
const iterator & end()
End of list for forward iterators.
T * first()
The first entry in the list.
srcOptions insert("case", fileName(rootDirSource/caseDirSource))
void operator=(const UILList< LListBase, T > &lst)
Copy assignment.
const_reverse_iterator(const_base_iterator iter)
UILList()=default
Null construct.
const_reverse_iterator crbegin() const
Iterator to last item in list with const access.
T * removeHead()
Remove and return head.
T * remove(iterator &iter)
Remove and return item specified by iterator.
bool operator!=(const UILList< LListBase, T > &lst) const
The opposite of the equality operation. Takes linear time.
const const_reverse_iterator & crend() const
End of list for reverse iterators.
const_pointer operator->() const
const typedef T * const_pointer
Const pointer for value_type.
const_reference operator()() const
typename LListBase::iterator base_iterator
reference operator*() const
pointer operator->() const
label difference_type
The difference between iterator objects.
const_iterator cbegin() const
Iterator to first item in list with const access.
reference operator*() const
const_iterator & operator++()
const_pointer operator->() const
pointer get() const
Return the address of the object being referenced.
const_reference operator*() const
reverse_iterator(base_iterator iter)
T & reference
Reference for value_type.
const const_iterator & cend() const
End of list for forward iterators.
const_reverse_iterator rbegin() const
Iterator to last item in list with const access.
label size_type
The type that can represent the container size.
T * pointer
Pointer for value_type.
bool operator==(const UILList< LListBase, T > &lst) const
Equality. True both lists are element-wise equal.
const_iterator(const_base_iterator iter)
Construct from base const_iterator.
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
const_reference operator*() const
T * last()
The last entry in the list.
const_reverse_iterator & operator++()
const typedef T & const_reference
Const reference for value_type.
iterator(base_iterator iter)
const_pointer get() const
Return the address of the object being referenced.
reverse_iterator rbegin()
Iterator to last item in list with non-const access.
Ostream & writeList(Ostream &os, const label shortLen=0) const
Write UILList with line-breaks when length exceeds shortLen.
const_reference operator()() const
const reverse_iterator & rend()
End of list for reverse iterators.
const T * last() const
The last entry in the list (const access)
const const_iterator & end() const
End of list for forward iterators.
reverse_iterator & operator++()
const_iterator begin() const
Iterator to first item in list with const access.
iterator begin()
Iterator to first item in list with non-const access.
constexpr auto cbegin(const C &c) -> decltype(c.begin())
Return const_iterator to the beginning of the container c.
const const_reverse_iterator & rend() const
End of list for reverse iterators.
Template class for intrusive linked lists.
const_pointer get() const
Return the address of the object being referenced.
T value_type
Type of values stored.
UILList(T *item)
Construct and insert the initial T item.
const_iterator(base_iterator iter)
Construct from base iterator.
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
reference operator()() const
reference operator()() const
T * remove(T *item)
Remove and return element.
pointer get() const
Return the address of the object being referenced.
const T * first() const
The first entry in the list (const access)
pointer operator->() const