![]() |
|
Public Types | |
typedef T | value_type |
Type of values the UList contains. | |
typedef T & | reference |
Type that can be used for storing into. | |
typedef const T & | const_reference |
Type that can be used for storing into. | |
typedef label | difference_type |
The type that can represent the difference between any two. | |
typedef label | size_type |
The type that can represent the size of a UList. | |
typedef T * | iterator |
Random access iterator for traversing UList. | |
typedef const T * | const_iterator |
Random access iterator for traversing UList. | |
typedef T * | reverse_iterator |
Reverse iterator for reverse traversal of UList. | |
typedef const T * | const_reverse_iterator |
Reverse iterator for reverse traversal of constant UList. | |
Public Member Functions | |
UList () | |
Null constructor. | |
UList (T *v, label size) | |
Construct from components. | |
label | fcIndex (const label i) const |
Return the forward circular index, i.e. the next index. | |
label | rcIndex (const label i) const |
Return the reverse circular index, i.e. the previous index. | |
void | checkStart (const label start) const |
Check start is within valid range (0 ... size-1). | |
void | checkSize (const label size) const |
Check size is within valid range (0 ... size). | |
void | checkIndex (const label i) const |
Check index i is within valid range (0 ... size-1). | |
void | writeEntry (Ostream &os) const |
Write the UList as a dictionary entry. | |
void | writeEntry (const word &keyword, Ostream &os) const |
Write the UList as a dictionary entry with keyword. | |
T & | operator[] (const label) |
Return subscript-checked element of UList. | |
const T & | operator[] (const label) const |
Return subscript-checked element of constant UList. | |
operator const List () const | |
Allow cast to a const List<T>&. | |
void | operator= (const T &) |
Assignment of all entries to the given value. | |
iterator | begin () |
Return an iterator to begin traversing the UList. | |
iterator | end () |
Return an iterator to end traversing the UList. | |
const_iterator | begin () const |
Return a const_iterator to begin traversing the. | |
const_iterator | end () const |
Return a const_iterator to end traversing the. | |
reverse_iterator | rbegin () |
Return a reverse_iterator to begin reverse traversing the. | |
reverse_iterator | rend () |
Return a reverse_iterator to end reverse traversing the. | |
const_reverse_iterator | rbegin () const |
Return a const_reverse_iterator to begin reverse traversing the. | |
const_reverse_iterator | rend () const |
Return a const_reverse_iterator to end reverse traversing the. | |
label | size () const |
Return the number of elements in the UList. | |
label | max_size () const |
Return size of the largest possible UList. | |
bool | empty () const |
Return true if the UList is empty (i.e., if size() == 0). | |
void | swap (UList< T > &) |
Swap two ULists of the same type in constant time. | |
bool | operator== (const UList< T > &) const |
Equality operation on ULists of the same type. | |
bool | operator!= (const UList< T > &) const |
The opposite of the equality operation. Takes linear time. | |
bool | operator< (const UList< T > &) const |
Compare two ULists lexicographically. Takes linear time. | |
bool | operator> (const UList< T > &) const |
Compare two ULists lexicographically. Takes linear time. | |
bool | operator<= (const UList< T > &) const |
Return true if !(a > b). Takes linear time. | |
bool | operator>= (const UList< T > &) const |
Return true if !(a < b). Takes linear time. | |
Static Public Member Functions | |
UList< T > & | null () |
Return a null UList. | |
Friends | |
class | List<T> |
Declare friendship with the List class. | |
class | SubList<T> |
Declare friendship with the SubList class. | |
Ostream & | operator (Ostream &, const UList< T > &) |
|
Random access iterator for traversing UList.
Definition at line 212 of file UList.H. Referenced by UList::begin(), UList::end(), UList::rbegin(), and UList::rend(). |
|
Type that can be used for storing into. constant UList::value_type objects |
|
Reverse iterator for reverse traversal of constant UList.
|
|
The type that can represent the difference between any two. UList iterator objects. |
|
Random access iterator for traversing UList.
Definition at line 200 of file UList.H. Referenced by UList::begin(), UList::end(), UList::operator const List(), and UList::rbegin(). |
|
Type that can be used for storing into. UList::value_type objects. |
|
Reverse iterator for reverse traversal of UList.
|
|
The type that can represent the size of a UList.
|
|
Type of values the UList contains.
|
|
Null constructor.
Definition at line 51 of file UListI.H. References Foam::label, and UList::size(). |
Here is the call graph for this function:
|
Construct from components.
|
|
Return a const_iterator to begin traversing the. constant UList. Definition at line 163 of file UListI.H. References UList::iterator. |
|
Return an iterator to begin traversing the UList.
Definition at line 155 of file UListI.H. References UList::const_iterator. |
|
Check index i is within valid range (0 ... size-1).
|
|
Check size is within valid range (0 ... size).
Definition at line 89 of file UListI.H. References Foam::size(). Referenced by SubList::SubList(). |
Here is the call graph for this function:
|
Check start is within valid range (0 ... size-1).
Definition at line 76 of file UListI.H. Referenced by SubList::SubList(). |
|
Return true if the UList is empty (i.e., if size() == 0).
Definition at line 231 of file UListI.H. References Foam::Swap(). |
Here is the call graph for this function:
|
Return a const_iterator to end traversing the. constant UList. Definition at line 179 of file UListI.H. References UList::iterator. |
|
Return an iterator to end traversing the UList.
Definition at line 171 of file UListI.H. References UList::const_iterator. |
|
Return the forward circular index, i.e. the next index. which returns to the first at the end of the list Definition at line 61 of file UListI.H. References Foam::label, and UList::size(). Referenced by face::faceEdge(), and face::nEdges(). |
Here is the call graph for this function:
|
Return size of the largest possible UList.
|
|
|
Allow cast to a const List<T>&.
Reimplemented in SubList, and SubList< Type >. Definition at line 145 of file UListI.H. References UList::iterator. |
|
The opposite of the equality operation. Takes linear time.
|
|
Compare two ULists lexicographically. Takes linear time.
|
|
Return true if !(a > b). Takes linear time.
|
|
|
Equality operation on ULists of the same type. Returns true when the ULists are elementwise equal (using UList::value_type::operator==). Takes linear time. |
|
Compare two ULists lexicographically. Takes linear time.
|
|
Return true if !(a < b). Takes linear time.
|
|
Return subscript-checked element of constant UList.
Reimplemented in speciesTable. |
|
Return subscript-checked element of UList.
Definition at line 123 of file UListI.H. Referenced by face::faceEdge(), face::nextLabel(), and face::points(). |
|
Return a const_reverse_iterator to begin reverse traversing the. Definition at line 194 of file UListI.H. References UList::iterator. |
|
Return a reverse_iterator to begin reverse traversing the. Definition at line 186 of file UListI.H. References UList::const_iterator. |
|
Return the reverse circular index, i.e. the previous index. which returns to the last at the begining of the list Definition at line 68 of file UListI.H. References FatalErrorIn. Referenced by face::nextLabel(). |
|
Return a const_reverse_iterator to end reverse traversing the. Definition at line 210 of file UListI.H. References Foam::label. |
|
Return a reverse_iterator to end reverse traversing the. Definition at line 202 of file UListI.H. References UList::const_iterator. |
|
Return the number of elements in the UList.
Reimplemented in DynamicList, PackedList, ValueStoredPointPatchField, emptyFaPatch, faPatch, ValueStoredTetPointPatchField, DynamicList< procPointList >, DynamicList< polyAddCell >, DynamicList< label >, DynamicList< polyModifyPoint >, DynamicList< point >, DynamicList< polyAddPoint >, DynamicList< face >, DynamicList< word >, DynamicList< polyModifyCell >, DynamicList< polyModifyFace >, DynamicList< polyAddFace >, and PackedList< 1 >. Definition at line 217 of file UListI.H. References Foam::label. Referenced by List::clone(), cellShape::collapsedFaces(), structuredScalars2D::DataRow(), face::face(), UList::fcIndex(), IndirectList::IndirectList(), octreeDataFace::mesh(), meshEdgeCuts::meshEdges(), cellModel::modelFaces(), cellModel::nFaces(), primitiveMesh::nPoints(), StaticHashTable::Iterator::operator()(), IndirectList::operator[](), and UList::UList(). |
|
Swap two ULists of the same type in constant time.
|
|
Write the UList as a dictionary entry with keyword.
Reimplemented in Field, Field< tensor >, Field< scalar >, Field< label >, Field< vector >, Field< complexVector >, and Field< T >. |
|
Write the UList as a dictionary entry.
|
|
Declare friendship with the List class.
|
|
|
|
Declare friendship with the SubList class.
|