Struct TermDict 

pub struct TermDict<'a> { /* private fields */ }

Read-only term dictionary backed by an FST.

Implementations

impl<'a> TermDict<'a>

pub fn open(data: &'a [u8]) -> Self

Open a term dictionary from encoded bytes.

pub fn len(&self) -> u32

Number of terms in the dictionary.

pub fn is_empty(&self) -> bool

Whether the dictionary is empty.

pub fn get(&self, term: &str) -> Option<u64>

Look up a term and return its posting list offset, or None.

pub fn prefix_iter(&self, prefix: &str) -> Vec<(String, u64)>

Collect all terms starting with prefix, returning (term, offset) pairs.

pub fn automaton_search<A: Automaton>(&self, aut: A) -> Vec<(String, u64)>

Search the dictionary with an automaton. Returns all matching (term, offset) pairs where the automaton accepts the term.

This is the key optimization for wildcard and fuzzy queries — the FST is walked in lockstep with the automaton DFA, pruning entire subtrees where can_match() returns false.