Package0.4.0.0Data Structures
nonempty-containers
Non-empty variants of containers data types, with full API
- Version0.4.0.0
- CategoryData Structures
- LicenceBSD-3-Clause
- AuthorJustin Le
- Maintainerjustin@jle.im
- Homepagegithub.com/mstksg/nonempty-containers#readme
- Pinned byhackage nonempty-containers 0.4.0.0
- Sourcehackage.haskell.org/package/nonempty-containers-0.4.0.0
Modules
20 modules- Data.Containers.NonEmpty5Non-Empty Typeclass Provides the typeclass HasNonEmpty, which abstracts over different
- Data.Containers.NonEmpty.List1Provides IsNonEmptyList, a non-empty analogue of IsList for the
- Data.IntMap.NonEmpty0Non-Empty Finite Integer-Indexed Maps This module re-exports Data.IntMap.NonEmpty.Lazy. Import
- Data.IntMap.NonEmpty.Lazy130Non-Empty Finite Integer-Indexed Maps (lazy interface) The NEIntMap v type represents a non-empty finite map (sometimes
- Data.IntMap.NonEmpty.Strict130Non-Empty Finite Integer-Indexed Maps (strict interface) The NEIntMap v type represents a non-empty finite map (sometimes
- Data.IntSet.NonEmpty60Non-Empty Finite Integer Sets The NEIntSet type represents a non-empty set of integers. See documentation for NEIntSet for information on…
- Data.Map.NonEmpty0Non-Empty Finite Maps This module re-exports Data.Map.NonEmpty.Lazy. Import
- Data.Map.NonEmpty.Lazy148Non-Empty Finite Maps (lazy interface) The NEMap k v type represents a non-empty finite map (sometimes
- Data.Map.NonEmpty.Strict148Non-Empty Finite Maps (strict interface) The NEMap k v type represents a non-empty finite map (sometimes
- Data.Sequence.NonEmpty89Non-Empty Finite Sequences | An NESeq a is a non-empty (but finite) sequence of values of type
- Data.Set.NonEmpty75Non-Empty Finite Sets The NESet e type represents a non-empty set of elements of type e.
Internal modules · 9
- Data.IntMap.NonEmpty.Internal0Internal compatibility module for the lazy non-empty int map
- Data.IntMap.NonEmpty.Lazy.Internal26Unsafe internal-use functions used in the implementation of
- Data.IntMap.NonEmpty.Strict.Internal28Strict internal-use functions used in the implementation of
- Data.IntSet.NonEmpty.Internal13Unsafe internal-use functions used in the implementation of
- Data.Map.NonEmpty.Internal0Internal compatibility module for the lazy non-empty map implementation.
- Data.Map.NonEmpty.Lazy.Internal25Unsafe internal-use functions used in the implementation of
- Data.Map.NonEmpty.Strict.Internal27Strict internal-use functions used in the implementation of
- Data.Sequence.NonEmpty.Internal21Unsafe internal-use functions used in the implementation of
- Data.Set.NonEmpty.Internal19Unsafe internal-use functions used in the implementation of
Description
Efficient and optimized non-empty versions of types from containers. Inspired by non-empty-containers library, except attempting a more faithful port (with under-the-hood optimizations) of the full containers API. Also contains a convenient typeclass abstraction for converting betwewen non-empty and possibly-empty variants. See README.md for more information.
Depends on
11 packages- aeson-2.2.5.1in this set
- base-4.22.0.0with GHC
- comonad-5.0.10in this set
- containers-0.8with GHC
- deepseq-1.5.1.0with GHC
- indexed-traversable-0.1.5in this set
- invariant-0.6.5in this set
- nonempty-vector-0.2.4in this set
- semigroupoids-6.0.2in this set
- these-1.2.1in this set
- vector-0.13.2.0in this set