pub struct CaiInputs<'a> {
pub tables: &'a StartposTables,
pub index: &'a CampaignIndex,
pub layout: &'a StartposLayout,
pub world: &'a RecordNode,
pub map_data: &'a ESF,
pub hlp_data: &'a ESF,
pub trade_splines: usize,
pub trade_routes: &'a [(u32, u32)],
pub campaign: &'a str,
}Expand description
What the AI writer is built from.
Fields§
§tables: &'a StartposTablesTables of the game and the campaign.
index: &'a CampaignIndexThe campaign’s startpos rows.
layout: &'a StartposLayoutRecord layouts of the game.
world: &'a RecordNodeThe written WORLD record.
map_data: &'a ESFDecoded map_data.esf of the campaign map.
hlp_data: &'a ESFDecoded hlp_data.esf of the campaign map.
trade_splines: usizeNumber of trade splines of the campaign map.
trade_routes: &'a [(u32, u32)]International trade routes of the written trade manager: owner faction (runtime id) and route id.
campaign: &'a strCampaign key.
Trait Implementations§
Auto Trait Implementations§
impl<'a> Freeze for CaiInputs<'a>
impl<'a> RefUnwindSafe for CaiInputs<'a>
impl<'a> Send for CaiInputs<'a>
impl<'a> Sync for CaiInputs<'a>
impl<'a> Unpin for CaiInputs<'a>
impl<'a> UnsafeUnpin for CaiInputs<'a>
impl<'a> UnwindSafe for CaiInputs<'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,
§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.