pub struct RndPool { /* private fields */ }Implementations§
Source§impl RndPool
impl RndPool
pub fn randoms_min(&self) -> usize
pub fn randoms_min_mut(&self) -> RwLockWriteGuard<'_, usize>
pub fn randoms_full(&self) -> usize
pub fn randoms_full_mut(&self) -> RwLockWriteGuard<'_, usize>
pub fn randoms(&self) -> &SegQueue<f64>
pub fn randoms_mut(&mut self) -> &mut SegQueue<f64>
pub fn customers_min(&self) -> usize
pub fn customers_min_mut(&self) -> RwLockWriteGuard<'_, usize>
pub fn customers_full(&self) -> usize
pub fn customers_full_mut(&self) -> RwLockWriteGuard<'_, usize>
pub fn set_customers_full(&self, value: usize) -> usize
pub fn min_customer_orders(&self) -> f64
Sourcepub fn max_customer_orders(&self) -> f64
pub fn max_customer_orders(&self) -> f64
This value is not a hard upper limit but the boundary within which min_max_order_fraction of randomly generated customer expected daily orders will fall. (1 - min_max_order_fraction) of all customers may get a higher value.
pub fn min_max_order_fraction(&self) -> f64
Sourcepub fn max_erratic_quotient(&self) -> f64
pub fn max_erratic_quotient(&self) -> f64
Similarly to max_customer_orders, this value is not a hard upper limit.
Sourcepub fn eq_fraction(&self) -> f64
pub fn eq_fraction(&self) -> f64
Fraction of erratic quotient values to fall into 0..max_erratic_quotient range.
pub fn eq_gamma_shape(&self) -> f64
pub fn customers(&self) -> RwLockReadGuard<'_, SegQueue<Customer>>
pub fn customers_mut(&self) -> RwLockWriteGuard<'_, SegQueue<Customer>>
pub fn customer_id(&self) -> i32
pub fn customer_id_mut(&self) -> RwLockWriteGuard<'_, i32>
pub fn generator_unparker<'fx_reader_lifetime>( &'fx_reader_lifetime self, ) -> MappedRwLockReadGuard<'fx_reader_lifetime, Unparker>
pub fn orders_gamma<'fx_reader_lifetime>( &'fx_reader_lifetime self, ) -> MappedRwLockReadGuard<'fx_reader_lifetime, Gamma<f64>>
pub fn erratic_quotient_gamma<'fx_reader_lifetime>( &'fx_reader_lifetime self, ) -> MappedRwLockReadGuard<'fx_reader_lifetime, Gamma<f64>>
pub fn reporter<'fx_reader_lifetime>( &'fx_reader_lifetime self, ) -> MappedRwLockReadGuard<'fx_reader_lifetime, Reporter>
Sourcepub fn builder() -> RndPoolBuilder
pub fn builder() -> RndPoolBuilder
Creates a new builder for this struct.
Trait Implementations§
Source§impl Child for RndPool
impl Child for RndPool
Source§type WeakParent = Weak<ScriptWriter>
type WeakParent = Weak<ScriptWriter>
Type of weak reference to the parent.
Source§type FXPParent = Weak<ScriptWriter>
type FXPParent = Weak<ScriptWriter>
For use of the
child_build! and child_builder! macros.Source§type RcParent = Result<Arc<ScriptWriter>, SimErrorAny>
type RcParent = Result<Arc<ScriptWriter>, SimErrorAny>
Type of strong reference to the parent.
Source§fn parent_downgrade(&self) -> Self::WeakParent
fn parent_downgrade(&self) -> Self::WeakParent
Return a weak reference to the parent.
fn __fxplus_parent(parent: Self::WeakParent) -> Self::FXPParent
impl FXStruct for RndPool
Auto Trait Implementations§
impl !Freeze for RndPool
impl !RefUnwindSafe for RndPool
impl Send for RndPool
impl Sync for RndPool
impl Unpin for RndPool
impl !UnwindSafe for RndPool
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<T> FutureExt for T
impl<T> FutureExt for T
Source§fn with_context(self, otel_cx: Context) -> WithContext<Self>
fn with_context(self, otel_cx: Context) -> WithContext<Self>
Source§fn with_current_context(self) -> WithContext<Self>
fn with_current_context(self) -> WithContext<Self>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> 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 moreSource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T in a tonic::RequestSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
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.