Struct Trie 

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

Implementations

impl<'a> Trie<'a>

pub const DEFAULT_PREFETCH_LANES: usize = 4

Number of independent walks Trie::common_prefix_batch keeps in flight.

pub const MAX_PREFETCH_LANES: usize = 16

Upper bound on lanes so the scheduler can keep lane state on the stack.

pub fn from_bytes(data: &'a [u8]) -> Trie<'a>

pub fn new(data: &'a [u8], size: usize) -> Trie<'a>

pub fn new_owned(data: Vec<u32>) -> Trie<'a>

pub fn total_size(&self) -> usize

pub fn common_prefix_iterator<'b>( &'a self, input: &'b [u8], offset: usize, ) -> TrieEntryIter<'b>

where 'a: 'b,

pub fn common_prefix_batch<F: FnMut(usize, u32, usize)>( &self, input: &[u8], starts: &[usize], emit: F, )

Run common-prefix search from many start positions, overlapping their memory latency.

emit(bucket, value, end) fires once per match; bucket indexes starts. Within a bucket, matches keep Trie::common_prefix_iterator order, so grouping by bucket reproduces the scalar result.

pub fn common_prefix_batch_cfg<F: FnMut(usize, u32, usize)>( &self, input: &[u8], starts: &[usize], lanes: usize, prefetch: bool, emit: F, )

Trie::common_prefix_batch with an explicit lane count and prefetch toggle. lanes is rounded to the nearest compile-time-specialized count; values above Trie::MAX_PREFETCH_LANES are clamped.