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

-- | IntMap and IntSet with Enum keys/elements.
--   
--   This package contains simple wrappers around Data.IntMap and
--   Data.IntSet with Enum keys and elements respectively.
--   Especially useful for Ints wrapped with `newtype`.
@package enummapset
@version 0.7.3.0

module Data.EnumSet

-- | Wrapper for IntSet with Enum elements.
data EnumSet k

-- | Wrap IntSet.
intSetToEnumSet :: IntSet -> EnumSet k

-- | Unwrap IntSet.
enumSetToIntSet :: EnumSet k -> IntSet
(\\) :: EnumSet k -> EnumSet k -> EnumSet k
null :: EnumSet k -> Bool
size :: EnumSet k -> Int
member :: Enum k => k -> EnumSet k -> Bool
notMember :: Enum k => k -> EnumSet k -> Bool
lookupLT :: Enum k => k -> EnumSet k -> Maybe k
lookupGT :: Enum k => k -> EnumSet k -> Maybe k
lookupLE :: Enum k => k -> EnumSet k -> Maybe k
lookupGE :: Enum k => k -> EnumSet k -> Maybe k
isSubsetOf :: EnumSet k -> EnumSet k -> Bool
isProperSubsetOf :: EnumSet k -> EnumSet k -> Bool
empty :: EnumSet k
singleton :: Enum k => k -> EnumSet k
insert :: Enum k => k -> EnumSet k -> EnumSet k
delete :: Enum k => k -> EnumSet k -> EnumSet k
union :: EnumSet k -> EnumSet k -> EnumSet k
unions :: [EnumSet k] -> EnumSet k
difference :: EnumSet k -> EnumSet k -> EnumSet k
intersection :: EnumSet k -> EnumSet k -> EnumSet k
filter :: Enum k => (k -> Bool) -> EnumSet k -> EnumSet k
partition :: Enum k => (k -> Bool) -> EnumSet k -> (EnumSet k, EnumSet k)
split :: Enum k => k -> EnumSet k -> (EnumSet k, EnumSet k)
splitMember :: Enum k => k -> EnumSet k -> (EnumSet k, Bool, EnumSet k)
map :: Enum k => (k -> k) -> EnumSet k -> EnumSet k
foldr :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b
foldl :: Enum k => (a -> k -> a) -> a -> EnumSet k -> a
foldr' :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b
foldl' :: Enum k => (a -> k -> a) -> a -> EnumSet k -> a
fold :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b
findMin :: Enum k => EnumSet k -> k
findMax :: Enum k => EnumSet k -> k
deleteMin :: EnumSet k -> EnumSet k
deleteMax :: EnumSet k -> EnumSet k
deleteFindMin :: Enum k => EnumSet k -> (k, EnumSet k)
deleteFindMax :: Enum k => EnumSet k -> (k, EnumSet k)
maxView :: Enum k => EnumSet k -> Maybe (k, EnumSet k)
minView :: Enum k => EnumSet k -> Maybe (k, EnumSet k)
elems :: Enum k => EnumSet k -> [k]
toList :: Enum k => EnumSet k -> [k]
fromList :: Enum k => [k] -> EnumSet k
toAscList :: Enum k => EnumSet k -> [k]
toDescList :: Enum k => EnumSet k -> [k]
fromAscList :: Enum k => [k] -> EnumSet k
fromDistinctAscList :: Enum k => [k] -> EnumSet k
instance GHC.Classes.Eq (Data.EnumSet.EnumSet k)
instance Data.Aeson.Types.FromJSON.FromJSON a => Data.Aeson.Types.FromJSON.FromJSON (Data.EnumSet.EnumSet a)
instance GHC.Internal.Enum.Enum a => GHC.Internal.IsList.IsList (Data.EnumSet.EnumSet a)
instance GHC.Internal.Base.Monoid (Data.EnumSet.EnumSet k)
instance Control.DeepSeq.NFData (Data.EnumSet.EnumSet k)
instance GHC.Classes.Ord (Data.EnumSet.EnumSet k)
instance (GHC.Internal.Enum.Enum k, GHC.Internal.Read.Read k) => GHC.Internal.Read.Read (Data.EnumSet.EnumSet k)
instance GHC.Internal.Base.Semigroup (Data.EnumSet.EnumSet k)
instance (GHC.Internal.Enum.Enum k, GHC.Internal.Show.Show k) => GHC.Internal.Show.Show (Data.EnumSet.EnumSet k)
instance Data.Aeson.Types.ToJSON.ToJSON (Data.EnumSet.EnumSet a)

module Data.EnumMap.Strict

-- | Wrapper for IntMap with Enum keys.
data EnumMap k a

-- | Wrap IntMap.
intMapToEnumMap :: IntMap a -> EnumMap k a

-- | Unwrap IntMap.
enumMapToIntMap :: EnumMap k a -> IntMap a
(!) :: Enum k => EnumMap k a -> k -> a
(\\) :: EnumMap k a -> EnumMap k b -> EnumMap k a
null :: EnumMap k a -> Bool
size :: EnumMap k a -> Int
member :: Enum k => k -> EnumMap k a -> Bool
notMember :: Enum k => k -> EnumMap k a -> Bool
lookup :: Enum k => k -> EnumMap k a -> Maybe a
findWithDefault :: Enum k => a -> k -> EnumMap k a -> a
lookupLT :: Enum k => k -> EnumMap k a -> Maybe (k, a)
lookupGT :: Enum k => k -> EnumMap k a -> Maybe (k, a)
lookupLE :: Enum k => k -> EnumMap k a -> Maybe (k, a)
lookupGE :: Enum k => k -> EnumMap k a -> Maybe (k, a)
empty :: EnumMap k a
singleton :: Enum k => k -> a -> EnumMap k a
insert :: Enum k => k -> a -> EnumMap k a -> EnumMap k a
insertWith :: Enum k => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
insertWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
insertLookupWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> (Maybe a, EnumMap k a)
delete :: Enum k => k -> EnumMap k a -> EnumMap k a
adjust :: Enum k => (a -> a) -> k -> EnumMap k a -> EnumMap k a
adjustWithKey :: Enum k => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a
update :: Enum k => (a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
updateWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
updateLookupWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> (Maybe a, EnumMap k a)
alter :: Enum k => (Maybe a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
alterF :: (Enum k, Functor f) => (Maybe a -> f (Maybe a)) -> k -> EnumMap k a -> f (EnumMap k a)
union :: EnumMap k a -> EnumMap k a -> EnumMap k a
unionWith :: (a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a
unionWithKey :: Enum k => (k -> a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a
unions :: [EnumMap k a] -> EnumMap k a
unionsWith :: (a -> a -> a) -> [EnumMap k a] -> EnumMap k a
difference :: EnumMap k a -> EnumMap k b -> EnumMap k a
differenceWith :: (a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a
differenceWithKey :: Enum k => (k -> a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a
intersection :: EnumMap k a -> EnumMap k b -> EnumMap k a
intersectionWith :: (a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
intersectionWithKey :: Enum k => (k -> a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
mergeWithKey :: Enum k => (k -> a -> b -> Maybe c) -> (EnumMap k a -> EnumMap k c) -> (EnumMap k b -> EnumMap k c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
map :: (a -> b) -> EnumMap k a -> EnumMap k b
mapWithKey :: Enum k => (k -> a -> b) -> EnumMap k a -> EnumMap k b
traverseWithKey :: (Applicative t, Enum k) => (k -> a -> t b) -> EnumMap k a -> t (EnumMap k b)
mapAccum :: (a -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
mapAccumWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
mapAccumRWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
mapKeys :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a
mapKeysWith :: Enum k => (a -> a -> a) -> (k -> k) -> EnumMap k a -> EnumMap k a
mapKeysMonotonic :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a
foldr :: (a -> b -> b) -> b -> EnumMap k a -> b
foldl :: (a -> b -> a) -> a -> EnumMap k b -> a
foldrWithKey :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b
foldlWithKey :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a
foldr' :: (a -> b -> b) -> b -> EnumMap k a -> b
foldl' :: (a -> b -> a) -> a -> EnumMap k b -> a
foldrWithKey' :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b
foldlWithKey' :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a
elems :: EnumMap k a -> [a]
keys :: Enum k => EnumMap k a -> [k]
assocs :: Enum k => EnumMap k a -> [(k, a)]
keysSet :: Enum k => EnumMap k a -> EnumSet k
fromSet :: Enum k => (k -> a) -> EnumSet k -> EnumMap k a
toList :: Enum k => EnumMap k a -> [(k, a)]
fromList :: Enum k => [(k, a)] -> EnumMap k a
fromListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a
fromListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
toAscList :: Enum k => EnumMap k a -> [(k, a)]
toDescList :: Enum k => EnumMap k a -> [(k, a)]
fromAscList :: Enum k => [(k, a)] -> EnumMap k a
fromAscListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a
fromAscListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
fromDistinctAscList :: Enum k => [(k, a)] -> EnumMap k a
filter :: (a -> Bool) -> EnumMap k a -> EnumMap k a
filterWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> EnumMap k a
restrictKeys :: Enum k => EnumMap k a -> EnumSet k -> EnumMap k a
withoutKeys :: Enum k => EnumMap k a -> EnumSet k -> EnumMap k a
partition :: (a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)
partitionWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)
mapMaybe :: (a -> Maybe b) -> EnumMap k a -> EnumMap k b
mapMaybeWithKey :: Enum k => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b
mapEither :: (a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)
mapEitherWithKey :: Enum k => (k -> a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)
split :: Enum k => k -> EnumMap k a -> (EnumMap k a, EnumMap k a)
splitLookup :: Enum k => k -> EnumMap k a -> (EnumMap k a, Maybe a, EnumMap k a)
isSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool
isSubmapOfBy :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool
isProperSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool
isProperSubmapOfBy :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool
lookupMin :: Enum k => EnumMap k a -> Maybe (k, a)
lookupMax :: Enum k => EnumMap k a -> Maybe (k, a)
findMin :: Enum k => EnumMap k a -> (k, a)
findMax :: Enum k => EnumMap k a -> (k, a)
deleteMin :: EnumMap k a -> EnumMap k a
deleteMax :: EnumMap k a -> EnumMap k a
deleteFindMin :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)
deleteFindMax :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)
updateMin :: (a -> Maybe a) -> EnumMap k a -> EnumMap k a
updateMax :: (a -> Maybe a) -> EnumMap k a -> EnumMap k a
updateMinWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
updateMaxWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
minView :: EnumMap k a -> Maybe (a, EnumMap k a)
maxView :: EnumMap k a -> Maybe (a, EnumMap k a)
minViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)
maxViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)

module Data.EnumMap.Lazy

-- | Wrapper for IntMap with Enum keys.
data EnumMap k a

-- | Wrap IntMap.
intMapToEnumMap :: IntMap a -> EnumMap k a

-- | Unwrap IntMap.
enumMapToIntMap :: EnumMap k a -> IntMap a
(!) :: Enum k => EnumMap k a -> k -> a
(\\) :: EnumMap k a -> EnumMap k b -> EnumMap k a
null :: EnumMap k a -> Bool
size :: EnumMap k a -> Int
member :: Enum k => k -> EnumMap k a -> Bool
notMember :: Enum k => k -> EnumMap k a -> Bool
lookup :: Enum k => k -> EnumMap k a -> Maybe a
findWithDefault :: Enum k => a -> k -> EnumMap k a -> a
lookupLT :: Enum k => k -> EnumMap k a -> Maybe (k, a)
lookupGT :: Enum k => k -> EnumMap k a -> Maybe (k, a)
lookupLE :: Enum k => k -> EnumMap k a -> Maybe (k, a)
lookupGE :: Enum k => k -> EnumMap k a -> Maybe (k, a)
empty :: EnumMap k a
singleton :: Enum k => k -> a -> EnumMap k a
insert :: Enum k => k -> a -> EnumMap k a -> EnumMap k a
insertWith :: Enum k => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
insertWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
insertLookupWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> (Maybe a, EnumMap k a)
delete :: Enum k => k -> EnumMap k a -> EnumMap k a
adjust :: Enum k => (a -> a) -> k -> EnumMap k a -> EnumMap k a
adjustWithKey :: Enum k => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a
update :: Enum k => (a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
updateWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
updateLookupWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> (Maybe a, EnumMap k a)
alter :: Enum k => (Maybe a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
alterF :: (Enum k, Functor f) => (Maybe a -> f (Maybe a)) -> k -> EnumMap k a -> f (EnumMap k a)
union :: EnumMap k a -> EnumMap k a -> EnumMap k a
unionWith :: (a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a
unionWithKey :: Enum k => (k -> a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a
unions :: [EnumMap k a] -> EnumMap k a
unionsWith :: (a -> a -> a) -> [EnumMap k a] -> EnumMap k a
difference :: EnumMap k a -> EnumMap k b -> EnumMap k a
differenceWith :: (a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a
differenceWithKey :: Enum k => (k -> a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a
intersection :: EnumMap k a -> EnumMap k b -> EnumMap k a
intersectionWith :: (a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
intersectionWithKey :: Enum k => (k -> a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
mergeWithKey :: Enum k => (k -> a -> b -> Maybe c) -> (EnumMap k a -> EnumMap k c) -> (EnumMap k b -> EnumMap k c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
map :: (a -> b) -> EnumMap k a -> EnumMap k b
mapWithKey :: Enum k => (k -> a -> b) -> EnumMap k a -> EnumMap k b
traverseWithKey :: (Applicative t, Enum k) => (k -> a -> t b) -> EnumMap k a -> t (EnumMap k b)
mapAccum :: (a -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
mapAccumWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
mapAccumRWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
mapKeys :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a
mapKeysWith :: Enum k => (a -> a -> a) -> (k -> k) -> EnumMap k a -> EnumMap k a
mapKeysMonotonic :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a
foldr :: (a -> b -> b) -> b -> EnumMap k a -> b
foldl :: (a -> b -> a) -> a -> EnumMap k b -> a
foldrWithKey :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b
foldlWithKey :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a
foldr' :: (a -> b -> b) -> b -> EnumMap k a -> b
foldl' :: (a -> b -> a) -> a -> EnumMap k b -> a
foldrWithKey' :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b
foldlWithKey' :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a
elems :: EnumMap k a -> [a]
keys :: Enum k => EnumMap k a -> [k]
assocs :: Enum k => EnumMap k a -> [(k, a)]
keysSet :: Enum k => EnumMap k a -> EnumSet k
fromSet :: Enum k => (k -> a) -> EnumSet k -> EnumMap k a
toList :: Enum k => EnumMap k a -> [(k, a)]
fromList :: Enum k => [(k, a)] -> EnumMap k a
fromListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a
fromListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
toAscList :: Enum k => EnumMap k a -> [(k, a)]
toDescList :: Enum k => EnumMap k a -> [(k, a)]
fromAscList :: Enum k => [(k, a)] -> EnumMap k a
fromAscListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a
fromAscListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
fromDistinctAscList :: Enum k => [(k, a)] -> EnumMap k a
filter :: (a -> Bool) -> EnumMap k a -> EnumMap k a
filterWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> EnumMap k a
restrictKeys :: Enum k => EnumMap k a -> EnumSet k -> EnumMap k a
withoutKeys :: Enum k => EnumMap k a -> EnumSet k -> EnumMap k a
partition :: (a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)
partitionWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)
mapMaybe :: (a -> Maybe b) -> EnumMap k a -> EnumMap k b
mapMaybeWithKey :: Enum k => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b
mapEither :: (a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)
mapEitherWithKey :: Enum k => (k -> a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)
split :: Enum k => k -> EnumMap k a -> (EnumMap k a, EnumMap k a)
splitLookup :: Enum k => k -> EnumMap k a -> (EnumMap k a, Maybe a, EnumMap k a)
isSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool
isSubmapOfBy :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool
isProperSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool
isProperSubmapOfBy :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool
lookupMin :: Enum k => EnumMap k a -> Maybe (k, a)
lookupMax :: Enum k => EnumMap k a -> Maybe (k, a)
findMin :: Enum k => EnumMap k a -> (k, a)
findMax :: Enum k => EnumMap k a -> (k, a)
deleteMin :: EnumMap k a -> EnumMap k a
deleteMax :: EnumMap k a -> EnumMap k a
deleteFindMin :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)
deleteFindMax :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)
updateMin :: (a -> Maybe a) -> EnumMap k a -> EnumMap k a
updateMax :: (a -> Maybe a) -> EnumMap k a -> EnumMap k a
updateMinWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
updateMaxWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
minView :: EnumMap k a -> Maybe (a, EnumMap k a)
maxView :: EnumMap k a -> Maybe (a, EnumMap k a)
minViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)
maxViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)

module Data.EnumMap

-- | This function is being removed and is no longer usable. Use
--   insertWith
insertWith' :: Whoops "Data.EnumMap.insertWith' is gone. Use Data.EnumMap.Strict.insertWith." => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a

-- | This function is being removed and is no longer usable. Use
--   insertWithKey.
insertWithKey' :: Whoops "Data.EnumMap.insertWithKey' is gone. Use Data.EnumMap.Strict.insertWithKey." => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a

-- | This function is being removed and is no longer usable. Use
--   foldr.
fold :: Whoops "Data.EnumMap.fold' is gone. Use Data.EnumMap.foldr or Prelude.foldr." => (a -> b -> b) -> b -> EnumMap k a -> b

-- | This function is being removed and is no longer usable. Use
--   foldrWithKey.
foldWithKey :: Whoops "Data.EnumMap.foldWithKey is gone. Use foldrWithKey." => (k -> a -> b -> b) -> b -> EnumMap k a -> b
instance (TypeError ...) => Data.EnumMap.Whoops a
