dedekind::optimization::LPSolutionPredicate< T > Struct Template Reference

:expressions predicate carrying the LP's runtime optimal locus as (point, feasible) value-level state. More...

Public Types
using	Domain = dedekind::linear_algebra::Vec2V<T>
using	cardinality_type = dedekind::sets::Finite

Public Member Functions
constexpr bool	operator() (const Domain &v) const

Public Attributes
Domain	point
bool	feasible

Detailed Description

template<typename T>
struct dedekind::optimization::LPSolutionPredicate< T >

:expressions predicate carrying the LP's runtime optimal locus as (point, feasible) value-level state.

Used as the predicate of the runtime entries' output Set: membership is feasible && v == point , so the Set is a singleton {point} when the LP is feasible and empty when it isn't. Mirrors Singleton2DPredicate / EmptyPredicate on the NTTP path; the type-level regime there becomes a value- level regime here, with the same Set carrier on both sides of the bridge. Callers may use Set::contains for membership queries or inspect the predicate's point / feasible directly when scalar extraction is needed (e.g. interop with Python).

---

The documentation for this struct was generated from the following file:

• src/main/modules/dedekind/optimization/lp.cppm