Struct SearchIndex 

pub struct SearchIndex { /* private fields */ }

Inverted word index for fast entity search.

For each entity, we tokenize its name, type, and observations, store each token → set of matching entity indices.

Uses a flat Vec<(StrId, u32)> sorted by (token, entity_idx) for cache-friendly lookups via binary search.

Implementations

impl SearchIndex

pub fn new() -> Self

pub fn clear(&mut self)

pub const fn len(&self) -> usize

pub const fn is_empty(&self) -> bool

pub fn index_entity( &mut self, interner: &mut StringInterner, entity_idx: u32, name: StrId, entity_type: StrId, observations: &[StrId], )

Index a single entity by its name, type, and observations. All strings must already be interned. entity_idx is the position in the entity storage vec.

pub fn remove_entity(&mut self, entity_idx: u32)

Remove all entries for a given entity (before re-indexing).

pub fn search(&self, query: &str, interner: &StringInterner) -> Vec<u32>

Search for entities matching the query. Uses binary search for exact token matches (O(log n + matches)) and falls back to prefix matching for partial queries.

Trait Implementations

impl Default for SearchIndex

fn default() -> Self

Returns the “default value” for a type.