An analytical geometric cellShape. More...
#include <OpenFOAM/cellShape.H>
An analytical geometric cellShape.
The optional collapse functionality changes the cellModel to the correct type after removing any duplicate points.
Definition at line 70 of file cellShape.H.
Public Member Functions | |
cellShape () | |
Construct null. | |
cellShape (const cellModel &, const labelList &, const bool doCollapse=false) | |
Construct from components. | |
cellShape (Istream &is) | |
Construct from Istream. | |
autoPtr< cellShape > | clone () const |
Clone. | |
pointField | points (const pointField &meshPoints) const |
Return the points corresponding to this cellShape. | |
const cellModel & | model () const |
Model reference. | |
labelList | meshFaces (const faceList &allFaces, const cell &) const |
Mesh face labels of this cell (in order of model) | |
labelList | meshEdges (const edgeList &allEdges, const labelList &) const |
Mesh edge labels of this cell (in order of model) | |
faceList | faces () const |
Faces of this cell. | |
faceList | collapsedFaces () const |
Collapsed faces of this cell. | |
label | nFaces () const |
Number of faces. | |
edgeList | edges () const |
Edges of this cellShape. | |
label | nEdges () const |
Number of edges. | |
label | nPoints () const |
Number of points. | |
point | centre (const pointField &) const |
Centroid of the cell. | |
Foam::InfoProxy< cellShape > | info () const |
Return info proxy. | |
scalar | mag (const pointField &) const |
Scalar magnitude. | |
void | collapse () |
Collapse shape to correct one after removing duplicate vertices. | |
![]() | |
label | size () const |
Return the number of elements in the UList. | |
List () | |
Null constructor. | |
List (const label) | |
Construct with given size. | |
List (const label, const label &) | |
Construct with given size and value for all elements. | |
List (const List< label > &) | |
Copy constructor. | |
List (const Xfer< List< label > > &) | |
Construct by transferring the parameter contents. | |
List (List< label > &, bool reUse) | |
Construct as copy or re-use as specified. | |
List (const UList< label > &, const unallocLabelList &mapAddressing) | |
Construct as subset. | |
List (InputIterator first, InputIterator last) | |
Construct given start and end iterators. | |
List (const FixedList< label, Size > &) | |
Construct as copy of FixedList<T, Size> | |
List (const PtrList< label > &) | |
Construct as copy of PtrList<T> | |
List (const SLList< label > &) | |
Construct as copy of SLList<T> | |
List (const IndirectList< label > &) | |
Construct as copy of IndirectList<T> | |
List (const UIndirectList< label > &) | |
Construct as copy of UIndirectList<T> | |
List (const BiIndirectList< label > &) | |
Construct as copy of BiIndirectList<T> | |
List (Istream &) | |
Construct from Istream. | |
~List () | |
void | resize (const label) |
Reset size of List. | |
void | resize (const label, const label &) |
Reset size of List and value for new elements. | |
void | setSize (const label) |
Reset size of List. | |
void | setSize (const label, const label &) |
Reset size of List and value for new elements. | |
void | clear () |
Clear the list, i.e. set size to zero. | |
void | append (const UList< label > &) |
Append a List at the end of this list. | |
void | append (const UIndirectList< label > &) |
Append a UIndirectList at the end of this list. | |
void | transfer (List< label > &) |
Transfer the contents of the argument List into this list. | |
void | transfer (DynamicList< label, SizeInc, SizeMult, SizeDiv > &) |
Transfer the contents of the argument List into this list. | |
void | transfer (SortableList< label > &) |
Transfer the contents of the argument List into this list. | |
Xfer< List< label > > | xfer () |
Transfer contents to the Xfer container. | |
label & | newElmt (const label) |
Return subscript-checked element of UList. | |
void | operator= (const UList< label > &) |
Assignment from UList operator. Takes linear time. | |
void | operator= (const List< label > &) |
Assignment operator. Takes linear time. | |
void | operator= (const SLList< label > &) |
Assignment from SLList operator. Takes linear time. | |
void | operator= (const IndirectList< label > &) |
Assignment from IndirectList operator. Takes linear time. | |
void | operator= (const UIndirectList< label > &) |
Assignment from UIndirectList operator. Takes linear time. | |
void | operator= (const BiIndirectList< label > &) |
Assignment from BiIndirectList operator. Takes linear time. | |
void | operator= (const label &) |
Assignment of all entries to the given value. | |
![]() | |
UList () | |
Null constructor. | |
UList (label *__restrict__ 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. | |
label | byteSize () const |
Return the binary size in number of characters of the UList. | |
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 | writeEntry (Ostream &) const |
Write the UList as a dictionary entry. | |
void | writeEntry (const word &keyword, Ostream &) const |
Write the UList as a dictionary entry with keyword. | |
void | assign (const UList< label > &) |
Assign elements to those from UList. | |
label & | operator[] (const label) |
Return element of UList. | |
const label & | operator[] (const label) const |
Return element of constant UList. | |
operator const Foam::List< label > & () const | |
Allow cast to a const List<T>&. | |
iterator | begin () |
Return an iterator to begin traversing the UList. | |
const_iterator | begin () const |
Return const_iterator to begin traversing the constant UList. | |
iterator | end () |
Return an iterator to end traversing the UList. | |
const_iterator | end () const |
Return const_iterator to end traversing the constant UList. | |
const_iterator | cbegin () const |
Return const_iterator to begin traversing the constant UList. | |
const_iterator | cend () const |
Return const_iterator to end traversing the constant UList. | |
reverse_iterator | rbegin () |
Return reverse_iterator to begin reverse traversing the UList. | |
const_reverse_iterator | rbegin () const |
Return const_reverse_iterator to begin reverse traversing the UList. | |
reverse_iterator | rend () |
Return reverse_iterator to end reverse traversing the UList. | |
const_reverse_iterator | rend () const |
Return const_reverse_iterator to end reverse traversing the UList. | |
const_reverse_iterator | crbegin () const |
Return const_reverse_iterator to begin reverse traversing the UList. | |
const_reverse_iterator | crend () const |
Return const_reverse_iterator to end reverse traversing the UList. | |
label | max_size () const |
Return size of the largest possible UList. | |
bool | empty () const |
Return true if the UList is empty (ie, size() is zero). | |
void | swap (UList< label > &) |
Swap two ULists of the same type in constant time. | |
bool | operator== (const UList< label > &) const |
Equality operation on ULists of the same type. | |
bool | operator!= (const UList< label > &) const |
The opposite of the equality operation. Takes linear time. | |
bool | operator< (const UList< label > &) const |
Compare two ULists lexicographically. Takes linear time. | |
bool | operator> (const UList< label > &) const |
Compare two ULists lexicographically. Takes linear time. | |
bool | operator<= (const UList< label > &) const |
Return true if !(a > b). Takes linear time. | |
bool | operator>= (const UList< label > &) const |
Return true if !(a < b). Takes linear time. |
Friends | |
bool | operator== (const cellShape &, const cellShape &) |
Istream & | operator>> (Istream &, cellShape &) |
Ostream & | operator<< (Ostream &, const cellShape &) |
Additional Inherited Members | |
![]() | |
typedef SubList< label > | subList |
Declare type of subList. | |
![]() | |
typedef label | value_type |
Type of values the UList 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 UList. | |
typedef label * | iterator |
Random access iterator for traversing UList. | |
typedef const label * | const_iterator |
Random access iterator for traversing UList. | |
typedef label * | reverse_iterator |
Reverse iterator for reverse traversal of UList. | |
typedef const label * | const_reverse_iterator |
Reverse iterator for reverse traversal of constant UList. | |
![]() | |
static const List< label > & | null () |
Return a null List. | |
![]() | |
void | size (const label) |
Override size to be inconsistent with allocated storage. |
|
inline |
Construct null.
Definition at line 31 of file cellShapeI.H.
Construct from components.
Definition at line 38 of file cellShapeI.H.
Construct from Istream.
Definition at line 54 of file cellShapeI.H.
|
inline |
|
inline |
Return the points corresponding to this cellShape.
Definition at line 69 of file cellShapeI.H.
|
inline |
|
inline |
Mesh face labels of this cell (in order of model)
Definition at line 95 of file cellShapeI.H.
References forAll, and List< T >::size().
|
inline |
Mesh edge labels of this cell (in order of model)
Definition at line 129 of file cellShapeI.H.
References e, forAll, and List< T >::size().
|
inline |
Faces of this cell.
Definition at line 162 of file cellShapeI.H.
|
inline |
Collapsed faces of this cell.
Definition at line 168 of file cellShapeI.H.
References f(), forAll, List< T >::setSize(), and List< T >::size().
Referenced by degenerateMatcher::match().
|
inline |
Number of faces.
Definition at line 217 of file cellShapeI.H.
|
inline |
Edges of this cellShape.
Definition at line 223 of file cellShapeI.H.
|
inline |
Number of edges.
Definition at line 229 of file cellShapeI.H.
|
inline |
Number of points.
Definition at line 235 of file cellShapeI.H.
|
inline |
Centroid of the cell.
Definition at line 241 of file cellShapeI.H.
References Vector< Cmpt >::centre().
|
inline |
Return info proxy.
Used to print token information to a stream
Definition at line 143 of file cellShape.H.
|
inline |
Scalar magnitude.
Definition at line 247 of file cellShapeI.H.
void collapse | ( | ) |
Collapse shape to correct one after removing duplicate vertices.
Definition at line 34 of file cellShape.C.
References List< label >::operator=().