33 template<
unsigned Size>
50 min_ =
point(vGreat, vGreat, vGreat);
51 max_ =
point(-vGreat, -vGreat, -vGreat);
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]]))
Inter-processor communication reduction functions.
#define forAll(list, i)
Loop across all elements in list.
A 1D vector of objects of type <T> with a fixed size <Size>.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
bool empty() const
Return true if the UList is empty (ie, size() is zero)
static bool & parRun()
Is this a parallel run?
bool contains(const point &) const
Contains point? (inside or on edge)
bool containsAny(const UList< point > &) const
Contains any of the points? (inside or on edge)
boundBox()
Construct null, setting points to zero.
tmp< pointField > points() const
Return corner points in an order corresponding to a 'hex' cell.
vector point
Point is a vector.
layerAndWeight min(const layerAndWeight &a, const layerAndWeight &b)
void reduce(const List< UPstream::commsStruct > &comms, T &Value, const BinaryOp &bop, const int tag, const label comm)
layerAndWeight max(const layerAndWeight &a, const layerAndWeight &b)