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

Data.IntMap.CharMap2

Documentation

newtype CharMap a Source #

Constructors

CharMap 

Fields

Instances

Instances details
Functor CharMap Source # 
Instance details

Defined in Data.IntMap.CharMap2

Methods

fmap :: (a -> b) -> CharMap a -> CharMap b #

(<$) :: a -> CharMap b -> CharMap a #

Monoid (CharMap a) Source # 
Instance details

Defined in Data.IntMap.CharMap2

Methods

mempty :: CharMap a #

mappend :: CharMap a -> CharMap a -> CharMap a #

mconcat :: [CharMap a] -> CharMap a #

Semigroup (CharMap a) Source # 
Instance details

Defined in Data.IntMap.CharMap2

Methods

(<>) :: CharMap a -> CharMap a -> CharMap a #

sconcat :: NonEmpty (CharMap a) -> CharMap a #

stimes :: Integral b => b -> CharMap a -> CharMap a #

Read a => Read (CharMap a) Source # 
Instance details

Defined in Data.IntMap.CharMap2

Show a => Show (CharMap a) Source # 
Instance details

Defined in Data.IntMap.CharMap2

Methods

showsPrec :: Int -> CharMap a -> ShowS #

show :: CharMap a -> String #

showList :: [CharMap a] -> ShowS #

Eq a => Eq (CharMap a) Source # 
Instance details

Defined in Data.IntMap.CharMap2

Methods

(==) :: CharMap a -> CharMap a -> Bool #

(/=) :: CharMap a -> CharMap a -> Bool #

Ord a => Ord (CharMap a) Source # 
Instance details

Defined in Data.IntMap.CharMap2

Methods

compare :: CharMap a -> CharMap a -> Ordering #

(<) :: CharMap a -> CharMap a -> Bool #

(<=) :: CharMap a -> CharMap a -> Bool #

(>) :: CharMap a -> CharMap a -> Bool #

(>=) :: CharMap a -> CharMap a -> Bool #

max :: CharMap a -> CharMap a -> CharMap a #

min :: CharMap a -> CharMap a -> CharMap a #

type Key = Char Source #

(!) :: CharMap a -> Key -> a Source #

findWithDefault :: a -> Key -> CharMap a -> a Source #

insert :: Key -> a -> CharMap a -> CharMap a Source #

insertWith :: (a -> a -> a) -> Key -> a -> CharMap a -> CharMap a Source #

insertWithKey :: (Key -> a -> a -> a) -> Key -> a -> CharMap a -> CharMap a Source #

insertLookupWithKey :: (Key -> a -> a -> a) -> Key -> a -> CharMap a -> (Maybe a, CharMap a) Source #

adjust :: (a -> a) -> Key -> CharMap a -> CharMap a Source #

adjustWithKey :: (Key -> a -> a) -> Key -> CharMap a -> CharMap a Source #

update :: (a -> Maybe a) -> Key -> CharMap a -> CharMap a Source #

updateWithKey :: (Key -> a -> Maybe a) -> Key -> CharMap a -> CharMap a Source #

updateLookupWithKey :: (Key -> a -> Maybe a) -> Key -> CharMap a -> (Maybe a, CharMap a) Source #

unionWith :: (a -> a -> a) -> CharMap a -> CharMap a -> CharMap a Source #

unionWithKey :: (Key -> a -> a -> a) -> CharMap a -> CharMap a -> CharMap a Source #

unionsWith :: (a -> a -> a) -> [CharMap a] -> CharMap a Source #

differenceWith :: (a -> b -> Maybe a) -> CharMap a -> CharMap b -> CharMap a Source #

differenceWithKey :: (Key -> a -> b -> Maybe a) -> CharMap a -> CharMap b -> CharMap a Source #

intersectionWith :: (a -> b -> a) -> CharMap a -> CharMap b -> CharMap a Source #

intersectionWithKey :: (Key -> a -> b -> a) -> CharMap a -> CharMap b -> CharMap a Source #

map :: (a -> b) -> CharMap a -> CharMap b Source #

mapWithKey :: (Key -> a -> b) -> CharMap a -> CharMap b Source #

mapAccum :: (a -> b -> (a, c)) -> a -> CharMap b -> (a, CharMap c) Source #

mapAccumWithKey :: (a -> Key -> b -> (a, c)) -> a -> CharMap b -> (a, CharMap c) Source #

fold :: (a -> b -> b) -> b -> CharMap a -> b Source #

foldWithKey :: (Key -> a -> b -> b) -> b -> CharMap a -> b Source #

elems :: CharMap a -> [a] Source #

keys :: CharMap a -> [Key] Source #

assocs :: CharMap a -> [(Key, a)] Source #

toList :: CharMap a -> [(Key, a)] Source #

fromList :: [(Key, a)] -> CharMap a Source #

fromListWith :: (a -> a -> a) -> [(Key, a)] -> CharMap a Source #

fromListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> CharMap a Source #

toAscList :: CharMap a -> [(Key, a)] Source #

fromAscList :: [(Key, a)] -> CharMap a Source #

fromAscListWith :: (a -> a -> a) -> [(Key, a)] -> CharMap a Source #

fromAscListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> CharMap a Source #

filter :: (a -> Bool) -> CharMap a -> CharMap a Source #

filterWithKey :: (Key -> a -> Bool) -> CharMap a -> CharMap a Source #

partition :: (a -> Bool) -> CharMap a -> (CharMap a, CharMap a) Source #

partitionWithKey :: (Key -> a -> Bool) -> CharMap a -> (CharMap a, CharMap a) Source #

mapMaybe :: (a -> Maybe b) -> CharMap a -> CharMap b Source #

mapMaybeWithKey :: (Key -> a -> Maybe b) -> CharMap a -> CharMap b Source #

mapEither :: (a -> Either b c) -> CharMap a -> (CharMap b, CharMap c) Source #

mapEitherWithKey :: (Key -> a -> Either b c) -> CharMap a -> (CharMap b, CharMap c) Source #

split :: Key -> CharMap a -> (CharMap a, CharMap a) Source #

isSubmapOfBy :: (a -> b -> Bool) -> CharMap a -> CharMap b -> Bool Source #

isProperSubmapOfBy :: (a -> b -> Bool) -> CharMap a -> CharMap b -> Bool Source #