Struct MemtableEntry 

pub struct MemtableEntry {
    pub measurement: Arc<str>,
    pub tags: Arc<[(Arc<str>, Arc<str>)]>,
    pub fields: Box<[(Arc<str>, FieldValue)]>,
}

Value stored in the memtable’s skip list alongside each key.

Holds one point’s fields. Measurement names, tag keys, tag values and field keys are interned Arc<str>s, and the whole tag set is one Arc<[..]> shared by every point of the series in this memtable — a series’ tags do not change from point to point, so storing them per point stored the same thing a thousand times an hour.

Not BTreeMaps: a one-entry BTreeMap allocates a leaf node sized for eleven, which is ~800 bytes per point of tree nodes nothing uses. memtable_estimate_tracks_real_allocation holds the size estimate to the allocator’s number within a quarter.

Fields

measurement: Arc<str>

Measurement name (interned).

tags: Arc<[(Arc<str>, Arc<str>)]>

Tag key-value pairs, sorted by key, shared per series.

fields: Box<[(Arc<str>, FieldValue)]>

Field name (interned) → field value, sorted by name.

Implementations

impl MemtableEntry

pub fn estimated_size(&self) -> usize

Heap bytes this entry owns exclusively — the struct itself and its fields slice. Interned strings and the shared tag set are accounted for once, where they are interned, not per point.

Trait Implementations

impl Clone for MemtableEntry

fn clone(&self) -> MemtableEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MemtableEntry

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

Formats the value using the given formatter.