Struct Fsa 

pub struct Fsa<D> { /* private fields */ }

A read-only minimal-FSA map over a byte container.

Implementations

impl<D: AsRef<[u8]>> Fsa<D>

pub fn new(data: D) -> Result<Self, FsaError>

pub fn len(&self) -> u64

Number of keys stored.

pub fn is_empty(&self) -> bool

pub fn state_count(&self) -> u32

Total number of states in the automaton (diagnostics).

pub fn get(&self, key: &[u8]) -> Option<u64>

Look up key.

pub fn contains_prefix(&self, prefix: &[u8]) -> bool

true if any stored key starts with prefix.

pub fn prefix(&self, prefix: &[u8]) -> Vec<(Vec<u8>, u64)>

All (key, value) pairs whose key starts with prefix, sorted.

pub fn prefix_for_each<F: FnMut(&[u8], u64)>(&self, prefix: &[u8], visit: F)

Streaming variant: invoke visit(key, value) for every (key, value) whose key starts with prefix, in sorted order, without allocating a result vector. The key slice is valid only for the call. This is the hot-path entry — a bare-letter prefix can match tens of thousands of keys, and materializing them all would dominate cost.

pub fn iter(&self) -> FsaIter<'_, D>

Lazy iterator over all (key, value) pairs in sorted order.

pub fn range(&self, prefix: &[u8]) -> FsaIter<'_, D>

Lazy iterator over (key, value) pairs whose key starts with prefix, in sorted order. Unlike prefix it allocates no result vector and supports early termination (.take, .find, break).