Need in-memory search-tree
Steve Flynn
anothermindbomb at gmail.com
Thu Jan 24 23:11:47 UTC 2013
On 24 January 2013 22:55, Wes James <comptekki at gmail.com> wrote:
>> I'm programming a tool in C that needs to keep a really fast database
>> in memory. The most likely candidates are red-black or AVL trees.
>> Deletion need not be supported, so long as the whole thing can be
>> discarded to reclaim the memory. I could write it, but I'd rather not.
http://en.literateprograms.org/Red-black_tree_(C)
Pretty much all the C code you'd need to implement. Cut and paste.
--
Steve
When one person suffers from a delusion it is insanity. When many
people suffer from a delusion it is called religion.
More information about the ubuntu-users
mailing list