[Haskell-cafe] fast Array operations: foldl, drop
ketil+haskell at ii.uib.no
Fri Nov 30 02:47:50 EST 2007
Bryan O'Sullivan <bos at serpentine.com> writes:
> For higher dimensions, there are enough options in terms of
> traversal direction and what exactly e.g. a fold should fold over
> (single elements? lower-dimensional slices?) that a sensible API
> doesn't exactly leap out.
How about a 'reduce' instead of 'foldl1'? I think that if you require
a commutative operator, the order doesn't matter (except for
efficiency and possible rounding issues, I guess).
If I haven't seen further, it is by standing in the footprints of giants
More information about the Haskell-Cafe