Hi Gabriele, I think it would be great if you released it stand-alone!
Examples of key algorithms and concepts in REBOL are a real boon for the community. Thanks, Rod. > 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 <[EMAIL PROTECTED]> -- REBOL Programmer >Amigan -- AGI L'Aquila -- REB: http://web.tiscali.it/rebol/index.r > >-- >To unsubscribe from this list, please send an email to >[EMAIL PROTECTED] with "unsubscribe" in the >subject, without the quotes. > > Rod Gaither Oak Ridge, NC - USA [EMAIL PROTECTED] -- To unsubscribe from this list, please send an email to [EMAIL PROTECTED] with "unsubscribe" in the subject, without the quotes.
