Safe Haskell	Safe
Language	Haskell98

Data.NonEmpty.Class

Synopsis

Documentation

class Empty f where Source #

Minimal complete definition

empty

Methods

empty :: f a Source #

Instances

Empty [] Source #
Methods empty :: [a] Source #
Empty Maybe Source #
Methods empty :: Maybe a Source #
Empty Seq Source #
Methods empty :: Seq a Source #
Empty Set Source #
Methods empty :: Set a Source #
Empty T Source #
Methods empty :: T a Source #
Empty (Map k) Source #
Methods empty :: Map k a Source #
Empty (T f) Source #
Methods empty :: T f a Source #

class Cons f where Source #

Minimal complete definition

cons

Methods

cons :: a -> f a -> f a infixr 5 Source #

Instances

Cons [] Source #
Methods cons :: a -> [a] -> [a] Source #
Cons Seq Source #
Methods cons :: a -> Seq a -> Seq a Source #
Cons f => Cons (T f) Source #
Methods cons :: a -> T f a -> T f a Source #
(Cons f, Empty f) => Cons (T f) Source #
Methods cons :: a -> T f a -> T f a Source #

class Snoc f where Source #

Minimal complete definition

snoc

Methods

snoc :: f a -> a -> f a Source #

Instances

Snoc [] Source #
Methods snoc :: [a] -> a -> [a] Source #
Snoc Seq Source #
Methods snoc :: Seq a -> a -> Seq a Source #
Snoc f => Snoc (T f) Source #
Methods snoc :: T f a -> a -> T f a Source #

snocDefault :: (Cons f, Traversable f) => f a -> a -> f a Source #

class ViewL f where Source #

Minimal complete definition

viewL

Methods

viewL :: f a -> Maybe (a, f a) Source #

Instances

ViewL [] Source #
Methods viewL :: [a] -> Maybe (a, [a]) Source #
ViewL Maybe Source #
Methods viewL :: Maybe a -> Maybe (a, Maybe a) Source #
ViewL Seq Source #
Methods viewL :: Seq a -> Maybe (a, Seq a) Source #
ViewL Set Source #
Methods viewL :: Set a -> Maybe (a, Set a) Source #
ViewL T Source #
Methods viewL :: T a -> Maybe (a, T a) Source #
ViewL f => ViewL (T f) Source #	Caution: `viewL (NonEmpty.Cons x []) = Nothing` because the tail is empty, and thus cannot be NonEmpty! This instance mainly exist to allow cascaded applications of `fetch`.
Methods viewL :: T f a -> Maybe (a, T f a) Source #

class ViewR f where Source #

Minimal complete definition

viewR

Methods

viewR :: f a -> Maybe (f a, a) Source #

Instances

ViewR [] Source #
Methods viewR :: [a] -> Maybe ([a], a) Source #
ViewR Maybe Source #
Methods viewR :: Maybe a -> Maybe (Maybe a, a) Source #
ViewR Seq Source #
Methods viewR :: Seq a -> Maybe (Seq a, a) Source #
ViewR Set Source #
Methods viewR :: Set a -> Maybe (Set a, a) Source #
ViewR T Source #
Methods viewR :: T a -> Maybe (T a, a) Source #

class (ViewL f, ViewR f) => View f Source #

Instances

View [] Source #

View Maybe Source #

View Seq Source #

View Set Source #

View T Source #

viewRDefault :: (ViewL f, Traversable f) => f a -> Maybe (f a, a) Source #

class Singleton f where Source #

Minimal complete definition

singleton

Methods

singleton :: a -> f a Source #

Instances

Singleton [] Source #
Methods singleton :: a -> [a] Source #
Singleton Maybe Source #
Methods singleton :: a -> Maybe a Source #
Singleton Seq Source #
Methods singleton :: a -> Seq a Source #
Singleton Set Source #
Methods singleton :: a -> Set a Source #
Empty f => Singleton (T f) Source #
Methods singleton :: a -> T f a Source #

class Append f where Source #

Minimal complete definition

append

Methods

append :: f a -> f a -> f a infixr 5 Source #

Instances

Append [] Source #
Methods append :: [a] -> [a] -> [a] Source #
Append Seq Source #
Methods append :: Seq a -> Seq a -> Seq a Source #
(Cons f, Append f) => Append (T f) Source #
Methods append :: T f a -> T f a -> T f a Source #

class Functor f => Zip f where Source #

It must hold:

fmap f xs
   = zipWith (\x _ -> f x) xs xs
   = zipWith (\_ x -> f x) xs xs

Minimal complete definition

zipWith

Methods

zipWith :: (a -> b -> c) -> f a -> f b -> f c Source #

Instances

Zip [] Source #
Methods zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] Source #
Zip Maybe Source #
Methods zipWith :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c Source #
Zip Seq Source #
Methods zipWith :: (a -> b -> c) -> Seq a -> Seq b -> Seq c Source #
Zip T Source #
Methods zipWith :: (a -> b -> c) -> T a -> T b -> T c Source #
Zip f => Zip (T f) Source #
Methods zipWith :: (a -> b -> c) -> T f a -> T f b -> T f c Source #
Zip f => Zip (T f) Source #
Methods zipWith :: (a -> b -> c) -> T f a -> T f b -> T f c Source #

zipWith3 :: Zip f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d Source #

zipWith4 :: Zip f => (a -> b -> c -> d -> e) -> f a -> f b -> f c -> f d -> f e Source #

zip :: Zip f => f a -> f b -> f (a, b) Source #

zip3 :: Zip f => f a -> f b -> f c -> f (a, b, c) Source #

zip4 :: Zip f => f a -> f b -> f c -> f d -> f (a, b, c, d) Source #

class Repeat f where Source #

Minimal complete definition

repeat

Methods

repeat :: a -> f a Source #

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.

Instances

Repeat [] Source #
Methods repeat :: a -> [a] Source #
Repeat Maybe Source #
Methods repeat :: a -> Maybe a Source #
Repeat T Source #
Methods repeat :: a -> T a Source #
Repeat f => Repeat (T f) Source #
Methods repeat :: a -> T f a Source #
Repeat f => Repeat (T f) Source #
Methods repeat :: a -> T f a Source #

class Repeat f => Iterate f where Source #

Minimal complete definition

iterate

Methods

iterate :: (a -> a) -> a -> f a Source #

Instances

Iterate [] Source #
Methods iterate :: (a -> a) -> a -> [a] Source #
Iterate Maybe Source #
Methods iterate :: (a -> a) -> a -> Maybe a Source #
Iterate T Source #
Methods iterate :: (a -> a) -> a -> T a Source #
Iterate f => Iterate (T f) Source #
Methods iterate :: (a -> a) -> a -> T f a Source #
Iterate f => Iterate (T f) Source #
Methods iterate :: (a -> a) -> a -> T f a Source #

class Sort f where Source #

We need to distinguish between Sort and SortBy, since there is an instance Sort Set but there cannot be an instance SortBy Set.

Minimal complete definition

sort

Methods

sort :: Ord a => f a -> f a Source #

Instances

Sort [] Source #
Methods sort :: Ord a => [a] -> [a] Source #
Sort Maybe Source #
Methods sort :: Ord a => Maybe a -> Maybe a Source #
Sort Seq Source #
Methods sort :: Ord a => Seq a -> Seq a Source #
Sort Set Source #
Methods sort :: Ord a => Set a -> Set a Source #
Sort T Source #
Methods sort :: Ord a => T a -> T a Source #
(Sort f, InsertBy f) => Sort (T f) Source #	If you nest too many non-empty lists then the efficient merge-sort (linear-logarithmic runtime) will degenerate to an inefficient insert-sort (quadratic runtime).
Methods sort :: Ord a => T f a -> T f a Source #
(Insert f, Sort f) => Sort (T f) Source #
Methods sort :: Ord a => T f a -> T f a Source #

sortDefault :: (Ord a, SortBy f) => f a -> f a Source #

Default implementation for sort based on sortBy.

class Sort f => SortBy f where Source #

Minimal complete definition

sortBy

Methods

sortBy :: (a -> a -> Ordering) -> f a -> f a Source #

Instances

SortBy [] Source #
Methods sortBy :: (a -> a -> Ordering) -> [a] -> [a] Source #
SortBy Maybe Source #
Methods sortBy :: (a -> a -> Ordering) -> Maybe a -> Maybe a Source #
SortBy Seq Source #
Methods sortBy :: (a -> a -> Ordering) -> Seq a -> Seq a Source #
SortBy T Source #
Methods sortBy :: (a -> a -> Ordering) -> T a -> T a Source #
(SortBy f, InsertBy f) => SortBy (T f) Source #
Methods sortBy :: (a -> a -> Ordering) -> T f a -> T f a Source #
(InsertBy f, SortBy f) => SortBy (T f) Source #
Methods sortBy :: (a -> a -> Ordering) -> T f a -> T f a Source #

class Reverse f where Source #

Minimal complete definition

reverse

Methods

reverse :: f a -> f a Source #

Instances

Reverse [] Source #
Methods reverse :: [a] -> [a] Source #
Reverse Maybe Source #
Methods reverse :: Maybe a -> Maybe a Source #
Reverse Seq Source #
Methods reverse :: Seq a -> Seq a Source #
Reverse T Source #
Methods reverse :: T a -> T a Source #
(Traversable f, Reverse f) => Reverse (T f) Source #
Methods reverse :: T f a -> T f a Source #
(Traversable f, Reverse f) => Reverse (T f) Source #
Methods reverse :: T f a -> T f a Source #

class Show f where Source #

Minimal complete definition

showsPrec

Methods

showsPrec :: Show a => Int -> f a -> ShowS Source #

Instances

Show [] Source #
Methods showsPrec :: Show a => Int -> [a] -> ShowS Source #
Show Set Source #
Methods showsPrec :: Show a => Int -> Set a -> ShowS Source #
Show T Source #
Methods showsPrec :: Show a => Int -> T a -> ShowS Source #
Show f => Show (T f) Source #
Methods showsPrec :: Show a => Int -> T f a -> ShowS Source #
Show f => Show (T f) Source #
Methods showsPrec :: Show a => Int -> T f a -> ShowS Source #

class Arbitrary f where Source #

Minimal complete definition

arbitrary, shrink

Methods

arbitrary :: Arbitrary a => Gen (f a) Source #

shrink :: Arbitrary a => f a -> [f a] Source #

Instances

Arbitrary [] Source #
Methods arbitrary :: Arbitrary a => Gen [a] Source # shrink :: Arbitrary a => [a] -> [[a]] Source #
Arbitrary f => Arbitrary (T f) Source #
Methods arbitrary :: Arbitrary a => Gen (T f a) Source # shrink :: Arbitrary a => T f a -> [T f a] Source #

class NFData f where Source #

Minimal complete definition

rnf

Methods

rnf :: NFData a => f a -> () Source #

Instances

NFData [] Source #
Methods rnf :: NFData a => [a] -> () Source #
NFData Maybe Source #
Methods rnf :: NFData a => Maybe a -> () Source #
NFData Set Source #
Methods rnf :: NFData a => Set a -> () Source #
NFData T Source #
Methods rnf :: NFData a => T a -> () Source #
NFData T Source #
Methods rnf :: NFData a => T a -> () Source #
NFData k => NFData (Map k) Source #
Methods rnf :: NFData a => Map k a -> () Source #
NFData f => NFData (T f) Source #
Methods rnf :: NFData a => T f a -> () Source #
NFData f => NFData (T f) Source #
Methods rnf :: NFData a => T f a -> () Source #
NFData k => NFData (T k) Source #
Methods rnf :: NFData a => T k a -> () Source #
NFData f => NFData (T f) Source #
Methods rnf :: NFData a => T f a -> () Source #
(NFData f, NFData g) => NFData (T f g) Source #
Methods rnf :: NFData a => T f g a -> () Source #