enummapset-th 0.6.1.0 → 0.6.1.1
raw patch · 2 files changed
+13/−6 lines, 2 filesdep ~basedep ~template-haskellPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base, template-haskell
API changes (from Hackage documentation)
- Data.EnumMap.Lazy: (!) :: Enum k => EnumMap k a_afvc -> k -> a_afvc
+ Data.EnumMap.Lazy: (!) :: forall k (a_amgJ :: Type). Enum k => EnumMap k a_amgJ -> k -> a_amgJ
- Data.EnumMap.Lazy: (\\) :: EnumMap k a_afwc -> EnumMap k b_afwd -> EnumMap k a_afwc
+ Data.EnumMap.Lazy: (\\) :: forall k (a_amhF :: Type) (b_amhG :: Type). EnumMap k a_amhF -> EnumMap k b_amhG -> EnumMap k a_amhF
- Data.EnumMap.Lazy: adjust :: Enum k => (a_aowx -> a_aowx) -> k -> EnumMap k a_aowx -> EnumMap k a_aowx
+ Data.EnumMap.Lazy: adjust :: forall k (a_azpX :: Type). Enum k => (a_azpX -> a_azpX) -> k -> EnumMap k a_azpX -> EnumMap k a_azpX
- Data.EnumMap.Lazy: adjustWithKey :: Enum k => (k -> a_aoy0 -> a_aoy0) -> k -> EnumMap k a_aoy0 -> EnumMap k a_aoy0
+ Data.EnumMap.Lazy: adjustWithKey :: forall k (a_azri :: Type). Enum k => (k -> a_azri -> a_azri) -> k -> EnumMap k a_azri -> EnumMap k a_azri
- Data.EnumMap.Lazy: alter :: Enum k => (Maybe a_aoF0 -> Maybe a_aoF0) -> k -> EnumMap k a_aoF0 -> EnumMap k a_aoF0
+ Data.EnumMap.Lazy: alter :: forall k (a_azxv :: Type). Enum k => (Maybe a_azxv -> Maybe a_azxv) -> k -> EnumMap k a_azxv -> EnumMap k a_azxv
- Data.EnumMap.Lazy: assocs :: Enum k => EnumMap k a_agUG -> [(k, a_agUG)]
+ Data.EnumMap.Lazy: assocs :: forall k (a_anxs :: Type). Enum k => EnumMap k a_anxs -> [(k, a_anxs)]
- Data.EnumMap.Lazy: delete :: Enum k => k -> EnumMap k a_afRs -> EnumMap k a_afRs
+ Data.EnumMap.Lazy: delete :: forall k (a_amAS :: Type). Enum k => k -> EnumMap k a_amAS -> EnumMap k a_amAS
- Data.EnumMap.Lazy: deleteFindMax :: Enum k => EnumMap k a_ahzH -> ((k, a_ahzH), EnumMap k a_ahzH)
+ Data.EnumMap.Lazy: deleteFindMax :: forall k (a_ao8j :: Type). Enum k => EnumMap k a_ao8j -> ((k, a_ao8j), EnumMap k a_ao8j)
- Data.EnumMap.Lazy: deleteFindMin :: Enum k => EnumMap k a_ahys -> ((k, a_ahys), EnumMap k a_ahys)
+ Data.EnumMap.Lazy: deleteFindMin :: forall k (a_ao7f :: Type). Enum k => EnumMap k a_ao7f -> ((k, a_ao7f), EnumMap k a_ao7f)
- Data.EnumMap.Lazy: deleteMax :: EnumMap k a_ahxM -> EnumMap k a_ahxM
+ Data.EnumMap.Lazy: deleteMax :: forall k (a_ao6B :: Type). EnumMap k a_ao6B -> EnumMap k a_ao6B
- Data.EnumMap.Lazy: deleteMin :: EnumMap k a_ahx6 -> EnumMap k a_ahx6
+ Data.EnumMap.Lazy: deleteMin :: forall k (a_ao5X :: Type). EnumMap k a_ao5X -> EnumMap k a_ao5X
- Data.EnumMap.Lazy: difference :: EnumMap k a_ag9a -> EnumMap k b_ag9b -> EnumMap k a_ag9a
+ Data.EnumMap.Lazy: difference :: forall k (a_amQK :: Type) (b_amQL :: Type). EnumMap k a_amQK -> EnumMap k b_amQL -> EnumMap k a_amQK
- Data.EnumMap.Lazy: differenceWith :: (a_aoOb -> b_aoOc -> Maybe a_aoOb) -> EnumMap k a_aoOb -> EnumMap k b_aoOc -> EnumMap k a_aoOb
+ Data.EnumMap.Lazy: differenceWith :: forall k (a_azFK :: Type) (b_azFL :: Type). (a_azFK -> b_azFL -> Maybe a_azFK) -> EnumMap k a_azFK -> EnumMap k b_azFL -> EnumMap k a_azFK
- Data.EnumMap.Lazy: differenceWithKey :: Enum k => (k -> a_aoPT -> b_aoPU -> Maybe a_aoPT) -> EnumMap k a_aoPT -> EnumMap k b_aoPU -> EnumMap k a_aoPT
+ Data.EnumMap.Lazy: differenceWithKey :: forall k (a_azHg :: Type) (b_azHh :: Type). Enum k => (k -> a_azHg -> b_azHh -> Maybe a_azHg) -> EnumMap k a_azHg -> EnumMap k b_azHh -> EnumMap k a_azHg
- Data.EnumMap.Lazy: elems :: EnumMap k a_agT9 -> [a_agT9]
+ Data.EnumMap.Lazy: elems :: forall k (a_anw1 :: Type). EnumMap k a_anw1 -> [a_anw1]
- Data.EnumMap.Lazy: empty :: EnumMap k a_afIe
+ Data.EnumMap.Lazy: empty :: forall k (a_amsz :: Type). EnumMap k a_amsz
- Data.EnumMap.Lazy: filter :: (a_ahb0 -> Bool) -> EnumMap k a_ahb0 -> EnumMap k a_ahb0
+ Data.EnumMap.Lazy: filter :: forall k (a_anMf :: Type). (a_anMf -> Bool) -> EnumMap k a_anMf -> EnumMap k a_anMf
- Data.EnumMap.Lazy: filterWithKey :: Enum k => (k -> a_ahc8 -> Bool) -> EnumMap k a_ahc8 -> EnumMap k a_ahc8
+ Data.EnumMap.Lazy: filterWithKey :: forall k (a_anNh :: Type). Enum k => (k -> a_anNh -> Bool) -> EnumMap k a_anNh -> EnumMap k a_anNh
- Data.EnumMap.Lazy: findMax :: Enum k => EnumMap k a_ahw5 -> (k, a_ahw5)
+ Data.EnumMap.Lazy: findMax :: forall k (a_ao53 :: Type). Enum k => EnumMap k a_ao53 -> (k, a_ao53)
- Data.EnumMap.Lazy: findMin :: Enum k => EnumMap k a_ahv4 -> (k, a_ahv4)
+ Data.EnumMap.Lazy: findMin :: forall k (a_ao49 :: Type). Enum k => EnumMap k a_ao49 -> (k, a_ao49)
- Data.EnumMap.Lazy: findWithDefault :: Enum k => a_aofO -> k -> EnumMap k a_aofO -> a_aofO
+ Data.EnumMap.Lazy: findWithDefault :: forall k (a_azaX :: Type). Enum k => a_azaX -> k -> EnumMap k a_azaX -> a_azaX
- Data.EnumMap.Lazy: foldMapWithKey :: (Enum k, Monoid m_agKi) => (k -> a_agKh -> m_agKi) -> EnumMap k a_agKh -> m_agKi
+ Data.EnumMap.Lazy: foldMapWithKey :: forall k (m_ano0 :: Type) (a_ano1 :: Type). (Enum k, Monoid m_ano0) => (k -> a_ano1 -> m_ano0) -> EnumMap k a_ano1 -> m_ano0
- Data.EnumMap.Lazy: foldl :: (a_agEF -> b_agEG -> a_agEF) -> a_agEF -> EnumMap k b_agEG -> a_agEF
+ Data.EnumMap.Lazy: foldl :: forall k (a_aniW :: Type) (b_aniX :: Type). (a_aniW -> b_aniX -> a_aniW) -> a_aniW -> EnumMap k b_aniX -> a_aniW
- Data.EnumMap.Lazy: foldl' :: (a_agNx -> b_agNy -> a_agNx) -> a_agNx -> EnumMap k b_agNy -> a_agNx
+ Data.EnumMap.Lazy: foldl' :: forall k (a_anqX :: Type) (b_anqY :: Type). (a_anqX -> b_anqY -> a_anqX) -> a_anqX -> EnumMap k b_anqY -> a_anqX
- Data.EnumMap.Lazy: foldlWithKey :: Enum k => (a_agIi -> k -> b_agIj -> a_agIi) -> a_agIi -> EnumMap k b_agIj -> a_agIi
+ Data.EnumMap.Lazy: foldlWithKey :: forall k (a_anmd :: Type) (b_anme :: Type). Enum k => (a_anmd -> k -> b_anme -> a_anmd) -> a_anmd -> EnumMap k b_anme -> a_anmd
- Data.EnumMap.Lazy: foldlWithKey' :: Enum k => (a_agRa -> k -> b_agRb -> a_agRa) -> a_agRa -> EnumMap k b_agRb -> a_agRa
+ Data.EnumMap.Lazy: foldlWithKey' :: forall k (a_anue :: Type) (b_anuf :: Type). Enum k => (a_anue -> k -> b_anuf -> a_anue) -> a_anue -> EnumMap k b_anuf -> a_anue
- Data.EnumMap.Lazy: foldr :: (a_agD1 -> b_agD2 -> b_agD2) -> b_agD2 -> EnumMap k a_agD1 -> b_agD2
+ Data.EnumMap.Lazy: foldr :: forall k (a_anhs :: Type) (b_anht :: Type). (a_anhs -> b_anht -> b_anht) -> b_anht -> EnumMap k a_anhs -> b_anht
- Data.EnumMap.Lazy: foldr' :: (a_agLT -> b_agLU -> b_agLU) -> b_agLU -> EnumMap k a_agLT -> b_agLU
+ Data.EnumMap.Lazy: foldr' :: forall k (a_anpt :: Type) (b_anpu :: Type). (a_anpt -> b_anpu -> b_anpu) -> b_anpu -> EnumMap k a_anpt -> b_anpu
- Data.EnumMap.Lazy: foldrWithKey :: Enum k => (k -> a_agGj -> b_agGk -> b_agGk) -> b_agGk -> EnumMap k a_agGj -> b_agGk
+ Data.EnumMap.Lazy: foldrWithKey :: forall k (a_ankq :: Type) (b_ankr :: Type). Enum k => (k -> a_ankq -> b_ankr -> b_ankr) -> b_ankr -> EnumMap k a_ankq -> b_ankr
- Data.EnumMap.Lazy: foldrWithKey' :: Enum k => (k -> a_agPb -> b_agPc -> b_agPc) -> b_agPc -> EnumMap k a_agPb -> b_agPc
+ Data.EnumMap.Lazy: foldrWithKey' :: forall k (a_ansr :: Type) (b_anss :: Type). Enum k => (k -> a_ansr -> b_anss -> b_anss) -> b_anss -> EnumMap k a_ansr -> b_anss
- Data.EnumMap.Lazy: fromAscList :: Enum k => [(k, a_apID)] -> EnumMap k a_apID
+ Data.EnumMap.Lazy: fromAscList :: forall k (a_aAuo :: Type). Enum k => [(k, a_aAuo)] -> EnumMap k a_aAuo
- Data.EnumMap.Lazy: fromAscListWith :: Enum k => (a_apJE -> a_apJE -> a_apJE) -> [(k, a_apJE)] -> EnumMap k a_apJE
+ Data.EnumMap.Lazy: fromAscListWith :: forall k (a_aAvk :: Type). Enum k => (a_aAvk -> a_aAvk -> a_aAvk) -> [(k, a_aAvk)] -> EnumMap k a_aAvk
- Data.EnumMap.Lazy: fromAscListWithKey :: Enum k => (k -> a_apLl -> a_apLl -> a_apLl) -> [(k, a_apLl)] -> EnumMap k a_apLl
+ Data.EnumMap.Lazy: fromAscListWithKey :: forall k (a_aAwQ :: Type). Enum k => (k -> a_aAwQ -> a_aAwQ -> a_aAwQ) -> [(k, a_aAwQ)] -> EnumMap k a_aAwQ
- Data.EnumMap.Lazy: fromDistinctAscList :: Enum k => [(k, a_apNh)] -> EnumMap k a_apNh
+ Data.EnumMap.Lazy: fromDistinctAscList :: forall k (a_aAyz :: Type). Enum k => [(k, a_aAyz)] -> EnumMap k a_aAyz
- Data.EnumMap.Lazy: fromList :: Enum k => [(k, a_apBX)] -> EnumMap k a_apBX
+ Data.EnumMap.Lazy: fromList :: forall k (a_aAon :: Type). Enum k => [(k, a_aAon)] -> EnumMap k a_aAon
- Data.EnumMap.Lazy: fromListWith :: Enum k => (a_apCY -> a_apCY -> a_apCY) -> [(k, a_apCY)] -> EnumMap k a_apCY
+ Data.EnumMap.Lazy: fromListWith :: forall k (a_aApj :: Type). Enum k => (a_aApj -> a_aApj -> a_aApj) -> [(k, a_aApj)] -> EnumMap k a_aApj
- Data.EnumMap.Lazy: fromListWithKey :: Enum k => (k -> a_apEF -> a_apEF -> a_apEF) -> [(k, a_apEF)] -> EnumMap k a_apEF
+ Data.EnumMap.Lazy: fromListWithKey :: forall k (a_aAqP :: Type). Enum k => (k -> a_aAqP -> a_aAqP -> a_aAqP) -> [(k, a_aAqP)] -> EnumMap k a_aAqP
- Data.EnumMap.Lazy: fromSet :: Enum k => (k -> a_apzI) -> EnumSet k -> EnumMap k a_apzI
+ Data.EnumMap.Lazy: fromSet :: forall k (a_aAmk :: Type). Enum k => (k -> a_aAmk) -> EnumSet k -> EnumMap k a_aAmk
- Data.EnumMap.Lazy: insert :: Enum k => k -> a_aonH -> EnumMap k a_aonH -> EnumMap k a_aonH
+ Data.EnumMap.Lazy: insert :: forall k (a_azi3 :: Type). Enum k => k -> a_azi3 -> EnumMap k a_azi3 -> EnumMap k a_azi3
- Data.EnumMap.Lazy: insertLookupWithKey :: Enum k => (k -> a_aot1 -> a_aot1 -> a_aot1) -> k -> a_aot1 -> EnumMap k a_aot1 -> (Maybe a_aot1, EnumMap k a_aot1)
+ Data.EnumMap.Lazy: insertLookupWithKey :: forall k (a_azmR :: Type). Enum k => (k -> a_azmR -> a_azmR -> a_azmR) -> k -> a_azmR -> EnumMap k a_azmR -> (Maybe a_azmR, EnumMap k a_azmR)
- Data.EnumMap.Lazy: insertWith :: Enum k => (a_aooW -> a_aooW -> a_aooW) -> k -> a_aooW -> EnumMap k a_aooW -> EnumMap k a_aooW
+ Data.EnumMap.Lazy: insertWith :: forall k (a_azjc :: Type). Enum k => (a_azjc -> a_azjc -> a_azjc) -> k -> a_azjc -> EnumMap k a_azjc -> EnumMap k a_azjc
- Data.EnumMap.Lazy: insertWithKey :: Enum k => (k -> a_aoqR -> a_aoqR -> a_aoqR) -> k -> a_aoqR -> EnumMap k a_aoqR -> EnumMap k a_aoqR
+ Data.EnumMap.Lazy: insertWithKey :: forall k (a_azkV :: Type). Enum k => (k -> a_azkV -> a_azkV -> a_azkV) -> k -> a_azkV -> EnumMap k a_azkV -> EnumMap k a_azkV
- Data.EnumMap.Lazy: intersection :: EnumMap k a_agdW -> EnumMap k b_agdX -> EnumMap k a_agdW
+ Data.EnumMap.Lazy: intersection :: forall k (a_amV1 :: Type) (b_amV2 :: Type). EnumMap k a_amV1 -> EnumMap k b_amV2 -> EnumMap k a_amV1
- Data.EnumMap.Lazy: intersectionWith :: (a_aoSV -> b_aoSW -> c_aoSX) -> EnumMap k a_aoSV -> EnumMap k b_aoSW -> EnumMap k c_aoSX
+ Data.EnumMap.Lazy: intersectionWith :: forall k (a_azJZ :: Type) (b_azK0 :: Type) (c_azK1 :: Type). (a_azJZ -> b_azK0 -> c_azK1) -> EnumMap k a_azJZ -> EnumMap k b_azK0 -> EnumMap k c_azK1
- Data.EnumMap.Lazy: intersectionWithKey :: Enum k => (k -> a_aoUH -> b_aoUI -> c_aoUJ) -> EnumMap k a_aoUH -> EnumMap k b_aoUI -> EnumMap k c_aoUJ
+ Data.EnumMap.Lazy: intersectionWithKey :: forall k (a_azLA :: Type) (b_azLB :: Type) (c_azLC :: Type). Enum k => (k -> a_azLA -> b_azLB -> c_azLC) -> EnumMap k a_azLA -> EnumMap k b_azLB -> EnumMap k c_azLC
- Data.EnumMap.Lazy: isProperSubmapOf :: Eq a_ahsm => EnumMap k a_ahsm -> EnumMap k a_ahsm -> Bool
+ Data.EnumMap.Lazy: isProperSubmapOf :: forall k (a_ao1H :: Type). Eq a_ao1H => EnumMap k a_ao1H -> EnumMap k a_ao1H -> Bool
- Data.EnumMap.Lazy: isProperSubmapOfBy :: (a_ahto -> b_ahtp -> Bool) -> EnumMap k a_ahto -> EnumMap k b_ahtp -> Bool
+ Data.EnumMap.Lazy: isProperSubmapOfBy :: forall k (a_ao2E :: Type) (b_ao2F :: Type). (a_ao2E -> b_ao2F -> Bool) -> EnumMap k a_ao2E -> EnumMap k b_ao2F -> Bool
- Data.EnumMap.Lazy: isSubmapOf :: Eq a_ahpE => EnumMap k a_ahpE -> EnumMap k a_ahpE -> Bool
+ Data.EnumMap.Lazy: isSubmapOf :: forall k (a_anZf :: Type). Eq a_anZf => EnumMap k a_anZf -> EnumMap k a_anZf -> Bool
- Data.EnumMap.Lazy: isSubmapOfBy :: (a_ahqG -> b_ahqH -> Bool) -> EnumMap k a_ahqG -> EnumMap k b_ahqH -> Bool
+ Data.EnumMap.Lazy: isSubmapOfBy :: forall k (a_ao0c :: Type) (b_ao0d :: Type). (a_ao0c -> b_ao0d -> Bool) -> EnumMap k a_ao0c -> EnumMap k b_ao0d -> Bool
- Data.EnumMap.Lazy: keys :: Enum k => EnumMap k a_agTR -> [k]
+ Data.EnumMap.Lazy: keys :: forall k (a_anwG :: Type). Enum k => EnumMap k a_anwG -> [k]
- Data.EnumMap.Lazy: keysSet :: EnumMap k a_agVI -> EnumSet k
+ Data.EnumMap.Lazy: keysSet :: forall k (a_anyo :: Type). EnumMap k a_anyo -> EnumSet k
- Data.EnumMap.Lazy: lookup :: Enum k => k -> EnumMap k a_afAx -> Maybe a_afAx
+ Data.EnumMap.Lazy: lookup :: forall k (a_amlJ :: Type). Enum k => k -> EnumMap k a_amlJ -> Maybe a_amlJ
- Data.EnumMap.Lazy: lookupGE :: Enum k => k -> EnumMap k a_afGT -> Maybe (k, a_afGT)
+ Data.EnumMap.Lazy: lookupGE :: forall k (a_amro :: Type). Enum k => k -> EnumMap k a_amro -> Maybe (k, a_amro)
- Data.EnumMap.Lazy: lookupGT :: Enum k => k -> EnumMap k a_afEd -> Maybe (k, a_afEd)
+ Data.EnumMap.Lazy: lookupGT :: forall k (a_amp2 :: Type). Enum k => k -> EnumMap k a_amp2 -> Maybe (k, a_amp2)
- Data.EnumMap.Lazy: lookupLE :: Enum k => k -> EnumMap k a_afFy -> Maybe (k, a_afFy)
+ Data.EnumMap.Lazy: lookupLE :: forall k (a_amqd :: Type). Enum k => k -> EnumMap k a_amqd -> Maybe (k, a_amqd)
- Data.EnumMap.Lazy: lookupLT :: Enum k => k -> EnumMap k a_afCS -> Maybe (k, a_afCS)
+ Data.EnumMap.Lazy: lookupLT :: forall k (a_amnR :: Type). Enum k => k -> EnumMap k a_amnR -> Maybe (k, a_amnR)
- Data.EnumMap.Lazy: map :: (a_aoZW -> b_aoZX) -> EnumMap k a_aoZW -> EnumMap k b_aoZX
+ Data.EnumMap.Lazy: map :: forall k (a_azQe :: Type) (b_azQf :: Type). (a_azQe -> b_azQf) -> EnumMap k a_azQe -> EnumMap k b_azQf
- Data.EnumMap.Lazy: mapAccum :: (a_ap4u -> b_ap4v -> (a_ap4u, c_ap4w)) -> a_ap4u -> EnumMap k b_ap4v -> (a_ap4u, EnumMap k c_ap4w)
+ Data.EnumMap.Lazy: mapAccum :: forall k (a_azUm :: Type) (b_azUn :: Type) (c_azUo :: Type). (a_azUm -> b_azUn -> (a_azUm, c_azUo)) -> a_azUm -> EnumMap k b_azUn -> (a_azUm, EnumMap k c_azUo)
- Data.EnumMap.Lazy: mapAccumRWithKey :: Enum k => (a_ap9i -> k -> b_ap9j -> (a_ap9i, c_ap9k)) -> a_ap9i -> EnumMap k b_ap9j -> (a_ap9i, EnumMap k c_ap9k)
+ Data.EnumMap.Lazy: mapAccumRWithKey :: forall k (a_azYu :: Type) (b_azYv :: Type) (c_azYw :: Type). Enum k => (a_azYu -> k -> b_azYv -> (a_azYu, c_azYw)) -> a_azYu -> EnumMap k b_azYv -> (a_azYu, EnumMap k c_azYw)
- Data.EnumMap.Lazy: mapAccumWithKey :: Enum k => (a_ap6J -> k -> b_ap6K -> (a_ap6J, c_ap6L)) -> a_ap6J -> EnumMap k b_ap6K -> (a_ap6J, EnumMap k c_ap6L)
+ Data.EnumMap.Lazy: mapAccumWithKey :: forall k (a_azWh :: Type) (b_azWi :: Type) (c_azWj :: Type). Enum k => (a_azWh -> k -> b_azWi -> (a_azWh, c_azWj)) -> a_azWh -> EnumMap k b_azWi -> (a_azWh, EnumMap k c_azWj)
- Data.EnumMap.Lazy: mapEither :: (a_apWK -> Either b_apWL c_apWM) -> EnumMap k a_apWK -> (EnumMap k b_apWL, EnumMap k c_apWM)
+ Data.EnumMap.Lazy: mapEither :: forall k (a_aAH5 :: Type) (b_aAH6 :: Type) (c_aAH7 :: Type). (a_aAH5 -> Either b_aAH6 c_aAH7) -> EnumMap k a_aAH5 -> (EnumMap k b_aAH6, EnumMap k c_aAH7)
- Data.EnumMap.Lazy: mapEitherWithKey :: Enum k => (k -> a_apYk -> Either b_apYl c_apYm) -> EnumMap k a_apYk -> (EnumMap k b_apYl, EnumMap k c_apYm)
+ Data.EnumMap.Lazy: mapEitherWithKey :: forall k (a_aAIt :: Type) (b_aAIu :: Type) (c_aAIv :: Type). Enum k => (k -> a_aAIt -> Either b_aAIu c_aAIv) -> EnumMap k a_aAIt -> (EnumMap k b_aAIu, EnumMap k c_aAIv)
- Data.EnumMap.Lazy: mapKeys :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_agy8 -> EnumMap k' a_agy8
+ Data.EnumMap.Lazy: mapKeys :: forall k k' (a_and0 :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_and0 -> EnumMap k' a_and0
- Data.EnumMap.Lazy: mapKeysMonotonic :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_agBC -> EnumMap k' a_agBC
+ Data.EnumMap.Lazy: mapKeysMonotonic :: forall k k' (a_anga :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_anga -> EnumMap k' a_anga
- Data.EnumMap.Lazy: mapKeysWith :: (Enum k, Enum k') => (a_apdf -> a_apdf -> a_apdf) -> (k -> k') -> EnumMap k a_apdf -> EnumMap k' a_apdf
+ Data.EnumMap.Lazy: mapKeysWith :: forall k k' (a_aA1Y :: Type). (Enum k, Enum k') => (a_aA1Y -> a_aA1Y -> a_aA1Y) -> (k -> k') -> EnumMap k a_aA1Y -> EnumMap k' a_aA1Y
- Data.EnumMap.Lazy: mapMaybe :: (a_apTX -> Maybe b_apTY) -> EnumMap k a_apTX -> EnumMap k b_apTY
+ Data.EnumMap.Lazy: mapMaybe :: forall k (a_aAEy :: Type) (b_aAEz :: Type). (a_aAEy -> Maybe b_aAEz) -> EnumMap k a_aAEy -> EnumMap k b_aAEz
- Data.EnumMap.Lazy: mapMaybeWithKey :: Enum k => (k -> a_apVb -> Maybe b_apVc) -> EnumMap k a_apVb -> EnumMap k b_apVc
+ Data.EnumMap.Lazy: mapMaybeWithKey :: forall k (a_aAFF :: Type) (b_aAFG :: Type). Enum k => (k -> a_aAFF -> Maybe b_aAFG) -> EnumMap k a_aAFF -> EnumMap k b_aAFG
- Data.EnumMap.Lazy: mapWithKey :: Enum k => (k -> a_ap19 -> b_ap1a) -> EnumMap k a_ap19 -> EnumMap k b_ap1a
+ Data.EnumMap.Lazy: mapWithKey :: forall k (a_azRl :: Type) (b_azRm :: Type). Enum k => (k -> a_azRl -> b_azRm) -> EnumMap k a_azRl -> EnumMap k b_azRm
- Data.EnumMap.Lazy: maxView :: EnumMap k a_ahHd -> Maybe (a_ahHd, EnumMap k a_ahHd)
+ Data.EnumMap.Lazy: maxView :: forall k (a_aof0 :: Type). EnumMap k a_aof0 -> Maybe (a_aof0, EnumMap k a_aof0)
- Data.EnumMap.Lazy: maxViewWithKey :: Enum k => EnumMap k a_ahJw -> Maybe ((k, a_ahJw), EnumMap k a_ahJw)
+ Data.EnumMap.Lazy: maxViewWithKey :: forall k (a_aoh0 :: Type). Enum k => EnumMap k a_aoh0 -> Maybe ((k, a_aoh0), EnumMap k a_aoh0)
- Data.EnumMap.Lazy: member :: Enum k => k -> EnumMap k a_afyx -> Bool
+ Data.EnumMap.Lazy: member :: forall k (a_amjR :: Type). Enum k => k -> EnumMap k a_amjR -> Bool
- Data.EnumMap.Lazy: mergeWithKey :: Enum k => (k -> a_aoWO -> b_aoWP -> Maybe c_aoWQ) -> (EnumMap k a_aoWO -> EnumMap k c_aoWQ) -> (EnumMap k b_aoWP -> EnumMap k c_aoWQ) -> EnumMap k a_aoWO -> EnumMap k b_aoWP -> EnumMap k c_aoWQ
+ Data.EnumMap.Lazy: mergeWithKey :: forall k (a_azNu :: Type) (b_azNv :: Type) (c_azNw :: Type). Enum k => (k -> a_azNu -> b_azNv -> Maybe c_azNw) -> (EnumMap k a_azNu -> EnumMap k c_azNw) -> (EnumMap k b_azNv -> EnumMap k c_azNw) -> EnumMap k a_azNu -> EnumMap k b_azNv -> EnumMap k c_azNw
- Data.EnumMap.Lazy: minView :: EnumMap k a_ahGc -> Maybe (a_ahGc, EnumMap k a_ahGc)
+ Data.EnumMap.Lazy: minView :: forall k (a_aoe7 :: Type). EnumMap k a_aoe7 -> Maybe (a_aoe7, EnumMap k a_aoe7)
- Data.EnumMap.Lazy: minViewWithKey :: Enum k => EnumMap k a_ahIe -> Maybe ((k, a_ahIe), EnumMap k a_ahIe)
+ Data.EnumMap.Lazy: minViewWithKey :: forall k (a_aofT :: Type). Enum k => EnumMap k a_aofT -> Maybe ((k, a_aofT), EnumMap k a_aofT)
- Data.EnumMap.Lazy: notMember :: Enum k => k -> EnumMap k a_afzx -> Bool
+ Data.EnumMap.Lazy: notMember :: forall k (a_amkN :: Type). Enum k => k -> EnumMap k a_amkN -> Bool
- Data.EnumMap.Lazy: null :: EnumMap k a_afxd -> Bool
+ Data.EnumMap.Lazy: null :: forall k (a_amiB :: Type). EnumMap k a_amiB -> Bool
- Data.EnumMap.Lazy: partition :: (a_ahdB -> Bool) -> EnumMap k a_ahdB -> (EnumMap k a_ahdB, EnumMap k a_ahdB)
+ Data.EnumMap.Lazy: partition :: forall k (a_anOC :: Type). (a_anOC -> Bool) -> EnumMap k a_anOC -> (EnumMap k a_anOC, EnumMap k a_anOC)
- Data.EnumMap.Lazy: partitionWithKey :: Enum k => (k -> a_ahf0 -> Bool) -> EnumMap k a_ahf0 -> (EnumMap k a_ahf0, EnumMap k a_ahf0)
+ Data.EnumMap.Lazy: partitionWithKey :: forall k (a_anPQ :: Type). Enum k => (k -> a_anPQ -> Bool) -> EnumMap k a_anPQ -> (EnumMap k a_anPQ, EnumMap k a_anPQ)
- Data.EnumMap.Lazy: showTree :: Show a_ahKO => EnumMap k a_ahKO -> String
+ Data.EnumMap.Lazy: showTree :: forall k (a_aoi7 :: Type). Show a_aoi7 => EnumMap k a_aoi7 -> String
- Data.EnumMap.Lazy: showTreeWith :: Show a_ahLA => Bool -> Bool -> EnumMap k a_ahLA -> String
+ Data.EnumMap.Lazy: showTreeWith :: forall k (a_aoiR :: Type). Show a_aoiR => Bool -> Bool -> EnumMap k a_aoiR -> String
- Data.EnumMap.Lazy: singleton :: Enum k => k -> a_aomI -> EnumMap k a_aomI
+ Data.EnumMap.Lazy: singleton :: forall k (a_azh7 :: Type). Enum k => k -> a_azh7 -> EnumMap k a_azh7
- Data.EnumMap.Lazy: size :: EnumMap k a_afxS -> Int
+ Data.EnumMap.Lazy: size :: forall k (a_amje :: Type). EnumMap k a_amje -> Int
- Data.EnumMap.Lazy: split :: Enum k => k -> EnumMap k a_ahn0 -> (EnumMap k a_ahn0, EnumMap k a_ahn0)
+ Data.EnumMap.Lazy: split :: forall k (a_anWX :: Type). Enum k => k -> EnumMap k a_anWX -> (EnumMap k a_anWX, EnumMap k a_anWX)
- Data.EnumMap.Lazy: splitLookup :: Enum k => k -> EnumMap k a_ahoh -> (EnumMap k a_ahoh, Maybe a_ahoh, EnumMap k a_ahoh)
+ Data.EnumMap.Lazy: splitLookup :: forall k (a_anY5 :: Type). Enum k => k -> EnumMap k a_anY5 -> (EnumMap k a_anY5, Maybe a_anY5, EnumMap k a_anY5)
- Data.EnumMap.Lazy: toAscList :: Enum k => EnumMap k a_ah3h -> [(k, a_ah3h)]
+ Data.EnumMap.Lazy: toAscList :: forall k (a_anFg :: Type). Enum k => EnumMap k a_anFg -> [(k, a_anFg)]
- Data.EnumMap.Lazy: toDescList :: Enum k => EnumMap k a_ah4j -> [(k, a_ah4j)]
+ Data.EnumMap.Lazy: toDescList :: forall k (a_anGc :: Type). Enum k => EnumMap k a_anGc -> [(k, a_anGc)]
- Data.EnumMap.Lazy: toList :: Enum k => EnumMap k a_agXB -> [(k, a_agXB)]
+ Data.EnumMap.Lazy: toList :: forall k (a_anA9 :: Type). Enum k => EnumMap k a_anA9 -> [(k, a_anA9)]
- Data.EnumMap.Lazy: traverseWithKey :: (Enum k, Applicative t_agoK) => (k -> a_agoJ -> t_agoK b_agoL) -> EnumMap k a_agoJ -> t_agoK (EnumMap k b_agoL)
+ Data.EnumMap.Lazy: traverseWithKey :: forall k (t_an4J :: Type -> Type) (a_an4K :: Type) (b_an4L :: Type). (Enum k, Applicative t_an4J) => (k -> a_an4K -> t_an4J b_an4L) -> EnumMap k a_an4K -> t_an4J (EnumMap k b_an4L)
- Data.EnumMap.Lazy: union :: EnumMap k a_ag2x -> EnumMap k a_ag2x -> EnumMap k a_ag2x
+ Data.EnumMap.Lazy: union :: forall k (a_amKM :: Type). EnumMap k a_amKM -> EnumMap k a_amKM -> EnumMap k a_amKM
- Data.EnumMap.Lazy: unionWith :: (a_aoHw -> a_aoHw -> a_aoHw) -> EnumMap k a_aoHw -> EnumMap k a_aoHw -> EnumMap k a_aoHw
+ Data.EnumMap.Lazy: unionWith :: forall k (a_azzK :: Type). (a_azzK -> a_azzK -> a_azzK) -> EnumMap k a_azzK -> EnumMap k a_azzK -> EnumMap k a_azzK
- Data.EnumMap.Lazy: unionWithKey :: Enum k => (k -> a_aoJ8 -> a_aoJ8 -> a_aoJ8) -> EnumMap k a_aoJ8 -> EnumMap k a_aoJ8 -> EnumMap k a_aoJ8
+ Data.EnumMap.Lazy: unionWithKey :: forall k (a_azBb :: Type). Enum k => (k -> a_azBb -> a_azBb -> a_azBb) -> EnumMap k a_azBb -> EnumMap k a_azBb -> EnumMap k a_azBb
- Data.EnumMap.Lazy: unions :: [EnumMap k a_ag72] -> EnumMap k a_ag72
+ Data.EnumMap.Lazy: unions :: forall k (a_amOO :: Type). [EnumMap k a_amOO] -> EnumMap k a_amOO
- Data.EnumMap.Lazy: unionsWith :: (a_aoLN -> a_aoLN -> a_aoLN) -> [EnumMap k a_aoLN] -> EnumMap k a_aoLN
+ Data.EnumMap.Lazy: unionsWith :: forall k (a_azDA :: Type). (a_azDA -> a_azDA -> a_azDA) -> [EnumMap k a_azDA] -> EnumMap k a_azDA
- Data.EnumMap.Lazy: update :: Enum k => (a_aozI -> Maybe a_aozI) -> k -> EnumMap k a_aozI -> EnumMap k a_aozI
+ Data.EnumMap.Lazy: update :: forall k (a_azsQ :: Type). Enum k => (a_azsQ -> Maybe a_azsQ) -> k -> EnumMap k a_azsQ -> EnumMap k a_azsQ
- Data.EnumMap.Lazy: updateLookupWithKey :: Enum k => (k -> a_aoCV -> Maybe a_aoCV) -> k -> EnumMap k a_aoCV -> (Maybe a_aoCV, EnumMap k a_aoCV)
+ Data.EnumMap.Lazy: updateLookupWithKey :: forall k (a_azvJ :: Type). Enum k => (k -> a_azvJ -> Maybe a_azvJ) -> k -> EnumMap k a_azvJ -> (Maybe a_azvJ, EnumMap k a_azvJ)
- Data.EnumMap.Lazy: updateMax :: (a_aqf5 -> Maybe a_aqf5) -> EnumMap k a_aqf5 -> EnumMap k a_aqf5
+ Data.EnumMap.Lazy: updateMax :: forall k (a_aAXn :: Type). (a_aAXn -> Maybe a_aAXn) -> EnumMap k a_aAXn -> EnumMap k a_aAXn
- Data.EnumMap.Lazy: updateMaxWithKey :: Enum k => (k -> a_aqhI -> Maybe a_aqhI) -> EnumMap k a_aqhI -> EnumMap k a_aqhI
+ Data.EnumMap.Lazy: updateMaxWithKey :: forall k (a_aAZK :: Type). Enum k => (k -> a_aAZK -> Maybe a_aAZK) -> EnumMap k a_aAZK -> EnumMap k a_aAZK
- Data.EnumMap.Lazy: updateMin :: (a_aqdW -> Maybe a_aqdW) -> EnumMap k a_aqdW -> EnumMap k a_aqdW
+ Data.EnumMap.Lazy: updateMin :: forall k (a_aAWl :: Type). (a_aAWl -> Maybe a_aAWl) -> EnumMap k a_aAWl -> EnumMap k a_aAWl
- Data.EnumMap.Lazy: updateMinWithKey :: Enum k => (k -> a_aqge -> Maybe a_aqge) -> EnumMap k a_aqge -> EnumMap k a_aqge
+ Data.EnumMap.Lazy: updateMinWithKey :: forall k (a_aAYp :: Type). Enum k => (k -> a_aAYp -> Maybe a_aAYp) -> EnumMap k a_aAYp -> EnumMap k a_aAYp
- Data.EnumMap.Lazy: updateWithKey :: Enum k => (k -> a_aoBc -> Maybe a_aoBc) -> k -> EnumMap k a_aoBc -> EnumMap k a_aoBc
+ Data.EnumMap.Lazy: updateWithKey :: forall k (a_azub :: Type). Enum k => (k -> a_azub -> Maybe a_azub) -> k -> EnumMap k a_azub -> EnumMap k a_azub
- Data.EnumMap.Strict: (!) :: Enum k => EnumMap k a_afvc -> k -> a_afvc
+ Data.EnumMap.Strict: (!) :: forall k (a_amgJ :: Type). Enum k => EnumMap k a_amgJ -> k -> a_amgJ
- Data.EnumMap.Strict: (\\) :: EnumMap k a_afwc -> EnumMap k b_afwd -> EnumMap k a_afwc
+ Data.EnumMap.Strict: (\\) :: forall k (a_amhF :: Type) (b_amhG :: Type). EnumMap k a_amhF -> EnumMap k b_amhG -> EnumMap k a_amhF
- Data.EnumMap.Strict: adjust :: Enum k => (a_afSt -> a_afSt) -> k -> EnumMap k a_afSt -> EnumMap k a_afSt
+ Data.EnumMap.Strict: adjust :: forall k (a_amBP :: Type). Enum k => (a_amBP -> a_amBP) -> k -> EnumMap k a_amBP -> EnumMap k a_amBP
- Data.EnumMap.Strict: adjustWithKey :: Enum k => (k -> a_afTW -> a_afTW) -> k -> EnumMap k a_afTW -> EnumMap k a_afTW
+ Data.EnumMap.Strict: adjustWithKey :: forall k (a_amDa :: Type). Enum k => (k -> a_amDa -> a_amDa) -> k -> EnumMap k a_amDa -> EnumMap k a_amDa
- Data.EnumMap.Strict: alter :: Enum k => (Maybe a_ag0W -> Maybe a_ag0W) -> k -> EnumMap k a_ag0W -> EnumMap k a_ag0W
+ Data.EnumMap.Strict: alter :: forall k (a_amJn :: Type). Enum k => (Maybe a_amJn -> Maybe a_amJn) -> k -> EnumMap k a_amJn -> EnumMap k a_amJn
- Data.EnumMap.Strict: assocs :: Enum k => EnumMap k a_agUG -> [(k, a_agUG)]
+ Data.EnumMap.Strict: assocs :: forall k (a_anxs :: Type). Enum k => EnumMap k a_anxs -> [(k, a_anxs)]
- Data.EnumMap.Strict: delete :: Enum k => k -> EnumMap k a_afRs -> EnumMap k a_afRs
+ Data.EnumMap.Strict: delete :: forall k (a_amAS :: Type). Enum k => k -> EnumMap k a_amAS -> EnumMap k a_amAS
- Data.EnumMap.Strict: deleteFindMax :: Enum k => EnumMap k a_ahzH -> ((k, a_ahzH), EnumMap k a_ahzH)
+ Data.EnumMap.Strict: deleteFindMax :: forall k (a_ao8j :: Type). Enum k => EnumMap k a_ao8j -> ((k, a_ao8j), EnumMap k a_ao8j)
- Data.EnumMap.Strict: deleteFindMin :: Enum k => EnumMap k a_ahys -> ((k, a_ahys), EnumMap k a_ahys)
+ Data.EnumMap.Strict: deleteFindMin :: forall k (a_ao7f :: Type). Enum k => EnumMap k a_ao7f -> ((k, a_ao7f), EnumMap k a_ao7f)
- Data.EnumMap.Strict: deleteMax :: EnumMap k a_ahxM -> EnumMap k a_ahxM
+ Data.EnumMap.Strict: deleteMax :: forall k (a_ao6B :: Type). EnumMap k a_ao6B -> EnumMap k a_ao6B
- Data.EnumMap.Strict: deleteMin :: EnumMap k a_ahx6 -> EnumMap k a_ahx6
+ Data.EnumMap.Strict: deleteMin :: forall k (a_ao5X :: Type). EnumMap k a_ao5X -> EnumMap k a_ao5X
- Data.EnumMap.Strict: difference :: EnumMap k a_ag9a -> EnumMap k b_ag9b -> EnumMap k a_ag9a
+ Data.EnumMap.Strict: difference :: forall k (a_amQK :: Type) (b_amQL :: Type). EnumMap k a_amQK -> EnumMap k b_amQL -> EnumMap k a_amQK
- Data.EnumMap.Strict: differenceWith :: (a_agab -> b_agac -> Maybe a_agab) -> EnumMap k a_agab -> EnumMap k b_agac -> EnumMap k a_agab
+ Data.EnumMap.Strict: differenceWith :: forall k (a_amRG :: Type) (b_amRH :: Type). (a_amRG -> b_amRH -> Maybe a_amRG) -> EnumMap k a_amRG -> EnumMap k b_amRH -> EnumMap k a_amRG
- Data.EnumMap.Strict: differenceWithKey :: Enum k => (k -> a_agbT -> b_agbU -> Maybe a_agbT) -> EnumMap k a_agbT -> EnumMap k b_agbU -> EnumMap k a_agbT
+ Data.EnumMap.Strict: differenceWithKey :: forall k (a_amTc :: Type) (b_amTd :: Type). Enum k => (k -> a_amTc -> b_amTd -> Maybe a_amTc) -> EnumMap k a_amTc -> EnumMap k b_amTd -> EnumMap k a_amTc
- Data.EnumMap.Strict: elems :: EnumMap k a_agT9 -> [a_agT9]
+ Data.EnumMap.Strict: elems :: forall k (a_anw1 :: Type). EnumMap k a_anw1 -> [a_anw1]
- Data.EnumMap.Strict: empty :: EnumMap k a_afIe
+ Data.EnumMap.Strict: empty :: forall k (a_amsz :: Type). EnumMap k a_amsz
- Data.EnumMap.Strict: filter :: (a_ahb0 -> Bool) -> EnumMap k a_ahb0 -> EnumMap k a_ahb0
+ Data.EnumMap.Strict: filter :: forall k (a_anMf :: Type). (a_anMf -> Bool) -> EnumMap k a_anMf -> EnumMap k a_anMf
- Data.EnumMap.Strict: filterWithKey :: Enum k => (k -> a_ahc8 -> Bool) -> EnumMap k a_ahc8 -> EnumMap k a_ahc8
+ Data.EnumMap.Strict: filterWithKey :: forall k (a_anNh :: Type). Enum k => (k -> a_anNh -> Bool) -> EnumMap k a_anNh -> EnumMap k a_anNh
- Data.EnumMap.Strict: findMax :: Enum k => EnumMap k a_ahw5 -> (k, a_ahw5)
+ Data.EnumMap.Strict: findMax :: forall k (a_ao53 :: Type). Enum k => EnumMap k a_ao53 -> (k, a_ao53)
- Data.EnumMap.Strict: findMin :: Enum k => EnumMap k a_ahv4 -> (k, a_ahv4)
+ Data.EnumMap.Strict: findMin :: forall k (a_ao49 :: Type). Enum k => EnumMap k a_ao49 -> (k, a_ao49)
- Data.EnumMap.Strict: findWithDefault :: Enum k => a_afBE -> k -> EnumMap k a_afBE -> a_afBE
+ Data.EnumMap.Strict: findWithDefault :: forall k (a_ammJ :: Type). Enum k => a_ammJ -> k -> EnumMap k a_ammJ -> a_ammJ
- Data.EnumMap.Strict: foldMapWithKey :: (Enum k, Monoid m_agKi) => (k -> a_agKh -> m_agKi) -> EnumMap k a_agKh -> m_agKi
+ Data.EnumMap.Strict: foldMapWithKey :: forall k (m_ano0 :: Type) (a_ano1 :: Type). (Enum k, Monoid m_ano0) => (k -> a_ano1 -> m_ano0) -> EnumMap k a_ano1 -> m_ano0
- Data.EnumMap.Strict: foldl :: (a_agEF -> b_agEG -> a_agEF) -> a_agEF -> EnumMap k b_agEG -> a_agEF
+ Data.EnumMap.Strict: foldl :: forall k (a_aniW :: Type) (b_aniX :: Type). (a_aniW -> b_aniX -> a_aniW) -> a_aniW -> EnumMap k b_aniX -> a_aniW
- Data.EnumMap.Strict: foldl' :: (a_agNx -> b_agNy -> a_agNx) -> a_agNx -> EnumMap k b_agNy -> a_agNx
+ Data.EnumMap.Strict: foldl' :: forall k (a_anqX :: Type) (b_anqY :: Type). (a_anqX -> b_anqY -> a_anqX) -> a_anqX -> EnumMap k b_anqY -> a_anqX
- Data.EnumMap.Strict: foldlWithKey :: Enum k => (a_agIi -> k -> b_agIj -> a_agIi) -> a_agIi -> EnumMap k b_agIj -> a_agIi
+ Data.EnumMap.Strict: foldlWithKey :: forall k (a_anmd :: Type) (b_anme :: Type). Enum k => (a_anmd -> k -> b_anme -> a_anmd) -> a_anmd -> EnumMap k b_anme -> a_anmd
- Data.EnumMap.Strict: foldlWithKey' :: Enum k => (a_agRa -> k -> b_agRb -> a_agRa) -> a_agRa -> EnumMap k b_agRb -> a_agRa
+ Data.EnumMap.Strict: foldlWithKey' :: forall k (a_anue :: Type) (b_anuf :: Type). Enum k => (a_anue -> k -> b_anuf -> a_anue) -> a_anue -> EnumMap k b_anuf -> a_anue
- Data.EnumMap.Strict: foldr :: (a_agD1 -> b_agD2 -> b_agD2) -> b_agD2 -> EnumMap k a_agD1 -> b_agD2
+ Data.EnumMap.Strict: foldr :: forall k (a_anhs :: Type) (b_anht :: Type). (a_anhs -> b_anht -> b_anht) -> b_anht -> EnumMap k a_anhs -> b_anht
- Data.EnumMap.Strict: foldr' :: (a_agLT -> b_agLU -> b_agLU) -> b_agLU -> EnumMap k a_agLT -> b_agLU
+ Data.EnumMap.Strict: foldr' :: forall k (a_anpt :: Type) (b_anpu :: Type). (a_anpt -> b_anpu -> b_anpu) -> b_anpu -> EnumMap k a_anpt -> b_anpu
- Data.EnumMap.Strict: foldrWithKey :: Enum k => (k -> a_agGj -> b_agGk -> b_agGk) -> b_agGk -> EnumMap k a_agGj -> b_agGk
+ Data.EnumMap.Strict: foldrWithKey :: forall k (a_ankq :: Type) (b_ankr :: Type). Enum k => (k -> a_ankq -> b_ankr -> b_ankr) -> b_ankr -> EnumMap k a_ankq -> b_ankr
- Data.EnumMap.Strict: foldrWithKey' :: Enum k => (k -> a_agPb -> b_agPc -> b_agPc) -> b_agPc -> EnumMap k a_agPb -> b_agPc
+ Data.EnumMap.Strict: foldrWithKey' :: forall k (a_ansr :: Type) (b_anss :: Type). Enum k => (k -> a_ansr -> b_anss -> b_anss) -> b_anss -> EnumMap k a_ansr -> b_anss
- Data.EnumMap.Strict: fromAscList :: Enum k => [(k, a_ah5l)] -> EnumMap k a_ah5l
+ Data.EnumMap.Strict: fromAscList :: forall k (a_anH8 :: Type). Enum k => [(k, a_anH8)] -> EnumMap k a_anH8
- Data.EnumMap.Strict: fromAscListWith :: Enum k => (a_ah6m -> a_ah6m -> a_ah6m) -> [(k, a_ah6m)] -> EnumMap k a_ah6m
+ Data.EnumMap.Strict: fromAscListWith :: forall k (a_anI4 :: Type). Enum k => (a_anI4 -> a_anI4 -> a_anI4) -> [(k, a_anI4)] -> EnumMap k a_anI4
- Data.EnumMap.Strict: fromAscListWithKey :: Enum k => (k -> a_ah83 -> a_ah83 -> a_ah83) -> [(k, a_ah83)] -> EnumMap k a_ah83
+ Data.EnumMap.Strict: fromAscListWithKey :: forall k (a_anJA :: Type). Enum k => (k -> a_anJA -> a_anJA -> a_anJA) -> [(k, a_anJA)] -> EnumMap k a_anJA
- Data.EnumMap.Strict: fromDistinctAscList :: Enum k => [(k, a_ah9Z)] -> EnumMap k a_ah9Z
+ Data.EnumMap.Strict: fromDistinctAscList :: forall k (a_anLj :: Type). Enum k => [(k, a_anLj)] -> EnumMap k a_anLj
- Data.EnumMap.Strict: fromList :: Enum k => [(k, a_agYD)] -> EnumMap k a_agYD
+ Data.EnumMap.Strict: fromList :: forall k (a_anB5 :: Type). Enum k => [(k, a_anB5)] -> EnumMap k a_anB5
- Data.EnumMap.Strict: fromListWith :: Enum k => (a_agZE -> a_agZE -> a_agZE) -> [(k, a_agZE)] -> EnumMap k a_agZE
+ Data.EnumMap.Strict: fromListWith :: forall k (a_anC1 :: Type). Enum k => (a_anC1 -> a_anC1 -> a_anC1) -> [(k, a_anC1)] -> EnumMap k a_anC1
- Data.EnumMap.Strict: fromListWithKey :: Enum k => (k -> a_ah1l -> a_ah1l -> a_ah1l) -> [(k, a_ah1l)] -> EnumMap k a_ah1l
+ Data.EnumMap.Strict: fromListWithKey :: forall k (a_anDx :: Type). Enum k => (k -> a_anDx -> a_anDx -> a_anDx) -> [(k, a_anDx)] -> EnumMap k a_anDx
- Data.EnumMap.Strict: fromSet :: Enum k => (k -> a_agWn) -> EnumSet k -> EnumMap k a_agWn
+ Data.EnumMap.Strict: fromSet :: forall k (a_anz1 :: Type). Enum k => (k -> a_anz1) -> EnumSet k -> EnumMap k a_anz1
- Data.EnumMap.Strict: insert :: Enum k => k -> a_afJC -> EnumMap k a_afJC -> EnumMap k a_afJC
+ Data.EnumMap.Strict: insert :: forall k (a_amtU :: Type). Enum k => k -> a_amtU -> EnumMap k a_amtU -> EnumMap k a_amtU
- Data.EnumMap.Strict: insertLookupWithKey :: Enum k => (k -> a_afOW -> a_afOW -> a_afOW) -> k -> a_afOW -> EnumMap k a_afOW -> (Maybe a_afOW, EnumMap k a_afOW)
+ Data.EnumMap.Strict: insertLookupWithKey :: forall k (a_amyI :: Type). Enum k => (k -> a_amyI -> a_amyI -> a_amyI) -> k -> a_amyI -> EnumMap k a_amyI -> (Maybe a_amyI, EnumMap k a_amyI)
- Data.EnumMap.Strict: insertWith :: Enum k => (a_afKR -> a_afKR -> a_afKR) -> k -> a_afKR -> EnumMap k a_afKR -> EnumMap k a_afKR
+ Data.EnumMap.Strict: insertWith :: forall k (a_amv3 :: Type). Enum k => (a_amv3 -> a_amv3 -> a_amv3) -> k -> a_amv3 -> EnumMap k a_amv3 -> EnumMap k a_amv3
- Data.EnumMap.Strict: insertWithKey :: Enum k => (k -> a_afMM -> a_afMM -> a_afMM) -> k -> a_afMM -> EnumMap k a_afMM -> EnumMap k a_afMM
+ Data.EnumMap.Strict: insertWithKey :: forall k (a_amwM :: Type). Enum k => (k -> a_amwM -> a_amwM -> a_amwM) -> k -> a_amwM -> EnumMap k a_amwM -> EnumMap k a_amwM
- Data.EnumMap.Strict: intersection :: EnumMap k a_agdW -> EnumMap k b_agdX -> EnumMap k a_agdW
+ Data.EnumMap.Strict: intersection :: forall k (a_amV1 :: Type) (b_amV2 :: Type). EnumMap k a_amV1 -> EnumMap k b_amV2 -> EnumMap k a_amV1
- Data.EnumMap.Strict: intersectionWith :: (a_ageX -> b_ageY -> c_ageZ) -> EnumMap k a_ageX -> EnumMap k b_ageY -> EnumMap k c_ageZ
+ Data.EnumMap.Strict: intersectionWith :: forall k (a_amVX :: Type) (b_amVY :: Type) (c_amVZ :: Type). (a_amVX -> b_amVY -> c_amVZ) -> EnumMap k a_amVX -> EnumMap k b_amVY -> EnumMap k c_amVZ
- Data.EnumMap.Strict: intersectionWithKey :: Enum k => (k -> a_aggJ -> b_aggK -> c_aggL) -> EnumMap k a_aggJ -> EnumMap k b_aggK -> EnumMap k c_aggL
+ Data.EnumMap.Strict: intersectionWithKey :: forall k (a_amXy :: Type) (b_amXz :: Type) (c_amXA :: Type). Enum k => (k -> a_amXy -> b_amXz -> c_amXA) -> EnumMap k a_amXy -> EnumMap k b_amXz -> EnumMap k c_amXA
- Data.EnumMap.Strict: isProperSubmapOf :: Eq a_ahsm => EnumMap k a_ahsm -> EnumMap k a_ahsm -> Bool
+ Data.EnumMap.Strict: isProperSubmapOf :: forall k (a_ao1H :: Type). Eq a_ao1H => EnumMap k a_ao1H -> EnumMap k a_ao1H -> Bool
- Data.EnumMap.Strict: isProperSubmapOfBy :: (a_ahto -> b_ahtp -> Bool) -> EnumMap k a_ahto -> EnumMap k b_ahtp -> Bool
+ Data.EnumMap.Strict: isProperSubmapOfBy :: forall k (a_ao2E :: Type) (b_ao2F :: Type). (a_ao2E -> b_ao2F -> Bool) -> EnumMap k a_ao2E -> EnumMap k b_ao2F -> Bool
- Data.EnumMap.Strict: isSubmapOf :: Eq a_ahpE => EnumMap k a_ahpE -> EnumMap k a_ahpE -> Bool
+ Data.EnumMap.Strict: isSubmapOf :: forall k (a_anZf :: Type). Eq a_anZf => EnumMap k a_anZf -> EnumMap k a_anZf -> Bool
- Data.EnumMap.Strict: isSubmapOfBy :: (a_ahqG -> b_ahqH -> Bool) -> EnumMap k a_ahqG -> EnumMap k b_ahqH -> Bool
+ Data.EnumMap.Strict: isSubmapOfBy :: forall k (a_ao0c :: Type) (b_ao0d :: Type). (a_ao0c -> b_ao0d -> Bool) -> EnumMap k a_ao0c -> EnumMap k b_ao0d -> Bool
- Data.EnumMap.Strict: keys :: Enum k => EnumMap k a_agTR -> [k]
+ Data.EnumMap.Strict: keys :: forall k (a_anwG :: Type). Enum k => EnumMap k a_anwG -> [k]
- Data.EnumMap.Strict: keysSet :: EnumMap k a_agVI -> EnumSet k
+ Data.EnumMap.Strict: keysSet :: forall k (a_anyo :: Type). EnumMap k a_anyo -> EnumSet k
- Data.EnumMap.Strict: lookup :: Enum k => k -> EnumMap k a_afAx -> Maybe a_afAx
+ Data.EnumMap.Strict: lookup :: forall k (a_amlJ :: Type). Enum k => k -> EnumMap k a_amlJ -> Maybe a_amlJ
- Data.EnumMap.Strict: lookupGE :: Enum k => k -> EnumMap k a_afGT -> Maybe (k, a_afGT)
+ Data.EnumMap.Strict: lookupGE :: forall k (a_amro :: Type). Enum k => k -> EnumMap k a_amro -> Maybe (k, a_amro)
- Data.EnumMap.Strict: lookupGT :: Enum k => k -> EnumMap k a_afEd -> Maybe (k, a_afEd)
+ Data.EnumMap.Strict: lookupGT :: forall k (a_amp2 :: Type). Enum k => k -> EnumMap k a_amp2 -> Maybe (k, a_amp2)
- Data.EnumMap.Strict: lookupLE :: Enum k => k -> EnumMap k a_afFy -> Maybe (k, a_afFy)
+ Data.EnumMap.Strict: lookupLE :: forall k (a_amqd :: Type). Enum k => k -> EnumMap k a_amqd -> Maybe (k, a_amqd)
- Data.EnumMap.Strict: lookupLT :: Enum k => k -> EnumMap k a_afCS -> Maybe (k, a_afCS)
+ Data.EnumMap.Strict: lookupLT :: forall k (a_amnR :: Type). Enum k => k -> EnumMap k a_amnR -> Maybe (k, a_amnR)
- Data.EnumMap.Strict: map :: (a_aglY -> b_aglZ) -> EnumMap k a_aglY -> EnumMap k b_aglZ
+ Data.EnumMap.Strict: map :: forall k (a_an2c :: Type) (b_an2d :: Type). (a_an2c -> b_an2d) -> EnumMap k a_an2c -> EnumMap k b_an2d
- Data.EnumMap.Strict: mapAccum :: (a_agqL -> b_agqM -> (a_agqL, c_agqN)) -> a_agqL -> EnumMap k b_agqM -> (a_agqL, EnumMap k c_agqN)
+ Data.EnumMap.Strict: mapAccum :: forall k (a_an6F :: Type) (b_an6G :: Type) (c_an6H :: Type). (a_an6F -> b_an6G -> (a_an6F, c_an6H)) -> a_an6F -> EnumMap k b_an6G -> (a_an6F, EnumMap k c_an6H)
- Data.EnumMap.Strict: mapAccumRWithKey :: Enum k => (a_agvz -> k -> b_agvA -> (a_agvz, c_agvB)) -> a_agvz -> EnumMap k b_agvA -> (a_agvz, EnumMap k c_agvB)
+ Data.EnumMap.Strict: mapAccumRWithKey :: forall k (a_anaN :: Type) (b_anaO :: Type) (c_anaP :: Type). Enum k => (a_anaN -> k -> b_anaO -> (a_anaN, c_anaP)) -> a_anaN -> EnumMap k b_anaO -> (a_anaN, EnumMap k c_anaP)
- Data.EnumMap.Strict: mapAccumWithKey :: Enum k => (a_agt0 -> k -> b_agt1 -> (a_agt0, c_agt2)) -> a_agt0 -> EnumMap k b_agt1 -> (a_agt0, EnumMap k c_agt2)
+ Data.EnumMap.Strict: mapAccumWithKey :: forall k (a_an8A :: Type) (b_an8B :: Type) (c_an8C :: Type). Enum k => (a_an8A -> k -> b_an8B -> (a_an8A, c_an8C)) -> a_an8A -> EnumMap k b_an8B -> (a_an8A, EnumMap k c_an8C)
- Data.EnumMap.Strict: mapEither :: (a_ahjw -> Either b_ahjx c_ahjy) -> EnumMap k a_ahjw -> (EnumMap k b_ahjx, EnumMap k c_ahjy)
+ Data.EnumMap.Strict: mapEither :: forall k (a_anTT :: Type) (b_anTU :: Type) (c_anTV :: Type). (a_anTT -> Either b_anTU c_anTV) -> EnumMap k a_anTT -> (EnumMap k b_anTU, EnumMap k c_anTV)
- Data.EnumMap.Strict: mapEitherWithKey :: Enum k => (k -> a_ahl6 -> Either b_ahl7 c_ahl8) -> EnumMap k a_ahl6 -> (EnumMap k b_ahl7, EnumMap k c_ahl8)
+ Data.EnumMap.Strict: mapEitherWithKey :: forall k (a_anVh :: Type) (b_anVi :: Type) (c_anVj :: Type). Enum k => (k -> a_anVh -> Either b_anVi c_anVj) -> EnumMap k a_anVh -> (EnumMap k b_anVi, EnumMap k c_anVj)
- Data.EnumMap.Strict: mapKeys :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_agy8 -> EnumMap k' a_agy8
+ Data.EnumMap.Strict: mapKeys :: forall k k' (a_and0 :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_and0 -> EnumMap k' a_and0
- Data.EnumMap.Strict: mapKeysMonotonic :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_agBC -> EnumMap k' a_agBC
+ Data.EnumMap.Strict: mapKeysMonotonic :: forall k k' (a_anga :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_anga -> EnumMap k' a_anga
- Data.EnumMap.Strict: mapKeysWith :: (Enum k, Enum k') => (a_agzx -> a_agzx -> a_agzx) -> (k -> k') -> EnumMap k a_agzx -> EnumMap k' a_agzx
+ Data.EnumMap.Strict: mapKeysWith :: forall k k' (a_anei :: Type). (Enum k, Enum k') => (a_anei -> a_anei -> a_anei) -> (k -> k') -> EnumMap k a_anei -> EnumMap k' a_anei
- Data.EnumMap.Strict: mapMaybe :: (a_ahgJ -> Maybe b_ahgK) -> EnumMap k a_ahgJ -> EnumMap k b_ahgK
+ Data.EnumMap.Strict: mapMaybe :: forall k (a_anRm :: Type) (b_anRn :: Type). (a_anRm -> Maybe b_anRn) -> EnumMap k a_anRm -> EnumMap k b_anRn
- Data.EnumMap.Strict: mapMaybeWithKey :: Enum k => (k -> a_ahhX -> Maybe b_ahhY) -> EnumMap k a_ahhX -> EnumMap k b_ahhY
+ Data.EnumMap.Strict: mapMaybeWithKey :: forall k (a_anSt :: Type) (b_anSu :: Type). Enum k => (k -> a_anSt -> Maybe b_anSu) -> EnumMap k a_anSt -> EnumMap k b_anSu
- Data.EnumMap.Strict: mapWithKey :: Enum k => (k -> a_agnb -> b_agnc) -> EnumMap k a_agnb -> EnumMap k b_agnc
+ Data.EnumMap.Strict: mapWithKey :: forall k (a_an3j :: Type) (b_an3k :: Type). Enum k => (k -> a_an3j -> b_an3k) -> EnumMap k a_an3j -> EnumMap k b_an3k
- Data.EnumMap.Strict: maxView :: EnumMap k a_ahHd -> Maybe (a_ahHd, EnumMap k a_ahHd)
+ Data.EnumMap.Strict: maxView :: forall k (a_aof0 :: Type). EnumMap k a_aof0 -> Maybe (a_aof0, EnumMap k a_aof0)
- Data.EnumMap.Strict: maxViewWithKey :: Enum k => EnumMap k a_ahJw -> Maybe ((k, a_ahJw), EnumMap k a_ahJw)
+ Data.EnumMap.Strict: maxViewWithKey :: forall k (a_aoh0 :: Type). Enum k => EnumMap k a_aoh0 -> Maybe ((k, a_aoh0), EnumMap k a_aoh0)
- Data.EnumMap.Strict: member :: Enum k => k -> EnumMap k a_afyx -> Bool
+ Data.EnumMap.Strict: member :: forall k (a_amjR :: Type). Enum k => k -> EnumMap k a_amjR -> Bool
- Data.EnumMap.Strict: mergeWithKey :: Enum k => (k -> a_agiQ -> b_agiR -> Maybe c_agiS) -> (EnumMap k a_agiQ -> EnumMap k c_agiS) -> (EnumMap k b_agiR -> EnumMap k c_agiS) -> EnumMap k a_agiQ -> EnumMap k b_agiR -> EnumMap k c_agiS
+ Data.EnumMap.Strict: mergeWithKey :: forall k (a_amZs :: Type) (b_amZt :: Type) (c_amZu :: Type). Enum k => (k -> a_amZs -> b_amZt -> Maybe c_amZu) -> (EnumMap k a_amZs -> EnumMap k c_amZu) -> (EnumMap k b_amZt -> EnumMap k c_amZu) -> EnumMap k a_amZs -> EnumMap k b_amZt -> EnumMap k c_amZu
- Data.EnumMap.Strict: minView :: EnumMap k a_ahGc -> Maybe (a_ahGc, EnumMap k a_ahGc)
+ Data.EnumMap.Strict: minView :: forall k (a_aoe7 :: Type). EnumMap k a_aoe7 -> Maybe (a_aoe7, EnumMap k a_aoe7)
- Data.EnumMap.Strict: minViewWithKey :: Enum k => EnumMap k a_ahIe -> Maybe ((k, a_ahIe), EnumMap k a_ahIe)
+ Data.EnumMap.Strict: minViewWithKey :: forall k (a_aofT :: Type). Enum k => EnumMap k a_aofT -> Maybe ((k, a_aofT), EnumMap k a_aofT)
- Data.EnumMap.Strict: notMember :: Enum k => k -> EnumMap k a_afzx -> Bool
+ Data.EnumMap.Strict: notMember :: forall k (a_amkN :: Type). Enum k => k -> EnumMap k a_amkN -> Bool
- Data.EnumMap.Strict: null :: EnumMap k a_afxd -> Bool
+ Data.EnumMap.Strict: null :: forall k (a_amiB :: Type). EnumMap k a_amiB -> Bool
- Data.EnumMap.Strict: partition :: (a_ahdB -> Bool) -> EnumMap k a_ahdB -> (EnumMap k a_ahdB, EnumMap k a_ahdB)
+ Data.EnumMap.Strict: partition :: forall k (a_anOC :: Type). (a_anOC -> Bool) -> EnumMap k a_anOC -> (EnumMap k a_anOC, EnumMap k a_anOC)
- Data.EnumMap.Strict: partitionWithKey :: Enum k => (k -> a_ahf0 -> Bool) -> EnumMap k a_ahf0 -> (EnumMap k a_ahf0, EnumMap k a_ahf0)
+ Data.EnumMap.Strict: partitionWithKey :: forall k (a_anPQ :: Type). Enum k => (k -> a_anPQ -> Bool) -> EnumMap k a_anPQ -> (EnumMap k a_anPQ, EnumMap k a_anPQ)
- Data.EnumMap.Strict: showTree :: Show a_ahKO => EnumMap k a_ahKO -> String
+ Data.EnumMap.Strict: showTree :: forall k (a_aoi7 :: Type). Show a_aoi7 => EnumMap k a_aoi7 -> String
- Data.EnumMap.Strict: showTreeWith :: Show a_ahLA => Bool -> Bool -> EnumMap k a_ahLA -> String
+ Data.EnumMap.Strict: showTreeWith :: forall k (a_aoiR :: Type). Show a_aoiR => Bool -> Bool -> EnumMap k a_aoiR -> String
- Data.EnumMap.Strict: singleton :: Enum k => k -> a_afID -> EnumMap k a_afID
+ Data.EnumMap.Strict: singleton :: forall k (a_amsY :: Type). Enum k => k -> a_amsY -> EnumMap k a_amsY
- Data.EnumMap.Strict: size :: EnumMap k a_afxS -> Int
+ Data.EnumMap.Strict: size :: forall k (a_amje :: Type). EnumMap k a_amje -> Int
- Data.EnumMap.Strict: split :: Enum k => k -> EnumMap k a_ahn0 -> (EnumMap k a_ahn0, EnumMap k a_ahn0)
+ Data.EnumMap.Strict: split :: forall k (a_anWX :: Type). Enum k => k -> EnumMap k a_anWX -> (EnumMap k a_anWX, EnumMap k a_anWX)
- Data.EnumMap.Strict: splitLookup :: Enum k => k -> EnumMap k a_ahoh -> (EnumMap k a_ahoh, Maybe a_ahoh, EnumMap k a_ahoh)
+ Data.EnumMap.Strict: splitLookup :: forall k (a_anY5 :: Type). Enum k => k -> EnumMap k a_anY5 -> (EnumMap k a_anY5, Maybe a_anY5, EnumMap k a_anY5)
- Data.EnumMap.Strict: toAscList :: Enum k => EnumMap k a_ah3h -> [(k, a_ah3h)]
+ Data.EnumMap.Strict: toAscList :: forall k (a_anFg :: Type). Enum k => EnumMap k a_anFg -> [(k, a_anFg)]
- Data.EnumMap.Strict: toDescList :: Enum k => EnumMap k a_ah4j -> [(k, a_ah4j)]
+ Data.EnumMap.Strict: toDescList :: forall k (a_anGc :: Type). Enum k => EnumMap k a_anGc -> [(k, a_anGc)]
- Data.EnumMap.Strict: toList :: Enum k => EnumMap k a_agXB -> [(k, a_agXB)]
+ Data.EnumMap.Strict: toList :: forall k (a_anA9 :: Type). Enum k => EnumMap k a_anA9 -> [(k, a_anA9)]
- Data.EnumMap.Strict: traverseWithKey :: (Enum k, Applicative t_agoK) => (k -> a_agoJ -> t_agoK b_agoL) -> EnumMap k a_agoJ -> t_agoK (EnumMap k b_agoL)
+ Data.EnumMap.Strict: traverseWithKey :: forall k (t_an4J :: Type -> Type) (a_an4K :: Type) (b_an4L :: Type). (Enum k, Applicative t_an4J) => (k -> a_an4K -> t_an4J b_an4L) -> EnumMap k a_an4K -> t_an4J (EnumMap k b_an4L)
- Data.EnumMap.Strict: union :: EnumMap k a_ag2x -> EnumMap k a_ag2x -> EnumMap k a_ag2x
+ Data.EnumMap.Strict: union :: forall k (a_amKM :: Type). EnumMap k a_amKM -> EnumMap k a_amKM -> EnumMap k a_amKM
- Data.EnumMap.Strict: unionWith :: (a_ag3t -> a_ag3t -> a_ag3t) -> EnumMap k a_ag3t -> EnumMap k a_ag3t -> EnumMap k a_ag3t
+ Data.EnumMap.Strict: unionWith :: forall k (a_amLD :: Type). (a_amLD -> a_amLD -> a_amLD) -> EnumMap k a_amLD -> EnumMap k a_amLD -> EnumMap k a_amLD
- Data.EnumMap.Strict: unionWithKey :: Enum k => (k -> a_ag55 -> a_ag55 -> a_ag55) -> EnumMap k a_ag55 -> EnumMap k a_ag55 -> EnumMap k a_ag55
+ Data.EnumMap.Strict: unionWithKey :: forall k (a_amN4 :: Type). Enum k => (k -> a_amN4 -> a_amN4 -> a_amN4) -> EnumMap k a_amN4 -> EnumMap k a_amN4 -> EnumMap k a_amN4
- Data.EnumMap.Strict: unions :: [EnumMap k a_ag72] -> EnumMap k a_ag72
+ Data.EnumMap.Strict: unions :: forall k (a_amOO :: Type). [EnumMap k a_amOO] -> EnumMap k a_amOO
- Data.EnumMap.Strict: unionsWith :: (a_ag7L -> a_ag7L -> a_ag7L) -> [EnumMap k a_ag7L] -> EnumMap k a_ag7L
+ Data.EnumMap.Strict: unionsWith :: forall k (a_amPu :: Type). (a_amPu -> a_amPu -> a_amPu) -> [EnumMap k a_amPu] -> EnumMap k a_amPu
- Data.EnumMap.Strict: update :: Enum k => (a_afVE -> Maybe a_afVE) -> k -> EnumMap k a_afVE -> EnumMap k a_afVE
+ Data.EnumMap.Strict: update :: forall k (a_amEI :: Type). Enum k => (a_amEI -> Maybe a_amEI) -> k -> EnumMap k a_amEI -> EnumMap k a_amEI
- Data.EnumMap.Strict: updateLookupWithKey :: Enum k => (k -> a_afYR -> Maybe a_afYR) -> k -> EnumMap k a_afYR -> (Maybe a_afYR, EnumMap k a_afYR)
+ Data.EnumMap.Strict: updateLookupWithKey :: forall k (a_amHB :: Type). Enum k => (k -> a_amHB -> Maybe a_amHB) -> k -> EnumMap k a_amHB -> (Maybe a_amHB, EnumMap k a_amHB)
- Data.EnumMap.Strict: updateMax :: (a_ahC5 -> Maybe a_ahC5) -> EnumMap k a_ahC5 -> EnumMap k a_ahC5
+ Data.EnumMap.Strict: updateMax :: forall k (a_aoap :: Type). (a_aoap -> Maybe a_aoap) -> EnumMap k a_aoap -> EnumMap k a_aoap
- Data.EnumMap.Strict: updateMaxWithKey :: Enum k => (k -> a_ahEI -> Maybe a_ahEI) -> EnumMap k a_ahEI -> EnumMap k a_ahEI
+ Data.EnumMap.Strict: updateMaxWithKey :: forall k (a_aocM :: Type). Enum k => (k -> a_aocM -> Maybe a_aocM) -> EnumMap k a_aocM -> EnumMap k a_aocM
- Data.EnumMap.Strict: updateMin :: (a_ahAW -> Maybe a_ahAW) -> EnumMap k a_ahAW -> EnumMap k a_ahAW
+ Data.EnumMap.Strict: updateMin :: forall k (a_ao9n :: Type). (a_ao9n -> Maybe a_ao9n) -> EnumMap k a_ao9n -> EnumMap k a_ao9n
- Data.EnumMap.Strict: updateMinWithKey :: Enum k => (k -> a_ahDe -> Maybe a_ahDe) -> EnumMap k a_ahDe -> EnumMap k a_ahDe
+ Data.EnumMap.Strict: updateMinWithKey :: forall k (a_aobr :: Type). Enum k => (k -> a_aobr -> Maybe a_aobr) -> EnumMap k a_aobr -> EnumMap k a_aobr
- Data.EnumMap.Strict: updateWithKey :: Enum k => (k -> a_afX8 -> Maybe a_afX8) -> k -> EnumMap k a_afX8 -> EnumMap k a_afX8
+ Data.EnumMap.Strict: updateWithKey :: forall k (a_amG3 :: Type). Enum k => (k -> a_amG3 -> Maybe a_amG3) -> k -> EnumMap k a_amG3 -> EnumMap k a_amG3
- Data.EnumSet: (\\) :: EnumSet k -> EnumSet k -> EnumSet k
+ Data.EnumSet: (\\) :: forall k. EnumSet k -> EnumSet k -> EnumSet k
- Data.EnumSet: delete :: Enum k => k -> EnumSet k -> EnumSet k
+ Data.EnumSet: delete :: forall k. Enum k => k -> EnumSet k -> EnumSet k
- Data.EnumSet: deleteFindMax :: Enum k => EnumSet k -> (k, EnumSet k)
+ Data.EnumSet: deleteFindMax :: forall k. Enum k => EnumSet k -> (k, EnumSet k)
- Data.EnumSet: deleteFindMin :: Enum k => EnumSet k -> (k, EnumSet k)
+ Data.EnumSet: deleteFindMin :: forall k. Enum k => EnumSet k -> (k, EnumSet k)
- Data.EnumSet: deleteMax :: EnumSet k -> EnumSet k
+ Data.EnumSet: deleteMax :: forall k. EnumSet k -> EnumSet k
- Data.EnumSet: deleteMin :: EnumSet k -> EnumSet k
+ Data.EnumSet: deleteMin :: forall k. EnumSet k -> EnumSet k
- Data.EnumSet: difference :: EnumSet k -> EnumSet k -> EnumSet k
+ Data.EnumSet: difference :: forall k. EnumSet k -> EnumSet k -> EnumSet k
- Data.EnumSet: elems :: Enum k => EnumSet k -> [k]
+ Data.EnumSet: elems :: forall k. Enum k => EnumSet k -> [k]
- Data.EnumSet: empty :: EnumSet k
+ Data.EnumSet: empty :: forall k. EnumSet k
- Data.EnumSet: filter :: Enum k => (k -> Bool) -> EnumSet k -> EnumSet k
+ Data.EnumSet: filter :: forall k. Enum k => (k -> Bool) -> EnumSet k -> EnumSet k
- Data.EnumSet: findMax :: Enum k => EnumSet k -> k
+ Data.EnumSet: findMax :: forall k. Enum k => EnumSet k -> k
- Data.EnumSet: findMin :: Enum k => EnumSet k -> k
+ Data.EnumSet: findMin :: forall k. Enum k => EnumSet k -> k
- Data.EnumSet: foldl :: Enum k => (a_acqd -> k -> a_acqd) -> a_acqd -> EnumSet k -> a_acqd
+ Data.EnumSet: foldl :: forall k (a_ahbQ :: Type). Enum k => (a_ahbQ -> k -> a_ahbQ) -> a_ahbQ -> EnumSet k -> a_ahbQ
- Data.EnumSet: foldl' :: Enum k => (a_actx -> k -> a_actx) -> a_actx -> EnumSet k -> a_actx
+ Data.EnumSet: foldl' :: forall k (a_aheQ :: Type). Enum k => (a_aheQ -> k -> a_aheQ) -> a_aheQ -> EnumSet k -> a_aheQ
- Data.EnumSet: foldr :: Enum k => (k -> b_acoy -> b_acoy) -> b_acoy -> EnumSet k -> b_acoy
+ Data.EnumSet: foldr :: forall k (b_ahal :: Type). Enum k => (k -> b_ahal -> b_ahal) -> b_ahal -> EnumSet k -> b_ahal
- Data.EnumSet: foldr' :: Enum k => (k -> b_acrS -> b_acrS) -> b_acrS -> EnumSet k -> b_acrS
+ Data.EnumSet: foldr' :: forall k (b_ahdl :: Type). Enum k => (k -> b_ahdl -> b_ahdl) -> b_ahdl -> EnumSet k -> b_ahdl
- Data.EnumSet: fromAscList :: Enum k => [k] -> EnumSet k
+ Data.EnumSet: fromAscList :: forall k. Enum k => [k] -> EnumSet k
- Data.EnumSet: fromDistinctAscList :: Enum k => [k] -> EnumSet k
+ Data.EnumSet: fromDistinctAscList :: forall k. Enum k => [k] -> EnumSet k
- Data.EnumSet: fromList :: Enum k => [k] -> EnumSet k
+ Data.EnumSet: fromList :: forall k. Enum k => [k] -> EnumSet k
- Data.EnumSet: insert :: Enum k => k -> EnumSet k -> EnumSet k
+ Data.EnumSet: insert :: forall k. Enum k => k -> EnumSet k -> EnumSet k
- Data.EnumSet: intersection :: EnumSet k -> EnumSet k -> EnumSet k
+ Data.EnumSet: intersection :: forall k. EnumSet k -> EnumSet k -> EnumSet k
- Data.EnumSet: isProperSubsetOf :: EnumSet k -> EnumSet k -> Bool
+ Data.EnumSet: isProperSubsetOf :: forall k. EnumSet k -> EnumSet k -> Bool
- Data.EnumSet: isSubsetOf :: EnumSet k -> EnumSet k -> Bool
+ Data.EnumSet: isSubsetOf :: forall k. EnumSet k -> EnumSet k -> Bool
- Data.EnumSet: lookupGE :: Enum k => k -> EnumSet k -> Maybe k
+ Data.EnumSet: lookupGE :: forall k. Enum k => k -> EnumSet k -> Maybe k
- Data.EnumSet: lookupGT :: Enum k => k -> EnumSet k -> Maybe k
+ Data.EnumSet: lookupGT :: forall k. Enum k => k -> EnumSet k -> Maybe k
- Data.EnumSet: lookupLE :: Enum k => k -> EnumSet k -> Maybe k
+ Data.EnumSet: lookupLE :: forall k. Enum k => k -> EnumSet k -> Maybe k
- Data.EnumSet: lookupLT :: Enum k => k -> EnumSet k -> Maybe k
+ Data.EnumSet: lookupLT :: forall k. Enum k => k -> EnumSet k -> Maybe k
- Data.EnumSet: map :: (Enum k, Enum k') => (k -> k') -> EnumSet k -> EnumSet k'
+ Data.EnumSet: map :: forall k k'. (Enum k, Enum k') => (k -> k') -> EnumSet k -> EnumSet k'
- Data.EnumSet: maxView :: Enum k => EnumSet k -> Maybe (k, EnumSet k)
+ Data.EnumSet: maxView :: forall k. Enum k => EnumSet k -> Maybe (k, EnumSet k)
- Data.EnumSet: member :: Enum k => k -> EnumSet k -> Bool
+ Data.EnumSet: member :: forall k. Enum k => k -> EnumSet k -> Bool
- Data.EnumSet: minView :: Enum k => EnumSet k -> Maybe (k, EnumSet k)
+ Data.EnumSet: minView :: forall k. Enum k => EnumSet k -> Maybe (k, EnumSet k)
- Data.EnumSet: notMember :: Enum k => k -> EnumSet k -> Bool
+ Data.EnumSet: notMember :: forall k. Enum k => k -> EnumSet k -> Bool
- Data.EnumSet: null :: EnumSet k -> Bool
+ Data.EnumSet: null :: forall k. EnumSet k -> Bool
- Data.EnumSet: partition :: Enum k => (k -> Bool) -> EnumSet k -> (EnumSet k, EnumSet k)
+ Data.EnumSet: partition :: forall k. Enum k => (k -> Bool) -> EnumSet k -> (EnumSet k, EnumSet k)
- Data.EnumSet: showTree :: EnumSet k -> String
+ Data.EnumSet: showTree :: forall k. EnumSet k -> String
- Data.EnumSet: showTreeWith :: Bool -> Bool -> EnumSet k -> String
+ Data.EnumSet: showTreeWith :: forall k. Bool -> Bool -> EnumSet k -> String
- Data.EnumSet: singleton :: Enum k => k -> EnumSet k
+ Data.EnumSet: singleton :: forall k. Enum k => k -> EnumSet k
- Data.EnumSet: size :: EnumSet k -> Int
+ Data.EnumSet: size :: forall k. EnumSet k -> Int
- Data.EnumSet: split :: Enum k => k -> EnumSet k -> (EnumSet k, EnumSet k)
+ Data.EnumSet: split :: forall k. Enum k => k -> EnumSet k -> (EnumSet k, EnumSet k)
- Data.EnumSet: splitMember :: Enum k => k -> EnumSet k -> (EnumSet k, Bool, EnumSet k)
+ Data.EnumSet: splitMember :: forall k. Enum k => k -> EnumSet k -> (EnumSet k, Bool, EnumSet k)
- Data.EnumSet: toAscList :: Enum k => EnumSet k -> [k]
+ Data.EnumSet: toAscList :: forall k. Enum k => EnumSet k -> [k]
- Data.EnumSet: toDescList :: Enum k => EnumSet k -> [k]
+ Data.EnumSet: toDescList :: forall k. Enum k => EnumSet k -> [k]
- Data.EnumSet: toList :: Enum k => EnumSet k -> [k]
+ Data.EnumSet: toList :: forall k. Enum k => EnumSet k -> [k]
- Data.EnumSet: union :: EnumSet k -> EnumSet k -> EnumSet k
+ Data.EnumSet: union :: forall k. EnumSet k -> EnumSet k -> EnumSet k
- Data.EnumSet: unions :: [EnumSet k] -> EnumSet k
+ Data.EnumSet: unions :: forall k. [EnumSet k] -> EnumSet k
Files
- Data/EnumMapSetWrapper.hs +8/−1
- enummapset-th.cabal +5/−5
Data/EnumMapSetWrapper.hs view
@@ -34,7 +34,9 @@ module Data.EnumMapSetWrapper (w, w') where import Prelude+#if !MIN_VERSION_base(4,8,0) import Control.Applicative+#endif import Control.Arrow import Data.List (nub) import Data.IntSet (IntSet)@@ -225,7 +227,12 @@ return [ inlineD size, SigD size t', ValD (VarP size) body [] ] #endif wrap subst name@(mkName . nameBase -> base) = do- VarI _name (pos ko -> (e, cxt', typ')) _dec _fixity <- reify name+#if MIN_VERSION_template_haskell(2,11,0)+ VarI _name (pos ko -> (e, cxt', typ')) _dec+#else+ VarI _name (pos ko -> (e, cxt', typ')) _dec _fixity+#endif+ <- reify name let ks = map PlainTV [ki, ko] let t' = (if subst then substT ko ki else id) $ case typ' of ForallT tvs cxt t ->
enummapset-th.cabal view
@@ -1,5 +1,5 @@ name: enummapset-th-version: 0.6.1.0+version: 0.6.1.1 synopsis: TH-generated EnumSet/EnumMap wrappers around IntSet/IntMap. description: This package wraps @IntSet@ and @IntMap@ from @containers@, and provides@@ -14,22 +14,22 @@ Note that "Data.EnumMap.Lazy" and "Data.EnumMap.Strict" provide distinct newtype wrappers, and their respective 'Functor' instances behave as expected, unlike that of @IntMap@ which is alway lazy.-homepage: https://github.com/liyang/enummapset-th+homepage: https://github.com/tsurucapital/enummapset-th license: BSD3 license-file: LICENSE author: Liyang HU maintainer: enummapset-th@liyang.hu-copyright: © 2013 Liyang HU+copyright: © 2013−2015 Liyang HU category: Data build-type: Simple cabal-version: >= 1.8-tested-with: GHC == 7.8.3, GHC == 7.8.4, GHC == 7.10.2+tested-with: GHC == 7.8.3, GHC == 7.8.4, GHC == 7.10.2, GHC == 8.0.1 extra-source-files: include/map.inc source-repository head type: git- location: http://github.com/liyang/enummapset-th+ location: https://github.com/tsurucapital/enummapset-th.git library exposed-modules: