Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Data.IntMap.EnumMap2
Documentation
Instances
Ord k => Foldable (EnumMap k) # | |
Defined in Data.IntMap.EnumMap2 Methods fold :: Monoid m => EnumMap k m -> m foldMap :: Monoid m => (a -> m) -> EnumMap k a -> m foldMap' :: Monoid m => (a -> m) -> EnumMap k a -> m foldr :: (a -> b -> b) -> b -> EnumMap k a -> b foldr' :: (a -> b -> b) -> b -> EnumMap k a -> b foldl :: (b -> a -> b) -> b -> EnumMap k a -> b foldl' :: (b -> a -> b) -> b -> EnumMap k a -> b foldr1 :: (a -> a -> a) -> EnumMap k a -> a foldl1 :: (a -> a -> a) -> EnumMap k a -> a elem :: Eq a => a -> EnumMap k a -> Bool maximum :: Ord a => EnumMap k a -> a minimum :: Ord a => EnumMap k a -> a | |
Ord k => Functor (EnumMap k) # | |
Ord k => Monoid (EnumMap k a) # | |
Ord k => Semigroup (EnumMap k a) # | |
Read a => Read (EnumMap k a) # | |
Defined in Data.IntMap.EnumMap2 | |
Show a => Show (EnumMap k a) # | |
Eq a => Eq (EnumMap k a) # | |
Ord a => Ord (EnumMap k a) # | |
Defined in Data.IntMap.EnumMap2 |
findWithDefault :: Enum key => a -> key -> EnumMap key a -> a #
insertWith :: Enum key => (a -> a -> a) -> key -> a -> EnumMap key a -> EnumMap key a #
insertWithKey :: Enum key => (key -> a -> a -> a) -> key -> a -> EnumMap key a -> EnumMap key a #
insertLookupWithKey :: Enum key => (key -> a -> a -> a) -> key -> a -> EnumMap key a -> (Maybe a, EnumMap key a) #
adjustWithKey :: Enum key => (key -> a -> a) -> key -> EnumMap key a -> EnumMap key a #
updateWithKey :: Enum key => (key -> a -> Maybe a) -> key -> EnumMap key a -> EnumMap key a #
updateLookupWithKey :: Enum key => (key -> a -> Maybe a) -> key -> EnumMap key a -> (Maybe a, EnumMap key a) #
unionWithKey :: Enum key => (key -> a -> a -> a) -> EnumMap key a -> EnumMap key a -> EnumMap key a #
unionsWith :: Enum key => (a -> a -> a) -> [EnumMap key a] -> EnumMap key a #
difference :: Enum key => EnumMap key a -> EnumMap key b -> EnumMap key a #
differenceWith :: Enum key => (a -> b -> Maybe a) -> EnumMap key a -> EnumMap key b -> EnumMap key a #
differenceWithKey :: Enum key => (key -> a -> b -> Maybe a) -> EnumMap key a -> EnumMap key b -> EnumMap key a #
intersection :: Enum key => EnumMap key a -> EnumMap key b -> EnumMap key a #
intersectionWith :: Enum key => (a -> b -> a) -> EnumMap key a -> EnumMap key b -> EnumMap key a #
intersectionWithKey :: Enum key => (key -> a -> b -> a) -> EnumMap key a -> EnumMap key b -> EnumMap key a #
mapWithKey :: Enum key => (key -> a -> b) -> EnumMap key a -> EnumMap key b #
mapAccumWithKey :: Enum key => (a -> key -> b -> (a, c)) -> a -> EnumMap key b -> (a, EnumMap key c) #
foldWithKey :: Enum key => (key -> a -> b -> b) -> b -> EnumMap key a -> b #
fromListWith :: Enum key => (a -> a -> a) -> [(key, a)] -> EnumMap key a #
fromListWithKey :: Enum key => (key -> a -> a -> a) -> [(key, a)] -> EnumMap key a #
fromAscList :: Enum key => [(key, a)] -> EnumMap key a #
fromAscListWith :: Enum key => (a -> a -> a) -> [(key, a)] -> EnumMap key a #
fromAscListWithKey :: Enum key => (key -> a -> a -> a) -> [(key, a)] -> EnumMap key a #
fromDistinctAscList :: Enum key => [(key, a)] -> EnumMap key a #
filterWithKey :: Enum key => (key -> a -> Bool) -> EnumMap key a -> EnumMap key a #
partitionWithKey :: Enum key => (key -> a -> Bool) -> EnumMap key a -> (EnumMap key a, EnumMap key a) #
mapMaybeWithKey :: Enum key => (key -> a -> Maybe b) -> EnumMap key a -> EnumMap key b #
mapEitherWithKey :: Enum key => (key -> a -> Either b c) -> EnumMap key a -> (EnumMap key b, EnumMap key c) #
splitLookup :: Enum key => key -> EnumMap key a -> (EnumMap key a, Maybe a, EnumMap key a) #
isSubmapOf :: (Enum key, Eq a) => EnumMap key a -> EnumMap key a -> Bool #
isSubmapOfBy :: Enum key => (a -> b -> Bool) -> EnumMap key a -> EnumMap key b -> Bool #
isProperSubmapOf :: (Enum key, Eq a) => EnumMap key a -> EnumMap key a -> Bool #
isProperSubmapOfBy :: Enum key => (a -> b -> Bool) -> EnumMap key a -> EnumMap key b -> Bool #
showTreeWith :: (Enum key, Show a) => Bool -> Bool -> EnumMap key a -> String #