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

Safe Haskell | Safe-Inferred
Language | Haskell2010

Data.IntMap.EnumMap2

# Documentation

newtype EnumMap k a Source #

Constructors

EnumMap |

Fields

- unEnumMap :: IntMap a

#### Instances

Instances details

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

Instance details

Defined in Data.IntMap.EnumMap2

Methods

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

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

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

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

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

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

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

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

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

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

null :: EnumMap k a -> Bool Source #

length :: EnumMap k a -> Int Source #

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

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

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

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

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

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

Instance details

Defined in Data.IntMap.EnumMap2

Methods

compare :: EnumMap k a -> EnumMap k a -> Ordering Source #

(<) :: EnumMap k a -> EnumMap k a -> Bool Source #

(<=) :: EnumMap k a -> EnumMap k a -> Bool Source #

(>) :: EnumMap k a -> EnumMap k a -> Bool Source #

(>=) :: EnumMap k a -> EnumMap k a -> Bool Source #

max :: EnumMap k a -> EnumMap k a -> EnumMap k a Source #

min :: EnumMap k a -> EnumMap k a -> EnumMap k a Source #

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

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

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

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

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

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

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

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

empty :: Enum key => EnumMap key a Source #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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