Struct SortKey 

#[repr(C)]
pub struct SortKey {
    pub hlc: HlcTimestamp,
    pub node_seq: u64,
}

128-bit composite sort key for total ordering across distributed nodes.

Records are ordered by:

1. HLC timestamp (causal ordering)
2. Node ID (tie-breaker, lower wins)
3. Sequence number (per-node ordering)

Fields

hlc: HlcTimestamp

HLC timestamp (64 bits) - provides causal ordering across nodes.

node_seq: u64

Packed node_id (16 bits) + sequence (48 bits). Layout: [node_id: 16 bits][sequence: 48 bits]

Implementations

impl SortKey

pub const fn new(hlc: HlcTimestamp, node_id: u16, sequence: u64) -> Self

Create a new sort key from components.

Arguments

• hlc - Hybrid Logical Clock timestamp
• node_id - Node identifier (lower wins in tie-breaks)
• sequence - Per-node monotonic sequence (only lower 48 bits used)

pub const fn from_timestamp_ns(timestamp_ns: u64, sequence: u32) -> Self

Create a sort key from raw timestamp (legacy compatibility).

Converts nanosecond timestamp to HLC milliseconds with zero logical counter.

pub const fn zero() -> Self

Create a zero (minimum) sort key.

pub const fn max() -> Self

Create a maximum sort key.

pub const fn hlc(&self) -> HlcTimestamp

Get the HLC timestamp component.

pub const fn node_id(&self) -> u16

Get the node ID component.

pub const fn sequence(&self) -> u64

Get the sequence number component.

pub const fn timestamp_ns(&self) -> u64

Get approximate timestamp in nanoseconds (for compatibility).

Note: This loses precision since HLC uses milliseconds internally.

pub const fn to_u128(&self) -> u128

Convert to a 128-bit integer for atomic operations or serialization.

pub const fn from_u128(value: u128) -> Self

Create from a 128-bit integer.

pub const fn size() -> usize

Get the size of a sort key in bytes.

Trait Implementations

impl Clone for SortKey

fn clone(&self) -> SortKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortKey

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

Formats the value using the given formatter.

impl Default for SortKey

fn default() -> SortKey

Returns the “default value” for a type.

impl Display for SortKey

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

Formats the value using the given formatter.

impl FromBytes for SortKey

where HlcTimestamp: FromBytes, u64: FromBytes,

fn read_from_bytes(source: &[u8]) -> Result<Self, SizeError<&[u8], Self>>

where Self: Sized,

Reads a copy of Self from the given source.

fn read_from_prefix( source: &[u8], ) -> Result<(Self, &[u8]), SizeError<&[u8], Self>>

where Self: Sized,

Reads a copy of Self from the prefix of the given source.

fn read_from_suffix( source: &[u8], ) -> Result<(&[u8], Self), SizeError<&[u8], Self>>

where Self: Sized,

Reads a copy of Self from the suffix of the given source.

impl FromZeros for SortKey

where HlcTimestamp: FromZeros, u64: FromZeros,

fn zero(&mut self)

Overwrites self with zeros.

fn new_zeroed() -> Self

where Self: Sized,

Creates an instance of Self from zeroed bytes.

impl Hash for SortKey

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 IntoBytes for SortKey

where HlcTimestamp: IntoBytes, u64: IntoBytes, (): PaddingFree<Self, { _ }>,

fn as_mut_bytes(&mut self) -> &mut [u8]

where Self: FromBytes,

Gets the bytes of this value mutably.

impl Ord for SortKey

fn cmp(&self, other: &SortKey) -> 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.

impl PartialEq for SortKey

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

fn partial_cmp(&self, other: &SortKey) -> 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 TryFromBytes for SortKey

where HlcTimestamp: TryFromBytes, u64: TryFromBytes,

fn try_read_from_bytes( source: &[u8], ) -> Result<Self, ConvertError<Infallible, SizeError<&[u8], Self>, ValidityError<&[u8], Self>>>

where Self: Sized,

Attempts to read the given source as a Self.

fn try_read_from_prefix( source: &[u8], ) -> Result<(Self, &[u8]), ConvertError<Infallible, SizeError<&[u8], Self>, ValidityError<&[u8], Self>>>

where Self: Sized,

Attempts to read a Self from the prefix of the given source.

fn try_read_from_suffix( source: &[u8], ) -> Result<(&[u8], Self), ConvertError<Infallible, SizeError<&[u8], Self>, ValidityError<&[u8], Self>>>

where Self: Sized,

Attempts to read a Self from the suffix of the given source.

impl Copy for SortKey

impl Eq for SortKey

impl StructuralPartialEq for SortKey