- Pharo-dev - lists.pharo.org

Re: [Pharo-project] Issue 3957 in pharo: MethodWrappers left method after uninstall

by pharo＠googlecode.com

Comment #2 on issue 3957 by lem...(a)gmail.com: MethodWrappers left method after uninstall http://code.google.com/p/pharo/issues/detail?id=3957 I think that's ok to follow the lookup, because the inherited selectors are part of the behavior of the class, but i think it's a good idea to have a form to restrict that. Anyway, in any of the two cases, after the uninstall process, the class should be clean Greetings, Daniel.

April 5, 2011

Re: [Pharo-project] Remove #class as a Compiler optimization

by Camillo Bruni

On 2011-04-05, at 15:11, Igor Stasenko wrote: > I don't care :) > > What i found that measurements confirms my previous expectation: > the 'slowdown' of removing #class from set of optimized selectors lies > in the range of macro-benchmark deviation. > > And running all tests for 100 times is not fun (it could take half of > the day), and i'm not ready to leave my computer for half of the day > and simply wait till it finish, because if i will do something > else,then it will affect the performance, and measurements will be > even more inaccurate. thats why you run it over night :) (or the day, depending on your sleep rhythm). or you reduce the number of runs to something at least bigger than 1 :D. > On 5 April 2011 14:53, Camillo Bruni <camillo.bruni(a)inria.fr> wrote: >> This is exactly why you have to provide some confidence interval / deviation, otherwise it is hard to make any reasonable conclusion. >> >> run it 100 times and take the average and provide the standard deviation. >> >> I am not a big fan of relying on incomplete benchmarking results: >> >> Please read: http://portal.acm.org/citation.cfm?id=1297033 >> >> http://www.squeaksource.com/p.html provides a basic benchmarking framework under the NBenchmark package. You subclass from PBenchmarkSuite implement a method #benchXXX and run it. >> >> r := PBFloat run: 100. >> r asString >> >> which will give decent results back :). This way it is much easier to make sense out of the numbers. >> >> So here again to remember: >> >> - number of samples >> - average run times >> - standard deviation >> >> If one of these results is missing the benchmark results are incomplete. >> >> best regards, >> camillo >> >> >> >> On 2011-04-05, at 13:56, Igor Stasenko wrote: >> >>> VariableNode initialize. >>> Compiler recompileAll. >>> >>> [ >>> TestCase allSubclasses do: [ :cls| >>> cls isAbstract >>> ifFalse: [cls suite run]]. >>> ] timeToRun >>> >>> 178938 >>> 183963 >>> >>> >>> >>> (ParseNode classVarNamed: 'StdSelectors') removeKey: #class ifAbsent: []. >>> Compiler recompileAll. >>> >>> [ >>> TestCase allSubclasses do: [ :cls| >>> cls isAbstract >>> ifFalse: [cls suite run]]. >>> ] timeToRun >>> >>> 187168 >>> 184992 >>> >>> the deviation is too big to see if its really so big overhead. >>> >>> if you compare worst , you got 187/178 ~ 5% >>> and if you compare the best you got >>> 184/183 ~ 0.5% >>> >>> >>> -- >>> Best regards, >>> Igor Stasenko AKA sig. >>> >> >> >> > > > > -- > Best regards, > Igor Stasenko AKA sig. >

April 5, 2011

[Pharo-project] jtalk fun

by laurent laffont

Go to http://jtalk-project.org/ Open development tools -> Workspace Evaluate: Tetris new appendToJQuery: 'body' asJQuery play. Laurent.

April 5, 2011

[Pharo-project] Issue 3964 in pharo: Enabling double click on PluggableListMorphOfMany

by pharo＠googlecode.com

Status: FixProposed Owner: Benjamin...(a)gmail.com Labels: Nautilus New issue 3964 by Benjamin...(a)gmail.com: Enabling double click on PluggableListMorphOfMany http://code.google.com/p/pharo/issues/detail?id=3964 Just copy and paste 2 lines ... Attachments: EnableDoubleClickOnPluggableListMorphOfMany.1.cs 1.9 KB

April 5, 2011

Re: [Pharo-project] Remove #class as a Compiler optimization

by Igor Stasenko

I don't care :) What i found that measurements confirms my previous expectation: the 'slowdown' of removing #class from set of optimized selectors lies in the range of macro-benchmark deviation. And running all tests for 100 times is not fun (it could take half of the day), and i'm not ready to leave my computer for half of the day and simply wait till it finish, because if i will do something else,then it will affect the performance, and measurements will be even more inaccurate. On 5 April 2011 14:53, Camillo Bruni <camillo.bruni(a)inria.fr> wrote: > This is exactly why you have to provide some confidence interval / deviation, otherwise it is hard to make any reasonable conclusion. > > run it 100 times and take the average and provide the standard deviation. > > I am not a big fan of relying on incomplete benchmarking results: > > Please read: http://portal.acm.org/citation.cfm?id=1297033 > > http://www.squeaksource.com/p.html provides a basic benchmarking framework under the NBenchmark package. You subclass from PBenchmarkSuite implement a method #benchXXX and run it. > > r := PBFloat run: 100. > r asString > > which will give decent results back :). This way it is much easier to make sense out of the numbers. > > So here again to remember: > > - number of samples > - average run times > - standard deviation > > If one of these results is missing the benchmark results are incomplete. > > best regards, > camillo > > > > On 2011-04-05, at 13:56, Igor Stasenko wrote: > >> VariableNode initialize. >> Compiler recompileAll. >> >> [ >> TestCase allSubclasses do: [ :cls| >> Â Â Â Â cls isAbstract >> Â Â Â Â Â Â Â Â ifFalse: [cls suite run]]. >> ] timeToRun >> >> 178938 >> 183963 >> >> >> >> (ParseNode classVarNamed: Â 'StdSelectors') removeKey: #class ifAbsent: []. >> Compiler recompileAll. >> >> [ >> TestCase allSubclasses do: [ :cls| >> Â Â Â Â cls isAbstract >> Â Â Â Â Â Â Â Â ifFalse: [cls suite run]]. >> ] timeToRun >> >> 187168 >> 184992 >> >> the deviation is too big to see if its really so big overhead. >> >> if you compare worst , you got Â 187/178 ~ 5% >> and if you compare the best you got >> 184/183 Â ~ 0.5% >> >> >> -- >> Best regards, >> Igor Stasenko AKA sig. >> > > > -- Best regards, Igor Stasenko AKA sig.

April 5, 2011

Re: [Pharo-project] Issue 3950 in pharo: SequenceableCollection>>#findBinary and friends (wrong exceptionBlock, delegation)

by pharo＠googlecode.com

Comment #3 on issue 3950 by marcus.d...(a)gmail.com: SequenceableCollection>>#findBinary and friends (wrong exceptionBlock, delegation) http://code.google.com/p/pharo/issues/detail?id=3950 Issue 3345 has been merged into this issue.

April 5, 2011

Re: [Pharo-project] Issue 3345 in pharo: findBinary: from Cuis as integrated in Squeak

by pharo＠googlecode.com

Updates: Status: Duplicate Mergedinto: 3950 Comment #1 on issue 3345 by marcus.d...(a)gmail.com: findBinary: from Cuis as integrated in Squeak http://code.google.com/p/pharo/issues/detail?id=3345 Pls Discuss in Issue 3950

April 5, 2011

Re: [Pharo-project] Remove #class as a Compiler optimization

by Camillo Bruni

On 2011-04-05, at 15:02, Nicolas Cellier wrote: > Better than average, take the median NO! thats why you provide the standard deviation... you should not optimize the results prematurely but provide numbers that let you decide on the quality of the benchmarks. what you can do is optimize for systematic errors, like warm up and stuff, but nevertheless you should provide the raw results... read the paper... > Nicolas > > 2011/4/5 Camillo Bruni <camillo.bruni(a)inria.fr>: >> This is exactly why you have to provide some confidence interval / deviation, otherwise it is hard to make any reasonable conclusion. >> >> run it 100 times and take the average and provide the standard deviation. >> >> I am not a big fan of relying on incomplete benchmarking results: >> >> Please read: http://portal.acm.org/citation.cfm?id=1297033 >> >> http://www.squeaksource.com/p.html provides a basic benchmarking framework under the NBenchmark package. You subclass from PBenchmarkSuite implement a method #benchXXX and run it. >> >> r := PBFloat run: 100. >> r asString >> >> which will give decent results back :). This way it is much easier to make sense out of the numbers. >> >> So here again to remember: >> >> - number of samples >> - average run times >> - standard deviation >> >> If one of these results is missing the benchmark results are incomplete. >> >> best regards, >> camillo >> >> >> >> On 2011-04-05, at 13:56, Igor Stasenko wrote: >> >>> VariableNode initialize. >>> Compiler recompileAll. >>> >>> [ >>> TestCase allSubclasses do: [ :cls| >>> cls isAbstract >>> ifFalse: [cls suite run]]. >>> ] timeToRun >>> >>> 178938 >>> 183963 >>> >>> >>> >>> (ParseNode classVarNamed: 'StdSelectors') removeKey: #class ifAbsent: []. >>> Compiler recompileAll. >>> >>> [ >>> TestCase allSubclasses do: [ :cls| >>> cls isAbstract >>> ifFalse: [cls suite run]]. >>> ] timeToRun >>> >>> 187168 >>> 184992 >>> >>> the deviation is too big to see if its really so big overhead. >>> >>> if you compare worst , you got 187/178 ~ 5% >>> and if you compare the best you got >>> 184/183 ~ 0.5% >>> >>> >>> -- >>> Best regards, >>> Igor Stasenko AKA sig. >>> >> >> >> >

April 5, 2011

Re: [Pharo-project] Issue 3942 in pharo: Transcript missing compatibility method ensureCr

by pharo＠googlecode.com

Updates: Status: Closed Comment #2 on issue 3942 by marcus.d...(a)gmail.com: Transcript missing compatibility method ensureCr http://code.google.com/p/pharo/issues/detail?id=3942 in 13132

April 5, 2011

Re: [Pharo-project] Remove #class as a Compiler optimization

by Nicolas Cellier

Better than average, take the median Nicolas 2011/4/5 Camillo Bruni <camillo.bruni(a)inria.fr>: > This is exactly why you have to provide some confidence interval / deviation, otherwise it is hard to make any reasonable conclusion. > > run it 100 times and take the average and provide the standard deviation. > > I am not a big fan of relying on incomplete benchmarking results: > > Please read: http://portal.acm.org/citation.cfm?id=1297033 > > http://www.squeaksource.com/p.html provides a basic benchmarking framework under the NBenchmark package. You subclass from PBenchmarkSuite implement a method #benchXXX and run it. > > r := PBFloat run: 100. > r asString > > which will give decent results back :). This way it is much easier to make sense out of the numbers. > > So here again to remember: > > - number of samples > - average run times > - standard deviation > > If one of these results is missing the benchmark results are incomplete. > > best regards, > camillo > > > > On 2011-04-05, at 13:56, Igor Stasenko wrote: > >> VariableNode initialize. >> Compiler recompileAll. >> >> [ >> TestCase allSubclasses do: [ :cls| >> Â Â Â Â cls isAbstract >> Â Â Â Â Â Â Â Â ifFalse: [cls suite run]]. >> ] timeToRun >> >> 178938 >> 183963 >> >> >> >> (ParseNode classVarNamed: Â 'StdSelectors') removeKey: #class ifAbsent: []. >> Compiler recompileAll. >> >> [ >> TestCase allSubclasses do: [ :cls| >> Â Â Â Â cls isAbstract >> Â Â Â Â Â Â Â Â ifFalse: [cls suite run]]. >> ] timeToRun >> >> 187168 >> 184992 >> >> the deviation is too big to see if its really so big overhead. >> >> if you compare worst , you got Â 187/178 ~ 5% >> and if you compare the best you got >> 184/183 Â ~ 0.5% >> >> >> -- >> Best regards, >> Igor Stasenko AKA sig. >> > > >

April 5, 2011