Sure B-trees are hard to write from the ground up but there are plenty of good i... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		joe_the_user on Sept 16, 2012 \| parent \| context \| favorite \| on: Little-Known Awesome Algorithms: Fenwick Range Tre... Sure B-trees are hard to write from the ground up but there are plenty of good implementations already the Internet that can be modified. The extra functionality is a simple enough addition to any binary-tree-type data structure that I was annoyed that Boost/Qt didn't have it already included.

zvrba on Sept 16, 2012 [–]

> Sure B-trees are hard to write from the ground up but there are plenty of good implementations already the Internet that can be modified.

Care to name some, also having a non-restrictive license? (That excludes GPL).

joe_the_user on Sept 16, 2012 | [–]

Try

http://www.touc.org/btree.html

This c++ template is fairly simple and I have tested it a reasonable amount.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact