Struct DiscoveryIndex 

pub struct DiscoveryIndex { /* private fields */ }

Bounded searchable snapshot of catalog compact descriptors (spec §7.1).

Building and searching are local and pure: no implementation acquisition, no execution, no process start, no network, no full-schema read beyond the digest already computed at catalog time, and no registry exposure change. The snapshot pins the catalog generation; callers detect drift with DiscoveryIndex::is_stale and rebuild instead of silently serving stale records.

Implementations

impl DiscoveryIndex

pub fn build(catalog: &ToolCatalog) -> Result<Self, DiscoveryIndexError>

Build the index from catalog compact descriptors only. Reads id, source class, bounded summary/tags, and schema digest — never the schema locator or the factory.

pub fn generation(&self) -> CatalogGeneration

The catalog generation this snapshot was built from.

pub fn is_stale(&self, catalog: &ToolCatalog) -> bool

True when the catalog has mutated since this snapshot was built. A stale index must be rebuilt, not silently served.

pub fn search( &self, query: &DiscoveryQuery, limits: &SearchLimits, ) -> SearchResults<'_>

Deterministic, bounded, pure keyword search over compact descriptors.

A descriptor matches when its id, summary or tags contain the whole query or any of its DiscoveryQuery::terms (case-insensitive substrings, any order). Matches are ranked:

1. exact id or name: the query equals the id, the name segment, or spells the name’s words (web fetch for web_fetch);
2. the whole query as one substring (the pre-keyword behaviour, so a query that matched before still matches, ahead of partial hits);
3. keyword hits only.

Within a rank, more distinct terms matched comes first, then the higher weight (a term found in the id counts 2, one found only in the summary or tags counts 1), then ToolId order.

Ranked matches are returned while they fit both the remaining count budget and the remaining serialized byte budget. The byte budget accounts the exact compact-JSON array serialization of the returned hits — container brackets (2 bytes even when empty) plus one comma per additional entry — so serde_json::to_vec of the hit collection can never exceed it. The first ranked match that does not fit stops the walk (documented bounded behavior; truncated reports it).

Trait Implementations

impl Clone for DiscoveryIndex

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DiscoveryIndex

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

Formats the value using the given formatter.