License | MIT |
---|---|
Maintainer | Paweł Nowak <pawel834@gmail.com> |
Stability | provisional |
Portability | portable |
Safe Haskell | Trustworthy |
Language | Haskell2010 |
Dense, total, maps for bounded types.
Documentation
A total map from keys k to values a.
Most functions are derived from Map
.
n is equal to the number of keys.
Unfortunately I cannot find any law linking Enum with Ord, so we cannot
be sure that [minBound .. maxBound]
is sorted. Because of that functions
like pure
and tabulate
have complexity O(n * log n), while they could be O(n).
Functor (TotalMap k) | |
(Ord k, Enum k, Bounded k) => Applicative (TotalMap k) | |
Foldable (TotalMap k) | |
Traversable (TotalMap k) | |
(Ord k, Enum k, Bounded k) => Distributive (TotalMap k) | Complexity: |
(Ord k, Enum k, Bounded k) => Representable (TotalMap k) | Convert from and to a Complexity: tabulate O(n * log n), index O(log n) |
(Ord k, Enum k, Bounded k) => Serial1 (TotalMap k) | Complexity: |
Keyed (TotalMap k) | |
Ord k => Zip (TotalMap k) | |
Ord k => ZipWithKey (TotalMap k) | |
Ord k => Indexable (TotalMap k) | |
Ord k => Lookup (TotalMap k) | |
Ord k => Adjustable (TotalMap k) | |
Ord k => FoldableWithKey (TotalMap k) | |
Ord k => TraversableWithKey (TotalMap k) | Complexity: |
(Ord k, Enum k, Bounded k) => Metric (TotalMap k) | Complexity: all O(n) |
(Ord k, Enum k, Bounded k) => Additive (TotalMap k) | Complexity: |
(Eq k, Eq a) => Eq (TotalMap k a) | |
(Ord k, Ord a) => Ord (TotalMap k a) | |
(Ord k, Read k, Read a) => Read (TotalMap k a) | |
(Show k, Show a) => Show (TotalMap k a) | |
(Ord k, Enum k, Bounded k, Serial a) => Serial (TotalMap k a) | Complexity: |
type Rep (TotalMap k) = k | |
type Key (TotalMap k) = k |