33 template<
unsigned Size>
47 if (doReduce && Pstream::parRun())
50 min_ =
point(vGreat, vGreat, vGreat);
51 max_ =
point(-vGreat, -vGreat, -vGreat);
56 min_ = points[indices[0]];
57 max_ = points[indices[0]];
59 for (
unsigned i=1; i < Size; ++i)
77 template<
unsigned Size>
92 if (!contains(points[indices[i]]))
102 template<
unsigned Size>
117 if (contains(points[indices[i]]))
boundBox()
Construct null, setting points to zero.
#define forAll(list, i)
Loop across all elements in list.
bool empty() const
Return true if the UList is empty (ie, size() is zero)
Inter-processor communication reduction functions.
A 1D vector of objects of type <T> with a fixed size <Size>.
dimensioned< Type > max(const dimensioned< Type > &, const dimensioned< Type > &)
bool contains(const point &) const
Contains point? (inside or on edge)
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
dimensioned< Type > min(const dimensioned< Type > &, const dimensioned< Type > &)
void reduce(const List< UPstream::commsStruct > &comms, T &Value, const BinaryOp &bop, const int tag, const label comm)
vector point
Point is a vector.
bool containsAny(const UList< point > &) const
Contains any of the points? (inside or on edge)