Struct Candidate 

pub struct Candidate {
    pub repo: String,
    pub number: u64,
    pub tier: Option<ProvenanceTier>,
    pub labelled: bool,
    pub created_ms: u64,
    pub kind: CandidateKind,
}

One thing the loop could work on, reduced to what the decision needs.

Deliberately not a GitHub type. The selection rules are about authorisation, opt-in and duplication — none of which need a body, and all of which are easier to reason about when the body is not reachable. Building one of these is where tracker text stops and decisions begin.

Fields

repo: String

number: u64

tier: Option<ProvenanceTier>

The provenance tier the author resolved to, or None when nobody has resolved it yet.

None is a real state, not a default to be filled in: resolving costs a gh api call per item and goes stale in two minutes, so the live path scans cheaply and tiers only the item it actually reaches. See [ineligible] for why deferring does not widen what may run.

labelled: bool

Whether the target’s opt-in label is present.

created_ms: u64

Unix ms the item was created. The sort key.

kind: CandidateKind

Trait Implementations

impl Clone for Candidate

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Candidate

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

Formats the value using the given formatter.

impl Eq for Candidate

impl PartialEq for Candidate

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Candidate