Struct BaseSync 

pub struct BaseSync {
    pub tip: String,
    pub behind: usize,
    pub attempts: usize,
    pub conflict: Option<String>,
}

How far the winner’s tree trailed the landing base, last time it was checked, and what came of trying to close that gap.

Set by graph::Runner::sync_to_base, which runs before the review loop and again before the gate: verifying against a tree that does not yet contain the base’s tip answers “green on the commit this run branched from”, not “green on what is about to land”, and a merge on that answer can revert whatever landed elsewhere while the run was thinking.

Fields

tip: String

<remote>/<base> tip the tree was last checked against.

behind: usize

Commits tip was ahead of the tree at that check, before any rebase this round tried to close the gap. Zero means the tree already contained tip.

attempts: usize

Rebase attempts spent so far this run, bounded by graph::BASE_SYNC_ROUNDS.

conflict: Option<String>

What git said, if the most recent rebase attempt conflicted or could not be pushed. Some here is what makes a Blocked run read as “stopped on the base, not on review or the gate” - the rebase is not retried again while this is set; a person has to look.

Trait Implementations

impl Clone for BaseSync

fn clone(&self) -> BaseSync

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BaseSync

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for BaseSync

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for BaseSync

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

where __S: Serializer,

Serialize this value into the given Serde serializer.