Struct Outcome

pub struct Outcome {
    pub longest_path_length: Option<u32>,
    pub num_commits: u32,
    pub parent_counts: BTreeMap<u32, u32>,
}

Statistics gathered while verifying the integrity of the graph as returned by Graph::verify_integrity().

Fields

longest_path_length: Option<u32>

The length of the longest path between any two commits in this graph.

For example, this will be Some(9) for a commit graph containing 10 linear commits. This will be Some(0) for a commit graph containing 0 or 1 commits. If the longest path length is too large to fit in a u32, then this will be None.

num_commits: u32

The total number of commits traversed.

parent_counts: BTreeMap<u32, u32>

A mapping of N -> number of commits with N parents.

Trait Implementations

impl Clone for Outcome

fn clone(&self) -> Outcome

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Outcome

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Outcome

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Outcome

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for Outcome

impl StructuralPartialEq for Outcome