| Safe Haskell | None |
|---|
Data.NonEmpty.Class
- class Empty f where
- empty :: f a
- class Cons f where
- cons :: a -> f a -> f a
- class Snoc f where
- snoc :: f a -> a -> f a
- snocDefault :: (Cons f, Traversable f) => f a -> a -> f a
- class ViewL f where
- class ViewR f where
- class (ViewL f, ViewR f) => View f
- viewRDefault :: (ViewL f, Traversable f) => f a -> Maybe (f a, a)
- class Singleton f where
- singleton :: a -> f a
- class Append f where
- append :: f a -> f a -> f a
- class Functor f => Zip f where
- zipWith :: (a -> b -> c) -> f a -> f b -> f c
- zipWith3 :: Zip f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
- zipWith4 :: Zip f => (a -> b -> c -> d -> e) -> f a -> f b -> f c -> f d -> f e
- zip :: Zip f => f a -> f b -> f (a, b)
- zip3 :: Zip f => f a -> f b -> f c -> f (a, b, c)
- zip4 :: Zip f => f a -> f b -> f c -> f d -> f (a, b, c, d)
- class Repeat f where
- repeat :: a -> f a
- class Repeat f => Iterate f where
- iterate :: (a -> a) -> a -> f a
- class Sort f where
- sortDefault :: (Ord a, SortBy f) => f a -> f a
- class Sort f => SortBy f where
- class Reverse f where
- reverse :: f a -> f a
- class Show f where
- class Arbitrary f where
Documentation
snocDefault :: (Cons f, Traversable f) => f a -> a -> f aSource
viewRDefault :: (ViewL f, Traversable f) => f a -> Maybe (f a, a)Source
class Functor f => Zip f whereSource
It must hold:
fmap f xs
= zipWith (\x _ -> f x) xs xs
= zipWith (\_ x -> f x) xs xs
Methods
Create a container with as many copies as possible of a given value.
That is, for a container with fixed size n,
the call repeat x will generate a container with n copies of x.
sortDefault :: (Ord a, SortBy f) => f a -> f aSource