Struct DictionaryBuilder 

pub struct DictionaryBuilder { /* private fields */ }

Builds a Dictionary from observed (subject, predicate, object) terms.

Terms are deduped with HashSet during ingest (O(1) average insert, no tree rebalancing) and sorted once in Self::build. This replaces a trio of BTreeSet<String> whose per-insert O(log n) cost + a String allocation for every observed term (most of them duplicates) dominated the build on large graphs.

Implementations

impl DictionaryBuilder

pub fn new() -> DictionaryBuilder

pub fn observe(&mut self, subject: &str, predicate: &str, object: &str)

Record one triple’s terms (IDs are assigned later, in Self::build). We probe with the borrowed &str first and only allocate a String for a genuinely new term — so a graph of N triples does far fewer than 3N allocations (each subject/predicate recurs across many triples).

pub fn build(self) -> Dictionary

Trait Implementations

impl Default for DictionaryBuilder

fn default() -> DictionaryBuilder

Returns the “default value” for a type.