Struct GreedySelector 

pub struct GreedySelector;

Budget-constrained greedy packer.

Filters by SelectorWeights.min_score, applies category_weights multipliers to adjust scores, then greedily packs until the budget is exhausted. When diversity_bias > 0, uses a pick-best-remaining loop instead of a single sort pass. Tie-breaking is deterministic: effective score descending, size ascending, then id ascending. See crates/khive-fold/docs/design.md#adr-024-bayesian-extensions-selector-budget-packing-and-precision-weighted-scoring for the diversity-penalty formula.

Trait Implementations

impl Clone for GreedySelector

fn clone(&self) -> GreedySelector

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GreedySelector

impl Debug for GreedySelector

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

Formats the value using the given formatter.

impl Default for GreedySelector

fn default() -> GreedySelector

Returns the “default value” for a type.

impl<T: Clone> Selector<T> for GreedySelector

fn select( &self, inputs: Vec<SelectorInput<T>>, budget: usize, weights: &SelectorWeights, ) -> Result<SelectorOutput<T>, FoldError>

Select a budget-constrained subset from inputs.