December 2009 - Pharo-dev - lists.pharo.org

Re: [Pharo-project] moose collection extensions

by Lukas Renggli

Iiik, that uses [ :each ] = [ :each | each ] everywhere. Lukas 2009/12/27 StÃ©phane Ducasse <stephane.ducasse(a)inria.fr>: > hi > > here are the collection extensions we use in Moose. > I copied them to PharoTaskForces so that we can discuss and tweak the code if wanted. > > My favorite is > Â Â Â Â flatCollect:/flatCollectAsSet: > Â Â Â Â groupedBy: > > Â Â Â Â There are really useful. > > Stef > > > testFlatCollectArray > Â Â Â Â "self debug: #testFlatCollectArray" > > Â Â Â Â self assert: ((#((1 2) (3 4) (5 3)) flatCollect: [ :each ]) = #(1 2 3 4 5 3)). > Â Â Â Â self assert: ((#((1 2) (2 3) (1 3 4)) flatCollect: [:each]) = #(1 2 2 3 1 3 4)). > > Â Â Â Â self assert: ((#((1 2) (2 3) () ()) flatCollect: [:each]) = #(1 2 2 3)). > > Â Â Â Â self assert: ((#((1 2) (2 3) (1 3 4)) flatCollect: [:each| Array with: each]) > Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â = Â #(#(1 2) #(2 3) #(1 3 4))). > > Â Â Â Â self assert: ((#((1 2) (2 3) (1 3 4)) flatCollect: [:each| Set with: each]) > Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â = Â #(#(1 2) #(2 3) #(1 3 4))). > > > testFlatCollectSet > Â Â Â Â "self debug: #testFlatCollectSet" > > Â Â Â Â self assert: ((#((1 2) (1 2) (1 3 4)) asSet Â flatCollect: [:each]) = #(1 1 2 3 4) asSet). > Â Â Â Â self assert: ((#() asSet flatCollect: [:each]) = #() asSet). > > Â Â Â Â self assert: Â ((#((1 2) () (1 3 4)) asSet Â flatCollect: [:each]) = #(1 1 2 3 4) asSet). > Â Â Â Â self assert: Â ((#((1 2) #((99)) (1 3 4)) asSet Â flatCollect: [:each]) > Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â = #(1 1 2 3 4 (99)) asSet). > Â Â Â Â self assert: Â ((#((1 2) #(()) (1 3 4)) asSet Â flatCollect: [:each]) > Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â = #(1 1 2 3 4 ()) asSet). > > testCollectAsSet > Â Â Â Â "self debug: #testCollectAsSet" > > Â Â Â Â self assert: ((#() collectAsSet: [:each | each odd]) = Set new). > Â Â Â Â self assert: (#(1 2 3 4 5 6) collectAsSet: [:each | each odd]) > Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â = (Set with: true with: false). > Â Â Â Â self assert: (#(1 3 5 7 9 11) collectAsSet: [:each | each odd]) > Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â = (Set with: true). > > Â Â Â Â self assert: (#(1 2 3 4 5 4 3 2 1) collectAsSet: [:each | each]) = (1 to: 5) asSet. > > > testGroupedByArray > Â Â Â Â "self debug: #testGroupedByArray" > > Â Â Â Â | res | > Â Â Â Â res := #(1 2 3 4 5) groupedBy: [:each | each odd]. > Â Â Â Â self assert: Â (res at: true) = #(1 3 5). > Â Â Â Â self assert: (res at: false) = #(2 4) > > > > Set>>flatCollect: aBlock > > > Â Â Â Â ^self flatCollectAsSet: aBlock > > > Symbol>>value > Â Â Â Â "Allow this object to act as a ValueHolder on itself." > > Â Â Â Â ^self > > OrderedCollection>>removeAtIndex: anIndex > Â Â Â Â "Remove the element of the collection at position anIndex. Â Answer the object removed." > > Â Â Â Â | obj | > Â Â Â Â obj := self at: anIndex. > Â Â Â Â self removeIndex: anIndex + firstIndex - 1. > Â Â Â Â ^obj > > Collection > ============================== > > collectAsSet: aBlock > Â Â Â Â "Evaluates aBlock for each element of the receiver and collects > Â Â Â Â the resulting values into a Set." > > Â Â Â Â "This is an efficient shorthand for [ (self collect: aBlock) asSet ]." > Â Â Â Â "originally developed by a. kuhn and released under MIT." > > Â Â Â Â ^self inject: Set new into: [ :set :each | > Â Â Â Â Â Â Â Â set add: (aBlock value: each); yourself ]. > > > copyEmpty: aSize > Â Â Â Â "Answer a copy of the receiver that contains no elements. > > Â Â Â Â This method should be redefined in subclasses that add > Â Â Â Â instance variables, so that the state of those variables > Â Â Â Â is preserved" > > Â Â Â Â ^self class new: aSize > > > flatCollect: aBlock > Â Â Â Â "Evaluate aBlock for each of the receiver's elements and answer the > Â Â Â Â list of all resulting values flatten one level. Assumes that aBlock returns some kind > Â Â Â Â of collection for each element. Equivalent to the lisp's mapcan" > Â Â Â Â "original written by a. Kuhn and released under MIT" > > Â Â Â Â | stream | > Â Â Â Â self isEmpty ifTrue: [ ^ self copy ]. > Â Â Â Â stream := (self species new: 0) nsWriteStream. > Â Â Â Â self do: [ :each | stream nextPutAll: (aBlock value: each) ]. > Â Â Â Â ^ stream contents > > flatCollectAsSet: aBlock > Â Â Â Â "Evaluate aBlock for each of the receiver's elements and answer the > Â Â Â Â list of all resulting values flatten one level. Assumes that aBlock returns some kind > Â Â Â Â of collection for each element. Equivalent to the lisp's mapcan" > > Â Â Â Â "original written by a. Kuhn and released under MIT" > > Â Â Â Â | set | > Â Â Â Â self isEmpty ifTrue: [^self copy ]. > Â Â Â Â set := Set new. > Â Â Â Â self do: [ :each | > Â Â Â Â Â Â Â Â set addAll: (aBlock value: each) ]. > Â Â Â Â ^set > > > flatten > Â Â Â Â "Recursively collect each non-collection element of the receiver and its descendant > Â Â Â Â collections. Â Please note, this implementation assumes that strings are to be treated > Â Â Â Â as objects rather than as collection." > > Â Â Â Â ^self gather: [ :each ] > > groupedBy: aBlock > Â Â Â Â "Return a dictionary whose keys are the result of evaluating aBlock for all elements in > Â Â Â Â the collection, and the value for each key is the collection of elements that evaluated > Â Â Â Â to that key. e.g. > Â Â Â Â Â Â #(1 2 3 4 5) groupedBy: [:each | each odd] > Â Â Â Â Â a Dictionary > Â Â Â Â Â Â true ---> #( 1 3 5) > Â Â Â Â Â Â false --> #(2 4) > Â Â Â Â originally developed by a. kuhn and released under MIT." > > Â Â Â Â | result | > Â Â Â Â result := Dictionary new. > Â Â Â Â self do: > Â Â Â Â Â Â Â Â [:each | | key collection | > Â Â Â Â Â Â Â Â key := aBlock value: each. > Â Â Â Â Â Â Â Â collection := result at: key ifAbsentPut: [OrderedCollection new]. > Â Â Â Â Â Â Â Â collection add: each]. > Â Â Â Â self species ~~ OrderedCollection ifTrue: > Â Â Â Â Â Â Â Â ["Convert the result collections to be the right type. > Â Â Â Â Â Â Â Â Â Note that it should be safe to modify the dictionary > Â Â Â Â Â Â Â Â Â while iterating because we only replace values for existing keys" > Â Â Â Â Â Â Â Â result keysAndValuesDo: > Â Â Â Â Â Â Â Â Â Â Â Â [:key :value | result at: key put: (self species withAll: value)]]. > > Â Â Â Â ^result > > includesAll: aCollection > Â Â Â Â "Answer true if the receiver includes all elements of aCollection with at > Â Â Â Â least as many occurrences as in aCollection. For a less strict comparison > Â Â Â Â please refer to supersetOf: and its inverse subsetOf:." > > > Â Â Â Â ^(aCollection isCollection) and: [ > Â Â Â Â Â Â Â Â aCollection size <= self size and: [ > Â Â Â Â Â Â Â Â Â Â Â Â aCollection allSatisfy: [ :each | > Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â (aCollection occurrencesOf: each) <= (self occurrencesOf: each) ]]] > > nilSafeGroupedBy: aBlock > Â Â Â Â ^ self groupedBy: [ :each | > Â Â Â Â Â Â Â Â | value | > Â Â Â Â Â Â Â Â value := aBlock value: each. > Â Â Â Â Â Â Â Â value ifNil: [ UndefinedObject ]. > Â Â Â Â ] > > selectAsSet: aBlock > Â Â Â Â "Evaluate aBlock with each of the receiver's elements as the argument. > Â Â Â Â Collect into a new set, only those elements for which > Â Â Â Â aBlock evaluates to true. Â Answer the new collection." > > Â Â Â Â | newSet | > Â Â Â Â newSet := Set new. > Â Â Â Â self do: [:each | (aBlock value: each) ifTrue: [newSet add: each]]. > Â Â Â Â ^newSet > > shuffle > Â Â Â Â "Swaps the receiver's elements at random." > > Â Â Â Â self shuffle: (self size * self size log) asInteger > > sum: aSymbolOrBlock > > Â Â Â Â ^self > Â Â Â Â Â Â Â Â inject: 0 > Â Â Â Â Â Â Â Â into: [:sum :each | sum + (aSymbolOrBlock value: each)] > > shuffle: times > Â Â Â Â "Swaps random elements of the receiver." > > Â Â Â Â | size random | > Â Â Â Â size := self size. > Â Â Â Â random := Random new. > Â Â Â Â times timesRepeat: [ > Â Â Â Â Â Â Â Â self swap: (random next * size) floor + 1 with: (random next * size) floor + 1 > Â Â Â Â ]. > > > > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project > -- Lukas Renggli http://www.lukas-renggli.ch

Dec. 27, 2009

Re: [Pharo-project] Issue with gofer/metacello

by Lukas Renggli

> After proceeding these warnings, I have a rollback: MNU > GoferPackageReference class>>name:repository: Can you evaluate [ Gofer gofer load ] on: Error do: [ :err | err retry ]. Gofer gofer recompile. ? I don't have any senders of #name:repository: to GoferPackageReference. Lukas -- Lukas Renggli http://www.lukas-renggli.ch

Dec. 27, 2009

[Pharo-project] [update 1.1] #11117

by StÃ©phane Ducasse

11117 ----- - Issue 1694: New tests to ProtoObjectTest - Issue 1695: prune search in MCFilteredVersionSorter - Issue 1696: Add tests for Week class methods indexOfDay:, nameOfDay: and dayNames. Thanks mariano :) - Issue 1700: Mac menus should be cleaned HostMenus... initialize - Issue 1701: Don t fork the menu event handler Mike I merged your fixes because there were some Preferences left. Now let us know if this is also for 1.0 Stef

Dec. 27, 2009

[Pharo-project] moose collection extensions

by StÃ©phane Ducasse

hi here are the collection extensions we use in Moose. I copied them to PharoTaskForces so that we can discuss and tweak the code if wanted. My favorite is flatCollect:/flatCollectAsSet: groupedBy: There are really useful. Stef testFlatCollectArray "self debug: #testFlatCollectArray" self assert: ((#((1 2) (3 4) (5 3)) flatCollect: [ :each ]) = #(1 2 3 4 5 3)). self assert: ((#((1 2) (2 3) (1 3 4)) flatCollect: [:each]) = #(1 2 2 3 1 3 4)). self assert: ((#((1 2) (2 3) () ()) flatCollect: [:each]) = #(1 2 2 3)). self assert: ((#((1 2) (2 3) (1 3 4)) flatCollect: [:each| Array with: each]) = #(#(1 2) #(2 3) #(1 3 4))). self assert: ((#((1 2) (2 3) (1 3 4)) flatCollect: [:each| Set with: each]) = #(#(1 2) #(2 3) #(1 3 4))). testFlatCollectSet "self debug: #testFlatCollectSet" self assert: ((#((1 2) (1 2) (1 3 4)) asSet flatCollect: [:each]) = #(1 1 2 3 4) asSet). self assert: ((#() asSet flatCollect: [:each]) = #() asSet). self assert: ((#((1 2) () (1 3 4)) asSet flatCollect: [:each]) = #(1 1 2 3 4) asSet). self assert: ((#((1 2) #((99)) (1 3 4)) asSet flatCollect: [:each]) = #(1 1 2 3 4 (99)) asSet). self assert: ((#((1 2) #(()) (1 3 4)) asSet flatCollect: [:each]) = #(1 1 2 3 4 ()) asSet). testCollectAsSet "self debug: #testCollectAsSet" self assert: ((#() collectAsSet: [:each | each odd]) = Set new). self assert: (#(1 2 3 4 5 6) collectAsSet: [:each | each odd]) = (Set with: true with: false). self assert: (#(1 3 5 7 9 11) collectAsSet: [:each | each odd]) = (Set with: true). self assert: (#(1 2 3 4 5 4 3 2 1) collectAsSet: [:each | each]) = (1 to: 5) asSet. testGroupedByArray "self debug: #testGroupedByArray" | res | res := #(1 2 3 4 5) groupedBy: [:each | each odd]. self assert: (res at: true) = #(1 3 5). self assert: (res at: false) = #(2 4) Set>>flatCollect: aBlock ^self flatCollectAsSet: aBlock Symbol>>value "Allow this object to act as a ValueHolder on itself." ^self OrderedCollection>>removeAtIndex: anIndex "Remove the element of the collection at position anIndex. Answer the object removed." | obj | obj := self at: anIndex. self removeIndex: anIndex + firstIndex - 1. ^obj Collection ============================== collectAsSet: aBlock "Evaluates aBlock for each element of the receiver and collects the resulting values into a Set." "This is an efficient shorthand for [ (self collect: aBlock) asSet ]." "originally developed by a. kuhn and released under MIT." ^self inject: Set new into: [ :set :each | set add: (aBlock value: each); yourself ]. copyEmpty: aSize "Answer a copy of the receiver that contains no elements. This method should be redefined in subclasses that add instance variables, so that the state of those variables is preserved" ^self class new: aSize flatCollect: aBlock "Evaluate aBlock for each of the receiver's elements and answer the list of all resulting values flatten one level. Assumes that aBlock returns some kind of collection for each element. Equivalent to the lisp's mapcan" "original written by a. Kuhn and released under MIT" | stream | self isEmpty ifTrue: [ ^ self copy ]. stream := (self species new: 0) nsWriteStream. self do: [ :each | stream nextPutAll: (aBlock value: each) ]. ^ stream contents flatCollectAsSet: aBlock "Evaluate aBlock for each of the receiver's elements and answer the list of all resulting values flatten one level. Assumes that aBlock returns some kind of collection for each element. Equivalent to the lisp's mapcan" "original written by a. Kuhn and released under MIT" | set | self isEmpty ifTrue: [^self copy ]. set := Set new. self do: [ :each | set addAll: (aBlock value: each) ]. ^set flatten "Recursively collect each non-collection element of the receiver and its descendant collections. Please note, this implementation assumes that strings are to be treated as objects rather than as collection." ^self gather: [ :each ] groupedBy: aBlock "Return a dictionary whose keys are the result of evaluating aBlock for all elements in the collection, and the value for each key is the collection of elements that evaluated to that key. e.g. #(1 2 3 4 5) groupedBy: [:each | each odd] a Dictionary true ---> #( 1 3 5) false --> #(2 4) originally developed by a. kuhn and released under MIT." | result | result := Dictionary new. self do: [:each | | key collection | key := aBlock value: each. collection := result at: key ifAbsentPut: [OrderedCollection new]. collection add: each]. self species ~~ OrderedCollection ifTrue: ["Convert the result collections to be the right type. Note that it should be safe to modify the dictionary while iterating because we only replace values for existing keys" result keysAndValuesDo: [:key :value | result at: key put: (self species withAll: value)]]. ^result includesAll: aCollection "Answer true if the receiver includes all elements of aCollection with at least as many occurrences as in aCollection. For a less strict comparison please refer to supersetOf: and its inverse subsetOf:." ^(aCollection isCollection) and: [ aCollection size <= self size and: [ aCollection allSatisfy: [ :each | (aCollection occurrencesOf: each) <= (self occurrencesOf: each) ]]] nilSafeGroupedBy: aBlock ^ self groupedBy: [ :each | | value | value := aBlock value: each. value ifNil: [ UndefinedObject ]. ] selectAsSet: aBlock "Evaluate aBlock with each of the receiver's elements as the argument. Collect into a new set, only those elements for which aBlock evaluates to true. Answer the new collection." | newSet | newSet := Set new. self do: [:each | (aBlock value: each) ifTrue: [newSet add: each]]. ^newSet shuffle "Swaps the receiver's elements at random." self shuffle: (self size * self size log) asInteger sum: aSymbolOrBlock ^self inject: 0 into: [:sum :each | sum + (aSymbolOrBlock value: each)] shuffle: times "Swaps random elements of the receiver." | size random | size := self size. random := Random new. times timesRepeat: [ self swap: (random next * size) floor + 1 with: (random next * size) floor + 1 ].

Dec. 27, 2009

Re: [Pharo-project] Issue with gofer/metacello

by Geert Claes

Alexandre Bergel wrote: > > With the last version of Pharo (10502), I get few deprecation warnings > (package: should be used instead of addPackage: and version: instead > of addVersion:). > Similar issues when trying to load Moose with the last version of Pharo (addPackage, data was late?, addVersion followed by a message not understood) -- View this message in context: http://n2.nabble.com/Issue-with-gofer-metacello-tp4220764p4220805.html Sent from the Pharo Smalltalk mailing list archive at Nabble.com.

Dec. 27, 2009

Re: [Pharo-project] akuhn/SUnit, chrisma edition :)

by Lukas Renggli

> Where is the update of Gofer that understand your expression? [ Gofer gofer load ] on: Error do: [ :err | err retry ]. Gofer gofer recompile. Lukas -- Lukas Renggli http://www.lukas-renggli.ch

Dec. 27, 2009

[Pharo-project] Issue with gofer/metacello

by Alexandre Bergel

Hi! Last week, the following expression was used to load Mondrian. Gofer new squeaksource: 'Mondrian'; addPackage: 'ConfigurationOfMondrian'; load. (Smalltalk at: #ConfigurationOfMondrian) perform: #loadLastStable. With the last version of Pharo (10502), I get few deprecation warnings (package: should be used instead of addPackage: and version: instead of addVersion:). After proceeding these warnings, I have a rollback: MNU GoferPackageReference class>>name:repository: Cheers, Alexandre -- _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: Alexandre Bergel http://www.bergel.eu ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.

Dec. 27, 2009

Re: [Pharo-project] akuhn/SUnit, chrisma edition :)

by Alexandre Bergel

Hi Adrian, > Gofer it > disablePackageCache; > squeaksource: 'akuhn'; > package: 'SUnit'; > package: 'SUnitGUI'; > load Where is the update of Gofer that understand your expression? I tried with Gofer-AdrianLienhard.79 and Gofer-DamienCassou.88 from squeaksource.com/Pharo, but disablePackageCache: and package: are not understood. Cheers, Alexandre -- _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: Alexandre Bergel http://www.bergel.eu ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.

Dec. 27, 2009

[Pharo-project] [BUG] Bitmap DejaVu Sans / WideString

by Lukas Renggli

Bitmap DejaVu Sans displays WideStrings in unpredictable ways. Looks like there is a bug in StrikeFont? Lukas -- Lukas Renggli http://www.lukas-renggli.ch

Dec. 27, 2009

Re: [Pharo-project] Collection>>select: aBlock ifNoneTakeAsDefault: aDefaultValue

by Lukas Renggli

>> Personally, I would rather see #ifEmpty: modified to return self in >> the false case like #ifNil: does. The only in-image sender I can find >> that even uses the return value seems to actually expect this >> behaviour anyway. :) +1 > what is the behavior in other dialects ? :) > Do you have some nice tests to cover the semantics? > Did you do the change and see what break? I don't think anybody else has this method. Lukas -- Lukas Renggli http://www.lukas-renggli.ch

Dec. 27, 2009