Struct SharedStringTable 

pub struct SharedStringTable { /* private fields */ }

Runtime shared string table for efficient string lookup and insertion.

Maintains both an ordered list of strings (for index-based lookup) and a reverse hash map (for deduplication when inserting). Also preserves rich text formatting information for round-tripping.

Implementations

impl SharedStringTable

pub fn new() -> Self

Create a new, empty shared string table.

pub fn from_sst(sst: &Sst) -> Self

Build from an XML Sst struct.

Plain-text items use the t field directly. Rich-text items concatenate all run texts.

pub fn to_sst(&self) -> Sst

Convert back to an XML Sst struct.

pub fn get(&self, index: usize) -> Option<&str>

Get a string by its index.

pub fn add(&mut self, s: &str) -> usize

Add a string, returning its index.

If the string already exists, the existing index is returned (dedup).

pub fn add_rich_text(&mut self, runs: &[RichTextRun]) -> usize

Add rich text runs, returning the SST index.

The plain-text concatenation of the runs is used for deduplication.

pub fn get_rich_text(&self, index: usize) -> Option<Vec<RichTextRun>>

Get rich text runs for an SST entry, if it has formatting.

Returns None for plain-text entries.

pub fn len(&self) -> usize

Number of unique strings.

pub fn is_empty(&self) -> bool

Returns true if the table contains no strings.

Trait Implementations

impl Debug for SharedStringTable

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

Formats the value using the given formatter.

impl Default for SharedStringTable

fn default() -> Self

Returns the “default value” for a type.