pub struct ReducedFace {
pub representatives: Vec<ConstraintRowId>,
pub dependence: Vec<Vec<ConstraintRowDependence>>,
pub tight_rows: Vec<ConstraintRowId>,
}Expand description
The result of reducing a tight active face to a minimal independent set — the
shared output of the ConstraintSet reduced-face op (Dense arm =
dense_reduced_face; KhatriRaoCone / BlockDiagonal arms produce the same
shape). Determinism: representatives are the lowest-flat-index row per
independent direction, ascending, with no float tie-break.
INDEX SPACE: every id here is a ConstraintRowId in the reduced set’s own
constraint-row space (0..nrows()), addressing values() / bound() /
row_norm(). It is NOT a coefficient index; to reach β coordinates go
through gam_problem::ConstraintSet::row_column_support.
Fields§
§representatives: Vec<ConstraintRowId>Kept independent rows — the lowest-flat-index representative per direction,
ascending. Flat id space is 0..nrows (Dense) / slot*n + obs (cone) /
the concatenation of the member row spaces (block-diagonal).
dependence: Vec<Vec<ConstraintRowDependence>>Per-representative parallel-dependent map, index-aligned with
representatives. dependence[i] lists the exactly-parallel dependents of
representatives[i] (empty when it has none); general-position dependents
are absent (dropped, re-enter on the next feasibility scan).
tight_rows: Vec<ConstraintRowId>The full tight set that was reduced, ascending flat ids.
Trait Implementations§
Source§impl Clone for ReducedFace
impl Clone for ReducedFace
Source§fn clone(&self) -> ReducedFace
fn clone(&self) -> ReducedFace
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreAuto Trait Implementations§
impl Freeze for ReducedFace
impl RefUnwindSafe for ReducedFace
impl Send for ReducedFace
impl Sync for ReducedFace
impl Unpin for ReducedFace
impl UnsafeUnpin for ReducedFace
impl UnwindSafe for ReducedFace
Blanket Implementations§
impl<T> Allocation for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.