Set: Purely Functional Sets

This library provides two implementations of functional sets
backed by hash tables: one comparing elements for equality using
equal?, the other using eq?.

The data structures of this library are immutable. They are
implemented on top of PLT Scheme’s immutable hash tables, and
therefore should have O(1) running time for extending and
O(logn) running time for lookup.