regex-tdfa-1.3.2.2: Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)

Safe Haskell | Safe-Inferred
Language | Haskell2010

Data.IntMap.EnumMap2

# Documentation

newtype EnumMap k a #

Constructors

EnumMap |

Fields

- unEnumMap :: IntMap a

#### Instances

Instances details

Ord k => Functor (EnumMap k) # |
Instance details Defined in Data.IntMap.EnumMap2 Methods fmap :: (a -> b) -> EnumMap k a -> EnumMap k b # (<$) :: a -> EnumMap k b -> EnumMap k a #
Ord k => Foldable (EnumMap k) # |

Instance details

Defined in Data.IntMap.EnumMap2

Methods

fold :: Monoid m => EnumMap k m -> m #

foldMap :: Monoid m => (a -> m) -> EnumMap k a -> m #

foldMap' :: Monoid m => (a -> m) -> EnumMap k a -> m #

foldr :: (a -> b -> b) -> b -> EnumMap k a -> b #

foldr' :: (a -> b -> b) -> b -> EnumMap k a -> b #

foldl :: (b -> a -> b) -> b -> EnumMap k a -> b #

foldl' :: (b -> a -> b) -> b -> EnumMap k a -> b #

foldr1 :: (a -> a -> a) -> EnumMap k a -> a #

foldl1 :: (a -> a -> a) -> EnumMap k a -> a #

toList :: EnumMap k a -> [a] #

null :: EnumMap k a -> Bool #

length :: EnumMap k a -> Int #

elem :: Eq a => a -> EnumMap k a -> Bool #

maximum :: Ord a => EnumMap k a -> a #

minimum :: Ord a => EnumMap k a -> a #

sum :: Num a => EnumMap k a -> a #

product :: Num a => EnumMap k a -> a #

Ord k => Monoid (EnumMap k a) # |
Instance details Defined in Data.IntMap.EnumMap2 Methods mempty :: EnumMap k a # mappend :: EnumMap k a -> EnumMap k a -> EnumMap k a # mconcat :: [EnumMap k a] -> EnumMap k a #
Ord k => Semigroup (EnumMap k a) # |
Instance details Defined in Data.IntMap.EnumMap2 Methods (<>) :: EnumMap k a -> EnumMap k a -> EnumMap k a # sconcat :: NonEmpty (EnumMap k a) -> EnumMap k a # stimes :: Integral b => b -> EnumMap k a -> EnumMap k a #
Read a => Read (EnumMap k a) # |
Instance details Defined in Data.IntMap.EnumMap2 Methods readsPrec :: Int -> ReadS (EnumMap k a) # readList :: ReadS [EnumMap k a] # readPrec :: ReadPrec (EnumMap k a) # readListPrec :: ReadPrec [EnumMap k a] #
Show a => Show (EnumMap k a) # |
Instance details Defined in Data.IntMap.EnumMap2 Methods showsPrec :: Int -> EnumMap k a -> ShowS # show :: EnumMap k a -> String # showList :: [EnumMap k a] -> ShowS #
Eq a => Eq (EnumMap k a) # |
Instance details Defined in Data.IntMap.EnumMap2 Methods (==) :: EnumMap k a -> EnumMap k a -> Bool # (/=) :: EnumMap k a -> EnumMap k a -> Bool #
Ord a => Ord (EnumMap k a) # |
Instance details Defined in Data.IntMap.EnumMap2 Methods compare :: EnumMap k a -> EnumMap k a -> Ordering # (<) :: EnumMap k a -> EnumMap k a -> Bool # (<=) :: EnumMap k a -> EnumMap k a -> Bool # (>) :: EnumMap k a -> EnumMap k a -> Bool # (>=) :: EnumMap k a -> EnumMap k a -> Bool # max :: EnumMap k a -> EnumMap k a -> EnumMap k a # min :: EnumMap k a -> EnumMap k a -> EnumMap k a #

(!) :: Enum key => EnumMap key a -> key -> a #

(\\) :: Enum key => EnumMap key a -> EnumMap key b -> EnumMap key a #

null :: Enum key => EnumMap key a -> Bool #

size :: Enum key => EnumMap key a -> Int #

member :: Enum key => key -> EnumMap key a -> Bool #

notMember :: Enum key => key -> EnumMap key a -> Bool #

lookup :: Enum key => key -> EnumMap key a -> Maybe a #

findWithDefault :: Enum key => a -> key -> EnumMap key a -> a #

empty :: Enum key => EnumMap key a #

singleton :: Enum key => key -> a -> EnumMap key a #

insert :: Enum key => key -> a -> EnumMap key a -> EnumMap key a #

insertWith :: Enum key => (a -> a -> a) -> key -> a -> EnumMap key a -> EnumMap key a #

insertWithKey :: Enum key => (key -> a -> a -> a) -> key -> a -> EnumMap key a -> EnumMap key a #

insertLookupWithKey :: Enum key => (key -> a -> a -> a) -> key -> a -> EnumMap key a -> (Maybe a, EnumMap key a) #

delete :: Enum key => key -> EnumMap key a -> EnumMap key a #

adjust :: Enum key => (a -> a) -> key -> EnumMap key a -> EnumMap key a #

adjustWithKey :: Enum key => (key -> a -> a) -> key -> EnumMap key a -> EnumMap key a #

update :: Enum key => (a -> Maybe a) -> key -> EnumMap key a -> EnumMap key a #

updateWithKey :: Enum key => (key -> a -> Maybe a) -> key -> EnumMap key a -> EnumMap key a #

updateLookupWithKey :: Enum key => (key -> a -> Maybe a) -> key -> EnumMap key a -> (Maybe a, EnumMap key a) #

union :: Enum key => EnumMap key a -> EnumMap key a -> EnumMap key a #

unionWith :: Enum key => (a -> a -> a) -> EnumMap key a -> EnumMap key a -> EnumMap key a #

unionWithKey :: Enum key => (key -> a -> a -> a) -> EnumMap key a -> EnumMap key a -> EnumMap key a #

unions :: Enum key => [EnumMap key a] -> EnumMap key a #

unionsWith :: Enum key => (a -> a -> a) -> [EnumMap key a] -> EnumMap key a #

difference :: Enum key => EnumMap key a -> EnumMap key b -> EnumMap key a #

differenceWith :: Enum key => (a -> b -> Maybe a) -> EnumMap key a -> EnumMap key b -> EnumMap key a #

differenceWithKey :: Enum key => (key -> a -> b -> Maybe a) -> EnumMap key a -> EnumMap key b -> EnumMap key a #

intersection :: Enum key => EnumMap key a -> EnumMap key b -> EnumMap key a #

intersectionWith :: Enum key => (a -> b -> a) -> EnumMap key a -> EnumMap key b -> EnumMap key a #

intersectionWithKey :: Enum key => (key -> a -> b -> a) -> EnumMap key a -> EnumMap key b -> EnumMap key a #

map :: Enum key => (a -> b) -> EnumMap key a -> EnumMap key b #

mapWithKey :: Enum key => (key -> a -> b) -> EnumMap key a -> EnumMap key b #

mapAccum :: Enum key => (a -> b -> (a, c)) -> a -> EnumMap key b -> (a, EnumMap key c) #

mapAccumWithKey :: Enum key => (a -> key -> b -> (a, c)) -> a -> EnumMap key b -> (a, EnumMap key c) #

fold :: Enum key => (a -> b -> b) -> b -> EnumMap key a -> b #

foldWithKey :: Enum key => (key -> a -> b -> b) -> b -> EnumMap key a -> b #

elems :: Enum key => EnumMap key a -> [a] #

keys :: Enum key => EnumMap key a -> [key] #

keysSet :: Enum key => EnumMap key a -> EnumSet key #

assocs :: Enum key => EnumMap key a -> [(key, a)] #

toList :: Enum key => EnumMap key a -> [(key, a)] #

fromList :: Enum key => [(key, a)] -> EnumMap key a #

fromListWith :: Enum key => (a -> a -> a) -> [(key, a)] -> EnumMap key a #

fromListWithKey :: Enum key => (key -> a -> a -> a) -> [(key, a)] -> EnumMap key a #

toAscList :: Enum key => EnumMap key a -> [(key, a)] #

fromAscList :: Enum key => [(key, a)] -> EnumMap key a #

fromAscListWith :: Enum key => (a -> a -> a) -> [(key, a)] -> EnumMap key a #

fromAscListWithKey :: Enum key => (key -> a -> a -> a) -> [(key, a)] -> EnumMap key a #

fromDistinctAscList :: Enum key => [(key, a)] -> EnumMap key a #

filter :: Enum key => (a -> Bool) -> EnumMap key a -> EnumMap key a #

filterWithKey :: Enum key => (key -> a -> Bool) -> EnumMap key a -> EnumMap key a #

partition :: Enum key => (a -> Bool) -> EnumMap key a -> (EnumMap key a, EnumMap key a) #

partitionWithKey :: Enum key => (key -> a -> Bool) -> EnumMap key a -> (EnumMap key a, EnumMap key a) #

mapMaybe :: Enum key => (a -> Maybe b) -> EnumMap key a -> EnumMap key b #

mapMaybeWithKey :: Enum key => (key -> a -> Maybe b) -> EnumMap key a -> EnumMap key b #

mapEither :: Enum key => (a -> Either b c) -> EnumMap key a -> (EnumMap key b, EnumMap key c) #

mapEitherWithKey :: Enum key => (key -> a -> Either b c) -> EnumMap key a -> (EnumMap key b, EnumMap key c) #

split :: Enum key => key -> EnumMap key a -> (EnumMap key a, EnumMap key a) #

splitLookup :: Enum key => key -> EnumMap key a -> (EnumMap key a, Maybe a, EnumMap key a) #

isSubmapOf :: (Enum key, Eq a) => EnumMap key a -> EnumMap key a -> Bool #

isSubmapOfBy :: Enum key => (a -> b -> Bool) -> EnumMap key a -> EnumMap key b -> Bool #

isProperSubmapOf :: (Enum key, Eq a) => EnumMap key a -> EnumMap key a -> Bool #

isProperSubmapOfBy :: Enum key => (a -> b -> Bool) -> EnumMap key a -> EnumMap key b -> Bool #

showTree :: (Enum key, Show a) => EnumMap key a -> String #

showTreeWith :: (Enum key, Show a) => Bool -> Bool -> EnumMap key a -> String #