# The non-empty package

We provide a data type that allows to store a list-like structure
with at least or exactly `n` elements,
where `n` is fixed in the type in a kind of Peano encoding
and is usually small.
The datatype is intended to increase safety
by making functions total that are partial on plain lists.
E.g. on a non-empty list, `head` and `tail` are always defined.

The package uses Haskell 98.

Similar packages:

`semigroups`,`semigroupoids`: restricted to lists, minimum number of elements: 1, provides more type classes tailored to the use of non-empty lists.`NonEmptyList`: restricted to lists, minimum number of elements: 1`NonEmpty`: restricted to lists, minimum number of elements: 1, designed for unqualified use of identifiers`Cardinality`:`NeverEmptyList`

Related packages:

`Stream`: Lists that contain always infinitely many elements.`fixed-list`: Uses the same data structure as this package but is intended for fixing the number of elements in a list. Requires multi-parameter type classes with functional dependencies.

## Properties

Versions | 0.0, 0.1, 0.1.1, 0.1.2, 0.1.3, 0.2, 0.2.1, 0.3 |
---|---|

Dependencies | base (==4.*), QuickCheck (>=2.1 && <3), utility-ht (>=0.0.1 && <0.1) [details] |

License | BSD3 |

Author | Henning Thielemann <haskell@henning-thielemann.de> |

Maintainer | Henning Thielemann <haskell@henning-thielemann.de> |

Category | Data |

Home page | http://code.haskell.org/~thielema/non-empty/ |

Source repository | this: darcs get http://code.haskell.org/~thielema/non-empty --tag 0.1 head: darcs get http://code.haskell.org/~thielema/non-empty |

Uploaded | Tue Mar 26 09:33:22 UTC 2013 by HenningThielemann |

Distributions | LTSHaskell:0.3, NixOS:0.3, Stackage:0.3, Tumbleweed:0.3 |

Downloads | 1751 total (25 in the last 30 days) |

Votes | |

Status | Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI |

## Downloads

- non-empty-0.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)