A tetrahedral cell primitive. More...
#include <OpenFOAM/tetCell.H>
A tetrahedral cell primitive.
It is important that the ordering of edges is the same for a tetrahedron class, a tetrahedron cell shape model and a tetCell
Inheritance diagram for tetCell: Collaboration diagram for tetCell:Public Member Functions | |
| tetCell () | |
| Construct null. | |
| tetCell (const label a, const label b, const label c, const label d) | |
| Construct from four points. | |
| tetCell (const FixedList< label, 4 > &) | |
| Construct from FixedList. | |
| tetCell (Istream &) | |
| Construct from Istream. | |
| triFace | face (const label faceI) const |
| Return i-th face. | |
| label | edgeFace (const label edgeI) const |
| Return first face adjacent to the given edge. | |
| label | edgeAdjacentFace (const label edgeI, const label faceI) const |
| Return face adjacent to the given face sharing the same edge. | |
| edge | tetEdge (const label edgeI) const |
| Return i-th edge. | |
| cellShape | tetCellShape () const |
| Return tet shape cell. | |
| tetPointRef | tet (const pointField &) const |
| Return the tetrahedron. | |
| Public Member Functions inherited from FixedList< label, 4 > | |
| FixedList () | |
| Null constructor. | |
| FixedList (const labelv[Size]) | |
| Construct from components. | |
| FixedList (const label &) | |
| Construct from value. | |
| FixedList (const UList< label > &) | |
| Construct from UList. | |
| FixedList (const SLList< label > &) | |
| Construct from SLList. | |
| FixedList (const FixedList< label, Size > &) | |
| Copy constructor. | |
| FixedList (Istream &) | |
| Construct from Istream. | |
| autoPtr< FixedList< label, Size > > | clone () const |
| Clone. | |
| 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. | |
| const label * | cdata () const |
| Return a const pointer to the first data element,. | |
| label * | data () |
| Return a pointer to the first data element,. | |
| 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 | resize (const label) |
| Dummy resize function. | |
| void | setSize (const label) |
| Dummy setSize function. | |
| void | transfer (const FixedList< label, Size > &) |
| Copy (not transfer) the argument contents. | |
| void | writeEntry (Ostream &) const |
| Write the FixedList as a dictionary entry. | |
| void | writeEntry (const word &keyword, Ostream &) const |
| Write the FixedList as a dictionary entry with keyword. | |
| label & | operator[] (const label) |
| Return element of FixedList. | |
| const label & | operator[] (const label) const |
| Return element of constant FixedList. | |
| void | operator= (const labelv[Size]) |
| Assignment from array operator. Takes linear time. | |
| void | operator= (const UList< label > &) |
| Assignment from UList operator. Takes linear time. | |
| void | operator= (const SLList< label > &) |
| Assignment from SLList operator. Takes linear time. | |
| void | operator= (const label &) |
| Assignment of all entries to the given value. | |
| iterator | begin () |
| Return an iterator to begin traversing the FixedList. | |
| const_iterator | begin () const |
| Return const_iterator to begin traversing the constant FixedList. | |
| iterator | end () |
| Return an iterator to end traversing the FixedList. | |
| const_iterator | end () const |
| Return const_iterator to end traversing the constant FixedList. | |
| const_iterator | cbegin () const |
| Return const_iterator to begin traversing the constant FixedList. | |
| const_iterator | cend () const |
| Return const_iterator to end traversing the constant FixedList. | |
| reverse_iterator | rbegin () |
| Return reverse_iterator to begin reverse traversing the FixedList. | |
| const_reverse_iterator | rbegin () const |
| Return const_reverse_iterator to begin reverse traversing FixedList. | |
| reverse_iterator | rend () |
| Return reverse_iterator to end reverse traversing the FixedList. | |
| const_reverse_iterator | rend () const |
| Return const_reverse_iterator to end reverse traversing 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. | |
| label | size () const |
| Return the number of elements in the FixedList. | |
| label | max_size () const |
| Return size of the largest possible FixedList. | |
| bool | empty () const |
| Return true if the FixedList is empty (ie, size() is zero). | |
| void | swap (FixedList< label, Size > &) |
| Swap two FixedLists of the same type in constant time. | |
| bool | operator== (const FixedList< label, Size > &) const |
| Equality operation on FixedLists of the same type. | |
| bool | operator!= (const FixedList< label, Size > &) const |
| The opposite of the equality operation. Takes linear time. | |
| bool | operator< (const FixedList< label, Size > &) const |
| Compare two FixedLists lexicographically. Takes linear time. | |
| bool | operator> (const FixedList< label, Size > &) const |
| Compare two FixedLists lexicographically. Takes linear time. | |
| bool | operator<= (const FixedList< label, Size > &) const |
| Return true if !(a > b). Takes linear time. | |
| bool | operator>= (const FixedList< label, Size > &) const |
| Return true if !(a < b). Takes linear time. | |
Additional Inherited Members | |
| Public Types inherited from FixedList< label, 4 > | |
| typedef label | value_type |
| Type of values the FixedList contains. | |
| typedef label & | reference |
| Type that can be used for storing into. | |
| typedef const label & | 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 FixedList. | |
| typedef label * | iterator |
| Random access iterator for traversing FixedList. | |
| typedef const label * | const_iterator |
| Random access iterator for traversing FixedList. | |
| typedef label * | reverse_iterator |
| Reverse iterator for reverse traversal of FixedList. | |
| typedef const label * | const_reverse_iterator |
| Reverse iterator for reverse traversal of constant FixedList. | |
| Static Public Member Functions inherited from FixedList< label, 4 > | |
| static const FixedList< label, Size > & | null () |
| Return a null FixedList. | |
|
inline |
Construct null.
Definition at line 32 of file tetCellI.H.
|
inline |
Construct from FixedList.
Definition at line 51 of file tetCellI.H.
Construct from Istream.
Definition at line 57 of file tetCellI.H.
|
inline |
Return i-th face.
Definition at line 65 of file tetCellI.H.
References Foam::abort(), Foam::FatalError, FatalErrorIn, and triFace().
|
inline |
Return first face adjacent to the given edge.
Definition at line 91 of file tetCellI.H.
References Foam::abort(), Foam::FatalError, and FatalErrorIn.
|
inline |
Return face adjacent to the given face sharing the same edge.
Definition at line 115 of file tetCellI.H.
References Foam::abort(), Foam::FatalError, and FatalErrorIn.
|
inline |
Return i-th edge.
Definition at line 158 of file tetCellI.H.
References Foam::abort(), Foam::FatalError, and FatalErrorIn.
| Foam::cellShape tetCellShape | ( | ) | const |
Return tet shape cell.
Definition at line 35 of file tetCell.C.
References cellModeller::lookup(), and tetCell::tet().
|
inline |
Return the tetrahedron.
Definition at line 179 of file tetCellI.H.
Referenced by tetCell::tetCellShape().
