Struct TieredExprDatabase 

pub struct TieredExprDatabase { /* private fields */ }

Database with tiered storage for efficient priority-based searching

Expressions are organized by complexity tiers, allowing searches to process simpler expressions first and potentially skip higher tiers when good matches are found.

Implementations

impl TieredExprDatabase

pub fn new() -> Self

Create a new empty tiered database

pub fn insert(&mut self, expr: EvaluatedExpr)

Insert an expression into the appropriate tier

pub fn finalize(&mut self)

Finalize the database by sorting each tier by value

pub fn total_count(&self) -> usize

Get total count of expressions across all tiers

pub fn tier_count(&self, tier: ComplexityTier) -> usize

Get count for a specific tier

pub fn range_in_tier( &self, tier: ComplexityTier, low: f64, high: f64, ) -> &[EvaluatedExpr]

Find expressions in a specific tier within the value range [low, high]

pub fn iter_tiers_in_range(&self, low: f64, high: f64) -> TieredRangeIter<'_>

Create an iterator that yields expressions from all tiers in order (Tier 0 first, then Tier 1, etc.) within a value range

Trait Implementations

impl Default for TieredExprDatabase

fn default() -> Self

Returns the “default value” for a type.