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());
iterator end() noexcept
Return an iterator to end traversing the UList.
Define a curved edge that is parameterized for 0<lambda<1 between the start/end points.
point linearPosition(const scalar lambda) const
The point position in the straight line.
const point & lastPoint() const
The location of the last point.
bool valid() const noexcept
True if first/last indices are unique and non-negative.
const label end_
Index of the last point.
label end() const noexcept
Index of end (last) point.
label start() const noexcept
Index of start (first) point.
const label start_
Index of the first point.
int compare(const blockEdge &e) const
Compare the given start/end points with this block edge.
const point & firstPoint() const
The location of the first point.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
#define InfoInFunction
Report an information message using Foam::Info.
constexpr char nl
The newline '\n' character (0x0a)
dimensionedScalar lambda("lambda", dimTime/sqr(dimLength), laminarTransport)