pub struct RepeatedHeavyPdoPattern {
pub pattern: Vec<Box<dyn HeavyPdoTraceConfig>>,
pub count: usize,
/* private fields */
}Expand description
The model contains an array of heavy PDO trace models.
Combine multiple heavy PDO trace models into one pattern,
and repeat the pattern for count times.
If count is 0, the pattern will be repeated forever.
§Examples
let pat = vec![
Box::new(
StaticHeavyPdoConfig::new()
.interval(Duration::from_millis(1))
.bytes(1500)
.count(1),
) as Box<dyn HeavyPdoTraceConfig>,
Box::new(
StaticHeavyPdoConfig::new()
.interval(Duration::from_millis(2))
.bytes(3000)
.count(1),
) as Box<dyn HeavyPdoTraceConfig>,
];
let mut model = RepeatedHeavyPdoPatternConfig::new().pattern(pat).count(2).build();
assert_eq!(model.next_heavy_pdo(), Some((Duration::from_millis(1), 1500)));
assert_eq!(model.next_heavy_pdo(), Some((Duration::from_millis(2), 3000)));
assert_eq!(model.next_heavy_pdo(), Some((Duration::from_millis(1), 1500)));
assert_eq!(model.next_heavy_pdo(), Some((Duration::from_millis(2), 3000)));
assert_eq!(model.next_heavy_pdo(), None);Fields§
§pattern: Vec<Box<dyn HeavyPdoTraceConfig>>§count: usizeTrait Implementations§
Source§impl Default for RepeatedHeavyPdoPattern
impl Default for RepeatedHeavyPdoPattern
Auto Trait Implementations§
impl !RefUnwindSafe for RepeatedHeavyPdoPattern
impl !Sync for RepeatedHeavyPdoPattern
impl !UnwindSafe for RepeatedHeavyPdoPattern
impl Freeze for RepeatedHeavyPdoPattern
impl Send for RepeatedHeavyPdoPattern
impl Unpin for RepeatedHeavyPdoPattern
impl UnsafeUnpin for RepeatedHeavyPdoPattern
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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 moreimpl<T> Read<Exclusive, BecauseExclusive> 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.