Data.EnumMap.Lazy

Documentation: http://hackage.haskell.org/packages/archive/containers/latest/doc/html/Data-IntMap-Lazy.html

Documentation

newtype EnumMap k v

Constructors

EnumMap

Fields

unEnumMap :: IntMap v

Instances

Typeable2 EnumMap

Functor (EnumMap k)

Foldable (EnumMap k)

Traversable (EnumMap k)

Eq v => Eq (EnumMap k v)

(Data k, Data v) => Data (EnumMap k v)

Ord v => Ord (EnumMap k v)

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

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

Monoid (EnumMap k v)

NFData v => NFData (EnumMap k v)

Operators

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

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

Query

null :: forall k a. EnumMap k a -> Bool

size :: forall k a. EnumMap k a -> Int

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

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

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

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

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

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

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

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

Construction

empty :: forall k a. EnumMap k a

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

Insertion

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

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

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

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

Delete/Update

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

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

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

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

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

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

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

Combine: Union

union :: forall k a. EnumMap k a -> EnumMap k a -> EnumMap k a

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

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

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

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

Combine: Difference

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

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

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

Combine: Intersection

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

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

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

Combine: Universal combining function

mergeWithKey :: forall k a b c. 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 :: forall k a b. (a -> b) -> EnumMap k a -> EnumMap k b

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

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

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

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

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

mapKeys :: forall k k' a. (Enum k, Enum k') => (k -> k') -> EnumMap k a -> EnumMap k' a

mapKeysWith :: forall k k' a. (Enum k, Enum k') => (a -> a -> a) -> (k -> k') -> EnumMap k a -> EnumMap k' a

mapKeysMonotonic :: forall k k' a. (Enum k, Enum k') => (k -> k') -> EnumMap k a -> EnumMap k' a

Traversal: Folds

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

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

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

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

Traversal: Strict folds

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

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

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

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

Conversion

elems :: forall k a. EnumMap k a -> [a]

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

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

keysSet :: forall k a. EnumMap k a -> EnumSet k

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

Conversion: Lists

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

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

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

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

Conversion: Ordered lists

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

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

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

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

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

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

Filter

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

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

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

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

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

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

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

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

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

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

Submap

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

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

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

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

Min/Max

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

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

deleteMin :: forall k a. EnumMap k a -> EnumMap k a

deleteMax :: forall k a. EnumMap k a -> EnumMap k a

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

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

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

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

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

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

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

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

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

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

Debugging

showTree :: forall k a. Show a => EnumMap k a -> String

showTreeWith :: forall k a. Show a => Bool -> Bool -> EnumMap k a -> String