\n",
"divided = divide id\n",
"\n",
@@ -2253,6 +2289,13 @@
"
zip ∷ List l ⇒ l a → l b → l (a, b)\n",
"
pair ∷ Sized f ⇒ f a → f b → f (a, b)Default:
pair a b = (,) $ a * b.\n",
"
\n",
+ "
zip ∷ (Vector v a, Vector v b, Vector v (a, b)) ⇒ v a → v b → v (a, b)O(min(m,n)) Zip two vectors\n",
+ "
\n",
+ "
pair ∷ (Vector v a, Vector v b, Vector v (a, b)) ⇒ v a → v b → v (a, b)Pair two samples. It's like
zip but requires that both samples\n",
+ "have equal size.\n",
+ "
\n",
+ "
zip ∷ (Vector v a, Vector v b, Vector v (a, b)) ⇒ v a → v b → v (a, b)O(min(m,n)) Zip two vectors\n",
+ "
\n",
"
zip ∷ Zip f ⇒ f a → f b → f (a, b)\n",
"
zip ∷ Zip f ⇒ f a → f b → f (a, b)\n",
"
zip ∷ Zip f ⇒ f a → f b → f (a, b)\n",
@@ -2276,13 +2319,6 @@
"
(>*<) ∷ Monoidal f ⇒ f a → f b → f (a, b)Merge two functors into a tuple, analogous to
liftA2\n",
"(,). (Sometimes known as
**.)\n",
"
\n",
- "
zip ∷ (Vector v a, Vector v b, Vector v (a, b)) ⇒ v a → v b → v (a, b)O(min(m,n)) Zip two vectors\n",
- "
\n",
- "
pair ∷ (Vector v a, Vector v b, Vector v (a, b)) ⇒ v a → v b → v (a, b)Pair two samples. It's like
zip but requires that both samples\n",
- "have equal size.\n",
- "
\n",
- "
zip ∷ (Vector v a, Vector v b, Vector v (a, b)) ⇒ v a → v b → v (a, b)O(min(m,n)) Zip two vectors\n",
- "
\n",
"
mzip ∷ MonadZip m ⇒ m a → m b → m (a, b)\n",
"
projectZip ∷ ProductIsoApplicative p ⇒ p a → p b → p (a, b)Zipping projections.\n",
"
\n",
@@ -2519,29 +2555,6 @@
"\n",
"\n",
"
zip :: () => [a] -> [b] -> [(a, b)]\n",
- "URL: https://hackage.haskell.org/package/rio/docs/RIO.html#v:zip\n",
- "
zip takes two lists and returns a list of corresponding pairs.\n",
- "\n",
- "
\n",
- "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
- "
\n",
- "\n",
- "If one input list is short, excess elements of the longer list are\n",
- "discarded:\n",
- "\n",
- "
\n",
- "zip [1] ['a', 'b'] = [(1, 'a')]\n",
- "zip [1, 2] ['a'] = [(1, 'a')]\n",
- "
\n",
- "\n",
- "
zip is right-lazy:\n",
- "\n",
- "
\n",
- "zip [] _|_ = []\n",
- "zip _|_ [] = _|_\n",
- "
\n",
- "\n",
- "
zip :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/rio/docs/RIO-List.html#v:zip\n",
"
zip takes two lists and returns a list of corresponding pairs.\n",
"\n",
@@ -2565,32 +2578,33 @@
"\n",
"\n",
"
zip :: () => [a] -> [b] -> [(a, b)]\n",
- "URL: https://hackage.haskell.org/package/rebase/docs/Rebase-Prelude.html#v:zip\n",
+ "URL: https://hackage.haskell.org/package/rio/docs/RIO-Prelude.html#v:zip\n",
"
zip takes two lists and returns a list of corresponding pairs.\n",
+ "\n",
+ "
\n",
+ "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
+ "
\n",
+ "\n",
"If one input list is short, excess elements of the longer list are\n",
- "discarded.\n",
+ "discarded:\n",
+ "\n",
+ "
\n",
+ "zip [1] ['a', 'b'] = [(1, 'a')]\n",
+ "zip [1, 2] ['a'] = [(1, 'a')]\n",
+ "
\n",
"\n",
"
zip is right-lazy:\n",
"\n",
"
\n",
"zip [] _|_ = []\n",
+ "zip _|_ [] = _|_\n",
"\n",
"\n",
"(
+*+) :: [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/universe-base/docs/Data-Universe-Helpers.html#v:-43--42--43-\n",
- "Slightly unfair 2-way Cartesian product: given two (possibly infinite)\n",
- "lists, produce a single list such that whenever
v and\n",
- "
w have finite indices in the input lists,
(v,w) has\n",
- "finite index in the output list. Lower indices occur as the\n",
- "
fst part of the tuple more frequently, but not exponentially\n",
- "so.\n",
- "\n",
- "
unfairCartesianProduct :: [a] -> [b] -> [(a, b)]\n",
- "URL: https://hackage.haskell.org/package/universe-base/docs/Data-Universe-Helpers.html#v:unfairCartesianProduct\n",
- "Very unfair 2-way Cartesian product: same guarantee as the slightly\n",
- "unfair one, except that lower indices may occur as the
fst\n",
- "part of the tuple exponentially more frequently. This mainly exists as\n",
- "a specification to test against.\n",
+ "
\n",
+ "cartesianProduct (,)\n",
+ "
\n",
"\n",
"
zip :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/universum/docs/Universum-List-Reexport.html#v:zip\n",
@@ -2616,6 +2630,29 @@
"\n",
"\n",
"
zip :: () => [a] -> [b] -> [(a, b)]\n",
+ "URL: https://hackage.haskell.org/package/rebase/docs/Rebase-Prelude.html#v:zip\n",
+ "
zip takes two lists and returns a list of corresponding pairs.\n",
+ "\n",
+ "
\n",
+ "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
+ "
\n",
+ "\n",
+ "If one input list is short, excess elements of the longer list are\n",
+ "discarded:\n",
+ "\n",
+ "
\n",
+ "zip [1] ['a', 'b'] = [(1, 'a')]\n",
+ "zip [1, 2] ['a'] = [(1, 'a')]\n",
+ "
\n",
+ "\n",
+ "
zip is right-lazy:\n",
+ "\n",
+ "
\n",
+ "zip [] _|_ = []\n",
+ "zip _|_ [] = _|_\n",
+ "
\n",
+ "\n",
+ "
zip :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/llvm-hs-pure/docs/LLVM-Prelude.html#v:zip\n",
"
zip takes two lists and returns a list of corresponding pairs.\n",
"\n",
@@ -2715,27 +2752,49 @@
"\n",
"\n",
"
zip :: () => [a] -> [b] -> [(a, b)]\n",
- "URL: https://hackage.haskell.org/package/LambdaHack/docs/Game-LambdaHack-Common-Prelude.html#v:zip\n",
+ "URL: https://hackage.haskell.org/package/LambdaHack/docs/Game-LambdaHack-Core-Prelude.html#v:zip\n",
"
zip takes two lists and returns a list of corresponding pairs.\n",
+ "\n",
+ "
\n",
+ "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
+ "
\n",
+ "\n",
"If one input list is short, excess elements of the longer list are\n",
- "discarded.\n",
+ "discarded:\n",
+ "\n",
+ "
\n",
+ "zip [1] ['a', 'b'] = [(1, 'a')]\n",
+ "zip [1, 2] ['a'] = [(1, 'a')]\n",
+ "
\n",
"\n",
"
zip is right-lazy:\n",
"\n",
"
\n",
"zip [] _|_ = []\n",
+ "zip _|_ [] = _|_\n",
"\n",
"\n",
"
zip :: () => [a] -> [b] -> [(a, b)]\n",
- "URL: https://hackage.haskell.org/package/LambdaHack/docs/Game-LambdaHack-Common-Prelude.html#v:zip\n",
+ "URL: https://hackage.haskell.org/package/LambdaHack/docs/Game-LambdaHack-Core-Prelude.html#v:zip\n",
"
zip takes two lists and returns a list of corresponding pairs.\n",
+ "\n",
+ "
\n",
+ "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
+ "
\n",
+ "\n",
"If one input list is short, excess elements of the longer list are\n",
- "discarded.\n",
+ "discarded:\n",
+ "\n",
+ "
\n",
+ "zip [1] ['a', 'b'] = [(1, 'a')]\n",
+ "zip [1, 2] ['a'] = [(1, 'a')]\n",
+ "
\n",
"\n",
"
zip is right-lazy:\n",
"\n",
"
\n",
"zip [] _|_ = []\n",
+ "zip _|_ [] = _|_\n",
"\n",
"\n",
"
zip :: () => [a] -> [b] -> [(a, b)]\n",
@@ -2764,13 +2823,24 @@
"
zip :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/yesod-paginator/docs/Yesod-Paginator-Prelude.html#v:zip\n",
"
zip takes two lists and returns a list of corresponding pairs.\n",
+ "\n",
+ "
\n",
+ "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
+ "
\n",
+ "\n",
"If one input list is short, excess elements of the longer list are\n",
- "discarded.\n",
+ "discarded:\n",
+ "\n",
+ "
\n",
+ "zip [1] ['a', 'b'] = [(1, 'a')]\n",
+ "zip [1, 2] ['a'] = [(1, 'a')]\n",
+ "
\n",
"\n",
"
zip is right-lazy:\n",
"\n",
"
\n",
"zip [] _|_ = []\n",
+ "zip _|_ [] = _|_\n",
"\n",
"\n",
"
zip :: () => [a] -> [b] -> [(a, b)]\n",
@@ -2865,6 +2935,9 @@
"URL: https://hackage.haskell.org/package/yesod-websockets/docs/Yesod-WebSockets.html#v:concurrently\n",
"Unlifted
concurrently.\n",
"\n",
+ "
mzipRep :: Representable f => f a -> f b -> f (a, b)\n",
+ "URL: https://hackage.haskell.org/package/adjunctions/docs/Data-Functor-Rep.html#v:mzipRep\n",
+ "\n",
"
concurrently :: MonadConc m => m a -> m b -> m (a, b)\n",
"URL: https://hackage.haskell.org/package/concurrency/docs/Control-Concurrent-Classy-Async.html#v:concurrently\n",
"Run two
MonadConc actions concurrently, and return both\n",
@@ -2879,9 +2952,6 @@
"waitBoth a b\n",
"\n",
"\n",
- "
mzipRep :: Representable f => f a -> f b -> f (a, b)\n",
- "URL: https://hackage.haskell.org/package/adjunctions/docs/Data-Functor-Rep.html#v:mzipRep\n",
- "\n",
"
divided :: Divisible f => f a -> f b -> f (a, b)\n",
"URL: https://hackage.haskell.org/package/contravariant/docs/Data-Functor-Contravariant-Divisible.html#v:divided\n",
"
\n",
@@ -2978,6 +3048,19 @@
"URL: https://hackage.haskell.org/package/size-based/docs/Control-Sized.html#v:pair\n",
"Default: pair a b = (,) $ a * b.\n",
"\n",
+ "zip :: (Vector v a, Vector v b, Vector v (a, b)) => v a -> v b -> v (a, b)\n",
+ "URL: https://hackage.haskell.org/package/vector/docs/Data-Vector-Generic.html#v:zip\n",
+ "O(min(m,n)) Zip two vectors\n",
+ "\n",
+ "pair :: (Vector v a, Vector v b, Vector v (a, b)) => v a -> v b -> v (a, b)\n",
+ "URL: https://hackage.haskell.org/package/statistics/docs/Statistics-Sample.html#v:pair\n",
+ "Pair two samples. It's like zip but requires that both samples\n",
+ "have equal size.\n",
+ "\n",
+ "zip :: (Vector v a, Vector v b, Vector v (a, b)) => v a -> v b -> v (a, b)\n",
+ "URL: https://hackage.haskell.org/package/rio/docs/RIO-Vector.html#v:zip\n",
+ "O(min(m,n)) Zip two vectors\n",
+ "\n",
"zip :: Zip f => f a -> f b -> f (a, b)\n",
"URL: https://hackage.haskell.org/package/classy-prelude/docs/ClassyPrelude.html#v:zip\n",
"\n",
@@ -3013,19 +3096,6 @@
"Merge two functors into a tuple, analogous to liftA2\n",
"(,). (Sometimes known as **.)\n",
"\n",
- "zip :: (Vector v a, Vector v b, Vector v (a, b)) => v a -> v b -> v (a, b)\n",
- "URL: https://hackage.haskell.org/package/vector/docs/Data-Vector-Generic.html#v:zip\n",
- "O(min(m,n)) Zip two vectors\n",
- "\n",
- "pair :: (Vector v a, Vector v b, Vector v (a, b)) => v a -> v b -> v (a, b)\n",
- "URL: https://hackage.haskell.org/package/statistics/docs/Statistics-Sample.html#v:pair\n",
- "Pair two samples. It's like zip but requires that both samples\n",
- "have equal size.\n",
- "\n",
- "zip :: (Vector v a, Vector v b, Vector v (a, b)) => v a -> v b -> v (a, b)\n",
- "URL: https://hackage.haskell.org/package/rio/docs/RIO-Vector.html#v:zip\n",
- "O(min(m,n)) Zip two vectors\n",
- "\n",
"mzip :: MonadZip m => m a -> m b -> m (a, b)\n",
"URL: https://hackage.haskell.org/package/base/docs/Control-Monad-Zip.html#v:mzip\n",
"\n",