Re: Implementing a search tree in Metakit?

Jack Diederich <[email protected]>:
>
[snip]
> 
> Why not just use a library that does B-trees?

Because I don't need B-trees :)

I just need a B-tree-like structure, but my own key types and
algorithms for building and searching. I could use GiST [1], but the
problem is that I want to experiment with some not-quite-B-tree-like
structures as well, in an implementation as similar as possible. I
thought about doing all the low-level memory management myself, but it
seemed that Metakit could make everything quite a bit simpler...

> If you are using python check out the bsddb module,

Yeah, I've used that in the past. Quite nice :) Not what I need now,
though.

(I'm using both Python and C++, really -- or plan to. So Metakit seems
like a nice "go-between" way of representing the tree structure.)

[snip]
> If you want B-trees the easiest thing to do would be to use B-trees...

Indeed.

-- 
Magnus Lie Hetland           "Lousy minor setbacks! This world sucks!"
http://hetland.org                                      Homer Simpson
_____________________________________________
Metakit mailing list  -  [email protected]
http://www.equi4.com/mailman/listinfo/metakit