pub struct BinSpec { /* private fields */ }Expand description
Validated, monotonically increasing bin edges.
Implementations§
Source§impl BinSpec
impl BinSpec
Sourcepub fn uniform(count: usize, min: f64, max: f64) -> RuntimeResult<Self>
pub fn uniform(count: usize, min: f64, max: f64) -> RuntimeResult<Self>
Creates count uniformly spaced bins spanning [min, max].
§Errors
Returns RuntimeError when count is zero or the bounds are
non-finite or not increasing.
Sourcepub fn edges(edges: impl IntoIterator<Item = f64>) -> RuntimeResult<Self>
pub fn edges(edges: impl IntoIterator<Item = f64>) -> RuntimeResult<Self>
Creates bins from explicit, strictly increasing finite edges.
§Errors
Returns RuntimeError when fewer than two edges are supplied or an
edge is non-finite or not strictly increasing.
Sourcepub fn edges_slice(&self) -> &[f64]
pub fn edges_slice(&self) -> &[f64]
Returns the validated bin edges.
Trait Implementations§
Source§impl<'de> Deserialize<'de> for BinSpec
impl<'de> Deserialize<'de> for BinSpec
Source§fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'de>,
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl StructuralPartialEq for BinSpec
Auto Trait Implementations§
impl Freeze for BinSpec
impl RefUnwindSafe for BinSpec
impl Send for BinSpec
impl Sync for BinSpec
impl Unpin for BinSpec
impl UnsafeUnpin for BinSpec
impl UnwindSafe for BinSpec
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,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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.