Safe Haskell | None |
---|---|
Language | Haskell2010 |
Bijections via strict maps.
- module Data.Bijection.Class
- data Map k a :: * -> * -> *
Documentation
module Data.Bijection.Class
A Map from keys k
to values a
.
Functor (Map k) | |
Foldable (Map k) | |
Traversable (Map k) | |
ToJSONKey k => ToJSON1 (Map k) | |
(FromJSONKey k, Ord k) => FromJSON1 (Map k) | |
Ord k => IsList (Map k v) | |
(Eq k, Eq a) => Eq (Map k a) | |
(Data k, Data a, Ord k) => Data (Map k a) | |
(Ord k, Ord v) => Ord (Map k v) | |
(Ord k, Read k, Read e) => Read (Map k e) | |
(Show k, Show a) => Show (Map k a) | |
Ord k => Semigroup (Map k v) | |
Ord k => Monoid (Map k v) | |
(ToJSON v, ToJSONKey k) => ToJSON (Map k v) | |
(FromJSONKey k, Ord k, FromJSON v) => FromJSON (Map k v) | |
(Binary k, Binary e) => Binary (Map k e) | |
(Ord k, Serialize k, Serialize e) => Serialize (Map k e) | |
(NFData k, NFData a) => NFData (Map k a) | |
type Item (Map k v) | |
type Dom (Map d c) Source # | |
type Cod (Map d c) Source # | |