notebooks/IHaskell.ipynb: update for latest Hoogle

notebooks/IHaskell.ipynb

@@ -2021,8 +2021,50 @@
        "zip [] _|_ = []\n",
        "</pre>\n",
        "</div>\n",
+       "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/mixed-types-num/docs/Numeric-MixedTypes-PreludeHiding.html#v:zip'><s0>zip</s0></a> &#x2237; () &#x21D2; [a] &#x2192; [b] &#x2192; [(a, b)]</span><div class='hoogle-doc'><a>zip</a> takes two lists and returns a list of corresponding pairs.\n",
+       "\n",
+       "<pre>\n",
+       "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
+       "</pre>\n",
+       "\n",
+       "If one input list is short, excess elements of the longer list are\n",
+       "discarded:\n",
+       "\n",
+       "<pre>\n",
+       "zip [1] ['a', 'b'] = [(1, 'a')]\n",
+       "zip [1, 2] ['a'] = [(1, 'a')]\n",
+       "</pre>\n",
+       "\n",
+       "<a>zip</a> is right-lazy:\n",
+       "\n",
+       "<pre>\n",
+       "zip [] _|_ = []\n",
+       "zip _|_ [] = _|_\n",
+       "</pre>\n",
+       "</div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/prelude-compat/docs/Data-List2010.html#v:zip'><s0>zip</s0></a> &#x2237; [a] &#x2192; [b] &#x2192; [(a, b)]</span><div class='hoogle-doc'></div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/prelude-compat/docs/Prelude2010.html#v:zip'><s0>zip</s0></a> &#x2237; [a] &#x2192; [b] &#x2192; [(a, b)]</span><div class='hoogle-doc'></div>\n",
+       "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/stack/docs/Stack-Prelude.html#v:zip'><s0>zip</s0></a> &#x2237; () &#x21D2; [a] &#x2192; [b] &#x2192; [(a, b)]</span><div class='hoogle-doc'><a>zip</a> takes two lists and returns a list of corresponding pairs.\n",
+       "\n",
+       "<pre>\n",
+       "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
+       "</pre>\n",
+       "\n",
+       "If one input list is short, excess elements of the longer list are\n",
+       "discarded:\n",
+       "\n",
+       "<pre>\n",
+       "zip [1] ['a', 'b'] = [(1, 'a')]\n",
+       "zip [1, 2] ['a'] = [(1, 'a')]\n",
+       "</pre>\n",
+       "\n",
+       "<a>zip</a> is right-lazy:\n",
+       "\n",
+       "<pre>\n",
+       "zip [] _|_ = []\n",
+       "zip _|_ [] = _|_\n",
+       "</pre>\n",
+       "</div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/EdisonAPI/docs/Data-Edison-Seq-ListSeq.html#v:zip'><s0>zip</s0></a> &#x2237; [a] &#x2192; [b] &#x2192; [(a, b)]</span><div class='hoogle-doc'></div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/LambdaHack/docs/Game-LambdaHack-Common-Prelude.html#v:zip'><s0>zip</s0></a> &#x2237; () &#x21D2; [a] &#x2192; [b] &#x2192; [(a, b)]</span><div class='hoogle-doc'><a>zip</a> 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",
@@ -2125,6 +2167,8 @@
        "</div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/unliftio/docs/UnliftIO-Async.html#v:concurrently'><s0>concurrently</s0></a> &#x2237; MonadUnliftIO m &#x21D2; m a &#x2192; m b &#x2192; m (a, b)</span><div class='hoogle-doc'>Unlifted <a>concurrently</a>.\n",
        "</div>\n",
+       "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/stack/docs/Stack-Prelude.html#v:concurrently'><s0>concurrently</s0></a> &#x2237; MonadUnliftIO m &#x21D2; m a &#x2192; m b &#x2192; m (a, b)</span><div class='hoogle-doc'>Unlifted <a>concurrently</a>.\n",
+       "</div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/yesod-websockets/docs/Yesod-WebSockets.html#v:concurrently'><s0>concurrently</s0></a> &#x2237; MonadUnliftIO m &#x21D2; m a &#x2192; m b &#x2192; m (a, b)</span><div class='hoogle-doc'>Unlifted <a>concurrently</a>.\n",
        "</div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/EdisonAPI/docs/Data-Edison-Seq.html#v:zip'><s0>zip</s0></a> &#x2237; Sequence s &#x21D2; s a &#x2192; s b &#x2192; s (a, b)</span><div class='hoogle-doc'>Combine two sequences into a sequence of pairs. If the sequences are\n",
@@ -2148,6 +2192,7 @@
        "</div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/EdisonCore/docs/Data-Edison-Seq-Defaults.html#v:zipUsingLview'><s0>zipUsingLview</s0></a> &#x2237; Sequence s &#x21D2; s a &#x2192; s b &#x2192; s (a, b)</span><div class='hoogle-doc'></div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/EdisonCore/docs/Data-Edison-Seq-Defaults.html#v:zipUsingLists'><s0>zipUsingLists</s0></a> &#x2237; Sequence s &#x21D2; s a &#x2192; s b &#x2192; s (a, b)</span><div class='hoogle-doc'></div>\n",
+       "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/adjunctions/docs/Data-Functor-Rep.html#v:mzipRep'><s0>mzipRep</s0></a> &#x2237; Representable f &#x21D2; f a &#x2192; f b &#x2192; f (a, b)</span><div class='hoogle-doc'></div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/concurrency/docs/Control-Concurrent-Classy-Async.html#v:concurrently'><s0>concurrently</s0></a> &#x2237; MonadConc m &#x21D2; m a &#x2192; m b &#x2192; m (a, b)</span><div class='hoogle-doc'>Run two <tt>MonadConc</tt> actions concurrently, and return both\n",
        "results. If either action throws an exception at any time, then the\n",
        "other action is <a>cancel</a>led, and the exception is re-thrown by\n",
@@ -2160,7 +2205,6 @@
        "waitBoth a b\n",
        "</pre>\n",
        "</div>\n",
-       "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/adjunctions/docs/Data-Functor-Rep.html#v:mzipRep'><s0>mzipRep</s0></a> &#x2237; Representable f &#x21D2; f a &#x2192; f b &#x2192; f (a, b)</span><div class='hoogle-doc'></div>\n",
        "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-HigherKinded-Class.html#v:box'><s0>box</s0></a> &#x2237; Graph g &#x21D2; g a &#x2192; g b &#x2192; g (a, b)</span><div class='hoogle-doc'>Compute the <i>Cartesian product</i> of graphs. Complexity: <i>O(s1 *\n",
        "s2)</i> time, memory and size, where <i>s1</i> and <i>s2</i> are the\n",
        "sizes of the given graphs.\n",
@@ -2624,12 +2668,58 @@
        "zip [] _|_ = []\n",
        "</pre>\n",
        "\n",
+       "<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
+       "URL: https://hackage.haskell.org/package/mixed-types-num/docs/Numeric-MixedTypes-PreludeHiding.html#v:zip\n",
+       "<a>zip</a> takes two lists and returns a list of corresponding pairs.\n",
+       "\n",
+       "<pre>\n",
+       "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
+       "</pre>\n",
+       "\n",
+       "If one input list is short, excess elements of the longer list are\n",
+       "discarded:\n",
+       "\n",
+       "<pre>\n",
+       "zip [1] ['a', 'b'] = [(1, 'a')]\n",
+       "zip [1, 2] ['a'] = [(1, 'a')]\n",
+       "</pre>\n",
+       "\n",
+       "<a>zip</a> is right-lazy:\n",
+       "\n",
+       "<pre>\n",
+       "zip [] _|_ = []\n",
+       "zip _|_ [] = _|_\n",
+       "</pre>\n",
+       "\n",
        "<s0>zip</s0> :: [a] -> [b] -> [(a, b)]\n",
        "URL: https://hackage.haskell.org/package/prelude-compat/docs/Data-List2010.html#v:zip\n",
        "\n",
        "<s0>zip</s0> :: [a] -> [b] -> [(a, b)]\n",
        "URL: https://hackage.haskell.org/package/prelude-compat/docs/Prelude2010.html#v:zip\n",
        "\n",
+       "<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
+       "URL: https://hackage.haskell.org/package/stack/docs/Stack-Prelude.html#v:zip\n",
+       "<a>zip</a> takes two lists and returns a list of corresponding pairs.\n",
+       "\n",
+       "<pre>\n",
+       "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
+       "</pre>\n",
+       "\n",
+       "If one input list is short, excess elements of the longer list are\n",
+       "discarded:\n",
+       "\n",
+       "<pre>\n",
+       "zip [1] ['a', 'b'] = [(1, 'a')]\n",
+       "zip [1, 2] ['a'] = [(1, 'a')]\n",
+       "</pre>\n",
+       "\n",
+       "<a>zip</a> is right-lazy:\n",
+       "\n",
+       "<pre>\n",
+       "zip [] _|_ = []\n",
+       "zip _|_ [] = _|_\n",
+       "</pre>\n",
+       "\n",
        "<s0>zip</s0> :: [a] -> [b] -> [(a, b)]\n",
        "URL: https://hackage.haskell.org/package/EdisonAPI/docs/Data-Edison-Seq-ListSeq.html#v:zip\n",
        "\n",
@@ -2763,6 +2853,10 @@
        "Unlifted <a>concurrently</a>.\n",
        "\n",
        "<s0>concurrently</s0> :: MonadUnliftIO m => m a -> m b -> m (a, b)\n",
+       "URL: https://hackage.haskell.org/package/stack/docs/Stack-Prelude.html#v:concurrently\n",
+       "Unlifted <a>concurrently</a>.\n",
+       "\n",
+       "<s0>concurrently</s0> :: MonadUnliftIO m => m a -> m b -> m (a, b)\n",
        "URL: https://hackage.haskell.org/package/yesod-websockets/docs/Yesod-WebSockets.html#v:concurrently\n",
        "Unlifted <a>concurrently</a>.\n",
        "\n",
@@ -2793,6 +2887,9 @@
        "<s0>zipUsingLists</s0> :: Sequence s => s a -> s b -> s (a, b)\n",
        "URL: https://hackage.haskell.org/package/EdisonCore/docs/Data-Edison-Seq-Defaults.html#v:zipUsingLists\n",
        "\n",
+       "<s0>mzipRep</s0> :: 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",
        "<s0>concurrently</s0> :: 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 <tt>MonadConc</tt> actions concurrently, and return both\n",
@@ -2807,9 +2904,6 @@
        "waitBoth a b\n",
        "</pre>\n",
        "\n",
-       "<s0>mzipRep</s0> :: 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",
        "<s0>box</s0> :: Graph g => g a -> g b -> g (a, b)\n",
        "URL: https://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-HigherKinded-Class.html#v:box\n",
        "Compute the <i>Cartesian product</i> of graphs. Complexity: <i>O(s1 *\n",