Go to the documentation of this file.
35 #ifndef searchableSurfaces_H
36 #define searchableSurfaces_H
56 public PtrList<searchableSurface>
112 const bool singleRegionName
153 const word& surfaceName,
219 const scalar initialDistSqr,
220 const scalar convergenceDistSqr,
234 bool checkSizes(
const scalar maxRatio,
const bool report)
const;
240 const autoPtr<writer<scalar> >&,
247 const scalar minQuality,
257 const scalar maxRatio,
258 const scalar tolerance,
259 const autoPtr<writer<scalar> >& setWriter,
260 const scalar minQuality,
274 const searchableSurface&
operator[](
const word&)
const;
wordList names_
Surface names.
vectorField pointField
pointField is a vectorField.
Field< scalar > scalarField
Specialisation of Field<T> for scalar.
IOobject defines the attributes of an object for which implicit objectRegistry management is supporte...
bool checkIntersection(const scalar tol, const autoPtr< writer< scalar > > &, const bool report) const
Do surfaces self-intersect or intersect others.
List< wordList > regionNames_
Region names per surface.
A class for handling words, derived from string.
List< label > labelList
A List of labels.
bool checkQuality(const scalar minQuality, const bool report) const
Check triangle quality.
void findNearestIntersection(const pointField &start, const pointField &end, labelList &surface1, List< pointIndexHit > &hit1, labelList &surface2, List< pointIndexHit > &hit2) const
static bool connected(const triSurface &s, const label edgeI, const pointIndexHit &hit)
Is edge on face.
label checkTopology(const bool report) const
All topological checks. Return number of failed checks.
void writeStats(const List< wordList > &, Ostream &) const
Write some stats.
searchableSurfaces(const searchableSurfaces &)
Disallow default bitwise copy construct.
iterator end()
Return an iterator to end traversing the PtrList.
scalarField samples(nIntervals, 0)
pointIndexHit facesIntersection(const scalar initialDistSqr, const scalar convergenceDistSqr, const point &start) const
Calculate point which is on a set of surfaces.
void findAnyIntersection(const pointField &start, const pointField &end, labelList &surfaces, List< pointIndexHit > &) const
Find any intersection. Return hit point information and.
boundBox bounds() const
Calculate bounding box.
This class describes the interaction of (usually) a face and a point. It carries the info of a succes...
void operator=(const searchableSurfaces &)
Disallow default bitwise assignment.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
Pre-declare SubField and related Field type.
bool checkClosed(const bool report) const
Are all surfaces closed and manifold.
Triangulated surface description with patch information.
void findNearest(const pointField &, const scalarField &nearestDistSqr, labelList &surfaces, List< pointIndexHit > &) const
Find nearest. Return -1 (and a miss()) or surface and nearest.
Base class of (analytical or triangulated) surface. Encapsulates all the search routines....
A templated 1D list of pointers to objects of type <T>, where the size of the array is known and used...
label findSurfaceRegionID(const word &surfaceName, const word ®ionName) const
label findSurfaceID(const word &name) const
Find index of surface. Return -1 if not found.
A list of keyword definitions, which are a keyword followed by any number of values (e....
List< wordList > & regionNames()
const searchableSurface & operator[](const word &) const
Return const reference to searchableSurface by name.
Base class for graphics format writing. Entry points are.
gmvFile<< "tracers "<< particles.size()<< nl;forAllConstIter(Cloud< passiveParticle >, particles, iter){ gmvFile<< iter().position().x()<< " ";}gmvFile<< nl;forAllConstIter(Cloud< passiveParticle >, particles, iter){ gmvFile<< iter().position().y()<< " ";}gmvFile<< nl;forAllConstIter(Cloud< passiveParticle >, particles, iter){ gmvFile<< iter().position().z()<< " ";}gmvFile<< nl;forAll(lagrangianScalarNames, i){ word name=lagrangianScalarNames[i];IOField< scalar > s(IOobject(name, runTime.timeName(), cloud::prefix, mesh, IOobject::MUST_READ, IOobject::NO_WRITE))
bool checkSizes(const scalar maxRatio, const bool report) const
Are all bounding boxes of similar size.
const List< wordList > & regionNames() const
An auto-pointer similar to the STL auto_ptr but with automatic casting to a reference to the type and...
List< labelList > labelListList
A List of labelList.
PointIndexHit< point > pointIndexHit
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
Container for searchableSurfaces.
bool checkNormalOrientation(const bool report) const
Are all (triangulated) surfaces consistent normal orientation.
friend Ostream & operator(Ostream &, const PtrList< T > &)
A bounding box defined in terms of the points at its extremities.
void findAllIntersections(const pointField &start, const pointField &end, labelListList &surfaces, List< List< pointIndexHit > > &) const
Find all intersections in order from start to end. Returns for.
const wordList & names() const
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
vector point
Point is a vector.
ClassName("searchableSurfaces")
label checkGeometry(const scalar maxRatio, const scalar tolerance, const autoPtr< writer< scalar > > &setWriter, const scalar minQuality, const bool report) const
All geometric checks. Return number of failed checks.
word name(const complex &)
Return a string representation of a complex.
labelList allSurfaces_
Indices of all surfaces. Precalculated and stored.