pub struct LotteryChoice {
pub name: String,
pub reset: u64,
pub tickets: u64,
pub weight: u64,
}Expand description
Represents an individual choice for the lottery model.
§Attributes
Fields§
§name: StringThe name of the choice
reset: u64How many tickets the choice should be reset to when it is chosen.
tickets: u64The current number of tickets the choice has.
weight: u64The number of tickets that will be added to tickets each time this choice is not picked.
Trait Implementations§
Source§impl Debug for LotteryChoice
impl Debug for LotteryChoice
Source§impl<'de> Deserialize<'de> for LotteryChoice
impl<'de> Deserialize<'de> for LotteryChoice
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
Source§impl PartialEq for LotteryChoice
impl PartialEq for LotteryChoice
Source§impl Serialize for LotteryChoice
impl Serialize for LotteryChoice
impl Eq for LotteryChoice
impl StructuralPartialEq for LotteryChoice
Auto Trait Implementations§
impl Freeze for LotteryChoice
impl RefUnwindSafe for LotteryChoice
impl Send for LotteryChoice
impl Sync for LotteryChoice
impl Unpin for LotteryChoice
impl UnwindSafe for LotteryChoice
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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.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.