November 2010 - Pharo-dev - lists.pharo.org

Re: [Pharo-project] Loading Alien on Pharo 1.1.1

by Luc Fabresse

Hi All, To load Alien I use: Gofer new squeaksource: 'Alien'; package: 'ConfigurationOfAlien'; load. (Smalltalk at: #ConfigurationOfAlien project version: 'Pharo 1.1') load Cheers, #Luc 2010/11/18 Esteban Lorenzano <estebanlm(a)gmail.com> > Hi, > Does anybody knows if Alien should work with pharo 1.1.1 (non cog vm)? > With ConfigurationOfAlien, I'm getting the "invalid array size" prereq > violated. > > Cheers, > Esteban > > > >

Nov. 19, 2010

Re: [Pharo-project] Issue 3225 in pharo: Fade image examples/methods give DNU

by pharo＠googlecode.com

Comment #2 on issue 3225 by jbaptiste.arnaud: Fade image examples/methods give DNU http://code.google.com/p/pharo/issues/detail?id=3225 it 's a closure problem in previous version one block execute several time keep some var value. It 's not the case now. we should change : fadeImage: otherImage at: topLeft indexAndMaskDo: indexAndMaskBlock and update: fadeImageCoarse: otherImage at: topLeft fadeImageFine: otherImage at: topLeft fadeImageHor: otherImage at: topLeft fadeImageHorFine: otherImage at: topLeft fadeImageSquares: otherImage at: topLeft fadeImageVert: otherImage at: topLeft

Nov. 19, 2010

Re: [Pharo-project] Issue 3225 in pharo: Fade image examples/methods give DNU

by pharo＠googlecode.com

Updates: Status: Started Comment #1 on issue 3225 by jbaptiste.arnaud: Fade image examples/methods give DNU http://code.google.com/p/pharo/issues/detail?id=3225 (No comment was entered for this change.)

Nov. 19, 2010

Re: [Pharo-project] Revisiting Issue 1718

by Levente Uzonyi

For 1718: - don't use #asSortedCollection for sorting. - SortedCollection uses quicksort, not merge sort as stated in a comment. That's why #asSortedCollection is slow when there are only a few different values. Quicksort performance degrades to O(n^2) in this case, but that's totally valid. However merge sort has guaranteed O(n*log(n)) runtime. On Fri, 19 Nov 2010, Stephan Eggermont wrote: > I would be interested in improvements. This is just a straight translation > of the java code. It has some errors. If you define this method in Array, replace 'array' with 'self' and evaluate this code, it'll raise an error: a := (1 to: 50) asArray. [ a dualPivotQuicksort: 1 to: a size split: 3 ] bench It's also not general. #sort: #sorted: and #asSortedCollection: use a single block for comparison, while this method uses #<, #>, #= and #~= in a mixed way. > > Yaroslavskiy's Dual-Pivot Quicksort seems to perform better for large collections: > > A straightforward > defaultSort: i to: j > self dualPivotQuicksort: i to: j split: 3 > > dualPivotQuicksort: left to: right split: div > |len third m1 m2 pivot1 pivot2 less great dist newDiv| > len := right - left. > newDiv := div. > len < 27 ifTrue: [ > left+1 to: right do: [ :i | | j | > j := i. > [(j>left) and: [(array at:j) < (array at: (j-1))]] whileTrue: [ > array swap: j with: j-1. > j := j-1]]] That looks like an optimized bubble sort, ouch. Levente > ifFalse: [ > third := len // div. > m1 := left+third. > m2 := right-third. > m1 <= left ifTrue: [m1 := left+1]. > m2 >= right ifTrue: [m2 := right-1]. > (array at: m1) < (array at: m2) ifTrue: [ > array swap: m1 with: left. > array swap: m2 with: right] > ifFalse: [ > array swap: m1 with: right. > array swap: m2 with: left]. > pivot1 := array at: left. > pivot2 := array at: right. > less := left+1. > great := right-1. > less to: great do: [ :k | > (array at: k) < pivot1 ifTrue: [ > array swap: k with: less. > less := less+1.] > ifFalse: [ > (array at: k ) > pivot2 ifTrue: [ > [(k < great and: [(array at: great) > pivot2])] whileTrue: [ > great := great -1]. > array swap: k with: great. > great := great-1. > (array at: k) < pivot1 ifTrue: [ > array swap: k with: less. > less := less+1] > ] > ]]. > dist := great-less. > dist < 13 ifTrue: [ newDiv := div+1]. > array swap: (less-1) with: left. > array swap: (great+1) with: right. > self dualPivotQuicksort: left to: (less-2) split: newDiv. > self dualPivotQuicksort: (great+2) to: right split: newDiv. > (dist > (len -13) and: [ pivot1 ~= pivot2]) ifTrue:[ > less to: great do: [ :k | > (array at: k) = pivot1 ifTrue: [ > array swap: k with: less. > less := less+1] > ifFalse: [ > (array at: k) = pivot2 ifTrue: [ > array swap: k with: great. > great := great - 1. > (array at: k) = pivot1 ifTrue: [ > array swap: k with: less. > less := less+1] > ] > ] > ] > ]. > pivot1 < pivot2 ifTrue: [ > self dualPivotQuicksort: less to: great split: newDiv] > ] > > Do we have a performance test set for sorting? >

Nov. 19, 2010

Re: [Pharo-project] Infinite recursion

by Guillermo Polito

I will insist here :P. What is the desired behavior for this situation? So if it is an Issue, I may open an entry in the tracker... On Wed, Nov 17, 2010 at 1:46 PM, Schwab,Wilhelm K <bschwab(a)anest.ufl.edu>wrote: > I asked this some time back. One dark side of doing this is that it *can* > result in unwanted/inappropriate failures. In practice though, Dolphin's > limits on the stack has been a good thing. > > > > > ________________________________________ > From: pharo-project-bounces(a)lists.gforge.inria.fr [ > pharo-project-bounces(a)lists.gforge.inria.fr] On Behalf Of Guillermo Polito > [guillermopolito(a)gmail.com] > Sent: Wednesday, November 17, 2010 11:44 AM > To: Pharo-project(a)lists.gforge.inria.fr > Subject: [Pharo-project] Infinite recursion > > Hi, > > Yesterday I got into an infinite recursion, because of adding an ordered > collection into itself. And #hash is defined in terms of its containees, > hehe. > > Why I did that? It doesn't really matters. I was testing a little project > I'm doing for the University. > > So I came into an infinite recursion, which didn't stop until the VM run > out of memory... And the question is.. Shouldn't it throw an error like a > stack overflow when we run into those cases? > > Cheers, > Guille > >

Nov. 19, 2010

Re: [Pharo-project] Issue 3266 in pharo: Clean TextEditor

by Alain Plantec

> What I would like is to be able to control all alt-ctrl-cmd-shift etc > possible combinations for any morph. > It implies to review the way events are handled by Morph/HandMorph and > to remove the ugly "control and alt key" setting (Full matching, > partial matching, Swapped). > For example, it is currently impossible to map ctrl-space or ctrl-tab for #querySymbol: > Cheers > Alain > >

Nov. 19, 2010

Re: [Pharo-project] Issue 3266 in pharo: Clean TextEditor

by Alain Plantec

Le 19/11/2010 08:21, Fernando Olivero a Ã©crit : > Hi Alain, i took a better look at the changes and have to say...once > again..excellent! Thanks Fernando! > I think the next step is to improve the keybindings hardcoding in > TextEditor>>initialize > self initializeCmdKeyShortcuts. > self initializeShiftCmdKeyShortcuts. yes yes! > I have a keybindings/command model in Gaucho, for applying a > keybinding to any morph. > I will work on decoupling it from GauchoMorph into Morph. > And later rewrite the Morphs for textediting to use this. I was thinking of something like your KeyBinding.. so, very good. What I would like is to be able to control all alt-ctrl-cmd-shift etc possible combinations for any morph. It implies to review the way events are handled by Morph/HandMorph and to remove the ugly "control and alt key" setting (Full matching, partial matching, Swapped). Cheers Alain

Nov. 19, 2010

Re: [Pharo-project] Issue 3272 in pharo: SelectorChooserMorph improving

by pharo＠googlecode.com

Updates: Status: Fixed Comment #1 on issue 3272 by aplantec: SelectorChooserMorph improving http://code.google.com/p/pharo/issues/detail?id=3272 SLICE-Issue-3272-SelectorChooserMorph-improving

Nov. 19, 2010

[Pharo-project] Revisiting Issue 1718

by Stephan Eggermont

I would be interested in improvements. This is just a straight translation of the java code. Yaroslavskiy's Dual-Pivot Quicksort seems to perform better for large collections: A straightforward defaultSort: i to: j self dualPivotQuicksort: i to: j split: 3 dualPivotQuicksort: left to: right split: div |len third m1 m2 pivot1 pivot2 less great dist newDiv| len := right - left. newDiv := div. len < 27 ifTrue: [ left+1 to: right do: [ :i | | j | j := i. [(j>left) and: [(array at:j) < (array at: (j-1))]] whileTrue: [ array swap: j with: j-1. j := j-1]]] ifFalse: [ third := len // div. m1 := left+third. m2 := right-third. m1 <= left ifTrue: [m1 := left+1]. m2 >= right ifTrue: [m2 := right-1]. (array at: m1) < (array at: m2) ifTrue: [ array swap: m1 with: left. array swap: m2 with: right] ifFalse: [ array swap: m1 with: right. array swap: m2 with: left]. pivot1 := array at: left. pivot2 := array at: right. less := left+1. great := right-1. less to: great do: [ :k | (array at: k) < pivot1 ifTrue: [ array swap: k with: less. less := less+1.] ifFalse: [ (array at: k ) > pivot2 ifTrue: [ [(k < great and: [(array at: great) > pivot2])] whileTrue: [ great := great -1]. array swap: k with: great. great := great-1. (array at: k) < pivot1 ifTrue: [ array swap: k with: less. less := less+1] ] ]]. dist := great-less. dist < 13 ifTrue: [ newDiv := div+1]. array swap: (less-1) with: left. array swap: (great+1) with: right. self dualPivotQuicksort: left to: (less-2) split: newDiv. self dualPivotQuicksort: (great+2) to: right split: newDiv. (dist > (len -13) and: [ pivot1 ~= pivot2]) ifTrue:[ less to: great do: [ :k | (array at: k) = pivot1 ifTrue: [ array swap: k with: less. less := less+1] ifFalse: [ (array at: k) = pivot2 ifTrue: [ array swap: k with: great. great := great - 1. (array at: k) = pivot1 ifTrue: [ array swap: k with: less. less := less+1] ] ] ] ]. pivot1 < pivot2 ifTrue: [ self dualPivotQuicksort: less to: great split: newDiv] ] Do we have a performance test set for sorting?

Nov. 19, 2010

[Pharo-project] Issue 3272 in pharo: SelectorChooserMorph improving

by pharo＠googlecode.com

Status: Accepted Owner: aplantec Labels: Milestone-1.2 New issue 3272 by aplantec: SelectorChooserMorph improving http://code.google.com/p/pharo/issues/detail?id=3272 New version with a highlighted current prefix (see screenshot). In case of error or if the requestor textMorph is closed, then the SelectorChooser is staying openned behind. The new version fixes this issues. Attachments: selectorChooserImprovement.png 36.0 KB

Nov. 19, 2010