15 Nov
2009
15 Nov
'09
1:05 p.m.
On Sun, Nov 15, 2009 at 06:16:03PM +0300, Alexey Khudyakov wrote:
Another implementation you may try is
a' = mapU (\(i :*: x) -> (i `mod` n) :*: x) (indexedU a) mkSlice j = fstU $ filterU (\(i :*: x) -> i == j) a'
This one is fastest so far
Nice! Just for the record, of course I meant 'sndU' :). Thanks god Haskell is statically typed and that error should be caught rather easily. -- Felipe.