pub struct Discrete(pub usize);
Expand description
Defines a set of discrete integers starting at 0.
The value held by this structure defines the largest inclusive value that exists within the derived set.
TODO: Update to support negative values.
Tuple Fields§
§0: usize
Trait Implementations§
source§impl Ord for Discrete
impl Ord for Discrete
source§impl PartialEq<Discrete> for Discrete
impl PartialEq<Discrete> for Discrete
source§impl PartialOrd<Discrete> for Discrete
impl PartialOrd<Discrete> for Discrete
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl Eq for Discrete
impl StructuralEq for Discrete
impl StructuralPartialEq for Discrete
Auto Trait Implementations§
impl RefUnwindSafe for Discrete
impl Send for Discrete
impl Sync for Discrete
impl Unpin for Discrete
impl UnwindSafe for Discrete
Blanket Implementations§
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<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.