Red­Docket

This is a draft of proposals for the Red Edition (data structures) of R7RS-large. For other dockets, see WG2Dockets.

Basic types and sorting

List library: SRFI 1.

String library: SRFI 13 and/or SRFI 130.

Vector library: SRFI 43, adding VectorsCowan into account (to be SRFI 133).

Sorting and merging: SRFI 132) or SRFI 95 (from SLIB) or R6RS.

Sets and maps

Comparators: SRFI 128 (stripped-down version of SRFI 114).

Sets and bags: SRFI 113.

Character sets: SRFI 14.

Hash tables: SRFI 125, which is backward compatible with SRFI 69 and includes bimaps; or SRFI 126, which is backward compatible with R6RS.

Immutability

Immutable pairs and lists: SRFI 116.

Random access pairs and lists: SRFI 101.

Immutable deques: ImmutableDataStructuresWortman, to be SRFI 134

Immutable sets: ImmutableDataStructuresWortman, to be SRFI 135

Immutable maps: ImmutableDataStructuresWortman, to be SRFI 136

Laziness

Generators: SRFI 121.

Lazy sequences: SRFI 127.

Streams: SRFI 41.

Miscellaneous

Boxes: SRFI 111.

List queues: SRFI 117.

Extended records: SRFI 99, possibly with SRFI 129.

Ephemerons: SRFI 124.