4740
|
1 |
"{ Encoding: utf8 }"
|
|
2 |
|
1042
|
3 |
"
|
|
4 |
COPYRIGHT (c) 2002 by eXept Software AG
|
|
5 |
All Rights Reserved
|
|
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 |
"
|
|
14 |
"{ Package: 'stx:libbasic2' }"
|
|
15 |
|
3975
|
16 |
"{ NameSpace: Smalltalk }"
|
|
17 |
|
1515
|
18 |
ProtoObject subclass:#LazyValue
|
3975
|
19 |
instanceVariableNames:'result block lock'
|
|
20 |
classVariableNames:''
|
1042
|
21 |
poolDictionaries:''
|
|
22 |
category:'Kernel-Processes'
|
|
23 |
!
|
|
24 |
|
|
25 |
!LazyValue class methodsFor:'documentation'!
|
|
26 |
|
|
27 |
copyright
|
|
28 |
"
|
|
29 |
COPYRIGHT (c) 2002 by eXept Software AG
|
|
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 |
|
|
41 |
documentation
|
|
42 |
"
|
|
43 |
I represent an expression which might not be needed.
|
|
44 |
Any messages sent to me will force the evaluation (once).
|
|
45 |
The value is remembered.
|
|
46 |
|
|
47 |
Can be used to simulate non-strict programming languages.
|
|
48 |
|
|
49 |
[see also:]
|
4740
|
50 |
Block Future Lazy
|
1042
|
51 |
|
|
52 |
[author:]
|
|
53 |
Claus Gittinger
|
|
54 |
"
|
|
55 |
!
|
|
56 |
|
4798
|
57 |
example3
|
|
58 |
"an infinite list"
|
|
59 |
|
|
60 |
|gen infiniteList|
|
|
61 |
|
|
62 |
gen := [:n |
|
|
63 |
Cons
|
|
64 |
car:n
|
|
65 |
cdr:[ gen value:(n+1) ] lazyValue
|
|
66 |
].
|
|
67 |
|
|
68 |
infiniteList := gen value:1.
|
|
69 |
1 to:10 do:[:i |
|
|
70 |
Transcript showCR:infiniteList car.
|
|
71 |
infiniteList := infiniteList cdr.
|
|
72 |
].
|
|
73 |
Transcript
|
|
74 |
show:'next 20 elements: ';
|
|
75 |
showCR:(infiniteList take:20) asArray.
|
|
76 |
|
|
77 |
"
|
|
78 |
self example3
|
|
79 |
"
|
|
80 |
!
|
|
81 |
|
|
82 |
example4
|
|
83 |
"an infinite list of primes"
|
|
84 |
|
|
85 |
|gen listOfPrimes isEmirp|
|
|
86 |
|
|
87 |
isEmirp := [:p | p printString reversed asNumber isPrime].
|
|
88 |
|
|
89 |
gen := [:n |
|
|
90 |
Cons
|
|
91 |
car:n
|
|
92 |
cdr:[ gen value:(n nextPrime) ] lazyValue
|
|
93 |
].
|
|
94 |
|
|
95 |
|
|
96 |
listOfPrimes := gen value:2.
|
|
97 |
Transcript
|
|
98 |
show:'first 100 primes: ';
|
|
99 |
showCR:(listOfPrimes take:100) asArray.
|
|
100 |
|
|
101 |
"
|
|
102 |
self example4
|
|
103 |
"
|
|
104 |
!
|
|
105 |
|
|
106 |
example5
|
|
107 |
"an infinite list of emirps"
|
|
108 |
|
|
109 |
|primeGen listOfPrimes isEmirp emirpGen listOfEmirps |
|
|
110 |
|
|
111 |
isEmirp :=
|
|
112 |
[:p | |e|
|
|
113 |
(e := p printString reversed asNumber) isPrime
|
|
114 |
and:[ e ~= p ]
|
|
115 |
].
|
|
116 |
|
|
117 |
primeGen :=
|
|
118 |
[:n |
|
|
119 |
LazyCons car:n cdr:[primeGen value:(n nextPrime)]
|
|
120 |
].
|
|
121 |
|
|
122 |
emirpGen :=
|
|
123 |
[:l | |lR el|
|
|
124 |
|
|
125 |
lR := l.
|
|
126 |
[ el := lR car. lR := lR cdr. isEmirp value:el ] whileFalse.
|
|
127 |
LazyCons car:el cdr:[emirpGen value:lR]
|
|
128 |
].
|
|
129 |
|
|
130 |
listOfPrimes := primeGen value:2.
|
|
131 |
listOfEmirps := emirpGen value:listOfPrimes.
|
|
132 |
|
|
133 |
Transcript
|
|
134 |
show:'first 20 emirps: ';
|
|
135 |
showCR:(listOfEmirps take:20) asArray.
|
|
136 |
|
|
137 |
Transcript
|
|
138 |
show:'emirps between 7700 and 8000 are: ';
|
|
139 |
showCR:((7700 to:8000) select:[:n | n isPrime and:[isEmirp value:n]]).
|
|
140 |
|
|
141 |
Transcript
|
|
142 |
show:'10000''th emirp: ';
|
|
143 |
showCR:(listOfEmirps nth:10000).
|
|
144 |
|
|
145 |
"
|
|
146 |
self example5
|
|
147 |
"
|
|
148 |
!
|
|
149 |
|
1042
|
150 |
examples
|
|
151 |
"
|
1071
|
152 |
[exBegin]
|
|
153 |
|x|
|
|
154 |
|
|
155 |
x := LazyValue block:[ Transcript flash. 1234 ].
|
|
156 |
Delay waitForSeconds:4.
|
|
157 |
Transcript showCR:x printString
|
|
158 |
[exEnd]
|
|
159 |
|
1042
|
160 |
listFrom:n - an infinite list of integers starting with n
|
|
161 |
[exBegin]
|
|
162 |
|gen infiniteList|
|
|
163 |
|
|
164 |
gen := [:n |
|
|
165 |
Cons
|
|
166 |
car:n
|
|
167 |
cdr:( LazyValue block:[gen value:n+1] )
|
|
168 |
].
|
|
169 |
|
|
170 |
infiniteList := gen value:1.
|
|
171 |
1 to:10 do:[:i |
|
|
172 |
Transcript showCR:infiniteList car.
|
|
173 |
infiniteList := infiniteList cdr.
|
|
174 |
].
|
|
175 |
[exEnd]
|
|
176 |
|
|
177 |
filterOdd:l - an infinite list filtering odd numbers from another list
|
|
178 |
[exBegin]
|
|
179 |
|gen infiniteList genOdd infiniteOdd|
|
|
180 |
|
|
181 |
gen := [:n |
|
|
182 |
Cons
|
|
183 |
car:n
|
|
184 |
cdr:( LazyValue block:[gen value:n+1] )
|
|
185 |
].
|
|
186 |
|
|
187 |
infiniteList := gen value:1.
|
|
188 |
|
|
189 |
genOdd := [:l |
|
|
190 |
|lR el|
|
|
191 |
|
|
192 |
lR := l.
|
|
193 |
[ el := lR car. lR := lR cdr. el odd ] whileFalse:[].
|
|
194 |
Cons
|
|
195 |
car:el
|
|
196 |
cdr:( LazyValue block:[genOdd value:lR] )
|
|
197 |
].
|
|
198 |
|
|
199 |
infiniteOdd := genOdd value:infiniteList.
|
|
200 |
|
|
201 |
1 to:10 do:[:i |
|
|
202 |
Transcript showCR:infiniteOdd car.
|
|
203 |
infiniteOdd := infiniteOdd cdr.
|
|
204 |
].
|
|
205 |
[exEnd]
|
|
206 |
|
|
207 |
powersOf:n - an infinite list of powers of n
|
|
208 |
[exBegin]
|
|
209 |
|genPowersOf infiniteListOfPowers|
|
|
210 |
|
|
211 |
genPowersOf := [:base |
|
|
212 |
|powersOfBase|
|
|
213 |
|
|
214 |
powersOfBase :=
|
|
215 |
[:n |
|
|
216 |
Cons
|
|
217 |
car:n
|
|
218 |
cdr:( LazyValue block:[powersOfBase value:n*base] )
|
|
219 |
].
|
|
220 |
powersOfBase value:1.
|
|
221 |
].
|
|
222 |
|
|
223 |
infiniteListOfPowers := genPowersOf value:2.
|
|
224 |
1 to:10 do:[:i |
|
|
225 |
Transcript showCR:infiniteListOfPowers car.
|
|
226 |
infiniteListOfPowers := infiniteListOfPowers cdr.
|
|
227 |
].
|
|
228 |
[exEnd]
|
|
229 |
|
|
230 |
merge2:a _:b - merge 2 lists.
|
|
231 |
[exBegin]
|
|
232 |
|genMerge2 l gen infiniteList genOdd infiniteOdd genEven infiniteEven genMerge|
|
|
233 |
|
|
234 |
gen := [:n |
|
|
235 |
Cons
|
|
236 |
car:n
|
|
237 |
cdr:( LazyValue block:[gen value:n+1] )
|
|
238 |
].
|
|
239 |
|
|
240 |
infiniteList := gen value:1.
|
|
241 |
|
|
242 |
genOdd := [:l |
|
|
243 |
|lR el|
|
|
244 |
|
|
245 |
lR := l.
|
|
246 |
[ el := lR car. lR := lR cdr. el odd ] whileFalse:[].
|
|
247 |
Cons
|
|
248 |
car:el
|
|
249 |
cdr:( LazyValue block:[genOdd value:lR] )
|
|
250 |
].
|
|
251 |
|
|
252 |
infiniteOdd := genOdd value:infiniteList.
|
|
253 |
|
|
254 |
genEven := [:l |
|
|
255 |
|lR el|
|
|
256 |
|
|
257 |
lR := l.
|
|
258 |
[ el := lR car. lR := lR cdr. el even ] whileFalse:[].
|
|
259 |
Cons
|
|
260 |
car:el
|
|
261 |
cdr:( LazyValue block:[genEven value:lR] )
|
|
262 |
].
|
|
263 |
|
|
264 |
infiniteEven := genEven value:infiniteList.
|
|
265 |
|
|
266 |
genMerge2 := [:a :b |
|
|
267 |
|nextA nextB|
|
|
268 |
|
|
269 |
nextA := a car.
|
|
270 |
nextB := b car.
|
|
271 |
|
|
272 |
nextA < nextB ifTrue:[
|
|
273 |
Cons
|
|
274 |
car:nextA
|
|
275 |
cdr:( LazyValue block:[genMerge2 value:(a cdr) value:b] )
|
|
276 |
] ifFalse:[
|
|
277 |
Cons
|
|
278 |
car:nextB
|
|
279 |
cdr:( LazyValue block:[genMerge2 value:a value:(b cdr)] )
|
|
280 |
].
|
|
281 |
].
|
|
282 |
|
|
283 |
l := genMerge2 value:infiniteOdd value:infiniteEven.
|
|
284 |
1 to:10 do:[:i |
|
|
285 |
Transcript showCR:l car.
|
|
286 |
l := l cdr.
|
|
287 |
].
|
|
288 |
[exEnd]
|
1072
|
289 |
"
|
|
290 |
!
|
|
291 |
|
|
292 |
examples2
|
|
293 |
"
|
|
294 |
Attention: for the examples below to work,
|
4798
|
295 |
you have to enable the Parser's AllowLazyValueExtension
|
|
296 |
and the parser's AllowFunctionCallSyntaxForBlockEvaluation.
|
1072
|
297 |
(set the corresponding classVariables in Parser to true).
|
|
298 |
|
|
299 |
Parser classVarAt:#AllowSTXSyntaxExtensions put:true.
|
|
300 |
Parser classVarAt:#AllowLazyValueExtension put:true.
|
|
301 |
Parser classVarAt:#AllowFunctionCallSyntaxForBlockEvaluation put:true.
|
|
302 |
|
|
303 |
notice that this is just syntactic sugar: the 'FOO(arg)' notation is
|
|
304 |
the same as 'FOO value:arg', and !!block is the same as 'LazyValue block:block'.
|
|
305 |
BTW: the # is the binary Cons-message.
|
|
306 |
[exBegin]
|
|
307 |
|x|
|
|
308 |
|
|
309 |
x := !![ Transcript flash. 1234 ].
|
|
310 |
Delay waitForSeconds:4.
|
|
311 |
Transcript showCR:x printString
|
|
312 |
[exEnd]
|
|
313 |
|
|
314 |
listFrom:n - an infinite list of integers starting with n
|
|
315 |
[exBegin]
|
|
316 |
|GEN infiniteList|
|
|
317 |
|
|
318 |
GEN := [:n | n # !![ GEN( n+1) ] ].
|
|
319 |
|
|
320 |
infiniteList := GEN(1).
|
|
321 |
1 to:10 do:[:i |
|
|
322 |
Transcript showCR:infiniteList car.
|
|
323 |
infiniteList := infiniteList cdr.
|
|
324 |
].
|
|
325 |
[exEnd]
|
|
326 |
|
|
327 |
filterOdd:l - an infinite list filtering odd numbers from another list
|
|
328 |
[exBegin]
|
|
329 |
|GEN infiniteList GENOdd infiniteOdd|
|
|
330 |
|
|
331 |
GEN := [:n | n # !![ GEN(n+1) ] ].
|
|
332 |
|
|
333 |
infiniteList := GEN(1).
|
|
334 |
|
|
335 |
GENOdd := [:l |
|
|
336 |
|lR el|
|
|
337 |
|
|
338 |
lR := l.
|
|
339 |
[
|
|
340 |
el := lR car.
|
|
341 |
lR := lR cdr.
|
|
342 |
el odd
|
|
343 |
] whileFalse:[].
|
|
344 |
el # !![ GENOdd(lR) ]
|
|
345 |
].
|
|
346 |
|
|
347 |
infiniteOdd := GENOdd(infiniteList).
|
|
348 |
|
|
349 |
1 to:10 do:[:i |
|
|
350 |
Transcript showCR:infiniteOdd car.
|
|
351 |
infiniteOdd := infiniteOdd cdr.
|
|
352 |
].
|
|
353 |
[exEnd]
|
|
354 |
|
|
355 |
powersOf:n - an infinite list of powers of n
|
|
356 |
[exBegin]
|
|
357 |
|GENPowersOf infiniteListOfPowers|
|
|
358 |
|
|
359 |
GENPowersOf := [:base |
|
|
360 |
|powersOfBase|
|
|
361 |
|
|
362 |
powersOfBase := [:n | n # !![powersOfBase(n*base)]].
|
|
363 |
powersOfBase(1)
|
|
364 |
].
|
|
365 |
|
|
366 |
infiniteListOfPowers := GENPowersOf(2).
|
|
367 |
1 to:10 do:[:i |
|
|
368 |
Transcript showCR:infiniteListOfPowers car.
|
|
369 |
infiniteListOfPowers := infiniteListOfPowers cdr.
|
|
370 |
].
|
|
371 |
[exEnd]
|
|
372 |
|
|
373 |
merge2:a _:b - merge 2 lists.
|
|
374 |
the genODD and genEVEN setup is just for testing.
|
|
375 |
[exBegin]
|
|
376 |
|GENMerge2 l GEN infiniteList GENFILTER GENOdd infiniteOdd GENEven infiniteEven GENMerge|
|
|
377 |
|
|
378 |
GEN := [:n | n # !![GEN(n+1)] ].
|
|
379 |
|
|
380 |
infiniteList := GEN(1).
|
|
381 |
|
|
382 |
GENFILTER := [:l :filter|
|
|
383 |
|lR el|
|
|
384 |
|
|
385 |
lR := l.
|
|
386 |
[ el := lR car. lR := lR cdr. filter(el) ] whileFalse:[].
|
|
387 |
el # !![ GENFILTER(lR. filter) ]
|
|
388 |
].
|
|
389 |
|
|
390 |
GENOdd := [:l | GENFILTER(l. [:el | el odd])].
|
|
391 |
infiniteOdd := GENOdd(infiniteList).
|
|
392 |
|
|
393 |
GENEven := [:l | GENFILTER(l. [:el | el even])].
|
|
394 |
infiniteEven := GENEven value:infiniteList.
|
|
395 |
|
|
396 |
GENMerge2 := [:a :b |
|
|
397 |
|nextA nextB|
|
|
398 |
|
|
399 |
nextA := a car.
|
|
400 |
nextB := b car.
|
|
401 |
|
|
402 |
nextA < nextB ifTrue:[
|
|
403 |
nextA # !![ GENMerge2(a cdr . b)]
|
|
404 |
] ifFalse:[
|
|
405 |
nextB # !![ GENMerge2(a . b cdr)]
|
|
406 |
].
|
|
407 |
].
|
|
408 |
|
|
409 |
l := GENMerge2(infiniteOdd .infiniteEven).
|
|
410 |
1 to:10 do:[:i |
|
|
411 |
Transcript showCR:l car.
|
|
412 |
l := l cdr.
|
|
413 |
].
|
|
414 |
[exEnd]
|
|
415 |
|
|
416 |
powersOf2 - generate 2^i for all i >= 0
|
|
417 |
[exBegin]
|
|
418 |
|l GENPowersOf powersOf2|
|
|
419 |
|
|
420 |
GENPowersOf := [:base |
|
|
421 |
|powersOfBase|
|
|
422 |
|
|
423 |
powersOfBase := [:n | n # !![powersOfBase value:n*base] ].
|
|
424 |
powersOfBase value:1.
|
|
425 |
].
|
|
426 |
|
|
427 |
powersOf2 := GENPowersOf value:2.
|
|
428 |
|
|
429 |
1 to:10 do:[:i |
|
|
430 |
Transcript showCR:powersOf2 car.
|
|
431 |
powersOf2 := powersOf2 cdr.
|
|
432 |
].
|
|
433 |
[exEnd]
|
1042
|
434 |
|
|
435 |
genPoly - generate 2^i + 3^j + 5^k for all i,j,k
|
1072
|
436 |
unfinished.
|
1042
|
437 |
[exBegin]
|
1072
|
438 |
|GENPowersOf genMerge2 l gen infiniteList powersOf2 powersOf3 powersOf5
|
|
439 |
genAdd genMerge3|
|
1042
|
440 |
|
1072
|
441 |
gen := [:n | Cons car:n cdr:( !![gen value:n+1] ) ].
|
1042
|
442 |
|
|
443 |
infiniteList := gen value:1.
|
|
444 |
|
1072
|
445 |
GENPowersOf := [:base |
|
1042
|
446 |
|powersOfBase|
|
|
447 |
|
1072
|
448 |
powersOfBase := [:n | n # !![powersOfBase value:n*base] ].
|
|
449 |
powersOfBase(1).
|
1042
|
450 |
].
|
|
451 |
|
1072
|
452 |
powersOf2 := GENPowersOf(2). '2^i' for all i
|
|
453 |
powersOf3 := GENPowersOf(3). '3^j' for all j
|
|
454 |
powersOf5 := GENPowersOf(5). '5^k' for all k
|
1042
|
455 |
|
1072
|
456 |
genMerge3 := [:a :b :c|
|
|
457 |
|min nextA nextB nextC rA rB rC|
|
1042
|
458 |
|
1072
|
459 |
nextA := a car.
|
|
460 |
nextB := b car.
|
|
461 |
nextC := c car.
|
|
462 |
|
1042
|
463 |
[ (nextB := rB car) = nextA ] whileTrue:[ rB := rB cdr ].
|
|
464 |
|
|
465 |
nextA < nextB ifTrue:[
|
|
466 |
'a is smallest'.
|
|
467 |
min := nextA.
|
|
468 |
rA := rA cdr.
|
|
469 |
] ifFalse:[
|
|
470 |
'b is smallest'.
|
|
471 |
min := nextB.
|
|
472 |
rB := rB cdr.
|
|
473 |
].
|
|
474 |
|
|
475 |
Cons
|
|
476 |
car:min
|
1072
|
477 |
cdr:!![genMerge2 value:rA value:rB]
|
1042
|
478 |
].
|
|
479 |
|
1072
|
480 |
genMerge3 := [:a :b :c|
|
|
481 |
genMerge2(genMerge2(a . b) . c).
|
|
482 |
].
|
|
483 |
|
|
484 |
l := genMerge3 value:powersOf2 value:powersOf3 value:powersOf5.
|
1042
|
485 |
1 to:10 do:[:i |
|
|
486 |
Transcript showCR:l car.
|
|
487 |
l := l cdr.
|
|
488 |
].
|
|
489 |
[exEnd]
|
|
490 |
|
|
491 |
"
|
|
492 |
! !
|
|
493 |
|
|
494 |
!LazyValue class methodsFor:'instance creation'!
|
|
495 |
|
|
496 |
block:aBlock
|
4798
|
497 |
"return a new lazyValue, which computes aBlock"
|
|
498 |
|
1042
|
499 |
^ self new block:aBlock
|
4798
|
500 |
|
|
501 |
"Modified (comment): / 09-02-2019 / 15:58:45 / Claus Gittinger"
|
1042
|
502 |
! !
|
|
503 |
|
|
504 |
!LazyValue methodsFor:'printing'!
|
|
505 |
|
3975
|
506 |
displayOn:aGCOrStream
|
5046
|
507 |
"notice: displayString and displayOn: will not wait for the value (they are for developers and inspectors),
|
|
508 |
whereas printString and printOn: will wait (they are for the program to print data)."
|
3975
|
509 |
|
|
510 |
"/ what a kludge - Dolphin and Squeak mean: printOn: a stream;
|
|
511 |
"/ ST/X (and some old ST80's) mean: draw-yourself on a GC.
|
|
512 |
(aGCOrStream isStream) ifFalse:[
|
|
513 |
^ self _evaluate_ displayOn:aGCOrStream
|
|
514 |
].
|
|
515 |
|
1071
|
516 |
block isNil ifTrue:[
|
3975
|
517 |
result displayOn:aGCOrStream.
|
|
518 |
aGCOrStream nextPutAll:' (lazyValue evaluated)'.
|
|
519 |
^ self.
|
|
520 |
].
|
4008
|
521 |
aGCOrStream nextPutAll:'LazyValue (unevaluated) block: '.
|
|
522 |
block displayOn:aGCOrStream.
|
5046
|
523 |
|
|
524 |
"Modified (comment): / 25-06-2019 / 10:49:42 / Claus Gittinger"
|
1071
|
525 |
!
|
|
526 |
|
3975
|
527 |
displayString
|
5046
|
528 |
"notice: displayString and displayOn: will not wait for the value (they are for developers and inspectors),
|
|
529 |
whereas printString and printOn: will wait (they are for the program to print data)."
|
|
530 |
|
5032
|
531 |
"defined here, because I inherit from nobody"
|
3975
|
532 |
|
5032
|
533 |
^ (Object compiledMethodAt:#displayString)
|
|
534 |
valueWithReceiver:self
|
|
535 |
arguments:nil
|
|
536 |
selector:#displayString
|
|
537 |
|
5046
|
538 |
"Modified (comment): / 25-06-2019 / 10:49:45 / Claus Gittinger"
|
1042
|
539 |
! !
|
|
540 |
|
|
541 |
!LazyValue methodsFor:'private access'!
|
|
542 |
|
|
543 |
block:aBlock
|
|
544 |
block := aBlock.
|
3975
|
545 |
lock := Semaphore forMutualExclusion.
|
1042
|
546 |
! !
|
|
547 |
|
|
548 |
!LazyValue methodsFor:'queries'!
|
|
549 |
|
|
550 |
class
|
|
551 |
^ self _evaluate_ class
|
3975
|
552 |
! !
|
|
553 |
|
4008
|
554 |
!LazyValue methodsFor:'synchronising'!
|
|
555 |
|
|
556 |
_evaluate_
|
|
557 |
block notNil ifTrue:[
|
|
558 |
lock wait. "ensure that block is only executed once"
|
|
559 |
block notNil ifTrue:[
|
|
560 |
result := block value.
|
|
561 |
block := nil.
|
|
562 |
|
|
563 |
lock signalForAll.
|
|
564 |
lock := nil.
|
|
565 |
].
|
|
566 |
].
|
|
567 |
^ result
|
|
568 |
!
|
|
569 |
|
|
570 |
doesNotUnderstand:aMessage
|
|
571 |
block notNil ifTrue:[
|
4572
|
572 |
Processor activeProcess isDebuggerProcess ifTrue:[
|
4008
|
573 |
"enable debugging / inspecting without evaluating"
|
|
574 |
^ aMessage sendTo:self usingClass:Object.
|
|
575 |
].
|
|
576 |
self _evaluate_.
|
|
577 |
].
|
|
578 |
^ aMessage sendTo:result
|
4572
|
579 |
|
|
580 |
"Modified: / 01-02-2018 / 10:17:12 / stefan"
|
4227
|
581 |
!
|
|
582 |
|
|
583 |
perform:aSelector withArguments:argArray
|
|
584 |
"send the message aSelector with all args taken from argArray
|
|
585 |
to the receiver."
|
|
586 |
|
|
587 |
block notNil ifTrue:[
|
4572
|
588 |
Processor activeProcess isDebuggerProcess ifTrue:[
|
4227
|
589 |
"enable debugging / inspecting"
|
|
590 |
^ super perform:aSelector withArguments:argArray.
|
|
591 |
].
|
|
592 |
self _evaluate_.
|
|
593 |
].
|
|
594 |
^ result perform:aSelector withArguments:argArray.
|
4572
|
595 |
|
|
596 |
"Modified: / 01-02-2018 / 10:17:18 / stefan"
|
4008
|
597 |
! !
|
|
598 |
|
3975
|
599 |
!LazyValue methodsFor:'testing'!
|
|
600 |
|
|
601 |
isBehavior
|
|
602 |
^ self _evaluate_ isBehavior
|
1042
|
603 |
!
|
|
604 |
|
|
605 |
isLazyValue
|
|
606 |
^ block notNil
|
|
607 |
! !
|
|
608 |
|
|
609 |
!LazyValue class methodsFor:'documentation'!
|
|
610 |
|
|
611 |
version
|
3975
|
612 |
^ '$Header$'
|
5046
|
613 |
!
|
|
614 |
|
|
615 |
version_CVS
|
|
616 |
^ '$Header$'
|
1042
|
617 |
! !
|
1307
|
618 |
|