diff options
| author |  John Cowan
| 2021-07-22 23:53:50 -0400 |
|---|---|---|
| committer | John Cowan
| 2021-07-22 23:53:50 -0400 |
| commit | b16f47a687c2f4d350560ddde433b0abb5a0a779 (patch) | |
| tree | 7c4b047ad41048fc5ba7fc0a456670d75b7f97c2 /srfi-225.html | |
| parent | switching to explicit dtos (diff) | |
typo
Diffstat (limited to '')
| -rw-r--r-- | srfi-225.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/srfi-225.html b/srfi-225.html index 7b797cc..a5ae6c9 100644 --- a/srfi-225.html +++ b/srfi-225.html @@ -54,7 +54,7 @@ similar to an existing hash table.</p> <p>Lists are supported as dictionaries using the specification in this section. If two keys are the same (in the sense of the specified equality predicate), then all but the first are treated as if they did not exist.</p> <p>If <code>plist-dto</code> (see below) is used with a list, then the list is assumed to be a property list, alternating symbol keys with values. Mutation operations actually mutate the property list whenever possible. The equality predicate of this type of dictionary is <code>eq?</code>.</p> <p>If a list is empty, or its car is a pair, then the list can be treated as an alist. New values are added to the beginning of an alist and the new alist is returned; deletion does not mutate the alist, but returns an alist that may or may not share storage with the original alist. If an association has been updated, then both the new and the old association may be processed by the whole-dictionary procedures. The examples in this SRFI use alists.</p> -<p>However, an alist (unlike a hashtable or mapping) does not know with which equality predicate its users intend to use to search it. Therefore, rather than exporting a single DTO for alists, this SRFI provides a procedure <code>make-alist-dto</code> takes an equality predicate and returns a DTO specialized for manipulation of alists using that predicate.</p> +<p>However, an alist (unlike a hashtable or mapping) does not know which equality predicate its users intend to use to search it with. Therefore, rather than exporting a single DTO for alists, this SRFI provides a procedure <code>make-alist-dto</code> takes an equality predicate and returns a DTO specialized for manipulation of alists using that predicate.</p> <p>In all other cases, lists cannot be treated as dictionaries unless a DTO exists.</p> <h3>Procedures</h3> <p>In the following examples, <code>dict</code> has the value of |