Re[2]: [Haskell-cafe] idea for avoiding temporaries

2007-03-11 Thread Bulat Ziganshin
Hello Claus, Sunday, March 11, 2007, 10:03:59 PM, you wrote: both the array and strict list versions avoid some intermediate structures; for the arbitrarily invented, relatively small inputs i've tried, strict lists are the clear winner, thanks to lower memory traffic, but i'd like some

Re: Re[2]: [Haskell-cafe] idea for avoiding temporaries

2007-03-11 Thread Claus Reinke
Hi Bulat, obviously, arrays version should create no temporary cells. that's why the memory traffic surprised me. i knew there had to be something wrong. the problems was mainly due to 2 factors: 1) readArray m (i,j) yes, indeed. since we are dealing in bulk operations, we might as well

Re[2]: [Haskell-cafe] idea for avoiding temporaries

2007-03-10 Thread Bulat Ziganshin
Hello Claus, Saturday, March 10, 2007, 4:36:22 AM, you wrote: ah, ok, i'm not used to thinking in such scales;-) (perhaps you should get in touch with those SAC people, after all - i don't know what their state of play is, but many years ago, they started in an office near mine, and they