1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
;; Copyright (c) 1991-2002, The Numerical ALgorithms Group Ltd.
;; All rights reserved.
;; Copyright (C) 2007, Gabriel Dos Reis.
;; 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.
;;
;; - Neither the name of The Numerical ALgorithms Group Ltd. nor the
;; names of its contributors may be used to endorse or promote products
;; derived from this software without specific prior written permission.
;;
;; 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.
;; Uncommon 1.6
;; This package is a Boot interface for Common Lisp.
;; SMW 1989, 1990
(IMPORT-MODULE "sys-macros")
(in-package "BOOT")
;;; This macro catches as much as it can.
;;; Systems with a catchall should use it.
;;; It is legitimate to not catch anything, if there is no system support.
;;;
;;; If the result was caught, then tagvar is set to the desination tag
;;; and the thown value is returned. Otherwise, tagvar is set to nil
;;; and the first result of the expression is returned.
#+:Lucid
(defmacro |CatchAsCan| (tagvar expr)
`(let ((catch-result nil)
(expr-result nil)
(normal-exit (gensym)))
(setq catch-result
(catch 'lucid::top-level
(setq expr-result ,expr)
normal-exit))
(cond
((eq catch-result normal-exit)
(setq ,tagvar nil)
expr-result )
('t
(setq ,tagvar 'lucid::top-level)
catch-result )) ))
#-:Lucid
(defmacro |CatchAsCan| (tagvar expr)
`(let ((,tagvar nil))
,expr ))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;
;;; General
;;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defmacro |Eq| (a b)
`(eq ,a ,b) )
(defvar |Nil| nil)
(defun |Sort| (l pred)
(sort (copy-tree l) pred) )
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;
;;; Streams
;;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun |Prompt| (line &optional (readfn nil))
(format *query-io* "~a" line)
(when readfn (apply readfn (list *query-io*))) )
(defun |PrettyPrint| (expr &optional (outstream *standard-output*))
(write expr :stream outstream :level nil :length nil :pretty 't :escape 't)
(finish-output outstream) )
(defun plain-print-format-string (l)
(format nil "~~~d{~~a~~}~~%" (length l)) )
;;;
;;; Character Sets
;;;
(defun |Cset| (str)
(let
((cset (make-array
(list char-code-limit)
:element-type 'bit
:initial-element 0 ))
(len (length str)) )
(do ((i 0 (+ 1 i)))
((= i len))
(setf (sbit cset (char-code (char str i))) 1) )
cset ))
(defvar |WhiteSpaceCset|
(|Cset| (coerce
(list #\Space #\Newline #\Tab #\Page #\Linefeed #\Return #\Backspace)
'string )) )
;;;
;;; Lists
;;;
(defun |ListMemberQ?| (ob l)
(member ob l :test #'eq) )
(defun |ListRemoveQ| (ob l)
(remove ob l :test #'eq :count 1) )
;;;
;;; Association lists
;;;
(defun |AlistAssocQ| (key l)
(assoc key l :test #'eq) )
(defun |AlistRemoveQ| (key l)
(let ((pr (assoc key l :test #'eq)))
(if pr
(remove pr l :test #'eq)
l) ))
;; CCL supplies a slightly more efficient version of logs to base 10, which
;; is useful in the WIDTH function. MCD.
#+:KCL (defun log10 (u) (log u 10))
|
