summaryrefslogtreecommitdiff
path: root/t
diff options
context:
space:
mode:
authorLibravatar Han-Wen Nienhuys <hanwen@google.com>2021-10-07 20:25:05 +0000
committerLibravatar Junio C Hamano <gitster@pobox.com>2021-10-08 10:45:48 -0700
commit35425d1034f2a98d438da21c68334056af7033ca (patch)
tree28aaf52578a4c41af1351a30f95a96ffe45ab02e /t
parentreftable: reading/writing blocks (diff)
downloadtgif-35425d1034f2a98d438da21c68334056af7033ca.tar.xz
reftable: a generic binary tree implementation
The reftable format includes support for an (OID => ref) map. This map can speed up visibility and reachability checks. In particular, various operations along the fetch/push path within Gerrit have ben sped up by using this structure. The map is constructed with help of a binary tree. Object IDs are hashes, so they are uniformly distributed. Hence, the tree does not attempt forced rebalancing. Signed-off-by: Han-Wen Nienhuys <hanwen@google.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 't')
-rw-r--r--t/helper/test-reftable.c1
1 files changed, 1 insertions, 0 deletions
diff --git a/t/helper/test-reftable.c b/t/helper/test-reftable.c
index c9deeaf08c..050551fa69 100644
--- a/t/helper/test-reftable.c
+++ b/t/helper/test-reftable.c
@@ -6,5 +6,6 @@ int cmd__reftable(int argc, const char **argv)
basics_test_main(argc, argv);
block_test_main(argc, argv);
record_test_main(argc, argv);
+ tree_test_main(argc, argv);
return 0;
}