Struct BeamSearch 

pub struct BeamSearch { /* private fields */ }

Beam search - explores multiple paths simultaneously.

Keeps top beam_width candidates at each level, providing a balance between exploration and computational cost.

Pilot Integration

When a Pilot is provided, the algorithm consults it at fork points (when multiple candidates are available) to get semantic guidance on which branches are most relevant to the query.

Implementations

impl BeamSearch

pub fn new() -> Self

Create a new beam search with default beam width.

pub fn with_width(width: usize) -> Self

Create beam search with specified width.

Trait Implementations

impl Default for BeamSearch

fn default() -> Self

Returns the “default value” for a type.

impl SearchTree for BeamSearch

fn search<'life0, 'life1, 'life2, 'life3, 'life4, 'async_trait>( &'life0 self, tree: &'life1 DocumentTree, context: &'life2 RetrievalContext, config: &'life3 SearchConfig, pilot: Option<&'life4 dyn Pilot>, ) -> Pin<Box<dyn Future<Output = SearchResult> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait, 'life4: 'async_trait,

Search the tree for relevant nodes.

fn name(&self) -> &'static str

Get the name of this search algorithm.

fn search_without_pilot<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, tree: &'life1 DocumentTree, context: &'life2 RetrievalContext, config: &'life3 SearchConfig, ) -> Pin<Box<dyn Future<Output = SearchResult> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Search without Pilot (uses default algorithm scoring).