pub struct WorldPlan<'a> { /* private fields */ }Expand description
Order and runtime ids of the objects of the world.
Implementations§
Source§impl<'a> WorldPlan<'a>
impl<'a> WorldPlan<'a>
Sourcepub fn new(index: &'a CampaignIndex) -> Self
pub fn new(index: &'a CampaignIndex) -> Self
Plans the world of a campaign: factions in startpos order, regions in table order.
Sourcepub fn with_orders(
factions: Vec<&'a FactionEntry>,
regions: Vec<&'a RegionEntry>,
) -> Self
pub fn with_orders( factions: Vec<&'a FactionEntry>, regions: Vec<&'a RegionEntry>, ) -> Self
Plans the world of a campaign with the given object orders, for example the ones of a game-built startpos.
§Arguments
factions- Factions, in the order of their runtime ids.regions- Regions, in the order of their runtime ids.
Sourcepub fn set_character_order(
&mut self,
faction: &str,
characters: Vec<&'a CharacterEntry>,
)
pub fn set_character_order( &mut self, faction: &str, characters: Vec<&'a CharacterEntry>, )
Sets the order of a faction’s living characters, for example the one of a game-built startpos. Living characters left out of it go after it, in table order.
§Arguments
faction- Faction key.characters- The faction’s characters, in the order of their runtime ids.
Sourcepub fn character_order(&self, faction: &str) -> Option<&[&'a CharacterEntry]>
pub fn character_order(&self, faction: &str) -> Option<&[&'a CharacterEntry]>
Returns the order set for a faction’s living characters, if any.
Sourcepub fn factions(&self) -> &[&'a FactionEntry]
pub fn factions(&self) -> &[&'a FactionEntry]
Returns the factions, in startpos order.
Sourcepub fn regions(&self) -> &[&'a RegionEntry]
pub fn regions(&self) -> &[&'a RegionEntry]
Returns the regions, in startpos order.
Sourcepub fn faction_id(&self, faction: &str) -> Option<u32>
pub fn faction_id(&self, faction: &str) -> Option<u32>
Returns the runtime id of a faction.
Trait Implementations§
Auto Trait Implementations§
impl<'a> Freeze for WorldPlan<'a>
impl<'a> RefUnwindSafe for WorldPlan<'a>
impl<'a> Send for WorldPlan<'a>
impl<'a> Sync for WorldPlan<'a>
impl<'a> Unpin for WorldPlan<'a>
impl<'a> UnsafeUnpin for WorldPlan<'a>
impl<'a> UnwindSafe for WorldPlan<'a>
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<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.