|
| labelledTri () |
| Default construct, with invalid point labels and region (-1). More...
|
|
| labelledTri (const triFace &tri, const label region=0) |
| Construct from triFace and optional region index (0 if unspecified) More...
|
|
| labelledTri (const label p0, const label p1, const label p2, const label region=0) |
| Construct from three point labels and optional region index (0 if unspecified) More...
|
|
| labelledTri (const labelUList &list) |
| Construct from a list of 3 or 4 labels. Default region is 0. More...
|
|
| labelledTri (std::initializer_list< label >) |
| Construct from a list of 3 or 4 labels. Default region is 0. More...
|
|
| labelledTri (const labelUList &list, const FixedList< label, 3 > &triIndices, const label region=0) |
| Copy construct from a subset of point labels and optional region index (0 if unspecified) More...
|
|
| labelledTri (const labelUList &list, const labelledTri &triIndices) |
| Copy construct from a subset of point labels with region index from input labelledTri. More...
|
|
| labelledTri (Istream &is) |
| Construct from Istream. More...
|
|
label | index () const noexcept |
| Return the index (eg, the region) More...
|
|
label & | index () noexcept |
| Non-const access to the index (eg, the region) More...
|
|
void | setIndex (const label idx) noexcept |
| Set the index (eg, the region) More...
|
|
label | region () const noexcept |
| Return the region index. More...
|
|
label & | region () noexcept |
| Non-const access to the region index. More...
|
|
void | front ()=delete |
| The front() accessor (from FixedList) has no purpose. More...
|
|
void | back ()=delete |
| The back() accessor (from FixedList) has no purpose. More...
|
|
| triFace () |
| Default construct, with invalid vertex labels (-1) More...
|
|
| triFace (const label p0, const label p1, const label p2) noexcept |
| Construct from three vertex labels. More...
|
|
| triFace (std::initializer_list< label > list) |
| Construct from an initializer list of three vertex labels. More...
|
|
| triFace (const labelUList &list) |
| Copy construct from a list of three vertex labels. More...
|
|
| triFace (const labelUList &list, const FixedList< label, 3 > &indices) |
| Copy construct from a subset of vertex labels. More...
|
|
| triFace (Istream &is) |
| Construct from Istream. More...
|
|
label | a () const noexcept |
| The first vertex. More...
|
|
label | b () const noexcept |
| The second vertex. More...
|
|
label | c () const noexcept |
| The third vertex. More...
|
|
label & | a () noexcept |
| The first vertex. More...
|
|
label & | b () noexcept |
| The second vertex. More...
|
|
label & | c () noexcept |
| The third vertex. More...
|
|
bool | good () const noexcept |
| True if vertices are unique and non-negative. More...
|
|
label | collapse () |
| 'Collapse' face by marking duplicate vertex labels. More...
|
|
void | flip () |
| Flip the face in-place. More...
|
|
pointField | points (const UList< point > &pts) const |
| Return the points corresponding to this face. More...
|
|
face | triFaceFace () const |
| Return triangle as a face. More...
|
|
triPointRef | tri (const UList< point > &points) const |
| Return the triangle. More...
|
|
point | centre (const UList< point > &points) const |
| Return centre (centroid) More...
|
|
template<class Type > |
Type | average (const UList< point > &unused, const Field< Type > &fld) const |
| Calculate average value at centroid of face. More...
|
|
vector | areaNormal (const UList< point > &points) const |
| The area normal - with magnitude equal to area of face. More...
|
|
vector | unitNormal (const UList< point > &points) const |
| The unit normal. More...
|
|
| FOAM_DEPRECATED_FOR (2018-12, "areaNormal() or unitNormal()") vector normal(const UList< point > &points) const |
| Legacy name for areaNormal() More...
|
|
scalar | mag (const UList< point > &points) const |
| Magnitude of face area. More...
|
|
Pair< point > | box (const UList< point > &points) const |
| The enclosing (bounding) box for the face. More...
|
|
label | nTriangles () const noexcept |
| Number of triangles after splitting == 1. More...
|
|
triFace | reverseFace () const |
| Return face with reverse direction. More...
|
|
label | which (const label vertex) const |
| Find local vertex on face for the vertex label, same as find() More...
|
|
label | nextLabel (const label i) const |
| Next vertex on face. More...
|
|
label | prevLabel (const label i) const |
| Previous vertex on face. More...
|
|
label | thisLabel (const label i) const |
| The vertex on face - identical to operator[], but with naming similar to nextLabel(), prevLabel() More...
|
|
scalar | sweptVol (const UList< point > &opts, const UList< point > &npts) const |
| Return swept-volume from old-points to new-points. More...
|
|
tensor | inertia (const UList< point > &points, const point &refPt=vector::zero, scalar density=1.0) const |
| Return the inertia tensor, with optional reference. More...
|
|
pointHit | ray (const point &p, const vector &q, const UList< point > &points, const intersection::algorithm=intersection::FULL_RAY, const intersection::direction dir=intersection::VECTOR) const |
| Return point intersection with a ray starting at p, in direction q. More...
|
|
pointHit | intersection (const point &p, const vector &q, const UList< point > &points, const intersection::algorithm alg, const scalar tol=0.0) const |
| Fast intersection with a ray. More...
|
|
pointHit | intersection (const point &p, const vector &q, const point &ctr, const UList< point > &points, const intersection::algorithm alg, const scalar tol=0.0) const |
|
pointHit | nearestPoint (const point &p, const UList< point > &points) const |
| Return nearest point to face. More...
|
|
pointHit | nearestPointClassify (const point &p, const UList< point > &points, label &nearType, label &nearLabel) const |
| Return nearest point to face and classify it: More...
|
|
int | sign (const point &p, const UList< point > &points, const scalar tol=SMALL) const |
| The sign for which side of the face plane the point is on. More...
|
|
label | nEdges () const noexcept |
| Return number of edges == 3. More...
|
|
Foam::edge | edge (const label edgei) const |
| Return i-th face edge (forward walk order). More...
|
|
vector | edge (const label edgei, const UList< point > &pts) const |
| Return vector of i-th face edge (forward walk order). More...
|
|
Foam::edge | rcEdge (const label edgei) const |
| Return i-th face edge in reverse walk order. More...
|
|
vector | rcEdge (const label edgei, const UList< point > &pts) const |
| Return vector of i-th face edge in reverse walk order. More...
|
|
edgeList | edges () const |
| Return list of edges in forward walk order. More...
|
|
edgeList | rcEdges () const |
| Return list of edges in reverse walk order. More...
|
|
bool | contains (const Foam::edge &e) const |
| True if face contains(edge) More...
|
|
label | find (const Foam::edge &e) const |
| Find the edge within the face. More...
|
|
int | edgeDirection (const Foam::edge &e) const |
| Test the edge direction on the face. More...
|
|
void | operator+= (const label vertexOffset) |
| Increment (offset) vertices by given amount. More...
|
|
unsigned | hash_code (unsigned seed=0) const |
| The (commutative) hash value for triFace. More...
|
|
bool | valid () const noexcept |
| Same as good() More...
|
|
Foam::edge | faceEdge (label edgei) const |
| Identical to edge() More...
|
|
void | writeEntry (const word &keyword, Ostream &os) const |
| Write the list as a dictionary entry with keyword. More...
|
|
| FixedList ()=default |
| Default construct. More...
|
|
| FixedList (const label &val) |
| Construct and initialize all entries to given value. More...
|
|
| FixedList (const Foam::zero) |
| Construct and initialize all entries to zero. More...
|
|
| FixedList (const FixedList< label, N > &list) |
| Copy construct. More...
|
|
| FixedList (FixedList< label, N > &&list) |
| Move construct by using move assignment for the individual list elements. More...
|
|
| FixedList (std::initializer_list< label > list) |
| Construct from an initializer list. Runtime size check. More...
|
|
| FixedList (const UList< label > &list) |
| Construct from UList. Runtime size check. More...
|
|
| FixedList (const FixedList< label, AnyNum > &list, const FixedList< label, N > &indices) |
| Copy construct from a subset of the input. No size check. More...
|
|
| FixedList (const UList< label > &list, const FixedList< label, N > &indices) |
| Copy construct from a subset of the input. No size check. More...
|
|
| FixedList (Istream &is) |
| Construct from Istream. More...
|
|
| FixedList (const label list[N]) |
| Deprecated: copy construct from C-array. More...
|
|
autoPtr< FixedList< label, N > > | clone () const |
| Clone. More...
|
|
const label * | cdata () const noexcept |
| Return pointer to the underlying array serving as data storage. More...
|
|
label * | data () noexcept |
| Return pointer to the underlying array serving as data storage. More...
|
|
const char * | cdata_bytes () const noexcept |
| Return pointer to the underlying array serving as data storage,. More...
|
|
char * | data_bytes () noexcept |
| Return pointer to the underlying array serving as data storage,. More...
|
|
label & | get () noexcept |
| Element access using compile-time indexing. More...
|
|
const label & | get () const noexcept |
| Element access using compile-time indexing. More...
|
|
label & | front () noexcept |
| Access first element of the list, position [0]. More...
|
|
const label & | front () const noexcept |
| Access first element of the list, position [0]. More...
|
|
label & | back () noexcept |
| Access last element of the list, position [N-1]. More...
|
|
const label & | back () const noexcept |
| Access last element of the list, position [N-1]. More...
|
|
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. More...
|
|
const label & | fcValue (const label i) const |
| Return forward circular value (ie, next value in the list) More...
|
|
label & | fcValue (const label i) |
| Return forward circular value (ie, next value in the list) More...
|
|
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. More...
|
|
const label & | rcValue (const label i) const |
| Return reverse circular value (ie, previous value in the list) More...
|
|
label & | rcValue (const label i) |
| Return reverse circular value (ie, previous value in the list) More...
|
|
void | checkStart (const label start) const |
| Check start is within valid range [0,size) More...
|
|
void | checkSize (const label size) const |
| Check size is identical to template parameter N. More...
|
|
void | checkIndex (const label i) const |
| Check index is within valid range [0,N) More...
|
|
bool | uniform () const |
| True if all entries have identical values, and list is non-empty. More...
|
|
bool | contains (const label &val) const |
| True if the value is contained in the list. More...
|
|
bool | contains (const label &val, label pos, label len=-1) const |
| Is the value contained in the list? More...
|
|
label | find (const label &val) const |
| Find index of the first occurrence of the value. More...
|
|
label | find (const label &val, label pos, label len=-1) const |
| Find index of the first occurrence of the value. More...
|
|
label | rfind (const label &val, label pos=-1) const |
| Find index of the last occurrence of the value. More...
|
|
void | resize (const label n) |
| Dummy function, to make FixedList consistent with List Any resizing is ignored (Fatal with bad sizing in full debug). More...
|
|
void | resize_fill (const label n, const label &val) |
| Set val for all elements. Any resizing is ignored (Fatal with bad sizing in full debug). More...
|
|
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). More...
|
|
void | setSize (const label n) |
| Dummy function, to make FixedList consistent with List. More...
|
|
void | fill (const label &val) |
| Assign all entries to the given value. More...
|
|
void | fill (const Foam::zero) |
| Assign all entries to zero. More...
|
|
void | moveFirst (const label i) |
| Move element to the first position. More...
|
|
void | moveLast (const label i) |
| Move element to the last position. More...
|
|
void | swapFirst (const label i) |
| Swap element with the first element. More...
|
|
void | swapLast (const label i) |
| Swap element with the last element. More...
|
|
void | transfer (FixedList< label, N > &list) |
| Transfer by swapping using a move assignment for the content of the individual list elements. More...
|
|
label & | operator[] (const label i) |
| Return element of FixedList. More...
|
|
const label & | operator[] (const label i) const |
| Return element of constant FixedList. More...
|
|
void | operator= (const UList< label > &list) |
| Assignment to UList operator. Takes linear time. More...
|
|
void | operator= (std::initializer_list< label > list) |
| Assignment to an initializer list. Takes linear time. More...
|
|
void | operator= (const label &val) |
| Assign all entries to the given value. fill() More...
|
|
void | operator= (const Foam::zero) |
| Assign all entries to zero. fill() More...
|
|
void | operator= (const FixedList< label, N > &list) |
| Copy assignment. More...
|
|
void | operator= (FixedList< label, N > &&list) |
| Move assignment. More...
|
|
void | operator= (const label list[N]) |
| Deprecated: assignment from C-array. More...
|
|
iterator | begin () noexcept |
| Return an iterator to begin traversing the FixedList. More...
|
|
const_iterator | begin () const noexcept |
| Return const_iterator to begin traversing the constant FixedList. More...
|
|
iterator | end () noexcept |
| Return an iterator to end traversing the FixedList. More...
|
|
const_iterator | end () const noexcept |
| Return const_iterator to end traversing the constant FixedList. More...
|
|
const_iterator | cbegin () const noexcept |
| Return const_iterator to begin traversing the constant FixedList. More...
|
|
const_iterator | cend () const noexcept |
| Return const_iterator to end traversing the constant FixedList. More...
|
|
reverse_iterator | rbegin () |
| Return reverse_iterator to begin reverse traversing the FixedList. More...
|
|
const_reverse_iterator | rbegin () const |
| Return const_reverse_iterator to begin reverse traversing FixedList. More...
|
|
reverse_iterator | rend () |
| Return reverse_iterator to end reverse traversing the FixedList. More...
|
|
const_reverse_iterator | rend () const |
| Return const_reverse_iterator to end reverse traversing FixedList. More...
|
|
const_reverse_iterator | crbegin () const |
| Return const_reverse_iterator to begin reverse traversing FixedList. More...
|
|
const_reverse_iterator | crend () const |
| Return const_reverse_iterator to end reverse traversing FixedList. More...
|
|
void | swap (FixedList< label, N > &other) |
| Swap lists by swapping the content of the individual list elements. More...
|
|
bool | operator== (const FixedList< label, N > &list) const |
| Equality operation on FixedLists of the same type. More...
|
|
bool | operator!= (const FixedList< label, N > &list) const |
| The opposite of the equality operation. Takes linear time. More...
|
|
bool | operator< (const FixedList< label, N > &list) const |
| Compare two FixedLists lexicographically. Takes linear time. More...
|
|
bool | operator> (const FixedList< label, N > &list) const |
| Compare two FixedLists lexicographically. Takes linear time. More...
|
|
bool | operator<= (const FixedList< label, N > &list) const |
| Return true if !(a > b). Takes linear time. More...
|
|
bool | operator>= (const FixedList< label, N > &list) const |
| Return true if !(a < b). Takes linear time. More...
|
|
Istream & | readList (Istream &is) |
| Read from Istream, discarding contents of existing List. More...
|
|
Ostream & | writeList (Ostream &os, const label shortLen=0) const |
| Write List, with line-breaks in ASCII when length exceeds shortLen. More...
|
|
label & | first () noexcept |
| Access first element of the list, position [0] - front() More...
|
|
const label & | first () const noexcept |
| Access first element of the list, position [0] - front() More...
|
|
label & | last () noexcept |
| Access last element of the list, position [N-1] - back() More...
|
|
const label & | last () const noexcept |
| Access last element of the list, position [N-1] - back() More...
|
|
bool | found (const label &val, label pos=0) const |
| Same as contains() More...
|
|