Data.IntMap.CharMap2

regex-tdfa-1.2.1: Replaces/Enhances Text.Regex

Safe Haskell | None
Language | Haskell98

Data.IntMap.CharMap2

# Documentation

newtype CharMap a

Constructors

CharMap |
Fields unCharMap :: IntMap a

Instances

Functor CharMap |
Eq a => Eq (CharMap a) |
Ord a => Ord (CharMap a) |
Read a => Read (CharMap a) |
Show a => Show (CharMap a) |
Monoid (CharMap a) |

type Key = Char

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

(\\) :: CharMap a -> CharMap b -> CharMap a

null :: CharMap a -> Bool

size :: CharMap a -> Int

member :: Key -> CharMap a -> Bool

notMember :: Key -> CharMap a -> Bool

lookup :: Key -> CharMap a -> Maybe a

findWithDefault :: a -> Key -> CharMap a -> a

empty :: CharMap a

singleton :: Key -> a -> CharMap a

insert :: Key -> a -> CharMap a -> CharMap a

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

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

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

delete :: Key -> CharMap a -> CharMap a

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

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

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

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

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

union :: CharMap a -> CharMap a -> CharMap a

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

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

unions :: [CharMap a] -> CharMap a

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

difference :: CharMap a -> CharMap b -> CharMap a

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

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

intersection :: CharMap a -> CharMap b -> CharMap a

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

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

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

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

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

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

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

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

elems :: CharMap a -> [a]

keys :: CharMap a -> [Key]

keysSet :: CharMap a -> IntSet

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

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

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

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

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

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

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

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

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

fromDistinctAscList :: [(Key, a)] -> CharMap a

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

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

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

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

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

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

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

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

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

splitLookup :: Key -> CharMap a -> (CharMap a, Maybe a, CharMap a)

isSubmapOf :: Eq a => CharMap a -> CharMap a -> Bool

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

isProperSubmapOf :: Eq a => CharMap a -> CharMap a -> Bool

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

showTree :: Show a => CharMap a -> String

showTreeWith :: Show a => Bool -> Bool -> CharMap a -> String