pub struct CompositeAggregator { /* private fields */ }Expand description
A composite aggregator that runs multiple aggregations in parallel
This is useful when you want to compute multiple statistics at once (e.g., count, avg, p95, stddev) without making multiple passes over the data.
§Examples
use processor::aggregation::{CompositeAggregator, AggregationResult};
let mut composite = CompositeAggregator::new();
composite.add_count("request_count");
composite.add_avg("avg_latency");
composite.add_p95("p95_latency");
composite.add_stddev("stddev_latency");
// Feed values
for latency in vec![100.0, 150.0, 200.0, 250.0, 300.0] {
composite.update(latency).unwrap();
}
// Get all results
let results = composite.finalize().unwrap();
println!("Count: {}", results.get_count("request_count").unwrap());
println!("Avg: {}", results.get_value("avg_latency").unwrap());
println!("P95: {}", results.get_value("p95_latency").unwrap());
println!("StdDev: {}", results.get_value("stddev_latency").unwrap());Implementations§
Source§impl CompositeAggregator
impl CompositeAggregator
Sourcepub fn add_percentile(
&mut self,
name: impl Into<String>,
percentile: f64,
) -> Result<&mut Self>
pub fn add_percentile( &mut self, name: impl Into<String>, percentile: f64, ) -> Result<&mut Self>
Add a percentile aggregation
Sourcepub fn add_stddev(&mut self, name: impl Into<String>) -> &mut Self
pub fn add_stddev(&mut self, name: impl Into<String>) -> &mut Self
Add a standard deviation aggregation
Sourcepub fn update_batch(&mut self, values: &[f64]) -> Result<()>
pub fn update_batch(&mut self, values: &[f64]) -> Result<()>
Update all aggregations with multiple values
Sourcepub fn finalize(&self) -> Result<AggregationResult>
pub fn finalize(&self) -> Result<AggregationResult>
Compute final results for all aggregations
Trait Implementations§
Source§impl Debug for CompositeAggregator
impl Debug for CompositeAggregator
Auto Trait Implementations§
impl Freeze for CompositeAggregator
impl RefUnwindSafe for CompositeAggregator
impl Send for CompositeAggregator
impl Sync for CompositeAggregator
impl Unpin for CompositeAggregator
impl UnsafeUnpin for CompositeAggregator
impl UnwindSafe for CompositeAggregator
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<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.