Data.EnumMap.Strict

Documentation

data EnumMap k a

Wrapper for IntMap with Enum keys.

Instances

Functor (EnumMap k)

Foldable (EnumMap k)

Traversable (EnumMap k)

Eq a => Eq (EnumMap k a)

Ord a => Ord (EnumMap k a)

(Enum k, Read k, Read a) => Read (EnumMap k a)

(Enum k, Show k, Show a) => Show (EnumMap k a)

Monoid (EnumMap k a)

NFData a => NFData (EnumMap k a)

Typeable (* -> * -> *) EnumMap

Wrapping/unwrapping

intMapToEnumMap :: IntMap a -> EnumMap k a

Wrap IntMap.

enumMapToIntMap :: EnumMap k a -> IntMap a

Unwrap IntMap.

Operators

(!) :: Enum k => EnumMap k a -> k -> a

(\\) :: EnumMap k a -> EnumMap k b -> EnumMap k a

Query

null :: EnumMap k a -> Bool

size :: EnumMap k a -> Int

member :: Enum k => k -> EnumMap k a -> Bool

notMember :: Enum k => k -> EnumMap k a -> Bool

lookup :: Enum k => k -> EnumMap k a -> Maybe a

findWithDefault :: Enum k => a -> k -> EnumMap k a -> a

lookupLT :: Enum k => k -> EnumMap k a -> Maybe (k, a)

lookupGT :: Enum k => k -> EnumMap k a -> Maybe (k, a)

lookupLE :: Enum k => k -> EnumMap k a -> Maybe (k, a)

lookupGE :: Enum k => k -> EnumMap k a -> Maybe (k, a)

Construction

empty :: EnumMap k a

singleton :: Enum k => k -> a -> EnumMap k a

Insertion

insert :: Enum k => k -> a -> EnumMap k a -> EnumMap k a

insertWith :: Enum k => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a

insertWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a

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

Delete/Update

delete :: Enum k => k -> EnumMap k a -> EnumMap k a

adjust :: Enum k => (a -> a) -> k -> EnumMap k a -> EnumMap k a

adjustWithKey :: Enum k => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a

update :: Enum k => (a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a

updateWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a

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

alter :: Enum k => (Maybe a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a

Combine

Union

union :: EnumMap k a -> EnumMap k a -> EnumMap k a

unionWith :: (a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a

unionWithKey :: Enum k => (k -> a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a

unions :: [EnumMap k a] -> EnumMap k a

unionsWith :: (a -> a -> a) -> [EnumMap k a] -> EnumMap k a

Difference

difference :: EnumMap k a -> EnumMap k b -> EnumMap k a

differenceWith :: (a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a

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

Intersection

intersection :: EnumMap k a -> EnumMap k b -> EnumMap k a

intersectionWith :: (a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c

intersectionWithKey :: Enum k => (k -> a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c

Universal combining function

mergeWithKey :: Enum k => (k -> a -> b -> Maybe c) -> (EnumMap k a -> EnumMap k c) -> (EnumMap k b -> EnumMap k c) -> EnumMap k a -> EnumMap k b -> EnumMap k c

Traversal

Map

map :: (a -> b) -> EnumMap k a -> EnumMap k b

mapWithKey :: Enum k => (k -> a -> b) -> EnumMap k a -> EnumMap k b

traverseWithKey :: (Applicative t, Enum k) => (k -> a -> t b) -> EnumMap k a -> t (EnumMap k b)

mapAccum :: (a -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)

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

mapAccumRWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)

mapKeys :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a

mapKeysWith :: Enum k => (a -> a -> a) -> (k -> k) -> EnumMap k a -> EnumMap k a

mapKeysMonotonic :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a

Folds

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

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

foldrWithKey :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b

foldlWithKey :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a

Strict folds

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

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

foldrWithKey' :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b

foldlWithKey' :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a

Conversion

elems :: EnumMap k a -> [a]

keys :: Enum k => EnumMap k a -> [k]

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

keysSet :: Enum k => EnumMap k a -> EnumSet k

fromSet :: Enum k => (k -> a) -> EnumSet k -> EnumMap k a

Lists

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

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

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

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

Ordered lists

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

toDescList :: Enum k => EnumMap k a -> [(k, a)]

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

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

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

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

Filter

filter :: (a -> Bool) -> EnumMap k a -> EnumMap k a

filterWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> EnumMap k a

partition :: (a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)

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

mapMaybe :: (a -> Maybe b) -> EnumMap k a -> EnumMap k b

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

mapEither :: (a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)

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

split :: Enum k => k -> EnumMap k a -> (EnumMap k a, EnumMap k a)

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

Submap

isSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool

isSubmapOfBy :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool

isProperSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool

isProperSubmapOfBy :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool

Min/Max

findMin :: Enum k => EnumMap k a -> (k, a)

findMax :: Enum k => EnumMap k a -> (k, a)

deleteMin :: EnumMap k a -> EnumMap k a

deleteMax :: EnumMap k a -> EnumMap k a

deleteFindMin :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)

deleteFindMax :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)

updateMin :: (a -> Maybe a) -> EnumMap k a -> EnumMap k a

updateMax :: (a -> Maybe a) -> EnumMap k a -> EnumMap k a

updateMinWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a

updateMaxWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a

minView :: EnumMap k a -> Maybe (a, EnumMap k a)

maxView :: EnumMap k a -> Maybe (a, EnumMap k a)

minViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)

maxViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)