indexedOctree< Type > Member List

This is the complete list of members for indexedOctree< Type >, including all inherited members.

bb() const indexedOctree< Type >inline
clone() const indexedOctree< Type >inline
contents() const indexedOctree< Type >inline
findBox(const treeBoundBox &bb) const indexedOctree< Type >
findIndices(const point &) const indexedOctree< Type >
findInside(const point &) const indexedOctree< Type >
findLine(const point &start, const point &end) const indexedOctree< Type >
findLine(const point &start, const point &end, const FindIntersectOp &fiOp) const indexedOctree< Type >
findLine(const bool findAny, const point &treeStart, const point &treeEnd, const label startNodeI, const direction startOctant, const FindIntersectOp &fiOp, const bool verbose) const indexedOctree< Type >
findLine(const bool findAny, const point &start, const point &end, const FindIntersectOp &fiOp) const indexedOctree< Type >
findLine(const point &start, const point &end, const FindIntersectOp &fiOp) const indexedOctree< Type >
findLineAny(const point &start, const point &end) const indexedOctree< Type >
findLineAny(const point &start, const point &end, const FindIntersectOp &fiOp) const indexedOctree< Type >
findLineAny(const point &start, const point &end, const FindIntersectOp &fiOp) const indexedOctree< Type >
findNear(const scalar nearDist, const indexedOctree< Type > &tree2, CompareOp &cop) const indexedOctree< Type >
findNearest(const point &sample, const scalar nearestDistSqr) const indexedOctree< Type >
findNearest(const point &sample, const scalar nearestDistSqr, const FindNearestOp &fnOp) const indexedOctree< Type >
findNearest(const label nodeI, const point &, scalar &nearestDistSqr, label &nearestShapeI, point &nearestPoint, const FindNearestOp &fnOp) const indexedOctree< Type >
findNearest(const linePointRef &ln, treeBoundBox &tightest, point &linePoint) const indexedOctree< Type >
findNearest(const linePointRef &ln, treeBoundBox &tightest, point &linePoint, const FindNearestOp &fnOp) const indexedOctree< Type >
findNearest(const point &sample, const scalar startDistSqr, const FindNearestOp &fnOp) const indexedOctree< Type >
findNearest(const linePointRef &ln, treeBoundBox &tightest, point &linePoint, const FindNearestOp &fnOp) const indexedOctree< Type >
findNode(const label nodeI, const point &) const indexedOctree< Type >
findSphere(const point &centre, const scalar radiusSqr) const indexedOctree< Type >
getContent(const labelBits i)indexedOctree< Type >inlinestatic
getNode(const labelBits i)indexedOctree< Type >inlinestatic
getOctant(const labelBits i)indexedOctree< Type >inlinestatic
getSide(const vector &outsideNormal, const vector &vec)indexedOctree< Type >static
getVolumeType(const point &) const indexedOctree< Type >
indexedOctree(const Type &shapes)indexedOctree< Type >
indexedOctree(const Type &shapes, const List< node > &nodes, const labelListList &contents)indexedOctree< Type >
indexedOctree(const Type &shapes, const treeBoundBox &bb, const label maxLevels, const scalar maxLeafRatio, const scalar maxDuplicity)indexedOctree< Type >
indexedOctree(const Type &shapes, Istream &is)indexedOctree< Type >
isContent(const labelBits i)indexedOctree< Type >inlinestatic
isEmpty(const labelBits i)indexedOctree< Type >inlinestatic
isNode(const labelBits i)indexedOctree< Type >inlinestatic
nodes() const indexedOctree< Type >inline
operator(Ostream &, const indexedOctree< Type > &)indexedOctree< Type >friend
overlaps(const point &bbMin, const point &bbMax, const scalar nearestDistSqr, const point &sample)indexedOctree< Type >static
perturbTol()indexedOctree< Type >static
print(prefixOSstream &, const bool printContents, const label) const indexedOctree< Type >
shapes() const indexedOctree< Type >inline
write(Ostream &os) const indexedOctree< Type >