Skip to content

G
gargantext-ihaskell
Commit df3c0fc1 authored by Vaibhav Sagar's avatar Vaibhav Sagar
Browse files
Options

notebooks/IHaskell.ipynb: update

parent 764bdfea
Hide whitespace changes
Inline Side-by-side
Showing with 75 additions and 75 deletions
notebooks/IHaskell.ipynb
View file @ df3c0fc1
...@@ -1980,16 +1980,6 @@ ...@@ -1980,16 +1980,6 @@
"part of the tuple exponentially more frequently. This mainly exists as\n", "part of the tuple exponentially more frequently. This mainly exists as\n",
"a specification to test against.\n", "a specification to test against.\n",
"</div>\n", "</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/llvm-hs-pure/docs/LLVM-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",
"discarded.\n",
"\n",
"<a>zip</a> is right-lazy:\n",
"\n",
"<pre>\n",
"zip [] _|_ = []\n",
"</pre>\n",
"</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/universum/docs/Universum-List-Reexport.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", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/universum/docs/Universum-List-Reexport.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", "\n",
"<pre>\n", "<pre>\n",
...@@ -2011,7 +2001,7 @@ ...@@ -2011,7 +2001,7 @@
"zip _|_ [] = _|_\n", "zip _|_ [] = _|_\n",
"</pre>\n", "</pre>\n",
"</div>\n", "</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/haxl/docs/Haxl-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", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/llvm-hs-pure/docs/LLVM-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", "If one input list is short, excess elements of the longer list are\n",
"discarded.\n", "discarded.\n",
"\n", "\n",
...@@ -2021,25 +2011,14 @@ ...@@ -2021,25 +2011,14 @@
"zip [] _|_ = []\n", "zip [] _|_ = []\n",
"</pre>\n", "</pre>\n",
"</div>\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", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/haxl/docs/Haxl-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", "If one input list is short, excess elements of the longer list are\n",
"discarded:\n", "discarded.\n",
"\n",
"<pre>\n",
"zip [1] ['a', 'b'] = [(1, 'a')]\n",
"zip [1, 2] ['a'] = [(1, 'a')]\n",
"</pre>\n",
"\n", "\n",
"<a>zip</a> is right-lazy:\n", "<a>zip</a> is right-lazy:\n",
"\n", "\n",
"<pre>\n", "<pre>\n",
"zip [] _|_ = []\n", "zip [] _|_ = []\n",
"zip _|_ [] = _|_\n",
"</pre>\n", "</pre>\n",
"</div>\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/Data-List2010.html#v:zip'><s0>zip</s0></a> &#x2237; [a] &#x2192; [b] &#x2192; [(a, b)]</span><div class='hoogle-doc'></div>\n",
...@@ -2086,7 +2065,7 @@ ...@@ -2086,7 +2065,7 @@
"zip [] _|_ = []\n", "zip [] _|_ = []\n",
"</pre>\n", "</pre>\n",
"</div>\n", "</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/intro/docs/Intro.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", "<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", "\n",
"<pre>\n", "<pre>\n",
"zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n", "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
...@@ -2107,24 +2086,25 @@ ...@@ -2107,24 +2086,25 @@
"zip _|_ [] = _|_\n", "zip _|_ [] = _|_\n",
"</pre>\n", "</pre>\n",
"</div>\n", "</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/yesod-paginator/docs/Yesod-Paginator-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", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/intro/docs/Intro.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",
"discarded.\n",
"\n",
"<a>zip</a> is right-lazy:\n",
"\n", "\n",
"<pre>\n", "<pre>\n",
"zip [] _|_ = []\n", "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
"</pre>\n", "</pre>\n",
"</div>\n", "\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/hledger-web/docs/Hledger-Web-Import.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", "If one input list is short, excess elements of the longer list are\n",
"discarded.\n", "discarded:\n",
"\n",
"<pre>\n",
"zip [1] ['a', 'b'] = [(1, 'a')]\n",
"zip [1, 2] ['a'] = [(1, 'a')]\n",
"</pre>\n",
"\n", "\n",
"<a>zip</a> is right-lazy:\n", "<a>zip</a> is right-lazy:\n",
"\n", "\n",
"<pre>\n", "<pre>\n",
"zip [] _|_ = []\n", "zip [] _|_ = []\n",
"zip _|_ [] = _|_\n",
"</pre>\n", "</pre>\n",
"</div>\n", "</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/relude/docs/Relude-List-Reexport.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", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/relude/docs/Relude-List-Reexport.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",
...@@ -2148,6 +2128,26 @@ ...@@ -2148,6 +2128,26 @@
"zip _|_ [] = _|_\n", "zip _|_ [] = _|_\n",
"</pre>\n", "</pre>\n",
"</div>\n", "</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/yesod-paginator/docs/Yesod-Paginator-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",
"discarded.\n",
"\n",
"<a>zip</a> is right-lazy:\n",
"\n",
"<pre>\n",
"zip [] _|_ = []\n",
"</pre>\n",
"</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/hledger-web/docs/Hledger-Web-Import.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",
"discarded.\n",
"\n",
"<a>zip</a> is right-lazy:\n",
"\n",
"<pre>\n",
"zip [] _|_ = []\n",
"</pre>\n",
"</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/ghc/docs/Util.html#v:zipLazy'><s0>zipLazy</s0></a> &#x2237; [a] &#x2192; [b] &#x2192; [(a, b)]</span><div class='hoogle-doc'><a>zipLazy</a> is a kind of <a>zip</a> that is lazy in the second list\n", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/ghc/docs/Util.html#v:zipLazy'><s0>zipLazy</s0></a> &#x2237; [a] &#x2192; [b] &#x2192; [(a, b)]</span><div class='hoogle-doc'><a>zipLazy</a> is a kind of <a>zip</a> that is lazy in the second list\n",
"(observe the ~)\n", "(observe the ~)\n",
"</div>\n", "</div>\n",
...@@ -2192,7 +2192,6 @@ ...@@ -2192,7 +2192,6 @@
"</div>\n", "</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: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/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", "<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", "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", "other action is <a>cancel</a>led, and the exception is re-thrown by\n",
...@@ -2205,6 +2204,7 @@ ...@@ -2205,6 +2204,7 @@
"waitBoth a b\n", "waitBoth a b\n",
"</pre>\n", "</pre>\n",
"</div>\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", "<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", "s2)</i> time, memory and size, where <i>s1</i> and <i>s2</i> are the\n",
"sizes of the given graphs.\n", "sizes of the given graphs.\n",
...@@ -2622,18 +2622,6 @@ ...@@ -2622,18 +2622,6 @@
"a specification to test against.\n", "a specification to test against.\n",
"\n", "\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n", "<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/llvm-hs-pure/docs/LLVM-Prelude.html#v:zip\n",
"<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",
"discarded.\n",
"\n",
"<a>zip</a> is right-lazy:\n",
"\n",
"<pre>\n",
"zip [] _|_ = []\n",
"</pre>\n",
"\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/universum/docs/Universum-List-Reexport.html#v:zip\n", "URL: https://hackage.haskell.org/package/universum/docs/Universum-List-Reexport.html#v:zip\n",
"<a>zip</a> takes two lists and returns a list of corresponding pairs.\n", "<a>zip</a> takes two lists and returns a list of corresponding pairs.\n",
"\n", "\n",
...@@ -2657,7 +2645,7 @@ ...@@ -2657,7 +2645,7 @@
"</pre>\n", "</pre>\n",
"\n", "\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n", "<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/haxl/docs/Haxl-Prelude.html#v:zip\n", "URL: https://hackage.haskell.org/package/llvm-hs-pure/docs/LLVM-Prelude.html#v:zip\n",
"<a>zip</a> takes two lists and returns a list of corresponding pairs.\n", "<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", "If one input list is short, excess elements of the longer list are\n",
"discarded.\n", "discarded.\n",
...@@ -2669,26 +2657,15 @@ ...@@ -2669,26 +2657,15 @@
"</pre>\n", "</pre>\n",
"\n", "\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\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", "URL: https://hackage.haskell.org/package/haxl/docs/Haxl-Prelude.html#v:zip\n",
"<a>zip</a> takes two lists and returns a list of corresponding pairs.\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", "If one input list is short, excess elements of the longer list are\n",
"discarded:\n", "discarded.\n",
"\n",
"<pre>\n",
"zip [1] ['a', 'b'] = [(1, 'a')]\n",
"zip [1, 2] ['a'] = [(1, 'a')]\n",
"</pre>\n",
"\n", "\n",
"<a>zip</a> is right-lazy:\n", "<a>zip</a> is right-lazy:\n",
"\n", "\n",
"<pre>\n", "<pre>\n",
"zip [] _|_ = []\n", "zip [] _|_ = []\n",
"zip _|_ [] = _|_\n",
"</pre>\n", "</pre>\n",
"\n", "\n",
"<s0>zip</s0> :: [a] -> [b] -> [(a, b)]\n", "<s0>zip</s0> :: [a] -> [b] -> [(a, b)]\n",
...@@ -2748,7 +2725,7 @@ ...@@ -2748,7 +2725,7 @@
"</pre>\n", "</pre>\n",
"\n", "\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n", "<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/intro/docs/Intro.html#v:zip\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", "<a>zip</a> takes two lists and returns a list of corresponding pairs.\n",
"\n", "\n",
"<pre>\n", "<pre>\n",
...@@ -2771,27 +2748,26 @@ ...@@ -2771,27 +2748,26 @@
"</pre>\n", "</pre>\n",
"\n", "\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n", "<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/yesod-paginator/docs/Yesod-Paginator-Prelude.html#v:zip\n", "URL: https://hackage.haskell.org/package/intro/docs/Intro.html#v:zip\n",
"<a>zip</a> takes two lists and returns a list of corresponding pairs.\n", "<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",
"discarded.\n",
"\n",
"<a>zip</a> is right-lazy:\n",
"\n", "\n",
"<pre>\n", "<pre>\n",
"zip [] _|_ = []\n", "zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n",
"</pre>\n", "</pre>\n",
"\n", "\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/hledger-web/docs/Hledger-Web-Import.html#v:zip\n",
"<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", "If one input list is short, excess elements of the longer list are\n",
"discarded.\n", "discarded:\n",
"\n",
"<pre>\n",
"zip [1] ['a', 'b'] = [(1, 'a')]\n",
"zip [1, 2] ['a'] = [(1, 'a')]\n",
"</pre>\n",
"\n", "\n",
"<a>zip</a> is right-lazy:\n", "<a>zip</a> is right-lazy:\n",
"\n", "\n",
"<pre>\n", "<pre>\n",
"zip [] _|_ = []\n", "zip [] _|_ = []\n",
"zip _|_ [] = _|_\n",
"</pre>\n", "</pre>\n",
"\n", "\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n", "<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
...@@ -2817,6 +2793,30 @@ ...@@ -2817,6 +2793,30 @@
"zip _|_ [] = _|_\n", "zip _|_ [] = _|_\n",
"</pre>\n", "</pre>\n",
"\n", "\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/yesod-paginator/docs/Yesod-Paginator-Prelude.html#v:zip\n",
"<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",
"discarded.\n",
"\n",
"<a>zip</a> is right-lazy:\n",
"\n",
"<pre>\n",
"zip [] _|_ = []\n",
"</pre>\n",
"\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/hledger-web/docs/Hledger-Web-Import.html#v:zip\n",
"<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",
"discarded.\n",
"\n",
"<a>zip</a> is right-lazy:\n",
"\n",
"<pre>\n",
"zip [] _|_ = []\n",
"</pre>\n",
"\n",
"<s0>zipLazy</s0> :: [a] -> [b] -> [(a, b)]\n", "<s0>zipLazy</s0> :: [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/ghc/docs/Util.html#v:zipLazy\n", "URL: https://hackage.haskell.org/package/ghc/docs/Util.html#v:zipLazy\n",
"<a>zipLazy</a> is a kind of <a>zip</a> that is lazy in the second list\n", "<a>zipLazy</a> is a kind of <a>zip</a> that is lazy in the second list\n",
...@@ -2887,9 +2887,6 @@ ...@@ -2887,9 +2887,6 @@
"<s0>zipUsingLists</s0> :: Sequence s => s a -> s b -> s (a, b)\n", "<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", "URL: https://hackage.haskell.org/package/EdisonCore/docs/Data-Edison-Seq-Defaults.html#v:zipUsingLists\n",
"\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", "<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", "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", "Run two <tt>MonadConc</tt> actions concurrently, and return both\n",
...@@ -2904,6 +2901,9 @@ ...@@ -2904,6 +2901,9 @@
"waitBoth a b\n", "waitBoth a b\n",
"</pre>\n", "</pre>\n",
"\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", "<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", "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", "Compute the <i>Cartesian product</i> of graphs. Complexity: <i>O(s1 *\n",
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment