[Haskell-cafe] fast Array operations: foldl, drop

[Bulat Ziganshin]

Hello Jules,

Thursday, November 29, 2007, 2:29:08 PM, you wrote:

>> I thought operations like "foldl'" and "drop" must be very fast on arrays
>> (especially UArray) with appropriate pointer tricks, I mean pointer

> As far as I'm aware, our arrays don't support any kind of zero-copy 
> slicing, which is what your 'drop' trick amounts to.

of course - they don't contain "first index" element, so entire
ByteArray# should be used for UArray


-- 
Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com