From: David Abrahams (dave_at_[hidden])
Date: 2006-10-25 08:26:05
Beman Dawes <bdawes_at_[hidden]> writes:
> Jose wrote:
>> Yes, Btree as in http://en.wikipedia.org/wiki/B-tree
>> I think a Btree would be a nice addition to Boost.
>> I am looking for a generic B-tree that I can use to store any C++ object,
>> with variable length key and data fields
> I considered submitting a Boost B-tree a long time ago, and did a trial
> implementation. But I ran into a lot of issues, so scraped it.
> At the beginning of the past summer I looked at B-trees again, this time
> using the Lehman and Yao locking algorithm. It looks doable, but would
> take more time than I have available.
> I also came to the conclusion that C++0x Concepts would be a great help
> in the design. There are a bunch of types involved, and I was having a
> trouble getting the interrelationships right. With Concepts, the
> compiler will tell me if I mess up, speeding the development process.
You can get pretty close using the concept checking library today.
It's terribly underused, is capable of uncovering nearly all the
same kinds of problems, and the syntax of use has recently become lots
more like C++0x (not documented yet, though).
-- Dave Abrahams Boost Consulting www.boost-consulting.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk