enummapset-th 0.6.0.2 → 0.6.1.0
raw patch · 2 files changed
+4/−2 lines, 2 filesdep ~containersPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: containers
API changes (from Hackage documentation)
- Data.EnumMap.Lazy: instance (Data k, Data v) => Data (EnumMap k v)
- Data.EnumMap.Lazy: instance (Enum k, Read k, Read a) => Read (EnumMap k a)
- Data.EnumMap.Lazy: instance (Enum k, Show k, Show a) => Show (EnumMap k a)
- Data.EnumMap.Lazy: instance Eq v => Eq (EnumMap k v)
- Data.EnumMap.Lazy: instance Foldable (EnumMap k)
- Data.EnumMap.Lazy: instance Functor (EnumMap k)
- Data.EnumMap.Lazy: instance Monoid (EnumMap k v)
- Data.EnumMap.Lazy: instance NFData v => NFData (EnumMap k v)
- Data.EnumMap.Lazy: instance Ord v => Ord (EnumMap k v)
- Data.EnumMap.Lazy: instance Traversable (EnumMap k)
- Data.EnumMap.Lazy: instance Typeable EnumMap
- Data.EnumMap.Lazy: unEnumMap :: EnumMap k v -> IntMap v
- Data.EnumMap.Strict: instance (Data k, Data v) => Data (EnumMap k v)
- Data.EnumMap.Strict: instance (Enum k, Read k, Read a) => Read (EnumMap k a)
- Data.EnumMap.Strict: instance (Enum k, Show k, Show a) => Show (EnumMap k a)
- Data.EnumMap.Strict: instance Eq v => Eq (EnumMap k v)
- Data.EnumMap.Strict: instance Foldable (EnumMap k)
- Data.EnumMap.Strict: instance Functor (EnumMap k)
- Data.EnumMap.Strict: instance Monoid (EnumMap k v)
- Data.EnumMap.Strict: instance NFData v => NFData (EnumMap k v)
- Data.EnumMap.Strict: instance Ord v => Ord (EnumMap k v)
- Data.EnumMap.Strict: instance Traversable (EnumMap k)
- Data.EnumMap.Strict: instance Typeable EnumMap
- Data.EnumMap.Strict: unEnumMap :: EnumMap k v -> IntMap v
- Data.EnumSet: instance (Enum k, Read k) => Read (EnumSet k)
- Data.EnumSet: instance (Enum k, Show k) => Show (EnumSet k)
- Data.EnumSet: instance Data k => Data (EnumSet k)
- Data.EnumSet: instance Eq (EnumSet k)
- Data.EnumSet: instance Monoid (EnumSet k)
- Data.EnumSet: instance NFData (EnumSet k)
- Data.EnumSet: instance Ord (EnumSet k)
- Data.EnumSet: instance Typeable EnumSet
- Data.EnumSet: unEnumSet :: EnumSet k -> IntSet
+ Data.EnumMap.Lazy: [unEnumMap] :: EnumMap k v -> IntMap v
+ Data.EnumMap.Lazy: foldMapWithKey :: (Enum k, Monoid m_agKi) => (k -> a_agKh -> m_agKi) -> EnumMap k a_agKh -> m_agKi
+ Data.EnumMap.Lazy: instance (Data.Data.Data k, Data.Data.Data v) => Data.Data.Data (Data.EnumMap.Lazy.EnumMap k v)
+ Data.EnumMap.Lazy: instance (GHC.Enum.Enum k, GHC.Read.Read k, GHC.Read.Read a) => GHC.Read.Read (Data.EnumMap.Lazy.EnumMap k a)
+ Data.EnumMap.Lazy: instance (GHC.Enum.Enum k, GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (Data.EnumMap.Lazy.EnumMap k a)
+ Data.EnumMap.Lazy: instance Control.DeepSeq.NFData v => Control.DeepSeq.NFData (Data.EnumMap.Lazy.EnumMap k v)
+ Data.EnumMap.Lazy: instance Data.Foldable.Foldable (Data.EnumMap.Lazy.EnumMap k)
+ Data.EnumMap.Lazy: instance Data.Traversable.Traversable (Data.EnumMap.Lazy.EnumMap k)
+ Data.EnumMap.Lazy: instance GHC.Base.Functor (Data.EnumMap.Lazy.EnumMap k)
+ Data.EnumMap.Lazy: instance GHC.Base.Monoid (Data.EnumMap.Lazy.EnumMap k v)
+ Data.EnumMap.Lazy: instance GHC.Classes.Eq v => GHC.Classes.Eq (Data.EnumMap.Lazy.EnumMap k v)
+ Data.EnumMap.Lazy: instance GHC.Classes.Ord v => GHC.Classes.Ord (Data.EnumMap.Lazy.EnumMap k v)
+ Data.EnumMap.Strict: [unEnumMap] :: EnumMap k v -> IntMap v
+ Data.EnumMap.Strict: foldMapWithKey :: (Enum k, Monoid m_agKi) => (k -> a_agKh -> m_agKi) -> EnumMap k a_agKh -> m_agKi
+ Data.EnumMap.Strict: instance (Data.Data.Data k, Data.Data.Data v) => Data.Data.Data (Data.EnumMap.Strict.EnumMap k v)
+ Data.EnumMap.Strict: instance (GHC.Enum.Enum k, GHC.Read.Read k, GHC.Read.Read a) => GHC.Read.Read (Data.EnumMap.Strict.EnumMap k a)
+ Data.EnumMap.Strict: instance (GHC.Enum.Enum k, GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (Data.EnumMap.Strict.EnumMap k a)
+ Data.EnumMap.Strict: instance Control.DeepSeq.NFData v => Control.DeepSeq.NFData (Data.EnumMap.Strict.EnumMap k v)
+ Data.EnumMap.Strict: instance Data.Foldable.Foldable (Data.EnumMap.Strict.EnumMap k)
+ Data.EnumMap.Strict: instance Data.Traversable.Traversable (Data.EnumMap.Strict.EnumMap k)
+ Data.EnumMap.Strict: instance GHC.Base.Functor (Data.EnumMap.Strict.EnumMap k)
+ Data.EnumMap.Strict: instance GHC.Base.Monoid (Data.EnumMap.Strict.EnumMap k v)
+ Data.EnumMap.Strict: instance GHC.Classes.Eq v => GHC.Classes.Eq (Data.EnumMap.Strict.EnumMap k v)
+ Data.EnumMap.Strict: instance GHC.Classes.Ord v => GHC.Classes.Ord (Data.EnumMap.Strict.EnumMap k v)
+ Data.EnumSet: [unEnumSet] :: EnumSet k -> IntSet
+ Data.EnumSet: instance (GHC.Enum.Enum k, GHC.Read.Read k) => GHC.Read.Read (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance (GHC.Enum.Enum k, GHC.Show.Show k) => GHC.Show.Show (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance Control.DeepSeq.NFData (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance Data.Data.Data k => Data.Data.Data (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance GHC.Base.Monoid (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance GHC.Classes.Eq (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance GHC.Classes.Ord (Data.EnumSet.EnumSet k)
- Data.EnumMap.Lazy: (!) :: Enum k => EnumMap k a_aeBT -> k -> a_aeBT
+ Data.EnumMap.Lazy: (!) :: Enum k => EnumMap k a_afvc -> k -> a_afvc
- Data.EnumMap.Lazy: (\\) :: EnumMap k a_aeCL -> EnumMap k b_aeCM -> EnumMap k a_aeCL
+ Data.EnumMap.Lazy: (\\) :: EnumMap k a_afwc -> EnumMap k b_afwd -> EnumMap k a_afwc
- Data.EnumMap.Lazy: adjust :: Enum k => (a_as8B -> a_as8B) -> k -> EnumMap k a_as8B -> EnumMap k a_as8B
+ Data.EnumMap.Lazy: adjust :: Enum k => (a_aowx -> a_aowx) -> k -> EnumMap k a_aowx -> EnumMap k a_aowx
- Data.EnumMap.Lazy: adjustWithKey :: Enum k => (k -> a_as9P -> a_as9P) -> k -> EnumMap k a_as9P -> EnumMap k a_as9P
+ Data.EnumMap.Lazy: adjustWithKey :: Enum k => (k -> a_aoy0 -> a_aoy0) -> k -> EnumMap k a_aoy0 -> EnumMap k a_aoy0
- Data.EnumMap.Lazy: alter :: Enum k => (Maybe a_asfC -> Maybe a_asfC) -> k -> EnumMap k a_asfC -> EnumMap k a_asfC
+ Data.EnumMap.Lazy: alter :: Enum k => (Maybe a_aoF0 -> Maybe a_aoF0) -> k -> EnumMap k a_aoF0 -> EnumMap k a_aoF0
- Data.EnumMap.Lazy: assocs :: Enum k => EnumMap k a_afM4 -> [(k, a_afM4)]
+ Data.EnumMap.Lazy: assocs :: Enum k => EnumMap k a_agUG -> [(k, a_agUG)]
- Data.EnumMap.Lazy: delete :: Enum k => k -> EnumMap k a_aeUV -> EnumMap k a_aeUV
+ Data.EnumMap.Lazy: delete :: Enum k => k -> EnumMap k a_afRs -> EnumMap k a_afRs
- Data.EnumMap.Lazy: deleteFindMax :: Enum k => EnumMap k a_aglC -> ((k, a_aglC), EnumMap k a_aglC)
+ Data.EnumMap.Lazy: deleteFindMax :: Enum k => EnumMap k a_ahzH -> ((k, a_ahzH), EnumMap k a_ahzH)
- Data.EnumMap.Lazy: deleteFindMin :: Enum k => EnumMap k a_agku -> ((k, a_agku), EnumMap k a_agku)
+ Data.EnumMap.Lazy: deleteFindMin :: Enum k => EnumMap k a_ahys -> ((k, a_ahys), EnumMap k a_ahys)
- Data.EnumMap.Lazy: deleteMax :: EnumMap k a_agjR -> EnumMap k a_agjR
+ Data.EnumMap.Lazy: deleteMax :: EnumMap k a_ahxM -> EnumMap k a_ahxM
- Data.EnumMap.Lazy: deleteMin :: EnumMap k a_agje -> EnumMap k a_agje
+ Data.EnumMap.Lazy: deleteMin :: EnumMap k a_ahx6 -> EnumMap k a_ahx6
- Data.EnumMap.Lazy: difference :: EnumMap k a_af9H -> EnumMap k b_af9I -> EnumMap k a_af9H
+ Data.EnumMap.Lazy: difference :: EnumMap k a_ag9a -> EnumMap k b_ag9b -> EnumMap k a_ag9a
- Data.EnumMap.Lazy: differenceWith :: (a_asnk -> b_asnl -> Maybe a_asnk) -> EnumMap k a_asnk -> EnumMap k b_asnl -> EnumMap k a_asnk
+ 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: differenceWithKey :: Enum k => (k -> a_asoK -> b_asoL -> Maybe a_asoK) -> EnumMap k a_asoK -> EnumMap k b_asoL -> EnumMap k a_asoK
+ 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: elems :: EnumMap k a_afKH -> [a_afKH]
+ Data.EnumMap.Lazy: elems :: EnumMap k a_agT9 -> [a_agT9]
- Data.EnumMap.Lazy: empty :: EnumMap k a_aeNg
+ Data.EnumMap.Lazy: empty :: EnumMap k a_afIe
- Data.EnumMap.Lazy: filter :: (a_ag08 -> Bool) -> EnumMap k a_ag08 -> EnumMap k a_ag08
+ Data.EnumMap.Lazy: filter :: (a_ahb0 -> Bool) -> EnumMap k a_ahb0 -> EnumMap k a_ahb0
- Data.EnumMap.Lazy: filterWithKey :: Enum k => (k -> a_ag15 -> Bool) -> EnumMap k a_ag15 -> EnumMap k a_ag15
+ Data.EnumMap.Lazy: filterWithKey :: Enum k => (k -> a_ahc8 -> Bool) -> EnumMap k a_ahc8 -> EnumMap k a_ahc8
- Data.EnumMap.Lazy: findMax :: Enum k => EnumMap k a_agij -> (k, a_agij)
+ Data.EnumMap.Lazy: findMax :: Enum k => EnumMap k a_ahw5 -> (k, a_ahw5)
- Data.EnumMap.Lazy: findMin :: Enum k => EnumMap k a_agho -> (k, a_agho)
+ Data.EnumMap.Lazy: findMin :: Enum k => EnumMap k a_ahv4 -> (k, a_ahv4)
- Data.EnumMap.Lazy: findWithDefault :: Enum k => a_arUs -> k -> EnumMap k a_arUs -> a_arUs
+ Data.EnumMap.Lazy: findWithDefault :: Enum k => a_aofO -> k -> EnumMap k a_aofO -> a_aofO
- Data.EnumMap.Lazy: foldl :: (a_afAe -> b_afAf -> a_afAe) -> a_afAe -> EnumMap k b_afAf -> a_afAe
+ Data.EnumMap.Lazy: foldl :: (a_agEF -> b_agEG -> a_agEF) -> a_agEF -> EnumMap k b_agEG -> a_agEF
- Data.EnumMap.Lazy: foldl' :: (a_afG8 -> b_afG9 -> a_afG8) -> a_afG8 -> EnumMap k b_afG9 -> a_afG8
+ Data.EnumMap.Lazy: foldl' :: (a_agNx -> b_agNy -> a_agNx) -> a_agNx -> EnumMap k b_agNy -> a_agNx
- Data.EnumMap.Lazy: foldlWithKey :: Enum k => (a_afDb -> k -> b_afDc -> a_afDb) -> a_afDb -> EnumMap k b_afDc -> a_afDb
+ 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' :: Enum k => (a_afJ5 -> k -> b_afJ6 -> a_afJ5) -> a_afJ5 -> EnumMap k b_afJ6 -> a_afJ5
+ Data.EnumMap.Lazy: foldlWithKey' :: Enum k => (a_agRa -> k -> b_agRb -> a_agRa) -> a_agRa -> EnumMap k b_agRb -> a_agRa
- Data.EnumMap.Lazy: foldr :: (a_afyT -> b_afyU -> b_afyU) -> b_afyU -> EnumMap k a_afyT -> b_afyU
+ Data.EnumMap.Lazy: foldr :: (a_agD1 -> b_agD2 -> b_agD2) -> b_agD2 -> EnumMap k a_agD1 -> b_agD2
- Data.EnumMap.Lazy: foldr' :: (a_afEN -> b_afEO -> b_afEO) -> b_afEO -> EnumMap k a_afEN -> b_afEO
+ Data.EnumMap.Lazy: foldr' :: (a_agLT -> b_agLU -> b_agLU) -> b_agLU -> EnumMap k a_agLT -> b_agLU
- Data.EnumMap.Lazy: foldrWithKey :: Enum k => (k -> a_afBz -> b_afBA -> b_afBA) -> b_afBA -> EnumMap k a_afBz -> b_afBA
+ 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' :: Enum k => (k -> a_afHt -> b_afHu -> b_afHu) -> b_afHu -> EnumMap k a_afHt -> b_afHu
+ Data.EnumMap.Lazy: foldrWithKey' :: Enum k => (k -> a_agPb -> b_agPc -> b_agPc) -> b_agPc -> EnumMap k a_agPb -> b_agPc
- Data.EnumMap.Lazy: fromAscList :: Enum k => [(k, a_at7u)] -> EnumMap k a_at7u
+ Data.EnumMap.Lazy: fromAscList :: Enum k => [(k, a_apID)] -> EnumMap k a_apID
- Data.EnumMap.Lazy: fromAscListWith :: Enum k => (a_at8p -> a_at8p -> a_at8p) -> [(k, a_at8p)] -> EnumMap k a_at8p
+ Data.EnumMap.Lazy: fromAscListWith :: Enum k => (a_apJE -> a_apJE -> a_apJE) -> [(k, a_apJE)] -> EnumMap k a_apJE
- Data.EnumMap.Lazy: fromAscListWithKey :: Enum k => (k -> a_at9O -> a_at9O -> a_at9O) -> [(k, a_at9O)] -> EnumMap k a_at9O
+ Data.EnumMap.Lazy: fromAscListWithKey :: Enum k => (k -> a_apLl -> a_apLl -> a_apLl) -> [(k, a_apLl)] -> EnumMap k a_apLl
- Data.EnumMap.Lazy: fromDistinctAscList :: Enum k => [(k, a_atbo)] -> EnumMap k a_atbo
+ Data.EnumMap.Lazy: fromDistinctAscList :: Enum k => [(k, a_apNh)] -> EnumMap k a_apNh
- Data.EnumMap.Lazy: fromList :: Enum k => [(k, a_at1M)] -> EnumMap k a_at1M
+ Data.EnumMap.Lazy: fromList :: Enum k => [(k, a_apBX)] -> EnumMap k a_apBX
- Data.EnumMap.Lazy: fromListWith :: Enum k => (a_at2H -> a_at2H -> a_at2H) -> [(k, a_at2H)] -> EnumMap k a_at2H
+ Data.EnumMap.Lazy: fromListWith :: Enum k => (a_apCY -> a_apCY -> a_apCY) -> [(k, a_apCY)] -> EnumMap k a_apCY
- Data.EnumMap.Lazy: fromListWithKey :: Enum k => (k -> a_at46 -> a_at46 -> a_at46) -> [(k, a_at46)] -> EnumMap k a_at46
+ Data.EnumMap.Lazy: fromListWithKey :: Enum k => (k -> a_apEF -> a_apEF -> a_apEF) -> [(k, a_apEF)] -> EnumMap k a_apEF
- Data.EnumMap.Lazy: fromSet :: Enum k => (k -> a_asZP) -> EnumSet k -> EnumMap k a_asZP
+ Data.EnumMap.Lazy: fromSet :: Enum k => (k -> a_apzI) -> EnumSet k -> EnumMap k a_apzI
- Data.EnumMap.Lazy: insert :: Enum k => k -> a_as1l -> EnumMap k a_as1l -> EnumMap k a_as1l
+ Data.EnumMap.Lazy: insert :: Enum k => k -> a_aonH -> EnumMap k a_aonH -> EnumMap k a_aonH
- Data.EnumMap.Lazy: insertLookupWithKey :: Enum k => (k -> a_as5G -> a_as5G -> a_as5G) -> k -> a_as5G -> EnumMap k a_as5G -> (Maybe a_as5G, EnumMap k a_as5G)
+ 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: insertWith :: Enum k => (a_as2p -> a_as2p -> a_as2p) -> k -> a_as2p -> EnumMap k a_as2p -> EnumMap k a_as2p
+ 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: insertWithKey :: Enum k => (k -> a_as3X -> a_as3X -> a_as3X) -> k -> a_as3X -> EnumMap k a_as3X -> EnumMap k a_as3X
+ 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: intersection :: EnumMap k a_afdJ -> EnumMap k b_afdK -> EnumMap k a_afdJ
+ Data.EnumMap.Lazy: intersection :: EnumMap k a_agdW -> EnumMap k b_agdX -> EnumMap k a_agdW
- Data.EnumMap.Lazy: intersectionWith :: (a_asrk -> b_asrl -> c_asrm) -> EnumMap k a_asrk -> EnumMap k b_asrl -> EnumMap k c_asrm
+ 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: intersectionWithKey :: Enum k => (k -> a_assP -> b_assQ -> c_assR) -> EnumMap k a_assP -> EnumMap k b_assQ -> EnumMap k c_assR
+ 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: isProperSubmapOf :: Eq a_agf7 => EnumMap k a_agf7 -> EnumMap k a_agf7 -> Bool
+ Data.EnumMap.Lazy: isProperSubmapOf :: Eq a_ahsm => EnumMap k a_ahsm -> EnumMap k a_ahsm -> Bool
- Data.EnumMap.Lazy: isProperSubmapOfBy :: (a_agg1 -> b_agg2 -> Bool) -> EnumMap k a_agg1 -> EnumMap k b_agg2 -> Bool
+ Data.EnumMap.Lazy: isProperSubmapOfBy :: (a_ahto -> b_ahtp -> Bool) -> EnumMap k a_ahto -> EnumMap k b_ahtp -> Bool
- Data.EnumMap.Lazy: isSubmapOf :: Eq a_agcQ => EnumMap k a_agcQ -> EnumMap k a_agcQ -> Bool
+ Data.EnumMap.Lazy: isSubmapOf :: Eq a_ahpE => EnumMap k a_ahpE -> EnumMap k a_ahpE -> Bool
- Data.EnumMap.Lazy: isSubmapOfBy :: (a_agdK -> b_agdL -> Bool) -> EnumMap k a_agdK -> EnumMap k b_agdL -> Bool
+ Data.EnumMap.Lazy: isSubmapOfBy :: (a_ahqG -> b_ahqH -> Bool) -> EnumMap k a_ahqG -> EnumMap k b_ahqH -> Bool
- Data.EnumMap.Lazy: keys :: Enum k => EnumMap k a_afLk -> [k]
+ Data.EnumMap.Lazy: keys :: Enum k => EnumMap k a_agTR -> [k]
- Data.EnumMap.Lazy: keysSet :: EnumMap k a_afMZ -> EnumSet k
+ Data.EnumMap.Lazy: keysSet :: EnumMap k a_agVI -> EnumSet k
- Data.EnumMap.Lazy: lookup :: Enum k => k -> EnumMap k a_aeGC -> Maybe a_aeGC
+ Data.EnumMap.Lazy: lookup :: Enum k => k -> EnumMap k a_afAx -> Maybe a_afAx
- Data.EnumMap.Lazy: lookupGE :: Enum k => k -> EnumMap k a_aeM6 -> Maybe (k, a_aeM6)
+ Data.EnumMap.Lazy: lookupGE :: Enum k => k -> EnumMap k a_afGT -> Maybe (k, a_afGT)
- Data.EnumMap.Lazy: lookupGT :: Enum k => k -> EnumMap k a_aeJM -> Maybe (k, a_aeJM)
+ Data.EnumMap.Lazy: lookupGT :: Enum k => k -> EnumMap k a_afEd -> Maybe (k, a_afEd)
- Data.EnumMap.Lazy: lookupLE :: Enum k => k -> EnumMap k a_aeKW -> Maybe (k, a_aeKW)
+ Data.EnumMap.Lazy: lookupLE :: Enum k => k -> EnumMap k a_afFy -> Maybe (k, a_afFy)
- Data.EnumMap.Lazy: lookupLT :: Enum k => k -> EnumMap k a_aeIC -> Maybe (k, a_aeIC)
+ Data.EnumMap.Lazy: lookupLT :: Enum k => k -> EnumMap k a_afCS -> Maybe (k, a_afCS)
- Data.EnumMap.Lazy: map :: (a_asxa -> b_asxb) -> EnumMap k a_asxa -> EnumMap k b_asxb
+ Data.EnumMap.Lazy: map :: (a_aoZW -> b_aoZX) -> EnumMap k a_aoZW -> EnumMap k b_aoZX
- Data.EnumMap.Lazy: mapAccum :: (a_asB5 -> b_asB6 -> (a_asB5, c_asB7)) -> a_asB5 -> EnumMap k b_asB6 -> (a_asB5, EnumMap k c_asB7)
+ 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: mapAccumRWithKey :: Enum k => (a_asF9 -> k -> b_asFa -> (a_asF9, c_asFb)) -> a_asF9 -> EnumMap k b_asFa -> (a_asF9, EnumMap k c_asFb)
+ 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: mapAccumWithKey :: Enum k => (a_asCZ -> k -> b_asD0 -> (a_asCZ, c_asD1)) -> a_asCZ -> EnumMap k b_asD0 -> (a_asCZ, EnumMap k c_asD1)
+ 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: mapEither :: (a_atjv -> Either b_atjw c_atjx) -> EnumMap k a_atjv -> (EnumMap k b_atjw, EnumMap k c_atjx)
+ 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: mapEitherWithKey :: Enum k => (k -> a_atkV -> Either b_atkW c_atkX) -> EnumMap k a_atkV -> (EnumMap k b_atkW, EnumMap k c_atkX)
+ 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: mapKeys :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_afuJ -> EnumMap k' a_afuJ
+ Data.EnumMap.Lazy: mapKeys :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_agy8 -> EnumMap k' a_agy8
- Data.EnumMap.Lazy: mapKeysMonotonic :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_afxF -> EnumMap k' a_afxF
+ Data.EnumMap.Lazy: mapKeysMonotonic :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_agBC -> EnumMap k' a_agBC
- Data.EnumMap.Lazy: mapKeysWith :: (Enum k, Enum k') => (a_asIw -> a_asIw -> a_asIw) -> (k -> k') -> EnumMap k a_asIw -> EnumMap k' a_asIw
+ 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: mapMaybe :: (a_ath6 -> Maybe b_ath7) -> EnumMap k a_ath6 -> EnumMap k b_ath7
+ Data.EnumMap.Lazy: mapMaybe :: (a_apTX -> Maybe b_apTY) -> EnumMap k a_apTX -> EnumMap k b_apTY
- Data.EnumMap.Lazy: mapMaybeWithKey :: Enum k => (k -> a_atia -> Maybe b_atib) -> EnumMap k a_atia -> EnumMap k b_atib
+ Data.EnumMap.Lazy: mapMaybeWithKey :: Enum k => (k -> a_apVb -> Maybe b_apVc) -> EnumMap k a_apVb -> EnumMap k b_apVc
- Data.EnumMap.Lazy: mapWithKey :: Enum k => (k -> a_asyd -> b_asye) -> EnumMap k a_asyd -> EnumMap k b_asye
+ Data.EnumMap.Lazy: mapWithKey :: Enum k => (k -> a_ap19 -> b_ap1a) -> EnumMap k a_ap19 -> EnumMap k b_ap1a
- Data.EnumMap.Lazy: maxView :: EnumMap k a_ags5 -> Maybe (a_ags5, EnumMap k a_ags5)
+ Data.EnumMap.Lazy: maxView :: EnumMap k a_ahHd -> Maybe (a_ahHd, EnumMap k a_ahHd)
- Data.EnumMap.Lazy: maxViewWithKey :: Enum k => EnumMap k a_agua -> Maybe ((k, a_agua), EnumMap k a_agua)
+ Data.EnumMap.Lazy: maxViewWithKey :: Enum k => EnumMap k a_ahJw -> Maybe ((k, a_ahJw), EnumMap k a_ahJw)
- Data.EnumMap.Lazy: member :: Enum k => k -> EnumMap k a_aeES -> Bool
+ Data.EnumMap.Lazy: member :: Enum k => k -> EnumMap k a_afyx -> Bool
- Data.EnumMap.Lazy: mergeWithKey :: Enum k => (k -> a_asuB -> b_asuC -> Maybe c_asuD) -> (EnumMap k a_asuB -> EnumMap k c_asuD) -> (EnumMap k b_asuC -> EnumMap k c_asuD) -> EnumMap k a_asuB -> EnumMap k b_asuC -> EnumMap k c_asuD
+ 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: minView :: EnumMap k a_agra -> Maybe (a_agra, EnumMap k a_agra)
+ Data.EnumMap.Lazy: minView :: EnumMap k a_ahGc -> Maybe (a_ahGc, EnumMap k a_ahGc)
- Data.EnumMap.Lazy: minViewWithKey :: Enum k => EnumMap k a_agt0 -> Maybe ((k, a_agt0), EnumMap k a_agt0)
+ Data.EnumMap.Lazy: minViewWithKey :: Enum k => EnumMap k a_ahIe -> Maybe ((k, a_ahIe), EnumMap k a_ahIe)
- Data.EnumMap.Lazy: notMember :: Enum k => k -> EnumMap k a_aeFK -> Bool
+ Data.EnumMap.Lazy: notMember :: Enum k => k -> EnumMap k a_afzx -> Bool
- Data.EnumMap.Lazy: null :: EnumMap k a_aeDG -> Bool
+ Data.EnumMap.Lazy: null :: EnumMap k a_afxd -> Bool
- Data.EnumMap.Lazy: partition :: (a_ag2j -> Bool) -> EnumMap k a_ag2j -> (EnumMap k a_ag2j, EnumMap k a_ag2j)
+ Data.EnumMap.Lazy: partition :: (a_ahdB -> Bool) -> EnumMap k a_ahdB -> (EnumMap k a_ahdB, EnumMap k a_ahdB)
- Data.EnumMap.Lazy: partitionWithKey :: Enum k => (k -> a_ag3w -> Bool) -> EnumMap k a_ag3w -> (EnumMap k a_ag3w, EnumMap k a_ag3w)
+ 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: showTree :: Show a_agvk => EnumMap k a_agvk -> String
+ Data.EnumMap.Lazy: showTree :: Show a_ahKO => EnumMap k a_ahKO -> String
- Data.EnumMap.Lazy: showTreeWith :: Show a_agw2 => Bool -> Bool -> EnumMap k a_agw2 -> String
+ Data.EnumMap.Lazy: showTreeWith :: Show a_ahLA => Bool -> Bool -> EnumMap k a_ahLA -> String
- Data.EnumMap.Lazy: singleton :: Enum k => k -> a_as0t -> EnumMap k a_as0t
+ Data.EnumMap.Lazy: singleton :: Enum k => k -> a_aomI -> EnumMap k a_aomI
- Data.EnumMap.Lazy: size :: EnumMap k a_aeEh -> Int
+ Data.EnumMap.Lazy: size :: EnumMap k a_afxS -> Int
- Data.EnumMap.Lazy: split :: Enum k => k -> EnumMap k a_agau -> (EnumMap k a_agau, EnumMap k a_agau)
+ Data.EnumMap.Lazy: split :: Enum k => k -> EnumMap k a_ahn0 -> (EnumMap k a_ahn0, EnumMap k a_ahn0)
- Data.EnumMap.Lazy: splitLookup :: Enum k => k -> EnumMap k a_agbD -> (EnumMap k a_agbD, Maybe a_agbD, EnumMap k a_agbD)
+ 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: toAscList :: Enum k => EnumMap k a_afTt -> [(k, a_afTt)]
+ Data.EnumMap.Lazy: toAscList :: Enum k => EnumMap k a_ah3h -> [(k, a_ah3h)]
- Data.EnumMap.Lazy: toDescList :: Enum k => EnumMap k a_afUo -> [(k, a_afUo)]
+ Data.EnumMap.Lazy: toDescList :: Enum k => EnumMap k a_ah4j -> [(k, a_ah4j)]
- Data.EnumMap.Lazy: toList :: Enum k => EnumMap k a_afOE -> [(k, a_afOE)]
+ Data.EnumMap.Lazy: toList :: Enum k => EnumMap k a_agXB -> [(k, a_agXB)]
- Data.EnumMap.Lazy: traverseWithKey :: (Enum k, Applicative t_afmS) => (k -> a_afmR -> t_afmS b_afmT) -> EnumMap k a_afmR -> t_afmS (EnumMap k b_afmT)
+ 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: union :: EnumMap k a_af4b -> EnumMap k a_af4b -> EnumMap k a_af4b
+ Data.EnumMap.Lazy: union :: EnumMap k a_ag2x -> EnumMap k a_ag2x -> EnumMap k a_ag2x
- Data.EnumMap.Lazy: unionWith :: (a_ashL -> a_ashL -> a_ashL) -> EnumMap k a_ashL -> EnumMap k a_ashL -> EnumMap k a_ashL
+ 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: unionWithKey :: Enum k => (k -> a_asj4 -> a_asj4 -> a_asj4) -> EnumMap k a_asj4 -> EnumMap k a_asj4 -> EnumMap k a_asj4
+ 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: unions :: [EnumMap k a_af7T] -> EnumMap k a_af7T
+ Data.EnumMap.Lazy: unions :: [EnumMap k a_ag72] -> EnumMap k a_ag72
- Data.EnumMap.Lazy: unionsWith :: (a_asli -> a_asli -> a_asli) -> [EnumMap k a_asli] -> EnumMap k a_asli
+ Data.EnumMap.Lazy: unionsWith :: (a_aoLN -> a_aoLN -> a_aoLN) -> [EnumMap k a_aoLN] -> EnumMap k a_aoLN
- Data.EnumMap.Lazy: update :: Enum k => (a_asbe -> Maybe a_asbe) -> k -> EnumMap k a_asbe -> EnumMap k a_asbe
+ Data.EnumMap.Lazy: update :: Enum k => (a_aozI -> Maybe a_aozI) -> k -> EnumMap k a_aozI -> EnumMap k a_aozI
- Data.EnumMap.Lazy: updateLookupWithKey :: Enum k => (k -> a_asdT -> Maybe a_asdT) -> k -> EnumMap k a_asdT -> (Maybe a_asdT, EnumMap k a_asdT)
+ 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: updateMax :: (a_atzB -> Maybe a_atzB) -> EnumMap k a_atzB -> EnumMap k a_atzB
+ Data.EnumMap.Lazy: updateMax :: (a_aqf5 -> Maybe a_aqf5) -> EnumMap k a_aqf5 -> EnumMap k a_aqf5
- Data.EnumMap.Lazy: updateMaxWithKey :: Enum k => (k -> a_atBO -> Maybe a_atBO) -> EnumMap k a_atBO -> EnumMap k a_atBO
+ Data.EnumMap.Lazy: updateMaxWithKey :: Enum k => (k -> a_aqhI -> Maybe a_aqhI) -> EnumMap k a_aqhI -> EnumMap k a_aqhI
- Data.EnumMap.Lazy: updateMin :: (a_atyD -> Maybe a_atyD) -> EnumMap k a_atyD -> EnumMap k a_atyD
+ Data.EnumMap.Lazy: updateMin :: (a_aqdW -> Maybe a_aqdW) -> EnumMap k a_aqdW -> EnumMap k a_aqdW
- Data.EnumMap.Lazy: updateMinWithKey :: Enum k => (k -> a_atAz -> Maybe a_atAz) -> EnumMap k a_atAz -> EnumMap k a_atAz
+ Data.EnumMap.Lazy: updateMinWithKey :: Enum k => (k -> a_aqge -> Maybe a_aqge) -> EnumMap k a_aqge -> EnumMap k a_aqge
- Data.EnumMap.Lazy: updateWithKey :: Enum k => (k -> a_asct -> Maybe a_asct) -> k -> EnumMap k a_asct -> EnumMap k a_asct
+ Data.EnumMap.Lazy: updateWithKey :: Enum k => (k -> a_aoBc -> Maybe a_aoBc) -> k -> EnumMap k a_aoBc -> EnumMap k a_aoBc
- Data.EnumMap.Strict: (!) :: Enum k => EnumMap k a_aeBT -> k -> a_aeBT
+ Data.EnumMap.Strict: (!) :: Enum k => EnumMap k a_afvc -> k -> a_afvc
- Data.EnumMap.Strict: (\\) :: EnumMap k a_aeCL -> EnumMap k b_aeCM -> EnumMap k a_aeCL
+ Data.EnumMap.Strict: (\\) :: EnumMap k a_afwc -> EnumMap k b_afwd -> EnumMap k a_afwc
- Data.EnumMap.Strict: adjust :: Enum k => (a_aeVP -> a_aeVP) -> k -> EnumMap k a_aeVP -> EnumMap k a_aeVP
+ Data.EnumMap.Strict: adjust :: Enum k => (a_afSt -> a_afSt) -> k -> EnumMap k a_afSt -> EnumMap k a_afSt
- Data.EnumMap.Strict: adjustWithKey :: Enum k => (k -> a_aeX3 -> a_aeX3) -> k -> EnumMap k a_aeX3 -> EnumMap k a_aeX3
+ Data.EnumMap.Strict: adjustWithKey :: Enum k => (k -> a_afTW -> a_afTW) -> k -> EnumMap k a_afTW -> EnumMap k a_afTW
- Data.EnumMap.Strict: alter :: Enum k => (Maybe a_af2Q -> Maybe a_af2Q) -> k -> EnumMap k a_af2Q -> EnumMap k a_af2Q
+ Data.EnumMap.Strict: alter :: Enum k => (Maybe a_ag0W -> Maybe a_ag0W) -> k -> EnumMap k a_ag0W -> EnumMap k a_ag0W
- Data.EnumMap.Strict: assocs :: Enum k => EnumMap k a_afM4 -> [(k, a_afM4)]
+ Data.EnumMap.Strict: assocs :: Enum k => EnumMap k a_agUG -> [(k, a_agUG)]
- Data.EnumMap.Strict: delete :: Enum k => k -> EnumMap k a_aeUV -> EnumMap k a_aeUV
+ Data.EnumMap.Strict: delete :: Enum k => k -> EnumMap k a_afRs -> EnumMap k a_afRs
- Data.EnumMap.Strict: deleteFindMax :: Enum k => EnumMap k a_aglC -> ((k, a_aglC), EnumMap k a_aglC)
+ Data.EnumMap.Strict: deleteFindMax :: Enum k => EnumMap k a_ahzH -> ((k, a_ahzH), EnumMap k a_ahzH)
- Data.EnumMap.Strict: deleteFindMin :: Enum k => EnumMap k a_agku -> ((k, a_agku), EnumMap k a_agku)
+ Data.EnumMap.Strict: deleteFindMin :: Enum k => EnumMap k a_ahys -> ((k, a_ahys), EnumMap k a_ahys)
- Data.EnumMap.Strict: deleteMax :: EnumMap k a_agjR -> EnumMap k a_agjR
+ Data.EnumMap.Strict: deleteMax :: EnumMap k a_ahxM -> EnumMap k a_ahxM
- Data.EnumMap.Strict: deleteMin :: EnumMap k a_agje -> EnumMap k a_agje
+ Data.EnumMap.Strict: deleteMin :: EnumMap k a_ahx6 -> EnumMap k a_ahx6
- Data.EnumMap.Strict: difference :: EnumMap k a_af9H -> EnumMap k b_af9I -> EnumMap k a_af9H
+ Data.EnumMap.Strict: difference :: EnumMap k a_ag9a -> EnumMap k b_ag9b -> EnumMap k a_ag9a
- Data.EnumMap.Strict: differenceWith :: (a_afaC -> b_afaD -> Maybe a_afaC) -> EnumMap k a_afaC -> EnumMap k b_afaD -> EnumMap k a_afaC
+ 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: differenceWithKey :: Enum k => (k -> a_afc2 -> b_afc3 -> Maybe a_afc2) -> EnumMap k a_afc2 -> EnumMap k b_afc3 -> EnumMap k a_afc2
+ 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: elems :: EnumMap k a_afKH -> [a_afKH]
+ Data.EnumMap.Strict: elems :: EnumMap k a_agT9 -> [a_agT9]
- Data.EnumMap.Strict: empty :: EnumMap k a_aeNg
+ Data.EnumMap.Strict: empty :: EnumMap k a_afIe
- Data.EnumMap.Strict: filter :: (a_ag08 -> Bool) -> EnumMap k a_ag08 -> EnumMap k a_ag08
+ Data.EnumMap.Strict: filter :: (a_ahb0 -> Bool) -> EnumMap k a_ahb0 -> EnumMap k a_ahb0
- Data.EnumMap.Strict: filterWithKey :: Enum k => (k -> a_ag15 -> Bool) -> EnumMap k a_ag15 -> EnumMap k a_ag15
+ Data.EnumMap.Strict: filterWithKey :: Enum k => (k -> a_ahc8 -> Bool) -> EnumMap k a_ahc8 -> EnumMap k a_ahc8
- Data.EnumMap.Strict: findMax :: Enum k => EnumMap k a_agij -> (k, a_agij)
+ Data.EnumMap.Strict: findMax :: Enum k => EnumMap k a_ahw5 -> (k, a_ahw5)
- Data.EnumMap.Strict: findMin :: Enum k => EnumMap k a_agho -> (k, a_agho)
+ Data.EnumMap.Strict: findMin :: Enum k => EnumMap k a_ahv4 -> (k, a_ahv4)
- Data.EnumMap.Strict: findWithDefault :: Enum k => a_aeHA -> k -> EnumMap k a_aeHA -> a_aeHA
+ Data.EnumMap.Strict: findWithDefault :: Enum k => a_afBE -> k -> EnumMap k a_afBE -> a_afBE
- Data.EnumMap.Strict: foldl :: (a_afAe -> b_afAf -> a_afAe) -> a_afAe -> EnumMap k b_afAf -> a_afAe
+ Data.EnumMap.Strict: foldl :: (a_agEF -> b_agEG -> a_agEF) -> a_agEF -> EnumMap k b_agEG -> a_agEF
- Data.EnumMap.Strict: foldl' :: (a_afG8 -> b_afG9 -> a_afG8) -> a_afG8 -> EnumMap k b_afG9 -> a_afG8
+ Data.EnumMap.Strict: foldl' :: (a_agNx -> b_agNy -> a_agNx) -> a_agNx -> EnumMap k b_agNy -> a_agNx
- Data.EnumMap.Strict: foldlWithKey :: Enum k => (a_afDb -> k -> b_afDc -> a_afDb) -> a_afDb -> EnumMap k b_afDc -> a_afDb
+ 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' :: Enum k => (a_afJ5 -> k -> b_afJ6 -> a_afJ5) -> a_afJ5 -> EnumMap k b_afJ6 -> a_afJ5
+ Data.EnumMap.Strict: foldlWithKey' :: Enum k => (a_agRa -> k -> b_agRb -> a_agRa) -> a_agRa -> EnumMap k b_agRb -> a_agRa
- Data.EnumMap.Strict: foldr :: (a_afyT -> b_afyU -> b_afyU) -> b_afyU -> EnumMap k a_afyT -> b_afyU
+ Data.EnumMap.Strict: foldr :: (a_agD1 -> b_agD2 -> b_agD2) -> b_agD2 -> EnumMap k a_agD1 -> b_agD2
- Data.EnumMap.Strict: foldr' :: (a_afEN -> b_afEO -> b_afEO) -> b_afEO -> EnumMap k a_afEN -> b_afEO
+ Data.EnumMap.Strict: foldr' :: (a_agLT -> b_agLU -> b_agLU) -> b_agLU -> EnumMap k a_agLT -> b_agLU
- Data.EnumMap.Strict: foldrWithKey :: Enum k => (k -> a_afBz -> b_afBA -> b_afBA) -> b_afBA -> EnumMap k a_afBz -> b_afBA
+ 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' :: Enum k => (k -> a_afHt -> b_afHu -> b_afHu) -> b_afHu -> EnumMap k a_afHt -> b_afHu
+ Data.EnumMap.Strict: foldrWithKey' :: Enum k => (k -> a_agPb -> b_agPc -> b_agPc) -> b_agPc -> EnumMap k a_agPb -> b_agPc
- Data.EnumMap.Strict: fromAscList :: Enum k => [(k, a_afVj)] -> EnumMap k a_afVj
+ Data.EnumMap.Strict: fromAscList :: Enum k => [(k, a_ah5l)] -> EnumMap k a_ah5l
- Data.EnumMap.Strict: fromAscListWith :: Enum k => (a_afWe -> a_afWe -> a_afWe) -> [(k, a_afWe)] -> EnumMap k a_afWe
+ Data.EnumMap.Strict: fromAscListWith :: Enum k => (a_ah6m -> a_ah6m -> a_ah6m) -> [(k, a_ah6m)] -> EnumMap k a_ah6m
- Data.EnumMap.Strict: fromAscListWithKey :: Enum k => (k -> a_afXD -> a_afXD -> a_afXD) -> [(k, a_afXD)] -> EnumMap k a_afXD
+ Data.EnumMap.Strict: fromAscListWithKey :: Enum k => (k -> a_ah83 -> a_ah83 -> a_ah83) -> [(k, a_ah83)] -> EnumMap k a_ah83
- Data.EnumMap.Strict: fromDistinctAscList :: Enum k => [(k, a_afZd)] -> EnumMap k a_afZd
+ Data.EnumMap.Strict: fromDistinctAscList :: Enum k => [(k, a_ah9Z)] -> EnumMap k a_ah9Z
- Data.EnumMap.Strict: fromList :: Enum k => [(k, a_afPz)] -> EnumMap k a_afPz
+ Data.EnumMap.Strict: fromList :: Enum k => [(k, a_agYD)] -> EnumMap k a_agYD
- Data.EnumMap.Strict: fromListWith :: Enum k => (a_afQu -> a_afQu -> a_afQu) -> [(k, a_afQu)] -> EnumMap k a_afQu
+ Data.EnumMap.Strict: fromListWith :: Enum k => (a_agZE -> a_agZE -> a_agZE) -> [(k, a_agZE)] -> EnumMap k a_agZE
- Data.EnumMap.Strict: fromListWithKey :: Enum k => (k -> a_afRT -> a_afRT -> a_afRT) -> [(k, a_afRT)] -> EnumMap k a_afRT
+ Data.EnumMap.Strict: fromListWithKey :: Enum k => (k -> a_ah1l -> a_ah1l -> a_ah1l) -> [(k, a_ah1l)] -> EnumMap k a_ah1l
- Data.EnumMap.Strict: fromSet :: Enum k => (k -> a_afNB) -> EnumSet k -> EnumMap k a_afNB
+ Data.EnumMap.Strict: fromSet :: Enum k => (k -> a_agWn) -> EnumSet k -> EnumMap k a_agWn
- Data.EnumMap.Strict: insert :: Enum k => k -> a_aeOy -> EnumMap k a_aeOy -> EnumMap k a_aeOy
+ Data.EnumMap.Strict: insert :: Enum k => k -> a_afJC -> EnumMap k a_afJC -> EnumMap k a_afJC
- Data.EnumMap.Strict: insertLookupWithKey :: Enum k => (k -> a_aeST -> a_aeST -> a_aeST) -> k -> a_aeST -> EnumMap k a_aeST -> (Maybe a_aeST, EnumMap k a_aeST)
+ 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: insertWith :: Enum k => (a_aePC -> a_aePC -> a_aePC) -> k -> a_aePC -> EnumMap k a_aePC -> EnumMap k a_aePC
+ 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: insertWithKey :: Enum k => (k -> a_aeRa -> a_aeRa -> a_aeRa) -> k -> a_aeRa -> EnumMap k a_aeRa -> EnumMap k a_aeRa
+ 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: intersection :: EnumMap k a_afdJ -> EnumMap k b_afdK -> EnumMap k a_afdJ
+ Data.EnumMap.Strict: intersection :: EnumMap k a_agdW -> EnumMap k b_agdX -> EnumMap k a_agdW
- Data.EnumMap.Strict: intersectionWith :: (a_afeE -> b_afeF -> c_afeG) -> EnumMap k a_afeE -> EnumMap k b_afeF -> EnumMap k c_afeG
+ 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: intersectionWithKey :: Enum k => (k -> a_afg9 -> b_afga -> c_afgb) -> EnumMap k a_afg9 -> EnumMap k b_afga -> EnumMap k c_afgb
+ 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: isProperSubmapOf :: Eq a_agf7 => EnumMap k a_agf7 -> EnumMap k a_agf7 -> Bool
+ Data.EnumMap.Strict: isProperSubmapOf :: Eq a_ahsm => EnumMap k a_ahsm -> EnumMap k a_ahsm -> Bool
- Data.EnumMap.Strict: isProperSubmapOfBy :: (a_agg1 -> b_agg2 -> Bool) -> EnumMap k a_agg1 -> EnumMap k b_agg2 -> Bool
+ Data.EnumMap.Strict: isProperSubmapOfBy :: (a_ahto -> b_ahtp -> Bool) -> EnumMap k a_ahto -> EnumMap k b_ahtp -> Bool
- Data.EnumMap.Strict: isSubmapOf :: Eq a_agcQ => EnumMap k a_agcQ -> EnumMap k a_agcQ -> Bool
+ Data.EnumMap.Strict: isSubmapOf :: Eq a_ahpE => EnumMap k a_ahpE -> EnumMap k a_ahpE -> Bool
- Data.EnumMap.Strict: isSubmapOfBy :: (a_agdK -> b_agdL -> Bool) -> EnumMap k a_agdK -> EnumMap k b_agdL -> Bool
+ Data.EnumMap.Strict: isSubmapOfBy :: (a_ahqG -> b_ahqH -> Bool) -> EnumMap k a_ahqG -> EnumMap k b_ahqH -> Bool
- Data.EnumMap.Strict: keys :: Enum k => EnumMap k a_afLk -> [k]
+ Data.EnumMap.Strict: keys :: Enum k => EnumMap k a_agTR -> [k]
- Data.EnumMap.Strict: keysSet :: EnumMap k a_afMZ -> EnumSet k
+ Data.EnumMap.Strict: keysSet :: EnumMap k a_agVI -> EnumSet k
- Data.EnumMap.Strict: lookup :: Enum k => k -> EnumMap k a_aeGC -> Maybe a_aeGC
+ Data.EnumMap.Strict: lookup :: Enum k => k -> EnumMap k a_afAx -> Maybe a_afAx
- Data.EnumMap.Strict: lookupGE :: Enum k => k -> EnumMap k a_aeM6 -> Maybe (k, a_aeM6)
+ Data.EnumMap.Strict: lookupGE :: Enum k => k -> EnumMap k a_afGT -> Maybe (k, a_afGT)
- Data.EnumMap.Strict: lookupGT :: Enum k => k -> EnumMap k a_aeJM -> Maybe (k, a_aeJM)
+ Data.EnumMap.Strict: lookupGT :: Enum k => k -> EnumMap k a_afEd -> Maybe (k, a_afEd)
- Data.EnumMap.Strict: lookupLE :: Enum k => k -> EnumMap k a_aeKW -> Maybe (k, a_aeKW)
+ Data.EnumMap.Strict: lookupLE :: Enum k => k -> EnumMap k a_afFy -> Maybe (k, a_afFy)
- Data.EnumMap.Strict: lookupLT :: Enum k => k -> EnumMap k a_aeIC -> Maybe (k, a_aeIC)
+ Data.EnumMap.Strict: lookupLT :: Enum k => k -> EnumMap k a_afCS -> Maybe (k, a_afCS)
- Data.EnumMap.Strict: map :: (a_afku -> b_afkv) -> EnumMap k a_afku -> EnumMap k b_afkv
+ Data.EnumMap.Strict: map :: (a_aglY -> b_aglZ) -> EnumMap k a_aglY -> EnumMap k b_aglZ
- Data.EnumMap.Strict: mapAccum :: (a_afov -> b_afow -> (a_afov, c_afox)) -> a_afov -> EnumMap k b_afow -> (a_afov, EnumMap k c_afox)
+ 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: mapAccumRWithKey :: Enum k => (a_afsz -> k -> b_afsA -> (a_afsz, c_afsB)) -> a_afsz -> EnumMap k b_afsA -> (a_afsz, EnumMap k c_afsB)
+ 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: mapAccumWithKey :: Enum k => (a_afqp -> k -> b_afqq -> (a_afqp, c_afqr)) -> a_afqp -> EnumMap k b_afqq -> (a_afqp, EnumMap k c_afqr)
+ 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: mapEither :: (a_ag7o -> Either b_ag7p c_ag7q) -> EnumMap k a_ag7o -> (EnumMap k b_ag7p, EnumMap k c_ag7q)
+ 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: mapEitherWithKey :: Enum k => (k -> a_ag8O -> Either b_ag8P c_ag8Q) -> EnumMap k a_ag8O -> (EnumMap k b_ag8P, EnumMap k c_ag8Q)
+ 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: mapKeys :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_afuJ -> EnumMap k' a_afuJ
+ Data.EnumMap.Strict: mapKeys :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_agy8 -> EnumMap k' a_agy8
- Data.EnumMap.Strict: mapKeysMonotonic :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_afxF -> EnumMap k' a_afxF
+ Data.EnumMap.Strict: mapKeysMonotonic :: (Enum k, Enum k') => (k -> k') -> EnumMap k a_agBC -> EnumMap k' a_agBC
- Data.EnumMap.Strict: mapKeysWith :: (Enum k, Enum k') => (a_afvX -> a_afvX -> a_afvX) -> (k -> k') -> EnumMap k a_afvX -> EnumMap k' a_afvX
+ 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: mapMaybe :: (a_ag4Z -> Maybe b_ag50) -> EnumMap k a_ag4Z -> EnumMap k b_ag50
+ Data.EnumMap.Strict: mapMaybe :: (a_ahgJ -> Maybe b_ahgK) -> EnumMap k a_ahgJ -> EnumMap k b_ahgK
- Data.EnumMap.Strict: mapMaybeWithKey :: Enum k => (k -> a_ag63 -> Maybe b_ag64) -> EnumMap k a_ag63 -> EnumMap k b_ag64
+ Data.EnumMap.Strict: mapMaybeWithKey :: Enum k => (k -> a_ahhX -> Maybe b_ahhY) -> EnumMap k a_ahhX -> EnumMap k b_ahhY
- Data.EnumMap.Strict: mapWithKey :: Enum k => (k -> a_aflx -> b_afly) -> EnumMap k a_aflx -> EnumMap k b_afly
+ Data.EnumMap.Strict: mapWithKey :: Enum k => (k -> a_agnb -> b_agnc) -> EnumMap k a_agnb -> EnumMap k b_agnc
- Data.EnumMap.Strict: maxView :: EnumMap k a_ags5 -> Maybe (a_ags5, EnumMap k a_ags5)
+ Data.EnumMap.Strict: maxView :: EnumMap k a_ahHd -> Maybe (a_ahHd, EnumMap k a_ahHd)
- Data.EnumMap.Strict: maxViewWithKey :: Enum k => EnumMap k a_agua -> Maybe ((k, a_agua), EnumMap k a_agua)
+ Data.EnumMap.Strict: maxViewWithKey :: Enum k => EnumMap k a_ahJw -> Maybe ((k, a_ahJw), EnumMap k a_ahJw)
- Data.EnumMap.Strict: member :: Enum k => k -> EnumMap k a_aeES -> Bool
+ Data.EnumMap.Strict: member :: Enum k => k -> EnumMap k a_afyx -> Bool
- Data.EnumMap.Strict: mergeWithKey :: Enum k => (k -> a_afhV -> b_afhW -> Maybe c_afhX) -> (EnumMap k a_afhV -> EnumMap k c_afhX) -> (EnumMap k b_afhW -> EnumMap k c_afhX) -> EnumMap k a_afhV -> EnumMap k b_afhW -> EnumMap k c_afhX
+ 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: minView :: EnumMap k a_agra -> Maybe (a_agra, EnumMap k a_agra)
+ Data.EnumMap.Strict: minView :: EnumMap k a_ahGc -> Maybe (a_ahGc, EnumMap k a_ahGc)
- Data.EnumMap.Strict: minViewWithKey :: Enum k => EnumMap k a_agt0 -> Maybe ((k, a_agt0), EnumMap k a_agt0)
+ Data.EnumMap.Strict: minViewWithKey :: Enum k => EnumMap k a_ahIe -> Maybe ((k, a_ahIe), EnumMap k a_ahIe)
- Data.EnumMap.Strict: notMember :: Enum k => k -> EnumMap k a_aeFK -> Bool
+ Data.EnumMap.Strict: notMember :: Enum k => k -> EnumMap k a_afzx -> Bool
- Data.EnumMap.Strict: null :: EnumMap k a_aeDG -> Bool
+ Data.EnumMap.Strict: null :: EnumMap k a_afxd -> Bool
- Data.EnumMap.Strict: partition :: (a_ag2j -> Bool) -> EnumMap k a_ag2j -> (EnumMap k a_ag2j, EnumMap k a_ag2j)
+ Data.EnumMap.Strict: partition :: (a_ahdB -> Bool) -> EnumMap k a_ahdB -> (EnumMap k a_ahdB, EnumMap k a_ahdB)
- Data.EnumMap.Strict: partitionWithKey :: Enum k => (k -> a_ag3w -> Bool) -> EnumMap k a_ag3w -> (EnumMap k a_ag3w, EnumMap k a_ag3w)
+ 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: showTree :: Show a_agvk => EnumMap k a_agvk -> String
+ Data.EnumMap.Strict: showTree :: Show a_ahKO => EnumMap k a_ahKO -> String
- Data.EnumMap.Strict: showTreeWith :: Show a_agw2 => Bool -> Bool -> EnumMap k a_agw2 -> String
+ Data.EnumMap.Strict: showTreeWith :: Show a_ahLA => Bool -> Bool -> EnumMap k a_ahLA -> String
- Data.EnumMap.Strict: singleton :: Enum k => k -> a_aeNG -> EnumMap k a_aeNG
+ Data.EnumMap.Strict: singleton :: Enum k => k -> a_afID -> EnumMap k a_afID
- Data.EnumMap.Strict: size :: EnumMap k a_aeEh -> Int
+ Data.EnumMap.Strict: size :: EnumMap k a_afxS -> Int
- Data.EnumMap.Strict: split :: Enum k => k -> EnumMap k a_agau -> (EnumMap k a_agau, EnumMap k a_agau)
+ Data.EnumMap.Strict: split :: Enum k => k -> EnumMap k a_ahn0 -> (EnumMap k a_ahn0, EnumMap k a_ahn0)
- Data.EnumMap.Strict: splitLookup :: Enum k => k -> EnumMap k a_agbD -> (EnumMap k a_agbD, Maybe a_agbD, EnumMap k a_agbD)
+ 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: toAscList :: Enum k => EnumMap k a_afTt -> [(k, a_afTt)]
+ Data.EnumMap.Strict: toAscList :: Enum k => EnumMap k a_ah3h -> [(k, a_ah3h)]
- Data.EnumMap.Strict: toDescList :: Enum k => EnumMap k a_afUo -> [(k, a_afUo)]
+ Data.EnumMap.Strict: toDescList :: Enum k => EnumMap k a_ah4j -> [(k, a_ah4j)]
- Data.EnumMap.Strict: toList :: Enum k => EnumMap k a_afOE -> [(k, a_afOE)]
+ Data.EnumMap.Strict: toList :: Enum k => EnumMap k a_agXB -> [(k, a_agXB)]
- Data.EnumMap.Strict: traverseWithKey :: (Enum k, Applicative t_afmS) => (k -> a_afmR -> t_afmS b_afmT) -> EnumMap k a_afmR -> t_afmS (EnumMap k b_afmT)
+ 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: union :: EnumMap k a_af4b -> EnumMap k a_af4b -> EnumMap k a_af4b
+ Data.EnumMap.Strict: union :: EnumMap k a_ag2x -> EnumMap k a_ag2x -> EnumMap k a_ag2x
- Data.EnumMap.Strict: unionWith :: (a_af50 -> a_af50 -> a_af50) -> EnumMap k a_af50 -> EnumMap k a_af50 -> EnumMap k a_af50
+ 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: unionWithKey :: Enum k => (k -> a_af6j -> a_af6j -> a_af6j) -> EnumMap k a_af6j -> EnumMap k a_af6j -> EnumMap k a_af6j
+ 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: unions :: [EnumMap k a_af7T] -> EnumMap k a_af7T
+ Data.EnumMap.Strict: unions :: [EnumMap k a_ag72] -> EnumMap k a_ag72
- Data.EnumMap.Strict: unionsWith :: (a_af8y -> a_af8y -> a_af8y) -> [EnumMap k a_af8y] -> EnumMap k a_af8y
+ Data.EnumMap.Strict: unionsWith :: (a_ag7L -> a_ag7L -> a_ag7L) -> [EnumMap k a_ag7L] -> EnumMap k a_ag7L
- Data.EnumMap.Strict: update :: Enum k => (a_aeYs -> Maybe a_aeYs) -> k -> EnumMap k a_aeYs -> EnumMap k a_aeYs
+ Data.EnumMap.Strict: update :: Enum k => (a_afVE -> Maybe a_afVE) -> k -> EnumMap k a_afVE -> EnumMap k a_afVE
- Data.EnumMap.Strict: updateLookupWithKey :: Enum k => (k -> a_af17 -> Maybe a_af17) -> k -> EnumMap k a_af17 -> (Maybe a_af17, EnumMap k a_af17)
+ 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: updateMax :: (a_agnI -> Maybe a_agnI) -> EnumMap k a_agnI -> EnumMap k a_agnI
+ Data.EnumMap.Strict: updateMax :: (a_ahC5 -> Maybe a_ahC5) -> EnumMap k a_ahC5 -> EnumMap k a_ahC5
- Data.EnumMap.Strict: updateMaxWithKey :: Enum k => (k -> a_agpV -> Maybe a_agpV) -> EnumMap k a_agpV -> EnumMap k a_agpV
+ Data.EnumMap.Strict: updateMaxWithKey :: Enum k => (k -> a_ahEI -> Maybe a_ahEI) -> EnumMap k a_ahEI -> EnumMap k a_ahEI
- Data.EnumMap.Strict: updateMin :: (a_agmK -> Maybe a_agmK) -> EnumMap k a_agmK -> EnumMap k a_agmK
+ Data.EnumMap.Strict: updateMin :: (a_ahAW -> Maybe a_ahAW) -> EnumMap k a_ahAW -> EnumMap k a_ahAW
- Data.EnumMap.Strict: updateMinWithKey :: Enum k => (k -> a_agoG -> Maybe a_agoG) -> EnumMap k a_agoG -> EnumMap k a_agoG
+ Data.EnumMap.Strict: updateMinWithKey :: Enum k => (k -> a_ahDe -> Maybe a_ahDe) -> EnumMap k a_ahDe -> EnumMap k a_ahDe
- Data.EnumMap.Strict: updateWithKey :: Enum k => (k -> a_aeZH -> Maybe a_aeZH) -> k -> EnumMap k a_aeZH -> EnumMap k a_aeZH
+ Data.EnumMap.Strict: updateWithKey :: Enum k => (k -> a_afX8 -> Maybe a_afX8) -> k -> EnumMap k a_afX8 -> EnumMap k a_afX8
- Data.EnumSet: foldl :: Enum k => (a_a9Kn -> k -> a_a9Kn) -> a_a9Kn -> EnumSet k -> a_a9Kn
+ Data.EnumSet: foldl :: Enum k => (a_acqd -> k -> a_acqd) -> a_acqd -> EnumSet k -> a_acqd
- Data.EnumSet: foldl' :: Enum k => (a_a9N3 -> k -> a_a9N3) -> a_a9N3 -> EnumSet k -> a_a9N3
+ Data.EnumSet: foldl' :: Enum k => (a_actx -> k -> a_actx) -> a_actx -> EnumSet k -> a_actx
- Data.EnumSet: foldr :: Enum k => (k -> b_a9J2 -> b_a9J2) -> b_a9J2 -> EnumSet k -> b_a9J2
+ Data.EnumSet: foldr :: Enum k => (k -> b_acoy -> b_acoy) -> b_acoy -> EnumSet k -> b_acoy
- Data.EnumSet: foldr' :: Enum k => (k -> b_a9LI -> b_a9LI) -> b_a9LI -> EnumSet k -> b_a9LI
+ Data.EnumSet: foldr' :: Enum k => (k -> b_acrS -> b_acrS) -> b_acrS -> EnumSet k -> b_acrS
Files
- enummapset-th.cabal +3/−2
- include/map.inc +1/−0
enummapset-th.cabal view
@@ -1,5 +1,5 @@ name: enummapset-th-version: 0.6.0.2+version: 0.6.1.0 synopsis: TH-generated EnumSet/EnumMap wrappers around IntSet/IntMap. description: This package wraps @IntSet@ and @IntMap@ from @containers@, and provides@@ -23,6 +23,7 @@ category: Data build-type: Simple cabal-version: >= 1.8+tested-with: GHC == 7.8.3, GHC == 7.8.4, GHC == 7.10.2 extra-source-files: include/map.inc @@ -40,7 +41,7 @@ build-depends: base >= 4.5 && < 5, deepseq >= 1.3,- containers >= 0.5 && < 0.6,+ containers >= 0.5.3 && < 0.6, template-haskell >= 2.7 include-dirs: include ghc-options: -Wall
include/map.inc view
@@ -100,6 +100,7 @@ w 'foldl w 'foldrWithKey w 'foldlWithKey+w 'foldMapWithKey -- * Traversal: Strict folds w 'foldr'