/usr/share/elk/srfi-89.scm is in anfo 0.98-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 | ; Everything in here was copied nearly verbatim from
; http://srfi.schemers.org/srfi-89/srfi-89.html, therefore:
;
; Copyright (C) Marc Feeley (2006). All Rights Reserved.
; Permission is hereby granted, free of charge, to any person obtaining
; a copy of this software and associated documentation files (the
; "Software"), to deal in the Software without restriction, including
; without limitation the rights to use, copy, modify, merge, publish,
; distribute, sublicense, and/or sell copies of the Software, and to
; permit persons to whom the Software is furnished to do so, subject to
; the following conditions:
;
; The above copyright notice and this permission notice shall be
; included in all copies or substantial portions of the Software.
;
; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
; EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
; MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
; IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
; CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
; TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
; SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
(require 'srfi-88)
;------------------------------------------------------------------------------
; Macro expander for define*.
(define-macro (define* pattern . body)
(if (pair? pattern)
`(define ,(car pattern)
(lambda* ,(cdr pattern) ,@body))
`(define ,pattern ,@body)))
; Macro expander for lambda*.
(define-macro (lambda* formals . body)
;------------------------------------------------------------------------------
; Procedures needed at expansion time.
(define (parse-formals formals)
(define (variable? x) (symbol? x))
(define (required-positional? x)
(variable? x))
(define (optional-positional? x)
(and (pair? x)
(pair? (cdr x))
(null? (cddr x))
(variable? (car x))))
(define (required-named? x)
(and (pair? x)
(pair? (cdr x))
(null? (cddr x))
(keyword? (car x))
(variable? (cadr x))))
(define (optional-named? x)
(and (pair? x)
(pair? (cdr x))
(pair? (cddr x))
(null? (cdddr x))
(keyword? (car x))
(variable? (cadr x))))
(define (named? x)
(or (required-named? x)
(optional-named? x)))
(define (duplicates? lst)
(cond ((null? lst)
#f)
((memq (car lst) (cdr lst))
#t)
(else
(duplicates? (cdr lst)))))
(define (parse-positional-section lst cont)
(let loop1 ((lst lst) (rev-reqs '()))
(if (and (pair? lst)
(required-positional? (car lst)))
(loop1 (cdr lst) (cons (car lst) rev-reqs))
(let loop2 ((lst lst) (rev-opts '()))
(if (and (pair? lst)
(optional-positional? (car lst)))
(loop2 (cdr lst) (cons (car lst) rev-opts))
(cont lst (cons (reverse rev-reqs) (reverse rev-opts))))))))
(define (parse-named-section lst cont)
(let loop ((lst lst) (rev-named '()))
(if (and (pair? lst)
(named? (car lst)))
(loop (cdr lst) (cons (car lst) rev-named))
(cont lst (reverse rev-named)))))
(define (parse-rest lst
positional-before-named?
positional-reqs/opts
named)
(if (null? lst)
(parse-end positional-before-named?
positional-reqs/opts
named
#f)
(if (variable? lst)
(parse-end positional-before-named?
positional-reqs/opts
named
lst)
(error "syntax error in formal parameter list"))))
(define (parse-end positional-before-named?
positional-reqs/opts
named
rest)
(let ((positional-reqs (car positional-reqs/opts))
(positional-opts (cdr positional-reqs/opts)))
(let ((vars
(append positional-reqs
(map car positional-opts)
(map cadr named)
(if rest (list rest) '())))
(keys
(map car named)))
(cond ((duplicates? vars)
(error "duplicate variable in formal parameter list"))
((duplicates? keys)
(error "duplicate keyword in formal parameter list"))
(else
(list positional-before-named?
positional-reqs
positional-opts
named
rest))))))
(define (parse lst)
(if (and (pair? lst)
(named? (car lst)))
(parse-named-section
lst
(lambda (lst named)
(parse-positional-section
lst
(lambda (lst positional-reqs/opts)
(parse-rest lst
#f
positional-reqs/opts
named)))))
(parse-positional-section
lst
(lambda (lst positional-reqs/opts)
(parse-named-section
lst
(lambda (lst named)
(parse-rest lst
#t
positional-reqs/opts
named)))))))
(parse formals))
(define (expand-lambda* formals body)
(define (range lo hi)
(if (< lo hi)
(cons lo (range (+ lo 1) hi))
'()))
(define (expand positional-before-named?
positional-reqs
positional-opts
named
rest)
(if (and (null? positional-opts) (null? named)) ; direct R5RS equivalent
`(lambda ,(append positional-reqs (or rest '())) ,@body)
(let ()
(define utility-fns
`(,@(if (or positional-before-named?
(null? positional-reqs))
`()
`(($req
(lambda ()
(if (pair? $args)
(let ((arg (car $args)))
(set! $args (cdr $args))
arg)
(error "too few actual parameters"))))))
,@(if (null? positional-opts)
`()
`(($opt
(lambda (default)
(if (pair? $args)
(let ((arg (car $args)))
(set! $args (cdr $args))
arg)
(default))))))))
(define positional-bindings
`(,@(if positional-before-named?
`()
(map (lambda (x)
`(,x ($req)))
positional-reqs))
,@(map (lambda (x)
`(,(car x) ($opt (lambda () ,(cadr x)))))
positional-opts)))
(define named-bindings
(if (null? named)
`()
`(($key-values
(vector ,@(map (lambda (x) `$undefined)
named)))
($args
($process-keys
$args
',(make-perfect-hash-table
(map (lambda (x i)
(cons (car x) i))
named
(range 0 (length named))))
$key-values))
,@(map (lambda (x i)
`(,(cadr x)
,(if (null? (cddr x))
`($req-key $key-values ,i)
`($opt-key $key-values ,i (lambda ()
,(caddr x))))))
named
(range 0 (length named))))))
(define rest-binding
(if (not rest)
`(($args (or (null? $args)
(error "too many actual parameters"))))
`((,rest $args))))
(let ((bindings
(append (if positional-before-named?
(append utility-fns
positional-bindings
named-bindings)
(append named-bindings
utility-fns
positional-bindings))
rest-binding)))
`(lambda ,(append (if positional-before-named?
positional-reqs
'())
'$args)
(let* ,bindings
,@body))))))
(apply expand (parse-formals formals)))
(define (make-perfect-hash-table alist)
; "alist" is a list of pairs of the form "(keyword . value)"
; The result is a perfect hash-table represented as a vector of
; length 2*N, where N is the hash modulus. If the keyword K is in
; the hash-table it is at index
;
; X = (* 2 ($hash-keyword K N))
;
; and the associated value is at index X+1.
(let loop1 ((n (length alist)))
(let ((v (make-vector (* 2 n) #f)))
(let loop2 ((lst alist))
(if (pair? lst)
(let* ((key-val (car lst))
(key (car key-val)))
(let ((x (* 2 ($hash-keyword key n))))
(if (vector-ref v x)
(loop1 (+ n 1))
(begin
(vector-set! v x key)
(vector-set! v (+ x 1) (cdr key-val))
(loop2 (cdr lst))))))
v)))))
(define ($hash-keyword key n)
(let ((str (keyword->string key)))
(let loop ((h 0) (i 0))
(if (< i (string-length str))
(loop (modulo (+ (* h 65536) (char->integer (string-ref str i)))
n)
(+ i 1))
h))))
(expand-lambda* formals body))
;------------------------------------------------------------------------------
; Procedures needed at run time (called by the expanded code):
; Perfect hash-tables with keyword keys.
(define ($hash-keyword key n)
(let ((str (keyword->string key)))
(let loop ((h 0) (i 0))
(if (< i (string-length str))
(loop (modulo (+ (* h 65536) (char->integer (string-ref str i)))
n)
(+ i 1))
h))))
(define ($perfect-hash-table-lookup table key)
(let* ((n (quotient (vector-length table) 2))
(x (* 2 ($hash-keyword key n))))
(and (eq? (vector-ref table x) key)
(vector-ref table (+ x 1)))))
; Handling of named parameters.
(define $undefined (list 'undefined))
(define ($req-key key-values i)
(let ((val (vector-ref key-values i)))
(if (eq? val $undefined)
(error "a required named parameter was not provided")
val)))
(define ($opt-key key-values i default)
(let ((val (vector-ref key-values i)))
(if (eq? val $undefined)
(default)
val)))
(define ($process-keys args key-hash-table key-values)
(let loop ((args args))
(if (null? args)
args
(let ((k (car args)))
(if (not (keyword? k))
args
(let ((i ($perfect-hash-table-lookup key-hash-table k)))
(if (not i)
(error "unknown parameter keyword" k)
(if (null? (cdr args))
(error "a value was expected after keyword" k)
(begin
(if (eq? (vector-ref key-values i) $undefined)
(vector-set! key-values i (cadr args))
(error "duplicate parameter" k))
(loop (cddr args)))))))))))
(provide 'srfi-89)
|