Go to the documentation of this file.
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());
#define InfoInFunction
Report an information message using Foam::Info.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
Define a curved edge that is parameterized for 0<lambda<1 between the start/end points.
const point & lastPoint() const
The location of the last point.
point linearPosition(const scalar lambda) const
The point position in the straight line.
label end() const noexcept
Index of end (last) point.
const label start_
Index of the first point.
dimensionedScalar lambda("lambda", dimTime/sqr(dimLength), laminarTransport)
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
const label end_
Index of the last point.
label start() const noexcept
Index of start (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.
bool valid() const noexcept
True if first/last indices are unique and non-negative.
const dimensionedScalar e
Elementary charge.