pub enum PartitionEdge {
Fixed(f64),
Crossing {
tau: f64,
},
}Expand description
Provenance of one boundary of a denested partition cell.
Variants§
Fixed(f64)
A z location independent of the row scalars: a score-spline break, or ±∞ for tail cells.
Crossing
A link-knot crossing: the boundary sits at z = (τ - a)/b for the
row’s (a, b).
Implementations§
Trait Implementations§
Source§impl Clone for PartitionEdge
impl Clone for PartitionEdge
Source§fn clone(&self) -> PartitionEdge
fn clone(&self) -> PartitionEdge
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 moreimpl Copy for PartitionEdge
Source§impl Debug for PartitionEdge
impl Debug for PartitionEdge
Source§impl PartialEq for PartitionEdge
impl PartialEq for PartitionEdge
Source§fn eq(&self, other: &PartitionEdge) -> bool
fn eq(&self, other: &PartitionEdge) -> bool
Tests for
self and other values to be equal, and is used by ==.impl StructuralPartialEq for PartitionEdge
Auto Trait Implementations§
impl Freeze for PartitionEdge
impl RefUnwindSafe for PartitionEdge
impl Send for PartitionEdge
impl Sync for PartitionEdge
impl Unpin for PartitionEdge
impl UnsafeUnpin for PartitionEdge
impl UnwindSafe for PartitionEdge
Blanket Implementations§
impl<T> Allocation for T
impl<T> Boilerplate 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,
impl<T> Scalar for T
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.