-- 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_ah2y :: Type). Enum k => (k -> b_ah2y -> b_ah2y) -> b_ah2y -> EnumSet k -> b_ah2y
foldl :: forall k (a_ah44 :: Type). Enum k => (a_ah44 -> k -> a_ah44) -> a_ah44 -> EnumSet k -> a_ah44
foldr' :: forall k (b_ah5A :: Type). Enum k => (k -> b_ah5A -> b_ah5A) -> b_ah5A -> EnumSet k -> b_ah5A
foldl' :: forall k (a_ah76 :: Type). Enum k => (a_ah76 -> k -> a_ah76) -> a_ah76 -> EnumSet k -> a_ah76
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_arl8 :: Type). Enum k => EnumMap k a_arl8 -> k -> a_arl8
(\\) :: forall k (a_arm5 :: Type) (b_arm6 :: Type). EnumMap k a_arm5 -> EnumMap k b_arm6 -> EnumMap k a_arm5
null :: forall k (a_arn2 :: Type). EnumMap k a_arn2 -> Bool
size :: forall k (a_arnG :: Type). EnumMap k a_arnG -> Int
member :: forall k (a_arok :: Type). Enum k => k -> EnumMap k a_arok -> Bool
notMember :: forall k (a_arph :: Type). Enum k => k -> EnumMap k a_arph -> Bool
lookup :: forall k (a_arqe :: Type). Enum k => k -> EnumMap k a_arqe -> Maybe a_arqe
findWithDefault :: forall k (a_arrf :: Type). Enum k => a_arrf -> k -> EnumMap k a_arrf -> a_arrf
lookupLT :: forall k (a_arso :: Type). Enum k => k -> EnumMap k a_arso -> Maybe (k, a_arso)
lookupGT :: forall k (a_artA :: Type). Enum k => k -> EnumMap k a_artA -> Maybe (k, a_artA)
lookupLE :: forall k (a_aruM :: Type). Enum k => k -> EnumMap k a_aruM -> Maybe (k, a_aruM)
lookupGE :: forall k (a_arvY :: Type). Enum k => k -> EnumMap k a_arvY -> Maybe (k, a_arvY)
empty :: forall k (a_arxa :: Type). EnumMap k a_arxa
singleton :: forall k (a_arxA :: Type). Enum k => k -> a_arxA -> EnumMap k a_arxA
insert :: forall k (a_aryx :: Type). Enum k => k -> a_aryx -> EnumMap k a_aryx -> EnumMap k a_aryx
insertWith :: forall k (a_arzH :: Type). Enum k => (a_arzH -> a_arzH -> a_arzH) -> k -> a_arzH -> EnumMap k a_arzH -> EnumMap k a_arzH
insertWithKey :: forall k (a_arBr :: Type). Enum k => (k -> a_arBr -> a_arBr -> a_arBr) -> k -> a_arBr -> EnumMap k a_arBr -> EnumMap k a_arBr
insertLookupWithKey :: forall k (a_arDo :: Type). Enum k => (k -> a_arDo -> a_arDo -> a_arDo) -> k -> a_arDo -> EnumMap k a_arDo -> (Maybe a_arDo, EnumMap k a_arDo)
delete :: forall k (a_arFz :: Type). Enum k => k -> EnumMap k a_arFz -> EnumMap k a_arFz
adjust :: forall k (a_arGx :: Type). Enum k => (a_arGx -> a_arGx) -> k -> EnumMap k a_arGx -> EnumMap k a_arGx
adjustWithKey :: forall k (a_arHT :: Type). Enum k => (k -> a_arHT -> a_arHT) -> k -> EnumMap k a_arHT -> EnumMap k a_arHT
update :: forall k (a_arJs :: Type). Enum k => (a_arJs -> Maybe a_arJs) -> k -> EnumMap k a_arJs -> EnumMap k a_arJs
updateWithKey :: forall k (a_arKO :: Type). Enum k => (k -> a_arKO -> Maybe a_arKO) -> k -> EnumMap k a_arKO -> EnumMap k a_arKO
updateLookupWithKey :: forall k (a_arMn :: Type). Enum k => (k -> a_arMn -> Maybe a_arMn) -> k -> EnumMap k a_arMn -> (Maybe a_arMn, EnumMap k a_arMn)
alter :: forall k (a_arOa :: Type). Enum k => (Maybe a_arOa -> Maybe a_arOa) -> k -> EnumMap k a_arOa -> EnumMap k a_arOa
union :: forall k (a_arPA :: Type). EnumMap k a_arPA -> EnumMap k a_arPA -> EnumMap k a_arPA
unionWith :: forall k (a_arQs :: Type). (a_arQs -> a_arQs -> a_arQs) -> EnumMap k a_arQs -> EnumMap k a_arQs -> EnumMap k a_arQs
unionWithKey :: forall k (a_arRU :: Type). Enum k => (k -> a_arRU -> a_arRU -> a_arRU) -> EnumMap k a_arRU -> EnumMap k a_arRU -> EnumMap k a_arRU
unions :: forall k (a_arTE :: Type). [EnumMap k a_arTE] -> EnumMap k a_arTE
unionsWith :: forall k (a_arUl :: Type). (a_arUl -> a_arUl -> a_arUl) -> [EnumMap k a_arUl] -> EnumMap k a_arUl
difference :: forall k (a_arVC :: Type) (b_arVD :: Type). EnumMap k a_arVC -> EnumMap k b_arVD -> EnumMap k a_arVC
differenceWith :: forall k (a_arWz :: Type) (b_arWA :: Type). (a_arWz -> b_arWA -> Maybe a_arWz) -> EnumMap k a_arWz -> EnumMap k b_arWA -> EnumMap k a_arWz
differenceWithKey :: forall k (a_arY6 :: Type) (b_arY7 :: Type). Enum k => (k -> a_arY6 -> b_arY7 -> Maybe a_arY6) -> EnumMap k a_arY6 -> EnumMap k b_arY7 -> EnumMap k a_arY6
intersection :: forall k (a_arZV :: Type) (b_arZW :: Type). EnumMap k a_arZV -> EnumMap k b_arZW -> EnumMap k a_arZV
intersectionWith :: forall k (a_as0S :: Type) (b_as0T :: Type) (c_as0U :: Type). (a_as0S -> b_as0T -> c_as0U) -> EnumMap k a_as0S -> EnumMap k b_as0T -> EnumMap k c_as0U
intersectionWithKey :: forall k (a_as2u :: Type) (b_as2v :: Type) (c_as2w :: Type). Enum k => (k -> a_as2u -> b_as2v -> c_as2w) -> EnumMap k a_as2u -> EnumMap k b_as2v -> EnumMap k c_as2w
mergeWithKey :: forall k (a_as4o :: Type) (b_as4p :: Type) (c_as4q :: Type). Enum k => (k -> a_as4o -> b_as4p -> Maybe c_as4q) -> (EnumMap k a_as4o -> EnumMap k c_as4q) -> (EnumMap k b_as4p -> EnumMap k c_as4q) -> EnumMap k a_as4o -> EnumMap k b_as4p -> EnumMap k c_as4q
map :: forall k (a_as79 :: Type) (b_as7a :: Type). (a_as79 -> b_as7a) -> EnumMap k a_as79 -> EnumMap k b_as7a
mapWithKey :: forall k (a_as8g :: Type) (b_as8h :: Type). Enum k => (k -> a_as8g -> b_as8h) -> EnumMap k a_as8g -> EnumMap k b_as8h
traverseWithKey :: forall k (t_as9G :: Type -> Type) (a_as9H :: Type) (b_as9I :: Type). (Enum k, Applicative t_as9G) => (k -> a_as9H -> t_as9G b_as9I) -> EnumMap k a_as9H -> t_as9G (EnumMap k b_as9I)
mapAccum :: forall k (a_asbp :: Type) (b_asbq :: Type) (c_asbr :: Type). (a_asbp -> b_asbq -> (a_asbp, c_asbr)) -> a_asbp -> EnumMap k b_asbq -> (a_asbp, EnumMap k c_asbr)
mapAccumWithKey :: forall k (a_asdl :: Type) (b_asdm :: Type) (c_asdn :: Type). Enum k => (a_asdl -> k -> b_asdm -> (a_asdl, c_asdn)) -> a_asdl -> EnumMap k b_asdm -> (a_asdl, EnumMap k c_asdn)
mapAccumRWithKey :: forall k (a_asfz :: Type) (b_asfA :: Type) (c_asfB :: Type). Enum k => (a_asfz -> k -> b_asfA -> (a_asfz, c_asfB)) -> a_asfz -> EnumMap k b_asfA -> (a_asfz, EnumMap k c_asfB)
mapKeys :: forall k k' (a_ashN :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_ashN -> EnumMap k' a_ashN
mapKeysWith :: forall k k' (a_asj6 :: Type). (Enum k, Enum k') => (a_asj6 -> a_asj6 -> a_asj6) -> (k -> k') -> EnumMap k a_asj6 -> EnumMap k' a_asj6
mapKeysMonotonic :: forall k k' (a_askZ :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_askZ -> EnumMap k' a_askZ
foldr :: forall k (a_asmi :: Type) (b_asmj :: Type). (a_asmi -> b_asmj -> b_asmj) -> b_asmj -> EnumMap k a_asmi -> b_asmj
foldl :: forall k (a_asnN :: Type) (b_asnO :: Type). (a_asnN -> b_asnO -> a_asnN) -> a_asnN -> EnumMap k b_asnO -> a_asnN
foldrWithKey :: forall k (a_aspi :: Type) (b_aspj :: Type). Enum k => (k -> a_aspi -> b_aspj -> b_aspj) -> b_aspj -> EnumMap k a_aspi -> b_aspj
foldlWithKey :: forall k (a_asr6 :: Type) (b_asr7 :: Type). Enum k => (a_asr6 -> k -> b_asr7 -> a_asr6) -> a_asr6 -> EnumMap k b_asr7 -> a_asr6
foldMapWithKey :: forall k (m_assU :: Type) (a_assV :: Type). (Enum k, Monoid m_assU) => (k -> a_assV -> m_assU) -> EnumMap k a_assV -> m_assU
foldr' :: forall k (a_asuo :: Type) (b_asup :: Type). (a_asuo -> b_asup -> b_asup) -> b_asup -> EnumMap k a_asuo -> b_asup
foldl' :: forall k (a_asvT :: Type) (b_asvU :: Type). (a_asvT -> b_asvU -> a_asvT) -> a_asvT -> EnumMap k b_asvU -> a_asvT
foldrWithKey' :: forall k (a_asxo :: Type) (b_asxp :: Type). Enum k => (k -> a_asxo -> b_asxp -> b_asxp) -> b_asxp -> EnumMap k a_asxo -> b_asxp
foldlWithKey' :: forall k (a_aszc :: Type) (b_aszd :: Type). Enum k => (a_aszc -> k -> b_aszd -> a_aszc) -> a_aszc -> EnumMap k b_aszd -> a_aszc
elems :: forall k (a_asB0 :: Type). EnumMap k a_asB0 -> [a_asB0]
keys :: forall k (a_asBG :: Type). Enum k => EnumMap k a_asBG -> [k]
assocs :: forall k (a_asCt :: Type). Enum k => EnumMap k a_asCt -> [(k, a_asCt)]
keysSet :: forall k (a_asDq :: Type). EnumMap k a_asDq -> EnumSet k
fromSet :: forall k (a_asE3 :: Type). Enum k => (k -> a_asE3) -> EnumSet k -> EnumMap k a_asE3
toList :: forall k (a_asFb :: Type). Enum k => EnumMap k a_asFb -> [(k, a_asFb)]
fromList :: forall k (a_asG8 :: Type). Enum k => [(k, a_asG8)] -> EnumMap k a_asG8
fromListWith :: forall k (a_asH5 :: Type). Enum k => (a_asH5 -> a_asH5 -> a_asH5) -> [(k, a_asH5)] -> EnumMap k a_asH5
fromListWithKey :: forall k (a_asIC :: Type). Enum k => (k -> a_asIC -> a_asIC -> a_asIC) -> [(k, a_asIC)] -> EnumMap k a_asIC
toAscList :: forall k (a_asKm :: Type). Enum k => EnumMap k a_asKm -> [(k, a_asKm)]
toDescList :: forall k (a_asLj :: Type). Enum k => EnumMap k a_asLj -> [(k, a_asLj)]
fromAscList :: forall k (a_asMg :: Type). Enum k => [(k, a_asMg)] -> EnumMap k a_asMg
fromAscListWith :: forall k (a_asNd :: Type). Enum k => (a_asNd -> a_asNd -> a_asNd) -> [(k, a_asNd)] -> EnumMap k a_asNd
fromAscListWithKey :: forall k (a_asOK :: Type). Enum k => (k -> a_asOK -> a_asOK -> a_asOK) -> [(k, a_asOK)] -> EnumMap k a_asOK
fromDistinctAscList :: forall k (a_asQu :: Type). Enum k => [(k, a_asQu)] -> EnumMap k a_asQu
filter :: forall k (a_asRr :: Type). (a_asRr -> Bool) -> EnumMap k a_asRr -> EnumMap k a_asRr
filterWithKey :: forall k (a_asSu :: Type). Enum k => (k -> a_asSu -> Bool) -> EnumMap k a_asSu -> EnumMap k a_asSu
partition :: forall k (a_asTP :: Type). (a_asTP -> Bool) -> EnumMap k a_asTP -> (EnumMap k a_asTP, EnumMap k a_asTP)
partitionWithKey :: forall k (a_asV4 :: Type). Enum k => (k -> a_asV4 -> Bool) -> EnumMap k a_asV4 -> (EnumMap k a_asV4, EnumMap k a_asV4)
mapMaybe :: forall k (a_asWB :: Type) (b_asWC :: Type). (a_asWB -> Maybe b_asWC) -> EnumMap k a_asWB -> EnumMap k b_asWC
mapMaybeWithKey :: forall k (a_asXJ :: Type) (b_asXK :: Type). Enum k => (k -> a_asXJ -> Maybe b_asXK) -> EnumMap k a_asXJ -> EnumMap k b_asXK
mapEither :: forall k (a_asZ9 :: Type) (b_asZa :: Type) (c_asZb :: Type). (a_asZ9 -> Either b_asZa c_asZb) -> EnumMap k a_asZ9 -> (EnumMap k b_asZa, EnumMap k c_asZb)
mapEitherWithKey :: forall k (a_at0y :: Type) (b_at0z :: Type) (c_at0A :: Type). Enum k => (k -> a_at0y -> Either b_at0z c_at0A) -> EnumMap k a_at0y -> (EnumMap k b_at0z, EnumMap k c_at0A)
split :: forall k (a_at2f :: Type). Enum k => k -> EnumMap k a_at2f -> (EnumMap k a_at2f, EnumMap k a_at2f)
splitLookup :: forall k (a_at3o :: Type). Enum k => k -> EnumMap k a_at3o -> (EnumMap k a_at3o, Maybe a_at3o, EnumMap k a_at3o)
isSubmapOf :: forall k (a_at4z :: Type). Eq a_at4z => EnumMap k a_at4z -> EnumMap k a_at4z -> Bool
isSubmapOfBy :: forall k (a_at5x :: Type) (b_at5y :: Type). (a_at5x -> b_at5y -> Bool) -> EnumMap k a_at5x -> EnumMap k b_at5y -> Bool
isProperSubmapOf :: forall k (a_at72 :: Type). Eq a_at72 => EnumMap k a_at72 -> EnumMap k a_at72 -> Bool
isProperSubmapOfBy :: forall k (a_at80 :: Type) (b_at81 :: Type). (a_at80 -> b_at81 -> Bool) -> EnumMap k a_at80 -> EnumMap k b_at81 -> Bool
findMin :: forall k (a_at9w :: Type). Enum k => EnumMap k a_at9w -> (k, a_at9w)
findMax :: forall k (a_atar :: Type). Enum k => EnumMap k a_atar -> (k, a_atar)
deleteMin :: forall k (a_atbm :: Type). EnumMap k a_atbm -> EnumMap k a_atbm
deleteMax :: forall k (a_atc1 :: Type). EnumMap k a_atc1 -> EnumMap k a_atc1
deleteFindMin :: forall k (a_atcG :: Type). Enum k => EnumMap k a_atcG -> ((k, a_atcG), EnumMap k a_atcG)
deleteFindMax :: forall k (a_atdL :: Type). Enum k => EnumMap k a_atdL -> ((k, a_atdL), EnumMap k a_atdL)
updateMin :: forall k (a_ateQ :: Type). (a_ateQ -> Maybe a_ateQ) -> EnumMap k a_ateQ -> EnumMap k a_ateQ
updateMax :: forall k (a_atfT :: Type). (a_atfT -> Maybe a_atfT) -> EnumMap k a_atfT -> EnumMap k a_atfT
updateMinWithKey :: forall k (a_atgW :: Type). Enum k => (k -> a_atgW -> Maybe a_atgW) -> EnumMap k a_atgW -> EnumMap k a_atgW
updateMaxWithKey :: forall k (a_atii :: Type). Enum k => (k -> a_atii -> Maybe a_atii) -> EnumMap k a_atii -> EnumMap k a_atii
minView :: forall k (a_atjE :: Type). EnumMap k a_atjE -> Maybe (a_atjE, EnumMap k a_atjE)
maxView :: forall k (a_atky :: Type). EnumMap k a_atky -> Maybe (a_atky, EnumMap k a_atky)
minViewWithKey :: forall k (a_atls :: Type). Enum k => EnumMap k a_atls -> Maybe ((k, a_atls), EnumMap k a_atls)
maxViewWithKey :: forall k (a_atmA :: Type). Enum k => EnumMap k a_atmA -> Maybe ((k, a_atmA), EnumMap k a_atmA)
showTree :: forall k (a_atnI :: Type). Show a_atnI => EnumMap k a_atnI -> String
showTreeWith :: forall k (a_atot :: Type). Show a_atot => Bool -> Bool -> EnumMap k a_atot -> 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_arl8 :: Type). Enum k => EnumMap k a_arl8 -> k -> a_arl8
(\\) :: forall k (a_arm5 :: Type) (b_arm6 :: Type). EnumMap k a_arm5 -> EnumMap k b_arm6 -> EnumMap k a_arm5
null :: forall k (a_arn2 :: Type). EnumMap k a_arn2 -> Bool
size :: forall k (a_arnG :: Type). EnumMap k a_arnG -> Int
member :: forall k (a_arok :: Type). Enum k => k -> EnumMap k a_arok -> Bool
notMember :: forall k (a_arph :: Type). Enum k => k -> EnumMap k a_arph -> Bool
lookup :: forall k (a_arqe :: Type). Enum k => k -> EnumMap k a_arqe -> Maybe a_arqe
findWithDefault :: forall k (a_aGLl :: Type). Enum k => a_aGLl -> k -> EnumMap k a_aGLl -> a_aGLl
lookupLT :: forall k (a_arso :: Type). Enum k => k -> EnumMap k a_arso -> Maybe (k, a_arso)
lookupGT :: forall k (a_artA :: Type). Enum k => k -> EnumMap k a_artA -> Maybe (k, a_artA)
lookupLE :: forall k (a_aruM :: Type). Enum k => k -> EnumMap k a_aruM -> Maybe (k, a_aruM)
lookupGE :: forall k (a_arvY :: Type). Enum k => k -> EnumMap k a_arvY -> Maybe (k, a_arvY)
empty :: forall k (a_arxa :: Type). EnumMap k a_arxa
singleton :: forall k (a_aGRw :: Type). Enum k => k -> a_aGRw -> EnumMap k a_aGRw
insert :: forall k (a_aGSt :: Type). Enum k => k -> a_aGSt -> EnumMap k a_aGSt -> EnumMap k a_aGSt
insertWith :: forall k (a_aGTD :: Type). Enum k => (a_aGTD -> a_aGTD -> a_aGTD) -> k -> a_aGTD -> EnumMap k a_aGTD -> EnumMap k a_aGTD
insertWithKey :: forall k (a_aGVn :: Type). Enum k => (k -> a_aGVn -> a_aGVn -> a_aGVn) -> k -> a_aGVn -> EnumMap k a_aGVn -> EnumMap k a_aGVn
insertLookupWithKey :: forall k (a_aGXk :: Type). Enum k => (k -> a_aGXk -> a_aGXk -> a_aGXk) -> k -> a_aGXk -> EnumMap k a_aGXk -> (Maybe a_aGXk, EnumMap k a_aGXk)
delete :: forall k (a_arFz :: Type). Enum k => k -> EnumMap k a_arFz -> EnumMap k a_arFz
adjust :: forall k (a_aH0r :: Type). Enum k => (a_aH0r -> a_aH0r) -> k -> EnumMap k a_aH0r -> EnumMap k a_aH0r
adjustWithKey :: forall k (a_aH1N :: Type). Enum k => (k -> a_aH1N -> a_aH1N) -> k -> EnumMap k a_aH1N -> EnumMap k a_aH1N
update :: forall k (a_aH3m :: Type). Enum k => (a_aH3m -> Maybe a_aH3m) -> k -> EnumMap k a_aH3m -> EnumMap k a_aH3m
updateWithKey :: forall k (a_aH4I :: Type). Enum k => (k -> a_aH4I -> Maybe a_aH4I) -> k -> EnumMap k a_aH4I -> EnumMap k a_aH4I
updateLookupWithKey :: forall k (a_aH6h :: Type). Enum k => (k -> a_aH6h -> Maybe a_aH6h) -> k -> EnumMap k a_aH6h -> (Maybe a_aH6h, EnumMap k a_aH6h)
alter :: forall k (a_aH84 :: Type). Enum k => (Maybe a_aH84 -> Maybe a_aH84) -> k -> EnumMap k a_aH84 -> EnumMap k a_aH84
union :: forall k (a_arPA :: Type). EnumMap k a_arPA -> EnumMap k a_arPA -> EnumMap k a_arPA
unionWith :: forall k (a_aHak :: Type). (a_aHak -> a_aHak -> a_aHak) -> EnumMap k a_aHak -> EnumMap k a_aHak -> EnumMap k a_aHak
unionWithKey :: forall k (a_aHbM :: Type). Enum k => (k -> a_aHbM -> a_aHbM -> a_aHbM) -> EnumMap k a_aHbM -> EnumMap k a_aHbM -> EnumMap k a_aHbM
unions :: forall k (a_arTE :: Type). [EnumMap k a_arTE] -> EnumMap k a_arTE
unionsWith :: forall k (a_aHeb :: Type). (a_aHeb -> a_aHeb -> a_aHeb) -> [EnumMap k a_aHeb] -> EnumMap k a_aHeb
difference :: forall k (a_arVC :: Type) (b_arVD :: Type). EnumMap k a_arVC -> EnumMap k b_arVD -> EnumMap k a_arVC
differenceWith :: forall k (a_aHgm :: Type) (b_aHgn :: Type). (a_aHgm -> b_aHgn -> Maybe a_aHgm) -> EnumMap k a_aHgm -> EnumMap k b_aHgn -> EnumMap k a_aHgm
differenceWithKey :: forall k (a_aHhT :: Type) (b_aHhU :: Type). Enum k => (k -> a_aHhT -> b_aHhU -> Maybe a_aHhT) -> EnumMap k a_aHhT -> EnumMap k b_aHhU -> EnumMap k a_aHhT
intersection :: forall k (a_arZV :: Type) (b_arZW :: Type). EnumMap k a_arZV -> EnumMap k b_arZW -> EnumMap k a_arZV
intersectionWith :: forall k (a_aHkC :: Type) (b_aHkD :: Type) (c_aHkE :: Type). (a_aHkC -> b_aHkD -> c_aHkE) -> EnumMap k a_aHkC -> EnumMap k b_aHkD -> EnumMap k c_aHkE
intersectionWithKey :: forall k (a_aHme :: Type) (b_aHmf :: Type) (c_aHmg :: Type). Enum k => (k -> a_aHme -> b_aHmf -> c_aHmg) -> EnumMap k a_aHme -> EnumMap k b_aHmf -> EnumMap k c_aHmg
mergeWithKey :: forall k (a_aHo8 :: Type) (b_aHo9 :: Type) (c_aHoa :: Type). Enum k => (k -> a_aHo8 -> b_aHo9 -> Maybe c_aHoa) -> (EnumMap k a_aHo8 -> EnumMap k c_aHoa) -> (EnumMap k b_aHo9 -> EnumMap k c_aHoa) -> EnumMap k a_aHo8 -> EnumMap k b_aHo9 -> EnumMap k c_aHoa
map :: forall k (a_aHqT :: Type) (b_aHqU :: Type). (a_aHqT -> b_aHqU) -> EnumMap k a_aHqT -> EnumMap k b_aHqU
mapWithKey :: forall k (a_aHs0 :: Type) (b_aHs1 :: Type). Enum k => (k -> a_aHs0 -> b_aHs1) -> EnumMap k a_aHs0 -> EnumMap k b_aHs1
traverseWithKey :: forall k (t_as9G :: Type -> Type) (a_as9H :: Type) (b_as9I :: Type). (Enum k, Applicative t_as9G) => (k -> a_as9H -> t_as9G b_as9I) -> EnumMap k a_as9H -> t_as9G (EnumMap k b_as9I)
mapAccum :: forall k (a_aHv1 :: Type) (b_aHv2 :: Type) (c_aHv3 :: Type). (a_aHv1 -> b_aHv2 -> (a_aHv1, c_aHv3)) -> a_aHv1 -> EnumMap k b_aHv2 -> (a_aHv1, EnumMap k c_aHv3)
mapAccumWithKey :: forall k (a_aHwX :: Type) (b_aHwY :: Type) (c_aHwZ :: Type). Enum k => (a_aHwX -> k -> b_aHwY -> (a_aHwX, c_aHwZ)) -> a_aHwX -> EnumMap k b_aHwY -> (a_aHwX, EnumMap k c_aHwZ)
mapAccumRWithKey :: forall k (a_aHzb :: Type) (b_aHzc :: Type) (c_aHzd :: Type). Enum k => (a_aHzb -> k -> b_aHzc -> (a_aHzb, c_aHzd)) -> a_aHzb -> EnumMap k b_aHzc -> (a_aHzb, EnumMap k c_aHzd)
mapKeys :: forall k k' (a_ashN :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_ashN -> EnumMap k' a_ashN
mapKeysWith :: forall k k' (a_aHCG :: Type). (Enum k, Enum k') => (a_aHCG -> a_aHCG -> a_aHCG) -> (k -> k') -> EnumMap k a_aHCG -> EnumMap k' a_aHCG
mapKeysMonotonic :: forall k k' (a_askZ :: Type). (Enum k, Enum k') => (k -> k') -> EnumMap k a_askZ -> EnumMap k' a_askZ
foldr :: forall k (a_asmi :: Type) (b_asmj :: Type). (a_asmi -> b_asmj -> b_asmj) -> b_asmj -> EnumMap k a_asmi -> b_asmj
foldl :: forall k (a_asnN :: Type) (b_asnO :: Type). (a_asnN -> b_asnO -> a_asnN) -> a_asnN -> EnumMap k b_asnO -> a_asnN
foldrWithKey :: forall k (a_aspi :: Type) (b_aspj :: Type). Enum k => (k -> a_aspi -> b_aspj -> b_aspj) -> b_aspj -> EnumMap k a_aspi -> b_aspj
foldlWithKey :: forall k (a_asr6 :: Type) (b_asr7 :: Type). Enum k => (a_asr6 -> k -> b_asr7 -> a_asr6) -> a_asr6 -> EnumMap k b_asr7 -> a_asr6
foldMapWithKey :: forall k (m_assU :: Type) (a_assV :: Type). (Enum k, Monoid m_assU) => (k -> a_assV -> m_assU) -> EnumMap k a_assV -> m_assU
foldr' :: forall k (a_asuo :: Type) (b_asup :: Type). (a_asuo -> b_asup -> b_asup) -> b_asup -> EnumMap k a_asuo -> b_asup
foldl' :: forall k (a_asvT :: Type) (b_asvU :: Type). (a_asvT -> b_asvU -> a_asvT) -> a_asvT -> EnumMap k b_asvU -> a_asvT
foldrWithKey' :: forall k (a_asxo :: Type) (b_asxp :: Type). Enum k => (k -> a_asxo -> b_asxp -> b_asxp) -> b_asxp -> EnumMap k a_asxo -> b_asxp
foldlWithKey' :: forall k (a_aszc :: Type) (b_aszd :: Type). Enum k => (a_aszc -> k -> b_aszd -> a_aszc) -> a_aszc -> EnumMap k b_aszd -> a_aszc
elems :: forall k (a_asB0 :: Type). EnumMap k a_asB0 -> [a_asB0]
keys :: forall k (a_asBG :: Type). Enum k => EnumMap k a_asBG -> [k]
assocs :: forall k (a_asCt :: Type). Enum k => EnumMap k a_asCt -> [(k, a_asCt)]
keysSet :: forall k (a_asDq :: Type). EnumMap k a_asDq -> EnumSet k
fromSet :: forall k (a_aHX3 :: Type). Enum k => (k -> a_aHX3) -> EnumSet k -> EnumMap k a_aHX3
toList :: forall k (a_asFb :: Type). Enum k => EnumMap k a_asFb -> [(k, a_asFb)]
fromList :: forall k (a_aHZ6 :: Type). Enum k => [(k, a_aHZ6)] -> EnumMap k a_aHZ6
fromListWith :: forall k (a_aI03 :: Type). Enum k => (a_aI03 -> a_aI03 -> a_aI03) -> [(k, a_aI03)] -> EnumMap k a_aI03
fromListWithKey :: forall k (a_aI1A :: Type). Enum k => (k -> a_aI1A -> a_aI1A -> a_aI1A) -> [(k, a_aI1A)] -> EnumMap k a_aI1A
toAscList :: forall k (a_asKm :: Type). Enum k => EnumMap k a_asKm -> [(k, a_asKm)]
toDescList :: forall k (a_asLj :: Type). Enum k => EnumMap k a_asLj -> [(k, a_asLj)]
fromAscList :: forall k (a_aI5a :: Type). Enum k => [(k, a_aI5a)] -> EnumMap k a_aI5a
fromAscListWith :: forall k (a_aI67 :: Type). Enum k => (a_aI67 -> a_aI67 -> a_aI67) -> [(k, a_aI67)] -> EnumMap k a_aI67
fromAscListWithKey :: forall k (a_aI7E :: Type). Enum k => (k -> a_aI7E -> a_aI7E -> a_aI7E) -> [(k, a_aI7E)] -> EnumMap k a_aI7E
fromDistinctAscList :: forall k (a_aI9o :: Type). Enum k => [(k, a_aI9o)] -> EnumMap k a_aI9o
filter :: forall k (a_asRr :: Type). (a_asRr -> Bool) -> EnumMap k a_asRr -> EnumMap k a_asRr
filterWithKey :: forall k (a_asSu :: Type). Enum k => (k -> a_asSu -> Bool) -> EnumMap k a_asSu -> EnumMap k a_asSu
partition :: forall k (a_asTP :: Type). (a_asTP -> Bool) -> EnumMap k a_asTP -> (EnumMap k a_asTP, EnumMap k a_asTP)
partitionWithKey :: forall k (a_asV4 :: Type). Enum k => (k -> a_asV4 -> Bool) -> EnumMap k a_asV4 -> (EnumMap k a_asV4, EnumMap k a_asV4)
mapMaybe :: forall k (a_aIfo :: Type) (b_aIfp :: Type). (a_aIfo -> Maybe b_aIfp) -> EnumMap k a_aIfo -> EnumMap k b_aIfp
mapMaybeWithKey :: forall k (a_aIgw :: Type) (b_aIgx :: Type). Enum k => (k -> a_aIgw -> Maybe b_aIgx) -> EnumMap k a_aIgw -> EnumMap k b_aIgx
mapEither :: forall k (a_aIhW :: Type) (b_aIhX :: Type) (c_aIhY :: Type). (a_aIhW -> Either b_aIhX c_aIhY) -> EnumMap k a_aIhW -> (EnumMap k b_aIhX, EnumMap k c_aIhY)
mapEitherWithKey :: forall k (a_aIjl :: Type) (b_aIjm :: Type) (c_aIjn :: Type). Enum k => (k -> a_aIjl -> Either b_aIjm c_aIjn) -> EnumMap k a_aIjl -> (EnumMap k b_aIjm, EnumMap k c_aIjn)
split :: forall k (a_at2f :: Type). Enum k => k -> EnumMap k a_at2f -> (EnumMap k a_at2f, EnumMap k a_at2f)
splitLookup :: forall k (a_at3o :: Type). Enum k => k -> EnumMap k a_at3o -> (EnumMap k a_at3o, Maybe a_at3o, EnumMap k a_at3o)
isSubmapOf :: forall k (a_at4z :: Type). Eq a_at4z => EnumMap k a_at4z -> EnumMap k a_at4z -> Bool
isSubmapOfBy :: forall k (a_at5x :: Type) (b_at5y :: Type). (a_at5x -> b_at5y -> Bool) -> EnumMap k a_at5x -> EnumMap k b_at5y -> Bool
isProperSubmapOf :: forall k (a_at72 :: Type). Eq a_at72 => EnumMap k a_at72 -> EnumMap k a_at72 -> Bool
isProperSubmapOfBy :: forall k (a_at80 :: Type) (b_at81 :: Type). (a_at80 -> b_at81 -> Bool) -> EnumMap k a_at80 -> EnumMap k b_at81 -> Bool
findMin :: forall k (a_at9w :: Type). Enum k => EnumMap k a_at9w -> (k, a_at9w)
findMax :: forall k (a_atar :: Type). Enum k => EnumMap k a_atar -> (k, a_atar)
deleteMin :: forall k (a_atbm :: Type). EnumMap k a_atbm -> EnumMap k a_atbm
deleteMax :: forall k (a_atc1 :: Type). EnumMap k a_atc1 -> EnumMap k a_atc1
deleteFindMin :: forall k (a_atcG :: Type). Enum k => EnumMap k a_atcG -> ((k, a_atcG), EnumMap k a_atcG)
deleteFindMax :: forall k (a_atdL :: Type). Enum k => EnumMap k a_atdL -> ((k, a_atdL), EnumMap k a_atdL)
updateMin :: forall k (a_aIxe :: Type). (a_aIxe -> Maybe a_aIxe) -> EnumMap k a_aIxe -> EnumMap k a_aIxe
updateMax :: forall k (a_aIyh :: Type). (a_aIyh -> Maybe a_aIyh) -> EnumMap k a_aIyh -> EnumMap k a_aIyh
updateMinWithKey :: forall k (a_aIzk :: Type). Enum k => (k -> a_aIzk -> Maybe a_aIzk) -> EnumMap k a_aIzk -> EnumMap k a_aIzk
updateMaxWithKey :: forall k (a_aIAG :: Type). Enum k => (k -> a_aIAG -> Maybe a_aIAG) -> EnumMap k a_aIAG -> EnumMap k a_aIAG
minView :: forall k (a_atjE :: Type). EnumMap k a_atjE -> Maybe (a_atjE, EnumMap k a_atjE)
maxView :: forall k (a_atky :: Type). EnumMap k a_atky -> Maybe (a_atky, EnumMap k a_atky)
minViewWithKey :: forall k (a_atls :: Type). Enum k => EnumMap k a_atls -> Maybe ((k, a_atls), EnumMap k a_atls)
maxViewWithKey :: forall k (a_atmA :: Type). Enum k => EnumMap k a_atmA -> Maybe ((k, a_atmA), EnumMap k a_atmA)
showTree :: forall k (a_atnI :: Type). Show a_atnI => EnumMap k a_atnI -> String
showTreeWith :: forall k (a_atot :: Type). Show a_atot => Bool -> Bool -> EnumMap k a_atot -> 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)
