Struct GraphSearcher 

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

Per-query binding of mmap-backed graph views to owned reusable scratch.

Implementations

impl<'a> GraphSearcher<'a>

pub fn new( graph: GraphNodeBlocks<'a>, rescore: &'a [f32], scratch: &'a mut GraphSearchScratch, ) -> Result<Self, GraphSearchError>

Validates geometry and retains the existing O(N) entry-seed discovery behavior.

pub fn discover_entry_row_ids( graph: GraphNodeBlocks<'_>, ) -> Result<[u32; 4], GraphSearchError>

Discovers all four persisted entry seeds by validating every graph block.

pub fn with_entry_row_ids( graph: GraphNodeBlocks<'a>, rescore: &'a [f32], entry_row_ids: [u32; 4], scratch: &'a mut GraphSearchScratch, ) -> Result<Self, GraphSearchError>

Binds cached entry row ids after validating only those four graph blocks.

pub fn search( &mut self, request: GraphSearchRequest<'_>, cancellation: Option<&QueryCancellation<'_>>, ) -> Result<GraphSearchResult, GraphSearchError>

Traverses, then exact-rescores the complete retained pool.

pub fn search_filtered( &mut self, request: GraphSearchRequest<'_>, allow_list: &DocBitmap, filtered_visited_budget: usize, cancellation: Option<&QueryCancellation<'_>>, ) -> Result<FilteredGraphSearchOutcome, GraphSearchError>

Traverses every reachable node while retaining only rows in allow_list.

filtered_visited_budget is a selectivity work budget. Crossing it is a normal disposition for the store planner to answer through its exact allow-list branch; it is deliberately distinct from the fail-closed unfiltered visited-cap error.