Squeak-dev April 2019

squeak-dev@lists.squeakfoundation.org

36 participants
122 discussions

The Trunk: ShoutCore-nice.63.mcz
by commits＠source.squeak.org 26 Apr '19

26 Apr '19

Nicolas Cellier uploaded a new version of ShoutCore to project The Trunk: http://source.squeak.org/trunk/ShoutCore-nice.63.mcz ==================== Summary ==================== Name: ShoutCore-nice.63 Author: nice Time: 7 April 2019, 3:24:31.721529 pm UUID: 7440b898-b497-493b-adfa-67aef04e0980 Ancestors: ShoutCore-eem.62 Attempt to fix highlighting of 1to:-1 I don't see the point of testing the presence of a binary selector character after a colon $:, except maybe the case of assignment :=, so only test that case. =============== Diff against ShoutCore-eem.62 =============== Item was changed: ----- Method: SHParserST80>>scanIdentifier (in category 'scan') ----- scanIdentifier | c start | start := sourcePosition. [ (c := self nextChar) isAlphaNumeric or: [ allowUnderscoreSelectors and: [ c == $_ ] ] ] whileTrue. + (c == $: and: [ self peekChar ~= $= ]) - (c == $: and: [ (self isSelectorCharacter: self peekChar) not ]) ifTrue: [ self nextChar ]. currentToken := source copyFrom: start to: sourcePosition - 1. currentTokenSourcePosition := start!

1 0

Using high res clock in benchmarks
by Nicolas Cellier 26 Apr '19

26 Apr '19

Hi, I recently published a Chronology-Core version for using high resolution clock. On my 2.7GHz core i5 MBP (2015) I get this: Time highResClockTicksPerMillisecond 2699824 => OK, consistent with 2.7GHz Time highResClock - Time highResClock * 1000000 // Time highResClockTicksPerMillisecond. -578 -563 => Huh, invoking a primitive takes that long (500 to 600 nanoseconds) But I can correct it. Let's try it: [10 factorial] bench. '14,000,000 per second. 71.2 microseconds per run.' => this is the reference result (1 to: 10) collect: [:i | | ticks | ticks := Time highResClock. 10 factorial. Time highResClock - ticks + + (Time highResClock - Time highResClock) "correction" * 1000000 // Time highResClockTicksPerMillisecond "get nanoseconds"]. #(1309 247 88 84 74 69 71 71 71 69) => OK, first runs are a bit long, but we get 70ns per run as the reference #(1977 191 143 148 142 120 122 122 117 120) => Oups??? Second run gives different results??? #(2239 180 143 143 142 116 117 117 117 114) => and third about the same than second... Any idea how to explain that?

2 4

The Inbox: Chronology-Core-nice.42.mcz
by commits＠source.squeak.org 26 Apr '19

26 Apr '19

Nicolas Cellier uploaded a new version of Chronology-Core to project The Inbox: http://source.squeak.org/inbox/Chronology-Core-nice.42.mcz ==================== Summary ==================== Name: Chronology-Core-nice.42 Author: nice Time: 26 April 2019, 7:27:43.413216 pm UUID: fd909f2b-275e-f44c-91fa-076eb32d64c7 Ancestors: Chronology-Core-nice.41 Make usage of highResolution clock for block-timing a Preference. This is because TSC are not reliable enough on old CPU (or not available). Always print duration subseconds by group of 3 digits (ms, us, ns) =============== Diff against Chronology-Core-nice.41 =============== Item was changed: ----- Method: Duration>>printOn: (in category 'squeak protocol') ----- printOn: aStream "Format as per ANSI 5.8.2.16: [-]D:HH:MM:SS[.S]" | d h m s n | d := self days abs. h := self hours abs. m := self minutes abs. s := self seconds abs truncated. n := self nanoSeconds abs. self negative ifTrue: [ aStream nextPut: $- ]. d printOn: aStream. aStream nextPut: $:. h < 10 ifTrue: [ aStream nextPut: $0. ]. h printOn: aStream. aStream nextPut: $:. m < 10 ifTrue: [ aStream nextPut: $0. ]. m printOn: aStream. aStream nextPut: $:. s < 10 ifTrue: [ aStream nextPut: $0. ]. s printOn: aStream. n = 0 ifFalse: [ | z ps | aStream nextPut: $.. ps := n printString padded: #left to: 9 with: $0. z := ps findLast: [ :c | c asciiValue > $0 asciiValue ]. + ps from: 1 to: z + 2 // 3 * 3 do: [ :c | aStream nextPut: c ] ] - ps from: 1 to: z do: [ :c | aStream nextPut: c ] ] ! Item was changed: Magnitude subclass: #Time instanceVariableNames: 'seconds nanos' + classVariableNames: 'ClockPolicy HighResClockTicksPerMillisecond LastClockTick UseHighResClockForTiming' - classVariableNames: 'ClockPolicy HighResClockTicksPerMillisecond LastClockTick' poolDictionaries: 'ChronologyConstants' category: 'Chronology-Core'! !Time commentStamp: 'dew 10/23/2004 17:58' prior: 0! This represents a particular point in time during any given day. For example, '5:19:45 pm'. If you need a point in time on a particular day, use DateAndTime. If you need a duration of time, use Duration. ! Item was changed: ----- Method: Time class>>durationToRun: (in category 'general inquiries') ----- durationToRun: timedBlock + "Answer a duration timedBlock takes to return its value" - "Answer a duration timedBlock takes to return its value. - Use high resolution clock if available." + ^(self nanosecondsToRun: timedBlock) nanoSeconds! - | ticks | - self highResClock = 0 ifTrue: [^Duration nanoSeconds: 1000 * (self microsecondsToRun: timedBlock)]. - ticks := self highResClock. - timedBlock value. - ticks := self highResClock - ticks. - ^Duration nanoSeconds: 1000000* ticks // self highResClockTicksPerMillisecond! Item was changed: ----- Method: Time class>>microsecondsToRun: (in category 'general inquiries') ----- microsecondsToRun: timedBlock "Answer the number of microseconds timedBlock takes to return its value." | startUsecs | + (self useHighResClockForTiming and: [self highResClock ~= 0]) + ifTrue: [ ^(self nanosecondsToRunHighRes: timedBlock) + 500 // 1000]. startUsecs := self utcMicrosecondClock. timedBlock value. ^self utcMicrosecondClock - startUsecs! Item was added: + ----- Method: Time class>>nanosecondsToRun: (in category 'general inquiries') ----- + nanosecondsToRun: timedBlock + "Answer the number of nanoseconds timedBlock takes to return its value. + Use high resolution clock if available and preferred." + + | startUsecs | + (self useHighResClockForTiming and: [self highResClock ~= 0]) + ifTrue: [ ^(self nanosecondsToRunHighRes: timedBlock)]. + "Fallback to microseconds clock" + startUsecs := self utcMicrosecondClock. + timedBlock value. + ^self utcMicrosecondClock - startUsecs * 1000! Item was added: + ----- Method: Time class>>nanosecondsToRunHighRes: (in category 'general inquiries') ----- + nanosecondsToRunHighRes: timedBlock + "Answer the number of nanoseconds timedBlock takes to return its value using high resolution clock. + This assumes that high resolution clock is available, has a constant rate, and is synchronized between multi-core CPU" + + | ticks | + ticks := self highResClock. + timedBlock value. + ^(self highResClock - ticks + + (self highResClock - self highResClock ) "subtract the ticks taken by the call to highResClock itself" + * 1e6 // self highResClockTicksPerMillisecond) "and convert ticks to nanoSeconds"! Item was added: + ----- Method: Time class>>useHighResClockForTiming (in category 'preferences') ----- + useHighResClockForTiming + <preference: 'Use high resolution clock for timing' + category: 'performance' + description: 'This is used for measuring time ellapsed for running a block. High resolution clocks (known as TSC) are counter embedded on CPU and incremented at each cycle. They enable timing close to the nanosecond for GHz CPU. However, on older models, they might have a non constant rate depending on power saving: converting ticks to seconds is not reliable in this case, but knowing the number of cycles taken to perform the task is still a valuable information. TSC might also be un-synchronized between the multi-cores: if Squeak process is switched from 1 core to another during the timing, timing results could be random. If you have a recent CPU, you might prefer this option' + type: #Boolean> + ^UseHighResClockForTiming ifNil: [ false ]!

1 0

The Inbox: Kernel-nice.1217.mcz
by commits＠source.squeak.org 26 Apr '19

26 Apr '19

Nicolas Cellier uploaded a new version of Kernel to project The Inbox: http://source.squeak.org/inbox/Kernel-nice.1217.mcz ==================== Summary ==================== Name: Kernel-nice.1217 Author: nice Time: 26 April 2019, 6:01:39.036232 pm UUID: 39478bc1-0f55-4747-8332-45a6d225b281 Ancestors: Kernel-eem.1215 Publish Karatsuba and 3-way Toom-Cooke algorithms for fast large integer multiplication. These are efficient divide and conquer algorithms that recursively split a problem into simpler problems. Currently this fast multiplication is used only in LargePositiveInteger>>squared. Slightly modify raisedToInteger: to use that squared. This result on a small penalty for small number exponentation, but large speed up for big integers. Also publish another Karatsuba-like square root algorithm that should accelerate sqrt of huge integers. Examples on a 64 bits image/VM [10 raisedToInteger: 30] bench. '3,770,000 per second. 265 nanoseconds per run.' - before '3,500,000 per second. 286 nanoseconds per run.' - after [10.0 raisedToInteger: 30] bench. '10,900,000 per second. 91.6 nanoseconds per run.' - before '9,540,000 per second. 105 nanoseconds per run.' - after | x | x := 100 factorial. [x raisedToInteger: 30] bench. '15,900 per second. 63 microseconds per run.' - before '19,500 per second. 51.3 microseconds per run.' - after | x | x := 1000 factorial. [x raisedToInteger: 30] bench. '58.8 per second. 17 milliseconds per run.' - before '179 per second. 5.6 milliseconds per run.' - after | x | x := 500 factorial - 100 factorial. { [x sqrtFloor] bench. [x sqrtFloorNewtonRaphson] bench. } #( '42,300 per second. 23.6 microseconds per run.' '8,240 per second. 121 microseconds per run.') =============== Diff against Kernel-eem.1215 =============== Item was added: + ----- Method: Integer>>fastMultiply: (in category 'arithmetic') ----- + fastMultiply: anInteger + ^self * anInteger! Item was added: + ----- Method: Integer>>karatsubaTimes: (in category 'arithmetic') ----- + karatsubaTimes: anInteger + "Eventually use Karatsuba algorithm to perform the multiplication. + This is efficient only for large integers (see subclass). + By default, use regular multiplication." + + ^self * anInteger! Item was changed: ----- Method: Integer>>sqrtFloor (in category 'mathematical functions') ----- sqrtFloor + "Return the integer part of the square root of self + Assume self >= 0 + The following invariants apply: + 1) self sqrtFloor squared <= self + 2) (self sqrtFloor + 1) squared > self" - "Return the integer part of the square root of self" + ^self sqrtFloorNewtonRaphson! - | guess delta | - guess := 1 bitShift: self highBit + 1 // 2. - [ - delta := guess squared - self // (guess bitShift: 1). - delta = 0 ] whileFalse: [ - guess := guess - delta ]. - ^guess - 1! Item was added: + ----- Method: Integer>>sqrtFloorNewtonRaphson (in category 'mathematical functions') ----- + sqrtFloorNewtonRaphson + "Return the integer part of the square root of self. + Use a Newton-Raphson iteration since it converges quadratically + (twice more bits of precision at each iteration)" + + | guess delta | + guess := 1 bitShift: self highBit + 1 // 2. + [ + delta := guess squared - self // (guess bitShift: 1). + delta = 0 ] whileFalse: [ + guess := guess - delta ]. + ^guess - 1! Item was added: + ----- Method: Integer>>sqrtRem (in category 'mathematical functions') ----- + sqrtRem + "Return an array with floor sqrt and sqrt remainder. + Assume self >= 0. + The following invariants apply: + 1) self sqrtRem first squared <= self + 2) (self sqrtRem first + 1) squared > self + 3) self sqrtRem first squared + self sqrtRem last = self" + + | s | + s := self sqrtFloorNewtonRaphson. + ^{ s. self - s squared } ! Item was added: + ----- Method: Integer>>toom3Times: (in category 'arithmetic') ----- + toom3Times: anInteger + ^self * anInteger! Item was added: + ----- Method: LargePositiveInteger>>butLowestNDigits: (in category 'private') ----- + butLowestNDigits: N + "make a new integer removing N least significant digits of self." + + ^self bitShiftMagnitude: -8 * N! Item was added: + ----- Method: LargePositiveInteger>>copyDigitsFrom:to: (in category 'private') ----- + copyDigitsFrom: start to: stop + "Make a new integer keeping only some digits of self." + + | len slice | + start > 0 ifFalse: [^self error: 'start index should be at least 1']. + len := self digitLength. + (start > len or: [start > stop]) ifTrue: [^0]. + stop >= len + ifTrue: [start = 1 ifTrue: [^self]. + len := len - start + 1] + ifFalse: [len := stop - start + 1]. + slice := self class new: len. + slice replaceFrom: 1 to: len with: self startingAt: start. + ^slice normalize! Item was added: + ----- Method: LargePositiveInteger>>fastMultiply: (in category 'arithmetic') ----- + fastMultiply: anInteger + "Eventually use Karatsuba or 3-way Toom-Cook algorithm to perform the multiplication" + + | xLen yLen | + "arrange to have the receiver be the shorter" + (xLen := self digitLength) > (yLen := anInteger digitLength) + ifTrue: [^ anInteger fastMultiply: self ]. + + "If too short to be worth, fallback to naive algorithm" + (xLen >= 600) ifFalse: [^self * anInteger]. + (xLen >= 6000) ifFalse: [^self karatsubaTimes: anInteger]. + ^self toom3Times: anInteger! Item was added: + ----- Method: LargePositiveInteger>>karatsubaTimes: (in category 'arithmetic') ----- + karatsubaTimes: anInteger + "Eventually use Karatsuba algorithm to perform the multiplication + The Karatsuba algorithm divide number in two smaller parts. + Then it uses tricks to perform only 3 multiplications. + See https://en.wikipedia.org/wiki/Karatsuba_algorithm" + + | half xHigh xLow yHigh yLow low high mid xLen yLen | + "arrange to have the receiver be the shorter" + (xLen := self digitLength) > (yLen := anInteger digitLength) + ifTrue: [^ anInteger karatsubaTimes: self ]. + + "If too short to be worth, fallback to naive algorithm" + (xLen >= 600) ifFalse: [^self * anInteger]. + + "Seek for integers of about the same length, else split the long one" + yLen >= (7 * xLen bitShift: -2) + ifTrue: + [^(0 to: yLen - 1 by: xLen + 1) digitShiftSum: [:yShift | + self karatsubaTimes: + (anInteger copyDigitsFrom: yShift + 1 to: yShift + 1 + xLen)]]. + + "At this point, lengths are similar, divide each integer in two halves" + half := (yLen + 1 bitShift: -1) bitClear: 2r11. + xLow := self lowestNDigits: half. + xHigh := self butLowestNDigits: half. + yLow := anInteger lowestNDigits: half. + yHigh := anInteger butLowestNDigits: half. + + "Karatsuba trick: perform with 3 multiplications instead of 4" + low := xLow karatsubaTimes: yLow. + high := xHigh karatsubaTimes: yHigh. + mid := high + low + (xHigh - xLow karatsubaTimes: yLow - yHigh). + + "Sum the parts of decomposition" + ^low + (mid bitShiftMagnitude: 8*half) + (high bitShiftMagnitude: 16*half) + + " + | a b | + a := 650 factorial-1. + b := 700 factorial-1. + {a digitLength. b digitLength}. + self assert: (a karatsubaTimes: b) - (a * b) = 0. + [Smalltalk garbageCollect. + [1000 timesRepeat: [a karatsubaTimes: b]] timeToRun] value / + [Smalltalk garbageCollect. + [1000 timesRepeat: [a * b]] timeToRun] value asFloat + "! Item was added: + ----- Method: LargePositiveInteger>>lowestNDigits: (in category 'private') ----- + lowestNDigits: N + "Make a new integer keeping only N least significant digits of self" + + | low | + N >= self digitLength ifTrue: [^self]. + low := self class new: N. + low replaceFrom: 1 to: N with: self startingAt: 1. + ^low normalize! Item was added: + ----- Method: LargePositiveInteger>>sqrtFloor (in category 'mathematical functions') ----- + sqrtFloor + "Like super, but use a faster divide and conquer strategy if it's worth" + + self digitLength >= 64 ifFalse: [^self sqrtFloorNewtonRaphson]. + ^self sqrtRem first! Item was added: + ----- Method: LargePositiveInteger>>sqrtRem (in category 'mathematical functions') ----- + sqrtRem + "Like super, but use a divide and conquer method to perform this operation. + See Paul Zimmermann. Karatsuba Square Root. [Research Report] RR-3805, INRIA. 1999, pp.8. <inria-00072854> + https://hal.inria.fr/inria-00072854/PDF/RR-3805.pdf" + + | n qr s r sr high mid low | + n := self digitLength bitShift: -2. + n >= 16 ifFalse: [^super sqrtRem]. + high := self butLowestNDigits: n * 2. + mid := self copyDigitsFrom: n + 1 to: n * 2. + low := self lowestNDigits: n. + + sr := high sqrtRem. + qr := (sr last bitShift: 8 * n) + mid digitDiv: (sr first bitShift: 1) neg: false. + s := (sr first bitShift: 8 * n) + qr first. + r := (qr last bitShift: 8 * n) + low - qr first squared. + r negative + ifTrue: + [r := (s bitShift: 1) + r - 1. + s := s - 1]. + sr at: 1 put: s; at: 2 put: r. + ^sr + ! Item was added: + ----- Method: LargePositiveInteger>>squared (in category 'mathematical functions') ----- + squared + "Eventually use a divide and conquer algorithm to perform the multiplication" + + (self digitLength >= 400) ifFalse: [^self * self]. + (self digitLength >= 1600) ifFalse: [^self squaredKaratsuba]. + ^self squaredToom3! Item was added: + ----- Method: LargePositiveInteger>>squaredKaratsuba (in category 'mathematical functions') ----- + squaredKaratsuba + "Use a divide and conquer algorithm to perform the multiplication. + Split in two parts like Karatsuba, but economize 2 additions by using asymetrical product." + + | half xHigh xLow low high mid | + + "Divide digits in two halves" + half := self digitLength + 1 // 2 bitClear: 2r11. + xLow := self lowestNDigits: half. + xHigh := self butLowestNDigits: half. + + "eventually use karatsuba" + low := xLow squared. + high := xHigh squared. + mid := xLow karatsubaTimes: xHigh. + + "Sum the parts of decomposition" + ^low + (mid bitShift: 8*half+1) + (high bitShift: 16*half) + + " + | a | + a := 440 factorial-1. + a digitLength. + self assert: a * a - a squaredKaratsuba = 0. + [Smalltalk garbageCollect. + [2000 timesRepeat: [a squaredKaratsuba]] timeToRun] value / + [Smalltalk garbageCollect. + [2000 timesRepeat: [a * a]] timeToRun] value asFloat + "! Item was added: + ----- Method: LargePositiveInteger>>squaredToom3 (in category 'mathematical functions') ----- + squaredToom3 + "Use a 3-way Toom-Cook divide and conquer algorithm to perform the multiplication" + + | third x0 x1 x2 x20 z0 z1 z2 z3 z4 | + "divide in 3 parts" + third := self digitLength + 2 // 3 bitClear: 2r11. + x2 := self butLowestNDigits: third * 2. + x1 := self copyDigitsFrom: third + 1 to: third * 2. + x0 := self lowestNDigits: third. + + "Toom-3 trick: 5 multiplications instead of 9" + z0 := x0 squared. + z4 := x2 squared. + x20 := x2 + x0. + z1 := (x20 + x1) squared. + x20 := x20 - x1. + z2 := x20 squared. + z3 := ((x20 + x2 bitShift: 1) - x0) squared. + + "Sum the parts of decomposition" + z3 := z3 - z1 quo: 3. + z1 := z1 - z2 bitShift: -1. + z2 := z2 - z0. + + z3 := (z2 - z3 bitShift: -1) + (z4 bitShift: 1). + z2 := z2 + z1 - z4. + z1 := z1 - z3. + ^z0 + (z1 bitShift: 8*third) + (z2 bitShift: 16*third) + (z3 + (z4 bitShift: 8*third) bitShift: 24*third) + + " + | a | + a := 1400 factorial-1. + a digitLength. + self assert: a * a - a squaredToom3 = 0. + [Smalltalk garbageCollect. + [1000 timesRepeat: [a squaredToom3]] timeToRun] value / + [Smalltalk garbageCollect. + [1000 timesRepeat: [a squaredKaratsuba]] timeToRun] value asFloat + "! Item was added: + ----- Method: LargePositiveInteger>>toom3Times: (in category 'arithmetic') ----- + toom3Times: anInteger + "Eventually use a variant of Toom-Cooke for performing multiplication. + Toom-Cooke is a generalization of Karatsuba divide and conquer algorithm. + It divides operands in n parts instead of 2. + See https://en.wikipedia.org/wiki/Toom%E2%80%93Cook_multiplication + Here we divide each operand in 3 parts, thus the name Toom-3." + + | third x2 x1 x0 y2 y1 y0 xLen yLen y20 z4 z3 z2 z1 z0 x20 | + "arrange to have the receiver be the shorter" + (xLen := self digitLength) > (yLen := anInteger digitLength) + ifTrue: [^anInteger toom3Times: self ]. + + "If too short to be worth, fallback to Karatsuba algorithm" + (xLen > 6000) ifFalse: [^self karatsubaTimes: anInteger]. + + "Seek for well balanced integers" + yLen > (5 * xLen bitShift: -2) + ifTrue: [^(0 to: yLen - 1 by: xLen + 1) digitShiftSum: [:yShift | + self toom3Times: (anInteger copyDigitsFrom: yShift + 1 to: yShift +1 + xLen)]]. + + "At this point, lengths are well balanced, divide in 3 parts" + third := yLen + 2 // 3 bitClear: 2r11. + x2 := self butLowestNDigits: third * 2. + x1 := self copyDigitsFrom: third + 1 to: third * 2. + x0 := self lowestNDigits: third. + y2 := anInteger butLowestNDigits: third * 2. + y1 := anInteger copyDigitsFrom: third + 1 to: third * 2. + y0 := anInteger lowestNDigits: third. + + "Toom-3 trick: 5 multiplications instead of 9" + z0 := x0 toom3Times: y0. + z4 := x2 toom3Times: y2. + x20 := x2 + x0. + y20 := y2 + y0. + z1 := x20 + x1 toom3Times: y20 + y1. + x20 := x20 - x1. + y20 := y20 - y1. + z2 := x20 toom3Times: y20. + z3 := (x20 + x2 bitShift: 1) - x0 toom3Times: (y20 + y2 bitShift: 1) - y0. + + "Sum the parts of decomposition" + z3 := z3 - z1 quo: 3. + z1 := z1 - z2 bitShift: -1. + z2 := z2 - z0. + + z3 := (z2 - z3 bitShift: -1) + (z4 bitShift: 1). + z2 := z2 + z1 - z4. + z1 := z1 - z3. + ^z0 + (z1 bitShift: 8*third) + (z2 bitShift: 16*third) + (z3 + (z4 bitShift: 8*third) bitShift: 24*third) + + " + | a b | + a :=5000 factorial - 1. + b := 6000 factorial - 1. + a digitLength min: b digitLength. + a digitLength max: b digitLength. + (a toom3Times: b) = (a * b) ifFalse: [self error]. + [Smalltalk garbageCollect. + [300 timesRepeat: [a toom3Times: b]] timeToRun] value / + [Smalltalk garbageCollect. + [300 timesRepeat: [a karatsubaTimes: b]] timeToRun] value asFloat + "! Item was changed: ----- Method: Number>>raisedToInteger: (in category 'mathematical functions') ----- raisedToInteger: anInteger "The 0 raisedToInteger: 0 is an special case. In some contexts must be 1 and in others must be handled as an indeterminate form. I take the first context because that's the way that was previously handled. Maybe further discussion is required on this topic." | bitProbe result | anInteger negative ifTrue: [^(self raisedToInteger: anInteger negated) reciprocal]. bitProbe := 1 bitShift: anInteger highBit - 1. result := self class one. [ (anInteger bitAnd: bitProbe) > 0 ifTrue: [ result := result * self ]. (bitProbe := bitProbe bitShift: -1) > 0 ] + whileTrue: [ result := result squared ]. - whileTrue: [ result := result * result ]. ^result!

1 0

Bug in #tryInvokeHalo:
by Stéphane Rollandin 26 Apr '19

26 Apr '19

Hello all, To see a bug in the halo targets dispatch mechanism, do the following: - Open a fresh image, use the alphabetical list from the "new morph..." item in the World menu to get a SameGame morph. - Put the SameGame morph above the "Welcome to Squeak" window. - Blue click three times in a row within the SameGame inner part: this will give a halo to one of the small square tiles. - Now blue click on the grey border of the SameGame morph (say, at left): instead of that morph getting the halo, it will go to the "Welcome to Squeak" window in the back. That is the bug. Reverting #tryInvokeHalo: in PasteUpMorph to its previous version fixes it (the current implementation discards the first morph in the targets stack, which happens in this case to be the target we do want). Stef

3 5

The Trunk: Collections-nice.826.mcz
by commits＠source.squeak.org 25 Apr '19

25 Apr '19

Nicolas Cellier uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-nice.826.mcz ==================== Summary ==================== Name: Collections-nice.826 Author: nice Time: 25 April 2019, 2:22:58.283343 pm UUID: 116c66c9-4c34-5c4f-a9d9-c21d3141c5ea Ancestors: Collections-fn.825 Fix bugs in LazyCharacterSet The block instance variable should not refer to itself, or we'll get an infinite recursion when evaluating. Thus when modifying the collection (#add: #addAll: #remove: #removeAll:), we must use a temporary reference to block Fix another typo bug in removeAll s/include:/includes:/ Unfortunately, there was a Player>>#include: preventing an easy detection of the bug Example: (CharacterSet separators complement reject: [:e | e isVowel]) removeAll: ($0 to: $9); includes: $3. =============== Diff against Collections-fn.825 =============== Item was changed: ----- Method: LazyCharacterSet>>add: (in category 'adding') ----- add: aCharacter + | oldBlock | + oldBlock := block. + block := [:c | c = aCharacter or: [oldBlock value: c]]. - self block: [:c | c = aCharacter or: [block value: c]]. ^aCharacter! Item was changed: ----- Method: LazyCharacterSet>>addAll: (in category 'adding') ----- addAll: aCollection + | oldBlock | + oldBlock := block. + block := [:c | (aCollection includes: c) or: [oldBlock value: c]]. - self block: [:c | (aCollection includes: c) or: [block value: c]]. ^aCollection! Item was changed: ----- Method: LazyCharacterSet>>remove: (in category 'removing') ----- remove: aCharacter + | oldBlock | + oldBlock := block. + block := [:c | (c = aCharacter) not and: [oldBlock value: c]]. - self block: [:c | (c = aCharacter) not and: [block value: c]]. ^aCharacter! Item was changed: ----- Method: LazyCharacterSet>>removeAll: (in category 'removing') ----- removeAll: aCollection + | oldBlock | + oldBlock := block. + block := [:c | (aCollection includes: c) not and: [oldBlock value: c]]. - self block: [:c | (aCollection include: c) not and: [block value: c]]. ^aCollection!

1 0

Call for Papers, The Programming Journal, Volume 4, Issue 2
by Fabio Niephaus 25 Apr '19

25 Apr '19

======================================================================== The Programming Journal The Art, Science, and Engineering of Programming Call for Papers for Volume 4, Issue 2 http://programming-journal.org/cfp/ Follow us @programmingconf ======================================================================== The Art, Science, and Engineering of Programming was created with the goal of placing the wonderful art of programming on the map of scholarly works. Many academic journals and conferences exist that publish research related to programming, starting with programming languages, software engineering, and expanding to the whole Computer Science field. Yet, many of us feel that, as the field of Computer Science expanded, programming, in itself, has been neglected to a secondary role not worthy of scholarly attention. That is a serious gap, as much of the progress in Computer Science lies on the basis of computer programs, the people who write Them, and the concepts and tools available to them to express computational tasks. The Art, Science, and Engineering of Programming aims at closing this gap by focusing primarily on programming: the art itself (programming styles, pearls, models, languages), the emerging science of understanding what works and what doesn’t work in general and in specific contexts, as well as more established engineering and mathematical perspectives. We solicit papers describing work from one of the following perspectives: Art: knowledge and technical skills acquired through practice and personal experiences. Examples include libraries, frameworks, languages, APIs, programming models and styles, programming pearls, and essays about programming. Science (Theoretical): knowledge and technical skills acquired through mathematical formalisms. Examples include formal programming models and proofs. Science (Empirical): knowledge and technical skills acquired through experiments and systematic observations. Examples include user studies and programming-related data mining. Engineering: knowledge and technical skills acquired through designing and building large systems and through calculated application of principles in building those systems. Examples include measurements of artifacts’ properties, development processes and tools, and quality assurance methods. Independent of the type of work, the journal accepts submissions covering several areas of expertise, including but not limited to: - General-purpose programming - Data mining and machine learning programming, and for programming - Database programming - Distributed systems programming - Graphics and GPU programming - Interpreters, virtual machines, and compilers - Metaprogramming and reflection - Model-based development - Modularity and separation of concerns - Parallel and multi-core programming - Program verification - Programming education - Programming environments - Security programming - Social coding - Testing and debugging - User interface programming - Visual and live programming All details, including the selection process are described on http://programming-journal.org/cfp/ Details on the submission processed are available at http://programming-journal.org/submission/ Authors of accepted papers will be invited to present at the <Programming>’20 conference in Porto, Portugal from March 23-26: https://2020.programming-conference.org/ ## Upcoming Deadlines We solicit submissions for the following upcoming deadlines: Submission: June 1 First notification: August 1 Revised submission: September 1 Final notification: September 7 Camera-ready: September 15 We’ll also solicit submissions for Issue 3, for full details, see: https://programming-journal.org/timeline/ ## Standing Review Committee Volume 4 Christophe Scholliers, Ghent University Coen De Roover, Vrije Universiteit Brussel Craig Anslow, Victoria University of Wellington New Zealand Didier Verna, EPITA / LRDE France Diego Garbervetsky University of Buenos Aires Edd Barrett, King's College London Erik Ernst, Google Felienne Hermans, Leiden University Francisco Sant'Anna, Rio de Janeiro State University Friedrich Steimann, Fernuniversität Gordana Rakic, University of Novi Sad Guido Salvaneschi, TU Darmstadt Hidehiko Masuhara, Tokyo Institute of Technology Jeremy Gibbons, University of Oxford Jonathan Edwards, US Jun Kato, AIST Japan Luke Church, University of Cambridge Matthew Flatt, University of Utah Michael L. Van De Vanter, Cal Poly San Luis Obispo Nicolás Cardozo, Universidad de los Andes Colombia Stephen Kell, University of Kent ## Editors Stefan Marr (Editor Volume 4), University of Kent Cristina V. Lopes (Editor-in-Chief), University of California, Irvine

1 0

Re: [squeak-dev] The Trunk: Collections-pre.822.mcz
by Chris Muller 24 Apr '19

24 Apr '19

> Sorry to open this up again. I have progressed well in shuffling things around. However: While moving the corresponding test cases I noticed that there is also #isBinary, #isDoIt, #isInfix, #isUnary, #isKeyword, and #isPvtSelector implemented on Symbol. Given that these all exist, I would rather keep #asSimpleSetter, #isSimpleSetter, #asSetterSelector in the Collections package. > > Any other oppinions on that? Virtually every classic description of the Smalltalk language in books and classes I can remember talks about "three kinds of message names, unary, binary, and keyword..." For example, here it is on the Complete Smalltalk Syntax on a Postcard: https://medium.com/@richardeng/syntax-on-a-post-card-cb6d85fabf88 So, I think those three belong in Collections. "Setter" relates to making a setter method. That's tooling. So the only reason I would have anything "setter" in Collections is if there are enough senders from different depending packages that Collections is the only common ancestor between them. Best, Chris

2 1

The Trunk: Network-pre.232.mcz
by commits＠source.squeak.org 24 Apr '19

24 Apr '19

Patrick Rein uploaded a new version of Network to project The Trunk: http://source.squeak.org/trunk/Network-pre.232.mcz ==================== Summary ==================== Name: Network-pre.232 Author: pre Time: 24 April 2019, 4:20:02.674678 pm UUID: 17eda7a7-5862-8b44-8b69-af531de862ef Ancestors: Network-tpr.231 Improves the MailComposition dialog to show whether the sending is in progress. Adapts the new sending interface internally. Refactors the creation of specs to allow for easier extension by subclasses. =============== Diff against Network-tpr.231 =============== Item was changed: Model subclass: #MailComposition + instanceVariableNames: 'mailMessage isSending' - instanceVariableNames: 'mailMessage' classVariableNames: '' poolDictionaries: '' category: 'Network-MailSending'! !MailComposition commentStamp: 'pre 5/16/2017 20:00' prior: 0! a message being composed in a fancy way. The mail is send via the registered MailSender by default. Fields do not have to be saved, they are saved automatically on send. ! Item was changed: ----- Method: MailComposition class>>open (in category 'opening') ----- open ^ ToolBuilder default open: self! Item was changed: ----- Method: MailComposition class>>openOn: (in category 'opening') ----- openOn: aMessage ^ ToolBuilder default open: (self new on: aMessage; yourself)! Item was added: + ----- Method: MailComposition>>addAttachment:named: (in category 'private') ----- + addAttachment: stream named: attachmentName + + stream binary. + mailMessage + addAttachmentFrom: stream + withName: attachmentName! Item was changed: ----- Method: MailComposition>>buildButtonBarSpecWith: (in category 'toolbuilder') ----- buildButtonBarSpecWith: aBuilder | buttonBarSpec | buttonBarSpec := aBuilder pluggablePanelSpec new children: OrderedCollection new; layout: #horizontal; frame: (LayoutFrame new leftFraction: 0 offset: 0; topFraction: 0 offset: 0; rightFraction: 1 offset: 0; bottomFraction: 0 offset: self buttonBarHeight); yourself. buttonBarSpec children add: (aBuilder pluggableButtonSpec new model: self; action: #sendMail; label: #sendMailButtonLabel; + color: #sendMailButtonColor; yourself). buttonBarSpec children add: (aBuilder pluggableButtonSpec new model: self; action: #addAttachment; label: #addAttachmentButtonLabel; yourself). buttonBarSpec children add: (aBuilder pluggableButtonSpec new model: self; action: #removeAttachment; label: #removeAttachmentButtonLabel; yourself). ^ buttonBarSpec! Item was changed: ----- Method: MailComposition>>buildWith: (in category 'toolbuilder') ----- buildWith: aBuilder + | spec | - | windowSpec detailsPanelSpec textSpec | + spec := self createSpecsWith: aBuilder. - windowSpec := aBuilder pluggableWindowSpec new - model: self; - label: self dialogTitle; - children: OrderedCollection new. - - windowSpec children add: (self buildButtonBarSpecWith: aBuilder). - - detailsPanelSpec := aBuilder pluggablePanelSpec new - children: OrderedCollection new; - layout: #vertical; - yourself. - windowSpec children add: detailsPanelSpec. + ^ aBuilder build: spec! - self createDetailsFieldsIn: detailsPanelSpec by: aBuilder. - - detailsPanelSpec children: detailsPanelSpec children reversed. - detailsPanelSpec frame: (LayoutFrame new - leftFraction: 0 offset: 0; - topFraction: 0 offset: self buttonBarHeight; - rightFraction: 1 offset: 0; - bottomFraction: 0 offset: self buttonBarHeight + (detailsPanelSpec children size * self lineHeight)). - - textSpec := aBuilder pluggableTextSpec new - model: self; - indicateUnacceptedChanges: true; - getText: #messageText; - setText: #messageText:; - frame: (LayoutFrame new - leftFraction: 0 offset: 0; - topFraction: 0 offset: self buttonBarHeight + (detailsPanelSpec children size * self lineHeight); - rightFraction: 1 offset: 0; - bottomFraction: 1 offset: 0); - yourself. - windowSpec children add: textSpec. - - ^ aBuilder build: windowSpec! Item was changed: ----- Method: MailComposition>>createFieldInputNamed:getter:setter:with: (in category 'toolbuilder') ----- createFieldInputNamed: fieldLabelGetter getter: fieldGetter setter: fieldSetter with: aBuilder ^ aBuilder pluggableInputFieldSpec new model: self; indicateUnacceptedChanges: false; getText: fieldGetter; setText: fieldSetter; + name: fieldGetter; frame: (LayoutFrame new leftFraction: 0 offset: 0; topFraction: 0 offset: 0; rightFraction: 1 offset: 0; bottomFraction: 0 offset: self lineHeight); help: fieldLabelGetter; yourself! Item was added: + ----- Method: MailComposition>>createSpecsWith: (in category 'toolbuilder') ----- + createSpecsWith: aBuilder + + | detailsPanelSpec textSpec windowSpec | + windowSpec := self createWindowSpecWith: aBuilder. + windowSpec children add: (self buildButtonBarSpecWith: aBuilder). + + detailsPanelSpec := aBuilder pluggablePanelSpec new + children: OrderedCollection new; + layout: #vertical; + yourself. + windowSpec children add: detailsPanelSpec. + + self createDetailsFieldsIn: detailsPanelSpec by: aBuilder. + + detailsPanelSpec children: detailsPanelSpec children reversed. + detailsPanelSpec frame: (LayoutFrame new + leftFraction: 0 offset: 0; + topFraction: 0 offset: self buttonBarHeight; + rightFraction: 1 offset: 0; + bottomFraction: 0 offset: self buttonBarHeight + (detailsPanelSpec children size * self lineHeight)). + + textSpec := aBuilder pluggableTextSpec new + model: self; + indicateUnacceptedChanges: true; + getText: #messageText; + setText: #messageText:; + name: #messageText; + frame: (LayoutFrame new + leftFraction: 0 offset: 0; + topFraction: 0 offset: self buttonBarHeight + (detailsPanelSpec children size * self lineHeight); + rightFraction: 1 offset: 0; + bottomFraction: 1 offset: 0); + yourself. + windowSpec children add: textSpec. + + ^ windowSpec! Item was added: + ----- Method: MailComposition>>createWindowSpecWith: (in category 'toolbuilder') ----- + createWindowSpecWith: aBuilder + + ^ aBuilder pluggableWindowSpec new + model: self; + label: #dialogTitle; + children: OrderedCollection new.! Item was changed: ----- Method: MailComposition>>doSendMail (in category 'private') ----- doSendMail (SMTPClient openOnHostNamed: self smtpServer port: self smtpServerPort) user: self smtpUser; password: self smtpPassword; login; + mailFrom: mailMessage from to: (mailMessage to findTokens: ',') text: mailMessage asSendableText.! - sendMailMessage: mailMessage! Item was changed: ----- Method: MailComposition>>initialize (in category 'initialize-release') ----- initialize + mailMessage := MailMessage empty. + isSending := false.! - mailMessage := MailMessage empty! Item was added: + ----- Method: MailComposition>>isSending (in category 'private') ----- + isSending + + ^ isSending! Item was added: + ----- Method: MailComposition>>resetSending (in category 'private') ----- + resetSending + + isSending := false. + self changed.! Item was changed: ----- Method: MailComposition>>sendMail (in category 'actions') ----- sendMail + self isSending ifFalse: [ + self saveFields. + + self setSending. - self saveFields. + [[self doSendMail] on: Error do: [:e | self resetSending. e signal]. + Project current addDeferredUIMessage: [self changed: #close].] + forkAt: 30. + + self + changed: #sendMailButtonLabel; + changed: #sendMailButtonColor]! - [self doSendMail. - Project current addDeferredUIMessage: [self changed: #close]] - forkAt: 30! Item was added: + ----- Method: MailComposition>>sendMailButtonColor (in category 'ui constants') ----- + sendMailButtonColor + + ^ self isSending + ifTrue: [Color green lighter duller] + ifFalse: [PluggableButtonMorph new userInterfaceTheme color]! Item was changed: ----- Method: MailComposition>>sendMailButtonLabel (in category 'ui constants') ----- sendMailButtonLabel + ^ (self isSending + ifTrue: ['sending...'] + ifFalse: ['send mail']) translated! - ^ 'send mail' translated! Item was added: + ----- Method: MailComposition>>setSending (in category 'private') ----- + setSending + + isSending := true.!

1 0

Re: [squeak-dev] Weird close button hover animation
by Fabio Niephaus 24 Apr '19

24 Apr '19

Yes, I'm using macOS. Forgot to mention that. Everything seems to work fine on Linux. A quick binary search through old trunk bundles from [1] suggests that the problem was introduced in January. Hope I have some time to look into this in more detail soon. Fabio [1] http://files.squeak.org/5.3alpha On Thu, Apr 18, 2019 at 2:38 PM K K Subbu <kksubbu.ml(a)gmail.com> wrote: > I couldn't reproduce it in my Squeak image (Ubuntu 16.04 64b). I see a > fading only when hovering over the X icon of a minimized window but it > doesn't flicker. > > Is this on OS X? > > Regards .. Subbu > > On 18/04/19 1:32 AM, Fabio Niephaus wrote: > > Hi all, > > > > I just downloaded the latest trunk build (Squeak5.3alpha-18491-64bit, > > see [1]) and noticed this weird hover animation: > > button.gif > > > > It seems that only the close buttons (in all system windows) are > > effected and I have no idea why and since when. Other buttons behave as > > usual. > > > > Does anyone have an idea what this could be and how to fix it? > > > > Fabio > > > > > > [1] http://files.squeak.org/5.3alpha/Squeak5.3alpha-18491-64bit/ > > > > > >

3 7

← Newer
1
...
4
5
6
7
8
9
10
...
13
Older →