Struct Court 

pub struct Court { /* private fields */ }

Incremental complete-cost court.

Court::offer serializes, decode-round-trips, and prices one candidate, keeping only the current best. A streaming caller (see crate::encode::candidates::propose_each) therefore holds at most one unpriced candidate’s payload at a time instead of the whole portfolio, which bounds encoder memory on large inputs.

Implementations

impl Court

pub fn new() -> Self

An empty court.

pub fn offer( &mut self, input: &[u8], c: Candidate, limits: Limits, ) -> Result<()>

Price one candidate and retain it only if it beats the current best.

pub fn finish(self) -> Result<CourtResult>

The winning candidate.

Trait Implementations

impl Default for Court

fn default() -> Self

Returns the “default value” for a type.