|
0
|
1 |
"
|
|
4
|
2 |
COPYRIGHT (c) 1989 by Claus Gittinger
|
|
42
|
3 |
All Rights Reserved
|
|
0
|
4 |
|
|
|
5 |
This software is furnished under a license and may be used
|
|
|
6 |
only in accordance with the terms of that license and with the
|
|
|
7 |
inclusion of the above copyright notice. This software may not
|
|
|
8 |
be provided or otherwise made available to, or used by, any
|
|
|
9 |
other person. No title to or ownership of the software is
|
|
|
10 |
hereby transferred.
|
|
|
11 |
"
|
|
|
12 |
|
|
|
13 |
ArrayedCollection subclass:#VariableArray
|
|
124
|
14 |
instanceVariableNames:'tally contentsArray'
|
|
|
15 |
classVariableNames:''
|
|
|
16 |
poolDictionaries:''
|
|
|
17 |
category:'Collections-Sequenceable'
|
|
0
|
18 |
!
|
|
|
19 |
|
|
31
|
20 |
!VariableArray class methodsFor:'documentation'!
|
|
|
21 |
|
|
|
22 |
copyright
|
|
|
23 |
"
|
|
|
24 |
COPYRIGHT (c) 1989 by Claus Gittinger
|
|
42
|
25 |
All Rights Reserved
|
|
0
|
26 |
|
|
31
|
27 |
This software is furnished under a license and may be used
|
|
|
28 |
only in accordance with the terms of that license and with the
|
|
|
29 |
inclusion of the above copyright notice. This software may not
|
|
|
30 |
be provided or otherwise made available to, or used by, any
|
|
|
31 |
other person. No title to or ownership of the software is
|
|
|
32 |
hereby transferred.
|
|
|
33 |
"
|
|
|
34 |
!
|
|
0
|
35 |
|
|
31
|
36 |
documentation
|
|
|
37 |
"
|
|
|
38 |
VariableArrays can grow and shrink - in contrast to Arrays which are
|
|
42
|
39 |
fixed in size.
|
|
|
40 |
WARNING: Do not use this class for new applications - its a historic
|
|
58
|
41 |
leftover from times when no OrderedCollection existed.
|
|
42
|
42 |
|
|
31
|
43 |
Use OrderedCollection, which offers more functionality, and is even
|
|
42
|
44 |
a bit faster in some operations.
|
|
31
|
45 |
"
|
|
124
|
46 |
!
|
|
|
47 |
|
|
|
48 |
version
|
|
|
49 |
^ '$Header: /cvs/stx/stx/libbasic2/Attic/VarArray.st,v 1.13 1995-11-23 01:20:36 cg Exp $'
|
|
31
|
50 |
! !
|
|
0
|
51 |
|
|
|
52 |
!VariableArray class methodsFor:'instance creation'!
|
|
|
53 |
|
|
|
54 |
new
|
|
|
55 |
"return a new VariableArray - with size 0"
|
|
|
56 |
|
|
|
57 |
^ (self basicNew) setInitialContents:(Array new:10)
|
|
|
58 |
!
|
|
|
59 |
|
|
|
60 |
new:size
|
|
|
61 |
"return a new VariableArray"
|
|
|
62 |
|
|
|
63 |
^ (self basicNew) setContents:(Array new:size)
|
|
|
64 |
! !
|
|
|
65 |
|
|
124
|
66 |
!VariableArray methodsFor:'accessing'!
|
|
0
|
67 |
|
|
124
|
68 |
at:index
|
|
|
69 |
"return the element at index"
|
|
0
|
70 |
|
|
124
|
71 |
(index between:1 and:tally) ifFalse:[
|
|
|
72 |
^ self subscriptBoundsError:index
|
|
|
73 |
].
|
|
|
74 |
^ contentsArray at:index
|
|
0
|
75 |
!
|
|
|
76 |
|
|
124
|
77 |
at:index put:anObject
|
|
|
78 |
"set the element at index"
|
|
0
|
79 |
|
|
124
|
80 |
(index between:1 and:tally) ifFalse:[
|
|
|
81 |
^ self subscriptBoundsError:index
|
|
|
82 |
].
|
|
|
83 |
^ contentsArray at:index put:anObject
|
|
0
|
84 |
! !
|
|
|
85 |
|
|
124
|
86 |
!VariableArray methodsFor:'enumerating'!
|
|
0
|
87 |
|
|
124
|
88 |
do:aBlock
|
|
|
89 |
"evaluate the argument, aBlock for each element
|
|
|
90 |
in the collection"
|
|
0
|
91 |
|
|
124
|
92 |
contentsArray from:1 to:tally do:aBlock
|
|
0
|
93 |
!
|
|
|
94 |
|
|
124
|
95 |
from:start to:stop do:aBlock
|
|
|
96 |
"evaluate the argument, aBlock for some elements
|
|
|
97 |
in the collection"
|
|
0
|
98 |
|
|
124
|
99 |
(stop <= tally) ifTrue:[
|
|
|
100 |
contentsArray from:start to:stop do:aBlock
|
|
|
101 |
] ifFalse:[
|
|
|
102 |
super from:start to:stop do:aBlock
|
|
|
103 |
]
|
|
0
|
104 |
! !
|
|
|
105 |
|
|
|
106 |
!VariableArray methodsFor:'filling & replacing'!
|
|
|
107 |
|
|
|
108 |
replaceFrom:start to:stop with:aCollection startingAt:repStart
|
|
|
109 |
"reimplemented for speed
|
|
|
110 |
- can use Arrays fast replace if aCollection is Array or VariableArray"
|
|
|
111 |
|
|
|
112 |
|col|
|
|
|
113 |
|
|
|
114 |
col := aCollection.
|
|
|
115 |
(aCollection isKindOf:VariableArray) ifTrue:[
|
|
42
|
116 |
((stop - start + repStart) <= aCollection size) ifTrue:[
|
|
|
117 |
col := aCollection getContents
|
|
|
118 |
]
|
|
0
|
119 |
].
|
|
|
120 |
(col isMemberOf:Array) ifTrue:[
|
|
42
|
121 |
(stop <= tally) ifTrue:[
|
|
|
122 |
contentsArray replaceFrom:start to:stop with:col startingAt:repStart.
|
|
28
|
123 |
^ self
|
|
42
|
124 |
]
|
|
0
|
125 |
].
|
|
|
126 |
^ super replaceFrom:start to:stop with:aCollection startingAt:repStart
|
|
|
127 |
! !
|
|
|
128 |
|
|
124
|
129 |
!VariableArray methodsFor:'grow & shrink'!
|
|
|
130 |
|
|
|
131 |
add:anElement
|
|
|
132 |
"add anElement to the end of the array"
|
|
|
133 |
|
|
|
134 |
|newSize "{ Class: SmallInteger }" |
|
|
|
135 |
|
|
|
136 |
newSize := tally + 1.
|
|
|
137 |
(newSize <= contentsArray size) ifTrue:[
|
|
|
138 |
tally := newSize
|
|
|
139 |
] ifFalse:[
|
|
|
140 |
self grow:newSize
|
|
|
141 |
].
|
|
|
142 |
contentsArray at:tally put:anElement
|
|
|
143 |
!
|
|
|
144 |
|
|
|
145 |
grow:newSize
|
|
|
146 |
"grow to newSize"
|
|
|
147 |
|
|
|
148 |
|newArray|
|
|
|
149 |
|
|
|
150 |
(newSize == tally) ifTrue:[^ self].
|
|
|
151 |
|
|
|
152 |
(newSize > tally) ifTrue:[
|
|
|
153 |
(newSize > contentsArray size) ifTrue:[
|
|
|
154 |
newArray := Array new:(newSize * 2).
|
|
|
155 |
newArray replaceFrom:1 to:tally with:contentsArray startingAt:1.
|
|
|
156 |
contentsArray := newArray
|
|
|
157 |
]
|
|
|
158 |
] ifFalse:[
|
|
|
159 |
contentsArray from:(newSize + 1) to:tally put:nil
|
|
|
160 |
].
|
|
|
161 |
tally := newSize
|
|
|
162 |
! !
|
|
|
163 |
|
|
|
164 |
!VariableArray methodsFor:'inquiries'!
|
|
|
165 |
|
|
|
166 |
isFixedSize
|
|
|
167 |
"return true if the receiver cannot grow - this will vanish once
|
|
|
168 |
Arrays and Strings learn how to grow ..."
|
|
|
169 |
|
|
|
170 |
^ false
|
|
|
171 |
!
|
|
|
172 |
|
|
|
173 |
size
|
|
|
174 |
"return the number of array elements"
|
|
|
175 |
|
|
|
176 |
^ tally
|
|
|
177 |
! !
|
|
|
178 |
|
|
|
179 |
!VariableArray methodsFor:'kludges'!
|
|
|
180 |
|
|
|
181 |
shallowCopy:anArray
|
|
|
182 |
"return a shallow copy of the receiver
|
|
|
183 |
have to kludge the kludge ... - shallow copy the contents array"
|
|
|
184 |
|
|
|
185 |
|newText|
|
|
|
186 |
|
|
|
187 |
newText := self class new.
|
|
|
188 |
newText setContents:(contentsArray shallowCopy).
|
|
|
189 |
^ newText
|
|
|
190 |
! !
|
|
|
191 |
|
|
|
192 |
!VariableArray methodsFor:'private'!
|
|
|
193 |
|
|
|
194 |
getContents
|
|
|
195 |
"return the contents array"
|
|
|
196 |
|
|
|
197 |
^ contentsArray
|
|
|
198 |
!
|
|
|
199 |
|
|
|
200 |
setContents:anArray
|
|
|
201 |
"set the contents array"
|
|
|
202 |
|
|
|
203 |
tally := anArray size.
|
|
|
204 |
contentsArray := anArray
|
|
|
205 |
!
|
|
|
206 |
|
|
|
207 |
setInitialContents:anArray
|
|
|
208 |
"set the contents array but make size zero"
|
|
|
209 |
|
|
|
210 |
tally := 0.
|
|
|
211 |
contentsArray := anArray
|
|
|
212 |
! !
|
|
|
213 |
|
|
0
|
214 |
!VariableArray methodsFor:'removing'!
|
|
|
215 |
|
|
|
216 |
removeFromIndex:startIndex toIndex:endIndex
|
|
|
217 |
"remove the elements stored at indexes between startIndex and endIndex"
|
|
|
218 |
|
|
|
219 |
|newSize|
|
|
|
220 |
|
|
|
221 |
(endIndex >= tally) ifTrue:[
|
|
42
|
222 |
self grow:(startIndex - 1)
|
|
0
|
223 |
] ifFalse:[
|
|
42
|
224 |
newSize := tally - endIndex + startIndex - 1.
|
|
|
225 |
contentsArray replaceFrom:startIndex to:newSize with:contentsArray startingAt:(endIndex + 1).
|
|
|
226 |
self grow:newSize
|
|
0
|
227 |
]
|
|
|
228 |
! !
|
|
|
229 |
|
|
|
230 |
!VariableArray methodsFor:'testing'!
|
|
|
231 |
|
|
124
|
232 |
identityIndexOf:anElement startingAt:start
|
|
|
233 |
"search the collection for anElement starting search at index start
|
|
|
234 |
using == for compares.
|
|
|
235 |
if found, return the index otherwise return 0"
|
|
|
236 |
|
|
|
237 |
|index|
|
|
0
|
238 |
|
|
124
|
239 |
(start > tally) ifFalse:[
|
|
|
240 |
index := contentsArray identityIndexOf:anElement startingAt:start.
|
|
|
241 |
index == 0 ifFalse:[
|
|
|
242 |
(index between:1 and:tally) ifTrue:[
|
|
|
243 |
^ index
|
|
|
244 |
]
|
|
|
245 |
]
|
|
|
246 |
].
|
|
|
247 |
^ 0
|
|
0
|
248 |
!
|
|
|
249 |
|
|
|
250 |
includes:anObject
|
|
|
251 |
"return true, if the receiver contains the argument, anObject"
|
|
|
252 |
|
|
|
253 |
^ contentsArray includes:anObject
|
|
|
254 |
!
|
|
|
255 |
|
|
|
256 |
indexOf:anElement startingAt:start
|
|
|
257 |
"search the collection for anElement starting search at index start
|
|
|
258 |
using = for compares.
|
|
|
259 |
if found, return the index otherwise return 0"
|
|
|
260 |
|
|
|
261 |
|index|
|
|
|
262 |
|
|
|
263 |
(start > tally) ifFalse:[
|
|
42
|
264 |
index := contentsArray indexOf:anElement startingAt:start.
|
|
|
265 |
index == 0 ifFalse:[
|
|
|
266 |
(index between:1 and:tally) ifTrue:[
|
|
|
267 |
^ index
|
|
|
268 |
]
|
|
|
269 |
]
|
|
0
|
270 |
].
|
|
|
271 |
^ 0
|
|
|
272 |
!
|
|
|
273 |
|
|
124
|
274 |
occurrencesOf:anObject
|
|
|
275 |
"return the number of occurrences of anObject in the receiver"
|
|
0
|
276 |
|
|
124
|
277 |
^ contentsArray occurrencesOf:anObject
|
|
0
|
278 |
! !
|
|
|
279 |
|