A linked-list that is searchable by the 'name()' of the items. More...
Public Types | |
using | const_iterator = typename SLList< T >::const_iterator |
using | iterator = typename SLList< T >::iterator |
Public Types inherited from LList< LListBase, T > | |
typedef T | value_type |
Type of values stored. More... | |
typedef T * | pointer |
Pointer for value_type. More... | |
typedef const T * | const_pointer |
Const pointer for value_type. More... | |
typedef T & | reference |
Reference for value_type. More... | |
typedef const T & | const_reference |
Const reference for value_type. More... | |
typedef label | size_type |
The type that can represent the container size. More... | |
typedef label | difference_type |
The difference between iterators. More... | |
using | base_iterator = typename LListBase::iterator |
using | const_base_iterator = typename LListBase::const_iterator |
Public Member Functions | |
namesList ()=default | |
Default construct. More... | |
bool | found (const word &key) const |
Return true if a list element has a name that matches key. More... | |
iterator | find (const word &key) |
Find a list element has a name matching key. More... | |
List< word > | findNames (const wordRes &allow, const wordRes &deny=wordRes()) const |
Return a list of names in allow-list and not in deny-list. More... | |
Public Member Functions inherited from LList< LListBase, T > | |
LList ()=default | |
Default construct. More... | |
LList (const T &elem) | |
Construct and copy add initial item. More... | |
LList (T &&elem) | |
Construct and move add initial item. More... | |
LList (Istream &is) | |
Construct from Istream. More... | |
LList (const LList< LListBase, T > &lst) | |
Copy construct. More... | |
LList (LList< LListBase, T > &&lst) | |
Move construct. More... | |
LList (std::initializer_list< T > lst) | |
Copy construct from an initializer list. More... | |
~LList () | |
Destructor. Calls clear() More... | |
reference | front () |
The first entry in the list. More... | |
const_reference | front () const |
The first entry in the list (const access) More... | |
reference | back () |
The last entry in the list. More... | |
const_reference | back () const |
The last entry in the list (const access) More... | |
void | push_front (const T &elem) |
Add copy at front of list. More... | |
void | push_front (T &&elem) |
Move construct at front of list. More... | |
void | push_back (const T &elem) |
Add copy at back of list. More... | |
void | push_back (T &&elem) |
Move construct at back of list. More... | |
void | clear () |
Delete contents of list. More... | |
void | pop_front (label n=1) |
Remove first element(s) from the list (deletes pointers) More... | |
T | removeHead () |
Remove and return first entry. More... | |
T | remove (link *item) |
Remove and return element. More... | |
T | remove (iterator &iter) |
Remove and return element specified by iterator. More... | |
void | transfer (LList< LListBase, T > &lst) |
Transfer the contents of the argument into this List and annul the argument list. More... | |
void | operator= (const LList< LListBase, T > &lst) |
Copy assignment. More... | |
void | operator= (LList< LListBase, T > &&lst) |
Move assignment. More... | |
void | operator= (std::initializer_list< T > lst) |
Copy assignment from an initializer list. More... | |
Istream & | readList (Istream &is) |
Read list from Istream. More... | |
Ostream & | writeList (Ostream &os, const label shortLen=0) const |
Write LList with line-breaks when length exceeds shortLen. More... | |
iterator | begin () |
Iterator to first item in list with non-const access. More... | |
const_iterator | cbegin () const |
Iterator to first item in list with const access. More... | |
reverse_iterator | rbegin () |
Iterator to last item in list with non-const access. More... | |
const_reverse_iterator | crbegin () const |
Iterator to last item in list with const access. More... | |
const_iterator | begin () const |
Iterator to first item in list with const access. More... | |
const_reverse_iterator | rbegin () const |
Iterator to last item in list with const access. More... | |
const iterator & | end () |
End of list for forward iterators. More... | |
const const_iterator & | cend () const |
End of list for forward iterators. More... | |
const reverse_iterator & | rend () |
End of list for reverse iterators. More... | |
const const_reverse_iterator & | crend () const |
End of list for reverse iterators. More... | |
const const_iterator & | end () const |
End of list for forward iterators. More... | |
const const_reverse_iterator & | rend () const |
End of list for reverse iterators. More... | |
reference | first () |
The first entry in the list. More... | |
const_reference | first () const |
The first entry in the list (const access) More... | |
reference | last () |
The last entry in the list. More... | |
const_reference | last () const |
The last entry in the list (const access) More... | |
void | prepend (const T &elem) |
Add copy at front of list. More... | |
void | prepend (T &&elem) |
Move construct at front of list. More... | |
void | append (const T &elem) |
Add copy at back of list. More... | |
void | append (T &&elem) |
Move construct at back of list. More... | |
void | insert (const T &elem) |
Add copy at front of list. Same as push_front() More... | |
void | insert (T &&elem) |
Move construct at front of list. Same as push_front() More... | |
A linked-list that is searchable by the 'name()' of the items.
Definition at line 55 of file ccmSolutionTable.H.
using const_iterator = typename SLList<T>::const_iterator |
Definition at line 60 of file ccmSolutionTable.H.
|
default |
Default construct.
|
inline |
Return true if a list element has a name that matches key.
Definition at line 76 of file ccmSolutionTable.H.
Find a list element has a name matching key.
Definition at line 93 of file ccmSolutionTable.H.
Return a list of names in allow-list and not in deny-list.
Definition at line 111 of file ccmSolutionTable.H.
Copyright © 2011-2018 OpenFOAM | OPENFOAM® is a registered trademark of OpenCFD Ltd.