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
|
(in-package #:containers)
;;; vector-container-mixin
(defclass* vector-container-mixin (contents-as-array-mixin
initial-contents-mixin
ordered-container-mixin
typed-container-mixin
abstract-container)
((contents)))
(defmethod item-at ((container vector-container-mixin) &rest indices)
(declare (dynamic-extent indices))
(aref (contents container) (first indices)))
(defmethod item-at! ((container vector-container-mixin) value &rest indices)
(declare (dynamic-extent indices))
(setf (aref (contents container) (first indices))
value))
(defmethod nth-element ((container vector-container-mixin) (index integer))
(aref (contents container) index))
(defmethod first-element ((container vector-container-mixin))
(item-at container 0))
(defmethod (setf first-element) (value (container vector-container-mixin))
(setf (item-at container 0) value))
(defmethod last-element ((v vector-container-mixin))
(item-at v (1- (size v))))
(defmethod (setf last-element) (value (v vector-container-mixin))
(setf (item-at v (1- (size v))) value))
;;; basic-vector-container
(defclass* basic-vector-container (vector-container-mixin)
())
;;; bounded-vector-container
(defclass* bounded-vector-container (basic-vector-container
concrete-container)
())
(defmethod initialize-instance :around ((object bounded-vector-container) &rest args
&key size initial-size)
(remf args :size)
(apply #'call-next-method object :initial-size (or size initial-size) args))
;;; vector-container
;; implements size, empty-p, empty!,
;; insert-item, delete-item,
;; insert-item-at, delete-item-at,
;; item-at, iterate-container, delete-first, delete-last
;; first-element, search-for-item, search-for-match
(defclass* vector-container (basic-vector-container
concrete-container)
())
(defmethod insert-item ((container vector-container) item)
(vector-push-extend item (contents container))
container)
(defmethod insert-item-at ((container vector-container) item index)
(resize-vector container (max (1+ (size container))
(1+ index)))
(replace (contents container) (contents container)
:start1 (+ 1 index)
:start2 index
:end2 (- (size container) 1))
(setf (aref (contents container) index) item)
container)
(defmethod delete-item-at ((container vector-container) &rest indexes)
(declare (dynamic-extent indexes))
(let ((index (car indexes)))
(replace (contents container)
(contents container)
:start2 (+ 1 index)
:start1 index)
(decf (fill-pointer (contents container))))
container)
(defmethod delete-item ((container vector-container) item)
;;; removes the first instance of item in the-vector
(let ((position (position item (contents container))))
(when position
(delete-item-at container position))
container))
#+Wrong
;;?? This doesn't keep the adjustable property on all lisps
(defmethod delete-item ((container vector-container) item)
;;; removes the first instance of item in the-vector
(setf (contents container) (delete item (contents container) :count 1)))
#+Wrong
;;?? This is fast but doesn't respect the ordered-container contract
(defmethod delete-item ((container vector-container) item)
(let ((position (position item (contents container))))
(when position
(rotatef (aref (contents container) position)
(aref (contents container) (1- (length (contents container)))))
(setf (fill-pointer (contents container))
(1- (length (contents container)))))
container))
(defmethod delete-first ((v vector-container))
(prog1
(item-at v 0)
(delete-item-at v 0)))
(defmethod delete-last ((v vector-container))
(let ((index (1- (size v))))
(prog1
(item-at v index)
(delete-item-at v index))))
(defmethod size ((v vector-container))
(length (contents v)))
;;; flexible-vector-container
(defclass* flexible-vector-container (vector-container)
())
(defmethod item-at! :before
((container flexible-vector-container) value &rest indices)
(declare (ignore value)
(dynamic-extent indices))
(resize-vector container (1+ (first indices))))
#+Vector-Test
(let ((vec (make-container 'vector-container)))
(size vec)
(empty-p vec)
(insert-item vec 'a)
(size vec)
(item-at vec 0)
(insert-item-at vec 'b 0)
(empty-p vec)
(delete-item vec 'b)
(size vec)
(delete-item-at vec 0))
;;; utilities
(defun resize-vector (vector new-size)
(unless (= (size vector) new-size)
(setf (contents vector)
(adjust-array (contents vector)
(max (size vector) new-size)
:element-type
(array-element-type (contents vector))
:fill-pointer (array-has-fill-pointer-p (contents vector))))))
(defmethod samep ((container-1 vector-container-mixin)
(container-2 vector-container-mixin))
(let ((*samep-test* #'equalp))
(samep (contents container-1) (contents container-2))))
|
