Data.NonEmpty.Class

Documentation

class Empty f where

Methods

empty :: f a

Instances

Empty []

Empty Maybe

Empty Empty

class Cons f where

Methods

cons :: a -> f a -> f a

Instances

Cons []

Cons f => Cons (T f)

class View f where

Methods

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

Instances

View []

View Maybe

View Empty

class Singleton f where

Methods

singleton :: a -> f a

Instances

Singleton []

Singleton Maybe

Empty f => Singleton (T f)

class Append f where

Methods

append :: f a -> f a -> f a

Instances

Append []

(Cons f, Append f) => Append (T f)

class Zip f where

Methods

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

Instances

Zip []

Zip Maybe

Zip f => Zip (T f)

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

class Sort f where

Methods

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

insertBy :: (a -> a -> Ordering) -> a -> f a -> (a, f a)

Instances

Sort []

Sort Maybe

Sort f => Sort (T f)

sort :: (Ord a, Sort f) => f a -> f a

insert :: (Ord a, Sort f) => a -> f a -> (a, f a)

Insert an element into an ordered list while preserving the order. The first element of the resulting list is returned individually. We need this for construction of a non-empty list.

class Arbitrary f where

Methods

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

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

Instances

Arbitrary []