Safe Haskell	None
Language	Haskell2010

Data.IntMap.Monoidal

Contents

Often-needed functions

Description

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

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 .

Synopsis

newtype MonoidalIntMap a = MonoidalIntMap {
- getMonoidalIntMap :: IntMap a
}
singleton :: Int -> a -> MonoidalIntMap a
size :: MonoidalIntMap a -> Int
member :: Int -> MonoidalIntMap a -> Bool
notMember :: Int -> MonoidalIntMap a -> Bool
findWithDefault :: forall a. a -> Int -> MonoidalIntMap a -> a
assocs :: MonoidalIntMap a -> [( Int , a)]
elems :: MonoidalIntMap a -> [a]
keys :: MonoidalIntMap a -> [ Int ]
(!) :: forall a. MonoidalIntMap a -> Int -> a
(\\) :: forall a b. MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
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
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

Documentation

newtype MonoidalIntMap a Source #

An IntMap with monoidal accumulation

Constructors

MonoidalIntMap
Fields getMonoidalIntMap :: IntMap a

Instances

Instances details

Functor MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods fmap :: (a -> b) -> MonoidalIntMap a -> MonoidalIntMap b Source # (<$) :: a -> MonoidalIntMap b -> MonoidalIntMap a Source #
Foldable MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods fold :: Monoid m => MonoidalIntMap m -> m Source # foldMap :: Monoid m => (a -> m) -> MonoidalIntMap a -> m Source # foldMap' :: Monoid m => (a -> m) -> MonoidalIntMap a -> m Source # foldr :: (a -> b -> b) -> b -> MonoidalIntMap a -> b Source # foldr' :: (a -> b -> b) -> b -> MonoidalIntMap a -> b Source # foldl :: (b -> a -> b) -> b -> MonoidalIntMap a -> b Source # foldl' :: (b -> a -> b) -> b -> MonoidalIntMap a -> b Source # foldr1 :: (a -> a -> a) -> MonoidalIntMap a -> a Source # foldl1 :: (a -> a -> a) -> MonoidalIntMap a -> a Source # toList :: MonoidalIntMap a -> [a] Source # null :: MonoidalIntMap a -> Bool Source # length :: MonoidalIntMap a -> Int Source # elem :: Eq a => a -> MonoidalIntMap a -> Bool Source # maximum :: Ord a => MonoidalIntMap a -> a Source # minimum :: Ord a => MonoidalIntMap a -> a Source # sum :: Num a => MonoidalIntMap a -> a Source # product :: Num a => MonoidalIntMap a -> a Source #
Traversable MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods traverse :: Applicative f => (a -> f b) -> MonoidalIntMap a -> f ( MonoidalIntMap b) Source # sequenceA :: Applicative f => MonoidalIntMap (f a) -> f ( MonoidalIntMap a) Source # mapM :: Monad m => (a -> m b) -> MonoidalIntMap a -> m ( MonoidalIntMap b) Source # sequence :: Monad m => MonoidalIntMap (m a) -> m ( MonoidalIntMap a) Source #
ToJSON1 MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods liftToJSON :: (a -> Value ) -> ([a] -> Value ) -> MonoidalIntMap a -> Value Source # liftToJSONList :: (a -> Value ) -> ([a] -> Value ) -> [ MonoidalIntMap a] -> Value Source # liftToEncoding :: (a -> Encoding ) -> ([a] -> Encoding ) -> MonoidalIntMap a -> Encoding Source # liftToEncodingList :: (a -> Encoding ) -> ([a] -> Encoding ) -> [ MonoidalIntMap a] -> Encoding Source #
FromJSON1 MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods liftParseJSON :: ( Value -> Parser a) -> ( Value -> Parser [a]) -> Value -> Parser ( MonoidalIntMap a) Source # liftParseJSONList :: ( Value -> Parser a) -> ( Value -> Parser [a]) -> Value -> Parser [ MonoidalIntMap a] Source #
Eq1 MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods liftEq :: (a -> b -> Bool ) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool Source #
Ord1 MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods liftCompare :: (a -> b -> Ordering ) -> MonoidalIntMap a -> MonoidalIntMap b -> Ordering Source #
Show1 MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods liftShowsPrec :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> Int -> MonoidalIntMap a -> ShowS Source # liftShowList :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> [ MonoidalIntMap a] -> ShowS Source #
Semialign MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods align :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap ( These a b) Source # alignWith :: ( These a b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c Source #
Align MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods nil :: MonoidalIntMap a Source #
Unalign MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods unalign :: MonoidalIntMap ( These a b) -> ( MonoidalIntMap a, MonoidalIntMap b) Source # unalignWith :: (c -> These a b) -> MonoidalIntMap c -> ( MonoidalIntMap a, MonoidalIntMap b) Source #
Zip MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods zip :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap (a, b) Source # zipWith :: (a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c Source #
Filterable MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods mapMaybe :: (a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b Source # catMaybes :: MonoidalIntMap ( Maybe a) -> MonoidalIntMap a Source # filter :: (a -> Bool ) -> MonoidalIntMap a -> MonoidalIntMap a Source #
Witherable MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods wither :: Applicative f => (a -> f ( Maybe b)) -> MonoidalIntMap a -> f ( MonoidalIntMap b) Source # witherM :: Monad m => (a -> m ( Maybe b)) -> MonoidalIntMap a -> m ( MonoidalIntMap b) Source # filterA :: Applicative f => (a -> f Bool ) -> MonoidalIntMap a -> f ( MonoidalIntMap a) Source # witherMap :: Applicative m => ( MonoidalIntMap b -> r) -> (a -> m ( Maybe b)) -> MonoidalIntMap a -> m r Source #
FunctorWithIndex Int MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods imap :: ( Int -> a -> b) -> MonoidalIntMap a -> MonoidalIntMap b Source #
FoldableWithIndex Int MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods ifoldMap :: Monoid m => ( Int -> a -> m) -> MonoidalIntMap a -> m Source # ifoldMap' :: Monoid m => ( Int -> a -> m) -> MonoidalIntMap a -> m Source # ifoldr :: ( Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b Source # ifoldl :: ( Int -> b -> a -> b) -> b -> MonoidalIntMap a -> b Source # ifoldr' :: ( Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b Source # ifoldl' :: ( Int -> b -> a -> b) -> b -> MonoidalIntMap a -> b Source #
TraversableWithIndex Int MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods itraverse :: Applicative f => ( Int -> a -> f b) -> MonoidalIntMap a -> f ( MonoidalIntMap b) Source #
TraverseMin Int MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods traverseMin :: IndexedTraversal' Int ( MonoidalIntMap v) v Source #
TraverseMax Int MonoidalIntMap Source #
Instance details Defined in Data.IntMap.Monoidal Methods traverseMax :: IndexedTraversal' Int ( MonoidalIntMap v) v Source #
Semigroup a => IsList ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Associated Types type Item ( MonoidalIntMap a) Source # Methods fromList :: [ Item ( MonoidalIntMap a)] -> MonoidalIntMap a Source # fromListN :: Int -> [ Item ( MonoidalIntMap a)] -> MonoidalIntMap a Source # toList :: MonoidalIntMap a -> [ Item ( MonoidalIntMap a)] Source #
Eq a => Eq ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods (==) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool Source # (/=) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool Source #
Data a => Data ( MonoidalIntMap a) Source #
Instance details 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) Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c ( MonoidalIntMap a) Source # toConstr :: MonoidalIntMap a -> Constr Source # dataTypeOf :: MonoidalIntMap a -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c ( MonoidalIntMap a)) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c ( MonoidalIntMap a)) Source # gmapT :: ( forall b. Data b => b -> b) -> MonoidalIntMap a -> MonoidalIntMap a Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> MonoidalIntMap a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> MonoidalIntMap a -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> MonoidalIntMap a -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> MonoidalIntMap a -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> MonoidalIntMap a -> m ( MonoidalIntMap a) Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> MonoidalIntMap a -> m ( MonoidalIntMap a) Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> MonoidalIntMap a -> m ( MonoidalIntMap a) Source #
Ord a => Ord ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods compare :: MonoidalIntMap a -> MonoidalIntMap a -> Ordering Source # (<) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool Source # (<=) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool Source # (>) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool Source # (>=) :: MonoidalIntMap a -> MonoidalIntMap a -> Bool Source # max :: MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a Source # min :: MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a Source #
Read a => Read ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods readsPrec :: Int -> ReadS ( MonoidalIntMap a) Source # readList :: ReadS [ MonoidalIntMap a] Source # readPrec :: ReadPrec ( MonoidalIntMap a) Source # readListPrec :: ReadPrec [ MonoidalIntMap a] Source #
Show a => Show ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods showsPrec :: Int -> MonoidalIntMap a -> ShowS Source # show :: MonoidalIntMap a -> String Source # showList :: [ MonoidalIntMap a] -> ShowS Source #
Semigroup a => Semigroup ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods (<>) :: MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a Source # sconcat :: NonEmpty ( MonoidalIntMap a) -> MonoidalIntMap a Source # stimes :: Integral b => b -> MonoidalIntMap a -> MonoidalIntMap a Source #
Semigroup a => Monoid ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods mempty :: MonoidalIntMap a Source # mappend :: MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a Source # mconcat :: [ MonoidalIntMap a] -> MonoidalIntMap a Source #
ToJSON a => ToJSON ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods toJSON :: MonoidalIntMap a -> Value Source # toEncoding :: MonoidalIntMap a -> Encoding Source # toJSONList :: [ MonoidalIntMap a] -> Value Source # toEncodingList :: [ MonoidalIntMap a] -> Encoding Source #
FromJSON a => FromJSON ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods parseJSON :: Value -> Parser ( MonoidalIntMap a) Source # parseJSONList :: Value -> Parser [ MonoidalIntMap a] Source #
NFData a => NFData ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods rnf :: MonoidalIntMap a -> () Source #
Ixed ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods ix :: Index ( MonoidalIntMap a) -> Traversal' ( MonoidalIntMap a) ( IxValue ( MonoidalIntMap a)) Source #
At ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods at :: Index ( MonoidalIntMap a) -> Lens' ( MonoidalIntMap a) ( Maybe ( IxValue ( MonoidalIntMap a))) Source #
Wrapped ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Associated Types type Unwrapped ( MonoidalIntMap a) Source # Methods _Wrapped' :: Iso' ( MonoidalIntMap a) ( Unwrapped ( MonoidalIntMap a)) Source #
AsEmpty ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods _Empty :: Prism' ( MonoidalIntMap a) () Source #
Newtype ( MonoidalIntMap a) ( IntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal Methods pack :: IntMap a -> MonoidalIntMap a Source # unpack :: MonoidalIntMap a -> IntMap a Source #
Each ( MonoidalIntMap a) ( MonoidalIntMap b) a b Source #
Instance details Defined in Data.IntMap.Monoidal Methods each :: Traversal ( MonoidalIntMap a) ( MonoidalIntMap b) a b Source #
type Item ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal type Item ( MonoidalIntMap a) = ( Int , a)
type Index ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal type Index ( MonoidalIntMap a) = Int
type IxValue ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal type IxValue ( MonoidalIntMap a) = a
type Unwrapped ( MonoidalIntMap a) Source #
Instance details Defined in Data.IntMap.Monoidal type Unwrapped ( MonoidalIntMap a) = IntMap a

Often-needed functions

singleton :: Int -> a -> MonoidalIntMap a Source #

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

size :: MonoidalIntMap a -> Int Source #

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

member :: Int -> MonoidalIntMap a -> Bool Source #

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

notMember :: Int -> MonoidalIntMap a -> Bool Source #

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

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

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)] Source #

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

elems :: MonoidalIntMap a -> [a] Source #

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

keys :: MonoidalIntMap a -> [ Int ] Source #

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

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

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

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

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

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

delete :: Int -> MonoidalIntMap a -> MonoidalIntMap a Source #

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) Source #

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

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

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

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

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

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

empty :: forall a. MonoidalIntMap a Source #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

keysSet :: forall a. MonoidalIntMap a -> IntSet Source #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

null :: forall a. MonoidalIntMap a -> Bool Source #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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