Struct CompetitiveSelectionRanked 

pub struct CompetitiveSelectionRanked {
    pub scores: Vec<u64>,
    pub selected: Vec<bool>,
    pub k: usize,
    pub max_score: u64,
}

Ranked competitive selection: pick the top-K candidates by score.

Fields

scores: Vec<u64>

Candidate scores by candidate index.

selected: Vec<bool>

Current selected membership by candidate index.

k: usize

Maximum selected cardinality.

max_score: u64

MaxScore for this refinement profile.

Implementations

impl CompetitiveSelectionRanked

pub fn new( scores: Vec<u64>, k: usize, max_score: u64, ) -> CompetitiveSelectionRanked

Construct from scores; nothing selected yet (TLA+ Init).

pub fn select(&mut self)

Select the top-K (TLA+ Select): mark up to K highest-scoring candidates, re-establishing BoundedMultiplicity and ThresholdOptimality.

pub fn update_scores(&mut self, new_scores: Vec<u64>)

Replace the scores and clear the selection (TLA+ UpdateScores).