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

[Henning Thielemann]

I thought operations like "foldl'" and "drop" must be very fast on arrays
(especially UArray) with appropriate pointer tricks, I mean pointer
incrementing instead of indexing for "foldl'" and a pointer into the array
for "drop". Is it planned to add such functions? Ok, if "foldl f x .
elems" and "listArray (i,sufficientlyBig) . drop n . elems" are fused to
high speed code, then these functions do not need to materialize in the
API.
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe