Struct SearchIndex 

pub struct SearchIndex { /* private fields */ }

An inverted index for fast substring search.

Uses n-gram indexing to support substring matching. When a name is added, we break it into overlapping n-grams and index each one. During search, we look up the query’s n-grams and intersect the results.

Implementations

impl SearchIndex

pub fn new() -> Self

Creates a new empty search index.

pub fn insert(&mut self, name: &str, id: NodeId)

Inserts a name into the index.

pub fn remove(&mut self, name: &str, id: NodeId)

Removes a name from the index.

pub fn search(&self, query: &str) -> Vec<NodeId>

Searches for nodes whose names contain the query substring.

Returns matching NodeIds sorted for deterministic output.

pub fn len(&self) -> usize

Returns the number of unique names indexed.

pub fn is_empty(&self) -> bool

Returns true if the index is empty.

Trait Implementations

impl Clone for SearchIndex

fn clone(&self) -> SearchIndex

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SearchIndex

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for SearchIndex

fn default() -> SearchIndex

Returns the “default value” for a type.