Struct SearchRegistry 

pub struct SearchRegistry { /* private fields */ }

The set of providers a search surface draws from. One registry can back a single app (its own providers) or, in the shell, every app’s providers at once for a global Ctrl+K.

Implementations

impl SearchRegistry

pub fn new() -> SearchRegistry

pub fn register( &mut self, provider: Box<dyn SearchProvider>, ) -> &mut SearchRegistry

pub fn register_fn<F>( &mut self, name: impl Into<String>, f: F, ) -> &mut SearchRegistry

where F: Fn(&str) -> Vec<SearchResult> + 'static,

pub fn provider_count(&self) -> usize

pub fn provider_names(&self) -> Vec<&str>

In registration order.

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

Sorted by descending rank_key; ties keep provider registration order (a stable sort), so ranking is deterministic.

pub fn query_limited(&self, query: &str, limit: usize) -> Vec<SearchResult>

Bounded cross-provider merge for interactive global search. Providers stop materialising once their share is full, canonical action aliases collapse to one row, and only the best limit hits survive.

pub fn query_grouped(&self, query: &str) -> Vec<SearchGroup>

Groups appear in the order their best result ranks; within a group, results stay in ranked order.

pub fn query_grouped_capped( &self, query: &str, per_group_cap: usize, ) -> Vec<SearchGroup>

Caps each group to per_group_cap results, so no single busy provider floods the overlay. 0 means uncapped.

Trait Implementations

impl Default for SearchRegistry

fn default() -> SearchRegistry

Returns the “default value” for a type.