#[repr(i8)]pub enum MaxScore {
Unlimited = 0,
One_Goal = 1,
Three_Goals = 2,
Five_Goals = 3,
}Variants§
Trait Implementations§
Source§impl EndianScalar for MaxScore
impl EndianScalar for MaxScore
fn to_little_endian(self) -> Self
fn from_little_endian(self) -> Self
impl Copy for MaxScore
impl StructuralPartialEq for MaxScore
Auto Trait Implementations§
impl Freeze for MaxScore
impl RefUnwindSafe for MaxScore
impl Send for MaxScore
impl Sync for MaxScore
impl Unpin for MaxScore
impl UnwindSafe for MaxScore
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.