author | Claus Gittinger <cg@exept.de> |
Fri, 07 Apr 2000 10:09:58 +0200 | |
changeset 5359 | 396b77b6f1d2 |
parent 5048 | b1e10ce753fd |
child 5381 | 914e310a69be |
permissions | -rw-r--r-- |
1 | 1 |
" |
2 |
COPYRIGHT (c) 1993 by Claus Gittinger |
|
159 | 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 |
" |
|
12 |
||
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
13 |
"{ Package: 'stx:libbasic' }" |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
14 |
|
1 | 15 |
OrderedCollection subclass:#SortedCollection |
1155 | 16 |
instanceVariableNames:'sortBlock' |
17 |
classVariableNames:'DefaultSortBlock' |
|
18 |
poolDictionaries:'' |
|
19 |
category:'Collections-Sequenceable' |
|
1 | 20 |
! |
21 |
||
77 | 22 |
!SortedCollection class methodsFor:'documentation'! |
1 | 23 |
|
88 | 24 |
copyright |
25 |
" |
|
26 |
COPYRIGHT (c) 1993 by Claus Gittinger |
|
159 | 27 |
All Rights Reserved |
88 | 28 |
|
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 |
! |
|
37 |
||
77 | 38 |
documentation |
39 |
" |
|
40 |
I keep my elements sorted. The sort order is defined by a sortblock, |
|
41 |
a two-argument block which, when given two elements of the collection, |
|
42 |
should return true if the element given as first arg has to come before the |
|
43 |
element given as second arg. |
|
44 |
||
1156 | 45 |
Equal elements may occur multiple times. |
46 |
||
47 |
SortedCollection uses quickSort to resort and a binary search when adding/removing |
|
48 |
elements. |
|
49 |
Because insertion/removal may require that remaining elements have to |
|
50 |
be shifted within the container, adding many individual elements may be done faster |
|
51 |
by creating a completely new collection from the unsorted elements. |
|
1167 | 52 |
(see examples) |
1156 | 53 |
|
77 | 54 |
Thus a sortBlock of [:a :b | a < b] defines ascending sort-order, |
55 |
while [:a :b | a > b] defines descening order. |
|
56 |
The default sortBlock for SortedCollections is the first one. |
|
1290 | 57 |
|
3251
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
58 |
Compatibility Warning: |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
59 |
VW seems to use a default sortBlock which compares a<=b, |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
60 |
while ST/X uses a<b. |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
61 |
That means, that elements which are compared MUST understand #< in ST/X |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
62 |
while the minumum protocol is #<= in VW. |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
63 |
This may be changed in a future release of ST/X |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
64 |
(it is not yet, to not confuse existing applications ... |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
65 |
... be aware, that the sortBlock has an effect on a few algorithms |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
66 |
found here; especially #indexForInserting is critical.) |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
67 |
|
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
68 |
|
1290 | 69 |
[author:] |
70 |
Claus Gittinger |
|
77 | 71 |
" |
1167 | 72 |
! |
73 |
||
74 |
examples |
|
75 |
" |
|
1175 | 76 |
when many elements are to be added, it may be better to add them |
77 |
all en-bloeque instead of individually. |
|
1167 | 78 |
The reason is that for each individual #add:, the contents has to be |
1175 | 79 |
shifted, to create an empty slot for the new element. |
1167 | 80 |
|
81 |
timing example: |
|
82 |
||
83 |
|o rnd| |
|
84 |
||
85 |
o := SortedCollection new. |
|
86 |
rnd := Random new. |
|
1175 | 87 |
10000 timesRepeat:[ |
1167 | 88 |
o add:rnd next. |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
89 |
] |
1167 | 90 |
|
1175 | 91 |
takes 1365 ms on a P5 (admitted: this is a fast machine ;-) |
1167 | 92 |
In contrast: |
93 |
||
94 |
|o rnd| |
|
95 |
||
96 |
o := OrderedCollection new. |
|
97 |
rnd := Random new. |
|
1175 | 98 |
10000 timesRepeat:[ |
1167 | 99 |
o add:rnd next. |
100 |
]. |
|
101 |
o := o asSortedCollection |
|
102 |
||
1175 | 103 |
takes 383 ms on the same machine. |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
104 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
105 |
If you already have a big sortedCollection at hand, adding multiple |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
106 |
items may be better done with #addAll:, which resorts all elements, if |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
107 |
the number of added items is more than some threshold number. |
3251
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
108 |
However, the break-even point where bulk-adding is faster depends |
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
109 |
on the machine ... (and ST/X version ;-). |
1167 | 110 |
" |
77 | 111 |
! ! |
1 | 112 |
|
113 |
!SortedCollection class methodsFor:'initialization'! |
|
114 |
||
115 |
initialize |
|
1155 | 116 |
"setup the default sortBlock." |
117 |
||
118 |
"/ only do this once at early startup |
|
913 | 119 |
DefaultSortBlock isNil ifTrue:[ |
1155 | 120 |
DefaultSortBlock := [:a :b | a < b ] |
913 | 121 |
] |
1 | 122 |
|
913 | 123 |
" |
124 |
SortedCollection initialize |
|
125 |
" |
|
1155 | 126 |
|
127 |
"Modified: 12.4.1996 / 12:29:27 / cg" |
|
1 | 128 |
! ! |
129 |
||
130 |
!SortedCollection class methodsFor:'instance creation'! |
|
131 |
||
2929 | 132 |
forStrings |
133 |
"this is supposed to return a sortedCollection, which sorts using |
|
134 |
the current locales collating sequence. For now, simply use a |
|
135 |
normal string compare. |
|
136 |
This will change" |
|
137 |
||
138 |
^ self new |
|
139 |
||
140 |
"Modified: 13.9.1997 / 10:18:58 / cg" |
|
141 |
"Created: 13.9.1997 / 10:41:54 / cg" |
|
142 |
! |
|
143 |
||
144 |
forStrings:size |
|
145 |
"this is supposed to return a sortedCollection, which sorts using |
|
146 |
the current locales collating sequence. For now, simply use a |
|
147 |
normal string compare. |
|
148 |
This will change" |
|
149 |
||
150 |
^ self new:size |
|
151 |
||
152 |
"Modified: 13.9.1997 / 10:18:58 / cg" |
|
153 |
! |
|
154 |
||
1 | 155 |
new |
2 | 156 |
"return a new sortedCollection, the sorting is done using |
1155 | 157 |
a compare for a < b, in ascending order" |
2 | 158 |
|
1 | 159 |
^ super new setSortBlock:DefaultSortBlock |
1155 | 160 |
|
161 |
"Modified: 12.4.1996 / 12:28:18 / cg" |
|
1 | 162 |
! |
163 |
||
164 |
new:size |
|
2 | 165 |
"return a new sortedCollection with preallocated size. |
1155 | 166 |
The sorting is done using a compare for a < b, in ascending order" |
2 | 167 |
|
1 | 168 |
^ (super new:size) setSortBlock:DefaultSortBlock |
1155 | 169 |
|
170 |
"Modified: 12.4.1996 / 12:28:22 / cg" |
|
1 | 171 |
! |
172 |
||
173 |
sortBlock:aBlock |
|
1155 | 174 |
"return a new sortedCollection, whe the sort order is defined |
175 |
by aBlock. |
|
176 |
This must be a two-argument block which returns true if its arg1 has to come before |
|
177 |
its arg2 in the collection." |
|
2 | 178 |
|
1 | 179 |
^ super new setSortBlock:aBlock |
1155 | 180 |
|
181 |
"default: |
|
182 |
|s| |
|
183 |
||
184 |
s := SortedCollection new. |
|
185 |
s add:15; add:99; add:3; add:-29; add:17; add:-6. |
|
1422 | 186 |
Transcript showCR:s |
1155 | 187 |
" |
188 |
||
189 |
"sorting by absolute values: |
|
190 |
|s| |
|
191 |
||
192 |
s := SortedCollection sortBlock:[:a :b | a abs < b abs]. |
|
193 |
s add:15; add:99; add:3; add:29; add:17; add:-6. |
|
1422 | 194 |
Transcript showCR:s |
1155 | 195 |
" |
196 |
||
197 |
"default again: |
|
198 |
|s| |
|
199 |
||
200 |
s := SortedCollection new. |
|
201 |
s add:'foo'; add:'Bar'; add:'baz'; add:'hello'; add:'world'; add:'Wow'. |
|
1422 | 202 |
Transcript showCR:s |
1155 | 203 |
" |
204 |
||
205 |
"sorting strings caseless: |
|
206 |
|s| |
|
207 |
||
208 |
s := SortedCollection sortBlock:[:a :b | a asLowercase < b asLowercase]. |
|
209 |
s add:'foo'; add:'Bar'; add:'baz'; add:'hello'; add:'world'; add:'Wow'. |
|
1422 | 210 |
Transcript showCR:s |
1155 | 211 |
" |
212 |
||
213 |
"Modified: 12.4.1996 / 12:26:28 / cg" |
|
329 | 214 |
! |
215 |
||
216 |
withAll:aCollection sortBlock:aBlock |
|
217 |
"initialize from aCollection and set the sort-block" |
|
218 |
||
2248 | 219 |
^ (self sortBlock:aBlock) addAll:aCollection; yourself |
329 | 220 |
|
221 |
" |
|
222 |
SortedCollection withAll:#(1 2 3 4 5 6 7 8 9 0) |
|
1155 | 223 |
sortBlock:[:a :b | a > b] |
224 |
" |
|
225 |
||
226 |
"default: |
|
227 |
|s| |
|
228 |
||
229 |
s := SortedCollection withAll:#(15 99 3 29 17 -6). |
|
1422 | 230 |
Transcript showCR:s |
1155 | 231 |
" |
232 |
||
233 |
"sorting by absolute values: |
|
234 |
|s| |
|
235 |
||
236 |
s := SortedCollection withAll:#(15 99 3 29 17 -6) sortBlock:[:a :b | a abs < b abs]. |
|
1422 | 237 |
Transcript showCR:s |
329 | 238 |
" |
1155 | 239 |
|
240 |
"default again: |
|
241 |
|s| |
|
242 |
||
243 |
s := SortedCollection withAll:#('foo' 'Bar' 'baz' 'hello' 'world' 'Wow'). |
|
1422 | 244 |
Transcript showCR:s |
1155 | 245 |
" |
246 |
||
247 |
"sorting strings caseless: |
|
248 |
|s| |
|
249 |
||
250 |
s := SortedCollection withAll:#('foo' 'Bar' 'baz' 'hello' 'world' 'Wow') sortBlock:[:a :b | a asLowercase < b asLowercase]. |
|
1422 | 251 |
Transcript showCR:s |
1155 | 252 |
" |
253 |
||
254 |
"Modified: 12.4.1996 / 12:28:09 / cg" |
|
1 | 255 |
! ! |
256 |
||
257 |
!SortedCollection methodsFor:'adding & removing'! |
|
258 |
||
607 | 259 |
add:anObject |
260 |
"add the argument, anObject at the proper place in the |
|
261 |
receiver. Returns the argument, anObject." |
|
2 | 262 |
|
607 | 263 |
|index| |
1 | 264 |
|
607 | 265 |
lastIndex < firstIndex "i.e. self size == 0" ifTrue:[ |
3340 | 266 |
"/ empty - add at the end |
267 |
index := lastIndex. |
|
268 |
(index == contentsArray size) ifTrue:[ |
|
269 |
self makeRoomAtLast. |
|
270 |
index := lastIndex. |
|
271 |
]. |
|
272 |
lastIndex := index := index + 1. |
|
607 | 273 |
] ifFalse:[ |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
274 |
index := self indexForInserting:anObject. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
275 |
index := self makeRoomAtIndex:index. |
607 | 276 |
]. |
3340 | 277 |
contentsArray basicAt:index put:anObject. |
607 | 278 |
^ anObject |
2 | 279 |
|
607 | 280 |
" |
281 |
|c| #(7 3 9 10 99) asSortedCollection add:5; yourself |
|
282 |
#(7 3 9 10 99) asSortedCollection add:1; yourself |
|
283 |
#(7 3 9 10 99) asSortedCollection add:1000; yourself |
|
284 |
" |
|
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
285 |
|
3340 | 286 |
"Modified: / 13.3.1998 / 16:21:52 / cg" |
1 | 287 |
! |
288 |
||
289 |
add:newObject after:oldObject |
|
2 | 290 |
"catch this - its not allowed for sortedCollections" |
291 |
||
1 | 292 |
self shouldNotImplement |
293 |
! |
|
294 |
||
295 |
add:newObject before:oldObject |
|
2 | 296 |
"catch this - its not allowed for sortedCollections" |
297 |
||
1 | 298 |
self shouldNotImplement |
299 |
! |
|
300 |
||
301 |
addAll:aCollection |
|
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
302 |
"add all elements of the argument, aCollection to the receiver. |
5028
1f7e943ce46e
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
4596
diff
changeset
|
303 |
Returns the argument, aCollection (sigh)." |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
304 |
|
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
305 |
|addedCollection s| |
1 | 306 |
|
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
307 |
(aCollection isSortedCollection |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
308 |
and:[aCollection sortBlock == sortBlock]) ifTrue:[ |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
309 |
addedCollection := aCollection |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
310 |
] ifFalse:[ |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
311 |
addedCollection := Array withAll:(aCollection asArray). |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
312 |
addedCollection == aCollection ifTrue:[ |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
313 |
addedCollection := addedCollection shallowCopy |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
314 |
]. |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
315 |
addedCollection sort:sortBlock. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
316 |
|
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
317 |
"/ special case: I am empty - add them en-bloque. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
318 |
"/ (but only if the argument is not a sortedCollection, |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
319 |
"/ because quicksort degenerates to a veeery slow operation then) |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
320 |
|
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
321 |
self size == 0 ifTrue:[ |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
322 |
contentsArray := addedCollection. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
323 |
firstIndex := 1. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
324 |
lastIndex := addedCollection size. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
325 |
^ aCollection |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
326 |
]. |
1 | 327 |
]. |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
328 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
329 |
"/ |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
330 |
"/ do a mergeSort with the sortedContents |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
331 |
"/ |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
332 |
self mergeSorted:addedCollection. |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
333 |
^ aCollection |
1 | 334 |
|
77 | 335 |
" |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
336 |
#(7 3 9 10 99) asSortedCollection addAll:#(77 0 1 16 5); yourself |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
337 |
|
5028
1f7e943ce46e
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
4596
diff
changeset
|
338 |
( #(7 3 9 10 99) asSortedCollection:[:a :b | a > b]) |
1f7e943ce46e
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
4596
diff
changeset
|
339 |
addAll:#(77 0 1 16 5); yourself |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
340 |
|
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
341 |
#(7 3 9 10 99) asSortedCollection |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
342 |
addAll:( #(77 0 1 16 5) asSortedCollection:[:a :b | a > b]); yourself |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
343 |
|
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
344 |
(#(7 3 9 10 99) asSortedCollection:[:a :b | a > b]) |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
345 |
addAll:( #(77 0 1 16 5) asSortedCollection:[:a :b | a < b]); yourself |
77 | 346 |
" |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
347 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
348 |
"Modified: 13.4.1996 / 12:42:15 / cg" |
1 | 349 |
! |
350 |
||
607 | 351 |
addFirst:anObject |
352 |
"catch this - its not allowed for sortedCollections" |
|
353 |
||
354 |
self shouldNotImplement |
|
355 |
! |
|
1 | 356 |
|
607 | 357 |
addLast:anObject |
358 |
"catch this - its not allowed for sortedCollections" |
|
359 |
||
360 |
self shouldNotImplement |
|
361 |
! |
|
1 | 362 |
|
607 | 363 |
at:index put:anObject |
364 |
"catch this - its not allowed for sortedCollections" |
|
365 |
||
366 |
self shouldNotImplement |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
367 |
! |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
368 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
369 |
mergeSorted:aSortedCollection |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
370 |
"add all elements of the argument, aSortedCollection to the |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
371 |
receiver. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
372 |
This leads to an error, if the argument is not a sortedCollection. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
373 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
374 |
This should be used when a number of elements is to be added. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
375 |
Notice, that quicksort degenerates to a veeery slow bubble-like |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
376 |
sort when a collection of already sorted elements is given to it. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
377 |
Therefore, adding chunks is better done by sorting the chunk and merging |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
378 |
it in, instead of resorting the receiver." |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
379 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
380 |
|newContentsArray |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
381 |
contentsArray2 |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
382 |
destIndex "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
383 |
n1 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
384 |
n2 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
385 |
srcIndex1 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
386 |
srcIndex2 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
387 |
last1 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
388 |
last2 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
389 |
end1Reached end2Reached |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
390 |
el1 el2 | |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
391 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
392 |
n1 := self size. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
393 |
n2 := aSortedCollection size. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
394 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
395 |
newContentsArray := Array new:(n1 + n2). |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
396 |
destIndex := 1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
397 |
|
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
398 |
(aSortedCollection isSortedBy:sortBlock) ifTrue:[ |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
399 |
contentsArray2 := aSortedCollection contentsArray. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
400 |
srcIndex2 := aSortedCollection firstIndex. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
401 |
] ifFalse:[ |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
402 |
contentsArray2 := aSortedCollection. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
403 |
srcIndex2 := 1. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
404 |
]. |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
405 |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
406 |
last2 := srcIndex2 + n2 -1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
407 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
408 |
srcIndex1 := firstIndex. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
409 |
last1 := srcIndex1 + n1 -1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
410 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
411 |
(srcIndex1 <= last1 and:[srcIndex2 <= last2]) ifTrue:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
412 |
el1 := contentsArray at:srcIndex1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
413 |
el2 := contentsArray2 at:srcIndex2. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
414 |
end1Reached := end2Reached := false. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
415 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
416 |
[end1Reached or:[end2Reached]] whileFalse:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
417 |
(sortBlock value:el1 value:el2) ifTrue:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
418 |
"/ el1 to come before el2 |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
419 |
newContentsArray at:destIndex put:el1. destIndex := destIndex + 1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
420 |
srcIndex1 := srcIndex1 + 1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
421 |
srcIndex1 <= last1 ifTrue:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
422 |
el1 := contentsArray at:srcIndex1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
423 |
] ifFalse:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
424 |
end1Reached := true |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
425 |
] |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
426 |
] ifFalse:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
427 |
"/ el2 to come before el1 |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
428 |
newContentsArray at:destIndex put:el2. destIndex := destIndex + 1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
429 |
srcIndex2 := srcIndex2 + 1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
430 |
srcIndex2 <= last2 ifTrue:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
431 |
el2 := contentsArray2 at:srcIndex2. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
432 |
] ifFalse:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
433 |
end2Reached := true |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
434 |
] |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
435 |
] |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
436 |
] |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
437 |
]. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
438 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
439 |
"/ fill up with remaining elements from source1 |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
440 |
(srcIndex1 <= last1) ifTrue:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
441 |
newContentsArray |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
442 |
replaceFrom:destIndex |
3250
c4b444774f1c
oops - mergesort cannot simply copy remaining
Claus Gittinger <cg@exept.de>
parents:
2929
diff
changeset
|
443 |
to:(destIndex+(last1-srcIndex1)) |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
444 |
with:contentsArray |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
445 |
startingAt:srcIndex1 |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
446 |
]. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
447 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
448 |
"/ fill up with remaining elements from source2 |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
449 |
(srcIndex2 <= last2) ifTrue:[ |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
450 |
newContentsArray |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
451 |
replaceFrom:destIndex |
3250
c4b444774f1c
oops - mergesort cannot simply copy remaining
Claus Gittinger <cg@exept.de>
parents:
2929
diff
changeset
|
452 |
to:(destIndex+(last2-srcIndex2)) |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
453 |
with:contentsArray2 |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
454 |
startingAt:srcIndex2 |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
455 |
]. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
456 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
457 |
firstIndex := 1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
458 |
lastIndex := n1 + n2. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
459 |
contentsArray := newContentsArray |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
460 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
461 |
" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
462 |
#(7 3 9 10 99) asSortedCollection |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
463 |
mergeSorted:#(77 0 1 16 5) asSortedCollection |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
464 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
465 |
#(7 3 9 10 99) asSortedCollection |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
466 |
mergeSorted:#(77 0 3 1 98 99 16 5) asSortedCollection |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
467 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
468 |
#() asSortedCollection |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
469 |
mergeSorted:#(77 0 3 1 98 99 16 5) asSortedCollection |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
470 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
471 |
#(7 3 9 10 99) asSortedCollection |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
472 |
mergeSorted:#() asSortedCollection |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
473 |
" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
474 |
|
3250
c4b444774f1c
oops - mergesort cannot simply copy remaining
Claus Gittinger <cg@exept.de>
parents:
2929
diff
changeset
|
475 |
"Modified: / 30.1.1998 / 01:49:42 / cg" |
607 | 476 |
! ! |
477 |
||
478 |
!SortedCollection methodsFor:'converting'! |
|
479 |
||
480 |
asSortedCollection |
|
481 |
"return the receiver as a sorted collection" |
|
482 |
||
483 |
"could be an instance of a subclass..." |
|
484 |
self class == SortedCollection ifTrue:[ |
|
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
485 |
sortBlock == DefaultSortBlock ifTrue:[ |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
486 |
^ self |
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
487 |
] |
1 | 488 |
]. |
607 | 489 |
^ super asSortedCollection |
5029
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
490 |
! |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
491 |
|
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
492 |
asSortedCollection:aSortBlock |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
493 |
"return the receiver as a sorted collection, using aSortBlock. |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
494 |
Return the receiver, if its a sortedCollection and the sortBlock |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
495 |
is the same as the argument-sortBlock" |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
496 |
|
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
497 |
"could be an instance of a subclass..." |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
498 |
self class == SortedCollection ifTrue:[ |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
499 |
"/ if the sortBlock is the same, return the receiver |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
500 |
aSortBlock == sortBlock ifTrue:[ |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
501 |
^ self |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
502 |
]. |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
503 |
]. |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
504 |
^ super asSortedCollection:aSortBlock |
1 | 505 |
! ! |
506 |
||
95 | 507 |
!SortedCollection methodsFor:'copying'! |
508 |
||
607 | 509 |
copyEmpty:size |
510 |
"return a copy of the receiver with no elements, but |
|
511 |
the same size. This method has been be redefined to |
|
512 |
preserve the sortBlock." |
|
513 |
||
514 |
^ (self species new:size) sortBlock:sortBlock |
|
515 |
! |
|
516 |
||
159 | 517 |
postCopyFrom:anOriginal |
518 |
"sent after a copy or when a new collection species has been created. |
|
95 | 519 |
The new collection should have the same sortBlock as the original." |
520 |
||
159 | 521 |
sortBlock := anOriginal sortBlock |
95 | 522 |
|
523 |
" |
|
524 |
#(4 7 1 99 -1 17) asSortedCollection inspect |
|
159 | 525 |
#(4 7 1 99 -1 17) asSortedCollection copy inspect |
95 | 526 |
(#(4 7 1 99 -1 17) asSortedCollection sortBlock:[:a :b | a > b]) inspect |
159 | 527 |
(#(4 7 1 99 -1 17) asSortedCollection sortBlock:[:a :b | a > b]) copy inspect |
528 |
(#(4 7 1 99 -1 17) asSortedCollection select:[:e| e even]) inspect |
|
95 | 529 |
" |
530 |
! ! |
|
531 |
||
216 | 532 |
!SortedCollection methodsFor:'enumerating'! |
184 | 533 |
|
534 |
collect:aBlock |
|
535 |
"evaluate the argument, aBlock for every element in the collection |
|
536 |
and return a collection of the results. Redefined to return an OrderedCollection; |
|
537 |
see X3J20 spec. (SortedCollection>>collect: should return an OrderedCollection)" |
|
538 |
||
539 |
|newCollection |
|
540 |
start "{ Class:SmallInteger }" |
|
541 |
stop "{ Class:SmallInteger }" | |
|
542 |
||
543 |
newCollection := OrderedCollection new:(self size). |
|
544 |
stop := lastIndex. |
|
545 |
start := firstIndex. |
|
546 |
start to:stop do:[:index | |
|
547 |
newCollection add:(aBlock value:(contentsArray at:index)). |
|
548 |
]. |
|
549 |
^ newCollection |
|
550 |
! ! |
|
551 |
||
607 | 552 |
!SortedCollection methodsFor:'instance protocol'! |
553 |
||
554 |
sortBlock |
|
555 |
"return the block used for sorting" |
|
556 |
||
557 |
^ sortBlock |
|
558 |
! |
|
559 |
||
560 |
sortBlock:aSortBlock |
|
561 |
"change the sort criteria for a sorted collection, resort the elements of |
|
562 |
the collection, and return the receiver. The argument, aSortBlock must |
|
563 |
be a two-argument block which returns true if its arg1 has to come before |
|
564 |
its arg2 in the collection." |
|
565 |
||
566 |
sortBlock := aSortBlock. |
|
567 |
lastIndex > firstIndex ifTrue:[ |
|
568 |
contentsArray quickSortFrom:firstIndex to:lastIndex sortBlock:aSortBlock |
|
569 |
] |
|
570 |
||
571 |
" |
|
572 |
#(9 8 7 6 5 4 3) asSortedCollection |
|
573 |
#(9 8 7 6 5 4 3) asSortedCollection sortBlock:[:a : b | a < b] |
|
574 |
#(9 8 7 6 5 4 3) asSortedCollection sortBlock:[:a : b | a > b] |
|
575 |
#($f $G $z $Y $o $H) asSortedCollection |
|
576 |
#($f $G $z $Y $o $H) asSortedCollection sortBlock:[:a : b | a asUppercase < b asUppercase] |
|
577 |
" |
|
578 |
! ! |
|
579 |
||
580 |
!SortedCollection methodsFor:'private'! |
|
581 |
||
582 |
indexForInserting:anObject |
|
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
583 |
"search the index at which to insert anObject. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
584 |
Can also be used to search for an existing element |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
585 |
by checking if the element at the returned index is the one we look for. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
586 |
Uses a binarySearch since we can depend on the elements being on sorted order. |
607 | 587 |
The returned index is a physical one, for accessing contentsArray." |
588 |
||
589 |
|low "{ Class: SmallInteger}" |
|
590 |
high "{ Class: SmallInteger}" |
|
591 |
middle "{ Class: SmallInteger}" |
|
592 |
element| |
|
593 |
||
594 |
" |
|
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
595 |
we can of course use a binary search - since the elements are sorted |
607 | 596 |
" |
597 |
low := firstIndex. |
|
598 |
high := lastIndex. |
|
599 |
[low <= high] whileTrue:[ |
|
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
600 |
middle := (low + high) // 2. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
601 |
element := contentsArray at:middle. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
602 |
(sortBlock value:element value:anObject) ifTrue:[ |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
603 |
"middleelement is smaller than object" |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
604 |
low := middle + 1 |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
605 |
] ifFalse:[ |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
606 |
high := middle - 1 |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
607 |
] |
607 | 608 |
]. |
609 |
^ low |
|
610 |
||
611 |
" |
|
612 |
#(1 2 3 4 7 99 1313 981989 898989898) asSortedCollection indexForInserting:50 |
|
613 |
#(1.0 2.0 3 4 7 49.0 51.0 99 1313 981989 898989898) asSortedCollection indexForInserting:50 |
|
614 |
" |
|
615 |
||
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
616 |
"Modified: 12.4.1996 / 13:22:03 / cg" |
607 | 617 |
! |
618 |
||
619 |
setSortBlock: aSortBlock |
|
620 |
"set the sortblock without resorting - private only" |
|
621 |
||
622 |
sortBlock := aSortBlock |
|
623 |
! ! |
|
624 |
||
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
625 |
!SortedCollection methodsFor:'queries'! |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
626 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
627 |
isSorted |
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
628 |
"return true. if my elements are sorted" |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
629 |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
630 |
^ true |
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
631 |
! |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
632 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
633 |
isSortedBy:aBlock |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
634 |
"return true, if my elements are sorted (already) by the given criterion (sortBlock)." |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
635 |
|
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
636 |
aBlock == sortBlock ifTrue:[^ true]. |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
637 |
^ super isSortedBy:aBlock |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
638 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
639 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
640 |
! |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
641 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
642 |
isSortedCollection |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
643 |
"return true. if I am a sorted collection" |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
644 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
645 |
^ true |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
646 |
! ! |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
647 |
|
607 | 648 |
!SortedCollection methodsFor:'searching'! |
649 |
||
650 |
after:anObject ifAbsent:exceptionBlock |
|
651 |
"return the element after the argument, anObject; or nil if there is none. |
|
652 |
If anObject is contained multiple times in the collection, return the |
|
653 |
the first element which is non-equal to anObject. |
|
654 |
If the receiver does not contain anObject, return the result from evaluating |
|
655 |
exceptionBlock." |
|
656 |
||
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
657 |
|index "{ Class: SmallInteger }" |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
658 |
last "{ Class: SmallInteger }"| |
607 | 659 |
|
660 |
index := self indexForInserting:anObject. |
|
661 |
((index < firstIndex) |
|
662 |
or:[(contentsArray at:index) ~= anObject]) ifTrue:[^ exceptionBlock value]. |
|
663 |
||
664 |
"skip multiple occurences of the same ..." |
|
665 |
||
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
666 |
last := lastIndex. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
667 |
[(index <= last) and:[(contentsArray at:index) = anObject]] whileTrue:[ |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
668 |
index := index + 1 |
607 | 669 |
]. |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
670 |
(index > last) ifTrue:[^ nil]. |
607 | 671 |
^ contentsArray at:index |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
672 |
|
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
673 |
"Modified: 12.4.1996 / 13:20:33 / cg" |
607 | 674 |
! |
675 |
||
676 |
before:anObject ifAbsent:exceptionBlock |
|
677 |
"return the element before the argument, anObject; or nil if there is none. |
|
678 |
If the receiver does not contain anObject, return the result from evaluating |
|
679 |
exceptionBlock." |
|
680 |
||
681 |
|index "{ Class: SmallInteger }"| |
|
682 |
||
683 |
index := self indexForInserting:anObject. |
|
684 |
((index <= firstIndex) |
|
685 |
or:[(contentsArray at:index) ~= anObject]) ifTrue:[^ exceptionBlock value]. |
|
686 |
||
687 |
^ contentsArray at:index - 1 |
|
688 |
||
689 |
" |
|
690 |
#(7 3 9 10 99) asSortedCollection before:50 |
|
691 |
#(7 3 9 10 99) asSortedCollection before:1 |
|
692 |
#(7 3 9 10 99) asSortedCollection before:10 |
|
693 |
#(7 3 9 10 99) asSortedCollection before:7 |
|
694 |
#(7 3 9 10 99) asSortedCollection before:99 |
|
695 |
#(7 10 3 10 9 10 10 99) asSortedCollection before:9 |
|
696 |
#(7 10 3 10 9 10 10 99) asSortedCollection before:10 |
|
697 |
" |
|
4596 | 698 |
! |
699 |
||
700 |
indexOf:anElement |
|
701 |
"Return the index of anElement within the receiver. |
|
702 |
If the receiver does not contain anElement, return 0." |
|
703 |
||
704 |
^ self indexOf:anElement ifAbsent:0 |
|
705 |
! |
|
706 |
||
707 |
indexOf:anElement ifAbsent:exceptionBlock |
|
708 |
"Return the index of anElement within the receiver. |
|
709 |
If the receiver does not contain anElement, |
|
710 |
return the result of evaluating the argument, exceptionBlock." |
|
711 |
||
712 |
|insertionIndex index "{ Class: SmallInteger }" |
|
713 |
obj| |
|
714 |
||
715 |
firstIndex > lastIndex ifTrue:[ |
|
716 |
"/ empty |
|
717 |
^ exceptionBlock value |
|
718 |
]. |
|
719 |
||
720 |
"/ if I am small, the inherited linear search is faster ... |
|
721 |
(lastIndex - firstIndex) < 20 ifTrue:[ |
|
722 |
^ super indexOf:anElement ifAbsent:exceptionBlock |
|
723 |
]. |
|
724 |
||
725 |
insertionIndex := self indexForInserting:anElement. |
|
726 |
insertionIndex > lastIndex ifTrue:[ |
|
727 |
insertionIndex := lastIndex |
|
728 |
] ifFalse:[ |
|
729 |
insertionIndex < firstIndex ifTrue:[ |
|
730 |
insertionIndex := firstIndex |
|
731 |
] |
|
732 |
]. |
|
733 |
||
734 |
index := insertionIndex. |
|
735 |
[index >= firstIndex |
|
736 |
and:[obj := contentsArray basicAt:index. |
|
737 |
anElement = obj ifTrue: [^ index - firstIndex + 1]. |
|
738 |
[sortBlock value:anElement value:obj]]] |
|
739 |
whileTrue: [index := index - 1]. |
|
740 |
||
741 |
index := insertionIndex. |
|
742 |
[index <= lastIndex |
|
743 |
and: [obj := contentsArray basicAt: index. |
|
744 |
anElement = obj ifTrue: [^ index - firstIndex + 1]. |
|
745 |
[sortBlock value:obj value:anElement]]] |
|
746 |
whileTrue: [index := index + 1]. |
|
747 |
||
748 |
^exceptionBlock value |
|
749 |
||
750 |
" |
|
751 |
#('aa' 'bb' 'cc' 'dd') asSortedCollection indexOf:'bb' |
|
752 |
#('aa' 'bb' 'cc' 'dd' 'aa' 'bb' 'cc' 'dd') asSortedCollection indexOf:'bb' |
|
753 |
||
754 |
|allSyms indices| |
|
755 |
allSyms := Symbol allInstances asSortedCollection. |
|
756 |
Time millisecondsToRun:[ |
|
757 |
indices := allSyms collect:[:el | allSyms indexOf:el]. |
|
758 |
]. |
|
759 |
indices = (1 to:allSyms size) |
|
760 |
" |
|
607 | 761 |
! ! |
762 |
||
1 | 763 |
!SortedCollection methodsFor:'testing'! |
764 |
||
765 |
includes:anObject |
|
766 |
"return true, if the argument, anObject is in the collection. |
|
62 | 767 |
Redefined, since due to being sorted, the inclusion check can |
2 | 768 |
be done with log-n compares i.e. much faster." |
1 | 769 |
|
32 | 770 |
|index "{ Class: SmallInteger }"| |
1 | 771 |
|
77 | 772 |
index := self indexForInserting:anObject. |
32 | 773 |
((index < firstIndex) or:[index > lastIndex]) ifTrue:[^ false]. |
774 |
^ (contentsArray at:index) = anObject |
|
2 | 775 |
|
77 | 776 |
" |
777 |
#(7 3 9 10 99) asSortedCollection includes:50 |
|
778 |
#(7 3 9 10 99) asSortedCollection includes:10 |
|
779 |
" |
|
1 | 780 |
! |
781 |
||
782 |
occurrencesOf:anObject |
|
783 |
"return how many times the argument, anObject is in the collection. |
|
62 | 784 |
Redefined, since due to being sorted, the range of checked objects |
5048 | 785 |
can be limited i.e. it can be done much faster. |
786 |
Uses #= (i.e. equality) compare." |
|
1 | 787 |
|
788 |
|index "{ Class: SmallInteger }" |
|
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
789 |
tally "{ Class: SmallInteger }" |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
790 |
last "{ Class: SmallInteger }" | |
1 | 791 |
|
77 | 792 |
index := self indexForInserting:anObject. |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
793 |
last := lastIndex. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
794 |
((index < firstIndex) or:[index > last]) ifTrue:[^ 0]. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
795 |
|
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
796 |
"/ there may be multiple of them; count 'em |
32 | 797 |
|
1 | 798 |
tally := 0. |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
799 |
[(index <= last) and:[(contentsArray at:index) = anObject]] whileTrue:[ |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
800 |
tally := tally + 1. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
801 |
index := index + 1 |
1 | 802 |
]. |
803 |
^ tally |
|
2 | 804 |
|
77 | 805 |
" |
806 |
#(7 3 9 10 99) asSortedCollection occurrencesOf:50 |
|
807 |
#(7 3 9 10 99) asSortedCollection occurrencesOf:10 |
|
808 |
#(7 10 3 10 9 10 10 99) asSortedCollection occurrencesOf:10 |
|
809 |
" |
|
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
810 |
|
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
811 |
"Modified: 12.4.1996 / 18:48:40 / cg" |
77 | 812 |
! ! |
813 |
||
629 | 814 |
!SortedCollection class methodsFor:'documentation'! |
815 |
||
816 |
version |
|
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
817 |
^ '$Header: /cvs/stx/stx/libbasic/SortedCollection.st,v 1.44 2000-04-07 08:09:30 cg Exp $' |
629 | 818 |
! ! |
607 | 819 |
SortedCollection initialize! |