Module: sets

This module contains a binary search tree implementation of sets

Functions in this module:

Function	Short Description
(set? s)	Check is argument is a set
(set-adjoin e s)	Return new adjoined set
(set-difference set1 set2)	Return set difference
(set-element? element set)	Check if element present
(set-empty operator)	Create empty set
(set-empty? s)	Check for empty set
(set-intersection s1 s2)	Return set intersection
(set-remove e s)	Remove element from set
(set-singleton e operator)	Create set with one element
(set-sum lst)	Sum a list of sets
(set-union s1 s2)	Return set union
(set->list s)	Convert set to list
(list->set l operator)	Convert a list to a set