Modulemonoidal-containers-0.6.8.0Haskell2010

Data.HashMap.Monoidal

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

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

1 type
19 values

Packagemonoidal-containers-0.6.8.0
Exports20
LanguageHaskell2010
LicenceBSD-3-Clause
SourceMonoidal.hs

newtypenewtype MonoidalHashMap k a

A HashMap with monoidal accumulation

Constructors

MonoidalHashMap
- getMonoidalHashMap :: HashMap k a

Instances36FoldableWithIndex, FunctorWithIndex, TraversableWithIndex, Functor, Foldable, Traversable, …

(Eq k, Hashable k) => FoldableWithIndex k (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k) => FunctorWithIndex k (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k) => TraversableWithIndex k (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Functor (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Foldable (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Traversable (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Eq k => Eq1 (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Hashable k => Hashable1 (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Hashable k => Align (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Hashable k => Semialign (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Hashable k => Unalign (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Hashable k => Unzip (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Hashable k => Zip (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Hashable k => Filterable (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k) => Witherable (MonoidalHashMap k)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k, Semigroup a) => IsList (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Eq a) => Eq (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Data k, Data a, Hashable k) => Data (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Hashable k, Read k, Read a) => Read (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Show k, Show a) => Show (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k, Semigroup a) => Semigroup (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k, Semigroup a) => Monoid (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(NFData k, NFData a) => NFData (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Hashable k, Hashable a) => Hashable (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k) => At (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k) => Ixed (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
AsEmpty (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Wrapped (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k) => Rewrapped (MonoidalHashMap k a) (HashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
(Eq k, Hashable k) => Rewrapped (HashMap k a) (MonoidalHashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Newtype (MonoidalHashMap k a) (HashMap k a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
Each (MonoidalHashMap k a) (MonoidalHashMap k b) a bDefined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
type Item (MonoidalHashMap k a) = (k, a)Defined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
type Unwrapped (MonoidalHashMap k a) = HashMap k aDefined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
type Index (MonoidalHashMap k a) = kDefined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal
type IxValue (MonoidalHashMap k a) = aDefined in monoidal-containers-0.6.8.0 · Data.HashMap.Monoidal

Often-needed functions

19 declarations

valuetoList :: MonoidalHashMap k a -> [(k, a)]

O(n*log n). Return a list of this map's elements. The list is produced lazily. The order of its elements is unspecified.

valuefromList :: (Eq k, Hashable k) => [(k, a)] -> MonoidalHashMap k a

O(n*log n). Construct a map with the supplied mappings. If the list contains duplicate mappings, values will be replaced.

valuefromListWith

:: (Eq k, Hashable k)
=> a -> a -> a
-> [(k, a)]
-> MonoidalHashMap k a

O(n*log n). Construct a map with the supplied mappings. If the list contains duplicate mappings, values will be merged using the provided combining function.

valuesingleton :: (Eq k, Hashable k) => k -> a -> MonoidalHashMap k a

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

valuesize :: MonoidalHashMap k a -> Int

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

valuemember :: (Eq k, Hashable k) => k -> MonoidalHashMap k a -> Bool

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

valuenotMember :: (Eq k, Hashable k) => k -> MonoidalHashMap k a -> Bool

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

valuelookup :: (Eq k, Hashable k) => k -> MonoidalHashMap k v -> Maybe v

O(log n) Return the value to which the specified key is mapped, or Nothing if this map contains no mapping for the key.

valuelookupM :: (Eq k, Hashable k, Monoid v) => k -> MonoidalHashMap k v -> v

O(log n) Return the value to which the specified key is mapped, or mempty if this map contains no mapping for the key.

valueelems :: MonoidalHashMap k a -> [a]

O(n). Return a list of this map's values. The list is produced lazily.

valuekeys :: MonoidalHashMap k a -> [k]

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

valuedelete

:: (Eq k, Hashable k)
=> k
-> MonoidalHashMap k a
-> MonoidalHashMap k 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.

valuemapKeys

:: (Hashable k, Eq k, Hashable k', Eq k')
=> k -> k'
-> MonoidalHashMap k a
-> MonoidalHashMap k' a

O(n). Map a function to each key of a map, if it will result in duplicated mappings, their values will be merged in unspecified order

valueinsert

:: (Hashable k, Eq k)
=> k
-> a
-> MonoidalHashMap k a
-> MonoidalHashMap k a

O(log n). Insert a value on some key, if it exists replace the value.

valueinsertWith

:: (Hashable k, Eq k)
=> a -> a -> a
-> k
-> a
-> MonoidalHashMap k a
-> MonoidalHashMap k a

O(log n). Insert a value on some key, if it exists apply the combining function.

valuemodify

:: (Monoid a, Hashable k, Eq k)
=> a -> a
-> k
-> MonoidalHashMap k a
-> MonoidalHashMap k a

O(log n). Modify a value on some key with a function, if value under key doesn't exist -- use mempty.

valuemodifyDef

:: (Hashable k, Eq k)
=> a
-> a -> a
-> k
-> MonoidalHashMap k a
-> MonoidalHashMap k a

O(log n). Modify a value on some key with a function, providing a default value if that key doesn't exist.

valuemap :: (v1 -> v2) -> MonoidalHashMap k v1 -> MonoidalHashMap k v2

O(n) Transform this map by applying a function to every value.

valuefilterWithKey

:: k -> v -> Bool
-> MonoidalHashMap k v
-> MonoidalHashMap k v

O(n) Filter this map by retaining only elements satisfying a predicate.