Struct LexicalIndex 

pub struct LexicalIndex { /* private fields */ }

In-memory lexical index.

Implementations

impl LexicalIndex

pub fn new(documents: Vec<LexicalDocument>) -> Self

Builds an index from already accepted memory documents.

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

Returns matching documents ranked by lexical overlap with query.

pub fn search_with_tag_filter( &self, query: &str, required_tags: &[String], ) -> CortexResult<Vec<LexicalHit>>

Returns matching documents ranked by lexical overlap with query, restricted to documents whose domains tags carry every entry in required_tags (AND semantics).

The tag filter runs as a pre-pass: documents that fail the AND closure are skipped before any lexical scoring work. An empty required_tags slice disables filtering and yields the same hits as Self::search. Duplicate tag inputs are coalesced.

Trait Implementations

impl Clone for LexicalIndex

fn clone(&self) -> LexicalIndex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LexicalIndex

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

Formats the value using the given formatter.

impl Default for LexicalIndex

fn default() -> LexicalIndex

Returns the “default value” for a type.

impl PartialEq for LexicalIndex

fn eq(&self, other: &LexicalIndex) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for LexicalIndex

impl StructuralPartialEq for LexicalIndex