51 return points_[start_];
63 if (start_ == start && end_ ==
end)
67 else if (start_ ==
end && end_ == start)
91 if (lambda < -SMALL || lambda > 1 + SMALL)
94 <<
"Limit parameter to [0-1] range: " <<
lambda <<
nl;
102 else if (
lambda >= 1 - SMALL)
107 return firstPoint() +
lambda * (lastPoint() - firstPoint());
constexpr char nl
The newline '\n' character (0x0a)
bool good() const noexcept
True if first/last indices are unique and non-negative.
label end() const noexcept
Index of end (last) point.
point linearPosition(const scalar lambda) const
The point position in the straight line.
const dimensionedScalar e
Elementary charge.
int compare(const blockEdge &e) const
Compare the given start/end points with this block edge.
An edge is a list of two vertex labels. This can correspond to a directed graph edge or an edge on a ...
dimensionedScalar lambda("lambda", dimTime/sqr(dimLength), laminarTransport)
const point & lastPoint() const
The location of the last point.
A Vector of values with scalar precision, where scalar is float/double depending on the compilation f...
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
Define a curved edge that is parameterized for 0<lambda<1 between the start/end points.
const label start_
Index of the first point.
label start() const noexcept
Index of start (first) point.
const point & firstPoint() const
The location of the first point.
const label end_
Index of the last point.
#define InfoInFunction
Report an information message using Foam::Info.