[Haskell-cafe] Removing alternate items from a list

[Christopher Done]

Can't forget fix in a game of code golf!

> (fix $ \f (x:_: xs) -> x : f xs) [1..]
=> [1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,4...

2010/6/8 Yitzchak Gale <gale at sefer.org>:
> R J wrote:
>> What's the cleanest definition for a function f :: [a] -> [a] that takes a
>> list and returns the same list, with alternate items removed?  e.g., f [0,
>> 1, 2, 3, 4, 5] = [1,3,5]?
>
> f = map head . takeWhile (not . null) . iterate (drop 2) . drop 1
>
> Regards,
> Yitz
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>