Yuya Nishihara 951eb0b61a revset: use filter intersection for tree containing filter ... This basically transforms 's1 & (f() | s2)' to 's1.iter().filter(all && f || s2)'. Still the predicate part includes "all", the filter function doesn't need to load commit data for every entry since 's1.iter().filter(all)' is tested first. To optimize "all" predicate out, maybe we can add a wrapper that returns '|_: &IndexEntry| true'. Instead of inserting AsFilter(_) node, I could add a recursive is_filter() function. That would also work so long as the height of RevsetExpression tree is limited. I chose node insertion just for ease of snapshot testing.		2022-12-07 11:01:59 +09:00
..
test_bad_locking.rs
test_commit_builder.rs
test_commit_concurrent.rs
test_conflicts.rs	Rename FileConflictData to ConflictHunk, use it in files.rs.	2022-12-03 15:12:40 -08:00
test_diff_summary.rs
test_git.rs	git: on export, use repo view's git_refs as record of old export state	2022-12-03 09:32:49 -08:00
test_index.rs
test_init.rs
test_load_repo.rs
test_merge_trees.rs
test_mut_repo.rs
test_operations.rs
test_refs.rs
test_revset.rs	revset: use filter intersection for tree containing filter	2022-12-07 11:01:59 +09:00
test_revset_graph_iterator.rs
test_rewrite.rs
test_view.rs	view: test that merging divergent rewrites results in both commits visible	2022-12-01 19:20:38 -08:00
test_working_copy.rs	git: do not delete or track git submodules.	2022-12-01 23:14:55 +05:30
test_working_copy_concurrent.rs
test_working_copy_sparse.rs
test_workspace.rs