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

Re: [Pharo-project] How I build squeak-vm with FT2Plugin on Linux

by StÃ©phane Ducasse

excellent we are waiting for a living pharobook and this is typically what should go there. Stef On Mar 10, 2010, at 11:24 PM, laurent laffont wrote: > Hi, > > As a memento for me, I've written a tutorial to build the VM on Linux. http://magaloma.blogspot.com/2010/03/how-i-build-squeak-vm-on-archlinux.html > > I also provide the binaries and Pharo image with VMMaker loaded. > > As I'm newbie on building a VM, thanks for additional informations. > > Cheers, > > Laurent Laffont > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project

March 11, 2010

Re: [Pharo-project] Collection >> collectDistinct: ??

by Levente Uzonyi

On Wed, 10 Mar 2010, Randal L. Schwartz wrote: >>>>>> "Randal" == Randal L Schwartz <merlyn(a)stonehenge.com> writes: > > Randal> I can envision collection types where collect: can create something > Randal> that asSet can more easily turn into a set in bulk than adding each > Randal> element individually like this. Keys of dictionaries, but it's hackish. > > In particular, turning an array of 10,000 elements into a set > can start with a particular hashing size, whereas starting with > an empty set and adding 10,000 elements will likely involve rehasing > a number of times. If 10,000 isn't troubling enough, make that > a million. :) > Lets see what we've got (in Squeak): Smalltalk garbageCollect. [ (1 to: 1000000) collect: #yourself as: Set ] timeToRun. "==> 2651." Smalltalk garbageCollect. [ (1 to: 1000000) asSet ] timeToRun. "==> 2522". | s | s := Set new. Smalltalk garbageCollect. [ 1 to: 1000000 do: [ :each | s add: each ] ] timeToRun. "==> 1192" | s | s := Set new: 1000000. Smalltalk garbageCollect. [ 1 to: 1000000 do: [ :each | s add: each ] ] timeToRun. "==> 472" Note that adding numbers from 1 to n has the lowest cost for addition, since there will be no hash collisions at all. So try it with randomized data: a := (1 to: 1000000) asArray shuffled. Smalltalk garbageCollect. [ a collect: #yourself as: Set ] timeToRun. "==> 4143" Smalltalk garbageCollect. [ a asSet ] timeToRun. "==> 3995". | s | s := Set new. Smalltalk garbageCollect. [ s addAll: a ] timeToRun. "==> 157304 oops weak hashes". | s | s := Set new: 1000000. Smalltalk garbageCollect. [ s addAll: a ] timeToRun. "==> 636". With better hashes: a := Set new: 1000000. [ a size < 1000000 ] whileTrue: [ a add: SmallInteger maxVal atRandom ]. a := a asArray. Smalltalk garbageCollect. [ a collect: #yourself as: Set ] timeToRun. "==> 3895" Smalltalk garbageCollect. [ a asSet ] timeToRun. "==> 3777". | s | s := Set new. Smalltalk garbageCollect. [ s addAll: a ] timeToRun. "==> 4729 much better". | s | s := Set new: 1000000. Smalltalk garbageCollect. [ s addAll: a ] timeToRun. "==> 774". Conclusions: - #collect:as: is (almost) as fast as #asSet - better hashes can make a huge difference - message sends cost a lot compared to bytecodes - if you can guess the size of your collection, do it (applies for all growing collections and collection streaming) - only optimize if you have to in your own code Levente > -- > 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 >

March 11, 2010

Re: [Pharo-project] Collection >> collectDistinct: ??

by merlyn＠stonehenge.com

>>>>> "Randal" == Randal L Schwartz <merlyn(a)stonehenge.com> writes: Randal> I can envision collection types where collect: can create something Randal> that asSet can more easily turn into a set in bulk than adding each Randal> element individually like this. In particular, turning an array of 10,000 elements into a set can start with a particular hashing size, whereas starting with an empty set and adding 10,000 elements will likely involve rehasing a number of times. If 10,000 isn't troubling enough, make that a million. :) -- 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

March 11, 2010

Re: [Pharo-project] Collection >> collectDistinct: ??

by merlyn＠stonehenge.com

>>>>> "Mariano" == Mariano Martinez Peck <marianopeck(a)gmail.com> writes: Mariano> Is there a better way ? Do you think it make sense to put this in Pharo ? I can envision collection types where collect: can create something that asSet can more easily turn into a set in bulk than adding each element individually like this. Have you already benchmarked your verbose code against the "simple" code under varying sizes? -- 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

March 11, 2010

Re: [Pharo-project] Collection >> collectDistinct: ??

by Nicolas Cellier

2010/3/11 Igor Stasenko <siguctua(a)gmail.com>: > On 10 March 2010 15:07, Nicolas Cellier > <nicolas.cellier.aka.nice(a)gmail.com> wrote: >> self collect: aBlock as: Set >> > > One more time, i found this very beatiful and useful extension to > Collection protocol. > And i am proud being a witness when this thing is born! :) > Yes, I remember saying I was not convinced some times ago... http://lists.squeakfoundation.org/pipermail/squeak-dev/2008-June/129457.html Being able to change own opinion is a good thing ! Nicolas >> 2010/3/10 Mariano Martinez Peck <marianopeck(a)gmail.com>: >>> Hi. I was needing something like the SQL select distinct, that doesn't take >>> into account repeated objects. I didn't found anything useful in Collection, >>> and thus, I have implemented this: >>> >>> Collection >> collectDistinct: aBlock >>> >>> >>> collectDistinct: aBlock >>> Â Â Â "Evaluate aBlock with each of the receiver's elements as the argument. >>> Â Â Â Collect the resulting values into a Set, thus repeated objects will not >>> be present. >>> Â Â Â Answer the new collection." >>> >>> Â Â Â | newSet | >>> Â Â Â newSet := self species new asSet. >>> Â Â Â self do: [:each | newSet add: (aBlock value: each)]. >>> Â Â Â ^ newSet >>> >>> >>> Is there a better way ?Â Â Do you think it make sense to put this in Pharo ? >>> >>> Cheers >>> >>> Mariano >>> >>> _______________________________________________ >>> 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 >> > > > > -- > Best regards, > Igor Stasenko AKA sig. > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project

March 11, 2010

Re: [Pharo-project] MIT strikes back (was Re: [smalltalk-research] Re: [Esug-list] Google Summer Of Code 2010 news!!!)

by Nicolas Cellier

2010/3/10 StÃ©phane Ducasse <stephane.ducasse(a)inria.fr>: >> What the starting point is will depend on to what extent Cog has >>>> been open sourced Â (Teleplace may choose to open source >>>> single-threaded Cog initially, keeping back the threaded FFI for >>>> a while, it may not open source Cog at all; we'll see :) ). >>> May be I the only one to notice the:) Â which I have problem to >>> understand since for me it announces that COG may not be >>> open-source. >> >> Isn't this what you wanted to allow companies to do, when you chose the >> MIT license? Â I don't understand, why should you care? We shouldn't. Well, except if previous annoucements strongly suggested this would be the case... >> >> I see some irony... > Not me. Freedom of choice is a political attitude. I understand GPL goal but I > do not adhere to it. I respect people pushing it but not in my way. I'm not sure > that we should debate that here but we do not have the single answer. > > Not sure the goals differ much, but indeed these are two radically different strategies. The question is: would COG have ever started under a GPL derivative? Who knows? Since it did not happen, current choice is between an hypothetical something MIT or nothing... Bah, at least we already get a closure VM in Squeak. Nicolas > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >

March 11, 2010

Re: [Pharo-project] Collection >> collectDistinct: ??

by Igor Stasenko

On 10 March 2010 15:07, Nicolas Cellier <nicolas.cellier.aka.nice(a)gmail.com> wrote: > self collect: aBlock as: Set > One more time, i found this very beatiful and useful extension to Collection protocol. And i am proud being a witness when this thing is born! :) > 2010/3/10 Mariano Martinez Peck <marianopeck(a)gmail.com>: >> Hi. I was needing something like the SQL select distinct, that doesn't take >> into account repeated objects. I didn't found anything useful in Collection, >> and thus, I have implemented this: >> >> Collection >> collectDistinct: aBlock >> >> >> collectDistinct: aBlock >> Â Â Â "Evaluate aBlock with each of the receiver's elements as the argument. >> Â Â Â Collect the resulting values into a Set, thus repeated objects will not >> be present. >> Â Â Â Answer the new collection." >> >> Â Â Â | newSet | >> Â Â Â newSet := self species new asSet. >> Â Â Â self do: [:each | newSet add: (aBlock value: each)]. >> Â Â Â ^ newSet >> >> >> Is there a better way ?Â Â Do you think it make sense to put this in Pharo ? >> >> Cheers >> >> Mariano >> >> _______________________________________________ >> 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 > -- Best regards, Igor Stasenko AKA sig.

March 11, 2010

[Pharo-project] ESUG GSoC english speakers help needed!!!

by Mariano Martinez Peck

Hi folks. Neither me or Janko (GSoC admins) have English as native language. Thus, there are probably some mistakes in the application text for the GSoC. The link is http://gsoc2010.esug.org/application.html If you can review them and send them to me by mail I would really appreciate it. Thanks in advance. Mariano

March 11, 2010

[Pharo-project] [Pharo Project] Installer / Installer Monticello

by Norberto Manzanos

I found some bugs in Installer and InstallerMonticello packages. Is this the properly forum to report them? If not, sorry for bother you. InstallerMonticello >>mcDetectFileBlock: The detection is made with #beginsWith:, but if you have two different packages which begins with the same string, it would detect a wrong package. Reeplaced by #copyUpToLast: $- InstallerMonticello >>mcSortFileBlock If the file has no number (it could happen, yes, and it happened to me with a file create by MonticelloConfiguration, which I didn't remember it existed) the files collection is sorted wrongly, since #asInteger will answer nil. Replaced #asInteger by #asNumber I made other modifications, but I'm not sure they are part of the developing plan of the package. Errors are logued only with an output on the Transcript, so it's very difficult to separate errors form manu other messages shown there. I add a #logErr: method which adds the string to a new instance variable in. I attached the package.

March 10, 2010

Re: [Pharo-project] [Seaside] Google Summer Of Code 2010 news!!!

by Mariano Martinez Peck

Excellent. I love it. But please, move to the thread "Smalltalk app demo for GSoC" It is getting complicated to follow all projects in one single thread and cross maling-list. Cheers Mariano On Wed, Mar 10, 2010 at 10:56 PM, Stan Shepherd <stan.shepherd414(a)gmail.com>wrote: > > > StÃ©phane Ducasse wrote: > > > > > > On Mar 10, 2010, at 3:08 PM, stan shepherd wrote: > > > >> I know the deadline approaches, however- how does the community feel > >> about a project to implement a real demonstration system (along the > >> lines of defunct Sushi store)? > >> ... > >> > >> Do people think it's useful for me to develop a proposal? > > > > yes! > >> > >> Cheers, ..Stan > >> > >> PS I realise that picking a component as part of the stack is fraught > >> with possibilities of offending supporters of an alternative project. > >> But more Smalltalkers overall means more potential users of each > >> project > >> > > > > Hi, I had a first pass at a proposal. Feel free to improve upon it. The > major question is whether we should bite the bullet and nominate what > technologies we would use to build the reference implementation. It would > also make it easier to nominate the mentors, if they are to be experts in > the particular technologies. I think we had some volunteers previously for > Seaside/Grease related projects? > > > Smalltalk is enjoying a resurgence in its development, with a great deal of > development going into building out its abilities to underpin a web > framework. > Auctomatic was a recent startup built in Smalltalk, that received seed > funding from Y-Combinator and was acquired by Live Current Media. People > who > build in Smalltalk know that it lends itself to fast development, and that > web aplications can be upgraded on the fly, without the need to take down > the server. > > The goal of this project is to spread the use of Smalltalk to a wider > audience. The scope is to produce a reference implementation of a Smalltalk > stack, in the form of a working e-commerce site. The participants will > select and integrate the preferred technologies, and build on existing > demonstration systems. The result will make it much easier for potential > new > Smalltalkers to evaluate the technology, by seeing a fully working example, > and then to get started on their own application by downloading that same > example as a working template. > > The Smalltalk community, and in particular the open source Smalltalk > community, will benefit as follows: > improved quality and documentation of the technology stack at its > interfaces > Availability of a one stop solution as the basis for new projects > better ability to attract new participants and projects to Smalltalk. > > The student participant will gain experience of implementation of a real > world Smalltalk project, and of the practicalities of e-commerce > development. The student would be well positioned to participate in a > startup using the technology stack. > > > Cheers, ...Stan > > > -- > View this message in context: > http://n4.nabble.com/Google-Summer-Of-Code-2010-news-tp1582769p1588111.html > Sent from the Pharo Smalltalk mailing list archive at Nabble.com. > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >

March 10, 2010