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