bimap-many-0.1.0.0: Bidirectional many-to-many mapping between two key types
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Map.Signature (signature[?])

Documentation

data Map k v #

Instances

Instances details
Functor (Map k) # 
Instance details

Defined in Data.Map.Signature

Methods

fmap :: (a -> b) -> Map k a -> Map k b #

(<$) :: a -> Map k b -> Map k a #

Foldable (Map k) # 
Instance details

Defined in Data.Map.Signature

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 #

toList :: Map k a -> [a] #

null :: Map k a -> Bool #

length :: Map k a -> Int #

elem :: Eq a => a -> Map k a -> Bool #

maximum :: Ord a => Map k a -> a #

minimum :: Ord a => Map k a -> a #

sum :: Num a => Map k a -> a #

product :: Num a => Map k a -> a #

Traversable (Map k) # 
Instance details

Defined in Data.Map.Signature

Methods

traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) #

sequenceA :: Applicative f => Map k (f a) -> f (Map k a) #

mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) #

sequence :: Monad m => Map k (m a) -> m (Map k a) #

(Eq k, Eq a) => Eq (Map k a) # 
Instance details

Defined in Data.Map.Signature

Methods

(==) :: Map k a -> Map k a -> Bool #

(/=) :: Map k a -> Map k a -> Bool #

(Ord k, Ord v) => Ord (Map k v) # 
Instance details

Defined in Data.Map.Signature

Methods

compare :: Map k v -> Map k v -> Ordering #

(<) :: Map k v -> Map k v -> Bool #

(<=) :: Map k v -> Map k v -> Bool #

(>) :: Map k v -> Map k v -> Bool #

(>=) :: Map k v -> Map k v -> Bool #

max :: Map k v -> Map k v -> Map k v #

min :: Map k v -> Map k v -> Map k v #

(NFData k, NFData a) => NFData (Map k a) # 
Instance details

Defined in Data.Map.Signature

Methods

rnf :: Map k a -> () #

empty :: Map k a #

singleton :: k -> a -> Map k a #

fromSet :: (k -> a) -> Set k -> Map k a #

fromDistinctAscList :: [(k, a)] -> Map k a #

insert :: Ord k => k -> a -> Map k a -> Map k a #

delete :: Ord k => k -> Map k a -> Map k a #

update :: Ord k => (a -> Maybe a) -> k -> Map k a -> Map k a #

alter :: Ord k => (Maybe a -> Maybe a) -> k -> Map k a -> Map k a #

lookup :: Ord k => k -> Map k a -> Maybe a #

(!?) :: Ord k => Map k a -> k -> Maybe a #

(!) :: Ord k => Map k a -> k -> a #

member :: Ord k => k -> Map k a -> Bool #

null :: Map k a -> Bool #

size :: Map k a -> Int #

union :: Ord k => Map k a -> Map k a -> Map k a #

unionWith :: Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a #

keys :: Map k a -> [k] #

toList :: Map k a -> [(k, a)] #