(((name . "set-xor")
  (signature lambda ((set? set1) (set? set2) ...) set?)
  (desc "
A left associative version of `set-xor` from SRFI-113 that takes any number
of arguments."))
 ((name . "set->generator")
  (signature
   case-lambda
   (((set? set)) procedure?)
   (((set? set) *) procedure?))
  (desc "
Returns a generator that returns the elements of `set` in arbitrary order.

This generator is always finite."))
 ((name . "set-adjoin-all")
  (signature
   lambda ((set? set) (list? elements)) set?)
  (desc "
Equivalent to `(apply set-adjoin set elements)`."))
 ((name . "set-replace-all")
  (signature
   lambda ((set? set) (list? elements)) set?)
  (desc "
Equivalent to `(apply set-replace set elements)`."))
 ((name . "generator->set")
  (signature lambda ((comparator? comparator) (generator? gen)) set?)
  (desc "
* It is an error if `gen` is not finite.
* It is an error if the elements of `gen` are not comparable by
  `comparator`.

Returns a set whose elements are the elements of `gen`. If there are
duplicate elements in `gen`, the latest one will be kept."))
 ((name . "set->in-order-generator")
  (signature
   lambda ((set? set)) generator?)
  (desc "
Like `generator->set`, but elements are returned in order."))
 ((name . "set->reverse-order-generator")
  (signature
   lambda ((set? set)) generator?)
  (desc "
Like `generator->set`, but elements are returned in reverse order."))
 ((name . "compatible-sets?")
  (signature lambda ((set? set1) (set? set2) ...) set?)
  (desc "
Returns `#t` if each set has the same comparator, and `#f` otherwise.")))