author | Claus Gittinger <cg@exept.de> |
Wed, 12 Feb 2014 15:33:40 +0100 | |
changeset 16000 | 74d0c38d1834 |
parent 14310 | b1787ec39fd8 |
child 16002 | 5fd1486ee60a |
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 |
" |
|
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
12 |
"{ Package: 'stx:libbasic' }" |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
13 |
|
1 | 14 |
OrderedCollection subclass:#SortedCollection |
1155 | 15 |
instanceVariableNames:'sortBlock' |
16 |
classVariableNames:'DefaultSortBlock' |
|
17 |
poolDictionaries:'' |
|
18 |
category:'Collections-Sequenceable' |
|
1 | 19 |
! |
20 |
||
77 | 21 |
!SortedCollection class methodsFor:'documentation'! |
1 | 22 |
|
88 | 23 |
copyright |
24 |
" |
|
25 |
COPYRIGHT (c) 1993 by Claus Gittinger |
|
159 | 26 |
All Rights Reserved |
88 | 27 |
|
28 |
This software is furnished under a license and may be used |
|
29 |
only in accordance with the terms of that license and with the |
|
30 |
inclusion of the above copyright notice. This software may not |
|
31 |
be provided or otherwise made available to, or used by, any |
|
32 |
other person. No title to or ownership of the software is |
|
33 |
hereby transferred. |
|
34 |
" |
|
35 |
! |
|
36 |
||
77 | 37 |
documentation |
38 |
" |
|
39 |
I keep my elements sorted. The sort order is defined by a sortblock, |
|
8874 | 40 |
a two-argument block which, when given two elements of the collection, |
41 |
should return true if the element given as first arg has to come before the |
|
77 | 42 |
element given as second arg. |
43 |
||
1156 | 44 |
Equal elements may occur multiple times. |
45 |
||
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
46 |
SortedCollection uses quickSort to resort and a binary search when adding/removing elements. |
1156 | 47 |
Because insertion/removal may require that remaining elements have to |
48 |
be shifted within the container, adding many individual elements may be done faster |
|
49 |
by creating a completely new collection from the unsorted elements. |
|
1167 | 50 |
(see examples) |
1156 | 51 |
|
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
52 |
A sortBlock of [:a :b | a < b] defines ascending sort-order, |
77 | 53 |
while [:a :b | a > b] defines descening order. |
54 |
The default sortBlock for SortedCollections is the first one. |
|
1290 | 55 |
|
3251
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
56 |
Compatibility Warning: |
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
57 |
VW seems to use a default sortBlock which compares a<=b, wheras ST/X uses a<b. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
58 |
That means, that elements which are compared MUST understand #< in ST/X |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
59 |
while the minumum protocol is #<= in VW. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
60 |
This may be changed in a future release of ST/X |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
61 |
(it is not yet, to not confuse existing applications ... |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
62 |
... be aware, that the sortBlock has an effect on a few algorithms |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
63 |
found here; especially #indexForInserting is critical.) |
8874 | 64 |
|
14304 | 65 |
[caveat:] |
66 |
a balanced tree may be a better choice, as inserting may be slow when |
|
67 |
elements have to be shifted. |
|
3251
87cac58a4e57
added VW compatibility warning
Claus Gittinger <cg@exept.de>
parents:
3250
diff
changeset
|
68 |
|
1290 | 69 |
[author:] |
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
70 |
Claus Gittinger |
77 | 71 |
" |
1167 | 72 |
! |
73 |
||
74 |
examples |
|
75 |
" |
|
8874 | 76 |
when many elements are to be added, it may be better to add them |
1175 | 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 |
||
9074 | 83 |
|o rnd| |
1167 | 84 |
|
9074 | 85 |
o := SortedCollection new. |
86 |
rnd := Random new. |
|
87 |
10000 timesRepeat:[ |
|
88 |
o add:rnd next. |
|
89 |
] |
|
1167 | 90 |
|
1175 | 91 |
takes 1365 ms on a P5 (admitted: this is a fast machine ;-) |
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
92 |
Times are a'changing: |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
93 |
Just came around 2005: on my 1.5Ghz laptop, this now takes 260ms... |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
94 |
an another comment 2008: on a 1.8Ghz laptop, it takes now 105ms... |
9074 | 95 |
|
1167 | 96 |
In contrast: |
97 |
||
9074 | 98 |
|o rnd| |
1167 | 99 |
|
9074 | 100 |
o := OrderedCollection new. |
101 |
rnd := Random new. |
|
102 |
10000 timesRepeat:[ |
|
103 |
o add:rnd next. |
|
104 |
]. |
|
105 |
o := o asSortedCollection |
|
1167 | 106 |
|
1175 | 107 |
takes 383 ms on the same machine. |
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
108 |
2005: on my 1.5Ghz laptop, this now takes 100ms |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
109 |
2008: on a 1.8Ghz laptop, this now takes 47ms |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
110 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
111 |
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
|
112 |
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
|
113 |
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
|
114 |
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
|
115 |
on the machine ... (and ST/X version ;-). |
11268
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
116 |
|
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
117 |
|
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
118 |
adding elements in order: |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
119 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
120 |
|c| |
11268
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
121 |
Time millisecondsToRun:[ |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
122 |
10 timesRepeat:[ |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
123 |
|c| |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
124 |
c := SortedCollection new. |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
125 |
(1 to:100000) do:[:e | c add:e]. |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
126 |
] |
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
127 |
]. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
128 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
129 |
(5.4.1: 2031 2187) |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
130 |
(5.4.3: 484 516) |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
131 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
132 |
|c| |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
133 |
c := SortedCollection new. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
134 |
(1 to:100000) do:[:e | c add:e]. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
135 |
self assert:(c asBag = (1 to:100000) asBag). |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
136 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
137 |
adding elements in reverse order: |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
138 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
139 |
Time millisecondsToRun:[ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
140 |
10 timesRepeat:[ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
141 |
|c| |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
142 |
c := SortedCollection new. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
143 |
(1 to:100000) reverseDo:[:e | c add:e]. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
144 |
] |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
145 |
]. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
146 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
147 |
(5.4.1: 201969) |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
148 |
(5.4.3: 1609 1766) |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
149 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
150 |
|c| |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
151 |
c := SortedCollection new. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
152 |
(1 to:100000) reverseDo:[:e | c add:e]. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
153 |
self assert:(c asBag = (1 to:100000) asBag). |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
154 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
155 |
adding elements in random order: |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
156 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
157 |
|toAdd| |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
158 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
159 |
toAdd := (1 to:100000) asOrderedCollection randomShuffle. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
160 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
161 |
Time millisecondsToRun:[ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
162 |
10 timesRepeat:[ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
163 |
|c| |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
164 |
c := SortedCollection new. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
165 |
toAdd do:[:e | c add:e]. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
166 |
] |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
167 |
]. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
168 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
169 |
(5.4.1: 108484) |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
170 |
(5.4.3: 75734) |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
171 |
|
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
172 |
|c| |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
173 |
c := SortedCollection new. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
174 |
(1 to:100000) asOrderedCollection randomShuffle do:[:e | c add:e]. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
175 |
self assert:(c asBag = (1 to:100000) asBag). |
1167 | 176 |
" |
77 | 177 |
! ! |
1 | 178 |
|
179 |
!SortedCollection class methodsFor:'initialization'! |
|
180 |
||
181 |
initialize |
|
8180
7c346c8015f2
Only use #> for comparisons, since this is the base mechanism.
Stefan Vogel <sv@exept.de>
parents:
7554
diff
changeset
|
182 |
"setup the default sortBlock. |
12034 | 183 |
Use #<, since this is the base method in Magnitude." |
1155 | 184 |
|
185 |
"/ only do this once at early startup |
|
913 | 186 |
DefaultSortBlock isNil ifTrue:[ |
12034 | 187 |
DefaultSortBlock := [:a :b | a < b] |
913 | 188 |
] |
1 | 189 |
|
913 | 190 |
" |
191 |
SortedCollection initialize |
|
192 |
" |
|
1155 | 193 |
|
194 |
"Modified: 12.4.1996 / 12:29:27 / cg" |
|
1 | 195 |
! ! |
196 |
||
197 |
!SortedCollection class methodsFor:'instance creation'! |
|
198 |
||
2929 | 199 |
forStrings |
200 |
"this is supposed to return a sortedCollection, which sorts using |
|
201 |
the current locales collating sequence. For now, simply use a |
|
202 |
normal string compare. |
|
203 |
This will change" |
|
204 |
||
205 |
^ self new |
|
206 |
||
207 |
"Modified: 13.9.1997 / 10:18:58 / cg" |
|
208 |
"Created: 13.9.1997 / 10:41:54 / cg" |
|
209 |
! |
|
210 |
||
211 |
forStrings:size |
|
212 |
"this is supposed to return a sortedCollection, which sorts using |
|
213 |
the current locales collating sequence. For now, simply use a |
|
214 |
normal string compare. |
|
215 |
This will change" |
|
216 |
||
217 |
^ self new:size |
|
218 |
||
219 |
"Modified: 13.9.1997 / 10:18:58 / cg" |
|
220 |
! |
|
221 |
||
1 | 222 |
new |
2 | 223 |
"return a new sortedCollection, the sorting is done using |
1155 | 224 |
a compare for a < b, in ascending order" |
2 | 225 |
|
1 | 226 |
^ super new setSortBlock:DefaultSortBlock |
1155 | 227 |
|
228 |
"Modified: 12.4.1996 / 12:28:18 / cg" |
|
1 | 229 |
! |
230 |
||
231 |
new:size |
|
2 | 232 |
"return a new sortedCollection with preallocated size. |
1155 | 233 |
The sorting is done using a compare for a < b, in ascending order" |
2 | 234 |
|
1 | 235 |
^ (super new:size) setSortBlock:DefaultSortBlock |
1155 | 236 |
|
237 |
"Modified: 12.4.1996 / 12:28:22 / cg" |
|
1 | 238 |
! |
239 |
||
240 |
sortBlock:aBlock |
|
1155 | 241 |
"return a new sortedCollection, whe the sort order is defined |
8874 | 242 |
by aBlock. |
1155 | 243 |
This must be a two-argument block which returns true if its arg1 has to come before |
244 |
its arg2 in the collection." |
|
2 | 245 |
|
1 | 246 |
^ super new setSortBlock:aBlock |
1155 | 247 |
|
248 |
"default: |
|
249 |
|s| |
|
250 |
||
251 |
s := SortedCollection new. |
|
252 |
s add:15; add:99; add:3; add:-29; add:17; add:-6. |
|
1422 | 253 |
Transcript showCR:s |
1155 | 254 |
" |
255 |
||
256 |
"sorting by absolute values: |
|
257 |
|s| |
|
258 |
||
259 |
s := SortedCollection sortBlock:[:a :b | a abs < b abs]. |
|
260 |
s add:15; add:99; add:3; add:29; add:17; add:-6. |
|
1422 | 261 |
Transcript showCR:s |
1155 | 262 |
" |
263 |
||
264 |
"default again: |
|
265 |
|s| |
|
266 |
||
267 |
s := SortedCollection new. |
|
268 |
s add:'foo'; add:'Bar'; add:'baz'; add:'hello'; add:'world'; add:'Wow'. |
|
1422 | 269 |
Transcript showCR:s |
1155 | 270 |
" |
271 |
||
272 |
"sorting strings caseless: |
|
273 |
|s| |
|
274 |
||
275 |
s := SortedCollection sortBlock:[:a :b | a asLowercase < b asLowercase]. |
|
276 |
s add:'foo'; add:'Bar'; add:'baz'; add:'hello'; add:'world'; add:'Wow'. |
|
1422 | 277 |
Transcript showCR:s |
1155 | 278 |
" |
279 |
||
280 |
"Modified: 12.4.1996 / 12:26:28 / cg" |
|
329 | 281 |
! |
282 |
||
283 |
withAll:aCollection sortBlock:aBlock |
|
284 |
"initialize from aCollection and set the sort-block" |
|
285 |
||
2248 | 286 |
^ (self sortBlock:aBlock) addAll:aCollection; yourself |
329 | 287 |
|
288 |
" |
|
289 |
SortedCollection withAll:#(1 2 3 4 5 6 7 8 9 0) |
|
8874 | 290 |
sortBlock:[:a :b | a > b] |
1155 | 291 |
" |
292 |
||
293 |
"default: |
|
294 |
|s| |
|
295 |
||
296 |
s := SortedCollection withAll:#(15 99 3 29 17 -6). |
|
1422 | 297 |
Transcript showCR:s |
1155 | 298 |
" |
299 |
||
300 |
"sorting by absolute values: |
|
301 |
|s| |
|
302 |
||
303 |
s := SortedCollection withAll:#(15 99 3 29 17 -6) sortBlock:[:a :b | a abs < b abs]. |
|
1422 | 304 |
Transcript showCR:s |
329 | 305 |
" |
1155 | 306 |
|
307 |
"default again: |
|
308 |
|s| |
|
309 |
||
310 |
s := SortedCollection withAll:#('foo' 'Bar' 'baz' 'hello' 'world' 'Wow'). |
|
1422 | 311 |
Transcript showCR:s |
1155 | 312 |
" |
313 |
||
314 |
"sorting strings caseless: |
|
315 |
|s| |
|
316 |
||
317 |
s := SortedCollection withAll:#('foo' 'Bar' 'baz' 'hello' 'world' 'Wow') sortBlock:[:a :b | a asLowercase < b asLowercase]. |
|
1422 | 318 |
Transcript showCR:s |
1155 | 319 |
" |
320 |
||
321 |
"Modified: 12.4.1996 / 12:28:09 / cg" |
|
1 | 322 |
! ! |
323 |
||
7300 | 324 |
!SortedCollection class methodsFor:'Compatibility-Dolphin'! |
6411 | 325 |
|
326 |
sortBlock:aBlock withAll:aCollection |
|
327 |
^ self withAll:aCollection sortBlock:aBlock |
|
328 |
! ! |
|
329 |
||
9073 | 330 |
!SortedCollection methodsFor:'accessing'! |
331 |
||
9918
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
332 |
largest:n |
16000 | 333 |
"return a collection containing the n largest elements, largest last. |
334 |
Raises an exception, if the receiver does not contain at least n elements" |
|
335 |
||
336 |
|mySize| |
|
9918
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
337 |
|
16000 | 338 |
mySize := self size. |
339 |
n > mySize ifTrue:[ |
|
340 |
self notEnoughElementsError |
|
341 |
]. |
|
9918
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
342 |
sortBlock == DefaultSortBlock ifTrue:[ |
16000 | 343 |
^ self copyFrom:(mySize-n+1) |
9918
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
344 |
]. |
16000 | 345 |
"/ do not trust the sortblock to sort small-to-large |
9918
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
346 |
^ super largest:n |
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
347 |
|
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
348 |
" |
16000 | 349 |
#(10 35 20 45 30 5) asSortedCollection largest:3 |
350 |
(#(10 35 20 45 30 5) asSortedCollection:[:a :b | a > b]) largest:3 |
|
351 |
||
352 |
#(10 35 20 45 30 5) asSortedCollection largest:6 |
|
353 |
#(10 35 20 45 30 5) asSortedCollection largest:7 |
|
9918
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
354 |
" |
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
355 |
! |
1947f22681ef
optimized code for n-largest
Claus Gittinger <cg@exept.de>
parents:
9917
diff
changeset
|
356 |
|
9916
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
357 |
max |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
358 |
"Return the largest element." |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
359 |
|
9917
278547f0d52e
... but only with the default sort block.
Claus Gittinger <cg@exept.de>
parents:
9916
diff
changeset
|
360 |
sortBlock == DefaultSortBlock ifTrue:[ |
278547f0d52e
... but only with the default sort block.
Claus Gittinger <cg@exept.de>
parents:
9916
diff
changeset
|
361 |
^ self last |
278547f0d52e
... but only with the default sort block.
Claus Gittinger <cg@exept.de>
parents:
9916
diff
changeset
|
362 |
]. |
278547f0d52e
... but only with the default sort block.
Claus Gittinger <cg@exept.de>
parents:
9916
diff
changeset
|
363 |
^ super max |
9916
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
364 |
|
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
365 |
" |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
366 |
#(10 35 20 45 30 5) asSortedCollection max |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
367 |
" |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
368 |
! |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
369 |
|
9073 | 370 |
median |
371 |
"Return the middle element, or as close as we can get." |
|
372 |
||
373 |
^ self at:(self size + 1 // 2) |
|
374 |
||
375 |
" |
|
376 |
#(10 35 20 45 30 5) asSortedCollection median |
|
377 |
#(10 35 20 45 30 5) median |
|
378 |
" |
|
9916
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
379 |
! |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
380 |
|
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
381 |
min |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
382 |
"Return the smallest element." |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
383 |
|
9917
278547f0d52e
... but only with the default sort block.
Claus Gittinger <cg@exept.de>
parents:
9916
diff
changeset
|
384 |
sortBlock == DefaultSortBlock ifTrue:[ |
278547f0d52e
... but only with the default sort block.
Claus Gittinger <cg@exept.de>
parents:
9916
diff
changeset
|
385 |
^ self first |
278547f0d52e
... but only with the default sort block.
Claus Gittinger <cg@exept.de>
parents:
9916
diff
changeset
|
386 |
]. |
278547f0d52e
... but only with the default sort block.
Claus Gittinger <cg@exept.de>
parents:
9916
diff
changeset
|
387 |
^ super min |
9916
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
388 |
|
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
389 |
" |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
390 |
#(10 35 20 45 30 5) asSortedCollection min |
5c76098e0377
min and max are easy with sorted collections.
Claus Gittinger <cg@exept.de>
parents:
9074
diff
changeset
|
391 |
" |
9073 | 392 |
! ! |
393 |
||
1 | 394 |
!SortedCollection methodsFor:'adding & removing'! |
395 |
||
607 | 396 |
add:anObject |
11268
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
397 |
"add the argument, anObject at the proper place in the receiver. |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
398 |
Returns the argument, anObject (sigh)." |
2 | 399 |
|
11268
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
400 |
|index lastElement| |
1 | 401 |
|
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
402 |
"/ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
403 |
"/ cg: the original code was simply: |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
404 |
"/ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
405 |
"/ index := self indexForInserting:anObject. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
406 |
"/ index := self makeRoomAtIndex:index. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
407 |
"/ contentsArray basicAt:index put:anObject. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
408 |
"/ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
409 |
"/ which was nice and simple to understand. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
410 |
"/ However, the code below is 5 times faster, if elements are added in an already ordered fashion, |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
411 |
"/ which often happens. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
412 |
"/ so we allow the code to be a bit more complicated... |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
413 |
|
11268
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
414 |
(lastIndex < firstIndex "i.e. self size == 0" |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
415 |
or:[ |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
416 |
lastElement := contentsArray at:lastIndex. |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
417 |
(sortBlock value:lastElement value:anObject) |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
418 |
]) ifTrue:[ |
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
419 |
"/ empty or lastElement is smaller then newElement; add at the end |
11268
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
420 |
index := lastIndex. |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
421 |
(index == contentsArray size) ifTrue:[ |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
422 |
self makeRoomAtLast. |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
423 |
index := lastIndex. |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
424 |
]. |
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
425 |
lastIndex := index := index + 1. |
607 | 426 |
] ifFalse:[ |
11268
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
427 |
index := self indexForInserting:anObject. |
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
428 |
(index == firstIndex) ifTrue:[ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
429 |
(firstIndex == 1) ifTrue:[ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
430 |
self makeRoomAtFront. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
431 |
]. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
432 |
index := firstIndex := firstIndex - 1. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
433 |
] ifFalse:[ |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
434 |
index := self makeRoomAtIndex:index. |
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
435 |
]. |
607 | 436 |
]. |
3340 | 437 |
contentsArray basicAt:index put:anObject. |
607 | 438 |
^ anObject |
2 | 439 |
|
607 | 440 |
" |
11268
7ce883e9a42e
tuned add: if the elements are added in sorted order
Claus Gittinger <cg@exept.de>
parents:
9920
diff
changeset
|
441 |
#(7 3 9 10 99) asSortedCollection add:5; yourself |
8874 | 442 |
#(7 3 9 10 99) asSortedCollection add:1; yourself |
443 |
#(7 3 9 10 99) asSortedCollection add:1000; yourself |
|
11274
a6f648b1d291
tune adding in order / in reverse order
Claus Gittinger <cg@exept.de>
parents:
11268
diff
changeset
|
444 |
#(7 3 9 10 99) asSortedCollection add:1; yourself |
607 | 445 |
" |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
446 |
|
11276 | 447 |
"Modified: / 22-10-2008 / 17:09:39 / cg" |
1 | 448 |
! |
449 |
||
450 |
addAll:aCollection |
|
8874 | 451 |
"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
|
452 |
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
|
453 |
|
11286 | 454 |
|addedCollection mySize numAdded| |
455 |
||
456 |
numAdded := aCollection size. |
|
457 |
mySize := self size. |
|
1 | 458 |
|
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
459 |
(aCollection isSortedCollection |
7554 | 460 |
and:[aCollection sortBlock == sortBlock]) ifTrue:[ |
11286 | 461 |
addedCollection := aCollection. |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
462 |
] ifFalse:[ |
11286 | 463 |
addedCollection := Array withAll:aCollection. |
14101 | 464 |
addedCollection stableSort:sortBlock. |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
465 |
|
11286 | 466 |
mySize == 0 ifTrue:[ |
467 |
"/ special case: I am empty - add them en-bloque. |
|
468 |
contentsArray := addedCollection. |
|
469 |
firstIndex := 1. |
|
470 |
lastIndex := numAdded. |
|
471 |
^ aCollection |
|
472 |
]. |
|
1 | 473 |
]. |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
474 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
475 |
"/ |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
476 |
"/ 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
|
477 |
"/ |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
478 |
self mergeSorted:addedCollection. |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
479 |
^ aCollection |
1 | 480 |
|
77 | 481 |
" |
8874 | 482 |
#(7 3 9 10 99) asSortedCollection addAll:#(77 0 1 16 5); yourself |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
483 |
|
5028
1f7e943ce46e
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
4596
diff
changeset
|
484 |
( #(7 3 9 10 99) asSortedCollection:[:a :b | a > b]) |
11286 | 485 |
addAll:#(77 0 1 16 5); yourself |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
486 |
|
8874 | 487 |
#(7 3 9 10 99) asSortedCollection |
11286 | 488 |
addAll:( #(77 0 1 16 5) asSortedCollection:[:a :b | a > b]); yourself |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
489 |
|
8874 | 490 |
(#(7 3 9 10 99) asSortedCollection:[:a :b | a > b]) |
11286 | 491 |
addAll:( #(77 0 1 16 5) asSortedCollection:[:a :b | a < b]); yourself |
492 |
" |
|
493 |
||
494 |
" |
|
495 |
|x e| |
|
496 |
||
497 |
e := (1 to:100) asSortedCollection. |
|
498 |
TimeDuration toRun:[ |
|
499 |
10000 timesRepeat:[ |
|
500 |
x := SortedCollection new:100. |
|
501 |
x addAll:e. |
|
502 |
]. |
|
503 |
]. |
|
77 | 504 |
" |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
505 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
506 |
"Modified: 13.4.1996 / 12:42:15 / cg" |
1 | 507 |
! |
508 |
||
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
509 |
mergeSorted:aSortedCollection |
11286 | 510 |
"add all elements of the argument, aSortedCollection to the receiver. |
12038 | 511 |
This leads to an error, if the argument is not sorted. |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
512 |
|
8874 | 513 |
This should be used when a number of elements is to be added. |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
514 |
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
|
515 |
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
|
516 |
Therefore, adding chunks is better done by sorting the chunk and merging |
14310 | 517 |
it in, instead of resorting the receiver. |
518 |
||
519 |
aSortedCollection must be sorted by the same sortBlock as myself!!" |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
520 |
|
8874 | 521 |
|newContentsArray |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
522 |
contentsArray2 |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
523 |
destIndex "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
524 |
n1 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
525 |
n2 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
526 |
srcIndex1 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
527 |
srcIndex2 "{ Class: SmallInteger }" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
528 |
last1 "{ Class: SmallInteger }" |
8874 | 529 |
last2 "{ Class: SmallInteger }" |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
530 |
end1Reached end2Reached |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
531 |
el1 el2 | |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
532 |
|
14310 | 533 |
n2 := aSortedCollection size. |
534 |
n2 == 0 ifTrue:[ |
|
535 |
^ self. |
|
536 |
]. |
|
537 |
||
538 |
aSortedCollection isSortedCollection ifTrue:[ |
|
539 |
contentsArray2 := aSortedCollection contentsArray. |
|
540 |
srcIndex2 := aSortedCollection firstIndex. |
|
541 |
] ifFalse:[ |
|
542 |
contentsArray2 := aSortedCollection. |
|
543 |
srcIndex2 := 1. |
|
544 |
]. |
|
545 |
||
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
546 |
n1 := self size. |
5381
914e310a69be
Fix #mergeSorted if one of the collections is empty.
Stefan Vogel <sv@exept.de>
parents:
5359
diff
changeset
|
547 |
n1 == 0 ifTrue:[ |
14310 | 548 |
firstIndex := srcIndex2. |
549 |
lastIndex := firstIndex + n2 - 1. |
|
550 |
contentsArray := contentsArray2 copy. |
|
11286 | 551 |
^ self. |
5381
914e310a69be
Fix #mergeSorted if one of the collections is empty.
Stefan Vogel <sv@exept.de>
parents:
5359
diff
changeset
|
552 |
]. |
914e310a69be
Fix #mergeSorted if one of the collections is empty.
Stefan Vogel <sv@exept.de>
parents:
5359
diff
changeset
|
553 |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
554 |
newContentsArray := Array new:(n1 + n2). |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
555 |
destIndex := 1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
556 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
557 |
last2 := srcIndex2 + n2 -1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
558 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
559 |
srcIndex1 := firstIndex. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
560 |
last1 := srcIndex1 + n1 -1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
561 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
562 |
(srcIndex1 <= last1 and:[srcIndex2 <= last2]) ifTrue:[ |
11286 | 563 |
el1 := contentsArray at:srcIndex1. |
564 |
el2 := contentsArray2 at:srcIndex2. |
|
565 |
end1Reached := end2Reached := false. |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
566 |
|
11286 | 567 |
[end1Reached or:[end2Reached]] whileFalse:[ |
568 |
(sortBlock value:el1 value:el2) ifTrue:[ |
|
569 |
"/ el1 to come before el2 |
|
570 |
newContentsArray at:destIndex put:el1. destIndex := destIndex + 1. |
|
571 |
srcIndex1 := srcIndex1 + 1. |
|
572 |
srcIndex1 <= last1 ifTrue:[ |
|
573 |
el1 := contentsArray at:srcIndex1. |
|
574 |
] ifFalse:[ |
|
575 |
end1Reached := true |
|
576 |
] |
|
577 |
] ifFalse:[ |
|
578 |
"/ el2 to come before el1 |
|
579 |
newContentsArray at:destIndex put:el2. destIndex := destIndex + 1. |
|
580 |
srcIndex2 := srcIndex2 + 1. |
|
581 |
srcIndex2 <= last2 ifTrue:[ |
|
582 |
el2 := contentsArray2 at:srcIndex2. |
|
583 |
] ifFalse:[ |
|
584 |
end2Reached := true |
|
585 |
] |
|
586 |
] |
|
587 |
] |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
588 |
]. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
589 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
590 |
"/ 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
|
591 |
(srcIndex1 <= last1) ifTrue:[ |
11286 | 592 |
newContentsArray |
593 |
replaceFrom:destIndex |
|
594 |
to:(destIndex+(last1-srcIndex1)) |
|
595 |
with:contentsArray |
|
596 |
startingAt:srcIndex1 |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
597 |
]. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
598 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
599 |
"/ 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
|
600 |
(srcIndex2 <= last2) ifTrue:[ |
11286 | 601 |
newContentsArray |
602 |
replaceFrom:destIndex |
|
603 |
to:(destIndex+(last2-srcIndex2)) |
|
604 |
with:contentsArray2 |
|
605 |
startingAt:srcIndex2 |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
606 |
]. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
607 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
608 |
firstIndex := 1. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
609 |
lastIndex := n1 + n2. |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
610 |
contentsArray := newContentsArray |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
611 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
612 |
" |
8874 | 613 |
#(7 3 9 10 99) asSortedCollection |
11286 | 614 |
mergeSorted:#(77 0 1 16 5) asSortedCollection |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
615 |
|
8874 | 616 |
#(7 3 9 10 99) asSortedCollection |
11286 | 617 |
mergeSorted:#(77 0 3 1 98 99 16 5) asSortedCollection |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
618 |
|
8874 | 619 |
#() asSortedCollection |
11286 | 620 |
mergeSorted:#(77 0 3 1 98 99 16 5) asSortedCollection |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
621 |
|
8874 | 622 |
#(7 3 9 10 99) asSortedCollection |
11286 | 623 |
mergeSorted:#() asSortedCollection |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
624 |
" |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
625 |
|
3250
c4b444774f1c
oops - mergesort cannot simply copy remaining
Claus Gittinger <cg@exept.de>
parents:
2929
diff
changeset
|
626 |
"Modified: / 30.1.1998 / 01:49:42 / cg" |
607 | 627 |
! ! |
628 |
||
5560 | 629 |
!SortedCollection methodsFor:'blocked'! |
630 |
||
631 |
add:newObject after:oldObject |
|
632 |
"catch this - its not allowed for sortedCollections" |
|
633 |
||
634 |
self shouldNotImplement |
|
635 |
! |
|
636 |
||
637 |
add:newObject before:oldObject |
|
638 |
"catch this - its not allowed for sortedCollections" |
|
639 |
||
640 |
self shouldNotImplement |
|
641 |
! |
|
642 |
||
643 |
addFirst:anObject |
|
644 |
"catch this - its not allowed for sortedCollections" |
|
645 |
||
646 |
self shouldNotImplement |
|
647 |
! |
|
648 |
||
649 |
addLast:anObject |
|
650 |
"catch this - its not allowed for sortedCollections" |
|
651 |
||
652 |
self shouldNotImplement |
|
653 |
! ! |
|
654 |
||
607 | 655 |
!SortedCollection methodsFor:'converting'! |
656 |
||
657 |
asSortedCollection |
|
658 |
"return the receiver as a sorted collection" |
|
659 |
||
660 |
"could be an instance of a subclass..." |
|
661 |
self class == SortedCollection ifTrue:[ |
|
8874 | 662 |
sortBlock == DefaultSortBlock ifTrue:[ |
663 |
^ self |
|
664 |
] |
|
1 | 665 |
]. |
607 | 666 |
^ super asSortedCollection |
5029
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
667 |
! |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
668 |
|
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
669 |
asSortedCollection:aSortBlock |
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
670 |
"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
|
671 |
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
|
672 |
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
|
673 |
|
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
674 |
"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
|
675 |
self class == SortedCollection ifTrue:[ |
8874 | 676 |
"/ if the sortBlock is the same, return the receiver |
677 |
aSortBlock == sortBlock ifTrue:[ |
|
678 |
^ self |
|
679 |
]. |
|
5029
ae3312dda1dd
avoid creation of a new sortedCollection in #asSortedCollection:
Claus Gittinger <cg@exept.de>
parents:
5028
diff
changeset
|
680 |
]. |
5030
655a0f0a60c3
use my sortBlock when merge-sorting
Claus Gittinger <cg@exept.de>
parents:
5029
diff
changeset
|
681 |
^ super asSortedCollection:aSortBlock |
1 | 682 |
! ! |
683 |
||
95 | 684 |
!SortedCollection methodsFor:'copying'! |
685 |
||
607 | 686 |
copyEmpty:size |
687 |
"return a copy of the receiver with no elements, but |
|
688 |
the same size. This method has been be redefined to |
|
689 |
preserve the sortBlock." |
|
690 |
||
14110 | 691 |
^ (super copyEmpty:size) sortBlock:sortBlock |
607 | 692 |
! |
693 |
||
159 | 694 |
postCopyFrom:anOriginal |
695 |
"sent after a copy or when a new collection species has been created. |
|
95 | 696 |
The new collection should have the same sortBlock as the original." |
697 |
||
159 | 698 |
sortBlock := anOriginal sortBlock |
95 | 699 |
|
700 |
" |
|
701 |
#(4 7 1 99 -1 17) asSortedCollection inspect |
|
159 | 702 |
#(4 7 1 99 -1 17) asSortedCollection copy inspect |
95 | 703 |
(#(4 7 1 99 -1 17) asSortedCollection sortBlock:[:a :b | a > b]) inspect |
159 | 704 |
(#(4 7 1 99 -1 17) asSortedCollection sortBlock:[:a :b | a > b]) copy inspect |
705 |
(#(4 7 1 99 -1 17) asSortedCollection select:[:e| e even]) inspect |
|
95 | 706 |
" |
707 |
! ! |
|
708 |
||
216 | 709 |
!SortedCollection methodsFor:'enumerating'! |
184 | 710 |
|
711 |
collect:aBlock |
|
712 |
"evaluate the argument, aBlock for every element in the collection |
|
713 |
and return a collection of the results. Redefined to return an OrderedCollection; |
|
714 |
see X3J20 spec. (SortedCollection>>collect: should return an OrderedCollection)" |
|
715 |
||
716 |
|newCollection |
|
717 |
start "{ Class:SmallInteger }" |
|
718 |
stop "{ Class:SmallInteger }" | |
|
719 |
||
720 |
newCollection := OrderedCollection new:(self size). |
|
721 |
stop := lastIndex. |
|
722 |
start := firstIndex. |
|
723 |
start to:stop do:[:index | |
|
724 |
newCollection add:(aBlock value:(contentsArray at:index)). |
|
725 |
]. |
|
726 |
^ newCollection |
|
727 |
! ! |
|
728 |
||
607 | 729 |
!SortedCollection methodsFor:'instance protocol'! |
730 |
||
5668
0cbaa16dc17c
Inherited #sort: shows a debugger.
Stefan Vogel <sv@exept.de>
parents:
5604
diff
changeset
|
731 |
sort:aSortBlock |
0cbaa16dc17c
Inherited #sort: shows a debugger.
Stefan Vogel <sv@exept.de>
parents:
5604
diff
changeset
|
732 |
"redefined from superclass to change the sortBlock" |
0cbaa16dc17c
Inherited #sort: shows a debugger.
Stefan Vogel <sv@exept.de>
parents:
5604
diff
changeset
|
733 |
|
0cbaa16dc17c
Inherited #sort: shows a debugger.
Stefan Vogel <sv@exept.de>
parents:
5604
diff
changeset
|
734 |
sortBlock ~~ aSortBlock ifTrue:[ |
8874 | 735 |
self sortBlock:aSortBlock. |
5668
0cbaa16dc17c
Inherited #sort: shows a debugger.
Stefan Vogel <sv@exept.de>
parents:
5604
diff
changeset
|
736 |
]. |
0cbaa16dc17c
Inherited #sort: shows a debugger.
Stefan Vogel <sv@exept.de>
parents:
5604
diff
changeset
|
737 |
|
0cbaa16dc17c
Inherited #sort: shows a debugger.
Stefan Vogel <sv@exept.de>
parents:
5604
diff
changeset
|
738 |
! |
0cbaa16dc17c
Inherited #sort: shows a debugger.
Stefan Vogel <sv@exept.de>
parents:
5604
diff
changeset
|
739 |
|
607 | 740 |
sortBlock |
741 |
"return the block used for sorting" |
|
742 |
||
743 |
^ sortBlock |
|
744 |
! |
|
745 |
||
746 |
sortBlock:aSortBlock |
|
8874 | 747 |
"change the sort criteria for a sorted collection, resort the elements of |
607 | 748 |
the collection, and return the receiver. The argument, aSortBlock must |
749 |
be a two-argument block which returns true if its arg1 has to come before |
|
750 |
its arg2 in the collection." |
|
751 |
||
752 |
sortBlock := aSortBlock. |
|
753 |
lastIndex > firstIndex ifTrue:[ |
|
754 |
contentsArray quickSortFrom:firstIndex to:lastIndex sortBlock:aSortBlock |
|
755 |
] |
|
756 |
||
757 |
" |
|
758 |
#(9 8 7 6 5 4 3) asSortedCollection |
|
759 |
#(9 8 7 6 5 4 3) asSortedCollection sortBlock:[:a : b | a < b] |
|
760 |
#(9 8 7 6 5 4 3) asSortedCollection sortBlock:[:a : b | a > b] |
|
761 |
#($f $G $z $Y $o $H) asSortedCollection |
|
762 |
#($f $G $z $Y $o $H) asSortedCollection sortBlock:[:a : b | a asUppercase < b asUppercase] |
|
763 |
" |
|
764 |
! ! |
|
765 |
||
766 |
!SortedCollection methodsFor:'private'! |
|
767 |
||
768 |
setSortBlock: aSortBlock |
|
769 |
"set the sortblock without resorting - private only" |
|
770 |
||
771 |
sortBlock := aSortBlock |
|
772 |
! ! |
|
773 |
||
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
774 |
!SortedCollection methodsFor:'queries'! |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
775 |
|
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
776 |
isSorted |
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
777 |
"return true. if my elements are sorted" |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
778 |
|
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
779 |
^ true |
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
780 |
! |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
781 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
782 |
isSortedBy:aBlock |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
783 |
"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
|
784 |
|
5359
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
785 |
aBlock == sortBlock ifTrue:[^ true]. |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
786 |
^ super isSortedBy:aBlock |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
787 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
788 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
789 |
! |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
790 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
791 |
isSortedCollection |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
792 |
"return true. if I am a sorted collection" |
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
793 |
|
396b77b6f1d2
added #isSortedCollection, #isSortedBy:
Claus Gittinger <cg@exept.de>
parents:
5048
diff
changeset
|
794 |
^ true |
1173
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
795 |
! ! |
1d831f2c0d44
added #mergeSorted; changed #addAll: to make use of it
Claus Gittinger <cg@exept.de>
parents:
1167
diff
changeset
|
796 |
|
607 | 797 |
!SortedCollection methodsFor:'searching'! |
798 |
||
799 |
after:anObject ifAbsent:exceptionBlock |
|
800 |
"return the element after the argument, anObject; or nil if there is none. |
|
801 |
If anObject is contained multiple times in the collection, return the |
|
802 |
the first element which is non-equal to anObject. |
|
803 |
If the receiver does not contain anObject, return the result from evaluating |
|
804 |
exceptionBlock." |
|
805 |
||
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
806 |
|index "{ Class: SmallInteger }" |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
807 |
last "{ Class: SmallInteger }"| |
607 | 808 |
|
809 |
index := self indexForInserting:anObject. |
|
8874 | 810 |
((index < firstIndex) |
607 | 811 |
or:[(contentsArray at:index) ~= anObject]) ifTrue:[^ exceptionBlock value]. |
812 |
||
8874 | 813 |
"skip multiple occurrences of the same ..." |
607 | 814 |
|
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
815 |
last := lastIndex. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
816 |
[(index <= last) and:[(contentsArray at:index) = anObject]] whileTrue:[ |
8874 | 817 |
index := index + 1 |
607 | 818 |
]. |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
819 |
(index > last) ifTrue:[^ nil]. |
607 | 820 |
^ contentsArray at:index |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
821 |
|
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
822 |
"Modified: 12.4.1996 / 13:20:33 / cg" |
607 | 823 |
! |
824 |
||
825 |
before:anObject ifAbsent:exceptionBlock |
|
826 |
"return the element before the argument, anObject; or nil if there is none. |
|
827 |
If the receiver does not contain anObject, return the result from evaluating |
|
828 |
exceptionBlock." |
|
829 |
||
830 |
|index "{ Class: SmallInteger }"| |
|
831 |
||
832 |
index := self indexForInserting:anObject. |
|
8874 | 833 |
((index <= firstIndex) |
607 | 834 |
or:[(contentsArray at:index) ~= anObject]) ifTrue:[^ exceptionBlock value]. |
835 |
||
836 |
^ contentsArray at:index - 1 |
|
837 |
||
838 |
" |
|
839 |
#(7 3 9 10 99) asSortedCollection before:50 |
|
8874 | 840 |
#(7 3 9 10 99) asSortedCollection before:1 |
841 |
#(7 3 9 10 99) asSortedCollection before:10 |
|
842 |
#(7 3 9 10 99) asSortedCollection before:7 |
|
843 |
#(7 3 9 10 99) asSortedCollection before:99 |
|
844 |
#(7 10 3 10 9 10 10 99) asSortedCollection before:9 |
|
845 |
#(7 10 3 10 9 10 10 99) asSortedCollection before:10 |
|
607 | 846 |
" |
4596 | 847 |
! |
848 |
||
14310 | 849 |
indexForInserting:anObject |
850 |
"search the index at which to insert anObject. |
|
851 |
Can also be used to search for an existing element |
|
852 |
by checking if the element at the returned index is the one we look for. |
|
853 |
Uses a binarySearch since we can depend on the elements being in sorted order. |
|
854 |
The returned index is a physical one, for accessing contentsArray." |
|
855 |
||
856 |
|low "{ Class: SmallInteger}" |
|
857 |
high "{ Class: SmallInteger}" |
|
858 |
middle "{ Class: SmallInteger}" |
|
859 |
element| |
|
860 |
||
861 |
" |
|
862 |
we can of course use a binary search - since the elements are sorted |
|
863 |
" |
|
864 |
low := firstIndex. |
|
865 |
high := lastIndex. |
|
866 |
[low > high] whileFalse:[ |
|
867 |
middle := (low + high) // 2. |
|
868 |
element := contentsArray at:middle. |
|
869 |
(sortBlock value:element value:anObject) ifTrue:[ |
|
870 |
"middleelement is smaller than object" |
|
871 |
low := middle + 1 |
|
872 |
] ifFalse:[ |
|
873 |
high := middle - 1 |
|
874 |
] |
|
875 |
]. |
|
876 |
^ low |
|
877 |
||
878 |
" |
|
879 |
#(1 2 3 4 7 99 1313 981989 898989898) asSortedCollection indexForInserting:50 |
|
880 |
||
881 |
#(1.0 2.0 3 4 7 49.0 51.0 99 1313 981989 898989898) asSortedCollection indexForInserting:50 |
|
882 |
||
883 |
" |
|
884 |
||
885 |
"Modified: 12.4.1996 / 13:22:03 / cg" |
|
886 |
! |
|
887 |
||
4596 | 888 |
indexOf:anElement |
8874 | 889 |
"Return the index of anElement within the receiver. |
4596 | 890 |
If the receiver does not contain anElement, return 0." |
891 |
||
892 |
^ self indexOf:anElement ifAbsent:0 |
|
893 |
! |
|
894 |
||
895 |
indexOf:anElement ifAbsent:exceptionBlock |
|
8874 | 896 |
"Return the index of anElement within the receiver. |
897 |
If the receiver does not contain anElement, |
|
4596 | 898 |
return the result of evaluating the argument, exceptionBlock." |
899 |
||
8874 | 900 |
|insertionIndex index "{ Class: SmallInteger }" |
4596 | 901 |
obj| |
902 |
||
903 |
firstIndex > lastIndex ifTrue:[ |
|
8874 | 904 |
"/ empty |
905 |
^ exceptionBlock value |
|
4596 | 906 |
]. |
907 |
||
908 |
"/ if I am small, the inherited linear search is faster ... |
|
909 |
(lastIndex - firstIndex) < 20 ifTrue:[ |
|
8874 | 910 |
^ super indexOf:anElement ifAbsent:exceptionBlock |
4596 | 911 |
]. |
912 |
||
913 |
insertionIndex := self indexForInserting:anElement. |
|
914 |
insertionIndex > lastIndex ifTrue:[ |
|
8874 | 915 |
insertionIndex := lastIndex |
4596 | 916 |
] ifFalse:[ |
8874 | 917 |
insertionIndex < firstIndex ifTrue:[ |
918 |
insertionIndex := firstIndex |
|
919 |
] |
|
4596 | 920 |
]. |
921 |
||
922 |
index := insertionIndex. |
|
923 |
[index >= firstIndex |
|
924 |
and:[obj := contentsArray basicAt:index. |
|
8874 | 925 |
anElement = obj ifTrue: [^ index - firstIndex + 1]. |
926 |
[sortBlock value:anElement value:obj]]] |
|
927 |
whileTrue: [index := index - 1]. |
|
4596 | 928 |
|
929 |
index := insertionIndex. |
|
930 |
[index <= lastIndex |
|
931 |
and: [obj := contentsArray basicAt: index. |
|
8874 | 932 |
anElement = obj ifTrue: [^ index - firstIndex + 1]. |
933 |
[sortBlock value:obj value:anElement]]] |
|
934 |
whileTrue: [index := index + 1]. |
|
4596 | 935 |
|
936 |
^exceptionBlock value |
|
937 |
||
938 |
" |
|
939 |
#('aa' 'bb' 'cc' 'dd') asSortedCollection indexOf:'bb' |
|
8874 | 940 |
#('aa' 'bb' 'cc' 'dd' 'aa' 'bb' 'cc' 'dd') asSortedCollection indexOf:'bb' |
4596 | 941 |
|
942 |
|allSyms indices| |
|
8874 | 943 |
allSyms := Symbol allInstances asSortedCollection. |
4596 | 944 |
Time millisecondsToRun:[ |
8874 | 945 |
indices := allSyms collect:[:el | allSyms indexOf:el]. |
4596 | 946 |
]. |
947 |
indices = (1 to:allSyms size) |
|
948 |
" |
|
607 | 949 |
! ! |
950 |
||
1 | 951 |
!SortedCollection methodsFor:'testing'! |
952 |
||
953 |
includes:anObject |
|
954 |
"return true, if the argument, anObject is in the collection. |
|
62 | 955 |
Redefined, since due to being sorted, the inclusion check can |
2 | 956 |
be done with log-n compares i.e. much faster." |
1 | 957 |
|
32 | 958 |
|index "{ Class: SmallInteger }"| |
1 | 959 |
|
77 | 960 |
index := self indexForInserting:anObject. |
32 | 961 |
((index < firstIndex) or:[index > lastIndex]) ifTrue:[^ false]. |
962 |
^ (contentsArray at:index) = anObject |
|
2 | 963 |
|
77 | 964 |
" |
965 |
#(7 3 9 10 99) asSortedCollection includes:50 |
|
966 |
#(7 3 9 10 99) asSortedCollection includes:10 |
|
967 |
" |
|
1 | 968 |
! |
969 |
||
970 |
occurrencesOf:anObject |
|
971 |
"return how many times the argument, anObject is in the collection. |
|
62 | 972 |
Redefined, since due to being sorted, the range of checked objects |
5048 | 973 |
can be limited i.e. it can be done much faster. |
974 |
Uses #= (i.e. equality) compare." |
|
1 | 975 |
|
976 |
|index "{ Class: SmallInteger }" |
|
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
977 |
tally "{ Class: SmallInteger }" |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
978 |
last "{ Class: SmallInteger }" | |
1 | 979 |
|
77 | 980 |
index := self indexForInserting:anObject. |
8874 | 981 |
last := lastIndex. |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
982 |
((index < firstIndex) or:[index > last]) ifTrue:[^ 0]. |
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
983 |
|
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
984 |
"/ there may be multiple of them; count 'em |
32 | 985 |
|
1 | 986 |
tally := 0. |
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
987 |
[(index <= last) and:[(contentsArray at:index) = anObject]] whileTrue:[ |
8874 | 988 |
tally := tally + 1. |
989 |
index := index + 1 |
|
1 | 990 |
]. |
991 |
^ tally |
|
2 | 992 |
|
77 | 993 |
" |
994 |
#(7 3 9 10 99) asSortedCollection occurrencesOf:50 |
|
995 |
#(7 3 9 10 99) asSortedCollection occurrencesOf:10 |
|
996 |
#(7 10 3 10 9 10 10 99) asSortedCollection occurrencesOf:10 |
|
997 |
" |
|
1162
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
998 |
|
3995101dfa44
changed for new #makeRoomAtIndex:; added comments
Claus Gittinger <cg@exept.de>
parents:
1156
diff
changeset
|
999 |
"Modified: 12.4.1996 / 18:48:40 / cg" |
77 | 1000 |
! ! |
1001 |
||
629 | 1002 |
!SortedCollection class methodsFor:'documentation'! |
1003 |
||
1004 |
version |
|
16000 | 1005 |
^ '$Header: /cvs/stx/stx/libbasic/SortedCollection.st,v 1.77 2014-02-12 14:33:40 cg Exp $' |
14309
602e61cb64a3
Remove now unused helper method
Stefan Vogel <sv@exept.de>
parents:
14308
diff
changeset
|
1006 |
! |
602e61cb64a3
Remove now unused helper method
Stefan Vogel <sv@exept.de>
parents:
14308
diff
changeset
|
1007 |
|
602e61cb64a3
Remove now unused helper method
Stefan Vogel <sv@exept.de>
parents:
14308
diff
changeset
|
1008 |
version_CVS |
16000 | 1009 |
^ '$Header: /cvs/stx/stx/libbasic/SortedCollection.st,v 1.77 2014-02-12 14:33:40 cg Exp $' |
629 | 1010 |
! ! |
7300 | 1011 |
|
16000 | 1012 |
|
607 | 1013 |
SortedCollection initialize! |