40 #ifndef cellFeatures_H 41 #define cellFeatures_H 86 bool faceAlignedEdge(
const label,
const label)
const;
91 const label superFacei,
92 const label thisEdgeI,
96 bool isCellFeatureEdge(
const scalar,
const label)
const;
101 const label superFacei,
105 void calcSuperFaces()
const;
const labelHashSet & featureEdge() const
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
const faceList & faces() const
Cell-face mesh analysis engine.
~cellFeatures()
Destructor.
bool found(const Key &) const
Return true if hashedEntry is found in table.
bool isFeatureEdge(const label edgeI) const
Is edge a feature edge (uniquely determined since on cell.
bool isFeatureVertex(const label facei, const label vertI) const
Is vertexI on facei used by two edges that form feature.
bool isFeaturePoint(const label edge0, const label edge1) const
Are two edges connected at feature point?
const List< DynamicList< label > > & faceMap() const
New to old faceMap. Guaranteed to be shrunk.