Boost logo

Boost :

From: Jose (jmalv04_at_[hidden])
Date: 2006-10-24 12:47:18

Yes, Btree as in
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

On 10/24/06, Joe Drumm <joe.drumm_at_[hidden]> wrote:
> I think he is talking about BTrees, as in
>, and not normal binary trees.
> These are used for example by RDBMS engines for index storage. They
> are self-balancing in that each node can contain a variable number of
> keys between a given range. Nodes split when they become "too full"
> (likewise they merge when sufficient space is available through
> removal of keys).
> Joe

Boost list run by bdawes at, gregod at, cpdaniel at, john at