Mo7art/Stack2Graph_VD_haskell · Datasets at Hugging Face

chunk_id large_stringlengths 7 11 ⌀	question_id large_stringlengths 4 8	language large_stringclasses 1 value	chunk_index int64 0 6 ⌀	chunk_text large_stringlengths 127 3.8k ⌀	sparse_text large_stringlengths 120 5.55k	dense_vector listlengths 3.58k 3.58k ⌀	sparse_indices listlengths 2 238 ⌀	sparse_values listlengths 2 238 ⌀	export_source large_stringclasses 1 value
42723689_c0	42723689	haskell	0	Title: How can I find the smallest of 3 integers in Haskell? Problem title: How can I find the smallest of 3 integers in Haskell? Tags: haskell Problem: How can I find the smallest of 3 integers in Haskell? As a beginner in Haskell I am trying to write a code to find the smallest number out of 3 integers. This is what ...	How can I find the smallest of 3 integers in Haskell? How can I find the smallest of 3 integers in Haskell? haskell How Haskell How can I find the smallest of 3 integers in Haskell? As a beginner in Haskell I am trying to write a code to find the smallest number out of 3 integers. This is what I have so far. Can anyone...	[ -0.00885009765625, -0.00171661376953125, 0.033203125, 0.007354736328125, -0.006500244140625, 0.01904296875, 0.01226806640625, -0.02197265625, 0.0089111328125, -0.0225830078125, -0.01336669921875, -0.0263671875, 0.00830078125, 0.0126953125, -0.00115966796875, 0.0020751953125, -0.00227...	[ 11249, 831, 7413, 70, 19336, 525, 111, 138, 892, 26255, 23, 20625, 142508, 87, 1556, 9842, 1679, 31577, 33022, 18151, 14012, 1810, 765, 2060, 25944, 48225 ]	[ 0.06597900390625, 0.052642822265625, 0.09344482421875, 0.052642822265625, 0.160888671875, 0.171875, 0.046630859375, 0.177978515625, 0.1302490234375, 0.1409912109375, 0.0667724609375, 0.12939453125, 0.2115478515625, 0.0169219970703125, 0.09674072265625, 0.025909423828125, 0.0359497070...	embed
40099927_c0	40099927	haskell	0	Title: How do I define an anonymous recursive function? Problem title: How do I define an anonymous recursive function? Tags: haskell Problem: How do I define an anonymous recursive function? One can define an anonymous function with a lambda expression: -- Contrived example > apply f x = f x > apply (\n -> n + 1) 3 4 ...	How do I define an anonymous recursive function? How do I define an anonymous recursive function? haskell How Contrived How do I define an anonymous recursive function? One can define an anonymous function with a lambda expression: but is it possible to define an anonymous recursive function?	[ -0.00016689300537109375, 0.00799560546875, 0.0118408203125, 0.006866455078125, 0.0223388671875, 0.004364013671875, 0.01043701171875, 0.00830078125, 0.00156402587890625, -0.033447265625, 0.000820159912109375, -0.00958251953125, -0.013671875, 0.022216796875, 0.026611328125, -0.0031585693...	[ 87, 61924, 52184, 10821, 195625, 5844, 32354, 11249, 54, 142, 1556, 142508, 111809, 4126, 21, 6492, 85, 125195, 7722 ]	[ 0.038787841796875, 0.1844482421875, 0.22216796875, 0.1767578125, 0.1982421875, 0.1597900390625, 0.20703125, 0.036407470703125, 0.0217742919921875, 0.023162841796875, 0.0823974609375, 0.2039794921875, 0.061248779296875, 0.064208984375, 0.0036220550537109375, 0.1256103515625, 0.0903320...	embed
19554984_c0	19554984	haskell	0	Title: Haskell 'count occurrences' function Problem title: Haskell 'count occurrences' function Tags: haskell Problem: Haskell 'count occurrences' function I implemented a count function in Haskell and I am wondering will this behave badly on large lists : count :: Eq a => a -> [a] -> Int count x = ...	Haskell 'count occurrences' function Haskell 'count occurrences' function haskell Haskell Haskell 'count occurrences' function I implemented a count function in Haskell and I am wondering will this behave badly on large lists : I believe the length function runs in linear time, is this correct? Edit...	[ 0.007720947265625, 0.0322265625, 0.004913330078125, -0.0103759765625, 0.01806640625, -0.00125885009765625, -0.0177001953125, 0.002410888671875, 0.01251220703125, -0.0361328125, -0.01007080078125, -0.00543212890625, 0.021484375, 0.0211181640625, -0.00180816650390625, -0.00860595703125, ...	[ 20625, 142508, 3768, 71013, 74918, 42, 69098, 32354, 1556, 29479, 54529, 149016, 1221, 903, 186, 68991, 6494, 21334, 5303, 87, 18822, 140909, 127877, 23, 192617, 1733, 83, 26785, 853, 144810, 42459, 1727 ]	[ 0.15673828125, 0.2457275390625, 0.0830078125, 0.200927734375, 0.19384765625, 0.1573486328125, 0.130615234375, 0.1937255859375, 0.1390380859375, 0.133544921875, 0.23291015625, 0.04449462890625, 0.03814697265625, 0.0362548828125, 0.0206298828125, 0.1385498046875, 0.1209716796875, 0.0...	embed
41501748_c1	41501748	haskell	1	-- Continuation \| isDigit (T.head elem) = "\n" <> textElem <> accu -- Start \| otherwise = accu -- Garbage where textElem = T.strip elem Code signals: Data.Char, Data.Monoid, qualified, System.Environment, System.IO, Haskell, Data.Text, Data.Text.Lazy, Performance, LANGUAGE, OverloadedStrings, Main, Data.Text.Lazy.IO, ...	-- Continuation \| isDigit (T.head elem) = "\n" <> textElem <> accu -- Start \| otherwise = accu -- Garbage where textElem = T.strip elem Code signals: Data.Char, Data.Monoid, qualified, System.Environment, System.IO, Haskell, Data.Text, Data.Text.Lazy, Performance, LANGUAGE, OverloadedStrings, Main, Data.Text.Lazy.IO, ...	[ -0.006256103515625, 0.000362396240234375, -0.0032806396484375, 0.005035400390625, -0.011474609375, 0.01904296875, 0.0179443359375, -0.0029754638671875, 0.0034942626953125, -0.01318359375, -0.01068115234375, 0.002044677734375, -0.016845703125, 0.008056640625, -0.000652313232421875, -0.0...	[ 4210, 50343, 1363, 58745, 83, 14055, 15769, 618, 5, 31251, 88, 195, 16, 2203, 41872, 19, 7986, 7623, 61689, 13794, 6, 120262, 6389, 402, 429, 7440, 384, 59623, 28864, 26073, 7, 12, 11809, 84068, 46674, 48899, 217225, 12353, 686, 1900, 1...	[ 0.063232421875, 0.244873046875, 0.1488037109375, 0.0341796875, 0.1563720703125, 0.147216796875, 0.2431640625, 0.1300048828125, 0.040283203125, 0.2060546875, 0.066650390625, 0.16552734375, 0.00189208984375, 0.06427001953125, 0.08056640625, 0.045166015625, 0.1939697265625, 0.10925292...	embed
9092140_c0	9092140	haskell	0	Title: Hamlet automatic access to variables in scope Problem title: Hamlet automatic access to variables in scope Tags: hamlet, yesod, template-engine, haskell Problem: Hamlet automatic access to variables in scope From the Yesod Book . Hamlet automatically has access to the variables in scope when it's called. There i...	Hamlet automatic access to variables in scope Hamlet automatic access to variables in scope hamlet yesod template-engine haskell Hamlet Hamlet automatic access to variables in scope From the Yesod Book . What is this deep magic? How can it automagically know what variables are in scope?	[ 0.0218505859375, 0.00506591796875, -0.0106201171875, 0.01336669921875, -0.004150390625, 0.017578125, -0.002197265625, 0.01708984375, -0.00640869140625, -0.042724609375, 0.000759124755859375, -0.005157470703125, 0.00482177734375, 0.0184326171875, 0.0225830078125, -0.0111083984375, -0....	[ 10699, 1974, 101038, 17203, 47, 77336, 7, 23, 70820, 2057, 2422, 23722, 110934, 128897, 1556, 142508, 28090, 32635, 2199, 27432, 4865, 83, 903, 53894, 49846, 11249, 831, 442, 1809, 15429, 71407, 3714, 2367, 621 ]	[ 0.1824951171875, 0.235107421875, 0.2283935546875, 0.1656494140625, 0.1142578125, 0.250244140625, 0.0733642578125, 0.08868408203125, 0.2451171875, 0.11663818359375, 0.109375, 0.2005615234375, 0.217041015625, 0.1951904296875, 0.132080078125, 0.2291259765625, 0.009521484375, 0.1308593...	embed
57940965_c1	57940965	haskell	1	Packages (1) pkg-config-0.29.2-1 Total Installed Size: 0.54 MiB Net Upgrade Size: 0.00 MiB Code signals: either, Users, Warning, Please, v1-install, wiki.haskell.org, Cabal, NewBuild, Resolving, Configuring, haskell-gi-base-0.23.0, Failed, Error, haskell-gi-0.23.0-1JHtHU5x2lkFiOcPtWhSw4, haskell-gi-0.23.0, haskell-gi-...	Packages (1) pkg-config-0.29.2-1 Total Installed Size: 0.54 MiB Net Upgrade Size: 0.00 MiB Code signals: either, Users, Warning, Please, v1-install, wiki.haskell.org, Cabal, NewBuild, Resolving, Configuring, haskell-gi-base-0.23.0, Failed, Error, haskell-gi-0.23.0-1JHtHU5x2lkFiOcPtWhSw4, haskell-gi-0.23.0, haskell-gi-...	[ -0.00084686279296875, 0.00592041015625, 0.012939453125, -0.00506591796875, 0.0020904541015625, 0.00531005859375, 0.003662109375, -0.012451171875, 0.00823974609375, 0.04931640625, 0.005218505859375, -0.0322265625, -0.0147705078125, -0.013671875, -0.0191650390625, 0.0224609375, 0.00164...	[ 56607, 52467, 798, 915, 8517, 9, 153837, 23320, 5, 4235, 146971, 33867, 107951, 297, 80378, 12, 81730, 617, 1208, 571, 10086, 10091, 44286, 37509, 28864, 26073, 40101, 53400, 5550, 592, 30607, 81, 20268, 80383, 34356, 10557, 142508, 1478, 3...	[ 0.255859375, 0.1732177734375, 0.114990234375, 0.1197509765625, 0.2587890625, 0.06036376953125, 0.278076171875, 0.103271484375, 0.042572021484375, 0.257080078125, 0.2120361328125, 0.143310546875, 0.2470703125, 0.099609375, 0.1884765625, 0.036376953125, 0.10272216796875, 0.0651855468...	embed
59415953_c0	59415953	haskell	0	Title: How to get source range of AST nodes using megaparsec? Problem title: How to get source range of AST nodes using megaparsec? Tags: megaparsec, haskell Problem: How to get source range of AST nodes using megaparsec? I'm trying to generate a source map for some source file I'm parsing and I want to get the range f...	How to get source range of AST nodes using megaparsec? How to get source range of AST nodes using megaparsec? megaparsec haskell megaparsec How AST How to get source range of AST nodes using megaparsec? I'm trying to generate a source map for some source file I'm parsing and I want to get the range for each node. getSo...	[ -0.0224609375, 0.00982666015625, 0.0213623046875, 0.016357421875, -0.0203857421875, 0.0205078125, -0.01361083984375, -0.00372314453125, -0.0010986328125, -0.012451171875, 0.000690460205078125, 0.0213623046875, 0.0189208984375, 0.0101318359375, 0.0091552734375, -0.005126953125, -0.018...	[ 11249, 47, 2046, 31344, 37457, 111, 48963, 110, 988, 17368, 31534, 2500, 39797, 1556, 142508, 139392, 22288, 11435, 87, 366, 6953, 100, 12638, 112, 211235, 7192, 7, 4734, 76199, 4034, 19069, 19437, 2256, 8447, 316, 6863, 3564 ]	[ 0.05242919921875, 0.023956298828125, 0.09906005859375, 0.2373046875, 0.2347412109375, 0.050994873046875, 0.2052001953125, 0.155517578125, 0.155029296875, 0.048126220703125, 0.15771484375, 0.1385498046875, 0.2080078125, 0.103271484375, 0.19189453125, 0.046661376953125, 0.0783081054687...	embed
13297896_c0	13297896	haskell	0	Title: Is there some directory walker in Haskell? Problem title: Is there some directory walker in Haskell? Tags: directory-traversal, io, haskell Problem: Is there some directory walker in Haskell? Is there some recursive directory walker in Haskell so I could write something like listing <- walkDir "/tmp" I would not...	Is there some directory walker in Haskell? Is there some directory walker in Haskell? directory-traversal io haskell Haskell Is there some directory walker in Haskell? Is there some recursive directory walker in Haskell so I could write something like I would not like to write my own. I can install some dependency from...	[ 0.0103759765625, 0.0064697265625, 0.007781982421875, -0.0038299560546875, 0.00113677978515625, 0.0079345703125, -0.008544921875, -0.027099609375, -0.007232666015625, -0.043701171875, 0.00168609619140625, 0.004852294921875, -0.0052490234375, 0.0042724609375, 0.005126953125, 0.0006599426...	[ 2071, 2685, 3060, 14364, 53, 35691, 56, 23, 20625, 142508, 1517, 814, 2317, 22995, 1556, 195625, 5844, 33022, 1884, 2806, 959, 759, 10002, 831, 20600, 42548, 27771, 109524, 1284, 3444, 41421, 13651, 19713, 29908, 3773 ]	[ 0.03948974609375, 0.049072265625, 0.0889892578125, 0.1787109375, 0.1796875, 0.193359375, 0.2242431640625, 0.0904541015625, 0.154052734375, 0.27099609375, 0.057769775390625, 0.1524658203125, 0.1336669921875, 0.1865234375, 0.146484375, 0.156005859375, 0.106689453125, 0.1011962890625,...	embed
36440246_c0	36440246	haskell	0	Title: Why does Haskell's find always return only one element? Problem title: Why does Haskell's find always return only one element? Tags: haskell Problem: Why does Haskell's find always return only one element? Prelude> find odd [2,4,7,9,11] Just 7 I would expect this to return [7,9,11], as they're all odd ...	Why does Haskell's find always return only one element? Why does Haskell's find always return only one element? haskell Why Haskell Prelude Just Why does Haskell's find always return only one element? I would expect this to return [7,9,11], as they're all odd numbers. Why does find return Just 7 ? Is there an...	[ -0.00168609619140625, 0.0093994140625, 0.00982666015625, -0.00616455078125, -0.001373291015625, 0.03515625, -0.00494384765625, -0.001983642578125, 0.00054931640625, -0.02197265625, 0.01104736328125, -0.02490234375, -0.007659912109375, -0.01611328125, 0.00921630859375, 0.001953125, 0....	[ 44084, 14602, 20625, 142508, 3768, 7413, 11343, 30646, 4734, 1632, 12830, 1556, 1914, 822, 112, 9563, 2806, 41206, 166590, 1662, 756, 70270, 101935, 361, 14192, 32354 ]	[ 0.10662841796875, 0.05804443359375, 0.1436767578125, 0.2529296875, 0.059356689453125, 0.20849609375, 0.1348876953125, 0.1951904296875, 0.1431884765625, 0.17138671875, 0.205078125, 0.1207275390625, 0.0972900390625, 0.1795654296875, 0.1064453125, 0.09857177734375, 0.036590576171875, ...	embed
37681485_c0	37681485	haskell	0	Title: haskell print 10 times input string, do-notation Problem title: haskell print 10 times input string, do-notation Tags: haskell, string, monads Problem: haskell print 10 times input string, do-notation Take input as a string and print it 10 times using do-notation? print10Times :: String -> IO () print10Times nam...	haskell print 10 times input string, do-notation haskell print 10 times input string, do-notation haskell string monads print10Times What haskell print 10 times input string, do-notation Take input as a string and print it 10 times using do-notation?	[ -0.0106201171875, 0.006622314453125, -0.012939453125, 0.0224609375, -0.010986328125, 0.003448486328125, 0.008544921875, -0.01324462890625, -0.026123046875, -0.021728515625, 0.01025390625, -0.029052734375, -0.0185546875, 0.006988525390625, -0.0167236328125, 0.00555419921875, 0.0131225...	[ 1556, 142508, 28412, 209, 20028, 107730, 79315, 54, 9, 157, 22062, 2667, 712, 7, 963, 70059, 4865, 46673, 237, 17368 ]	[ 0.148681640625, 0.2235107421875, 0.20556640625, 0.19970703125, 0.19384765625, 0.166259765625, 0.1719970703125, 0.161376953125, 0.06402587890625, 0.1510009765625, 0.1156005859375, 0.10089111328125, 0.14990234375, 0.08026123046875, 0.150634765625, 0.191162109375, 0.044342041015625, 0...	embed
1900165_c0	1900165	haskell	0	Title: How long does it take to create 1 million threads in Haskell? Problem title: How long does it take to create 1 million threads in Haskell? Tags: multithreading, concurrency, green-threads, haskell Problem: How long does it take to create 1 million threads in Haskell? What I understand, Haskell have green threads...	How long does it take to create 1 million threads in Haskell? How long does it take to create 1 million threads in Haskell? multithreading concurrency green-threads haskell How Haskell How long does it take to create 1 million threads in Haskell? What I understand, Haskell have green threads. But how light weight are t...	[ 0.00848388671875, -0.001953125, -0.00201416015625, 0.0028228759765625, 0.01434326171875, -0.007171630859375, 0.005035400390625, -0.0167236328125, -0.001708984375, -0.056396484375, 0.00848388671875, -0.016357421875, 0.00958251953125, -0.01177978515625, 0.0010833740234375, 0.004547119140...	[ 11249, 4989, 5646, 28282, 106, 19879, 86997, 7, 23, 20625, 142508, 442, 47, 3869, 65847, 11, 108636, 982, 50997, 39116, 1556, 14602, 28219, 765, 3642, 22729, 57888, 7722, 2806, 100, 805, 2445 ]	[ 0.032318115234375, 0.1292724609375, 0.115478515625, 0.1304931640625, 0.1011962890625, 0.2177734375, 0.252197265625, 0.12646484375, 0.060516357421875, 0.164306640625, 0.272705078125, 0.0270538330078125, 0.03863525390625, 0.06231689453125, 0.111083984375, 0.0192718505859375, 0.06494140...	embed
20457354_c1	20457354	haskell	1	16.0 ghc-7.6 ghc-7.6.3 Binaries Libraries Private Data Documentation c2hs Cannot install HTF on osx with cabal I've seen this question regarding installing HTF and errors with cpphs , but it doesn't seem to apply. I did a 100% fresh haskell platform install on two seperate osx machines, and tried to do cabal install ht...	16.0 ghc-7.6 ghc-7.6.3 Binaries Libraries Private Data Documentation c2hs Cannot install HTF on osx with cabal I've seen this question regarding installing HTF and errors with cpphs , but it doesn't seem to apply. I did a 100% fresh haskell platform install on two seperate osx machines, and tried to do cabal install ht...	[ 0.0106201171875, 0.0157470703125, -0.0096435546875, -0.0125732421875, -0.0019989013671875, -0.02099609375, -0.00579833984375, -0.009765625, -0.00104522705078125, -0.00897216796875, -0.011474609375, -0.0380859375, -0.00836181640625, -0.00170135498046875, 0.0135498046875, 0.0030212402343...	[ 6849, 2389, 31380, 238, 180347, 200768, 54092, 165867, 86111, 11809, 43101, 501, 304, 127, 4171, 10869, 20600, 572, 30992, 98, 362, 425, 678, 109524, 18499, 6366, 7, 59911, 3555, 63335, 1556, 142508, 13651, 6626, 143870, 116491, 37842, 9703, ...	[ 0.1595458984375, 0.04425048828125, 0.0811767578125, 0.06640625, 0.1588134765625, 0.1104736328125, 0.1156005859375, 0.1048583984375, 0.109619140625, 0.03887939453125, 0.0797119140625, 0.012359619140625, 0.1116943359375, 0.158935546875, 0.05255126953125, 0.1187744140625, 0.22509765625,...	embed
46270429_c0	46270429	haskell	0	Title: Combining three lists into a list of 3-tuples in Haskell Problem title: Combining three lists into a list of 3-tuples in Haskell Tags: tuples, list, haskell Problem: Combining three lists into a list of 3-tuples in Haskell Code signals: zs, Combining, Haskell, zip3Lists, x:xs, y:ys, z:zs, haskell1.hs:32:33, Occu...	Combining three lists into a list of 3-tuples in Haskell Combining three lists into a list of 3-tuples in Haskell tuples list haskell zs Combining Haskell zip3Lists x:xs y:ys z:zs haskell1.hs:32:33 Occurs Expected Actual Relevant haskell1.hs:32:27 haskell1.hs:32:25 haskell1.hs:32:20 haskell1.hs:32:18 haskell1.hs:32:13 ...	[ -0.00124359130859375, 0.009521484375, -0.0037689208984375, 0.0155029296875, -0.006591796875, 0.00153350830078125, -0.017822265625, -0.009521484375, 0.00579833984375, -0.01251220703125, -0.00946044921875, -0.002655029296875, 0.0234375, 0.0186767578125, -0.017578125, 0.01007080078125, ...	[ 106935, 17262, 5303, 7, 3934, 5691, 458, 99726, 20625, 142508, 370, 1556, 97, 68330, 363, 154663, 4778, 169, 29902, 31191, 48650, 60075, 100582, 133, 27592, 31577, 33022, 32354, 51776, 10750, 28282, 1632, 162738, 1295, 148390, 27781, 116, 138...	[ 0.22021484375, 0.2080078125, 0.2374267578125, 0.03033447265625, 0.0823974609375, 0.166015625, 0.144775390625, 0.2022705078125, 0.130126953125, 0.2139892578125, 0.123046875, 0.1055908203125, 0.03802490234375, 0.165283203125, 0.162109375, 0.219482421875, 0.04302978515625, 0.018890380...	embed
40324583_c0	40324583	haskell	0	Title: Matching types and monads. Error Problem title: Matching types and monads. Error Tags: haskell Problem: Matching types and monads. Error type C = StateT Int (ErrorT String IO) main :: C () main = do args <- liftIO $ getArgs case args of [] -> liftIO $ putStrLn "E" (p:ps) -> s "d" Code signals: Control.Monad.Tran...	Matching types and monads. Error Matching types and monads. Error haskell Control.Monad.Trans.Error Matching Error StateT ErrorT p:ps Couldn Control.Monad.Trans.State.Lazy.StateT Control.Monad.Trans.Error.ErrorT Expected Actual When Matching types and monads. Error I've got the error: I cannot understand why there is a...	[ -0.00714111328125, 0.0072021484375, -0.017578125, 0.00262451171875, 0.00933837890625, -0.00084686279296875, -0.025146484375, -0.014404296875, -0.00872802734375, -0.004974365234375, 0.02392578125, -0.0257568359375, -0.0128173828125, -0.006011962890625, 0.00714111328125, -0.0078735351562...	[ 67407, 214, 52895, 136, 2667, 712, 212059, 7, 1556, 142508, 27131, 46674, 62624, 18468, 31611, 22836, 618, 915, 6423, 191147, 19, 135206, 2729, 3285, 60075, 13, 100582, 14847, 4163, 18499, 53418, 28219, 15400, 2685, 83, 142, 3642, 121461, 4...	[ 0.2249755859375, 0.1297607421875, 0.23779296875, 0.1085205078125, 0.1573486328125, 0.18701171875, 0.1612548828125, 0.0251617431640625, 0.126708984375, 0.2220458984375, 0.1673583984375, 0.1201171875, 0.13427734375, 0.147705078125, 0.06011962890625, 0.1357421875, 0.0565185546875, 0.0...	embed
50431923_c0	50431923	haskell	0	Title: convert monad to IO Problem title: convert monad to IO Tags: haskell, monads Problem: convert monad to IO I'd like to use finally , signature IO a -> IO b -> IO a . However, the operations I wanna use are based on a different monad than IO (namely Servant 's ClientM ). I knew liftIO , but that seems to do the op...	convert monad to IO convert monad to IO haskell monads Servant ClientM convert monad to IO I'd like to use finally , signature IO a -> IO b -> IO a . However, the operations I wanna use are based on a different monad than IO (namely Servant 's ClientM ). I knew liftIO , but that seems to do the opposite -- IO a -> m a ...	[ -0.01513671875, 0.004241943359375, 0.01226806640625, -0.0025787353515625, -0.000873565673828125, 0.0040283203125, 0.00091552734375, -0.01416015625, -0.00213623046875, -0.0164794921875, 0.00970458984375, -0.0198974609375, 0.0216064453125, -0.000919342041015625, 0.01470947265625, -0.0220...	[ 96760, 2667, 712, 47, 17780, 1556, 142508, 5406, 30624, 91732, 594, 87, 71, 1884, 4527, 77681, 138256, 10, 33079, 876, 33306, 41018, 6165, 76, 35509, 98, 12921, 3501, 55950, 60520, 4, 1284, 37202, 70, 198274, 347, 11249, 831, 27198, 7, ...	[ 0.1759033203125, 0.172119140625, 0.2464599609375, 0.14111328125, 0.29248046875, 0.115478515625, 0.2333984375, 0.12939453125, 0.19189453125, 0.202880859375, 0.1478271484375, 0.13232421875, 0.0227813720703125, 0.10015869140625, 0.1116943359375, 0.1219482421875, 0.2315673828125, 0.098...	embed
27641589_c0	27641589	haskell	0	Title: How can I check (through Haskell) is the DLL file managed? Problem title: How can I check (through Haskell) is the DLL file managed? Tags: dll, haskell, .net Problem: How can I check (through Haskell) is the DLL file managed? Directory contains DLL files. Some of them are native , but some of them are managed (i...	How can I check (through Haskell) is the DLL file managed? How can I check (through Haskell) is the DLL file managed? dll haskell .net How Haskell DLL How can I check (through Haskell) is the DLL file managed? Directory contains DLL files. Some of them are native , but some of them are managed (i.e. .NET assemblies). I...	[ -0.007354736328125, 0.01611328125, 0.00811767578125, 0.0186767578125, -0.01611328125, 0.0252685546875, -0.0198974609375, 0.0032196044921875, -0.00994873046875, 0.00238037109375, -0.00787353515625, -0.01104736328125, 0.00970458984375, -0.0038604736328125, -0.0027618408203125, 0.02148437...	[ 11249, 831, 12765, 20625, 142508, 83, 391, 23708, 11435, 145755, 87, 222521, 81717, 1556, 1179, 70, 31068, 53, 70541, 102158, 24, 4935, 17777, 89845, 3871, 2046, 756, 8305 ]	[ 0.046661376953125, 0.0634765625, 0.2103271484375, 0.12548828125, 0.24560546875, 0.0985107421875, 0.09130859375, 0.2462158203125, 0.2003173828125, 0.2218017578125, 0.0345458984375, 0.035797119140625, 0.203369140625, 0.1153564453125, 0.1304931640625, 0.01629638671875, 0.1268310546875, ...	embed
22260435_c0	22260435	haskell	0	Title: Reading String in Haskell Problem title: Reading String in Haskell Tags: haskell Problem: Reading String in Haskell I'm trying to write a function that reads from a String in Haskell, if the String has a number, it should return True. This is what I currently have hasNumber :: String -> Bool hasNumber n = any nu...	Reading String in Haskell Reading String in Haskell haskell Reading Haskell Bool Reading String in Haskell I'm trying to write a function that reads from a String in Haskell, if the String has a number, it should return True. This is what I currently have I have tried lots of functions in the second line but it doesn't...	[ -0.0196533203125, -0.009765625, 0.015625, 0.025146484375, 0.0076904296875, 0.0155029296875, 0.0126953125, -0.0250244140625, 0.000438690185546875, -0.0286865234375, 0.00089263916015625, -0.046630859375, -0.01904296875, 0.01055908203125, -0.0029449462890625, 0.003936767578125, -0.00570...	[ 104951, 23351, 214, 23, 20625, 142508, 1556, 2460, 929, 31577, 33022, 32354, 12301, 1295, 2174, 14012, 5608, 30646, 87599, 82424, 37842, 71358, 17932, 13315, 22027, 18, 48903, 4488, 4358 ]	[ 0.2271728515625, 0.207275390625, 0.14599609375, 0.08612060546875, 0.14208984375, 0.246826171875, 0.1300048828125, 0.12646484375, 0.19970703125, 0.07476806640625, 0.09466552734375, 0.1661376953125, 0.193603515625, 0.1175537109375, 0.04998779296875, 0.1685791015625, 0.03948974609375, ...	embed
33671748_c0	33671748	haskell	0	Title: Reducing this Haskell function Problem title: Reducing this Haskell function Tags: functional-programming, list-comprehension, haskell Problem: Reducing this Haskell function I want to double every second element of a list. Here is the code- doubleSec n [] = [] doubleSec n (x:xs) \| n==1 = x*2 : doubleSec 0 xs \| ...	Reducing this Haskell function Reducing this Haskell function functional-programming list-comprehension haskell Reducing Haskell x:xs Reducing this Haskell function I want to double every second element of a list. Here is the code- How can I compact this logic in a single function?	[ -0.0147705078125, 0.00457763671875, 0.01153564453125, -0.0012664794921875, 0.031494140625, 0.0194091796875, -0.0194091796875, 0.0108642578125, 0.0203857421875, -0.0111083984375, 0.0125732421875, -0.0201416015625, 0.0223388671875, -0.007232666015625, -0.00921630859375, 0.0245361328125, ...	[ 6096, 34, 21896, 903, 20625, 142508, 32354, 123309, 28966, 5303, 4692, 3220, 1556, 1022, 12, 425, 87, 3444, 47, 41929, 11907, 17932, 12830, 18151, 11249, 831, 94928, 62775, 23, 11001 ]	[ 0.1759033203125, 0.149169921875, 0.11907958984375, 0.1290283203125, 0.11700439453125, 0.222900390625, 0.188232421875, 0.1295166015625, 0.061767578125, 0.16259765625, 0.069091796875, 0.08599853515625, 0.097412109375, 0.04583740234375, 0.03564453125, 0.087158203125, 0.00065517425537109...	embed
20279306_c0	20279306	haskell	0	Title: What does (f .) . g mean in Haskell? Problem title: What does (f .) . g mean in Haskell? Tags: haskell, functional-programming, function-composition, pointfree, tacit-programming Problem: What does (f .) . g mean in Haskell? I have seen a lot of functions being defined according to the pattern (f .) . g . For ex...	What does (f .) . g mean in Haskell? What does (f .) . g mean in Haskell? haskell functional-programming function-composition pointfree tacit-programming What Haskell What does (f .) . g mean in Haskell? I have seen a lot of functions being defined according to the pattern (f .) . g . For example: What does this mean?	[ 0.0057373046875, 0.0159912109375, -0.016845703125, 0.005889892578125, -0.01361083984375, 0.008056640625, -0.00469970703125, 0.00604248046875, 0.005523681640625, -0.01806640625, -0.00836181640625, 0.0023956298828125, -0.003509521484375, -0.005859375, -0.02294921875, -0.0074462890625, ...	[ 4865, 14602, 420, 5, 706, 29459, 23, 20625, 142508, 1556, 123309, 28966, 214, 32354, 277, 40322, 6275, 32087, 308, 12645, 16, 51592, 5915, 61924, 59499, 103510, 903 ]	[ 0.05859375, 0.073486328125, 0.164794921875, 0.1671142578125, 0.254638671875, 0.1455078125, 0.0911865234375, 0.167236328125, 0.26123046875, 0.151123046875, 0.14013671875, 0.1217041015625, 0.00946044921875, 0.18701171875, 0.045074462890625, 0.0374755859375, 0.06719970703125, 0.135375...	embed
72706898_c0	72706898	haskell	0	Title: Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? Problem title: Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? Tags: ghc, haskell Problem: Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? ak(a,b) = do if a == 0 then ...	Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? ghc haskell Haskell Parse Possibly Please a-1 Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? While trying to implement the fa...	[ -0.006561279296875, 0.023681640625, -0.020263671875, -0.00077056884765625, -0.0107421875, 0.031982421875, -0.0155029296875, 0.00299072265625, 0.00897216796875, -0.01806640625, 0.0081787109375, -0.022216796875, 0.003387451171875, -0.000766754150390625, 0.017333984375, -0.00946044921875,...	[ 20625, 142508, 2392, 184, 18499, 23, 103510, 10, 20, 106, 115861, 38526, 143434, 132283, 3768, 246, 390, 31380, 238, 1556, 30607, 5759, 29479, 170277, 62, 11050, 5761, 32354, 3034, 103036, 60212, 51042, 1733, 20653, 10548, 7102, 2886, 62607, ...	[ 0.146484375, 0.2415771484375, 0.1629638671875, 0.1502685546875, 0.2208251953125, 0.06451416015625, 0.2459716796875, 0.177001953125, 0.12255859375, 0.15771484375, 0.1475830078125, 0.0855712890625, 0.1583251953125, 0.1837158203125, 0.1260986328125, 0.180908203125, 0.050079345703125, ...	embed
45406239_c0	45406239	haskell	0	Title: Nested Eithers with different error types Problem title: Nested Eithers with different error types Tags: typeclass, either, haskell Problem: Nested Eithers with different error types I have a nested either with different error types, that looks like: Either e1 (Either e2 a) And I'd like a function that does some...	Nested Eithers with different error types Nested Eithers with different error types typeclass either haskell Nested Eithers Either Nested Eithers with different error types I have a nested either with different error types, that looks like: And I'd like a function that does something like: More generally, is there a ty...	[ -0.00262451171875, 0.00946044921875, -0.006011962890625, -0.00982666015625, 0.01470947265625, 0.00921630859375, -0.034912109375, -0.0206298828125, 0.01031494140625, 0.00994873046875, 0.0019989013671875, -0.036865234375, 0.0146484375, 0.0166015625, 0.0034942626953125, -0.006561279296875...	[ 28701, 71, 4565, 9319, 678, 12921, 18499, 52895, 7, 10644, 67413, 40101, 1556, 142508, 87, 765, 8512, 33342, 1884, 32354, 137567, 14858, 90, 903, 103510 ]	[ 0.216064453125, 0.1131591796875, 0.0701904296875, 0.18115234375, 0.07318115234375, 0.172607421875, 0.19091796875, 0.1986083984375, 0.01336669921875, 0.1307373046875, 0.198974609375, 0.193115234375, 0.10235595703125, 0.2039794921875, 0.006988525390625, 0.01116943359375, 0.208129882812...	embed
8191131_c0	8191131	haskell	0	Title: Find the value that failed for quickcheck Problem title: Find the value that failed for quickcheck Tags: quickcheck, haskell Problem: Find the value that failed for quickcheck When a value fails a QuickCheck'd test, I'd like to use it for debugging. Is there any way I can do something like: let failValue = quick...	Find the value that failed for quickcheck Find the value that failed for quickcheck quickcheck haskell Find Find the value that failed for quickcheck When a value fails a QuickCheck'd test, I'd like to use it for debugging. Is there any way I can do something like: If my data was read able then I could probably hack so...	[ -0.00086212158203125, -0.00020599365234375, 0.00738525390625, -0.01507568359375, 0.00567626953125, 0.0167236328125, -0.00494384765625, -0.00732421875, 0.011962890625, 0.00836181640625, 0.0026397705078125, 0.0011749267578125, -0.003204345703125, -0.009521484375, 0.0101318359375, 0.01190...	[ 26040, 34292, 450, 165523, 100, 63773, 78292, 70, 1556, 142508, 35782, 7, 89038, 202567, 3034, 1884, 4527, 8, 978, 36659, 3917, 2053, 12301, 19048, 31895, 85526, 23, 17780, 959 ]	[ 0.1263427734375, 0.174560546875, 0.0794677734375, 0.2147216796875, 0.046142578125, 0.1007080078125, 0.2427978515625, 0.01995849609375, 0.0699462890625, 0.1695556640625, 0.172607421875, 0.04486083984375, 0.10400390625, 0.2349853515625, 0.14404296875, 0.057647705078125, 0.0625, 0.062...	embed
8204511_c1	8204511	haskell	1	I,O] [I,O] it gives me [I,I,O], because it follows: reverse (addC O (reverse x) (reverse y)) reverse (addC O [O,I] [O,I]) But from here, I am confused on how to go about figuring out the addC part. I have the right arguments: a Bigit, and two lists of Bigits. However, I don't understand what pattern to match this to. I...	I,O] [I,O] it gives me [I,I,O], because it follows: reverse (addC O (reverse x) (reverse y)) reverse (addC O [O,I] [O,I]) But from here, I am confused on how to go about figuring out the addC part. I have the right arguments: a Bigit, and two lists of Bigits. However, I don't understand what pattern to match this to. I...	[ -0.0087890625, 0.028564453125, -0.0054931640625, 0.031494140625, -0.0296630859375, 0.001495361328125, 0.0191650390625, -0.0130615234375, 0.03662109375, 0.00726318359375, 0.0030059814453125, -0.0301513671875, -0.006683349609375, 0.0240478515625, -0.0213623046875, -0.022216796875, -0.0...	[ 87, 4, 670, 268, 568, 442, 76199, 163, 6637, 28960, 39531, 184, 4028, 441, 180, 107, 37676, 1022, 113, 55681, 5281, 3642, 1672, 26747, 214, 1810, 15190, 2831, 7108, 10750, 14195, 217, 6626, 5303, 14481, 28219, 103510, 14858, 32233, 2367, ...	[ 0.1234130859375, 0.0634765625, 0.198486328125, 0.04254150390625, 0.11474609375, 0.0819091796875, 0.1395263671875, 0.08245849609375, 0.057037353515625, 0.1168212890625, 0.2177734375, 0.1591796875, 0.1448974609375, 0.1788330078125, 0.1827392578125, 0.00494384765625, 0.1793212890625, ...	embed
59881907_c0	59881907	haskell	0	Title: getting a tuple subset with lens over a ReaderT Problem title: getting a tuple subset with lens over a ReaderT Tags: haskell, lenses, haskell-lens Problem: getting a tuple subset with lens over a ReaderT I would like to play with tuples and lens this way : myfct :: ReaderT (a,b,c,d,e) m a -> ReaderT (a,c,d) m a ...	getting a tuple subset with lens over a ReaderT getting a tuple subset with lens over a ReaderT haskell lenses haskell-lens ReaderT getting a tuple subset with lens over a ReaderT I would like to play with tuples and lens this way : be able to modify the input tuple to a subset of it... pseudo code would be something l...	[ 0.011962890625, -0.00665283203125, 0.001312255859375, 0.0196533203125, -0.02001953125, -0.017822265625, -0.005340576171875, 0.001312255859375, -0.005096435546875, -0.0103759765625, 0.01251220703125, 0.0400390625, -0.010009765625, 0.003082275390625, 0.01116943359375, -0.009765625, -0....	[ 20949, 370, 8705, 1614, 3509, 678, 3098, 7, 645, 122636, 618, 1556, 142508, 96, 47754, 1977, 2806, 1884, 11301, 99726, 136, 903, 3917, 19048, 2811, 40383, 107730, 47, 74189, 18151 ]	[ 0.05474853515625, 0.1072998046875, 0.1861572265625, 0.1646728515625, 0.1861572265625, 0.06817626953125, 0.159912109375, 0.0251617431640625, 0.0491943359375, 0.1881103515625, 0.138427734375, 0.08740234375, 0.1868896484375, 0.0869140625, 0.052947998046875, 0.1448974609375, 0.0054626464...	embed
10328435_c0	10328435	haskell	0	Title: How to solve floating point number getting wrong in list [haskell] Problem title: How to solve floating point number getting wrong in list [haskell] Tags: list, haskell, floating-point Problem: How to solve floating point number getting wrong in list [haskell] Possible Duplicate: Haskell ranges and floats For ex...	How to solve floating point number getting wrong in list [haskell] How to solve floating point number getting wrong in list [haskell] list haskell floating-point How How to solve floating point number getting wrong in list [haskell] For example, when I type I get this: I expected:	[ -0.0120849609375, -0.004547119140625, -0.0023193359375, -0.0164794921875, 0.0067138671875, 0.006591796875, -0.00836181640625, 0.0107421875, 0.004547119140625, 0.00482177734375, -0.0120849609375, -0.020263671875, 0.00732421875, 0.0142822265625, -0.0133056640625, 0.0002422332763671875, ...	[ 11249, 47, 86869, 21917, 26518, 6275, 14012, 20949, 44691, 23, 5303, 10557, 142508, 1556, 38496, 27781, 10644, 87, 2046, 903, 84751 ]	[ 0.05816650390625, 0.0855712890625, 0.212646484375, 0.17626953125, 0.12255859375, 0.16796875, 0.1512451171875, 0.1331787109375, 0.2025146484375, 0.0565185546875, 0.1939697265625, 0.11004638671875, 0.19287109375, 0.1395263671875, 0.1395263671875, 0.00555419921875, 0.1524658203125, 0....	embed
35318562_c0	35318562	haskell	0	Title: What is Levity polymorphism Problem title: What is Levity polymorphism Tags: haskell Problem: What is Levity polymorphism As the title of the question indicates, I want to know what is Levity polymorphism and what is its motivation ? I know this page has some details in it, but most of the explanations there go ...	What is Levity polymorphism What is Levity polymorphism haskell What Levity What is Levity polymorphism As the title of the question indicates, I want to know what is Levity polymorphism and what is its motivation ? I know this page has some details in it, but most of the explanations there go over the top of my head. ...	[ -0.004974365234375, 0.005645751953125, 0.00909423828125, 0.0054931640625, 0.01141357421875, 0.0084228515625, 0.007080078125, 0.00170135498046875, 0.01416015625, -0.01031494140625, 0.016845703125, -0.0498046875, 0.000461578369140625, 0.0205078125, 0.00274658203125, 0.0087890625, 0.004...	[ 4865, 83, 56890, 939, 35874, 178851, 8780, 1556, 142508, 44759, 3444, 3714, 2367, 6863, 98365, 9191, 41653, 187136, 645, 10336, 34391, 19048, 28219, 50155, 442 ]	[ 0.0894775390625, 0.1072998046875, 0.2098388671875, 0.1986083984375, 0.2039794921875, 0.188232421875, 0.081298828125, 0.1412353515625, 0.2181396484375, 0.0054931640625, 0.051300048828125, 0.0303955078125, 0.0953369140625, 0.0672607421875, 0.1798095703125, 0.008544921875, 0.01205444335...	embed
38709212_c0	38709212	haskell	0	Title: Filter [Node] to [Element] with ghcjs-dom Problem title: Filter [Node] to [Element] with ghcjs-dom Tags: dom, haskell, ghcjs, ghcjs-dom Problem: Filter [Node] to [Element] with ghcjs-dom I am using ghcjs-dom. How can I filter the elements out of an array of nodes? import GHCJS.DOM.Types nodesToElements :: [Node]...	Filter [Node] to [Element] with ghcjs-dom Filter [Node] to [Element] with ghcjs-dom dom haskell ghcjs ghcjs-dom GHCJS.DOM.Types Filter Node Element Filter [Node] to [Element] with ghcjs-dom I am using ghcjs-dom. How can I filter the elements out of an array of nodes? or	[ -0.006622314453125, -0.00009584426879882812, -0.01116943359375, -0.00994873046875, 0.000640869140625, -0.001861572265625, -0.007232666015625, 0.00506591796875, 0.0027618408203125, -0.024658203125, 0.0009765625, -0.05810546875, -0.018798828125, 0.00176239013671875, -0.01611328125, -0.02...	[ 128896, 5021, 47, 647, 19929, 678, 31380, 238, 28175, 3815, 4539, 1556, 142508, 527, 73265, 64977, 127214, 196707, 438, 112, 48325, 17368, 11249, 831, 46312, 80854, 1810, 10298, 111, 110, 988 ]	[ 0.2135009765625, 0.1505126953125, 0.130615234375, 0.0245208740234375, 0.1663818359375, 0.006103515625, 0.131103515625, 0.09210205078125, 0.2056884765625, 0.152099609375, 0.1162109375, 0.09442138671875, 0.174560546875, 0.046539306640625, 0.08056640625, 0.1815185546875, 0.138671875, ...	embed
44578339_c0	44578339	haskell	0	Title: Haskell MArray performance benchmark Problem title: Haskell MArray performance benchmark Tags: functional-programming, haskell, immutability, imperative-programming Problem: Haskell MArray performance benchmark Haskell's MArray is supposed to provide a mutable array. I wonder how does it compare with a normal mu...	Haskell MArray performance benchmark Haskell MArray performance benchmark functional-programming haskell immutability imperative-programming Haskell MArray Haskell MArray performance benchmark Haskell's MArray is supposed to provide a mutable array. I wonder how does it compare with a normal mutable array in an imperat...	[ -0.00653076171875, 0.00445556640625, 0.00982666015625, 0.00994873046875, 0.00101470947265625, -0.00653076171875, -0.0038909912109375, 0.01263427734375, 0.0174560546875, -0.0152587890625, 0.0213623046875, -0.00018405914306640625, 0.0096435546875, -0.0081787109375, -0.006744384765625, -0...	[ 20625, 142508, 9267, 42, 7092, 23718, 240057, 123309, 28966, 1556, 566, 14311, 41159, 222530, 134598, 22691, 842, 22819, 10298, 53, 32195, 3642, 69101, 678, 3638, 56037, 46876, 1884, 41925, 313, 60213, 225490 ]	[ 0.1463623046875, 0.2626953125, 0.032135009765625, 0.05889892578125, 0.2724609375, 0.1903076171875, 0.2366943359375, 0.1204833984375, 0.1136474609375, 0.132080078125, 0.003936767578125, 0.133056640625, 0.051025390625, 0.1917724609375, 0.09222412109375, 0.09423828125, 0.1319580078125, ...	embed
7870673_c0	7870673	haskell	0	Title: parse error (possibly incorrect indentation) Problem title: parse error (possibly incorrect indentation) Tags: haskell Problem: parse error (possibly incorrect indentation) when i execute the following lines of code i get the following error TyInfer.hs:115:0: parse error (possibly incorrect indentation) can anyo...	parse error (possibly incorrect indentation) parse error (possibly incorrect indentation) haskell TyInfer.hs:115:0 Subst TyVar Type Unification Replace Bind Expr Alt parse error (possibly incorrect indentation) when i execute the following lines of code i get the following error can anyone explain me what is the proble...	[ -0.00130462646484375, -0.002471923828125, -0.0030364990234375, 0.01043701171875, 0.0181884765625, 0.00072479248046875, -0.0224609375, -0.019775390625, 0.011474609375, 0.002838134765625, -0.00909423828125, -0.005096435546875, 0.015625, 0.00311279296875, 0.002838134765625, 0.012756347656...	[ 366, 184, 18499, 7522, 172, 38526, 214552, 18597, 22062, 1556, 142508, 8064, 4153, 2875, 127, 7, 103928, 53861, 8273, 271, 81827, 60457, 992, 41274, 853, 23935, 16666, 71, 60075, 42, 10544, 71924, 25632, 124519, 18151, 831, 35672, 73342, 29...	[ 0.1259765625, 0.17138671875, 0.1776123046875, 0.103515625, 0.0853271484375, 0.0880126953125, 0.162353515625, 0.1756591796875, 0.1142578125, 0.1209716796875, 0.2166748046875, 0.1463623046875, 0.09228515625, 0.22998046875, 0.0885009765625, 0.0186309814453125, 0.162841796875, 0.120849...	embed
8624760_c0	8624760	haskell	0	Title: Repa --- How to make a Read instance? Problem title: Repa --- How to make a Read instance? Tags: haskell, repa Problem: Repa --- How to make a Read instance? What is the best way to make type Configuration = Array DIM1 (Double, Double, Double) an instance of Read? So later I could derive data SimulationData = SD...	Repa --- How to make a Read instance? Repa --- How to make a Read instance? haskell repa Repa How Read Configuration Array DIM1 Double SimulationData StdGen Repa --- How to make a Read instance? What is the best way to make an instance of Read? So later I could derive to be an instance of Read too.	[ -0.0118408203125, 0.0050048828125, -0.0009002685546875, 0.0185546875, 0.004425048828125, 0.005706787109375, 0.01556396484375, -0.0142822265625, 0.008056640625, -0.036865234375, -0.02734375, -0.0277099609375, 0.00148773193359375, -0.0196533203125, -0.0021820068359375, -0.02978515625, ...	[ 33742, 11, 28229, 11249, 47, 3249, 10, 4764, 110527, 1556, 142508, 10958, 59994, 69253, 175546, 418, 107172, 144814, 137989, 2907, 71, 105376, 2965, 3917, 142, 14432, 122, 5844, 186, 111, 5792 ]	[ 0.181884765625, 0.2166748046875, 0.0251007080078125, 0.08154296875, 0.0517578125, 0.14208984375, 0.0897216796875, 0.3017578125, 0.29638671875, 0.1181640625, 0.203125, 0.1663818359375, 0.1453857421875, 0.0762939453125, 0.1209716796875, 0.0469970703125, 0.0733642578125, 0.15576171875...	embed
60389269_c0	60389269	haskell	0	Title: How to make a list out of all second elements of a tuple in haskell Problem title: How to make a list out of all second elements of a tuple in haskell Tags: haskell, tuples Problem: How to make a list out of all second elements of a tuple in haskell I have a list of tuples like [(1,"A"),(2,"B"),(3,"C")] Now I wa...	How to make a list out of all second elements of a tuple in haskell How to make a list out of all second elements of a tuple in haskell haskell tuples How How to make a list out of all second elements of a tuple in haskell I have a list of tuples like [(1,"A"),(2,"B"),(3,"C")] Now I want to create a list with all the s...	[ 0.0179443359375, -0.0032958984375, 0.0020294189453125, 0.0205078125, 0.00860595703125, 0.019287109375, -0.030029296875, 0.007354736328125, 0.01361083984375, -0.025634765625, -0.010009765625, -0.03857421875, 0.005889892578125, 0.0255126953125, -0.03466796875, 0.0225830078125, -0.00074...	[ 11249, 47, 3249, 10, 5303, 1810, 111, 756, 17932, 80854, 370, 8705, 23, 1556, 142508, 99726, 1884, 41600, 284, 74054, 54753, 571, 86827, 441, 3444, 28282, 678, 8382, 5608, 4358, 2967 ]	[ 0.0693359375, 0.01873779296875, 0.0928955078125, 0.039825439453125, 0.207763671875, 0.1297607421875, 0.079833984375, 0.13134765625, 0.20361328125, 0.1741943359375, 0.143798828125, 0.20458984375, 0.05047607421875, 0.1522216796875, 0.213134765625, 0.2176513671875, 0.02069091796875, 0...	embed
35546310_c0	35546310	haskell	0	Title: How to deploy a Haskell web app to Heroku in a simple way? Problem title: How to deploy a Haskell web app to Heroku in a simple way? Tags: heroku, haskell Problem: How to deploy a Haskell web app to Heroku in a simple way? I've been googling for a while but haven't found an answer to my question. What's a simple...	How to deploy a Haskell web app to Heroku in a simple way? How to deploy a Haskell web app to Heroku in a simple way? heroku haskell How Haskell Heroku How to deploy a Haskell web app to Heroku in a simple way? I've been googling for a while but haven't found an answer to my question. What's a simple way to deploy a ha...	[ 0.0113525390625, 0.0184326171875, -0.0150146484375, 0.007598876953125, -0.01202392578125, 0.01239013671875, -0.00433349609375, -0.0233154296875, -0.005706787109375, -0.025146484375, 0.00482177734375, -0.03369140625, -0.00193023681640625, 0.01214599609375, -0.0002841949462890625, -0.001...	[ 11249, 47, 8, 13158, 53, 20625, 142508, 1467, 4027, 56889, 319, 8781, 3917, 40814, 1556, 10, 12960, 35166, 38415, 121190, 136, 50695, 22729, 165598, 29806 ]	[ 0.0989990234375, 0.1583251953125, 0.124755859375, 0.17041015625, 0.1546630859375, 0.1654052734375, 0.275146484375, 0.1536865234375, 0.1932373046875, 0.21484375, 0.245361328125, 0.1573486328125, 0.0416259765625, 0.1541748046875, 0.1502685546875, 0.008697509765625, 0.006591796875, 0....	embed
28030983_c1	28030983	haskell	1	:: Double , ball :: Vec2 Double , ballV :: Vec2 Double } deriving Show data Update = BallPos (Vec2 Double) \| BallVel (Vec2 Double) \| PlayerPos Double \| AIPos Double instance Diff State Update where commit s (BallPos p) = s { ball = p } commit s (BallVel p) = s { ballV = p } commit s (PlayerPos p) = s { playerPaddle = ...	:: Double , ball :: Vec2 Double , ballV :: Vec2 Double } deriving Show data Update = BallPos (Vec2 Double) \| BallVel (Vec2 Double) \| PlayerPos Double \| AIPos Double instance Diff State Update where commit s (BallPos p) = s { ball = p } commit s (BallVel p) = s { ballV = p } commit s (PlayerPos p) = s { playerPaddle = ...	[ 0.004425048828125, 0.01202392578125, 0.0030059814453125, 0.006683349609375, 0.0050048828125, 0.0185546875, -0.04150390625, 0.00494384765625, 0.010986328125, 0.027099609375, 0.00146484375, 0.00567626953125, 0.023681640625, -0.0091552734375, -0.036865234375, 0.00555419921875, 0.0235595...	[ 1984, 107172, 4, 16446, 52884, 304, 856, 51912, 16406, 6496, 17367, 2053, 28641, 2203, 21786, 7192, 7, 3240, 58745, 146224, 60560, 62, 10931, 232, 110527, 191144, 22836, 375, 4007, 91, 5584, 915, 15, 142581, 58585, 113954, 19298, 11388, 10,...	[ 0.096923828125, 0.238525390625, 0.050445556640625, 0.2127685546875, 0.248291015625, 0.2047119140625, 0.1995849609375, 0.0159759521484375, 0.1424560546875, 0.10662841796875, 0.222412109375, 0.184814453125, 0.208740234375, 0.04150390625, 0.1717529296875, 0.157470703125, 0.0908813476562...	embed
43862270_c0	43862270	haskell	0	Title: Capturing parameters from a POST request in Spock Problem title: Capturing parameters from a POST request in Spock Tags: haskell, haskell-wai, haskell-spock Problem: Capturing parameters from a POST request in Spock In the documentation of Spock, here https://www.spock.li/2015/04/19/type-safe_routing.html , it o...	Capturing parameters from a POST request in Spock Capturing parameters from a POST request in Spock haskell haskell-wai haskell-spock a Capturing POST Spock Capturing parameters from a POST request in Spock In the documentation of Spock, here https://www.spock.li/2015/04/19/type-safe_routing.html , it only describes ho...	[ -0.01080322265625, -0.00141143798828125, -0.01025390625, -0.0018157958984375, -0.01190185546875, -0.005828857421875, 0.01129150390625, 0.0014801025390625, 0.00274658203125, -0.01361083984375, 0.00848388671875, -0.0162353515625, -0.017333984375, -0.0147705078125, -0.00145721435546875, 0...	[ 14304, 109561, 171859, 7, 1295, 81903, 50336, 23, 23172, 2594, 1556, 142508, 634, 14, 11955, 10, 209806, 24301, 2947, 50986, 115840, 14179, 1916, 98363, 3642, 141621, 2046, 3871, 64333, 1305, 11249, 831, 54 ]	[ 0.1669921875, 0.115478515625, 0.258544921875, 0.07623291015625, 0.1051025390625, 0.195068359375, 0.2169189453125, 0.07373046875, 0.20849609375, 0.2232666015625, 0.115966796875, 0.21435546875, 0.1597900390625, 0.1202392578125, 0.171875, 0.01373291015625, 0.1248779296875, 0.026931762...	embed
65533197_c1	65533197	haskell	1	) Empty Ch21_12_ExercisesTree Data.Monoid> foldr (<>) (mempty :: Sum Int) t Sum {getSum = 4} Ch21_12_ExercisesTree Data.Monoid> foldMap Sum t Sum {getSum = 4} I suspect there's something I'm not figuring out about the fold ing function that QuickCheck is using. Questions: Why are failures occurring? Is there a way to...	) Empty Ch21_12_ExercisesTree Data.Monoid> foldr (<>) (mempty :: Sum Int) t Sum {getSum = 4} Ch21_12_ExercisesTree Data.Monoid> foldMap Sum t Sum {getSum = 4} I suspect there's something I'm not figuring out about the fold ing function that QuickCheck is using. Questions: Why are failures occurring? Is there a way to...	[ -0.017822265625, -0.0128173828125, 0.007537841796875, 0.0093994140625, 0.000762939453125, 0.0194091796875, -0.027587890625, -0.0198974609375, -0.004302978515625, 0.0028533935546875, -0.01708984375, -0.0191650390625, 0.001922607421875, 0.0146484375, 0.0250244140625, 0.01123046875, -0....	[ 31678, 939, 15982, 3117, 1530, 56, 10794, 62731, 13, 11809, 46674, 48899, 18344, 7569, 2676, 36335, 360, 18, 808, 316, 201, 42822, 166179, 294, 92610, 26747, 3305, 32354, 89038, 202567, 17368, 44084, 137578, 7, 74918, 2852, 11814, 3034, 288...	[ 0.1641845703125, 0.1629638671875, 0.023895263671875, 0.06231689453125, 0.0867919921875, 0.0885009765625, 0.08905029296875, 0.1551513671875, 0.00177001953125, 0.0751953125, 0.00775146484375, 0.1668701171875, 0.1114501953125, 0.1383056640625, 0.036468505859375, 0.1778564453125, 0.00070...	embed
33591346_c0	33591346	haskell	0	Title: Write to text file in IDE Haskell Problem title: Write to text file in IDE Haskell Tags: haskell Problem: Write to text file in IDE Haskell I have the following code and am using an online IDE from School of Haskell: import System.IO main = do h <- openFile "message.txt" WriteMode hPutStrLn h "Greetings earthlin...	Write to text file in IDE Haskell Write to text file in IDE Haskell haskell System.IO Write IDE Haskell message.txt WriteMode Greetings Write to text file in IDE Haskell I have the following code and am using an online IDE from School of Haskell: But it doesn't seem to be working. Where is message.txt saved?	[ 0.0162353515625, 0.01519775390625, 0.003997802734375, 0.03466796875, 0.0031585693359375, 0.021240234375, -0.00075531005859375, 0.006744384765625, -0.004730224609375, -0.00823974609375, -0.0021820068359375, -0.015625, -0.00372314453125, 0.01043701171875, 0.0174560546875, 0.0074768066406...	[ 601, 18781, 47, 7986, 11435, 23, 36497, 20625, 142508, 1556, 12353, 17780, 26008, 5, 124326, 9083, 112, 10255, 126, 5180, 25632, 18151, 17368, 1118, 19188, 111, 4966, 18, 48903, 20697, 78662, 83, 57, 4126 ]	[ 0.0997314453125, 0.1900634765625, 0.2110595703125, 0.16455078125, 0.17578125, 0.05511474609375, 0.24755859375, 0.1287841796875, 0.2193603515625, 0.105712890625, 0.079345703125, 0.1668701171875, 0.19287109375, 0.0576171875, 0.2705078125, 0.14453125, 0.00970458984375, 0.152587890625,...	embed
26950997_c0	26950997	haskell	0	Title: Memoizing `map f` calls Problem title: Memoizing `map f` calls Tags: haskell, dynamic-programming Problem: Memoizing `map f` calls I understand how this memoization works fib :: Int -> Int fib = (map fib' [0..] !!) where fib' 1 = 1 fib' 2 = 1 fib' n = fib (n-2) + fib (n-1) But how can I memoize this function whi...	Memoizing `map f` calls Memoizing `map f` calls haskell dynamic-programming Memoizing n-2 n-1 Memoizing `map f` calls I understand how this memoization works But how can I memoize this function which uses above function. How to make each call for fib use a same cache?	[ 0.01507568359375, -0.0120849609375, 0.013671875, -0.021728515625, -0.0107421875, 0.006591796875, 0.01611328125, 0.0308837890625, 0.00848388671875, -0.0159912109375, -0.0057373046875, 0.00107574462890625, 0.0230712890625, 0.0184326171875, 0.0140380859375, -0.0028839111328125, -0.01177...	[ 17443, 31, 84382, 62346, 1238, 11782, 1556, 142508, 84079, 28966, 653, 5428, 5759, 28219, 3642, 903, 163, 432, 47691, 43240, 831, 20650, 32354, 4527, 36917, 11249, 3249, 12638, 809, 275, 5701, 82365 ]	[ 0.156005859375, 0.1282958984375, 0.1453857421875, 0.178466796875, 0.199951171875, 0.197509765625, 0.1181640625, 0.2120361328125, 0.15576171875, 0.11181640625, 0.01190185546875, 0.1163330078125, 0.09295654296875, 0.07025146484375, 0.052734375, 0.050018310546875, 0.1353759765625, 0.1...	embed
45607474_c1	45607474	haskell	1	fmap ((:) (Just 4)) [Just 5] <- result [Just 4, Just 5] meh (3:[4,5])] (\x -> Just x) = fmap ((:) (Just 3)) [Just 4, Just 5] <- result [Just 4, Just 5] meh [3,4,5] (\x -> Just x) = [Just 3,Just 4, Just 5] As you can see, the substitution does not match to the right result: Just [3,4,5] != [Just 3,Just 4, Just 5] My qu...	fmap ((:) (Just 4)) [Just 5] <- result [Just 4, Just 5] meh (3:[4,5])] (\x -> Just x) = fmap ((:) (Just 3)) [Just 4, Just 5] <- result [Just 4, Just 5] meh [3,4,5] (\x -> Just x) = [Just 3,Just 4, Just 5] As you can see, the substitution does not match to the right result: Just [3,4,5] != [Just 3,Just 4, Just 5] My qu...	[ -0.021728515625, 0.0172119140625, 0.0022430419921875, 0.0021514892578125, 0.00116729736328125, 0.01336669921875, 0.000858306884765625, 0.0004520416259765625, 0.0140380859375, -0.01361083984375, 0.006011962890625, -0.0164794921875, -0.016845703125, 0.0235595703125, 0.004425048828125, -0...	[ 1238, 62346, 60494, 12, 127794, 13956, 190, 4426, 16750, 201, 9563, 31584, 6896, 80389, 425, 33079, 1022, 2203, 8439, 122101, 138, 398, 161740, 1830, 14602, 959, 14858, 47, 7108, 711, 6777, 87, 44691, 9925, 272, 4163, 28864, 26073, 7, 207...	[ 0.1484375, 0.269287109375, 0.0333251953125, 0.1116943359375, 0.20263671875, 0.2398681640625, 0.1866455078125, 0.014739990234375, 0.178466796875, 0.20703125, 0.2108154296875, 0.165771484375, 0.07806396484375, 0.261474609375, 0.07080078125, 0.0780029296875, 0.11962890625, 0.049346923...	embed
46636356_c0	46636356	haskell	0	Title: Haskell version of double loop Problem title: Haskell version of double loop Tags: haskell, loops, duplicates, iteration, functional-programming Problem: Haskell version of double loop I need to do the following in Haskell and can't think of the correct method to do it: for (int i=0; i<100; i++) for (int a=0; a<...	Haskell version of double loop Haskell version of double loop haskell loops duplicates iteration functional-programming Haskell Haskell version of double loop I need to do the following in Haskell and can't think of the correct method to do it: I also don't want 'duplicates' returned so there's not both (1, 50) and (50...	[ 0.0196533203125, -0.00063323974609375, 0.003265380859375, 0.000499725341796875, 0.0181884765625, 0.017578125, -0.0147705078125, -0.01220703125, 0.00058746337890625, -0.0439453125, 0.00927734375, -0.0037689208984375, 0.0150146484375, 0.0024871826171875, -0.0213623046875, 0.007568359375,...	[ 20625, 142508, 11389, 41929, 40956, 1556, 171763, 1636, 17, 720, 123309, 28966, 3871, 54, 25632, 23, 831, 18, 5351, 26785, 55300, 2301, 3444, 693, 52721, 176377, 959, 15044, 836, 83875, 4879, 25647 ]	[ 0.118408203125, 0.2039794921875, 0.1693115234375, 0.18896484375, 0.2100830078125, 0.115478515625, 0.2474365234375, 0.1060791015625, 0.0474853515625, 0.1910400390625, 0.163818359375, 0.0948486328125, 0.06512451171875, 0.0256805419921875, 0.073486328125, 0.033660888671875, 0.0088500976...	embed
78885389_c0	78885389	haskell	0	Title: `getLabel` or `fromLabel` Problem title: `getLabel` or `fromLabel` Tags: documentation, ghc, haskell Problem: `getLabel` or `fromLabel` The GHC documentation for OverloadedLabels here shows examples like Leading capital letters: #Foo equivalant to getLabel @”Foo” Should getLabel be fromLabel ? AFAIK getLabel is ...	`getLabel` or `fromLabel` `getLabel` or `fromLabel` documentation ghc haskell OverloadedLabels Foo `getLabel` or `fromLabel` The GHC documentation for OverloadedLabels here shows examples like Should getLabel be fromLabel ? AFAIK getLabel is for creating unnamed labels from data constructors in template haskell. fromLa...	[ 0.0262451171875, -0.01080322265625, -0.00933837890625, -0.0093994140625, 0.0091552734375, -0.007598876953125, -0.004547119140625, 0.0069580078125, 0.01409912109375, -0.0191650390625, 0.018798828125, -0.035400390625, 0.0098876953125, -0.01031494140625, 0.0037384033203125, -0.02868652343...	[ 9473, 3794, 2729, 4063, 707, 161063, 1135, 209806, 31380, 238, 1556, 142508, 9578, 63033, 297, 97381, 14794, 9572, 31, 527, 73265, 3688, 45831, 27781, 1884, 151117, 2046, 186, 1295, 6, 151334, 17756, 83, 100, 105233, 85589, 4806, 67967, 205...	[ 0.028106689453125, 0.208251953125, 0.2298583984375, 0.31982421875, 0.0784912109375, 0.230712890625, 0.00372314453125, 0.19091796875, 0.10546875, 0.09307861328125, 0.1204833984375, 0.2117919921875, 0.134521484375, 0.187744140625, 0.068359375, 0.1876220703125, 0.1527099609375, 0.1379...	embed
6167936_c0	6167936	haskell	0	Title: Can't seem to get my head around the 'list difference' (\\) operator Problem title: Can't seem to get my head around the 'list difference' (\\) operator Tags: haskell, element, list, set-difference Problem: Can't seem to get my head around the 'list difference' (\\) operator I have ...	Can't seem to get my head around the 'list difference' (\\) operator Can't seem to get my head around the 'list difference' (\\) operator haskell element list set-difference Can Can't seem to get my head around the 'list difference' (\\) operator I have heard the term 'list difference' (\\...	[ 0.0133056640625, 0.0169677734375, 0.01385498046875, 0.00604248046875, -0.0108642578125, 0.01177978515625, -0.008544921875, 0.01220703125, 0.0128173828125, 0.0130615234375, -0.004058837890625, -0.0118408203125, 0.00946044921875, 0.0118408203125, -0.037353515625, 0.00604248046875, 0.01...	[ 4171, 3768, 18, 48903, 2046, 759, 10336, 10932, 6562, 60212, 13273, 39933, 47, 1556, 142508, 12830, 5303, 5423, 428, 18234, 6620, 25, 49782, 70, 13579, 16, 23, 20625, 1284, 7464, 2301, 32233, 3714, 3642, 27781, 25647 ]	[ 0.103271484375, 0.095703125, 0.1265869140625, 0.13330078125, 0.0797119140625, 0.06500244140625, 0.167236328125, 0.146728515625, 0.2344970703125, 0.2880859375, 0.219970703125, 0.2445068359375, 0.019927978515625, 0.1197509765625, 0.255126953125, 0.1634521484375, 0.1719970703125, 0.17...	embed
38273567_c0	38273567	haskell	0	Title: Setting the ghci prompt with colors Problem title: Setting the ghci prompt with colors Tags: prompt, ghci, haskell Problem: Setting the ghci prompt with colors I try to use terminal colors within my ghci prompt. So when I open ghci and try to: Prelude> :set prompt '\[\033[1haskell > \033[0m\]' '\[\033[1\]haskell...	Setting the ghci prompt with colors Setting the ghci prompt with colors prompt ghci haskell Setting Prelude Setting the ghci prompt with colors I try to use terminal colors within my ghci prompt. So when I open ghci and try to: I know that these codes are interpreted by bash with echo and the -e flag. But how can I do ...	[ -0.01495361328125, 0.002410888671875, 0.002960205078125, 0.013671875, -0.0174560546875, 0.0167236328125, 0.0086669921875, 0.0186767578125, -0.00970458984375, 0.039794921875, -0.01153564453125, -0.029541015625, -0.00616455078125, 0.004608154296875, -0.01416015625, 0.0152587890625, -0....	[ 503, 19514, 31380, 318, 105876, 678, 104988, 70, 1556, 142508, 1914, 822, 9790, 4527, 33949, 28032, 9803, 3714, 6097, 18151, 29481, 390, 6, 87109, 28, 3089, 136, 20, 13, 49938, 54, 903 ]	[ 0.1246337890625, 0.058624267578125, 0.134033203125, 0.1927490234375, 0.2298583984375, 0.10015869140625, 0.2247314453125, 0.034912109375, 0.083984375, 0.194580078125, 0.050811767578125, 0.1441650390625, 0.048065185546875, 0.101318359375, 0.20703125, 0.114013671875, 0.0692138671875, ...	embed
21714826_c0	21714826	haskell	0	Title: Converting monads Problem title: Converting monads Tags: haskell, monads Problem: Converting monads Lets say I have function (>>*=) :: (Show e') => Either e' a -> (a -> Either e b) -> Either e b which is converting errors of different types in clean streamlined functions. I am pretty happy about this. BUT Could ...	Converting monads Converting monads haskell monads Converting Show Either Converting monads Lets say I have function which is converting errors of different types in clean streamlined functions. I am pretty happy about this. BUT Could there possibly be function <*- that would do similar job insted of <- keyword, that i...	[ -0.000751495361328125, -0.01251220703125, 0.01708984375, 0.0093994140625, 0.0240478515625, -0.005096435546875, -0.03173828125, -0.0174560546875, 0.0091552734375, -0.01116943359375, 0.0118408203125, -0.009033203125, -0.00506591796875, 0.00732421875, 0.004425048828125, -0.019287109375, ...	[ 1657, 814, 1916, 2667, 712, 7, 1556, 142508, 17367, 9319, 765, 32354, 96760, 214, 18499, 12921, 52895, 23, 46622, 75973, 2256, 28875, 17723, 151654, 191147, 2685, 144681, 186, 4426, 1639, 9, 450, 2806, 54, 21373, 12447, 14437, 111, 166117, ...	[ 0.04644775390625, 0.1466064453125, 0.06439208984375, 0.1368408203125, 0.1990966796875, 0.0654296875, 0.10577392578125, 0.2196044921875, 0.1309814453125, 0.01220703125, 0.008880615234375, 0.2227783203125, 0.149658203125, 0.0562744140625, 0.238037109375, 0.05877685546875, 0.09692382812...	embed
7173080_c0	7173080	haskell	0	Title: fmap fork functions Problem title: fmap fork functions Tags: haskell Problem: fmap fork functions I want to compose functions in the following way: compose :: (a->b->c) -> (d->a) -> (d->b) -> d -> c compose f g h x = f (g x) (h x) So that we can use it in the following way: compose (==) (myReverse . myReverse) i...	fmap fork functions fmap fork functions haskell fmap fork functions I want to compose functions in the following way: So that we can use it in the following way: I think it could be simplified with something like 'fmap', so that it needn't define 'compose' at all. But I failed to figure out how to do that.	[ 0, 0.0028076171875, -0.00146484375, 0.01458740234375, -0.0164794921875, 0.0244140625, 0.00750732421875, 0.00946044921875, 0.01202392578125, -0.030029296875, -0.001373291015625, 0.007659912109375, 0.0009002685546875, 0.0211181640625, -0.0012969970703125, -0.023681640625, -0.0057373046...	[ 1238, 62346, 100, 92, 32354, 1556, 142508, 3444, 47, 150350, 7, 25632, 3917, 831, 4527, 5351, 5809, 112892, 1029, 297, 678, 9844, 1884, 420, 3871, 18, 61924, 277, 78381, 756, 165523, 26366, 54 ]	[ 0.10546875, 0.236083984375, 0.137451171875, 0.093505859375, 0.2218017578125, 0.1138916015625, 0.2012939453125, 0.1055908203125, 0.0078125, 0.25341796875, 0.0684814453125, 0.05865478515625, 0.0687255859375, 0.009185791015625, 0.121826171875, 0.060302734375, 0.05029296875, 0.12988281...	embed
74397002_c0	74397002	haskell	0	Title: extract value of a from IO (Maybe a) Problem title: extract value of a from IO (Maybe a) Tags: haskell Problem: extract value of a from IO (Maybe a) I am making a game with gloss and got this: pictureMapBasic :: [Picture] -> Picture -> [Picture] pictureMapBasic picL pic = picL ++ (loadJuicyPNG "lib\assets\back.p...	extract value of a from IO (Maybe a) extract value of a from IO (Maybe a) haskell IO Maybe Picture back.png extract value of a from IO (Maybe a) I am making a game with gloss and got this: How do I take this IO (Maybe Picture) (from loadJuicyPNG) and turn it into a Picture and add it to the list?	[ -0.0023651123046875, -0.0019073486328125, -0.00007963180541992188, 0.008544921875, -0.00408935546875, 0.0205078125, 0.0030364990234375, -0.00885009765625, 0.0009613037109375, -0.01373291015625, 0.005523681640625, -0.0096435546875, 0.00046539306640625, 0.00225830078125, 0.003662109375, ...	[ 125663, 34292, 111, 10, 1295, 17780, 82419, 372, 1556, 142508, 83425, 158656, 4420, 128468, 20662, 6712, 678, 207244, 4163, 903, 11249, 54, 5646, 16, 161063, 72367, 21718, 14, 2408, 683, 8066, 15504, 3934, 15190, 47, 70, 5303 ]	[ 0.24560546875, 0.2154541015625, 0.1146240234375, 0.1180419921875, 0.15478515625, 0.23779296875, 0.111083984375, 0.05987548828125, 0.1224365234375, 0.2288818359375, 0.1302490234375, 0.2366943359375, 0.1895751953125, 0.188232421875, 0.05377197265625, 0.1207275390625, 0.0484619140625, ...	embed
41905124_c0	41905124	haskell	0	Title: how to use IO monad output on fly Problem title: how to use IO monad output on fly Tags: haskell, monads Problem: how to use IO monad output on fly This is what I am doing: data Person = Person (IORef String) (IORef Int) name <- newIORef "Boston" age <- newIORef 100 p = Person name age I am wondering if I can pu...	how to use IO monad output on fly how to use IO monad output on fly haskell monads Person IORef Boston how to use IO monad output on fly This is what I am doing: I am wondering if I can put them in one line, like: Is there any way to put them in one line?	[ -0.008056640625, 0.01446533203125, 0.00836181640625, 0.035888671875, 0.0098876953125, 0.01953125, -0.0130615234375, -0.00250244140625, -0.0137939453125, -0.03564453125, 0.00970458984375, -0.01141357421875, 0.0233154296875, -0.0081787109375, 0.00089263916015625, -0.0166015625, -0.0077...	[ 3642, 47, 4527, 17780, 2667, 712, 140992, 98, 12403, 1556, 142508, 15270, 123435, 4240, 62704, 20594, 149016, 831, 3884, 2856, 23, 1632, 13315, 2499, 3917 ]	[ 0.093017578125, 0.0792236328125, 0.152587890625, 0.22705078125, 0.149169921875, 0.22998046875, 0.2286376953125, 0.08843994140625, 0.2091064453125, 0.08203125, 0.203125, 0.093505859375, 0.060882568359375, 0.12164306640625, 0.1273193359375, 0.0099334716796875, 0.042266845703125, 0.04...	embed
48643231_c0	48643231	haskell	0	Title: understanding a Haskell function with filter and lambda expressions Problem title: understanding a Haskell function with filter and lambda expressions Tags: list, haskell, filter Problem: understanding a Haskell function with filter and lambda expressions j :: [Int] j = filter ((\h x -> h x > x) (\y -> y*y)) [-2...	understanding a Haskell function with filter and lambda expressions understanding a Haskell function with filter and lambda expressions list haskell filter Haskell understanding a Haskell function with filter and lambda expressions This one outputs [-2,-1,2] but why? could someone please explain me step by step what Ha...	[ 0.01312255859375, 0.0185546875, -0.01263427734375, -0.01458740234375, 0.01055908203125, 0.00518798828125, 0.0167236328125, 0.0218505859375, 0.004119873046875, 0.0184326171875, 0.004302978515625, -0.0177001953125, -0.00244140625, -0.00836181640625, 0.0081787109375, -0.00107574462890625,...	[ 100094, 20625, 142508, 32354, 678, 46312, 136, 21, 6492, 85, 125195, 10, 5303, 1556, 1632, 140992, 7, 378, 5428, 4, 9, 133063, 15400, 73342, 29954, 14602, 3688, 2046, 903 ]	[ 0.1414794921875, 0.1287841796875, 0.25537109375, 0.1744384765625, 0.093994140625, 0.2344970703125, 0.06524658203125, 0.044952392578125, 0.1566162109375, 0.11572265625, 0.18115234375, 0.01654052734375, 0.09356689453125, 0.10296630859375, 0.013336181640625, 0.2060546875, 0.018264770507...	embed
13400289_c1	13400289	haskell	1	dpy) (apros,real) <- allocNamedColor dpy colormap color return $ color_pixel apros Basically, I need to create a simple window with a canvas, on which I will draw some lines. What am I doing wrong in that snippet? Versions: X11 - 1.5.0.1 GHC - 6.12.1 OS - Linux Mint 10 Xorg - 1:7.5 Code signals: Graphics.X11.Xlib, Sys...	dpy) (apros,real) <- allocNamedColor dpy colormap color return $ color_pixel apros Basically, I need to create a simple window with a canvas, on which I will draw some lines. What am I doing wrong in that snippet? Versions: X11 - 1.5.0.1 GHC - 6.12.1 OS - Linux Mint 10 Xorg - 1:7.5 Code signals: Graphics.X11.Xlib, Sys...	[ -0.005340576171875, -0.005126953125, 0.002899169921875, 0.007415771484375, 0.0089111328125, 0.00750732421875, 0.004180908203125, -0.0157470703125, 0.0003662109375, -0.018798828125, -0.004302978515625, -0.006622314453125, 0.00921630859375, -0.00555419921875, -0.013916015625, 0.001953125...	[ 104, 6493, 11, 88718, 30544, 756, 6652, 163612, 71, 10625, 1484, 10576, 62346, 30646, 3650, 66535, 583, 95356, 7, 3871, 28282, 8781, 76896, 678, 831, 4079, 1221, 79442, 3060, 124519, 444, 20594, 44691, 93, 58134, 40647, 1193, 1662, 22410, ...	[ 0.0963134765625, 0.2685546875, 0.050323486328125, 0.2469482421875, 0.1810302734375, 0.077880859375, 0.115234375, 0.127685546875, 0.028350830078125, 0.086669921875, 0.1634521484375, 0.17626953125, 0.1900634765625, 0.104736328125, 0.08184814453125, 0.0987548828125, 0.08642578125, 0.1...	embed
12161705_c0	12161705	haskell	0	Title: Run Yesod app as specific user with Keter Problem title: Run Yesod app as specific user with Keter Tags: yesod, haskell, deployment Problem: Run Yesod app as specific user with Keter How can I ask Keter to run my Yesod app as a specific user? Running as root doesn't seem very safe. In addition, my application is...	Run Yesod app as specific user with Keter Run Yesod app as specific user with Keter yesod haskell deployment Run Yesod Keter Run Yesod app as specific user with Keter How can I ask Keter to run my Yesod app as a specific user? Running as root doesn't seem very safe. In addition, my application is calling an external co...	[ 0.00144195556640625, 0.007720947265625, 0.0029296875, -0.013427734375, -0.02490234375, 0.0218505859375, -0.005035400390625, -0.032470703125, -0.0067138671875, 0.00188446044921875, -0.007720947265625, 0.012939453125, -0.0238037109375, 0.0361328125, 0.010009765625, -0.01141357421875, 0...	[ 28398, 32635, 2199, 4027, 237, 29458, 38937, 678, 1345, 720, 2422, 23722, 1556, 142508, 13158, 831, 26458, 47, 11675, 592, 74855, 22027, 18, 48903, 4552, 46002, 66044, 38415, 159029, 173591, 75101, 1884, 351, 59104, 65918, 2806, 17203, 102158...	[ 0.16748046875, 0.1898193359375, 0.28173828125, 0.169921875, 0.10382080078125, 0.2071533203125, 0.2342529296875, 0.1112060546875, 0.180419921875, 0.2578125, 0.1163330078125, 0.2381591796875, 0.0902099609375, 0.170654296875, 0.0611572265625, 0.04327392578125, 0.1295166015625, 0.04071...	embed
34905869_c0	34905869	haskell	0	Title: Creating infinite list out of ADT Problem title: Creating infinite list out of ADT Tags: haskell Problem: Creating infinite list out of ADT In Haskell, > a = [1,1..] creates an infinite list. Now I have the following data Subunit = O \| P deriving (Eq, Show) And if I do b :: [Subunit] b = take 6 [P,P..] I get the...	Creating infinite list out of ADT Creating infinite list out of ADT haskell Creating ADT Subunit Show Creating infinite list out of ADT In Haskell, creates an infinite list. Now I have the following And if I do I get the following: Why this is failing? What I need to add to be able to create an infinite list?	[ 0.007232666015625, 0.007781982421875, 0.01080322265625, 0.0220947265625, -0.0250244140625, -0.00872802734375, -0.0010223388671875, -0.01177978515625, -0.002349853515625, -0.0013885498046875, -0.00885009765625, -0.010498046875, 0.0145263671875, 0.00909423828125, -0.003753662109375, -0.0...	[ 56781, 54241, 13, 5303, 1810, 111, 62, 41072, 1916, 1556, 142508, 8273, 309, 217, 17367, 20625, 28282, 25632, 44084, 903, 35782, 214, 3871, 15190, 19048 ]	[ 0.1251220703125, 0.1492919921875, 0.0948486328125, 0.2044677734375, 0.097412109375, 0.07275390625, 0.1002197265625, 0.21044921875, 0.03607177734375, 0.114013671875, 0.225830078125, 0.1092529296875, 0.109375, 0.032318115234375, 0.151611328125, 0.120361328125, 0.130859375, 0.04479980...	embed
1813575_c0	1813575	haskell	0	Title: It's a good idea use ruby for socket programming? Problem title: It's a good idea use ruby for socket programming? Tags: erlang, scala, ruby, haskell Problem: It's a good idea use ruby for socket programming? My language of choice is Ruby, but I know because of twitter that Ruby can't handle a lot of r...	It's a good idea use ruby for socket programming? It's a good idea use ruby for socket programming? erlang scala ruby haskell It's a good idea use ruby for socket programming? My language of choice is Ruby, but I know because of twitter that Ruby can't handle a lot of requests. It is a good idea using it for ...	[ -0.00061798095703125, 0.01385498046875, 0.0123291015625, -0.009521484375, 0.0034942626953125, -0.0250244140625, -0.00885009765625, 0.0103759765625, -0.0185546875, -0.046142578125, 0.0291748046875, -0.0198974609375, 0.01904296875, -0.0135498046875, -0.00151824951171875, -0.00244140625, ...	[ 3768, 4127, 6528, 4527, 21922, 53, 100, 221, 27853, 56037, 449, 72, 3066, 146232, 1556, 142508, 46876, 44126, 83, 158189, 3714, 34776, 831, 18, 34831, 5915, 50336, 17368, 34754, 123309, 106001 ]	[ 0.039031982421875, 0.08441162109375, 0.0928955078125, 0.0848388671875, 0.1771240234375, 0.1981201171875, 0.04388427734375, 0.1063232421875, 0.1903076171875, 0.1590576171875, 0.049072265625, 0.04144287109375, 0.21142578125, 0.163818359375, 0.06768798828125, 0.1885986328125, 0.18334960...	embed
27283002_c0	27283002	haskell	0	Title: Unwrapping function types in Haskell Problem title: Unwrapping function types in Haskell Tags: haskell Problem: Unwrapping function types in Haskell is there a way to unwrap the following type in Haskell? newtype Rand a = Rand(StdGen -> (a , StdGen)) I've got a function which returns this type and another one wh...	Unwrapping function types in Haskell Unwrapping function types in Haskell haskell Unwrapping Haskell Rand StdGen Unwrapping function types in Haskell is there a way to unwrap the following type in Haskell? I've got a function which returns this type and another one which I'd like to use the 'a' value from the returned ...	[ -0.0035552978515625, -0.004241943359375, -0.0017852783203125, 0.004638671875, 0.003631591796875, 0.0177001953125, -0.013427734375, -0.0322265625, -0.0091552734375, -0.03369140625, -0.0098876953125, 0.00262451171875, -0.021728515625, 0.00701904296875, -0.0033721923828125, -0.01031494140...	[ 992, 5429, 11, 26783, 32354, 52895, 23, 20625, 142508, 1556, 39643, 2907, 71, 105376, 2685, 10, 3917, 47, 51, 434, 13631, 25632, 10644, 30646, 903, 136, 15700, 1884, 4527, 34292, 1295, 176377, 26366, 125663 ]	[ 0.1329345703125, 0.162109375, 0.1439208984375, 0.09521484375, 0.2100830078125, 0.2110595703125, 0.0738525390625, 0.13427734375, 0.24560546875, 0.123291015625, 0.1832275390625, 0.125, 0.06146240234375, 0.1944580078125, 0.01605224609375, 0.006622314453125, 0.087646484375, 0.024810791...	embed
66278118_c0	66278118	haskell	0	Title: Patterns not matched: Haskell Problem title: Patterns not matched: Haskell Tags: recursion, list, haskell, ghci Problem: Patterns not matched: Haskell I wrote a function that takes a list as an input and outputs the sum of its elements, but I get the following error: "Pattern match(es) are non-exhaustive In an e...	Patterns not matched: Haskell Patterns not matched: Haskell recursion list haskell ghci Patterns Haskell x:xs Patterns not matched: Haskell I wrote a function that takes a list as an input and outputs the sum of its elements, but I get the following error: "Pattern match(es) are non-exhaustive In an equation for ‘addfu...	[ -0.025146484375, 0.019287109375, 0.0172119140625, 0.0093994140625, -0.01708984375, 0.008544921875, 0.00054931640625, -0.005950927734375, 0.025146484375, -0.000797271728515625, 0.0162353515625, -0.03662109375, 0.00860595703125, 0.01068115234375, 0.005889892578125, -0.003753662109375, ...	[ 9876, 22766, 7, 959, 14858, 297, 20625, 142508, 195625, 1830, 5303, 1556, 31380, 318, 12, 425, 54397, 32354, 51776, 237, 107730, 140992, 10554, 80854, 25632, 18499, 8335, 3055, 19, 90, 621, 351, 3355, 18391, 4935, 5490, 11, 128205, 309, 2...	[ 0.141845703125, 0.1689453125, 0.000091552734375, 0.15478515625, 0.1998291015625, 0.1187744140625, 0.103759765625, 0.2120361328125, 0.1385498046875, 0.0263671875, 0.12890625, 0.0858154296875, 0.0362548828125, 0.07135009765625, 0.007781982421875, 0.03692626953125, 0.03118896484375, 0...	embed
32899040_c0	32899040	haskell	0	Title: How can I make Stack call Happy, Alex and other build tools? Problem title: How can I make Stack call Happy, Alex and other build tools? Tags: haskell-stack, happy, haskell Problem: How can I make Stack call Happy, Alex and other build tools? As part of my compiler, I need alex and happy to run as part of my bui...	How can I make Stack call Happy, Alex and other build tools? How can I make Stack call Happy, Alex and other build tools? haskell-stack happy haskell How Stack Happy Alex How can I make Stack call Happy, Alex and other build tools? As part of my compiler, I need alex and happy to run as part of my build process. How do...	[ -0.0184326171875, 0.02001953125, 0.0086669921875, 0.0068359375, -0.0057373046875, 0.0252685546875, -0.0027923583984375, 0.00390625, 0.006500244140625, -0.0211181640625, -0.006317138671875, -0.014892578125, 0.01483154296875, 0.01263427734375, 0.0159912109375, -0.0068359375, -0.0034637...	[ 11249, 831, 3249, 6512, 2594, 11782, 32506, 20984, 45367, 72977, 4, 3789, 1556, 142508, 590, 17723, 87, 2831, 9969, 34759, 3871, 662, 425, 136, 47, 11675, 9433, 8060, 106117, 3642, 68067, 237, 1340, 6032, 42548, 117538 ]	[ 0.079345703125, 0.082275390625, 0.10321044921875, 0.1741943359375, 0.173583984375, 0.160888671875, 0.2296142578125, 0.2283935546875, 0.1480712890625, 0.2073974609375, 0.0146026611328125, 0.0062255859375, 0.0966796875, 0.19970703125, 0.12060546875, 0.2139892578125, 0.02044677734375, ...	embed
11199853_c0	11199853	haskell	0	Title: How can I search a hackage package for a function? Problem title: How can I search a hackage package for a function? Tags: haskell, hackage Problem: How can I search a hackage package for a function? Maybe I am missing something, but is there a way to search inside some package on hackage? Let's say I know that ...	How can I search a hackage package for a function? How can I search a hackage package for a function? haskell hackage How How can I search a hackage package for a function? Maybe I am missing something, but is there a way to search inside some package on hackage? Let's say I know that Snap framework has a function call...	[ -0.006927490234375, 0.01373291015625, -0.0005645751953125, 0.0022125244140625, -0.0208740234375, -0.0028533935546875, 0.008056640625, -0.00921630859375, -0.005706787109375, -0.045166015625, -0.00531005859375, -0.038818359375, -0.01220703125, 0.001190185546875, -0.01513671875, 0.0065917...	[ 11249, 831, 33938, 85526, 4588, 98169, 100, 32354, 87, 10, 1556, 142508, 83425, 132283, 3917, 47, 46132, 98, 3714, 121190, 170846, 35839, 89159, 7413, 442, 72134, 139509, 10557, 29102, 7, 10957, 143161, 102014 ]	[ 0.088134765625, 0.05999755859375, 0.2464599609375, 0.2393798828125, 0.2122802734375, 0.273681640625, 0.1116943359375, 0.21044921875, 0.0207977294921875, 0.047210693359375, 0.1240234375, 0.2076416015625, 0.03021240234375, 0.05322265625, 0.04510498046875, 0.049102783203125, 0.138427734...	embed
7420514_c0	7420514	haskell	0	Title: Using text-icu library in Haskell on Mac OS Problem title: Using text-icu library in Haskell on Mac OS Tags: cabal, haskell, icu Problem: Using text-icu library in Haskell on Mac OS I am trying to use the text-icu library as a dependency in a cabal package on Mac OS. I have icu installed but when I try to build ...	Using text-icu library in Haskell on Mac OS Using text-icu library in Haskell on Mac OS cabal haskell icu Using Haskell Mac Using text-icu library in Haskell on Mac OS I am trying to use the text-icu library as a dependency in a cabal package on Mac OS. I have icu installed but when I try to build my package cabal give...	[ -0.0016021728515625, -0.0037994384765625, 0.01904296875, 0.0228271484375, 0.004791259765625, 0.014404296875, 0.00408935546875, 0.00897216796875, -0.036865234375, 0.017578125, 0.00106048583984375, -0.05224609375, 0.0128173828125, -0.00518798828125, 0.00872802734375, -0.023193359375, -...	[ 345, 7986, 9, 36742, 35773, 1294, 20625, 142508, 4727, 11787, 23, 98, 109524, 1556, 17, 1010, 31577, 4527, 237, 42548, 27771, 98169, 20600, 9790, 45367, 18499, 16771, 214, 313, 10484, 14, 1819, 19, 10135, 18190, 8, 978, 98441 ]	[ 0.061004638671875, 0.172119140625, 0.0751953125, 0.2237548828125, 0.2066650390625, 0.07366943359375, 0.1395263671875, 0.2376708984375, 0.117431640625, 0.11474609375, 0.010284423828125, 0.001739501953125, 0.2100830078125, 0.125732421875, 0.114990234375, 0.2315673828125, 0.035919189453...	embed
42075687_c1	42075687	haskell	1	.Interpreted.renderTemplate function. Code signals: Data.String.Conversions, Data.Maybe, qualified, Heist.Internal.Types, Data.List, Data.Map.Syntax, Data.ByteString.Builder, Rendering, Heist, Heist.Interpreted, Heist.Compiled, HeistCom, Text.XmlHtml, HeistState, ActionM, MapSyntax, Text, I.Splice, HeistCom.Splice, Att...	.Interpreted.renderTemplate function. Code signals: Data.String.Conversions, Data.Maybe, qualified, Heist.Internal.Types, Data.List, Data.Map.Syntax, Data.ByteString.Builder, Rendering, Heist, Heist.Interpreted, Heist.Compiled, HeistCom, Text.XmlHtml, HeistState, ActionM, MapSyntax, Text, I.Splice, HeistCom.Splice, Att...	[ -0.0284423828125, -0.0032958984375, -0.00439453125, -0.0093994140625, -0.0303955078125, 0.01080322265625, -0.0106201171875, 0.00469970703125, -0.004241943359375, -0.0250244140625, -0.026611328125, -0.0045166015625, -0.0111083984375, -0.0091552734375, 0.004425048828125, 0.016845703125, ...	[ 5, 44851, 56359, 297, 18280, 42, 159065, 19309, 32354, 28864, 26073, 7, 12, 11809, 71713, 214, 11935, 46354, 82419, 372, 217225, 1529, 1419, 6236, 196707, 154663, 166179, 294, 3371, 86531, 75358, 67, 121137, 56, 63137, 4209, 108161, 6259, 1...	[ 0.05523681640625, 0.1685791015625, 0.2568359375, 0.1356201171875, 0.2120361328125, 0.144287109375, 0.2587890625, 0.2264404296875, 0.1988525390625, 0.2474365234375, 0.26806640625, 0.103271484375, 0.0242919921875, 0.1353759765625, 0.117919921875, 0.02142333984375, 0.048004150390625, ...	embed
4738609_c0	4738609	haskell	0	Title: About scanl1 in Haskell Problem title: About scanl1 in Haskell Tags: haskell Problem: About scanl1 in Haskell A function should return the running sums of a list. Such as calling it with [1,2,3,5] returns [1,3,6,11] . I wrote this function like below: sumlist' :: [xx]=[xx] sumlist' []=[] sumlist' [x]=x sumlist' ...	About scanl1 in Haskell About scanl1 in Haskell haskell About scanl1 Haskell About scanl1 in Haskell A function should return the running sums of a list. Such as calling it with [1,2,3,5] returns [1,3,6,11] . I wrote this function like below: When I run it in GHcI, it shows me that I do multiple declarations. So what's...	[ -0.005523681640625, 0.00128936767578125, 0.0242919921875, 0.020263671875, -0.00970458984375, 0.0125732421875, -0.012939453125, -0.00063323974609375, 0.007080078125, -0.03076171875, 0.01708984375, 0.0026702880859375, -0.00506591796875, 0.0035858154296875, 0.017333984375, 0.0157470703125...	[ 56888, 44954, 141, 418, 20625, 142508, 1556, 23, 32354, 5608, 30646, 70, 51042, 10554, 7, 111, 5303, 159029, 442, 678, 133063, 92714, 363, 910, 1662, 54397, 1884, 35064, 11675, 41877, 238, 568, 45831, 54, 48716, 21635, 5256, 44691, 903 ]	[ 0.04949951171875, 0.2010498046875, 0.19873046875, 0.1451416015625, 0.155517578125, 0.24462890625, 0.132080078125, 0.0128173828125, 0.2218017578125, 0.099609375, 0.1859130859375, 0.0257415771484375, 0.19384765625, 0.219970703125, 0.106689453125, 0.039093017578125, 0.2020263671875, 0...	embed
62914847_c1	62914847	haskell	1	Cudd.Cudd.cuddPrintDdInfo manager dd printDdInfo :: Either Bdd Zdd -> IO() printDdInfo dd = case dd of Zdd dd -> do putStrLn "Hello, bdd!" Cudd.Cudd.cuddPrintDdInfo manager dd Bdd dd -> do putStrLn "Hello, bdd!" Cudd.Cudd.cuddPrintDdInfo manager dd All of these methods failed. What is the most elegant way of writing t...	Cudd.Cudd.cuddPrintDdInfo manager dd printDdInfo :: Either Bdd Zdd -> IO() printDdInfo dd = case dd of Zdd dd -> do putStrLn "Hello, bdd!" Cudd.Cudd.cuddPrintDdInfo manager dd Bdd dd -> do putStrLn "Hello, bdd!" Cudd.Cudd.cuddPrintDdInfo manager dd All of these methods failed. What is the most elegant way of writing t...	[ -0.0194091796875, 0.00433349609375, 0.00164794921875, 0.0059814453125, -0.01611328125, 0.024658203125, 0.00064849853515625, -0.0107421875, -0.0034332275390625, 0.00179290771484375, 0.00130462646484375, -0.0244140625, 0.0206298828125, -0.01416015625, 0.01055908203125, 0.013671875, 0.0...	[ 3003, 4028, 33177, 1010, 112079, 18, 397, 71, 93147, 31095, 28412, 9319, 335, 567, 17780, 132, 2203, 7225, 3884, 71713, 19, 841, 13817, 4, 876, 6097, 150624, 165523, 2684, 27650, 3917, 32562, 903, 18151, 35743, 28864, 26073, 1556, 142508, ...	[ 0.161865234375, 0.211669921875, 0.1470947265625, 0.1456298828125, 0.134033203125, 0.0235595703125, 0.109130859375, 0.1748046875, 0.2626953125, 0.21484375, 0.21142578125, 0.1810302734375, 0.05914306640625, 0.09326171875, 0.1690673828125, 0.004302978515625, 0.004486083984375, 0.10534...	embed
25287791_c0	25287791	haskell	0	Title: If I restart compilation will it pick up where it left off? Problem title: If I restart compilation will it pick up where it left off? Tags: makefile, haskell, ghc Problem: If I restart compilation will it pick up where it left off? I'm building GHC from source but forgot to add the -j3 option to tell it to use ...	If I restart compilation will it pick up where it left off? If I restart compilation will it pick up where it left off? makefile haskell ghc If I restart compilation will it pick up where it left off? I'm building GHC from source but forgot to add the -j3 option to tell it to use both cores on my machine. If I Ctrl-c a...	[ -0.01373291015625, 0.0012054443359375, 0.01300048828125, 0.00946044921875, -0.00946044921875, 0.0030975341796875, -0.0277099609375, 0.0093994140625, -0.01123046875, -0.0247802734375, -0.02392578125, -0.022216796875, 0.000919342041015625, 0.0245361328125, 0.00823974609375, 0.00952148437...	[ 4263, 87, 456, 17137, 98352, 1363, 1221, 39580, 1257, 7440, 25737, 5773, 3249, 29822, 1556, 142508, 31380, 238, 33976, 527, 73265, 1295, 31344, 100, 9904, 15190, 20, 170, 363, 35829, 14192, 4527, 15044, 48052, 36279, 68847, 9433, 21342, 435...	[ 0.04095458984375, 0.038818359375, 0.134033203125, 0.2255859375, 0.193603515625, 0.0555419921875, 0.06439208984375, 0.138671875, 0.1573486328125, 0.06719970703125, 0.085205078125, 0.1295166015625, 0.09521484375, 0.1810302734375, 0.1190185546875, 0.2215576171875, 0.1368408203125, 0.1...	embed
26995382_c0	26995382	haskell	0	Title: Type signatures that never make sense Problem title: Type signatures that never make sense Tags: types, haskell, parametric-polymorphism, signature, type-signature Problem: Type signatures that never make sense Consider (a->a) -> [a] -> Bool Is there any meaningful definition for this signature? That is, a defin...	Type signatures that never make sense Type signatures that never make sense types haskell parametric-polymorphism signature type-signature Type Bool Type signatures that never make sense Consider Is there any meaningful definition for this signature? That is, a definition that not simply ignores the argument? It seems ...	[ 0.00732421875, 0.01202392578125, -0.00726318359375, -0.0037078857421875, -0.0033416748046875, 0.025146484375, 0.01025390625, -0.005462646484375, 0.000934600830078125, -0.01336669921875, -0.01385498046875, -0.029052734375, -0.0196533203125, 0.00787353515625, -0.00439453125, -0.002075195...	[ 60457, 138256, 7, 450, 8306, 3249, 10422, 52895, 1556, 142508, 121, 186518, 135545, 178851, 8780, 10644, 137432, 2460, 929, 137399, 2499, 91084, 7844, 80934, 100, 903, 959, 124962, 10750, 37202, 5941, 6044, 831, 79986, 71, 1810, 109312 ]	[ 0.215087890625, 0.2303466796875, 0.0380859375, 0.06884765625, 0.1419677734375, 0.1204833984375, 0.2081298828125, 0.220458984375, 0.11181640625, 0.2147216796875, 0.062225341796875, 0.1466064453125, 0.112060546875, 0.1697998046875, 0.0518798828125, 0.182373046875, 0.19189453125, 0.11...	embed
22132328_c0	22132328	haskell	0	Title: Haskell - find out type Signature Problem title: Haskell - find out type Signature Tags: functional-programming, haskell, type-signature, evaluate Problem: Haskell - find out type Signature I'm new to Haskell and Functional Programming and I'm not able to figure out why the type-signature of t2 = (\x y z a -> ((...	Haskell - find out type Signature Haskell - find out type Signature functional-programming haskell type-signature evaluate Haskell Signature Haskell - find out type Signature I'm new to Haskell and Functional Programming and I'm not able to figure out why the type-signature of looks like this: Could you please tell me ...	[ 0.022216796875, 0.01275634765625, -0.001922607421875, 0.0322265625, 0.004425048828125, 0.00927734375, -0.012939453125, 0.0181884765625, 0.00384521484375, 0.00732421875, -0.0181884765625, -0.0211181640625, 0.0103759765625, 0.00384521484375, -0.004364013671875, 0.00189208984375, 0.0081...	[ 20625, 142508, 7413, 1810, 10644, 26729, 141762, 123309, 28966, 1556, 137432, 151575, 3525, 28670, 10763, 27958, 959, 19048, 26366, 15400, 9, 13, 111, 33342, 1884, 903, 191147, 22936, 14192, 163, 3642, 442, 43240, 28601 ]	[ 0.1239013671875, 0.23095703125, 0.0977783203125, 0.095947265625, 0.234619140625, 0.1279296875, 0.2056884765625, 0.1083984375, 0.10601806640625, 0.113037109375, 0.202880859375, 0.117431640625, 0.028900146484375, 0.02325439453125, 0.01324462890625, 0.07672119140625, 0.0377197265625, ...	embed
65376307_c0	65376307	haskell	0	Title: unlawful lens Haskell Problem title: unlawful lens Haskell Tags: lenses, haskell Problem: unlawful lens Haskell Is there a common name/type for a lens-like object that does not satisfy the property of getting out what you put in? For example something like a listLength :: Lens [a] Int where if you put in a lengt...	unlawful lens Haskell unlawful lens Haskell lenses haskell Haskell Lens unlawful lens Haskell Is there a common name/type for a lens-like object that does not satisfy the property of getting out what you put in? For example something like a listLength :: Lens [a] Int where if you put in a length shorter than that of th...	[ 0.004638671875, 0.0081787109375, -0.0034027099609375, 0.0152587890625, 0.0030364990234375, 0.01519775390625, -0.01416015625, -0.0123291015625, -0.000736236572265625, 0.0079345703125, 0.003326416015625, 0.019775390625, 0.0002155303955078125, -0.006134033203125, 0.0019989013671875, 0.004...	[ 51, 19729, 7844, 3098, 20625, 142508, 96, 47754, 1556, 18226, 2071, 2685, 10, 39210, 9351, 50986, 100, 7, 5062, 36746, 450, 14602, 959, 40407, 57266, 111, 20949, 1810, 2367, 3884, 23, 1884, 5303, 5267, 449, 927, 1984, 11, 360, 18, 14090...	[ 0.0594482421875, 0.139892578125, 0.10430908203125, 0.1982421875, 0.13330078125, 0.2322998046875, 0.10107421875, 0.091796875, 0.116455078125, 0.2119140625, 0.0200653076171875, 0.0240020751953125, 0.00933837890625, 0.124755859375, 0.0819091796875, 0.146240234375, 0.00885009765625, 0....	embed
23690444_c0	23690444	haskell	0	Title: After installing a new GHC version, why does ghc --version still shows the old version? Problem title: After installing a new GHC version, why does ghc --version still shows the old version? Tags: ghc, haskell Problem: After installing a new GHC version, why does ghc --version still shows the old version? I've f...	After installing a new GHC version, why does ghc --version still shows the old version? After installing a new GHC version, why does ghc --version still shows the old version? ghc haskell After GHC After installing a new GHC version, why does ghc --version still shows the old version? I've finally installed ghc 7.8.2, ...	[ 0.00396728515625, 0.01251220703125, 0.03662109375, 0.017578125, 0.00225830078125, 0.01104736328125, -0.02490234375, 0.005340576171875, 0.0013275146484375, 0.042724609375, -0.0216064453125, -0.03955078125, -0.00811767578125, 0.0027923583984375, 0.006866455078125, 0.00787353515625, 0.0...	[ 24372, 20600, 3525, 527, 73265, 11389, 15400, 31380, 238, 4210, 46354, 7464, 45831, 10332, 1556, 142508, 14602, 77681, 2861, 128423, 1284, 10644, 124090, 17378, 200768, 903, 3444, 176683 ]	[ 0.04840087890625, 0.119384765625, 0.054351806640625, 0.08837890625, 0.2095947265625, 0.14501953125, 0.0843505859375, 0.1424560546875, 0.1375732421875, 0.1304931640625, 0.148681640625, 0.0908203125, 0.1036376953125, 0.109375, 0.104736328125, 0.2001953125, 0.000244140625, 0.023300170...	embed
73145463_c0	73145463	haskell	0	Title: How to write functor instance in haskell with data constructors Problem title: How to write functor instance in haskell with data constructors Tags: haskell, functor Problem: How to write functor instance in haskell with data constructors We are given type ID = Int data LST a = Leaf ID a \| Node ID [LST a] derivi...	How to write functor instance in haskell with data constructors How to write functor instance in haskell with data constructors haskell functor How LST Leaf Node Show Functor How to write functor instance in haskell with data constructors We are given How may I write a functor instance for LST, such that	[ 0.003082275390625, -0.01287841796875, -0.0142822265625, -0.0101318359375, 0.026611328125, 0.0022430419921875, -0.0048828125, -0.0164794921875, 0.01422119140625, -0.025634765625, -0.01708984375, -0.0106201171875, -0.00103759765625, 0.0086669921875, -0.005615234375, 0.00168609619140625, ...	[ 11249, 33022, 7477, 18770, 110527, 1556, 142508, 678, 2053, 64549, 25251, 47, 339, 8545, 636, 2407, 438, 112, 17367, 28670, 34475, 1543, 100 ]	[ 0.036346435546875, 0.18701171875, 0.1798095703125, 0.203125, 0.259521484375, 0.1492919921875, 0.221435546875, 0.10247802734375, 0.086669921875, 0.150390625, 0.08929443359375, 0.0308685302734375, 0.08062744140625, 0.1796875, 0.08099365234375, 0.159423828125, 0.12188720703125, 0.1167...	embed
43424777_c0	43424777	haskell	0	Title: Adding two complex numbers in Haskell Problem title: Adding two complex numbers in Haskell Tags: haskell Problem: Adding two complex numbers in Haskell I made the adding of two complex numbers in Haskell like this: data Complex = C { realC :: Double , imgC :: Double } deriving Show addC :: Complex -> Complex -> ...	Adding two complex numbers in Haskell Adding two complex numbers in Haskell haskell Adding Haskell Complex Double Show Adding two complex numbers in Haskell I made the adding of two complex numbers in Haskell like this: My question is: Can i make the above function (addC) point-free?	[ 0.001220703125, 0.01068115234375, 0.0125732421875, 0.0284423828125, 0.0244140625, -0.0019989013671875, 0.004058837890625, -0.0128173828125, -0.001922607421875, -0.025146484375, 0.0036163330078125, -0.0029296875, -0.007354736328125, 0.0196533203125, -0.0177001953125, -0.00811767578125, ...	[ 62, 59725, 6626, 27140, 101935, 20625, 142508, 1556, 113197, 107172, 17367, 154107, 111, 1884, 903, 4171, 3249, 36917, 32354, 11, 4028, 441, 6275, 9, 32087 ]	[ 0.07684326171875, 0.07440185546875, 0.131103515625, 0.228759765625, 0.1441650390625, 0.1473388671875, 0.2322998046875, 0.133056640625, 0.21484375, 0.1287841796875, 0.16064453125, 0.148681640625, 0.031707763671875, 0.034423828125, 0.0109710693359375, 0.06243896484375, 0.03912353515625...	embed
60715148_c2	60715148	haskell	2	(1 / 2)) \|\|\| Full) \| 21 \| else onWorkspace "web" (avoidStruts $ Mirror (multiCol [1] 1 0.02 (-0.5)) \|\|\| Full) $ \| Code signals: XMonad, XMonad.Config.Desktop, XMonad.Hooks.ManageDocks, XMonad.Layout.LayoutModifier, XMonad.Layout.MultiColumns, XMonad.Layout.PerWorkspace, XMonad.Layout.ThreeColumns, Data.Maybe, System.E...	(1 / 2)) \|\|\| Full) \| 21 \| else onWorkspace "web" (avoidStruts $ Mirror (multiCol [1] 1 0.02 (-0.5)) \|\|\| Full) $ \| Code signals: XMonad, XMonad.Config.Desktop, XMonad.Hooks.ManageDocks, XMonad.Layout.LayoutModifier, XMonad.Layout.MultiColumns, XMonad.Layout.PerWorkspace, XMonad.Layout.ThreeColumns, Data.Maybe, System.E...	[ -0.006683349609375, 0.0201416015625, -0.004913330078125, 0.005340576171875, 0.00124359130859375, 0.0174560546875, 0.0079345703125, -0.037841796875, 0.01519775390625, 0.01190185546875, 0.0174560546875, 0.01251220703125, 0.01068115234375, -0.001617431640625, -0.01104736328125, -0.0084228...	[ 2858, 248, 4958, 16, 58745, 9312, 6, 952, 37076, 98, 108259, 65421, 14051, 14426, 532, 71713, 49534, 3650, 150481, 144227, 78457, 17550, 106, 89678, 304, 15, 9, 93645, 28864, 26073, 7, 12, 1193, 46674, 712, 4, 5, 83671, 4657, 1042, 1378...	[ 0.103515625, 0.0865478515625, 0.1475830078125, 0.05462646484375, 0.06085205078125, 0.26025390625, 0.02691650390625, 0.21923828125, 0.1260986328125, 0.1842041015625, 0.1754150390625, 0.2763671875, 0.190185546875, 0.17431640625, 0.1346435546875, 0.1612548828125, 0.163330078125, 0.072...	embed
13485374_c0	13485374	haskell	0	Title: Railroad diagrams for Haskell? Problem title: Railroad diagrams for Haskell? Tags: grammar, haskell Problem: Railroad diagrams for Haskell? Anyone knows a book or a web-site that would feature a simple set of railroad diagrams for Haskell grammar? Something like this but in English: http://www.cs.uu.nl/wiki/pub/...	Railroad diagrams for Haskell? Railroad diagrams for Haskell? grammar haskell Railroad Haskell Railroad diagrams for Haskell? Anyone knows a book or a web-site that would feature a simple set of railroad diagrams for Haskell grammar? Something like this but in English: http://www.cs.uu.nl/wiki/pub/FP/CourseLiterature/h...	[ 0.009033203125, 0.0230712890625, -0.00982666015625, 0.00323486328125, -0.0072021484375, 0.018798828125, -0.01611328125, 0.0179443359375, -0.01483154296875, -0.0169677734375, 0.0169677734375, -0.03515625, -0.0047607421875, 0.0050048828125, -0.001068115234375, -0.01904296875, 0.0030975...	[ 85736, 52562, 117233, 7, 100, 20625, 142508, 122092, 147, 1556, 3630, 93002, 12877, 1467, 11090, 60213, 8781, 5423, 68823, 1884, 14941, 4439, 17349, 13169, 13691, 111596, 51006, 10557, 12654, 86531, 24931, 15483, 8859, 33209, 22799, 2565, 3688,...	[ 0.114013671875, 0.1468505859375, 0.2127685546875, 0.0794677734375, 0.0772705078125, 0.143798828125, 0.253173828125, 0.1312255859375, 0.095947265625, 0.1162109375, 0.009063720703125, 0.046630859375, 0.0902099609375, 0.0291900634765625, 0.03643798828125, 0.0220489501953125, 0.110717773...	embed
23957026_c0	23957026	haskell	0	Title: Haskell understanding some functions Problem title: Haskell understanding some functions Tags: haskell, stream Problem: Haskell understanding some functions Can someone please explain why the first function generates the stream "a" , "aa" , "aaa" .. ? Or why the second generates a stream of prefixes for example:...	Haskell understanding some functions Haskell understanding some functions haskell stream Haskell Haskell understanding some functions Can someone please explain why the first function generates the stream "a" , "aa" , "aaa" .. ? Or why the second generates a stream of prefixes for example: prefixes [1,2,3..] -> [[],[1]...	[ 0.0106201171875, 0.00360107421875, -0.007354736328125, -0.00250244140625, 0.0037078857421875, -0.00555419921875, 0.0150146484375, -0.02099609375, 0.01483154296875, -0.00555419921875, 0.01531982421875, -0.036865234375, 0.026123046875, 0.0162353515625, 0.005584716796875, -0.0046081542968...	[ 20625, 142508, 100094, 3060, 32354, 7, 1556, 75973, 4171, 22008, 22936, 73342, 15400, 5117, 139392, 44, 11, 4, 84022, 1468, 3347, 70, 17932, 10, 111, 183114, 90, 27781, 68252, 155761, 5, 33079, 110558, 25256, 133063 ]	[ 0.152099609375, 0.2393798828125, 0.1832275390625, 0.0826416015625, 0.2178955078125, 0.0823974609375, 0.1519775390625, 0.268310546875, 0.037139892578125, 0.01556396484375, 0.050445556640625, 0.161865234375, 0.1666259765625, 0.1192626953125, 0.20654296875, 0.00384521484375, 0.127075195...	embed
49741312_c0	49741312	haskell	0	Title: What does the :~> operator do in haskell Problem title: What does the :~> operator do in haskell Tags: types, functional-programming, haskell, servant Problem: What does the :~> operator do in haskell I was looking through a github project that seems to be a website using haskell and elm. It uses the opera...	What does the :~> operator do in haskell What does the :~> operator do in haskell types functional-programming haskell servant What What does the :~> operator do in haskell I was looking through a github project that seems to be a website using haskell and elm. It uses the operator :~> in a type signature in this...	[ 0.01239013671875, -0.004852294921875, 0.01397705078125, 0.0012664794921875, -0.0155029296875, 0.00970458984375, -0.004913330078125, 0.0133056640625, -0.01226806640625, 0.004486083984375, 0.01092529296875, -0.037109375, 0.008056640625, 0.00372314453125, -0.01458740234375, -0.009765625, ...	[ 4865, 14602, 70, 152, 2306, 1230, 5386, 74, 39933, 54, 23, 1556, 142508, 52895, 123309, 28966, 187646, 2740, 62270, 32102, 13452, 4165, 17368, 88, 39, 4527, 10644, 138256, 11435, 80934, 903, 442, 44084, 35839 ]	[ 0.067138671875, 0.0618896484375, 0.0372314453125, 0.092529296875, 0.1654052734375, 0.1058349609375, 0.1832275390625, 0.0194244384765625, 0.2406005859375, 0.116455078125, 0.07427978515625, 0.1375732421875, 0.237060546875, 0.1453857421875, 0.1298828125, 0.07025146484375, 0.187133789062...	embed
50808477_c1	50808477	haskell	1	to include everything relevant, but the full Foundation.hs is at https://gist.github.com/hyperpape/39d4d2baf67d3bdbdba45a943e7e0425 Code signals: the, YesodAuthEmail, HandlerFor, site0, App, Yesod-Postgres, YesodAuth, AuthId, UserId, AuthPlugin, Claimed, AuthEmailId, HomeR, User, Nothing, Foundation.hs:273:11, Could, ...	to include everything relevant, but the full Foundation.hs is at https://gist.github.com/hyperpape/39d4d2baf67d3bdbdba45a943e7e0425 Code signals: the, YesodAuthEmail, HandlerFor, site0, App, Yesod-Postgres, YesodAuth, AuthId, UserId, AuthPlugin, Claimed, AuthEmailId, HomeR, User, Nothing, Foundation.hs:273:11, Could, ...	[ -0.003936767578125, 0.025146484375, 0.0016021728515625, -0.0244140625, -0.001800537109375, 0.007476806640625, -0.016357421875, -0.041748046875, 0.0098876953125, -0.03173828125, 0.00531005859375, 0.0147705078125, -0.0177001953125, 0.0196533203125, -0.020263671875, -0.00433349609375, -...	[ 47, 26698, 26818, 29191, 4, 1284, 4393, 32807, 5, 127, 7, 83, 99, 735, 271, 15769, 32102, 3038, 1264, 60895, 13, 2588, 28864, 26073, 12, 70, 32635, 2199, 67362, 927, 161994, 10639, 603, 18537, 1764, 2389, 5659, 49411, 17562, 5655, 568, ...	[ 0.00811767578125, 0.145263671875, 0.0794677734375, 0.1707763671875, 0.04217529296875, 0.0052490234375, 0.07855224609375, 0.267578125, 0.0804443359375, 0.1490478515625, 0.125732421875, 0.01177978515625, 0.0064697265625, 0.0187530517578125, 0.004669189453125, 0.096435546875, 0.11901855...	embed
51236170_c0	51236170	haskell	0	Title: Are List Int and List String the same category in Haskell/Category theory? Problem title: Are List Int and List String the same category in Haskell/Category theory? Tags: category-theory, haskell Problem: Are List Int and List String the same category in Haskell/Category theory? Are List Int and List String the ...	Are List Int and List String the same category in Haskell/Category theory? Are List Int and List String the same category in Haskell/Category theory? category-theory haskell List Haskell Category Are List Int and List String the same category in Haskell/Category theory? Are List Int and List String the same category in...	[ 0.0023651123046875, 0.00860595703125, -0.00689697265625, 0.01171875, -0.009765625, 0.007080078125, 0.00897216796875, -0.0224609375, 0.0118408203125, 0.019775390625, -0.029541015625, -0.03857421875, 0.000797271728515625, 0.017578125, -0.03662109375, 0.004058837890625, 0.0142822265625,...	[ 15901, 32036, 360, 18, 136, 23351, 214, 70, 5701, 95487, 20625, 142508, 76775, 3081, 154453, 2347, 1556, 49057, 149766, 621, 1836, 90698 ]	[ 0.04412841796875, 0.204833984375, 0.151611328125, 0.16748046875, 0.08013916015625, 0.2257080078125, 0.127685546875, 0.0147705078125, 0.1109619140625, 0.253662109375, 0.1187744140625, 0.2152099609375, 0.0638427734375, 0.16064453125, 0.1201171875, 0.00634765625, 0.0682373046875, 0.19...	embed
47881350_c0	47881350	haskell	0	Title: groupByKey in Haskell - How to group items in a list by a function? Problem title: groupByKey in Haskell - How to group items in a list by a function? Tags: haskell Problem: groupByKey in Haskell - How to group items in a list by a function? Given a list [v] and a keying function f :: v -> k , I want to generate...	groupByKey in Haskell - How to group items in a list by a function? groupByKey in Haskell - How to group items in a list by a function? haskell Data.Map Haskell How Map groupByKey in Haskell - How to group items in a list by a function? Given a list [v] and a keying function f :: v -> k , I want to generate a map Map k...	[ 0.0014190673828125, 0.0028533935546875, 0.017822265625, -0.034423828125, -0.000522613525390625, 0.007415771484375, -0.00860595703125, -0.0045166015625, -0.0008087158203125, 0.00836181640625, -0.01092529296875, 0.00946044921875, 0.0242919921875, 0.0301513671875, -0.02490234375, -0.00537...	[ 21115, 75358, 162429, 20625, 142508, 11249, 55769, 23, 5303, 390, 32354, 47, 1556, 11809, 166179, 42719, 77878, 334, 22799, 214, 1238, 1984, 81, 33079, 472, 3444, 139392, 22288, 1884, 32316 ]	[ 0.23046875, 0.1270751953125, 0.233642578125, 0.1248779296875, 0.2222900390625, 0.0699462890625, 0.1624755859375, 0.0809326171875, 0.1817626953125, 0.09002685546875, 0.1678466796875, 0.01800537109375, 0.09423828125, 0.053924560546875, 0.1436767578125, 0.1964111328125, 0.01278686523437...	embed
9095443_c0	9095443	haskell	0	Title: Print String as pattern in Haskell Problem title: Print String as pattern in Haskell Tags: haskell Problem: Print String as pattern in Haskell I am from OO background and very new to Haskell. In order to print a pattern like: 1 2 3 4 5 1 2 3 4 1 2 3 1 2 1 i made a list let xs = ["1 2 3 4 5\n" ,"1 2 3 4\n" ,"1 2 ...	Print String as pattern in Haskell Print String as pattern in Haskell haskell Print Haskell Print String as pattern in Haskell I am from OO background and very new to Haskell. In order to print a pattern like: i made a list But i get the output like How can i get the desired output?	[ 0.0000743865966796875, 0.0191650390625, -0.022705078125, 0.016357421875, -0.0184326171875, 0.01287841796875, -0.0157470703125, -0.0033416748046875, 0.01165771484375, 0.01708984375, 0.003936767578125, -0.048828125, 0.030517578125, 0.01031494140625, -0.0216064453125, 0.00665283203125, ...	[ 39754, 23351, 214, 237, 103510, 23, 20625, 142508, 1556, 1295, 30563, 76615, 4552, 3525, 47, 28412, 1884, 17, 7228, 5303, 4966, 2046, 140992, 11249, 831, 104851 ]	[ 0.207763671875, 0.1983642578125, 0.12841796875, 0.1258544921875, 0.280517578125, 0.03289794921875, 0.12005615234375, 0.2098388671875, 0.10504150390625, 0.038970947265625, 0.097412109375, 0.09716796875, 0.02093505859375, 0.061492919921875, 0.0113983154296875, 0.1900634765625, 0.095947...	embed
10862022_c0	10862022	haskell	0	Title: Are monads just ways of composing functions which would otherwise not compose? Problem title: Are monads just ways of composing functions which would otherwise not compose? Tags: monads, haskell Problem: Are monads just ways of composing functions which would otherwise not compose? The bind function seems remark...	Are monads just ways of composing functions which would otherwise not compose? Are monads just ways of composing functions which would otherwise not compose? monads haskell Are monads just ways of composing functions which would otherwise not compose? The bind function seems remarkably similar like a composition functi...	[ -0.030029296875, 0.010009765625, 0.0152587890625, 0.022216796875, -0.00311279296875, 0.0177001953125, -0.003814697265625, -0.001495361328125, -0.00109100341796875, -0.0302734375, -0.003509521484375, -0.01806640625, 0.00133514404296875, 0.006591796875, 0.0003108978271484375, -0.00759887...	[ 2667, 712, 7, 48322, 9969, 232, 32354, 959, 150350, 1660, 1556, 142508, 2806, 120262, 68557, 37202, 21373, 1884, 166577, 112397, 30646, 23937, 228624, 6528 ]	[ 0.171630859375, 0.259033203125, 0.1461181640625, 0.11474609375, 0.0877685546875, 0.0999755859375, 0.1627197265625, 0.035980224609375, 0.173828125, 0.012725830078125, 0.1192626953125, 0.2344970703125, 0.001434326171875, 0.012847900390625, 0.2469482421875, 0.038665771484375, 0.07092285...	embed
36758737_c0	36758737	haskell	0	Title: Haskell (-1) number issue Problem title: Haskell (-1) number issue Tags: haskell Problem: Haskell (-1) number issue Imagine this: f = (10) . (+1) It is a simple way to say to add 1 and then multiply by 10. Now check the following: f = ( 10) . (-1) Here -1 is a number, not a function, I would like to know if th...	Haskell (-1) number issue Haskell (-1) number issue haskell Haskell Haskell (-1) number issue Imagine this: It is a simple way to say to add 1 and then multiply by 10. Now check the following: Here -1 is a number, not a function, I would like to know if there is a function available to avoid this or this I know they ar...	[ 0.0025634765625, 0.003204345703125, 0.00537109375, -0.00286865234375, -0.006500244140625, -0.00408935546875, -0.005340576171875, -0.005279541015625, -0.00213623046875, -0.042724609375, -0.0057373046875, 0.0029144287109375, -0.007171630859375, 0.0031280517578125, 0.004974365234375, -0.0...	[ 20625, 142508, 110218, 14012, 31089, 1556, 15, 133196, 8781, 3917, 5154, 15190, 106, 136, 7068, 6024, 62479, 390, 4068, 12765, 70, 11853, 68940, 83, 959, 32354, 1884, 3714, 19882, 71864, 903, 7108, 2806, 3249 ]	[ 0.1507568359375, 0.25634765625, 0.29345703125, 0.2335205078125, 0.1932373046875, 0.1412353515625, 0.011566162109375, 0.09637451171875, 0.0657958984375, 0.0229644775390625, 0.045989990234375, 0.1204833984375, 0.10150146484375, 0.029296875, 0.00970458984375, 0.0733642578125, 0.12841796...	embed
40473096_c0	40473096	haskell	0	Title: Make variable from input accessible from the whole code Problem title: Make variable from input accessible from the whole code Tags: haskell Problem: Make variable from input accessible from the whole code Is this even possible? I have a main that saves an Int (width) given by the user as a variable, but I need ...	Make variable from input accessible from the whole code Make variable from input accessible from the whole code haskell input the Make Make variable from input accessible from the whole code Is this even possible? I have a main that saves an Int (width) given by the user as a variable, but I need that variable in a bun...	[ -0.010009765625, 0.0247802734375, -0.021240234375, 0.00110626220703125, 0.00726318359375, 0.0081787109375, -0.0036773681640625, 0.0079345703125, 0.0048828125, -0.05126953125, -0.00787353515625, -0.0123291015625, 0.0091552734375, 0.029541015625, -0.005096435546875, 0.010498046875, 0.0...	[ 26176, 77336, 1295, 107730, 81522, 70, 28271, 18151, 1556, 142508, 2071, 903, 3853, 7722, 765, 5201, 30098, 360, 18, 146984, 34475, 390, 38937, 237, 1284, 3871, 450, 23, 147306, 3789, 32354, 3917, 54, 154107, 10750, 11907 ]	[ 0.1568603515625, 0.2861328125, 0.161376953125, 0.21875, 0.251220703125, 0.0135498046875, 0.19189453125, 0.1812744140625, 0.1512451171875, 0.2208251953125, 0.00982666015625, 0.082763671875, 0.0501708984375, 0.1602783203125, 0.00115966796875, 0.1033935546875, 0.12841796875, 0.0611267...	embed
33319720_c1	33319720	haskell	1	jyLBDbJPCH01j/Test.HUnit.Lang in ["./.hpc","./dist/hpc/vanilla/mix/myproject-0.1.0","./dist/hpc/vanilla/mix/tests"] What? I've never seen this, although I generated many reports before. Someone up there just decided that I won't get that report today, it seems. Do you know how to generate coverage report using Stack? H...	jyLBDbJPCH01j/Test.HUnit.Lang in ["./.hpc","./dist/hpc/vanilla/mix/myproject-0.1.0","./dist/hpc/vanilla/mix/tests"] What? I've never seen this, although I generated many reports before. Someone up there just decided that I won't get that report today, it seems. Do you know how to generate coverage report using Stack? H...	[ 0.00311279296875, -0.0002346038818359375, 0.00360107421875, 0.0196533203125, -0.02490234375, 0.0004062652587890625, -0.005706787109375, -0.01519775390625, -0.00145721435546875, 0.00677490234375, -0.0205078125, 0.011962890625, -0.008544921875, 0.005126953125, 0.0042724609375, 0.02197265...	[ 1550, 48097, 122063, 16999, 6746, 170, 111337, 27204, 6773, 2729, 449, 127, 57095, 46295, 2187, 2298, 62015, 1176, 95322, 23320, 102107, 6954, 4865, 8306, 51592, 903, 139392, 5941, 117729, 1257, 68872, 23742, 18, 2046, 13416, 18925, 37202, 37...	[ 0.096435546875, 0.0625, 0.02691650390625, 0.08465576171875, 0.045654296875, 0.0845947265625, 0.226318359375, 0.1259765625, 0.2220458984375, 0.08154296875, 0.1920166015625, 0.0276641845703125, 0.13134765625, 0.0672607421875, 0.10455322265625, 0.1939697265625, 0.201904296875, 0.11853...	embed
45033909_c1	45033909	haskell	1	doubleCheck a b \| (((first b) `div` (first a)) == ((second b) `div` (second a))) && ((first b) `mod` (first a) == 0) && ((second b) `mod` (second a) == 0) = True \| otherwise = False Now with the things I heard and read about Haskell and the power of higher order functions I suppose the solution would be like two lines...	doubleCheck a b \| (((first b) `div` (first a)) == ((second b) `div` (second a))) && ((first b) `mod` (first a) == 0) && ((second b) `mod` (second a) == 0) = True \| otherwise = False Now with the things I heard and read about Haskell and the power of higher order functions I suppose the solution would be like two lines...	[ -0.0169677734375, 0.0057373046875, -0.0152587890625, 0.004547119140625, 0.005859375, 0.0194091796875, -0.0086669921875, -0.025390625, 0.00604248046875, 0.00506591796875, 0.01275634765625, 0.0130615234375, 0.01239013671875, -0.0054931640625, -0.0166015625, -0.004302978515625, 0.010803...	[ 41929, 202567, 10, 876, 58745, 128258, 13448, 271, 30618, 69112, 191633, 13415, 757, 1230, 6, 87599, 120262, 22225, 184, 49782, 20625, 142508, 14537, 77546, 12989, 32354, 139124, 29806, 2806, 1884, 6626, 124519, 18151, 179933, 903, 5155, 831, ...	[ 0.23876953125, 0.3291015625, 0.095703125, 0.16357421875, 0.014373779296875, 0.010711669921875, 0.0594482421875, 0.031402587890625, 0.238525390625, 0.1497802734375, 0.13818359375, 0.188720703125, 0.15673828125, 0.0162506103515625, 0.04888916015625, 0.159912109375, 0.0843505859375, 0...	embed
6344754_c0	6344754	haskell	0	Title: haskell front letters Problem title: haskell front letters Tags: haskell Problem: haskell front letters So im educating myself for the future firstLetter :: IO String firstLetter = do x <- getChar if (x == ' ') then return (show x) else firstLetter So it would get lines until the first line, that starts with emp...	haskell front letters haskell front letters haskell Liquid Osone LOL haskell front letters So im educating myself for the future So it would get lines until the first line, that starts with empty char how can I do it, so if empty line comes, it returns all head(x) for example:	[ 0.00811767578125, -0.01324462890625, -0.0245361328125, 0.0179443359375, 0.0169677734375, 0.016845703125, 0.0157470703125, 0.00799560546875, -0.0076904296875, -0.0230712890625, -0.004058837890625, 0.0009613037109375, 0.01055908203125, 0.017578125, 0.0030975341796875, -0.0013198852539062...	[ 1556, 142508, 12912, 120820, 170527, 63625, 86, 128859, 566, 155629, 22690, 442, 2806, 2046, 124519, 24189, 5117, 13315, 4034, 201505, 21441, 3642, 831, 54, 32497, 30646, 756, 10336, 425, 27781 ]	[ 0.1484375, 0.2255859375, 0.1884765625, 0.18359375, 0.1656494140625, 0.10986328125, 0.0986328125, 0.1175537109375, 0.004974365234375, 0.05316162109375, 0.05828857421875, 0.040924072265625, 0.039825439453125, 0.0841064453125, 0.194580078125, 0.12744140625, 0.0963134765625, 0.16772460...	embed
58784011_c0	58784011	haskell	0	Title: A function that implies true when a and b have the same value Problem title: A function that implies true when a and b have the same value Tags: haskell Problem: A function that implies true when a and b have the same value I am trying to get true when both a and b are true or both of them are false. Can someone...	A function that implies true when a and b have the same value A function that implies true when a and b have the same value haskell Bool A function that implies true when a and b have the same value I am trying to get true when both a and b are true or both of them are false. Can someone tell me what am I doing wrong?	[ -0.004730224609375, -0.00067138671875, 0.008544921875, 0.0238037109375, 0.0019683837890625, 0.03466796875, -0.00897216796875, -0.0157470703125, -0.00390625, 0.01068115234375, 0.0115966796875, 0.0128173828125, -0.01141357421875, 0.01348876953125, 0.002685546875, -0.010986328125, 0.002...	[ 62, 32354, 450, 35388, 90, 29568, 3229, 10, 136, 876, 765, 70, 5701, 34292, 1556, 142508, 2460, 929, 31577, 47, 2046, 15044, 707, 2856, 621, 98320, 4171, 22008, 14192, 163, 444, 20594, 44691 ]	[ 0.1185302734375, 0.239501953125, 0.0660400390625, 0.258056640625, 0.0892333984375, 0.251953125, 0.12158203125, 0.0953369140625, 0.1334228515625, 0.1571044921875, 0.0982666015625, 0.05780029296875, 0.15625, 0.1976318359375, 0.1480712890625, 0.2208251953125, 0.107666015625, 0.2045898...	embed
58911691_c0	58911691	haskell	0	Title: GHC & Cabal on Raspberry Pi 4 with Debian Buster Problem title: GHC & Cabal on Raspberry Pi 4 with Debian Buster Tags: ghc, cabal, haskell Problem: GHC & Cabal on Raspberry Pi 4 with Debian Buster Is there already a way to install GHC & Cabal on a Raspberry Pi with Debian Buster? https://downloads.haskel...	GHC & Cabal on Raspberry Pi 4 with Debian Buster GHC & Cabal on Raspberry Pi 4 with Debian Buster ghc cabal haskell GHC Cabal Raspberry Debian Buster GHC & Cabal on Raspberry Pi 4 with Debian Buster Is there already a way to install GHC & Cabal on a Raspberry Pi with Debian Buster? https://downloads.haskell.org...	[ 0.00799560546875, 0.007354736328125, 0.0201416015625, -0.00457763671875, -0.010009765625, -0.00909423828125, -0.00701904296875, -0.01202392578125, -0.0098876953125, -0.000942230224609375, 0.0037841796875, -0.0458984375, 0.0074462890625, 0.0081787109375, 0.00494384765625, 0.007446289062...	[ 527, 73265, 619, 25133, 74, 30438, 289, 98, 225291, 3065, 201, 678, 262, 62806, 667, 1515, 31380, 238, 109524, 1556, 142508, 2071, 2685, 21771, 3917, 47, 20600, 61754, 10557, 112, 3871, 11469, 144573, 18151, 3525, 1398, 19639 ]	[ 0.1427001953125, 0.27392578125, 0.169921875, 0.119140625, 0.002838134765625, 0.23486328125, 0.23486328125, 0.08648681640625, 0.1929931640625, 0.2110595703125, 0.202392578125, 0.07421875, 0.1573486328125, 0.177001953125, 0.19873046875, 0.164306640625, 0.1414794921875, 0.100219726562...	embed
64693_c0	64693	haskell	0	Title: Simple haskell string manage Problem title: Simple haskell string manage Tags: string, haskell Problem: Simple haskell string manage Theres is a little problem I want to solve with Haskell: let substitute a function that change all of the wildcards in a string for one concrete parameter. The function has de sign...	Simple haskell string manage Simple haskell string manage string haskell Simple Simple haskell string manage Theres is a little problem I want to solve with Haskell: let substitute a function that change all of the wildcards in a string for one concrete parameter. The function has de signature of:	[ -0.0169677734375, -0.0017547607421875, -0.00830078125, 0.0208740234375, 0.0025787353515625, -0.0009613037109375, 0.00390625, 0.00604248046875, 0.01397705078125, 0.0015716552734375, 0.01513671875, -0.02392578125, 0.006591796875, 0.01104736328125, -0.01318359375, -0.00836181640625, 0.0...	[ 60552, 1556, 142508, 79315, 111240, 10176, 2967, 3444, 86869, 20625, 2633, 161740, 32354, 15549, 756, 111, 56409, 38931, 100, 1632, 122776, 171859, 8, 138256 ]	[ 0.140625, 0.1331787109375, 0.1954345703125, 0.2266845703125, 0.1951904296875, 0.064208984375, 0.09716796875, 0.0276947021484375, 0.076904296875, 0.1077880859375, 0.022979736328125, 0.1754150390625, 0.1708984375, 0.1827392578125, 0.07861328125, 0.0360107421875, 0.1390380859375, 0.23...	embed
21463903_c0	21463903	haskell	0	Title: Haskell: automatically de-sugar syntax Problem title: Haskell: automatically de-sugar syntax Tags: haskell, clojure Problem: Haskell: automatically de-sugar syntax Is there any function in Haskell that, given Haskell syntax input, return an equivalent expression with all syntactical sugar expanded? For example, ...	Haskell: automatically de-sugar syntax Haskell: automatically de-sugar syntax haskell clojure Haskell Haskell: automatically de-sugar syntax Is there any function in Haskell that, given Haskell syntax input, return an equivalent expression with all syntactical sugar expanded? For example, in Clojure, I can pass 'a to t...	[ 0.0206298828125, 0.01495361328125, -0.004486083984375, 0.0022430419921875, -0.00701904296875, 0.023193359375, -0.0089111328125, -0.01324462890625, -0.016845703125, -0.00994873046875, 0.005615234375, -0.00830078125, -0.0283203125, -0.00055694580078125, 0.00634765625, -0.00506591796875, ...	[ 20625, 142508, 191082, 8, 1159, 1970, 6002, 86531, 1556, 20450, 461, 107, 2071, 2685, 2499, 32354, 23, 450, 34475, 107730, 30646, 183234, 125195, 678, 756, 102, 49086, 289, 101087, 71062, 297, 51053, 831, 27875, 242, 11, 47, 155255, 1221, ...	[ 0.1397705078125, 0.254638671875, 0.1510009765625, 0.1798095703125, 0.11669921875, 0.144775390625, 0.1241455078125, 0.1405029296875, 0.11376953125, 0.09515380859375, 0.174072265625, 0.1356201171875, 0.011749267578125, 0.0247344970703125, 0.0511474609375, 0.1951904296875, 0.06860351562...	embed
7631664_c0	7631664	haskell	0	Title: How to define a rotates function Problem title: How to define a rotates function Tags: haskell Problem: How to define a rotates function How to define a rotates function that generates all rotations of the given list? For example: rotates [1,2,3,4] =[[1,2,3,4],[2,3,4,1],[3,4,1,2],[4,1,2,3]] I wrote a shift funct...	How to define a rotates function How to define a rotates function haskell How How to define a rotates function How to define a rotates function that generates all rotations of the given list? For example: rotates [1,2,3,4] =[[1,2,3,4],[2,3,4,1],[3,4,1,2],[4,1,2,3]] I wrote a shift function that can rearrange the order ...	[ -0.006683349609375, 0.02490234375, 0.017333984375, -0.01220703125, -0.01519775390625, -0.01708984375, -0.0308837890625, -0.00616455078125, 0.00067901611328125, -0.0128173828125, 0.00640869140625, -0.0137939453125, -0.0028533935546875, 0.000652313232421875, 0.0033721923828125, 0.0123291...	[ 11249, 61924, 10, 47014, 1636, 32354, 47, 1556, 142508, 450, 139392, 756, 5256, 34475, 5303, 133063, 82449, 304, 617, 96386, 54397, 122925, 831, 456, 147, 94250, 12989, 3642, 6097, 3525, 10298, 4778, 114689, 25842 ]	[ 0.054412841796875, 0.2147216796875, 0.07135009765625, 0.2318115234375, 0.2108154296875, 0.237548828125, 0.03472900390625, 0.141357421875, 0.21044921875, 0.00225830078125, 0.1767578125, 0.1065673828125, 0.1170654296875, 0.0283203125, 0.1556396484375, 0.09051513671875, 0.152099609375, ...	embed
13722203_c0	13722203	haskell	0	Title: Finding out which module a function belongs to Problem title: Finding out which module a function belongs to Tags: haskell, ghci Problem: Finding out which module a function belongs to In ghci (haskell) is there a command which will tell me which module (out of the loaded modules) a function belongs to. e.g. if ...	Finding out which module a function belongs to Finding out which module a function belongs to haskell ghci Finding Prelude Data.List Finding out which module a function belongs to In ghci (haskell) is there a command which will tell me which module (out of the loaded modules) a function belongs to. e.g. if the function...	[ 0.0177001953125, 0.006011962890625, -0.004302978515625, 0.0238037109375, 0.0006866455078125, 0.019775390625, 0.0020294189453125, 0.00069427490234375, -0.00098419189453125, -0.043212890625, -0.0089111328125, -0.044189453125, 0.0145263671875, -0.00848388671875, 0.002960205078125, 0.00976...	[ 26040, 214, 1810, 3129, 88996, 32354, 186, 10617, 7, 47, 10, 1556, 142508, 31380, 318, 1914, 822, 112, 11809, 154663, 10557, 2685, 75101, 1221, 14192, 163, 6056, 72367, 35839, 91616, 2806, 4488, 28960 ]	[ 0.08526611328125, 0.0146484375, 0.08941650390625, 0.1317138671875, 0.272216796875, 0.239501953125, 0.072509765625, 0.180908203125, 0.0694580078125, 0.156982421875, 0.02935791015625, 0.1063232421875, 0.2078857421875, 0.10357666015625, 0.1527099609375, 0.0391845703125, 0.135009765625, ...	embed
36663293_c0	36663293	haskell	0	Title: Should I run a file as a normal file or with stack exec "my_file"? Problem title: Should I run a file as a normal file or with stack exec "my_file"? Tags: haskell-stack, haskell Problem: Should I run a file as a normal file or with stack exec "my_file"? Is there any difference of how to run a...	Should I run a file as a normal file or with stack exec "my_file"? Should I run a file as a normal file or with stack exec "my_file"? haskell-stack haskell Should my_file Should I run a file as a normal file or with stack exec "my_file"? Is there any difference of how to run an exe file generated by...	[ 0.002349853515625, -0.018310546875, 0.004638671875, 0.00958251953125, -0.013427734375, 0.03173828125, -0.0224609375, 0.01214599609375, 0.0108642578125, -0.04736328125, 0.01129150390625, 0.0203857421875, -0.00090789794921875, 0.01953125, 0.01470947265625, 0.007537841796875, -0.0012283...	[ 151117, 87, 11675, 11435, 237, 10, 3638, 707, 678, 177261, 1119, 3240, 1176, 29822, 454, 1556, 142508, 590, 2594, 759, 60212, 3642, 47, 97733, 139392, 390, 4527, 1467, 38415, 10723 ]	[ 0.1240234375, 0.0072021484375, 0.19970703125, 0.1904296875, 0.139404296875, 0.07525634765625, 0.193115234375, 0.0745849609375, 0.0980224609375, 0.2254638671875, 0.1300048828125, 0.2158203125, 0.1654052734375, 0.25048828125, 0.02044677734375, 0.08953857421875, 0.207275390625, 0.1236...	embed
36706339_c0	36706339	haskell	0	Title: How do I get the contents of a URI that uses the `file` protocol in Haskell? Problem title: How do I get the contents of a URI that uses the `file` protocol in Haskell? Tags: haskell Problem: How do I get the contents of a URI that uses the `file` protocol in Haskell? How can I write a function of the type Text ...	How do I get the contents of a URI that uses the `file` protocol in Haskell? How do I get the contents of a URI that uses the `file` protocol in Haskell? haskell How URI Haskell Text Maybe ByteString How do I get the contents of a URI that uses the `file` protocol in Haskell? How can I write a function of the type Text...	[ 0.005126953125, -0.0015411376953125, -0.00457763671875, 0.00927734375, 0.01177978515625, 0, 0.01556396484375, -0.01141357421875, 0.005279541015625, -0.0126953125, 0.006988525390625, -0.01263427734375, -0.0076904296875, 0.00274658203125, 0.005218505859375, -0.002960205078125, -0.01806...	[ 11249, 2046, 70, 10941, 7, 46492, 4527, 29822, 91363, 20625, 142508, 1556, 24129, 83425, 3311, 67, 71713, 33022, 32354, 10644, 17780, 10750, 11435, 3584, 31, 1299 ]	[ 0.039947509765625, 0.116455078125, 0.00213623046875, 0.1834716796875, 0.08892822265625, 0.1962890625, 0.0601806640625, 0.2347412109375, 0.20361328125, 0.1373291015625, 0.2296142578125, 0.1131591796875, 0.150146484375, 0.04437255859375, 0.026458740234375, 0.061492919921875, 0.08728027...	embed
51614573_c0	51614573	haskell	0	Title: How to return a pure value from a impure method Problem title: How to return a pure value from a impure method Tags: monads, haskell, functor Problem: How to return a pure value from a impure method I know it must sound trivial but I was wondering how you can unwrap a value from a functor and return it as pure v...	How to return a pure value from a impure method How to return a pure value from a impure method monads haskell functor a How f::IO How to return a pure value from a impure method I know it must sound trivial but I was wondering how you can unwrap a value from a functor and return it as pure value? I have tried: What sh...	[ -0.01470947265625, 0.0103759765625, -0.0029449462890625, 0.0140380859375, 0.01416015625, 0.01287841796875, -0.01519775390625, -0.01239013671875, 0.0001583099365234375, -0.0277099609375, 0.006805419921875, -0.0203857421875, -0.022216796875, 0.01708984375, 0.00946044921875, -0.0057678222...	[ 11249, 47, 30646, 10, 34166, 34292, 1295, 21980, 3408, 55300, 2667, 712, 7, 1556, 142508, 7477, 18770, 1238, 17780, 3714, 8110, 45730, 149016, 3642, 831, 51, 434, 13631, 136, 442, 237, 765, 37842, 4865, 5608, 3687, 23, 7108, 5609, 18, 4...	[ 0.1085205078125, 0.0975341796875, 0.25634765625, 0.0726318359375, 0.2464599609375, 0.2169189453125, 0.15087890625, 0.162353515625, 0.2415771484375, 0.1927490234375, 0.07891845703125, 0.0958251953125, 0.010223388671875, 0.1390380859375, 0.222412109375, 0.1524658203125, 0.18994140625, ...	embed
52025471_c0	52025471	haskell	0	Title: Passing ghc-options to Stack script interpreter Problem title: Passing ghc-options to Stack script interpreter Tags: haskell-stack, haskell Problem: Passing ghc-options to Stack script interpreter I'm using Stack interpreter feature and having a code like this: #!/usr/bin/env stack -- stack script --resolver lts...	Passing ghc-options to Stack script interpreter Passing ghc-options to Stack script interpreter haskell-stack haskell Passing Stack lts-12.7 Passing ghc-options to Stack script interpreter I'm using Stack interpreter feature and having a code like this: I want to pass the ghc-options option to the stack interpreter to ...	[ -0.00927734375, 0.00946044921875, -0.006439208984375, 0.00136566162109375, -0.0240478515625, -0.0269775390625, -0.0040283203125, 0.007537841796875, -0.01141357421875, -0.032470703125, -0.00701904296875, 0.012939453125, -0.001953125, 0.01202392578125, -0.01226806640625, 0.01226806640625...	[ 28872, 214, 31380, 238, 109585, 7, 47, 6512, 2594, 26499, 29481, 56, 1556, 142508, 590, 933, 9955, 966, 17368, 60213, 18151, 1884, 903, 3444, 27875, 35829, 177261, 442, 2071, 7722 ]	[ 0.09771728515625, 0.002593994140625, 0.152099609375, 0.16064453125, 0.222900390625, 0.044036865234375, 0.0692138671875, 0.1268310546875, 0.116943359375, 0.1478271484375, 0.1783447265625, 0.1182861328125, 0.08697509765625, 0.151611328125, 0.076171875, 0.0518798828125, 0.03933715820312...	embed
20431964_c0	20431964	haskell	0	Title: What is the clojure equivalent for Haskell's <-? Problem title: What is the clojure equivalent for Haskell's <-? Tags: monads, haskell, clojure Problem: What is the clojure equivalent for Haskell's <-? I'm trying to figure out the IO monad and the <- syntax which I often see in Haskell code. I've...	What is the clojure equivalent for Haskell's <-? What is the clojure equivalent for Haskell's <-? monads haskell clojure What Haskell What is the clojure equivalent for Haskell's <-? I'm trying to figure out the IO monad and the <- syntax which I often see in Haskell code. I've seen it used with multipl...	[ -0.0026092529296875, 0.03173828125, 0.0091552734375, 0.025146484375, -0.0033721923828125, -0.0031280517578125, -0.0037841796875, -0.01177978515625, -0.00506591796875, -0.0257568359375, 0.002777099609375, -0.0260009765625, 0.0093994140625, -0.0211181640625, -0.005218505859375, -0.015075...	[ 4865, 20450, 461, 107, 183234, 100, 20625, 142508, 3768, 1277, 9, 83, 70, 7, 2667, 712, 1556, 4426, 26366, 17780, 136, 6002, 86531, 27983, 1957, 18151, 272, 51592, 11814, 48716, 2053, 50986, 10298, 41018, 40140, 18929, 35978 ]	[ 0.08135986328125, 0.160888671875, 0.1895751953125, 0.131103515625, 0.211181640625, 0.04022216796875, 0.12060546875, 0.261962890625, 0.05517578125, 0.013397216796875, 0.1761474609375, 0.03387451171875, 0.035614013671875, 0.0809326171875, 0.1231689453125, 0.1810302734375, 0.10070800781...	embed
71323911_c1	71323911	haskell	1	1\"], ... ]],\"bids\":[[\"0.06744491\",\"1.35\"],[\"0.06726258\",\"0.148585363\"], ...]],\"market_id\":\"ETH-BTC\"}}" The "asks" key looks clearly present to me -- it's the first one nested under the "order_book" key. Code signals: Data.Aeson, Data.ByteString.Lazy, Data.Either, Network.HTTP.Request, Aeson, order_book, ...	1\"], ... ]],\"bids\":[[\"0.06744491\",\"1.35\"],[\"0.06726258\",\"0.148585363\"], ...]],\"market_id\":\"ETH-BTC\"}}" The "asks" key looks clearly present to me -- it's the first one nested under the "order_book" key. Code signals: Data.Aeson, Data.ByteString.Lazy, Data.Either, Network.HTTP.Request, Aeson, order_book, ...	[ 0.0074462890625, 0.0037078857421875, -0.0033111572265625, -0.01263427734375, 0.015625, 0.031982421875, -0.011474609375, -0.01129150390625, 0.00787353515625, 0.005767822265625, 0.0245361328125, -0.01080322265625, 0.0031890869140625, 0.0018768310546875, -0.000598907470703125, -0.00372314...	[ 106, 41872, 86245, 34833, 7, 99929, 18197, 88471, 12183, 81046, 758, 198493, 10057, 102014, 114999, 127968, 55637, 532, 12, 187000, 9, 571, 20499, 47391, 162, 1224, 22799, 33342, 123019, 13379, 47, 163, 70, 5117, 8512, 71, 1379, 80596, 1413...	[ 0.06329345703125, 0.01263427734375, 0.035247802734375, 0.2017822265625, 0.1226806640625, 0.03955078125, 0.0919189453125, 0.1256103515625, 0.1107177734375, 0.0401611328125, 0.0855712890625, 0.078125, 0.059814453125, 0.027191162109375, 0.042236328125, 0.058319091796875, 0.099853515625,...	embed
8572196_c0	8572196	haskell	0	Title: Directory contents in Haskell Problem title: Directory contents in Haskell Tags: haskell, filepath Problem: Directory contents in Haskell Is there a way of returning a list of files in a directory with their absolute paths. When I do getDirectoryContents dir it gives me a list of filenames in the directory. If I...	Directory contents in Haskell Directory contents in Haskell haskell filepath Directory Haskell Directory contents in Haskell Is there a way of returning a list of files in a directory with their absolute paths. When I do it gives me a list of filenames in the directory. If I am using these filenames at another place, I...	[ 0.0159912109375, -0.0126953125, 0.00037384033203125, 0.01141357421875, -0.01019287109375, 0.01806640625, 0.0022735595703125, 0.007537841796875, -0.007720947265625, -0.02880859375, -0.0191650390625, 0.007049560546875, -0.0238037109375, 0.0211181640625, -0.00482177734375, 0.0068969726562...	[ 31068, 53, 10941, 7, 23, 20625, 142508, 1556, 11435, 128405, 2071, 2685, 10, 3917, 30646, 214, 5303, 102158, 14364, 678, 89931, 60875, 76199, 163, 11627, 17368, 3687, 3871, 3714, 35845, 43581, 20697 ]	[ 0.1260986328125, 0.07940673828125, 0.1678466796875, 0.01849365234375, 0.04217529296875, 0.129150390625, 0.2110595703125, 0.1229248046875, 0.1046142578125, 0.18896484375, 0.002410888671875, 0.0186004638671875, 0.0230865478515625, 0.081298828125, 0.1485595703125, 0.05615234375, 0.12451...	embed
9300773_c0	9300773	haskell	0	Title: Drawing lines with opengl in Haskell Problem title: Drawing lines with opengl in Haskell Tags: opengl, haskell Problem: Drawing lines with opengl in Haskell I'm trying to create a go board using opengl. To do this, I'm trying to draw a bunch of lines to create the grid. However, every tutorial site (including op...	Drawing lines with opengl in Haskell Drawing lines with opengl in Haskell opengl haskell Drawing Haskell Drawing lines with opengl in Haskell I'm trying to create a go board using opengl. To do this, I'm trying to draw a bunch of lines to create the grid. However, every tutorial site (including opengl's) has the exampl...	[ -0.01220703125, 0.002960205078125, 0.009033203125, -0.01312255859375, 0.004058837890625, 0.004119873046875, 0.015869140625, -0.0081787109375, -0.0184326171875, -0.0230712890625, -0.015869140625, -0.0390625, 0.0147705078125, -0.000774383544921875, -0.01458740234375, 0.0079345703125, 0...	[ 18186, 14775, 124519, 678, 9803, 11016, 23, 20625, 142508, 1556, 31577, 28282, 738, 45443, 17368, 79442, 147306, 120067, 11907, 57143, 1764, 27781, 313, 37223, 34356, 4127, 12447, 73342, 3525, 1884 ]	[ 0.141357421875, 0.07318115234375, 0.1962890625, 0.1019287109375, 0.1798095703125, 0.2244873046875, 0.0771484375, 0.14892578125, 0.2193603515625, 0.126953125, 0.052886962890625, 0.06658935546875, 0.1070556640625, 0.166015625, 0.045135498046875, 0.13623046875, 0.0706787109375, 0.2203...	embed
58271177_c0	58271177	haskell	0	Title: Adding a list of points together Problem title: Adding a list of points together Tags: haskell, list Problem: Adding a list of points together How do I add all of the x coordinates together in a list of points type Pt ? Example: [Pt 1 2, Pt 3 4] => 1 + 3 => 4 Here is the data-type and function declaration that I...	Adding a list of points together Adding a list of points together haskell list Adding Point Double Adding a list of points together How do I add all of the x coordinates together in a list of points type Pt ? Example: Here is the data-type and function declaration that I am using: This is what I have tried.	[ -0.000766754150390625, 0.007080078125, 0.0031890869140625, -0.0004787445068359375, -0.0081787109375, 0.0179443359375, -0.0003376007080078125, -0.005096435546875, 0.00408935546875, -0.01446533203125, 0.01226806640625, -0.0284423828125, 0.011962890625, 0.0004444122314453125, -0.01458740234...	[ 62, 59725, 5303, 111, 26847, 25842, 10, 1556, 142508, 41097, 107172, 11249, 54, 87, 15190, 756, 70, 1022, 176866, 90, 23, 10644, 436, 18, 89536, 11853, 2053, 50986, 136, 32354, 21635, 17368, 3293, 765, 37842 ]	[ 0.1270751953125, 0.1390380859375, 0.2069091796875, 0.0811767578125, 0.224853515625, 0.2447509765625, 0.03125, 0.1197509765625, 0.1983642578125, 0.2000732421875, 0.148681640625, 0.001800537109375, 0.036285400390625, 0.015289306640625, 0.1978759765625, 0.1220703125, 0.0225372314453125,...	embed
50758816_c0	50758816	haskell	0	Title: Duplicate elements of a list on even index Problem title: Duplicate elements of a list on even index Tags: functional-programming, haskell Problem: Duplicate elements of a list on even index In Haskell, how do I implement a function dup that duplicates all elements that are on even positions (0,2,4...) in a list...	Duplicate elements of a list on even index Duplicate elements of a list on even index functional-programming haskell Duplicate x:xs Duplicate elements of a list on even index In Haskell, how do I implement a function dup that duplicates all elements that are on even positions (0,2,4...) in a list Example of call:	[ -0.00860595703125, 0.03173828125, 0.0079345703125, -0.0223388671875, -0.006439208984375, 0.03271484375, -0.000036716461181640625, 0.003875732421875, 0.0186767578125, -0.0218505859375, -0.0002536773681640625, -0.0159912109375, 0.0087890625, 0.021484375, 0, 0.021728515625, 0.0124511718...	[ 786, 52721, 67, 80854, 5303, 98, 3853, 63262, 123309, 28966, 1556, 142508, 1022, 12, 425, 7, 360, 20625, 3642, 54, 87, 29479, 32354, 115, 254, 450, 171763, 1636, 756, 621, 19069, 22085, 304, 617, 12399, 23, 89536, 11782 ]	[ 0.17822265625, 0.265625, 0.169677734375, 0.2188720703125, 0.2005615234375, 0.1280517578125, 0.2242431640625, 0.2098388671875, 0.163818359375, 0.0926513671875, 0.157470703125, 0.260986328125, 0.060455322265625, 0.07623291015625, 0.1014404296875, 0.00970458984375, 0.0188751220703125, ...	embed
6630951_c0	6630951	haskell	0	Title: remove Repeat values from a list in haskell Problem title: remove Repeat values from a list in haskell Tags: haskell Problem: remove Repeat values from a list in haskell I need to accomplish a few tasks in Haskell: Find the maximum of a list, along with the number of times it occurs: maxCount [2,4,7,2,3] --> [7,...	remove Repeat values from a list in haskell remove Repeat values from a list in haskell haskell a Repeat remove Repeat values from a list in haskell I need to accomplish a few tasks in Haskell: Find the maximum of a list, along with the number of times it occurs: Remove repeated values from a list Delete all instances ...	[ 0.005828857421875, 0.01611328125, -0.005859375, 0.003753662109375, 0.00135040283203125, -0.00421142578125, 0.0096435546875, -0.00958251953125, 0.0205078125, -0.019287109375, -0.025390625, -0.007232666015625, 0.0257568359375, 0.023681640625, -0.00677490234375, 0.0067138671875, 0.00561...	[ 87388, 33742, 13, 257, 142424, 1295, 5303, 1556, 142508, 23, 3871, 163846, 10846, 66211, 20625, 26040, 38132, 14012, 20028, 74918, 181139, 119140, 297, 262, 46485, 756, 110527, 12830 ]	[ 0.1812744140625, 0.20263671875, 0.2188720703125, 0.1590576171875, 0.230712890625, 0.124267578125, 0.2015380859375, 0.155029296875, 0.21484375, 0.072998046875, 0.06988525390625, 0.087158203125, 0.0293426513671875, 0.1217041015625, 0.15087890625, 0.07318115234375, 0.1929931640625, 0....	embed
5769990_c0	5769990	haskell	0	Title: possible to make some output in do notation and then return a String in haskell? Problem title: possible to make some output in do notation and then return a String in haskell? Tags: monads, io, haskell Problem: possible to make some output in do notation and then return a String in haskell? is it possible in ha...	possible to make some output in do notation and then return a String in haskell? possible to make some output in do notation and then return a String in haskell? monads io haskell possible to make some output in do notation and then return a String in haskell? is it possible in haskell, to make some operations live out...	[ -0.01043701171875, -0.0026397705078125, -0.0103759765625, 0.00225830078125, 0.01495361328125, 0.01019287109375, 0.0054931640625, -0.007171630859375, 0.01031494140625, 0.00494384765625, 0.01434326171875, -0.0242919921875, 0.003082275390625, -0.01092529296875, 0.006683349609375, 0.012084...	[ 7722, 3249, 140992, 23, 54, 110, 22062, 30646, 23351, 214, 1556, 142508, 3060, 7068, 2667, 712, 22995, 47, 83, 442, 41018, 6867, 79315, 32354, 1884 ]	[ 0.1552734375, 0.0697021484375, 0.2183837890625, 0.04937744140625, 0.18212890625, 0.13134765625, 0.1239013671875, 0.1844482421875, 0.1434326171875, 0.073486328125, 0.1239013671875, 0.2230224609375, 0.046173095703125, 0.0178680419921875, 0.038787841796875, 0.04412841796875, 0.073974609...	embed
7423123_c0	7423123	haskell	0	Title: How to call the same function 'n' times? Problem title: How to call the same function 'n' times? Tags: haskell Problem: How to call the same function 'n' times? Possible Duplicate: Library function to compose a function with itself n times I need a function to call another function n number o...	How to call the same function 'n' times? How to call the same function 'n' times? haskell How How to call the same function 'n' times? I need a function to call another function n number of times. so it would look something like this f n = g(g(g(g(l)))) where n equals to the number of function g nes...	[ -0.0155029296875, 0.0096435546875, -0.003509521484375, -0.0019989013671875, 0.00189208984375, 0.01422119140625, -0.0014190673828125, -0.008056640625, 0.007537841796875, -0.06884765625, -0.00262451171875, -0.0308837890625, -0.000843048095703125, 0.01806640625, -0.00634765625, -0.0061645...	[ 11249, 47, 11782, 70, 5701, 32354, 3768, 19, 20028, 54764, 1556, 142508, 25, 87, 3871, 15700, 653, 14012, 111, 2806, 6713, 9844, 1884, 903, 1238, 2203, 706, 177, 141, 105950, 8512, 71, 3642, 1672, 45458 ]	[ 0.08941650390625, 0.09735107421875, 0.205078125, 0.00738525390625, 0.158447265625, 0.2176513671875, 0.11181640625, 0.1866455078125, 0.22265625, 0.006561279296875, 0.1351318359375, 0.2008056640625, 0.04425048828125, 0.0089111328125, 0.089599609375, 0.1044921875, 0.120849609375, 0.13...	embed
46442336_c0	46442336	haskell	0	Title: What does k -> * mean? Problem title: What does k -> * mean? Tags: haskell Problem: What does k -> * mean? In the prelude, the type information about ReaderT says: newtype ReaderT r (m :: k -> ) (a :: k) = ReaderT {runReaderT :: r -> m a} What does (m :: k -> ) it mean? m takes an argument of type k , bu...	What does k -> * mean? What does k -> * mean? haskell What ReaderT Prelude What does k -> * mean? In the prelude, the type information about ReaderT says: What does (m :: k -> *) it mean? m takes an argument of type k , but m is a higher kinded type. Information about higher kinded looks also wired:	[ 0.022216796875, -0.008056640625, 0.00274658203125, -0.0125732421875, 0.00848388671875, -0.01019287109375, 0.004974365234375, -0.006256103515625, -0.016845703125, -0.02294921875, 0.0133056640625, -0.033203125, -0.00897216796875, -0.01519775390625, -0.0225830078125, -0.0240478515625, 0...	[ 4865, 14602, 472, 20, 1230, 5386, 74, 661, 29459, 1556, 142508, 122636, 618, 1914, 822, 112, 33079, 479, 10644, 4677, 17378, 39, 1984, 442, 347, 51776, 10750, 1284, 77546, 8562, 297, 32007, 33342, 1439 ]	[ 0.044708251953125, 0.07147216796875, 0.1688232421875, 0.09417724609375, 0.135009765625, 0.1881103515625, 0.08697509765625, 0.1690673828125, 0.13671875, 0.098388671875, 0.1944580078125, 0.2252197265625, 0.177734375, 0.055633544921875, 0.1304931640625, 0.09912109375, 0.1961669921875, ...	embed

42723689_c0

42723689

haskell

0

Title: How can I find the smallest of 3 integers in Haskell? Problem title: How can I find the smallest of 3 integers in Haskell? Tags: haskell Problem: How can I find the smallest of 3 integers in Haskell? As a beginner in Haskell I am trying to write a code to find the smallest number out of 3 integers. This is what ...

How can I find the smallest of 3 integers in Haskell? How can I find the smallest of 3 integers in Haskell? haskell How Haskell How can I find the smallest of 3 integers in Haskell? As a beginner in Haskell I am trying to write a code to find the smallest number out of 3 integers. This is what I have so far. Can anyone...

[ -0.00885009765625, -0.00171661376953125, 0.033203125, 0.007354736328125, -0.006500244140625, 0.01904296875, 0.01226806640625, -0.02197265625, 0.0089111328125, -0.0225830078125, -0.01336669921875, -0.0263671875, 0.00830078125, 0.0126953125, -0.00115966796875, 0.0020751953125, -0.00227...

[ 11249, 831, 7413, 70, 19336, 525, 111, 138, 892, 26255, 23, 20625, 142508, 87, 1556, 9842, 1679, 31577, 33022, 18151, 14012, 1810, 765, 2060, 25944, 48225 ]

[ 0.06597900390625, 0.052642822265625, 0.09344482421875, 0.052642822265625, 0.160888671875, 0.171875, 0.046630859375, 0.177978515625, 0.1302490234375, 0.1409912109375, 0.0667724609375, 0.12939453125, 0.2115478515625, 0.0169219970703125, 0.09674072265625, 0.025909423828125, 0.0359497070...

embed

40099927_c0

40099927

haskell

0

Title: How do I define an anonymous recursive function? Problem title: How do I define an anonymous recursive function? Tags: haskell Problem: How do I define an anonymous recursive function? One can define an anonymous function with a lambda expression: -- Contrived example > apply f x = f x > apply (\n -> n + 1) 3 4 ...

How do I define an anonymous recursive function? How do I define an anonymous recursive function? haskell How Contrived How do I define an anonymous recursive function? One can define an anonymous function with a lambda expression: but is it possible to define an anonymous recursive function?

[ -0.00016689300537109375, 0.00799560546875, 0.0118408203125, 0.006866455078125, 0.0223388671875, 0.004364013671875, 0.01043701171875, 0.00830078125, 0.00156402587890625, -0.033447265625, 0.000820159912109375, -0.00958251953125, -0.013671875, 0.022216796875, 0.026611328125, -0.0031585693...

[ 87, 61924, 52184, 10821, 195625, 5844, 32354, 11249, 54, 142, 1556, 142508, 111809, 4126, 21, 6492, 85, 125195, 7722 ]

[ 0.038787841796875, 0.1844482421875, 0.22216796875, 0.1767578125, 0.1982421875, 0.1597900390625, 0.20703125, 0.036407470703125, 0.0217742919921875, 0.023162841796875, 0.0823974609375, 0.2039794921875, 0.061248779296875, 0.064208984375, 0.0036220550537109375, 0.1256103515625, 0.0903320...

embed

19554984_c0

19554984

haskell

0

Title: Haskell 'count occurrences' function Problem title: Haskell 'count occurrences' function Tags: haskell Problem: Haskell 'count occurrences' function I implemented a count function in Haskell and I am wondering will this behave badly on large lists : count :: Eq a => a -> [a] -> Int count x = ...

Haskell 'count occurrences' function Haskell 'count occurrences' function haskell Haskell Haskell 'count occurrences' function I implemented a count function in Haskell and I am wondering will this behave badly on large lists : I believe the length function runs in linear time, is this correct? Edit...

[ 0.007720947265625, 0.0322265625, 0.004913330078125, -0.0103759765625, 0.01806640625, -0.00125885009765625, -0.0177001953125, 0.002410888671875, 0.01251220703125, -0.0361328125, -0.01007080078125, -0.00543212890625, 0.021484375, 0.0211181640625, -0.00180816650390625, -0.00860595703125, ...

[ 20625, 142508, 3768, 71013, 74918, 42, 69098, 32354, 1556, 29479, 54529, 149016, 1221, 903, 186, 68991, 6494, 21334, 5303, 87, 18822, 140909, 127877, 23, 192617, 1733, 83, 26785, 853, 144810, 42459, 1727 ]

[ 0.15673828125, 0.2457275390625, 0.0830078125, 0.200927734375, 0.19384765625, 0.1573486328125, 0.130615234375, 0.1937255859375, 0.1390380859375, 0.133544921875, 0.23291015625, 0.04449462890625, 0.03814697265625, 0.0362548828125, 0.0206298828125, 0.1385498046875, 0.1209716796875, 0.0...

embed

41501748_c1

41501748

haskell

1

-- Continuation | isDigit (T.head elem) = "\n" <> textElem <> accu -- Start | otherwise = accu -- Garbage where textElem = T.strip elem Code signals: Data.Char, Data.Monoid, qualified, System.Environment, System.IO, Haskell, Data.Text, Data.Text.Lazy, Performance, LANGUAGE, OverloadedStrings, Main, Data.Text.Lazy.IO, ...

[ -0.006256103515625, 0.000362396240234375, -0.0032806396484375, 0.005035400390625, -0.011474609375, 0.01904296875, 0.0179443359375, -0.0029754638671875, 0.0034942626953125, -0.01318359375, -0.01068115234375, 0.002044677734375, -0.016845703125, 0.008056640625, -0.000652313232421875, -0.0...

[ 4210, 50343, 1363, 58745, 83, 14055, 15769, 618, 5, 31251, 88, 195, 16, 2203, 41872, 19, 7986, 7623, 61689, 13794, 6, 120262, 6389, 402, 429, 7440, 384, 59623, 28864, 26073, 7, 12, 11809, 84068, 46674, 48899, 217225, 12353, 686, 1900, 1...

[ 0.063232421875, 0.244873046875, 0.1488037109375, 0.0341796875, 0.1563720703125, 0.147216796875, 0.2431640625, 0.1300048828125, 0.040283203125, 0.2060546875, 0.066650390625, 0.16552734375, 0.00189208984375, 0.06427001953125, 0.08056640625, 0.045166015625, 0.1939697265625, 0.10925292...

embed

9092140_c0

9092140

haskell

0

Title: Hamlet automatic access to variables in scope Problem title: Hamlet automatic access to variables in scope Tags: hamlet, yesod, template-engine, haskell Problem: Hamlet automatic access to variables in scope From the Yesod Book . Hamlet automatically has access to the variables in scope when it's called. There i...

Hamlet automatic access to variables in scope Hamlet automatic access to variables in scope hamlet yesod template-engine haskell Hamlet Hamlet automatic access to variables in scope From the Yesod Book . What is this deep magic? How can it automagically know what variables are in scope?

[ 0.0218505859375, 0.00506591796875, -0.0106201171875, 0.01336669921875, -0.004150390625, 0.017578125, -0.002197265625, 0.01708984375, -0.00640869140625, -0.042724609375, 0.000759124755859375, -0.005157470703125, 0.00482177734375, 0.0184326171875, 0.0225830078125, -0.0111083984375, -0....

[ 10699, 1974, 101038, 17203, 47, 77336, 7, 23, 70820, 2057, 2422, 23722, 110934, 128897, 1556, 142508, 28090, 32635, 2199, 27432, 4865, 83, 903, 53894, 49846, 11249, 831, 442, 1809, 15429, 71407, 3714, 2367, 621 ]

[ 0.1824951171875, 0.235107421875, 0.2283935546875, 0.1656494140625, 0.1142578125, 0.250244140625, 0.0733642578125, 0.08868408203125, 0.2451171875, 0.11663818359375, 0.109375, 0.2005615234375, 0.217041015625, 0.1951904296875, 0.132080078125, 0.2291259765625, 0.009521484375, 0.1308593...

embed

57940965_c1

57940965

haskell

1

Packages (1) pkg-config-0.29.2-1 Total Installed Size: 0.54 MiB Net Upgrade Size: 0.00 MiB Code signals: either, Users, Warning, Please, v1-install, wiki.haskell.org, Cabal, NewBuild, Resolving, Configuring, haskell-gi-base-0.23.0, Failed, Error, haskell-gi-0.23.0-1JHtHU5x2lkFiOcPtWhSw4, haskell-gi-0.23.0, haskell-gi-...

[ -0.00084686279296875, 0.00592041015625, 0.012939453125, -0.00506591796875, 0.0020904541015625, 0.00531005859375, 0.003662109375, -0.012451171875, 0.00823974609375, 0.04931640625, 0.005218505859375, -0.0322265625, -0.0147705078125, -0.013671875, -0.0191650390625, 0.0224609375, 0.00164...

[ 56607, 52467, 798, 915, 8517, 9, 153837, 23320, 5, 4235, 146971, 33867, 107951, 297, 80378, 12, 81730, 617, 1208, 571, 10086, 10091, 44286, 37509, 28864, 26073, 40101, 53400, 5550, 592, 30607, 81, 20268, 80383, 34356, 10557, 142508, 1478, 3...

[ 0.255859375, 0.1732177734375, 0.114990234375, 0.1197509765625, 0.2587890625, 0.06036376953125, 0.278076171875, 0.103271484375, 0.042572021484375, 0.257080078125, 0.2120361328125, 0.143310546875, 0.2470703125, 0.099609375, 0.1884765625, 0.036376953125, 0.10272216796875, 0.0651855468...

embed

59415953_c0

59415953

haskell

0

Title: How to get source range of AST nodes using megaparsec? Problem title: How to get source range of AST nodes using megaparsec? Tags: megaparsec, haskell Problem: How to get source range of AST nodes using megaparsec? I'm trying to generate a source map for some source file I'm parsing and I want to get the range f...

How to get source range of AST nodes using megaparsec? How to get source range of AST nodes using megaparsec? megaparsec haskell megaparsec How AST How to get source range of AST nodes using megaparsec? I'm trying to generate a source map for some source file I'm parsing and I want to get the range for each node. getSo...

[ -0.0224609375, 0.00982666015625, 0.0213623046875, 0.016357421875, -0.0203857421875, 0.0205078125, -0.01361083984375, -0.00372314453125, -0.0010986328125, -0.012451171875, 0.000690460205078125, 0.0213623046875, 0.0189208984375, 0.0101318359375, 0.0091552734375, -0.005126953125, -0.018...

[ 11249, 47, 2046, 31344, 37457, 111, 48963, 110, 988, 17368, 31534, 2500, 39797, 1556, 142508, 139392, 22288, 11435, 87, 366, 6953, 100, 12638, 112, 211235, 7192, 7, 4734, 76199, 4034, 19069, 19437, 2256, 8447, 316, 6863, 3564 ]

[ 0.05242919921875, 0.023956298828125, 0.09906005859375, 0.2373046875, 0.2347412109375, 0.050994873046875, 0.2052001953125, 0.155517578125, 0.155029296875, 0.048126220703125, 0.15771484375, 0.1385498046875, 0.2080078125, 0.103271484375, 0.19189453125, 0.046661376953125, 0.0783081054687...

embed

13297896_c0

13297896

haskell

0

Title: Is there some directory walker in Haskell? Problem title: Is there some directory walker in Haskell? Tags: directory-traversal, io, haskell Problem: Is there some directory walker in Haskell? Is there some recursive directory walker in Haskell so I could write something like listing <- walkDir "/tmp" I would not...

Is there some directory walker in Haskell? Is there some directory walker in Haskell? directory-traversal io haskell Haskell Is there some directory walker in Haskell? Is there some recursive directory walker in Haskell so I could write something like I would not like to write my own. I can install some dependency from...

[ 0.0103759765625, 0.0064697265625, 0.007781982421875, -0.0038299560546875, 0.00113677978515625, 0.0079345703125, -0.008544921875, -0.027099609375, -0.007232666015625, -0.043701171875, 0.00168609619140625, 0.004852294921875, -0.0052490234375, 0.0042724609375, 0.005126953125, 0.0006599426...

[ 2071, 2685, 3060, 14364, 53, 35691, 56, 23, 20625, 142508, 1517, 814, 2317, 22995, 1556, 195625, 5844, 33022, 1884, 2806, 959, 759, 10002, 831, 20600, 42548, 27771, 109524, 1284, 3444, 41421, 13651, 19713, 29908, 3773 ]

[ 0.03948974609375, 0.049072265625, 0.0889892578125, 0.1787109375, 0.1796875, 0.193359375, 0.2242431640625, 0.0904541015625, 0.154052734375, 0.27099609375, 0.057769775390625, 0.1524658203125, 0.1336669921875, 0.1865234375, 0.146484375, 0.156005859375, 0.106689453125, 0.1011962890625,...

embed

36440246_c0

36440246

haskell

0

Title: Why does Haskell's find always return only one element? Problem title: Why does Haskell's find always return only one element? Tags: haskell Problem: Why does Haskell's find always return only one element? Prelude> find odd [2,4,7,9,11] Just 7 I would expect this to return [7,9,11], as they're all odd ...

Why does Haskell's find always return only one element? Why does Haskell's find always return only one element? haskell Why Haskell Prelude Just Why does Haskell's find always return only one element? I would expect this to return [7,9,11], as they're all odd numbers. Why does find return Just 7 ? Is there an...

[ -0.00168609619140625, 0.0093994140625, 0.00982666015625, -0.00616455078125, -0.001373291015625, 0.03515625, -0.00494384765625, -0.001983642578125, 0.00054931640625, -0.02197265625, 0.01104736328125, -0.02490234375, -0.007659912109375, -0.01611328125, 0.00921630859375, 0.001953125, 0....

[ 44084, 14602, 20625, 142508, 3768, 7413, 11343, 30646, 4734, 1632, 12830, 1556, 1914, 822, 112, 9563, 2806, 41206, 166590, 1662, 756, 70270, 101935, 361, 14192, 32354 ]

[ 0.10662841796875, 0.05804443359375, 0.1436767578125, 0.2529296875, 0.059356689453125, 0.20849609375, 0.1348876953125, 0.1951904296875, 0.1431884765625, 0.17138671875, 0.205078125, 0.1207275390625, 0.0972900390625, 0.1795654296875, 0.1064453125, 0.09857177734375, 0.036590576171875, ...

embed

37681485_c0

37681485

haskell

0

Title: haskell print 10 times input string, do-notation Problem title: haskell print 10 times input string, do-notation Tags: haskell, string, monads Problem: haskell print 10 times input string, do-notation Take input as a string and print it 10 times using do-notation? print10Times :: String -> IO () print10Times nam...

haskell print 10 times input string, do-notation haskell print 10 times input string, do-notation haskell string monads print10Times What haskell print 10 times input string, do-notation Take input as a string and print it 10 times using do-notation?

[ -0.0106201171875, 0.006622314453125, -0.012939453125, 0.0224609375, -0.010986328125, 0.003448486328125, 0.008544921875, -0.01324462890625, -0.026123046875, -0.021728515625, 0.01025390625, -0.029052734375, -0.0185546875, 0.006988525390625, -0.0167236328125, 0.00555419921875, 0.0131225...

[ 1556, 142508, 28412, 209, 20028, 107730, 79315, 54, 9, 157, 22062, 2667, 712, 7, 963, 70059, 4865, 46673, 237, 17368 ]

[ 0.148681640625, 0.2235107421875, 0.20556640625, 0.19970703125, 0.19384765625, 0.166259765625, 0.1719970703125, 0.161376953125, 0.06402587890625, 0.1510009765625, 0.1156005859375, 0.10089111328125, 0.14990234375, 0.08026123046875, 0.150634765625, 0.191162109375, 0.044342041015625, 0...

embed

1900165_c0

1900165

haskell

0

Title: How long does it take to create 1 million threads in Haskell? Problem title: How long does it take to create 1 million threads in Haskell? Tags: multithreading, concurrency, green-threads, haskell Problem: How long does it take to create 1 million threads in Haskell? What I understand, Haskell have green threads...

How long does it take to create 1 million threads in Haskell? How long does it take to create 1 million threads in Haskell? multithreading concurrency green-threads haskell How Haskell How long does it take to create 1 million threads in Haskell? What I understand, Haskell have green threads. But how light weight are t...

[ 0.00848388671875, -0.001953125, -0.00201416015625, 0.0028228759765625, 0.01434326171875, -0.007171630859375, 0.005035400390625, -0.0167236328125, -0.001708984375, -0.056396484375, 0.00848388671875, -0.016357421875, 0.00958251953125, -0.01177978515625, 0.0010833740234375, 0.004547119140...

[ 11249, 4989, 5646, 28282, 106, 19879, 86997, 7, 23, 20625, 142508, 442, 47, 3869, 65847, 11, 108636, 982, 50997, 39116, 1556, 14602, 28219, 765, 3642, 22729, 57888, 7722, 2806, 100, 805, 2445 ]

[ 0.032318115234375, 0.1292724609375, 0.115478515625, 0.1304931640625, 0.1011962890625, 0.2177734375, 0.252197265625, 0.12646484375, 0.060516357421875, 0.164306640625, 0.272705078125, 0.0270538330078125, 0.03863525390625, 0.06231689453125, 0.111083984375, 0.0192718505859375, 0.06494140...

embed

20457354_c1

20457354

haskell

1

16.0 ghc-7.6 ghc-7.6.3 Binaries Libraries Private Data Documentation c2hs Cannot install HTF on osx with cabal I've seen this question regarding installing HTF and errors with cpphs , but it doesn't seem to apply. I did a 100% fresh haskell platform install on two seperate osx machines, and tried to do cabal install ht...

[ 0.0106201171875, 0.0157470703125, -0.0096435546875, -0.0125732421875, -0.0019989013671875, -0.02099609375, -0.00579833984375, -0.009765625, -0.00104522705078125, -0.00897216796875, -0.011474609375, -0.0380859375, -0.00836181640625, -0.00170135498046875, 0.0135498046875, 0.0030212402343...

[ 6849, 2389, 31380, 238, 180347, 200768, 54092, 165867, 86111, 11809, 43101, 501, 304, 127, 4171, 10869, 20600, 572, 30992, 98, 362, 425, 678, 109524, 18499, 6366, 7, 59911, 3555, 63335, 1556, 142508, 13651, 6626, 143870, 116491, 37842, 9703, ...

[ 0.1595458984375, 0.04425048828125, 0.0811767578125, 0.06640625, 0.1588134765625, 0.1104736328125, 0.1156005859375, 0.1048583984375, 0.109619140625, 0.03887939453125, 0.0797119140625, 0.012359619140625, 0.1116943359375, 0.158935546875, 0.05255126953125, 0.1187744140625, 0.22509765625,...

embed

46270429_c0

46270429

haskell

0

Title: Combining three lists into a list of 3-tuples in Haskell Problem title: Combining three lists into a list of 3-tuples in Haskell Tags: tuples, list, haskell Problem: Combining three lists into a list of 3-tuples in Haskell Code signals: zs, Combining, Haskell, zip3Lists, x:xs, y:ys, z:zs, haskell1.hs:32:33, Occu...

Combining three lists into a list of 3-tuples in Haskell Combining three lists into a list of 3-tuples in Haskell tuples list haskell zs Combining Haskell zip3Lists x:xs y:ys z:zs haskell1.hs:32:33 Occurs Expected Actual Relevant haskell1.hs:32:27 haskell1.hs:32:25 haskell1.hs:32:20 haskell1.hs:32:18 haskell1.hs:32:13 ...

[ -0.00124359130859375, 0.009521484375, -0.0037689208984375, 0.0155029296875, -0.006591796875, 0.00153350830078125, -0.017822265625, -0.009521484375, 0.00579833984375, -0.01251220703125, -0.00946044921875, -0.002655029296875, 0.0234375, 0.0186767578125, -0.017578125, 0.01007080078125, ...

[ 106935, 17262, 5303, 7, 3934, 5691, 458, 99726, 20625, 142508, 370, 1556, 97, 68330, 363, 154663, 4778, 169, 29902, 31191, 48650, 60075, 100582, 133, 27592, 31577, 33022, 32354, 51776, 10750, 28282, 1632, 162738, 1295, 148390, 27781, 116, 138...

[ 0.22021484375, 0.2080078125, 0.2374267578125, 0.03033447265625, 0.0823974609375, 0.166015625, 0.144775390625, 0.2022705078125, 0.130126953125, 0.2139892578125, 0.123046875, 0.1055908203125, 0.03802490234375, 0.165283203125, 0.162109375, 0.219482421875, 0.04302978515625, 0.018890380...

embed

40324583_c0

40324583

haskell

0

Title: Matching types and monads. Error Problem title: Matching types and monads. Error Tags: haskell Problem: Matching types and monads. Error type C = StateT Int (ErrorT String IO) main :: C () main = do args <- liftIO $ getArgs case args of [] -> liftIO $ putStrLn "E" (p:ps) -> s "d" Code signals: Control.Monad.Tran...

Matching types and monads. Error Matching types and monads. Error haskell Control.Monad.Trans.Error Matching Error StateT ErrorT p:ps Couldn Control.Monad.Trans.State.Lazy.StateT Control.Monad.Trans.Error.ErrorT Expected Actual When Matching types and monads. Error I've got the error: I cannot understand why there is a...

[ -0.00714111328125, 0.0072021484375, -0.017578125, 0.00262451171875, 0.00933837890625, -0.00084686279296875, -0.025146484375, -0.014404296875, -0.00872802734375, -0.004974365234375, 0.02392578125, -0.0257568359375, -0.0128173828125, -0.006011962890625, 0.00714111328125, -0.0078735351562...

[ 67407, 214, 52895, 136, 2667, 712, 212059, 7, 1556, 142508, 27131, 46674, 62624, 18468, 31611, 22836, 618, 915, 6423, 191147, 19, 135206, 2729, 3285, 60075, 13, 100582, 14847, 4163, 18499, 53418, 28219, 15400, 2685, 83, 142, 3642, 121461, 4...

[ 0.2249755859375, 0.1297607421875, 0.23779296875, 0.1085205078125, 0.1573486328125, 0.18701171875, 0.1612548828125, 0.0251617431640625, 0.126708984375, 0.2220458984375, 0.1673583984375, 0.1201171875, 0.13427734375, 0.147705078125, 0.06011962890625, 0.1357421875, 0.0565185546875, 0.0...

embed

50431923_c0

50431923

haskell

0

Title: convert monad to IO Problem title: convert monad to IO Tags: haskell, monads Problem: convert monad to IO I'd like to use finally , signature IO a -> IO b -> IO a . However, the operations I wanna use are based on a different monad than IO (namely Servant 's ClientM ). I knew liftIO , but that seems to do the op...

convert monad to IO convert monad to IO haskell monads Servant ClientM convert monad to IO I'd like to use finally , signature IO a -> IO b -> IO a . However, the operations I wanna use are based on a different monad than IO (namely Servant 's ClientM ). I knew liftIO , but that seems to do the opposite -- IO a -> m a ...

[ -0.01513671875, 0.004241943359375, 0.01226806640625, -0.0025787353515625, -0.000873565673828125, 0.0040283203125, 0.00091552734375, -0.01416015625, -0.00213623046875, -0.0164794921875, 0.00970458984375, -0.0198974609375, 0.0216064453125, -0.000919342041015625, 0.01470947265625, -0.0220...

[ 96760, 2667, 712, 47, 17780, 1556, 142508, 5406, 30624, 91732, 594, 87, 71, 1884, 4527, 77681, 138256, 10, 33079, 876, 33306, 41018, 6165, 76, 35509, 98, 12921, 3501, 55950, 60520, 4, 1284, 37202, 70, 198274, 347, 11249, 831, 27198, 7, ...

[ 0.1759033203125, 0.172119140625, 0.2464599609375, 0.14111328125, 0.29248046875, 0.115478515625, 0.2333984375, 0.12939453125, 0.19189453125, 0.202880859375, 0.1478271484375, 0.13232421875, 0.0227813720703125, 0.10015869140625, 0.1116943359375, 0.1219482421875, 0.2315673828125, 0.098...

embed

27641589_c0

27641589

haskell

0

Title: How can I check (through Haskell) is the DLL file managed? Problem title: How can I check (through Haskell) is the DLL file managed? Tags: dll, haskell, .net Problem: How can I check (through Haskell) is the DLL file managed? Directory contains DLL files. Some of them are native , but some of them are managed (i...

How can I check (through Haskell) is the DLL file managed? How can I check (through Haskell) is the DLL file managed? dll haskell .net How Haskell DLL How can I check (through Haskell) is the DLL file managed? Directory contains DLL files. Some of them are native , but some of them are managed (i.e. .NET assemblies). I...

[ -0.007354736328125, 0.01611328125, 0.00811767578125, 0.0186767578125, -0.01611328125, 0.0252685546875, -0.0198974609375, 0.0032196044921875, -0.00994873046875, 0.00238037109375, -0.00787353515625, -0.01104736328125, 0.00970458984375, -0.0038604736328125, -0.0027618408203125, 0.02148437...

[ 11249, 831, 12765, 20625, 142508, 83, 391, 23708, 11435, 145755, 87, 222521, 81717, 1556, 1179, 70, 31068, 53, 70541, 102158, 24, 4935, 17777, 89845, 3871, 2046, 756, 8305 ]

[ 0.046661376953125, 0.0634765625, 0.2103271484375, 0.12548828125, 0.24560546875, 0.0985107421875, 0.09130859375, 0.2462158203125, 0.2003173828125, 0.2218017578125, 0.0345458984375, 0.035797119140625, 0.203369140625, 0.1153564453125, 0.1304931640625, 0.01629638671875, 0.1268310546875, ...

embed

22260435_c0

22260435

haskell

0

Title: Reading String in Haskell Problem title: Reading String in Haskell Tags: haskell Problem: Reading String in Haskell I'm trying to write a function that reads from a String in Haskell, if the String has a number, it should return True. This is what I currently have hasNumber :: String -> Bool hasNumber n = any nu...

Reading String in Haskell Reading String in Haskell haskell Reading Haskell Bool Reading String in Haskell I'm trying to write a function that reads from a String in Haskell, if the String has a number, it should return True. This is what I currently have I have tried lots of functions in the second line but it doesn't...

[ -0.0196533203125, -0.009765625, 0.015625, 0.025146484375, 0.0076904296875, 0.0155029296875, 0.0126953125, -0.0250244140625, 0.000438690185546875, -0.0286865234375, 0.00089263916015625, -0.046630859375, -0.01904296875, 0.01055908203125, -0.0029449462890625, 0.003936767578125, -0.00570...

[ 104951, 23351, 214, 23, 20625, 142508, 1556, 2460, 929, 31577, 33022, 32354, 12301, 1295, 2174, 14012, 5608, 30646, 87599, 82424, 37842, 71358, 17932, 13315, 22027, 18, 48903, 4488, 4358 ]

[ 0.2271728515625, 0.207275390625, 0.14599609375, 0.08612060546875, 0.14208984375, 0.246826171875, 0.1300048828125, 0.12646484375, 0.19970703125, 0.07476806640625, 0.09466552734375, 0.1661376953125, 0.193603515625, 0.1175537109375, 0.04998779296875, 0.1685791015625, 0.03948974609375, ...

embed

33671748_c0

33671748

haskell

0

Title: Reducing this Haskell function Problem title: Reducing this Haskell function Tags: functional-programming, list-comprehension, haskell Problem: Reducing this Haskell function I want to double every second element of a list. Here is the code- doubleSec n [] = [] doubleSec n (x:xs) | n==1 = x*2 : doubleSec 0 xs | ...

Reducing this Haskell function Reducing this Haskell function functional-programming list-comprehension haskell Reducing Haskell x:xs Reducing this Haskell function I want to double every second element of a list. Here is the code- How can I compact this logic in a single function?

[ -0.0147705078125, 0.00457763671875, 0.01153564453125, -0.0012664794921875, 0.031494140625, 0.0194091796875, -0.0194091796875, 0.0108642578125, 0.0203857421875, -0.0111083984375, 0.0125732421875, -0.0201416015625, 0.0223388671875, -0.007232666015625, -0.00921630859375, 0.0245361328125, ...

[ 6096, 34, 21896, 903, 20625, 142508, 32354, 123309, 28966, 5303, 4692, 3220, 1556, 1022, 12, 425, 87, 3444, 47, 41929, 11907, 17932, 12830, 18151, 11249, 831, 94928, 62775, 23, 11001 ]

[ 0.1759033203125, 0.149169921875, 0.11907958984375, 0.1290283203125, 0.11700439453125, 0.222900390625, 0.188232421875, 0.1295166015625, 0.061767578125, 0.16259765625, 0.069091796875, 0.08599853515625, 0.097412109375, 0.04583740234375, 0.03564453125, 0.087158203125, 0.00065517425537109...

embed

20279306_c0

20279306

haskell

0

Title: What does (f .) . g mean in Haskell? Problem title: What does (f .) . g mean in Haskell? Tags: haskell, functional-programming, function-composition, pointfree, tacit-programming Problem: What does (f .) . g mean in Haskell? I have seen a lot of functions being defined according to the pattern (f .) . g . For ex...

What does (f .) . g mean in Haskell? What does (f .) . g mean in Haskell? haskell functional-programming function-composition pointfree tacit-programming What Haskell What does (f .) . g mean in Haskell? I have seen a lot of functions being defined according to the pattern (f .) . g . For example: What does this mean?

[ 0.0057373046875, 0.0159912109375, -0.016845703125, 0.005889892578125, -0.01361083984375, 0.008056640625, -0.00469970703125, 0.00604248046875, 0.005523681640625, -0.01806640625, -0.00836181640625, 0.0023956298828125, -0.003509521484375, -0.005859375, -0.02294921875, -0.0074462890625, ...

[ 4865, 14602, 420, 5, 706, 29459, 23, 20625, 142508, 1556, 123309, 28966, 214, 32354, 277, 40322, 6275, 32087, 308, 12645, 16, 51592, 5915, 61924, 59499, 103510, 903 ]

[ 0.05859375, 0.073486328125, 0.164794921875, 0.1671142578125, 0.254638671875, 0.1455078125, 0.0911865234375, 0.167236328125, 0.26123046875, 0.151123046875, 0.14013671875, 0.1217041015625, 0.00946044921875, 0.18701171875, 0.045074462890625, 0.0374755859375, 0.06719970703125, 0.135375...

embed

72706898_c0

72706898

haskell

0

Title: Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? Problem title: Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? Tags: ghc, haskell Problem: Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? ak(a,b) = do if a == 0 then ...

Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? ghc haskell Haskell Parse Possibly Please a-1 Haskell: Parse error in pattern: a - 1 Possibly caused by a missing 'do'? While trying to implement the fa...

[ -0.006561279296875, 0.023681640625, -0.020263671875, -0.00077056884765625, -0.0107421875, 0.031982421875, -0.0155029296875, 0.00299072265625, 0.00897216796875, -0.01806640625, 0.0081787109375, -0.022216796875, 0.003387451171875, -0.000766754150390625, 0.017333984375, -0.00946044921875,...

[ 20625, 142508, 2392, 184, 18499, 23, 103510, 10, 20, 106, 115861, 38526, 143434, 132283, 3768, 246, 390, 31380, 238, 1556, 30607, 5759, 29479, 170277, 62, 11050, 5761, 32354, 3034, 103036, 60212, 51042, 1733, 20653, 10548, 7102, 2886, 62607, ...

[ 0.146484375, 0.2415771484375, 0.1629638671875, 0.1502685546875, 0.2208251953125, 0.06451416015625, 0.2459716796875, 0.177001953125, 0.12255859375, 0.15771484375, 0.1475830078125, 0.0855712890625, 0.1583251953125, 0.1837158203125, 0.1260986328125, 0.180908203125, 0.050079345703125, ...

embed

45406239_c0

45406239

haskell

0

Title: Nested Eithers with different error types Problem title: Nested Eithers with different error types Tags: typeclass, either, haskell Problem: Nested Eithers with different error types I have a nested either with different error types, that looks like: Either e1 (Either e2 a) And I'd like a function that does some...

Nested Eithers with different error types Nested Eithers with different error types typeclass either haskell Nested Eithers Either Nested Eithers with different error types I have a nested either with different error types, that looks like: And I'd like a function that does something like: More generally, is there a ty...

[ -0.00262451171875, 0.00946044921875, -0.006011962890625, -0.00982666015625, 0.01470947265625, 0.00921630859375, -0.034912109375, -0.0206298828125, 0.01031494140625, 0.00994873046875, 0.0019989013671875, -0.036865234375, 0.0146484375, 0.0166015625, 0.0034942626953125, -0.006561279296875...

[ 28701, 71, 4565, 9319, 678, 12921, 18499, 52895, 7, 10644, 67413, 40101, 1556, 142508, 87, 765, 8512, 33342, 1884, 32354, 137567, 14858, 90, 903, 103510 ]

[ 0.216064453125, 0.1131591796875, 0.0701904296875, 0.18115234375, 0.07318115234375, 0.172607421875, 0.19091796875, 0.1986083984375, 0.01336669921875, 0.1307373046875, 0.198974609375, 0.193115234375, 0.10235595703125, 0.2039794921875, 0.006988525390625, 0.01116943359375, 0.208129882812...

embed

8191131_c0

8191131

haskell

0

Title: Find the value that failed for quickcheck Problem title: Find the value that failed for quickcheck Tags: quickcheck, haskell Problem: Find the value that failed for quickcheck When a value fails a QuickCheck'd test, I'd like to use it for debugging. Is there any way I can do something like: let failValue = quick...

Find the value that failed for quickcheck Find the value that failed for quickcheck quickcheck haskell Find Find the value that failed for quickcheck When a value fails a QuickCheck'd test, I'd like to use it for debugging. Is there any way I can do something like: If my data was read able then I could probably hack so...

[ -0.00086212158203125, -0.00020599365234375, 0.00738525390625, -0.01507568359375, 0.00567626953125, 0.0167236328125, -0.00494384765625, -0.00732421875, 0.011962890625, 0.00836181640625, 0.0026397705078125, 0.0011749267578125, -0.003204345703125, -0.009521484375, 0.0101318359375, 0.01190...

[ 26040, 34292, 450, 165523, 100, 63773, 78292, 70, 1556, 142508, 35782, 7, 89038, 202567, 3034, 1884, 4527, 8, 978, 36659, 3917, 2053, 12301, 19048, 31895, 85526, 23, 17780, 959 ]

[ 0.1263427734375, 0.174560546875, 0.0794677734375, 0.2147216796875, 0.046142578125, 0.1007080078125, 0.2427978515625, 0.01995849609375, 0.0699462890625, 0.1695556640625, 0.172607421875, 0.04486083984375, 0.10400390625, 0.2349853515625, 0.14404296875, 0.057647705078125, 0.0625, 0.062...

embed

8204511_c1

8204511

haskell

1

I,O] [I,O] it gives me [I,I,O], because it follows: reverse (addC O (reverse x) (reverse y)) reverse (addC O [O,I] [O,I]) But from here, I am confused on how to go about figuring out the addC part. I have the right arguments: a Bigit, and two lists of Bigits. However, I don't understand what pattern to match this to. I...

[ -0.0087890625, 0.028564453125, -0.0054931640625, 0.031494140625, -0.0296630859375, 0.001495361328125, 0.0191650390625, -0.0130615234375, 0.03662109375, 0.00726318359375, 0.0030059814453125, -0.0301513671875, -0.006683349609375, 0.0240478515625, -0.0213623046875, -0.022216796875, -0.0...

[ 87, 4, 670, 268, 568, 442, 76199, 163, 6637, 28960, 39531, 184, 4028, 441, 180, 107, 37676, 1022, 113, 55681, 5281, 3642, 1672, 26747, 214, 1810, 15190, 2831, 7108, 10750, 14195, 217, 6626, 5303, 14481, 28219, 103510, 14858, 32233, 2367, ...

[ 0.1234130859375, 0.0634765625, 0.198486328125, 0.04254150390625, 0.11474609375, 0.0819091796875, 0.1395263671875, 0.08245849609375, 0.057037353515625, 0.1168212890625, 0.2177734375, 0.1591796875, 0.1448974609375, 0.1788330078125, 0.1827392578125, 0.00494384765625, 0.1793212890625, ...

embed

59881907_c0

59881907

haskell

0

Title: getting a tuple subset with lens over a ReaderT Problem title: getting a tuple subset with lens over a ReaderT Tags: haskell, lenses, haskell-lens Problem: getting a tuple subset with lens over a ReaderT I would like to play with tuples and lens this way : myfct :: ReaderT (a,b,c,d,e) m a -> ReaderT (a,c,d) m a ...

getting a tuple subset with lens over a ReaderT getting a tuple subset with lens over a ReaderT haskell lenses haskell-lens ReaderT getting a tuple subset with lens over a ReaderT I would like to play with tuples and lens this way : be able to modify the input tuple to a subset of it... pseudo code would be something l...

[ 0.011962890625, -0.00665283203125, 0.001312255859375, 0.0196533203125, -0.02001953125, -0.017822265625, -0.005340576171875, 0.001312255859375, -0.005096435546875, -0.0103759765625, 0.01251220703125, 0.0400390625, -0.010009765625, 0.003082275390625, 0.01116943359375, -0.009765625, -0....

[ 20949, 370, 8705, 1614, 3509, 678, 3098, 7, 645, 122636, 618, 1556, 142508, 96, 47754, 1977, 2806, 1884, 11301, 99726, 136, 903, 3917, 19048, 2811, 40383, 107730, 47, 74189, 18151 ]

[ 0.05474853515625, 0.1072998046875, 0.1861572265625, 0.1646728515625, 0.1861572265625, 0.06817626953125, 0.159912109375, 0.0251617431640625, 0.0491943359375, 0.1881103515625, 0.138427734375, 0.08740234375, 0.1868896484375, 0.0869140625, 0.052947998046875, 0.1448974609375, 0.0054626464...

embed

10328435_c0

10328435

haskell

0

Title: How to solve floating point number getting wrong in list [haskell] Problem title: How to solve floating point number getting wrong in list [haskell] Tags: list, haskell, floating-point Problem: How to solve floating point number getting wrong in list [haskell] Possible Duplicate: Haskell ranges and floats For ex...

How to solve floating point number getting wrong in list [haskell] How to solve floating point number getting wrong in list [haskell] list haskell floating-point How How to solve floating point number getting wrong in list [haskell] For example, when I type I get this: I expected:

[ -0.0120849609375, -0.004547119140625, -0.0023193359375, -0.0164794921875, 0.0067138671875, 0.006591796875, -0.00836181640625, 0.0107421875, 0.004547119140625, 0.00482177734375, -0.0120849609375, -0.020263671875, 0.00732421875, 0.0142822265625, -0.0133056640625, 0.0002422332763671875, ...

[ 11249, 47, 86869, 21917, 26518, 6275, 14012, 20949, 44691, 23, 5303, 10557, 142508, 1556, 38496, 27781, 10644, 87, 2046, 903, 84751 ]

[ 0.05816650390625, 0.0855712890625, 0.212646484375, 0.17626953125, 0.12255859375, 0.16796875, 0.1512451171875, 0.1331787109375, 0.2025146484375, 0.0565185546875, 0.1939697265625, 0.11004638671875, 0.19287109375, 0.1395263671875, 0.1395263671875, 0.00555419921875, 0.1524658203125, 0....

embed

35318562_c0

35318562

haskell

0

Title: What is Levity polymorphism Problem title: What is Levity polymorphism Tags: haskell Problem: What is Levity polymorphism As the title of the question indicates, I want to know what is Levity polymorphism and what is its motivation ? I know this page has some details in it, but most of the explanations there go ...

What is Levity polymorphism What is Levity polymorphism haskell What Levity What is Levity polymorphism As the title of the question indicates, I want to know what is Levity polymorphism and what is its motivation ? I know this page has some details in it, but most of the explanations there go over the top of my head. ...

[ -0.004974365234375, 0.005645751953125, 0.00909423828125, 0.0054931640625, 0.01141357421875, 0.0084228515625, 0.007080078125, 0.00170135498046875, 0.01416015625, -0.01031494140625, 0.016845703125, -0.0498046875, 0.000461578369140625, 0.0205078125, 0.00274658203125, 0.0087890625, 0.004...

[ 4865, 83, 56890, 939, 35874, 178851, 8780, 1556, 142508, 44759, 3444, 3714, 2367, 6863, 98365, 9191, 41653, 187136, 645, 10336, 34391, 19048, 28219, 50155, 442 ]

[ 0.0894775390625, 0.1072998046875, 0.2098388671875, 0.1986083984375, 0.2039794921875, 0.188232421875, 0.081298828125, 0.1412353515625, 0.2181396484375, 0.0054931640625, 0.051300048828125, 0.0303955078125, 0.0953369140625, 0.0672607421875, 0.1798095703125, 0.008544921875, 0.01205444335...

embed

38709212_c0

38709212

haskell

0

Title: Filter [Node] to [Element] with ghcjs-dom Problem title: Filter [Node] to [Element] with ghcjs-dom Tags: dom, haskell, ghcjs, ghcjs-dom Problem: Filter [Node] to [Element] with ghcjs-dom I am using ghcjs-dom. How can I filter the elements out of an array of nodes? import GHCJS.DOM.Types nodesToElements :: [Node]...

Filter [Node] to [Element] with ghcjs-dom Filter [Node] to [Element] with ghcjs-dom dom haskell ghcjs ghcjs-dom GHCJS.DOM.Types Filter Node Element Filter [Node] to [Element] with ghcjs-dom I am using ghcjs-dom. How can I filter the elements out of an array of nodes? or

[ -0.006622314453125, -0.00009584426879882812, -0.01116943359375, -0.00994873046875, 0.000640869140625, -0.001861572265625, -0.007232666015625, 0.00506591796875, 0.0027618408203125, -0.024658203125, 0.0009765625, -0.05810546875, -0.018798828125, 0.00176239013671875, -0.01611328125, -0.02...

[ 128896, 5021, 47, 647, 19929, 678, 31380, 238, 28175, 3815, 4539, 1556, 142508, 527, 73265, 64977, 127214, 196707, 438, 112, 48325, 17368, 11249, 831, 46312, 80854, 1810, 10298, 111, 110, 988 ]

[ 0.2135009765625, 0.1505126953125, 0.130615234375, 0.0245208740234375, 0.1663818359375, 0.006103515625, 0.131103515625, 0.09210205078125, 0.2056884765625, 0.152099609375, 0.1162109375, 0.09442138671875, 0.174560546875, 0.046539306640625, 0.08056640625, 0.1815185546875, 0.138671875, ...

embed

44578339_c0

44578339

haskell

0

Title: Haskell MArray performance benchmark Problem title: Haskell MArray performance benchmark Tags: functional-programming, haskell, immutability, imperative-programming Problem: Haskell MArray performance benchmark Haskell's MArray is supposed to provide a mutable array. I wonder how does it compare with a normal mu...

Haskell MArray performance benchmark Haskell MArray performance benchmark functional-programming haskell immutability imperative-programming Haskell MArray Haskell MArray performance benchmark Haskell's MArray is supposed to provide a mutable array. I wonder how does it compare with a normal mutable array in an imperat...

[ -0.00653076171875, 0.00445556640625, 0.00982666015625, 0.00994873046875, 0.00101470947265625, -0.00653076171875, -0.0038909912109375, 0.01263427734375, 0.0174560546875, -0.0152587890625, 0.0213623046875, -0.00018405914306640625, 0.0096435546875, -0.0081787109375, -0.006744384765625, -0...

[ 20625, 142508, 9267, 42, 7092, 23718, 240057, 123309, 28966, 1556, 566, 14311, 41159, 222530, 134598, 22691, 842, 22819, 10298, 53, 32195, 3642, 69101, 678, 3638, 56037, 46876, 1884, 41925, 313, 60213, 225490 ]

[ 0.1463623046875, 0.2626953125, 0.032135009765625, 0.05889892578125, 0.2724609375, 0.1903076171875, 0.2366943359375, 0.1204833984375, 0.1136474609375, 0.132080078125, 0.003936767578125, 0.133056640625, 0.051025390625, 0.1917724609375, 0.09222412109375, 0.09423828125, 0.1319580078125, ...

embed

7870673_c0

7870673

haskell

0

Title: parse error (possibly incorrect indentation) Problem title: parse error (possibly incorrect indentation) Tags: haskell Problem: parse error (possibly incorrect indentation) when i execute the following lines of code i get the following error TyInfer.hs:115:0: parse error (possibly incorrect indentation) can anyo...

parse error (possibly incorrect indentation) parse error (possibly incorrect indentation) haskell TyInfer.hs:115:0 Subst TyVar Type Unification Replace Bind Expr Alt parse error (possibly incorrect indentation) when i execute the following lines of code i get the following error can anyone explain me what is the proble...

[ -0.00130462646484375, -0.002471923828125, -0.0030364990234375, 0.01043701171875, 0.0181884765625, 0.00072479248046875, -0.0224609375, -0.019775390625, 0.011474609375, 0.002838134765625, -0.00909423828125, -0.005096435546875, 0.015625, 0.00311279296875, 0.002838134765625, 0.012756347656...

[ 366, 184, 18499, 7522, 172, 38526, 214552, 18597, 22062, 1556, 142508, 8064, 4153, 2875, 127, 7, 103928, 53861, 8273, 271, 81827, 60457, 992, 41274, 853, 23935, 16666, 71, 60075, 42, 10544, 71924, 25632, 124519, 18151, 831, 35672, 73342, 29...

[ 0.1259765625, 0.17138671875, 0.1776123046875, 0.103515625, 0.0853271484375, 0.0880126953125, 0.162353515625, 0.1756591796875, 0.1142578125, 0.1209716796875, 0.2166748046875, 0.1463623046875, 0.09228515625, 0.22998046875, 0.0885009765625, 0.0186309814453125, 0.162841796875, 0.120849...

embed

8624760_c0

8624760

haskell

0

Title: Repa --- How to make a Read instance? Problem title: Repa --- How to make a Read instance? Tags: haskell, repa Problem: Repa --- How to make a Read instance? What is the best way to make type Configuration = Array DIM1 (Double, Double, Double) an instance of Read? So later I could derive data SimulationData = SD...

Repa --- How to make a Read instance? Repa --- How to make a Read instance? haskell repa Repa How Read Configuration Array DIM1 Double SimulationData StdGen Repa --- How to make a Read instance? What is the best way to make an instance of Read? So later I could derive to be an instance of Read too.

[ -0.0118408203125, 0.0050048828125, -0.0009002685546875, 0.0185546875, 0.004425048828125, 0.005706787109375, 0.01556396484375, -0.0142822265625, 0.008056640625, -0.036865234375, -0.02734375, -0.0277099609375, 0.00148773193359375, -0.0196533203125, -0.0021820068359375, -0.02978515625, ...

[ 33742, 11, 28229, 11249, 47, 3249, 10, 4764, 110527, 1556, 142508, 10958, 59994, 69253, 175546, 418, 107172, 144814, 137989, 2907, 71, 105376, 2965, 3917, 142, 14432, 122, 5844, 186, 111, 5792 ]

[ 0.181884765625, 0.2166748046875, 0.0251007080078125, 0.08154296875, 0.0517578125, 0.14208984375, 0.0897216796875, 0.3017578125, 0.29638671875, 0.1181640625, 0.203125, 0.1663818359375, 0.1453857421875, 0.0762939453125, 0.1209716796875, 0.0469970703125, 0.0733642578125, 0.15576171875...

embed

60389269_c0

60389269

haskell

0

Title: How to make a list out of all second elements of a tuple in haskell Problem title: How to make a list out of all second elements of a tuple in haskell Tags: haskell, tuples Problem: How to make a list out of all second elements of a tuple in haskell I have a list of tuples like [(1,"A"),(2,"B"),(3,"C")] Now I wa...

How to make a list out of all second elements of a tuple in haskell How to make a list out of all second elements of a tuple in haskell haskell tuples How How to make a list out of all second elements of a tuple in haskell I have a list of tuples like [(1,"A"),(2,"B"),(3,"C")] Now I want to create a list with all the s...

[ 0.0179443359375, -0.0032958984375, 0.0020294189453125, 0.0205078125, 0.00860595703125, 0.019287109375, -0.030029296875, 0.007354736328125, 0.01361083984375, -0.025634765625, -0.010009765625, -0.03857421875, 0.005889892578125, 0.0255126953125, -0.03466796875, 0.0225830078125, -0.00074...

[ 11249, 47, 3249, 10, 5303, 1810, 111, 756, 17932, 80854, 370, 8705, 23, 1556, 142508, 99726, 1884, 41600, 284, 74054, 54753, 571, 86827, 441, 3444, 28282, 678, 8382, 5608, 4358, 2967 ]

[ 0.0693359375, 0.01873779296875, 0.0928955078125, 0.039825439453125, 0.207763671875, 0.1297607421875, 0.079833984375, 0.13134765625, 0.20361328125, 0.1741943359375, 0.143798828125, 0.20458984375, 0.05047607421875, 0.1522216796875, 0.213134765625, 0.2176513671875, 0.02069091796875, 0...

embed

35546310_c0

35546310

haskell

0

Title: How to deploy a Haskell web app to Heroku in a simple way? Problem title: How to deploy a Haskell web app to Heroku in a simple way? Tags: heroku, haskell Problem: How to deploy a Haskell web app to Heroku in a simple way? I've been googling for a while but haven't found an answer to my question. What's a simple...

How to deploy a Haskell web app to Heroku in a simple way? How to deploy a Haskell web app to Heroku in a simple way? heroku haskell How Haskell Heroku How to deploy a Haskell web app to Heroku in a simple way? I've been googling for a while but haven't found an answer to my question. What's a simple way to deploy a ha...

[ 0.0113525390625, 0.0184326171875, -0.0150146484375, 0.007598876953125, -0.01202392578125, 0.01239013671875, -0.00433349609375, -0.0233154296875, -0.005706787109375, -0.025146484375, 0.00482177734375, -0.03369140625, -0.00193023681640625, 0.01214599609375, -0.0002841949462890625, -0.001...

[ 11249, 47, 8, 13158, 53, 20625, 142508, 1467, 4027, 56889, 319, 8781, 3917, 40814, 1556, 10, 12960, 35166, 38415, 121190, 136, 50695, 22729, 165598, 29806 ]

[ 0.0989990234375, 0.1583251953125, 0.124755859375, 0.17041015625, 0.1546630859375, 0.1654052734375, 0.275146484375, 0.1536865234375, 0.1932373046875, 0.21484375, 0.245361328125, 0.1573486328125, 0.0416259765625, 0.1541748046875, 0.1502685546875, 0.008697509765625, 0.006591796875, 0....

embed

28030983_c1

28030983

haskell

1

:: Double , ball :: Vec2 Double , ballV :: Vec2 Double } deriving Show data Update = BallPos (Vec2 Double) | BallVel (Vec2 Double) | PlayerPos Double | AIPos Double instance Diff State Update where commit s (BallPos p) = s { ball = p } commit s (BallVel p) = s { ballV = p } commit s (PlayerPos p) = s { playerPaddle = ...

[ 0.004425048828125, 0.01202392578125, 0.0030059814453125, 0.006683349609375, 0.0050048828125, 0.0185546875, -0.04150390625, 0.00494384765625, 0.010986328125, 0.027099609375, 0.00146484375, 0.00567626953125, 0.023681640625, -0.0091552734375, -0.036865234375, 0.00555419921875, 0.0235595...

[ 1984, 107172, 4, 16446, 52884, 304, 856, 51912, 16406, 6496, 17367, 2053, 28641, 2203, 21786, 7192, 7, 3240, 58745, 146224, 60560, 62, 10931, 232, 110527, 191144, 22836, 375, 4007, 91, 5584, 915, 15, 142581, 58585, 113954, 19298, 11388, 10,...

[ 0.096923828125, 0.238525390625, 0.050445556640625, 0.2127685546875, 0.248291015625, 0.2047119140625, 0.1995849609375, 0.0159759521484375, 0.1424560546875, 0.10662841796875, 0.222412109375, 0.184814453125, 0.208740234375, 0.04150390625, 0.1717529296875, 0.157470703125, 0.0908813476562...

embed

43862270_c0

43862270

haskell

0

Title: Capturing parameters from a POST request in Spock Problem title: Capturing parameters from a POST request in Spock Tags: haskell, haskell-wai, haskell-spock Problem: Capturing parameters from a POST request in Spock In the documentation of Spock, here https://www.spock.li/2015/04/19/type-safe_routing.html , it o...

Capturing parameters from a POST request in Spock Capturing parameters from a POST request in Spock haskell haskell-wai haskell-spock a Capturing POST Spock Capturing parameters from a POST request in Spock In the documentation of Spock, here https://www.spock.li/2015/04/19/type-safe_routing.html , it only describes ho...

[ -0.01080322265625, -0.00141143798828125, -0.01025390625, -0.0018157958984375, -0.01190185546875, -0.005828857421875, 0.01129150390625, 0.0014801025390625, 0.00274658203125, -0.01361083984375, 0.00848388671875, -0.0162353515625, -0.017333984375, -0.0147705078125, -0.00145721435546875, 0...

[ 14304, 109561, 171859, 7, 1295, 81903, 50336, 23, 23172, 2594, 1556, 142508, 634, 14, 11955, 10, 209806, 24301, 2947, 50986, 115840, 14179, 1916, 98363, 3642, 141621, 2046, 3871, 64333, 1305, 11249, 831, 54 ]

[ 0.1669921875, 0.115478515625, 0.258544921875, 0.07623291015625, 0.1051025390625, 0.195068359375, 0.2169189453125, 0.07373046875, 0.20849609375, 0.2232666015625, 0.115966796875, 0.21435546875, 0.1597900390625, 0.1202392578125, 0.171875, 0.01373291015625, 0.1248779296875, 0.026931762...

embed

65533197_c1

65533197

haskell

1

) Empty *Ch21_12_ExercisesTree Data.Monoid> foldr (<>) (mempty :: Sum Int) t Sum {getSum = 4} *Ch21_12_ExercisesTree Data.Monoid> foldMap Sum t Sum {getSum = 4} I suspect there's something I'm not figuring out about the fold ing function that QuickCheck is using. Questions: Why are failures occurring? Is there a way to...

[ -0.017822265625, -0.0128173828125, 0.007537841796875, 0.0093994140625, 0.000762939453125, 0.0194091796875, -0.027587890625, -0.0198974609375, -0.004302978515625, 0.0028533935546875, -0.01708984375, -0.0191650390625, 0.001922607421875, 0.0146484375, 0.0250244140625, 0.01123046875, -0....

[ 31678, 939, 15982, 3117, 1530, 56, 10794, 62731, 13, 11809, 46674, 48899, 18344, 7569, 2676, 36335, 360, 18, 808, 316, 201, 42822, 166179, 294, 92610, 26747, 3305, 32354, 89038, 202567, 17368, 44084, 137578, 7, 74918, 2852, 11814, 3034, 288...

[ 0.1641845703125, 0.1629638671875, 0.023895263671875, 0.06231689453125, 0.0867919921875, 0.0885009765625, 0.08905029296875, 0.1551513671875, 0.00177001953125, 0.0751953125, 0.00775146484375, 0.1668701171875, 0.1114501953125, 0.1383056640625, 0.036468505859375, 0.1778564453125, 0.00070...

embed

33591346_c0

33591346

haskell

0

Title: Write to text file in IDE Haskell Problem title: Write to text file in IDE Haskell Tags: haskell Problem: Write to text file in IDE Haskell I have the following code and am using an online IDE from School of Haskell: import System.IO main = do h <- openFile "message.txt" WriteMode hPutStrLn h "Greetings earthlin...

Write to text file in IDE Haskell Write to text file in IDE Haskell haskell System.IO Write IDE Haskell message.txt WriteMode Greetings Write to text file in IDE Haskell I have the following code and am using an online IDE from School of Haskell: But it doesn't seem to be working. Where is message.txt saved?

[ 0.0162353515625, 0.01519775390625, 0.003997802734375, 0.03466796875, 0.0031585693359375, 0.021240234375, -0.00075531005859375, 0.006744384765625, -0.004730224609375, -0.00823974609375, -0.0021820068359375, -0.015625, -0.00372314453125, 0.01043701171875, 0.0174560546875, 0.0074768066406...

[ 601, 18781, 47, 7986, 11435, 23, 36497, 20625, 142508, 1556, 12353, 17780, 26008, 5, 124326, 9083, 112, 10255, 126, 5180, 25632, 18151, 17368, 1118, 19188, 111, 4966, 18, 48903, 20697, 78662, 83, 57, 4126 ]

[ 0.0997314453125, 0.1900634765625, 0.2110595703125, 0.16455078125, 0.17578125, 0.05511474609375, 0.24755859375, 0.1287841796875, 0.2193603515625, 0.105712890625, 0.079345703125, 0.1668701171875, 0.19287109375, 0.0576171875, 0.2705078125, 0.14453125, 0.00970458984375, 0.152587890625,...

embed

26950997_c0

26950997

haskell

0

Title: Memoizing `map f` calls Problem title: Memoizing `map f` calls Tags: haskell, dynamic-programming Problem: Memoizing `map f` calls I understand how this memoization works fib :: Int -> Int fib = (map fib' [0..] !!) where fib' 1 = 1 fib' 2 = 1 fib' n = fib (n-2) + fib (n-1) But how can I memoize this function whi...

Memoizing `map f` calls Memoizing `map f` calls haskell dynamic-programming Memoizing n-2 n-1 Memoizing `map f` calls I understand how this memoization works But how can I memoize this function which uses above function. How to make each call for fib use a same cache?

[ 0.01507568359375, -0.0120849609375, 0.013671875, -0.021728515625, -0.0107421875, 0.006591796875, 0.01611328125, 0.0308837890625, 0.00848388671875, -0.0159912109375, -0.0057373046875, 0.00107574462890625, 0.0230712890625, 0.0184326171875, 0.0140380859375, -0.0028839111328125, -0.01177...

[ 17443, 31, 84382, 62346, 1238, 11782, 1556, 142508, 84079, 28966, 653, 5428, 5759, 28219, 3642, 903, 163, 432, 47691, 43240, 831, 20650, 32354, 4527, 36917, 11249, 3249, 12638, 809, 275, 5701, 82365 ]

[ 0.156005859375, 0.1282958984375, 0.1453857421875, 0.178466796875, 0.199951171875, 0.197509765625, 0.1181640625, 0.2120361328125, 0.15576171875, 0.11181640625, 0.01190185546875, 0.1163330078125, 0.09295654296875, 0.07025146484375, 0.052734375, 0.050018310546875, 0.1353759765625, 0.1...

embed

45607474_c1

45607474

haskell

1

fmap ((:) (Just 4)) [Just 5] <- result [Just 4, Just 5] meh (3:[4,5])] (\x -> Just x) = fmap ((:) (Just 3)) [Just 4, Just 5] <- result [Just 4, Just 5] meh [3,4,5] (\x -> Just x) = [Just 3,Just 4, Just 5] As you can see, the substitution does not match to the right result: Just [3,4,5] != [Just 3,Just 4, Just 5] My qu...

[ -0.021728515625, 0.0172119140625, 0.0022430419921875, 0.0021514892578125, 0.00116729736328125, 0.01336669921875, 0.000858306884765625, 0.0004520416259765625, 0.0140380859375, -0.01361083984375, 0.006011962890625, -0.0164794921875, -0.016845703125, 0.0235595703125, 0.004425048828125, -0...

[ 1238, 62346, 60494, 12, 127794, 13956, 190, 4426, 16750, 201, 9563, 31584, 6896, 80389, 425, 33079, 1022, 2203, 8439, 122101, 138, 398, 161740, 1830, 14602, 959, 14858, 47, 7108, 711, 6777, 87, 44691, 9925, 272, 4163, 28864, 26073, 7, 207...

[ 0.1484375, 0.269287109375, 0.0333251953125, 0.1116943359375, 0.20263671875, 0.2398681640625, 0.1866455078125, 0.014739990234375, 0.178466796875, 0.20703125, 0.2108154296875, 0.165771484375, 0.07806396484375, 0.261474609375, 0.07080078125, 0.0780029296875, 0.11962890625, 0.049346923...

embed

46636356_c0

46636356

haskell

0

Title: Haskell version of double loop Problem title: Haskell version of double loop Tags: haskell, loops, duplicates, iteration, functional-programming Problem: Haskell version of double loop I need to do the following in Haskell and can't think of the correct method to do it: for (int i=0; i<100; i++) for (int a=0; a<...

Haskell version of double loop Haskell version of double loop haskell loops duplicates iteration functional-programming Haskell Haskell version of double loop I need to do the following in Haskell and can't think of the correct method to do it: I also don't want 'duplicates' returned so there's not both (1, 50) and (50...

[ 0.0196533203125, -0.00063323974609375, 0.003265380859375, 0.000499725341796875, 0.0181884765625, 0.017578125, -0.0147705078125, -0.01220703125, 0.00058746337890625, -0.0439453125, 0.00927734375, -0.0037689208984375, 0.0150146484375, 0.0024871826171875, -0.0213623046875, 0.007568359375,...

[ 20625, 142508, 11389, 41929, 40956, 1556, 171763, 1636, 17, 720, 123309, 28966, 3871, 54, 25632, 23, 831, 18, 5351, 26785, 55300, 2301, 3444, 693, 52721, 176377, 959, 15044, 836, 83875, 4879, 25647 ]

[ 0.118408203125, 0.2039794921875, 0.1693115234375, 0.18896484375, 0.2100830078125, 0.115478515625, 0.2474365234375, 0.1060791015625, 0.0474853515625, 0.1910400390625, 0.163818359375, 0.0948486328125, 0.06512451171875, 0.0256805419921875, 0.073486328125, 0.033660888671875, 0.0088500976...

embed

78885389_c0

78885389

haskell

0

Title: `getLabel` or `fromLabel` Problem title: `getLabel` or `fromLabel` Tags: documentation, ghc, haskell Problem: `getLabel` or `fromLabel` The GHC documentation for OverloadedLabels here shows examples like Leading capital letters: #Foo equivalant to getLabel @”Foo” Should getLabel be fromLabel ? AFAIK getLabel is ...

`getLabel` or `fromLabel` `getLabel` or `fromLabel` documentation ghc haskell OverloadedLabels Foo `getLabel` or `fromLabel` The GHC documentation for OverloadedLabels here shows examples like Should getLabel be fromLabel ? AFAIK getLabel is for creating unnamed labels from data constructors in template haskell. fromLa...

[ 0.0262451171875, -0.01080322265625, -0.00933837890625, -0.0093994140625, 0.0091552734375, -0.007598876953125, -0.004547119140625, 0.0069580078125, 0.01409912109375, -0.0191650390625, 0.018798828125, -0.035400390625, 0.0098876953125, -0.01031494140625, 0.0037384033203125, -0.02868652343...

[ 9473, 3794, 2729, 4063, 707, 161063, 1135, 209806, 31380, 238, 1556, 142508, 9578, 63033, 297, 97381, 14794, 9572, 31, 527, 73265, 3688, 45831, 27781, 1884, 151117, 2046, 186, 1295, 6, 151334, 17756, 83, 100, 105233, 85589, 4806, 67967, 205...

[ 0.028106689453125, 0.208251953125, 0.2298583984375, 0.31982421875, 0.0784912109375, 0.230712890625, 0.00372314453125, 0.19091796875, 0.10546875, 0.09307861328125, 0.1204833984375, 0.2117919921875, 0.134521484375, 0.187744140625, 0.068359375, 0.1876220703125, 0.1527099609375, 0.1379...

embed

6167936_c0

6167936

haskell

0

Title: Can't seem to get my head around the 'list difference' (\\) operator Problem title: Can't seem to get my head around the 'list difference' (\\) operator Tags: haskell, element, list, set-difference Problem: Can't seem to get my head around the 'list difference' (\\) operator I have ...

Can't seem to get my head around the 'list difference' (\\) operator Can't seem to get my head around the 'list difference' (\\) operator haskell element list set-difference Can Can't seem to get my head around the 'list difference' (\\) operator I have heard the term 'list difference' (\\...

[ 0.0133056640625, 0.0169677734375, 0.01385498046875, 0.00604248046875, -0.0108642578125, 0.01177978515625, -0.008544921875, 0.01220703125, 0.0128173828125, 0.0130615234375, -0.004058837890625, -0.0118408203125, 0.00946044921875, 0.0118408203125, -0.037353515625, 0.00604248046875, 0.01...

[ 4171, 3768, 18, 48903, 2046, 759, 10336, 10932, 6562, 60212, 13273, 39933, 47, 1556, 142508, 12830, 5303, 5423, 428, 18234, 6620, 25, 49782, 70, 13579, 16, 23, 20625, 1284, 7464, 2301, 32233, 3714, 3642, 27781, 25647 ]

[ 0.103271484375, 0.095703125, 0.1265869140625, 0.13330078125, 0.0797119140625, 0.06500244140625, 0.167236328125, 0.146728515625, 0.2344970703125, 0.2880859375, 0.219970703125, 0.2445068359375, 0.019927978515625, 0.1197509765625, 0.255126953125, 0.1634521484375, 0.1719970703125, 0.17...

embed

38273567_c0

38273567

haskell

0

Title: Setting the ghci prompt with colors Problem title: Setting the ghci prompt with colors Tags: prompt, ghci, haskell Problem: Setting the ghci prompt with colors I try to use terminal colors within my ghci prompt. So when I open ghci and try to: Prelude> :set prompt '\[\033[1haskell > \033[0m\]' '\[\033[1\]haskell...

Setting the ghci prompt with colors Setting the ghci prompt with colors prompt ghci haskell Setting Prelude Setting the ghci prompt with colors I try to use terminal colors within my ghci prompt. So when I open ghci and try to: I know that these codes are interpreted by bash with echo and the -e flag. But how can I do ...

[ -0.01495361328125, 0.002410888671875, 0.002960205078125, 0.013671875, -0.0174560546875, 0.0167236328125, 0.0086669921875, 0.0186767578125, -0.00970458984375, 0.039794921875, -0.01153564453125, -0.029541015625, -0.00616455078125, 0.004608154296875, -0.01416015625, 0.0152587890625, -0....

[ 503, 19514, 31380, 318, 105876, 678, 104988, 70, 1556, 142508, 1914, 822, 9790, 4527, 33949, 28032, 9803, 3714, 6097, 18151, 29481, 390, 6, 87109, 28, 3089, 136, 20, 13, 49938, 54, 903 ]

[ 0.1246337890625, 0.058624267578125, 0.134033203125, 0.1927490234375, 0.2298583984375, 0.10015869140625, 0.2247314453125, 0.034912109375, 0.083984375, 0.194580078125, 0.050811767578125, 0.1441650390625, 0.048065185546875, 0.101318359375, 0.20703125, 0.114013671875, 0.0692138671875, ...

embed

21714826_c0

21714826

haskell

0

Title: Converting monads Problem title: Converting monads Tags: haskell, monads Problem: Converting monads Lets say I have function (>>*=) :: (Show e') => Either e' a -> (a -> Either e b) -> Either e b which is converting errors of different types in clean streamlined functions. I am pretty happy about this. BUT Could ...

Converting monads Converting monads haskell monads Converting Show Either Converting monads Lets say I have function which is converting errors of different types in clean streamlined functions. I am pretty happy about this. BUT Could there possibly be function <*- that would do similar job insted of <- keyword, that i...

[ -0.000751495361328125, -0.01251220703125, 0.01708984375, 0.0093994140625, 0.0240478515625, -0.005096435546875, -0.03173828125, -0.0174560546875, 0.0091552734375, -0.01116943359375, 0.0118408203125, -0.009033203125, -0.00506591796875, 0.00732421875, 0.004425048828125, -0.019287109375, ...

[ 1657, 814, 1916, 2667, 712, 7, 1556, 142508, 17367, 9319, 765, 32354, 96760, 214, 18499, 12921, 52895, 23, 46622, 75973, 2256, 28875, 17723, 151654, 191147, 2685, 144681, 186, 4426, 1639, 9, 450, 2806, 54, 21373, 12447, 14437, 111, 166117, ...

[ 0.04644775390625, 0.1466064453125, 0.06439208984375, 0.1368408203125, 0.1990966796875, 0.0654296875, 0.10577392578125, 0.2196044921875, 0.1309814453125, 0.01220703125, 0.008880615234375, 0.2227783203125, 0.149658203125, 0.0562744140625, 0.238037109375, 0.05877685546875, 0.09692382812...

embed

7173080_c0

7173080

haskell

0

Title: fmap fork functions Problem title: fmap fork functions Tags: haskell Problem: fmap fork functions I want to compose functions in the following way: compose :: (a->b->c) -> (d->a) -> (d->b) -> d -> c compose f g h x = f (g x) (h x) So that we can use it in the following way: compose (==) (myReverse . myReverse) i...

fmap fork functions fmap fork functions haskell fmap fork functions I want to compose functions in the following way: So that we can use it in the following way: I think it could be simplified with something like 'fmap', so that it needn't define 'compose' at all. But I failed to figure out how to do that.

[ 0, 0.0028076171875, -0.00146484375, 0.01458740234375, -0.0164794921875, 0.0244140625, 0.00750732421875, 0.00946044921875, 0.01202392578125, -0.030029296875, -0.001373291015625, 0.007659912109375, 0.0009002685546875, 0.0211181640625, -0.0012969970703125, -0.023681640625, -0.0057373046...

[ 1238, 62346, 100, 92, 32354, 1556, 142508, 3444, 47, 150350, 7, 25632, 3917, 831, 4527, 5351, 5809, 112892, 1029, 297, 678, 9844, 1884, 420, 3871, 18, 61924, 277, 78381, 756, 165523, 26366, 54 ]

[ 0.10546875, 0.236083984375, 0.137451171875, 0.093505859375, 0.2218017578125, 0.1138916015625, 0.2012939453125, 0.1055908203125, 0.0078125, 0.25341796875, 0.0684814453125, 0.05865478515625, 0.0687255859375, 0.009185791015625, 0.121826171875, 0.060302734375, 0.05029296875, 0.12988281...

embed

74397002_c0

74397002

haskell

0

Title: extract value of a from IO (Maybe a) Problem title: extract value of a from IO (Maybe a) Tags: haskell Problem: extract value of a from IO (Maybe a) I am making a game with gloss and got this: pictureMapBasic :: [Picture] -> Picture -> [Picture] pictureMapBasic picL pic = picL ++ (loadJuicyPNG "lib\assets\back.p...

extract value of a from IO (Maybe a) extract value of a from IO (Maybe a) haskell IO Maybe Picture back.png extract value of a from IO (Maybe a) I am making a game with gloss and got this: How do I take this IO (Maybe Picture) (from loadJuicyPNG) and turn it into a Picture and add it to the list?

[ -0.0023651123046875, -0.0019073486328125, -0.00007963180541992188, 0.008544921875, -0.00408935546875, 0.0205078125, 0.0030364990234375, -0.00885009765625, 0.0009613037109375, -0.01373291015625, 0.005523681640625, -0.0096435546875, 0.00046539306640625, 0.00225830078125, 0.003662109375, ...

[ 125663, 34292, 111, 10, 1295, 17780, 82419, 372, 1556, 142508, 83425, 158656, 4420, 128468, 20662, 6712, 678, 207244, 4163, 903, 11249, 54, 5646, 16, 161063, 72367, 21718, 14, 2408, 683, 8066, 15504, 3934, 15190, 47, 70, 5303 ]

[ 0.24560546875, 0.2154541015625, 0.1146240234375, 0.1180419921875, 0.15478515625, 0.23779296875, 0.111083984375, 0.05987548828125, 0.1224365234375, 0.2288818359375, 0.1302490234375, 0.2366943359375, 0.1895751953125, 0.188232421875, 0.05377197265625, 0.1207275390625, 0.0484619140625, ...

embed

41905124_c0

41905124

haskell

0

Title: how to use IO monad output on fly Problem title: how to use IO monad output on fly Tags: haskell, monads Problem: how to use IO monad output on fly This is what I am doing: data Person = Person (IORef String) (IORef Int) name <- newIORef "Boston" age <- newIORef 100 p = Person name age I am wondering if I can pu...

how to use IO monad output on fly how to use IO monad output on fly haskell monads Person IORef Boston how to use IO monad output on fly This is what I am doing: I am wondering if I can put them in one line, like: Is there any way to put them in one line?

[ -0.008056640625, 0.01446533203125, 0.00836181640625, 0.035888671875, 0.0098876953125, 0.01953125, -0.0130615234375, -0.00250244140625, -0.0137939453125, -0.03564453125, 0.00970458984375, -0.01141357421875, 0.0233154296875, -0.0081787109375, 0.00089263916015625, -0.0166015625, -0.0077...

[ 3642, 47, 4527, 17780, 2667, 712, 140992, 98, 12403, 1556, 142508, 15270, 123435, 4240, 62704, 20594, 149016, 831, 3884, 2856, 23, 1632, 13315, 2499, 3917 ]

[ 0.093017578125, 0.0792236328125, 0.152587890625, 0.22705078125, 0.149169921875, 0.22998046875, 0.2286376953125, 0.08843994140625, 0.2091064453125, 0.08203125, 0.203125, 0.093505859375, 0.060882568359375, 0.12164306640625, 0.1273193359375, 0.0099334716796875, 0.042266845703125, 0.04...

embed

48643231_c0

48643231

haskell

0

Title: understanding a Haskell function with filter and lambda expressions Problem title: understanding a Haskell function with filter and lambda expressions Tags: list, haskell, filter Problem: understanding a Haskell function with filter and lambda expressions j :: [Int] j = filter ((\h x -> h x > x) (\y -> y*y)) [-2...

understanding a Haskell function with filter and lambda expressions understanding a Haskell function with filter and lambda expressions list haskell filter Haskell understanding a Haskell function with filter and lambda expressions This one outputs [-2,-1,2] but why? could someone please explain me step by step what Ha...

[ 0.01312255859375, 0.0185546875, -0.01263427734375, -0.01458740234375, 0.01055908203125, 0.00518798828125, 0.0167236328125, 0.0218505859375, 0.004119873046875, 0.0184326171875, 0.004302978515625, -0.0177001953125, -0.00244140625, -0.00836181640625, 0.0081787109375, -0.00107574462890625,...

[ 100094, 20625, 142508, 32354, 678, 46312, 136, 21, 6492, 85, 125195, 10, 5303, 1556, 1632, 140992, 7, 378, 5428, 4, 9, 133063, 15400, 73342, 29954, 14602, 3688, 2046, 903 ]

[ 0.1414794921875, 0.1287841796875, 0.25537109375, 0.1744384765625, 0.093994140625, 0.2344970703125, 0.06524658203125, 0.044952392578125, 0.1566162109375, 0.11572265625, 0.18115234375, 0.01654052734375, 0.09356689453125, 0.10296630859375, 0.013336181640625, 0.2060546875, 0.018264770507...

embed

13400289_c1

13400289

haskell

1

dpy) (apros,real) <- allocNamedColor dpy colormap color return $ color_pixel apros Basically, I need to create a simple window with a canvas, on which I will draw some lines. What am I doing wrong in that snippet? Versions: X11 - 1.5.0.1 GHC - 6.12.1 OS - Linux Mint 10 Xorg - 1:7.5 Code signals: Graphics.X11.Xlib, Sys...

[ -0.005340576171875, -0.005126953125, 0.002899169921875, 0.007415771484375, 0.0089111328125, 0.00750732421875, 0.004180908203125, -0.0157470703125, 0.0003662109375, -0.018798828125, -0.004302978515625, -0.006622314453125, 0.00921630859375, -0.00555419921875, -0.013916015625, 0.001953125...

[ 104, 6493, 11, 88718, 30544, 756, 6652, 163612, 71, 10625, 1484, 10576, 62346, 30646, 3650, 66535, 583, 95356, 7, 3871, 28282, 8781, 76896, 678, 831, 4079, 1221, 79442, 3060, 124519, 444, 20594, 44691, 93, 58134, 40647, 1193, 1662, 22410, ...

[ 0.0963134765625, 0.2685546875, 0.050323486328125, 0.2469482421875, 0.1810302734375, 0.077880859375, 0.115234375, 0.127685546875, 0.028350830078125, 0.086669921875, 0.1634521484375, 0.17626953125, 0.1900634765625, 0.104736328125, 0.08184814453125, 0.0987548828125, 0.08642578125, 0.1...

embed

12161705_c0

12161705

haskell

0

Title: Run Yesod app as specific user with Keter Problem title: Run Yesod app as specific user with Keter Tags: yesod, haskell, deployment Problem: Run Yesod app as specific user with Keter How can I ask Keter to run my Yesod app as a specific user? Running as root doesn't seem very safe. In addition, my application is...

Run Yesod app as specific user with Keter Run Yesod app as specific user with Keter yesod haskell deployment Run Yesod Keter Run Yesod app as specific user with Keter How can I ask Keter to run my Yesod app as a specific user? Running as root doesn't seem very safe. In addition, my application is calling an external co...

[ 0.00144195556640625, 0.007720947265625, 0.0029296875, -0.013427734375, -0.02490234375, 0.0218505859375, -0.005035400390625, -0.032470703125, -0.0067138671875, 0.00188446044921875, -0.007720947265625, 0.012939453125, -0.0238037109375, 0.0361328125, 0.010009765625, -0.01141357421875, 0...

[ 28398, 32635, 2199, 4027, 237, 29458, 38937, 678, 1345, 720, 2422, 23722, 1556, 142508, 13158, 831, 26458, 47, 11675, 592, 74855, 22027, 18, 48903, 4552, 46002, 66044, 38415, 159029, 173591, 75101, 1884, 351, 59104, 65918, 2806, 17203, 102158...

[ 0.16748046875, 0.1898193359375, 0.28173828125, 0.169921875, 0.10382080078125, 0.2071533203125, 0.2342529296875, 0.1112060546875, 0.180419921875, 0.2578125, 0.1163330078125, 0.2381591796875, 0.0902099609375, 0.170654296875, 0.0611572265625, 0.04327392578125, 0.1295166015625, 0.04071...

embed

34905869_c0

34905869

haskell

0

Title: Creating infinite list out of ADT Problem title: Creating infinite list out of ADT Tags: haskell Problem: Creating infinite list out of ADT In Haskell, > a = [1,1..] creates an infinite list. Now I have the following data Subunit = O | P deriving (Eq, Show) And if I do b :: [Subunit] b = take 6 [P,P..] I get the...

Creating infinite list out of ADT Creating infinite list out of ADT haskell Creating ADT Subunit Show Creating infinite list out of ADT In Haskell, creates an infinite list. Now I have the following And if I do I get the following: Why this is failing? What I need to add to be able to create an infinite list?

[ 0.007232666015625, 0.007781982421875, 0.01080322265625, 0.0220947265625, -0.0250244140625, -0.00872802734375, -0.0010223388671875, -0.01177978515625, -0.002349853515625, -0.0013885498046875, -0.00885009765625, -0.010498046875, 0.0145263671875, 0.00909423828125, -0.003753662109375, -0.0...

[ 56781, 54241, 13, 5303, 1810, 111, 62, 41072, 1916, 1556, 142508, 8273, 309, 217, 17367, 20625, 28282, 25632, 44084, 903, 35782, 214, 3871, 15190, 19048 ]

[ 0.1251220703125, 0.1492919921875, 0.0948486328125, 0.2044677734375, 0.097412109375, 0.07275390625, 0.1002197265625, 0.21044921875, 0.03607177734375, 0.114013671875, 0.225830078125, 0.1092529296875, 0.109375, 0.032318115234375, 0.151611328125, 0.120361328125, 0.130859375, 0.04479980...

embed

1813575_c0

1813575

haskell

0

Title: It's a good idea use ruby for socket programming? Problem title: It's a good idea use ruby for socket programming? Tags: erlang, scala, ruby, haskell Problem: It's a good idea use ruby for socket programming? My language of choice is Ruby, but I know because of twitter that Ruby can't handle a lot of r...

It's a good idea use ruby for socket programming? It's a good idea use ruby for socket programming? erlang scala ruby haskell It's a good idea use ruby for socket programming? My language of choice is Ruby, but I know because of twitter that Ruby can't handle a lot of requests. It is a good idea using it for ...

[ -0.00061798095703125, 0.01385498046875, 0.0123291015625, -0.009521484375, 0.0034942626953125, -0.0250244140625, -0.00885009765625, 0.0103759765625, -0.0185546875, -0.046142578125, 0.0291748046875, -0.0198974609375, 0.01904296875, -0.0135498046875, -0.00151824951171875, -0.00244140625, ...

[ 3768, 4127, 6528, 4527, 21922, 53, 100, 221, 27853, 56037, 449, 72, 3066, 146232, 1556, 142508, 46876, 44126, 83, 158189, 3714, 34776, 831, 18, 34831, 5915, 50336, 17368, 34754, 123309, 106001 ]

[ 0.039031982421875, 0.08441162109375, 0.0928955078125, 0.0848388671875, 0.1771240234375, 0.1981201171875, 0.04388427734375, 0.1063232421875, 0.1903076171875, 0.1590576171875, 0.049072265625, 0.04144287109375, 0.21142578125, 0.163818359375, 0.06768798828125, 0.1885986328125, 0.18334960...

embed

27283002_c0

27283002

haskell

0

Title: Unwrapping function types in Haskell Problem title: Unwrapping function types in Haskell Tags: haskell Problem: Unwrapping function types in Haskell is there a way to unwrap the following type in Haskell? newtype Rand a = Rand(StdGen -> (a , StdGen)) I've got a function which returns this type and another one wh...

Unwrapping function types in Haskell Unwrapping function types in Haskell haskell Unwrapping Haskell Rand StdGen Unwrapping function types in Haskell is there a way to unwrap the following type in Haskell? I've got a function which returns this type and another one which I'd like to use the 'a' value from the returned ...

[ -0.0035552978515625, -0.004241943359375, -0.0017852783203125, 0.004638671875, 0.003631591796875, 0.0177001953125, -0.013427734375, -0.0322265625, -0.0091552734375, -0.03369140625, -0.0098876953125, 0.00262451171875, -0.021728515625, 0.00701904296875, -0.0033721923828125, -0.01031494140...

[ 992, 5429, 11, 26783, 32354, 52895, 23, 20625, 142508, 1556, 39643, 2907, 71, 105376, 2685, 10, 3917, 47, 51, 434, 13631, 25632, 10644, 30646, 903, 136, 15700, 1884, 4527, 34292, 1295, 176377, 26366, 125663 ]

[ 0.1329345703125, 0.162109375, 0.1439208984375, 0.09521484375, 0.2100830078125, 0.2110595703125, 0.0738525390625, 0.13427734375, 0.24560546875, 0.123291015625, 0.1832275390625, 0.125, 0.06146240234375, 0.1944580078125, 0.01605224609375, 0.006622314453125, 0.087646484375, 0.024810791...

embed

66278118_c0

66278118

haskell

0

Title: Patterns not matched: Haskell Problem title: Patterns not matched: Haskell Tags: recursion, list, haskell, ghci Problem: Patterns not matched: Haskell I wrote a function that takes a list as an input and outputs the sum of its elements, but I get the following error: "Pattern match(es) are non-exhaustive In an e...

Patterns not matched: Haskell Patterns not matched: Haskell recursion list haskell ghci Patterns Haskell x:xs Patterns not matched: Haskell I wrote a function that takes a list as an input and outputs the sum of its elements, but I get the following error: "Pattern match(es) are non-exhaustive In an equation for ‘addfu...

[ -0.025146484375, 0.019287109375, 0.0172119140625, 0.0093994140625, -0.01708984375, 0.008544921875, 0.00054931640625, -0.005950927734375, 0.025146484375, -0.000797271728515625, 0.0162353515625, -0.03662109375, 0.00860595703125, 0.01068115234375, 0.005889892578125, -0.003753662109375, ...

[ 9876, 22766, 7, 959, 14858, 297, 20625, 142508, 195625, 1830, 5303, 1556, 31380, 318, 12, 425, 54397, 32354, 51776, 237, 107730, 140992, 10554, 80854, 25632, 18499, 8335, 3055, 19, 90, 621, 351, 3355, 18391, 4935, 5490, 11, 128205, 309, 2...

[ 0.141845703125, 0.1689453125, 0.000091552734375, 0.15478515625, 0.1998291015625, 0.1187744140625, 0.103759765625, 0.2120361328125, 0.1385498046875, 0.0263671875, 0.12890625, 0.0858154296875, 0.0362548828125, 0.07135009765625, 0.007781982421875, 0.03692626953125, 0.03118896484375, 0...

embed

32899040_c0

32899040

haskell

0

Title: How can I make Stack call Happy, Alex and other build tools? Problem title: How can I make Stack call Happy, Alex and other build tools? Tags: haskell-stack, happy, haskell Problem: How can I make Stack call Happy, Alex and other build tools? As part of my compiler, I need alex and happy to run as part of my bui...

How can I make Stack call Happy, Alex and other build tools? How can I make Stack call Happy, Alex and other build tools? haskell-stack happy haskell How Stack Happy Alex How can I make Stack call Happy, Alex and other build tools? As part of my compiler, I need alex and happy to run as part of my build process. How do...

[ -0.0184326171875, 0.02001953125, 0.0086669921875, 0.0068359375, -0.0057373046875, 0.0252685546875, -0.0027923583984375, 0.00390625, 0.006500244140625, -0.0211181640625, -0.006317138671875, -0.014892578125, 0.01483154296875, 0.01263427734375, 0.0159912109375, -0.0068359375, -0.0034637...

[ 11249, 831, 3249, 6512, 2594, 11782, 32506, 20984, 45367, 72977, 4, 3789, 1556, 142508, 590, 17723, 87, 2831, 9969, 34759, 3871, 662, 425, 136, 47, 11675, 9433, 8060, 106117, 3642, 68067, 237, 1340, 6032, 42548, 117538 ]

[ 0.079345703125, 0.082275390625, 0.10321044921875, 0.1741943359375, 0.173583984375, 0.160888671875, 0.2296142578125, 0.2283935546875, 0.1480712890625, 0.2073974609375, 0.0146026611328125, 0.0062255859375, 0.0966796875, 0.19970703125, 0.12060546875, 0.2139892578125, 0.02044677734375, ...

embed

11199853_c0

11199853

haskell

0

Title: How can I search a hackage package for a function? Problem title: How can I search a hackage package for a function? Tags: haskell, hackage Problem: How can I search a hackage package for a function? Maybe I am missing something, but is there a way to search inside some package on hackage? Let's say I know that ...

How can I search a hackage package for a function? How can I search a hackage package for a function? haskell hackage How How can I search a hackage package for a function? Maybe I am missing something, but is there a way to search inside some package on hackage? Let's say I know that Snap framework has a function call...

[ -0.006927490234375, 0.01373291015625, -0.0005645751953125, 0.0022125244140625, -0.0208740234375, -0.0028533935546875, 0.008056640625, -0.00921630859375, -0.005706787109375, -0.045166015625, -0.00531005859375, -0.038818359375, -0.01220703125, 0.001190185546875, -0.01513671875, 0.0065917...

[ 11249, 831, 33938, 85526, 4588, 98169, 100, 32354, 87, 10, 1556, 142508, 83425, 132283, 3917, 47, 46132, 98, 3714, 121190, 170846, 35839, 89159, 7413, 442, 72134, 139509, 10557, 29102, 7, 10957, 143161, 102014 ]

[ 0.088134765625, 0.05999755859375, 0.2464599609375, 0.2393798828125, 0.2122802734375, 0.273681640625, 0.1116943359375, 0.21044921875, 0.0207977294921875, 0.047210693359375, 0.1240234375, 0.2076416015625, 0.03021240234375, 0.05322265625, 0.04510498046875, 0.049102783203125, 0.138427734...

embed

7420514_c0

7420514

haskell

0

Title: Using text-icu library in Haskell on Mac OS Problem title: Using text-icu library in Haskell on Mac OS Tags: cabal, haskell, icu Problem: Using text-icu library in Haskell on Mac OS I am trying to use the text-icu library as a dependency in a cabal package on Mac OS. I have icu installed but when I try to build ...

Using text-icu library in Haskell on Mac OS Using text-icu library in Haskell on Mac OS cabal haskell icu Using Haskell Mac Using text-icu library in Haskell on Mac OS I am trying to use the text-icu library as a dependency in a cabal package on Mac OS. I have icu installed but when I try to build my package cabal give...

[ -0.0016021728515625, -0.0037994384765625, 0.01904296875, 0.0228271484375, 0.004791259765625, 0.014404296875, 0.00408935546875, 0.00897216796875, -0.036865234375, 0.017578125, 0.00106048583984375, -0.05224609375, 0.0128173828125, -0.00518798828125, 0.00872802734375, -0.023193359375, -...

[ 345, 7986, 9, 36742, 35773, 1294, 20625, 142508, 4727, 11787, 23, 98, 109524, 1556, 17, 1010, 31577, 4527, 237, 42548, 27771, 98169, 20600, 9790, 45367, 18499, 16771, 214, 313, 10484, 14, 1819, 19, 10135, 18190, 8, 978, 98441 ]

[ 0.061004638671875, 0.172119140625, 0.0751953125, 0.2237548828125, 0.2066650390625, 0.07366943359375, 0.1395263671875, 0.2376708984375, 0.117431640625, 0.11474609375, 0.010284423828125, 0.001739501953125, 0.2100830078125, 0.125732421875, 0.114990234375, 0.2315673828125, 0.035919189453...

embed

42075687_c1

42075687

haskell

1

.Interpreted.renderTemplate function. Code signals: Data.String.Conversions, Data.Maybe, qualified, Heist.Internal.Types, Data.List, Data.Map.Syntax, Data.ByteString.Builder, Rendering, Heist, Heist.Interpreted, Heist.Compiled, HeistCom, Text.XmlHtml, HeistState, ActionM, MapSyntax, Text, I.Splice, HeistCom.Splice, Att...

[ -0.0284423828125, -0.0032958984375, -0.00439453125, -0.0093994140625, -0.0303955078125, 0.01080322265625, -0.0106201171875, 0.00469970703125, -0.004241943359375, -0.0250244140625, -0.026611328125, -0.0045166015625, -0.0111083984375, -0.0091552734375, 0.004425048828125, 0.016845703125, ...

[ 5, 44851, 56359, 297, 18280, 42, 159065, 19309, 32354, 28864, 26073, 7, 12, 11809, 71713, 214, 11935, 46354, 82419, 372, 217225, 1529, 1419, 6236, 196707, 154663, 166179, 294, 3371, 86531, 75358, 67, 121137, 56, 63137, 4209, 108161, 6259, 1...

[ 0.05523681640625, 0.1685791015625, 0.2568359375, 0.1356201171875, 0.2120361328125, 0.144287109375, 0.2587890625, 0.2264404296875, 0.1988525390625, 0.2474365234375, 0.26806640625, 0.103271484375, 0.0242919921875, 0.1353759765625, 0.117919921875, 0.02142333984375, 0.048004150390625, ...

embed

4738609_c0

4738609

haskell

0

Title: About scanl1 in Haskell Problem title: About scanl1 in Haskell Tags: haskell Problem: About scanl1 in Haskell A function should return the running sums of a list. Such as calling it with [1,2,3,5] returns [1,3,6,11] . I wrote this function like below: sumlist' :: [xx]=[xx] sumlist' []=[] sumlist' [x]=x sumlist' ...

About scanl1 in Haskell About scanl1 in Haskell haskell About scanl1 Haskell About scanl1 in Haskell A function should return the running sums of a list. Such as calling it with [1,2,3,5] returns [1,3,6,11] . I wrote this function like below: When I run it in GHcI, it shows me that I do multiple declarations. So what's...

[ -0.005523681640625, 0.00128936767578125, 0.0242919921875, 0.020263671875, -0.00970458984375, 0.0125732421875, -0.012939453125, -0.00063323974609375, 0.007080078125, -0.03076171875, 0.01708984375, 0.0026702880859375, -0.00506591796875, 0.0035858154296875, 0.017333984375, 0.0157470703125...

[ 56888, 44954, 141, 418, 20625, 142508, 1556, 23, 32354, 5608, 30646, 70, 51042, 10554, 7, 111, 5303, 159029, 442, 678, 133063, 92714, 363, 910, 1662, 54397, 1884, 35064, 11675, 41877, 238, 568, 45831, 54, 48716, 21635, 5256, 44691, 903 ]

[ 0.04949951171875, 0.2010498046875, 0.19873046875, 0.1451416015625, 0.155517578125, 0.24462890625, 0.132080078125, 0.0128173828125, 0.2218017578125, 0.099609375, 0.1859130859375, 0.0257415771484375, 0.19384765625, 0.219970703125, 0.106689453125, 0.039093017578125, 0.2020263671875, 0...

embed

62914847_c1

62914847

haskell

1

Cudd.Cudd.cuddPrintDdInfo manager dd printDdInfo :: Either Bdd Zdd -> IO() printDdInfo dd = case dd of Zdd dd -> do putStrLn "Hello, bdd!" Cudd.Cudd.cuddPrintDdInfo manager dd Bdd dd -> do putStrLn "Hello, bdd!" Cudd.Cudd.cuddPrintDdInfo manager dd All of these methods failed. What is the most elegant way of writing t...

[ -0.0194091796875, 0.00433349609375, 0.00164794921875, 0.0059814453125, -0.01611328125, 0.024658203125, 0.00064849853515625, -0.0107421875, -0.0034332275390625, 0.00179290771484375, 0.00130462646484375, -0.0244140625, 0.0206298828125, -0.01416015625, 0.01055908203125, 0.013671875, 0.0...

[ 3003, 4028, 33177, 1010, 112079, 18, 397, 71, 93147, 31095, 28412, 9319, 335, 567, 17780, 132, 2203, 7225, 3884, 71713, 19, 841, 13817, 4, 876, 6097, 150624, 165523, 2684, 27650, 3917, 32562, 903, 18151, 35743, 28864, 26073, 1556, 142508, ...

[ 0.161865234375, 0.211669921875, 0.1470947265625, 0.1456298828125, 0.134033203125, 0.0235595703125, 0.109130859375, 0.1748046875, 0.2626953125, 0.21484375, 0.21142578125, 0.1810302734375, 0.05914306640625, 0.09326171875, 0.1690673828125, 0.004302978515625, 0.004486083984375, 0.10534...

embed

25287791_c0

25287791

haskell

0

Title: If I restart compilation will it pick up where it left off? Problem title: If I restart compilation will it pick up where it left off? Tags: makefile, haskell, ghc Problem: If I restart compilation will it pick up where it left off? I'm building GHC from source but forgot to add the -j3 option to tell it to use ...

If I restart compilation will it pick up where it left off? If I restart compilation will it pick up where it left off? makefile haskell ghc If I restart compilation will it pick up where it left off? I'm building GHC from source but forgot to add the -j3 option to tell it to use both cores on my machine. If I Ctrl-c a...

[ -0.01373291015625, 0.0012054443359375, 0.01300048828125, 0.00946044921875, -0.00946044921875, 0.0030975341796875, -0.0277099609375, 0.0093994140625, -0.01123046875, -0.0247802734375, -0.02392578125, -0.022216796875, 0.000919342041015625, 0.0245361328125, 0.00823974609375, 0.00952148437...

[ 4263, 87, 456, 17137, 98352, 1363, 1221, 39580, 1257, 7440, 25737, 5773, 3249, 29822, 1556, 142508, 31380, 238, 33976, 527, 73265, 1295, 31344, 100, 9904, 15190, 20, 170, 363, 35829, 14192, 4527, 15044, 48052, 36279, 68847, 9433, 21342, 435...

[ 0.04095458984375, 0.038818359375, 0.134033203125, 0.2255859375, 0.193603515625, 0.0555419921875, 0.06439208984375, 0.138671875, 0.1573486328125, 0.06719970703125, 0.085205078125, 0.1295166015625, 0.09521484375, 0.1810302734375, 0.1190185546875, 0.2215576171875, 0.1368408203125, 0.1...

embed

26995382_c0

26995382

haskell

0

Title: Type signatures that never make sense Problem title: Type signatures that never make sense Tags: types, haskell, parametric-polymorphism, signature, type-signature Problem: Type signatures that never make sense Consider (a->a) -> [a] -> Bool Is there any meaningful definition for this signature? That is, a defin...

Type signatures that never make sense Type signatures that never make sense types haskell parametric-polymorphism signature type-signature Type Bool Type signatures that never make sense Consider Is there any meaningful definition for this signature? That is, a definition that not simply ignores the argument? It seems ...

[ 0.00732421875, 0.01202392578125, -0.00726318359375, -0.0037078857421875, -0.0033416748046875, 0.025146484375, 0.01025390625, -0.005462646484375, 0.000934600830078125, -0.01336669921875, -0.01385498046875, -0.029052734375, -0.0196533203125, 0.00787353515625, -0.00439453125, -0.002075195...

[ 60457, 138256, 7, 450, 8306, 3249, 10422, 52895, 1556, 142508, 121, 186518, 135545, 178851, 8780, 10644, 137432, 2460, 929, 137399, 2499, 91084, 7844, 80934, 100, 903, 959, 124962, 10750, 37202, 5941, 6044, 831, 79986, 71, 1810, 109312 ]

[ 0.215087890625, 0.2303466796875, 0.0380859375, 0.06884765625, 0.1419677734375, 0.1204833984375, 0.2081298828125, 0.220458984375, 0.11181640625, 0.2147216796875, 0.062225341796875, 0.1466064453125, 0.112060546875, 0.1697998046875, 0.0518798828125, 0.182373046875, 0.19189453125, 0.11...

embed

22132328_c0

22132328

haskell

0

Title: Haskell - find out type Signature Problem title: Haskell - find out type Signature Tags: functional-programming, haskell, type-signature, evaluate Problem: Haskell - find out type Signature I'm new to Haskell and Functional Programming and I'm not able to figure out why the type-signature of t2 = (\x y z a -> ((...

Haskell - find out type Signature Haskell - find out type Signature functional-programming haskell type-signature evaluate Haskell Signature Haskell - find out type Signature I'm new to Haskell and Functional Programming and I'm not able to figure out why the type-signature of looks like this: Could you please tell me ...

[ 0.022216796875, 0.01275634765625, -0.001922607421875, 0.0322265625, 0.004425048828125, 0.00927734375, -0.012939453125, 0.0181884765625, 0.00384521484375, 0.00732421875, -0.0181884765625, -0.0211181640625, 0.0103759765625, 0.00384521484375, -0.004364013671875, 0.00189208984375, 0.0081...

[ 20625, 142508, 7413, 1810, 10644, 26729, 141762, 123309, 28966, 1556, 137432, 151575, 3525, 28670, 10763, 27958, 959, 19048, 26366, 15400, 9, 13, 111, 33342, 1884, 903, 191147, 22936, 14192, 163, 3642, 442, 43240, 28601 ]

[ 0.1239013671875, 0.23095703125, 0.0977783203125, 0.095947265625, 0.234619140625, 0.1279296875, 0.2056884765625, 0.1083984375, 0.10601806640625, 0.113037109375, 0.202880859375, 0.117431640625, 0.028900146484375, 0.02325439453125, 0.01324462890625, 0.07672119140625, 0.0377197265625, ...

embed

65376307_c0

65376307

haskell

0

Title: unlawful lens Haskell Problem title: unlawful lens Haskell Tags: lenses, haskell Problem: unlawful lens Haskell Is there a common name/type for a lens-like object that does not satisfy the property of getting out what you put in? For example something like a listLength :: Lens [a] Int where if you put in a lengt...

unlawful lens Haskell unlawful lens Haskell lenses haskell Haskell Lens unlawful lens Haskell Is there a common name/type for a lens-like object that does not satisfy the property of getting out what you put in? For example something like a listLength :: Lens [a] Int where if you put in a length shorter than that of th...

[ 0.004638671875, 0.0081787109375, -0.0034027099609375, 0.0152587890625, 0.0030364990234375, 0.01519775390625, -0.01416015625, -0.0123291015625, -0.000736236572265625, 0.0079345703125, 0.003326416015625, 0.019775390625, 0.0002155303955078125, -0.006134033203125, 0.0019989013671875, 0.004...

[ 51, 19729, 7844, 3098, 20625, 142508, 96, 47754, 1556, 18226, 2071, 2685, 10, 39210, 9351, 50986, 100, 7, 5062, 36746, 450, 14602, 959, 40407, 57266, 111, 20949, 1810, 2367, 3884, 23, 1884, 5303, 5267, 449, 927, 1984, 11, 360, 18, 14090...

[ 0.0594482421875, 0.139892578125, 0.10430908203125, 0.1982421875, 0.13330078125, 0.2322998046875, 0.10107421875, 0.091796875, 0.116455078125, 0.2119140625, 0.0200653076171875, 0.0240020751953125, 0.00933837890625, 0.124755859375, 0.0819091796875, 0.146240234375, 0.00885009765625, 0....

embed

23690444_c0

23690444

haskell

0

Title: After installing a new GHC version, why does ghc --version still shows the old version? Problem title: After installing a new GHC version, why does ghc --version still shows the old version? Tags: ghc, haskell Problem: After installing a new GHC version, why does ghc --version still shows the old version? I've f...

After installing a new GHC version, why does ghc --version still shows the old version? After installing a new GHC version, why does ghc --version still shows the old version? ghc haskell After GHC After installing a new GHC version, why does ghc --version still shows the old version? I've finally installed ghc 7.8.2, ...

[ 0.00396728515625, 0.01251220703125, 0.03662109375, 0.017578125, 0.00225830078125, 0.01104736328125, -0.02490234375, 0.005340576171875, 0.0013275146484375, 0.042724609375, -0.0216064453125, -0.03955078125, -0.00811767578125, 0.0027923583984375, 0.006866455078125, 0.00787353515625, 0.0...

[ 24372, 20600, 3525, 527, 73265, 11389, 15400, 31380, 238, 4210, 46354, 7464, 45831, 10332, 1556, 142508, 14602, 77681, 2861, 128423, 1284, 10644, 124090, 17378, 200768, 903, 3444, 176683 ]

[ 0.04840087890625, 0.119384765625, 0.054351806640625, 0.08837890625, 0.2095947265625, 0.14501953125, 0.0843505859375, 0.1424560546875, 0.1375732421875, 0.1304931640625, 0.148681640625, 0.0908203125, 0.1036376953125, 0.109375, 0.104736328125, 0.2001953125, 0.000244140625, 0.023300170...

embed

73145463_c0

73145463

haskell

0

Title: How to write functor instance in haskell with data constructors Problem title: How to write functor instance in haskell with data constructors Tags: haskell, functor Problem: How to write functor instance in haskell with data constructors We are given type ID = Int data LST a = Leaf ID a | Node ID [LST a] derivi...

How to write functor instance in haskell with data constructors How to write functor instance in haskell with data constructors haskell functor How LST Leaf Node Show Functor How to write functor instance in haskell with data constructors We are given How may I write a functor instance for LST, such that

[ 0.003082275390625, -0.01287841796875, -0.0142822265625, -0.0101318359375, 0.026611328125, 0.0022430419921875, -0.0048828125, -0.0164794921875, 0.01422119140625, -0.025634765625, -0.01708984375, -0.0106201171875, -0.00103759765625, 0.0086669921875, -0.005615234375, 0.00168609619140625, ...

[ 11249, 33022, 7477, 18770, 110527, 1556, 142508, 678, 2053, 64549, 25251, 47, 339, 8545, 636, 2407, 438, 112, 17367, 28670, 34475, 1543, 100 ]

[ 0.036346435546875, 0.18701171875, 0.1798095703125, 0.203125, 0.259521484375, 0.1492919921875, 0.221435546875, 0.10247802734375, 0.086669921875, 0.150390625, 0.08929443359375, 0.0308685302734375, 0.08062744140625, 0.1796875, 0.08099365234375, 0.159423828125, 0.12188720703125, 0.1167...

embed

43424777_c0

43424777

haskell

0

Title: Adding two complex numbers in Haskell Problem title: Adding two complex numbers in Haskell Tags: haskell Problem: Adding two complex numbers in Haskell I made the adding of two complex numbers in Haskell like this: data Complex = C { realC :: Double , imgC :: Double } deriving Show addC :: Complex -> Complex -> ...

Adding two complex numbers in Haskell Adding two complex numbers in Haskell haskell Adding Haskell Complex Double Show Adding two complex numbers in Haskell I made the adding of two complex numbers in Haskell like this: My question is: Can i make the above function (addC) point-free?

[ 0.001220703125, 0.01068115234375, 0.0125732421875, 0.0284423828125, 0.0244140625, -0.0019989013671875, 0.004058837890625, -0.0128173828125, -0.001922607421875, -0.025146484375, 0.0036163330078125, -0.0029296875, -0.007354736328125, 0.0196533203125, -0.0177001953125, -0.00811767578125, ...

[ 62, 59725, 6626, 27140, 101935, 20625, 142508, 1556, 113197, 107172, 17367, 154107, 111, 1884, 903, 4171, 3249, 36917, 32354, 11, 4028, 441, 6275, 9, 32087 ]

[ 0.07684326171875, 0.07440185546875, 0.131103515625, 0.228759765625, 0.1441650390625, 0.1473388671875, 0.2322998046875, 0.133056640625, 0.21484375, 0.1287841796875, 0.16064453125, 0.148681640625, 0.031707763671875, 0.034423828125, 0.0109710693359375, 0.06243896484375, 0.03912353515625...

embed

60715148_c2

60715148

haskell

2

(1 / 2)) ||| Full) | 21 | else onWorkspace "web" (avoidStruts $ Mirror (multiCol [1] 1 0.02 (-0.5)) ||| Full) $ | Code signals: XMonad, XMonad.Config.Desktop, XMonad.Hooks.ManageDocks, XMonad.Layout.LayoutModifier, XMonad.Layout.MultiColumns, XMonad.Layout.PerWorkspace, XMonad.Layout.ThreeColumns, Data.Maybe, System.E...

[ -0.006683349609375, 0.0201416015625, -0.004913330078125, 0.005340576171875, 0.00124359130859375, 0.0174560546875, 0.0079345703125, -0.037841796875, 0.01519775390625, 0.01190185546875, 0.0174560546875, 0.01251220703125, 0.01068115234375, -0.001617431640625, -0.01104736328125, -0.0084228...

[ 2858, 248, 4958, 16, 58745, 9312, 6, 952, 37076, 98, 108259, 65421, 14051, 14426, 532, 71713, 49534, 3650, 150481, 144227, 78457, 17550, 106, 89678, 304, 15, 9, 93645, 28864, 26073, 7, 12, 1193, 46674, 712, 4, 5, 83671, 4657, 1042, 1378...

[ 0.103515625, 0.0865478515625, 0.1475830078125, 0.05462646484375, 0.06085205078125, 0.26025390625, 0.02691650390625, 0.21923828125, 0.1260986328125, 0.1842041015625, 0.1754150390625, 0.2763671875, 0.190185546875, 0.17431640625, 0.1346435546875, 0.1612548828125, 0.163330078125, 0.072...

embed

13485374_c0

13485374

haskell

0

Title: Railroad diagrams for Haskell? Problem title: Railroad diagrams for Haskell? Tags: grammar, haskell Problem: Railroad diagrams for Haskell? Anyone knows a book or a web-site that would feature a simple set of railroad diagrams for Haskell grammar? Something like this but in English: http://www.cs.uu.nl/wiki/pub/...

Railroad diagrams for Haskell? Railroad diagrams for Haskell? grammar haskell Railroad Haskell Railroad diagrams for Haskell? Anyone knows a book or a web-site that would feature a simple set of railroad diagrams for Haskell grammar? Something like this but in English: http://www.cs.uu.nl/wiki/pub/FP/CourseLiterature/h...

[ 0.009033203125, 0.0230712890625, -0.00982666015625, 0.00323486328125, -0.0072021484375, 0.018798828125, -0.01611328125, 0.0179443359375, -0.01483154296875, -0.0169677734375, 0.0169677734375, -0.03515625, -0.0047607421875, 0.0050048828125, -0.001068115234375, -0.01904296875, 0.0030975...

[ 85736, 52562, 117233, 7, 100, 20625, 142508, 122092, 147, 1556, 3630, 93002, 12877, 1467, 11090, 60213, 8781, 5423, 68823, 1884, 14941, 4439, 17349, 13169, 13691, 111596, 51006, 10557, 12654, 86531, 24931, 15483, 8859, 33209, 22799, 2565, 3688,...

[ 0.114013671875, 0.1468505859375, 0.2127685546875, 0.0794677734375, 0.0772705078125, 0.143798828125, 0.253173828125, 0.1312255859375, 0.095947265625, 0.1162109375, 0.009063720703125, 0.046630859375, 0.0902099609375, 0.0291900634765625, 0.03643798828125, 0.0220489501953125, 0.110717773...

embed

23957026_c0

23957026

haskell

0

Title: Haskell understanding some functions Problem title: Haskell understanding some functions Tags: haskell, stream Problem: Haskell understanding some functions Can someone please explain why the first function generates the stream "a" , "aa" , "aaa" .. ? Or why the second generates a stream of prefixes for example:...

Haskell understanding some functions Haskell understanding some functions haskell stream Haskell Haskell understanding some functions Can someone please explain why the first function generates the stream "a" , "aa" , "aaa" .. ? Or why the second generates a stream of prefixes for example: prefixes [1,2,3..] -> [[],[1]...

[ 0.0106201171875, 0.00360107421875, -0.007354736328125, -0.00250244140625, 0.0037078857421875, -0.00555419921875, 0.0150146484375, -0.02099609375, 0.01483154296875, -0.00555419921875, 0.01531982421875, -0.036865234375, 0.026123046875, 0.0162353515625, 0.005584716796875, -0.0046081542968...

[ 20625, 142508, 100094, 3060, 32354, 7, 1556, 75973, 4171, 22008, 22936, 73342, 15400, 5117, 139392, 44, 11, 4, 84022, 1468, 3347, 70, 17932, 10, 111, 183114, 90, 27781, 68252, 155761, 5, 33079, 110558, 25256, 133063 ]

[ 0.152099609375, 0.2393798828125, 0.1832275390625, 0.0826416015625, 0.2178955078125, 0.0823974609375, 0.1519775390625, 0.268310546875, 0.037139892578125, 0.01556396484375, 0.050445556640625, 0.161865234375, 0.1666259765625, 0.1192626953125, 0.20654296875, 0.00384521484375, 0.127075195...

embed

49741312_c0

49741312

haskell

0

Title: What does the :~> operator do in haskell Problem title: What does the :~> operator do in haskell Tags: types, functional-programming, haskell, servant Problem: What does the :~> operator do in haskell I was looking through a github project that seems to be a website using haskell and elm. It uses the opera...

What does the :~> operator do in haskell What does the :~> operator do in haskell types functional-programming haskell servant What What does the :~> operator do in haskell I was looking through a github project that seems to be a website using haskell and elm. It uses the operator :~> in a type signature in this...

[ 0.01239013671875, -0.004852294921875, 0.01397705078125, 0.0012664794921875, -0.0155029296875, 0.00970458984375, -0.004913330078125, 0.0133056640625, -0.01226806640625, 0.004486083984375, 0.01092529296875, -0.037109375, 0.008056640625, 0.00372314453125, -0.01458740234375, -0.009765625, ...

[ 4865, 14602, 70, 152, 2306, 1230, 5386, 74, 39933, 54, 23, 1556, 142508, 52895, 123309, 28966, 187646, 2740, 62270, 32102, 13452, 4165, 17368, 88, 39, 4527, 10644, 138256, 11435, 80934, 903, 442, 44084, 35839 ]

[ 0.067138671875, 0.0618896484375, 0.0372314453125, 0.092529296875, 0.1654052734375, 0.1058349609375, 0.1832275390625, 0.0194244384765625, 0.2406005859375, 0.116455078125, 0.07427978515625, 0.1375732421875, 0.237060546875, 0.1453857421875, 0.1298828125, 0.07025146484375, 0.187133789062...

embed

50808477_c1

50808477

haskell

1

to include everything relevant, but the full Foundation.hs is at https://gist.github.com/hyperpape/39d4d2baf67d3bdbdba45a943e7e0425 Code signals: the, YesodAuthEmail, HandlerFor, site0, App, Yesod-Postgres, YesodAuth, AuthId, UserId, AuthPlugin, Claimed, AuthEmailId, HomeR, User, Nothing, Foundation.hs:273:11, Could, ...

[ -0.003936767578125, 0.025146484375, 0.0016021728515625, -0.0244140625, -0.001800537109375, 0.007476806640625, -0.016357421875, -0.041748046875, 0.0098876953125, -0.03173828125, 0.00531005859375, 0.0147705078125, -0.0177001953125, 0.0196533203125, -0.020263671875, -0.00433349609375, -...

[ 47, 26698, 26818, 29191, 4, 1284, 4393, 32807, 5, 127, 7, 83, 99, 735, 271, 15769, 32102, 3038, 1264, 60895, 13, 2588, 28864, 26073, 12, 70, 32635, 2199, 67362, 927, 161994, 10639, 603, 18537, 1764, 2389, 5659, 49411, 17562, 5655, 568, ...

[ 0.00811767578125, 0.145263671875, 0.0794677734375, 0.1707763671875, 0.04217529296875, 0.0052490234375, 0.07855224609375, 0.267578125, 0.0804443359375, 0.1490478515625, 0.125732421875, 0.01177978515625, 0.0064697265625, 0.0187530517578125, 0.004669189453125, 0.096435546875, 0.11901855...

embed

51236170_c0

51236170

haskell

0

Title: Are List Int and List String the same category in Haskell/Category theory? Problem title: Are List Int and List String the same category in Haskell/Category theory? Tags: category-theory, haskell Problem: Are List Int and List String the same category in Haskell/Category theory? Are List Int and List String the ...

Are List Int and List String the same category in Haskell/Category theory? Are List Int and List String the same category in Haskell/Category theory? category-theory haskell List Haskell Category Are List Int and List String the same category in Haskell/Category theory? Are List Int and List String the same category in...

[ 0.0023651123046875, 0.00860595703125, -0.00689697265625, 0.01171875, -0.009765625, 0.007080078125, 0.00897216796875, -0.0224609375, 0.0118408203125, 0.019775390625, -0.029541015625, -0.03857421875, 0.000797271728515625, 0.017578125, -0.03662109375, 0.004058837890625, 0.0142822265625,...

[ 15901, 32036, 360, 18, 136, 23351, 214, 70, 5701, 95487, 20625, 142508, 76775, 3081, 154453, 2347, 1556, 49057, 149766, 621, 1836, 90698 ]

[ 0.04412841796875, 0.204833984375, 0.151611328125, 0.16748046875, 0.08013916015625, 0.2257080078125, 0.127685546875, 0.0147705078125, 0.1109619140625, 0.253662109375, 0.1187744140625, 0.2152099609375, 0.0638427734375, 0.16064453125, 0.1201171875, 0.00634765625, 0.0682373046875, 0.19...

embed

47881350_c0

47881350

haskell

0

Title: groupByKey in Haskell - How to group items in a list by a function? Problem title: groupByKey in Haskell - How to group items in a list by a function? Tags: haskell Problem: groupByKey in Haskell - How to group items in a list by a function? Given a list [v] and a keying function f :: v -> k , I want to generate...

groupByKey in Haskell - How to group items in a list by a function? groupByKey in Haskell - How to group items in a list by a function? haskell Data.Map Haskell How Map groupByKey in Haskell - How to group items in a list by a function? Given a list [v] and a keying function f :: v -> k , I want to generate a map Map k...

[ 0.0014190673828125, 0.0028533935546875, 0.017822265625, -0.034423828125, -0.000522613525390625, 0.007415771484375, -0.00860595703125, -0.0045166015625, -0.0008087158203125, 0.00836181640625, -0.01092529296875, 0.00946044921875, 0.0242919921875, 0.0301513671875, -0.02490234375, -0.00537...

[ 21115, 75358, 162429, 20625, 142508, 11249, 55769, 23, 5303, 390, 32354, 47, 1556, 11809, 166179, 42719, 77878, 334, 22799, 214, 1238, 1984, 81, 33079, 472, 3444, 139392, 22288, 1884, 32316 ]

[ 0.23046875, 0.1270751953125, 0.233642578125, 0.1248779296875, 0.2222900390625, 0.0699462890625, 0.1624755859375, 0.0809326171875, 0.1817626953125, 0.09002685546875, 0.1678466796875, 0.01800537109375, 0.09423828125, 0.053924560546875, 0.1436767578125, 0.1964111328125, 0.01278686523437...

embed

9095443_c0

9095443

haskell

0

Title: Print String as pattern in Haskell Problem title: Print String as pattern in Haskell Tags: haskell Problem: Print String as pattern in Haskell I am from OO background and very new to Haskell. In order to print a pattern like: 1 2 3 4 5 1 2 3 4 1 2 3 1 2 1 i made a list let xs = ["1 2 3 4 5\n" ,"1 2 3 4\n" ,"1 2 ...

Print String as pattern in Haskell Print String as pattern in Haskell haskell Print Haskell Print String as pattern in Haskell I am from OO background and very new to Haskell. In order to print a pattern like: i made a list But i get the output like How can i get the desired output?

[ 0.0000743865966796875, 0.0191650390625, -0.022705078125, 0.016357421875, -0.0184326171875, 0.01287841796875, -0.0157470703125, -0.0033416748046875, 0.01165771484375, 0.01708984375, 0.003936767578125, -0.048828125, 0.030517578125, 0.01031494140625, -0.0216064453125, 0.00665283203125, ...

[ 39754, 23351, 214, 237, 103510, 23, 20625, 142508, 1556, 1295, 30563, 76615, 4552, 3525, 47, 28412, 1884, 17, 7228, 5303, 4966, 2046, 140992, 11249, 831, 104851 ]

[ 0.207763671875, 0.1983642578125, 0.12841796875, 0.1258544921875, 0.280517578125, 0.03289794921875, 0.12005615234375, 0.2098388671875, 0.10504150390625, 0.038970947265625, 0.097412109375, 0.09716796875, 0.02093505859375, 0.061492919921875, 0.0113983154296875, 0.1900634765625, 0.095947...

embed

10862022_c0

10862022

haskell

0

Title: Are monads just ways of composing functions which would otherwise not compose? Problem title: Are monads just ways of composing functions which would otherwise not compose? Tags: monads, haskell Problem: Are monads just ways of composing functions which would otherwise not compose? The bind function seems remark...

Are monads just ways of composing functions which would otherwise not compose? Are monads just ways of composing functions which would otherwise not compose? monads haskell Are monads just ways of composing functions which would otherwise not compose? The bind function seems remarkably similar like a composition functi...

[ -0.030029296875, 0.010009765625, 0.0152587890625, 0.022216796875, -0.00311279296875, 0.0177001953125, -0.003814697265625, -0.001495361328125, -0.00109100341796875, -0.0302734375, -0.003509521484375, -0.01806640625, 0.00133514404296875, 0.006591796875, 0.0003108978271484375, -0.00759887...

[ 2667, 712, 7, 48322, 9969, 232, 32354, 959, 150350, 1660, 1556, 142508, 2806, 120262, 68557, 37202, 21373, 1884, 166577, 112397, 30646, 23937, 228624, 6528 ]

[ 0.171630859375, 0.259033203125, 0.1461181640625, 0.11474609375, 0.0877685546875, 0.0999755859375, 0.1627197265625, 0.035980224609375, 0.173828125, 0.012725830078125, 0.1192626953125, 0.2344970703125, 0.001434326171875, 0.012847900390625, 0.2469482421875, 0.038665771484375, 0.07092285...

embed

36758737_c0

36758737

haskell

0

Title: Haskell (-1) number issue Problem title: Haskell (-1) number issue Tags: haskell Problem: Haskell (-1) number issue Imagine this: f = (*10) . (+1) It is a simple way to say to add 1 and then multiply by 10. Now check the following: f = (* 10) . (-1) Here -1 is a number, not a function, I would like to know if th...

Haskell (-1) number issue Haskell (-1) number issue haskell Haskell Haskell (-1) number issue Imagine this: It is a simple way to say to add 1 and then multiply by 10. Now check the following: Here -1 is a number, not a function, I would like to know if there is a function available to avoid this or this I know they ar...

[ 0.0025634765625, 0.003204345703125, 0.00537109375, -0.00286865234375, -0.006500244140625, -0.00408935546875, -0.005340576171875, -0.005279541015625, -0.00213623046875, -0.042724609375, -0.0057373046875, 0.0029144287109375, -0.007171630859375, 0.0031280517578125, 0.004974365234375, -0.0...

[ 20625, 142508, 110218, 14012, 31089, 1556, 15, 133196, 8781, 3917, 5154, 15190, 106, 136, 7068, 6024, 62479, 390, 4068, 12765, 70, 11853, 68940, 83, 959, 32354, 1884, 3714, 19882, 71864, 903, 7108, 2806, 3249 ]

[ 0.1507568359375, 0.25634765625, 0.29345703125, 0.2335205078125, 0.1932373046875, 0.1412353515625, 0.011566162109375, 0.09637451171875, 0.0657958984375, 0.0229644775390625, 0.045989990234375, 0.1204833984375, 0.10150146484375, 0.029296875, 0.00970458984375, 0.0733642578125, 0.12841796...

embed

40473096_c0

40473096

haskell

0

Title: Make variable from input accessible from the whole code Problem title: Make variable from input accessible from the whole code Tags: haskell Problem: Make variable from input accessible from the whole code Is this even possible? I have a main that saves an Int (width) given by the user as a variable, but I need ...

Make variable from input accessible from the whole code Make variable from input accessible from the whole code haskell input the Make Make variable from input accessible from the whole code Is this even possible? I have a main that saves an Int (width) given by the user as a variable, but I need that variable in a bun...

[ -0.010009765625, 0.0247802734375, -0.021240234375, 0.00110626220703125, 0.00726318359375, 0.0081787109375, -0.0036773681640625, 0.0079345703125, 0.0048828125, -0.05126953125, -0.00787353515625, -0.0123291015625, 0.0091552734375, 0.029541015625, -0.005096435546875, 0.010498046875, 0.0...

[ 26176, 77336, 1295, 107730, 81522, 70, 28271, 18151, 1556, 142508, 2071, 903, 3853, 7722, 765, 5201, 30098, 360, 18, 146984, 34475, 390, 38937, 237, 1284, 3871, 450, 23, 147306, 3789, 32354, 3917, 54, 154107, 10750, 11907 ]

[ 0.1568603515625, 0.2861328125, 0.161376953125, 0.21875, 0.251220703125, 0.0135498046875, 0.19189453125, 0.1812744140625, 0.1512451171875, 0.2208251953125, 0.00982666015625, 0.082763671875, 0.0501708984375, 0.1602783203125, 0.00115966796875, 0.1033935546875, 0.12841796875, 0.0611267...

embed

33319720_c1

33319720

haskell

1

jyLBDbJPCH01j/Test.HUnit.Lang in ["./.hpc","./dist/hpc/vanilla/mix/myproject-0.1.0","./dist/hpc/vanilla/mix/tests"] What? I've never seen this, although I generated many reports before. Someone up there just decided that I won't get that report today, it seems. Do you know how to generate coverage report using Stack? H...

[ 0.00311279296875, -0.0002346038818359375, 0.00360107421875, 0.0196533203125, -0.02490234375, 0.0004062652587890625, -0.005706787109375, -0.01519775390625, -0.00145721435546875, 0.00677490234375, -0.0205078125, 0.011962890625, -0.008544921875, 0.005126953125, 0.0042724609375, 0.02197265...

[ 1550, 48097, 122063, 16999, 6746, 170, 111337, 27204, 6773, 2729, 449, 127, 57095, 46295, 2187, 2298, 62015, 1176, 95322, 23320, 102107, 6954, 4865, 8306, 51592, 903, 139392, 5941, 117729, 1257, 68872, 23742, 18, 2046, 13416, 18925, 37202, 37...

[ 0.096435546875, 0.0625, 0.02691650390625, 0.08465576171875, 0.045654296875, 0.0845947265625, 0.226318359375, 0.1259765625, 0.2220458984375, 0.08154296875, 0.1920166015625, 0.0276641845703125, 0.13134765625, 0.0672607421875, 0.10455322265625, 0.1939697265625, 0.201904296875, 0.11853...

embed

45033909_c1

45033909

haskell

1

doubleCheck a b | (((first b) `div` (first a)) == ((second b) `div` (second a))) && ((first b) `mod` (first a) == 0) && ((second b) `mod` (second a) == 0) = True | otherwise = False Now with the things I heard and read about Haskell and the power of higher order functions I suppose the solution would be like two lines...

[ -0.0169677734375, 0.0057373046875, -0.0152587890625, 0.004547119140625, 0.005859375, 0.0194091796875, -0.0086669921875, -0.025390625, 0.00604248046875, 0.00506591796875, 0.01275634765625, 0.0130615234375, 0.01239013671875, -0.0054931640625, -0.0166015625, -0.004302978515625, 0.010803...

[ 41929, 202567, 10, 876, 58745, 128258, 13448, 271, 30618, 69112, 191633, 13415, 757, 1230, 6, 87599, 120262, 22225, 184, 49782, 20625, 142508, 14537, 77546, 12989, 32354, 139124, 29806, 2806, 1884, 6626, 124519, 18151, 179933, 903, 5155, 831, ...

[ 0.23876953125, 0.3291015625, 0.095703125, 0.16357421875, 0.014373779296875, 0.010711669921875, 0.0594482421875, 0.031402587890625, 0.238525390625, 0.1497802734375, 0.13818359375, 0.188720703125, 0.15673828125, 0.0162506103515625, 0.04888916015625, 0.159912109375, 0.0843505859375, 0...

embed

6344754_c0

6344754

haskell

0

Title: haskell front letters Problem title: haskell front letters Tags: haskell Problem: haskell front letters So im educating myself for the future firstLetter :: IO String firstLetter = do x <- getChar if (x == ' ') then return (show x) else firstLetter So it would get lines until the first line, that starts with emp...

haskell front letters haskell front letters haskell Liquid Osone LOL haskell front letters So im educating myself for the future So it would get lines until the first line, that starts with empty char how can I do it, so if empty line comes, it returns all head(x) for example:

[ 0.00811767578125, -0.01324462890625, -0.0245361328125, 0.0179443359375, 0.0169677734375, 0.016845703125, 0.0157470703125, 0.00799560546875, -0.0076904296875, -0.0230712890625, -0.004058837890625, 0.0009613037109375, 0.01055908203125, 0.017578125, 0.0030975341796875, -0.0013198852539062...

[ 1556, 142508, 12912, 120820, 170527, 63625, 86, 128859, 566, 155629, 22690, 442, 2806, 2046, 124519, 24189, 5117, 13315, 4034, 201505, 21441, 3642, 831, 54, 32497, 30646, 756, 10336, 425, 27781 ]

[ 0.1484375, 0.2255859375, 0.1884765625, 0.18359375, 0.1656494140625, 0.10986328125, 0.0986328125, 0.1175537109375, 0.004974365234375, 0.05316162109375, 0.05828857421875, 0.040924072265625, 0.039825439453125, 0.0841064453125, 0.194580078125, 0.12744140625, 0.0963134765625, 0.16772460...

embed

58784011_c0

58784011

haskell

0

Title: A function that implies true when a and b have the same value Problem title: A function that implies true when a and b have the same value Tags: haskell Problem: A function that implies true when a and b have the same value I am trying to get true when both a and b are true or both of them are false. Can someone...

A function that implies true when a and b have the same value A function that implies true when a and b have the same value haskell Bool A function that implies true when a and b have the same value I am trying to get true when both a and b are true or both of them are false. Can someone tell me what am I doing wrong?

[ -0.004730224609375, -0.00067138671875, 0.008544921875, 0.0238037109375, 0.0019683837890625, 0.03466796875, -0.00897216796875, -0.0157470703125, -0.00390625, 0.01068115234375, 0.0115966796875, 0.0128173828125, -0.01141357421875, 0.01348876953125, 0.002685546875, -0.010986328125, 0.002...

[ 62, 32354, 450, 35388, 90, 29568, 3229, 10, 136, 876, 765, 70, 5701, 34292, 1556, 142508, 2460, 929, 31577, 47, 2046, 15044, 707, 2856, 621, 98320, 4171, 22008, 14192, 163, 444, 20594, 44691 ]

[ 0.1185302734375, 0.239501953125, 0.0660400390625, 0.258056640625, 0.0892333984375, 0.251953125, 0.12158203125, 0.0953369140625, 0.1334228515625, 0.1571044921875, 0.0982666015625, 0.05780029296875, 0.15625, 0.1976318359375, 0.1480712890625, 0.2208251953125, 0.107666015625, 0.2045898...

embed

58911691_c0

58911691

haskell

0

Title: GHC & Cabal on Raspberry Pi 4 with Debian Buster Problem title: GHC & Cabal on Raspberry Pi 4 with Debian Buster Tags: ghc, cabal, haskell Problem: GHC & Cabal on Raspberry Pi 4 with Debian Buster Is there already a way to install GHC & Cabal on a Raspberry Pi with Debian Buster? https://downloads.haskel...

GHC & Cabal on Raspberry Pi 4 with Debian Buster GHC & Cabal on Raspberry Pi 4 with Debian Buster ghc cabal haskell GHC Cabal Raspberry Debian Buster GHC & Cabal on Raspberry Pi 4 with Debian Buster Is there already a way to install GHC & Cabal on a Raspberry Pi with Debian Buster? https://downloads.haskell.org...

[ 0.00799560546875, 0.007354736328125, 0.0201416015625, -0.00457763671875, -0.010009765625, -0.00909423828125, -0.00701904296875, -0.01202392578125, -0.0098876953125, -0.000942230224609375, 0.0037841796875, -0.0458984375, 0.0074462890625, 0.0081787109375, 0.00494384765625, 0.007446289062...

[ 527, 73265, 619, 25133, 74, 30438, 289, 98, 225291, 3065, 201, 678, 262, 62806, 667, 1515, 31380, 238, 109524, 1556, 142508, 2071, 2685, 21771, 3917, 47, 20600, 61754, 10557, 112, 3871, 11469, 144573, 18151, 3525, 1398, 19639 ]

[ 0.1427001953125, 0.27392578125, 0.169921875, 0.119140625, 0.002838134765625, 0.23486328125, 0.23486328125, 0.08648681640625, 0.1929931640625, 0.2110595703125, 0.202392578125, 0.07421875, 0.1573486328125, 0.177001953125, 0.19873046875, 0.164306640625, 0.1414794921875, 0.100219726562...

embed

64693_c0

64693

haskell

0

Title: Simple haskell string manage Problem title: Simple haskell string manage Tags: string, haskell Problem: Simple haskell string manage Theres is a little problem I want to solve with Haskell: let substitute a function that change all of the wildcards in a string for one concrete parameter. The function has de sign...

Simple haskell string manage Simple haskell string manage string haskell Simple Simple haskell string manage Theres is a little problem I want to solve with Haskell: let substitute a function that change all of the wildcards in a string for one concrete parameter. The function has de signature of:

[ -0.0169677734375, -0.0017547607421875, -0.00830078125, 0.0208740234375, 0.0025787353515625, -0.0009613037109375, 0.00390625, 0.00604248046875, 0.01397705078125, 0.0015716552734375, 0.01513671875, -0.02392578125, 0.006591796875, 0.01104736328125, -0.01318359375, -0.00836181640625, 0.0...

[ 60552, 1556, 142508, 79315, 111240, 10176, 2967, 3444, 86869, 20625, 2633, 161740, 32354, 15549, 756, 111, 56409, 38931, 100, 1632, 122776, 171859, 8, 138256 ]

[ 0.140625, 0.1331787109375, 0.1954345703125, 0.2266845703125, 0.1951904296875, 0.064208984375, 0.09716796875, 0.0276947021484375, 0.076904296875, 0.1077880859375, 0.022979736328125, 0.1754150390625, 0.1708984375, 0.1827392578125, 0.07861328125, 0.0360107421875, 0.1390380859375, 0.23...

embed

21463903_c0

21463903

haskell

0

Title: Haskell: automatically de-sugar syntax Problem title: Haskell: automatically de-sugar syntax Tags: haskell, clojure Problem: Haskell: automatically de-sugar syntax Is there any function in Haskell that, given Haskell syntax input, return an equivalent expression with all syntactical sugar expanded? For example, ...

Haskell: automatically de-sugar syntax Haskell: automatically de-sugar syntax haskell clojure Haskell Haskell: automatically de-sugar syntax Is there any function in Haskell that, given Haskell syntax input, return an equivalent expression with all syntactical sugar expanded? For example, in Clojure, I can pass 'a to t...

[ 0.0206298828125, 0.01495361328125, -0.004486083984375, 0.0022430419921875, -0.00701904296875, 0.023193359375, -0.0089111328125, -0.01324462890625, -0.016845703125, -0.00994873046875, 0.005615234375, -0.00830078125, -0.0283203125, -0.00055694580078125, 0.00634765625, -0.00506591796875, ...

[ 20625, 142508, 191082, 8, 1159, 1970, 6002, 86531, 1556, 20450, 461, 107, 2071, 2685, 2499, 32354, 23, 450, 34475, 107730, 30646, 183234, 125195, 678, 756, 102, 49086, 289, 101087, 71062, 297, 51053, 831, 27875, 242, 11, 47, 155255, 1221, ...

[ 0.1397705078125, 0.254638671875, 0.1510009765625, 0.1798095703125, 0.11669921875, 0.144775390625, 0.1241455078125, 0.1405029296875, 0.11376953125, 0.09515380859375, 0.174072265625, 0.1356201171875, 0.011749267578125, 0.0247344970703125, 0.0511474609375, 0.1951904296875, 0.06860351562...

embed

7631664_c0

7631664

haskell

0

Title: How to define a rotates function Problem title: How to define a rotates function Tags: haskell Problem: How to define a rotates function How to define a rotates function that generates all rotations of the given list? For example: rotates [1,2,3,4] =[[1,2,3,4],[2,3,4,1],[3,4,1,2],[4,1,2,3]] I wrote a shift funct...

How to define a rotates function How to define a rotates function haskell How How to define a rotates function How to define a rotates function that generates all rotations of the given list? For example: rotates [1,2,3,4] =[[1,2,3,4],[2,3,4,1],[3,4,1,2],[4,1,2,3]] I wrote a shift function that can rearrange the order ...

[ -0.006683349609375, 0.02490234375, 0.017333984375, -0.01220703125, -0.01519775390625, -0.01708984375, -0.0308837890625, -0.00616455078125, 0.00067901611328125, -0.0128173828125, 0.00640869140625, -0.0137939453125, -0.0028533935546875, 0.000652313232421875, 0.0033721923828125, 0.0123291...

[ 11249, 61924, 10, 47014, 1636, 32354, 47, 1556, 142508, 450, 139392, 756, 5256, 34475, 5303, 133063, 82449, 304, 617, 96386, 54397, 122925, 831, 456, 147, 94250, 12989, 3642, 6097, 3525, 10298, 4778, 114689, 25842 ]

[ 0.054412841796875, 0.2147216796875, 0.07135009765625, 0.2318115234375, 0.2108154296875, 0.237548828125, 0.03472900390625, 0.141357421875, 0.21044921875, 0.00225830078125, 0.1767578125, 0.1065673828125, 0.1170654296875, 0.0283203125, 0.1556396484375, 0.09051513671875, 0.152099609375, ...

embed

13722203_c0

13722203

haskell

0

Title: Finding out which module a function belongs to Problem title: Finding out which module a function belongs to Tags: haskell, ghci Problem: Finding out which module a function belongs to In ghci (haskell) is there a command which will tell me which module (out of the loaded modules) a function belongs to. e.g. if ...

Finding out which module a function belongs to Finding out which module a function belongs to haskell ghci Finding Prelude Data.List Finding out which module a function belongs to In ghci (haskell) is there a command which will tell me which module (out of the loaded modules) a function belongs to. e.g. if the function...

[ 0.0177001953125, 0.006011962890625, -0.004302978515625, 0.0238037109375, 0.0006866455078125, 0.019775390625, 0.0020294189453125, 0.00069427490234375, -0.00098419189453125, -0.043212890625, -0.0089111328125, -0.044189453125, 0.0145263671875, -0.00848388671875, 0.002960205078125, 0.00976...

[ 26040, 214, 1810, 3129, 88996, 32354, 186, 10617, 7, 47, 10, 1556, 142508, 31380, 318, 1914, 822, 112, 11809, 154663, 10557, 2685, 75101, 1221, 14192, 163, 6056, 72367, 35839, 91616, 2806, 4488, 28960 ]

[ 0.08526611328125, 0.0146484375, 0.08941650390625, 0.1317138671875, 0.272216796875, 0.239501953125, 0.072509765625, 0.180908203125, 0.0694580078125, 0.156982421875, 0.02935791015625, 0.1063232421875, 0.2078857421875, 0.10357666015625, 0.1527099609375, 0.0391845703125, 0.135009765625, ...

embed

36663293_c0

36663293

haskell

0

Title: Should I run a file as a normal file or with stack exec "my_file"? Problem title: Should I run a file as a normal file or with stack exec "my_file"? Tags: haskell-stack, haskell Problem: Should I run a file as a normal file or with stack exec "my_file"? Is there any difference of how to run a...

Should I run a file as a normal file or with stack exec "my_file"? Should I run a file as a normal file or with stack exec "my_file"? haskell-stack haskell Should my_file Should I run a file as a normal file or with stack exec "my_file"? Is there any difference of how to run an exe file generated by...

[ 0.002349853515625, -0.018310546875, 0.004638671875, 0.00958251953125, -0.013427734375, 0.03173828125, -0.0224609375, 0.01214599609375, 0.0108642578125, -0.04736328125, 0.01129150390625, 0.0203857421875, -0.00090789794921875, 0.01953125, 0.01470947265625, 0.007537841796875, -0.0012283...

[ 151117, 87, 11675, 11435, 237, 10, 3638, 707, 678, 177261, 1119, 3240, 1176, 29822, 454, 1556, 142508, 590, 2594, 759, 60212, 3642, 47, 97733, 139392, 390, 4527, 1467, 38415, 10723 ]

[ 0.1240234375, 0.0072021484375, 0.19970703125, 0.1904296875, 0.139404296875, 0.07525634765625, 0.193115234375, 0.0745849609375, 0.0980224609375, 0.2254638671875, 0.1300048828125, 0.2158203125, 0.1654052734375, 0.25048828125, 0.02044677734375, 0.08953857421875, 0.207275390625, 0.1236...

embed

36706339_c0

36706339

haskell

0

Title: How do I get the contents of a URI that uses the `file` protocol in Haskell? Problem title: How do I get the contents of a URI that uses the `file` protocol in Haskell? Tags: haskell Problem: How do I get the contents of a URI that uses the `file` protocol in Haskell? How can I write a function of the type Text ...

How do I get the contents of a URI that uses the `file` protocol in Haskell? How do I get the contents of a URI that uses the `file` protocol in Haskell? haskell How URI Haskell Text Maybe ByteString How do I get the contents of a URI that uses the `file` protocol in Haskell? How can I write a function of the type Text...

[ 0.005126953125, -0.0015411376953125, -0.00457763671875, 0.00927734375, 0.01177978515625, 0, 0.01556396484375, -0.01141357421875, 0.005279541015625, -0.0126953125, 0.006988525390625, -0.01263427734375, -0.0076904296875, 0.00274658203125, 0.005218505859375, -0.002960205078125, -0.01806...

[ 11249, 2046, 70, 10941, 7, 46492, 4527, 29822, 91363, 20625, 142508, 1556, 24129, 83425, 3311, 67, 71713, 33022, 32354, 10644, 17780, 10750, 11435, 3584, 31, 1299 ]

[ 0.039947509765625, 0.116455078125, 0.00213623046875, 0.1834716796875, 0.08892822265625, 0.1962890625, 0.0601806640625, 0.2347412109375, 0.20361328125, 0.1373291015625, 0.2296142578125, 0.1131591796875, 0.150146484375, 0.04437255859375, 0.026458740234375, 0.061492919921875, 0.08728027...

embed

51614573_c0

51614573

haskell

0

Title: How to return a pure value from a impure method Problem title: How to return a pure value from a impure method Tags: monads, haskell, functor Problem: How to return a pure value from a impure method I know it must sound trivial but I was wondering how you can unwrap a value from a functor and return it as pure v...

How to return a pure value from a impure method How to return a pure value from a impure method monads haskell functor a How f::IO How to return a pure value from a impure method I know it must sound trivial but I was wondering how you can unwrap a value from a functor and return it as pure value? I have tried: What sh...

[ -0.01470947265625, 0.0103759765625, -0.0029449462890625, 0.0140380859375, 0.01416015625, 0.01287841796875, -0.01519775390625, -0.01239013671875, 0.0001583099365234375, -0.0277099609375, 0.006805419921875, -0.0203857421875, -0.022216796875, 0.01708984375, 0.00946044921875, -0.0057678222...

[ 11249, 47, 30646, 10, 34166, 34292, 1295, 21980, 3408, 55300, 2667, 712, 7, 1556, 142508, 7477, 18770, 1238, 17780, 3714, 8110, 45730, 149016, 3642, 831, 51, 434, 13631, 136, 442, 237, 765, 37842, 4865, 5608, 3687, 23, 7108, 5609, 18, 4...

[ 0.1085205078125, 0.0975341796875, 0.25634765625, 0.0726318359375, 0.2464599609375, 0.2169189453125, 0.15087890625, 0.162353515625, 0.2415771484375, 0.1927490234375, 0.07891845703125, 0.0958251953125, 0.010223388671875, 0.1390380859375, 0.222412109375, 0.1524658203125, 0.18994140625, ...

embed

52025471_c0

52025471

haskell

0

Title: Passing ghc-options to Stack script interpreter Problem title: Passing ghc-options to Stack script interpreter Tags: haskell-stack, haskell Problem: Passing ghc-options to Stack script interpreter I'm using Stack interpreter feature and having a code like this: #!/usr/bin/env stack -- stack script --resolver lts...

Passing ghc-options to Stack script interpreter Passing ghc-options to Stack script interpreter haskell-stack haskell Passing Stack lts-12.7 Passing ghc-options to Stack script interpreter I'm using Stack interpreter feature and having a code like this: I want to pass the ghc-options option to the stack interpreter to ...

[ -0.00927734375, 0.00946044921875, -0.006439208984375, 0.00136566162109375, -0.0240478515625, -0.0269775390625, -0.0040283203125, 0.007537841796875, -0.01141357421875, -0.032470703125, -0.00701904296875, 0.012939453125, -0.001953125, 0.01202392578125, -0.01226806640625, 0.01226806640625...

[ 28872, 214, 31380, 238, 109585, 7, 47, 6512, 2594, 26499, 29481, 56, 1556, 142508, 590, 933, 9955, 966, 17368, 60213, 18151, 1884, 903, 3444, 27875, 35829, 177261, 442, 2071, 7722 ]

[ 0.09771728515625, 0.002593994140625, 0.152099609375, 0.16064453125, 0.222900390625, 0.044036865234375, 0.0692138671875, 0.1268310546875, 0.116943359375, 0.1478271484375, 0.1783447265625, 0.1182861328125, 0.08697509765625, 0.151611328125, 0.076171875, 0.0518798828125, 0.03933715820312...

embed

20431964_c0

20431964

haskell

0

Title: What is the clojure equivalent for Haskell's <-? Problem title: What is the clojure equivalent for Haskell's <-? Tags: monads, haskell, clojure Problem: What is the clojure equivalent for Haskell's <-? I'm trying to figure out the IO monad and the <- syntax which I often see in Haskell code. I've...

What is the clojure equivalent for Haskell's <-? What is the clojure equivalent for Haskell's <-? monads haskell clojure What Haskell What is the clojure equivalent for Haskell's <-? I'm trying to figure out the IO monad and the <- syntax which I often see in Haskell code. I've seen it used with multipl...

[ -0.0026092529296875, 0.03173828125, 0.0091552734375, 0.025146484375, -0.0033721923828125, -0.0031280517578125, -0.0037841796875, -0.01177978515625, -0.00506591796875, -0.0257568359375, 0.002777099609375, -0.0260009765625, 0.0093994140625, -0.0211181640625, -0.005218505859375, -0.015075...

[ 4865, 20450, 461, 107, 183234, 100, 20625, 142508, 3768, 1277, 9, 83, 70, 7, 2667, 712, 1556, 4426, 26366, 17780, 136, 6002, 86531, 27983, 1957, 18151, 272, 51592, 11814, 48716, 2053, 50986, 10298, 41018, 40140, 18929, 35978 ]

[ 0.08135986328125, 0.160888671875, 0.1895751953125, 0.131103515625, 0.211181640625, 0.04022216796875, 0.12060546875, 0.261962890625, 0.05517578125, 0.013397216796875, 0.1761474609375, 0.03387451171875, 0.035614013671875, 0.0809326171875, 0.1231689453125, 0.1810302734375, 0.10070800781...

embed

71323911_c1

71323911

haskell

1

1\"], ... ]],\"bids\":[[\"0.06744491\",\"1.35\"],[\"0.06726258\",\"0.148585363\"], ...]],\"market_id\":\"ETH-BTC\"}}" The "asks" key looks clearly present to me -- it's the first one nested under the "order_book" key. Code signals: Data.Aeson, Data.ByteString.Lazy, Data.Either, Network.HTTP.Request, Aeson, order_book, ...

[ 0.0074462890625, 0.0037078857421875, -0.0033111572265625, -0.01263427734375, 0.015625, 0.031982421875, -0.011474609375, -0.01129150390625, 0.00787353515625, 0.005767822265625, 0.0245361328125, -0.01080322265625, 0.0031890869140625, 0.0018768310546875, -0.000598907470703125, -0.00372314...

[ 106, 41872, 86245, 34833, 7, 99929, 18197, 88471, 12183, 81046, 758, 198493, 10057, 102014, 114999, 127968, 55637, 532, 12, 187000, 9, 571, 20499, 47391, 162, 1224, 22799, 33342, 123019, 13379, 47, 163, 70, 5117, 8512, 71, 1379, 80596, 1413...

[ 0.06329345703125, 0.01263427734375, 0.035247802734375, 0.2017822265625, 0.1226806640625, 0.03955078125, 0.0919189453125, 0.1256103515625, 0.1107177734375, 0.0401611328125, 0.0855712890625, 0.078125, 0.059814453125, 0.027191162109375, 0.042236328125, 0.058319091796875, 0.099853515625,...

embed

8572196_c0

8572196

haskell

0

Title: Directory contents in Haskell Problem title: Directory contents in Haskell Tags: haskell, filepath Problem: Directory contents in Haskell Is there a way of returning a list of files in a directory with their absolute paths. When I do getDirectoryContents dir it gives me a list of filenames in the directory. If I...

Directory contents in Haskell Directory contents in Haskell haskell filepath Directory Haskell Directory contents in Haskell Is there a way of returning a list of files in a directory with their absolute paths. When I do it gives me a list of filenames in the directory. If I am using these filenames at another place, I...

[ 0.0159912109375, -0.0126953125, 0.00037384033203125, 0.01141357421875, -0.01019287109375, 0.01806640625, 0.0022735595703125, 0.007537841796875, -0.007720947265625, -0.02880859375, -0.0191650390625, 0.007049560546875, -0.0238037109375, 0.0211181640625, -0.00482177734375, 0.0068969726562...

[ 31068, 53, 10941, 7, 23, 20625, 142508, 1556, 11435, 128405, 2071, 2685, 10, 3917, 30646, 214, 5303, 102158, 14364, 678, 89931, 60875, 76199, 163, 11627, 17368, 3687, 3871, 3714, 35845, 43581, 20697 ]

[ 0.1260986328125, 0.07940673828125, 0.1678466796875, 0.01849365234375, 0.04217529296875, 0.129150390625, 0.2110595703125, 0.1229248046875, 0.1046142578125, 0.18896484375, 0.002410888671875, 0.0186004638671875, 0.0230865478515625, 0.081298828125, 0.1485595703125, 0.05615234375, 0.12451...

embed

9300773_c0

9300773

haskell

0

Title: Drawing lines with opengl in Haskell Problem title: Drawing lines with opengl in Haskell Tags: opengl, haskell Problem: Drawing lines with opengl in Haskell I'm trying to create a go board using opengl. To do this, I'm trying to draw a bunch of lines to create the grid. However, every tutorial site (including op...

Drawing lines with opengl in Haskell Drawing lines with opengl in Haskell opengl haskell Drawing Haskell Drawing lines with opengl in Haskell I'm trying to create a go board using opengl. To do this, I'm trying to draw a bunch of lines to create the grid. However, every tutorial site (including opengl's) has the exampl...

[ -0.01220703125, 0.002960205078125, 0.009033203125, -0.01312255859375, 0.004058837890625, 0.004119873046875, 0.015869140625, -0.0081787109375, -0.0184326171875, -0.0230712890625, -0.015869140625, -0.0390625, 0.0147705078125, -0.000774383544921875, -0.01458740234375, 0.0079345703125, 0...

[ 18186, 14775, 124519, 678, 9803, 11016, 23, 20625, 142508, 1556, 31577, 28282, 738, 45443, 17368, 79442, 147306, 120067, 11907, 57143, 1764, 27781, 313, 37223, 34356, 4127, 12447, 73342, 3525, 1884 ]

[ 0.141357421875, 0.07318115234375, 0.1962890625, 0.1019287109375, 0.1798095703125, 0.2244873046875, 0.0771484375, 0.14892578125, 0.2193603515625, 0.126953125, 0.052886962890625, 0.06658935546875, 0.1070556640625, 0.166015625, 0.045135498046875, 0.13623046875, 0.0706787109375, 0.2203...

embed

58271177_c0

58271177

haskell

0

Title: Adding a list of points together Problem title: Adding a list of points together Tags: haskell, list Problem: Adding a list of points together How do I add all of the x coordinates together in a list of points type Pt ? Example: [Pt 1 2, Pt 3 4] => 1 + 3 => 4 Here is the data-type and function declaration that I...

Adding a list of points together Adding a list of points together haskell list Adding Point Double Adding a list of points together How do I add all of the x coordinates together in a list of points type Pt ? Example: Here is the data-type and function declaration that I am using: This is what I have tried.

[ -0.000766754150390625, 0.007080078125, 0.0031890869140625, -0.0004787445068359375, -0.0081787109375, 0.0179443359375, -0.0003376007080078125, -0.005096435546875, 0.00408935546875, -0.01446533203125, 0.01226806640625, -0.0284423828125, 0.011962890625, 0.0004444122314453125, -0.01458740234...

[ 62, 59725, 5303, 111, 26847, 25842, 10, 1556, 142508, 41097, 107172, 11249, 54, 87, 15190, 756, 70, 1022, 176866, 90, 23, 10644, 436, 18, 89536, 11853, 2053, 50986, 136, 32354, 21635, 17368, 3293, 765, 37842 ]

[ 0.1270751953125, 0.1390380859375, 0.2069091796875, 0.0811767578125, 0.224853515625, 0.2447509765625, 0.03125, 0.1197509765625, 0.1983642578125, 0.2000732421875, 0.148681640625, 0.001800537109375, 0.036285400390625, 0.015289306640625, 0.1978759765625, 0.1220703125, 0.0225372314453125,...

embed

50758816_c0

50758816

haskell

0

Title: Duplicate elements of a list on even index Problem title: Duplicate elements of a list on even index Tags: functional-programming, haskell Problem: Duplicate elements of a list on even index In Haskell, how do I implement a function dup that duplicates all elements that are on even positions (0,2,4...) in a list...

Duplicate elements of a list on even index Duplicate elements of a list on even index functional-programming haskell Duplicate x:xs Duplicate elements of a list on even index In Haskell, how do I implement a function dup that duplicates all elements that are on even positions (0,2,4...) in a list Example of call:

[ -0.00860595703125, 0.03173828125, 0.0079345703125, -0.0223388671875, -0.006439208984375, 0.03271484375, -0.000036716461181640625, 0.003875732421875, 0.0186767578125, -0.0218505859375, -0.0002536773681640625, -0.0159912109375, 0.0087890625, 0.021484375, 0, 0.021728515625, 0.0124511718...

[ 786, 52721, 67, 80854, 5303, 98, 3853, 63262, 123309, 28966, 1556, 142508, 1022, 12, 425, 7, 360, 20625, 3642, 54, 87, 29479, 32354, 115, 254, 450, 171763, 1636, 756, 621, 19069, 22085, 304, 617, 12399, 23, 89536, 11782 ]

[ 0.17822265625, 0.265625, 0.169677734375, 0.2188720703125, 0.2005615234375, 0.1280517578125, 0.2242431640625, 0.2098388671875, 0.163818359375, 0.0926513671875, 0.157470703125, 0.260986328125, 0.060455322265625, 0.07623291015625, 0.1014404296875, 0.00970458984375, 0.0188751220703125, ...

embed

6630951_c0

6630951

haskell

0

Title: remove Repeat values from a list in haskell Problem title: remove Repeat values from a list in haskell Tags: haskell Problem: remove Repeat values from a list in haskell I need to accomplish a few tasks in Haskell: Find the maximum of a list, along with the number of times it occurs: maxCount [2,4,7,2,3] --> [7,...

remove Repeat values from a list in haskell remove Repeat values from a list in haskell haskell a Repeat remove Repeat values from a list in haskell I need to accomplish a few tasks in Haskell: Find the maximum of a list, along with the number of times it occurs: Remove repeated values from a list Delete all instances ...

[ 0.005828857421875, 0.01611328125, -0.005859375, 0.003753662109375, 0.00135040283203125, -0.00421142578125, 0.0096435546875, -0.00958251953125, 0.0205078125, -0.019287109375, -0.025390625, -0.007232666015625, 0.0257568359375, 0.023681640625, -0.00677490234375, 0.0067138671875, 0.00561...

[ 87388, 33742, 13, 257, 142424, 1295, 5303, 1556, 142508, 23, 3871, 163846, 10846, 66211, 20625, 26040, 38132, 14012, 20028, 74918, 181139, 119140, 297, 262, 46485, 756, 110527, 12830 ]

[ 0.1812744140625, 0.20263671875, 0.2188720703125, 0.1590576171875, 0.230712890625, 0.124267578125, 0.2015380859375, 0.155029296875, 0.21484375, 0.072998046875, 0.06988525390625, 0.087158203125, 0.0293426513671875, 0.1217041015625, 0.15087890625, 0.07318115234375, 0.1929931640625, 0....

embed

5769990_c0

5769990

haskell

0

Title: possible to make some output in do notation and then return a String in haskell? Problem title: possible to make some output in do notation and then return a String in haskell? Tags: monads, io, haskell Problem: possible to make some output in do notation and then return a String in haskell? is it possible in ha...

possible to make some output in do notation and then return a String in haskell? possible to make some output in do notation and then return a String in haskell? monads io haskell possible to make some output in do notation and then return a String in haskell? is it possible in haskell, to make some operations live out...

[ -0.01043701171875, -0.0026397705078125, -0.0103759765625, 0.00225830078125, 0.01495361328125, 0.01019287109375, 0.0054931640625, -0.007171630859375, 0.01031494140625, 0.00494384765625, 0.01434326171875, -0.0242919921875, 0.003082275390625, -0.01092529296875, 0.006683349609375, 0.012084...

[ 7722, 3249, 140992, 23, 54, 110, 22062, 30646, 23351, 214, 1556, 142508, 3060, 7068, 2667, 712, 22995, 47, 83, 442, 41018, 6867, 79315, 32354, 1884 ]

[ 0.1552734375, 0.0697021484375, 0.2183837890625, 0.04937744140625, 0.18212890625, 0.13134765625, 0.1239013671875, 0.1844482421875, 0.1434326171875, 0.073486328125, 0.1239013671875, 0.2230224609375, 0.046173095703125, 0.0178680419921875, 0.038787841796875, 0.04412841796875, 0.073974609...

embed

7423123_c0

7423123

haskell

0

Title: How to call the same function 'n' times? Problem title: How to call the same function 'n' times? Tags: haskell Problem: How to call the same function 'n' times? Possible Duplicate: Library function to compose a function with itself n times I need a function to call another function n number o...

How to call the same function 'n' times? How to call the same function 'n' times? haskell How How to call the same function 'n' times? I need a function to call another function n number of times. so it would look something like this f n = g(g(g(g(l)))) where n equals to the number of function g nes...

[ -0.0155029296875, 0.0096435546875, -0.003509521484375, -0.0019989013671875, 0.00189208984375, 0.01422119140625, -0.0014190673828125, -0.008056640625, 0.007537841796875, -0.06884765625, -0.00262451171875, -0.0308837890625, -0.000843048095703125, 0.01806640625, -0.00634765625, -0.0061645...

[ 11249, 47, 11782, 70, 5701, 32354, 3768, 19, 20028, 54764, 1556, 142508, 25, 87, 3871, 15700, 653, 14012, 111, 2806, 6713, 9844, 1884, 903, 1238, 2203, 706, 177, 141, 105950, 8512, 71, 3642, 1672, 45458 ]

[ 0.08941650390625, 0.09735107421875, 0.205078125, 0.00738525390625, 0.158447265625, 0.2176513671875, 0.11181640625, 0.1866455078125, 0.22265625, 0.006561279296875, 0.1351318359375, 0.2008056640625, 0.04425048828125, 0.0089111328125, 0.089599609375, 0.1044921875, 0.120849609375, 0.13...

embed

46442336_c0

46442336

haskell

0

Title: What does k -> * mean? Problem title: What does k -> * mean? Tags: haskell Problem: What does k -> * mean? In the prelude, the type information about ReaderT says: newtype ReaderT r (m :: k -> *) (a :: k) = ReaderT {runReaderT :: r -> m a} What does (m :: k -> *) it mean? m takes an argument of type k , bu...

What does k -> * mean? What does k -> * mean? haskell What ReaderT Prelude What does k -> * mean? In the prelude, the type information about ReaderT says: What does (m :: k -> *) it mean? m takes an argument of type k , but m is a higher kinded type. Information about higher kinded looks also wired:

[ 0.022216796875, -0.008056640625, 0.00274658203125, -0.0125732421875, 0.00848388671875, -0.01019287109375, 0.004974365234375, -0.006256103515625, -0.016845703125, -0.02294921875, 0.0133056640625, -0.033203125, -0.00897216796875, -0.01519775390625, -0.0225830078125, -0.0240478515625, 0...

[ 4865, 14602, 472, 20, 1230, 5386, 74, 661, 29459, 1556, 142508, 122636, 618, 1914, 822, 112, 33079, 479, 10644, 4677, 17378, 39, 1984, 442, 347, 51776, 10750, 1284, 77546, 8562, 297, 32007, 33342, 1439 ]

[ 0.044708251953125, 0.07147216796875, 0.1688232421875, 0.09417724609375, 0.135009765625, 0.1881103515625, 0.08697509765625, 0.1690673828125, 0.13671875, 0.098388671875, 0.1944580078125, 0.2252197265625, 0.177734375, 0.055633544921875, 0.1304931640625, 0.09912109375, 0.1961669921875, ...

embed