<feed xmlns='http://www.w3.org/2005/Atom'>
<title>git/reftable/tree_test.c, branch gitk-resize-error</title>
<subtitle>Fork of git SCM with my patches.</subtitle>
<id>http://git.kilabit.info/git/atom?h=gitk-resize-error</id>
<link rel='self' href='http://git.kilabit.info/git/atom?h=gitk-resize-error'/>
<link rel='alternate' type='text/html' href='http://git.kilabit.info/git/'/>
<updated>2021-10-08T17:45:48Z</updated>
<entry>
<title>reftable: a generic binary tree implementation</title>
<updated>2021-10-08T17:45:48Z</updated>
<author>
<name>Han-Wen Nienhuys</name>
<email>hanwen@google.com</email>
</author>
<published>2021-10-07T20:25:05Z</published>
<link rel='alternate' type='text/html' href='http://git.kilabit.info/git/commit/?id=35425d1034f2a98d438da21c68334056af7033ca'/>
<id>urn:sha1:35425d1034f2a98d438da21c68334056af7033ca</id>
<content type='text'>
The reftable format includes support for an (OID =&gt; 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 &lt;hanwen@google.com&gt;
Signed-off-by: Junio C Hamano &lt;gitster@pobox.com&gt;
</content>
</entry>
</feed>
