88 bool faceAlignedEdge(
const label,
const label)
const;
93 const label superFacei,
94 const label thisEdgeI,
98 bool isCellFeatureEdge(
const scalar,
const label)
const;
103 const label superFacei,
107 void calcSuperFaces()
const;
bool found(const Key &key) const
Return true if hashed entry is found in table.
A HashTable to objects of type <T> with a label key.
bool isFeaturePoint(const label edge0, const label edge1) const
Are two edges connected at feature point?
bool isFeatureVertex(const label facei, const label vertI) const
Is vertexI on facei used by two edges that form feature.
bool isFeatureEdge(const label edgeI) const
Is edge a feature edge (uniquely determined since on cell.
const List< DynamicList< label > > & faceMap() const
New to old faceMap. Guaranteed to be shrunk.
~cellFeatures()
Destructor.
const faceList & faces() const
const labelHashSet & featureEdge() const
Cell-face mesh analysis engine.