forked from mirrors/jj
8cdf6d752c
This basically means that the change ids are interned. We'll implement binary search over the sorted change ids table. The table could be sorted differently for better cache locality, but it is in lexicographical order for simplicity. With my testing, the cost of the id lookup isn't dominant. Unlike the parent entries, the size of the per-id overflow items isn't saved. That's s because the number of the same-change-id commits is either 1 or many. It doesn't make sense to allocate 8 bytes for each change id. Instead, we'll pay extra indirection cost to determine the size. |
||
|---|---|---|
| .. | ||
| benches | ||
| gen-protos | ||
| src | ||
| tests | ||
| testutils | ||
| Cargo.toml | ||
| LICENSE | ||