May 2016 - Pharo-users - lists.pharo.org

Re: [Pharo-users] An Idea for a minimal self documented begineer friendly pharo image

by Dimitris Chloupis

Well technically the python part works fine, BUT I also always wanted it to be friendly to begineers . So nope , its same project. And you are correct its still focused in coding 3d graphics but I came to realisation that if I want some people to use it, obviously i dont expect the massive majority to give up the comforts of python but for those that are curious I have to provide an enviroment thats is even easier to code in than python is currently for Blender. My goal is to provide a development enviroment for Blender addons that is simple, and easy to use and learn. So providing a minimal pharo image that is self documented has always being a dream for Ephestos. By the way whats the news on the matter of modular pharo image ? Is there any work done to provide a minimal pharo image ? I would hate to replicate what is already done. On Tue, May 24, 2016 at 3:59 PM Ben Coman <btc(a)openinworld.com> wrote: > On Tue, May 24, 2016 at 7:01 PM, Dimitris Chloupis > <kilon.alios(a)gmail.com> wrote: > > So I was reading the complains from Sven and got Inspiration from Torsten > > Pharo image and CUIs and made me wonder what if we had an image which has > > the least amount of libraries and every library inside it is full > commented > > in class, package and method and even has tutorial using inside help > tool. > > > > So I think I will give this project a try. I know there is a plan to make > > pharo image more modular, but modularity does not equal minimalism , > > simplicity and ease of use. > > > > I think I will follow the CUIs example and do the development via Github. > > > > But I am open to ideas and suggestions. > > > > My intention is to remove the excess fat, to make Pharo prettier (improve > > theme support and make available several themes ) and to have everything > > commented and self documented. > > > > Obviously this will be a long term project and in no way a walk in the > park > > but I was looking for a nice project to name "Ephestos" :D seem as good > as > > any > > Did this project not pane out?... > > https://pharoweekly.wordpress.com/2014/07/16/ephestos-using-and-coding-blen… > > Seems you're quite attached to that name :) > but is there a minor chance of confusion? > > cheers -ben > >

May 24, 2016

Re: [Pharo-users] An Idea for a minimal self documented begineer friendly pharo image

by Ben Coman

On Tue, May 24, 2016 at 7:01 PM, Dimitris Chloupis <kilon.alios(a)gmail.com> wrote: > So I was reading the complains from Sven and got Inspiration from Torsten > Pharo image and CUIs and made me wonder what if we had an image which has > the least amount of libraries and every library inside it is full commented > in class, package and method and even has tutorial using inside help tool. > > So I think I will give this project a try. I know there is a plan to make > pharo image more modular, but modularity does not equal minimalism , > simplicity and ease of use. > > I think I will follow the CUIs example and do the development via Github. > > But I am open to ideas and suggestions. > > My intention is to remove the excess fat, to make Pharo prettier (improve > theme support and make available several themes ) and to have everything > commented and self documented. > > Obviously this will be a long term project and in no way a walk in the park > but I was looking for a nice project to name "Ephestos" :D seem as good as > any Did this project not pane out?... https://pharoweekly.wordpress.com/2014/07/16/ephestos-using-and-coding-blen… Seems you're quite attached to that name :) but is there a minor chance of confusion? cheers -ben

May 24, 2016

Re: [Pharo-users] [Article] Speeding up factorial computation by changing the order of multiplications

by Thierry Goubier

2016-05-24 11:03 GMT+02:00 Sven Van Caekenberghe <sven(a)stfx.eu>: > > > On 24 May 2016, at 10:55, Thierry Goubier <thierry.goubier(a)gmail.com> > wrote: > > > > Hi Sven. > > > > Using '((self + upper) / 2 ) truncated' seems to be a little bit faster > than 'self + upper bitshift: -1'. > > Is it ? > Yes, just not by much and it avoids explaining that we use bitshift: there because n << 1 is usually much faster in C with a lousy compiler on a micro-controller. > > Even so, you probably agree that that calculation involving the bounds > that are not large integers is totally irrelevant in the light of the heavy > multiplications of large integers with thousands of digits, no ? > Then there is no reason to use a cryptic optimisation that doesn't optimise anything, no? > > That is why I also said that the recursion cost is (probably) acceptable. > > Anyway, if you want to freak out, go read the Fast Factorial Functions > website mentioned at the end > > http://www.luschny.de/math/factorial/FastFactorialFunctions.htm > > It is totally humbling (for me anyway) > No. High performance versions of numerical/signal/image/video processing codes are so complex usually for performance reasons that such a list is not surprising. The cleverness of some of the solutions are humbling, yes. To be able to make such a difference as you did with a few lines, however, is significant. Because it makes it easily integrated. Thierry > > > Thierry > > > > > > > > 2016-05-24 9:57 GMT+02:00 Sven Van Caekenberghe <sven(a)stfx.eu>: > > I just published a short, introduction level article, > > > > Speeding up factorial computation by changing the order of > multiplications. > > > > This is a story about a small, seemingly innocent code change that > speeds up a very simple computation. It is pretty magical and serves as an > example of how things are not always what they seem. > > > > > https://medium.com/concerning-pharo/speeding-up-factorial-computation-by-ch… > > > > Enjoy, > > > > Sven > > > > -- > > Sven Van Caekenberghe > > Proudly supporting Pharo > > http://pharo.org > > http://association.pharo.org > > http://consortium.pharo.org > > > > > > > > > > > > > > >

May 24, 2016

An Idea for a minimal self documented begineer friendly pharo image

by Dimitris Chloupis

So I was reading the complains from Sven and got Inspiration from Torsten Pharo image and CUIs and made me wonder what if we had an image which has the least amount of libraries and every library inside it is full commented in class, package and method and even has tutorial using inside help tool. So I think I will give this project a try. I know there is a plan to make pharo image more modular, but modularity does not equal minimalism , simplicity and ease of use. I think I will follow the CUIs example and do the development via Github. But I am open to ideas and suggestions. My intention is to remove the excess fat, to make Pharo prettier (improve theme support and make available several themes ) and to have everything commented and self documented. Obviously this will be a long term project and in no way a walk in the park but I was looking for a nice project to name "Ephestos" :D seem as good as any

May 24, 2016

Re: [Pharo-users] [Article] Speeding up factorial computation by changing the order of multiplications

by Sven Van Caekenberghe

> On 24 May 2016, at 10:55, Thierry Goubier <thierry.goubier(a)gmail.com> wrote: > > Hi Sven. > > Using '((self + upper) / 2 ) truncated' seems to be a little bit faster than 'self + upper bitshift: -1'. Is it ? Even so, you probably agree that that calculation involving the bounds that are not large integers is totally irrelevant in the light of the heavy multiplications of large integers with thousands of digits, no ? That is why I also said that the recursion cost is (probably) acceptable. Anyway, if you want to freak out, go read the Fast Factorial Functions website mentioned at the end http://www.luschny.de/math/factorial/FastFactorialFunctions.htm It is totally humbling (for me anyway) > Thierry > > > > 2016-05-24 9:57 GMT+02:00 Sven Van Caekenberghe <sven(a)stfx.eu>: > I just published a short, introduction level article, > > Speeding up factorial computation by changing the order of multiplications. > > This is a story about a small, seemingly innocent code change that speeds up a very simple computation. It is pretty magical and serves as an example of how things are not always what they seem. > > https://medium.com/concerning-pharo/speeding-up-factorial-computation-by-ch… > > Enjoy, > > Sven > > -- > Sven Van Caekenberghe > Proudly supporting Pharo > http://pharo.org > http://association.pharo.org > http://consortium.pharo.org > > > > > >

May 24, 2016

Re: [Pharo-users] [Article] Speeding up factorial computation by changing the order of multiplications

by Sven Van Caekenberghe

> On 24 May 2016, at 10:21, Serge Stinckwich <serge.stinckwich(a)gmail.com> wrote: > > Very nice article Sven ! Thanks, but it is just intro level (which is important too, of course). > Can you contribute your code to the PolyMath project under the MIT > Licence (and maybe some tests) ? It is only one method. You can copy it over if you want. I am not 100% happy with the selector name #productTo: either. And there should probably be some error checking in a facade method before going into the loop, like self assert: upper isInteger. self assert: (self between: 1 and: upper). Have you seen the Fast Factorial Functions website mentioned at the end ? http://www.luschny.de/math/factorial/FastFactorialFunctions.htm If I see that, I can only be very humble about the implementation in the article (which was based on some very old Lisp code that I had lying around - I did not come up with this myself). Sven > Thank you. > > On Tue, May 24, 2016 at 8:57 AM, Sven Van Caekenberghe <sven(a)stfx.eu> wrote: >> I just published a short, introduction level article, >> >> Speeding up factorial computation by changing the order of multiplications. >> >> This is a story about a small, seemingly innocent code change that speeds up a very simple computation. It is pretty magical and serves as an example of how things are not always what they seem. >> >> https://medium.com/concerning-pharo/speeding-up-factorial-computation-by-ch… >> >> Enjoy, >> >> Sven >> >> -- >> Sven Van Caekenberghe >> Proudly supporting Pharo >> http://pharo.org >> http://association.pharo.org >> http://consortium.pharo.org >> >> >> >> >> > > > > -- > Serge Stinckwich > UCBN & UMI UMMISCO 209 (IRD/UPMC) > Every DSL ends up being Smalltalk > http://www.doesnotunderstand.org/ >

May 24, 2016

Re: [Pharo-users] [Article] Speeding up factorial computation by changing the order of multiplications

by Thierry Goubier

Hi Sven. Using '((self + upper) / 2 ) truncated' seems to be a little bit faster than 'self + upper bitshift: -1'. Thierry 2016-05-24 9:57 GMT+02:00 Sven Van Caekenberghe <sven(a)stfx.eu>: > I just published a short, introduction level article, > > Speeding up factorial computation by changing the order of multiplications. > > This is a story about a small, seemingly innocent code change that speeds > up a very simple computation. It is pretty magical and serves as an example > of how things are not always what they seem. > > > https://medium.com/concerning-pharo/speeding-up-factorial-computation-by-ch… > > Enjoy, > > Sven > > -- > Sven Van Caekenberghe > Proudly supporting Pharo > http://pharo.org > http://association.pharo.org > http://consortium.pharo.org > > > > > >

May 24, 2016

Re: [Pharo-users] [Article] Speeding up factorial computation by changing the order of multiplications

by Serge Stinckwich

Very nice article Sven ! Can you contribute your code to the PolyMath project under the MIT Licence (and maybe some tests) ? Thank you. On Tue, May 24, 2016 at 8:57 AM, Sven Van Caekenberghe <sven(a)stfx.eu> wrote: > I just published a short, introduction level article, > > Speeding up factorial computation by changing the order of multiplications. > > This is a story about a small, seemingly innocent code change that speeds up a very simple computation. It is pretty magical and serves as an example of how things are not always what they seem. > > https://medium.com/concerning-pharo/speeding-up-factorial-computation-by-ch… > > Enjoy, > > Sven > > -- > Sven Van Caekenberghe > Proudly supporting Pharo > http://pharo.org > http://association.pharo.org > http://consortium.pharo.org > > > > > -- Serge Stinckwich UCBN & UMI UMMISCO 209 (IRD/UPMC) Every DSL ends up being Smalltalk http://www.doesnotunderstand.org/

May 24, 2016

[Article] Speeding up factorial computation by changing the order of multiplications

by Sven Van Caekenberghe

I just published a short, introduction level article, Speeding up factorial computation by changing the order of multiplications. This is a story about a small, seemingly innocent code change that speeds up a very simple computation. It is pretty magical and serves as an example of how things are not always what they seem. https://medium.com/concerning-pharo/speeding-up-factorial-computation-by-ch… Enjoy, Sven -- Sven Van Caekenberghe Proudly supporting Pharo http://pharo.org http://association.pharo.org http://consortium.pharo.org

May 24, 2016

Re: [Pharo-users] New Success Story: Sysmocom: Free Software for Mobile Communication

by Holger Freyther

> On 23 May 2016, at 22:28, Esteban A. Maringolo <emaringolo(a)gmail.com> wrote: > > It is really cool and impressive. > > Is any of the supporting libraries open-source? (like ASN.1) http://smalltalkhub.com/#!/~NorbertHartl/ASN1 The model/ASN1 parser is probably one of the most complete FOSS parser, the library is tied to DER/BER right now and it would be nice if someone adds *PER/JSON/XML encoding/decoding. holger

May 23, 2016