Planet Squeak Code

Fix a defect in Parser>>#parseCue:noPattern:ifFail:

Full failure case description:

Run the following statement:
Compiler evaluate: ''''''''
In the appearing error window, enter any valid smalltalk expression and save it. Before loading this commit, it will give you a NonBooleanError as doItFlag was set too late (and so was not passed to SyntaxErrorNotification).

June 17, 2019 08:51 PM

Add a method to play a random episode

by Sourav Datta (soura.jagat@gmail.com) at June 17, 2019 04:07 PM

Fix platform name for unix

by Sourav Datta (soura.jagat@gmail.com) at June 17, 2019 03:53 PM

Empty commit

by Sourav Datta (soura.jagat@gmail.com) at June 17, 2019 07:31 AM

CommandShell 4.7.2
Support for Pharo 7. Use Opal compiler and update unit tests accordingly

by Dave Lewis (lewis@mail.msen.com) at June 16, 2019 04:01 PM

CommandShell 4.7.2
Support for Pharo 7. Use Opal compiler and update unit tests accordingly

by Dave Lewis (lewis@mail.msen.com) at June 16, 2019 04:01 PM

CommandShell 4.7.2
Support for Pharo 7. Use Opal compiler and update unit tests accordingly

by Dave Lewis (lewis@mail.msen.com) at June 16, 2019 04:01 PM

CommandShell 4.7.2
Support for Pharo 7. Use Opal compiler and update unit tests accordingly

by Dave Lewis (lewis@mail.msen.com) at June 16, 2019 04:01 PM

A configuration file - with errors

by Sourav Datta (soura.jagat@gmail.com) at June 16, 2019 01:28 PM

Initial commit

by Sourav Datta (soura.jagat@gmail.com) at June 16, 2019 01:11 PM

I ported initial attempts to subclass an important stateMachine, from each of SSL and SSH, to be rooted at ParrotTalk's SessionOperations. More work is needed, including defining active frameSpecifications that can detect appropriate frames for these new Protocols, in a new FrameAnalyzer, to be used by the new SessionProtocolSelector. I renamed the PaarrotTalk SessionOperations. The current hierarchy of SessionOperations as follows:

SessionOperations...
- ParrotTalkSessionOperations_v3_8
- ParrotTalkSessionOperations_v3_7
- ParrotTalkSessionOperations_v3_6
- SSLHandshakeStateMachine
- SSHTransportHandshakeStateMachine

by Alan Pinch (alan.c.pinch@gmail.com) at June 09, 2019 01:01 AM

I ported initial attempts to subclass an important stateMachine, from each of SSL and SSH, to be rooted at ParrotTalk's SessionOperations. More work is needed, including defining active frameSpecifications that can detect appropriate frames for these new Protocols, in a new FrameAnalyzer, to be used by the new SessionProtocolSelector. I renamed the PaarrotTalk SessionOperations. The current hierarchy of SessionOperations as follows:

SessionOperations...
- ParrotTalkSessionOperations_v3_8
- ParrotTalkSessionOperations_v3_7
- ParrotTalkSessionOperations_v3_6
- SSLHandshakeStateMachine
- SSHTransportHandshakeStateMachine

by Robert Withers (robert.withers@protonmail.com) at June 09, 2019 01:01 AM

Ported in http://squeakvm.org/unix/goodies/PseudoTTY-3.2-4.st into this Telnet package.

by Robert Withers (robert.withers@protonmail.com) at June 09, 2019 12:39 AM

Ported in http://squeakvm.org/unix/goodies/PseudoTTY-3.2-4.st into this Telnet package.

by Alan Pinch (alan.c.pinch@gmail.com) at June 09, 2019 12:39 AM

Ensured that the rip off of ProtocolState in ParrotTalk remains viable. This class originally came from the telnet change script, http://squeakvm.org/unix/goodies/telnet.301.cs, published by Ian Piumarta. Yay, Ian! http://piumarta.com/cv/bio.html

by Robert Withers (robert.withers@protonmail.com) at June 09, 2019 12:34 AM

Ensured that the rip off of ProtocolState in ParrotTalk remains viable. This class originally came from the telnet change script, http://squeakvm.org/unix/goodies/telnet.301.cs, published by Ian Piumarta. Yay, Ian! http://piumarta.com/cv/bio.html

by Alan Pinch (alan.c.pinch@gmail.com) at June 09, 2019 12:34 AM

ensured ProtoclState is defined here, used by the statemaps. This class I had forgetten where I had harvested. It turns out this class was originally from http://squeakvm.org/unix/goodies/telnet.301.cs. Yay Ian Piumarta! http://piumarta.com/cv/bio.html

by Robert Withers (robert.withers@protonmail.com) at June 09, 2019 12:32 AM

ensured ProtoclState is defined here, used by the statemaps. This class I had forgetten where I had harvested. It turns out this class was originally from http://squeakvm.org/unix/goodies/telnet.301.cs. Yay Ian Piumarta! http://piumarta.com/cv/bio.html

by Alan Pinch (alan.c.pinch@gmail.com) at June 09, 2019 12:32 AM

ported to ParrotTalk-rww.30

by Alan Pinch (alan.c.pinch@gmail.com) at June 09, 2019 12:24 AM

ported to ParrotTalk-rww.30

by Robert Withers (robert.withers@protonmail.com) at June 09, 2019 12:24 AM

ported to ParrotTalk-rww.30

by Robert Withers (robert.withers@protonmail.com) at June 09, 2019 12:24 AM

ported to ParrotTalk-rww.30

by Alan Pinch (alan.c.pinch@gmail.com) at June 09, 2019 12:24 AM

ported http://squeakvm.org/unix/goodies/telnet.301.cs to ParrotTalk

by Robert Withers (robert.withers@protonmail.com) at June 09, 2019 12:23 AM

Reworking the intial Session stack to have a SessionOperations which does PAPS: ParrotTalk Automated Protocol Selection. http://callistohouse.club/index.php/2019/06/08/redesigning-parrottalk-for-automated-protocol-selection/ **Leaves**
8.4% {813ms} ByteArray>>bitXor:
7.2% {696ms} LargePositiveInteger(Integer)>>bitShift:
6.7% {648ms} SHA1>>hashStream:
6.2% {604ms} ThirtyTwoBitRegister>>leftRotateBy:
6.0% {581ms} SmallInteger(Number)>>negative
5.4% {524ms} SHA1>>finalHash
5.1% {491ms} ThirtyTwoBitRegister>>+=
4.7% {457ms} ThirtyTwoBitRegister>>load:
4.7% {450ms} ProcessorScheduler class>>idleProcess
4.5% {440ms} ThirtyTwoBitRegister>>bitXor:
3.4% {331ms} [] SystemProgressMorph(Morph)>>updateDropShadowCache
2.8% {267ms} ThirtyTwoBitRegister class>>new
2.5% {237ms} Array(SequenceableCollection)>>do:
2.4% {229ms} ThirtyTwoBitRegister>>asInteger
2.1% {206ms} LargePositiveInteger(Integer)>>asByteArrayOfSize:
1.9% {182ms} ReadStream(PositionableStream)>>atEnd
1.6% {157ms} ThirtyTwoBitRegister>>bitAnd:
1.6% {152ms} GrafPort(BitBlt)>>basicDisplayString:from:to:at:strikeFont:kern:
1.5% {143ms} [] Delay>>wait
1.4% {138ms} SmallInteger>>digitLength
1.4% {132ms} DisplayScreen(Form)>>depth
1.3% {129ms} Point>>=
1.2% {118ms} SmallInteger>>bitShift:

**Memory**
old +0 bytes
young -1,758,392 bytes
used -1,758,392 bytes
free +1,758,392 bytes

**GCs**
full 0 totalling 0 ms (0% uptime)
incr 955 totalling 187 ms (1.9% uptime), avg 0.2 ms
tenures 7,506 (avg 0 GCs/tenure)
root table 0 overflows

by Alan Pinch (alan.c.pinch@gmail.com) at June 08, 2019 11:03 AM

Reworking the intial Session stack to have a SessionOperations which does PAPS: ParrotTalk Automated Protocol Selection. http://callistohouse.club/index.php/2019/06/08/redesigning-parrottalk-for-automated-protocol-selection/ **Leaves**
8.4% {813ms} ByteArray>>bitXor:
7.2% {696ms} LargePositiveInteger(Integer)>>bitShift:
6.7% {648ms} SHA1>>hashStream:
6.2% {604ms} ThirtyTwoBitRegister>>leftRotateBy:
6.0% {581ms} SmallInteger(Number)>>negative
5.4% {524ms} SHA1>>finalHash
5.1% {491ms} ThirtyTwoBitRegister>>+=
4.7% {457ms} ThirtyTwoBitRegister>>load:
4.7% {450ms} ProcessorScheduler class>>idleProcess
4.5% {440ms} ThirtyTwoBitRegister>>bitXor:
3.4% {331ms} [] SystemProgressMorph(Morph)>>updateDropShadowCache
2.8% {267ms} ThirtyTwoBitRegister class>>new
2.5% {237ms} Array(SequenceableCollection)>>do:
2.4% {229ms} ThirtyTwoBitRegister>>asInteger
2.1% {206ms} LargePositiveInteger(Integer)>>asByteArrayOfSize:
1.9% {182ms} ReadStream(PositionableStream)>>atEnd
1.6% {157ms} ThirtyTwoBitRegister>>bitAnd:
1.6% {152ms} GrafPort(BitBlt)>>basicDisplayString:from:to:at:strikeFont:kern:
1.5% {143ms} [] Delay>>wait
1.4% {138ms} SmallInteger>>digitLength
1.4% {132ms} DisplayScreen(Form)>>depth
1.3% {129ms} Point>>=
1.2% {118ms} SmallInteger>>bitShift:

**Memory**
old +0 bytes
young -1,758,392 bytes
used -1,758,392 bytes
free +1,758,392 bytes

**GCs**
full 0 totalling 0 ms (0% uptime)
incr 955 totalling 187 ms (1.9% uptime), avg 0.2 ms
tenures 7,506 (avg 0 GCs/tenure)
root table 0 overflows

by Robert Withers (robert.withers@protonmail.com) at June 08, 2019 11:03 AM

Update for users not being found

by Bracken Spencer (bracken.spencer@gmail.com) at June 07, 2019 10:57 PM

Tell TextMorphs in Flaps to wrap at parent boundary, rather than extend across the whole display (as exposed by enabling debug code in TextMorph>>drawOn: ). Must execute the following (as postscript of MorphicExtras package, perhaps) to give life to the change:

FlapTab allSubInstancesDo: [:ft | ft reformatTextualTab]

June 07, 2019 10:02 PM

empty log message

June 07, 2019 09:16 PM

empty log message

June 07, 2019 09:01 PM

Password was very specific for ServerDirectory.
Re-factor Password into a more generic password holder (usuable in other classes).
Create ServerPassword as a sub-class of Password with necessary specilizations moved down to it.
Make ServcieDirectory point to ServerPassword.

This allows us to use Password generally to store a password in memory (encoded) during a Squeak session, which is cleared out when saving. The intended use case is to not store passwords in code or in the file system - instead prompt the user at first use and cache it for the rest of the life of the session.

by Chris Cunningham (cunningham.cb@gmail.com) at June 07, 2019 07:56 PM

- fixed test failing in recent Squeak versions (#sortBy: -> #sort:, #= -> #hasEqualElements:)

by Levente Uzonyi (leves@elte.hu) at June 07, 2019 07:49 AM

Extends commentary to point to #cull:.

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at June 07, 2019 07:12 AM

Update URLs and comments

by Bracken Spencer (bracken.spencer@gmail.com) at June 06, 2019 08:57 PM

More robust tests of #joinSeparatedBy:.

by Chris Muller (ma.chris.m@gmail.com) at June 05, 2019 02:44 AM

Additional test for #joinSeparatedBy: describes the expected behavior for unordered collections.

by Chris Muller (ma.chris.m@gmail.com) at June 05, 2019 02:15 AM

Additional test for #joinSeparatedBy: describes the expected behavior for unordered collections.

by Chris Muller (ma.chris.m@gmail.com) at June 04, 2019 09:54 PM

Additional test for #joinSeparatedBy: describes the expected behavior for unordered collections.

by Chris Muller (ma.chris.m@gmail.com) at June 04, 2019 08:32 PM

- Move utility methods of Collection to 'utilities'.
- #joinSeparatedBy: is useful even for non-SequenceableCollections.
- Speed up String>>#subStrings:.

by Chris Muller (ma.chris.m@gmail.com) at June 04, 2019 07:34 PM

Change CodeHolder>>testRunSuite: -- if multiple tests fail, instead of a UIManager dialog, open a TestRunner window that provides specific information.

Depends on SUnitGUI-ct.70.

May 31, 2019 12:15 PM

Add convenience method (#newForSuite:) for instance creation of TestRunner.

May 31, 2019 12:15 PM

Test Collection>>asStringByDelimiter (cf. Collections, ct.827)

May 31, 2019 11:52 AM

Add convenience method for joining strings (Collection>>asStringByDelimiter:)

May 31, 2019 11:49 AM

merge cmfcmf.357

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 31, 2019 09:49 AM

Merge cmfcmf.1216

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 31, 2019 09:49 AM

Test Random>>roll:

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 31, 2019 08:43 AM

Make Random>>roll: work again and add support for constant operands

This version fixes three issues:

1. Random>>roll: was not working anymore. The following code only produced an error:

Random new roll: '1d20'

This happened due to an issue with Random>>diceToken: which used Number>>readFrom: to extract numbers from the string. Calling Number readFrom: '1d20' results in 100000000000000000000 instead of the expected 1, because $d is seen as an exponent letter by the ExtendedNumberParser used by Number>>readFrom: (see ExtendedNumberParser>>exponentLetters).
I therefore replaced Number>>readFrom: by Integer>>readFrom:, which doesn't use the exponent letters.

2. I also fixed a minor issue with the mini-grammar's 'dice' rule. Before this version, it read as if it only supported one or two operands, when it really supported an unlimited number of operands.

3. The mini-grammer's 'expr' rule read as if it supported constant operands (e.g., '1d20+5' or '42'), because 'expr' was allowed to be just 'num'. As far as I can gather, this has never worked (but I might be wrong). This is now also fixed by always setting res to the token read if the token is a number. If the token is neither a number nor $d, an error is now signalled.

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 31, 2019 08:43 AM

Test Random>>roll:

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 31, 2019 08:33 AM

Make Random>>roll: work again and add support for constant operands

This version fixes three issues:

1. Random>>roll: was not working anymore. The following code only produced an error:

Random new roll: '1d20'

This happened due to an issue with Random>>diceToken: which used Number>>readFrom: to extract numbers from the string. Calling Number readFrom: '1d20' results in 100000000000000000000 instead of the expected 1, because $d is seen as an exponent letter by the ExtendedNumberParser used by Number>>readFrom: (see ExtendedNumberParser>>exponentLetters).
I therefore replaced Number>>readFrom: by Integer>>readFrom:, which doesn't use the exponent letters.

2. I also fixed a minor issue with the mini-grammar's 'dice' rule. Before this version, it read as if it only supported one or two operands, when it really supported an unlimited number of operands.

3. The mini-grammer's 'expr' rule read as if it supported constant operands (e.g., '1d20+5' or '42'), because 'expr' was allowed to be just 'num'. As far as I can gather, this has never worked (but I might be wrong). This is now also fixed by always setting res to the token read if the token is a number. If the token is neither a number nor $d, an error is now signalled.

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 31, 2019 08:33 AM

Send correct message when primitive fails (>>primitiveFailed instead of >>primitiveFail)

I found no other occurrences of >>primitiveFail in the image.

by Patrick Rein (patrick.rein@gmail.com) at May 29, 2019 08:18 PM

- Fix from Tim Johnson prevents a DNU from ChangeSorter under certain conditions.
- Add ability to filter methods from a MessageSet based on package they're NOT in (helpful for filtering test methods, or identifying methods in the wrong package).

by Chris Muller (ma.chris.m@gmail.com) at May 25, 2019 10:49 PM

- Moved three methods belonging to Chronology to that package.

by Chris Muller (ma.chris.m@gmail.com) at May 25, 2019 10:37 PM

- Moved several methods belonging to Chronology to that package.

by Chris Muller (ma.chris.m@gmail.com) at May 25, 2019 10:30 PM

SUCCESS compiling interference.wasm
https://github.com/ColinEberhardt/wasm-interference

May 25, 2019 11:42 AM

empty log message

May 25, 2019 10:37 AM

Test for asMicroSeconds.

by Chris Muller (ma.chris.m@gmail.com) at May 24, 2019 10:36 PM

Simple speedup by caching the result of getSeconds in an inst var. Lots of other values are defined in terms of getSeconds so this simply eliminates duplicating the large integer arithmetic in getSeconds.

by Chris Muller (ma.chris.m@gmail.com) at May 24, 2019 10:36 PM

- Make #utcOffset: match the prior behavior.
- Move Duration convenience constructors, String-to-date converting methods, and benching API to this package.

by Chris Muller (ma.chris.m@gmail.com) at May 24, 2019 10:36 PM

- Make #utcOffset: match the prior behavior.
- Add #microseconds to the API, too.

300 microSeconds
1 second asMicroSeconds

- Move Duration convenience constructors, String-to-date converting methods, and benching API to this package.

by Chris Muller (ma.chris.m@gmail.com) at May 24, 2019 10:36 PM

empty log message

May 24, 2019 05:48 PM

The Result of a Test which is tagged as an #expectedFailure IS a failure if the test passed.
Likewise, when a should: of a test which is ragged as an expectedFailure fails, the TestResult itself is considered passed, not failed.
This fixes the SUnit browser to display these TestResults accordingly, to not falsely include these "failed" Results in list because they were already expected to.

by Chris Muller (ma.chris.m@gmail.com) at May 24, 2019 02:39 AM

Upgrade stable version to 1.6.1 (do not depend on Interval=Array and accelerate LapackMatrix sum)

May 21, 2019 02:52 PM

Upgrade stable version to 1.6.1 (do not depend on Interval=Array and accelerate LapackMatrix sum)

May 21, 2019 02:52 PM

Accelerate LapackMatrix sum by using BLAS xDOTU

May 21, 2019 02:37 PM

Fixes the visuals for halo-radio buttons in the preference browser.

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 21, 2019 09:35 AM

Replace the few sends to #valueWithPossibleArgument: with #cull: because there is no need to expect blocks with more than one argument to be filled with nils.

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 21, 2019 08:48 AM

Replace the few sends to #valueWithPossibleArgument: with #cull: because there is no need to expect blocks with more than one argument to be filled with nils. Updates comments.

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 21, 2019 08:47 AM

correct for border related changes since prior release

by tim rowledge (tim@rowledge.org) at May 20, 2019 10:33 PM

Remove default font from text spec:
1) Existing tool builders only pass fonts to widgets if not nil.
2) Existing widgets consider default fonts outside the tool-builder framework anyway.

Thanks to Subbu for this!

by Marcel Taeumel (marcel.taeumel@hpi.uni-potsdam.de) at May 20, 2019 08:34 AM

Test for asMicroSeconds.

by Chris Muller (ma.chris.m@gmail.com) at May 20, 2019 04:18 AM

- Make #utcOffset: match the prior behavior.
- Add #microseconds to the API, too.

300 microSeconds
1 second asMicroSeconds

- Move Duration convenience constructors, String-to-date converting methods, and benching API to this package.

by Chris Muller (ma.chris.m@gmail.com) at May 20, 2019 04:17 AM

- Make #utcOffset: match the prior behavior.
- Move Duration convenience constructors in Number to this package.

by Chris Muller (ma.chris.m@gmail.com) at May 18, 2019 09:44 PM

With the UTC / DateAndTime changs, DateAndTime>>utcOffset: changed to update the existing instance in place instead of creating a new instance.
The change fixes #asLocal to create a new instance, bypassing #utcOffset:.
Follows the same logic as used in #asUTC

by Chris Muller (ma.chris.m@gmail.com) at May 18, 2019 09:44 PM

- Make #utcOffset: match the prior behavior.
- Move Duration convenience constructors, String-to-date converting methods, and benching API to this package.

by Chris Muller (ma.chris.m@gmail.com) at May 18, 2019 09:29 PM

Name: System-mt.1065
Author: mt
Time: 14 May 2019, 11:14:58.077441 am
UUID: 3ad59119-652a-fa46-8dc5-8b3747993363
Ancestors: System-dtl.1064

Clean up AbstractEvent:
- Make it more clear that "environment" is a dictionary local to system-change events.
- Remove #environment message to avoid mixup with Object >> #environment.
- Reduce the nunmber of inst-var references.
- Fix several message categories.
- Add missing #environmentKind to SystemChangeNotifier. For consistency. I have no clue why those re-directs exist. Maybe because "AbstractEvent classKind" is hard to read but "SystemChangeNotifier classKind" is not.

by Dave Lewis (lewis@mail.msen.com) at May 18, 2019 09:17 PM

Name: System-dtl.1064
Author: dtl
Time: 13 May 2019, 7:06:32.400119 pm
UUID: 66a39f74-a4b5-41d0-8e02-c0d01632080d
Ancestors: System-pre.1063

Use Url rather than deprecated URI in ProjectLauncher>>startUpAfterLogin.
This prevents command line startup scripts from failing due to a deprecation warning.
Also fix a comment typo.

by Dave Lewis (lewis@mail.msen.com) at May 18, 2019 08:43 PM

Name: Kernel-nice.1234
Author: nice
Time: 14 May 2019, 12:40:59.140364 am
UUID: 3c271006-81c5-49e7-8131-b65c154b009f
Ancestors: Kernel-nice.1233

Introduce settable parameters for tuning the Large Integer arithmetic thresholds.

Use these parameters in the accelerated arithmetic.

For Burnikel Ziegler, ensure at least two recursions by using twice the threshold of digitDiv21: before engaging a digitDivSplit: - this somehow mitigates the overhead cost of digitDivSplit:

by Dave Lewis (lewis@mail.msen.com) at May 18, 2019 08:39 PM

Name: Kernel-nice.1233
Author: nice
Time: 13 May 2019, 6:32:30.507955 pm
UUID: 8ba1a42b-88c8-1641-8a1a-bea810163ec2
Ancestors: Kernel-nice.1232

Oups fix creeping of sqrt2, it was only for bench purpose.
Sorry for multiple commits.

I rely too much on (alt shift i) to ignore methods, but sometimes I miss one.
It would be cool to have a way to hide the ignored methods before committing.

by Dave Lewis (lewis@mail.msen.com) at May 18, 2019 08:35 PM

Name: Kernel-nice.1232
Author: nice
Time: 13 May 2019, 5:43:37.253569 pm
UUID: 880030b9-91d0-244b-9198-b7b6f9454584
Ancestors: Kernel-nice.1231

Make sure that LargePositiveInteger sqrt are always correctly rounded to nearest Float if inexact.

Note that I accidentally introduced a rounding bug in LargePositiveInteger sqrt which was not in original Integer>>#sqrt:
(self bitAnd: 1) should have been (integerResult bitAnd: 1).
Apologizes.

But this formulation was subject to double-rounding error anyway (asFloat did perform a second rounding, which may lead to incorrect rounding), so that did not really matter...

Concerning performance, here are the bench results, after correcting the original version (I send twice self asFloat, which was a slip, and the original did not test mightBeASquare either when self asFloat = Float infinity)
- When (self mighBeASquare), new code is equivalent, and becomes more performant for huge values
This is due to sqrtRem which avoids evaluating a #squared for no additional price
Note that 7 large ints out of 256 mightBeASquare
- else it depends on bit range, new code is :
* as performant in range (SmallInteger maxVal highBit + 1 to: Float precision * 2)
that's the case of vast majority of large int in a "normal" image
* less performant in range (Float precision * 2 + 1 to: Float emax) by 3x to 5x
that's because asFloat sqrt is cheaper than sqrtRem
* more performant in range (Float emax + 1 to: infinity) by large
this is due to evaluating sqrtFloor on a much smaller LargePositiveInteger
(but this trick could have been added in inexact-rounding variant too)

So the exact rounding:
- does not require additional code (both are equivalent)
- does not cost any performance penalty in most common cases (small LargePositiveInteger); the penalty is only in medium range (107 to 1023 bits).

In a word, it's worth.

by Dave Lewis (lewis@mail.msen.com) at May 18, 2019 08:29 PM

Name: Collections-mt.833
Author: mt
Time: 13 May 2019, 9:46:28.73801 am
UUID: 44057ed3-9b55-0b49-8472-71d5c3fdbeeb
Ancestors: Collections-mt.832

Second iteration of #take: (and #any:). #any: relates to #anyOne and thus signals an error if the collection is not large enough. #take: uses #any: but accounts for smaller collections.

by Dave Lewis (lewis@mail.msen.com) at May 18, 2019 08:20 PM

Name: Collections-mt.832
Author: mt
Time: 9 May 2019, 3:27:06.069782 pm
UUID: b3c087f4-c2bc-d542-91d7-9c214ae3a97f
Ancestors: Collections-nice.831

Adds #take: to create a sub-collection from any collection by specifying the number of elements. Works like #first: for sequenceable collections but does not fail if collection is too small.

by Dave Lewis (lewis@mail.msen.com) at May 18, 2019 08:17 PM

Add tests for round trip conversion of Color fromString: printHtmlString.

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 16, 2019 06:16 PM

Use a map rgb->#names rather than iterating thru/performing all known colorNames.

This is especially useful if we intend to add more color names.
Note that names do not need to be unique.
The first appearing name in colorNames will be used.

Color colorNames collect: [:sym | Color perform: sym].

(Color colorNames reject: [:sym | (Color perform: sym) name = sym])
collect: [:sym | sym -> (Color perform: sym) name].

The new class variable is initialized in postscript.
It must be re-initialized each time we change the definition of a named Color.

The rgb code has been used as key rather than the Color itself.
This is because it is unique and cheap (SmallInteger).

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 16, 2019 01:14 PM

I see that Marcel used something like
https://gist.github.com/haggen/c91ed87700e5971f6fc6

I propose to reduce crayon shades overlapping by adopting different references

blueberry
(Encycolorpedia) https://encycolorpedia.com/4f86f7
(Crayola) https://en.wikipedia.org/wiki/List_of_Crayola_crayon_colors
ice (Corel ice blue) https://en.wikipedia.org/wiki/Shades_of_blue#Ice_blue
lemon
(Encycolorpedia lemon) https://encycolorpedia.com/fff700
(Encycolorpedia lemon yellow) https://en.wikipedia.org/wiki/Lemon_(color)#Lemon_yellow
(Crayola lemon) https://en.wikipedia.org/wiki/Shades_of_yellow#Lemon
licorice (Crayola-Encycolorpedia) https://en.wikipedia.org/wiki/Shades_of_black#Licorice
snow
(Encycolorpedia) https://encycolorpedia.com/fffafa
(X11) https://en.wikipedia.org/wiki/Shades_of_white#Snow
spring (X11 spring green) https://en.wikipedia.org/wiki/Spring_green
turquoise (X11-Encycolorpedia) https://en.wikipedia.org/wiki/Shades_of_cyan#Turquoise

Or should we have sort of factories?
(Color x11 turquoise vs Color macCrayon turquoise)

Of course, it opens some sort of big can:
https://encycolorpedia.com/named
https://en.wikipedia.org/wiki/X11_color_names
https://en.wikipedia.org/wiki/List_of_colors_(compact)

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 16, 2019 11:02 AM

Round accelerated arithmetic chunks to upper multiple of 4 bytes rather than to lower.

I believe that this marginally improves the performance because it's a tiny bit better to recompose a longer least significant chunk with a shorter most significant chunk.

If someone wants to confirm...
It's better to tune the threshold before benchmarking.
See LargeArithmeticBench from http://www.squeaksource.com/STEM.html and http://smallissimo.blogspot.com/2019/05 blog for details.

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 15, 2019 10:08 PM

Yet another "repair" of the dependency browser tests.

by Patrick Rein (patrick.rein@gmail.com) at May 15, 2019 07:27 PM

- Make #utcOffset: match the prior behavior.
- Move Duration convenience constructors in Number to this package.

by Chris Muller (ma.chris.m@gmail.com) at May 15, 2019 03:33 AM

Fixed DurationTest>>testNormalizeNanoSeconds to match new way of printing partial seconds from Chronology-Core-nice.42

"Always print duration subseconds by group of 3 digits (ms, us, ns)"

by Chris Cunningham (cunningham.cb@gmail.com) at May 15, 2019 02:42 AM

Fix TextEditor>>#hasMultipleLinesSelected to consider actual lines, instead of wrapped lines.

by Chris Muller (ma.chris.m@gmail.com) at May 14, 2019 10:53 PM

With the UTC / DateAndTime changs, DateAndTime>>utcOffset: changed to update the existing instance in place instead of creating a new instance.
The change fixes #asLocal to create a new instance, bypassing #utcOffset:.
Follows the same logic as used in #asUTC

by Chris Cunningham (cunningham.cb@gmail.com) at May 14, 2019 10:33 PM

- Shorter series for big bit lengths
- autotuning on an average of {1. 1/8+1} * threshold
since we increment by 1/8 in fine tuning, that's equivalent to taking 1/16 into account...
- change a few names

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 14, 2019 08:23 PM

Fixup another mess in report

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 10, 2019 03:46 PM

fixup slip of 2 printing of n bits in the report

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 10, 2019 03:02 PM

Fixup: bench D(10n,n) rather than twice M(n,10n)

Also offer a better output

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 10, 2019 02:09 PM

Let 68004 be a base version number, supporting the 68021 64-bit Spur format. Base number plus Spur bit plus platform float order bit yields 68021.

68004 + 2r10001 ==> 68021

Restore a unit test that covers 68021format.
Reorganize method categories to clarify bit assignment methods.

Notes: 68004 has not been used in practice but is considered valid. These changes do not affect the generated ckformat.c program.

by David T. Lewis (lewis@mail.msen.com) at May 10, 2019 11:27 AM

Bench single division, not gcd: !!!

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 10, 2019 09:29 AM

Fixup length12Pairs
overlappingPairsDo: is not collect: !!!

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 10, 2019 08:58 AM

LargeArithmeticBench is a utility for benchmarking large integer operations

It's preferable to use a high resolution clock if available.
If you don't run from Squeak trunk, the timing methods can be extracted from
https://source.squeak.org/trunk/Chronology-Core-nice.44.mcz

To obtain a report, first open a transcript:
Transcript open.

Then launch the bench and be patient (your computer may heat)
LargeArithmeticBench new benchReport.

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 10, 2019 08:42 AM

Convert numeric constants to strings for concatenation using #printString.
Required for Pharo compatibility, where the arguments of concatenation are not automatically coerced to strings.

by Eliot Miranda (eliot.miranda@gmail.com) at May 09, 2019 09:57 PM

Rename
RepeatedDivision->TrialDivisionByOdd
Sieve->TrialDivisionByPrime
The idea is to keep Sieve for other algorithm eventually

Introduce the Brent+Montgomery variant of Pollar-rho factorization.

To do: bench vs SQUFOF for various bit-length

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 09, 2019 07:15 PM

Avoid testLargestSmallInteger time-out on 64bits VM

(positive SmallInteger are on 60 bits, which is already quite large)

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 09, 2019 07:12 PM

Moved tests to Pharo compatibility package

by Guillermo Polito (guillermopolito@gmail.com) at May 09, 2019 03:45 PM

Fixes to correctly translate ifNotNil: [:arg & variants.

This makes Cog compile and run.

by Guillermo Polito (guillermopolito@gmail.com) at May 09, 2019 03:16 PM

Fixes to correctly translate ifNotNil: [:arg & variants.

This makes Cog compile and run.

by Guillermo Polito (guillermopolito@gmail.com) at May 09, 2019 03:15 PM

Fixes in AST translation to make it work as in Squeak
- to:do: => to:by:do: with extra arguments
- ifNil:ifNotNil: => ifTrue:ifFalse:
- fix arguments in TMethods
- fix comments in TMethods
- add name at the level of TParseNode (#name is not defined in Object anymore in Pharo)

Other
- Added FileDirectory compatibility layer using FileSystem behind the scenes (see FileDirectory and VMMakerFile classes).
- Added PackageOrganizer compatibility layer using RPackage behind the scenes.
- Extending Scanner and SystemNavigation with compatibility methods
- Extending Time with compatibility method

by Guillermo Polito (guillermopolito@gmail.com) at May 09, 2019 03:14 PM

Convert numeric constants to strings for concatenation using #printString.
Required for Pharo compatibility, where the arguments of concatenation are not automatically coerced to strings.

May 09, 2019 03:12 PM

Deprecates classes and methods related to executing Squeak in a web browser through a browser plugin. They can be loaded through the 60Deprecated-NSPlugin-System-Support package.

by Patrick Rein (patrick.rein@gmail.com) at May 09, 2019 02:35 PM

Deprecates classes and methods related to executing Squeak in a web browser through a browser plugin. They can be loaded through the 60Deprecated-NSPlugin-System-Support package.

by Patrick Rein (patrick.rein@gmail.com) at May 09, 2019 02:34 PM

Deprecates classes and methods related to executing Squeak in a web browser through a browser plugin. They can be loaded through the 60Deprecated-NSPlugin-System-Support package.

by Patrick Rein (patrick.rein@gmail.com) at May 09, 2019 02:33 PM

Deprecates classes and methods related to executing Squeak in a web browser through a browser plugin. They can be loaded through the 60Deprecated-NSPlugin-System-Support package.

by Patrick Rein (patrick.rein@gmail.com) at May 09, 2019 02:31 PM

Adds #take: to create a sub-collection from any collection by specifying the number of elements. Works like #first: for sequenceable collections but does not fail if collection is too small.

May 09, 2019 01:27 PM

Test the factorization of largest odd SmallInteger (assuming maxVal is odd)

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 09, 2019 01:15 PM

Introduce Shank's Square Form Factorization SQUFOF for large SmallInteger.

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at May 09, 2019 01:13 PM

Fix (0 bitShift: 100) is not normalized
(0 bitShift: 100) class = LargePositiveInteger.

Why is it not normalized?
First, primitiveBitShift (17) fails because shift is longer than SmallInteger bit length (maybe it should not?), then bitShiftMagnitude: (primDigitBitShiftMagnitude:) does not normalize a left shift result, assuming that primitive 17 already did the trivial work if result were a SmallInteger.

Why is normalization important?
because non normalized Integers do not behave like SmallInteger and can cause all sort of undefined behavior (I had an infinite loop because of that)

How to fix?
just handle the case in primitive fallback code

While at it:
Do not use bitShiftMagnitude: when we do not need to (case of left shift are equivalent to bitShift:), because playing with not normalized results may lead to undefined behavior.

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 09, 2019 08:14 AM

Ask whether a Parameter and Phrase tiles whether they're #isBooleanType, to allow proper distinction of the actual instances of Boolean.

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 09, 2019 07:01 AM

Allow identification of instances of Boolean via #isBoolean.

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 09, 2019 06:55 AM

Add ImageSnapshot>>reboot to resume the interpreter in a snapshot, discarding the previous object memory.

Requires #primitiveResumeFromSnapshot, not yet implemented in the VM.

by Dave Lewis (lewis@mail.msen.com) at May 04, 2019 02:12 PM

VMMaker 4.16.6
Primitive support for snapshot objects, answering object memory and header as in-image objects. Instead of disk-based snapshot file. Currently implemented in ContextInterpreter.

"ImageSnapshot new"

The primitives are:
#primitiveInterpreterStateSnapshot - snapshot the header information
#primitiveMemoryCopy - snapshot the memory
#primitiveMemorySnapshotBytesWithHeader - snapshot memory bytes and header
#primitiveMemorySnapshotWithHeader - snapshot memory bitmap and header

mage side support package ImageFormat in http://source.squeak.org/VMMaker:
ImageFileHeader fromValues: ImageFileHeader primInterpreterStateSnapshot.
ImageFileHeader primMemoryCopy.

Image side support from package ImageSnapshot in http://www.squeaksource.com/ImageSnapshot:
ImageSnapshot basicNew getSnapshot.
ImageBitmapSnapshot basicNew getSnapshot.

Snapshot to disk, equivalent to normal snapshot:
ImageSnapshot new saveAs: 'newimage.image'

by David T. Lewis (lewis@mail.msen.com) at May 04, 2019 01:23 PM

Name: Kernel-nice.1224
Author: nice
Time: 3 May 2019, 10:43:02.707788 pm
UUID: cf1a5ae4-ac18-47aa-880c-db91874842cb
Ancestors: Kernel-fn.1223

Refactor the fast LargeInteger operations

Rename:
- fastMultiply: -> multiplyByInteger:
Rationale: it's not necessarily fast but it's specifically for the case when we know that argument is an Integer.

Ensure symetry between * and /
- digitDiv:neg: -> divideByInteger:
- primDigitDiv:neg -> digitDiv:neg: (revert previous rename)

Rename
- karatsubaTimes: tooms3Times: -> digitMul22: digitMul33:
Rationale: it ensures symetry with digitDiv21: and digitDiv32:

Rename similarly
- squaredKaratsuba squaredToom3 squaredToom4 -> squaredByHalf squaredByThird squaredByFourth

Introduce digitMul23: for marginal improvment in case of partially well balanced

Remove the send of Inteval>>digitShiftSum:
Replace with #digitMulSplit: which is an optimized version in O(N) rather than O(N*log2 N)- see below

Rename
- recursiveDigitDiv: -> digitDivSplit: since it plays somehow a similar role than that of digitMulSplit: (decompose in digitDiv21: operations)
Use a O(N) recomposition of quotient

Reduce the cost of divide and conquer reconstruction phase by using (with great care) inplaceAddNonOverlapping:digitShiftBy: when possible.

Rationale: the cost is non completely dominated by non linear O(N^x), partly due to repeated #+ and #digitShift: which allocate, copy, allocate, copy, allocate, copy like Shlemiel.

We now have this sequence:

1) * / call primitive of SmallInteger or (optional) 64 bits LargeInteger
2) if fail, super * will handle coercion or call multiplyByInteger: divideByInteger:
3) multiplyByInteger: and divideByInteger: will dispatch to appropriate method based on heuristics on operands length
3.a) schoolbook digitMultiply:neg: digitDiv:neg: which call (optional) LargeInteger primitives or revert to slow 1-byte-limb fallback code
3.b) digitMultiplySplit: if not well balanced operands / recursiveDigitDiv: for about the same purpose
3.c) digitMul22: digitMul23: digitMul33: digitDiv21: digitDiv32:

Accelerate a bit the nthRoot: by providing a better (divide and conquer) initial guess a bit like sqrtRem algorithm.
While at it, use raisedToInteger: instead of raisedTo:
Since this small refactoring makes two tests fail (bad tests IMO), provide an assertion of pre-condition (the argument is a strictly positive integer)

by Dave Lewis (lewis@mail.msen.com) at May 04, 2019 12:50 PM

Name: Collections-nice.829
Author: nice
Time: 3 May 2019, 11:06:11.65639 pm
UUID: 695419ed-754d-41ff-8b51-b8715934b1f5
Ancestors: Collections-fn.828

Remove unused digitShiftSum: (since Kernel-nice.1224)

by Dave Lewis (lewis@mail.msen.com) at May 04, 2019 12:43 PM

VMMaker 4.16.6 - Better error message when interpreter encounters an unsupported image format.

Instead of this:
This interpreter (vers. 0) cannot read image file (vers. 68021).
Press CR to quit...

Say this:
This interpreter supports image formats up to 6505, cannot read file format 68021

by David T. Lewis (lewis@mail.msen.com) at May 03, 2019 10:11 PM

Remove unused digitShiftSum: (since Kernel-nice.1224)

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 03, 2019 09:06 PM

Apply refactorings of Kernel-nice.1224

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 03, 2019 08:46 PM

Refactor the fast LargeInteger operations

Rename:
- fastMultiply: -> multiplyByInteger:
Rationale: it's not necessarily fast but it's specifically for the case when we know that argument is an Integer.

Ensure symetry between * and /
- digitDiv:neg: -> divideByInteger:
- primDigitDiv:neg -> digitDiv:neg: (revert previous rename)

Rename
- karatsubaTimes: tooms3Times: -> digitMul22: digitMul33:
Rationale: it ensures symetry with digitDiv21: and digitDiv32:

Rename similarly
- squaredKaratsuba squaredToom3 squaredToom4 -> squaredByHalf squaredByThird squaredByFourth

Introduce digitMul23: for marginal improvment in case of partially well balanced

Remove the send of Inteval>>digitShiftSum:
Replace with #digitMulSplit: which is an optimized version in O(N) rather than O(N*log2 N)- see below

Rename
- recursiveDigitDiv: -> digitDivSplit: since it plays somehow a similar role than that of digitMulSplit: (decompose in digitDiv21: operations)
Use a O(N) recomposition of quotient

Reduce the cost of divide and conquer reconstruction phase by using (with great care) inplaceAddNonOverlapping:digitShiftBy: when possible.

Rationale: the cost is non completely dominated by non linear O(N^x), partly due to repeated #+ and #digitShift: which allocate, copy, allocate, copy, allocate, copy like Shlemiel.

We now have this sequence:

1) * / call primitive of SmallInteger or (optional) 64 bits LargeInteger
2) if fail, super * will handle coercion or call multiplyByInteger: divideByInteger:
3) multiplyByInteger: and divideByInteger: will dispatch to appropriate method based on heuristics on operands length
3.a) schoolbook digitMultiply:neg: digitDiv:neg: which call (optional) LargeInteger primitives or revert to slow 1-byte-limb fallback code
3.b) digitMultiplySplit: if not well balanced operands / recursiveDigitDiv: for about the same purpose
3.c) digitMul22: digitMul23: digitMul33: digitDiv21: digitDiv32:

Accelerate a bit the nthRoot: by providing a better (divide and conquer) initial guess a bit like sqrtRem algorithm.
While at it, use raisedToInteger: instead of raisedTo:
Since this small refactoring makes two tests fail (bad tests IMO), provide an assertion of pre-condition (the argument is a strictly positive integer)

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at May 03, 2019 08:43 PM

Adds a simple test case for listing file directory entries and adjusts the tearDown accordingly.

by Patrick Rein (patrick.rein@gmail.com) at May 03, 2019 02:34 PM

We have the ability to change the starting day of the week (Week>>startDay:).
This change adds #dayOfLocalWeek to DateAndTime and Timespan to return the indexed day of the week based on the altered starting day.
Original #dayOfWeek is left as-is along with all other working code.

by David T. Lewis (lewis@mail.msen.com) at May 02, 2019 10:06 PM

Recategorizes tests and test utility methods in SqueakSSL

by Patrick Rein (patrick.rein@gmail.com) at May 02, 2019 01:22 PM

Improves two test cases for MailMessages relying on old DateAndTime behavior.

by Patrick Rein (patrick.rein@gmail.com) at May 02, 2019 01:20 PM

Adds a number of new tests for the MIMEDocument class.

by Patrick Rein (patrick.rein@gmail.com) at May 02, 2019 01:10 PM

Recategorizes some test methods and expected failure methods.

by Patrick Rein (patrick.rein@gmail.com) at May 02, 2019 01:06 PM

Fixes a defect in BagTest spotted by Bob Arning

by Patrick Rein (patrick.rein@gmail.com) at May 02, 2019 07:34 AM

Recategorizes test methods in CollectionsTests

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 06:00 PM

Recategorizes test methods in KernelTests

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 05:43 PM

Recategorizes test methods in SUnit to create a good example to start from.

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 05:18 PM

Fixes a test which does not deal well with time precision beyond a second.

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 05:08 PM

Recategorizes some methods in WebClient-Tests

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 05:02 PM

Recategorizes test methods and expected failure methods into tests and failures categories.

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 04:59 PM

Makes the ProvideAnswerNotification handling more robust with regard to the input (actual value or index)

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 01:28 PM

Makes the ProvideAnswerNotification handling more robust with regard to the input (actual value or index)

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 01:27 PM

Makes the ProvideAnswerNotification handling more robust with regard to the input (actual value or index)

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 01:26 PM

Adds a test case for #valueSupplyingAnswers: for selecting from a list through specifying the element or the index.

by Patrick Rein (patrick.rein@gmail.com) at April 30, 2019 01:24 PM

use borderColor and borderWidth if set when building a pluggable list

by Patrick Rein (patrick.rein@gmail.com) at April 29, 2019 06:49 PM

Let TestRunner inherit from Model.
This is to avoid remnancy of TestRunner in Object's DependentsFields.

by Patrick Rein (patrick.rein@gmail.com) at April 29, 2019 06:45 PM

A hack to work around connectionTimedOut annoyances when opening packages from Trunk (sometimes).

by Patrick Rein (patrick.rein@gmail.com) at April 29, 2019 06:41 PM

Disable certificate validation on all platforms for the time being. It turns out, this does not only probably work on macOS, but also on Windows and Linux. The WebClient seems to have problems with some certificates used for popular domains, e.g. google.com and github.com. The Zinc library does not perform the validation as well at the moment.

by Patrick Rein (patrick.rein@gmail.com) at April 29, 2019 06:39 PM

Fix: FileSaverDialog would answer 'nil' instead of nil when nothing was done except for accepting the dialog

by Patrick Rein (patrick.rein@gmail.com) at April 29, 2019 06:35 PM

Fix: FileSaverDialog would answer 'nil' instead of nil when nothing was done except for accepting the dialog

Merged from inbox commit ToolBuilder-Morphic-jr.225

by Patrick Rein (patrick.rein@gmail.com) at April 29, 2019 06:35 PM

Improves the check for whether a keystroke for the text morph for edit view will change the text to send the #editText callback. Refactors the check by creating a cached character set.

by Patrick Rein (patrick.rein@gmail.com) at April 29, 2019 06:20 PM

Adds tests for the text morph for edit view which checks whether the right characters are filtered for editText: callbacks

by Patrick Rein (patrick.rein@gmail.com) at April 29, 2019 06:16 PM

No changes, Character cannot be immediate in V3 images.

Name: Collections-fn.828
Author: fn
Time: 29 April 2019, 12:52:37.794699 pm
UUID: a663df49-93bf-413e-a942-29f1d0fa4605
Ancestors: Collections-nice.827

Character shouldNotImplement postCopy.

by Dave Lewis (lewis@mail.msen.com) at April 29, 2019 11:37 AM

No changes, Float cannot be immediate in V3 images.

Name: Kernel-fn.1223
Author: fn
Time: 29 April 2019, 12:52:13.424813 pm
UUID: 910aa151-72fe-4f6c-9645-fa735fb17f63
Ancestors: Kernel-nice.1222

SmallInteger and SmallFloat64 shouldNotImplement postCopy.

by Dave Lewis (lewis@mail.msen.com) at April 29, 2019 11:28 AM

Character shouldNotImplement postCopy.

by Fabio Niephaus (code@fniephaus.com) at April 29, 2019 10:52 AM

SmallInteger and SmallFloat64 shouldNotImplement postCopy.

by Fabio Niephaus (code@fniephaus.com) at April 29, 2019 10:52 AM

Name: Kernel-nice.1222
Author: nice
Time: 28 April 2019, 3:55:49.124486 pm
UUID: e697844c-d6bd-4781-a572-553f79c98644
Ancestors: Kernel-nice.1221

Make fastMultiply: the default for multiplying integers

The scheme is:
- first try 64bit imul (primitive 29) if receiver is Large, or (primitive 9) if receiver is Small.
- then check for operand type in super *, use fastMultiply: if Integer
- then check receiver length and invoke O(N^2) schoolbook multiply if too small ( invoke LargeIntegers primitive thru digitMultiply:neg: )
- then check operand byte length
- then dispatch to Karatsuba or Toom3 (or future enhancements)

For medium integers (>64 bits) that's only 1 indirection more than previous implementation, so a very small (negligible) penalty.

For larger integers (a few thousand bits) that's a win.

Note that the length threshold heuristics may vary from one platform to another, one VM to another, and wether images are 32 or 64 bits...
We could make them class var, and offer some initialize method so as to automatically tune them.

by Dave Lewis (lewis@mail.msen.com) at April 28, 2019 09:48 PM

Name: Kernel-nice.1221
Author: nice
Time: 28 April 2019, 2:31:07.899491 am
UUID: 4aeee53e-f320-4ece-bf93-a5458f65bef3
Ancestors: Kernel-nice.1220

Fix broken pre-condition a3>=b/4 in sqrtRem.
While at it, care to explain.

by Dave Lewis (lewis@mail.msen.com) at April 28, 2019 09:43 PM

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.

by Dave Lewis (lewis@mail.msen.com) at April 27, 2019 12:55 PM

Name: Collections-fn.825
Author: fn
Time: 12 April 2019, 9:30:29.397159 am
UUID: 3110d8f6-fa38-4d91-8358-aed2eadbd9a7
Ancestors: Collections-nice.824

Just like strings, characters should convert themselves to an integer when involved in arithmetic with a number.

Example:
$c < 98.9 "false"
98.9 < $c "opened debugger, now returns true"

by Dave Lewis (lewis@mail.msen.com) at April 27, 2019 12:54 PM

Name: Collections-nice.824
Author: nice
Time: 7 April 2019, 10:40:26.559826 pm
UUID: e6d75dba-26a8-4945-a930-3d79f8cd4969
Ancestors: Collections-ul.823

Implement Collection>>#log2, since it already responds to #ln and #log...

Correct a Pharoism in DefaultSortFunction comment, there is no #threeWayCompareTo: because we prefer the space-ship operator <=>

Correct a slip in LazyCharacterSet comment.

Let ({1. 3/2. 2} as: Interval) work as it should.

Remove Interval>>#remove: since it duplicates unecessarily super remove:ifAbsent: (which shouldNotImplement already).

Don't spend too much time sorting an Interval, it's already sorted.

by Dave Lewis (lewis@mail.msen.com) at April 27, 2019 12:53 PM

Name: Kernel-nice.1220
Author: nice
Time: 27 April 2019, 2:36:07.52994 pm
UUID: b2eb6e2e-1dfa-4d23-9421-ec0e5e8d4f86
Ancestors: Kernel-fn.1216

Accelerate some huge Integer arithmetic
(This is a squash of inbox commits)

These algorithms use divide and conquer strategy that recursively split a problem into simpler problems.

1) Multiplication and Squaring

- Implement Karatsuba and 3-way Toom-Cook algorithms for fast large integer multiplication (a Bodrato Zanoni variant)

- Implement the 2-way asymetrical Karatsuba, 3-way symetrical, and 4-way asymetrical Toom-Cook squaring variant of Chung-Hasan. Note that asymetrical squareToom4 over-performs the symetrical squaredToom3 even for medium size (800 bytes).

- provide a fastMultiply: that dispatch on appropriate variant based on heuristics. Currently this fast multiplication is used only in LargePositiveInteger>>squared, and other algorithme below.

- slightly modify raisedToInteger: to use that squared.
This result in a small penalty for small number exponentation, but large speed up for big integers.

2) Square-root

- implement the Karatsuba-like square root algorithm from Paul Zimmerman.

3) Division

- Implement the recursive fast division of Burnikel-Ziegler for large integers and connect it to digitDiv:neg: when operands are large enough.

- Use this recursive algorithm to accelerate digitDiv:neg:

This is not the fastest known division which is a composition of Barrett and Newton-Raphson inversion - but is easy to implement and should have similar performances for at least a few thousand bytes long integers - see for example http://bioinfo.ict.ac.cn/~dbu/AlgorithmCourses/Lectures/Lec5-Fast-Division-Hasselstrom2003.pdf

4) Printing

- Use digitDiv:neg: in large integer printString so as to obtain the quotient (head) and remainder (tail) in a single operation. Together with divide and conquer division, this results in a factor of about 4x for 50000 factorial printString.


Examples on a 64 bits image/VM (MBP 2015 i5 2.7GHz)

[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.')

| x |
x := 50000 factorial - 10000 factorial + 5000 factorial - 1000 factorial + 500 factorial - 100 factorial + 50 factorial - 10 factorial + 5 factorial - 1.
{
[x printString] bench.
}
#('1.29 per second. 778 milliseconds per run.') - before
#('5.12 per second. 195 milliseconds per run.') - after

by Dave Lewis (lewis@mail.msen.com) at April 27, 2019 12:51 PM

Name: Kernel-fn.1216
Author: fn
Time: 27 April 2019, 11:08:43.467561 am
UUID: 4af5e126-9387-41b6-bd41-a6c526f0bd8a
Ancestors: Kernel-eem.1215

Make SmallInteger's method overrides for copying consistent with those of SmallFloat64.

by Dave Lewis (lewis@mail.msen.com) at April 27, 2019 12:46 PM

Add some tests for new huge Integer arithmetic algorithms

Note: I'd like to test things like:

x := self x106kbits
self assert: [x squaredToom4] runsFasterThan: [x squaredKaratsuba].

But I'm afraid that it might sometimes fail, depending on particular slave machnie load...

Benchmarking is an art...

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at April 27, 2019 12:45 PM

Name: System-cmm.1061
Author: cmm
Time: 4 April 2019, 6:30:34.295865 pm
UUID: d55f8c82-4dea-4d11-be0c-ff63c61b7e04
Ancestors: System-eem.1058

Metacello and GitInfrastructure tools are currently the best way to load projects hosted by github.com. Promote installation of these tools to the Tools menu.
While in there, make a couple of improvements to the Do menu.

by Dave Lewis (lewis@mail.msen.com) at April 27, 2019 12:43 PM

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.')

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at April 27, 2019 12:37 PM

Implement the recursive fast division of Burnikel-Ziegler for large integers and connect it to digitDiv:neg: when operands are large enough.

This is not the fastest known division which is a composition of Barrett and Newton-Raphson inversion - but is easy to implement and should have similar performances for at least a few thousand bytes long integers - see for example http://bioinfo.ict.ac.cn/~dbu/AlgorithmCourses/Lectures/Lec5-Fast-Division-Hasselstrom2003.pdf

Use digitDiv:neg: in large integer printString so as to obtain the quotient (head) and remainder (tail) in a single operation. Together with divide and conquer division, this results in a factor of about 3x for 50000 factorial printString.

Implement the 4-way Toom-Cook squaring variant of Chung-Hasan. This over-performs the symetrical squaredToom3 even for medium size (800 bytes).

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at April 27, 2019 12:37 PM

Fix large digitDiv:neg: sign mess.
Remove a useless temp in fastMultiply
Comment toom3 reference better (The work of Bodrato Zanoni deserve it)

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at April 27, 2019 12:37 PM

Accelerate some huge Integer arithmetic
(This is a squash of inbox commits)

These algorithms use divide and conquer strategy that recursively split a problem into simpler problems.

1) Multiplication and Squaring

- Implement Karatsuba and 3-way Toom-Cook algorithms for fast large integer multiplication (a Bodrato Zanoni variant)

- Implement the 2-way asymetrical Karatsuba, 3-way symetrical, and 4-way asymetrical Toom-Cook squaring variant of Chung-Hasan. Note that asymetrical squareToom4 over-performs the symetrical squaredToom3 even for medium size (800 bytes).

- provide a fastMultiply: that dispatch on appropriate variant based on heuristics. Currently this fast multiplication is used only in LargePositiveInteger>>squared, and other algorithme below.

- slightly modify raisedToInteger: to use that squared.
This result in a small penalty for small number exponentation, but large speed up for big integers.

2) Square-root

- implement the Karatsuba-like square root algorithm from Paul Zimmerman.

3) Division

- Implement the recursive fast division of Burnikel-Ziegler for large integers and connect it to digitDiv:neg: when operands are large enough.

- Use this recursive algorithm to accelerate digitDiv:neg:

This is not the fastest known division which is a composition of Barrett and Newton-Raphson inversion - but is easy to implement and should have similar performances for at least a few thousand bytes long integers - see for example http://bioinfo.ict.ac.cn/~dbu/AlgorithmCourses/Lectures/Lec5-Fast-Division-Hasselstrom2003.pdf

4) Printing

- Use digitDiv:neg: in large integer printString so as to obtain the quotient (head) and remainder (tail) in a single operation. Together with divide and conquer division, this results in a factor of about 4x for 50000 factorial printString.


Examples on a 64 bits image/VM (MBP 2015 i5 2.7GHz)

[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.')

| x |
x := 50000 factorial - 10000 factorial + 5000 factorial - 1000 factorial + 500 factorial - 100 factorial + 50 factorial - 10 factorial + 5 factorial - 1.
{
[x printString] bench.
}
#('1.29 per second. 778 milliseconds per run.') - before
#('5.12 per second. 195 milliseconds per run.') - after

by Nicolas Cellier (nicolas.cellier.aka.nice@gmail.com) at April 27, 2019 12:36 PM

Make SmallInteger's method overrides for copying consistent with those of SmallFloat64.

by Fabio Niephaus (code@fniephaus.com) at April 27, 2019 09:08 AM

- Fix a glitch in #tryInvokeHalo: which could lead to mis-identification of the correct halo target.
- Update the new Tools menu entry to read "Git Browser".

by Chris Muller (ma.chris.m@gmail.com) at April 27, 2019 01:43 AM

Add option to control reverb in the settings file

by tim rowledge (tim@rowledge.org) at April 26, 2019 11:08 PM

Change JsonTests>>testStreaming to compare to JsonObject new, rather than just testing isDictionary.

testStreaming should not only check that the result is a dictionary, but that it is empty.

by tim rowledge (tim@rowledge.org) at April 26, 2019 10:56 PM

2nd attempt to update JSONpackage dependency to tonyg.39b

by tim rowledge (tim@rowledge.org) at April 26, 2019 10:56 PM

better parsing of the sitekey in the cmdstream

by tim rowledge (tim@rowledge.org) at April 26, 2019 10:56 PM

Fix two failing tests on Squeak trunk due to Array ~= Interval refactoring.

Who is going to need that Array = Interval feature, probably nobody...
Err, myself! I know who to blame ;)

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at April 26, 2019 05:44 AM

Fix pharo7.x FFI loads:

April 25, 2019 07:34 PM

Fix pharo7.x FFI loads:

April 25, 2019 07:34 PM

Add a configuration for Pharo 7.x

April 25, 2019 07:02 PM

Add a configuration for Pharo 7.x

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at April 25, 2019 07:02 PM

Fix miss-cateforizing of #testSmallPackAugmenting

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at April 25, 2019 06:35 PM

Fix miss-cateforizing of #testSmallPackAugmenting

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at April 25, 2019 06:34 PM

Fix another Pharo7 refactoring s/OpalEncoderForSistaV1/EncoderForSistaV1/

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at April 24, 2019 08:17 PM

Quick recipe for surviving to pharo 7 refactorings.

In Pharo 7, we must access the methodNode properties with methodProperties

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at April 24, 2019 07:47 PM

Chip-8 interpreter

by Thiago da Silva Lino (thiagolino@yahoo.com.br) at April 21, 2019 10:27 AM

Update for 2019 64bits Spur VM

- don't override bitCount, it's in all recent Squeak now
- fix bug of karatsubaTimes for negative Integer: it is not OK to bitShift: -8*half because bitShift emulates 2-complement.
- revise isLargeEnoughForKaratsuba for 64bits 2019 Spur VM: Karatsuba is not interesting under 600 bytes! Your mileage may vary (stack/cog/spur 32/64 bits...)

These are the new timings on my 2015 core i5 MacBookPro:

Smalltalk garbageCollect.
Time millisecondsToRun: [1 to: 3000 do: [:x | FactorialPrimeSwing new factorialOf: x]].
610 610

Smalltalk garbageCollect.
Time millisecondsToRun: [1 to: 3000 do: [:x | x jmbkn2Factorial]].
455 463

Smalltalk garbageCollect.
Time millisecondsToRun: [1 to: 3000 do: [:x | x jmbknFactorial]].
471 469

Smalltalk garbageCollect.
Time millisecondsToRun: [1 to: 3000 do: [:x | x jmbkFactorial]].
472 469

Smalltalk garbageCollect.
Time millisecondsToRun: [1 to: 3000 do: [:x | x jmbFactorial]].
467 466

Smalltalk garbageCollect.
Time millisecondsToRun: [1 to: 3000 do: [:x | x niceFactorial]].
705 698

Smalltalk garbageCollect.
Time millisecondsToRun: [1 to: 3000 do: [:x | x svckFactorial]].
639 632

Smalltalk garbageCollect.
Time millisecondsToRun: [1 to: 3000 do: [:x | x svcFactorial]].
687 681

Smalltalk garbageCollect.
Time millisecondsToRun: [1 to: 3000 do: [:x | x factorial]]
3588 3632


For huge numbers, Karatsuba variants start paying:

[FactorialPrimeSwing new factorialOf: 50000] timeToRun.
61 65
[50000 jmbkn2Factorial] timeToRun.
66 67
[50000 jmbknFactorial] timeToRun.
69 69
[50000 jmbkFactorial] timeToRun.
69 68
[50000 svckFactorial] timeToRun.
88 88
[50000 niceFactorial] timeToRun.
90 93
[50000 jmbFactorial] timeToRun.
124 124
[50000 svcFactorial] timeToRun.
243 245

by nicolas cellier (nicolas.cellier.aka.nice@gmail.com) at April 17, 2019 10:38 PM

Avoid converting asFloat when comparing with inf

asFloat could overflow, and we want these to be true:

{
((1 asArbitraryPrecisionFloatNumBits: 53) timesTwoPower: 2000) ~= Float infinity.
((1 asArbitraryPrecisionFloatNumBits: 53) timesTwoPower: 2000) < Float infinity.
((-1 asArbitraryPrecisionFloatNumBits: 53) timesTwoPower: 2000) > Float infinity negated.
} reduce: #&

April 17, 2019 05:38 AM

Make it load with newer compiler in Pharo 6.1

April 13, 2019 10:26 AM

empty log message

March 27, 2019 10:41 AM

empty log message

March 27, 2019 10:39 AM

empty log message

March 27, 2019 08:07 AM

Name: Collections-ul.823
Author: ul
Time: 22 March 2019, 12:04:40.596433 pm
UUID: 2fef1e34-e45a-4f70-bb7b-56aa1c610df9
Ancestors: Collections-pre.822

Fixed bug in Heap >> #upHeap:. When the first element of a Heap was removed, the index of the first object was not always updated.

by Dave Lewis (lewis@mail.msen.com) at March 24, 2019 10:18 PM

empty log message

by Martin Stromberg (martinstromberg@yahoo.se) at March 24, 2019 08:52 PM

Name: Compiler-eem.403
Author: eem
Time: 19 March 2019, 11:58:47.238202 am
UUID: a0f07dce-0a58-422e-af37-32d5a3bd6546
Ancestors: Compiler-eem.402

Fixed yhree typos in a comment, and improved the class comments for ParseNodeEnumerator & subclass.

by Dave Lewis (lewis@mail.msen.com) at March 21, 2019 11:49 PM

Name: Compiler-eem.402
Author: eem
Time: 19 March 2019, 11:44:20.570473 am
UUID: 886de89c-a3ed-4fb5-a8ed-7f9bf78d69b6
Ancestors: Compiler-eem.401, Compiler-ul.401

Merge with Compiler-ul.401, eliminate undeclatred variable in ParseNodeWithPrecedingStatementEnumerator.

Name: Compiler-eem.401
Author: eem
Time: 19 March 2019, 9:28:16.827407 am
UUID: 7920c007-0974-48a7-b1b3-b4de923b90d4
Ancestors: Compiler-eem.400

Fix a slip in EncoderForSistaV1 class>>isTempStoreAt:in:, and fix a couple of typos nearby.

by Dave Lewis (lewis@mail.msen.com) at March 21, 2019 11:48 PM

Name: Compiler-ul.401
Author: ul
Time: 16 March 2019, 11:56:29.899053 pm
UUID: 395adc27-f48e-484c-9097-5197ea3a0155
Ancestors: Compiler-eem.400

- fixed typo

by Dave Lewis (lewis@mail.msen.com) at March 21, 2019 12:37 AM

Name: Collections-pre.822
Author: pre
Time: 20 March 2019, 8:05:20.383677 pm
UUID: 483c4461-cee4-4a4f-82d3-fbc03e7201cc
Ancestors: Collections-dtl.821

Adds #isMutator to Symbol which is analogous to asMutator.

by Dave Lewis (lewis@mail.msen.com) at March 21, 2019 12:36 AM

Name: System-eem.1057
Author: eem
Time: 16 March 2019, 12:25:59.281495 pm
UUID: af55a994-27d7-4ebe-84b6-d3f923523fc3
Ancestors: System-eem.1056

Decompose browseMethodsWithString:matchCase: to provide allMethodsWithString:matchCase:.

by Dave Lewis (lewis@mail.msen.com) at March 17, 2019 04:33 PM

Name: System-eem.1056
Author: eem
Time: 12 March 2019, 4:26:37.641499 pm
UUID: 5c24744b-c81e-460a-aca1-ce0099b23831
Ancestors: System-tpr.1055

Fix SystemNavigation>>allMethodsInCategory:

by Dave Lewis (lewis@mail.msen.com) at March 17, 2019 04:32 PM

Name: Kernel-eem.1215
Author: eem
Time: 16 March 2019, 12:38:28.555296 pm
UUID: 9fa7a504-70d6-45ae-9514-d905578da5af
Ancestors: Kernel-eem.1214

Add CompiledMethod>>pragmasAt: for convenient access to multiple pragmas of the same pragma selector.

by Dave Lewis (lewis@mail.msen.com) at March 17, 2019 04:29 PM

I found portNumber could be still used

March 17, 2019 09:03 AM

Let #setLocalOffsetForTimeZone: work for older Chronology versions

by Dave Lewis (lewis@mail.msen.com) at March 12, 2019 10:58 AM

Move DateAndTime>>asPosixSeconds to TZ-Olson and use #perform: to allow it to compile in Pharo and older Squeak

by Dave Lewis (lewis@mail.msen.com) at March 12, 2019 10:31 AM

Move DateAndTime>>asPosixSeconds to TZ-Olson and use #perform: to allow it to compile in Pharo and older Squeak

by Dave Lewis (lewis@mail.msen.com) at March 12, 2019 10:31 AM