pub struct FullConformalSet {
pub intervals: Vec<ConformalInterval>,
pub alpha: f64,
pub n_augmented: usize,
pub boundary_margin: f64,
}Expand description
The exact full-conformal prediction set: a finite union of closed intervals, plus the diagnostics the Layer-3 certificate consumes.
Fields§
§intervals: Vec<ConformalInterval>Maximal intervals, sorted, disjoint.
alpha: f64Miscoverage level the set was built for.
n_augmented: usizen + 1 (augmented count) — the denominator of the conformal rank.
boundary_margin: f64The decision margin: the smallest |e_i − e_*| gap over rank
comparisons whose flip can change membership. Critical ties
contribute zero. When the set has no finite boundary (all of ℝ or
empty), the margin is the analytic infimum of the local rank-decision
margin over the whole candidate line; +∞ is reserved for the case
where membership needs no score comparison at all.
Trait Implementations§
Source§impl Clone for FullConformalSet
impl Clone for FullConformalSet
Source§fn clone(&self) -> FullConformalSet
fn clone(&self) -> FullConformalSet
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for FullConformalSet
impl RefUnwindSafe for FullConformalSet
impl Send for FullConformalSet
impl Sync for FullConformalSet
impl Unpin for FullConformalSet
impl UnsafeUnpin for FullConformalSet
impl UnwindSafe for FullConformalSet
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
Mutably borrows from an owned value. Read more
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>
Converts
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>
Converts
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>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
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
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.