Data.ListTrie.Base.Map

Documentation

class Foldable (m k) => Map m k where

Minimal complete implementation:

• eqCmp
• null
• lookup
• alter
• unionWithKey, differenceWithKey, intersectionWithKey
• toListKV
• empty or fromList or fromListWith
• isSubmapOfBy

For decent performance, supplying at least mapAccumWithKey and filter as well is probably a good idea.

Minimal complete definition

eqCmp, null, lookup, alter, unionWithKey, differenceWithKey, intersectionWithKey, toListKV, isSubmapOfBy

Methods

eqCmp :: m k a -> k -> k -> Bool

Like an Eq instance over k, but should compare on the same type as m does. In most cases this can be defined just as const (==).

empty :: m k a

singleton :: k -> a -> m k a

doubleton :: k -> a -> k -> a -> m k a

Precondition: the two keys differ

null :: m k a -> Bool

lookup :: k -> m k a -> Maybe a

insertWith :: (a -> a -> a) -> k -> a -> m k a -> m k a

Strictness can be whatever is more optimal for the map type, shouldn't matter

insert :: k -> a -> m k a -> m k a

update :: (a -> Maybe a) -> k -> m k a -> m k a

adjust :: (a -> a) -> k -> m k a -> m k a

delete :: k -> m k a -> m k a

alter :: (Maybe a -> Maybe a) -> k -> m k a -> m k a

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

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

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

unionWithKey :: (k -> a -> a -> a) -> m k a -> m k a -> m k a

differenceWithKey :: (k -> a -> b -> Maybe a) -> m k a -> m k b -> m k a

intersectionWithKey :: (k -> a -> b -> c) -> m k a -> m k b -> m k c

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

mapWithKey :: (k -> a -> b) -> m k a -> m k b

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

mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> m k b -> (a, m k c)

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

toListKV :: m k a -> [(k, a)]

fromListKV :: [(k, a)] -> m k a

fromListKVWith :: (a -> a -> a) -> [(k, a)] -> m k a

serializeToList :: m k a -> [(k, a)]

deserializeFromList :: [(k, a)] -> m k a

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

singletonView :: m k a -> Maybe (k, a)

Instances

Ord k => Map Map k

Methods

eqCmp :: Map k a -> k -> k -> Bool

empty :: Map k a

singleton :: k -> a -> Map k a

doubleton :: k -> a -> k -> a -> Map k a

null :: Map k a -> Bool

lookup :: k -> Map k a -> Maybe a

insertWith :: (a -> a -> a) -> k -> a -> Map k a -> Map k a

insert :: k -> a -> Map k a -> Map k a

update :: (a -> Maybe a) -> k -> Map k a -> Map k a

adjust :: (a -> a) -> k -> Map k a -> Map k a

delete :: k -> Map k a -> Map k a

alter :: (Maybe a -> Maybe a) -> k -> Map k a -> Map k a

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

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

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

unionWithKey :: (k -> a -> a -> a) -> Map k a -> Map k a -> Map k a

differenceWithKey :: (k -> a -> b -> Maybe a) -> Map k a -> Map k b -> Map k a

intersectionWithKey :: (k -> a -> b -> c) -> Map k a -> Map k b -> Map k c

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

mapWithKey :: (k -> a -> b) -> Map k a -> Map k b

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

mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)

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

toListKV :: Map k a -> [(k, a)]

fromListKV :: [(k, a)] -> Map k a

fromListKVWith :: (a -> a -> a) -> [(k, a)] -> Map k a

serializeToList :: Map k a -> [(k, a)]

deserializeFromList :: [(k, a)] -> Map k a

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

singletonView :: Map k a -> Maybe (k, a)

Enum k => Map WrappedIntMap k

Methods

eqCmp :: WrappedIntMap k a -> k -> k -> Bool

empty :: WrappedIntMap k a

singleton :: k -> a -> WrappedIntMap k a

doubleton :: k -> a -> k -> a -> WrappedIntMap k a

null :: WrappedIntMap k a -> Bool

lookup :: k -> WrappedIntMap k a -> Maybe a

insertWith :: (a -> a -> a) -> k -> a -> WrappedIntMap k a -> WrappedIntMap k a

insert :: k -> a -> WrappedIntMap k a -> WrappedIntMap k a

update :: (a -> Maybe a) -> k -> WrappedIntMap k a -> WrappedIntMap k a

adjust :: (a -> a) -> k -> WrappedIntMap k a -> WrappedIntMap k a

delete :: k -> WrappedIntMap k a -> WrappedIntMap k a

alter :: (Maybe a -> Maybe a) -> k -> WrappedIntMap k a -> WrappedIntMap k a

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

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

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

unionWithKey :: (k -> a -> a -> a) -> WrappedIntMap k a -> WrappedIntMap k a -> WrappedIntMap k a

differenceWithKey :: (k -> a -> b -> Maybe a) -> WrappedIntMap k a -> WrappedIntMap k b -> WrappedIntMap k a

intersectionWithKey :: (k -> a -> b -> c) -> WrappedIntMap k a -> WrappedIntMap k b -> WrappedIntMap k c

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

mapWithKey :: (k -> a -> b) -> WrappedIntMap k a -> WrappedIntMap k b

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

mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

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

toListKV :: WrappedIntMap k a -> [(k, a)]

fromListKV :: [(k, a)] -> WrappedIntMap k a

fromListKVWith :: (a -> a -> a) -> [(k, a)] -> WrappedIntMap k a

serializeToList :: WrappedIntMap k a -> [(k, a)]

deserializeFromList :: [(k, a)] -> WrappedIntMap k a

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

singletonView :: WrappedIntMap k a -> Maybe (k, a)

Eq k => Map AList k

Methods

eqCmp :: AList k a -> k -> k -> Bool

empty :: AList k a

singleton :: k -> a -> AList k a

doubleton :: k -> a -> k -> a -> AList k a

null :: AList k a -> Bool

lookup :: k -> AList k a -> Maybe a

insertWith :: (a -> a -> a) -> k -> a -> AList k a -> AList k a

insert :: k -> a -> AList k a -> AList k a

update :: (a -> Maybe a) -> k -> AList k a -> AList k a

adjust :: (a -> a) -> k -> AList k a -> AList k a

delete :: k -> AList k a -> AList k a

alter :: (Maybe a -> Maybe a) -> k -> AList k a -> AList k a

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

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

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

unionWithKey :: (k -> a -> a -> a) -> AList k a -> AList k a -> AList k a

differenceWithKey :: (k -> a -> b -> Maybe a) -> AList k a -> AList k b -> AList k a

intersectionWithKey :: (k -> a -> b -> c) -> AList k a -> AList k b -> AList k c

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

mapWithKey :: (k -> a -> b) -> AList k a -> AList k b

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

mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

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

toListKV :: AList k a -> [(k, a)]

fromListKV :: [(k, a)] -> AList k a

fromListKVWith :: (a -> a -> a) -> [(k, a)] -> AList k a

serializeToList :: AList k a -> [(k, a)]

deserializeFromList :: [(k, a)] -> AList k a

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

singletonView :: AList k a -> Maybe (k, a)

class Map m k => OrdMap m k where

Minimal complete definition:

• ordCmp
• toAscList or toDescList
• splitLookup

For decent performance, supplying at least the following is probably a good idea:

• minViewWithKey, maxViewWithKey
• mapAccumAscWithKey, mapAccumDescWithKey

Minimal complete definition

ordCmp, splitLookup

Methods

ordCmp :: m k a -> k -> k -> Ordering

Like an Ord instance over k, but should compare on the same type as m does. In most cases this can be defined just as const compare.

toAscList :: m k a -> [(k, a)]

toDescList :: m k a -> [(k, a)]

splitLookup :: k -> m k a -> (m k a, Maybe a, m k a)

split :: k -> m k a -> (m k a, m k a)

minViewWithKey :: m k a -> (Maybe (k, a), m k a)

maxViewWithKey :: m k a -> (Maybe (k, a), m k a)

findPredecessor :: k -> m k a -> Maybe (k, a)

findSuccessor :: k -> m k a -> Maybe (k, a)

mapAccumAsc :: (a -> b -> (a, c)) -> a -> m k b -> (a, m k c)

mapAccumAscWithKey :: (a -> k -> b -> (a, c)) -> a -> m k b -> (a, m k c)

mapAccumDesc :: (a -> b -> (a, c)) -> a -> m k b -> (a, m k c)

mapAccumDescWithKey :: (a -> k -> b -> (a, c)) -> a -> m k b -> (a, m k c)

Instances

Ord k => OrdMap Map k

Methods

ordCmp :: Map k a -> k -> k -> Ordering

toAscList :: Map k a -> [(k, a)]

toDescList :: Map k a -> [(k, a)]

splitLookup :: k -> Map k a -> (Map k a, Maybe a, Map k a)

split :: k -> Map k a -> (Map k a, Map k a)

minViewWithKey :: Map k a -> (Maybe (k, a), Map k a)

maxViewWithKey :: Map k a -> (Maybe (k, a), Map k a)

findPredecessor :: k -> Map k a -> Maybe (k, a)

findSuccessor :: k -> Map k a -> Maybe (k, a)

mapAccumAsc :: (a -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)

mapAccumAscWithKey :: (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)

mapAccumDesc :: (a -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)

mapAccumDescWithKey :: (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)

Enum k => OrdMap WrappedIntMap k

Methods

ordCmp :: WrappedIntMap k a -> k -> k -> Ordering

toAscList :: WrappedIntMap k a -> [(k, a)]

toDescList :: WrappedIntMap k a -> [(k, a)]

splitLookup :: k -> WrappedIntMap k a -> (WrappedIntMap k a, Maybe a, WrappedIntMap k a)

split :: k -> WrappedIntMap k a -> (WrappedIntMap k a, WrappedIntMap k a)

minViewWithKey :: WrappedIntMap k a -> (Maybe (k, a), WrappedIntMap k a)

maxViewWithKey :: WrappedIntMap k a -> (Maybe (k, a), WrappedIntMap k a)

findPredecessor :: k -> WrappedIntMap k a -> Maybe (k, a)

findSuccessor :: k -> WrappedIntMap k a -> Maybe (k, a)

mapAccumAsc :: (a -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

mapAccumAscWithKey :: (a -> k -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

mapAccumDesc :: (a -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

mapAccumDescWithKey :: (a -> k -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

Ord k => OrdMap AList k

Methods

ordCmp :: AList k a -> k -> k -> Ordering

toAscList :: AList k a -> [(k, a)]

toDescList :: AList k a -> [(k, a)]

splitLookup :: k -> AList k a -> (AList k a, Maybe a, AList k a)

split :: k -> AList k a -> (AList k a, AList k a)

minViewWithKey :: AList k a -> (Maybe (k, a), AList k a)

maxViewWithKey :: AList k a -> (Maybe (k, a), AList k a)

findPredecessor :: k -> AList k a -> Maybe (k, a)

findSuccessor :: k -> AList k a -> Maybe (k, a)

mapAccumAsc :: (a -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

mapAccumAscWithKey :: (a -> k -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

mapAccumDesc :: (a -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

mapAccumDescWithKey :: (a -> k -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

data AList k v

Instances

Ord k => OrdMap AList k

Methods

ordCmp :: AList k a -> k -> k -> Ordering

toAscList :: AList k a -> [(k, a)]

toDescList :: AList k a -> [(k, a)]

splitLookup :: k -> AList k a -> (AList k a, Maybe a, AList k a)

split :: k -> AList k a -> (AList k a, AList k a)

minViewWithKey :: AList k a -> (Maybe (k, a), AList k a)

maxViewWithKey :: AList k a -> (Maybe (k, a), AList k a)

findPredecessor :: k -> AList k a -> Maybe (k, a)

findSuccessor :: k -> AList k a -> Maybe (k, a)

mapAccumAsc :: (a -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

mapAccumAscWithKey :: (a -> k -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

mapAccumDesc :: (a -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

mapAccumDescWithKey :: (a -> k -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

Eq k => Map AList k

Methods

eqCmp :: AList k a -> k -> k -> Bool

empty :: AList k a

singleton :: k -> a -> AList k a

doubleton :: k -> a -> k -> a -> AList k a

null :: AList k a -> Bool

lookup :: k -> AList k a -> Maybe a

insertWith :: (a -> a -> a) -> k -> a -> AList k a -> AList k a

insert :: k -> a -> AList k a -> AList k a

update :: (a -> Maybe a) -> k -> AList k a -> AList k a

adjust :: (a -> a) -> k -> AList k a -> AList k a

delete :: k -> AList k a -> AList k a

alter :: (Maybe a -> Maybe a) -> k -> AList k a -> AList k a

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

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

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

unionWithKey :: (k -> a -> a -> a) -> AList k a -> AList k a -> AList k a

differenceWithKey :: (k -> a -> b -> Maybe a) -> AList k a -> AList k b -> AList k a

intersectionWithKey :: (k -> a -> b -> c) -> AList k a -> AList k b -> AList k c

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

mapWithKey :: (k -> a -> b) -> AList k a -> AList k b

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

mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> AList k b -> (a, AList k c)

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

toListKV :: AList k a -> [(k, a)]

fromListKV :: [(k, a)] -> AList k a

fromListKVWith :: (a -> a -> a) -> [(k, a)] -> AList k a

serializeToList :: AList k a -> [(k, a)]

deserializeFromList :: [(k, a)] -> AList k a

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

singletonView :: AList k a -> Maybe (k, a)

Functor (AList k)

Methods

fmap :: (a -> b) -> AList k a -> AList k b

(<$) :: a -> AList k b -> AList k a

Foldable (AList k)

Methods

fold :: Monoid m => AList k m -> m

foldMap :: Monoid m => (a -> m) -> AList k a -> m

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

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

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

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

foldr1 :: (a -> a -> a) -> AList k a -> a

foldl1 :: (a -> a -> a) -> AList k a -> a

toList :: AList k a -> [a]

null :: AList k a -> Bool

length :: AList k a -> Int

elem :: Eq a => a -> AList k a -> Bool

maximum :: Ord a => AList k a -> a

minimum :: Ord a => AList k a -> a

sum :: Num a => AList k a -> a

product :: Num a => AList k a -> a

Traversable (AList k)

Methods

traverse :: Applicative f => (a -> f b) -> AList k a -> f (AList k b)

sequenceA :: Applicative f => AList k (f a) -> f (AList k a)

mapM :: Monad m => (a -> m b) -> AList k a -> m (AList k b)

sequence :: Monad m => AList k (m a) -> m (AList k a)

(Eq k, Eq v) => Eq (AList k v)

Methods

(==) :: AList k v -> AList k v -> Bool

(/=) :: AList k v -> AList k v -> Bool

(Ord k, Ord v) => Ord (AList k v)

Methods

compare :: AList k v -> AList k v -> Ordering

(<) :: AList k v -> AList k v -> Bool

(<=) :: AList k v -> AList k v -> Bool

(>) :: AList k v -> AList k v -> Bool

(>=) :: AList k v -> AList k v -> Bool

max :: AList k v -> AList k v -> AList k v

min :: AList k v -> AList k v -> AList k v

data WrappedIntMap k v

Instances

Enum k => OrdMap WrappedIntMap k

Methods

ordCmp :: WrappedIntMap k a -> k -> k -> Ordering

toAscList :: WrappedIntMap k a -> [(k, a)]

toDescList :: WrappedIntMap k a -> [(k, a)]

splitLookup :: k -> WrappedIntMap k a -> (WrappedIntMap k a, Maybe a, WrappedIntMap k a)

split :: k -> WrappedIntMap k a -> (WrappedIntMap k a, WrappedIntMap k a)

minViewWithKey :: WrappedIntMap k a -> (Maybe (k, a), WrappedIntMap k a)

maxViewWithKey :: WrappedIntMap k a -> (Maybe (k, a), WrappedIntMap k a)

findPredecessor :: k -> WrappedIntMap k a -> Maybe (k, a)

findSuccessor :: k -> WrappedIntMap k a -> Maybe (k, a)

mapAccumAsc :: (a -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

mapAccumAscWithKey :: (a -> k -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

mapAccumDesc :: (a -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

mapAccumDescWithKey :: (a -> k -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

Enum k => Map WrappedIntMap k

Methods

eqCmp :: WrappedIntMap k a -> k -> k -> Bool

empty :: WrappedIntMap k a

singleton :: k -> a -> WrappedIntMap k a

doubleton :: k -> a -> k -> a -> WrappedIntMap k a

null :: WrappedIntMap k a -> Bool

lookup :: k -> WrappedIntMap k a -> Maybe a

insertWith :: (a -> a -> a) -> k -> a -> WrappedIntMap k a -> WrappedIntMap k a

insert :: k -> a -> WrappedIntMap k a -> WrappedIntMap k a

update :: (a -> Maybe a) -> k -> WrappedIntMap k a -> WrappedIntMap k a

adjust :: (a -> a) -> k -> WrappedIntMap k a -> WrappedIntMap k a

delete :: k -> WrappedIntMap k a -> WrappedIntMap k a

alter :: (Maybe a -> Maybe a) -> k -> WrappedIntMap k a -> WrappedIntMap k a

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

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

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

unionWithKey :: (k -> a -> a -> a) -> WrappedIntMap k a -> WrappedIntMap k a -> WrappedIntMap k a

differenceWithKey :: (k -> a -> b -> Maybe a) -> WrappedIntMap k a -> WrappedIntMap k b -> WrappedIntMap k a

intersectionWithKey :: (k -> a -> b -> c) -> WrappedIntMap k a -> WrappedIntMap k b -> WrappedIntMap k c

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

mapWithKey :: (k -> a -> b) -> WrappedIntMap k a -> WrappedIntMap k b

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

mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> WrappedIntMap k b -> (a, WrappedIntMap k c)

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

toListKV :: WrappedIntMap k a -> [(k, a)]

fromListKV :: [(k, a)] -> WrappedIntMap k a

fromListKVWith :: (a -> a -> a) -> [(k, a)] -> WrappedIntMap k a

serializeToList :: WrappedIntMap k a -> [(k, a)]

deserializeFromList :: [(k, a)] -> WrappedIntMap k a

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

singletonView :: WrappedIntMap k a -> Maybe (k, a)

Functor (WrappedIntMap k)

Methods

fmap :: (a -> b) -> WrappedIntMap k a -> WrappedIntMap k b

(<$) :: a -> WrappedIntMap k b -> WrappedIntMap k a

Foldable (WrappedIntMap k)

Methods

fold :: Monoid m => WrappedIntMap k m -> m

foldMap :: Monoid m => (a -> m) -> WrappedIntMap k a -> m

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

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

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

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

foldr1 :: (a -> a -> a) -> WrappedIntMap k a -> a

foldl1 :: (a -> a -> a) -> WrappedIntMap k a -> a

toList :: WrappedIntMap k a -> [a]

null :: WrappedIntMap k a -> Bool

length :: WrappedIntMap k a -> Int

elem :: Eq a => a -> WrappedIntMap k a -> Bool

maximum :: Ord a => WrappedIntMap k a -> a

minimum :: Ord a => WrappedIntMap k a -> a

sum :: Num a => WrappedIntMap k a -> a

product :: Num a => WrappedIntMap k a -> a

Traversable (WrappedIntMap k)

Methods

traverse :: Applicative f => (a -> f b) -> WrappedIntMap k a -> f (WrappedIntMap k b)

sequenceA :: Applicative f => WrappedIntMap k (f a) -> f (WrappedIntMap k a)

mapM :: Monad m => (a -> m b) -> WrappedIntMap k a -> m (WrappedIntMap k b)

sequence :: Monad m => WrappedIntMap k (m a) -> m (WrappedIntMap k a)

Eq v => Eq (WrappedIntMap k v)

Methods

(==) :: WrappedIntMap k v -> WrappedIntMap k v -> Bool

(/=) :: WrappedIntMap k v -> WrappedIntMap k v -> Bool

Ord v => Ord (WrappedIntMap k v)

Methods

compare :: WrappedIntMap k v -> WrappedIntMap k v -> Ordering

(<) :: WrappedIntMap k v -> WrappedIntMap k v -> Bool

(<=) :: WrappedIntMap k v -> WrappedIntMap k v -> Bool

(>) :: WrappedIntMap k v -> WrappedIntMap k v -> Bool

(>=) :: WrappedIntMap k v -> WrappedIntMap k v -> Bool

max :: WrappedIntMap k v -> WrappedIntMap k v -> WrappedIntMap k v

min :: WrappedIntMap k v -> WrappedIntMap k v -> WrappedIntMap k v