Yuya Nishihara 2cb7e91dc7 merged_tree: do not re-look up non-conflicting tree values by name ... While measuring file(path) query, I noticed BTreeMap lookup appears in perf. It actually has a measurable cost if the history is linear and parent trees don't have to be merged dynamically. For merge-heavy history, the cost of tree merges is more significant. I'll address that separately. ``` % hyperfine --sort command --warmup 3 --runs 50 -L bin jj-1,jj-2 \ 'target/release-with-debug/{bin} -R ~/mirrors/git --ignore-working-copy \ log -r "::trunk() & ~merges() & file(root:builtin)" --no-graph -n100' Benchmark 1: target/release-with-debug/jj-1 .. Time (mean ± σ): 239.7 ms ± 7.1 ms [User: 192.1 ms, System: 46.5 ms] Range (min … max): 222.2 ms … 249.7 ms 50 runs Benchmark 2: target/release-with-debug/jj-2 .. Time (mean ± σ): 201.7 ms ± 6.9 ms [User: 153.7 ms, System: 46.6 ms] Range (min … max): 184.2 ms … 211.1 ms 50 runs Relative speed comparison 1.19 ± 0.05 target/release-with-debug/jj-1 .. 1.00 target/release-with-debug/jj-2 .. ```		2024-08-09 00:17:37 +09:00
..
benches
gen-protos
proc-macros	cargo: explicitly indicate paths to publish	2024-04-15 20:37:00 -07:00
src	merged_tree: do not re-look up non-conflicting tree values by name	2024-08-09 00:17:37 +09:00
tests	merged_tree: make TreeDiffIterator accept trees as &Merge<Tree>	2024-08-08 23:05:37 +09:00
testutils	tests: make helpers create non-legacy trees	2024-07-24 14:33:05 +02:00
Cargo.toml	revset: create DatePattern type	2024-08-01 09:04:07 -07:00
LICENSE