Struct git_commitgraph::graph::verify::Outcome [−][src]
pub struct Outcome {
pub longest_path_length: Option<u32>,
pub num_commits: u32,
pub parent_counts: BTreeMap<u32, u32>,
}
Expand description
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
Auto Trait Implementations
impl RefUnwindSafe for Outcome
impl UnwindSafe for Outcome
Blanket Implementations
Mutably borrows from an owned value. Read more