Scheme Request for Implementation 153,
by John Cowan,
has gone into final status.
The document and an archive of the discussion are available at
Here's the abstract:
Osets are immutable collections that can contain any Scheme objects as
long as a total order exists among the objects. Osets enforce the
constraint that no two elements can be the same in the sense of the
oset's associated equality predicate. The elements in an oset appear
in a fixed order determined by the comparator used to create it.
Here is the commit summary since the most recent draft:
- editorial changes
Here are the diffs since the most recent draft:
Many thanks to John and to everyone who contributed to the discussion
of this SRFI.