pub struct NormalizedDelayPerPacket<Rng = StdRng>where
Rng: RngCore,{
pub mean: Delay,
pub std_dev: Delay,
pub upper_bound: Option<Delay>,
pub lower_bound: Delay,
pub seed: u64,
pub count: usize,
/* private fields */
}
Expand description
The model of a per-packet delay trace subjects to a normal distribution.
The delay will subject to N(mean, std_dev²), but bounded within [lower_bound, upper_bound] (optional)
If the count
is 0, the delay will be repeated forever, else it will be repeated count
times.
§Examples
A simple example without any bound on delay:
let mut normal_delay = NormalizedDelayPerPacketConfig::new()
.mean(Delay::from_millis(12))
.std_dev(Delay::from_millis(1))
.count(2)
.seed(42)
.build();
assert_eq!(normal_delay.next_delay(), Some(Delay::from_nanos(12069428)));
assert_eq!(normal_delay.next_delay(), Some(Delay::from_nanos(12132938)));
assert_eq!(normal_delay.next_delay(), None);
A more complex example with bounds on delay:
let mut normal_delay = NormalizedDelayPerPacketConfig::new()
.mean(Delay::from_millis(12))
.std_dev(Delay::from_millis(1))
.count(2)
.seed(42)
.upper_bound(Delay::from_micros(12100))
.lower_bound(Delay::from_micros(11900))
.build();
assert_eq!(normal_delay.next_delay(), Some(Delay::from_nanos(12069428)));
assert_eq!(normal_delay.next_delay(), Some(Delay::from_nanos(12100000)));
assert_eq!(normal_delay.next_delay(), None);
Fields§
§mean: Delay
§std_dev: Delay
§upper_bound: Option<Delay>
§lower_bound: Delay
§seed: u64
§count: usize
Trait Implementations§
Source§impl<Rng> Clone for NormalizedDelayPerPacket<Rng>
impl<Rng> Clone for NormalizedDelayPerPacket<Rng>
Source§fn clone(&self) -> NormalizedDelayPerPacket<Rng>
fn clone(&self) -> NormalizedDelayPerPacket<Rng>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl<Rng> Debug for NormalizedDelayPerPacket<Rng>
impl<Rng> Debug for NormalizedDelayPerPacket<Rng>
Source§impl<Rng: RngCore + Send> DelayPerPacketTrace for NormalizedDelayPerPacket<Rng>
impl<Rng: RngCore + Send> DelayPerPacketTrace for NormalizedDelayPerPacket<Rng>
fn next_delay(&mut self) -> Option<Delay>
Source§impl<Rng> PartialEq for NormalizedDelayPerPacket<Rng>
impl<Rng> PartialEq for NormalizedDelayPerPacket<Rng>
Source§fn eq(&self, other: &NormalizedDelayPerPacket<Rng>) -> bool
fn eq(&self, other: &NormalizedDelayPerPacket<Rng>) -> bool
Tests for
self
and other
values to be equal, and is used by ==
.impl<Rng> Copy for NormalizedDelayPerPacket<Rng>
impl<Rng> StructuralPartialEq for NormalizedDelayPerPacket<Rng>where
Rng: RngCore,
Auto Trait Implementations§
impl<Rng> Freeze for NormalizedDelayPerPacket<Rng>where
Rng: Freeze,
impl<Rng> RefUnwindSafe for NormalizedDelayPerPacket<Rng>where
Rng: RefUnwindSafe,
impl<Rng> Send for NormalizedDelayPerPacket<Rng>where
Rng: Send,
impl<Rng> Sync for NormalizedDelayPerPacket<Rng>where
Rng: Sync,
impl<Rng> Unpin for NormalizedDelayPerPacket<Rng>where
Rng: Unpin,
impl<Rng> UnwindSafe for NormalizedDelayPerPacket<Rng>where
Rng: UnwindSafe,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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<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.