Class containing opposite face for a prismatic cell with addressing and a possibility of failure.
More...
|
| oppositeFace (const face &f, const label masterIndex, const label oppositeIndex) |
|
label | masterIndex () const |
|
label | oppositeIndex () const |
|
bool | found () const |
|
constexpr | face () noexcept=default |
|
| face (const label sz) |
|
| face (const labelUList &list) |
|
| face (labelList &&list) |
|
| face (std::initializer_list< label > list) |
|
template<unsigned N> |
| face (const FixedList< label, N > &list) |
|
| face (const labelUList &list, const labelUList &indices) |
|
template<unsigned N> |
| face (const labelUList &list, const FixedList< label, N > &indices) |
|
| face (const triFace &f) |
|
| face (Istream &is) |
|
label | collapse () |
|
void | flip () |
|
pointField | points (const UList< point > &pts) const |
|
point | centre (const UList< point > &points) const |
|
template<class Type > |
Type | average (const UList< point > &meshPoints, const Field< Type > &fld) const |
|
vector | areaNormal (const UList< point > &p) const |
|
vector | unitNormal (const UList< point > &p) const |
|
| FOAM_DEPRECATED_FOR (2018-12, "areaNormal() or unitNormal()") vector normal(const UList< point > &p) const |
|
scalar | mag (const UList< point > &p) const |
|
face | reverseFace () const |
|
label | which (const label pointLabel) const |
|
label | thisLabel (const label i) const |
|
label | nextLabel (const label i) const |
|
label | prevLabel (const label i) const |
|
scalar | sweptVol (const UList< point > &oldPoints, const UList< point > &newPoints) const |
|
tensor | inertia (const UList< point > &p, const point &refPt=vector::zero, scalar density=1.0) const |
|
pointHit | ray (const point &p, const vector &n, const UList< point > &meshPoints, const intersection::algorithm alg=intersection::FULL_RAY, const intersection::direction dir=intersection::VECTOR) const |
|
pointHit | intersection (const point &p, const vector &q, const point &ctr, const UList< point > &meshPoints, const intersection::algorithm alg, const scalar tol=0.0) const |
|
pointHit | nearestPoint (const point &p, const UList< point > &meshPoints) const |
|
pointHit | nearestPointClassify (const point &p, const UList< point > &meshPoints, label &nearType, label &nearLabel) const |
|
int | sign (const point &p, const UList< point > &points, const scalar tol=SMALL) const |
|
scalar | contactSphereDiameter (const point &p, const vector &n, const UList< point > &meshPoints) const |
|
scalar | areaInContact (const UList< point > &meshPoints, const scalarField &v) const |
|
label | nEdges () const noexcept |
|
Foam::edge | edge (const label edgei) const |
|
vector | edge (const label edgei, const UList< point > &pts) const |
|
Foam::edge | rcEdge (const label edgei) const |
|
vector | rcEdge (const label edgei, const UList< point > &pts) const |
|
edgeList | edges () const |
|
edgeList | rcEdges () const |
|
int | edgeDirection (const Foam::edge &e) const |
|
label | longestEdge (const UList< point > &pts) const |
|
label | nTriangles () const |
|
label | nTriangles (const UList< point > &unused) const |
|
label | triangles (const UList< point > &points, label &triI, faceList &triFaces) const |
|
template<int SizeMin> |
label | triangles (const UList< point > &points, DynamicList< face, SizeMin > &triFaces) const |
|
label | nTrianglesQuads (const UList< point > &points, label &nTris, label &nQuads) const |
|
label | trianglesQuads (const UList< point > &points, label &triI, label &quadI, faceList &triFaces, faceList &quadFaces) const |
|
unsigned | hash_code (unsigned seed=0) const |
|
unsigned | symmhash_code (unsigned seed=0) const |
|
Foam::edge | faceEdge (label edgei) const |
|
template<int SizeMin> |
Foam::label | triangles (const UList< point > &points, DynamicList< face, SizeMin > &triFaces) const |
|
constexpr | List () noexcept |
|
| List (const label len) |
|
| List (const label len, const T &val) |
|
| List (const label len, const Foam::zero) |
|
| List (const Foam::one, const T &val) |
|
| List (const Foam::one, T &&val) |
|
| List (const Foam::one, const Foam::zero) |
|
| List (const List< T > &a) |
|
| List (const UList< T > &a) |
|
| List (List< T > &a, bool reuse) |
|
| List (const UList< T > &list, const labelUList &indices) |
|
template<unsigned N> |
| List (const UList< T > &list, const FixedList< label, N > &indices) |
|
template<unsigned N> |
| List (const FixedList< T, N > &list) |
|
| List (const PtrList< T > &list) |
|
| List (const SLList< T > &list) |
|
template<class Addr > |
| List (const IndirectListBase< T, Addr > &list) |
|
| List (std::initializer_list< T > list) |
|
| List (List< T > &&list) |
|
template<int SizeMin> |
| List (DynamicList< T, SizeMin > &&list) |
|
| List (SortableList< T > &&list) |
|
| List (SLList< T > &&list) |
|
| List (Istream &is) |
|
autoPtr< List< T > > | clone () const |
|
| ~List () |
|
void | clear () |
|
void | resize (const label len) |
|
void | resize (const label len, const T &val) |
|
void | resize_nocopy (const label len) |
|
void | setSize (const label n) |
|
void | setSize (const label n, const T &val) |
|
void | append (const T &val) |
|
void | append (T &&val) |
|
void | append (const UList< T > &list) |
|
template<class Addr > |
void | append (const IndirectListBase< T, Addr > &list) |
|
label | appendUniq (const T &val) |
|
void | transfer (List< T > &list) |
|
template<int SizeMin> |
void | transfer (DynamicList< T, SizeMin > &list) |
|
void | transfer (SortableList< T > &list) |
|
T & | newElmt (const label i) |
|
void | operator= (const UList< T > &a) |
|
void | operator= (const List< T > &list) |
|
void | operator= (const SLList< T > &list) |
|
template<class Addr > |
void | operator= (const IndirectListBase< T, Addr > &list) |
|
template<unsigned N> |
void | operator= (const FixedList< T, N > &list) |
|
void | operator= (std::initializer_list< T > list) |
|
void | operator= (const T &val) |
|
void | operator= (const Foam::zero) |
|
void | operator= (List< T > &&list) |
|
template<int SizeMin> |
void | operator= (DynamicList< T, SizeMin > &&list) |
|
void | operator= (SortableList< T > &&list) |
|
void | operator= (SLList< T > &&list) |
|
Istream & | readList (Istream &is) |
|
void | shallowCopy (const UList< T > &)=delete |
|
template<class TypeT = T> |
std::enable_if< std::is_same< bool, TypeT >::value, bool >::type | set (const label i, bool val=true) |
|
template<class T > |
| List (const label len) |
|
template<class T > |
| List (const label len, const T &val) |
|
template<class T > |
| List (const label len, const Foam::zero) |
|
template<class T > |
| List (const Foam::one, const T &val) |
|
template<class T > |
| List (const Foam::one, T &&val) |
|
template<class T > |
| List (const Foam::one, const Foam::zero) |
|
template<class T > |
| List (const UList< T > &a) |
|
template<class T > |
| List (const List< T > &a) |
|
template<class T > |
| List (List< T > &a, bool reuse) |
|
template<class T > |
| List (const UList< T > &list, const labelUList &indices) |
|
template<class T > |
| List (const PtrList< T > &list) |
|
template<class T > |
| List (const SLList< T > &list) |
|
template<class T > |
| List (std::initializer_list< T > list) |
|
template<class T > |
| List (List< T > &&list) |
|
template<class T > |
| List (SortableList< T > &&list) |
|
template<class T > |
| List (SLList< T > &&list) |
|
template<class T > |
void | transfer (List< T > &list) |
|
template<class T > |
void | transfer (SortableList< T > &list) |
|
template<class T > |
void | operator= (const UList< T > &a) |
|
template<class T > |
void | operator= (const List< T > &list) |
|
template<class T > |
void | operator= (const SLList< T > &list) |
|
template<class T > |
void | operator= (std::initializer_list< T > list) |
|
template<class T > |
void | operator= (List< T > &&list) |
|
template<class T > |
void | operator= (SortableList< T > &&list) |
|
template<class T > |
void | operator= (SLList< T > &&list) |
|
Istream & | readList (Istream &is) |
|
template<class T > |
constexpr | List () noexcept |
|
void | resize (const label newLen) |
|
template<class T > |
void | append (const T &val) |
|
template<class T > |
void | append (T &&val) |
|
template<class T > |
void | append (const UList< T > &list) |
|
template<class T > |
void | operator= (const T &val) |
|
template<class T > |
void | operator= (const Foam::zero) |
|
template<class T > |
| List (Istream &is) |
|
Istream & | readList (Istream &is) |
|
Class containing opposite face for a prismatic cell with addressing and a possibility of failure.
- Source files
-
Definition at line 47 of file oppositeFace.H.