[plt-scheme] efficient set implementation

Galore version 3 uses red-black trees for sets and tables on ordered
data.  You might want to look at Galore 2 which had more options for
different implementations, and was more finely tuned for performance.
Galore 3 is still a work in progress.

--
Carl Eastlund

On 9/4/06, Jefferson Heard <heard at duvel.ir.iit.edu> wrote:
> 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.
>
> -- Jeff