Squeak-dev May 2019

squeak-dev@lists.squeakfoundation.org

36 participants
153 discussions

Proposal: Morphs in Text
by patrick.rein＠hpi.uni-potsdam.de 28 May '19

28 May '19

Hi everyone, please find attached a change set which includes: 1.) Some fixes to the Scanner infrastructure to support Morphs in Text better 2.) Improvements to describe how a Morph should be aligned with regard to the text. Relevant methods on Morph are: #textAnchorVerticalAlignment: #textAnchorPadding: #textAnchorConsumesHorizontalSpace: You can see an example by executing the body of the test: TextAnchorTest>>#testHavingAnAnchorCanBeAlignedDifferently !Warning: As this touches Scanner code a lot, loading this change set might make your image unresponsive! I would like to point out that the test cases are preliminary and a few of the methods still require polishing. Nevertheless, I would like to ask for comments on the change set, in particular regarding: 1.) Should the alignment information be stored in the Morph or the TextAnchorAttribute? Currently the information is stored in the Morph which parallels LayoutProperties. 2.) Is using caseOf: in Scanner code fine? I suspect it to be quite expensive which is probably not a good thing in Scanners? 3.) Should the cursor allow users to navigate (or select?) the "start of header" character that is used to denote the text anchor placement? 4.) Does anyone remember / know what the textAnchorType was intended for? The previous implementation largely ignored it and this one does so too. Thanks and best wishes, Patrick

1 0

The Inbox: Tools-cmm.849.mcz
by commits＠source.squeak.org 26 May '19

26 May '19

Chris Muller uploaded a new version of Tools to project The Inbox: http://source.squeak.org/inbox/Tools-cmm.849.mcz ==================== Summary ==================== Name: Tools-cmm.849 Author: cmm Time: 25 May 2019, 5:49:45.269032 pm UUID: 4e35d5b2-3233-4b12-8419-2476ff4d09e0 Ancestors: Tools-nice.847 - 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). =============== Diff against Tools-nice.847 =============== Item was changed: ----- Method: ChangeSorter>>setContents (in category 'code pane') ----- setContents "return the source code that shows in the bottom pane" | sel class strm changeType | self clearUserEditFlag. + myChangeSet ifNil: [^ contents := String empty]. "should not happen but can" + currentClassName ifNil: [^ contents := myChangeSet preambleString ifNil: [String empty]]. - currentClassName ifNil: [^ contents := myChangeSet preambleString ifNil: ['']]. class := self selectedClassOrMetaClass. (sel := self selectedMessageName) == nil ifFalse: [changeType := (myChangeSet atSelector: (sel := sel asSymbol) class: class). changeType == #remove ifTrue: [^ contents := 'Method has been removed (see versions)']. changeType == #addedThenRemoved ifTrue: [^ contents := 'Added then removed (see versions)']. class ifNil: [^ contents := 'Method was added, but cannot be found!!']. (class includesSelector: sel) ifFalse: [^ contents := 'Method was added, but cannot be found!!']. contents := class sourceCodeAt: sel. (#(prettyPrint prettyDiffs) includes: contentsSymbol) ifTrue: [contents := class prettyPrinterClass format: contents in: class notifying: nil]. self showingAnyKindOfDiffs ifTrue: [contents := self diffFromPriorSourceFor: contents]. ^ contents := contents asText makeSelectorBoldIn: class] ifTrue: [strm := WriteStream on: (String new: 100). (myChangeSet classChangeAt: (self withoutItemAnnotation: currentClassName)) do: [:each | each = #remove ifTrue: [strm nextPutAll: 'Entire class was removed.'; cr]. each = #addedThenRemoved ifTrue: [strm nextPutAll: 'Class was added then removed.']. each = #rename ifTrue: [strm nextPutAll: 'Class name was changed.'; cr]. each = #add ifTrue: [strm nextPutAll: 'Class definition was added.'; cr]. each = #change ifTrue: [strm nextPutAll: 'Class definition was changed.'; cr]. each = #reorganize ifTrue: [strm nextPutAll: 'Class organization was changed.'; cr]. each = #comment ifTrue: [strm nextPutAll: 'New class comment.'; cr. ]]. ^ contents := strm contents].! Item was changed: ----- Method: MessageSet>>filterMessageList (in category 'filtering') ----- filterMessageList "Allow the user to refine the list of messages." | builder menuSpec | builder := ToolBuilder default. menuSpec := builder pluggableMenuSpec new model: self; yourself. menuSpec addList: #( ('unsent messages' filterToUnsentMessages 'filter to show only messages that have no senders') - ('messages that send...' filterToSendersOf 'filter to show only messages that send a selector I specify') ('messages that do not send...' filterToNotSendersOf 'filter to show only messages that do not send a selector I specify') - ('messages whose selector is...' filterToImplementorsOf 'filter to show only messages with a given selector I specify') ('messages whose selector is NOT...' filterToNotImplementorsOf 'filter to show only messages whose selector is NOT a seletor I specify') - ('messages in current change set' filterToCurrentChangeSet 'filter to show only messages that are in the current change set') ('messages not in current change set' filterToNotCurrentChangeSet 'filter to show only messages that are not in the current change set') - ('messages in any change set' filterToAnyChangeSet 'filter to show only messages that occur in at least one change set') ('messages not in any change set' filterToNotAnyChangeSet 'filter to show only messages that do not occur in any change set in the system') - ('messages authored by me' filterToCurrentAuthor 'filter to show only messages whose authoring stamp has my initials') ('messages not authored by me' filterToNotCurrentAuthor 'filter to show only messages whose authoring stamp does not have my initials') - ('messages logged in .changes file' filterToMessagesInChangesFile 'filter to show only messages whose latest source code is logged in the .changes file') ('messages only in .sources file' filterToMessagesInSourcesFile 'filter to show only messages whose latest source code is logged in the .sources file') - ('messages with prior versions' filterToMessagesWithPriorVersions 'filter to show only messages that have at least one prior version') ('messages without prior versions' filterToMessagesWithoutPriorVersions 'filter to show only messages that have no prior versions') - ('uncommented messages' filterToUncommentedMethods 'filter to show only messages that do not have comments at the beginning') ('commented messages' filterToCommentedMethods 'filter to show only messages that have comments at the beginning') - ('messages in hardened classes' filterToMessagesWithHardenedClasses 'filter to show only messages of established classes (as opposed to Uniclasses such as Player23)') - ('methods in classes with matching names' filterToMatchingClassesNames 'filter to show only methods of classes with names that match the given criteria (wildcards are allowed)') ('methods in package...' filterToPackage 'filter to show only methods of a given package') + ('methods not in package...' filterToNotPackage 'filter to show only methods not of a given package') - ('messages that...' filterToMessagesThat 'let me type in a block taking a class and a selector, which will specify yea or nay concerning which elements should remain in the list')). builder runModal: (builder open: menuSpec).! Item was added: + ----- Method: MessageSet>>filterToNotPackage (in category 'filtering') ----- + filterToNotPackage + self requestPackageSelection ifNotNil: + [ : selectedPackage | self filterFrom: + [ : aClass : aSelector | (selectedPackage + includesMethod: aSelector + ofClass: aClass) not ] ]! Item was changed: ----- Method: MessageSet>>filterToPackage (in category 'filtering') ----- filterToPackage + self requestPackageSelection ifNotNil: + [ : selectedPackage | self filterFrom: + [ : aClass : aSelector | selectedPackage + includesMethod: aSelector + ofClass: aClass ] ]! - - | packages selectedIndex selectedPackage | - - packages := (PackageOrganizer default packages sort: [ :a :b | - a packageName <= b packageName ]). - - selectedIndex := UIManager default chooseFrom: (packages collect:[:each | each packageName]) lines: #() title: 'Select a package...'. - selectedIndex isZero ifTrue:[^ self]. - - selectedPackage := packages at: selectedIndex. - self filterFrom: [:aClass :aSelector | selectedPackage includesMethod: aSelector ofClass: aClass ] - ! Item was added: + ----- Method: MessageSet>>requestPackageSelection (in category 'private') ----- + requestPackageSelection + | packages selectedIndex | + packages := PackageOrganizer default packages sort: + [ : a : b | a packageName <= b packageName ]. + selectedIndex := UIManager default + chooseFrom: (packages collect: [ : each | each packageName ]) + lines: Array empty + title: 'Select a package...'. + ^ packages at: selectedIndex ifAbsent: [ nil ]!

2 1

The Trunk: Tools-cmm.848.mcz
by commits＠source.squeak.org 26 May '19

26 May '19

Chris Muller uploaded a new version of Tools to project The Trunk: http://source.squeak.org/trunk/Tools-cmm.848.mcz ==================== Summary ==================== Name: Tools-cmm.848 Author: cmm Time: 25 May 2019, 5:42:37.546478 pm UUID: dd37c4dd-789f-47d8-a059-2595ee4eb451 Ancestors: Tools-nice.847 - 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). =============== Diff against Tools-nice.847 =============== Item was changed: ----- Method: ChangeSorter>>setContents (in category 'code pane') ----- setContents "return the source code that shows in the bottom pane" | sel class strm changeType | self clearUserEditFlag. + myChangeSet ifNil: [^ contents := String empty]. "should not happen but can" currentClassName ifNil: [^ contents := myChangeSet preambleString ifNil: ['']]. class := self selectedClassOrMetaClass. (sel := self selectedMessageName) == nil ifFalse: [changeType := (myChangeSet atSelector: (sel := sel asSymbol) class: class). changeType == #remove ifTrue: [^ contents := 'Method has been removed (see versions)']. changeType == #addedThenRemoved ifTrue: [^ contents := 'Added then removed (see versions)']. class ifNil: [^ contents := 'Method was added, but cannot be found!!']. (class includesSelector: sel) ifFalse: [^ contents := 'Method was added, but cannot be found!!']. contents := class sourceCodeAt: sel. (#(prettyPrint prettyDiffs) includes: contentsSymbol) ifTrue: [contents := class prettyPrinterClass format: contents in: class notifying: nil]. self showingAnyKindOfDiffs ifTrue: [contents := self diffFromPriorSourceFor: contents]. ^ contents := contents asText makeSelectorBoldIn: class] ifTrue: [strm := WriteStream on: (String new: 100). (myChangeSet classChangeAt: (self withoutItemAnnotation: currentClassName)) do: [:each | each = #remove ifTrue: [strm nextPutAll: 'Entire class was removed.'; cr]. each = #addedThenRemoved ifTrue: [strm nextPutAll: 'Class was added then removed.']. each = #rename ifTrue: [strm nextPutAll: 'Class name was changed.'; cr]. each = #add ifTrue: [strm nextPutAll: 'Class definition was added.'; cr]. each = #change ifTrue: [strm nextPutAll: 'Class definition was changed.'; cr]. each = #reorganize ifTrue: [strm nextPutAll: 'Class organization was changed.'; cr]. each = #comment ifTrue: [strm nextPutAll: 'New class comment.'; cr. ]]. ^ contents := strm contents].! Item was changed: ----- Method: MessageSet>>filterMessageList (in category 'filtering') ----- filterMessageList "Allow the user to refine the list of messages." | builder menuSpec | builder := ToolBuilder default. menuSpec := builder pluggableMenuSpec new model: self; yourself. menuSpec addList: #( ('unsent messages' filterToUnsentMessages 'filter to show only messages that have no senders') - ('messages that send...' filterToSendersOf 'filter to show only messages that send a selector I specify') ('messages that do not send...' filterToNotSendersOf 'filter to show only messages that do not send a selector I specify') - ('messages whose selector is...' filterToImplementorsOf 'filter to show only messages with a given selector I specify') ('messages whose selector is NOT...' filterToNotImplementorsOf 'filter to show only messages whose selector is NOT a seletor I specify') - ('messages in current change set' filterToCurrentChangeSet 'filter to show only messages that are in the current change set') ('messages not in current change set' filterToNotCurrentChangeSet 'filter to show only messages that are not in the current change set') - ('messages in any change set' filterToAnyChangeSet 'filter to show only messages that occur in at least one change set') ('messages not in any change set' filterToNotAnyChangeSet 'filter to show only messages that do not occur in any change set in the system') - ('messages authored by me' filterToCurrentAuthor 'filter to show only messages whose authoring stamp has my initials') ('messages not authored by me' filterToNotCurrentAuthor 'filter to show only messages whose authoring stamp does not have my initials') - ('messages logged in .changes file' filterToMessagesInChangesFile 'filter to show only messages whose latest source code is logged in the .changes file') ('messages only in .sources file' filterToMessagesInSourcesFile 'filter to show only messages whose latest source code is logged in the .sources file') - ('messages with prior versions' filterToMessagesWithPriorVersions 'filter to show only messages that have at least one prior version') ('messages without prior versions' filterToMessagesWithoutPriorVersions 'filter to show only messages that have no prior versions') - ('uncommented messages' filterToUncommentedMethods 'filter to show only messages that do not have comments at the beginning') ('commented messages' filterToCommentedMethods 'filter to show only messages that have comments at the beginning') - ('messages in hardened classes' filterToMessagesWithHardenedClasses 'filter to show only messages of established classes (as opposed to Uniclasses such as Player23)') - ('methods in classes with matching names' filterToMatchingClassesNames 'filter to show only methods of classes with names that match the given criteria (wildcards are allowed)') ('methods in package...' filterToPackage 'filter to show only methods of a given package') + ('methods not in package...' filterToNotPackage 'filter to show only methods of a given package') - ('messages that...' filterToMessagesThat 'let me type in a block taking a class and a selector, which will specify yea or nay concerning which elements should remain in the list')). builder runModal: (builder open: menuSpec).! Item was added: + ----- Method: MessageSet>>filterToNotPackage (in category 'filtering') ----- + filterToNotPackage + self requestPackageSelection ifNotNil: + [ : selectedPackage | self filterFrom: + [ : aClass : aSelector | (selectedPackage + includesMethod: aSelector + ofClass: aClass) not ] ]! Item was changed: ----- Method: MessageSet>>filterToPackage (in category 'filtering') ----- filterToPackage + self requestPackageSelection ifNotNil: + [ : selectedPackage | self filterFrom: + [ : aClass : aSelector | selectedPackage + includesMethod: aSelector + ofClass: aClass ] ]! - - | packages selectedIndex selectedPackage | - - packages := (PackageOrganizer default packages sort: [ :a :b | - a packageName <= b packageName ]). - - selectedIndex := UIManager default chooseFrom: (packages collect:[:each | each packageName]) lines: #() title: 'Select a package...'. - selectedIndex isZero ifTrue:[^ self]. - - selectedPackage := packages at: selectedIndex. - self filterFrom: [:aClass :aSelector | selectedPackage includesMethod: aSelector ofClass: aClass ] - ! Item was added: + ----- Method: MessageSet>>requestPackageSelection (in category 'private') ----- + requestPackageSelection + | packages selectedIndex | + packages := PackageOrganizer default packages sort: + [ : a : b | a packageName <= b packageName ]. + selectedIndex := UIManager default + chooseFrom: (packages collect: [ : each | each packageName ]) + lines: Array empty + title: 'Select a package...'. + ^ packages at: selectedIndex ifAbsent: [ nil ]!

2 2

The Trunk: Collections-cmm.835.mcz
by commits＠source.squeak.org 26 May '19

26 May '19

Chris Muller uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-cmm.835.mcz ==================== Summary ==================== Name: Collections-cmm.835 Author: cmm Time: 25 May 2019, 5:37:43.260101 pm UUID: 691806ad-7981-4e23-aad9-864eaf710a5a Ancestors: Collections-mt.834 - Moved three methods belonging to Chronology to that package. =============== Diff against Collections-mt.834 =============== Item was removed: - ----- Method: String>>asDate (in category 'converting') ----- - asDate - "Many allowed forms, see Date>>#readFrom:" - - ^ Date fromString: self! Item was removed: - ----- Method: String>>asDateAndTime (in category 'converting') ----- - asDateAndTime - - "Convert from UTC format" ^ DateAndTime fromString: self! Item was removed: - ----- Method: String>>asDuration (in category 'converting') ----- - asDuration - "convert from [nnnd]hh:mm:ss[.nanos] format. [] implies optional elements" - - ^ Duration fromString: self - !

1 0

The Trunk: Kernel-cmm.1238.mcz
by commits＠source.squeak.org 26 May '19

26 May '19

Chris Muller uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-cmm.1238.mcz ==================== Summary ==================== Name: Kernel-cmm.1238 Author: cmm Time: 25 May 2019, 5:30:44.220675 pm UUID: e3efa7f8-adc8-434c-a1d2-7efeda6d0fca Ancestors: Kernel-nice.1237 - Moved several methods belonging to Chronology to that package. =============== Diff against Kernel-nice.1237 =============== Item was removed: - ----- Method: BlockClosure>>bench (in category 'evaluating') ----- - bench - "See how many times I can value in 5 seconds. I'll answer a meaningful description." - - ^self benchFor: 5 seconds! Item was removed: - ----- Method: BlockClosure>>benchFor: (in category 'evaluating') ----- - benchFor: aDuration - "See how many times I can value within the given duration. I'll answer a meaningful description." - - | startTime shouldRun count elapsedTime roundTo3Digits delay | - roundTo3Digits := [:num | - | rounded lowDigit | - rounded := (num * 1000) rounded. "round to 1/1000" - lowDigit := (rounded numberOfDigitsInBase: 10) - 3. "keep only first 3 digits" - rounded := rounded roundTo:(10 raisedTo: lowDigit). - (lowDigit >= 3 or: [rounded \\ 1000 = 0]) "display fractional part only when needed" - ifTrue: [(rounded // 1000) asStringWithCommas] - ifFalse: [(rounded / 1000.0) printString]]. - delay := aDuration asDelay. - count := 0. - shouldRun := true. - [ delay wait. shouldRun := false ] forkAt: Processor timingPriority - 1. - startTime := Time millisecondClockValue. - [ shouldRun ] whileTrue: [ - self value. - count := count + 1 ]. - elapsedTime := Time millisecondsSince: startTime. - ^(roundTo3Digits value: count * 1000 / elapsedTime) , ' per second.', (( - #( - (1e-3 'seconds') - (1 'milliseconds') - (1e3 'microseconds') - (1e6 'nanoseconds') - ) - detect: [ :pair | elapsedTime * pair first >= count ] - ifNone: [ #(1e9 'picoseconds') ]) - in: [ :pair | - ' {1} {2} per run.' format: { - (roundTo3Digits value: elapsedTime * pair first / count). - pair second } ])! Item was removed: - ----- Method: BlockClosure>>durationToRun (in category 'evaluating') ----- - durationToRun - "Answer the duration taken before this block returns." - - ^ Time durationToRun: self - ! Item was removed: - ----- Method: BlockClosure>>timeToRun (in category 'evaluating') ----- - timeToRun - "Answer the number of milliseconds taken to execute this block." - - ^ Time millisecondsToRun: self - ! Item was removed: - ----- Method: BlockClosure>>timeToRunWithoutGC (in category 'evaluating') ----- - timeToRunWithoutGC - "Answer the number of milliseconds taken to execute this block without GC time." - - ^(Smalltalk vmParameterAt: 8) + - (Smalltalk vmParameterAt: 10) + - self timeToRun - - (Smalltalk vmParameterAt: 8) - - (Smalltalk vmParameterAt: 10) - ! Item was removed: - ----- Method: BlockClosure>>valueWithin:onTimeout: (in category 'evaluating') ----- - valueWithin: aDuration onTimeout: timeoutBlock - "Evaluate the receiver. - If the evaluation does not complete in less than aDuration evaluate the timeoutBlock instead" - - | theProcess delay watchdog tag | - - aDuration <= Duration zero ifTrue: [^ timeoutBlock value ]. - - "the block will be executed in the current process" - theProcess := Processor activeProcess. - delay := aDuration asDelay. - tag := self. - - "make a watchdog process" - watchdog := [ - delay wait. "wait for timeout or completion" - theProcess ifNotNil:[ theProcess signalException: (TimedOut new tag: tag)] - ] newProcess. - - "Watchdog needs to run at high priority to do its job (but not at timing priority)" - watchdog priority: Processor timingPriority-1. - - "catch the timeout signal" - ^ [ watchdog resume. "start up the watchdog" - self ensure:[ "evaluate the receiver" - theProcess := nil. "it has completed, so ..." - delay delaySemaphore signal. "arrange for the watchdog to exit" - ]] on: TimedOut do: [ :e | - e tag == tag - ifTrue:[ timeoutBlock value ] - ifFalse:[ e pass]].! Item was removed: - ----- Method: Integer>>asYear (in category 'converting') ----- - asYear - - ^ Year year: self - ! Item was removed: - ----- Method: Number>>asDuration (in category 'converting') ----- - asDuration - - ^ Duration nanoSeconds: self asInteger - ! Item was removed: - ----- Method: Number>>day (in category 'converting') ----- - day - - ^ self sign days! Item was removed: - ----- Method: Number>>days (in category 'converting') ----- - days - - ^ Duration days: self! Item was removed: - ----- Method: Number>>hour (in category 'converting') ----- - hour - - ^ self sign hours - ! Item was removed: - ----- Method: Number>>hours (in category 'converting') ----- - hours - - ^ Duration hours: self! Item was removed: - ----- Method: Number>>milliSecond (in category 'converting') ----- - milliSecond - - ^ self sign milliSeconds - ! Item was removed: - ----- Method: Number>>milliSeconds (in category 'converting') ----- - milliSeconds - - ^ Duration milliSeconds: self - ! Item was removed: - ----- Method: Number>>minute (in category 'converting') ----- - minute - - ^ self sign minutes - ! Item was removed: - ----- Method: Number>>minutes (in category 'converting') ----- - minutes - - ^ Duration minutes: self! Item was removed: - ----- Method: Number>>nanoSecond (in category 'converting') ----- - nanoSecond - - ^ self sign nanoSeconds - ! Item was removed: - ----- Method: Number>>nanoSeconds (in category 'converting') ----- - nanoSeconds - - ^ Duration nanoSeconds: self.! Item was removed: - ----- Method: Number>>second (in category 'converting') ----- - second - - ^ self sign seconds - ! Item was removed: - ----- Method: Number>>seconds (in category 'converting') ----- - seconds - - ^ Duration seconds: self! Item was removed: - ----- Method: Number>>week (in category 'converting') ----- - week - - ^ self sign weeks - ! Item was removed: - ----- Method: Number>>weeks (in category 'converting') ----- - weeks - - ^ Duration weeks: self!

1 0

The Trunk: Chronology-Tests-cmm.22.mcz
by commits＠source.squeak.org 25 May '19

25 May '19

Chris Muller uploaded a new version of Chronology-Tests to project The Trunk: http://source.squeak.org/trunk/Chronology-Tests-cmm.22.mcz ==================== Summary ==================== Name: Chronology-Tests-cmm.22 Author: cmm Time: 19 May 2019, 11:18:06.171935 pm UUID: 83ea6690-05f6-4d88-8451-16d775de3e02 Ancestors: Chronology-Tests-cbc.21 Test for asMicroSeconds. =============== Diff against Chronology-Tests-cbc.21 =============== Item was added: + ----- Method: DurationTest>>testAsMicroSeconds (in category 'tests') ----- + testAsMicroSeconds + self assert: (Duration nanoSeconds: 1000) asMicroSeconds = 1. + self assert: (Duration seconds: 1) asMicroSeconds = 1e6. + self assert: aDuration asMicroSeconds = 93784000000. + self assert: (Duration microSeconds: 3775000) asSeconds = 3. + self assert: (Duration microSeconds: 3775000) nanoSeconds = 775000000!

1 0

The Trunk: Chronology-Core-cmm.47.mcz
by commits＠source.squeak.org 25 May '19

25 May '19

Chris Muller uploaded a new version of Chronology-Core to project The Trunk: http://source.squeak.org/trunk/Chronology-Core-cmm.47.mcz ==================== Summary ==================== Name: Chronology-Core-cmm.47 Author: cmm Time: 19 May 2019, 11:17:45.809897 pm UUID: 916637af-e396-4b0b-ae64-86c5b5ef2dd9 Ancestors: Chronology-Core-nice.44 - 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. =============== Diff against Chronology-Core-nice.44 =============== Item was added: + ----- Method: BlockClosure>>bench (in category '*chronology-core') ----- + bench + "See how many times I can value in 5 seconds. I'll answer a meaningful description." + + ^self benchFor: 5 seconds! Item was added: + ----- Method: BlockClosure>>benchFor: (in category '*chronology-core') ----- + benchFor: aDuration + "See how many times I can value within the given duration. I'll answer a meaningful description." + + | startTime shouldRun count elapsedTime roundTo3Digits delay | + roundTo3Digits := [:num | + | rounded lowDigit | + rounded := (num * 1000) rounded. "round to 1/1000" + lowDigit := (rounded numberOfDigitsInBase: 10) - 3. "keep only first 3 digits" + rounded := rounded roundTo:(10 raisedTo: lowDigit). + (lowDigit >= 3 or: [rounded \\ 1000 = 0]) "display fractional part only when needed" + ifTrue: [(rounded // 1000) asStringWithCommas] + ifFalse: [(rounded / 1000.0) printString]]. + delay := aDuration asDelay. + count := 0. + shouldRun := true. + [ delay wait. shouldRun := false ] forkAt: Processor timingPriority - 1. + startTime := Time millisecondClockValue. + [ shouldRun ] whileTrue: [ + self value. + count := count + 1 ]. + elapsedTime := Time millisecondsSince: startTime. + ^(roundTo3Digits value: count * 1000 / elapsedTime) , ' per second.', (( + #( + (1e-3 'seconds') + (1 'milliseconds') + (1e3 'microseconds') + (1e6 'nanoseconds') + ) + detect: [ :pair | elapsedTime * pair first >= count ] + ifNone: [ #(1e9 'picoseconds') ]) + in: [ :pair | + ' {1} {2} per run.' format: { + (roundTo3Digits value: elapsedTime * pair first / count). + pair second } ])! Item was added: + ----- Method: BlockClosure>>durationToRun (in category '*chronology-core') ----- + durationToRun + "Answer the duration taken before this block returns." + + ^ Time durationToRun: self + ! Item was added: + ----- Method: BlockClosure>>timeToRun (in category '*chronology-core') ----- + timeToRun + "Answer the number of milliseconds taken to execute this block." + + ^ Time millisecondsToRun: self + ! Item was added: + ----- Method: BlockClosure>>timeToRunWithoutGC (in category '*chronology-core') ----- + timeToRunWithoutGC + "Answer the number of milliseconds taken to execute this block without GC time." + + ^(Smalltalk vmParameterAt: 8) + + (Smalltalk vmParameterAt: 10) + + self timeToRun - + (Smalltalk vmParameterAt: 8) - + (Smalltalk vmParameterAt: 10) + ! Item was added: + ----- Method: BlockClosure>>valueWithin:onTimeout: (in category '*chronology-core') ----- + valueWithin: aDuration onTimeout: timeoutBlock + "Evaluate the receiver. + If the evaluation does not complete in less than aDuration evaluate the timeoutBlock instead" + + | theProcess delay watchdog tag | + + aDuration <= Duration zero ifTrue: [^ timeoutBlock value ]. + + "the block will be executed in the current process" + theProcess := Processor activeProcess. + delay := aDuration asDelay. + tag := self. + + "make a watchdog process" + watchdog := [ + delay wait. "wait for timeout or completion" + theProcess ifNotNil:[ theProcess signalException: (TimedOut new tag: tag)] + ] newProcess. + + "Watchdog needs to run at high priority to do its job (but not at timing priority)" + watchdog priority: Processor timingPriority-1. + + "catch the timeout signal" + ^ [ watchdog resume. "start up the watchdog" + self ensure:[ "evaluate the receiver" + theProcess := nil. "it has completed, so ..." + delay delaySemaphore signal. "arrange for the watchdog to exit" + ]] on: TimedOut do: [ :e | + e tag == tag + ifTrue:[ timeoutBlock value ] + ifFalse:[ e pass]].! Item was changed: ----- Method: DateAndTime>>utcOffset: (in category 'squeak protocol') ----- + utcOffset: anOffset + "Answer a DateAndTime equivalent to the receiver but offset from UTC by anOffset" + ^ self class + utcMicroseconds: utcMicroseconds + offset: anOffset asDuration asSeconds! - utcOffset: anOffset - - "Answer a <DateAndTime> equivalent to the receiver but offset from UTC by anOffset" - - self flag: #FIXME. "check the definition of this and of #offset:" - ^self utcMicroseconds: utcMicroseconds offset: anOffset asDuration asSeconds - ! Item was added: + ----- Method: Duration class>>microSeconds: (in category 'squeak protocol') ----- + microSeconds: anInteger + ^ self + seconds: (anInteger quo: 1e6) + nanoSeconds: (anInteger rem: 1e6) * 1000! Item was added: + ----- Method: Duration>>asMicroSeconds (in category 'squeak protocol') ----- + asMicroSeconds + nanos = 0 ifTrue: [ ^ seconds * 1e6 ]. + ^ (seconds * 1e6) + (nanos // 1000)! Item was added: + ----- Method: Integer>>asYear (in category '*chronology-core') ----- + asYear + + ^ Year year: self + ! Item was added: + ----- Method: Number>>asDuration (in category '*chronology-core') ----- + asDuration + + ^ Duration nanoSeconds: self asInteger + ! Item was added: + ----- Method: Number>>day (in category '*chronology-core') ----- + day + + ^ self sign days! Item was added: + ----- Method: Number>>days (in category '*chronology-core') ----- + days + + ^ Duration days: self! Item was added: + ----- Method: Number>>hour (in category '*chronology-core') ----- + hour + + ^ self sign hours + ! Item was added: + ----- Method: Number>>hours (in category '*chronology-core') ----- + hours + + ^ Duration hours: self! Item was added: + ----- Method: Number>>microSecond (in category '*chronology-core') ----- + microSecond + ^ self sign microSeconds! Item was added: + ----- Method: Number>>microSeconds (in category '*chronology-core') ----- + microSeconds + ^ Duration microSeconds: self! Item was added: + ----- Method: Number>>milliSecond (in category '*chronology-core') ----- + milliSecond + + ^ self sign milliSeconds + ! Item was added: + ----- Method: Number>>milliSeconds (in category '*chronology-core') ----- + milliSeconds + + ^ Duration milliSeconds: self + ! Item was added: + ----- Method: Number>>minute (in category '*chronology-core') ----- + minute + + ^ self sign minutes + ! Item was added: + ----- Method: Number>>minutes (in category '*chronology-core') ----- + minutes + + ^ Duration minutes: self! Item was added: + ----- Method: Number>>nanoSecond (in category '*chronology-core') ----- + nanoSecond + + ^ self sign nanoSeconds + ! Item was added: + ----- Method: Number>>nanoSeconds (in category '*chronology-core') ----- + nanoSeconds + + ^ Duration nanoSeconds: self.! Item was added: + ----- Method: Number>>second (in category '*chronology-core') ----- + second + + ^ self sign seconds + ! Item was added: + ----- Method: Number>>seconds (in category '*chronology-core') ----- + seconds + + ^ Duration seconds: self! Item was added: + ----- Method: Number>>week (in category '*chronology-core') ----- + week + + ^ self sign weeks + ! Item was added: + ----- Method: Number>>weeks (in category '*chronology-core') ----- + weeks + + ^ Duration weeks: self! Item was added: + ----- Method: String>>asDate (in category '*chronology-core') ----- + asDate + "Many allowed forms, see Date>>#readFrom:" + + ^ Date fromString: self! Item was added: + ----- Method: String>>asDateAndTime (in category '*chronology-core') ----- + asDateAndTime + + "Convert from UTC format" ^ DateAndTime fromString: self! Item was added: + ----- Method: String>>asDuration (in category '*chronology-core') ----- + asDuration + "convert from [nnnd]hh:mm:ss[.nanos] format. [] implies optional elements" + + ^ Duration fromString: self + !

1 0

IntegerTest>>#testExactSqrt broken on 32bit trunk
by Fabio Niephaus 23 May '19

23 May '19

Hi all, It looks like there's a large integer-related problem in 32bit trunk (see screenshot and [1]). I'm assuming this was introduced with the recent changes Nicolas incorporated. Maybe someone could have a look? For reproducing, download the last 32bit trunk image [2], update it, and run IntegerTest>>#testExactSqrt. Since 64bit works, we finally have a new 64bit trunk build (see [3]). Cheers, Fabio [1] https://travis-ci.org/squeak-smalltalk/squeak-app/jobs/536301595#L2512 [2] http://files.squeak.org/5.3alpha/Squeak5.3alpha-18498-32bit/ [3] http://files.squeak.org/5.3alpha/Squeak5.3alpha-18592-64bit/ [image: image.png]

2 4

The Trunk: Kernel-nice.1237.mcz
by commits＠source.squeak.org 23 May '19

23 May '19

Nicolas Cellier uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-nice.1237.mcz ==================== Summary ==================== Name: Kernel-nice.1237 Author: nice Time: 23 May 2019, 9:17:06.927326 pm UUID: 11d57971-88b6-4078-8ac6-91ba023d2ba6 Ancestors: Kernel-nice.1236 Fix sqrtRem in 32bits Squeak. Since SmallInteger maxVal + 1 has only 4 bytes, self highBit bitShift: -5 may equal 0: we split in a single whole part and engage into an infinite loop. =============== Diff against Kernel-nice.1236 =============== Item was changed: ----- Method: LargePositiveInteger>>sqrtRem (in category 'mathematical functions') ----- sqrtRem "See super. 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 q s r sr a3a2 a1 a0 | "Split self in 4 digits a3,a2,a1,a0 in base b, such that most significant digit a3 >= b/4 It is not a problem to have a3 >= b, so we can round b down to a whole number of bytes n" + n := (self highBit bitShift: -5) max: 1. "bitShift: -2 divide in 4 parts, bitShift: -3 round down in bytes" - n := self highBit bitShift: -5. "bitShift: -2 divide in 4 parts, bitShift: -3 round down in bytes" a3a2 := self butLowestNDigits: n * 2. a1 := self copyDigitsFrom: n + 1 to: n * 2. a0 := self lowestNDigits: n. sr := a3a2 sqrtRem. qr := (sr last bitShift: 8 * n) + a1 divideByInteger: (sr first bitShift: 1). q := qr first normalize. s := (sr first bitShift: 8 * n) + q. r := (qr last normalize bitShift: 8 * n) + a0 - q squared. r negative ifTrue: [r := (s bitShift: 1) + r - 1. s := s - 1]. sr at: 1 put: s; at: 2 put: r. ^sr !

1 0

The Trunk: Kernel-nice.1236.mcz
by commits＠source.squeak.org 23 May '19

23 May '19

Nicolas Cellier uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-nice.1236.mcz ==================== Summary ==================== Name: Kernel-nice.1236 Author: nice Time: 23 May 2019, 9:12:36.181413 pm UUID: 98f1507c-0679-40f5-ab22-0e31fcbd06bf Ancestors: Kernel-mt.1235, Kernel-nice.1235 Merge =============== Diff against Kernel-mt.1235 =============== Item was changed: ----- Method: LargePositiveInteger>>digitDiv21: (in category 'private') ----- digitDiv21: anInteger "This is part of the recursive division algorithm from Burnikel - Ziegler Divide a two limbs receiver by 1 limb dividend Each limb is decomposed in two halves of p bytes (8*p bits) so as to continue the recursion" | p qr1 qr2 | + "split in two parts, rounded to upper multiple of 4" + p := (anInteger digitLength + 7 bitShift: -3) bitShift: 2. - p := (anInteger digitLength + 1 bitShift: -1) bitClear: 2r11. p < self class thresholdForDiv21 ifTrue: [^(self digitDiv: anInteger neg: false) collect: #normalize]. qr1 := (self butLowestNDigits: p) digitDiv32: anInteger. qr2 := (self lowestNDigits: p) + (qr1 last bitShift: 8*p) digitDiv32: anInteger. qr2 at: 1 put: (qr2 at: 1) + ((qr1 at: 1) bitShift: 8*p). ^qr2! Item was changed: ----- Method: LargePositiveInteger>>digitDiv32: (in category 'private') ----- digitDiv32: anInteger "This is part of the recursive division algorithm from Burnikel - Ziegler Divide 3 limb (a2,a1,a0) by 2 limb (b1,b0). Each limb is made of p bytes (8*p bits). This step transforms the division problem into multiplication It must use a fast multiplyByInteger: to be worth the overhead costs." | a2 b1 d p q qr r | + "split in two parts, rounded to upper multiple of 4" + p :=(anInteger digitLength + 7 bitShift: -3) bitShift: 2. - p :=(anInteger digitLength + 1 bitShift: -1) bitClear: 2r11. (a2 := self butLowestNDigits: 2*p) < (b1 := anInteger butLowestNDigits: p) ifTrue: [qr := (self butLowestNDigits: p) digitDiv21: b1. q := qr first. r := qr last] ifFalse: [q := (1 bitShift: 8*p) - 1. r := (self butLowestNDigits: p) - (b1 bitShift: 8*p) + b1]. d := q * (anInteger lowestNDigits: p). r := (self lowestNDigits: p) + (r bitShift: 8*p) - d. [r < 0] whileTrue: [q := q - 1. r := r + anInteger]. ^Array with: q with: r ! Item was changed: ----- Method: LargePositiveInteger>>digitMul22: (in category 'private') ----- digitMul22: anInteger "Multiply after decomposing each operand in two parts, using Karatsuba algorithm. Karatsuba perform only 3 multiplications, leading to a cost O(n^3 log2) asymptotically better than super O(n^2) for large number of digits n. See https://en.wikipedia.org/wiki/Karatsuba_algorithm" | half xLow xHigh yLow yHigh low mid high | + "split each in two parts, rounded to upper multiple of 4" + half := (anInteger digitLength + 7 bitShift: -3) bitShift: 2. - "Divide each integer in two halves" - half := (anInteger digitLength + 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 multiplyByInteger: yLow. high := xHigh multiplyByInteger: yHigh. mid := high + low + (xHigh - xLow multiplyByInteger: yLow - yHigh). "Sum the parts of decomposition" ^(high isZero ifTrue: [low] ifFalse: [(high bitShift: 16*half) inplaceAddNonOverlapping: low digitShiftBy: 0]) + (mid bitShift: 8*half)! Item was changed: ----- Method: LargePositiveInteger>>digitMul23: (in category 'private') ----- digitMul23: anInteger "Multiply after decomposing the receiver in 2 parts, and multiplicand in 3 parts. Only invoke when anInteger digitLength between: 3/2 and 5/2 self digitLength. This is a variant of Toom-Cook algorithm (see digitMul33:)" | half x1 x0 y2 y1 y0 y20 z3 z2 z1 z0 | + "divide self in 2 and operand in 3 parts, rounded to upper multiple of 4" + half := ( self digitLength + 7 bitShift: -3) bitShift: 2. - "divide self in 2 and operand in 3 parts" - half := ( self digitLength + 1 bitShift: -1) bitClear: 2r11. x1 := self butLowestNDigits: half. x0 := self lowestNDigits: half. y2 := anInteger butLowestNDigits: half * 2. y1 := anInteger copyDigitsFrom: half + 1 to: half * 2. y0 := anInteger lowestNDigits: half. "Toom trick: 4 multiplications instead of 6" y20 := y2 + y0. z3 := x1 multiplyByInteger: y2. z2 := x0 - x1 multiplyByInteger: y20 - y1. z1 := x0 + x1 multiplyByInteger: y20 + y1. z0 := x0 multiplyByInteger: y0. "Sum the parts of decomposition" ^z0 + ((z1 - z2 bitShift: -1) - z3 bitShift: 8*half) + (((z1 + z2 bitShift: -1) - z0) + (z3 bitShift: 8*half) bitShift: 16 * half)! Item was changed: ----- Method: LargePositiveInteger>>digitMul33: (in category 'private') ----- digitMul33: anInteger "Multiply after decomposing each operand in 3 parts, using a Toom-Cooke algorithm. Toom-Cooke is a generalization of Karatsuba divide and conquer algorithm. See https://en.wikipedia.org/wiki/Toom%E2%80%93Cook_multiplication Use a Bodrato-Zanoni variant for the choice of interpolation points and matrix inversion See What about Toom-Cook matrices optimality? - Marco Bodrato, Alberto Zanoni - Oct. 2006 http://www.bodrato.it/papers/WhatAboutToomCookMatricesOptimality.pdf" | third x2 x1 x0 y2 y1 y0 y20 z4 z3 z2 z1 z0 x20 | + "divide both operands in 3 parts, rounded to upper multiple of 4" + third := anInteger digitLength + 11 // 12 bitShift: 2. - "divide both operands in 3 parts" - third := anInteger digitLength + 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 multiplyByInteger: y0. z4 := x2 multiplyByInteger: y2. x20 := x2 + x0. y20 := y2 + y0. z1 := x20 + x1 multiplyByInteger: y20 + y1. x20 := x20 - x1. y20 := y20 - y1. z2 := x20 multiplyByInteger: y20. z3 := (x20 + x2 bitShift: 1) - x0 multiplyByInteger: (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)! Item was changed: ----- Method: LargePositiveInteger>>digitMulSplit: (in category 'private') ----- digitMulSplit: anInteger "multiply digits when self and anInteger have not well balanced digitlength. in this case, it is better to split the largest (anInteger) in several parts and recompose" | xLen yLen split q r high mid low sizes | yLen := anInteger digitLength. xLen := self digitLength. + "divide in about 1.5 xLen, rounded to upper multiple of 4" + split := (xLen * 3 + 7 bitShift: -3) bitShift: 2. - split := (xLen * 3 + 2 bitShift: -1) bitClear: 2r11. "Arrange to sum non overlapping parts" q := yLen // split. q < 3 ifTrue: [^(0 to: yLen - 1 by: split) detectSum: [:yShift | (self multiplyByInteger: (anInteger copyDigitsFrom: yShift + 1 to: yShift + split)) bitShift: 8 * yShift]]. r := yLen \\ split. "allocate enough bytes, but not too much, in order to minimise normalize cost; we could allocate xLen + yLen for each one as well" sizes := {q-1*split. q*split. q*split+r}. low := Integer new: (sizes atWrap: 0 - (q\\3)) + xLen neg: self negative ~~ anInteger negative. mid := Integer new: (sizes atWrap: 1 - (q\\3)) + xLen neg: self negative ~~ anInteger negative. high := Integer new: (sizes atWrap: 2 - (q\\3)) + xLen neg: self negative ~~ anInteger negative. 0 to: yLen - 1 by: 3 * split do: [:yShift | low inplaceAddNonOverlapping: (self multiplyByInteger: (anInteger copyDigitsFrom: yShift + 1 to: yShift + split)) digitShiftBy: yShift]. split to: yLen - 1 by: 3 * split do: [:yShift | mid inplaceAddNonOverlapping: (self multiplyByInteger: (anInteger copyDigitsFrom: yShift + 1 to: yShift + split)) digitShiftBy: yShift]. split * 2 to: yLen - 1 by: 3 * split do: [:yShift | high inplaceAddNonOverlapping: (self multiplyByInteger: (anInteger copyDigitsFrom: yShift + 1 to: yShift + split)) digitShiftBy: yShift]. ^high normalize + mid normalize + low normalize! Item was changed: ----- Method: LargePositiveInteger>>squaredByFourth (in category 'private') ----- squaredByFourth "Use a 4-way Toom-Cook divide and conquer algorithm to perform the multiplication. See Asymmetric Squaring Formulae Jaewook Chung and M. Anwar Hasan https://www.lirmm.fr/arith18/papers/Chung-Squaring.pdf" | p a0 a1 a2 a3 a02 a13 s0 s1 s2 s3 s4 s5 s6 t2 t3 | + "divide in 4 parts, rounded to upper multiple of 4" + p := (self digitLength + 15 bitShift: -4) bitShift: 2. - "divide in 4 parts" - p := (self digitLength + 3 bitShift: -2) bitClear: 2r11. a3 := self butLowestNDigits: p * 3. a2 := self copyDigitsFrom: p * 2 + 1 to: p * 3. a1 := self copyDigitsFrom: p + 1 to: p * 2. a0 := self lowestNDigits: p. "Toom-4 trick: 7 multiplications instead of 16" a02 := a0 - a2. a13 := a1 - a3. s0 := a0 squared. s1 := (a0 * a1) bitShift: 1. s2 := (a02 + a13) * (a02 - a13). s3 := ((a0 + a1) + (a2 + a3)) squared. s4 := (a02 * a13) bitShift: 1. s5 := (a3 * a2) bitShift: 1. s6 := a3 squared. "Interpolation" t2 := s1 + s5. t3 := (s2 + s3 + s4 bitShift: -1) - t2. s3 := t2 - s4. s4 := t3 - s0. s2 := t3 - s2 - s6. "Sum the parts of decomposition" ^s0 + (s1 bitShift: 8*p) + (s2 + (s3 bitShift: 8*p) bitShift: 16*p) +(s4 + (s5 bitShift: 8*p) + (s6 bitShift: 16*p) bitShift: 32*p) " | a | a := 770 factorial-1. a digitLength. [a * a - a squaredToom4 = 0] assert. [Smalltalk garbageCollect. [1000 timesRepeat: [a squaredToom4]] timeToRun] value / [Smalltalk garbageCollect. [1000 timesRepeat: [a squaredKaratsuba]] timeToRun] value asFloat "! Item was changed: ----- Method: LargePositiveInteger>>squaredByHalf (in category 'private') ----- squaredByHalf "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 rounded tp upper multiple of 4" + half := (self digitLength + 1 bitShift: -3) bitShift: 2. - "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 multiplyByInteger: xHigh. "Sum the parts of decomposition" ^(high bitShift: 16*half) inplaceAddNonOverlapping: low digitShiftBy: 0; + (mid bitShift: 8*half+1) " | 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 changed: ----- Method: LargePositiveInteger>>squaredByThird (in category 'private') ----- squaredByThird "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, rounded to upper multiple of 4" + third := self digitLength + 11 // 3 bitShift: 2. - "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 "!

1 0

← Newer
1
2
3
4
5
6
7
8
...
16
Older →

Jump to page: