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


-- | TH-generated EnumSet/EnumMap wrappers around IntSet/IntMap.
--   
--   This package wraps <tt>IntSet</tt> and <tt>IntMap</tt> from
--   <tt>containers</tt>, and provides fast sets and maps keyed on any data
--   type with a well-behaved <tt>Enum</tt> instance. Useful for derived
--   <tt>Enum</tt>s, newtype'd <tt>Int</tt>s, or any data type that can be
--   packed into an <tt>Int</tt>: just implement <tt>fromEnum</tt> and
--   <tt>toEnum</tt>.
--   
--   The boilerplate is generated using Template Haskell, so unlike
--   <tt>enummapset</tt> it's easier to maintain and keep up-to-date with
--   <tt>containers</tt>. On the downside, it's less portable.
--   
--   Note that <a>Data.EnumMap.Lazy</a> and <a>Data.EnumMap.Strict</a>
--   provide distinct newtype wrappers, and their respective <a>Functor</a>
--   instances behave as expected, unlike that of <tt>IntMap</tt> which is
--   alway lazy.
@package enummapset-th
@version 0.6.1.1


-- | Refer to the <a>documentation</a> for <a>Data.IntSet</a>.
module Data.EnumSet
newtype EnumSet k
EnumSet :: IntSet -> EnumSet k
[unEnumSet] :: EnumSet k -> IntSet
(\\) :: forall k. EnumSet k -> EnumSet k -> EnumSet k
null :: forall k. EnumSet k -> Bool
size :: forall k. EnumSet k -> Int
member :: forall k. Enum k => k -> EnumSet k -> Bool
notMember :: forall k. Enum k => k -> EnumSet k -> Bool
lookupLT :: forall k. Enum k => k -> EnumSet k -> Maybe k
lookupGT :: forall k. Enum k => k -> EnumSet k -> Maybe k
lookupLE :: forall k. Enum k => k -> EnumSet k -> Maybe k
lookupGE :: forall k. Enum k => k -> EnumSet k -> Maybe k
isSubsetOf :: forall k. EnumSet k -> EnumSet k -> Bool
isProperSubsetOf :: forall k. EnumSet k -> EnumSet k -> Bool
empty :: forall k. EnumSet k
singleton :: forall k. Enum k => k -> EnumSet k
insert :: forall k. Enum k => k -> EnumSet k -> EnumSet k
delete :: forall k. Enum k => k -> EnumSet k -> EnumSet k
union :: forall k. EnumSet k -> EnumSet k -> EnumSet k
unions :: forall k. [EnumSet k] -> EnumSet k
difference :: forall k. EnumSet k -> EnumSet k -> EnumSet k
intersection :: forall k. EnumSet k -> EnumSet k -> EnumSet k
filter :: forall k. Enum k => (k -> Bool) -> EnumSet k -> EnumSet k
partition :: forall k. Enum k => (k -> Bool) -> EnumSet k -> (EnumSet k, EnumSet k)
split :: forall k. Enum k => k -> EnumSet k -> (EnumSet k, EnumSet k)
splitMember :: forall k. Enum k => k -> EnumSet k -> (EnumSet k, Bool, EnumSet k)
map :: forall k k'. (Enum k, Enum k') => (k -> k') -> EnumSet k -> EnumSet k'
foldr :: forall k (b_agil :: Type). Enum k => (k -> b_agil -> b_agil) -> b_agil -> EnumSet k -> b_agil
foldl :: forall k (a_agjR :: Type). Enum k => (a_agjR -> k -> a_agjR) -> a_agjR -> EnumSet k -> a_agjR
foldr' :: forall k (b_agln :: Type). Enum k => (k -> b_agln -> b_agln) -> b_agln -> EnumSet k -> b_agln
foldl' :: forall k (a_agmT :: Type). Enum k => (a_agmT -> k -> a_agmT) -> a_agmT -> EnumSet k -> a_agmT
findMin :: forall k. Enum k => EnumSet k -> k
findMax :: forall k. Enum k => EnumSet k -> k
deleteMin :: forall k. EnumSet k -> EnumSet k
deleteMax :: forall k. EnumSet k -> EnumSet k
deleteFindMin :: forall k. Enum k => EnumSet k -> (k, EnumSet k)
deleteFindMax :: forall k. Enum k => EnumSet k -> (k, EnumSet k)
maxView :: forall k. Enum k => EnumSet k -> Maybe (k, EnumSet k)
minView :: forall k. Enum k => EnumSet k -> Maybe (k, EnumSet k)
elems :: forall k. Enum k => EnumSet k -> [k]
toList :: forall k. Enum k => EnumSet k -> [k]
fromList :: forall k. Enum k => [k] -> EnumSet k
toAscList :: forall k. Enum k => EnumSet k -> [k]
toDescList :: forall k. Enum k => EnumSet k -> [k]
fromAscList :: forall k. Enum k => [k] -> EnumSet k
fromDistinctAscList :: forall k. Enum k => [k] -> EnumSet k
showTree :: forall k. EnumSet k -> String
showTreeWith :: forall k. Bool -> Bool -> EnumSet k -> String
instance (GHC.Enum.Enum k, GHC.Show.Show k) => GHC.Show.Show (Data.EnumSet.EnumSet k)
instance (GHC.Enum.Enum k, GHC.Read.Read k) => GHC.Read.Read (Data.EnumSet.EnumSet k)
instance Control.DeepSeq.NFData (Data.EnumSet.EnumSet k)
instance Data.Data.Data k => Data.Data.Data (Data.EnumSet.EnumSet k)
instance GHC.Base.Monoid (Data.EnumSet.EnumSet k)
instance GHC.Classes.Ord (Data.EnumSet.EnumSet k)
instance GHC.Classes.Eq (Data.EnumSet.EnumSet k)


-- | Refer to the <a>documentation</a> for <a>Data.IntMap.Strict</a>.
module Data.EnumMap.Strict
newtype EnumMap k v
EnumMap :: IntMap v -> EnumMap k v
[unEnumMap] :: EnumMap k v -> IntMap v
(!) :: forall k (a_apeM :: Type). Enum k => EnumMap k a_apeM -> k -> a_apeM
(\\) :: forall k (a_apfJ :: Type) (b_apfK :: Type). EnumMap k a_apfJ -> EnumMap k b_apfK -> EnumMap k a_apfJ
null :: forall k (a_apgG :: Type). EnumMap k a_apgG -> Bool
size :: forall k (a_aphk :: Type). EnumMap k a_aphk -> Int
member :: forall k (a_aphY :: Type). Enum k => k -> EnumMap k a_aphY -> Bool
notMember :: forall k (a_apiV :: Type). Enum k => k -> EnumMap k a_apiV -> Bool
lookup :: forall k (a_apjS :: Type). Enum k => k -> EnumMap k a_apjS -> Maybe a_apjS
findWithDefault :: forall k (a_apkT :: Type). Enum k => a_apkT -> k -> EnumMap k a_apkT -> a_apkT
lookupLT :: forall k (a_apm2 :: Type). Enum k => k -> EnumMap k a_apm2 -> Maybe (k, a_apm2)
lookupGT :: forall k (a_apne :: Type). Enum k => k -> EnumMap k a_apne -> Maybe (k, a_apne)
lookupLE :: forall k (a_apoq :: Type). Enum k => k -> EnumMap k a_apoq -> Maybe (k, a_apoq)
lookupGE :: forall k (a_appC :: Type). Enum k => k -> EnumMap k a_appC -> Maybe (k, a_appC)
empty :: forall k (a_apqO :: Type). EnumMap k a_apqO
singleton :: forall k (a_apre :: Type). Enum k => k -> a_apre -> EnumMap k a_apre
insert :: forall k (a_apsb :: Type). Enum k => k -> a_apsb -> EnumMap k a_apsb -> EnumMap k a_apsb
insertWith :: forall k (a_aptl :: Type). Enum k => (a_aptl -> a_aptl -> a_aptl) -> k -> a_aptl -> EnumMap k a_aptl -> EnumMap k a_aptl
insertWithKey :: forall k (a_apv5 :: Type). Enum k => (k -> a_apv5 -> a_apv5 -> a_apv5) -> k -> a_apv5 -> EnumMap k a_apv5 -> EnumMap k a_apv5
insertLookupWithKey :: forall k (a_apx2 :: Type). Enum k => (k -> a_apx2 -> a_apx2 -> a_apx2) -> k -> a_apx2 -> EnumMap k a_apx2 -> (Maybe a_apx2, EnumMap k a_apx2)
delete :: forall k (a_apzd :: Type). Enum k => k -> EnumMap k a_apzd -> EnumMap k a_apzd
adjust :: forall k (a_apAb :: Type). Enum k => (a_apAb -> a_apAb) -> k -> EnumMap k a_apAb -> EnumMap k a_apAb
adjustWithKey :: forall k (a_apBx :: Type). Enum k => (k -> a_apBx -> a_apBx) -> k -> EnumMap k a_apBx -> EnumMap k a_apBx
update :: forall k (a_apD6 :: Type). Enum k => (a_apD6 -> Maybe a_apD6) -> k -> EnumMap k a_apD6 -> EnumMap k a_apD6
updateWithKey :: forall k (a_apEs :: Type). Enum k => (k -> a_apEs -> Maybe a_apEs) -> k -> EnumMap k a_apEs -> EnumMap k a_apEs
updateLookupWithKey :: forall k (a_apG1 :: Type). Enum k => (k -> a_apG1 -> Maybe a_apG1) -> k -> EnumMap k a_apG1 -> (Maybe a_apG1, EnumMap k a_apG1)
alter :: forall k (a_apHO :: Type). Enum k => (Maybe a_apHO -> Maybe a_apHO) -> k -> EnumMap k a_apHO -> EnumMap k a_apHO
union :: forall k (a_apJe :: Type). EnumMap k a_apJe -> EnumMap k a_apJe -> EnumMap k a_apJe
unionWith :: forall k (a_apK6 :: Type). (a_apK6 -> a_apK6 -> a_apK6) -> EnumMap k a_apK6 -> EnumMap k a_apK6 -> EnumMap k a_apK6
unionWithKey :: forall k (a_apLy :: Type). Enum k => (k -> a_apLy -> a_apLy -> a_apLy) -> EnumMap k a_apLy -> EnumMap k a_apLy -> EnumMap k a_apLy
unions :: forall k (a_apNi :: Type). [EnumMap k a_apNi] -> EnumMap k a_apNi
unionsWith :: forall k (a_apNZ :: Type). (a_apNZ -> a_apNZ -> a_apNZ) -> [EnumMap k a_apNZ] -> EnumMap k a_apNZ
difference :: forall k (a_apPg :: Type) (b_apPh :: Type). EnumMap k a_apPg -> EnumMap k b_apPh -> EnumMap k a_apPg
differenceWith :: forall k (a_apQd :: Type) (b_apQe :: Type). (a_apQd -> b_apQe -> Maybe a_apQd) -> EnumMap k a_apQd -> EnumMap k b_apQe -> EnumMap k a_apQd
differenceWithKey :: forall k (a_apRK :: Type) (b_apRL :: Type). Enum k => (k -> a_apRK -> b_apRL -> Maybe a_apRK) -> EnumMap k a_apRK -> EnumMap k b_apRL -> EnumMap k a_apRK
intersection :: forall k (a_apTz :: Type) (b_apTA :: Type). EnumMap k a_apTz -> EnumMap k b_apTA -> EnumMap k a_apTz
intersectionWith :: forall k (a_apUw :: Type) (b_apUx :: Type) (c_apUy :: Type). (a_apUw -> b_apUx -> c_apUy) -> EnumMap k a_apUw -> EnumMap k b_apUx -> EnumMap k c_apUy
intersectionWithKey :: forall k (a_apW8 :: Type) (b_apW9 :: Type) (c_apWa :: Type). Enum k => (k -> a_apW8 -> b_apW9 -> c_apWa) -> EnumMap k a_apW8 -> EnumMap k b_apW9 -> EnumMap k c_apWa
mergeWithKey :: forall k (a_apY2 :: Type) (b_apY3 :: Type) (c_apY4 :: Type). Enum k => (k -> a_apY2 -> b_apY3 -> Maybe c_apY4) -> (EnumMap k a_apY2 -> EnumMap k c_apY4) -> (EnumMap k b_apY3 -> EnumMap k c_apY4) -> EnumMap k a_apY2 -> EnumMap k b_apY3 -> EnumMap k c_apY4
map :: forall k (a_aq0N :: Type) (b_aq0O :: Type). (a_aq0N -> b_aq0O) -> EnumMap k a_aq0N -> EnumMap k b_aq0O
mapWithKey :: forall k (a_aq1U :: Type) (b_aq1V :: Type). Enum k => (k -> a_aq1U -> b_aq1V) -> EnumMap k a_aq1U -> EnumMap k b_aq1V
traverseWithKey :: forall k (t_aq3k :: Type -> Type) (a_aq3l :: Type) (b_aq3m :: Type). (Enum k, Applicative t_aq3k) => (k -> a_aq3l -> t_aq3k b_aq3m) -> EnumMap k a_aq3l -> t_aq3k (EnumMap k b_aq3m)
mapAccum :: forall k (a_aq53 :: Type) (b_aq54 :: Type) (c_aq55 :: Type). (a_aq53 -> b_aq54 -> (a_aq53, c_aq55)) -> a_aq53 -> EnumMap k b_aq54 -> (a_aq53, EnumMap k c_aq55)
mapAccumWithKey :: forall k (a_aq6Z :: Type) (b_aq70 :: Type) (c_aq71 :: Type). Enum k => (a_aq6Z -> k -> b_aq70 -> (a_aq6Z, c_aq71)) -> a_aq6Z -> EnumMap k b_aq70 -> (a_aq6Z, EnumMap k c_aq71)
mapAccumRWithKey :: forall k (a_aq9d :: Type) (b_aq9e :: Type) (c_aq9f :: Type). Enum k => (a_aq9d -> k -> b_aq9e -> (a_aq9d, c_aq9f)) -> a_aq9d -> EnumMap k b_aq9e -> (a_aq9d, EnumMap k c_aq9f)
mapKeys :: forall k k' (a_aqbr :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_aqbr -> EnumMap k' a_aqbr
mapKeysWith :: forall k k' (a_aqcK :: Type). (Enum k, Enum k') => (a_aqcK -> a_aqcK -> a_aqcK) -> (k -> k') -> EnumMap k a_aqcK -> EnumMap k' a_aqcK
mapKeysMonotonic :: forall k k' (a_aqeD :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_aqeD -> EnumMap k' a_aqeD
foldr :: forall k (a_aqfW :: Type) (b_aqfX :: Type). (a_aqfW -> b_aqfX -> b_aqfX) -> b_aqfX -> EnumMap k a_aqfW -> b_aqfX
foldl :: forall k (a_aqhr :: Type) (b_aqhs :: Type). (a_aqhr -> b_aqhs -> a_aqhr) -> a_aqhr -> EnumMap k b_aqhs -> a_aqhr
foldrWithKey :: forall k (a_aqiW :: Type) (b_aqiX :: Type). Enum k => (k -> a_aqiW -> b_aqiX -> b_aqiX) -> b_aqiX -> EnumMap k a_aqiW -> b_aqiX
foldlWithKey :: forall k (a_aqkK :: Type) (b_aqkL :: Type). Enum k => (a_aqkK -> k -> b_aqkL -> a_aqkK) -> a_aqkK -> EnumMap k b_aqkL -> a_aqkK
foldMapWithKey :: forall k (m_aqmy :: Type) (a_aqmz :: Type). (Enum k, Monoid m_aqmy) => (k -> a_aqmz -> m_aqmy) -> EnumMap k a_aqmz -> m_aqmy
foldr' :: forall k (a_aqo2 :: Type) (b_aqo3 :: Type). (a_aqo2 -> b_aqo3 -> b_aqo3) -> b_aqo3 -> EnumMap k a_aqo2 -> b_aqo3
foldl' :: forall k (a_aqpx :: Type) (b_aqpy :: Type). (a_aqpx -> b_aqpy -> a_aqpx) -> a_aqpx -> EnumMap k b_aqpy -> a_aqpx
foldrWithKey' :: forall k (a_aqr2 :: Type) (b_aqr3 :: Type). Enum k => (k -> a_aqr2 -> b_aqr3 -> b_aqr3) -> b_aqr3 -> EnumMap k a_aqr2 -> b_aqr3
foldlWithKey' :: forall k (a_aqsQ :: Type) (b_aqsR :: Type). Enum k => (a_aqsQ -> k -> b_aqsR -> a_aqsQ) -> a_aqsQ -> EnumMap k b_aqsR -> a_aqsQ
elems :: forall k (a_aquE :: Type). EnumMap k a_aquE -> [a_aquE]
keys :: forall k (a_aqvk :: Type). Enum k => EnumMap k a_aqvk -> [k]
assocs :: forall k (a_aqw7 :: Type). Enum k => EnumMap k a_aqw7 -> [(k, a_aqw7)]
keysSet :: forall k (a_aqx4 :: Type). EnumMap k a_aqx4 -> EnumSet k
fromSet :: forall k (a_aqxH :: Type). Enum k => (k -> a_aqxH) -> EnumSet k -> EnumMap k a_aqxH
toList :: forall k (a_aqyP :: Type). Enum k => EnumMap k a_aqyP -> [(k, a_aqyP)]
fromList :: forall k (a_aqzM :: Type). Enum k => [(k, a_aqzM)] -> EnumMap k a_aqzM
fromListWith :: forall k (a_aqAJ :: Type). Enum k => (a_aqAJ -> a_aqAJ -> a_aqAJ) -> [(k, a_aqAJ)] -> EnumMap k a_aqAJ
fromListWithKey :: forall k (a_aqCg :: Type). Enum k => (k -> a_aqCg -> a_aqCg -> a_aqCg) -> [(k, a_aqCg)] -> EnumMap k a_aqCg
toAscList :: forall k (a_aqE0 :: Type). Enum k => EnumMap k a_aqE0 -> [(k, a_aqE0)]
toDescList :: forall k (a_aqEX :: Type). Enum k => EnumMap k a_aqEX -> [(k, a_aqEX)]
fromAscList :: forall k (a_aqFU :: Type). Enum k => [(k, a_aqFU)] -> EnumMap k a_aqFU
fromAscListWith :: forall k (a_aqGR :: Type). Enum k => (a_aqGR -> a_aqGR -> a_aqGR) -> [(k, a_aqGR)] -> EnumMap k a_aqGR
fromAscListWithKey :: forall k (a_aqIo :: Type). Enum k => (k -> a_aqIo -> a_aqIo -> a_aqIo) -> [(k, a_aqIo)] -> EnumMap k a_aqIo
fromDistinctAscList :: forall k (a_aqK8 :: Type). Enum k => [(k, a_aqK8)] -> EnumMap k a_aqK8
filter :: forall k (a_aqL5 :: Type). (a_aqL5 -> Bool) -> EnumMap k a_aqL5 -> EnumMap k a_aqL5
filterWithKey :: forall k (a_aqM8 :: Type). Enum k => (k -> a_aqM8 -> Bool) -> EnumMap k a_aqM8 -> EnumMap k a_aqM8
partition :: forall k (a_aqNt :: Type). (a_aqNt -> Bool) -> EnumMap k a_aqNt -> (EnumMap k a_aqNt, EnumMap k a_aqNt)
partitionWithKey :: forall k (a_aqOI :: Type). Enum k => (k -> a_aqOI -> Bool) -> EnumMap k a_aqOI -> (EnumMap k a_aqOI, EnumMap k a_aqOI)
mapMaybe :: forall k (a_aqQf :: Type) (b_aqQg :: Type). (a_aqQf -> Maybe b_aqQg) -> EnumMap k a_aqQf -> EnumMap k b_aqQg
mapMaybeWithKey :: forall k (a_aqRn :: Type) (b_aqRo :: Type). Enum k => (k -> a_aqRn -> Maybe b_aqRo) -> EnumMap k a_aqRn -> EnumMap k b_aqRo
mapEither :: forall k (a_aqSN :: Type) (b_aqSO :: Type) (c_aqSP :: Type). (a_aqSN -> Either b_aqSO c_aqSP) -> EnumMap k a_aqSN -> (EnumMap k b_aqSO, EnumMap k c_aqSP)
mapEitherWithKey :: forall k (a_aqUc :: Type) (b_aqUd :: Type) (c_aqUe :: Type). Enum k => (k -> a_aqUc -> Either b_aqUd c_aqUe) -> EnumMap k a_aqUc -> (EnumMap k b_aqUd, EnumMap k c_aqUe)
split :: forall k (a_aqVT :: Type). Enum k => k -> EnumMap k a_aqVT -> (EnumMap k a_aqVT, EnumMap k a_aqVT)
splitLookup :: forall k (a_aqX2 :: Type). Enum k => k -> EnumMap k a_aqX2 -> (EnumMap k a_aqX2, Maybe a_aqX2, EnumMap k a_aqX2)
isSubmapOf :: forall k (a_aqYd :: Type). Eq a_aqYd => EnumMap k a_aqYd -> EnumMap k a_aqYd -> Bool
isSubmapOfBy :: forall k (a_aqZb :: Type) (b_aqZc :: Type). (a_aqZb -> b_aqZc -> Bool) -> EnumMap k a_aqZb -> EnumMap k b_aqZc -> Bool
isProperSubmapOf :: forall k (a_ar0G :: Type). Eq a_ar0G => EnumMap k a_ar0G -> EnumMap k a_ar0G -> Bool
isProperSubmapOfBy :: forall k (a_ar1E :: Type) (b_ar1F :: Type). (a_ar1E -> b_ar1F -> Bool) -> EnumMap k a_ar1E -> EnumMap k b_ar1F -> Bool
findMin :: forall k (a_ar3a :: Type). Enum k => EnumMap k a_ar3a -> (k, a_ar3a)
findMax :: forall k (a_ar45 :: Type). Enum k => EnumMap k a_ar45 -> (k, a_ar45)
deleteMin :: forall k (a_ar50 :: Type). EnumMap k a_ar50 -> EnumMap k a_ar50
deleteMax :: forall k (a_ar5F :: Type). EnumMap k a_ar5F -> EnumMap k a_ar5F
deleteFindMin :: forall k (a_ar6k :: Type). Enum k => EnumMap k a_ar6k -> ((k, a_ar6k), EnumMap k a_ar6k)
deleteFindMax :: forall k (a_ar7p :: Type). Enum k => EnumMap k a_ar7p -> ((k, a_ar7p), EnumMap k a_ar7p)
updateMin :: forall k (a_ar8u :: Type). (a_ar8u -> Maybe a_ar8u) -> EnumMap k a_ar8u -> EnumMap k a_ar8u
updateMax :: forall k (a_ar9x :: Type). (a_ar9x -> Maybe a_ar9x) -> EnumMap k a_ar9x -> EnumMap k a_ar9x
updateMinWithKey :: forall k (a_araA :: Type). Enum k => (k -> a_araA -> Maybe a_araA) -> EnumMap k a_araA -> EnumMap k a_araA
updateMaxWithKey :: forall k (a_arbW :: Type). Enum k => (k -> a_arbW -> Maybe a_arbW) -> EnumMap k a_arbW -> EnumMap k a_arbW
minView :: forall k (a_ardi :: Type). EnumMap k a_ardi -> Maybe (a_ardi, EnumMap k a_ardi)
maxView :: forall k (a_arec :: Type). EnumMap k a_arec -> Maybe (a_arec, EnumMap k a_arec)
minViewWithKey :: forall k (a_arf6 :: Type). Enum k => EnumMap k a_arf6 -> Maybe ((k, a_arf6), EnumMap k a_arf6)
maxViewWithKey :: forall k (a_arge :: Type). Enum k => EnumMap k a_arge -> Maybe ((k, a_arge), EnumMap k a_arge)
showTree :: forall k (a_arhm :: Type). Show a_arhm => EnumMap k a_arhm -> String
showTreeWith :: forall k (a_ari7 :: Type). Show a_ari7 => Bool -> Bool -> EnumMap k a_ari7 -> String
instance Data.Foldable.Foldable (Data.EnumMap.Strict.EnumMap k)
instance Data.Traversable.Traversable (Data.EnumMap.Strict.EnumMap k)
instance GHC.Base.Functor (Data.EnumMap.Strict.EnumMap k)
instance (GHC.Enum.Enum k, GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (Data.EnumMap.Strict.EnumMap k a)
instance (GHC.Enum.Enum k, GHC.Read.Read k, GHC.Read.Read a) => GHC.Read.Read (Data.EnumMap.Strict.EnumMap k a)
instance Control.DeepSeq.NFData v => Control.DeepSeq.NFData (Data.EnumMap.Strict.EnumMap k v)
instance (Data.Data.Data v, Data.Data.Data k) => Data.Data.Data (Data.EnumMap.Strict.EnumMap k v)
instance GHC.Base.Monoid (Data.EnumMap.Strict.EnumMap k v)
instance GHC.Classes.Ord v => GHC.Classes.Ord (Data.EnumMap.Strict.EnumMap k v)
instance GHC.Classes.Eq v => GHC.Classes.Eq (Data.EnumMap.Strict.EnumMap k v)


-- | Refer to the <a>documentation</a> for <a>Data.IntMap.Lazy</a>.
module Data.EnumMap.Lazy
newtype EnumMap k v
EnumMap :: IntMap v -> EnumMap k v
[unEnumMap] :: EnumMap k v -> IntMap v
(!) :: forall k (a_apeM :: Type). Enum k => EnumMap k a_apeM -> k -> a_apeM
(\\) :: forall k (a_apfJ :: Type) (b_apfK :: Type). EnumMap k a_apfJ -> EnumMap k b_apfK -> EnumMap k a_apfJ
null :: forall k (a_apgG :: Type). EnumMap k a_apgG -> Bool
size :: forall k (a_aphk :: Type). EnumMap k a_aphk -> Int
member :: forall k (a_aphY :: Type). Enum k => k -> EnumMap k a_aphY -> Bool
notMember :: forall k (a_apiV :: Type). Enum k => k -> EnumMap k a_apiV -> Bool
lookup :: forall k (a_apjS :: Type). Enum k => k -> EnumMap k a_apjS -> Maybe a_apjS
findWithDefault :: forall k (a_aCAQ :: Type). Enum k => a_aCAQ -> k -> EnumMap k a_aCAQ -> a_aCAQ
lookupLT :: forall k (a_apm2 :: Type). Enum k => k -> EnumMap k a_apm2 -> Maybe (k, a_apm2)
lookupGT :: forall k (a_apne :: Type). Enum k => k -> EnumMap k a_apne -> Maybe (k, a_apne)
lookupLE :: forall k (a_apoq :: Type). Enum k => k -> EnumMap k a_apoq -> Maybe (k, a_apoq)
lookupGE :: forall k (a_appC :: Type). Enum k => k -> EnumMap k a_appC -> Maybe (k, a_appC)
empty :: forall k (a_apqO :: Type). EnumMap k a_apqO
singleton :: forall k (a_aCH1 :: Type). Enum k => k -> a_aCH1 -> EnumMap k a_aCH1
insert :: forall k (a_aCHY :: Type). Enum k => k -> a_aCHY -> EnumMap k a_aCHY -> EnumMap k a_aCHY
insertWith :: forall k (a_aCJ8 :: Type). Enum k => (a_aCJ8 -> a_aCJ8 -> a_aCJ8) -> k -> a_aCJ8 -> EnumMap k a_aCJ8 -> EnumMap k a_aCJ8
insertWithKey :: forall k (a_aCKS :: Type). Enum k => (k -> a_aCKS -> a_aCKS -> a_aCKS) -> k -> a_aCKS -> EnumMap k a_aCKS -> EnumMap k a_aCKS
insertLookupWithKey :: forall k (a_aCMP :: Type). Enum k => (k -> a_aCMP -> a_aCMP -> a_aCMP) -> k -> a_aCMP -> EnumMap k a_aCMP -> (Maybe a_aCMP, EnumMap k a_aCMP)
delete :: forall k (a_apzd :: Type). Enum k => k -> EnumMap k a_apzd -> EnumMap k a_apzd
adjust :: forall k (a_aCPW :: Type). Enum k => (a_aCPW -> a_aCPW) -> k -> EnumMap k a_aCPW -> EnumMap k a_aCPW
adjustWithKey :: forall k (a_aCRi :: Type). Enum k => (k -> a_aCRi -> a_aCRi) -> k -> EnumMap k a_aCRi -> EnumMap k a_aCRi
update :: forall k (a_aCSR :: Type). Enum k => (a_aCSR -> Maybe a_aCSR) -> k -> EnumMap k a_aCSR -> EnumMap k a_aCSR
updateWithKey :: forall k (a_aCUd :: Type). Enum k => (k -> a_aCUd -> Maybe a_aCUd) -> k -> EnumMap k a_aCUd -> EnumMap k a_aCUd
updateLookupWithKey :: forall k (a_aCVM :: Type). Enum k => (k -> a_aCVM -> Maybe a_aCVM) -> k -> EnumMap k a_aCVM -> (Maybe a_aCVM, EnumMap k a_aCVM)
alter :: forall k (a_aCXz :: Type). Enum k => (Maybe a_aCXz -> Maybe a_aCXz) -> k -> EnumMap k a_aCXz -> EnumMap k a_aCXz
union :: forall k (a_apJe :: Type). EnumMap k a_apJe -> EnumMap k a_apJe -> EnumMap k a_apJe
unionWith :: forall k (a_aCZP :: Type). (a_aCZP -> a_aCZP -> a_aCZP) -> EnumMap k a_aCZP -> EnumMap k a_aCZP -> EnumMap k a_aCZP
unionWithKey :: forall k (a_aD1h :: Type). Enum k => (k -> a_aD1h -> a_aD1h -> a_aD1h) -> EnumMap k a_aD1h -> EnumMap k a_aD1h -> EnumMap k a_aD1h
unions :: forall k (a_apNi :: Type). [EnumMap k a_apNi] -> EnumMap k a_apNi
unionsWith :: forall k (a_aD3G :: Type). (a_aD3G -> a_aD3G -> a_aD3G) -> [EnumMap k a_aD3G] -> EnumMap k a_aD3G
difference :: forall k (a_apPg :: Type) (b_apPh :: Type). EnumMap k a_apPg -> EnumMap k b_apPh -> EnumMap k a_apPg
differenceWith :: forall k (a_aD5R :: Type) (b_aD5S :: Type). (a_aD5R -> b_aD5S -> Maybe a_aD5R) -> EnumMap k a_aD5R -> EnumMap k b_aD5S -> EnumMap k a_aD5R
differenceWithKey :: forall k (a_aD7o :: Type) (b_aD7p :: Type). Enum k => (k -> a_aD7o -> b_aD7p -> Maybe a_aD7o) -> EnumMap k a_aD7o -> EnumMap k b_aD7p -> EnumMap k a_aD7o
intersection :: forall k (a_apTz :: Type) (b_apTA :: Type). EnumMap k a_apTz -> EnumMap k b_apTA -> EnumMap k a_apTz
intersectionWith :: forall k (a_aDa7 :: Type) (b_aDa8 :: Type) (c_aDa9 :: Type). (a_aDa7 -> b_aDa8 -> c_aDa9) -> EnumMap k a_aDa7 -> EnumMap k b_aDa8 -> EnumMap k c_aDa9
intersectionWithKey :: forall k (a_aDbJ :: Type) (b_aDbK :: Type) (c_aDbL :: Type). Enum k => (k -> a_aDbJ -> b_aDbK -> c_aDbL) -> EnumMap k a_aDbJ -> EnumMap k b_aDbK -> EnumMap k c_aDbL
mergeWithKey :: forall k (a_aDdD :: Type) (b_aDdE :: Type) (c_aDdF :: Type). Enum k => (k -> a_aDdD -> b_aDdE -> Maybe c_aDdF) -> (EnumMap k a_aDdD -> EnumMap k c_aDdF) -> (EnumMap k b_aDdE -> EnumMap k c_aDdF) -> EnumMap k a_aDdD -> EnumMap k b_aDdE -> EnumMap k c_aDdF
map :: forall k (a_aDgo :: Type) (b_aDgp :: Type). (a_aDgo -> b_aDgp) -> EnumMap k a_aDgo -> EnumMap k b_aDgp
mapWithKey :: forall k (a_aDhv :: Type) (b_aDhw :: Type). Enum k => (k -> a_aDhv -> b_aDhw) -> EnumMap k a_aDhv -> EnumMap k b_aDhw
traverseWithKey :: forall k (t_aq3k :: Type -> Type) (a_aq3l :: Type) (b_aq3m :: Type). (Enum k, Applicative t_aq3k) => (k -> a_aq3l -> t_aq3k b_aq3m) -> EnumMap k a_aq3l -> t_aq3k (EnumMap k b_aq3m)
mapAccum :: forall k (a_aDkw :: Type) (b_aDkx :: Type) (c_aDky :: Type). (a_aDkw -> b_aDkx -> (a_aDkw, c_aDky)) -> a_aDkw -> EnumMap k b_aDkx -> (a_aDkw, EnumMap k c_aDky)
mapAccumWithKey :: forall k (a_aDms :: Type) (b_aDmt :: Type) (c_aDmu :: Type). Enum k => (a_aDms -> k -> b_aDmt -> (a_aDms, c_aDmu)) -> a_aDms -> EnumMap k b_aDmt -> (a_aDms, EnumMap k c_aDmu)
mapAccumRWithKey :: forall k (a_aDoG :: Type) (b_aDoH :: Type) (c_aDoI :: Type). Enum k => (a_aDoG -> k -> b_aDoH -> (a_aDoG, c_aDoI)) -> a_aDoG -> EnumMap k b_aDoH -> (a_aDoG, EnumMap k c_aDoI)
mapKeys :: forall k k' (a_aqbr :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_aqbr -> EnumMap k' a_aqbr
mapKeysWith :: forall k k' (a_aDsb :: Type). (Enum k, Enum k') => (a_aDsb -> a_aDsb -> a_aDsb) -> (k -> k') -> EnumMap k a_aDsb -> EnumMap k' a_aDsb
mapKeysMonotonic :: forall k k' (a_aqeD :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_aqeD -> EnumMap k' a_aqeD
foldr :: forall k (a_aqfW :: Type) (b_aqfX :: Type). (a_aqfW -> b_aqfX -> b_aqfX) -> b_aqfX -> EnumMap k a_aqfW -> b_aqfX
foldl :: forall k (a_aqhr :: Type) (b_aqhs :: Type). (a_aqhr -> b_aqhs -> a_aqhr) -> a_aqhr -> EnumMap k b_aqhs -> a_aqhr
foldrWithKey :: forall k (a_aqiW :: Type) (b_aqiX :: Type). Enum k => (k -> a_aqiW -> b_aqiX -> b_aqiX) -> b_aqiX -> EnumMap k a_aqiW -> b_aqiX
foldlWithKey :: forall k (a_aqkK :: Type) (b_aqkL :: Type). Enum k => (a_aqkK -> k -> b_aqkL -> a_aqkK) -> a_aqkK -> EnumMap k b_aqkL -> a_aqkK
foldMapWithKey :: forall k (m_aqmy :: Type) (a_aqmz :: Type). (Enum k, Monoid m_aqmy) => (k -> a_aqmz -> m_aqmy) -> EnumMap k a_aqmz -> m_aqmy
foldr' :: forall k (a_aqo2 :: Type) (b_aqo3 :: Type). (a_aqo2 -> b_aqo3 -> b_aqo3) -> b_aqo3 -> EnumMap k a_aqo2 -> b_aqo3
foldl' :: forall k (a_aqpx :: Type) (b_aqpy :: Type). (a_aqpx -> b_aqpy -> a_aqpx) -> a_aqpx -> EnumMap k b_aqpy -> a_aqpx
foldrWithKey' :: forall k (a_aqr2 :: Type) (b_aqr3 :: Type). Enum k => (k -> a_aqr2 -> b_aqr3 -> b_aqr3) -> b_aqr3 -> EnumMap k a_aqr2 -> b_aqr3
foldlWithKey' :: forall k (a_aqsQ :: Type) (b_aqsR :: Type). Enum k => (a_aqsQ -> k -> b_aqsR -> a_aqsQ) -> a_aqsQ -> EnumMap k b_aqsR -> a_aqsQ
elems :: forall k (a_aquE :: Type). EnumMap k a_aquE -> [a_aquE]
keys :: forall k (a_aqvk :: Type). Enum k => EnumMap k a_aqvk -> [k]
assocs :: forall k (a_aqw7 :: Type). Enum k => EnumMap k a_aqw7 -> [(k, a_aqw7)]
keysSet :: forall k (a_aqx4 :: Type). EnumMap k a_aqx4 -> EnumSet k
fromSet :: forall k (a_aDMy :: Type). Enum k => (k -> a_aDMy) -> EnumSet k -> EnumMap k a_aDMy
toList :: forall k (a_aqyP :: Type). Enum k => EnumMap k a_aqyP -> [(k, a_aqyP)]
fromList :: forall k (a_aDOB :: Type). Enum k => [(k, a_aDOB)] -> EnumMap k a_aDOB
fromListWith :: forall k (a_aDPy :: Type). Enum k => (a_aDPy -> a_aDPy -> a_aDPy) -> [(k, a_aDPy)] -> EnumMap k a_aDPy
fromListWithKey :: forall k (a_aDR5 :: Type). Enum k => (k -> a_aDR5 -> a_aDR5 -> a_aDR5) -> [(k, a_aDR5)] -> EnumMap k a_aDR5
toAscList :: forall k (a_aqE0 :: Type). Enum k => EnumMap k a_aqE0 -> [(k, a_aqE0)]
toDescList :: forall k (a_aqEX :: Type). Enum k => EnumMap k a_aqEX -> [(k, a_aqEX)]
fromAscList :: forall k (a_aDUF :: Type). Enum k => [(k, a_aDUF)] -> EnumMap k a_aDUF
fromAscListWith :: forall k (a_aDVC :: Type). Enum k => (a_aDVC -> a_aDVC -> a_aDVC) -> [(k, a_aDVC)] -> EnumMap k a_aDVC
fromAscListWithKey :: forall k (a_aDX9 :: Type). Enum k => (k -> a_aDX9 -> a_aDX9 -> a_aDX9) -> [(k, a_aDX9)] -> EnumMap k a_aDX9
fromDistinctAscList :: forall k (a_aDYT :: Type). Enum k => [(k, a_aDYT)] -> EnumMap k a_aDYT
filter :: forall k (a_aqL5 :: Type). (a_aqL5 -> Bool) -> EnumMap k a_aqL5 -> EnumMap k a_aqL5
filterWithKey :: forall k (a_aqM8 :: Type). Enum k => (k -> a_aqM8 -> Bool) -> EnumMap k a_aqM8 -> EnumMap k a_aqM8
partition :: forall k (a_aqNt :: Type). (a_aqNt -> Bool) -> EnumMap k a_aqNt -> (EnumMap k a_aqNt, EnumMap k a_aqNt)
partitionWithKey :: forall k (a_aqOI :: Type). Enum k => (k -> a_aqOI -> Bool) -> EnumMap k a_aqOI -> (EnumMap k a_aqOI, EnumMap k a_aqOI)
mapMaybe :: forall k (a_aE4T :: Type) (b_aE4U :: Type). (a_aE4T -> Maybe b_aE4U) -> EnumMap k a_aE4T -> EnumMap k b_aE4U
mapMaybeWithKey :: forall k (a_aE61 :: Type) (b_aE62 :: Type). Enum k => (k -> a_aE61 -> Maybe b_aE62) -> EnumMap k a_aE61 -> EnumMap k b_aE62
mapEither :: forall k (a_aE7r :: Type) (b_aE7s :: Type) (c_aE7t :: Type). (a_aE7r -> Either b_aE7s c_aE7t) -> EnumMap k a_aE7r -> (EnumMap k b_aE7s, EnumMap k c_aE7t)
mapEitherWithKey :: forall k (a_aE8Q :: Type) (b_aE8R :: Type) (c_aE8S :: Type). Enum k => (k -> a_aE8Q -> Either b_aE8R c_aE8S) -> EnumMap k a_aE8Q -> (EnumMap k b_aE8R, EnumMap k c_aE8S)
split :: forall k (a_aqVT :: Type). Enum k => k -> EnumMap k a_aqVT -> (EnumMap k a_aqVT, EnumMap k a_aqVT)
splitLookup :: forall k (a_aqX2 :: Type). Enum k => k -> EnumMap k a_aqX2 -> (EnumMap k a_aqX2, Maybe a_aqX2, EnumMap k a_aqX2)
isSubmapOf :: forall k (a_aqYd :: Type). Eq a_aqYd => EnumMap k a_aqYd -> EnumMap k a_aqYd -> Bool
isSubmapOfBy :: forall k (a_aqZb :: Type) (b_aqZc :: Type). (a_aqZb -> b_aqZc -> Bool) -> EnumMap k a_aqZb -> EnumMap k b_aqZc -> Bool
isProperSubmapOf :: forall k (a_ar0G :: Type). Eq a_ar0G => EnumMap k a_ar0G -> EnumMap k a_ar0G -> Bool
isProperSubmapOfBy :: forall k (a_ar1E :: Type) (b_ar1F :: Type). (a_ar1E -> b_ar1F -> Bool) -> EnumMap k a_ar1E -> EnumMap k b_ar1F -> Bool
findMin :: forall k (a_ar3a :: Type). Enum k => EnumMap k a_ar3a -> (k, a_ar3a)
findMax :: forall k (a_ar45 :: Type). Enum k => EnumMap k a_ar45 -> (k, a_ar45)
deleteMin :: forall k (a_ar50 :: Type). EnumMap k a_ar50 -> EnumMap k a_ar50
deleteMax :: forall k (a_ar5F :: Type). EnumMap k a_ar5F -> EnumMap k a_ar5F
deleteFindMin :: forall k (a_ar6k :: Type). Enum k => EnumMap k a_ar6k -> ((k, a_ar6k), EnumMap k a_ar6k)
deleteFindMax :: forall k (a_ar7p :: Type). Enum k => EnumMap k a_ar7p -> ((k, a_ar7p), EnumMap k a_ar7p)
updateMin :: forall k (a_aEmJ :: Type). (a_aEmJ -> Maybe a_aEmJ) -> EnumMap k a_aEmJ -> EnumMap k a_aEmJ
updateMax :: forall k (a_aEnM :: Type). (a_aEnM -> Maybe a_aEnM) -> EnumMap k a_aEnM -> EnumMap k a_aEnM
updateMinWithKey :: forall k (a_aEoP :: Type). Enum k => (k -> a_aEoP -> Maybe a_aEoP) -> EnumMap k a_aEoP -> EnumMap k a_aEoP
updateMaxWithKey :: forall k (a_aEqb :: Type). Enum k => (k -> a_aEqb -> Maybe a_aEqb) -> EnumMap k a_aEqb -> EnumMap k a_aEqb
minView :: forall k (a_ardi :: Type). EnumMap k a_ardi -> Maybe (a_ardi, EnumMap k a_ardi)
maxView :: forall k (a_arec :: Type). EnumMap k a_arec -> Maybe (a_arec, EnumMap k a_arec)
minViewWithKey :: forall k (a_arf6 :: Type). Enum k => EnumMap k a_arf6 -> Maybe ((k, a_arf6), EnumMap k a_arf6)
maxViewWithKey :: forall k (a_arge :: Type). Enum k => EnumMap k a_arge -> Maybe ((k, a_arge), EnumMap k a_arge)
showTree :: forall k (a_arhm :: Type). Show a_arhm => EnumMap k a_arhm -> String
showTreeWith :: forall k (a_ari7 :: Type). Show a_ari7 => Bool -> Bool -> EnumMap k a_ari7 -> String
instance Data.Foldable.Foldable (Data.EnumMap.Lazy.EnumMap k)
instance Data.Traversable.Traversable (Data.EnumMap.Lazy.EnumMap k)
instance GHC.Base.Functor (Data.EnumMap.Lazy.EnumMap k)
instance (GHC.Enum.Enum k, GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (Data.EnumMap.Lazy.EnumMap k a)
instance (GHC.Enum.Enum k, GHC.Read.Read k, GHC.Read.Read a) => GHC.Read.Read (Data.EnumMap.Lazy.EnumMap k a)
instance Control.DeepSeq.NFData v => Control.DeepSeq.NFData (Data.EnumMap.Lazy.EnumMap k v)
instance (Data.Data.Data v, Data.Data.Data k) => Data.Data.Data (Data.EnumMap.Lazy.EnumMap k v)
instance GHC.Base.Monoid (Data.EnumMap.Lazy.EnumMap k v)
instance GHC.Classes.Ord v => GHC.Classes.Ord (Data.EnumMap.Lazy.EnumMap k v)
instance GHC.Classes.Eq v => GHC.Classes.Eq (Data.EnumMap.Lazy.EnumMap k v)
