Skip to content

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

notebooks/IHaskell.ipynb: update

parent 60fceecc
Hide whitespace changes
Inline Side-by-side
Showing with 65 additions and 43 deletions
notebooks/IHaskell.ipynb
View file @ 5086d082
...@@ -1957,13 +1957,24 @@ ...@@ -1957,13 +1957,24 @@
"</pre>\n", "</pre>\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", "<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",
"\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/xmonad-contrib/docs/XMonad-Config-Prime.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/xmonad-contrib/docs/XMonad-Config-Prime.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",
...@@ -2030,28 +2041,27 @@ ...@@ -2030,28 +2041,27 @@
"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/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",
"\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",
"<a>zip</a> is right-lazy:\n",
"\n", "\n",
"<pre>\n", "<pre>\n",
"zip [1] ['a', 'b'] = [(1, 'a')]\n", "zip [] _|_ = []\n",
"zip [1, 2] ['a'] = [(1, 'a')]\n",
"</pre>\n", "</pre>\n",
"</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",
"discarded.\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/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",
...@@ -2243,13 +2253,6 @@ ...@@ -2243,13 +2253,6 @@
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/List/docs/Data-List-Class.html#v:zip'><s0>zip</s0></a> &#x2237; List l &#x21D2; l a &#x2192; l b &#x2192; l (a, b)</span><div class='hoogle-doc'></div>\n", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/List/docs/Data-List-Class.html#v:zip'><s0>zip</s0></a> &#x2237; List l &#x21D2; l a &#x2192; l b &#x2192; l (a, b)</span><div class='hoogle-doc'></div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/size-based/docs/Control-Sized.html#v:pair'><s0>pair</s0></a> &#x2237; Sized f &#x21D2; f a &#x2192; f b &#x2192; f (a, b)</span><div class='hoogle-doc'>Default: <tt>pair a b = (,) <a>$</a> a <a>*</a> b</tt>.\n", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/size-based/docs/Control-Sized.html#v:pair'><s0>pair</s0></a> &#x2237; Sized f &#x21D2; f a &#x2192; f b &#x2192; f (a, b)</span><div class='hoogle-doc'>Default: <tt>pair a b = (,) <a>$</a> a <a>*</a> b</tt>.\n",
"</div>\n", "</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/vector/docs/Data-Vector-Generic.html#v:zip'><s0>zip</s0></a> &#x2237; (Vector v a, Vector v b, Vector v (a, b)) &#x21D2; v a &#x2192; v b &#x2192; v (a, b)</span><div class='hoogle-doc'><i>O(min(m,n))</i> Zip two vectors\n",
"</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/statistics/docs/Statistics-Sample.html#v:pair'><s0>pair</s0></a> &#x2237; (Vector v a, Vector v b, Vector v (a, b)) &#x21D2; v a &#x2192; v b &#x2192; v (a, b)</span><div class='hoogle-doc'>Pair two samples. It's like <a>zip</a> but requires that both samples\n",
"have equal size.\n",
"</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/rio/docs/RIO-Vector.html#v:zip'><s0>zip</s0></a> &#x2237; (Vector v a, Vector v b, Vector v (a, b)) &#x21D2; v a &#x2192; v b &#x2192; v (a, b)</span><div class='hoogle-doc'><i>O(min(m,n))</i> Zip two vectors\n",
"</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/classy-prelude/docs/ClassyPrelude.html#v:zip'><s0>zip</s0></a> &#x2237; Zip 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/classy-prelude/docs/ClassyPrelude.html#v:zip'><s0>zip</s0></a> &#x2237; Zip 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/non-empty/docs/Data-NonEmpty-Class.html#v:zip'><s0>zip</s0></a> &#x2237; Zip 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/non-empty/docs/Data-NonEmpty-Class.html#v:zip'><s0>zip</s0></a> &#x2237; Zip 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/keys/docs/Data-Key.html#v:zip'><s0>zip</s0></a> &#x2237; Zip 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/keys/docs/Data-Key.html#v:zip'><s0>zip</s0></a> &#x2237; Zip f &#x21D2; f a &#x2192; f b &#x2192; f (a, b)</span><div class='hoogle-doc'></div>\n",
...@@ -2273,6 +2276,13 @@ ...@@ -2273,6 +2276,13 @@
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/invertible/docs/Control-Invertible-Monoidal.html#v:-62--42--60-'>(<s0>>*<</s0>)</a> &#x2237; Monoidal f &#x21D2; f a &#x2192; f b &#x2192; f (a, b)</span><div class='hoogle-doc'>Merge two functors into a tuple, analogous to <tt><a>liftA2</a>\n", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/invertible/docs/Control-Invertible-Monoidal.html#v:-62--42--60-'>(<s0>>*<</s0>)</a> &#x2237; Monoidal f &#x21D2; f a &#x2192; f b &#x2192; f (a, b)</span><div class='hoogle-doc'>Merge two functors into a tuple, analogous to <tt><a>liftA2</a>\n",
"(,)</tt>. (Sometimes known as <tt>**</tt>.)\n", "(,)</tt>. (Sometimes known as <tt>**</tt>.)\n",
"</div>\n", "</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/vector/docs/Data-Vector-Generic.html#v:zip'><s0>zip</s0></a> &#x2237; (Vector v a, Vector v b, Vector v (a, b)) &#x21D2; v a &#x2192; v b &#x2192; v (a, b)</span><div class='hoogle-doc'><i>O(min(m,n))</i> Zip two vectors\n",
"</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/statistics/docs/Statistics-Sample.html#v:pair'><s0>pair</s0></a> &#x2237; (Vector v a, Vector v b, Vector v (a, b)) &#x21D2; v a &#x2192; v b &#x2192; v (a, b)</span><div class='hoogle-doc'>Pair two samples. It's like <a>zip</a> but requires that both samples\n",
"have equal size.\n",
"</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/rio/docs/RIO-Vector.html#v:zip'><s0>zip</s0></a> &#x2237; (Vector v a, Vector v b, Vector v (a, b)) &#x21D2; v a &#x2192; v b &#x2192; v (a, b)</span><div class='hoogle-doc'><i>O(min(m,n))</i> Zip two vectors\n",
"</div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/base/docs/Control-Monad-Zip.html#v:mzip'><s0>mzip</s0></a> &#x2237; MonadZip m &#x21D2; m a &#x2192; m b &#x2192; m (a, b)</span><div class='hoogle-doc'></div>\n", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/base/docs/Control-Monad-Zip.html#v:mzip'><s0>mzip</s0></a> &#x2237; MonadZip m &#x21D2; m a &#x2192; m b &#x2192; m (a, b)</span><div class='hoogle-doc'></div>\n",
"<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/relational-query/docs/Database-Relational-Arrow.html#v:projectZip'><s0>projectZip</s0></a> &#x2237; ProductIsoApplicative p &#x21D2; p a &#x2192; p b &#x2192; p (a, b)</span><div class='hoogle-doc'>Zipping projections.\n", "<span class='hoogle-name'><a target='_blank' href='https://hackage.haskell.org/package/relational-query/docs/Database-Relational-Arrow.html#v:projectZip'><s0>projectZip</s0></a> &#x2237; ProductIsoApplicative p &#x21D2; p a &#x2192; p b &#x2192; p (a, b)</span><div class='hoogle-doc'>Zipping projections.\n",
"</div>\n", "</div>\n",
...@@ -2608,13 +2618,24 @@ ...@@ -2608,13 +2618,24 @@
"<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", "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",
"\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",
...@@ -2694,30 +2715,31 @@ ...@@ -2694,30 +2715,31 @@
"</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/LambdaHack/docs/Game-LambdaHack-Common-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",
"discarded.\n",
"\n",
"<a>zip</a> is right-lazy:\n",
"\n", "\n",
"<pre>\n", "<pre>\n",
"zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]\n", "zip [] _|_ = []\n",
"</pre>\n", "</pre>\n",
"\n", "\n",
"<s0>zip</s0> :: () => [a] -> [b] -> [(a, b)]\n",
"URL: https://hackage.haskell.org/package/LambdaHack/docs/Game-LambdaHack-Common-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", "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",
"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",
...@@ -2956,19 +2978,6 @@ ...@@ -2956,19 +2978,6 @@
"URL: https://hackage.haskell.org/package/size-based/docs/Control-Sized.html#v:pair\n", "URL: https://hackage.haskell.org/package/size-based/docs/Control-Sized.html#v:pair\n",
"Default: <tt>pair a b = (,) <a>$</a> a <a>*</a> b</tt>.\n", "Default: <tt>pair a b = (,) <a>$</a> a <a>*</a> b</tt>.\n",
"\n", "\n",
"<s0>zip</s0> :: (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",
"<i>O(min(m,n))</i> Zip two vectors\n",
"\n",
"<s0>pair</s0> :: (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 <a>zip</a> but requires that both samples\n",
"have equal size.\n",
"\n",
"<s0>zip</s0> :: (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",
"<i>O(min(m,n))</i> Zip two vectors\n",
"\n",
"<s0>zip</s0> :: Zip f => f a -> f b -> f (a, b)\n", "<s0>zip</s0> :: Zip f => f a -> f b -> f (a, b)\n",
"URL: https://hackage.haskell.org/package/classy-prelude/docs/ClassyPrelude.html#v:zip\n", "URL: https://hackage.haskell.org/package/classy-prelude/docs/ClassyPrelude.html#v:zip\n",
"\n", "\n",
...@@ -3004,6 +3013,19 @@ ...@@ -3004,6 +3013,19 @@
"Merge two functors into a tuple, analogous to <tt><a>liftA2</a>\n", "Merge two functors into a tuple, analogous to <tt><a>liftA2</a>\n",
"(,)</tt>. (Sometimes known as <tt>**</tt>.)\n", "(,)</tt>. (Sometimes known as <tt>**</tt>.)\n",
"\n", "\n",
"<s0>zip</s0> :: (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",
"<i>O(min(m,n))</i> Zip two vectors\n",
"\n",
"<s0>pair</s0> :: (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 <a>zip</a> but requires that both samples\n",
"have equal size.\n",
"\n",
"<s0>zip</s0> :: (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",
"<i>O(min(m,n))</i> Zip two vectors\n",
"\n",
"<s0>mzip</s0> :: MonadZip m => m a -> m b -> m (a, b)\n", "<s0>mzip</s0> :: 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", "URL: https://hackage.haskell.org/package/base/docs/Control-Monad-Zip.html#v:mzip\n",
"\n", "\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