Struct ProposalRound 

pub struct ProposalRound {
    pub repo: String,
    pub branch: String,
    pub base: String,
    pub proposals: Vec<Proposal>,
}

The proposals aimed at one branch of one repository, plus the base they are aimed at.

Fields

repo: String

The repository, as the view names it (<owner>/<name>.git).

branch: String

The branch proposals are aimed at, short form (main).

base: String

The branch’s commit when the round was read, and the prev every landing in it is CAS’d against.

proposals: Vec<Proposal>

The round’s proposals, in refname order.

Implementations

impl ProposalRound

pub fn from_view(view: &View, repo: &str, branch: &str) -> Option<Self>

Reads the round for repo and branch out of view.

None when the branch does not exist: there is nothing to propose to, and a queue that invented a base would be deciding what a repository’s history starts from.

Ordering is by refname, and deliberately not by when the ref was pushed. The view records no push time, and taking the order from the op log’s sequence numbers would make a round’s behaviour depend on how far the log had been compacted.

pub fn changes(&self) -> Vec<Change>

The round as queue input.

The workspace is the proposal’s own refname, so a landing recorded against a workspace names the thing that was proposed rather than a number only this round knows.

pub fn target_ref(&self) -> String

The view key of the branch this round lands on.

pub fn already_integrated(&self, workdir: &Path) -> Vec<u64>

The proposals in this round whose head is already an ancestor of the branch: landed by an earlier round, or merged some other way.

Proposal refs survive their landing on purpose (sweeping one would decide on the author’s behalf that the change is done), and the queue’s own already-landed memory lives in a MergeQueue that a node builds fresh per round. Without this, every landed proposal re-entered every later round as a no-op merge, costing a CI run and a landing op each time. Ancestry is read from git in workdir, a worktree of the served repository.

Trait Implementations

impl Clone for ProposalRound

fn clone(&self) -> ProposalRound

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProposalRound

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

Formats the value using the given formatter.

impl PartialEq for ProposalRound

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for ProposalRound

impl StructuralPartialEq for ProposalRound