diff options
| author |  Daphne Preston-Kendal
| 2021-12-29 19:04:22 +0100 |
|---|---|---|
| committer | Daphne Preston-Kendal
| 2021-12-29 19:04:22 +0100 |
| commit | 54dd7e085b8a58af5ee32ca03207517895e4e422 (patch) | |
| tree | 800ce3890c05f38b8ec2db4914970e57689551ff /srfi-228.html | |
| parent | Delete old examples, note that new ones are needed (diff) | |
Add missing space
Diffstat (limited to 'srfi-228.html')
| -rw-r--r-- | srfi-228.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/srfi-228.html b/srfi-228.html index c78d98f..407a279 100644 --- a/srfi-228.html +++ b/srfi-228.html @@ -70,7 +70,7 @@ <h2 id=further-work>Further work</h2> -<p>The author hopes that a future SRFI will add a procedure for creating comparators yielding lexicographical order over any sequence type by delegating to a common iteration protocol. An idea to do this using <code>fold</code> procedures foundered on two grounds: the first and more intrinsic one is that <code>fold</code> called on two sequences, one of which is a prefix of the other, cannot determine which of the two is longer, and a sort using <code>fold</code>-based iteration would incorrectly consider them equal; the second is that there is currently an inconsistency among Scheme libraries in what order the <var>kons</var> procedure argument to <code>fold</code> receives the accumulator and the next values in the sequence (compare <a href="https://srfi.schemers.org/srfi-1/srfi-1.html#fold">SRFI 1 <code>fold</code></a> with <a href="https://srfi.schemers.org/srfi-133/srfi-133.html#vector-fold">SRFI 133<code>vector-fold</code></a>). <a href="https://srfi.schemers.org/srfi-158/srfi-158.html">SRFI 158</a> generators were rejected on the ground that their sequences cannot contain any arbitrary Scheme datum. +<p>The author hopes that a future SRFI will add a procedure for creating comparators yielding lexicographical order over any sequence type by delegating to a common iteration protocol. An idea to do this using <code>fold</code> procedures foundered on two grounds: the first and more intrinsic one is that <code>fold</code> called on two sequences, one of which is a prefix of the other, cannot determine which of the two is longer, and a sort using <code>fold</code>-based iteration would incorrectly consider them equal; the second is that there is currently an inconsistency among Scheme libraries in what order the <var>kons</var> procedure argument to <code>fold</code> receives the accumulator and the next values in the sequence (compare <a href="https://srfi.schemers.org/srfi-1/srfi-1.html#fold">SRFI 1 <code>fold</code></a> with <a href="https://srfi.schemers.org/srfi-133/srfi-133.html#vector-fold">SRFI 133 <code>vector-fold</code></a>). <a href="https://srfi.schemers.org/srfi-158/srfi-158.html">SRFI 158</a> generators were rejected on the ground that their sequences cannot contain any arbitrary Scheme datum. <h2 id=examples>Examples</h2> |