Enum Ordering 

pub enum Ordering {
    None,
    InsertionTs,
}

Ordering mode for consumed events.

Variants

None

Return events in arbitrary order (fastest).

Cross-shard order is non-deterministic. Events from a given shard preserve their per-shard arrival order, but the interleaving across shards depends on futures::join_all’s completion order — which varies with runtime scheduling, adapter latency, and concurrent load. Callers that need a stable order across polls must use Ordering::InsertionTs or sort the response themselves (e.g. by (shard_id, id)).

InsertionTs

Sort events by insertion timestamp (cross-shard ordering).

Trait Implementations

impl Clone for Ordering

fn clone(&self) -> Ordering

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Ordering

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Ordering

fn default() -> Ordering

Returns the “default value” for a type.

impl PartialEq for Ordering

fn eq(&self, other: &Ordering) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Ordering

impl Eq for Ordering

impl StructuralPartialEq for Ordering