author | Claus Gittinger <cg@exept.de> |
Fri, 16 Jan 2009 13:53:46 +0100 | |
changeset 11469 | d1344e7b8364 |
parent 11468 | 1a5264854d15 |
child 11470 | 020075295c68 |
permissions | -rw-r--r-- |
1 | 1 |
" |
5 | 2 |
COPYRIGHT (c) 1989 by Claus Gittinger |
6135 | 3 |
All Rights Reserved |
1 | 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 |
" |
|
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5268
diff
changeset
|
12 |
"{ Package: 'stx:libbasic' }" |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5268
diff
changeset
|
13 |
|
1 | 14 |
Object subclass:#Collection |
11331 | 15 |
instanceVariableNames:'' |
16 |
classVariableNames:'InvalidKeySignal EmptyCollectionSignal ValueNotFoundSignal |
|
17 |
NotEnoughElementsSignal RecursiveCollectionStoreStringSignal' |
|
18 |
poolDictionaries:'' |
|
19 |
category:'Collections-Abstract' |
|
1 | 20 |
! |
21 |
||
2097 | 22 |
!Collection class methodsFor:'documentation'! |
88 | 23 |
|
24 |
copyright |
|
25 |
" |
|
26 |
COPYRIGHT (c) 1989 by Claus Gittinger |
|
6135 | 27 |
All Rights Reserved |
1 | 28 |
|
88 | 29 |
This software is furnished under a license and may be used |
30 |
only in accordance with the terms of that license and with the |
|
31 |
inclusion of the above copyright notice. This software may not |
|
32 |
be provided or otherwise made available to, or used by, any |
|
33 |
other person. No title to or ownership of the software is |
|
34 |
hereby transferred. |
|
35 |
" |
|
36 |
! |
|
1 | 37 |
|
88 | 38 |
documentation |
39 |
" |
|
40 |
Abstract superclass for all collections. |
|
41 |
This abstract class provides functionality common to all collections, |
|
42 |
without knowing how the concrete class implements things. Thus, all |
|
43 |
methods found here depend on some basic mechanisms to be defined in the |
|
44 |
concrete class. |
|
45 |
These basic methods are usually defined as #subclassResponsibility here. |
|
46 |
Some methods are also redefined for better performance. |
|
1289 | 47 |
|
1325 | 48 |
Subclasses should at least implement: |
49 |
do: - enumerate elements |
|
50 |
||
51 |
they should implement one of the following set of access messages: |
|
52 |
keyed collections: |
|
53 |
at:ifAbsent: - fetching an element |
|
54 |
at: - fetching an element |
|
55 |
at:put: - storing an element |
|
56 |
||
57 |
unkeyed collections: |
|
58 |
add: - add an element |
|
59 |
remove:ifAbsent: - remove an element |
|
60 |
||
61 |
||
1289 | 62 |
[author:] |
63 |
Claus Gittinger |
|
88 | 64 |
" |
65 |
! ! |
|
1 | 66 |
|
2097 | 67 |
!Collection class methodsFor:'initialization'! |
10 | 68 |
|
69 |
initialize |
|
70 |
"setup the signal" |
|
71 |
||
54 | 72 |
InvalidKeySignal isNil ifTrue:[ |
7092
630807cd320f
Convert Object>>errorSignal -> Error
Stefan Vogel <sv@exept.de>
parents:
7054
diff
changeset
|
73 |
InvalidKeySignal := Error newSignalMayProceed:true. |
3102
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
74 |
InvalidKeySignal nameClass:self message:#invalidKeySignal. |
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
75 |
InvalidKeySignal notifierString:'invalid key:'. |
345 | 76 |
|
8510
af60b80bf50e
refer to exception classes instead of signal class vars
Stefan Vogel <sv@exept.de>
parents:
8395
diff
changeset
|
77 |
ValueNotFoundSignal := NotFoundError newSignalMayProceed:true. |
3102
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
78 |
ValueNotFoundSignal nameClass:self message:#valueNotFoundSignal. |
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
79 |
ValueNotFoundSignal notifierString:'value not found:'. |
155 | 80 |
|
8510
af60b80bf50e
refer to exception classes instead of signal class vars
Stefan Vogel <sv@exept.de>
parents:
8395
diff
changeset
|
81 |
NotEnoughElementsSignal := NotFoundError newSignalMayProceed:true. |
3102
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
82 |
NotEnoughElementsSignal nameClass:self message:#notEnoughElementsSignal. |
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
83 |
NotEnoughElementsSignal notifierString:'not enough elements in collection'. |
348 | 84 |
|
3102
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
85 |
EmptyCollectionSignal := NotEnoughElementsSignal newSignalMayProceed:true. |
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
86 |
EmptyCollectionSignal nameClass:self message:#emptyCollectionSignal. |
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
87 |
EmptyCollectionSignal notifierString:'operation not allowed for empty collections'. |
54 | 88 |
] |
3102
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
89 |
|
2bc81588db6c
sigs are children of NotFoundSignal (ST80 compat)
Claus Gittinger <cg@exept.de>
parents:
3075
diff
changeset
|
90 |
"Modified: / 8.11.1997 / 19:18:17 / cg" |
10 | 91 |
! ! |
92 |
||
2097 | 93 |
!Collection class methodsFor:'instance creation'! |
155 | 94 |
|
602 | 95 |
new:size withAll:element |
5626 | 96 |
"return a new Collection of size, where all elements are |
602 | 97 |
initialized to element" |
348 | 98 |
|
602 | 99 |
|newCollection| |
92 | 100 |
|
602 | 101 |
newCollection := self new:size. |
102 |
size timesRepeat:[newCollection add:element] |
|
103 |
! |
|
1 | 104 |
|
5626 | 105 |
newFrom:aCollection |
106 |
"Return an instance of me containing the same elements as aCollection." |
|
107 |
||
108 |
^ self withAll:aCollection |
|
109 |
||
110 |
" |
|
111 |
Bag newFrom:#(1 2 3 4 4 5 6 7 7 7 ) |
|
112 |
Set newFrom:#(1 2 3 4 4 5 6 7 7 7 ) |
|
113 |
" |
|
114 |
! |
|
115 |
||
1 | 116 |
with:anObject |
117 |
"return a new Collection with one element:anObject" |
|
118 |
||
119 |
|newCollection| |
|
120 |
||
121 |
newCollection := self new. |
|
122 |
newCollection add:anObject. |
|
123 |
^ newCollection |
|
124 |
! |
|
125 |
||
126 |
with:firstObject with:secondObject |
|
127 |
"return a new Collection with two elements:firstObject and secondObject" |
|
128 |
||
129 |
|newCollection| |
|
130 |
||
131 |
newCollection := self new. |
|
1112 | 132 |
newCollection add:firstObject; add:secondObject. |
1 | 133 |
^ newCollection |
134 |
! |
|
135 |
||
136 |
with:firstObject with:secondObject with:thirdObject |
|
137 |
"return a new Collection with three elements" |
|
138 |
||
139 |
|newCollection| |
|
140 |
||
141 |
newCollection := self new. |
|
1112 | 142 |
newCollection add:firstObject; add:secondObject; add:thirdObject. |
1 | 143 |
^ newCollection |
144 |
! |
|
145 |
||
146 |
with:firstObject with:secondObject with:thirdObject with:fourthObject |
|
147 |
"return a new Collection with four elements" |
|
148 |
||
149 |
|newCollection| |
|
150 |
||
151 |
newCollection := self new. |
|
1112 | 152 |
newCollection add:firstObject; add:secondObject; add:thirdObject; add:fourthObject. |
1 | 153 |
^ newCollection |
154 |
! |
|
155 |
||
2225
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
156 |
with:a1 with:a2 with:a3 with:a4 with:a5 |
345 | 157 |
"return a new Collection with five elements" |
158 |
||
159 |
|newCollection| |
|
160 |
||
161 |
newCollection := self new. |
|
2225
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
162 |
newCollection add:a1; add:a2; add:a3; add:a4; add:a5. |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
163 |
^ newCollection |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
164 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
165 |
"Modified: 22.1.1997 / 19:34:01 / cg" |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
166 |
! |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
167 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
168 |
with:a1 with:a2 with:a3 with:a4 with:a5 with:a6 |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
169 |
"return a new Collection with size elements" |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
170 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
171 |
|newCollection| |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
172 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
173 |
newCollection := self new. |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
174 |
newCollection add:a1; add:a2; add:a3; add:a4; add:a5; add:a6. |
345 | 175 |
^ newCollection |
2225
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
176 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
177 |
"Created: 22.1.1997 / 19:34:14 / cg" |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
178 |
! |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
179 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
180 |
with:a1 with:a2 with:a3 with:a4 with:a5 with:a6 with:a7 |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
181 |
"return a new Collection with seven elements" |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
182 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
183 |
|newCollection| |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
184 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
185 |
newCollection := self new. |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
186 |
newCollection add:a1; add:a2; add:a3; add:a4; add:a5; add:a6; add:a7. |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
187 |
^ newCollection |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
188 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
189 |
"Created: 22.1.1997 / 19:34:24 / cg" |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
190 |
! |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
191 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
192 |
with:a1 with:a2 with:a3 with:a4 with:a5 with:a6 with:a7 with:a8 |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
193 |
"return a new Collection with eight elements" |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
194 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
195 |
|newCollection| |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
196 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
197 |
newCollection := self new. |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
198 |
newCollection add:a1; add:a2; add:a3; add:a4; add:a5; add:a6; add:a7; add:a8. |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
199 |
^ newCollection |
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
200 |
|
53313e47007a
added with:with: type of instance creation messages
Claus Gittinger <cg@exept.de>
parents:
2167
diff
changeset
|
201 |
"Created: 22.1.1997 / 19:34:34 / cg" |
345 | 202 |
! |
203 |
||
1 | 204 |
withAll:aCollection |
205 |
"return a new Collection with all elements taken from the argument, |
|
206 |
aCollection" |
|
207 |
||
208 |
|newCollection| |
|
209 |
||
210 |
newCollection := self new. |
|
211 |
newCollection addAll:aCollection. |
|
212 |
^newCollection |
|
9159 | 213 |
! |
214 |
||
215 |
withSize:n |
|
216 |
"return a new collection which really provides space for n elements. |
|
217 |
Kludges around the stupid definition of OrderedCollection>>new:" |
|
218 |
||
219 |
^ self new:n |
|
220 |
! ! |
|
221 |
||
222 |
!Collection class methodsFor:'Compatibility-Squeak'! |
|
223 |
||
224 |
ofSize:n |
|
225 |
"return a new collection which really provides space for n elements. |
|
226 |
Kludges around the stupid definition of OrderedCollection>>new:" |
|
227 |
||
228 |
^ self withSize:n |
|
1 | 229 |
! ! |
230 |
||
2097 | 231 |
!Collection class methodsFor:'Signal constants'! |
10 | 232 |
|
602 | 233 |
emptyCollectionSignal |
234 |
"return the signal used to report non-allowed operation on empty collections" |
|
345 | 235 |
|
602 | 236 |
^ EmptyCollectionSignal |
308 | 237 |
! |
238 |
||
602 | 239 |
invalidKeySignal |
240 |
"return the signal used to report bad key usage" |
|
308 | 241 |
|
602 | 242 |
^ InvalidKeySignal |
201 | 243 |
! |
244 |
||
602 | 245 |
notEnoughElementsSignal |
246 |
"return the signal used to report attempts for an operation, for which |
|
247 |
there are not enough elements in the collection" |
|
249 | 248 |
|
602 | 249 |
^ NotEnoughElementsSignal |
404 | 250 |
! |
251 |
||
602 | 252 |
valueNotFoundSignal |
253 |
"return the signal used to report a nonexisting element." |
|
404 | 254 |
|
602 | 255 |
^ ValueNotFoundSignal |
256 |
! ! |
|
404 | 257 |
|
2097 | 258 |
!Collection class methodsFor:'queries'! |
404 | 259 |
|
602 | 260 |
growIsCheap |
261 |
"return true, if this collection can easily grow |
|
262 |
(i.e. without a need for become:). |
|
263 |
Returns true here; this method is redefined in fix-size |
|
264 |
collections" |
|
404 | 265 |
|
602 | 266 |
^ true |
8893 | 267 |
! |
268 |
||
269 |
isAbstract |
|
11231 | 270 |
"Return if this class is an abstract class. |
271 |
True is returned for Collection here; false for subclasses. |
|
272 |
Abstract subclasses must redefine again." |
|
273 |
||
8893 | 274 |
^ self == Collection |
257 | 275 |
! ! |
276 |
||
7261 | 277 |
!Collection methodsFor:'Compatibility-Dolphin'! |
6411 | 278 |
|
279 |
identityIncludes:anObject |
|
7807 | 280 |
"return true, if the argument, anObject is in the collection. |
281 |
Same as #includesIdentical for Dolphin compatibility." |
|
282 |
||
6411 | 283 |
^ self includesIdentical:anObject. |
6869 | 284 |
! |
285 |
||
286 |
includesAnyOf:aCollection |
|
287 |
"same as #includesAny for Dolphin compatibility." |
|
288 |
||
289 |
^ self includesAny:aCollection |
|
290 |
||
291 |
" |
|
292 |
#(1 2 3 4 5 6 7) includesAny:#(1 2 3) |
|
293 |
#('hello' 'there' 'world') includesAny:#('hello' 'world') |
|
294 |
#(1 2 3 4 5 6 7) includesAny:#(7 8 9) |
|
295 |
#(1 2 3 4 5 6 7) includesAny:#(8 9 10) |
|
296 |
" |
|
6411 | 297 |
! ! |
298 |
||
7261 | 299 |
!Collection methodsFor:'Compatibility-Squeak'! |
5752
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
300 |
|
9354 | 301 |
addIfNotPresent:anObject |
7011 | 302 |
"Include anObject as one of the receiver's elements, but only if there |
303 |
is no such element already. Anwser anObject." |
|
304 |
||
305 |
(self includes: anObject) ifFalse: [self add: anObject]. |
|
306 |
^ anObject |
|
307 |
! |
|
308 |
||
6149 | 309 |
anyOne |
8858 | 310 |
"return any element from the collection. |
311 |
Report an error if there is none. |
|
6149 | 312 |
Same as #anElement - for Squeak compatibility" |
313 |
||
314 |
^ self anElement |
|
315 |
! |
|
316 |
||
9354 | 317 |
groupBy:keyBlock having:selectBlock |
9319 | 318 |
"Like in SQL operation - Split the recievers contents into collections of |
9354 | 319 |
elements for which keyBlock returns the same results, and return those |
320 |
collections allowed by selectBlock. " |
|
321 |
||
9319 | 322 |
|result key| |
323 |
result := OrderedDictionary new. |
|
324 |
self do: |
|
325 |
[:e | |
|
326 |
key := keyBlock value: e. |
|
327 |
(result includesKey: key) |
|
328 |
ifFalse: [result at: key put: OrderedCollection new]. |
|
329 |
(result at: key) |
|
330 |
add: e]. |
|
331 |
^ result := result select: selectBlock |
|
332 |
||
9354 | 333 |
" |
334 |
#(1 2 3 4 5 6 7 8 9) groupBy:[:e | e odd] having:[:a |true] |
|
335 |
" |
|
9319 | 336 |
! |
337 |
||
9065 | 338 |
ifEmpty:ifEmptyValue ifNotEmpty:ifNotEmptyValue |
339 |
|action| |
|
340 |
||
341 |
action := self isEmpty ifTrue:[ ifEmptyValue ] ifFalse:[ ifNotEmptyValue ]. |
|
342 |
||
343 |
action isBlock ifTrue:[ |
|
344 |
action numArgs == 1 ifTrue:[ |
|
345 |
^ action value:self |
|
346 |
] |
|
347 |
]. |
|
348 |
^ action value |
|
349 |
! |
|
350 |
||
351 |
ifEmpty:ifEmptyValue ifNotEmptyDo:ifNotEmptyValue |
|
352 |
^ self ifEmpty:ifEmptyValue ifNotEmpty:ifNotEmptyValue |
|
353 |
! |
|
354 |
||
355 |
ifEmptyDo:ifEmptyValue ifNotEmpty:ifNotEmptyValue |
|
356 |
^ self ifEmpty:ifEmptyValue ifNotEmpty:ifNotEmptyValue |
|
357 |
! |
|
358 |
||
359 |
ifNotEmpty:ifNotEmptyValue |
|
360 |
^ self ifEmpty:nil ifNotEmpty:ifNotEmptyValue |
|
361 |
! |
|
362 |
||
363 |
ifNotEmptyDo:ifNotEmptyValue |
|
364 |
^ self ifEmpty:nil ifNotEmpty:ifNotEmptyValue |
|
365 |
! |
|
366 |
||
367 |
ifNotEmptyDo:ifNotEmptyValue ifEmpty:ifEmptyValue |
|
368 |
^ self ifEmpty:ifEmptyValue ifNotEmpty:ifNotEmptyValue |
|
369 |
! |
|
370 |
||
11280 | 371 |
intersection:aCollection |
372 |
^ self intersect:aCollection |
|
373 |
||
374 |
"Created: / 22-10-2008 / 21:29:27 / cg" |
|
375 |
! |
|
376 |
||
5752
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
377 |
withIndexDo:aTwoArgBlock |
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
378 |
"evaluate the argument, aBlock for every element in the collection, |
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
379 |
passing both element and index as arguments." |
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
380 |
|
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
381 |
^ self keysAndValuesDo:[:key :index | |
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
382 |
aTwoArgBlock value:index value:key |
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
383 |
]. |
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
384 |
! ! |
66031c1d493a
added #withIndexDo: for Squeak compatibility
Claus Gittinger <cg@exept.de>
parents:
5651
diff
changeset
|
385 |
|
1 | 386 |
!Collection methodsFor:'accessing'! |
387 |
||
602 | 388 |
anElement |
6966 | 389 |
"return any element from the collection, |
390 |
report an error if there is none" |
|
602 | 391 |
|
392 |
self do: [:each | ^ each]. |
|
6511
0ca4f36b16ca
signal an error in #anElement if there is none;
Claus Gittinger <cg@exept.de>
parents:
6506
diff
changeset
|
393 |
self emptyCollectionError. |
602 | 394 |
! |
395 |
||
1369
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
396 |
atAll:indexCollection put:anObject |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
397 |
"put anObject into all indexes from indexCollection in the receiver. |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
398 |
This abstract implementation requires that the receiver supports |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
399 |
access via a key (and indexCollection contains valid keys). |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
400 |
|
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
401 |
Notice: This operation modifies the receiver, NOT a copy; |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
402 |
therefore the change may affect all others referencing the receiver." |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
403 |
|
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
404 |
indexCollection do:[:index | self at:index put:anObject] |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
405 |
|
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
406 |
" |
3469
2c7f6fc4685a
started args / returns comments.
Claus Gittinger <cg@exept.de>
parents:
3402
diff
changeset
|
407 |
args: indexCollection : <Collection of keys<object> > |
2c7f6fc4685a
started args / returns comments.
Claus Gittinger <cg@exept.de>
parents:
3402
diff
changeset
|
408 |
returns: self |
2c7f6fc4685a
started args / returns comments.
Claus Gittinger <cg@exept.de>
parents:
3402
diff
changeset
|
409 |
" |
2c7f6fc4685a
started args / returns comments.
Claus Gittinger <cg@exept.de>
parents:
3402
diff
changeset
|
410 |
|
2c7f6fc4685a
started args / returns comments.
Claus Gittinger <cg@exept.de>
parents:
3402
diff
changeset
|
411 |
" |
1369
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
412 |
(Array new:10) atAll:(1 to:5) put:0 |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
413 |
(Array new:10) atAll:#(1 5 6 9) put:0 |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
414 |
(Dictionary new) atAll:#(foo bar baz) put:'hello' |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
415 |
|
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
416 |
raises an error: |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
417 |
(Set new) atAll:#(foo bar baz) put:'hello' |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
418 |
" |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
419 |
|
3469
2c7f6fc4685a
started args / returns comments.
Claus Gittinger <cg@exept.de>
parents:
3402
diff
changeset
|
420 |
"Modified: / 20.5.1998 / 14:50:46 / cg" |
1369
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
421 |
! |
5e7b6fabd248
raised #atAll:put: up in the hierarchy
Claus Gittinger <cg@exept.de>
parents:
1359
diff
changeset
|
422 |
|
4985 | 423 |
fifth |
424 |
"return the fifth element of the collection. |
|
425 |
For unordered collections, this simply returns the fifth |
|
426 |
element when enumerating them. |
|
427 |
This should be redefined in subclasses." |
|
428 |
||
429 |
^ self nth:5 |
|
430 |
||
431 |
" |
|
432 |
#(1 2 3 4 5) fifth |
|
433 |
" |
|
434 |
! |
|
435 |
||
68 | 436 |
first |
437 |
"return the first element of the collection. |
|
4855 | 438 |
For unordered collections, this simply returns the first |
439 |
element when enumerating them. |
|
68 | 440 |
This should be redefined in subclasses." |
441 |
||
442 |
self do:[:e | ^ e]. |
|
443 |
||
444 |
"error if collection is empty" |
|
155 | 445 |
^ self emptyCollectionError |
68 | 446 |
! |
447 |
||
5887 | 448 |
first:n |
449 |
"return the n first elements of the collection. |
|
450 |
Raises an error if there are not enough elements in the receiver. |
|
451 |
For unordered collections, this simply returns the first |
|
452 |
n elements when enumerating them |
|
453 |
(Warning: the contents of the returned collection is not deterministic in this case). |
|
454 |
This should be redefined in subclasses." |
|
455 |
||
456 |
|coll remain| |
|
457 |
||
458 |
n < 0 ifTrue:[self error:'bad (negative) argument']. |
|
459 |
||
460 |
coll := OrderedCollection new. |
|
461 |
remain := n. |
|
462 |
self do:[:e | |
|
463 |
coll add:e. |
|
464 |
remain := remain - 1. |
|
465 |
remain == 0 ifTrue:[ |
|
466 |
^ coll |
|
467 |
]. |
|
468 |
]. |
|
469 |
||
470 |
"error if collection has not enough elements" |
|
471 |
^ self notEnoughElementsError |
|
472 |
||
473 |
" |
|
474 |
#(1 2 3 4 5) first:3 |
|
475 |
#(1 2 3 4 5) asSet first:3 |
|
476 |
" |
|
477 |
! |
|
478 |
||
936
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
479 |
firstIfEmpty:exceptionValue |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
480 |
"return the first element of the collection. |
10593 | 481 |
If its empty, return the exceptionValue. |
936
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
482 |
(i.e. dont trigger an error as done in #first)" |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
483 |
|
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
484 |
self isEmpty ifTrue:[^ exceptionValue value]. |
10593 | 485 |
^ self first |
486 |
||
487 |
"Modified: / 04-06-2007 / 22:36:14 / cg" |
|
488 |
! |
|
489 |
||
490 |
firstOrNil |
|
491 |
"return the first element of the collection. |
|
492 |
If its empty, return nil. |
|
493 |
(i.e. dont trigger an error as done in #first)" |
|
494 |
||
495 |
^ self firstIfEmpty:nil |
|
496 |
||
497 |
"Created: / 04-06-2007 / 22:36:07 / cg" |
|
936
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
498 |
! |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
499 |
|
4985 | 500 |
fourth |
501 |
"return the fourth element of the collection. |
|
502 |
For unordered collections, this simply returns the fourth |
|
503 |
element when enumerating them. |
|
504 |
This should be redefined in subclasses." |
|
505 |
||
506 |
^ self nth:4 |
|
507 |
||
508 |
" |
|
509 |
#(1 2 3 4) fourth |
|
510 |
" |
|
511 |
! |
|
512 |
||
68 | 513 |
last |
514 |
"return the last element of the collection. |
|
515 |
This should be redefined in subclasses." |
|
516 |
||
517 |
|theLastOne any| |
|
518 |
||
519 |
any := false. |
|
520 |
self do:[:e | any := true. theLastOne := e]. |
|
521 |
any ifTrue:[ |
|
6135 | 522 |
^ theLastOne |
68 | 523 |
]. |
524 |
||
525 |
"error if collection is empty" |
|
155 | 526 |
^ self emptyCollectionError |
68 | 527 |
! |
528 |
||
5887 | 529 |
last:n |
530 |
"return the n last elements of the collection. |
|
531 |
Raises an error if there are not enough elements in the receiver. |
|
532 |
For unordered collections, this simply returns the last |
|
533 |
n elements when enumerating them |
|
534 |
(Warning: the contents of the returned collection is not deterministic in this case). |
|
535 |
This should be redefined in subclasses since the implementation here is VERY inefficient." |
|
536 |
||
537 |
|coll remain| |
|
538 |
||
539 |
n < 0 ifTrue:[self error:'bad (negative) argument']. |
|
540 |
||
10798
18d87b8fce50
Clean up code and document differences between #add: and #addLast:
Stefan Vogel <sv@exept.de>
parents:
10795
diff
changeset
|
541 |
coll := OrderedCollection new:n. |
5887 | 542 |
remain := n. |
543 |
self do:[:e | |
|
544 |
remain > 0 ifTrue:[ |
|
545 |
remain := remain - 1. |
|
546 |
] ifFalse:[ |
|
547 |
coll removeFirst. |
|
548 |
]. |
|
10798
18d87b8fce50
Clean up code and document differences between #add: and #addLast:
Stefan Vogel <sv@exept.de>
parents:
10795
diff
changeset
|
549 |
coll add:e. |
5887 | 550 |
]. |
551 |
||
552 |
remain ~~ 0 ifTrue:[ |
|
553 |
"error if collection has not enough elements" |
|
554 |
^ self notEnoughElementsError |
|
555 |
]. |
|
556 |
^ coll |
|
557 |
||
558 |
" |
|
559 |
#(1 2 3 4 5) last:3 |
|
10798
18d87b8fce50
Clean up code and document differences between #add: and #addLast:
Stefan Vogel <sv@exept.de>
parents:
10795
diff
changeset
|
560 |
#(1 2 3 4 5 6 7 8 9 0) asSet last:3 |
5887 | 561 |
'hello world' last:5 |
562 |
" |
|
563 |
! |
|
564 |
||
936
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
565 |
lastIfEmpty:exceptionValue |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
566 |
"return the last element of the collection. |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
567 |
If its empty, return the exceptionValue. |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
568 |
(i.e. dont trigger an error as done in #last)" |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
569 |
|
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
570 |
self isEmpty ifTrue:[^ exceptionValue value]. |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
571 |
^ self last |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
572 |
|
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
573 |
"Modified: 6.2.1996 / 15:27:17 / cg" |
9054edb471b3
added #firstIfEmpty: / #lastIfEmpty:
Claus Gittinger <cg@exept.de>
parents:
628
diff
changeset
|
574 |
"Created: 6.2.1996 / 15:27:49 / cg" |
4855 | 575 |
! |
576 |
||
9073 | 577 |
median |
578 |
"Return the middle element, or as close as we can get." |
|
579 |
||
580 |
^ self asSortedCollection median |
|
581 |
||
582 |
" |
|
583 |
#(10 35 20 45 30 5) median |
|
584 |
" |
|
585 |
! |
|
586 |
||
4985 | 587 |
nth:n |
588 |
"return the nth element of the collection. |
|
589 |
For unordered collections, this simply returns the nth |
|
590 |
element when enumerating them. |
|
591 |
This should be redefined in subclasses." |
|
592 |
||
593 |
|count| |
|
594 |
||
595 |
count := 1. |
|
596 |
self do:[:e | |
|
597 |
count == n ifTrue:[^ e]. |
|
598 |
count := count + 1 |
|
599 |
]. |
|
600 |
||
5266 | 601 |
"error if collection is smaller" |
602 |
^ self notEnoughElementsError |
|
4985 | 603 |
|
604 |
" |
|
605 |
#(1 2 3 4) nth:3 |
|
5266 | 606 |
#(1 2 3 4) nth:5 |
607 |
||
608 |
#(1 2 3 4) asSet nth:3 |
|
609 |
#(1 2 3 4) asSet nth:5 |
|
4985 | 610 |
" |
611 |
! |
|
612 |
||
4855 | 613 |
second |
614 |
"return the second element of the collection. |
|
615 |
For unordered collections, this simply returns the second |
|
616 |
element when enumerating them. |
|
7129 | 617 |
This should be redefined in subclasses." |
618 |
||
619 |
^ self nth:2 |
|
4855 | 620 |
|
4856 | 621 |
" |
622 |
#(1 2 3) second |
|
623 |
" |
|
6135 | 624 |
! |
625 |
||
626 |
seventh |
|
627 |
"return the seventh element of the collection. |
|
628 |
For unordered collections, this simply returns the sixth |
|
629 |
element when enumerating them. |
|
630 |
This should be redefined in subclasses." |
|
631 |
||
632 |
^ self nth:7 |
|
633 |
||
634 |
" |
|
635 |
#(1 2 3 4 5 6 7) seventh |
|
636 |
" |
|
637 |
||
638 |
"Created: / 1.11.2001 / 16:43:29 / cg" |
|
4856 | 639 |
! |
640 |
||
4985 | 641 |
sixth |
642 |
"return the sixth element of the collection. |
|
643 |
For unordered collections, this simply returns the sixth |
|
644 |
element when enumerating them. |
|
645 |
This should be redefined in subclasses." |
|
646 |
||
647 |
^ self nth:6 |
|
648 |
||
649 |
" |
|
650 |
#(1 2 3 4 5 6 7) sixth |
|
651 |
" |
|
652 |
! |
|
653 |
||
4856 | 654 |
third |
655 |
"return the third element of the collection. |
|
656 |
For unordered collections, this simply returns the third |
|
657 |
element when enumerating them. |
|
658 |
This should be redefined in subclasses." |
|
659 |
||
4985 | 660 |
^ self nth:3 |
4856 | 661 |
|
662 |
||
663 |
" |
|
664 |
#(1 2 3) third |
|
665 |
" |
|
1 | 666 |
! ! |
667 |
||
668 |
!Collection methodsFor:'adding & removing'! |
|
669 |
||
670 |
add:anObject |
|
88 | 671 |
"add the argument, anObject to the receiver. |
672 |
If the receiver is ordered, the position of the new element is undefined |
|
7168
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
673 |
(i.e. don't depend on where it will be put). |
2351 | 674 |
An error is raised here - it is to be implemented by a concrete subclass." |
1 | 675 |
|
676 |
^ self subclassResponsibility |
|
2351 | 677 |
|
678 |
"Modified: 1.2.1997 / 11:57:08 / cg" |
|
1 | 679 |
! |
680 |
||
1373
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
681 |
add:newObject withOccurrences:anInteger |
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
682 |
"add the argument, anObject anInteger times to the receiver. |
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
683 |
Returns the object." |
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
684 |
|
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
685 |
anInteger timesRepeat:[self add:newObject]. |
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
686 |
^ newObject |
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
687 |
|
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
688 |
"Created: 11.5.1996 / 12:13:48 / cg" |
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
689 |
! |
2c7cab1a4a2e
oops - typo; occurrences has two r's
Claus Gittinger <cg@exept.de>
parents:
1370
diff
changeset
|
690 |
|
1 | 691 |
addAll:aCollection |
1163 | 692 |
"add all elements of the argument, aCollection to the receiver. |
7752 | 693 |
Returns the argument, aCollection (sigh)." |
1 | 694 |
|
695 |
aCollection do:[:element | |
|
1163 | 696 |
self add:element |
1 | 697 |
]. |
698 |
^ aCollection |
|
88 | 699 |
|
700 |
" |
|
701 |
#(1 2 3 4) copy addAll:#(5 6 7 8) |
|
702 |
#(1 2 3 4) asOrderedCollection addAll:#(5 6 7 8) |
|
703 |
" |
|
1163 | 704 |
|
705 |
"Modified: 12.4.1996 / 13:29:20 / cg" |
|
1 | 706 |
! |
707 |
||
12 | 708 |
addAllFirst:aCollection |
709 |
"insert all elements of the argument, aCollection at the beginning |
|
1163 | 710 |
of the receiver. Returns the argument, aCollection." |
12 | 711 |
|
712 |
aCollection reverseDo:[:element | |
|
1163 | 713 |
self addFirst:element |
12 | 714 |
]. |
715 |
^ aCollection |
|
716 |
||
717 |
" |
|
718 |
|c| |
|
719 |
c := #(4 3 2 1) asOrderedCollection. |
|
1163 | 720 |
c addAllFirst:#(9 8 7 6 5). |
721 |
c |
|
12 | 722 |
" |
1163 | 723 |
|
724 |
"Modified: 12.4.1996 / 13:30:10 / cg" |
|
12 | 725 |
! |
726 |
||
602 | 727 |
addAllLast:aCollection |
1163 | 728 |
"add all elements of the argument, aCollection to the receiver. |
729 |
Returns the argument, aCollection." |
|
602 | 730 |
|
731 |
aCollection do:[:element | |
|
1163 | 732 |
self addLast:element |
602 | 733 |
]. |
734 |
^ aCollection |
|
735 |
||
736 |
" |
|
737 |
|c| |
|
738 |
c := #(4 3 2 1) asOrderedCollection. |
|
739 |
c addAllLast:#(9 8 7 6 5) |
|
740 |
" |
|
1163 | 741 |
|
742 |
"Modified: 12.4.1996 / 13:30:54 / cg" |
|
602 | 743 |
! |
744 |
||
745 |
addFirst:anObject |
|
746 |
"add the argument, anObject to the receiver. |
|
2351 | 747 |
If the receiver is ordered, the new element will be added at the beginning. |
748 |
An error is raised here - it is to be implemented by a concrete subclass." |
|
1 | 749 |
|
750 |
^ self subclassResponsibility |
|
2351 | 751 |
|
752 |
"Modified: 1.2.1997 / 11:57:19 / cg" |
|
1 | 753 |
! |
754 |
||
602 | 755 |
addLast:anObject |
756 |
"add the argument, anObject to the receiver. |
|
1163 | 757 |
If the receiver is ordered, the new element will be added at the end. |
10798
18d87b8fce50
Clean up code and document differences between #add: and #addLast:
Stefan Vogel <sv@exept.de>
parents:
10795
diff
changeset
|
758 |
Return the argument, anObject. |
18d87b8fce50
Clean up code and document differences between #add: and #addLast:
Stefan Vogel <sv@exept.de>
parents:
10795
diff
changeset
|
759 |
|
18d87b8fce50
Clean up code and document differences between #add: and #addLast:
Stefan Vogel <sv@exept.de>
parents:
10795
diff
changeset
|
760 |
This usually has the same semantics as #add:. |
18d87b8fce50
Clean up code and document differences between #add: and #addLast:
Stefan Vogel <sv@exept.de>
parents:
10795
diff
changeset
|
761 |
OrderedSet and OrderedDictionary redefine this, to move anObject to |
18d87b8fce50
Clean up code and document differences between #add: and #addLast:
Stefan Vogel <sv@exept.de>
parents:
10795
diff
changeset
|
762 |
the end, even if it is already present in the collection." |
602 | 763 |
|
764 |
^ self add:anObject |
|
1163 | 765 |
|
766 |
"Modified: 12.4.1996 / 13:31:12 / cg" |
|
602 | 767 |
! |
768 |
||
3124 | 769 |
contents:aCollection |
3767
bbf560999d90
care for nil arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
3469
diff
changeset
|
770 |
"set my contents from aCollection |
5265 | 771 |
- this may be redefined in a concrete subclass for more performance" |
3124 | 772 |
|
6042
04414166010e
check for bad arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
5887
diff
changeset
|
773 |
aCollection == self ifTrue:[ |
04414166010e
check for bad arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
5887
diff
changeset
|
774 |
"/ self error:'should not happen'. |
04414166010e
check for bad arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
5887
diff
changeset
|
775 |
^ self |
04414166010e
check for bad arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
5887
diff
changeset
|
776 |
]. |
04414166010e
check for bad arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
5887
diff
changeset
|
777 |
|
3767
bbf560999d90
care for nil arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
3469
diff
changeset
|
778 |
self removeAll. |
bbf560999d90
care for nil arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
3469
diff
changeset
|
779 |
aCollection notNil ifTrue:[ |
bbf560999d90
care for nil arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
3469
diff
changeset
|
780 |
self addAll:aCollection |
bbf560999d90
care for nil arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
3469
diff
changeset
|
781 |
] |
3124 | 782 |
|
3767
bbf560999d90
care for nil arg in #contents:
Claus Gittinger <cg@exept.de>
parents:
3469
diff
changeset
|
783 |
"Modified: / 17.8.1998 / 10:18:43 / cg" |
3124 | 784 |
! |
785 |
||
1 | 786 |
remove:anObject |
2351 | 787 |
"search for the first element, which is equal to anObject; |
788 |
if found, remove and return it. |
|
789 |
If not found, report a 'value not found'-error. |
|
790 |
Uses equality compare (=) to search for the occurrence." |
|
1 | 791 |
|
1163 | 792 |
^ self remove:anObject ifAbsent:[self errorValueNotFound:anObject] |
793 |
||
2351 | 794 |
"Modified: 1.2.1997 / 11:58:48 / cg" |
1 | 795 |
! |
796 |
||
602 | 797 |
remove:anObject ifAbsent:exceptionBlock |
2351 | 798 |
"search for the first element, which is equal to anObject; |
799 |
if found, remove and return it. |
|
800 |
If not found, return the the value of the exceptionBlock. |
|
801 |
Uses equality compare (=) to search for the occurrence. |
|
802 |
An error is raised here - it is to be implemented by a concrete subclass." |
|
602 | 803 |
|
804 |
^ self subclassResponsibility |
|
2351 | 805 |
|
806 |
"Modified: 1.2.1997 / 11:56:53 / cg" |
|
602 | 807 |
! |
808 |
||
134 | 809 |
removeAll |
1163 | 810 |
"remove all elements from the receiver. Returns the receiver. |
134 | 811 |
This should be reimplemented in subclasses for better |
812 |
performance." |
|
813 |
||
2383 | 814 |
[self isEmpty] whileFalse:[ |
1163 | 815 |
self removeFirst |
134 | 816 |
]. |
1163 | 817 |
|
2383 | 818 |
"Modified: 12.2.1997 / 12:40:29 / cg" |
134 | 819 |
! |
820 |
||
1 | 821 |
removeAll:aCollection |
360 | 822 |
"remove all elements of the argument, aCollection from the receiver. |
1163 | 823 |
Return the argument, aCollection. |
5267 | 824 |
Raises an error, if some element-to-remove is not in the receiver. |
825 |
(see also: #removeAllFoundIn:, which does not raise an error). |
|
1163 | 826 |
|
360 | 827 |
Notice: for some collections (those not tuned for |
1163 | 828 |
resizing themself) this may be very slow. |
829 |
If the number of removed elements is big compared to to |
|
830 |
the receivers size, it may be better to copy the |
|
831 |
ones which are not to be removed into a new collection." |
|
1 | 832 |
|
833 |
aCollection do:[:element | self remove:element]. |
|
834 |
^ aCollection |
|
1163 | 835 |
|
5268 | 836 |
" |
837 |
|coll| |
|
838 |
||
839 |
coll := #(1 2 3 4 5 6) asSet. |
|
840 |
coll removeAll:#(4 5 6). |
|
841 |
coll |
|
842 |
" |
|
843 |
||
844 |
"raises an error: |
|
845 |
|coll| |
|
846 |
||
847 |
coll := #(1 2 3 4 5 6) asSet. |
|
848 |
coll removeAll:#(4 5 6 7 8). |
|
849 |
coll |
|
850 |
" |
|
851 |
||
852 |
"no error raised: |
|
853 |
|coll| |
|
854 |
||
855 |
coll := #(1 2 3 4 5 6) asSet. |
|
856 |
coll removeAllFoundIn:#(4 5 6 7 8). |
|
857 |
coll |
|
858 |
" |
|
859 |
||
860 |
||
348 | 861 |
! |
862 |
||
5265 | 863 |
removeAllFoundIn:aCollection |
5267 | 864 |
"Remove each element of aCollection, which is present in the receiver |
865 |
from the receiver. |
|
866 |
No error is raised, if some element-to-remove is not in the receiver. |
|
867 |
(see also: #removeAll:, which does raise an error)." |
|
4980 | 868 |
|
869 |
aCollection do:[:each | self remove:each ifAbsent:[]]. |
|
5265 | 870 |
^ aCollection |
5268 | 871 |
|
872 |
" |
|
873 |
|coll| |
|
874 |
||
875 |
coll := #(1 2 3 4 5 6) asSet. |
|
876 |
coll removeAllFoundIn:#(4 5 6 7 8). |
|
877 |
coll |
|
878 |
" |
|
879 |
||
880 |
"raises an error: |
|
881 |
|coll| |
|
882 |
||
883 |
coll := #(1 2 3 4 5 6) asSet. |
|
884 |
coll removeAll:#(4 5 6 7 8). |
|
885 |
coll |
|
886 |
" |
|
887 |
||
4980 | 888 |
! |
889 |
||
5265 | 890 |
removeAllSuchThat:aBlock |
4980 | 891 |
"Apply the condition to each element and remove it if the condition is true. |
5265 | 892 |
Return a collection of removed elements. |
5267 | 893 |
First elements-to-remove are collected, then removed in one operation." |
4980 | 894 |
|
5267 | 895 |
|removedElements| |
4980 | 896 |
|
5267 | 897 |
removedElements := OrderedCollection new. |
898 |
self do:[:element | |
|
4980 | 899 |
(aBlock value:element) ifTrue: [ |
5267 | 900 |
removedElements add:element |
4980 | 901 |
] |
902 |
]. |
|
5267 | 903 |
self removeAll:removedElements. |
904 |
^ removedElements |
|
905 |
||
906 |
" |
|
907 |
|coll| |
|
908 |
||
909 |
coll := #(1 2 3 4 5 6 7 8 9 10) asOrderedCollection. |
|
910 |
coll removeAllSuchThat:[:el | el even]. |
|
911 |
coll |
|
912 |
" |
|
913 |
" |
|
914 |
|coll| |
|
915 |
||
916 |
coll := #(1 2 3 4 5 6 7 8 9 10) asSet. |
|
917 |
coll removeAllSuchThat:[:el | el even]. |
|
918 |
coll |
|
919 |
" |
|
920 |
||
4980 | 921 |
! |
922 |
||
348 | 923 |
removeFirst |
924 |
"remove the first element from the receiver. |
|
925 |
Return the removed element." |
|
926 |
||
1561
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
927 |
self do:[:element | |
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
928 |
self remove:element. |
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
929 |
^ element. |
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
930 |
]. |
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
931 |
^ self emptyCollectionError |
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
932 |
|
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
933 |
" |
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
934 |
(Set with:3 with:2 with:1) removeFirst |
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
935 |
" |
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
936 |
|
1f64a9b522c2
at least a suboptimal #removeFirst: can be provided by Collection
Claus Gittinger <cg@exept.de>
parents:
1422
diff
changeset
|
937 |
"Modified: 28.6.1996 / 18:55:33 / cg" |
348 | 938 |
! |
939 |
||
940 |
removeFirst:n |
|
941 |
"remove the first n elements from the receiver. |
|
5265 | 942 |
Return a collection of removed elements. |
360 | 943 |
Notice: for some collections (those not tuned for |
5265 | 944 |
resizing themself) this may be very slow." |
348 | 945 |
|
946 |
|ret| |
|
947 |
||
948 |
self size < n ifTrue:[ |
|
5265 | 949 |
^ self notEnoughElementsError |
348 | 950 |
]. |
951 |
ret := Array new:n. |
|
952 |
1 to:n do:[:i | |
|
5265 | 953 |
ret at:i put:(self removeFirst). |
348 | 954 |
]. |
955 |
^ ret |
|
956 |
! |
|
957 |
||
2351 | 958 |
removeIdentical:anObject |
959 |
"search for the first element, which is identical to anObject; |
|
960 |
if found, remove and return it. |
|
961 |
If not found, report a 'value not found'-error. |
|
962 |
Uses identity compare (==) to search for the occurrence." |
|
963 |
||
964 |
^ self removeIdentical:anObject ifAbsent:[self errorValueNotFound:anObject] |
|
965 |
||
966 |
"Modified: 12.4.1996 / 13:33:30 / cg" |
|
967 |
"Created: 1.2.1997 / 11:59:10 / cg" |
|
968 |
! |
|
969 |
||
970 |
removeIdentical:anObject ifAbsent:exceptionBlock |
|
971 |
"search for the first element, which is identical to anObject; |
|
972 |
if found, remove and return it. |
|
973 |
If not found, return the the value of the exceptionBlock. |
|
974 |
Uses identity compare (==) to search for the occurrence. |
|
975 |
An error is raised here - it is to be implemented by a concrete subclass." |
|
976 |
||
977 |
^ self subclassResponsibility |
|
978 |
||
979 |
"Created: 1.2.1997 / 11:56:01 / cg" |
|
980 |
"Modified: 1.2.1997 / 11:56:59 / cg" |
|
981 |
! |
|
982 |
||
602 | 983 |
removeLast |
984 |
"remove the last element from the receiver. |
|
2351 | 985 |
Return the removed element. |
986 |
An error is raised here - it is to be implemented by a concrete subclass." |
|
602 | 987 |
|
988 |
^ self subclassResponsibility |
|
2351 | 989 |
|
990 |
"Modified: 1.2.1997 / 11:57:53 / cg" |
|
602 | 991 |
! |
992 |
||
348 | 993 |
removeLast:n |
11331 | 994 |
"remove the last n elements from the receiver collection. |
5265 | 995 |
Return a collection of removed elements. |
11331 | 996 |
Notice: for some collections this may be very slow |
997 |
(those not tuned for resizing themself)." |
|
348 | 998 |
|
999 |
|ret| |
|
1000 |
||
1001 |
self size < n ifTrue:[ |
|
5265 | 1002 |
^ self notEnoughElementsError |
348 | 1003 |
]. |
1004 |
ret := Array new:n. |
|
1005 |
n to:1 by:-1 do:[:i | |
|
5265 | 1006 |
ret at:i put:(self removeLast). |
348 | 1007 |
]. |
1008 |
^ ret |
|
1 | 1009 |
! ! |
1010 |
||
8858 | 1011 |
!Collection methodsFor:'bulk operations'! |
1012 |
||
11468 | 1013 |
product |
8858 | 1014 |
"sum up all elements. |
1015 |
This is implemented using a variant of the normal inject:into: pattern. |
|
1016 |
The reason for this is that it is not known whether we're in the normal |
|
1017 |
number line, i.e. whether 0 is a good initial value for the sum. |
|
1018 |
Consider a collection of measurement objects, 0 would be the unitless |
|
1019 |
value and would not be appropriate to add with the unit-ed objects." |
|
1020 |
||
11468 | 1021 |
self emptyCheck. |
1022 |
^ self |
|
11469 | 1023 |
inject:(self first class unity) |
1024 |
into:[:accum :each | accum * each]. |
|
8858 | 1025 |
|
1026 |
" |
|
11468 | 1027 |
TestCase should:[ Array new sum ] raise:Error. |
1028 |
||
1029 |
TestCase assert:( { 1 } product == 1). |
|
1030 |
TestCase assert:( { 6 } product == 6). |
|
1031 |
TestCase assert:( { 1. 2. 3. 4. 5. } product = 5 factorial ) |
|
1032 |
" |
|
1033 |
! |
|
1034 |
||
1035 |
sum |
|
1036 |
"sum up all elements. |
|
1037 |
This is implemented using a variant of the normal inject:into: pattern. |
|
1038 |
The reason for this is that it is not known whether we are dealing with number |
|
1039 |
(i.e. if 0 is a good initial value for the sum). |
|
1040 |
Consider a collection of measurement or physical objects, 0 would be the unitless |
|
1041 |
value and would not be appropriate to add with the unit-ed objects." |
|
1042 |
||
1043 |
self emptyCheck. |
|
1044 |
^ self |
|
1045 |
inject:(self first class zero) |
|
1046 |
into:[:accum :each | accum + each]. |
|
1047 |
||
1048 |
||
1049 |
" |
|
1050 |
TestCase should: [ { } sum ] raise:Error. |
|
1051 |
TestCase should: [ '' sum ] raise:Error. |
|
1052 |
||
1053 |
TestCase assert: ( { 1 } sum = 1 ). |
|
1054 |
TestCase assert: ( { 1. 2. 3. 4. } sum = 10 ). |
|
1055 |
TestCase assert: ( (1 to:10) sum = 55 ). |
|
1056 |
TestCase assert: ( 'abc' asByteArray sum = 294 ). |
|
1057 |
TestCase assert: ( { 10 +/- 2. |
|
1058 |
20 +/- 4. |
|
1059 |
100 +/- 10 } sum = (130 +/- 16) ). |
|
1060 |
||
1061 |
TestCase assert: ( { (1 / 9). |
|
1062 |
(1 / 7). |
|
1063 |
} sum = (16 / 63) ). |
|
8858 | 1064 |
" |
1065 |
! ! |
|
1066 |
||
602 | 1067 |
!Collection methodsFor:'converting'! |
1068 |
||
1069 |
asArray |
|
1070 |
"return a new Array with the collections elements" |
|
1071 |
||
1072 |
|anArray |
|
1073 |
index "{ Class: SmallInteger }" | |
|
1 | 1074 |
|
602 | 1075 |
anArray := Array new:(self size). |
1076 |
index := 1. |
|
1077 |
self do:[:each | |
|
6135 | 1078 |
anArray at:index put:each. |
1079 |
index := index + 1 |
|
602 | 1080 |
]. |
1081 |
^ anArray |
|
1 | 1082 |
! |
1083 |
||
602 | 1084 |
asBag |
1085 |
"return a new Bag with the receiver collections elements" |
|
1 | 1086 |
|
602 | 1087 |
^ self addAllTo:(Bag new) |
1 | 1088 |
! |
1089 |
||
602 | 1090 |
asByteArray |
1091 |
"return a new ByteArray with the collections elements |
|
1092 |
(which must convert to integers in the range 0..255)." |
|
1 | 1093 |
|
602 | 1094 |
|aByteArray |
1095 |
index "{ Class: SmallInteger }" | |
|
1 | 1096 |
|
602 | 1097 |
aByteArray := ByteArray new:(self size). |
1098 |
index := 1. |
|
1099 |
self do:[:each | |
|
6135 | 1100 |
aByteArray at:index put:each asInteger. |
1101 |
index := index + 1 |
|
602 | 1102 |
]. |
1103 |
^ aByteArray |
|
1 | 1104 |
! |
1105 |
||
5607
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1106 |
asCollection |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1107 |
"return myself as a Collection. |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1108 |
I am already a Collection." |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1109 |
|
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1110 |
^ self |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1111 |
|
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1112 |
|
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1113 |
! |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1114 |
|
7906 | 1115 |
asDictionary |
1116 |
"return a new Dictionary with the receiver collections elements" |
|
1117 |
||
1118 |
|d| |
|
1119 |
||
1120 |
d := Dictionary new. |
|
1121 |
self keysAndValuesDo:[:k :v | d at:k put:v]. |
|
1122 |
^ d |
|
1123 |
||
1124 |
" |
|
1125 |
#(10 20 30 40 50 60 70 80 90) asDictionary |
|
1126 |
" |
|
1127 |
! |
|
1128 |
||
602 | 1129 |
asDoubleArray |
1130 |
"return a new DoubleArray with the collections elements |
|
1131 |
(which must convert to floats)." |
|
1132 |
||
1133 |
|aDoubleArray |
|
1134 |
index "{ Class: SmallInteger }" | |
|
1135 |
||
1136 |
aDoubleArray := DoubleArray new:(self size). |
|
1137 |
index := 1. |
|
1138 |
self do:[:each | |
|
6135 | 1139 |
aDoubleArray at:index put:each asFloat. |
1140 |
index := index + 1 |
|
602 | 1141 |
]. |
1142 |
^ aDoubleArray |
|
1143 |
! |
|
68 | 1144 |
|
11412 | 1145 |
asFlatOrderedCollection |
1146 |
|coll| |
|
1147 |
||
1148 |
coll := OrderedCollection new. |
|
1149 |
self flatDo:[:el | coll add:el]. |
|
1150 |
^ coll. |
|
1151 |
||
1152 |
" |
|
1153 |
#( |
|
1154 |
(1 2 3) |
|
1155 |
4 5 |
|
1156 |
(6) |
|
1157 |
7 |
|
1158 |
(8 (9 10) 11 12 (13 (14 (15) 16)))) asFlatOrderedCollection |
|
1159 |
" |
|
1160 |
! |
|
1161 |
||
602 | 1162 |
asFloatArray |
1163 |
"return a new FloatArray with the collections elements |
|
1164 |
(which must convert to floats)." |
|
1165 |
||
1166 |
|aFloatArray |
|
1167 |
index "{ Class: SmallInteger }" | |
|
1168 |
||
1169 |
aFloatArray := FloatArray new:(self size). |
|
1170 |
index := 1. |
|
1171 |
self do:[:each | |
|
6135 | 1172 |
aFloatArray at:index put:each asFloat. |
1173 |
index := index + 1 |
|
602 | 1174 |
]. |
1175 |
^ aFloatArray |
|
1176 |
! |
|
1177 |
||
1178 |
asIdentitySet |
|
1179 |
"return a new IdentitySet with the receiver collections elements" |
|
1180 |
||
10795
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1181 |
^ self addAllNonNilElementsTo:(IdentitySet new:self size) |
68 | 1182 |
! |
1183 |
||
2167 | 1184 |
asList |
1185 |
"return a new List with the receiver collections elements" |
|
1186 |
||
1187 |
^ self addAllTo:(List new:self size) |
|
1188 |
||
1189 |
"Created: 14.2.1997 / 16:25:23 / cg" |
|
1190 |
! |
|
1191 |
||
8050 | 1192 |
asLongIntegerArray |
1193 |
"return a new LongIntegerArray with the collections elements |
|
1194 |
(which must convert to integers in the range 0..16rFFFFFFFF)." |
|
1195 |
||
1196 |
|aLongWordArray |
|
1197 |
index "{ Class: SmallInteger }" | |
|
1198 |
||
1199 |
aLongWordArray := LongIntegerArray new:(self size). |
|
1200 |
index := 1. |
|
1201 |
self do:[:each | |
|
1202 |
aLongWordArray at:index put:each asInteger. |
|
1203 |
index := index + 1 |
|
1204 |
]. |
|
1205 |
^ aLongWordArray |
|
1206 |
! |
|
1207 |
||
602 | 1208 |
asOrderedCollection |
1209 |
"return a new OrderedCollection with the receiver collections elements" |
|
1210 |
||
1211 |
^ self addAllTo:(OrderedCollection new:self size) |
|
1212 |
! |
|
1213 |
||
11469 | 1214 |
asRunArray |
1215 |
"return a new RunArray with the collections elements" |
|
1216 |
||
1217 |
^ RunArray from:self. |
|
1218 |
||
1219 |
"/ |runs lastElement occurrences| |
|
1220 |
"/ |
|
1221 |
"/ runs := RunArray new. |
|
1222 |
"/ occurrences := 0. |
|
1223 |
"/ self do:[:each | |
|
1224 |
"/ each == lastElement ifTrue:[ |
|
1225 |
"/ occurrences := occurrences + 1 |
|
1226 |
"/ ] ifFalse:[ |
|
1227 |
"/ runs add:lastElement withOccurrences:occurrences. |
|
1228 |
"/ occurrences := 1. |
|
1229 |
"/ lastElement := each |
|
1230 |
"/ ]. |
|
1231 |
"/ ]. |
|
1232 |
"/ occurrences ~~ 0 ifTrue:[ |
|
1233 |
"/ runs add:lastElement withOccurrences:occurrences |
|
1234 |
"/ ]. |
|
1235 |
"/ ^ runs |
|
1394 | 1236 |
|
1237 |
" |
|
11469 | 1238 |
#(1 2 3 3 3 4 4 4 4 5 6 7) asRunArray |
1394 | 1239 |
" |
11469 | 1240 |
|
1241 |
"Modified: / 7.4.1998 / 09:50:54 / cg" |
|
1394 | 1242 |
! |
1243 |
||
5607
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1244 |
asSequenceableCollection |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1245 |
"return myself as a SequenceableCollection. |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1246 |
I am already a Collection, but not sequenceable." |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1247 |
|
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1248 |
^ self asArray |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1249 |
|
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1250 |
|
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1251 |
! |
94c690ba0dea
Define #asCollection, #asSequenceableCollection
Stefan Vogel <sv@exept.de>
parents:
5557
diff
changeset
|
1252 |
|
602 | 1253 |
asSet |
1254 |
"return a new Set with the receiver collections elements" |
|
1255 |
||
10795
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1256 |
^ self addAllNonNilElementsTo:(Set new:self size) |
602 | 1257 |
! |
1258 |
||
9353 | 1259 |
asSharedCollection |
1260 |
"return a shared collection on the receiver. |
|
1261 |
This implements synchronized access to me." |
|
1262 |
||
1263 |
^ SharedCollection for:self. |
|
1264 |
! |
|
1265 |
||
602 | 1266 |
asSortedCollection |
1267 |
"return a new SortedCollection with the receiver collections elements" |
|
1 | 1268 |
|
602 | 1269 |
|aSortedCollection| |
1270 |
||
1271 |
aSortedCollection := SortedCollection new:self size. |
|
1272 |
aSortedCollection addAll:self. |
|
1273 |
^ aSortedCollection |
|
1274 |
! |
|
1275 |
||
1276 |
asSortedCollection:sortBlock |
|
1277 |
"return a new SortedCollection with the receiver collections elements, |
|
1278 |
using sortBlock for comparing" |
|
1279 |
||
1280 |
|aSortedCollection| |
|
1281 |
||
1282 |
aSortedCollection := SortedCollection sortBlock:sortBlock. |
|
1283 |
aSortedCollection addAll:self. |
|
1284 |
^ aSortedCollection |
|
1 | 1285 |
! |
1286 |
||
2919 | 1287 |
asSortedStrings |
1288 |
"Create & return a SortedCollection that sorts the receivers |
|
1289 |
elements according to the locales collating policy. |
|
1290 |
This is currently not really support - strings are sorted |
|
1291 |
without caring for the locale." |
|
1292 |
||
1293 |
|aSortedCollection| |
|
1294 |
||
1295 |
aSortedCollection := SortedCollection forStrings:self size. |
|
1296 |
aSortedCollection addAll:self. |
|
1297 |
^ aSortedCollection |
|
1298 |
||
1299 |
"Created: 13.9.1997 / 09:36:22 / cg" |
|
1300 |
"Modified: 13.9.1997 / 09:43:00 / cg" |
|
1301 |
! |
|
1302 |
||
1303 |
asSortedStrings:sortBlock |
|
1304 |
"Create & return a SortedCollection that sorts the receivers |
|
3061 | 1305 |
elements using sortBlock and according to the locales collating policy, |
1306 |
which is passed as first arg to sortBlock. |
|
2919 | 1307 |
This is currently not really support - strings are sorted |
1308 |
without caring for the locale." |
|
1309 |
||
1310 |
|aSortedCollection| |
|
1311 |
||
1312 |
aSortedCollection := SortedCollection forStrings:self size. |
|
1313 |
aSortedCollection sortBlock:sortBlock. |
|
1314 |
aSortedCollection addAll:self. |
|
1315 |
^ aSortedCollection |
|
1316 |
||
3061 | 1317 |
"Created: / 13.9.1997 / 09:36:45 / cg" |
1318 |
"Modified: / 27.10.1997 / 16:39:48 / cg" |
|
2919 | 1319 |
! |
1320 |
||
1321 |
asSortedStrings:sortBlock with:aCollationPolicy |
|
1322 |
"Create & return a SortedCollection that sorts the receivers |
|
1323 |
elements using sortBlock and according to the specified locales collating policy. |
|
1324 |
This is currently not really support - strings are sorted |
|
1325 |
without caring for the locale." |
|
1326 |
||
1327 |
|aSortedCollection| |
|
1328 |
||
1329 |
aSortedCollection := SortedCollection forStrings:self size collatedBy:aCollationPolicy. |
|
1330 |
aSortedCollection sortBlock:sortBlock. |
|
1331 |
aSortedCollection addAll:self. |
|
1332 |
^ aSortedCollection |
|
1333 |
||
1334 |
"Created: 13.9.1997 / 09:37:21 / cg" |
|
1335 |
"Modified: 13.9.1997 / 09:45:27 / cg" |
|
1336 |
! |
|
1337 |
||
1338 |
asSortedStringsWith: aCollationPolicy |
|
1339 |
"Create & return a SortedCollection that sorts the receivers |
|
1340 |
elements according to the specified locales collating policy. |
|
1341 |
This is currently not really support - strings are sorted |
|
1342 |
without caring for the locale." |
|
1343 |
||
1344 |
|aSortedCollection| |
|
1345 |
||
1346 |
aSortedCollection := SortedCollection forStrings:self size collatedBy:aCollationPolicy. |
|
1347 |
aSortedCollection addAll:self. |
|
1348 |
^ aSortedCollection |
|
1349 |
||
1350 |
"Created: 13.9.1997 / 09:37:50 / cg" |
|
1351 |
"Modified: 13.9.1997 / 09:44:08 / cg" |
|
1352 |
! |
|
1353 |
||
602 | 1354 |
asString |
1355 |
"return a String with the collections elements |
|
1356 |
(which must convert to characters)" |
|
1357 |
||
1358 |
|aString |
|
1359 |
index "{ Class: SmallInteger }" | |
|
360 | 1360 |
|
602 | 1361 |
aString := String new:(self size). |
1362 |
index := 1. |
|
1363 |
self do:[:each | |
|
6135 | 1364 |
aString at:index put:each asCharacter. |
1365 |
index := index + 1 |
|
360 | 1366 |
]. |
602 | 1367 |
^ aString |
1368 |
! |
|
1369 |
||
1370 |
asStringCollection |
|
1413 | 1371 |
"return a new string collection containing the elements; |
1372 |
these ought to be strings. (i.e. String or Text instances)" |
|
602 | 1373 |
|
1374 |
^ self addAllTo:(StringCollection new) |
|
1413 | 1375 |
|
1376 |
"Modified: 18.5.1996 / 13:54:34 / cg" |
|
360 | 1377 |
! |
1378 |
||
8160 | 1379 |
asUnicodeString |
1380 |
"return a String with the collections elements |
|
1381 |
(which must convert to characters)" |
|
1382 |
||
1383 |
|aString |
|
1384 |
index "{ Class: SmallInteger }" | |
|
1385 |
||
1386 |
aString := UnicodeString uninitializedNew:self size. |
|
1387 |
index := 1. |
|
1388 |
self do:[:each | |
|
1389 |
aString at:index put:each asCharacter. |
|
1390 |
index := index + 1 |
|
1391 |
]. |
|
1392 |
^ aString |
|
1393 |
||
1394 |
" |
|
1395 |
#(16r440 16r443 16r441 16r441 16r43A 16r438 16r439 16r20 16r44F 16r437 16r44B 16r43A) asUnicodeString |
|
1396 |
" |
|
1397 |
! |
|
1398 |
||
7885 | 1399 |
asWordArray |
1400 |
"return a new WordArray with the collections elements |
|
1401 |
(which must convert to integers in the range 0..16rFFFF)." |
|
1402 |
||
1403 |
|aWordArray |
|
1404 |
index "{ Class: SmallInteger }" | |
|
1405 |
||
1406 |
aWordArray := WordArray new:(self size). |
|
1407 |
index := 1. |
|
1408 |
self do:[:each | |
|
1409 |
aWordArray at:index put:each asInteger. |
|
1410 |
index := index + 1 |
|
1411 |
]. |
|
1412 |
^ aWordArray |
|
1413 |
! |
|
1414 |
||
7905 | 1415 |
keysAndValues |
1416 |
|assocs| |
|
1417 |
||
1418 |
assocs := OrderedCollection new. |
|
1419 |
self keysAndValuesDo:[:k :v | |
|
1420 |
assocs add:(k -> v). |
|
1421 |
]. |
|
1422 |
^ assocs. |
|
1423 |
||
1424 |
" |
|
1425 |
#(10 20 30 40 50 60) keysAndValues |
|
1426 |
" |
|
1427 |
! |
|
1428 |
||
9410 | 1429 |
literalArrayEncoding |
1430 |
"encode myself as an array literal, from which a copy of the receiver |
|
1431 |
can be reconstructed with #decodeAsLiteralArray." |
|
1432 |
||
1433 |
|encoding idx| |
|
1434 |
||
1435 |
encoding := Array new:self size + 1. |
|
1436 |
encoding at:1 put:self class name. |
|
1437 |
idx := 2. |
|
1438 |
self do:[:element| |
|
11315
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
1439 |
encoding at:idx put:element literalArrayEncoding. |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
1440 |
idx := idx + 1. |
9410 | 1441 |
]. |
1442 |
^ encoding |
|
1443 |
||
1444 |
||
1445 |
" |
|
1446 |
(Array with:(Color red:50 green:50 blue:50) |
|
11315
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
1447 |
with:(1 @ 2) |
9410 | 1448 |
) literalArrayEncoding decodeAsLiteralArray |
1449 |
" |
|
1450 |
||
1451 |
"Modified: 22.4.1996 / 13:00:56 / cg" |
|
1452 |
! |
|
1453 |
||
602 | 1454 |
readStream |
1455 |
"return a stream for reading from the receiver" |
|
1456 |
||
1457 |
^ ReadStream on:self |
|
88 | 1458 |
|
1459 |
" |
|
602 | 1460 |
|s| |
1461 |
||
1462 |
s := 'hello world' readStream. |
|
1463 |
s next:5. |
|
1464 |
s next. |
|
1465 |
(s next:5) inspect |
|
88 | 1466 |
" |
1 | 1467 |
! |
1468 |
||
8140
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1469 |
readStreamOrNil |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1470 |
"return a stream for reading from the receiver. |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1471 |
This has been defined for protocol compatibility with FileName, |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1472 |
but nil is never returned here" |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1473 |
|
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1474 |
^ self readStream |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1475 |
! |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1476 |
|
8631 | 1477 |
readWriteStream |
1478 |
"return a stream for reading and writing from/to the receiver" |
|
1479 |
||
1480 |
^ ReadWriteStream with:self |
|
1481 |
||
1482 |
" |
|
11436 | 1483 |
'hello world' readWriteStream |
1484 |
nextPutAll:'+Foo'; |
|
1485 |
contents |
|
1486 |
||
1487 |
'hello world' readWriteStream |
|
1488 |
setToEnd; |
|
1489 |
nextPutAll:'+Foo'; |
|
1490 |
contents |
|
8631 | 1491 |
" |
1492 |
! |
|
1493 |
||
602 | 1494 |
writeStream |
1495 |
"return a stream for writing onto the receiver" |
|
1496 |
||
1497 |
^ WriteStream on:self |
|
2 | 1498 |
|
602 | 1499 |
" |
1500 |
|s| |
|
1501 |
||
11315
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
1502 |
s := #() writeStream. |
602 | 1503 |
s nextPut:1. |
1504 |
s nextPut:2. |
|
1505 |
s nextPut:3. |
|
1506 |
s contents inspect |
|
1507 |
" |
|
88 | 1508 |
|
1509 |
" |
|
602 | 1510 |
|s| |
2 | 1511 |
|
602 | 1512 |
s := OrderedCollection new writeStream. |
1513 |
s nextPut:1. |
|
1514 |
s nextPut:2. |
|
1515 |
s nextPut:3. |
|
1516 |
s contents inspect |
|
1517 |
" |
|
8140
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1518 |
! |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1519 |
|
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1520 |
writeStreamOrNil |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1521 |
"return a stream for writing onto the receiver. |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1522 |
This has been defined for protocol compatibility with FileName, |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1523 |
but nil is never returned here" |
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1524 |
|
7cc7ac5f29ca
Define #xxxStreamOrNil methods.
Stefan Vogel <sv@exept.de>
parents:
8050
diff
changeset
|
1525 |
^ self writeStream |
602 | 1526 |
! ! |
1 | 1527 |
|
602 | 1528 |
!Collection methodsFor:'copying'! |
1529 |
||
3381
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1530 |
copy |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1531 |
"return a copy of the receiver. |
7168
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
1532 |
Redefined to pass the original as argument to the postCopyFrom method." |
3381
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1533 |
|
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1534 |
^ self shallowCopy postCopyFrom:self |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1535 |
|
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1536 |
"Created: / 19.4.1998 / 20:02:53 / cg" |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1537 |
! |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1538 |
|
602 | 1539 |
copyEmpty |
1540 |
"return a copy of the receiver with no elements. |
|
1541 |
This is used by copying and enumeration methods |
|
1542 |
to get a new instance which is similar to the receiver." |
|
1543 |
||
1544 |
^ self species new |
|
1 | 1545 |
! |
1546 |
||
602 | 1547 |
copyEmpty:size |
1548 |
"return a copy of the receiver with no elements, but space for |
|
1549 |
size elements. This is used by copying and enumeration methods |
|
1550 |
to get a new instance which is similar to the receiver. |
|
1551 |
This method should be redefined in subclasses with instance |
|
1552 |
variables, which should be put into the copy too. |
|
1553 |
For example, SortedCollection has to copy its sortBlock into the |
|
1554 |
new collection." |
|
1 | 1555 |
|
602 | 1556 |
^ self species new:size |
360 | 1557 |
! |
1558 |
||
602 | 1559 |
copyEmptyAndGrow:size |
1560 |
"return a copy of the receiver with size nil elements. |
|
1561 |
This is used by copying and enumeration methods |
|
1562 |
to get a new instance which is similar to the receiver." |
|
155 | 1563 |
|
602 | 1564 |
^ (self copyEmpty:size) grow:size |
3381
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1565 |
! |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1566 |
|
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1567 |
postCopyFrom:original |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1568 |
"sent to a freshly copied object to give it a chance to adjust things. |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1569 |
Notice, that for Sets/Dicts etc. a rehash is not needed, since the copy |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1570 |
will have the same hash key as the receiver (as long as ST/X provides the |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1571 |
setHash: functionality)." |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1572 |
|
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1573 |
"for ST-80 compatibility, we try postCopy here ..." |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1574 |
^ self postCopy |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1575 |
|
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1576 |
"Created: / 19.4.1998 / 19:59:42 / cg" |
e1c12fa92fbf
moved #postCopyFrom: from object; redefined copy to send this instead
Claus Gittinger <cg@exept.de>
parents:
3367
diff
changeset
|
1577 |
"Modified: / 19.4.1998 / 20:03:57 / cg" |
1 | 1578 |
! ! |
1579 |
||
1580 |
!Collection methodsFor:'enumerating'! |
|
1581 |
||
10795
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1582 |
addAllNonNilElementsTo:aCollection |
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1583 |
"add all nonNil elements of the receiver to aCollection. |
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1584 |
Return aCollection." |
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1585 |
|
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1586 |
self do:[:each | each notNil ifTrue:[aCollection add:each]]. |
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1587 |
^ aCollection |
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1588 |
|
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1589 |
" |
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1590 |
#(1 2 3 4 5 1 2 3 4 5 nil) asOrderedCollection addAllNonNilElementsTo:Set new |
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1591 |
" |
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1592 |
! |
3797cbc3fcb4
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10750
diff
changeset
|
1593 |
|
602 | 1594 |
addAllTo:aCollection |
1595 |
"add all elements of the receiver, to aCollection. |
|
1596 |
Return aCollection." |
|
77 | 1597 |
|
602 | 1598 |
self do:[:each | aCollection add:each]. |
1599 |
^ aCollection |
|
5254 | 1600 |
|
1601 |
" |
|
1602 |
#(1 2 3 4 5 1 2 3 4 5) addAllTo:Set new |
|
1603 |
" |
|
1604 |
||
1605 |
"Modified: / 11.2.2000 / 11:22:14 / cg" |
|
77 | 1606 |
! |
1607 |
||
1 | 1608 |
collect:aBlock |
1609 |
"for each element in the receiver, evaluate the argument, aBlock |
|
1610 |
and return a new collection with the results" |
|
1611 |
||
1612 |
|newCollection| |
|
1613 |
||
201 | 1614 |
newCollection := self species new. |
1615 |
self do:[:element | newCollection add:(aBlock value:element)]. |
|
1 | 1616 |
^ newCollection |
68 | 1617 |
|
1618 |
" |
|
1619 |
#(1 2 3 4) collect:[:n | n * 2] |
|
1620 |
" |
|
1 | 1621 |
! |
1622 |
||
4890 | 1623 |
collect:collectBlock thenSelect:selectBlock |
1624 |
"combination of collect followed by select. |
|
1625 |
May be redefined by some subclasses for optimal performance |
|
7164 | 1626 |
(avoiding the creation of intermediate garbage)" |
4890 | 1627 |
|
4892 | 1628 |
^ (self collect:collectBlock) select:selectBlock |
1629 |
||
1630 |
" |
|
1631 |
#(1 2 3 4 5 6 7) collect:[:i | i * 2] thenSelect:[:i | i < 10] |
|
1632 |
" |
|
4890 | 1633 |
! |
1634 |
||
6867 | 1635 |
collectAll:aBlock |
1636 |
"for each element in the receiver, evaluate the argument, aBlock. |
|
9315 | 1637 |
The block is supposed to return a collection, whose elements are collected. |
8608 | 1638 |
The species of the returned collection is that of the first returned |
1639 |
partial result." |
|
6867 | 1640 |
|
1641 |
|result| |
|
1642 |
||
1643 |
self do:[:element | |
|
1644 |
|individualResult| |
|
1645 |
||
1646 |
individualResult := aBlock value:element. |
|
1647 |
result isNil ifTrue:[ |
|
1648 |
result := individualResult speciesForAdding new. |
|
1649 |
]. |
|
1650 |
result addAll:individualResult. |
|
1651 |
]. |
|
1652 |
||
8609
daa0d6682135
collectAll: now returns an empty collection if
Claus Gittinger <cg@exept.de>
parents:
8608
diff
changeset
|
1653 |
^ result ? #() |
6867 | 1654 |
|
1655 |
" |
|
1656 |
#(1 2 3 4) collectAll:[:n | Array new:n withAll:n ] |
|
7629 | 1657 |
#(1 2 3 4) collectAll:[:n | Array with:n with:n squared ] |
8607 | 1658 |
#(1 2 3 4) collectAll:[:n | 1 to:n ] |
1659 |
(Array with:Point with:Rectangle) collectAll:[:c | c instVarNames ] |
|
7629 | 1660 |
" |
6867 | 1661 |
! |
1662 |
||
602 | 1663 |
count:aBlock |
1664 |
"count elements, for which aBlock returns true. |
|
1665 |
Return the sum." |
|
1666 |
||
7336 | 1667 |
|count| |
1668 |
||
1669 |
count := 0. |
|
1670 |
self do:[:element | |
|
1671 |
(aBlock value:element) ifTrue:[count := count + 1] |
|
1672 |
]. |
|
1673 |
^ count |
|
77 | 1674 |
|
1675 |
" |
|
602 | 1676 |
#(1 2 3 4 6 8 10) count:[:a | a even] |
7336 | 1677 |
#(1 nil nil nil 2 3 nil 4 5) count:[:a | a isNil] |
77 | 1678 |
" |
1679 |
! |
|
1680 |
||
1 | 1681 |
detect:aBlock |
1682 |
"evaluate the argument, aBlock for each element in the receiver until |
|
1683 |
the block returns true; in this case return the element which caused |
|
1684 |
the true evaluation. |
|
345 | 1685 |
If none of the evaluations returns true, report an error" |
1 | 1686 |
|
1687 |
^ self detect:aBlock ifNone:[self errorNotFound] |
|
68 | 1688 |
|
1689 |
" |
|
1690 |
#(1 2 3 4) detect:[:n | n odd] |
|
1691 |
#(2 4 6 8) detect:[:n | n odd] |
|
1692 |
" |
|
1 | 1693 |
! |
1694 |
||
8750 | 1695 |
detect:generatorBlock forWhich:testBlock ifNone:exceptionBlock |
1696 |
"evaluate generatorBlock for each element in the receiver until |
|
1697 |
testBlock returns true for it; |
|
1698 |
in this case return the value from generatorBlock, which caused the true evaluation. |
|
1699 |
If none of the test evaluations returns true, return the result of the |
|
1700 |
evaluation of the exceptionBlock" |
|
1701 |
||
1702 |
self do:[:each | |
|
1703 |
|val| |
|
1704 |
||
1705 |
val := generatorBlock value:each. |
|
1706 |
(testBlock value:val) ifTrue:[^ val]. |
|
1707 |
]. |
|
1708 |
^ exceptionBlock value |
|
1709 |
||
1710 |
" |
|
1711 |
#(2 3 4) detect:[:n | n squared] forWhich:[:nsq | nsq odd] ifNone:['sorry'] |
|
1712 |
#( 2 4 ) detect:[:n | n squared] forWhich:[:nsq | nsq odd] ifNone:['sorry'] |
|
8751 | 1713 |
|
1714 |
#( 'st' 'c' 'java' ) |
|
1715 |
detect:[:ext | 'Foo' asFilename withSuffix:ext] |
|
1716 |
forWhich:[:fn | fn exists] |
|
1717 |
ifNone:nil |
|
8750 | 1718 |
" |
1719 |
! |
|
1720 |
||
9842 | 1721 |
detect:aOneArgBlock ifNone:exceptionBlock |
1 | 1722 |
"evaluate the argument, aBlock for each element in the receiver until |
1723 |
the block returns true; in this case return the element which caused |
|
1724 |
the true evaluation. |
|
1725 |
If none of the evaluations returns true, return the result of the |
|
1726 |
evaluation of the exceptionBlock" |
|
1727 |
||
1728 |
self do:[:each | |
|
9842 | 1729 |
(aOneArgBlock value:each) ifTrue:[^ each]. |
1 | 1730 |
]. |
1731 |
^ exceptionBlock value |
|
68 | 1732 |
|
1733 |
" |
|
1734 |
#(1 2 3 4) detect:[:n | n odd] ifNone:['sorry'] |
|
1735 |
#(2 4 6 8) detect:[:n | n odd] ifNone:['sorry'] |
|
1736 |
" |
|
9842 | 1737 |
|
1738 |
"Modified: / 13-09-2006 / 11:17:42 / cg" |
|
1 | 1739 |
! |
1740 |
||
421 | 1741 |
detectLast:aBlock |
1742 |
"evaluate the argument, aBlock for each element in the receiver until |
|
1743 |
the block returns true; in this case return the element which caused |
|
1744 |
the true evaluation. The elements are processed in reverse order. |
|
1745 |
If none of the evaluations returns true, report an error" |
|
1746 |
||
1747 |
^ self detectLast:aBlock ifNone:[self errorNotFound] |
|
1748 |
||
1749 |
" |
|
1750 |
#(1 2 3 4) detectLast:[:n | n odd] |
|
1751 |
#(2 4 6 8) detectLast:[:n | n odd] |
|
1752 |
" |
|
1753 |
! |
|
1754 |
||
1755 |
detectLast:aBlock ifNone:exceptionBlock |
|
1756 |
"evaluate the argument, aBlock for each element in the receiver until |
|
1757 |
the block returns true; in this case return the element which caused |
|
1758 |
the true evaluation. The elements are processed in reverse order. |
|
1759 |
If none of the evaluations returns true, return the result of the |
|
1760 |
evaluation of the exceptionBlock" |
|
1761 |
||
1762 |
self reverseDo:[:each | |
|
6135 | 1763 |
(aBlock value:each) ifTrue:[^ each]. |
421 | 1764 |
]. |
1765 |
^ exceptionBlock value |
|
1766 |
||
1767 |
" |
|
1768 |
#(1 2 3 4) detectLast:[:n | n odd] ifNone:['sorry'] |
|
1769 |
#(2 4 6 8) detectLast:[:n | n odd] ifNone:['sorry'] |
|
1770 |
" |
|
1771 |
! |
|
1772 |
||
602 | 1773 |
do:aBlock |
1774 |
"evaluate the argument, aBlock for each element" |
|
1775 |
||
1776 |
^ self subclassResponsibility |
|
1777 |
! |
|
1778 |
||
4394 | 1779 |
do:aBlock inBetweenDo:betweenBlock |
1780 |
"evaluate the argument, aBlock for each element. |
|
1781 |
Between elements (i.e. after each except for the last), |
|
1782 |
evaluate betweenBlock. |
|
5254 | 1783 |
This is a utility helper for collection printers |
1784 |
(for example, to print a space between elements)." |
|
4394 | 1785 |
|
8359 | 1786 |
<resource: #obsolete> |
6052
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1787 |
self obsoleteMethodWarning:'use #do:separatedBy:'. |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1788 |
^ self do:aBlock separatedBy:betweenBlock |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1789 |
|
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1790 |
" |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1791 |
#(1 2 3 4) do:[:el | Transcript show:el] |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1792 |
inBetweenDo:[ Transcript show:'-'] |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1793 |
|
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1794 |
(Dictionary with:(1->'one') with:(2->'two')) |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1795 |
do:[:el | Transcript showCR:el printString] |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1796 |
inBetweenDo:[ Transcript showCR:'----'] |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1797 |
|
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1798 |
(Dictionary with:(1->'one') with:(2->'two')) |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1799 |
associations |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1800 |
do:[:el | Transcript showCR:el printString] |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1801 |
inBetweenDo:[ Transcript showCR:'----'] |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1802 |
|
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1803 |
" |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1804 |
|
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1805 |
"Modified: / 11.2.2000 / 11:23:15 / cg" |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1806 |
! |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1807 |
|
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1808 |
do:aBlock separatedBy:betweenBlock |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1809 |
"evaluate the argument, aBlock for each element. |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1810 |
Between elements (i.e. after each except for the last), |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1811 |
evaluate betweenBlock. |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1812 |
This is a utility helper for collection printers |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1813 |
(for example, to print a space between elements)." |
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1814 |
|
4394 | 1815 |
|first| |
1816 |
||
1817 |
first := true. |
|
1818 |
self do:[:element | |
|
1819 |
first ifTrue:[ |
|
1820 |
first := false |
|
1821 |
] ifFalse:[ |
|
1822 |
betweenBlock value. |
|
1823 |
]. |
|
1824 |
aBlock value:element |
|
1825 |
]. |
|
1826 |
||
1827 |
" |
|
1828 |
#(1 2 3 4) do:[:el | Transcript show:el] |
|
6052
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1829 |
separatedBy:[ Transcript show:'-'] |
5619 | 1830 |
|
1831 |
(Dictionary with:(1->'one') with:(2->'two')) |
|
1832 |
do:[:el | Transcript showCR:el printString] |
|
6052
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1833 |
separatedBy:[ Transcript showCR:'----'] |
5619 | 1834 |
|
1835 |
(Dictionary with:(1->'one') with:(2->'two')) |
|
1836 |
associations |
|
1837 |
do:[:el | Transcript showCR:el printString] |
|
6052
a7c0dda5e0bc
do:inBetweenDo: -> do:separatedBy: (ANSI)
Claus Gittinger <cg@exept.de>
parents:
6042
diff
changeset
|
1838 |
separatedBy:[ Transcript showCR:'----'] |
5619 | 1839 |
|
4394 | 1840 |
" |
5254 | 1841 |
|
1842 |
"Modified: / 11.2.2000 / 11:23:15 / cg" |
|
4394 | 1843 |
! |
1844 |
||
1212 | 1845 |
doWithExit:aBlock |
1846 |
"evaluate the argument, aBlock for each element. |
|
1847 |
Passes an additional exit object, which can be used to leave |
|
1848 |
the loop early, by sending it a #value: message. |
|
1849 |
Returns nil or the value passed to the exit>>value: message. |
|
1850 |
||
8662 | 1851 |
Notice, that this is different to a return statement in the block, |
1852 |
which returns from the enclosed method, NOT only from the block." |
|
1853 |
||
1854 |
|exit| |
|
1855 |
||
1856 |
exit := [:exitValue | ^exitValue]. |
|
1857 |
self do:[:el | |
|
1858 |
aBlock value:el value:exit |
|
1859 |
]. |
|
1860 |
^ nil |
|
1212 | 1861 |
|
1862 |
"Example: |
|
1863 |
search for the first element which is >= 99; return it. |
|
1864 |
remaining elements are not processed: |
|
1865 |
||
1866 |
#(1 2 3 4 999 5 6 7 8 9) |
|
1867 |
doWithExit:[:element :exit | |
|
1422 | 1868 |
Transcript showCR:element. |
8662 | 1869 |
element >= 99 ifTrue:[exit value:element]] |
1212 | 1870 |
|
1871 |
#(1 2 3 4 5 6 7 8 9) |
|
1872 |
doWithExit:[:element :exit | |
|
1422 | 1873 |
Transcript showCR:element. |
1212 | 1874 |
element >= 99 ifTrue:[exit value:element]] |
1875 |
" |
|
1876 |
||
1877 |
"to demonstrate the difference to returning from the block: |
|
1878 |
this works: |
|
1879 |
||
1880 |
|el| |
|
1881 |
||
1882 |
el := #(1 2 3 4 999 5 6 7 8 9) |
|
1883 |
doWithExit:[:element :exit | |
|
1884 |
element >= 99 ifTrue:[exit value:element]]. |
|
1422 | 1885 |
Transcript showCR:el. |
1212 | 1886 |
|
1887 |
||
1422 | 1888 |
this does NOT work as expected by a newComer ;-) (the showCR is not reached): |
1212 | 1889 |
|
1890 |
|el| |
|
1891 |
||
1892 |
el := #(1 2 3 4 999 5 6 7 8 9) |
|
1893 |
do:[:element | |
|
1894 |
element >= 99 ifTrue:[^ element]]. |
|
1422 | 1895 |
Transcript showCR:el. |
1212 | 1896 |
" |
1897 |
||
1898 |
"Modified: 18.4.1996 / 14:16:59 / cg" |
|
1899 |
! |
|
1900 |
||
11412 | 1901 |
flatDo:aBlock |
1902 |
"for each element of the collection, if its a scalar, evaluate aBlock for it; |
|
1903 |
otherwise, recursively invoke flatDo on the collection." |
|
1904 |
||
1905 |
self do:[:each | |
|
1906 |
(each isNonByteCollection) ifTrue:[ |
|
1907 |
each flatDo:aBlock |
|
1908 |
] ifFalse:[ |
|
1909 |
aBlock value:each |
|
1910 |
]. |
|
1911 |
]. |
|
1912 |
||
1913 |
" |
|
1914 |
#( |
|
1915 |
(1 2 3) |
|
1916 |
4 5 |
|
1917 |
(6) |
|
1918 |
7 |
|
1919 |
(8 (9 10) 11 12 (13 (14 (15) 16)))) flatDo:[:el | Transcript showCR:el] |
|
1920 |
" |
|
1921 |
! |
|
1922 |
||
1 | 1923 |
inject:thisValue into:binaryBlock |
1262 | 1924 |
"starting with thisValue for value, pass this value and each element |
1925 |
to binaryBlock, replacing value with the result returned from the block |
|
1926 |
in the next iteration." |
|
1927 |
||
1 | 1928 |
|nextValue| |
1929 |
||
1930 |
nextValue := thisValue. |
|
1931 |
self do: [:each | nextValue := binaryBlock value:nextValue value:each]. |
|
1932 |
^ nextValue |
|
68 | 1933 |
|
1262 | 1934 |
"sum up the elements of a collection: |
1935 |
||
68 | 1936 |
#(1 2 3 4) inject:0 into:[:accu :element | accu + element] |
1937 |
(1 to:10) inject:0 into:[:accu :element | accu + element] |
|
1262 | 1938 |
|
1939 |
find the minimum: |
|
1940 |
||
1941 |
|coll| |
|
1942 |
coll := #(1 99 -15 20 100). |
|
1943 |
coll inject:(coll first) into:[:minSoFar :element | minSoFar min:element] |
|
68 | 1944 |
" |
1262 | 1945 |
|
1946 |
"Modified: 23.4.1996 / 13:47:06 / cg" |
|
1 | 1947 |
! |
1948 |
||
602 | 1949 |
keysAndValuesDo:aTwoArgBlock |
1950 |
"evaluate the argument, aBlock for every element in the collection, |
|
1951 |
passing both index and element as arguments." |
|
1952 |
||
1953 |
^ self errorNotKeyed |
|
1954 |
! |
|
1955 |
||
1359 | 1956 |
keysAndValuesReverseDo:aTwoArgBlock |
1957 |
"evaluate the argument, aBlock in reverse order for every element in the collection, |
|
1958 |
passing both index and element as arguments." |
|
1959 |
||
1960 |
^ self errorNotKeyed |
|
1961 |
||
1962 |
"Created: 9.5.1996 / 00:58:24 / cg" |
|
1963 |
! |
|
1964 |
||
9076
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1965 |
keysAndValuesSelect:selectBlockWith2Args thenCollect:collectBlockWith2Args |
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1966 |
|collected| |
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1967 |
|
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1968 |
collected := OrderedCollection new. |
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1969 |
self keysAndValuesDo:[:eachKey :eachValue | |
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1970 |
(selectBlockWith2Args value:eachKey value:eachValue) ifTrue:[ |
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1971 |
collected add:(collectBlockWith2Args value:eachKey value:eachValue) |
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1972 |
]. |
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1973 |
]. |
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1974 |
^ collected |
9077
327b64542a83
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9076
diff
changeset
|
1975 |
|
327b64542a83
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9076
diff
changeset
|
1976 |
" |
327b64542a83
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9076
diff
changeset
|
1977 |
#(10 20 30 40) keysAndValuesSelect:[:idx :val | idx > 2] thenCollect:[:idx :val | idx->val] |
327b64542a83
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9076
diff
changeset
|
1978 |
" |
9076
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1979 |
! |
e7957fd220c8
+keysAndValuesSelect:thenCollect:
Claus Gittinger <cg@exept.de>
parents:
9073
diff
changeset
|
1980 |
|
7454 | 1981 |
map:selector |
1982 |
"for lisp fans - similar to collect" |
|
1983 |
||
1984 |
^ self collect:[:eachElement | eachElement perform:selector]. |
|
1985 |
||
1986 |
" |
|
1987 |
#(1 2 3 4) map:#negated |
|
1988 |
" |
|
1989 |
! |
|
1990 |
||
1991 |
map:selector with:arg |
|
1992 |
"for lisp fans - similar to collect" |
|
1993 |
||
1994 |
^ self collect:[:eachElement | eachElement perform:selector with:arg]. |
|
1995 |
||
1996 |
" |
|
1997 |
#(1 2 3 4) map:#+ with:1 |
|
1998 |
" |
|
1999 |
! |
|
2000 |
||
8863 | 2001 |
nonNilElementsDo:aBlock |
2002 |
"evaluate the argument, aBlock for every non-nil element in the collection." |
|
2003 |
||
2004 |
self do:[:each | |
|
2005 |
each notNil ifTrue:[ |
|
2006 |
aBlock value:each. |
|
2007 |
] |
|
2008 |
] |
|
2009 |
! |
|
2010 |
||
10750 | 2011 |
pairsDo:aTwoArgBlock |
2012 |
"evaluate the argument, aTwoArgBlock for every element in the collection, |
|
602 | 2013 |
which is supposed to consist of 2-element collections. |
2014 |
The block is called with 2 arguments for each collection in the receiver." |
|
2015 |
||
2016 |
self do:[:aPair | |
|
10750 | 2017 |
aTwoArgBlock value:(aPair at:1) value:(aPair at:2). |
602 | 2018 |
] |
10750 | 2019 |
|
602 | 2020 |
" |
6555 | 2021 |
#( |
2022 |
(1 one) |
|
2023 |
(2 two) |
|
2024 |
(3 three) |
|
2025 |
(4 four) |
|
2026 |
(5 five) |
|
2027 |
(6 six) |
|
2028 |
) pairsDo: |
|
2029 |
[:num :sym | |
|
2030 |
Transcript show:num; show:' is: '; showCR:sym] |
|
602 | 2031 |
|
2032 |
#( (1 1) (1 2) (1 3) (1 4) (1 5)) |
|
1422 | 2033 |
pairsDo:[:x :y | Transcript showCR:x@y] |
602 | 2034 |
" |
10750 | 2035 |
|
2036 |
"Modified: / 20-10-2007 / 17:17:50 / cg" |
|
602 | 2037 |
! |
2038 |
||
1 | 2039 |
reject:aBlock |
2040 |
"return a new collection with all elements from the receiver, for which |
|
2041 |
the argument aBlock evaluates to false" |
|
2042 |
||
2043 |
^ self select:[:element | (aBlock value:element) == false] |
|
68 | 2044 |
|
2045 |
" |
|
2046 |
#(1 2 3 4) reject:[:e | e odd] |
|
2047 |
(1 to:10) reject:[:e | e even] |
|
2048 |
" |
|
1 | 2049 |
! |
2050 |
||
602 | 2051 |
reverseDo:aBlock |
2052 |
"evaluate the argument, aBlock for each element in reverse order." |
|
2053 |
||
2054 |
"it could be defined in terms of do: - but very inefficient. |
|
2055 |
Better force programmer to define a better version ..." |
|
2056 |
||
2057 |
^ self subclassResponsibility |
|
2058 |
! |
|
2059 |
||
1 | 2060 |
select:aBlock |
2061 |
"return a new collection with all elements from the receiver, for which |
|
5265 | 2062 |
the argument aBlock evaluates to true. |
2063 |
See also: #removeAllFoundIn: and #removeAllSuchThat:" |
|
1 | 2064 |
|
2065 |
|newCollection| |
|
2066 |
||
201 | 2067 |
newCollection := self species new. |
1 | 2068 |
self do:[:each | |
5265 | 2069 |
(aBlock value:each) ifTrue:[newCollection add:each]. |
1 | 2070 |
]. |
2071 |
^ newCollection |
|
68 | 2072 |
|
2073 |
" |
|
2074 |
#(1 2 3 4) select:[:e | e odd] |
|
2075 |
(1 to:10) select:[:e | e even] |
|
2076 |
" |
|
2077 |
! |
|
2078 |
||
2079 |
select:aBlock ifNone:exceptionBlock |
|
2080 |
"try a new collection with all elements from the receiver, for which |
|
2081 |
the argument aBlock evaluates to true. If none of the elements passes |
|
5265 | 2082 |
the check of aBlock, return the result of evaluating exceptionBlock. |
2083 |
See also: #removeAllFoundIn: and #removeAllSuchThat:" |
|
68 | 2084 |
|
2085 |
|newCollection| |
|
2086 |
||
2087 |
newCollection := self select:aBlock. |
|
2088 |
newCollection isEmpty ifTrue:[^ exceptionBlock value]. |
|
2089 |
^ newCollection |
|
2090 |
||
2091 |
" |
|
2092 |
#(1 2 3 4) select:[:e | e > 10] ifNone:['sorry'] |
|
2093 |
" |
|
12 | 2094 |
! |
2095 |
||
4892 | 2096 |
select:selectBlock thenCollect:collectBlock |
2097 |
"combination of select followed by collect. |
|
2098 |
May be redefined by some subclasses for optimal performance |
|
5844 | 2099 |
(avoiding the creation of intermediate garbage)" |
4892 | 2100 |
|
2101 |
^ (self select:selectBlock) collect:collectBlock |
|
2102 |
||
2103 |
" |
|
2104 |
#(1 2 3 4 5 6 7) select:[:i | i even] thenCollect:[:i | i * 2] |
|
2105 |
" |
|
2106 |
! |
|
2107 |
||
6695 | 2108 |
select:selectBlock thenDo:doBlock |
2109 |
"combination of select followed by do |
|
2110 |
Avoids the creation of intermediate garbage" |
|
2111 |
||
2112 |
self do:[:eachElement | |
|
2113 |
(selectBlock value:eachElement) ifTrue:[ |
|
2114 |
doBlock value:eachElement |
|
2115 |
] |
|
2116 |
]. |
|
2117 |
||
2118 |
" |
|
2119 |
#(1 2 3 4 5 6 7) select:[:i | i even] thenDo:[:i | Transcript showCR:i] |
|
2120 |
" |
|
2121 |
! |
|
2122 |
||
362 | 2123 |
triplesDo:aBlock |
2124 |
"evaluate the argument, aBlock for every element in the collection, |
|
2125 |
which is supposed to consist of 3-element collections. |
|
2126 |
The block is called with 3 arguments for each collection in the receiver." |
|
2127 |
||
2128 |
self do:[:aTriple | |
|
2639 | 2129 |
aBlock value:(aTriple at:1) value:(aTriple at:2) value:(aTriple at:3). |
362 | 2130 |
] |
2131 |
" |
|
6555 | 2132 |
#( |
2133 |
(1 one eins) |
|
2134 |
(2 two zwei) |
|
2135 |
(3 three drei) |
|
2136 |
(4 four vier) |
|
2137 |
(5 five #'fuenf') |
|
2138 |
(6 six sechs) |
|
2139 |
) |
|
2140 |
triplesDo:[:num :sym1 :sym2 | |
|
2141 |
Transcript show:num; space; show:sym1; space; showCR:sym2 |
|
2142 |
] |
|
362 | 2143 |
" |
2639 | 2144 |
|
2145 |
"Modified: 10.5.1997 / 14:15:43 / cg" |
|
1 | 2146 |
! |
2147 |
||
602 | 2148 |
with:aCollection collect:aTwoArgBlock |
2149 |
"evaluate the argument, aBlock for successive elements from |
|
2150 |
each the receiver and the argument, aSequenceableCollection; |
|
2151 |
The second argument, aBlock must be a two-argument block, which is |
|
2152 |
evaluated for each element-pair. |
|
2153 |
Collect the results and return a collection containing them. |
|
2154 |
This method fails if neither the receiver nor aCollection is |
|
2155 |
a sequenceable collection (i.e. implements numeric key access)." |
|
260 | 2156 |
|
602 | 2157 |
|index "{ Class: SmallInteger }" |
2158 |
newCollection| |
|
1 | 2159 |
|
6547
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2160 |
newCollection := self speciesForAdding new. |
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2161 |
|
602 | 2162 |
index := 1. |
2163 |
aCollection isSequenceable ifFalse:[ |
|
6135 | 2164 |
self isSequenceable ifFalse:[ |
6547
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2165 |
"/ mhmh - could use two streams here... |
6135 | 2166 |
^ self error:'neither collection is sequenceable'. |
2167 |
]. |
|
2168 |
aCollection do:[:element | |
|
2169 |
newCollection add:(aTwoArgBlock value:(self at:index) |
|
2170 |
value:element). |
|
2171 |
index := index + 1 |
|
2172 |
] |
|
602 | 2173 |
] ifTrue:[ |
6135 | 2174 |
self do:[:element | |
2175 |
newCollection add:(aTwoArgBlock value:element |
|
2176 |
value:(aCollection at:index)). |
|
2177 |
index := index + 1 |
|
2178 |
] |
|
602 | 2179 |
]. |
6547
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2180 |
^ newCollection as:self species |
201 | 2181 |
|
2182 |
" |
|
6547
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2183 |
(1 to:3) with:#(one two three) collect:[:num :sym | (num->sym)] |
602 | 2184 |
#(1 2 3) with:#(10 20 30) collect:[:x :y | (x@y)] |
201 | 2185 |
" |
2 | 2186 |
! |
2187 |
||
602 | 2188 |
with:aCollection do:aTwoArgBlock |
2189 |
"evaluate the argument, aBlock for successive elements from |
|
2190 |
each the receiver and the argument, aSequenceableCollection. |
|
2191 |
The second argument, aBlock must be a two-argument block. |
|
2192 |
This method fails if neither the receiver nor aCollection is |
|
2193 |
a sequenceable collection (i.e. implements numeric key access)." |
|
2194 |
||
2195 |
|index "{ Class: SmallInteger }"| |
|
2 | 2196 |
|
602 | 2197 |
index := 1. |
2198 |
aCollection isSequenceable ifFalse:[ |
|
6135 | 2199 |
self isSequenceable ifFalse:[ |
2200 |
^ self error:'neither collection is sequenceable'. |
|
2201 |
]. |
|
2202 |
aCollection do:[:element | |
|
2203 |
aTwoArgBlock value:(self at:index) value:element. |
|
2204 |
index := index + 1 |
|
2205 |
] |
|
602 | 2206 |
] ifTrue:[ |
6135 | 2207 |
self do:[:element | |
2208 |
aTwoArgBlock value:element value:(aCollection at:index). |
|
2209 |
index := index + 1 |
|
2210 |
] |
|
602 | 2211 |
] |
201 | 2212 |
|
2213 |
" |
|
602 | 2214 |
(1 to:3) with:#(one two three) do:[:num :sym | |
6135 | 2215 |
Transcript showCR:(num->sym) |
602 | 2216 |
] |
2217 |
(1 to:3) with:#(one two three) asSet do:[:num :sym | |
|
6135 | 2218 |
Transcript showCR:(num->sym) |
602 | 2219 |
]. |
2220 |
(1 to:3) asSet with:#(one two three) do:[:num :sym | |
|
6135 | 2221 |
Transcript showCR:(num->sym) |
602 | 2222 |
] |
201 | 2223 |
" |
1 | 2224 |
! ! |
2225 |
||
5874 | 2226 |
!Collection methodsFor:'enumerating-tests'! |
2227 |
||
2228 |
allSatisfy:aBlock |
|
2229 |
"evaluate aBlock for each of the receiver's elements. |
|
2230 |
Return true, if aBlock returns true for all elements, false otherwise |
|
2231 |
(i.e. false if any element fails to satisfy the block-condition). |
|
2232 |
This is an ANSI renomer of #conform:" |
|
2233 |
||
2234 |
^ self conform:aBlock. |
|
2235 |
||
2236 |
" |
|
2237 |
#(1 2 3 4 5) allSatisfy:[:el | el odd] |
|
2238 |
#(2 4 6 8 10) allSatisfy:[:el | el odd] |
|
2239 |
#(2 4 6 8 10) allSatisfy:[:el | el even] |
|
2240 |
" |
|
2241 |
||
2242 |
! |
|
2243 |
||
2244 |
anySatisfy:aBlock |
|
2245 |
"evaluate aBlock for each of the receiver's elements. |
|
2246 |
Return true, if aBlock ever returns true, false otherwise |
|
2247 |
(i.e. if any element satisfies the block-condition). |
|
2248 |
This is an ANSI renomer of #contains:" |
|
2249 |
||
2250 |
^ self contains:aBlock. |
|
2251 |
||
2252 |
" |
|
2253 |
#(1 2 3 4 5) anySatisfy:[:el | el odd] |
|
2254 |
#(2 4 6 8 10) anySatisfy:[:el | el odd] |
|
2255 |
" |
|
2256 |
||
2257 |
! |
|
2258 |
||
9842 | 2259 |
conform:aOneArgBlock |
5874 | 2260 |
"return true, if every element conforms to some condition. |
2261 |
I.e. return false, if aBlock returns false for any element; |
|
2262 |
true otherwise." |
|
2263 |
||
9842 | 2264 |
self do:[:element | |
2265 |
(aOneArgBlock value:element) ifFalse:[^ false] |
|
2266 |
]. |
|
5874 | 2267 |
^ true |
9842 | 2268 |
|
2269 |
" |
|
2270 |
#(1 2 3 4 5) conform:[:el | el even] |
|
2271 |
#(2 4 6 8 10) conform:[:el | el even] |
|
2272 |
" |
|
2273 |
||
2274 |
"Modified: / 13-09-2006 / 11:19:03 / cg" |
|
5874 | 2275 |
! |
2276 |
||
9842 | 2277 |
contains:aOneArgBlock |
2278 |
"evaluate aOneArgBlock for each of the receiver's elements. |
|
5874 | 2279 |
Return true, if aBlock ever returns true, false otherwise." |
2280 |
||
9842 | 2281 |
self do:[:element | |
2282 |
(aOneArgBlock value:element) ifTrue:[^ true] |
|
2283 |
]. |
|
2284 |
^ false |
|
5874 | 2285 |
|
2286 |
" |
|
2287 |
#(1 2 3 4 5) contains:[:el | el odd] |
|
2288 |
#(2 4 6 8 10) contains:[:el | el odd] |
|
2289 |
" |
|
2290 |
||
9842 | 2291 |
"Modified: / 13-09-2006 / 11:18:36 / cg" |
8577 | 2292 |
! |
2293 |
||
2294 |
noneSatisfy:aBlock |
|
2295 |
"evaluate aBlock for each of the receiver's elements. |
|
2296 |
Return true, if aBlock returns false for all elements, false otherwise |
|
2297 |
(i.e. false if any element satisfies the block-condition)." |
|
2298 |
||
9843 | 2299 |
^ (self contains:aBlock) not |
8577 | 2300 |
|
2301 |
" |
|
2302 |
#(1 2 3 4 5) noneSatisfy:[:el | el odd] |
|
2303 |
#(2 4 6 8 10) noneSatisfy:[:el | el odd] |
|
2304 |
#(2 4 6 8 10) noneSatisfy:[:el | el even] |
|
2305 |
" |
|
9843 | 2306 |
|
2307 |
"Modified: / 13-09-2006 / 11:19:57 / cg" |
|
5874 | 2308 |
! ! |
2309 |
||
602 | 2310 |
!Collection methodsFor:'error handling'! |
2311 |
||
2312 |
emptyCheck |
|
2313 |
"check if the receiver is empty; report an error if so" |
|
2314 |
||
2315 |
self size == 0 ifTrue:[ |
|
6135 | 2316 |
^ self emptyCollectionError. |
602 | 2317 |
]. |
2318 |
! |
|
2319 |
||
2320 |
emptyCollectionError |
|
2321 |
"report an error that the operation is not allowed for |
|
2322 |
empty collections" |
|
2323 |
||
2324 |
^ EmptyCollectionSignal raise |
|
2325 |
! |
|
2326 |
||
2327 |
errorInvalidKey:aKey |
|
2328 |
"report an error that the given key was invalid" |
|
2329 |
||
2330 |
^ InvalidKeySignal raiseRequestWith:aKey |
|
2331 |
! |
|
2332 |
||
2333 |
errorNotKeyed |
|
2334 |
"report an error that keyed access methods are not allowed" |
|
2335 |
||
2336 |
^ self error:(self class name, 's do not respond to keyed accessing messages') |
|
2337 |
! |
|
2338 |
||
2339 |
errorValueNotFound:anObject |
|
2340 |
"report an error that an object was not found in the collection" |
|
2341 |
||
6757 | 2342 |
^ ValueNotFoundSignal raiseRequestWith:anObject |
3075 | 2343 |
|
2344 |
"Modified: / 30.10.1997 / 15:52:18 / cg" |
|
602 | 2345 |
! |
2346 |
||
2347 |
notEnoughElementsError |
|
2348 |
"report an error that the operation is not allowed, |
|
2349 |
since not enough elements are in the collection" |
|
2350 |
||
2351 |
^ NotEnoughElementsSignal raise |
|
9086 | 2352 |
! |
2353 |
||
2354 |
showWhereWeCameFrom |
|
11315
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2355 |
"show the stack backtrace: at least 4 levels, or until the first |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2356 |
send to a non-collection object (because we want to know, |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2357 |
which non-collection send invoked a bad collection-method)." |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2358 |
|
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2359 |
|con count| |
9086 | 2360 |
|
2361 |
con := thisContext sender sender. |
|
11315
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2362 |
count := 0. |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2363 |
[ |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2364 |
(' from ' , con printString) errorPrintCR. |
9086 | 2365 |
con := con sender. |
11315
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2366 |
count := count + 1. |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2367 |
] doWhile:[con notNil and:[count < 4 or:[con receiver isCollection]]]. |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2368 |
|
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2369 |
|
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2370 |
" |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2371 |
#() asSet add:nil |
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2372 |
" |
602 | 2373 |
! ! |
2374 |
||
2375 |
!Collection methodsFor:'growing'! |
|
2376 |
||
9309
d1fe8655bb97
move #changeCapacityTo: from Set to Collection
Stefan Vogel <sv@exept.de>
parents:
9247
diff
changeset
|
2377 |
changeCapacityTo:newSize |
d1fe8655bb97
move #changeCapacityTo: from Set to Collection
Stefan Vogel <sv@exept.de>
parents:
9247
diff
changeset
|
2378 |
newSize > self capacity ifTrue:[ |
11315
9a6ca3147b69
#showWhereWeCameFrom - show more stack backtrace
Stefan Vogel <sv@exept.de>
parents:
11309
diff
changeset
|
2379 |
self grow:newSize |
9309
d1fe8655bb97
move #changeCapacityTo: from Set to Collection
Stefan Vogel <sv@exept.de>
parents:
9247
diff
changeset
|
2380 |
]. |
d1fe8655bb97
move #changeCapacityTo: from Set to Collection
Stefan Vogel <sv@exept.de>
parents:
9247
diff
changeset
|
2381 |
|
d1fe8655bb97
move #changeCapacityTo: from Set to Collection
Stefan Vogel <sv@exept.de>
parents:
9247
diff
changeset
|
2382 |
"Created: / 30.10.2001 / 17:56:50 / cg" |
d1fe8655bb97
move #changeCapacityTo: from Set to Collection
Stefan Vogel <sv@exept.de>
parents:
9247
diff
changeset
|
2383 |
! |
d1fe8655bb97
move #changeCapacityTo: from Set to Collection
Stefan Vogel <sv@exept.de>
parents:
9247
diff
changeset
|
2384 |
|
602 | 2385 |
grow |
2386 |
"make the receiver larger" |
|
2387 |
||
2388 |
self grow:(self size + self growSize) |
|
2389 |
! |
|
2390 |
||
2391 |
grow:howBig |
|
2392 |
"change the receivers size" |
|
2393 |
||
2394 |
^ self subclassResponsibility |
|
2395 |
! |
|
2396 |
||
2397 |
growSize |
|
2398 |
"return a suitable size increment for growing. |
|
2399 |
The default returned here may be (and is) redefined in subclasses." |
|
2400 |
||
2401 |
^ self size max:2 |
|
2402 |
! ! |
|
2403 |
||
10092
70a5cb4e5df0
code cleanup: use #contains/#conform instead of explicit loop
Claus Gittinger <cg@exept.de>
parents:
9919
diff
changeset
|
2404 |
|
11468 | 2405 |
|
11412 | 2406 |
!Collection methodsFor:'operations'! |
2407 |
||
2408 |
decrementAt:aKey |
|
2409 |
self at:aKey put:(self at:aKey) - 1. |
|
2410 |
! |
|
2411 |
||
2412 |
incrementAt:aKey |
|
2413 |
self at:aKey put:(self at:aKey) + 1. |
|
2414 |
! ! |
|
2415 |
||
1 | 2416 |
!Collection methodsFor:'printing & storing'! |
2417 |
||
602 | 2418 |
displayString |
2419 |
"return a printed representation of the receiver for display in inspectors etc." |
|
2420 |
||
6511
0ca4f36b16ca
signal an error in #anElement if there is none;
Claus Gittinger <cg@exept.de>
parents:
6506
diff
changeset
|
2421 |
|thisString buffer noneYet total limit| |
602 | 2422 |
|
2423 |
thisContext isRecursive ifTrue:[ |
|
3191
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2424 |
'Collection [error]: displayString of self referencing collection.' errorPrintCR. |
1413 | 2425 |
^ '#("recursive")' |
602 | 2426 |
]. |
2427 |
||
8222
f2c454a9a038
replaced '' writeStream by String writeStream
Claus Gittinger <cg@exept.de>
parents:
8182
diff
changeset
|
2428 |
buffer := String writeStream. |
6511
0ca4f36b16ca
signal an error in #anElement if there is none;
Claus Gittinger <cg@exept.de>
parents:
6506
diff
changeset
|
2429 |
buffer nextPutAll:(self displayStringName); nextPutAll:'('. |
602 | 2430 |
noneYet := true. |
2431 |
total := 0. |
|
2432 |
limit := self maxPrint. |
|
2433 |
||
3191
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2434 |
self printElementsDo: [:element | |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2435 |
thisString := element displayString. |
1413 | 2436 |
noneYet ifTrue:[ |
2437 |
noneYet := false. |
|
2438 |
] ifFalse:[ |
|
6511
0ca4f36b16ca
signal an error in #anElement if there is none;
Claus Gittinger <cg@exept.de>
parents:
6506
diff
changeset
|
2439 |
buffer space |
1413 | 2440 |
]. |
6511
0ca4f36b16ca
signal an error in #anElement if there is none;
Claus Gittinger <cg@exept.de>
parents:
6506
diff
changeset
|
2441 |
buffer nextPutAll:thisString. |
1413 | 2442 |
total := total + 1. |
2443 |
(total > limit) ifTrue:[ |
|
6511
0ca4f36b16ca
signal an error in #anElement if there is none;
Claus Gittinger <cg@exept.de>
parents:
6506
diff
changeset
|
2444 |
buffer nextPutAll:'... )'. |
0ca4f36b16ca
signal an error in #anElement if there is none;
Claus Gittinger <cg@exept.de>
parents:
6506
diff
changeset
|
2445 |
^ buffer contents |
1413 | 2446 |
] |
602 | 2447 |
]. |
6511
0ca4f36b16ca
signal an error in #anElement if there is none;
Claus Gittinger <cg@exept.de>
parents:
6506
diff
changeset
|
2448 |
buffer nextPutAll:')'. |
0ca4f36b16ca
signal an error in #anElement if there is none;
Claus Gittinger <cg@exept.de>
parents:
6506
diff
changeset
|
2449 |
^ buffer contents |
1413 | 2450 |
|
3191
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2451 |
" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2452 |
#(1 2 3 'hello' $a) asOrderedCollection displayString |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2453 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2454 |
(Dictionary new at:#hello put:'world'; |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2455 |
at:#foo put:'bar'; yourself) displayString |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2456 |
" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2457 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2458 |
"Modified: / 20.1.1998 / 14:11:03 / stefan" |
3964
a3129832fe16
allow redefinition of the displayed class name (displayString)
Claus Gittinger <cg@exept.de>
parents:
3767
diff
changeset
|
2459 |
"Modified: / 2.2.1999 / 22:39:44 / cg" |
a3129832fe16
allow redefinition of the displayed class name (displayString)
Claus Gittinger <cg@exept.de>
parents:
3767
diff
changeset
|
2460 |
! |
a3129832fe16
allow redefinition of the displayed class name (displayString)
Claus Gittinger <cg@exept.de>
parents:
3767
diff
changeset
|
2461 |
|
a3129832fe16
allow redefinition of the displayed class name (displayString)
Claus Gittinger <cg@exept.de>
parents:
3767
diff
changeset
|
2462 |
displayStringName |
a3129832fe16
allow redefinition of the displayed class name (displayString)
Claus Gittinger <cg@exept.de>
parents:
3767
diff
changeset
|
2463 |
"redefinable helper for displayString" |
a3129832fe16
allow redefinition of the displayed class name (displayString)
Claus Gittinger <cg@exept.de>
parents:
3767
diff
changeset
|
2464 |
|
a3129832fe16
allow redefinition of the displayed class name (displayString)
Claus Gittinger <cg@exept.de>
parents:
3767
diff
changeset
|
2465 |
^ (self class name) |
a3129832fe16
allow redefinition of the displayed class name (displayString)
Claus Gittinger <cg@exept.de>
parents:
3767
diff
changeset
|
2466 |
|
a3129832fe16
allow redefinition of the displayed class name (displayString)
Claus Gittinger <cg@exept.de>
parents:
3767
diff
changeset
|
2467 |
"Created: / 2.2.1999 / 22:39:33 / cg" |
3191
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2468 |
! |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2469 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2470 |
maxPrint |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2471 |
"the print-limit; printOn: will try to not produce more output |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2472 |
than the limit defined here." |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2473 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2474 |
^ 5000 |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2475 |
! |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2476 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2477 |
printElementsDo:aBlock |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2478 |
"perform aBlock (1 arg) for all elements. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2479 |
Used in #printOn:. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2480 |
Subclasses (e.g. Dictionary) may redefine this." |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2481 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2482 |
^ self do:aBlock |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2483 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2484 |
"Created: / 20.1.1998 / 14:11:02 / stefan" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2485 |
! |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2486 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2487 |
printOn:aStream |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2488 |
"append a user readable representation of the receiver to aStream. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2489 |
The text appended is not meant to be read back for reconstruction of |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2490 |
the receiver. Also, this method limits the size of generated string. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2491 |
" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2492 |
|
3402 | 2493 |
|limit firstOne s| |
3191
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2494 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2495 |
thisContext isRecursive ifTrue:[ |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2496 |
'Collection [error]: printOn: of self referencing collection.' errorPrintCR. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2497 |
aStream nextPutAll:'#("recursive")'. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2498 |
^ self |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2499 |
]. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2500 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2501 |
aStream nextPutAll:self class name. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2502 |
aStream nextPut:$(. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2503 |
firstOne := true. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2504 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2505 |
" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2506 |
if aStream is not positionable, create an temporary positionable stream |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2507 |
(needed for limit calculation) |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2508 |
" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2509 |
aStream isPositionable ifTrue:[ |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2510 |
s := aStream. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2511 |
] ifFalse:[ |
7685
535a69a7cd69
String new -> uninitializedNew: / basicNew:
Claus Gittinger <cg@exept.de>
parents:
7629
diff
changeset
|
2512 |
s := WriteStream on:(String uninitializedNew:50). |
3191
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2513 |
]. |
7054
685d359f9847
code rewritten to be independent of stream zero-base
Claus Gittinger <cg@exept.de>
parents:
7011
diff
changeset
|
2514 |
limit := s position1Based + self maxPrint. |
3191
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2515 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2516 |
self printElementsDo:[:element | |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2517 |
firstOne ifFalse:[ |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2518 |
s space |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2519 |
] ifTrue:[ |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2520 |
firstOne := false |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2521 |
]. |
7054
685d359f9847
code rewritten to be independent of stream zero-base
Claus Gittinger <cg@exept.de>
parents:
7011
diff
changeset
|
2522 |
(s position1Based >= limit) ifTrue:[ |
3191
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2523 |
s ~~ aStream ifTrue:[ |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2524 |
aStream nextPutAll:(s contents). |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2525 |
]. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2526 |
aStream nextPutAll:'...etc...)'. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2527 |
^ self |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2528 |
] ifFalse:[ |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2529 |
element printOn:s. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2530 |
]. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2531 |
]. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2532 |
s ~~ aStream ifTrue:[ |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2533 |
aStream nextPutAll:(s contents). |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2534 |
]. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2535 |
aStream nextPut:$) |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2536 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2537 |
" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2538 |
#(1 2 3 'hello' $a) printOn:Transcript |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2539 |
(Array new:100000) printOn:Transcript |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2540 |
(Array new:100000) printOn:Stdout |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2541 |
(Array new:100000) printString size |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2542 |
(Dictionary new at:#hello put:'world'; |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2543 |
at:#foo put:'bar'; yourself) printOn:Transcript |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2544 |
" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2545 |
" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2546 |
|a| |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2547 |
a := Array new:3. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2548 |
a at:2 put:a. |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2549 |
a printOn:Transcript |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2550 |
" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2551 |
|
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2552 |
"Modified: / 28.1.1997 / 00:39:17 / cg" |
390764c0d7b3
Make #printOn: more general (and optimal).
Stefan Vogel <sv@exept.de>
parents:
3124
diff
changeset
|
2553 |
"Modified: / 20.1.1998 / 14:11:03 / stefan" |
602 | 2554 |
! |
2555 |
||
1 | 2556 |
storeOn:aStream |
88 | 2557 |
"output a printed representation onto the argument, aStream. |
2558 |
The text can be re-read to reconstruct (a copy of) the receiver. |
|
2559 |
Recursive (i.e. cyclic) collections cannot be stored correctly |
|
2560 |
(use storeBinaryOn: to handle those)." |
|
1 | 2561 |
|
5254 | 2562 |
|notEmpty| |
1 | 2563 |
|
44 | 2564 |
thisContext isRecursive ifTrue:[ |
5498 | 2565 |
Object recursiveStoreStringSignal raiseRequestWith:self. |
2289 | 2566 |
'Collection [error]: storeOn: of self referencing collection.' errorPrintCR. |
1413 | 2567 |
aStream nextPutAll:'#recursive'. |
2568 |
^ self |
|
44 | 2569 |
]. |
2570 |
||
2571 |
aStream nextPutAll:'('. |
|
1 | 2572 |
aStream nextPutAll:(self class name). |
44 | 2573 |
aStream nextPutAll:' new'. |
5254 | 2574 |
notEmpty := false. |
1 | 2575 |
self do:[:element | |
1413 | 2576 |
aStream nextPutAll:' add:'. |
2577 |
element storeOn:aStream. |
|
2578 |
aStream nextPutAll:';'. |
|
5254 | 2579 |
notEmpty := true |
1 | 2580 |
]. |
5254 | 2581 |
notEmpty ifTrue:[aStream nextPutAll:' yourself']. |
1 | 2582 |
aStream nextPut:$) |
44 | 2583 |
|
88 | 2584 |
" |
2585 |
OrderedCollection new storeOn:Transcript |
|
2586 |
(1 to:10) storeOn:Transcript |
|
2587 |
(Set new add:1; add:'hello'; yourself) storeOn:Transcript |
|
2588 |
" |
|
293 | 2589 |
" |
2590 |
|s| |
|
2591 |
||
2592 |
s := Set new. |
|
2593 |
s add:1; add:'hello'; add:s. |
|
2594 |
s storeOn:Transcript |
|
2595 |
" |
|
1413 | 2596 |
|
5254 | 2597 |
"Modified: / 11.2.2000 / 11:24:56 / cg" |
1 | 2598 |
! ! |
602 | 2599 |
|
2600 |
!Collection methodsFor:'queries'! |
|
2601 |
||
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5268
diff
changeset
|
2602 |
defaultElement |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5268
diff
changeset
|
2603 |
^ nil |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5268
diff
changeset
|
2604 |
! |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5268
diff
changeset
|
2605 |
|
9919
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2606 |
largest:n |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2607 |
"return the n largest elements" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2608 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2609 |
|mySize loopAction actionForFirstN actionForRest |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2610 |
nLargest sz_nLargest minInLargest| |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2611 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2612 |
mySize := self size. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2613 |
n > mySize ifTrue:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2614 |
self notEnoughElementsError |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2615 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2616 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2617 |
(n < 50) ifTrue:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2618 |
n == 1 ifTrue:[ ^ Array with:self max ]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2619 |
n == 2 ifTrue:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2620 |
|l1 l2| |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2621 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2622 |
loopAction := [:el | l1 := el. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2623 |
loopAction := |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2624 |
[:el | |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2625 |
el > l1 ifTrue:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2626 |
l2 := l1. l1 := el |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2627 |
] ifFalse:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2628 |
l2 := el |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2629 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2630 |
loopAction := actionForRest |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2631 |
] |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2632 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2633 |
actionForRest := [:el | |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2634 |
el > l2 ifTrue:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2635 |
el > l1 ifTrue:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2636 |
l2 := l1. l1 := el |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2637 |
] ifFalse:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2638 |
l2 := el |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2639 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2640 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2641 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2642 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2643 |
self do:[:el | loopAction value:el ]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2644 |
^ Array with:l2 with:l1 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2645 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2646 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2647 |
nLargest := SortedCollection new:n. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2648 |
sz_nLargest := 0. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2649 |
actionForFirstN := |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2650 |
[:el | |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2651 |
nLargest add:el. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2652 |
sz_nLargest := sz_nLargest + 1. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2653 |
sz_nLargest == n ifTrue:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2654 |
loopAction := actionForRest. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2655 |
minInLargest := nLargest min. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2656 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2657 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2658 |
actionForRest := |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2659 |
[:el | |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2660 |
el > minInLargest ifTrue:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2661 |
nLargest removeFirst. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2662 |
nLargest add:el. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2663 |
minInLargest := nLargest min |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2664 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2665 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2666 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2667 |
loopAction := actionForFirstN. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2668 |
self do:[:el | loopAction value:el ]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2669 |
^ nLargest |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2670 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2671 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2672 |
^ self asSortedCollection copyTo:n |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2673 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2674 |
" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2675 |
#(10 35 20 45 30 5) largest:1 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2676 |
#(10 35 20 45 30 5) largest:2 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2677 |
#(10 35 20 45 30 5) largest:3 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2678 |
#(10 35 20 45 30 5) largest:5 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2679 |
#(10 35 20 45 30 5) largest:6 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2680 |
#(10 35 20 45 30 5) largest:8 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2681 |
" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2682 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2683 |
" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2684 |
|t1 t2 data| |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2685 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2686 |
data := (1 to:10000) collect:[:i | Random nextInteger ]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2687 |
t1 := Time millisecondsToRun:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2688 |
40 timesRepeat:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2689 |
data asSortedCollection at:3 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2690 |
] |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2691 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2692 |
t2 := Time millisecondsToRun:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2693 |
40 timesRepeat:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2694 |
data largest:3 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2695 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2696 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2697 |
Transcript show:'asSorted-at -> '; show:t1; showCR:'ms'. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2698 |
Transcript show:'largest -> '; show:t2; showCR:'ms'. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2699 |
" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2700 |
! |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2701 |
|
602 | 2702 |
longestCommonPrefix |
1246 | 2703 |
"return the longest common prefix of my elements. |
2704 |
Typically used with string collections." |
|
2705 |
||
5532 | 2706 |
^ self longestCommonPrefixIgnoreCase:false |
2707 |
||
2708 |
" |
|
2709 |
#('Array' 'ArrayedCollection' 'ArrayOfFoo') longestCommonPrefix |
|
2710 |
#('Arra' 'ArrayedCollection' 'ArrayOfFoo') longestCommonPrefix |
|
2711 |
#('Arra' 'b' 'c') longestCommonPrefix |
|
2712 |
#( (1 2 3 4) (1 2 3) (1 2 3 7) (1 2 3 9 10 11)) longestCommonPrefix |
|
2713 |
" |
|
2714 |
||
2715 |
"Modified: 2.3.1997 / 00:21:41 / cg" |
|
2716 |
! |
|
2717 |
||
2718 |
longestCommonPrefixIgnoreCase:ignoreCase |
|
6505
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2719 |
"return the longest common prefix of my elements (which must be sequenceableCollections). |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2720 |
Typically used with string collections, |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2721 |
especially with completion of selectors or filenames." |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2722 |
|
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2723 |
|longest| |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2724 |
|
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2725 |
self do:[:eachCollection | |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2726 |
longest isNil ifTrue:[ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2727 |
longest := eachCollection |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2728 |
] ifFalse:[ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2729 |
longest := longest commonPrefixWith:eachCollection ignoreCase:ignoreCase |
1246 | 2730 |
] |
602 | 2731 |
]. |
6505
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2732 |
^ longest. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2733 |
|
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2734 |
"/ |longest try allMatching matchLen| |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2735 |
"/ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2736 |
"/ " |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2737 |
"/ find the longest common prefix |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2738 |
"/ " |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2739 |
"/ matchLen := 0. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2740 |
"/ self do:[:aName | |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2741 |
"/ aName size > matchLen ifTrue:[ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2742 |
"/ matchLen := aName size. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2743 |
"/ try := aName |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2744 |
"/ ] |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2745 |
"/ ]. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2746 |
"/ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2747 |
"/ allMatching := true. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2748 |
"/ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2749 |
"/ [true] whileTrue:[ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2750 |
"/ allMatching := true. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2751 |
"/ self do:[:aName | |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2752 |
"/ ((ignoreCase not and:[aName startsWith:try]) |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2753 |
"/ or:[ignoreCase and:[aName asLowercase startsWith:try asLowercase]]) ifFalse:[ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2754 |
"/ allMatching := false |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2755 |
"/ ] |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2756 |
"/ ]. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2757 |
"/ allMatching ifTrue:[ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2758 |
"/ ^ try |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2759 |
"/ ]. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2760 |
"/ matchLen := matchLen - 1. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2761 |
"/ matchLen == 0 ifTrue:[^ '']. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2762 |
"/ try := try copyTo:matchLen. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2763 |
"/ ]. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2764 |
"/ ^ try |
602 | 2765 |
|
2766 |
" |
|
5532 | 2767 |
#('Array' 'arrayedCollection' 'ARRAYOfFoo') longestCommonPrefixIgnoreCase:true |
2768 |
#('Array' 'arrayedCollection' 'ARRAYOfFoo') longestCommonPrefixIgnoreCase:false |
|
2769 |
#('Array' 'ArayedCollection' 'ARRAYOfFoo') longestCommonPrefixIgnoreCase:false |
|
6505
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2770 |
#('AAA' 'A11' 'AA2') longestCommonPrefixIgnoreCase:false |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2771 |
#('AAA' 'BBB' 'CCC') longestCommonPrefixIgnoreCase:false |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2772 |
" |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2773 |
! |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2774 |
|
6506 | 2775 |
longestCommonSuffix |
2776 |
"return the longest common suffix (tail) of my elements. |
|
2777 |
Typically used with string collections." |
|
2778 |
||
2779 |
^ self longestCommonSuffixIgnoreCase:false |
|
2780 |
! |
|
2781 |
||
6505
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2782 |
longestCommonSuffixIgnoreCase:ignoreCase |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2783 |
"return the longest common suffix (tail) of my elements |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2784 |
(which must be sequenceableCollections)." |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2785 |
|
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2786 |
|longest| |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2787 |
|
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2788 |
self do:[:eachCollection | |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2789 |
longest isNil ifTrue:[ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2790 |
longest := eachCollection |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2791 |
] ifFalse:[ |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2792 |
longest := longest commonSuffixWith:eachCollection ignoreCase:ignoreCase |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2793 |
] |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2794 |
]. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2795 |
^ longest. |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2796 |
|
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2797 |
" |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2798 |
#('Array' 'ByteArray' 'BigArray') longestCommonSuffixIgnoreCase:true |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2799 |
#('AAA' 'BBBAA' 'CCCAAAA') longestCommonSuffixIgnoreCase:false |
a86bdc3d8e66
better longestCommonPrefix; added longestCommonSuffix
Claus Gittinger <cg@exept.de>
parents:
6411
diff
changeset
|
2800 |
#('AAA' 'BBB' 'CCC') longestCommonSuffixIgnoreCase:false |
602 | 2801 |
" |
5557 | 2802 |
! |
2803 |
||
7821 | 2804 |
max |
2805 |
"return the maximum value in the receiver collection, |
|
8182
e99d0f95c925
Only use #< for comparisons, since this is the base mechanism.
Stefan Vogel <sv@exept.de>
parents:
8178
diff
changeset
|
2806 |
using #< to compare elements. |
7821 | 2807 |
Raises an error, if the receiver is empty." |
2808 |
||
2809 |
self emptyCheck. |
|
2810 |
||
2811 |
^ self inject:nil |
|
2812 |
into:[:maxSoFar :this | |
|
2813 |
(maxSoFar isNil |
|
8182
e99d0f95c925
Only use #< for comparisons, since this is the base mechanism.
Stefan Vogel <sv@exept.de>
parents:
8178
diff
changeset
|
2814 |
or:[maxSoFar < this]) ifTrue:[this] |
7821 | 2815 |
ifFalse:[maxSoFar]] |
2816 |
||
2817 |
" |
|
2818 |
#(15 1 -9 10 5) max |
|
2819 |
(1 to:15) max |
|
2820 |
(-1 to:-15 by:-1) max |
|
2821 |
(-1 to:-15 by:-4) max |
|
2822 |
(0 to:15 by:4) max |
|
2823 |
" |
|
2824 |
||
2825 |
"Modified: 8.1.1997 / 22:09:37 / cg" |
|
2826 |
! |
|
2827 |
||
2828 |
min |
|
2829 |
"return the minimum value in the receiver collection, |
|
2830 |
using < to compare elements. |
|
2831 |
Raises an error, if the receiver is empty." |
|
2832 |
||
2833 |
self emptyCheck. |
|
2834 |
||
2835 |
^ self inject:nil |
|
2836 |
into:[:minSoFar :this | |
|
2837 |
(minSoFar isNil |
|
2838 |
or:[this < minSoFar]) ifTrue:[this] |
|
2839 |
ifFalse:[minSoFar]] |
|
2840 |
||
2841 |
" |
|
2842 |
#(15 1 -9 10 5) min |
|
2843 |
(1 to:15) min |
|
2844 |
(-1 to:-15 by:-1) min |
|
2845 |
(-1 to:-15 by:-4) min |
|
2846 |
" |
|
2847 |
||
2848 |
"Modified: 8.1.1997 / 22:09:49 / cg" |
|
2849 |
! |
|
2850 |
||
2851 |
minMax |
|
2852 |
"return the minimum and maximum values in the receiver collection |
|
8182
e99d0f95c925
Only use #< for comparisons, since this is the base mechanism.
Stefan Vogel <sv@exept.de>
parents:
8178
diff
changeset
|
2853 |
as a two element array, using #< to compare elements. |
7821 | 2854 |
Raises an error, if the receiver is empty." |
2855 |
||
2856 |
|min max| |
|
2857 |
||
2858 |
self emptyCheck. |
|
2859 |
||
2860 |
min := max := nil. |
|
2861 |
self do:[:each | |
|
2862 |
min isNil ifTrue:[ |
|
2863 |
min := max := each |
|
2864 |
] ifFalse:[ |
|
8182
e99d0f95c925
Only use #< for comparisons, since this is the base mechanism.
Stefan Vogel <sv@exept.de>
parents:
8178
diff
changeset
|
2865 |
max < each ifTrue:[ |
7821 | 2866 |
max := each |
2867 |
] ifFalse:[ |
|
8182
e99d0f95c925
Only use #< for comparisons, since this is the base mechanism.
Stefan Vogel <sv@exept.de>
parents:
8178
diff
changeset
|
2868 |
each < min ifTrue:[ |
7821 | 2869 |
min := each |
2870 |
] |
|
2871 |
] |
|
2872 |
] |
|
2873 |
]. |
|
2874 |
^ Array with:min with:max |
|
2875 |
||
2876 |
" |
|
2877 |
#(15 1 -9 10 5) minMax |
|
2878 |
(1 to:15) minMax |
|
2879 |
(-1 to:-15 by:-1) minMax |
|
2880 |
(-1 to:-15 by:-4) minMax |
|
2881 |
(0 to:15 by:4) minMax |
|
2882 |
" |
|
2883 |
! |
|
2884 |
||
9919
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2885 |
nthLargest:n |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2886 |
"return the n-largest element" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2887 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2888 |
^ (self largest:n) first |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2889 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2890 |
" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2891 |
#(10 35 20 45 30 5) nthLargest:1 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2892 |
#(10 35 20 45 30 5) nthLargest:2 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2893 |
#(10 35 20 45 30 5) nthLargest:3 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2894 |
#(10 35 20 45 30 5) nthLargest:5 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2895 |
#(10 35 20 45 30 5) nthLargest:6 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2896 |
#(10 35 20 45 30 5) nthLargest:8 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2897 |
" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2898 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2899 |
" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2900 |
|t1 t2 data| |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2901 |
|
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2902 |
data := (1 to:10000) collect:[:i | Random nextInteger ]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2903 |
t1 := Time millisecondsToRun:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2904 |
40 timesRepeat:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2905 |
data asSortedCollection at:6 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2906 |
] |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2907 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2908 |
t2 := Time millisecondsToRun:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2909 |
40 timesRepeat:[ |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2910 |
data nthLargest:6 |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2911 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2912 |
]. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2913 |
Transcript show:'asSorted-at -> '; show:t1; showCR:'ms'. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2914 |
Transcript show:'nthMost -> '; show:t2; showCR:'ms'. |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2915 |
" |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2916 |
! |
dd9d3f24c6d0
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9843
diff
changeset
|
2917 |
|
5557 | 2918 |
size |
2919 |
"return the number of elements in the receiver. |
|
2920 |
This is usually redefined in subclasses for more performance." |
|
2921 |
||
2922 |
|count "{ Class: SmallInteger }" | |
|
2923 |
||
2924 |
count := 0. |
|
2925 |
self do:[:element | |
|
6135 | 2926 |
count := count + 1 |
5557 | 2927 |
]. |
2928 |
^ count |
|
6547
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2929 |
! |
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2930 |
|
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2931 |
speciesForAdding |
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2932 |
"like species, but redefined for collections which cannot grow easily. |
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2933 |
Used by functions which create a growing collection (see collect:with:, for example)" |
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2934 |
|
86e092527dd1
+#speciesForAdding; better #collect:with: for fixed size collections
Claus Gittinger <cg@exept.de>
parents:
6511
diff
changeset
|
2935 |
^ self species |
602 | 2936 |
! ! |
2937 |
||
7168
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2938 |
!Collection methodsFor:'set operations'! |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2939 |
|
7169 | 2940 |
\ aCollection |
8606 | 2941 |
"return a new set containing all elements of the receiver, |
2942 |
which are NOT also contained in the aCollection |
|
7168
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2943 |
For large collections you better use a Set for aCollection" |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2944 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2945 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2946 |
|newCollection| |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2947 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2948 |
newCollection := self speciesForAdding new. |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2949 |
self do:[:element | |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2950 |
(aCollection includes:element) ifFalse:[ |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2951 |
newCollection add:element |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2952 |
] |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2953 |
]. |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2954 |
^ newCollection |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2955 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2956 |
" |
7169 | 2957 |
#(0 1 2 3 4 5 6 7 8 9) \ #(1 2 3) asSet |
2958 |
#(0 1 2 3 4 5 6 7 8 9) \ #(1 2 3) |
|
2959 |
('hello' \ 'l') asString |
|
7168
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2960 |
" |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2961 |
! |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2962 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2963 |
intersect:aCollection |
8606 | 2964 |
"return a new set containing all elements of the receiver, |
2965 |
which are also contained in the argument collection. |
|
7168
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2966 |
For large collections you better use a Set for self" |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2967 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2968 |
|newCollection| |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2969 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2970 |
newCollection := self speciesForAdding new. |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2971 |
aCollection do:[:element | |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2972 |
(self includes:element) ifTrue:[ |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2973 |
newCollection add:element |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2974 |
] |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2975 |
]. |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2976 |
^ newCollection |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2977 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2978 |
" |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2979 |
#(0 1 2 3 4 5 6 7 8 9) asSet intersect:#(1 2 3 11) |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2980 |
#(0 1 2 3 4 5 6 7 8 9) intersect:#(1 2 3 11) |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2981 |
" |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2982 |
! |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
2983 |
|
7169 | 2984 |
union:aCollection |
2985 |
"return a new set containing all elements of the receiver |
|
2986 |
plus those of the aCollection" |
|
2987 |
||
2988 |
|newCollection| |
|
2989 |
||
2990 |
newCollection := self speciesForAdding new. |
|
2991 |
newCollection addAll:self. |
|
2992 |
newCollection addAll:aCollection. |
|
2993 |
^ newCollection |
|
2994 |
||
2995 |
" |
|
2996 |
#(0 2 4 6 8) union:#(1 3 5 7) |
|
11384 | 2997 |
#(0 2 4 6 8) union:#(0 1 3 5 7) |
7169 | 2998 |
" |
2999 |
! |
|
3000 |
||
7168
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3001 |
xor:aCollection |
8606 | 3002 |
"return a new set containing all elements, |
3003 |
which are contained in either the receiver or aCollection, but not in both. |
|
3004 |
||
3005 |
For large collections you better use Sets for both self and aCollection" |
|
7168
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3006 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3007 |
|newCollection| |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3008 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3009 |
newCollection := self speciesForAdding new. |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3010 |
aCollection do:[:element | |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3011 |
(self includes:element) ifFalse:[ |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3012 |
newCollection add:element |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3013 |
] |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3014 |
]. |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3015 |
self do:[:element| |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3016 |
(aCollection includes:element) ifFalse:[ |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3017 |
newCollection add:element. |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3018 |
]. |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3019 |
]. |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3020 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3021 |
^ newCollection |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3022 |
|
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3023 |
" |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3024 |
#(0 1 2 3 4 5 6 7 8 9) xor:#(1 2 3 11) |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3025 |
" |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3026 |
! ! |
e5400f46d437
Move set operations (#intersect: et al) to Collection
Stefan Vogel <sv@exept.de>
parents:
7164
diff
changeset
|
3027 |
|
10811 | 3028 |
!Collection methodsFor:'sorting & reordering'! |
3029 |
||
3030 |
topologicalSort |
|
3031 |
"Sort a partial ordered collection. |
|
3032 |
The receiver consists of tupels defining a partial order. |
|
3033 |
Use the algorithm by R. E. Tarjan from 1972. |
|
3034 |
Answer an OrderedCollection containing the sorted items" |
|
3035 |
||
3036 |
|graph roots sorted count| |
|
3037 |
||
3038 |
"create a graph. |
|
3039 |
For each node there is an entry containing the number of references |
|
3040 |
and a list of arcs to other nodes" |
|
3041 |
||
3042 |
graph := Dictionary new. |
|
3043 |
||
3044 |
self do:[:eachTuple| |
|
3045 |
|node1| |
|
3046 |
node1 := eachTuple first. |
|
3047 |
graph at:node1 ifAbsentPut:[OrderedCollection with:0]. |
|
3048 |
1 to:(eachTuple size-1) do:[:i| |
|
3049 |
|node2 n2| |
|
3050 |
||
3051 |
node1 := eachTuple at:i. |
|
3052 |
node2 := eachTuple at:i+1. |
|
3053 |
"add the node" |
|
3054 |
graph at:node2 ifAbsentPut:[OrderedCollection with:0]. |
|
3055 |
"add an arc from node1 to node2" |
|
3056 |
(graph at:node1) add:node2. |
|
3057 |
"increment count on incoming arcs of node2" |
|
3058 |
n2 := graph at:node2. |
|
3059 |
n2 at:1 put:(n2 first + 1). |
|
3060 |
]. |
|
3061 |
]. |
|
3062 |
||
3063 |
"now find the root nodes (having zero incoming arcs)" |
|
3064 |
roots := OrderedCollection new. |
|
3065 |
graph keysAndValuesDo:[:eachKey :eachValue| |
|
3066 |
eachValue first = 0 ifTrue:[ |
|
3067 |
roots add:eachKey |
|
3068 |
]. |
|
3069 |
]. |
|
3070 |
||
3071 |
"for each root, out it to the sorted list and remove it from the graph. |
|
3072 |
This may cause referenced nodes to be moved to the root" |
|
3073 |
||
3074 |
sorted := OrderedCollection new:graph size. |
|
3075 |
[roots notEmpty] whileTrue:[ |
|
3076 |
|root eachEntry| |
|
3077 |
||
3078 |
root := roots removeFirst. |
|
3079 |
sorted add:root. |
|
3080 |
eachEntry := graph removeKey:root. |
|
3081 |
2 to:eachEntry size do:[:i| |
|
3082 |
|eachChild eachChildGraph| |
|
3083 |
eachChild := eachEntry at:i. |
|
3084 |
eachChildGraph := graph at:eachChild. |
|
3085 |
count := eachChildGraph at:1. |
|
3086 |
eachChildGraph at:1 put:(count - 1). |
|
3087 |
count = 1 ifTrue:[ |
|
3088 |
roots add:eachChild. |
|
3089 |
]. |
|
3090 |
]. |
|
3091 |
]. |
|
3092 |
||
3093 |
graph notEmpty ifTrue:[ |
|
3094 |
self error:'cycle in ordering' mayProceed:true. |
|
3095 |
]. |
|
3096 |
||
3097 |
^ sorted |
|
3098 |
||
3099 |
" |
|
3100 |
#((1 2) (1 3) (3 2)) topologicalSort |
|
11384 | 3101 |
#((1 2) (1 3) (3 2) (4)) topologicalSort |
3102 |
||
3103 |
with cycles: |
|
10811 | 3104 |
#((1 2) (1 3) (3 1)) topologicalSort |
11384 | 3105 |
#((1 2) (2 3) (3 1)) topologicalSort |
3106 |
#((1 2) (2 3) (3 4) (4 1)) topologicalSort |
|
11385
c3d908e81ec7
changed #topologicalSort - comment
Stefan Vogel <sv@exept.de>
parents:
11384
diff
changeset
|
3107 |
#((1 1) (1 2) (1 3) (3 2) (4)) topologicalSort |
10811 | 3108 |
|
3109 |
(Smalltalk allClasses collect:[:eachClass| |
|
3110 |
Array with:eachClass superclass with:eachClass |
|
3111 |
]) topologicalSort |
|
3112 |
" |
|
3113 |
! ! |
|
3114 |
||
602 | 3115 |
!Collection methodsFor:'testing'! |
3116 |
||
3117 |
capacity |
|
3118 |
"return the number of elements, that the receiver is |
|
3119 |
prepared to take. For most collections, this is the actual |
|
3120 |
size. However, some have more space preallocated to allow |
|
3121 |
for faster adding of elements. |
|
3122 |
Not used by the system; added for ST-80 compatibility." |
|
3123 |
||
3124 |
^ self size |
|
3125 |
! |
|
3126 |
||
3127 |
includes:anElement |
|
3128 |
"return true, if an object equal to the argument, anObject is in the list. |
|
3129 |
This compares using #= (i.e. it does not look for the object itself, |
|
3130 |
instead, one that compares equal). |
|
7807 | 3131 |
See #includesIdentical: when identity is asked for. |
3132 |
This is a *very* slow fallback - many subclasses redefine this for performance." |
|
602 | 3133 |
|
3134 |
self do:[:element | |
|
6135 | 3135 |
(anElement = element) ifTrue:[^ true]. |
602 | 3136 |
]. |
3137 |
^ false |
|
3138 |
! |
|
3139 |
||
3140 |
includesAll:aCollection |
|
3141 |
"return true, if the the receiver includes all elements of |
|
3142 |
the argument, aCollection; false if any is missing. |
|
3143 |
Notice: this method has O-square runtime behavior and may be |
|
10092
70a5cb4e5df0
code cleanup: use #contains/#conform instead of explicit loop
Claus Gittinger <cg@exept.de>
parents:
9919
diff
changeset
|
3144 |
slow for big receivers/args. |
70a5cb4e5df0
code cleanup: use #contains/#conform instead of explicit loop
Claus Gittinger <cg@exept.de>
parents:
9919
diff
changeset
|
3145 |
Think about using a Set, or Dictionary." |
70a5cb4e5df0
code cleanup: use #contains/#conform instead of explicit loop
Claus Gittinger <cg@exept.de>
parents:
9919
diff
changeset
|
3146 |
|
70a5cb4e5df0
code cleanup: use #contains/#conform instead of explicit loop
Claus Gittinger <cg@exept.de>
parents:
9919
diff
changeset
|
3147 |
^ aCollection conform:[:element | (self includes:element)] |
602 | 3148 |
|
3149 |
" |
|
3150 |
#(1 2 3 4 5 6 7) includesAll:#(1 2 3) |
|
3151 |
#('hello' 'there' 'world') includesAll:#('hello' 'world') |
|
3152 |
#(1 2 3 4 5 6 7) includesAll:#(7 8 9) |
|
3153 |
" |
|
10092
70a5cb4e5df0
code cleanup: use #contains/#conform instead of explicit loop
Claus Gittinger <cg@exept.de>
parents:
9919
diff
changeset
|
3154 |
|
70a5cb4e5df0
code cleanup: use #contains/#conform instead of explicit loop
Claus Gittinger <cg@exept.de>
parents:
9919
diff
changeset
|
3155 |
"Modified: / 13-10-2006 / 12:54:50 / cg" |
602 | 3156 |
! |
3157 |
||
3158 |
includesAny:aCollection |
|
3159 |
"return true, if the the receiver includes any elements of |
|
3160 |
the argument, aCollection; false if it includes none. |
|
7807 | 3161 |
Notice: this method has O^2(N) runtime behavior and may be |
3162 |
slow for big receivers/args. |
|
3163 |
Think about using a Set or Dictionary. |
|
3164 |
Some speedup is also possible, by arranging highly |
|
6135 | 3165 |
probable elements towards the beginning of aCollection, |
3166 |
to avoid useless searches." |
|
602 | 3167 |
|
3168 |
aCollection do:[:element | |
|
6135 | 3169 |
(self includes:element) ifTrue:[^ true]. |
602 | 3170 |
]. |
3171 |
^ false |
|
3172 |
||
3173 |
" |
|
3174 |
#(1 2 3 4 5 6 7) includesAny:#(1 2 3) |
|
3175 |
#('hello' 'there' 'world') includesAny:#('hello' 'world') |
|
3176 |
#(1 2 3 4 5 6 7) includesAny:#(7 8 9) |
|
3177 |
#(1 2 3 4 5 6 7) includesAny:#(8 9 10) |
|
3178 |
" |
|
3179 |
! |
|
3180 |
||
10504 | 3181 |
includesAnyIdentical:aCollection |
3182 |
"return true, if the the receiver includes any elements of |
|
3183 |
the argument, aCollection; false if it includes none. |
|
3184 |
Use identity compare for comparing. |
|
3185 |
Notice: this method has O^2(N) runtime behavior and may be |
|
3186 |
slow for big receivers/args. |
|
3187 |
Think about using a Set or Dictionary. |
|
3188 |
Some speedup is also possible, by arranging highly |
|
3189 |
probable elements towards the beginning of aCollection, |
|
3190 |
to avoid useless searches." |
|
3191 |
||
3192 |
aCollection do:[:element | |
|
3193 |
(self includesIdentical:element) ifTrue:[^ true]. |
|
3194 |
]. |
|
3195 |
^ false |
|
3196 |
||
3197 |
" |
|
3198 |
#(1 2 3 4 5 6 7) includesAnyIdentical:#(1 2 3) |
|
3199 |
#('hello' 'there' 'world') includesAnyIdentical:#('hello' 'world') |
|
3200 |
#(1 2 3 4 5 6 7) includesAnyIdentical:#(7 8 9) |
|
3201 |
#(1 2 3 4 5 6 7) includesAnyIdentical:#(8 9 10) |
|
3202 |
" |
|
3203 |
! |
|
3204 |
||
602 | 3205 |
includesIdentical:anElement |
7807 | 3206 |
"return true, if the argument, anObject is in the collection. |
602 | 3207 |
This compares using #== (i.e. object identity). |
7807 | 3208 |
See #includes: when equality is asked for. |
3209 |
This is a *very* slow fallback - many subclasses redefine this for performance." |
|
602 | 3210 |
|
3211 |
self do:[:element | |
|
6135 | 3212 |
(anElement == element) ifTrue:[^ true]. |
602 | 3213 |
]. |
3214 |
^ false |
|
3215 |
! |
|
3216 |
||
9005 | 3217 |
isCollection |
3218 |
"return true, if the receiver is some kind of collection; |
|
3219 |
true is returned here - the method is redefined from Object." |
|
3220 |
||
3221 |
^ true |
|
3222 |
! |
|
3223 |
||
602 | 3224 |
isEmpty |
3225 |
"return true, if the receiver is empty" |
|
3226 |
||
3227 |
^ self size == 0 |
|
3228 |
! |
|
3229 |
||
6181 | 3230 |
isEmptyOrNil |
8833 | 3231 |
"return true if I am nil or an empty collection - true here, if the receivers size is 0, |
3232 |
(from Sqeak)" |
|
6181 | 3233 |
|
3234 |
^ self isEmpty |
|
3235 |
||
3236 |
"Created: / 13.11.2001 / 13:17:12 / cg" |
|
6182 | 3237 |
"Modified: / 13.11.2001 / 13:28:35 / cg" |
6181 | 3238 |
! |
3239 |
||
6068
1d5ca1175f3f
added #isNilOrEmptyCollection
Claus Gittinger <cg@exept.de>
parents:
6052
diff
changeset
|
3240 |
isNilOrEmptyCollection |
8833 | 3241 |
"return true if I am nil or an empty collection - false here. |
3242 |
Obsolete, use isEmptyOrNil." |
|
3243 |
||
3244 |
<resource:#obsolete> |
|
6068
1d5ca1175f3f
added #isNilOrEmptyCollection
Claus Gittinger <cg@exept.de>
parents:
6052
diff
changeset
|
3245 |
|
1d5ca1175f3f
added #isNilOrEmptyCollection
Claus Gittinger <cg@exept.de>
parents:
6052
diff
changeset
|
3246 |
^ self isEmpty |
6182 | 3247 |
|
3248 |
"Modified: / 13.11.2001 / 13:27:55 / cg" |
|
6068
1d5ca1175f3f
added #isNilOrEmptyCollection
Claus Gittinger <cg@exept.de>
parents:
6052
diff
changeset
|
3249 |
! |
1d5ca1175f3f
added #isNilOrEmptyCollection
Claus Gittinger <cg@exept.de>
parents:
6052
diff
changeset
|
3250 |
|
9005 | 3251 |
isNonByteCollection |
3252 |
"return true, if the receiver is some kind of collection, but not a String, ByteArray etc.; |
|
3253 |
true is returned here - the method is redefined from Object." |
|
3254 |
||
3255 |
^ true |
|
3256 |
! |
|
3257 |
||
3258 |
isSorted |
|
3259 |
"return true, if the receiver is sorted. |
|
3260 |
Collections which hold their elements in sorted order |
|
3261 |
should return true. Some algorithms (quicksort) degenerate when |
|
3262 |
operating on sorted collections and can be avoided if this information |
|
3263 |
is given. The default returned here (false) should not hurt. |
|
3264 |
I.e. you should NEVER depend on that in your application." |
|
3265 |
||
3266 |
^ false |
|
3267 |
||
3268 |
"Created: 13.4.1996 / 12:35:55 / cg" |
|
3269 |
! |
|
3270 |
||
3271 |
isSortedBy:aBlock |
|
3272 |
"return true, if my elements are sorted (already) by the given criterion (sortBlock). |
|
3273 |
Collections which hold their elements in sorted order |
|
3274 |
should return true. Some algorithms (quicksort) degenerate when |
|
3275 |
operating on sorted collections and can be avoided if this information |
|
3276 |
is given. The default returned here (false) should not hurt. |
|
3277 |
I.e. you should NEVER depend on that in your application." |
|
3278 |
||
3279 |
^ false |
|
3280 |
||
3281 |
! |
|
3282 |
||
3283 |
isSortedCollection |
|
3284 |
"return true, if the receiver is a sortedCollection." |
|
3285 |
||
3286 |
^ false |
|
3287 |
||
3288 |
! |
|
3289 |
||
9247 | 3290 |
isWeakCollection |
3291 |
"return true, if the receiver has weak references to its elements." |
|
3292 |
||
3293 |
^ false |
|
3294 |
! |
|
3295 |
||
602 | 3296 |
notEmpty |
3297 |
"return true, if the receiver is not empty" |
|
3298 |
||
3299 |
^ self isEmpty not |
|
3300 |
! |
|
3301 |
||
6932 | 3302 |
notEmptyOrNil |
3303 |
"Squeak compatibility: |
|
3304 |
return true if I am neither nil nor an empty collection." |
|
3305 |
||
3306 |
^ self notEmpty |
|
3307 |
! |
|
3308 |
||
602 | 3309 |
occurrencesOf:anElement |
3310 |
"return the number of occurrences of the argument, anElement in |
|
5048 | 3311 |
the receiver. Uses #= (i.e. equality) compare." |
602 | 3312 |
|
3313 |
|count "{ Class: SmallInteger }" | |
|
3314 |
||
3315 |
count := 0. |
|
3316 |
self do:[:element | |
|
5048 | 3317 |
(anElement = element) ifTrue:[ |
3318 |
count := count + 1 |
|
3319 |
]. |
|
602 | 3320 |
]. |
3321 |
^ count |
|
8274 | 3322 |
! |
3323 |
||
3324 |
occurrencesOfAny:aCollectionOfElements |
|
3325 |
"return the number of occurrences of any in aCollectionOfElements in the receiver. |
|
3326 |
Uses #= (i.e. equality) compare. |
|
3327 |
Should be redefined in subclass(es) if ever used heavily." |
|
3328 |
||
3329 |
|count "{ Class: SmallInteger }" | |
|
3330 |
||
3331 |
count := 0. |
|
8275 | 3332 |
aCollectionOfElements do:[:element | |
3333 |
count := count + (self occurrencesOf:element) |
|
8274 | 3334 |
]. |
3335 |
^ count |
|
3336 |
||
3337 |
" |
|
3338 |
#(1 4 6 8 4 1) occurrencesOfAny:#(1 4) |
|
3339 |
#(1 4 6 8 4 1) occurrencesOfAny:#(2 5) |
|
3340 |
'hello world' occurrencesOfAny:'hel' |
|
3341 |
" |
|
602 | 3342 |
! ! |
3343 |
||
4680 | 3344 |
!Collection methodsFor:'tracing'! |
3345 |
||
3346 |
traceInto:aRequestor level:level from:referrer |
|
3347 |
"double dispatch into tracer, passing my type implicitely in the selector" |
|
3348 |
||
3349 |
^ aRequestor traceCollection:self level:level from:referrer |
|
3350 |
||
3351 |
||
3352 |
! ! |
|
3353 |
||
8395
6bd97113cb4c
Generalize visitor pattern and define #visit...:with: -methods instead
Stefan Vogel <sv@exept.de>
parents:
8359
diff
changeset
|
3354 |
!Collection methodsFor:'visiting'! |
6bd97113cb4c
Generalize visitor pattern and define #visit...:with: -methods instead
Stefan Vogel <sv@exept.de>
parents:
8359
diff
changeset
|
3355 |
|
6bd97113cb4c
Generalize visitor pattern and define #visit...:with: -methods instead
Stefan Vogel <sv@exept.de>
parents:
8359
diff
changeset
|
3356 |
acceptVisitor:aVisitor with:aParameter |
6bd97113cb4c
Generalize visitor pattern and define #visit...:with: -methods instead
Stefan Vogel <sv@exept.de>
parents:
8359
diff
changeset
|
3357 |
|
6bd97113cb4c
Generalize visitor pattern and define #visit...:with: -methods instead
Stefan Vogel <sv@exept.de>
parents:
8359
diff
changeset
|
3358 |
^ aVisitor visitCollection:self with:aParameter |
6bd97113cb4c
Generalize visitor pattern and define #visit...:with: -methods instead
Stefan Vogel <sv@exept.de>
parents:
8359
diff
changeset
|
3359 |
! ! |
6bd97113cb4c
Generalize visitor pattern and define #visit...:with: -methods instead
Stefan Vogel <sv@exept.de>
parents:
8359
diff
changeset
|
3360 |
|
2097 | 3361 |
!Collection class methodsFor:'documentation'! |
628 | 3362 |
|
3363 |
version |
|
11469 | 3364 |
^ '$Header: /cvs/stx/stx/libbasic/Collection.st,v 1.214 2009-01-16 12:53:46 cg Exp $' |
628 | 3365 |
! ! |
6867 | 3366 |
|
602 | 3367 |
Collection initialize! |