Packages October 2018

packages@lists.squeakfoundation.org

1 participants
53 discussions

The Trunk: System-eem.1045.mcz
by commits＠source.squeak.org 31 Oct '18

31 Oct '18

Eliot Miranda uploaded a new version of System to project The Trunk: http://source.squeak.org/trunk/System-eem.1045.mcz ==================== Summary ==================== Name: System-eem.1045 Author: eem Time: 31 October 2018, 3:38:52.935624 pm UUID: aece8105-e853-4c18-a38e-6872b4cd1440 Ancestors: System-fn.1044 Sort by name within bins when printing the results of a SpaceTally. =============== Diff against System-fn.1044 =============== Item was changed: ----- Method: SpaceTally>>printSpaceAnalysis:onStream: (in category 'fileOut') ----- printSpaceAnalysis: threshold onStream: stream "If threshold > 0, then only those classes with more than that number of instances will be shown, and they will be sorted by total instance space. If threshold = 0, then all classes will appear, sorted by name." | totalCodeSpace totalInstCount totalInstSpace totalPercent classNameLength printRow | self systemWideSpaceTally. totalCodeSpace := totalInstCount := totalInstSpace := 0. classNameLength := 1. results do: [ :each | classNameLength := classNameLength max: each analyzedClassName size. totalCodeSpace := totalCodeSpace + each codeSize. totalInstCount := totalInstCount + each instanceCount. totalInstSpace := totalInstSpace + each spaceForInstances ]. totalPercent := 0.0. printRow := [ :class :codeSpace :instanceCount :instanceSpace :percent | stream nextPutAll: (class padded: #right to: classNameLength + 1 with: $ ); nextPutAll: (codeSpace padded: #left to: 12 with: $ ); nextPutAll: (instanceCount padded: #left to: 12 with: $ ); nextPutAll: (instanceSpace padded: #left to: 14 with: $ ); nextPutAll: (percent padded: #left to: 8 with: $ ); cr ]. stream timeStamp. printRow valueWithArguments: { 'Class'. 'code space'. '# instances'. 'inst space'. 'percent' }. + threshold > 0 + ifTrue: "If inst count threshold > 0, then sort by space" + [results := results select: [ :s | + s instanceCount >= threshold + or: [s spaceForInstances > (totalInstSpace // 500) ] ]. + results sort: [ :s :s2 | + s spaceForInstances > s2 spaceForInstances + or: [s spaceForInstances = s2 spaceForInstances + and: [s analyzedClassName < s2 analyzedClassName] ] ] ] + ifFalse: "Otherwise sort by name" + [results sort: [ :s :s2 | s analyzedClassName < s2 analyzedClassName]]. - threshold > 0 ifTrue: [ - "If inst count threshold > 0, then sort by space" - results := results select: [ :s | - s instanceCount >= threshold or: [ - s spaceForInstances > (totalInstSpace // 500) ] ]. - results sort: [ :s :s2 | s spaceForInstances > s2 spaceForInstances ] ]. results do: [ :s | | percent | percent := s spaceForInstances * 100.0 / totalInstSpace. totalPercent := totalPercent + percent. printRow valueWithArguments: { s analyzedClassName. s codeSize printString. s instanceCount printString. s spaceForInstances asBytesDescription. percent printShowingDecimalPlaces: 1 } ]. stream cr. printRow valueWithArguments: { 'Total'. totalCodeSpace printString. totalInstCount printString. totalInstSpace printString. totalPercent printShowingDecimalPlaces: 1 }!

1 0

The Trunk: SystemReporter-eem.39.mcz
by commits＠source.squeak.org 31 Oct '18

31 Oct '18

Eliot Miranda uploaded a new version of SystemReporter to project The Trunk: http://source.squeak.org/trunk/SystemReporter-eem.39.mcz ==================== Summary ==================== Name: SystemReporter-eem.39 Author: eem Time: 31 October 2018, 2:42:33.87259 pm UUID: b7c74979-b810-4435-aa83-81b55ba493e1 Ancestors: SystemReporter-eem.38 Add (how) "To Build A Similar Virtual Machine" information to the VM General tab in the SystemReporter. =============== Diff against SystemReporter-eem.38 =============== Item was changed: ----- Method: SystemReporter>>reportVM: (in category 'reporting') ----- reportVM: aStream + | howToBuild | self header: 'Virtual Machine' on: aStream. aStream + nextPutAll: Smalltalk vm vmFileName; cr; + nextPutAll: Smalltalk vm vmVersion; cr. - nextPutAll: (Smalltalk vm vmFileName); cr; - nextPutAll: (Smalltalk vm vmVersion); cr. Smalltalk vm buildDate ifNotNil: [:string | aStream nextPutAll: string; cr]. [Smalltalk vm platformSourceVersion ifNotNil: [:v | aStream nextPutAll: 'platform sources revision ', v; cr]] on: Warning do: ["unsupported primitive"]. [Smalltalk vm interpreterSourceVersion ifNotNil: [:v | aStream nextPutAll: 'VMMaker versionString ', v; cr]] on: Warning do: ["unsupported primitive"]. [Smalltalk vm interpreterClass ifNotNil: [:string | aStream nextPutAll: string; cr]. Smalltalk vm cogitClass ifNotNil: [:string | aStream nextPutAll: string; cr] + ] on: Error do: ["unsupported primitives"]. + self vmIsOpenSmalltalkVM ifTrue: + [howToBuild := 'Visit https://github.com/OpenSmalltalk/opensmalltalk-vm; follow the\"Clone or download" instructions, then read the top-level README.md\and HowToBuild files in the top-level build directory for your\platform(s), build.macos64x64/HowToBuild, build.win32x86/HowToBuild, etc.' withCRs]. + howToBuild ifNil: [^self]. + aStream cr. + self header: 'To Build A Similar Virtual Machine' on: aStream. + aStream nextPutAll: howToBuild; cr! - ] on: Error do: ["unsupported primitives"] - ! Item was added: + ----- Method: SystemReporter>>vmIsOpenSmalltalkVM (in category 'private') ----- + vmIsOpenSmalltalkVM + ^[#('CoInterpreter' 'StackInterpreter') includes: (Smalltalk vm interpreterClass copyUpTo: Character space)] + on: Error "unsupported primitives" + do: [:ex| false]!

1 0

The Trunk: Collections-eem.811.mcz
by commits＠source.squeak.org 31 Oct '18

31 Oct '18

Eliot Miranda uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-eem.811.mcz ==================== Summary ==================== Name: Collections-eem.811 Author: eem Time: 31 October 2018, 10:44:24.941583 am UUID: a01f9f2a-1915-4520-8dbd-dfe7f43b1026 Ancestors: Collections-ul.810 Use the integerAt[Put] primitive to implement signedByteAt:[put:] =============== Diff against Collections-ul.810 =============== Item was changed: ----- Method: ByteArray>>signedByteAt: (in category 'platform independent access') ----- signedByteAt: index + "Answer an 8-bit signed integer quantity from the given byte index." + <primitive: 165> - "Return an 8-bit signed integer quantity from the given byte index." - | byte | (byte := self at: index) <= 16r7F ifTrue: [ ^byte ]. ^byte - 16r100! Item was changed: ----- Method: ByteArray>>signedByteAt:put: (in category 'platform independent access') ----- signedByteAt: index put: anInteger "Store an 8-bit signed integer quantity at the given byte index." + <primitive: 166> - anInteger >= 0 ifTrue: [ ^self at: index put: anInteger ]. self at: index put: anInteger + 16r100. ^anInteger!

1 0

The Trunk: Collections-ul.810.mcz
by commits＠source.squeak.org 29 Oct '18

29 Oct '18

Levente Uzonyi uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-ul.810.mcz ==================== Summary ==================== Name: Collections-ul.810 Author: ul Time: 30 October 2018, 1:26:22.149414 am UUID: 33532c8f-187e-4914-9573-9a6a5390a97c Ancestors: Collections-topa.809 - renamed the methods #stringHashWithInitialHash: and #bytesHashWithInitialHash: to #hashWithInitialHash: =============== Diff against Collections-topa.809 =============== Item was removed: - ----- Method: ByteArray>>bytesHashWithInitialHash: (in category 'private') ----- - bytesHashWithInitialHash: speciesHash - "Answer the hash of a byte-indexed array, using speciesHash as the initial value. - See SmallInteger>>hashMultiply." - <primitive: 'primitiveStringHash' module: 'MiscPrimitivePlugin'> - - ^String stringHash: self initialHash: speciesHash! Item was changed: ----- Method: ByteArray>>hash (in category 'comparing') ----- hash "#hash is implemented, because #= is implemented" + ^self hashWithInitialHash: self species hash! - ^self bytesHashWithInitialHash: self species hash! Item was added: + ----- Method: ByteArray>>hashWithInitialHash: (in category 'private') ----- + hashWithInitialHash: speciesHash + "Answer the hash of a byte-indexed array, using speciesHash as the initial value. + See SmallInteger>>hashMultiply." + <primitive: 'primitiveStringHash' module: 'MiscPrimitivePlugin'> + + ^String stringHash: self initialHash: speciesHash! Item was added: + ----- Method: ByteString>>hashWithInitialHash: (in category 'private') ----- + hashWithInitialHash: speciesHash + "Answer the hash of a byte-indexed string, using speciesHash as the initial value. + See SmallInteger>>hashMultiply." + <primitive: 'primitiveStringHash' module: 'MiscPrimitivePlugin'> + + ^super hashWithInitialHash: speciesHash! Item was removed: - ----- Method: ByteString>>stringHashWithInitialHash: (in category 'private') ----- - stringHashWithInitialHash: speciesHash - "Answer the hash of a byte-indexed string, using speciesHash as the initial value. - See SmallInteger>>hashMultiply." - <primitive: 'primitiveStringHash' module: 'MiscPrimitivePlugin'> - - ^super stringHashWithInitialHash: speciesHash! Item was added: + ----- Method: ByteSymbol>>hashWithInitialHash: (in category 'private') ----- + hashWithInitialHash: speciesHash + "Answer the hash of a byte-indexed string, using speciesHash as the initial value. + See SmallInteger>>hashMultiply." + <primitive: 'primitiveStringHash' module: 'MiscPrimitivePlugin'> + + ^super hashWithInitialHash: speciesHash! Item was removed: - ----- Method: ByteSymbol>>stringHashWithInitialHash: (in category 'private') ----- - stringHashWithInitialHash: speciesHash - "Answer the hash of a byte-indexed string, using speciesHash as the initial value. - See SmallInteger>>hashMultiply." - <primitive: 'primitiveStringHash' module: 'MiscPrimitivePlugin'> - - ^super stringHashWithInitialHash: speciesHash! Item was changed: ----- Method: String>>hash (in category 'comparing') ----- hash "#hash is implemented, because #= is implemented" "ar 4/10/2005: I had to change this to use ByteString hash as initial hash in order to avoid having to rehash everything and yet compute the same hash for ByteString and WideString. md 16/10/2006: use identityHash as initialHash, as behavior hash will use String hash (name) to have a better hash soon. eem 4/17/2017 it's not possible to use String hash (name) for the initial hash because that would be recursive." + ^self hashWithInitialHash: ByteString identityHash! - ^self stringHashWithInitialHash: ByteString identityHash! Item was changed: + ----- Method: String>>hashWithInitialHash: (in category 'private') ----- + hashWithInitialHash: speciesHash + "Answer the hash of a byte-indexed string, using speciesHash as the initial value. + See SmallInteger>>hashMultiply." + | hash | + hash := speciesHash bitAnd: 16r0FFFFFFF. + 1 to: self size do: + [:pos | + hash := (hash + (self basicAt: pos)) hashMultiply]. + ^hash! - ----- Method: String>>hashWithInitialHash: (in category 'comparing') ----- - hashWithInitialHash: initialHash - - ^ self class stringHash: self initialHash: initialHash! Item was removed: - ----- Method: String>>stringHashWithInitialHash: (in category 'private') ----- - stringHashWithInitialHash: speciesHash - "Answer the hash of a byte-indexed string, using speciesHash as the initial value. - See SmallInteger>>hashMultiply." - | hash | - hash := speciesHash bitAnd: 16r0FFFFFFF. - 1 to: self size do: - [:pos | - hash := (hash + (self basicAt: pos)) hashMultiply]. - ^hash!

1 0

The Trunk: Kernel-eem.1193.mcz
by commits＠source.squeak.org 29 Oct '18

29 Oct '18

Eliot Miranda uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-eem.1193.mcz ==================== Summary ==================== Name: Kernel-eem.1193 Author: eem Time: 29 October 2018, 4:05:45.263515 pm UUID: 003c6ae4-79d6-48f7-8f8a-9cc1a37690f8 Ancestors: Kernel-ul.1192 Provide changeClassTo: as a convenient way of accessing adoptInstance:, and a better replacement for the older primitiveChangeClassTo:. =============== Diff against Kernel-ul.1192 =============== Item was added: + ----- Method: Object>>changeClassTo: (in category 'converting') ----- + changeClassTo: aBehavior + "Change the class of the receiver to the argument, provided + that the format of the argument matches the format of the receiver's class." + aBehavior adoptInstance: self. + ^self!

1 0

The Trunk: Collections-topa.809.mcz
by commits＠source.squeak.org 28 Oct '18

28 Oct '18

Tobias Pape uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-topa.809.mcz ==================== Summary ==================== Name: Collections-topa.809 Author: topa Time: 28 October 2018, 8:16:44.149252 pm UUID: 65e8b64d-f325-47d8-8f83-ab4a9793ba9f Ancestors: Collections-eem.808 Add #histogramOf: convenience + test =============== Diff against Collections-eem.808 =============== Item was added: + ----- Method: Collection>>histogramOf: (in category 'converting') ----- + histogramOf: aBlock + + ^ self collect: aBlock as: Bag!

1 0

The Trunk: CollectionsTests-topa.295.mcz
by commits＠source.squeak.org 28 Oct '18

28 Oct '18

Tobias Pape uploaded a new version of CollectionsTests to project The Trunk: http://source.squeak.org/trunk/CollectionsTests-topa.295.mcz ==================== Summary ==================== Name: CollectionsTests-topa.295 Author: topa Time: 28 October 2018, 8:14:02.430507 pm UUID: dc71a7c1-c330-4af2-a4c9-78459f5193f3 Ancestors: CollectionsTests-ul.294 Add #histogramOf: convenience + test =============== Diff against CollectionsTests-ul.294 =============== Item was added: + ----- Method: CollectionTest>>testHistogramOf (in category 'testing') ----- + testHistogramOf + " could be collect:as: Bag, but histogram is what it's used for " + | baseCollection collection | + baseCollection := {#x -> 2 . #y -> 3 . #y -> 4. #z -> 2 }. + { Array . OrderedCollection . Set } do: + [:collectionClass | + collection := baseCollection as: collectionClass. + self + assert: collection asBag + equals: (collection histogramOf: [:ea | ea]) + description: 'For ', collectionClass, ', #asBag and identity-histograms should match'. + self + assert: (Bag withAll: #( x y y z)) + equals: (collection histogramOf: [:ea | ea key]) + description: 'For ', collectionClass, ', histogramming contents should work '. + self + assert: (Bag withAll: #( 2 3 4 2 )) + equals: (collection histogramOf: [:ea | ea value]) + description: 'For ', collectionClass, ', histogramming contents should work']. + + collection := baseCollection as: KeyedSet. + self + assert: collection asBag + equals: (collection histogramOf: [:ea | ea]) + description: 'For KeyedSet, #asBag and identity-histograms should match'. + self + assert: (Bag withAll: #( x y z)) + equals: (collection histogramOf: [:ea | ea key]) + description: 'For KeyedSet, histogramming contents should work '. + self + assert: (Bag withAll: #( 2 3 2 )) + equals: (collection histogramOf: [:ea | ea value]) + description: 'For KeyedSet, histogramming contents should work'. + + baseCollection := {#x -> 2 . "#y -> 3 ." #y -> 4. #z -> 2 }. "No duplicate keyes" + collection := baseCollection as: Dictionary. + self + assert: (Bag withAll: #( 2 2 4 )) + equals: (collection histogramOf: [:ea | ea]) + description: 'For Dictionary, histogramming should work on values.'. + self + assert: (collection values histogramOf: [:ea | ea]) + equals: (collection histogramOf: [:ea | ea]) + description: 'For Dictionary, histogramming should be the same as histogramming the values.'. + self + assert: collection asBag + equals: (collection histogramOf: [:ea | ea]) + description: 'For Dictionary, #asBag should match histogramming.'. + self + assert: (Bag withAll: #(x y z)) + equals: (collection keys histogramOf: [:ea |ea]) + description: 'For Dictionary, histogramming keys is ok to be less convenient.'. + !

1 0

The Trunk: Kernel-ul.1192.mcz
by commits＠source.squeak.org 24 Oct '18

24 Oct '18

Levente Uzonyi uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-ul.1192.mcz ==================== Summary ==================== Name: Kernel-ul.1192 Author: ul Time: 24 October 2018, 10:50:43.875546 pm UUID: 72dfb776-3d77-4b84-9d69-d000e9a67ae1 Ancestors: Kernel-eem.1191 - improved Integer >> #isPrime's performance - slightly faster Categorizer >> #numberOfCategoryOfElement: =============== Diff against Kernel-eem.1191 =============== Item was changed: ----- Method: Categorizer>>numberOfCategoryOfElement: (in category 'accessing') ----- numberOfCategoryOfElement: element "Answer the index of the category with which the argument, element, is associated." + | categoryIndex elementIndex elementArraySize | - | categoryIndex elementIndex | categoryIndex := 1. elementIndex := 0. + elementArraySize := elementArray size. + [(elementIndex := elementIndex + 1) <= elementArraySize] - [(elementIndex := elementIndex + 1) <= elementArray size] whileTrue: ["point to correct category" [elementIndex > (categoryStops at: categoryIndex)] whileTrue: [categoryIndex := categoryIndex + 1]. "see if this is element" element = (elementArray at: elementIndex) ifTrue: [^categoryIndex]]. ^0! Item was changed: ----- Method: Integer>>isPrime (in category 'testing') ----- isPrime "Answer true if the receiver is a prime number. See isProbablyPrime for a probabilistic implementation that is much faster for large integers, and that is correct to an extremely high statistical level of confidence (effectively deterministic)." + | probe step limit | + self <= 3 ifTrue: [ ^self >= 2 ]. + self \\ 2 = 0 ifTrue: [ ^false ]. + self \\ 3 = 0 ifTrue: [ ^false ]. + self <= 1073741823 ifFalse: [ "1 << 30 - 1. For numbers larger than this (on 64-bit platforms) #isProbablyPrime is usually quicker." - self <= 1 ifTrue: [ ^false ]. - self even ifTrue: [ ^self = 2]. - self <= 1073741823 ifFalse: [ "1 << 30 - 1. For numbers larger than this, the calculation takes longer than #isProbablyPrime when the receiver is a prime. The absolue turning point is about at 1 << 35 - 1." ^self isProbablyPrime ]. + probe := 5. + step := 2. "Step will oscillate between 2 and 4 because at this point self \\ 6 is either 1 or 5." + limit := self sqrtFloor. "On 64-bit platforms this could be written as self asFloat sqrt truncated (+ 1), which is faster because it creates no intermediate objects. Knowing that self has at most 30 bits because of the check above, this value will never be larger than 32767." + [ probe <= limit ] whileTrue: [ + self \\ probe = 0 ifTrue: [ ^false ]. + probe := probe + step. + step := 6 - step ]. - 3 to: self sqrtFloor by: 2 do: [ :each | - self \\ each = 0 ifTrue: [ ^false ] ]. ^true! Item was added: + ----- Method: LargeNegativeInteger>>isPrime (in category 'testing') ----- + isPrime + + ^false!

1 0

The Trunk: KernelTests-ul.351.mcz
by commits＠source.squeak.org 24 Oct '18

24 Oct '18

Levente Uzonyi uploaded a new version of KernelTests to project The Trunk: http://source.squeak.org/trunk/KernelTests-ul.351.mcz ==================== Summary ==================== Name: KernelTests-ul.351 Author: ul Time: 24 October 2018, 11:07:17.060553 pm UUID: a1fcd460-09b2-46a3-8ea4-4700121ead86 Ancestors: KernelTests-pre.350 - more thorough #testIsPrime =============== Diff against KernelTests-pre.350 =============== Item was changed: ----- Method: IntegerTest>>testIsPrime (in category 'tests - basic') ----- testIsPrime + | i | "Not primes:" + #(-1000000000000000 -100 -5 -3 -2 -1 0 1) do: [ :each | - #(-100 -5 -3 -2 -1 0 1) do: [ :each | self deny: each isPrime ]. + "Check all non-negative integers up to one million." + i := 0. + Integer primesUpTo: 1000000 do: [ :prime | + [ i < prime ] whileTrue: [ + self deny: i isPrime. + i := i + 1 ]. + self assert: i isPrime. + i := i + 1 ]. + [ i <= 1000000 ] whileTrue: [ + self deny: i isPrime. + i := i + 1 ]. + "The following tests should return 'true'" #(17 78901 104729 15485863 2038074743) do: [ :each | self assert: each isPrime ]. + "The following tests should return 'false' (first 5 are Carmichael numbers)" - "The following tests should return 'false' (first 5 are Carmichael integers)" #(561 2821 6601 10585 15841 256 29996224275831) do: [ :each | + self deny: each isPrime ]. + ! - self deny: each isPrime ].!

1 0

The Trunk: Chronology-Tests-dtl.10.mcz
by commits＠source.squeak.org 23 Oct '18

23 Oct '18

David T. Lewis uploaded a new version of Chronology-Tests to project The Trunk: http://source.squeak.org/trunk/Chronology-Tests-dtl.10.mcz ==================== Summary ==================== Name: Chronology-Tests-dtl.10 Author: dtl Time: 22 October 2018, 11:03:15.772641 pm UUID: a784eccd-7120-434e-9112-886b445aaffa Ancestors: Chronology-Tests-pre.9 Start time for a Date created from a DateAndTime should preserve local time offset. =============== Diff against Chronology-Tests-pre.9 =============== Item was added: + ----- Method: DateTest>>testFromDateAndTime (in category 'Tests') ----- + testFromDateAndTime + + | aDateAndTime | + aDateAndTime := '2018-10-22T22:51:38.322706-04:00' asDateAndTime. + aDate := aDateAndTime asDate. + self + assert: aDate start offset + equals: aDateAndTime offset + description: 'Start time for a Date created from a DateAndTime should preserve local time offset'!

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Packages October 2018