Struct MergeEntry 

pub struct MergeEntry {
    pub run_index: usize,
    pub key: DecoratedKey,
    pub clustering_key: Option<ClusteringKey>,
    pub timestamp: i64,
    pub row_data: RowData,
}

Entry in the merge stream

Represents a single row from one of the input SSTables. This is the fundamental unit that flows through the merge heap.

Fields

run_index: usize

Which SSTable this came from (0 = newest)

key: DecoratedKey

Partition key with token

clustering_key: Option<ClusteringKey>

Clustering key (None for tables without clustering)

timestamp: i64

Timestamp in microseconds since Unix epoch

row_data: RowData

Row data (live cells or tombstone)

Implementations

impl MergeEntry

pub fn new( run_index: usize, key: DecoratedKey, clustering_key: Option<ClusteringKey>, timestamp: i64, row_data: RowData, ) -> Self

Create a new merge entry

Trait Implementations

impl Clone for MergeEntry

fn clone(&self) -> MergeEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MergeEntry

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

Formats the value using the given formatter.

impl Eq for MergeEntry

impl Ord for MergeEntry

Available on crate feature write-support only.

Ord implementation for min-heap routing ONLY (not LWW winner selection).

This orders entries so the heap yields them grouped by partition and clustering key. The actual equal-timestamp Delete-vs-Live winner is chosen in merge_partition_rows (timestamp → liveness → run_index), NOT here.

Order by:

1. Token (ascending)
2. Key bytes (ascending, for hash collisions)
3. Clustering key (ascending, schema-aware)
4. Run index (ascending) - stable routing tiebreak only

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.

impl PartialEq for MergeEntry

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

Available on crate feature write-support only.

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 MergeEntry