pub struct Economy {
Show 19 fields pop: f32, population_limited_by: GoodIndex, stocks: GoodMap<f32>, surplus: GoodMap<f32>, marginal_surplus: GoodMap<f32>, unconsumed_stock: GoodMap<f32>, values: GoodMap<Option<f32>>, last_exports: GoodMap<f32>, active_exports: GoodMap<f32>, labor_values: GoodMap<Option<f32>>, material_costs: GoodMap<f32>, labors: LaborMap<f32>, yields: LaborMap<f32>, productivity: LaborMap<f32>, limited_by: LaborMap<GoodIndex>, natural_resources: NaturalResources, neighbors: Vec<NeighborInformation>, orders: DHashMap<Id<Site>, Vec<TradeOrder>>, deliveries: Vec<TradeDelivery>,
}

Fields§

§pop: f32

Population

§population_limited_by: GoodIndex§stocks: GoodMap<f32>

Total available amount of each good

§surplus: GoodMap<f32>

Surplus stock compared to demand orders

§marginal_surplus: GoodMap<f32>

change rate (derivative) of stock in the current situation

§unconsumed_stock: GoodMap<f32>

amount of wares not needed by the economy (helps with trade planning)

§values: GoodMap<Option<f32>>

Local availability of a good, 4.0 = starved, 2.0 = balanced, 0.1 = extra, NULL = way too much

§last_exports: GoodMap<f32>

amount of goods exported/imported during the last cycle

§active_exports: GoodMap<f32>§labor_values: GoodMap<Option<f32>>

amount of labor that went into a good, [1 man cycle=1.0]

§material_costs: GoodMap<f32>§labors: LaborMap<f32>

Proportion of individuals dedicated to an industry (sums to roughly 1.0)

§yields: LaborMap<f32>§productivity: LaborMap<f32>

[0.0..1.0]

§limited_by: LaborMap<GoodIndex>

Missing raw material which limits production

§natural_resources: NaturalResources§neighbors: Vec<NeighborInformation>

Neighboring sites to trade with

§orders: DHashMap<Id<Site>, Vec<TradeOrder>>

outgoing trade, per provider

§deliveries: Vec<TradeDelivery>

incoming trade - only towards this site

Implementations§

source§

impl Economy

source

const MINIMUM_PRICE: f32 = 0.100000001f32

source

const STARTING_COIN: f32 = 1000f32

source

const _NATURAL_RESOURCE_SCALE: f32 = 0.111111112f32

source

pub fn population(&self) -> f32

source

pub fn get_available_stock(&self) -> HashMap<Good, f32>

source

pub fn get_information(&self, id: Id<Site>) -> EconomyInfo

source

pub fn cache_economy(&mut self)

source

fn get_orders(&self) -> &'static LaborMap<Vec<(GoodIndex, f32)>>

orders per profession (excluding everyone)

source

fn get_orders_everyone(&self) -> impl Iterator<Item = &'static (GoodIndex, f32)>

resources consumed by everyone (no matter which profession)

source

fn get_production(&self) -> LaborMap<(GoodIndex, f32)>

source

fn replenish(&mut self, _time: f32)

source

pub fn add_chunk(&mut self, ch: &SimChunk, distance_squared: i64)

source

pub fn add_neighbor(&mut self, id: Id<Site>, _distance: usize)

source

pub fn get_site_prices(&self) -> SitePrices

source

fn plan_trade_for_site( &mut self, site_id: &Id<Site>, transportation_capacity: f32, potential_trade: &mut GoodMap<f32> ) -> GoodMap<f32>

plan the trading according to missing goods and prices at neighboring sites (1st step of trading)

source

pub fn trade_at_site( &mut self, site_id: Id<Site>, orders: &mut Vec<TradeOrder>, deliveries: &mut DHashMap<Id<Site>, Vec<TradeDelivery>> )

perform trade using neighboring orders (2nd step of trading)

source

fn collect_deliveries(&mut self)

3rd step of trading

source

pub fn tick(&mut self, site_id: Id<Site>, dt: f32)

Simulate one step of economic interaction:

  • collect returned goods from trade
  • calculate demand, production and their ratio
  • reassign workers based on missing goods
  • change stock due to raw material use and production
  • send out traders with goods and orders
  • calculate good decay and population change

Simulate a site’s economy. This simulation is roughly equivalent to the Lange-Lerner model’s solution to the socialist calculation problem. The simulation begins by assigning arbitrary values to each commodity and then incrementally updates them according to the final scarcity of the commodity at the end of the tick. This results in the formulation of values that are roughly analogous to prices for each commodity. The workforce is then reassigned according to the respective commodity values. The simulation also includes damping terms that prevent cyclical inconsistencies in value rationalisation magnifying enough to crash the economy. We also ensure that a small number of workers are allocated to every industry (even inactive ones) each tick. This is not an accident: a small amount of productive capacity in one industry allows the economy to quickly pivot to a different production configuration should an additional commodity that acts as production input become available. This means that the economy will dynamically react to environmental changes. If a product becomes available through a mechanism such as trade, an entire arm of the economy may materialise to take advantage of this.

source

pub fn csv_entry(f: &mut File, site: &Site) -> Result<(), Error>

source

fn csv_header(f: &mut File) -> Result<(), Error>

source

pub fn csv_open() -> Option<File>

Trait Implementations§

source§

impl Debug for Economy

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Default for Economy

source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T, U> Cast<U> for T
where U: FromCast<T>,

§

fn cast(self) -> U

Numeric cast from self to T.
§

impl<T> Conv for T

§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
§

impl<T> FmtForward for T

§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> FromCast<T> for T

§

fn from_cast(t: T) -> T

Numeric cast from T to Self.
§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Pipe for T
where T: ?Sized,

§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<Context> SubContext<Context> for Context

§

fn sub_context(self) -> Context

§

impl<T> Tap for T

§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
§

impl<T> TryConv for T

§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
§

impl<T> TryDefault for T
where T: Default,

§

fn try_default() -> Result<T, String>

Tries to create the default.
§

fn unwrap_default() -> Self

Calls try_default and panics on an error case.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

impl<T> Event for T
where T: Send + Sync + 'static,

§

impl<T> Resource for T
where T: Any + Send + Sync,