Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
fromListWith :: (Eq k, Hashable k) => (a -> a -> a) -> [(k, a)] -> MonoidalHashMap k amonoidal-containers Data.HashMap.Monoidal 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.
fromListWith :: (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap amonoidal-containers Data.IntMap.Monoidal No documentation available.
fromListWithKey :: (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap amonoidal-containers Data.IntMap.Monoidal No documentation available.
fromListWith :: (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap amonoidal-containers Data.IntMap.Monoidal.Strict No documentation available.
fromListWithKey :: (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap amonoidal-containers Data.IntMap.Monoidal.Strict No documentation available.
fromListWith :: Ord k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k amonoidal-containers Data.Map.Monoidal No documentation available.
fromListWithKey :: Ord k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k amonoidal-containers Data.Map.Monoidal No documentation available.
fromListWith :: Ord k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k amonoidal-containers Data.Map.Monoidal.Strict No documentation available.
fromListWithKey :: Ord k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k amonoidal-containers Data.Map.Monoidal.Strict No documentation available.
fromListWith :: (a -> a -> a) -> NonEmpty (Key, a) -> NEIntMap anonempty-containers Data.IntMap.NonEmpty O(n*log n). Build a map from a non-empty list of key/value pairs with a combining function. See also fromAscListWith.
fromListWith (++) ((5,"a") :| [(5,"b"), (3,"b"), (3,"a"), (5,"a")]) == fromList ((3, "ab") :| [(5, "aba")])