- Pharo-dev - lists.pharo.org

Re: [Pharo-dev] MethodClassifier pragmas?

by stepharo

stefan if you want to really help for method classifier look at http://smalltalkhub.com/#!/~StephaneDucasse/AutomaticMethodCategorizer I think that it is missing one day of work concentrated. Stef Le 22/10/15 12:16, Stephan Eggermont a Ã©crit : > I've committed a version of MethodClassifier that can classify based > on pragmas. I've only added <example>->#examples > Which ones should be added? > > Stephan > > >

Oct. 23, 2015

Re: [Pharo-dev] powerSet

by stepharo

> Hi, > > Want would be the uses of this method? Apparently this is something really common on sets, you get all the subparts combinations. Stef

Oct. 23, 2015

Re: [Pharo-dev] powerSet

by stepharo

> Hi, > > I propose a simpler implementation: > 4 in: [ :e | (1 to: e) combinations ] ;) I'm do not think that my son is allowed to use combination in python too. did you check the implementation of combinations :)? Stef > > Vincent > > Le 2015-10-22 23:25, Ferlicot D. Cyril a Ã©crit : >> Le 22/10/2015 22:58, stepharo a Ã©crit : >>> Hi >>> >>> I was programming an exercise with one of my son (well in Python.... >>> arghhhhhh) >>> and I end it up doing it in Pharo (I'm save now). >>> >>> The idea was to write one function that computes the powerset >>> >>> powerset(4) >>> = a Set(a Set(1) a Set(1 2) a Set(3) a Set(2) a Set(1 3) a Set(2 3) >>> a Set(1 2 3) a Set(4) a Set(1 4) a Set(2 4) a Set(1 2 4) a Set(3 4) a >>> Set(1 3 4) a Set(2 3 4) a Set(1 2 3 4)) >>> >>> I did it without thinking too much in fact >>> >>> | s n ps | >>> ps := Set new. >>> >>> 1 to: ((2 raisedTo: 4) -1) >>> do: [ :i | >>> s := Set new. >>> n := 0. >>> 1 to: 4 do: [ :b | >>> n := n + 1. >>> ((i bitAt: b) = 1 ) >>> ifTrue: [ s add: n]. >>> ps add: s ]]. >>> ps >>> >>> but I wonder if we want to add it to our lib. >>> >>> Stef >>> >> >> Hi, >> >> Want would be the uses of this method? > > >

Oct. 23, 2015

Re: [Pharo-dev] Reading validation reports

by Marcus Denker

> On 22 Oct 2015, at 19:45, Stephan Eggermont <stephan(a)stack.nl> wrote: > > At the moment, most of the isues I provide a slice for time out in validation. What is exactly tested in the validation process? It runs twice the tests (first to get false positives) and some Lint rules. > Sometimes nothing is visible in the report, sometimes there are lots of deprecation warnings and other problems that look unrelated to the slice. When should they be ignored? > Yes, this started last week and honestly I have not even a clue what is happening. To me it looks that it might even be caused by the underlying virtual linux machines? The deprecated we should fixâ¦ Marcus

Oct. 23, 2015

Re: [Pharo-dev] powerSet

by vincent.blondeau＠polytech-lille.net

Hi, I propose a simpler implementation: 4 in: [ :e | (1 to: e) combinations ] Vincent Le 2015-10-22 23:25, Ferlicot D. Cyril a Ã©critÂ : > Le 22/10/2015 22:58, stepharo a Ã©crit : >> Hi >> >> I was programming an exercise with one of my son (well in Python.... >> arghhhhhh) >> and I end it up doing it in Pharo (I'm save now). >> >> The idea was to write one function that computes the powerset >> >> powerset(4) >> = a Set(a Set(1) a Set(1 2) a Set(3) a Set(2) a Set(1 3) a Set(2 >> 3) >> a Set(1 2 3) a Set(4) a Set(1 4) a Set(2 4) a Set(1 2 4) a Set(3 4) >> a >> Set(1 3 4) a Set(2 3 4) a Set(1 2 3 4)) >> >> I did it without thinking too much in fact >> >> | s n ps | >> ps := Set new. >> >> 1 to: ((2 raisedTo: 4) -1) >> do: [ :i | >> s := Set new. >> n := 0. >> 1 to: 4 do: [ :b | >> n := n + 1. >> ((i bitAt: b) = 1 ) >> ifTrue: [ s add: n]. >> ps add: s ]]. >> ps >> >> but I wonder if we want to add it to our lib. >> >> Stef >> > > Hi, > > Want would be the uses of this method?

Oct. 22, 2015

Re: [Pharo-dev] powerSet

by Ferlicot D. Cyril

Le 22/10/2015 22:58, stepharo a Ã©crit : > Hi > > I was programming an exercise with one of my son (well in Python.... > arghhhhhh) > and I end it up doing it in Pharo (I'm save now). > > The idea was to write one function that computes the powerset > > powerset(4) > = a Set(a Set(1) a Set(1 2) a Set(3) a Set(2) a Set(1 3) a Set(2 3) > a Set(1 2 3) a Set(4) a Set(1 4) a Set(2 4) a Set(1 2 4) a Set(3 4) a > Set(1 3 4) a Set(2 3 4) a Set(1 2 3 4)) > > I did it without thinking too much in fact > > | s n ps | > ps := Set new. > > 1 to: ((2 raisedTo: 4) -1) > do: [ :i | > s := Set new. > n := 0. > 1 to: 4 do: [ :b | > n := n + 1. > ((i bitAt: b) = 1 ) > ifTrue: [ s add: n]. > ps add: s ]]. > ps > > but I wonder if we want to add it to our lib. > > Stef > Hi, Want would be the uses of this method? -- Cyril Ferlicot http://www.synectique.eu 165 Avenue Bretagne Lille 59000 France

Oct. 22, 2015

Re: [Pharo-dev] [Vm-dev] [squeak-dev] The Trunk: Network-topa.166.mcz

by stepharo

In SciSmalltalk we added some more random generators but people should have a look.... Stef Le 22/10/15 18:21, Nicolas Cellier a Ã©crit : > For these reasons, I often prefer the Marsaglia's KISS > > 2015-10-22 17:57 GMT+02:00 Henrik Johansen > <henrik.s.johansen(a)veloxit.no <mailto:henrik.s.johansen@veloxit.no>>: > > > > On 22 Oct 2015, at 2:49 , Tobias Pape <Das.Linux(a)gmx.de > <mailto:Das.Linux@gmx.de>> wrote: > > > > > > > > On 22.10.2015, at 14:37, David T. Lewis <lewis(a)mail.msen.com > <mailto:lewis@mail.msen.com>> wrote: > > > >> On Thu, Oct 22, 2015 at 06:28:09AM +0000, > commits(a)source.squeak.org <mailto:commits@source.squeak.org> wrote: > >>> Tobias Pape uploaded a new version of Network to project The > Trunk: > >>> http://source.squeak.org/trunk/Network-topa.166.mcz > >>> > >>> ==================== Summary ==================== > >>> > >>> Name: Network-topa.166 > >>> Author: topa > >>> Time: 21 October 2015, 8:26:14.656 pm > >>> UUID: d6d9910f-fa67-4c69-9a89-030c81233e90 > >>> Ancestors: Network-topa.165 > >>> > >>> UUIDGenerator > >>> - Use new Random>>#nextBytes:into:startingAt: (needs > Kernel-ul.960) for even more speed > >>> - Fix UUIDGenerator class>>#initialize to correctly register > at startup > >>> - Do not reset default on startup but rather reseed TheRandom > >>> > >>> Timings improved: '1,190,000 per second. 842 nanoseconds per > run.' (0.25 times slower than primitive version) > >>> > >> > >> This is outstanding. The UUID plugin has long been a source of > problems in > >> the VM, partly due to issues in various Linux distributions. > >> > >> http://bugs.squeak.org/view.php?id=7358 > >> > >> Making the plugin unnecessary is a big improvement. > > > > Thats what I thought. > > Probably we want to present this (Mersenne PRNG + new UUID gen) to > > the Pharo core developers (cc) so that we can just remove the > UUID plugin > > from the VMs (cc vm-dev)? > > > > Best regards > > -Tobias > > In the release version of Squeak 5.0, the Mersenne Twister is > initialized using a single seed restricted to 32bit. > Has this been changed since to use a wider ranged value? > Otherwise, you run into problems with potential collisions from > separate image starts rather too fast for UUID uses... (IMHO) > > Cheers, > Henry > >

Oct. 22, 2015

Re: [Pharo-dev] [squeak-dev] The Trunk: Network-topa.166.mcz

by stepharo

Yes I will add to our immense todo :) Stef Le 22/10/15 19:17, Levente Uzonyi a Ã©crit : > This should be promoted more vigorously. > > Levente > > On Thu, 22 Oct 2015, monty wrote: > >> This gives you threading: >> http://lists.gforge.inria.fr/pipermail/pharo-bugtracker/

Oct. 22, 2015

Re: [Pharo-dev] editing incomplete snippet bring RB DNU and this is annoying.

by stepharo

Ok it was an image of a month or more and now it works! Great feeling. Stef Le 22/10/15 22:37, Nicolai Hess a Ã©crit : > > > 2015-10-22 22:14 GMT+02:00 stepharo <stepharo(a)free.fr > <mailto:stepharo@free.fr>>: > > Hi guys > > the new syntax hilighter is breaking the fun. > > | s > s := Set new. > > try to add the missing | > > > What's the problem ? I can add the missing | > What pharo version do you use? > > > Stef > >

Oct. 22, 2015

powerSet

by stepharo

Hi I was programming an exercise with one of my son (well in Python.... arghhhhhh) and I end it up doing it in Pharo (I'm save now). The idea was to write one function that computes the powerset powerset(4) = a Set(a Set(1) a Set(1 2) a Set(3) a Set(2) a Set(1 3) a Set(2 3) a Set(1 2 3) a Set(4) a Set(1 4) a Set(2 4) a Set(1 2 4) a Set(3 4) a Set(1 3 4) a Set(2 3 4) a Set(1 2 3 4)) I did it without thinking too much in fact | s n ps | ps := Set new. 1 to: ((2 raisedTo: 4) -1) do: [ :i | s := Set new. n := 0. 1 to: 4 do: [ :b | n := n + 1. ((i bitAt: b) = 1 ) ifTrue: [ s add: n]. ps add: s ]]. ps but I wonder if we want to add it to our lib. Stef

Oct. 22, 2015