Struct MemtableKey 

pub struct MemtableKey {
    pub series_key_hash: u64,
    pub timestamp: i64,
    pub series_canonical: Arc<str>,
    /* private fields */
}

Key used for ordering entries in the memtable’s skip list.

Points are sorted first by series_key_hash (fast grouping), then by timestamp, then by series_canonical_hash2 (fast integer comparison), and finally by series_canonical as a rare-case tie-breaker for the astronomically unlikely double-hash collision.

series_canonical is Arc<str> (interned) to avoid per-insert heap allocation of duplicate canonical strings.

series_canonical_hash2 (SipHash) provides a fast integer comparison path — the byte-by-byte string comparison only fires when both FNV and SipHash collide simultaneously.

Fields

series_key_hash: u64

FNV-1a hash of the canonical series key (fast routing).

timestamp: i64

Nanosecond-precision Unix epoch timestamp.

series_canonical: Arc<str>

Interned canonical series key — collision-proof tie-breaker.

Implementations

impl MemtableKey

pub fn new( series_key_hash: u64, timestamp: i64, series_canonical: Arc<str>, ) -> Self

Create a new memtable key.

Accepts Arc<str> (interned) instead of String.

pub fn lower_bound(series_key_hash: u64, timestamp: i64) -> Self

Create a lower-bound key for range scans.

Uses u64::MIN for the secondary hash and an empty string so this key sorts before all real keys with the same (hash, ts).

pub fn upper_bound(series_key_hash: u64, timestamp: i64) -> Self

Create an upper-bound key for range scans.

Uses u64::MAX for the secondary hash and a max-codepoint string so this key sorts after all real keys with the same (hash, ts).

Trait Implementations

impl Clone for MemtableKey

fn clone(&self) -> MemtableKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MemtableKey

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

Formats the value using the given formatter.

impl Eq for MemtableKey

impl Hash for MemtableKey

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 Ord for MemtableKey

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl PartialEq for MemtableKey

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for MemtableKey

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for MemtableKey