diff --git a/notebooks/IHaskell.ipynb b/notebooks/IHaskell.ipynb index 34ad0c35..44b45ae4 100644 --- a/notebooks/IHaskell.ipynb +++ b/notebooks/IHaskell.ipynb @@ -2075,6 +2075,27 @@ "\n", "zip ∷ [a] → [b] → [(a, b)]
\n", "zip ∷ [a] → [b] → [(a, b)]
\n", + "zip ∷ () ⇒ [a] → [b] → [(a, b)]
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)]
zip takes two lists and returns a list of corresponding pairs.\n", "\n", "
\n",
@@ -2138,27 +2159,6 @@
        "zip _|_ [] = _|_\n",
        "
\n", "
\n", - "zip ∷ () ⇒ [a] → [b] → [(a, b)]
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)]
zip takes two lists and returns a list of corresponding pairs.\n", "If one input list is short, excess elements of the longer list are\n", "discarded.\n", @@ -2735,6 +2735,29 @@ "URL: https://hackage.haskell.org/package/prelude-compat/docs/Prelude2010.html#v:zip\n", "\n", "zip :: () => [a] -> [b] -> [(a, b)]\n", + "URL: https://hackage.haskell.org/package/relude/docs/Relude-List-Reexport.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/stack/docs/Stack-Prelude.html#v:zip\n", "zip takes two lists and returns a list of corresponding pairs.\n", "\n", @@ -2804,29 +2827,6 @@ "\n", "\n", "zip :: () => [a] -> [b] -> [(a, b)]\n", - "URL: https://hackage.haskell.org/package/relude/docs/Relude-List-Reexport.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/yesod-paginator/docs/Yesod-Paginator-Prelude.html#v:zip\n", "zip takes two lists and returns a list of corresponding pairs.\n", "If one input list is short, excess elements of the longer list are\n",