Expand description

Wrapper around the Eden SCM directed acyclic graph implementation, which allows for efficient graph queries.

Structs

Interface to access the directed acyclic graph (DAG) representing Git’s commit graph. Based on the Eden SCM DAG.

Functions

Eagerly convert a CommitSet into a Vec<NonZeroOid> by iterating over it, preserving order.
Sort the given set of commits topologically. In the case of two commits being unorderable, sort them using a deterministic tie-breaking function. Commits which have been garbage collected and are no longer available in the repository are omitted.
Union together a list of CommitSets.

Type Definitions

A compact set of commits, backed by the Eden DAG.
A vertex referring to a single commit in the Eden DAG.