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

Re: [Pharo-project] Interim build server

by Marcus Denker

On Jan 6, 2010, at 8:08 AM, StÃ©phane Ducasse wrote: > mike > > I will ask in my team if our infrastructure can be used. > Damien, marcus do you know the servers we have? > I will check with Damien. Marcus -- Marcus Denker -- http://www.marcusdenker.de INRIA Lille -- Nord Europe. Team RMoD.

Jan. 6, 2010

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

by StÃ©phane Ducasse

Since Pharo 1.1 is already faster and 1.0 and will continue to improve on that level. I'm curious to see if how it helps for iphone Stef On Jan 6, 2010, at 3:35 AM, John M McIntosh wrote: > 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 > =========================================================================== > > > > > _______________________________________________ > seaside mailing list > seaside(a)lists.squeakfoundation.org > http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/seaside >

Jan. 6, 2010

Re: [Pharo-project] Interim build server

by StÃ©phane Ducasse

mike I will ask in my team if our infrastructure can be used. Damien, marcus do you know the servers we have? Stef On Jan 5, 2010, at 10:27 PM, Michael Roberts wrote: > Hi, following on from the timely Hudson post ;-) I too have been > working on continuous integration. I am more interested in identifying > & integrating the various bits of plumbing first rather than the build > solution itself. I figured the infrastructure needed to be understood > first, and there could be value in such an interim solution > > To this end I have: > -written a simple image builder that updates the image in place. > -running remotely on a Linux host I have borrowed access > -building PharoCore 1.1 from #11110 onwards > -started to publish images at http://pharo.gforge.inria.fr/experimental/ > > remaining is to rename the core images to unstable and then look at > running some tests. This has exposed various issues, mainly image > timeout caused by the various dialogs that can popup when filing in > code. > > so > 1) if anyone would like to test the integrity of these experimental > auto-build images, please do > 2) discuss if something in this namespace > http://pharo.gforge.inria.fr/<> is suitable for automatic publishing > - i am not sure how you automatically create gforge "releases" but > for core images perhaps this is not needed > 3) find a real server we can run this on, (if this is considered > worthwhile). My requirements are Linux + daemontools + vnc server > - i can host my solution for a while, we need something strategic > > then once we have a server I'm happy to look at Hudson or whatever we > consider the right tool for doing this. I have also been playing with > Mason and sent some feedback to Colin. Like i say, for me the real > issues are running a Pharo image completely automated. > > Cheers, > Mike > > _______________________________________________ > 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 Levente Uzonyi

On Tue, 5 Jan 2010, John Toohey wrote: > Yes, I think that would do it. What class is #allPairsDo: defined? It's not defined. Add it to Collection as an extension of your package. Here's Eliot's version: allPairsDo: aBinaryBlock Â Â Â self do: [:first| self do: [:second| aBinaryBlock value: first value: second]] Levente > > 2010/1/5 Eliot Miranda <eliot.miranda(a)gmail.com> > >> >> >> 2010/1/5 John Toohey <jt(a)parspro.com> >> >>> Yep, the four scores would be 1 point conversion, 2 point conversion or a >>> safety, 3 point field goal, and a 6 point touchdown. Although the 1 point >>> can only come after a 6 point touchdown, so any score with just a 1 point >>> would not be possible, but in theory, you could have 2-2, 4-4 etc. >> >> >> So that has to be #(0), (2 to: limit) allPairsDo: right? Since 2 is the >> lowest score, 3 the next, 4 = 2 + 2, 5 = 3 + 2, right? >> >> >>> >>> 2010/1/5 Eliot Miranda <eliot.miranda(a)gmail.com> >>> >>> >>>> >>>> 2010/1/5 John Toohey <jt(a)parspro.com> >>>> >>>> :-) >>>>> >>>>> 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. >>>>> >>>> >>>> Since the increments include 1 this is equivalent to (0 to: max) >>>> allPairsDo: ... i.e. it is possible for a team to continue to score a >>>> single point, therefore the possible pairs of scores are all the pairs from >>>> 0 to N. >>>> >>>> But isn't American Football more complex? an't you only score 1 after >>>> scoring a touchdown? What are the scoring rules? In any case your numbers >>>> are so small that you can use brute force and enumerate all possible >>>> combinations, filtering totals that exceed your limit. >>>> >>>> >>>>> >>>>> 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 >>>>> >>>>> >>>>> >>>>> _______________________________________________ >>>>> Pharo-project mailing list >>>>> Pharo-project(a)lists.gforge.inria.fr >>>>> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >>>>> >>>> >>>> >>>> _______________________________________________ >>>> 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 >>> >> >> >> _______________________________________________ >> 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 John Toohey

Yes, I think that would do it. What class is #allPairsDo: defined? 2010/1/5 Eliot Miranda <eliot.miranda(a)gmail.com> > > > 2010/1/5 John Toohey <jt(a)parspro.com> > >> Yep, the four scores would be 1 point conversion, 2 point conversion or a >> safety, 3 point field goal, and a 6 point touchdown. Although the 1 point >> can only come after a 6 point touchdown, so any score with just a 1 point >> would not be possible, but in theory, you could have 2-2, 4-4 etc. > > > So that has to be #(0), (2 to: limit) allPairsDo: right? Since 2 is the > lowest score, 3 the next, 4 = 2 + 2, 5 = 3 + 2, right? > > >> >> 2010/1/5 Eliot Miranda <eliot.miranda(a)gmail.com> >> >> >>> >>> 2010/1/5 John Toohey <jt(a)parspro.com> >>> >>> :-) >>>> >>>> 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. >>>> >>> >>> Since the increments include 1 this is equivalent to (0 to: max) >>> allPairsDo: ... i.e. it is possible for a team to continue to score a >>> single point, therefore the possible pairs of scores are all the pairs from >>> 0 to N. >>> >>> But isn't American Football more complex? an't you only score 1 after >>> scoring a touchdown? What are the scoring rules? In any case your numbers >>> are so small that you can use brute force and enumerate all possible >>> combinations, filtering totals that exceed your limit. >>> >>> >>>> >>>> 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 >>>> >>>> >>>> >>>> _______________________________________________ >>>> Pharo-project mailing list >>>> Pharo-project(a)lists.gforge.inria.fr >>>> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >>>> >>> >>> >>> _______________________________________________ >>> 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 >> > > > _______________________________________________ > 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 David T. Lewis

On Tue, Jan 05, 2010 at 06:50:51PM -0800, Eliot Miranda wrote: > > But isn't American Football more complex? an't you only score 1 after > scoring a touchdown? What are the scoring rules? In any case your numbers > are so small that you can use brute force and enumerate all possible > combinations, filtering totals that exceed your limit. Yes, brute force is acceptable in American football.

Jan. 6, 2010

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

by Eliot Miranda

2010/1/5 John Toohey <jt(a)parspro.com> > Yep, the four scores would be 1 point conversion, 2 point conversion or a > safety, 3 point field goal, and a 6 point touchdown. Although the 1 point > can only come after a 6 point touchdown, so any score with just a 1 point > would not be possible, but in theory, you could have 2-2, 4-4 etc. So that has to be #(0), (2 to: limit) allPairsDo: right? Since 2 is the lowest score, 3 the next, 4 = 2 + 2, 5 = 3 + 2, right? > > 2010/1/5 Eliot Miranda <eliot.miranda(a)gmail.com> > > >> >> 2010/1/5 John Toohey <jt(a)parspro.com> >> >> :-) >>> >>> 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. >>> >> >> Since the increments include 1 this is equivalent to (0 to: max) >> allPairsDo: ... i.e. it is possible for a team to continue to score a >> single point, therefore the possible pairs of scores are all the pairs from >> 0 to N. >> >> But isn't American Football more complex? an't you only score 1 after >> scoring a touchdown? What are the scoring rules? In any case your numbers >> are so small that you can use brute force and enumerate all possible >> combinations, filtering totals that exceed your limit. >> >> >>> >>> 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 >>> >>> >>> >>> _______________________________________________ >>> Pharo-project mailing list >>> Pharo-project(a)lists.gforge.inria.fr >>> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >>> >> >> >> _______________________________________________ >> 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 John Toohey

Yep, the four scores would be 1 point conversion, 2 point conversion or a safety, 3 point field goal, and a 6 point touchdown. Although the 1 point can only come after a 6 point touchdown, so any score with just a 1 point would not be possible, but in theory, you could have 2-2, 4-4 etc. 2010/1/5 Eliot Miranda <eliot.miranda(a)gmail.com> > > > 2010/1/5 John Toohey <jt(a)parspro.com> > > :-) >> >> 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. >> > > Since the increments include 1 this is equivalent to (0 to: max) > allPairsDo: ... i.e. it is possible for a team to continue to score a > single point, therefore the possible pairs of scores are all the pairs from > 0 to N. > > But isn't American Football more complex? an't you only score 1 after > scoring a touchdown? What are the scoring rules? In any case your numbers > are so small that you can use brute force and enumerate all possible > combinations, filtering totals that exceed your limit. > > >> >> 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 >> >> >> >> _______________________________________________ >> Pharo-project mailing list >> Pharo-project(a)lists.gforge.inria.fr >> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >> > > > _______________________________________________ > 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

2010/1/5 John Toohey <jt(a)parspro.com> > :-) > > 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. > Since the increments include 1 this is equivalent to (0 to: max) allPairsDo: ... i.e. it is possible for a team to continue to score a single point, therefore the possible pairs of scores are all the pairs from 0 to N. But isn't American Football more complex? an't you only score 1 after scoring a touchdown? What are the scoring rules? In any case your numbers are so small that you can use brute force and enumerate all possible combinations, filtering totals that exceed your limit. > > 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 > > > > _______________________________________________ > 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 John Toohey

I guess its just something like this :- |c| c := #(1 2 3 6 7 2 4 6 12 14 3 6 9 18 21 4 8 12 24 28 5 10 15 32 35). c do: [:x | c do: [:y | Transcript show: '('; show: x; show: '-'; show: y;show:')']]. On Tue, Jan 5, 2010 at 21:34, John Toohey <jt(a)parspro.com> wrote: > :-) > > 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 > > > -- -JT

Jan. 6, 2010