author | Stefan Vogel <sv@exept.de> |
Mon, 16 Mar 2009 16:15:05 +0100 | |
changeset 2127 | dc0da410f2d7 |
parent 2049 | 310eea860aa2 |
child 2147 | b2f5a09a6174 |
permissions | -rw-r--r-- |
297 | 1 |
" |
2 |
This class is not covered by or part of the ST/X licence. |
|
3 |
||
4 |
||
5 |
COPYRIGHT. |
|
6 |
The above file is a Manchester Goodie protected by copyright. |
|
7 |
These conditions are imposed on the whole Goodie, and on any significant |
|
8 |
part of it which is separately transmitted or stored: |
|
9 |
* You must ensure that every copy includes this notice, and that |
|
10 |
source and author(s) of the material are acknowledged. |
|
11 |
* These conditions must be imposed on anyone who receives a copy. |
|
12 |
* The material shall not be used for commercial gain without the prior |
|
13 |
written consent of the author(s). |
|
14 |
Further information on the copyright conditions may be obtained by |
|
15 |
sending electronic mail: |
|
16 |
To: goodies-lib@cs.man.ac.uk |
|
17 |
Subject: copyright |
|
18 |
or by writing to The Smalltalk Goodies Library Manager, Dept of |
|
19 |
Computer Science, The University, Manchester M13 9PL, UK |
|
20 |
||
21 |
(C) Copyright 1993 University of Manchester |
|
22 |
For more information about the Manchester Goodies Library (from which |
|
23 |
this file was distributed) send e-mail: |
|
24 |
To: goodies-lib@cs.man.ac.uk |
|
25 |
Subject: help |
|
26 |
" |
|
892 | 27 |
"{ Package: 'stx:libbasic2' }" |
28 |
||
297 | 29 |
SequenceableCollection subclass:#RunArray |
299 | 30 |
instanceVariableNames:'contentsArray' |
297 | 31 |
classVariableNames:'' |
32 |
poolDictionaries:'' |
|
33 |
category:'Collections-Sequenceable' |
|
34 |
! |
|
35 |
||
36 |
RunArray comment:'This implements an ordered collection which uses runs to minimise the amount |
|
37 |
of data that it holds. Basically it should be used if you know that an ordered |
|
38 |
collections is giong to contain a lot of runs of eactly the same data. Implemented |
|
39 |
to allow simultation playback, since the ordered collctions which that generates |
|
40 |
are so big that the complier falls over, though most of it is extremely repetetive. |
|
41 |
This should be totally abstracted. The user should not be a ble to see the difference |
|
42 |
between an ordered collection and a ComrpessedOrderedCollection. This has a |
|
43 |
lot in common with RunArray, and the two should probably share implementation. |
|
44 |
but I could not do some of the things I wanted with the RunArray code, so this |
|
45 |
is all done on its own. |
|
46 |
Some of this could be made faster by adding a cache of the start and finish |
|
47 |
indices of each run, but since I envisage that most additions etc. will be to |
|
48 |
and from the end those are not included. In addition I have implemented the |
|
49 |
bare essentials of this for what I need it for - i.e. add to the end and take |
|
966 | 50 |
off the beginning.' |
51 |
! |
|
297 | 52 |
|
53 |
!RunArray class methodsFor:'documentation'! |
|
54 |
||
55 |
copyright |
|
56 |
" |
|
57 |
This class is not covered by or part of the ST/X licence. |
|
58 |
||
59 |
||
60 |
COPYRIGHT. |
|
61 |
The above file is a Manchester Goodie protected by copyright. |
|
62 |
These conditions are imposed on the whole Goodie, and on any significant |
|
63 |
part of it which is separately transmitted or stored: |
|
64 |
* You must ensure that every copy includes this notice, and that |
|
65 |
source and author(s) of the material are acknowledged. |
|
66 |
* These conditions must be imposed on anyone who receives a copy. |
|
67 |
* The material shall not be used for commercial gain without the prior |
|
68 |
written consent of the author(s). |
|
69 |
Further information on the copyright conditions may be obtained by |
|
70 |
sending electronic mail: |
|
71 |
To: goodies-lib@cs.man.ac.uk |
|
72 |
Subject: copyright |
|
73 |
or by writing to The Smalltalk Goodies Library Manager, Dept of |
|
74 |
Computer Science, The University, Manchester M13 9PL, UK |
|
75 |
||
76 |
(C) Copyright 1993 University of Manchester |
|
77 |
For more information about the Manchester Goodies Library (from which |
|
78 |
this file was distributed) send e-mail: |
|
79 |
To: goodies-lib@cs.man.ac.uk |
|
80 |
Subject: help |
|
81 |
" |
|
82 |
||
83 |
||
84 |
! |
|
85 |
||
86 |
documentation |
|
87 |
" |
|
88 |
This implements an array which uses runs to minimise the amount |
|
588 | 89 |
of data that it physically holds. |
90 |
A run consists of a count/object pair, which (when the collection |
|
91 |
is accessed), is treated as if the object was contained count-times |
|
92 |
in the runArray. |
|
93 |
||
94 |
Basically it can be used if you know that your collection is |
|
95 |
going to contain a lot of runs of exactly the same data. |
|
297 | 96 |
|
298 | 97 |
RunArrays are used by the Text class to keep character attributes |
98 |
(which we expect to remain constant for longer character ranges). |
|
297 | 99 |
|
588 | 100 |
[notice:] |
101 |
there is ONLY a space saving if there are really runs |
|
102 |
(i.e. multiple elements which compare same). |
|
103 |
The break-even is when runs have an average size of 2 elements, |
|
104 |
if average runs are shorter, other collections (i.e. Array or |
|
105 |
OrderedCollection) are more compact. |
|
106 |
||
107 |
Also note, that indexed access (i.e. #at: / #at:put:) may be |
|
108 |
very inefficient (as opposed to enumeration, which is reasonably |
|
109 |
fast). |
|
110 |
The reason is that for indexed access the runs have to be walked. |
|
111 |
When storing into a runArray, runs may have to be splitted or merged, |
|
112 |
depending on where the store is done (within a run). |
|
113 |
This may lead to a resize operation. |
|
114 |
You have been warned. |
|
297 | 115 |
|
298 | 116 |
[instance variables:] |
588 | 117 |
contentsArray <Array> contains the runs, consisting of |
118 |
alternating length/value entries. |
|
298 | 119 |
|
120 |
[implementation note:] |
|
121 |
structure-wise, it would have been more intuitive, to keep |
|
122 |
instances of Run objects (as done in CompressedOrderedCollection) |
|
123 |
instead of alternating length/values in the `runs' collection. |
|
588 | 124 |
However, doing this means that lots of additional memory is required, |
125 |
since for every run, another object (consisting of 12bytes header) |
|
126 |
would be needed. |
|
127 |
Here, we choose the more space efficient way - after all, space saving |
|
128 |
is the only reason this class was built for. |
|
297 | 129 |
|
130 |
[author:] |
|
131 |
Claus Gittinger |
|
132 |
||
133 |
[see also:] |
|
298 | 134 |
Array OrderedCollection CompressedOrderedCollection |
297 | 135 |
" |
136 |
! |
|
137 |
||
138 |
examples |
|
139 |
" |
|
140 |
this eats up a lot of memory ... |
|
141 |
... but its relatively fast: |
|
298 | 142 |
[exBegin] |
297 | 143 |
|coll| |
144 |
||
145 |
coll := OrderedCollection new. |
|
350 | 146 |
Transcript showCR:( |
298 | 147 |
Time millisecondsToRun:[ |
148 |
100000 timesRepeat:[coll add:'hello']. |
|
149 |
100000 timesRepeat:[coll add:'world']. |
|
150 |
] |
|
297 | 151 |
). |
152 |
coll inspect. |
|
298 | 153 |
[exEnd] |
297 | 154 |
|
155 |
||
156 |
this is very space efficient ... |
|
298 | 157 |
... (and even slightly faster): |
158 |
[exBegin] |
|
297 | 159 |
|coll| |
160 |
||
161 |
coll := RunArray new. |
|
350 | 162 |
Transcript showCR:( |
298 | 163 |
Time millisecondsToRun:[ |
164 |
100000 timesRepeat:[coll add:'hello']. |
|
165 |
100000 timesRepeat:[coll add:'world']. |
|
166 |
] |
|
297 | 167 |
). |
168 |
coll inspect. |
|
298 | 169 |
[exEnd] |
297 | 170 |
|
171 |
||
298 | 172 |
this is very space efficient ... |
173 |
... AND much faster: |
|
174 |
[exBegin] |
|
297 | 175 |
|coll| |
176 |
||
177 |
coll := RunArray new. |
|
350 | 178 |
Transcript showCR:( |
298 | 179 |
Time millisecondsToRun:[ |
180 |
coll add:'hello' withOccurrences:100000. |
|
181 |
coll add:'world' withOccurrences:100000. |
|
182 |
] |
|
297 | 183 |
). |
184 |
coll inspect. |
|
298 | 185 |
[exEnd] |
297 | 186 |
|
187 |
||
300 | 188 |
single-element runs; |
189 |
this is very space INEFFICIENT (requires twice as much) ... |
|
190 |
... and MUCH slower: |
|
298 | 191 |
[exBegin] |
297 | 192 |
|coll| |
193 |
||
194 |
coll := RunArray new. |
|
350 | 195 |
Transcript showCR:( |
298 | 196 |
Time millisecondsToRun:[ |
197 |
1 to:1000 do:[:i | coll add:i]. |
|
198 |
] |
|
199 |
). |
|
200 |
[exEnd] |
|
300 | 201 |
compare to: |
202 |
[exBegin] |
|
203 |
|coll| |
|
204 |
||
205 |
coll := OrderedCollection new. |
|
350 | 206 |
Transcript showCR:( |
300 | 207 |
Time millisecondsToRun:[ |
208 |
1 to:1000 do:[:i | coll add:i]. |
|
209 |
] |
|
210 |
). |
|
211 |
[exEnd] |
|
212 |
||
297 | 213 |
" |
214 |
! ! |
|
215 |
||
216 |
!RunArray class methodsFor:'instance creation'! |
|
217 |
||
630
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
218 |
from:aSequencableCollection |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
219 |
"return a new runArray, containing the elements from aSequencableCollection" |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
220 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
221 |
^ self basicNew setElementsFrom:aSequencableCollection |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
222 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
223 |
" |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
224 |
RunArray from:#(1 2 3 3 3 4 5 5 6 6 6 6 6 6) |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
225 |
" |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
226 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
227 |
"Created: / 7.4.1998 / 09:12:45 / cg" |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
228 |
"Modified: / 7.4.1998 / 09:15:53 / cg" |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
229 |
! |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
230 |
|
588 | 231 |
new:count |
232 |
"return a new runArray, containing count elements - all nil" |
|
297 | 233 |
|
588 | 234 |
^ self basicNew setElement:nil occurrences:count |
302 | 235 |
|
588 | 236 |
"Modified: / 30.10.1997 / 14:36:05 / cg" |
302 | 237 |
! |
238 |
||
588 | 239 |
new:count withAll:anObject |
240 |
"create a new runArray with count elements, all being anObject" |
|
302 | 241 |
|
588 | 242 |
^ self basicNew setElement:anObject occurrences:count |
302 | 243 |
|
244 |
" |
|
245 |
RunArray new:100 withAll:#hello |
|
246 |
" |
|
247 |
||
588 | 248 |
"Modified: / 30.10.1997 / 14:36:38 / cg" |
871 | 249 |
! |
250 |
||
251 |
runs:runs values:values |
|
252 |
"return a new runArray, containing elements defined by pairs from |
|
253 |
runs and values" |
|
254 |
||
1325
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
255 |
^ self basicNew setRuns:runs setValues:values |
871 | 256 |
|
257 |
" |
|
258 |
RunArray runs:#(2 3 4) values:#($a $b $c) |
|
259 |
" |
|
297 | 260 |
! ! |
261 |
||
1325
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
262 |
!RunArray methodsFor:'Compatibility-ST80'! |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
263 |
|
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
264 |
runs |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
265 |
contentsArray isNil ifTrue:[ ^ #() ]. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
266 |
^ contentsArray pairWiseCollect:[:n :v | n ] |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
267 |
|
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
268 |
" |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
269 |
|c| |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
270 |
|
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
271 |
c := RunArray new. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
272 |
c add:1 withOccurrences:1000. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
273 |
c add:2 withOccurrences:1000. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
274 |
c runs. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
275 |
" |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
276 |
! |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
277 |
|
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
278 |
values |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
279 |
contentsArray isNil ifTrue:[ ^ #() ]. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
280 |
^ contentsArray pairWiseCollect:[:n :v | v ] |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
281 |
|
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
282 |
" |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
283 |
|c| |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
284 |
|
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
285 |
c := RunArray new. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
286 |
c add:1 withOccurrences:1000. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
287 |
c add:2 withOccurrences:1000. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
288 |
c values. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
289 |
" |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
290 |
! ! |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
291 |
|
297 | 292 |
!RunArray methodsFor:'accessing'! |
293 |
||
352 | 294 |
at:index |
295 |
"Answer the element at index. |
|
297 | 296 |
at: is used by a knowledgeable client to access an existing element |
299 | 297 |
This is a pretty dumb thing to do to a runArray and it is |
297 | 298 |
not at all efficient (think of that as a discouragement)." |
299 |
||
300 |
|position "{ Class: SmallInteger }" |
|
301 |
nRuns "{ Class: SmallInteger }"| |
|
302 |
||
352 | 303 |
(index > 0) ifTrue:[ |
297 | 304 |
position := 1. |
299 | 305 |
nRuns := contentsArray size. |
297 | 306 |
1 to:nRuns by:2 do:[:runIndex | |
307 |
|runLen| |
|
308 |
||
299 | 309 |
runLen := contentsArray at:runIndex. |
352 | 310 |
index >= position ifTrue:[ |
311 |
index < (position + runLen) ifTrue:[ |
|
299 | 312 |
^ contentsArray at:(runIndex + 1) |
297 | 313 |
]. |
314 |
]. |
|
315 |
position := position + runLen |
|
316 |
] |
|
317 |
]. |
|
352 | 318 |
^ self subscriptBoundsError:index |
297 | 319 |
|
320 |
" |
|
321 |
|c| |
|
322 |
||
323 |
c := RunArray new. |
|
324 |
c add:1; add:1; add:1; add:2; add:2; add:3; add:3; add:4; add:5. |
|
325 |
c at:1. |
|
326 |
c at:2. |
|
327 |
c at:3. |
|
328 |
c at:4. |
|
329 |
c at:5. |
|
330 |
c at:6. |
|
331 |
c at:7. |
|
332 |
c at:8. |
|
333 |
c at:9. |
|
334 |
c at:10. |
|
335 |
" |
|
336 |
||
352 | 337 |
"Modified: 18.5.1996 / 14:54:52 / cg" |
297 | 338 |
! |
339 |
||
340 |
at:index put:anObject |
|
341 |
"Put anObject at element index anInteger. |
|
588 | 342 |
at:put: can not be used to append, front or back, to a runArray. |
343 |
It is used by a knowledgeable client to replace an element. |
|
299 | 344 |
This is a pretty dumb thing to do to a runArray and it is |
345 |
very inefficient, since we have to check if runs are to be merged or |
|
346 |
splitted." |
|
297 | 347 |
|
348 |
|runSz runIndex runOffset len l1 l2 prevIdx nextIdx |
|
450 | 349 |
val newRuns prevLen prevVal nextLen nextVal idx| |
297 | 350 |
|
299 | 351 |
runSz := contentsArray size. |
297 | 352 |
|
353 |
runIndex := nil. |
|
354 |
(index > 0) ifTrue:[ |
|
355 |
runOffset := 1. |
|
356 |
idx := 1. |
|
357 |
[runIndex isNil and:[idx < runSz]] whileTrue:[ |
|
299 | 358 |
len := contentsArray at:idx. |
297 | 359 |
nextIdx := runOffset + len. |
360 |
index >= runOffset ifTrue:[ |
|
361 |
index < nextIdx ifTrue:[ |
|
362 |
runIndex := idx. |
|
363 |
nextIdx := runOffset. "/ dont advance |
|
364 |
]. |
|
365 |
]. |
|
366 |
runOffset := nextIdx. |
|
367 |
idx := idx + 2. |
|
368 |
] |
|
369 |
]. |
|
370 |
runIndex isNil ifTrue:[ |
|
352 | 371 |
^ self subscriptBoundsError:index |
297 | 372 |
]. |
373 |
||
299 | 374 |
val := contentsArray at:(runIndex + 1). |
297 | 375 |
|
376 |
"/ easiest: value there is the same ... |
|
377 |
||
378 |
val = anObject ifTrue:[ |
|
379 |
^ anObject |
|
380 |
]. |
|
381 |
||
382 |
"/ if the length is 1, this is an island ... |
|
383 |
"/ ... which is either easy, or requires a merge. |
|
384 |
||
299 | 385 |
len := contentsArray at:runIndex. |
297 | 386 |
len = 1 ifTrue:[ |
387 |
"/ check if it can be merged into the next or previous run |
|
388 |
||
389 |
runIndex > 1 ifTrue:[ |
|
390 |
prevIdx := runIndex - 2. |
|
299 | 391 |
prevVal := contentsArray at:(prevIdx + 1). |
297 | 392 |
prevVal = anObject ifTrue:[ |
393 |
"/ can merge it into previous |
|
394 |
||
299 | 395 |
prevLen := contentsArray at:prevIdx. |
297 | 396 |
|
397 |
"/ check if merge into next is also possible (filling an island) |
|
398 |
||
399 |
runIndex < (runSz - 1) ifTrue:[ |
|
400 |
nextIdx := runIndex + 2. |
|
299 | 401 |
nextVal := contentsArray at:(nextIdx + 1). |
297 | 402 |
nextVal = anObject ifTrue:[ |
403 |
"/ can merge with both. |
|
404 |
||
299 | 405 |
nextLen := contentsArray at:nextIdx. |
297 | 406 |
|
299 | 407 |
contentsArray at:prevIdx put:prevLen+nextLen+1. |
297 | 408 |
runSz := (runSz - 4). |
409 |
newRuns := Array new:runSz. |
|
299 | 410 |
newRuns replaceFrom:1 to:(prevIdx + 1) with:contentsArray startingAt:1. |
411 |
newRuns replaceFrom:runIndex to:runSz with:contentsArray startingAt:nextIdx+2. |
|
412 |
contentsArray := newRuns. |
|
297 | 413 |
^ anObject |
414 |
] |
|
415 |
]. |
|
416 |
||
299 | 417 |
contentsArray at:prevIdx put:prevLen+1. |
297 | 418 |
|
419 |
runSz := (runSz - 2). |
|
420 |
newRuns := Array new:runSz. |
|
299 | 421 |
newRuns replaceFrom:1 to:(runIndex - 1) with:contentsArray startingAt:1. |
422 |
newRuns replaceFrom:runIndex to:runSz with:contentsArray startingAt:runIndex+2. |
|
423 |
contentsArray := newRuns. |
|
297 | 424 |
|
425 |
^ anObject |
|
426 |
]. |
|
427 |
]. |
|
428 |
||
429 |
"/ check if merge into next is possible |
|
430 |
||
305 | 431 |
runIndex < (runSz-1) ifTrue:[ |
297 | 432 |
nextIdx := runIndex + 2. |
299 | 433 |
nextVal := contentsArray at:nextIdx+1. |
297 | 434 |
nextVal = anObject ifTrue:[ |
299 | 435 |
nextLen := contentsArray at:nextIdx. |
436 |
contentsArray at:nextIdx put:nextLen + 1. |
|
297 | 437 |
|
438 |
runSz := (runSz - 2). |
|
439 |
newRuns := Array new:runSz. |
|
299 | 440 |
newRuns replaceFrom:1 to:(runIndex - 1) with:contentsArray startingAt:1. |
441 |
newRuns replaceFrom:runIndex to:runSz with:contentsArray startingAt:nextIdx. |
|
442 |
contentsArray := newRuns. |
|
297 | 443 |
^ anObject |
444 |
]. |
|
445 |
]. |
|
446 |
||
447 |
"/ no merge; island remains |
|
448 |
||
299 | 449 |
contentsArray at:(runIndex+1) put:anObject. |
297 | 450 |
^ anObject |
451 |
]. |
|
452 |
||
453 |
runOffset == index ifTrue:[ |
|
454 |
"/ at the beginning of that run ... |
|
455 |
||
456 |
"/ check if its better added to the previous run ... |
|
457 |
||
458 |
runIndex > 1 ifTrue:[ |
|
459 |
prevIdx := runIndex - 2. |
|
299 | 460 |
prevVal := contentsArray at:prevIdx+1. |
297 | 461 |
prevVal = anObject ifTrue:[ |
299 | 462 |
prevLen := contentsArray at:prevIdx. |
463 |
contentsArray at:prevIdx put:prevLen + 1. |
|
464 |
contentsArray at:runIndex put:len - 1. |
|
297 | 465 |
^ anObject. |
466 |
]. |
|
467 |
]. |
|
468 |
||
469 |
"/ must cut off 1 & insert a new run before .. |
|
470 |
||
299 | 471 |
contentsArray at:runIndex put:len - 1. |
297 | 472 |
|
473 |
runSz := (runSz + 2). |
|
474 |
newRuns := Array new:runSz. |
|
299 | 475 |
newRuns replaceFrom:1 to:(runIndex - 1) with:contentsArray startingAt:1. |
476 |
newRuns replaceFrom:runIndex+2 to:runSz with:contentsArray startingAt:runIndex. |
|
477 |
contentsArray := newRuns. |
|
297 | 478 |
|
299 | 479 |
contentsArray at:runIndex put:1. |
480 |
contentsArray at:runIndex+1 put:anObject. |
|
297 | 481 |
^ anObject |
482 |
]. |
|
483 |
||
484 |
(runOffset + len - 1) == index ifTrue:[ |
|
485 |
"/ at the end ... |
|
486 |
||
487 |
"/ check if its better added to the next run ... |
|
488 |
||
306 | 489 |
runIndex < (runSz-1) ifTrue:[ |
297 | 490 |
nextIdx := runIndex + 2. |
299 | 491 |
nextVal := contentsArray at:nextIdx+1. |
297 | 492 |
nextVal = anObject ifTrue:[ |
299 | 493 |
nextLen := contentsArray at:nextIdx. |
494 |
contentsArray at:nextIdx put:nextLen + 1. |
|
495 |
contentsArray at:runIndex put:len - 1. |
|
297 | 496 |
^ anObject. |
497 |
]. |
|
498 |
]. |
|
499 |
||
500 |
"/ must cut off 1 & insert a new run after .. |
|
501 |
||
299 | 502 |
contentsArray at:runIndex put:len - 1. |
297 | 503 |
|
504 |
runSz := (runSz + 2). |
|
505 |
newRuns := Array new:runSz. |
|
299 | 506 |
newRuns replaceFrom:1 to:(runIndex + 1) with:contentsArray startingAt:1. |
507 |
newRuns replaceFrom:runIndex+4 to:runSz with:contentsArray startingAt:runIndex+2. |
|
508 |
contentsArray := newRuns. |
|
297 | 509 |
|
299 | 510 |
contentsArray at:runIndex+2 put:1. |
511 |
contentsArray at:runIndex+2+1 put:anObject. |
|
297 | 512 |
^ anObject |
513 |
]. |
|
514 |
||
515 |
"/ hardest - split run into two, insert new run in-between |
|
516 |
||
517 |
runSz := (runSz + 4). |
|
518 |
newRuns := Array new:runSz. |
|
519 |
||
520 |
runIndex > 1 ifTrue:[ |
|
299 | 521 |
newRuns replaceFrom:1 to:runIndex-1 with:contentsArray. |
297 | 522 |
]. |
305 | 523 |
newRuns replaceFrom:runIndex+6 to:runSz with:contentsArray startingAt:runIndex+2. |
297 | 524 |
|
525 |
l2 := len - (index - runOffset). |
|
526 |
l1 := len - l2. |
|
527 |
l2 := l2 - 1. |
|
528 |
||
529 |
newRuns at:runIndex put:l1. |
|
530 |
newRuns at:runIndex+1 put:val. |
|
531 |
||
532 |
newRuns at:runIndex+4 put:l2. |
|
533 |
newRuns at:runIndex+5 put:val. |
|
534 |
||
535 |
"/ insert |
|
536 |
newRuns at:runIndex+2 put:1. |
|
537 |
newRuns at:runIndex+3 put:anObject. |
|
538 |
||
299 | 539 |
contentsArray := newRuns. |
297 | 540 |
^ anObject |
541 |
||
542 |
" |
|
543 |
|c| |
|
544 |
||
545 |
Transcript cr. |
|
546 |
||
547 |
c := RunArray new. |
|
548 |
c add:1; add:1; add:1; add:2; add:2; add:3; add:3; add:4; add:5; yourself. |
|
350 | 549 |
Transcript showCR:c. |
297 | 550 |
|
551 |
c at:1 put:$a. |
|
350 | 552 |
Transcript showCR:c. |
297 | 553 |
c. |
554 |
||
555 |
c at:3 put:$a. |
|
350 | 556 |
Transcript showCR:c. |
297 | 557 |
c. |
558 |
||
559 |
c at:4 put:$a. |
|
350 | 560 |
Transcript showCR:c. |
297 | 561 |
c. |
562 |
||
563 |
c at:5 put:$a. |
|
350 | 564 |
Transcript showCR:c. |
297 | 565 |
c. |
566 |
||
567 |
c at:2 put:$0. |
|
350 | 568 |
Transcript showCR:c. |
297 | 569 |
c. |
570 |
||
571 |
c at:2 put:$a. |
|
350 | 572 |
Transcript showCR:c. |
297 | 573 |
c. |
574 |
||
350 | 575 |
Transcript showCR:c. |
297 | 576 |
" |
577 |
||
588 | 578 |
"Modified: / 30.10.1997 / 14:38:45 / cg" |
297 | 579 |
! ! |
580 |
||
904 | 581 |
!RunArray methodsFor:'adding & removing'! |
297 | 582 |
|
583 |
add:newObject |
|
584 |
"add newObject at the end; returns the object (sigh)" |
|
585 |
||
586 |
^ self add:newObject withOccurrences:1. |
|
587 |
||
588 |
" |
|
589 |
|c| |
|
590 |
||
591 |
c := RunArray new. |
|
592 |
c add:1; add:1; add:1; add:2; add:2; add:3; add:3; add:4; add:5; yourself. |
|
593 |
" |
|
594 |
||
595 |
"Modified: 10.5.1996 / 17:01:20 / cg" |
|
596 |
! |
|
597 |
||
598 |
add:newObject withOccurrences:n |
|
599 |
"add newObject n times at the end; returns the object (sigh)" |
|
600 |
||
601 |
|lastIdx runSz newRuns| |
|
602 |
||
299 | 603 |
contentsArray notNil ifTrue:[ |
297 | 604 |
"/ check for merge |
605 |
||
299 | 606 |
runSz := contentsArray size. |
297 | 607 |
|
299 | 608 |
(contentsArray at:runSz) = newObject ifTrue:[ |
297 | 609 |
lastIdx := runSz - 1. |
299 | 610 |
contentsArray at:lastIdx put:(contentsArray at:lastIdx) + n. |
297 | 611 |
^ newObject |
612 |
]. |
|
613 |
||
614 |
newRuns := Array new:(runSz + 2). |
|
299 | 615 |
newRuns replaceFrom:1 to:runSz with:contentsArray. |
297 | 616 |
newRuns at:runSz+1 put:n. |
617 |
newRuns at:runSz+2 put:newObject. |
|
299 | 618 |
contentsArray := newRuns. |
297 | 619 |
] ifFalse:[ |
299 | 620 |
contentsArray := Array with:n with:newObject. |
297 | 621 |
]. |
622 |
^ newObject |
|
623 |
||
624 |
" |
|
625 |
|c| |
|
626 |
||
627 |
c := RunArray new. |
|
628 |
c add:1 withOccurrences:1000; yourself. |
|
2049
310eea860aa2
changed #add:withOccurrences: - comment
Stefan Vogel <sv@exept.de>
parents:
1855
diff
changeset
|
629 |
c add:1 withOccurrences:500; yourself. |
297 | 630 |
c add:2 withOccurrences:1000; yourself. |
631 |
" |
|
632 |
||
299 | 633 |
"Modified: 11.5.1996 / 13:34:37 / cg" |
297 | 634 |
! ! |
635 |
||
892 | 636 |
!RunArray methodsFor:'comparing'! |
637 |
||
638 |
= aCollection |
|
639 |
"return true, if the argument contains the same elements as the receiver. |
|
640 |
Optimized, especially for the common case, that collection is another runArray" |
|
641 |
||
642 |
|otherContents idx1 idx2 runCount1 runValue1 runCount2 runValue2| |
|
643 |
||
644 |
aCollection class == self class ifFalse:[ |
|
645 |
aCollection isSequenceable ifTrue:[ |
|
646 |
idx1 := 1. |
|
647 |
self do:[:element | |
|
648 |
idx1 > aCollection size ifTrue:[^ false]. |
|
649 |
element = (aCollection at:idx1) ifFalse:[^ false]. |
|
650 |
idx1 := idx1+1. |
|
651 |
]. |
|
652 |
idx1 > aCollection size ifFalse:[^ false]. |
|
653 |
^ true. |
|
654 |
]. |
|
655 |
||
656 |
idx1 := 1. |
|
657 |
runCount1 := 0. |
|
658 |
||
659 |
aCollection do:[:element | |
|
660 |
runCount1 == 0 ifTrue:[ |
|
661 |
idx1+1 > contentsArray size ifTrue:[^ false]. |
|
662 |
||
663 |
runCount1 := contentsArray at:idx1. |
|
664 |
runValue1 := contentsArray at:idx1+1. |
|
665 |
idx1 := idx1+2. |
|
666 |
]. |
|
667 |
runValue1 = element ifFalse:[^ false]. |
|
668 |
runCount1 := runCount1 - 1. |
|
669 |
]. |
|
670 |
runCount1 ~~ 0 ifTrue:[^ false]. |
|
671 |
idx1+1 > contentsArray size ifFalse:[^ false]. |
|
672 |
^ true |
|
673 |
]. |
|
674 |
otherContents := aCollection getContentsArray. |
|
675 |
otherContents = contentsArray ifTrue:[^ true]. |
|
676 |
||
677 |
idx1 := 1. |
|
895 | 678 |
runCount1 := 0. |
892 | 679 |
|
680 |
idx2 := 1. |
|
895 | 681 |
runCount2 := 0. |
892 | 682 |
|
683 |
[true] whileTrue:[ |
|
895 | 684 |
runCount1 == 0 ifTrue:[ |
685 |
idx1+1 > contentsArray size ifTrue:[ |
|
686 |
idx2+1 <= otherContents size ifTrue:[^ false]. |
|
687 |
runCount2 ~~ 0 ifTrue:[^ false]. |
|
688 |
^ true. |
|
689 |
]. |
|
690 |
runCount1 := contentsArray at:idx1. |
|
691 |
runValue1 := contentsArray at:idx1+1. |
|
692 |
idx1 := idx1+2. |
|
693 |
]. |
|
694 |
runCount2 == 0 ifTrue:[ |
|
695 |
idx2+1 > otherContents size ifTrue:[ |
|
696 |
^ false |
|
697 |
]. |
|
698 |
runCount2 := otherContents at:idx2. |
|
699 |
runValue2 := otherContents at:idx2+1. |
|
700 |
idx2 := idx2+2. |
|
701 |
]. |
|
702 |
||
892 | 703 |
runValue1 = runValue2 ifFalse:[^ false]. |
895 | 704 |
runCount1 > runCount2 ifTrue:[ |
705 |
runCount1 := runCount1 - runCount2. |
|
706 |
runCount2 := 0. |
|
892 | 707 |
] ifFalse:[ |
895 | 708 |
runCount2 := runCount2 - runCount1. |
709 |
runCount1 := 0. |
|
710 |
]. |
|
892 | 711 |
]. |
712 |
||
713 |
" |
|
714 |
'hello' asText sameStringAndEmphasisAs: 'hello' asText |
|
715 |
'hello' asText sameStringAndEmphasisAs: 'hello' asText allBold |
|
716 |
'hello' asText allBold sameStringAndEmphasisAs: 'hello' asText allBold |
|
717 |
'hello1' asText allBold sameStringAndEmphasisAs: 'hello' asText allBold |
|
718 |
'hello' asText allBold sameStringAndEmphasisAs: 'hello1' asText allBold |
|
719 |
('hello' asText allBold , ' ') sameStringAndEmphasisAs: 'hello ' asText allBold |
|
720 |
('hello ' asText allBold) sameStringAndEmphasisAs: ('hello' asText allBold , ' ') |
|
721 |
('hello' asText allBold , ' ') sameStringAndEmphasisAs: ('hello' asText allBold , ' ') |
|
722 |
'hello' asRunArray = 'hello' asRunArray |
|
723 |
'hello1' asRunArray = 'hello' asRunArray |
|
724 |
'hello' asRunArray = 'hello1' asRunArray |
|
725 |
'hello' asRunArray = 'hello' asArray |
|
726 |
'hello1' asRunArray = 'hello' asArray |
|
727 |
'hello' asRunArray = 'hello1' asArray |
|
728 |
" |
|
729 |
! ! |
|
730 |
||
297 | 731 |
!RunArray methodsFor:'converting'! |
732 |
||
733 |
asOrderedCollection |
|
299 | 734 |
"return a new orderedCollection, containing the receivers elements." |
297 | 735 |
|
736 |
|newCollection| |
|
737 |
||
299 | 738 |
contentsArray isNil ifTrue:[^ OrderedCollection new]. |
739 |
||
740 |
newCollection := OrderedCollection new:(self size). |
|
741 |
contentsArray pairWiseDo:[:len :value | |
|
742 |
newCollection add:value withOccurrences:len |
|
743 |
]. |
|
297 | 744 |
^ newCollection |
745 |
||
299 | 746 |
" |
747 |
|r| |
|
748 |
||
749 |
r := RunArray withAll:#(1 2 3 3 3 3 4 4 4 5 6 7 7 7 7 7 7 7). |
|
350 | 750 |
Transcript showCR:r. |
751 |
Transcript showCR:r asOrderedCollection |
|
299 | 752 |
" |
753 |
||
754 |
"Modified: 11.5.1996 / 13:34:59 / cg" |
|
334 | 755 |
! |
756 |
||
757 |
asRunArray |
|
630
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
758 |
"return the receiver itself" |
334 | 759 |
|
760 |
^ self |
|
761 |
||
630
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
762 |
"Modified: / 7.4.1998 / 09:50:29 / cg" |
297 | 763 |
! ! |
764 |
||
352 | 765 |
!RunArray methodsFor:'copying'! |
766 |
||
767 |
copyFrom:start to:stop |
|
768 |
"return a new collection, containing the elements from start to stop" |
|
769 |
||
770 |
|runStart runNext newRuns idx copying| |
|
771 |
||
772 |
(contentsArray notNil |
|
773 |
and:[stop >= start]) ifTrue:[ |
|
774 |
newRuns := self species new. |
|
775 |
runStart := 1. |
|
776 |
idx := start. |
|
777 |
copying := false. |
|
778 |
contentsArray pairWiseDo:[:len :val | |
|
779 |
runNext := runStart + len. |
|
780 |
||
781 |
copying ifFalse:[ |
|
782 |
idx >= runStart ifTrue:[ |
|
783 |
copying := true |
|
784 |
] |
|
785 |
]. |
|
786 |
copying ifTrue:[ |
|
787 |
idx < runNext ifTrue:[ |
|
788 |
"/ found the first run |
|
789 |
||
790 |
stop < runNext ifTrue:[ |
|
791 |
newRuns add:val withOccurrences:(stop-idx+1). |
|
792 |
^ newRuns |
|
793 |
]. |
|
794 |
||
795 |
newRuns add:val withOccurrences:(runNext-idx). |
|
796 |
idx := runNext. |
|
797 |
]. |
|
798 |
]. |
|
799 |
runStart := runNext. |
|
800 |
] |
|
801 |
]. |
|
802 |
||
803 |
^ super copyFrom:start to:stop "/ for the error report |
|
804 |
||
805 |
" |
|
806 |
|r| |
|
807 |
r := RunArray withAll:#(1 2 3 3 3 3 4 4 4 5 6 7 7 7 7 7 7 7). |
|
808 |
r copyFrom:1 to:10 |
|
809 |
||
810 |
|r| |
|
811 |
r := RunArray withAll:#(1 2 3 3 3 3 3 3 4 5 6 7 7 7 7 7 7 7). |
|
812 |
r copyFrom:4 to:10 |
|
813 |
||
814 |
|r| |
|
815 |
r := RunArray withAll:#(1 2 3 3 3 3 3 3 4 5 6 7 7 7 7 7 7 7). |
|
816 |
r copyFrom:1 to:20 |
|
817 |
" |
|
818 |
||
819 |
"Modified: 18.5.1996 / 19:28:47 / cg" |
|
820 |
! ! |
|
821 |
||
297 | 822 |
!RunArray methodsFor:'enumerating'! |
823 |
||
824 |
do:aBlock |
|
825 |
"Evaluate aBlock with each of the receiver's elements as the |
|
826 |
argument. " |
|
827 |
||
299 | 828 |
contentsArray notNil ifTrue:[ |
829 |
contentsArray pairWiseDo:[:len :val | |
|
588 | 830 |
len timesRepeat:[aBlock value:val] |
297 | 831 |
] |
832 |
] |
|
833 |
||
588 | 834 |
"Modified: / 30.10.1997 / 15:53:37 / cg" |
305 | 835 |
! |
836 |
||
837 |
runsDo:aBlock |
|
838 |
"Evaluate aBlock with each of the receiver's runs, passing |
|
839 |
length and value as arguments." |
|
840 |
||
841 |
contentsArray notNil ifTrue:[ |
|
842 |
contentsArray pairWiseDo:aBlock |
|
843 |
] |
|
844 |
||
845 |
"Modified: 11.5.1996 / 13:35:03 / cg" |
|
846 |
"Created: 12.5.1996 / 11:06:51 / cg" |
|
297 | 847 |
! ! |
848 |
||
303 | 849 |
!RunArray methodsFor:'printing & storing'! |
297 | 850 |
|
2127 | 851 |
displayOn:aGCOrStream |
852 |
"Append to aStream an expression which, if evaluated, will generate |
|
853 |
an object similar to the receiver." |
|
854 |
||
855 |
"/ what a kludge - Dolphin and Squeak mean: printOn: a stream; |
|
856 |
"/ ST/X (and some old ST80's) mean: draw-yourself on a GC. |
|
857 |
(aGCOrStream isStream or:[aGCOrStream == Transcript]) ifTrue:[ |
|
858 |
aGCOrStream nextPutAll: '(RunArray new'. |
|
859 |
contentsArray notNil ifTrue:[ |
|
860 |
contentsArray pairWiseDo:[:len :val | |
|
861 |
aGCOrStream nextPutAll: ' add:'. val displayOn:aGCOrStream. |
|
862 |
len == 1 ifFalse:[ |
|
863 |
aGCOrStream nextPutAll:' withOccurrences:'. len printOn:aGCOrStream. |
|
864 |
]. |
|
865 |
aGCOrStream nextPutAll:';' |
|
866 |
]. |
|
867 |
aGCOrStream nextPutAll:' yourself' |
|
868 |
]. |
|
869 |
aGCOrStream nextPutAll:')'. |
|
870 |
^ self. |
|
871 |
]. |
|
872 |
^ self displayOn:aGCOrStream x:0 y:0. |
|
873 |
||
874 |
" |
|
875 |
(RunArray new |
|
876 |
add:1; |
|
877 |
add:1; |
|
878 |
add:2; |
|
879 |
add:3; |
|
880 |
add:4 withOccurrences:100; |
|
881 |
add:5; |
|
882 |
yourself) displayString |
|
883 |
||
884 |
RunArray new displayString |
|
885 |
" |
|
886 |
! |
|
887 |
||
297 | 888 |
storeOn:aStream |
889 |
"Append to aStream an expression which, if evaluated, will generate |
|
890 |
an object similar to the receiver." |
|
891 |
||
892 |
aStream nextPutAll: '(RunArray new'. |
|
299 | 893 |
contentsArray notNil ifTrue:[ |
894 |
contentsArray pairWiseDo:[:len :val | |
|
2127 | 895 |
aStream nextPutAll: ' add:'. val storeOn:aStream. |
297 | 896 |
len == 1 ifFalse:[ |
2127 | 897 |
aStream nextPutAll:' withOccurrences:'. len printOn:aStream. |
297 | 898 |
]. |
899 |
aStream nextPutAll:';' |
|
900 |
]. |
|
901 |
aStream nextPutAll:' yourself' |
|
902 |
]. |
|
903 |
aStream nextPutAll:')' |
|
904 |
||
905 |
" |
|
906 |
(RunArray new |
|
907 |
add:1; |
|
908 |
add:1; |
|
909 |
add:2; |
|
910 |
add:3; |
|
303 | 911 |
add:4 withOccurrences:100; |
297 | 912 |
add:5; |
303 | 913 |
yourself) storeString |
297 | 914 |
|
915 |
RunArray new storeString |
|
916 |
" |
|
299 | 917 |
|
303 | 918 |
"Modified: 11.5.1996 / 14:28:38 / cg" |
297 | 919 |
! ! |
920 |
||
921 |
!RunArray methodsFor:'private'! |
|
922 |
||
923 |
find:oldObject |
|
924 |
"If I contain oldObject return its index, otherwise create an error |
|
588 | 925 |
notifier. It will answer with the position of the very first element of |
926 |
that value. |
|
927 |
OBSOLETE: this is a leftover from earlier times; use #indexOf:ifAbsent:" |
|
297 | 928 |
|
966 | 929 |
<resource:#obsolete> |
930 |
||
588 | 931 |
|idx| |
297 | 932 |
|
588 | 933 |
self obsoleteMethodWarning:'use #indexOf:ifAbsent:'. |
934 |
idx := self indexOf:oldObject ifAbsent:0. |
|
935 |
idx ~~ 0 ifTrue:[^ idx]. |
|
936 |
^ self errorValueNotFound:oldObject |
|
297 | 937 |
|
938 |
" |
|
939 |
|c| |
|
940 |
||
941 |
c := RunArray new. |
|
942 |
c add:1; add:1; add:1; add:2; add:2; add:3; add:3; add:4; add:5. |
|
943 |
c find:2. |
|
944 |
||
945 |
c find:99 |
|
946 |
" |
|
947 |
||
588 | 948 |
"Modified: / 30.10.1997 / 15:51:38 / cg" |
297 | 949 |
! |
950 |
||
951 |
find:oldObject ifAbsent:exceptionBlock |
|
952 |
"If I contain oldObject return its index, otherwise execute the |
|
953 |
exception block. It will answer with the position of the very first |
|
588 | 954 |
element of that value. |
955 |
OBSOLETE: this is a leftover from earlier times; use #indexOf:ifAbsent:" |
|
297 | 956 |
|
966 | 957 |
<resource:#obsolete> |
958 |
||
588 | 959 |
self obsoleteMethodWarning:'use #indexOf:'. |
960 |
^ self indexOf:oldObject ifAbsent:exceptionBlock |
|
297 | 961 |
|
588 | 962 |
"Modified: / 30.10.1997 / 15:49:54 / cg" |
297 | 963 |
! |
964 |
||
892 | 965 |
getContentsArray |
966 |
^ contentsArray |
|
967 |
! |
|
968 |
||
297 | 969 |
runIndexAndStartIndexForIndex:anIndex |
970 |
"given a logical index, find the index of that run and the logical index |
|
971 |
of the first item in that run." |
|
972 |
||
973 |
|position nRuns "{ Class: SmallInteger }"| |
|
974 |
||
975 |
position := 1. |
|
299 | 976 |
nRuns := contentsArray size. |
297 | 977 |
1 to:nRuns by:2 do:[:runIndex | |
978 |
|runLen runLast| |
|
979 |
||
299 | 980 |
runLen := contentsArray at:runIndex. |
297 | 981 |
anIndex >= position ifTrue:[ |
982 |
runLast := position + runLen - 1. |
|
983 |
anIndex <= runLast ifTrue:[ |
|
984 |
^ Array with:runIndex with:position |
|
985 |
]. |
|
986 |
]. |
|
987 |
position := position + runLen |
|
988 |
]. |
|
989 |
||
990 |
^ #(0 0) |
|
991 |
||
992 |
"Created: 10.5.1996 / 17:12:28 / cg" |
|
299 | 993 |
"Modified: 11.5.1996 / 13:35:21 / cg" |
302 | 994 |
! |
995 |
||
996 |
setElement:newObject occurrences:n |
|
997 |
"private instance setup" |
|
998 |
||
999 |
contentsArray := Array with:n with:newObject. |
|
1000 |
||
1001 |
"Created: 11.5.1996 / 14:05:58 / cg" |
|
630
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1002 |
! |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1003 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1004 |
setElementsFrom:aCollection |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1005 |
"set my elements from aCollection" |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1006 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1007 |
|nRuns last runLen first dIdx| |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1008 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1009 |
aCollection size == 0 ifTrue:[^ self]. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1010 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1011 |
"/ to avoid the reallocations when using |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1012 |
"/ multiple #add:withOccurrences: calls, |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1013 |
"/ generate the runs collction as an orderedCollection |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1014 |
"/ and convert to an array at the end. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1015 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1016 |
nRuns := 0. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1017 |
first := true. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1018 |
aCollection do:[:element | |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1019 |
first ifTrue:[ |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1020 |
nRuns := nRuns + 1. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1021 |
last := element. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1022 |
first := false. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1023 |
] ifFalse:[ |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1024 |
element ~~ last ifTrue:[ |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1025 |
nRuns := nRuns + 1. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1026 |
last := element. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1027 |
] |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1028 |
] |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1029 |
]. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1030 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1031 |
"/ now, we know how many runs there are ... |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1032 |
contentsArray := Array new:(nRuns*2). |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1033 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1034 |
nRuns := 0. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1035 |
runLen := 0. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1036 |
dIdx := 1. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1037 |
aCollection do:[:element | |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1038 |
runLen == 0 ifTrue:[ |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1039 |
last := element. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1040 |
runLen := 1. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1041 |
] ifFalse:[ |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1042 |
element == last ifTrue:[ |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1043 |
runLen := runLen + 1. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1044 |
] ifFalse:[ |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1045 |
contentsArray at:dIdx put:runLen. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1046 |
contentsArray at:dIdx+1 put:last. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1047 |
dIdx := dIdx + 2. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1048 |
runLen := 1. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1049 |
last := element. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1050 |
] |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1051 |
] |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1052 |
]. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1053 |
runLen ~~ 0 ifTrue:[ |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1054 |
contentsArray at:dIdx put:runLen. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1055 |
contentsArray at:dIdx+1 put:last. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1056 |
]. |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1057 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1058 |
" |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1059 |
RunArray from:#(1 2 3 3 3 4 5 5 6 6 6 6 6 6) |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1060 |
" |
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1061 |
|
55973d9fee59
added #from: instance creation method.
Claus Gittinger <cg@exept.de>
parents:
588
diff
changeset
|
1062 |
"Modified: / 7.4.1998 / 09:33:57 / cg" |
871 | 1063 |
! |
1064 |
||
1065 |
setElementsFromRuns:runs values:values |
|
1451 | 1066 |
<resource:#obsolete> |
1325
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
1067 |
self obsoleteMethodWarning:'use #setRuns:setValues: for VW compatibility'. |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
1068 |
self setRuns:runs setValues:values |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
1069 |
! |
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
1070 |
|
1c503fd677a7
runs values for VW compatibility
Claus Gittinger <cg@exept.de>
parents:
966
diff
changeset
|
1071 |
setRuns:runs setValues:values |
871 | 1072 |
|idx| |
1073 |
||
1074 |
contentsArray := Array new:(runs size * 2). |
|
1075 |
idx := 1. |
|
1076 |
runs with:values do:[:length :value | |
|
1077 |
contentsArray at:idx put:length. |
|
1078 |
contentsArray at:idx+1 put:value. |
|
1079 |
idx := idx + 2. |
|
1080 |
]. |
|
297 | 1081 |
! ! |
1082 |
||
904 | 1083 |
!RunArray methodsFor:'private-growing'! |
1084 |
||
1085 |
grow:howBig |
|
1086 |
"grow or shrink the receiver to contain howBig elements. |
|
1087 |
If growing, new slots will be filled (logically) with nil." |
|
1088 |
||
1089 |
|sz info runIndex runOffset runSz newRuns| |
|
1090 |
||
1091 |
sz := self size. |
|
1092 |
||
1093 |
howBig == sz ifTrue:[^ self]. |
|
1094 |
||
1095 |
howBig == 0 ifTrue:[ |
|
1096 |
contentsArray := nil. |
|
1097 |
^ self. |
|
1098 |
]. |
|
1099 |
||
1100 |
contentsArray isNil ifTrue:[ |
|
1101 |
contentsArray := Array with:howBig with:nil. |
|
1102 |
^ self |
|
1103 |
]. |
|
1104 |
||
1105 |
runSz := contentsArray size. |
|
1106 |
||
1107 |
howBig > sz ifTrue:[ |
|
1108 |
newRuns := Array new:(runSz + 2). |
|
1109 |
newRuns replaceFrom:1 to:runSz with:contentsArray startingAt:1. |
|
1110 |
newRuns at:(runSz+1) put:(howBig - sz). |
|
1111 |
contentsArray := newRuns. |
|
1112 |
^ self |
|
1113 |
]. |
|
1114 |
||
1115 |
"/ shrinking; possibly cut of a run |
|
1116 |
||
1117 |
info := self runIndexAndStartIndexForIndex:howBig. |
|
1118 |
runIndex := info at:1. |
|
1119 |
runOffset := info at:2. |
|
1120 |
||
1121 |
howBig == (runOffset - 1) ifTrue:[ |
|
1122 |
"/ we are lucky - new size is up-to previous run |
|
1123 |
||
1124 |
contentsArray := contentsArray copyFrom:1 to:runIndex-1. |
|
1125 |
] ifFalse:[ |
|
1126 |
contentsArray := contentsArray copyFrom:1 to:(runIndex+1). |
|
1127 |
contentsArray at:runIndex put:(howBig - runOffset + 1) |
|
1128 |
]. |
|
1129 |
||
1130 |
" |
|
1131 |
|c| |
|
1132 |
||
1133 |
c := RunArray new. |
|
1134 |
c addAll:#(1 2 3 4 4 4 4 5 5 5 1 2 3); yourself. |
|
1135 |
||
1136 |
c grow:50; yourself. |
|
1137 |
||
1138 |
c grow:7; yourself. |
|
1139 |
||
1140 |
c grow:6; yourself. |
|
1141 |
||
1142 |
c grow:0; yourself. |
|
1143 |
" |
|
1144 |
||
1145 |
"Modified: 11.5.1996 / 13:34:53 / cg" |
|
1146 |
! ! |
|
1147 |
||
906 | 1148 |
!RunArray methodsFor:'queries'! |
1149 |
||
1150 |
size |
|
1151 |
"Answer how many elements the receiver contains. |
|
1152 |
Thsi is not the number of runs (but the simulated number of elements)." |
|
1153 |
||
1154 |
|n "{ Class: SmallInteger }" |
|
1155 |
runSz "{ Class: SmallInteger }"| |
|
1156 |
||
1157 |
n := 0. |
|
1158 |
runSz := contentsArray size. |
|
1159 |
1 to:runSz by:2 do:[:i | |
|
1160 |
n := n + (contentsArray at:i) |
|
1161 |
]. |
|
1162 |
^ n |
|
1163 |
||
1164 |
"Modified: 11.5.1996 / 13:34:27 / cg" |
|
1165 |
! ! |
|
1166 |
||
334 | 1167 |
!RunArray methodsFor:'searching'! |
1168 |
||
1169 |
findFirst:aBlock |
|
1855 | 1170 |
"find the index of the first element, for which evaluation of the argument, aBlock |
334 | 1171 |
returns true; return its index or 0 if none detected. |
1172 |
Notice, that not all elements are processed here |
|
1173 |
(the block is only evaluated for each runs first element)." |
|
1174 |
||
1175 |
|idx| |
|
1176 |
||
1177 |
idx := 1. |
|
1178 |
contentsArray notNil ifTrue:[ |
|
1179 |
contentsArray pairWiseDo:[:len :val | |
|
1180 |
(aBlock value:val) ifTrue:[^ idx]. |
|
1181 |
idx := idx + len. |
|
1182 |
] |
|
1183 |
]. |
|
1184 |
^ 0 |
|
1185 |
||
1186 |
" |
|
1187 |
(RunArray new |
|
1188 |
add:1 withOccurrences:100; |
|
1189 |
add:2 withOccurrences:100; |
|
1190 |
add:3 withOccurrences:100; |
|
1191 |
add:4 withOccurrences:100; |
|
1192 |
yourself) findFirst:[:el | el == 3] |
|
1193 |
" |
|
1194 |
||
1195 |
"Modified: 14.5.1996 / 15:54:45 / cg" |
|
588 | 1196 |
! |
1197 |
||
1198 |
identityIndexOf:anElement startingAt:start |
|
1199 |
"search for identical anElement, return the index or 0 if not found. |
|
1200 |
Redefined to prevent a loop over individual accesses via #at:, |
|
1201 |
which would be very inefficient." |
|
1202 |
||
1203 |
|idx "{ Class: SmallInteger }" | |
|
1204 |
||
1205 |
contentsArray notNil ifTrue:[ |
|
1206 |
||
1207 |
idx := 1. |
|
1208 |
contentsArray pairWiseDo:[:len :val | |
|
1209 |
|nextRunIdx "{ Class: SmallInteger }"| |
|
1210 |
||
1211 |
nextRunIdx := idx + len. |
|
1212 |
nextRunIdx > start ifTrue:[ |
|
1213 |
(anElement == val) ifTrue:[ |
|
1214 |
^ idx max:start |
|
1215 |
] |
|
1216 |
]. |
|
1217 |
idx := nextRunIdx. |
|
1218 |
]. |
|
1219 |
]. |
|
1220 |
^ 0 |
|
1221 |
||
1222 |
"Modified: / 14.5.1996 / 15:54:45 / cg" |
|
1223 |
"Created: / 30.10.1997 / 15:33:18 / cg" |
|
1224 |
! |
|
1225 |
||
1226 |
indexOf:anElement startingAt:start |
|
1227 |
"search for equal anElement, return the index or 0 if not found. |
|
1228 |
Redefined to prevent a loop over individual accesses via #at:, |
|
1229 |
which would be very inefficient." |
|
1230 |
||
1231 |
|idx "{ Class: SmallInteger }" | |
|
1232 |
||
1233 |
contentsArray notNil ifTrue:[ |
|
1234 |
||
1235 |
idx := 1. |
|
1236 |
contentsArray pairWiseDo:[:len :val | |
|
1237 |
|nextRunIdx "{ Class: SmallInteger }"| |
|
1238 |
||
1239 |
nextRunIdx := idx + len. |
|
1240 |
nextRunIdx > start ifTrue:[ |
|
1241 |
(anElement = val) ifTrue:[ |
|
1242 |
^ idx max:start |
|
1243 |
] |
|
1244 |
]. |
|
1245 |
idx := nextRunIdx. |
|
1246 |
]. |
|
1247 |
]. |
|
1248 |
^ 0 |
|
1249 |
||
1250 |
" |
|
1251 |
|r| |
|
1252 |
r := RunArray new. |
|
1253 |
r add:1 withOccurrences:100. |
|
1254 |
r add:2 withOccurrences:100. |
|
1255 |
r add:3 withOccurrences:100. |
|
1256 |
r add:4 withOccurrences:100. |
|
1257 |
r indexOf:2 startingAt:50. |
|
1258 |
r indexOf:2 startingAt:100. |
|
1259 |
r indexOf:2 startingAt:101. |
|
1260 |
r indexOf:2 startingAt:150. |
|
1261 |
r indexOf:2 startingAt:200. |
|
1262 |
r indexOf:2 startingAt:201. |
|
1263 |
r indexOf:2 startingAt:202. |
|
1264 |
" |
|
1265 |
||
1266 |
"Modified: / 30.10.1997 / 15:33:29 / cg" |
|
1267 |
! ! |
|
1268 |
||
1269 |
!RunArray methodsFor:'testing'! |
|
1270 |
||
1271 |
includes:anElement |
|
1272 |
"return true, if the receiver includes an element which is equal |
|
1273 |
to the argument, anElement; false otherwise. |
|
1274 |
Redefined to prevent the inherited loop over individual accesses via #at:, |
|
1275 |
which would be very inefficient." |
|
1276 |
||
1277 |
contentsArray notNil ifTrue:[ |
|
1278 |
contentsArray pairWiseDo:[:len :val | |
|
1279 |
(anElement = val) ifTrue:[ |
|
1280 |
^ true |
|
1281 |
]. |
|
1282 |
]. |
|
1283 |
]. |
|
1284 |
^ false |
|
1285 |
||
1286 |
"Modified: / 14.5.1996 / 15:54:45 / cg" |
|
1287 |
"Created: / 30.10.1997 / 15:38:02 / cg" |
|
1288 |
! |
|
1289 |
||
1290 |
includesIdentical:anElement |
|
1291 |
"return true, if the receiver includes the argument, anElement; false otherwise. |
|
1292 |
Redefined to prevent the inherited loop over individual accesses via #at:, |
|
1293 |
which would be very inefficient." |
|
1294 |
||
1295 |
contentsArray notNil ifTrue:[ |
|
1296 |
contentsArray pairWiseDo:[:len :val | |
|
1297 |
(anElement == val) ifTrue:[ |
|
1298 |
^ true |
|
1299 |
]. |
|
1300 |
]. |
|
1301 |
]. |
|
1302 |
^ false |
|
1303 |
||
1304 |
"Created: / 30.10.1997 / 15:38:30 / cg" |
|
904 | 1305 |
! |
1306 |
||
1307 |
isEmpty |
|
1308 |
"Am I empty or not. Returns a boolean" |
|
1309 |
||
1551 | 1310 |
^ contentsArray size == 0 |
904 | 1311 |
|
1312 |
"Modified: 11.5.1996 / 13:35:17 / cg" |
|
334 | 1313 |
! ! |
1314 |
||
297 | 1315 |
|
1316 |
!RunArray class methodsFor:'documentation'! |
|
1317 |
||
1318 |
version |
|
2127 | 1319 |
^ '$Header: /cvs/stx/stx/libbasic2/RunArray.st,v 1.27 2009-03-16 15:15:05 stefan Exp $' |
297 | 1320 |
! ! |