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: at each step the item with the highest effective score (after diversity penalty) is selected. The penalty is score * (1 - bias * n / (n + 1)) where n is the number of already-selected items in the same category. At bias=0 this collapses to a single-pass sort (backward-compatible).

Tie-breaking is deterministic: size ascending, then id ascending.

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 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>

impl Copy for GreedySelector