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());
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
point linearPosition(const scalar lambda) const
label end() const noexcept
dimensionedScalar lambda("lambda", dimTime/sqr(dimLength), laminarTransport)
constexpr auto end(C &c) -> decltype(c.end())
label start() const noexcept
int compare(const blockEdge &e) const
const point & firstPoint() const
bool valid() const noexcept
const dimensionedScalar e