mirror of
https://github.com/martinvonz/jj.git
synced 2025-01-02 18:01:05 +00:00
524db833f7
We could add `walk.descendants(root_positions)` method, and apply `.filter_by_generation(range)`, but queue-based `.descendants()` would be slower than the one using reachable set. So I didn't add such method. I also considered reimplementing non-lazy version of this function without using the current RevWalkGenerationRange, but it appears the current iterator version performs well even if we have to do .collect_vec() and .reverse(). |
||
---|---|---|
.. | ||
benches | ||
gen-protos | ||
src | ||
tests | ||
testutils | ||
build.rs | ||
Cargo.toml |