Modulemonoidal-containers-0.6.8.0Haskell2010

Data.IntMap.Monoidal.Strict

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

While some functions mirroring those of Data.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.

Contents

Often-needed functions

Synopsis

newtype MonoidalIntMap
value singleton
value size
value member
value notMember
value findWithDefault
value assocs
value elems
value keys
value !
value \\
value adjust
value adjustWithKey
value alter
value delete
value deleteFindMax
value deleteFindMin
value deleteMax
value deleteMin
value difference
value differenceWith
value differenceWithKey
value empty
value filter
value filterWithKey
value findMax
value findMin
value foldMapWithKey
value foldl
value foldl'
value foldlWithKey
value foldlWithKey'
value foldr
value foldr'
value foldrWithKey
value foldrWithKey'
value fromAscList
value fromAscListWith
value fromAscListWithKey
value fromDistinctAscList
value fromDistinctList
value fromList
value fromListWith
value fromListWithKey
value fromSet
value insert
value insertLookupWithKey
value insertWith
value insertWithKey
value intersectionWith
value intersectionWithKey
value isProperSubmapOf
value isProperSubmapOfBy
value isSubmapOf
value isSubmapOfBy
value keysSet
value lookup
value lookupGE
value lookupGT
value lookupLE
value lookupLT
value map
value mapAccum
value mapAccumRWithKey
value mapAccumWithKey
value mapEither
value mapEitherWithKey
value mapKeys
value mapKeysMonotonic
value mapKeysWith
value mapMaybe
value mapMaybeWithKey
value mapWithKey
value maxView
value maxViewWithKey
value mergeWithKey
value minView
value minViewWithKey
value null
value partition
value partitionWithKey
value split
value splitLookup
value splitRoot
value toAscList
value toDescList
value toList
value traverseWithKey
value unionWith
value unionWithKey
value unionsWith
value update
value updateLookupWithKey
value updateMax
value updateMaxWithKey
value updateMin
value updateMinWithKey
value updateWithKey

Packagemonoidal-containers-0.6.8.0
Exports98
LanguageHaskell2010
LicenceBSD-3-Clause
SourceStrict.hs

newtypenewtype MonoidalIntMap a

Source#

An IntMap with monoidal accumulation

Constructors

MonoidalIntMap
- getMonoidalIntMap :: IntMap a

Instances40Functor, Foldable, Traversable, Eq1, Ord1, Show1, …

Functor MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Foldable MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Traversable MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Eq1 MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Ord1 MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Show1 MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Align MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Semialign MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Unalign MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Zip MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Filterable MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Witherable MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
FromJSON1 MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
ToJSON1 MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
FoldableWithIndex Int MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
FunctorWithIndex Int MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
TraversableWithIndex Int MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
TraverseMax Int MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
TraverseMin Int MonoidalIntMapDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Semigroup a => IsList (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Eq a => Eq (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Data a => Data (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Ord a => Ord (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Read a => Read (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Show a => Show (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Semigroup a => Semigroup (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Semigroup a => Monoid (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
NFData a => NFData (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
FromJSON a => FromJSON (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
ToJSON a => ToJSON (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
At (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Ixed (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
AsEmpty (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Wrapped (MonoidalIntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Newtype (MonoidalIntMap a) (IntMap a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
Each (MonoidalIntMap a) (MonoidalIntMap b) a bDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
type Item (MonoidalIntMap a) = (Int, a)Defined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
type Unwrapped (MonoidalIntMap a) = IntMap aDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
type Index (MonoidalIntMap a) = IntDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict
type IxValue (MonoidalIntMap a) = aDefined in monoidal-containers-0.6.8.0 · Data.IntMap.Monoidal.Strict

Often-needed functions

valuesingleton :: Int -> a -> MonoidalIntMap a

Source#

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

valuesize :: MonoidalIntMap a -> Int

Source#

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

valuemember :: Int -> MonoidalIntMap a -> Bool

Source#

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

valuenotMember :: Int -> MonoidalIntMap a -> Bool

Source#

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

valuefindWithDefault :: 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.

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

Source#

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

valueelems :: MonoidalIntMap a -> [a]

Source#

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

valuekeys :: MonoidalIntMap a -> [Int]

Source#

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

value(!) :: MonoidalIntMap a -> Int -> a

value(\\) :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a

valueadjust :: (a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a

valueadjustWithKey

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

valuealter :: (Maybe a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a

valuedelete :: 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.

valuedeleteFindMax :: MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)

valuedeleteFindMin :: MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)

valuedeleteMax :: MonoidalIntMap a -> MonoidalIntMap a

valuedeleteMin :: MonoidalIntMap a -> MonoidalIntMap a

valuedifference :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a

valuedifferenceWith

:: a -> b -> Maybe a
-> MonoidalIntMap a
-> MonoidalIntMap b
-> MonoidalIntMap a

valuedifferenceWithKey

:: Int -> a -> b -> Maybe a
-> MonoidalIntMap a
-> MonoidalIntMap b
-> MonoidalIntMap a

valueempty :: MonoidalIntMap a

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

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

valuefindMax :: MonoidalIntMap a -> (Int, a)

valuefindMin :: MonoidalIntMap a -> (Int, a)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

valuefromSet :: (Int -> a) -> IntSet -> MonoidalIntMap a

valueinsert :: Int -> a -> MonoidalIntMap a -> MonoidalIntMap a

valueinsertLookupWithKey

:: Int -> a -> a -> a
-> Int
-> a
-> MonoidalIntMap a
-> (Maybe a, MonoidalIntMap a)

valueinsertWith

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

valueinsertWithKey

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

valueintersectionWith

:: a -> b -> c
-> MonoidalIntMap a
-> MonoidalIntMap b
-> MonoidalIntMap c

valueintersectionWithKey

:: Int -> a -> b -> c
-> MonoidalIntMap a
-> MonoidalIntMap b
-> MonoidalIntMap c

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

valueisProperSubmapOfBy

:: a -> b -> Bool
-> MonoidalIntMap a
-> MonoidalIntMap b
-> Bool

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

valueisSubmapOfBy

:: a -> b -> Bool
-> MonoidalIntMap a
-> MonoidalIntMap b
-> Bool

valuekeysSet :: MonoidalIntMap a -> IntSet

valuelookup :: Int -> MonoidalIntMap a -> Maybe a

valuelookupGE :: Int -> MonoidalIntMap a -> Maybe (Int, a)

valuelookupGT :: Int -> MonoidalIntMap a -> Maybe (Int, a)

valuelookupLE :: Int -> MonoidalIntMap a -> Maybe (Int, a)

valuelookupLT :: Int -> MonoidalIntMap a -> Maybe (Int, a)

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

valuemapAccum

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

valuemapAccumRWithKey

:: a -> Int -> b -> (a, c)
-> a
-> MonoidalIntMap b
-> (a, MonoidalIntMap c)

valuemapAccumWithKey

:: a -> Int -> b -> (a, c)
-> a
-> MonoidalIntMap b
-> (a, MonoidalIntMap c)

valuemapEither

:: a -> Either b c
-> MonoidalIntMap a
-> (MonoidalIntMap b, MonoidalIntMap c)

valuemapEitherWithKey

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

valuemapKeys :: (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a

valuemapKeysMonotonic :: (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a

valuemapKeysWith

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

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

valuemapMaybeWithKey

:: Int -> a -> Maybe b
-> MonoidalIntMap a
-> MonoidalIntMap b

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

valuemaxView :: MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)

valuemaxViewWithKey :: MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)

valuemergeWithKey

:: Int -> a -> b -> Maybe c
-> MonoidalIntMap a -> MonoidalIntMap c
-> MonoidalIntMap b -> MonoidalIntMap c
-> MonoidalIntMap a
-> MonoidalIntMap b
-> MonoidalIntMap c

valueminView :: MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)

valueminViewWithKey :: MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)

valuenull :: MonoidalIntMap a -> Bool

valuepartition

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

valuepartitionWithKey

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

valuesplit :: Int -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)

valuesplitLookup

:: Int
-> MonoidalIntMap a
-> (MonoidalIntMap a, Maybe a, MonoidalIntMap a)

valuesplitRoot :: MonoidalIntMap a -> [MonoidalIntMap a]

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

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

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

valuetraverseWithKey

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

valueunionWith

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

valueunionWithKey

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

valueunionsWith :: (a -> a -> a) -> [MonoidalIntMap a] -> MonoidalIntMap a

valueupdate :: (a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a

valueupdateLookupWithKey

:: Int -> a -> Maybe a
-> Int
-> MonoidalIntMap a
-> (Maybe a, MonoidalIntMap a)

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

valueupdateMaxWithKey

:: Int -> a -> Maybe a
-> MonoidalIntMap a
-> MonoidalIntMap a

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

valueupdateMinWithKey

:: Int -> a -> Maybe a
-> MonoidalIntMap a
-> MonoidalIntMap a

valueupdateWithKey

:: Int -> a -> Maybe a
-> Int
-> MonoidalIntMap a
-> MonoidalIntMap a