Data.IntMap.Monoidal

This module provides a IntMap variant which uses the value's Monoid instance to accumulate conflicting entries when merging Maps.

While some functions mirroring those of IntMap are provided here for convenience, more specialized needs will likely want to use either the Newtype or Wrapped instances to manipulate the underlying Map.

Documentation

newtype MonoidalIntMap a

An IntMap with monoidal accumulation

Constructors

MonoidalIntMap

Fields

• getMonoidalIntMap :: IntMap a

Instances

FromJSON1 MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

liftParseJSON :: (Value -> Parser a) -> (Value -> Parser [a]) -> Value -> Parser (MonoidalIntMap a)

liftParseJSONList :: (Value -> Parser a) -> (Value -> Parser [a]) -> Value -> Parser [MonoidalIntMap a]

ToJSON1 MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

liftToJSON :: (a -> Value) -> ([a] -> Value) -> MonoidalIntMap a -> Value

liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [MonoidalIntMap a] -> Value

liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> MonoidalIntMap a -> Encoding

liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [MonoidalIntMap a] -> Encoding

Foldable MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

fold :: Monoid m => MonoidalIntMap m -> m

foldMap :: Monoid m => (a -> m) -> MonoidalIntMap a -> m

foldMap' :: Monoid m => (a -> m) -> MonoidalIntMap a -> m

foldr :: (a -> b -> b) -> b -> MonoidalIntMap a -> b

foldr' :: (a -> b -> b) -> b -> MonoidalIntMap a -> b

foldl :: (b -> a -> b) -> b -> MonoidalIntMap a -> b

foldl' :: (b -> a -> b) -> b -> MonoidalIntMap a -> b

foldr1 :: (a -> a -> a) -> MonoidalIntMap a -> a

foldl1 :: (a -> a -> a) -> MonoidalIntMap a -> a

toList :: MonoidalIntMap a -> [a]

null :: MonoidalIntMap a -> Bool

length :: MonoidalIntMap a -> Int

elem :: Eq a => a -> MonoidalIntMap a -> Bool

maximum :: Ord a => MonoidalIntMap a -> a

minimum :: Ord a => MonoidalIntMap a -> a

sum :: Num a => MonoidalIntMap a -> a

product :: Num a => MonoidalIntMap a -> a

Eq1 MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

liftEq :: (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool

Ord1 MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

liftCompare :: (a -> b -> Ordering) -> MonoidalIntMap a -> MonoidalIntMap b -> Ordering

Show1 MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> MonoidalIntMap a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [MonoidalIntMap a] -> ShowS

Traversable MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

traverse :: Applicative f => (a -> f b) -> MonoidalIntMap a -> f (MonoidalIntMap b)

sequenceA :: Applicative f => MonoidalIntMap (f a) -> f (MonoidalIntMap a)

mapM :: Monad m => (a -> m b) -> MonoidalIntMap a -> m (MonoidalIntMap b)

sequence :: Monad m => MonoidalIntMap (m a) -> m (MonoidalIntMap a)

Functor MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

fmap :: (a -> b) -> MonoidalIntMap a -> MonoidalIntMap b

(<$) :: a -> MonoidalIntMap b -> MonoidalIntMap a

Align MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

nil :: MonoidalIntMap a

Semialign MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

align :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap (These a b)

alignWith :: (These a b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c

Unalign MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

unalign :: MonoidalIntMap (These a b) -> (MonoidalIntMap a, MonoidalIntMap b)

unalignWith :: (c -> These a b) -> MonoidalIntMap c -> (MonoidalIntMap a, MonoidalIntMap b)

Zip MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

zip :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap (a, b)

zipWith :: (a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c

Filterable MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

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

catMaybes :: MonoidalIntMap (Maybe a) -> MonoidalIntMap a

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

Witherable MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

wither :: Applicative f => (a -> f (Maybe b)) -> MonoidalIntMap a -> f (MonoidalIntMap b)

witherM :: Monad m => (a -> m (Maybe b)) -> MonoidalIntMap a -> m (MonoidalIntMap b)

filterA :: Applicative f => (a -> f Bool) -> MonoidalIntMap a -> f (MonoidalIntMap a)

witherMap :: Applicative m => (MonoidalIntMap b -> r) -> (a -> m (Maybe b)) -> MonoidalIntMap a -> m r

FoldableWithIndex Int MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> MonoidalIntMap a -> m

ifoldMap' :: Monoid m => (Int -> a -> m) -> MonoidalIntMap a -> m

ifoldr :: (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b

ifoldl :: (Int -> b -> a -> b) -> b -> MonoidalIntMap a -> b

ifoldr' :: (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b

ifoldl' :: (Int -> b -> a -> b) -> b -> MonoidalIntMap a -> b

FunctorWithIndex Int MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

imap :: (Int -> a -> b) -> MonoidalIntMap a -> MonoidalIntMap b

TraversableWithIndex Int MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> MonoidalIntMap a -> f (MonoidalIntMap b)

TraverseMax Int MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

traverseMax :: IndexedTraversal' Int (MonoidalIntMap v) v

TraverseMin Int MonoidalIntMap

Defined in Data.IntMap.Monoidal

Methods

traverseMin :: IndexedTraversal' Int (MonoidalIntMap v) v

FromJSON a => FromJSON (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

parseJSON :: Value -> Parser (MonoidalIntMap a)

parseJSONList :: Value -> Parser [MonoidalIntMap a]

ToJSON a => ToJSON (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

toJSON :: MonoidalIntMap a -> Value

toEncoding :: MonoidalIntMap a -> Encoding

toJSONList :: [MonoidalIntMap a] -> Value

toEncodingList :: [MonoidalIntMap a] -> Encoding

Data a => Data (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MonoidalIntMap a -> c (MonoidalIntMap a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (MonoidalIntMap a)

toConstr :: MonoidalIntMap a -> Constr

dataTypeOf :: MonoidalIntMap a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (MonoidalIntMap a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (MonoidalIntMap a))

gmapT :: (forall b. Data b => b -> b) -> MonoidalIntMap a -> MonoidalIntMap a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MonoidalIntMap a -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MonoidalIntMap a -> r

gmapQ :: (forall d. Data d => d -> u) -> MonoidalIntMap a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> MonoidalIntMap a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> MonoidalIntMap a -> m (MonoidalIntMap a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MonoidalIntMap a -> m (MonoidalIntMap a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MonoidalIntMap a -> m (MonoidalIntMap a)

Semigroup a => Monoid (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

mempty :: MonoidalIntMap a

mappend :: MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a

mconcat :: [MonoidalIntMap a] -> MonoidalIntMap a

Semigroup a => Semigroup (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

(<>) :: MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a

sconcat :: NonEmpty (MonoidalIntMap a) -> MonoidalIntMap a

stimes :: Integral b => b -> MonoidalIntMap a -> MonoidalIntMap a

Semigroup a => IsList (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Associated Types

type Item (MonoidalIntMap a)

Methods

fromList :: [Item (MonoidalIntMap a)] -> MonoidalIntMap a

fromListN :: Int -> [Item (MonoidalIntMap a)] -> MonoidalIntMap a

toList :: MonoidalIntMap a -> [Item (MonoidalIntMap a)]

Read a => Read (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

readsPrec :: Int -> ReadS (MonoidalIntMap a)

readList :: ReadS [MonoidalIntMap a]

readPrec :: ReadPrec (MonoidalIntMap a)

readListPrec :: ReadPrec [MonoidalIntMap a]

Show a => Show (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

showsPrec :: Int -> MonoidalIntMap a -> ShowS

show :: MonoidalIntMap a -> String

showList :: [MonoidalIntMap a] -> ShowS

NFData a => NFData (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

rnf :: MonoidalIntMap a -> ()

Eq a => Eq (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

(==) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool

(/=) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool

Ord a => Ord (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

compare :: MonoidalIntMap a -> MonoidalIntMap a -> Ordering

(<) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool

(<=) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool

(>) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool

(>=) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool

max :: MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a

min :: MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a

At (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

at :: Index (MonoidalIntMap a) -> Lens' (MonoidalIntMap a) (Maybe (IxValue (MonoidalIntMap a)))

Ixed (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

ix :: Index (MonoidalIntMap a) -> Traversal' (MonoidalIntMap a) (IxValue (MonoidalIntMap a))

AsEmpty (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Methods

_Empty :: Prism' (MonoidalIntMap a) ()

Wrapped (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

Associated Types

type Unwrapped (MonoidalIntMap a)

Methods

_Wrapped' :: Iso' (MonoidalIntMap a) (Unwrapped (MonoidalIntMap a))

Newtype (MonoidalIntMap a) (IntMap a)

Defined in Data.IntMap.Monoidal

Methods

pack :: IntMap a -> MonoidalIntMap a

unpack :: MonoidalIntMap a -> IntMap a

Each (MonoidalIntMap a) (MonoidalIntMap b) a b

Defined in Data.IntMap.Monoidal

Methods

each :: Traversal (MonoidalIntMap a) (MonoidalIntMap b) a b

type Item (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

type Item (MonoidalIntMap a) = (Int, a)

type Index (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

type Index (MonoidalIntMap a) = Int

type IxValue (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

type IxValue (MonoidalIntMap a) = a

type Unwrapped (MonoidalIntMap a)

Defined in Data.IntMap.Monoidal

type Unwrapped (MonoidalIntMap a) = IntMap a

Often-needed functions

singleton :: Int -> a -> MonoidalIntMap a

O(1). A map with a single element.

size :: MonoidalIntMap a -> Int

O(1). The number of elements in the map.

member :: Int -> MonoidalIntMap a -> Bool

O(log n). Is the key a member of the map? See also notMember.

notMember :: Int -> MonoidalIntMap a -> Bool

O(log n). Is the key not a member of the map? See also member.

findWithDefault :: forall a. a -> Int -> MonoidalIntMap a -> a

O(log n). The expression (findWithDefault def k map) returns the value at key k or returns default value def when the key is not in the map.

assocs :: MonoidalIntMap a -> [(Int, a)]

O(n). Return all elements of the map and their keys

elems :: MonoidalIntMap a -> [a]

O(n). Return all elements of the map in the ascending order of their keys. Subject to list fusion.

keys :: MonoidalIntMap a -> [Int]

O(n). Return all keys of the map in ascending order. Subject to list fusion.

(!) :: forall a. MonoidalIntMap a -> Int -> a infixl 9

(\\) :: forall a b. MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a infixl 9

adjust :: forall a. (a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a

adjustWithKey :: forall a. (Int -> a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a

alter :: forall a. (Maybe a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a

delete :: Int -> MonoidalIntMap a -> MonoidalIntMap a

O(log n). Delete a key and its value from the map. When the key is not a member of the map, the original map is returned.

deleteFindMax :: forall a. MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)

deleteFindMin :: forall a. MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)

deleteMax :: forall a. MonoidalIntMap a -> MonoidalIntMap a

deleteMin :: forall a. MonoidalIntMap a -> MonoidalIntMap a

difference :: forall a b. MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a

differenceWith :: forall a b. (a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a

differenceWithKey :: forall a b. (Int -> a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a

empty :: forall a. MonoidalIntMap a

filter :: forall a. (a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a

filterWithKey :: forall a. (Int -> a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a

findMax :: forall a. MonoidalIntMap a -> (Int, a)

findMin :: forall a. MonoidalIntMap a -> (Int, a)

foldMapWithKey :: forall a m. Monoid m => (Int -> a -> m) -> MonoidalIntMap a -> m

foldl :: forall a b. (a -> b -> a) -> a -> MonoidalIntMap b -> a

foldl' :: forall a b. (a -> b -> a) -> a -> MonoidalIntMap b -> a

foldlWithKey :: forall a b. (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a

foldlWithKey' :: forall a b. (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a

foldr :: forall a b. (a -> b -> b) -> b -> MonoidalIntMap a -> b

foldr' :: forall a b. (a -> b -> b) -> b -> MonoidalIntMap a -> b

foldrWithKey :: forall a b. (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b

foldrWithKey' :: forall a b. (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b

fromAscList :: forall a. [(Int, a)] -> MonoidalIntMap a

fromAscListWith :: forall a. (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a

fromAscListWithKey :: forall a. (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a

fromDistinctAscList :: forall a. [(Int, a)] -> MonoidalIntMap a

fromDistinctList :: forall a. [(Int, a)] -> MonoidalIntMap a

fromList :: forall a. [(Int, a)] -> MonoidalIntMap a

fromListWith :: forall a. (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a

fromListWithKey :: forall a. (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a

fromSet :: forall a. (Int -> a) -> IntSet -> MonoidalIntMap a

insert :: forall a. Int -> a -> MonoidalIntMap a -> MonoidalIntMap a

insertLookupWithKey :: forall a. (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)

insertWith :: forall a. (a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a

insertWithKey :: forall a. (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a

intersectionWith :: forall a b c. (a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c

intersectionWithKey :: forall a b c. (Int -> a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c

isProperSubmapOf :: forall a. Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool

isProperSubmapOfBy :: forall a b. (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool

isSubmapOf :: forall a. Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool

isSubmapOfBy :: forall a b. (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool

keysSet :: forall a. MonoidalIntMap a -> IntSet

lookup :: forall a. Int -> MonoidalIntMap a -> Maybe a

lookupGE :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)

lookupGT :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)

lookupLE :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)

lookupLT :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)

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

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

mapAccumRWithKey :: forall a b c. (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)

mapAccumWithKey :: forall a b c. (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)

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

mapEitherWithKey :: forall a b c. (Int -> a -> Either b c) -> MonoidalIntMap a -> (MonoidalIntMap b, MonoidalIntMap c)

mapKeys :: forall a. (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a

mapKeysMonotonic :: forall a. (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a

mapKeysWith :: forall a. (a -> a -> a) -> (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a

mapMaybe :: forall a b. (a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b

mapMaybeWithKey :: forall a b. (Int -> a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b

mapWithKey :: forall a b. (Int -> a -> b) -> MonoidalIntMap a -> MonoidalIntMap b

maxView :: forall a. MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)

maxViewWithKey :: forall a. MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)

mergeWithKey :: forall a b c. (Int -> a -> b -> Maybe c) -> (MonoidalIntMap a -> MonoidalIntMap c) -> (MonoidalIntMap b -> MonoidalIntMap c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c

minView :: forall a. MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)

minViewWithKey :: forall a. MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)

null :: forall a. MonoidalIntMap a -> Bool

partition :: forall a. (a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)

partitionWithKey :: forall a. (Int -> a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)

split :: forall a. Int -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)

splitLookup :: forall a. Int -> MonoidalIntMap a -> (MonoidalIntMap a, Maybe a, MonoidalIntMap a)

splitRoot :: forall a. MonoidalIntMap a -> [MonoidalIntMap a]

toAscList :: forall a. MonoidalIntMap a -> [(Int, a)]

toDescList :: forall a. MonoidalIntMap a -> [(Int, a)]

toList :: forall a. MonoidalIntMap a -> [(Int, a)]

traverseWithKey :: Applicative t => (Int -> a -> t b) -> MonoidalIntMap a -> t (MonoidalIntMap b)

unionWith :: forall a. (a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a

unionWithKey :: forall a. (Int -> a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a

unionsWith :: forall a. (a -> a -> a) -> [MonoidalIntMap a] -> MonoidalIntMap a

update :: forall a. (a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a

updateLookupWithKey :: forall a. (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)

updateMax :: forall a. (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a

updateMaxWithKey :: forall a. (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a

updateMin :: forall a. (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a

updateMinWithKey :: forall a. (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a

updateWithKey :: forall a. (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a