Data.NonEmpty

Documentation

data T f a

The type T can be used for many kinds of list-like structures with restrictions on the size.

• T [] a is a lazy list containing at least one element.
• T (T []) a is a lazy list containing at least two elements.
• T Vector a is a vector with at least one element. You may also use unboxed vectors but the first element will be stored in a box and you will not be able to use many functions from this module.
• T Maybe a is a list that contains one or two elements.
• T Empty a is a list that contains exactly one element.
• T (T Empty) a is a list that contains exactly two elements.

Constructors

Cons

Fields

head :: a

tail :: f a

Instances

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

Functor f => Functor (T f)

(Functor (T f), Applicative f, Empty f, Cons f, Append f) => Applicative (T f)

Foldable f => Foldable (T f)

(Functor (T f), Foldable (T f), Traversable f) => Traversable (T f)

Sort f => Sort (T f)

Zip f => Zip (T f)

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

Empty f => Singleton (T f)

Cons f => Cons (T f)

(Eq a, Eq (f a)) => Eq (T f a)

(Eq (T f a), Ord a, Ord (f a)) => Ord (T f a)

(Show a, Show (f a)) => Show (T f a)

(Arbitrary a, Arbitrary f) => Arbitrary (T f a)

(!:) :: a -> f a -> T f a

force :: T f a -> T f a

Force immediate generation of Cons.

apply :: (Applicative f, Cons f, Append f) => T f (a -> b) -> T f a -> T f b

Implementation of <*> without the Empty constraint that is needed for pure.

bind :: (Monad f, Cons f, Append f) => T f a -> (a -> T f b) -> T f b

Implementation of >>= without the Empty constraint that is needed for return.

data Empty a

Constructors

Empty

Instances

Functor Empty

Foldable Empty

Traversable Empty

View Empty

Empty Empty

Eq (Empty a)

Eq (Empty a) => Ord (Empty a)

Show (Empty a)

Arbitrary (Empty a)

toList :: Foldable f => T f a -> [a]

flatten :: Cons f => T f a -> f a

fetch :: View f => f a -> Maybe (T f a)

cons :: Cons f => a -> T f a -> T f a

singleton :: Empty f => a -> T f a

reverse :: (Foldable f, Cons f, Empty f) => T f a -> T f a

mapHead :: (a -> a) -> T f a -> T f a

mapTail :: (f a -> g a) -> T f a -> T g a

init :: (Zip f, Cons f) => T f a -> f a

last :: Foldable f => T f a -> a

foldl1 :: Foldable f => (a -> a -> a) -> T f a -> a

maximum :: (Ord a, Foldable f) => T f a -> a

maximum is a total function

minimum :: (Ord a, Foldable f) => T f a -> a

minimum is a total function

sum :: (Num a, Foldable f) => T f a -> a

sum does not need a zero for initialization

product :: (Num a, Foldable f) => T f a -> a

product does not need a one for initialization

append :: (Cons f, Append f) => T f a -> T f a -> T f a

cycle :: (Cons f, Append f) => T f a -> T f a

zipWith :: Zip f => (a -> b -> c) -> T f a -> T f b -> T f c

sortBy :: Sort f => (a -> a -> Ordering) -> T f a -> T f a

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).

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

insertBy :: (Sort f, Cons f) => (a -> a -> Ordering) -> a -> T f a -> T f a

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