<feed xmlns='http://www.w3.org/2005/Atom'>
<title>ouroboros/src/lib/btree.h, branch 0.4</title>
<subtitle>Ouroboros main repository</subtitle>
<id>http://www.ouroboros.rocks/cgit/ouroboros/atom?h=0.4</id>
<link rel='self' href='http://www.ouroboros.rocks/cgit/ouroboros/atom?h=0.4'/>
<link rel='alternate' type='text/html' href='http://www.ouroboros.rocks/cgit/ouroboros/'/>
<updated>2017-01-16T14:53:17Z</updated>
<entry>
<title>lib: Add B-tree implementation</title>
<updated>2017-01-16T14:53:17Z</updated>
<author>
<name>dimitri staessens</name>
<email>dimitri.staessens@intec.ugent.be</email>
</author>
<published>2017-01-16T12:40:57Z</published>
<link rel='alternate' type='text/html' href='http://www.ouroboros.rocks/cgit/ouroboros/commit/?id=fac7ffe8ea9f42ebcf67c011c944d165cbab3e3b'/>
<id>urn:sha1:fac7ffe8ea9f42ebcf67c011c944d165cbab3e3b</id>
<content type='text'>
Adds an implementation of B-trees of order k (k children, min fill is
k/2, max fill k - 1). Useful to implement indexes for faster lookups.
</content>
</entry>
</feed>
