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

[Pharo-project] Mac VM 5.2b3 & iPhone VM 2.1.0 ships

by John M McIntosh

I've push the latest cocoa based 32/64bit macintel/powerpc VM Various users pointed out that option-arrow key did not work. Oddly I had marked moveWordForward/Back/etc as being required but couldn't figure out what the magic keystrokes were. 5.2b3 fixes the problem. Look for the folder experimental/64bits in the regular places found via http://smalltalkconsulting.com/squeak.html or ftp://ftp.smalltalkconsulting.com/experimental/64bit/32bitImage*64bitVM/ file name: Squeak 64-32 5.2b3.app.zip This *beta* VM runs in 32 or 64 bit mode on macIntel, and 32bit mode on powerpc to support Squeak 32bit images. Requires os-x 10.5 or higher. -------------------------------- iPhone VM 2.1.0 The iPhone VM now uses the pharo1.0-10502-rc1dev09.12.2.image The image feels faster, likely due to the ongoing Pharo optimization work. I note I can no longer build custom VM's for people's iPhones since I've exceeded the number of devices I can dedicate to iPhone development. People who have not use the iPhone VM in the past will need another developer to build a VM for them, or will need to purchase Apple's iPhone SDK. ----------------------------------- For the moment source for both VMs can be found at http://isqueak.org -- =========================================================================== John M. McIntosh <johnmci(a)smalltalkconsulting.com> Twitter: squeaker68882 Corporate Smalltalk Consulting Ltd. http://www.smalltalkconsulting.com ===========================================================================

Jan. 6, 2010

Re: [Pharo-project] Permutations and Combinations in SequenceableCollection

by John Toohey

:-) I don't suppose you have an equally elegant solution to the scores for a NFL game, where the units can be 1,2,3,6, assuming that each team could score a total of say, 35 points. On Tue, Jan 5, 2010 at 21:26, Randal L. Schwartz <merlyn(a)stonehenge.com>wrote: > >>>>> "John" == John Toohey <jt(a)parspro.com> writes: > > John> Thank you, duly chastened. I did know the formulae for P and C, but > didn't > John> know how to add the repetitions. My original code was :- > John> |c| > John> c := SortedCollection new. > John> c add: '0, 0'; add:'1, 1'; add: '2, 2'; add:'3, 3'; add: '4, 4'. > John> (0 to: 4) combinations: 2 atATimeDo:[:each | c add: each > asCommaString. c > John> add:( each reverse) asCommaString]. > > "Every time I cut with this wide saw, it removes 1/2 inch from the wood! > I'll just glue it back after the cuts!" > > "why don't you just use the laser cutter? no losses!" > > :-) > > -- > Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095 > <merlyn(a)stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> > Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. > See http://methodsandmessages.vox.com/ for Smalltalk and Seaside > discussion > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project > -- -JT

Jan. 6, 2010

Re: [Pharo-project] Permutations and Combinations in SequenceableCollection

by merlyn＠stonehenge.com

>>>>> "John" == John Toohey <jt(a)parspro.com> writes: John> Thank you, duly chastened. I did know the formulae for P and C, but didn't John> know how to add the repetitions. My original code was :- John> |c| John> c := SortedCollection new. John> c add: '0, 0'; add:'1, 1'; add: '2, 2'; add:'3, 3'; add: '4, 4'. John> (0 to: 4) combinations: 2 atATimeDo:[:each | c add: each asCommaString. c John> add:( each reverse) asCommaString]. "Every time I cut with this wide saw, it removes 1/2 inch from the wood! I'll just glue it back after the cuts!" "why don't you just use the laser cutter? no losses!" :-) -- Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095 <merlyn(a)stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. See http://methodsandmessages.vox.com/ for Smalltalk and Seaside discussion

Jan. 6, 2010

Re: [Pharo-project] Permutations and Combinations in SequenceableCollection

by merlyn＠stonehenge.com

>>>>> "Eliot" == Eliot Miranda <eliot.miranda(a)gmail.com> writes: Eliot> <blush>oops, just noticed Randal already provided this.</blush> "Like ships, passing in the night..." :-) -- Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095 <merlyn(a)stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. See http://methodsandmessages.vox.com/ for Smalltalk and Seaside discussion

Jan. 6, 2010

Re: [Pharo-project] Permutations and Combinations in SequenceableCollection

by John Toohey

Thank you, duly chastened. I did know the formulae for P and C, but didn't know how to add the repetitions. My original code was :- |c| c := SortedCollection new. c add: '0, 0'; add:'1, 1'; add: '2, 2'; add:'3, 3'; add: '4, 4'. (0 to: 4) combinations: 2 atATimeDo:[:each | c add: each asCommaString. c add:( each reverse) asCommaString]. ^c Really glad that I asked the question. Thank you again. On Tue, Jan 5, 2010 at 20:36, Randal L. Schwartz <merlyn(a)stonehenge.com>wrote: > >>>>> "John" == John Toohey <jt(a)parspro.com> writes: > > John> What I needed to do was from a sequence of say, 0 to: 4, produce #(0 > 0)#(1 > John> 1)#(2 2)#(3 3)#(4 4)#(1 0)#(2 1)#(3 2)#(4 3)#(0 4)#(2 0)#(3 1)#(4 > 2)#(0 > John> 3)#(1 4)#(3 0)#(4 1)#(0 2)#(1 3)#(2 4)#(4 0)#(0 1)#(1 2)#(2 3)#(3 > John> 4). Basically, I wanted to generate all possible scores for a soccer > match, > John> hence the 1-1, 0-0, etc. > > That's what I did. > > You want X, Y for all possible values of X from 0 to 4 and Y from 0 to 4, > right? > > That's *not* permutations. > > That's *not* combinations. > > That's "combinations with replacement/repetition". > > ... http://en.wikipedia.org/wiki/Combination > > I hate it when people use the words permutation or combination without > realizing they have specific math meanings. But that's not your fault, > but I hope you never do it again. :) > > -- > Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095 > <merlyn(a)stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> > Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. > See http://methodsandmessages.vox.com/ for Smalltalk and Seaside > discussion > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project > -- -JT

Jan. 6, 2010

Re: [Pharo-project] Permutations and Combinations in SequenceableCollection

by Eliot Miranda

<blush>oops, just noticed Randal already provided this.</blush> On Tue, Jan 5, 2010 at 5:47 PM, Eliot Miranda <eliot.miranda(a)gmail.com>wrote: > > > 2010/1/5 John Toohey <jt(a)parspro.com> > > What I needed to do was from a sequence of say, 0 to: 4, produce #(0 0)#(1 >> 1)#(2 2)#(3 3)#(4 4)#(1 0)#(2 1)#(3 2)#(4 3)#(0 4)#(2 0)#(3 1)#(4 2)#(0 >> 3)#(1 4)#(3 0)#(4 1)#(0 2)#(1 3)#(2 4)#(4 0)#(0 1)#(1 2)#(2 3)#(3 >> 4). Basically, I wanted to generate all possible scores for a soccer match, >> hence the 1-1, 0-0, etc. > > > allPairsDo: aBinaryBlock > self do: [:first| self do: [:second| aBinaryBlock value: first value: > second]] > > right? > > >> >> >> On Tue, Jan 5, 2010 at 19:58, Randal L. Schwartz <merlyn(a)stonehenge.com>wrote: >> >>> >>>>> "Levente" == Levente Uzonyi <leves(a)elte.hu> writes: >>> >>> Levente> On Tue, 5 Jan 2010, John Toohey wrote: >>> >> But this doesn't get 1-1, 2-2 or 3-3. I had tried something like that >>> use >>> >> #reverse on each combination, but #combinations does not generate >>> >> -duplicates- from the number sequences. >>> >>> Levente> I guess you are looking for this: >>> Levente> allPairsFromCollectionDo := [ :collection :block | >>> Levente> | o | >>> Levente> o := OrderedCollection newFrom: collection. >>> Levente> o size timesRepeat: [ >>> Levente> o with: collection do: block. >>> Levente> o add: o removeFirst ] ]. >>> >>> Or more simply: >>> >>> aCollection do: [:x | aCollection do: [:y | "use x and y"]]. >>> >>> Unless I'm misunderstanding the problem. >>> >>> Which is neither combinations nor permutations, but so far is the only >>> thing >>> that fits all the bizarre conditions. >>> >>> -- >>> Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 >>> 0095 >>> <merlyn(a)stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> >>> Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. >>> See http://methodsandmessages.vox.com/ for Smalltalk and Seaside >>> discussion >>> >>> _______________________________________________ >>> Pharo-project mailing list >>> Pharo-project(a)lists.gforge.inria.fr >>> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >>> >> >> >> >> -- >> -JT >> >> >> >> _______________________________________________ >> Pharo-project mailing list >> Pharo-project(a)lists.gforge.inria.fr >> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >> > >

Jan. 6, 2010

Re: [Pharo-project] Permutations and Combinations in SequenceableCollection

by Eliot Miranda

2010/1/5 John Toohey <jt(a)parspro.com> > What I needed to do was from a sequence of say, 0 to: 4, produce #(0 0)#(1 > 1)#(2 2)#(3 3)#(4 4)#(1 0)#(2 1)#(3 2)#(4 3)#(0 4)#(2 0)#(3 1)#(4 2)#(0 > 3)#(1 4)#(3 0)#(4 1)#(0 2)#(1 3)#(2 4)#(4 0)#(0 1)#(1 2)#(2 3)#(3 > 4). Basically, I wanted to generate all possible scores for a soccer match, > hence the 1-1, 0-0, etc. allPairsDo: aBinaryBlock self do: [:first| self do: [:second| aBinaryBlock value: first value: second]] right? > > > On Tue, Jan 5, 2010 at 19:58, Randal L. Schwartz <merlyn(a)stonehenge.com>wrote: > >> >>>>> "Levente" == Levente Uzonyi <leves(a)elte.hu> writes: >> >> Levente> On Tue, 5 Jan 2010, John Toohey wrote: >> >> But this doesn't get 1-1, 2-2 or 3-3. I had tried something like that >> use >> >> #reverse on each combination, but #combinations does not generate >> >> -duplicates- from the number sequences. >> >> Levente> I guess you are looking for this: >> Levente> allPairsFromCollectionDo := [ :collection :block | >> Levente> | o | >> Levente> o := OrderedCollection newFrom: collection. >> Levente> o size timesRepeat: [ >> Levente> o with: collection do: block. >> Levente> o add: o removeFirst ] ]. >> >> Or more simply: >> >> aCollection do: [:x | aCollection do: [:y | "use x and y"]]. >> >> Unless I'm misunderstanding the problem. >> >> Which is neither combinations nor permutations, but so far is the only >> thing >> that fits all the bizarre conditions. >> >> -- >> Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 >> 0095 >> <merlyn(a)stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> >> Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. >> See http://methodsandmessages.vox.com/ for Smalltalk and Seaside >> discussion >> >> _______________________________________________ >> Pharo-project mailing list >> Pharo-project(a)lists.gforge.inria.fr >> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >> > > > > -- > -JT > > > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >

Jan. 6, 2010

Re: [Pharo-project] Permutations and Combinations in SequenceableCollection

by merlyn＠stonehenge.com

>>>>> "John" == John Toohey <jt(a)parspro.com> writes: John> What I needed to do was from a sequence of say, 0 to: 4, produce #(0 0)#(1 John> 1)#(2 2)#(3 3)#(4 4)#(1 0)#(2 1)#(3 2)#(4 3)#(0 4)#(2 0)#(3 1)#(4 2)#(0 John> 3)#(1 4)#(3 0)#(4 1)#(0 2)#(1 3)#(2 4)#(4 0)#(0 1)#(1 2)#(2 3)#(3 John> 4). Basically, I wanted to generate all possible scores for a soccer match, John> hence the 1-1, 0-0, etc. That's what I did. You want X, Y for all possible values of X from 0 to 4 and Y from 0 to 4, right? That's *not* permutations. That's *not* combinations. That's "combinations with replacement/repetition". ... http://en.wikipedia.org/wiki/Combination I hate it when people use the words permutation or combination without realizing they have specific math meanings. But that's not your fault, but I hope you never do it again. :) -- Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095 <merlyn(a)stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. See http://methodsandmessages.vox.com/ for Smalltalk and Seaside discussion

Jan. 6, 2010

Re: [Pharo-project] Permutations and Combinations in SequenceableCollection

by Levente Uzonyi

On Tue, 5 Jan 2010, Randal L. Schwartz wrote: >>>>>> "Levente" == Levente Uzonyi <leves(a)elte.hu> writes: > > Levente> On Tue, 5 Jan 2010, John Toohey wrote: >>> But this doesn't get 1-1, 2-2 or 3-3. I had tried something like that use >>> #reverse on each combination, but #combinations does not generate >>> -duplicates- from the number sequences. > > Levente> I guess you are looking for this: > Levente> allPairsFromCollectionDo := [ :collection :block | > Levente> | o | > Levente> o := OrderedCollection newFrom: collection. > Levente> o size timesRepeat: [ > Levente> o with: collection do: block. > Levente> o add: o removeFirst ] ]. > > Or more simply: > > aCollection do: [:x | aCollection do: [:y | "use x and y"]]. Nice, it's funny that I didn't find this simple solution. And it's O(n^2) instead of O(n^3) like mine (because OrderedCollection is implemented such a dumb way). Levente > > Unless I'm misunderstanding the problem. > > Which is neither combinations nor permutations, but so far is the only thing > that fits all the bizarre conditions. > > -- > Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095 > <merlyn(a)stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> > Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. > See http://methodsandmessages.vox.com/ for Smalltalk and Seaside discussion >

Jan. 6, 2010

Re: [Pharo-project] Permutations and Combinations in SequenceableCollection

by John Toohey

What I needed to do was from a sequence of say, 0 to: 4, produce #(0 0)#(1 1)#(2 2)#(3 3)#(4 4)#(1 0)#(2 1)#(3 2)#(4 3)#(0 4)#(2 0)#(3 1)#(4 2)#(0 3)#(1 4)#(3 0)#(4 1)#(0 2)#(1 3)#(2 4)#(4 0)#(0 1)#(1 2)#(2 3)#(3 4). Basically, I wanted to generate all possible scores for a soccer match, hence the 1-1, 0-0, etc. On Tue, Jan 5, 2010 at 19:58, Randal L. Schwartz <merlyn(a)stonehenge.com>wrote: > >>>>> "Levente" == Levente Uzonyi <leves(a)elte.hu> writes: > > Levente> On Tue, 5 Jan 2010, John Toohey wrote: > >> But this doesn't get 1-1, 2-2 or 3-3. I had tried something like that > use > >> #reverse on each combination, but #combinations does not generate > >> -duplicates- from the number sequences. > > Levente> I guess you are looking for this: > Levente> allPairsFromCollectionDo := [ :collection :block | > Levente> | o | > Levente> o := OrderedCollection newFrom: collection. > Levente> o size timesRepeat: [ > Levente> o with: collection do: block. > Levente> o add: o removeFirst ] ]. > > Or more simply: > > aCollection do: [:x | aCollection do: [:y | "use x and y"]]. > > Unless I'm misunderstanding the problem. > > Which is neither combinations nor permutations, but so far is the only > thing > that fits all the bizarre conditions. > > -- > Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095 > <merlyn(a)stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> > Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. > See http://methodsandmessages.vox.com/ for Smalltalk and Seaside > discussion > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project > -- -JT

Jan. 6, 2010