mirror of
https://github.com/martinvonz/jj.git
synced 2025-01-01 17:46:47 +00:00
dddba4675d
We use `heads_ok()` for finding the head operations when there are multiple current op heads. The current DFS-based algortihm needs to always walk all the way to the root. That can be expensive when the operations are slow to retrieve. In the common case where there are two operations close to each other in the graph, we should be able to terminate the search once we've reached the common ancestor. This patch replaces the DFS by a BFS and adds the early termination. |
||
---|---|---|
.. | ||
benches | ||
gen-protos | ||
proc-macros | ||
src | ||
tests | ||
testutils | ||
Cargo.toml | ||
LICENSE |