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
47742484_c0	47742484	haskell	0	Title: Haskell: Unexpected result on list comprehension evaluation Problem title: Haskell: Unexpected result on list comprehension evaluation Tags: haskell, list-comprehension Problem: Haskell: Unexpected result on list comprehension evaluation I'm just learning some Haskell and while playing with list comprehensions i...	Haskell: Unexpected result on list comprehension evaluation Haskell: Unexpected result on list comprehension evaluation haskell list-comprehension Haskell Unexpected Main Haskell: Unexpected result on list comprehension evaluation I'm just learning some Haskell and while playing with list comprehensions in the repl I c...	[ 0.0031280517578125, 0.0206298828125, -0.007110595703125, 0.0194091796875, 0.006195068359375, 0.00897216796875, 0.0081787109375, 0.01361083984375, 0.0123291015625, -0.00811767578125, -0.01275634765625, -0.0269775390625, 0.017822265625, 0.0125732421875, -0.017333984375, -0.01708984375, ...	[ 20625, 142508, 992, 83613, 13, 89829, 16750, 98, 5303, 46683, 3220, 219836, 1556, 4692, 12321, 52080, 75169, 456, 2424, 831, 18, 28219, 3642, 370, 8705, 91157, 13956, 83, 139392, 25632, 18151, 100094, 140909, 1022, 8306, 167785, 138, 41206, ...	[ 0.1400146484375, 0.2255859375, 0.04168701171875, 0.079833984375, 0.0748291015625, 0.0399169921875, 0.126220703125, 0.03326416015625, 0.19091796875, 0.123046875, 0.115478515625, 0.165283203125, 0.09381103515625, 0.089599609375, 0.0704345703125, 0.017425537109375, 0.0357666015625, 0....	embed
54760825_c0	54760825	haskell	0	Title: Why the pointfree style does not cause a problem? Problem title: Why the pointfree style does not cause a problem? Tags: haskell Problem: Why the pointfree style does not cause a problem? I read about The Monomorphism Restriction from the page https://www.haskell.org/tutorial/pitfalls.html and could not understa...	Why the pointfree style does not cause a problem? Why the pointfree style does not cause a problem? haskell Why Num Why the pointfree style does not cause a problem? I read about The Monomorphism Restriction from the page https://www.haskell.org/tutorial/pitfalls.html and could not understand the last point: Why the la...	[ -0.0225830078125, -0.01361083984375, 0.01409912109375, -0.00095367431640625, 0.0038604736328125, 0.008056640625, -0.0025634765625, -0.00653076171875, 0.0142822265625, -0.0263671875, -0.005706787109375, -0.051025390625, 0.0036773681640625, -0.0159912109375, -0.004608154296875, -0.003372...	[ 44084, 6275, 32087, 20623, 959, 22304, 2967, 14602, 1556, 142508, 52782, 70, 10, 77879, 178851, 8780, 853, 7655, 10763, 10557, 6295, 49269, 28219, 4568, 2499, 18499 ]	[ 0.12939453125, 0.16552734375, 0.26220703125, 0.233154296875, 0.1551513671875, 0.1480712890625, 0.193115234375, 0.058685302734375, 0.1297607421875, 0.219970703125, 0.2017822265625, 0.0204010009765625, 0.023284912109375, 0.1400146484375, 0.1910400390625, 0.0479736328125, 0.013214111328...	embed
64066755_c0	64066755	haskell	0	Title: Pass custom data structures to C via Haskell FFI Problem title: Pass custom data structures to C via Haskell FFI Tags: function, ffi, types, haskell Problem: Pass custom data structures to C via Haskell FFI If I have a C function that looks like this void print_addr(struct sockaddr_rc addr) { // some printing ma...	Pass custom data structures to C via Haskell FFI Pass custom data structures to C via Haskell FFI function ffi types haskell ccall Pass Haskell FFI print_addr sockaddr_rc Storable RFSocketAddress Pass custom data structures to C via Haskell FFI If I have a C function that looks like this If I have defined a similar dat...	[ 0.034912109375, 0.0284423828125, -0.016845703125, 0.00063323974609375, 0.009765625, 0.007598876953125, 0.0067138671875, -0.019287109375, -0.005126953125, -0.0181884765625, 0.02587890625, -0.03515625, -0.00096893310546875, 0.00592041015625, -0.005767822265625, -0.018798828125, -0.0196...	[ 28872, 114122, 2053, 45646, 47, 313, 1829, 20625, 142508, 563, 22724, 32354, 24500, 52895, 1556, 85763, 28412, 712, 7569, 38887, 10870, 19437, 23604, 2886, 100250, 8912, 27853, 161007, 33342, 1884, 903, 61924, 21373, 137656, 36716, 110527, 2017...	[ 0.144775390625, 0.1962890625, 0.1085205078125, 0.2236328125, 0.10296630859375, 0.183837890625, 0.076416015625, 0.138671875, 0.233642578125, 0.0928955078125, 0.2489013671875, 0.200927734375, 0.1728515625, 0.125732421875, 0.1251220703125, 0.168701171875, 0.1278076171875, 0.0071411132...	embed
22900447_c0	22900447	haskell	0	Title: Haskell Trees Mapping Problem title: Haskell Trees Mapping Tags: haskell Problem: Haskell Trees Mapping I've been trying to write a simple mapping function using Haskell, and I came into the following problem: data Tree a = Leaf a \| Node (Tree a) (Tree a) deriving(Show) let g (Leaf l) = Leaf(l+1) let map g (Leaf...	Haskell Trees Mapping Haskell Trees Mapping haskell Haskell Trees Mapping Tree Leaf Node Show Couldn Integer Expected Actual Haskell Trees Mapping I've been trying to write a simple mapping function using Haskell, and I came into the following problem: For g(lf) the output is Leaf 3 as excepted, but for map g lf i'm ge...	[ -0.00384521484375, 0.0213623046875, 0.003082275390625, -0.010986328125, 0.027099609375, 0.014404296875, -0.011474609375, -0.0096435546875, -0.006256103515625, -0.04345703125, -0.0208740234375, -0.02587890625, 0.009033203125, 0.01153564453125, 0.006988525390625, -0.0152587890625, 0.01...	[ 20625, 142508, 4804, 911, 26783, 1556, 101344, 636, 2407, 438, 112, 17367, 191147, 19, 44401, 60075, 13, 89829, 100582, 31577, 33022, 8781, 291, 32354, 17368, 2967, 706, 17463, 140992, 138, 237, 40494, 1284, 22288, 25632, 18499, 3714, 15400, ...	[ 0.13623046875, 0.2283935546875, 0.1927490234375, 0.1817626953125, 0.1243896484375, 0.1170654296875, 0.157958984375, 0.077392578125, 0.1943359375, 0.1160888671875, 0.107666015625, 0.1497802734375, 0.1429443359375, 0.03948974609375, 0.195556640625, 0.1192626953125, 0.1339111328125, 0...	embed
29118115_c0	29118115	haskell	0	Title: How can cabal use multiple cores while building local add-source'd dependency Problem title: How can cabal use multiple cores while building local add-source'd dependency Tags: haskell, cabal Problem: How can cabal use multiple cores while building local add-source'd dependency My project is split thro...	How can cabal use multiple cores while building local add-source'd dependency How can cabal use multiple cores while building local add-source'd dependency haskell cabal How How can cabal use multiple cores while building local add-source'd dependency My project is split through multiple subprojects, which ar...	[ -0.003692626953125, 0.01318359375, 0.0123291015625, 0.006103515625, -0.0233154296875, -0.0181884765625, -0.01092529296875, 0.0093994140625, 0.00640869140625, -0.043701171875, 0.0135498046875, -0.0185546875, 0.00604248046875, 0.0260009765625, 0.0084228515625, -0.006591796875, -0.01043...	[ 11249, 831, 109524, 4527, 48716, 48052, 12960, 33976, 4000, 15190, 60427, 3768, 42548, 27771, 1556, 142508, 13452, 65450, 1614, 95322, 162711, 19096, 11728, 45367, 24931, 20, 170, 54, 20600, 4210, 191, 105254, 117538, 2806, 4734, 11001, 56458, ...	[ 0.08782958984375, 0.076904296875, 0.269775390625, 0.1475830078125, 0.2294921875, 0.248291015625, 0.05523681640625, 0.1441650390625, 0.1318359375, 0.1031494140625, 0.16845703125, 0.03472900390625, 0.1658935546875, 0.07025146484375, 0.122314453125, 0.224365234375, 0.0966796875, 0.121...	embed
6863984_c0	6863984	haskell	0	Title: Stack space overflow when separating functions in different hs files Problem title: Stack space overflow when separating functions in different hs files Tags: haskell Problem: Stack space overflow when separating functions in different hs files I have a huge haskell file which compiles and runs without any probl...	Stack space overflow when separating functions in different hs files Stack space overflow when separating functions in different hs files haskell Stack Main.hs Main Other.hs RunMe Stack space overflow when separating functions in different hs files I have a huge haskell file which compiles and runs without any problem....	[ 0.00750732421875, 0.011474609375, -0.011962890625, -0.0021209716796875, -0.0238037109375, -0.007171630859375, -0.0103759765625, 0.005401611328125, 0.01226806640625, -0.04345703125, -0.01708984375, -0.0164794921875, 0.023193359375, 0.00799560546875, 0.011962890625, 0.004241943359375, ...	[ 6512, 2594, 32628, 645, 118664, 38310, 214, 32354, 12921, 1096, 7, 102158, 1556, 142508, 12321, 127, 64511, 28398, 6696, 23, 58696, 11435, 9969, 1340, 127877, 3444, 3884, 136, 10644, 80934, 84797, 88996, 189534, 24927, 5201, 1528, 18499, 7624...	[ 0.1558837890625, 0.1097412109375, 0.217529296875, 0.097412109375, 0.2237548828125, 0.1939697265625, 0.0382080078125, 0.1766357421875, 0.1270751953125, 0.0965576171875, 0.115234375, 0.1661376953125, 0.09100341796875, 0.1962890625, 0.10223388671875, 0.1171875, 0.07440185546875, 0.107...	embed
63522328_c0	63522328	haskell	0	Title: "One-way" dependencies in shake-build? Problem title: "One-way" dependencies in shake-build? Tags: haskell, shake-build-system Problem: "One-way" dependencies in shake-build? My brain might be fried right now (have been hacking on this Shakefile for 3 days straight), but I just can't figure o...	"One-way" dependencies in shake-build? "One-way" dependencies in shake-build? haskell shake-build-system One-way RST HTML "One-way" dependencies in shake-build? My brain might be fried right now (have been hacking on this Shakefile for 3 days straight), but I just can't figure out how to express a "...	[ -0.000308990478515625, 0.00946044921875, 0.006072998046875, -0.002838134765625, -0.01177978515625, 0.0186767578125, -0.0263671875, 0.0035858154296875, 0.01043701171875, 0.01171875, 0.000698089599609375, 0.004638671875, -0.007720947265625, 0.034912109375, 0.002410888671875, -0.000155448...	[ 62068, 7514, 42548, 117538, 174450, 177149, 1556, 142508, 16751, 6561, 8545, 19097, 9, 78574, 13648, 84285, 256, 68161, 13, 29822, 26366, 36510, 3630, 27771, 23, 33976, 48281, 75281, 102158, 1632, 39210, 59279, 11435, 139392, 5154, 50339, 58837...	[ 0.1668701171875, 0.232421875, 0.2176513671875, 0.1412353515625, 0.2462158203125, 0.227294921875, 0.07952880859375, 0.1455078125, 0.07489013671875, 0.1251220703125, 0.111328125, 0.1776123046875, 0.031158447265625, 0.03656005859375, 0.01910400390625, 0.0350341796875, 0.03240966796875, ...	embed
35899801_c0	35899801	haskell	0	Title: Haskell Multiset Operations Problem title: Haskell Multiset Operations Tags: union, multiset, intersect, haskell Problem: Haskell Multiset Operations I am trying to create functions which can find the union and intersection of two multi sets in Haskell without the use of the Multiset module. I have a good unders...	Haskell Multiset Operations Haskell Multiset Operations union multiset intersect haskell Haskell Multiset Operations x:xs Haskell Multiset Operations I am trying to create functions which can find the union and intersection of two multi sets in Haskell without the use of the Multiset module. I have a good understanding...	[ -0.0021820068359375, 0.01300048828125, 0.036376953125, -0.0218505859375, -0.00396728515625, 0.005828857421875, -0.01055908203125, -0.01409912109375, 0.01904296875, -0.00150299072265625, 0.003021240234375, 0.0233154296875, 0.0277099609375, 0.0028076171875, -0.0038299560546875, 0.0061035...	[ 20625, 142508, 19335, 3509, 102203, 69941, 6024, 1940, 7, 24762, 1556, 1022, 12, 425, 31577, 28282, 32354, 7413, 136, 58994, 6626, 5423, 15490, 4527, 88996, 100094, 62822, 3638, 5303, 48903, 104250, 163, 2060, 31089, 18151, 20653, 20949, 1424...	[ 0.150146484375, 0.2220458984375, 0.18115234375, 0.220947265625, 0.1912841796875, 0.202392578125, 0.1993408203125, 0.171142578125, 0.176025390625, 0.16259765625, 0.13720703125, 0.009765625, 0.0262451171875, 0.0689697265625, 0.033172607421875, 0.060455322265625, 0.147216796875, 0.117...	embed
53001383_c0	53001383	haskell	0	Title: Couldn't match type `a` with `a1` Problem title: Couldn't match type `a` with `a1` Tags: haskell, functor Problem: Couldn't match type `a` with `a1` I am doing the exercise in the Haskell Programming from First Principles, Chapter 16. The question is to ask us to write Functor definition for the dataty...	Couldn't match type `a` with `a1` Couldn't match type `a` with `a1` haskell functor a Couldn LANGUAGE FlexibleInstances Flip Show Functor chapEx2.hs:17:25 chapEx2.hs:17:3-6 Expected Actual Relevant chapEx2.hs:17:19 chapEx2.hs:17:8 chapEx2.hs:17:3 Couldn't match type `a` with `a1` I am doing the exercise in th...	[ 0.006561279296875, 0.0125732421875, 0.01165771484375, 0.0018310546875, -0.00927734375, -0.003875732421875, -0.0123291015625, -0.021240234375, 0.00921630859375, 0.01416015625, -0.01239013671875, -0.00170135498046875, 0.004638671875, 0.01361083984375, -0.010009765625, -0.02490234375, 0...	[ 191147, 3768, 14858, 10644, 11, 678, 418, 1556, 142508, 7477, 18770, 10, 19, 98064, 180842, 2661, 116071, 160808, 17367, 28670, 19279, 13545, 60075, 100582, 133, 30624, 23988, 18, 81979, 20625, 27958, 79680, 6849, 80934, 2053, 50986, 9790, 12...	[ 0.10015869140625, 0.031524658203125, 0.2349853515625, 0.2147216796875, 0.140380859375, 0.09393310546875, 0.07098388671875, 0.110595703125, 0.1954345703125, 0.136962890625, 0.1973876953125, 0.1119384765625, 0.033660888671875, 0.0859375, 0.123046875, 0.0914306640625, 0.08697509765625, ...	embed
28172694_c0	28172694	haskell	0	Title: why does my (alternative to !!) function have this type Problem title: why does my (alternative to !!) function have this type Tags: haskell Problem: why does my (alternative to !!) function have this type Being a little bit frustrated over the error messages some prelude functions (like !!) give, I tried to wri...	why does my (alternative to !!) function have this type why does my (alternative to !!) function have this type haskell Show Integral x:xs b-1 Handydandy Num Char why does my (alternative to !!) function have this type Being a little bit frustrated over the error messages some prelude functions (like !!) give, I tried ...	[ -0.0089111328125, -0.01220703125, 0.0081787109375, 0.007354736328125, -0.00182342529296875, -0.007110595703125, 0.00083160400390625, -0.0203857421875, 0.01171875, 0.005859375, 0.01123046875, -0.017578125, 0.01104736328125, 0.006134033203125, 0.002777099609375, -0.01220703125, 0.00848...	[ 15400, 14602, 759, 119927, 13, 47, 6506, 32354, 765, 903, 10644, 1556, 142508, 17367, 204681, 1022, 425, 7, 876, 5759, 92633, 549, 1459, 52782, 21656, 10176, 4785, 57357, 18499, 89914, 479, 822, 112, 5062, 8337, 37842, 33022, 12921, 11389, ...	[ 0.1636962890625, 0.062744140625, 0.10675048828125, 0.2279052734375, 0.128173828125, 0.196044921875, 0.2362060546875, 0.229248046875, 0.1038818359375, 0.1304931640625, 0.23876953125, 0.1475830078125, 0.246337890625, 0.1826171875, 0.2430419921875, 0.0948486328125, 0.085693359375, 0.0...	embed
21273070_c1	21273070	haskell	1	-v pandock.hs is quite long, I assume the relevant part is: *** Chasing dependencies: Chasing modules from: *pandock.hs pandock.hs:1:8: Could not find module `Text.Pandoc.Readers.MediaWiki' Locations searched: Text/Pandoc/Readers/MediaWiki.hs Text/Pandoc/Readers/MediaWiki.lhs Failed, modules loaded: none. However, bot...	-v pandock.hs is quite long, I assume the relevant part is: *** Chasing dependencies: Chasing modules from: *pandock.hs pandock.hs:1:8: Could not find module `Text.Pandoc.Readers.MediaWiki' Locations searched: Text/Pandoc/Readers/MediaWiki.hs Text/Pandoc/Readers/MediaWiki.lhs Failed, modules loaded: none. However, bot...	[ -0.003814697265625, -0.011474609375, 0.0296630859375, 0.0242919921875, 0.0106201171875, 0.014892578125, -0.0205078125, -0.007415771484375, -0.01171875, -0.015380859375, -0.0126953125, -0.048828125, 0.003692626953125, -0.0189208984375, -0.0084228515625, -0.0089111328125, 0.01220703125...	[ 20, 334, 2652, 138414, 5, 127, 7, 32233, 4989, 41591, 29191, 2831, 4841, 6953, 42548, 117538, 88996, 3180, 19721, 1019, 191147, 959, 7413, 174379, 55956, 29713, 31345, 1314, 72492, 147822, 90788, 33938, 24129, 79366, 190355, 72367, 351, 15044...	[ 0.042510986328125, 0.1998291015625, 0.1607666015625, 0.271484375, 0.013519287109375, 0.1612548828125, 0.1217041015625, 0.0731201171875, 0.1148681640625, 0.06671142578125, 0.08984375, 0.038970947265625, 0.1944580078125, 0.091064453125, 0.1900634765625, 0.0770263671875, 0.2127685546875...	embed
41597013_c3	41597013	haskell	3	, lts-7.15, array-0.5.1.1, base-4.9.0.0, binary-0.8.3.0, bytestring-0.10.8.1, containers-0.5.7.1, deepseq-1.4.2.0, directory-1.2.6.2, filepath-1.4.1.0, ghc-boot-8.0.1, ghc-boot-th-8.0.1, ghc-prim-0.5.0.0, ghci-8.0.1, haskeline-0.7.2.3, hoopl-3.10.2.1, hpc-0.6.0.3, integer-gmp-1.0.0.1, network-2.6.3.1-G4Up1CPKbp7DeFsnyw...	, lts-7.15, array-0.5.1.1, base-4.9.0.0, binary-0.8.3.0, bytestring-0.10.8.1, containers-0.5.7.1, deepseq-1.4.2.0, directory-1.2.6.2, filepath-1.4.1.0, ghc-boot-8.0.1, ghc-boot-th-8.0.1, ghc-prim-0.5.0.0, ghci-8.0.1, haskeline-0.7.2.3, hoopl-3.10.2.1, hpc-0.6.0.3, integer-gmp-1.0.0.1, network-2.6.3.1-G4Up1CPKbp7DeFsnyw...	[ -0.011474609375, -0.0024871826171875, 0.017333984375, 0.01153564453125, -0.023193359375, -0.01470947265625, -0.018798828125, -0.01202392578125, 0.005706787109375, 0.001678466796875, -0.0145263671875, -0.024169921875, 0.007293701171875, -0.002593994140625, 0.009765625, 0.001640319824218...	[ 6, 4, 96, 933, 16709, 5, 1837, 10298, 53, 9, 93645, 83783, 3647, 156982, 99929, 2394, 6635, 132208, 132265, 390, 67, 91693, 23320, 10179, 206730, 116419, 165830, 53894, 184, 864, 91977, 73011, 14364, 48400, 178121, 11435, 128405, 102107, 31...	[ 0.1695556640625, 0.1641845703125, 0.0968017578125, 0.2071533203125, 0.1412353515625, 0.1650390625, 0.23876953125, 0.1729736328125, 0.16650390625, 0.13330078125, 0.1690673828125, 0.1793212890625, 0.2034912109375, 0.1685791015625, 0.216796875, 0.1727294921875, 0.1944580078125, 0.1237...	embed
9401026_c0	9401026	haskell	0	Title: Tree Traversal in Haskell Problem title: Tree Traversal in Haskell Tags: haskell Problem: Tree Traversal in Haskell Here is a peice of code to traverse a tree which is not working: data Tree = Leaf Int \| Node Int Tree Tree deriving Show preorder(Leaf n) = [n] preorder(Node n t0 t1) = [n] ++ (preorder t0) ++ (pre...	Tree Traversal in Haskell Tree Traversal in Haskell haskell Tree Traversal Haskell Leaf Node Show Tree Traversal in Haskell Here is a peice of code to traverse a tree which is not working: I have been asked to execute the following: When I execute the above statement it returns back as it is, when it should return: How...	[ 0.023193359375, -0.000640869140625, 0.007720947265625, -0.000732421875, 0.0274658203125, 0.017333984375, -0.0257568359375, -0.01055908203125, -0.017578125, -0.045166015625, -0.005096435546875, -0.01458740234375, -0.008056640625, -0.01220703125, 0.005126953125, 0.006744384765625, 0.00...	[ 101344, 4937, 814, 2317, 20625, 142508, 1556, 636, 2407, 438, 112, 17367, 280, 2980, 18151, 37317, 13, 53201, 3129, 83, 959, 20697, 37170, 71924, 25632, 36917, 63805, 30646, 4420, 237, 3229, 442, 5608, 30022, 903 ]	[ 0.2442626953125, 0.1219482421875, 0.1884765625, 0.12451171875, 0.1400146484375, 0.2301025390625, 0.120849609375, 0.03167724609375, 0.1160888671875, 0.09185791015625, 0.0858154296875, 0.14306640625, 0.00164794921875, 0.042724609375, 0.1375732421875, 0.2081298828125, 0.1015625, 0.217...	embed
29807762_c0	29807762	haskell	0	Title: Haskell code to exclude numbers for Sieve of Eratosthenes not working as expected Problem title: Haskell code to exclude numbers for Sieve of Eratosthenes not working as expected Tags: haskell, sieve-of-eratosthenes, algorithm Problem: Haskell code to exclude numbers for Sieve of Eratosthenes not working as expe...	Haskell code to exclude numbers for Sieve of Eratosthenes not working as expected Haskell code to exclude numbers for Sieve of Eratosthenes not working as expected haskell sieve-of-eratosthenes algorithm Haskell Sieve Eratosthenes Integral p:ps Haskell code to exclude numbers for Sieve of Eratosthenes not working as ex...	[ -0.015380859375, 0.028564453125, 0.00162506103515625, 0.006072998046875, 0.0015411376953125, -0.0035400390625, 0.003662109375, -0.0076904296875, 0.00445556640625, 0.005859375, 0.011474609375, 0.0078125, 0.0264892578125, 0.00189208984375, 0, 0.00396728515625, 0.0152587890625, 0.0107...	[ 20625, 142508, 18151, 39041, 112, 101935, 727, 272, 111, 14825, 1952, 2347, 1444, 20697, 237, 84751, 959, 1556, 78, 3134, 4390, 13164, 232, 234873, 204681, 915, 12, 6423, 100, 208124, 26265, 20809, 1295, 706, 1861, 28412, 87235, 29954, 7213...	[ 0.1217041015625, 0.2117919921875, 0.1558837890625, 0.167724609375, 0.05364990234375, 0.171630859375, 0.16064453125, 0.1597900390625, 0.1080322265625, 0.1048583984375, 0.135009765625, 0.148681640625, 0.083251953125, 0.140380859375, 0.040191650390625, 0.0877685546875, 0.046173095703125...	embed
33353580_c0	33353580	haskell	0	Title: How to retrieve first false condition applied to a list Problem title: How to retrieve first false condition applied to a list Tags: haskell Problem: How to retrieve first false condition applied to a list I'm writing a program in Haskell that assumes some input from stdin which should be validated according to ...	How to retrieve first false condition applied to a list How to retrieve first false condition applied to a list haskell How E.g How to retrieve first false condition applied to a list I'm writing a program in Haskell that assumes some input from stdin which should be validated according to some parameters. From a bunch...	[ -0.006500244140625, -0.003173828125, 0.003448486328125, 0.0025634765625, -0.0028228759765625, 0.00823974609375, -0.00762939453125, 0.000789642333984375, -0.0091552734375, -0.0036163330078125, 0.002166748046875, -0.0223388671875, 0.0098876953125, 0.006561279296875, -0.0164794921875, 0.0...	[ 11249, 456, 3996, 3134, 5117, 98320, 35431, 190659, 47, 5303, 1556, 142508, 32562, 1528, 20625, 41591, 107730, 6138, 3035, 44622, 171859, 147306, 27289, 275, 30646, 142484, 3642, 62163, 22225, 184, 6528, 59911, 32354, 96, 141956, 876, 69112, ...	[ 0.0318603515625, 0.0843505859375, 0.130859375, 0.1046142578125, 0.166748046875, 0.26513671875, 0.235595703125, 0.1558837890625, 0.0670166015625, 0.203369140625, 0.117919921875, 0.1993408203125, 0.0178680419921875, 0.055267333984375, 0.10015869140625, 0.024993896484375, 0.070861816406...	embed
64032803_c0	64032803	haskell	0	Title: Overlapping instances error with single instance in Haskell Problem title: Overlapping instances error with single instance in Haskell Tags: haskell, ghc Problem: Overlapping instances error with single instance in Haskell I have the following code on Haskell: {-# LANGUAGE MultiParamTypeClasses, FlexibleInstance...	Overlapping instances error with single instance in Haskell Overlapping instances error with single instance in Haskell haskell ghc Data.Proxy a Overlapping Haskell LANGUAGE MultiParamTypeClasses FlexibleInstances ExistentialQuantification ConstraintKinds Maybe Ctx Just Proxy Nothing Matching Defined Main.hs:14:10 Ther...	[ 0.005462646484375, -0.0013427734375, 0.005645751953125, -0.00994873046875, 0.004150390625, 0.01385498046875, -0.006195068359375, -0.01202392578125, 0.01434326171875, -0.031982421875, -0.0224609375, -0.02197265625, 0.01190185546875, 0.0028228759765625, 0.00147247314453125, 0.00454711914...	[ 9578, 143, 26783, 110527, 7, 18499, 678, 11001, 20625, 142508, 1556, 31380, 238, 11809, 10752, 50878, 98064, 19335, 55292, 196707, 140803, 180842, 2661, 116071, 122688, 2816, 425, 1250, 182747, 67407, 5983, 12321, 15110, 8622, 360, 587, 3334, ...	[ 0.153076171875, 0.2303466796875, 0.0943603515625, 0.256103515625, 0.00262451171875, 0.193359375, 0.048980712890625, 0.1998291015625, 0.1318359375, 0.23583984375, 0.1171875, 0.0721435546875, 0.047943115234375, 0.052703857421875, 0.07330322265625, 0.2032470703125, 0.0535888671875, 0....	embed
12039704_c0	12039704	haskell	0	Title: Determine ModuleName of loaded target Problem title: Determine ModuleName of loaded target Tags: haskell, ghc, ghc-api Problem: Determine ModuleName of loaded target I was wondering how do you determine the ModuleName of the file you've just loaded in ghc using the API. If you look at the Documentation of the AP...	Determine ModuleName of loaded target Determine ModuleName of loaded target haskell ghc ghc-api Determine ModuleName HscEnv Determine ModuleName of loaded target I was wondering how do you determine the ModuleName of the file you've just loaded in ghc using the API. If you look at the Documentation of the API they alwa...	[ 0.01324462890625, 0.01055908203125, 0.0147705078125, 0.03515625, -0.01080322265625, 0.0240478515625, -0.0103759765625, -0.00445556640625, -0.0242919921875, -0.0361328125, 0.0072021484375, -0.038818359375, -0.023193359375, -0.0159912109375, 0.005645751953125, -0.00174713134765625, -0....	[ 262, 30524, 63014, 13, 163612, 111, 72367, 297, 30388, 1556, 142508, 31380, 238, 40897, 572, 10382, 7768, 334, 83324, 70, 11435, 272, 1660, 61687, 43101, 3714, 88996, 9351, 8108, 23, 2663, 12096, 42548, 41382, 39580, 4568, 30646, 2811, 527,...	[ 0.0802001953125, 0.1553955078125, 0.21240234375, 0.1226806640625, 0.2376708984375, 0.078857421875, 0.1751708984375, 0.0963134765625, 0.2490234375, 0.0989990234375, 0.1962890625, 0.1260986328125, 0.150146484375, 0.1072998046875, 0.0909423828125, 0.09710693359375, 0.0938720703125, 0....	embed
12540078_c0	12540078	haskell	0	Title: Haskell: Splitting a list into 2 at index k Problem title: Haskell: Splitting a list into 2 at index k Tags: haskell, list, split Problem: Haskell: Splitting a list into 2 at index k I'm pretty new to Haskell, and I'm having a little trouble. I'm trying to implement a function that takes a list, and an int. the ...	Haskell: Splitting a list into 2 at index k Haskell: Splitting a list into 2 at index k haskell list split Haskell Splitting Empty Number Haskell: Splitting a list into 2 at index k I'm pretty new to Haskell, and I'm having a little trouble. I'm trying to implement a function that takes a list, and an int. the int is s...	[ -0.015380859375, 0.0027923583984375, 0.0098876953125, -0.00994873046875, -0.0106201171875, 0.02392578125, -0.01544189453125, -0.0123291015625, 0.01177978515625, 0.01531982421875, 0.0174560546875, -0.021240234375, -0.021240234375, 0.0155029296875, 0.0135498046875, 0.00188446044921875, ...	[ 20625, 142508, 46474, 1916, 5303, 3934, 116, 99, 63262, 472, 1556, 65450, 31678, 939, 103332, 28875, 3525, 47, 10176, 63134, 31577, 29479, 32354, 51776, 10, 23, 18, 134598, 186, 80836, 5117, 70541, 80854, 17932, 21748, 4568, 12830, 831, 206...	[ 0.13330078125, 0.22412109375, 0.212890625, 0.056732177734375, 0.23046875, 0.159423828125, 0.187255859375, 0.101318359375, 0.16552734375, 0.1669921875, 0.1190185546875, 0.2435302734375, 0.161376953125, 0.1099853515625, 0.15478515625, 0.0233612060546875, 0.053985595703125, 0.05374145...	embed
14912007_c0	14912007	haskell	0	Title: Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? Problem title: Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? Tags: haskell, lazy-evaluation Problem: Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? get...	Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? haskell lazy-evaluation Lazy How Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? What I expect to see is that the...	[ -0.004730224609375, 0.0113525390625, 0.010009765625, -0.01708984375, 0.00872802734375, -0.0052490234375, 0.02978515625, -0.002166748046875, 0.0042724609375, -0.01708984375, 0.004669189453125, -0.0283203125, -0.0184326171875, -0.006591796875, -0.00738525390625, 0.01043701171875, 0.021...	[ 239, 3285, 17780, 1556, 142508, 11249, 30646, 21, 5303, 139392, 46389, 159258, 214, 41206, 1957, 107730, 13315, 28, 3089, 12638, 1733, 7103, 87, 24234, 155581, 4966, 33720, 3714, 450, 903, 83, 54241, 40956, 24189, 756, 36917, 51339, 18151, ...	[ 0.1583251953125, 0.199462890625, 0.18701171875, 0.103271484375, 0.23193359375, 0.0183563232421875, 0.207763671875, 0.1361083984375, 0.158447265625, 0.09716796875, 0.1639404296875, 0.1339111328125, 0.011322021484375, 0.096435546875, 0.07000732421875, 0.1693115234375, 0.1446533203125, ...	embed
26329959_c1	26329959	haskell	1	:10: Illegal instance declaration for ‘Parser Char st Char’ The liberal coverage condition fails in class ‘Parser’ for functional dependency: ‘p -> st’ Reason: lhs type ‘Char’ does not determine rhs type ‘st’ In the instance declaration for ‘Parser Char st Char’ cabal: Error: some packages failed to install: geordi-0 f...	:10: Illegal instance declaration for ‘Parser Char st Char’ The liberal coverage condition fails in class ‘Parser’ for functional dependency: ‘p -> st’ Reason: lhs type ‘Char’ does not determine rhs type ‘st’ In the instance declaration for ‘Parser Char st Char’ cabal: Error: some packages failed to install: geordi-0 f...	[ -0.001678466796875, 0.0010833740234375, 0.0087890625, -0.0072021484375, -0.003387451171875, 0.025390625, -0.000751495361328125, -0.035888671875, -0.007720947265625, 0.0030517578125, -0.003936767578125, -0.03076171875, 0.01141357421875, -0.0111083984375, -0.006683349609375, 0.0047607421...	[ 15110, 12, 891, 86966, 110527, 21635, 100, 28636, 2189, 21656, 6138, 26697, 154271, 35431, 35782, 7, 18507, 123309, 42548, 27771, 254, 33079, 236267, 96, 127, 10644, 84068, 14602, 959, 83324, 1690, 271, 109524, 212059, 3060, 98169, 165523, 20...	[ 0.2484130859375, 0.026885986328125, 0.08367919921875, 0.193603515625, 0.2276611328125, 0.184326171875, 0.0216827392578125, 0.168701171875, 0.2138671875, 0.202880859375, 0.1434326171875, 0.25048828125, 0.2259521484375, 0.19091796875, 0.198974609375, 0.0928955078125, 0.16552734375, 0...	embed
26586591_c0	26586591	haskell	0	Title: Haskell: Efficient way to bitwise cast String to Integer? Problem title: Haskell: Efficient way to bitwise cast String to Integer? Tags: haskell Problem: Haskell: Efficient way to bitwise cast String to Integer? What's the most efficient way to cast String (or ByteString ) to an integral type bitwise, for exampl...	Haskell: Efficient way to bitwise cast String to Integer? Haskell: Efficient way to bitwise cast String to Integer? haskell Haskell Efficient Integer ByteString smallEndianStringToInt32 Int32 some_string int32_t Haskell: Efficient way to bitwise cast String to Integer? What's the most efficient way to cast String (or B...	[ -0.0162353515625, 0.00335693359375, -0.005218505859375, 0.021484375, -0.0107421875, 0.025146484375, -0.0245361328125, -0.01446533203125, -0.0031280517578125, -0.0037078857421875, 0.00909423828125, -0.020751953125, 0.0002460479736328125, 0.021484375, -0.00811767578125, -0.014404296875, ...	[ 20625, 142508, 24500, 45964, 3917, 4785, 90825, 37702, 23351, 214, 47, 44401, 241, 1556, 3311, 67, 71713, 19336, 7768, 27201, 7763, 4153, 18, 6460, 360, 3060, 91693, 23, 2684, 93766, 28970, 10644, 313, 831, 42856, 54, 1884, 6183, 27226, 5...	[ 0.1259765625, 0.25390625, 0.1378173828125, 0.1005859375, 0.08544921875, 0.1416015625, 0.2060546875, 0.1732177734375, 0.2105712890625, 0.1126708984375, 0.1192626953125, 0.2198486328125, 0.012481689453125, 0.09185791015625, 0.077392578125, 0.111083984375, 0.194091796875, 0.0941162109...	embed
49007617_c0	49007617	haskell	0	Title: How to remove a duplicated element in a function with a list? Problem title: How to remove a duplicated element in a function with a list? Tags: ghci, element, function, list, haskell Problem: How to remove a duplicated element in a function with a list? I'm a newbie when it comes to Haskell and I'm confused wit...	How to remove a duplicated element in a function with a list? How to remove a duplicated element in a function with a list? ghci element function list haskell How x:xs How to remove a duplicated element in a function with a list? I'm a newbie when it comes to Haskell and I'm confused with a few things. I'm trying to re...	[ -0.0078125, 0.00946044921875, 0.015869140625, -0.01611328125, -0.015625, 0.00421142578125, 0.0140380859375, -0.01092529296875, 0.0283203125, -0.01287841796875, 0.00054931640625, -0.00140380859375, 0.016845703125, -0.009033203125, -0.0025787353515625, -0.0009613037109375, 0.0108032226...	[ 11249, 47, 87388, 10, 171763, 3674, 12830, 23, 32354, 678, 5303, 31380, 318, 1556, 142508, 425, 3525, 9014, 20625, 55681, 10846, 31577, 80854, 903, 81887, 24927, 11809, 154663, 315, 275, 378, 2174, 8096, 62351, 304, 305, 138, 7464, 30646, ...	[ 0.1058349609375, 0.064697265625, 0.204345703125, 0.0272979736328125, 0.26025390625, 0.142333984375, 0.203125, 0.044891357421875, 0.2110595703125, 0.1290283203125, 0.1680908203125, 0.0958251953125, 0.1405029296875, 0.09979248046875, 0.2327880859375, 0.0257415771484375, 0.0075073242187...	embed
56387023_c1	56387023	haskell	1	c w) = [(c, [])] buildCodelist (Fork l r w) = map (addBit zer) (buildCodelist l) ++ map (addBit one) (buildCodelist r) where addBit b = second (b :) stringTree :: String -> HTree stringTree = buildTree . freqList stringCodemap :: Bits a => String -> Codemap a stringCodemap = buildCodemap . stringTree encode :: Bits a ...	c w) = [(c, [])] buildCodelist (Fork l r w) = map (addBit zer) (buildCodelist l) ++ map (addBit one) (buildCodelist r) where addBit b = second (b :) stringTree :: String -> HTree stringTree = buildTree . freqList stringCodemap :: Bits a => String -> Codemap a stringCodemap = buildCodemap . stringTree encode :: Bits a ...	[ 0.01080322265625, 0.0033416748046875, -0.0216064453125, 0.000545501708984375, 0.0003376007080078125, 0.00689697265625, -0.006988525390625, -0.0257568359375, 0.00927734375, -0.0106201171875, -0.0185546875, -0.032470703125, 0.0120849609375, 0.026123046875, -0.013916015625, -0.01867675781...	[ 501, 148, 2203, 238, 268, 45367, 114211, 6562, 18537, 92, 96, 1690, 22288, 11, 4028, 571, 217, 20667, 177149, 37223, 1632, 15190, 876, 17932, 275, 1094, 79315, 62731, 13, 1984, 23351, 33079, 572, 5, 12478, 154663, 62346, 27774, 28864, 22,...	[ 0.0975341796875, 0.18115234375, 0.0787353515625, 0.0927734375, 0.0197906494140625, 0.20654296875, 0.2568359375, 0.273193359375, 0.1802978515625, 0.1004638671875, 0.0706787109375, 0.050445556640625, 0.1812744140625, 0.0172119140625, 0.127197265625, 0.0804443359375, 0.1094970703125, ...	embed
34659580_c0	34659580	haskell	0	Title: With haskell's turtle library, how to extract filename as String from FilePath? Problem title: With haskell's turtle library, how to extract filename as String from FilePath? Tags: haskell, haskell-turtle Problem: With haskell's turtle library, how to extract filename as String from FilePath? When usin...	With haskell's turtle library, how to extract filename as String from FilePath? With haskell's turtle library, how to extract filename as String from FilePath? haskell haskell-turtle FilePath Couldn Turtle.FilePath Expected IHaskellSysIO.FilePath Actual With haskell's turtle library, how to extract filename a...	[ 0.01031494140625, 0.0087890625, -0.0022735595703125, 0.0228271484375, -0.0201416015625, -0.0098876953125, -0.0169677734375, 0.00921630859375, -0.0128173828125, 0.010986328125, 0.00860595703125, -0.027587890625, -0.00445556640625, 0.020751953125, -0.0186767578125, 0.008544921875, 0.00...	[ 17106, 1556, 142508, 3768, 2130, 17991, 35773, 3642, 125663, 11435, 11627, 237, 23351, 214, 1295, 42724, 683, 10519, 1294, 47, 987, 191147, 4252, 174350, 60075, 13, 87, 6495, 65183, 17780, 100582, 5646, 163612, 10644, 18499, 12921, 479, 822, ...	[ 0.037078857421875, 0.08642578125, 0.1888427734375, 0.0654296875, 0.1175537109375, 0.19775390625, 0.1309814453125, 0.0218048095703125, 0.1673583984375, 0.09661865234375, 0.185791015625, 0.0791015625, 0.159912109375, 0.1007080078125, 0.0706787109375, 0.130615234375, 0.126708984375, 0...	embed
53294277_c0	53294277	haskell	0	Title: Re-write 'map intToDigit' with a fold... Problem title: Re-write 'map intToDigit' with a fold... Tags: haskell Problem: Re-write 'map intToDigit' with a fold... So this one seems like it should be super-simple... but I'm not sure where to stick the 'fold' in (obviously you could fold either w...	Re-write 'map intToDigit' with a fold... Re-write 'map intToDigit' with a fold... haskell Re-write Char Data.Char Re-write 'map intToDigit' with a fold... So this one seems like it should be super-simple... but I'm not sure where to stick the 'fold' in (obviously you could fold either way)... It say...	[ -0.0157470703125, 0.00008249282836914062, 0.0135498046875, 0.00830078125, -0.031494140625, 0.0238037109375, -0.0029449462890625, -0.0006866455078125, -0.00127410888671875, -0.004180908203125, -0.014404296875, -0.03759765625, 0.000873565673828125, 0.0556640625, -0.01202392578125, -0.014...	[ 853, 434, 18781, 3768, 62346, 23, 18, 7763, 14055, 15769, 678, 10, 42822, 27, 1556, 142508, 21656, 11809, 84068, 903, 37202, 1884, 5608, 1601, 191560, 9077, 7440, 47593, 70, 5809, 17378, 32354, 71713, 214, 1984, 4153, 33079, 17368, 324, 1...	[ 0.1512451171875, 0.1370849609375, 0.177490234375, 0.09375, 0.2015380859375, 0.1204833984375, 0.150634765625, 0.1981201171875, 0.1260986328125, 0.21240234375, 0.061767578125, 0.009307861328125, 0.2464599609375, 0.0174713134765625, 0.1539306640625, 0.2469482421875, 0.1893310546875, 0...	embed
5335473_c0	5335473	haskell	0	Title: Having trouble with recursion and Type mismatching in Haskell Problem title: Having trouble with recursion and Type mismatching in Haskell Tags: haskell, functional-programming, recursion Problem: Having trouble with recursion and Type mismatching in Haskell -- genrep genrep :: a -> Int -> [a] genrep a n \| n == ...	Having trouble with recursion and Type mismatching in Haskell Having trouble with recursion and Type mismatching in Haskell haskell functional-programming recursion Having Type Haskell n-1 Expression Term Does Having trouble with recursion and Type mismatching in Haskell So I'm trying to make a simple replication funct...	[ -0.0147705078125, 0.01068115234375, -0.006072998046875, 0.0147705078125, -0.007415771484375, 0.01080322265625, -0.00537109375, -0.004302978515625, -0.00225830078125, -0.01409912109375, 0.0106201171875, -0.0164794921875, 0.01251220703125, 0.008544921875, -0.003692626953125, -0.026245117...	[ 171855, 63134, 678, 195625, 1830, 136, 60457, 1239, 98753, 214, 20625, 142508, 1556, 123309, 28966, 653, 5759, 25129, 2994, 101790, 23, 31577, 8781, 456, 182867, 32354, 5646, 189534, 10644, 10, 143126, 20028, 36917, 959, 48903, 4488, 13695, 9...	[ 0.051544189453125, 0.1802978515625, 0.047515869140625, 0.2169189453125, 0.08087158203125, 0.05462646484375, 0.215087890625, 0.13037109375, 0.25732421875, 0.05145263671875, 0.142822265625, 0.237060546875, 0.13037109375, 0.107421875, 0.0384521484375, 0.08770751953125, 0.1248779296875, ...	embed
48102204_c0	48102204	haskell	0	Title: Nice way to write an unsatisfiable constraint? Problem title: Nice way to write an unsatisfiable constraint? Tags: haskell Problem: Nice way to write an unsatisfiable constraint? I've found myself writing this: data T1 data T2 type Unsatisfiable = T1 ~ T2 So I can do something like this: type family NEq t1 t2 ::...	Nice way to write an unsatisfiable constraint? Nice way to write an unsatisfiable constraint? haskell Nice Unsatisfiable NEq Constraint HasProxyT ProxyT Nice way to write an unsatisfiable constraint? I've found myself writing this: So I can do something like this: Then I can use HasProxyT to restrict default methods to...	[ 0.008056640625, 0.004486083984375, -0.007232666015625, -0.0235595703125, 0.0018310546875, -0.0247802734375, -0.01019287109375, -0.0072021484375, 0.0021514892578125, -0.00579833984375, -0.0262451171875, -0.00122833251953125, 0.01312255859375, 0.018798828125, -0.005645751953125, 0.024414...	[ 73398, 3917, 33022, 2234, 50958, 1029, 2886, 158, 2816, 4288, 1556, 142508, 992, 7, 9960, 864, 1657, 20625, 10752, 50878, 618, 1250, 14037, 35978, 32562, 831, 1884, 903, 4527, 173072, 114977, 150624, 959, 40956, 502, 10644, 5701, 61261, 727...	[ 0.1552734375, 0.04833984375, 0.129150390625, 0.0906982421875, 0.17138671875, 0.1583251953125, 0.2288818359375, 0.0927734375, 0.176025390625, 0.1025390625, 0.0885009765625, 0.1705322265625, 0.131591796875, 0.10125732421875, 0.09051513671875, 0.11669921875, 0.0791015625, 0.1370849609...	embed
48153186_c0	48153186	haskell	0	Title: Type Resolution in Haskell: MegaParsec/ Parsing a single space Problem title: Type Resolution in Haskell: MegaParsec/ Parsing a single space Tags: haskell, megaparsec Problem: Type Resolution in Haskell: MegaParsec/ Parsing a single space If I look at the documentation for space it suggests using void spaceChar ...	Type Resolution in Haskell: MegaParsec/ Parsing a single space Type Resolution in Haskell: MegaParsec/ Parsing a single space haskell megaparsec a Type Resolution Haskell MegaParsec Parsing Parser Couldn Token Char Type Resolution in Haskell: MegaParsec/ Parsing a single space If I look at the documentation for space i...	[ -0.011962890625, 0.0030364990234375, 0.011474609375, 0.040283203125, 0.00124359130859375, 0.0006561279296875, -0.00592041015625, -0.019287109375, -0.003936767578125, 0.007354736328125, 0.01287841796875, 0.007598876953125, -0.0194091796875, 0.002593994140625, -0.0172119140625, 0.0094604...	[ 60457, 853, 166589, 20625, 142508, 26842, 28636, 39797, 64, 2392, 6953, 11001, 32628, 23, 12, 1556, 31534, 2500, 2189, 191147, 717, 1098, 21656, 6713, 209806, 42459, 17368, 2292, 71, 84068, 33306, 20653, 9790, 2046, 5351, 125195, 26785, 1284,...	[ 0.2230224609375, 0.0889892578125, 0.2098388671875, 0.123291015625, 0.2191162109375, 0.1298828125, 0.112060546875, 0.167724609375, 0.0304718017578125, 0.1134033203125, 0.0421142578125, 0.1026611328125, 0.196533203125, 0.011474609375, 0.000823974609375, 0.1102294921875, 0.122314453125,...	embed
9471902_c0	9471902	haskell	0	Title: What's the modern way to access C2HS marshalling functions? Problem title: What's the modern way to access C2HS marshalling functions? Tags: haskell, c2hs, ffi Problem: What's the modern way to access C2HS marshalling functions? I want to use the cFromEnum function, but this resides in the C2HS module,...	What's the modern way to access C2HS marshalling functions? What's the modern way to access C2HS marshalling functions? haskell c2hs ffi What C2HS BNType Show NodeVector get_nodes_by_type What's the modern way to access C2HS marshalling functions? I want to use the cFromEnum function, but this resides in the ...	[ -0.00799560546875, 0.017578125, -0.0194091796875, 0.0118408203125, -0.00106048583984375, 0.0283203125, -0.0098876953125, -0.00506591796875, -0.00799560546875, -0.047119140625, 0.00286865234375, -0.040283203125, 0.01226806640625, -0.00921630859375, -0.026123046875, -0.031982421875, -0...	[ 4865, 3768, 5744, 3917, 47, 17203, 313, 304, 38131, 10283, 29907, 214, 32354, 7, 1556, 142508, 501, 127, 24500, 30262, 196707, 17367, 438, 112, 26455, 18770, 2046, 157, 988, 1272, 50986, 3444, 4527, 168407, 647, 2606, 157176, 88996, 51, 8...	[ 0.010345458984375, 0.06134033203125, 0.181884765625, 0.07489013671875, 0.0302734375, 0.161376953125, 0.1082763671875, 0.219482421875, 0.2191162109375, 0.1201171875, 0.169921875, 0.06402587890625, 0.204833984375, 0.07891845703125, 0.1112060546875, 0.21435546875, 0.095947265625, 0.15...	embed
62736800_c0	62736800	haskell	0	Title: Haskell returning list with hexadecimal value Problem title: Haskell returning list with hexadecimal value Tags: haskell Problem: Haskell returning list with hexadecimal value I am trying to define the function "decToHex" which returns a list of chars that corresponds to the hexadecimal value of a given number. ...	Haskell returning list with hexadecimal value Haskell returning list with hexadecimal value haskell Haskell Char Couldn Expected Actual Haskell returning list with hexadecimal value I am trying to define the function "decToHex" which returns a list of chars that corresponds to the hexadecimal value of a given number. F...	[ -0.0035247802734375, -0.0164794921875, 0.0093994140625, 0.003875732421875, 0.0004177093505859375, -0.0023040771484375, -0.015380859375, -0.0181884765625, 0.006439208984375, 0.0033111572265625, 0.0162353515625, -0.037841796875, 0.0206298828125, 0.02197265625, -0.001953125, -0.0118408203...	[ 20625, 142508, 30646, 5303, 678, 764, 3798, 170753, 34292, 214, 1556, 21656, 191147, 19, 60075, 13, 89829, 100582, 289, 31577, 61924, 32354, 50718, 7763, 841, 3355, 21441, 7, 42518, 34475, 14012, 534, 3882, 2203, 617, 910, 1019, 903, 18499,...	[ 0.1328125, 0.221435546875, 0.1663818359375, 0.1654052734375, 0.042236328125, 0.1260986328125, 0.1544189453125, 0.183349609375, 0.1612548828125, 0.02386474609375, 0.121337890625, 0.163818359375, 0.104736328125, 0.059600830078125, 0.122802734375, 0.14404296875, 0.0294647216796875, 0....	embed
34364662_c1	34364662	haskell	1	GHC.IO.Handle.Types.Handle’ Failed, modules loaded: none. Yuck. Maybe the name is too long. Let's try all the child types: processRequest :: IO.Handle.Types.Handle -> [Char] -> IO () processRequest :: Handle.Types.Handle -> [Char] -> IO () processRequest :: Types.Handle -> [Char] -> IO () processRequest :: Handle -> [C...	GHC.IO.Handle.Types.Handle’ Failed, modules loaded: none. Yuck. Maybe the name is too long. Let's try all the child types: processRequest :: IO.Handle.Types.Handle -> [Char] -> IO () processRequest :: Handle.Types.Handle -> [Char] -> IO () processRequest :: Types.Handle -> [Char] -> IO () processRequest :: Handle -> [C...	[ 0.0059814453125, 0.0184326171875, -0.004486083984375, 0.01025390625, -0.02734375, 0.0240478515625, -0.00933837890625, -0.01904296875, 0.00543212890625, -0.025634765625, -0.0025482177734375, -0.045654296875, 0.004608154296875, 0.006103515625, -0.0086669921875, 0.0032806396484375, -0.0...	[ 527, 73265, 17780, 135679, 133, 196707, 7, 26, 190355, 297, 88996, 72367, 351, 13, 15127, 2594, 83425, 9351, 4989, 9790, 756, 29041, 52895, 9433, 4332, 75616, 84068, 10639, 60457, 438, 163, 5701, 16750, 7108, 3917, 7413, 6097, 41877, 17304,...	[ 0.10369873046875, 0.1859130859375, 0.1951904296875, 0.2191162109375, 0.210205078125, 0.25, 0.027587890625, 0.0052490234375, 0.18896484375, 0.09100341796875, 0.20068359375, 0.1412353515625, 0.07568359375, 0.03363037109375, 0.0152435302734375, 0.0252227783203125, 0.036468505859375, 0...	embed
14777388_c0	14777388	haskell	0	Title: Haskell: Typeclass implies other typeclass Problem title: Haskell: Typeclass implies other typeclass Tags: haskell Problem: Haskell: Typeclass implies other typeclass Is it possible to have a typeclass imply another typeclass in Haskell? For example let's say there is a bunch of "things" that can be ordered by a...	Haskell: Typeclass implies other typeclass Haskell: Typeclass implies other typeclass haskell Haskell Typeclass Person OrdByKey Ord Haskell: Typeclass implies other typeclass Is it possible to have a typeclass imply another typeclass in Haskell? For example let's say there is a bunch of "things" that can be ordered by ...	[ -0.004730224609375, -0.00093841552734375, 0.0126953125, -0.0017852783203125, 0.014892578125, 0.01904296875, -0.0064697265625, -0.0146484375, -0.0028228759765625, -0.00762939453125, -0.003143310546875, 0.01007080078125, 0.00830078125, 0.006439208984375, -0.017333984375, -0.0051879882812...	[ 20625, 142508, 60457, 67413, 35388, 3789, 10644, 12, 90, 1556, 15270, 35379, 75358, 162429, 2071, 442, 7722, 765, 21980, 538, 15700, 23, 147306, 64113, 831, 12989, 390, 191145, 71864, 57346, 5809, 61924, 80596, 2886, 22799, 18507, 110527, 216...	[ 0.1146240234375, 0.2236328125, 0.1749267578125, 0.2403564453125, 0.1678466796875, 0.092041015625, 0.1807861328125, 0.013671875, 0.00506591796875, 0.07989501953125, 0.1502685546875, 0.1148681640625, 0.0870361328125, 0.119384765625, 0.019989013671875, 0.02166748046875, 0.137451171875, ...	embed
15354636_c1	15354636	haskell	1	become deadlocked, each waiting for more data from the other. After I send my own response, I can repeat the process by parsing the next type of packet I expect from the server. So in brief, is it possible to leverage my current ByteString parsing code in combination with lazy IO to read exactly the right number of by...	become deadlocked, each waiting for more data from the other. After I send my own response, I can repeat the process by parsing the next type of packet I expect from the server. So in brief, is it possible to leverage my current ByteString parsing code in combination with lazy IO to read exactly the right number of by...	[ -0.0003337860107421875, 0.0179443359375, 0.00140380859375, -0.0098876953125, -0.00138092041015625, 0.01263427734375, -0.0033416748046875, 0.0029296875, 0.01416015625, -0.0147705078125, 0.03515625, -0.02294921875, 0.0179443359375, -0.0027313232421875, -0.000652313232421875, 0.0142822265...	[ 24209, 103494, 21135, 297, 12638, 89289, 100, 1286, 2053, 3789, 25379, 10002, 57553, 831, 119140, 9433, 366, 6953, 11737, 10644, 43824, 126, 41206, 10723, 59335, 83, 7722, 21962, 4588, 43581, 3311, 67, 71713, 214, 18151, 162515, 678, 21, 32...	[ 0.12939453125, 0.08599853515625, 0.23681640625, 0.10284423828125, 0.06622314453125, 0.1553955078125, 0.0304107666015625, 0.10198974609375, 0.079833984375, 0.0416259765625, 0.0335693359375, 0.0731201171875, 0.1624755859375, 0.052978515625, 0.12255859375, 0.00579833984375, 0.1384277343...	embed
15599635_c0	15599635	haskell	0	Title: Where can I find a good manual for warp server? Problem title: Where can I find a good manual for warp server? Tags: webserver, yesod, web-development-server, haskell Problem: Where can I find a good manual for warp server? I created a yesod webapp using yesod init . During development I used yesod devel to run ...	Where can I find a good manual for warp server? Where can I find a good manual for warp server? webserver yesod web-development-server haskell Where Where can I find a good manual for warp server? I created a yesod webapp using yesod init . During development I used yesod devel to run the warp server on debug mode. Now...	[ -0.0037078857421875, 0.003997802734375, 0.0050048828125, -0.0052490234375, -0.021728515625, 0.027587890625, -0.0028076171875, -0.009033203125, 0.0079345703125, -0.0147705078125, 0.0159912109375, -0.0230712890625, 0.00994873046875, -0.007049560546875, -0.0142822265625, -0.00063323974609...	[ 7413, 10, 4127, 23009, 100, 1631, 254, 10723, 1467, 39642, 2422, 23722, 229815, 1556, 142508, 831, 75935, 9007, 17368, 23, 217, 34754, 11814, 8, 2601, 11675, 85779, 13736, 122799, 118276, 11389, 13158, 50061, 304, 2527, 5870, 9795, 1430, 16...	[ 0.06488037109375, 0.043121337890625, 0.09228515625, 0.2376708984375, 0.06195068359375, 0.1796875, 0.17529296875, 0.22412109375, 0.06146240234375, 0.1441650390625, 0.1273193359375, 0.219482421875, 0.08251953125, 0.0877685546875, 0.1993408203125, 0.00634765625, 0.052276611328125, 0.1...	embed
52249028_c0	52249028	haskell	0	Title: Can I replicate what nix-build does with nix-shell and cabal build? Problem title: Can I replicate what nix-build does with nix-shell and cabal build? Tags: cabal, nix, cabal-install, haskell Problem: Can I replicate what nix-build does with nix-shell and cabal build? I'm using the splendid Haskell library Miso ...	Can I replicate what nix-build does with nix-shell and cabal build? Can I replicate what nix-build does with nix-shell and cabal build? cabal nix cabal-install haskell Can Can I replicate what nix-build does with nix-shell and cabal build? I'm using the splendid Haskell library Miso , which recommends using Nix. The RE...	[ -0.0235595703125, -0.0157470703125, -0.0019989013671875, 0.026123046875, -0.021240234375, 0.0025634765625, 0.0169677734375, 0.0107421875, 0.0011749267578125, 0.0130615234375, -0.0079345703125, -0.006988525390625, 0.01806640625, 0.0233154296875, -0.006805419921875, -0.01495361328125, ...	[ 4171, 143126, 67, 300, 425, 9, 177149, 14602, 678, 128019, 136, 109524, 45367, 80383, 1556, 142508, 87, 2367, 17368, 85453, 20625, 35773, 1294, 7950, 31, 67330, 1520, 188300, 10611, 8781, 13452, 831, 88303, 209806, 5122, 2843, 44677, 16750, ...	[ 0.07073974609375, 0.2193603515625, 0.106689453125, 0.11767578125, 0.1734619140625, 0.07391357421875, 0.2403564453125, 0.04425048828125, 0.0546875, 0.2171630859375, 0.0797119140625, 0.2198486328125, 0.217529296875, 0.126220703125, 0.0775146484375, 0.193603515625, 0.0301513671875, 0....	embed
42207457_c0	42207457	haskell	0	Title: Bidirectional Arrow Problem title: Bidirectional Arrow Tags: haskell, category-abstractions, arrow-abstraction Problem: Bidirectional Arrow I'm trying to capture a symmetrical data processing pipeline using arrows, and was wondering if bidirectional composition is possible. Control.Arrow exposes the following --...	Bidirectional Arrow Bidirectional Arrow haskell category-abstractions arrow-abstraction Bidirectional Arrow Left Category Right Bidirectional Arrow I'm trying to capture a symmetrical data processing pipeline using arrows, and was wondering if bidirectional composition is possible. Control.Arrow exposes the following w...	[ -0.00701904296875, -0.01324462890625, 0.0203857421875, 0.0140380859375, -0.01953125, 0.0211181640625, -0.00579833984375, 0.01226806640625, 0.0008087158203125, 0.01220703125, 0.0027008056640625, 0.004791259765625, -0.008056640625, -0.0091552734375, 0.006134033203125, -0.01129150390625, ...	[ 1843, 80581, 110117, 1172, 15555, 1556, 142508, 95487, 2055, 7, 117474, 118201, 2480, 49057, 90911, 31577, 141621, 230612, 6827, 2053, 9433, 137158, 2256, 17368, 333, 166577, 7722, 27131, 7614, 172554, 25632, 2367, 1884, 36510, 111, 80836, 1064...	[ 0.177978515625, 0.2003173828125, 0.125732421875, 0.116455078125, 0.192626953125, 0.0985107421875, 0.169677734375, 0.166015625, 0.06927490234375, 0.05316162109375, 0.116943359375, 0.25390625, 0.0843505859375, 0.1787109375, 0.1309814453125, 0.009552001953125, 0.09332275390625, 0.1561...	embed
45552591_c0	45552591	haskell	0	Title: Polymorphic types with purescript-bridge Problem title: Polymorphic types with purescript-bridge Tags: purescript, haskell Problem: Polymorphic types with purescript-bridge I have type in Haskell newtype Uid a = Uid {uidToText :: Text} deriving (Eq, Ord, Show, Data, Typeable, Generic) Using purescript-bridge lib...	Polymorphic types with purescript-bridge Polymorphic types with purescript-bridge purescript haskell a Polymorphic Uid Text Ord Show Data Typeable Generic SumType Haskell Proxy Data.Typeable.Internal.Typeable Polymorphic types with purescript-bridge I have type in Haskell Using purescript-bridge library mkSumType funct...	[ 0.004486083984375, 0.023193359375, 0.015625, 0.002593994140625, -0.007568359375, 0.0179443359375, 0.0283203125, 0.0081787109375, -0.0040283203125, -0.031982421875, 0.011962890625, -0.031494140625, 0.0184326171875, 0.003021240234375, -0.01318359375, -0.0125732421875, 0.015869140625, ...	[ 63306, 178851, 52895, 678, 34166, 32032, 80728, 1556, 142508, 345, 532, 24129, 35379, 17367, 11809, 60457, 2886, 88342, 36335, 196707, 20625, 1250, 50878, 44851, 10644, 35773, 19201, 294, 316, 32354, 831, 18, 3249, 111, 765, 17378, 30022 ]	[ 0.1641845703125, 0.2083740234375, 0.2308349609375, 0.06939697265625, 0.171630859375, 0.26025390625, 0.1917724609375, 0.1041259765625, 0.20947265625, 0.045654296875, 0.1063232421875, 0.118896484375, 0.164306640625, 0.061370849609375, 0.067138671875, 0.161376953125, 0.126708984375, 0...	embed
69864210_c0	69864210	haskell	0	Title: Applying some operation F to each element of a grid? - Haskell Problem title: Applying some operation F to each element of a grid? - Haskell Tags: haskell Problem: Applying some operation F to each element of a grid? - Haskell I am new to Haskell and have some questions regarding applying a function say f to eac...	Applying some operation F to each element of a grid? - Haskell Applying some operation F to each element of a grid? - Haskell haskell Applying Haskell Grid Show Applying some operation F to each element of a grid? - Haskell I am new to Haskell and have some questions regarding applying a function say f to each element ...	[ -0.007415771484375, -0.0022430419921875, 0.00927734375, -0.0023651123046875, 0.0008544921875, -0.006988525390625, -0.0015716552734375, -0.00506591796875, -0.01153564453125, 0.01531982421875, 0.0296630859375, 0.0024871826171875, -0.0098876953125, 0.0167236328125, -0.0223388671875, 0.002...	[ 5659, 538, 3060, 41018, 563, 47, 12638, 12830, 120067, 20625, 142508, 1556, 31945, 71, 17367, 3525, 17582, 59911, 10, 32354, 5154, 1238, 60457, 28670, 10763, 155455, 104250, 5773, 48402, 32036, 111, 831, 70, 22288, 241957, 52895, 18499, 84751...	[ 0.1292724609375, 0.09613037109375, 0.0673828125, 0.1890869140625, 0.2308349609375, 0.09698486328125, 0.1265869140625, 0.1591796875, 0.23828125, 0.111572265625, 0.191162109375, 0.0616455078125, 0.1552734375, 0.0718994140625, 0.1463623046875, 0.05023193359375, 0.0232391357421875, 0.1...	embed
3228856_c0	3228856	haskell	0	Title: Predicate Logic in Haskell Problem title: Predicate Logic in Haskell Tags: haskell, first-order-logic, data-structures, context-free-grammar Problem: Predicate Logic in Haskell I've been using the following data structure for the representation of propositional logic in Haskell: data Prop = Pred String \| Not Pro...	Predicate Logic in Haskell Predicate Logic in Haskell haskell first-order-logic data-structures context-free-grammar Predicate Logic Haskell Prop Pred Not Impl Equiv Ord Predicate Logic in Haskell I've been using the following data structure for the representation of propositional logic in Haskell: Any comments on this...	[ 0.0257568359375, 0.000782012939453125, 0.0103759765625, 0.0279541015625, -0.00946044921875, 0.01458740234375, 0.00274658203125, -0.02978515625, -0.0118408203125, -0.02880859375, -0.00958251953125, -0.0023651123046875, -0.01214599609375, -0.0234375, -0.00848388671875, 0.01312255859375, ...	[ 7145, 2063, 67, 50592, 238, 23, 20625, 142508, 1556, 5117, 80596, 137043, 2053, 137656, 43701, 32087, 107415, 43796, 11205, 29128, 145666, 334, 35379, 17368, 25632, 45646, 18811, 89261, 289, 62775, 81907, 65042, 83898, 34831, 172155, 1653, 4127...	[ 0.17578125, 0.2093505859375, 0.0830078125, 0.207275390625, 0.0232696533203125, 0.03753662109375, 0.1368408203125, 0.2318115234375, 0.1240234375, 0.009063720703125, 0.1280517578125, 0.140625, 0.094970703125, 0.09185791015625, 0.1683349609375, 0.112060546875, 0.06085205078125, 0.1370...	embed
59577203_c0	59577203	haskell	0	Title: How do I override error message on Left in Haskell? Problem title: How do I override error message on Left in Haskell? Tags: haskell, pattern-matching, error-handling Problem: How do I override error message on Left in Haskell? I want to read from file and am using pattern matching on Left/Right to tell is said ...	How do I override error message on Left in Haskell? How do I override error message on Left in Haskell? haskell pattern-matching error-handling How Left Haskell somefile_that_does_not_exist.ini Right How do I override error message on Left in Haskell? I want to read from file and am using pattern matching on Left/Right...	[ 0.0020599365234375, 0.0111083984375, 0.0004177093505859375, 0.0057373046875, 0.0234375, 0.0027618408203125, -0.011474609375, -0.0030517578125, 0.0084228515625, 0.0084228515625, 0.0157470703125, -0.018310546875, 0.0167236328125, -0.00457763671875, 0.0208740234375, 0.01141357421875, 0....	[ 11249, 645, 416, 112, 18499, 26008, 98, 636, 2480, 20625, 142508, 87, 23, 1556, 103510, 98753, 54885, 29822, 86673, 246, 90, 10869, 54376, 943, 90911, 54, 3444, 12301, 1295, 11435, 17368, 14858, 1052, 22553, 14192, 2804, 32316, 1884, 221, ...	[ 0.045867919921875, 0.12744140625, 0.19580078125, 0.14208984375, 0.2125244140625, 0.1494140625, 0.0550537109375, 0.1412353515625, 0.2265625, 0.16943359375, 0.270263671875, 0.00323486328125, 0.07049560546875, 0.1351318359375, 0.2125244140625, 0.1527099609375, 0.075927734375, 0.176513...	embed
18370537_c1	18370537	haskell	1	) -> [Int] -> [[Int]] g n m digitCount lastDigit (hash,hashCount) digits \| digitCount == m = if test then [reverse digits] else [] \| otherwise = if lastDigit == 0 then g n m (digitCount + 1) (lastDigit + 1) (hash',hashCount') (lastDigit:digits) else if lastDigit == n - 1 then g n m (digitCount + 1) (lastDigit - 1) (has...	) -> [Int] -> [[Int]] g n m digitCount lastDigit (hash,hashCount) digits \| digitCount == m = if test then [reverse digits] else [] \| otherwise = if lastDigit == 0 then g n m (digitCount + 1) (lastDigit + 1) (hash',hashCount') (lastDigit:digits) else if lastDigit == n - 1 then g n m (digitCount + 1) (lastDigit - 1) (has...	[ -0.037841796875, 0.0084228515625, -0.00390625, -0.00994873046875, 0.000797271728515625, 0.006134033203125, -0.00634765625, 0.000499725341796875, 0.0242919921875, -0.0133056640625, 0.001190185546875, -0.008056640625, 0.0091552734375, 0.025390625, -0.00274658203125, -0.007232666015625, ...	[ 1388, 33079, 4153, 18, 706, 653, 347, 153939, 108210, 4568, 14055, 15769, 126234, 4, 7, 58745, 6, 69112, 2203, 2174, 3034, 107, 37676, 37076, 120262, 757, 4803, 217, 997, 4879, 19777, 25, 106, 37223, 1556, 127, 594, 33548, 7225, 276, 64...	[ 0.083740234375, 0.07171630859375, 0.0858154296875, 0.117431640625, 0.1116943359375, 0.068603515625, 0.176513671875, 0.258056640625, 0.2327880859375, 0.214111328125, 0.09869384765625, 0.1802978515625, 0.2008056640625, 0.011688232421875, 0.053619384765625, 0.05072021484375, 0.025909423...	embed
23447854_c0	23447854	haskell	0	Title: Use foldl to traverse a Tree in Haskell Problem title: Use foldl to traverse a Tree in Haskell Tags: tree, haskell Problem: Use foldl to traverse a Tree in Haskell I've got the following code: data Tree a = ATree a [Tree a] deriving Show treeFold :: (b -> a -> b) -> b -> Tree a -> b treeFold f acc (ATree a []) =...	Use foldl to traverse a Tree in Haskell Use foldl to traverse a Tree in Haskell tree haskell Use Tree Haskell ATree Show Couldn Expected Actual Use foldl to traverse a Tree in Haskell I've got the following code: It's supposed to go over each element of Tree and apply a function to the value. But it gives me this error...	[ -0.003936767578125, 0, -0.00213623046875, -0.00145721435546875, 0.0024871826171875, 0.00139617919921875, -0.031982421875, -0.014404296875, -0.025390625, -0.0498046875, 0.01129150390625, -0.0042724609375, -0.00160980224609375, 0.0115966796875, 0.002227783203125, -0.00958251953125, -0....	[ 36836, 18344, 20469, 47, 37317, 13, 101344, 20625, 142508, 23, 53201, 1556, 107, 17367, 191147, 19, 60075, 100582, 25632, 18151, 134598, 738, 645, 12638, 12830, 59911, 32354, 34292, 76199, 163, 903, 18499 ]	[ 0.1119384765625, 0.1781005859375, 0.257080078125, 0.0540771484375, 0.1905517578125, 0.094482421875, 0.250732421875, 0.1163330078125, 0.209228515625, 0.049713134765625, 0.1375732421875, 0.0966796875, 0.1263427734375, 0.1263427734375, 0.110107421875, 0.052520751953125, 0.083984375, 0...	embed
23510028_c0	23510028	haskell	0	Title: Should I learn haskell for understanding the functional programming part of javascript? Problem title: Should I learn haskell for understanding the functional programming part of javascript? Tags: functional-programming, haskell, javascript Problem: Should I learn haskell for understanding the functional program...	Should I learn haskell for understanding the functional programming part of javascript? Should I learn haskell for understanding the functional programming part of javascript? functional-programming haskell javascript Should Should I learn haskell for understanding the functional programming part of javascript? I'm a d...	[ -0.000518798828125, 0.00445556640625, -0.00083160400390625, -0.01226806640625, -0.016357421875, 0.0010986328125, -0.011962890625, 0.00311279296875, 0.005157470703125, -0.03515625, -0.000667572021484375, -0.053466796875, 0.00567626953125, 0.01708984375, -0.0213623046875, -0.001541137695...	[ 151117, 87, 30698, 1556, 142508, 100, 100094, 123309, 56037, 449, 2831, 136951, 32, 28966, 10, 106001, 678, 4552, 37515, 32500, 76615, 169549, 3444, 169, 5351, 70, 22690, 7413, 35978, 7941, 28219, 23755, 33938, 4163, 903, 6495, 7, 46876, 59...	[ 0.16943359375, 0.073974609375, 0.17431640625, 0.185302734375, 0.287109375, 0.053466796875, 0.1533203125, 0.2198486328125, 0.139404296875, 0.051971435546875, 0.11767578125, 0.2646484375, 0.010498046875, 0.1434326171875, 0.0199737548828125, 0.1202392578125, 0.0158538818359375, 0.0665...	embed
23922807_c0	23922807	haskell	0	Title: Counting of algebraic data types Problem title: Counting of algebraic data types Tags: haskell, theory, algebraic-data-types Problem: Counting of algebraic data types I'm reading/listening to Chris Taylor's presentation on algebraic data types. http://chris-taylor.github.io/blog/2013/02/10/the-algebra-of-algebra...	Counting of algebraic data types Counting of algebraic data types haskell theory algebraic-data-types Counting Bool Trio First Second Third Counting of algebraic data types I'm reading/listening to Chris Taylor's presentation on algebraic data types. http://chris-taylor.github.io/blog/2013/02/10/the-algebra-of-algebrai...	[ 0.0311279296875, 0.0162353515625, 0.005279541015625, 0.02490234375, -0.00445556640625, -0.0034942626953125, -0.01470947265625, 0.0101318359375, 0.0262451171875, -0.0157470703125, -0.0194091796875, -0.0264892578125, 0.0279541015625, 0.046142578125, 0.00860595703125, 0.007049560546875, ...	[ 1311, 128396, 144, 429, 2844, 1771, 2053, 52895, 1556, 142508, 154453, 10135, 50986, 2460, 929, 4699, 31, 23972, 77648, 198387, 16454, 12897, 31745, 63569, 92252, 7164, 1484, 32102, 40059, 32354, 27781, 77878, 27165, 44084, 382, 136, 959, 305...	[ 0.1456298828125, 0.1756591796875, 0.030242919921875, 0.10211181640625, 0.1484375, 0.04278564453125, 0.14404296875, 0.23583984375, 0.0902099609375, 0.19970703125, 0.103515625, 0.1192626953125, 0.2119140625, 0.10986328125, 0.2135009765625, 0.1959228515625, 0.174560546875, 0.034606933...	embed
22587819_c1	22587819	haskell	1	f 0 r = return r f l _ = do b <- getBool f (l - 1) $ if b then 1 else 0 mainFunc :: B.ByteString -> IO () mainFunc bs = do let r = runGet (runBitGet (coreFunc ((B.length bs) * 8))) bs print $ show r main :: IO () main = do args <- getArgs case args of [] -> return () (x:_) -> (do bs <- B.readFile x mainFunc bs return ...	f 0 r = return r f l _ = do b <- getBool f (l - 1) $ if b then 1 else 0 mainFunc :: B.ByteString -> IO () mainFunc bs = do let r = runGet (runBitGet (coreFunc ((B.length bs) * 8))) bs print $ show r main :: IO () main = do args <- getArgs case args of [] -> return () (x:_) -> (do bs <- B.readFile x mainFunc bs return ...	[ -0.007720947265625, 0.007049560546875, -0.007537841796875, 0.002471923828125, -0.012939453125, 0.007720947265625, -0.003662109375, -0.00225830078125, 0.007659912109375, -0.006317138671875, 0.01611328125, 0.00421142578125, -0.00506591796875, 0.0162353515625, 0.0174560546875, -0.00482177...	[ 1238, 757, 1690, 30646, 96, 101, 54, 876, 2046, 12647, 929, 141, 4879, 3650, 106, 37076, 5201, 97249, 335, 75358, 67, 71713, 17780, 7, 2633, 11675, 724, 126, 16428, 571, 217, 30854, 5, 23986, 382, 28412, 7639, 79459, 7614, 9405, 7225, ...	[ 0.11962890625, 0.14599609375, 0.1240234375, 0.197265625, 0.0545654296875, 0.001922607421875, 0.04400634765625, 0.0859375, 0.1251220703125, 0.1036376953125, 0.1678466796875, 0.06146240234375, 0.0343017578125, 0.04534912109375, 0.02935791015625, 0.00274658203125, 0.1229248046875, 0.1...	embed
4576734_c0	4576734	haskell	0	Title: Why do we need 'seq' or 'pseq' with 'par' in Haskell? Problem title: Why do we need 'seq' or 'pseq' with 'par' in Haskell? Tags: speculative-execution, parallel-processing, haskell Problem: Why do we need 'seq' or 'pseq' with 'par' in Haskell? I'm tryin...	Why do we need 'seq' or 'pseq' with 'par' in Haskell? Why do we need 'seq' or 'pseq' with 'par' in Haskell? speculative-execution parallel-processing haskell Why Haskell Why do we need 'seq' or 'pseq' with 'par' in Haskell? I'm trying to understand why we need...	[ -0.00177764892578125, 0.0267333984375, 0.0037078857421875, 0.01708984375, 0.0016326904296875, 0.01165771484375, 0.00689697265625, -0.01544189453125, -0.00080108642578125, -0.0260009765625, -0.000904083251953125, 0.016845703125, -0.0028533935546875, 0.0067138671875, -0.00433349609375, -...	[ 44084, 3871, 3768, 184, 864, 45616, 678, 2500, 23, 20625, 142508, 149575, 4935, 46480, 1010, 95103, 63923, 1556, 54, 642, 707, 28219, 15400, 756, 63920, 5570, 121413, 18151, 25632, 129980, 125195, 32032, 40858, 151575, 15044, 10, 876, 30646, ...	[ 0.124755859375, 0.1390380859375, 0.073974609375, 0.1148681640625, 0.229736328125, 0.1448974609375, 0.064208984375, 0.2283935546875, 0.058563232421875, 0.1270751953125, 0.2369384765625, 0.1453857421875, 0.0435791015625, 0.010040283203125, 0.041717529296875, 0.1976318359375, 0.04162597...	embed
6130483_c0	6130483	haskell	0	Title: Declarations at the GHCi prompt Problem title: Declarations at the GHCi prompt Tags: syntax, declaration, ghci, haskell Problem: Declarations at the GHCi prompt I have just installed Haskell Platform for Windows (version 2011.2.0.1), and started to work through the HaskellQuestions.pdf The second question requir...	Declarations at the GHCi prompt Declarations at the GHCi prompt syntax declaration ghci haskell Declarations GHCi www.haskell.org Loading ffi-1.0 Prelude Declarations at the GHCi prompt I have just installed Haskell Platform for Windows (version 2011.2.0.1), and started to work through the HaskellQuestions.pdf The seco...	[ 0.00860595703125, 0.0155029296875, 0.0111083984375, -0.0025787353515625, 0.003082275390625, 0.0128173828125, 0.01458740234375, -0.02197265625, -0.0020599365234375, -0.005950927734375, 0.0078125, -0.036376953125, -0.01458740234375, -0.00098419189453125, 0.00150299072265625, 0.0213623046...	[ 98501, 5256, 99, 527, 73265, 14, 105876, 70, 6002, 86531, 21635, 31380, 318, 1556, 142508, 10557, 1478, 228006, 24500, 102107, 1914, 822, 20600, 20625, 70968, 3773, 13999, 73011, 195136, 17514, 15483, 17932, 9655, 144570, 425, 2203, 138, 237,...	[ 0.222900390625, 0.0579833984375, 0.07958984375, 0.109375, 0.1583251953125, 0.1881103515625, 0.2012939453125, 0.005035400390625, 0.0584716796875, 0.0908203125, 0.1763916015625, 0.139892578125, 0.1668701171875, 0.1331787109375, 0.2327880859375, 0.125, 0.009613037109375, 0.08093261718...	embed
64309035_c0	64309035	haskell	0	Title: How do you not negate a number on a list? Problem title: How do you not negate a number on a list? Tags: haskell Problem: How do you not negate a number on a list? I know that in Haskell, we can negate a number by doing negate . But what if I wanted to negate everything on a list except a certain number? Lets sa...	How do you not negate a number on a list? How do you not negate a number on a list? haskell How How do you not negate a number on a list? I know that in Haskell, we can negate a number by doing negate . But what if I wanted to negate everything on a list except a certain number? Lets say I have a function called helpne...	[ -0.00616455078125, 0.0037841796875, 0.0155029296875, 0.0023040771484375, -0.009765625, 0.0159912109375, 0.002593994140625, 0.013427734375, 0.00958251953125, -0.00112152099609375, -0.0264892578125, -0.0179443359375, -0.00927734375, 0.00347900390625, -0.006622314453125, 0.003250122070312...	[ 11249, 959, 90584, 13, 14012, 98, 5303, 54, 1556, 142508, 10, 3714, 20625, 831, 36663, 47, 26818, 40494, 24233, 32354, 4358, 3331, 67, 51776, 23, 66596, 206808, 304, 116574, 3642, 11907, 201, 5608, 2046, 9, 5428, 617, 17376, 81887, 37842,...	[ 0.06536865234375, 0.2017822265625, 0.2471923828125, 0.1671142578125, 0.21826171875, 0.1131591796875, 0.232177734375, 0.02288818359375, 0.1270751953125, 0.221435546875, 0.039886474609375, 0.01171875, 0.1241455078125, 0.02972412109375, 0.0587158203125, 0.03302001953125, 0.1043090820312...	embed
4976139_c0	4976139	haskell	0	Title: What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskell? Problem title: What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskell? Tags: haskell Problem: What's the recommended way of handling complexly composed POD(plain-old-d...	What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskell? What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskell? haskell What POD Haskell What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskel...	[ 0.000675201416015625, 0.0191650390625, 0.0037384033203125, 0.0206298828125, 0.0137939453125, 0.017578125, 0.003204345703125, -0.0023651123046875, 0.0035400390625, -0.000202178955078125, 0.000926971435546875, -0.0341796875, 0.027587890625, 0.021240234375, -0.003814697265625, -0.00793457...	[ 3768, 170198, 3917, 45064, 27140, 150350, 62035, 7290, 18345, 10135, 30563, 20625, 142508, 23, 1556, 4865, 71, 3525, 9014, 13254, 10644, 46876, 41925, 756, 2053, 45646, 8121, 18507, 110527, 36746, 831, 5941, 150380, 28394, 15700, 34292, 44457, ...	[ 0.0262298583984375, 0.1395263671875, 0.05615234375, 0.175537109375, 0.208251953125, 0.17138671875, 0.27880859375, 0.12646484375, 0.187744140625, 0.1593017578125, 0.19189453125, 0.1519775390625, 0.2415771484375, 0.03582763671875, 0.117919921875, 0.0482177734375, 0.050140380859375, 0...	embed
12073336_c0	12073336	haskell	0	Title: Satisfying monad laws without a type constructor Problem title: Satisfying monad laws without a type constructor Tags: category-theory, functor, haskell, monads Problem: Satisfying monad laws without a type constructor Given e.g. a type like data Tree a = Branch (Tree a) (Tree a) \| Leaf a I can easily write inst...	Satisfying monad laws without a type constructor Satisfying monad laws without a type constructor category-theory functor haskell monads Satisfying Tree Branch Leaf StringTree Satisfying monad laws without a type constructor Given e.g. a type like I can easily write instances for Functor, Applicative, Monad, etc. But i...	[ -0.004730224609375, 0.016357421875, -0.026611328125, 0.01263427734375, 0.018798828125, 0.00799560546875, -0.01263427734375, -0.01953125, 0.00775146484375, -0.0194091796875, -0.01708984375, -0.04345703125, -0.00494384765625, 0.010986328125, 0.0078125, 0.0093994140625, -0.003173828125,...	[ 947, 1814, 18929, 2667, 712, 131703, 15490, 10644, 64549, 748, 95487, 7477, 18770, 1556, 142508, 101344, 23351, 62731, 72546, 33022, 110527, 28670, 11048, 4935, 60331, 71, 98102, 73, 1653, 13, 30524, 388, 81273, 32354, 214521, 5809, 7464, 515...	[ 0.01129150390625, 0.067626953125, 0.03857421875, 0.139404296875, 0.1944580078125, 0.135986328125, 0.09588623046875, 0.19091796875, 0.1265869140625, 0.06292724609375, 0.1011962890625, 0.0280609130859375, 0.1055908203125, 0.0282440185546875, 0.158447265625, 0.0904541015625, 0.141601562...	embed
23684987_c0	23684987	haskell	0	Title: Haskell cannot compile Problem title: Haskell cannot compile Tags: haskell, polynomials, types Problem: Haskell cannot compile As usuall I am suffering the problem, that on paper everything should work, but the compiler gives an error which I just cannot understand. data Polynom = Polynom[Double] deriving Show c...	Haskell cannot compile Haskell cannot compile haskell polynomials types Haskell Polynom Double Show h:ts Haskell cannot compile As usuall I am suffering the problem, that on paper everything should work, but the compiler gives an error which I just cannot understand. giving the error "Constructor `Polynom' should have ...	[ -0.00750732421875, -0.0003299713134765625, 0.0019989013671875, 0.00567626953125, -0.00714111328125, 0.017578125, 0.0205078125, -0.0255126953125, 0.00970458984375, -0.027099609375, 0.00909423828125, -0.040771484375, 0.014892578125, -0.01409912109375, -0.024658203125, -0.00494384765625, ...	[ 20625, 142508, 53418, 9969, 1340, 1556, 35874, 1687, 15403, 52895, 63306, 107172, 17367, 1096, 933, 115723, 178707, 2967, 15122, 26818, 5608, 4488, 34759, 18499, 28219, 11935, 36716, 748, 7192, 538, 765, 106, 10750, 1284, 2809, 34475, 351, 61...	[ 0.1513671875, 0.2548828125, 0.202392578125, 0.1900634765625, 0.1761474609375, 0.1434326171875, 0.1763916015625, 0.20751953125, 0.0849609375, 0.1236572265625, 0.1749267578125, 0.142333984375, 0.08660888671875, 0.08251953125, 0.03265380859375, 0.0269927978515625, 0.0562744140625, 0.0...	embed
51491915_c0	51491915	haskell	0	Title: Unwrap value from IO operation at a later time Problem title: Unwrap value from IO operation at a later time Tags: haskell, io-monad Problem: Unwrap value from IO operation at a later time Hello i was wondering how can you unwrap a value at a later time in the IO monad? If a<-expression binds the result to a the...	Unwrap value from IO operation at a later time Unwrap value from IO operation at a later time haskell io-monad IO Unwrap WriteMode out.txt Monad Unwrap value from IO operation at a later time Hello i was wondering how can you unwrap a value at a later time in the IO monad? If a<-expression binds the result to a then ca...	[ -0.0201416015625, 0.005340576171875, 0.0216064453125, 0.00787353515625, 0.009765625, 0.00445556640625, -0.0038299560546875, -0.01300048828125, 0.0018310546875, -0.0020904541015625, -0.0185546875, -0.019287109375, -0.0087890625, 0.004547119140625, 0.006927490234375, -0.005767822265625, ...	[ 992, 434, 13631, 34292, 1295, 17780, 41018, 99, 14432, 1733, 1556, 142508, 22995, 3796, 712, 601, 18781, 9083, 112, 1810, 124326, 60331, 71, 149016, 3642, 831, 51, 10, 23, 2667, 16093, 204629, 68557, 16750, 4527, 9, 237, 171859, 55300, 26...	[ 0.124267578125, 0.115966796875, 0.255126953125, 0.2308349609375, 0.090087890625, 0.21337890625, 0.1533203125, 0.0224609375, 0.1307373046875, 0.1259765625, 0.08837890625, 0.2071533203125, 0.185302734375, 0.11083984375, 0.2008056640625, 0.03118896484375, 0.09942626953125, 0.170654296...	embed
2785263_c0	2785263	haskell	0	Title: Haskell graph data type representation Problem title: Haskell graph data type representation Tags: haskell Problem: Haskell graph data type representation I want to represent a graph in Haskell in the following manner: For each node I want to store it's value and a list of adjacent nodes. The problem which I'm h...	Haskell graph data type representation Haskell graph data type representation haskell Haskell Node Show Haskell graph data type representation I want to represent a graph in Haskell in the following manner: For each node I want to store it's value and a list of adjacent nodes. The problem which I'm having difficulties ...	[ -0.01239013671875, 0.01373291015625, 0.007232666015625, 0.032958984375, 0.00433349609375, -0.00157928466796875, -0.01519775390625, -0.0087890625, -0.004730224609375, -0.0218505859375, -0.01202392578125, -0.041259765625, -0.007537841796875, 0.01007080078125, 0.00946044921875, 0.00066757...	[ 20625, 142508, 41382, 2053, 10644, 18811, 1556, 438, 112, 17367, 1363, 3444, 33636, 23, 25632, 144996, 12638, 110, 4343, 34292, 5303, 123594, 16797, 988, 2967, 34844, 91067, 3789, 600, 237, 25182, 141, 915, 96, 136, 959, 231454, 28636, 164,...	[ 0.142822265625, 0.239990234375, 0.2164306640625, 0.12451171875, 0.1805419921875, 0.1986083984375, 0.1292724609375, 0.1505126953125, 0.154296875, 0.1590576171875, 0.022430419921875, 0.0775146484375, 0.208740234375, 0.039794921875, 0.035003662109375, 0.04052734375, 0.0435791015625, 0...	embed
71072417_c0	71072417	haskell	0	Title: sin function returning numbers outside of range [-1, 1] Problem title: sin function returning numbers outside of range [-1, 1] Tags: trigonometry, haskell Problem: sin function returning numbers outside of range [-1, 1] I am working in Haskell and have had an error where, for really large floats z, sin(z) return...	sin function returning numbers outside of range [-1, 1] sin function returning numbers outside of range [-1, 1] trigonometry haskell sin function returning numbers outside of range [-1, 1] I am working in Haskell and have had an error where, for really large floats z, sin(z) returns some value outside of the range [-1,...	[ -0.004852294921875, -0.0235595703125, -0.002349853515625, -0.01129150390625, -0.00482177734375, 0.01129150390625, -0.00830078125, 0.0086669921875, -0.004791259765625, 0.000560760498046875, 0.0025634765625, -0.000576019287109375, 0.0003814697265625, -0.016357421875, 0.0400390625, 0.0058...	[ 880, 32354, 30646, 214, 101935, 50782, 111, 37457, 5759, 106, 171353, 64970, 1556, 142508, 20697, 20625, 18499, 6183, 21334, 21917, 9821, 97, 132, 169, 34292, 52080, 10176, 84434, 978, 1528, 150631, 36917, 107730, 3934, 15700, 26946, 142424, ...	[ 0.246826171875, 0.1856689453125, 0.1820068359375, 0.043548583984375, 0.1546630859375, 0.164794921875, 0.047637939453125, 0.18017578125, 0.1500244140625, 0.06903076171875, 0.1087646484375, 0.0538330078125, 0.112060546875, 0.220947265625, 0.06158447265625, 0.112060546875, 0.15185546875...	embed
49033681_c0	49033681	haskell	0	Title: fmap versus <$> Problem title: fmap versus <$> Tags: haskell Problem: fmap versus <$> According to the documentation <$> is an synonym for fmap and they have the following types: (<$>) :: Functor f => (a -> b) -> f a -> f b fmap :: Functor f => (a -> b) -> f a -> f b So it seems to me, from the signa...	fmap versus <$> fmap versus <$> haskell Control.Applicative Functor fmap versus <$> According to the documentation <$> is an synonym for fmap and they have the following types: So it seems to me, from the signatures above, that they take the arguments in the same order, the only difference being that one is...	[ 0.01165771484375, 0.00457763671875, 0.0037078857421875, 0.006927490234375, -0.00933837890625, 0.0247802734375, 0.01416015625, 0.006072998046875, 0.0147705078125, -0.0233154296875, 0.01251220703125, -0.018798828125, 0.01190185546875, 0.0152587890625, -0.0072021484375, -0.0244140625, 0...	[ 1238, 62346, 119475, 1277, 4369, 1230, 5386, 1556, 142508, 27131, 39179, 11048, 4935, 28670, 18770, 47, 209806, 2740, 164661, 70, 25632, 52895, 37202, 138256, 1836, 5646, 10750, 7, 5701, 12989, 4734, 60212, 1632, 23, 55923, 3789, 83, 959, 6...	[ 0.1607666015625, 0.307861328125, 0.2357177734375, 0.0293121337890625, 0.1754150390625, 0.0151519775390625, 0.1126708984375, 0.13720703125, 0.244873046875, 0.207763671875, 0.07672119140625, 0.1270751953125, 0.00250244140625, 0.114990234375, 0.10321044921875, 0.0218658447265625, 0.0747...	embed
30140175_c0	30140175	haskell	0	Title: Moving from static configuration to dynamic configuration Problem title: Moving from static configuration to dynamic configuration Tags: configuration-files, haskell Problem: Moving from static configuration to dynamic configuration I am working on a haskell project where the settings are currently in a file cal...	Moving from static configuration to dynamic configuration Moving from static configuration to dynamic configuration configuration-files haskell static Moving Setting.hs Moving from static configuration to dynamic configuration I am working on a haskell project where the settings are currently in a file called Setting.h...	[ 0.000560760498046875, 0.00107574462890625, 0.0225830078125, -0.00830078125, 0.0019683837890625, 0.0036468505859375, -0.01708984375, 0.012451171875, -0.0012054443359375, -0.0233154296875, -0.0159912109375, -0.006256103515625, -0.0108642578125, -0.00787353515625, 0.00311279296875, 0.0102...	[ 2501, 6496, 1295, 201939, 180346, 47, 84079, 29822, 1556, 142508, 503, 19514, 127, 20697, 13452, 53550, 82424, 23, 11435, 5, 12765, 20271, 9969, 1733, 831, 17203, 7964, 4785, 5792, 179635, 12301, 70, 11675, 6032, 18151, 37382, 58696, 150675, ...	[ 0.136962890625, 0.1126708984375, 0.09637451171875, 0.227783203125, 0.28271484375, 0.06512451171875, 0.25732421875, 0.135009765625, 0.125244140625, 0.2122802734375, 0.155517578125, 0.20947265625, 0.14306640625, 0.09033203125, 0.070556640625, 0.216064453125, 0.05194091796875, 0.00619...	embed
33531834_c0	33531834	haskell	0	Title: nubBy is not working as expected Problem title: nubBy is not working as expected Tags: haskell Problem: nubBy is not working as expected The function below should generate prime numbers however it does not for GHC 7.10.2. Is anybody else seeing this? GHCi, version 7.10.2: http://www.haskell.org/ghc/ :? for help ...	nubBy is not working as expected nubBy is not working as expected haskell Data.List GHCi www.haskell.org Prelude nubBy is not working as expected The function below should generate prime numbers however it does not for GHC 7.10.2. Is anybody else seeing this? The strange part is that it seems to work fine on this site:...	[ -0.0107421875, 0.0179443359375, 0.0157470703125, -0.002593994140625, 0.007354736328125, 0.003173828125, 0.007476806640625, -0.034423828125, -0.0019073486328125, -0.029541015625, -0.009521484375, -0.00165557861328125, 0.0274658203125, -0.028564453125, -0.013671875, -0.0108642578125, -...	[ 315, 275, 75358, 959, 20697, 237, 84751, 83, 1556, 142508, 11809, 154663, 527, 73265, 14, 10557, 1478, 1914, 822, 112, 32354, 35064, 5608, 139392, 20809, 101935, 49903, 14602, 115384, 133684, 37873, 86681, 903, 114453, 2831, 37202, 4488, 5885...	[ 0.192626953125, 0.16015625, 0.261962890625, 0.115966796875, 0.162841796875, 0.1334228515625, 0.1512451171875, 0.00567626953125, 0.1224365234375, 0.25927734375, 0.09521484375, 0.143310546875, 0.0921630859375, 0.2052001953125, 0.1339111328125, 0.09912109375, 0.045013427734375, 0.1019...	embed
35816074_c0	35816074	haskell	0	Title: Haskell Yesod - extracting a object inside a json before converting it to a model Problem title: Haskell Yesod - extracting a object inside a json before converting it to a model Tags: yesod, haskell, aeson Problem: Haskell Yesod - extracting a object inside a json before converting it to a model Suppose I have ...	Haskell Yesod - extracting a object inside a json before converting it to a model Haskell Yesod - extracting a object inside a json before converting it to a model yesod haskell aeson Haskell Yesod Handler Entity Key MyEntity status204 UPDATED Text JSON Haskell Yesod - extracting a object inside a json before convertin...	[ -0.0206298828125, 0.0186767578125, -0.007354736328125, -0.0040283203125, -0.00299072265625, 0.0135498046875, -0.0150146484375, -0.006866455078125, 0.00445556640625, -0.068359375, -0.0047607421875, 0.0078125, -0.0167236328125, -0.00958251953125, 0.03515625, -0.004058837890625, -0.0005...	[ 20625, 142508, 32635, 2199, 20, 125663, 214, 36746, 46132, 1647, 1681, 8108, 96760, 47, 3299, 10, 2422, 23722, 1556, 90, 191, 10639, 603, 16511, 2481, 26824, 2646, 7768, 18, 10778, 147758, 161521, 24129, 821, 58627, 121691, 765, 1884, 27, ...	[ 0.1707763671875, 0.2462158203125, 0.2080078125, 0.284912109375, 0.0107421875, 0.2100830078125, 0.064697265625, 0.18017578125, 0.16552734375, 0.133544921875, 0.2044677734375, 0.1253662109375, 0.1246337890625, 0.0281829833984375, 0.25390625, 0.024658203125, 0.1370849609375, 0.2116699...	embed
23183951_c0	23183951	haskell	0	Title: How to query the unification type to ghci? Problem title: How to query the unification type to ghci? Tags: unification, types, haskell, ghci Problem: How to query the unification type to ghci? It is possible to query ghci for an unification type? For example, if I want to know the type of the unification between...	How to query the unification type to ghci? How to query the unification type to ghci? unification types haskell ghci How Bool How to query the unification type to ghci? It is possible to query ghci for an unification type? For example, if I want to know the type of the unification between (Int -> Bool) and (a -> Bool) ...	[ 0.006134033203125, 0.00157928466796875, 0.008544921875, 0.0201416015625, -0.0191650390625, -0.00191497802734375, -0.0101318359375, -0.00180816650390625, -0.00128936767578125, -0.007537841796875, -0.0030364990234375, -0.027099609375, 0.0120849609375, -0.01165771484375, -0.00555419921875, ...	[ 11249, 47, 41, 1294, 70, 51, 41274, 10644, 31380, 318, 52895, 1556, 142508, 2460, 929, 7722, 100, 3444, 3714, 17721, 4153, 18, 33079, 136, 11, 3642, 831, 903, 86869, 81979, 5847, 3742, 50960, 20625, 34734, 2480, 27958, 219584 ]	[ 0.09197998046875, 0.11572265625, 0.1187744140625, 0.1217041015625, 0.00482177734375, 0.1591796875, 0.17431640625, 0.2081298828125, 0.1480712890625, 0.18408203125, 0.14892578125, 0.110107421875, 0.1776123046875, 0.0821533203125, 0.1763916015625, 0.0732421875, 0.01324462890625, 0.006...	embed
41227219_c0	41227219	haskell	0	Title: mapAccumR -like recursion scheme over Fix? Problem title: mapAccumR -like recursion scheme over Fix? Tags: recursion-schemes, haskell Problem: mapAccumR -like recursion scheme over Fix? I'm playing with the functions from recursion-schemes , and struggling to figure out if it offers something that generalized ma...	mapAccumR -like recursion scheme over Fix? mapAccumR -like recursion scheme over Fix? recursion-schemes haskell Fix x:xs Empty mapAccumR -like recursion scheme over Fix? I'm playing with the functions from recursion-schemes , and struggling to figure out if it offers something that generalized mapAccumR . Something pow...	[ -0.003997802734375, 0.0166015625, 0.016357421875, 0.006134033203125, 0.0001506805419921875, -0.004913330078125, 0.0101318359375, -0.029541015625, 0.0036468505859375, 0.00927734375, 0.033447265625, -0.01708984375, 0.0005950927734375, 0.0123291015625, 0.038818359375, 0.0062255859375, -...	[ 22288, 39450, 10591, 1052, 5062, 195625, 1830, 150370, 645, 96746, 7560, 3716, 1556, 142508, 1022, 12, 425, 31678, 939, 75169, 32354, 237875, 26366, 64600, 4537, 29367, 113138, 29479, 11001, 27875, 297, 45646, 97, 53, 519, 37202, 110518, 3444...	[ 0.1585693359375, 0.05865478515625, 0.2147216796875, 0.2030029296875, 0.139404296875, 0.2020263671875, 0.0855712890625, 0.197265625, 0.09136962890625, 0.2474365234375, 0.1480712890625, 0.1077880859375, 0.1092529296875, 0.2315673828125, 0.05572509765625, 0.03369140625, 0.07568359375, ...	embed
73503418_c1	73503418	haskell	1	MsgPkt m 'AskMD) ~ 'Yes) => Cached (AnyMsgPkt 'AskMD) where fromCache mbExpir ip v cst = do Val valExpir dat <- M.lookup (Key ip 0 $ hash v) cst expir <- mbExpir False <- pure (valExpir < expir) _ <- concrMsg @m dat pure dat toCache expir ip v ans cst = M.insert (Key ip 0 $ hash v) (Val expir ans) cst fff = toCache @'R...	MsgPkt m 'AskMD) ~ 'Yes) => Cached (AnyMsgPkt 'AskMD) where fromCache mbExpir ip v cst = do Val valExpir dat <- M.lookup (Key ip 0 $ hash v) cst expir <- mbExpir False <- pure (valExpir < expir) _ <- concrMsg @m dat pure dat toCache expir ip v ans cst = M.insert (Key ip 0 $ hash v) (Val expir ans) cst fff = toCache @'R...	[ -0.00762939453125, -0.0022125244140625, -0.004730224609375, -0.00836181640625, 0.01129150390625, -0.0084228515625, 0.00122833251953125, 0.01519775390625, 0.0164794921875, -0.048583984375, 0.01031494140625, 0.009765625, 0.025146484375, 0.01287841796875, -0.01177978515625, -0.00181579589...	[ 70802, 177, 683, 4164, 347, 284, 1042, 44644, 91480, 2041, 74694, 299, 7, 1295, 441, 46994, 39369, 19279, 21738, 254, 81, 271, 4769, 3502, 607, 276, 64747, 2037, 162429, 757, 3650, 1556, 127, 14700, 481, 22225, 34166, 1405, 158, 23150, ...	[ 0.1373291015625, 0.161376953125, 0.1357421875, 0.2174072265625, 0.0902099609375, 0.0809326171875, 0.178955078125, 0.2047119140625, 0.146240234375, 0.1741943359375, 0.2314453125, 0.071044921875, 0.0838623046875, 0.053497314453125, 0.07440185546875, 0.205810546875, 0.0496826171875, 0...	embed
76381214_c0	76381214	haskell	0	Title: Reusing functional dependency as a type function Problem title: Reusing functional dependency as a type function Tags: haskell Problem: Reusing functional dependency as a type function I have a typeclass that uses functional dependency and example instance: class (KnownSymbol name) => MyClass name result \| name ...	Reusing functional dependency as a type function Reusing functional dependency as a type function haskell Reusing KnownSymbol MyClass GetType CanGetType RHS All LHS Reusing functional dependency as a type function I have a typeclass that uses functional dependency and example instance: How can I reuse this and get a ty...	[ -0.00116729736328125, -0.005279541015625, 0.004608154296875, 0.0074462890625, -0.0126953125, -0.0062255859375, -0.01531982421875, 0.0062255859375, 0.0031280517578125, -0.0301513671875, -0.00750732421875, -0.0242919921875, -0.0036163330078125, 0.01953125, 0.01104736328125, 0.00439453125...	[ 137336, 214, 123309, 42548, 27771, 237, 10644, 32354, 1556, 142508, 70829, 65183, 36846, 2646, 140803, 20779, 196707, 4171, 724, 126, 68416, 294, 3164, 339, 38131, 67413, 4527, 27781, 110527, 11249, 831, 156883, 2046, 67919, 64113, 58, 30646, ...	[ 0.2254638671875, 0.04107666015625, 0.2069091796875, 0.1851806640625, 0.1083984375, 0.07794189453125, 0.218994140625, 0.1993408203125, 0.111572265625, 0.19970703125, 0.0992431640625, 0.0679931640625, 0.1695556640625, 0.100341796875, 0.180908203125, 0.13916015625, 0.292236328125, 0.0...	embed
46031533_c0	46031533	haskell	0	Title: Derived instance in Haskell Problem title: Derived instance in Haskell Tags: haskell, deriving Problem: Derived instance in Haskell I would like to use derived instance like this: data Test3D = forall a. (Show a, Eq a, Typeable a, Generic a) => Test3D { testDt :: String , testPrm :: a } deriving (Show, Eq, Typea...	Derived instance in Haskell Derived instance in Haskell haskell deriving Derived Haskell Test3D Show Typeable Generic Binary Can Constructor Possible Derived instance in Haskell I would like to use derived instance like this: But I received from GHC: This way is very convenient for my project. I can not find the soluti...	[ 0.00848388671875, 0.004486083984375, 0.0108642578125, 0.009765625, 0.0169677734375, -0.006256103515625, 0.0074462890625, 0.01336669921875, 0.0028228759765625, -0.0263671875, -0.01141357421875, -0.00982666015625, 0.00994873046875, 0.0107421875, -0.023681640625, -0.003570556640625, 0.0...	[ 1310, 14, 4126, 110527, 20625, 142508, 23, 1556, 16406, 6496, 8647, 363, 397, 17367, 60457, 2886, 88342, 54092, 1294, 4171, 82084, 18770, 115861, 2661, 2806, 1884, 4527, 903, 4966, 75204, 1295, 527, 73265, 3293, 3917, 83, 4552, 142267, 759,...	[ 0.16748046875, 0.169189453125, 0.1942138671875, 0.268310546875, 0.140869140625, 0.2337646484375, 0.0278167724609375, 0.128662109375, 0.19189453125, 0.050689697265625, 0.131103515625, 0.06591796875, 0.0711669921875, 0.09033203125, 0.164306640625, 0.1087646484375, 0.0899658203125, 0....	embed
6970304_c0	6970304	haskell	0	Title: Infuriating Tab problem in Vim, in literate Haskell Problem title: Infuriating Tab problem in Vim, in literate Haskell Tags: haskell, literate-programming, tabs, vim Problem: Infuriating Tab problem in Vim, in literate Haskell I am using "Bird" style literate haskell, which requires all code to be like the follo...	Infuriating Tab problem in Vim, in literate Haskell Infuriating Tab problem in Vim, in literate Haskell haskell literate-programming tabs vim Infuriating Tab Vim Haskell Main Infuriating Tab problem in Vim, in literate Haskell I am using "Bird" style literate haskell, which requires all code to be like the following: a...	[ 0.0267333984375, 0.0017852783203125, -0.00640869140625, -0.0198974609375, -0.000766754150390625, 0.0023040771484375, 0.0145263671875, 0.01318359375, -0.01434326171875, -0.031494140625, 0.0184326171875, -0.0120849609375, -0.021484375, -0.01165771484375, -0.0142822265625, -0.010192871093...	[ 46757, 1162, 26518, 22193, 2967, 582, 39, 80109, 13, 20625, 142508, 23, 1556, 28966, 20928, 119916, 12321, 17368, 41153, 71, 20623, 144570, 756, 18151, 1884, 25632, 2174, 46389, 5608, 6713, 903, 3021, 33306, 3229, 30957, 5386, 24092, 32628, ...	[ 0.11669921875, 0.1988525390625, 0.138671875, 0.254150390625, 0.162353515625, 0.177001953125, 0.19775390625, 0.148681640625, 0.06524658203125, 0.1092529296875, 0.2091064453125, 0.002655029296875, 0.126953125, 0.05859375, 0.2303466796875, 0.2225341796875, 0.044586181640625, 0.0488281...	embed
32873037_c0	32873037	haskell	0	Title: Verifty if a tree is BST or not using Haskell Problem title: Verifty if a tree is BST or not using Haskell Tags: haskell Problem: Verifty if a tree is BST or not using Haskell Hello I am new to Haskell and trying to write a function to check if a tree is binary search tree or not . Below is my code :- data Tree ...	Verifty if a tree is BST or not using Haskell Verifty if a tree is BST or not using Haskell haskell Haskell Verifty BST Tree Node Leaf Show Bool Not Verifty if a tree is BST or not using Haskell Hello I am new to Haskell and trying to write a function to check if a tree is binary search tree or not . Below is my code :...	[ 0.0089111328125, 0.00628662109375, -0.00128173828125, -0.009765625, 0.031005859375, 0.00848388671875, -0.025390625, -0.0286865234375, -0.0234375, -0.0113525390625, -0.015380859375, -0.00579833984375, 0.0162353515625, -0.00567626953125, -0.002227783203125, 0.0133056640625, 0.020874023...	[ 1446, 3190, 939, 2174, 53201, 83, 335, 8545, 707, 959, 17368, 20625, 142508, 1556, 101344, 438, 112, 636, 2407, 17367, 2460, 929, 11205, 3525, 33022, 32354, 12765, 2394, 6635, 33938, 17336, 18151, 4966, 2046, 25632, 18499, 3229, 71924, 4358...	[ 0.1683349609375, 0.162353515625, 0.14794921875, 0.07269287109375, 0.251220703125, 0.117919921875, 0.1090087890625, 0.20654296875, 0.07244873046875, 0.13720703125, 0.1468505859375, 0.13525390625, 0.252685546875, 0.1265869140625, 0.2020263671875, 0.08392333984375, 0.055328369140625, ...	embed
13752014_c0	13752014	haskell	0	Title: Ambiguous type variable with HashMap Problem title: Ambiguous type variable with HashMap Tags: haskell Problem: Ambiguous type variable with HashMap I recently starting to play with haskell and I came across a problem while using HashMap that can be illustrated by this toy example: import Data.HashMap as HashMap...	Ambiguous type variable with HashMap Ambiguous type variable with HashMap haskell TypeError Data.HashMap the a Ambiguous HashMap HashMap.insert HashMap.empty Prelude List TypeError.hs Compiling Main TypeError.hs:3:22 Num TypeError.hs:3:22-23 Ord TypeError.hs:3:7-20 Data.Hashable.Hashable Possible Map Integer TypeError....	[ -0.01123046875, -0.00799560546875, -0.01507568359375, 0.01019287109375, 0.005401611328125, -0.00927734375, -0.015869140625, 0.0155029296875, -0.0172119140625, -0.0302734375, -0.00384521484375, -0.01470947265625, 0.00836181640625, 0.01092529296875, 0.01483154296875, -0.005126953125, 0...	[ 10250, 12282, 10821, 10644, 77336, 678, 162087, 166179, 1556, 142508, 60457, 18468, 31611, 11809, 6495, 1495, 33657, 33548, 1914, 822, 32036, 127, 15612, 49725, 12321, 363, 24070, 52782, 37620, 35379, 11033, 2886, 115861, 42719, 44401, 19721, 1...	[ 0.1796875, 0.2298583984375, 0.09814453125, 0.1734619140625, 0.2357177734375, 0.0728759765625, 0.1663818359375, 0.229248046875, 0.132568359375, 0.2191162109375, 0.18115234375, 0.1636962890625, 0.125, 0.08447265625, 0.11669921875, 0.09173583984375, 0.0701904296875, 0.08447265625, 0...	embed
34244574_c0	34244574	haskell	0	Title: Trouble understanding the type of sequence [Just, Just] Problem title: Trouble understanding the type of sequence [Just, Just] Tags: haskell Problem: Trouble understanding the type of sequence [Just, Just] I'm confused as to why I got this in GHCi :t sequence [Just,Just] sequence [Just, Just] :: a -> [Maybe a] T...	Trouble understanding the type of sequence [Just, Just] Trouble understanding the type of sequence [Just, Just] haskell Trouble Just Maybe Num Monad Traversable Trouble understanding the type of sequence [Just, Just] I'm confused as to why I got this in GHCi To elaborate, I can understand sequence [Just 1, Just 2] :: N...	[ 0.0076904296875, 0.0216064453125, -0.0098876953125, 0.029052734375, 0.0205078125, 0.00689697265625, -0.0018157958984375, 0.006103515625, 0.006988525390625, -0.0201416015625, 0.0031585693359375, -0.0233154296875, -0.0031585693359375, 0.0245361328125, -0.00029754638671875, -0.00512695312...	[ 119671, 2661, 100094, 10644, 40, 944, 3956, 127794, 4, 9563, 1556, 142508, 83425, 52782, 60331, 71, 7864, 2886, 55681, 15400, 4163, 903, 23, 527, 73265, 14, 121151, 831, 28219, 106, 116, 1984, 10, 44357, 11, 16487, 34735, 32354, 51776, 42...	[ 0.14013671875, 0.0784912109375, 0.141357421875, 0.159423828125, 0.07427978515625, 0.153076171875, 0.1192626953125, 0.189453125, 0.0118408203125, 0.2298583984375, 0.147705078125, 0.2474365234375, 0.203125, 0.172119140625, 0.14697265625, 0.1153564453125, 0.07763671875, 0.093017578125...	embed
16205086_c0	16205086	haskell	0	Title: Haskell Writing myLength Problem title: Haskell Writing myLength Tags: haskell Problem: Haskell Writing myLength I was working on this page http://www.haskell.org/haskellwiki/99_questions/Solutions/4 I understand what each function means and it is fun to see that a function can be defined in numerous ways like t...	Haskell Writing myLength Haskell Writing myLength haskell Haskell Writing Prelude x:xs Haskell Writing myLength I was working on this page http://www.haskell.org/haskellwiki/99_questions/Solutions/4 I understand what each function means and it is fun to see that a function can be defined in numerous ways like this. How...	[ -0.02001953125, 0.02734375, 0.00933837890625, -0.00122833251953125, -0.00139617919921875, -0.007232666015625, -0.0015716552734375, 0.00726318359375, 0.01397705078125, -0.05517578125, 0.01373291015625, 0.000049591064453125, 0.0157470703125, 0.0196533203125, 0.020751953125, -0.0095825195...	[ 20625, 142508, 213185, 759, 5267, 449, 927, 1556, 1914, 822, 112, 1022, 425, 20697, 98, 5, 10557, 13691, 5046, 7162, 5256, 102588, 34, 17357, 28219, 12638, 32354, 26950, 136, 442, 83, 7477, 47, 1957, 450, 831, 186, 61924, 71, 23, 183851...	[ 0.1451416015625, 0.236328125, 0.2325439453125, 0.1544189453125, 0.1583251953125, 0.208251953125, 0.149658203125, 0.138671875, 0.1605224609375, 0.2418212890625, 0.19287109375, 0.0296630859375, 0.07781982421875, 0.06011962890625, 0.00286865234375, 0.00732421875, 0.0789794921875, 0.05...	embed
41210599_c0	41210599	haskell	0	Title: ApplicativeDo not working with sequencing Problem title: ApplicativeDo not working with sequencing Tags: haskell, monads, do-notation, applicative Problem: ApplicativeDo not working with sequencing I have this type, basically a Kleisli arrow: {-# language DeriveFunctor #-} data Plan m i o = Plan (i -> m o) deriv...	ApplicativeDo not working with sequencing ApplicativeDo not working with sequencing haskell monads do-notation applicative a ApplicativeDo DeriveFunctor Plan Functor Monad Applicative ApplicativeDo not working with sequencing I have this type, basically a Kleisli arrow: Since it has an Applicative instance, I turn on A...	[ -0.00970458984375, 0.029296875, -0.0087890625, 0.0201416015625, -0.0185546875, 0.0235595703125, 0.0162353515625, 0.00164794921875, 0.016845703125, -0.0242919921875, 0.012451171875, 0.0004711151123046875, -0.018798828125, 0.02001953125, 0.0078125, -0.00946044921875, 0.000701904296875,...	[ 5659, 11048, 4935, 8331, 959, 20697, 678, 40, 944, 60636, 1556, 142508, 2667, 712, 54, 157, 22062, 41816, 1310, 5844, 97249, 18770, 5586, 28670, 60331, 71, 903, 10644, 198343, 24798, 164, 150, 118201, 110527, 15504, 98, 9790, 45367, 10, 3...	[ 0.1334228515625, 0.1751708984375, 0.1790771484375, 0.154541015625, 0.133056640625, 0.1422119140625, 0.12890625, 0.0989990234375, 0.146728515625, 0.110107421875, 0.1085205078125, 0.2159423828125, 0.0921630859375, 0.115966796875, 0.158447265625, 0.1495361328125, 0.0897216796875, 0.19...	embed
20785300_c0	20785300	haskell	0	Title: Parallel Computer Simulator Problem title: Parallel Computer Simulator Tags: language-agnostic, parallel-processing, developer-tools, haskell Problem: Parallel Computer Simulator I am using Haskell, which reported to be great and easy for parallelism. Unfortunately, I have no way to test this claim, as my comput...	Parallel Computer Simulator Parallel Computer Simulator language-agnostic parallel-processing developer-tools haskell Parallel Computer Simulator Parallel Computer Simulator I am using Haskell, which reported to be great and easy for parallelism. Unfortunately, I have no way to test this claim, as my computer has a sin...	[ -0.00323486328125, 0.0155029296875, -0.0146484375, 0.0146484375, -0.01104736328125, -0.003143310546875, -0.002227783203125, -0.007476806640625, -0.00022125244140625, -0.04296875, -0.005859375, 0.0169677734375, 0.0228271484375, 0.0130615234375, 0.00119781494140625, 0.006683349609375, ...	[ 211485, 40139, 144814, 1290, 46876, 2703, 2895, 95103, 63923, 214, 106001, 89110, 1556, 142508, 17368, 20625, 113771, 6782, 23468, 100, 8780, 185397, 3917, 3034, 63043, 13909, 11001, 14543, 42, 35672, 3714, 19537, 1221, 3249, 108975, 237, 2174,...	[ 0.252685546875, 0.133544921875, 0.2423095703125, 0.124755859375, 0.123046875, 0.0185699462890625, 0.139404296875, 0.267333984375, 0.1104736328125, 0.003082275390625, 0.122314453125, 0.18798828125, 0.1693115234375, 0.26708984375, 0.1239013671875, 0.166259765625, 0.06396484375, 0.064...	embed
45491709_c1	45491709	haskell	1	Configuring pcre-light-0.4.0.4... Cabal-simple_Z6RU0evB_1.24.2.0_ghc-8.0.2.exe: The program 'pkg-config' version >=0.9.0 is required but it could not be found. I've searched around a bit for a solution but couldn't find much. I also tried following the quick start guide on the Yesod website but that didn't fix anythin...	Configuring pcre-light-0.4.0.4... Cabal-simple_Z6RU0evB_1.24.2.0_ghc-8.0.2.exe: The program 'pkg-config' version >=0.9.0 is required but it could not be found. I've searched around a bit for a solution but couldn't find much. I also tried following the quick start guide on the Yesod website but that didn't fix anythin...	[ -0.014404296875, 0.03173828125, 0.016845703125, 0.00390625, -0.005096435546875, 0.0096435546875, -0.01470947265625, -0.001190185546875, -0.01287841796875, 0.000743865966796875, 0.01324462890625, -0.0289306640625, -0.000652313232421875, -0.029296875, 0.007537841796875, 0.00946044921875,...	[ 1657, 59994, 214, 36719, 107, 20016, 121254, 30438, 289, 191560, 1511, 910, 17759, 4854, 571, 20682, 73011, 9486, 238, 17376, 133684, 46480, 1528, 254, 8517, 9, 153837, 11389, 977, 145407, 38331, 2389, 56065, 1284, 442, 5809, 959, 186, 1403...	[ 0.08843994140625, 0.2235107421875, 0.0225677490234375, 0.07623291015625, 0.2188720703125, 0.2437744140625, 0.2069091796875, 0.174072265625, 0.1429443359375, 0.1771240234375, 0.03985595703125, 0.0181121826171875, 0.078857421875, 0.0921630859375, 0.05596923828125, 0.1204833984375, 0.12...	embed
59763149_c0	59763149	haskell	0	Title: Different results produced by stack runghc vs stack ghci Haskell Problem title: Different results produced by stack runghc vs stack ghci Haskell Tags: haskell-stack, haskell, megaparsec Problem: Different results produced by stack runghc vs stack ghci Haskell I'm writing a parser using Megaparsec. Basically, the...	Different results produced by stack runghc vs stack ghci Haskell Different results produced by stack runghc vs stack ghci Haskell haskell-stack haskell megaparsec Different Haskell Different results produced by stack runghc vs stack ghci Haskell I'm writing a parser using Megaparsec. Basically, the main file will open ...	[ -0.0057373046875, 0.001190185546875, 0.00156402587890625, 0.0157470703125, -0.005157470703125, 0.005401611328125, -0.006072998046875, -0.01068115234375, 0.001373291015625, -0.0042724609375, -0.0177001953125, -0.0086669921875, 0.01434326171875, 0.0181884765625, 0.00860595703125, 0.00393...	[ 242520, 50339, 181653, 177261, 120649, 127, 238, 20209, 31380, 318, 20625, 142508, 1556, 590, 2594, 31534, 2500, 39797, 390, 32562, 366, 2189, 17368, 26842, 5201, 11435, 1221, 9803, 12301, 10941, 6953, 51042, 26818, 26785, 566, 177, 5759, 123...	[ 0.1641845703125, 0.1744384765625, 0.1397705078125, 0.2115478515625, 0.1329345703125, 0.1240234375, 0.161376953125, 0.0992431640625, 0.126220703125, 0.2000732421875, 0.1326904296875, 0.257568359375, 0.10888671875, 0.094482421875, 0.1334228515625, 0.13232421875, 0.1158447265625, 0.20...	embed
37175877_c0	37175877	haskell	0	Title: Limiting the Types that a Type Paramater Can Take On in Data Declarations Problem title: Limiting the Types that a Type Paramater Can Take On in Data Declarations Tags: types, haskell, singleton-type Problem: Limiting the Types that a Type Paramater Can Take On in Data Declarations I'm aware that Haskell has par...	Limiting the Types that a Type Paramater Can Take On in Data Declarations Limiting the Types that a Type Paramater Can Take On in Data Declarations types haskell singleton-type Limiting Types Type Paramater Can Take Data Declarations Maybe Nothing Just Tag TagPrimitive TagComplex Integer Limiting the Types that a Type ...	[ -0.00119781494140625, 0.0145263671875, 0.00537109375, 0.0036468505859375, 0.0174560546875, 0.0086669921875, -0.00860595703125, 0.0014495849609375, -0.007232666015625, -0.01251220703125, 0.00078582763671875, -0.05078125, -0.00567626953125, -0.009765625, 0.0169677734375, 0.0174560546875,...	[ 125177, 214, 60457, 1720, 192, 720, 4171, 46673, 2161, 11809, 98501, 52895, 1556, 142508, 11001, 1507, 50986, 83425, 182747, 4837, 145111, 10770, 44974, 44401, 23, 107419, 20625, 121, 90306, 64807, 2053, 3917, 17475, 12096, 831, 8, 48345, 188...	[ 0.203125, 0.049957275390625, 0.227783203125, 0.1151123046875, 0.0968017578125, 0.1435546875, 0.0697021484375, 0.09429931640625, 0.166015625, 0.1292724609375, 0.2132568359375, 0.240966796875, 0.128173828125, 0.260986328125, 0.10687255859375, 0.15185546875, 0.1812744140625, 0.0158843...	embed
52673595_c0	52673595	haskell	0	Title: Multiple 'Just x' for 'case maybeVal of' in haskell Problem title: Multiple 'Just x' for 'case maybeVal of' in haskell Tags: haskell, switch-statement, option-type Problem: Multiple 'Just x' for 'case maybeVal of' in haskell Do multiple 'Just' cases work in haskell, and in...	Multiple 'Just x' for 'case maybeVal of' in haskell Multiple 'Just x' for 'case maybeVal of' in haskell haskell switch-statement option-type Multiple Just Ord Maybe Nothing Hello Multiple 'Just x' for 'case maybeVal of' in haskell Do multiple 'Just' cases work in haskell, and in ...	[ -0.0084228515625, -0.00341796875, 0.005340576171875, -0.000751495361328125, 0.00946044921875, 0.002655029296875, 0.0091552734375, 0.002960205078125, 0.0068359375, 0.00982666015625, 0.0098876953125, -0.01019287109375, -0.006103515625, -0.015869140625, -0.0029296875, 0.0054931640625, -...	[ 19335, 8705, 3768, 127794, 1022, 100, 58437, 51139, 42272, 111, 23, 1556, 142508, 101089, 61340, 35829, 50986, 9563, 35379, 83425, 182747, 35378, 984, 48716, 50218, 4488, 12989, 87293, 1632, 48903, 30441, 83, 158012, 5117, 60075, 13, 89829, 1...	[ 0.203369140625, 0.197265625, 0.068359375, 0.268798828125, 0.131103515625, 0.0810546875, 0.1790771484375, 0.1451416015625, 0.17236328125, 0.1939697265625, 0.05731201171875, 0.1378173828125, 0.2275390625, 0.1248779296875, 0.07745361328125, 0.141357421875, 0.07830810546875, 0.21032714...	embed
70641362_c0	70641362	haskell	0	Title: Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ Problem title: Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ Tags: function, haskell Problem: Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ I want to write a function that returns the longest pr...	Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ function haskell Couldn Bool Ord x:xs Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ I want to write a function that returns the longest prefix of a list, w...	[ 0.00579833984375, 0.0140380859375, 0.0021820068359375, -0.00689697265625, 0.00299072265625, 0.0045166015625, 0.0030975341796875, 0.00384521484375, 0.021240234375, 0.0050048828125, 0.01080322265625, 0.0036163330078125, 0.003997802734375, -0.0069580078125, 0.01251220703125, 0.00442504882...	[ 191147, 19, 3768, 18, 14858, 84751, 10644, 12647, 929, 678, 8561, 11, 5386, 2460, 32354, 1556, 142508, 35379, 1022, 12, 425, 33079, 3444, 33022, 30646, 4989, 525, 183114, 5303, 59911, 10, 11907, 35735, 27489, 81113, 82800, 214, 3293, 18151,...	[ 0.1103515625, 0.07568359375, 0.0966796875, 0.1055908203125, 0.189697265625, 0.1588134765625, 0.1722412109375, 0.125, 0.21240234375, 0.09619140625, 0.1280517578125, 0.0904541015625, 0.10498046875, 0.1171875, 0.1708984375, 0.1485595703125, 0.2479248046875, 0.1761474609375, 0.068115...	embed
76299436_c0	76299436	haskell	0	Title: Haskell - compute frequencies of elements in a list Problem title: Haskell - compute frequencies of elements in a list Tags: fold, frequency, dictionary, haskell, counter Problem: Haskell - compute frequencies of elements in a list I need to compute a frequency map of an input list. My attempt: f :: (Eq a, Ord a...	Haskell - compute frequencies of elements in a list Haskell - compute frequencies of elements in a list fold frequency dictionary haskell counter Haskell Ord Map.Map Map.alter Map.findWithDefault Map.fromList Haskell - compute frequencies of elements in a list I need to compute a frequency map of an input list. My atte...	[ -0.00958251953125, -0.00112152099609375, 0.000553131103515625, -0.0205078125, -0.0172119140625, -0.004730224609375, -0.002777099609375, -0.01043701171875, 0.00469970703125, -0.0181884765625, -0.00799560546875, 0.00347900390625, 0.02978515625, 0.05859375, -0.004058837890625, -0.01257324...	[ 20625, 142508, 9969, 6743, 12478, 944, 117538, 80854, 23, 5303, 20, 111, 10, 42822, 27771, 45, 10763, 1556, 105416, 35379, 42719, 166179, 5, 48283, 111607, 194583, 187423, 11, 161063, 154663, 3871, 22288, 107730, 81887, 9393, 36917, 14602, 95...	[ 0.1795654296875, 0.27978515625, 0.144287109375, 0.1402587890625, 0.2176513671875, 0.2020263671875, 0.1219482421875, 0.211669921875, 0.0670166015625, 0.208740234375, 0.00506591796875, 0.043365478515625, 0.0189056396484375, 0.1781005859375, 0.103759765625, 0.027008056640625, 0.08441162...	embed
30822148_c1	30822148	haskell	1	newMap Map.! c, s):out) else compress x m i (c++[s]) out compress s m i c out = compress2 out compress2 :: [(Int,Char)]-> [(Int,Char)] compress2 out = trace("COMPRESSION FINISHED") out decompress :: [(Int,Char)] -> Map.Map Int String -> Int -> String -> String decompress (s:x) m i out = do if fst s == 0 then do let new...	newMap Map.! c, s):out) else compress x m i (c++[s]) out compress s m i c out = compress2 out compress2 :: [(Int,Char)]-> [(Int,Char)] compress2 out = trace("COMPRESSION FINISHED") out decompress :: [(Int,Char)] -> Map.Map Int String -> Int -> String -> String decompress (s:x) m i out = do if fst s == 0 then do let new...	[ -0.0238037109375, 0.0159912109375, 0.000789642333984375, 0.0277099609375, -0.005218505859375, 0.0137939453125, -0.000301361083984375, 0.013671875, 0.020751953125, 0.0289306640625, 0.0107421875, 0.0145263671875, 0.01080322265625, 0.01007080078125, -0.004974365234375, 0.00750732421875, ...	[ 3525, 166179, 42719, 38, 501, 4, 91, 2077, 6056, 37076, 375, 11856, 1022, 347, 17, 238, 37223, 7, 1810, 2203, 304, 1984, 4153, 18, 84068, 144851, 16113, 96547, 67227, 79909, 17610, 8, 277, 5, 360, 23351, 12, 425, 54, 1238, 271, 69112,...	[ 0.191650390625, 0.2568359375, 0.25732421875, 0.057220458984375, 0.051422119140625, 0.0197296142578125, 0.1248779296875, 0.00152587890625, 0.1402587890625, 0.0626220703125, 0.17236328125, 0.268310546875, 0.1146240234375, 0.112060546875, 0.1329345703125, 0.05877685546875, 0.20153808593...	embed
1816092_c1	1816092	haskell	1	fc5aa85daf318eeff084d98e2cff92578f; path=/; expires=Wed, 01 Jan 2020 08:00:00 GMT; HttpOnly Cache-Control: no-cache As far as I know, the Location should be a link to the new Gist. However, no new Gist is made. I'm not sure what I'm doing wrong. There is basically no documentation for the Gist API, and the only thing I...	fc5aa85daf318eeff084d98e2cff92578f; path=/; expires=Wed, 01 Jan 2020 08:00:00 GMT; HttpOnly Cache-Control: no-cache As far as I know, the Location should be a link to the new Gist. However, no new Gist is made. I'm not sure what I'm doing wrong. There is basically no documentation for the Gist API, and the only thing I...	[ -0.011962890625, 0.01068115234375, 0.00494384765625, -0.01422119140625, 0.009033203125, 0.032958984375, -0.008056640625, -0.0019683837890625, 0.0030975341796875, -0.0034332275390625, 0.01226806640625, -0.02978515625, -0.024169921875, -0.0220947265625, -0.0264892578125, 0.00506591796875...	[ 12951, 16665, 183282, 60875, 14700, 50964, 3413, 3342, 11075, 70126, 99961, 3062, 20320, 538, 2041, 1430, 175904, 110, 408, 90788, 5608, 186, 3126, 3525, 527, 1419, 33306, 83, 7228, 9077, 20594, 44691, 209806, 61687, 41591, 3900, 143, 158189,...	[ 0.046661376953125, 0.00604248046875, 0.0166168212890625, 0.1170654296875, 0.079345703125, 0.0772705078125, 0.03887939453125, 0.13427734375, 0.114013671875, 0.04022216796875, 0.103515625, 0.047576904296875, 0.0970458984375, 0.05731201171875, 0.0927734375, 0.09906005859375, 0.204711914...	embed
73932215_c1	73932215	haskell	1	g = let rightNeighbours = getNodeNeighbours (getNode u g) leftNeihbours = getNodeNeighbours (getNode v g) in rightNeighbours ++ leftNeihbours -- Get a node given its node id getNode :: Eq a => a -> Graph a -> (a, [a]) getNode y (Graph []) = (y, []) getNode y (Graph (x : xs)) \| y == fst x = x \| otherwise = getNode y (G...	g = let rightNeighbours = getNodeNeighbours (getNode u g) leftNeihbours = getNodeNeighbours (getNode v g) in rightNeighbours ++ leftNeihbours -- Get a node given its node id getNode :: Eq a => a -> Graph a -> (a, [a]) getNode y (Graph []) = (y, []) getNode y (Graph (x : xs)) \| y == fst x = x \| otherwise = getNode y (G...	[ -0.0283203125, 0.01483154296875, 0.016845703125, -0.00830078125, -0.005462646484375, 0.00927734375, -0.01275634765625, -0.00579833984375, 0.0211181640625, -0.01324462890625, 0.0140380859375, -0.022705078125, -0.009033203125, 0.02197265625, -0.0003070831298828125, 0.009033203125, -0.0...	[ 706, 2633, 7108, 6433, 6958, 38648, 2046, 5021, 112, 3794, 75, 25737, 1043, 81, 37223, 20779, 110, 34475, 3447, 864, 6524, 11727, 10, 113, 37878, 53, 1022, 271, 3871, 3917, 26292, 2831, 7440, 9232, 5983, 5036, 678, 9844, 51776, 12638, 1...	[ 0.1533203125, 0.139892578125, 0.160888671875, 0.069580078125, 0.152587890625, 0.1895751953125, 0.1324462890625, 0.18310546875, 0.157470703125, 0.082763671875, 0.13427734375, 0.172607421875, 0.0870361328125, 0.190673828125, 0.1173095703125, 0.10638427734375, 0.1641845703125, 0.04885...	embed
754279_c1	754279	haskell	1	Strings, but for the style of programming that is of limited usefulness, since I want to other stream functions to act on the strings themselves, not on actions that can produce a string. But, based on thinking through the other responses, I think I see why this is unsolvable in general. In the simple case I presented...	Strings, but for the style of programming that is of limited usefulness, since I want to other stream functions to act on the strings themselves, not on actions that can produce a string. But, based on thinking through the other responses, I think I see why this is unsolvable in general. In the simple case I presented...	[ -0.0064697265625, 0.0162353515625, -0.0164794921875, -0.000186920166015625, 0.00518798828125, 0.00142669677734375, 0.0186767578125, 0.0001049041748046875, 0.0157470703125, -0.007659912109375, 0.0189208984375, -0.024658203125, 0.0269775390625, 0.01470947265625, -0.0174560546875, -0.0027...	[ 23351, 5180, 1284, 100, 20623, 56037, 449, 84046, 80234, 3444, 3789, 75973, 32354, 27992, 98, 79315, 7, 61261, 61972, 831, 27489, 47644, 57553, 15400, 51, 132944, 2886, 4537, 8781, 7225, 2367, 6183, 36663, 40, 944, 3956, 39933, 12989, 214, ...	[ 0.195556640625, 0.1815185546875, 0.06298828125, 0.01239013671875, 0.1680908203125, 0.111328125, 0.007171630859375, 0.1551513671875, 0.107666015625, 0.0533447265625, 0.07666015625, 0.232177734375, 0.16015625, 0.131103515625, 0.091064453125, 0.23291015625, 0.06884765625, 0.0853271484...	embed
48025222_c0	48025222	haskell	0	Title: Haskell make a list of the variables of a list Problem title: Haskell make a list of the variables of a list Tags: list, haskell Problem: Haskell make a list of the variables of a list Suppose I have the data data Expense = MkExpense Double String deriving (Eq,Ord) and a function balanced :: [Expense] -> Double ...	Haskell make a list of the variables of a list Haskell make a list of the variables of a list list haskell Haskell Expense MkExpense Double Ord Bool Haskell make a list of the variables of a list Suppose I have the data and a function which computes wether the list of expenses is balances (i.e. everyone paid the same w...	[ 0.007080078125, -0.00994873046875, -0.007354736328125, 0.003753662109375, -0.0032806396484375, 0.04443359375, -0.0172119140625, 0.02001953125, 0.01470947265625, -0.0048828125, -0.010009765625, -0.00848388671875, -0.005645751953125, -0.01531982421875, -0.0191650390625, 0.01470947265625,...	[ 20625, 142508, 3249, 5303, 111, 77336, 7, 1556, 60075, 21161, 276, 92, 19279, 2278, 184, 107172, 35379, 2460, 929, 2053, 32354, 7077, 9319, 14700, 47754, 83, 40197, 30309, 72090, 5701, 38132, 60212, 15759, 4759, 21917, 26518, 6275, 18499, 3...	[ 0.14990234375, 0.220703125, 0.03912353515625, 0.2301025390625, 0.032470703125, 0.24560546875, 0.0634765625, 0.1400146484375, 0.1378173828125, 0.1064453125, 0.028228759765625, 0.079345703125, 0.05499267578125, 0.155029296875, 0.00390625, 0.1153564453125, 0.149658203125, 0.0733642578...	embed
77798771_c0	77798771	haskell	0	Title: How can I write sum function as fast as c++ in haskell? Problem title: How can I write sum function as fast as c++ in haskell? Tags: haskell Problem: How can I write sum function as fast as c++ in haskell? Following 2 versions mysum functions in haskell are 10 times slower than c++ version (with ghc -O ). How ca...	How can I write sum function as fast as c++ in haskell? How can I write sum function as fast as c++ in haskell? haskell How Main Num x:xs How can I write sum function as fast as c++ in haskell? Following 2 versions mysum functions in haskell are 10 times slower than c++ version (with ghc -O ). How can I optimize mysum ...	[ -0.00194549560546875, 0.00262451171875, 0.0263671875, 0.000957489013671875, -0.0172119140625, -0.003753662109375, -0.003570556640625, 0.007476806640625, 0.0205078125, -0.0289306640625, 0.01416015625, -0.021728515625, 0.014892578125, -0.01031494140625, 0.00823974609375, 0.00053787231445...	[ 11249, 831, 33022, 10554, 32354, 237, 4271, 37223, 23, 1556, 142508, 87, 501, 12321, 52782, 1022, 12, 425, 7, 116, 11389, 759, 11832, 621, 209, 20028, 72803, 56, 3501, 31380, 238, 20, 670, 15572, 53333 ]	[ 0.05133056640625, 0.06158447265625, 0.170166015625, 0.24853515625, 0.185546875, 0.1090087890625, 0.1522216796875, 0.25439453125, 0.046783447265625, 0.152587890625, 0.2412109375, 0.033416748046875, 0.015106201171875, 0.1170654296875, 0.1343994140625, 0.07684326171875, 0.01791381835937...	embed
66238245_c0	66238245	haskell	0	Title: Fold with Data.Map.adjust Problem title: Fold with Data.Map.adjust Tags: iteration, dictionary, haskell, fold Problem: Fold with Data.Map.adjust I'm trying to get the correct function which will update one or multiple value by iterating over a list of key. Example: s1 = Data.Map.fromList [(1,"value1"), (2,"value...	Fold with Data.Map.adjust Fold with Data.Map.adjust iteration dictionary haskell fold Fold Data.Map.adjust Data.Map.fromList value1 value2 value3 Map.adjust Fold with Data.Map.adjust I'm trying to get the correct function which will update one or multiple value by iterating over a list of key. Example: By passing to th...	[ -0.0322265625, 0.00152587890625, 0.01312255859375, -0.01556396484375, -0.01513671875, 0.015380859375, -0.00176239013671875, 0.01123046875, 0.01080322265625, 0.0172119140625, 0.0240478515625, 0.00982666015625, 0.0081787109375, 0.01507568359375, 0.0225830078125, -0.00051116943359375, 0...	[ 30077, 71, 678, 11809, 166179, 712, 20314, 720, 10763, 1556, 142508, 42822, 161063, 154663, 34292, 304, 363, 42719, 31577, 2046, 26785, 32354, 1221, 28350, 1632, 707, 48716, 390, 17, 67, 98767, 645, 5303, 111, 22799, 89536, 452, 47, 90173, ...	[ 0.17724609375, 0.083740234375, 0.157958984375, 0.1510009765625, 0.1893310546875, 0.042694091796875, 0.1580810546875, 0.1754150390625, 0.05279541015625, 0.136962890625, 0.2249755859375, 0.2291259765625, 0.032440185546875, 0.0882568359375, 0.16357421875, 0.0209808349609375, 0.076721191...	embed
33404497_c0	33404497	haskell	0	Title: Explain the type signatures for High order functions? Problem title: Explain the type signatures for High order functions? Tags: haskell, type-signature Problem: Explain the type signatures for High order functions? function :: (t2 -> t1) -> (t1 -> t) -> t2 -> t function f1 f2 x = f2 (f1 x ) function1 :: (t -> t...	Explain the type signatures for High order functions? Explain the type signatures for High order functions? haskell type-signature Explain High function1 function11 function3 function4 Explain the type signatures for High order functions? Can anyone explain the type signatures for the the first two and also why the typ...	[ 0.01495361328125, -0.00109100341796875, -0.0291748046875, 0.006011962890625, 0.0244140625, -0.006256103515625, -0.01708984375, 0.0091552734375, 0.0155029296875, 0.00823974609375, -0.00823974609375, -0.01953125, 0.0009918212890625, 0.0037078857421875, -0.00994873046875, -0.0042419433593...	[ 60075, 16442, 70, 10644, 138256, 7, 100, 19694, 12989, 32354, 1556, 142508, 137432, 418, 1662, 363, 617, 73342, 6626, 15400, 4568, 138, 621, 5701, 11192 ]	[ 0.0947265625, 0.140625, 0.004547119140625, 0.2298583984375, 0.21533203125, 0.062225341796875, 0.055755615234375, 0.142333984375, 0.17724609375, 0.185302734375, 0.11669921875, 0.1907958984375, 0.1839599609375, 0.011993408203125, 0.090576171875, 0.08343505859375, 0.1240234375, 0.1221...	embed
55901933_c0	55901933	haskell	0	Title: Cant figure out simple haskell recursion problem Problem title: Cant figure out simple haskell recursion problem Tags: haskell, recursion, functional-programming Problem: Cant figure out simple haskell recursion problem I'm trying to write a simple haskell program that sums up the digits of an integer for exampl...	Cant figure out simple haskell recursion problem Cant figure out simple haskell recursion problem haskell recursion functional-programming System.IO Data.List Cant Integral x:xs Cant figure out simple haskell recursion problem I'm trying to write a simple haskell program that sums up the digits of an integer for exampl...	[ -0.0146484375, 0.0101318359375, 0.014892578125, 0.007568359375, -0.029296875, 0.024658203125, -0.0098876953125, -0.000698089599609375, 0.01513671875, -0.039794921875, 0.01611328125, -0.03076171875, -0.00811767578125, 0.02197265625, 0.005126953125, -0.00958251953125, -0.00119781494140...	[ 4171, 18, 26366, 1810, 8781, 1556, 142508, 195625, 1830, 2967, 123309, 28966, 12353, 17780, 11809, 154663, 204681, 1022, 12, 425, 31577, 33022, 1528, 10554, 1257, 153939, 892, 1505, 27781, 83, 49543, 5608, 382, 1328, 1019, 1369, 20682, 2831, ...	[ 0.1322021484375, 0.0987548828125, 0.1500244140625, 0.1058349609375, 0.195556640625, 0.1729736328125, 0.23583984375, 0.2247314453125, 0.09332275390625, 0.18505859375, 0.10760498046875, 0.07781982421875, 0.0648193359375, 0.1431884765625, 0.04327392578125, 0.07940673828125, 0.1632080078...	embed
40044118_c0	40044118	haskell	0	Title: in insufficiently-polymorphic why do we need the `bbb: B => B => B`? Problem title: in insufficiently-polymorphic why do we need the `bbb: B => B => B`? Tags: haskell, scala Problem: in insufficiently-polymorphic why do we need the `bbb: B => B => B`? in insufficiently-polymorphic why did the author ...	in insufficiently-polymorphic why do we need the `bbb: B => B => B`? in insufficiently-polymorphic why do we need the `bbb: B => B => B`? haskell scala List in insufficiently-polymorphic why do we need the `bbb: B => B => B`? in insufficiently-polymorphic why did the author add the 3rd argument: bbb: B => B...	[ -0.005767822265625, -0.0179443359375, 0.01123046875, -0.0067138671875, 0.001251220703125, 0.022216796875, -0.0029144287109375, -0.0027923583984375, 0.0152587890625, -0.004364013671875, 0.0084228515625, -0.033203125, -0.00122833251953125, 0.01019287109375, -0.00823974609375, -0.03271484...	[ 23, 129980, 538, 135545, 178851, 15400, 642, 3871, 5125, 12, 335, 5386, 275, 1556, 142508, 146232, 32036, 1771, 44357, 42179, 15190, 70, 138, 4216, 10750, 29459, 1295, 876, 47, 6044, 13580, 186683, 142477, 32354, 10, 1563, 62, 18151, 49814 ...	[ 0.052337646484375, 0.17626953125, 0.046478271484375, 0.16650390625, 0.1492919921875, 0.115966796875, 0.00341796875, 0.1119384765625, 0.18701171875, 0.0186614990234375, 0.1419677734375, 0.08984375, 0.005218505859375, 0.078857421875, 0.1929931640625, 0.1380615234375, 0.1083984375, 0....	embed
45594313_c0	45594313	haskell	0	Title: Can I include a not persisted field in models file? Problem title: Can I include a not persisted field in models file? Tags: haskell, persistent, yesod Problem: Can I include a not persisted field in models file? In a Yesod scaffolded site, the config/models file syntax support the addition of a field not persis...	Can I include a not persisted field in models file? Can I include a not persisted field in models file? haskell persistent yesod a Can User Text Maybe Can I include a not persisted field in models file? In a Yesod scaffolded site, the config/models file syntax support the addition of a field not persisted in the databa...	[ 0.0010986328125, 0.026123046875, -0.0101318359375, 0.0157470703125, -0.01385498046875, -0.00147247314453125, 0.0128173828125, 0.006134033203125, 0.0015106201171875, -0.02294921875, -0.0013427734375, 0.002044677734375, -0.019775390625, -0.000728607177734375, -0.0024261474609375, 0.00842...	[ 4171, 26698, 959, 70560, 297, 44457, 23, 115774, 11435, 1556, 142508, 2517, 2422, 23722, 53400, 24129, 83425, 32635, 2199, 42822, 1764, 153837, 51734, 6002, 86531, 8060, 66044, 63399, 16511, 2481, 76811, 78506, 139392, 3365, 316, 3444, 2053, ...	[ 0.078369140625, 0.1563720703125, 0.1611328125, 0.21533203125, 0.0948486328125, 0.2396240234375, 0.0489501953125, 0.2376708984375, 0.16259765625, 0.10516357421875, 0.203369140625, 0.043304443359375, 0.1204833984375, 0.177978515625, 0.1365966796875, 0.15283203125, 0.09393310546875, 0...	embed
6575758_c0	6575758	haskell	0	Title: How to write Haskell array strategies Problem title: How to write Haskell array strategies Tags: haskell, arrays Problem: How to write Haskell array strategies I want to write a strategy to evaluate items in an array in parallel. The old strategies had parArr to do this ( see here ). But this is not found in the...	How to write Haskell array strategies How to write Haskell array strategies haskell arrays How Haskell Array.array How to write Haskell array strategies I want to write a strategy to evaluate items in an array in parallel. The old strategies had parArr to do this ( see here ). But this is not found in the new Control.P...	[ -0.0191650390625, 0.0284423828125, -0.004425048828125, -0.000431060791015625, 0.00811767578125, -0.00628662109375, 0.006134033203125, -0.0155029296875, 0.01904296875, -0.023681640625, -0.0074462890625, 0.032958984375, 0.0242919921875, 0.0244140625, 0.0146484375, -0.0002613067626953125,...	[ 11249, 33022, 20625, 142508, 10298, 53, 50531, 1556, 4778, 69253, 19305, 7, 3444, 113857, 151575, 55769, 95103, 366, 7614, 42, 27131, 55292, 1229, 141, 97315, 31828, 88996, 5303, 219836, 22288, 1238, 759, 154663, 123041, 184, 864, 10, 62346, ...	[ 0.046112060546875, 0.212646484375, 0.1370849609375, 0.2314453125, 0.2008056640625, 0.1558837890625, 0.25830078125, 0.128662109375, 0.060638427734375, 0.1845703125, 0.1593017578125, 0.0040283203125, 0.0157928466796875, 0.211669921875, 0.1207275390625, 0.0914306640625, 0.214599609375, ...	embed
62900928_c0	62900928	haskell	0	Title: Golden test within smallcheck property test Problem title: Golden test within smallcheck property test Tags: smallcheck, haskell Problem: Golden test within smallcheck property test I have a manually-written "golden test" (write actual output to file, compare to "golden" expected file for equality) within a smal...	Golden test within smallcheck property test Golden test within smallcheck property test smallcheck haskell Golden Test.SmallCheck.forAll Golden test within smallcheck property test I have a manually-written "golden test" (write actual output to file, compare to "golden" expected file for equality) within a smallcheck p...	[ -0.01171875, -0.01434326171875, 0.005767822265625, 0.00628662109375, -0.01483154296875, 0.0019989013671875, 0.00714111328125, -0.01470947265625, -0.002838134765625, 0.00927734375, 0.018310546875, 0.0223388671875, 0.00701904296875, 0.010986328125, 0.007537841796875, 0.00494384765625, ...	[ 43114, 3034, 28032, 19336, 78292, 57266, 1556, 142508, 8647, 69070, 202567, 2472, 43512, 23009, 5429, 75639, 122558, 33, 18781, 8561, 140992, 11435, 69101, 84751, 161789, 189085, 645, 756, 64549, 25251, 316, 96760, 47, 308, 8946, 98169, 7, 11...	[ 0.1959228515625, 0.2174072265625, 0.1009521484375, 0.142822265625, 0.23291015625, 0.1363525390625, 0.076171875, 0.145263671875, 0.183349609375, 0.1497802734375, 0.21142578125, 0.0543212890625, 0.1248779296875, 0.09228515625, 0.006195068359375, 0.0148773193359375, 0.1552734375, 0.12...	embed
17866148_c0	17866148	haskell	0	Title: simplifying maybe Monad Problem title: simplifying maybe Monad Tags: monads, haskell, python Problem: simplifying maybe Monad I am trying to understand maybe Monad but most of the examples I saw used some language-specific feature. To ensure that I have gotten it conceptually right I thought of writing a generic...	simplifying maybe Monad simplifying maybe Monad monads haskell python Monad None Returns simplifying maybe Monad I am trying to understand maybe Monad but most of the examples I saw used some language-specific feature. To ensure that I have gotten it conceptually right I thought of writing a generic implementation. Bel...	[ -0.0283203125, 0.0238037109375, 0.023681640625, 0.0023040771484375, -0.002471923828125, 0.0142822265625, 0.012939453125, -0.000774383544921875, -0.00848388671875, -0.01397705078125, -0.004852294921875, -0.010498046875, -0.0194091796875, -0.004180908203125, 0.004638671875, -0.0102539062...	[ 112892, 18929, 214, 51139, 60331, 71, 2667, 712, 1556, 142508, 17198, 50828, 438, 86, 173340, 28219, 27781, 11814, 46876, 159975, 60213, 228113, 7108, 17569, 32562, 189534, 208124, 17336, 14192, 765, 17763, 33, 11522, 4537, 20650, 15190, 142424...	[ 0.19775390625, 0.1292724609375, 0.00933837890625, 0.171875, 0.2081298828125, 0.16748046875, 0.109375, 0.13525390625, 0.092529296875, 0.1956787109375, 0.052703857421875, 0.1085205078125, 0.0714111328125, 0.03790283203125, 0.190673828125, 0.05169677734375, 0.0557861328125, 0.02857971...	embed
38626215_c0	38626215	haskell	0	Title: Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell Problem title: Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell Tags: haskell, monads Problem: Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell I have two Haskell fu...	Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell haskell monads Equivalence Haskell triple2 triple3 Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell I have two Haskell func...	[ 0.00897216796875, 0.00506591796875, 0.017822265625, 0.01080322265625, 0.0113525390625, -0.00180816650390625, 0.0003986358642578125, -0.01397705078125, 0.023681640625, 0.0023345947265625, -0.00157928466796875, 0.01239013671875, 0.014404296875, -0.0022735595703125, 0.00909423828125, 0.00...	[ 145666, 1405, 6620, 111, 594, 10, 5386, 1238, 706, 136, 276, 420, 20625, 142508, 23, 1556, 2667, 712, 162738, 304, 363, 6396, 6626, 32354, 183234, 138256, 1369, 83, 33079, 876, 70, 49129, 160291, 7, 11814, 11405, 41911, 109923, 4613, 1046...	[ 0.1219482421875, 0.153076171875, 0.03173828125, 0.039520263671875, 0.1490478515625, 0.14892578125, 0.1370849609375, 0.16259765625, 0.1607666015625, 0.103271484375, 0.1273193359375, 0.1219482421875, 0.1654052734375, 0.237548828125, 0.02044677734375, 0.145751953125, 0.059295654296875, ...	embed
27200825_c0	27200825	haskell	0	Title: Increment function for state monad in Haskell Problem title: Increment function for state monad in Haskell Tags: monads, haskell, state, increment Problem: Increment function for state monad in Haskell I have the following defined State Monad, with which I am trying to implement an increment function: data State...	Increment function for state monad in Haskell Increment function for state monad in Haskell monads haskell state increment Increment Haskell State Monad Increment function for state monad in Haskell I have the following defined State Monad, with which I am trying to implement an increment function: I have done the foll...	[ -0.0135498046875, -0.000423431396484375, 0.01275634765625, 0.0089111328125, 0.0081787109375, 0.0035247802734375, 0.003631591796875, -0.00921630859375, -0.011474609375, -0.0184326171875, 0.003692626953125, 0.01397705078125, -0.036376953125, 0.01025390625, 0.01104736328125, -0.0141601562...	[ 8942, 107, 674, 32354, 11341, 2667, 712, 23, 20625, 142508, 100, 1556, 158661, 22836, 60331, 71, 25632, 61924, 678, 31577, 29479, 16940, 903, 135179, 4488, 2071, 26785, 831, 493, 450, 160463, 8035, 297, 137567, 3642, 4527, 2046, 142, 3884 ]	[ 0.1214599609375, 0.1846923828125, 0.088134765625, 0.1973876953125, 0.1920166015625, 0.1348876953125, 0.1810302734375, 0.048370361328125, 0.1365966796875, 0.2445068359375, 0.01483154296875, 0.11962890625, 0.2529296875, 0.1927490234375, 0.180419921875, 0.131591796875, 0.064208984375, ...	embed
2777940_c0	2777940	haskell	0	Title: How do you solve this Haskell problem using a fold map and take? Problem title: How do you solve this Haskell problem using a fold map and take? Tags: higher-order-functions, haskell Problem: How do you solve this Haskell problem using a fold map and take? Define a function replicate which given a list of number...	How do you solve this Haskell problem using a fold map and take? How do you solve this Haskell problem using a fold map and take? higher-order-functions haskell a How Haskell replicate2 n:nn How do you solve this Haskell problem using a fold map and take? Define a function replicate which given a list of numbers return...	[ -0.0181884765625, -0.0024871826171875, -0.004241943359375, 0.01287841796875, -0.0242919921875, 0.0240478515625, 0.01031494140625, 0.01513671875, 0.020751953125, -0.02587890625, -0.01104736328125, -0.0157470703125, 0.017578125, 0.03369140625, -0.00098419189453125, -0.0244140625, 0.004...	[ 11249, 54, 86869, 903, 20625, 142508, 2967, 17368, 42822, 22288, 136, 5646, 10, 77546, 80596, 137175, 1556, 143126, 67, 304, 653, 12, 10713, 262, 64552, 32354, 34475, 5303, 101935, 30646, 12638, 14012, 171763, 3674, 6863, 34292, 36836, 758, ...	[ 0.0665283203125, 0.0313720703125, 0.1978759765625, 0.1190185546875, 0.18310546875, 0.281982421875, 0.201904296875, 0.101318359375, 0.239501953125, 0.2392578125, 0.1312255859375, 0.2265625, 0.08172607421875, 0.10589599609375, 0.1650390625, 0.1517333984375, 0.14794921875, 0.300048828...	embed
8924128_c0	8924128	haskell	0	Title: parsec error in haskelwiki tutorial Problem title: parsec error in haskelwiki tutorial Tags: haskell Problem: parsec error in haskelwiki tutorial I was following the code in http://www.haskell.org/haskellwiki/Hitchhikers_guide_to_Haskell , and the code (in chapter 2) gives an error. There is no author name/email...	parsec error in haskelwiki tutorial parsec error in haskelwiki tutorial haskell Text.ParserCombinators.Parsec Main Dir Show many1 dir_name Debug parsec error in haskelwiki tutorial I was following the code in http://www.haskell.org/haskellwiki/Hitchhikers_guide_to_Haskell , and the code (in chapter 2) gives an error. T...	[ -0.00177001953125, 0.0252685546875, 0.0020751953125, 0.0341796875, -0.005615234375, 0.020263671875, -0.01220703125, -0.033447265625, -0.0027313232421875, -0.037109375, -0.005340576171875, -0.020751953125, 0.006591796875, 0.00469970703125, -0.005828857421875, -0.009765625, 0.020019531...	[ 366, 39797, 18499, 1556, 2590, 13691, 57143, 23, 142508, 24129, 28636, 2189, 19155, 22230, 12321, 19946, 17367, 5941, 418, 5402, 11627, 262, 85779, 25632, 18151, 10557, 206, 979, 25306, 64527, 6495, 7, 139539, 4958, 42179, 9351, 25501, 119056...	[ 0.1688232421875, 0.287353515625, 0.2060546875, 0.1429443359375, 0.1649169921875, 0.2369384765625, 0.24365234375, 0.010162353515625, 0.2205810546875, 0.047393798828125, 0.1343994140625, 0.0229034423828125, 0.1168212890625, 0.048919677734375, 0.037078857421875, 0.0767822265625, 0.06768...	embed
64930007_c0	64930007	haskell	0	Title: Apply margin to inner elements in a Yesod form Problem title: Apply margin to inner elements in a Yesod form Tags: frontend, haskell, yesod-forms, yesod Problem: Apply margin to inner elements in a Yesod form I'm trying to apply margin to elements inside a renderDivs form: <$> areq textField (FieldSettings "Name...	Apply margin to inner elements in a Yesod form Apply margin to inner elements in a Yesod form frontend haskell yesod-forms yesod Apply Yesod FieldSettings Name Nothing Just hs12 Price Description Apply margin to inner elements in a Yesod form I'm trying to apply margin to elements inside a renderDivs form: Is it possib...	[ -0.0037384033203125, 0.029541015625, -0.01904296875, -0.012451171875, -0.0015716552734375, 0.007110595703125, 0.0159912109375, 0.01202392578125, 0.0036163330078125, -0.029052734375, 0.01544189453125, 0.01544189453125, -0.01177978515625, 0.01043701171875, 0.00189208984375, -0.0139770507...	[ 5659, 538, 92142, 47, 75414, 80854, 23, 32635, 2199, 3173, 12912, 3611, 1556, 142508, 2422, 23722, 5037, 117657, 105548, 15757, 182747, 9563, 1096, 7, 1530, 48025, 70643, 31577, 59911, 46132, 89159, 192576, 2071, 7722, 217064, 45258, 59279, 1...	[ 0.1201171875, 0.07012939453125, 0.272216796875, 0.15087890625, 0.2315673828125, 0.186279296875, 0.0188446044921875, 0.1790771484375, 0.269287109375, 0.2144775390625, 0.0258026123046875, 0.0653076171875, 0.0728759765625, 0.17822265625, 0.1182861328125, 0.232666015625, 0.201171875, 0...	embed
29691669_c0	29691669	haskell	0	Title: Map function takes non-function as first argument Problem title: Map function takes non-function as first argument Tags: haskell Problem: Map function takes non-function as first argument -- file: ch19/divby1.hs divBy :: Integral a => a -> [a] -> [a] divBy numerator = map (numerator `div`) This is the code excer...	Map function takes non-function as first argument Map function takes non-function as first argument haskell Map ch19 divby1.hs Integral Map function takes non-function as first argument This is the code excerpt from O'reilly - Haskell book. sample run as, What confuses me is why there are two variables on LHS divBy and...	[ -0.002166748046875, 0.0194091796875, 0.01251220703125, -0.0072021484375, -0.004730224609375, -0.00286865234375, 0.00006079673767089844, 0.0035552978515625, 0.004608154296875, -0.03369140625, 0.01068115234375, -0.0069580078125, 0.0191650390625, 0.013427734375, -0.00093841552734375, -0.0...	[ 42719, 32354, 51776, 351, 137175, 237, 5117, 10750, 1556, 142508, 3863, 2947, 18221, 1272, 418, 127, 204681, 18151, 180, 114833, 20625, 12877, 121413, 11675, 55681, 15400, 6626, 77336, 339, 38131, 75358, 136, 22542, 4597, 125195, 142424, 95486,...	[ 0.252197265625, 0.2119140625, 0.070556640625, 0.185791015625, 0.2091064453125, 0.07568359375, 0.1358642578125, 0.268310546875, 0.108642578125, 0.218017578125, 0.0557861328125, 0.1622314453125, 0.198486328125, 0.1737060546875, 0.025177001953125, 0.0810546875, 0.2015380859375, 0.1280...	embed
3111997_c0	3111997	haskell	0	Title: Nice small simple real life programming example in Haskell? Problem title: Nice small simple real life programming example in Haskell? Tags: functional-programming, haskell Problem: Nice small simple real life programming example in Haskell? I know, I might be asking much, but does any one know of some nice litt...	Nice small simple real life programming example in Haskell? Nice small simple real life programming example in Haskell? functional-programming haskell Nice Haskell Nice small simple real life programming example in Haskell? I know, I might be asking much, but does any one know of some nice little programming examples /...	[ 0.0023345947265625, 0.005950927734375, 0.010009765625, -0.00083160400390625, -0.002044677734375, 0.00823974609375, -0.009033203125, -0.00133514404296875, 0.0002613067626953125, -0.0177001953125, -0.0024871826171875, -0.0223388671875, -0.00286865234375, 0.0091552734375, 0, -0.0200195312...	[ 73398, 19336, 8781, 2773, 6897, 56037, 449, 27781, 23, 20625, 142508, 123309, 28966, 1556, 5045, 26267, 10176, 248, 35773, 100, 1326, 143669, 77391, 15411, 7639, 83, 1286, 3501, 150, 46401, 26499, 46876, 47, 12096, 101935, 21771, 14037, 19559...	[ 0.166259765625, 0.152587890625, 0.16943359375, 0.1417236328125, 0.158203125, 0.15673828125, 0.06829833984375, 0.1859130859375, 0.0574951171875, 0.1605224609375, 0.2342529296875, 0.1282958984375, 0.11962890625, 0.1231689453125, 0.0260162353515625, 0.1170654296875, 0.0999755859375, 0...	embed
33125851_c0	33125851	haskell	0	Title: Non-exhaustive patterns using if-then-else Problem title: Non-exhaustive patterns using if-then-else Tags: pattern-matching, haskell, functional-programming Problem: Non-exhaustive patterns using if-then-else I have the following function: myMaximum [] = error "There is no such thing as 'maximum' in an empty lis...	Non-exhaustive patterns using if-then-else Non-exhaustive patterns using if-then-else pattern-matching haskell functional-programming if-then-else Non-exhaustive There x:xs Non-exhaustive patterns using if-then-else I have the following function: I works just fine when I run myMaximum [1..5] , but it throws the error d...	[ -0.028076171875, 0.01385498046875, 0.0245361328125, 0.01068115234375, 0.02392578125, 0.019287109375, 0.01055908203125, -0.0101318359375, 0.0303955078125, -0.0130615234375, 0.019775390625, 0.00579833984375, 0.01202392578125, -0.002044677734375, 0.03564453125, 0.01373291015625, 0.01177...	[ 3775, 3355, 18391, 4935, 103510, 17368, 2174, 92733, 5557, 98753, 1556, 142508, 123309, 28966, 8622, 1022, 425, 25632, 32354, 43240, 1660, 5885, 11675, 759, 71346, 464, 316, 758, 104250, 18499, 61924, 5117, 13315, 76172, 1810, 186992, 351, 6,...	[ 0.1898193359375, 0.047698974609375, 0.1553955078125, 0.0865478515625, 0.2115478515625, 0.050933837890625, 0.181884765625, 0.1622314453125, 0.187744140625, 0.1337890625, 0.1029052734375, 0.1856689453125, 0.10888671875, 0.070068359375, 0.1131591796875, 0.0244903564453125, 0.06188964843...	embed
11851005_c0	11851005	haskell	0	Title: Why is numCapabilities a pure function? Problem title: Why is numCapabilities a pure function? Tags: haskell, standard-library Problem: Why is numCapabilities a pure function? In the concurrency library GHC.Conc there is a function called numCapabilities . Its type is numCapabilities :: Int and it actually retur...	Why is numCapabilities a pure function? Why is numCapabilities a pure function? haskell standard-library Why RTS Why is numCapabilities a pure function? In the concurrency library GHC.Conc there is a function called numCapabilities . Its type is numCapabilities :: Int and it actually returns some number you passed by t...	[ -0.004608154296875, -0.0130615234375, 0.01336669921875, -0.000820159912109375, 0.00970458984375, 0.027099609375, 0.01165771484375, -0.0245361328125, 0.0020904541015625, -0.01312255859375, -0.020751953125, -0.0172119140625, -0.0194091796875, 0.018310546875, 0.01190185546875, 0.010742187...	[ 44084, 13269, 87926, 27519, 2449, 34166, 32354, 10, 1556, 142508, 5570, 150, 2844, 27389, 294, 83, 108636, 982, 35773, 527, 73265, 11935, 238, 10644, 1984, 360, 18, 30646, 14012, 115081, 75101, 13315, 49938, 190, 50717, 997, 20503, 20, 839,...	[ 0.0986328125, 0.211181640625, 0.203857421875, 0.1923828125, 0.154296875, 0.1947021484375, 0.205810546875, 0.032196044921875, 0.09326171875, 0.188720703125, 0.0987548828125, 0.01544189453125, 0.0704345703125, 0.1439208984375, 0.106689453125, 0.006622314453125, 0.0894775390625, 0.042...	embed
34565651_c0	34565651	haskell	0	Title: Intermediate results in a recursive function Problem title: Intermediate results in a recursive function Tags: haskell Problem: Intermediate results in a recursive function I'm trying to write a function which will find all prime numbers from 2 to 100. I can do so by testing if a number is prime by looking at re...	Intermediate results in a recursive function Intermediate results in a recursive function haskell Intermediate n-1 t-1 t:ts Intermediate results in a recursive function I'm trying to write a function which will find all prime numbers from 2 to 100. I can do so by testing if a number is prime by looking at remainder whe...	[ -0.012939453125, 0.02099609375, 0.01556396484375, 0.001251220703125, 0.0289306640625, -0.0166015625, 0.00872802734375, -0.0145263671875, 0.0113525390625, -0.0306396484375, 0.0115966796875, -0.0162353515625, 0.00714111328125, 0.013671875, -0.0003299713134765625, 0.01031494140625, 0.01...	[ 5337, 12333, 67, 50339, 23, 195625, 5844, 32354, 1556, 142508, 653, 5759, 808, 933, 31577, 33022, 7413, 756, 20809, 101935, 116, 47, 805, 134234, 2174, 14012, 83, 16487, 47143, 820, 101637, 787, 5, 1884, 4734, 3034, 26548, 765, 21771, 140...	[ 0.1434326171875, 0.2176513671875, 0.11669921875, 0.1861572265625, 0.0335693359375, 0.2127685546875, 0.13916015625, 0.187744140625, 0.1142578125, 0.227294921875, 0.043365478515625, 0.1549072265625, 0.07598876953125, 0.107177734375, 0.058349609375, 0.08251953125, 0.09222412109375, 0....	embed

47742484_c0

47742484

haskell

0

Title: Haskell: Unexpected result on list comprehension evaluation Problem title: Haskell: Unexpected result on list comprehension evaluation Tags: haskell, list-comprehension Problem: Haskell: Unexpected result on list comprehension evaluation I'm just learning some Haskell and while playing with list comprehensions i...

Haskell: Unexpected result on list comprehension evaluation Haskell: Unexpected result on list comprehension evaluation haskell list-comprehension Haskell Unexpected Main Haskell: Unexpected result on list comprehension evaluation I'm just learning some Haskell and while playing with list comprehensions in the repl I c...

[ 0.0031280517578125, 0.0206298828125, -0.007110595703125, 0.0194091796875, 0.006195068359375, 0.00897216796875, 0.0081787109375, 0.01361083984375, 0.0123291015625, -0.00811767578125, -0.01275634765625, -0.0269775390625, 0.017822265625, 0.0125732421875, -0.017333984375, -0.01708984375, ...

[ 20625, 142508, 992, 83613, 13, 89829, 16750, 98, 5303, 46683, 3220, 219836, 1556, 4692, 12321, 52080, 75169, 456, 2424, 831, 18, 28219, 3642, 370, 8705, 91157, 13956, 83, 139392, 25632, 18151, 100094, 140909, 1022, 8306, 167785, 138, 41206, ...

[ 0.1400146484375, 0.2255859375, 0.04168701171875, 0.079833984375, 0.0748291015625, 0.0399169921875, 0.126220703125, 0.03326416015625, 0.19091796875, 0.123046875, 0.115478515625, 0.165283203125, 0.09381103515625, 0.089599609375, 0.0704345703125, 0.017425537109375, 0.0357666015625, 0....

embed

54760825_c0

54760825

haskell

0

Title: Why the pointfree style does not cause a problem? Problem title: Why the pointfree style does not cause a problem? Tags: haskell Problem: Why the pointfree style does not cause a problem? I read about The Monomorphism Restriction from the page https://www.haskell.org/tutorial/pitfalls.html and could not understa...

Why the pointfree style does not cause a problem? Why the pointfree style does not cause a problem? haskell Why Num Why the pointfree style does not cause a problem? I read about The Monomorphism Restriction from the page https://www.haskell.org/tutorial/pitfalls.html and could not understand the last point: Why the la...

[ -0.0225830078125, -0.01361083984375, 0.01409912109375, -0.00095367431640625, 0.0038604736328125, 0.008056640625, -0.0025634765625, -0.00653076171875, 0.0142822265625, -0.0263671875, -0.005706787109375, -0.051025390625, 0.0036773681640625, -0.0159912109375, -0.004608154296875, -0.003372...

[ 44084, 6275, 32087, 20623, 959, 22304, 2967, 14602, 1556, 142508, 52782, 70, 10, 77879, 178851, 8780, 853, 7655, 10763, 10557, 6295, 49269, 28219, 4568, 2499, 18499 ]

[ 0.12939453125, 0.16552734375, 0.26220703125, 0.233154296875, 0.1551513671875, 0.1480712890625, 0.193115234375, 0.058685302734375, 0.1297607421875, 0.219970703125, 0.2017822265625, 0.0204010009765625, 0.023284912109375, 0.1400146484375, 0.1910400390625, 0.0479736328125, 0.013214111328...

embed

64066755_c0

64066755

haskell

0

Title: Pass custom data structures to C via Haskell FFI Problem title: Pass custom data structures to C via Haskell FFI Tags: function, ffi, types, haskell Problem: Pass custom data structures to C via Haskell FFI If I have a C function that looks like this void print_addr(struct sockaddr_rc addr) { // some printing ma...

Pass custom data structures to C via Haskell FFI Pass custom data structures to C via Haskell FFI function ffi types haskell ccall Pass Haskell FFI print_addr sockaddr_rc Storable RFSocketAddress Pass custom data structures to C via Haskell FFI If I have a C function that looks like this If I have defined a similar dat...

[ 0.034912109375, 0.0284423828125, -0.016845703125, 0.00063323974609375, 0.009765625, 0.007598876953125, 0.0067138671875, -0.019287109375, -0.005126953125, -0.0181884765625, 0.02587890625, -0.03515625, -0.00096893310546875, 0.00592041015625, -0.005767822265625, -0.018798828125, -0.0196...

[ 28872, 114122, 2053, 45646, 47, 313, 1829, 20625, 142508, 563, 22724, 32354, 24500, 52895, 1556, 85763, 28412, 712, 7569, 38887, 10870, 19437, 23604, 2886, 100250, 8912, 27853, 161007, 33342, 1884, 903, 61924, 21373, 137656, 36716, 110527, 2017...

[ 0.144775390625, 0.1962890625, 0.1085205078125, 0.2236328125, 0.10296630859375, 0.183837890625, 0.076416015625, 0.138671875, 0.233642578125, 0.0928955078125, 0.2489013671875, 0.200927734375, 0.1728515625, 0.125732421875, 0.1251220703125, 0.168701171875, 0.1278076171875, 0.0071411132...

embed

22900447_c0

22900447

haskell

0

Title: Haskell Trees Mapping Problem title: Haskell Trees Mapping Tags: haskell Problem: Haskell Trees Mapping I've been trying to write a simple mapping function using Haskell, and I came into the following problem: data Tree a = Leaf a | Node (Tree a) (Tree a) deriving(Show) let g (Leaf l) = Leaf(l+1) let map g (Leaf...

Haskell Trees Mapping Haskell Trees Mapping haskell Haskell Trees Mapping Tree Leaf Node Show Couldn Integer Expected Actual Haskell Trees Mapping I've been trying to write a simple mapping function using Haskell, and I came into the following problem: For g(lf) the output is Leaf 3 as excepted, but for map g lf i'm ge...

[ -0.00384521484375, 0.0213623046875, 0.003082275390625, -0.010986328125, 0.027099609375, 0.014404296875, -0.011474609375, -0.0096435546875, -0.006256103515625, -0.04345703125, -0.0208740234375, -0.02587890625, 0.009033203125, 0.01153564453125, 0.006988525390625, -0.0152587890625, 0.01...

[ 20625, 142508, 4804, 911, 26783, 1556, 101344, 636, 2407, 438, 112, 17367, 191147, 19, 44401, 60075, 13, 89829, 100582, 31577, 33022, 8781, 291, 32354, 17368, 2967, 706, 17463, 140992, 138, 237, 40494, 1284, 22288, 25632, 18499, 3714, 15400, ...

[ 0.13623046875, 0.2283935546875, 0.1927490234375, 0.1817626953125, 0.1243896484375, 0.1170654296875, 0.157958984375, 0.077392578125, 0.1943359375, 0.1160888671875, 0.107666015625, 0.1497802734375, 0.1429443359375, 0.03948974609375, 0.195556640625, 0.1192626953125, 0.1339111328125, 0...

embed

29118115_c0

29118115

haskell

0

Title: How can cabal use multiple cores while building local add-source'd dependency Problem title: How can cabal use multiple cores while building local add-source'd dependency Tags: haskell, cabal Problem: How can cabal use multiple cores while building local add-source'd dependency My project is split thro...

How can cabal use multiple cores while building local add-source'd dependency How can cabal use multiple cores while building local add-source'd dependency haskell cabal How How can cabal use multiple cores while building local add-source'd dependency My project is split through multiple subprojects, which ar...

[ -0.003692626953125, 0.01318359375, 0.0123291015625, 0.006103515625, -0.0233154296875, -0.0181884765625, -0.01092529296875, 0.0093994140625, 0.00640869140625, -0.043701171875, 0.0135498046875, -0.0185546875, 0.00604248046875, 0.0260009765625, 0.0084228515625, -0.006591796875, -0.01043...

[ 11249, 831, 109524, 4527, 48716, 48052, 12960, 33976, 4000, 15190, 60427, 3768, 42548, 27771, 1556, 142508, 13452, 65450, 1614, 95322, 162711, 19096, 11728, 45367, 24931, 20, 170, 54, 20600, 4210, 191, 105254, 117538, 2806, 4734, 11001, 56458, ...

[ 0.08782958984375, 0.076904296875, 0.269775390625, 0.1475830078125, 0.2294921875, 0.248291015625, 0.05523681640625, 0.1441650390625, 0.1318359375, 0.1031494140625, 0.16845703125, 0.03472900390625, 0.1658935546875, 0.07025146484375, 0.122314453125, 0.224365234375, 0.0966796875, 0.121...

embed

6863984_c0

6863984

haskell

0

Title: Stack space overflow when separating functions in different hs files Problem title: Stack space overflow when separating functions in different hs files Tags: haskell Problem: Stack space overflow when separating functions in different hs files I have a huge haskell file which compiles and runs without any probl...

Stack space overflow when separating functions in different hs files Stack space overflow when separating functions in different hs files haskell Stack Main.hs Main Other.hs RunMe Stack space overflow when separating functions in different hs files I have a huge haskell file which compiles and runs without any problem....

[ 0.00750732421875, 0.011474609375, -0.011962890625, -0.0021209716796875, -0.0238037109375, -0.007171630859375, -0.0103759765625, 0.005401611328125, 0.01226806640625, -0.04345703125, -0.01708984375, -0.0164794921875, 0.023193359375, 0.00799560546875, 0.011962890625, 0.004241943359375, ...

[ 6512, 2594, 32628, 645, 118664, 38310, 214, 32354, 12921, 1096, 7, 102158, 1556, 142508, 12321, 127, 64511, 28398, 6696, 23, 58696, 11435, 9969, 1340, 127877, 3444, 3884, 136, 10644, 80934, 84797, 88996, 189534, 24927, 5201, 1528, 18499, 7624...

[ 0.1558837890625, 0.1097412109375, 0.217529296875, 0.097412109375, 0.2237548828125, 0.1939697265625, 0.0382080078125, 0.1766357421875, 0.1270751953125, 0.0965576171875, 0.115234375, 0.1661376953125, 0.09100341796875, 0.1962890625, 0.10223388671875, 0.1171875, 0.07440185546875, 0.107...

embed

63522328_c0

63522328

haskell

0

Title: "One-way" dependencies in shake-build? Problem title: "One-way" dependencies in shake-build? Tags: haskell, shake-build-system Problem: "One-way" dependencies in shake-build? My brain might be fried right now (have been hacking on this Shakefile for 3 days straight), but I just can't figure o...

"One-way" dependencies in shake-build? "One-way" dependencies in shake-build? haskell shake-build-system One-way RST HTML "One-way" dependencies in shake-build? My brain might be fried right now (have been hacking on this Shakefile for 3 days straight), but I just can't figure out how to express a "...

[ -0.000308990478515625, 0.00946044921875, 0.006072998046875, -0.002838134765625, -0.01177978515625, 0.0186767578125, -0.0263671875, 0.0035858154296875, 0.01043701171875, 0.01171875, 0.000698089599609375, 0.004638671875, -0.007720947265625, 0.034912109375, 0.002410888671875, -0.000155448...

[ 62068, 7514, 42548, 117538, 174450, 177149, 1556, 142508, 16751, 6561, 8545, 19097, 9, 78574, 13648, 84285, 256, 68161, 13, 29822, 26366, 36510, 3630, 27771, 23, 33976, 48281, 75281, 102158, 1632, 39210, 59279, 11435, 139392, 5154, 50339, 58837...

[ 0.1668701171875, 0.232421875, 0.2176513671875, 0.1412353515625, 0.2462158203125, 0.227294921875, 0.07952880859375, 0.1455078125, 0.07489013671875, 0.1251220703125, 0.111328125, 0.1776123046875, 0.031158447265625, 0.03656005859375, 0.01910400390625, 0.0350341796875, 0.03240966796875, ...

embed

35899801_c0

35899801

haskell

0

Title: Haskell Multiset Operations Problem title: Haskell Multiset Operations Tags: union, multiset, intersect, haskell Problem: Haskell Multiset Operations I am trying to create functions which can find the union and intersection of two multi sets in Haskell without the use of the Multiset module. I have a good unders...

Haskell Multiset Operations Haskell Multiset Operations union multiset intersect haskell Haskell Multiset Operations x:xs Haskell Multiset Operations I am trying to create functions which can find the union and intersection of two multi sets in Haskell without the use of the Multiset module. I have a good understanding...

[ -0.0021820068359375, 0.01300048828125, 0.036376953125, -0.0218505859375, -0.00396728515625, 0.005828857421875, -0.01055908203125, -0.01409912109375, 0.01904296875, -0.00150299072265625, 0.003021240234375, 0.0233154296875, 0.0277099609375, 0.0028076171875, -0.0038299560546875, 0.0061035...

[ 20625, 142508, 19335, 3509, 102203, 69941, 6024, 1940, 7, 24762, 1556, 1022, 12, 425, 31577, 28282, 32354, 7413, 136, 58994, 6626, 5423, 15490, 4527, 88996, 100094, 62822, 3638, 5303, 48903, 104250, 163, 2060, 31089, 18151, 20653, 20949, 1424...

[ 0.150146484375, 0.2220458984375, 0.18115234375, 0.220947265625, 0.1912841796875, 0.202392578125, 0.1993408203125, 0.171142578125, 0.176025390625, 0.16259765625, 0.13720703125, 0.009765625, 0.0262451171875, 0.0689697265625, 0.033172607421875, 0.060455322265625, 0.147216796875, 0.117...

embed

53001383_c0

53001383

haskell

0

Title: Couldn't match type `a` with `a1` Problem title: Couldn't match type `a` with `a1` Tags: haskell, functor Problem: Couldn't match type `a` with `a1` I am doing the exercise in the Haskell Programming from First Principles, Chapter 16. The question is to ask us to write Functor definition for the dataty...

Couldn't match type `a` with `a1` Couldn't match type `a` with `a1` haskell functor a Couldn LANGUAGE FlexibleInstances Flip Show Functor chapEx2.hs:17:25 chapEx2.hs:17:3-6 Expected Actual Relevant chapEx2.hs:17:19 chapEx2.hs:17:8 chapEx2.hs:17:3 Couldn't match type `a` with `a1` I am doing the exercise in th...

[ 0.006561279296875, 0.0125732421875, 0.01165771484375, 0.0018310546875, -0.00927734375, -0.003875732421875, -0.0123291015625, -0.021240234375, 0.00921630859375, 0.01416015625, -0.01239013671875, -0.00170135498046875, 0.004638671875, 0.01361083984375, -0.010009765625, -0.02490234375, 0...

[ 191147, 3768, 14858, 10644, 11, 678, 418, 1556, 142508, 7477, 18770, 10, 19, 98064, 180842, 2661, 116071, 160808, 17367, 28670, 19279, 13545, 60075, 100582, 133, 30624, 23988, 18, 81979, 20625, 27958, 79680, 6849, 80934, 2053, 50986, 9790, 12...

[ 0.10015869140625, 0.031524658203125, 0.2349853515625, 0.2147216796875, 0.140380859375, 0.09393310546875, 0.07098388671875, 0.110595703125, 0.1954345703125, 0.136962890625, 0.1973876953125, 0.1119384765625, 0.033660888671875, 0.0859375, 0.123046875, 0.0914306640625, 0.08697509765625, ...

embed

28172694_c0

28172694

haskell

0

Title: why does my (alternative to !!) function have this type Problem title: why does my (alternative to !!) function have this type Tags: haskell Problem: why does my (alternative to !!) function have this type Being a little bit frustrated over the error messages some prelude functions (like !!) give, I tried to wri...

why does my (alternative to !!) function have this type why does my (alternative to !!) function have this type haskell Show Integral x:xs b-1 Handydandy Num Char why does my (alternative to !!) function have this type Being a little bit frustrated over the error messages some prelude functions (like !!) give, I tried ...

[ -0.0089111328125, -0.01220703125, 0.0081787109375, 0.007354736328125, -0.00182342529296875, -0.007110595703125, 0.00083160400390625, -0.0203857421875, 0.01171875, 0.005859375, 0.01123046875, -0.017578125, 0.01104736328125, 0.006134033203125, 0.002777099609375, -0.01220703125, 0.00848...

[ 15400, 14602, 759, 119927, 13, 47, 6506, 32354, 765, 903, 10644, 1556, 142508, 17367, 204681, 1022, 425, 7, 876, 5759, 92633, 549, 1459, 52782, 21656, 10176, 4785, 57357, 18499, 89914, 479, 822, 112, 5062, 8337, 37842, 33022, 12921, 11389, ...

[ 0.1636962890625, 0.062744140625, 0.10675048828125, 0.2279052734375, 0.128173828125, 0.196044921875, 0.2362060546875, 0.229248046875, 0.1038818359375, 0.1304931640625, 0.23876953125, 0.1475830078125, 0.246337890625, 0.1826171875, 0.2430419921875, 0.0948486328125, 0.085693359375, 0.0...

embed

21273070_c1

21273070

haskell

1

-v pandock.hs is quite long, I assume the relevant part is: *** Chasing dependencies: Chasing modules from: *pandock.hs pandock.hs:1:8: Could not find module `Text.Pandoc.Readers.MediaWiki' Locations searched: Text/Pandoc/Readers/MediaWiki.hs Text/Pandoc/Readers/MediaWiki.lhs Failed, modules loaded: none. However, bot...

[ -0.003814697265625, -0.011474609375, 0.0296630859375, 0.0242919921875, 0.0106201171875, 0.014892578125, -0.0205078125, -0.007415771484375, -0.01171875, -0.015380859375, -0.0126953125, -0.048828125, 0.003692626953125, -0.0189208984375, -0.0084228515625, -0.0089111328125, 0.01220703125...

[ 20, 334, 2652, 138414, 5, 127, 7, 32233, 4989, 41591, 29191, 2831, 4841, 6953, 42548, 117538, 88996, 3180, 19721, 1019, 191147, 959, 7413, 174379, 55956, 29713, 31345, 1314, 72492, 147822, 90788, 33938, 24129, 79366, 190355, 72367, 351, 15044...

[ 0.042510986328125, 0.1998291015625, 0.1607666015625, 0.271484375, 0.013519287109375, 0.1612548828125, 0.1217041015625, 0.0731201171875, 0.1148681640625, 0.06671142578125, 0.08984375, 0.038970947265625, 0.1944580078125, 0.091064453125, 0.1900634765625, 0.0770263671875, 0.2127685546875...

embed

41597013_c3

41597013

haskell

3

, lts-7.15, array-0.5.1.1, base-4.9.0.0, binary-0.8.3.0, bytestring-0.10.8.1, containers-0.5.7.1, deepseq-1.4.2.0, directory-1.2.6.2, filepath-1.4.1.0, ghc-boot-8.0.1, ghc-boot-th-8.0.1, ghc-prim-0.5.0.0, ghci-8.0.1, haskeline-0.7.2.3, hoopl-3.10.2.1, hpc-0.6.0.3, integer-gmp-1.0.0.1, network-2.6.3.1-G4Up1CPKbp7DeFsnyw...

[ -0.011474609375, -0.0024871826171875, 0.017333984375, 0.01153564453125, -0.023193359375, -0.01470947265625, -0.018798828125, -0.01202392578125, 0.005706787109375, 0.001678466796875, -0.0145263671875, -0.024169921875, 0.007293701171875, -0.002593994140625, 0.009765625, 0.001640319824218...

[ 6, 4, 96, 933, 16709, 5, 1837, 10298, 53, 9, 93645, 83783, 3647, 156982, 99929, 2394, 6635, 132208, 132265, 390, 67, 91693, 23320, 10179, 206730, 116419, 165830, 53894, 184, 864, 91977, 73011, 14364, 48400, 178121, 11435, 128405, 102107, 31...

[ 0.1695556640625, 0.1641845703125, 0.0968017578125, 0.2071533203125, 0.1412353515625, 0.1650390625, 0.23876953125, 0.1729736328125, 0.16650390625, 0.13330078125, 0.1690673828125, 0.1793212890625, 0.2034912109375, 0.1685791015625, 0.216796875, 0.1727294921875, 0.1944580078125, 0.1237...

embed

9401026_c0

9401026

haskell

0

Title: Tree Traversal in Haskell Problem title: Tree Traversal in Haskell Tags: haskell Problem: Tree Traversal in Haskell Here is a peice of code to traverse a tree which is not working: data Tree = Leaf Int | Node Int Tree Tree deriving Show preorder(Leaf n) = [n] preorder(Node n t0 t1) = [n] ++ (preorder t0) ++ (pre...

Tree Traversal in Haskell Tree Traversal in Haskell haskell Tree Traversal Haskell Leaf Node Show Tree Traversal in Haskell Here is a peice of code to traverse a tree which is not working: I have been asked to execute the following: When I execute the above statement it returns back as it is, when it should return: How...

[ 0.023193359375, -0.000640869140625, 0.007720947265625, -0.000732421875, 0.0274658203125, 0.017333984375, -0.0257568359375, -0.01055908203125, -0.017578125, -0.045166015625, -0.005096435546875, -0.01458740234375, -0.008056640625, -0.01220703125, 0.005126953125, 0.006744384765625, 0.00...

[ 101344, 4937, 814, 2317, 20625, 142508, 1556, 636, 2407, 438, 112, 17367, 280, 2980, 18151, 37317, 13, 53201, 3129, 83, 959, 20697, 37170, 71924, 25632, 36917, 63805, 30646, 4420, 237, 3229, 442, 5608, 30022, 903 ]

[ 0.2442626953125, 0.1219482421875, 0.1884765625, 0.12451171875, 0.1400146484375, 0.2301025390625, 0.120849609375, 0.03167724609375, 0.1160888671875, 0.09185791015625, 0.0858154296875, 0.14306640625, 0.00164794921875, 0.042724609375, 0.1375732421875, 0.2081298828125, 0.1015625, 0.217...

embed

29807762_c0

29807762

haskell

0

Title: Haskell code to exclude numbers for Sieve of Eratosthenes not working as expected Problem title: Haskell code to exclude numbers for Sieve of Eratosthenes not working as expected Tags: haskell, sieve-of-eratosthenes, algorithm Problem: Haskell code to exclude numbers for Sieve of Eratosthenes not working as expe...

Haskell code to exclude numbers for Sieve of Eratosthenes not working as expected Haskell code to exclude numbers for Sieve of Eratosthenes not working as expected haskell sieve-of-eratosthenes algorithm Haskell Sieve Eratosthenes Integral p:ps Haskell code to exclude numbers for Sieve of Eratosthenes not working as ex...

[ -0.015380859375, 0.028564453125, 0.00162506103515625, 0.006072998046875, 0.0015411376953125, -0.0035400390625, 0.003662109375, -0.0076904296875, 0.00445556640625, 0.005859375, 0.011474609375, 0.0078125, 0.0264892578125, 0.00189208984375, 0, 0.00396728515625, 0.0152587890625, 0.0107...

[ 20625, 142508, 18151, 39041, 112, 101935, 727, 272, 111, 14825, 1952, 2347, 1444, 20697, 237, 84751, 959, 1556, 78, 3134, 4390, 13164, 232, 234873, 204681, 915, 12, 6423, 100, 208124, 26265, 20809, 1295, 706, 1861, 28412, 87235, 29954, 7213...

[ 0.1217041015625, 0.2117919921875, 0.1558837890625, 0.167724609375, 0.05364990234375, 0.171630859375, 0.16064453125, 0.1597900390625, 0.1080322265625, 0.1048583984375, 0.135009765625, 0.148681640625, 0.083251953125, 0.140380859375, 0.040191650390625, 0.0877685546875, 0.046173095703125...

embed

33353580_c0

33353580

haskell

0

Title: How to retrieve first false condition applied to a list Problem title: How to retrieve first false condition applied to a list Tags: haskell Problem: How to retrieve first false condition applied to a list I'm writing a program in Haskell that assumes some input from stdin which should be validated according to ...

How to retrieve first false condition applied to a list How to retrieve first false condition applied to a list haskell How E.g How to retrieve first false condition applied to a list I'm writing a program in Haskell that assumes some input from stdin which should be validated according to some parameters. From a bunch...

[ -0.006500244140625, -0.003173828125, 0.003448486328125, 0.0025634765625, -0.0028228759765625, 0.00823974609375, -0.00762939453125, 0.000789642333984375, -0.0091552734375, -0.0036163330078125, 0.002166748046875, -0.0223388671875, 0.0098876953125, 0.006561279296875, -0.0164794921875, 0.0...

[ 11249, 456, 3996, 3134, 5117, 98320, 35431, 190659, 47, 5303, 1556, 142508, 32562, 1528, 20625, 41591, 107730, 6138, 3035, 44622, 171859, 147306, 27289, 275, 30646, 142484, 3642, 62163, 22225, 184, 6528, 59911, 32354, 96, 141956, 876, 69112, ...

[ 0.0318603515625, 0.0843505859375, 0.130859375, 0.1046142578125, 0.166748046875, 0.26513671875, 0.235595703125, 0.1558837890625, 0.0670166015625, 0.203369140625, 0.117919921875, 0.1993408203125, 0.0178680419921875, 0.055267333984375, 0.10015869140625, 0.024993896484375, 0.070861816406...

embed

64032803_c0

64032803

haskell

0

Title: Overlapping instances error with single instance in Haskell Problem title: Overlapping instances error with single instance in Haskell Tags: haskell, ghc Problem: Overlapping instances error with single instance in Haskell I have the following code on Haskell: {-# LANGUAGE MultiParamTypeClasses, FlexibleInstance...

Overlapping instances error with single instance in Haskell Overlapping instances error with single instance in Haskell haskell ghc Data.Proxy a Overlapping Haskell LANGUAGE MultiParamTypeClasses FlexibleInstances ExistentialQuantification ConstraintKinds Maybe Ctx Just Proxy Nothing Matching Defined Main.hs:14:10 Ther...

[ 0.005462646484375, -0.0013427734375, 0.005645751953125, -0.00994873046875, 0.004150390625, 0.01385498046875, -0.006195068359375, -0.01202392578125, 0.01434326171875, -0.031982421875, -0.0224609375, -0.02197265625, 0.01190185546875, 0.0028228759765625, 0.00147247314453125, 0.00454711914...

[ 9578, 143, 26783, 110527, 7, 18499, 678, 11001, 20625, 142508, 1556, 31380, 238, 11809, 10752, 50878, 98064, 19335, 55292, 196707, 140803, 180842, 2661, 116071, 122688, 2816, 425, 1250, 182747, 67407, 5983, 12321, 15110, 8622, 360, 587, 3334, ...

[ 0.153076171875, 0.2303466796875, 0.0943603515625, 0.256103515625, 0.00262451171875, 0.193359375, 0.048980712890625, 0.1998291015625, 0.1318359375, 0.23583984375, 0.1171875, 0.0721435546875, 0.047943115234375, 0.052703857421875, 0.07330322265625, 0.2032470703125, 0.0535888671875, 0....

embed

12039704_c0

12039704

haskell

0

Title: Determine ModuleName of loaded target Problem title: Determine ModuleName of loaded target Tags: haskell, ghc, ghc-api Problem: Determine ModuleName of loaded target I was wondering how do you determine the ModuleName of the file you've just loaded in ghc using the API. If you look at the Documentation of the AP...

Determine ModuleName of loaded target Determine ModuleName of loaded target haskell ghc ghc-api Determine ModuleName HscEnv Determine ModuleName of loaded target I was wondering how do you determine the ModuleName of the file you've just loaded in ghc using the API. If you look at the Documentation of the API they alwa...

[ 0.01324462890625, 0.01055908203125, 0.0147705078125, 0.03515625, -0.01080322265625, 0.0240478515625, -0.0103759765625, -0.00445556640625, -0.0242919921875, -0.0361328125, 0.0072021484375, -0.038818359375, -0.023193359375, -0.0159912109375, 0.005645751953125, -0.00174713134765625, -0....

[ 262, 30524, 63014, 13, 163612, 111, 72367, 297, 30388, 1556, 142508, 31380, 238, 40897, 572, 10382, 7768, 334, 83324, 70, 11435, 272, 1660, 61687, 43101, 3714, 88996, 9351, 8108, 23, 2663, 12096, 42548, 41382, 39580, 4568, 30646, 2811, 527,...

[ 0.0802001953125, 0.1553955078125, 0.21240234375, 0.1226806640625, 0.2376708984375, 0.078857421875, 0.1751708984375, 0.0963134765625, 0.2490234375, 0.0989990234375, 0.1962890625, 0.1260986328125, 0.150146484375, 0.1072998046875, 0.0909423828125, 0.09710693359375, 0.0938720703125, 0....

embed

12540078_c0

12540078

haskell

0

Title: Haskell: Splitting a list into 2 at index k Problem title: Haskell: Splitting a list into 2 at index k Tags: haskell, list, split Problem: Haskell: Splitting a list into 2 at index k I'm pretty new to Haskell, and I'm having a little trouble. I'm trying to implement a function that takes a list, and an int. the ...

Haskell: Splitting a list into 2 at index k Haskell: Splitting a list into 2 at index k haskell list split Haskell Splitting Empty Number Haskell: Splitting a list into 2 at index k I'm pretty new to Haskell, and I'm having a little trouble. I'm trying to implement a function that takes a list, and an int. the int is s...

[ -0.015380859375, 0.0027923583984375, 0.0098876953125, -0.00994873046875, -0.0106201171875, 0.02392578125, -0.01544189453125, -0.0123291015625, 0.01177978515625, 0.01531982421875, 0.0174560546875, -0.021240234375, -0.021240234375, 0.0155029296875, 0.0135498046875, 0.00188446044921875, ...

[ 20625, 142508, 46474, 1916, 5303, 3934, 116, 99, 63262, 472, 1556, 65450, 31678, 939, 103332, 28875, 3525, 47, 10176, 63134, 31577, 29479, 32354, 51776, 10, 23, 18, 134598, 186, 80836, 5117, 70541, 80854, 17932, 21748, 4568, 12830, 831, 206...

[ 0.13330078125, 0.22412109375, 0.212890625, 0.056732177734375, 0.23046875, 0.159423828125, 0.187255859375, 0.101318359375, 0.16552734375, 0.1669921875, 0.1190185546875, 0.2435302734375, 0.161376953125, 0.1099853515625, 0.15478515625, 0.0233612060546875, 0.053985595703125, 0.05374145...

embed

14912007_c0

14912007

haskell

0

Title: Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? Problem title: Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? Tags: haskell, lazy-evaluation Problem: Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? get...

Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? haskell lazy-evaluation Lazy How Lazy IO in haskell: How to return a lazy list that is generated by some blocking IO? What I expect to see is that the...

[ -0.004730224609375, 0.0113525390625, 0.010009765625, -0.01708984375, 0.00872802734375, -0.0052490234375, 0.02978515625, -0.002166748046875, 0.0042724609375, -0.01708984375, 0.004669189453125, -0.0283203125, -0.0184326171875, -0.006591796875, -0.00738525390625, 0.01043701171875, 0.021...

[ 239, 3285, 17780, 1556, 142508, 11249, 30646, 21, 5303, 139392, 46389, 159258, 214, 41206, 1957, 107730, 13315, 28, 3089, 12638, 1733, 7103, 87, 24234, 155581, 4966, 33720, 3714, 450, 903, 83, 54241, 40956, 24189, 756, 36917, 51339, 18151, ...

[ 0.1583251953125, 0.199462890625, 0.18701171875, 0.103271484375, 0.23193359375, 0.0183563232421875, 0.207763671875, 0.1361083984375, 0.158447265625, 0.09716796875, 0.1639404296875, 0.1339111328125, 0.011322021484375, 0.096435546875, 0.07000732421875, 0.1693115234375, 0.1446533203125, ...

embed

26329959_c1

26329959

haskell

1

:10: Illegal instance declaration for ‘Parser Char st Char’ The liberal coverage condition fails in class ‘Parser’ for functional dependency: ‘p -> st’ Reason: lhs type ‘Char’ does not determine rhs type ‘st’ In the instance declaration for ‘Parser Char st Char’ cabal: Error: some packages failed to install: geordi-0 f...

[ -0.001678466796875, 0.0010833740234375, 0.0087890625, -0.0072021484375, -0.003387451171875, 0.025390625, -0.000751495361328125, -0.035888671875, -0.007720947265625, 0.0030517578125, -0.003936767578125, -0.03076171875, 0.01141357421875, -0.0111083984375, -0.006683349609375, 0.0047607421...

[ 15110, 12, 891, 86966, 110527, 21635, 100, 28636, 2189, 21656, 6138, 26697, 154271, 35431, 35782, 7, 18507, 123309, 42548, 27771, 254, 33079, 236267, 96, 127, 10644, 84068, 14602, 959, 83324, 1690, 271, 109524, 212059, 3060, 98169, 165523, 20...

[ 0.2484130859375, 0.026885986328125, 0.08367919921875, 0.193603515625, 0.2276611328125, 0.184326171875, 0.0216827392578125, 0.168701171875, 0.2138671875, 0.202880859375, 0.1434326171875, 0.25048828125, 0.2259521484375, 0.19091796875, 0.198974609375, 0.0928955078125, 0.16552734375, 0...

embed

26586591_c0

26586591

haskell

0

Title: Haskell: Efficient way to bitwise cast String to Integer? Problem title: Haskell: Efficient way to bitwise cast String to Integer? Tags: haskell Problem: Haskell: Efficient way to bitwise cast String to Integer? What's the most efficient way to cast String (or ByteString ) to an integral type bitwise, for exampl...

Haskell: Efficient way to bitwise cast String to Integer? Haskell: Efficient way to bitwise cast String to Integer? haskell Haskell Efficient Integer ByteString smallEndianStringToInt32 Int32 some_string int32_t Haskell: Efficient way to bitwise cast String to Integer? What's the most efficient way to cast String (or B...

[ -0.0162353515625, 0.00335693359375, -0.005218505859375, 0.021484375, -0.0107421875, 0.025146484375, -0.0245361328125, -0.01446533203125, -0.0031280517578125, -0.0037078857421875, 0.00909423828125, -0.020751953125, 0.0002460479736328125, 0.021484375, -0.00811767578125, -0.014404296875, ...

[ 20625, 142508, 24500, 45964, 3917, 4785, 90825, 37702, 23351, 214, 47, 44401, 241, 1556, 3311, 67, 71713, 19336, 7768, 27201, 7763, 4153, 18, 6460, 360, 3060, 91693, 23, 2684, 93766, 28970, 10644, 313, 831, 42856, 54, 1884, 6183, 27226, 5...

[ 0.1259765625, 0.25390625, 0.1378173828125, 0.1005859375, 0.08544921875, 0.1416015625, 0.2060546875, 0.1732177734375, 0.2105712890625, 0.1126708984375, 0.1192626953125, 0.2198486328125, 0.012481689453125, 0.09185791015625, 0.077392578125, 0.111083984375, 0.194091796875, 0.0941162109...

embed

49007617_c0

49007617

haskell

0

Title: How to remove a duplicated element in a function with a list? Problem title: How to remove a duplicated element in a function with a list? Tags: ghci, element, function, list, haskell Problem: How to remove a duplicated element in a function with a list? I'm a newbie when it comes to Haskell and I'm confused wit...

How to remove a duplicated element in a function with a list? How to remove a duplicated element in a function with a list? ghci element function list haskell How x:xs How to remove a duplicated element in a function with a list? I'm a newbie when it comes to Haskell and I'm confused with a few things. I'm trying to re...

[ -0.0078125, 0.00946044921875, 0.015869140625, -0.01611328125, -0.015625, 0.00421142578125, 0.0140380859375, -0.01092529296875, 0.0283203125, -0.01287841796875, 0.00054931640625, -0.00140380859375, 0.016845703125, -0.009033203125, -0.0025787353515625, -0.0009613037109375, 0.0108032226...

[ 11249, 47, 87388, 10, 171763, 3674, 12830, 23, 32354, 678, 5303, 31380, 318, 1556, 142508, 425, 3525, 9014, 20625, 55681, 10846, 31577, 80854, 903, 81887, 24927, 11809, 154663, 315, 275, 378, 2174, 8096, 62351, 304, 305, 138, 7464, 30646, ...

[ 0.1058349609375, 0.064697265625, 0.204345703125, 0.0272979736328125, 0.26025390625, 0.142333984375, 0.203125, 0.044891357421875, 0.2110595703125, 0.1290283203125, 0.1680908203125, 0.0958251953125, 0.1405029296875, 0.09979248046875, 0.2327880859375, 0.0257415771484375, 0.0075073242187...

embed

56387023_c1

56387023

haskell

1

c w) = [(c, [])] buildCodelist (Fork l r w) = map (addBit zer) (buildCodelist l) ++ map (addBit one) (buildCodelist r) where addBit b = second (b :) stringTree :: String -> HTree stringTree = buildTree . freqList stringCodemap :: Bits a => String -> Codemap a stringCodemap = buildCodemap . stringTree encode :: Bits a ...

[ 0.01080322265625, 0.0033416748046875, -0.0216064453125, 0.000545501708984375, 0.0003376007080078125, 0.00689697265625, -0.006988525390625, -0.0257568359375, 0.00927734375, -0.0106201171875, -0.0185546875, -0.032470703125, 0.0120849609375, 0.026123046875, -0.013916015625, -0.01867675781...

[ 501, 148, 2203, 238, 268, 45367, 114211, 6562, 18537, 92, 96, 1690, 22288, 11, 4028, 571, 217, 20667, 177149, 37223, 1632, 15190, 876, 17932, 275, 1094, 79315, 62731, 13, 1984, 23351, 33079, 572, 5, 12478, 154663, 62346, 27774, 28864, 22,...

[ 0.0975341796875, 0.18115234375, 0.0787353515625, 0.0927734375, 0.0197906494140625, 0.20654296875, 0.2568359375, 0.273193359375, 0.1802978515625, 0.1004638671875, 0.0706787109375, 0.050445556640625, 0.1812744140625, 0.0172119140625, 0.127197265625, 0.0804443359375, 0.1094970703125, ...

embed

34659580_c0

34659580

haskell

0

Title: With haskell's turtle library, how to extract filename as String from FilePath? Problem title: With haskell's turtle library, how to extract filename as String from FilePath? Tags: haskell, haskell-turtle Problem: With haskell's turtle library, how to extract filename as String from FilePath? When usin...

With haskell's turtle library, how to extract filename as String from FilePath? With haskell's turtle library, how to extract filename as String from FilePath? haskell haskell-turtle FilePath Couldn Turtle.FilePath Expected IHaskellSysIO.FilePath Actual With haskell's turtle library, how to extract filename a...

[ 0.01031494140625, 0.0087890625, -0.0022735595703125, 0.0228271484375, -0.0201416015625, -0.0098876953125, -0.0169677734375, 0.00921630859375, -0.0128173828125, 0.010986328125, 0.00860595703125, -0.027587890625, -0.00445556640625, 0.020751953125, -0.0186767578125, 0.008544921875, 0.00...

[ 17106, 1556, 142508, 3768, 2130, 17991, 35773, 3642, 125663, 11435, 11627, 237, 23351, 214, 1295, 42724, 683, 10519, 1294, 47, 987, 191147, 4252, 174350, 60075, 13, 87, 6495, 65183, 17780, 100582, 5646, 163612, 10644, 18499, 12921, 479, 822, ...

[ 0.037078857421875, 0.08642578125, 0.1888427734375, 0.0654296875, 0.1175537109375, 0.19775390625, 0.1309814453125, 0.0218048095703125, 0.1673583984375, 0.09661865234375, 0.185791015625, 0.0791015625, 0.159912109375, 0.1007080078125, 0.0706787109375, 0.130615234375, 0.126708984375, 0...

embed

53294277_c0

53294277

haskell

0

Title: Re-write 'map intToDigit' with a fold... Problem title: Re-write 'map intToDigit' with a fold... Tags: haskell Problem: Re-write 'map intToDigit' with a fold... So this one seems like it should be super-simple... but I'm not sure where to stick the 'fold' in (obviously you could fold either w...

Re-write 'map intToDigit' with a fold... Re-write 'map intToDigit' with a fold... haskell Re-write Char Data.Char Re-write 'map intToDigit' with a fold... So this one seems like it should be super-simple... but I'm not sure where to stick the 'fold' in (obviously you could fold either way)... It say...

[ -0.0157470703125, 0.00008249282836914062, 0.0135498046875, 0.00830078125, -0.031494140625, 0.0238037109375, -0.0029449462890625, -0.0006866455078125, -0.00127410888671875, -0.004180908203125, -0.014404296875, -0.03759765625, 0.000873565673828125, 0.0556640625, -0.01202392578125, -0.014...

[ 853, 434, 18781, 3768, 62346, 23, 18, 7763, 14055, 15769, 678, 10, 42822, 27, 1556, 142508, 21656, 11809, 84068, 903, 37202, 1884, 5608, 1601, 191560, 9077, 7440, 47593, 70, 5809, 17378, 32354, 71713, 214, 1984, 4153, 33079, 17368, 324, 1...

[ 0.1512451171875, 0.1370849609375, 0.177490234375, 0.09375, 0.2015380859375, 0.1204833984375, 0.150634765625, 0.1981201171875, 0.1260986328125, 0.21240234375, 0.061767578125, 0.009307861328125, 0.2464599609375, 0.0174713134765625, 0.1539306640625, 0.2469482421875, 0.1893310546875, 0...

embed

5335473_c0

5335473

haskell

0

Title: Having trouble with recursion and Type mismatching in Haskell Problem title: Having trouble with recursion and Type mismatching in Haskell Tags: haskell, functional-programming, recursion Problem: Having trouble with recursion and Type mismatching in Haskell -- genrep genrep :: a -> Int -> [a] genrep a n | n == ...

Having trouble with recursion and Type mismatching in Haskell Having trouble with recursion and Type mismatching in Haskell haskell functional-programming recursion Having Type Haskell n-1 Expression Term Does Having trouble with recursion and Type mismatching in Haskell So I'm trying to make a simple replication funct...

[ -0.0147705078125, 0.01068115234375, -0.006072998046875, 0.0147705078125, -0.007415771484375, 0.01080322265625, -0.00537109375, -0.004302978515625, -0.00225830078125, -0.01409912109375, 0.0106201171875, -0.0164794921875, 0.01251220703125, 0.008544921875, -0.003692626953125, -0.026245117...

[ 171855, 63134, 678, 195625, 1830, 136, 60457, 1239, 98753, 214, 20625, 142508, 1556, 123309, 28966, 653, 5759, 25129, 2994, 101790, 23, 31577, 8781, 456, 182867, 32354, 5646, 189534, 10644, 10, 143126, 20028, 36917, 959, 48903, 4488, 13695, 9...

[ 0.051544189453125, 0.1802978515625, 0.047515869140625, 0.2169189453125, 0.08087158203125, 0.05462646484375, 0.215087890625, 0.13037109375, 0.25732421875, 0.05145263671875, 0.142822265625, 0.237060546875, 0.13037109375, 0.107421875, 0.0384521484375, 0.08770751953125, 0.1248779296875, ...

embed

48102204_c0

48102204

haskell

0

Title: Nice way to write an unsatisfiable constraint? Problem title: Nice way to write an unsatisfiable constraint? Tags: haskell Problem: Nice way to write an unsatisfiable constraint? I've found myself writing this: data T1 data T2 type Unsatisfiable = T1 ~ T2 So I can do something like this: type family NEq t1 t2 ::...

Nice way to write an unsatisfiable constraint? Nice way to write an unsatisfiable constraint? haskell Nice Unsatisfiable NEq Constraint HasProxyT ProxyT Nice way to write an unsatisfiable constraint? I've found myself writing this: So I can do something like this: Then I can use HasProxyT to restrict default methods to...

[ 0.008056640625, 0.004486083984375, -0.007232666015625, -0.0235595703125, 0.0018310546875, -0.0247802734375, -0.01019287109375, -0.0072021484375, 0.0021514892578125, -0.00579833984375, -0.0262451171875, -0.00122833251953125, 0.01312255859375, 0.018798828125, -0.005645751953125, 0.024414...

[ 73398, 3917, 33022, 2234, 50958, 1029, 2886, 158, 2816, 4288, 1556, 142508, 992, 7, 9960, 864, 1657, 20625, 10752, 50878, 618, 1250, 14037, 35978, 32562, 831, 1884, 903, 4527, 173072, 114977, 150624, 959, 40956, 502, 10644, 5701, 61261, 727...

[ 0.1552734375, 0.04833984375, 0.129150390625, 0.0906982421875, 0.17138671875, 0.1583251953125, 0.2288818359375, 0.0927734375, 0.176025390625, 0.1025390625, 0.0885009765625, 0.1705322265625, 0.131591796875, 0.10125732421875, 0.09051513671875, 0.11669921875, 0.0791015625, 0.1370849609...

embed

48153186_c0

48153186

haskell

0

Title: Type Resolution in Haskell: MegaParsec/ Parsing a single space Problem title: Type Resolution in Haskell: MegaParsec/ Parsing a single space Tags: haskell, megaparsec Problem: Type Resolution in Haskell: MegaParsec/ Parsing a single space If I look at the documentation for space it suggests using void spaceChar ...

Type Resolution in Haskell: MegaParsec/ Parsing a single space Type Resolution in Haskell: MegaParsec/ Parsing a single space haskell megaparsec a Type Resolution Haskell MegaParsec Parsing Parser Couldn Token Char Type Resolution in Haskell: MegaParsec/ Parsing a single space If I look at the documentation for space i...

[ -0.011962890625, 0.0030364990234375, 0.011474609375, 0.040283203125, 0.00124359130859375, 0.0006561279296875, -0.00592041015625, -0.019287109375, -0.003936767578125, 0.007354736328125, 0.01287841796875, 0.007598876953125, -0.0194091796875, 0.002593994140625, -0.0172119140625, 0.0094604...

[ 60457, 853, 166589, 20625, 142508, 26842, 28636, 39797, 64, 2392, 6953, 11001, 32628, 23, 12, 1556, 31534, 2500, 2189, 191147, 717, 1098, 21656, 6713, 209806, 42459, 17368, 2292, 71, 84068, 33306, 20653, 9790, 2046, 5351, 125195, 26785, 1284,...

[ 0.2230224609375, 0.0889892578125, 0.2098388671875, 0.123291015625, 0.2191162109375, 0.1298828125, 0.112060546875, 0.167724609375, 0.0304718017578125, 0.1134033203125, 0.0421142578125, 0.1026611328125, 0.196533203125, 0.011474609375, 0.000823974609375, 0.1102294921875, 0.122314453125,...

embed

9471902_c0

9471902

haskell

0

Title: What's the modern way to access C2HS marshalling functions? Problem title: What's the modern way to access C2HS marshalling functions? Tags: haskell, c2hs, ffi Problem: What's the modern way to access C2HS marshalling functions? I want to use the cFromEnum function, but this resides in the C2HS module,...

What's the modern way to access C2HS marshalling functions? What's the modern way to access C2HS marshalling functions? haskell c2hs ffi What C2HS BNType Show NodeVector get_nodes_by_type What's the modern way to access C2HS marshalling functions? I want to use the cFromEnum function, but this resides in the ...

[ -0.00799560546875, 0.017578125, -0.0194091796875, 0.0118408203125, -0.00106048583984375, 0.0283203125, -0.0098876953125, -0.00506591796875, -0.00799560546875, -0.047119140625, 0.00286865234375, -0.040283203125, 0.01226806640625, -0.00921630859375, -0.026123046875, -0.031982421875, -0...

[ 4865, 3768, 5744, 3917, 47, 17203, 313, 304, 38131, 10283, 29907, 214, 32354, 7, 1556, 142508, 501, 127, 24500, 30262, 196707, 17367, 438, 112, 26455, 18770, 2046, 157, 988, 1272, 50986, 3444, 4527, 168407, 647, 2606, 157176, 88996, 51, 8...

[ 0.010345458984375, 0.06134033203125, 0.181884765625, 0.07489013671875, 0.0302734375, 0.161376953125, 0.1082763671875, 0.219482421875, 0.2191162109375, 0.1201171875, 0.169921875, 0.06402587890625, 0.204833984375, 0.07891845703125, 0.1112060546875, 0.21435546875, 0.095947265625, 0.15...

embed

62736800_c0

62736800

haskell

0

Title: Haskell returning list with hexadecimal value Problem title: Haskell returning list with hexadecimal value Tags: haskell Problem: Haskell returning list with hexadecimal value I am trying to define the function "decToHex" which returns a list of chars that corresponds to the hexadecimal value of a given number. ...

Haskell returning list with hexadecimal value Haskell returning list with hexadecimal value haskell Haskell Char Couldn Expected Actual Haskell returning list with hexadecimal value I am trying to define the function "decToHex" which returns a list of chars that corresponds to the hexadecimal value of a given number. F...

[ -0.0035247802734375, -0.0164794921875, 0.0093994140625, 0.003875732421875, 0.0004177093505859375, -0.0023040771484375, -0.015380859375, -0.0181884765625, 0.006439208984375, 0.0033111572265625, 0.0162353515625, -0.037841796875, 0.0206298828125, 0.02197265625, -0.001953125, -0.0118408203...

[ 20625, 142508, 30646, 5303, 678, 764, 3798, 170753, 34292, 214, 1556, 21656, 191147, 19, 60075, 13, 89829, 100582, 289, 31577, 61924, 32354, 50718, 7763, 841, 3355, 21441, 7, 42518, 34475, 14012, 534, 3882, 2203, 617, 910, 1019, 903, 18499,...

[ 0.1328125, 0.221435546875, 0.1663818359375, 0.1654052734375, 0.042236328125, 0.1260986328125, 0.1544189453125, 0.183349609375, 0.1612548828125, 0.02386474609375, 0.121337890625, 0.163818359375, 0.104736328125, 0.059600830078125, 0.122802734375, 0.14404296875, 0.0294647216796875, 0....

embed

34364662_c1

34364662

haskell

1

GHC.IO.Handle.Types.Handle’ Failed, modules loaded: none. Yuck. Maybe the name is too long. Let's try all the child types: processRequest :: IO.Handle.Types.Handle -> [Char] -> IO () processRequest :: Handle.Types.Handle -> [Char] -> IO () processRequest :: Types.Handle -> [Char] -> IO () processRequest :: Handle -> [C...

[ 0.0059814453125, 0.0184326171875, -0.004486083984375, 0.01025390625, -0.02734375, 0.0240478515625, -0.00933837890625, -0.01904296875, 0.00543212890625, -0.025634765625, -0.0025482177734375, -0.045654296875, 0.004608154296875, 0.006103515625, -0.0086669921875, 0.0032806396484375, -0.0...

[ 527, 73265, 17780, 135679, 133, 196707, 7, 26, 190355, 297, 88996, 72367, 351, 13, 15127, 2594, 83425, 9351, 4989, 9790, 756, 29041, 52895, 9433, 4332, 75616, 84068, 10639, 60457, 438, 163, 5701, 16750, 7108, 3917, 7413, 6097, 41877, 17304,...

[ 0.10369873046875, 0.1859130859375, 0.1951904296875, 0.2191162109375, 0.210205078125, 0.25, 0.027587890625, 0.0052490234375, 0.18896484375, 0.09100341796875, 0.20068359375, 0.1412353515625, 0.07568359375, 0.03363037109375, 0.0152435302734375, 0.0252227783203125, 0.036468505859375, 0...

embed

14777388_c0

14777388

haskell

0

Title: Haskell: Typeclass implies other typeclass Problem title: Haskell: Typeclass implies other typeclass Tags: haskell Problem: Haskell: Typeclass implies other typeclass Is it possible to have a typeclass imply another typeclass in Haskell? For example let's say there is a bunch of "things" that can be ordered by a...

Haskell: Typeclass implies other typeclass Haskell: Typeclass implies other typeclass haskell Haskell Typeclass Person OrdByKey Ord Haskell: Typeclass implies other typeclass Is it possible to have a typeclass imply another typeclass in Haskell? For example let's say there is a bunch of "things" that can be ordered by ...

[ -0.004730224609375, -0.00093841552734375, 0.0126953125, -0.0017852783203125, 0.014892578125, 0.01904296875, -0.0064697265625, -0.0146484375, -0.0028228759765625, -0.00762939453125, -0.003143310546875, 0.01007080078125, 0.00830078125, 0.006439208984375, -0.017333984375, -0.0051879882812...

[ 20625, 142508, 60457, 67413, 35388, 3789, 10644, 12, 90, 1556, 15270, 35379, 75358, 162429, 2071, 442, 7722, 765, 21980, 538, 15700, 23, 147306, 64113, 831, 12989, 390, 191145, 71864, 57346, 5809, 61924, 80596, 2886, 22799, 18507, 110527, 216...

[ 0.1146240234375, 0.2236328125, 0.1749267578125, 0.2403564453125, 0.1678466796875, 0.092041015625, 0.1807861328125, 0.013671875, 0.00506591796875, 0.07989501953125, 0.1502685546875, 0.1148681640625, 0.0870361328125, 0.119384765625, 0.019989013671875, 0.02166748046875, 0.137451171875, ...

embed

15354636_c1

15354636

haskell

1

become deadlocked, each waiting for more data from the other. After I send my own response, I can repeat the process by parsing the next type of packet I expect from the server. So in brief, is it possible to leverage my current ByteString parsing code in combination with lazy IO to read exactly the right number of by...

[ -0.0003337860107421875, 0.0179443359375, 0.00140380859375, -0.0098876953125, -0.00138092041015625, 0.01263427734375, -0.0033416748046875, 0.0029296875, 0.01416015625, -0.0147705078125, 0.03515625, -0.02294921875, 0.0179443359375, -0.0027313232421875, -0.000652313232421875, 0.0142822265...

[ 24209, 103494, 21135, 297, 12638, 89289, 100, 1286, 2053, 3789, 25379, 10002, 57553, 831, 119140, 9433, 366, 6953, 11737, 10644, 43824, 126, 41206, 10723, 59335, 83, 7722, 21962, 4588, 43581, 3311, 67, 71713, 214, 18151, 162515, 678, 21, 32...

[ 0.12939453125, 0.08599853515625, 0.23681640625, 0.10284423828125, 0.06622314453125, 0.1553955078125, 0.0304107666015625, 0.10198974609375, 0.079833984375, 0.0416259765625, 0.0335693359375, 0.0731201171875, 0.1624755859375, 0.052978515625, 0.12255859375, 0.00579833984375, 0.1384277343...

embed

15599635_c0

15599635

haskell

0

Title: Where can I find a good manual for warp server? Problem title: Where can I find a good manual for warp server? Tags: webserver, yesod, web-development-server, haskell Problem: Where can I find a good manual for warp server? I created a yesod webapp using yesod init . During development I used yesod devel to run ...

Where can I find a good manual for warp server? Where can I find a good manual for warp server? webserver yesod web-development-server haskell Where Where can I find a good manual for warp server? I created a yesod webapp using yesod init . During development I used yesod devel to run the warp server on debug mode. Now...

[ -0.0037078857421875, 0.003997802734375, 0.0050048828125, -0.0052490234375, -0.021728515625, 0.027587890625, -0.0028076171875, -0.009033203125, 0.0079345703125, -0.0147705078125, 0.0159912109375, -0.0230712890625, 0.00994873046875, -0.007049560546875, -0.0142822265625, -0.00063323974609...

[ 7413, 10, 4127, 23009, 100, 1631, 254, 10723, 1467, 39642, 2422, 23722, 229815, 1556, 142508, 831, 75935, 9007, 17368, 23, 217, 34754, 11814, 8, 2601, 11675, 85779, 13736, 122799, 118276, 11389, 13158, 50061, 304, 2527, 5870, 9795, 1430, 16...

[ 0.06488037109375, 0.043121337890625, 0.09228515625, 0.2376708984375, 0.06195068359375, 0.1796875, 0.17529296875, 0.22412109375, 0.06146240234375, 0.1441650390625, 0.1273193359375, 0.219482421875, 0.08251953125, 0.0877685546875, 0.1993408203125, 0.00634765625, 0.052276611328125, 0.1...

embed

52249028_c0

52249028

haskell

0

Title: Can I replicate what nix-build does with nix-shell and cabal build? Problem title: Can I replicate what nix-build does with nix-shell and cabal build? Tags: cabal, nix, cabal-install, haskell Problem: Can I replicate what nix-build does with nix-shell and cabal build? I'm using the splendid Haskell library Miso ...

Can I replicate what nix-build does with nix-shell and cabal build? Can I replicate what nix-build does with nix-shell and cabal build? cabal nix cabal-install haskell Can Can I replicate what nix-build does with nix-shell and cabal build? I'm using the splendid Haskell library Miso , which recommends using Nix. The RE...

[ -0.0235595703125, -0.0157470703125, -0.0019989013671875, 0.026123046875, -0.021240234375, 0.0025634765625, 0.0169677734375, 0.0107421875, 0.0011749267578125, 0.0130615234375, -0.0079345703125, -0.006988525390625, 0.01806640625, 0.0233154296875, -0.006805419921875, -0.01495361328125, ...

[ 4171, 143126, 67, 300, 425, 9, 177149, 14602, 678, 128019, 136, 109524, 45367, 80383, 1556, 142508, 87, 2367, 17368, 85453, 20625, 35773, 1294, 7950, 31, 67330, 1520, 188300, 10611, 8781, 13452, 831, 88303, 209806, 5122, 2843, 44677, 16750, ...

[ 0.07073974609375, 0.2193603515625, 0.106689453125, 0.11767578125, 0.1734619140625, 0.07391357421875, 0.2403564453125, 0.04425048828125, 0.0546875, 0.2171630859375, 0.0797119140625, 0.2198486328125, 0.217529296875, 0.126220703125, 0.0775146484375, 0.193603515625, 0.0301513671875, 0....

embed

42207457_c0

42207457

haskell

0

Title: Bidirectional Arrow Problem title: Bidirectional Arrow Tags: haskell, category-abstractions, arrow-abstraction Problem: Bidirectional Arrow I'm trying to capture a symmetrical data processing pipeline using arrows, and was wondering if bidirectional composition is possible. Control.Arrow exposes the following --...

Bidirectional Arrow Bidirectional Arrow haskell category-abstractions arrow-abstraction Bidirectional Arrow Left Category Right Bidirectional Arrow I'm trying to capture a symmetrical data processing pipeline using arrows, and was wondering if bidirectional composition is possible. Control.Arrow exposes the following w...

[ -0.00701904296875, -0.01324462890625, 0.0203857421875, 0.0140380859375, -0.01953125, 0.0211181640625, -0.00579833984375, 0.01226806640625, 0.0008087158203125, 0.01220703125, 0.0027008056640625, 0.004791259765625, -0.008056640625, -0.0091552734375, 0.006134033203125, -0.01129150390625, ...

[ 1843, 80581, 110117, 1172, 15555, 1556, 142508, 95487, 2055, 7, 117474, 118201, 2480, 49057, 90911, 31577, 141621, 230612, 6827, 2053, 9433, 137158, 2256, 17368, 333, 166577, 7722, 27131, 7614, 172554, 25632, 2367, 1884, 36510, 111, 80836, 1064...

[ 0.177978515625, 0.2003173828125, 0.125732421875, 0.116455078125, 0.192626953125, 0.0985107421875, 0.169677734375, 0.166015625, 0.06927490234375, 0.05316162109375, 0.116943359375, 0.25390625, 0.0843505859375, 0.1787109375, 0.1309814453125, 0.009552001953125, 0.09332275390625, 0.1561...

embed

45552591_c0

45552591

haskell

0

Title: Polymorphic types with purescript-bridge Problem title: Polymorphic types with purescript-bridge Tags: purescript, haskell Problem: Polymorphic types with purescript-bridge I have type in Haskell newtype Uid a = Uid {uidToText :: Text} deriving (Eq, Ord, Show, Data, Typeable, Generic) Using purescript-bridge lib...

Polymorphic types with purescript-bridge Polymorphic types with purescript-bridge purescript haskell a Polymorphic Uid Text Ord Show Data Typeable Generic SumType Haskell Proxy Data.Typeable.Internal.Typeable Polymorphic types with purescript-bridge I have type in Haskell Using purescript-bridge library mkSumType funct...

[ 0.004486083984375, 0.023193359375, 0.015625, 0.002593994140625, -0.007568359375, 0.0179443359375, 0.0283203125, 0.0081787109375, -0.0040283203125, -0.031982421875, 0.011962890625, -0.031494140625, 0.0184326171875, 0.003021240234375, -0.01318359375, -0.0125732421875, 0.015869140625, ...

[ 63306, 178851, 52895, 678, 34166, 32032, 80728, 1556, 142508, 345, 532, 24129, 35379, 17367, 11809, 60457, 2886, 88342, 36335, 196707, 20625, 1250, 50878, 44851, 10644, 35773, 19201, 294, 316, 32354, 831, 18, 3249, 111, 765, 17378, 30022 ]

[ 0.1641845703125, 0.2083740234375, 0.2308349609375, 0.06939697265625, 0.171630859375, 0.26025390625, 0.1917724609375, 0.1041259765625, 0.20947265625, 0.045654296875, 0.1063232421875, 0.118896484375, 0.164306640625, 0.061370849609375, 0.067138671875, 0.161376953125, 0.126708984375, 0...

embed

69864210_c0

69864210

haskell

0

Title: Applying some operation F to each element of a grid? - Haskell Problem title: Applying some operation F to each element of a grid? - Haskell Tags: haskell Problem: Applying some operation F to each element of a grid? - Haskell I am new to Haskell and have some questions regarding applying a function say f to eac...

Applying some operation F to each element of a grid? - Haskell Applying some operation F to each element of a grid? - Haskell haskell Applying Haskell Grid Show Applying some operation F to each element of a grid? - Haskell I am new to Haskell and have some questions regarding applying a function say f to each element ...

[ -0.007415771484375, -0.0022430419921875, 0.00927734375, -0.0023651123046875, 0.0008544921875, -0.006988525390625, -0.0015716552734375, -0.00506591796875, -0.01153564453125, 0.01531982421875, 0.0296630859375, 0.0024871826171875, -0.0098876953125, 0.0167236328125, -0.0223388671875, 0.002...

[ 5659, 538, 3060, 41018, 563, 47, 12638, 12830, 120067, 20625, 142508, 1556, 31945, 71, 17367, 3525, 17582, 59911, 10, 32354, 5154, 1238, 60457, 28670, 10763, 155455, 104250, 5773, 48402, 32036, 111, 831, 70, 22288, 241957, 52895, 18499, 84751...

[ 0.1292724609375, 0.09613037109375, 0.0673828125, 0.1890869140625, 0.2308349609375, 0.09698486328125, 0.1265869140625, 0.1591796875, 0.23828125, 0.111572265625, 0.191162109375, 0.0616455078125, 0.1552734375, 0.0718994140625, 0.1463623046875, 0.05023193359375, 0.0232391357421875, 0.1...

embed

3228856_c0

3228856

haskell

0

Title: Predicate Logic in Haskell Problem title: Predicate Logic in Haskell Tags: haskell, first-order-logic, data-structures, context-free-grammar Problem: Predicate Logic in Haskell I've been using the following data structure for the representation of propositional logic in Haskell: data Prop = Pred String | Not Pro...

Predicate Logic in Haskell Predicate Logic in Haskell haskell first-order-logic data-structures context-free-grammar Predicate Logic Haskell Prop Pred Not Impl Equiv Ord Predicate Logic in Haskell I've been using the following data structure for the representation of propositional logic in Haskell: Any comments on this...

[ 0.0257568359375, 0.000782012939453125, 0.0103759765625, 0.0279541015625, -0.00946044921875, 0.01458740234375, 0.00274658203125, -0.02978515625, -0.0118408203125, -0.02880859375, -0.00958251953125, -0.0023651123046875, -0.01214599609375, -0.0234375, -0.00848388671875, 0.01312255859375, ...

[ 7145, 2063, 67, 50592, 238, 23, 20625, 142508, 1556, 5117, 80596, 137043, 2053, 137656, 43701, 32087, 107415, 43796, 11205, 29128, 145666, 334, 35379, 17368, 25632, 45646, 18811, 89261, 289, 62775, 81907, 65042, 83898, 34831, 172155, 1653, 4127...

[ 0.17578125, 0.2093505859375, 0.0830078125, 0.207275390625, 0.0232696533203125, 0.03753662109375, 0.1368408203125, 0.2318115234375, 0.1240234375, 0.009063720703125, 0.1280517578125, 0.140625, 0.094970703125, 0.09185791015625, 0.1683349609375, 0.112060546875, 0.06085205078125, 0.1370...

embed

59577203_c0

59577203

haskell

0

Title: How do I override error message on Left in Haskell? Problem title: How do I override error message on Left in Haskell? Tags: haskell, pattern-matching, error-handling Problem: How do I override error message on Left in Haskell? I want to read from file and am using pattern matching on Left/Right to tell is said ...

How do I override error message on Left in Haskell? How do I override error message on Left in Haskell? haskell pattern-matching error-handling How Left Haskell somefile_that_does_not_exist.ini Right How do I override error message on Left in Haskell? I want to read from file and am using pattern matching on Left/Right...

[ 0.0020599365234375, 0.0111083984375, 0.0004177093505859375, 0.0057373046875, 0.0234375, 0.0027618408203125, -0.011474609375, -0.0030517578125, 0.0084228515625, 0.0084228515625, 0.0157470703125, -0.018310546875, 0.0167236328125, -0.00457763671875, 0.0208740234375, 0.01141357421875, 0....

[ 11249, 645, 416, 112, 18499, 26008, 98, 636, 2480, 20625, 142508, 87, 23, 1556, 103510, 98753, 54885, 29822, 86673, 246, 90, 10869, 54376, 943, 90911, 54, 3444, 12301, 1295, 11435, 17368, 14858, 1052, 22553, 14192, 2804, 32316, 1884, 221, ...

[ 0.045867919921875, 0.12744140625, 0.19580078125, 0.14208984375, 0.2125244140625, 0.1494140625, 0.0550537109375, 0.1412353515625, 0.2265625, 0.16943359375, 0.270263671875, 0.00323486328125, 0.07049560546875, 0.1351318359375, 0.2125244140625, 0.1527099609375, 0.075927734375, 0.176513...

embed

18370537_c1

18370537

haskell

1

) -> [Int] -> [[Int]] g n m digitCount lastDigit (hash,hashCount) digits | digitCount == m = if test then [reverse digits] else [] | otherwise = if lastDigit == 0 then g n m (digitCount + 1) (lastDigit + 1) (hash',hashCount') (lastDigit:digits) else if lastDigit == n - 1 then g n m (digitCount + 1) (lastDigit - 1) (has...

[ -0.037841796875, 0.0084228515625, -0.00390625, -0.00994873046875, 0.000797271728515625, 0.006134033203125, -0.00634765625, 0.000499725341796875, 0.0242919921875, -0.0133056640625, 0.001190185546875, -0.008056640625, 0.0091552734375, 0.025390625, -0.00274658203125, -0.007232666015625, ...

[ 1388, 33079, 4153, 18, 706, 653, 347, 153939, 108210, 4568, 14055, 15769, 126234, 4, 7, 58745, 6, 69112, 2203, 2174, 3034, 107, 37676, 37076, 120262, 757, 4803, 217, 997, 4879, 19777, 25, 106, 37223, 1556, 127, 594, 33548, 7225, 276, 64...

[ 0.083740234375, 0.07171630859375, 0.0858154296875, 0.117431640625, 0.1116943359375, 0.068603515625, 0.176513671875, 0.258056640625, 0.2327880859375, 0.214111328125, 0.09869384765625, 0.1802978515625, 0.2008056640625, 0.011688232421875, 0.053619384765625, 0.05072021484375, 0.025909423...

embed

23447854_c0

23447854

haskell

0

Title: Use foldl to traverse a Tree in Haskell Problem title: Use foldl to traverse a Tree in Haskell Tags: tree, haskell Problem: Use foldl to traverse a Tree in Haskell I've got the following code: data Tree a = ATree a [Tree a] deriving Show treeFold :: (b -> a -> b) -> b -> Tree a -> b treeFold f acc (ATree a []) =...

Use foldl to traverse a Tree in Haskell Use foldl to traverse a Tree in Haskell tree haskell Use Tree Haskell ATree Show Couldn Expected Actual Use foldl to traverse a Tree in Haskell I've got the following code: It's supposed to go over each element of Tree and apply a function to the value. But it gives me this error...

[ -0.003936767578125, 0, -0.00213623046875, -0.00145721435546875, 0.0024871826171875, 0.00139617919921875, -0.031982421875, -0.014404296875, -0.025390625, -0.0498046875, 0.01129150390625, -0.0042724609375, -0.00160980224609375, 0.0115966796875, 0.002227783203125, -0.00958251953125, -0....

[ 36836, 18344, 20469, 47, 37317, 13, 101344, 20625, 142508, 23, 53201, 1556, 107, 17367, 191147, 19, 60075, 100582, 25632, 18151, 134598, 738, 645, 12638, 12830, 59911, 32354, 34292, 76199, 163, 903, 18499 ]

[ 0.1119384765625, 0.1781005859375, 0.257080078125, 0.0540771484375, 0.1905517578125, 0.094482421875, 0.250732421875, 0.1163330078125, 0.209228515625, 0.049713134765625, 0.1375732421875, 0.0966796875, 0.1263427734375, 0.1263427734375, 0.110107421875, 0.052520751953125, 0.083984375, 0...

embed

23510028_c0

23510028

haskell

0

Title: Should I learn haskell for understanding the functional programming part of javascript? Problem title: Should I learn haskell for understanding the functional programming part of javascript? Tags: functional-programming, haskell, javascript Problem: Should I learn haskell for understanding the functional program...

Should I learn haskell for understanding the functional programming part of javascript? Should I learn haskell for understanding the functional programming part of javascript? functional-programming haskell javascript Should Should I learn haskell for understanding the functional programming part of javascript? I'm a d...

[ -0.000518798828125, 0.00445556640625, -0.00083160400390625, -0.01226806640625, -0.016357421875, 0.0010986328125, -0.011962890625, 0.00311279296875, 0.005157470703125, -0.03515625, -0.000667572021484375, -0.053466796875, 0.00567626953125, 0.01708984375, -0.0213623046875, -0.001541137695...

[ 151117, 87, 30698, 1556, 142508, 100, 100094, 123309, 56037, 449, 2831, 136951, 32, 28966, 10, 106001, 678, 4552, 37515, 32500, 76615, 169549, 3444, 169, 5351, 70, 22690, 7413, 35978, 7941, 28219, 23755, 33938, 4163, 903, 6495, 7, 46876, 59...

[ 0.16943359375, 0.073974609375, 0.17431640625, 0.185302734375, 0.287109375, 0.053466796875, 0.1533203125, 0.2198486328125, 0.139404296875, 0.051971435546875, 0.11767578125, 0.2646484375, 0.010498046875, 0.1434326171875, 0.0199737548828125, 0.1202392578125, 0.0158538818359375, 0.0665...

embed

23922807_c0

23922807

haskell

0

Title: Counting of algebraic data types Problem title: Counting of algebraic data types Tags: haskell, theory, algebraic-data-types Problem: Counting of algebraic data types I'm reading/listening to Chris Taylor's presentation on algebraic data types. http://chris-taylor.github.io/blog/2013/02/10/the-algebra-of-algebra...

Counting of algebraic data types Counting of algebraic data types haskell theory algebraic-data-types Counting Bool Trio First Second Third Counting of algebraic data types I'm reading/listening to Chris Taylor's presentation on algebraic data types. http://chris-taylor.github.io/blog/2013/02/10/the-algebra-of-algebrai...

[ 0.0311279296875, 0.0162353515625, 0.005279541015625, 0.02490234375, -0.00445556640625, -0.0034942626953125, -0.01470947265625, 0.0101318359375, 0.0262451171875, -0.0157470703125, -0.0194091796875, -0.0264892578125, 0.0279541015625, 0.046142578125, 0.00860595703125, 0.007049560546875, ...

[ 1311, 128396, 144, 429, 2844, 1771, 2053, 52895, 1556, 142508, 154453, 10135, 50986, 2460, 929, 4699, 31, 23972, 77648, 198387, 16454, 12897, 31745, 63569, 92252, 7164, 1484, 32102, 40059, 32354, 27781, 77878, 27165, 44084, 382, 136, 959, 305...

[ 0.1456298828125, 0.1756591796875, 0.030242919921875, 0.10211181640625, 0.1484375, 0.04278564453125, 0.14404296875, 0.23583984375, 0.0902099609375, 0.19970703125, 0.103515625, 0.1192626953125, 0.2119140625, 0.10986328125, 0.2135009765625, 0.1959228515625, 0.174560546875, 0.034606933...

embed

22587819_c1

22587819

haskell

1

f 0 r = return r f l _ = do b <- getBool f (l - 1) $ if b then 1 else 0 mainFunc :: B.ByteString -> IO () mainFunc bs = do let r = runGet (runBitGet (coreFunc ((B.length bs) * 8))) bs print $ show r main :: IO () main = do args <- getArgs case args of [] -> return () (x:_) -> (do bs <- B.readFile x mainFunc bs return ...

[ -0.007720947265625, 0.007049560546875, -0.007537841796875, 0.002471923828125, -0.012939453125, 0.007720947265625, -0.003662109375, -0.00225830078125, 0.007659912109375, -0.006317138671875, 0.01611328125, 0.00421142578125, -0.00506591796875, 0.0162353515625, 0.0174560546875, -0.00482177...

[ 1238, 757, 1690, 30646, 96, 101, 54, 876, 2046, 12647, 929, 141, 4879, 3650, 106, 37076, 5201, 97249, 335, 75358, 67, 71713, 17780, 7, 2633, 11675, 724, 126, 16428, 571, 217, 30854, 5, 23986, 382, 28412, 7639, 79459, 7614, 9405, 7225, ...

[ 0.11962890625, 0.14599609375, 0.1240234375, 0.197265625, 0.0545654296875, 0.001922607421875, 0.04400634765625, 0.0859375, 0.1251220703125, 0.1036376953125, 0.1678466796875, 0.06146240234375, 0.0343017578125, 0.04534912109375, 0.02935791015625, 0.00274658203125, 0.1229248046875, 0.1...

embed

4576734_c0

4576734

haskell

0

Title: Why do we need 'seq' or 'pseq' with 'par' in Haskell? Problem title: Why do we need 'seq' or 'pseq' with 'par' in Haskell? Tags: speculative-execution, parallel-processing, haskell Problem: Why do we need 'seq' or 'pseq' with 'par' in Haskell? I'm tryin...

Why do we need 'seq' or 'pseq' with 'par' in Haskell? Why do we need 'seq' or 'pseq' with 'par' in Haskell? speculative-execution parallel-processing haskell Why Haskell Why do we need 'seq' or 'pseq' with 'par' in Haskell? I'm trying to understand why we need...

[ -0.00177764892578125, 0.0267333984375, 0.0037078857421875, 0.01708984375, 0.0016326904296875, 0.01165771484375, 0.00689697265625, -0.01544189453125, -0.00080108642578125, -0.0260009765625, -0.000904083251953125, 0.016845703125, -0.0028533935546875, 0.0067138671875, -0.00433349609375, -...

[ 44084, 3871, 3768, 184, 864, 45616, 678, 2500, 23, 20625, 142508, 149575, 4935, 46480, 1010, 95103, 63923, 1556, 54, 642, 707, 28219, 15400, 756, 63920, 5570, 121413, 18151, 25632, 129980, 125195, 32032, 40858, 151575, 15044, 10, 876, 30646, ...

[ 0.124755859375, 0.1390380859375, 0.073974609375, 0.1148681640625, 0.229736328125, 0.1448974609375, 0.064208984375, 0.2283935546875, 0.058563232421875, 0.1270751953125, 0.2369384765625, 0.1453857421875, 0.0435791015625, 0.010040283203125, 0.041717529296875, 0.1976318359375, 0.04162597...

embed

6130483_c0

6130483

haskell

0

Title: Declarations at the GHCi prompt Problem title: Declarations at the GHCi prompt Tags: syntax, declaration, ghci, haskell Problem: Declarations at the GHCi prompt I have just installed Haskell Platform for Windows (version 2011.2.0.1), and started to work through the HaskellQuestions.pdf The second question requir...

Declarations at the GHCi prompt Declarations at the GHCi prompt syntax declaration ghci haskell Declarations GHCi www.haskell.org Loading ffi-1.0 Prelude Declarations at the GHCi prompt I have just installed Haskell Platform for Windows (version 2011.2.0.1), and started to work through the HaskellQuestions.pdf The seco...

[ 0.00860595703125, 0.0155029296875, 0.0111083984375, -0.0025787353515625, 0.003082275390625, 0.0128173828125, 0.01458740234375, -0.02197265625, -0.0020599365234375, -0.005950927734375, 0.0078125, -0.036376953125, -0.01458740234375, -0.00098419189453125, 0.00150299072265625, 0.0213623046...

[ 98501, 5256, 99, 527, 73265, 14, 105876, 70, 6002, 86531, 21635, 31380, 318, 1556, 142508, 10557, 1478, 228006, 24500, 102107, 1914, 822, 20600, 20625, 70968, 3773, 13999, 73011, 195136, 17514, 15483, 17932, 9655, 144570, 425, 2203, 138, 237,...

[ 0.222900390625, 0.0579833984375, 0.07958984375, 0.109375, 0.1583251953125, 0.1881103515625, 0.2012939453125, 0.005035400390625, 0.0584716796875, 0.0908203125, 0.1763916015625, 0.139892578125, 0.1668701171875, 0.1331787109375, 0.2327880859375, 0.125, 0.009613037109375, 0.08093261718...

embed

64309035_c0

64309035

haskell

0

Title: How do you not negate a number on a list? Problem title: How do you not negate a number on a list? Tags: haskell Problem: How do you not negate a number on a list? I know that in Haskell, we can negate a number by doing negate . But what if I wanted to negate everything on a list except a certain number? Lets sa...

How do you not negate a number on a list? How do you not negate a number on a list? haskell How How do you not negate a number on a list? I know that in Haskell, we can negate a number by doing negate . But what if I wanted to negate everything on a list except a certain number? Lets say I have a function called helpne...

[ -0.00616455078125, 0.0037841796875, 0.0155029296875, 0.0023040771484375, -0.009765625, 0.0159912109375, 0.002593994140625, 0.013427734375, 0.00958251953125, -0.00112152099609375, -0.0264892578125, -0.0179443359375, -0.00927734375, 0.00347900390625, -0.006622314453125, 0.003250122070312...

[ 11249, 959, 90584, 13, 14012, 98, 5303, 54, 1556, 142508, 10, 3714, 20625, 831, 36663, 47, 26818, 40494, 24233, 32354, 4358, 3331, 67, 51776, 23, 66596, 206808, 304, 116574, 3642, 11907, 201, 5608, 2046, 9, 5428, 617, 17376, 81887, 37842,...

[ 0.06536865234375, 0.2017822265625, 0.2471923828125, 0.1671142578125, 0.21826171875, 0.1131591796875, 0.232177734375, 0.02288818359375, 0.1270751953125, 0.221435546875, 0.039886474609375, 0.01171875, 0.1241455078125, 0.02972412109375, 0.0587158203125, 0.03302001953125, 0.1043090820312...

embed

4976139_c0

4976139

haskell

0

Title: What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskell? Problem title: What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskell? Tags: haskell Problem: What's the recommended way of handling complexly composed POD(plain-old-d...

What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskell? What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskell? haskell What POD Haskell What's the recommended way of handling complexly composed POD(plain-old-data in OO) in Haskel...

[ 0.000675201416015625, 0.0191650390625, 0.0037384033203125, 0.0206298828125, 0.0137939453125, 0.017578125, 0.003204345703125, -0.0023651123046875, 0.0035400390625, -0.000202178955078125, 0.000926971435546875, -0.0341796875, 0.027587890625, 0.021240234375, -0.003814697265625, -0.00793457...

[ 3768, 170198, 3917, 45064, 27140, 150350, 62035, 7290, 18345, 10135, 30563, 20625, 142508, 23, 1556, 4865, 71, 3525, 9014, 13254, 10644, 46876, 41925, 756, 2053, 45646, 8121, 18507, 110527, 36746, 831, 5941, 150380, 28394, 15700, 34292, 44457, ...

[ 0.0262298583984375, 0.1395263671875, 0.05615234375, 0.175537109375, 0.208251953125, 0.17138671875, 0.27880859375, 0.12646484375, 0.187744140625, 0.1593017578125, 0.19189453125, 0.1519775390625, 0.2415771484375, 0.03582763671875, 0.117919921875, 0.0482177734375, 0.050140380859375, 0...

embed

12073336_c0

12073336

haskell

0

Title: Satisfying monad laws without a type constructor Problem title: Satisfying monad laws without a type constructor Tags: category-theory, functor, haskell, monads Problem: Satisfying monad laws without a type constructor Given e.g. a type like data Tree a = Branch (Tree a) (Tree a) | Leaf a I can easily write inst...

Satisfying monad laws without a type constructor Satisfying monad laws without a type constructor category-theory functor haskell monads Satisfying Tree Branch Leaf StringTree Satisfying monad laws without a type constructor Given e.g. a type like I can easily write instances for Functor, Applicative, Monad, etc. But i...

[ -0.004730224609375, 0.016357421875, -0.026611328125, 0.01263427734375, 0.018798828125, 0.00799560546875, -0.01263427734375, -0.01953125, 0.00775146484375, -0.0194091796875, -0.01708984375, -0.04345703125, -0.00494384765625, 0.010986328125, 0.0078125, 0.0093994140625, -0.003173828125,...

[ 947, 1814, 18929, 2667, 712, 131703, 15490, 10644, 64549, 748, 95487, 7477, 18770, 1556, 142508, 101344, 23351, 62731, 72546, 33022, 110527, 28670, 11048, 4935, 60331, 71, 98102, 73, 1653, 13, 30524, 388, 81273, 32354, 214521, 5809, 7464, 515...

[ 0.01129150390625, 0.067626953125, 0.03857421875, 0.139404296875, 0.1944580078125, 0.135986328125, 0.09588623046875, 0.19091796875, 0.1265869140625, 0.06292724609375, 0.1011962890625, 0.0280609130859375, 0.1055908203125, 0.0282440185546875, 0.158447265625, 0.0904541015625, 0.141601562...

embed

23684987_c0

23684987

haskell

0

Title: Haskell cannot compile Problem title: Haskell cannot compile Tags: haskell, polynomials, types Problem: Haskell cannot compile As usuall I am suffering the problem, that on paper everything should work, but the compiler gives an error which I just cannot understand. data Polynom = Polynom[Double] deriving Show c...

Haskell cannot compile Haskell cannot compile haskell polynomials types Haskell Polynom Double Show h:ts Haskell cannot compile As usuall I am suffering the problem, that on paper everything should work, but the compiler gives an error which I just cannot understand. giving the error "Constructor `Polynom' should have ...

[ -0.00750732421875, -0.0003299713134765625, 0.0019989013671875, 0.00567626953125, -0.00714111328125, 0.017578125, 0.0205078125, -0.0255126953125, 0.00970458984375, -0.027099609375, 0.00909423828125, -0.040771484375, 0.014892578125, -0.01409912109375, -0.024658203125, -0.00494384765625, ...

[ 20625, 142508, 53418, 9969, 1340, 1556, 35874, 1687, 15403, 52895, 63306, 107172, 17367, 1096, 933, 115723, 178707, 2967, 15122, 26818, 5608, 4488, 34759, 18499, 28219, 11935, 36716, 748, 7192, 538, 765, 106, 10750, 1284, 2809, 34475, 351, 61...

[ 0.1513671875, 0.2548828125, 0.202392578125, 0.1900634765625, 0.1761474609375, 0.1434326171875, 0.1763916015625, 0.20751953125, 0.0849609375, 0.1236572265625, 0.1749267578125, 0.142333984375, 0.08660888671875, 0.08251953125, 0.03265380859375, 0.0269927978515625, 0.0562744140625, 0.0...

embed

51491915_c0

51491915

haskell

0

Title: Unwrap value from IO operation at a later time Problem title: Unwrap value from IO operation at a later time Tags: haskell, io-monad Problem: Unwrap value from IO operation at a later time Hello i was wondering how can you unwrap a value at a later time in the IO monad? If a<-expression binds the result to a the...

Unwrap value from IO operation at a later time Unwrap value from IO operation at a later time haskell io-monad IO Unwrap WriteMode out.txt Monad Unwrap value from IO operation at a later time Hello i was wondering how can you unwrap a value at a later time in the IO monad? If a<-expression binds the result to a then ca...

[ -0.0201416015625, 0.005340576171875, 0.0216064453125, 0.00787353515625, 0.009765625, 0.00445556640625, -0.0038299560546875, -0.01300048828125, 0.0018310546875, -0.0020904541015625, -0.0185546875, -0.019287109375, -0.0087890625, 0.004547119140625, 0.006927490234375, -0.005767822265625, ...

[ 992, 434, 13631, 34292, 1295, 17780, 41018, 99, 14432, 1733, 1556, 142508, 22995, 3796, 712, 601, 18781, 9083, 112, 1810, 124326, 60331, 71, 149016, 3642, 831, 51, 10, 23, 2667, 16093, 204629, 68557, 16750, 4527, 9, 237, 171859, 55300, 26...

[ 0.124267578125, 0.115966796875, 0.255126953125, 0.2308349609375, 0.090087890625, 0.21337890625, 0.1533203125, 0.0224609375, 0.1307373046875, 0.1259765625, 0.08837890625, 0.2071533203125, 0.185302734375, 0.11083984375, 0.2008056640625, 0.03118896484375, 0.09942626953125, 0.170654296...

embed

2785263_c0

2785263

haskell

0

Title: Haskell graph data type representation Problem title: Haskell graph data type representation Tags: haskell Problem: Haskell graph data type representation I want to represent a graph in Haskell in the following manner: For each node I want to store it's value and a list of adjacent nodes. The problem which I'm h...

Haskell graph data type representation Haskell graph data type representation haskell Haskell Node Show Haskell graph data type representation I want to represent a graph in Haskell in the following manner: For each node I want to store it's value and a list of adjacent nodes. The problem which I'm having difficulties ...

[ -0.01239013671875, 0.01373291015625, 0.007232666015625, 0.032958984375, 0.00433349609375, -0.00157928466796875, -0.01519775390625, -0.0087890625, -0.004730224609375, -0.0218505859375, -0.01202392578125, -0.041259765625, -0.007537841796875, 0.01007080078125, 0.00946044921875, 0.00066757...

[ 20625, 142508, 41382, 2053, 10644, 18811, 1556, 438, 112, 17367, 1363, 3444, 33636, 23, 25632, 144996, 12638, 110, 4343, 34292, 5303, 123594, 16797, 988, 2967, 34844, 91067, 3789, 600, 237, 25182, 141, 915, 96, 136, 959, 231454, 28636, 164,...

[ 0.142822265625, 0.239990234375, 0.2164306640625, 0.12451171875, 0.1805419921875, 0.1986083984375, 0.1292724609375, 0.1505126953125, 0.154296875, 0.1590576171875, 0.022430419921875, 0.0775146484375, 0.208740234375, 0.039794921875, 0.035003662109375, 0.04052734375, 0.0435791015625, 0...

embed

71072417_c0

71072417

haskell

0

Title: sin function returning numbers outside of range [-1, 1] Problem title: sin function returning numbers outside of range [-1, 1] Tags: trigonometry, haskell Problem: sin function returning numbers outside of range [-1, 1] I am working in Haskell and have had an error where, for really large floats z, sin(z) return...

sin function returning numbers outside of range [-1, 1] sin function returning numbers outside of range [-1, 1] trigonometry haskell sin function returning numbers outside of range [-1, 1] I am working in Haskell and have had an error where, for really large floats z, sin(z) returns some value outside of the range [-1,...

[ -0.004852294921875, -0.0235595703125, -0.002349853515625, -0.01129150390625, -0.00482177734375, 0.01129150390625, -0.00830078125, 0.0086669921875, -0.004791259765625, 0.000560760498046875, 0.0025634765625, -0.000576019287109375, 0.0003814697265625, -0.016357421875, 0.0400390625, 0.0058...

[ 880, 32354, 30646, 214, 101935, 50782, 111, 37457, 5759, 106, 171353, 64970, 1556, 142508, 20697, 20625, 18499, 6183, 21334, 21917, 9821, 97, 132, 169, 34292, 52080, 10176, 84434, 978, 1528, 150631, 36917, 107730, 3934, 15700, 26946, 142424, ...

[ 0.246826171875, 0.1856689453125, 0.1820068359375, 0.043548583984375, 0.1546630859375, 0.164794921875, 0.047637939453125, 0.18017578125, 0.1500244140625, 0.06903076171875, 0.1087646484375, 0.0538330078125, 0.112060546875, 0.220947265625, 0.06158447265625, 0.112060546875, 0.15185546875...

embed

49033681_c0

49033681

haskell

0

Title: fmap versus <$> Problem title: fmap versus <$> Tags: haskell Problem: fmap versus <$> According to the documentation <$> is an synonym for fmap and they have the following types: (<$>) :: Functor f => (a -> b) -> f a -> f b fmap :: Functor f => (a -> b) -> f a -> f b So it seems to me, from the signa...

fmap versus <$> fmap versus <$> haskell Control.Applicative Functor fmap versus <$> According to the documentation <$> is an synonym for fmap and they have the following types: So it seems to me, from the signatures above, that they take the arguments in the same order, the only difference being that one is...

[ 0.01165771484375, 0.00457763671875, 0.0037078857421875, 0.006927490234375, -0.00933837890625, 0.0247802734375, 0.01416015625, 0.006072998046875, 0.0147705078125, -0.0233154296875, 0.01251220703125, -0.018798828125, 0.01190185546875, 0.0152587890625, -0.0072021484375, -0.0244140625, 0...

[ 1238, 62346, 119475, 1277, 4369, 1230, 5386, 1556, 142508, 27131, 39179, 11048, 4935, 28670, 18770, 47, 209806, 2740, 164661, 70, 25632, 52895, 37202, 138256, 1836, 5646, 10750, 7, 5701, 12989, 4734, 60212, 1632, 23, 55923, 3789, 83, 959, 6...

[ 0.1607666015625, 0.307861328125, 0.2357177734375, 0.0293121337890625, 0.1754150390625, 0.0151519775390625, 0.1126708984375, 0.13720703125, 0.244873046875, 0.207763671875, 0.07672119140625, 0.1270751953125, 0.00250244140625, 0.114990234375, 0.10321044921875, 0.0218658447265625, 0.0747...

embed

30140175_c0

30140175

haskell

0

Title: Moving from static configuration to dynamic configuration Problem title: Moving from static configuration to dynamic configuration Tags: configuration-files, haskell Problem: Moving from static configuration to dynamic configuration I am working on a haskell project where the settings are currently in a file cal...

Moving from static configuration to dynamic configuration Moving from static configuration to dynamic configuration configuration-files haskell static Moving Setting.hs Moving from static configuration to dynamic configuration I am working on a haskell project where the settings are currently in a file called Setting.h...

[ 0.000560760498046875, 0.00107574462890625, 0.0225830078125, -0.00830078125, 0.0019683837890625, 0.0036468505859375, -0.01708984375, 0.012451171875, -0.0012054443359375, -0.0233154296875, -0.0159912109375, -0.006256103515625, -0.0108642578125, -0.00787353515625, 0.00311279296875, 0.0102...

[ 2501, 6496, 1295, 201939, 180346, 47, 84079, 29822, 1556, 142508, 503, 19514, 127, 20697, 13452, 53550, 82424, 23, 11435, 5, 12765, 20271, 9969, 1733, 831, 17203, 7964, 4785, 5792, 179635, 12301, 70, 11675, 6032, 18151, 37382, 58696, 150675, ...

[ 0.136962890625, 0.1126708984375, 0.09637451171875, 0.227783203125, 0.28271484375, 0.06512451171875, 0.25732421875, 0.135009765625, 0.125244140625, 0.2122802734375, 0.155517578125, 0.20947265625, 0.14306640625, 0.09033203125, 0.070556640625, 0.216064453125, 0.05194091796875, 0.00619...

embed

33531834_c0

33531834

haskell

0

Title: nubBy is not working as expected Problem title: nubBy is not working as expected Tags: haskell Problem: nubBy is not working as expected The function below should generate prime numbers however it does not for GHC 7.10.2. Is anybody else seeing this? GHCi, version 7.10.2: http://www.haskell.org/ghc/ :? for help ...

nubBy is not working as expected nubBy is not working as expected haskell Data.List GHCi www.haskell.org Prelude nubBy is not working as expected The function below should generate prime numbers however it does not for GHC 7.10.2. Is anybody else seeing this? The strange part is that it seems to work fine on this site:...

[ -0.0107421875, 0.0179443359375, 0.0157470703125, -0.002593994140625, 0.007354736328125, 0.003173828125, 0.007476806640625, -0.034423828125, -0.0019073486328125, -0.029541015625, -0.009521484375, -0.00165557861328125, 0.0274658203125, -0.028564453125, -0.013671875, -0.0108642578125, -...

[ 315, 275, 75358, 959, 20697, 237, 84751, 83, 1556, 142508, 11809, 154663, 527, 73265, 14, 10557, 1478, 1914, 822, 112, 32354, 35064, 5608, 139392, 20809, 101935, 49903, 14602, 115384, 133684, 37873, 86681, 903, 114453, 2831, 37202, 4488, 5885...

[ 0.192626953125, 0.16015625, 0.261962890625, 0.115966796875, 0.162841796875, 0.1334228515625, 0.1512451171875, 0.00567626953125, 0.1224365234375, 0.25927734375, 0.09521484375, 0.143310546875, 0.0921630859375, 0.2052001953125, 0.1339111328125, 0.09912109375, 0.045013427734375, 0.1019...

embed

35816074_c0

35816074

haskell

0

Title: Haskell Yesod - extracting a object inside a json before converting it to a model Problem title: Haskell Yesod - extracting a object inside a json before converting it to a model Tags: yesod, haskell, aeson Problem: Haskell Yesod - extracting a object inside a json before converting it to a model Suppose I have ...

Haskell Yesod - extracting a object inside a json before converting it to a model Haskell Yesod - extracting a object inside a json before converting it to a model yesod haskell aeson Haskell Yesod Handler Entity Key MyEntity status204 UPDATED Text JSON Haskell Yesod - extracting a object inside a json before convertin...

[ -0.0206298828125, 0.0186767578125, -0.007354736328125, -0.0040283203125, -0.00299072265625, 0.0135498046875, -0.0150146484375, -0.006866455078125, 0.00445556640625, -0.068359375, -0.0047607421875, 0.0078125, -0.0167236328125, -0.00958251953125, 0.03515625, -0.004058837890625, -0.0005...

[ 20625, 142508, 32635, 2199, 20, 125663, 214, 36746, 46132, 1647, 1681, 8108, 96760, 47, 3299, 10, 2422, 23722, 1556, 90, 191, 10639, 603, 16511, 2481, 26824, 2646, 7768, 18, 10778, 147758, 161521, 24129, 821, 58627, 121691, 765, 1884, 27, ...

[ 0.1707763671875, 0.2462158203125, 0.2080078125, 0.284912109375, 0.0107421875, 0.2100830078125, 0.064697265625, 0.18017578125, 0.16552734375, 0.133544921875, 0.2044677734375, 0.1253662109375, 0.1246337890625, 0.0281829833984375, 0.25390625, 0.024658203125, 0.1370849609375, 0.2116699...

embed

23183951_c0

23183951

haskell

0

Title: How to query the unification type to ghci? Problem title: How to query the unification type to ghci? Tags: unification, types, haskell, ghci Problem: How to query the unification type to ghci? It is possible to query ghci for an unification type? For example, if I want to know the type of the unification between...

How to query the unification type to ghci? How to query the unification type to ghci? unification types haskell ghci How Bool How to query the unification type to ghci? It is possible to query ghci for an unification type? For example, if I want to know the type of the unification between (Int -> Bool) and (a -> Bool) ...

[ 0.006134033203125, 0.00157928466796875, 0.008544921875, 0.0201416015625, -0.0191650390625, -0.00191497802734375, -0.0101318359375, -0.00180816650390625, -0.00128936767578125, -0.007537841796875, -0.0030364990234375, -0.027099609375, 0.0120849609375, -0.01165771484375, -0.00555419921875, ...

[ 11249, 47, 41, 1294, 70, 51, 41274, 10644, 31380, 318, 52895, 1556, 142508, 2460, 929, 7722, 100, 3444, 3714, 17721, 4153, 18, 33079, 136, 11, 3642, 831, 903, 86869, 81979, 5847, 3742, 50960, 20625, 34734, 2480, 27958, 219584 ]

[ 0.09197998046875, 0.11572265625, 0.1187744140625, 0.1217041015625, 0.00482177734375, 0.1591796875, 0.17431640625, 0.2081298828125, 0.1480712890625, 0.18408203125, 0.14892578125, 0.110107421875, 0.1776123046875, 0.0821533203125, 0.1763916015625, 0.0732421875, 0.01324462890625, 0.006...

embed

41227219_c0

41227219

haskell

0

Title: mapAccumR -like recursion scheme over Fix? Problem title: mapAccumR -like recursion scheme over Fix? Tags: recursion-schemes, haskell Problem: mapAccumR -like recursion scheme over Fix? I'm playing with the functions from recursion-schemes , and struggling to figure out if it offers something that generalized ma...

mapAccumR -like recursion scheme over Fix? mapAccumR -like recursion scheme over Fix? recursion-schemes haskell Fix x:xs Empty mapAccumR -like recursion scheme over Fix? I'm playing with the functions from recursion-schemes , and struggling to figure out if it offers something that generalized mapAccumR . Something pow...

[ -0.003997802734375, 0.0166015625, 0.016357421875, 0.006134033203125, 0.0001506805419921875, -0.004913330078125, 0.0101318359375, -0.029541015625, 0.0036468505859375, 0.00927734375, 0.033447265625, -0.01708984375, 0.0005950927734375, 0.0123291015625, 0.038818359375, 0.0062255859375, -...

[ 22288, 39450, 10591, 1052, 5062, 195625, 1830, 150370, 645, 96746, 7560, 3716, 1556, 142508, 1022, 12, 425, 31678, 939, 75169, 32354, 237875, 26366, 64600, 4537, 29367, 113138, 29479, 11001, 27875, 297, 45646, 97, 53, 519, 37202, 110518, 3444...

[ 0.1585693359375, 0.05865478515625, 0.2147216796875, 0.2030029296875, 0.139404296875, 0.2020263671875, 0.0855712890625, 0.197265625, 0.09136962890625, 0.2474365234375, 0.1480712890625, 0.1077880859375, 0.1092529296875, 0.2315673828125, 0.05572509765625, 0.03369140625, 0.07568359375, ...

embed

73503418_c1

73503418

haskell

1

MsgPkt m 'AskMD) ~ 'Yes) => Cached (AnyMsgPkt 'AskMD) where fromCache mbExpir ip v cst = do Val valExpir dat <- M.lookup (Key ip 0 $ hash v) cst expir <- mbExpir False <- pure (valExpir < expir) _ <- concrMsg @m dat pure dat toCache expir ip v ans cst = M.insert (Key ip 0 $ hash v) (Val expir ans) cst fff = toCache @'R...

[ -0.00762939453125, -0.0022125244140625, -0.004730224609375, -0.00836181640625, 0.01129150390625, -0.0084228515625, 0.00122833251953125, 0.01519775390625, 0.0164794921875, -0.048583984375, 0.01031494140625, 0.009765625, 0.025146484375, 0.01287841796875, -0.01177978515625, -0.00181579589...

[ 70802, 177, 683, 4164, 347, 284, 1042, 44644, 91480, 2041, 74694, 299, 7, 1295, 441, 46994, 39369, 19279, 21738, 254, 81, 271, 4769, 3502, 607, 276, 64747, 2037, 162429, 757, 3650, 1556, 127, 14700, 481, 22225, 34166, 1405, 158, 23150, ...

[ 0.1373291015625, 0.161376953125, 0.1357421875, 0.2174072265625, 0.0902099609375, 0.0809326171875, 0.178955078125, 0.2047119140625, 0.146240234375, 0.1741943359375, 0.2314453125, 0.071044921875, 0.0838623046875, 0.053497314453125, 0.07440185546875, 0.205810546875, 0.0496826171875, 0...

embed

76381214_c0

76381214

haskell

0

Title: Reusing functional dependency as a type function Problem title: Reusing functional dependency as a type function Tags: haskell Problem: Reusing functional dependency as a type function I have a typeclass that uses functional dependency and example instance: class (KnownSymbol name) => MyClass name result | name ...

Reusing functional dependency as a type function Reusing functional dependency as a type function haskell Reusing KnownSymbol MyClass GetType CanGetType RHS All LHS Reusing functional dependency as a type function I have a typeclass that uses functional dependency and example instance: How can I reuse this and get a ty...

[ -0.00116729736328125, -0.005279541015625, 0.004608154296875, 0.0074462890625, -0.0126953125, -0.0062255859375, -0.01531982421875, 0.0062255859375, 0.0031280517578125, -0.0301513671875, -0.00750732421875, -0.0242919921875, -0.0036163330078125, 0.01953125, 0.01104736328125, 0.00439453125...

[ 137336, 214, 123309, 42548, 27771, 237, 10644, 32354, 1556, 142508, 70829, 65183, 36846, 2646, 140803, 20779, 196707, 4171, 724, 126, 68416, 294, 3164, 339, 38131, 67413, 4527, 27781, 110527, 11249, 831, 156883, 2046, 67919, 64113, 58, 30646, ...

[ 0.2254638671875, 0.04107666015625, 0.2069091796875, 0.1851806640625, 0.1083984375, 0.07794189453125, 0.218994140625, 0.1993408203125, 0.111572265625, 0.19970703125, 0.0992431640625, 0.0679931640625, 0.1695556640625, 0.100341796875, 0.180908203125, 0.13916015625, 0.292236328125, 0.0...

embed

46031533_c0

46031533

haskell

0

Title: Derived instance in Haskell Problem title: Derived instance in Haskell Tags: haskell, deriving Problem: Derived instance in Haskell I would like to use derived instance like this: data Test3D = forall a. (Show a, Eq a, Typeable a, Generic a) => Test3D { testDt :: String , testPrm :: a } deriving (Show, Eq, Typea...

Derived instance in Haskell Derived instance in Haskell haskell deriving Derived Haskell Test3D Show Typeable Generic Binary Can Constructor Possible Derived instance in Haskell I would like to use derived instance like this: But I received from GHC: This way is very convenient for my project. I can not find the soluti...

[ 0.00848388671875, 0.004486083984375, 0.0108642578125, 0.009765625, 0.0169677734375, -0.006256103515625, 0.0074462890625, 0.01336669921875, 0.0028228759765625, -0.0263671875, -0.01141357421875, -0.00982666015625, 0.00994873046875, 0.0107421875, -0.023681640625, -0.003570556640625, 0.0...

[ 1310, 14, 4126, 110527, 20625, 142508, 23, 1556, 16406, 6496, 8647, 363, 397, 17367, 60457, 2886, 88342, 54092, 1294, 4171, 82084, 18770, 115861, 2661, 2806, 1884, 4527, 903, 4966, 75204, 1295, 527, 73265, 3293, 3917, 83, 4552, 142267, 759,...

[ 0.16748046875, 0.169189453125, 0.1942138671875, 0.268310546875, 0.140869140625, 0.2337646484375, 0.0278167724609375, 0.128662109375, 0.19189453125, 0.050689697265625, 0.131103515625, 0.06591796875, 0.0711669921875, 0.09033203125, 0.164306640625, 0.1087646484375, 0.0899658203125, 0....

embed

6970304_c0

6970304

haskell

0

Title: Infuriating Tab problem in Vim, in literate Haskell Problem title: Infuriating Tab problem in Vim, in literate Haskell Tags: haskell, literate-programming, tabs, vim Problem: Infuriating Tab problem in Vim, in literate Haskell I am using "Bird" style literate haskell, which requires all code to be like the follo...

Infuriating Tab problem in Vim, in literate Haskell Infuriating Tab problem in Vim, in literate Haskell haskell literate-programming tabs vim Infuriating Tab Vim Haskell Main Infuriating Tab problem in Vim, in literate Haskell I am using "Bird" style literate haskell, which requires all code to be like the following: a...

[ 0.0267333984375, 0.0017852783203125, -0.00640869140625, -0.0198974609375, -0.000766754150390625, 0.0023040771484375, 0.0145263671875, 0.01318359375, -0.01434326171875, -0.031494140625, 0.0184326171875, -0.0120849609375, -0.021484375, -0.01165771484375, -0.0142822265625, -0.010192871093...

[ 46757, 1162, 26518, 22193, 2967, 582, 39, 80109, 13, 20625, 142508, 23, 1556, 28966, 20928, 119916, 12321, 17368, 41153, 71, 20623, 144570, 756, 18151, 1884, 25632, 2174, 46389, 5608, 6713, 903, 3021, 33306, 3229, 30957, 5386, 24092, 32628, ...

[ 0.11669921875, 0.1988525390625, 0.138671875, 0.254150390625, 0.162353515625, 0.177001953125, 0.19775390625, 0.148681640625, 0.06524658203125, 0.1092529296875, 0.2091064453125, 0.002655029296875, 0.126953125, 0.05859375, 0.2303466796875, 0.2225341796875, 0.044586181640625, 0.0488281...

embed

32873037_c0

32873037

haskell

0

Title: Verifty if a tree is BST or not using Haskell Problem title: Verifty if a tree is BST or not using Haskell Tags: haskell Problem: Verifty if a tree is BST or not using Haskell Hello I am new to Haskell and trying to write a function to check if a tree is binary search tree or not . Below is my code :- data Tree ...

Verifty if a tree is BST or not using Haskell Verifty if a tree is BST or not using Haskell haskell Haskell Verifty BST Tree Node Leaf Show Bool Not Verifty if a tree is BST or not using Haskell Hello I am new to Haskell and trying to write a function to check if a tree is binary search tree or not . Below is my code :...

[ 0.0089111328125, 0.00628662109375, -0.00128173828125, -0.009765625, 0.031005859375, 0.00848388671875, -0.025390625, -0.0286865234375, -0.0234375, -0.0113525390625, -0.015380859375, -0.00579833984375, 0.0162353515625, -0.00567626953125, -0.002227783203125, 0.0133056640625, 0.020874023...

[ 1446, 3190, 939, 2174, 53201, 83, 335, 8545, 707, 959, 17368, 20625, 142508, 1556, 101344, 438, 112, 636, 2407, 17367, 2460, 929, 11205, 3525, 33022, 32354, 12765, 2394, 6635, 33938, 17336, 18151, 4966, 2046, 25632, 18499, 3229, 71924, 4358...

[ 0.1683349609375, 0.162353515625, 0.14794921875, 0.07269287109375, 0.251220703125, 0.117919921875, 0.1090087890625, 0.20654296875, 0.07244873046875, 0.13720703125, 0.1468505859375, 0.13525390625, 0.252685546875, 0.1265869140625, 0.2020263671875, 0.08392333984375, 0.055328369140625, ...

embed

13752014_c0

13752014

haskell

0

Title: Ambiguous type variable with HashMap Problem title: Ambiguous type variable with HashMap Tags: haskell Problem: Ambiguous type variable with HashMap I recently starting to play with haskell and I came across a problem while using HashMap that can be illustrated by this toy example: import Data.HashMap as HashMap...

Ambiguous type variable with HashMap Ambiguous type variable with HashMap haskell TypeError Data.HashMap the a Ambiguous HashMap HashMap.insert HashMap.empty Prelude List TypeError.hs Compiling Main TypeError.hs:3:22 Num TypeError.hs:3:22-23 Ord TypeError.hs:3:7-20 Data.Hashable.Hashable Possible Map Integer TypeError....

[ -0.01123046875, -0.00799560546875, -0.01507568359375, 0.01019287109375, 0.005401611328125, -0.00927734375, -0.015869140625, 0.0155029296875, -0.0172119140625, -0.0302734375, -0.00384521484375, -0.01470947265625, 0.00836181640625, 0.01092529296875, 0.01483154296875, -0.005126953125, 0...

[ 10250, 12282, 10821, 10644, 77336, 678, 162087, 166179, 1556, 142508, 60457, 18468, 31611, 11809, 6495, 1495, 33657, 33548, 1914, 822, 32036, 127, 15612, 49725, 12321, 363, 24070, 52782, 37620, 35379, 11033, 2886, 115861, 42719, 44401, 19721, 1...

[ 0.1796875, 0.2298583984375, 0.09814453125, 0.1734619140625, 0.2357177734375, 0.0728759765625, 0.1663818359375, 0.229248046875, 0.132568359375, 0.2191162109375, 0.18115234375, 0.1636962890625, 0.125, 0.08447265625, 0.11669921875, 0.09173583984375, 0.0701904296875, 0.08447265625, 0...

embed

34244574_c0

34244574

haskell

0

Title: Trouble understanding the type of sequence [Just, Just] Problem title: Trouble understanding the type of sequence [Just, Just] Tags: haskell Problem: Trouble understanding the type of sequence [Just, Just] I'm confused as to why I got this in GHCi :t sequence [Just,Just] sequence [Just, Just] :: a -> [Maybe a] T...

Trouble understanding the type of sequence [Just, Just] Trouble understanding the type of sequence [Just, Just] haskell Trouble Just Maybe Num Monad Traversable Trouble understanding the type of sequence [Just, Just] I'm confused as to why I got this in GHCi To elaborate, I can understand sequence [Just 1, Just 2] :: N...

[ 0.0076904296875, 0.0216064453125, -0.0098876953125, 0.029052734375, 0.0205078125, 0.00689697265625, -0.0018157958984375, 0.006103515625, 0.006988525390625, -0.0201416015625, 0.0031585693359375, -0.0233154296875, -0.0031585693359375, 0.0245361328125, -0.00029754638671875, -0.00512695312...

[ 119671, 2661, 100094, 10644, 40, 944, 3956, 127794, 4, 9563, 1556, 142508, 83425, 52782, 60331, 71, 7864, 2886, 55681, 15400, 4163, 903, 23, 527, 73265, 14, 121151, 831, 28219, 106, 116, 1984, 10, 44357, 11, 16487, 34735, 32354, 51776, 42...

[ 0.14013671875, 0.0784912109375, 0.141357421875, 0.159423828125, 0.07427978515625, 0.153076171875, 0.1192626953125, 0.189453125, 0.0118408203125, 0.2298583984375, 0.147705078125, 0.2474365234375, 0.203125, 0.172119140625, 0.14697265625, 0.1153564453125, 0.07763671875, 0.093017578125...

embed

16205086_c0

16205086

haskell

0

Title: Haskell Writing myLength Problem title: Haskell Writing myLength Tags: haskell Problem: Haskell Writing myLength I was working on this page http://www.haskell.org/haskellwiki/99_questions/Solutions/4 I understand what each function means and it is fun to see that a function can be defined in numerous ways like t...

Haskell Writing myLength Haskell Writing myLength haskell Haskell Writing Prelude x:xs Haskell Writing myLength I was working on this page http://www.haskell.org/haskellwiki/99_questions/Solutions/4 I understand what each function means and it is fun to see that a function can be defined in numerous ways like this. How...

[ -0.02001953125, 0.02734375, 0.00933837890625, -0.00122833251953125, -0.00139617919921875, -0.007232666015625, -0.0015716552734375, 0.00726318359375, 0.01397705078125, -0.05517578125, 0.01373291015625, 0.000049591064453125, 0.0157470703125, 0.0196533203125, 0.020751953125, -0.0095825195...

[ 20625, 142508, 213185, 759, 5267, 449, 927, 1556, 1914, 822, 112, 1022, 425, 20697, 98, 5, 10557, 13691, 5046, 7162, 5256, 102588, 34, 17357, 28219, 12638, 32354, 26950, 136, 442, 83, 7477, 47, 1957, 450, 831, 186, 61924, 71, 23, 183851...

[ 0.1451416015625, 0.236328125, 0.2325439453125, 0.1544189453125, 0.1583251953125, 0.208251953125, 0.149658203125, 0.138671875, 0.1605224609375, 0.2418212890625, 0.19287109375, 0.0296630859375, 0.07781982421875, 0.06011962890625, 0.00286865234375, 0.00732421875, 0.0789794921875, 0.05...

embed

41210599_c0

41210599

haskell

0

Title: ApplicativeDo not working with sequencing Problem title: ApplicativeDo not working with sequencing Tags: haskell, monads, do-notation, applicative Problem: ApplicativeDo not working with sequencing I have this type, basically a Kleisli arrow: {-# language DeriveFunctor #-} data Plan m i o = Plan (i -> m o) deriv...

ApplicativeDo not working with sequencing ApplicativeDo not working with sequencing haskell monads do-notation applicative a ApplicativeDo DeriveFunctor Plan Functor Monad Applicative ApplicativeDo not working with sequencing I have this type, basically a Kleisli arrow: Since it has an Applicative instance, I turn on A...

[ -0.00970458984375, 0.029296875, -0.0087890625, 0.0201416015625, -0.0185546875, 0.0235595703125, 0.0162353515625, 0.00164794921875, 0.016845703125, -0.0242919921875, 0.012451171875, 0.0004711151123046875, -0.018798828125, 0.02001953125, 0.0078125, -0.00946044921875, 0.000701904296875,...

[ 5659, 11048, 4935, 8331, 959, 20697, 678, 40, 944, 60636, 1556, 142508, 2667, 712, 54, 157, 22062, 41816, 1310, 5844, 97249, 18770, 5586, 28670, 60331, 71, 903, 10644, 198343, 24798, 164, 150, 118201, 110527, 15504, 98, 9790, 45367, 10, 3...

[ 0.1334228515625, 0.1751708984375, 0.1790771484375, 0.154541015625, 0.133056640625, 0.1422119140625, 0.12890625, 0.0989990234375, 0.146728515625, 0.110107421875, 0.1085205078125, 0.2159423828125, 0.0921630859375, 0.115966796875, 0.158447265625, 0.1495361328125, 0.0897216796875, 0.19...

embed

20785300_c0

20785300

haskell

0

Title: Parallel Computer Simulator Problem title: Parallel Computer Simulator Tags: language-agnostic, parallel-processing, developer-tools, haskell Problem: Parallel Computer Simulator I am using Haskell, which reported to be great and easy for parallelism. Unfortunately, I have no way to test this claim, as my comput...

Parallel Computer Simulator Parallel Computer Simulator language-agnostic parallel-processing developer-tools haskell Parallel Computer Simulator Parallel Computer Simulator I am using Haskell, which reported to be great and easy for parallelism. Unfortunately, I have no way to test this claim, as my computer has a sin...

[ -0.00323486328125, 0.0155029296875, -0.0146484375, 0.0146484375, -0.01104736328125, -0.003143310546875, -0.002227783203125, -0.007476806640625, -0.00022125244140625, -0.04296875, -0.005859375, 0.0169677734375, 0.0228271484375, 0.0130615234375, 0.00119781494140625, 0.006683349609375, ...

[ 211485, 40139, 144814, 1290, 46876, 2703, 2895, 95103, 63923, 214, 106001, 89110, 1556, 142508, 17368, 20625, 113771, 6782, 23468, 100, 8780, 185397, 3917, 3034, 63043, 13909, 11001, 14543, 42, 35672, 3714, 19537, 1221, 3249, 108975, 237, 2174,...

[ 0.252685546875, 0.133544921875, 0.2423095703125, 0.124755859375, 0.123046875, 0.0185699462890625, 0.139404296875, 0.267333984375, 0.1104736328125, 0.003082275390625, 0.122314453125, 0.18798828125, 0.1693115234375, 0.26708984375, 0.1239013671875, 0.166259765625, 0.06396484375, 0.064...

embed

45491709_c1

45491709

haskell

1

Configuring pcre-light-0.4.0.4... Cabal-simple_Z6RU0evB_1.24.2.0_ghc-8.0.2.exe: The program 'pkg-config' version >=0.9.0 is required but it could not be found. I've searched around a bit for a solution but couldn't find much. I also tried following the quick start guide on the Yesod website but that didn't fix anythin...

[ -0.014404296875, 0.03173828125, 0.016845703125, 0.00390625, -0.005096435546875, 0.0096435546875, -0.01470947265625, -0.001190185546875, -0.01287841796875, 0.000743865966796875, 0.01324462890625, -0.0289306640625, -0.000652313232421875, -0.029296875, 0.007537841796875, 0.00946044921875,...

[ 1657, 59994, 214, 36719, 107, 20016, 121254, 30438, 289, 191560, 1511, 910, 17759, 4854, 571, 20682, 73011, 9486, 238, 17376, 133684, 46480, 1528, 254, 8517, 9, 153837, 11389, 977, 145407, 38331, 2389, 56065, 1284, 442, 5809, 959, 186, 1403...

[ 0.08843994140625, 0.2235107421875, 0.0225677490234375, 0.07623291015625, 0.2188720703125, 0.2437744140625, 0.2069091796875, 0.174072265625, 0.1429443359375, 0.1771240234375, 0.03985595703125, 0.0181121826171875, 0.078857421875, 0.0921630859375, 0.05596923828125, 0.1204833984375, 0.12...

embed

59763149_c0

59763149

haskell

0

Title: Different results produced by stack runghc vs stack ghci Haskell Problem title: Different results produced by stack runghc vs stack ghci Haskell Tags: haskell-stack, haskell, megaparsec Problem: Different results produced by stack runghc vs stack ghci Haskell I'm writing a parser using Megaparsec. Basically, the...

Different results produced by stack runghc vs stack ghci Haskell Different results produced by stack runghc vs stack ghci Haskell haskell-stack haskell megaparsec Different Haskell Different results produced by stack runghc vs stack ghci Haskell I'm writing a parser using Megaparsec. Basically, the main file will open ...

[ -0.0057373046875, 0.001190185546875, 0.00156402587890625, 0.0157470703125, -0.005157470703125, 0.005401611328125, -0.006072998046875, -0.01068115234375, 0.001373291015625, -0.0042724609375, -0.0177001953125, -0.0086669921875, 0.01434326171875, 0.0181884765625, 0.00860595703125, 0.00393...

[ 242520, 50339, 181653, 177261, 120649, 127, 238, 20209, 31380, 318, 20625, 142508, 1556, 590, 2594, 31534, 2500, 39797, 390, 32562, 366, 2189, 17368, 26842, 5201, 11435, 1221, 9803, 12301, 10941, 6953, 51042, 26818, 26785, 566, 177, 5759, 123...

[ 0.1641845703125, 0.1744384765625, 0.1397705078125, 0.2115478515625, 0.1329345703125, 0.1240234375, 0.161376953125, 0.0992431640625, 0.126220703125, 0.2000732421875, 0.1326904296875, 0.257568359375, 0.10888671875, 0.094482421875, 0.1334228515625, 0.13232421875, 0.1158447265625, 0.20...

embed

37175877_c0

37175877

haskell

0

Title: Limiting the Types that a Type Paramater Can Take On in Data Declarations Problem title: Limiting the Types that a Type Paramater Can Take On in Data Declarations Tags: types, haskell, singleton-type Problem: Limiting the Types that a Type Paramater Can Take On in Data Declarations I'm aware that Haskell has par...

Limiting the Types that a Type Paramater Can Take On in Data Declarations Limiting the Types that a Type Paramater Can Take On in Data Declarations types haskell singleton-type Limiting Types Type Paramater Can Take Data Declarations Maybe Nothing Just Tag TagPrimitive TagComplex Integer Limiting the Types that a Type ...

[ -0.00119781494140625, 0.0145263671875, 0.00537109375, 0.0036468505859375, 0.0174560546875, 0.0086669921875, -0.00860595703125, 0.0014495849609375, -0.007232666015625, -0.01251220703125, 0.00078582763671875, -0.05078125, -0.00567626953125, -0.009765625, 0.0169677734375, 0.0174560546875,...

[ 125177, 214, 60457, 1720, 192, 720, 4171, 46673, 2161, 11809, 98501, 52895, 1556, 142508, 11001, 1507, 50986, 83425, 182747, 4837, 145111, 10770, 44974, 44401, 23, 107419, 20625, 121, 90306, 64807, 2053, 3917, 17475, 12096, 831, 8, 48345, 188...

[ 0.203125, 0.049957275390625, 0.227783203125, 0.1151123046875, 0.0968017578125, 0.1435546875, 0.0697021484375, 0.09429931640625, 0.166015625, 0.1292724609375, 0.2132568359375, 0.240966796875, 0.128173828125, 0.260986328125, 0.10687255859375, 0.15185546875, 0.1812744140625, 0.0158843...

embed

52673595_c0

52673595

haskell

0

Title: Multiple 'Just x' for 'case maybeVal of' in haskell Problem title: Multiple 'Just x' for 'case maybeVal of' in haskell Tags: haskell, switch-statement, option-type Problem: Multiple 'Just x' for 'case maybeVal of' in haskell Do multiple 'Just' cases work in haskell, and in...

Multiple 'Just x' for 'case maybeVal of' in haskell Multiple 'Just x' for 'case maybeVal of' in haskell haskell switch-statement option-type Multiple Just Ord Maybe Nothing Hello Multiple 'Just x' for 'case maybeVal of' in haskell Do multiple 'Just' cases work in haskell, and in ...

[ -0.0084228515625, -0.00341796875, 0.005340576171875, -0.000751495361328125, 0.00946044921875, 0.002655029296875, 0.0091552734375, 0.002960205078125, 0.0068359375, 0.00982666015625, 0.0098876953125, -0.01019287109375, -0.006103515625, -0.015869140625, -0.0029296875, 0.0054931640625, -...

[ 19335, 8705, 3768, 127794, 1022, 100, 58437, 51139, 42272, 111, 23, 1556, 142508, 101089, 61340, 35829, 50986, 9563, 35379, 83425, 182747, 35378, 984, 48716, 50218, 4488, 12989, 87293, 1632, 48903, 30441, 83, 158012, 5117, 60075, 13, 89829, 1...

[ 0.203369140625, 0.197265625, 0.068359375, 0.268798828125, 0.131103515625, 0.0810546875, 0.1790771484375, 0.1451416015625, 0.17236328125, 0.1939697265625, 0.05731201171875, 0.1378173828125, 0.2275390625, 0.1248779296875, 0.07745361328125, 0.141357421875, 0.07830810546875, 0.21032714...

embed

70641362_c0

70641362

haskell

0

Title: Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ Problem title: Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ Tags: function, haskell Problem: Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ I want to write a function that returns the longest pr...

Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ function haskell Couldn Bool Ord x:xs Couldn't match expected type ‘Bool’ with actual type ‘a -> Bool’ I want to write a function that returns the longest prefix of a list, w...

[ 0.00579833984375, 0.0140380859375, 0.0021820068359375, -0.00689697265625, 0.00299072265625, 0.0045166015625, 0.0030975341796875, 0.00384521484375, 0.021240234375, 0.0050048828125, 0.01080322265625, 0.0036163330078125, 0.003997802734375, -0.0069580078125, 0.01251220703125, 0.00442504882...

[ 191147, 19, 3768, 18, 14858, 84751, 10644, 12647, 929, 678, 8561, 11, 5386, 2460, 32354, 1556, 142508, 35379, 1022, 12, 425, 33079, 3444, 33022, 30646, 4989, 525, 183114, 5303, 59911, 10, 11907, 35735, 27489, 81113, 82800, 214, 3293, 18151,...

[ 0.1103515625, 0.07568359375, 0.0966796875, 0.1055908203125, 0.189697265625, 0.1588134765625, 0.1722412109375, 0.125, 0.21240234375, 0.09619140625, 0.1280517578125, 0.0904541015625, 0.10498046875, 0.1171875, 0.1708984375, 0.1485595703125, 0.2479248046875, 0.1761474609375, 0.068115...

embed

76299436_c0

76299436

haskell

0

Title: Haskell - compute frequencies of elements in a list Problem title: Haskell - compute frequencies of elements in a list Tags: fold, frequency, dictionary, haskell, counter Problem: Haskell - compute frequencies of elements in a list I need to compute a frequency map of an input list. My attempt: f :: (Eq a, Ord a...

Haskell - compute frequencies of elements in a list Haskell - compute frequencies of elements in a list fold frequency dictionary haskell counter Haskell Ord Map.Map Map.alter Map.findWithDefault Map.fromList Haskell - compute frequencies of elements in a list I need to compute a frequency map of an input list. My atte...

[ -0.00958251953125, -0.00112152099609375, 0.000553131103515625, -0.0205078125, -0.0172119140625, -0.004730224609375, -0.002777099609375, -0.01043701171875, 0.00469970703125, -0.0181884765625, -0.00799560546875, 0.00347900390625, 0.02978515625, 0.05859375, -0.004058837890625, -0.01257324...

[ 20625, 142508, 9969, 6743, 12478, 944, 117538, 80854, 23, 5303, 20, 111, 10, 42822, 27771, 45, 10763, 1556, 105416, 35379, 42719, 166179, 5, 48283, 111607, 194583, 187423, 11, 161063, 154663, 3871, 22288, 107730, 81887, 9393, 36917, 14602, 95...

[ 0.1795654296875, 0.27978515625, 0.144287109375, 0.1402587890625, 0.2176513671875, 0.2020263671875, 0.1219482421875, 0.211669921875, 0.0670166015625, 0.208740234375, 0.00506591796875, 0.043365478515625, 0.0189056396484375, 0.1781005859375, 0.103759765625, 0.027008056640625, 0.08441162...

embed

30822148_c1

30822148

haskell

1

newMap Map.! c, s):out) else compress x m i (c++[s]) out compress s m i c out = compress2 out compress2 :: [(Int,Char)]-> [(Int,Char)] compress2 out = trace("COMPRESSION FINISHED") out decompress :: [(Int,Char)] -> Map.Map Int String -> Int -> String -> String decompress (s:x) m i out = do if fst s == 0 then do let new...

[ -0.0238037109375, 0.0159912109375, 0.000789642333984375, 0.0277099609375, -0.005218505859375, 0.0137939453125, -0.000301361083984375, 0.013671875, 0.020751953125, 0.0289306640625, 0.0107421875, 0.0145263671875, 0.01080322265625, 0.01007080078125, -0.004974365234375, 0.00750732421875, ...

[ 3525, 166179, 42719, 38, 501, 4, 91, 2077, 6056, 37076, 375, 11856, 1022, 347, 17, 238, 37223, 7, 1810, 2203, 304, 1984, 4153, 18, 84068, 144851, 16113, 96547, 67227, 79909, 17610, 8, 277, 5, 360, 23351, 12, 425, 54, 1238, 271, 69112,...

[ 0.191650390625, 0.2568359375, 0.25732421875, 0.057220458984375, 0.051422119140625, 0.0197296142578125, 0.1248779296875, 0.00152587890625, 0.1402587890625, 0.0626220703125, 0.17236328125, 0.268310546875, 0.1146240234375, 0.112060546875, 0.1329345703125, 0.05877685546875, 0.20153808593...

embed

1816092_c1

1816092

haskell

1

fc5aa85daf318eeff084d98e2cff92578f; path=/; expires=Wed, 01 Jan 2020 08:00:00 GMT; HttpOnly Cache-Control: no-cache As far as I know, the Location should be a link to the new Gist. However, no new Gist is made. I'm not sure what I'm doing wrong. There is basically no documentation for the Gist API, and the only thing I...

[ -0.011962890625, 0.01068115234375, 0.00494384765625, -0.01422119140625, 0.009033203125, 0.032958984375, -0.008056640625, -0.0019683837890625, 0.0030975341796875, -0.0034332275390625, 0.01226806640625, -0.02978515625, -0.024169921875, -0.0220947265625, -0.0264892578125, 0.00506591796875...

[ 12951, 16665, 183282, 60875, 14700, 50964, 3413, 3342, 11075, 70126, 99961, 3062, 20320, 538, 2041, 1430, 175904, 110, 408, 90788, 5608, 186, 3126, 3525, 527, 1419, 33306, 83, 7228, 9077, 20594, 44691, 209806, 61687, 41591, 3900, 143, 158189,...

[ 0.046661376953125, 0.00604248046875, 0.0166168212890625, 0.1170654296875, 0.079345703125, 0.0772705078125, 0.03887939453125, 0.13427734375, 0.114013671875, 0.04022216796875, 0.103515625, 0.047576904296875, 0.0970458984375, 0.05731201171875, 0.0927734375, 0.09906005859375, 0.204711914...

embed

73932215_c1

73932215

haskell

1

g = let rightNeighbours = getNodeNeighbours (getNode u g) leftNeihbours = getNodeNeighbours (getNode v g) in rightNeighbours ++ leftNeihbours -- Get a node given its node id getNode :: Eq a => a -> Graph a -> (a, [a]) getNode y (Graph []) = (y, []) getNode y (Graph (x : xs)) | y == fst x = x | otherwise = getNode y (G...

[ -0.0283203125, 0.01483154296875, 0.016845703125, -0.00830078125, -0.005462646484375, 0.00927734375, -0.01275634765625, -0.00579833984375, 0.0211181640625, -0.01324462890625, 0.0140380859375, -0.022705078125, -0.009033203125, 0.02197265625, -0.0003070831298828125, 0.009033203125, -0.0...

[ 706, 2633, 7108, 6433, 6958, 38648, 2046, 5021, 112, 3794, 75, 25737, 1043, 81, 37223, 20779, 110, 34475, 3447, 864, 6524, 11727, 10, 113, 37878, 53, 1022, 271, 3871, 3917, 26292, 2831, 7440, 9232, 5983, 5036, 678, 9844, 51776, 12638, 1...

[ 0.1533203125, 0.139892578125, 0.160888671875, 0.069580078125, 0.152587890625, 0.1895751953125, 0.1324462890625, 0.18310546875, 0.157470703125, 0.082763671875, 0.13427734375, 0.172607421875, 0.0870361328125, 0.190673828125, 0.1173095703125, 0.10638427734375, 0.1641845703125, 0.04885...

embed

754279_c1

754279

haskell

1

Strings, but for the style of programming that is of limited usefulness, since I want to other stream functions to act on the strings themselves, not on actions that can produce a string. But, based on thinking through the other responses, I think I see why this is unsolvable in general. In the simple case I presented...

[ -0.0064697265625, 0.0162353515625, -0.0164794921875, -0.000186920166015625, 0.00518798828125, 0.00142669677734375, 0.0186767578125, 0.0001049041748046875, 0.0157470703125, -0.007659912109375, 0.0189208984375, -0.024658203125, 0.0269775390625, 0.01470947265625, -0.0174560546875, -0.0027...

[ 23351, 5180, 1284, 100, 20623, 56037, 449, 84046, 80234, 3444, 3789, 75973, 32354, 27992, 98, 79315, 7, 61261, 61972, 831, 27489, 47644, 57553, 15400, 51, 132944, 2886, 4537, 8781, 7225, 2367, 6183, 36663, 40, 944, 3956, 39933, 12989, 214, ...

[ 0.195556640625, 0.1815185546875, 0.06298828125, 0.01239013671875, 0.1680908203125, 0.111328125, 0.007171630859375, 0.1551513671875, 0.107666015625, 0.0533447265625, 0.07666015625, 0.232177734375, 0.16015625, 0.131103515625, 0.091064453125, 0.23291015625, 0.06884765625, 0.0853271484...

embed

48025222_c0

48025222

haskell

0

Title: Haskell make a list of the variables of a list Problem title: Haskell make a list of the variables of a list Tags: list, haskell Problem: Haskell make a list of the variables of a list Suppose I have the data data Expense = MkExpense Double String deriving (Eq,Ord) and a function balanced :: [Expense] -> Double ...

Haskell make a list of the variables of a list Haskell make a list of the variables of a list list haskell Haskell Expense MkExpense Double Ord Bool Haskell make a list of the variables of a list Suppose I have the data and a function which computes wether the list of expenses is balances (i.e. everyone paid the same w...

[ 0.007080078125, -0.00994873046875, -0.007354736328125, 0.003753662109375, -0.0032806396484375, 0.04443359375, -0.0172119140625, 0.02001953125, 0.01470947265625, -0.0048828125, -0.010009765625, -0.00848388671875, -0.005645751953125, -0.01531982421875, -0.0191650390625, 0.01470947265625,...

[ 20625, 142508, 3249, 5303, 111, 77336, 7, 1556, 60075, 21161, 276, 92, 19279, 2278, 184, 107172, 35379, 2460, 929, 2053, 32354, 7077, 9319, 14700, 47754, 83, 40197, 30309, 72090, 5701, 38132, 60212, 15759, 4759, 21917, 26518, 6275, 18499, 3...

[ 0.14990234375, 0.220703125, 0.03912353515625, 0.2301025390625, 0.032470703125, 0.24560546875, 0.0634765625, 0.1400146484375, 0.1378173828125, 0.1064453125, 0.028228759765625, 0.079345703125, 0.05499267578125, 0.155029296875, 0.00390625, 0.1153564453125, 0.149658203125, 0.0733642578...

embed

77798771_c0

77798771

haskell

0

Title: How can I write sum function as fast as c++ in haskell? Problem title: How can I write sum function as fast as c++ in haskell? Tags: haskell Problem: How can I write sum function as fast as c++ in haskell? Following 2 versions mysum functions in haskell are 10 times slower than c++ version (with ghc -O ). How ca...

How can I write sum function as fast as c++ in haskell? How can I write sum function as fast as c++ in haskell? haskell How Main Num x:xs How can I write sum function as fast as c++ in haskell? Following 2 versions mysum functions in haskell are 10 times slower than c++ version (with ghc -O ). How can I optimize mysum ...

[ -0.00194549560546875, 0.00262451171875, 0.0263671875, 0.000957489013671875, -0.0172119140625, -0.003753662109375, -0.003570556640625, 0.007476806640625, 0.0205078125, -0.0289306640625, 0.01416015625, -0.021728515625, 0.014892578125, -0.01031494140625, 0.00823974609375, 0.00053787231445...

[ 11249, 831, 33022, 10554, 32354, 237, 4271, 37223, 23, 1556, 142508, 87, 501, 12321, 52782, 1022, 12, 425, 7, 116, 11389, 759, 11832, 621, 209, 20028, 72803, 56, 3501, 31380, 238, 20, 670, 15572, 53333 ]

[ 0.05133056640625, 0.06158447265625, 0.170166015625, 0.24853515625, 0.185546875, 0.1090087890625, 0.1522216796875, 0.25439453125, 0.046783447265625, 0.152587890625, 0.2412109375, 0.033416748046875, 0.015106201171875, 0.1170654296875, 0.1343994140625, 0.07684326171875, 0.01791381835937...

embed

66238245_c0

66238245

haskell

0

Title: Fold with Data.Map.adjust Problem title: Fold with Data.Map.adjust Tags: iteration, dictionary, haskell, fold Problem: Fold with Data.Map.adjust I'm trying to get the correct function which will update one or multiple value by iterating over a list of key. Example: s1 = Data.Map.fromList [(1,"value1"), (2,"value...

Fold with Data.Map.adjust Fold with Data.Map.adjust iteration dictionary haskell fold Fold Data.Map.adjust Data.Map.fromList value1 value2 value3 Map.adjust Fold with Data.Map.adjust I'm trying to get the correct function which will update one or multiple value by iterating over a list of key. Example: By passing to th...

[ -0.0322265625, 0.00152587890625, 0.01312255859375, -0.01556396484375, -0.01513671875, 0.015380859375, -0.00176239013671875, 0.01123046875, 0.01080322265625, 0.0172119140625, 0.0240478515625, 0.00982666015625, 0.0081787109375, 0.01507568359375, 0.0225830078125, -0.00051116943359375, 0...

[ 30077, 71, 678, 11809, 166179, 712, 20314, 720, 10763, 1556, 142508, 42822, 161063, 154663, 34292, 304, 363, 42719, 31577, 2046, 26785, 32354, 1221, 28350, 1632, 707, 48716, 390, 17, 67, 98767, 645, 5303, 111, 22799, 89536, 452, 47, 90173, ...

[ 0.17724609375, 0.083740234375, 0.157958984375, 0.1510009765625, 0.1893310546875, 0.042694091796875, 0.1580810546875, 0.1754150390625, 0.05279541015625, 0.136962890625, 0.2249755859375, 0.2291259765625, 0.032440185546875, 0.0882568359375, 0.16357421875, 0.0209808349609375, 0.076721191...

embed

33404497_c0

33404497

haskell

0

Title: Explain the type signatures for High order functions? Problem title: Explain the type signatures for High order functions? Tags: haskell, type-signature Problem: Explain the type signatures for High order functions? function :: (t2 -> t1) -> (t1 -> t) -> t2 -> t function f1 f2 x = f2 (f1 x ) function1 :: (t -> t...

Explain the type signatures for High order functions? Explain the type signatures for High order functions? haskell type-signature Explain High function1 function11 function3 function4 Explain the type signatures for High order functions? Can anyone explain the type signatures for the the first two and also why the typ...

[ 0.01495361328125, -0.00109100341796875, -0.0291748046875, 0.006011962890625, 0.0244140625, -0.006256103515625, -0.01708984375, 0.0091552734375, 0.0155029296875, 0.00823974609375, -0.00823974609375, -0.01953125, 0.0009918212890625, 0.0037078857421875, -0.00994873046875, -0.0042419433593...

[ 60075, 16442, 70, 10644, 138256, 7, 100, 19694, 12989, 32354, 1556, 142508, 137432, 418, 1662, 363, 617, 73342, 6626, 15400, 4568, 138, 621, 5701, 11192 ]

[ 0.0947265625, 0.140625, 0.004547119140625, 0.2298583984375, 0.21533203125, 0.062225341796875, 0.055755615234375, 0.142333984375, 0.17724609375, 0.185302734375, 0.11669921875, 0.1907958984375, 0.1839599609375, 0.011993408203125, 0.090576171875, 0.08343505859375, 0.1240234375, 0.1221...

embed

55901933_c0

55901933

haskell

0

Title: Cant figure out simple haskell recursion problem Problem title: Cant figure out simple haskell recursion problem Tags: haskell, recursion, functional-programming Problem: Cant figure out simple haskell recursion problem I'm trying to write a simple haskell program that sums up the digits of an integer for exampl...

Cant figure out simple haskell recursion problem Cant figure out simple haskell recursion problem haskell recursion functional-programming System.IO Data.List Cant Integral x:xs Cant figure out simple haskell recursion problem I'm trying to write a simple haskell program that sums up the digits of an integer for exampl...

[ -0.0146484375, 0.0101318359375, 0.014892578125, 0.007568359375, -0.029296875, 0.024658203125, -0.0098876953125, -0.000698089599609375, 0.01513671875, -0.039794921875, 0.01611328125, -0.03076171875, -0.00811767578125, 0.02197265625, 0.005126953125, -0.00958251953125, -0.00119781494140...

[ 4171, 18, 26366, 1810, 8781, 1556, 142508, 195625, 1830, 2967, 123309, 28966, 12353, 17780, 11809, 154663, 204681, 1022, 12, 425, 31577, 33022, 1528, 10554, 1257, 153939, 892, 1505, 27781, 83, 49543, 5608, 382, 1328, 1019, 1369, 20682, 2831, ...

[ 0.1322021484375, 0.0987548828125, 0.1500244140625, 0.1058349609375, 0.195556640625, 0.1729736328125, 0.23583984375, 0.2247314453125, 0.09332275390625, 0.18505859375, 0.10760498046875, 0.07781982421875, 0.0648193359375, 0.1431884765625, 0.04327392578125, 0.07940673828125, 0.1632080078...

embed

40044118_c0

40044118

haskell

0

Title: in insufficiently-polymorphic why do we need the `bbb: B => B => B`? Problem title: in insufficiently-polymorphic why do we need the `bbb: B => B => B`? Tags: haskell, scala Problem: in insufficiently-polymorphic why do we need the `bbb: B => B => B`? in insufficiently-polymorphic why did the author ...

in insufficiently-polymorphic why do we need the `bbb: B => B => B`? in insufficiently-polymorphic why do we need the `bbb: B => B => B`? haskell scala List in insufficiently-polymorphic why do we need the `bbb: B => B => B`? in insufficiently-polymorphic why did the author add the 3rd argument: bbb: B => B...

[ -0.005767822265625, -0.0179443359375, 0.01123046875, -0.0067138671875, 0.001251220703125, 0.022216796875, -0.0029144287109375, -0.0027923583984375, 0.0152587890625, -0.004364013671875, 0.0084228515625, -0.033203125, -0.00122833251953125, 0.01019287109375, -0.00823974609375, -0.03271484...

[ 23, 129980, 538, 135545, 178851, 15400, 642, 3871, 5125, 12, 335, 5386, 275, 1556, 142508, 146232, 32036, 1771, 44357, 42179, 15190, 70, 138, 4216, 10750, 29459, 1295, 876, 47, 6044, 13580, 186683, 142477, 32354, 10, 1563, 62, 18151, 49814 ...

[ 0.052337646484375, 0.17626953125, 0.046478271484375, 0.16650390625, 0.1492919921875, 0.115966796875, 0.00341796875, 0.1119384765625, 0.18701171875, 0.0186614990234375, 0.1419677734375, 0.08984375, 0.005218505859375, 0.078857421875, 0.1929931640625, 0.1380615234375, 0.1083984375, 0....

embed

45594313_c0

45594313

haskell

0

Title: Can I include a not persisted field in models file? Problem title: Can I include a not persisted field in models file? Tags: haskell, persistent, yesod Problem: Can I include a not persisted field in models file? In a Yesod scaffolded site, the config/models file syntax support the addition of a field not persis...

Can I include a not persisted field in models file? Can I include a not persisted field in models file? haskell persistent yesod a Can User Text Maybe Can I include a not persisted field in models file? In a Yesod scaffolded site, the config/models file syntax support the addition of a field not persisted in the databa...

[ 0.0010986328125, 0.026123046875, -0.0101318359375, 0.0157470703125, -0.01385498046875, -0.00147247314453125, 0.0128173828125, 0.006134033203125, 0.0015106201171875, -0.02294921875, -0.0013427734375, 0.002044677734375, -0.019775390625, -0.000728607177734375, -0.0024261474609375, 0.00842...

[ 4171, 26698, 959, 70560, 297, 44457, 23, 115774, 11435, 1556, 142508, 2517, 2422, 23722, 53400, 24129, 83425, 32635, 2199, 42822, 1764, 153837, 51734, 6002, 86531, 8060, 66044, 63399, 16511, 2481, 76811, 78506, 139392, 3365, 316, 3444, 2053, ...

[ 0.078369140625, 0.1563720703125, 0.1611328125, 0.21533203125, 0.0948486328125, 0.2396240234375, 0.0489501953125, 0.2376708984375, 0.16259765625, 0.10516357421875, 0.203369140625, 0.043304443359375, 0.1204833984375, 0.177978515625, 0.1365966796875, 0.15283203125, 0.09393310546875, 0...

embed

6575758_c0

6575758

haskell

0

Title: How to write Haskell array strategies Problem title: How to write Haskell array strategies Tags: haskell, arrays Problem: How to write Haskell array strategies I want to write a strategy to evaluate items in an array in parallel. The old strategies had parArr to do this ( see here ). But this is not found in the...

How to write Haskell array strategies How to write Haskell array strategies haskell arrays How Haskell Array.array How to write Haskell array strategies I want to write a strategy to evaluate items in an array in parallel. The old strategies had parArr to do this ( see here ). But this is not found in the new Control.P...

[ -0.0191650390625, 0.0284423828125, -0.004425048828125, -0.000431060791015625, 0.00811767578125, -0.00628662109375, 0.006134033203125, -0.0155029296875, 0.01904296875, -0.023681640625, -0.0074462890625, 0.032958984375, 0.0242919921875, 0.0244140625, 0.0146484375, -0.0002613067626953125,...

[ 11249, 33022, 20625, 142508, 10298, 53, 50531, 1556, 4778, 69253, 19305, 7, 3444, 113857, 151575, 55769, 95103, 366, 7614, 42, 27131, 55292, 1229, 141, 97315, 31828, 88996, 5303, 219836, 22288, 1238, 759, 154663, 123041, 184, 864, 10, 62346, ...

[ 0.046112060546875, 0.212646484375, 0.1370849609375, 0.2314453125, 0.2008056640625, 0.1558837890625, 0.25830078125, 0.128662109375, 0.060638427734375, 0.1845703125, 0.1593017578125, 0.0040283203125, 0.0157928466796875, 0.211669921875, 0.1207275390625, 0.0914306640625, 0.214599609375, ...

embed

62900928_c0

62900928

haskell

0

Title: Golden test within smallcheck property test Problem title: Golden test within smallcheck property test Tags: smallcheck, haskell Problem: Golden test within smallcheck property test I have a manually-written "golden test" (write actual output to file, compare to "golden" expected file for equality) within a smal...

Golden test within smallcheck property test Golden test within smallcheck property test smallcheck haskell Golden Test.SmallCheck.forAll Golden test within smallcheck property test I have a manually-written "golden test" (write actual output to file, compare to "golden" expected file for equality) within a smallcheck p...

[ -0.01171875, -0.01434326171875, 0.005767822265625, 0.00628662109375, -0.01483154296875, 0.0019989013671875, 0.00714111328125, -0.01470947265625, -0.002838134765625, 0.00927734375, 0.018310546875, 0.0223388671875, 0.00701904296875, 0.010986328125, 0.007537841796875, 0.00494384765625, ...

[ 43114, 3034, 28032, 19336, 78292, 57266, 1556, 142508, 8647, 69070, 202567, 2472, 43512, 23009, 5429, 75639, 122558, 33, 18781, 8561, 140992, 11435, 69101, 84751, 161789, 189085, 645, 756, 64549, 25251, 316, 96760, 47, 308, 8946, 98169, 7, 11...

[ 0.1959228515625, 0.2174072265625, 0.1009521484375, 0.142822265625, 0.23291015625, 0.1363525390625, 0.076171875, 0.145263671875, 0.183349609375, 0.1497802734375, 0.21142578125, 0.0543212890625, 0.1248779296875, 0.09228515625, 0.006195068359375, 0.0148773193359375, 0.1552734375, 0.12...

embed

17866148_c0

17866148

haskell

0

Title: simplifying maybe Monad Problem title: simplifying maybe Monad Tags: monads, haskell, python Problem: simplifying maybe Monad I am trying to understand maybe Monad but most of the examples I saw used some language-specific feature. To ensure that I have gotten it conceptually right I thought of writing a generic...

simplifying maybe Monad simplifying maybe Monad monads haskell python Monad None Returns simplifying maybe Monad I am trying to understand maybe Monad but most of the examples I saw used some language-specific feature. To ensure that I have gotten it conceptually right I thought of writing a generic implementation. Bel...

[ -0.0283203125, 0.0238037109375, 0.023681640625, 0.0023040771484375, -0.002471923828125, 0.0142822265625, 0.012939453125, -0.000774383544921875, -0.00848388671875, -0.01397705078125, -0.004852294921875, -0.010498046875, -0.0194091796875, -0.004180908203125, 0.004638671875, -0.0102539062...

[ 112892, 18929, 214, 51139, 60331, 71, 2667, 712, 1556, 142508, 17198, 50828, 438, 86, 173340, 28219, 27781, 11814, 46876, 159975, 60213, 228113, 7108, 17569, 32562, 189534, 208124, 17336, 14192, 765, 17763, 33, 11522, 4537, 20650, 15190, 142424...

[ 0.19775390625, 0.1292724609375, 0.00933837890625, 0.171875, 0.2081298828125, 0.16748046875, 0.109375, 0.13525390625, 0.092529296875, 0.1956787109375, 0.052703857421875, 0.1085205078125, 0.0714111328125, 0.03790283203125, 0.190673828125, 0.05169677734375, 0.0557861328125, 0.02857971...

embed

38626215_c0

38626215

haskell

0

Title: Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell Problem title: Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell Tags: haskell, monads Problem: Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell I have two Haskell fu...

Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell haskell monads Equivalence Haskell triple2 triple3 Equivalence of (M a >>= f) >>= g and M a >>= (f >>= g) in Haskell I have two Haskell func...

[ 0.00897216796875, 0.00506591796875, 0.017822265625, 0.01080322265625, 0.0113525390625, -0.00180816650390625, 0.0003986358642578125, -0.01397705078125, 0.023681640625, 0.0023345947265625, -0.00157928466796875, 0.01239013671875, 0.014404296875, -0.0022735595703125, 0.00909423828125, 0.00...

[ 145666, 1405, 6620, 111, 594, 10, 5386, 1238, 706, 136, 276, 420, 20625, 142508, 23, 1556, 2667, 712, 162738, 304, 363, 6396, 6626, 32354, 183234, 138256, 1369, 83, 33079, 876, 70, 49129, 160291, 7, 11814, 11405, 41911, 109923, 4613, 1046...

[ 0.1219482421875, 0.153076171875, 0.03173828125, 0.039520263671875, 0.1490478515625, 0.14892578125, 0.1370849609375, 0.16259765625, 0.1607666015625, 0.103271484375, 0.1273193359375, 0.1219482421875, 0.1654052734375, 0.237548828125, 0.02044677734375, 0.145751953125, 0.059295654296875, ...

embed

27200825_c0

27200825

haskell

0

Title: Increment function for state monad in Haskell Problem title: Increment function for state monad in Haskell Tags: monads, haskell, state, increment Problem: Increment function for state monad in Haskell I have the following defined State Monad, with which I am trying to implement an increment function: data State...

Increment function for state monad in Haskell Increment function for state monad in Haskell monads haskell state increment Increment Haskell State Monad Increment function for state monad in Haskell I have the following defined State Monad, with which I am trying to implement an increment function: I have done the foll...

[ -0.0135498046875, -0.000423431396484375, 0.01275634765625, 0.0089111328125, 0.0081787109375, 0.0035247802734375, 0.003631591796875, -0.00921630859375, -0.011474609375, -0.0184326171875, 0.003692626953125, 0.01397705078125, -0.036376953125, 0.01025390625, 0.01104736328125, -0.0141601562...

[ 8942, 107, 674, 32354, 11341, 2667, 712, 23, 20625, 142508, 100, 1556, 158661, 22836, 60331, 71, 25632, 61924, 678, 31577, 29479, 16940, 903, 135179, 4488, 2071, 26785, 831, 493, 450, 160463, 8035, 297, 137567, 3642, 4527, 2046, 142, 3884 ]

[ 0.1214599609375, 0.1846923828125, 0.088134765625, 0.1973876953125, 0.1920166015625, 0.1348876953125, 0.1810302734375, 0.048370361328125, 0.1365966796875, 0.2445068359375, 0.01483154296875, 0.11962890625, 0.2529296875, 0.1927490234375, 0.180419921875, 0.131591796875, 0.064208984375, ...

embed

2777940_c0

2777940

haskell

0

Title: How do you solve this Haskell problem using a fold map and take? Problem title: How do you solve this Haskell problem using a fold map and take? Tags: higher-order-functions, haskell Problem: How do you solve this Haskell problem using a fold map and take? Define a function replicate which given a list of number...

How do you solve this Haskell problem using a fold map and take? How do you solve this Haskell problem using a fold map and take? higher-order-functions haskell a How Haskell replicate2 n:nn How do you solve this Haskell problem using a fold map and take? Define a function replicate which given a list of numbers return...

[ -0.0181884765625, -0.0024871826171875, -0.004241943359375, 0.01287841796875, -0.0242919921875, 0.0240478515625, 0.01031494140625, 0.01513671875, 0.020751953125, -0.02587890625, -0.01104736328125, -0.0157470703125, 0.017578125, 0.03369140625, -0.00098419189453125, -0.0244140625, 0.004...

[ 11249, 54, 86869, 903, 20625, 142508, 2967, 17368, 42822, 22288, 136, 5646, 10, 77546, 80596, 137175, 1556, 143126, 67, 304, 653, 12, 10713, 262, 64552, 32354, 34475, 5303, 101935, 30646, 12638, 14012, 171763, 3674, 6863, 34292, 36836, 758, ...

[ 0.0665283203125, 0.0313720703125, 0.1978759765625, 0.1190185546875, 0.18310546875, 0.281982421875, 0.201904296875, 0.101318359375, 0.239501953125, 0.2392578125, 0.1312255859375, 0.2265625, 0.08172607421875, 0.10589599609375, 0.1650390625, 0.1517333984375, 0.14794921875, 0.300048828...

embed

8924128_c0

8924128

haskell

0

Title: parsec error in haskelwiki tutorial Problem title: parsec error in haskelwiki tutorial Tags: haskell Problem: parsec error in haskelwiki tutorial I was following the code in http://www.haskell.org/haskellwiki/Hitchhikers_guide_to_Haskell , and the code (in chapter 2) gives an error. There is no author name/email...

parsec error in haskelwiki tutorial parsec error in haskelwiki tutorial haskell Text.ParserCombinators.Parsec Main Dir Show many1 dir_name Debug parsec error in haskelwiki tutorial I was following the code in http://www.haskell.org/haskellwiki/Hitchhikers_guide_to_Haskell , and the code (in chapter 2) gives an error. T...

[ -0.00177001953125, 0.0252685546875, 0.0020751953125, 0.0341796875, -0.005615234375, 0.020263671875, -0.01220703125, -0.033447265625, -0.0027313232421875, -0.037109375, -0.005340576171875, -0.020751953125, 0.006591796875, 0.00469970703125, -0.005828857421875, -0.009765625, 0.020019531...

[ 366, 39797, 18499, 1556, 2590, 13691, 57143, 23, 142508, 24129, 28636, 2189, 19155, 22230, 12321, 19946, 17367, 5941, 418, 5402, 11627, 262, 85779, 25632, 18151, 10557, 206, 979, 25306, 64527, 6495, 7, 139539, 4958, 42179, 9351, 25501, 119056...

[ 0.1688232421875, 0.287353515625, 0.2060546875, 0.1429443359375, 0.1649169921875, 0.2369384765625, 0.24365234375, 0.010162353515625, 0.2205810546875, 0.047393798828125, 0.1343994140625, 0.0229034423828125, 0.1168212890625, 0.048919677734375, 0.037078857421875, 0.0767822265625, 0.06768...

embed

64930007_c0

64930007

haskell

0

Title: Apply margin to inner elements in a Yesod form Problem title: Apply margin to inner elements in a Yesod form Tags: frontend, haskell, yesod-forms, yesod Problem: Apply margin to inner elements in a Yesod form I'm trying to apply margin to elements inside a renderDivs form: <$> areq textField (FieldSettings "Name...

Apply margin to inner elements in a Yesod form Apply margin to inner elements in a Yesod form frontend haskell yesod-forms yesod Apply Yesod FieldSettings Name Nothing Just hs12 Price Description Apply margin to inner elements in a Yesod form I'm trying to apply margin to elements inside a renderDivs form: Is it possib...

[ -0.0037384033203125, 0.029541015625, -0.01904296875, -0.012451171875, -0.0015716552734375, 0.007110595703125, 0.0159912109375, 0.01202392578125, 0.0036163330078125, -0.029052734375, 0.01544189453125, 0.01544189453125, -0.01177978515625, 0.01043701171875, 0.00189208984375, -0.0139770507...

[ 5659, 538, 92142, 47, 75414, 80854, 23, 32635, 2199, 3173, 12912, 3611, 1556, 142508, 2422, 23722, 5037, 117657, 105548, 15757, 182747, 9563, 1096, 7, 1530, 48025, 70643, 31577, 59911, 46132, 89159, 192576, 2071, 7722, 217064, 45258, 59279, 1...

[ 0.1201171875, 0.07012939453125, 0.272216796875, 0.15087890625, 0.2315673828125, 0.186279296875, 0.0188446044921875, 0.1790771484375, 0.269287109375, 0.2144775390625, 0.0258026123046875, 0.0653076171875, 0.0728759765625, 0.17822265625, 0.1182861328125, 0.232666015625, 0.201171875, 0...

embed

29691669_c0

29691669

haskell

0

Title: Map function takes non-function as first argument Problem title: Map function takes non-function as first argument Tags: haskell Problem: Map function takes non-function as first argument -- file: ch19/divby1.hs divBy :: Integral a => a -> [a] -> [a] divBy numerator = map (numerator `div`) This is the code excer...

Map function takes non-function as first argument Map function takes non-function as first argument haskell Map ch19 divby1.hs Integral Map function takes non-function as first argument This is the code excerpt from O'reilly - Haskell book. sample run as, What confuses me is why there are two variables on LHS divBy and...

[ -0.002166748046875, 0.0194091796875, 0.01251220703125, -0.0072021484375, -0.004730224609375, -0.00286865234375, 0.00006079673767089844, 0.0035552978515625, 0.004608154296875, -0.03369140625, 0.01068115234375, -0.0069580078125, 0.0191650390625, 0.013427734375, -0.00093841552734375, -0.0...

[ 42719, 32354, 51776, 351, 137175, 237, 5117, 10750, 1556, 142508, 3863, 2947, 18221, 1272, 418, 127, 204681, 18151, 180, 114833, 20625, 12877, 121413, 11675, 55681, 15400, 6626, 77336, 339, 38131, 75358, 136, 22542, 4597, 125195, 142424, 95486,...

[ 0.252197265625, 0.2119140625, 0.070556640625, 0.185791015625, 0.2091064453125, 0.07568359375, 0.1358642578125, 0.268310546875, 0.108642578125, 0.218017578125, 0.0557861328125, 0.1622314453125, 0.198486328125, 0.1737060546875, 0.025177001953125, 0.0810546875, 0.2015380859375, 0.1280...

embed

3111997_c0

3111997

haskell

0

Title: Nice small simple real life programming example in Haskell? Problem title: Nice small simple real life programming example in Haskell? Tags: functional-programming, haskell Problem: Nice small simple real life programming example in Haskell? I know, I might be asking much, but does any one know of some nice litt...

Nice small simple real life programming example in Haskell? Nice small simple real life programming example in Haskell? functional-programming haskell Nice Haskell Nice small simple real life programming example in Haskell? I know, I might be asking much, but does any one know of some nice little programming examples /...

[ 0.0023345947265625, 0.005950927734375, 0.010009765625, -0.00083160400390625, -0.002044677734375, 0.00823974609375, -0.009033203125, -0.00133514404296875, 0.0002613067626953125, -0.0177001953125, -0.0024871826171875, -0.0223388671875, -0.00286865234375, 0.0091552734375, 0, -0.0200195312...

[ 73398, 19336, 8781, 2773, 6897, 56037, 449, 27781, 23, 20625, 142508, 123309, 28966, 1556, 5045, 26267, 10176, 248, 35773, 100, 1326, 143669, 77391, 15411, 7639, 83, 1286, 3501, 150, 46401, 26499, 46876, 47, 12096, 101935, 21771, 14037, 19559...

[ 0.166259765625, 0.152587890625, 0.16943359375, 0.1417236328125, 0.158203125, 0.15673828125, 0.06829833984375, 0.1859130859375, 0.0574951171875, 0.1605224609375, 0.2342529296875, 0.1282958984375, 0.11962890625, 0.1231689453125, 0.0260162353515625, 0.1170654296875, 0.0999755859375, 0...

embed

33125851_c0

33125851

haskell

0

Title: Non-exhaustive patterns using if-then-else Problem title: Non-exhaustive patterns using if-then-else Tags: pattern-matching, haskell, functional-programming Problem: Non-exhaustive patterns using if-then-else I have the following function: myMaximum [] = error "There is no such thing as 'maximum' in an empty lis...

Non-exhaustive patterns using if-then-else Non-exhaustive patterns using if-then-else pattern-matching haskell functional-programming if-then-else Non-exhaustive There x:xs Non-exhaustive patterns using if-then-else I have the following function: I works just fine when I run myMaximum [1..5] , but it throws the error d...

[ -0.028076171875, 0.01385498046875, 0.0245361328125, 0.01068115234375, 0.02392578125, 0.019287109375, 0.01055908203125, -0.0101318359375, 0.0303955078125, -0.0130615234375, 0.019775390625, 0.00579833984375, 0.01202392578125, -0.002044677734375, 0.03564453125, 0.01373291015625, 0.01177...

[ 3775, 3355, 18391, 4935, 103510, 17368, 2174, 92733, 5557, 98753, 1556, 142508, 123309, 28966, 8622, 1022, 425, 25632, 32354, 43240, 1660, 5885, 11675, 759, 71346, 464, 316, 758, 104250, 18499, 61924, 5117, 13315, 76172, 1810, 186992, 351, 6,...

[ 0.1898193359375, 0.047698974609375, 0.1553955078125, 0.0865478515625, 0.2115478515625, 0.050933837890625, 0.181884765625, 0.1622314453125, 0.187744140625, 0.1337890625, 0.1029052734375, 0.1856689453125, 0.10888671875, 0.070068359375, 0.1131591796875, 0.0244903564453125, 0.06188964843...

embed

11851005_c0

11851005

haskell

0

Title: Why is numCapabilities a pure function? Problem title: Why is numCapabilities a pure function? Tags: haskell, standard-library Problem: Why is numCapabilities a pure function? In the concurrency library GHC.Conc there is a function called numCapabilities . Its type is numCapabilities :: Int and it actually retur...

Why is numCapabilities a pure function? Why is numCapabilities a pure function? haskell standard-library Why RTS Why is numCapabilities a pure function? In the concurrency library GHC.Conc there is a function called numCapabilities . Its type is numCapabilities :: Int and it actually returns some number you passed by t...

[ -0.004608154296875, -0.0130615234375, 0.01336669921875, -0.000820159912109375, 0.00970458984375, 0.027099609375, 0.01165771484375, -0.0245361328125, 0.0020904541015625, -0.01312255859375, -0.020751953125, -0.0172119140625, -0.0194091796875, 0.018310546875, 0.01190185546875, 0.010742187...

[ 44084, 13269, 87926, 27519, 2449, 34166, 32354, 10, 1556, 142508, 5570, 150, 2844, 27389, 294, 83, 108636, 982, 35773, 527, 73265, 11935, 238, 10644, 1984, 360, 18, 30646, 14012, 115081, 75101, 13315, 49938, 190, 50717, 997, 20503, 20, 839,...

[ 0.0986328125, 0.211181640625, 0.203857421875, 0.1923828125, 0.154296875, 0.1947021484375, 0.205810546875, 0.032196044921875, 0.09326171875, 0.188720703125, 0.0987548828125, 0.01544189453125, 0.0704345703125, 0.1439208984375, 0.106689453125, 0.006622314453125, 0.0894775390625, 0.042...

embed

34565651_c0

34565651

haskell

0

Title: Intermediate results in a recursive function Problem title: Intermediate results in a recursive function Tags: haskell Problem: Intermediate results in a recursive function I'm trying to write a function which will find all prime numbers from 2 to 100. I can do so by testing if a number is prime by looking at re...

Intermediate results in a recursive function Intermediate results in a recursive function haskell Intermediate n-1 t-1 t:ts Intermediate results in a recursive function I'm trying to write a function which will find all prime numbers from 2 to 100. I can do so by testing if a number is prime by looking at remainder whe...

[ -0.012939453125, 0.02099609375, 0.01556396484375, 0.001251220703125, 0.0289306640625, -0.0166015625, 0.00872802734375, -0.0145263671875, 0.0113525390625, -0.0306396484375, 0.0115966796875, -0.0162353515625, 0.00714111328125, 0.013671875, -0.0003299713134765625, 0.01031494140625, 0.01...

[ 5337, 12333, 67, 50339, 23, 195625, 5844, 32354, 1556, 142508, 653, 5759, 808, 933, 31577, 33022, 7413, 756, 20809, 101935, 116, 47, 805, 134234, 2174, 14012, 83, 16487, 47143, 820, 101637, 787, 5, 1884, 4734, 3034, 26548, 765, 21771, 140...

[ 0.1434326171875, 0.2176513671875, 0.11669921875, 0.1861572265625, 0.0335693359375, 0.2127685546875, 0.13916015625, 0.187744140625, 0.1142578125, 0.227294921875, 0.043365478515625, 0.1549072265625, 0.07598876953125, 0.107177734375, 0.058349609375, 0.08251953125, 0.09222412109375, 0....

embed