Struct Tally 

pub struct Tally {

    pub first_choice: BTreeMap<char, usize>,
    pub borda: BTreeMap<char, usize>,
    pub winner: char,
    pub rankings: usize,
    pub unanimous_initial: bool,
    pub deliberated: bool,
    pub changed_votes: usize,
    pub unanimous_final: bool,
    pub tie_break: Option<String>,
    pub judges: usize,
    pub present: usize,
    pub quorum: usize,
    pub met_quorum: bool,
    pub uncontested: Option<String>,
}

The mechanical count.

Fields

first_choice: BTreeMap<char, usize>

First-choice votes per label.

borda: BTreeMap<char, usize>

Borda points from the initial rankings, used only to break a tie.

winner: char

The winning label.

rankings: usize

How many judges produced a usable ranking. A panel of one is not a consensus and must not be reported as a split.

unanimous_initial: bool

Did every judge’s initial first choice agree?

deliberated: bool

Was deliberation run?

changed_votes: usize

Judges who moved between their initial ranking and their final vote.

unanimous_final: bool

Did the final votes agree?

tie_break: Option<String>

How the tie was broken, when it had to be.

judges: usize

Configured judge count — the size of the full panel. 0 when no panel was asked (see uncontested), not the roster size a panel that never sat would have had.

present: usize

Judges who actually contributed to the decision (not taken out by a rate limit and producing a usable rank or vote).

quorum: usize

How many judges are required for a trustworthy verdict. Chosen as a strict majority (judges / 2 + 1): a verdict backed by a minority must never be presented as a healthy one, while a bare majority is still real signal. A one-candidate run needs no quorum.

met_quorum: bool

present >= quorum, or no quorum was required.

uncontested: Option<String>

Why no panel was asked, when none was: a single viable candidate, or a review-only run that never competed. None when judges actually ranked and voted — including when too few of them survived to reach quorum, which is a collapse and must keep reading as one.

Trait Implementations

impl Clone for Tally

fn clone(&self) -> Tally

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Tally

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Tally

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for Tally

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.