Re: Queston about Binary Search Trees

[Sven N. Thommesen]

At 12:24 PM 11/8/1998 -0600, Paul wrote:
>
>
>Assuming I can get this all to work just right, there is a big advantage
>out of it. It not only makes the program run more quickly, but it also
>lets me cut out about 100 lines of code that were previously dedicated
>to sorting items into a list and sifting through it to find the
>top-ranked items. Much cleaner and neater!

And you *are* going to hide all that GNU C-library stuff inside an
object/agent and submit it for inclusion in 1.4, right ... ?

Cheers,
Sven


                  ==================================
   Swarm-Support is for discussion of the technical details of the day
   to day usage of Swarm.  For list administration needs (esp.
   [un]subscribing), please send a message to <address@hidden>
   with "help" in the body of the message.