Safe Haskell | Safe |
---|---|

Language | Haskell98 |

## Synopsis

- class Empty f where
- class Cons f where
- class Snoc f where
- 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
- class Append f where
- class Functor f => Zip f where
- 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
- class Repeat f => Iterate f where
- class Sort f where
- sortDefault :: (Ord a, SortBy f) => f a -> f a
- class Sort f => SortBy f where
- class Reverse f where
- class Show f where
- class Arbitrary f where
- class NFData f where

# Documentation

## Instances

Empty [] Source # | |

Defined in Data.NonEmpty.Class | |

Empty Maybe Source # | |

Defined in Data.NonEmpty.Class | |

Empty Seq Source # | |

Defined in Data.NonEmpty.Class | |

Empty Set Source # | |

Defined in Data.NonEmpty.Class | |

Empty T Source # | |

Defined in Data.Empty | |

Empty (Map k) Source # | |

Defined in Data.NonEmpty.Class | |

Empty (T f) Source # | |

Defined in Data.Optional |

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

## Instances

ViewL [] Source # | |

Defined in Data.NonEmpty.Class | |

ViewL Maybe Source # | |

ViewL Seq Source # | |

ViewL Set Source # | |

ViewL T Source # | |

ViewL f => ViewL (T f) Source # | Caution:
This instance mainly exist to allow cascaded applications of |

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

## Instances

View [] Source # | |

Defined in Data.NonEmpty.Class | |

View Maybe Source # | |

Defined in Data.NonEmpty.Class | |

View Seq Source # | |

Defined in Data.NonEmpty.Class | |

View Set Source # | |

Defined in Data.NonEmpty.Class | |

View T Source # | |

Defined in Data.Empty |

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

class Singleton f where Source #

## Instances

Singleton [] Source # | |

Defined in Data.NonEmpty.Class | |

Singleton Maybe Source # | |

Defined in Data.NonEmpty.Class | |

Singleton Seq Source # | |

Defined in Data.NonEmpty.Class | |

Singleton Set Source # | |

Defined in Data.NonEmpty.Class | |

Empty f => Singleton (T f) Source # | |

Defined in Data.NonEmptyPrivate |

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

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`

.

We need to distinguish between `Sort`

and `SortBy`

,
since there is an `instance Sort Set`

but there cannot be an `instance SortBy Set`

.

## Instances

Sort [] Source # | |

Defined in Data.NonEmpty.Class | |

Sort Maybe Source # | |

Sort Seq Source # | |

Sort Set Source # | |

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

(Insert f, Sort f) => Sort (T f) Source # | |

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

## Instances

NFData [] Source # | |

Defined in Data.NonEmpty.Class | |

NFData Maybe Source # | |

NFData Set Source # | |

NFData T Source # | |

NFData T Source # | |

NFData k => NFData (Map k) Source # | |

NFData f => NFData (T f) Source # | |

NFData k => NFData (T k) Source # | |

NFData f => NFData (T f) Source # | |

NFData f => NFData (T f) Source # | |

(NFData f, NFData g) => NFData (T f g) Source # | |