test bulk set generators

1 files changed, 3 insertions, 17 deletions

diff --git a/README.md b/README.md
index bb77bc7..2bbf78a 100644
--- a/README.md
+++ b/README.md
@@ -22,8 +22,9 @@ Benefits of using this library:
 
 * `(mcgoron weight-balanced-trees internal)`: low-level operations on tree
   nodes. Includes `join`, `split`, and binary set operations.
-* `(mcgoron weight-balanced-trees srfi 113 set)`: The set operations from
-  [SRFI-113][5], with extra procedures.
+* `(mcgoron weight-balanced-trees srfi 113 set)`: Exposes an interface like
+  [SRFI-113][5], but with extra procedures. This can be used to implement the
+  other SRFIs using disjoint container types.
 
 [5]: https://srfi.schemers.org/srfi-113/srfi-113.html
 
@@ -32,21 +33,6 @@ Benefits of using this library:
 Tests of set operations are implemented in terms of the SRFI-1 list-set
 operations.
 
-The implementation of the SRFI interfaces uses [generators][3] for
-iteration whenever a function can terminate in the middle of a set (like
-`set-every?`). Generators are usually lightweight, but are intrinsically
-mutating.  Some Scheme implementations, like CHICKEN, implement
-write-barriers in their garbage collectors, which make mutation slower
-(See ["Mutations"][4]).
-
-Alternative implementation strategies include:
-
-* escape continuations (`call/cc` might be slow, `call/ec` is not
-  standard, `guard` could be used to emulate escape continuations)
-* direct recursion (would have to traverse the whole set before
-  terminating)
-* sentinel-value return (uglier)
-
 The linear update procedures are the same as the functional procedures.
 
 [3]: https://srfi.schemers.org/srfi-158/srfi-158.html