Safe Haskell | None |
---|---|
Language | Haskell2010 |
Data.Bijection.Map
Contents
Description
Bijections via strict maps.
Synopsis
- module Data.Bijection.Class
- data Map k a
Documentation
module Data.Bijection.Class
A Map from keys k
to values a
.
The Semigroup
operation for Map
is union
, which prefers
values from the left operand. If m1
maps a key k
to a value
a1
, and m2
maps the same key to a different value a2
, then
their union m1 <> m2
maps k
to a1
.
Instances
Bifoldable Map | Since: containers-0.6.3.1 | ||||||||
Eq2 Map | Since: containers-0.5.9 | ||||||||
Ord2 Map | Since: containers-0.5.9 | ||||||||
Defined in Data.Map.Internal | |||||||||
Show2 Map | Since: containers-0.5.9 | ||||||||
Hashable2 Map | Since: hashable-1.3.4.0 | ||||||||
Defined in Data.Hashable.Class | |||||||||
(Lift k, Lift a) => Lift (Map k a :: Type) | Since: containers-0.6.6 | ||||||||
(FromJSONKey k, Ord k) => FromJSON1 (Map k) | |||||||||
Defined in Data.Aeson.Types.FromJSON | |||||||||
ToJSONKey k => ToJSON1 (Map k) | |||||||||
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> Map k a -> Value # liftToJSONList :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> [Map k a] -> Value # liftToEncoding :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> Map k a -> Encoding # liftToEncodingList :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> [Map k a] -> Encoding # liftOmitField :: (a -> Bool) -> Map k a -> Bool # | |||||||||
Foldable (Map k) | Folds in order of increasing key. | ||||||||
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldMap' :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |||||||||
Eq k => Eq1 (Map k) | Since: containers-0.5.9 | ||||||||
Ord k => Ord1 (Map k) | Since: containers-0.5.9 | ||||||||
Defined in Data.Map.Internal | |||||||||
(Ord k, Read k) => Read1 (Map k) | Since: containers-0.5.9 | ||||||||
Defined in Data.Map.Internal | |||||||||
Show k => Show1 (Map k) | Since: containers-0.5.9 | ||||||||
Traversable (Map k) | Traverses in order of increasing key. | ||||||||
Functor (Map k) | |||||||||
Hashable k => Hashable1 (Map k) | Since: hashable-1.3.4.0 | ||||||||
Defined in Data.Hashable.Class | |||||||||
(FromJSONKey k, Ord k, FromJSON v) => FromJSON (Map k v) | |||||||||
Defined in Data.Aeson.Types.FromJSON | |||||||||
(ToJSON v, ToJSONKey k) => ToJSON (Map k v) | |||||||||
(Data k, Data a, Ord k) => Data (Map k a) | |||||||||
Defined in Data.Map.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Map k a -> c (Map k a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Map k a) # toConstr :: Map k a -> Constr # dataTypeOf :: Map k a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Map k a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Map k a)) # gmapT :: (forall b. Data b => b -> b) -> Map k a -> Map k a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQ :: (forall d. Data d => d -> u) -> Map k a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Map k a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # | |||||||||
Ord k => Monoid (Map k v) | |||||||||
Ord k => Semigroup (Map k v) | |||||||||
Ord k => IsList (Map k v) | Since: containers-0.5.6.2 | ||||||||
(Ord k, Read k, Read e) => Read (Map k e) | |||||||||
(Show k, Show a) => Show (Map k a) | |||||||||
(Eq d, Ord d) => DomCod (Map d c) Source # | |||||||||
Defined in Data.Bijection.Map Associated Types
Methods member :: Map d c -> Dom (Map d c) -> Bool Source # lookup :: Map d c -> Dom (Map d c) -> Maybe (Cod (Map d c)) Source # deleteDC :: Map d c -> Dom (Map d c) -> Maybe (Cod (Map d c), Map d c) Source # insertDC :: Map d c -> (Dom (Map d c), Cod (Map d c)) -> Map d c Source # toListDC :: Map d c -> [(Dom (Map d c), Cod (Map d c))] Source # nullDC :: Map d c -> Bool Source # sizeDC :: Map d c -> Int Source # fromListDC :: [(Dom (Map d c), Cod (Map d c))] -> Map d c Source # | |||||||||
(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) | |||||||||
Defined in Data.Map.Internal | |||||||||
(Eq k, Eq a) => Eq (Map k a) | |||||||||
(Ord k, Ord v) => Ord (Map k v) | |||||||||
(Hashable k, Hashable v) => Hashable (Map k v) | Since: hashable-1.3.4.0 | ||||||||
Defined in Data.Hashable.Class | |||||||||
type Item (Map k v) | |||||||||
Defined in Data.Map.Internal | |||||||||
type Cod (Map d c) Source # | |||||||||
Defined in Data.Bijection.Map | |||||||||
type Dom (Map d c) Source # | |||||||||
Defined in Data.Bijection.Map |
Orphan instances
(Eq d, Ord d) => DomCod (Map d c) Source # | |||||||||
Associated Types
Methods member :: Map d c -> Dom (Map d c) -> Bool Source # lookup :: Map d c -> Dom (Map d c) -> Maybe (Cod (Map d c)) Source # deleteDC :: Map d c -> Dom (Map d c) -> Maybe (Cod (Map d c), Map d c) Source # insertDC :: Map d c -> (Dom (Map d c), Cod (Map d c)) -> Map d c Source # toListDC :: Map d c -> [(Dom (Map d c), Cod (Map d c))] Source # nullDC :: Map d c -> Bool Source # sizeDC :: Map d c -> Int Source # fromListDC :: [(Dom (Map d c), Cod (Map d c))] -> Map d c Source # |