Enum BisectStep 

pub enum BisectStep {
    Testing {
        hash: Hash,
        remaining: usize,
    },
    Found(Hash),
    Ambiguous {
        bad: Hash,
        skipped: Vec<Hash>,
    },
    NeedMore,
}

Outcome of a single bisect iteration.

Variants

Testing

We are now testing this commit. remaining is the candidate count BEFORE this iteration’s pick.

Fields

hash: Hash

remaining: usize

Found(Hash)

First-bad commit identified.

Ambiguous

Only skipped commits remain between good and bad, so the first-bad commit is ambiguous — it could be bad or any commit in skipped (git’s “The first bad commit could be any of …”). Distinguished from Found so callers don’t report a skipped-over guess as definitive.

Fields

bad: Hash

skipped: Vec<Hash>

NeedMore

We need both at least one good and a bad before we can compute a midpoint.

Trait Implementations

impl Clone for BisectStep

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 BisectStep

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

Formats the value using the given formatter.

impl Eq for BisectStep

impl PartialEq for BisectStep

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BisectStep