diff options
| author |  John Cowan
| 2021-07-29 17:34:35 -0400 |
|---|---|---|
| committer | John Cowan
| 2021-07-29 17:34:35 -0400 |
| commit | 80201ef3651803aed81e0f5ed31d959fdc4ef6f5 (patch) | |
| tree | 9a96cfce787007d6ec49986c6759815ff7194f04 /srfi-225.html | |
| parent | Merge remote-tracking branch 'upstream/master' (diff) | |
minor errors
Diffstat (limited to 'srfi-225.html')
| -rw-r--r-- | srfi-225.html | 9 |
1 files changed, 6 insertions, 3 deletions
diff --git a/srfi-225.html b/srfi-225.html index e3fbb9a..c9f1a4e 100644 --- a/srfi-225.html +++ b/srfi-225.html @@ -64,15 +64,17 @@ Consequently, previous examples don't affect later ones. <h3 id="constructor">Constructor</h3> <p><code>(make-dict</code> <em>dtd comparator obj</em> ...<code>)</code></p> <p>Returns an empty dictionary of the type described by the DTD using <em>comparator</em> to specify to specify the dictionary's equality predicate and its ordering predicate and/or hash function.</p> +<p>If the contents of <em>comparator</em> are inconsistent with the dictionary type, an error satisfying +<code>dictionary-error?</code> is signaled. <p>The meaning of the other arguments depends on the type of dictionary being created. However, implementations which support the ability to specify the initial capacity of a hash table should interpret a non-negative exact integer as the specification of that capacity. In addition, if the symbols <code>thread-safe</code>, <code>weak-keys</code>, <code>ephemeral-keys</code>, <code>weak-values</code>, or <code>ephemeral-values</code> are present, implementations should create thread-safe hash tables, hash tables with weak keys or ephemeral keys, or hash tables with weak or ephemeral values respectively. Implementations are free to use ephemeral keys or values when weak keys or values respectively have been requested.</p> <h3 id="predicates">Predicates</h3> <p><code>(dictionary?</code> <em>dtd obj</em><code>)</code></p> -<p>Returns <code>#t</code> if <em>obj</em> answers <code>#t</code> to some registered predicate, and <code>#f</code> otherwise.</p> +<p>Returns <code>#t</code> if <em>obj</em> answers <code>#t</code> to the type predicate stored in the DTD, and <code>#f</code> otherwise.</p> <blockquote><pre>(define dict (list '(1 . 2) '(3 . 4) '(5 . 6))) (dictionary? aed dict) => #t</pre></blockquote> -<p><code>(dict-empty?</code> <code>)</code></p> +<p><code>(dict-empty?</code> <em>dtd dict</em><code>)</code></p> <p>Returns <code>#t</code> if <em>dictionary</em> contains no associations and <code>#f</code> if it does contain associations.</p> -<blockquote><pre>(dict-empty? '()) => #t +<blockquote><pre>(dict-empty? aed '()) => #t (dict-empty? aed dict) => #f</pre></blockquote> <p><code>(dict-contains?</code> <em>dtd dictionary key</em><code>)</code></p> <blockquote><pre>(dict-contains? aed dict 1) => #t @@ -266,6 +268,7 @@ Returns a dictionary that is similar to <em>dictionary</em> and contains the sam and <code>dict-search</code>. </p> <p><code>(dict-comparator</code> <em>dtd dictionary</em><code>)</code></p> +<p>Return a comparator representing the type predicate, equality predicate, ordering predicate, and hash function of <em>dict</em>. The last two may be <code>#f</code> if the dictionary does not make use of these functions.</p> <h3 id="dictionary-type-descriptors">Dictionary type descriptors</h3> <p><code>(dtd?</code> <em>obj</em><code>)</code></p> <p>Returns <code>#t</code> if <em>obj</em> is a DTD, and <code>#f</code> otherwise.</p> |