[plt-scheme] efficient set implementation

[Hans Oesterholt-Dijkema]

> AVL trees only support the set-union operation in O(n) time.  I 
> haven't checked galore for it yet, but I'd suspect that the author 
> uses something more efficient to represent sets, such as a binomial 
> heap.  I know for my purposes, galore's amazingly fast and its bonus 
> of referential transparency just plain rocks.  I love not having to 
> make copies of a data structure to make sure I have a clean copy.
I understand. However, I needed something that could handle shared 
parallel access on the same datastructure and, if I remember well, 
galore implements it's structures in a functional way, i.e., each thread 
will eventually have it's own copy.

--Hans
 
>
> -- Jeff
>
>