I wrote:
> The following functions would be nice additions
> to Data.List.NonEmpty in the semigroups package...
Here are two more requests:
maximum, minimum :: Ord a => NonEmpty a -> a
Two more unsafe Prelude functions become safe!
Thanks,
Yitz
___
H
Hi Edward,
I started @telling you on #haskell, but it has become
too long for that. :)
The following functions would be nice additions
to Data.List.NonEmpty in the semigroups package:
replicate1p :: Whole n => n -> a -> NonEmpty a
take1p :: Whole n => n -> NonEmpty a -> NonEmpty a
splitAt1p :: W