Struct StringTable 

pub struct StringTable { /* private fields */ }

A table of deduplicated strings read from String records in the binlog stream.

Strings are appended in the order they appear (each String record gets the next sequential index starting at [STRING_START_INDEX]). Event payloads reference strings by index.

Implementations

impl StringTable

pub fn new() -> Self

Create an empty string table.

pub fn add(&mut self, value: String) -> i32

Add a string record. Returns the index assigned to it.

pub fn get(&self, index: i32) -> Result<Option<&str>, MuninError>

Look up a string by its on-disk index.

• Index 0 → Ok(None) (null)
• Index 1 → Ok(Some("")) (empty)
• Index 2–9 → Err(InvalidIndex) (reserved, not yet assigned meaning)
• Index ≥ 10 → lookup in the table

pub fn len(&self) -> usize

Number of string records ingested so far.

pub fn is_empty(&self) -> bool

Whether the table is empty (no string records ingested).

pub fn entries(&self) -> &[String]

Borrow the stored strings in insertion (index) order.

pub fn entries_mut(&mut self) -> &mut [String]

Mutably borrow the stored strings in insertion (index) order.

Provided for in-place rewrites that must preserve indices (e.g. crate::redact). Replacing an entry’s contents keeps every existing string-index reference valid, since indices are positional.

Trait Implementations

impl Debug for StringTable

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

Formats the value using the given formatter.

impl Default for StringTable

fn default() -> StringTable

Returns the “default value” for a type.