Go to the documentation of this file.
40 const label oldLen = list.size();
43 for (label i = oldLen; i > 0; --i)
45 list[i] = std::move(list[i-1]);
65 point(
x.first(),
y.first(), z.first()),
66 point(
x.last(),
y.last(), z.last())
74 return Vector<gradingDescriptors>
99 for (
const label nDiv : divisions_)
120 knots[i+1] - knots[i],
141 divisions_.resize(len,
Zero);
142 expansion_.resize(len,
Zero);
157 if (knots.size() && (
p <= knots.last()))
160 <<
"Cannot append point " <<
p
161 <<
" which is <= last value " << knots.last() <<
endl;
168 <<
"Negative or zero divisions " << nDiv <<
endl;
175 expRatio = 1.0/(-expRatio);
177 else if (
equal(expRatio, 0))
184 divisions_.append(nDiv);
185 expansion_.append(expRatio);
200 if (knots.size() && (
p >= knots.first()))
203 <<
"Cannot prepend point " <<
p
204 <<
" which is >= first value " << knots.first() <<
endl;
211 <<
"Negative or zero divisions " << nDiv <<
endl;
218 expRatio = 1.0/(-expRatio);
220 else if (
equal(expRatio, 0))
267 for (label edgei = 0; edgei < this->nCells(); ++edgei)
278 if (scalarList::empty() ||
p < first() ||
p > last())
282 else if (
equal(
p, first()))
286 else if (
equal(
p, last()))
290 else if (
p < first() ||
p > last())
308 if (scalarList::empty())
318 return scalarList::size()-1;
320 else if (
p < first() ||
p > last())
328 scalar
delta = GREAT;
330 for (
const scalar& val : *
this)
List< scalar > scalarList
A List of scalars.
static const char *const componentNames[]
void resize(const label len)
static constexpr const zero Zero
Vector< gradingDescriptors > grading() const
scalarMinMax edgeLimits() const
void append(const T &val)
static void prependList(List< T > &list, const T &val)
Ostream & endl(Ostream &os)
virtual Ostream & beginBlock(const keyType &kw)
void prepend(const scalar p, label nDiv, scalar expRatio=1)
List of gradingDescriptor for the sections of a block with additional IO functionality.
const boundBox & bounds() const
Vector< label > labelVector
Vector of labels.
void append(const scalar p, label nDiv, scalar expRatio=1)
scalar diff(const triad &A, const triad &B)
label findCell(const scalar p) const
label findLower(const ListType &input, const T &val, const label start, const ComparePredicate &comp)
const labelVector & sizes() const
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
@ END_STATEMENT
End entry [isseparator].
label max(const labelHashSet &set, label maxValue=labelMin)
virtual Ostream & endBlock()
OBJstream os(runTime.globalPath()/outputName)
FlatOutput::OutputAdaptor< Container, Delimiters > flatOutput(const Container &obj, Delimiters delim)
Ostream & indent(Ostream &os)
gradingDescriptors grading() const
Handles the specification for grading within a section of a block.
Templated 3D Vector derived from VectorSpace adding construction from 3 components,...
MinMax< T > & add(const MinMax &other)
label findIndex(const scalar p, const scalar tol) const
dimensioned< typename typeOfMag< Type >::type > mag(const dimensioned< Type > &dt)
void writeDict(Ostream &os, const direction cmpt) const
A bounding box defined in terms of min/max extrema points.
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
vector point
Point is a vector.
bool equal(const T &s1, const T &s2)
#define WarningInFunction
A min/max value pair with additional methods. In addition to conveniently storing values,...
static constexpr direction nComponents