Struct IndexKey 

pub struct IndexKey {
    pub kind: IndexKind,
    pub key: String,
}

A single sidecar index entry recorded atomically with an event store entry.

The writer (or its encoder) produces one IndexKey per (IndexKind, key) pair the entry should be locatable under. The backend records the first occurrence of each pair; subsequent occurrences for the same (kind, key) are no-ops, so EventStore::lookup always returns the earliest seq that mentioned the key.

Keys are stringified at the encoder boundary: client_order_id and venue_order_id are already strings on the wire types.

Fields

kind: IndexKind

The secondary index this key belongs to.

key: String

The stringified key. Owned because the backend retains it.

Implementations

impl IndexKey

pub const fn new(kind: IndexKind, key: String) -> Self

Creates a new IndexKey.

Trait Implementations

impl Clone for IndexKey

fn clone(&self) -> IndexKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IndexKey

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

Formats the value using the given formatter.

impl Eq for IndexKey

impl Hash for IndexKey

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for IndexKey

fn eq(&self, other: &IndexKey) -> 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 StructuralPartialEq for IndexKey