|
| | areaIntegrateOp (const FixedList< Type, 3 > &x) |
| | Construct from base.
|
| result | operator() () const |
| | Operate on nothing.
|
| result | operator() (const FixedList< point, 3 > &p) const |
| | Operate on a triangle.
|
| | FixedList ()=default |
| | Default construct.
|
| autoPtr< FixedList< Type, N > > | clone () const |
| | Clone.
|
| const Type * | cdata () const noexcept |
| | Return pointer to the underlying array serving as data storage.
|
| Type * | data () noexcept |
| | Return pointer to the underlying array serving as data storage.
|
| const char * | cdata_bytes () const noexcept |
| | Return pointer to the underlying array serving as data storage,.
|
| char * | data_bytes () noexcept |
| | Return pointer to the underlying array serving as data storage,.
|
| Type & | get () noexcept |
| | Element access using compile-time indexing.
|
| Type & | front () noexcept |
| | Access first element of the list, position [0].
|
| Type & | back () noexcept |
| | Access last element of the list, position [N-1].
|
| label | fcIndex (const label i) const noexcept |
| | Return the forward circular index, i.e. next index which returns to the first at the end of the list.
|
| const Type & | fcValue (const label i) const |
| | Return forward circular value (ie, next value in the list).
|
| label | rcIndex (const label i) const noexcept |
| | Return the reverse circular index, i.e. previous index which returns to the last at the beginning of the list.
|
| const Type & | rcValue (const label i) const |
| | Return reverse circular value (ie, previous value in the list).
|
| void | checkStart (const label start) const |
| | Check start is within valid range [0,size).
|
| void | checkSize (const label size) const |
| | Check size is identical to template parameter N.
|
| void | checkIndex (const label i) const |
| | Check index is within valid range [0,N).
|
| bool | uniform () const |
| | True if all entries have identical values, and list is non-empty.
|
| bool | contains (const Type &val) const |
| | True if the value is contained in the list.
|
| label | find (const Type &val) const |
| | Find index of the first occurrence of the value.
|
| label | rfind (const Type &val, label pos=-1) const |
| | Find index of the last occurrence of the value.
|
| void | resize (const label n) |
| | Dummy function, to make FixedList consistent with List Any resizing is ignored (Fatal with bad sizing in full debug).
|
| void | resize_fill (const label n, const Type &val) |
| | Set val for all elements. Any resizing is ignored (Fatal with bad sizing in full debug).
|
| void | resize_nocopy (const label n) |
| | Dummy function, to make FixedList consistent with List Any resizing is ignored (Fatal with bad sizing in full debug).
|
| void | setSize (const label n) |
| | Dummy function, to make FixedList consistent with List.
|
| void | fill (const Type &val) |
| | Assign all entries to the given value.
|
| void | moveFirst (const label i) |
| | Move element to the first position.
|
| void | moveLast (const label i) |
| | Move element to the last position.
|
| void | swapFirst (const label i) |
| | Swap element with the first element.
|
| void | swapLast (const label i) |
| | Swap element with the last element.
|
| void | transfer (FixedList< Type, N > &list) |
| | Transfer by swapping using a move assignment for the content of the individual list elements.
|
| Type & | operator[] (const label i) |
| | Return element of FixedList.
|
| void | operator= (const UList< Type > &list) |
| | Assignment to UList operator. Takes linear time.
|
| iterator | begin () noexcept |
| | Return an iterator to begin traversing the FixedList.
|
| iterator | end () noexcept |
| | Return an iterator to end traversing the FixedList.
|
| const_iterator | cbegin () const noexcept |
| | Return const_iterator to begin traversing the constant FixedList.
|
| const_iterator | cend () const noexcept |
| | Return const_iterator to end traversing the constant FixedList.
|
| reverse_iterator | rbegin () |
| | Return reverse_iterator to begin reverse traversing the FixedList.
|
| reverse_iterator | rend () |
| | Return reverse_iterator to end reverse traversing the FixedList.
|
| const_reverse_iterator | crbegin () const |
| | Return const_reverse_iterator to begin reverse traversing FixedList.
|
| const_reverse_iterator | crend () const |
| | Return const_reverse_iterator to end reverse traversing FixedList.
|
| void | swap (FixedList< Type, N > &other) |
| | Swap lists by swapping the content of the individual list elements.
|
| bool | operator== (const FixedList< Type, N > &list) const |
| | Equality operation on FixedLists of the same type.
|
| bool | operator!= (const FixedList< Type, N > &list) const |
| | The opposite of the equality operation. Takes linear time.
|
| bool | operator< (const FixedList< Type, N > &list) const |
| | Compare two FixedLists lexicographically. Takes linear time.
|
| bool | operator> (const FixedList< Type, N > &list) const |
| | Compare two FixedLists lexicographically. Takes linear time.
|
| bool | operator<= (const FixedList< Type, N > &list) const |
| | Return true if !(a > b). Takes linear time.
|
| bool | operator>= (const FixedList< Type, N > &list) const |
| | Return true if !(a < b). Takes linear time.
|
| Istream & | readList (Istream &is) |
| | Read from Istream, discarding contents of existing List.
|
| Ostream & | writeList (Ostream &os, const label shortLen=0) const |
| | Write List, with line-breaks in ASCII when length exceeds shortLen.
|
| Type & | first () noexcept |
| | Access first element of the list, position [0] - front().
|
| Type & | last () noexcept |
| | Access last element of the list, position [N-1] - back().
|
| bool | found (const Type &val, label pos=0) const |
| | Same as contains().
|
template<class Type>
class Foam::cut::areaIntegrateOp< Type >
Definition at line 259 of file cut.H.
1.16.1 