pub struct StaticDelayPerPacket {
pub delay: Delay,
pub count: usize,
/* private fields */
}Expand description
The model of a static per-packet delay trace.
This model always returns the same delay for the given amount of packets.
If the count is 0, the delay will be repeated forever.
§Examples
let mut static_delay = StaticDelayPerPacketConfig::new()
.delay(Delay::from_millis(10))
.count(2)
.build();
assert_eq!(static_delay.next_delay(), Some(Delay::from_millis(10)));
assert_eq!(static_delay.next_delay(), Some(Delay::from_millis(10)));
assert_eq!(static_delay.next_delay(), None);Fields§
§delay: Delay§count: usizeTrait Implementations§
Source§impl Clone for StaticDelayPerPacket
impl Clone for StaticDelayPerPacket
Source§fn clone(&self) -> StaticDelayPerPacket
fn clone(&self) -> StaticDelayPerPacket
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 Debug for StaticDelayPerPacket
impl Debug for StaticDelayPerPacket
Source§impl Default for StaticDelayPerPacket
impl Default for StaticDelayPerPacket
Source§fn default() -> StaticDelayPerPacket
fn default() -> StaticDelayPerPacket
Returns the “default value” for a type. Read more
Source§impl DelayPerPacketTrace for StaticDelayPerPacket
impl DelayPerPacketTrace for StaticDelayPerPacket
fn next_delay(&mut self) -> Option<Delay>
Source§impl PartialEq for StaticDelayPerPacket
impl PartialEq for StaticDelayPerPacket
impl Copy for StaticDelayPerPacket
impl StructuralPartialEq for StaticDelayPerPacket
Auto Trait Implementations§
impl Freeze for StaticDelayPerPacket
impl RefUnwindSafe for StaticDelayPerPacket
impl Send for StaticDelayPerPacket
impl Sync for StaticDelayPerPacket
impl Unpin for StaticDelayPerPacket
impl UnwindSafe for StaticDelayPerPacket
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.