# non-empty: List-like structures with static checks on the number of elements

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:

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

Versions [faq] | 0.0, 0.1, 0.1.1, 0.1.2, 0.1.3, 0.2, 0.2.1, 0.3, 0.3.0.1, 0.3.1, 0.3.2 |
---|---|

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

License | BSD-3-Clause |

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 repo | this: darcs get http://code.haskell.org/~thielema/non-empty --tag 0.0 head: darcs get http://code.haskell.org/~thielema/non-empty |

Uploaded | by HenningThielemann at 2012-11-03T14:43:30Z |

Distributions | LTSHaskell:0.3.2, NixOS:0.3.2, Stackage:0.3.2 |

Downloads | 8316 total (34 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

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

## Downloads

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