pub struct IntervalLogger { /* private fields */ }Implementations§
Source§impl IntervalLogger
impl IntervalLogger
Sourcepub fn new(
interval: Duration,
encoder_cache_counters: Option<(Arc<AtomicUsize>, Arc<AtomicUsize>)>,
) -> Self
pub fn new( interval: Duration, encoder_cache_counters: Option<(Arc<AtomicUsize>, Arc<AtomicUsize>)>, ) -> Self
Starts an interval logger. Call begin_logging to begin the logging process.
pub fn enable_logging(&self)
Sourcepub fn reset(&self)
pub fn reset(&self)
Reset all counters to zero. Call after warmup/dummy runs to get clean stats.
pub fn add_tokens_processed(&self, num_tokens: usize)
pub fn add_new_sequence(&self)
pub fn add_prefix_cache_hit(&self)
pub fn set_num_running(&self, running: usize)
pub fn set_num_waiting(&self, waiting: usize)
Sourcepub fn prefix_cache_stats(&self) -> (usize, usize)
pub fn prefix_cache_stats(&self) -> (usize, usize)
Return cumulative prefix cache (hits, total_sequences).
Sourcepub fn encoder_cache_stats(&self) -> Option<(usize, usize)>
pub fn encoder_cache_stats(&self) -> Option<(usize, usize)>
Return cumulative encoder cache (hits, misses), or None if no encoder cache exists.
Auto Trait Implementations§
impl Freeze for IntervalLogger
impl RefUnwindSafe for IntervalLogger
impl Send for IntervalLogger
impl Sync for IntervalLogger
impl Unpin for IntervalLogger
impl UnsafeUnpin for IntervalLogger
impl UnwindSafe for IntervalLogger
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> Downcast for T
impl<T> Downcast for T
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<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
Source§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.