Struct StringPool 

pub struct StringPool { /* private fields */ }

A string interning pool.

Stores each unique string exactly once and returns lightweight handles (InternedString) for fast comparison.

Implementations

impl StringPool

pub fn new() -> Self

Create an empty string pool.

pub fn with_capacity(cap: usize) -> Self

Create a pool pre-sized for the given capacity.

pub fn intern(&mut self, s: &str) -> InternedString

Intern a string. If the string is already in the pool, returns the existing handle. Otherwise inserts it and returns a new handle.

pub fn intern_bulk(&mut self, strs: &[&str]) -> Vec<InternedString>

Intern multiple strings at once, returning handles in the same order.

pub fn intern_iter<'a, I>(&mut self, iter: I) -> Vec<InternedString>

where I: IntoIterator<Item = &'a str>,

Intern strings from an iterator.

pub fn resolve(&self, id: InternedString) -> Option<&str>

Resolve an interned string back to its content.

pub fn lookup(&self, s: &str) -> Option<InternedString>

Look up an interned string by content. Returns None if the string has not been interned.

pub fn contains(&self, s: &str) -> bool

Check whether a string has been interned.

pub fn len(&self) -> usize

Number of unique strings in the pool.

pub fn is_empty(&self) -> bool

Whether the pool is empty.

pub fn statistics(&self) -> &PoolStatistics

Get pool statistics.

pub fn snapshot(&self) -> PoolSnapshot

Create a snapshot of the pool for serialization.

pub fn iter(&self) -> impl Iterator<Item = (InternedString, &str)>

Iterate over all interned strings with their handles.

pub fn clear(&mut self)

Clear the pool, removing all interned strings.

pub fn merge(&mut self, other: &StringPool) -> Vec<InternedString>

Merge another pool into this one. Returns a mapping from old indices to new indices.

Trait Implementations

impl Debug for StringPool

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

Formats the value using the given formatter.

impl Default for StringPool

fn default() -> Self

Returns the “default value” for a type.