-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Class of key-value maps
--   
--   Class of key-value maps
@package Map
@version 0.1.1.0

module Data.Map.Class
class Traversable map => StaticMap map where {
    type family Key map;
}
adjustA :: (StaticMap map, Applicative p) => (a -> p a) -> Key map -> map a -> p (map a)
traverseWithKey :: (StaticMap map, Applicative p) => (Key map -> a -> p b) -> map a -> p (map b)
class (Filtrable map, StaticMap map) => Map map
empty :: Map map => map a
alterF :: (Map map, Functor f) => (Maybe a -> f (Maybe a)) -> Key map -> map a -> f (map a)
mergeA :: (Map map, Applicative p) => (Key map -> Either' a b -> p (Maybe c)) -> map a -> map b -> p (map c)
mapMaybeWithKeyA :: (Map map, Applicative p) => (Key map -> a -> p (Maybe b)) -> map a -> p (map b)
mapEitherWithKeyA :: (Map map, Applicative p) => (Key map -> a -> p (Either b c)) -> map a -> p (map b, map c)
defaultAdjustA :: (Map map, Applicative p) => (a -> p a) -> Key map -> map a -> p (map a)
defaultTraverseWithKey :: (Map map, Applicative p) => (Key map -> a -> p b) -> map a -> p (map b)
(!?) :: StaticMap map => map a -> Key map -> Maybe a
infix 9 !?
insert :: Map map => Key map -> a -> map a -> map a
insertWith :: Map map => (a -> a -> a) -> Key map -> a -> map a -> map a
insertLookup :: Map map => Key map -> a -> map a -> (Maybe a, map a)
insertLookupWith :: Map map => (a -> a -> a) -> Key map -> a -> map a -> (Maybe a, map a)
delete :: Map map => Key map -> map a -> map a
adjust :: StaticMap map => (a -> a) -> Key map -> map a -> map a
update :: Map map => (a -> Maybe a) -> Key map -> map a -> map a
updateLookup :: Map map => (a -> Maybe a) -> Key map -> map a -> (Maybe a, map a)
alter :: Map map => (Maybe a -> Maybe a) -> Key map -> map a -> map a
alterLookup :: Map map => (Maybe a -> Maybe a) -> Key map -> map a -> (Maybe a, map a)
alterLookupF :: (Map map, Functor f) => (Maybe a -> f (Maybe a)) -> Key map -> map a -> f (Maybe a, map a)
mapWithKey :: StaticMap map => (Key map -> a -> b) -> map a -> map b
mapMaybeWithKey :: Map map => (Key map -> a -> Maybe b) -> map a -> map b
mapEitherWithKey :: Map map => (Key map -> a -> Either b c) -> map a -> (map b, map c)
foldMapWithKeyA :: (StaticMap map, Applicative p, Monoid b) => (Key map -> a -> p b) -> map a -> p b
foldrWithKeyM :: (StaticMap map, Monad m) => (Key map -> a -> b -> m b) -> b -> map a -> m b
foldlWithKeyM :: (StaticMap map, Monad m) => (b -> Key map -> a -> m b) -> b -> map a -> m b
foldMapWithKey :: (StaticMap map, Monoid b) => (Key map -> a -> b) -> map a -> b
foldrWithKey :: StaticMap map => (Key map -> a -> b -> b) -> b -> map a -> b
foldlWithKey :: StaticMap map => (b -> Key map -> a -> b) -> b -> map a -> b
fromList :: Map map => [(Key map, a)] -> map a
fromListWith :: Map map => (a -> a -> a) -> [(Key map, a)] -> map a
fromListWithKey :: Map map => (Key map -> a -> a -> a) -> [(Key map, a)] -> map a
adjustLookupA :: (StaticMap map, Applicative p) => (a -> p a) -> Key map -> map a -> p (Maybe a, map a)
singleton :: Map map => Key map -> a -> map a
unionWith :: Map map => (Key map -> a -> a -> a) -> map a -> map a -> map a
intersectionWith :: Map map => (Key map -> a -> b -> c) -> map a -> map b -> map c
merge :: Map map => (Key map -> Either' a b -> Maybe c) -> map a -> map b -> map c
unionWithA :: (Map map, Applicative p) => (Key map -> a -> a -> p a) -> map a -> map a -> p (map a)
intersectionWithA :: (Map map, Applicative p) => (Key map -> a -> b -> p c) -> map a -> map b -> p (map c)
difference :: Map map => map a -> map b -> map a
symmetricDifference :: Map map => map a -> map a -> map a
mapKeys :: (StaticMap m, Map n) => (Key m -> Key n) -> m a -> n a
traverseKeys :: (StaticMap m, Map n, Applicative p) => (Key m -> p (Key n)) -> m a -> p (n a)
keys :: StaticMap map => map a -> map (Key map)
newtype Union map a
Union :: map a -> Union map a
[unUnion] :: Union map a -> map a
newtype Intersection map a
Intersection :: map a -> Intersection map a
[unIntersection] :: Intersection map a -> map a
newtype SymmetricDifference map a
SymmetricDifference :: map a -> SymmetricDifference map a
[unSymmetricDifference] :: SymmetricDifference map a -> map a
instance Data.Functor.Classes.Show1 map => Data.Functor.Classes.Show1 (Data.Map.Class.SymmetricDifference map)
instance Data.Functor.Classes.Read1 map => Data.Functor.Classes.Read1 (Data.Map.Class.SymmetricDifference map)
instance Data.Functor.Classes.Ord1 map => Data.Functor.Classes.Ord1 (Data.Map.Class.SymmetricDifference map)
instance Data.Functor.Classes.Eq1 map => Data.Functor.Classes.Eq1 (Data.Map.Class.SymmetricDifference map)
instance forall k (map :: k -> *) (a :: k). GHC.Show.Show (map a) => GHC.Show.Show (Data.Map.Class.SymmetricDifference map a)
instance forall k (map :: k -> *) (a :: k). GHC.Read.Read (map a) => GHC.Read.Read (Data.Map.Class.SymmetricDifference map a)
instance forall k (map :: k -> *) (a :: k). GHC.Classes.Ord (map a) => GHC.Classes.Ord (Data.Map.Class.SymmetricDifference map a)
instance forall k (map :: k -> *) (a :: k). GHC.Classes.Eq (map a) => GHC.Classes.Eq (Data.Map.Class.SymmetricDifference map a)
instance Data.Traversable.Traversable map => Data.Traversable.Traversable (Data.Map.Class.SymmetricDifference map)
instance Data.Foldable.Foldable map => Data.Foldable.Foldable (Data.Map.Class.SymmetricDifference map)
instance GHC.Base.Functor map => GHC.Base.Functor (Data.Map.Class.SymmetricDifference map)
instance Data.Functor.Classes.Show1 map => Data.Functor.Classes.Show1 (Data.Map.Class.Intersection map)
instance Data.Functor.Classes.Read1 map => Data.Functor.Classes.Read1 (Data.Map.Class.Intersection map)
instance Data.Functor.Classes.Ord1 map => Data.Functor.Classes.Ord1 (Data.Map.Class.Intersection map)
instance Data.Functor.Classes.Eq1 map => Data.Functor.Classes.Eq1 (Data.Map.Class.Intersection map)
instance forall k (map :: k -> *) (a :: k). GHC.Show.Show (map a) => GHC.Show.Show (Data.Map.Class.Intersection map a)
instance forall k (map :: k -> *) (a :: k). GHC.Read.Read (map a) => GHC.Read.Read (Data.Map.Class.Intersection map a)
instance forall k (map :: k -> *) (a :: k). GHC.Classes.Ord (map a) => GHC.Classes.Ord (Data.Map.Class.Intersection map a)
instance forall k (map :: k -> *) (a :: k). GHC.Classes.Eq (map a) => GHC.Classes.Eq (Data.Map.Class.Intersection map a)
instance Data.Traversable.Traversable map => Data.Traversable.Traversable (Data.Map.Class.Intersection map)
instance Data.Foldable.Foldable map => Data.Foldable.Foldable (Data.Map.Class.Intersection map)
instance GHC.Base.Functor map => GHC.Base.Functor (Data.Map.Class.Intersection map)
instance Data.Functor.Classes.Show1 map => Data.Functor.Classes.Show1 (Data.Map.Class.Union map)
instance Data.Functor.Classes.Read1 map => Data.Functor.Classes.Read1 (Data.Map.Class.Union map)
instance Data.Functor.Classes.Ord1 map => Data.Functor.Classes.Ord1 (Data.Map.Class.Union map)
instance Data.Functor.Classes.Eq1 map => Data.Functor.Classes.Eq1 (Data.Map.Class.Union map)
instance forall k (map :: k -> *) (a :: k). GHC.Show.Show (map a) => GHC.Show.Show (Data.Map.Class.Union map a)
instance forall k (map :: k -> *) (a :: k). GHC.Read.Read (map a) => GHC.Read.Read (Data.Map.Class.Union map a)
instance forall k (map :: k -> *) (a :: k). GHC.Classes.Ord (map a) => GHC.Classes.Ord (Data.Map.Class.Union map a)
instance forall k (map :: k -> *) (a :: k). GHC.Classes.Eq (map a) => GHC.Classes.Eq (Data.Map.Class.Union map a)
instance Data.Traversable.Traversable map => Data.Traversable.Traversable (Data.Map.Class.Union map)
instance Data.Foldable.Foldable map => Data.Foldable.Foldable (Data.Map.Class.Union map)
instance GHC.Base.Functor map => GHC.Base.Functor (Data.Map.Class.Union map)
instance Data.Filtrable.Filtrable map => Data.Filtrable.Filtrable (Data.Map.Class.SymmetricDifference map)
instance Data.Map.Class.StaticMap map => Data.Map.Class.StaticMap (Data.Map.Class.SymmetricDifference map)
instance Data.Map.Class.Map map => Data.Map.Class.Map (Data.Map.Class.SymmetricDifference map)
instance Data.Map.Class.Map map => GHC.Base.Semigroup (Data.Map.Class.SymmetricDifference map a)
instance Data.Map.Class.Map map => GHC.Base.Monoid (Data.Map.Class.SymmetricDifference map a)
instance Data.Filtrable.Filtrable map => Data.Filtrable.Filtrable (Data.Map.Class.Intersection map)
instance Data.Map.Class.StaticMap map => Data.Map.Class.StaticMap (Data.Map.Class.Intersection map)
instance Data.Map.Class.Map map => Data.Map.Class.Map (Data.Map.Class.Intersection map)
instance (Data.Map.Class.Map map, GHC.Base.Semigroup a) => GHC.Base.Semigroup (Data.Map.Class.Intersection map a)
instance Data.Filtrable.Filtrable map => Data.Filtrable.Filtrable (Data.Map.Class.Union map)
instance Data.Map.Class.StaticMap map => Data.Map.Class.StaticMap (Data.Map.Class.Union map)
instance Data.Map.Class.Map map => Data.Map.Class.Map (Data.Map.Class.Union map)
instance (Data.Map.Class.Map map, GHC.Base.Semigroup a) => GHC.Base.Semigroup (Data.Map.Class.Union map a)
instance (Data.Map.Class.Map map, GHC.Base.Semigroup a) => GHC.Base.Monoid (Data.Map.Class.Union map a)
instance Data.Map.Class.Map GHC.Maybe.Maybe
instance Data.Map.Class.Map Data.IntMap.Internal.IntMap
instance GHC.Classes.Ord key => Data.Map.Class.Map (Data.Map.Internal.Map key)
instance (Data.Map.Class.Map m, Data.Map.Class.Map n) => Data.Map.Class.Map (Data.Functor.Compose.Compose m n)
instance (Data.Map.Class.Map m, Data.Map.Class.Map n) => Data.Map.Class.Map (Data.Functor.Product.Product m n)
instance Data.Map.Class.StaticMap GHC.Maybe.Maybe
instance Data.Map.Class.StaticMap Data.IntMap.Internal.IntMap
instance GHC.Classes.Ord key => Data.Map.Class.StaticMap (Data.Map.Internal.Map key)
instance (Data.Map.Class.StaticMap m, Data.Map.Class.StaticMap n) => Data.Map.Class.StaticMap (Data.Functor.Compose.Compose m n)
instance (Data.Map.Class.StaticMap m, Data.Map.Class.StaticMap n) => Data.Map.Class.StaticMap (Data.Functor.Product.Product m n)
instance Data.Filtrable.Filtrable Data.IntMap.Internal.IntMap
instance Data.Filtrable.Filtrable (Data.Map.Internal.Map key)