[REBOL] Anyone needs a B*-TREE?
From: g::santilli::tiscalinet::it at: 2-May-2002 12:38
Hello all,
I just finished the code to handle a b*-tree (I need it for
indexes in dbms3.r), and I thought I should drop a line to this
list. Of course it is slower than hash! because it is not native,
but gives you the advantage of having all the keys always in
order. If you think it could be useful to have it stand-alone,
I'll release it.
Regards,
Gabriele.
--
Gabriele Santilli <[g--santilli--tiscalinet--it]> -- REBOL Programmer
Amigan -- AGI L'Aquila -- REB: http://web.tiscali.it/rebol/index.r
