Go to the documentation of this file.
38 #ifndef treeDataFace_H
39 #define treeDataFace_H
109 scalar& nearestDistSqr,
142 point& intersectionPoint
190 inline label
size()
const
192 return faceLabels_.size();
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
Standard boundBox with extra functionality for use in octree.
volumeType getVolumeType(const indexedOctree< treeDataFace > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
const labelList & faceLabels() const
const primitiveMesh & mesh() const
An enumeration wrapper for classification of a location as being inside/outside of a volume.
A patch is a list of labels that address the faces in the global face list.
Non-pointer based hierarchical recursive searching.
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
pointField shapePoints() const
ClassName("treeDataFace")
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
const std::string patch
OpenFOAM patch number as a std::string.
Encapsulation of data needed to search for faces.
bool ln(const fileName &src, const fileName &dst)
Create a softlink. dst should not exist. Returns true if successful.
findNearestOp(const indexedOctree< treeDataFace > &tree)
treeDataFace(const bool cacheBb, const primitiveMesh &mesh, const labelUList &faceLabels)
Construct from mesh, copying subset of faces.
findIntersectOp(const indexedOctree< treeDataFace > &tree)
Cell-face mesh analysis engine.