Packages November 2019

packages@lists.squeakfoundation.org

1 participants
135 discussions

The Trunk: CollectionsTests-ct.321.mcz
by commits＠source.squeak.org 18 Nov '19

18 Nov '19

Marcel Taeumel uploaded a new version of CollectionsTests to project The Trunk: http://source.squeak.org/trunk/CollectionsTests-ct.321.mcz ==================== Summary ==================== Name: CollectionsTests-ct.321 Author: ct Time: 27 September 2019, 4:15:21.022642 pm UUID: 6638fd69-d57a-7e43-a99c-2d99b52a0b36 Ancestors: CollectionsTests-jr.320 Extend OrderedDictionaryTest >> #testCopyFromTo to reveal a bug =============== Diff against CollectionsTests-jr.320 =============== Item was changed: ----- Method: OrderedDictionaryTest>>testCopyFromTo (in category 'tests - copying') ----- testCopyFromTo + | copy | 1 to: 10 do: [:index | sut at: index put: nil]. + copy := sut copyFrom: 3 to: 5. + self assert: (3 to: 5) asArray equals: copy keys. + copy at: 3 put: #foo. + self assert: (sut at: 3) isNil. + + copy at: 11 put: #ba. + self assert: #ba equals: (copy at: 11).! - (sut copyFrom: 3 to: 5) in: [:copy | - self assert: (3 to: 5) asArray equals: copy keys. - copy at: 3 put: #foo. - self assert: (sut at: 3) isNil.].!

1 0

The Trunk: Collections-mt.859.mcz
by commits＠source.squeak.org 18 Nov '19

18 Nov '19

Marcel Taeumel uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-mt.859.mcz ==================== Summary ==================== Name: Collections-mt.859 Author: mt Time: 18 November 2019, 10:35:50.278051 am UUID: e09e1b73-88f1-8c48-a741-ed021620da1e Ancestors: Collections-ct.857, Collections-nice.858 Merge to complement CollectionsTests-mt.324. =============== Diff against Collections-nice.858 =============== Item was changed: ----- Method: OrderedDictionary>>postCopyFrom:to: (in category 'copying') ----- postCopyFrom: startIndex to: endIndex "Adapted from SequenceableCollection and OrderedCollection." | oldOrder | oldOrder := order. array := self class arrayType new: (self class goodPrimeAtLeast: endIndex - startIndex + 1 * 4 // 3). "fill 75% to 100%" order := self class arrayType + new: array size + 1 * 3 // 4. "remove 25%" - new: array size * 3 // 4. "remove 25%" startIndex to: endIndex do: [:index | | element | element := (oldOrder at: index) copy. order at: index - startIndex + 1 put: element. array at: (self scanFor: element key) put: element]. tally := endIndex - startIndex + 1.!

1 0

The Trunk: CollectionsTests-mt.324.mcz
by commits＠source.squeak.org 18 Nov '19

18 Nov '19

Marcel Taeumel uploaded a new version of CollectionsTests to project The Trunk: http://source.squeak.org/trunk/CollectionsTests-mt.324.mcz ==================== Summary ==================== Name: CollectionsTests-mt.324 Author: mt Time: 18 November 2019, 10:35:05.795051 am UUID: 320887ba-7b83-8240-872c-38dbc31f2e78 Ancestors: CollectionsTests-ct.321, CollectionsTests-nice.323 Merges new test that reveals a bug in OrderedDictionary. =============== Diff against CollectionsTests-nice.323 =============== Item was changed: ----- Method: OrderedDictionaryTest>>testCopyFromTo (in category 'tests - copying') ----- testCopyFromTo + | copy | 1 to: 10 do: [:index | sut at: index put: nil]. + copy := sut copyFrom: 3 to: 5. + self assert: (3 to: 5) asArray equals: copy keys. + copy at: 3 put: #foo. + self assert: (sut at: 3) isNil. + + copy at: 11 put: #ba. + self assert: #ba equals: (copy at: 11).! - (sut copyFrom: 3 to: 5) in: [:copy | - self assert: (3 to: 5) asArray equals: copy keys. - copy at: 3 put: #foo. - self assert: (sut at: 3) isNil.].!

1 0

The Trunk: Network-nice.237.mcz
by commits＠source.squeak.org 17 Nov '19

17 Nov '19

Nicolas Cellier uploaded a new version of Network to project The Trunk: http://source.squeak.org/trunk/Network-nice.237.mcz ==================== Summary ==================== Name: Network-nice.237 Author: nice Time: 17 November 2019, 4:42:30.116383 pm UUID: 5ea94de6-4e06-4dd0-b3af-d52548545d65 Ancestors: Network-mt.236 Use substrings and lines idiom instead of findTokens: Note: findTokens: feeded with a CharacterSet (CharacterSet separators or CharacterSet crlf) would be equally efficient as above specialized selectors, just a bit longer to write. =============== Diff against Network-mt.236 =============== Item was changed: ----- Method: HTTPServerDirectory>>entries (in category 'file directory') ----- entries | answer ftpEntries | answer := HTTPSocket httpGetDocument: self dirListUrl. answer isString ifTrue: [^self error: 'Listing failed: ' , answer] ifFalse: [answer := answer content]. + answer first = $< - answer first == $< ifTrue: [self error: 'Listing failed: ' , answer]. + ftpEntries := answer lines. - ftpEntries := answer findTokens: String crlf. ^ ftpEntries collect:[:ftpEntry | self class parseFTPEntry: ftpEntry] thenSelect: [:entry | entry notNil]! Item was changed: ----- Method: POP3Client>>messageCount (in category 'public protocol') ----- messageCount "Query the server and answer the number of messages that are in the user's mailbox." | numMessages | self ensureConnection. self sendCommand: 'STAT'. self checkResponse. self logProgress: self lastResponse. [ | answerString | + answerString := (self lastResponse substrings) second. - answerString := (self lastResponse findTokens: Character separators) second. numMessages := answerString asNumber asInteger] on: Error do: [:ex | (ProtocolClientError protocolInstance: self) signal: 'Invalid STAT response.']. ^numMessages! Item was changed: ----- Method: ServerDirectory>>entries (in category 'file directory') ----- entries "Return a collection of directory entries for the files and directories in this directory. Each entry is a five-element array: (<name> <creationTime> <modificationTime> <dirFlag> <fileSize>)." | dir ftpEntries | "We start with ftp directory entries of the form... d--------- 1 owner group 0 Apr 27 22:01 blasttest ---------- 1 owner group 93812 Jul 21 1997 COMMAND.COM 1 2 3 4 5 6 7 8 9 -- token index" self isTypeFile ifTrue: [ urlObject isAbsolute ifFalse: [urlObject default]. ^ (FileDirectory on: urlObject pathForDirectory) entries ]. dir := self getDirectory. (dir respondsTo: #contentsOfEntireFile) ifFalse: [^ #()]. + ftpEntries := dir contentsOfEntireFile lines. - ftpEntries := dir contentsOfEntireFile findTokens: String crlf. - "ftpEntries inspect." ^ ftpEntries collect:[:ftpEntry | self class parseFTPEntry: ftpEntry] thenSelect: [:entry | entry notNil]!

1 0

The Trunk: EToys-nice.369.mcz
by commits＠source.squeak.org 17 Nov '19

17 Nov '19

Nicolas Cellier uploaded a new version of EToys to project The Trunk: http://source.squeak.org/trunk/EToys-nice.369.mcz ==================== Summary ==================== Name: EToys-nice.369 Author: nice Time: 17 November 2019, 3:49:19.084237 pm UUID: 6bc2f1bf-b9c6-45e1-8780-e0a2d826b233 Ancestors: EToys-mt.368 Replace (findTokens: Character separators) with substrings which is both a shorter and faster idiom. | tmp | tmp := String allSubInstances. { [tmp do: [:e | e substrings]] bench. [tmp do: [:e | e findTokens: Character separators]] bench. [tmp do: [:e | e findTokens: CharacterSet separators]] bench. }. #( '1.17 per second. 852 milliseconds per run. 16.22996 % GC time.' '0.285 per second. 3.51 seconds per run. 5.30746 % GC time.' '1.18 per second. 849 milliseconds per run. 20.13357 % GC time.') =============== Diff against EToys-mt.368 =============== Item was changed: ----- Method: BookMorph>>textSearchAgain (in category '*Etoys-Squeakland-menu') ----- textSearchAgain "The classic find-again" | wanted wants list | list := self valueOfProperty: #searchKey ifAbsent: [#()]. wanted := String streamContents: [:strm | list do: [:each | strm nextPutAll: each; space]]. + wants := wanted substrings. - wants := wanted findTokens: Character separators. wants isEmpty ifTrue: [^ self]. self getAllText. "save in allText, allTextUrls" ^ self findText: wants "goes to the page and highlights the text"! Item was changed: ----- Method: CardPlayer>>asKeys (in category 'card data') ----- asKeys | keys kk vd gotData | "Take my fields, tokenize the text, and return as an array in the same order as variableDocks. Simple background fields on the top level. If no data, return nil." keys := self class variableDocks copy. gotData := false. 1 to: keys size do: [:ind | kk := nil. vd := self class variableDocks at: ind. vd type == #text ifTrue: [ kk := (self perform: vd playerGetSelector) string + substrings. - findTokens: Character separators. kk isEmpty ifTrue: [kk := nil] ifFalse: [gotData := true]]. keys at: ind put: kk]. ^ gotData ifTrue: [keys] ifFalse: [nil]!

1 0

The Trunk: CollectionsTests-nice.323.mcz
by commits＠source.squeak.org 17 Nov '19

17 Nov '19

Nicolas Cellier uploaded a new version of CollectionsTests to project The Trunk: http://source.squeak.org/trunk/CollectionsTests-nice.323.mcz ==================== Summary ==================== Name: CollectionsTests-nice.323 Author: nice Time: 17 November 2019, 12:46:56.171035 pm UUID: e817d369-4c05-4944-9033-86aabc522ac6 Ancestors: CollectionsTests-pre.322 Test a few CharacterSet union:/intersection: edge cases =============== Diff against CollectionsTests-pre.322 =============== Item was added: + ----- Method: CharacterSetTest>>testIntersectionOfComplement (in category 'tests') ----- + testIntersectionOfComplement + | intersection | + intersection := ('abcd' as: CharacterSet) complement intersection: ('cdef' as: CharacterSet) complement. + self assert: intersection = ('abcdef' as: CharacterSet) complement.! Item was added: + ----- Method: CharacterSetTest>>testIntersectionOfLazy (in category 'tests') ----- + testIntersectionOfLazy + | digits intersection1 intersection2 az lazyNonDigitNonSeparator lazyNotazNotUppercase | + digits := ($0 to: $9) as: CharacterSet. + az := ($a to: $z) as: CharacterSet. + lazyNonDigitNonSeparator := digits complement reject: #isSeparator. + lazyNotazNotUppercase := az complement reject: #isUppercase. + intersection1 := lazyNotazNotUppercase intersection: lazyNonDigitNonSeparator. + intersection2 := lazyNonDigitNonSeparator intersection: lazyNotazNotUppercase. + self assert: (digits noneSatisfy: [:d | intersection1 includes: d]). + self assert: (digits noneSatisfy: [:d | intersection2 includes: d]). + self assert: ('abc' noneSatisfy: [:d | intersection1 includes: d]). + self assert: ('abc' noneSatisfy: [:d | intersection2 includes: d]). + self assert: ('ABC' noneSatisfy: [:d | intersection1 includes: d]). + self assert: ('ABC' noneSatisfy: [:d | intersection2 includes: d]). + self assert: (Character separators noneSatisfy: [:d | intersection1 includes: d]). + self assert: (Character separators noneSatisfy: [:d | intersection2 includes: d]). + self assert: ('()[]{}' allSatisfy: [:d | intersection1 includes: d]). + self assert: ('()[]{}' allSatisfy: [:d | intersection2 includes: d]).! Item was added: + ----- Method: CharacterSetTest>>testIntersectionOfNonLazyWithLazyIsNotLazy (in category 'tests') ----- + testIntersectionOfNonLazyWithLazyIsNotLazy + | nonDigit az lazyLetters | + nonDigit := (($0 to: $9) as: CharacterSet) complement. + lazyLetters := nonDigit select: #isLetter. + az := ($a to: $z) asCharacterSet. + self assert: (az intersection: lazyLetters) equals: az. + self assert: (lazyLetters intersection: az) equals: az.! Item was added: + ----- Method: CharacterSetTest>>testUnionOfComplement (in category 'tests') ----- + testUnionOfComplement + | union | + union := ('abcd' as: CharacterSet) complement union: ('cdef' as: CharacterSet) complement. + self assert: union = ('cd' as: CharacterSet) complement.! Item was added: + ----- Method: CharacterSetTest>>testUnionOfLazy (in category 'tests') ----- + testUnionOfLazy + | digits nonDigit lazyLetters lazyNonLetters union1 union2 | + digits := ($0 to: $9) as: CharacterSet. + nonDigit := digits complement. + lazyLetters := nonDigit select: #isLetter. + lazyNonLetters := nonDigit reject: #isLetter. + union1 := lazyNonLetters union: lazyLetters. + union2 := lazyLetters union: lazyNonLetters. + self assert: (digits noneSatisfy: [:d | union1 includes: d]). + self assert: (digits noneSatisfy: [:d | union2 includes: d]). + self assert: ('abc' allSatisfy: [:d | union1 includes: d]). + self assert: ('abc' allSatisfy: [:d | union2 includes: d]). + self assert: ('()[]{}' allSatisfy: [:d | union1 includes: d]). + self assert: ('()[]{}' allSatisfy: [:d | union2 includes: d]).! Item was added: + ----- Method: CharacterSetTest>>testUnionWithLazy (in category 'tests') ----- + testUnionWithLazy + | digits nonDigit lazyLetters az union1 union2 | + digits := ($0 to: $9) as: CharacterSet. + nonDigit := digits complement. + lazyLetters := nonDigit select: #isLetter. + union1 := digits union: lazyLetters. + union2 := lazyLetters union: digits. + az := ($a to: $z) as: CharacterSet. + self assert: (digits allSatisfy: [:d | union1 includes: d]). + self assert: (digits allSatisfy: [:d | union2 includes: d]). + self assert: (az allSatisfy: [:d | union1 includes: d]). + self assert: (az allSatisfy: [:d | union2 includes: d]). + self assert: ('()[]{}' noneSatisfy: [:d | union1 includes: d]). + self assert: ('()[]{}' noneSatisfy: [:d | union2 includes: d]).!

1 0

The Trunk: Collections-nice.858.mcz
by commits＠source.squeak.org 17 Nov '19

17 Nov '19

Nicolas Cellier uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-nice.858.mcz ==================== Summary ==================== Name: Collections-nice.858 Author: nice Time: 17 November 2019, 12:46:04.058035 pm UUID: cd5d4533-11f2-2340-8957-a577330de15d Ancestors: Collections-pre.857 Fix union: and intersection: of CharacterSet We must avoid using naive loops for huge sets that canBeEnumerated not. An enumerationCost scale is introduced for that purpose. The idea is that intersection: must be performed by the cheapest set, while union: must be performed by the most expensive. The most expensive eventually knows how to handle loops lazily. =============== Diff against Collections-pre.857 =============== Item was added: + ----- Method: ByteCharacterSet>>enumerationCost (in category 'private') ----- + enumerationCost + "Low cost. I do not hold more than 256 characters." + + ^10! Item was removed: - ----- Method: ByteCharacterSet>>union: (in category 'enumerating') ----- - union: aCollection - (self isCharacters: aCollection) ifFalse: [^super union: aCollection]. - (self species = aCollection species and: [self class ~= aCollection class]) ifTrue: [^aCollection union: self]. - ^self copy addAll: aCollection; yourself! Item was changed: Collection subclass: #CharacterSet instanceVariableNames: 'byteArrayMap' classVariableNames: 'Ascii CrLf NonAscii NonSeparators Separators' poolDictionaries: '' category: 'Collections-Support'! + !CharacterSet commentStamp: 'nice 11/17/2019 12:26' prior: 0! + A set of characters. Lookups for inclusion are very fast. + CharacterSet is the abstract class that is visible to the outside world. + Subclasses should be considered as implementation details.! - !CharacterSet commentStamp: '<historical>' prior: 0! - A set of characters. Lookups for inclusion are very fast.! Item was added: + ----- Method: CharacterSet>>as: (in category 'converting') ----- + as: otherClass + otherClass = CharacterSet ifTrue: [^self]. + ^super as: otherClass! Item was added: + ----- Method: CharacterSet>>enumerationCost (in category 'private') ----- + enumerationCost + "Answer an integer giving a scale of cost, especially for do: loops." + + ^self subclassResponsibility! Item was added: + ----- Method: CharacterSet>>intersection: (in category 'enumerating') ----- + intersection: aCollection + (self species = aCollection species and: [aCollection enumerationCost < self enumerationCost]) ifTrue: [^aCollection intersection: self]. + ^ self select: [:each | aCollection includes: each]! Item was added: + ----- Method: CharacterSet>>union: (in category 'enumerating') ----- + union: aCollection + (self isCharacters: aCollection) ifFalse: [^super union: aCollection]. + (self species = aCollection species and: [aCollection enumerationCost > self enumerationCost]) ifTrue: [^aCollection union: self]. + ^self copy addAll: aCollection; yourself! Item was added: + ----- Method: CharacterSetComplement>>enumerationCost (in category 'private') ----- + enumerationCost + "The maximum cost. I can't even do: loops, it's too expensive." + + ^100! Item was removed: - ----- Method: LazyCharacterSet>>complement (in category 'converting') ----- - complement - ^self class including: [:char | (block value: char) not]! Item was added: + ----- Method: LazyCharacterSet>>enumerationCost (in category 'private') ----- + enumerationCost + "The maximum cost. I can't even do: loops, it's too expensive." + + ^100! Item was changed: ----- Method: LazyCharacterSet>>intersection: (in category 'enumerating') ----- intersection: aCollection + ^((self isCharacters: aCollection) + ifTrue: [aCollection select: block] + ifFalse: + ["protect feeding block with non character" + aCollection select: [:e |e isCharacter and: [block value: e]]]) as: CharacterSet + ! - (self species = aCollection species or: [aCollection isString or: [aCollection allSatisfy: [:e | e isCharacter]]]) ifFalse: [^super intersection: aCollection]. - ^self class including: [:c | (aCollection includes: c) and: [block value: c]]! Item was added: + ----- Method: WideCharacterSet>>enumerationCost (in category 'private') ----- + enumerationCost + "Medium cost. I can hold many characters eventually." + + ^50! Item was removed: - ----- Method: WideCharacterSet>>union: (in category 'enumerating') ----- - union: aCollection - (self isCharacters: aCollection) ifFalse: [^super union: aCollection]. - (self species = aCollection species and: [self class ~= aCollection class]) ifTrue: [^aCollection union: self]. - ^self copy addAll: aCollection; yourself!

1 0

The Trunk: Monticello-ct.706.mcz
by commits＠source.squeak.org 15 Nov '19

15 Nov '19

David T. Lewis uploaded a new version of Monticello to project The Trunk: http://source.squeak.org/trunk/Monticello-ct.706.mcz ==================== Summary ==================== Name: Monticello-ct.706 Author: ct Time: 15 November 2019, 7:37:26.401005 pm UUID: dc41402b-0662-5f4e-b13e-33dde1be1ffe Ancestors: Monticello-mt.705 Refresh Version Inspector after reparent was pressed. =============== Diff against Monticello-mt.705 =============== Item was changed: ----- Method: MCVersionInspector>>reparent (in category 'accessing') ----- reparent (self confirm:'Adopt ',self version info name, ' as the sole ancestor of your working copy?') + ifTrue: [ + self version reparent. + self refresh]! - ifTrue: [self version reparent]!

1 0

The Trunk: ToolBuilder-Tests-mt.5.mcz
by commits＠source.squeak.org 15 Nov '19

15 Nov '19

Marcel Taeumel uploaded a new version of ToolBuilder-Tests to project The Trunk: http://source.squeak.org/trunk/ToolBuilder-Tests-mt.5.mcz ==================== Summary ==================== Name: ToolBuilder-Tests-mt.5 Author: mt Time: 15 November 2019, 4:34:13.90333 pm UUID: 1c48eee1-5f21-1c40-8272-ab4c1b7e71c9 Ancestors: ToolBuilder-Tests-ct.4 Fixes tree-widget tests. They got broken due to the latest updates in tree widgets, which now automatically select the selection path in the beginning without the model having to say so. That's comparable to fetching the initial list/roots etc. =============== Diff against ToolBuilder-Tests-ct.4 =============== Item was changed: TestCase subclass: #ToolBuilderTests + instanceVariableNames: 'builder widget queries depth' - instanceVariableNames: 'builder widget queries' classVariableNames: '' poolDictionaries: '' category: 'ToolBuilder-Tests'! !ToolBuilderTests commentStamp: 'ar 2/11/2005 15:01' prior: 0! Some tests to make sure ToolBuilder does what it says.! Item was changed: ----- Method: ToolBuilderTests>>getChildrenOf: (in category 'tests-trees') ----- getChildrenOf: item queries add: #getChildrenOf. + depth := depth + 1. + ^ depth < 4 ifTrue: [(1 to: 9) asArray] ifFalse: [#()]! - ^(1 to: 9) asArray! Item was changed: ----- Method: ToolBuilderTests>>setUp (in category 'support') ----- setUp + queries := IdentitySet new. + depth := 0.! - queries := IdentitySet new.! Item was changed: ----- Method: ToolBuilderTests>>testTreeGetSelectionPath (in category 'tests-trees') ----- testTreeGetSelectionPath self makeTree. queries := IdentitySet new. self changed: #getTreeSelectionPath. self waitTick. self assert: (queries includes: #getTreeSelectionPath). + self assert: (queries includes: #setTreeSelection).! - self assert: (queries includes: #getChildrenOf). - self assert: (queries includes: #setTreeSelection). - ! Item was changed: ----- Method: ToolBuilderTests>>testTreeRoots (in category 'tests-trees') ----- testTreeRoots self makeTree. queries := IdentitySet new. + depth := 0. self changed: #getRoots. self assert: (queries includes: #getRoots).!

1 0

The Trunk: ToolBuilder-SUnit-mt.20.mcz
by commits＠source.squeak.org 15 Nov '19

15 Nov '19

Marcel Taeumel uploaded a new version of ToolBuilder-SUnit to project The Trunk: http://source.squeak.org/trunk/ToolBuilder-SUnit-mt.20.mcz ==================== Summary ==================== Name: ToolBuilder-SUnit-mt.20 Author: mt Time: 15 November 2019, 4:32:12.21533 pm UUID: 42ab408c-6728-6749-8f5f-2eb2588936ff Ancestors: ToolBuilder-SUnit-fbs.19 Updates widget stubs for tests. =============== Diff against ToolBuilder-SUnit-fbs.19 =============== Item was added: + ----- Method: TreeNodeStub>>matchesItem: (in category 'private') ----- + matchesItem: anItem + ^ self item = anItem! Item was changed: ----- Method: TreeNodeStub>>selectPath: (in category 'private') ----- selectPath: anArray | child | anArray isEmpty ifTrue: [^ self select]. + child := self children detect: [:ea | ea matchesItem: anArray first] ifNone: [^ self select]. - child := self children detect: [:ea | ea matches: anArray first] ifNone: [^ self select]. child selectPath: anArray allButFirst.! Item was changed: ----- Method: TreeStub>>setSpec: (in category 'initialize-release') ----- setSpec: aSpec super setSpec: aSpec. + self update: spec roots. + self update: spec getSelectedPath.! - self update: spec roots!

1 0

← Newer
1
...
6
7
8
9
10
11
12
13
14
Older →

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Packages November 2019