Robert van Herk wrote:
Hi all,
So my theory now is:
I do a large number of lookups.
Try using Data.Array.Base.unsafeRead (and maybe
ata.Array.Base.unsafeWrite). These avoid the bounds checking on the
index each time you lookup something in the array.
Right. Also keep an
Hi all,
So my theory now is:
I do a large number of lookups.
Try using Data.Array.Base.unsafeRead (and maybe
ata.Array.Base.unsafeWrite). These avoid the bounds checking on the
index each time you lookup something in the array.
Right. Also keep an eye on the GC time (+RTS
Hi all,
I have a problem with regards to the speed of ST arrays.
In short: a Data.Map.Map outperforms Data.Array.ST in my application,
whereas as far as I understand it, the ST array should be quicker.
My application is a compiler. It compiles some source code into a (huge)
number of boolean
So my theory now is:
I do a large number of lookups.
Try using Data.Array.Base.unsafeRead (and maybe ata.Array.Base.unsafeWrite).
These avoid the bounds checking on the index each time you lookup something in
the array.
___
Glasgow-haskell-users
Chris Kuklewicz wrote:
So my theory now is:
I do a large number of lookups.
Try using Data.Array.Base.unsafeRead (and maybe
ata.Array.Base.unsafeWrite). These avoid the bounds checking on the
index each time you lookup something in the array.
Right. Also keep an eye on the GC time
