author | Stefan Vogel <sv@exept.de> |
Fri, 03 Apr 2020 22:46:09 +0200 | |
changeset 25354 | ee0e8cf9d49d |
parent 24609 | e3b956ca1565 |
permissions | -rw-r--r-- |
18267 | 1 |
"{ Encoding: utf8 }" |
2 |
||
1 | 3 |
" |
5 | 4 |
COPYRIGHT (c) 1989 by Claus Gittinger |
155 | 5 |
All Rights Reserved |
1 | 6 |
|
7 |
This software is furnished under a license and may be used |
|
8 |
only in accordance with the terms of that license and with the |
|
9 |
inclusion of the above copyright notice. This software may not |
|
10 |
be provided or otherwise made available to, or used by, any |
|
11 |
other person. No title to or ownership of the software is |
|
12 |
hereby transferred. |
|
13 |
" |
|
5347
21b418ac4cc3
oops: from:to:do: failed badly when stopIndex was < startIndex.
Claus Gittinger <cg@exept.de>
parents:
5049
diff
changeset
|
14 |
"{ Package: 'stx:libbasic' }" |
21b418ac4cc3
oops: from:to:do: failed badly when stopIndex was < startIndex.
Claus Gittinger <cg@exept.de>
parents:
5049
diff
changeset
|
15 |
|
17376 | 16 |
"{ NameSpace: Smalltalk }" |
17 |
||
1 | 18 |
ArrayedCollection variableSubclass:#Array |
1083
fadaedfa28f8
cosmetic change - no space after last element in displayString
Claus Gittinger <cg@exept.de>
parents:
951
diff
changeset
|
19 |
instanceVariableNames:'' |
fadaedfa28f8
cosmetic change - no space after last element in displayString
Claus Gittinger <cg@exept.de>
parents:
951
diff
changeset
|
20 |
classVariableNames:'' |
fadaedfa28f8
cosmetic change - no space after last element in displayString
Claus Gittinger <cg@exept.de>
parents:
951
diff
changeset
|
21 |
poolDictionaries:'' |
fadaedfa28f8
cosmetic change - no space after last element in displayString
Claus Gittinger <cg@exept.de>
parents:
951
diff
changeset
|
22 |
category:'Collections-Arrayed' |
1 | 23 |
! |
24 |
||
1903 | 25 |
!Array class methodsFor:'documentation'! |
77 | 26 |
|
554 | 27 |
copyright |
28 |
" |
|
29 |
COPYRIGHT (c) 1989 by Claus Gittinger |
|
30 |
All Rights Reserved |
|
31 |
||
32 |
This software is furnished under a license and may be used |
|
33 |
only in accordance with the terms of that license and with the |
|
34 |
inclusion of the above copyright notice. This software may not |
|
35 |
be provided or otherwise made available to, or used by, any |
|
36 |
other person. No title to or ownership of the software is |
|
37 |
hereby transferred. |
|
38 |
" |
|
39 |
! |
|
40 |
||
77 | 41 |
documentation |
42 |
" |
|
18246 | 43 |
Instances of Array store general objects; |
16386 | 44 |
an array's size is fixed, therefore add:/remove: are not allowed. |
14632 | 45 |
(actually, #add: is implemented for compatibility with smalltalks which |
16386 | 46 |
provide it, but it is very slow and outputs an annoying warning message...) |
1266 | 47 |
|
48 |
Access to the individual elements is via an integer index, |
|
49 |
using the well-known access messages #at: and #at:put:. |
|
399 | 50 |
|
1903 | 51 |
Since Arrays are used very often in the system (either directly or a data-container |
14632 | 52 |
of more complex collection classes), some methods have been tuned by reimplementing |
53 |
them as primitives. Also, the compiler inline-codes some operations |
|
1903 | 54 |
(especially: the above accessing messages). |
92 | 55 |
|
14632 | 56 |
Notice that Array is a built-in class |
57 |
(i.e. the VM knows about its representation). |
|
16386 | 58 |
Therefore it is NOT possible to add named instance variables or change Arrays inheritance. |
14632 | 59 |
However, subclassing is allowed of course |
1266 | 60 |
- even with added named instance variables. |
92 | 61 |
|
62 |
Literal arrays (i.e. array-constants) are entered in source as: |
|
1266 | 63 |
|
18246 | 64 |
#( element1 element2 ... element-N) |
1266 | 65 |
|
66 |
where each element must be itself a literal constant. |
|
67 |
Array, symbol and byteArray constants within an array can be written |
|
68 |
without the initial #-character. |
|
69 |
In addition, true, false and nil are also allowed as array-literal. |
|
399 | 70 |
|
92 | 71 |
Examples: |
1266 | 72 |
#(1 2 3) -> 3 elements: 1, 2 and 3 |
73 |
#('foo' 2 (1 2)) -> 3 elements: a String, 2 and anotherArray |
|
74 |
#('foo' #(1 2) #foo) -> 3 elements: a String, another array and a symbol |
|
75 |
#('foo' (1 2) foo) -> same as above |
|
76 |
#(nil true #true) -> 3 elements: nil, true and a symbol (watch out) |
|
77 |
#(two [3 3 3] (4 4 4)) -> 3 elements: a symbol, a byteArray and another array |
|
1276 | 78 |
|
16386 | 79 |
Also, a syntactic sugar piece allows for Array instances to be created dynamcially |
80 |
at runtime with the brace syntax: |
|
81 |
||
18246 | 82 |
{ expr1 . expr2 . ... . expr-N } |
16386 | 83 |
|
84 |
where each expr-i evaluates to an element of the new array instance. |
|
85 |
Notice that the expressions are separated by a period. |
|
86 |
Semantically, this is equivalent to ``Array with:expr1 with:expr2 ... with:expr-N'' |
|
87 |
Examples: |
|
18246 | 88 |
{ 1 . 2 . 3 } -> a new 3 element array; similar to #( 1 2 3 ), |
89 |
but in contrast, a new array instance is created |
|
90 |
{ |
|
91 |
{ 'foo' . [ Transcript showCR:'foo' ] } . |
|
92 |
{ 'bar' . [ Transcript showCR:'bar' ] } |
|
93 |
{ 'baz' . [ Transcript showCR:'baz' ] } |
|
94 |
} |
|
95 |
-> a new 3 element array, consisting of 3 new |
|
96 |
2-element array instances, consisting of a string |
|
97 |
and a block each |
|
16386 | 98 |
|
4062 | 99 |
[memory requirements:] |
18246 | 100 |
OBJ-HEADER + (size * ptr-size) |
4062 | 101 |
|
2145 | 102 |
[warning:] |
18246 | 103 |
read the warning about 'growing fixed size collection' |
104 |
in ArrayedCollection's documentation |
|
1276 | 105 |
|
1290 | 106 |
[author:] |
18246 | 107 |
Claus Gittinger |
1290 | 108 |
|
1276 | 109 |
[see also:] |
18246 | 110 |
OrderedCollection |
111 |
ByteArray FloatArray DoubleArray IntegerArray BitArray |
|
112 |
CharacterArray String |
|
77 | 113 |
" |
626 | 114 |
! ! |
3 | 115 |
|
1903 | 116 |
!Array class methodsFor:'instance creation'! |
249 | 117 |
|
118 |
basicNew:anInteger |
|
119 |
"return an instance of myself with anInteger indexed variables. |
|
120 |
Since Array-creation is so common (all other collections use them), |
|
121 |
it seems worth to have a specially tuned version here." |
|
122 |
||
123 |
%{ /* NOCONTEXT */ |
|
124 |
||
125 |
OBJ newobj; |
|
14687 | 126 |
unsigned INT nInstVars; |
127 |
unsigned INT instsize; |
|
249 | 128 |
INT nindexedinstvars; |
129 |
REGISTER OBJ *op; |
|
130 |
||
131 |
if (__isSmallInteger(anInteger)) { |
|
23277 | 132 |
nindexedinstvars = __intVal(anInteger); |
133 |
if (nindexedinstvars >= 0) { |
|
134 |
nInstVars = __intVal(__ClassInstPtr(self)->c_ninstvars); |
|
249 | 135 |
|
23277 | 136 |
nInstVars += nindexedinstvars; |
137 |
instsize = OHDR_SIZE + __OBJS2BYTES__(nInstVars); |
|
138 |
if (__CanDoQuickNew(instsize)) { /* OBJECT ALLOCATION */ |
|
139 |
/* |
|
140 |
* the most common case |
|
141 |
*/ |
|
142 |
__qCheckedNew(newobj, instsize); |
|
143 |
ok: ; |
|
144 |
__InstPtr(newobj)->o_class = self; |
|
145 |
__qSTORE(newobj, self); |
|
369 | 146 |
|
14623 | 147 |
#if (POINTER_SIZE == 4) && defined(memset4) && defined(FAST_ARRAY_MEMSET4) |
23277 | 148 |
memset4(__InstPtr(newobj)->i_instvars, nil, nInstVars); |
249 | 149 |
#else |
150 |
# if !defined(NEGATIVE_ADDRESSES) |
|
23277 | 151 |
/* |
152 |
* knowing that nil is 0 |
|
153 |
*/ |
|
14657 | 154 |
# ifdef __sparc__ |
155 |
# define FAST_ARRAY_MEMSET_DOUBLES_UNROLLED |
|
156 |
# endif |
|
2979 | 157 |
|
14657 | 158 |
# ifdef __VMS__ |
159 |
# define FAST_ARRAY_MEMSET_LONGLONG_UNROLLED |
|
160 |
# endif |
|
2979 | 161 |
|
249 | 162 |
# if defined(FAST_ARRAY_MEMSET_DOUBLES_UNROLLED) |
23277 | 163 |
op = __InstPtr(newobj)->i_instvars; |
164 |
if (nInstVars > 8) { |
|
165 |
*op++ = nil; /* for alignment */ |
|
166 |
nInstVars--; |
|
167 |
while (nInstVars >= 8) { |
|
168 |
*(double *)op = 0.0; |
|
169 |
((double *)op)[1] = 0.0; |
|
170 |
((double *)op)[2] = 0.0; |
|
171 |
((double *)op)[3] = 0.0; |
|
172 |
op += 8; |
|
173 |
nInstVars -= 8; |
|
174 |
} |
|
175 |
} |
|
176 |
while (nInstVars) { |
|
177 |
*op++ = 0; |
|
178 |
nInstVars--; |
|
179 |
} |
|
249 | 180 |
# else |
14623 | 181 |
# if (POINTER_SIZE == 4) && defined(FAST_ARRAY_MEMSET_LONGLONG_UNROLLED) |
2979 | 182 |
# ifdef INT64 |
183 |
# define LONGLONG INT64 |
|
184 |
# else |
|
185 |
# define LONGLONG long long |
|
14687 | 186 |
# endif |
2979 | 187 |
|
23277 | 188 |
op = __InstPtr(newobj)->i_instvars; |
189 |
if (nInstVars > 8) { |
|
190 |
*op++ = nil; /* for alignment */ |
|
191 |
nInstVars--; |
|
192 |
while (nInstVars >= 8) { |
|
193 |
*(LONGLONG *)op = 0; |
|
194 |
((LONGLONG *)op)[1] = 0; |
|
195 |
((LONGLONG *)op)[2] = 0; |
|
196 |
((LONGLONG *)op)[3] = 0; |
|
197 |
op += 8; |
|
198 |
nInstVars -= 8; |
|
199 |
} |
|
200 |
} |
|
201 |
while (nInstVars) { |
|
202 |
*op++ = 0; |
|
203 |
nInstVars--; |
|
204 |
} |
|
249 | 205 |
# else |
206 |
# if defined(FAST_ARRAY_MEMSET) |
|
23277 | 207 |
memset(__InstPtr(newobj)->i_instvars, 0, instsize - OHDR_SIZE); |
249 | 208 |
# else |
23277 | 209 |
op = __InstPtr(newobj)->i_instvars; |
14623 | 210 |
# if (POINTER_SIZE == 4) && defined(INT64) |
23277 | 211 |
while (nInstVars > 1) { |
212 |
*((INT64 *)op) = 0; |
|
213 |
nInstVars -= 2; |
|
214 |
op += 2; |
|
215 |
} |
|
2950 | 216 |
# endif |
23277 | 217 |
while (nInstVars >= 8) { |
218 |
nInstVars -= 8; |
|
219 |
op[0] = nil; op[1] = nil; |
|
220 |
op[2] = nil; op[3] = nil; |
|
221 |
op[4] = nil; op[5] = nil; |
|
222 |
op[6] = nil; op[7] = nil; |
|
223 |
op += 8; |
|
224 |
} |
|
225 |
while (nInstVars--) |
|
226 |
*op++ = nil; |
|
249 | 227 |
# endif |
228 |
# endif |
|
229 |
# endif |
|
230 |
# else |
|
23277 | 231 |
op = __InstPtr(newobj)->i_instvars; |
232 |
while (nInstVars--) |
|
233 |
*op++ = nil; |
|
249 | 234 |
# endif |
235 |
#endif |
|
23277 | 236 |
RETURN ( newobj ); |
237 |
} else { |
|
238 |
/* |
|
239 |
* a GC will happen ... |
|
240 |
* have to protect all context stuff |
|
241 |
* (especially for self, but also for backtrace in case of |
|
242 |
* allocation failure) |
|
243 |
*/ |
|
244 |
__PROTECT_CONTEXT__ |
|
245 |
newobj = __STX___new((INT)instsize); |
|
246 |
__UNPROTECT_CONTEXT__ |
|
247 |
if (newobj != nil) { |
|
248 |
goto ok; |
|
249 |
} |
|
250 |
} |
|
251 |
} |
|
249 | 252 |
} |
253 |
%}. |
|
254 |
" |
|
255 |
arrive here if something went wrong ... |
|
256 |
figure out what it was |
|
257 |
" |
|
258 |
(anInteger isMemberOf:SmallInteger) ifFalse:[ |
|
23277 | 259 |
" |
260 |
the argument is either not an integer, |
|
261 |
or a LargeInteger (which means that its definitely too big) |
|
262 |
" |
|
263 |
self argumentError:'argument to new: must be Integer' with:anInteger. |
|
264 |
^ nil |
|
249 | 265 |
]. |
266 |
(anInteger < 0) ifTrue:[ |
|
23277 | 267 |
" |
268 |
the argument is negative, |
|
269 |
" |
|
270 |
self argumentError:'bad (negative) argument to new:' with:anInteger. |
|
271 |
^ nil |
|
249 | 272 |
]. |
273 |
" |
|
274 |
memory allocation failed. |
|
275 |
When we arrive here, there was no memory, even after |
|
14632 | 276 |
a garbage collect. |
277 |
This means, that the VM wanted to get some more memory from the |
|
249 | 278 |
Operatingsystem, which was not kind enough to give it. |
279 |
Bad luck - you should increase the swap space on your machine. |
|
280 |
" |
|
20706
009b8269bd08
we have class based exceptions - use them
Claus Gittinger <cg@exept.de>
parents:
20543
diff
changeset
|
281 |
^ AllocationFailure raise. |
23277 | 282 |
|
283 |
"Modified: / 14-08-2018 / 10:54:35 / Claus Gittinger" |
|
549 | 284 |
! |
285 |
||
286 |
new:anInteger |
|
287 |
"return an instance of myself with anInteger indexed variables. |
|
1266 | 288 |
Redefined here to save a few cycles when executed. |
289 |
(Since this is often called, its worth giving it an extra ilc-slot. |
|
290 |
Future versions of stc will do this automatically.)" |
|
549 | 291 |
|
292 |
^ self basicNew:anInteger |
|
1266 | 293 |
|
294 |
"Modified: 23.4.1996 / 15:52:15 / cg" |
|
360 | 295 |
! ! |
296 |
||
1903 | 297 |
!Array class methodsFor:'queries'! |
345 | 298 |
|
543 | 299 |
isBuiltInClass |
1266 | 300 |
"return true if this class is known by the run-time-system. |
301 |
Here, true is returned for myself, false for subclasses." |
|
345 | 302 |
|
543 | 303 |
^ self == Array |
1243 | 304 |
|
1266 | 305 |
"Modified: 23.4.1996 / 15:55:06 / cg" |
249 | 306 |
! ! |
307 |
||
1 | 308 |
!Array methodsFor:'accessing'! |
309 |
||
554 | 310 |
at:index |
311 |
"return the indexed instance variable with index, anInteger. |
|
312 |
Reimplemented here to avoid the additional at:->basicAt: send |
|
14632 | 313 |
(which we can do here, since when arriving here, #at: is obviously not |
1730 | 314 |
redefined in a subclass). |
577 | 315 |
This method is the same as basicAt:." |
543 | 316 |
|
317 |
%{ /* NOCONTEXT */ |
|
18288 | 318 |
#ifdef __SCHTEAM__ |
319 |
if (index.isSmallInteger()) { |
|
320 |
return context._RETURN( self.basicAt(index.intValue() )); |
|
321 |
} |
|
322 |
#else |
|
14687 | 323 |
REGISTER INT indx; |
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
324 |
REGISTER OBJ slf; |
14687 | 325 |
REGISTER unsigned INT nIndex; |
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
326 |
REGISTER OBJ cls; |
554 | 327 |
|
328 |
if (__isSmallInteger(index)) { |
|
4474 | 329 |
indx = __intVal(index) - 1; |
330 |
slf = self; |
|
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
331 |
|
18654 | 332 |
cls = __qClass(slf); |
4474 | 333 |
nIndex = __BYTES2OBJS__(__qSize(slf) - OHDR_SIZE); |
18654 | 334 |
if (cls == Array) { |
335 |
fetch: |
|
336 |
if ((unsigned INT)indx < (unsigned INT)nIndex) { |
|
337 |
RETURN ( __InstPtr(slf)->i_instvars[indx] ); |
|
338 |
} |
|
339 |
goto badIndex; |
|
340 |
} |
|
341 |
if (indx >= 0) { |
|
4474 | 342 |
indx += __intVal(__ClassInstPtr(cls)->c_ninstvars); |
18654 | 343 |
goto fetch; |
4474 | 344 |
} |
554 | 345 |
} |
4385
dbe7d1e8c54c
oops - subclasses with instVars allowed for index-less-than-1-access
Claus Gittinger <cg@exept.de>
parents:
4309
diff
changeset
|
346 |
badIndex: ; |
18288 | 347 |
#endif /* not SCHTEAM */ |
554 | 348 |
%}. |
4474 | 349 |
"/ ^ super at:index |
350 |
^ super basicAt:index "/ knowing that super-#at: does #basicAt: |
|
543 | 351 |
! |
352 |
||
554 | 353 |
at:index put:anObject |
354 |
"store the 2nd arg, anObject as indexed instvar with index, anInteger. |
|
1219 | 355 |
Returns anObject (sigh). |
554 | 356 |
Reimplemented here to avoid the additional at:put:->basicAt:put: send |
1730 | 357 |
(which we can do here, since when arriving here, #atput:: is obviously not |
358 |
redefined in a subclass). |
|
577 | 359 |
This method is the same as basicAt:put:." |
549 | 360 |
|
361 |
%{ /* NOCONTEXT */ |
|
18288 | 362 |
#ifdef __SCHTEAM__ |
363 |
if (index.isSmallInteger()) { |
|
364 |
self.basicAt_put(index.intValue(), anObject); |
|
365 |
return context._RETURN( anObject ); |
|
366 |
} |
|
367 |
#else |
|
549 | 368 |
|
14687 | 369 |
REGISTER INT indx; |
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
370 |
REGISTER OBJ slf; |
14687 | 371 |
REGISTER unsigned INT nIndex; |
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
372 |
REGISTER OBJ cls; |
554 | 373 |
|
374 |
if (__isSmallInteger(index)) { |
|
4474 | 375 |
indx = __intVal(index) - 1; |
376 |
slf = self; |
|
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
377 |
|
18654 | 378 |
cls = __qClass(slf); |
4474 | 379 |
nIndex = __BYTES2OBJS__(__qSize(slf) - OHDR_SIZE); |
18654 | 380 |
if (cls == Array) { |
381 |
store: |
|
382 |
if ((unsigned INT)indx < (unsigned INT)nIndex) { |
|
383 |
__InstPtr(slf)->i_instvars[indx] = anObject; |
|
384 |
__STORE(slf, anObject); |
|
385 |
RETURN ( anObject ); |
|
386 |
} |
|
387 |
goto badIndex; |
|
4474 | 388 |
} |
18654 | 389 |
if (indx >= 0) { |
390 |
indx += __intVal(__ClassInstPtr(cls)->c_ninstvars); |
|
391 |
goto store; |
|
4474 | 392 |
} |
554 | 393 |
} |
4385
dbe7d1e8c54c
oops - subclasses with instVars allowed for index-less-than-1-access
Claus Gittinger <cg@exept.de>
parents:
4309
diff
changeset
|
394 |
badIndex: ; |
18289 | 395 |
#endif /* not SCHTEAM */ |
554 | 396 |
%}. |
4474 | 397 |
"/ ^ super at:index put:anObject |
398 |
^ super basicAt:index put:anObject "/ knowing that super-#at:put: does #basicAt:put: |
|
1219 | 399 |
|
400 |
"Modified: 19.4.1996 / 11:16:42 / cg" |
|
549 | 401 |
! |
402 |
||
403 |
basicAt:index |
|
404 |
"return the indexed instance variable with index, anInteger |
|
405 |
- added here for speed" |
|
406 |
||
407 |
%{ /* NOCONTEXT */ |
|
18288 | 408 |
#ifdef __SCHTEAM__ |
409 |
if (index.isSmallInteger()) { |
|
410 |
return context._RETURN( self.basicAt(index.intValue() )); |
|
411 |
} |
|
412 |
#else |
|
549 | 413 |
|
14687 | 414 |
REGISTER INT indx; |
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
415 |
REGISTER OBJ slf; |
14687 | 416 |
REGISTER unsigned INT nIndex; |
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
417 |
REGISTER OBJ cls; |
549 | 418 |
|
419 |
if (__isSmallInteger(index)) { |
|
4474 | 420 |
indx = __intVal(index) - 1; |
421 |
slf = self; |
|
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
422 |
|
4474 | 423 |
nIndex = __BYTES2OBJS__(__qSize(slf) - OHDR_SIZE); |
424 |
if ((cls = __qClass(slf)) != Array) { |
|
425 |
if (indx < 0) goto badIndex; |
|
426 |
indx += __intVal(__ClassInstPtr(cls)->c_ninstvars); |
|
427 |
} |
|
14687 | 428 |
if ((unsigned INT)indx < (unsigned INT)nIndex) { |
4474 | 429 |
RETURN ( __InstPtr(slf)->i_instvars[indx] ); |
430 |
} |
|
549 | 431 |
} |
4385
dbe7d1e8c54c
oops - subclasses with instVars allowed for index-less-than-1-access
Claus Gittinger <cg@exept.de>
parents:
4309
diff
changeset
|
432 |
badIndex: ; |
18288 | 433 |
#endif /* not SCHTEAM */ |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
434 |
%}. |
549 | 435 |
^ super basicAt:index |
436 |
! |
|
437 |
||
77 | 438 |
basicAt:index put:anObject |
1 | 439 |
"store the 2nd arg, anObject as indexed instvar with index, anInteger. |
1219 | 440 |
Returns anObject (sigh). |
1 | 441 |
- added here for speed" |
442 |
||
443 |
%{ /* NOCONTEXT */ |
|
18288 | 444 |
#ifdef __SCHTEAM__ |
445 |
if (index.isSmallInteger()) { |
|
446 |
self.basicAt_put(index.intValue(), anObject); |
|
447 |
return context._RETURN( anObject ); |
|
448 |
} |
|
449 |
#else |
|
14687 | 450 |
REGISTER INT indx; |
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
451 |
REGISTER OBJ slf; |
14687 | 452 |
REGISTER unsigned INT nIndex; |
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
453 |
REGISTER OBJ cls; |
1 | 454 |
|
249 | 455 |
if (__isSmallInteger(index)) { |
4474 | 456 |
indx = __intVal(index) - 1; |
457 |
slf = self; |
|
1143
27325100bdf4
can check index against low..hi with a single compare&branch
Claus Gittinger <cg@exept.de>
parents:
1133
diff
changeset
|
458 |
|
4474 | 459 |
nIndex = __BYTES2OBJS__(__qSize(slf) - OHDR_SIZE); |
460 |
if ((cls = __qClass(slf)) != Array) { |
|
461 |
if (indx < 0) goto badIndex; |
|
462 |
indx += __intVal(__ClassInstPtr(cls)->c_ninstvars); |
|
463 |
} |
|
14687 | 464 |
if ((unsigned INT)indx < (unsigned INT)nIndex) { |
4474 | 465 |
__InstPtr(slf)->i_instvars[indx] = anObject; |
466 |
__STORE(slf, anObject); |
|
467 |
RETURN ( anObject ); |
|
468 |
} |
|
1 | 469 |
} |
4385
dbe7d1e8c54c
oops - subclasses with instVars allowed for index-less-than-1-access
Claus Gittinger <cg@exept.de>
parents:
4309
diff
changeset
|
470 |
badIndex: ; |
18288 | 471 |
#endif /* not SCHTEAM */ |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
472 |
%}. |
77 | 473 |
^ super basicAt:index put:anObject |
1219 | 474 |
|
475 |
"Modified: 19.4.1996 / 11:14:26 / cg" |
|
1 | 476 |
! ! |
477 |
||
11 | 478 |
!Array methodsFor:'converting'! |
479 |
||
480 |
asArray |
|
15061 | 481 |
"return the receiver as an array - that's the receiver itself. |
482 |
Notice: Use asNewArray, if you intent to modify the returned collection." |
|
11 | 483 |
|
484 |
"could be an instance of a subclass..." |
|
485 |
self class == Array ifTrue:[ |
|
18246 | 486 |
^ self |
11 | 487 |
]. |
488 |
^ super asArray |
|
1243 | 489 |
|
490 |
"Modified: 22.4.1996 / 12:42:09 / cg" |
|
12452 | 491 |
! |
492 |
||
493 |
asImmutableArray |
|
494 |
"return a write-protected copy of myself" |
|
495 |
||
14158 | 496 |
"/ self assert:(ImmutableArray notNil). |
497 |
^ self copy beImmutable |
|
498 |
||
499 |
"Modified: / 07-06-2012 / 11:06:48 / cg" |
|
500 |
! |
|
501 |
||
23926 | 502 |
asImmutableCollection |
503 |
"return a write-protected copy of myself" |
|
504 |
||
505 |
^ self copy beImmutable |
|
506 |
||
507 |
"Created: / 15-03-2019 / 13:47:09 / Stefan Vogel" |
|
508 |
! |
|
509 |
||
14995 | 510 |
asNewArray |
21793 | 511 |
"return the receiver as a unique new array." |
14995 | 512 |
|
513 |
"could be an instance of a subclass..." |
|
514 |
self class == Array ifTrue:[ |
|
21793 | 515 |
^ self copy |
14995 | 516 |
]. |
517 |
^ super asArray |
|
21793 | 518 |
|
519 |
"Modified (comment): / 12-06-2017 / 13:40:27 / mawalch" |
|
14995 | 520 |
! |
521 |
||
14158 | 522 |
beImmutable |
523 |
"make myself write-protected" |
|
524 |
||
20518 | 525 |
super beImmutable. |
14158 | 526 |
self changeClassTo:ImmutableArray |
527 |
||
528 |
"Created: / 07-06-2012 / 11:06:33 / cg" |
|
11 | 529 |
! ! |
530 |
||
1 | 531 |
!Array methodsFor:'copying'! |
532 |
||
15848 | 533 |
, aCollection |
534 |
%{ |
|
21623 | 535 |
if (__isArrayLike(aCollection)) { |
536 |
if (__isArrayLike(self)) { |
|
18246 | 537 |
OBJ newArray; |
538 |
int mySize = __arraySize(self); |
|
539 |
int otherSize = __arraySize(aCollection); |
|
540 |
REGISTER OBJ src; |
|
541 |
int srcIdx, dstIdx; |
|
542 |
newArray = __ARRAY_NEW_INT(mySize+otherSize); |
|
15848 | 543 |
|
18246 | 544 |
src = self; |
545 |
for (dstIdx=0; dstIdx<mySize; dstIdx++) { |
|
546 |
OBJ el = __ArrayInstPtr(src)->a_element[dstIdx]; |
|
15848 | 547 |
|
18246 | 548 |
__ArrayInstPtr(newArray)->a_element[dstIdx] = el; |
549 |
__STORE(newArray, el); |
|
550 |
} |
|
15848 | 551 |
|
18246 | 552 |
src = aCollection; |
553 |
for (srcIdx=0; srcIdx<otherSize; srcIdx++, dstIdx++) { |
|
554 |
OBJ el = __ArrayInstPtr(src)->a_element[srcIdx]; |
|
15848 | 555 |
|
18246 | 556 |
__ArrayInstPtr(newArray)->a_element[dstIdx] = el; |
557 |
__STORE(newArray, el); |
|
558 |
} |
|
559 |
RETURN (newArray); |
|
560 |
} |
|
15848 | 561 |
} |
562 |
%}. |
|
563 |
^ super , aCollection |
|
564 |
! |
|
565 |
||
1 | 566 |
copyWith:something |
19750 | 567 |
"return a new collection containing the receiver's elements |
14632 | 568 |
and the single new element, newElement. |
220 | 569 |
This is different from concatentation, which expects another collection |
570 |
as argument, but equivalent to copy-and-addLast. |
|
370 | 571 |
Reimplemented for speed if receiver is an Array. |
572 |
(since the inherited copyWith uses replaceFromTo:, which is also |
|
573 |
tuned, it is questionable, if we need this)" |
|
574 |
||
575 |
%{ /* NOCONTEXT */ |
|
4122 | 576 |
OBJ nObj; |
14687 | 577 |
unsigned INT sz; |
578 |
unsigned INT nIndex; |
|
11 | 579 |
REGISTER OBJ *srcP, *dstP; |
293 | 580 |
REGISTER int spc; |
1 | 581 |
|
328 | 582 |
if (__qClass(self) == Array) { |
20308 | 583 |
sz = __qSize(self) + sizeof(OBJ); |
584 |
__PROTECT2__(something, self); |
|
585 |
__qNew(nObj, sz); /* OBJECT ALLOCATION */ |
|
586 |
__UNPROTECT2__(self, something); |
|
92 | 587 |
|
20308 | 588 |
if (nObj) { |
589 |
__InstPtr(nObj)->o_class = Array; |
|
590 |
__qSTORE(nObj, Array); |
|
1 | 591 |
|
20308 | 592 |
nIndex = __BYTES2OBJS__(sz - OHDR_SIZE - sizeof(OBJ)); |
593 |
/* |
|
594 |
* sorry: |
|
595 |
* cannot use bcopy, since we must take care of stores ... |
|
596 |
* could check for: notRemembered + inOld + notLifoRem |
|
597 |
* + not incrGCRunning |
|
598 |
* but: copyWith is not heavily used by real programmers ... |
|
599 |
*/ |
|
600 |
spc = __qSpace(nObj); |
|
601 |
srcP = __arrayVal(self); |
|
602 |
dstP = __arrayVal(nObj); |
|
1903 | 603 |
|
8919 | 604 |
#ifdef __UNROLL_LOOPS__ |
20308 | 605 |
while (nIndex >= 4) { |
606 |
OBJ element; |
|
4122 | 607 |
|
20308 | 608 |
element = srcP[0]; |
609 |
dstP[0] = element; |
|
610 |
__STORE_SPC(nObj, element, spc); |
|
611 |
element = srcP[1]; |
|
612 |
dstP[1] = element; |
|
613 |
__STORE_SPC(nObj, element, spc); |
|
614 |
element = srcP[2]; |
|
615 |
dstP[2] = element; |
|
616 |
__STORE_SPC(nObj, element, spc); |
|
617 |
element = srcP[3]; |
|
618 |
dstP[3] = element; |
|
619 |
__STORE_SPC(nObj, element, spc); |
|
620 |
srcP += 4; |
|
621 |
dstP += 4; |
|
622 |
nIndex -= 4; |
|
623 |
} |
|
393 | 624 |
#endif |
20308 | 625 |
while (nIndex--) { |
626 |
OBJ element; |
|
4122 | 627 |
|
20308 | 628 |
element = *srcP++; |
629 |
*dstP++ = element; |
|
630 |
__STORE_SPC(nObj, element, spc); |
|
631 |
} |
|
632 |
*dstP = something; |
|
633 |
__STORE_SPC(nObj, something, spc); |
|
634 |
RETURN ( nObj ); |
|
635 |
} |
|
1 | 636 |
} |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
637 |
%}. |
1 | 638 |
^ super copyWith:something |
639 |
! ! |
|
640 |
||
216 | 641 |
!Array methodsFor:'enumerating'! |
1 | 642 |
|
10796
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
643 |
addAllNonNilElementsTo:aCollection |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
644 |
"add all nonNil elements of the receiver to aCollection. |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
645 |
Return aCollection. |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
646 |
Redefined here for slightly more speed." |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
647 |
|
20172 | 648 |
|each stop "{ Class: SmallInteger }"| |
10796
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
649 |
|
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
650 |
stop := self size. |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
651 |
1 to:stop do:[:idx | |
20308 | 652 |
each := self at:idx. |
653 |
each notNil ifTrue:[ |
|
654 |
aCollection add:each. |
|
655 |
]. |
|
10796
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
656 |
]. |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
657 |
^ aCollection |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
658 |
|
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
659 |
" |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
660 |
#(1 2 3 4 5 1 2 3 symbol 'string' nil) addAllNonNilElementsTo:Set new |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
661 |
" |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
662 |
! |
08a9ee8cf317
Do not add nil elements to a Set in #asSet and #asIdentitySet
Stefan Vogel <sv@exept.de>
parents:
10089
diff
changeset
|
663 |
|
554 | 664 |
addAllTo:aCollection |
665 |
"add all elements of the receiver to aCollection. |
|
8603 | 666 |
Return aCollection. |
667 |
Redefined here for slightly more speed." |
|
554 | 668 |
|
669 |
|stop "{ Class: SmallInteger }"| |
|
670 |
||
671 |
stop := self size. |
|
672 |
1 to:stop do:[:idx | |
|
14632 | 673 |
aCollection add:(self at:idx) |
554 | 674 |
]. |
675 |
^ aCollection |
|
676 |
! |
|
677 |
||
678 |
do:aBlock |
|
679 |
"evaluate the argument, aBlock for each element in the collection. |
|
4122 | 680 |
- reimplemented for speed, since this is used by many higher |
681 |
level collections" |
|
554 | 682 |
|
2202 | 683 |
| sz "{ Class: SmallInteger }"| |
945
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
684 |
|
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
685 |
sz := self size. |
554 | 686 |
%{ |
687 |
REGISTER OBJFUNC codeVal; |
|
14687 | 688 |
REGISTER INT index; |
689 |
unsigned INT nIndex; |
|
554 | 690 |
static struct inlineCache val = _ILC1; |
691 |
REGISTER OBJ rHome; |
|
14687 | 692 |
INT actualSize; |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
693 |
|
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
694 |
{ |
24609 | 695 |
OBJ mySelf = self; |
696 |
||
697 |
index = __intVal(__ClassInstPtr(__qClass(mySelf))->c_ninstvars); |
|
698 |
actualSize = __BYTES2OBJS__(__qSize(mySelf) - OHDR_SIZE); |
|
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
699 |
} |
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
700 |
|
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
701 |
nIndex = index + __intVal(sz); |
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
702 |
if (nIndex <= actualSize) { |
945
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
703 |
|
24609 | 704 |
if (__isBlockLike(aBlock) |
705 |
&& (__BlockInstPtr(aBlock)->b_nargs == __mkSmallInteger(1))) { |
|
706 |
{ |
|
707 |
/* |
|
708 |
* the most common case: a static compiled block, with home on the stack ... |
|
709 |
*/ |
|
710 |
REGISTER OBJFUNC codeVal; |
|
711 |
||
712 |
if (((codeVal = __BlockInstPtr(aBlock)->b_code) != (OBJFUNC)nil) |
|
2678 | 713 |
#ifdef PARANOIA |
24609 | 714 |
&& (! ((INT)(__BlockInstPtr(aBlock)->b_flags) & __MASKSMALLINT(F_DYNAMIC))) |
2678 | 715 |
#endif |
24609 | 716 |
) { |
2254 | 717 |
|
554 | 718 |
#ifdef NEW_BLOCK_CALL |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
719 |
# define BLOCK_ARG aBlock |
554 | 720 |
#else |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
721 |
# define BLOCK_ARG rHome |
24609 | 722 |
REGISTER OBJ rHome; |
723 |
||
724 |
rHome = __BlockInstPtr(aBlock)->b_home; |
|
725 |
if ((rHome == nil) || (__qSpace(rHome) >= STACKSPACE)) |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
726 |
#endif |
24609 | 727 |
{ |
728 |
||
729 |
/* |
|
730 |
* boy; what an ugly looking piece of code ... |
|
731 |
* however, this software pipelined thing has no taken conditional |
|
732 |
* branches in the normal case and is almost twice as fast to even |
|
733 |
* what an unrolling optimizing compiler produces from the loop below ... |
|
734 |
* notice, that those gotos expand to forward branches (which are predicted |
|
735 |
* as NOT taken by most machines ... which is exactly what we want) |
|
736 |
*/ |
|
737 |
REGISTER OBJ el; |
|
8919 | 738 |
#ifdef __UNROLL_LOOPS__ |
2715
48beff18cec0
software pipeline element access in enumeration method
Claus Gittinger <cg@exept.de>
parents:
2683
diff
changeset
|
739 |
|
24609 | 740 |
{ |
741 |
int i8; |
|
742 |
||
743 |
while ((i8 = index+8) < nIndex) { |
|
744 |
el = __InstPtr(self)->i_instvars[index]; |
|
745 |
if (InterruptPending != nil) goto interrupt0; |
|
746 |
continue0: |
|
747 |
(*codeVal)(BLOCK_ARG, el); |
|
748 |
el = __InstPtr(self)->i_instvars[index+1]; |
|
749 |
if (InterruptPending != nil) goto interrupt1; |
|
750 |
continue1: |
|
751 |
(*codeVal)(BLOCK_ARG, el); |
|
752 |
el = __InstPtr(self)->i_instvars[index+2]; |
|
753 |
if (InterruptPending != nil) goto interrupt2; |
|
754 |
continue2: |
|
755 |
(*codeVal)(BLOCK_ARG, el); |
|
756 |
el = __InstPtr(self)->i_instvars[index+3]; |
|
757 |
if (InterruptPending != nil) goto interrupt3; |
|
758 |
continue3: |
|
759 |
(*codeVal)(BLOCK_ARG, el); |
|
760 |
el = __InstPtr(self)->i_instvars[index+4]; |
|
761 |
if (InterruptPending != nil) goto interrupt4; |
|
762 |
continue4: |
|
763 |
(*codeVal)(BLOCK_ARG, el); |
|
764 |
el = __InstPtr(self)->i_instvars[index+5]; |
|
765 |
if (InterruptPending != nil) goto interrupt5; |
|
766 |
continue5: |
|
767 |
(*codeVal)(BLOCK_ARG, el); |
|
768 |
el = __InstPtr(self)->i_instvars[index+6]; |
|
769 |
if (InterruptPending != nil) goto interrupt6; |
|
770 |
continue6: |
|
771 |
(*codeVal)(BLOCK_ARG, el); |
|
772 |
el = __InstPtr(self)->i_instvars[index+7]; |
|
773 |
if (InterruptPending != nil) goto interrupt7; |
|
774 |
continue7: |
|
775 |
(*codeVal)(BLOCK_ARG, el); |
|
776 |
index = i8; |
|
777 |
} |
|
778 |
} |
|
8919 | 779 |
#endif /* __UNROLL_LOOPS__ */ |
2216 | 780 |
|
24609 | 781 |
for (; index < nIndex; index++) { |
782 |
el = __InstPtr(self)->i_instvars[index]; |
|
783 |
if (InterruptPending != nil) goto interruptX; |
|
784 |
continueX: |
|
785 |
(*codeVal)(BLOCK_ARG, el); |
|
786 |
} |
|
787 |
RETURN (self); |
|
2216 | 788 |
|
8919 | 789 |
#ifdef __UNROLL_LOOPS__ |
24609 | 790 |
interrupt0: |
791 |
__interruptL(@line); |
|
792 |
el = __InstPtr(self)->i_instvars[index]; |
|
793 |
goto continue0; |
|
794 |
interrupt1: |
|
795 |
__interruptL(@line); |
|
796 |
el = __InstPtr(self)->i_instvars[index+1]; |
|
797 |
goto continue1; |
|
798 |
interrupt2: |
|
799 |
__interruptL(@line); |
|
800 |
el = __InstPtr(self)->i_instvars[index+2]; |
|
801 |
goto continue2; |
|
802 |
interrupt3: |
|
803 |
__interruptL(@line); |
|
804 |
el = __InstPtr(self)->i_instvars[index+3]; |
|
805 |
goto continue3; |
|
806 |
interrupt4: |
|
807 |
__interruptL(@line); |
|
808 |
el = __InstPtr(self)->i_instvars[index+4]; |
|
809 |
goto continue4; |
|
810 |
interrupt5: |
|
811 |
__interruptL(@line); |
|
812 |
el = __InstPtr(self)->i_instvars[index+5]; |
|
813 |
goto continue5; |
|
814 |
interrupt6: |
|
815 |
__interruptL(@line); |
|
816 |
el = __InstPtr(self)->i_instvars[index+6]; |
|
817 |
goto continue6; |
|
818 |
interrupt7: |
|
819 |
__interruptL(@line); |
|
820 |
el = __InstPtr(self)->i_instvars[index+7]; |
|
821 |
goto continue7; |
|
8919 | 822 |
#endif /* __UNROLL_LOOPS__ */ |
24609 | 823 |
interruptX: |
824 |
__interruptL(@line); |
|
825 |
el = __InstPtr(self)->i_instvars[index]; |
|
826 |
goto continueX; |
|
827 |
} |
|
828 |
} |
|
829 |
} |
|
830 |
||
831 |
/* |
|
832 |
* sorry, must check code-pointer in the loop |
|
833 |
* it could be recompiled or flushed |
|
834 |
*/ |
|
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
835 |
# undef BLOCK_ARG |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
836 |
#ifdef NEW_BLOCK_CALL |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
837 |
# define BLOCK_ARG aBlock |
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
838 |
# define IBLOCK_ARG nil |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
839 |
#else |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
840 |
# define BLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
841 |
# define IBLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
842 |
#endif |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
843 |
|
24609 | 844 |
for (; index < nIndex; index++) { |
845 |
REGISTER OBJFUNC codeVal; |
|
846 |
||
847 |
if (InterruptPending != nil) __interruptL(@line); |
|
848 |
||
849 |
if ((codeVal = __BlockInstPtr(aBlock)->b_code) != (OBJFUNC)nil) { |
|
850 |
(*codeVal)(BLOCK_ARG, __InstPtr(self)->i_instvars[index]); |
|
851 |
} else { |
|
852 |
if (__BlockInstPtr(aBlock)->b_bytecodes != nil) { |
|
853 |
/* |
|
854 |
* arg is a compiled block with bytecode - |
|
855 |
* directly call interpreter without going through Block>>value |
|
856 |
*/ |
|
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
857 |
#ifdef PASS_ARG_POINTER |
24609 | 858 |
__interpret(aBlock, 1, nil, IBLOCK_ARG, nil, nil, &(__InstPtr(self)->i_instvars[index])); |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
859 |
#else |
24609 | 860 |
__interpret(aBlock, 1, nil, IBLOCK_ARG, nil, nil, __InstPtr(self)->i_instvars[index]); |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
861 |
#endif |
24609 | 862 |
} else { |
863 |
(*val.ilc_func)(aBlock, |
|
864 |
@symbol(value:), |
|
865 |
nil, &val, |
|
866 |
__InstPtr(self)->i_instvars[index]); |
|
867 |
} |
|
868 |
} |
|
869 |
} |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
870 |
|
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
871 |
# undef BLOCK_ARG |
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
872 |
# undef IBLOCK_ARG |
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
873 |
|
24609 | 874 |
RETURN (self ); |
875 |
} |
|
876 |
||
877 |
/* |
|
878 |
* not a block - send it #value: |
|
879 |
*/ |
|
880 |
for (; index < nIndex; index++) { |
|
881 |
if (InterruptPending != nil) __interruptL(@line); |
|
882 |
// console_printf("el%d -> %"_lx_"\n", index, (long)(__InstPtr(self)->i_instvars[index])); |
|
883 |
(*val.ilc_func)(aBlock, |
|
884 |
@symbol(value:), |
|
885 |
nil, &val, |
|
886 |
__InstPtr(self)->i_instvars[index]); |
|
887 |
} |
|
888 |
RETURN ( self ); |
|
554 | 889 |
} |
14632 | 890 |
/* |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
891 |
* I am something, not handled here |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
892 |
*/ |
945
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
893 |
%}. |
24609 | 894 |
super do:aBlock |
554 | 895 |
! |
896 |
||
1 | 897 |
from:start to:stop do:aBlock |
898 |
"evaluate the argument, aBlock for the elements starting at index start |
|
899 |
up to (and including) stop in the collection. |
|
4122 | 900 |
- reimplemented for speed, since this is used by many higher |
901 |
level collections" |
|
1 | 902 |
|
903 |
%{ |
|
904 |
REGISTER OBJFUNC codeVal; |
|
14687 | 905 |
REGISTER INT index; |
2 | 906 |
REGISTER OBJ rHome; |
2052 | 907 |
OBJ slf; |
14687 | 908 |
INT nIndex, nInsts; |
1 | 909 |
static struct inlineCache val = _ILC1; |
14687 | 910 |
INT indexHigh; |
2184
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
911 |
OBJ myClass; |
1 | 912 |
|
2184
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
913 |
slf = self; |
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
914 |
myClass = __qClass(slf); |
5347
21b418ac4cc3
oops: from:to:do: failed badly when stopIndex was < startIndex.
Claus Gittinger <cg@exept.de>
parents:
5049
diff
changeset
|
915 |
|
21b418ac4cc3
oops: from:to:do: failed badly when stopIndex was < startIndex.
Claus Gittinger <cg@exept.de>
parents:
5049
diff
changeset
|
916 |
if ( __bothSmallInteger(start, stop) |
21b418ac4cc3
oops: from:to:do: failed badly when stopIndex was < startIndex.
Claus Gittinger <cg@exept.de>
parents:
5049
diff
changeset
|
917 |
&& ((index = __intVal(start)) > 0) ) { |
24609 | 918 |
indexHigh = __intVal(stop); |
919 |
nIndex = __BYTES2OBJS__(__qSize(slf) - OHDR_SIZE); |
|
920 |
if (myClass != @global(Array)) { |
|
921 |
nInsts = __intVal(__ClassInstPtr(myClass)->c_ninstvars); |
|
922 |
index += nInsts; |
|
923 |
indexHigh += nInsts; |
|
924 |
} |
|
925 |
if (indexHigh <= nIndex) { |
|
926 |
OBJ __aBlock = aBlock; |
|
927 |
INT n; |
|
928 |
||
929 |
index--; /* 0-based */ |
|
930 |
n = indexHigh - index; |
|
931 |
||
932 |
if (__isBlockLike(__aBlock) |
|
933 |
&& (__BlockInstPtr(__aBlock)->b_nargs == __mkSmallInteger(1))) { |
|
934 |
{ |
|
935 |
/* |
|
936 |
* the most common case: a static compiled block, with home on the stack ... |
|
937 |
*/ |
|
938 |
REGISTER OBJFUNC codeVal; |
|
939 |
||
940 |
if (((codeVal = __BlockInstPtr(__aBlock)->b_code) != (OBJFUNC)nil) |
|
2678 | 941 |
#ifdef PARANOIA |
24609 | 942 |
&& (! ((INT)(__BlockInstPtr(__aBlock)->b_flags) & __MASKSMALLINT(F_DYNAMIC))) |
2678 | 943 |
#endif |
24609 | 944 |
) { |
11 | 945 |
#ifdef NEW_BLOCK_CALL |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
946 |
# define BLOCK_ARG aBlock |
11 | 947 |
#else |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
948 |
# define BLOCK_ARG rHome |
24609 | 949 |
REGISTER OBJ rHome; |
950 |
||
951 |
rHome = __BlockInstPtr(__aBlock)->b_home; |
|
952 |
if ((rHome == nil) || (__qSpace(rHome) >= STACKSPACE)) |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
953 |
#endif |
24609 | 954 |
{ |
955 |
REGISTER OBJ el; |
|
2715
48beff18cec0
software pipeline element access in enumeration method
Claus Gittinger <cg@exept.de>
parents:
2683
diff
changeset
|
956 |
|
8919 | 957 |
#ifdef __UNROLL_LOOPS__ |
24609 | 958 |
/* |
959 |
* boy; what an ugly looking piece of code ... |
|
960 |
* however, this software pipelined thing has no taken conditional |
|
961 |
* branches in the normal case and is almost twice as fast to even |
|
962 |
* what an unrolling optimizing compiler produces from the loop below ... |
|
963 |
* notice, that those gotos expand to forward branches (which are predicted |
|
964 |
* as NOT taken by most machines ... which is exactly what we want) |
|
965 |
*/ |
|
966 |
{ |
|
967 |
while ( n >= 8) { |
|
968 |
el = __InstPtr(self)->i_instvars[index]; |
|
969 |
if (InterruptPending != nil) goto interrupt0; |
|
970 |
continue0: |
|
971 |
(*codeVal)(BLOCK_ARG, el); |
|
972 |
el = __InstPtr(self)->i_instvars[index+1]; |
|
973 |
if (InterruptPending != nil) goto interrupt1; |
|
974 |
continue1: |
|
975 |
(*codeVal)(BLOCK_ARG, el); |
|
976 |
el = __InstPtr(self)->i_instvars[index+2]; |
|
977 |
if (InterruptPending != nil) goto interrupt2; |
|
978 |
continue2: |
|
979 |
(*codeVal)(BLOCK_ARG, el); |
|
980 |
el = __InstPtr(self)->i_instvars[index+3]; |
|
981 |
if (InterruptPending != nil) goto interrupt3; |
|
982 |
continue3: |
|
983 |
(*codeVal)(BLOCK_ARG, el); |
|
984 |
el = __InstPtr(self)->i_instvars[index+4]; |
|
985 |
if (InterruptPending != nil) goto interrupt4; |
|
986 |
continue4: |
|
987 |
(*codeVal)(BLOCK_ARG, el); |
|
988 |
el = __InstPtr(self)->i_instvars[index+5]; |
|
989 |
if (InterruptPending != nil) goto interrupt5; |
|
990 |
continue5: |
|
991 |
(*codeVal)(BLOCK_ARG, el); |
|
992 |
el = __InstPtr(self)->i_instvars[index+6]; |
|
993 |
if (InterruptPending != nil) goto interrupt6; |
|
994 |
continue6: |
|
995 |
(*codeVal)(BLOCK_ARG, el); |
|
996 |
el = __InstPtr(self)->i_instvars[index+7]; |
|
997 |
if (InterruptPending != nil) goto interrupt7; |
|
998 |
continue7: |
|
999 |
(*codeVal)(BLOCK_ARG, el); |
|
1000 |
n -= 8; |
|
1001 |
index += 8; |
|
1002 |
} |
|
8919 | 1003 |
# ifdef __UNROLL_LOOPS2__ /* this makes small loops slower */ |
24609 | 1004 |
if (n >= 4) { |
1005 |
el = __InstPtr(self)->i_instvars[index]; |
|
1006 |
if (InterruptPending != nil) goto interrupt0b; |
|
1007 |
continue0b: |
|
1008 |
(*codeVal)(BLOCK_ARG, el); |
|
1009 |
el = __InstPtr(self)->i_instvars[index+1]; |
|
1010 |
if (InterruptPending != nil) goto interrupt1b; |
|
1011 |
continue1b: |
|
1012 |
(*codeVal)(BLOCK_ARG, el); |
|
1013 |
el = __InstPtr(self)->i_instvars[index+2]; |
|
1014 |
if (InterruptPending != nil) goto interrupt2b; |
|
1015 |
continue2b: |
|
1016 |
(*codeVal)(BLOCK_ARG, el); |
|
1017 |
el = __InstPtr(self)->i_instvars[index+3]; |
|
1018 |
if (InterruptPending != nil) goto interrupt3b; |
|
1019 |
continue3b: |
|
1020 |
(*codeVal)(BLOCK_ARG, el); |
|
1021 |
n -= 4; |
|
1022 |
index += 4; |
|
1023 |
} |
|
1024 |
if (n >= 2) { |
|
1025 |
el = __InstPtr(self)->i_instvars[index]; |
|
1026 |
if (InterruptPending != nil) goto interrupt0c; |
|
1027 |
continue0c: |
|
1028 |
(*codeVal)(BLOCK_ARG, el); |
|
1029 |
el = __InstPtr(self)->i_instvars[index+1]; |
|
1030 |
if (InterruptPending != nil) goto interrupt1c; |
|
1031 |
continue1c: |
|
1032 |
(*codeVal)(BLOCK_ARG, el); |
|
1033 |
n -= 2; |
|
1034 |
index += 2; |
|
1035 |
} |
|
8919 | 1036 |
# endif /* __UNROLL_LOOPS2__ */ |
24609 | 1037 |
} |
8919 | 1038 |
#endif /* __UNROLL_LOOPS__ */ |
24609 | 1039 |
while (n > 0) { |
1040 |
el = __InstPtr(self)->i_instvars[index]; |
|
1041 |
if (InterruptPending != nil) goto interruptX; |
|
1042 |
continueX: |
|
1043 |
(*codeVal)(BLOCK_ARG, el); |
|
1044 |
n--; |
|
1045 |
index++; |
|
1046 |
} |
|
1047 |
RETURN (self); |
|
2216 | 1048 |
|
8919 | 1049 |
#ifdef __UNROLL_LOOPS__ |
24609 | 1050 |
interrupt0: |
1051 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index]; |
|
1052 |
goto continue0; |
|
1053 |
interrupt1: |
|
1054 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+1]; |
|
1055 |
goto continue1; |
|
1056 |
interrupt2: |
|
1057 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+2]; |
|
1058 |
goto continue2; |
|
1059 |
interrupt3: |
|
1060 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+3]; |
|
1061 |
goto continue3; |
|
1062 |
interrupt4: |
|
1063 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+4]; |
|
1064 |
goto continue4; |
|
1065 |
interrupt5: |
|
1066 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+5]; |
|
1067 |
goto continue5; |
|
1068 |
interrupt6: |
|
1069 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+6]; |
|
1070 |
goto continue6; |
|
1071 |
interrupt7: |
|
1072 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+7]; |
|
1073 |
goto continue7; |
|
3484 | 1074 |
|
8919 | 1075 |
# ifdef __UNROLL_LOOPS2__ |
24609 | 1076 |
interrupt0b: |
1077 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index]; |
|
1078 |
goto continue0b; |
|
1079 |
interrupt1b: |
|
1080 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+1]; |
|
1081 |
goto continue1b; |
|
1082 |
interrupt2b: |
|
1083 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+2]; |
|
1084 |
goto continue2b; |
|
1085 |
interrupt3b: |
|
1086 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+3]; |
|
1087 |
goto continue3b; |
|
1088 |
||
1089 |
interrupt0c: |
|
1090 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index]; |
|
1091 |
goto continue0c; |
|
1092 |
interrupt1c: |
|
1093 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index+1]; |
|
1094 |
goto continue1c; |
|
8919 | 1095 |
# endif /* __UNROLL_LOOPS2__ */ |
1096 |
#endif /* __UNROLL_LOOPS__ */ |
|
24609 | 1097 |
interruptX: |
1098 |
__interruptL(@line); el = __InstPtr(self)->i_instvars[index]; |
|
1099 |
goto continueX; |
|
1100 |
} |
|
1101 |
} |
|
1102 |
} |
|
1103 |
||
1104 |
/* |
|
1105 |
* sorry, must check code-pointer in the loop |
|
1106 |
* it could be recompiled or flushed |
|
1107 |
*/ |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1108 |
# undef BLOCK_ARG |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1109 |
#ifdef NEW_BLOCK_CALL |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1110 |
# define BLOCK_ARG aBlock |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1111 |
# define IBLOCK_ARG nil |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1112 |
#else |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1113 |
# define BLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1114 |
# define IBLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
11 | 1115 |
#endif |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1116 |
|
24609 | 1117 |
while (n > 0) { |
1118 |
REGISTER OBJFUNC codeVal; |
|
1119 |
OBJ el; |
|
1120 |
||
1121 |
el = __InstPtr(self)->i_instvars[index]; |
|
1122 |
if (InterruptPending != nil) { |
|
1123 |
__interruptL(@line); |
|
1124 |
el = __InstPtr(self)->i_instvars[index]; |
|
1125 |
} |
|
1126 |
||
1127 |
if ((codeVal = __BlockInstPtr(aBlock)->b_code) != (OBJFUNC)nil) { |
|
1128 |
(*codeVal)(BLOCK_ARG, el); |
|
1129 |
} else { |
|
1130 |
if (__BlockInstPtr(aBlock)->b_bytecodes != nil) { |
|
1131 |
/* |
|
1132 |
* arg is a compiled block with bytecode - |
|
1133 |
* directly call interpreter without going through Block>>value |
|
1134 |
*/ |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1135 |
#ifdef PASS_ARG_POINTER |
24609 | 1136 |
__interpret(aBlock, 1, nil, IBLOCK_ARG, nil, nil, &el); |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1137 |
#else |
24609 | 1138 |
__interpret(aBlock, 1, nil, IBLOCK_ARG, nil, nil, el); |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1139 |
#endif |
24609 | 1140 |
} else { |
1141 |
(*val.ilc_func)(aBlock, |
|
1142 |
@symbol(value:), |
|
1143 |
nil, &val, |
|
1144 |
el); |
|
1145 |
} |
|
1146 |
} |
|
1147 |
n--; |
|
1148 |
index++; |
|
1149 |
} |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1150 |
|
2211
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1151 |
# undef BLOCK_ARG |
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1152 |
# undef IBLOCK_ARG |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1153 |
|
24609 | 1154 |
RETURN (self ); |
1155 |
} |
|
1156 |
||
1157 |
/* |
|
1158 |
* not a block - send it #value: |
|
1159 |
*/ |
|
1160 |
while (n > 0) { |
|
1161 |
if (InterruptPending != nil) __interruptL(@line); |
|
1162 |
||
1163 |
(*val.ilc_func)(aBlock, |
|
1164 |
@symbol(value:), |
|
1165 |
nil, &val, |
|
1166 |
__InstPtr(self)->i_instvars[index]); |
|
1167 |
n--; |
|
1168 |
index++; |
|
1169 |
} |
|
1170 |
RETURN ( self ); |
|
1171 |
} |
|
1 | 1172 |
} |
945
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
1173 |
%}. |
24609 | 1174 |
super from:start to:stop do:aBlock |
1 | 1175 |
! |
1176 |
||
42 | 1177 |
from:start to:stop reverseDo:aBlock |
1178 |
"evaluate the argument, aBlock for the elements starting at index start |
|
1179 |
up to (and including) stop in the collection. Step in reverse order. |
|
1180 |
- reimplemented for speed" |
|
1181 |
||
1182 |
%{ |
|
1183 |
REGISTER OBJFUNC codeVal; |
|
14687 | 1184 |
REGISTER INT index; |
42 | 1185 |
REGISTER OBJ rHome; |
14687 | 1186 |
INT nIndex; |
42 | 1187 |
static struct inlineCache val = _ILC1; |
14687 | 1188 |
INT indexLow, indexHigh; |
42 | 1189 |
|
586
cab695f942a6
weakArray readBarrier for IGC
Claus Gittinger <cg@exept.de>
parents:
577
diff
changeset
|
1190 |
if (__bothSmallInteger(start, stop) |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1191 |
&& (__qClass(self) == @global(Array)) |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1192 |
&& ((indexLow = __intVal(start)) > 0)) { |
24609 | 1193 |
indexHigh = __intVal(stop); |
1194 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
1195 |
if (indexHigh <= nIndex) { |
|
1196 |
indexLow--; |
|
1197 |
indexHigh--; |
|
1198 |
||
1199 |
if (__isBlockLike(aBlock) |
|
1200 |
&& (__BlockInstPtr(aBlock)->b_nargs == __mkSmallInteger(1))) { |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1201 |
# undef BLOCK_ARG |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1202 |
#ifdef NEW_BLOCK_CALL |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1203 |
# define BLOCK_ARG aBlock |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1204 |
# define IBLOCK_ARG nil |
42 | 1205 |
#else |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1206 |
# define BLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1207 |
# define IBLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1208 |
#endif |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1209 |
|
24609 | 1210 |
for (index=indexHigh; index >= indexLow; index--) { |
1211 |
REGISTER OBJFUNC codeVal; |
|
1212 |
||
1213 |
if (InterruptPending != nil) __interruptL(@line); |
|
1214 |
||
1215 |
if ((codeVal = __BlockInstPtr(aBlock)->b_code) != (OBJFUNC)nil) { |
|
1216 |
(*codeVal)(BLOCK_ARG, __InstPtr(self)->i_instvars[index]); |
|
1217 |
} else { |
|
1218 |
if (__BlockInstPtr(aBlock)->b_bytecodes != nil) { |
|
1219 |
/* |
|
1220 |
* arg is a compiled block with bytecode - |
|
1221 |
* directly call interpreter without going through Block>>value |
|
1222 |
*/ |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1223 |
#ifdef PASS_ARG_POINTER |
24609 | 1224 |
__interpret(aBlock, 1, nil, IBLOCK_ARG, nil, nil, &(__InstPtr(self)->i_instvars[index])); |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1225 |
#else |
24609 | 1226 |
__interpret(aBlock, 1, nil, IBLOCK_ARG, nil, nil, __InstPtr(self)->i_instvars[index]); |
42 | 1227 |
#endif |
24609 | 1228 |
} else { |
1229 |
(*val.ilc_func)(aBlock, |
|
1230 |
@symbol(value:), |
|
1231 |
nil, &val, |
|
1232 |
__InstPtr(self)->i_instvars[index]); |
|
1233 |
} |
|
1234 |
} |
|
1235 |
} |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1236 |
|
2211
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1237 |
# undef BLOCK_ARG |
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1238 |
# undef IBLOCK_ARG |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1239 |
|
24609 | 1240 |
RETURN (self ); |
1241 |
} |
|
1242 |
||
1243 |
/* |
|
1244 |
* not a block - send it #value: |
|
1245 |
*/ |
|
1246 |
for (index=indexHigh; index >= indexLow; index--) { |
|
1247 |
if (InterruptPending != nil) __interruptL(@line); |
|
1248 |
||
1249 |
(*val.ilc_func)(aBlock, |
|
1250 |
@symbol(value:), |
|
1251 |
nil, &val, |
|
1252 |
__InstPtr(self)->i_instvars[index]); |
|
1253 |
} |
|
1254 |
RETURN ( self ); |
|
1255 |
} |
|
42 | 1256 |
} |
945
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
1257 |
%}. |
24609 | 1258 |
super from:start to:stop reverseDo:aBlock |
42 | 1259 |
! |
1260 |
||
554 | 1261 |
keysAndValuesDo:aBlock |
1262 |
"evaluate the argument, aBlock for each element in the collection. |
|
1263 |
Pass both index and element to the block. |
|
1264 |
- reimplemented for speed" |
|
1265 |
||
1266 |
%{ |
|
1267 |
REGISTER OBJFUNC codeVal; |
|
8913 | 1268 |
REGISTER INT index; |
554 | 1269 |
static struct inlineCache val2 = _ILC2; |
1270 |
REGISTER OBJ rHome; |
|
14687 | 1271 |
INT actualSize; |
2184
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
1272 |
OBJ myClass; |
554 | 1273 |
|
2184
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
1274 |
myClass = __qClass(self); |
8913 | 1275 |
if ((__ClassInstPtr(myClass)->c_ninstvars) == __mkSmallInteger(0)) { |
946
35962f2a169b
be prepared for cheaters, subclassing Array returning invalid sizes ...
Claus Gittinger <cg@exept.de>
parents:
945
diff
changeset
|
1276 |
|
24609 | 1277 |
actualSize = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
1278 |
index = 0; |
|
1279 |
||
1280 |
if (index < actualSize) { |
|
1281 |
if (__isBlockLike(aBlock) |
|
1282 |
&& (__BlockInstPtr(aBlock)->b_nargs == __mkSmallInteger(2))) { |
|
1283 |
{ |
|
1284 |
/* |
|
1285 |
* the most common case: a static compiled block, with home on the stack ... |
|
1286 |
*/ |
|
1287 |
REGISTER OBJFUNC codeVal; |
|
1288 |
||
1289 |
if (((codeVal = __BlockInstPtr(aBlock)->b_code) != (OBJFUNC)nil) |
|
2678 | 1290 |
#ifdef PARANOIA |
24609 | 1291 |
&& (! ((INT)(__BlockInstPtr(aBlock)->b_flags) & __MASKSMALLINT(F_DYNAMIC))) |
2678 | 1292 |
#endif |
24609 | 1293 |
) { |
2254 | 1294 |
|
554 | 1295 |
#ifdef NEW_BLOCK_CALL |
2842
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1296 |
# define BLOCK_ARG aBlock |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1297 |
#else |
2842
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1298 |
# define BLOCK_ARG rHome |
24609 | 1299 |
REGISTER OBJ rHome; |
1300 |
||
1301 |
rHome = __BlockInstPtr(aBlock)->b_home; |
|
1302 |
if ((rHome == nil) || (__qSpace(rHome) >= STACKSPACE)) |
|
2842
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1303 |
#endif |
24609 | 1304 |
{ |
1305 |
OBJ el; |
|
1306 |
||
1307 |
while (index < actualSize) { |
|
1308 |
||
1309 |
el = __InstPtr(self)->i_instvars[index]; |
|
1310 |
if (InterruptPending != nil) goto interruptX; |
|
1311 |
continueX: |
|
1312 |
index++; |
|
1313 |
(*codeVal)(BLOCK_ARG, __mkSmallInteger(index), el); |
|
1314 |
} |
|
1315 |
RETURN (self); |
|
1316 |
||
1317 |
interruptX: |
|
1318 |
__interruptL(@line); |
|
1319 |
el = __InstPtr(self)->i_instvars[index]; |
|
1320 |
goto continueX; |
|
1321 |
} |
|
1322 |
} |
|
1323 |
} |
|
1324 |
||
1325 |
/* |
|
1326 |
* sorry, must check code-pointer in the loop |
|
1327 |
* it could be recompiled or flushed |
|
1328 |
*/ |
|
2842
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1329 |
# undef BLOCK_ARG |
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1330 |
#ifdef NEW_BLOCK_CALL |
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1331 |
# define BLOCK_ARG aBlock |
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1332 |
# define IBLOCK_ARG nil |
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1333 |
#else |
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1334 |
# define BLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1335 |
# define IBLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1336 |
#endif |
2842
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1337 |
|
24609 | 1338 |
while (index < actualSize) { |
1339 |
REGISTER OBJFUNC codeVal; |
|
1340 |
OBJ el; |
|
1341 |
||
1342 |
if (InterruptPending != nil) __interruptL(@line); |
|
1343 |
||
1344 |
el = __InstPtr(self)->i_instvars[index]; |
|
1345 |
index++; |
|
1346 |
if ((codeVal = __BlockInstPtr(aBlock)->b_code) != (OBJFUNC)nil) { |
|
1347 |
(*codeVal)(BLOCK_ARG, __mkSmallInteger(index), el); |
|
1348 |
} else { |
|
1349 |
if (__BlockInstPtr(aBlock)->b_bytecodes != nil) { |
|
1350 |
/* |
|
1351 |
* arg is a compiled block with bytecode - |
|
1352 |
* directly call interpreter without going through Block>>value |
|
1353 |
*/ |
|
2842
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1354 |
#ifdef PASS_ARG_POINTER |
24609 | 1355 |
{ |
1356 |
OBJ t[2]; |
|
1357 |
||
1358 |
t[0] = __mkSmallInteger(index); |
|
1359 |
t[1] = el; |
|
1360 |
||
1361 |
__interpret(aBlock, 2, nil, IBLOCK_ARG, nil, nil, t); |
|
1362 |
} |
|
2842
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1363 |
#else |
24609 | 1364 |
__interpret(aBlock, 2, nil, IBLOCK_ARG, nil, nil, __mkSmallInteger(index), el); |
2842
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1365 |
#endif |
24609 | 1366 |
} else { |
1367 |
(*val2.ilc_func)(aBlock, |
|
1368 |
@symbol(value:value:), |
|
1369 |
nil, &val2, |
|
1370 |
__mkSmallInteger(index), |
|
1371 |
el); |
|
1372 |
} |
|
1373 |
} |
|
1374 |
} |
|
2842
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1375 |
|
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1376 |
# undef BLOCK_ARG |
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1377 |
# undef IBLOCK_ARG |
1cda44a3660e
oops - #keysAndValuesDo: was from for subclasses with named instVars
Claus Gittinger <cg@exept.de>
parents:
2821
diff
changeset
|
1378 |
|
24609 | 1379 |
RETURN (self ); |
1380 |
} |
|
1381 |
||
1382 |
/* |
|
1383 |
* not a block - send it #value: |
|
1384 |
*/ |
|
1385 |
while (index < actualSize) { |
|
1386 |
OBJ el; |
|
1387 |
||
1388 |
if (InterruptPending != nil) __interruptL(@line); |
|
1389 |
||
1390 |
el = __InstPtr(self)->i_instvars[index]; |
|
1391 |
index++; |
|
1392 |
(*val2.ilc_func)(aBlock, |
|
1393 |
@symbol(value:value:), |
|
1394 |
nil, &val2, |
|
1395 |
__mkSmallInteger(index), |
|
1396 |
el); |
|
1397 |
} |
|
1398 |
RETURN ( self ); |
|
1399 |
} |
|
554 | 1400 |
} |
945
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
1401 |
%}. |
24609 | 1402 |
super keysAndValuesDo:aBlock |
554 | 1403 |
! |
1404 |
||
14632 | 1405 |
modifyingTraverse:aBlock |
1406 |
"Evaluate aBlock for every element that is not an Array, |
|
11167 | 1407 |
and recursively traverse Arrays. |
1408 |
||
1409 |
aBlock may return the original element or a new element. |
|
1410 |
If a new element is returned, the element is changed to the new element." |
|
1411 |
||
14632 | 1412 |
self |
1413 |
keysAndValuesDo:[:eachIndex :eachElement | |
|
1414 |
eachElement isArray ifTrue:[ |
|
1415 |
eachElement modifyingTraverse:aBlock |
|
1416 |
] ifFalse:[ |
|
1417 |
|newElement| |
|
1418 |
||
1419 |
newElement := aBlock value:eachElement. |
|
1420 |
newElement ~~ eachElement ifTrue:[ |
|
1421 |
self at:eachIndex put:newElement. |
|
1422 |
]. |
|
1423 |
] |
|
1424 |
]. |
|
11167 | 1425 |
|
1426 |
" |
|
1427 |
example: replace all elements which are 10 with: 'changed' |
|
1428 |
||
14632 | 1429 |
#(1 2 (3 (4 5 (6 7) 8) 9 10) 11 (12 (13)) 14) copy |
1430 |
modifyingTraverse:[:el | |
|
1431 |
el = 10 ifTrue:['changed'] ifFalse:[el] |
|
1432 |
]; |
|
1433 |
inspect |
|
11167 | 1434 |
" |
1435 |
! |
|
1436 |
||
23526 | 1437 |
recursiveCollect:aBlock |
1438 |
"return a copy of the receiver where non-array elements |
|
1439 |
are replaced by whatever aBlock returns, |
|
1440 |
and array elements are recursively processed by this method again. |
|
1441 |
Useful to rewrite ui specs on the fly" |
|
1442 |
||
1443 |
^ self collect:[:each | |
|
1444 |
each isArray ifTrue:[ |
|
1445 |
each recursiveCollect:aBlock |
|
1446 |
] ifFalse:[ |
|
1447 |
aBlock value:each |
|
1448 |
] |
|
1449 |
]. |
|
1450 |
||
1451 |
" |
|
1452 |
#(1 2 3) recursiveCollect:[:el | el == 2 ifTrue:20 ifFalse:el] |
|
1453 |
#(1 2 (1 2 (1 2 (1 2 3) 3) 3) 3) recursiveCollect:[:el | el == 2 ifTrue:20 ifFalse:el] |
|
1454 |
#(1 2 (1 2 (1 2 (1 2 3) 3) 3) 3) recursiveCollect:[:el | el * 2] |
|
1455 |
" |
|
1456 |
||
1457 |
"Created: / 09-11-2018 / 20:59:58 / Claus Gittinger" |
|
1458 |
! |
|
1459 |
||
543 | 1460 |
reverseDo:aBlock |
1461 |
"evaluate the argument, aBlock for each element in the collection in reverse order. |
|
1462 |
- reimplemented for speed" |
|
1 | 1463 |
|
945
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
1464 |
|home sz "{ Class: SmallInteger }" | |
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
1465 |
|
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
1466 |
sz := self size. |
1 | 1467 |
%{ |
1468 |
REGISTER OBJFUNC codeVal; |
|
14687 | 1469 |
REGISTER INT index; |
1470 |
unsigned INT nIndex; |
|
1471 |
INT endIndex; |
|
1 | 1472 |
static struct inlineCache val = _ILC1; |
14687 | 1473 |
INT actualSize; |
2184
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
1474 |
OBJ myClass; |
1 | 1475 |
|
2184
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
1476 |
myClass = __qClass(self); |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
1477 |
{ |
24609 | 1478 |
endIndex = __intVal(__ClassInstPtr(myClass)->c_ninstvars); |
1479 |
actualSize = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
1480 |
nIndex = endIndex + __intVal(sz); |
|
1481 |
||
1482 |
if (nIndex <= actualSize) { |
|
1483 |
if (__isBlockLike(aBlock) |
|
1484 |
&& (__BlockInstPtr(aBlock)->b_nargs == __mkSmallInteger(1))) { |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1485 |
# undef BLOCK_ARG |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1486 |
#ifdef NEW_BLOCK_CALL |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1487 |
# define BLOCK_ARG aBlock |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1488 |
# define IBLOCK_ARG nil |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1489 |
#else |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1490 |
# define BLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1491 |
# define IBLOCK_ARG (__BlockInstPtr(aBlock)->b_home) |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1492 |
#endif |
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1493 |
|
24609 | 1494 |
for (index=nIndex-1; index >= endIndex; index--) { |
1495 |
REGISTER OBJFUNC codeVal; |
|
1496 |
||
1497 |
if (InterruptPending != nil) __interruptL(@line); |
|
1498 |
||
1499 |
if ((codeVal = __BlockInstPtr(aBlock)->b_code) != (OBJFUNC)nil) { |
|
1500 |
(*codeVal)(BLOCK_ARG, __InstPtr(self)->i_instvars[index]); |
|
1501 |
} else { |
|
1502 |
if (__BlockInstPtr(aBlock)->b_bytecodes != nil) { |
|
1503 |
/* |
|
1504 |
* arg is a compiled block with bytecode - |
|
1505 |
* directly call interpreter without going through Block>>value |
|
1506 |
*/ |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1507 |
#ifdef PASS_ARG_POINTER |
24609 | 1508 |
__interpret(aBlock, 1, nil, IBLOCK_ARG, nil, nil, &(__InstPtr(self)->i_instvars[index])); |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1509 |
#else |
24609 | 1510 |
__interpret(aBlock, 1, nil, IBLOCK_ARG, nil, nil, __InstPtr(self)->i_instvars[index]); |
11 | 1511 |
#endif |
24609 | 1512 |
} else { |
1513 |
(*val.ilc_func)(aBlock, |
|
1514 |
@symbol(value:), |
|
1515 |
nil, &val, |
|
1516 |
__InstPtr(self)->i_instvars[index]); |
|
1517 |
} |
|
1518 |
} |
|
1519 |
} |
|
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1520 |
|
2211
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1521 |
# undef BLOCK_ARG |
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1522 |
# undef IBLOCK_ARG |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1523 |
|
24609 | 1524 |
RETURN (self ); |
1525 |
} |
|
1526 |
||
1527 |
/* |
|
1528 |
* not a block - send it #value: |
|
1529 |
*/ |
|
1530 |
for (index=nIndex-1; index >= endIndex; index--) { |
|
1531 |
if (InterruptPending != nil) __interruptL(@line); |
|
1532 |
||
1533 |
(*val.ilc_func)(aBlock, |
|
1534 |
@symbol(value:), |
|
1535 |
nil, &val, |
|
1536 |
__InstPtr(self)->i_instvars[index]); |
|
1537 |
} |
|
1538 |
RETURN ( self ); |
|
1539 |
} |
|
1 | 1540 |
} |
543 | 1541 |
%}. |
24609 | 1542 |
super reverseDo:aBlock |
11 | 1543 |
! |
1544 |
||
328 | 1545 |
traverse:aBlock |
14632 | 1546 |
"Evaluate aBlock for every element that is not an Array, |
1123 | 1547 |
and recursively traverse Arrays. |
328 | 1548 |
Implemented here to support better search for selectors in |
1549 |
literal arrays - might be a good idea to move it up in the collection |
|
1550 |
hierarchy, since this may be a useful method for other collections |
|
1551 |
as well." |
|
1552 |
||
1553 |
self do: [:el | |
|
2211
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1554 |
el isArray |
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1555 |
ifTrue: [el traverse: aBlock] |
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1556 |
ifFalse: [aBlock value: el]] |
328 | 1557 |
|
1558 |
" |
|
1559 |
example: flattening an Array: |
|
1560 |
||
1561 |
|s| |
|
1562 |
||
1563 |
s := WriteStream on:Array new. |
|
1564 |
#(1 2 (3 (4 5 (6 7) 8) 9 10) 11 (12 (13)) 14) traverse:[:el | s nextPut:el]. |
|
14632 | 1565 |
s contents |
328 | 1566 |
" |
1123 | 1567 |
" |
1568 |
example: deep search |
|
1569 |
||
14632 | 1570 |
#(1 2 (3 (4 5 (6 7) 8) 9 10) 11 (12 (13)) 14) traverse:[:el | |
2211
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
1571 |
el == 10 ifTrue:[Transcript showCR:'found'] |
1123 | 1572 |
] |
1573 |
" |
|
1574 |
||
1575 |
"Modified: 26.3.1996 / 17:08:10 / cg" |
|
543 | 1576 |
! ! |
1577 |
||
1578 |
!Array methodsFor:'filling & replacing'! |
|
1579 |
||
554 | 1580 |
from:index1 to:index2 put:anObject |
1581 |
"reimplemented for speed if receiver is an Array" |
|
1582 |
||
1583 |
%{ /* NOCONTEXT */ |
|
18408 | 1584 |
#ifdef __SCHTEAM__ |
1585 |
if (bothSmallInteger(index1, index2)) { |
|
1586 |
int _start = index1.intValue(); |
|
1587 |
int _stop = index2.intValue(); |
|
1588 |
self.from_to_put(_start, _stop, anObject); |
|
1589 |
return context._RETURN(self); |
|
1590 |
} |
|
1591 |
#else |
|
14687 | 1592 |
REGISTER INT index; |
1593 |
unsigned INT nIndex; |
|
1594 |
unsigned INT endIndex; |
|
554 | 1595 |
REGISTER OBJ *dst; |
1596 |
||
1597 |
if ((__qClass(self) == Array) |
|
1598 |
&& __bothSmallInteger(index1, index2)) { |
|
1133 | 1599 |
index = __intVal(index1) - 1; |
554 | 1600 |
if (index >= 0) { |
1601 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
1133 | 1602 |
endIndex = __intVal(index2) - 1; |
2185
790f4c380343
care for blocks being recompiled or code being flushed, while
Claus Gittinger <cg@exept.de>
parents:
2184
diff
changeset
|
1603 |
|
951
2dd898849a8a
directly call __new if quick allocation fails;
Claus Gittinger <cg@exept.de>
parents:
946
diff
changeset
|
1604 |
if ((endIndex >= index) && (endIndex < nIndex)) { |
1133 | 1605 |
dst = &(__InstPtr(self)->i_instvars[index]); |
18408 | 1606 |
# ifdef memset4 |
2865 | 1607 |
{ |
1608 |
int n4 = endIndex-index+1; |
|
1609 |
||
1610 |
memset4(dst, anObject, n4); |
|
1611 |
} |
|
18408 | 1612 |
# else |
1613 |
# ifdef FAST_MEMSET |
|
554 | 1614 |
if ((INT)anObject == 0) { |
1615 |
memset(dst, 0, __OBJS2BYTES__(endIndex-index+1)); |
|
14632 | 1616 |
} else |
18408 | 1617 |
# endif |
2865 | 1618 |
{ |
18408 | 1619 |
# ifdef __UNROLL_LOOPS__ |
554 | 1620 |
{ |
14687 | 1621 |
INT i8; |
554 | 1622 |
|
1623 |
while ((i8 = index + 8) <= endIndex) { |
|
3041 | 1624 |
dst[3] = dst[2] = dst[1] = dst[0] = anObject; |
1625 |
dst[7] = dst[6] = dst[5] = dst[4] = anObject; |
|
554 | 1626 |
dst += 8; |
1627 |
index = i8; |
|
1628 |
} |
|
1629 |
} |
|
18408 | 1630 |
# endif |
554 | 1631 |
for (; index <= endIndex; index++) { |
1632 |
*dst++ = anObject; |
|
1633 |
} |
|
1634 |
} |
|
18408 | 1635 |
# endif |
3730
375237229a8e
replaceFrom... - unrolled 8 times;
Claus Gittinger <cg@exept.de>
parents:
3500
diff
changeset
|
1636 |
__STORE(self, anObject); |
554 | 1637 |
RETURN ( self ); |
1638 |
} |
|
1639 |
} |
|
1640 |
} |
|
18408 | 1641 |
#endif |
945
b2a1dc200c42
allow redefinition of #size in subclasses (optimized methods did not work in this case)
Claus Gittinger <cg@exept.de>
parents:
835
diff
changeset
|
1642 |
%}. |
554 | 1643 |
^ super from:index1 to:index2 put:anObject |
1644 |
! |
|
1645 |
||
543 | 1646 |
replaceFrom:start to:stop with:aCollection startingAt:repStart |
1168 | 1647 |
"replace elements in the receiver between index start and stop, |
20240 | 1648 |
with elements taken from replacementCollection starting at repStart. |
3234 | 1649 |
Return the receiver. |
1168 | 1650 |
Reimplemented for speed if both receiver and aCollection are Arrays" |
543 | 1651 |
|
1652 |
%{ /* NOCONTEXT */ |
|
1653 |
||
14687 | 1654 |
unsigned INT nIndex; |
1655 |
unsigned INT repNIndex; |
|
1656 |
INT startIndex, stopIndex; |
|
543 | 1657 |
REGISTER OBJ *src; |
1658 |
REGISTER OBJ *dst; |
|
14687 | 1659 |
INT repStopIndex; |
1660 |
REGISTER INT repStartIndex; |
|
543 | 1661 |
REGISTER OBJ t; |
14687 | 1662 |
REGISTER INT count; |
1903 | 1663 |
OBJ myClass; |
14632 | 1664 |
|
2210 | 1665 |
if ( |
20308 | 1666 |
(__ClassInstPtr((myClass = __qClass(self)))->c_ninstvars == __mkSmallInteger(0)) |
1903 | 1667 |
&& __isNonNilObject(aCollection) |
20149 | 1668 |
&& (((t = __qClass(aCollection)) == Array) || t == ImmutableArray || (t == myClass)) |
543 | 1669 |
&& __bothSmallInteger(start, stop) |
2210 | 1670 |
&& __isSmallInteger(repStart) |
1671 |
) { |
|
20308 | 1672 |
startIndex = __intVal(start) - 1; |
1673 |
if (startIndex >= 0) { |
|
1674 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
1675 |
stopIndex = __intVal(stop) - 1; |
|
1676 |
count = stopIndex - startIndex + 1; |
|
1903 | 1677 |
|
20308 | 1678 |
if ((count > 0) && (stopIndex < nIndex)) { |
1679 |
repStartIndex = __intVal(repStart) - 1; |
|
1680 |
if (repStartIndex >= 0) { |
|
1681 |
repNIndex = __BYTES2OBJS__(__qSize(aCollection)-OHDR_SIZE); |
|
1682 |
repStopIndex = repStartIndex + (stopIndex - startIndex); |
|
1683 |
if (repStopIndex < repNIndex) { |
|
1684 |
src = &(__InstPtr(aCollection)->i_instvars[repStartIndex]); |
|
1685 |
dst = &(__InstPtr(self)->i_instvars[startIndex]); |
|
1686 |
if (aCollection == self) { |
|
1687 |
/* |
|
1688 |
* no need to check stores if copying |
|
1689 |
* from myself |
|
1690 |
*/ |
|
1903 | 1691 |
|
20308 | 1692 |
if (src < dst) { |
1693 |
/* |
|
1694 |
* take care of overlapping copy |
|
1695 |
* memcpy() is not smart enough by definition for overlkapping copies |
|
1696 |
* memmove() is! |
|
1697 |
*/ |
|
20149 | 1698 |
#if defined(FAST_MEMCPY) |
20308 | 1699 |
memmove(dst, src, __OBJS2BYTES__(count)); |
20149 | 1700 |
#else |
20308 | 1701 |
/* must do a reverse copy */ |
1702 |
src += count; |
|
1703 |
dst += count; |
|
20149 | 1704 |
# ifdef __UNROLL_LOOPS__ |
20308 | 1705 |
while (count > 8) { |
1706 |
dst[-1] = src[-1]; |
|
1707 |
dst[-2] = src[-2]; |
|
1708 |
dst[-3] = src[-3]; |
|
1709 |
dst[-4] = src[-4]; |
|
1710 |
dst[-5] = src[-5]; |
|
1711 |
dst[-6] = src[-6]; |
|
1712 |
dst[-7] = src[-7]; |
|
1713 |
dst[-8] = src[-8]; |
|
1714 |
dst -= 8; src -= 8; |
|
1715 |
count -= 8; |
|
1716 |
} |
|
20149 | 1717 |
# endif // __UNROLL_LOOPS__ |
20308 | 1718 |
while (count-- > 0) { |
1719 |
*--dst = *--src; |
|
1720 |
} |
|
20149 | 1721 |
#endif // ! FAST_MEMCPY |
20308 | 1722 |
RETURN ( self ); |
1723 |
} |
|
1903 | 1724 |
#ifdef SOFTWARE_PIPELINE |
20308 | 1725 |
{ |
1726 |
/* |
|
1727 |
* the loop below fetches one longWord behind |
|
1728 |
* this should not be a problem |
|
1729 |
*/ |
|
1730 |
OBJ t1 = src[0]; |
|
1731 |
count--; |
|
1732 |
if (count) { |
|
1733 |
dst++; src++; |
|
1734 |
do { |
|
1735 |
dst[-1] = t1; |
|
1736 |
t1 = src[0]; |
|
1737 |
src++; |
|
1738 |
dst++; |
|
1739 |
} while (count--); |
|
1740 |
} else { |
|
1741 |
dst[0] = t1; |
|
1742 |
} |
|
1743 |
} |
|
20149 | 1744 |
#elif defined(bcopy4) |
20308 | 1745 |
count = __OBJS2BYTES__(count) / 4; |
1746 |
bcopy4(src, dst, count); |
|
20149 | 1747 |
#elif defined(FAST_MEMCPY) |
20308 | 1748 |
memmove(dst, src, __OBJS2BYTES__(count)); |
543 | 1749 |
#else |
20149 | 1750 |
# if defined(__UNROLL_LOOPS__) |
20308 | 1751 |
while (count >= 8) { |
1752 |
dst[0] = src[0]; |
|
1753 |
dst[1] = src[1]; |
|
1754 |
dst[2] = src[2]; |
|
1755 |
dst[3] = src[3]; |
|
1756 |
dst[4] = src[4]; |
|
1757 |
dst[5] = src[5]; |
|
1758 |
dst[6] = src[6]; |
|
1759 |
dst[7] = src[7]; |
|
1760 |
dst += 8; src += 8; |
|
1761 |
count -= 8; |
|
1762 |
} |
|
20149 | 1763 |
# endif // __UNROLL_LOOPS__ |
20308 | 1764 |
while (count--) { |
1765 |
*dst++ = *src++; |
|
1766 |
} |
|
20149 | 1767 |
#endif |
20308 | 1768 |
} else { |
1769 |
// not copying into the same object |
|
1770 |
REGISTER int spc = __qSpace(self); |
|
20149 | 1771 |
#ifdef __UNROLL_LOOPS__ |
20308 | 1772 |
while (count >= 8) { |
1773 |
t = src[0]; dst[0] = t; __STORE_SPC(self, t, spc); |
|
1774 |
t = src[1]; dst[1] = t; __STORE_SPC(self, t, spc); |
|
1775 |
t = src[2]; dst[2] = t; __STORE_SPC(self, t, spc); |
|
1776 |
t = src[3]; dst[3] = t; __STORE_SPC(self, t, spc); |
|
1777 |
t = src[4]; dst[4] = t; __STORE_SPC(self, t, spc); |
|
1778 |
t = src[5]; dst[5] = t; __STORE_SPC(self, t, spc); |
|
1779 |
t = src[6]; dst[6] = t; __STORE_SPC(self, t, spc); |
|
1780 |
t = src[7]; dst[7] = t; __STORE_SPC(self, t, spc); |
|
1781 |
count -= 8; src += 8; dst += 8; |
|
1782 |
} |
|
20149 | 1783 |
#endif |
20308 | 1784 |
while (count-- > 0) { |
1785 |
*dst++ = t = *src++; |
|
1786 |
__STORE_SPC(self, t, spc); |
|
1787 |
} |
|
1788 |
} |
|
1789 |
RETURN ( self ); |
|
1790 |
} |
|
1791 |
} |
|
1792 |
} |
|
1903 | 1793 |
|
20308 | 1794 |
if (count == 0) { |
1795 |
RETURN ( self ); |
|
1796 |
} |
|
1797 |
} |
|
543 | 1798 |
} |
1799 |
%}. |
|
1800 |
^ super replaceFrom:start to:stop with:aCollection startingAt:repStart |
|
1168 | 1801 |
|
1802 |
"Modified: 13.4.1996 / 12:17:13 / cg" |
|
543 | 1803 |
! ! |
1804 |
||
21464 | 1805 |
|
543 | 1806 |
!Array methodsFor:'printing & storing'! |
1807 |
||
13077
87f8b675848f
Implement display with #displayOn: instead of #displayString
Stefan Vogel <sv@exept.de>
parents:
12477
diff
changeset
|
1808 |
displayStringName |
18938 | 1809 |
"redefinable helper for displayString" |
1810 |
||
18937 | 1811 |
|cls| |
20240 | 1812 |
|
18937 | 1813 |
((cls := self class) == Array or:[cls == ImmutableArray]) ifTrue:[ |
20308 | 1814 |
^ '#' |
543 | 1815 |
]. |
13077
87f8b675848f
Implement display with #displayOn: instead of #displayString
Stefan Vogel <sv@exept.de>
parents:
12477
diff
changeset
|
1816 |
^ super displayStringName. |
543 | 1817 |
! |
1818 |
||
8442
5b4f72d5e966
#printOn: prints Array as #(....) instead of Array(....)
Stefan Vogel <sv@exept.de>
parents:
8368
diff
changeset
|
1819 |
printOn:aStream |
12162
32aa3e64c889
comment/format in: #printOn:
Claus Gittinger <cg@exept.de>
parents:
11797
diff
changeset
|
1820 |
"append a printed representation of the receiver to aStream" |
8442
5b4f72d5e966
#printOn: prints Array as #(....) instead of Array(....)
Stefan Vogel <sv@exept.de>
parents:
8368
diff
changeset
|
1821 |
|
5b4f72d5e966
#printOn: prints Array as #(....) instead of Array(....)
Stefan Vogel <sv@exept.de>
parents:
8368
diff
changeset
|
1822 |
self isLiteral ifTrue:[ |
24024 | 1823 |
|limit firstOne s| |
1824 |
||
1825 |
thisContext isRecursive ifTrue:[ |
|
1826 |
'Array [error]: printOn: of self referencing collection.' errorPrintCR. |
|
1827 |
aStream nextPutAll:'#("recursive")'. |
|
1828 |
^ self |
|
1829 |
]. |
|
1830 |
||
1831 |
aStream nextPutAll:'#('. |
|
1832 |
firstOne := true. |
|
1833 |
||
1834 |
" |
|
1835 |
if aStream is not positionable, create an temporary positionable stream |
|
1836 |
(needed for limit calculation) |
|
1837 |
" |
|
1838 |
aStream isPositionable ifTrue:[ |
|
1839 |
s := aStream. |
|
1840 |
] ifFalse:[ |
|
1841 |
s := CharacterWriteStream new:50. |
|
1842 |
]. |
|
1843 |
limit := s position + self maxPrint. |
|
1844 |
||
1845 |
self printElementsDo:[:element | |
|
1846 |
firstOne ifFalse:[ |
|
1847 |
s space |
|
1848 |
] ifTrue:[ |
|
1849 |
firstOne := false |
|
1850 |
]. |
|
1851 |
(s position >= limit) ifTrue:[ |
|
1852 |
s ~~ aStream ifTrue:[ |
|
1853 |
aStream nextPutAll:(s contents). |
|
1854 |
]. |
|
1855 |
aStream nextPutAll:'...etc...)'. |
|
1856 |
^ self |
|
1857 |
] ifFalse:[ |
|
1858 |
element printArrayElementOn:s. |
|
1859 |
]. |
|
1860 |
]. |
|
1861 |
s ~~ aStream ifTrue:[ |
|
1862 |
aStream nextPutAll:(s contents). |
|
1863 |
]. |
|
1864 |
aStream nextPut:$) |
|
8442
5b4f72d5e966
#printOn: prints Array as #(....) instead of Array(....)
Stefan Vogel <sv@exept.de>
parents:
8368
diff
changeset
|
1865 |
] ifFalse:[ |
24024 | 1866 |
super printOn:aStream |
8442
5b4f72d5e966
#printOn: prints Array as #(....) instead of Array(....)
Stefan Vogel <sv@exept.de>
parents:
8368
diff
changeset
|
1867 |
] |
5b4f72d5e966
#printOn: prints Array as #(....) instead of Array(....)
Stefan Vogel <sv@exept.de>
parents:
8368
diff
changeset
|
1868 |
|
5b4f72d5e966
#printOn: prints Array as #(....) instead of Array(....)
Stefan Vogel <sv@exept.de>
parents:
8368
diff
changeset
|
1869 |
" |
18267 | 1870 |
#(1 2 $a $Å 'hello' sym kewordSymbol:with: #'funny symbol') printString |
14632 | 1871 |
#(1 2 $a [1 2 3] true false nil #true #false #nil) printString |
8442
5b4f72d5e966
#printOn: prints Array as #(....) instead of Array(....)
Stefan Vogel <sv@exept.de>
parents:
8368
diff
changeset
|
1872 |
" |
5b4f72d5e966
#printOn: prints Array as #(....) instead of Array(....)
Stefan Vogel <sv@exept.de>
parents:
8368
diff
changeset
|
1873 |
|
24024 | 1874 |
"Created: / 20-11-1995 / 11:16:58 / cg" |
1875 |
"Modified: / 29-03-2019 / 11:57:00 / stefan" |
|
7600
5a3fee21c032
#storeString - omit # from Symbols and Arrays that are elements of an array.
Stefan Vogel <sv@exept.de>
parents:
6497
diff
changeset
|
1876 |
! |
5a3fee21c032
#storeString - omit # from Symbols and Arrays that are elements of an array.
Stefan Vogel <sv@exept.de>
parents:
6497
diff
changeset
|
1877 |
|
543 | 1878 |
storeOn:aStream |
1879 |
"append a printed representation of the receiver to aStream, |
|
1880 |
which allows reconstructing it via readFrom:. |
|
1881 |
Redefined to output a somewhat more user friendly string." |
|
1882 |
||
1883 |
self isLiteral ifTrue:[ |
|
14632 | 1884 |
aStream nextPutAll:'#('. |
1885 |
self do:[:element | element storeArrayElementOn:aStream] |
|
1886 |
separatedBy:[aStream space]. |
|
1887 |
aStream nextPut:$) |
|
543 | 1888 |
] ifFalse:[ |
14632 | 1889 |
super storeOn:aStream |
543 | 1890 |
] |
1891 |
||
1892 |
" |
|
14632 | 1893 |
#(1 2 $a 'hello' sym kewordSymbol:with: #'funny symbol') storeString |
1894 |
#(1 2 $a [1 2 3] true false nil #true #false #nil) storeString |
|
543 | 1895 |
" |
588 | 1896 |
|
1897 |
"Created: 20.11.1995 / 11:16:58 / cg" |
|
543 | 1898 |
! ! |
1899 |
||
24024 | 1900 |
!Array methodsFor:'private array element printing'! |
1901 |
||
1902 |
displayArrayElementOn:aStream |
|
1903 |
"Display myself as an element of an array. Omit the leading '#'" |
|
1904 |
||
1905 |
self isLiteral ifTrue:[ |
|
1906 |
aStream nextPut:$(. |
|
1907 |
self |
|
1908 |
do:[:element | element displayArrayElementOn:aStream] |
|
1909 |
separatedBy:[aStream space]. |
|
1910 |
aStream nextPut:$). |
|
1911 |
^ self. |
|
1912 |
]. |
|
1913 |
super displayArrayElementOn:aStream |
|
1914 |
||
1915 |
" |
|
1916 |
#(1 2 3 4 5 Symbol String Integer (7 8 9)) print:Transcript |
|
1917 |
#(1 2 3 4 5) printArrayElementOn:Transcript |
|
1918 |
" |
|
1919 |
||
1920 |
"Created: / 29-03-2019 / 12:01:16 / stefan" |
|
1921 |
! |
|
1922 |
||
1923 |
displayElement:element on:aStream |
|
1924 |
"print a representation of the element on aGCOrStream. |
|
1925 |
Redefined to use ST syntax for symbols inside Array literals." |
|
1926 |
||
1927 |
element displayArrayElementOn:aStream. |
|
1928 |
||
1929 |
"Created: / 29-03-2019 / 11:07:50 / stefan" |
|
1930 |
! |
|
1931 |
||
1932 |
printArrayElementOn:aStream |
|
1933 |
"Print myself as element of an array. Omit the leading '#'" |
|
1934 |
||
1935 |
self isLiteral ifTrue:[ |
|
1936 |
aStream nextPut:$(. |
|
1937 |
self |
|
1938 |
do:[:element | element printArrayElementOn:aStream] |
|
1939 |
separatedBy:[aStream space]. |
|
1940 |
aStream nextPut:$). |
|
1941 |
^ self. |
|
1942 |
]. |
|
1943 |
super printArrayElementOn:aStream |
|
1944 |
||
1945 |
" |
|
1946 |
#(1 2 3 4 5 Symbol String Integer (7 8 9)) print:Transcript |
|
1947 |
#(1 2 3 4 5) printArrayElementOn:Transcript |
|
1948 |
" |
|
1949 |
||
1950 |
"Created: / 29-03-2019 / 11:54:53 / stefan" |
|
1951 |
! |
|
1952 |
||
1953 |
storeArrayElementOn:aStream |
|
1954 |
"Store as element of an array. Omit the leading '#'" |
|
1955 |
||
1956 |
self isLiteral ifTrue:[ |
|
1957 |
aStream nextPut:$(. |
|
1958 |
self |
|
1959 |
do:[:element | element storeArrayElementOn:aStream] |
|
1960 |
separatedBy:[aStream space]. |
|
1961 |
aStream nextPut:$). |
|
1962 |
^ self. |
|
1963 |
]. |
|
1964 |
super storeArrayElementOn:aStream |
|
1965 |
||
1966 |
" |
|
1967 |
#(1 2 3 4 5 Symbol String Integer (7 8 9)) storeOn:Transcript |
|
1968 |
#(1 2 3 4 5) storeArrayElementOn:Transcript |
|
1969 |
" |
|
1970 |
||
1971 |
"Modified (comment): / 29-03-2019 / 11:52:28 / stefan" |
|
1972 |
! ! |
|
1973 |
||
543 | 1974 |
!Array methodsFor:'queries'! |
1975 |
||
5557 | 1976 |
basicSize |
1977 |
"return the number of indexed elements in the receiver" |
|
1978 |
||
1979 |
%{ /* NOCONTEXT */ |
|
18246 | 1980 |
#ifdef __SCHTEAM__ |
1981 |
return context._RETURN (STInteger._new(self.basicSize())); |
|
1982 |
#else |
|
5557 | 1983 |
REGISTER OBJ slf = self; |
1984 |
||
8913 | 1985 |
RETURN ( __mkSmallInteger(__arraySize(slf) - __intVal(__ClassInstPtr(__qClass(slf))->c_ninstvars) )); |
18246 | 1986 |
#endif |
5557 | 1987 |
%} |
1988 |
! |
|
1989 |
||
23709 | 1990 |
includes:anObject |
1991 |
"return true, if the argument, anObject is contained in the array |
|
1992 |
- reimplemented for speed" |
|
1993 |
||
1994 |
|element| |
|
1995 |
||
1996 |
%{ /* NOCONTEXT */ |
|
1997 |
/* |
|
1998 |
* first, do a quick check using == |
|
1999 |
* this does not need a context or message send. |
|
2000 |
* In many cases this will already find a match. |
|
2001 |
*/ |
|
2002 |
REGISTER INT index; |
|
2003 |
REGISTER OBJ o; |
|
2004 |
unsigned INT nIndex; |
|
2005 |
||
2006 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
2007 |
index = __intVal(__ClassInstPtr(__qClass(self))->c_ninstvars); |
|
2008 |
||
2009 |
o = anObject; |
|
2010 |
||
2011 |
/* |
|
2012 |
* however, the search is limited to the first 500 |
|
2013 |
* elements, since otherwise, we may spend too much time |
|
2014 |
* searching for identity if an equal value is found early |
|
2015 |
* (except if searching for nil - there is no need for equal compare ...) |
|
2016 |
*/ |
|
2017 |
if (nIndex > 500) { |
|
2018 |
if (o != nil) |
|
2019 |
nIndex = 500; |
|
2020 |
} |
|
2021 |
||
2022 |
# ifdef memsrch4 |
|
2023 |
if (index < nIndex) { |
|
2024 |
OBJ *p; |
|
2025 |
||
2026 |
p = memsrch4(&(__InstPtr(self)->i_instvars[index]), (INT)o, (nIndex - index)); |
|
2027 |
if (p) { |
|
2028 |
RETURN ( true ); |
|
2029 |
} |
|
2030 |
} |
|
2031 |
||
2032 |
# else |
|
2033 |
/* |
|
2034 |
* don't argue those gotos below - they speed up that thing by 30% |
|
2035 |
* its better to exit the loops below with a goto, |
|
2036 |
* since the generated code will then be: |
|
2037 |
* compare |
|
2038 |
* branch-on-equal found |
|
2039 |
* |
|
2040 |
* otherwise, we get: |
|
2041 |
* compare |
|
2042 |
* branch-on-not-equal skipLabel |
|
2043 |
* move-to-return-register true |
|
2044 |
* goto return-label |
|
2045 |
* skipLabel |
|
2046 |
* |
|
2047 |
* therefore, WITH the so-much-blamed goto, we only branch |
|
2048 |
* when found; without the goto, we branch always. |
|
2049 |
* Pipelined CPUs do usually not like taken branches. |
|
2050 |
* also, all branches are forward, which are usually predicted |
|
2051 |
* as not taken. |
|
2052 |
*/ |
|
2053 |
# ifdef __UNROLL_LOOPS__ |
|
2054 |
{ |
|
2055 |
unsigned INT i8; |
|
2056 |
REGISTER OBJ slf = self; |
|
2057 |
||
2058 |
while ((i8 = index + 8) < nIndex) { |
|
2059 |
if (__InstPtr(slf)->i_instvars[index] == o) goto found; |
|
2060 |
if (__InstPtr(slf)->i_instvars[index+1] == o) goto found; |
|
2061 |
if (__InstPtr(slf)->i_instvars[index+2] == o) goto found; |
|
2062 |
if (__InstPtr(slf)->i_instvars[index+3] == o) goto found; |
|
2063 |
if (__InstPtr(slf)->i_instvars[index+4] == o) goto found; |
|
2064 |
if (__InstPtr(slf)->i_instvars[index+5] == o) goto found; |
|
2065 |
if (__InstPtr(slf)->i_instvars[index+6] == o) goto found; |
|
2066 |
if (__InstPtr(slf)->i_instvars[index+7] == o) goto found; |
|
2067 |
index = i8; |
|
2068 |
} |
|
2069 |
} |
|
2070 |
# endif /* __UNROLL_LOOPS__ */ |
|
2071 |
||
2072 |
while (index < nIndex) { |
|
2073 |
if (__InstPtr(self)->i_instvars[index++] == o) goto found; |
|
2074 |
} |
|
2075 |
if (0) { |
|
2076 |
found: |
|
2077 |
RETURN (true); |
|
2078 |
} |
|
2079 |
||
2080 |
# endif /* no memsrch */ |
|
2081 |
||
2082 |
if (o == nil) { |
|
2083 |
RETURN ( false ); |
|
2084 |
} |
|
2085 |
%}. |
|
2086 |
||
2087 |
%{ |
|
2088 |
REGISTER INT index; |
|
2089 |
REGISTER OBJ o; |
|
2090 |
unsigned INT nIndex; |
|
2091 |
static struct inlineCache eq = _ILC1; |
|
2092 |
||
2093 |
/* |
|
2094 |
* then do a slow(er) check using = |
|
2095 |
*/ |
|
2096 |
||
2097 |
/* |
|
2098 |
* sorry: cannot access the stuff from above ... |
|
2099 |
*/ |
|
2100 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
2101 |
index = __intVal(__ClassInstPtr(__qClass(self))->c_ninstvars); |
|
2102 |
||
2103 |
while (index < nIndex) { |
|
2104 |
element = __InstPtr(self)->i_instvars[index++]; |
|
2105 |
if (element != nil) { |
|
2106 |
if ((*eq.ilc_func)(anObject, |
|
2107 |
@symbol(=), |
|
2108 |
nil,&eq, |
|
2109 |
element)==true) { |
|
2110 |
RETURN ( true ); |
|
2111 |
} |
|
2112 |
} |
|
2113 |
} |
|
2114 |
RETURN (false); |
|
2115 |
%}. |
|
2116 |
^ super includes:anObject |
|
2117 |
! |
|
2118 |
||
2119 |
includesIdentical:anObject |
|
2120 |
"return true, if the argument, anObject is contained in the array |
|
2121 |
uses #== (instead of #=) when comparing; i.e. the search is for |
|
2122 |
the object, not some object being equal." |
|
2123 |
||
2124 |
^ (self identityIndexOf:anObject) ~~ 0 |
|
2125 |
||
2126 |
" |
|
2127 |
#(1 2 3 4 5) includes:3.0 |
|
2128 |
||
2129 |
#(1 2 3 4 5) includesIdentical:3.0 |
|
2130 |
" |
|
2131 |
! |
|
2132 |
||
2133 |
isEmpty |
|
2134 |
"return true if the receiver contains no elements. |
|
2135 |
Reimplemented here for performance." |
|
2136 |
||
2137 |
%{ /* NOCONTEXT */ |
|
2138 |
if (__isArrayLike(self)) { |
|
2139 |
RETURN ( (__arraySize(self) == 0) ? true : false); |
|
2140 |
} |
|
2141 |
%}. |
|
2142 |
^ self size == 0 |
|
2143 |
||
2144 |
"Modified: / 16-02-2017 / 14:58:48 / stefan" |
|
2145 |
! |
|
2146 |
||
2147 |
isEmptyOrNil |
|
2148 |
"return true if the receiver contains no elements. |
|
2149 |
Reimplemented here for performance." |
|
2150 |
||
2151 |
%{ /* NOCONTEXT */ |
|
2152 |
if (__isArrayLike(self)) { |
|
2153 |
RETURN ( (__arraySize(self) == 0) ? true : false); |
|
2154 |
} |
|
2155 |
%}. |
|
2156 |
^ self size == 0 |
|
2157 |
||
2158 |
"Created: / 22-02-2017 / 14:09:13 / stefan" |
|
2159 |
! |
|
2160 |
||
2161 |
notEmpty |
|
2162 |
"return true if the receiver contains elements. |
|
2163 |
Reimplemented here for performance." |
|
2164 |
||
2165 |
%{ /* NOCONTEXT */ |
|
2166 |
if (__isArrayLike(self)) { |
|
2167 |
RETURN ( (__arraySize(self) != 0) ? true : false); |
|
2168 |
} |
|
2169 |
%}. |
|
2170 |
^ self size ~~ 0 |
|
2171 |
||
2172 |
"Modified: / 16-02-2017 / 14:59:28 / stefan" |
|
2173 |
! |
|
2174 |
||
2175 |
notEmptyOrNil |
|
2176 |
"return true if the receiver contains elements. |
|
2177 |
Reimplemented here for performance." |
|
2178 |
||
2179 |
%{ /* NOCONTEXT */ |
|
2180 |
if (__isArrayLike(self)) { |
|
2181 |
RETURN ( (__arraySize(self) != 0) ? true : false); |
|
2182 |
} |
|
2183 |
%}. |
|
2184 |
^ self size ~~ 0 |
|
2185 |
||
2186 |
"Created: / 22-02-2017 / 14:09:05 / stefan" |
|
2187 |
! |
|
2188 |
||
1243 | 2189 |
refersToLiteral:aLiteral |
2190 |
"return true if the receiver or recursively any array element in the |
|
16262 | 2191 |
receiver refers to aLiteral (i.e. a deep search)" |
1243 | 2192 |
|
18330 | 2193 |
self do:[:el | |
20706
009b8269bd08
we have class based exceptions - use them
Claus Gittinger <cg@exept.de>
parents:
20543
diff
changeset
|
2194 |
el == aLiteral ifTrue:[^true]. |
009b8269bd08
we have class based exceptions - use them
Claus Gittinger <cg@exept.de>
parents:
20543
diff
changeset
|
2195 |
el isArray ifTrue:[ |
009b8269bd08
we have class based exceptions - use them
Claus Gittinger <cg@exept.de>
parents:
20543
diff
changeset
|
2196 |
(el refersToLiteral: aLiteral) ifTrue: [^true] |
009b8269bd08
we have class based exceptions - use them
Claus Gittinger <cg@exept.de>
parents:
20543
diff
changeset
|
2197 |
] |
543 | 2198 |
]. |
2199 |
^ false |
|
2200 |
||
2201 |
" |
|
14632 | 2202 |
#(1 2 3) refersToLiteral:#foo |
2203 |
#(1 2 3 foo bar baz) refersToLiteral:#foo |
|
2204 |
#(1 2 3 (((bar foo))) bar baz) refersToLiteral:#foo |
|
543 | 2205 |
" |
1243 | 2206 |
|
5537 | 2207 |
"Modified: / 18.8.2000 / 21:18:14 / cg" |
5557 | 2208 |
! |
2209 |
||
14256
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2210 |
refersToLiteralMatching:aMatchPattern |
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2211 |
"return true if the receiver or recursively any array element in the |
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2212 |
receiver is symbolic and matches aMatchPattern (i.e. a deep search)" |
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2213 |
|
14632 | 2214 |
self do:[ :el | |
20706
009b8269bd08
we have class based exceptions - use them
Claus Gittinger <cg@exept.de>
parents:
20543
diff
changeset
|
2215 |
(el isSymbol and:[ aMatchPattern match: el]) ifTrue:[^true]. |
009b8269bd08
we have class based exceptions - use them
Claus Gittinger <cg@exept.de>
parents:
20543
diff
changeset
|
2216 |
el isArray ifTrue:[ |
009b8269bd08
we have class based exceptions - use them
Claus Gittinger <cg@exept.de>
parents:
20543
diff
changeset
|
2217 |
(el refersToLiteralMatching: aMatchPattern) ifTrue: [^true] |
009b8269bd08
we have class based exceptions - use them
Claus Gittinger <cg@exept.de>
parents:
20543
diff
changeset
|
2218 |
] |
14256
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2219 |
]. |
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2220 |
^ false |
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2221 |
|
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2222 |
" |
14632 | 2223 |
#(1 2 3) refersToLiteralMatching:#foo |
2224 |
#(1 2 3 foo bar baz) refersToLiteralMatching:#foo |
|
2225 |
#(1 2 3 (((bar foo))) bar baz) refersToLiteralMatching:#foo |
|
14256
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2226 |
" |
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2227 |
|
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2228 |
"Modified: / 18-08-2000 / 21:18:14 / cg" |
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2229 |
"Created: / 26-07-2012 / 15:38:01 / cg" |
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2230 |
! |
45d30f2f4724
added: #refersToLiteralMatching:
Claus Gittinger <cg@exept.de>
parents:
14158
diff
changeset
|
2231 |
|
5557 | 2232 |
size |
2233 |
"return the number of indexed elements in the receiver. |
|
2234 |
Reimplemented here to avoid the additional size->basicSize send |
|
2235 |
(which we can do here, since when arriving here, #size is obviously not |
|
2236 |
redefined in a subclass). |
|
2237 |
This method is the same as basicSize." |
|
2238 |
||
2239 |
%{ /* NOCONTEXT */ |
|
18246 | 2240 |
#ifdef __SCHTEAM__ |
2241 |
return context._RETURN (STInteger._new(self.basicSize())); |
|
2242 |
#else |
|
5557 | 2243 |
REGISTER OBJ slf = self; |
2244 |
||
8913 | 2245 |
RETURN ( __mkSmallInteger(__arraySize(slf) - __intVal(__ClassInstPtr(__qClass(slf))->c_ninstvars) )); |
18246 | 2246 |
#endif |
5557 | 2247 |
%} |
543 | 2248 |
! ! |
2249 |
||
3088 | 2250 |
!Array methodsFor:'searching'! |
543 | 2251 |
|
14632 | 2252 |
identityIndexOf:anElement or:alternative |
2253 |
"search the array for anElement or alternative; |
|
554 | 2254 |
return the index of anElement if found, or the index of anAlternative, |
2255 |
if not found. If anAlternative is also not found, return 0. |
|
2256 |
This is a special interface for high-speed searching in an array |
|
2257 |
and at the same time searching for an empty slot. |
|
2258 |
Do not use this method for your application classes, since it is |
|
2259 |
not portable (i.e. other smalltalks do not offer this)" |
|
2260 |
||
2261 |
%{ /* NOCONTEXT */ |
|
8913 | 2262 |
REGISTER INT index; |
554 | 2263 |
REGISTER OBJ o, el1, el2; |
2264 |
REGISTER OBJ *op; |
|
8913 | 2265 |
REGISTER unsigned INT nIndex; |
2266 |
INT altIndex = 0; |
|
14687 | 2267 |
INT nInsts; |
554 | 2268 |
|
2269 |
index = 0; |
|
1133 | 2270 |
nInsts = __intVal(__ClassInstPtr(__qClass(self))->c_ninstvars); |
554 | 2271 |
index += nInsts; |
2272 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
14632 | 2273 |
el1 = anElement; el2 = alternative; |
1133 | 2274 |
op = & (__InstPtr(self)->i_instvars[index]); |
554 | 2275 |
while (index++ < nIndex) { |
6497 | 2276 |
if ((o = *op++) == el1) { |
8913 | 2277 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
6497 | 2278 |
} |
2279 |
if (o == el2) { |
|
2280 |
if (altIndex == 0) { |
|
2281 |
altIndex = index; |
|
2282 |
} |
|
2283 |
} |
|
554 | 2284 |
} |
8913 | 2285 |
RETURN ( __mkSmallInteger(altIndex) ); |
5403 | 2286 |
%}. |
2287 |
^ super identityIndexOf:anElement or:alternative |
|
554 | 2288 |
|
2289 |
" |
|
2290 |
#(1 2 3 4 5 6 7 8 9) identityIndexOf:3 or:5 |
|
2291 |
#(1 2 0 4 5 6 7 8 9) identityIndexOf:3 or:5 |
|
2292 |
#(1 2 0 4 5 6 7 3 9) identityIndexOf:3 or:5 |
|
14632 | 2293 |
#(1 2 3 4 5 nil 7 3 9) identityIndexOf:3 or:nil |
2294 |
#(1 2 nil 4 5 6 7 3 9) identityIndexOf:3 or:nil |
|
2295 |
#(1 2 nil 4 5 6 7 8 9) identityIndexOf:3 or:nil |
|
2296 |
#() identityIndexOf:3 or:nil |
|
2297 |
#(1 2) identityIndexOf:3 or:nil |
|
554 | 2298 |
" |
2299 |
! |
|
2300 |
||
543 | 2301 |
identityIndexOf:anElement startingAt:start |
2302 |
"search the array for anElement; return index if found, 0 otherwise |
|
2303 |
- reimplemented for speed" |
|
2304 |
||
2305 |
%{ /* NOCONTEXT */ |
|
2306 |
||
8913 | 2307 |
REGISTER INT index; |
543 | 2308 |
REGISTER OBJ el; |
2309 |
REGISTER OBJ *op; |
|
8913 | 2310 |
REGISTER unsigned INT nIndex; |
14687 | 2311 |
INT nInsts; |
543 | 2312 |
|
2313 |
if (__isSmallInteger(start)) { |
|
21623 | 2314 |
index = __intVal(start) - 1; |
2315 |
if (index >= 0) { |
|
2316 |
nInsts = __intVal(__ClassInstPtr(__qClass(self))->c_ninstvars); |
|
2317 |
index += nInsts; |
|
2318 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
2319 |
el = anElement; |
|
2320 |
op = & (__InstPtr(self)->i_instvars[index]); |
|
1903 | 2321 |
|
2213 | 2322 |
#if defined(memsrch4) |
21623 | 2323 |
if (index < nIndex) { |
2324 |
OBJ *p; |
|
2213 | 2325 |
|
21623 | 2326 |
p = memsrch4(op, (INT)el, (nIndex - index)); |
2327 |
if (p) { |
|
2328 |
index += (p - op + 1); |
|
2329 |
RETURN ( __mkSmallInteger(index) ); |
|
2330 |
} |
|
2331 |
} |
|
2213 | 2332 |
#else |
2216 | 2333 |
|
8919 | 2334 |
# ifdef __UNROLL_LOOPS__ |
21623 | 2335 |
{ |
2336 |
/* |
|
2337 |
* don't argue about those gotos below - they speed up that thing by 30%; |
|
2338 |
* its better to exit the loops below with a goto, |
|
2339 |
* since the generated code will then be: |
|
2340 |
* compare |
|
2341 |
* branch-on-equal found |
|
2342 |
* |
|
2343 |
* otherwise (with ret as if-statement), we get: |
|
2344 |
* compare |
|
2345 |
* branch-on-not-equal skipLabel |
|
2346 |
* move-to-ret-register true |
|
2347 |
* goto ret-label |
|
2348 |
* skipLabel |
|
2349 |
* |
|
2350 |
* therefore, WITH the so-much-blamed goto, we only branch |
|
2351 |
* when found; without the goto, we branch always. |
|
2352 |
* Pipelined CPUs do usually not like taken branches. |
|
2353 |
*/ |
|
2216 | 2354 |
|
21623 | 2355 |
unsigned INT i8; |
14632 | 2356 |
|
21623 | 2357 |
while ((i8 = index + 8) < nIndex) { |
2358 |
if (op[0] == el) goto found1; |
|
2359 |
if (op[1] == el) goto found2; |
|
2360 |
if (op[2] == el) goto found3; |
|
2361 |
if (op[3] == el) goto found4; |
|
2362 |
if (op[4] == el) goto found5; |
|
2363 |
if (op[5] == el) goto found6; |
|
2364 |
if (op[6] == el) goto found7; |
|
2365 |
if (op[7] == el) goto found8; |
|
2366 |
index = i8; |
|
2367 |
op += 8; |
|
2368 |
} |
|
2369 |
if (0) { |
|
2370 |
found1: |
|
2371 |
RETURN ( __mkSmallInteger(index + 1 - nInsts) ); |
|
2372 |
found2: |
|
2373 |
RETURN ( __mkSmallInteger(index + 2 - nInsts) ); |
|
2374 |
found3: |
|
2375 |
RETURN ( __mkSmallInteger(index + 3 - nInsts) ); |
|
2376 |
found4: |
|
2377 |
RETURN ( __mkSmallInteger(index + 4 - nInsts) ); |
|
2378 |
found5: |
|
2379 |
RETURN ( __mkSmallInteger(index + 5 - nInsts) ); |
|
2380 |
found6: |
|
2381 |
RETURN ( __mkSmallInteger(index + 6 - nInsts) ); |
|
2382 |
found7: |
|
2383 |
RETURN ( __mkSmallInteger(index + 7 - nInsts) ); |
|
2384 |
found8: |
|
2385 |
RETURN ( __mkSmallInteger(index + 8 - nInsts) ); |
|
2386 |
} |
|
2387 |
} |
|
8919 | 2388 |
# endif /* __UNROLLED_LOOPS__ */ |
2715
48beff18cec0
software pipeline element access in enumeration method
Claus Gittinger <cg@exept.de>
parents:
2683
diff
changeset
|
2389 |
|
21623 | 2390 |
while (index++ < nIndex) { |
2391 |
if (*op++ == el) goto found0; |
|
2392 |
} |
|
2715
48beff18cec0
software pipeline element access in enumeration method
Claus Gittinger <cg@exept.de>
parents:
2683
diff
changeset
|
2393 |
|
21623 | 2394 |
if (0) { |
2395 |
found0: |
|
2396 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2397 |
} |
|
2715
48beff18cec0
software pipeline element access in enumeration method
Claus Gittinger <cg@exept.de>
parents:
2683
diff
changeset
|
2398 |
#endif /* no memsrch */ |
21623 | 2399 |
} |
2400 |
RETURN ( __mkSmallInteger(0) ); |
|
543 | 2401 |
} |
2402 |
%}. |
|
5403 | 2403 |
^ super identityIndexOf:anElement startingAt:start |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2404 |
! |
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2405 |
|
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2406 |
identityIndexOf:anElement startingAt:start endingAt:stop |
14632 | 2407 |
"search the array for anElement in the range start..stop; |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2408 |
return the index if found, 0 otherwise. |
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2409 |
- reimplemented for speed when searching in OrderedCollections" |
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2410 |
|
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2411 |
%{ /* NOCONTEXT */ |
18311 | 2412 |
#ifdef __SCHTEAM__ |
2413 |
if (start.isSmallInteger() |
|
2414 |
&& stop.isSmallInteger()) { |
|
2415 |
if (self.isVector()) { |
|
2416 |
int _start = start.intValue() - 1; |
|
2417 |
int _stop = stop.intValue() - 1; |
|
2418 |
for (int i=_start; i<=_stop; i++) { |
|
2419 |
if (self.vectorRef(i) == anElement) { |
|
2420 |
return context._RETURN(i+1); |
|
2421 |
} |
|
2422 |
} |
|
2423 |
return context._RETURN(STInteger._0); |
|
2424 |
} |
|
2425 |
} |
|
2426 |
#else |
|
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2427 |
|
8913 | 2428 |
REGISTER INT index; |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2429 |
REGISTER OBJ el; |
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2430 |
REGISTER OBJ *op; |
14687 | 2431 |
REGISTER unsigned INT lastIndex; |
8913 | 2432 |
unsigned INT nIndex; |
14687 | 2433 |
INT nInsts; |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2434 |
|
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2435 |
if (__bothSmallInteger(start, stop)) { |
6497 | 2436 |
index = __intVal(start) - 1; |
2437 |
if (index >= 0) { |
|
2438 |
nInsts = __intVal(__ClassInstPtr(__qClass(self))->c_ninstvars); |
|
2439 |
index += nInsts; |
|
2440 |
lastIndex = nInsts + __intVal(stop); |
|
2441 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
2442 |
if (nIndex < lastIndex) { |
|
2443 |
lastIndex = nIndex; |
|
2444 |
} |
|
2445 |
el = anElement; |
|
2446 |
op = & (__InstPtr(self)->i_instvars[index]); |
|
2213 | 2447 |
|
2448 |
#if defined(memsrch4) |
|
6497 | 2449 |
if (index < lastIndex) { |
2450 |
OBJ *p; |
|
2216 | 2451 |
|
6497 | 2452 |
p = memsrch4(op, (INT)el, (lastIndex - index)); |
2453 |
if (p) { |
|
2454 |
index += (p - op + 1); |
|
14632 | 2455 |
RETURN ( __mkSmallInteger(index) ); |
6497 | 2456 |
} |
2457 |
} |
|
2216 | 2458 |
#else |
2213 | 2459 |
|
8919 | 2460 |
# ifdef __UNROLL_LOOPS__ |
6497 | 2461 |
{ |
14687 | 2462 |
unsigned INT i8; |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2463 |
|
6497 | 2464 |
while ((i8 = index + 8) < lastIndex) { |
2465 |
if (op[0] == el) goto found1; |
|
2466 |
if (op[1] == el) goto found2; |
|
2467 |
if (op[2] == el) goto found3; |
|
2468 |
if (op[3] == el) goto found4; |
|
2469 |
if (op[4] == el) goto found5; |
|
2470 |
if (op[5] == el) goto found6; |
|
2471 |
if (op[6] == el) goto found7; |
|
2472 |
if (op[7] == el) goto found8; |
|
2473 |
index = i8; |
|
2474 |
op += 8; |
|
2475 |
} |
|
2715
48beff18cec0
software pipeline element access in enumeration method
Claus Gittinger <cg@exept.de>
parents:
2683
diff
changeset
|
2476 |
|
6497 | 2477 |
if (0) { |
2478 |
found1: |
|
8913 | 2479 |
RETURN ( __mkSmallInteger(index + 1 - nInsts) ); |
6497 | 2480 |
found2: |
8913 | 2481 |
RETURN ( __mkSmallInteger(index + 2 - nInsts) ); |
6497 | 2482 |
found3: |
8913 | 2483 |
RETURN ( __mkSmallInteger(index + 3 - nInsts) ); |
6497 | 2484 |
found4: |
8913 | 2485 |
RETURN ( __mkSmallInteger(index + 4 - nInsts) ); |
6497 | 2486 |
found5: |
8913 | 2487 |
RETURN ( __mkSmallInteger(index + 5 - nInsts) ); |
6497 | 2488 |
found6: |
8913 | 2489 |
RETURN ( __mkSmallInteger(index + 6 - nInsts) ); |
6497 | 2490 |
found7: |
8913 | 2491 |
RETURN ( __mkSmallInteger(index + 7 - nInsts) ); |
6497 | 2492 |
found8: |
8913 | 2493 |
RETURN ( __mkSmallInteger(index + 8 - nInsts) ); |
6497 | 2494 |
} |
2495 |
} |
|
8919 | 2496 |
# endif /* __UNROLL_LOOPS__ */ |
2715
48beff18cec0
software pipeline element access in enumeration method
Claus Gittinger <cg@exept.de>
parents:
2683
diff
changeset
|
2497 |
|
6497 | 2498 |
while (index++ < lastIndex) { |
2499 |
if (*op++ == el) goto found0; |
|
2500 |
} |
|
2715
48beff18cec0
software pipeline element access in enumeration method
Claus Gittinger <cg@exept.de>
parents:
2683
diff
changeset
|
2501 |
|
6497 | 2502 |
if (0) { |
2503 |
found0: |
|
8913 | 2504 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
6497 | 2505 |
} |
2213 | 2506 |
#endif |
6497 | 2507 |
} |
8913 | 2508 |
RETURN ( __mkSmallInteger(0) ); |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2509 |
} |
18311 | 2510 |
#endif /*not SCHTEAM */ |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2511 |
%}. |
5403 | 2512 |
^ super identityIndexOf:anElement startingAt:start endingAt:stop |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2513 |
|
543 | 2514 |
! |
2515 |
||
554 | 2516 |
indexOf:anElement startingAt:start |
2517 |
"search the array for anElement; return index if found, 0 otherwise |
|
2518 |
- reimplemented for speed" |
|
543 | 2519 |
|
554 | 2520 |
|element| |
2521 |
%{ |
|
8913 | 2522 |
REGISTER INT index; |
2523 |
unsigned INT nIndex; |
|
14687 | 2524 |
unsigned INT nInsts; |
554 | 2525 |
static struct inlineCache eq = _ILC1; |
4130
662554f2a37c
avoid refetch of void variables (if possible)
Claus Gittinger <cg@exept.de>
parents:
4122
diff
changeset
|
2526 |
OBJ myClass, e; |
543 | 2527 |
|
2184
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
2528 |
myClass = __qClass(self); |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
2529 |
if ( __isSmallInteger(start) ) { |
23362 | 2530 |
index = __intVal(start) - 1; |
2531 |
if (index >= 0) { |
|
2532 |
nInsts = __intVal(__ClassInstPtr(myClass)->c_ninstvars); |
|
2533 |
index += nInsts; |
|
2534 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
2535 |
||
2536 |
e = anElement; |
|
2537 |
if (e != nil) { |
|
2538 |
/* |
|
2539 |
* special kludge to search for a string; |
|
2540 |
* this is so common, that its worth a special case |
|
2541 |
*/ |
|
825
f7b73d83b9d4
optimized search for strings (dont know if its worth it ...)
Claus Gittinger <cg@exept.de>
parents:
788
diff
changeset
|
2542 |
#define SPECIAL_STRING_OPT |
f7b73d83b9d4
optimized search for strings (dont know if its worth it ...)
Claus Gittinger <cg@exept.de>
parents:
788
diff
changeset
|
2543 |
#ifdef SPECIAL_STRING_OPT |
23362 | 2544 |
if (__isStringLike(e)) { |
2545 |
while (index < nIndex) { |
|
2546 |
element = __InstPtr(self)->i_instvars[index++]; |
|
2547 |
if (__isNonNilObject(element)) { |
|
2548 |
if (element == e) { |
|
2549 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2550 |
} |
|
2551 |
if (__isStringLike(element)) { |
|
2552 |
if (strcmp(__stringVal(e), __stringVal(element)) == 0) { |
|
2553 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2554 |
} |
|
2555 |
} else { |
|
2556 |
if ((*eq.ilc_func)(e, @symbol(=), nil,&eq, element) == true) { |
|
2557 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2558 |
} |
|
2559 |
/* |
|
2560 |
* send of #= could have lead to a GC - refetch e |
|
2561 |
*/ |
|
2562 |
e = anElement; |
|
2563 |
} |
|
2564 |
} |
|
2565 |
} |
|
2566 |
RETURN (__mkSmallInteger(0)); |
|
2567 |
} |
|
825
f7b73d83b9d4
optimized search for strings (dont know if its worth it ...)
Claus Gittinger <cg@exept.de>
parents:
788
diff
changeset
|
2568 |
#endif |
14380
06aa294b80fa
changed: #indexOf:startingAt:
Claus Gittinger <cg@exept.de>
parents:
14256
diff
changeset
|
2569 |
#ifdef MAKES_IT_SLOWER_BUT_WHY |
23362 | 2570 |
if (__isSmallInteger(e)) { |
2571 |
/* search for a small number */ |
|
2572 |
while (index < nIndex) { |
|
2573 |
element = __InstPtr(self)->i_instvars[index++]; |
|
2574 |
if (element == e) { |
|
2575 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2576 |
} |
|
2577 |
if (!__isSmallInteger(element)) { |
|
2578 |
if (element != nil) { |
|
2579 |
if ((*eq.ilc_func)(e, |
|
2580 |
@symbol(=), |
|
2581 |
nil,&eq, |
|
2582 |
element) == true) { |
|
2583 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2584 |
} |
|
2585 |
/* |
|
2586 |
* send of #= could have lead to a GC - refetch e |
|
2587 |
*/ |
|
2588 |
e = anElement; |
|
2589 |
} |
|
2590 |
} |
|
2591 |
} |
|
2592 |
RETURN (__mkSmallInteger(0)); |
|
2593 |
} |
|
14380
06aa294b80fa
changed: #indexOf:startingAt:
Claus Gittinger <cg@exept.de>
parents:
14256
diff
changeset
|
2594 |
#endif /* MAKES_IT_SLOWER_BUT_WHY */ |
4130
662554f2a37c
avoid refetch of void variables (if possible)
Claus Gittinger <cg@exept.de>
parents:
4122
diff
changeset
|
2595 |
|
23362 | 2596 |
while (index < nIndex) { |
2597 |
element = __InstPtr(self)->i_instvars[index++]; |
|
2598 |
if (element != nil) { |
|
2599 |
if ((element == e) |
|
2600 |
|| ((*eq.ilc_func)(e, |
|
2601 |
@symbol(=), |
|
2602 |
nil,&eq, |
|
2603 |
element) == true)) { |
|
2604 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2605 |
} |
|
2606 |
/* |
|
2607 |
* send of #= could have lead to a GC - refetch e |
|
2608 |
*/ |
|
2609 |
e = anElement; |
|
2610 |
} |
|
2611 |
} |
|
2612 |
} else { |
|
2613 |
OBJ slf = self; |
|
2614 |
||
2615 |
/* |
|
2616 |
* search for nil - do an identity-search |
|
2617 |
*/ |
|
8919 | 2618 |
#ifdef __UNROLL_LOOPS__ |
23362 | 2619 |
{ |
2620 |
unsigned INT i8; |
|
2621 |
||
2622 |
while ((i8 = index + 8) < nIndex) { |
|
2623 |
if (__InstPtr(slf)->i_instvars[index] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 1) ); } |
|
2624 |
if (__InstPtr(slf)->i_instvars[index+1] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 2) ); } |
|
2625 |
if (__InstPtr(slf)->i_instvars[index+2] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 3) ); } |
|
2626 |
if (__InstPtr(slf)->i_instvars[index+3] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 4) ); } |
|
2627 |
if (__InstPtr(slf)->i_instvars[index+4] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 5) ); } |
|
2628 |
if (__InstPtr(slf)->i_instvars[index+5] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 6) ); } |
|
2629 |
if (__InstPtr(slf)->i_instvars[index+6] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 7) ); } |
|
2630 |
if (__InstPtr(slf)->i_instvars[index+7] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 8) ); } |
|
2631 |
index = i8; |
|
2632 |
} |
|
2633 |
} |
|
554 | 2634 |
#endif |
2635 |
||
23362 | 2636 |
while (index < nIndex) { |
2637 |
if (__InstPtr(slf)->i_instvars[index++] == nil) { |
|
2638 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2639 |
} |
|
2640 |
} |
|
2641 |
} |
|
2642 |
} |
|
2643 |
RETURN (__mkSmallInteger(0)); |
|
543 | 2644 |
} |
554 | 2645 |
%}. |
2184
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
2646 |
^ super indexOf:anElement startingAt:start |
23362 | 2647 |
|
2648 |
"Modified: / 18-09-2018 / 15:02:21 / Stefan Vogel" |
|
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2649 |
! |
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2650 |
|
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2651 |
indexOf:anElement startingAt:start endingAt:stop |
14632 | 2652 |
"search the array for anElement in the range start..stop; |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2653 |
Return the index if found, 0 otherwise. |
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2654 |
- reimplemented for speed when searching in OrderedCollections" |
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2655 |
|
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2656 |
|element| |
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2657 |
%{ |
8913 | 2658 |
REGISTER INT index; |
2659 |
unsigned INT lastIndex, nIndex; |
|
14687 | 2660 |
unsigned INT nInsts; |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2661 |
static struct inlineCache eq = _ILC1; |
4130
662554f2a37c
avoid refetch of void variables (if possible)
Claus Gittinger <cg@exept.de>
parents:
4122
diff
changeset
|
2662 |
OBJ myClass, e; |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2663 |
|
2184
f25db3e10530
no block-copy operations are allowed with WeakArrays
Claus Gittinger <cg@exept.de>
parents:
2145
diff
changeset
|
2664 |
myClass = __qClass(self); |
2357
061dadc13df1
removed WEAKPOINTER checks - WeakArray is no longer allowed to be a subclass of Array
Claus Gittinger <cg@exept.de>
parents:
2318
diff
changeset
|
2665 |
if ( __bothSmallInteger(start, stop) ) { |
23362 | 2666 |
index = __intVal(start) - 1; |
2667 |
if (index >= 0) { |
|
2668 |
nInsts = __intVal(__ClassInstPtr(myClass)->c_ninstvars); |
|
2669 |
index += nInsts; |
|
2670 |
lastIndex = nInsts + __intVal(stop); |
|
2671 |
nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
2672 |
if (nIndex < lastIndex) { |
|
2673 |
lastIndex = nIndex; |
|
2674 |
} |
|
2675 |
||
2676 |
e = anElement; |
|
2677 |
||
2678 |
if (e != nil) { |
|
2679 |
/* |
|
2680 |
* special kludge to search for a string; |
|
2681 |
* this is so common, that its worth a special case |
|
2682 |
*/ |
|
4130
662554f2a37c
avoid refetch of void variables (if possible)
Claus Gittinger <cg@exept.de>
parents:
4122
diff
changeset
|
2683 |
#define SPECIAL_STRING_OPT |
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2684 |
#ifdef SPECIAL_STRING_OPT |
23362 | 2685 |
if (__isStringLike(e)) { |
2686 |
while (index < lastIndex) { |
|
2687 |
element = __InstPtr(self)->i_instvars[index++]; |
|
2688 |
if (__isNonNilObject(element)) { |
|
2689 |
if (element == e) { |
|
2690 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2691 |
} |
|
2692 |
if (__isStringLike(element)) { |
|
2693 |
if (strcmp(__stringVal(e), __stringVal(element)) == 0) { |
|
2694 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2695 |
} |
|
2696 |
} else { |
|
2697 |
if ((*eq.ilc_func)(e, @symbol(=), nil,&eq, element) == true) { |
|
2698 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2699 |
} |
|
2700 |
/* |
|
2701 |
* send of #= could have lead to a GC - refetch e |
|
2702 |
*/ |
|
2703 |
e = anElement; |
|
2704 |
} |
|
2705 |
} |
|
2706 |
} |
|
2707 |
RETURN (__mkSmallInteger(0)); |
|
2708 |
} |
|
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2709 |
#endif |
23362 | 2710 |
if (__isSmallInteger(e)) { |
2711 |
/* search for a small number */ |
|
2712 |
while (index < lastIndex) { |
|
2713 |
element = __InstPtr(self)->i_instvars[index++]; |
|
2714 |
if (element == e) { |
|
2715 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2716 |
} |
|
2717 |
if (!__isSmallInteger(element)) { |
|
2718 |
if ((*eq.ilc_func)(e, |
|
2719 |
@symbol(=), |
|
2720 |
nil,&eq, |
|
2721 |
element) == true) { |
|
2722 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2723 |
} |
|
2724 |
/* |
|
2725 |
* send of #= could have lead to a GC - refetch e |
|
2726 |
*/ |
|
2727 |
e = anElement; |
|
2728 |
} |
|
2729 |
} |
|
2730 |
RETURN (__mkSmallInteger(0)); |
|
2731 |
} |
|
2732 |
||
2733 |
while (index < lastIndex) { |
|
2734 |
element = __InstPtr(self)->i_instvars[index++]; |
|
2735 |
if (element != nil) { |
|
2736 |
e = anElement; |
|
2737 |
if ((element == e) |
|
2738 |
|| ((*eq.ilc_func)(e, |
|
2739 |
@symbol(=), |
|
2740 |
nil,&eq, |
|
2741 |
element) == true)) { |
|
2742 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2743 |
} |
|
2744 |
} |
|
2745 |
} |
|
2746 |
} else { |
|
2747 |
OBJ slf = self; |
|
2748 |
||
2749 |
/* |
|
2750 |
* search for nil - do an identity-search |
|
2751 |
*/ |
|
8919 | 2752 |
#ifdef __UNROLL_LOOPS__ |
23362 | 2753 |
{ |
2754 |
unsigned INT i8; |
|
2755 |
||
2756 |
while ((i8 = index + 8) < lastIndex) { |
|
2757 |
if (__InstPtr(slf)->i_instvars[index] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 1) ); } |
|
2758 |
if (__InstPtr(slf)->i_instvars[index+1] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 2) ); } |
|
2759 |
if (__InstPtr(slf)->i_instvars[index+2] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 3) ); } |
|
2760 |
if (__InstPtr(slf)->i_instvars[index+3] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 4) ); } |
|
2761 |
if (__InstPtr(slf)->i_instvars[index+4] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 5) ); } |
|
2762 |
if (__InstPtr(slf)->i_instvars[index+5] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 6) ); } |
|
2763 |
if (__InstPtr(slf)->i_instvars[index+6] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 7) ); } |
|
2764 |
if (__InstPtr(slf)->i_instvars[index+7] == nil) { RETURN ( __mkSmallInteger(index - nInsts + 8) ); } |
|
2765 |
index = i8; |
|
2766 |
} |
|
2767 |
} |
|
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2768 |
#endif |
23362 | 2769 |
while (index < lastIndex) { |
2770 |
if (__InstPtr(slf)->i_instvars[index++] == nil) { |
|
2771 |
RETURN ( __mkSmallInteger(index - nInsts) ); |
|
2772 |
} |
|
2773 |
} |
|
2774 |
} |
|
2775 |
} |
|
2776 |
RETURN (__mkSmallInteger(0)); |
|
1158
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2777 |
} |
bf9aec9e892c
added range search (mostly for big orderedCollections)
Claus Gittinger <cg@exept.de>
parents:
1143
diff
changeset
|
2778 |
%}. |
2211
289095fe875a
oops - must send super indeOf...endingAt:
Claus Gittinger <cg@exept.de>
parents:
2210
diff
changeset
|
2779 |
^ super indexOf:anElement startingAt:start endingAt:stop |
23362 | 2780 |
|
2781 |
"Modified: / 18-09-2018 / 15:02:02 / Stefan Vogel" |
|
23359 | 2782 |
! |
2783 |
||
2784 |
indexOf:anElement startingAt:start step:stepArg |
|
2785 |
"search the array for anElement; return index if found, 0 otherwise |
|
2786 |
- reimplemented for speed" |
|
2787 |
||
2788 |
|element elementIsSharedInstance| |
|
2789 |
||
23361 | 2790 |
elementIsSharedInstance := anElement isImmediate. |
23359 | 2791 |
|
2792 |
%{ |
|
2793 |
static struct inlineCache eq = _ILC1; |
|
2794 |
||
2795 |
if ( __bothSmallInteger(start, stepArg) ) { |
|
2796 |
INT index = __intVal(start) - 1; |
|
2797 |
if (index >= 0) { |
|
2798 |
INT step = __intVal(stepArg); |
|
2799 |
unsigned INT nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE); |
|
2800 |
OBJ e = anElement; |
|
2801 |
unsigned INT nInsts = __intVal(__ClassInstPtr(__qClass(self))->c_ninstvars); |
|
2802 |
index += nInsts; |
|
2803 |
||
2804 |
if (elementIsSharedInstance == false) { |
|
2805 |
/* |
|
2806 |
* special kludge to search for a string; |
|
2807 |
* this is so common, that its worth a special case |
|
2808 |
*/ |
|
2809 |
#define SPECIAL_STRING_OPT |
|
2810 |
#ifdef SPECIAL_STRING_OPT |
|
2811 |
if (__isStringLike(e)) { |
|
2812 |
for ( ;index < nIndex; index += step) { |
|
2813 |
element = __InstPtr(self)->i_instvars[index]; |
|
2814 |
if (__isNonNilObject(element)) { |
|
2815 |
if (element == e) { |
|
2816 |
RETURN ( __mkSmallInteger(index+1 - nInsts) ); |
|
2817 |
} |
|
23362 | 2818 |
if (__isStringLike(element)) { |
23359 | 2819 |
if (strcmp(__stringVal(e), __stringVal(element)) == 0) { |
2820 |
RETURN ( __mkSmallInteger(index+1 - nInsts) ); |
|
2821 |
} |
|
2822 |
} else { |
|
2823 |
if ((*eq.ilc_func)(e, @symbol(=), nil,&eq, element) == true) { |
|
2824 |
RETURN ( __mkSmallInteger(index+1 - nInsts) ); |
|
2825 |
} |
|
2826 |
/* |
|
2827 |
* send of #= could have lead to a GC - refetch e |
|
2828 |
*/ |
|
2829 |
e = anElement; |
|
2830 |
} |
|
2831 |
} |
|
2832 |
} |
|
2833 |
RETURN (__mkSmallInteger(0)); |
|
2834 |
} |
|
2835 |
#endif |
|
2836 |
||
2837 |
for ( ;index < nIndex; index += step) { |
|
2838 |
element = __InstPtr(self)->i_instvars[index]; |
|
2839 |
if (element != nil) { |
|
2840 |
if ((element == e) |
|
2841 |
|| ((*eq.ilc_func)(e, |
|
2842 |
@symbol(=), |
|
2843 |
nil,&eq, |
|
2844 |
element) == true)) { |
|
2845 |
RETURN ( __mkSmallInteger(index + 1 - nInsts) ); |
|
2846 |
} |
|
2847 |
/* |
|
2848 |
* send of #= could have lead to a GC - refetch e |
|
2849 |
*/ |
|
2850 |
e = anElement; |
|
2851 |
} |
|
2852 |
} |
|
2853 |
} else { |
|
2854 |
OBJ slf = self; |
|
2855 |
||
2856 |
/* |
|
2857 |
* search for a sharedInstance - do an identity-search |
|
2858 |
*/ |
|
2859 |
for ( ; index < nIndex; index += step) { |
|
2860 |
if (__InstPtr(slf)->i_instvars[index] == e) { |
|
2861 |
RETURN ( __mkSmallInteger(index + 1 - nInsts) ); |
|
2862 |
} |
|
2863 |
} |
|
2864 |
} |
|
2865 |
} |
|
2866 |
RETURN (__mkSmallInteger(0)); |
|
2867 |
} |
|
2868 |
%}. |
|
2869 |
^ super indexOf:anElement startingAt:start step:stepArg |
|
2870 |
||
2871 |
" |
|
2872 |
#(1 2 3 4 5 6 7) indexOf:5 startingAt:1 step:2 |
|
2873 |
#(1 2 3 4 5 6 7) indexOf:6 startingAt:1 step:2 |
|
2874 |
#(1 2 3 4 5 6 bla) indexOf:#bla startingAt:1 step:2 |
|
2875 |
#(1 2 3 4 5 6 'bla') indexOf:'bla' startingAt:1 step:2 |
|
23362 | 2876 |
#(1 2 3 4 5 6 'bla') indexOf:#bla startingAt:1 step:2 |
23359 | 2877 |
" |
2878 |
||
2879 |
"Created: / 18-09-2018 / 14:05:53 / Stefan Vogel" |
|
1 | 2880 |
! ! |
543 | 2881 |
|
3088 | 2882 |
!Array methodsFor:'testing'! |
2883 |
||
5554 | 2884 |
isArray |
2885 |
"return true, if the receiver is some kind of array (or weakArray etc). |
|
2886 |
true is returned here." |
|
2887 |
||
2888 |
^ true |
|
2889 |
! |
|
2890 |
||
2891 |
isLiteral |
|
2892 |
"return true, if the receiver can be used as a literal constant in ST syntax |
|
2893 |
(i.e. can be used in constant arrays)" |
|
2894 |
||
2895 |
"/ no, simply returning true here is a mistake: |
|
14632 | 2896 |
"/ it could be a subclass of Array |
5554 | 2897 |
"/ (of which the compiler does not know at all ...) |
2898 |
self class == Array ifFalse:[^ false]. |
|
2899 |
||
2900 |
"/ |
|
2901 |
"/ care for recursive arrays ... |
|
2902 |
"/ |
|
2903 |
thisContext isRecursive ifTrue:[^ false]. |
|
10089
833fffc641ef
code cleanup: use #conform instead of explicit loop
Claus Gittinger <cg@exept.de>
parents:
9360
diff
changeset
|
2904 |
^ self conform:[:element | element isLiteral]. |
5554 | 2905 |
|
10089
833fffc641ef
code cleanup: use #conform instead of explicit loop
Claus Gittinger <cg@exept.de>
parents:
9360
diff
changeset
|
2906 |
"Modified: / 13-10-2006 / 13:00:45 / cg" |
3088 | 2907 |
! ! |
2908 |
||
4681 | 2909 |
!Array methodsFor:'tracing'! |
2910 |
||
2911 |
traceInto:aRequestor level:level from:referrer |
|
2912 |
"double dispatch into tracer, passing my type implicitely in the selector" |
|
2913 |
||
2914 |
^ aRequestor traceArray:self level:level from:referrer |
|
2915 |
||
2916 |
||
2917 |
! ! |
|
2918 |
||
1903 | 2919 |
!Array class methodsFor:'documentation'! |
626 | 2920 |
|
2921 |
version |
|
18579 | 2922 |
^ '$Header$' |
12162
32aa3e64c889
comment/format in: #printOn:
Claus Gittinger <cg@exept.de>
parents:
11797
diff
changeset
|
2923 |
! |
32aa3e64c889
comment/format in: #printOn:
Claus Gittinger <cg@exept.de>
parents:
11797
diff
changeset
|
2924 |
|
32aa3e64c889
comment/format in: #printOn:
Claus Gittinger <cg@exept.de>
parents:
11797
diff
changeset
|
2925 |
version_CVS |
18579 | 2926 |
^ '$Header$' |
1244 | 2927 |
! ! |
21793 | 2928 |