83 for (
const label pointi : indices)
85 if (pointi >= 0 && pointi < len)
93template<
class IntContainer>
97 const IntContainer& indices
108 for (
const label pointi : indices)
110 if (pointi >= 0 && pointi < len)
132 for (
const label pointi : indices)
134 if (pointi >= 0 && pointi < len)
136 if (!contains(
points[pointi]))
147template<
class IntContainer>
151 const IntContainer& indices
161 for (
const label pointi : indices)
163 if (pointi >= 0 && pointi < len)
165 if (!contains(
points[pointi]))
192 for (
const label pointi : indices)
194 if (pointi >= 0 && pointi < len)
196 if (contains(
points[pointi]))
209template<
class IntContainer>
213 const IntContainer& indices
225 for (
const label pointi : indices)
227 if (pointi >= 0 && pointi < len)
229 if (contains(
points[pointi]))
A 1D vector of objects of type <T> with a fixed length <N>.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
void size(const label n)
Older name for setAddressableSize.
A bounding box defined in terms of min/max extrema points.
void reduce()
Parallel reduction of min/max values.
bool contains(const point &pt) const
Contains point? (inside or on edge)
void add(const boundBox &bb)
Extend to include the second box.
boundBox()
Construct without any points - an inverted bounding box.
bool containsAny(const UList< point > &points) const
Contains any of the points? (inside or on edge)
tmp< pointField > points() const
Corner points in an order corresponding to a 'hex' cell.
Sums a given list of (at least two or more) fields and outputs the result into a new field,...
void add(FieldField< Field1, typename typeOfSum< Type1, Type2 >::type > &f, const FieldField< Field1, Type1 > &f1, const FieldField< Field2, Type2 > &f2)