commit ad7c1239d8c37949a101a298281891e3daf67f44
parent da233a771f78101d8bd17484b8fbee096dcd8eab
Author: Taylan Ulrich Bayırlı/Kammer <taylanbayirli@gmail.com>
Date: Mon, 17 Aug 2015 14:37:44 +0200
Make an example clearer.
Diffstat:
2 files changed, 2 insertions(+), 2 deletions(-)
diff --git a/srfi-123.html b/srfi-123.html
@@ -42,7 +42,7 @@ struct ;=> #(a (x y #u8(4 2 3)) c)</code></pre>
<p>Lack of a default argument raises an error in this case. Since <code>ref*</code> cannot take default arguments for any fields it accesses, it always raises an error when a hashtable key in the chain is not found.</p>
<pre><code>(define table (make-eqv-hashtable))
(define lst (list 0 1 table 3))
-(ref* lst 2 "foo" 'x) ;error</code></pre>
+(ref* lst 2 "foo" 'x) ;error while accessing "foo" from table</code></pre>
<p>We believe the overhead involved in the dynamic dispatch is negligible in most cases, and furthermore a programmer can always fall back to type-specific accessor and modifier procedures in performance-critical sections of code.</p>
<p>The operators are specified to work on bytevectors, R6RS hashtables, lists/pairs, strings, vectors, non-opaque record types, and SRFI-4 vectors if present. (R6RS and SRFI-99 can produce opaque record types; SRFI-9 and R7RS cannot.) Some notes on specific types:</p>
<ul>
diff --git a/srfi-123.md b/srfi-123.md
@@ -77,7 +77,7 @@ raises an error when a hashtable key in the chain is not found.
(define table (make-eqv-hashtable))
(define lst (list 0 1 table 3))
- (ref* lst 2 "foo" 'x) ;error
+ (ref* lst 2 "foo" 'x) ;error while accessing "foo" from table
We believe the overhead involved in the dynamic dispatch is negligible
in most cases, and furthermore a programmer can always fall back to