Re: [pure-lang-users] Patch to compile Pure with LLVM upstream

[Albert G. <Dr....@t-...>]

Jiri Spitz wrote:
> Maybe we could try the original Bird/Wadler algo and look at the 
> compilation/execution speed trade-off.

Ok, will try that tomorrow.

> Most operation with dict run some 5 times faster 
> with Pure than with Q but the members operation runs about 10 times 
> slower with Pure than with Q.

10 times *slower*?? I don't have this over here.

> let d = dict $ zipwith (=>) (1..100000) (1..100000);
> stats
> #members d;
100000
0.86s

==> def D = dict $ zip [1..100000] [1..100000]

==> #members D; stats
100000
0.81 secs, 300002 reductions, 265536 cells

Still the Pure version seems awfully slow given that Pure is supposed to
run a lot *faster* than Q. Hmm, and it gets slower each time I run the
members function. Something's wrong there. I will have to see whether
the B/W implementation exhibits the same behaviour.

Albert

-- 
Dr. Albert Gr"af
Dept. of Music-Informatics, University of Mainz, Germany
Email:  Dr....@t-..., ag...@mu...
WWW:    http://www.musikinformatik.uni-mainz.de/ag