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.
fromListWithKey :: (Key -> 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 fromAscListWithKey.
let f k a1 a2 = (show k) ++ a1 ++ a2 fromListWithKey f ((5,"a") :| [(5,"b"), (3,"b"), (3,"a"), (5,"a")]) == fromList ((3, "3ab") :| [(5, "5a5ba")])
fromListWith :: Ord k => (a -> a -> a) -> NonEmpty (k, a) -> NEMap k anonempty-containers Data.Map.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")])
fromListWithKey :: Ord k => (k -> a -> a -> a) -> NonEmpty (k, a) -> NEMap k anonempty-containers Data.Map.NonEmpty O(n*log n). Build a map from a non-empty list of key/value pairs with a combining function. See also fromAscListWithKey.
let f k a1 a2 = (show k) ++ a1 ++ a2 fromListWithKey f ((5,"a") :| [(5,"b"), (3,"b"), (3,"a"), (5,"a")]) == fromList ((3, "3ab") :| [(5, "5a5ba")])
fromListN :: Int -> [a] -> Vector arebase Rebase.Data.Vector No documentation available.
fromListN :: forall (m :: Type -> Type) a . Monad m => Int -> [a] -> Stream m arebase Rebase.Data.Vector.Fusion.Stream.Monadic Convert the first n elements of a list to a Bundle
fromListN :: Vector v a => Int -> [a] -> v arebase Rebase.Data.Vector.Generic No documentation available.
fromListN :: Prim a => Int -> [a] -> Vector arebase Rebase.Data.Vector.Primitive No documentation available.
fromListN :: Storable a => Int -> [a] -> Vector arebase Rebase.Data.Vector.Storable No documentation available.
fromListN :: Unbox a => Int -> [a] -> Vector arebase Rebase.Data.Vector.Unboxed No documentation available.
fromListN :: IsList l => Int -> [Item l] -> lrebase Rebase.Prelude The fromListN function takes the input list's length and potentially uses it to construct the structure l more efficiently compared to fromList. If the given number does not equal to the input list's length the behaviour of fromListN is not specified.
fromListN (length xs) xs == fromList xs