diff options
| author |  Arthur A. Gleckler
| 2021-06-26 23:16:54 -0700 |
|---|---|---|
| committer | Arthur A. Gleckler
| 2021-07-18 20:15:22 -0700 |
| commit | 9e17d431b1a4d7a55afe69c84041de16b0f8d8b0 (patch) | |
| tree | 065637aa84b5dff6824b66f6e3e52020cdb96d23 | |
| parent | Add ".gitignore". (diff) | |
Eliminate unnecessary redirect by using TLS/SSL.
| -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 6cd3ecc..d781760 100644 --- a/srfi-225.html +++ b/srfi-225.html @@ -41,7 +41,7 @@ similar to an existing hash table.</p> <p>In order for the system to know that an object is a dictionary, a predicate must be defined that recognizes that type of dictionary. Then the predicate must be registered along with procedures that know how to manipulate the dictionary. At least the six basic dictionary procedures (see below) must be registered, but more may be provided at registration time.</p> <p>We call a specific key-value pair an <em>association</em>. This is why an alist, or association list, is called that; it is a list of associations represented as pairs.</p> <p>When a key argument is said to be the same as some key of the dictionary, it means that they are the same in the sense of the dictionary’s equality predicate. It is assumed that no dictionary contains two keys that are the same in this sense.</p> -<p>Dictionaries are said in this SRFI to be <em>similar</em> if they are of the same type and have the same <a href="http://srfi.schemers.org/srfi-128/srfi-128.html">SRFI 128</a> comparator.</p> +<p>Dictionaries are said in this SRFI to be <em>similar</em> if they are of the same type and have the same <a href="https://srfi.schemers.org/srfi-128/srfi-128.html">SRFI 128</a> comparator.</p> <h3 id="lists-as-dictionaries">Lists as dictionaries</h3> <p>The exact set of pre-registered dictionaries depends on their availability in a given implementation. However, 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 the car of a list is a symbol, 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> |