Le 18 nov. 2014 22:52, "Sven Van Caekenberghe" <[email protected]> a écrit : > > > > On 18 Nov 2014, at 22:28, Andreas Wacknitz <[email protected]> wrote: > > > > > > Am 18.11.14 22:12, schrieb [email protected]: > >> See > >> https://news.ycombinator.com/item?id=8625280 > >> > >> [ (1 to: 100000000) sum ] timeToRun > >> > >> Here we get out of the SmallInteger range... > >> > >> Apart FFI'ing the thing, do we have other options? > >> > >> Phil > > Choose a better algorithm: > > [100000000 * 10000001 / 2] timeToRun > > should beat yours by several orders of magnitude. > > > > Andreas > > Haha, great ! > >
Sure cool. Now Pharo is slow on these loops with arithmetics and it is painful. Eliot, why is a class variable faster? Alex, I'll a look at OpenCL. Also, I tried with a whileTrue: loop which was 3 times faster than the sum on Collection. How to profile these kinds of tight loops? The standard profiler is kind of useless. Is AndreasProfiler the way to go? Phil
