pub struct MercenaryUnit { /* private fields */ }Expand description
A unit of a mercenary pool (MERCENARY_POOL_UNIT_ARRAY entry).
Implementations§
Source§impl MercenaryUnit
impl MercenaryUnit
Source§impl MercenaryUnit
impl MercenaryUnit
Sourcepub fn initial_count(&self) -> u32
pub fn initial_count(&self) -> u32
Units available at the start (initial_unit_count).
Sourcepub fn replenish_chance(&self) -> f32
pub fn replenish_chance(&self) -> f32
Chance to get a unit back each turn, as stored in the table.
Sourcepub fn max_replenish_per_turn(&self) -> u32
pub fn max_replenish_per_turn(&self) -> u32
Maximum units replenished per turn.
Trait Implementations§
Source§impl Clone for MercenaryUnit
impl Clone for MercenaryUnit
Source§fn clone(&self) -> MercenaryUnit
fn clone(&self) -> MercenaryUnit
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 moreSource§impl Debug for MercenaryUnit
impl Debug for MercenaryUnit
Source§impl Default for MercenaryUnit
impl Default for MercenaryUnit
Source§fn default() -> MercenaryUnit
fn default() -> MercenaryUnit
Returns the “default value” for a type. Read more
Source§impl PartialEq for MercenaryUnit
impl PartialEq for MercenaryUnit
impl StructuralPartialEq for MercenaryUnit
Auto Trait Implementations§
impl Freeze for MercenaryUnit
impl RefUnwindSafe for MercenaryUnit
impl Send for MercenaryUnit
impl Sync for MercenaryUnit
impl Unpin for MercenaryUnit
impl UnsafeUnpin for MercenaryUnit
impl UnwindSafe for MercenaryUnit
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<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> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
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 moreimpl<T> MaybeSend for T
impl<T> MaybeSync for T
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
Source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
Read this value from the supplied reader. Same as
ReadEndian::read_from_little_endian().impl<T> Scalar for T
§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.