blob: 6f6bc9493925d785fc5be2bceee4daff51b1faae (
plain)
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
|
;;; Chickadee Game Toolkit
;;; Copyright © 2017 David Thompson <dthompson2@worcester.edu>
;;;
;;; 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-module (chickadee data array-list)
#:use-module (chickadee utils)
#:use-module (ice-9 format)
#:use-module (rnrs base)
#:use-module (srfi srfi-9)
#:use-module (srfi srfi-9 gnu)
#:use-module (srfi srfi-43)
#:export (make-array-list
array-list
array-list?
array-list-empty?
array-list-size
array-list-ref
array-list-set!
array-list-push!
array-list-pop!
array-list-delete!
array-list-clear!
array-list-for-each
array-list-fold))
(define-record-type <array-list>
(%make-array-list vector size)
array-list?
(vector array-list-vector set-array-list-vector!)
(size array-list-size set-array-list-size!))
(define (display-array-list array-list port)
(display "<array-list" port)
(array-list-for-each (lambda (i item)
(display " " port)
(display item port))
array-list)
(display ">" port))
(set-record-type-printer! <array-list> display-array-list)
(define* (make-array-list #:optional (initial-capacity 32))
(%make-array-list (make-vector initial-capacity) 0))
(define (array-list . items)
(let ((l (make-array-list)))
(for-each (lambda (item)
(array-list-push! l item))
items)
l))
(define (array-list-capacity array-list)
(vector-length (array-list-vector array-list)))
(define (array-list-full? array-list)
(= (array-list-size array-list)
(array-list-capacity array-list)))
(define (array-list-empty? array-list)
(zero? (array-list-size array-list)))
(define (expand-array-list! array-list)
(let* ((old-vec (array-list-vector array-list))
(old-size (vector-length old-vec))
(new-size (+ old-size (div old-size 2)))
(new-vec (make-vector new-size)))
(vector-copy! new-vec 0 old-vec)
(set-array-list-vector! array-list new-vec)))
(define (array-list-ref array-list i)
(if (and (>= i 0) (< i (array-list-size array-list)))
(vector-ref (array-list-vector array-list) i)
(error "array list index out of bounds" i)))
(define (array-list-set! array-list i x)
(vector-set! (array-list-vector array-list) i x))
(define (array-list-push! array-list item)
(when (array-list-full? array-list)
(expand-array-list! array-list))
(let ((index (array-list-size array-list)))
(set-array-list-size! array-list (1+ index))
(array-list-set! array-list index item)))
(define (array-list-pop! array-list)
(let* ((index (1- (array-list-size array-list)))
(item (array-list-ref array-list index)))
;; Remove element reference so it can be GC'd.
(array-list-set! array-list index #f)
(set-array-list-size! array-list index)
item))
(define* (array-list-delete! array-list item #:key (equal? equal?) fast?)
(let* ((v (array-list-vector array-list))
(n (array-list-size array-list)))
(let loop ((i 0))
(when (< i n)
(if (equal? item (vector-ref v i))
(begin
(if fast?
;; Fast: Swap the last element with the element to be
;; deleted. Constant time but does not preserve
;; order.
(let ((last (- n 1)))
(vector-set! v i (vector-ref v last))
(vector-set! v last #f))
;; Slow: Shift all elements to the left. Linear time
;; but preserves order.
(let shift ((j (+ i 1)))
(if (= j n)
(vector-set! v j #f)
(begin
(vector-set! v (- j 1) (vector-ref v j))
(shift (+ j 1))))))
(set-array-list-size! array-list (- n 1)))
(loop (+ i 1)))))))
(define (array-list-clear! array-list)
(let ((vec (array-list-vector array-list)))
;; Remove all element references so they can be GC'd.
(for-range ((i (array-list-size array-list)))
(vector-set! vec i #f)))
(set-array-list-size! array-list 0)
*unspecified*)
(define (array-list-for-each proc array-list)
(let ((vec (array-list-vector array-list)))
(for-range ((i (array-list-size array-list)))
(proc i (vector-ref vec i)))))
(define (array-list-fold proc init array-list)
(let ((vec (array-list-vector array-list)))
(let loop ((i 0)
(prev init))
(if (< i (array-list-size array-list))
(loop (1+ i) (proc i (vector-ref vec i) prev))
prev))))
|
