1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
|
;; Copyright (C) 1994 M. Hagiya, W. Schelter, T. Yuasa
;; This file is part of GNU Common Lisp, herein referred to as GCL
;;
;; GCL is free software; you can redistribute it and/or modify it under
;; the terms of the GNU LIBRARY GENERAL PUBLIC LICENSE as published by
;; the Free Software Foundation; either version 2, or (at your option)
;; any later version.
;;
;; GCL 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 Library General Public
;; License for more details.
;;
;; You should have received a copy of the GNU Library General Public License
;; along with GCL; see the file COPYING. If not, write to the Free Software
;; Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
;;;; arraylib.lsp
;;;;
;;;; array routines
(in-package :si)
(proclaim '(optimize (safety 2) (space 3)))
(defvar *baet-hash* (make-hash-table :test 'equal))
(defun best-array-element-type (type &aux
(tps '(character bit signed-char unsigned-char signed-short unsigned-short
fixnum short-float long-float t)))
(if type
(or (car (member type tps))
(gethash type *baet-hash*)
(setf (gethash type *baet-hash*) (car (member type tps :test 'subtypep)))) t))
(defun upgraded-array-element-type (type &optional environment)
(declare (ignore environment))
(best-array-element-type type))
;(defun array-displacement (array)
; (let ((x (si:array-displacement1 array)))
; (values (car x) (cdr x)))
; )
(defun make-array (dimensions
&key (element-type t)
(initial-element nil)
(initial-contents nil initial-contents-supplied-p)
adjustable fill-pointer
displaced-to (displaced-index-offset 0)
static)
(when (integerp dimensions) (setq dimensions (list dimensions)))
(setq element-type (best-array-element-type element-type))
(cond ((= (length dimensions) 1)
(let ((x (si:make-vector element-type (car dimensions)
adjustable fill-pointer
displaced-to displaced-index-offset
static initial-element)))
(when initial-contents-supplied-p
(do ((n (car dimensions))
(lic (listp initial-contents) lic)
(ic initial-contents (if lic (cdr ic) ic))
(i 0 (1+ i)))
((>= i n))
(declare (fixnum n i))
(si:aset x i (if lic (car ic) (aref ic i)))))
x))
(t
(let ((x
(make-array1
(the fixnum(get-aelttype element-type))
static initial-element
displaced-to (the fixnum displaced-index-offset)
dimensions)))
(if fill-pointer (error "fill pointer for 1 dimensional arrays only"))
(unless (member 0 dimensions)
(when initial-contents-supplied-p
(do ((cursor
(make-list (length dimensions)
:initial-element 0)))
(nil)
(declare (:dynamic-extent cursor))
(aset-by-cursor x
(sequence-cursor initial-contents
cursor)
cursor)
(when (increment-cursor cursor dimensions)
(return nil)))))
x))))
(defun increment-cursor (cursor dimensions)
(if (null cursor)
t
(let ((carry (increment-cursor (cdr cursor) (cdr dimensions))))
(if carry
(cond ((>= (the fixnum (1+ (the fixnum (car cursor))))
(the fixnum (car dimensions)))
(rplaca cursor 0)
t)
(t
(rplaca cursor
(the fixnum (1+ (the fixnum (car cursor)))))
nil))
nil))))
(defun sequence-cursor (sequence cursor)
(if (null cursor)
sequence
(sequence-cursor (elt sequence (the fixnum (car cursor)))
(cdr cursor))))
(defun vector (&rest objects &aux (l (list (length objects))))
(declare (:dynamic-extent objects l))
(make-array l
:element-type t
:initial-contents objects))
(defun array-dimensions (array)
(do ((i (array-rank array))
(d nil))
((= i 0) d)
(setq i (1- i))
(setq d (cons (array-dimension array i) d))))
(defun array-in-bounds-p (array &rest indices &aux (r (array-rank array)))
(declare (:dynamic-extent indices))
(when (/= r (length indices))
(error "The rank of the array is ~R,~%~
~7@Tbut ~R ~:*~[indices are~;index is~:;indices are~] ~
supplied."
r (length indices)))
(do ((i 0 (1+ i))
(s indices (cdr s)))
((>= i r) t)
(when (or (< (car s) 0)
(>= (car s) (array-dimension array i)))
(return nil))))
(defun array-row-major-index (array &rest indices)
(declare (:dynamic-extent indices))
(do ((i 0 (1+ i))
(j 0 (+ (* j (array-dimension array i)) (car s)))
(s indices (cdr s)))
((null s) j)))
(defun bit (bit-array &rest indices)
(declare (:dynamic-extent indices))
(apply #'aref bit-array indices))
(defun sbit (bit-array &rest indices)
(declare (:dynamic-extent indices))
(apply #'aref bit-array indices))
(defun bit-and (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-and bit-array1 bit-array2 result-bit-array))
(defun bit-ior (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-ior bit-array1 bit-array2 result-bit-array))
(defun bit-xor (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-xor bit-array1 bit-array2 result-bit-array))
(defun bit-eqv (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-eqv bit-array1 bit-array2 result-bit-array))
(defun bit-nand (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-nand bit-array1 bit-array2 result-bit-array))
(defun bit-nor (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-nor bit-array1 bit-array2 result-bit-array))
(defun bit-andc1 (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-andc1 bit-array1 bit-array2 result-bit-array))
(defun bit-andc2 (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-andc2 bit-array1 bit-array2 result-bit-array))
(defun bit-orc1 (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-orc1 bit-array1 bit-array2 result-bit-array))
(defun bit-orc2 (bit-array1 bit-array2 &optional result-bit-array)
(bit-array-op boole-orc2 bit-array1 bit-array2 result-bit-array))
(defun bit-not (bit-array &optional result-bit-array)
(bit-array-op boole-c1 bit-array bit-array result-bit-array))
(defun vector-push (new-element vector)
(let ((fp (fill-pointer vector)))
(declare (fixnum fp))
(cond ((< fp (the fixnum (array-dimension vector 0)))
(si:aset vector fp new-element)
(si:fill-pointer-set vector (the fixnum (1+ fp)))
fp)
(t nil))))
(defun vector-push-extend (new-element vector &optional extension)
(let ((fp (fill-pointer vector)))
(declare (fixnum fp))
(cond ((< fp (the fixnum (array-dimension vector 0)))
(si:aset vector fp new-element)
(si:fill-pointer-set vector (the fixnum (1+ fp)))
fp)
(t
(adjust-array vector
(list (+ (array-dimension vector 0)
(or extension
(if (> (array-dimension vector 0) 0)
(array-dimension vector 0)
5))))
:element-type (array-element-type vector)
:fill-pointer fp)
(si:aset vector fp new-element)
(si:fill-pointer-set vector (the fixnum (1+ fp)))
fp))))
(defun vector-pop (vector)
(let ((fp (fill-pointer vector)))
(declare (fixnum fp))
(when (= fp 0)
(error "The fill pointer of the vector ~S zero." vector))
(si:fill-pointer-set vector (the fixnum (1- fp)))
(aref vector (the fixnum (1- fp)))))
(defun maset (array x dim &optional (cx (cons x -1)) (cur (make-list (length dim) :initial-element 0)) (ind cur))
(declare (dynamic-extent cur))
(cond (dim (dotimes (i (pop dim)) (setf (car cur) i) (maset array x dim cx (cdr cur) ind)))
((incf (cdr cx))
(when (apply 'array-in-bounds-p array ind)
(row-major-aset (apply 'aref array ind) (car cx) (cdr cx))))))
(defun adjust-array (array new-dimensions
&key element-type
initial-element
(initial-contents nil initial-contents-supplied-p)
fill-pointer
displaced-to
(displaced-index-offset 0)
(static (staticp array))
&aux (fill-pointer (or fill-pointer (when (array-has-fill-pointer-p array) (fill-pointer array)))))
(let ((x (if initial-contents-supplied-p
(make-array new-dimensions
:adjustable t
:static static
:element-type (array-element-type array)
:fill-pointer fill-pointer
:initial-contents initial-contents
:displaced-to displaced-to
:displaced-index-offset displaced-index-offset)
(make-array new-dimensions
:adjustable t
:static static
:element-type (array-element-type array)
:fill-pointer fill-pointer
:initial-element initial-element
:displaced-to displaced-to
:displaced-index-offset displaced-index-offset))))
(unless (or displaced-to initial-contents-supplied-p)
(cond ((or (atom new-dimensions)
(null (cdr new-dimensions))
(when (equal (cdr new-dimensions) (cdr (array-dimensions array)))
(or (not (eq element-type 'bit))
(eql 0 (the fixnum (mod (the fixnum (car (last new-dimensions))) char-size))))))
(copy-array-portion array x 0 0 (min (array-total-size x) (array-total-size array))))
((maset array x new-dimensions))))
(si:replace-array array x)
(when fill-pointer
(setf (fill-pointer array) (if (eq fill-pointer t) (array-total-size array) fill-pointer)))
array))
|
