forked from mirrors/jj
4d5936983a
Since 'filter(expr)' is identical to 'expr & filter()', it can be rewritten in order to minimize the candidates set to be scanned. The implementation is somewhat similar to revsetlang.optimize() of Mercurial, but I've split the tree rewriting logic to several steps. I think that's good for maintainability and should help us conclude that a recursion will eventually terminate. |
||
---|---|---|
.. | ||
src | ||
tests | ||
build.rs | ||
Cargo.toml |