2265a61 REVIEW: I believe "commit graph" is more widely used. — heartwood

Radicle Heartwood Protocol & Stack

REVIEW: I believe "commit graph" is more widely used.

Lorenz Leutgeb committed 9 months ago

commit 2265a61c41aee8273fb7a593e81850e863cc7b53
parent 92b03f1690f43dc73838f9adf34a4e6cd06eecf9

2 files changed +3 -3

modified crates/radicle/src/git/canonical.rs

@@ -422,7 +422,7 @@ impl fmt::Display for ObjectType {

     }
 }
 /// The result of checking the relationship between two commits in the Git graph.
 /// The result of checking the relationship between two commits in the commit graph.
 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
 pub struct GraphAheadBehind {
     /// The number of commits the given commit is ahead of the other.

modified crates/radicle/src/git/canonical/convergence.rs

@@ -81,9 +81,9 @@ struct Candidate {

 /// The "effect" that needs to be performed due to the result of
 /// [`Candidate::compare_to_candidate`].
 enum Effect {
     /// Perform a check of the Git graph using the `commit` and `upstream`.
     /// Perform a check of the commit graph using the `commit` and `upstream`.
     GraphCheck { commit: Oid, upstream: Oid },
     /// Mark that tags always converge – their is no ancestry check.
     /// Mark that tags always converge – there is no ancestry check.
     TagConverges,
     /// Skip the [`Did`] since it is the same as the [`Candidate`].
     SkipSelf,