Struct SamplingService 

pub struct SamplingService { /* private fields */ }

A sampling processor that passes 1 of every N exchanges (deterministic, counter-based). Non-sampled exchanges get CamelStop=true set and return Ok(exchange) (drop semantics consistent with ThrottleStrategy::Drop).

Which exchange passes

The counter starts at 0 and is incremented before the modulo check. Exchange #N passes (when counter % period == 0), then #2N, #3N, etc.

Lifecycle

SamplingService does NOT implement StepLifecycle — the counter is route-scoped and reset on hot-swap (per ADR-0004). No background timers, nothing to drain.

Implementations

impl SamplingService

pub fn new(period: usize) -> Self

Trait Implementations

impl Clone for SamplingService

fn clone(&self) -> SamplingService

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Service<Exchange> for SamplingService

type Response = Exchange

Responses given by the service.

type Error = CamelError

Errors produced by the service.

type Future = Pin<Box<dyn Future<Output = Result<Exchange, CamelError>> + Send>>

The future response value.

fn poll_ready(&mut self, _cx: &mut Context<'_>) -> Poll<Result<(), Self::Error>>

Returns Poll::Ready(Ok(())) when the service is able to process requests.

fn call(&mut self, exchange: Exchange) -> Self::Future

Process the request and return the response asynchronously.