enummapset-th 0.6.1.1 → 0.6.2
raw patch · 6 files changed
+29/−10 lines, 6 filesdep ~basedep ~containersdep ~template-haskellnew-uploaderPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base, containers, template-haskell
API changes (from Hackage documentation)
+ Data.EnumMap.Lazy: infixr 1 `EnumMap`
+ Data.EnumMap.Lazy: instance GHC.Base.Semigroup (Data.EnumMap.Lazy.EnumMap k v)
+ Data.EnumMap.Strict: infixr 1 `EnumMap`
+ Data.EnumMap.Strict: instance GHC.Base.Semigroup (Data.EnumMap.Strict.EnumMap k v)
+ Data.EnumSet: instance GHC.Base.Semigroup (Data.EnumSet.EnumSet k)
- Data.EnumMap.Lazy: (!) :: forall k (a_amgJ :: Type). Enum k => EnumMap k a_amgJ -> k -> a_amgJ
+ Data.EnumMap.Lazy: (!) :: forall k (a_amwT :: Type). Enum k => EnumMap k a_amwT -> k -> a_amwT
- 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: (\\) :: forall k (a_amxZ :: Type) (b_amy0 :: Type). EnumMap k a_amxZ -> EnumMap k b_amy0 -> EnumMap k a_amxZ
- 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: adjust :: forall k (a_azYH :: Type). Enum k => (a_azYH -> a_azYH) -> k -> EnumMap k a_azYH -> EnumMap k a_azYH
- 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: adjustWithKey :: forall k (a_aA0b :: Type). Enum k => (k -> a_aA0b -> a_aA0b) -> k -> EnumMap k a_aA0b -> EnumMap k a_aA0b
- 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: alter :: forall k (a_aA6Y :: Type). Enum k => (Maybe a_aA6Y -> Maybe a_aA6Y) -> k -> EnumMap k a_aA6Y -> EnumMap k a_aA6Y
- Data.EnumMap.Lazy: assocs :: forall k (a_anxs :: Type). Enum k => EnumMap k a_anxs -> [(k, a_anxs)]
+ Data.EnumMap.Lazy: assocs :: forall k (a_ao00 :: Type). Enum k => EnumMap k a_ao00 -> [(k, a_ao00)]
- Data.EnumMap.Lazy: delete :: forall k (a_amAS :: Type). Enum k => k -> EnumMap k a_amAS -> EnumMap k a_amAS
+ Data.EnumMap.Lazy: delete :: forall k (a_amTI :: Type). Enum k => k -> EnumMap k a_amTI -> EnumMap k a_amTI
- 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: deleteFindMax :: forall k (a_aoFT :: Type). Enum k => EnumMap k a_aoFT -> ((k, a_aoFT), EnumMap k a_aoFT)
- 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: deleteFindMin :: forall k (a_aoEG :: Type). Enum k => EnumMap k a_aoEG -> ((k, a_aoEG), EnumMap k a_aoEG)
- Data.EnumMap.Lazy: deleteMax :: forall k (a_ao6B :: Type). EnumMap k a_ao6B -> EnumMap k a_ao6B
+ Data.EnumMap.Lazy: deleteMax :: forall k (a_aoDT :: Type). EnumMap k a_aoDT -> EnumMap k a_aoDT
- Data.EnumMap.Lazy: deleteMin :: forall k (a_ao5X :: Type). EnumMap k a_ao5X -> EnumMap k a_ao5X
+ Data.EnumMap.Lazy: deleteMin :: forall k (a_aoD6 :: Type). EnumMap k a_aoD6 -> EnumMap k a_aoD6
- 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: difference :: forall k (a_ancw :: Type) (b_ancx :: Type). EnumMap k a_ancw -> EnumMap k b_ancx -> EnumMap k a_ancw
- 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: differenceWith :: forall k (a_aAgU :: Type) (b_aAgV :: Type). (a_aAgU -> b_aAgV -> Maybe a_aAgU) -> EnumMap k a_aAgU -> EnumMap k b_aAgV -> EnumMap k a_aAgU
- 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: differenceWithKey :: forall k (a_aAiC :: Type) (b_aAiD :: Type). Enum k => (k -> a_aAiC -> b_aAiD -> Maybe a_aAiC) -> EnumMap k a_aAiC -> EnumMap k b_aAiD -> EnumMap k a_aAiC
- Data.EnumMap.Lazy: elems :: forall k (a_anw1 :: Type). EnumMap k a_anw1 -> [a_anw1]
+ Data.EnumMap.Lazy: elems :: forall k (a_anYh :: Type). EnumMap k a_anYh -> [a_anYh]
- Data.EnumMap.Lazy: empty :: forall k (a_amsz :: Type). EnumMap k a_amsz
+ Data.EnumMap.Lazy: empty :: forall k (a_amKx :: Type). EnumMap k a_amKx
- Data.EnumMap.Lazy: filter :: forall k (a_anMf :: Type). (a_anMf -> Bool) -> EnumMap k a_anMf -> EnumMap k a_anMf
+ Data.EnumMap.Lazy: filter :: forall k (a_aogG :: Type). (a_aogG -> Bool) -> EnumMap k a_aogG -> EnumMap k a_aogG
- 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: filterWithKey :: forall k (a_aohR :: Type). Enum k => (k -> a_aohR -> Bool) -> EnumMap k a_aohR -> EnumMap k a_aohR
- Data.EnumMap.Lazy: findMax :: forall k (a_ao53 :: Type). Enum k => EnumMap k a_ao53 -> (k, a_ao53)
+ Data.EnumMap.Lazy: findMax :: forall k (a_aoC3 :: Type). Enum k => EnumMap k a_aoC3 -> (k, a_aoC3)
- Data.EnumMap.Lazy: findMin :: forall k (a_ao49 :: Type). Enum k => EnumMap k a_ao49 -> (k, a_ao49)
+ Data.EnumMap.Lazy: findMin :: forall k (a_aoB0 :: Type). Enum k => EnumMap k a_aoB0 -> (k, a_aoB0)
- Data.EnumMap.Lazy: findWithDefault :: forall k (a_azaX :: Type). Enum k => a_azaX -> k -> EnumMap k a_azaX -> a_azaX
+ Data.EnumMap.Lazy: findWithDefault :: forall k (a_azHX :: Type). Enum k => a_azHX -> k -> EnumMap k a_azHX -> a_azHX
- 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: foldMapWithKey :: forall k (m_anOb :: Type) (a_anOc :: Type). (Enum k, Monoid m_anOb) => (k -> a_anOc -> m_anOb) -> EnumMap k a_anOc -> m_anOb
- 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 :: forall k (a_anIx :: Type) (b_anIy :: Type). (a_anIx -> b_anIy -> a_anIx) -> a_anIx -> EnumMap k b_anIy -> a_anIx
- 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: foldl' :: forall k (a_anSD :: Type) (b_anSE :: Type). (a_anSD -> b_anSE -> a_anSD) -> a_anSD -> EnumMap k b_anSE -> a_anSD
- 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 :: forall k (a_anMc :: Type) (b_anMd :: Type). Enum k => (a_anMc -> k -> b_anMd -> a_anMc) -> a_anMc -> EnumMap k b_anMd -> a_anMc
- 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: foldlWithKey' :: forall k (a_anWi :: Type) (b_anWj :: Type). Enum k => (a_anWi -> k -> b_anWj -> a_anWi) -> a_anWi -> EnumMap k b_anWj -> a_anWi
- 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 :: forall k (a_anGR :: Type) (b_anGS :: Type). (a_anGR -> b_anGS -> b_anGS) -> b_anGS -> EnumMap k a_anGR -> b_anGS
- 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: foldr' :: forall k (a_anQX :: Type) (b_anQY :: Type). (a_anQX -> b_anQY -> b_anQY) -> b_anQY -> EnumMap k a_anQX -> b_anQY
- 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 :: forall k (a_anKd :: Type) (b_anKe :: Type). Enum k => (k -> a_anKd -> b_anKe -> b_anKe) -> b_anKe -> EnumMap k a_anKd -> b_anKe
- 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: foldrWithKey' :: forall k (a_anUj :: Type) (b_anUk :: Type). Enum k => (k -> a_anUj -> b_anUk -> b_anUk) -> b_anUk -> EnumMap k a_anUj -> b_anUk
- Data.EnumMap.Lazy: fromAscList :: forall k (a_aAuo :: Type). Enum k => [(k, a_aAuo)] -> EnumMap k a_aAuo
+ Data.EnumMap.Lazy: fromAscList :: forall k (a_aBca :: Type). Enum k => [(k, a_aBca)] -> EnumMap k a_aBca
- 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: fromAscListWith :: forall k (a_aBdf :: Type). Enum k => (a_aBdf -> a_aBdf -> a_aBdf) -> [(k, a_aBdf)] -> EnumMap k a_aBdf
- 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: fromAscListWithKey :: forall k (a_aBeU :: Type). Enum k => (k -> a_aBeU -> a_aBeU -> a_aBeU) -> [(k, a_aBeU)] -> EnumMap k a_aBeU
- Data.EnumMap.Lazy: fromDistinctAscList :: forall k (a_aAyz :: Type). Enum k => [(k, a_aAyz)] -> EnumMap k a_aAyz
+ Data.EnumMap.Lazy: fromDistinctAscList :: forall k (a_aBgM :: Type). Enum k => [(k, a_aBgM)] -> EnumMap k a_aBgM
- Data.EnumMap.Lazy: fromList :: forall k (a_aAon :: Type). Enum k => [(k, a_aAon)] -> EnumMap k a_aAon
+ Data.EnumMap.Lazy: fromList :: forall k (a_aB5q :: Type). Enum k => [(k, a_aB5q)] -> EnumMap k a_aB5q
- 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: fromListWith :: forall k (a_aB6v :: Type). Enum k => (a_aB6v -> a_aB6v -> a_aB6v) -> [(k, a_aB6v)] -> EnumMap k a_aB6v
- 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: fromListWithKey :: forall k (a_aB8a :: Type). Enum k => (k -> a_aB8a -> a_aB8a -> a_aB8a) -> [(k, a_aB8a)] -> EnumMap k a_aB8a
- Data.EnumMap.Lazy: fromSet :: forall k (a_aAmk :: Type). Enum k => (k -> a_aAmk) -> EnumSet k -> EnumMap k a_aAmk
+ Data.EnumMap.Lazy: fromSet :: forall k (a_aB35 :: Type). Enum k => (k -> a_aB35) -> EnumSet k -> EnumMap k a_aB35
- 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: insert :: forall k (a_azQ4 :: Type). Enum k => k -> a_azQ4 -> EnumMap k a_azQ4 -> EnumMap k a_azQ4
- 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: insertLookupWithKey :: forall k (a_azVj :: Type). Enum k => (k -> a_azVj -> a_azVj -> a_azVj) -> k -> a_azVj -> EnumMap k a_azVj -> (Maybe a_azVj, EnumMap k a_azVj)
- 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: insertWith :: forall k (a_azRm :: Type). Enum k => (a_azRm -> a_azRm -> a_azRm) -> k -> a_azRm -> EnumMap k a_azRm -> EnumMap k a_azRm
- 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: insertWithKey :: forall k (a_azTe :: Type). Enum k => (k -> a_azTe -> a_azTe -> a_azTe) -> k -> a_azTe -> EnumMap k a_azTe -> EnumMap k a_azTe
- 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: intersection :: forall k (a_anhn :: Type) (b_anho :: Type). EnumMap k a_anhn -> EnumMap k b_anho -> EnumMap k a_anhn
- 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: intersectionWith :: forall k (a_aAlJ :: Type) (b_aAlK :: Type) (c_aAlL :: Type). (a_aAlJ -> b_aAlK -> c_aAlL) -> EnumMap k a_aAlJ -> EnumMap k b_aAlK -> EnumMap k c_aAlL
- 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: intersectionWithKey :: forall k (a_aAnz :: Type) (b_aAnA :: Type) (c_aAnB :: Type). Enum k => (k -> a_aAnz -> b_aAnA -> c_aAnB) -> EnumMap k a_aAnz -> EnumMap k b_aAnA -> EnumMap k c_aAnB
- Data.EnumMap.Lazy: isProperSubmapOf :: forall k (a_ao1H :: Type). Eq a_ao1H => EnumMap k a_ao1H -> EnumMap k a_ao1H -> Bool
+ Data.EnumMap.Lazy: isProperSubmapOf :: forall k (a_aoyd :: Type). Eq a_aoyd => EnumMap k a_aoyd -> EnumMap k a_aoyd -> 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: isProperSubmapOfBy :: forall k (a_aozj :: Type) (b_aozk :: Type). (a_aozj -> b_aozk -> Bool) -> EnumMap k a_aozj -> EnumMap k b_aozk -> 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: isSubmapOf :: forall k (a_aovq :: Type). Eq a_aovq => EnumMap k a_aovq -> EnumMap k a_aovq -> 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: isSubmapOfBy :: forall k (a_aoww :: Type) (b_aowx :: Type). (a_aoww -> b_aowx -> Bool) -> EnumMap k a_aoww -> EnumMap k b_aowx -> Bool
- Data.EnumMap.Lazy: keys :: forall k (a_anwG :: Type). Enum k => EnumMap k a_anwG -> [k]
+ Data.EnumMap.Lazy: keys :: forall k (a_anZ5 :: Type). Enum k => EnumMap k a_anZ5 -> [k]
- Data.EnumMap.Lazy: keysSet :: forall k (a_anyo :: Type). EnumMap k a_anyo -> EnumSet k
+ Data.EnumMap.Lazy: keysSet :: forall k (a_ao15 :: Type). EnumMap k a_ao15 -> EnumSet k
- Data.EnumMap.Lazy: lookup :: forall k (a_amlJ :: Type). Enum k => k -> EnumMap k a_amlJ -> Maybe a_amlJ
+ Data.EnumMap.Lazy: lookup :: forall k (a_amCP :: Type). Enum k => k -> EnumMap k a_amCP -> Maybe a_amCP
- Data.EnumMap.Lazy: lookupGE :: forall k (a_amro :: Type). Enum k => k -> EnumMap k a_amro -> Maybe (k, a_amro)
+ Data.EnumMap.Lazy: lookupGE :: forall k (a_amJd :: Type). Enum k => k -> EnumMap k a_amJd -> Maybe (k, a_amJd)
- Data.EnumMap.Lazy: lookupGT :: forall k (a_amp2 :: Type). Enum k => k -> EnumMap k a_amp2 -> Maybe (k, a_amp2)
+ Data.EnumMap.Lazy: lookupGT :: forall k (a_amGz :: Type). Enum k => k -> EnumMap k a_amGz -> Maybe (k, a_amGz)
- Data.EnumMap.Lazy: lookupLE :: forall k (a_amqd :: Type). Enum k => k -> EnumMap k a_amqd -> Maybe (k, a_amqd)
+ Data.EnumMap.Lazy: lookupLE :: forall k (a_amHT :: Type). Enum k => k -> EnumMap k a_amHT -> Maybe (k, a_amHT)
- Data.EnumMap.Lazy: lookupLT :: forall k (a_amnR :: Type). Enum k => k -> EnumMap k a_amnR -> Maybe (k, a_amnR)
+ Data.EnumMap.Lazy: lookupLT :: forall k (a_amFf :: Type). Enum k => k -> EnumMap k a_amFf -> Maybe (k, a_amFf)
- 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: map :: forall k (a_aAsH :: Type) (b_aAsI :: Type). (a_aAsH -> b_aAsI) -> EnumMap k a_aAsH -> EnumMap k b_aAsI
- 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: mapAccum :: forall k (a_aAxC :: Type) (b_aAxD :: Type) (c_aAxE :: Type). (a_aAxC -> b_aAxD -> (a_aAxC, c_aAxE)) -> a_aAxC -> EnumMap k b_aAxD -> (a_aAxC, EnumMap k c_aAxE)
- 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: mapAccumRWithKey :: forall k (a_aACe :: Type) (b_aACf :: Type) (c_aACg :: Type). Enum k => (a_aACe -> k -> b_aACf -> (a_aACe, c_aACg)) -> a_aACe -> EnumMap k b_aACf -> (a_aACe, EnumMap k c_aACg)
- 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: mapAccumWithKey :: forall k (a_aAzM :: Type) (b_aAzN :: Type) (c_aAzO :: Type). Enum k => (a_aAzM -> k -> b_aAzN -> (a_aAzM, c_aAzO)) -> a_aAzM -> EnumMap k b_aAzN -> (a_aAzM, EnumMap k c_aAzO)
- 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: mapEither :: forall k (a_aBqp :: Type) (b_aBqq :: Type) (c_aBqr :: Type). (a_aBqp -> Either b_aBqq c_aBqr) -> EnumMap k a_aBqp -> (EnumMap k b_aBqq, EnumMap k c_aBqr)
- 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: mapEitherWithKey :: forall k (a_aBs2 :: Type) (b_aBs3 :: Type) (c_aBs4 :: Type). Enum k => (k -> a_aBs2 -> Either b_aBs3 c_aBs4) -> EnumMap k a_aBs2 -> (EnumMap k b_aBs3, EnumMap k c_aBs4)
- 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: mapKeys :: forall k k' (a_anBY :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_anBY -> EnumMap k' a_anBY
- 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: mapKeysMonotonic :: forall k k' (a_anFq :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_anFq -> EnumMap k' a_anFq
- 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: mapKeysWith :: forall k k' (a_aAG6 :: Type). (Enum k, Enum k') => (a_aAG6 -> a_aAG6 -> a_aAG6) -> (k -> k') -> EnumMap k a_aAG6 -> EnumMap k' a_aAG6
- 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: mapMaybe :: forall k (a_aBnu :: Type) (b_aBnv :: Type). (a_aBnu -> Maybe b_aBnv) -> EnumMap k a_aBnu -> EnumMap k b_aBnv
- 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: mapMaybeWithKey :: forall k (a_aBoN :: Type) (b_aBoO :: Type). Enum k => (k -> a_aBoN -> Maybe b_aBoO) -> EnumMap k a_aBoN -> EnumMap k b_aBoO
- 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: mapWithKey :: forall k (a_aAu0 :: Type) (b_aAu1 :: Type). Enum k => (k -> a_aAu0 -> b_aAu1) -> EnumMap k a_aAu0 -> EnumMap k b_aAu1
- Data.EnumMap.Lazy: maxView :: forall k (a_aof0 :: Type). EnumMap k a_aof0 -> Maybe (a_aof0, EnumMap k a_aof0)
+ Data.EnumMap.Lazy: maxView :: forall k (a_aoNs :: Type). EnumMap k a_aoNs -> Maybe (a_aoNs, EnumMap k a_aoNs)
- 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: maxViewWithKey :: forall k (a_aoPK :: Type). Enum k => EnumMap k a_aoPK -> Maybe ((k, a_aoPK), EnumMap k a_aoPK)
- Data.EnumMap.Lazy: member :: forall k (a_amjR :: Type). Enum k => k -> EnumMap k a_amjR -> Bool
+ Data.EnumMap.Lazy: member :: forall k (a_amAF :: Type). Enum k => k -> EnumMap k a_amAF -> Bool
- 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: mergeWithKey :: forall k (a_aApI :: Type) (b_aApJ :: Type) (c_aApK :: Type). Enum k => (k -> a_aApI -> b_aApJ -> Maybe c_aApK) -> (EnumMap k a_aApI -> EnumMap k c_aApK) -> (EnumMap k b_aApJ -> EnumMap k c_aApK) -> EnumMap k a_aApI -> EnumMap k b_aApJ -> EnumMap k c_aApK
- Data.EnumMap.Lazy: minView :: forall k (a_aoe7 :: Type). EnumMap k a_aoe7 -> Maybe (a_aoe7, EnumMap k a_aoe7)
+ Data.EnumMap.Lazy: minView :: forall k (a_aoMq :: Type). EnumMap k a_aoMq -> Maybe (a_aoMq, EnumMap k a_aoMq)
- 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: minViewWithKey :: forall k (a_aoOu :: Type). Enum k => EnumMap k a_aoOu -> Maybe ((k, a_aoOu), EnumMap k a_aoOu)
- Data.EnumMap.Lazy: notMember :: forall k (a_amkN :: Type). Enum k => k -> EnumMap k a_amkN -> Bool
+ Data.EnumMap.Lazy: notMember :: forall k (a_amBK :: Type). Enum k => k -> EnumMap k a_amBK -> Bool
- Data.EnumMap.Lazy: null :: forall k (a_amiB :: Type). EnumMap k a_amiB -> Bool
+ Data.EnumMap.Lazy: null :: forall k (a_amz7 :: Type). EnumMap k a_amz7 -> Bool
- 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: partition :: forall k (a_aojl :: Type). (a_aojl -> Bool) -> EnumMap k a_aojl -> (EnumMap k a_aojl, EnumMap k a_aojl)
- 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: partitionWithKey :: forall k (a_aokI :: Type). Enum k => (k -> a_aokI -> Bool) -> EnumMap k a_aokI -> (EnumMap k a_aokI, EnumMap k a_aokI)
- Data.EnumMap.Lazy: showTree :: forall k (a_aoi7 :: Type). Show a_aoi7 => EnumMap k a_aoi7 -> String
+ Data.EnumMap.Lazy: showTree :: forall k (a_aoR0 :: Type). Show a_aoR0 => EnumMap k a_aoR0 -> String
- Data.EnumMap.Lazy: showTreeWith :: forall k (a_aoiR :: Type). Show a_aoiR => Bool -> Bool -> EnumMap k a_aoiR -> String
+ Data.EnumMap.Lazy: showTreeWith :: forall k (a_aoSk :: Type). Show a_aoSk => Bool -> Bool -> EnumMap k a_aoSk -> String
- Data.EnumMap.Lazy: singleton :: forall k (a_azh7 :: Type). Enum k => k -> a_azh7 -> EnumMap k a_azh7
+ Data.EnumMap.Lazy: singleton :: forall k (a_azOZ :: Type). Enum k => k -> a_azOZ -> EnumMap k a_azOZ
- Data.EnumMap.Lazy: size :: forall k (a_amje :: Type). EnumMap k a_amje -> Int
+ Data.EnumMap.Lazy: size :: forall k (a_amzT :: Type). EnumMap k a_amzT -> Int
- 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: split :: forall k (a_aosQ :: Type). Enum k => k -> EnumMap k a_aosQ -> (EnumMap k a_aosQ, EnumMap k a_aosQ)
- 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: splitLookup :: forall k (a_aou7 :: Type). Enum k => k -> EnumMap k a_aou7 -> (EnumMap k a_aou7, Maybe a_aou7, EnumMap k a_aou7)
- Data.EnumMap.Lazy: toAscList :: forall k (a_anFg :: Type). Enum k => EnumMap k a_anFg -> [(k, a_anFg)]
+ Data.EnumMap.Lazy: toAscList :: forall k (a_ao8P :: Type). Enum k => EnumMap k a_ao8P -> [(k, a_ao8P)]
- Data.EnumMap.Lazy: toDescList :: forall k (a_anGc :: Type). Enum k => EnumMap k a_anGc -> [(k, a_anGc)]
+ Data.EnumMap.Lazy: toDescList :: forall k (a_ao9U :: Type). Enum k => EnumMap k a_ao9U -> [(k, a_ao9U)]
- Data.EnumMap.Lazy: toList :: forall k (a_anA9 :: Type). Enum k => EnumMap k a_anA9 -> [(k, a_anA9)]
+ Data.EnumMap.Lazy: toList :: forall k (a_ao38 :: Type). Enum k => EnumMap k a_ao38 -> [(k, a_ao38)]
- 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: traverseWithKey :: forall k (t_aAvC :: Type -> Type) (a_aAvD :: Type) (b_aAvE :: Type). (Enum k, Functor t_aAvC, Applicative t_aAvC) => (k -> a_aAvD -> t_aAvC b_aAvE) -> EnumMap k a_aAvD -> t_aAvC (EnumMap k b_aAvE)
- Data.EnumMap.Lazy: union :: forall k (a_amKM :: Type). EnumMap k a_amKM -> EnumMap k a_amKM -> EnumMap k a_amKM
+ Data.EnumMap.Lazy: union :: forall k (a_an4D :: Type). EnumMap k a_an4D -> EnumMap k a_an4D -> EnumMap k a_an4D
- 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: unionWith :: forall k (a_aA9v :: Type). (a_aA9v -> a_aA9v -> a_aA9v) -> EnumMap k a_aA9v -> EnumMap k a_aA9v -> EnumMap k a_aA9v
- 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: unionWithKey :: forall k (a_aAb5 :: Type). Enum k => (k -> a_aAb5 -> a_aAb5 -> a_aAb5) -> EnumMap k a_aAb5 -> EnumMap k a_aAb5 -> EnumMap k a_aAb5
- Data.EnumMap.Lazy: unions :: forall k (a_amOO :: Type). [EnumMap k a_amOO] -> EnumMap k a_amOO
+ Data.EnumMap.Lazy: unions :: forall k (f_an96 :: Type -> Type) (a_an97 :: Type). (Functor f_an96, Foldable f_an96) => f_an96 (EnumMap k a_an97) -> EnumMap k a_an97
- 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: unionsWith :: forall k (f_aAe5 :: Type -> Type) (a_aAe6 :: Type). (Functor f_aAe5, Foldable f_aAe5) => (a_aAe6 -> a_aAe6 -> a_aAe6) -> f_aAe5 (EnumMap k a_aAe6) -> EnumMap k a_aAe6
- 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: update :: forall k (a_aA1S :: Type). Enum k => (a_aA1S -> Maybe a_aA1S) -> k -> EnumMap k a_aA1S -> EnumMap k a_aA1S
- 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: updateLookupWithKey :: forall k (a_aA53 :: Type). Enum k => (k -> a_aA53 -> Maybe a_aA53) -> k -> EnumMap k a_aA53 -> (Maybe a_aA53, EnumMap k a_aA53)
- 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: updateMax :: forall k (a_aBJa :: Type). (a_aBJa -> Maybe a_aBJa) -> EnumMap k a_aBJa -> EnumMap k a_aBJa
- 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: updateMaxWithKey :: forall k (a_aBLP :: Type). Enum k => (k -> a_aBLP -> Maybe a_aBLP) -> EnumMap k a_aBLP -> EnumMap k a_aBLP
- 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: updateMin :: forall k (a_aBHZ :: Type). (a_aBHZ -> Maybe a_aBHZ) -> EnumMap k a_aBHZ -> EnumMap k a_aBHZ
- 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: updateMinWithKey :: forall k (a_aBKl :: Type). Enum k => (k -> a_aBKl -> Maybe a_aBKl) -> EnumMap k a_aBKl -> EnumMap k a_aBKl
- 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.Lazy: updateWithKey :: forall k (a_aA3m :: Type). Enum k => (k -> a_aA3m -> Maybe a_aA3m) -> k -> EnumMap k a_aA3m -> EnumMap k a_aA3m
- Data.EnumMap.Strict: (!) :: forall k (a_amgJ :: Type). Enum k => EnumMap k a_amgJ -> k -> a_amgJ
+ Data.EnumMap.Strict: (!) :: forall k (a_amwT :: Type). Enum k => EnumMap k a_amwT -> k -> a_amwT
- 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: (\\) :: forall k (a_amxZ :: Type) (b_amy0 :: Type). EnumMap k a_amxZ -> EnumMap k b_amy0 -> EnumMap k a_amxZ
- 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: adjust :: forall k (a_amUO :: Type). Enum k => (a_amUO -> a_amUO) -> k -> EnumMap k a_amUO -> EnumMap k a_amUO
- 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: adjustWithKey :: forall k (a_amWi :: Type). Enum k => (k -> a_amWi -> a_amWi) -> k -> EnumMap k a_amWi -> EnumMap k a_amWi
- 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: alter :: forall k (a_an35 :: Type). Enum k => (Maybe a_an35 -> Maybe a_an35) -> k -> EnumMap k a_an35 -> EnumMap k a_an35
- Data.EnumMap.Strict: assocs :: forall k (a_anxs :: Type). Enum k => EnumMap k a_anxs -> [(k, a_anxs)]
+ Data.EnumMap.Strict: assocs :: forall k (a_ao00 :: Type). Enum k => EnumMap k a_ao00 -> [(k, a_ao00)]
- Data.EnumMap.Strict: delete :: forall k (a_amAS :: Type). Enum k => k -> EnumMap k a_amAS -> EnumMap k a_amAS
+ Data.EnumMap.Strict: delete :: forall k (a_amTI :: Type). Enum k => k -> EnumMap k a_amTI -> EnumMap k a_amTI
- 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: deleteFindMax :: forall k (a_aoFT :: Type). Enum k => EnumMap k a_aoFT -> ((k, a_aoFT), EnumMap k a_aoFT)
- 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: deleteFindMin :: forall k (a_aoEG :: Type). Enum k => EnumMap k a_aoEG -> ((k, a_aoEG), EnumMap k a_aoEG)
- Data.EnumMap.Strict: deleteMax :: forall k (a_ao6B :: Type). EnumMap k a_ao6B -> EnumMap k a_ao6B
+ Data.EnumMap.Strict: deleteMax :: forall k (a_aoDT :: Type). EnumMap k a_aoDT -> EnumMap k a_aoDT
- Data.EnumMap.Strict: deleteMin :: forall k (a_ao5X :: Type). EnumMap k a_ao5X -> EnumMap k a_ao5X
+ Data.EnumMap.Strict: deleteMin :: forall k (a_aoD6 :: Type). EnumMap k a_aoD6 -> EnumMap k a_aoD6
- 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: difference :: forall k (a_ancw :: Type) (b_ancx :: Type). EnumMap k a_ancw -> EnumMap k b_ancx -> EnumMap k a_ancw
- 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: differenceWith :: forall k (a_andE :: Type) (b_andF :: Type). (a_andE -> b_andF -> Maybe a_andE) -> EnumMap k a_andE -> EnumMap k b_andF -> EnumMap k a_andE
- 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: differenceWithKey :: forall k (a_anfm :: Type) (b_anfn :: Type). Enum k => (k -> a_anfm -> b_anfn -> Maybe a_anfm) -> EnumMap k a_anfm -> EnumMap k b_anfn -> EnumMap k a_anfm
- Data.EnumMap.Strict: elems :: forall k (a_anw1 :: Type). EnumMap k a_anw1 -> [a_anw1]
+ Data.EnumMap.Strict: elems :: forall k (a_anYh :: Type). EnumMap k a_anYh -> [a_anYh]
- Data.EnumMap.Strict: empty :: forall k (a_amsz :: Type). EnumMap k a_amsz
+ Data.EnumMap.Strict: empty :: forall k (a_amKx :: Type). EnumMap k a_amKx
- Data.EnumMap.Strict: filter :: forall k (a_anMf :: Type). (a_anMf -> Bool) -> EnumMap k a_anMf -> EnumMap k a_anMf
+ Data.EnumMap.Strict: filter :: forall k (a_aogG :: Type). (a_aogG -> Bool) -> EnumMap k a_aogG -> EnumMap k a_aogG
- 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: filterWithKey :: forall k (a_aohR :: Type). Enum k => (k -> a_aohR -> Bool) -> EnumMap k a_aohR -> EnumMap k a_aohR
- Data.EnumMap.Strict: findMax :: forall k (a_ao53 :: Type). Enum k => EnumMap k a_ao53 -> (k, a_ao53)
+ Data.EnumMap.Strict: findMax :: forall k (a_aoC3 :: Type). Enum k => EnumMap k a_aoC3 -> (k, a_aoC3)
- Data.EnumMap.Strict: findMin :: forall k (a_ao49 :: Type). Enum k => EnumMap k a_ao49 -> (k, a_ao49)
+ Data.EnumMap.Strict: findMin :: forall k (a_aoB0 :: Type). Enum k => EnumMap k a_aoB0 -> (k, a_aoB0)
- Data.EnumMap.Strict: findWithDefault :: forall k (a_ammJ :: Type). Enum k => a_ammJ -> k -> EnumMap k a_ammJ -> a_ammJ
+ Data.EnumMap.Strict: findWithDefault :: forall k (a_amDY :: Type). Enum k => a_amDY -> k -> EnumMap k a_amDY -> a_amDY
- 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: foldMapWithKey :: forall k (m_anOb :: Type) (a_anOc :: Type). (Enum k, Monoid m_anOb) => (k -> a_anOc -> m_anOb) -> EnumMap k a_anOc -> m_anOb
- 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 :: forall k (a_anIx :: Type) (b_anIy :: Type). (a_anIx -> b_anIy -> a_anIx) -> a_anIx -> EnumMap k b_anIy -> a_anIx
- 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: foldl' :: forall k (a_anSD :: Type) (b_anSE :: Type). (a_anSD -> b_anSE -> a_anSD) -> a_anSD -> EnumMap k b_anSE -> a_anSD
- 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 :: forall k (a_anMc :: Type) (b_anMd :: Type). Enum k => (a_anMc -> k -> b_anMd -> a_anMc) -> a_anMc -> EnumMap k b_anMd -> a_anMc
- 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: foldlWithKey' :: forall k (a_anWi :: Type) (b_anWj :: Type). Enum k => (a_anWi -> k -> b_anWj -> a_anWi) -> a_anWi -> EnumMap k b_anWj -> a_anWi
- 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 :: forall k (a_anGR :: Type) (b_anGS :: Type). (a_anGR -> b_anGS -> b_anGS) -> b_anGS -> EnumMap k a_anGR -> b_anGS
- 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: foldr' :: forall k (a_anQX :: Type) (b_anQY :: Type). (a_anQX -> b_anQY -> b_anQY) -> b_anQY -> EnumMap k a_anQX -> b_anQY
- 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 :: forall k (a_anKd :: Type) (b_anKe :: Type). Enum k => (k -> a_anKd -> b_anKe -> b_anKe) -> b_anKe -> EnumMap k a_anKd -> b_anKe
- 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: foldrWithKey' :: forall k (a_anUj :: Type) (b_anUk :: Type). Enum k => (k -> a_anUj -> b_anUk -> b_anUk) -> b_anUk -> EnumMap k a_anUj -> b_anUk
- Data.EnumMap.Strict: fromAscList :: forall k (a_anH8 :: Type). Enum k => [(k, a_anH8)] -> EnumMap k a_anH8
+ Data.EnumMap.Strict: fromAscList :: forall k (a_aoaZ :: Type). Enum k => [(k, a_aoaZ)] -> EnumMap k a_aoaZ
- 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: fromAscListWith :: forall k (a_aoc4 :: Type). Enum k => (a_aoc4 -> a_aoc4 -> a_aoc4) -> [(k, a_aoc4)] -> EnumMap k a_aoc4
- 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: fromAscListWithKey :: forall k (a_aodJ :: Type). Enum k => (k -> a_aodJ -> a_aodJ -> a_aodJ) -> [(k, a_aodJ)] -> EnumMap k a_aodJ
- Data.EnumMap.Strict: fromDistinctAscList :: forall k (a_anLj :: Type). Enum k => [(k, a_anLj)] -> EnumMap k a_anLj
+ Data.EnumMap.Strict: fromDistinctAscList :: forall k (a_aofB :: Type). Enum k => [(k, a_aofB)] -> EnumMap k a_aofB
- Data.EnumMap.Strict: fromList :: forall k (a_anB5 :: Type). Enum k => [(k, a_anB5)] -> EnumMap k a_anB5
+ Data.EnumMap.Strict: fromList :: forall k (a_ao4d :: Type). Enum k => [(k, a_ao4d)] -> EnumMap k a_ao4d
- 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: fromListWith :: forall k (a_ao5i :: Type). Enum k => (a_ao5i -> a_ao5i -> a_ao5i) -> [(k, a_ao5i)] -> EnumMap k a_ao5i
- 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: fromListWithKey :: forall k (a_ao6X :: Type). Enum k => (k -> a_ao6X -> a_ao6X -> a_ao6X) -> [(k, a_ao6X)] -> EnumMap k a_ao6X
- Data.EnumMap.Strict: fromSet :: forall k (a_anz1 :: Type). Enum k => (k -> a_anz1) -> EnumSet k -> EnumMap k a_anz1
+ Data.EnumMap.Strict: fromSet :: forall k (a_ao1R :: Type). Enum k => (k -> a_ao1R) -> EnumSet k -> EnumMap k a_ao1R
- 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: insert :: forall k (a_amMa :: Type). Enum k => k -> a_amMa -> EnumMap k a_amMa -> EnumMap k a_amMa
- 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: insertLookupWithKey :: forall k (a_amRp :: Type). Enum k => (k -> a_amRp -> a_amRp -> a_amRp) -> k -> a_amRp -> EnumMap k a_amRp -> (Maybe a_amRp, EnumMap k a_amRp)
- 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: insertWith :: forall k (a_amNs :: Type). Enum k => (a_amNs -> a_amNs -> a_amNs) -> k -> a_amNs -> EnumMap k a_amNs -> EnumMap k a_amNs
- 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: insertWithKey :: forall k (a_amPk :: Type). Enum k => (k -> a_amPk -> a_amPk -> a_amPk) -> k -> a_amPk -> EnumMap k a_amPk -> EnumMap k a_amPk
- 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: intersection :: forall k (a_anhn :: Type) (b_anho :: Type). EnumMap k a_anhn -> EnumMap k b_anho -> EnumMap k a_anhn
- 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: intersectionWith :: forall k (a_aniv :: Type) (b_aniw :: Type) (c_anix :: Type). (a_aniv -> b_aniw -> c_anix) -> EnumMap k a_aniv -> EnumMap k b_aniw -> EnumMap k c_anix
- 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: intersectionWithKey :: forall k (a_ankl :: Type) (b_ankm :: Type) (c_ankn :: Type). Enum k => (k -> a_ankl -> b_ankm -> c_ankn) -> EnumMap k a_ankl -> EnumMap k b_ankm -> EnumMap k c_ankn
- Data.EnumMap.Strict: isProperSubmapOf :: forall k (a_ao1H :: Type). Eq a_ao1H => EnumMap k a_ao1H -> EnumMap k a_ao1H -> Bool
+ Data.EnumMap.Strict: isProperSubmapOf :: forall k (a_aoyd :: Type). Eq a_aoyd => EnumMap k a_aoyd -> EnumMap k a_aoyd -> 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: isProperSubmapOfBy :: forall k (a_aozj :: Type) (b_aozk :: Type). (a_aozj -> b_aozk -> Bool) -> EnumMap k a_aozj -> EnumMap k b_aozk -> 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: isSubmapOf :: forall k (a_aovq :: Type). Eq a_aovq => EnumMap k a_aovq -> EnumMap k a_aovq -> 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: isSubmapOfBy :: forall k (a_aoww :: Type) (b_aowx :: Type). (a_aoww -> b_aowx -> Bool) -> EnumMap k a_aoww -> EnumMap k b_aowx -> Bool
- Data.EnumMap.Strict: keys :: forall k (a_anwG :: Type). Enum k => EnumMap k a_anwG -> [k]
+ Data.EnumMap.Strict: keys :: forall k (a_anZ5 :: Type). Enum k => EnumMap k a_anZ5 -> [k]
- Data.EnumMap.Strict: keysSet :: forall k (a_anyo :: Type). EnumMap k a_anyo -> EnumSet k
+ Data.EnumMap.Strict: keysSet :: forall k (a_ao15 :: Type). EnumMap k a_ao15 -> EnumSet k
- Data.EnumMap.Strict: lookup :: forall k (a_amlJ :: Type). Enum k => k -> EnumMap k a_amlJ -> Maybe a_amlJ
+ Data.EnumMap.Strict: lookup :: forall k (a_amCP :: Type). Enum k => k -> EnumMap k a_amCP -> Maybe a_amCP
- Data.EnumMap.Strict: lookupGE :: forall k (a_amro :: Type). Enum k => k -> EnumMap k a_amro -> Maybe (k, a_amro)
+ Data.EnumMap.Strict: lookupGE :: forall k (a_amJd :: Type). Enum k => k -> EnumMap k a_amJd -> Maybe (k, a_amJd)
- Data.EnumMap.Strict: lookupGT :: forall k (a_amp2 :: Type). Enum k => k -> EnumMap k a_amp2 -> Maybe (k, a_amp2)
+ Data.EnumMap.Strict: lookupGT :: forall k (a_amGz :: Type). Enum k => k -> EnumMap k a_amGz -> Maybe (k, a_amGz)
- Data.EnumMap.Strict: lookupLE :: forall k (a_amqd :: Type). Enum k => k -> EnumMap k a_amqd -> Maybe (k, a_amqd)
+ Data.EnumMap.Strict: lookupLE :: forall k (a_amHT :: Type). Enum k => k -> EnumMap k a_amHT -> Maybe (k, a_amHT)
- Data.EnumMap.Strict: lookupLT :: forall k (a_amnR :: Type). Enum k => k -> EnumMap k a_amnR -> Maybe (k, a_amnR)
+ Data.EnumMap.Strict: lookupLT :: forall k (a_amFf :: Type). Enum k => k -> EnumMap k a_amFf -> Maybe (k, a_amFf)
- 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: map :: forall k (a_anpt :: Type) (b_anpu :: Type). (a_anpt -> b_anpu) -> EnumMap k a_anpt -> EnumMap k b_anpu
- 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: mapAccum :: forall k (a_anuU :: Type) (b_anuV :: Type) (c_anuW :: Type). (a_anuU -> b_anuV -> (a_anuU, c_anuW)) -> a_anuU -> EnumMap k b_anuV -> (a_anuU, EnumMap k c_anuW)
- 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: mapAccumRWithKey :: forall k (a_anzw :: Type) (b_anzx :: Type) (c_anzy :: Type). Enum k => (a_anzw -> k -> b_anzx -> (a_anzw, c_anzy)) -> a_anzw -> EnumMap k b_anzx -> (a_anzw, EnumMap k c_anzy)
- 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: mapAccumWithKey :: forall k (a_anx4 :: Type) (b_anx5 :: Type) (c_anx6 :: Type). Enum k => (a_anx4 -> k -> b_anx5 -> (a_anx4, c_anx6)) -> a_anx4 -> EnumMap k b_anx5 -> (a_anx4, EnumMap k c_anx6)
- 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: mapEither :: forall k (a_aopi :: Type) (b_aopj :: Type) (c_aopk :: Type). (a_aopi -> Either b_aopj c_aopk) -> EnumMap k a_aopi -> (EnumMap k b_aopj, EnumMap k c_aopk)
- 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: mapEitherWithKey :: forall k (a_aoqV :: Type) (b_aoqW :: Type) (c_aoqX :: Type). Enum k => (k -> a_aoqV -> Either b_aoqW c_aoqX) -> EnumMap k a_aoqV -> (EnumMap k b_aoqW, EnumMap k c_aoqX)
- 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: mapKeys :: forall k k' (a_anBY :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_anBY -> EnumMap k' a_anBY
- 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: mapKeysMonotonic :: forall k k' (a_anFq :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_anFq -> EnumMap k' a_anFq
- 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: mapKeysWith :: forall k k' (a_anDp :: Type). (Enum k, Enum k') => (a_anDp -> a_anDp -> a_anDp) -> (k -> k') -> EnumMap k a_anDp -> EnumMap k' a_anDp
- 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: mapMaybe :: forall k (a_aomn :: Type) (b_aomo :: Type). (a_aomn -> Maybe b_aomo) -> EnumMap k a_aomn -> EnumMap k b_aomo
- 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: mapMaybeWithKey :: forall k (a_aonG :: Type) (b_aonH :: Type). Enum k => (k -> a_aonG -> Maybe b_aonH) -> EnumMap k a_aonG -> EnumMap k b_aonH
- 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: mapWithKey :: forall k (a_anqM :: Type) (b_anqN :: Type). Enum k => (k -> a_anqM -> b_anqN) -> EnumMap k a_anqM -> EnumMap k b_anqN
- Data.EnumMap.Strict: maxView :: forall k (a_aof0 :: Type). EnumMap k a_aof0 -> Maybe (a_aof0, EnumMap k a_aof0)
+ Data.EnumMap.Strict: maxView :: forall k (a_aoNs :: Type). EnumMap k a_aoNs -> Maybe (a_aoNs, EnumMap k a_aoNs)
- 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: maxViewWithKey :: forall k (a_aoPK :: Type). Enum k => EnumMap k a_aoPK -> Maybe ((k, a_aoPK), EnumMap k a_aoPK)
- Data.EnumMap.Strict: member :: forall k (a_amjR :: Type). Enum k => k -> EnumMap k a_amjR -> Bool
+ Data.EnumMap.Strict: member :: forall k (a_amAF :: Type). Enum k => k -> EnumMap k a_amAF -> Bool
- 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: mergeWithKey :: forall k (a_anmu :: Type) (b_anmv :: Type) (c_anmw :: Type). Enum k => (k -> a_anmu -> b_anmv -> Maybe c_anmw) -> (EnumMap k a_anmu -> EnumMap k c_anmw) -> (EnumMap k b_anmv -> EnumMap k c_anmw) -> EnumMap k a_anmu -> EnumMap k b_anmv -> EnumMap k c_anmw
- Data.EnumMap.Strict: minView :: forall k (a_aoe7 :: Type). EnumMap k a_aoe7 -> Maybe (a_aoe7, EnumMap k a_aoe7)
+ Data.EnumMap.Strict: minView :: forall k (a_aoMq :: Type). EnumMap k a_aoMq -> Maybe (a_aoMq, EnumMap k a_aoMq)
- 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: minViewWithKey :: forall k (a_aoOu :: Type). Enum k => EnumMap k a_aoOu -> Maybe ((k, a_aoOu), EnumMap k a_aoOu)
- Data.EnumMap.Strict: notMember :: forall k (a_amkN :: Type). Enum k => k -> EnumMap k a_amkN -> Bool
+ Data.EnumMap.Strict: notMember :: forall k (a_amBK :: Type). Enum k => k -> EnumMap k a_amBK -> Bool
- Data.EnumMap.Strict: null :: forall k (a_amiB :: Type). EnumMap k a_amiB -> Bool
+ Data.EnumMap.Strict: null :: forall k (a_amz7 :: Type). EnumMap k a_amz7 -> Bool
- 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: partition :: forall k (a_aojl :: Type). (a_aojl -> Bool) -> EnumMap k a_aojl -> (EnumMap k a_aojl, EnumMap k a_aojl)
- 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: partitionWithKey :: forall k (a_aokI :: Type). Enum k => (k -> a_aokI -> Bool) -> EnumMap k a_aokI -> (EnumMap k a_aokI, EnumMap k a_aokI)
- Data.EnumMap.Strict: showTree :: forall k (a_aoi7 :: Type). Show a_aoi7 => EnumMap k a_aoi7 -> String
+ Data.EnumMap.Strict: showTree :: forall k (a_aoR0 :: Type). Show a_aoR0 => EnumMap k a_aoR0 -> String
- Data.EnumMap.Strict: showTreeWith :: forall k (a_aoiR :: Type). Show a_aoiR => Bool -> Bool -> EnumMap k a_aoiR -> String
+ Data.EnumMap.Strict: showTreeWith :: forall k (a_aoSk :: Type). Show a_aoSk => Bool -> Bool -> EnumMap k a_aoSk -> String
- Data.EnumMap.Strict: singleton :: forall k (a_amsY :: Type). Enum k => k -> a_amsY -> EnumMap k a_amsY
+ Data.EnumMap.Strict: singleton :: forall k (a_amL5 :: Type). Enum k => k -> a_amL5 -> EnumMap k a_amL5
- Data.EnumMap.Strict: size :: forall k (a_amje :: Type). EnumMap k a_amje -> Int
+ Data.EnumMap.Strict: size :: forall k (a_amzT :: Type). EnumMap k a_amzT -> Int
- 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: split :: forall k (a_aosQ :: Type). Enum k => k -> EnumMap k a_aosQ -> (EnumMap k a_aosQ, EnumMap k a_aosQ)
- 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: splitLookup :: forall k (a_aou7 :: Type). Enum k => k -> EnumMap k a_aou7 -> (EnumMap k a_aou7, Maybe a_aou7, EnumMap k a_aou7)
- Data.EnumMap.Strict: toAscList :: forall k (a_anFg :: Type). Enum k => EnumMap k a_anFg -> [(k, a_anFg)]
+ Data.EnumMap.Strict: toAscList :: forall k (a_ao8P :: Type). Enum k => EnumMap k a_ao8P -> [(k, a_ao8P)]
- Data.EnumMap.Strict: toDescList :: forall k (a_anGc :: Type). Enum k => EnumMap k a_anGc -> [(k, a_anGc)]
+ Data.EnumMap.Strict: toDescList :: forall k (a_ao9U :: Type). Enum k => EnumMap k a_ao9U -> [(k, a_ao9U)]
- Data.EnumMap.Strict: toList :: forall k (a_anA9 :: Type). Enum k => EnumMap k a_anA9 -> [(k, a_anA9)]
+ Data.EnumMap.Strict: toList :: forall k (a_ao38 :: Type). Enum k => EnumMap k a_ao38 -> [(k, a_ao38)]
- 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: traverseWithKey :: forall k (t_anso :: Type -> Type) (a_ansp :: Type) (b_ansq :: Type). (Enum k, Functor t_anso, Applicative t_anso) => (k -> a_ansp -> t_anso b_ansq) -> EnumMap k a_ansp -> t_anso (EnumMap k b_ansq)
- Data.EnumMap.Strict: union :: forall k (a_amKM :: Type). EnumMap k a_amKM -> EnumMap k a_amKM -> EnumMap k a_amKM
+ Data.EnumMap.Strict: union :: forall k (a_an4D :: Type). EnumMap k a_an4D -> EnumMap k a_an4D -> EnumMap k a_an4D
- 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: unionWith :: forall k (a_an5D :: Type). (a_an5D -> a_an5D -> a_an5D) -> EnumMap k a_an5D -> EnumMap k a_an5D -> EnumMap k a_an5D
- 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: unionWithKey :: forall k (a_an7d :: Type). Enum k => (k -> a_an7d -> a_an7d -> a_an7d) -> EnumMap k a_an7d -> EnumMap k a_an7d -> EnumMap k a_an7d
- Data.EnumMap.Strict: unions :: forall k (a_amOO :: Type). [EnumMap k a_amOO] -> EnumMap k a_amOO
+ Data.EnumMap.Strict: unions :: forall k (f_an96 :: Type -> Type) (a_an97 :: Type). (Functor f_an96, Foldable f_an96) => f_an96 (EnumMap k a_an97) -> EnumMap k a_an97
- 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: unionsWith :: forall k (f_anaN :: Type -> Type) (a_anaO :: Type). (Functor f_anaN, Foldable f_anaN) => (a_anaO -> a_anaO -> a_anaO) -> f_anaN (EnumMap k a_anaO) -> EnumMap k a_anaO
- 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: update :: forall k (a_amXZ :: Type). Enum k => (a_amXZ -> Maybe a_amXZ) -> k -> EnumMap k a_amXZ -> EnumMap k a_amXZ
- 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: updateLookupWithKey :: forall k (a_an1a :: Type). Enum k => (k -> a_an1a -> Maybe a_an1a) -> k -> EnumMap k a_an1a -> (Maybe a_an1a, EnumMap k a_an1a)
- 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: updateMax :: forall k (a_aoIh :: Type). (a_aoIh -> Maybe a_aoIh) -> EnumMap k a_aoIh -> EnumMap k a_aoIh
- 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: updateMaxWithKey :: forall k (a_aoKW :: Type). Enum k => (k -> a_aoKW -> Maybe a_aoKW) -> EnumMap k a_aoKW -> EnumMap k a_aoKW
- 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: updateMin :: forall k (a_aoH6 :: Type). (a_aoH6 -> Maybe a_aoH6) -> EnumMap k a_aoH6 -> EnumMap k a_aoH6
- 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: updateMinWithKey :: forall k (a_aoJs :: Type). Enum k => (k -> a_aoJs -> Maybe a_aoJs) -> EnumMap k a_aoJs -> EnumMap k a_aoJs
- 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.EnumMap.Strict: updateWithKey :: forall k (a_amZt :: Type). Enum k => (k -> a_amZt -> Maybe a_amZt) -> k -> EnumMap k a_amZt -> EnumMap k a_amZt
- Data.EnumSet: foldl :: forall k (a_ahbQ :: Type). Enum k => (a_ahbQ -> k -> a_ahbQ) -> a_ahbQ -> EnumSet k -> a_ahbQ
+ Data.EnumSet: foldl :: forall k (a_agdl :: Type). Enum k => (a_agdl -> k -> a_agdl) -> a_agdl -> EnumSet k -> a_agdl
- Data.EnumSet: foldl' :: forall k (a_aheQ :: Type). Enum k => (a_aheQ -> k -> a_aheQ) -> a_aheQ -> EnumSet k -> a_aheQ
+ Data.EnumSet: foldl' :: forall k (a_aggD :: Type). Enum k => (a_aggD -> k -> a_aggD) -> a_aggD -> EnumSet k -> a_aggD
- Data.EnumSet: foldr :: forall k (b_ahal :: Type). Enum k => (k -> b_ahal -> b_ahal) -> b_ahal -> EnumSet k -> b_ahal
+ Data.EnumSet: foldr :: forall k (b_agbH :: Type). Enum k => (k -> b_agbH -> b_agbH) -> b_agbH -> EnumSet k -> b_agbH
- Data.EnumSet: foldr' :: forall k (b_ahdl :: Type). Enum k => (k -> b_ahdl -> b_ahdl) -> b_ahdl -> EnumSet k -> b_ahdl
+ Data.EnumSet: foldr' :: forall k (b_ageZ :: Type). Enum k => (k -> b_ageZ -> b_ageZ) -> b_ageZ -> EnumSet k -> b_ageZ
- Data.EnumSet: unions :: forall k. [EnumSet k] -> EnumSet k
+ Data.EnumSet: unions :: forall k (f_afJc :: Type -> Type). (Functor f_afJc, Foldable f_afJc) => f_afJc (EnumSet k) -> EnumSet k
Files
- CHANGELOG.md +3/−0
- Data/EnumMapSetWrapper.hs +4/−0
- Data/EnumSet.hs +2/−1
- README.md +6/−0
- enummapset-th.cabal +10/−7
- include/map.inc +4/−2
+ CHANGELOG.md view
@@ -0,0 +1,3 @@+## v0.6.2 (Jul 2020)++* Support GHC 8.6 or newer
Data/EnumMapSetWrapper.hs view
@@ -180,6 +180,10 @@ (a'unwrap, cxt, a') = neg k a unwrap = VarE 'map `AppE` a'unwrap + VarT v `AppT` a -> (unwrap, AppT (ConT ''Functor) (VarT v) : cxt, VarT v `AppT` a') where+ (a'unwrap, cxt, a') = neg k a+ unwrap = VarE 'fmap `AppE` a'unwrap+ _ -> (VarE 'id, [], typ) ------------------------------------------------------------------------
Data/EnumSet.hs view
@@ -13,6 +13,7 @@ import Data.IntSet import Data.Typeable import Data.Data+import Data.Semigroup import Data.Monoid import Text.ParserCombinators.ReadPrec import Text.Read@@ -21,7 +22,7 @@ import Data.EnumMapSetWrapper newtype EnumSet k = EnumSet { unEnumSet :: IntSet } deriving- (Eq, Ord, Monoid, Typeable, Data, NFData)+ (Eq, Ord, Semigroup, Monoid, Typeable, Data, NFData) -- * Operators w '(\\)
+ README.md view
@@ -0,0 +1,6 @@+[](https://travis-ci.org/tsurucapital/enummapset-th)++* [`Data.EnumSet`](http://hackage.haskell.org/package/enummapset-th/docs/Data-EnumSet.html)+* [`Data.EnumMap.Lazy`](http://hackage.haskell.org/package/enummapset-th/docs/Data-EnumMap-Lazy.html)+* [`Data.EnumMap.Strict`](http://hackage.haskell.org/package/enummapset-th/docs/Data-EnumMap-Strict.html)+
enummapset-th.cabal view
@@ -1,5 +1,6 @@+cabal-version: 2.4 name: enummapset-th-version: 0.6.1.1+version: 0.6.2 synopsis: TH-generated EnumSet/EnumMap wrappers around IntSet/IntMap. description: This package wraps @IntSet@ and @IntMap@ from @containers@, and provides@@ -15,17 +16,18 @@ newtype wrappers, and their respective 'Functor' instances behave as expected, unlike that of @IntMap@ which is alway lazy. homepage: https://github.com/tsurucapital/enummapset-th-license: BSD3+license: BSD-3-Clause license-file: LICENSE author: Liyang HU-maintainer: enummapset-th@liyang.hu+maintainer: Fumiaki Kinoshita <fumiexcel@gmail.com> 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, GHC == 8.0.1+tested-with: GHC == 8.6.5, GHC == 8.8.4, GHC == 8.10.1 extra-source-files: include/map.inc+ README.md+ CHANGELOG.md source-repository head type: git@@ -39,12 +41,13 @@ other-modules: Data.EnumMapSetWrapper build-depends:- base >= 4.5 && < 5,+ base >= 4.9 && < 5, deepseq >= 1.3,- containers >= 0.5.3 && < 0.6,+ containers >= 0.5.3 && < 0.7, template-haskell >= 2.7 include-dirs: include ghc-options: -Wall+ default-language: Haskell2010 -- vim: et sw=4 ts=4 sts=4:
include/map.inc view
@@ -13,7 +13,9 @@ import Control.DeepSeq import Data.Data import Data.Foldable (Foldable)-import Data.IntMap.STRICT+import Data.IntMap.STRICT hiding (showTree, showTreeWith)+import Data.IntMap.Internal.Debug+import Data.Semigroup import Data.Monoid import Data.Traversable import Text.ParserCombinators.ReadPrec@@ -25,7 +27,7 @@ infixr 1 `EnumMap` newtype EnumMap k v = EnumMap { unEnumMap :: IntMap v } deriving- (Eq, Ord, Monoid, Typeable, Data, NFData)+ (Eq, Ord, Semigroup, Monoid, Typeable, Data, NFData) ------------------------------------------------------------------------