Struct GraphAheadBehind 

pub struct GraphAheadBehind {
    pub ahead: usize,
    pub behind: usize,
}

The result of checking the relationship between two commits in the commit graph.

Fields

ahead: usize

The number of commits the given commit is ahead of the other.

behind: usize

The number of commits the given commit is behind the other.

Implementations

impl GraphAheadBehind

pub fn is_linear(&self) -> bool

Whether self represents a linear history between two commits.

The following three conditions are equivalent characterizations of a linear history:

1. One commit is ahead and not behind of the other.
2. One commit is behind and not ahead of the other.
3. One commit can be “fast-forwarded” to the other.

Trait Implementations

impl Clone for GraphAheadBehind

fn clone(&self) -> GraphAheadBehind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphAheadBehind

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

Formats the value using the given formatter.

impl Hash for GraphAheadBehind

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for GraphAheadBehind

fn eq(&self, other: &GraphAheadBehind) -> 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 Copy for GraphAheadBehind

impl Eq for GraphAheadBehind

impl StructuralPartialEq for GraphAheadBehind