blob_id
stringlengths 40
40
| directory_id
stringlengths 40
40
| path
stringlengths 3
171
| content_id
stringlengths 40
40
| detected_licenses
listlengths 0
8
| license_type
stringclasses 2
values | repo_name
stringlengths 6
82
| snapshot_id
stringlengths 40
40
| revision_id
stringlengths 40
40
| branch_name
stringclasses 13
values | visit_date
timestamp[ns] | revision_date
timestamp[ns] | committer_date
timestamp[ns] | github_id
int64 1.59k
594M
⌀ | star_events_count
int64 0
77.1k
| fork_events_count
int64 0
33.7k
| gha_license_id
stringclasses 12
values | gha_event_created_at
timestamp[ns] | gha_created_at
timestamp[ns] | gha_language
stringclasses 46
values | src_encoding
stringclasses 14
values | language
stringclasses 2
values | is_vendor
bool 2
classes | is_generated
bool 1
class | length_bytes
int64 4
7.87M
| extension
stringclasses 101
values | filename
stringlengths 2
149
| content
stringlengths 4
7.87M
| has_macro_def
bool 2
classes |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
f6f6f6e0aaf2bcdf76dd59614640933420f8b19e
|
bcfa2397f02d5afa93f4f53c0b0a98c204caafc1
|
/scheme/chapter1/ex1_28.scm
|
4bb079795b8752a8c108d5510121733b43e4f4bd
|
[] |
no_license
|
rahulkumar96/sicp-study
|
ec4aa6e1076b46c47dbc7a678ac88e757191c209
|
4dcd1e1eb607aa1e32277e1c232a321c5de9c0f0
|
refs/heads/master
| 2020-12-03T00:37:39.576611 | 2017-07-05T12:58:48 | 2017-07-05T12:58:48 | 96,050,670 | 0 | 0 | null | 2017-07-02T21:46:09 | 2017-07-02T21:46:09 | null |
UTF-8
|
Scheme
| false | false | 1,622 |
scm
|
ex1_28.scm
|
;; SICP 1.28
;; Exercise 1.28. One variant of the Fermat test that cannot be
;; fooled is called the Miller-Rabin test (Miller 1976; Rabin
;; 1980). This starts from an alternate form of Fermat's Little
;; Theorem, which states that if n is a prime number and a is any
;; positive integer less than n, then a raised to the (n - 1)st power
;; is congruent to 1 modulo n. To test the primality of a number n by
;; the Miller-Rabin test, we pick a random number a<n and raise a to
;; the (n - 1)st power modulo n using the expmod procedure. However,
;; whenever we perform the squaring step in expmod, we check to see if
;; we have discovered a ``nontrivial square root of 1 modulo n,'' that
;; is, a number not equal to 1 or n - 1 whose square is equal to 1
;; modulo n. It is possible to prove that if such a nontrivial square
;; root of 1 exists, then n is not prime. It is also possible to prove
;; that if n is an odd number that is not prime, then, for at least
;; half the numbers a<n, computing a^(n-1) in this way will reveal a
;; nontrivial square root of 1 modulo n. (This is why the Miller-Rabin
;; test cannot be fooled.) Modify the expmod procedure to signal if it
;; discovers a nontrivial square root of 1, and use this to implement
;; the Miller-Rabin test with a procedure analogous to
;; fermat-test. Check your procedure by testing various known primes
;; and non-primes. Hint: One convenient way to make expmod signal is
;; to have it return 0.
;; ANSWER ------------------------------------------------------------
;; Ok, I've never finished this one. It is a wee bit too math-deep
;; for even me.
| false |
2c14de0dfc5275241e48fb93577dda1465707fd1
|
a2c4df92ef1d8877d7476ee40a73f8b3da08cf81
|
/ch04-14-test.scm
|
5c62d00d1dd615694c4c3383239538c1f2ee6fa8
|
[] |
no_license
|
naoyat/reading-paip
|
959d0ec42b86bc01fe81dcc3589e3182e92a05d9
|
739fde75073af36567fcbdf3ee97e221b0f87c8a
|
refs/heads/master
| 2020-05-20T04:56:17.375890 | 2009-04-21T20:01:01 | 2009-04-21T20:01:01 | 176,530 | 1 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,464 |
scm
|
ch04-14-test.scm
|
(require "./ch04-14")
(use-ops (make-block-ops '(a b)))
(print
(GPS '((a on table) (b on table) (space on a) (space on b)
(space on table))
'((a on b) (b on table)))
)
(print
(GPS '((a on b) (b on table) (space on a) (space on table))
'((b on a)))
)
(use-ops (make-block-ops '(a b c)))
(print
(GPS '((a on b) (b on c) (c on table) (space on a) (space on table))
'((b on a) (c on b)))
)
;(debug :gps)
(print
(GPS '((a on b) (b on c) (c on table) (space on a) (space on table))
'((c on b) (b on a)))
)
;;
;;;;;;;;;;;;;
(print
(GPS '((a on b) (b on c) (c on table) (space on a) (space on table))
'((c on b) (b on a)))
)
(print
(GPS '((c on a) (a on table) (b on table)
(space on c) (space on b) (space on table))
'((c on table)))
)
(print
(GPS '((c on a) (a on table) (b on table)
(space on c) (space on b) (space on table))
'((c on table) (a on b)))
)
;;;;;;;;;;;;
(print
(GPS '((c on a) (a on table) (b on table)
(space on c) (space on b) (space on table))
'((c on table) (a on b)))
)
(print
(GPS '((a on b) (b on c) (c on table) (space on a) (space on table))
'((b on a) (c on b)))
)
(print
(GPS '((a on b) (b on c) (c on table) (space on a) (space on table))
'((c on b) (b on a)))
)
(define start '((c on a) (a on table) (b on table) (space on c)
(space on b) (space on table)))
(print (GPS start '((a on b) (b on c))))
(print (GPS start '((b on c) (a on b))))
| false |
5100a49d018b85297aaa5cf9ba23e924a425ff9e
|
4b2aeafb5610b008009b9f4037d42c6e98f8ea73
|
/12.3/12.3-4.scm
|
5a89c02c5de7513b42470feed73a466fda6e1de9
|
[] |
no_license
|
mrinalabrol/clrs
|
cd461d1a04e6278291f6555273d709f48e48de9c
|
f85a8f0036f0946c9e64dde3259a19acc62b74a1
|
refs/heads/master
| 2021-01-17T23:47:45.261326 | 2010-09-29T00:43:32 | 2010-09-29T00:43:32 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 917 |
scm
|
12.3-4.scm
|
(require-extension syntax-case check)
(require '../12.1/section)
(require '../12.3/section)
(import section-12.1)
(import section-12.3)
(let ((tree (figure-12.4)))
(let ((root (figure-12.4/root tree))
(node (figure-12.4/5 tree))
(successor (figure-12.4/6 tree)))
(bt-delete!/preserve-pointer node)
;; Check whether node was deleted.
(check (bt-inorder-tree-map bt-node-datum root)
=> '(23 20 18 16 15 13 12 10 7 6 3))
;; Check whether successor's pointer is preserved.
(check (bt-node-datum successor) => 6)
;; Check whether graft was successful.
(check (bt-node-datum (bt-node-left successor))
=> (bt-node-datum (bt-node-left node)))
(check (bt-node-datum (bt-node-right successor))
=> (bt-node-datum (bt-node-right node)))
(check (bt-node-datum (bt-node-parent successor))
=> (bt-node-datum (bt-node-parent node)))))
| false |
212d6f6bd437e5c831d7a3916bd2cf513ad7d82e
|
7ab12c8b00310a7176b53d32072762ecea154c65
|
/srfi/test/hello-test.scm
|
e78dbdd0b9fa3e21e20184e6ac5e714509c0d6c5
|
[] |
no_license
|
krfantasy/srfi-204
|
6752f3629a5562c6b233b4df6e682244aa34fe8c
|
1d745c1eafc57450fe7ee0c232be7c2fdf29bfee
|
refs/heads/master
| 2022-11-26T06:27:24.527512 | 2020-08-10T17:17:59 | 2020-08-10T17:17:59 | 286,407,023 | 0 | 0 | null | 2020-08-10T07:30:59 | 2020-08-10T07:30:58 | null |
UTF-8
|
Scheme
| false | false | 1,096 |
scm
|
hello-test.scm
|
(cond-expand
(guile
(define test-name "guile-hello-test" )
(define scheme-version-name (string-append "guile-" (version)))
(import (srfi srfi-9)
(srfi srfi-64))
(include-from-path "./test/hello-common.scm"))
(gauche
(import (only (gauche base) gauche-version)
(scheme base)
(srfi-64))
(define test-name "gauche-hello-test")
(define scheme-version-name (string-append "gauche-" (gauche-version)))
(include "hello-common.scm"))
(larceny
;;NOTE run like:
;; $rlwrap larceny -r7rs -I ..
;; > (include "test/hello-test.scm")
(import (scheme base)
(srfi 64)
(srfi 115))
(define (is-version sym)
(regexp-matches
'(seq "larceny-" (one-or-more (or numeric ".")))
(symbol->string sym)))
(define test-name "larceny-hello-test")
(define scheme-version-name
(let lp ((has (features)))
(cond
((null? has) "larceny-???")
((and (symbol? (car has)) (is-version (car has))) =>
(lambda (match) (regexp-match-submatch match 0)))
(else (lp (cdr has))))))
(include "test/hello-common.scm"))
)
| false |
bd7f09a0aa4fb9f411f98c9d05f8d4ad39053c91
|
6b288a71553cf3d8701fe7179701d100c656a53c
|
/s/primdata.ss
|
4d61e8fb14bb8c47cf3e01c7d0e488be461c5285
|
[
"Apache-2.0"
] |
permissive
|
cisco/ChezScheme
|
03e2edb655f8f686630f31ba2574f47f29853b6f
|
c048ad8423791de4bf650fca00519d5c2059d66e
|
refs/heads/main
| 2023-08-26T16:11:15.338552 | 2023-08-25T14:17:54 | 2023-08-25T14:17:54 | 56,263,501 | 7,763 | 1,410 |
Apache-2.0
| 2023-08-28T22:45:52 | 2016-04-14T19:10:25 |
Scheme
|
UTF-8
|
Scheme
| false | false | 156,369 |
ss
|
primdata.ss
|
;;; primdata.ss
;;; Copyright 1984-2017 Cisco Systems, Inc.
;;;
;;; Licensed under the Apache License, Version 2.0 (the "License");
;;; you may not use this file except in compliance with the License.
;;; You may obtain a copy of the License at
;;;
;;; http://www.apache.org/licenses/LICENSE-2.0
;;;
;;; Unless required by applicable law or agreed to in writing, software
;;; distributed under the License is distributed on an "AS IS" BASIS,
;;; WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
;;; See the License for the specific language governing permissions and
;;; limitations under the License.
;;; r6rs features
(define-symbol-flags* ([libraries (rnrs) (rnrs arithmetic bitwise)] [flags primitive proc])
(bitwise-not [sig [(sint) -> (sint)]] [flags arith-op mifoldable discard])
(bitwise-and [sig [(sint ...) -> (sint)]] [flags arith-op partial-folder])
(bitwise-ior [sig [(sint ...) -> (sint)]] [flags arith-op partial-folder])
(bitwise-xor [sig [(sint ...) -> (sint)]] [flags arith-op partial-folder])
(bitwise-if [sig [(sint sint sint) -> (sint)]] [flags arith-op mifoldable discard])
(bitwise-bit-count [sig [(sint) -> (sint)]] [flags arith-op mifoldable discard])
(bitwise-length [sig [(sint) -> (uint)]] [flags arith-op mifoldable discard])
(bitwise-first-bit-set [sig [(sint) -> (sint)]] [flags arith-op mifoldable discard])
(bitwise-bit-set? [sig [(sint uint) -> (boolean)]] [flags pure mifoldable discard])
(bitwise-copy-bit [sig [(sint uint bit) -> (sint)]] [flags arith-op mifoldable discard])
(bitwise-bit-field [sig [(sint sub-uint sub-uint) -> (uint)]] [flags arith-op mifoldable discard])
(bitwise-copy-bit-field [sig [(sint sub-uint sub-uint sint) -> (sint)]] [flags arith-op mifoldable discard])
(bitwise-arithmetic-shift [sig [(sint sint) -> (sint)]] [flags arith-op mifoldable discard cp03])
(bitwise-arithmetic-shift-left [sig [(sint uint) -> (sint)]] [flags arith-op mifoldable discard cp03])
(bitwise-arithmetic-shift-right [sig [(sint uint) -> (sint)]] [flags arith-op mifoldable discard cp03])
(bitwise-rotate-bit-field [sig [(sint sub-uint sub-uint sub-uint) -> (sint)]] [flags arith-op mifoldable discard])
(bitwise-reverse-bit-field [sig [(sint sub-uint sub-uint) -> (sint)]] [flags arith-op mifoldable discard])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs arithmetic fixnums)] [flags primitive proc])
(fixnum? [sig [(ptr) -> (boolean)]] [flags pure unrestricted cp02])
(fixnum-width [sig [() -> (fixnum)]] [flags pure unrestricted true cp02])
(least-fixnum [sig [() -> (fixnum)]] [flags pure unrestricted true cp02])
(greatest-fixnum [sig [() -> (fixnum)]] [flags pure unrestricted true cp02])
(fx<? [sig [(fixnum fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; restricted to 2+ arguments
(fx<=? [sig [(fixnum fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; restricted to 2+ arguments
(fx=? [sig [(fixnum fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; restricted to 2+ arguments
(fx>? [sig [(fixnum fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; restricted to 2+ arguments
(fx>=? [sig [(fixnum fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; restricted to 2+ arguments
(fxzero? [sig [(fixnum) -> (boolean)]] [flags pure cp02])
(fxnegative? [sig [(fixnum) -> (boolean)]] [flags pure cp02])
(fxpositive? [sig [(fixnum) -> (boolean)]] [flags pure cp02])
(fxeven? [sig [(fixnum) -> (boolean)]] [flags pure cp02])
(fxodd? [sig [(fixnum) -> (boolean)]] [flags pure cp02])
(fxmax [sig [(fixnum fixnum ...) -> (fixnum)]] [flags arith-op cp02])
(fxmin [sig [(fixnum fixnum ...) -> (fixnum)]] [flags arith-op cp02])
((r6rs: fx*) [sig [(fixnum fixnum) -> (fixnum)]] [flags arith-op partial-folder]) ; restricted to 2 arguments
((r6rs: fx+) [sig [(fixnum fixnum) -> (fixnum)]] [flags arith-op partial-folder]) ; restricted to 2 arguments
((r6rs: fx-) [sig [(fixnum) (fixnum fixnum) -> (fixnum)]] [flags arith-op partial-folder]) ; restricted to 1 or 2 arguments
(fxdiv-and-mod [sig [(fixnum fixnum) -> (fixnum fixnum)]] [flags discard cp03])
(fxdiv [sig [(fixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxmod [sig [(fixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxdiv0-and-mod0 [sig [(fixnum fixnum) -> (fixnum fixnum)]] [flags discard])
(fxdiv0 [sig [(fixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxmod0 [sig [(fixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fx+/carry [sig [(fixnum fixnum fixnum) -> (fixnum fixnum)]] [flags arith-op cp02])
(fx-/carry [sig [(fixnum fixnum fixnum) -> (fixnum fixnum)]] [flags arith-op cp02])
(fx*/carry [sig [(fixnum fixnum fixnum) -> (fixnum fixnum)]] [flags arith-op cp02])
(fxnot [sig [(fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxand [sig [(fixnum ...) -> (fixnum)]] [flags arith-op partial-folder])
(fxior [sig [(fixnum ...) -> (fixnum)]] [flags arith-op partial-folder])
(fxxor [sig [(fixnum ...) -> (fixnum)]] [flags arith-op partial-folder])
(fxif [sig [(fixnum fixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxbit-count [sig [(fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxlength [sig [(fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxfirst-bit-set [sig [(fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxbit-set? [sig [(fixnum sub-ufixnum) -> (boolean)]] [flags pure cp02])
(fxcopy-bit [sig [(fixnum sub-ufixnum bit) -> (fixnum)]] [flags arith-op cp02])
(fxbit-field [sig [(fixnum sub-ufixnum sub-ufixnum) -> (fixnum)]] [flags arith-op cp02 cp03])
(fxcopy-bit-field [sig [(fixnum sub-ufixnum sub-ufixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxarithmetic-shift [sig [(fixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxarithmetic-shift-left [sig [(fixnum sub-ufixnum) -> (fixnum)]] [flags arith-op cp02])
(fxarithmetic-shift-right [sig [(fixnum sub-ufixnum) -> (fixnum)]] [flags arith-op cp02])
(fxrotate-bit-field [sig [(fixnum sub-ufixnum sub-ufixnum sub-ufixnum) -> (fixnum)]] [flags arith-op cp02])
(fxreverse-bit-field [sig [(fixnum sub-ufixnum sub-ufixnum) -> (fixnum)]] [flags arith-op cp02])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs arithmetic flonums)] [flags keyword])
(&no-infinities [flags])
(&no-nans [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs arithmetic flonums)] [flags primitive proc])
(flonum? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(real->flonum [sig [(real) -> (flonum)]] [flags arith-op mifoldable discard])
(fl=? [sig [(flonum flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; restricted to 2+ arguments
(fl<? [sig [(flonum flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; restricted to 2+ arguments
(fl<=? [sig [(flonum flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; restricted to 2+ arguments
(fl>? [sig [(flonum flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; restricted to 2+ arguments
(fl>=? [sig [(flonum flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; restricted to 2+ arguments
(flinteger? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(flzero? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(flpositive? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(flnegative? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(flodd? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(fleven? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(flfinite? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(flinfinite? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(flnan? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(flmax [sig [(flonum flonum ...) -> (flonum)]] [flags arith-op mifoldable discard])
(flmin [sig [(flonum flonum ...) -> (flonum)]] [flags arith-op mifoldable discard])
(fl* [sig [(flonum ...) -> (flonum)]] [flags arith-op partial-folder])
(fl+ [sig [(flonum ...) -> (flonum)]] [flags arith-op partial-folder])
(fl- [sig [(flonum flonum ...) -> (flonum)]] [flags arith-op partial-folder])
(fl/ [sig [(flonum flonum ...) -> (flonum)]] [flags arith-op partial-folder])
(flabs [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(fldiv-and-mod [sig [(flonum flonum) -> (flonum flonum)]] [flags mifoldable discard])
(fldiv [sig [(flonum flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flmod [sig [(flonum flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(fldiv0-and-mod0 [sig [(flonum flonum) -> (flonum flonum)]] [flags mifoldable discard])
(fldiv0 [sig [(flonum flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flmod0 [sig [(flonum flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flnumerator [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(fldenominator [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flfloor [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flceiling [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(fltruncate [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flround [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flexp [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(fllog [sig [(flonum) (flonum flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flsin [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flcos [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(fltan [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flasin [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flacos [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flatan [sig [(flonum) (flonum flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flsqrt [sig [(flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(flexpt [sig [(flonum flonum) -> (flonum)]] [flags arith-op mifoldable discard])
(make-no-infinities-violation [sig [() -> (ptr)]] [flags pure unrestricted alloc])
(no-infinities-violation? [sig [(ptr) -> (ptr)]] [flags pure unrestricted mifoldable discard])
(make-no-nans-violation [sig [() -> (ptr)]] [flags pure unrestricted alloc])
(no-nans-violation? [sig [(ptr) -> (ptr)]] [flags pure unrestricted mifoldable discard])
(fixnum->flonum [sig [(fixnum) -> (flonum)]] [flags arith-op cp02])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs base) (rnrs exceptions)] [flags keyword])
(=> [flags ieee r5rs])
(else [flags ieee r5rs])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs base) (rnrs syntax-case)] [flags keyword])
(_ [flags r5rs])
(... [flags r5rs])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs base)] [flags keyword])
(assert [flags])
(define [flags ieee r5rs])
(define-syntax [flags r5rs])
(if [flags ieee r5rs])
(quote [flags ieee r5rs])
(lambda [flags ieee r5rs])
(set! [flags ieee r5rs])
(cond [flags ieee r5rs])
((r6rs: case) [flags ieee r5rs])
(and [flags ieee r5rs])
(or [flags ieee r5rs])
(let [flags ieee r5rs])
(let* [flags ieee r5rs])
(letrec [flags ieee r5rs])
(begin [flags ieee r5rs])
(quasiquote [flags ieee r5rs])
(unquote [flags ieee r5rs])
(unquote-splicing [flags ieee r5rs])
(let-syntax [flags r5rs])
(letrec-syntax [flags r5rs])
((r6rs: syntax-rules) [flags r5rs])
(identifier-syntax [flags])
(letrec* [flags])
(let-values [flags])
(let*-values [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs base)] [flags primitive proc])
(eqv? [sig [(ptr ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard cp02 ieee r5rs])
(eq? [sig [(ptr ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard cp02 ieee r5rs])
(equal? [sig [(ptr ptr) -> (boolean)]] [flags unrestricted mifoldable discard cp02 ieee r5rs])
(procedure? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs cp02])
(number? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(complex? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(real? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(rational? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(integer? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(real-valued? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(rational-valued? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(integer-valued? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(exact? [sig [(number) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(inexact? [sig [(number) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(inexact [sig [(number) -> (inexact-number)]] [flags arith-op mifoldable discard])
(exact [sig [(number) -> (exact-number)]] [flags arith-op mifoldable discard])
((r6rs: <) [sig [(real real real ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: <=) [sig [(real real real ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: =) [sig [(number number number ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: >) [sig [(real real real ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: >=) [sig [(real real real ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
(zero? [sig [(number) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(positive? [sig [(real) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(negative? [sig [(real) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(odd? [sig [(integer) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(even? [sig [(integer) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(finite? [sig [(real) -> (boolean)]] [flags pure mifoldable discard])
(infinite? [sig [(real) -> (boolean)]] [flags pure mifoldable discard])
(nan? [sig [(real) -> (boolean)]] [flags pure mifoldable discard])
(max [sig [(real real ...) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(min [sig [(real real ...) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(+ [sig [(number ...) -> (number)]] [flags arith-op partial-folder ieee r5rs])
(* [sig [(number ...) -> (number)]] [flags arith-op partial-folder ieee r5rs])
(- [sig [(number number ...) -> (number)]] [flags arith-op partial-folder ieee r5rs])
(/ [sig [(number number ...) -> (number)]] [flags arith-op partial-folder ieee r5rs])
(abs [sig [(number) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(div-and-mod [sig [(real real) -> (real real)]] [flags mifoldable discard])
(div [sig [(real real) -> (real)]] [flags arith-op mifoldable discard])
(mod [sig [(real real) -> (real)]] [flags arith-op mifoldable discard])
(div0-and-mod0 [sig [(real real) -> (real real)]] [flags mifoldable discard])
(div0 [sig [(real real) -> (real)]] [flags arith-op mifoldable discard])
(mod0 [sig [(real real) -> (real)]] [flags arith-op mifoldable discard])
(gcd [sig [(integer ...) -> (integer)]] [flags arith-op mifoldable discard ieee r5rs])
(lcm [sig [(integer ...) -> (integer)]] [flags arith-op mifoldable discard ieee r5rs])
(numerator [sig [(rational) -> (integer)]] [flags arith-op mifoldable discard ieee r5rs])
(denominator [sig [(rational) -> (integer)]] [flags arith-op mifoldable discard ieee r5rs])
(floor [sig [(real) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(ceiling [sig [(real) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(truncate [sig [(real) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(round [sig [(real) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(rationalize [sig [(real real) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(exp [sig [(number) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(log [sig [(number) (number number) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(sin [sig [(number) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(cos [sig [(number) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(tan [sig [(number) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(asin [sig [(number) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(acos [sig [(number) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(atan [sig [(number) (real real) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(sqrt [sig [(number) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(exact-integer-sqrt [sig [(exact-integer) -> (exact-integer exact-integer)]] [flags arith-op mifoldable discard])
(expt [sig [(number number) -> (number)]] [flags pure discard true cp02 ieee r5rs]) ; can take too long to fold
(make-rectangular [sig [(real real) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(make-polar [sig [(real real) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(real-part [sig [(number) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(imag-part [sig [(number) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(magnitude [sig [(number) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
(angle [sig [(number) -> (real)]] [flags arith-op mifoldable discard ieee r5rs])
((r6rs: number->string) [sig [(number) (number sub-ufixnum) (number sub-ufixnum sub-ufixnum) -> (string)]] [flags alloc ieee r5rs]) ; radix restricted to 2, 4, 8, 16
((r6rs: string->number) [sig [(string) (string sub-ufixnum) -> (maybe-number)]] [flags discard ieee r5rs]) ; radix restricted to 2, 4, 8, 16
(not [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs cp02])
(boolean? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(boolean=? [sig [(boolean boolean boolean ...) -> (boolean)]] [flags pure mifoldable discard cp03])
(pair? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(cons [sig [(ptr ptr) -> (#1=(ptr . ptr))]] [flags unrestricted alloc ieee r5rs])
; c..r non-alphabetic so marks come before references
(car [sig [(#1#) -> (ptr)]] [flags mifoldable discard cp02 ieee r5rs])
(cdr [sig [(#1#) -> (ptr)]] [flags mifoldable discard cp02 ieee r5rs])
(caar [sig [(#2=(#1# . ptr)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cdar [sig [(#2#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cadr [sig [(#3=(ptr . #1#)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cddr [sig [(#3#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(caaar [sig [(#4=(#2# . ptr)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cdaar [sig [(#4#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cadar [sig [(#5=(#3# . ptr)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cddar [sig [(#5#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(caadr [sig [(#6=(ptr . #2#)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cdadr [sig [(#6#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(caddr [sig [(#7=(ptr . #3#)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cdddr [sig [(#7#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(caaaar [sig [(#8=(#4# . ptr)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cdaaar [sig [(#8#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cadaar [sig [(#9=(#5# . ptr)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cddaar [sig [(#9#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(caadar [sig [(#10=(#6# . ptr)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cdadar [sig [(#10#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(caddar [sig [(#11=(#7# . ptr)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cdddar [sig [(#11#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(caaadr [sig [(#12=(ptr . #4#)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cdaadr [sig [(#12#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cadadr [sig [(#13=(ptr . #5#)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cddadr [sig [(#13#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(caaddr [sig [(#14=(ptr . #6#)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cdaddr [sig [(#14#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cadddr [sig [(#15=(ptr . #7#)) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(cddddr [sig [(#15#) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(null? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(list? [sig [(ptr) -> (boolean)]] [flags unrestricted mifoldable discard ieee r5rs])
(list [sig [(ptr ...) -> (list)]] [flags unrestricted alloc cp02 ieee r5rs])
(length [sig [(list) -> (length)]] [flags mifoldable discard true ieee r5rs])
(append [sig [() -> (null)] [(list ... ptr) -> (ptr)]] [flags discard ieee r5rs cp02])
(reverse [sig [(list) -> (list)]] [flags alloc ieee r5rs])
(list-tail [sig [(ptr sub-index) -> (ptr)]] [flags mifoldable discard ieee r5rs])
(list-ref [sig [(pair sub-index) -> (ptr)]] [flags mifoldable discard ieee r5rs cp02])
(map [sig [(procedure list list ...) -> (list)]] [flags cp02 cp03 ieee r5rs true])
(for-each [sig [(procedure list list ...) -> (ptr ...)]] [flags cp02 cp03 ieee r5rs])
(symbol? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(symbol->string [sig [(symbol) -> (string)]] [flags true mifoldable discard ieee r5rs])
(symbol=? [sig [(symbol symbol symbol ...) -> (boolean)]] [flags pure mifoldable discard cp03])
(string->symbol [sig [(string) -> (symbol)]] [flags true mifoldable discard ieee r5rs])
(char? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(char->integer [sig [(char) -> (fixnum)]] [flags pure mifoldable discard true ieee r5rs])
(integer->char [sig [(sub-ufixnum) -> (char)]] [flags pure mifoldable discard true ieee r5rs])
((r6rs: char<=?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: char<?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: char=?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs cp03]) ; restricted to 2+ arguments
((r6rs: char>=?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: char>?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
(string? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(make-string [sig [(length) (length char) -> (string)]] [flags alloc ieee r5rs])
(string [sig [(char ...) -> (string)]] [flags alloc ieee r5rs cp02])
(string-length [sig [(string) -> (length)]] [flags pure true ieee r5rs mifoldable discard])
(string-ref [sig [(string sub-index) -> (ptr)]] [flags true ieee r5rs mifoldable discard cp02])
((r6rs: string<=?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: string<?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: string=?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs cp03]) ; restricted to 2+ arguments
((r6rs: string>=?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: string>?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
(substring [sig [(string sub-length sub-length) -> (string)]] [flags alloc ieee r5rs])
(string-append [sig [(string ...) -> (string)]] [flags alloc ieee r5rs])
(string->list [sig [(string) -> (list)]] [flags alloc ieee r5rs])
(list->string [sig [(sub-list) -> (string)]] [flags alloc ieee r5rs])
(string-for-each [sig [(procedure string string ...) -> (void)]] [flags cp03])
(string-copy [sig [(string) -> (string)]] [flags alloc ieee r5rs])
(vector? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(make-vector [sig [(length) (length ptr) -> (vector)]] [flags alloc ieee r5rs])
(vector [sig [(ptr ...) -> (vector)]] [flags unrestricted alloc ieee r5rs cp02])
(vector-length [sig [(vector) -> (length)]] [flags pure true ieee r5rs mifoldable discard])
(vector-ref [sig [(vector sub-index) -> (ptr)]] [flags ieee r5rs mifoldable discard cp02])
(vector-set! [sig [(vector sub-index ptr) -> (void)]] [flags true ieee r5rs])
(vector->list [sig [(vector) -> (list)]] [flags alloc ieee r5rs])
(list->vector [sig [(list) -> (vector)]] [flags alloc ieee r5rs])
(vector-fill! [sig [(vector ptr) -> (void)]] [flags true ieee r5rs])
(vector-map [sig [(procedure vector vector ...) -> (vector)]] [flags cp03])
(vector-for-each [sig [(procedure vector vector ...) -> (void)]] [flags cp03])
(error [sig [(who string ptr ...) -> (bottom)]] [flags abort-op])
(assertion-violation [sig [(who string ptr ...) -> (bottom)]] [flags abort-op])
(apply [sig [(procedure ptr ... list) -> (ptr ...)]] [flags cp02 ieee r5rs])
(call-with-current-continuation [sig [(procedure) -> (ptr ...)]] [flags ieee r5rs])
(call/cc [sig [(procedure) -> (ptr ...)]] [flags])
(values [sig [(ptr ...) -> (ptr ...)]] [flags unrestricted discard cp02 ieee r5rs])
(call-with-values [sig [(procedure procedure) -> (ptr ...)]] [flags cp02 ieee r5rs])
((r6rs: dynamic-wind) [sig [(procedure procedure procedure) -> (ptr ...)]] [flags ieee r5rs]) ; restricted to 3 arguments
)
(define-symbol-flags* ([libraries (rnrs) (rnrs bytevectors)] [flags keyword])
(endianness [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs bytevectors)] [flags primitive proc])
(native-endianness [sig [() -> (symbol)]] [flags pure unrestricted alloc cp02])
(bytevector? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-bytevector [sig [(length) (length u8/s8) -> (bytevector)]] [flags alloc])
(bytevector-length [sig [(bytevector) -> (length)]] [flags true mifoldable discard])
(bytevector=? [sig [(bytevector bytevector) -> (boolean)]] [flags mifoldable discard cp03])
(bytevector-fill! [sig [(bytevector u8/s8) -> (void)]] [flags true])
(bytevector-copy! [sig [(bytevector sub-length bytevector sub-length sub-length) -> (void)]] [flags true])
(bytevector-copy [sig [(bytevector) -> (bytevector)]] [flags alloc])
(bytevector-u8-ref [sig [(bytevector sub-index) -> (u8)]] [flags true mifoldable discard])
(bytevector-s8-ref [sig [(bytevector sub-index) -> (s8)]] [flags true mifoldable discard])
(bytevector-u8-set! [sig [(bytevector sub-index u8) -> (void)]] [flags true])
(bytevector-s8-set! [sig [(bytevector sub-index s8) -> (void)]] [flags true])
(bytevector->u8-list [sig [(bytevector) -> (list)]] [flags alloc])
(u8-list->bytevector [sig [(sub-list) -> (bytevector)]] [flags alloc])
(bytevector-uint-ref [sig [(bytevector sub-index endianness sub-length) -> (uint)]] [flags true mifoldable discard])
(bytevector-sint-ref [sig [(bytevector sub-index endianness sub-length) -> (sint)]] [flags true mifoldable discard])
(bytevector-uint-set! [sig [(bytevector sub-index sub-uint endianness sub-length) -> (void)]] [flags true])
(bytevector-sint-set! [sig [(bytevector sub-index sub-sint endianness sub-length) -> (void)]] [flags true])
(bytevector->uint-list [sig [(bytevector endianness sub-index) -> (list)]] [flags alloc])
(bytevector->sint-list [sig [(bytevector endianness sub-index) -> (list)]] [flags alloc])
(uint-list->bytevector [sig [(sub-list endianness sub-index) -> (bytevector)]] [flags alloc])
(sint-list->bytevector [sig [(sub-list endianness sub-index) -> (bytevector)]] [flags alloc])
(bytevector-u16-ref [sig [(bytevector sub-index endianness) -> (u16)]] [flags true mifoldable discard])
(bytevector-s16-ref [sig [(bytevector sub-index endianness) -> (s16)]] [flags true mifoldable discard])
(bytevector-u16-native-ref [sig [(bytevector sub-index) -> (u16)]] [flags true cp02])
(bytevector-s16-native-ref [sig [(bytevector sub-index) -> (s16)]] [flags true cp02])
(bytevector-u16-set! [sig [(bytevector sub-index u16 endianness) -> (void)]] [flags true])
(bytevector-s16-set! [sig [(bytevector sub-index s16 endianness) -> (void)]] [flags true])
(bytevector-u16-native-set! [sig [(bytevector sub-index u16) -> (void)]] [flags true])
(bytevector-s16-native-set! [sig [(bytevector sub-index s16) -> (void)]] [flags true])
(bytevector-u32-ref [sig [(bytevector sub-index endianness) -> (u32)]] [flags true mifoldable discard])
(bytevector-s32-ref [sig [(bytevector sub-index endianness) -> (s32)]] [flags true mifoldable discard])
(bytevector-u32-native-ref [sig [(bytevector sub-index) -> (u32)]] [flags true cp02])
(bytevector-s32-native-ref [sig [(bytevector sub-index) -> (s32)]] [flags true cp02])
(bytevector-u32-set! [sig [(bytevector sub-index u32 endianness) -> (void)]] [flags true])
(bytevector-s32-set! [sig [(bytevector sub-index s32 endianness) -> (void)]] [flags true])
(bytevector-u32-native-set! [sig [(bytevector sub-index u32) -> (void)]] [flags true])
(bytevector-s32-native-set! [sig [(bytevector sub-index s32) -> (void)]] [flags true])
(bytevector-u64-ref [sig [(bytevector sub-index endianness) -> (u64)]] [flags true mifoldable discard])
(bytevector-s64-ref [sig [(bytevector sub-index endianness) -> (s64)]] [flags true mifoldable discard])
(bytevector-u64-native-ref [sig [(bytevector sub-index) -> (u64)]] [flags true cp02])
(bytevector-s64-native-ref [sig [(bytevector sub-index) -> (s64)]] [flags true cp02])
(bytevector-u64-set! [sig [(bytevector sub-index u64 endianness) -> (void)]] [flags true])
(bytevector-s64-set! [sig [(bytevector sub-index s64 endianness) -> (void)]] [flags true])
(bytevector-u64-native-set! [sig [(bytevector sub-index u64) -> (void)]] [flags true])
(bytevector-s64-native-set! [sig [(bytevector sub-index s64) -> (void)]] [flags true])
(bytevector-ieee-single-ref [sig [(bytevector sub-index endianness) -> (flonum)]] [flags true mifoldable discard])
(bytevector-ieee-single-native-ref [sig [(bytevector sub-index) -> (flonum)]] [flags true mifoldable discard])
(bytevector-ieee-double-ref [sig [(bytevector sub-index endianness) -> (flonum)]] [flags true mifoldable discard])
(bytevector-ieee-double-native-ref [sig [(bytevector sub-index) -> (flonum)]] [flags true mifoldable discard])
(bytevector-ieee-single-set! [sig [(bytevector sub-index real endianness) -> (void)]] [flags true])
(bytevector-ieee-single-native-set! [sig [(bytevector sub-index real) -> (void)]] [flags true])
(bytevector-ieee-double-set! [sig [(bytevector sub-index real endianness) -> (void)]] [flags true])
(bytevector-ieee-double-native-set! [sig [(bytevector sub-index real) -> (void)]] [flags true])
(string->utf8 [sig [(string) -> (bytevector)]] [flags alloc])
(string->utf16 [sig [(string) (string endianness) -> (bytevector)]] [flags alloc])
(string->utf32 [sig [(string) (string endianness) -> (bytevector)]] [flags alloc])
(utf8->string [sig [(bytevector) -> (string)]] [flags alloc])
(utf16->string [sig [(bytevector endianness) (bytevector endianness ptr) -> (string)]] [flags alloc])
(utf32->string [sig [(bytevector endianness) (bytevector endianness ptr) -> (string)]] [flags alloc])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs control)] [flags keyword])
(when [flags])
(unless [flags])
(do [flags ieee r5rs])
(case-lambda [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs enums)] [flags keyword])
(define-enumeration [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs enums)] [flags primitive proc])
(make-enumeration [sig [(sub-list) -> (enum-set)]] [flags pure alloc])
(enum-set-universe [sig [(enum-set) -> (enum-set)]] [flags pure alloc])
(enum-set-indexer [sig [(enum-set) -> (procedure)]] [flags pure alloc])
(enum-set-constructor [sig [(enum-set) -> (procedure)]] [flags pure alloc])
(enum-set->list [sig [(enum-set) -> (list)]] [flags pure mifoldable discard alloc])
(enum-set-member? [sig [(symbol enum-set) -> (boolean)]] [flags pure mifoldable discard])
(enum-set-subset? [sig [(enum-set enum-set) -> (boolean)]] [flags pure mifoldable discard])
(enum-set=? [sig [(enum-set enum-set) -> (boolean)]] [flags pure mifoldable discard cp03])
(enum-set-union [sig [(enum-set enum-set) -> (enum-set)]] [flags pure alloc])
(enum-set-intersection [sig [(enum-set enum-set) -> (enum-set)]] [flags pure alloc])
(enum-set-difference [sig [(enum-set enum-set) -> (enum-set)]] [flags pure alloc])
(enum-set-complement [sig [(enum-set) -> (enum-set)]] [flags pure alloc])
(enum-set-projection [sig [(enum-set enum-set) -> (enum-set)]] [flags pure alloc])
)
(define-symbol-flags* ([libraries (rnrs eval)] [flags primitive proc])
((r6rs: eval) [sig [(ptr environment) -> (ptr ...)]] [flags ieee r5rs]) ; restricted to 2 arguments, first must be expression (not definition)
(environment [sig [(import-spec ...) -> (environment)]] [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs exceptions)] [flags keyword])
(guard [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs conditions)] [flags keyword])
(define-condition-type [flags])
(&condition [flags])
(&message [flags])
(&warning [flags])
(&serious [flags])
(&error [flags])
(&violation [flags])
(&assertion [flags])
(&irritants [flags])
(&who [flags])
(&non-continuable [flags])
(&implementation-restriction [flags])
(&lexical [flags])
(&syntax [flags])
(&undefined [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs exceptions)] [flags primitive proc])
(with-exception-handler [sig [(procedure procedure) -> (ptr ...)]] [flags])
(raise [sig [(ptr) -> (bottom)]] [flags unrestricted abort-op])
(raise-continuable [sig [(ptr) -> (ptr ...)]] [flags unrestricted])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs conditions)] [flags primitive proc])
(condition [sig [(condition ...) -> (condition)]] [flags pure mifoldable discard alloc])
(simple-conditions [sig [(condition) -> (list)]] [flags mifoldable discard true])
(condition? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(condition-predicate [sig [(sub-rtd) -> (procedure)]] [flags pure alloc])
(condition-accessor [sig [(sub-rtd procedure) -> (procedure)]] [flags pure alloc])
(make-message-condition [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(message-condition? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(condition-message [sig [(message-condition) -> (ptr)]] [flags pure mifoldable discard])
(make-warning [sig [() -> (condition)]] [flags pure unrestricted alloc])
(warning? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-serious-condition [sig [() -> (condition)]] [flags pure unrestricted alloc])
(serious-condition? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-error [sig [() -> (condition)]] [flags pure unrestricted alloc])
(error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-violation [sig [() -> (condition)]] [flags pure unrestricted alloc])
(violation? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-assertion-violation [sig [() -> (condition)]] [flags pure unrestricted alloc])
(assertion-violation? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-irritants-condition [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(irritants-condition? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(condition-irritants [sig [(irritants-condition) -> (ptr)]] [flags pure mifoldable discard])
(make-who-condition [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(who-condition? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(condition-who [sig [(who-condition) -> (ptr)]] [flags pure mifoldable discard])
(make-non-continuable-violation [sig [() -> (condition)]] [flags pure unrestricted alloc])
(non-continuable-violation? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-implementation-restriction-violation [sig [() -> (condition)]] [flags pure unrestricted alloc])
(implementation-restriction-violation? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-lexical-violation [sig [() -> (condition)]] [flags pure unrestricted alloc])
(lexical-violation? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-syntax-violation [sig [(ptr ptr) -> (condition)]] [flags pure unrestricted alloc])
(syntax-violation? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(syntax-violation-form [sig [(syntax-violation) -> (ptr)]] [flags pure mifoldable discard])
(syntax-violation-subform [sig [(syntax-violation) -> (ptr)]] [flags pure mifoldable discard])
(make-undefined-violation [sig [() -> (condition)]] [flags pure unrestricted alloc])
(undefined-violation? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs files)] [flags primitive proc])
((r6rs: file-exists?) [sig [(pathname) -> (boolean)]] [flags discard]) ; restricted to 1 argument
((r6rs: delete-file) [sig [(pathname) -> (void)]] [flags]) ; restricted to 1 argument
)
(define-symbol-flags* ([libraries (rnrs) (rnrs hashtables)] [flags primitive proc])
(make-eq-hashtable [sig [() (uint) -> (eq-hashtable)]] [flags alloc])
(make-eqv-hashtable [sig [() (uint) -> (hashtable)]] [flags alloc])
(make-hashtable [sig [(procedure procedure) (procedure procedure uint) -> (hashtable)]] [flags alloc])
(hashtable? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(hashtable-size [sig [(hashtable) -> (length)]] [flags discard true])
(hashtable-ref [sig [(hashtable ptr ptr) -> (ptr)]] [flags discard])
(hashtable-set! [sig [(hashtable ptr ptr) -> (void)]] [flags true])
(hashtable-delete! [sig [(hashtable ptr) -> (void)]] [flags true])
(hashtable-contains? [sig [(hashtable ptr) -> (boolean)]] [flags discard])
(hashtable-update! [sig [(hashtable ptr procedure ptr) -> (void)]] [flags])
(hashtable-copy [sig [(hashtable) (hashtable ptr) -> (hashtable)]] [flags alloc])
(hashtable-clear! [sig [(hashtable) (hashtable sub-uint) -> (void)]] [flags true])
((r6rs: hashtable-keys) [sig [(hashtable) -> (vector)]] [flags alloc]) ; no size argument
((r6rs: hashtable-entries) [sig [(hashtable) -> (vector vector)]] [flags alloc]) ; no size argument
(hashtable-equivalence-function [sig [(hashtable) -> (ptr)]] [flags])
(hashtable-hash-function [sig [(hashtable) -> (ptr)]] [flags])
(hashtable-mutable? [sig [(hashtable) -> (boolean)]] [flags mifoldable discard])
(equal-hash [sig [(ptr) -> (length)]] [flags unrestricted true])
(string-hash [sig [(string) -> (length)]] [flags true])
(string-ci-hash [sig [(string) -> (length)]] [flags true])
(symbol-hash [sig [(symbol) -> (length)]] [flags true])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs io ports)] [flags keyword])
(file-options [flags])
(buffer-mode [flags])
(eol-style [flags])
(&i/o-decoding [flags])
(&i/o-encoding [flags])
(error-handling-mode [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs io ports) (rnrs io simple)] [flags primitive proc])
(eof-object [sig [() -> (eof-object)]] [flags pure unrestricted mifoldable discard true])
(eof-object? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
(input-port? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
((r6rs: current-input-port) [sig [() -> (textual-input-port)]] [flags ieee r5rs])
(output-port? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard ieee r5rs])
((r6rs: current-output-port) [sig [() -> (textual-output-port)]] [flags ieee r5rs])
((r6rs: current-error-port) [sig [() -> (textual-output-port)]] [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs io ports)] [flags primitive proc])
(buffer-mode? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(latin-1-codec [sig [() -> (codec)]] [flags pure unrestricted true])
(utf-8-codec [sig [() -> (codec)]] [flags pure unrestricted true])
((r6rs: utf-16-codec) [sig [() -> (codec)]] [flags pure unrestricted true])
(native-eol-style [sig [() -> (symbol)]] [flags pure unrestricted true])
(make-i/o-decoding-error [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(i/o-decoding-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-i/o-encoding-error [sig [(ptr ptr) -> (condition)]] [flags pure unrestricted alloc]) ; restricted?
(i/o-encoding-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(i/o-encoding-error-char [sig [(i/o-encoding-error) -> (ptr)]] [flags pure mifoldable discard])
(make-transcoder [sig [(codec) (codec sub-symbol) (codec sub-symbol sub-symbol) -> (transcoder)]] [flags pure alloc])
(native-transcoder [sig [() -> (transcoder)]] [flags pure unrestricted true])
(transcoder-codec [sig [(transcoder) -> (codec)]] [flags pure mifoldable discard true])
(transcoder-eol-style [sig [(transcoder) -> (symbol)]] [flags pure mifoldable discard true])
(transcoder-error-handling-mode [sig [(transcoder) -> (symbol)]] [flags pure mifoldable discard true])
(bytevector->string [sig [(bytevector transcoder) -> (string)]] [flags alloc]) ; leave off alloc if transcoders can be user-defined
(string->bytevector [sig [(string transcoder) -> (bytevector)]] [flags alloc]) ; leave off alloc if transcoders can be user-defined
(port? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(port-transcoder [sig [(port) -> (ptr)]] [flags pure mifoldable discard])
(textual-port? [sig [(port) -> (boolean)]] [flags pure mifoldable discard])
(binary-port? [sig [(port) -> (boolean)]] [flags pure mifoldable discard])
(transcoded-port [sig [(binary-port transcoder) -> (textual-port)]] [flags alloc])
(port-has-port-position? [sig [(port) -> (boolean)]] [flags pure mifoldable discard])
(port-position [sig [(port) -> (ptr)]] [flags])
(port-has-set-port-position!? [sig [(port) -> (boolean)]] [flags pure mifoldable discard])
(set-port-position! [sig [(port sub-ptr) -> (void)]] [flags])
(close-port [sig [(port) -> (void)]] [flags true])
(call-with-port [sig [(port procedure) -> (ptr ...)]] [flags])
(port-eof? [sig [(input-port) -> (boolean)]] [flags])
(open-file-input-port [sig [(pathname) (pathname file-options) (pathname file-options sub-symbol) (pathname file-options sub-symbol maybe-transcoder) -> (input-port)]] [flags true])
(open-bytevector-input-port [sig [(bytevector) (bytevector maybe-transcoder) -> (input-port)]] [flags alloc])
(open-string-input-port [sig [(string) -> (textual-input-port)]] [flags alloc])
((r6rs: standard-input-port) [sig [() -> (binary-input-port)]] [flags true])
(make-custom-binary-input-port [sig [(string procedure maybe-procedure maybe-procedure maybe-procedure) -> (binary-input-port)]] [flags alloc])
(make-custom-textual-input-port [sig [(string procedure maybe-procedure maybe-procedure maybe-procedure) -> (textual-input-port)]] [flags alloc])
(get-u8 [sig [(binary-input-port) -> (ptr)]] [flags])
(lookahead-u8 [sig [(binary-input-port) -> (ptr)]] [flags])
(get-bytevector-n [sig [(binary-input-port length) -> (ptr)]] [flags true])
(get-bytevector-n! [sig [(binary-input-port bytevector length length) -> (ptr)]] [flags true])
(get-bytevector-some [sig [(binary-input-port) -> (ptr)]] [flags true])
(get-bytevector-all [sig [(binary-input-port) -> (ptr)]] [flags true])
(get-char [sig [(textual-input-port) -> (ptr)]] [flags true])
(lookahead-char [sig [(textual-input-port) -> (ptr)]] [flags true])
(get-string-n [sig [(textual-input-port length) -> (ptr)]] [flags true])
(get-string-n! [sig [(textual-input-port string length length) -> (ptr)]] [flags true])
(get-string-all [sig [(textual-input-port) -> (ptr)]] [flags true])
(get-line [sig [(textual-input-port) -> (ptr)]] [flags true])
(get-datum [sig [(textual-input-port) -> (ptr)]] [flags])
((r6rs: flush-output-port) [sig [(output-port) -> (void)]] [flags]) ; restricted to 1 argument
(output-port-buffer-mode [sig [(output-port) -> (symbol)]] [flags true])
(open-file-output-port [sig [(pathname) (pathname file-options) (pathname file-options sub-symbol) (pathname file-options sub-symbol maybe-transcoder) -> (output-port)]] [flags true])
(open-bytevector-output-port [sig [() (maybe-transcoder) -> (output-port procedure)]] [flags discard])
(call-with-bytevector-output-port [sig [(procedure) (procedure maybe-transcoder) -> (bytevector)]] [flags])
(open-string-output-port [sig [() -> (textual-output-port procedure)]] [flags alloc])
(call-with-string-output-port [sig [(procedure) -> (string)]] [flags])
((r6rs: standard-output-port) [sig [() -> (binary-output-port)]] [flags true])
((r6rs: standard-error-port) [sig [() -> (binary-output-port)]] [flags true])
(make-custom-binary-output-port [sig [(string procedure maybe-procedure maybe-procedure maybe-procedure) -> (binary-output-port)]] [flags alloc])
(make-custom-textual-output-port [sig [(string procedure maybe-procedure maybe-procedure maybe-procedure) -> (textual-output-port)]] [flags alloc])
(put-u8 [sig [(binary-output-port u8) -> (void)]] [flags])
(put-bytevector [sig [(binary-output-port bytevector) (binary-output-port bytevector length) (binary-output-port bytevector length length) -> (void)]] [flags true])
(put-char [sig [(textual-output-port char) -> (void)]] [flags true])
(put-string [sig [(textual-output-port string) (textual-output-port string length) (textual-output-port string length length) -> (void)]] [flags true])
(put-datum [sig [(textual-output-port ptr) -> (void)]] [flags true])
(open-file-input/output-port [sig [(pathname) (pathname file-options) (pathname file-options sub-symbol) (pathname file-options sub-symbol maybe-transcoder) -> (input/output-port)]] [flags true])
(make-custom-binary-input/output-port [sig [(string procedure procedure maybe-procedure maybe-procedure maybe-procedure) -> (binary-input/output-port)]] [flags alloc])
(make-custom-textual-input/output-port [sig [(string procedure procedure maybe-procedure maybe-procedure maybe-procedure) -> (textual-input/output-port)]] [flags alloc])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs files) (rnrs io ports) (rnrs io simple)] [flags keyword])
(&i/o [flags])
(&i/o-read [flags])
(&i/o-write [flags])
(&i/o-invalid-position [flags])
(&i/o-filename [flags])
(&i/o-file-protection [flags])
(&i/o-file-is-read-only [flags])
(&i/o-file-already-exists [flags])
(&i/o-file-does-not-exist [flags])
(&i/o-port [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs files) (rnrs io ports) (rnrs io simple)] [flags primitive proc])
(make-i/o-error [sig [() -> (condition)]] [flags pure unrestricted alloc])
(i/o-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-i/o-read-error [sig [() -> (condition)]] [flags pure unrestricted alloc])
(i/o-read-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-i/o-write-error [sig [() -> (condition)]] [flags pure unrestricted alloc])
(i/o-write-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-i/o-invalid-position-error [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(i/o-invalid-position-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(i/o-error-position [sig [(i/o-invalid-position-error) -> (ptr)]] [flags pure mifoldable discard])
(make-i/o-filename-error [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(i/o-filename-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(i/o-error-filename [sig [(i/o-filename-error) -> (ptr)]] [flags pure mifoldable discard])
(make-i/o-file-protection-error [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(i/o-file-protection-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-i/o-file-is-read-only-error [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(i/o-file-is-read-only-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-i/o-file-already-exists-error [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(i/o-file-already-exists-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-i/o-file-does-not-exist-error [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(i/o-file-does-not-exist-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(make-i/o-port-error [sig [(ptr) -> (condition)]] [flags pure unrestricted alloc])
(i/o-port-error? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(i/o-error-port [sig [(i/o-port-error) -> (ptr)]] [flags pure mifoldable discard])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs io simple)] [flags primitive proc])
((r6rs: call-with-input-file) [sig [(pathname procedure) -> (ptr ...)]] [flags ieee r5rs]) ; has no options argument
((r6rs: call-with-output-file) [sig [(pathname procedure) -> (ptr ...)]] [flags ieee r5rs]) ; has no options argument
((r6rs: with-input-from-file) [sig [(pathname procedure) -> (ptr ...)]] [flags ieee r5rs]) ; has no options argument
((r6rs: with-output-to-file) [sig [(pathname procedure) -> (ptr ...)]] [flags ieee r5rs]) ; has no options argument
((r6rs: open-input-file) [sig [(pathname) -> (textual-input-port)]] [flags true ieee r5rs]) ; has no options argument
((r6rs: open-output-file) [sig [(pathname) -> (textual-output-port)]] [flags true ieee r5rs]) ; has no options argument
(close-input-port [sig [(input-port) -> (void)]] [flags true ieee r5rs])
(close-output-port [sig [(output-port) -> (void)]] [flags true ieee r5rs])
(read-char [sig [() (textual-input-port) -> (ptr)]] [flags true ieee r5rs])
(peek-char [sig [() (textual-input-port) -> (ptr)]] [flags true ieee r5rs])
(read [sig [() (textual-input-port) -> (ptr)]] [flags ieee r5rs])
(write-char [sig [(char) (char textual-output-port) -> (void)]] [flags true ieee r5rs])
(newline [sig [() (textual-output-port) -> (void)]] [flags true ieee r5rs])
(display [sig [(ptr) (ptr textual-output-port) -> (void)]] [flags true ieee r5rs])
(write [sig [(ptr) (ptr textual-output-port) -> (void)]] [flags true ieee r5rs])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs lists)] [flags primitive proc])
(find [sig [(procedure sub-ptr) -> (ptr)]] [flags cp03])
(for-all [sig [(procedure list list ...) -> (ptr ...)]] [flags cp03])
(exists [sig [(procedure list list ...) -> (ptr ...)]] [flags cp03])
(filter [sig [(procedure list) -> (list)]] [flags true cp03])
(partition [sig [(procedure list) -> (list list)]] [flags])
(fold-left [sig [(procedure ptr list list ...) -> (ptr ...)]] [flags cp03])
(fold-right [sig [(procedure ptr list list ...) -> (ptr ...)]] [flags cp03])
(remp [sig [(procedure list) -> (list)]] [flags true cp03])
(remove [sig [(ptr list) -> (list)]] [flags true cp02]) ; mifoldable discard could break eq?
(remv [sig [(ptr list) -> (list)]] [flags alloc cp02]) ; mifoldable discard could break eq?
(remq [sig [(ptr list) -> (list)]] [flags alloc cp02]) ; mifoldable discard could break eq?
(memp [sig [(procedure sub-ptr) -> (ptr)]] [flags cp03])
(member [sig [(ptr sub-ptr) -> (ptr)]] [flags mifoldable cp02 ieee r5rs])
(memv [sig [(ptr sub-ptr) -> (ptr)]] [flags mifoldable discard cp02 ieee r5rs])
(memq [sig [(ptr sub-ptr) -> (ptr)]] [flags mifoldable discard cp02 ieee r5rs])
(assp [sig [(procedure sub-ptr) -> (ptr)]] [flags cp03])
(assoc [sig [(ptr sub-ptr) -> (ptr)]] [flags mifoldable cp02 ieee r5rs])
(assv [sig [(ptr sub-ptr) -> (ptr)]] [flags mifoldable discard cp02 ieee r5rs])
(assq [sig [(ptr sub-ptr) -> (ptr)]] [flags mifoldable discard cp02 ieee r5rs])
(cons* [sig [(ptr) -> (ptr)] [(ptr ptr ptr ...) -> ((ptr . ptr))]] [flags unrestricted discard cp02])
)
(define-symbol-flags* ([libraries (rnrs mutable-pairs)] [flags primitive proc])
(set-car! [sig [((ptr . ptr) ptr) -> (void)]] [flags true ieee r5rs])
(set-cdr! [sig [((ptr . ptr) ptr) -> (void)]] [flags true ieee r5rs])
)
(define-symbol-flags* ([libraries (rnrs mutable-strings)] [flags primitive proc])
(string-set! [sig [(string sub-index char) -> (void)]] [flags true ieee r5rs])
(string-fill! [sig [(string char) -> (void)]] [flags true ieee r5rs])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs programs)] [flags primitive proc])
((r6rs: command-line) [sig [() -> (list)]] [flags]) ; restricted to 0 arguments
((r6rs: exit) [sig [() (ptr) -> (bottom)]] [flags abort-op]) ; restricted to 0 or 1 argument
)
(define-symbol-flags* ([libraries (rnrs r5rs)] [flags keyword])
(delay [flags r5rs])
)
(define-symbol-flags* ([libraries (rnrs r5rs)] [flags primitive proc])
(exact->inexact [sig [(number) -> (inexact-number)]] [flags arith-op mifoldable discard ieee r5rs])
(inexact->exact [sig [(number) -> (exact-number)]] [flags arith-op mifoldable discard ieee r5rs])
(quotient [sig [(integer integer) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(remainder [sig [(integer integer) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(modulo [sig [(integer integer) -> (number)]] [flags arith-op mifoldable discard ieee r5rs])
(force [sig [(procedure) -> (ptr)]] [flags r5rs])
(null-environment [sig [(sub-fixnum) -> (environment)]] [flags alloc ieee r5rs])
(scheme-report-environment [sig [(sub-fixnum) -> (environment)]] [flags alloc ieee r5rs])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs records syntactic)] [flags keyword])
(define-record-type [flags])
(fields [flags])
(mutable [flags])
(immutable [flags])
(parent [flags])
(protocol [flags])
(sealed [flags])
(opaque [flags])
(nongenerative [flags])
(parent-rtd [flags])
(record-type-descriptor [flags])
(record-constructor-descriptor [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs records procedural)] [flags primitive proc])
(make-record-type-descriptor [sig [(symbol maybe-rtd maybe-symbol ptr ptr vector) -> (rtd)]] [flags pure alloc cp02])
(record-type-descriptor? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard cp02])
(make-record-constructor-descriptor [sig [(rtd maybe-sub-rcd maybe-procedure) -> (rcd)]] [flags pure true cp02])
((r6rs: record-constructor) [sig [(rcd) -> (procedure)]] [flags cp02]) ; user-supplied protocol can do anything
(record-predicate [sig [(rtd) -> (procedure)]] [flags pure alloc cp02])
(record-accessor [sig [(rtd sub-index) -> (procedure)]] [flags pure alloc cp02])
(record-mutator [sig [(rtd sub-index) -> (procedure)]] [flags pure alloc cp02])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs records inspection)] [flags primitive proc])
((r6rs: record?) [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard cp02])
(record-rtd [sig [(record) -> (rtd)]] [flags pure mifoldable discard true cp02])
(record-type-name [sig [(rtd) -> (symbol)]] [flags pure mifoldable discard true cp02])
(record-type-parent [sig [(rtd) -> (ptr)]] [flags pure mifoldable discard cp02])
(record-type-uid [sig [(rtd) -> (symbol)]] [flags pure mifoldable discard true cp02])
(record-type-generative? [sig [(rtd) -> (boolean)]] [flags pure mifoldable discard])
(record-type-sealed? [sig [(rtd) -> (boolean)]] [flags pure mifoldable discard cp02])
(record-type-opaque? [sig [(rtd) -> (boolean)]] [flags pure mifoldable discard cp02])
(record-type-field-names [sig [(rtd) -> (vector)]] [flags pure mifoldable discard true cp02])
(record-field-mutable? [sig [(rtd sub-index) -> (boolean)]] [flags pure mifoldable discard cp02])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs sorting)] [flags primitive proc])
(list-sort [sig [(procedure list) -> (list)]] [flags true])
(vector-sort [sig [(procedure vector) -> (vector)]] [flags true])
(vector-sort! [sig [(procedure vector) -> (void)]] [flags true])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs syntax-case)] [flags keyword])
(syntax-case [flags])
(syntax [flags])
(with-syntax [flags])
(quasisyntax [flags])
(unsyntax [flags])
(unsyntax-splicing [flags])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs syntax-case)] [flags primitive proc])
(make-variable-transformer [sig [(procedure) -> (ptr)]] [flags pure mifoldable discard])
(identifier? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(bound-identifier=? [sig [(identifier identifier) -> (boolean)]] [flags pure mifoldable discard cp03])
(free-identifier=? [sig [(identifier identifier) -> (boolean)]] [flags pure mifoldable discard cp03])
(syntax->datum [sig [(ptr) -> (ptr)]] [flags pure unrestricted mifoldable discard])
(datum->syntax [sig [(identifier ptr) -> (ptr)]] [flags pure mifoldable discard])
(generate-temporaries [sig [(ptr) -> (list)]] [flags alloc]) ; the argument can be a list, a syntax with a list or an annotation
(syntax-violation [sig [(who string ptr) (who string ptr ptr) -> (bottom)]] [flags abort-op])
)
(define-symbol-flags* ([libraries (rnrs) (rnrs unicode)] [flags primitive proc]) ; unicode
(char-upcase [sig [(char) -> (char)]] [flags pure mifoldable discard true ieee r5rs])
(char-downcase [sig [(char) -> (char)]] [flags pure mifoldable discard true ieee r5rs])
(char-titlecase [sig [(char) -> (char)]] [flags pure mifoldable discard])
(char-foldcase [sig [(char) -> (char)]] [flags pure mifoldable discard])
((r6rs: char-ci<=?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: char-ci<?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: char-ci=?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs cp03]) ; restricted to 2+ arguments
((r6rs: char-ci>=?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: char-ci>?) [sig [(char char char ...) -> (boolean)]] [flags pure mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
(char-alphabetic? [sig [(char) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(char-numeric? [sig [(char) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(char-whitespace? [sig [(char) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(char-upper-case? [sig [(char) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(char-lower-case? [sig [(char) -> (boolean)]] [flags pure mifoldable discard ieee r5rs])
(char-title-case? [sig [(char) -> (boolean)]] [flags pure mifoldable discard])
(char-general-category [sig [(char) -> (symbol)]] [flags pure mifoldable discard])
(string-upcase [sig [(string) -> (string)]] [flags mifoldable discard])
(string-downcase [sig [(string) -> (string)]] [flags mifoldable discard])
(string-titlecase [sig [(string) -> (string)]] [flags mifoldable discard])
(string-foldcase [sig [(string) -> (string)]] [flags mifoldable discard])
((r6rs: string-ci<=?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: string-ci<?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: string-ci=?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs cp03]) ; restricted to 2+ arguments
((r6rs: string-ci>=?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
((r6rs: string-ci>?) [sig [(string string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; restricted to 2+ arguments
(string-normalize-nfd [sig [(string) -> (string)]] [flags mifoldable discard])
(string-normalize-nfkd [sig [(string) -> (string)]] [flags mifoldable discard])
(string-normalize-nfc [sig [(string) -> (string)]] [flags mifoldable discard])
(string-normalize-nfkc [sig [(string) -> (string)]] [flags mifoldable discard])
)
;;; end of r6rs features
(define-symbol-flags* ([libraries (chezscheme csv7)] [flags primitive proc]) ; csv7 compatibility
((csv7: record-field-accessible?) [sig [(rtd sub-ptr) -> (boolean)]] [flags pure mifoldable discard cp02])
((csv7: record-field-accessor) [sig [(rtd sub-ptr) -> (procedure)]] [flags pure alloc cp02])
((csv7: record-field-mutable?) [sig [(rtd sub-ptr) -> (boolean)]] [flags pure mifoldable discard cp02])
((csv7: record-field-mutator) [sig [(rtd sub-ptr) -> (procedure)]] [flags pure alloc cp02])
((csv7: record-type-descriptor) [sig [(record) -> (rtd)]] [flags pure mifoldable discard true cp02])
((csv7: record-type-field-decls) [sig [(rtd) -> (list)]] [flags pure mifoldable discard true cp02])
((csv7: record-type-field-names) [sig [(rtd) -> (list)]] [flags pure mifoldable discard true cp02])
((csv7: record-type-name) [sig [(rtd) -> (string)]] [flags pure mifoldable discard true cp02])
((csv7: record-type-symbol) [sig [(rtd) -> (symbol)]] [flags pure mifoldable discard true cp02])
)
(define-symbol-flags* ([libraries] [flags primitive proc]) ; srfi 19
(add-duration (sig [(time time) -> (time)]) [flags alloc])
(add-duration! (sig [(time time) -> (time)]) [flags alloc])
(current-date [sig [() (sub-fixnum) -> (date)]] [flags alloc])
(current-time [sig [() (sub-fixnum) -> (time)]] [flags alloc])
(date-day [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(date-hour [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date-minute [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date-month [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date-nanosecond [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date-second [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date-week-day [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date-year-day [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date-dst? [sig [(date) -> (boolean)]] [flags pure mifoldable discard])
(date-year [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date-zone-offset [sig [(date) -> (fixnum)]] [flags pure mifoldable discard true])
(date-zone-name [sig [(date) -> (ptr)]] [flags pure mifoldable discard])
(date->time-utc [sig [(date) -> (time-utc)]] [flags alloc])
(make-date [sig [(sub-ufixnum sub-ufixnum sub-ufixnum sub-ufixnum sub-ufixnum sub-ufixnum sub-ufixnum sub-fixnum) -> (date)]
[(sub-ufixnum sub-ufixnum sub-ufixnum sub-ufixnum sub-ufixnum sub-ufixnum sub-ufixnum) -> (date)]]
[flags alloc])
(make-time [sig [(sub-symbol sub-ufixnum sub-fixnum) -> (time)]] [flags alloc])
(set-time-nanosecond! [sig [(time sub-uint) -> (void)]] [flags true])
(set-time-second! [sig [(time sub-fixnum) -> (void)]] [flags true])
(set-time-type! [sig [(time sub-symbol) -> (void)]] [flags true])
(subtract-duration (sig [(time time) -> (time)]) [flags alloc])
(subtract-duration! (sig [(time time) -> (time)]) [flags alloc])
(time? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(time=? [sig [(time time) -> (boolean)]] [flags mifoldable discard cp03])
(time<? [sig [(time time) -> (boolean)]] [flags mifoldable discard])
(time<=? [sig [(time time) -> (boolean)]] [flags mifoldable discard])
(time>=? [sig [(time time) -> (boolean)]] [flags mifoldable discard])
(time>? [sig [(time time) -> (boolean)]] [flags mifoldable discard])
(time-difference (sig [(time time) -> (time)]) [flags alloc])
(time-difference! (sig [(time time) -> (time)]) [flags alloc])
(time-nanosecond [sig [(time) -> (uint)]] [flags mifoldable discard true])
(time-second [sig [(time) -> (fixnum)]] [flags mifoldable discard true])
(time-type [sig [(time) -> (symbol)]] [flags mifoldable discard true])
(time-utc->date [sig [(time-utc) (time-utc sub-fixnum) -> (date)]] [flags alloc])
)
(define-symbol-flags* ([libraries] [flags primitive proc]) ; constant parameters
(directory-separator [sig [() -> (char)]] [flags pure unrestricted true cp02])
(get-process-id [sig [() -> (uint)]] [flags pure unrestricted])
(get-thread-id [sig [() -> (uint)]] [flags discard unrestricted])
(machine-type [sig [() -> (symbol)]] [flags pure unrestricted true cp02])
(most-negative-fixnum [sig [() -> (fixnum)]] [flags pure unrestricted true cp02])
(most-positive-fixnum [sig [() -> (ufixnum)]] [flags pure unrestricted true cp02])
(petite? [sig [() -> (boolean)]] [flags pure unrestricted])
(scheme-version [sig [() -> (string)]] [flags pure unrestricted true])
(scheme-version-number [sig [() -> (uint uint uint)]] [flags pure unrestricted true])
(threaded? [sig [() -> (boolean)]] [flags pure unrestricted cp02])
)
(define-symbol-flags* ([libraries] [flags primitive proc]) ; variable parameters
(abort-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(base-exception-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(break-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(case-sensitive [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(cd [sig [() -> (pathname)] [(pathname) -> (void)]] [flags])
(collect-generation-radix [sig [() -> (ufixnum)] [(sub-ufixnum) -> (void)]] [flags])
(collect-maximum-generation [sig [() -> (ufixnum)] [(sub-ufixnum) -> (void)]] [flags])
(collect-notify [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(collect-request-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(collect-trip-bytes [sig [() -> (ufixnum)] [(ufixnum) -> (void)]] [flags])
(command-line [sig [() -> (list)] [(sub-list) -> (void)]] [flags]) ; not restricted to 1 argument
(command-line-arguments [sig [() -> (list)] [(sub-list) -> (void)]] [flags])
(commonization-level [sig [() -> (ufixnum)] [(sub-ufixnum) -> (void)]] [flags])
(compile-file-message [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(compile-interpret-simple [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(compile-imported-libraries [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(compile-library-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(compile-profile [sig [() -> (ptr)] [(ptr) -> (void)]] [flags unrestricted])
(compile-program-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(compress-format [sig [() -> (symbol)] [(sub-symbol) -> (void)]] [flags])
(compress-level [sig [() -> (symbol)] [(sub-symbol) -> (void)]] [flags])
(console-error-port [sig [() -> (textual-output-port)] [(textual-output-port) -> (void)]] [flags])
(console-input-port [sig [() -> (textual-input-port)] [(textual-input-port) -> (void)]] [flags])
(console-output-port [sig [() -> (textual-output-port)] [(textual-output-port) -> (void)]] [flags])
(cp0-effort-limit [sig [() -> (ufixnum)] [(ufixnum) -> (void)]] [flags])
(cp0-outer-unroll-limit [sig [() -> (ufixnum)] [(ufixnum) -> (void)]] [flags])
(cp0-score-limit [sig [() -> (ufixnum)] [(ufixnum) -> (void)]] [flags])
(current-directory [sig [() -> (pathname)] [(pathname) -> (void)]] [flags])
(current-error-port [sig [() -> (textual-output-port)] [(textual-output-port) -> (void)]] [flags]) ; not restricted to 1 argument
(current-eval [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(current-exception-state [sig [() -> (exception-state)] [(exception-state) -> (void)]] [flags])
(current-expand [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(current-input-port [sig [() -> (textual-input-port)] [(textual-input-port) -> (void)]] [flags]) ; not restricted to 1 argument
(current-locate-source-object-source [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(current-make-source-object [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(current-output-port [sig [() -> (textual-output-port)] [(textual-output-port) -> (void)]] [flags]) ; not restricted to 1 argument
(current-transcoder [sig [() -> (transcoder)] [(transcoder) -> (void)]] [flags])
(custom-port-buffer-size [sig [() -> (ufixnum)] [(sub-fixnum) -> (void)]] [flags])
(debug-level [sig [() -> (ufixnum)] [(sub-ufixnum) -> (void)]] [flags])
(debug-on-exception [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(default-library-search-handler [sig [(symbol library-path list-of-string-pairs list-of-string-pairs) -> (maybe-string maybe-string boolean)]] [flags])
(default-record-equal-procedure [sig [() -> (maybe-procedure)] [(maybe-procedure) -> (void)]] [flags])
(default-record-hash-procedure [sig [() -> (maybe-procedure)] [(maybe-procedure) -> (void)]] [flags])
(enable-cross-library-optimization [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(enable-object-counts [sig [() -> (boolean)] [(ptr) -> (void)]] [flags])
(eval-syntax-expanders-when [sig [() -> (list)] [(sub-list) -> (void)]] [flags])
(expand-output [sig [() -> (maybe-textual-output-port)] [(maybe-textual-output-port) -> (void)]] [flags])
(expand/optimize-output [sig [() -> (maybe-textual-output-port)] [(maybe-textual-output-port) -> (void)]] [flags])
(exit-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(fasl-compressed [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(file-buffer-size [sig [() -> (ufixnum)] [(sub-fixnum) -> (void)]] [flags])
(generate-allocation-counts [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(generate-covin-files [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(generate-inspector-information [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(generate-instruction-counts [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(generate-interrupt-trap [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(generate-procedure-source-information [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(generate-profile-forms [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(generate-wpo-files [sig [() -> (boolean)] [(ptr) -> (void)]] [flags])
(gensym-count [sig [() -> (uint)] [(uint) -> (void)]] [flags])
(gensym-prefix [sig [() -> (ptr)] [(ptr) -> (void)]] [flags unrestricted])
(heap-reserve-ratio [sig [() -> (number)] [(sub-number) -> (void)]] [flags])
(import-notify [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(interaction-environment [sig [() -> (environment)] [(environment) -> (void)]] [flags ieee r5rs])
(internal-defines-as-letrec* [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(invoke-library [sig [(ptr) -> (void)]] [flags true])
(keyboard-interrupt-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(library-directories [sig [() -> (list)] [(sub-ptr) -> (void)]] [flags])
(library-exports [sig [(sub-list) -> (list)]] [flags])
(library-extensions [sig [() -> (list)] [(sub-ptr) -> (void)]] [flags])
(library-object-filename [sig [(sub-list) -> (maybe-string)]] [flags])
(library-list [sig [() -> (list)]] [flags])
(library-requirements [sig [(sub-list) -> (list)] [(sub-list library-requirements-options) -> (list)]] [flags])
(library-search-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(library-version [sig [(sub-list) -> (list)]] [flags])
(make-codec-buffer [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(optimize-level [sig [() -> (ufixnum)] [(sub-ufixnum) -> (void)]] [flags])
(pretty-initial-indent [sig [() -> (ufixnum)] [(ufixnum) -> (void)]] [flags])
(pretty-line-length [sig [() -> (ufixnum)] [(sub-ufixnum) -> (void)]] [flags])
(pretty-maximum-lines [sig [() -> (maybe-ufixnum)] [(maybe-ufixnum) -> (void)]] [flags])
(pretty-one-line-limit [sig [() -> (ufixnum)] [(sub-ufixnum) -> (void)]] [flags])
(pretty-standard-indent [sig [() -> (ufixnum)] [(ufixnum) -> (void)]] [flags])
(print-brackets [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(print-char-name [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(print-extended-identifiers [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(print-gensym [sig [() -> (ptr)] [(ptr) -> (void)]] [flags unrestricted])
(print-graph [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(print-length [sig [() -> (maybe-ufixnum)] [(maybe-ufixnum) -> (void)]] [flags])
(print-level [sig [() -> (maybe-ufixnum)] [(maybe-ufixnum) -> (void)]] [flags])
(print-precision [sig [() -> (maybe-uint)] [(maybe-uint) -> (void)]] [flags])
(print-radix [sig [() -> (ufixnum)] [(sub-ufixnum) -> (void)]] [flags])
(print-record [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(print-unicode [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(print-vector-length [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(profile-palette [sig [() -> (vector)] [(sub-vector) -> (void)]] [flags])
(profile-line-number-color [sig [() -> (maybe-string)] [(maybe-string) -> (void)]] [flags])
(random-seed [sig [() -> (u32)] [(u32) -> (void)]] [flags])
(release-minimum-generation [sig [() -> (ufixnum)] [(sub-ufixnum) -> (void)]] [flags])
(require-nongenerative-clause [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(reset-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(run-cp0 [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(scheme-start [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(scheme-program [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(scheme-script [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(self-evaluating-vectors [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(source-directories [sig [() -> (list)] [(sub-list) -> (void)]] [flags])
(subset-mode [sig [() -> (maybe-symbol)] [(maybe-sub-symbol) -> (void)]] [flags])
(suppress-greeting [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(timer-interrupt-handler [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(trace-output-port [sig [() -> (maybe-textual-output-port)] [(maybe-textual-output-port) -> (void)]] [flags])
(trace-print [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(transcoded-port-buffer-size [sig [() -> (ufixnum)] [(sub-fixnum) -> (void)]] [flags])
(undefined-variable-warnings [sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
(waiter-prompt-string [sig [() -> (string)] [(string) -> (void)]] [flags])
(waiter-prompt-and-read [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
(waiter-write [sig [() -> (procedure)] [(procedure) -> (void)]] [flags])
)
(define-symbol-flags* ([libraries] [flags ieee r5rs keyword])
($primitive [flags])
)
(define-symbol-flags* ([libraries] [flags keyword]) ; condition types
(&continuation [flags])
(&format [flags])
(&source [flags])
)
(define-symbol-flags* ([libraries] [flags keyword])
($system [flags library-uid])
(add-prefix [flags])
(alias [flags])
(annotation-options [flags])
(case [flags])
(constructor [flags])
(critical-section [flags])
(datum [flags])
(define-ftype [flags])
(define-property [flags])
(define-record [flags])
(define-structure [flags])
(define-values [flags])
(drop-prefix [flags])
(eval-when [flags])
(except [flags])
(exclusive-cond [flags])
(export [flags])
(expression-editor [feature expeditor] [flags])
(extend-syntax [flags])
(fasl-strip-options [flags])
(fluid-let [flags])
(fluid-let-syntax [flags])
(foreign-callable [flags])
(foreign-procedure [flags])
(ftype-guardian [flags])
(ftype-init-lock! [flags])
(ftype-lock! [flags])
(ftype-locked-decr! [flags])
(ftype-locked-incr! [flags])
(ftype-pointer? [flags])
(ftype-sizeof [flags])
(ftype-&ref [flags])
(ftype-ref [flags])
(ftype-set! [flags])
(ftype-spin-lock! [flags])
(ftype-unlock! [flags])
(ieee [flags library-uid])
(implicit-exports [flags])
(import [flags])
(import-only [flags])
(include [flags])
(indirect-export [flags])
(library [flags])
(library-requirements-options [flags])
(make-ftype-pointer [flags])
(meta [flags])
(meta-cond [flags])
(module [flags])
(only [flags])
(parameterize [flags])
(pariah [flags])
(predicate [flags])
(prefix [flags])
(profile [flags])
(rec [flags])
(rename [flags])
(record-case [flags])
(r5rs [flags library-uid])
(r5rs-syntax [flags library-uid])
(scheme [flags library-uid])
(syntax-rules [flags])
(time [flags])
(top-level-program [flags])
(trace [flags])
(trace-case-lambda [flags])
(trace-define [flags])
(trace-define-syntax [flags])
(trace-do [flags])
(trace-lambda [flags])
(trace-let [flags])
(type-descriptor [flags])
(untrace [flags])
(with-implicit [flags])
(with-interrupts-disabled [flags])
(with-mutex [feature pthreads] [flags])
)
(define-symbol-flags* ([libraries] [flags primitive proc])
(< [sig [(real real ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(<= [sig [(real real ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(= [sig [(number number ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(> [sig [(real real ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(>= [sig [(real real ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(-1+ [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(1+ [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(1- [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(abort [sig [() (ptr) -> (bottom)]] [flags abort-op])
(acosh [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(add1 [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(andmap [sig [(procedure list list ...) -> (ptr ...)]] [flags cp03])
(annotation? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(annotation-expression [sig [(annotation) -> (ptr)]] [flags pure mifoldable discard true])
(annotation-option-set [sig [(annotation) -> (annotation-options)]] [flags pure mifoldable discard true])
(annotation-source [sig [(annotation) -> (source-object)]] [flags pure mifoldable discard true])
(annotation-stripped [sig [(annotation) -> (ptr)]] [flags pure mifoldable discard true])
(append! [sig [() -> (null)] [(list ... ptr) -> (ptr)]] [flags cp02])
(apropos [sig [(sub-ptr) (sub-ptr environment) -> (void)]] [flags true])
(apropos-list [sig [(sub-ptr) (sub-ptr environment) -> (list)]] [flags alloc])
(ash [sig [(sint sint) -> (sint)]] [flags arith-op mifoldable discard cp03])
(assertion-violationf [sig [(who string sub-ptr ...) -> (bottom)]] [flags abort-op]) ; 2nd arg is format string
(asinh [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(atanh [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(atom? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(bignum? [sig [(ptr) -> (boolean)]] [flags pure unrestricted cp02])
(binary-port-input-buffer [sig [(binary-input-port) -> (bytevector)]] [flags discard])
(binary-port-input-count [sig [(binary-input-port) -> (length)]] [flags discard true])
(binary-port-input-index [sig [(binary-input-port) -> (index)]] [flags discard])
(binary-port-input-size [sig [(binary-input-port) -> (length)]] [flags discard])
(binary-port-output-buffer [sig [(binary-output-port) -> (bytevector)]] [flags discard])
(binary-port-output-count [sig [(binary-output-port) -> (length)]] [flags discard true])
(binary-port-output-index [sig [(binary-output-port) -> (index)]] [flags discard])
(binary-port-output-size [sig [(binary-output-port) -> (length)]] [flags discard])
(block-read [sig [(textual-input-port string) (textual-input-port string length) -> (ptr)]] [flags true])
(block-write [sig [(textual-output-port string) (textual-output-port string length) -> (void)]] [flags true])
(box [sig [(ptr) -> (box)]] [flags unrestricted alloc])
(box? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(box-cas! [sig [(box ptr ptr) -> (boolean)]] [flags])
(box-immutable [sig [(ptr) -> (box)]] [flags unrestricted alloc])
(break [sig [(ptr ...) -> (ptr ...)]] [flags])
(bwp-object? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(bytes-allocated [sig [() -> (uint)] [(ptr) -> (uint)] [(ptr maybe-sub-symbol) -> (uint)]] [flags alloc])
(bytes-deallocated [sig [() -> (uint)]] [flags unrestricted alloc])
(bytevector [sig [(u8/s8 ...) -> (bytevector)]] [flags alloc cp02])
(bytevector->s8-list [sig [(bytevector) -> (list)]] [flags alloc])
(bytevector-truncate! [sig [(bytevector length) -> (bytevector)]] [flags true])
(bytevector->immutable-bytevector [sig [(bytevector) -> (bytevector)]] [flags alloc])
(bytevector-s24-ref [sig [(bytevector sub-index symbol) -> (s24)]] [flags true mifoldable discard])
(bytevector-s24-set! [sig [(bytevector sub-index s24 symbol) -> (void)]] [flags true])
(bytevector-s40-ref [sig [(bytevector sub-index symbol) -> (s40)]] [flags true mifoldable discard])
(bytevector-s40-set! [sig [(bytevector sub-index s40 symbol) -> (void)]] [flags true])
(bytevector-s48-ref [sig [(bytevector sub-index symbol) -> (s48)]] [flags true mifoldable discard])
(bytevector-s48-set! [sig [(bytevector sub-index s48 symbol) -> (void)]] [flags true])
(bytevector-s56-ref [sig [(bytevector sub-index symbol) -> (s56)]] [flags true mifoldable discard])
(bytevector-s56-set! [sig [(bytevector sub-index s56 symbol) -> (void)]] [flags true])
(bytevector-u24-ref [sig [(bytevector sub-index symbol) -> (u24)]] [flags true mifoldable discard])
(bytevector-u24-set! [sig [(bytevector sub-index u24 symbol) -> (void)]] [flags true])
(bytevector-u40-ref [sig [(bytevector sub-index symbol) -> (u40)]] [flags true mifoldable discard])
(bytevector-u40-set! [sig [(bytevector sub-index u40 symbol) -> (void)]] [flags true])
(bytevector-u48-ref [sig [(bytevector sub-index symbol) -> (u48)]] [flags true mifoldable discard])
(bytevector-u48-set! [sig [(bytevector sub-index u48 symbol) -> (void)]] [flags true])
(bytevector-u56-ref [sig [(bytevector sub-index symbol) -> (u56)]] [flags true mifoldable discard])
(bytevector-u56-set! [sig [(bytevector sub-index u56 symbol) -> (void)]] [flags true])
(bytevector-compress [sig [(ptr) -> (ptr)]] [flags])
(bytevector-uncompress [sig [(ptr) -> (ptr)]] [flags])
(call/1cc [sig [(procedure) -> (ptr ...)]] [flags])
(call-with-input-file [sig [(pathname procedure) (pathname procedure sub-ptr) -> (ptr ...)]] [flags ieee r5rs]) ; has options argument
(call-with-output-file [sig [(pathname procedure) (pathname procedure sub-ptr) -> (ptr ...)]] [flags ieee r5rs]) ; has options argument
(cfl* [sig [(cflonum ...) -> (cflonum)]] [flags arith-op partial-folder])
(cfl+ [sig [(cflonum ...) -> (cflonum)]] [flags arith-op partial-folder])
(cfl- [sig [(cflonum cflonum ...) -> (cflonum)]] [flags arith-op partial-folder])
(cfl/ [sig [(cflonum cflonum ...) -> (cflonum)]] [flags arith-op partial-folder])
(cfl= [sig [(cflonum cflonum ...) -> (boolean)]] [flags pure mifoldable discard])
(cfl-conjugate [sig [(cflonum) -> (cflonum)]] [flags arith-op mifoldable discard])
(cfl-imag-part [sig [(cflonum) -> (flonum)]] [flags arith-op mifoldable discard])
(cfl-magnitude-squared [sig [(cflonum) -> (flonum)]] [flags arith-op mifoldable discard])
(cfl-real-part [sig [(cflonum) -> (flonum)]] [flags arith-op mifoldable discard])
(cflonum? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(char<=? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(char<? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(char=? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard cp03]) ; not restricted to 2+ arguments
(char>=? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(char>? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(char- [sig [(char char) -> (fixnum)]] [flags pure mifoldable discard true])
(char-ci<=? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(char-ci<? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(char-ci=? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard cp03]) ; not restricted to 2+ arguments
(char-ci>=? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(char-ci>? [sig [(char char ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(char-name [sig [(sub-ptr) (sub-symbol maybe-char) -> (ptr)]] [flags])
(char-ready? [sig [() (textual-input-port) -> (boolean)]] [flags ieee r5rs])
(chmod [sig [(pathname sub-ufixnum) -> (void)]] [flags])
(clear-input-port [sig [() (input-port) -> (void)]] [flags true])
(clear-output-port [sig [() (output-port) -> (void)]] [flags true])
(collect [sig [() (sub-ufixnum) (sub-ufixnum ptr) (sub-ufixnum ptr ptr) -> (void)]] [flags true])
(collect-rendezvous [sig [() -> (void)]] [flags])
(collections [sig [() -> (uint)]] [flags unrestricted alloc])
(compile [sig [(sub-ptr) (sub-ptr environment) -> (ptr ...)]] [flags])
(compile-file [sig [(pathname) (pathname pathname) (pathname pathname sub-symbol) -> (void)]] [flags true])
(compile-library [sig [(pathname) (pathname pathname) (pathname pathname sub-symbol) -> (void)]] [flags true])
(compile-port [sig [(textual-input-port binary-output-port) (textual-input-port binary-output-port maybe-sfd) (textual-input-port binary-output-port maybe-sfd maybe-binary-output-port) (textual-input-port binary-output-port maybe-sfd maybe-binary-output-port maybe-textual-output-port) (textual-input-port binary-output-port maybe-sfd maybe-binary-output-port maybe-textual-output-port sub-symbol) (textual-input-port binary-output-port maybe-sfd maybe-binary-output-port maybe-textual-output-port sub-symbol maybe-binary-output-port) -> (void)]] [flags true])
(compile-program [sig [(pathname) (pathname pathname) (pathname pathname sub-symbol) -> (list)]] [flags true])
(compile-script [sig [(pathname) (pathname pathname) (pathname pathname sub-symbol) -> (void)]] [flags true])
(compile-time-value? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(compile-time-value-value [sig [(compile-time-value) -> (ptr)]] [flags pure mifoldable discard])
(compile-to-file [sig [(list pathname) (list pathname maybe-sfd) -> (ptr)]] [flags true])
(compile-to-port [sig [(list binary-output-port) (list binary-output-port maybe-sfd) (list binary-output-port maybe-sfd maybe-binary-output-port) (list binary-output-port maybe-sfd maybe-binary-output-port maybe-textual-output-port) (list binary-output-port maybe-sfd maybe-binary-output-port maybe-textual-output-port sub-symbol) (list binary-output-port maybe-sfd maybe-binary-output-port maybe-textual-output-port sub-symbol maybe-binary-output-port) -> (ptr)]] [flags true])
(compile-whole-program [sig [(string string) (string string ptr) -> (list)]] [flags])
(compile-whole-library [sig [(string string) -> (list)]] [flags])
(compute-composition [sig [(ptr) -> (list)] [(ptr sub-ufixnum) -> (list)]] [flags alloc])
(compute-size [sig [(ptr) -> (uint)] [(ptr sub-ufixnum) -> (uint)]] [flags alloc])
(concatenate-object-files [sig [(pathname pathname pathname ...) -> (void)]] [flags true])
(condition-broadcast [feature pthreads] [sig [(condition-object) -> (void)]] [flags true])
(condition-continuation [sig [(continuation-condition) -> (ptr)]] [flags pure mifoldable discard])
(condition-name [feature pthreads] [sig [(condition-object) -> (maybe-symbol)]] [flags pure])
(condition-signal [feature pthreads] [sig [(condition-object) -> (void)]] [flags true])
(condition-wait [feature pthreads] [sig [(condition-object mutex) (condition-object mutex maybe-timeout) -> (boolean)]] [flags])
(conjugate [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(continuation-condition? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(copy-environment [sig [(environment) (environment ptr) (environment ptr list-of-symbols) -> (environment)]] [flags alloc])
(copy-time [sig [(time) -> (time)]] [flags alloc])
(cosh [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(cost-center? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(cost-center-allocation-count [sig [(cost-center) -> (number)]] [flags mifoldable discard true])
(cost-center-instruction-count [sig [(cost-center) -> (number)]] [flags mifoldable discard true])
(cost-center-time [sig [(cost-center) -> (time)]] [flags mifoldable discard true])
(cpu-time [sig [() -> (uint)]] [flags unrestricted alloc])
(create-exception-state [sig [() (procedure) -> (void)]] [flags alloc])
(current-memory-bytes [sig [() -> (uint)]] [flags alloc])
(date-and-time [sig [() (date) -> (string)]] [flags unrestricted alloc])
(datum->syntax-object [sig [(identifier ptr) -> (ptr)]] [flags pure mifoldable discard true])
(debug [sig [() -> (void)]] [flags])
(debug-condition [sig [() -> (ptr)] [(ptr) -> (void)]] [flags unrestricted])
(decode-float [sig [(flonum) -> (vector)]] [flags pure mifoldable discard true])
(default-exception-handler [sig [(ptr) -> (void)]] [flags unrestricted])
(default-prompt-and-read [sig [(sub-integer) -> (ptr)]] [flags])
(define-top-level-syntax [sig [(symbol ptr) (symbol ptr environment) -> (void)]] [flags true])
(define-top-level-value [sig [(symbol ptr) (symbol ptr environment) -> (void)]] [flags true])
(delete-directory [sig [(pathname) (pathname ptr) -> (ptr)]] [flags])
(delete-file [sig [(pathname) (pathname ptr) -> (ptr)]] [flags])
(directory-list [sig [(pathname) -> (list)]] [flags alloc])
(directory-separator? [sig [(char) -> (boolean)]] [flags discard cp02])
(disable-interrupts [sig [() -> (uint)]] [flags true])
(display-condition [sig [(ptr) (ptr textual-output-port) -> (void)]] [flags])
(display-statistics [sig [() (textual-output-port) -> (void)]] [flags true])
(display-string [sig [(string) (string textual-output-port) -> (void)]] [flags true])
(dynamic-wind [sig [(procedure procedure procedure) (ptr procedure procedure procedure) -> (ptr ...)]] [flags ieee r5rs])
(enable-interrupts [sig [() -> (uint)]] [flags true])
(engine-block [sig [() -> (ptr)]] [flags])
(engine-return [sig [(ptr ...) -> (bottom)]] [flags abort-op])
(enumerate [sig [(list) -> (list)]] [flags alloc])
(enum-set? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(environment? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(environment-mutable? [sig [(environment) -> (boolean)]] [flags pure mifoldable discard])
(environment-symbols [sig [(environment) -> (list)]] [flags true])
(ephemeron-cons [sig [(ptr ptr) -> (ptr)]] [flags unrestricted alloc])
(ephemeron-pair? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(errorf [sig [(who string sub-ptr ...) -> (bottom)]] [flags abort-op]) ; second arg is format string
(eq-hashtable? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(eq-hashtable-cell [sig [(eq-hashtable ptr ptr) -> ((ptr . ptr))]] [flags true])
(eq-hashtable-contains? [sig [(eq-hashtable ptr) -> (boolean)]] [flags discard])
(eq-hashtable-delete! [sig [(eq-hashtable ptr) -> (void)]] [flags true])
(eq-hashtable-ephemeron? [sig [(eq-hashtable) -> (boolean)]] [flags pure mifoldable discard])
(eq-hashtable-ref [sig [(eq-hashtable ptr ptr) -> (ptr)]] [flags discard])
(eq-hashtable-set! [sig [(eq-hashtable ptr ptr) -> (void)]] [flags true])
(eq-hashtable-update! [sig [(eq-hashtable ptr procedure ptr) -> (void)]] [flags])
(eq-hashtable-weak? [sig [(eq-hashtable) -> (boolean)]] [flags pure mifoldable discard])
(eval [sig [(ptr) (ptr environment) -> (ptr ...)]] [flags]) ; not restricted to two arguments
(exit [sig [(ptr ...) -> (bottom)]] [flags abort-op]) ; not restricted to 0 or 1 argument
(expand [sig [(ptr) (ptr environment) (ptr environment ptr) (ptr environment ptr ptr) (ptr environment ptr ptr maybe-string) -> (ptr)]] [flags])
(expand/optimize [sig [(ptr) (ptr environment) -> (ptr)]] [flags])
(expt-mod [sig [(integer integer integer) -> (integer)]] [flags arith-op mifoldable discard])
(fasl-file [sig [(pathname pathname) -> (void)]] [flags true])
(fasl-read [sig [(binary-input-port) (binary-input-port sub-symbol) -> (ptr)]] [flags])
(fasl-write [sig [(sub-ptr binary-output-port) -> (void)]] [flags true])
(file-access-time [sig [(pathname) (pathname ptr) -> (time)]] [flags discard])
(file-change-time [sig [(pathname) (pathname ptr) -> (time)]] [flags discard])
(file-directory? [sig [(pathname) (pathname ptr) -> (boolean)]] [flags discard])
(file-exists? [sig [(pathname) (pathname ptr) -> (boolean)]] [flags discard])
(file-length [sig [(sub-port) -> (uint)]] [flags])
(file-modification-time [sig [(pathname) (pathname ptr) -> (time)]] [flags discard])
(file-position [sig [(sub-port) -> (sub-ptr)] [(sub-port sub-ptr) -> (void)]] [flags])
(file-port? [sig [(port) -> (boolean)]] [flags pure mifoldable discard])
(port-file-compressed! [sig [(port) -> (void)]] [flags])
(file-regular? [sig [(pathname) (pathname ptr) -> (boolean)]] [flags discard])
(file-symbolic-link? [sig [(pathname) -> (boolean)]] [flags discard])
(fllp [sig [(flonum) -> (ufixnum)]] [flags arith-op mifoldable discard])
(fl-make-rectangular [sig [(flonum flonum) -> (inexactnum)]] [flags arith-op mifoldable discard])
(flonum->fixnum [sig [(flonum) -> (fixnum)]] [flags arith-op cp02])
(flnonpositive? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(flnonnegative? [sig [(flonum) -> (boolean)]] [flags pure mifoldable discard])
(fl= [sig [(flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(fl< [sig [(flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(fl<= [sig [(flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(fl> [sig [(flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(fl>= [sig [(flonum flonum ...) -> (boolean)]] [flags pure mifoldable discard]) ; not restricted to 2+ arguments
(flush-output-port [sig [() (output-port) -> (void)]] [flags true]) ; not restricted to 1 argument
(foreign-entry? [sig [(string) -> (boolean)]] [flags discard])
(foreign-entry [sig [(string) -> (uptr)]] [flags discard true])
(foreign-address-name [sig [(uptr/iptr) -> (maybe-string)]] [flags discard])
(foreign-callable-entry-point [sig [(code) -> (uint)]] [flags discard])
(foreign-callable-code-object [sig [(sint) -> (code)]] [flags discard])
(foreign-alloc [sig [(pfixnum) -> (uint)]] [flags discard true])
(foreign-free [sig [(sub-uint) -> (void)]] [flags true])
(foreign-ref [sig [(sub-symbol uptr/iptr uptr/iptr) -> (ptr)]] [flags])
(foreign-set! [sig [(sub-symbol uptr/iptr uptr/iptr sub-ptr) -> (void)]] [flags true])
(foreign-sizeof [sig [(sub-symbol) -> (fixnum)]] [flags pure true cp02])
(fork-thread [feature pthreads] [sig [(procedure) -> (thread)]] [flags true])
(format [sig [(sub-ptr sub-ptr ...) -> (string)]] [flags])
(format-condition? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(fprintf [sig [(textual-output-port string sub-ptr ...) -> (void)]] [flags true])
(fresh-line [sig [() (textual-output-port) -> (void)]] [flags true])
(ftype-pointer=? [sig [(ftype-pointer ftype-pointer) -> (boolean)]] [flags pure mifoldable discard cp03])
(ftype-pointer-address [sig [(ftype-pointer) -> (exact-integer)]] [flags mifoldable discard true])
(ftype-pointer-ftype [sig [(ftype-pointer) -> (ptr)]] [flags mifoldable discard true])
(ftype-pointer-null? [sig [(ftype-pointer) -> (boolean)]] [flags pure mifoldable discard])
(ftype-pointer->sexpr [sig [(ftype-pointer) -> (ptr)]] [flags true])
(fx* [sig [(fixnum ...) -> (fixnum)]] [flags arith-op partial-folder]) ; not restricted to 2 arguments
(fx+ [sig [(fixnum ...) -> (fixnum)]] [flags arith-op partial-folder]) ; not restricted to 2 arguments
(fx- [sig [(fixnum fixnum ...) -> (fixnum)]] [flags arith-op partial-folder]) ; not restricted to 1 or 2 arguments
(fx/ [sig [(fixnum fixnum ...) -> (fixnum)]] [flags arith-op partial-folder]) ; not restricted to 1 or 2 arguments
(fx1+ [sig [(fixnum) -> (fixnum)]] [flags arith-op cp02])
(fx1- [sig [(fixnum) -> (fixnum)]] [flags arith-op cp02])
(fx< [sig [(fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; not restricted to 2+ arguments
(fx<= [sig [(fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; not restricted to 2+ arguments
(fx= [sig [(fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; not restricted to 2+ arguments
(fx> [sig [(fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; not restricted to 2+ arguments
(fx>= [sig [(fixnum fixnum ...) -> (boolean)]] [flags pure cp02]) ; not restricted to 2+ arguments
(fxabs [sig [(fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxlogand [sig [(fixnum ...) -> (fixnum)]] [flags arith-op partial-folder])
(fxlogbit? [sig [(ufixnum fixnum) -> (boolean)]] [flags pure cp02])
(fxlogbit0 [sig [(sub-ufixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxlogbit1 [sig [(sub-ufixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxlogior [sig [(fixnum ...) -> (fixnum)]] [flags arith-op partial-folder])
(fxlognot [sig [(fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxlogor [sig [(fixnum ...) -> (fixnum)]] [flags arith-op partial-folder])
(fxlogtest [sig [(fixnum fixnum) -> (boolean)]] [flags pure cp02])
(fxlogxor [sig [(fixnum ...) -> (fixnum)]] [flags arith-op partial-folder])
(fxmodulo [sig [(fixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxnonnegative? [sig [(fixnum) -> (boolean)]] [flags pure cp02])
(fxnonpositive? [sig [(fixnum) -> (boolean)]] [flags pure cp02])
(fxquotient [sig [(fixnum fixnum ...) -> (fixnum)]] [flags arith-op partial-folder])
(fxremainder [sig [(fixnum fixnum) -> (fixnum)]] [flags arith-op cp02])
(fxsll [sig [(fixnum sub-ufixnum) -> (fixnum)]] [flags arith-op cp02])
(fxsra [sig [(fixnum sub-ufixnum) -> (fixnum)]] [flags arith-op cp02])
(fxsrl [sig [(fixnum sub-ufixnum) -> (fixnum)]] [flags arith-op cp02])
(fxvector [sig [(fixnum ...) -> (fxvector)]] [flags alloc cp02])
(fxvector->list [sig [(fxvector) -> (list)]] [flags alloc])
(fxvector-copy [sig [(fxvector) -> (fxvector)]] [flags alloc])
(fxvector-fill! [sig [(fxvector fixnum) -> (void)]] [flags true])
(fxvector->immutable-fxvector [sig [(fxvector) -> (fxvector)]] [flags alloc])
(fxvector-length [sig [(fxvector) -> (length)]] [flags pure mifoldable discard true])
(fxvector-ref [sig [(fxvector sub-index) -> (fixnum)]] [flags mifoldable discard cp02])
(fxvector-set! [sig [(fxvector sub-index fixnum) -> (void)]] [flags true])
(fxvector? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(gensym [sig [() (string) (string string) -> (gensym)]] [flags alloc])
(gensym? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(gensym->unique-string [sig [(gensym) -> (string)]] [flags true mifoldable]) ; can't discard ... if we have our hands on it, it must be in the oblist after this
(get-bytevector-some! [sig [(binary-input-port bytevector length length) -> (ptr)]] [flags true])
(get-datum/annotations [sig [(textual-input-port sfd uint) -> (ptr uint)]] [flags])
(get-hash-table [sig [(old-hash-table ptr ptr) -> (ptr)]] [flags discard])
(get-mode [sig [(pathname) (pathname ptr) -> (fixnum)]] [flags])
(get-output-string [sig [(sub-textual-output-port) -> (string)]] [flags true])
(get-registry [feature windows] [sig [(string) -> (maybe-string)]] [flags discard])
(get-source-table! [sig [(textual-input-port source-table) (textual-input-port source-table maybe-procedure) -> (void)]] [flags true])
(get-string-some [sig [(textual-input-port) -> (ptr)]] [flags true])
(get-string-some! [sig [(textual-input-port string length length) -> (ptr)]] [flags true])
(getenv [sig [(string) -> (maybe-string)]] [flags discard])
(getprop [sig [(symbol ptr) (symbol ptr ptr) -> (ptr)]] [flags discard])
(guardian? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(hash-table? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(hashtable-ephemeron? [sig [(hashtable) -> (boolean)]] [flags pure mifoldable discard])
(hash-table-for-each [sig [(old-hash-table procedure) -> (void)]] [flags])
(hash-table-map [sig [(old-hash-table procedure) -> (list)]] [flags true])
(hashtable-cell [sig [(old-hash-table ptr ptr) -> ((ptr . ptr))]] [flags true])
(hashtable-cells [sig [(hashtable) -> (vector)] [(hashtable uint) -> (vector)]] [flags alloc])
(hashtable-entries [sig [(hashtable) -> (vector vector)] [(hashtable uint) -> (vector vector)]] [flags alloc]) ; has size argument
(hashtable-keys [sig [(hashtable) -> (vector)] [(hashtable uint) -> (vector)]] [flags alloc]) ; has size argument
(hashtable-values [sig [(hashtable) -> (vector)] [(hashtable uint) -> (vector)]] [flags alloc])
(hashtable-weak? [sig [(hashtable) -> (boolean)]] [flags pure mifoldable discard])
(iconv-codec [feature iconv] [sig [(sub-string) -> (codec)]] [flags pure true])
(ieee-environment [sig [() -> (environment)]] [flags unrestricted alloc])
(immutable-string? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(immutable-box? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(immutable-vector? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(immutable-fxvector? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(immutable-bytevector? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(initial-bytes-allocated [sig [() -> (uint)]] [flags unrestricted alloc])
(input-port-ready? [sig [(input-port) -> (boolean)]] [flags])
(inspect [sig [(ptr) -> (void)]] [flags unrestricted])
(inspect/object [sig [(ptr) -> (procedure)]] [flags unrestricted])
(integer-length [sig [(sint) -> (uint)]] [flags arith-op mifoldable discard])
(interactive? [sig [() -> (boolean)]] [flags unrestricted])
(interpret [sig [(ptr) (ptr environment) -> (ptr ...)]] [flags])
(iota [sig [(ufixnum) -> (list)]] [flags alloc])
(isqrt [sig [(uinteger) -> (integer)]] [flags arith-op mifoldable discard])
(last-pair [sig [(pair) -> ((ptr . ptr))]] [flags mifoldable discard])
(list* [sig [(ptr) -> (ptr)] [(ptr ptr ptr ...) -> ((ptr . ptr))]] [flags unrestricted discard cp02])
(list->fxvector [sig [(sub-list) -> (fxvector)]] [flags alloc])
(list-copy [sig [(list) -> (list)]] [flags alloc])
(list-head [sig [(sub-ptr sub-index) -> (ptr)]] [flags alloc])
(literal-identifier=? [sig [(identifier identifier) -> (boolean)]] [flags pure mifoldable discard cp03])
(load [sig [(pathname) (pathname procedure) -> (void)]] [flags true ieee r5rs])
(load-compiled-from-port [sig [(ptr) -> (ptr ...)]] [flags])
(load-library [sig [(pathname) (pathname procedure) -> (void)]] [flags true])
(load-program [sig [(pathname) (pathname procedure) -> (void)]] [flags true])
(load-shared-object [sig [(maybe-pathname) -> (void)]] [flags true])
(locate-source [sig [(sfd uint) (sfd uint ptr) -> ()] [(sfd uint) (sfd uint ptr) -> (string uint uint)]] [flags])
(locate-source-object-source [sig [(source-object ptr ptr) -> ()] [(source-object ptr ptr) -> (string uint uint)]] [flags])
(lock-object [sig [(ptr) -> (void)]] [flags unrestricted true])
(locked-object? [sig [(ptr) -> (boolean)]] [flags unrestricted discard])
(logand [sig [(sint ...) -> (sint)]] [flags arith-op partial-folder])
(logbit? [sig [(uint sint) -> (boolean)]] [flags pure mifoldable discard])
(logbit0 [sig [(uint sint) -> (sint)]] [flags arith-op mifoldable discard])
(logbit1 [sig [(uint sint) -> (sint)]] [flags arith-op mifoldable discard])
(logior [sig [(sint ...) -> (sint)]] [flags arith-op partial-folder])
(lognot [sig [(sint) -> (sint)]] [flags arith-op mifoldable discard])
(logor [sig [(sint ...) -> (sint)]] [flags arith-op partial-folder])
(logtest [sig [(sint sint) -> (boolean)]] [flags pure mifoldable discard])
(logxor [sig [(sint ...) -> (sint)]] [flags arith-op partial-folder])
(magnitude-squared [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(make-annotation [sig [(ptr source-object ptr) (ptr source-object ptr annotation-options) -> (annotation)]] [flags pure true mifoldable discard])
(make-boot-file [sig [(pathname sub-list pathname ...) -> (void)]] [flags true])
(make-boot-header [sig [(pathname pathname pathname ...) -> (void)]] [flags true])
(make-compile-time-value [sig [(ptr) -> (compile-time-value)]] [flags pure unrestricted alloc])
(make-condition [feature pthreads] [sig [() (maybe-symbol) -> (condition-object)]] [flags pure unrestricted alloc])
(make-continuation-condition [sig [(ptr) -> (condition)]] [flags pure unrestricted mifoldable discard])
(make-cost-center [sig [() -> (cost-center)]] [flags unrestricted alloc])
(make-source-table [sig [() -> (source-table)]] [flags unrestricted alloc])
(make-ephemeron-eq-hashtable [sig [() (uint) -> (eq-hashtable)]] [flags alloc])
(make-ephemeron-eqv-hashtable [sig [() (uint) -> (hashtable)]] [flags alloc])
(make-engine [sig [(procedure) -> (engine)]] [flags pure alloc])
(make-format-condition [sig [() -> (condition)]] [flags pure unrestricted mifoldable discard])
(make-fxvector [sig [(length) (length fixnum) -> (fxvector)]] [flags alloc])
(make-guardian [sig [() -> (procedure)]] [flags unrestricted alloc cp02])
(make-hash-table [sig [() (ptr) -> (old-hash-table)]] [flags unrestricted alloc])
(make-input-port [sig [(procedure string) -> (textual-input-port)]] [flags alloc])
(make-input/output-port [sig [(procedure string string) -> (textual-input/output-port)]] [flags alloc])
(make-list [sig [(length) (length ptr) -> (list)]] [flags alloc])
(make-mutex [feature pthreads] [sig [() (maybe-symbol) -> (mutex)]] [flags unrestricted alloc])
(make-object-finder [sig [(procedure) (procedure ptr) (procedure ptr sub-ufixnum) -> (procedure)]] [flags alloc])
(make-output-port [sig [(procedure string) -> (textual-output-port)]] [flags alloc])
(make-parameter [sig [(ptr) (ptr procedure) -> (procedure)]] [flags true cp02 cp03])
(make-record-type [sig [(sub-ptr sub-list) (maybe-rtd sub-ptr sub-list) -> (rtd)]] [flags pure alloc cp02])
(make-source-condition [sig [(ptr) -> (condition)]] [flags pure unrestricted mifoldable discard])
(make-source-file-descriptor [sig [(string binary-input-port) (string binary-input-port ptr) -> (sfd)]] [flags true])
(make-source-object [sig [(sfd uint uint) (sfd uint uint nzuint nzuint) -> (source-object)]] [flags pure true mifoldable discard])
(make-sstats [sig [(time time exact-integer exact-integer time time exact-integer) -> (sstats)]] [flags alloc])
(make-thread-parameter [feature pthreads] [sig [(ptr) (ptr procedure) -> (ptr)]] [flags true cp02 cp03])
(make-weak-eq-hashtable [sig [() (uint) -> (eq-hashtable)]] [flags alloc])
(make-weak-eqv-hashtable [sig [() (uint) -> (hashtable)]] [flags alloc])
(mark-port-closed! [sig [(port) -> (void)]] [flags true])
(maximum-memory-bytes [sig [() -> (uint)]] [flags alloc])
(maybe-compile-file [sig [(pathname) (pathname pathname) -> (void)]] [flags true])
(maybe-compile-library [sig [(pathname) (pathname pathname) -> (void)]] [flags true])
(maybe-compile-program [sig [(pathname) (pathname pathname) -> (void)]] [flags true])
(merge [sig [(procedure list list) -> (list)]] [flags true])
(merge! [sig [(procedure list list) -> (list)]] [flags true])
(mkdir [sig [(pathname) (pathname sub-uint) -> (void)]] [flags])
(multibyte->string [feature windows] [sig [(sub-ptr bytevector) -> (string)]] [flags true discard])
(mutable-box? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(mutable-string? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(mutable-fxvector? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(mutable-bytevector? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(mutable-vector? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(mutex-acquire [feature pthreads] [sig [(mutex) (mutex ptr) -> (ptr)]] [flags]) ; can return #f if optional block? arg is #f
(mutex-name [feature pthreads] [sig [(mutex) -> (maybe-symbol)]] [flags pure])
(mutex-release [feature pthreads] [sig [(mutex) -> (void)]] [flags true])
(mutex? [feature pthreads] [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(new-cafe [sig [() (procedure) -> (ptr ...)]] [flags])
(nonnegative? [sig [(real) -> (boolean)]] [flags pure mifoldable discard])
(nonpositive? [sig [(real) -> (boolean)]] [flags pure mifoldable discard])
(number->string [sig [(number) (number sub-ufixnum) (number sub-ufixnum sub-ufixnum) -> (string)]] [flags alloc]) ; radix not restricted to 2, 4, 8, 16
(object-counts [sig [() -> (ptr)]] [flags alloc])
(oblist [sig [() -> (list)]] [flags alloc])
(open-fd-input-port [sig [(sub-ufixnum) (sub-ufixnum sub-symbol) (sub-ufixnum sub-symbol maybe-transcoder) -> (input-port)]] [flags true])
(open-fd-input/output-port [sig [(sub-ufixnum) (sub-ufixnum sub-symbol) (sub-ufixnum sub-symbol maybe-transcoder) -> (input/output-port)]] [flags true])
(open-fd-output-port [sig [(sub-ufixnum) (sub-ufixnum sub-symbol) (sub-ufixnum sub-symbol maybe-transcoder) -> (output-port)]] [flags true])
(open-input-file [sig [(pathname) (pathname sub-ptr) -> (textual-input-port)]] [flags true]) ; has options argument
(open-input-output-file [sig [(pathname) (pathname sub-ptr) -> (textual-input/output-port)]] [flags true])
(open-input-string [sig [(string) -> (textual-input-port)]] [flags alloc])
(open-output-file [sig [(pathname) (pathname sub-ptr) -> (textual-output-port)]] [flags true]) ; has options argument
(open-output-string [sig [() -> (textual-output-port)]] [flags unrestricted alloc])
(open-process-ports [sig [(string) (string sub-symbol) (string sub-symbol maybe-transcoder) -> (input-port output-port output-port ufixnum)]] [flags])
(open-source-file [sig [(sfd) -> (ptr)]] [flags true])
(ormap [sig [(procedure list list ...) -> (ptr ...)]] [flags cp03])
(path-absolute? [sig [(pathname) -> (boolean)]] [flags #;cp02]) ; need cp0 handlers to fold path operators machine-independently
(path-extension [sig [(pathname) -> (pathname)]] [flags true #;cp02]) ; it's probably not worth the effort
(path-first [sig [(pathname) -> (pathname)]] [flags true #;cp02])
(path-last [sig [(pathname) -> (pathname)]] [flags true #;cp02])
(path-parent [sig [(pathname) -> (pathname)]] [flags true #;cp02])
(path-rest [sig [(pathname) -> (pathname)]] [flags true #;cp02])
(path-root [sig [(pathname) -> (pathname)]] [flags true #;cp02])
(port-bol? [sig [(textual-output-port) -> (boolean)]] [flags discard])
(port-closed? [sig [(port) -> (boolean)]] [flags discard])
(port-file-descriptor [sig [(port) -> (ufixnum)]] [flags discard])
(port-handler [sig [(port) -> (procedure)]] [flags discard])
(port-has-port-length? [sig [(port) -> (boolean)]] [flags pure mifoldable discard])
(port-has-port-nonblocking?? [sig [(port) -> (boolean)]] [flags pure mifoldable discard])
(port-has-set-port-length!? [sig [(port) -> (boolean)]] [flags pure mifoldable discard])
(port-has-set-port-nonblocking!? [sig [(port) -> (boolean)]] [flags pure mifoldable discard])
(port-input-buffer [sig [(port) -> (ptr)]] [flags discard true])
(port-input-count [sig [(port) -> (ufixnum)]] [flags discard true])
(port-input-empty? [sig [(input-port) -> (boolean)]] [flags discard])
(port-input-index [sig [(port) -> (ufixnum)]] [flags discard true])
(port-input-size [sig [(port) -> (ufixnum)]] [flags discard true])
(port-length [sig [(port) -> (uint)]] [flags])
(port-name [sig [(port) -> (ptr)]] [flags mifoldable discard])
(port-nonblocking? [sig [(port) -> (boolean)]] [flags discard])
(port-output-buffer [sig [(port) -> (ptr)]] [flags discard true])
(port-output-count [sig [(port) -> (ufixnum)]] [flags discard true])
(port-output-full? [sig [(output-port) -> (boolean)]] [flags discard])
(port-output-index [sig [(port) -> (ufixnum)]] [flags discard true])
(port-output-size [sig [(port) -> (ufixnum)]] [flags discard true])
(pretty-file [sig [(pathname pathname) -> (void)]] [flags true])
(pretty-format [sig [(symbol) -> (ptr)] [(symbol sub-ptr) -> (void)]] [flags])
(pretty-print [sig [(ptr) (ptr textual-output-port) -> (void)]] [flags true])
(printf [sig [(string sub-ptr ...) -> (void)]] [flags true])
(procedure-arity-mask [sig [(procedure) -> (sint)]] [flags mifoldable discard true])
(process [sig [(string) -> (list)]] [flags])
(profile-clear [sig [() -> (void)]] [flags true])
(profile-clear-database [sig [() -> (void)]] [flags true])
(profile-dump [sig [() -> (list)]] [flags discard true])
(profile-dump-data [sig [(pathname) (pathname sub-list) -> (void)]] [flags true])
(profile-dump-html [sig [() (pathname) (pathname sub-list) -> (void)]] [flags true])
(profile-dump-list [sig [() (ptr) (ptr sub-list) -> (list)]] [flags discard true])
(profile-load-data [sig [(pathname ...) -> (void)]] [flags true])
(profile-release-counters [sig [() -> (void)]] [flags true])
(property-list [sig [(symbol) -> (list)]] [flags discard true])
(put-bytevector-some [sig [(binary-output-port bytevector) (binary-output-port bytevector length) (binary-output-port bytevector length length) -> (uint)]] [flags true])
(put-hash-table! [sig [(old-hash-table ptr ptr) -> (void)]] [flags true])
(put-source-table [sig [(textual-output-port source-table) -> (void)]] [flags true])
(put-registry! [feature windows] [sig [(string string) -> (void)]] [flags true])
(put-string-some [sig [(textual-output-port string) (textual-output-port string length) (textual-output-port string length length) -> (uint)]] [flags true])
(putprop [sig [(symbol ptr ptr) -> (void)]] [flags true])
(putenv [sig [(string string) -> (void)]] [flags true])
(profile-query-weight [sig [(ptr) -> (maybe-flonum)]] [flags unrestricted discard])
(random [sig [(sub-number) -> (number)]] [flags alloc])
(ratnum? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(read-token [sig [() (textual-input-port) (textual-input-port sfd uint) -> (symbol ptr maybe-uint maybe-uint)]] [flags])
(real-time [sig [() -> (uint)]] [flags unrestricted alloc])
(record? [sig [(ptr) (ptr rtd) -> (boolean)]] [flags pure mifoldable discard cp02])
(record-constructor [sig [(sub-ptr) -> (procedure)]] [flags cp02]) ; accepts rtd or rcd
(record-constructor-descriptor? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard cp02])
(record-equal-procedure [sig [(record record) -> (maybe-procedure)]] [flags discard])
(record-hash-procedure [sig [(record) -> (maybe-procedure)]] [flags discard])
(record-reader [sig [(sub-ptr) -> (ptr)] [(sub-ptr sub-ptr) -> (void)]] [flags])
(record-type-equal-procedure [sig [(rtd) -> (maybe-procedure)] [(rtd maybe-procedure) -> (void)]] [flags])
(record-type-hash-procedure [sig [(rtd) -> (maybe-procedure)] [(rtd maybe-procedure) -> (void)]] [flags])
(record-writer [sig [(rtd) -> (maybe-procedure)] [(rtd maybe-procedure) -> (void)]] [flags])
(register-signal-handler [sig [(sint procedure) -> (void)]] [flags])
(remove-foreign-entry [sig [(string) -> (void)]] [flags true])
(remove-hash-table! [sig [(old-hash-table ptr) -> (void)]] [flags true])
(remove-registry! [feature windows] [sig [(string) -> (void)]] [flags true])
(remove! [sig [(ptr list) -> (list)]] [flags true])
(remprop [sig [(symbol ptr) -> (void)]] [flags])
(remq! [sig [(ptr list) -> (list)]] [flags true])
(remv! [sig [(ptr list) -> (list)]] [flags true])
(rename-file [sig [(pathname ptr) -> (void)]] [flags])
(reset [sig [() -> (bottom)]] [flags abort-op])
(reset-cost-center! [sig [(cost-center) -> (void)]] [flags true])
(reset-maximum-memory-bytes! [sig [() -> (void)]] [flags true])
(reverse! [sig [(list) -> (list)]] [flags true])
(revisit [sig [(pathname) -> (void)]] [flags true])
(revisit-compiled-from-port [sig [(ptr) -> (ptr ...)]] [flags])
(s8-list->bytevector [sig [(sub-list) -> (bytevector)]] [flags alloc])
(sc-expand [sig [(ptr) (ptr environment) (ptr environment ptr) (ptr environment ptr ptr) (ptr environment ptr ptr maybe-string) -> (ptr)]] [flags])
(scheme-environment [sig [() -> (environment)]] [flags unrestricted alloc])
(set-binary-port-input-buffer! [sig [(binary-input-port bytevector) -> (void)]] [flags true])
(set-binary-port-input-index! [sig [(binary-input-port sub-index) -> (void)]] [flags true])
(set-binary-port-input-size! [sig [(binary-input-port sub-length) -> (void)]] [flags true])
(set-binary-port-output-buffer! [sig [(binary-output-port bytevector) -> (void)]] [flags true])
(set-binary-port-output-index! [sig [(binary-output-port sub-index) -> (void)]] [flags true])
(set-binary-port-output-size! [sig [(binary-output-port sub-length) -> (void)]] [flags true])
(set-box! [sig [(box ptr) -> (void)]] [flags true])
(set-port-bol! [sig [(textual-output-port ptr) -> (void)]] [flags true])
(set-port-eof! [sig [(input-port ptr) -> (void)]] [flags true])
(set-port-input-buffer! [sig [(input-port sub-ptr) -> (void)]] [flags true])
(set-port-input-index! [sig [(input-port sub-index) -> (void)]] [flags true])
(set-port-input-size! [sig [(input-port sub-length) -> (void)]] [flags true])
(set-port-length! [sig [(sub-port uint) -> (void)]] [flags])
(set-port-name! [sig [(port ptr) -> (void)]] [flags true])
(set-port-nonblocking! [sig [(port ptr) -> (void)]] [flags])
(set-port-output-buffer! [sig [(output-port sub-ptr) -> (void)]] [flags true])
(set-port-output-index! [sig [(output-port sub-index) -> (void)]] [flags true])
(set-port-output-size! [sig [(output-port sub-length) -> (void)]] [flags true])
(set-sstats-bytes! [sig [(sstats exact-integer) -> (void)]] [flags true])
(set-sstats-cpu! [sig [(sstats time) -> (void)]] [flags true])
(set-sstats-gc-bytes! [sig [(sstats exact-integer) -> (void)]] [flags true])
(set-sstats-gc-count! [sig [(sstats exact-integer) -> (void)]] [flags true])
(set-sstats-gc-cpu! [sig [(sstats time) -> (void)]] [flags true])
(set-sstats-gc-real! [sig [(sstats time) -> (void)]] [flags true])
(set-sstats-real! [sig [(sstats time) -> (void)]] [flags true])
(set-textual-port-input-buffer! [sig [(textual-input-port string) -> (void)]] [flags true])
(set-textual-port-input-index! [sig [(textual-input-port sub-index) -> (void)]] [flags true])
(set-textual-port-input-size! [sig [(textual-input-port sub-length) -> (void)]] [flags true])
(set-textual-port-output-buffer! [sig [(textual-output-port string) -> (void)]] [flags true])
(set-textual-port-output-index! [sig [(textual-output-port sub-index) -> (void)]] [flags true])
(set-textual-port-output-size! [sig [(textual-output-port sub-length) -> (void)]] [flags true])
(set-timer [sig [(ufixnum) -> (ufixnum)]] [flags true])
(set-top-level-value! [sig [(symbol ptr) (symbol ptr environment) -> (void)]] [flags true])
(set-virtual-register! [sig [(sub-index ptr) -> (void)]] [flags true])
(sinh [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(sleep [sig [(time) -> (void)]] [flags true])
(sort [sig [(procedure list) -> (list)]] [flags true])
(sort! [sig [(procedure list) -> (list)]] [flags true])
(source-condition? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(source-condition-form [sig [(source-condition) -> (ptr)]] [flags pure mifoldable discard])
(source-file-descriptor [sig [(string uint) -> (sfd)]] [flags alloc])
(source-file-descriptor? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(source-file-descriptor-checksum [sig [(sfd) -> (ptr)]] [flags pure mifoldable discard true])
(source-file-descriptor-path [sig [(sfd) -> (ptr)]] [flags pure mifoldable discard true])
(source-object? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(source-object-bfp [sig [(source-object) -> (uint)]] [flags pure mifoldable discard])
(source-object-column [sig [(source-object) -> (ptr)]] [flags pure mifoldable discard])
(source-object-efp [sig [(source-object) -> (uint)]] [flags pure mifoldable discard])
(source-object-line [sig [(source-object) -> (ptr)]] [flags pure mifoldable discard])
(source-object-sfd [sig [(source-object) -> (sfd)]] [flags pure mifoldable discard])
(source-table? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(source-table-contains? [sig [(source-table source-object) -> (boolean)]] [flags discard])
(source-table-cell [sig [(source-table source-object ptr) -> ((ptr . ptr))]] [flags true])
(source-table-delete! [sig [(source-table source-object) -> (void)]] [flags true])
(source-table-dump [sig [(source-table) -> (list)]] [flags alloc])
(source-table-ref [sig [(source-table source-object ptr) -> (ptr)]] [flags discard])
(source-table-set! [sig [(source-table source-object ptr) -> (void)]] [flags true])
(source-table-size [sig [(source-table) -> (length)]] [flags discard true])
(sstats-bytes [sig [(sstats) -> (exact-integer)]] [flags mifoldable discard])
(sstats-cpu [sig [(sstats) -> (time)]] [flags mifoldable discard])
(sstats-difference [sig [(sstats sstats) -> (sstats)]] [flags mifoldable discard true])
(sstats-gc-bytes [sig [(sstats) -> (exact-integer)]] [flags mifoldable discard])
(sstats-gc-count [sig [(sstats) -> (exact-integer)]] [flags mifoldable discard])
(sstats-gc-cpu [sig [(sstats) -> (time)]] [flags mifoldable discard])
(sstats-gc-real [sig [(sstats) -> (time)]] [flags mifoldable discard])
(sstats-print [sig [(sstats) (sstats textual-output-port) -> (void)]] [flags true])
(sstats-real [sig [(sstats) -> (time)]] [flags mifoldable discard])
(sstats? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(standard-input-port [sig [() (sub-symbol) (sub-symbol maybe-transcoder) -> (input-port)]] [flags true])
(standard-output-port [sig [() (sub-symbol) (sub-symbol maybe-transcoder) -> (output-port)]] [flags true])
(standard-error-port [sig [() (sub-symbol) (sub-symbol maybe-transcoder) -> (output-port)]] [flags true])
(statistics [sig [() -> (sstats)]] [flags unrestricted alloc])
(string->multibyte [feature windows] [sig [(sub-ptr string) -> (bytevector)]] [flags true discard])
(string->number [sig [(string) (string sub-ufixnum) -> (maybe-number)]] [flags discard]) ; radix not restricted to 2, 4, 8, 16
(string<=? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard]) ; not restricted to 2+ arguments
(string<? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard]) ; not restricted to 2+ arguments
(string=? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard cp03]) ; not restricted to 2+ arguments
(string>=? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard]) ; not restricted to 2+ arguments
(string>? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard]) ; not restricted to 2+ arguments
(string-ci<=? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; not restricted to 2+ arguments
(string-ci<? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; not restricted to 2+ arguments
(string-ci=? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs cp03]) ; not restricted to 2+ arguments
(string-ci>=? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; not restricted to 2+ arguments
(string-ci>? [sig [(string string ...) -> (boolean)]] [flags mifoldable discard ieee r5rs]) ; not restricted to 2+ arguments
(string-copy! [sig [(string sub-length string sub-length sub-length) -> (void)]] [flags true])
(string->immutable-string [sig [(string) -> (string)]] [flags alloc])
(string-truncate! [sig [(string length) -> (string)]] [flags true])
(strip-fasl-file [sig [(pathname pathname fasl-strip-options) -> (void)]] [flags true])
(sub1 [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(subst [sig [(ptr ptr ptr) -> (ptr)]] [flags alloc])
(subst! [sig [(ptr ptr ptr) -> (ptr)]] [flags])
(substq [sig [(ptr ptr ptr) -> (ptr)]] [flags alloc])
(substq! [sig [(ptr ptr ptr) -> (ptr)]] [flags])
(substring-fill! [sig [(string sub-length sub-length char) -> (void)]] [flags true])
(substv [sig [(ptr ptr ptr) -> (ptr)]] [flags alloc])
(substv! [sig [(ptr ptr ptr) -> (ptr)]] [flags])
(symbol-hashtable? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(symbol-hashtable-cell [sig [(symbol-hashtable ptr ptr) -> ((ptr . ptr))]] [flags true])
(symbol-hashtable-contains? [sig [(symbol-hashtable ptr) -> (boolean)]] [flags discard])
(symbol-hashtable-delete! [sig [(symbol-hashtable ptr) -> (void)]] [flags true])
(symbol-hashtable-ref [sig [(symbol-hashtable symbol ptr) -> (ptr)]] [flags discard])
(symbol-hashtable-set! [sig [(symbol-hashtable symbol ptr) -> (void)]] [flags true])
(symbol-hashtable-update! [sig [(symbol-hashtable symbol procedure ptr) -> (void)]] [flags])
(syntax->annotation [sig [(ptr) -> (ptr)]] [flags pure unrestricted mifoldable discard])
(syntax->list [sig [(ptr) -> (list)]] [flags alloc])
(syntax->vector [sig [(ptr) -> (vector)]] [flags alloc])
(syntax-error [sig [(ptr string ...) -> (bottom)]] [flags abort-op])
(syntax-object->datum [sig [(ptr) -> (ptr)]] [flags pure unrestricted mifoldable discard])
(system [sig [(string) -> (ptr)]] [flags])
(tanh [sig [(number) -> (number)]] [flags arith-op mifoldable discard])
(textual-port-input-buffer [sig [(textual-input-port) -> (string)]] [flags discard])
(textual-port-input-count [sig [(textual-input-port) -> (length)]] [flags discard true])
(textual-port-input-index [sig [(textual-input-port) -> (index)]] [flags discard])
(textual-port-input-size [sig [(textual-input-port) -> (length)]] [flags discard])
(textual-port-output-buffer [sig [(textual-output-port) -> (string)]] [flags discard])
(textual-port-output-count [sig [(textual-output-port) -> (length)]] [flags discard true])
(textual-port-output-index [sig [(textual-output-port) -> (index)]] [flags discard])
(textual-port-output-size [sig [(textual-output-port) -> (length)]] [flags discard])
(thread? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(thread-condition? [feature pthreads] [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(top-level-bound? [sig [(symbol) (symbol environment) -> (boolean)]] [flags discard])
(top-level-mutable? [sig [(symbol) (symbol environment) -> (boolean)]] [flags discard])
(top-level-syntax [sig [(symbol) (symbol environment) -> (ptr)]] [flags discard])
(top-level-syntax? [sig [(symbol) (symbol environment) -> (boolean)]] [flags discard])
(top-level-value [sig [(symbol) (symbol environment) -> (ptr)]] [flags discard])
(transcoder? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(transcript-cafe [sig [(pathname) -> (ptr ...)]] [flags])
(transcript-off [sig [() -> (void)]] [flags true ieee r5rs])
(transcript-on [sig [(pathname) -> (void)]] [flags true ieee r5rs])
(truncate-file [sig [(output-port) (output-port sub-ptr) -> (void)]] [flags])
(truncate-port [sig [(output-port) (output-port sub-ptr) -> (void)]] [flags])
(unbox [sig [(box) -> (ptr)]] [flags mifoldable discard])
(unget-u8 [sig [(binary-input-port ptr) -> (void)]] [flags true])
(unget-char [sig [(textual-input-port ptr) -> (void)]] [flags true])
(unlock-object [sig [(ptr) -> (void)]] [flags unrestricted true])
(unread-char [sig [(char) (char textual-input-port) -> (void)]] [flags true])
(unregister-guardian [sig [(guardian) -> (list)]] [flags true])
(utf-16-codec [sig [() -> (codec)] [(sub-symbol) -> (codec)]] [flags pure true]) ; has optional eness argument
(utf-16le-codec [sig [() -> (codec)]] [flags pure unrestricted true])
(utf-16be-codec [sig [() -> (codec)]] [flags pure unrestricted true])
(vector-cas! [sig [(vector sub-index ptr ptr) -> (boolean)]] [flags])
(vector-copy [sig [(vector) -> (vector)]] [flags alloc])
(vector->immutable-vector [sig [(vector) -> (vector)]] [flags alloc])
(vector-set-fixnum! [sig [(vector sub-index fixnum) -> (void)]] [flags true])
(verify-loadability [sig [(sub-symbol sub-ptr ...) -> (void)]] [flags true])
(virtual-register [sig [(sub-index) -> (ptr)]] [flags discard])
(virtual-register-count [sig [() -> (length)]] [flags pure unrestricted true cp02])
(visit [sig [(pathname) -> (void)]] [flags true])
(visit-compiled-from-port [sig [(ptr) -> (ptr ...)]] [flags])
(void [sig [() -> (void)]] [flags pure unrestricted mifoldable discard true])
(warning [sig [(who string sub-ptr ...) -> (ptr ...)]] [flags])
(warningf [sig [(who string sub-ptr ...) -> (ptr ...)]] [flags])
(weak-cons [sig [(ptr ptr) -> (ptr)]] [flags unrestricted alloc])
(weak-pair? [sig [(ptr) -> (boolean)]] [flags pure unrestricted mifoldable discard])
(with-cost-center [sig [(cost-center procedure) (ptr cost-center procedure) -> (ptr ...)]] [flags])
(with-input-from-file [sig [(pathname procedure) (pathname procedure sub-ptr) -> (ptr ...)]] [flags]) ; has options argument
(with-input-from-string [sig [(string procedure) -> (ptr ...)]] [flags])
(with-output-to-file [sig [(pathname procedure) (pathname procedure sub-ptr) -> (ptr ...)]] [flags]) ; has options argument
(with-output-to-string [sig [(procedure) -> (string)]] [flags])
(with-profile-tracker [sig [(procedure) (ptr procedure) -> (ptr ptr ...)]] [flags])
(with-source-path [sig [(who pathname procedure) -> (ptr ...)]] [flags])
)
(define-symbol-flags* ([libraries] [flags system proc]) ; system procedures
($address-in-heap? [flags])
($address->object [flags])
($allocate-thread-parameter [feature pthreads] [flags alloc])
($apply [flags])
($assembly-output [flags])
($as-time-goes-by [flags])
($bignum-length [flags pure true])
($bigpositive? [flags])
($breakhere [flags])
($build-install-library/ct-code [flags])
($build-install-library/rt-code [flags])
($build-invoke-program [flags])
($byte-copy! [flags])
($bytevector-compress [flags])
($bytevector-ref-check? [flags])
($bytevector-set!-check? [flags])
($bytevector-set! [flags])
($bytevector-set-immutable! #;[sig [(bytevector) -> (ptr)]] [flags true])
($bytevector-uncompress [flags])
($capture-fasl-target [flags])
($c-error [flags])
($check-heap-errors [flags])
($clear-dynamic-closure-counts [flags]) ; added for closure instrumentation
($clear-pass-stats [flags])
($clear-source-lines-cache [flags])
($close-files [flags])
($close-resurrected-files [flags])
($close-resurrected-mutexes&conditions [feature pthreads] [flags])
($closure-code [flags])
($closure-length [flags])
($closure-ref [flags])
($c-make-closure [flags])
($c-make-code [flags])
($code? [flags])
($code-free-count [flags])
($code-info [flags])
($code-arity-mask [flags])
($code-name [flags])
($code-pinfo* [flags])
($collect-rendezvous [flags])
($compile-backend [flags])
($compiled-file-header? [flags])
($compile-host-library [flags])
($compound-condition-components [flags discard true])
($compound-condition? [flags pure unrestricted mifoldable discard])
($compressed-warning [flags])
($compute-composition [flags])
($compute-size [flags])
($constituent? [flags])
($constituent-ports [flags])
($continuation? [flags])
($continuation-link [flags])
($continuation-return-code [flags])
($continuation-return-livemask [flags])
($continuation-return-offset [flags])
($continuation-stack-clength [flags])
($continuation-stack-length [flags])
($continuation-stack-ref [flags])
($continuation-winders [flags])
($cp0 [flags])
($cpcheck [flags])
($cpcheck-prelex-flags [flags])
($cpcommonize [flags])
($cpletrec [flags])
($cpvalid [flags])
($c-stlv! [flags])
($cte-optimization-info [flags])
($c-tlv [flags])
($current-stack-link [flags])
($current-winders [flags])
($dequeue-scheme-signals [flags])
($distinct-bound-ids? [flags])
($dofmt [flags])
($do-wind [flags])
($dynamic-closure-counts [flags alloc]) ; added for closure instrumentation
($enum-set-members [flags])
($eol-style? [flags])
($eq-hashtable-cells [flags discard])
($eq-hashtable-clear! [flags true])
($eq-hashtable-copy [flags true discard])
($eq-hashtable-entries [flags discard])
($eq-hashtable-keys [flags true discard])
($eq-hashtable-values [flags true discard])
($errno [flags])
($errno->string [flags])
($error-handling-mode? [flags])
($event [flags])
($exactnum? [flags])
($exactnum-imag-part [flags])
($exactnum-real-part [flags])
($expand/cte/optimize #;[sig [(ptr) (ptr environment) -> (ptr)]] [flags])
($expand/cte #;[sig [(ptr) (ptr environment) -> (ptr)]] [flags])
($expand-fp-ftype [flags])
($expeditor [feature expeditor] [flags])
($fasl-base-rtd [flags])
($fasl-bld-graph [flags])
($fasl-enter [flags])
($fasl-file-equal? #;[sig [(pathname pathname) (pathname pathname ptr) -> (boolean)]] [flags])
($fasl-out [flags])
($fasl-start [flags])
($fasl-table [flags])
($fasl-wrf-graph [flags])
($filter-conv [flags])
($filter-foreign-type [flags])
($fixed-path? [flags])
($<= [flags])
($< [flags])
($= [flags])
($- [flags])
($/ [flags])
($* [flags])
($+ [flags])
($fleqv? [flags])
($flhash [flags])
($flonum->digits [flags])
($flonum-exponent [flags])
($flonum->fixnum [flags])
($flonum-sign [flags])
($flush-instruction-cache [flags])
($foreign-char? [flags pure unrestricted mifoldable discard])
($foreign-entries [flags])
($foreign-entry [flags discard])
($foreign-wchar? [flags pure unrestricted cp02])
($format-scheme-version [flags alloc])
($fp-filter-type [flags])
($fp-string->utf16 [flags])
($fp-string->utf32 [flags])
($fp-string->utf8 [flags])
($fptr-fptr-ref [flags discard])
($fptr-fptr-set! [flags])
($fptr-init-lock! [flags])
($fptr-locked-decr! [flags])
($fptr-locked-incr! [flags])
($fptr-lock! [flags])
($fptr-offset-addr [flags])
($fptr-ref-bits [flags discard])
($fptr-ref-boolean [flags discard])
($fptr-ref-char [flags discard])
($fptr-ref-double-float [flags discard])
($fptr-ref-fixnum [flags discard])
($fptr-&ref [flags discard])
($fptr-ref [flags discard])
($fptr-ref-ibits-swap-unsigned-16 [flags discard])
($fptr-ref-ibits-swap-unsigned-24 [flags discard])
($fptr-ref-ibits-swap-unsigned-32 [flags discard])
($fptr-ref-ibits-swap-unsigned-40 [flags discard])
($fptr-ref-ibits-swap-unsigned-48 [flags discard])
($fptr-ref-ibits-swap-unsigned-56 [flags discard])
($fptr-ref-ibits-swap-unsigned-64 [flags discard])
($fptr-ref-ibits-unsigned-16 [flags discard])
($fptr-ref-ibits-unsigned-24 [flags discard])
($fptr-ref-ibits-unsigned-32 [flags discard])
($fptr-ref-ibits-unsigned-40 [flags discard])
($fptr-ref-ibits-unsigned-48 [flags discard])
($fptr-ref-ibits-unsigned-56 [flags discard])
($fptr-ref-ibits-unsigned-64 [flags discard])
($fptr-ref-ibits-unsigned-8 [flags discard])
($fptr-ref-integer-16 [flags discard])
($fptr-ref-integer-24 [flags discard])
($fptr-ref-integer-32 [flags discard])
($fptr-ref-integer-40 [flags discard])
($fptr-ref-integer-48 [flags discard])
($fptr-ref-integer-56 [flags discard])
($fptr-ref-integer-64 [flags discard])
($fptr-ref-integer-8 [flags discard])
($fptr-ref-single-float [flags discard])
($fptr-ref-swap-boolean [flags discard])
($fptr-ref-swap-double-float [flags discard])
($fptr-ref-swap-fixnum [flags discard])
($fptr-ref-swap-integer-16 [flags discard])
($fptr-ref-swap-integer-24 [flags discard])
($fptr-ref-swap-integer-32 [flags discard])
($fptr-ref-swap-integer-40 [flags discard])
($fptr-ref-swap-integer-48 [flags discard])
($fptr-ref-swap-integer-56 [flags discard])
($fptr-ref-swap-integer-64 [flags discard])
($fptr-ref-swap-single-float [flags discard])
($fptr-ref-swap-unsigned-16 [flags discard])
($fptr-ref-swap-unsigned-24 [flags discard])
($fptr-ref-swap-unsigned-32 [flags discard])
($fptr-ref-swap-unsigned-40 [flags discard])
($fptr-ref-swap-unsigned-48 [flags discard])
($fptr-ref-swap-unsigned-56 [flags discard])
($fptr-ref-swap-unsigned-64 [flags discard])
($fptr-ref-swap-wchar [flags discard])
($fptr-ref-ubits-swap-unsigned-16 [flags discard])
($fptr-ref-ubits-swap-unsigned-24 [flags discard])
($fptr-ref-ubits-swap-unsigned-32 [flags discard])
($fptr-ref-ubits-swap-unsigned-40 [flags discard])
($fptr-ref-ubits-swap-unsigned-48 [flags discard])
($fptr-ref-ubits-swap-unsigned-56 [flags discard])
($fptr-ref-ubits-swap-unsigned-64 [flags discard])
($fptr-ref-ubits-unsigned-16 [flags discard])
($fptr-ref-ubits-unsigned-24 [flags discard])
($fptr-ref-ubits-unsigned-32 [flags discard])
($fptr-ref-ubits-unsigned-40 [flags discard])
($fptr-ref-ubits-unsigned-48 [flags discard])
($fptr-ref-ubits-unsigned-56 [flags discard])
($fptr-ref-ubits-unsigned-64 [flags discard])
($fptr-ref-ubits-unsigned-8 [flags discard])
($fptr-ref-unsigned-16 [flags discard])
($fptr-ref-unsigned-24 [flags discard])
($fptr-ref-unsigned-32 [flags discard])
($fptr-ref-unsigned-40 [flags discard])
($fptr-ref-unsigned-48 [flags discard])
($fptr-ref-unsigned-56 [flags discard])
($fptr-ref-unsigned-64 [flags discard])
($fptr-ref-unsigned-8 [flags discard])
($fptr-ref-wchar [flags discard])
($fptr-set-bits! [flags])
($fptr-set-bits-swap-unsigned-16! [flags])
($fptr-set-bits-swap-unsigned-24! [flags])
($fptr-set-bits-swap-unsigned-32! [flags])
($fptr-set-bits-swap-unsigned-40! [flags])
($fptr-set-bits-swap-unsigned-48! [flags])
($fptr-set-bits-swap-unsigned-56! [flags])
($fptr-set-bits-swap-unsigned-64! [flags])
($fptr-set-bits-unsigned-16! [flags])
($fptr-set-bits-unsigned-24! [flags])
($fptr-set-bits-unsigned-32! [flags])
($fptr-set-bits-unsigned-40! [flags])
($fptr-set-bits-unsigned-48! [flags])
($fptr-set-bits-unsigned-56! [flags])
($fptr-set-bits-unsigned-64! [flags])
($fptr-set-bits-unsigned-8! [flags])
($fptr-set-boolean! [flags])
($fptr-set-char! [flags])
($fptr-set-double-float! [flags])
($fptr-set-fixnum! [flags])
($fptr-set! [flags])
($fptr-set-integer-16! [flags])
($fptr-set-integer-24! [flags])
($fptr-set-integer-32! [flags])
($fptr-set-integer-40! [flags])
($fptr-set-integer-48! [flags])
($fptr-set-integer-56! [flags])
($fptr-set-integer-64! [flags])
($fptr-set-integer-8! [flags])
($fptr-set-single-float! [flags])
($fptr-set-swap-boolean! [flags])
($fptr-set-swap-double-float! [flags])
($fptr-set-swap-fixnum! [flags])
($fptr-set-swap-integer-16! [flags])
($fptr-set-swap-integer-24! [flags])
($fptr-set-swap-integer-32! [flags])
($fptr-set-swap-integer-40! [flags])
($fptr-set-swap-integer-48! [flags])
($fptr-set-swap-integer-56! [flags])
($fptr-set-swap-integer-64! [flags])
($fptr-set-swap-single-float! [flags])
($fptr-set-swap-unsigned-16! [flags])
($fptr-set-swap-unsigned-24! [flags])
($fptr-set-swap-unsigned-32! [flags])
($fptr-set-swap-unsigned-40! [flags])
($fptr-set-swap-unsigned-48! [flags])
($fptr-set-swap-unsigned-56! [flags])
($fptr-set-swap-unsigned-64! [flags])
($fptr-set-swap-wchar! [flags])
($fptr-set-unsigned-16! [flags])
($fptr-set-unsigned-24! [flags])
($fptr-set-unsigned-32! [flags])
($fptr-set-unsigned-40! [flags])
($fptr-set-unsigned-48! [flags])
($fptr-set-unsigned-56! [flags])
($fptr-set-unsigned-64! [flags])
($fptr-set-unsigned-8! [flags])
($fptr-set-wchar! [flags])
($fptr-spin-lock! [flags])
($fptr-unlock! [flags])
($fp-type->pred [flags])
($ftd? [flags])
($ftd-alignment [flags])
($ftd-as-box? [flags])
($ftd-atomic-category [flags])
($ftd-compound? [flags])
($ftd-size [flags])
($ftd-unsigned? [flags])
($ftd->members [flags])
($ftype-guardian-oops [flags])
($ftype-pointer? [flags])
($fxaddress [flags unrestricted alloc])
($fx-? [flags])
($fx/ [flags])
($fx* [flags])
($fx+? [flags])
($fxu< [flags pure cp02])
($fxvector-ref-check? [flags])
($fxvector-set!-check? [flags])
($fxvector-set-immutable! #;[sig [(fxvector) -> (ptr)]] [flags true])
($gc-cpu-time [flags true])
($gc-real-time [flags true])
($gensym->pretty-name [flags])
($guard [flags])
($hand-coded [flags])
($hashtable-report [flags true])
($hashtable-size->minlen [flags])
($hashtable-veclen [flags discard])
($ht-minlen [flags discard])
($ht-veclen [flags discard])
($immediate? [flags])
($impoops [flags abort-op])
($import-library [flags])
($inexactnum? [flags])
($inexactnum-imag-part [flags])
($inexactnum-real-part [flags])
($insert-profile-src! [flags])
($install-ftype-guardian [flags])
($install-guardian [flags])
($install-library-clo-info [flags])
($install-library/ct-code [flags])
($install-library/ct-desc [flags])
($install-library-entry [flags])
($install-library/rt-code [flags])
($install-library/rt-desc [flags])
($install-program-desc [flags])
($instantiate-code-object [flags])
($integer-16? [flags pure unrestricted mifoldable discard])
($integer-24? [flags pure unrestricted mifoldable discard])
($integer-32? [flags pure unrestricted mifoldable discard])
($integer-40? [flags pure unrestricted mifoldable discard])
($integer-48? [flags pure unrestricted mifoldable discard])
($integer-56? [flags pure unrestricted mifoldable discard])
($integer-64? [flags pure unrestricted mifoldable discard])
($integer-8? [flags pure unrestricted mifoldable discard])
($intern2 [flags])
($intern3 [flags])
($intern-gensym [flags])
($interpret-backend [flags])
($invalid-ftype-index [flags])
($invoke-library [flags])
($invoke-program [flags])
($io-init [flags])
($keep-live [flags])
($last-new-vector-element [flags])
($lexical-error [flags])
($library-search [flags])
($list-length [flags])
($load-library [flags])
($locate-source [flags])
($logand [flags])
($logbit0 [flags])
($logbit1 [flags])
($logbit? [flags])
($lognot [flags])
($logor [flags])
($logtest [flags])
($logxor [flags])
($lookup-library-entry [flags])
($loop-unroll-limit [flags])
($make-annotation-options [flags pure discard true])
($make-base-modules [flags])
($make-binary-input/output-port #;[sig [(string port-handler bytevector bytevector) (string port-handler bytevector bytevector ptr) -> (binary-input/output-port)]] [flags alloc])
($make-binary-input-port #;[sig [(string port-handler bytevector) (string port-handler bytevector ptr) -> (binary-input-port)]] [flags alloc])
($make-binary-output-port #;[sig [(string port-handler bytevector) (string port-handler bytevector ptr) -> (binary-output-port)]] [flags alloc])
($make-boot-file [flags])
($make-boot-header [flags])
($make-cinst [flags])
($make-closure [flags])
($make-code-object [flags])
($make-environment [flags])
($make-eq-hashtable [flags alloc])
($make-eqhash-vector [flags alloc])
($make-exactnum [flags])
($make-fasl-strip-options [flags pure discard true])
($make-file-options [flags pure discard true])
($make-fmt->expr [flags])
($make-foreign-callable [flags])
($make-foreign-procedure [flags])
($make-fptr [flags pure mifoldable discard true])
($make-ftype-guardian [flags alloc cp02])
($make-graph-env [flags])
($make-library-requirements-options [flags pure discard true])
($make-load-binary [flags])
($make-object-finder [flags])
($make-promise [flags alloc])
($make-read [flags])
($make-recompile-condition [flags])
($make-record-constructor-descriptor [flags pure true cp02])
($make-record-type-descriptor [flags pure alloc cp02])
($make-record-type #;[sig [(rtd maybe-rtd sub-ptr sub-list ptr ptr ptr ...) -> (rtd)]] [flags pure alloc cp02])
($make-relocation-table! [flags])
($make-rnrs-libraries [flags])
($make-source-oops [flags])
($make-src-condition [flags])
($make-textual-input/output-port #;[sig [(string port-handler string string) (string port-handler string string ptr) -> (textual-input/output-port)]] [flags alloc])
($make-textual-input-port #;[sig [(string port-handler string) (string port-handler string ptr) -> (textual-input-port)]] [flags alloc])
($make-textual-output-port #;[sig [(string port-handler string) (string port-handler string ptr) -> (textual-output-port)]] [flags alloc])
($make-tlc [flags alloc])
($make-vtable [flags])
($map [flags])
($mark-invoked! [flags])
($mark-pending! [flags])
($maybe-compile-file [flags])
($noexpand? [flags])
($np-boot-code [flags])
($np-compile [flags])
($np-get-timers [flags])
($np-last-pass [flags])
($np-reset-timers! [flags])
($np-tracer [flags])
($null-continuation [flags])
($object-address [flags])
($object-in-heap? [flags])
($object-ref [flags]) ; can't fold since optimize-level 2 version does no checks
($object-set! [flags])
($oops/c [flags abort-op])
($oops [flags abort-op])
($open-bytevector-list-output-port [flags])
($open-file-input/output-port [flags])
($open-file-input-port [flags])
($open-file-output-port [flags])
($open-source-file [flags])
($parse-format-string [flags])
($pass-stats-fields [flags])
($pass-stats [flags])
($pass-time [flags])
($port-flags-set? [flags])
($port-handler [flags])
($port-info #;[sig [(port) -> (ptr)]] [flags discard])
($print-pass-stats [flags])
($procedure-name [flags])
($profile-block-data? [flags])
($profile-show-database [flags])
($profile-source-data? [flags])
($ptr-copy! [flags])
($quotient-remainder [flags])
($ratio-denominator [flags])
($ratio-numerator [flags])
($raw-collect-cond [feature pthreads] [flags])
($raw-tc-mutex [feature pthreads] [flags])
($read-performance-monitoring-counter [flags])
($read-time-stamp-counter [flags])
($real->flonum [flags arith-op mifoldable discard])
($real-sym-name [flags])
($recompile-condition? [flags])
($recompile-importer-path [flags])
($record [flags cp02 unrestricted alloc]) ; first arg should be an rtd, but we don't check
($record? [flags pure mifoldable discard])
($record-equal-procedure [flags discard])
($record-hash-procedure [flags discard])
($record-oops #;[sig [(who sub-ptr rtd) -> (bottom)]] [flags abort-op])
($record-type-descriptor [flags pure mifoldable discard true])
($record-type-field-offsets [flags pure mifoldable discard true])
($reloc [flags])
($remake-rtd [flags])
($report-string [flags])
($require-include [flags])
($require-libraries [flags])
($reset-port-flags! [flags true])
($reset-protect [flags])
($revisit [flags])
($rtd-counts? [flags])
($scheme [flags])
($scheme-greeting [flags])
($scheme-init [flags])
($sc-put-cte [flags])
($sc-put-property! [flags])
($script [flags])
($sealed-record? [flags pure mifoldable discard])
($set-code-byte! [flags])
($set-code-long! [flags])
($set-code-quad! [flags])
($set-code-word! [flags])
($set-collect-trip-bytes [flags])
($set-port-flags! [flags true])
($set-port-info! #;[sig [(port ptr) -> (void)]] [flags true])
($set-symbol-hash! [flags])
($set-symbol-name! [flags])
($set-symbol-property-list! [flags])
($set-system-property-list! [flags])
($set-thread-parameter! [feature pthreads] [flags])
($set-timer [flags])
($set-tlc-next! [flags true])
($set-top-level-value! [flags true cp02])
($sgetprop [flags])
($show-allocation [flags])
($signal-interrupt-handler [flags])
($source-file-descriptor [flags])
($source-violation [flags])
($source-warning [flags])
($spaces [flags])
($split-continuation [flags])
($sputprop [flags])
($src-condition? [flags])
($src-condition-src [flags])
($src-condition-start [flags])
($sremprop [flags])
($string-char-foldcase [flags])
($string-ref-check? [flags])
($string-set!-check? [flags])
($string-set-immutable! #;[sig [(string) -> (ptr)]] [flags true])
($str->num [flags])
($subsequent? [flags])
($swap-object-ref [flags]) ; can't fold since optimize-level 2 version does no checks
($symbol-hash [flags])
($symbol-name [flags])
($symbol-property-list [flags])
($symbol-type [flags])
($syntax-dispatch [flags])
($syntax-match? [flags])
($syntax->src [flags])
($syntax-top-level? [flags])
($system-code? [flags])
($system-environment [flags])
($system-library? [flags])
($system-procedure? [flags])
($system-property-list [flags])
($tc-field [flags])
($tc [flags])
($thread-list [flags])
($thread-tc [flags])
($tlc? [flags pure unrestricted mifoldable discard])
($tlc-ht [flags mifoldable discard])
($tlc-keyval [flags pure mifoldable discard])
($tlc-next [flags mifoldable discard])
($top-level-bound? [flags discard])
($top-level-value [flags discard cp02])
($trace-closure [flags pure alloc])
($trace [flags])
($track-dynamic-closure-counts [flags]) ; added for closure instrumentation
($track-static-closure-counts [flags alloc]) ; added for closure instrumentation
($trans-define-ftype [flags])
($transformer->binding [flags])
($trans-ftype-guardian [flags])
($trans-ftype-locked-op! [flags])
($trans-ftype-pointer? [flags])
($trans-ftype-&ref [flags])
($trans-ftype-ref [flags])
($trans-ftype-set! [flags])
($trans-ftype-sizeof [flags])
($trans-make-ftype-pointer [flags])
($unbound-object? [flags pure unrestricted mifoldable discard])
($unbound-object [flags pure unrestricted mifoldable discard true])
($uncprep [flags]) ; side-effects preinfo-sexpr, at least
($undefined-violation [flags abort-op])
($untrace [flags])
($unwrap-ftype-pointer [flags])
($vector-ref-check? [flags])
($vector-set!-check? [flags])
($vector-set-immutable! #;[sig [(vector) -> (ptr)]] [flags true])
($verify-ftype-address [flags cp02])
($verify-ftype-pointer [flags])
($visit [flags])
($visit-library [flags])
($with-fasl-target [flags])
($write-pretty-quick [flags])
($xscript-port? [flags])
)
(define-symbol-flags* ([libraries] [flags system]) ; system options sets
($annotation-options [flags])
($fasl-strip-options [flags])
($file-options [flags])
($library-requirements-options [flags])
)
(define-symbol-flags* ([libraries] [flags system proc]) ; system parameters
($block-counter [flags])
($cafe [flags])
($compile-profile [flags])
($cp0-inner-unroll-limit #;[sig [() -> (ufixnum)] [(ufixnum) -> (void)]] [flags])
($cp0-polyvariant #;[sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
($current-mso [flags])
($enable-check-heap [flags])
($enable-check-prelex-flags [flags])
($enable-expeditor [feature expeditor] [flags])
($enable-pass-timing [flags])
($expeditor-history-file [feature expeditor] [flags])
($fasl-target [flags])
($optimize-closures #;[sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
($suppress-primitive-inlining #;[sig [() -> (boolean)] [(ptr) -> (void)]] [flags unrestricted])
($sfd [flags])
($target-machine [flags])
)
(define-symbol-flags* ([libraries] [flags system]) ; system state variables
($active-threads [flags])
($c-bufsiz [flags])
($collect-cond [feature pthreads] [flags])
($collect-request-pending [flags])
($compiler-is-loaded? [flags])
($console-error-port [flags])
($console-input-port [flags])
($console-output-port [flags])
($eq-ht-rtd [flags])
($heap-reserve-ratio [flags])
($interrupt [flags])
($nuate [flags])
($scheme-version [flags])
($session-key [flags])
($symbol-ht-rtd [flags])
($tc-mutex [feature pthreads] [flags])
)
(define-symbol-flags* ([libraries] [flags system-keyword]) ; condition types
($&src [flags])
($&recompile [flags])
)
(define-symbol-flags* ([libraries] [flags system-keyword])
($case [flags])
($chezscheme-csv7 [flags library-uid])
($cost-center [flags])
($foreign-callable [flags])
($foreign-procedure [flags])
($import [flags])
($library [flags])
($module [flags])
($moi [flags])
($program [flags])
($rnrs [flags library-uid])
($rnrs-arithmetic-bitwise [flags library-uid])
($rnrs-arithmetic-fixnums [flags library-uid])
($rnrs-arithmetic-flonums [flags library-uid])
($rnrs-base [flags library-uid])
($rnrs-bytevectors [flags library-uid])
($rnrs-conditions [flags library-uid])
($rnrs-control [flags library-uid])
($rnrs-enums [flags library-uid])
($rnrs-eval [flags library-uid])
($rnrs-exceptions [flags library-uid])
($rnrs-files [flags library-uid])
($rnrs-hashtables [flags library-uid])
($rnrs-io-ports [flags library-uid])
($rnrs-io-simple [flags library-uid])
($rnrs-lists [flags library-uid])
($rnrs-mutable-pairs [flags library-uid])
($rnrs-mutable-strings [flags library-uid])
($rnrs-programs [flags library-uid])
($rnrs-r5rs [flags library-uid])
($rnrs-records-procedural [flags library-uid])
($rnrs-records-syntactic [flags library-uid])
($rnrs-records-inspection [flags library-uid])
($rnrs-sorting [flags library-uid])
($rnrs-syntax-case [flags library-uid])
($rnrs-unicode [flags library-uid])
)
| true |
74eb26afde94ec7fa7266cbb6fafc0e180b37190
|
defeada37d39bca09ef76f66f38683754c0a6aa0
|
/System.Xml/system/xml/serialization/xml-code-exporter.sls
|
f42142a2dc4ad7fefd3e5ba5011c91974b5db038
|
[] |
no_license
|
futsuki/ironscheme-port
|
2dbac82c0bda4f4ff509208f7f00a5211d1f7cd5
|
4e7a81b0fbeac9a47440464988e53fb118286c54
|
refs/heads/master
| 2016-09-06T17:13:11.462593 | 2015-09-26T18:20:40 | 2015-09-26T18:20:40 | 42,757,369 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,467 |
sls
|
xml-code-exporter.sls
|
(library (system xml serialization xml-code-exporter)
(export new
is?
xml-code-exporter?
export-type-mapping
export-members-mapping
add-mapping-metadata)
(import (ironscheme-clr-port))
(define-syntax new
(lambda (e)
(syntax-case e ()
((_ a ...)
#'(clr-new System.Xml.Serialization.XmlCodeExporter a ...)))))
(define (is? a) (clr-is System.Xml.Serialization.XmlCodeExporter a))
(define (xml-code-exporter? a)
(clr-is System.Xml.Serialization.XmlCodeExporter a))
(define-method-port
export-type-mapping
System.Xml.Serialization.XmlCodeExporter
ExportTypeMapping
(System.Void System.Xml.Serialization.XmlTypeMapping))
(define-method-port
export-members-mapping
System.Xml.Serialization.XmlCodeExporter
ExportMembersMapping
(System.Void System.Xml.Serialization.XmlMembersMapping))
(define-method-port
add-mapping-metadata
System.Xml.Serialization.XmlCodeExporter
AddMappingMetadata
(System.Void
System.CodeDom.CodeAttributeDeclarationCollection
System.Xml.Serialization.XmlMemberMapping
System.String
System.Boolean)
(System.Void
System.CodeDom.CodeAttributeDeclarationCollection
System.Xml.Serialization.XmlTypeMapping
System.String)
(System.Void
System.CodeDom.CodeAttributeDeclarationCollection
System.Xml.Serialization.XmlMemberMapping
System.String)))
| true |
e737f4d1cc9cb2b62c91e41546a145e8133be7d8
|
f3a198b0cdabddfbb9bceb31598c417163ad7d34
|
/bsp/lib.scm
|
7604cc991112e7ee449aa667cdfbfcf7d5d17217
|
[] |
no_license
|
rschifflin/bsp
|
ec0ee921c2cb60e9334826ebb95d4272ba792382
|
88261c5b4645e10631c099ea7dcd02c520f5829f
|
refs/heads/main
| 2023-08-19T02:27:04.326714 | 2021-09-25T23:21:24 | 2021-09-25T23:21:24 | 410,402,416 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 19,044 |
scm
|
lib.scm
|
;;; BSP accepts as input a list of 3d points and an index list of polygons, with the normals rising from the 'counter-clockface'
;;; Step 0: Parsing
;;; Should be able to parse the points as a list of 3-element lists
;;; Returns vertices . faces
;;; A vertex is a 3d point
;;; A face is a planar convex polygon composed of vertex indices
(define-module (bsp lib)
#:use-module (srfi srfi-1)
#:use-module (srfi srfi-26)
#:use-module (ice-9 receive)
#:use-module (bsp sewer list)
#:use-module (bsp sewer plist)
#:use-module (bsp sewer tree)
#:use-module (bsp sewer display)
#:use-module (bsp geo consts)
#:use-module (bsp geo plane)
#:use-module (bsp geo face)
#:use-module (bsp geo poly)
#:use-module (bsp geo vec3)
#:export (make-bsp
add-bsp-portals!
mark-inside!
bsp-leafs
bsp-solids
bsp-portals
bsp-+solids
bsp-+portals))
;;; Choose from a working-set a polygon-face to define the splitting plane
(define (choose-splitting-face working-set)
(car working-set))
;; Partition polys based on how they split
(define (partition-splits splitting-plane polys,splits)
;;; Returns four values, +split, -split, +=split, -=split
;;; += and -= indicate the split is planar, but aligned with the plane normal in +=, and opposite in -=
(define (partition-split poly,split)
(let ((poly (car poly,split))
(split (cadr poly,split)))
(cond [(poly-split? split) (values (poly-+split split) (poly--split split) #f #f)]
;; Otherwise unsplit
[(eq? '+ (poly-non-split-sign split)) (values poly #f #f #f)]
[(eq? '- (poly-non-split-sign split)) (values #f poly #f #f)]
[(eq? '= (poly-non-split-sign split))
;; Determine +/- value based on normal alignment
(if (> (v3:dot (plane-normal splitting-plane) (plane-normal (poly->plane poly)))
0)
(values #f #f poly #f)
(values #f #f #f poly))])))
(let self ((polys,splits polys,splits) (+splits '()) (-splits '()) (+=splits '()) (-=splits '()))
(if (null? polys,splits)
(values +splits -splits +=splits -=splits)
(receive (+split -split +=split -=split)
(partition-split (car polys,splits))
(self (cdr polys,splits)
(if +split (cons +split +splits) +splits)
(if -split (cons -split -splits) -splits)
(if +=split (cons +=split +=splits) +=splits)
(if -=split (cons -=split -=splits) -=splits))))))
;; A bsp combines a spatial lookup tree and an indexed lookup vector
(define (make-bsp faces)
(define (make-bsp-tree ;; Returns a pair of size,tree where branches represent splitplanes, and leaves hold indices into a vector of leaf data
candidate-faces ;; List of faces which haven't been chosen as splitplanes yet
applied-faces ;; List of faces already chosen as splitplanes before
index ;; Counter representing existing number of leaves
leaf-list) ;; List holding leaf data in index order
(if (null? candidate-faces)
(list 'index (+ index 1)
'tree (make-tree index)
'list (cons (list 'solids applied-faces 'portals '())
leaf-list))
(let* ((splitting-face (choose-splitting-face candidate-faces))
(splitting-plane (poly->plane splitting-face))
(split (cut poly-split <> splitting-plane))
(candidate-splits (map split candidate-faces))
(applied-splits (map split applied-faces)))
;; TODO: Add this to sanitization too
(for-each (lambda (face) (println "Warning: degenerate candidate " face))
(filter poly-degenerate? candidate-faces))
;; Partition splits into +/-
(receive (+candidates -candidates +=candidates -=candidates)
(partition-splits splitting-plane (zip candidate-faces candidate-splits))
(receive (+applied -applied +=applied -=applied)
(partition-splits splitting-plane (zip applied-faces applied-splits))
;; Planar candidates are moved to the applied set to prevent re-splitting along the same plane
;; Planar faces that share the splitting normal are pushed right
;; Planar faces with opposite normals are pushed left
;; thus making a 'right-handed' leafy bsp tree
(let* ((+candidate-faces +candidates)
(-candidate-faces -candidates)
(+applied-faces (append +applied +=applied +=candidates))
(-applied-faces (append -applied -=applied -=candidates))
(tree-lhs (make-bsp-tree -candidate-faces -applied-faces index leaf-list))
(tree-rhs (make-bsp-tree +candidate-faces +applied-faces (pget tree-lhs 'index) (pget tree-lhs 'list))))
(plist-put tree-rhs 'tree (make-tree splitting-plane
(pget tree-lhs 'tree)
(pget tree-rhs 'tree)))))))))
(if (null? faces)
(list 'tree tree-null
'vector #()
'faces '())
(let ((bsp-tree (make-bsp-tree faces '() 0 '())))
(list 'tree (pget bsp-tree 'tree)
'vector (list->vector (reverse (pget bsp-tree 'list)))
'faces faces))))
;; Takes the bsp, turns each unique plane into a boundary-clipped poly, then inserts each into the bsp tree in a special way
;; When portal polys lie coincident with a branch plane, they get sent down _both_ ends of the branch as siblings!
;; When they eventually settle into their respective convex hull, they join the two sibling hulls with the notion of being connected via portal.
;; This gives a notion of adjacency; the +hull is adjacent to the -hull
;; A neighborhood is a list of all subdivisions of a bounds-face, with their respective index, separated into the lhs siblings and rhs siblings.
;; Portal lifecycle
;; Step 1: Get split into siblings and subdivided along a coincident splitting plane, forming a neighborhood
;; Step 2: Further subdivide into intersections with all neighbors of the opposite side
;; Step 3: Eliminate remaining subdivisions that are completely covered by solids
;; Step 4: Write remaining subdivisions as portals between two neighbors
(define (gen-neighborhood bsp-tree bounds-face)
(let ((lhs (tree-lhs bsp-tree))
(rhs (tree-rhs bsp-tree)))
(list 'lhs (fill-neighborhood lhs bounds-face '())
'rhs (fill-neighborhood rhs bounds-face '()))))
(define (fill-neighborhood bsp-tree bounds-face neighbors)
(if (tree-leaf? bsp-tree)
;; If it's a leaf
(let* ((index (tree-datum bsp-tree)))
(cons (list 'index index 'face bounds-face) neighbors))
;; Else, not a leaf. Branches have splitting planes as their data
(let* ((splitplane (tree-datum bsp-tree))
(split (poly-split bounds-face splitplane)))
(cond [(poly-split? split)
(fill-neighborhood (tree-rhs bsp-tree) (poly-+split split)
(fill-neighborhood (tree-lhs bsp-tree) (poly--split split) neighbors))]
[(eq? (poly-non-split-sign split) '+)
(fill-neighborhood (tree-rhs bsp-tree) bounds-face neighbors)]
[(eq? (poly-non-split-sign split) '-)
(fill-neighborhood (tree-lhs bsp-tree) bounds-face neighbors)]
;; If ANOTHER coincident splitplane is present while we're already generating a neighborhood, we've broken an invariant
;; Once we split by a given plane, it should never appear again as a splitplane
[(eq? (poly-non-split-sign split) '=)
(error "Invariant broken: Identical splitplane found multiple times in bsp path")]))))
(define (find-neighborhoods bsp-tree bounds-face neighborhoods)
(if (tree-leaf? bsp-tree)
;; Leaves are dead-ends in the neighborhood search
neighborhoods
;; Else, not a leaf. Branches have splitting planes as their data
(let* ((splitplane (tree-datum bsp-tree))
(split (poly-split bounds-face splitplane)))
(cond [(poly-split? split)
(find-neighborhoods (tree-rhs bsp-tree) (poly-+split split)
(find-neighborhoods (tree-lhs bsp-tree) (poly--split split) neighborhoods))]
[(eq? (poly-non-split-sign split) '+)
(find-neighborhoods (tree-rhs bsp-tree) bounds-face neighborhoods)]
[(eq? (poly-non-split-sign split) '-)
(find-neighborhoods (tree-lhs bsp-tree) bounds-face neighborhoods)]
;; Neighborhood candidate found
[(eq? (poly-non-split-sign split) '=)
(let ((neighborhood (gen-neighborhood bsp-tree bounds-face)))
(cons neighborhood neighborhoods))]))))
;; Return a list of paired neighbors
;; TODO: Currently n^2 in complexity as every lhs node checks every rhs node
;; Can be sped up by sorting faces along an abritrary planar axis, and have every lhs node binary-search rhs nodes
(define (neighborhood-pair-neighbors neighborhood pairings)
;; Returns a neighbor-pair or #f if the two aren't neighbors
(define (make-neighbor-pair left-neighbor right-neighbor)
(let* ((left-index (pget left-neighbor 'index))
(left-face (pget left-neighbor 'face))
(right-index (pget right-neighbor 'index))
(right-face (pget right-neighbor 'face))
(intersection (poly-intersection left-face right-face)))
(and intersection
(list 'indices `(,left-index ,right-index)
'face intersection))))
(define (pairs-for-neighbor neighbor partners pairings)
(if (null? partners)
pairings
(let* ((partner (car partners))
(neighbor-pair (make-neighbor-pair neighbor partner)))
(if neighbor-pair
(pairs-for-neighbor neighbor (cdr partners) (cons neighbor-pair pairings))
(pairs-for-neighbor neighbor (cdr partners) pairings)))))
(let ((lhs (pget neighborhood 'lhs))
(rhs (pget neighborhood 'rhs)))
(if (or (null? lhs)
(null? rhs))
pairings
(fold (cut pairs-for-neighbor <> rhs <>) pairings lhs))
))
(define (add-bsp-portals!
bsp ; BSP
boundary) ; dimensions which are sufficient to contain all faces
(let* ((bsp-tree (pget bsp 'tree))
(bsp-vector (pget bsp 'vector))
(faces (pget bsp 'faces))
(planes (map poly->plane faces))
(hash-plane (lambda (plane size)
(let ((h1 (vec3-hash (plane-normal plane) size))
(h2 (vec3-hash (plane-normal (plane-flip plane)) size)))
(hash (+ h1 h2) size))))
(unique-planes (dedup-hash planes hash-plane plane~=))
(clip (lambda (plane) (or (plane-clip-boundary plane boundary)
(error "Could not clip plane to boundary."
"Plane: " plane
"Boundary: " boundary))))
(bounds-faces (map clip unique-planes)))
(define (add-bsp-portal! bsp-tree face)
(let* ((neighborhoods (find-neighborhoods bsp-tree face '()))
(neighbor-pairings (fold neighborhood-pair-neighbors '() neighborhoods))
(pairing-lhs-index (lambda (pairing) (first (pget pairing 'indices))))
(pairing-rhs-index (lambda (pairing) (second (pget pairing 'indices)))))
;; Given the list of neighbor pairings, and index fns to choose
;; which side to write to and which side to connect to,
;; - Groups up all the neighbors by their leaf index.
;; - For each group of neighbors that share a leaf index...
;; -- Calculates the set of non-overlapping solids that might cover the portal
;; -- Iterates through each neighbor, writing the portal to the leaf unless blocked by the covering set
(define (set-neighbors! pairings index-fn dest-fn)
(let* ((sorted (sort pairings (lambda (pairing other)
(< (index-fn pairing)
(index-fn other)))))
(index-runs (runs (lambda (pairing other)
(= (index-fn pairing)
(index-fn other))) sorted)))
(for-each (lambda (run) ;; Each run is guaranteed to be non-empty
(let* ((leaf-index (index-fn (car run)))
(leaf-data (vector-ref bsp-vector leaf-index))
(plane (poly->plane face))
(covering-set (pget leaf-data 'solids))
(covering-set (filter (lambda (solid) (plane~= plane (poly->plane solid))) covering-set))
(covering-set (poly-carve-all covering-set)))
(for-each (lambda (pairing)
(let* ((dest-index (dest-fn pairing))
(portal-face (pget pairing 'face))
(portal-area (poly-area portal-face))
(portal-covering-set (filter-map (lambda (face)
(poly-intersection portal-face face))
covering-set))
(covering-area (apply + (map poly-area portal-covering-set)))
(latest-leaf-data (vector-ref bsp-vector leaf-index))
(portals (pget latest-leaf-data 'portals))
(new-portal (list 'face portal-face 'neighbor dest-index))
(new-leaf-data (pput latest-leaf-data 'portals (cons new-portal portals))))
;; If the portal is less than 99.9999% covered, consider it valid
(if (< (/ covering-area portal-area) FULL_COVERING_RATIO)
(vector-set! bsp-vector leaf-index new-leaf-data))
))
run)
))
index-runs)))
;; Write the lhs portals, pointing to the rhs neighbors
(set-neighbors! neighbor-pairings pairing-lhs-index pairing-rhs-index)
;; Write the rhs portals, pointing to the lhs neighbors
(set-neighbors! neighbor-pairings pairing-rhs-index pairing-lhs-index)))
(for-each (cut add-bsp-portal! bsp-tree <>) bounds-faces)))
(define (mark-inside! bsp point-inside)
(define (find-inside-leaf bsp-tree point-inside)
(cond [(null? bsp-tree) #f]
[(tree-leaf? bsp-tree)
(tree-datum bsp-tree)]
[else
(let ((splitting-plane (tree-datum bsp-tree)))
(if (negative? (v3:dot (v3:sub point-inside (plane-point splitting-plane))
(plane-normal splitting-plane)))
(find-inside-leaf (tree-lhs bsp-tree) point-inside)
(find-inside-leaf (tree-rhs bsp-tree) point-inside)))]))
(let* ((bsp-tree (plist-get bsp 'tree))
(bsp-vector (plist-get bsp 'vector))
(leaf-index (find-inside-leaf bsp-tree point-inside)))
(let self ((leaf-index leaf-index) (depth-limit 256))
(let ((leaf-data (vector-ref bsp-vector leaf-index)))
(if (and (> depth-limit 0)
(not (plist-ref leaf-data 'inside?)))
(begin
(vector-set! bsp-vector
leaf-index
(plist-put leaf-data 'inside? #t))
(for-each (lambda (portal)
(self (plist-get portal 'neighbor) (- depth-limit 1)))
(plist-ref leaf-data 'portals))))))))
;; Just the positive leafs of the bsp-tree
(define (bsp-+prop bsp prop)
(let ((bsp-tree (plist-get bsp 'tree))
(bsp-vector (plist-get bsp 'vector)))
(let self ((bsp-tree bsp-tree) (leafs '()) (side 'rhs))
(cond [(null? bsp-tree) leafs]
[(and (tree-leaf? bsp-tree)
(eq? side 'lhs))
leafs]
[(and (tree-leaf? bsp-tree)
(eq? side 'rhs))
(let* ((index (tree-datum bsp-tree))
(leaf (vector-ref bsp-vector index)))
(cons (plist-ref leaf prop)
leafs))]
[else (self
(tree-rhs bsp-tree)
(self (tree-lhs bsp-tree) leafs 'lhs)
'rhs)]))))
;; All leafs of the bsp-tree
(define (bsp-leafs bsp)
(let ((bsp-tree (plist-get bsp 'tree))
(bsp-vector (plist-get bsp 'vector)))
(let self ((bsp-tree bsp-tree) (leafs '()))
(cond [(null? bsp-tree) leafs]
[(tree-leaf? bsp-tree)
(let* ((index (tree-datum bsp-tree))
(leaf (vector-ref bsp-vector index)))
(cons leaf leafs))]
[else (self
(tree-rhs bsp-tree)
(self (tree-lhs bsp-tree) leafs))]))))
;; All properties of a leaf of the bsp tree
(define (bsp-prop bsp prop)
(let ((bsp-tree (plist-get bsp 'tree))
(bsp-vector (plist-get bsp 'vector)))
(let self ((bsp-tree bsp-tree) (leafs '()))
(cond [(null? bsp-tree) leafs]
[(tree-leaf? bsp-tree)
(let* ((index (tree-datum bsp-tree))
(leaf (vector-ref bsp-vector index)))
(cons (plist-ref leaf prop)
leafs))]
[else (self
(tree-rhs bsp-tree)
(self (tree-lhs bsp-tree) leafs))]))))
(define (bsp-+solids bsp)
(bsp-+prop bsp 'solids))
(define (bsp-+portals bsp)
(bsp-+prop bsp 'portals))
(define (bsp-solids bsp)
(bsp-prop bsp 'solids))
(define (bsp-portals bsp)
(bsp-prop bsp 'portals))
| false |
acf661fac5c2ea2bcd6508dfaeaa72c8bbd1e3e6
|
11b227f71ec01f2e497680cc5f9090c984e9f48e
|
/sources/infrastructure/list/list-intern.scm
|
abab7c8f597c58b3d8a785297bf2d19b80ece9c4
|
[
"MIT"
] |
permissive
|
Mathieu-Desrochers/Scheme-Experimentations
|
30dd336abf40c422f6d9c2d49f31b3665b7a8f17
|
9879e811865fbef170681a7748784a525d950088
|
refs/heads/master
| 2020-03-30T22:55:35.004425 | 2015-04-23T20:08:33 | 2015-04-23T20:08:33 | 6,216,231 | 14 | 1 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 13,471 |
scm
|
list-intern.scm
|
(use data-structures)
(use srfi-1)
(use srfi-69)
(declare (unit list-intern))
;; returns the index of the elements
;; that appear more than once in a list
;; ignores the false element values
(define (list-duplicates-index-intern
elements
element-value-procedure
element-value-equal?
element-value-hash)
;; get the elements value
(let ((elements-value (map element-value-procedure elements))
(elements-value-count-hash-table
(make-hash-table
element-value-equal?
element-value-hash)))
;; count the elements value
(for-each
(lambda (element-value)
(when element-value
(hash-table-update!
elements-value-count-hash-table
element-value
(lambda (element-value-count) (+ element-value-count 1))
(lambda () 0))))
elements-value)
;; return the index of the elements value
;; that were counted more than once
(filter-map
(lambda (element-value-with-index)
(let ((element-value (car element-value-with-index))
(element-index (cadr element-value-with-index)))
(if element-value
(if (> (hash-table-ref elements-value-count-hash-table element-value) 1)
element-index
#f)
#f)))
(zip elements-value (iota (length elements-value))))))
;; returns the index of the elements in a first list
;; whose value can be matched in a second list or not
;; ignores the false element values
(define (list-matches-or-non-matches-index-intern
first-elements
first-element-value-procedure
second-elements
second-element-value-procedure
element-value-equal?
element-value-hash
keep-matches-index
keep-non-matches-index)
;; get the first and second elements value
(let ((first-elements-value (map first-element-value-procedure first-elements))
(second-elements-value (map second-element-value-procedure second-elements)))
;; hash the second elements value
(let ((second-elements-value-hash-table
(make-hash-table
element-value-equal?
element-value-hash)))
(map
(lambda (second-element-value)
(when second-element-value
(hash-table-set!
second-elements-value-hash-table
second-element-value
#t)))
second-elements-value)
;; sort the returned indexes
(sort
;; search the first elements value
;; among the second elements value
(filter-map
(lambda (first-element-value-with-index)
(let ((first-element-value (car first-element-value-with-index))
(first-element-index (cadr first-element-value-with-index)))
(if first-element-value
(if (hash-table-ref/default second-elements-value-hash-table first-element-value #f)
(if keep-matches-index first-element-index #f)
(if keep-non-matches-index first-element-index #f))
#f)))
;; zip the first elements value
;; with their index
(zip first-elements-value (iota (length first-elements-value))))
<))))
;; returns the index at which the elements
;; of two lists share the same value or not
(define (list-same-or-different-values-index-intern
first-elements
first-element-value-procedure
second-elements
second-element-value-procedure
keep-same-values-index
keep-different-values-index)
;; compare the first elements value
;; to the second elements value
(filter-map
(lambda (first-and-second-element-value-with-index)
(let* ((first-element-value (car first-and-second-element-value-with-index))
(second-element-value (cadr first-and-second-element-value-with-index))
(index (caddr first-and-second-element-value-with-index)))
(if (equal? first-element-value second-element-value)
(if keep-same-values-index index #f)
(if keep-different-values-index index #f))))
;; zip the first elements value,
;; the second elements value,
;; and their index
(zip
(map first-element-value-procedure first-elements)
(map second-element-value-procedure second-elements)
(iota (length first-elements)))))
;; returns the element having
;; the minimum or maximum value
(define (list-minimum-or-maximum-element-intern
elements
element-value-procedure
comparaison-procedure)
(if (not (null? elements))
(fold
(lambda (element minimum-or-maximum-element)
(if (comparaison-procedure
(element-value-procedure element)
(element-value-procedure minimum-or-maximum-element))
element
minimum-or-maximum-element))
(car elements)
(cdr elements))
#f))
;; returns the index of the elements
;; whose value matches a filter
(define (list-filtered-index-inner
elements
element-value-procedure
filter-procedure
index
result)
(if (null? elements)
result
(if (filter-procedure (element-value-procedure (car elements)))
(list-filtered-index-inner
(cdr elements)
element-value-procedure
filter-procedure
(+ index 1)
(cons index result))
(list-filtered-index-inner
(cdr elements)
element-value-procedure
filter-procedure
(+ index 1)
result))))
;; returns the last index of a value in a list
(define (list-value-last-index-intern
elements
element-value-procedure
value
current-index
value-last-index)
(if (null? elements)
value-last-index
(let ((value-last-index
(if (eq? (element-value-procedure (car elements)) value)
current-index
value-last-index)))
(list-value-last-index-intern
(cdr elements)
element-value-procedure
value
(+ current-index 1)
value-last-index))))
;; keeps only the lowest numbers in a list
(define (list-keep-lowest-numbers-intern
elements
element-value-procedure
count
maximum-element-value
maximum-element-values-count
accumulator)
;; check if all the elements have been filtered
(if (null? elements)
(reverse accumulator)
;; get the element value
(let* ((element (car elements))
(element-value (element-value-procedure element)))
;; check if we can still keep elements
(if (eq? count 0)
;; discard the element value
(list-keep-lowest-numbers-intern
(cdr elements)
element-value-procedure
count
maximum-element-value
maximum-element-values-count
(cons #f accumulator))
;; check if the element value
;; is below the maximum allowed
(if (< element-value maximum-element-value)
;; keep the element value
(list-keep-lowest-numbers-intern
(cdr elements)
element-value-procedure
(- count 1)
maximum-element-value
maximum-element-values-count
(cons element accumulator))
;; check if the element value
;; is equal to the maximum allowed
(if (eq? element-value maximum-element-value)
;; check if we can still keep maximum elements
(if (eq? maximum-element-values-count 0)
;; discard the maximum element value
(list-keep-lowest-numbers-intern
(cdr elements)
element-value-procedure
count
maximum-element-value
maximum-element-values-count
(cons #f accumulator))
;; keep the maximum element value
(list-keep-lowest-numbers-intern
(cdr elements)
element-value-procedure
(- count 1)
maximum-element-value
(- maximum-element-values-count 1)
(cons element accumulator)))
;; discard the element value
(list-keep-lowest-numbers-intern
(cdr elements)
element-value-procedure
count
maximum-element-value
maximum-element-values-count
(cons #f accumulator))))))))
;; removes the elements at the given indexes
(define (list-remove-at-indexes-intern
elements
indexes-hash-table
current-index
accumulator)
;; check if all the elements have been filtered
(if (null? elements)
(reverse accumulator)
;; check if the current index must be removed
(if (hash-table-exists? indexes-hash-table current-index)
;; remove the element
(list-remove-at-indexes-intern
(cdr elements)
indexes-hash-table
(+ current-index 1)
accumulator)
;; keep the element
(list-remove-at-indexes-intern
(cdr elements)
indexes-hash-table
(+ current-index 1)
(cons (car elements) accumulator)))))
;; returns the index of elements that can be paired
;; with another element having a matching key
(define (list-matching-pairs-index-intern
elements
element-key-procedure
element-matching-key-procedure
matching-keys-hash-table
index
matching-pairs-index)
;; check if all the elements have been paired
(if (null? elements)
(reverse matching-pairs-index)
;; get the element keys
(let* ((element (car elements))
(element-key (element-key-procedure element))
(element-matching-key (element-matching-key-procedure element)))
;; check if a matching element was previously found
(let ((matching-index
(hash-table-ref/default
matching-keys-hash-table
element-matching-key
#f)))
;; a match was found
(if matching-index
(begin
;; remove the matching key
(hash-table-delete!
matching-keys-hash-table
element-matching-key)
;; keep track of the matching indexes
(list-matching-pairs-index-intern
(cdr elements)
element-key-procedure
element-matching-key-procedure
matching-keys-hash-table
(+ index 1)
(cons index (cons matching-index matching-pairs-index))))
;; no match was found
(begin
;; add the matching key
(hash-table-set!
matching-keys-hash-table
element-key
index)
;; keep looking for matching indexes
(list-matching-pairs-index-intern
(cdr elements)
element-key-procedure
element-matching-key-procedure
matching-keys-hash-table
(+ index 1)
matching-pairs-index)))))))
;; returns the index of the elements
;; having a given value
(define (list-value-indexes-intern
elements
element-value-procedure
value
index
accumulator)
;; check if all the elements have been filtered
(if (null? elements)
(reverse accumulator)
;; get the element value
(let* ((element (car elements))
(element-value (element-value-procedure element)))
;; check for the value
(if (eq? element-value value)
;; keep the element index
(list-value-indexes-intern
(cdr elements)
element-value-procedure
value
(+ index 1)
(cons index accumulator))
;; ignore the element index
(list-value-indexes-intern
(cdr elements)
element-value-procedure
value
(+ index 1)
accumulator)))))
;; returns the distinct element values
;; ignores the false element values
(define (list-distinct-values-intern
elements
element-value-procedure
element-value-equal?
element-value-hash)
;; get the elements value
(let ((elements-value (map element-value-procedure elements)))
;; track the already seen elements value
(let ((already-seen-elements-value-hash-table
(make-hash-table
element-value-equal?
element-value-hash)))
;; return the distinct elements value
(list-filter-map-in-order
;; ignore the false elements value
(filter
identity
elements-value)
;; check if the element value has already been seen
(lambda (element-value)
(if (not (hash-table-exists? already-seen-elements-value-hash-table element-value))
(begin
;; add the element value to the already seen elements value
(hash-table-set!
already-seen-elements-value-hash-table
element-value
#t)
;; keep the element value
element-value)
;; the element value has already been seen
#f))))))
| false |
5afa9f49e5dbbe7c80af58d05f9536b63bd7d7ff
|
c94361855ba29e0190df993d10856a0a2d53e687
|
/library/build-in-macros.ss
|
0d9d311ea6ae78084e58e62ded04908a0c688c55
|
[
"MIT"
] |
permissive
|
kghost/Yume
|
f886431eaa7600192fcd8b0ad04896caf4f96b31
|
6ec307279fe0036437a9047d49032f4ee6eb286b
|
refs/heads/master
| 2023-08-16T11:49:40.270078 | 2019-04-18T14:02:33 | 2019-04-18T14:02:33 | 3,162,103 | 4 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 2,678 |
ss
|
build-in-macros.ss
|
(define-syntax cond
(syntax-rules (else =>)
((cond (else result1 result2 ...))
(begin result1 result2 ...))
((cond (test => result))
(let ((temp test))
(if temp (result temp))))
((cond (test => result) clause1 clause2 ...)
(let ((temp test))
(if temp
(result temp)
(cond clause1 clause2 ...))))
((cond (test)) test)
((cond (test) clause1 clause2 ...)
(let ((temp test))
(if temp
temp
(cond clause1 clause2 ...))))
((cond (test result1 result2 ...))
(if test (begin result1 result2 ...)))
((cond (test result1 result2 ...)
clause1 clause2 ...)
(if test
(begin result1 result2 ...)
(cond clause1 clause2 ...)))))
(define-syntax case
(syntax-rules (else)
((case (key ...)
clauses ...)
(let ((atom-key (key ...)))
(case atom-key clauses ...)))
((case key
(else result1 result2 ...))
(begin result1 result2 ...))
((case key
((atoms ...) result1 result2 ...))
(if (memv key '(atoms ...))
(begin result1 result2 ...)))
((case key
((atoms ...) result1 result2 ...)
clause clauses ...)
(if (memv key '(atoms ...))
(begin result1 result2 ...)
(case key clause clauses ...)))))
(define-syntax and
(syntax-rules ()
((and) #t)
((and test) test)
((and test1 test2 ...)
(if test1 (and test2 ...) #f))))
(define-syntax or
(syntax-rules ()
((or) #f)
((or test) test)
((or test1 test2 ...)
(let ((x test1))
(if x x (or test2 ...))))))
(define-syntax let
(syntax-rules ()
((let ((name val) ...) body1 body2 ...)
((lambda (name ...) body1 body2 ...)
val ...))
((let tag ((name val) ...) body1 body2 ...)
((letrec ((tag (lambda (name ...)
body1 body2 ...)))
tag)
val ...))))
(define-syntax let*
(syntax-rules ()
((let* () body1 body2 ...)
(let () body1 body2 ...))
((let* ((name1 val1) (name2 val2) ...)
body1 body2 ...)
(let ((name1 val1))
(let* ((name2 val2) ...)
body1 body2 ...)))))
(define-syntax letrec ; from http://community.schemewiki.org/?scheme-faq-macros
(syntax-rules ()
((_ ((var init) ...) . body)
(let ((var (begin)) ...)
(let ((var (let ((temp init)) (lambda () (set! var temp))))
...
(bod (lambda () . body)))
(var) ... (bod))))))
(define-syntax do
(syntax-rules ()
((do ((var init step ...) ...)
(test expr ...)
command ...)
(letrec
((loop
(lambda (var ...)
(if test
(begin
expr ...)
(begin
command
...
(loop (do "step" var step ...)
...))))))
(loop init ...)))
((do "step" x)
x)
((do "step" x y)
y)))
| true |
3701b05837e0693d5a713c6de606568e22fe50db
|
fc070119c083d67c632e3f377b0585f77053331e
|
/exercises/06/count-columns.scm
|
3cfc3b5f53c70347056aa6bc15aa6b079b15c110
|
[] |
no_license
|
dimitaruzunov/fp-2018
|
abcd90396e9e8b73efe4e2b8a0634866948269a8
|
f75f0cd009cc7f41ce55a5ec71fb4b8eadafc4eb
|
refs/heads/master
| 2020-03-31T11:01:55.426456 | 2019-01-08T20:22:16 | 2019-01-08T20:22:16 | 152,160,081 | 9 | 3 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,040 |
scm
|
count-columns.scm
|
(require rackunit rackunit/text-ui)
(define (every? p l)
(or (null? l)
(and (p (car l))
(every? p (cdr l)))))
(define (compose f g)
(lambda (x) (f (g x))))
(define (any? p l)
(not (every? (compose not p) l)))
(define (transpose matrix)
(apply map list matrix))
(define (count-columns matrix)
(define (subset? column row)
(every? (lambda (x) (member x row))
column))
(define (subset-of-row? column)
(any? (lambda (row) (subset? column row))
matrix))
(length (filter subset-of-row?
(transpose matrix))))
(define count-columns-tests
(test-suite
"Tests for count-columns"
(check = (count-columns '((1))) 1)
(check = (count-columns '((1 2))) 2)
(check = (count-columns '((1) (2))) 0)
(check = (count-columns '((1 3 5 7) (2 5 3 4))) 2)
(check = (count-columns '((1 3 5 7) (2 5 3 7))) 3)
(check = (count-columns '((1 4 3) (4 5 6) (7 4 9))) 1)
(check = (count-columns '((1 4 3) (4 5 6) (7 3 9))) 0)))
(run-tests count-columns-tests)
| false |
e8bd625c720a4a415be3fcdbcf3d5180f2d6948a
|
185024f40e1ceed452781a1f3f57e6d16f57d799
|
/vector-test.ss
|
afb5af1c2ce1afd4318e0321ec0c3f44bdde1336
|
[] |
no_license
|
noelwelsh/numeric
|
b82cd4ca9e4afb18df0129ec2231fc03f9b66450
|
ac4488cf8cc6f0558f74ca9b8faad0f198e76a84
|
refs/heads/master
| 2021-01-18T21:32:27.393991 | 2010-02-22T14:05:19 | 2010-02-22T14:05:19 | 275,898 | 1 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 13,765 |
ss
|
vector-test.ss
|
#lang scheme/base
(require scheme/unit
(planet schematics/schemeunit:3)
"api-sig.ss")
(define-syntax make-vector-tests
(syntax-rules ()
[(_ vector for/fold/vector for/vector in-vector in-vector-reverse)
(lambda (unit)
(define-values/invoke-unit unit
(import)
(export vector^))
(test-suite
"vector-tests"
;; Basics
(test-case
"for/vector"
(check-equal?
(for/vector ([i 4]) i)
(vector 0 1 2 3)))
(test-case
"for/vector many arg form"
(let-values (([v1 v2 v3]
(for/vector ([i 4 3])
(values i (* 2 i) (* 3 i)))))
(check-equal?
v1
(vector 0 1 2 3))
(check-equal?
v2
(vector 0 2 4 6))
(check-equal?
v3
(vector 0 3 6 9))))
(test-case
"for/vector with nested sequences"
(check-equal?
(for/vector ([_ 16]
[i (in-range 4)]
#:when #t
[j (in-range 4)])
j)
(vector 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3)))
(test-case
"for/vector many arg with nested sequence"
(define-values (v1 v2 v3)
(for/vector ([i 4 3]
[a (in-list (list 1 2 3 4 #f 9 9))]
[b (in-list (list 5 6 7 8 9 #f 9))]
[c (in-list (list 0 1 2 3 9 9 #f))]
#:when (and a b c))
(values a b c)))
(check-equal? v1 #(1 2 3 4))
(check-equal? v2 #(5 6 7 8))
(check-equal? v3 #(0 1 2 3)))
(test-case
"for/vector many arg with nested sequence interrupting middle of iteration"
(define-values (v1 v2 v3)
(for/vector ([i 4 3]
[a (in-list (list 1 2 #f 3 4))]
[b (in-list (list 5 6 #f 7 8))]
[c (in-list (list 0 1 #f 2 3))]
#:when (and a b c))
(values a b c)))
(check-equal? v1 #(1 2 3 4))
(check-equal? v2 #(5 6 7 8))
(check-equal? v3 #(0 1 2 3)))
(test-case
"for/fold/vector"
(let-values (([lst vec]
(for/fold/vector ([lst null]) ([i 4])
(values (cons i lst) i))))
(check-equal? lst '(3 2 1 0))
(check-equal? vec (vector 0 1 2 3))))
(test-case
"for/fold/vector many arg form"
(let-values (([lst vec0 vec1]
(for/fold/vector ([lst null]) ([i 4 2])
(values (cons i lst) i (- i)))))
(check-equal? lst '(3 2 1 0))
(check-equal? vec0 (vector 0 1 2 3))
(check-equal? vec1 (vector 0 -1 -2 -3))))
(test-case
"for/fold/vector allows internal define"
(let-values (([a b]
(for/fold/vector ([x 0])
([i 4])
(define foo (* i i))
(values foo foo))))
(check-equal? a 9)
(check-equal? b (vector 0 1 4 9))))
(test-case
"for/fold/vector with nested sequences"
(let-values (([lst vec]
(for/fold/vector ([lst null])
([_ 16]
[i (in-range 4)]
#:when #t
[j (in-range 4)])
(values (cons j lst) j))))
(check-equal? lst (list 3 2 1 0 3 2 1 0 3 2 1 0 3 2 1 0))
(check-equal? vec (vector 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3))))
(test-case
"in-vector-reverse"
(check-equal?
(for/list ([v (in-vector-reverse (vector 1 2 3 4))])
v)
'(4 3 2 1)))
(test-case
"in-vector-reverse w/ offset"
(check-equal?
(for/list ([v (in-vector-reverse (vector 1 2 3 4) 1)])
v)
'(3 2 1)))
(test-case
"in-vector"
(check-equal?
(for/list ([v (in-vector (vector 1 2 3 4))])
v)
'(1 2 3 4)))
;; Test error checking for comprehensions code
(test-case
"in-vector error handling"
(check-exn (lambda (e)
(and (exn:fail:contract? e)
(check-regexp-match
#rx"expected argument of type.*given \\(1 2 3 4\\)"
(exn-message e))))
(lambda ()
(in-vector '(1 2 3 4)))))
;; Constructors
(test-case
"vector-ones"
(check-equal? (vector-ones 5) (vector 1 1 1 1 1)))
(test-case
"vector-zeros"
(check-equal? (vector-zeros 5) (vector 0 0 0 0 0)))
(test-case
"vector-copy"
(check-equal? (vector 1 2 3 4 5) (vector-copy (vector 1 2 3 4 5)))
(check-equal? (vector) (vector-copy (vector))))
(test-case
"vector-reverse"
(check-equal? (vector-reverse (vector)) (vector))
(check-equal? (vector-reverse (vector 1 2 3 4 5))
(vector 5 4 3 2 1)))
;; Predicates
(test-case
"vector-null?"
(check-true (vector-null? (vector)))
(check-false (vector-null? (vector 1))))
(test-case
"vector-="
(check-true (vector-= (vector 1 2 3 4) (vector 1 2 3 4)) "Equal vectors")
(check-false (vector-= (vector 1 2 7 4) (vector 1 2 3 4)) "Different values")
(check-false (vector-= (vector 1 2 3 4) (vector 1 2 3 4 5)) "Different lengths")
(check-true (vector-= (vector 1 2 3.1 4) (vector 1 2 3 4) 0.25) "Within epsilon")
(check-true (vector-= (vector 1 2 3.25 4) (vector 1 2 3 4) 0.25) "At epsilon")
(check-false (vector-= (vector 1 2 3.11 4) (vector 1 2 3 4) 0.1) "Outside epsilon"))
;; Selectors
(test-case
"vector-select"
(check-equal? (vector-select (vector 0 1 2 3 4 5) (vector #f #f #f #f #f #f))
(vector))
(check-equal? (vector-select (vector 0 1 2 3 4 5) (vector #t #t #t #t #t #t))
(vector 0 1 2 3 4 5))
(check-equal? (vector-select (vector 0 1 2 3 4 5) (vector #f #t #f #t #f #t))
(vector 1 3 5)))
(test-case
"vector-last"
(check-equal? (vector-last (vector 0 1 2 7)) 7))
(test-case
"vector-find"
(check-equal? (vector-find (vector 0 1 2 3 4) 2) (vector 2))
(check-equal? (vector-find (vector 0 1 0 1 0) 0) (vector 0 0 0))
(check-equal? (vector-find (vector 0 1 2 3 4) 5) (vector))
(check-equal? (vector-find (vector 0 1 2 3 4) odd?) (vector 1 3))
(check-equal? (vector-find (vector 2 4 6 8) odd?) (vector)))
(test-case
"vector-findi"
(check-equal? (vector-findi (vector 0 1 2 3 4) 2) (vector 2))
(check-equal? (vector-findi (vector 0 1 0 1 0) 0) (vector 0 2 4))
(check-equal? (vector-findi (vector 0 1 2 3 4) 5) (vector))
(check-equal? (vector-findi (vector 0 1 2 3 4) odd?) (vector 1 3))
(check-equal? (vector-findi (vector 2 4 6 8) odd?) (vector)))
(test-case
"vector-find-first"
(check-equal? (vector-find-first (vector 0 1 2 3 4) 2) 2)
(check-equal? (vector-find-first (vector 0 1 0 1 0) 0) 0)
(check-equal? (vector-find-first (vector 0 1 2 3 4) 5) #f)
(check-equal? (vector-find-first (vector 0 1 2 3 4) odd?) 1)
(check-equal? (vector-find-first (vector 2 4 6 8) odd?) #f))
(test-case
"vector-find-firsti"
(check-equal? (vector-find-firsti (vector 0 2 0 0 0) 2) 1)
(check-equal? (vector-find-firsti (vector 1 1 0 1 0) 0) 2)
(check-equal? (vector-find-firsti (vector 0 1 2 3 4) 5) #f)
(check-equal? (vector-find-firsti (vector 0 1 2 3 4) odd?) 1)
(check-equal? (vector-find-firsti (vector 2 4 6 8) odd?) #f))
(test-case
"vector-remove"
(check-equal? (vector-remove (vector 0 2 0 0 0) 2) (vector 0 0 0 0))
(check-equal? (vector-remove (vector 1 1 0 1 0) 0) (vector 1 1 1))
(check-equal? (vector-remove (vector 0 1 2 3 4) 5) (vector 0 1 2 3 4))
(check-equal? (vector-remove (vector 0 1 2 3 4) odd?) (vector 0 2 4))
(check-equal? (vector-remove (vector 2 4 6 8) odd?) (vector 2 4 6 8)))
(test-case
"vector-remove-first"
(check-equal? (vector-remove-first (vector 0 2 0 0 0) 2) (vector 0 0 0 0))
(check-equal? (vector-remove-first (vector 1 1 0 1 0) 0) (vector 1 1 1 0))
(check-equal? (vector-remove-first (vector 0 1 2 3 4) 5) (vector 0 1 2 3 4))
(check-equal? (vector-remove-first (vector 0 1 2 3 4) odd?) (vector 0 2 3 4))
(check-equal? (vector-remove-first (vector 2 4 6 8) odd?) (vector 2 4 6 8)))
(test-case
"vector-removei"
(check-equal? (vector-removei (vector 0 1 2 3 4) 2) (vector 0 1 3 4))
(check-equal? (vector-removei (vector 0 1 2 3 4) 0) (vector 1 2 3 4))
(check-equal? (vector-removei (vector 0 1 2 3 4) 4) (vector 0 1 2 3)))
(test-case
"vector-slice"
(check-equal? (vector-slice (vector 0 1 2 3 4) 0) (vector))
(check-equal? (vector-slice (vector 0 1 2 3 4) 3) (vector 0 1 2))
(check-equal? (vector-slice (vector 0 1 2 3 4) 5) (vector 0 1 2 3 4))
(check-equal? (vector-slice (vector 0 1 2 3 4) 0 5) (vector 0 1 2 3 4))
(check-equal? (vector-slice (vector 0 1 2 3 4) 1 3) (vector 1 2))
(check-equal? (vector-slice (vector 0 1 2 3 4) 1 2) (vector 1))
(check-equal? (vector-slice (vector 0 1 2 3 4) 1 1) (vector)))
;; Mutators
(test-case
"vector-add1!"
(let ([v (vector 0 1 2 3)])
(vector-add1! v 1)
(check-equal? v (vector 0 2 2 3))))
(test-case
"vector-sub1!"
(let ([v (vector 0 1 2 3)])
(vector-sub1! v 1)
(check-equal? v (vector 0 0 2 3))))
;; General Functions
(test-case
"vector/scalar"
(let ([v (vector 0 2 4 6)])
(check-equal? (vector*s v 2) (vector 0 4 8 12) "vector*s")
(check-equal? (vector/s v 2) (vector 0 1 2 3) "vector/s")
(check-equal? (vector-s v 2) (vector -2 0 2 4) "vector-s")
(check-equal? (vector+s v 2) (vector 2 4 6 8) "vector+s")))
(test-case
"vector-sum"
(let ([v (vector 0 1 2 3)])
(check-equal? (vector-sum v) 6)))
(test-case
"vector-adjoin"
(check-equal? (vector-adjoin (vector 1 2 3 4) 5) (vector 1 2 3 4 5))
(check-equal? (vector-adjoin (vector) 1) (vector 1))
(check-equal? (vector-adjoin (vector 1 2 3) (vector 4))
(vector 1 2 3 (vector 4))))
(test-case
"vector-append"
(check-equal? (vector-append (vector 1 2 3 4) (vector 5 6 7 8))
(vector 1 2 3 4 5 6 7 8))
(check-equal? (vector-append (vector) (vector)) (vector))
(check-equal? (vector-append (vector) (vector 1 2 3 4)) (vector 1 2 3 4))
(check-equal? (vector-append (vector 1 2 3 4) (vector)) (vector 1 2 3 4)))
(test-case
"vector-append varg case"
(check-equal? (vector-append) (vector))
(check-equal? (vector-append (vector 1 2 3)) (vector 1 2 3))
(check-equal? (vector-append (vector 1) (vector 2) (vector 3) (vector 4))
(vector 1 2 3 4)))
(test-case
"vector-max"
(check-equal? (vector-max (vector 0 1 2 3 4 5)) 5)
(check-equal? (vector-max (vector 5 4 3 2 1 0)) 5)
(check-equal? (vector-max (vector 4 3 2 5 1 0)) 5)
(check-equal? (vector-max (vector 5 5 5 5 5 5)) 5)
(check-equal? (vector-max (vector -5 -4 -3 -2 -1 0)) 0))
(test-case
"vector-min"
(check-equal? (vector-min (vector 0 1 2 3 4 5)) 0)
(check-equal? (vector-min (vector 5 4 3 2 1 0)) 0)
(check-equal? (vector-min (vector 4 3 2 5 1 0)) 0)
(check-equal? (vector-min (vector 5 5 5 5 5 5)) 5)
(check-equal? (vector-min (vector -5 -4 -3 -2 -1 0)) -5))
;; Iteration
(test-case
"vector-map"
(check-equal? (vector-map - (vector 1 2 3 4)) (vector -1 -2 -3 -4))
(check-equal? (vector-map + (vector 1 2 3 4) (vector 1 2 3 4))
(vector 2 4 6 8)))
(test-case
"vector-map checks length of arguments"
(check-exn exn:fail:contract?
(lambda () (vector-map + (vector) (vector 1 2)))))
(test-case
"vector-mapi"
(check-equal? (vector-mapi (lambda (i x) i) (vector 4 3 2 1)) (vector 0 1 2 3)))
(test-case
"vector-fold"
(check-= (vector-fold (lambda (x seed) (+ x seed)) 4 (vector 0 1 2 3))
10.0
0.0))
(test-case
"vector-foldi"
(check-= (vector-foldi (lambda (i x seed) (+ x i seed)) 4 (vector 1 2 3 4))
20.0
0.0))
))]))
(provide make-vector-tests)
| true |
31c484596c830b70744429b90e07fb7c02bfb4d5
|
169a5122284459b36ea040407e44ada125318636
|
/net/twitter/util.scm
|
2bd0b2ab9fbec05403dbfddc77c96c492293fbf9
|
[] |
no_license
|
ktakashi/Sagittarius-net-twitter
|
26a89f335b4b3d3f845833eea2d8470be6b8d9f3
|
67750159e6ffb30b88dabee0a85539d29184e393
|
refs/heads/master
| 2020-05-17T02:38:32.521780 | 2017-11-10T16:20:30 | 2017-11-10T16:20:30 | 4,771,205 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 4,809 |
scm
|
util.scm
|
;;; -*- mode:scheme; coding:utf-8; -*-
;;;
;;; net/twitter/util.scm - Twitter API utility
;;;
;;; Copyright (c) 2012-2013 Takashi Kato <[email protected]>
;;;
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are permitted provided that the following conditions
;;; are met:
;;;
;;; 1. Redistributions of source code must retain the above copyright
;;; notice, this list of conditions and the following disclaimer.
;;;
;;; 2. Redistributions in binary form must reproduce the above copyright
;;; notice, this list of conditions and the following disclaimer in the
;;; documentation and/or other materials provided with the distribution.
;;;
;;; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
;;; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
;;; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
;;; A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
;;; OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
;;; SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
;;; TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
;;; PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
;;; LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
;;; NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
;;; SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
;;;
#!read-macro=sagittarius/regex
(library (net twitter util)
(export call/twitter-api
make-twitter-credential
make-query-params)
(import (rnrs)
(rfc http)
(rfc uri)
(net oauth)
(text sxml ssax)
(util list)
(sagittarius)
(sagittarius io)
(sagittarius regex)
(json))
(define (xml->sxml p) (ssax:xml->sxml p '()))
(define (json->sexp p) (json-read p))
;; Do nothing
(define (default-error-handler body header hint advice) body)
;; Low level API
;; Calls twitter API directory with params
;;
;; required arguments
;; token: oauth access token or #f if it's not required
;; method: http request method. must be 'GET or 'POST
;; path: twitter API path.
;; params: alist of parameters.
;;
;; keyword arguments
;; secure?: use TLS if #t
;; type: currently only 'xml or 'json. determine calling API type
;;
;; rest arguments will be passed to http-get, http-post or
;; access-protected-resource as extra headers.
(define (call/twitter-api token method path params
:key (secure? #t)
(type 'json) ;; 1.1 doesn't support xml anymore
(error-handler default-error-handler)
(body #f)
(use-user-parameters-for-auth #t)
:allow-other-keys opts)
(define composed-path (format "~a.~a" path type))
(define (list->alist lis)
(let loop ((lis lis) (r '()))
(if (null? lis)
(reverse! r)
(loop (cddr lis) `((,(car lis) ,(cadr lis)) ,@r)))))
(define (call)
(if token
(access-protected-resource
(string-append (if secure?
"https://api.twitter.com"
"http://api.twitter.com") composed-path)
token
:user-parameters params
:use-user-parameters-for-auth use-user-parameters-for-auth
:request-method method
:body body
:additional-headers (list->alist opts))
(receive (status header body)
(case method
((GET) (apply http-get "api.twitter.com"
(string-append composed-path "?"
(oauth-compose-query params))
:secure secure?
opts))
((POST) (apply http-post "api.twitter.com"
(string-append composed-path "?"
(oauth-compose-query params))
body
:secure secure? opts)))
(values body header (not (string=? status "200")) status))))
(define (retrieve body header hint advice)
(if (not hint)
(call-with-input-string body
(if (eq? type 'xml) xml->sxml json->sexp))
(error-handler body header hint advice)))
(call-with-values call retrieve))
;; Convenient method
;; Thin wrapper of make-access-token and make-consumer-token
(define (make-twitter-credential consumer-key consumer-secret
access-token access-token-secret)
(make-access-token :key access-token :secret access-token-secret
:consumer (make-consumer-token
:key consumer-key
:secret consumer-secret)))
;; Internal macros
;; compose query parameter alist
(define-syntax make-query-params
(lambda (x)
(syntax-case x ()
((_ . vars)
#`(cond-list #,@(map (lambda (v)
`(,v `(,',(regex-replace-all #/-/
(format "~a" v)
"_")
,(if (boolean? ,v) "true" ,v))))
(syntax->datum #'vars)))))))
)
| true |
ed6cc740067a4634e34849cbfc46129be51c3c4b
|
b9eb119317d72a6742dce6db5be8c1f78c7275ad
|
/racket/sqlite.ss
|
6511a3e1d9ee12fee22f39290e39fceec61205ce
|
[] |
no_license
|
offby1/doodles
|
be811b1004b262f69365d645a9ae837d87d7f707
|
316c4a0dedb8e4fde2da351a8de98a5725367901
|
refs/heads/master
| 2023-02-21T05:07:52.295903 | 2022-05-15T18:08:58 | 2022-05-15T18:08:58 | 512,608 | 2 | 1 | null | 2023-02-14T22:19:40 | 2010-02-11T04:24:52 |
Scheme
|
UTF-8
|
Scheme
| false | false | 482 |
ss
|
sqlite.ss
|
(require (planet "sqlite.ss" ("jaymccarthy" "sqlite.plt" 3)))
(define *db* (open (build-path "/tmp/yow.db")))
(exec/ignore *db*
"create table if not exists foo(key blob primary key on conflict replace, value blob, timestamp blob)")
(let ((insert (prepare *db* "insert into foo values (?, ?, ?)")))
(with-handlers
([void void])
(run insert "snicker" "snack" (current-milliseconds)))
(finalize insert))
(write (select *db* "select * from foo"))
(newline)
| false |
99559ad0482803929cac5fb3e5e8e482563e5d11
|
b14c18fa7a4067706bd19df10f846fce5a24c169
|
/Chapter1/1.23.scm
|
3fca379c6e46a7969270f55ff18100c239547eb8
|
[] |
no_license
|
silvesthu/LearningSICP
|
eceed6267c349ff143506b28cf27c8be07e28ee9
|
b5738f7a22c9e7967a1c8f0b1b9a180210051397
|
refs/heads/master
| 2021-01-17T00:30:29.035210 | 2016-11-29T17:57:16 | 2016-11-29T17:57:16 | 19,287,764 | 3 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,720 |
scm
|
1.23.scm
|
#lang scheme
(define (square x) (* x x))
(define (divides? a b)
(= (remainder b a) 0))
(define (next test-divisor)
(if (= test-divisor 2)
3
(+ test-divisor 2)
)
)
(define (find-divisor n test-divisor)
(cond ((> (square test-divisor) n) n)
((divides? test-divisor n) test-divisor)
; (else (find-divisor n (+ test-divisor 1)))))
(else (find-divisor n (next test-divisor)))))
(define (smallest-divisor n)
(find-divisor n 2))
; above from 1.21
(define (prime? n)
(= n (smallest-divisor n)))
(define (timed-prime-test n)
(newline)
(display "Begin Test on ")
(display n)
(start-prime-test n (current-milliseconds)))
(define (start-prime-test n start-time)
(if (prime? n)
(report-prime (- (current-milliseconds) start-time))
#f
)
)
(define (report-prime elapsed-time)
(newline)
(display "End Test")
(newline)
(display " *** ")
(display elapsed-time)
(newline)
#t
)
(define (search-for-prime n)
(if (= (remainder n 2) 0)
(search-for-prime (+ n 1))
(unless (timed-prime-test n) ; use when as "if only", use unless as "else only"
(search-for-prime (+ n 2))
)
)
)
; above from 2.22 except "next" and "smallest-divisor"
; result comparison
; 1.22
; (search-for-prime 1000000000000000) ; 577
; (search-for-prime 10000000000000000) ; 1916
; (search-for-prime 100000000000000000) ; 5975
; 1.23
(search-for-prime 1000000000000000) ; 577 -> 318
(search-for-prime 10000000000000000) ; 1916 -> 996
(search-for-prime 100000000000000000) ; 5975 -> 3247
(search-for-prime 1000000000000000000) ; 20424 -> 10060
; so, about 2 times fast ?
; # from instructor's manual
; the ratio may depend on whether the "next" is internally implemented,
; as well as the version of scheme
| false |
8febf431804bbb957febca3e0d6c6693a10b3701
|
404799b4b2d5f83ee5304392826a69defc25da77
|
/ex3-61.scm
|
b90436969f4511dfecceb2244ae3c88661d056bb
|
[] |
no_license
|
WuzhangFang/SICP-exercise
|
38ae650c63e74bb7c6639bf984285e06743db925
|
d9977009ec3e32a74edb13b4f13f6ebbbc44ab32
|
refs/heads/master
| 2020-04-16T16:01:18.058287 | 2019-10-01T21:52:40 | 2019-10-01T21:52:40 | 165,722,260 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 278 |
scm
|
ex3-61.scm
|
;; Exercise 3.61
(load "3.5.scm")
(load "ex3-59.scm")
(load "ex3-60.scm")
(define (invert-unit-series s)
(define x
(cons-stream 1 (scale-stream (mul-series x (stream-cdr s)) -1)))
x)
;; test
;(stream-ref cosine-series 2)
;(stream-ref (invert-unit-series cosine-series) 2)
| false |
8827124e747f46b418de411a7379e400ac3aff93
|
50a8932cf0abcd58cf69bf8706bb87d51ce6e22c
|
/lower-tests.scm
|
913ff2824c36ed46f8e0fd9ce158552ac170531b
|
[] |
no_license
|
mikea/scheme-llvm
|
d1c2282b270aa331ca0537e1a0e6e3028f46fd32
|
0d580352a73ea98913363c9e996d253962ec06c9
|
refs/heads/master
| 2021-01-16T20:42:20.296384 | 2016-11-25T06:16:23 | 2016-11-25T06:16:23 | 26,048 | 21 | 5 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 339 |
scm
|
lower-tests.scm
|
(use test)
(load "lower.scm")
(test-group "primitve-expr"
(test "abc" (lower "abc"))
(test '(12) (lower '(12))))
(test-group "define"
(test '((let ((x 5)) x))
(lower '((define x 5)
x)))
(test '((let ((f (lambda (x) (+ 1 x)))) (f 5)))
(lower '((define (f x) (+ 1 x))
(f 5))))
)
(test-exit)
| false |
7073c6ba23d7d25241e3af7ced0d778b7f345d62
|
0bb7631745a274104b084f6684671c3ee9a7b804
|
/lib/gambit/procedure/procedure.sld
|
e8976b9fc21b64956429ed94977ccb4d9673c11c
|
[
"Apache-2.0",
"LGPL-2.1-only",
"LicenseRef-scancode-free-unknown",
"GPL-3.0-or-later",
"LicenseRef-scancode-autoconf-simple-exception"
] |
permissive
|
feeley/gambit
|
f87fd33034403713ad8f6a16d3ef0290c57a77d5
|
7438e002c7a41a5b1de7f51e3254168b7d13e8ba
|
refs/heads/master
| 2023-03-17T06:19:15.652170 | 2022-09-05T14:31:53 | 2022-09-05T14:31:53 | 220,799,690 | 0 | 1 |
Apache-2.0
| 2019-11-10T15:09:28 | 2019-11-10T14:14:16 | null |
UTF-8
|
Scheme
| false | false | 466 |
sld
|
procedure.sld
|
;;;============================================================================
;;; File: "procedure.sld"
;;; Copyright (c) 1994-2020 by Marc Feeley, All Rights Reserved.
;;;============================================================================
;;; Procedure operations.
(define-library (procedure)
(namespace "")
(export
procedure?
)
(include "procedure#.scm"))
;;;============================================================================
| false |
d375b4153307342c7ad9a51e672fa6ea96ee38c9
|
7e0c613b8a2781aab692a5976b0e8896ac18b4fb
|
/tests/ecdh.sps
|
d52a22056fe17503cab442c0486ab1ac9d940dcf
|
[
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] |
permissive
|
atomontage/industria
|
f279fb71cc69032cc4084c1e2f09bfacefe2fc6c
|
f13b067ce3b8b82f09c5670a45dfde29da29c5fb
|
refs/heads/master
| 2021-01-22T12:13:08.369334 | 2019-05-26T18:07:25 | 2019-05-26T18:07:25 | 24,039,099 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 5,214 |
sps
|
ecdh.sps
|
#!/usr/bin/env scheme-script
;; -*- mode: scheme; coding: utf-8 -*- !#
;; Copyright © 2019 Göran Weinholt <[email protected]>
;; SPDX-License-Identifier: MIT
#!r6rs
(import
(rnrs (6))
(industria bytevectors)
(industria crypto ecdh)
(srfi :64 testing))
;; Tests from RFC 7748
(test-begin "ecdh-x25519_x448")
(test-equal
(uint->bytevector #xc3da55379de9c6908e94ea4df28d084f32eccf03491c71f754b4075577a28552)
(X25519 (uint->bytevector #xa546e36bf0527c9d3b16154b82465edd62144c0ac1fc5a18506a2244ba449ac4)
(uint->bytevector #xe6db6867583030db3594c1a424b15f7c726624ec26b3353b10a903a6d0ab1c4c)))
(test-equal
(uint->bytevector #x95cbde9476e8907d7aade45cb4b873f88b595a68799fa152e6f8f7647aac7957)
(X25519 (uint->bytevector #x4b66e9d4d1b4673c5ad22691957d6af5c11b6421e0ea01d42ca4169e7918ba0d)
(uint->bytevector #xe5210f12786811d3f4b7959d0538ae2c31dbe7106fc03c3efc4cd549c715a493)))
(test-equal
(uint->bytevector #xce3e4ff95a60dc6697da1db1d85e6afbdf79b50a2412d7546d5f239fe14fbaadeb445fc66a01b0779d98223961111e21766282f73dd96b6f)
(X448 (uint->bytevector #x3d262fddf9ec8e88495266fea19a34d28882acef045104d0d1aae121700a779c984c24f8cdd78fbff44943eba368f54b29259a4f1c600ad3)
(uint->bytevector #x06fce640fa3487bfda5f6cf2d5263f8aad88334cbd07437f020f08f9814dc031ddbdc38c19c6da2583fa5429db94ada18aa7a7fb4ef8a086)))
(test-equal
(uint->bytevector #x884a02576239ff7a2f2f63b2db6a9ff37047ac13568e1e30fe63c4a7ad1b3ee3a5700df34321d62077e63633c575c1c954514e99da7c179d)
(X448 (uint->bytevector #x203d494428b8399352665ddca42f9de8fef600908e0d461cb021f8c538345dd77c3e4806e25f46d3315c44e0a5b4371282dd2c8d5be3095f)
(uint->bytevector #x0fbcc2f993cd56d3305b0b7d9e55d4c1a8fb5dbb52f8e9a1e9b6201b165d015894e56c4d3570bee52fe205e28a78b91cdfbde71ce8d157db)))
(let ()
(define (loop-test f init n)
(do ((i 0 (+ i 1))
(k init (f k u))
(u init k))
((fx=? i n) k)))
(let ((init (uint->bytevector #x0900000000000000000000000000000000000000000000000000000000000000)))
(test-equal (uint->bytevector #x422c8e7a6227d7bca1350b3e2bb7279f7897b87bb6854b783c60e80311ae3079)
(loop-test X25519 init 1))
#;
(test-equal (uint->bytevector #x684cf59ba83309552800ef566f2f4d3c1c3887c49360e3875f2eb94d99532c51)
(loop-test X25519 init 1000))
#;
(test-equal (uint->bytevector #x7c3911e0ab2586fd864497297e575e6f3bc601c0883c30df5f4dd2d24f665424)
(loop-test X25519 init 1000000)))
(let ((init (uint->bytevector #x0500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)))
(test-equal (uint->bytevector #x3f482c8a9f19b01e6c46ee9711d9dc14fd4bf67af30765c2ae2b846a4d23a8cd0db897086239492caf350b51f833868b9bc2b3bca9cf4113)
(loop-test X448 init 1))
#;
(test-equal (uint->bytevector #xaa3b4749d55b9daf1e5b00288826c467274ce3ebbdd5c17b975e09d4af6c67cf10d087202db88286e2b79fceea3ec353ef54faa26e219f38)
(loop-test X448 init 1000))
#;
(test-equal (uint->bytevector #x077f453681caca3693198420bbe515cae0002472519b3e67661a7e89cab94695c8f4bcd66e61b9b9c946da8d524de3d69bd9d9d66b997e37)
(loop-test X25519 init 1000000))))
(test-end)
(test-begin "ecdh")
(let ((test-a #x77076d0a7318a57d3c16c17251b26645df4c2f87ebc0992ab177fba51db92c2a)
(test-K_A #x8520f0098930a754748b7ddcb43ef75a0dbf3a0d26381af4eba4a98eaa9b4e6a)
(test-b #x5dab087e624a8a4b79e17f8b83800ee66f3bb1292618b6fd1c2f8b27ff88e0eb)
(test-K_B #xde9edb7d7b7dc1b4d35b61c2ece435373f8343c85b78674dadfc7e146f882b4f)
(test-K #x4a5d9d5ba4ce2de1728e3bf480350f25e07e21c947d19e3376f09b3c1e161742))
(let ((K (ecdh-curve25519 (uint->bytevector test-a)
(uint->bytevector test-K_B))))
(test-equal (uint->bytevector test-K) K))
(let ((K (ecdh-curve25519 (uint->bytevector test-b)
(uint->bytevector test-K_A))))
(test-equal (uint->bytevector test-K) K)))
(let ((test-a #x9a8f4925d1519f5775cf46b04b5800d4ee9ee8bae8bc5565d498c28dd9c9baf574a9419744897391006382a6f127ab1d9ac2d8c0a598726b)
(test-K_A #x9b08f7cc31b7e3e67d22d5aea121074a273bd2b83de09c63faa73d2c22c5d9bbc836647241d953d40c5b12da88120d53177f80e532c41fa0)
(test-b #x1c306a7ac2a0e2e0990b294470cba339e6453772b075811d8fad0d1d6927c120bb5ee8972b0d3e21374c9c921b09d1b0366f10b65173992d)
(test-K_B #x3eb7a829b0cd20f5bcfc0b599b6feccf6da4627107bdb0d4f345b43027d8b972fc3e34fb4232a13ca706dcb57aec3dae07bdc1c67bf33609)
(test-K #x07fff4181ac6cc95ec1c16a94a0f74d12da232ce40a77552281d282bb60c0b56fd2464c335543936521c24403085d59a449a5037514a879d))
(let ((K (ecdh-curve448 (uint->bytevector test-a)
(uint->bytevector test-K_B))))
(test-equal (uint->bytevector test-K) K))
(let ((K (ecdh-curve448 (uint->bytevector test-b)
(uint->bytevector test-K_A))))
(test-equal (uint->bytevector test-K) K)))
(let-values ([(a K_A) (make-ecdh-curve25519-secret)]
[(b K_B) (make-ecdh-curve25519-secret)])
(test-equal (ecdh-curve25519 a K_B)
(ecdh-curve25519 b K_A)))
(test-end)
(exit (if (zero? (test-runner-fail-count (test-runner-get))) 0 1))
| false |
a5f28786ebcec9303ff178e3a1b1f65efaf4d9c6
|
78a81779e2a49f9cfa4163cbbbcd7d2c79ee2c1d
|
/blabla2.scm
|
eeca32116758df981363ec76521f03dc9c36498e
|
[] |
no_license
|
tobyfielding1/Scheme-Exercises
|
bd17c17c0babac16b9863ce016edc95587af5cc7
|
01f62198bd267300d2435a2133d93e73f36879f5
|
refs/heads/master
| 2021-07-15T03:16:49.580461 | 2017-10-20T23:20:31 | 2017-10-20T23:20:31 | 107,734,701 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 3,717 |
scm
|
blabla2.scm
|
; /home/lavm/lecture-notes/cm315/scheme/eval-dist/acont.scm created by Lavm on gadget.ecs.soton.ac.uk on Tue Sep 15 21:00:46 1998
; $Id: acont.scm,v 1.1 1998/09/24 19:38:30 lavm Exp $
;;; We define here a macro to represent continuations.
;;; The macro can be expanded in a regular lambda expression
;;; or it can be expanded into a data structure.
;;; The interest is that the same code is used to generate
;;; abstract cps or regular cps.
;;; For instance, the following continuation
;;; (Clambda (args)
;;; rand : (funct cont)
;;; (apply-cps funct args cont))
;;; can be expanded into
;;; (lambda (args)
;;; (apply-cps funct args cont))
;;; or into
;;; (make-rand funct cont)
;;; and a function
;;; (define resume-rand
;;; (lambda (args c)
;;; (apply-cps (rand-funct c) args (rand-cont c))))
(define symbol-append
(lambda l
(string->symbol (apply string-append (map symbol->string l)))))
(define-macro (Clambda args name colon closed-vars . body)
(define symbol-append
(lambda l
(string->symbol (apply string-append (map symbol->string l)))))
(if (not (eq? colon ':))
(error 'expanding-Clambda
"incorrect syntax for Clambda"
colon))
(let ((resume-name (symbol-append 'resume- name))
(make-name (symbol-append 'make-acont- name))
(predicate-name (symbol-append 'acont- name '?))
(accessors (map (lambda (x)
(symbol-append 'acont- name '- x))
closed-vars))
(c (gensym)))
`(begin
(define-global! ,resume-name
(lambda (,c . ,args)
(let ,(if (null? closed-vars)
(list (list c c)) ;; dummy binding 'cos let must have at least one!
(map (lambda (x y)
(list x (list y c)))
closed-vars
accessors))
,@body)))
(define-global! ,make-name
(lambda ,closed-vars
(make-acont ',name ,@closed-vars)))
(define-global! ,predicate-name
(test-acont? ',name))
,@(let loop ((n 2) ;; 0 is for acont-tag, 1 for specific tag
(l accessors))
(if (null? l)
'()
(cons (list 'define-global! (car l)
(list 'lambda '(x)
(list 'list-ref 'x n)))
(loop (+ n 1) (cdr l)))))
(,make-name ,@closed-vars) )))
;;; Just redefining the behaviour of the continuation, without declaring all the other stuff.
(define-macro (Clambda-behaviour args name colon closed-vars . body)
(if (not (eq? colon ':))
(error 'expanding-Clambda
"incorrect syntax for Clambda"
colon))
(let ((resume-name (symbol-append 'resume- name))
(accessors (map (lambda (x)
(symbol-append 'acont- name '- x))
closed-vars))
(c (gensym)))
`(set-global! ,resume-name
(lambda (,c . ,args)
(let ,(if (null? closed-vars)
(list (list c c));; dummy binding 'cos let must have at least one!
(map (lambda (x y)
(list x (list y c)))
closed-vars
accessors))
,@body)))))
(define-macro (define-global! var val)
(begin
(set! *global-definitions*
(cons (list 'define var val)
*global-definitions*))
`',var))
(define-macro (set-global! var val)
(begin
(set! *global-definitions*
(cons (list 'set! var val)
*global-definitions*))
`',var))
;(define *global-definitions* '())
(define-macro (init-global-definitions)
(eval '(define *global-definitions* '()))
0)
(define-macro (process-global-definitions)
(if (null? *global-definitions*)
0
(let ((l *global-definitions*))
(set! *global-definitions* '())
`(begin
,@l
(process-global-definitions)
))))
;(pp (expand '(Clambda (args)
; rand : (funct cont)
; (apply-cps funct args cont))))
;(pp (expand '(process-global-definitions)))
;(init-global-definitions)
; end of acont.scm
| false |
fc7582a8d37787c313137fac89e6344da6cc9002
|
d074b9a2169d667227f0642c76d332c6d517f1ba
|
/sicp/ch_4/exercise.4.23.scm
|
c0c908cfaeb98f26c243dab0e4b919ac08d7e88e
|
[] |
no_license
|
zenspider/schemers
|
4d0390553dda5f46bd486d146ad5eac0ba74cbb4
|
2939ca553ac79013a4c3aaaec812c1bad3933b16
|
refs/heads/master
| 2020-12-02T18:27:37.261206 | 2019-07-14T15:27:42 | 2019-07-14T15:27:42 | 26,163,837 | 7 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,697 |
scm
|
exercise.4.23.scm
|
#!/usr/bin/env csi -s
(require rackunit)
(require-library eval)
(import eval)
;;; Exercise 4.23
;; Alyssa P. Hacker doesn't understand why
;; `analyze-sequence' needs to be so complicated. All the other
;; analysis procedures are straightforward transformations of the
;; corresponding evaluation procedures (or `eval' clauses) in section
;; *Note 4-1-1::. She expected `analyze-sequence' to look like this:
;;
;; (define (analyze-sequence exps)
;; (define (execute-sequence procs env)
;; (cond ((null? (cdr procs)) ((car procs) env))
;; (else ((car procs) env)
;; (execute-sequence (cdr procs) env))))
;; (let ((procs (map analyze exps)))
;; (if (null? procs)
;; (error "Empty sequence -- ANALYZE"))
;; (lambda (env) (execute-sequence procs env))))
;;
;; Eva Lu Ator explains to Alyssa that the version in the text does
;; more of the work of evaluating a sequence at analysis time.
;; Alyssa's sequence-execution procedure, rather than having the
;; calls to the individual execution procedures built in, loops
;; through the procedures in order to call them: In effect, although
;; the individual expressions in the sequence have been analyzed, the
;; sequence itself has not been.
;;
;; Compare the two versions of `analyze-sequence'. For example,
;; consider the common case (typical of procedure bodies) where the
;; sequence has just one expression. What work will the execution
;; procedure produced by Alyssa's program do? What about the
;; execution procedure produced by the program in the text above?
;; How do the two versions compare for a sequence with two
;; expressions?
;; no
| false |
053752b842117b0670de8e266ff6059502e049cd
|
7b0df9640ae1b8e1172f0f90c5428b0802df8ed6
|
/timespeaker/timespeaker.scm
|
f1d99e75b2c9689382e9fe359c12e6f7c599a77b
|
[] |
no_license
|
erosness/sm-server
|
5954edfc441e773c605d2ac66df60bb983be01a3
|
cc302551e19f6d2b889a41ec28801004b0b28446
|
refs/heads/master
| 2020-08-31T13:23:03.670076 | 2016-02-18T19:10:55 | 2016-02-18T19:10:55 | 218,699,588 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,371 |
scm
|
timespeaker.scm
|
(use posix miscmacros bitstring)
(define ar 22050)
(define ac 1)
(define (silence sec)
(with-output-to-string
(lambda () (repeat (* sec ar ac)
(display (integer->char #x80))))))
(define (say text)
(with-input-from-pipe (conc "espeak \"" text "\" --stdout" " | "
"ffmpeg -i - -f u8 -ac 1 - 2>/dev/null")
read-string))
(define *pos* 0)
;; current duration in seconds
(define (dur) (/ *pos* ar ac))
(define (seconds) (inexact->exact (floor (dur))))
(define (play str)
(set! *pos* (+ *pos* (string-length str)))
(print str))
(define last 0)
(let loop ()
(let* ((by60 (lambda (x) (inexact->exact (floor (/ x 60)))))
(now (seconds))
(minutes (by60 now))
(seconds (- now (* 60 minutes))))
(if (not (= last now))
(begin (set! last now)
(let ((description
(conc seconds " seconds "
(if (> minutes 0) (conc minutes " minute"
(if (> minutes 1) "s" "")
" ")
""))))
(fprintf (current-error-port) (conc description "\n"))
(play (say description))))
(play (silence 1))))
(if (< (seconds) 240) (loop)))
| false |
e5880675755ee48bf04cb0d972d208b02097dd22
|
174072a16ff2cb2cd60a91153376eec6fe98e9d2
|
/Chap-two/2-29.scm
|
52cac7bca6f9cad5a249f2e4bc9a3fab5962f246
|
[] |
no_license
|
Wang-Yann/sicp
|
0026d506ec192ac240c94a871e28ace7570b5196
|
245e48fc3ac7bfc00e586f4e928dd0d0c6c982ed
|
refs/heads/master
| 2021-01-01T03:50:36.708313 | 2016-10-11T10:46:37 | 2016-10-11T10:46:37 | 57,060,897 | 1 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,054 |
scm
|
2-29.scm
|
(define (make-mobile left right)
(list left right))
(define (make-branch length structure)
(list length structure))
(define (left-branch M) (car M))
(define (right-branch M) (cadr M))
(define (branch-length BR) (car BR))
(define (branch-structure BR)(cadr BR))
(define (total-weight M)
(+ (branch-weight (left-branch M)) (branch-weight (right-branch M))))
(define (branch-weight BR)
(if (hang? BR) (total-weight (branch-structure BR)) (branch-structure BR)))
(define (hang? BR) (pair? (branch-structure BR)))
(define (FL BR)(* (branch-length BR) (branch-weight BR)))
(define (sameFL? M) (= (FL (left-branch M)) (FL (right-branch M))))
(define (balance M)
(let ((left (left-branch M))
(right (right-branch M)))
(and (sameFL? M)
(branch-balance left)
(branch-balance right))))
(define (branch-balance BR)
(if (hang? BR) (balance (branch-structure BR)) #t))
(define a1 (make-branch 10 11))
(define a2 (make-branch 50 3))
(define a3 (make-branch 4 10))
(define A (make-mobile a1 a3))
(define B (make-mobile (make-branch 50/7 A) a2))
| false |
a973f42ee30085d881a8374768f4547ab8e9ac08
|
eb4c9cc6036c985065fec67e3116115be1d7fc12
|
/lisp/tests/set.scm
|
357d83e484318ee7dab87369c859cdfa9a11af17
|
[
"MIT"
] |
permissive
|
jorendorff/cell-gc
|
31d751a1d854248bb894a43c4d10a951e203cd6a
|
1d73457069b93b6af1adbfeb390ba1fbae8a291a
|
refs/heads/master
| 2021-07-12T10:24:19.880104 | 2017-12-13T16:11:33 | 2017-12-13T16:11:33 | 49,678,729 | 62 | 5 | null | 2017-11-14T19:35:38 | 2016-01-14T22:12:58 |
Pascal
|
UTF-8
|
Scheme
| false | false | 145 |
scm
|
set.scm
|
(define x 1)
(assert (eq? x 1))
(set! x 2)
(assert (eq? x 2))
((lambda (x)
(assert (eq? x 3))
(set! x (+ x 1))
(assert (eq? x 4)))
3)
| false |
6c36c266ab011a88bf676bb70076181c3b3ffc21
|
c74dcb1facbd920d762017345171f47f8e41d0c5
|
/chapter_1/fixed_point.scm
|
b34b8ca8bcb489d8097b06468e1776a19d8bbf8e
|
[] |
no_license
|
akash-akya/sicp-exercises
|
5125c1118c7f0e4400cb823508797fb67c745592
|
c28f73719740c2c495b7bc38ee8b790219482b67
|
refs/heads/master
| 2021-06-15T19:12:47.679967 | 2019-08-03T14:03:20 | 2019-08-03T14:03:20 | 136,158,517 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 334 |
scm
|
fixed_point.scm
|
#lang sicp
(define tolerance 0.00001)
(define (fixed-point f first-guess)
(define (closs-enough? x y)
(< (abs (- x y)) tolerance))
(define (try guess)
(let ((new-guess (f guess)))
(if (closs-enough? guess new-guess)
new-guess
(try (f new-guess)))))
(try first-guess))
(fixed-point cos 1)
| false |
00752d2e58685e05aef1e42390ef53762d1b91e3
|
ece1c4300b543df96cd22f63f55c09143989549c
|
/Chapter3/Exercise3.22.scm
|
07618fcbfc859ecaa5cac2e0c4b160855781af8e
|
[] |
no_license
|
candlc/SICP
|
e23a38359bdb9f43d30715345fca4cb83a545267
|
1c6cbf5ecf6397eaeb990738a938d48c193af1bb
|
refs/heads/master
| 2022-03-04T02:55:33.594888 | 2019-11-04T09:11:34 | 2019-11-04T09:11:34 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 2,605 |
scm
|
Exercise3.22.scm
|
; Exercise 3.22: Instead of representing a queue as a pair of pointers, we can build a queue as a procedure with local state. The local state will consist of pointers to the beginning and the end of an ordinary list. Thus, the make-queue procedure will have the form
; (define (make-queue)
; (let ((front-ptr … )
; (rear-ptr … ))
; ⟨definitions of internal procedures⟩
; (define (dispatch m) …)
; dispatch))
; Complete the definition of make-queue and provide implementations of the queue operations using this representation.
(define (make-queue)
(let ((front-ptr '())
(rear-ptr '()))
(define (set-front-ptr! i)
(set! front-ptr i)
)
(define (set-rear-ptr! i)
(set! rear-ptr i)
)
(define (dispatch m)
(cond
((eq? m 'front-ptr) front-ptr)
((eq? m 'rear-ptr) rear-ptr)
((eq? m 'set-front-ptr!) set-front-ptr!)
((eq? m 'set-rear-ptr!) set-rear-ptr!)
(else (error "unknow"))
)
)
dispatch))
(define (front-ptr q)
(q 'front-ptr)
)
(define (rear-ptr q)
(q 'rear-ptr)
)
(define (set-front-ptr! q i)
((q 'set-front-ptr!) i)
)
(define (set-rear-ptr! q i)
((q 'set-rear-ptr!) i)
)
(define (empty-queue? queue)
(null? (front-ptr queue)))
(define (front-queue queue)
(if (empty-queue? queue)
(error "FRONT called with an
empty queue" queue)
(car (front-ptr queue))))
(define (insert-queue! queue item)
(let ((new-pair (cons item '())))
(cond ((empty-queue? queue)
(set-front-ptr! queue new-pair)
(set-rear-ptr! queue new-pair)
queue)
(else (set-cdr! (rear-ptr queue)
new-pair)
(set-rear-ptr! queue new-pair)
queue))))
(define (delete-queue! queue)
(cond ((empty-queue? queue)
(error "DELETE! called with
an empty queue" queue))
(else (set-front-ptr!
queue
(cdr (front-ptr queue)))
queue)))
(define (print_queue q)
(display (front-ptr q))(newline))
(define q1 (make-queue))
(insert-queue! q1 'a)
(print_queue q1)
(insert-queue! q1 'b)
(print_queue q1)
(insert-queue! q1 'c)
(print_queue q1)
(delete-queue! q1)
(print_queue q1)
(delete-queue! q1)
(print_queue q1)
(delete-queue! q1)
(print_queue q1)
; Welcome to DrRacket, version 6.7 [3m].
; Language: SICP (PLaneT 1.18); memory limit: 128 MB.
; #<procedure>
; (a)
; #<procedure>
; (a b)
; #<procedure>
; (a b c)
; #<procedure>
; (b c)
; #<procedure>
; (c)
; #<procedure>
; ()
; >
| false |
af1c3409e2caa0e8aa58053621672203cbc2d0a6
|
4fd95c081ccef6afc8845c94fedbe19699b115b6
|
/chapter_2/2.60.scm
|
7acdef58bc5fc02dc51c76f06aa9630436ad9909
|
[
"MIT"
] |
permissive
|
ceoro9/sicp
|
61ff130e655e705bafb39b4d336057bd3996195d
|
7c0000f4ec4adc713f399dc12a0596c770bd2783
|
refs/heads/master
| 2020-05-03T09:41:04.531521 | 2019-08-08T12:14:35 | 2019-08-08T12:14:35 | 178,560,765 | 1 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 975 |
scm
|
2.60.scm
|
(define (element-of-set? x set)
(cond ((null? set) #f)
((equal? x (car set)) #t)
(else (element-of-set? x (cdr set)))))
(define (addjoin-set x set) (cons x set))
(define (intersection-set set1 set2)
(define (handle s1 s2)
(cond ((or (null? s1) (null? s2)) '())
((element-of-set? (car s1) s2)
(cons (car s1) (handle (cdr s1) s2)))
(else (handle (cdr s1) s2))))
(define inner (handle set1 set2)) ; get items from first set, which presence in 2nd one
(filter
(lambda (x) (element-of-set? x inner))
(union-set set1 set2)))
(define (union-set set1 set2) (append set1 set2))
(define set1 (list 1 2 3 4))
(display "set1 = ")
(display set1)
(newline)
(define set2 (list 1 2 5))
(display "set2 = ")
(display set2)
(newline)
(newline)
(display "Intersection: ")
(display (intersection-set set1 set2))
(newline)
(display "Union: ")
(display (union-set set1 set2))
| false |
95a150b120c389f4823f3e94df0aee6aff94f467
|
5355071004ad420028a218457c14cb8f7aa52fe4
|
/3.3/e-3.23.scm
|
5a0f48ee9cdd89d83f99023206a4dc9b6a33630e
|
[] |
no_license
|
ivanjovanovic/sicp
|
edc8f114f9269a13298a76a544219d0188e3ad43
|
2694f5666c6a47300dadece631a9a21e6bc57496
|
refs/heads/master
| 2022-02-13T22:38:38.595205 | 2022-02-11T22:11:18 | 2022-02-11T22:11:18 | 2,471,121 | 376 | 90 | null | 2022-02-11T22:11:19 | 2011-09-27T22:11:25 |
Scheme
|
UTF-8
|
Scheme
| false | false | 4,139 |
scm
|
e-3.23.scm
|
; Exercise 3.23.
;
; A deque (``double-ended queue'') is a sequence
; in which items can be inserted and deleted at either the front
; or the rear. Operations on deques are the constructor
; make-deque, the predicate empty-deque?, selectors front-deque
; and rear-deque, and mutators front-insert-deque!,
; rear-insert-deque!, front-delete-deque!, and rear-delete-deque!.
; Show how to represent deques using pairs, and give
; implementations of the operations. All operations should be
; accomplished in (1) steps.
; ------------------------------------------------------------
(load "../helpers.scm")
(define (make-deque)
(let ((front-ptr '())
(rear-ptr '()))
; makes queue element that contains item and pair of pointers
; to previous (cadr) and next (cddr) elements
(define (make-deque-element item)
(cons item (cons '() '())))
(define (empty-deque?) (null? front-ptr))
(define (front-deque)
(if (empty-deque?)
(error "FRONT called with and empty deque")
(car front-ptr)))
(define (rear-deque)
(if (empty-deque?)
(error "REAR can not be called with empty deque")
(car rear-ptr)))
(define (front-insert-deque! item)
(let ((new-pair (make-deque-element item)))
(cond ((empty-deque?)
(set! front-ptr new-pair)
(set! rear-ptr new-pair))
(else
; configure pointers
(set! (cddr new-pair) front-ptr)
(set! (cadr front-ptr) new-pair)
(set! front-ptr new-pair)
front-ptr))))
(define (rear-insert-deque! item)
(let ((new-pair (make-deque-element item)))
(cond ((empty-deque?)
(set! front-ptr new-pair)
(set! rear-ptr new-pair))
(else
; configure pointers
(set! (cddr rear-ptr) new-pair)
(set! (cadr new-pair) rear-ptr)
(set! rear-ptr new-pair)
rear-ptr))))
(define (front-delete-deque!)
(cond ((empty-queue?)
(error "DELETE! called on the empty queue"))
(else
(set! front-ptr (cddr front-ptr))
front-ptr)))
; here I experienced the need to have back pointer to cddrious pair
; in order to make it possible to remove last one in O(1) steps
(define (rear-delete-deque!)
(cond ((empty-queue?)
(error "DELETE! called on the empty queue"))
(else
(set! rear-ptr (cadr rear-ptr))
rear-ptr)))
; returns list of only items from front to rear
(define (front-item-list ptr)
(if (eq? rear-ptr ptr)
(list (car ptr)) ; just get the value of last
(cons (car ptr) (front-item-list (cddr ptr)))))
; returns list of only items from rear to front
(define (rear-item-list ptr)
(if (eq? front-ptr ptr)
(list (car ptr)) ; just get the value of last
(cons (car ptr) (rear-item-list (cadr ptr)))))
(define (dispatch m)
(cond ((eq? m 'empty-deque?) (empty-deque?))
((eq? m 'front-deque) (front-deque))
((eq? m 'rear-deque) (rear-deque))
((eq? m 'front-insert-deque!) front-insert-deque!)
((eq? m 'rear-insert-deque!) rear-insert-deque!)
((eq? m 'front-delete-deque!) (front-delete-deque!))
((eq? m 'rear-delete-deque!) (rear-delete-deque!))
((eq? m 'front-list) (front-item-list front-ptr))
((eq? m 'rear-list) (rear-item-list rear-ptr))
(else
(error "Wrong message for queue"))))
dispatch))
; testing a bit
(define dq (make-deque))
((dq 'front-insert-deque!) 5)
((dq 'front-insert-deque!) 6)
((dq 'front-insert-deque!) 7)
((dq 'front-insert-deque!) 8)
((dq 'front-insert-deque!) 9)
(output (dq 'front-list))
(output (dq 'rear-list))
(define dq (make-deque))
((dq 'rear-insert-deque!) 5)
((dq 'rear-insert-deque!) 6)
((dq 'rear-insert-deque!) 7)
((dq 'rear-insert-deque!) 8)
((dq 'rear-insert-deque!) 9)
(output (dq 'rear-list))
(output (dq 'front-list))
| false |
d905092a0eaf14a63dd7a5f166a76fd1ee74ad16
|
8a0660bd8d588f94aa429050bb8d32c9cd4290d5
|
/ext/threads/threads_stub.stub
|
4bd47525b08d034c5ab4fa6a8e9c55adff39becc
|
[
"BSD-2-Clause"
] |
permissive
|
david135/sagittarius-scheme
|
dbec76f6b227f79713169985fc16ce763c889472
|
2fbd9d153c82e2aa342bfddd59ed54d43c5a7506
|
refs/heads/master
| 2016-09-02T02:44:31.668025 | 2013-12-21T07:24:08 | 2013-12-21T07:24:08 | 32,497,456 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 4,792 |
stub
|
threads_stub.stub
|
;; -*- scheme -*-
#!compatible
(decl-code
(.include <sagittarius.h>)
(.define "LIBSAGITTARIUS_EXT_BODY")
(.include <sagittarius/extend.h>
"threads.h"))
(define-cise-stmt assertion-violation
((_ who msg)
`(begin
(Sg_AssertionViolation ,who (SG_MAKE_STRING ,msg) '())))
((_ who msg irritants)
`(begin
(Sg_AssertionViolation ,who (SG_MAKE_STRING ,msg) ,irritants)
)))
(define-cise-stmt wrong-type-of-argument-violation
((_ who msg got)
`(begin
(Sg_WrongTypeOfArgumentViolation ,who (SG_MAKE_STRING ,msg) ,got '())))
((_ who msg got irritants)
`(begin
(Sg_WrongTypeOfArgumentViolation ,who (SG_MAKE_STRING ,msg) ,got ,irritants))))
(define-type <mutex> "SgMutex*")
(define-type <condition-variable> "SgConditionVariable*")
;; thread is VM
(define-c-proc thread? (obj) ::<boolean>
(result (SG_VMP obj)))
(define-c-proc make-thread (thunk::<procedure>
:optional (name (Sg_Gensym
(SG_STRING
(SG_MAKE_STRING "thread-")))))
(result (Sg_MakeThread thunk name)))
(define-c-proc thread-name (obj::<thread>)
(result (-> obj name)))
(define-c-proc thread-specific-set! (obj::<thread> value) ::<void>
(set! (-> obj specific) value))
(define-c-proc thread-specific (obj::<thread>)
(result (-> obj specific)))
(define-c-proc thread-state (vm::<thread>)
(let ((state::int (-> vm threadState)))
(cond ((== SG_VM_NEW state) (result 'new))
((== SG_VM_RUNNABLE state) (result 'runnable))
((== SG_VM_STOPPED state) (result 'stopped))
((== SG_VM_TERMINATED state) (result 'terminated))
(else (Sg_Error
(UC "[internal] thread state has invalid value: %d") state)
(result SG_UNDEF)))))
(define-c-proc current-thread ()
(result (Sg_VM)))
;;(define-c-proc thread-base-priority (vm::<thread>)
(define-c-proc thread-start! (vm::<thread>)
(result (Sg_ThreadStart vm)))
(define-c-proc thread-join! (vm::<thread> :optional (timeout #f) timeoutval)
(result (Sg_ThreadJoin vm timeout timeoutval)))
(define-c-proc thread-yield! () ::<void>
(Sg_YieldCPU))
(define-c-proc thread-sleep! (time::<integer>) ::<void>
(Sg_ThreadSleep time))
(define-c-proc thread-stop! (vm::<thread> :optional (timeout #f) timeoutval)
(result (Sg_ThreadStop vm timeout timeoutval)))
(define-c-proc thread-cont! (vm::<thread>)
(result (Sg_ThreadCont vm)))
(define-c-proc thread-terminate! (vm::<thread>) ::<void>
(Sg_ThreadTerminate vm))
(define-c-proc mutex? (o) ::<boolean>
(result (SG_MUTEXP o)))
(define-c-proc make-mutex
(:optional (name (Sg_Gensym (SG_STRING (SG_MAKE_STRING "mutex-")))))
(result (Sg_MakeMutex name)))
(define-c-proc mutex-name (o::<mutex>)
(result (-> (SG_MUTEX o) name)))
(define-c-proc mutex-state (o::<mutex>)
(result (Sg_MutexState (SG_MUTEX o))))
(define-c-proc mutex-specific (o::<mutex>)
(result (-> (SG_MUTEX o) specific)))
(define-c-proc mutex-specific-set! (o::<mutex> value) ::<void>
(set! (-> (SG_MUTEX o) specific) value))
(define-c-proc mutex-lock! (o::<mutex> :optional (timeout #f) thread)
(let ((owner::SgVM* NULL))
(cond ((SG_VMP thread) (set! owner (SG_VM thread)))
((SG_UNBOUNDP thread) (set! owner (Sg_VM)))
((not (SG_FALSEP thread))
(wrong-type-of-argument-violation 'mutex-lock!
"thread or #f"
thread)))
(result (Sg_MutexLock (SG_MUTEX o) timeout owner))))
(define-c-proc mutex-unlock! (o::<mutex> :optional (cv #f) (timeout #f))
(let ((cond::SgConditionVariable* NULL))
(cond ((SG_CONDITION_VARIABLE_P cv) (set! cond (SG_CONDITION_VARIABLE cv)))
((not (SG_FALSEP cv))
(wrong-type-of-argument-violation 'mutex-unlock!
"condition variable or #f"
cv)))
(result (Sg_MutexUnlock (SG_MUTEX o) cond timeout))))
(define-c-proc condition-variable? (o) ::<boolean>
(result (SG_CONDITION_VARIABLE_P o)))
(define-c-proc make-condition-variable
(:optional (name (Sg_Gensym (SG_STRING (SG_MAKE_STRING "cv-")))))
(result (Sg_MakeConditionVariable name)))
(define-c-proc condition-variable-name (cv::<condition-variable>)
(result (-> (SG_CONDITION_VARIABLE cv) name)))
(define-c-proc condition-variable-specific (cv::<condition-variable>)
(result (-> (SG_CONDITION_VARIABLE cv) specific)))
(define-c-proc condition-variable-specific-set!
(cv::<condition-variable> value) ::<void>
(set! (-> (SG_CONDITION_VARIABLE cv) specific) value))
(define-c-proc condition-variable-signal! (cv::<condition-variable>) ::<void>
(Sg_ConditionVariableSignal (SG_CONDITION_VARIABLE cv)))
(define-c-proc condition-variable-broadcast!
(cv::<condition-variable>) ::<void>
(Sg_ConditionVariableBroadcast (SG_CONDITION_VARIABLE cv)))
(define-c-proc sys-nanosleep (n::<number>)
(result (Sg_MakeInteger (Sg_SysNanosleep (Sg_GetDouble n)))))
| false |
be8de9a7d996e52eda09e7493447ca1b44d21a9b
|
20301174b79a1ad6a3566c852fcb077e90133caa
|
/scheme/texinfo/private/warn.scm
|
1c10e4f84cf31d1c02683592e74e2bd1a7e81eeb
|
[] |
no_license
|
rotty/texinfo
|
4e6d12ec9e3047d0858614fd5a6851c89e7b7f62
|
362a147831ba3ae8926eea6af33b2708d79e05dd
|
refs/heads/master
| 2020-12-24T13:29:22.753453 | 2011-07-28T21:10:04 | 2011-07-28T21:16:36 | 211,721 | 5 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 253 |
scm
|
warn.scm
|
(define texinfo-warn-handler
(make-parameter (lambda (msg)
(format (current-error-port) "texinfo warning: ~s~%" msg))))
(define (texinfo-warn msg)
((texinfo-warn-handler) msg))
;; arch-tag: d5ebfe37-c23a-406f-8e92-8478bc637650
| false |
fa12f68fde2eddce48316b8528644f96a02f75c0
|
08b21a94e7d29f08ca6452b148fcc873d71e2bae
|
/src/loki/core/process.sld
|
8ee16ea0115d753e4e573ef0a68770077f80338a
|
[
"MIT"
] |
permissive
|
rickbutton/loki
|
cbdd7ad13b27e275bb6e160e7380847d7fcf3b3a
|
7addd2985de5cee206010043aaf112c77e21f475
|
refs/heads/master
| 2021-12-23T09:05:06.552835 | 2021-06-13T08:38:23 | 2021-06-13T08:38:23 | 200,152,485 | 21 | 1 |
NOASSERTION
| 2020-07-16T06:51:33 | 2019-08-02T02:42:39 |
Scheme
|
UTF-8
|
Scheme
| false | false | 632 |
sld
|
process.sld
|
(define-library (loki core process)
(import (loki core primitives))
(import (loki core let))
(import (loki core intrinsics))
(import (loki core list))
(import (rename (loki core intrinsics) (%command-line command-line) (%emergency-exit emergency-exit)))
(export command-line get-environment-variables get-environment-variable
emergency-exit exit)
(begin
(define (get-environment-variables) (list-copy %environment-variables))
(define (get-environment-variable name)
(let ((var (assoc name (get-environment-variables))))
(if var (cdr var) #f)))
(define exit emergency-exit)
))
| false |
e9aaa8d7847c7c76dc9e906dc39260de5be11156
|
432924338995770f121e1e8f6283702653dd1369
|
/2/p2.59.scm
|
be781e6e1b88438013a29d588cb89f0e7766da78
|
[] |
no_license
|
punchdrunker/sicp-reading
|
dfaa3c12edf14a7f02b3b5f4e3a0f61541582180
|
4bcec0aa7c514b4ba48e677cc54b41d72c816b44
|
refs/heads/master
| 2021-01-22T06:53:45.096593 | 2014-06-23T09:51:27 | 2014-06-23T09:51:27 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 895 |
scm
|
p2.59.scm
|
(use gauche.test)
(load "./2.3.3-1.scm")
; 問題2.59
; 2つの集合の和集合(どちらかの集合に含まれている要素全ての集合)を返す
(define (union-set set1 set2)
(cond ((null? set1) set2)
; (car set1)がset2に含まれていれば(cdr set1)とset2で再帰
((element-of-set? (car set1) set2)
(union-set (cdr set1) set2))
; (car set1)がset2に含まれていなければset2に(car set1)をaddして(cdr set1)とset2で再帰
(else (cons (car set1) (union-set (cdr set1) set2)))))
;(trace element-of-set?)
;(trace union-set)
(test-start "問題2.59")
(test-section " union-setを実装せよ")
(test* "(union-set '(a b c) '(b c d))" '(a b c d) (union-set '(a b c) '(b c d)))
(test* "(union-set '() '(b c d))" '(b c d) (union-set '() '(b c d)))
(test* "(union-set '(a b c) '())" '(a b c) (union-set '(a b c) '()))
(test-end)
| false |
a23c16de1b975ae0db2948bf1dd7594b8ff4cfca
|
928e706795455cddbacba32cf039aa04e1576963
|
/compiler/src/p06_reduce.sld
|
d9a93aa09af45affc9e45a5ca5d6a2a89e8c6819
|
[
"MIT"
] |
permissive
|
zaoqi-clone/loki
|
a26931aa773df35601099e59695a145a8cacf66c
|
a0edd3933a1d845d712b977a47504c8751a6201f
|
refs/heads/master
| 2020-07-01T21:52:28.446404 | 2019-08-08T02:31:46 | 2019-08-08T02:31:46 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 143 |
sld
|
p06_reduce.sld
|
(define-library
(p06_reduce)
(import (scheme base))
(import (util))
(import (shared))
(export p06_reduce)
(begin
(define (p06_reduce x) x)))
| false |
23b3c0c57d0db6ae7af2c2d2dac9a3db5d036dd0
|
a74932f6308722180c9b89c35fda4139333703b8
|
/edwin48/lspcom.scm
|
b2bfb20aa4af5ffc939cd526651af333b14bdbd5
|
[] |
no_license
|
scheme/edwin48
|
16b5d865492db5e406085e8e78330dd029f1c269
|
fbe3c7ca14f1418eafddebd35f78ad12e42ea851
|
refs/heads/master
| 2021-01-19T17:59:16.986415 | 2014-12-21T17:50:27 | 2014-12-21T17:50:27 | 1,035,285 | 39 | 10 | null | 2022-02-15T23:21:14 | 2010-10-29T16:08:55 |
Scheme
|
UTF-8
|
Scheme
| false | false | 9,274 |
scm
|
lspcom.scm
|
#| -*-Scheme-*-
$Id: lspcom.scm,v 1.167 2008/01/30 20:02:03 cph Exp $
Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994,
1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
2006, 2007, 2008 Massachusetts Institute of Technology
This file is part of MIT/GNU Scheme.
MIT/GNU Scheme is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at
your option) any later version.
MIT/GNU Scheme is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with MIT/GNU Scheme; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301,
USA.
|#
;;;; Lisp Commands
;;;; S-expression Commands
(define-command forward-sexp
"Move forward across one balanced expression.
With argument, do this that many times."
"p"
(lambda (argument)
(move-thing forward-sexp argument 'ERROR)))
(define-command backward-sexp
"Move backward across one balanced expression.
With argument, do this that many times."
"p"
(lambda (argument)
(move-thing backward-sexp argument 'ERROR)))
(define-command flash-sexp
"Flash the char which ends the expression to the right of point.
Shows you where \\[forward-sexp] would go."
"p"
(lambda (argument)
(mark-flash (forward-sexp (current-point) argument)
(if (negative? argument) 'RIGHT 'LEFT))))
(define-command backward-flash-sexp
"Flash the char which starts the expression to the left of point.
Shows you where \\[backward-sexp] would go."
"p"
(lambda (argument)
(mark-flash (backward-sexp (current-point) argument)
(if (negative? argument) 'LEFT 'RIGHT))))
(define-command kill-sexp
"Kill the syntactic expression following the cursor.
With argument, kill that many expressions after (or before) the cursor."
"p"
(lambda (argument)
(kill-thing forward-sexp argument 'ERROR)))
(define-command backward-kill-sexp
"Kill the syntactic expression preceding the cursor.
With argument, kill that many expressions before (or after) the cursor."
"p"
(lambda (argument)
(kill-thing backward-sexp argument 'ERROR)))
(define-command transpose-sexps
"Transpose the sexps before and after point.
See \\[transpose-words], reading 'sexp' for 'word'."
"p"
(lambda (argument)
(transpose-things forward-sexp argument)))
(define-command mark-sexp
"Mark one or more sexps from point."
"p"
(lambda (argument)
(mark-thing forward-sexp argument 'ERROR)))
;;;; List Commands
(define-command forward-list
"Move forward across one balanced group of parentheses.
With argument, do this that many times."
"p"
(lambda (argument)
(move-thing forward-list argument 'ERROR)))
(define-command backward-list
"Move backward across one balanced group of parentheses.
With argument, do this that many times."
"p"
(lambda (argument)
(move-thing backward-list argument 'ERROR)))
(define-command down-list
"Move forward down one level of parentheses.
With argument, do this that many times.
A negative argument means move backward but still go down a level."
"p"
(lambda (argument)
(move-thing forward-down-list argument 'ERROR)))
(define-command backward-down-list
"Move backward down one level of parentheses.
With argument, do this that many times.
A negative argument means move forward but still go down a level."
"p"
(lambda (argument)
(move-thing backward-down-list argument 'ERROR)))
(define-command up-list
"Move forward out one level of parentheses.
With argument, do this that many times.
A negative argument means move backward but still to a less deep spot."
"p"
(lambda (argument)
(move-thing forward-up-list argument 'ERROR)))
(define-command backward-up-list
"Move backward out one level of parentheses.
With argument, do this that many times.
A negative argument means move forward but still to a less deep spot."
"p"
(lambda (argument)
(move-thing backward-up-list argument 'ERROR)))
;;;; Definition Commands
(define-command beginning-of-defun
"Move backward to next beginning-of-defun.
With argument, do this that many times."
"p"
(lambda (argument)
(move-thing backward-definition-start argument 'ERROR)))
(define-command end-of-defun
"Move forward to next end of defun.
An end of a defun is found by moving forward from the beginning of one."
"p"
(lambda (argument)
(move-thing forward-definition-end
(if (zero? argument) 1 argument)
'ERROR)))
(define-command mark-defun
"Put mark at end of defun, point at beginning."
()
(lambda ()
(let ((point (current-point)))
(let ((end (forward-definition-end point 1 'ERROR)))
(let ((start (backward-definition-start end 1 'ERROR)))
(push-current-mark! point)
(push-current-mark! end)
(set-current-point!
(or (and (not (group-start? start))
(re-search-backward "^\n" start (mark-1+ start)))
start)))))))
(define-command align-defun
"Reposition window so current defun is at the top.
If this would place point off screen, nothing happens."
()
(lambda ()
(reposition-window-top (current-definition-start))))
(define (current-definition-start)
(or (this-definition-start (current-point))
(error "Not inside a definition.")))
(define (this-definition-start mark)
(let ((start (line-start mark 0)))
(if (definition-start? start)
start
(backward-one-definition-start start))))
;;;; Miscellaneous Commands
(define-command lisp-insert-paren
"Insert one or more close parens, flashing the matching open paren."
"p"
(lambda (argument)
(let ((key (current-command-key)))
(if (char? key)
(begin
(insert-chars key argument)
(if (positive? argument)
(let ((point (current-point)))
(if (not (mark-left-char-quoted? point))
(mark-flash (backward-one-sexp point) 'RIGHT)))))))))
(define-command lisp-indent-line
"Indent current line as lisp code.
With argument, indent any additional lines of the same expression
rigidly along with this one."
"P"
(lambda (#!optional argument)
(lisp-indent-line (and (not (default-object? argument)) argument))))
(define-command indent-sexp
"Indent each line of the expression starting just after the point."
"d"
(lambda (mark)
(lisp-indent-sexp mark)))
(define-command insert-parentheses
"Put parentheses around next ARG sexps. Leave point after open-paren.
No argument is equivalent to zero: just insert () and leave point between."
"P"
(lambda (argument)
(if argument
(set-current-point! (skip-chars-forward " \t"))
(or (group-start? (current-point))
(memv (char->syntax-code standard-char-syntax-table
(mark-left-char (current-point)))
'(#\\ #\> #\( #\space #\.))
(insert-char #\space)))
(insert-char #\()
(let ((mark (mark-right-inserting-copy (current-point))))
(insert-char #\)
(if (and argument
(exact-nonnegative-integer? argument))
(forward-sexp (current-point) argument 'LIMIT)
(current-point)))
(or argument
(group-end? (current-point))
(memv (char->syntax-code standard-char-syntax-table
(mark-right-char (current-point)))
'(#\\ #\> #\( #\) #\space))
(insert-char #\space))
(set-current-point! mark))))
(define-command move-past-close-and-reindent
"Move past next ), delete indentation before it, then indent after it."
()
(lambda ()
((ref-command up-list) 1)
((ref-command backward-char) 1)
(do () ((not (within-indentation? (current-point))))
((ref-command delete-indentation) #f))
((ref-command forward-char) 1)
((ref-command newline-and-indent))))
;;;; Motion Covers
(define forward-sexp)
(define backward-sexp)
(make-motion-pair forward-one-sexp backward-one-sexp
(lambda (f b)
(set! forward-sexp f)
(set! backward-sexp b)
unspecific))
(define forward-list)
(define backward-list)
(make-motion-pair forward-one-list backward-one-list
(lambda (f b)
(set! forward-list f)
(set! backward-list b)
unspecific))
(define forward-down-list)
(define backward-down-list)
(make-motion-pair forward-down-one-list backward-down-one-list
(lambda (f b)
(set! forward-down-list f)
(set! backward-down-list b)
unspecific))
(define forward-up-list)
(define backward-up-list)
(make-motion-pair forward-up-one-list backward-up-one-list
(lambda (f b)
(set! forward-up-list f)
(set! backward-up-list b)
unspecific))
(define forward-definition-start)
(define backward-definition-start)
(make-motion-pair forward-one-definition-start backward-one-definition-start
(lambda (f b)
(set! forward-definition-start f)
(set! backward-definition-start b)
unspecific))
(define forward-definition-end)
(define backward-definition-end)
(make-motion-pair forward-one-definition-end backward-one-definition-end
(lambda (f b)
(set! forward-definition-end f)
(set! backward-definition-end b)
unspecific))
| false |
8f41de1172574167d89a2aee0a575647c4b64d79
|
fb93352482541f4269387c5872b9f1124a9182d3
|
/ng/chapter01/sicp-1.31.ss
|
61ffbeb68660f4c9bf2248bd48b1984150a56a6c
|
[] |
no_license
|
sicper/sicp-solutions
|
bfb5bd0f9f6eba0b396af88a4b5a2834ccfc5054
|
b79c3d9f193fbec26b5302f03de6dabd473203cf
|
refs/heads/master
| 2021-01-14T13:42:47.796733 | 2016-01-04T05:03:48 | 2016-01-04T05:03:48 | 38,525,815 | 1 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 842 |
ss
|
sicp-1.31.ss
|
;; define product
(define (product term a next b)
(if (> a b)
1.0
(* (term a)
(product term (next a) next b))))
(define (fact n)
(product (lambda (x) x)
1
(lambda (a) (+ a 1))
n))
(define (pi)
(define (help i a b)
(cond ((= i 1) (/ a b))
((even? i) (help (- i 1)
(+ a 2)
b))
(else (help (- i 1)
a
(+ b 2)))))
(define (term a)
(help a 2.0 3.0))
(define (next x)
(+ x 1))
(define (pi-n n)
(product term 1 next n))
(* 4 (pi-n 1000)))
(define (product-iter term a next b acc)
(if (> a b)
acc
(product-iter term
(next a)
b
(* (term a)
acc))))
| false |
2e9c2496ee7a2f1c182833a12896b74a6dd2a18d
|
185024f40e1ceed452781a1f3f57e6d16f57d799
|
/check-api.ss
|
eb62d78236669824e03d71d2e806b675a093c454
|
[] |
no_license
|
noelwelsh/numeric
|
b82cd4ca9e4afb18df0129ec2231fc03f9b66450
|
ac4488cf8cc6f0558f74ca9b8faad0f198e76a84
|
refs/heads/master
| 2021-01-18T21:32:27.393991 | 2010-02-22T14:05:19 | 2010-02-22T14:05:19 | 275,898 | 1 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 689 |
ss
|
check-api.ss
|
#lang scheme/base
(require (planet schematics/schemeunit:3)
"unet.ss")
(define-unet define-checks
(import in-vector
vector-length)
(export check-vector=)
(define (check-vector= v1 v2 epsilon)
(with-check-info
(['message "Unequal length"])
(check-eq? (vector-length v1) (vector-length v2)))
(for ([i (in-range (vector-length v1))]
[x1 (in-vector v1)]
[x2 (in-vector v2)])
(with-check-info
(['message (format "Elements ~a and ~a at index ~a are not within ~a"
x1 x2 i epsilon)])
(check <= (abs (- x1 x2)) epsilon))))
)
(provide define-checks)
| false |
ec69f2f1d1eabaeeffd8d283303a06d14c1db43e
|
ec5b4a92882f80b3f62eac8cbd059fb1f000cfd9
|
/higher-order/!tests/union.ss
|
7429a84bedc0ce907e6def1b00b600029197f284
|
[] |
no_license
|
ggem/alpa
|
ee35ffc91d9f4b1d540ce8b2207595813e488e5f
|
4f53b888b5a5b4ffebd220c6e0458442325fbff2
|
refs/heads/master
| 2019-01-02T03:12:17.899768 | 2005-01-04T03:43:12 | 2005-01-04T03:43:12 | 42,612,681 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 379 |
ss
|
union.ss
|
;;;
;;;
;;;
(define union
(lambda (set1 set2)
(if (null? set1)
set2
(let ([rr (union (cdr set1) set2)])
(if (member? (car set1) set2)
rr
(cons (car set1) rr))))))
(define member?
(lambda (item ls)
(if (null? ls)
#f
(if (eq? item (car ls))
#t
(member? item (cdr ls))))))
'(union (make-list size 'unknown) (make-list size 'unknown))
| false |
85dba4bf15fff73b2bd5359ab9f3b04c48edf90e
|
6f86602ac19983fcdfcb2710de6e95b60bfb0e02
|
/input/exercises/difference-of-squares/test.ss
|
72ff8b9642a1daf3a258c7e58f38effbcf70093b
|
[
"MIT",
"CC-BY-SA-3.0"
] |
permissive
|
exercism/scheme
|
a28bf9451b8c070d309be9be76f832110f2969a7
|
d22a0f187cd3719d071240b1d5a5471e739fed81
|
refs/heads/main
| 2023-07-20T13:35:56.639056 | 2023-07-18T08:38:59 | 2023-07-18T08:38:59 | 30,056,632 | 34 | 37 |
MIT
| 2023-09-04T21:08:27 | 2015-01-30T04:46:03 |
Scheme
|
UTF-8
|
Scheme
| false | false | 1,298 |
ss
|
test.ss
|
(define (parse-test test)
`(test-success ,(lookup 'description test)
=
,(let ((proc (lookup 'property test)))
(cond ((string=? proc "sumOfSquares")
'sum-of-squares)
((string=? proc "differenceOfSquares")
'difference-of-squares)
((string=? proc "squareOfSum")
'square-of-sum)
(else (error 'parse-test "oops" proc))))
'(,(cdar (lookup 'input test)))
,(lookup 'expected test)))
(define (spec->tests spec)
(map parse-test
(apply append
(map (lookup 'cases)
(map cdr
(lookup 'cases
(get-test-specification
'difference-of-squares)))))))
(let ((spec (get-test-specification 'difference-of-squares)))
(put-problem!
'difference-of-squares
`((test . ,(spec->tests spec))
(version . ,(lookup 'version spec))
(skeleton . "difference-of-squares.scm")
(solution . "example.scm")
(stubs sum-of-squares difference-of-squares square-of-sum)
(markdown . ,(splice-exercism 'difference-of-squares)))))
| false |
279f82d7f1d2cd9dfd878b9594f463040f81f68a
|
bdcc255b5af12d070214fb288112c48bf343c7f6
|
/scheme/case-lambda.sls
|
463158929a6945ddbe1dae0fb925a719a585b423
|
[] |
no_license
|
xaengceilbiths/chez-lib
|
089af4ab1d7580ed86fc224af137f24d91d81fa4
|
b7c825f18b9ada589ce52bf5b5c7c42ac7009872
|
refs/heads/master
| 2021-08-14T10:36:51.315630 | 2017-11-15T11:43:57 | 2017-11-15T11:43:57 | 109,713,952 | 5 | 1 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 116 |
sls
|
case-lambda.sls
|
#!chezscheme
(library (scheme case-lambda)
(export case-lambda)
(import (r7b-impl case-lambda)))
| false |
682ecbb2e26c6f90fd710efda94ea03ab927e49a
|
0768e217ef0b48b149e5c9b87f41d772cd9917f1
|
/sitelib/srfi/%3a26/cut.scm
|
c55b292fbb8aa4a443b3c95c7e5301c8094865dd
|
[
"LicenseRef-scancode-unknown-license-reference",
"BSD-2-Clause"
] |
permissive
|
fujita-y/ypsilon
|
e45c897436e333cf1a1009e13bfef72c3fb3cbe9
|
62e73643a4fe87458ae100e170bf4721d7a6dd16
|
refs/heads/master
| 2023-09-05T00:06:06.525714 | 2023-01-25T03:56:13 | 2023-01-25T04:02:59 | 41,003,666 | 45 | 7 |
BSD-2-Clause
| 2022-06-25T05:44:49 | 2015-08-19T00:05:35 |
Scheme
|
UTF-8
|
Scheme
| false | false | 81 |
scm
|
cut.scm
|
#!nobacktrace
(library (srfi :26 cut) (export cut cute) (import (srfi srfi-26)))
| false |
095a45ca20adf4fc0bea6f01c0ebf1ffb270f50f
|
5f5bf90e51b59929b5e27a12657fade4a8b7f9cd
|
/old/neural_network/compiler.scm
|
307d67a20dbd8afa4ad2c31dc574f3740d409dd8
|
[] |
no_license
|
ashton314/NN_Chess
|
9ddd8ebc4a3594fcfe0b127ddd7309000eaa6594
|
f6c8295a622483641cdf883642723ee8e6e84e76
|
refs/heads/master
| 2020-04-25T04:16:00.493978 | 2014-01-01T22:24:01 | 2014-01-01T22:24:01 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 7,572 |
scm
|
compiler.scm
|
;;; Neural Network library, using macros
;;; Ashton Wiersdorf
;;; Part of the NN_Chess project
;; Macros
(load-option 'format)
(define-syntax push!
(syntax-rules ()
((push! datum place)
(set! place (cons datum place)))))
(define-syntax pop!
(syntax-rules ()
((pop! place)
(let ((temp1 (car place)))
(set! place (cdr place))
temp1))))
(define (activation value)
;; Sigmoid function
(/ 1 (+ 1 (exp (- value)))))
(define-syntax define-net
(syntax-rules ()
((define-net net-name (input-nodes ...) (output-nodes ...) _learning-rate (node-name (input weight) ...) ...)
(begin
(define net-name)
(let ((learning-rate _learning-rate) ; prevent multiple evaluation (does this happen with Scheme's macros?)
(nodes `((input-nodes (sym-name input-nodes)
(inputs ())
(outputs ())
(weights ())
(error-delta undef)
(value #f)) ...
(node-name (sym-name node-name)
(inputs (input ...))
(outputs ())
(value #f)
(error-delta #f)
(weights (weight ...))) ...)))
(for-each (lambda (node) ; initilize outputs
(set-car! (cdr (assoc 'outputs (cdr node)))
(map car (filter (lambda (other-node)
(memq (car node) (cadr (assoc 'inputs (cdr other-node))))) nodes))))
nodes)
(define-syntax getter-setter
(syntax-rules ()
((_ place)
(lambda (flag . rest)
(if (or (eq? flag 'get-raw)
(eq? flag 'get))
place
(if (eq? flag 'set!)
(set! place (car rest))
(error (format #f "Unknown option passed to node: ~A -- ~A" flag place))))))))
(set! nodes (map (lambda (node) ; compile pass
(let ((values (cdr node)))
(list (car node)
(let ((slot-sym-name (cadr (assoc 'sym-name values)))
(slot-inputs (cadr (assoc 'inputs values)))
(slot-outputs (cadr (assoc 'outputs values)))
(slot-weights (cadr (assoc 'weights values)))
(slot-error-delta (cadr (assoc 'error-delta values)))
(slot-value (cadr (assoc 'value values))))
(letrec ((this-node
(lambda (op)
(case op
((sym-name) (getter-setter slot-sym-name))
((inputs) (getter-setter slot-inputs))
((outputs) (getter-setter slot-outputs))
((weights) (getter-setter slot-weights))
((error-delta) (getter-setter slot-error-delta))
((value)
(lambda (op . rest)
(if (eq? op 'get-raw)
slot-value
(if (eq? op 'get)
(begin
(if slot-value slot-value
(let ((new-value (activation (apply + (map * (map (lambda (input-node)
((input-node 'value) 'get))
((this-node 'inputs) 'get))
((this-node 'weights) 'get))))))
(set! slot-value new-value)
new-value)))
(if (eq? op 'set!)
(set! slot-value (car rest))
(error (format #f "Unknown option passed to node: ~A -- value" op)))))))
(else (error (format #f "Unknown option to node: '~A'" op)))))))
this-node)))))
nodes))
(for-each (lambda (node) ; linker pass
((node 'inputs) 'set! (map (lambda (node) (cadr (assoc node nodes))) ((node 'inputs) 'get)))
((node 'outputs) 'set! (map (lambda (node) (cadr (assoc node nodes))) ((node 'outputs) 'get))))
(map cadr nodes))
(define (pretty-print-self)
(map (lambda (node) (pretty-print (list ((node 'sym-name) 'get)
(map (lambda (slot) (list slot ((node slot) 'get-raw)))
'(inputs outputs weights error-delta value))))
(newline))
(map cadr nodes)))
(define (back-prop node)
;; node => closure-object
(define (searcher search-nodes search-weights)
;; This takes a list of nodes and a list of weights,
;; which are mapped to eachother linearly. This finds the
;; weight associated with `node' (see above scope)
;; OPTIMIZATION NOTE: Node-weight lookup could be
;; improved through some complex mechanism in the linking
;; pass
(if (there-exists? (list search-nodes search-weights) null?)
(begin
(debug)
(error (format #f "could not find node ~A in inputs of an output node!" node)))
(if (eq? (car search-nodes) node)
(car search-weights)
(searcher (cdr search-nodes) (cdr search-weights)))))
(let ((bad-node (find-matching-item ((node 'outputs) 'get)
(lambda (out-node)
(not ((out-node 'error-delta) 'get))))))
(if bad-node ; one of this node's output nodes' error-delta has not been computed
(back-prop bad-node)
(begin
(if (or ((node 'error-delta) 'get)
(null? ((node 'inputs) 'get)))
#t ; already computed or not needed to correct
(let ((delta (let ((val ((node 'value) 'get)))
(* val (- 1 val)
(apply + (map (lambda (output-node)
(* ((output-node 'error-delta) 'get)
(searcher ((output-node 'inputs) 'get)
((output-node 'weights) 'get))))
((node 'outputs) 'get)))))))
((node 'error-delta) 'set! delta)
((node 'weights) 'set! (map (lambda (this-weight in-node)
(+ this-weight (* learning-rate delta ((in-node 'value) 'get))))
((node 'weights) 'get)
((node 'inputs) 'get)))))
(for-each back-prop ((node 'inputs) 'get))))))
(set! net-name
(lambda (op . input-values)
(case op
((run) ; inputs are in values
(for-each (lambda (node) ((node 'value) 'set! #f)) (map cadr nodes)) ; clear memoized values
(for-each (lambda (node) ((node 'value) 'set! (pop! input-values))) (map (lambda (sym) (cadr (assoc sym nodes)))
'(input-nodes ...)))
(map (lambda (sym) (((cadr (assoc sym nodes)) 'value) 'get)) '(output-nodes ...)))
((debug-nodes-pretty)
(map (lambda (node) (pretty-print (list ((node 'sym-name) 'get)
(map (lambda (slot) (list slot ((node slot) 'get-raw)))
'(inputs outputs weights error-delta value))))
(newline))
(map cadr nodes)))
((debug-nodes)
;; For debugging purposes
nodes)
((init)
;; Set node weights to random values
(for-each (lambda (node)
((node 'weights) 'set!
(map (lambda (nul) (random-real)) ((node 'weights) 'get))))
(map cadr nodes)))
((last-errors)
;; Returns error deltas of output nodes
(map (lambda (node) ((node 'error-delta) 'get)) (map (lambda (sym) (cadr (assoc sym nodes))) '(output-nodes ...))))
((train)
;; Run backprop algorithm on network
;; Inputs: (input1 input2 ...) (target1 target2 ...)
(for-each (lambda (node) ((node 'error-delta) 'set! #f)) (map cadr nodes)) ; clear error deltas
(let* ((inputs (car input-values))
(targets (cadr input-values))
(first-pass (apply net-name `(run ,@inputs)))
(deltas (map (lambda (output target) (* (- target output) (- 1 output) output)) first-pass targets)))
(for-each (lambda (node delta)
(let ((self-node (cadr (assoc node nodes))))
((self-node 'error-delta) 'set! delta)
((self-node 'weights) 'set!
(map (lambda (this-weight in-node)
(+ this-weight (* learning-rate delta ((in-node 'value) 'get))))
((self-node 'weights) 'get)
((self-node 'inputs) 'get)))
(for-each back-prop ((self-node 'inputs) 'get))))
'(output-nodes ...) deltas)))
(else
(error "bad operation on neural net"))))))))))
| true |
fdf2e7d37a37da8805798411990759a4477c7d6a
|
7b0df9640ae1b8e1172f0f90c5428b0802df8ed6
|
/looper/looper-module.scm
|
6057681abe0c62f585d64e19aec38d712dccf8b0
|
[] |
no_license
|
erosness/sm-server
|
5954edfc441e773c605d2ac66df60bb983be01a3
|
cc302551e19f6d2b889a41ec28801004b0b28446
|
refs/heads/master
| 2020-08-31T13:23:03.670076 | 2016-02-18T19:10:55 | 2016-02-18T19:10:55 | 218,699,588 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 67 |
scm
|
looper-module.scm
|
(module looper *
(import chicken scheme)
(include "looper.scm")
)
| false |
ccbe0d187efe86729f03b4663308cbf958fe1912
|
5c4964460d5d9fcb190a35457ace51ab914ef3ff
|
/section-1.1.scm
|
9d54ddd7d835cb56d3785c70892f309fc498e075
|
[] |
no_license
|
lmcchun/sicp-solutions
|
0636333c65cfba35197c9c4939977d5bb0117aed
|
3beb68aeeb3b1cabb7b55a27fd67a289693a64f1
|
refs/heads/master
| 2021-01-17T19:08:49.028304 | 2016-06-12T16:11:20 | 2016-06-12T16:11:20 | 60,976,032 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 2,015 |
scm
|
section-1.1.scm
|
; ex 1.4
; 对 if 表达式进行求值，得到的值应用到 a 和 b 上。
; ex 1.5
(define (p) (p))
(define (test x y)
(if (= x 0) 0 y))
; (test 0 (p))
; 应用序：test 是一个函数，将 test 作用于 0 和 (p)
; 时会对 0 和 (p) 求值，对 (p) 求值会造成死循环。
; 正则序：test 的参数会在需要时求值，对 if 表达式
; 求值时，由于 (= x 0) 为真，y 不会被求值。
; ex 1.6
(define (new-if predicate then-clause else-clause)
(cond (predicate then-clause)
(else else-clause)))
; if 有特殊的求值规则
; 使用 new-if 会导致 then-clause 和 else-clause 均
; 被求值。在 sqrt-iter 中使用 new-if 会导致死循环。
; ex 1.7
; x 很小时（小于 0.001），
; (abs x (square guess)) 可能小于 0.001，
; 但 (/ (abs x (square guess)) x) 很大；
; x 很大时，由于计算机存储一个浮点数的空间固定，
; 浮点数越大，可以保存的精度就越低。
(define (sqrt-iter guess x)
(let ((improved-guess (improve-square-root guess x)))
(if (close-enough? guess improved-guess)
improved-guess
(sqrt-iter improved-guess x))))
(define (improve-square-root guess x)
(average guess (/ x guess)))
(define (average x y)
(/ (+ x y) 2))
; 猜测值越接近实际值时，前后两次的猜测值的差的绝对值
; 也越小；使用待开方值的数和猜测值的平方比较可能会导
; 致猜测值在正确值的两端来回变化。
(define (close-enough? a b)
(let ((ratio (/ a b)))
(and (< ratio 1.001) (> ratio 0.999))))
(define (my-sqrt x)
(sqrt-iter 1.0 x))
; ex 1.8
; 和 ex 1.7 类似
(define (cube-root-iter guess x)
(if (good-enough? guess x)
guess
(cube-root-iter (improve-cube-root guess x) x)))
(define (good-enough? guess x)
(< (abs (- (cube guess) x)) 0.00001))
(define (cube x)
(* x x x))
(define (square x)
(* x x))
(define (improve-cube-root guess x)
(/ (+ (/ x (square guess)) (* 2 guess)) 3))
(define (cube-root x)
(cube-root-iter 1.0 x))
| false |
f4c028b61dcb23b980d63ca46a0e279660ebd187
|
d9426bff964eead8fb4c45a016cac45799ecb404
|
/entity.ss
|
3923923a2d8dc6ac9b8ff8842df78d2ea8fb2406
|
[] |
no_license
|
Glow-Lang/gloui
|
f4093a2fc94e94f1576957cd42e4595b88977928
|
bac31fab2ff8394cf8d5e727df49baf2bb3b66a1
|
refs/heads/main
| 2023-07-27T19:42:13.164645 | 2021-09-09T23:21:16 | 2021-09-09T23:21:16 | 404,895,672 | 3 | 0 | null | 2021-09-09T23:21:16 | 2021-09-09T23:17:37 |
JavaScript
|
UTF-8
|
Scheme
| false | false | 1,717 |
ss
|
entity.ss
|
(import :clan/poo/mop :clan/poo/object :clan/poo/brace
:std/text/json :std/sugar #;(for-syntax :std/gambit-sharp))
(export #t)
;; (declare (extended-bindings))
;; (include "~~lib/_gambit#.scm")
;; (macro-case-target
;; ((js) (import :js))
;; (else
(def (json<-entity e (t e))
(call-with-output-string
(cut write-json-alist (.entity-alist e t) <>)))
(def (entity<-json entity-type json)
(def js (cond ((hash-table? json) json)
((string? json)
(with-input-from-string json (cut read-json)))
(else (error "Not JSON:" json))))
(def no (gensym))
(def (jsref js ref)
(let ((obj (hash-ref js ref no)))
(if (not (eq? no obj)) obj
(hash-ref js (symbol->string ref) #!void))))
(.mix (object<-alist (map (lambda (s) (cons s (jsref js s)))
(.entity-slots entity-type)))
entity-type))
(.def (Entity @ [])
.entitySlots: '()
.json<-: (cut json<-entity <> @)
.<-json: (cut entity<-json @ <>)
.new: (cut .mix <> @))
(def (.new-entity e (obj (.o))) ((.@ e .new) obj))
(def (.entity-slots e) (.@ e .entitySlots))
(def (prependEntitySlotLists x y) (append y x))
(defsyntax (define-entity stx)
(syntax-case stx ()
((_ (name self [supers ...] slots ...) defs ...)
#'(define-type (name self [supers ... Entity] slots ...)
(.entitySlots => prependEntitySlotLists '(slots ...))
defs ...))))
(defsyntax (.entity stx)
(syntax-case stx ()
((_ name slots ...)
#'(.o (:: @ name) slots ...))))
(def (.entity-alist e (entity-type e))
(map (lambda (slot) (cons slot (try (.ref e slot) (catch (e) #!void))))
(.@ entity-type .entitySlots)))
;;))
| false |
92e539411140aea5851641f7c4ae146bf4b1165f
|
957ca548c81c2c047ef82cdbf11b7b2b77a3130b
|
/02LAB/02_lab_6.scm
|
699e5c12357191f957534f9c0efdd083ae799d2e
|
[] |
no_license
|
emrzvv/Scheme
|
943d4a55c5703f0e1318ae65aec24d0cb57e3372
|
e6ae1ed19104f46d22eee2afabea5459f7031a22
|
refs/heads/master
| 2023-02-19T08:55:29.470491 | 2021-01-18T12:56:26 | 2021-01-18T12:56:26 | 318,609,955 | 4 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 213 |
scm
|
02_lab_6.scm
|
(define (f x) (+ x 2))
(define (g x) (* x 3))
(define (h x) (- x))
(define (o . fs)
(define (loop x fs)
(if (null? fs)
x
(loop ((car fs) x) (cdr fs))))
(lambda (x) (loop x (reverse fs))))
| false |
1e842ca7bca2d4ef2f0da5dd58526ccf5de6c6d6
|
5fb1b3965ca1ae1a862f46666a2d3a3fbdc21f2e
|
/srfi/177-bigloo.scm
|
f4b7a26c83afb52322addf7221cd9beac3f5fd50
|
[] |
no_license
|
scheme-requests-for-implementation/srfi-177
|
3a2c8dadd1086fc817b7ffed611a03e9f05b3f31
|
5a388d98b6de739151006fdcab6383960d9d172e
|
refs/heads/master
| 2020-08-17T04:32:07.027821 | 2020-08-01T00:39:59 | 2020-08-01T00:39:59 | 215,608,339 | 3 | 0 | null | 2020-07-31T20:05:08 | 2019-10-16T17:41:49 |
HTML
|
UTF-8
|
Scheme
| false | false | 1,173 |
scm
|
177-bigloo.scm
|
(define (split-last lis)
(let loop ((butlast '()) (lis lis))
(cond ((null? lis) (values (reverse butlast) #f))
((null? (cdr lis)) (values (reverse butlast) (car lis)))
(else (loop (cons (car lis) butlast) (cdr lis))))))
(define-macro (lambda/kw formals-and-keys . body)
(receive (formals keyword-symbols) (split-last formals-and-keys)
`(lambda (,@formals #!key ,@keyword-symbols)
,@body)))
(define-macro (call/kw kw-lambda . rest)
(receive (positional-vals keyword-syms-and-vals) (split-last rest)
(unless (list? keyword-syms-and-vals)
(error "call/kw does not end with a list"))
`(,kw-lambda ,@positional-vals
,@(let loop ((alls keyword-syms-and-vals) (acc '()))
(cond ((null? alls) (reverse acc))
((null? (cdr alls))
(error "Missing keyword value in call/kw"))
(else (let ((key (symbol->keyword (car alls)))
(val (cadr alls)))
(loop (cddr alls)
(cons val (cons key acc))))))))))
| false |
28896e4146d36f1878e43226b906511a2318260d
|
fae4190f90ada065bc9e5fe64aab0549d4d4638a
|
/pre-effect/private/typechecker.ss
|
3355a43e6929e2115801fc3ad0dafc9101a9ea21
|
[] |
no_license
|
ilya-klyuchnikov/old-typed-racket
|
f161481661a2ed5cfc60e268f5fcede728d22488
|
fa7c1807231f447ff37497e89b25dcd7a9592f64
|
refs/heads/master
| 2021-12-08T04:19:59.894779 | 2008-04-13T10:54:34 | 2008-04-13T10:54:34 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 24,549 |
ss
|
typechecker.ss
|
(module typechecker mzscheme
;; tests needed
(require (rename (lib "1.ss" "srfi") assoc* assoc)
(lib "kerncase.ss" "syntax")
(lib "struct.ss" "syntax")
(lib "etc.ss")
"subst.ss" ;; needs tests
"utils.ss" ;; doesn't need tests
"types.ss" ;; doesn't need tests
"infer.ss" ;; needs tests
"types-aux.ss" ;; maybe needs tests
"subtype.ss" ;; has tests
"prims.ss" ;; doesn't need tests
"remove-intersect.ss" ;; has tests
"planet-requires.ss" ;; doesn't need tests
"type-env.ss" ;; maybe needs tests
"parse-type.ss" ;; has tests
"tc-utils.ss" ;; doesn't need tests
"type-environments.ss" ;; doesn't need tests
"base-env.ss" ;; doesn't need tests
"lexical-env.ss" ;; maybe needs tests
"type-annotation.ss" ;; has tests
"type-name-env.ss" ;; maybe needs tests
(lib "match.ss"))
(require-for-template "prims.ss" (lib "match.ss"))
(require-libs)
(require (planet "environment.ss" ("cobbe" "environment.plt" 3 0)))
(provide (all-defined))
(require-for-template mzscheme)
;; check that e-type is compatible with ty in context of stx
;; otherwise, error
;; syntax type type -> void
(define (check-type stx e-type ty)
(parameterize ([current-orig-stx stx])
(unless (subtype e-type ty)
(tc-error "body had type ~a, variable had type ~a" e-type ty))))
;; check that expr has type ty in context of stx
;; syntax syntax type -> void
(define (check-expr stx expr ty)
(check-type stx (tc-expr expr) ty))
;; return the type of a literal value
;; note that the only singleton value type produced is (make-value #f)
;; scheme-value -> type
(define (tc-literal v-stx)
;; list[syntax] -> type
(define (types-of-literals es)
(apply Un (map tc-literal es)))
(define v (syntax-e v-stx))
(cond
[(number? v) N]
[(boolean? v) (if v B (make-value #f))]
[(null? v) (make-value null) #;(make-poly '(a) (make-Listof (make-tvar 'a)))]
[(symbol? v) Sym]
[(string? v) String]
[(keyword? v) Keyword]
[(bytes? v) Bytes]
[(list? v) (make-Listof (types-of-literals v))]
[(vector? v) (make-vec (types-of-literals (vector->list v)))]
[else (begin (printf "checking literal : ~a~n" v) Univ)]))
(define (tc-id id)
(cond
;; bindings produced by define we trust
#;[(syntax-property id 'defined-type-label) => (lambda (prop) (parse-type prop))]
;; we should check that it has a lexical binding here
[else (lookup-type/lexical id)]))
;; typecheck an application:
;; arg-types: the types of the actual parameters
;; dom-types: the types of the function's fixed arguments
;; rest-type: the type of the functions's rest parameter, or #f
;; arg-stxs: the syntax for each actual parameter, for error reporting
;; [Type] [Type] Maybe[Type] [Syntax] -> Bool
(define (tc-args arg-types dom-types rest-type arg-stxs)
(let loop ([args arg-types] [doms dom-types] [stxs arg-stxs])
(cond
[(and (null? args) (null? doms)) #t]
[(null? args) (tc-error "Insufficient arguments to function application, expected ~a, got ~a"
(length dom-types) (length arg-types))]
[(and (null? doms) rest-type)
(if (subtype (car args) rest-type)
(loop (cdr args) doms (cdr stxs))
(tc-error/stx (car stxs) "Rest argument had wrong type, expected: ~a and got: ~a" rest-type (car args)))]
[(null? doms)
(tc-error "Too many arguments to function, expected ~a, got ~a" (length dom-types) (length arg-types))]
[(subtype (car args) (car doms))
(loop (cdr args) (cdr doms) (cdr stxs))]
[else
(tc-error/stx (car stxs) "Wrong function argument type, expected ~a, got ~a" (car doms) (car args))])))
;; typecheck a single lambda, with argument list and body
;; fixme: abstract the two cases!
(define (tc/lambda-clause args body)
(syntax-case args ()
[(args ...)
(let* ([arg-list (syntax->list #'(args ...))]
[arg-types (map get-type arg-list)])
(with-lexical-env/extend
arg-list arg-types
(make-arr arg-types (tc-exprs (syntax->list body)))))]
[(args ... . rest)
(let* ([arg-list (syntax->list #'(args ...))]
[arg-types (map get-type arg-list)]
[rest-type (get-type #'rest)])
(with-lexical-env/extend
(cons #'rest arg-list) (cons (make-Listof rest-type) arg-types)
(make-arr arg-types (tc-exprs (syntax->list body)) rest-type)))]))
;; tc/mono-lambda : syntax-list syntax-list -> Funty
;; typecheck a sequence of case-lambda clauses
(define (tc/mono-lambda formals bodies)
(make-funty (map tc/lambda-clause (syntax->list formals) (syntax->list bodies))))
;; typecheck a sequence of case-lambda clauses, which is possibly polymorphic
;; tc/lambda syntax syntax-list syntax-list -> Type
(define (tc/lambda form formals bodies)
(if (syntax-property form 'typechecker:plambda)
(tc/plambda form formals bodies)
(tc/mono-lambda formals bodies)))
;; tc/plambda syntax syntax-list syntax-list -> Poly
;; formals and bodies must by syntax-lists
(define (tc/plambda form formals bodies)
(with-syntax ([tvars (syntax-property form 'typechecker:plambda)])
(let* ([literal-tvars (map syntax-e (syntax->list #'tvars))]
[new-tvars (map make-tvar literal-tvars)]
[ty (parameterize ([current-tvars (extend-env literal-tvars new-tvars (current-tvars))])
(tc/mono-lambda formals bodies))])
(make-poly literal-tvars ty))))
;; if typechecking
(define (tc/if-onearm tst body) (tc/if-twoarm tst body (syntax/loc body (#%app void))))
(define (tc/if-twoarm tst thn els)
(define ((tc/update f) var t expr)
(let/ec return
(with-update-type/lexical (lambda (_ old)
(let ([new-t (f old t)])
(if (subtype new-t (Un))
(return (Un))
new-t)))
var
(tc-expr expr))))
(define tc/remove (tc/update remove))
;; (define tc/intersect (tc/update intersect)) old version
(define tc/intersect (tc/update restrict))
(define tc/replace (tc/update (lambda (old t) t)))
;; check that tst is well-typed
(tc-expr tst)
(kernel-syntax-case tst #f
[(#%app p v)
(identifier? #'v)
(match (tc-expr #'p)
[($ pred-ty t)
#;(printf "using pred ~a~n" t)
(Un (tc/intersect #'v t thn) (tc/remove #'v t els))]
[_ (Un (tc-expr thn) (tc-expr els))])]
[i (identifier? #'i)
(Un (tc/remove #'i (make-value #f) thn)
(tc/replace #'i (make-value #f) els))]
[_ (Un (tc-expr thn) (tc-expr els))]))
;; type check form in the current type environment
;; if there is a type error in form, or if it has the wrong annotation, error
;; otherwise, produce the type of form
;; syntax[expr] -> type
(define (tc-expr form)
(define ty-ann (type-annotation form))
;; do the actual typechecking of form
;; internal-tc-expr : syntax -> Type
(define (internal-tc-expr form)
(kernel-syntax-case* form #f (values apply letrec-syntaxes+values) ;; letrec-syntaxes+values is not in kernel-syntax-case literals
;; data
[(#%datum . val) (tc-literal #'val)]
[(quote val) (tc-literal #'val)]
;; lambda
[(lambda formals . body)
(tc/lambda form #'(formals) #'(body))]
[(case-lambda [formals . body] ...)
(tc/lambda form #'(formals ...) #'(body ...))]
;; let
[(let-values ([(name ...) expr ] ...) . body)
(let* (;; a list of each name clause
[names (syntax->list #'((name ...) ...))]
;; all the trailing expressions - the ones actually bound to the names
[exprs (syntax->list #'(expr ...))]
;; the types of the expr0s
[inferred-types (map tc-expr exprs)]
;; the annotated types of the name (possibly using the inferred types)
[types (map get-type/infer names inferred-types)]
;; just for error reporting
[clauses (syntax-case form () [(lv cl . b) (syntax->list #'cl)])])
;; extend the lexical environment for checking the body
(with-lexical-env/extend
;; the list of lists of name
(map syntax->list names)
;; the types
types
(for-each (lambda (stx e-type t) (check-type stx e-type t))
clauses
inferred-types
(map list->values-ty types))
(tc-exprs (syntax->list #'body))))]
[(letrec-values ([(name ...) expr] ...) . body)
(let* ([names (map syntax->list (syntax->list #'((name ...) ...)))]
[exprs (syntax->list #'(expr ...))]
[types (map (lambda (l) (map get-type l)) names)]
;; just for error reporting
[clauses (syntax-case form () [(lv cl . b) (syntax->list #'cl)])])
(with-lexical-env/extend
names
types
(for-each (lambda (stx e t) (check-expr stx e t))
clauses
exprs
(map list->values-ty types))
(tc-exprs (syntax->list #'body))))]
;; mutation!
[(set! id val)
(let* ([id-t (tc-id #'id)]
[val-t (tc-expr #'val)])
(unless (subtype val-t id-t)
(tc-error "Mutation only allowed with compatible types: ~a is not a subtype of ~a" val-t id-t))
Void)]
;; variable reference
[(#%top . id) #;(lookup-type #'id)
(tc-error "#%top should never happen")]
[x (identifier? #'x) (tc-id #'x)]
[(#%variable-reference . _)
(tc-error "do not use #%variable-reference")]
;; application
;; special case for `values'
[(#%app values . args)
(let ([tys (map tc-expr (syntax->list #'args))])
(list->values-ty tys))]
;; special case for `apply'
[(#%app apply f . args)
(let* ([f-ty (tc-expr #'f)]
[arg-tys0 (map tc-expr (syntax->list #'args))])
(define (split l)
(let loop ([l l] [acc '()])
(if (null? (cdr l))
(values (reverse acc) (car l))
(loop (cdr l) (cons (car l) acc)))))
(let-values ([(arg-tys tail-ty) (split arg-tys0)])
(match f-ty
[($ funty (($ arr doms rngs rests) ..1))
(let loop ([doms doms] [rngs rngs] [rests rests])
(cond [(null? doms) (tc-error "no function domain matched - domains were: ~a arguments were ~a" doms arg-tys0)]
[(and (subtypes arg-tys (car doms)) (subtype tail-ty (make-Listof (car rests))))
(car rngs)]
[else (loop (cdr doms) (cdr rngs) (cdr rests))]))]
[($ poly _ ($ funty _))
(tc-error "polymorphic functions not supported with apply")]
[else (tc-error "~a is not a function type" f-ty)])))]
[(#%app f args ...)
(let* ([ftype (tc-expr #'f)]
[argtypes (map tc-expr (syntax->list #'(args ...)))])
(match ftype
[($ pred-ty _)
(if (= 1 (length argtypes))
B
(tc-error "wrong number of arguments to predicate ~a" (syntax-e #'f)))]
[($ funty (($ arr doms rngs rests) ..1))
#;(printf "ftype is ~a~n" ftype)
(if (= 1 (length doms))
(begin
(tc-args argtypes (car doms) (car rests) (syntax->list #'(args ...)))
(car rngs))
(let loop ([doms* doms] [rngs rngs] [rests rests])
(cond [(null? doms*)
(tc-error "no function domain matched - domains were: ~a arguments were ~a" doms argtypes)]
[(subtypes/varargs argtypes (car doms*) (car rests)) (car rngs)]
[else (loop (cdr doms*) (cdr rngs) (cdr rests))])))]
[($ poly vars ($ funty (($ arr doms rngs #f) ...)))
(for-each (lambda (x) (unless (not (poly? x))
(tc-error "Polymorphic argument ~a to polymorphic function not allowed" x)))
argtypes)
(let* ([fresh-names (map gensym vars)]
[fresh-vars (map make-tvar fresh-names)]
[fresh-doms (map (lambda (argl) (map (lambda (t) (subst-all (map list vars fresh-vars) t)) argl)) doms)]
[fresh-rngs (map (lambda (l) (subst-all (map list vars fresh-vars) l)) rngs)])
(let loop ([doms* fresh-doms] [rngs* fresh-rngs])
(cond [(null? doms*)
(tc-error "no polymorphic function domain matched - domains were: ~a arguments were ~a" doms argtypes)]
[(and (= (length (car doms*))
(length argtypes))
(unify (map list (car doms*) argtypes)))
=> (lambda (substitution)
(subst-all (map list fresh-names (map make-tvar vars))
(subst-all substitution (car rngs*))))]
[else (loop (cdr doms*) (cdr rngs*))])))]
[else (tc-error "~a is not a function type" ftype)]))]
;; if
[(if tst body) (tc/if-onearm #'tst #'body)]
[(if tst thn els) (tc/if-twoarm #'tst #'thn #'els)]
;; syntax
[(letrec-syntaxes+values stxs vals . body)
(tc-expr (syntax/loc form (letrec-values vals . body)))]
;; begin
[(begin e) (tc-expr #'e )]
[(begin e es ...)
(begin (tc-expr #'e)
(tc-expr #'(begin es ...)))]
#;[(begin) Void] ;; impossible
[(begin0 e) (tc-expr #'e )]
[(begin0 e es ...)
(begin0 (tc-expr #'e)
(tc-expr #'(begin es ...)))]
#;[(begin0) Void] ;; impossible
;; other
[_ (tc-error "cannot typecheck unknown form : ~a~n" (syntax-object->datum form))]))
(parameterize ([current-orig-stx form])
(unless (syntax? form)
(tc-error "bad form input to tc-expr"))
(let ([result (internal-tc-expr form)])
(cond [(and ty-ann (subtype result ty-ann)) ty-ann]
[ty-ann (tc-error "expression had type ~a, but was annotated with type ~a" result ty-ann)]
[else result])))
)
;; type-check a list of exprs, producing the type of the last one.
;; if the list is empty, the type is Void.
;; list[syntax[expr]] -> type
(define (tc-exprs exprs)
(cond [(null? exprs) Void]
[(null? (cdr exprs)) (tc-expr (car exprs))]
[else (tc-expr (car exprs))
(tc-exprs (cdr exprs))]))
;; FIXME - merge these functions
(define (tc/poly-struct vars nm flds tys)
(with-syntax*
([(nm parent) (syntax-case nm ()
[nm (identifier? #'nm) #'(nm #f)]
[(nm par) #'(nm par)])]
[(_ maker pred . getters) (build-struct-names #'nm flds #f #t)])
(let* ([name (syntax-e #'nm)]
[tvars (map syntax-e vars)]
[new-tvars (map make-tvar tvars)]
[parent (if (syntax-e #'parent) (parse-type #'parent) #f)])
(parameterize ([current-tvars (extend-env tvars new-tvars (current-tvars))])
(let*
([name-tvar (make-tvar name)]
;; parse the types with an env so we can check if the type is recursive
[types (parameterize
([current-tvars
(extend-env (list name) (list (make-poly tvars name-tvar)) (current-tvars))])
(map parse-type tys))]
[rec? (ormap (lambda (s) (set:member? name s)) (map fv types))]
;; register the type name for the re-parse
[_ (if rec? (register-type-name #'nm (make-poly tvars name-tvar)))]
;; now we reparse to get the correct types
[types (map parse-type tys)]
[parent-field-types (if parent
(struct-ty-flds (if (poly? parent)
(subst-all (map list (poly-var parent) new-tvars)
(poly-type parent))
parent))
'())]
[fld-types (append parent-field-types types)]
[sty (make-struct-ty name parent fld-types)]
[sty (if rec?
(make-mu name sty)
sty)]
[psty (make-poly* tvars sty)]
[external-fld-types/no-parent (map (lambda (t) (subst name sty t)) types)]
[external-fld-types (map (lambda (t) (subst name sty t)) fld-types)]
[result-tvars (filter (lambda (x) (not (member x (fv/list sty)))) tvars)]
[result-sty (if (null? result-tvars) sty
(make-poly result-tvars sty))])
#;(printf "added constructor of type ~a~n" (make-poly tvars (->* external-fld-types result-sty)))
;; finally, register the correct type name
(register-type-name #'nm psty)
(register-type #'maker (make-poly tvars (->* external-fld-types sty)))
(register-types (syntax->list #'getters)
(map (lambda (t) (make-poly tvars (->* (list sty) t))) external-fld-types/no-parent))
(register-type #'pred (make-pred-ty psty)))))))
(define (tc/struct nm flds tys)
(with-syntax*
([(nm parent) (syntax-case nm ()
[nm (identifier? #'nm) #'(nm #f)]
[(nm par) #'(nm par)])]
[(_ maker pred . getters) (build-struct-names #'nm flds #f #t)])
(let* ([name (syntax-e #'nm)]
[name-tvar (make-tvar name)]
[parent (if (syntax-e #'parent) (parse-type #'parent) #f)]
[types (parameterize
([current-tvars
(extend-env (list name) (list name-tvar) (current-tvars))])
(map parse-type tys))]
[rec? (ormap (lambda (s) (set:member? name-tvar s)) (map fv types))]
[parent-field-types (if parent (struct-ty-flds parent) '())]
[fld-types (append parent-field-types types)]
[sty (make-struct-ty name parent fld-types)]
[sty (if rec?
(make-mu name sty)
sty)]
[external-fld-types/no-parent (map (lambda (t) (subst name sty t)) types)]
[external-fld-types (map (lambda (t) (subst name sty t)) fld-types)])
#;(printf "~a~n ~a~n" sty (->* external-fld-types sty))
(register-type-name #'nm sty)
(register-type #'maker (->* external-fld-types sty))
(register-types (syntax->list #'getters)
(map (lambda (t) (->* (list sty) t)) external-fld-types/no-parent))
(register-type #'pred (make-pred-ty sty)))))
;; produce the appropriate type of a list of types
;; that is - if there is exactly one type, just produce it, otherwise produce a values-ty
;; list[type] -> type
(define (list->values-ty l)
(if (= 1 (length l)) (car l) (make-values-ty l)))
(define (tc-toplevel/pass1 form)
(parameterize ([current-orig-stx form])
(kernel-syntax-case* form #f (define-type-alias-internal define-typed-struct-internal require/typed-internal : tc/check)
;; forms that are handled in other ways
[stx
(syntax-property form 'typechecker:ignore)
(void)]
;; directives to the typechecker
[(begin0 (require/typed-internal nm ty))
(register-type #'nm (parse-type #'ty))]
[(begin0 (define-type-alias-internal (nm . vars) ty))
(register-type-name #'nm (parse-type #'(All vars ty)))]
[(begin0 (define-type-alias-internal nm ty))
(register-type-name #'nm (parse-type #'ty))]
[(begin0 (define-typed-struct-internal nm ([fld : ty] ...)))
(tc/struct #'nm (syntax->list #'(fld ...)) (syntax->list #'(ty ...)))]
[(begin0 (define-typed-struct-internal (vars ...) nm ([fld : ty] ...)))
(tc/poly-struct (syntax->list #'(vars ...)) #'nm (syntax->list #'(fld ...)) (syntax->list #'(ty ...)))]
[(begin0 (define-typed-internal nm [variant (fld ty) ...] ...))
(void)]
[(define-values (var ...) expr)
(andmap (lambda (s) (syntax-property s 'type-label)) (syntax->list #'(var ...)))
(let* ([vars (syntax->list #'(var ...))]
[ts (map get-type vars)])
(for-each register-type vars ts))]
[(define-values . _)
(tc-error "Untyped definition")]
[_ (void)]
;; these forms should be ignored
[(require . _) (void)]
[(require-for-syntax . _) (void)]
[(require-for-template . _) (void)]
[(provide . _) (void)]
[(define-syntaxes . _) (void)]
;; otherwise, the form was just an expression
[_ (begin
(tc-expr form)
#;cenv)])))
;; typecheck the expressions of a module-top-level form
;; no side-effects
;; syntax -> void
(define (tc-toplevel/pass2 form)
(parameterize ([current-orig-stx form])
(kernel-syntax-case* form #f (define-type-alias-internal define-typed-struct-internal require/typed-internal : tc/check)
;; these forms we have been instructed to ignore
[stx
(syntax-property form 'typechecker:ignore)
(void)]
;; these forms should always be ignored
[(require . _) (void)]
[(require-for-syntax . _) (void)]
[(require-for-template . _) (void)]
[(provide . _) (void)]
[(define-syntaxes . _) (void)]
;; these forms are handled in pass1
[(begin0 (require/typed-internal . rest)) (void)]
[(begin0 (define-type-alias-internal . rest)) (void)]
[(begin0 (define-typed-struct-internal . rest)) (void)]
[(begin0 (define-type-internal . rest)) (void)]
;; definitions just need to typecheck their bodies
[(define-values (var ...) expr)
(let* ([vars (syntax->list #'(var ...))]
[ts (map get-type vars)])
(check-expr form #'expr (list->values-ty ts)))]
;; otherwise, the form was just an expression
[_ (tc-expr form)])))
;; type check a list of module-level forms
;; produce code to add the definitions in this module to the global table of module-level forms
;; syntax-list -> syntax
(define (type-check forms)
(let ([forms (syntax->list forms)])
;; install defined names and types in the environment
(for-each tc-toplevel/pass1 forms)
;; typecheck the expressions
(for-each tc-toplevel/pass2 forms))
#`(begin
#,(env-init-code)
#,(tname-env-init-code)))
;(trace subtype-of)
;(trace check-expr)
;(trace tc-expr)
;(trace intersect-ty)
;(trace remove-ty)
;(trace all-in)
;(trace symbolic-identifier=?)
;(trace parse-type)
)
| true |
6ab967bc6b2922ccc1410352ceed2f75ce53b747
|
2c01a6143d8630044e3629f2ca8adf1455f25801
|
/scheme-tools/repl.ss
|
096c3a89462ecfaabc57534ddc508bf8de3901da
|
[] |
no_license
|
stuhlmueller/scheme-tools
|
e103fac13cfcb6d45e54e4f27e409adbc0125fe1
|
6e82e873d29b34b0de69b768c5a0317446867b3c
|
refs/heads/master
| 2021-01-25T10:06:33.054510 | 2017-05-09T19:44:12 | 2017-05-09T19:44:12 | 1,092,490 | 5 | 1 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,217 |
ss
|
repl.ss
|
#!r6rs
;; Provides a repl that can be called at any point within a file and
;; that has access to objects that are passed into it and to exports
;; of the library it is invoked in.
(library
(scheme-tools repl)
(export repl)
(import (rnrs)
(scheme-tools implementation-specific)
(scheme-tools readable-scheme)
(scheme-tools external))
(define-syntax repl
(syntax-rules ()
((repl objs ...)
(let ([env (interaction-environment)])
(call/cc (lambda (top) (obj-repl env top '(objs ...) (list objs ...))))))))
(define (obj-repl env top obj-names objs)
(pe "\nscm> ")
(let ((input (read)))
(cond
((equal? input 'q) (begin (pe "exiting repl.\n") (top (void))))
((equal? input 'qq) (begin (pe "exiting scheme.\n") (exit)))
(else
(with-exception-handler
(lambda (exn)
(pe (format "exception:\n~a" exn))
(obj-repl env top obj-names objs))
(lambda ()
(let* ([proc (eval `(lambda ,obj-names ,input) env)]
[val (apply proc objs)])
(when (not (equal? val (void)))
(write val))
(obj-repl env top obj-names objs))))))))
)
| true |
a2dbedd16650960930d87fe0c2897e0820226021
|
c460cb5a799ba78aa63d85513fd71e92a18dc37a
|
/lib/sdl2-types/accessors/events.scm
|
009d8758e304cfa01d4c194460b88f77c9c7ee45
|
[
"BSD-2-Clause"
] |
permissive
|
jacius/chicken-sdl2
|
8dd85c80024084e6667af0f4f66450f30c584b11
|
3bd7c50610e9505ab531e0ec489036ece7244d59
|
refs/heads/master
| 2021-01-22T13:57:47.466048 | 2015-12-20T06:13:09 | 2015-12-20T06:13:09 | 13,714,170 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 33,982 |
scm
|
events.scm
|
;;
;; chicken-sdl2: Chicken bindings to SDL 2 (Simple DirectMedia Layer 2)
;;
;; Copyright © 2013 John Croisant.
;; All rights reserved.
;;
;; Redistribution and use in source and binary forms, with or without
;; modification, are permitted provided that the following conditions
;; are met:
;;
;; - Redistributions of source code must retain the above copyright
;; notice, this list of conditions and the following disclaimer.
;;
;; - Redistributions in binary form must reproduce the above copyright
;; notice, this list of conditions and the following disclaimer in
;; the documentation and/or other materials provided with the
;; distribution.
;;
;; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
;; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
;; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
;; FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
;; COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
;; INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
;; (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
;; SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
;; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
;; STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
;; ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
;; OF THE POSSIBILITY OF SUCH DAMAGE.
(export sdl-event-type
sdl-event-type-set!
sdl-event-timestamp
sdl-event-timestamp-set!)
(define-function-binding* sdl-event-type
return: (SDL_EventType type)
args: ((SDL_Event* event))
body: "C_return(((SDL_CommonEvent*)event)->type);")
(define-function-binding* sdl-event-type-set!
args: ((SDL_Event* event) (SDL_EventType type))
body: "((SDL_CommonEvent*)event)->type = type;")
(define-function-binding* sdl-event-timestamp
return: (Uint32 timestamp)
args: ((SDL_Event* event))
body: "C_return(((SDL_CommonEvent*)event)->timestamp);")
(define-function-binding* sdl-event-timestamp-set!
args: ((SDL_Event* event) (Uint32 timestamp))
body: "((SDL_CommonEvent*)event)->timestamp = timestamp;")
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; RECORD PRINTER
(define (%sdl-event-record-printer event out fields)
(%displayify out "#<sdl-event "
(sdl-event-type-name (sdl-event-type event)))
(for-each (lambda (field)
(%displayify out " " (car field) ": " (cadr field)))
fields)
(%displayify out ">"))
(define (%sdl-event-default-record-printer event out)
(%sdl-event-record-printer event out '()))
(define %sdl-event-record-printers
(make-hash-table
test: = hash: number-hash size: 40))
(define-record-printer (sdl-event event out)
((hash-table-ref/default
%sdl-event-record-printers
(sdl-event-type event)
%sdl-event-default-record-printer)
event out))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; KEYBOARD
(export make-sdl-keyboard-event
sdl-keyboard-event?
sdl-keyboard-event-window-id
sdl-keyboard-event-window-id-set!
sdl-keyboard-event-state
sdl-keyboard-event-state-set!
sdl-keyboard-event-repeat
sdl-keyboard-event-repeat-set!
sdl-keyboard-event-keysym
sdl-keyboard-event-keysym-set!)
(define-sdl-event-type "SDL_KeyboardEvent"
types: (SDL_KEYDOWN
SDL_KEYUP)
make: make-sdl-keyboard-event
predicate: sdl-keyboard-event?
print-fields: ((keysym sdl-keyboard-event-keysym))
fields: (((Uint32 windowID)
guard: (Uint32-guard "sdl-keyboard-event field windowID")
get: sdl-keyboard-event-window-id
set: sdl-keyboard-event-window-id-set!)
((Uint8 state)
guard: (Uint8-guard "sdl-keyboard-event field state")
get: sdl-keyboard-event-state
set: sdl-keyboard-event-state-set!)
((Uint8 repeat)
guard: (Uint8-guard "sdl-keyboard-event field repeat")
get: sdl-keyboard-event-repeat
set: sdl-keyboard-event-repeat-set!)
;; See below
;; ((SDL_Keysym keysym)
;; guard: noop-guard
;; get: sdl-keyboard-event-keysym
;; set: sdl-keyboard-event-keysym-set!)
))
(define (sdl-keyboard-event-keysym event)
(let ((keysym (%allocate-sdl-keysym)))
((foreign-lambda*
void ((SDL_Event* ev) (blob data))
"*((SDL_Keysym*)data) = ((SDL_KeyboardEvent*)ev)->keysym;")
event (%sdl-keysym-data keysym))
keysym))
(define (sdl-keyboard-event-keysym-set! event keysym)
(if (%sdl-keysym-data keysym)
((foreign-lambda*
void ((SDL_Event* ev) (blob data))
"((SDL_KeyboardEvent*)ev)->keysym = *((SDL_Keysym*)data);")
event (%sdl-keysym-data keysym))
((foreign-lambda*
void ((SDL_Event* ev) ((c-pointer "SDL_Keysym") ptr))
"((SDL_KeyboardEvent*)ev)->keysym = *ptr;")
event (%sdl-keysym-pointer keysym))))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; TEXT EDITING / INPUT
(export make-sdl-text-editing-event
sdl-text-editing-event?
sdl-text-editing-event-window-id
sdl-text-editing-event-window-id-set!
sdl-text-editing-event-text
sdl-text-editing-event-text-set!
sdl-text-editing-event-start
sdl-text-editing-event-start-set!
sdl-text-editing-event-length
sdl-text-editing-event-length-set!
make-sdl-text-input-event
sdl-text-input-event?
sdl-text-input-event-window-id
sdl-text-input-event-window-id-set!
sdl-text-input-event-text
sdl-text-input-event-text-set!)
(define-sdl-event-type "SDL_TextEditingEvent"
types: (SDL_TEXTEDITING)
make: make-sdl-text-editing-event
predicate: sdl-text-editing-event?
print-fields: ((start sdl-text-editing-event-start)
(text sdl-text-editing-event-text))
fields: (((Uint32 windowID)
guard: (Uint32-guard "sdl-text-editing-event field windowID")
get: sdl-text-editing-event-window-id
set: sdl-text-editing-event-window-id-set!)
;; See below
;; ((char[SDL_TEXTEDITINGEVENT_TEXT_SIZE] text)
;; guard: noop-guard
;; get: sdl-text-editing-event-text
;; set: sdl-text-editing-event-text-set!)
((Sint32 start)
guard: (Sint32-guard "sdl-text-editing-event field start")
get: sdl-text-editing-event-start
set: sdl-text-editing-event-start-set!)
((Sint32 length)
guard: (Sint32-guard "sdl-text-editing-event field length")
get: sdl-text-editing-event-length
set: sdl-text-editing-event-length-set!)))
(define sdl-text-editing-event-text
(foreign-lambda*
c-string ((SDL_Event* ev))
"C_return( &((SDL_TextEditingEvent*)ev)->text );"))
(define (sdl-text-editing-event-text-set! event text)
(assert (< (string-length text) SDL_TEXTEDITINGEVENT_TEXT_SIZE))
((foreign-lambda*
c-string ((SDL_Event* ev) (c-string text))
"strncpy(((SDL_TextEditingEvent*)ev)->text, text, SDL_TEXTEDITINGEVENT_TEXT_SIZE);")
event text))
(define-sdl-event-type "SDL_TextInputEvent"
types: (SDL_TEXTINPUT)
make: make-sdl-text-input-event
predicate: sdl-text-input-event?
print-fields: ((text sdl-text-input-event-text))
fields: (((Uint32 windowID)
guard: (Uint32-guard "sdl-text-input-event field windowID")
get: sdl-text-input-event-window-id
set: sdl-text-input-event-window-id-set!)
;; See below
;; ((char[SDL_TEXTINPUTEVENT_TEXT_SIZE] text)
;; guard: noop-guard
;; get: sdl-text-input-event-text
;; set: sdl-text-input-event-text-set!)
))
(define sdl-text-input-event-text
(foreign-lambda*
c-string ((SDL_Event* ev))
"C_return( &((SDL_TextInputEvent*)ev)->text );"))
(define (sdl-text-input-event-text-set! event text)
(assert (< (string-length text) SDL_TEXTINPUTEVENT_TEXT_SIZE))
((foreign-lambda*
c-string ((SDL_Event* ev) (c-string text))
"strncpy(((SDL_TextInputEvent*)ev)->text, text, SDL_TEXTINPUTEVENT_TEXT_SIZE);")
event text))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; MOUSE
(export make-sdl-mouse-button-event
sdl-mouse-button-event?
sdl-mouse-button-event-window-id
sdl-mouse-button-event-window-id-set!
sdl-mouse-button-event-which
sdl-mouse-button-event-which-set!
sdl-mouse-button-event-button
sdl-mouse-button-event-button-set!
sdl-mouse-button-event-state
sdl-mouse-button-event-state-set!
sdl-mouse-button-event-x
sdl-mouse-button-event-x-set!
sdl-mouse-button-event-y
sdl-mouse-button-event-y-set!
make-sdl-mouse-motion-event
sdl-mouse-motion-event?
sdl-mouse-motion-event-window-id
sdl-mouse-motion-event-window-id-set!
sdl-mouse-motion-event-which
sdl-mouse-motion-event-which-set!
sdl-mouse-motion-event-state
sdl-mouse-motion-event-state-set!
sdl-mouse-motion-event-x
sdl-mouse-motion-event-x-set!
sdl-mouse-motion-event-y
sdl-mouse-motion-event-y-set!
sdl-mouse-motion-event-xrel
sdl-mouse-motion-event-xrel-set!
sdl-mouse-motion-event-yrel
sdl-mouse-motion-event-yrel-set!
make-sdl-mouse-wheel-event
sdl-mouse-wheel-event?
sdl-mouse-wheel-event-window-id
sdl-mouse-wheel-event-window-id-set!
sdl-mouse-wheel-event-which
sdl-mouse-wheel-event-which-set!
sdl-mouse-wheel-event-x
sdl-mouse-wheel-event-x-set!
sdl-mouse-wheel-event-y
sdl-mouse-wheel-event-y-set!)
(define-sdl-event-type "SDL_MouseButtonEvent"
types: (SDL_MOUSEBUTTONDOWN
SDL_MOUSEBUTTONUP)
make: make-sdl-mouse-button-event
predicate: sdl-mouse-button-event?
print-fields: ((button (lambda (e)
(sdl-mouse-button-name
(sdl-mouse-button-event-button e))))
(x sdl-mouse-button-event-x)
(y sdl-mouse-button-event-y))
fields: (((Uint32 windowID)
guard: (Uint32-guard "sdl-mouse-button-event field windowID")
get: sdl-mouse-button-event-window-id
set: sdl-mouse-button-event-window-id-set!)
((Uint32 which)
guard: (Uint32-guard "sdl-mouse-button-event field which")
get: sdl-mouse-button-event-which
set: sdl-mouse-button-event-which-set!)
((Uint8 button)
guard: (Uint8-guard "sdl-mouse-button-event field button")
get: sdl-mouse-button-event-button
set: sdl-mouse-button-event-button-set!)
((Uint8 state)
guard: (Uint8-guard "sdl-mouse-button-event field state")
get: sdl-mouse-button-event-state
set: sdl-mouse-button-event-state-set!)
((Sint32 x)
guard: (Sint32-guard "sdl-mouse-button-event field x")
get: sdl-mouse-button-event-x
set: sdl-mouse-button-event-x-set!)
((Sint32 y)
guard: (Sint32-guard "sdl-mouse-button-event field y")
get: sdl-mouse-button-event-y
set: sdl-mouse-button-event-y-set!)))
(define-sdl-event-type "SDL_MouseMotionEvent"
types: (SDL_MOUSEMOTION)
make: make-sdl-mouse-motion-event
predicate: sdl-mouse-motion-event?
print-fields: ((state (lambda (e)
(map sdl-mouse-button-mask-name
(sdl-mouse-masks->list
(sdl-mouse-motion-event-state e)))))
(x sdl-mouse-motion-event-x)
(y sdl-mouse-motion-event-y)
(xrel sdl-mouse-motion-event-xrel)
(yrel sdl-mouse-motion-event-yrel))
fields: (((Uint32 windowID)
guard: (Uint32-guard "sdl-mouse-motion-event field windowID")
get: sdl-mouse-motion-event-window-id
set: sdl-mouse-motion-event-window-id-set!)
((Uint32 which)
guard: (Uint32-guard "sdl-mouse-motion-event field which")
get: sdl-mouse-motion-event-which
set: sdl-mouse-motion-event-which-set!)
((Uint32 state)
guard: (Uint32-guard "sdl-mouse-motion-event field state")
get: sdl-mouse-motion-event-state
set: sdl-mouse-motion-event-state-set!)
((Sint32 x)
guard: (Sint32-guard "sdl-mouse-motion-event field x")
get: sdl-mouse-motion-event-x
set: sdl-mouse-motion-event-x-set!)
((Sint32 y)
guard: (Sint32-guard "sdl-mouse-motion-event field y")
get: sdl-mouse-motion-event-y
set: sdl-mouse-motion-event-y-set!)
((Sint32 xrel)
guard: (Sint32-guard "sdl-mouse-motion-event field xrel")
get: sdl-mouse-motion-event-xrel
set: sdl-mouse-motion-event-xrel-set!)
((Sint32 yrel)
guard: (Sint32-guard "sdl-mouse-motion-event field yrel")
get: sdl-mouse-motion-event-yrel
set: sdl-mouse-motion-event-yrel-set!)))
(define-sdl-event-type "SDL_MouseWheelEvent"
types: (SDL_MOUSEWHEEL)
make: make-sdl-mouse-wheel-event
predicate: sdl-mouse-wheel-event?
print-fields: ((x sdl-mouse-wheel-event-x)
(y sdl-mouse-wheel-event-y))
fields: (((Uint32 windowID)
guard: (Uint32-guard "sdl-mouse-wheel-event field windowID")
get: sdl-mouse-wheel-event-window-id
set: sdl-mouse-wheel-event-window-id-set!)
((Uint32 which)
guard: (Uint32-guard "sdl-mouse-wheel-event field which")
get: sdl-mouse-wheel-event-which
set: sdl-mouse-wheel-event-which-set!)
((Sint32 x)
guard: (Sint32-guard "sdl-mouse-wheel-event field x")
get: sdl-mouse-wheel-event-x
set: sdl-mouse-wheel-event-x-set!)
((Sint32 y)
guard: (Sint32-guard "sdl-mouse-wheel-event field y")
get: sdl-mouse-wheel-event-y
set: sdl-mouse-wheel-event-y-set!)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; JOYSTICK
(export make-sdl-joy-axis-event
sdl-joy-axis-event?
sdl-joy-axis-event-which
sdl-joy-axis-event-which-set!
sdl-joy-axis-event-axis
sdl-joy-axis-event-axis-set!
sdl-joy-axis-event-value
sdl-joy-axis-event-value-set!
make-sdl-joy-ball-event
sdl-joy-ball-event?
sdl-joy-ball-event-which
sdl-joy-ball-event-which-set!
sdl-joy-ball-event-ball
sdl-joy-ball-event-ball-set!
sdl-joy-ball-event-xrel
sdl-joy-ball-event-xrel-set!
sdl-joy-ball-event-yrel
sdl-joy-ball-event-yrel-set!
make-sdl-joy-hat-event
sdl-joy-hat-event?
sdl-joy-hat-event-which
sdl-joy-hat-event-which-set!
sdl-joy-hat-event-hat
sdl-joy-hat-event-hat-set!
sdl-joy-hat-event-value
sdl-joy-hat-event-value-set!
make-sdl-joy-button-event
sdl-joy-button-event?
sdl-joy-button-event-which
sdl-joy-button-event-which-set!
sdl-joy-button-event-button
sdl-joy-button-event-button-set!
sdl-joy-button-event-state
sdl-joy-button-event-state-set!
make-sdl-joy-device-event
sdl-joy-device-event?
sdl-joy-device-event-which
sdl-joy-device-event-which-set!)
(define-sdl-event-type "SDL_JoyAxisEvent"
types: (SDL_JOYAXISMOTION)
make: make-sdl-joy-axis-event
predicate: sdl-joy-axis-event?
print-fields: ((which sdl-joy-axis-event-which)
(axis sdl-joy-axis-event-axis)
(value sdl-joy-axis-event-value))
fields: (((SDL_JoystickID which)
guard: noop-guard
get: sdl-joy-axis-event-which
set: sdl-joy-axis-event-which-set!)
((Uint8 axis)
guard: (Uint8-guard "sdl-joy-axis-event field axis")
get: sdl-joy-axis-event-axis
set: sdl-joy-axis-event-axis-set!)
((Sint16 value)
guard: (Sint16-guard "sdl-joy-axis-event field value")
get: sdl-joy-axis-event-value
set: sdl-joy-axis-event-value-set!)))
(define-sdl-event-type "SDL_JoyBallEvent"
types: (SDL_JOYBALLMOTION)
make: make-sdl-joy-ball-event
predicate: sdl-joy-ball-event?
print-fields: ((which sdl-joy-ball-event-which)
(ball sdl-joy-ball-event-ball)
(xrel sdl-joy-ball-event-xrel)
(yrel sdl-joy-ball-event-yrel))
fields: (((SDL_JoystickID which)
guard: noop-guard
get: sdl-joy-ball-event-which
set: sdl-joy-ball-event-which-set!)
((Uint8 ball)
guard: (Uint8-guard "sdl-joy-ball-event field ball")
get: sdl-joy-ball-event-ball
set: sdl-joy-ball-event-ball-set!)
((Sint16 xrel)
guard: (Sint16-guard "sdl-joy-ball-event field xrel")
get: sdl-joy-ball-event-xrel
set: sdl-joy-ball-event-xrel-set!)
((Sint16 yrel)
guard: (Sint16-guard "sdl-joy-ball-event field yrel")
get: sdl-joy-ball-event-yrel
set: sdl-joy-ball-event-yrel-set!)))
(define-sdl-event-type "SDL_JoyButtonEvent"
types: (SDL_JOYBUTTONDOWN
SDL_JOYBUTTONUP)
make: make-sdl-joy-button-event
predicate: sdl-joy-button-event?
print-fields: ((which sdl-joy-button-event-which)
(button sdl-joy-button-event-button)
(state sdl-joy-button-event-state))
fields: (((SDL_JoystickID which)
guard: noop-guard
get: sdl-joy-button-event-which
set: sdl-joy-button-event-which-set!)
((Uint8 button)
guard: (Uint8-guard "sdl-joy-button-event field button")
get: sdl-joy-button-event-button
set: sdl-joy-button-event-button-set!)
((Uint8 state)
guard: (Uint8-guard "sdl-joy-button-event field state")
get: sdl-joy-button-event-state
set: sdl-joy-button-event-state-set!)))
(define-sdl-event-type "SDL_JoyHatEvent"
types: (SDL_JOYHATMOTION)
make: make-sdl-joy-hat-event
predicate: sdl-joy-hat-event?
print-fields: ((which sdl-joy-hat-event-which)
(hat sdl-joy-hat-event-hat)
(value sdl-joy-hat-event-value))
fields: (((SDL_JoystickID which)
guard: noop-guard
get: sdl-joy-hat-event-which
set: sdl-joy-hat-event-which-set!)
((Uint8 hat)
guard: (Uint8-guard "sdl-joy-hat-event field hat")
get: sdl-joy-hat-event-hat
set: sdl-joy-hat-event-hat-set!)
((Uint8 value)
guard: (Uint8-guard "sdl-joy-hat-event field value")
get: sdl-joy-hat-event-value
set: sdl-joy-hat-event-value-set!)))
(define-sdl-event-type "SDL_JoyDeviceEvent"
types: (SDL_JOYDEVICEADDED
SDL_JOYDEVICEREMOVED)
make: make-sdl-joy-device-event
predicate: sdl-joy-device-event?
print-fields: ((which sdl-joy-device-event-which))
fields: (((Sint32 which)
guard: (Sint32-guard "sdl-joy-device-event field which")
get: sdl-joy-device-event-which
set: sdl-joy-device-event-which-set!)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; CONTROLLER
(export make-sdl-controller-axis-event
sdl-controller-axis-event?
sdl-controller-axis-event-which
sdl-controller-axis-event-which-set!
sdl-controller-axis-event-axis
sdl-controller-axis-event-axis-set!
sdl-controller-axis-event-value
sdl-controller-axis-event-value-set!
make-sdl-controller-button-event
sdl-controller-button-event?
sdl-controller-button-event-which
sdl-controller-button-event-which-set!
sdl-controller-button-event-button
sdl-controller-button-event-button-set!
sdl-controller-button-event-state
sdl-controller-button-event-state-set!
make-sdl-controller-device-event
sdl-controller-device-event?
sdl-controller-device-event-which
sdl-controller-device-event-which-set!)
(define-sdl-event-type "SDL_ControllerAxisEvent"
types: (SDL_CONTROLLERAXISMOTION)
make: make-sdl-controller-axis-event
predicate: sdl-controller-axis-event?
print-fields: ((which sdl-controller-axis-event-which)
(axis sdl-controller-axis-event-axis)
(value sdl-controller-axis-event-value))
fields: (((SDL_JoystickID which)
guard: noop-guard
get: sdl-controller-axis-event-which
set: sdl-controller-axis-event-which-set!)
((Uint8 axis)
guard: (Uint8-guard "sdl-controller-axis-event field axis")
get: sdl-controller-axis-event-axis
set: sdl-controller-axis-event-axis-set!)
((Sint16 value)
guard: (Sint16-guard "sdl-controller-axis-event field value")
get: sdl-controller-axis-event-value
set: sdl-controller-axis-event-value-set!)))
(define-sdl-event-type "SDL_ControllerButtonEvent"
types: (SDL_CONTROLLERBUTTONDOWN
SDL_CONTROLLERBUTTONUP)
make: make-sdl-controller-button-event
predicate: sdl-controller-button-event?
print-fields: ((which sdl-controller-button-event-which)
(button sdl-controller-button-event-button)
(state sdl-controller-button-event-state))
fields: (((SDL_JoystickID which)
guard: noop-guard
get: sdl-controller-button-event-which
set: sdl-controller-button-event-which-set!)
((Uint8 button)
guard: (Uint8-guard "sdl-controller-button-event field button")
get: sdl-controller-button-event-button
set: sdl-controller-button-event-button-set!)
((Uint8 state)
guard: (Uint8-guard "sdl-controller-button-event field state")
get: sdl-controller-button-event-state
set: sdl-controller-button-event-state-set!)))
(define-sdl-event-type "SDL_ControllerDeviceEvent"
types: (SDL_CONTROLLERDEVICEADDED
SDL_CONTROLLERDEVICEREMOVED
SDL_CONTROLLERDEVICEREMAPPED)
make: make-sdl-controller-device-event
predicate: sdl-controller-device-event?
print-fields: ((which sdl-joy-device-event-which))
fields: (((Sint32 which)
guard: (Sint32-guard "sdl-controller-device-event field which")
get: sdl-controller-device-event-which
set: sdl-controller-device-event-which-set!)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; TOUCH / GESTURE
(export make-sdl-touch-finger-event
sdl-touch-finger-event?
sdl-touch-finger-event-touch-id
sdl-touch-finger-event-touch-id-set!
sdl-touch-finger-event-finger-id
sdl-touch-finger-event-finger-id-set!
sdl-touch-finger-event-x
sdl-touch-finger-event-x-set!
sdl-touch-finger-event-y
sdl-touch-finger-event-y-set!
sdl-touch-finger-event-dx
sdl-touch-finger-event-dx-set!
sdl-touch-finger-event-dy
sdl-touch-finger-event-dy-set!
sdl-touch-finger-event-pressure
sdl-touch-finger-event-pressure-set!
make-sdl-multi-gesture-event
sdl-multi-gesture-event?
sdl-multi-gesture-event-touch-id
sdl-multi-gesture-event-touch-id-set!
sdl-multi-gesture-event-dtheta
sdl-multi-gesture-event-dtheta-set!
sdl-multi-gesture-event-ddist
sdl-multi-gesture-event-ddist-set!
sdl-multi-gesture-event-x
sdl-multi-gesture-event-x-set!
sdl-multi-gesture-event-y
sdl-multi-gesture-event-y-set!
sdl-multi-gesture-event-num-fingers
sdl-multi-gesture-event-num-fingers-set!
make-sdl-dollar-gesture-event
sdl-dollar-gesture-event?
sdl-dollar-gesture-event-touch-id
sdl-dollar-gesture-event-touch-id-set!
sdl-dollar-gesture-event-gesture-id
sdl-dollar-gesture-event-gesture-id-set!
sdl-dollar-gesture-event-num-fingers
sdl-dollar-gesture-event-num-fingers-set!
sdl-dollar-gesture-event-error
sdl-dollar-gesture-event-error-set!
sdl-dollar-gesture-event-x
sdl-dollar-gesture-event-x-set!
sdl-dollar-gesture-event-y
sdl-dollar-gesture-event-y-set!)
(define-sdl-event-type "SDL_TouchFingerEvent"
types: (SDL_FINGERDOWN
SDL_FINGERUP
SDL_FINGERMOTION)
make: make-sdl-touch-finger-event
predicate: sdl-touch-finger-event?
print-fields: ((touch-id sdl-touch-finger-event-touch-id)
(finger-id sdl-touch-finger-event-finger-id)
(x sdl-touch-finger-event-x)
(y sdl-touch-finger-event-y)
(dx sdl-touch-finger-event-dx)
(dy sdl-touch-finger-event-dy)
(pressure sdl-touch-finger-event-pressure))
fields: (((SDL_TouchID touchId)
guard: noop-guard
get: sdl-touch-finger-event-touch-id
set: sdl-touch-finger-event-touch-id-set!)
((SDL_FingerID fingerId)
guard: noop-guard
get: sdl-touch-finger-event-finger-id
set: sdl-touch-finger-event-finger-id-set!)
((float x)
guard: noop-guard
get: sdl-touch-finger-event-x
set: sdl-touch-finger-event-x-set!)
((float y)
guard: noop-guard
get: sdl-touch-finger-event-y
set: sdl-touch-finger-event-y-set!)
((float dx)
guard: noop-guard
get: sdl-touch-finger-event-dx
set: sdl-touch-finger-event-dx-set!)
((float dy)
guard: noop-guard
get: sdl-touch-finger-event-dy
set: sdl-touch-finger-event-dy-set!)
((float pressure)
guard: noop-guard
get: sdl-touch-finger-event-pressure
set: sdl-touch-finger-event-pressure-set!)))
(define-sdl-event-type "SDL_MultiGestureEvent"
types: (SDL_MULTIGESTURE)
make: make-sdl-multi-gesture-event
predicate: sdl-multi-gesture-event?
print-fields: ((touch-id sdl-multi-gesture-event-touch-id)
(dtheta sdl-multi-gesture-event-dtheta)
(ddist sdl-multi-gesture-event-ddist)
(x sdl-multi-gesture-event-x)
(y sdl-multi-gesture-event-y)
(num-fingers sdl-multi-gesture-event-num-fingers))
fields: (((SDL_TouchID touchId)
guard: noop-guard
get: sdl-multi-gesture-event-touch-id
set: sdl-multi-gesture-event-touch-id-set!)
((float dTheta)
guard: noop-guard
get: sdl-multi-gesture-event-dtheta
set: sdl-multi-gesture-event-dtheta-set!)
((float dDist)
guard: noop-guard
get: sdl-multi-gesture-event-ddist
set: sdl-multi-gesture-event-ddist-set!)
((float x)
guard: noop-guard
get: sdl-multi-gesture-event-x
set: sdl-multi-gesture-event-x-set!)
((float y)
guard: noop-guard
get: sdl-multi-gesture-event-y
set: sdl-multi-gesture-event-y-set!)
((Uint16 numFingers)
guard: (Uint16-guard "sdl-multi-gesture-event field numFingers")
get: sdl-multi-gesture-event-num-fingers
set: sdl-multi-gesture-event-num-fingers-set!)))
(define-sdl-event-type "SDL_DollarGestureEvent"
types: (SDL_DOLLARGESTURE
SDL_DOLLARRECORD)
make: make-sdl-dollar-gesture-event
predicate: sdl-dollar-gesture-event?
print-fields: ((touch-id sdl-dollar-gesture-event-touch-id)
(gesture-id sdl-dollar-gesture-event-gesture-id)
(num-fingers sdl-dollar-gesture-event-num-fingers)
(error sdl-dollar-gesture-event-error)
(x sdl-dollar-gesture-event-x)
(y sdl-dollar-gesture-event-y))
fields: (((SDL_TouchID touchId)
guard: noop-guard
get: sdl-dollar-gesture-event-touch-id
set: sdl-dollar-gesture-event-touch-id-set!)
((SDL_GestureID gestureId)
guard: noop-guard
get: sdl-dollar-gesture-event-gesture-id
set: sdl-dollar-gesture-event-gesture-id-set!)
((Uint32 numFingers)
guard: (Uint32-guard "sdl-dollar-gesture-event field numFingers")
get: sdl-dollar-gesture-event-num-fingers
set: sdl-dollar-gesture-event-num-fingers-set!)
;; See below.
;; ((float error)
;; guard: noop-guard
;; get: sdl-dollar-gesture-event-error
;; set: sdl-dollar-gesture-event-error-set!)
((float x)
guard: noop-guard
get: sdl-dollar-gesture-event-x
set: sdl-dollar-gesture-event-x-set!)
((float y)
guard: noop-guard
get: sdl-dollar-gesture-event-y
set: sdl-dollar-gesture-event-y-set!)))
;; The field name "error" messes up the macro. Maybe the macro could
;; be fixed, but for now I'm just going to define these accessors
;; manually, below.
(define (sdl-dollar-gesture-event-error-set! event value)
(assert (sdl-dollar-gesture-event? event))
(let ((guarded-value (noop-guard value)))
((foreign-lambda*
void ((SDL_Event* ev) (float val))
"((SDL_DollarGestureEvent*)ev)->error = val;")
event guarded-value)))
(define sdl-dollar-gesture-event-error
(getter-with-setter
(lambda (event)
(assert (sdl-dollar-gesture-event? event))
((foreign-lambda*
float ((SDL_Event* ev))
"C_return(((SDL_DollarGestureEvent*)ev)->error);")
event))
sdl-dollar-gesture-event-error-set!))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; MISC
(export make-sdl-window-event
sdl-window-event?
sdl-window-event-window-id
sdl-window-event-window-id-set!
sdl-window-event-event
sdl-window-event-event-set!
sdl-window-event-data1
sdl-window-event-data1-set!
sdl-window-event-data2
sdl-window-event-data2-set!
make-sdl-drop-event
sdl-drop-event?
sdl-drop-event-file
sdl-drop-event-file-set!
make-sdl-quit-event
sdl-quit-event?
make-sdl-user-event
sdl-user-event?
sdl-user-event-window-id
sdl-user-event-window-id-set!
sdl-user-event-code
sdl-user-event-code-set!
sdl-user-event-data1
sdl-user-event-data1-set!
sdl-user-event-data2
sdl-user-event-data2-set!
make-sdl-sys-wm-event
sdl-sys-wm-event?
sdl-sys-wm-event-msg
sdl-sys-wm-event-msg-set!)
(define-sdl-event-type "SDL_WindowEvent"
types: (SDL_WINDOWEVENT)
make: make-sdl-window-event
predicate: sdl-window-event?
print-fields: ((window-id sdl-window-event-window-id)
(event sdl-window-event-event)
(data1 sdl-window-event-data1)
(data2 sdl-window-event-data2))
fields: (((Uint32 windowID)
guard: (Uint32-guard "sdl-window-event field windowID")
get: sdl-window-event-window-id
set: sdl-window-event-window-id-set!)
((Uint8 event)
guard: (Uint8-guard "sdl-window-event field event")
get: sdl-window-event-event
set: sdl-window-event-event-set!)
((Sint32 data1)
guard: (Sint32-guard "sdl-window-event field data1")
get: sdl-window-event-data1
set: sdl-window-event-data1-set!)
((Sint32 data2)
guard: (Sint32-guard "sdl-window-event field data2")
get: sdl-window-event-data2
set: sdl-window-event-data2-set!)))
(define-sdl-event-type "SDL_DropEvent"
types: (SDL_DROPFILE)
make: make-sdl-drop-event
predicate: sdl-drop-event?
print-fields: ((file sdl-drop-event-file))
fields: (((c-string file)
guard: noop-guard
get: sdl-drop-event-file
set: sdl-drop-event-file-set!)))
(define-sdl-event-type "SDL_QuitEvent"
types: (SDL_QUIT)
make: make-sdl-quit-event
predicate: sdl-quit-event?
fields: ())
(define-sdl-event-type "SDL_UserEvent"
types: (SDL_USEREVENT)
make: make-sdl-user-event
predicate: sdl-user-event?
print-fields: ((code sdl-user-event-code))
fields: (((Uint32 windowID)
guard: (Uint32-guard "sdl-user-event field windowID")
get: sdl-user-event-window-id
set: sdl-user-event-window-id-set!)
((Sint32 code)
guard: (Sint32-guard "sdl-user-event field code")
get: sdl-user-event-code
set: sdl-user-event-code-set!)
((c-pointer data1)
guard: noop-guard
get: sdl-user-event-data1
set: sdl-user-event-data1-set!)
((c-pointer data2)
guard: noop-guard
get: sdl-user-event-data2
set: sdl-user-event-data2-set!)))
(define-sdl-event-type "SDL_SysWMEvent"
types: (SDL_SYSWMEVENT)
make: make-sdl-sys-wm-event
predicate: sdl-sys-wm-event?
fields: (((SDL_SysWMmsg* msg)
guard: noop-guard
get: sdl-sys-wm-event-msg
set: sdl-sys-wm-event-msg-set!)))
| false |
a9e19ece765897c9f6449461b5f982eb3f3e47fb
|
f05faa71d7fef7301d30fb8c752f726c8b8c77d4
|
/src/exercises/ex-1.16.scm
|
e0c0d44d3c70207b996b0e70160b9962ae119ec3
|
[] |
no_license
|
yamad/sicp
|
c9e8a53799f0ca6f02b47acd23189b2ca91fe419
|
11e3a59f41ed411814411e80f17606e49ba1545a
|
refs/heads/master
| 2021-01-21T09:53:44.834639 | 2017-02-27T19:32:23 | 2017-02-27T19:32:23 | 83,348,438 | 1 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,099 |
scm
|
ex-1.16.scm
|
#!/usr/bin/env mzscheme
#lang scheme
;; ex 1.16
;; -------
;; An iterative, log growth, successive square process for calculating
;; the b to the power of n
(define (square x) (* x x))
(define (even? x) (= (remainder x 2) 0))
;; My version
(define (fast-expt-iter b n)
(define (iter b n a)
(if (= n 0)
a
(iter b (- n 1) (* a (square b)))))
(if (even? n)
(iter b (/ n 2) 1)
(iter b (/ (- n 1) 2) b)))
;; Scheme Wiki version
(define (fast-expt-iter-other b n)
(define (iter b n a)
(cond ((= n 0) a)
((even? n) (iter (square b) (/ n 2) a))
(else (iter b (- n 1) (* a b)))))
(iter b n 1))
(require (planet schematics/schemeunit:3))
(require (planet schematics/schemeunit:3/text-ui))
(define tests
(test-suite
"Tests"
(check-eq? (fast-expt-iter 2 10)
1024)
(check-eq? (fast-expt-iter 4 1)
4)
(check-eq? (fast-expt-iter 3 7)
2187)
(check-eq? (fast-expt-iter 5 0)
1)
(check-eq? (fast-expt-iter-other 2 10)
1024)
))
(run-tests tests)
| false |
55b52eea7fc6ac1e903729056686840e1fc18155
|
b1b1e288efe8621f2bf2c8bc3eea9e30fc251501
|
/tests/test_prim.ss
|
b6b6fa48ea7b9cedd0013fa4571c7b88ac2d27b0
|
[
"ISC"
] |
permissive
|
lojikil/hydra
|
37e32a43afc2443e29a73387fe796b559756a957
|
366cae2e155c6e4d5e27ad19d3183687a40c82a3
|
refs/heads/master
| 2020-05-30T08:41:19.374996 | 2014-11-13T03:10:22 | 2014-11-13T03:10:22 | 58,539,402 | 5 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 253 |
ss
|
test_prim.ss
|
(define (md5sum s)
(%prim "SExp *ret = nil;
char result[16] = {0};
MD5_CTX hash;
MD5_Init(&hash);
MD5_Update(h, (void *)s->object.str, sizeof(char) * s->object.length);
MD5_Final(&result, hash);
return makestring(result);"))
| false |
e218919ca59ee96c67199eca3cb978e6e1af6ba6
|
1a64a1cff5ce40644dc27c2d951cd0ce6fcb6442
|
/testing/test-tree-K.scm
|
63c59c0a141d7c33b2633a696b32c88d1f5ec788
|
[] |
no_license
|
skchoe/2007.rviz-objects
|
bd56135b6d02387e024713a9f4a8a7e46c6e354b
|
03c7e05e85682d43ab72713bdd811ad1bbb9f6a8
|
refs/heads/master
| 2021-01-15T23:01:58.789250 | 2014-05-26T17:35:32 | 2014-05-26T17:35:32 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 665 |
scm
|
test-tree-K.scm
|
(module test-tree-K mzscheme
(require (lib "mred.ss" "mred")
(lib "class.ss")
(lib "list.ss")
(lib "etc.ss")
(lib "match.ss"))
; (define lc-node (make-tree-leaf 'left-leaf))
; (define rc-node (make-tree-leaf 'right-leaf))
; (define top-node (make-struct 'top lc-node rc-node))
;
(define hashT (make-hash-table 'weak))
(hash-table-put! hashT 1 "a")
(hash-table-put! hashT 2 "b")
(printf "~s \n" (hash-table-get hashT 2))
(let* ((lst (build-list 100 (lambda (n) n))))
(printf "~s is length of lst\n" (length lst))
(for-each (lambda (n) (printf "~s \t" n)) lst)))
| false |
309d2c93090f55156f55c4ec230f1da476d588b6
|
2163cd08beac073044187423727f84510a1dbc34
|
/library/util.scm
|
1e70f3c21394673c9bcc5203343e07a8b8a10154
|
[] |
no_license
|
radiganm/sicp
|
b40995ad4d681e2950698295df1bbe3a75565528
|
32a7dcdf5678bb54d07ee3ee8a824842907489f0
|
refs/heads/master
| 2021-01-19T10:48:52.579235 | 2016-12-12T10:47:18 | 2016-12-12T10:47:18 | 63,052,284 | 3 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 6,669 |
scm
|
util.scm
|
#!/usr/bin/csi -s
;; util.scm
;; Mac Radigan
(module util (
bind
bar
bin
br
but-last
ck
compose
dec
dotprod
flatmap
fmt
hr
hex
inc
my-iota
join
kron-comb
lfsr
mat-*
mat-col
mat-row
mod
my-last
nth
oct
permute
pr
prn
prnvar
my-reverse
range
rotate-right
rotate-left
rotate
square
sum
xor
Y
Y-normal
Y2
yeild
)
(import scheme chicken)
(use extras)
(use srfi-1)
;;; debug, formatted printing, and assertions
(define (br)
(format #t "~%"))
(define (pr x)
(format #t "~a" x))
(define (fmt s x)
(format #t s x))
(define (prn x)
(format #t "~a~%" x))
(define (prnvar name value)
(format #t "~a := ~a~%" name value))
(define (ck name pred? value expect)
(cond
( (not (pred? value expect)) (format #t "~a = ~a ; fail expected ~a~%" name value expect) )
)
(assert (pred? value expect))
(format #t "~a = ~a ; ok: expected ~a~%" name value expect)
) ; ck
;;; numeric formatting
(define (hex x) (format #t "~x~%" x))
(define (bin x) (format #t "~b~%" x))
(define (oct x) (format #t "~o~%" x))
;;; delimiters
(define (bar) (format #t "~a~%" (make-string 80 #\=)))
(define (hr) (format #t "~a~%" (make-string 80 #\-)))
;;; returns the nth element of list x
(define (nth x n)
(if (= n 1)
(car x)
(nth (cdr x) (- n 1))
) ; if last iter
) ; nth
;;; returns the inner product <u,v>
(define (dotprod u v)
(apply + (map * u v))
)
;;; returns x mod n
(define (mod x n)
(- x (* n (floor (/ x n))))
)
;;; the permutation x by p
(define (permute x p)
(map (lambda (pk) (nth x pk)) p)
)
;;; circular shift (left) of x by n
(define (rotate-left x n)
(if (< n 1)
x
(rotate-left (append (cdr x) (list (car x))) (- n 1))
) ; if last iter
) ; rotate-left
;;; circular shift (right) of x by n
(define (rotate-right x n)
(if (< n 1)
x
(rotate-right
(append (list (my-last x)) (but-last x))
(- n 1)
) ; call
) ; if last iter
) ; rotate-right
;;; circular shift of x by n
(define (rotate x n)
(cond
((= n 0) x)
((> n 0) (rotate-right x n))
((< n 0) (rotate-left x (abs n)))
)
)
;;; return all but last element in list
(define (but-last x)
(if (null? x)
(list)
(if (null? (cdr x))
(list)
(cons (car x) (but-last (cdr x)))
) ; end if list contains only one element
) ; end if list null
)
;;; return the last element in list
(define (my-last x)
(if (null? x)
#f
(if (null? (cdr x))
(car x)
(my-last (cdr x))
) ; end if list contains only one element
) ; end if list null
)
;; composition
(define ((compose f g) x) (f (g x)))
;; my-reverse
(define (my-reverse x)
(if (null? x)
(list)
(append (my-reverse (cdr x)) (list (car x)))
)
)
;; Linear Feedback Shift Register (LFSR)
;; given initial state x[k-1] and coefficients a
;; return next state x[k]
(define (lfsr x a)
(append (list (dotprod x a)) (cdr (rotate x +1)) ) ; next state x[k]
) ; lfsr
;; matrix multiplication of column-major Iverson matrices
(define (mat-* A dimA B dimB)
(let (
; A_mxn * B_nxk = C_nxk
(M_rows (cadr dimA) ) ; M_rows
(N_cols (cadr dimB) ) ; N_cols
) ; local bindings
(map (lambda (rc)
(dotprod (mat-row A dimA (car rc)) (mat-col B dimB (cadr rc)) )
)
(kron-comb (my-iota N_cols) (my-iota M_rows))
)
) ; let
) ; mat-*
;; selects the kth column from a column-major Iverson matrix
;; NB: dim is a pair ( M_rows , N_cols )
(define (mat-col A dim k)
(let (
(start k ) ; start := kth column
(stride (cadr dim) ) ; stride := N_cols
(M_rows (car dim) ) ; M_rows
(N_cols (cadr dim) ) ; N_cols
) ; local bindings
(choose A (range start stride M_rows))
) ; let
) ; mat-col
;; selects the kth column from a column-major Iverson matrix
;; NB: dim is a pair ( M_rows , N_cols )
(define (mat-row A dim k)
(let (
(start (* k (cadr dim)) ) ; start := (kth row -1) * M_rows
(stride 1 ) ; stride := 1
(M_rows (car dim) ) ; M_rows
(N_cols (cadr dim) ) ; N_cols
) ; local bindings
(choose A (range start stride N_cols))
) ; let
) ; mat-col
;; flatmap (map flattened by one level)
(define (flatmap f x)
(apply append (map f x))
) ; flatmap
;; Kroneker combination of vectors a and b
(define (kron-comb a b)
(flatmap (lambda (ak) (map (lambda (bk) (list ak bk)) a)) b)
) ; kron-comb
;; returns a list with elements of x taken from positions ns
(define (choose x ns)
(map (lambda (k) (list-ref x k)) ns )
)
;; range sequence generator
(define (range start step n)
(range-iter '() start step n)
)
;; Iverson's iota: zero-based sequence of integers from 0..N
(define (my-iota n)
(range 0 1 n)
)
;; local scope: range sequence generator helper
(define (range-iter x val step n)
(if (< n 1)
x
(range-iter (append x (list val)) (+ val step) step (- n 1) ) ; x << val + step
)
)
;; exclusive or
(define (xor a b)
(or (and (not a) b) (and a (not b)))
)
;; square, sum, inc, and dec
(define (square x) (* x x))
(define (sum x) (apply + x) )
(define (inc x) (+ x 1))
(define (dec x) (- x 1))
;;; data transformations: bind, join, yeild
(define (bind f x) (join (map f x)))
(define (join x) (apply append '() x))
(define yeild list)
;; Y combiner
;; strict-order
(define Y
(lambda (f)
((lambda (x) (x x))
(lambda (x) (f (lambda (y) ((x x) y)))))))
;; normal-order
(define (Y-normal f)
((lambda (x) (x x))
(lambda (x) (f (x x)))))
(define Y2
(lambda (h)
(lambda args (apply (h (Y h)) args))))
) ; module util
;; hello.scm
;; *EOF*
| false |
4d198c4b19ec52e28c52f236b1bc335bbed6fd08
|
3453419571c01ee4e96cc30e8ff256a0bb2a4f5e
|
/utils.scm
|
7e7bb1cede58b694e1af6d0d943bfda17933555a
|
[] |
no_license
|
pbaille/parsing-combinators
|
bac66451f5c49df903223c7d7f6cbf3342acb740
|
98aa5dfdc3fd9b6cdc823d50cfdb096e9848f73e
|
refs/heads/master
| 2020-03-18T13:04:34.401334 | 2018-05-25T07:53:51 | 2018-05-25T07:53:51 | 134,759,804 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,794 |
scm
|
utils.scm
|
;; syntax ------------------------------------------------------------------------
(define-syntax comment
(lambda _ `(begin '())))
(define-syntax λ
(syntax-rules ()
((_ args . body)
(lambda args . body))))
;; utils --------------------------------------------------------------------------
(define (compose f g)
(λ args (g (apply f args))))
(define (cdrr x)
(if (pair? x)
(cdrr (cdr x))
x))
(define (proper! x)
(cond
((proper-list? x) x)
((pair? x) (cons (car x) (proper! (cdr x))))
(else (list x))))
(define (args-rest x)
(and (not (proper-list? x))
(cdrr x)))
(define (take xs n)
(if (or (null? xs)
(zero? n))
'()
(cons (car xs)
(take (cdr xs) (- n 1)))))
(define reduce
(case-lambda
((f xs)
(reduce f (car xs) (cdr xs)))
((f init xs)
(or (and (null? xs) init)
(reduce f (f init (car xs)) (cdr xs))))))
(define (drop xs n)
(if (or (zero? n) (null? xs))
xs
(drop (cdr xs) (- n 1))))
(define (min-len xs n)
(>= (length xs) n))
(define (take! xs n)
(and (min-len xs n)
(take xs n)))
(define (partition xs n)
(if (null? xs) xs
(cons (take xs n)
(partition (drop xs n) n))))
(define (interleave xs ys)
(if (or (null? xs) (null? ys))
'()
(cons (car xs)
(cons (car ys)
(interleave (cdr xs) (cdr ys))))))
(define range
(case-lambda
((from to)
(range from to (if (< from to) 1 -1)))
((from to by)
(let ((compare-fn (if (positive? by) < >)))
(if (compare-fn from to)
(cons from (range (+ from by) to by))
'())))))
(begin
(interleave '(1 2 3 4 5) '(1 2 3 4))
(range 10 0)
(range 1 10)
(range 10 0 -2)
(range 0 2 0.1)
)
| true |
96ad695e075a54ba58fb6f62d1bb400a9b80f405
|
9b2eb10c34176f47f7f490a4ce8412b7dd42cce7
|
/lib-compat/bigloo-yuni/compat/hashtables.sls
|
e607916329acdaaf86f2cd393cc100aa71a24400
|
[
"LicenseRef-scancode-public-domain",
"CC0-1.0"
] |
permissive
|
okuoku/yuni
|
8be584a574c0597375f023c70b17a5a689fd6918
|
1859077a3c855f3a3912a71a5283e08488e76661
|
refs/heads/master
| 2023-07-21T11:30:14.824239 | 2023-06-11T13:16:01 | 2023-07-18T16:25:22 | 17,772,480 | 36 | 6 |
CC0-1.0
| 2020-03-29T08:16:00 | 2014-03-15T09:53:13 |
Scheme
|
UTF-8
|
Scheme
| false | false | 763 |
sls
|
hashtables.sls
|
(library (bigloo-yuni compat hashtables)
(export
;; Yuni extension
; Constructors
make-integer-hashtable
make-string-hashtable
make-symbol-hashtable
; Iter
hashtable-for-each ;; Bigloo
hashtable-fold
;; R6RS
; Constructor
make-eq-hashtable
make-eqv-hashtable
; Mutators
hashtable-set!
hashtable-update! ;; Bigloo
; Accessor
hashtable-entries
hashtable-ref
; Query
hashtable-keys
hashtable-size ;; Bigloo
)
(import (yuni scheme))
;; Implemented in prelib
(error "This library should not be loaded")
)
| false |
c19c3bb88bd822ebfde7c4026d6149dd27de2300
|
f07bc117302b8959f25449863c6fdabdda510c48
|
/twenty-four-puzzle.scm
|
ccb3dfe129a37e07485f24bd0f2ccba5b7d9f4cd
|
[
"MIT"
] |
permissive
|
namin/clpsmt-miniKanren
|
3a1165a20dc1c50e4d568e2e493b701fb9f5caea
|
d2270aa14410805fa7068150bc2ab2f3bf9391b4
|
refs/heads/master
| 2022-03-10T07:05:21.950751 | 2022-02-26T23:54:05 | 2022-02-26T23:54:05 | 129,262,229 | 33 | 9 |
MIT
| 2021-08-03T16:02:50 | 2018-04-12T14:14:59 |
Scheme
|
UTF-8
|
Scheme
| false | false | 6,245 |
scm
|
twenty-four-puzzle.scm
|
;(load "mk.scm")
;(load "z3-driver.scm")
;(load "test-check.scm")
;;; Classic 24 math puzzle, as described at:
;;;
;;; https://www.mathsisfun.com/puzzles/24-from-8-8-3-3-solution.html
;;;
;;; and
;;;
;;; http://www.4nums.com/game/difficulties/
;;; This version of code is restricted to integer values, which means solutions like
;;;
;;; 8/(3-(8/3))
;;; = 8/(1/3)
;;; = 24
;;;
;;; do *not* work!
#|
;;; Original defn of remove-one-elemento, using (== x a) rather than (z/assert `(= ,x ,a)).
;;; Which version is preferable?
;;; What are the tradeoffs?
(define remove-one-elemento
(lambda (x ls out)
(fresh (a d)
(== `(,a . ,d) ls)
(conde
((== x a) (== d out))
((=/= x a)
(fresh (res)
(== `(,a . ,res) out)
(remove-one-elemento x d res)))))))
|#
;;; optimized version, more in the spirit of 24:
;;; assumes that 'ls' is a list of integers in
;;; *non-decreasing* order.
(define remove-one-elemento
(lambda (x ls out)
(fresh (a d)
(== `(,a . ,d) ls)
(numbero a)
(conde
((z/assert `(= ,a ,x))
(== d out))
((z/assert `(< ,a ,x))
(fresh (res)
(== `(,a . ,res) out)
(remove-one-elemento x d res)))))))
(define puzzleo
(lambda (expr num* val num*^)
(conde
[(numbero expr)
;; Originally used (== expr val).
;; Which version is preferable?
;; What are the tradeoffs?
(z/assert `(= ,expr ,val))
(remove-one-elemento expr num* num*^)]
[(fresh (a1 a2 n1 n2 num*^^)
(== `(+ ,a1 ,a2) expr)
(z/assert `(= ,val (+ ,n1 ,n2)))
(puzzleo a1 num* n1 num*^^)
(puzzleo a2 num*^^ n2 num*^))]
[(fresh (a1 a2 n1 n2 num*^^)
(== `(- ,a1 ,a2) expr)
(z/assert `(= ,val (- ,n1 ,n2)))
(puzzleo a1 num* n1 num*^^)
(puzzleo a2 num*^^ n2 num*^))]
[(fresh (a1 a2 n1 n2 num*^^)
(== `(* ,a1 ,a2) expr)
(z/assert `(= ,val (* ,n1 ,n2)))
(puzzleo a1 num* n1 num*^^)
(puzzleo a2 num*^^ n2 num*^))]
[(fresh (a1 a2 n1 n2 num*^^)
(== `(/ ,a1 ,a2) expr)
(z/assert `(not (= ,n2 0)))
(z/assert `(= ,val (div ,n1 ,n2)))
(puzzleo a1 num* n1 num*^^)
(puzzleo a2 num*^^ n2 num*^))]
)))
(test "remove-one-elemento-a"
(run* (q)
(fresh (x out)
(== (list x out) q)
(remove-one-elemento x '(2 2 10 10) out)))
'((2 (2 10 10))
(10 (2 2 10))))
;; On Will's lappy--timings, according to Chez Scheme:
;; vast majority of the time spent in Z3.
;;
;; run 1: 2.6s CPU time, 85s real time
;; ((* 8 (+ 1 (+ 1 1))))
;;
;; run 2: 3.5s CPU time, 118s real time
;; ((* 8 (+ 1 (+ 1 1)))
;; (* 8 (+ (+ 1 1) 1)))
;;
;; run 3: 9.4s CPU, 312s real time
;; ((* 8 (+ 1 (+ 1 1)))
;; (* 8 (+ (+ 1 1) 1))
;; (* (+ 1 (+ 1 1)) 8))
(test "24-puzzle-a"
(run 1 (e) (puzzleo e '(1 1 1 8) 24 '()))
'((* 8 (+ 1 (+ 1 1)))))
(test "24-puzzle-g"
(run 1 (e) (puzzleo e '(2 2 10 10) 24 '()))
'((+ 2 (+ 2 (+ 10 10)))))
;; On Will's lappy--timings, according to Chez Scheme:
;; vast majority of the time spent in Z3.
;;
;; run 1: 2.3s CPU time, 75s real time
;; ((/ (* 2 12) (/ 2 2)))
;;
;; run 2: 2.5s CPU time, 85s real time
;; ((/ (* 2 12) (/ 2 2))
;; (+ (- 2 2) (* 2 12)))
;;
;; run 3: 4.6s CPU time, 156s real time
;; ((/ (* 2 12) (/ 2 2))
;; (+ (- 2 2) (* 2 12))
;; (- 2 (- 2 (* 2 12))))
(test "24-puzzle-h"
(run 1 (e) (puzzleo e '(2 2 2 12) 24 '()))
'((/ (* 2 12) (/ 2 2))))
(test "24-puzzle-i"
(run 1 (e) (puzzleo e '(4 6 7 7) 24 '()))
'((+ 4 (+ 6 (+ 7 7)))))
;;; boring!!
(test "24-puzzle-b"
(run 1 (q)
(fresh (e num* n1 n2 n3 n4)
(== (list e num*) q)
(== `(,n1 ,n2 ,n3 ,n4) num*)
(puzzleo e num* 24 '())))
'(((+ 24 (+ 0 (+ 0 0))) (24 0 0 0))))
(test "24-puzzle-c"
(run 20 (e)
(fresh (num* n1 n2 n3 n4)
(z/assert `(< 1 ,n1))
(z/assert `(< 1 ,n2))
(z/assert `(< 1 ,n3))
(z/assert `(< 1 ,n4))
(== `(,n1 ,n2 ,n3 ,n4) num*)
(puzzleo e num* 24 '())))
'((+ 18 (+ 2 (+ 2 2)))
(+ 15 (+ 3 (+ 3 3)))
(+ 12 (+ 4 (+ 4 4)))
(+ 9 (+ 5 (+ 5 5)))
(+ 13 (+ 4 (+ 4 3)))
(+ 11 (+ 6 (+ 4 3)))
(+ 10 (+ 7 (+ 4 3)))
(+ 12 (+ 4 (+ 5 3)))
(+ 11 (+ 4 (+ 6 3)))
(+ 10 (+ 6 (+ 5 3)))
(+ 9 (+ 8 (+ 4 3)))
(+ 8 (+ 9 (+ 4 3)))
(+ 14 (+ 4 (+ 3 3)))
(+ 10 (+ 5 (+ 6 3)))
(+ 13 (+ 5 (+ 3 3)))
(+ 12 (+ 5 (+ 4 3)))
(+ 10 (+ 4 (+ 7 3)))
(+ 10 (+ 8 (+ 3 3)))
(+ 9 (+ 9 (+ 3 3)))
(+ 7 (+ 10 (+ 4 3)))))
(test "24-puzzle-d"
(run 10 (e)
(fresh (num* n1 n2 n3 n4 op1 op2 op3 e1 e2 e3 e4)
(z/assert `(< 0 ,n1))
(z/assert `(< 0 ,n2))
(z/assert `(< 0 ,n3))
(z/assert `(< 0 ,n4))
(== `(,n1 ,n2 ,n3 ,n4) num*)
(== `(,op1 (,op2 ,e1 ,e2) (,op3 ,e3 ,e4)) e)
(puzzleo e num* 24 '())))
'((+ (+ 21 1) (+ 1 1))
(+ (+ 18 2) (+ 2 2))
(+ (+ 15 3) (+ 3 3))
(+ (+ 12 4) (+ 4 4))
(+ (+ 16 3) (+ 3 2))
(+ (+ 14 5) (+ 3 2))
(+ (+ 13 6) (+ 3 2))
(+ (+ 15 3) (+ 4 2))
(+ (+ 14 3) (+ 5 2))
(+ (+ 13 5) (+ 4 2))))
(test "24-puzzle-e"
(run 10 (e)
(fresh (num* n1 n2 n3 n4 op e1 e2)
(z/assert `(< 0 ,n1))
(z/assert `(< 0 ,n2))
(z/assert `(< 0 ,n3))
(z/assert `(< 0 ,n4))
(== `(,n1 ,n2 ,n3 ,n4) num*)
(=/= op '+)
(== `(,op ,e1 ,e2) e)
(puzzleo e num* 24 '())))
'((- 27 (+ 1 (+ 1 1)))
(- 30 (+ 2 (+ 2 2)))
(- 33 (+ 3 (+ 3 3)))
(- 36 (+ 4 (+ 4 4)))
(- 32 (+ 3 (+ 3 2)))
(- 34 (+ 5 (+ 3 2)))
(- 35 (+ 6 (+ 3 2)))
(- 33 (+ 3 (+ 4 2)))
(- 34 (+ 3 (+ 5 2)))
(- 35 (+ 5 (+ 4 2)))))
(test "24-puzzle-f"
(run 10 (e)
(fresh (num* n1 n2 n3 n4 op e1 e2)
(z/assert `(< 0 ,n1))
(z/assert `(< 0 ,n2))
(z/assert `(< 0 ,n3))
(z/assert `(< 0 ,n4))
(== `(,n1 ,n2 ,n3 ,n4) num*)
(== op '*)
(== `(,op ,e1 ,e2) e)
(puzzleo e num* 24 '())))
'((* 2 (+ 2 (+ 4 6)))
(* 1 (+ 8 (+ 12 4)))
(* 3 (+ 1 (+ 4 3)))
(* 6 (+ 2 (+ 1 1)))
(* 1 (+ 16 (+ 1 7)))
(* 1 (+ 16 (+ 5 3)))
(* 1 (+ 2 (+ 16 6)))
(* 1 (+ 16 (+ 4 4)))
(* 2 (+ 3 (+ 8 1)))
(* 1 (+ 16 (+ 2 6)))))
| false |
e997ca87ebde83efdee1dd7003d7a4726fade004
|
a1737280e5bde10cf78c3514c1b0713ec750d36b
|
/lang/scheme/sicp/chapter1.scm
|
6af0eacb976307a6e55adb932d8b1c8bb8fb1af7
|
[] |
no_license
|
kaiwk/playground
|
ee691f6a98f6870e9e53dcf901c85dddb2a9d0cc
|
cf982a8ba769a232bfc63fd68f36fe863ca7a4c5
|
refs/heads/master
| 2022-02-19T01:23:49.474229 | 2019-09-05T12:59:13 | 2019-09-05T12:59:13 | 56,390,601 | 3 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,468 |
scm
|
chapter1.scm
|
;;; 1.1
(define (average x y)
(/ (+ x y) 2))
(define (square x)
(* x x))
(define (kermit/sqrt x)
(sqrt-iter 1.0 x))
(define (sqrt-iter guess x)
(if (good-enough? guess x)
guess
(sqrt-iter (improve guess x) x)))
(define (good-enough? guess x)
(< (abs (- (square guess) x)) 0.001))
(define (improve guess x)
(average guess (/ x guess)))
;; (kermit/sqrt 8)
;;; 1.2
;; 1 1 2 3 5 8
(define (fibnacci n)
(if (or (= 0 n) (= 1 n))
1
(+ (fibnacci (- n 2)) (fibnacci (- n 1)))))
(define (fibnacci-iter a b index)
(if (= index 0)
b
(fibnacci-iter b (+ a b) (- index 1))))
(define (fibnacci-better n)
(fibnacci-iter 0 1 n))
(define (first-denomination kinds-of-coins)
(cond ((= kinds-of-coins 1) 1)
((= kinds-of-coins 2) 5)
((= kinds-of-coins 3) 10)
((= kinds-of-coins 4) 25)
((= kinds-of-coins 5) 50)))
(define (cc amount kinds-of-coins)
(cond ((= amount 0) 1)
((or (< amount 0) (= kinds-of-coins 0)) 0)
(else (+
(cc amount (- kinds-of-coins 1))
(cc (- amount (first-denomination kinds-of-coins))
kinds-of-coins)))))
(define (count-change amount)
(cc amount 5))
(count-change 100)
;;; 1.3
(define (my-loop func range)
(let ((start (car range))
(end (cdr range)))
(if end
(if (>= end start)
(func)
(my-loop func (con (start))))
(if (> start 0)))))
| false |
6208249fea269714fd8919d56238cc8f78260c31
|
f08220a13ec5095557a3132d563a152e718c412f
|
/logrotate/skel/usr/share/guile/2.0/ice-9/deprecated.scm
|
56b9c0495b168e73ef714e99f7f95c20ba5ceb1d
|
[
"Apache-2.0"
] |
permissive
|
sroettger/35c3ctf_chals
|
f9808c060da8bf2731e98b559babd4bf698244ac
|
3d64486e6adddb3a3f3d2c041242b88b50abdb8d
|
refs/heads/master
| 2020-04-16T07:02:50.739155 | 2020-01-15T13:50:29 | 2020-01-15T13:50:29 | 165,371,623 | 15 | 5 |
Apache-2.0
| 2020-01-18T11:19:05 | 2019-01-12T09:47:33 |
Python
|
UTF-8
|
Scheme
| false | false | 31,993 |
scm
|
deprecated.scm
|
;;;; Copyright (C) 2003, 2005, 2006, 2009, 2010, 2011, 2012, 2013 Free Software Foundation, Inc.
;;;;
;;;; This library is free software; you can redistribute it and/or
;;;; modify it under the terms of the GNU Lesser General Public
;;;; License as published by the Free Software Foundation; either
;;;; version 3 of the License, or (at your option) any later version.
;;;;
;;;; This library is distributed in the hope that it will be useful,
;;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
;;;; Lesser General Public License for more details.
;;;;
;;;; You should have received a copy of the GNU Lesser General Public
;;;; License along with this library; if not, write to the Free Software
;;;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
;;;;
(define-module (ice-9 deprecated)
#:export (substring-move-left! substring-move-right!
dynamic-maybe-call dynamic-maybe-link
try-module-linked try-module-dynamic-link
list* feature? eval-case unmemoize-expr
$asinh
$acosh
$atanh
$sqrt
$abs
$exp
$expt
$log
$sin
$cos
$tan
$asin
$acos
$atan
$sinh
$cosh
$tanh
closure?
%nil
@bind
bad-throw
error-catching-loop
error-catching-repl
scm-style-repl
apply-to-args
has-suffix?
scheme-file-suffix
get-option
for-next-option
display-usage-report
transform-usage-lambda
collect
assert-repl-silence
assert-repl-print-unspecified
assert-repl-verbosity
set-repl-prompt!
set-batch-mode?!
repl
pre-unwind-handler-dispatch
default-pre-unwind-handler
handle-system-error
stack-saved?
the-last-stack
save-stack
named-module-use!
top-repl
turn-on-debugging
read-hash-procedures
process-define-module
fluid-let-syntax
set-system-module!
char-code-limit
generalized-vector?
generalized-vector-length
generalized-vector-ref
generalized-vector-set!
generalized-vector->list))
;;;; Deprecated definitions.
(define substring-move-left!
(lambda args
(issue-deprecation-warning
"`substring-move-left!' is deprecated. Use `substring-move!' instead.")
(apply substring-move! args)))
(define substring-move-right!
(lambda args
(issue-deprecation-warning
"`substring-move-right!' is deprecated. Use `substring-move!' instead.")
(apply substring-move! args)))
;; This method of dynamically linking Guile Extensions is deprecated.
;; Use `load-extension' explicitly from Scheme code instead.
(define (split-c-module-name str)
(let loop ((rev '())
(start 0)
(pos 0)
(end (string-length str)))
(cond
((= pos end)
(reverse (cons (string->symbol (substring str start pos)) rev)))
((eq? (string-ref str pos) #\space)
(loop (cons (string->symbol (substring str start pos)) rev)
(+ pos 1)
(+ pos 1)
end))
(else
(loop rev start (+ pos 1) end)))))
(define (convert-c-registered-modules dynobj)
(let ((res (map (lambda (c)
(list (split-c-module-name (car c)) (cdr c) dynobj))
(c-registered-modules))))
(c-clear-registered-modules)
res))
(define registered-modules '())
(define (register-modules dynobj)
(set! registered-modules
(append! (convert-c-registered-modules dynobj)
registered-modules)))
(define (warn-autoload-deprecation modname)
(issue-deprecation-warning
"Autoloading of compiled code modules is deprecated."
"Write a Scheme file instead that uses `load-extension'.")
(issue-deprecation-warning
(simple-format #f "(You just autoloaded module ~S.)" modname)))
(define (init-dynamic-module modname)
;; Register any linked modules which have been registered on the C level
(register-modules #f)
(or-map (lambda (modinfo)
(if (equal? (car modinfo) modname)
(begin
(warn-autoload-deprecation modname)
(set! registered-modules (delq! modinfo registered-modules))
(let ((mod (resolve-module modname #f)))
(save-module-excursion
(lambda ()
(set-current-module mod)
(set-module-public-interface! mod mod)
(dynamic-call (cadr modinfo) (caddr modinfo))
))
#t))
#f))
registered-modules))
(define (dynamic-maybe-call name dynobj)
(issue-deprecation-warning
"`dynamic-maybe-call' is deprecated. "
"Wrap `dynamic-call' in a `false-if-exception' yourself.")
(false-if-exception (dynamic-call name dynobj)))
(define (dynamic-maybe-link filename)
(issue-deprecation-warning
"`dynamic-maybe-link' is deprecated. "
"Wrap `dynamic-link' in a `false-if-exception' yourself.")
(false-if-exception (dynamic-link filename)))
(define (find-and-link-dynamic-module module-name)
(define (make-init-name mod-name)
(string-append "scm_init"
(list->string (map (lambda (c)
(if (or (char-alphabetic? c)
(char-numeric? c))
c
#\_))
(string->list mod-name)))
"_module"))
;; Put the subdirectory for this module in the car of SUBDIR-AND-LIBNAME,
;; and the `libname' (the name of the module prepended by `lib') in the cdr
;; field. For example, if MODULE-NAME is the list (inet tcp-ip udp), then
;; SUBDIR-AND-LIBNAME will be the pair ("inet/tcp-ip" . "libudp").
(let ((subdir-and-libname
(let loop ((dirs "")
(syms module-name))
(if (null? (cdr syms))
(cons dirs (string-append "lib" (symbol->string (car syms))))
(loop (string-append dirs (symbol->string (car syms)) "/")
(cdr syms)))))
(init (make-init-name (apply string-append
(map (lambda (s)
(string-append "_"
(symbol->string s)))
module-name)))))
(let ((subdir (car subdir-and-libname))
(libname (cdr subdir-and-libname)))
;; Now look in each dir in %LOAD-PATH for `subdir/libfoo.la'. If that
;; file exists, fetch the dlname from that file and attempt to link
;; against it. If `subdir/libfoo.la' does not exist, or does not seem
;; to name any shared library, look for `subdir/libfoo.so' instead and
;; link against that.
(let check-dirs ((dir-list %load-path))
(if (null? dir-list)
#f
(let* ((dir (in-vicinity (car dir-list) subdir))
(sharlib-full
(or (try-using-libtool-name dir libname)
(try-using-sharlib-name dir libname))))
(if (and sharlib-full (file-exists? sharlib-full))
(link-dynamic-module sharlib-full init)
(check-dirs (cdr dir-list)))))))))
(define (try-using-libtool-name libdir libname)
(let ((libtool-filename (in-vicinity libdir
(string-append libname ".la"))))
(and (file-exists? libtool-filename)
libtool-filename)))
(define (try-using-sharlib-name libdir libname)
(in-vicinity libdir (string-append libname ".so")))
(define (link-dynamic-module filename initname)
;; Register any linked modules which have been registered on the C level
(register-modules #f)
(let ((dynobj (dynamic-link filename)))
(dynamic-call initname dynobj)
(register-modules dynobj)))
(define (try-module-linked module-name)
(issue-deprecation-warning
"`try-module-linked' is deprecated."
"See the manual for how more on C extensions.")
(init-dynamic-module module-name))
(define (try-module-dynamic-link module-name)
(issue-deprecation-warning
"`try-module-dynamic-link' is deprecated."
"See the manual for how more on C extensions.")
(and (find-and-link-dynamic-module module-name)
(init-dynamic-module module-name)))
(define (list* . args)
(issue-deprecation-warning "'list*' is deprecated. Use 'cons*' instead.")
(apply cons* args))
(define (feature? sym)
(issue-deprecation-warning
"`feature?' is deprecated. Use `provided?' instead.")
(provided? sym))
(define-macro (eval-case . clauses)
(issue-deprecation-warning
"`eval-case' is deprecated. Use `eval-when' instead.")
;; Practically speaking, eval-case only had load-toplevel and else as
;; conditions.
(cond
((assoc-ref clauses '(load-toplevel))
=> (lambda (exps)
;; the *unspecified so that non-toplevel definitions will be
;; caught
`(begin *unspecified* . ,exps)))
((assoc-ref clauses 'else)
=> (lambda (exps)
`(begin *unspecified* . ,exps)))
(else
`(begin))))
;; The strange prototype system for uniform arrays has been
;; deprecated.
(read-hash-extend
#\y
(lambda (c port)
(issue-deprecation-warning
"The `#y' bytevector syntax is deprecated. Use `#s8' instead.")
(let ((x (read port)))
(cond
((list? x) (list->s8vector x))
(else (error "#y needs to be followed by a list" x))))))
(define (unmemoize-expr . args)
(issue-deprecation-warning
"`unmemoize-expr' is deprecated. Use `unmemoize-expression' instead.")
(apply unmemoize-expression args))
(define ($asinh z)
(issue-deprecation-warning
"`$asinh' is deprecated. Use `asinh' instead.")
(asinh z))
(define ($acosh z)
(issue-deprecation-warning
"`$acosh' is deprecated. Use `acosh' instead.")
(acosh z))
(define ($atanh z)
(issue-deprecation-warning
"`$atanh' is deprecated. Use `atanh' instead.")
(atanh z))
(define ($sqrt z)
(issue-deprecation-warning
"`$sqrt' is deprecated. Use `sqrt' instead.")
(sqrt z))
(define ($abs z)
(issue-deprecation-warning
"`$abs' is deprecated. Use `abs' instead.")
(abs z))
(define ($exp z)
(issue-deprecation-warning
"`$exp' is deprecated. Use `exp' instead.")
(exp z))
(define ($expt z1 z2)
(issue-deprecation-warning
"`$expt' is deprecated. Use `expt' instead.")
(expt z1 z2))
(define ($log z)
(issue-deprecation-warning
"`$log' is deprecated. Use `log' instead.")
(log z))
(define ($sin z)
(issue-deprecation-warning
"`$sin' is deprecated. Use `sin' instead.")
(sin z))
(define ($cos z)
(issue-deprecation-warning
"`$cos' is deprecated. Use `cos' instead.")
(cos z))
(define ($tan z)
(issue-deprecation-warning
"`$tan' is deprecated. Use `tan' instead.")
(tan z))
(define ($asin z)
(issue-deprecation-warning
"`$asin' is deprecated. Use `asin' instead.")
(asin z))
(define ($acos z)
(issue-deprecation-warning
"`$acos' is deprecated. Use `acos' instead.")
(acos z))
(define ($atan z)
(issue-deprecation-warning
"`$atan' is deprecated. Use `atan' instead.")
(atan z))
(define ($sinh z)
(issue-deprecation-warning
"`$sinh' is deprecated. Use `sinh' instead.")
(sinh z))
(define ($cosh z)
(issue-deprecation-warning
"`$cosh' is deprecated. Use `cosh' instead.")
(cosh z))
(define ($tanh z)
(issue-deprecation-warning
"`$tanh' is deprecated. Use `tanh' instead.")
(tanh z))
(define (closure? x)
(issue-deprecation-warning
"`closure?' is deprecated. Use `procedure?' instead.")
(procedure? x))
(define %nil #nil)
;;; @bind is used by the old elisp code as a dynamic scoping mechanism.
;;; Please let the Guile developers know if you are using this macro.
;;;
(define-syntax @bind
(lambda (x)
(define (bound-member id ids)
(cond ((null? ids) #f)
((bound-identifier=? id (car ids)) #t)
((bound-member (car ids) (cdr ids)))))
(issue-deprecation-warning
"`@bind' is deprecated. Use `with-fluids' instead.")
(syntax-case x ()
((_ () b0 b1 ...)
#'(let () b0 b1 ...))
((_ ((id val) ...) b0 b1 ...)
(and-map identifier? #'(id ...))
(if (let lp ((ids #'(id ...)))
(cond ((null? ids) #f)
((bound-member (car ids) (cdr ids)) #t)
(else (lp (cdr ids)))))
(syntax-violation '@bind "duplicate bound identifier" x)
(with-syntax (((old-v ...) (generate-temporaries #'(id ...)))
((v ...) (generate-temporaries #'(id ...))))
#'(let ((old-v id) ...
(v val) ...)
(dynamic-wind
(lambda ()
(set! id v) ...)
(lambda () b0 b1 ...)
(lambda ()
(set! id old-v) ...)))))))))
;; There are deprecated definitions for module-ref-submodule and
;; module-define-submodule! in boot-9.scm.
;; Define (%app) and (%app modules), and have (app) alias (%app). This
;; side-effects the-root-module, both to the submodules table and (through
;; module-define-submodule! above) the obarray.
;;
(let ((%app (make-module 31)))
(set-module-name! %app '(%app))
(module-define-submodule! the-root-module '%app %app)
(module-define-submodule! the-root-module 'app %app)
(module-define-submodule! %app 'modules (resolve-module '() #f)))
;; Allow code that poked %module-public-interface to keep on working.
;;
(set! module-public-interface
(let ((getter module-public-interface))
(lambda (mod)
(or (getter mod)
(cond
((and=> (module-local-variable mod '%module-public-interface)
variable-ref)
=> (lambda (iface)
(issue-deprecation-warning
"Setting a module's public interface via munging %module-public-interface is
deprecated. Use set-module-public-interface! instead.")
(set-module-public-interface! mod iface)
iface))
(else #f))))))
(set! set-module-public-interface!
(let ((setter set-module-public-interface!))
(lambda (mod iface)
(setter mod iface)
(module-define! mod '%module-public-interface iface))))
(define (bad-throw key . args)
(issue-deprecation-warning
"`bad-throw' in the default environment is deprecated.
Find it in the `(ice-9 scm-style-repl)' module instead.")
(apply (@ (ice-9 scm-style-repl) bad-throw) key args))
(define (error-catching-loop thunk)
(issue-deprecation-warning
"`error-catching-loop' in the default environment is deprecated.
Find it in the `(ice-9 scm-style-repl)' module instead.")
((@ (ice-9 scm-style-repl) error-catching-loop) thunk))
(define (error-catching-repl r e p)
(issue-deprecation-warning
"`error-catching-repl' in the default environment is deprecated.
Find it in the `(ice-9 scm-style-repl)' module instead.")
((@ (ice-9 scm-style-repl) error-catching-repl) r e p))
(define (scm-style-repl)
(issue-deprecation-warning
"`scm-style-repl' in the default environment is deprecated.
Find it in the `(ice-9 scm-style-repl)' module instead, or
better yet, use the repl from `(system repl repl)'.")
((@ (ice-9 scm-style-repl) scm-style-repl)))
;;; Apply-to-args had the following comment attached to it in boot-9, but it's
;;; wrong-headed: in the mentioned case, a point should either be a record or
;;; multiple values.
;;;
;;; apply-to-args is functionally redundant with apply and, worse,
;;; is less general than apply since it only takes two arguments.
;;;
;;; On the other hand, apply-to-args is a syntacticly convenient way to
;;; perform binding in many circumstances when the "let" family of
;;; of forms don't cut it. E.g.:
;;;
;;; (apply-to-args (return-3d-mouse-coords)
;;; (lambda (x y z)
;;; ...))
;;;
(define (apply-to-args args fn)
(issue-deprecation-warning
"`apply-to-args' is deprecated. Include a local copy in your program.")
(apply fn args))
(define (has-suffix? str suffix)
(issue-deprecation-warning
"`has-suffix?' is deprecated. Use `string-suffix?' instead (args reversed).")
(string-suffix? suffix str))
(define scheme-file-suffix
(lambda ()
(issue-deprecation-warning
"`scheme-file-suffix' is deprecated. Use `%load-extensions' instead.")
".scm"))
;;; {Command Line Options}
;;;
(define (get-option argv kw-opts kw-args return)
(issue-deprecation-warning
"`get-option' is deprecated. Use `(ice-9 getopt-long)' instead.")
(cond
((null? argv)
(return #f #f argv))
((or (not (eq? #\- (string-ref (car argv) 0)))
(eq? (string-length (car argv)) 1))
(return 'normal-arg (car argv) (cdr argv)))
((eq? #\- (string-ref (car argv) 1))
(let* ((kw-arg-pos (or (string-index (car argv) #\=)
(string-length (car argv))))
(kw (symbol->keyword (substring (car argv) 2 kw-arg-pos)))
(kw-opt? (member kw kw-opts))
(kw-arg? (member kw kw-args))
(arg (or (and (not (eq? kw-arg-pos (string-length (car argv))))
(substring (car argv)
(+ kw-arg-pos 1)
(string-length (car argv))))
(and kw-arg?
(begin (set! argv (cdr argv)) (car argv))))))
(if (or kw-opt? kw-arg?)
(return kw arg (cdr argv))
(return 'usage-error kw (cdr argv)))))
(else
(let* ((char (substring (car argv) 1 2))
(kw (symbol->keyword char)))
(cond
((member kw kw-opts)
(let* ((rest-car (substring (car argv) 2 (string-length (car argv))))
(new-argv (if (= 0 (string-length rest-car))
(cdr argv)
(cons (string-append "-" rest-car) (cdr argv)))))
(return kw #f new-argv)))
((member kw kw-args)
(let* ((rest-car (substring (car argv) 2 (string-length (car argv))))
(arg (if (= 0 (string-length rest-car))
(cadr argv)
rest-car))
(new-argv (if (= 0 (string-length rest-car))
(cddr argv)
(cdr argv))))
(return kw arg new-argv)))
(else (return 'usage-error kw argv)))))))
(define (for-next-option proc argv kw-opts kw-args)
(issue-deprecation-warning
"`for-next-option' is deprecated. Use `(ice-9 getopt-long)' instead.")
(let loop ((argv argv))
(get-option argv kw-opts kw-args
(lambda (opt opt-arg argv)
(and opt (proc opt opt-arg argv loop))))))
(define (display-usage-report kw-desc)
(issue-deprecation-warning
"`display-usage-report' is deprecated. Use `(ice-9 getopt-long)' instead.")
(for-each
(lambda (kw)
(or (eq? (car kw) #t)
(eq? (car kw) 'else)
(let* ((opt-desc kw)
(help (cadr opt-desc))
(opts (car opt-desc))
(opts-proper (if (string? (car opts)) (cdr opts) opts))
(arg-name (if (string? (car opts))
(string-append "<" (car opts) ">")
""))
(left-part (string-append
(with-output-to-string
(lambda ()
(map (lambda (x) (display (keyword->symbol x)) (display " "))
opts-proper)))
arg-name))
(middle-part (if (and (< (string-length left-part) 30)
(< (string-length help) 40))
(make-string (- 30 (string-length left-part)) #\ )
"\n\t")))
(display left-part)
(display middle-part)
(display help)
(newline))))
kw-desc))
(define (transform-usage-lambda cases)
(issue-deprecation-warning
"`display-usage-report' is deprecated. Use `(ice-9 getopt-long)' instead.")
(let* ((raw-usage (delq! 'else (map car cases)))
(usage-sans-specials (map (lambda (x)
(or (and (not (list? x)) x)
(and (symbol? (car x)) #t)
(and (boolean? (car x)) #t)
x))
raw-usage))
(usage-desc (delq! #t usage-sans-specials))
(kw-desc (map car usage-desc))
(kw-opts (apply append (map (lambda (x) (and (not (string? (car x))) x)) kw-desc)))
(kw-args (apply append (map (lambda (x) (and (string? (car x)) (cdr x))) kw-desc)))
(transmogrified-cases (map (lambda (case)
(cons (let ((opts (car case)))
(if (or (boolean? opts) (eq? 'else opts))
opts
(cond
((symbol? (car opts)) opts)
((boolean? (car opts)) opts)
((string? (caar opts)) (cdar opts))
(else (car opts)))))
(cdr case)))
cases)))
`(let ((%display-usage (lambda () (display-usage-report ',usage-desc))))
(lambda (%argv)
(let %next-arg ((%argv %argv))
(get-option %argv
',kw-opts
',kw-args
(lambda (%opt %arg %new-argv)
(case %opt
,@ transmogrified-cases))))))))
;;; {collect}
;;;
;;; Similar to `begin' but returns a list of the results of all constituent
;;; forms instead of the result of the last form.
;;;
(define-syntax collect
(lambda (x)
(issue-deprecation-warning
"`collect' is deprecated. Define it yourself.")
(syntax-case x ()
((_) #''())
((_ x x* ...)
#'(let ((val x))
(cons val (collect x* ...)))))))
(define (assert-repl-silence v)
(issue-deprecation-warning
"`assert-repl-silence' has moved to `(ice-9 scm-style-repl)'.")
((@ (ice-9 scm-style-repl) assert-repl-silence) v))
(define (assert-repl-print-unspecified v)
(issue-deprecation-warning
"`assert-repl-print-unspecified' has moved to `(ice-9 scm-style-repl)'.")
((@ (ice-9 scm-style-repl) assert-repl-print-unspecified) v))
(define (assert-repl-verbosity v)
(issue-deprecation-warning
"`assert-repl-verbosity' has moved to `(ice-9 scm-style-repl)'.")
((@ (ice-9 scm-style-repl) assert-repl-verbosity) v))
(define (set-repl-prompt! v)
(issue-deprecation-warning
"`set-repl-prompt!' is deprecated. Use `repl-default-prompt-set!' from
the `(system repl common)' module.")
;; Avoid @, as when bootstrapping it will cause the (system repl common)
;; module to be loaded at expansion time, which eventually loads srfi-1, but
;; that fails due to an unbuilt supporting lib... grrrrrrrrr.
((module-ref (resolve-interface '(system repl common))
'repl-default-prompt-set!)
v))
(define (set-batch-mode?! arg)
(cond
(arg
(issue-deprecation-warning
"`set-batch-mode?!' is deprecated. Use `ensure-batch-mode!' instead.")
(ensure-batch-mode!))
(else
(issue-deprecation-warning
"`set-batch-mode?!' with an argument of `#f' is deprecated. Use the
`*repl-stack*' fluid instead.")
#t)))
(define (repl read evaler print)
(issue-deprecation-warning
"`repl' is deprecated. Define it yourself.")
(let loop ((source (read (current-input-port))))
(print (evaler source))
(loop (read (current-input-port)))))
(define (pre-unwind-handler-dispatch key . args)
(issue-deprecation-warning
"`pre-unwind-handler-dispatch' is deprecated. Use
`default-pre-unwind-handler' from `(ice-9 scm-style-repl)' directly.")
(apply (@ (ice-9 scm-style-repl) default-pre-unwind-handler) key args))
(define (default-pre-unwind-handler key . args)
(issue-deprecation-warning
"`default-pre-unwind-handler' is deprecated. Use it from
`(ice-9 scm-style-repl)' if you need it.")
(apply (@ (ice-9 scm-style-repl) default-pre-unwind-handler) key args))
(define (handle-system-error key . args)
(issue-deprecation-warning
"`handle-system-error' is deprecated. Use it from
`(ice-9 scm-style-repl)' if you need it.")
(apply (@ (ice-9 scm-style-repl) handle-system-error) key args))
(define-syntax stack-saved?
(make-variable-transformer
(lambda (x)
(issue-deprecation-warning
"`stack-saved?' is deprecated. Use it from
`(ice-9 save-stack)' if you need it.")
(syntax-case x (set!)
((set! id val)
(identifier? #'id)
#'(set! (@ (ice-9 save-stack) stack-saved?) val))
(id
(identifier? #'id)
#'(@ (ice-9 save-stack) stack-saved?))))))
(define-syntax the-last-stack
(lambda (x)
(issue-deprecation-warning
"`the-last-stack' is deprecated. Use it from `(ice-9 save-stack)'
if you need it.")
(syntax-case x ()
(id
(identifier? #'id)
#'(@ (ice-9 save-stack) the-last-stack)))))
(define (save-stack . args)
(issue-deprecation-warning
"`save-stack' is deprecated. Use it from `(ice-9 save-stack)' if you need
it.")
(apply (@ (ice-9 save-stack) save-stack) args))
(define (named-module-use! user usee)
(issue-deprecation-warning
"`named-module-use!' is deprecated. Define it yourself if you need it.")
(module-use! (resolve-module user) (resolve-interface usee)))
(define (top-repl)
(issue-deprecation-warning
"`top-repl' has moved to the `(ice-9 top-repl)' module.")
((module-ref (resolve-module '(ice-9 top-repl)) 'top-repl)))
(set! debug-enable
(let ((debug-enable debug-enable))
(lambda opts
(if (memq 'debug opts)
(begin
(issue-deprecation-warning
"`(debug-enable 'debug)' is obsolete and has no effect."
"Remove it from your code.")
(apply debug-enable (delq 'debug opts)))
(apply debug-enable opts)))))
(define (turn-on-debugging)
(issue-deprecation-warning
"`(turn-on-debugging)' is obsolete and usually has no effect."
"Debugging capabilities are present by default.")
(debug-enable 'backtrace)
(read-enable 'positions))
(define (read-hash-procedures-warning)
(issue-deprecation-warning
"`read-hash-procedures' is deprecated."
"Use the fluid `%read-hash-procedures' instead."))
(define-syntax read-hash-procedures
(identifier-syntax
(_
(begin (read-hash-procedures-warning)
(fluid-ref %read-hash-procedures)))
((set! _ expr)
(begin (read-hash-procedures-warning)
(fluid-set! %read-hash-procedures expr)))))
(define (process-define-module args)
(define (missing kw)
(error "missing argument to define-module keyword" kw))
(define (unrecognized arg)
(error "unrecognized define-module argument" arg))
(issue-deprecation-warning
"`process-define-module' is deprecated. Use `define-module*' instead.")
(let ((name (car args))
(filename #f)
(pure? #f)
(version #f)
(system? #f)
(duplicates '())
(transformer #f))
(let loop ((kws (cdr args))
(imports '())
(exports '())
(re-exports '())
(replacements '())
(autoloads '()))
(if (null? kws)
(define-module* name
#:filename filename #:pure pure? #:version version
#:duplicates duplicates #:transformer transformer
#:imports (reverse! imports)
#:exports exports
#:re-exports re-exports
#:replacements replacements
#:autoloads autoloads)
(case (car kws)
((#:use-module #:use-syntax)
(or (pair? (cdr kws))
(missing (car kws)))
(cond
((equal? (cadr kws) '(ice-9 syncase))
(issue-deprecation-warning
"(ice-9 syncase) is deprecated. Support for syntax-case is now in Guile core.")
(loop (cddr kws)
imports exports re-exports replacements autoloads))
(else
(let ((iface-spec (cadr kws)))
(if (eq? (car kws) #:use-syntax)
(set! transformer iface-spec))
(loop (cddr kws)
(cons iface-spec imports) exports re-exports
replacements autoloads)))))
((#:autoload)
(or (and (pair? (cdr kws)) (pair? (cddr kws)))
(missing (car kws)))
(let ((name (cadr kws))
(bindings (caddr kws)))
(loop (cdddr kws)
imports exports re-exports
replacements (cons* name bindings autoloads))))
((#:no-backtrace)
;; FIXME: deprecate?
(set! system? #t)
(loop (cdr kws)
imports exports re-exports replacements autoloads))
((#:pure)
(set! pure? #t)
(loop (cdr kws)
imports exports re-exports replacements autoloads))
((#:version)
(or (pair? (cdr kws))
(missing (car kws)))
(set! version (cadr kws))
(loop (cddr kws)
imports exports re-exports replacements autoloads))
((#:duplicates)
(if (not (pair? (cdr kws)))
(missing (car kws)))
(set! duplicates (cadr kws))
(loop (cddr kws)
imports exports re-exports replacements autoloads))
((#:export #:export-syntax)
(or (pair? (cdr kws))
(missing (car kws)))
(loop (cddr kws)
imports (append exports (cadr kws)) re-exports
replacements autoloads))
((#:re-export #:re-export-syntax)
(or (pair? (cdr kws))
(missing (car kws)))
(loop (cddr kws)
imports exports (append re-exports (cadr kws))
replacements autoloads))
((#:replace #:replace-syntax)
(or (pair? (cdr kws))
(missing (car kws)))
(loop (cddr kws)
imports exports re-exports
(append replacements (cadr kws)) autoloads))
((#:filename)
(or (pair? (cdr kws))
(missing (car kws)))
(set! filename (cadr kws))
(loop (cddr kws)
imports exports re-exports replacements autoloads))
(else
(unrecognized kws)))))))
(define-syntax fluid-let-syntax
(lambda (x)
(issue-deprecation-warning
"`fluid-let-syntax' is deprecated. Use syntax parameters instead.")
(syntax-case x ()
((_ ((k v) ...) body0 body ...)
#'(syntax-parameterize ((k v) ...)
body0 body ...)))))
(define (close-io-port port)
(issue-deprecation-warning
"`close-io-port' is deprecated. Use `close-port' instead.")
(close-port port))
(define (set-system-module! m s)
(issue-deprecation-warning
"`set-system-module!' is deprecated. There is no need to use it.")
(set-procedure-property! (module-eval-closure m) 'system-module s))
(set! module-eval-closure
(lambda (m)
(issue-deprecation-warning
"`module-eval-closure' is deprecated. Use module-variable or module-define! instead.")
(standard-eval-closure m)))
;; Legacy definition. We can't make it identifier-syntax yet though,
;; because compiled code might rely on it.
(define char-code-limit 256)
| true |
7975ec2f6b32c36453a1c1844a64ea95c05c74b3
|
0768e217ef0b48b149e5c9b87f41d772cd9917f1
|
/bench/gambit-benchmarks/wc.scm
|
cd1fa0466cbd8966e629cced3a9db1ce55c085b3
|
[
"LicenseRef-scancode-unknown-license-reference",
"BSD-2-Clause"
] |
permissive
|
fujita-y/ypsilon
|
e45c897436e333cf1a1009e13bfef72c3fb3cbe9
|
62e73643a4fe87458ae100e170bf4721d7a6dd16
|
refs/heads/master
| 2023-09-05T00:06:06.525714 | 2023-01-25T03:56:13 | 2023-01-25T04:02:59 | 41,003,666 | 45 | 7 |
BSD-2-Clause
| 2022-06-25T05:44:49 | 2015-08-19T00:05:35 |
Scheme
|
UTF-8
|
Scheme
| false | false | 1,001 |
scm
|
wc.scm
|
;;; WC -- One of the Kernighan and Van Wyk benchmarks.
(define inport #f)
(define nl #f)
(define nw #f)
(define nc #f)
(define inword #f)
(define (wcport port)
(let ((x (read-char port)))
(if (eof-object? x)
(begin
(list nl nw nc))
(begin
(set! nc (+ nc 1))
(if (char=? x #\newline)
(set! nl (+ nl 1)))
(if (or (char=? x #\space)
(char=? x #\newline))
(set! inword #f)
(if (not inword)
(begin
(set! nw (+ nw 1))
(set! inword #t))))
(wcport port)))))
(define (go)
(set! inport (open-input-file "../../src/bib"))
(set! nl 0)
(set! nw 0)
(set! nc 0)
(set! inword #f)
(let ((result (wcport inport)))
(close-input-port inport)
result))
(define (main . args)
(run-benchmark
"wc"
wc-iters
(lambda (result) (equal? result '(31102 851820 4460056)))
(lambda () (lambda () (go)))))
| false |
a5538425c6127c198d17ef0057f672547c5a01ff
|
6438e08dfc709754e64a4d8e962c422607e5ed3e
|
/socket.scm
|
a50d4b52b1e78e93510b2dbf9ce18de43e2303fc
|
[] |
no_license
|
HugoNikanor/GuileGamesh
|
42043183167cdc9d45b4dc626266750aecbee4ff
|
77d1be4a20b3f5b9ff8f18086bf6394990017f23
|
refs/heads/master
| 2018-10-13T10:54:00.134522 | 2018-07-11T19:45:15 | 2018-07-11T19:45:15 | 110,285,413 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 259 |
scm
|
socket.scm
|
(use-modules (system repl server))
#| Connect with:
- Shell
$ nc -U *path*
- Emacs
(geiser-connect-local 'guile *path*)
|#
(define-once *path* "/tmp/guile-gamesh-repl")
(system* "rm" *path*)
(spawn-server (make-unix-domain-server-socket #:path *path*))
| false |
d1bd8cfb72c2534db5e639ff67aa4e736671109b
|
958488bc7f3c2044206e0358e56d7690b6ae696c
|
/scheme/evaluator/lazy-run.scm
|
2fdde09657aee8757424dd9081099891e36401c6
|
[] |
no_license
|
possientis/Prog
|
a08eec1c1b121c2fd6c70a8ae89e2fbef952adb4
|
d4b3debc37610a88e0dac3ac5914903604fd1d1f
|
refs/heads/master
| 2023-08-17T09:15:17.723600 | 2023-08-11T12:32:59 | 2023-08-11T12:32:59 | 40,361,602 | 3 | 0 | null | 2023-03-27T05:53:58 | 2015-08-07T13:24:19 |
Coq
|
UTF-8
|
Scheme
| false | false | 114 |
scm
|
lazy-run.scm
|
#!/usr/bin/scm
(load "main.scm")
(define filename (caddr (program-arguments)))
(lazy-load filename)
(exit 0)
| false |
f82079cb927d445eae903bb6d2e5f56b9a649eed
|
b9eb119317d72a6742dce6db5be8c1f78c7275ad
|
/random-scheme-stuff/rrrs2txi.scm
|
a6c5a168dd045bcd2c72bb0cc68b9e0bd296aae9
|
[] |
no_license
|
offby1/doodles
|
be811b1004b262f69365d645a9ae837d87d7f707
|
316c4a0dedb8e4fde2da351a8de98a5725367901
|
refs/heads/master
| 2023-02-21T05:07:52.295903 | 2022-05-15T18:08:58 | 2022-05-15T18:08:58 | 512,608 | 2 | 1 | null | 2023-02-14T22:19:40 | 2010-02-11T04:24:52 |
Scheme
|
UTF-8
|
Scheme
| false | false | 43,731 |
scm
|
rrrs2txi.scm
|
;"rrrs2txi.scm", A program to convert Scheme Reports to TeXInfo format.
; Copyright (c) 1998 Aubrey Jaffer
;
;Permission to copy this software, to redistribute it, and to use it
;for any purpose is granted, subject to the following restrictions and
;understandings.
;
;1. Any copy made of this software must include this copyright notice
;in full.
;
;2. I have made no warrantee or representation that the operation of
;this software will be error-free, and I am under no obligation to
;provide any services, by way of maintenance, update, or otherwise.
;
;3. In conjunction with products arising from the use of this
;material, there shall be no use of my name in any advertising,
;promotional, or sales literature without prior written consent in
;each case.
;; This program translates the LaTeX source ".tex" files of the
;; "Revised(3) Report on the Algorithmic Language Scheme",
;; "Revised(4) Report on the Algorithmic Language Scheme", or
;; "Revised(5) Report on the Algorithmic Language Scheme"
;; to TeXInfo format. If "rrrs2txi.scm" is LOADed into Scheme in a
;; directory containing "r3rs.tex", "r4rs.tex", or "r5rs.tex", then
;; calling the Scheme procedure GO with no arguments (go) will
;; translate the report contained in that directory. The resulting
;; ".txi" file is written to the current directory.
;; Otherwise, calling the GO procedure will translate all reports
;; contained in "r3rs", "r4rs", or "r5rs" subdirectories of the
;; current directory to texinfo format. The resulting ".txi" files
;; are written to the current directory.
;; If a Scheme report is successfully converted, GO also tries to
;; compile the new ".txi" file to INFO format. The resulting info
;; files are placed in the directory named by the variable
;; *INFO-VICINITY*, defined here.
(define *info-vicinity* (make-vicinity "/usr/local/info/"))
;; Change *INFO-VICINITY*'s value to suit your platform.
(require 'common-list-functions)
(require 'string-search)
(require 'string-port)
(require 'fluid-let)
(require 'line-i/o)
(require 'printf)
(define *input-vicinity* (user-vicinity))
(define *output-vicinity* (user-vicinity))
(define *input-basename* #f)
(define *tex-input-port* #f)
(define *txi-output-port* #f)
(define *begin-stack* '())
(define *entry-type* #f)
(define *brace-depth* 0)
(define *paren-depth* 0)
(define *previous-char* #f)
(define *closer* #f)
(define *html* #f)
(define (tex:errwarn class . args)
(define cep (current-error-port))
(force-output (current-output-port))
(force-output *txi-output-port*)
(if *input-basename*
(fprintf cep "%s: \"%s.tex\": %s: " class *input-basename* *name*)
(fprintf cep "%s: %s: " class *name*))
(if (not (null? args))
(begin (display (car args) cep)
(for-each (lambda (x) (display #\ cep) (write x cep))
(cdr args))))
(newline cep)
(force-output cep))
(define (tex:warn . args)
(apply tex:errwarn "WARN" args))
(define (tex:error . args)
(apply tex:errwarn "ERROR" args)
'(print '*closer* *closer* '*brace-depth* *brace-depth*
'*previous-char* *previous-char*
'peek-char (peek-char *tex-input-port*))
(require 'pretty-print)
(pretty-print *begin-stack*)
(abort))
(define *name* "?")
(define *previous-labels* '())
(define *new-labels* '(("define-syntax" . "Syntax definitions")))
(define (define-label label)
;;(print 'define-label label)
(let ((pair (assoc label *new-labels*))
(old-pair (assoc label *previous-labels*)))
(cond ((not pair)
(set! *new-labels* (cons (cons label *name*) *new-labels*)))
((equal? (cdr pair) *name*))
((and old-pair (not (equal? (cdr old-pair) *name*)))
(set-cdr! pair *name*)
(tex:warn label 'changed-from (cdr old-pair) 'to *name*))
(else (tex:warn label 'changed-from (cdr pair) 'to *name*)
(set-cdr! pair *name*)))))
;;; \pproto has some weird stuff. Try to extract a label; the only
;;; one seems to be `do'
(define (extract-do-label proc)
(if (equal? "(do " (substring proc 0 4))
(define-label "do")))
(define (label->name label)
(let ((pair (or (assoc label *new-labels*)
(assoc label *previous-labels*))))
(cond (pair (cdr pair))
(else (tex:warn 'label-not-found label) label))))
;;;; space and special character utilities
(define (string-whitespace? str)
(do ((idx (+ -1 (string-length str)) (+ -1 idx)))
((or (negative? idx) (not (char-whitespace? (string-ref str idx))))
(negative? idx))))
(define (output-text-lines . lines)
(for-each (lambda (str)
(display str *txi-output-port*)
(newline *txi-output-port*))
lines))
(define (escape-special chr)
(case chr
((#\@ #\{ #\}) (string #\@ chr))
((#\#) "@pounds{}")
(else chr)))
;;;; Make index entries
(define *index-entries* '())
(define (make-index-entry name before after)
(let ((new-index (sprintf #f "@%s%s%s" before name after)))
(if (not (member new-index *index-entries*))
(set! *index-entries*
(cons new-index *index-entries*)))))
(define (rule:index cmd me before after)
(fluid-let ((*tex-rules* (append (rule #\newline " ") *tex-rules*)))
(make-index-entry (capture-argument) before after))
#t)
(define (tex:newline chr me)
(newline *txi-output-port*)
(for-each (lambda (str)
(display str *txi-output-port*)
(newline *txi-output-port*))
*index-entries*)
(set! *index-entries* '())
#t)
;;;; Process files.
(define (check-file-end iport)
(do ((chr (read-char iport) (read-char iport)))
((or (eof-object? chr) (not (char-whitespace? chr)))
(if (not (eof-object? chr))
(tex:warn 'process-rrrs-file (string-append *input-basename* ".tex")
'ended-prematurely chr (read-line iport))))))
(define (process-rrrs-file base-name)
(fluid-let ((*input-basename* base-name))
(fprintf (current-error-port) "Translating \"%s.tex\"\\n" base-name)
(call-with-input-file
(in-vicinity *input-vicinity* (string-append base-name ".tex"))
(lambda (iport)
(fluid-let ((*tex-input-port* iport))
(process-tex-input #t)
(check-file-end iport)
#t)))))
(define (tex->txi . optargs)
(cond ((null? optargs)
(set! *txi-output-port* (current-output-port))
(set! *tex-input-port* (current-input-port))
(process-tex-input #t))
(else
(newline)
(cond ((not (null? (cdr optargs)))
(set! *input-vicinity* (car optargs))
(set! optargs (cdr optargs))))
(cond ((not (null? (cdr optargs)))
(set! *output-vicinity* (cadr optargs))))
(let* ((basename (car optargs))
(labels (in-vicinity *output-vicinity*
(string-append basename "-nod.scm"))))
(if (file-exists? labels)
(call-with-input-file labels
(lambda (lport)
(set! *previous-labels* (read lport))
(set! *previous-nodes* (read lport))
(if (eof-object? *previous-nodes*)
(set! *previous-nodes* '())))))
(call-with-output-file
;;"/dev/tty"
(in-vicinity *output-vicinity* (string-append basename ".txi"))
(lambda (oport)
(set! *txi-output-port* oport)
(process-rrrs-file basename)))
(if (and (not (null? *new-labels*)) (not (null? *new-nodes*)))
(call-with-output-file labels
(lambda (oport)
(fprintf oport "(\\n")
(for-each (lambda (pair) (fprintf oport " %#a\\n" pair))
*new-labels*)
(fprintf oport ")\\n")
(fprintf oport "(\\n")
(for-each (lambda (lst) (fprintf oport " %#a\\n" lst))
*new-nodes*)
(fprintf oport ")\\n"))))
(and (equal? *previous-labels* *new-labels*)
(equal? *previous-nodes* *new-nodes*))))))
;;;; Use `system' to convert to info format
(define (txi->info vic base . info-vic)
(newline)
(set! info-vic (if (null? info-vic) *info-vicinity* (car info-vic)))
(and (provided? 'system)
(zero? (system (sprintf #f "makeinfo %s%s.txi -o %s%s.info"
vic base info-vic base)))
(zero? (system (sprintf #f "install-info %s%s.info %sdir"
info-vic base info-vic)))))
;;;; Rules
(define rules append)
(define (rule toks . args)
(map (lambda (tok) (cons tok args))
(if (pair? toks) toks (list toks))))
(define (process-rule rul)
(cond ((procedure? (cadr rul))
(let ((ans (apply (cadr rul) rul)))
(set! *previous-char* (car rul))
ans))
((char? (cadr rul))
(set! *previous-char* (car rul))
(display (cadr rul) *txi-output-port*)
#t)
((symbol? (cadr rul))
(cadr rul))
((string? (cadr rul))
(set! *previous-char* (car rul))
(apply fprintf *txi-output-port* (cdr rul))
#t)
(else
(set! *previous-char* (car rul))
(tex:error (car rul) '=> 'malformed-rule rul))))
(define (process-one left)
(let* ((tok (if (eqv? #t left) (read-char *tex-input-port*) left))
(rul (or (assv tok *tex-rules*))))
;;(print *brace-depth* (make-string (max 0 *brace-depth*) #\ ) tok '*closer* *closer*)
(cond ((eof-object? tok)
(cond ((not (zero? *brace-depth*))
(tex:error '*brace-depth* 'not-zero *brace-depth*)))
tok)
((not rul)
(set! *previous-char* tok)
(display tok *txi-output-port*)
(if (not (char? tok)) (tex:warn tok 'unknown))
#t)
(else (process-rule rul)))))
(define (process-tex-input left)
(do ((left (process-one left) (process-one left)))
((or (eqv? #f left) (eof-object? left))
left)))
;;;; Arguments to backslash commands
(define (process-full-bracketed capture?)
(if capture?
(case (read-char *tex-input-port*)
((#\[)
(call-with-output-string
(lambda (oport)
(fluid-let
((*closer* #\])
(*txi-output-port* oport)
(*tex-rules*
(append (rule #\] tex:close)
(rule 'tt (lambda (cmd me)
(fprintf *txi-output-port* "@t{")
(process-tex-input #t)
(fprintf *txi-output-port* "}")
#f))
*tex-rules*)))
(process-tex-input #t)))))
(else (tex:error 'missing #\[)))
(case (read-char *tex-input-port*)
((#\[)
(fluid-let ((*closer* #\])
(*tex-rules*
(append (rule #\] tex:close)
(rule 'tt
(lambda (cmd me)
(fprintf *txi-output-port* "@t{")
(process-tex-input #t)
(fprintf *txi-output-port* "}")
#f))
*tex-rules*)))
(process-tex-input #t)))
(else (tex:error 'missing #\[)))))
(define (process-opt-arg cmd)
(case cmd
((linebreak) (process-full-bracketed #t) #t)
((documentstyle documentclass)
(let* ((optarg (process-full-bracketed #t))
(arg (capture-braced-expression)))
(output-text-lines "\\input texinfo @c -*-texinfo-*-"
"@c %**start of header")
(fprintf *txi-output-port* "@setfilename %s\\n"
(string-append *input-basename* ".info"))
(fprintf *txi-output-port* "@settitle Revised(%c) Scheme\\n"
(string-ref *input-basename* 1))))
((topnewpage)
(cond
(*html*
(fluid-let
((*tex-rules*
(append
(rule #\newline "")
(rule '(begin-center end-center) "")
(rule '(#\& bs-bs) "\\n@author ")
(rule 'begin-tabular
(lambda (cmd me)
(capture-braced-expression)
(fluid-let
((*closer* 'end-tabular)
(*tex-rules*
(append (rule 'end-tabular tex:close "" "")
(rule '(#\& bs-bs) "\\n@author ")
compress-spaces
*tex-rules*)))
(process-tex-input #t)
#t)))
(rule 'multicolumn
(lambda (cmd me . ruls)
(fluid-let ((*tex-rules* (append (apply rules ruls)
*tex-rules*)))
(let* ((arg1 (capture-argument))
(arg2 (capture-braced-expression)))
(capture-braced-expression)
#t)))
(rule #\newline ""))
*tex-rules*)))
(process-full-bracketed #f))
(fluid-let ((*tex-rules* (append (rule 'eject tex:close) *tex-rules*))
(*closer* 'eject))
(process-tex-input #\newline)))
(else
(fluid-let ((*tex-rules* (append (rule #\newline "")
(rule '(begin-center end-center) "")
*tex-rules*)))
(process-full-bracketed #f))
(fluid-let ((*tex-rules* (append (rule 'eject tex:close) *tex-rules*))
(*closer* 'eject))
(process-tex-input #\newline)))))
((item)
(fprintf *txi-output-port* "@item ")
(process-full-bracketed #f))
(else (tex:error cmd 'does-not-take-optional-arguments)))
#t)
(define (capture-braced-expression)
(call-with-output-string
(lambda (oport)
(fluid-let ((*txi-output-port* oport))
(process-braced-expression)))))
(define (process-braced-expression)
(case (peek-char *tex-input-port*)
((#\{)
(read-char *tex-input-port*)
(fluid-let ((*tex-rules*
(append (rule #\} tex:close) *tex-rules*))
(*brace-depth* (+ 1 *brace-depth*))
(*closer* #\}))
(process-tex-input #t)
#t))
(else (tex:error 'process-braced-expression 'missing #\{))))
(define (capture-argument)
(call-with-output-string
(lambda (oport)
(fluid-let ((*txi-output-port* oport))
(process-argument)))))
(define (check-brace-depth! bd tok)
(cond ((eqv? bd *brace-depth*))
(else (tex:warn (if (< *brace-depth* bd)
'brace-over-used-by
'brace-under-used-by)
tok
*brace-depth* 'not bd))))
;;; Stub for top-level definition.
(define (process-argument)
(tex:error 'process-argument "called without setup-argument-processing"))
;;;; Backslash commands
;;; TeX is nasty in its treatment of curly braces:
;;; {\rm text} => (rm text)
;;; \rm{text} => (rm text)
;;; \rm{\var{proc}} => (rm (var proc))
;;; \rm{\var proc} => (rm (var proc))
;;; 1 pair: \foo{...}
;;; early-brace: {\foo ...}
;;; 2 pair: {\foo{...} ...} strip outer pair
(define (read-bs-token)
(define (char-alphabetic*? chr)
(or (char-alphabetic? chr)
(eqv? #\* chr)))
(do ((chr (peek-char *tex-input-port*) (peek-char *tex-input-port*))
(lst '() (cons chr lst)))
((or (eof-object? chr)
(not (char-alphabetic*? chr)))
(let ((str (list->string (reverse lst))))
(if (equal? "" str)
(tex:error 'null-bs-token)
(string->symbol str))))
(read-char *tex-input-port*)))
(define (read-bs-command early-brace?)
(define bschr (peek-char *tex-input-port*))
(define processed-argument? #f)
(cond
((char-alphabetic? bschr)
(let* ((tok (read-bs-token))
(chr (peek-char *tex-input-port*)))
(cond
((eqv? #\[ chr) (process-opt-arg tok))
(else
(fluid-let
((process-argument
(lambda ()
(set! processed-argument? #t)
(let ((chr (peek-char *tex-input-port*))
(bd *brace-depth*))
(cond ((eqv? chr #\{)
(read-char *tex-input-port*)
(fluid-let
((*brace-depth* (+ 1 bd)) ;(if early-brace? 2 1)
(*tex-rules*
(append (rule #\} tex:close) *tex-rules*))
(*closer* #\}))
(process-tex-input #t)
(check-brace-depth! bd tok)
#f))
(else (if (and (char-whitespace? chr)
(not (eqv? #\newline chr)))
(read-char *tex-input-port*))
(if early-brace?
(process-tex-input #t)
(if (zero? bd)
(fluid-let
((*tex-rules*
(append (rule #\newline tex:close)
*tex-rules*))
(*closer* #\newline))
(process-tex-input #t)
(check-brace-depth! bd tok)
(set! processed-argument? #f)
#\newline)
(process-tex-input #t)))))))))
(let ((ans
(cond ((and early-brace? (not (eqv? chr #\{)))
(fluid-let ((*tex-rules*
(append (rule #\} tex:close) *tex-rules*))
(*brace-depth* (+ 1 *brace-depth*))
(*closer* #\}))
(process-tex-input tok)
#t))
((and early-brace? (eqv? chr #\{))
(fluid-let ((*tex-rules*
(append (rule #\} tex:close) *tex-rules*))
(*brace-depth* (+ 1 *brace-depth*))
(*closer* #\}))
(process-tex-input tok)
(process-tex-input #t)
#t))
(else (process-one tok)))))
;;(print 'processed-argument? processed-argument? 'ans ans)
(if processed-argument?
(if (or (eqv? chr #\{) early-brace?)
(if (eqv? ans #f) #t ans)
#f)
ans)))))))
((char-numeric? bschr)
(tex:error 'bs-digit? bschr))
(else (case bschr
((#\/) (read-char *tex-input-port*) 'italic-space)
((#\\) (read-char *tex-input-port*)
(cond ((char-whitespace? (read-char *tex-input-port*))
'bs-bs)
(else (tex:error 'non-whitespace 'after-bs-bs))))
((#\ #\newline)
(case *previous-char*
((#\.) (display "@:" *txi-output-port*)))
(display (read-char *tex-input-port*) *txi-output-port*)
#t)
((#\#) (read-char *tex-input-port*)
(display (if (member "scheme" *begin-stack*) #\# "@pounds{}")
*txi-output-port*)
#t)
((#\{ #\} #\-)
(fprintf *txi-output-port* "@%c" (read-char *tex-input-port*))
#t)
;;((#\$ #\& #\% #\_))
(else (display (read-char *tex-input-port*) *txi-output-port*)
#t)))))
(define (tex:input cmd me)
(let ((name (capture-argument)))
(case (string->symbol name)
((first)
(output-text-lines "@c @include{first}" "@titlepage" "" "@ifclear html"
"@c TeX first page")
(fluid-let
((vet-node-name #f)
(*tex-rules*
(append (rule 'chapter* node 'majorheading)
(rule `huge
process-argument-with-rules "" "}"
compress-spaces
(rule #\newline "\\n@center @titlefont{")
(rule 'bs-bs "}\\n")
(rule '(#\^ bf) ""))
(rule (string->symbol "Huge") "")
*tex-rules*)))
(process-rrrs-file name))
(output-text-lines "@end ifclear" "" "@ifset html"
"@c HTML first page" "@title Scheme")
(fprintf *txi-output-port*
"@subtitle Revised(%c) Report on the Algorithmic Language Scheme\\n"
(string-ref *input-basename* 1))
(fluid-let
((vet-node-name #f)
(*html* #t)
(*tex-rules*
(append (rule 'chapter* node 'unnumbered)
(rule `huge
(lambda (cmd me) (capture-argument) #f))
(rule (string->symbol "Huge") "")
(rule 'vskip disappear)
(rule '$$ "")
*tex-rules*)))
(process-rrrs-file name))
(output-text-lines "@end ifset"
"@end titlepage" ""
"@c INFO first page"
"@ifinfo" "")
(fluid-let
((*tex-rules*
(append
(rule `huge node 'top
compress-spaces
(rule '(bs-bs #\newline #\^ bf) "")
(rule 'vskip
(lambda (cmd me) (read-line *tex-input-port*) #t)))
(rule (string->symbol "Huge") "")
(rule 'chapter* node 'majorheading)
*tex-rules*)))
(process-rrrs-file name))
(output-text-lines "@end ifinfo" ""))
((commands)
(fprintf (current-error-port) "...Skipping \"%s.tex\"\\n" name))
((sem)
(fprintf (current-error-port) "...Skipping \"%s.tex\"\\n" name)
(emit-node! 'section "Formal semantics")
(define-label "formalsemanticssection")
(output-text-lines "" ""
"This section provides a formal denotational semantics for the primitive"
"expressions of Scheme and selected built-in procedures. The concepts"
"and notation used here are described in @sc{[Stoy77]}."
""
"@quotation"
"@emph{Note:} The formal semantics section was written in La@TeX{} which"
"is incompatible with @TeX{}info. See the Formal semantics section of"
"the original document from which this was derived."
"@end quotation"
)
(newline *txi-output-port*))
((index) (output-text-lines "@unnumberedsec Concepts"
"@printindex cp" "@page"
"@unnumberedsec Procedures"
"@printindex fn"))
(else
(fprintf *txi-output-port* "@c @include{%s}\\n" name)
(process-rrrs-file name))))
#f)
;;;; Texinfo nodes
(define *new-nodes* '())
(define *previous-nodes* '())
(define *node-stack* '())
(define (node-rank type)
(case (if (symbol? type) type (string->symbol type))
((top) 1)
((chapter unnumbered appendix) 3)
((majorheading chapheading) 4)
((section unnumberedsec appendixsec) 5)
((heading) 6)
((subsection unnumberedsubsec appendixsubsec) 7)
((subheading) 8)
((subsubsection unnumberedsubsubsec appendixsubsubsec) 9)
((subsubheading) 10)
(else (tex:error 'unknown-node-type type))))
(define (find-previous-node name rank stack)
(cond ((null? stack) "(dir)")
((= (cadar stack) rank)
(if (caddar stack) (tex:error 'previous-already-set (car stack)))
(set-car! (cddar stack) name)
(caar stack))
((< (cadar stack) rank)
(cond ((equal? "top" (caar stack)) (set-car! (cddar stack) name)))
(caar stack))
(else (find-previous-node name rank (cdr stack)))))
(define (find-parent-node name rank stack)
(cond ((null? stack) "(dir)")
((< (cadar stack) rank)
(set-car! (last-pair (car stack))
(append (car (last-pair (car stack))) (list name)))
(caar stack))
(else (find-parent-node name rank (cdr stack)))))
(define (update-stack rank nod stack)
(cond ((null? stack)
(if (not (eqv? 1 rank))
(tex:error 'null-stack-with-non-zero-rank? rank nod))
(list nod))
((< rank (cadar stack))
(update-stack rank nod (cdr stack)))
(else (cons nod stack))))
(define (vet-node-name cmd name)
(if (not (symbol? cmd)) (tex:error 'vet-node-name 'symbol? cmd))
(cond ((substring? "Appendix: " name)
(set! name (substring name (+ (string-length "Appendix: ")
(substring? "Appendix: " name))
(string-length name))))
((substring? "index " name) (set! name "Index"))
((eq? 'top cmd)
(newline *txi-output-port*)
(set! name "top")))
(cond ((not (assoc name *new-nodes*))
(let ((rank (node-rank cmd)))
(if (odd? rank)
(let ((nod (list name
rank
#f
(find-previous-node name rank *node-stack*)
(find-parent-node name rank *node-stack*)
'())))
(set! *new-nodes* (cons nod *new-nodes*))
(set! *node-stack* (update-stack rank nod *node-stack*)))))
name)
((eq? 'top cmd)
(tex:error 'multiple-top-nodes? cmd name *name*))
((eqv? #\s (string-ref name (+ -1 (string-length name))))
(vet-node-name cmd (substring name 0 (+ -1 (string-length name)))))
(else
(vet-node-name
cmd
(string-append
name (if (eqv? #\ (string-ref name (+ -2 (string-length name))))
"I" " I"))))))
(define (emit-node! cmd name)
(set! *name* (if vet-node-name (vet-node-name cmd name) name))
(fprintf (current-error-port) " %s \"%s\"\\n" cmd *name*)
(if vet-node-name
(let ((nod (assoc *name* *previous-nodes*)))
(cond ((not nod)
(fprintf *txi-output-port* "@%s %s\\n" cmd name))
(else
(fprintf *txi-output-port* "@node %s, %s, %s, %s\\n"
*name*
(or (caddr nod) " ") (or (cadddr nod) " ")
(list-ref nod 4))
(fprintf *txi-output-port* "@%s %s\\n" cmd name)
(cond
((not (null? (list-ref nod 5)))
(fprintf *txi-output-port* "\\n@menu\\n")
(for-each (lambda (menu-line)
(fprintf *txi-output-port* "* %-30s\\n"
(string-append menu-line ":: ")))
(list-ref nod 5))
(fprintf *txi-output-port* "@end menu\\n"))))))
(fprintf *txi-output-port* "@%s %s\\n" cmd name)))
(define (node cmd me alias . ruls)
(define ans #f)
(let ((name (call-with-output-string
(lambda (oport)
(fluid-let ((*txi-output-port* oport)
(*tex-rules* (append (rule 'tt "")
(rule #\, ";")
(apply rules ruls)
*tex-rules*)))
(set! ans (process-argument)))))))
(cond ((string-ci=? "Contents" name) ans)
(else (emit-node! (or alias cmd) name)
ans))))
(define setboxes (make-vector 10 ""))
(define (setbox cmd me)
(let* ((idx (string->number (string (read-char *tex-input-port*))))
(expn (call-with-output-string
(lambda (oport)
(fluid-let ((*txi-output-port* oport))
(process-one #t))))))
(vector-set! setboxes idx expn)
#t))
(define (copy-box cmd me)
(let* ((idx (string->number (string (read-char *tex-input-port*)))))
(display (vector-ref setboxes idx) *txi-output-port*)
#t))
;;;; Rule functions
(define (unmatched-close chr me) (tex:error 'unmatched chr))
(define (tex:close chr me . lines)
(cond ((not (eqv? chr *closer*))
(tex:error 'close-mismatch chr 'should-be *closer*)))
(case chr ((#\}) (set! *brace-depth* (+ -1 *brace-depth*))))
(apply output-text-lines lines)
#f)
(define (% tok me) #\%)
(define (commentize cmd me . ruls)
(fprintf *txi-output-port* "@c \\\\%s %s" cmd (read-line *tex-input-port*))
#\newline)
(define (disappear cmd me . ruls)
(read-line *tex-input-port*)
#\newline)
(define (postfix cmd me suffix)
(let ((name (capture-argument)))
(fprintf *txi-output-port* "%s%s" name suffix))
#f)
(define (encapsulate from me to . ruls)
(fprintf *txi-output-port* "@%s{" to)
(if (null? ruls)
(let ((ans (process-argument)))
(fprintf *txi-output-port* "}")
ans)
(fluid-let ((*tex-rules* (append (apply rules ruls) *tex-rules*)))
(let ((ans (process-argument)))
(fprintf *txi-output-port* "}")
ans))))
(define (process-argument-with-rules cmd me . ruls)
(define post #f)
(cond ((and (not (null? ruls)) (not (list? (car ruls))))
(fprintf *txi-output-port* (car ruls))
(set! ruls (cdr ruls))
(cond ((and (not (null? ruls)) (not (list? (car ruls))))
(set! post (car ruls))
(set! ruls (cdr ruls))))
(let ((ans (if (null? ruls)
(process-argument)
(fluid-let ((*tex-rules*
(append (apply rules ruls) *tex-rules*)))
(process-argument)))))
(if post (fprintf *txi-output-port* post))
ans))
((null? ruls) (process-argument))
(else (fluid-let ((*tex-rules* (append (apply rules ruls) *tex-rules*)))
(process-argument)))))
;;;; The Rules
(define compress-spaces
(rule #\ (lambda (chr me)
(display #\ *txi-output-port*)
(do ((ch (peek-char *tex-input-port*)
(peek-char *tex-input-port*)))
((not (eqv? ch #\ )) #t)
(read-char *tex-input-port*)))))
(define *tex-rules*
(rules
(rule #\~ #\ )
(rule #\@ "@@")
(rule #\% (lambda (chr me)
(let ((line (read-line *tex-input-port*)))
(if (not (string-whitespace? line))
(fprintf *txi-output-port* "@c %s" line))
#\newline)))
(rule #\{ (lambda (chr me . ruls)
(case (peek-char *tex-input-port*)
((#\}) (read-char *tex-input-port*) #t)
((#\\)
(read-char *tex-input-port*)
(read-bs-command #t))
(else
(fluid-let ((*tex-rules*
(append (apply rules ruls) *tex-rules*))
(*brace-depth* (+ 1 *brace-depth*))
(*closer* #\}))
(process-tex-input #t)
#t))))
(rule #\} tex:close))
(rule #\} unmatched-close)
(rule #\] unmatched-close)
(rule #\\ (lambda (chr me) (read-bs-command #f)))
(rule #\$ (lambda (chr me)
(case (peek-char *tex-input-port*)
((#\$) (read-char *tex-input-port*) '$$)
(else '$))))
(rule slib:tab "")
(rule #\newline tex:newline)
(rule 'bs-bs "@\\n")
(rule '($ $$) (lambda (tok me . ruls)
(fluid-let ((*tex-rules* (append (rule tok tex:close)
(apply rules ruls)
*tex-rules*))
(*closer* tok))
(case tok
(($$)
(fprintf *txi-output-port* "\\n@center ")
(process-tex-input #\newline))
(($) (process-tex-input #t)))
#t))
(rule #\newline "")
(rule 'sqrt "sqrt")
(rule 'sin "sin")
(rule 'cos "cos")
(rule 'tan "tan")
(rule 'log "log")
(rule 'pi "pi")
(rule 'over "/")
(rule 'bf process-argument-with-rules "(" ")"))
(rule 'char
(lambda (cmd me)
(let ((chr (read-char *tex-input-port*)))
(display
(escape-special
(integer->char
(case chr
((#\')
(let* ((c1 (read-char *tex-input-port*))
(c2 (read-char *tex-input-port*)))
(string->number (string c1 c2) 8)))
((#\")
(let* ((c1 (read-char *tex-input-port*))
(c2 (read-char *tex-input-port*)))
(string->number (string c1 c2) 16)))
(else
(tex:error 'char-argument-not-understood chr)))))
*txi-output-port*)
#t)))
(rule 'multicolumn
(lambda (cmd me . ruls)
(fluid-let ((*tex-rules* (append (apply rules ruls) *tex-rules*)))
(let* ((arg1 (capture-argument))
(arg2 (capture-braced-expression)))
(fprintf *txi-output-port* "\\n@center ")
(process-braced-expression))))
(rule #\newline ""))
(rule 'begin-center
(lambda (cmd me . ruls)
(fluid-let ((*tex-rules* (append (apply rules ruls) *tex-rules*))
(*closer* 'end-center))
(fprintf *txi-output-port* "\\n@center ")
(process-tex-input #t)
#\newline))
compress-spaces
(rule 'end-center tex:close)
(rule #\newline "\\n@center "))
(rule 'extracolsep (lambda (cmd me) (capture-argument) #f))
(rule 'verb
(lambda (cmd me)
(let ((closer (read-char *tex-input-port*)))
(do ((chr (read-char *tex-input-port*)
(read-char *tex-input-port*)))
((or (eqv? chr closer) (eof-object? chr)) #t)
(display (escape-special chr) *txi-output-port*)))))
;; These commands translate simply.
(rule (string->symbol "TeX") "@TeX{}")
(rule 'sharpfoo process-argument-with-rules "@r{#" "}")
(rule 'cite process-argument-with-rules "[" "]"
(rule #\, "], ["))
(rule 'schfalse "@r{#f}")
(rule 'schtrue "@r{#t}")
(rule 'unspecified "@emph{unspecified}")
(rule 'scherror "@emph{error}")
(rule 'semantics "@emph{semantics}")
(rule 'syntax "@emph{syntax}")
(rule 'exprtype "syntax")
(rule 'singlequote "@r{'}")
(rule 'backquote "@r{`}")
(rule 'backwhack "\\\\")
(rule 'atsign "@@")
(rule 'sharpsign "#")
(rule 'prime "^")
(rule 'dots "@dots{}")
(rule 'dotsfoo "@dots{},")
(rule 'makeindex "")
(rule 'iet " @equiv{}")
(rule 'ae "@ae{}")
(rule 'le "<=")
(rule 'leq "<=")
(rule 'neq "~=")
(rule 'langle "<")
(rule 'rangle ">")
(rule 'cdot ".")
(rule 'ldots "@dots{}")
(rule 'vdots "@dots{}")
(rule 'ev "@result{}")
(rule '(goesto evalsto) "@result{}")
(rule 'lev "@expansion{}")
(rule 'break "@*")
(rule '(hfil hfill wd vfill par nobreak qquad
unsection footnotesize tableofcontents) "")
;; These come with {} after them.
(rule (string->symbol "Lambdaexp") "lambda expression")
(rule 'lambdaexp "lambda expression")
(rule 'nopagebreak "")
(rule 'doublequote "\"")
(rule 'coerce "->")
;; These begin lines
(rule '(newpage eject) "\\n@page\\n")
(rule 'medskip "@sp 3")
(rule 'bigskip "@sp 6")
(rule 'noindent "\\n@noindent\\n")
(rule 'item "\\n\\n@item ")
;; These occur as {\tt ...}
(rule 'tt encapsulate 't)
(rule 'rm encapsulate 'r)
(rule 'it encapsulate 'i)
(rule 'itshape encapsulate 'i)
(rule 'italic-space "") ;\/
(rule 'bf encapsulate 'b)
(rule 'mathbf 'bf)
(rule 'sc encapsulate 'sc)
(rule 'authorsc encapsulate 'sc)
(rule 'em encapsulate 'emph)
(rule 'cf (lambda (cmd me)
(let ((arg (capture-argument)))
(fprintf *txi-output-port* "@%s{%s}"
(if (substring? "http://" arg) 'url 'samp) arg)
#f)))
(rule 'hbox encapsulate 'w)
;; These occur as \vr{...}
(rule 'vr encapsulate 'var)
(rule 'var encapsulate 'var)
(rule 'type encapsulate 'i)
(rule 'tupe encapsulate 'r)
(rule 'meta encapsulate 'r)
(rule 'displaystyle postfix "")
(rule 'begin-scheme "@lisp")
(rule 'end-scheme (lambda (cmd me) (set! *paren-depth* 0)
(output-text-lines "@end lisp")
#t))
(rule '(begin-schemenoindent begin-grammar)
(lambda (cmd me)
(if (eqv? #\newline (peek-char *tex-input-port*))
(read-char *tex-input-port*))
(fprintf *txi-output-port* "@format\\n@t{")
#t))
(rule '(end-schemenoindent end-grammar) "}\\n@end format\\n")
(rule '(begin-note begin-rationale)
(lambda (cmd me)
(fprintf *txi-output-port* "@emph{%s:}\\n@quotation\\n"
(let ((str (symbol->string cmd)))
(set! str (substring str 6 (string-length str)))
(string-set! str 0 (char-upcase (string-ref str 0)))
str))
#\newline))
(rule 'begin-tabbing "@quotation")
(rule 'end-tabbing "@end quotation")
(rule '(end-note end-rationale) "@end quotation\\n")
(rule 'begin-entry "")
(rule 'end-entry
(lambda (tok me)
(fprintf *txi-output-port* "@end %s" *entry-type*)
(set! *entry-type* #f)
#t))
(rule 'unpenalty
(lambda (tok me)
(fprintf *txi-output-port* "\\n@end %s" *entry-type*)
(set! *entry-type* #f)
#t))
(rule '(begin-itemize) "@itemize @bullet\\n")
(rule '(begin-description) "@table @t\\n")
(rule 'begin-tabular
(lambda (cmd me)
(define numcols
(string-length
(fluid-let ((*tex-rules* (append (rule #\@ "")
*tex-rules*)))
(capture-braced-expression))))
(fprintf *txi-output-port* "@c %s\\n" cmd)
(fprintf *txi-output-port* "@quotation\\n")
(fprintf *txi-output-port* "@multitable @columnfractions")
(do ((i (+ -1 numcols) (+ -1 i)))
((negative? i))
(fprintf *txi-output-port* " %.2f" (/ numcols)))
(fprintf *txi-output-port* "\\n@item ")
(fluid-let
((*closer* 'end-tabular)
(*tex-rules* (append (rule 'end-tabular tex:close
"" "@end multitable"
"@end quotation" "")
(rule #\& "@tab ")
(rule #\newline "")
(rule 'bs-bs "\\n@item ")
*tex-rules*)))
(process-tex-input #t)
#t)))
(rule 'end-description "@end table\\n")
(rule '(end-itemize end-thebibliography) "@end itemize\\n")
(rule 'begin-thebibliography
(lambda (cmd me)
(emit-node! 'unnumbered "Bibliography")
(output-text-lines "" "" "@itemize @bullet")
(fprintf *txi-output-port* "@c ")
(fluid-let ((*tex-rules* (append (rule 'cite encapsulate 'cite)
*tex-rules*)))
(process-braced-expression)
#\newline)))
(rule 'begin-theindex
(lambda (tok me)
(fprintf (current-error-port) "...Indexing\\n")
(emit-node! 'unnumbered
"Alphabetic index of definitions of concepts, keywords, and procedures")
#\newline))
(rule 'end-theindex
"@ifinfo\\n@unnumberedsec References\\n@printindex pg\\n@end ifinfo\\n"
)
(rule 'end-theindex
(lambda (tok me)
(output-text-lines "@ifinfo"
"@unnumberedsec References"
"@printindex pg"
"@end ifinfo" "")
#\newline))
(rule 'begin-document
(lambda (tok me)
(output-text-lines "@c %**end of header"
"@c syncodeindex fn cp" ""
"@ifinfo"
"@dircategory The Algorithmic Language Scheme"
"@direntry")
(fprintf *txi-output-port*
"* %s: (%s). The Revised(%c) Report on Scheme.\\n"
(string-upcase *input-basename*)
*input-basename*
(string-ref *input-basename* 1))
(output-text-lines "@end direntry" "@end ifinfo")
#t))
(rule 'end-document
(lambda (tok me)
(output-text-lines "@contents" "@bye")
(cond ((not (null? *begin-stack*))
(tex:error '*begin-stack* 'not-empty *begin-stack*))
((not (zero? *brace-depth*))
(tex:error '*brace-depth* 'not-zero *brace-depth*)))
#f))
;; \-commands which take arguments
;; but aren't simple substitutions.
(rule 'vest (lambda (cmd me)
(case (peek-char *tex-input-port*)
((#\ ) (read-char *tex-input-port*)))
#t))
(rule 'begin
(lambda (cmd me)
(let* ((name (capture-argument))
(tok (string->symbol (string-append "begin-" name))))
(set! *begin-stack* (cons name *begin-stack*))
(cond ((assv tok *tex-rules*) tok)
(else (tex:warn tok 'not-recognized) #f)))))
(rule 'end
(lambda (cmd me)
(let* ((name (capture-argument))
(tok (string->symbol (string-append "end-" name))))
(cond ((null? *begin-stack*)
(tex:error 'end name 'begin-stack-empty))
((not (equal? name (car *begin-stack*)))
(tex:error 'end name 'doesn't-match
'begin (car *begin-stack*)))
(else (set! *begin-stack* (cdr *begin-stack*))))
(cond ((assv tok *tex-rules*) tok)
(else (tex:warn tok 'not-recognized) #f)))))
(rule 'arbno postfix "@r{*}")
(rule 'atleastone postfix "@r{+}")
(rule 'hyper process-argument-with-rules "@r{<" ">}")
(rule '(todo nodomain)
(lambda (cmd me . ruls)
(fluid-let ((*tex-rules* (append (apply rules ruls) *tex-rules*)))
(cond ((not (eqv? #\newline *previous-char*))
(newline *txi-output-port*)))
(fprintf *txi-output-port* "@ignore %s\\n" cmd)
(process-argument)
(fprintf *txi-output-port* "\\n@end ignore\\n")
#t))
(rule #\[ "[")
(rule #\] "]")
(rule 'begin "\\begin")
(rule 'end "\\end")
(rule '(subsection subsection*) ""))
(rule 'domain (lambda (cmd me) (process-argument) #t))
(rule 'vari process-argument-with-rules "@var{" "1}")
(rule 'varii process-argument-with-rules "@var{" "2}")
(rule 'variii process-argument-with-rules "@var{" "3}")
;;(rule 'variv process-argument-with-rules "@var{" "4}")
(rule 'vri process-argument-with-rules "@var{" "1}")
(rule 'vrii process-argument-with-rules "@var{" "2}")
(rule 'vriii process-argument-with-rules "@var{" "3}")
(rule 'vriv process-argument-with-rules "@var{" "4}")
(rule 'hyperi process-argument-with-rules "@r{<" "1>}")
(rule 'hyperii process-argument-with-rules "@r{<" "2>}")
(rule 'hyperiii process-argument-with-rules "@r{<" "3>}")
(rule 'hyperiv process-argument-with-rules "@r{<" "4>}")
(rule 'hypern process-argument-with-rules "@r{<" "_n>}")
(rule 'index rule:index "cindex @w{" "}")
(rule 'mainindex rule:index "cindex @w{" "}")
(rule 'mainschindex rule:index "cindex @w{" "}")
(rule 'schindex rule:index "vindex " "")
(rule 'sharpindex rule:index "vindex #" "")
(rule 'ide
(lambda (cmd me)
(let ((name (capture-argument)))
(fprintf *txi-output-port* "@code{%s}" name)
(make-index-entry name "vindex @w{" "}"))
#f))
(rule 'defining
(lambda (cmd me)
(let ((name (capture-argument)))
(fprintf *txi-output-port* "@dfn{%s}" name)
(make-index-entry name "cindex @w{" "}"))
#f))
(rule 'bibitem
(lambda (cmd me)
(let ((name (capture-argument)))
(fprintf *txi-output-port* "@item [%s]" name)
(make-index-entry name "pindex " ""))
#f))
(rule 'foo
(lambda (cmd me)
(let ((name (capture-argument)))
(fprintf
*txi-output-port*
"@var{%s}, @var{%s1}, @dots{} @var{%sj}, @dots{}"
name name name))
#f))
(rule 'clearextrapart node 'unnumbered)
(rule 'extrapart node 'unnumbered)
(rule 'subsection* node 'unnumberedsec)
(rule '(chapter section subsection) node #f)
(rule 'label (lambda (cmd me) (define-label (capture-argument)) #f))
(rule #\( (lambda (chr me) (set! *paren-depth* (+ 1 *paren-depth*))
(display chr *txi-output-port*) #t))
(rule #\) (lambda (chr me) (set! *paren-depth* (+ -1 *paren-depth*))
(display chr *txi-output-port*) #t))
(rule 'ref (lambda (cmd me)
(let ((name (label->name (capture-argument))))
(cond ((positive? *paren-depth*)
(fprintf *txi-output-port* "@pxref{%s}" name))
(else (fprintf *txi-output-port* "@ref{%s}" name)))
#f)))
(rule '(proto rproto)
(lambda (cmd me . ruls)
(let* ((proc (capture-argument))
(args (fluid-let ((*tex-rules*
(append (apply rules ruls) *tex-rules*)))
(capture-braced-expression)))
(type (capture-braced-expression)))
(fprintf *txi-output-port* "@%s {%s} %s %s"
(if *entry-type* "deffnx" "deffn")
type proc args)
(case cmd ((proto) (define-label proc)))
(set! *entry-type* "deffn"))
#f)
(rule '(vari vri) postfix "1")
(rule '(varii vrii) postfix "2")
(rule '(variii vriii) postfix "3")
(rule 'vriv postfix "4")
(rule 'hyperi process-argument-with-rules "<" "1>")
(rule 'hyperii process-argument-with-rules "<" "2>")
(rule 'hyperiii process-argument-with-rules "<" "3>")
(rule 'hyperiv process-argument-with-rules "<" "4>")
(rule 'hypern process-argument-with-rules "<" "_n>"))
(rule 'vproto
(lambda (cmd me)
(let* ((var (capture-argument))
(type (capture-braced-expression)))
(fprintf *txi-output-port* "@%s {%s} %s"
(if *entry-type* "defvrx" "defvr") type var)
(define-label var)
(set! *entry-type* "defvr"))
#f))
(rule 'pproto ; like proto without args
(lambda (cmd me . ruls)
(fluid-let ((*tex-rules* (append (apply rules ruls) *tex-rules*)))
(let* ((proc (capture-argument))
(type (capture-braced-expression)))
(if *entry-type*
(fprintf *txi-output-port* "\\n@deffnx {%s} %s" type proc)
(fprintf *txi-output-port* "@deffn {%s} %s" type proc))
(extract-do-label proc)
(set! *entry-type* "deffn")
(process-argument))))
(rule 'tt ""))
(rule 'obeyspaces process-argument-with-rules
(rule '(bs-bs #\newline #\%) "")
compress-spaces)
(rule 'vspace
(lambda (cmd me)
(let ((arg (capture-argument)))
(set! arg (string->number (substring arg 0 (substring? "ex" arg))))
(fprintf *txi-output-port* "@sp %d" (abs arg))
#f)))
(rule 'vskip
(lambda (cmd me)
(let* ((line (read-line *tex-input-port*))
(linl (string-length line)))
(do ((idx 0 (+ 1 idx)))
((or (eqv? idx linl)
(not (char-whitespace? (string-ref line idx))))
(cond ((or (eqv? idx linl)
(not (or (substring? "ex" line)
(substring? "pt" line))))
(tex:error 'vskip-not-understood: line)))
(set! line (substring line idx
(or (substring? "ex" line)
(substring? "pt" line))))))
(set! linl (string->number line))
(cond (linl (fprintf *txi-output-port* "@sp %d"
(inexact->exact linl)))
(else (tex:error 'vskip-number-not-understood: line))))
#\newline))
(rule '(theevenhead headertitle)
(lambda (cmd me)
;;(fprintf *txi-output-port* "@settitle %s\\n" (capture-argument))
(output-text-lines "@setchapternewpage on"
"@paragraphindent 0" "")
#t))
(rule 'input tex:input)
(rule 'setbox setbox)
(rule 'copy copy-box)
;; R5RS additional symbols.
(rule 'integerversion "5")
(rule 'callcc "@t{call-with-current-continuation}")
;; These commands occur at beginning of lines; we treat as comments.
(rule 'showboxdepth %)
;; \-commands{...} which turn into single-line comments.
(rule '(newcommand pagestyle thispagestyle clearchapterstar topmargin
headsep textheight textwidth columnsep columnseprule
parskip parindent topsep oddsidemargin evensidemargin
addvspace renewcommand tocshrink def)
commentize
(rule 'type "\\\\type"))
))
(define t (lambda args (apply tex->txi args) (newline)))
'(begin
(define r restart)
(trace-all "rrrs2txi.scm")
;;(trace read-char char-whitespace?)
(untrace rule rules read-bs-token string-whitespace?
;;process-tex-input tex:close process-one
tex:warn tex:error tex:errwarn check-brace-depth!))
;;(trace encapsulate process-one process-tex-input tex:close)
(define go
(let ((me (in-vicinity (program-vicinity) "rrrs2txi")))
(lambda ()
(do ((r 3 (+ 1 r))
(name "r3rs" (string-append "r" (number->string (+ 1 r)) "rs")))
((or (> r 6) (file-exists? (string-append name ".tex")))
(cond ((> r 6)
(do ((found? #f)
(r 3 (+ 1 r))
(base "r3rs"
(string-append "r" (number->string (+ 1 r)) "rs")))
((> r 6)
(if (not found?) (slib:error 'could-not-find "r?rs.tex"))
#t)
(let ((vic (sub-vicinity (user-vicinity) base)))
(cond ((file-exists?
(in-vicinity vic (string-append base ".tex")))
(set! found? #t)
(load me)
(cond ((tex->txi vic base)
(txi->info (user-vicinity) base))
((begin (load me) (tex->txi vic base))
(txi->info (user-vicinity) base))))))))
((begin (load me) (tex->txi name))
(txi->info (user-vicinity) base))
((begin (load me) (tex->txi name))
(txi->info (user-vicinity) base))))))))
| true |
f8afdeeef4571333ba710bc46350735c3b7f9464
|
174072a16ff2cb2cd60a91153376eec6fe98e9d2
|
/Chap-Three/3-3-5-CF-constraint.scm
|
9a48ebbf3b24d233014e541a1105fab1b0fbe900
|
[] |
no_license
|
Wang-Yann/sicp
|
0026d506ec192ac240c94a871e28ace7570b5196
|
245e48fc3ac7bfc00e586f4e928dd0d0c6c982ed
|
refs/heads/master
| 2021-01-01T03:50:36.708313 | 2016-10-11T10:46:37 | 2016-10-11T10:46:37 | 57,060,897 | 1 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 484 |
scm
|
3-3-5-CF-constraint.scm
|
(load "probe-connector.scm")
(load "make-connector.scm")
(load "constraint.scm")
(define (C-F-converter c f)
(let ((u (make-connector))
(v (make-connector))
(w (make-connector))
(x (make-connector))
(y (make-connector)))
(multiplier c w u)
(multiplier v x u)
(adder v y f)
(constant 9 w)
(constant 5 x)
(constant 32 y)
'ok))
(define C (make-connector))
(define F (make-connector))
(C-F-converter C F)
(probe "Celsius temp " C)
(probe " Fahrenheit temp " F)
| false |
71b1c2b7a57e1056ea8292125a4d7829ef134739
|
ce567bbf766df9d98dc6a5e710a77870753c7d29
|
/ch3/03.scm
|
5068bd77fd28b145810189813fd14e669c79bbba
|
[] |
no_license
|
dott94/eopl
|
1cbe2d98c948689687f88e514579e66412236fc9
|
47fadf6f2aa6ca72c831d6e2e2eccbe673129113
|
refs/heads/master
| 2021-01-18T06:42:35.921839 | 2015-01-21T07:06:43 | 2015-01-21T07:06:43 | 30,055,972 | 1 | 0 | null | 2015-01-30T04:21:42 | 2015-01-30T04:21:42 | null |
UTF-8
|
Scheme
| false | false | 68 |
scm
|
03.scm
|
(load "../libs/init.scm")
(display (scan&parse "-(55, -(x, 11))"))
| false |
1eb46cddf34de14ec158faa253cbad5aa86af32e
|
19e1e43abea015add4edaa8257602da08cadedb5
|
/app.scm
|
36f64d772ba133fd5ebed728edece48988603313
|
[] |
no_license
|
corrodedlabs/phoenix
|
1f3f34d00e8426fc92b7bc814d5b640e7a8738d5
|
8a2974cc4e886a5276b7a14598c7a55642feec5a
|
refs/heads/master
| 2022-02-20T18:25:36.486934 | 2022-02-06T09:32:22 | 2022-02-06T09:32:22 | 226,878,975 | 6 | 0 | null | 2022-02-06T09:30:10 | 2019-12-09T13:33:16 |
Scheme
|
UTF-8
|
Scheme
| false | false | 1,480 |
scm
|
app.scm
|
#! /usr/bin/scheme
(library-directories '("./thunderchez" "."))
(import (chezscheme)
(vulkan)
(matchable))
;; (define (print-stack-trace e)
;; (define (get-func c)
;; (let ((cc ((c 'code) 'name)))
;; (if cc cc "--main--")))
;; (display-condition e) (newline)
;; (let p ((t (inspect/object (condition-continuation e))))
;; (call/cc
;; (lambda (ret)
;; (if (> (t 'depth) 1)
;; (begin
;; (call-with-values
;; (lambda () (t 'source-path))
;; (case-lambda
;; ((file line column)
;; (printf "\tat ~a (~a:~a,~a)\n" (get-func t) file line column))
;; (else (ret))))
;; (p (t 'link)))))))
;; (exit))
;; (base-exception-handler print-stack-trace)
(define state (setup-vulkan))
(define shaders (make-shaders "shaders/shader.vert" "shaders/shader.frag"))
(define p (create-pipeline-from-model state
shaders
"models/cube.obj"))
(define vertex-input-metadata (car p))
(define pipeline (cdr p))
(define buffers (create-buffers state
vertex-input-metadata
pipeline))
(define uniform-buffers (car buffers))
(define command-buffers (cdr buffers))
(run-draw-loop state uniform-buffers command-buffers)
;; (let ((state (setup-vulkan))
;; (shaders ))
;; (match-let* (((vertex-input-metadata . pipeline)
;; )
;; ((uniform-buffers . command-buffers) ))
;; ))
;; (parameterize ([optimize-level 3]
;; [debug-level 0])
;; (compile-library "app.scm"))
| false |
62dce1afa7d6c366475499eeb198133ec2b3e6f7
|
c085780da34766c02f47f181bd8a7bb515126caa
|
/lab13 derivative.scm
|
05429a49ea0c00805d24429d28b876e58daae973
|
[] |
no_license
|
juleari/r5rs
|
37ede50989e59b0936f7aac2b204cb9affa22d21
|
880b0df41e94c103386c158cc172b658f485a465
|
refs/heads/master
| 2016-09-16T17:23:42.192923 | 2016-05-04T11:58:18 | 2016-05-04T11:58:18 | 42,339,524 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 4,575 |
scm
|
lab13 derivative.scm
|
(define (my-flatten xs)
(if (null? xs)
'()
(let ((x (car xs)))
(if (list? x)
(append (my-flatten x) (my-flatten (cdr xs)))
(append (list x) (my-flatten (cdr xs)))))))
(define (get-power p)
(let ((x (if (list? p)
(append (list '-) p (list 1))
(list '- p 1))))
(eval x (interaction-environment))))
(define (remove-from-list x xs)
(if (null? xs)
'()
(let ((c (car xs))
(s (remove-from-list x (cdr xs))))
(if (equal? x c)
s
(cons (car xs) s)))))
(define (evaluate expr neutral)
(cond ((not (list? expr)) expr)
((null? expr) neutral)
((member 'x (my-flatten (cdr expr)))
(let* ((op (car expr))
(net (if (or (eq? op '*) (eq? op '/))
1
0))
(ex (append (list (car expr))
(map (lambda (e) (apply evaluate (list e net))) (cdr expr)))))
(if (member 0 ex)
(if (or (eq? op '*) (eq? op '/))
0
(if (eq? op '+)
(evaluate (remove-from-list 0 ex) 0)
ex))
(if (member 'x (my-flatten ex))
(if (and (eq? op '+) (eq? 2 (length ex)))
(cadr ex)
ex)
(eval ex (interaction-environment))))))
(else (eval expr (interaction-environment)))))
(define (create-func-name name)
(string->symbol (string-append "derivative-" (symbol->string name))))
(define (derivative-expt expr)
(cons '* (cons (caddr expr)
(list (list 'expt (cadr expr) (get-power (caddr expr)))))))
(define (derivative-pow expr)
(cons '* (append (list (list 'expt (cadr expr) (caddr expr)))
(list (list 'log (cadr expr))))))
(define (derivative-cos expr)
(list '- (list 'sin (cadr expr))))
(define (derivative-sin expr)
(list 'cos (cadr expr)))
(define (derivative-exp expr)
(list 'exp (cadr expr)))
(define (derivative-log expr)
(list '/ 1 (cadr expr)))
(define (derivative expr)
(define (derivative-list es)
(if (null? es)
'()
(append (list (derivative-simple (car es)))
(derivative-list (cdr es)))))
(define (derivative-mul lx x xs)
(if (null? xs)
(list (cons '* (append lx (list (derivative-simple x)))))
(append (list (cons '* (append lx (list (derivative-simple x)) xs)))
(derivative-mul (append lx (list x)) (car xs) (cdr xs)))))
(define (derivative-div u v)
(append (list (cons '- (derivative-mul '() u (list v))))
(list (cons 'expt (list v 2)))))
(define (derivative-func func expr1 expr2)
(cons '* (append (list (func expr1))
(list (derivative-simple expr2)))))
(define (derivative-base expr)
(let ((func (create-func-name (car expr))))
(if (list? (cadr expr))
(eval `(',derivative-func ,func ',expr (cadr ',expr))(interaction-environment))
(eval `(,func ',expr)(interaction-environment)))))
(define (derivative-simple expr)
(if (list? expr)
(let ((e (car expr)))
(case e
('+ (cons '+ (derivative-list (cdr expr))))
('- (cons '- (derivative-list (cdr expr))))
('* (cons '+ (derivative-mul '() (cadr expr) (cddr expr))))
('/ (cons '/ (derivative-div (cadr expr) (caddr expr))))
('expt (if (or (and (list? (cadr expr))
(member 'x (my-flatten (cadr expr))))
(eqv? 'x (cadr expr)))
(derivative-base expr)
(derivative-base (cons 'pow (cdr expr)))))
(else (derivative-base expr))))
(if (number? expr) 0 1)))
(evaluate (derivative-simple expr) 0))
;; tests
(derivative '2)
(derivative 'x)
(derivative '(- x))
(derivative '(* 1 x))
(derivative '(- (* 1 x)))
(derivative '(expt x 10))
(derivative '(* 2 (expt x 5)))
(derivative '(expt x -2))
(derivative '(cos x))
(derivative '(* 2 (exp x)))
(derivative '(* 2 (exp (* 2 x))))
(derivative '(log x))
(derivative '(* 3 (log x)))
(derivative '(+ (expt x 3) (expt x 2)))
(derivative '(- (* 2 (expt x 3)) (* 2 (expt x 2))))
(derivative '(/ 3 x))
(derivative '(/ 3 (* 2 (expt x 2))))
(derivative '(* 2 (sin x) (cos x)))
(derivative '(* 2 (exp x) (sin x) (cos x)))
(derivative '(sin (* 2 x)))
(derivative '(cos (* 2 (expt x 2))))
| false |
5b459e04e914c33061000fee43cd1951796f2d06
|
361a14533f22a2aca86b9edb5436a5e37297bb5b
|
/hoist.scm
|
4835f60d6ebe581d558c159995693b749efbf3c4
|
[] |
no_license
|
tca/NieA
|
c6ef48e0e3ca602cb805b9503c1c7bd27af56aa0
|
8e031df301cbb67b88327c606c41acb3f9a86188
|
refs/heads/master
| 2021-01-20T11:25:05.063398 | 2014-12-07T18:18:09 | 2014-12-07T18:18:09 | 26,659,234 | 4 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 979 |
scm
|
hoist.scm
|
(module hoist (hoist)
(import chicken scheme)
(import pat)
(import builtins)
(define hoisted '())
(define (hoist-lambda! params body)
(let* ((sym (gensym))
(formals (append (list sym) params))
(def `(define ,formals ,body)))
(set! hoisted (cons def hoisted))
sym))
(define (hoist-form e)
(match e
((if pred then else) => `(if ,(hoist-form pred)
,(hoist-form then)
,(hoist-form else)))
((lambda params body) =>
(hoist-lambda! params (hoist-form body)))
(else (cond ((symbol? e) e)
((number? e) e)
((string? e) e)
((char? e) e)
((list? e) (map hoist-form e))))))
(define (hoist p)
(set! hoisted '())
(append (map (lambda (d)
(match d
((define formals body) =>
`(define ,formals ,(hoist-form body)))))
p)
hoisted))
)
| false |
1c9b90acc294141fdab98d6ec0270be8f2fb0c44
|
b9eb119317d72a6742dce6db5be8c1f78c7275ad
|
/ciphersaber/rc4.rkt
|
155a44d93f22518b61d40cb9236f3791aabd9d2a
|
[] |
no_license
|
offby1/doodles
|
be811b1004b262f69365d645a9ae837d87d7f707
|
316c4a0dedb8e4fde2da351a8de98a5725367901
|
refs/heads/master
| 2023-02-21T05:07:52.295903 | 2022-05-15T18:08:58 | 2022-05-15T18:08:58 | 512,608 | 2 | 1 | null | 2023-02-14T22:19:40 | 2010-02-11T04:24:52 |
Scheme
|
UTF-8
|
Scheme
| false | false | 2,535 |
rkt
|
rc4.rkt
|
#! /bin/sh
#| Hey Emacs, this is -*-scheme-*- code!
exec racket --require "$0" --main -- ${1+"$@"}
|#
;; http://ciphersaber.gurus.org/faq.html
#lang racket
(require (only-in srfi/43 vector-swap!)
(only-in "key-schedule.rkt" permute-state-from-key)
"misc.rkt")
;; Spew keystream bytes from state into channel.
(define (statevector->bytestream state-vector channel)
(set! state-vector (vector-copy state-vector))
(thread
(lambda ()
(define i 0)
(define j 0)
(for-ever
(set! i (m+ 1 i))
(set! j (m+ j (vector-ref state-vector i)))
(vector-swap! state-vector i j)
(channel-put channel
(vector-ref state-vector
(m+ (vector-ref state-vector i)
(vector-ref state-vector j))))))))
(provide encrypt)
(define (encrypt plaintext key)
(let ([ch (make-channel)])
(statevector->bytestream (permute-state-from-key key) ch)
(reverse
(for/fold ([ciphertext '()])
([plain-byte plaintext])
(cons (bitwise-xor plain-byte (channel-get ch))
ciphertext)))))
;; Now entering test-land
(require rackunit rackunit/text-ui)
(define-simple-check (check-expected-keystream key expected-hex-string)
(let ([*ch* (make-channel)]
[expected-stream (reverse (hex->integers expected-hex-string))])
(statevector->bytestream (permute-state-from-key key) *ch*)
(check-equal?
(for/fold ([bytes '()])
([n (in-range 0 (length expected-stream))])
(cons (channel-get *ch*) bytes))
expected-stream)))
(define-test-suite keystream-tests
;; From http://en.wikipedia.org/wiki/Rc4#Test_vectors
(check-expected-keystream #"Key" "eb9f7781b734ca72a719")
(check-expected-keystream #"Wiki" "6044db6d41b7")
(check-expected-keystream #"Secret" "04d46b053ca87b59")
)
(define-simple-check (check-expected-encryption key plaintext expected-encryption)
(check-equal? (string-downcase (integers->hex (encrypt plaintext key)))
(string-downcase expected-encryption)))
(define-test-suite encryption-tests
(check-expected-encryption #"Key" #"Plaintext" "BBF316E8D940AF0AD3")
(check-expected-encryption #"Wiki" #"pedia" "1021BF0420")
(check-expected-encryption #"Secret" #"Attack at dawn" "45A01F645FC35B383552544B9BF5")
)
(define-test-suite all-tests
keystream-tests
encryption-tests)
(provide main)
(define (main . args)
(exit (run-tests all-tests 'verbose)))
| false |
35d209fe85e2783c655954d7ac9a5b13899968cf
|
8ad2bcf76a6bda64f509da5f0844e0285f19d385
|
/values.ss
|
272392aa274fbead39499a40c7e456858255744d
|
[] |
no_license
|
jeapostrophe/exp
|
c5efae0ea7068bb5c8f225df6de45e6c4fa566bd
|
764265be4bcd98686c46ca173d45ee58dcca7f48
|
refs/heads/master
| 2021-11-19T00:23:11.973881 | 2021-08-29T12:56:11 | 2021-08-29T12:56:11 | 618,042 | 39 | 5 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 5,115 |
ss
|
values.ss
|
#lang scheme
(require (for-syntax syntax/parse
scheme/list
unstable/syntax)
scheme/package)
; Uses the convention that a values+ has four parts: a code and the arguments to keyword-apply
(define-package values+-pkg (call-with-values+ values+)
(define value+-code
(gensym))
(define (call-with-values+ producer consumer)
(call-with-values producer
(case-lambda
[(maybe-key kws kw-args rest)
(if (eq? value+-code maybe-key)
(keyword-apply consumer kws kw-args rest)
(consumer maybe-key kws kw-args rest))]
[args
(apply consumer args)])))
(define values+
(make-keyword-procedure
(lambda (kws kw-args . rest)
(values value+-code kws kw-args rest))
values)))
(open-package values+-pkg)
; These macros are obvious
(define-syntax-rule (let-values+/one ([formals expr]) body)
(call-with-values+ (lambda () expr) (lambda formals body)))
(define-syntax (let*-values+ stx)
(syntax-case stx ()
[(_ ([formals expr]) body)
(syntax/loc stx
(let-values+/one ([formals expr]) body))]
[(_ ([formals0 expr0] [formals1 expr1] ...) body)
(syntax/loc stx
(let-values+/one ([formals0 expr0])
(let*-values+ ([formals1 expr1] ...) body)))]))
; let-values+ is harder because we need to make sure the same things are visible
; This function creates new names with the same structure so let*-values+ can be used.
(define-for-syntax (generate-temporaries-for-formals stx)
(syntax-parse
stx
[()
(values #'()
empty
empty)]
[rest:id
(with-syntax ([(tmp-rest) (generate-temporaries #'(rest))])
(values #'tmp-rest
(list #'rest)
(list #'tmp-rest)))]
[(arg:id . more)
(let-values ([(more-tmp-stx more-ids more-tmp-ids)
(generate-temporaries-for-formals #'more)])
(with-syntax ([more-tmp more-tmp-stx]
[(tmp-arg) (generate-temporaries #'(arg))])
(values #'(tmp-arg . more-tmp)
(list* #'arg more-ids)
(list* #'tmp-arg more-tmp-ids))))]
[(kw:keyword . more)
(let-values ([(more-tmp-stx more-ids more-tmp-ids)
(generate-temporaries-for-formals #'more)])
(with-syntax ([more-tmp more-tmp-stx])
(values #'(kw . more-tmp)
more-ids more-tmp-ids)))]
[([arg:id default:expr] . more)
(let-values ([(more-tmp-stx more-ids more-tmp-ids)
(generate-temporaries-for-formals #'(arg . more))])
(with-syntax ([(tmp-arg . more-tmp) more-tmp-stx])
(values #'([tmp-arg default] . more-tmp)
more-ids more-tmp-ids)))]))
(define-for-syntax (generate-temporaries-for-formals/list stx)
(define-values (tmp-stx stx-ids stx-tmp-ids) (generate-temporaries-for-formals stx))
(list tmp-stx stx-ids stx-tmp-ids))
(define-syntax (let-values+ stx)
(syntax-case stx ()
[(_ ([formals expr] ...) body)
(with-syntax ([((temp-formals (formal-id ...) (temp-formal-id ...))
...)
(syntax-map generate-temporaries-for-formals/list
#'(formals ...))])
(syntax/loc stx
(let*-values+ ([temp-formals expr] ...)
(let-values ([(formal-id ...) (values temp-formal-id ...)]
...)
body))))]))
; Tests
(require tests/eli-tester)
(test
(call-with-values+ (lambda () (values 1))
(lambda (x) x))
=>
1
(call-with-values+ (lambda () (values 2))
(lambda (x [y 3]) (list x y)))
=>
(list 2 3)
(call-with-values+ (lambda () 3)
(lambda (x) x))
=>
3
(call-with-values+ (lambda () 4)
(lambda (x [y 3]) (list x y)))
=>
(list 4 3)
(call-with-values+ (lambda () (values+ 5 #:foo 3))
(lambda (x #:foo y) (list x y)))
=>
(list 5 3)
(call-with-values+ (lambda () 6)
(lambda (x #:foo [y 3]) (list x y)))
=>
(list 6 3)
(call-with-values+ (lambda () 7)
(lambda x x))
=>
(list 7)
(let-values+ ([(x) 8]
[(y) 2])
(list x y))
=>
(list 8 2)
(let ([x 2])
(let-values+ ([(x) 9]
[(y) x])
(list x y)))
=>
(list 9 2)
(let-values+ ([x 10]
[(y) 2])
(list x y))
=>
(list (list 10) 2)
(let-values+ ([(x . xs) (values 10 10.2 10.3)]
[(y) 2])
(list x xs y))
=>
(list 10 (list 10.2 10.3) 2)
(let-values+ ([(x [z 3]) 11]
[(y) 2])
(list x y z))
=>
(list 11 2 3)
(let-values+ ([(x #:foo z) (values+ 12 #:foo 3)]
[(y) 2])
(list x y z))
=>
(list 12 2 3)
(let-values+ ([(x #:foo [z 3]) 13]
[(y) 2])
(list x y z))
=>
(list 13 2 3))
| true |
0c5aac37af3e14cc71e2877f672428b608cdedff
|
a002d513cdb50dbf7c247cd894d73d0ba25e9181
|
/sqrt.ss
|
7f0196af9e76ca9813f0c3cbc567b459312a51d8
|
[] |
no_license
|
rahulkmr/chicken_musings
|
5bc325bad4a8e8fdb79580ba57b76ada9ed055b7
|
ec03e102088a7d3e5e20bd3722e5c97bcdc4f87e
|
refs/heads/master
| 2021-01-01T15:40:55.236050 | 2014-12-14T09:23:09 | 2014-12-14T09:23:09 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 293 |
ss
|
sqrt.ss
|
(define (sqrt x)
(define (sqrt-iter guess)
(if (good-enough? guess)
guess
(sqrt-iter (improve guess))))
(define (good-enough? guess)
(< (abs (- (sqr guess) x)) 0.001))
(define (improve guess)
(/ (+ guess (/ x guess)) 2))
(sqrt-iter 1.0))
(print (sqrt 100))
| false |
267a9f2ff5307d62e02b3d40b00707d44108ae5d
|
7053803109172ee3fe36594257fb9f323f860c9a
|
/chapters/1/1.9.scm
|
75296acbfeac95915ffbd2bfac5db1ab9cede340
|
[] |
no_license
|
david-davidson/SICP
|
0c7c38a11b11ef70146f4a511e4ac8d7c0651b82
|
393932a507afdc35cb99451ef53a059e72f71eb1
|
refs/heads/main
| 2021-06-14T00:36:59.503919 | 2021-05-28T01:54:39 | 2021-05-28T01:55:42 | 195,283,241 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 735 |
scm
|
1.9.scm
|
;---------------------------------------------------------------------------------------------------
; These two toy functions implement adding with the help of `inc` (increments by 1) and `dec`
; (decrements by 1). Are they iterative or recursive?
;---------------------------------------------------------------------------------------------------
(define (inc x) (+ x 1))
(define (dec x) (- x 1))
(define (add-one a b)
(if (= a 0)
b
(inc (add-one (dec a) b))))
(define (add-two a b)
(if (= a 0)
b
(add-two (dec a) (inc b))))
#|
`add-one` is recursive and `add-two` is iterative. `add-one` relies on deferred operations to track
its state; `add-two` captures all state in `a` and `b`.
|#
| false |
0e2f39c176e935a44f24567e1937103419a8f637
|
7aeb920de21547a1d9c714b029bbf3a9e7df449e
|
/scheme/chip-remote/codecs.scm
|
5b6d6d007323ae5001ae33e818f2a49f35dbae57
|
[
"BSD-2-Clause"
] |
permissive
|
ft/chip-remote
|
f8ac5a2d7597d24f44ac287836be3422a32283d4
|
2a64df611214f7e3eb55d4ead76e270351158cdb
|
refs/heads/master
| 2023-04-30T08:38:16.483240 | 2023-01-05T04:01:44 | 2023-01-05T04:01:44 | 117,028,633 | 2 | 1 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 7,498 |
scm
|
codecs.scm
|
;; Copyright (c) 2017-2021 chip-remote workers, All rights reserved.
;;
;; Terms for redistribution and use can be found in LICENCE.
(define-module (chip-remote codecs)
#:use-module (chip-remote bit-operations)
#:use-module (chip-remote interpreter)
#:use-module (chip-remote semantics)
#:use-module (chip-remote utilities)
#:use-module (rnrs bytevectors)
#:export (deduce-semantics
;; boolean semantics
boolean-false?
boolean-true?
boolean
boolean/active-low
;; integer semantics
unsigned-integer
ones-complement
twos-complement
signed-magnitude
offset-binary
zig-zag
;; floating point semantics
ieee-754-single
ieee-754-double))
(define (deduce-semantics w s)
(or s (if (= w 1) boolean unsigned-integer)))
;; Boolean codecs
(define boolean-true '(#t 1 on true enable enabled yes))
(define boolean-false '(#f 0 off false disable disabled no))
(define true-and-false (append boolean-true boolean-false))
(define (boolean-true? x)
(!! (member x boolean-true)))
(define (boolean-false? x)
(!! (member x boolean-false)))
(define (boolean-range s w)
true-and-false)
(define-semantics boolean scheme
#:range boolean-range
#:encode (lambda (w x)
(cond ((boolean-true? x) 1)
((boolean-false? x) 0)
(else (throw 'invalid-boolean x))))
#:decode (lambda (w x)
(cond ((zero? x) 'disabled)
((= 1 x) 'enabled)
(else (throw 'invalid-boolean x)))))
(define invert-bit '(lambda (w x) (bit-xor x 1)))
(define-semantics boolean/active-low interpreter
#:derive-from boolean
#:encode invert-bit
#:decode invert-bit)
;; Integer codecs. For a nice summary of common signed integer encodings (un-
;; signed ones are easy, because that's just the identity function) take a look
;; at this application note from Intersil:
;;
;; https://www.intersil.com/content/dam/Intersil/documents/an96/an9657.pdf
;;
;; All encodings need to know the width of an item to work.
;;
;; With some of these integer encodings you get the notion of two encodings for
;; zero (namely with one's complement and signed magnitude), often referred to
;; positive and negative zero. When encoding, these semantics opt for the posi-
;; tive variant of zero. The decoders map both variants to an unsigned zero.
;;
;; Another possible integer encoding is the so-called zig-zag encoding, used by
;; some of Google's protocol-buffers' data-types:
;;
;; https://developers.google.com/protocol-buffers/docs/encoding
;;
;; It has the property of using only few set bits for integers with small abso-
;; lute values, which can be beneficial when combined with variable length en-
;; coding.
(define uint-codec '(lambda (w x) (bit-mask w x)))
(define (unsigned-integer-max w) (1- (2e w)))
(define (unsigned-integer-min w) 0)
(define-semantics unsigned-integer interpreter
#:range (lambda (s w) (cons (unsigned-integer-min w)
(unsigned-integer-max w)))
#:encode uint-codec
#:decode uint-codec)
(define (twos-complement-min w) (- (2e (1- w))))
(define (twos-complement-max w) (1- (2e (1- w))))
(define-semantics twos-complement interpreter
#:range (lambda (s w) (cons (twos-complement-min w)
(twos-complement-max w)))
#:encode '(lambda (w x)
(if (x >= 0)
(bit-mask (decrement w) x)
(bit-mask w (increment (complement (multiply -1 x))))))
#:decode '(lambda (w x)
(let (t (left-shift 1 (decrement w)))
(let (r (decrement t))
(if (x < t)
(bit-mask (decrement w) x)
(multiply -1 (increment (bit-xor r (bit-and r x)))))))))
(define (ones-complement-min w) (- (1- (2e (1- w)))))
(define ones-complement-max twos-complement-max)
(define-semantics ones-complement interpreter
#:range (lambda (s w) (cons (ones-complement-min w)
(ones-complement-max w)))
#:encode '(lambda (w x)
(if (x >= 0)
(bit-mask (decrement w) x)
(bit-mask w (complement (multiply -1 x)))))
#:decode '(lambda (w x)
(let (t (left-shift 1 (decrement w)))
(let (r (decrement t))
(if (x < t)
(bit-mask (decrement w) x)
(multiply -1 (bit-xor r (bit-and r x))))))))
(define signed-magnitude-min ones-complement-min)
(define signed-magnitude-max ones-complement-min)
(define-semantics signed-magnitude interpreter
#:range (lambda (s w) (cons (signed-magnitude-min w)
(signed-magnitude-max w)))
#:encode '(lambda (w x)
(let (n (decrement w))
(if (x < 0)
(bit-mask n (multiply -1 x))
(bit-ior (left-shift 1 n) (bit-mask n x)))))
#:decode '(lambda (w x)
(let (n (decrement w))
(let (v (bit-mask n x))
(let (s (bit-extract n 1 x))
(if (s = 0)
(multiply -1 v)
v))))))
(define offset-binary-min twos-complement-min)
(define offset-binary-max twos-complement-max)
(define-semantics offset-binary interpreter
#:range (lambda (s w) (cons (offset-binary-min w)
(offset-binary-max w)))
#:encode '(lambda (w x)
(let (half (left-shift 1 (decrement w)))
(bit-mask w (increment x half))))
#:decode '(lambda (w x)
(let (half (left-shift 1 (decrement w)))
(decrement (bit-mask w x) half))))
(define zig-zag-min twos-complement-min)
(define zig-zag-max twos-complement-max)
(define-semantics zig-zag interpreter
#:range (lambda (s w) (cons (zig-zag-min w)
(zig-zag-max w)))
#:encode '(lambda (w x)
(bit-mask w (bit-xor (right-shift x (decrement w))
(left-shift x 1))))
#:decode '(lambda (w x)
(bit-xor (right-shift x 1)
(multiply -1 (bit-and x 1)))))
(define (ensure-width! tag actual required)
(unless (= actual required)
(throw 'invalid-width tag required actual)))
(define (encode-ieee-754-single width value)
(ensure-width! 'ieee-754-single width 32)
(let ((bv (make-bytevector 4 0)))
(bytevector-ieee-single-set! bv 0 value 'big)
(bytevector-u32-ref bv 0 'big)))
(define (decode-ieee-754-single width value)
(ensure-width! 'ieee-754-single width 32)
(let ((bv (make-bytevector 4 0)))
(bytevector-u32-set! bv 0 value 'big)
(bytevector-ieee-single-ref bv 0 'big)))
(define-semantics ieee-754-single scheme
#:encode encode-ieee-754-single
#:decode decode-ieee-754-single)
(define (encode-ieee-754-double width value)
(ensure-width! 'ieee-754-double width 64)
(let ((bv (make-bytevector 8 0)))
(bytevector-ieee-double-set! bv 0 value 'big)
(bytevector-u64-ref bv 0 'big)))
(define (decode-ieee-754-double width value)
(ensure-width! 'ieee-754-double width 64)
(let ((bv (make-bytevector 8 0)))
(bytevector-u64-set! bv 0 value 'big)
(bytevector-ieee-double-ref bv 0 'big)))
(define-semantics ieee-754-double scheme
#:encode encode-ieee-754-double
#:decode decode-ieee-754-double)
| false |
575ca0d478e225b5dd7a3133d210537140445283
|
defeada37d39bca09ef76f66f38683754c0a6aa0
|
/UnityEngine/unity-engine/player-prefs.sls
|
90a769480755381d76b59211334e2e231673bc18
|
[] |
no_license
|
futsuki/ironscheme-port
|
2dbac82c0bda4f4ff509208f7f00a5211d1f7cd5
|
4e7a81b0fbeac9a47440464988e53fb118286c54
|
refs/heads/master
| 2016-09-06T17:13:11.462593 | 2015-09-26T18:20:40 | 2015-09-26T18:20:40 | 42,757,369 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,917 |
sls
|
player-prefs.sls
|
(library (unity-engine player-prefs)
(export new
is?
player-prefs?
get-string
set-string
get-int
save
set-float
get-float
delete-key
delete-all
has-key?
set-int)
(import (ironscheme-clr-port))
(define-syntax new
(lambda (e)
(syntax-case e ()
((_ a ...) #'(clr-new UnityEngine.PlayerPrefs a ...)))))
(define (is? a) (clr-is UnityEngine.PlayerPrefs a))
(define (player-prefs? a) (clr-is UnityEngine.PlayerPrefs a))
(define-method-port
get-string
UnityEngine.PlayerPrefs
GetString
(static: System.String System.String)
(static: System.String System.String System.String))
(define-method-port
set-string
UnityEngine.PlayerPrefs
SetString
(static: System.Void System.String System.String))
(define-method-port
get-int
UnityEngine.PlayerPrefs
GetInt
(static: System.Int32 System.String)
(static: System.Int32 System.String System.Int32))
(define-method-port
save
UnityEngine.PlayerPrefs
Save
(static: System.Void))
(define-method-port
set-float
UnityEngine.PlayerPrefs
SetFloat
(static: System.Void System.String System.Single))
(define-method-port
get-float
UnityEngine.PlayerPrefs
GetFloat
(static: System.Single System.String)
(static: System.Single System.String System.Single))
(define-method-port
delete-key
UnityEngine.PlayerPrefs
DeleteKey
(static: System.Void System.String))
(define-method-port
delete-all
UnityEngine.PlayerPrefs
DeleteAll
(static: System.Void))
(define-method-port
has-key?
UnityEngine.PlayerPrefs
HasKey
(static: System.Boolean System.String))
(define-method-port
set-int
UnityEngine.PlayerPrefs
SetInt
(static: System.Void System.String System.Int32)))
| true |
1fcd2aa6db8867ff390b61044659b289e6b8c20f
|
2f3bb51f9c3d910a38700c31310b681e8290f986
|
/effects/steme/compute.sls
|
eada66184d745e9c8d440ae6821ade0aa9c2a533
|
[] |
no_license
|
pre-srfi/static-scheme
|
4135016c6e567ef3a65a6041f618e59d132008b4
|
4b6eddd5b33c8a77884fa9740571460eb4477524
|
refs/heads/main
| 2023-03-14T21:57:28.018419 | 2021-03-10T21:07:34 | 2021-03-10T21:07:34 | 310,183,988 | 12 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 451 |
sls
|
compute.sls
|
(library (steme compute)
(export compute)
(import (rnrs)
(for (steme compute $compiler) run expand))
(define-syntax compute
(lambda (stx)
(syntax-case stx ()
((_ c)
#`(let ((env initial-dynamic-environment))
(reset #,(compile-computation #'c initial-environment))))
(_
(syntax-violation 'compute "ill-formed compute form" stx))))))
;; Local Variables:
;; mode: scheme
;; End:
| true |
7489ecb7271bea54e9c24a342de7954f0ffb1d88
|
3508dcd12d0d69fec4d30c50334f8deb24f376eb
|
/v8/src/compiler/rtlbase/rtlobj.scm
|
6ab14674c4d0d6b3858584383bdb18adcdf0fae9
|
[] |
no_license
|
barak/mit-scheme
|
be625081e92c2c74590f6b5502f5ae6bc95aa492
|
56e1a12439628e4424b8c3ce2a3118449db509ab
|
refs/heads/master
| 2023-01-24T11:03:23.447076 | 2022-09-11T06:10:46 | 2022-09-11T06:10:46 | 12,487,054 | 12 | 1 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 4,086 |
scm
|
rtlobj.scm
|
#| -*-Scheme-*-
Copyright (c) 1988-1999 Massachusetts Institute of Technology
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at
your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|#
;;;; Register Transfer Language: Object Datatypes
(declare (usual-integrations))
(define-structure (rtl-expr
(conc-name rtl-expr/)
(constructor make-rtl-expr
(rgraph label entry-edge debugging-info))
(print-procedure
(standard-unparser (symbol->string 'RTL-EXPR)
(lambda (state expression)
(unparse-object state (rtl-expr/label expression))))))
(rgraph false read-only true)
(label false read-only true)
(entry-edge false read-only true)
(debugging-info false read-only true))
(define-integrable (rtl-expr/entry-node expression)
(edge-right-node (rtl-expr/entry-edge expression)))
(define-structure (rtl-procedure
(conc-name rtl-procedure/)
(constructor make-rtl-procedure
(rgraph label entry-edge name n-required
n-optional rest? closure?
dynamic-link? type
debugging-info
next-continuation-offset stack-leaf?))
(print-procedure
(standard-unparser (symbol->string 'RTL-PROCEDURE)
(lambda (state procedure)
(unparse-object state
(rtl-procedure/label procedure))))))
(rgraph false read-only true)
(label false read-only true)
(entry-edge false read-only true)
(name false read-only true)
(n-required false read-only true)
(n-optional false read-only true)
(rest? false read-only true)
(closure? false read-only true)
(dynamic-link? false read-only true)
(type false read-only true)
(%external-label false)
(debugging-info false read-only true)
(next-continuation-offset false read-only true)
(stack-leaf? false read-only true))
(define-integrable (rtl-procedure/entry-node procedure)
(edge-right-node (rtl-procedure/entry-edge procedure)))
(define (rtl-procedure/external-label procedure)
(or (rtl-procedure/%external-label procedure)
(let ((label (generate-label (rtl-procedure/name procedure))))
(set-rtl-procedure/%external-label! procedure label)
label)))
(define-structure (rtl-continuation
(conc-name rtl-continuation/)
(constructor make-rtl-continuation
(rgraph label entry-edge
next-continuation-offset
debugging-info))
(print-procedure
(standard-unparser (symbol->string 'RTL-CONTINUATION)
(lambda (state continuation)
(unparse-object
state
(rtl-continuation/label continuation))))))
(rgraph false read-only true)
(label false read-only true)
(entry-edge false read-only true)
(next-continuation-offset false read-only true)
(debugging-info false read-only true))
(define-integrable (rtl-continuation/entry-node continuation)
(edge-right-node (rtl-continuation/entry-edge continuation)))
(define (make/label->object expression procedures continuations)
(let ((hash-table
(make-eq-hash-table
(+ (if expression 1 0)
(length procedures)
(length continuations)))))
(if expression
(hash-table/put! hash-table
(rtl-expr/label expression)
expression))
(for-each (lambda (procedure)
(hash-table/put! hash-table
(rtl-procedure/label procedure)
procedure))
procedures)
(for-each (lambda (continuation)
(hash-table/put! hash-table
(rtl-continuation/label continuation)
continuation))
continuations)
(lambda (label)
(let ((datum (hash-table/get hash-table label #f)))
(if (not datum)
(error "Undefined label:" label))
datum))))
| false |
83bb59280a04c83bcc80dbe803b9d889a4c1a468
|
defeada37d39bca09ef76f66f38683754c0a6aa0
|
/UnityEngine/unity-engine/compass.sls
|
847c77377be7a3ef460ed6881805ed3ebbf35b9c
|
[] |
no_license
|
futsuki/ironscheme-port
|
2dbac82c0bda4f4ff509208f7f00a5211d1f7cd5
|
4e7a81b0fbeac9a47440464988e53fb118286c54
|
refs/heads/master
| 2016-09-06T17:13:11.462593 | 2015-09-26T18:20:40 | 2015-09-26T18:20:40 | 42,757,369 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,330 |
sls
|
compass.sls
|
(library (unity-engine compass)
(export new
is?
compass?
magnetic-heading
true-heading
heading-accuracy
raw-vector
timestamp
enabled?-get
enabled?-set!
enabled?-update!)
(import (ironscheme-clr-port))
(define-syntax new
(lambda (e)
(syntax-case e ()
((_ a ...) #'(clr-new UnityEngine.Compass a ...)))))
(define (is? a) (clr-is UnityEngine.Compass a))
(define (compass? a) (clr-is UnityEngine.Compass a))
(define-field-port
magnetic-heading
#f
#f
(property:)
UnityEngine.Compass
magneticHeading
System.Single)
(define-field-port
true-heading
#f
#f
(property:)
UnityEngine.Compass
trueHeading
System.Single)
(define-field-port
heading-accuracy
#f
#f
(property:)
UnityEngine.Compass
headingAccuracy
System.Single)
(define-field-port
raw-vector
#f
#f
(property:)
UnityEngine.Compass
rawVector
UnityEngine.Vector3)
(define-field-port
timestamp
#f
#f
(property:)
UnityEngine.Compass
timestamp
System.Double)
(define-field-port
enabled?-get
enabled?-set!
enabled?-update!
(property:)
UnityEngine.Compass
enabled
System.Boolean))
| true |
3b7e09ed8f32e429b12138cb870e6e862e18a8ce
|
fd9daee097ae6e309e4abf907513487315e91ca5
|
/src/pipe.ss
|
8f624346bf46650d2e1b98732bb60edb0fd3ec8a
|
[
"MIT"
] |
permissive
|
tqtifnypmb/choices
|
93c96e49e557f4c6871aab28eb8f0abae70bb901
|
d3dd2d31cb43f46d7a73c07611521f5cde7b57c2
|
refs/heads/master
| 2021-01-19T19:56:36.293246 | 2017-05-03T08:06:48 | 2017-05-03T08:06:48 | 88,466,503 | 2 | 2 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,494 |
ss
|
pipe.ss
|
(define pipe-init
(foreign-procedure "uv_pipe_init" (uptr uptr boolean) int))
(define (make-pipe-handle loop ipc)
(new-handle loop pipe-init 'named-pipe ipc))
(define pipe-open
(foreign-procedure "uv_pipe_open" (uptr int) int))
(define (uv-pipe-open handle file)
(pipe-open (uv-handle-ptr handle) file))
(define pipe-bind
(foreign-procedure "uv_pipe_bind" (uptr string) int))
(define (uv-pipe-bind handle name)
(pipe-bind (uv-handle-ptr handle) name))
(define pipe-connect
(foreign-procedure "uv_pipe_connect" (uptr uptr string uptr) void ))
(define (uv-pipe-connect req handle name cb)
(let ((fcb (cb->fcb handle 'pipe-connect cb (uptr int) void)))
(pipe-connect req (uv-handle-ptr handle) name (code->address fcb))))
(define pipe-getsockname
(foreign-procedure "uv_pipe_getsockname" (uptr uptr size_t) int))
(define (uv-pipe-getsockname handle buf)
(let ((ptr (ftype-ref uv-buf (base) buf))
(len (ftype-ref uv-buf (len) buf)))
(pipe-getsockname (uv-handle-ptr handle) ptr len)))
(define pipe-getpeername
(foreign-procedure "uv_pipe_getpeername" (uptr uptr size_t) int))
(define (uv-pipe-getpeername handle buf)
(let ((ptr (ftype-ref uv-buf (base) buf))
(len (ftype-ref uv-buf (len) buf)))
(pipe-getpeername (uv-handle-ptr handle) ptr len)))
(define pipe-pending-count
(foreign-procedure "uv_pipe_pending_count" (uptr) int))
(define (uv-pipe-pending-count handle)
(pipe-pending-count (uv-handle-ptr handle)))
| false |
cf953e85eb4179c904caeb23aede75b835e07949
|
e8e2b3f22c7e1921e99f44593fc0ba5e5e44eebb
|
/PortableApps/GnuCashPortable/App/GnuCash/share/gnucash/scm/report.scm
|
453ad79c3e4453c6a441416d2ed483d422667f1c
|
[] |
no_license
|
314pi/PortableOffice
|
da262df5eaca240a00921e8348d366efa426ae57
|
08a5e828b35ff3cade7c56d101d7f6712b19a308
|
refs/heads/master
| 2022-11-25T19:20:33.942725 | 2018-05-11T07:49:35 | 2018-05-11T07:49:35 | 132,839,264 | 1 | 2 | null | 2022-11-02T22:19:00 | 2018-05-10T02:42:46 |
Python
|
UTF-8
|
Scheme
| false | false | 36,996 |
scm
|
report.scm
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; report.scm : structures/utilities for representing reports
;; Copyright 2000 Bill Gribble <[email protected]>
;;
;; This program is free software; you can redistribute it and/or
;; modify it under the terms of the GNU General Public License as
;; published by the Free Software Foundation; either version 2 of
;; the License, or (at your option) any later version.
;;
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
;; GNU General Public License for more details.
;;
;; You should have received a copy of the GNU General Public License
;; along with this program; if not, contact:
;;
;; Free Software Foundation Voice: +1-617-542-5942
;; 51 Franklin Street, Fifth Floor Fax: +1-617-542-2652
;; Boston, MA 02110-1301, USA [email protected]
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(use-modules (gnucash main))
(use-modules (gnucash printf))
(use-modules (gnucash gettext))
(cond-expand
(guile-2
(eval-when
(compile load eval expand)
(load-extension "libgncmod-report-system" "scm_init_sw_report_system_module")))
(else ))
(use-modules (sw_report_system))
;; Terminology in this file:
;; report-template: a report definition of some form. This can be a report
;; included in gnucash by default, or a new report definition added by
;; the user in the .gnucash directory or a custom report
;; custom report: like a report-template, but saved with a different set
;; of default options. A better name would probably be "preconfigured
;; report" or something similar. These templates are managed by the
;; user via the "Preconfigured Reports" menu item
;; report: an instantiation of a report-template (custom or otherwise). One
;; specific instance of a template, loaded and configured by the user
;; while the program is running.
;; saved report: a report that was still open at the time a book is closed.
;; GnuCash dumps the current settings and template id for such a report
;; in a meta file in .gnucash/books. When the book is reopened, the template
;; id and settings are used to restore the report to the state it was
;; in before the book was closed.
;;
;; This file will define record types for report-templates and reports. From what
;; I understand the latter is used mostly to handle saved reports as defined above,
;; while the former manages report-templates (including custom-reports).
;; This hash should contain all the reports available and will be used
;; to generate the reports menu whenever a new window opens and to
;; figure out what to do when a report needs to be generated.
;;
;; The key is the report guid and the
;; value is the report definition structure.
(define *gnc:_report-templates_* (make-hash-table 23))
;; Define those strings here to make changes easier and avoid typos.
(define gnc:menuname-reports "Reports/StandardReports")
(define gnc:menuname-asset-liability (N_ "_Assets & Liabilities"))
(define gnc:menuname-income-expense (N_ "_Income & Expense"))
(define gnc:menuname-budget (N_ "B_udget"))
(define gnc:menuname-taxes (N_ "_Taxes"))
(define gnc:menuname-utility (N_ "_Sample & Custom"))
(define gnc:menuname-custom (N_ "_Custom"))
(define gnc:pagename-general (N_ "General"))
(define gnc:pagename-accounts (N_ "Accounts"))
(define gnc:pagename-display (N_ "Display"))
(define gnc:optname-reportname (N_ "Report name"))
(define gnc:optname-stylesheet (N_ "Stylesheet"))
(define gnc:menuname-business-reports (N_ "_Business"))
(define gnc:optname-invoice-number (N_ "Invoice Number"))
;; We want to warn users if they've got an old-style, non-guid custom
;; report-template, but only once
(define gnc:old-style-report-warned #f)
;; A <report-template> represents one of the available report types.
(define <report-template>
(make-record-type "<report-template>"
;; The data items in a report record
'(version name report-guid parent-type options-generator
options-cleanup-cb options-changed-cb
renderer in-menu? menu-path menu-name
menu-tip export-types export-thunk)))
;; if args is supplied, it is a list of field names and values
(define (gnc:define-report . args)
;; For now the version is ignored, but in the future it'll let us
;; change behaviors without breaking older reports.
;;
;; The renderer should be a function that accepts one argument, a
;; set of options, and generates the report. the renderer must
;; return as its final value an <html-document> object.
(define (blank-report)
((record-constructor <report-template>)
#f ;; version
#f ;; name
#f ;; report-guid
#f ;; parent-type (meaning guid of report-template this template is based on)
#f ;; options-generator
#f ;; options-cleanup-cb
#f ;; options-changed-cb
#f ;; renderer
#t ;; in-menu?
#f ;; menu-path
#f ;; menu-name
#f ;; menu-tip
#f ;; export-types
#f ;; export-thunk
))
(define (args-to-defn in-report-rec args)
(let ((report-rec (if in-report-rec
in-report-rec
(blank-report))))
(if (null? args)
in-report-rec
(let ((id (car args))
(value (cadr args))
(remainder (cddr args)))
((record-modifier <report-template> id) report-rec value)
(args-to-defn report-rec remainder)))))
(let ((report-rec (args-to-defn #f args)))
(if (and report-rec
;; only process reports that have a report-guid
(gnc:report-template-report-guid report-rec))
(let* ((report-guid (gnc:report-template-report-guid report-rec))
(name (gnc:report-template-name report-rec))
(tmpl (hash-ref *gnc:_report-templates_* report-guid)))
(if (not tmpl)
(hash-set! *gnc:_report-templates_*
report-guid report-rec)
(begin
;; FIXME: We should pass the top-level window
;; instead of the '() to gnc-error-dialog, but I
;; have no idea where to get it from.
(gnc-error-dialog '() (string-append (_ "One of your reports has a report-guid that is a duplicate. Please check the report system, especially your saved reports, for a report with this report-guid: ") report-guid))
)))
(begin
(if (gnc:report-template-name report-rec)
(begin
;; we've got an old style report with no report-id, give it an arbitrary one
(gnc:report-template-set-report-guid! report-rec (guid-new-return))
;; we also need to give it a parent-type, so that it will restore from the open state properly
;; we'll key that from the only known good way to tie back to the original report -- the renderer
(hash-for-each
(lambda (id rec)
(if (and (equal? (gnc:report-template-renderer rec)
(gnc:report-template-renderer report-rec))
(not (gnc:report-template-parent-type rec)))
(begin
(gnc:debug "gnc:define-report: setting parent-type of " (gnc:report-template-name report-rec) " to " (gnc:report-template-report-guid rec))
(gnc:report-template-set-parent-type! report-rec (gnc:report-template-report-guid rec))
(gnc:debug "done setting, is now " (gnc:report-template-parent-type report-rec)))))
*gnc:_report-templates_*)
;; re-save this old-style report in the new format
(gnc:report-template-save-to-savefile report-rec)
(gnc:debug "complete saving " (gnc:report-template-name report-rec) " in new format")
))
(if (not gnc:old-style-report-warned)
(begin
(set! gnc:old-style-report-warned #t)
(gnc-error-dialog '() (string-append (_ "The GnuCash report system has been upgraded. Your old saved reports have been transfered into a new format. If you experience trouble with saved reports, please contact the GnuCash development team.")))))
(hash-set! *gnc:_report-templates_*
(gnc:report-template-report-guid report-rec) report-rec)
(gnc:warn "gnc:define-report: old-style report. setting guid for " (gnc:report-template-name report-rec) " to " (gnc:report-template-report-guid report-rec)))
)))
(define gnc:report-template-version
(record-accessor <report-template> 'version))
(define gnc:report-template-report-guid
(record-accessor <report-template> 'report-guid))
(define gnc:report-template-set-report-guid!
(record-modifier <report-template> 'report-guid))
(define gnc:report-template-name
(record-accessor <report-template> 'name))
(define gnc:report-template-set-name
(record-modifier <report-template> 'name))
(define gnc:report-template-parent-type
(record-accessor <report-template> 'parent-type))
(define gnc:report-template-set-parent-type!
(record-modifier <report-template> 'parent-type))
(define gnc:report-template-options-generator
(record-accessor <report-template> 'options-generator))
(define gnc:report-template-options-cleanup-cb
(record-accessor <report-template> 'options-cleanup-cb))
(define gnc:report-template-options-changed-cb
(record-accessor <report-template> 'options-changed-cb))
(define gnc:report-template-renderer
(record-accessor <report-template> 'renderer))
(define gnc:report-template-in-menu?
(record-accessor <report-template> 'in-menu?))
(define gnc:report-template-menu-path
(record-accessor <report-template> 'menu-path))
(define gnc:report-template-menu-name
(record-accessor <report-template> 'menu-name))
(define gnc:report-template-menu-tip
(record-accessor <report-template> 'menu-tip))
(define gnc:report-template-export-types
(record-accessor <report-template> 'export-types))
(define gnc:report-template-export-thunk
(record-accessor <report-template> 'export-thunk))
(define (gnc:report-template-new-options/report-guid template-id template-name)
(let ((templ (hash-ref *gnc:_report-templates_* template-id)))
(if templ
(gnc:report-template-new-options templ)
#f)))
(define (gnc:report-template-menu-name/report-guid template-id template-name)
(let ((templ (hash-ref *gnc:_report-templates_* template-id)))
(if templ
(or (gnc:report-template-menu-name templ)
(gnc:report-template-name templ))
#f)))
(define (gnc:report-template-renderer/report-guid template-id template-name)
(let ((templ (hash-ref *gnc:_report-templates_* template-id)))
(if templ
(gnc:report-template-renderer templ)
#f)))
(define (gnc:report-template-new-options report-template)
(let ((generator (gnc:report-template-options-generator report-template))
(namer
(gnc:make-string-option
gnc:pagename-general gnc:optname-reportname "0a"
(N_ "Enter a descriptive name for this report.")
(_ (gnc:report-template-name report-template))))
(stylesheet
(gnc:make-multichoice-option
gnc:pagename-general gnc:optname-stylesheet "0b"
(N_ "Select a stylesheet for the report.")
(string->symbol (N_ "Default"))
(map
(lambda (ss)
(vector
(string->symbol (gnc:html-style-sheet-name ss))
(gnc:html-style-sheet-name ss)
(string-append (gnc:html-style-sheet-name ss)
" " (_ "stylesheet."))))
(gnc:get-html-style-sheets)))))
(let ((options
(if (procedure? generator)
(or (gnc:backtrace-if-exception generator)
(begin
(gnc:warn "BUG DETECTED: Scheme exception raised in "
"report options generator procedure named "
(procedure-name generator))
(gnc:new-options)))
(gnc:new-options))))
(or (gnc:lookup-option options gnc:pagename-general gnc:optname-reportname)
(gnc:register-option options namer))
(or (gnc:lookup-option options gnc:pagename-general gnc:optname-stylesheet)
(gnc:register-option options stylesheet))
options)))
;; A <report> represents an instantiation of a particular report type.
(define <report>
(make-record-type "<report>"
'(type id options dirty? needs-save? editor-widget ctext custom-template)))
(define gnc:report-type
(record-accessor <report> 'type))
(define gnc:report-set-type!
(record-modifier <report> 'type))
(define gnc:report-id
(record-accessor <report> 'id))
(define gnc:report-set-id!
(record-modifier <report> 'id))
(define gnc:report-options
(record-accessor <report> 'options))
(define gnc:report-set-options!
(record-modifier <report> 'options))
(define gnc:report-needs-save?
(record-accessor <report> 'needs-save?))
(define gnc:report-set-needs-save?!
(record-modifier <report> 'needs-save?))
(define gnc:report-dirty?
(record-accessor <report> 'dirty?))
(define gnc:report-set-dirty?-internal!
(record-modifier <report> 'dirty?))
(define (gnc:report-set-dirty?! report val)
(gnc:report-set-dirty?-internal! report val)
(let* ((template (hash-ref *gnc:_report-templates_*
(gnc:report-type report)))
(cb (gnc:report-template-options-changed-cb template)))
(if (and cb (procedure? cb))
(cb report))))
(define gnc:report-editor-widget
(record-accessor <report> 'editor-widget))
(define gnc:report-set-editor-widget!
(record-modifier <report> 'editor-widget))
;; ctext is for caching the rendered html
(define gnc:report-ctext
(record-accessor <report> 'ctext))
(define gnc:report-set-ctext!
(record-modifier <report> 'ctext))
(define gnc:report-custom-template
(record-accessor <report> 'custom-template))
(define gnc:report-set-custom-template!
(record-modifier <report> 'custom-template))
;; gnc:make-report instantiates a report from a report-template.
;; The actual report is stored away in a hash-table -- only the id is returned.
(define (gnc:make-report template-id . rest)
(let* ((template-parent (gnc:report-template-parent-type (hash-ref *gnc:_report-templates_* template-id)))
(report-type (if template-parent
template-parent
template-id))
(custom-template (if template-parent
template-id
""))
(r ((record-constructor <report>)
report-type ;; type
#f ;; id
#f ;; options
#t ;; dirty
#f ;; needs-save
#f ;; editor-widget
#f ;; ctext
custom-template ;; custom-template
))
(template (hash-ref *gnc:_report-templates_* template-id))
)
(let ((options
(if (not (null? rest))
(car rest)
(gnc:report-template-new-options template))))
(gnc:report-set-options! r options)
(gnc:options-register-callback
#f #f
(lambda ()
(gnc:report-set-dirty?! r #t)
(let ((cb (gnc:report-template-options-changed-cb template)))
(if cb
(cb r))))
options))
(gnc:report-set-id! r (gnc-report-add r))
(gnc:report-id r))
)
(define (gnc:restore-report-by-guid id template-id template-name options)
(if options
(let ((r ((record-constructor <report>)
template-id id options #t #t #f #f "")))
(gnc-report-add r))
(begin
(gnc-error-dialog '() (string-append "Report Failed! One of your previously opened reports has failed to open. The template on which it was based: " template-name ", was not found."))
#f))
)
(define (gnc:restore-report-by-guid-with-custom-template id template-id template-name custom-template-id options)
(if options
(let ((r ((record-constructor <report>)
template-id id options #t #t #f #f custom-template-id)))
(gnc-report-add r))
(begin
(gnc-error-dialog '() (string-append "Report Failed! One of your previously opened reports has failed to open. The template on which it was based: " template-name ", was not found."))
#f))
)
(define (gnc:make-report-options template-id)
(let ((template (hash-ref *gnc:_report-templates_* template-id)))
(if template
(gnc:report-template-new-options template)
#f)))
;; A convenience wrapper to get the report-template's export types from
;; an instantiated report.
(define (gnc:report-export-types report)
(let ((template (hash-ref *gnc:_report-templates_*
(gnc:report-type report))))
(if template
(gnc:report-template-export-types template)
#f)))
;; A convenience wrapper to get the report-template's export thunk from
;; an instantiated report.
(define (gnc:report-export-thunk report)
(let ((template (hash-ref *gnc:_report-templates_*
(gnc:report-type report))))
(if template
(gnc:report-template-export-thunk template)
#f)))
(define (gnc:report-menu-name report)
(let ((template (hash-ref *gnc:_report-templates_*
(gnc:report-type report))))
(if template
(or (gnc:report-template-menu-name template)
(gnc:report-name report))
#f)))
(define (gnc:report-name report)
(let* ((opt (gnc:report-options report)))
(if opt
(gnc:option-value
(gnc:lookup-option opt gnc:pagename-general gnc:optname-reportname))
#f)))
(define (gnc:report-stylesheet report)
(gnc:html-style-sheet-find
(symbol->string (gnc:option-value
(gnc:lookup-option
(gnc:report-options report)
gnc:pagename-general
gnc:optname-stylesheet)))))
(define (gnc:report-set-stylesheet! report stylesheet)
(gnc:option-set-value
(gnc:lookup-option
(gnc:report-options report)
gnc:pagename-general
gnc:optname-stylesheet)
(string->symbol
(gnc:html-style-sheet-name stylesheet))))
;; Load and save helper functions
(define (gnc:all-report-template-guids)
(hash-fold
(lambda (k v p)
(cons k p))
'() *gnc:_report-templates_*))
;; return a list of the custom report template guids.
(define (gnc:custom-report-template-guids)
(hash-fold
(lambda (k v p)
(if (gnc:report-template-parent-type v)
(begin
(gnc:debug "template " v)
(cons k p))
p))
'() *gnc:_report-templates_*))
(define (gnc:find-report-template report-type)
(hash-ref *gnc:_report-templates_* report-type))
(define (gnc:report-template-is-custom/template-guid? guid)
(let* ((custom-template (if (string? guid) (if (string-null? guid) #f (hash-ref *gnc:_report-templates_* guid)) #f))
(parent-type (if custom-template (gnc:report-template-parent-type custom-template) #f)))
(if parent-type
#t
#f)))
(define (gnc:is-custom-report-type report)
(gnc:report-template-is-custom/template-guid? (gnc:report-custom-template report)))
;; This function should be called right before changing a custom-template's name
;; to test if the new name is unique among the existting custom reports.
;; If not the calling function can prevent the name from being updated.
(define (gnc:report-template-has-unique-name? templ-guid new-name)
(let* ((unique? #t))
(if new-name
(hash-for-each
(lambda (id rec)
(if (and (not (equal? templ-guid id))
(gnc:report-template-is-custom/template-guid? id)
(equal? new-name (gnc:report-template-name rec)))
(set! unique? #f)))
*gnc:_report-templates_*))
unique?))
;; Generate a unique custom template name using the given string as a base
;; If this string already exists as a custom template name, a
;; number will be appended to it.
(define (gnc:report-template-make-unique-name new-name)
(let* ((unique-name new-name)
(counter 0)
(unique? (gnc:report-template-has-unique-name? #f unique-name)))
(while (not unique?)
(begin
(set! counter (+ counter 1))
(set! unique-name (string-append new-name (number->string counter)))
(set! unique? (gnc:report-template-has-unique-name? #f unique-name))))
unique-name))
;; Load and save functions
;; Generate guile code required to recreate an instatiated report
(define (gnc:report-serialize report)
;; clean up the options if necessary. this is only needed
;; in special cases.
(let* ((report-type (gnc:report-type report))
(template (hash-ref *gnc:_report-templates_* report-type))
(thunk (gnc:report-template-options-cleanup-cb template)))
(if thunk
(thunk report)))
;; save them
(string-append
";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n"
(format #f ";; options for report ~S\n" (gnc:report-name report))
(format
#f "(let ((options (gnc:report-template-new-options/report-guid ~S ~S)))\n"
(gnc:report-type report) (gnc:report-template-name (hash-ref *gnc:_report-templates_* (gnc:report-type report))))
(gnc:generate-restore-forms (gnc:report-options report) "options")
;; 2.6->2.4 compatibility code prefix
;; Temporary check to make the new report saving code more or less backwards
;; compatible with older gnucash versions. This can be removed again in 2.8.
"(if (defined? 'gnc:restore-report-by-guid-with-custom-template)\n"
;; end of 2.6->2.4 compatibility code prefix.
(format
#f " (gnc:restore-report-by-guid-with-custom-template ~S ~S ~S ~S options)\n"
(gnc:report-id report) (gnc:report-type report)
(gnc:report-template-name (hash-ref *gnc:_report-templates_* (gnc:report-type report)))
(gnc:report-custom-template report))
;; 2.6->2.4 compatibility code suffix
(format
#f " (gnc:restore-report-by-guid ~S ~S ~S options))\n"
(gnc:report-id report) (gnc:report-type report)
(gnc:report-template-name (hash-ref *gnc:_report-templates_* (gnc:report-type report))))
;; end of 2.6->2.4 compatibility code suffix.
")"
))
;; Generate guile code required to recreate embedded report instances
(define (gnc:report-serialize-embedded embedded-reports)
(let* ((result-string ""))
(if embedded-reports
(for-each
(lambda (subreport-id)
(let*
((subreport (gnc-report-find subreport-id))
(subreport-options-text (gnc:report-serialize subreport)))
(set! result-string (string-append
result-string
";;;; Options for embedded report\n"
subreport-options-text))))
embedded-reports))
result-string))
(define (gnc:report-template-serialize-internal name type templ-name options guid)
(let* ((embedded-serialized (gnc:report-serialize-embedded (gnc:report-embedded-list options)))
(result (string-append
";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n"
(format #f ";; Options for saved report ~S, based on template ~S\n"
name type)
(format
#f "(let ()\n (define (options-gen)\n (let ((options (gnc:report-template-new-options/report-guid ~S ~S)))\n"
type templ-name)
(gnc:generate-restore-forms options "options")
(if embedded-serialized
embedded-serialized
"")
" options))\n"
(format
#f " (gnc:define-report \n 'version 1\n 'name ~S\n 'report-guid ~S\n 'parent-type ~S\n 'options-generator options-gen\n 'menu-path (list gnc:menuname-custom)\n 'renderer (gnc:report-template-renderer/report-guid ~S ~S)))\n\n"
name
(if guid
guid
(guid-new-return)) ;; when saving a report, we need to create a guid for it for later reloading
type
type
templ-name))))
(gnc:debug result)
result))
;; Convert an instantiated report into a report template
;; and generate the guile code required to recreate this template
(define (gnc:report-template-serialize-from-report report)
;; clean up the options if necessary. this is only needed
;; in special cases.
(let* ((template
(hash-ref *gnc:_report-templates_*
(gnc:report-type report)))
(thunk (gnc:report-template-options-cleanup-cb template)))
(if thunk
(thunk report)))
;; save them
(let* ((name (gnc:report-template-make-unique-name (gnc:report-name report)))
(type (gnc:report-type report))
(templ-name (gnc:report-template-name (hash-ref *gnc:_report-templates_* (gnc:report-type report))))
(options (gnc:report-options report)))
(gnc:report-template-serialize-internal name type templ-name options #f)))
;; Generate guile code required to recreate a report template
;; Note: multi column report templates encapsulate instantiated reports, not other report templates
;; this means that the template recreation code must also contain the code to instantiate
;; these embedded report instances. This results in a mix of template and instatiated reports
;; in the saved reports file...
(define (gnc:report-template-serialize report-template)
(let* ((name (gnc:report-template-name report-template))
(type (gnc:report-template-parent-type report-template))
(templ-name (gnc:report-template-name (hash-ref *gnc:_report-templates_* type)))
(options (gnc:report-template-new-options report-template))
(guid (gnc:report-template-report-guid report-template)))
(gnc:report-template-serialize-internal name type templ-name options guid)))
;; Convert a report into a report template and save this template in the savefile
;; Under specific conditions the we will attempt to replace the current report's
;; template instead of simply adding a new template to the file.
;; These condititions are:
;; 1. the report is an instance of an existing custom report template
;; (ie a template that is stored in the savefile already)
;; 2. an overwrite is requestes by setting overwrite? to #t
(define (gnc:report-to-template report overwrite?)
(let* ((custom-template-id (gnc:report-custom-template report))
(overwrite-ok? (and (gnc:report-template-is-custom/template-guid? custom-template-id) overwrite?))
;; Generate a serialized report-template with a random guid
(saved-form (gnc:report-template-serialize-from-report report))
;; Immediately evaluate the serialized report template to
;; - check if it's error free and can be deserialized
;; - load it into the runtime for immediate use by the user
;; (Bug #342206)
(save-result (eval-string saved-form)))
(if (record? save-result)
(begin
;; If it's ok to overwrite the old template, delete it now.
(if overwrite-ok?
(let ((templ-name (gnc:report-template-name (hash-ref *gnc:_report-templates_* custom-template-id))))
;; We're overwriting, which needs some additional steps
;; 1. Remove the newly generated template from the template list again
(hash-remove! *gnc:_report-templates_* (gnc:report-template-report-guid save-result))
;; 2. We still have the template record available though, so adapt it to
;; the template we want to override (ie update guid and name)
(gnc:report-template-set-report-guid! save-result custom-template-id)
(gnc:report-template-set-name save-result templ-name)
;; 3. Overwrite the template with the new one
(hash-set! *gnc:_report-templates_* custom-template-id save-result)
))
;; Regardless of how we got here, we now have a new template to write
;; so let's write it
(if (gnc:save-all-reports)
(let ((templ-guid (gnc:report-template-report-guid save-result)))
;; Indicate the report was instantiated from the new template
(gnc:report-set-custom-template! report templ-guid)
;; Inform the calling function of the new template's guid
templ-guid)
#f))
#f)))
;; Convert a report into a new report template and add this template to the save file
(define (gnc:report-to-template-new report)
(gnc:report-to-template report #f))
;; Get the current report's template and try to update it with the report's current
;; settings. This will only be possible if the report was already based on a
;; custom report template. If that's not the case, a new template will be added instead.
(define (gnc:report-to-template-update report)
(gnc:report-to-template report #t))
(define (gnc:report-template-save-to-savefile report-template)
(let ((saved-form (gnc:report-template-serialize report-template)))
(gnc-saved-reports-write-to-file saved-form #f)))
;; save all custom reports, moving the old version of the
;; saved-reports file aside as a backup
;; return #t if all templates were saved successfully
(define (gnc:save-all-reports)
(let ((save-ok? #t))
(gnc-saved-reports-backup)
(gnc-saved-reports-write-to-file "" #t)
(hash-for-each (lambda (k v)
(if (gnc:report-template-parent-type v)
(begin
(gnc:debug "saving report " k)
(if (not (gnc:report-template-save-to-savefile v))
(set! save-ok? #f)
))))
*gnc:_report-templates_*)
save-ok?))
;; gets the renderer from the report template;
;; gets the stylesheet from the report;
;; renders the html doc and caches the resulting string;
;; returns the html string.
;; Now accepts either an html-doc or finished HTML from the renderer -
;; the former requires further processing, the latter is just returned.
(define (gnc:report-render-html report headers?)
(if (and (not (gnc:report-dirty? report))
(gnc:report-ctext report))
;; if there's clean cached text, return it
;;(begin
(gnc:report-ctext report)
;; )
;; otherwise, rerun the report
(let ((template (hash-ref *gnc:_report-templates_*
(gnc:report-type report)))
(doc #f))
(set! doc (if template
(let* ((renderer (gnc:report-template-renderer template))
(stylesheet (gnc:report-stylesheet report))
(doc (renderer report))
(html #f))
(if (string? doc)
(set! html doc)
(begin
(gnc:html-document-set-style-sheet! doc stylesheet)
(set! html (gnc:html-document-render doc headers?))))
(gnc:report-set-ctext! report html) ;; cache the html
(gnc:report-set-dirty?! report #f) ;; mark it clean
html)
#f))
doc))) ;; YUK! inner doc is html-doc object; outer doc is a string.
;; looks up the report by id and renders it with gnc:report-render-html
;; marks the cursor busy during rendering; returns the html
;; Note: the final html document is post-processed to ensure there's only one single
;; inclusion of the jquery/jqplot libraries. This is only needed to fix multicolumn
;; reports with multiple charts, but doing it more generally is an
;; acceptable hack until a cleaner solution can be found (bug #704525)
(define (gnc:report-run id)
(let ((report (gnc-report-find id))
(html #f))
(gnc-set-busy-cursor '() #t)
(gnc:backtrace-if-exception
(lambda ()
(if report
(begin
(set! html (gnc:report-render-html report #t))
(set! html (gnc:substring-replace-from-to html (gnc:html-js-include "jqplot/jquery.min.js") "" 2 -1))
(set! html (gnc:substring-replace-from-to html (gnc:html-js-include "jqplot/jquery.jqplot.js") "" 2 -1))
))))
(gnc-unset-busy-cursor '())
html))
;; "thunk" should take the report-type and the report template record
(define (gnc:report-templates-for-each thunk)
(hash-for-each (lambda (report-id template) (thunk report-id template))
*gnc:_report-templates_*))
;; return the list of reports embedded in the specified report
(define (gnc:report-embedded-list options)
(let* ((option (gnc:lookup-option options "__general" "report-list")))
(if option
(let ((opt-value (gnc:option-value option)))
(map (lambda (x) (car x)) opt-value))
#f)))
;; delete an existing report from the hash table and then call to
;; resave the saved-reports file... report is gone
(define (gnc:delete-report template-guid)
(if (hash-ref *gnc:_report-templates_* template-guid)
(begin
(gnc:debug "Deleting report " template-guid)
(hash-remove! *gnc:_report-templates_* template-guid)
(gnc:save-all-reports))))
;; rename an existing report from the hash table and then
;; resave the saved-reports file
(define (gnc:rename-report template-guid new-name)
(let ((templ (hash-ref *gnc:_report-templates_* template-guid)))
(if templ
(begin
(gnc:debug "Renaming report " template-guid)
(gnc:report-template-set-name templ new-name)
(gnc:save-all-reports)))))
;; Legacy functions
;;;;;;;;;;;;;;;;;;;
;; Legacy : the following 3 functions are only needed to
;; load a saved-reports file version 2.0
(define (gnc:report-template-new-options/name template-name)
(let ((templ #f))
(hash-for-each
(lambda (id rec)
(if (equal? template-name (gnc:report-template-name rec))
(set! templ (hash-ref *gnc:_report-templates_* id)))) *gnc:_report-templates_*)
(if templ
(gnc:report-template-new-options templ)
#f)))
(define (gnc:report-template-menu-name/name template-name)
(let ((templ #f))
(hash-for-each
(lambda (id rec)
(if (equal? template-name (gnc:report-template-name rec))
(set! templ (hash-ref *gnc:_report-templates_* id)))) *gnc:_report-templates_*)
(if templ
(or (gnc:report-template-menu-name templ)
(gnc:report-template-name templ))
#f)))
(define (gnc:report-template-renderer/name template-name)
(let ((templ #f))
(hash-for-each
(lambda (id rec)
(if (equal? template-name (gnc:report-template-name rec))
(set! templ (hash-ref *gnc:_report-templates_* id)))) *gnc:_report-templates_*)
(if templ
(gnc:report-template-renderer templ)
#f)))
;; Used internally only to convert a report template name into a corresponding guid
;; Note that this may fail if several reports exist with the same name
(define (gnc:report-template-name-to-id template-name)
(let ((template-id #f))
(hash-for-each
(lambda (id rec)
(if (equal? template-name (gnc:report-template-name rec))
(set! template-id id))) *gnc:_report-templates_*)
template-id))
;; We want to warn users when we are trying to restore reports stored in the legacy
;; format (based on name instead of guid), but only once
(define gnc:old-style-restore-warned #f)
;; Legacy: this function is needed only to restore
;; a saved report when loading a book last saved in GnuCash 2.2
(define (gnc:restore-report id template-name options)
(if options
(let ((r ((record-constructor <report>)
(gnc:report-template-name-to-id template-name) id options #t #t #f #f "")))
;; Warn user (one time) we're attempting to restore old style reports
(if (not gnc:old-style-restore-warned)
(begin
(set! gnc:old-style-restore-warned #t)
(gnc-warning-dialog '() (string-append (_ "Some reports stored in a legacy format were found. This format is not supported anymore so these reports may not have been restored properly.")))))
(gnc-report-add r))
(begin
(gnc-error-dialog '() (string-append "Report Failed! One of your previously opened reports has failed to open. The template on which it was based: " template-name ", was not found."))
#f)))
| false |
cbb2ba129205def8979b04f6f86d35b92605c3ce
|
defeada37d39bca09ef76f66f38683754c0a6aa0
|
/mscorlib/system/security/cryptography/crypto-apitransform.sls
|
53ad8127004a34904fd15dfbb4fdbd445fa44634
|
[] |
no_license
|
futsuki/ironscheme-port
|
2dbac82c0bda4f4ff509208f7f00a5211d1f7cd5
|
4e7a81b0fbeac9a47440464988e53fb118286c54
|
refs/heads/master
| 2016-09-06T17:13:11.462593 | 2015-09-26T18:20:40 | 2015-09-26T18:20:40 | 42,757,369 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 2,034 |
sls
|
crypto-apitransform.sls
|
(library (system security cryptography crypto-apitransform)
(export is?
crypto-apitransform?
transform-block
transform-final-block
reset
clear
can-reuse-transform?
can-transform-multiple-blocks?
input-block-size
key-handle
output-block-size)
(import (ironscheme-clr-port))
(define (is? a)
(clr-is System.Security.Cryptography.CryptoAPITransform a))
(define (crypto-apitransform? a)
(clr-is System.Security.Cryptography.CryptoAPITransform a))
(define-method-port
transform-block
System.Security.Cryptography.CryptoAPITransform
TransformBlock
(System.Int32
System.Byte[]
System.Int32
System.Int32
System.Byte[]
System.Int32))
(define-method-port
transform-final-block
System.Security.Cryptography.CryptoAPITransform
TransformFinalBlock
(System.Byte[] System.Byte[] System.Int32 System.Int32))
(define-method-port
reset
System.Security.Cryptography.CryptoAPITransform
Reset
(System.Void))
(define-method-port
clear
System.Security.Cryptography.CryptoAPITransform
Clear
(System.Void))
(define-field-port
can-reuse-transform?
#f
#f
(property:)
System.Security.Cryptography.CryptoAPITransform
CanReuseTransform
System.Boolean)
(define-field-port
can-transform-multiple-blocks?
#f
#f
(property:)
System.Security.Cryptography.CryptoAPITransform
CanTransformMultipleBlocks
System.Boolean)
(define-field-port
input-block-size
#f
#f
(property:)
System.Security.Cryptography.CryptoAPITransform
InputBlockSize
System.Int32)
(define-field-port
key-handle
#f
#f
(property:)
System.Security.Cryptography.CryptoAPITransform
KeyHandle
System.IntPtr)
(define-field-port
output-block-size
#f
#f
(property:)
System.Security.Cryptography.CryptoAPITransform
OutputBlockSize
System.Int32))
| false |
799665b399d031c881850baa08c0728d14ef7a60
|
a19179bb62bce1795f8918e52b2964a33d1534ec
|
/ch4/ex4.4.scm
|
a30e61ee45806fa107dc127ee16445b6cc83f82b
|
[] |
no_license
|
b0oh/sicp-exercises
|
67c22433f761e3ba3818050da9fdcf1abf38815e
|
58b1c6dfa8bb74499f0d674ab58ad5c21d85ba1a
|
refs/heads/master
| 2020-12-24T16:58:55.398175 | 2013-12-09T09:16:42 | 2013-12-09T09:16:42 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 2,839 |
scm
|
ex4.4.scm
|
;; Exercise 4.4.
;; http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-26.html#%_thm_4.4
;; Recall the definitions of the special forms and and or from chapter 1:
;; and: The expressions are evaluated from left to right. If any
;; expression evaluates to false, false is returned; any remaining
;; expressions are not evaluated. If all the expressions evaluate to true
;; values, the value of the last expression is returned. If there are no
;; expressions then true is returned.
;; or: The expressions are evaluated from left to right. If any
;; expression evaluates to a true value, that value is returned; any
;; remaining expressions are not evaluated. If all expressions evaluate
;; to false, or if there are no expressions, then false is returned.
;; Install and and or as new special forms for the evaluator by defining
;; appropriate syntax procedures and evaluation procedures eval-and and
;; eval-or. Alternatively, show how to implement and and or as derived
;; expressions.
(load "tests.scm")
(load "interp.scm")
(define (eval-and exp env)
(define (iter args)
(if (null? args)
true
(let ((arg (eval (first-exp args) env)))
(cond ((last-exp? args) arg)
((true? arg) (iter (rest-exps args)))
(else false)))))
(iter (rest-exps exp)))
(define (eval-or exp env)
(define (iter args)
(if (null? args)
false
(let ((arg (eval (first-exp args) env)))
(cond ((last-exp? args) arg)
((true? arg) arg)
(else (iter (rest-exps args)))))))
(iter (rest-exps exp)))
;; Implementation as derived expressions
(define (and->if exp env)
(define (expand-and args)
(if (null? args)
'true
(let ((arg (eval (first-exp args) env)))
(if (last-exp? args)
arg
(make-if arg (expand-and (rest-exps args)) 'false)))))
(expand-and (rest-exps exp)))
(define (or->if exp env)
(define (expand-or args)
(if (null? args)
'false
(let ((arg (eval (first-exp args) env)))
(if (last-exp? args)
arg
(make-if arg arg (expand-or (rest-exps args)))))))
(expand-or (rest-exps exp)))
(define (ex4.4-tests)
(define env (setup-environment))
(assert (eval-and '(and) env) true)
(assert (eval-and '(and true) env) true)
(assert (eval-and '(and 1) env) 1)
(assert (eval-and '(and false) env) false)
(assert (eval-and '(and true 1) env) 1)
(assert (eval-and '(and false 1) env) false)
(assert (eval-or '(or) env) false)
(assert (eval-or '(or true) env) true)
(assert (eval-or '(or false) env) false)
(assert (eval-or '(or false 1) env) 1)
(assert (eval-or '(or false 1 2) env) 1)
(assert (eval-or '(or false 1 false) env) 1))
| false |
15a15b1a696bc0e0d4033c48cd573fddf575dc7b
|
a74932f6308722180c9b89c35fda4139333703b8
|
/edwin48/lincom.scm
|
a240aab98027a136cdabb9b43cd0e5f14183727a
|
[] |
no_license
|
scheme/edwin48
|
16b5d865492db5e406085e8e78330dd029f1c269
|
fbe3c7ca14f1418eafddebd35f78ad12e42ea851
|
refs/heads/master
| 2021-01-19T17:59:16.986415 | 2014-12-21T17:50:27 | 2014-12-21T17:50:27 | 1,035,285 | 39 | 10 | null | 2022-02-15T23:21:14 | 2010-10-29T16:08:55 |
Scheme
|
UTF-8
|
Scheme
| false | false | 16,599 |
scm
|
lincom.scm
|
#| -*-Scheme-*-
$Id: lincom.scm,v 1.130 2008/01/30 20:02:03 cph Exp $
Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994,
1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
2006, 2007, 2008 Massachusetts Institute of Technology
This file is part of MIT/GNU Scheme.
MIT/GNU Scheme is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at
your option) any later version.
MIT/GNU Scheme is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with MIT/GNU Scheme; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301,
USA.
|#
;;;; Line/Indentation Commands
;;;; Lines
(define-command count-lines-region
"Type number of lines from point to mark."
"r"
(lambda (region)
(message "Region has "
(region-count-lines region)
" lines, "
(- (region-end-index region) (region-start-index region))
" characters.")))
(define-command what-line
"Print the current line number (in the buffer) of point."
()
(lambda ()
(let ((buffer (current-buffer)))
(without-group-clipped! (buffer-group buffer)
(lambda ()
(message "Line "
(+ (count-lines (buffer-start buffer) (current-point))
1)))))))
(define (count-lines start end)
(region-count-lines (make-region start end)))
(define-command goto-line
"Goto line ARG, counting from line 1 at beginning of buffer."
"NGoto line"
(lambda (n)
(set-current-point!
(line-start (buffer-start (current-buffer)) (- n 1) 'ERROR))))
(define-command transpose-lines
"Transpose the lines before and after the cursor.
With a positive argument it transposes the lines before and after the
cursor, moves right, and repeats the specified number of times,
dragging the line to the left of the cursor right.
With a negative argument, it transposes the two lines to the left of
the cursor, moves between them, and repeats the specified number of
times, exactly undoing the positive argument form.
With a zero argument, it transposes the lines at point and mark.
At the end of a buffer, with no argument, the preceding two lines are
transposed."
"p"
(lambda (argument)
(cond ((and (= argument 1) (group-end? (current-point)))
(if (not (line-start? (current-point)))
(insert-newlines 1))
(insert-string (extract-and-delete-string
(forward-line (current-point) -2 'ERROR)
(forward-line (current-point) -1 'ERROR))
(current-point)))
(else
(transpose-things forward-line argument)))))
;;;; Pages
(define-command forward-page
"Move forward to page boundary. With arg, repeat, or go back if negative.
A page boundary is any line whose beginning matches the regexp page-delimiter."
"p"
(lambda (argument)
(move-thing forward-page argument 'FAILURE)))
(define-command backward-page
"Move backward to page boundary. With arg, repeat, or go fwd if negative.
A page boundary is any line whose beginning matches the regexp page-delimiter."
"p"
(lambda (argument)
(move-thing backward-page argument 'FAILURE)))
(define-command mark-page
"Put mark at end of page, point at beginning."
"P"
(lambda (argument)
(let ((end
(forward-page (current-point)
(1+ (or (command-argument-value argument) 0))
'LIMIT)))
(set-current-region! (make-region (backward-page end 1 'LIMIT) end)))))
(define-command narrow-to-page
"Make text outside current page invisible."
"d"
(lambda (mark)
(region-clip! (page-interior-region mark))))
(define (page-interior-region point)
(if (and (group-end? point)
(let ((break (re-match-forward
(ref-variable page-delimiter)
(line-start point 0)
point)))
(and break
(mark= break point))))
(make-region point point)
(let ((end (forward-page point 1 'LIMIT)))
(make-region (let ((start (backward-page end 1 'LIMIT)))
(if (and (line-end? start)
(not (group-start? start))
(not (group-end? start)))
(mark1+ start)
start))
(let ((end* (line-start end 0)))
(if (and (mark<= point end*)
(let ((break (re-match-forward
(ref-variable page-delimiter)
end*
end)))
(and break
(mark= break end))))
end*
end))))))
(define-command count-lines-page
"Report number of lines on current page."
"d"
(lambda (point)
(let ((end
(let ((end (forward-page point 1 'LIMIT)))
(if (group-end? end)
end
(line-start end 0)))))
(let ((start (backward-page end 1 'LIMIT)))
(message "Page has " (count-lines start end)
" lines (" (count-lines start point)
" + " (count-lines point end) ")")))))
(define-command what-page
"Report page and line number of point."
()
(lambda ()
(let ((buffer (current-buffer)))
(without-group-clipped! (buffer-group buffer)
(lambda ()
(let ((point (current-point)))
(message "Page "
(let loop ((count 0) (start (buffer-start buffer)))
(if (or (not start)
(mark> start point))
count
(loop (+ count 1) (forward-page start 1))))
", Line "
(+ (count-lines
(backward-page (forward-page point 1 'LIMIT) 1 'LIMIT)
point)
1))))))))
(define-command goto-page
"Goto page ARG, counting from page 1 at beginning of buffer."
"NGoto page"
(lambda (n)
(set-current-point!
(forward-page (buffer-start (current-buffer)) (- n 1) 'ERROR))))
;;;; Indentation
(define (indent-to-left-margin)
(maybe-change-indentation (ref-variable left-margin)
(line-start (current-point) 0)))
(define-variable indent-line-procedure
"Procedure used to indent current line.
If this is the procedure indent-to-left-margin,
\\[indent-for-tab-command] will insert tab characters rather than indenting."
indent-to-left-margin)
(define-command indent-according-to-mode
"Indent line in proper way for current major mode.
The exact behavior of this command is determined
by the variable indent-line-procedure."
()
(lambda ()
((ref-variable indent-line-procedure))))
(define-command indent-for-tab-command
"Indent line in proper way for current major mode.
The exact behavior of this command is determined
by the variable indent-line-procedure."
"p"
(lambda (argument)
(let ((indent-line-procedure (ref-variable indent-line-procedure)))
(if (eq? indent-line-procedure indent-to-left-margin)
(let ((insert-tab (ref-command insert-tab)))
(do ((i argument (- i 1)))
((<= i 0))
(insert-tab)))
(indent-line-procedure)))))
(define-command newline-and-indent
"Insert a newline, then indent according to major mode.
Indentation is done using the current indent-line-procedure,
except that if there is a fill-prefix it is used to indent.
In programming language modes, this is the same as TAB.
In some text modes, where TAB inserts a tab, this indents to the
specified left-margin column."
()
(lambda ()
(delete-horizontal-space)
(insert-newline)
(let ((fill-prefix (ref-variable fill-prefix)))
(if fill-prefix
(region-insert-string! (current-point) fill-prefix)
((ref-command indent-according-to-mode))))))
(define-command reindent-then-newline-and-indent
"Reindent the current line according to mode (like
\\[indent-according-to-mode]), then insert a newline,
and indent the new line indent according to mode."
()
(lambda ()
((ref-command indent-according-to-mode))
((ref-command newline-and-indent))))
(define-variable-per-buffer indent-tabs-mode
"If false, do not use tabs for indentation or horizontal spacing."
#t
boolean?)
(define-command indent-tabs-mode
"Enables or disables use of tabs as indentation.
A positive argument turns use of tabs on;
zero or negative, turns it off.
With no argument, the mode is toggled."
"P"
(lambda (argument)
(set-variable! indent-tabs-mode
(if argument
(positive? (command-argument-value argument))
(not (ref-variable indent-tabs-mode))))))
(define-command insert-tab
"Insert a tab character."
()
(lambda ()
(if (ref-variable indent-tabs-mode)
(insert-char #\tab)
(maybe-change-column
(let ((tab-width (ref-variable tab-width)))
(* tab-width (1+ (quotient (current-column) tab-width))))))))
(define-command indent-relative
"Space out to under next indent point in previous nonblank line.
An indent point is a non-whitespace character following whitespace."
()
(lambda ()
(let ((point (current-point)))
(let ((indentation (indentation-of-previous-non-blank-line point)))
(cond ((not (= indentation (current-indentation point)))
(change-indentation indentation point))
((line-start? (horizontal-space-start point))
(set-current-point! (horizontal-space-end point))))))))
(define (indentation-of-previous-non-blank-line mark)
(let ((start (find-previous-non-blank-line mark)))
(if start
(current-indentation start)
0)))
(define-variable indent-region-procedure
"Function which is short cut to indent each line in region with Tab.
#F means really call Tab on each line."
#f
(lambda (object)
(or (false? object)
(and (procedure? object)
(procedure-arity-valid? object 2)))))
(define-command indent-region
"Indent each nonblank line in the region.
With no argument, indent each line with Tab.
With argument COLUMN, indent each line to that column."
"r\nP"
(lambda (region argument)
(let ((start (region-start region))
(end (region-end region)))
(cond (argument
(indent-region start end argument))
((ref-variable indent-region-procedure)
((ref-variable indent-region-procedure) start end))
(else
(for-each-line-in-region start end
(let ((indent-line (ref-variable indent-line-procedure)))
(lambda (start)
(set-current-point! start)
(indent-line)))))))))
(define (indent-region start end n-columns)
(if (exact-nonnegative-integer? n-columns)
(for-each-line-in-region start end
(lambda (start)
(delete-string start (horizontal-space-end start))
(insert-horizontal-space n-columns start)))))
(define-command indent-rigidly
"Indent all lines starting in the region sideways by ARG columns."
"r\nP"
(lambda (region argument)
(let ((argument (command-argument-numeric-value argument)))
(if argument
(indent-rigidly (region-start region)
(region-end region)
argument)))))
(define (indent-rigidly start end n-columns)
(for-each-line-in-region start end
(lambda (start)
(let ((end (horizontal-space-end start)))
(if (line-end? end)
(delete-string start end)
(let ((new-column (max 0 (+ n-columns (mark-column end)))))
(delete-string start end)
(insert-horizontal-space new-column start)))))))
(define (for-each-line-in-region start end procedure)
(if (not (mark<= start end))
(error "Marks incorrectly related:" start end))
(let ((start (mark-right-inserting-copy (line-start start 0))))
(let ((end
(mark-left-inserting-copy
(if (and (line-start? end) (mark< start end))
(mark-1+ end)
(line-end end 0)))))
(let loop ()
(procedure start)
(let ((m (line-end start 0)))
(if (mark< m end)
(begin
(move-mark-to! start (mark1+ m))
(loop)))))
(mark-temporary! start)
(mark-temporary! end))))
(define-command newline
"Insert a newline. With arg, insert that many newlines."
"*P"
(lambda (argument)
(self-insert #\newline
(command-argument-numeric-value argument)
;; Don't do auto-fill if argument supplied.
(not argument))))
(define-command split-line
"Move rest of this line vertically down.
Inserts a newline, and then enough tabs/spaces so that
what had been the rest of the current line is indented as much as
it had been. Point does not move, except to skip over indentation
that originally followed it.
With argument, makes extra blank lines in between."
"p"
(lambda (argument)
(set-current-point! (horizontal-space-end (current-point)))
(let ((m* (mark-right-inserting (current-point))))
(insert-newlines (max argument 1))
(insert-horizontal-space (mark-column m*))
(set-current-point! m*))))
(define-command back-to-indentation
"Move to end of this line's indentation."
()
(lambda ()
(set-current-point!
(horizontal-space-end (line-start (current-point) 0)))))
(define-command delete-horizontal-space
"Delete all spaces and tabs around point."
()
delete-horizontal-space)
(define-command just-one-space
"Delete all spaces and tabs around point, leaving just one space."
()
(lambda ()
(delete-horizontal-space)
(insert-chars #\Space 1)))
(define-command delete-blank-lines
"On blank line, delete all surrounding blank lines, leaving just one.
On isolated blank line, delete that one.
On nonblank line, delete all blank lines that follow it."
"*"
(lambda ()
(let ((point (current-point)))
(let ((end
(let loop ((m point))
(let ((m (line-end m 0)))
(if (group-end? m)
m
(let ((m* (mark1+ m)))
(if (line-blank? m*)
(loop m*)
m)))))))
(if (line-blank? point)
(let ((start
(let loop ((m (line-start point 0)))
(let ((m* (line-start m -1)))
(if (and m* (line-blank? m*))
(loop m*)
m)))))
(delete-string start
(if (or (mark< (line-end start 0) end)
(group-end? end))
end
(mark1+ end))))
(let ((start (line-end point 0)))
(if (mark< start end)
(delete-string (mark1+ start)
(if (group-end? end)
end
(mark1+ end))))))))))
(define-command delete-indentation
"Join this line to previous and fix up whitespace at join.
With argument, join this line to following line."
"*P"
(lambda (argument)
(let ((point
(mark-left-inserting-copy
(horizontal-space-start
(line-end (current-point) (if (not argument) -1 0) 'ERROR))))
(fill-prefix (ref-variable fill-prefix)))
(delete-string point (line-start point 1 'ERROR))
(if fill-prefix
(let ((m
(match-forward fill-prefix point (line-end point 0) #f)))
(if m
(delete-string point m))))
(mark-temporary! point)
(set-current-point! point))
((ref-command fixup-whitespace))))
(define-command fixup-whitespace
"Fix up white space between objects around point.
Leave one space or none, according to the context."
"*"
(lambda ()
(delete-horizontal-space)
(let ((point (current-point)))
(if (not (or (re-match-forward "^\\|\\s)" point)
(re-match-forward "$\\|\\s(\\|\\s'" (mark-1+ point))))
(insert-char #\space point)))))
;;;; Tabification
(define-command untabify
"Convert all tabs in region to multiple spaces, preserving columns.
The variable tab-width controls the action."
"r"
(lambda (region)
(untabify-region (region-start region) (region-end region))))
(define (untabify-region start end)
(let ((start (mark-left-inserting-copy start))
(end (mark-left-inserting-copy end)))
(let loop ()
(let ((m (char-search-forward #\tab start end)))
(if m
(begin
(move-mark-to! start m)
(let ((tab (mark-1+ start)))
(let ((n-spaces (- (mark-column start) (mark-column tab))))
(delete-string tab start)
(insert-chars #\space n-spaces start)))
(loop)))))
(mark-temporary! start)
(mark-temporary! end)))
(define-command tabify
"Convert multiple spaces in region to tabs when possible.
A group of spaces is partially replaced by tabs
when this can be done without changing the column they end at.
The variable tab-width controls the action."
"r"
(lambda (region)
(tabify-region (region-start region) (region-end region))))
(define (tabify-region start end)
(let ((start (mark-left-inserting-copy start))
(end (mark-left-inserting-copy end))
(tab-width (group-tab-width (mark-group start))))
(do ()
((not (re-search-forward "[ \t][ \t]+" start end #f)))
(move-mark-to! start (re-match-start 0))
(let ((end-column (mark-column (re-match-end 0))))
(delete-string start (re-match-end 0))
(insert-horizontal-space end-column start tab-width)))
(mark-temporary! start)
(mark-temporary! end)))
| false |
2a4e663c9f386671ae45014465ce65a13126ae3e
|
defeada37d39bca09ef76f66f38683754c0a6aa0
|
/System/system/text/regular-expressions/match.sls
|
ed9032e61ac0334a1c8aeb29933f289e199dd8d9
|
[] |
no_license
|
futsuki/ironscheme-port
|
2dbac82c0bda4f4ff509208f7f00a5211d1f7cd5
|
4e7a81b0fbeac9a47440464988e53fb118286c54
|
refs/heads/master
| 2016-09-06T17:13:11.462593 | 2015-09-26T18:20:40 | 2015-09-26T18:20:40 | 42,757,369 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,068 |
sls
|
match.sls
|
(library (system text regular-expressions match)
(export is? match? result next-match synchronized empty groups)
(import (ironscheme-clr-port))
(define (is? a) (clr-is System.Text.RegularExpressions.Match a))
(define (match? a) (clr-is System.Text.RegularExpressions.Match a))
(define-method-port
result
System.Text.RegularExpressions.Match
Result
(System.String System.String))
(define-method-port
next-match
System.Text.RegularExpressions.Match
NextMatch
(System.Text.RegularExpressions.Match))
(define-method-port
synchronized
System.Text.RegularExpressions.Match
Synchronized
(static:
System.Text.RegularExpressions.Match
System.Text.RegularExpressions.Match))
(define-field-port
empty
#f
#f
(static: property:)
System.Text.RegularExpressions.Match
Empty
System.Text.RegularExpressions.Match)
(define-field-port
groups
#f
#f
(property:)
System.Text.RegularExpressions.Match
Groups
System.Text.RegularExpressions.GroupCollection))
| false |
d9d2bd20f3e6036018db412aa0e81ebcf8b763ed
|
f4cf5bf3fb3c06b127dda5b5d479c74cecec9ce9
|
/Sources/LispKit/Resources/Libraries/srfi/131.sld
|
d33daf83cd3aceb56c63c2f990ff3b892420d7c8
|
[
"Apache-2.0"
] |
permissive
|
objecthub/swift-lispkit
|
62b907d35fe4f20ecbe022da70075b70a1d86881
|
90d78a4de3a20447db7fc33bdbeb544efea05dda
|
refs/heads/master
| 2023-08-16T21:09:24.735239 | 2023-08-12T21:37:39 | 2023-08-12T21:37:39 | 57,930,217 | 356 | 17 |
Apache-2.0
| 2023-06-04T12:11:51 | 2016-05-03T00:37:22 |
Scheme
|
UTF-8
|
Scheme
| false | false | 1,197 |
sld
|
131.sld
|
;;; SRFI 131
;;; ERR5RS Record Syntax (reduced)
;;;
;;; This SRFI is a reduced version of the SRFI 99 syntactic layer that can be
;;; implemented with syntax-rules without requiring low-level macros. Like
;;; SRFI-99's syntax layer, it is backward compatible with the `define-record-type`
;;; macro from SRFI 9 or R7RS-small. It is forward compatible with SRFI 99.
;;;
;;; Author of spec: John Cowan, Will Clinger
;;;
;;; Copyright © 2023 Matthias Zenger. All rights reserved.
;;;
;;; Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file
;;; except in compliance with the License. You may obtain a copy of the License at
;;;
;;; http://www.apache.org/licenses/LICENSE-2.0
;;;
;;; Unless required by applicable law or agreed to in writing, software distributed under the
;;; License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,
;;; either express or implied. See the License for the specific language governing permissions
;;; and limitations under the License.
(define-library (srfi 131)
(export define-record-type)
(import (lispkit record))
;; The form is implemented natively in library `(lispkit record)`
)
| false |
0dde292d78746ed4c6a542cea677c40ac5d0d9ea
|
4a9bde514c789982d7dda8362cd50b9d7482913f
|
/Chapter2/sicp2.63.scm
|
2e6b93bb1593948455accb12798f322d80ba0018
|
[] |
no_license
|
atsfour/sicp
|
7e8e0deefa16201da6d01db34e24ad3245dbb052
|
f6f2818cbe440ac2ec557453945c0782e7267842
|
refs/heads/master
| 2020-03-30T08:12:36.638041 | 2015-12-03T15:50:47 | 2015-12-08T06:51:04 | 39,726,082 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 3,256 |
scm
|
sicp2.63.scm
|
; binary tree
(define (entry tree) (car tree))
(define (left-branch tree) (cadr tree))
(define (right-branch tree) (caddr tree))
(define (make-tree entry left right)
(list entry left right))
; set operation
(define (element-of-set? x set)
(cond ((null? set) #f)
((= x (entry set)) #t)
((< x (entry set))
(element-of-set? x (left-branch set)))
((>x (entry set))
(element-of-set? x (right-branch set)))))
(define (adjoin-set x set)
(cond ((null? set) (make-tree x '() '()))
((= x (entry set)) set)
((< x (entry set)) (make-tree (entry set)
(adjoin-set x (left-branch set))
(right-branch set)))
((> x (entry set)) (make-tree (entry set)
(left-branch set)
(adjoin-set x (right-branch set))))))
;Exercise 2.63
(define (tree-to-list-1 tree)
(if (null? tree)
'()
(append (tree-to-list-1 (left-branch tree))
(cons (entry tree)
(tree-to-list-1 (right-branch tree))))))
(define (tree-to-list-2 tree)
(define (copy-to-list tree result-list)
(if (null? tree)
result-list
(copy-to-list (left-branch tree)
(cons (entry tree)
(copy-to-list (right-branch tree)
result-list)))))
(copy-to-list tree '()))
;Exercise 2.64
(define (list-to-tree elements)
(car (partial-tree elements (length elements))))
(define (partial-tree elts n)
(if (= n 0)
(cons '() elts)
(let ((left-size (quotient (- n 1) 2)))
(let ((left-result
(partial-tree elts left-size)))
(let ((left-tree (car left-result))
(non-left-elts (cdr left-result))
(right-size (- n (+ left-size 1))))
(let ((this-entry (car non-left-elts))
(right-result
(partial-tree
(cdr non-left-elts)
right-size)))
(let ((right-tree (car right-result))
(remainding-elts
(cdr right-result)))
(cons (make-tree this-entry left-tree right-tree)
remainding-elts))))))))
;partial-treeはリストeltsのうちn個の要素をバランスのとれた木構造とし、
;残りの部分をそのままリストとして返す手続きである。
;partial-treeは1回あたりで長さが約半分になり、自身を2回呼び出すため、
;list-to-treeは全体としてO(2)のオーダーを持つ
;samples
(define sample-tree-1
(make-tree 7
(make-tree 3
(make-tree 1
'()
'())
(make-tree 5
'()
'()))
(make-tree 9
'()
(make-tree 11
'()
'()))))
;Exercise 2.65
(define (intersection-set set1 set2)
)
(define (union-set set1 set2)
)
| false |
3610ac9ee8c5aa19e4ce327b34ad3d003f59a3e6
|
222b42ba803bfecd4ec31166dd2be107a840f2bd
|
/undone/unsorted/src/src/use-iterative.scm
|
5de7d974477ad62efc39d9a0b8aacb1cf5942122
|
[] |
no_license
|
ab3250/ablib
|
83512c2c2cadd0eb49ad534548c058e3ed119d4c
|
887c8661ce99e8edfe89bcf707400e55c3943dd4
|
refs/heads/master
| 2023-06-12T13:36:49.487467 | 2021-07-11T13:29:45 | 2021-07-11T13:29:45 | 384,955,137 | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 882 |
scm
|
use-iterative.scm
|
;;;;
;;;; Using the iterative improvement methods
;;;;
;;;
;;; Some good-enough criteria
;;;
(define abs-good-enough?
(make-absolute-good-enough 0.001))
(define rel-good-enough?
(make-relative-good-enough 0.001))
;;;
;;; Some functions
;;;
(define (square x) (* x x))
(define (x2+3x-4 x)
(+ (square x)
(* 3 x)
-4))
(define (sincos x)
(sin (cos x)))
(newton x2+3x-4 0 0.001 abs-good-enough?)
(newton sincos 0 0.001 abs-good-enough?)
(secant x2+3x-4 0 1 abs-good-enough?)
(secant sincos 0 1 abs-good-enough?)
(newton x2+3x-4 0 0.001 rel-good-enough?)
(newton sincos 0 0.001 rel-good-enough?)
(secant x2+3x-4 0 1 rel-good-enough?)
(secant sincos 0 1 rel-good-enough?)
;;;
;;; Computing square root with newton
;;;
(define (my-sqrt x)
(newton (lambda (y) (- (square y) x))
1
0.001
rel-good-enough?))
(my-sqrt 2)
(my-sqrt 100)
(my-sqrt 10000)
| false |
e95428164e9dc8a5fcd215ebc86a4dded0d51b6b
|
eb32c279a34737c769d4e2c498a62c761750aeb5
|
/test/test-sexpr-builder.scm
|
a80acf2ed7216b058aeb58a4068dd3197a382486
|
[
"Apache-2.0"
] |
permissive
|
theschemer/lyonesse
|
baaf340be710f68b84c1969befc6ddbd2be3739b
|
9d9624e3141ea3acaa670526cbe52c2d6546beef
|
refs/heads/master
| 2021-06-10T02:58:28.040995 | 2016-11-29T21:28:11 | 2016-11-29T21:28:11 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,418 |
scm
|
test-sexpr-builder.scm
|
(import (rnrs (6))
(prefix (lyonesse testing) test:)
(lyonesse functional)
(lyonesse parsing ast-builder simple))
(test:unit "simple sexpr builder"
()
(test:that "correct values are returned"
(equal? (pipe (sb:start) sb:close) '())
(equal? (sb:close ((sb:add 4) ((sb:add 5) (sb:start))))
'(5 4))
(equal? (pipe (sb:start)
(sb:add 1)
sb:new-list
(sb:add 2)
(sb:add 3)
sb:close
(sb:add 4)
sb:close)
'(1 (2 3) 4))
(equal? (pipe (sb:start)
sb:new-string
(sb:add #\h)
(sb:add #\e)
(sb:add #\l)
(sb:add #\l)
(sb:add #\o)
sb:close sb:close)
'("hello"))
(equal? (pipe (sb:start)
sb:new-symbol
(sb:add #\l)
(sb:add #\a)
(sb:add #\m)
(sb:add #\b)
(sb:add #\d)
(sb:add #\a)
sb:close sb:close)
'(lambda))
(= 7.89 (car (pipe (sb:start)
sb:new-datum
(sb:add #\7)
(sb:add #\.)
(sb:add #\8)
(sb:add #\9)
sb:close sb:close)))
))
| false |
07f4cab2822e38211546f0c12981c6a93eb9d0a5
|
b14c18fa7a4067706bd19df10f846fce5a24c169
|
/Chapter2/2.21.scm
|
a0ed0150041773a646c49b20ed76582019f551b5
|
[] |
no_license
|
silvesthu/LearningSICP
|
eceed6267c349ff143506b28cf27c8be07e28ee9
|
b5738f7a22c9e7967a1c8f0b1b9a180210051397
|
refs/heads/master
| 2021-01-17T00:30:29.035210 | 2016-11-29T17:57:16 | 2016-11-29T17:57:16 | 19,287,764 | 3 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 348 |
scm
|
2.21.scm
|
#lang scheme
(map (lambda (x) (* x x)) (list 1 2 3 4 5))
(map abs (list 1 2 -3 4 -5))
(define (square-list items)
(if (null? items)
items
(cons (* (car items) (car items)) (square-list (cdr items)))
)
)
(square-list (list 1 2 3 4 5))
(define (square-list-map items)
(map (lambda (x) (* x x)) items)
)
(square-list-map (list 1 2 3 4 5))
| false |
03234ed04827d4aae632a9492c63b021495f9daf
|
f3ceafd261309c36d3f7ec0addcfe3c3861e3be9
|
/tests/test-helpers-await.ss
|
e82d8b05825f6e38e162a68e2877abe1df0c4200
|
[
"Apache-2.0",
"MIT"
] |
permissive
|
ChrisVine/chez-a-sync
|
f9fce07b643555c7e9d0f8aa9e49b93a366af88e
|
3015b0d3c3ca50dbde804c609ffd6b9398065299
|
refs/heads/master
| 2022-03-16T06:18:37.667095 | 2022-03-14T10:46:10 | 2022-03-14T10:46:10 | 60,371,285 | 46 | 10 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 32,661 |
ss
|
test-helpers-await.ss
|
;; Copyright (C) 2016 Chris Vine
;;
;; This file is licensed under the Apache License, Version 2.0 (the
;; "License"); you may not use this file except in compliance with the
;; License. You may obtain a copy of the License at
;;
;; http://www.apache.org/licenses/LICENSE-2.0
;;
;; Unless required by applicable law or agreed to in writing, software
;; distributed under the License is distributed on an "AS IS" BASIS,
;; WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
;; implied. See the License for the specific language governing
;; permissions and limitations under the License.
(import (a-sync coroutines)
(a-sync event-loop)
(a-sync compose)
(a-sync try)
(chezscheme))
;; helpers
(define-syntax test-result
(syntax-rules ()
[(_ expected res)
(assert (eqv? expected res))]))
(define print-result
((lambda ()
(define count 1)
(lambda ()
(format #t "~a: Test ~a OK\n" "test-helpers-await.ss" count)
(set! count (1+ count))))))
;; bv1 must be smaller than or equal to bv2 to obtain a #t result
(define (test-bytevector bv1 bv2)
(if (> (bytevector-length bv1) (bytevector-length bv2))
#f
(let ([sz (bytevector-length bv1)])
(call/cc (lambda (k)
(let loop ([index 0])
(cond
[(= index sz)
#t]
[(= (bytevector-s8-ref bv1 index)
(bytevector-s8-ref bv2 index))
(loop (+ index 1))]
[(k #f)])))))))
;; Test 1: await-task!
(define main-loop (make-event-loop))
(a-sync (lambda (await resume)
(let ((res
(await-task! await resume main-loop
(lambda ()
(+ 5 10)))))
(test-result 15 res)
(print-result))))
(event-loop-run! main-loop)
;; Test 2: await-task-in-thread! without handler
(event-loop-block! #t main-loop)
(a-sync (lambda (await resume)
(let ((res
(await-task-in-thread! await resume main-loop
(lambda ()
(+ 5 10)))))
(test-result 15 res)
(print-result)
;; we can apply event-loop-quit! here as we know the loop is running
(event-loop-quit! main-loop))))
(event-loop-run! main-loop)
;; Test 3: await-task-in-thread! with handler
(a-sync (lambda (await resume)
(let ((res
(await-task-in-thread!
await resume main-loop
(lambda () (raise 'test-exception))
(lambda (c)
(test-result 'test-exception c)
5))))
(test-result 5 res)
(print-result)
;; we can apply event-loop-quit! here as we know the loop is running
(event-loop-quit! main-loop))))
(event-loop-run! main-loop)
;; Test 4: await-task-in-event-loop!
(let ()
(define worker (make-event-loop 10 100000))
(event-loop-block! #t main-loop)
(event-loop-block! #t worker)
(fork-thread
(lambda ()
(event-loop-run! worker)))
(a-sync (lambda (await resume)
(let ([res
(await-task-in-event-loop! await resume main-loop worker
(lambda ()
(+ 5 10)))])
(test-result 15 res)
(print-result)
(event-loop-block! #f main-loop)
(event-loop-block! #f worker))))
(event-loop-run! main-loop))
;; Test 5: await-yield!
(let ()
(define val 0)
(a-sync (lambda (await resume)
(await-yield! await resume main-loop)
(test-result 1 val)
(print-result)))
(set! val 1)
(event-loop-run! main-loop))
;; Test 6: await-generator!
(let ()
(define lst '())
(a-sync (lambda (await resume)
(await-generator! await resume main-loop
(lambda (yield)
(let loop ([count 0])
(when (< count 5)
(yield (* 2 count))
(loop (+ count 1)))))
(lambda (val)
(set! lst (cons val lst))))
(test-result (car lst) 8)
(test-result (length lst) 5)
(print-result)))
(event-loop-run! main-loop))
;; Test 7: await-generator-in-thread! without handler
(let ()
(define lst '())
(event-loop-block! #t main-loop)
(a-sync (lambda (await resume)
(let ([res
(await-generator-in-thread! await resume main-loop
(lambda (yield)
(let loop ([count 0])
(when (< count 5)
(yield (* 2 count))
(loop (+ count 1)))))
(lambda (val)
(set! lst (cons val lst))))])
(test-result (car lst) 8)
(test-result (length lst) 5)
(test-result res #f)
(print-result)
(event-loop-block! #f main-loop))))
(event-loop-run! main-loop))
;; Test 8: await-generator-in-thread! with handler
(let ()
(define lst '())
(event-loop-block! #t main-loop)
(a-sync (lambda (await resume)
(let ([res
(await-generator-in-thread! await resume main-loop
(lambda (yield)
(let loop ([count 0])
(cond
[(< count 5)
(yield (* 2 count))
(loop (+ count 1))]
[(= count 5)
(raise 'my-exception)
;; we never reach here
(yield (* 2 count))
(loop (+ count 1))]
[else
(assert #f)]))) ;; we should never reach here
(lambda (val)
(set! lst (cons val lst)))
(lambda (c)
(test-result c 'my-exception)
(set! lst (cons 100 lst))))])
(test-result (car lst) 100)
(test-result (length lst) 6)
(test-result res 'chez-a-sync-thread-error)
(print-result)
(event-loop-block! #f main-loop))))
(event-loop-run! main-loop))
;; Test 9: await-generator-in-event-loop!
(let ()
(define lst '())
(define worker (make-event-loop 10 100000))
(event-loop-block! #t main-loop)
(event-loop-block! #t worker)
(fork-thread
(lambda ()
(event-loop-run! worker)))
(a-sync (lambda (await resume)
(await-generator-in-event-loop! await resume main-loop worker
(lambda (yield)
(let loop ([count 0])
(when (< count 5)
(yield (* 2 count))
(loop (+ count 1)))))
(lambda (val)
(set! lst (cons val lst))))
(test-result (car lst) 8)
(test-result (length lst) 5)
(print-result)
(event-loop-block! #f main-loop)))
(event-loop-run! main-loop))
;; Test 10: await-timeout!
(a-sync (lambda (await resume)
(let ((res
(await-timeout! await resume main-loop 10
(lambda ()
(+ 5 10)))))
(test-result 15 res)
(print-result))))
(event-loop-run! main-loop)
;; Test 11: await-sleep!
(let ()
(define val 0)
(a-sync (lambda (await resume)
(await-sleep! await resume main-loop 100)
(test-result 1 val)
(print-result)))
(set! val 1)
(event-loop-run! main-loop))
;; Test 12: await-getline! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(a-sync (lambda (await resume)
(let ((res (await-getline! await resume
main-loop
in)))
(assert (string=? res "test-string"))
(print-result))))
(put-string out "test-string")
(newline out)
(flush-output-port out)
(event-loop-run! main-loop)
(close-port out)
(close-port in))
;; Test 13: await-geteveryline! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(define count 0)
(a-sync (lambda (await resume)
(let ((res (await-geteveryline! await resume
main-loop
in
(lambda (line)
(set! count (1+ count))
(when (= count 1)
(assert (string=? line "test-string1")))
(when (= count 2)
(assert (string=? line "test-string2"))
(close-port out))))))
(assert (eof-object? res))
(test-result 2 count)
(print-result))))
(put-string out "test-string1")
(newline out)
(put-string out "test-string2")
(newline out)
(flush-output-port out)
(event-loop-run! main-loop)
(close-port in))
;; Test 14: await-getsomelines! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(define count 0)
(a-sync (lambda (await resume)
(let ((res (await-getsomelines! await resume
main-loop
in
(lambda (line k)
(set! count (1+ count))
(when (= count 1)
(assert (string=? line "test-string1")))
(when (= count 2)
(assert (string=? line "test-string2")))
(when (= count 3)
(assert (string=? line "test-string3"))
(k 'exit-await))))))
(assert (eq? res 'exit-await))
(test-result 3 count)
(print-result))))
(put-string out "test-string1")
(newline out)
(put-string out "test-string2")
(newline out)
(put-string out "test-string3")
(newline out)
(flush-output-port out)
(event-loop-run! main-loop)
(close-port out)
(close-port in))
;; Test 15: await-getsomelines! exception handling (also tests strategy for await-geteveryline!)
;; exception propagates out of event-loop-run!
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(define count 0)
(a-sync (lambda (await resume)
(await-getsomelines! await resume
main-loop
in
(lambda (line k)
(set! count (1+ count))
(when (= count 1)
(assert (string=? line "test-string1")))
(when (= count 2)
(raise 'exit-exception))
(when (= count 3)
(assert #f)))) ;; we should never reach here
(assert #f))) ;; we should never reach here
(put-string out "test-string1")
(newline out)
(put-string out "test-string2")
(newline out)
(put-string out "test-string3")
(newline out)
(flush-output-port out)
(try
(event-loop-run! main-loop)
(assert #f) ;; we should never reach here
(except c
[else
(assert (eq? c 'exit-exception))]))
(close-port out)
(close-port in)
(test-result 2 count)
(print-result))
;; Test 16: await-getsomelines! exception handling (also tests 'try' and strategy for await-geteveryline!)
;; exception caught within a-sync block
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(define count 0)
(a-sync (lambda (await resume)
(try
(await-getsomelines! await resume
main-loop
in
(lambda (line k)
(set! count (1+ count))
(when (= count 1)
(assert (string=? line "test-string1")))
(when (= count 2)
(raise 'exit-exception))
(when (= count 3)
(assert #f)))) ;; we should never reach here
(assert #f) ;; we should never reach here
(except c
[else
(assert (eq? c 'exit-exception))]))))
(put-string out "test-string1")
(newline out)
(put-string out "test-string2")
(newline out)
(put-string out "test-string3")
(newline out)
(flush-output-port out)
(event-loop-run! main-loop)
(close-port out)
(close-port in)
(test-result 2 count)
(print-result))
;; Test 17: await-getblock! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block))])
(define bv1 (make-bytevector 10 20))
(define bv2 (make-bytevector 10 21))
(a-sync (lambda (await resume)
(let ([res (await-getblock! await resume
main-loop
in
10)])
(test-result 10 (cdr res))
(assert (test-bytevector bv1 (car res))))
(let ([res (await-getblock! await resume
main-loop
in
20)])
(test-result 10 (cdr res))
(test-result 20 (bytevector-length (car res)))
(assert (test-bytevector bv2 (car res))))
(let ([res (await-getblock! await resume
main-loop
in
10)])
(assert (eof-object? (car res)))
(test-result #f (cdr res)))
(print-result)))
(a-sync (lambda (await resume)
(await-timeout! await resume main-loop 50 (lambda () #f))
(put-bytevector out bv1)
(flush-output-port out)
(await-timeout! await resume main-loop 50 (lambda () #f))
(put-bytevector out bv2)
(flush-output-port out)
(close-port out)))
(event-loop-run! main-loop)
(close-port in))
;; Test 18: await-geteveryblock! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block))])
(define bv1 (make-bytevector 10 20))
(define bv2 (make-bytevector 10 21))
(define bv3 (make-bytevector 10 22))
(define count 0)
(a-sync (lambda (await resume)
(let ([res (await-geteveryblock! await resume
main-loop
in
20
(lambda (bv-in len)
(set! count (1+ count))
(when (= count 1)
(test-result 20 len)
(assert (test-bytevector bv1 bv-in)))
(when (= count 2)
(test-result 10 len)
(assert (test-bytevector bv3 bv-in)))))])
(assert (eof-object? res)))
(let ([res (await-geteveryblock! await resume
main-loop
in
10
(lambda (bv-in len)
(assert #f)))]) ;; we should never reach here
(assert (eof-object? res)))
(print-result)))
(a-sync (lambda (await resume)
(await-timeout! await resume main-loop 50 (lambda () #f))
(put-bytevector out bv1)
(flush-output-port out)
(await-timeout! await resume main-loop 50 (lambda () #f))
(put-bytevector out bv2)
(flush-output-port out)
(await-timeout! await resume main-loop 50 (lambda () #f))
(put-bytevector out bv3)
(flush-output-port out)
(close-port out)))
(event-loop-run! main-loop)
(test-result 2 count)
(close-port in))
;; Test 19: await-getsomeblocks! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block))])
(define bv1 (make-bytevector 10 20))
(define bv2 (make-bytevector 10 21))
(define bv3 (make-bytevector 10 22))
(define count 0)
(a-sync (lambda (await resume)
(let ([res (await-getsomeblocks! await resume
main-loop
in
10
(lambda (bv-in len k)
(set! count (1+ count))
(when (= count 1)
(test-result 10 len)
(assert (test-bytevector bv1 bv-in)))
(when (= count 2)
(test-result 10 len)
(assert (test-bytevector bv2 bv-in))
(k 'test))))])
(test-result 'test res))
(let ([res (await-getsomeblocks! await resume
main-loop
in
20
(lambda (bv-in len k)
(test-result 10 len)
(test-result (bytevector-s8-ref bv-in 0) 22)
(assert (test-bytevector bv3 bv-in))))])
(assert (eof-object? res)))
(let ([res (await-getsomeblocks! await resume
main-loop
in
10
(lambda (bv-in len k)
(assert #f)))]) ;; we should never reach here
(assert (eof-object? res)))
(print-result)))
(a-sync (lambda (await resume)
(await-timeout! await resume main-loop 50 (lambda () #f))
(put-bytevector out bv1)
(flush-output-port out)
(await-timeout! await resume main-loop 50 (lambda () #f))
(put-bytevector out bv2)
(flush-output-port out)
(await-timeout! await resume main-loop 50 (lambda () #f))
(put-bytevector out bv3)
(flush-output-port out)
(close-port out)))
(event-loop-run! main-loop)
(test-result 2 count)
(close-port in))
;; Test 20: await-put-string! (also tests a-sync-write-watch! and await-put-bytevector!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode none)
(make-transcoder (latin-1-codec)))])
(define res #f)
(set-port-nonblocking! out #t)
(event-loop-block! #t main-loop)
(a-sync (lambda (await resume)
(a-sync (lambda (await resume)
(set! res (await-task-in-thread! await resume main-loop
(lambda ()
(get-string-all in))))
(event-loop-block! #f main-loop)))
(await-put-string! await resume main-loop out (string #\a #\b #\c))
(close-port out)))
(event-loop-run! main-loop)
(test-result (string-length res) 3)
(test-result (string-ref res 0) #\a)
(test-result (string-ref res 1) #\b)
(test-result (string-ref res 2) #\c)
(close-port in)
(print-result))
;; Test 21: compose-a-sync and no-await
(event-loop-block! #t main-loop)
(compose-a-sync main-loop ((res (await-task-in-thread! (lambda ()
(+ 5 10)))))
((no-await (test-result 15 res)
(print-result)
;; we can apply event-loop-quit! here as we know the loop is running
(event-loop-quit! main-loop))))
(event-loop-run! main-loop)
;;;;;;;;;; now the same tests with a default event loop ;;;;;;;;;;
(event-loop-block! #f main-loop)
(set-default-event-loop! main-loop)
;; Test 22: await-task!
(a-sync (lambda (await resume)
(let ((res
(await-task! await resume
(lambda ()
(+ 5 10)))))
(test-result 15 res)
(print-result))))
(event-loop-run!)
;; Test 23: await-task-in-thread! without handler
;; set a new default event loop
(set-default-event-loop!)
(event-loop-block! #t)
(a-sync (lambda (await resume)
(let ((res
(await-task-in-thread! await resume
(lambda ()
(+ 5 10)))))
(test-result 15 res)
(print-result)
;; we can apply event-loop-quit! here as we know the loop is running
(event-loop-quit!))))
(event-loop-run!)
;; Test 24: await-task-in-thread! without handler (explicit loop argument)
(a-sync (lambda (await resume)
(let ((res
(await-task-in-thread! await resume #f
(lambda ()
(+ 5 10)))))
(test-result 15 res)
(print-result)
;; we can apply event-loop-quit! here as we know the loop is running
(event-loop-quit!))))
(event-loop-run!)
;; Test 25: await-task-in-thread! with handler
(a-sync (lambda (await resume)
(let ((res
(await-task-in-thread!
await resume
(lambda () (raise 'test-exception))
(lambda (c)
(test-result 'test-exception c)
5))))
(test-result 5 res)
(print-result)
;; we can apply event-loop-quit! here as we know the loop is running
(event-loop-quit!))))
(event-loop-run!)
;; Test 26: await-task-in-event-loop!
(let ()
(define worker (make-event-loop 10 100000))
(event-loop-block! #t)
(event-loop-block! #t worker)
(fork-thread
(lambda ()
(event-loop-run! worker)))
(a-sync (lambda (await resume)
(let ([res
(await-task-in-event-loop! await resume worker
(lambda ()
(+ 5 10)))])
(test-result 15 res)
(print-result)
(event-loop-block! #f)
(event-loop-block! #f worker))))
(event-loop-run!))
;; Test 27: await-yield!
(let ()
(define val 0)
(a-sync (lambda (await resume)
(await-yield! await resume)
(test-result 1 val)
(print-result)))
(set! val 1)
(event-loop-run!))
;; Test 28: await-generator!
(let ()
(define lst '())
(a-sync (lambda (await resume)
(await-generator! await resume
(lambda (yield)
(let loop ([count 0])
(when (< count 5)
(yield (* 2 count))
(loop (+ count 1)))))
(lambda (val)
(set! lst (cons val lst))))
(test-result (car lst) 8)
(test-result (length lst) 5)
(print-result)))
(event-loop-run!))
;; Test 29: await-generator-in-thread! without handler
(let ()
(define lst '())
(event-loop-block! #t)
(a-sync (lambda (await resume)
(let ([res
(await-generator-in-thread! await resume
(lambda (yield)
(let loop ([count 0])
(when (< count 5)
(yield (* 2 count))
(loop (+ count 1)))))
(lambda (val)
(set! lst (cons val lst))))])
(test-result (car lst) 8)
(test-result (length lst) 5)
(test-result res #f)
(print-result)
(event-loop-block! #f))))
(event-loop-run!))
;; Test 30: await-generator-in-thread! without handler (explicit loop argument)
(let ()
(define lst '())
(event-loop-block! #t)
(a-sync (lambda (await resume)
(let ([res
(await-generator-in-thread! await resume #f
(lambda (yield)
(let loop ([count 0])
(when (< count 5)
(yield (* 2 count))
(loop (+ count 1)))))
(lambda (val)
(set! lst (cons val lst))))])
(test-result (car lst) 8)
(test-result (length lst) 5)
(test-result res #f)
(print-result)
(event-loop-block! #f))))
(event-loop-run!))
;; Test 31: await-generator-in-thread! with handler
(let ()
(define lst '())
(event-loop-block! #t)
(a-sync (lambda (await resume)
(let ([res
(await-generator-in-thread! await resume
(lambda (yield)
(let loop ([count 0])
(cond
[(< count 5)
(yield (* 2 count))
(loop (+ count 1))]
[(= count 5)
(raise 'my-exception)
;; we never reach here
(yield (* 2 count))
(loop (+ count 1))]
[else
(assert #f)]))) ;; we should never reach here
(lambda (val)
(set! lst (cons val lst)))
(lambda (c)
(test-result c 'my-exception)
(set! lst (cons 100 lst))))])
(test-result (car lst) 100)
(test-result (length lst) 6)
(test-result res 'chez-a-sync-thread-error)
(print-result)
(event-loop-block! #f))))
(event-loop-run!))
;; Test 32: await-generator-in-event-loop!
(let ()
(define lst '())
(define worker (make-event-loop 10 100000))
(event-loop-block! #t)
(event-loop-block! #t worker)
(fork-thread
(lambda ()
(event-loop-run! worker)))
(a-sync (lambda (await resume)
(await-generator-in-event-loop! await resume worker
(lambda (yield)
(let loop ([count 0])
(when (< count 5)
(yield (* 2 count))
(loop (+ count 1)))))
(lambda (val)
(set! lst (cons val lst))))
(test-result (car lst) 8)
(test-result (length lst) 5)
(print-result)
(event-loop-block! #f)))
(event-loop-run!))
;; Test 33: await-timeout!
(a-sync (lambda (await resume)
(let ((res
(await-timeout! await resume 10
(lambda ()
(+ 5 10)))))
(test-result 15 res)
(print-result))))
(event-loop-run!)
;; Test 34: await-sleep!
(let ()
(define val 0)
(a-sync (lambda (await resume)
(await-sleep! await resume 100)
(test-result 1 val)
(print-result)))
(set! val 1)
(event-loop-run! main-loop))
;; Test 35: await-getline! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(a-sync (lambda (await resume)
(let ((res (await-getline! await resume
in)))
(assert (string=? res "test-string"))
(print-result))))
(put-string out "test-string")
(newline out)
(flush-output-port out)
(event-loop-run!)
(close-port out)
(close-port in))
;; Test 36: await-geteveryline! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(define count 0)
(a-sync (lambda (await resume)
(let ((res (await-geteveryline! await resume
in
(lambda (line)
(set! count (1+ count))
(when (= count 1)
(assert (string=? line "test-string1")))
(when (= count 2)
(assert (string=? line "test-string2"))
(close-port out))))))
(assert (eof-object? res))
(test-result 2 count)
(print-result))))
(put-string out "test-string1")
(newline out)
(put-string out "test-string2")
(newline out)
(flush-output-port out)
(event-loop-run!)
(close-port in))
;; Test 37: await-getsomelines! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(define count 0)
(a-sync (lambda (await resume)
(let ((res (await-getsomelines! await resume
in
(lambda (line k)
(set! count (1+ count))
(when (= count 1)
(assert (string=? line "test-string1")))
(when (= count 2)
(assert (string=? line "test-string2")))
(when (= count 3)
(assert (string=? line "test-string3"))
(k 'exit-await))))))
(assert (eq? res 'exit-await))
(test-result 3 count)
(print-result))))
(put-string out "test-string1")
(newline out)
(put-string out "test-string2")
(newline out)
(put-string out "test-string3")
(newline out)
(flush-output-port out)
(event-loop-run!)
(close-port out)
(close-port in))
;; Test 38: await-getsomelines! exception handling (also tests strategy for await-geteveryline!)
;; exception propagates out of event-loop-run!
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(define count 0)
(a-sync (lambda (await resume)
(await-getsomelines! await resume
in
(lambda (line k)
(set! count (1+ count))
(when (= count 1)
(assert (string=? line "test-string1")))
(when (= count 2)
(raise 'exit-exception))
(when (= count 3)
(assert #f)))) ;; we should never reach here
(assert #f))) ;; we should never reach here
(put-string out "test-string1")
(newline out)
(put-string out "test-string2")
(newline out)
(put-string out "test-string3")
(newline out)
(flush-output-port out)
(try
(event-loop-run!)
(assert #f) ;; we should never reach here
(except c
[else
(assert (eq? c 'exit-exception))]))
(close-port out)
(close-port in)
(test-result 2 count)
(print-result))
;; Test 39: await-getsomelines! exception handling (also tests 'try' and strategy for await-geteveryline!)
;; exception caught within a-sync block
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block)
(make-transcoder (latin-1-codec)))])
(define count 0)
(a-sync (lambda (await resume)
(try
(await-getsomelines! await resume
in
(lambda (line k)
(set! count (1+ count))
(when (= count 1)
(assert (string=? line "test-string1")))
(when (= count 2)
(raise 'exit-exception))
(when (= count 3)
(assert #f)))) ;; we should never reach here
(assert #f) ;; we should never reach here
(except c
[else
(assert (eq? c 'exit-exception))]))))
(put-string out "test-string1")
(newline out)
(put-string out "test-string2")
(newline out)
(put-string out "test-string3")
(newline out)
(flush-output-port out)
(event-loop-run!)
(close-port out)
(close-port in)
(test-result 2 count)
(print-result))
;; Test 40: await-getblock! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block))])
(define bv1 (make-bytevector 10 20))
(define bv2 (make-bytevector 10 21))
(a-sync (lambda (await resume)
(let ([res (await-getblock! await resume
in
10)])
(test-result 10 (cdr res))
(assert (test-bytevector bv1 (car res))))
(let ([res (await-getblock! await resume
in
20)])
(test-result 10 (cdr res))
(test-result 20 (bytevector-length (car res)))
(assert (test-bytevector bv2 (car res))))
(let ([res (await-getblock! await resume
in
10)])
(assert (eof-object? (car res)))
(test-result #f (cdr res)))
(print-result)))
(a-sync (lambda (await resume)
(await-timeout! await resume 50 (lambda () #f))
(put-bytevector out bv1)
(flush-output-port out)
(await-timeout! await resume 50 (lambda () #f))
(put-bytevector out bv2)
(flush-output-port out)
(close-port out)))
(event-loop-run!)
(close-port in))
;; Test 41: await-geteveryblock! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block))])
(define bv1 (make-bytevector 10 20))
(define bv2 (make-bytevector 10 21))
(define bv3 (make-bytevector 10 22))
(define count 0)
(a-sync (lambda (await resume)
(let ([res (await-geteveryblock! await resume
in
20
(lambda (bv-in len)
(set! count (1+ count))
(when (= count 1)
(test-result 20 len)
(assert (test-bytevector bv1 bv-in)))
(when (= count 2)
(test-result 10 len)
(assert (test-bytevector bv3 bv-in)))))])
(assert (eof-object? res)))
(let ([res (await-geteveryblock! await resume
in
10
(lambda (bv-in len)
(assert #f)))]) ;; we should never reach here
(assert (eof-object? res)))
(print-result)))
(a-sync (lambda (await resume)
(await-timeout! await resume 50 (lambda () #f))
(put-bytevector out bv1)
(flush-output-port out)
(await-timeout! await resume 50 (lambda () #f))
(put-bytevector out bv2)
(flush-output-port out)
(await-timeout! await resume 50 (lambda () #f))
(put-bytevector out bv3)
(flush-output-port out)
(close-port out)))
(event-loop-run!)
(test-result 2 count)
(close-port in))
;; Test 42: await-getsomeblocks! (also tests a-sync-read-watch!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode block))])
(define bv1 (make-bytevector 10 20))
(define bv2 (make-bytevector 10 21))
(define bv3 (make-bytevector 10 22))
(define count 0)
(a-sync (lambda (await resume)
(let ([res (await-getsomeblocks! await resume
in
10
(lambda (bv-in len k)
(set! count (1+ count))
(when (= count 1)
(test-result 10 len)
(assert (test-bytevector bv1 bv-in)))
(when (= count 2)
(test-result 10 len)
(assert (test-bytevector bv2 bv-in))
(k 'test))))])
(test-result 'test res))
(let ([res (await-getsomeblocks! await resume
in
20
(lambda (bv-in len k)
(test-result 10 len)
(test-result (bytevector-s8-ref bv-in 0) 22)
(assert (test-bytevector bv3 bv-in))))])
(assert (eof-object? res)))
(let ([res (await-getsomeblocks! await resume
in
10
(lambda (bv-in len k)
(assert #f)))]) ;; we should never reach here
(assert (eof-object? res)))
(print-result)))
(a-sync (lambda (await resume)
(await-timeout! await resume 50 (lambda () #f))
(put-bytevector out bv1)
(flush-output-port out)
(await-timeout! await resume 50 (lambda () #f))
(put-bytevector out bv2)
(flush-output-port out)
(await-timeout! await resume 50 (lambda () #f))
(put-bytevector out bv3)
(flush-output-port out)
(close-port out)))
(event-loop-run!)
(test-result 2 count)
(close-port in))
;; Test 43: await-put-string! (also tests a-sync-write-watch! and await-put-bytevector!)
(let-values ([(in out) (make-pipe (buffer-mode block)
(buffer-mode none)
(make-transcoder (latin-1-codec)))])
(define res #f)
(set-port-nonblocking! out #t)
(event-loop-block! #t)
(a-sync (lambda (await resume)
(a-sync (lambda (await resume)
(set! res (await-task-in-thread! await resume
(lambda ()
(get-string-all in))))
(event-loop-block! #f)))
(await-put-string! await resume out (string #\a #\b #\c))
(close-port out)))
(event-loop-run!)
(test-result (string-length res) 3)
(test-result (string-ref res 0) #\a)
(test-result (string-ref res 1) #\b)
(test-result (string-ref res 2) #\c)
(close-port in)
(print-result))
;; Test 44: compose-a-sync and no-await
(event-loop-block! #t)
(compose-a-sync ((res (await-task-in-thread! (lambda ()
(+ 5 10)))))
((no-await (test-result 15 res)
(print-result)
;; we can apply event-loop-quit! here as we know the loop is running
(event-loop-quit!))))
(event-loop-run!)
| true |
2704cacc491e000302ad151941a1a40031bb561a
|
be32518c6f54b0ab1eaf33f53405ac1d2e1023c2
|
/np/lang/macros/test/partitioning/nonterminals/test-errors-extension-modification.ss
|
b4d83db3ade29e095f113eb86ba869cd8b1d4f53
|
[
"BSD-3-Clause",
"BSD-2-Clause"
] |
permissive
|
ilammy/np
|
7990302bc30fe7802a7f4fc33d8fa7449ef8b011
|
0e3cbdea0eb2583f9b272d97bc408011af6a7947
|
refs/heads/master
| 2016-09-05T17:11:03.893011 | 2015-06-13T16:37:39 | 2015-06-13T16:37:39 | 23,740,287 | 1 | 0 | null | 2015-06-13T16:39:43 | 2014-09-06T17:19:46 |
Scheme
|
UTF-8
|
Scheme
| false | false | 23,432 |
ss
|
test-errors-extension-modification.ss
|
(import (scheme base)
(np lang macros partitioning)
(np lang macros test utils)
(sr ck)
(sr ck kernel)
(te base)
(te conditions assertions)
(te utils verify-test-case))
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:invalid-syntax "Partitioning of extension nonterminal modification forms: invalid nonterminal syntax")
(define-test ("forbidden no modifications")
(assert-syntax-error ("Nonterminal modification should modify either meta-variables or productions" lang Nonterminal)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Nonterminal ()))) ) )) ) )
(define-test ("atom")
(assert-syntax-error ("Invalid syntax of the nonterminal modification" lang xyzzy)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! xyzzy)) ) )) ) )
(define-test ("clause")
(assert-syntax-error ("Invalid syntax of the nonterminal modification" lang (Number))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("Invalid syntax of the nonterminal modification" lang ())
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! ())) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Invalid syntax of the nonterminal modification" lang (Number . HA-HA!))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number . HA-HA!))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Invalid syntax of the nonterminal modification" lang #(Number ((+ x)) n))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! #(Number ((+ x)) n))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:invalid-syntax)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:meta-var-addition:names "Partitioning of extension nonterminal modification forms: meta variable addition names")
(define-test ("boolean")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num #t)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((+ #t))))) ) )) ) )
(define-test ("char")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num #\D)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((+ #\D))))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Number ())
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number ((+ ()))))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num (car . cdr))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((+ (car . cdr)))))) ) )) ) )
(define-test ("list")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Number (+ x))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number Number? ((+ (+ x)))))) ) )) ) )
(define-test ("number")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num 31)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((+ 31))))) ) )) ) )
(define-test ("string")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num "sky")
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((+ "sky"))))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num #(x))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((+ #(x)))))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:meta-var-addition:names)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:meta-var-addition:syntax "Partitioning of extension nonterminal modification forms: meta variable addition syntax")
(define-test ("atom")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Foo (+ . foo))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((+ . foo))))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("At least one meta-variable should be specified for addition" lang Foo (+))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((+))))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Foo (+ car . cdr))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((+ car . cdr))))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Foo (+ . #()))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((+ . #()))))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:meta-var-addition:syntax)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:meta-var-invalid-syntax "Partitioning of extension nonterminal modification forms: meta variable invalid syntax")
(define-test ("atom")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Pair atom)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair Pair? (atom (- x))))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Pair ())
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((- x) (+ y) ())))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Pair (y . z))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((+ x) (y . z))))) ) )) ) )
(define-test ("list")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Pair (random list))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((- x) (+ y) (random list))))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Pair #(z))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((- x) (+ y) #(z))))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:meta-var-invalid-syntax)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:meta-var-removal:names "Partitioning of extension nonterminal modification forms: meta variable removal names")
(define-test ("boolean")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num #f)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((- #f))))) ) )) ) )
(define-test ("char")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num #\e)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((- #\e))))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Number ())
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number ((- ()))))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Number (car . cdr))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number ((- (car . cdr)))))) ) )) ) )
(define-test ("list")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Number (+ x))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number ((- (+ x)))))) ) )) ) )
(define-test ("number")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num 0)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((- 0))))) ) )) ) )
(define-test ("string")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num "way")
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((- "way"))))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Name of the meta-variable must be an identifier" lang Num #(x))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Num ((- #(x)))))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:meta-var-removal:names)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:meta-var-removal:syntax "Partitioning of extension nonterminal modification forms: meta variable removal syntax")
(define-test ("atom")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Foo (- . foo))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((- . foo))))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("At least one meta-variable should be specified for removal" lang Foo (-))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((-))))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Foo (- car . cdr))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((- car . cdr))))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Invalid syntax of the meta-variable modification" lang Foo (- . #()))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((- . #()))))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:meta-var-removal:syntax)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:name "Partitioning of extension nonterminal modification forms: nonterminal names")
(define-test ("boolean")
(assert-syntax-error ("Name of the nonterminal must be an identifier" lang (#t ((+ vars))) #t)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (#t ((+ vars)) (+ prod)))) ) )) ) )
(define-test ("char")
(assert-syntax-error ("Name of the nonterminal must be an identifier" lang (#\f False? ((+ vars))) #\f)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (#\f False? ((+ vars)) (+ prod)))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("Name of the nonterminal must be an identifier" lang (() ()) ())
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (() ()))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Name of the nonterminal must be an identifier" lang ((a . d) ((+ x))) (a . d))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! ((a . d) ((+ x)) (+ n)))) ) )) ) )
(define-test ("list")
(assert-syntax-error ("Name of the nonterminal must be an identifier" lang ((awesome name) ()) (awesome name))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! ((awesome name) () (+ x)))) ) )) ) )
(define-test ("number")
(assert-syntax-error ("Name of the nonterminal must be an identifier" lang (9 ((+ vars))) 9)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (9 ((+ vars)) (+ prod)))) ) )) ) )
(define-test ("string")
(assert-syntax-error ("Name of the nonterminal must be an identifier" lang ("up" ((+ vars))) "up")
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! ("up" ((+ vars)) (+ prod)))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Name of the nonterminal must be an identifier" lang (#(9) ((+ vars))) #(9))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (#(9) ((+ vars)) (+ prod)))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:name)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:syntax "Partitioning of extension nonterminal modification forms: extension syntax")
(define-test ("atom")
(assert-syntax-error ("Invalid syntax of the nonterminal extension" lang (! . right-away))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! . right-away)) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("At least one nonterminal should be specified for modification" lang (!))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((!)) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Invalid syntax of the nonterminal extension" lang (! (Number ((+ x))) . random))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number ((+ x))) . random)) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Invalid syntax of the nonterminal extension" lang (! . #(Number () (+ p))))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! . #(Number () (+ p)))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:syntax)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:production-additional:syntax "Partitioning of extension nonterminal modification forms: productions addition syntax")
(define-test ("atom")
(assert-syntax-error ("Invalid syntax of the production modification" lang Foo (+ . atom))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo () (+ . atom)))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("At least one production should be specified for addition" lang Foo (+))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((+ x)) (+)))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Invalid syntax of the production modification" lang Foo (+ p . x))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo Foo? () (+ p . x)))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Invalid syntax of the production modification" lang Foo (+ . #()))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo () (+ . #())))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:production-additional:syntax)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:production-additional:vector "Partitioning of extension nonterminal modification forms: productions addition no-vector tests")
(define-test ("nested")
(assert-syntax-error ("Invalid syntax of the production: vector patterns are not allowed" lang Nonterminal (x #(p)) #(p))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Nonterminal () (+ (x #(p)))))) ) )) ) )
(define-test ("toplevel")
(assert-syntax-error ("Invalid syntax of the production: vector patterns are not allowed" lang Nonterminal #(p))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Nonterminal () (+ #(p))))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:production-additional:vector)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:production-removal:syntax "Partitioning of extension nonterminal modification forms: productions removal syntax")
(define-test ("atom")
(assert-syntax-error ("Invalid syntax of the production modification" lang Foo (- . atom))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo Foo? () (- . atom)))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("At least one production should be specified for removal" lang Foo (-))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo ((+ x)) (-)))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Invalid syntax of the production modification" lang Foo (- p . x))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo () (- p . x)))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Invalid syntax of the production modification" lang Foo (- . #()))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Foo () (- . #())))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:production-removal:syntax)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:production-removal:vector "Partitioning of extension nonterminal modification forms: productions removal no-vector tests")
(define-test ("nested")
(assert-syntax-error ("Invalid syntax of the production: vector patterns are not allowed" lang Nonterminal (x #(p)) #(p))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Nonterminal Nonterminal? () (- (x #(p)))))) ) )) ) )
(define-test ("toplevel")
(assert-syntax-error ("Invalid syntax of the production: vector patterns are not allowed" lang Nonterminal #(p))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Nonterminal () (- #(p))))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:production-removal:vector)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:production:syntax "Partitioning of extension nonterminal modification forms: productions extension syntax errors")
(define-test ("atom")
(assert-syntax-error ("Invalid syntax of the nonterminal modification" lang (Pair ((+ x)) . foo))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((+ x)) . foo))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Invalid syntax of the nonterminal modification" lang (Pair ((+ x)) (+ n (n n)) . foo))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((+ x)) (+ n (n n)) . foo))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Invalid syntax of the nonterminal modification" lang (Pair ((+ x)) . #(1 2 3)))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((+ x)) . #(1 2 3)))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:production:syntax)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:production:invalid "Partitioning of extension nonterminal modification forms: productions invalid syntax")
(define-test ("atom")
(assert-syntax-error ("Invalid syntax of the production modification" lang Pair production)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((+ x)) production))) ) )) ) )
(define-test ("empty list")
(assert-syntax-error ("Invalid syntax of the production modification" lang Pair ())
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair Pair? ((+ x)) ()))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Invalid syntax of the production modification" lang Pair (a . d))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((- x)) (a . d)))) ) )) ) )
(define-test ("list")
(assert-syntax-error ("Invalid syntax of the production modification" lang Pair (x y z))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((+ x)) (x y z)))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Invalid syntax of the production modification" lang Pair #(9))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Pair ((+ x)) #(9)))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:production:invalid)
; - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ;
(define-test-case (nonterminals:extension-modification:predicate "Partitioning of extension nonterminal modification forms: predicate rebinding")
(define-test ("boolean")
(assert-syntax-error ("Name of the nonterminal predicate must be an identifier" lang Number #f)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number #f ((+ x))))) ) )) ) )
(define-test ("char")
(assert-syntax-error ("Name of the nonterminal predicate must be an identifier" lang Number #\N)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number #\N))) ) )) ) )
(define-test ("irregular list")
(assert-syntax-error ("Name of the nonterminal predicate must be an identifier" lang Nonterminal ((- x) . foo))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Nonterminal ((- x) . foo)))) ) )) ) )
(define-test ("number")
(assert-syntax-error ("Name of the nonterminal predicate must be an identifier" lang Number 42)
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number 42))) ) )) ) )
(define-test ("string")
(assert-syntax-error ("Name of the nonterminal predicate must be an identifier" lang Number "gazillion")
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number "gazillion"))) ) )) ) )
(define-test ("vector")
(assert-syntax-error ("Name of the nonterminal predicate must be an identifier" lang Number #(9))
($ ($quote
($partition-extension-nonterminal-definitions 'lang
'((! (Number #(9) ((+ x))))) ) )) ) )
)
(verify-test-case! nonterminals:extension-modification:predicate)
| false |
d8db95cc8bdb51699082fec556f9bd66dc3f7482
|
e1fc47ba76cfc1881a5d096dc3d59ffe10d07be6
|
/ch4/4.33.scm
|
a03dd90c1dcae9e4e71d628588ba4ffaacc8cab8
|
[] |
no_license
|
lythesia/sicp-sol
|
e30918e1ebd799e479bae7e2a9bd4b4ed32ac075
|
169394cf3c3996d1865242a2a2773682f6f00a14
|
refs/heads/master
| 2021-01-18T14:31:34.469130 | 2019-10-08T03:34:36 | 2019-10-08T03:34:36 | 27,224,763 | 2 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 655 |
scm
|
4.33.scm
|
(define dont-run-now 1)
(include "4.02.03.full.scm")
(define old-eval eval)
(define (eval exp env)
(if (quoted? exp)
(text-of-quotation exp env)
(old-eval exp env)
)
)
(define (text-of-quotation exp env)
(let ((text (cadr exp)))
(if (pair? text)
(eval (make-list text) env)
text
)
)
)
(define (make-list exp)
(if (null? exp)
(list 'quote '())
; make `cons` struct for eval
; '(cons (quote <1st>) (cons (quote <2nd> ..)))
(list 'cons (list 'quote (car exp)) (make-list (cdr exp)))
)
)
(if (not (defined? 'dont-run-any))
(driver-loop)
)
; >> (list-ref integers 17) ; 18
; >> (car '(a b c)) ; a
| false |
562c89a813ad1e078869fda146d0aa414aae5603
|
ae0d7be8827e8983c926f48a5304c897dc32bbdc
|
/nekoie/misc/squid/goshredir.scm
|
d7e1e3ebad2cdaecf3ac403632d4234856c0a7a6
|
[] |
no_license
|
ayamada/copy-of-svn.tir.jp
|
96c2176a0295f60928d4911ce3daee0439d0e0f4
|
101cd00d595ee7bb96348df54f49707295e9e263
|
refs/heads/master
| 2020-04-04T01:03:07.637225 | 2015-05-28T07:00:18 | 2015-05-28T07:00:18 | 1,085,533 | 3 | 2 | null | 2015-05-28T07:00:18 | 2010-11-16T15:56:30 |
Scheme
|
EUC-JP
|
Scheme
| false | false | 5,493 |
scm
|
goshredir.scm
|
#!/usr/bin/env gosh
;;; coding: euc-jp
;;; -*- scheme -*-
;;; vim:set ft=scheme ts=8 sts=2 sw=2 et:
;;; $Id$
;;; 自分で書いたsquid用のリダイレクタスクリプト。
;;; usage :
;;; squid.confに以下のように設定する。
;;;
;;; redirect_program /path/to/gosh /path/to/goshredir.scm /path/to/configfile
;;;
;;; configfileの書式は次のようなS式を何行も書く。
;;; ("http://gs-alpha.tir.jp" "http://127.0.0.1:40000")
;;; ("http://gs-beta.tir.jp" "http://127.0.0.1:40001")
;;; configfileのどの行にもマッチしなかった場合、http://noexists を返す。
;;; 不正なリクエスト時にも、http://noexists を返す。
;;;
;;; 特徴 :
;;; - configfileが更新されると、自動的に再読み込みを行う。
;;; - configfileのパーズに失敗したら、そのまま直前の設定状態を再利用する。
;;; (squidのcache.logにパーズ失敗が記録される)
;;; note : リダイレクト設定の詳細については、以下のサイトが参考になる
;;; - http://squid.robata.org/faq_15.html
;;; ToDo : シグナル処理を行う事。
;;; ToDo : selectを使って、暇になったらファイルの更新チェックを行うようにする
(use gauche.charconv)
(use gauche.regexp)
(use srfi-2)
(use file.util)
(use text.tree)
(use util.list)
(define *debug* #f)
(define (usage self)
(format #t "usage : ~a configfile\n" self))
(define (ces-convert-*jp incomplete-string)
(with-error-handler
(lambda (e) #f)
(lambda ()
(ces-convert
incomplete-string
(ces-guess-from-string incomplete-string "*JP")))))
(define-syntax string-size-sort-maker
(syntax-rules ()
((_ comparison)
(lambda (target-list)
(sort
target-list
(lambda (x y)
(comparison (string-size x) (string-size y))))))))
(define string-size-sort
(string-size-sort-maker <))
(define string-size-reverse-sort
(string-size-sort-maker >))
;; 以下のようなregexpを生成する(※実際はちゃんとregexp-quoteする)
;; #/^(?i:(?:http://hoge.com/aaa)|(?:https://aaa.net:8443/)|(?:...))/
(define (list->re src-list)
(string->regexp
(tree->string
(list
"^(?i:(?:"
(intersperse
")|(?:"
(map
regexp-quote
(string-size-reverse-sort
src-list)))
"))"))))
(define (logging message . params)
(format
(current-error-port)
"~a : "
(sys-strftime "%Y/%m/%d %T %Z" (sys-localtime (sys-time))))
(apply
format
(current-error-port)
message
params)
(newline (current-error-port)))
;; procを返す。
;; configfileのパーズに失敗したらタイムスタンプ付きでエラーを出力して#fを返す
(define (make-redirector configfile . first-try)
(with-error-handler
(lambda (e)
(logging
"cannot parsed configfile '~a' ~a\n(~a)"
configfile
(if (null? first-try)
"(be used to old configuration)"
"!")
(ref e 'message))
(unless (null? first-try)
(exit 1))
#f)
(lambda ()
(let* ((src-alist (file->sexp-list configfile))
(re (list->re (map car src-alist)))
(ht (alist->hash-table src-alist 'string=?))
(proc (lambda (line)
(or
(and-let* ((str (if (string-incomplete? line)
(ces-convert-*jp line)
line))
(matched (re str))
(key (matched))
(conversion-list (ref ht key #f))
)
(string-append
(car conversion-list)
(matched 'after)))
;; マッチしなかった
"http://noexists"))) ; 強制的に403を出させる
)
(when (null? first-try)
(logging "configfile '~a' was updated. reload." configfile))
;; procを返す
(if (not *debug*)
proc
(lambda (line)
(logging "requested '~a'" line)
(let1 result (proc line)
(logging "responsed '~a'" result)
result)))))))
(define (goshredir-main configfile)
;; 最初に、configfileの存在チェックだけ行う
(unless (file-is-readable? configfile)
(errorf "cannot read configfile '~a'" configfile))
(let loop ((old-config-mtime (file-mtime configfile))
(old-redirector (make-redirector configfile 'first-try)))
(let* ((config-mtime (file-mtime configfile))
(redirector (if (= config-mtime old-config-mtime)
old-redirector
(or
(make-redirector configfile)
old-redirector))))
;; 実行開始
(let1 line (read-line (current-input-port) #t)
(unless (eof-object? line) ; eofなら終了
(print
(redirector line))
(loop config-mtime redirector))))))
(define (main args)
(if (not (= (length args) 2))
(begin
(usage (car args))
1)
(begin
(set! (port-buffering (current-output-port)) :line)
(set! (port-buffering (current-error-port)) :line)
(goshredir-main (cadr args))
0)))
| true |
531baf5c81864647502acb6ba08e91980df2d2f4
|
ecfd9ed1908bdc4b099f034b121f6e1fff7d7e22
|
/old1/sicp/3/p73.scm
|
753590919123ced0ca9d9349876bc3498f4a383f
|
[
"MIT"
] |
permissive
|
sKabYY/palestra
|
36d36fc3a03e69b411cba0bc2336c43b3550841c
|
06587df3c4d51961d928bd8dd64810c9da56abf4
|
refs/heads/master
| 2021-12-14T04:45:20.661697 | 2021-11-25T08:29:30 | 2021-11-25T08:29:30 | 12,856,067 | 6 | 3 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 489 |
scm
|
p73.scm
|
(load "stream.scm")
(define (integral integrand initial-value dt)
(define int
(cons
initial-value
(delay (add-streams (scale-stream integrand dt)
int))))
int)
(define (RC R C dt)
(define (cir v0 i)
(add-streams
(scale-stream i R)
(integral
(scale-stream i (/ 1.0 C))
v0
dt)))
cir)
(define RC1 (RC 5.0 1.0 0.5))
(define ones (cons 1 (delay ones)))
(stream-for-n
println
(RC1 5.0 ones)
10)
| false |
653b3708728c5ec1da4ce5ce25a770edc826cfa4
|
6b288a71553cf3d8701fe7179701d100c656a53c
|
/examples/socket.ss
|
6f3e7c04b918769a0de8ded6d17c8b37059c9419
|
[
"Apache-2.0"
] |
permissive
|
cisco/ChezScheme
|
03e2edb655f8f686630f31ba2574f47f29853b6f
|
c048ad8423791de4bf650fca00519d5c2059d66e
|
refs/heads/main
| 2023-08-26T16:11:15.338552 | 2023-08-25T14:17:54 | 2023-08-25T14:17:54 | 56,263,501 | 7,763 | 1,410 |
Apache-2.0
| 2023-08-28T22:45:52 | 2016-04-14T19:10:25 |
Scheme
|
UTF-8
|
Scheme
| false | false | 6,728 |
ss
|
socket.ss
|
;;; socket.ss
;;; R. Kent Dybvig May 1998
;;; Updated November 2005
;;; Updated by Jamie Taylor, Sept 2016
;;; Public Domain
;;;
;;; bindings for socket operations and other items useful for writing
;;; programs that use sockets.
;;; Requires csocket.so, built from csocket.c.
;;; Example compilation command line from macOS:
;;; cc -c csocket.c -o csocket.o
;;; cc csocket.o -dynamic -dynamiclib -current_version 1.0 -compatibility_version 1.0 -o csocket.so
(load-shared-object "./csocket.so")
;;; Requires from C library:
;;; close, dup, execl, fork, kill, listen, tmpnam, unlink
(case (machine-type)
[(i3le ti3le a6le ta6le) (load-shared-object "libc.so.6")]
[(i3osx ti3osx a6osx ta6osx) (load-shared-object "libc.dylib")]
[else (load-shared-object "libc.so")])
;;; basic C-library stuff
(define close
(foreign-procedure "close" (int)
int))
(define dup
(foreign-procedure "dup" (int)
int))
(define execl4
(let ((execl-help
(foreign-procedure "execl"
(string string string string void*)
int)))
(lambda (s1 s2 s3 s4)
(execl-help s1 s2 s3 s4 0))))
(define fork
(foreign-procedure "fork" ()
int))
(define kill
(foreign-procedure "kill" (int int)
int))
(define listen
(foreign-procedure "listen" (int int)
int))
(define tmpnam
(foreign-procedure "tmpnam" (void*)
string))
(define unlink
(foreign-procedure "unlink" (string)
int))
;;; routines defined in csocket.c
(define accept
(foreign-procedure "do_accept" (int)
int))
(define bytes-ready?
(foreign-procedure "bytes_ready" (int)
boolean))
(define bind
(foreign-procedure "do_bind" (int string)
int))
(define c-error
(foreign-procedure "get_error" ()
string))
(define c-read
(foreign-procedure "c_read" (int u8* size_t size_t)
ssize_t))
(define c-write
(foreign-procedure "c_write" (int u8* size_t ssize_t)
ssize_t))
(define connect
(foreign-procedure "do_connect" (int string)
int))
(define socket
(foreign-procedure "do_socket" ()
int))
;;; higher-level routines
(define dodup
; (dodup old new) closes old and dups new, then checks to
; make sure that resulting fd is the same as old
(lambda (old new)
(check 'close (close old))
(unless (= (dup new) old)
(error 'dodup
"couldn't set up child process io for fd ~s" old))))
(define dofork
; (dofork child parent) forks a child process and invokes child
; without arguments and parent with the child's pid
(lambda (child parent)
(let ([pid (fork)])
(cond
[(= pid 0) (child)]
[(> pid 0) (parent pid)]
[else (error 'fork (c-error))]))))
(define setup-server-socket
; create a socket, bind it to name, and listen for connections
(lambda (name)
(let ([sock (check 'socket (socket))])
(unlink name)
(check 'bind (bind sock name))
(check 'listen (listen sock 1))
sock)))
(define setup-client-socket
; create a socket and attempt to connect to server
(lambda (name)
(let ([sock (check 'socket (socket))])
(check 'connect (connect sock name))
sock)))
(define accept-socket
; accept a connection
(lambda (sock)
(check 'accept (accept sock))))
(define check
; signal an error if status x is negative, using c-error to
; obtain the operating-system's error message
(lambda (who x)
(if (< x 0)
(error who (c-error))
x)))
(define terminate-process
; kill the process identified by pid
(lambda (pid)
(define sigterm 15)
(kill pid sigterm)
(void)))
(define open-process
(lambda (command)
(define (make-r! socket)
(lambda (bv start n)
(check 'r! (c-read socket bv start n))))
(define (make-w! socket)
(lambda (bv start n)
(check 'w! (c-write socket bv start n))))
(define (make-close pid socket)
(lambda ()
(check 'close (close socket))
(terminate-process pid)))
(let* ([server-socket-name (tmpnam 0)]
[server-socket (setup-server-socket server-socket-name)])
(dofork
(lambda () ; child
(check 'close (close server-socket))
(let ([sock (setup-client-socket server-socket-name)])
(dodup 0 sock)
(dodup 1 sock))
(check 'execl (execl4 "/bin/sh" "/bin/sh" "-c" command))
(error 'open-process "subprocess exec failed"))
(lambda (pid) ; parent
(let ([sock (accept-socket server-socket)])
(check 'close (close server-socket))
(make-custom-binary-input/output-port command
(make-r! sock) (make-w! sock) #f #f (make-close pid sock))))))))
#!eof
;;; sample session using base socket functionality
> (define client-pid)
> (define client-socket)
> (let* ([server-socket-name (tmpnam 0)]
[server-socket (setup-server-socket server-socket-name)])
; fork a child, use it to exec a client Scheme process, and set
; up server-side client-pid and client-socket variables.
(dofork ; child
(lambda ()
; the child establishes the socket input/output fds as
; stdin and stdout, then starts a new Scheme session
(check 'close (close server-socket))
(let ([sock (setup-client-socket server-socket-name)])
(dodup 0 sock)
(dodup 1 sock))
(check 'execl (execl4 "/bin/sh" "/bin/sh" "-c" "exec scheme"))
(error 'client "returned!"))
(lambda (pid) ; parent
; the parent waits for a connection from the client
(set! client-pid pid)
(set! client-socket (accept-socket server-socket))
(check 'close (close server-socket)))))
> (define put ; procedure to send data to client
(lambda (x)
(let* ([s (format "~s~%" x)]
[bv (string->utf8 s)])
(c-write client-socket bv 0 (bytevector-length bv)))
(void)))
> (define get ; procedure to read data from client
(let ([buff (make-bytevector 1024)])
(lambda ()
(let* ([n (c-read client-socket buff 0 (bytevector-length buff))]
[bv (make-bytevector n)])
(bytevector-copy! buff 0 bv 0 n)
(printf "client:~%~a~%server:~%" (utf8->string bv))))))
> (get)
client:
Chez Scheme Version 9.5.1
Copyright 1984-2017 Cisco Systems, Inc.
>
server:
> (put '(let ((x 3)) x))
> (get)
client:
3
>
server:
> (terminate-process client-pid)
> (exit)
;;; sample session using process port
> (define p (transcoded-port (open-process "exec scheme -q") (native-transcoder)))
> (pretty-print '(+ 3 4) p)
> (read p)
7
> (pretty-print '(define (f x) (if (= x 0) 1 (* x (f (- x 1))))) p)
> (pretty-print '(f 10) p)
> (read p)
3628800
> (pretty-print '(exit) p)
> (read p)
#!eof
> (close-port p)
| false |
af9b25ea46bc8aaab26a5156c1678b11d5c551a4
|
c39b3eb88dbb1c159577149548d3d42a942fe344
|
/05-denotational-semantics/cps-transform.scm
|
d6567af4da23b7c6284d7190863ba03b226a1600
|
[] |
no_license
|
mbillingr/lisp-in-small-pieces
|
26694220205818a03efc4039e5a9e1ce7b67ff5c
|
dcb98bc847c803e65859e4a5c9801d752eb1f8fa
|
refs/heads/master
| 2022-06-17T20:46:30.461955 | 2022-06-08T17:50:46 | 2022-06-08T17:50:46 | 201,653,143 | 13 | 3 | null | 2022-06-08T17:50:47 | 2019-08-10T16:09:21 |
Scheme
|
UTF-8
|
Scheme
| false | false | 3,599 |
scm
|
cps-transform.scm
|
(import (builtin core)
(libs utils)
(libs book))
(define (cps e)
(if (atom? e)
(lambda (k) (k `,e))
(case (car e)
((quote) (cps-quote (cadr e)))
((if) (cps-if (cadr e) (caddr e) (cadddr e)))
((begin) (cps-begin (cdr e)))
((set!) (cps-set! (cadr e) (caddr e)))
((lambda) (cps-abstraction (cadr e) (caddr e)))
(else (cps-application e)))))
(define (cps-quote data)
(lambda (k)
(k `(quote ,data))))
(define (cps-set! variable form)
(lambda (k)
((cps form)
(lambda (a)
(k `(set! ,variable ,a))))))
(define (cps-if cond form1 form2)
(lambda (k)
((cps cond)
(lambda (c)
`(if ,c ,((cps form1) k)
,((cps form2) k))))))
(define (cps-begin e)
(if (pair? e)
(if (pair? (cdr e))
(let ((void (gensym "void")))
(lambda (k)
((cps (car e))
(lambda (b)
((cps-begin (cdr e))
(lambda (a)
(k `((lambda (,void) ,b) ,a))))))))
(cps (car e)))
(cps '())))
(define (cps-application e)
(lambda (k)
(if (memq (car e) primitives)
((cps-terms (cdr e))
(lambda (t*)
;(k `(,(car e) ,@t*))))
(k (cons (car e) t*))))
((cps-terms e)
(lambda (t*)
(let ((d (gensym)))
`(,(car t*) (lambda (,d) ,(k d))
. ,(cdr t*))))))))
(define primitives '(cons car cdr list * + - = pair? eq?))
(define (cps-terms e*)
(if (pair? e*)
(lambda (k)
((cps (car e*))
(lambda (a)
((cps-terms (cdr e*))
(lambda (a*)
(k (cons a a*)))))))
(lambda (k) (k '()))))
(define (cps-abstraction variables body)
(lambda (k)
(k (let ((c (gensym "cont")))
`(lambda (,c . ,variables)
,((cps body)
(lambda (a) `(,c ,a))))))))
(define (call/cc k f) (f k k))
(define fact-program
'(set! fact (lambda (n) (if (= n 1) 1 (* n (fact (- n 1)))))))
(define fact-cps ((cps fact-program) (lambda (x) x)))
(define source-foo '(lambda (exit) (begin (exit 42) 666)))
(define target-foo ((cps source-foo) (lambda (x) x)))
; The function foo is transformed to something like this:
'(set! foo
(lambda (cont2 exit)
(exit (lambda (sym4)
(cont2 ((lambda (void3) 666)
sym4)))
42)))
(define source-bar `(lambda () (call/cc ,source-foo)))
(define target-bar ((cps source-bar) (lambda (x) x)))
; bar becomes
'(lambda (cont5)
(call/cc (lambda (sym9) (cont5 sym9))
(lambda (cont6 exit)
(exit (lambda (sym8) (cont6 ((lambda (void7) sym8) 666)))
42))))
; which is equivalent to
'(lambda (cont5)
((lambda (cont6 exit)
(exit (lambda (sym8) (cont6 ((lambda (void7) sym8) 666)))
42))
(lambda (sym9) (cont5 sym9))
(lambda (sym9) (cont5 sym9))))
; and the same as this:
'(lambda (cont5)
((lambda (sym9) (cont5 sym9))
(lambda (sym8) ((lambda (sym9) (cont5 sym9)) ((lambda (void7) sym8) 666)))
42))
; here is a problem: (lambda (sym9) ... ) is invoked with two arguments.
; Apparent solution (inspired by http://matt.might.net/articles/cps-conversion/):
(define (call/cc k f) (f k (lambda (_ x) (k x))))
; This definition of call/cc wraps the continuation passed to f in a lambda
; form that takes two arguments but ignores the continuation passed as first
; argument.
; I wonder if this is an oversight in the book, or if I misunderstood something...
| false |
50d7f1deab358556dbee9da6ea701d5023f64f97
|
f9e4062f24473a22bc9161d86f05ed49ed4e8080
|
/readline/trunk/test.scm
|
314ac411edb3040705da70d31ce16b63659a41e2
|
[
"Apache-2.0"
] |
permissive
|
hwinslow3/eggs
|
20cee88b249c2daa10760df3e8ca9b9d868c5752
|
dab1ca2c51f90f4714866e74c3a7f3ebe4b62535
|
refs/heads/master
| 2020-03-24T09:40:12.201125 | 2017-11-04T00:20:11 | 2017-11-04T00:20:11 | null | 0 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 1,775 |
scm
|
test.scm
|
(use readline posix utils irregex http-client uri-generic miscmacros)
(do ((eggs (string-split (call-with-input-pipe "chicken-status -list" read-all) (format "~%")) (cdr eggs)))
((null? eggs) '())
(let* ((egg (string-split (irregex-replace/all '(or #\( #\) #\") (car eggs) " ")))
(name (car egg))
(local-version (cadr egg))
(todo '()))
(pp
(filter
(lambda (y)
(if (not (irregex-search '(or "error" "/guest") y))
(and (push! name todo) (pp todo) #t)
#f))
(string-split (with-input-from-request
(string-append
"http://chicken.kitten-technologies.co.uk/henrietta.cgi?name="
(uri-encode-string name)
"&listversions=1") #f read-all) (format "~%"))))))
(define (needs-update egg-name #!optional url)
(let ((.url.
(if url
url
"http://chicken.kitten-technologies.co.uk/henrietta.cgi?name=")))
(pp .url.)
(pp egg-name)
(-(call-with-input-pipe "chicken-status -list")
(last
(versions#version-sort
(string-split
(with-input-from-request
(string-append
.url.
(uri-encode-string egg-name)
"&listversions=1") #f read-all)
(format "~%")))))))
(define (local egg)
(irregex-replace (format "~%")
(last (string-split (call-with-input-pipe
(string-append "chicken-status " egg)
read-all)
" "))))
(define (remote egg #!optional url)
(let ((.url. (if url url "http://chicken.kitten-technologies.co.uk/henrietta.cgi?name=")))
(versions#version-sort (string-split (with-input-from-request (string-append .url. (uri-encode-string egg)
"&listversions=1")
#f read-all)
(format "~%")))))
(define (update-available? egg #!optional url)
(versions#version-newer? (last (remote egg)) (local egg)))
| false |
e10b9cd2d60009fd68d9000d0374abe7991bdbba
|
a07eccf73366c0588f0694a26c1a55e27ead079d
|
/01-toyos-jit/jit.scm
|
8a9510550c6da07316d2f4a4c0af21a7fa1b9153
|
[] |
no_license
|
namin/reflection-schemes
|
a98a83d88a75ba72a5b9445185ed68c0ab973f19
|
f99d7d937938fcdd70d5854b6ea77e5260d7c8ba
|
refs/heads/master
| 2022-06-09T13:22:04.929019 | 2022-05-20T09:31:17 | 2022-05-20T09:31:17 | 233,351,280 | 20 | 2 | null | 2020-01-14T06:28:23 | 2020-01-12T06:54:06 |
Scheme
|
UTF-8
|
Scheme
| false | false | 4,419 |
scm
|
jit.scm
|
(define (jit! process)
(instrument! process)
(monitor optimize! process))
(define (counter-of context branch)
(to-id ':hits (cons branch context)))
(define (instrumented-if? process context)
(get (get process ':env) (counter-of context ':consequent) #f))
(define (instrument! process)
(define (gen ast context branch)
(let ((id (counter-of context branch)))
(upd! process ':env (lambda (env) (upd! env id (lambda (x) x) 0)))
`(begin
(set! ,id (+ ,id 1))
,(get (get (get ast ':children) branch) ':exp))))
(upd!
process ':exp
(lambda (program)
(synthesize
(traverse!
(analyze program)
(lambda (ast context)
(if (eq? ':if (get ast ':tag))
(analyze
`(if ,(get (get (get ast ':children) ':condition) ':exp)
,(gen ast context ':consequent)
,(gen ast context ':alternative)))
ast)))))))
;; rewrite between
;; (if C A B) [default]
;; and
;; (begin (speculate A) (if C (commit) (begin (undo) B))) [if hitsA >> hitsB]
;; and
;; (begin (speculate B) (if C (begin (undo) A) (commit))) [if hitsB >> hitsA]
(define (>> a b)
(> a (* 10 b)))
(define (optimize-if! on process ast context)
(let ((hitsA (get (get process ':env) (counter-of context ':consequent)))
(hitsB (get (get process ':env) (counter-of context ':alternative))))
(cond
((>> hitsA hitsB)
(speculate! on ':consequent process ast context))
((>> hitsB hitsA)
(speculate! on ':alternative process ast context))
(else
(speculate! on #f process ast context)))))
(define (ABC-of on ast)
(cond ((eq? ':consequent on)
(list (get (get (get (get ast ':children) '(:exp . 0)) ':children) ':exp)
(get (get (get (get (get (get ast ':children) '(:exp . 1)) ':children) ':alternative) ':children) '(:exp . 1))
(get (get (get (get ast ':children) '(:exp . 1)) ':children) ':condition)))
((eq? ':alternative on)
(list (get (get (get (get (get (get ast ':children) '(:exp . 1)) ':children) ':consequent) ':children) '(:exp . 1))
(get (get (get (get ast ':children) '(:exp . 0)) ':children) ':exp)
(get (get (get (get ast ':children) '(:exp . 1)) ':children) ':condition)))
(else (list
(get (get ast ':children) ':consequent)
(get (get ast ':children) ':alternative)
(get (get ast ':children) ':condition)))))
(define (speculate! old-on on process ast context)
(if (eq? old-on on)
(get ast ':exp)
(let* ((ABC (map synthesize (ABC-of old-on ast)))
(A (geti ABC 0))
(B (geti ABC 1))
(C (geti ABC 2)))
(cond ((eq? on ':consequent)
`(begin
(speculate ,A)
(if ,C (commit) (begin (undo) ,B))))
((eq? on ':alternative)
`(begin
(speculate ,B)
(if ,C (begin (undo) ,A) (commit))))
(else `(if ,C ,A ,B))))))
(define (optimize! process)
(upd!
process ':exp
(lambda (program)
(synthesize
(traverse!
(analyze program)
(lambda (ast context)
(if (instrumented-if? process context)
(cond
((eq? ':if (get ast ':tag))
(analyze (optimize-if! #f process ast context)))
((and (eq? ':begin (get ast ':tag))
(eq? ':speculate (get (get (get ast ':children) '(:exp . 0)) ':tag))
(eq? ':if (get (get (get ast ':children) '(:exp . 1)) ':tag)))
(analyze (optimize-if!
(if (eq? ':commit (get (get (get (get (get ast ':children) '(:exp . 1)) ':children) ':consequent) ':tag))
':consequent
':alternative)
process ast context)))
(else (error 'optimize! (format "unknown if shape"))))
ast)))))))
(define (monitor optimize! process)
`((:eval . ,(lambda (this exp env)
(if (get (get process ':env) ':done #f)
(upd! env ':done (lambda (old) #t))
;; still optimize even if done...
)
(exp)
env))
(:exp . ,(lambda () (optimize! process)))
(:env . ((:done . #f)))))
| false |
488db0d4b21b704d7c1415644ac5bedcb6532777
|
2d868c9428b8f4772d2ede375a3492b3b6885e1d
|
/Computational Objects/3.24.scm
|
40de7023aa8f4c8c5623fe0a9accaf1c380b0049
|
[] |
no_license
|
transducer/sicp
|
2428223945da87836fa2a82c02d965061717ae95
|
2cec377aa7805edfd7760c643c14127e344ee962
|
refs/heads/master
| 2021-06-06T20:06:47.156461 | 2016-09-16T22:05:02 | 2016-09-16T22:05:02 | 25,219,798 | 1 | 0 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 2,394 |
scm
|
3.24.scm
|
#lang planet neil/sicp
; In the table implementations above, the keys are tested for equality
; using equal? (called by assoc). This is not always the appropriate test.
; For instance, we might have a table with numeric keys in which we don't
; need an exact match to the number we're looking up, but only a number
; within some tolerance of it. Design a table constructor make-table that
; takes as an argument a same-key? procedure that will be used to test
; ``equality'' of keys. Make-table should return a dispatch procedure that
; can be used to access appropriate lookup and insert! procedures for a
; local table.
(define (make-table same-key?-proc)
(let ((local-table (list '*table*))
(equal? same-key?-proc))
(define (assoc key records)
(cond ((null? records) false)
((equal? key (caar records)) (car records))
(else (assoc key (cdr records)))))
(define (lookup key-1 key-2)
(let ((subtable (assoc key-1 (cdr local-table))))
(if subtable
(let ((record (assoc key-2 (cdr subtable))))
(if record
(cdr record)
false))
false)))
(define (insert! key-1 key-2 value)
(let ((subtable (assoc key-1 (cdr local-table))))
(if subtable
(let ((record (assoc key-2 (cdr subtable))))
(if record
(set-cdr! record value)
(set-cdr! subtable
(cons (cons key-2 value)
(cdr subtable)))))
(set-cdr! local-table
(cons (list key-1
(cons key-2 value))
(cdr local-table)))))
'ok)
(define (dispatch m)
(cond ((eq? m 'lookup-proc) lookup)
((eq? m 'insert-proc!) insert!)
(else (error "Unknown operation -- TABLE" m))))
dispatch))
; Testing
(define (same-key? a b)
(let ((margin 0.5))
(if (> a b)
(and (< (- margin b) a)
(> (+ margin b) a))
(and (< (- margin a) b)
(> (+ margin a) b)))))
(define t (make-table same-key?))
(define get (t 'lookup-proc))
(define put (t 'insert-proc!))
(put 1 1 'hello)
; => 'ok
(get 1 1)
; => 'hello
(get 2 2)
; => #f
(get 0.51 1.49)
; => 'hello
(get 0.49 1.49)
; => #f
(get 0.5 1.5)
; => #f
| false |
c1c61c71a1fd9a3d75f69d93858f9320b634747d
|
b39668eccdb1b003b6f98ea6e7a92c7bb2b5e951
|
/card-dimensions.ss
|
3b6631e722c2ddbfbb9e0fe9d789b08c24fb2394
|
[] |
no_license
|
angryzor/magic-the-gathering-project
|
d9c1f99bfbb38a8f9850427140d72db8c691297c
|
a58993eae9a7b0130353735b2d09ae6c8b07b006
|
refs/heads/master
| 2021-01-01T17:17:16.742759 | 2013-01-12T17:32:04 | 2013-01-12T17:32:04 | 7,578,284 | 0 | 1 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 117 |
ss
|
card-dimensions.ss
|
#lang scheme/gui
(provide CARD-HEIGHT
CARD-WIDTH)
(define CARD-HEIGHT 142)
(define CARD-WIDTH 100)
| false |
0304db22a1868fc0c569ff93ba0a596ff4bac967
|
4f30ba37cfe5ec9f5defe52a29e879cf92f183ee
|
/src/tests/hw.scm
|
ef573512894baadedbd26b8444609122a97b0685
|
[
"MIT"
] |
permissive
|
rtrusso/scp
|
e31ecae62adb372b0886909c8108d109407bcd62
|
d647639ecb8e5a87c0a31a7c9d4b6a26208fbc53
|
refs/heads/master
| 2021-07-20T00:46:52.889648 | 2021-06-14T00:31:07 | 2021-06-14T00:31:07 | 167,993,024 | 8 | 1 |
MIT
| 2021-06-14T00:31:07 | 2019-01-28T16:17:18 |
Scheme
|
UTF-8
|
Scheme
| false | false | 24 |
scm
|
hw.scm
|
(display 100)
(newline)
| false |
281a27864e39fec1809f3967fcd586881f197769
|
000dbfe5d1df2f18e29a76ea7e2a9556cff5e866
|
/sitelib/net/mq/amqp/security.scm
|
7eed33503fd7deb8c9af4a7e92257db86e0cbb7e
|
[
"BSD-3-Clause",
"LicenseRef-scancode-other-permissive",
"MIT",
"BSD-2-Clause"
] |
permissive
|
ktakashi/sagittarius-scheme
|
0a6d23a9004e8775792ebe27a395366457daba81
|
285e84f7c48b65d6594ff4fbbe47a1b499c9fec0
|
refs/heads/master
| 2023-09-01T23:45:52.702741 | 2023-08-31T10:36:08 | 2023-08-31T10:36:08 | 41,153,733 | 48 | 7 |
NOASSERTION
| 2022-07-13T18:04:42 | 2015-08-21T12:07:54 |
Scheme
|
UTF-8
|
Scheme
| false | false | 4,930 |
scm
|
security.scm
|
;;; -*- mode:scheme; coding:utf-8 -*-
;;;
;;; net/mq/amqp/security - AMQP v1.0 security
;;;
;;; Copyright (c) 2012 Takashi Kato <[email protected]>
;;;
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are permitted provided that the following conditions
;;; are met:
;;;
;;; 1. Redistributions of source code must retain the above copyright
;;; notice, this list of conditions and the following disclaimer.
;;;
;;; 2. Redistributions in binary form must reproduce the above copyright
;;; notice, this list of conditions and the following disclaimer in the
;;; documentation and/or other materials provided with the distribution.
;;;
;;; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
;;; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
;;; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
;;; A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
;;; OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
;;; SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
;;; TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
;;; PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
;;; LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
;;; NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
;;; SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
;;;
;; reference:
;; http://docs.oasis-open.org/amqp/core/v1.0/os/amqp-core-security-v1.0-os.html
#!nounbound
(library (net mq amqp security)
(export amqp:sasl-negotiation
;; Below are probably not needed
amqp-sasl-mechanisms?
amqp-sasl-init?
amqp-sasl-challenge?
amqp-sasl-response?
amqp-sasl-outcome?
amqp-sasl-code?
amqp-sasl-outcome?
+sasl-code-ok+
+sasl-code-auth+
+sasl-code-sys+
+sasl-code-sys-perm+
+sasl-code-sys-temp+)
(import (except (rnrs) fields)
(net mq amqp types)
(clos user)
(rfc sasl)
(sagittarius)
(sagittarius object))
(define (amqp:sasl-negotiation sasl-context hostname receiver sender)
(define (make-init m s h)
(make-amqp-sasl-init
:mechanism (sasl-authentication-mechanism-name m)
:initial-response (sasl-authentication-state-message s)
:hostname h))
(let ((mechanism (receiver)))
(unless (amqp-sasl-mechanisms? mechanism)
(assertion-violation 'amqp:sasl-negotiation "Unexpected frame"
mechanism))
(let* ((mechanisms (~ mechanism 'sasl-server-mechanisms))
(mechanism (sasl-select-mechanism sasl-context mechanisms))
;; For AMQP, server-challenge always comes after sasl-init
;; so I don't think CRAM-MD5 or other server challenge
;; required mechanism can't be implemented (or we can make
;; those implementation flexible?)
(initial-state (sasl-start-client-authentication mechanism #f)))
(sender (make-init mechanism initial-state hostname))
(let loop ((frame (receiver)))
(cond ((amqp-sasl-outcome? frame)
(unless (= (~ frame 'code) +sasl-code-ok+)
(assertion-violation 'amqp:sasl-negotiation
"Failed to authenticate"
(~ frame 'code))))
(else
(assertion-violation 'amqp:sasl-negotiation
"Not yet...")))))))
;; Messages
(define-composite-type sasl-mechanisms amqp:sasl-mechanism:list
#x00000000 #x00000040
((sasl-server-mechanisms :type :symbol :mandatory #t :multiple #t))
:provides (sasl-frame))
(define-method write-object ((t <amqp-sasl-mechanisms>) out)
(format out "#<sasl-mechanisms ~a>" (~ t 'sasl-server-mechanisms)))
(define-composite-type sasl-init amqp:sasl-init:list
#x00000000 #x00000041
((mechanism :type :symbol :mandatory #t)
(initial-response :type :binary)
(hostname :type :string))
:provides (sasl-frame))
(define-method write-object ((t <amqp-sasl-init>) out)
(format out "#<sasl-init ~a>" (~ t 'mechanism)))
(define-composite-type sasl-challenge amqp:sasl-challenge:list
#x00000000 #x00000042
((challenge :type :binary :mandatory #t))
:provides (sasl-frame))
(define-composite-type sasl-response amqp:sasl-response:list
#x00000000 #x00000043
((response :type :binary :mandatory #t))
:provides (sasl-frame))
(define-restricted-type sasl-code :ubyte)
(define-constant +sasl-code-ok+ 0)
(define-constant +sasl-code-auth+ 1)
(define-constant +sasl-code-sys+ 2)
(define-constant +sasl-code-sys-perm+ 3)
(define-constant +sasl-code-sys-temp+ 4)
(define-composite-type sasl-outcome amqp:sasl-outcome:list
#x00000000 #x00000044
((code :type sasl-code :mandatory #t)
(additional-data :type :binary))
:provides (sasl-frame))
(define-method write-object ((t <amqp-sasl-outcome>) out)
(format out "#<sasl-outcome ~a>" (~ t 'code)))
)
| false |
69f27c53ef07e16d4847cd5fa2f6fc4c94a682dc
|
4bd59493b25febc53ac9e62c259383fba410ec0e
|
/Scripts/Task/loops-do-while/scheme/loops-do-while.ss
|
0c2c615d0ea5f882e6a9c3d99bc54518bc8fbc14
|
[] |
no_license
|
stefanos1316/Rosetta-Code-Research
|
160a64ea4be0b5dcce79b961793acb60c3e9696b
|
de36e40041021ba47eabd84ecd1796cf01607514
|
refs/heads/master
| 2021-03-24T10:18:49.444120 | 2017-08-28T11:21:42 | 2017-08-28T11:21:42 | 88,520,573 | 5 | 1 | null | null | null | null |
UTF-8
|
Scheme
| false | false | 86 |
ss
|
loops-do-while.ss
|
(let loop ((i 1))
(display i)
(if (positive? (modulo i 6))
(loop (+ i 1))))
| false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.