New Features
commit::Ancestors::with_commit_graph(graph)
to set and use a commitgraph.
That way, traversal speed is greatly improved for traversals that only need
access to parents and commit time, while still being more efficient if it
saves the caller to retrieve a commit again to parse it for parents.
New Features (BREAKING)
-
gix_traverse::commit::Ancestors
now returns rich commit information.
As part of the iteration, it will decode part of the commit and read parents and possibly
the commit time if time-based sorting is desired. These values will now be made available
instead of just theid
of the commit.This saves the caller time to parse the commit again in case it needs similar information.
Bug Fixes (BREAKING)
-
previously the commit-traversal sorted by date must have been wonky & rename
Sorting::Topological
toSorting::BreadthFirst
.
This is now fixed by using a proven data structure, theBinaryHeap
as priority
queue.The rename is to differentiate
git log --topo-order
from what we are doing, which is actually quite
different.
Commit Statistics
- 5 commits contributed to the release.
- 3 days passed between releases.
- 3 commits were understood as conventional.
- 0 issues like '(#ID)' were seen in commit messages
Commit Details
view details
- Uncategorized
- Prepare changelogs prior to release (298f3d7)
- Merge branch 'walk-with-commitgraph' (fdee9a2)
commit::Ancestors::with_commit_graph(graph)
to set and use a commitgraph. (6c5c66e)- Previously the commit-traversal sorted by date must have been wonky & rename
Sorting::Topological
toSorting::BreadthFirst
. (affc9df) gix_traverse::commit::Ancestors
now returns rich commit information. (8d7b627)