pub struct RndPoolBuilder { /* private fields */ }Implementations§
Source§impl RndPoolBuilder
impl RndPoolBuilder
pub fn parent(self, value: Weak<ScriptWriter>) -> Self
pub fn randoms_min(self, value: usize) -> Self
pub fn randoms_full(self, value: usize) -> Self
pub fn randoms(self, value: SegQueue<f64>) -> Self
pub fn customers_min(self, value: usize) -> Self
pub fn customers_full(self, value: usize) -> Self
pub fn min_customer_orders(self, value: f64) -> Self
Sourcepub fn max_customer_orders(self, value: f64) -> Self
pub fn max_customer_orders(self, value: f64) -> Self
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, value: f64) -> Self
pub fn orders_gamma_shape(self, value: f64) -> Self
Sourcepub fn max_erratic_quotient(self, value: f64) -> Self
pub fn max_erratic_quotient(self, value: f64) -> Self
Similarly to max_customer_orders, this value is not a hard upper limit.
Sourcepub fn eq_fraction(self, value: f64) -> Self
pub fn eq_fraction(self, value: f64) -> Self
Fraction of erratic quotient values to fall into 0..max_erratic_quotient range.
pub fn eq_gamma_shape(self, value: f64) -> Self
pub fn tolerance(self, value: f64) -> Self
pub fn customers(self, value: SegQueue<Customer>) -> Self
pub fn customer_id(self, value: i32) -> Self
pub fn generator_unparker(self, value: Unparker) -> Self
pub fn orders_gamma(self, value: Gamma<f64>) -> Self
pub fn erratic_quotient_gamma(self, value: Gamma<f64>) -> Self
pub fn reporter(self, value: Reporter) -> Self
pub fn new() -> Self
Trait Implementations§
Source§impl Default for RndPoolBuilder
impl Default for RndPoolBuilder
Source§fn default() -> RndPoolBuilder
fn default() -> RndPoolBuilder
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl !Freeze for RndPoolBuilder
impl !RefUnwindSafe for RndPoolBuilder
impl Send for RndPoolBuilder
impl Sync for RndPoolBuilder
impl Unpin for RndPoolBuilder
impl !UnwindSafe for RndPoolBuilder
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.