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
58056158_c0	58056158	haskell	0	Title: How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windows)? Problem title: How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windows)? Tags: haskell-stack, haskell Problem: How can I solve this problem The GHC located at ___ failed to comp...	How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windows)? How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windows)? haskell-stack haskell How GHC ___ How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windo...	[ 0.00372314453125, 0.00927734375, 0.00714111328125, 0.00372314453125, -0.000850677490234375, 0.01080322265625, -0.0189208984375, -0.0023956298828125, -0.0269775390625, 0.0019989013671875, -0.008544921875, -0.01300048828125, 0.02197265625, 0.0032806396484375, 0.007568359375, 0.0125732421...	[ 11249, 831, 86869, 903, 2967, 581, 527, 73265, 105866, 99, 116185, 165523, 47, 9969, 1340, 10, 112243, 53, 12765, 229792, 1556, 142508, 590, 2594, 31577, 4527, 98, 3773, 678, 21176, 12275, 18151, 87, 169581, 18499 ]	[ 0.06353759765625, 0.0147705078125, 0.162841796875, 0.08251953125, 0.148193359375, 0.0283050537109375, 0.1229248046875, 0.2335205078125, 0.16943359375, 0.1112060546875, 0.10302734375, 0.2003173828125, 0.01361083984375, 0.16015625, 0.1507568359375, 0.026397705078125, 0.2022705078125, ...	embed
61806668_c0	61806668	haskell	0	Title: Basic Implementation of Equals in Haskell Problem title: Basic Implementation of Equals in Haskell Tags: haskell Problem: Basic Implementation of Equals in Haskell I have something like data Example = Ex Integer How would I go about implementing equals for this? Furthest I have gotten is instance Eq Example wher...	Basic Implementation of Equals in Haskell Basic Implementation of Equals in Haskell haskell Basic Implementation Equals Haskell Example Integer Basic Implementation of Equals in Haskell I have something like How would I go about implementing equals for this? Furthest I have gotten is But that is wrong because that alwa...	[ -0.0016021728515625, 0.0198974609375, 0.0198974609375, 0.011474609375, 0.0040283203125, 0.01556396484375, -0.000942230224609375, -0.01446533203125, 0.00799560546875, 0.02392578125, 0.006072998046875, -0.027099609375, 0.0142822265625, 0.023193359375, -0.017578125, 0.0081787109375, 0.0...	[ 91692, 153941, 241, 71723, 7, 23, 20625, 142508, 2320, 1556, 89536, 44401, 11249, 2806, 1672, 29479, 214, 105950, 100, 903, 44691, 11343, 151575, 47, 29568, 5809, 3884, 122776, 110527, 892, 1505, 64457, 454, 62816, 11907 ]	[ 0.1710205078125, 0.1962890625, 0.10546875, 0.2235107421875, 0.132080078125, 0.0670166015625, 0.162353515625, 0.237060546875, 0.005767822265625, 0.1544189453125, 0.10174560546875, 0.1636962890625, 0.01959228515625, 0.01312255859375, 0.03466796875, 0.2022705078125, 0.004547119140625, ...	embed
61829221_c1	61829221	haskell	1	that I have cloned and dropped into my project (in the "static" directory): https://github.com/jgthms/bulma/blob/master/css/bulma.css I do not understand why the "button is-primary" and "button is-link" parts are not applying correctly. Other parts of bulma.css seem to be applying, as the fonts of the text are from bu...	that I have cloned and dropped into my project (in the "static" directory): https://github.com/jgthms/bulma/blob/master/css/bulma.css I do not understand why the "button is-primary" and "button is-link" parts are not applying correctly. Other parts of bulma.css seem to be applying, as the fonts of the text are from bu...	[ 0.0001735687255859375, 0.0130615234375, 0.0164794921875, 0.0281982421875, 0.0019073486328125, 0.0128173828125, -0.0032196044921875, -0.0223388671875, -0.0123291015625, -0.01318359375, -0.0296630859375, -0.01348876953125, 0.00213623046875, -0.0098876953125, -0.0186767578125, -0.01757812...	[ 765, 20450, 14534, 136, 36069, 20051, 3934, 13452, 201939, 14364, 15769, 32102, 170, 18337, 8516, 192, 12986, 275, 47327, 4439, 959, 28219, 15400, 8789, 1507, 83, 44526, 1294, 10187, 63920, 59911, 214, 26785, 64511, 183685, 7, 12401, 7986, ...	[ 0.003631591796875, 0.1507568359375, 0.08843994140625, 0.034942626953125, 0.08380126953125, 0.015594482421875, 0.05291748046875, 0.136474609375, 0.15185546875, 0.046112060546875, 0.06494140625, 0.144775390625, 0.001220703125, 0.078125, 0.139404296875, 0.2227783203125, 0.073486328125, ...	embed
61875223_c0	61875223	haskell	0	Title: How to turn all pedantic mode for hie in haskell? Problem title: How to turn all pedantic mode for hie in haskell? Tags: haskell-ide-engine, haskell Problem: How to turn all pedantic mode for hie in haskell? Is it possible to somehow pass --pedantic (as in stack build --pedantic) switch to Haskell-ide-engine? I'...	How to turn all pedantic mode for hie in haskell? How to turn all pedantic mode for hie in haskell? haskell-ide-engine haskell How How to turn all pedantic mode for hie in haskell? Is it possible to somehow pass --pedantic (as in stack build --pedantic) switch to Haskell-ide-engine? I'd like to see more errors in IDE d...	[ -0.007598876953125, -0.0137939453125, 0.00689697265625, -0.0091552734375, 0.00023365020751953125, 0.031982421875, 0.004119873046875, 0.019775390625, -0.018310546875, -0.038330078125, 0.01068115234375, -0.0203857421875, 0.01007080078125, 0.0191650390625, -0.0057373046875, 0.000816345214...	[ 11249, 47, 15504, 756, 50426, 109109, 13736, 100, 51965, 23, 1556, 142508, 2506, 128897, 7722, 209303, 27875, 4210, 20051, 177261, 45367, 101089, 20625, 1884, 1957, 1286, 18499, 36497, 20271, 9969, 1340, 1733, 46876, 351, 18391, 7225, 103510, ...	[ 0.09429931640625, 0.0494384765625, 0.1690673828125, 0.1390380859375, 0.1888427734375, 0.20458984375, 0.186767578125, 0.058074951171875, 0.266357421875, 0.08831787109375, 0.16162109375, 0.2447509765625, 0.2078857421875, 0.196044921875, 0.0694580078125, 0.032989501953125, 0.10876464843...	embed
6396672_c0	6396672	haskell	0	Title: Haskell string to list Problem title: Haskell string to list Tags: haskell Problem: Haskell string to list ["6","","[[1,2,3,4,5,6],[7,8,9,10,11,12],[13,14,15,16,17,18],[19,20,21,22,23,24],[25,26,27,28,29,30],[31,32,33,34,35,36]]"] I must get from this 6 and [[1,2,3,4,5,6],[7,8,9,10,11,12],[13,14,15,16,17,18],[19...	Haskell string to list Haskell string to list haskell Haskell Haskell string to list ["6","","[[1,2,3,4,5,6],[7,8,9,10,11,12],[13,14,15,16,17,18],[19,20,21,22,23,24],[25,26,27,28,29,30],[31,32,33,34,35,36]]"] I must get from this 6 and [[1,2,3,4,5,6],[7,8,9,10,11,12],[13,14,15,16,17,18],[19,20,21,22,23,24],[25,26,27,28...	[ 0.00482177734375, -0.005340576171875, -0.017578125, 0.0162353515625, -0.005279541015625, 0.0225830078125, 0.000518798828125, -0.010009765625, -0.00250244140625, -0.0096435546875, -0.0003509521484375, -0.04736328125, -0.0113525390625, 0.0034332275390625, -0.0040283203125, -0.00011157989...	[ 20625, 142508, 79315, 47, 5303, 1556, 378, 58, 910, 830, 1065, 133063, 4, 82449, 104629, 268, 966, 145180, 963, 1662, 1530, 2681, 2592, 1837, 2485, 2489, 1819, 2947, 1549, 3117, 4015, 3742, 2357, 2588, 4046, 3768, 3882, 4235, 1197, 5016, ...	[ 0.20263671875, 0.2705078125, 0.306396484375, 0.129150390625, 0.280029296875, 0.2001953125, 0.0125732421875, 0.0192718505859375, 0.2322998046875, 0.043670654296875, 0.0139617919921875, 0.141357421875, 0.014190673828125, 0.1900634765625, 0.2137451171875, 0.00677490234375, 0.06372070312...	embed
12442671_c0	12442671	haskell	0	Title: How do closures work in Haskell? Problem title: How do closures work in Haskell? Tags: haskell Problem: How do closures work in Haskell? I'm reading about the math foundation behind Haskell - I've learned about how closures can be used to save state in a function. I was wondering if Haskell allows closures, and ...	How do closures work in Haskell? How do closures work in Haskell? haskell How Haskell How do closures work in Haskell? I'm reading about the math foundation behind Haskell - I've learned about how closures can be used to save state in a function. I was wondering if Haskell allows closures, and how they work because the...	[ 0.00799560546875, 0.020751953125, 0.0159912109375, 0.0021820068359375, 0.01287841796875, 0.0030517578125, -0.004730224609375, -0.00157928466796875, 0.005706787109375, -0.0017547607421875, -0.00787353515625, -0.01373291015625, -0.003997802734375, 0.0084228515625, 0.0198974609375, -0.005...	[ 11249, 54, 6, 170224, 7, 4488, 23, 20625, 142508, 1556, 48909, 137374, 50155, 3642, 831, 11814, 47, 30098, 11341, 32354, 114864, 959, 34166, 73197, 155738, 5465, 87709, 68772, 12921, 140992, 31943, 107730, 2967, 456, 162, 31304, 77336, 7103, ...	[ 0.09521484375, 0.051788330078125, 0.0184783935546875, 0.267822265625, 0.1595458984375, 0.1614990234375, 0.0916748046875, 0.1444091796875, 0.240478515625, 0.1290283203125, 0.046844482421875, 0.0809326171875, 0.025543212890625, 0.02801513671875, 0.018035888671875, 0.08203125, 0.0141601...	embed
52115153_c0	52115153	haskell	0	Title: Passing RTS-opts to `stack test` Problem title: Passing RTS-opts to `stack test` Tags: haskell-stack, haskell Problem: Passing RTS-opts to `stack test` How can I pass RTS options to the test-suite of my project using stack? stack exec allows for passing options to the executable, but since stack test is a synony...	Passing RTS-opts to `stack test` Passing RTS-opts to `stack test` haskell-stack haskell Passing RTS-opts Passing RTS-opts to `stack test` How can I pass RTS options to the test-suite of my project using stack? stack exec allows for passing options to the executable, but since stack test is a synonym for stack build --t...	[ 0.0016632080078125, 0.0074462890625, -0.018798828125, -0.013671875, 0.003082275390625, -0.03173828125, -0.0164794921875, 0.00176239013671875, -0.01495361328125, -0.0179443359375, -0.007598876953125, 0.0228271484375, 0.011474609375, 0.0107421875, -0.0052490234375, 0.0272216796875, 0.0...	[ 28872, 27389, 294, 2146, 933, 47, 590, 2594, 3034, 1556, 142508, 831, 27875, 50717, 68879, 13, 13452, 177261, 1119, 3240, 114864, 452, 71924, 2886, 164661, 45367, 6954, 163846, 139392, 821, 58627, 51727, 105609, 140992, 35829, 170, 527, 73265...	[ 0.1146240234375, 0.174072265625, 0.173828125, 0.1507568359375, 0.0693359375, 0.0654296875, 0.1253662109375, 0.1142578125, 0.2275390625, 0.058074951171875, 0.1490478515625, 0.003875732421875, 0.135986328125, 0.21142578125, 0.13037109375, 0.0194854736328125, 0.0872802734375, 0.218994...	embed
28238177_c0	28238177	haskell	0	Title: Distributing cabal sandboxes Problem title: Distributing cabal sandboxes Tags: cabal, haskell Problem: Distributing cabal sandboxes I have a program that uses GHC-API to work with Haskell source files. The source files import modules from specific cabal-packages, which means that the cabal packages must be insta...	Distributing cabal sandboxes Distributing cabal sandboxes cabal haskell Distributing Distributing cabal sandboxes I have a program that uses GHC-API to work with Haskell source files. The source files import modules from specific cabal-packages, which means that the cabal packages must be installed to the system where ...	[ 0.0087890625, -0.0038604736328125, 0.00909423828125, -0.000766754150390625, -0.01806640625, -0.0022430419921875, -0.0004520416259765625, 0.0181884765625, 0.006805419921875, -0.00457763671875, 0.01470947265625, -0.0211181640625, -0.0111083984375, 0.01153564453125, 0.003204345703125, 0.0...	[ 75571, 1916, 109524, 19096, 11728, 90, 1556, 142508, 1528, 4527, 527, 73265, 9, 74220, 4488, 678, 20625, 31344, 102158, 24927, 88996, 29458, 29102, 98169, 8110, 20600, 5426, 13028, 28, 1544, 525, 3917, 47, 15917, 67, 759, 959, 1884, 31380, ...	[ 0.23876953125, 0.0560302734375, 0.262939453125, 0.1712646484375, 0.240478515625, 0.04547119140625, 0.1407470703125, 0.23046875, 0.18310546875, 0.048858642578125, 0.09375, 0.1895751953125, 0.0281982421875, 0.183837890625, 0.043365478515625, 0.06903076171875, 0.121826171875, 0.140991...	embed
45918288_c0	45918288	haskell	0	Title: What are 'Latch' and 'Pulse' in reactive-banana? Problem title: What are 'Latch' and 'Pulse' in reactive-banana? Tags: reactive-banana, reactive-programming, frp, haskell Problem: What are 'Latch' and 'Pulse' in reactive-banana? Do the Latch and Pulse types exist in FRP li...	What are 'Latch' and 'Pulse' in reactive-banana? What are 'Latch' and 'Pulse' in reactive-banana? reactive-banana reactive-programming frp haskell What Latch Pulse What are 'Latch' and 'Pulse' in reactive-banana? Do the Latch and Pulse types exist in FRP literature, or are they a...	[ 0.006805419921875, 0.0013427734375, -0.01263427734375, 0.01123046875, -0.011962890625, 0, -0.0009002685546875, 0.0274658203125, -0.0035247802734375, -0.015625, 0.0040283203125, -0.033203125, -0.021240234375, 0.005615234375, -0.00079345703125, 0.0113525390625, 0.0062255859375, 0.004...	[ 4865, 621, 3768, 2729, 18, 206, 136, 27559, 11971, 23, 456, 71232, 105281, 11, 28966, 14119, 254, 1556, 142508, 75346, 21694, 184, 52895, 32316, 563, 38796, 163136, 57241, 42179, 16487, 1836, 166904, 42518, 873, 98409, 36943, 1884, 3714, 60...	[ 0.06085205078125, 0.045745849609375, 0.054931640625, 0.1021728515625, 0.104736328125, 0.2069091796875, 0.1517333984375, 0.208984375, 0.2060546875, 0.03955078125, 0.1142578125, 0.213623046875, 0.191162109375, 0.166748046875, 0.11962890625, 0.048583984375, 0.0966796875, 0.06628417968...	embed
46626507_c1	46626507	haskell	1	Lam (Leaf) = 0 countLam (NodeOne a) = 1 + countLam a countLam (NodeTwo a b) = countLam a + countLam b countLeaf :: Tree a -> Int countLeaf (Leaf) = 1 countLeaf (NodeOne a) = countLeaf a countLeaf (NodeTwo a b) = countLeaf a + countLeaf b This attempt fails ofcourse. I don't know how to decrement the counter(s) for the ...	Lam (Leaf) = 0 countLam (NodeOne a) = 1 + countLam a countLam (NodeTwo a b) = countLam a + countLam b countLeaf :: Tree a -> Int countLeaf (Leaf) = 1 countLeaf (NodeOne a) = countLeaf a countLeaf (NodeTwo a b) = countLeaf a + countLeaf b This attempt fails ofcourse. I don't know how to decrement the counter(s) for the ...	[ 0.018798828125, 0.01019287109375, -0.0133056640625, 0.01312255859375, 0.030029296875, 0.003997802734375, -0.0031280517578125, -0.01556396484375, 0.0093994140625, -0.04833984375, -0.00848388671875, -0.0028076171875, 0.01239013671875, 0.0029144287109375, 0.022216796875, -0.01409912109375...	[ 59387, 5267, 2407, 757, 54529, 2729, 39, 5021, 112, 62068, 10, 106, 997, 3613, 876, 101344, 360, 81887, 35782, 3714, 3642, 8, 7612, 674, 70, 105416, 110, 195625, 1830, 32354, 2046, 41170, 988, 14507, 56073, 4527, 28282, 122799, 53201, 449...	[ 0.1973876953125, 0.0916748046875, 0.198486328125, 0.105224609375, 0.1463623046875, 0.0418701171875, 0.145263671875, 0.1234130859375, 0.1453857421875, 0.1568603515625, 0.048583984375, 0.037811279296875, 0.06854248046875, 0.13720703125, 0.052490234375, 0.1885986328125, 0.00482177734375...	embed
58715748_c0	58715748	haskell	0	Title: Is there a turtle function or other Haskell abstraction for joining commands using .&& Problem title: Is there a turtle function or other Haskell abstraction for joining commands using .&& Tags: haskell, haskell-turtle Problem: Is there a turtle function or other Haskell abstraction for joining c...	Is there a turtle function or other Haskell abstraction for joining commands using .&& Is there a turtle function or other Haskell abstraction for joining commands using .&& haskell haskell-turtle Haskell ExitSuccess Is there a turtle function or other Haskell abstraction for joining commands using .&& ...	[ 0.0038604736328125, -0.0026397705078125, -0.0023345947265625, 0.029541015625, 0.002777099609375, 0.001373291015625, -0.0137939453125, -0.0252685546875, -0.0000514984130859375, -0.000064849853515625, 0.000286102294921875, 0.011962890625, -0.0028839111328125, 0.00518798828125, -0.018432617...	[ 2071, 2685, 2130, 17991, 32354, 707, 3789, 20625, 142508, 164789, 1830, 100, 33284, 214, 75101, 17368, 5, 1230, 10, 1556, 987, 5443, 217, 14168, 238, 26531, 18151, 4527, 242, 39933, 11522, 59911, 50339, 3060, 54686, 194583, 79459, 7 ]	[ 0.025177001953125, 0.0528564453125, 0.1597900390625, 0.2149658203125, 0.18701171875, 0.010284423828125, 0.01641845703125, 0.08575439453125, 0.2144775390625, 0.1788330078125, 0.08331298828125, 0.000274658203125, 0.1751708984375, 0.048858642578125, 0.2161865234375, 0.060089111328125, 0...	embed
10786485_c1	10786485	haskell	1	even though y and w are both in their correct places in the lambda-expressions, how would the program "know" that the first y represents the first w and the second y represents the second w . I would need to be consistent about this in an implementation. In short, how would I go about implementing an error-free versio...	even though y and w are both in their correct places in the lambda-expressions, how would the program "know" that the first y represents the first w and the second y represents the second w . I would need to be consistent about this in an implementation. In short, how would I go about implementing an error-free versio...	[ -0.006103515625, 0.005584716796875, -0.00006198883056640625, 0.0047607421875, -0.006256103515625, -0.004852294921875, 0.000102996826171875, 0.01141357421875, 0.01483154296875, 0.0191650390625, 0.000690460205078125, -0.01409912109375, 0.006866455078125, -0.0186767578125, 0.004425048828125...	[ 113, 136, 148, 15044, 23, 26785, 44677, 70, 21, 6492, 85, 204629, 3642, 2806, 1528, 69723, 450, 5117, 33636, 7, 17932, 74729, 208124, 1672, 29479, 18499, 9, 32087, 11389, 32354, 83, 6210, 14612, 11935, 38242, 2517, 24763, 91736, 28960, 44...	[ 0.177001953125, 0.0743408203125, 0.1837158203125, 0.07220458984375, 0.03375244140625, 0.1552734375, 0.123046875, 0.00311279296875, 0.07025146484375, 0.196533203125, 0.162353515625, 0.1802978515625, 0.046142578125, 0.0202789306640625, 0.1632080078125, 0.1678466796875, 0.0355224609375,...	embed
35534795_c0	35534795	haskell	0	Title: Can't display unicode Problem title: Can't display unicode Tags: haskell, unicode, ghc Problem: Can't display unicode I have a feeling that this has already been answered somewhere: if so I apologise. I am trying to use an executable that writes Unicode characters to standard output. All I get is this ...	Can't display unicode Can't display unicode haskell unicode ghc Can Can't display unicode I have a feeling that this has already been answered somewhere: if so I apologise. I am trying to use an executable that writes Unicode characters to standard output. All I get is this error message (hPutChar from Haskel...	[ 0.0081787109375, 0.018310546875, 0.0162353515625, -0.01263427734375, 0.004730224609375, 0.01214599609375, 0.0167236328125, 0.0015106201171875, -0.0147705078125, 0.032470703125, -0.01519775390625, -0.019775390625, 0.00921630859375, 0.01239013671875, -0.0264892578125, 0.00946044921875, ...	[ 4171, 3768, 18, 44116, 60347, 112, 1556, 142508, 31380, 238, 194663, 12524, 31577, 4527, 71924, 2886, 33022, 219778, 124850, 47, 5570, 140992, 3164, 903, 18499, 26008, 127, 27559, 84068, 1295, 20625, 34735, 959, 5665, 87, 53418, 15549, 2367, ...	[ 0.090576171875, 0.10125732421875, 0.0816650390625, 0.214111328125, 0.2122802734375, 0.1719970703125, 0.1400146484375, 0.2442626953125, 0.1171875, 0.0823974609375, 0.010223388671875, 0.0206146240234375, 0.06927490234375, 0.037841796875, 0.1370849609375, 0.126220703125, 0.0565795898437...	embed
1834169_c0	1834169	haskell	0	Title: Mapping the :edit command to a certain editor Problem title: Mapping the :edit command to a certain editor Tags: emacs, haskell Problem: Mapping the :edit command to a certain editor I've got the Haskell interpreter running in Emacs. With this I've got the typical Emacs setup of 2 open windows, the source file I...	Mapping the :edit command to a certain editor Mapping the :edit command to a certain editor emacs haskell Mapping Mapping the :edit command to a certain editor I've got the Haskell interpreter running in Emacs. With this I've got the typical Emacs setup of 2 open windows, the source file I'm editing the Haskell interpr...	[ 0.00933837890625, -0.00421142578125, 0.00007486343383789062, -0.00872802734375, -0.0076904296875, 0.0206298828125, -0.01043701171875, 0.0028839111328125, 0.00921630859375, -0.04833984375, 0.007232666015625, -0.01123046875, 0.0042724609375, 0.01495361328125, -0.003143310546875, -0.00817...	[ 911, 26783, 152, 45082, 75101, 47, 24233, 30391, 352, 2263, 1556, 142508, 20625, 29481, 56, 51042, 85269, 4439, 222201, 169581, 116, 9803, 54825, 31344, 11435, 27211, 14192, 18622, 4299, 3917, 22288, 4527, 64457, 127, 7, 111938, 291, 48398, ...	[ 0.1937255859375, 0.06427001953125, 0.07568359375, 0.260009765625, 0.1881103515625, 0.0802001953125, 0.06671142578125, 0.19580078125, 0.06890869140625, 0.07861328125, 0.1112060546875, 0.218017578125, 0.1124267578125, 0.1707763671875, 0.0938720703125, 0.017120361328125, 0.1639404296875...	embed
23901801_c0	23901801	haskell	0	Title: Why can't a monad be decomposed? Problem title: Why can't a monad be decomposed? Tags: monads, happstack, io, haskell Problem: Why can't a monad be decomposed? I don't understand why I can't decompose a (let's say IO) monad. Like IO a -> a ? My question originated when using happstack and wanting to ge...	Why can't a monad be decomposed? Why can't a monad be decomposed? monads happstack io haskell Why Text ServerPart Maybe Why can't a monad be decomposed? I don't understand why I can't decompose a (let's say IO) monad. Like IO a -> a ? My question originated when using happstack and wanting to get the Text out...	[ -0.0027923583984375, 0.0054931640625, 0.00543212890625, 0.04345703125, 0.000904083251953125, 0.00933837890625, 0.0040283203125, -0.009521484375, -0.004547119140625, -0.01348876953125, 0.0037841796875, -0.0157470703125, -0.000667572021484375, 0.00537109375, 0.00616455078125, -0.00300598...	[ 44084, 831, 3768, 18, 2667, 712, 186, 8, 277, 144429, 256, 6366, 590, 2594, 22995, 1556, 142508, 24129, 22687, 58229, 83425, 10, 28219, 15400, 78381, 17780, 33079, 62038, 17368, 2046, 1810, 176377, 109585, 3650, 6713, 174379, 56206, 37629, ...	[ 0.139404296875, 0.1302490234375, 0.03985595703125, 0.12939453125, 0.1693115234375, 0.2459716796875, 0.06201171875, 0.181884765625, 0.1834716796875, 0.1846923828125, 0.06683349609375, 0.080322265625, 0.128173828125, 0.10516357421875, 0.180419921875, 0.076416015625, 0.1990966796875, ...	embed
74376390_c0	74376390	haskell	0	Title: Time complexity of a haskell function Problem title: Time complexity of a haskell function Tags: time-complexity, haskell Problem: Time complexity of a haskell function Consider the following code for a function isPrime. f :: Integer -> Integer f n = head (filter isPrime [0..n]) Assuming that isPrime k computes ...	Time complexity of a haskell function Time complexity of a haskell function time-complexity haskell Time Integer Time complexity of a haskell function Consider the following code for a function isPrime. Assuming that isPrime k computes a boolean in O(k) time, what is the time complexity of f n ? My thought process was ...	[ -0.01611328125, 0.0196533203125, 0.015625, -0.00150299072265625, 0.01385498046875, -0.00946044921875, 0.0233154296875, -0.0201416015625, -0.01361083984375, -0.0517578125, 0.0135498046875, 0.00164794921875, -0.0076904296875, -0.0009765625, -0.01177978515625, 0.0078125, 0.0294189453125...	[ 19055, 27140, 2481, 1556, 142508, 32354, 111, 1733, 277, 44974, 44401, 137399, 25632, 18151, 83, 145111, 13, 66596, 472, 375, 7077, 337, 31, 34677, 180, 92, 2367, 70, 1238, 653, 17569, 9433, 46312, 192617, 5608, 19, 5, 26785, 23468, 36298...	[ 0.1708984375, 0.229736328125, 0.12939453125, 0.1627197265625, 0.2587890625, 0.1881103515625, 0.046142578125, 0.19580078125, 0.05810546875, 0.170654296875, 0.1470947265625, 0.011138916015625, 0.00921630859375, 0.1568603515625, 0.12841796875, 0.188232421875, 0.10443115234375, 0.03384...	embed
49508251_c1	49508251	haskell	1	x -- problem is in this leftover (x, xs) -> do yield x leftover $ BS.tail xs message The idea I had is that if there is nothing coming from the upstream combinator will have to wait until there will be something, such that it can send a complete message downstream. But it seams that conduit starts spinning on CPU a lo...	x -- problem is in this leftover (x, xs) -> do yield x leftover $ BS.tail xs message The idea I had is that if there is nothing coming from the upstream combinator will have to wait until there will be something, such that it can send a complete message downstream. But it seams that conduit starts spinning on CPU a lo...	[ 0.004669189453125, 0.0205078125, -0.005767822265625, 0.012939453125, 0.002960205078125, -0.000957489013671875, 0.0169677734375, -0.0281982421875, 0.01324462890625, -0.0123291015625, -0.00958251953125, -0.00121307373046875, 0.036865234375, 0.0230712890625, 0.0074462890625, 0.01031494140...	[ 1022, 4210, 2967, 83, 23, 903, 25737, 5465, 425, 7, 54, 11180, 19388, 3650, 84145, 46741, 26008, 6528, 1902, 33720, 38162, 1257, 86429, 22321, 1290, 40485, 24189, 9844, 25379, 28484, 7565, 40, 8256, 120565, 4034, 25927, 592, 98, 86039, 59...	[ 0.1522216796875, 0.027557373046875, 0.1773681640625, 0.044342041015625, 0.06439208984375, 0.109375, 0.1865234375, 0.2164306640625, 0.1177978515625, 0.1173095703125, 0.074951171875, 0.1700439453125, 0.229248046875, 0.10015869140625, 0.101318359375, 0.2166748046875, 0.129638671875, 0...	embed
7669658_c0	7669658	haskell	0	Title: Haskell Peano Numbers Problem title: Haskell Peano Numbers Tags: peano-numbers, integer, haskell Problem: Haskell Peano Numbers I'm trying to write a function toPeano :: Int -> Nat toPeano n = that turns an Integer into its Peano Number. I have the data: data Nat = Zero \| Succ Nat deriving Show For example, toPe...	Haskell Peano Numbers Haskell Peano Numbers peano-numbers integer haskell Haskell Peano Numbers Nat Zero Succ Show Haskell Peano Numbers I'm trying to write a function that turns an Integer into its Peano Number. I have the data: For example, and so on. I have no idea how to get it to print out the Peano Numbers given ...	[ -0.01708984375, -0.0118408203125, 0.00787353515625, 0.0089111328125, -0.0159912109375, 0.03076171875, 0.0172119140625, 0.006103515625, -0.00994873046875, -0.009765625, -0.0079345703125, -0.02490234375, -0.00836181640625, 0.0264892578125, -0.0142822265625, 0.01312255859375, 0.00092697...	[ 20625, 142508, 1460, 3922, 103332, 7, 280, 9, 2606, 1297, 892, 1505, 1556, 68875, 83947, 1832, 10060, 17367, 87, 31577, 33022, 32354, 15504, 44401, 3934, 6863, 765, 2053, 27781, 221, 98, 110, 6528, 3642, 2046, 442, 47, 28412, 1810, 70, ...	[ 0.158935546875, 0.27099609375, 0.20703125, 0.30517578125, 0.25, 0.0792236328125, 0.16748046875, 0.0310821533203125, 0.190185546875, 0.195068359375, 0.1484375, 0.1553955078125, 0.126953125, 0.189453125, 0.205078125, 0.1370849609375, 0.1651611328125, 0.17724609375, 0.02264404296875...	embed
69201225_c0	69201225	haskell	0	Title: Undoing a prefix sum Problem title: Undoing a prefix sum Tags: haskell, prefix-sum Problem: Undoing a prefix sum The simple way to calculate a prefix sum in Haskell is scanl1 (+) [1,2,3,4,5,6] which produces the output [1,3,6,10,15,21] I needed to write the inverse, and this is what I came up with: undo_prefix_s...	Undoing a prefix sum Undoing a prefix sum haskell prefix-sum Undoing scanl1 undo_prefix_sum Num Undoing a prefix sum The simple way to calculate a prefix sum in Haskell is which produces the output I needed to write the inverse, and this is what I came up with: This seems to be correct (but I might have missed somethin...	[ -0.0087890625, 0.0228271484375, 0.0186767578125, 0.0174560546875, -0.01318359375, 0.0037078857421875, -0.0147705078125, 0.01361083984375, 0.00058746337890625, -0.017822265625, -0.000591278076171875, -0.00958251953125, -0.00080108642578125, 0.01458740234375, 0.00347900390625, 0.01110839...	[ 5533, 31, 183114, 10554, 1556, 142508, 11832, 44954, 141, 418, 165, 4692, 55923, 52782, 8781, 3917, 74481, 67, 10, 23, 20625, 27489, 140992, 44841, 33022, 37676, 1257, 678, 37202, 26785, 13648, 156304, 93766, 54, 903, 17368 ]	[ 0.1431884765625, 0.151123046875, 0.2410888671875, 0.22509765625, 0.12841796875, 0.2415771484375, 0.2178955078125, 0.1395263671875, 0.0777587890625, 0.02020263671875, 0.1422119140625, 0.0693359375, 0.1710205078125, 0.1103515625, 0.1142578125, 0.0345458984375, 0.1749267578125, 0.0420...	embed
31145309_c0	31145309	haskell	0	Title: Type classes - Brief Explanation Problem title: Type classes - Brief Explanation Tags: haskell, typeclass, types Problem: Type classes - Brief Explanation I am new to Haskell and i come from c++ background. I am having some trouble understanding the relation between types and type classes. From what i understand...	Type classes - Brief Explanation Type classes - Brief Explanation haskell typeclass types Type Brief Explanation Type classes - Brief Explanation I am new to Haskell and i come from c++ background. I am having some trouble understanding the relation between types and type classes. From what i understand type classes sp...	[ 0.01513671875, 0.0238037109375, 0.0054931640625, 0.0169677734375, 0.007659912109375, 0.00457763671875, 0.00775146484375, 0.008056640625, -0.0029449462890625, -0.0034027099609375, -0.0137939453125, -0.0272216796875, 0.005706787109375, 0.00982666015625, -0.01239013671875, 0.0164794921875...	[ 60457, 61112, 101936, 5443, 5868, 20, 1556, 142508, 10644, 67413, 52895, 3525, 20625, 37223, 76615, 63134, 100094, 41911, 17721, 136, 28219, 40140, 147306, 32354, 70, 864, 18507, 58735, 69112, 248, 1369, 139124, 808, 29459, 5154, 83, 110527, ...	[ 0.2646484375, 0.26953125, 0.16064453125, 0.03436279296875, 0.1495361328125, 0.00836181640625, 0.1217041015625, 0.1973876953125, 0.26611328125, 0.26318359375, 0.25830078125, 0.0280609130859375, 0.1043701171875, 0.123046875, 0.051971435546875, 0.0288848876953125, 0.057220458984375, 0...	embed
31598608_c0	31598608	haskell	0	Title: compare contents of Either type Problem title: compare contents of Either type Tags: haskell Problem: compare contents of Either type is there a way to use pattern wildcards for type constructors to make this ugly code shorter: eitherCompare (Left a) (Left b) = compare a b eitherCompare (Left a) (Right b) = comp...	compare contents of Either type compare contents of Either type haskell Either Left Right Ord Ordering compare contents of Either type is there a way to use pattern wildcards for type constructors to make this ugly code shorter: something like (which won't compile) or some other method?	[ -0.0081787109375, -0.01263427734375, -0.0128173828125, -0.007781982421875, -0.00531005859375, -0.00604248046875, -0.0086669921875, -0.0230712890625, -0.0002841949462890625, 0.0169677734375, 0.0191650390625, -0.00494384765625, 0.0140380859375, -0.0120849609375, -0.002471923828125, -0.02...	[ 69101, 10941, 4565, 9319, 10644, 1556, 142508, 2480, 90911, 35379, 81206, 3917, 4527, 103510, 56409, 38931, 64549, 25251, 3249, 75, 110608, 18151, 16610, 56, 23742, 18, 9969, 1340, 55300 ]	[ 0.1522216796875, 0.169921875, 0.03216552734375, 0.1539306640625, 0.17529296875, 0.096435546875, 0.1907958984375, 0.034637451171875, 0.0732421875, 0.1409912109375, 0.1419677734375, 0.0177001953125, 0.0219573974609375, 0.1636962890625, 0.11883544921875, 0.21728515625, 0.111328125, 0....	embed
6292613_c0	6292613	haskell	0	Title: a Haskell program using Head and Tail to relate 2 strings Problem title: a Haskell program using Head and Tail to relate 2 strings Tags: haskell Problem: a Haskell program using Head and Tail to relate 2 strings I need to determine whether a string is a substring of another string. I think is comparing the head ...	a Haskell program using Head and Tail to relate 2 strings a Haskell program using Head and Tail to relate 2 strings haskell Head Haskell Tail a Haskell program using Head and Tail to relate 2 strings I need to determine whether a string is a substring of another string. I think is comparing the head of one string with ...	[ 0.0274658203125, -0.000644683837890625, -0.0135498046875, 0.02783203125, -0.0108642578125, 0.0189208984375, 0.0184326171875, 0.00445556640625, 0.0098876953125, -0.0098876953125, 0.008056640625, -0.005340576171875, -0.005126953125, 0.0194091796875, -0.006683349609375, -0.01123046875, ...	[ 20625, 142508, 1528, 17368, 44816, 136, 1218, 379, 33444, 13, 116, 79315, 10, 1556, 3871, 47, 83324, 36766, 83, 1614, 91693, 111, 15700, 5351, 37397, 10336, 1632, 678, 46741, 69101, 12638, 12830, 119131, 7, 5281, 3789, 44841, 4358, 32354, ...	[ 0.1434326171875, 0.2362060546875, 0.1798095703125, 0.0712890625, 0.221435546875, 0.148193359375, 0.1719970703125, 0.1448974609375, 0.1834716796875, 0.0966796875, 0.10540771484375, 0.2144775390625, 0.04888916015625, 0.129150390625, 0.06756591796875, 0.052947998046875, 0.1837158203125,...	embed
35364007_c0	35364007	haskell	0	Title: getLine doesn't stop Problem title: getLine doesn't stop Tags: user-input, haskell, ghc Problem: getLine doesn't stop My program goes something like main :: IO String main = do putStrLn "input a" a <- getChar putStrLn "input b" b <- getLine putStrLn "input c" c <- getChar return a:c:b Behaviour: I get ...	getLine doesn't stop getLine doesn't stop user-input haskell ghc a:c:b getLine doesn't stop My program goes something like Behaviour: I get "input a" printed, and the program waits for me to type a Char and press return. From there, it scrolls past getLine without ever letting me input something. How can I ma...	[ 0.003204345703125, 0.005401611328125, 0.00469970703125, 0.0147705078125, -0.01153564453125, -0.00010442733764648438, 0.0228271484375, -0.007568359375, 0.004486083984375, -0.03173828125, 0.015869140625, -0.0096435546875, -0.02099609375, 0.007232666015625, -0.00909423828125, -0.001785278...	[ 2046, 93232, 22027, 3768, 18, 7279, 38937, 73, 7077, 1556, 142508, 31380, 238, 10, 275, 1528, 60899, 873, 98409, 34639, 28412, 40485, 10644, 21656, 24234, 30646, 192046, 11015, 15490, 17669, 95, 19514, 107730, 9844, 3249, 54, 150661, 44402, ...	[ 0.1556396484375, 0.28515625, 0.09564208984375, 0.0654296875, 0.0899658203125, 0.201416015625, 0.1192626953125, 0.06976318359375, 0.11181640625, 0.1055908203125, 0.2095947265625, 0.06573486328125, 0.032745361328125, 0.09393310546875, 0.022918701171875, 0.139892578125, 0.01837158203125...	embed
15491707_c0	15491707	haskell	0	Title: Could not deduce (Eq a), adding Eq to typeclass Problem title: Could not deduce (Eq a), adding Eq to typeclass Tags: haskell Problem: Could not deduce (Eq a), adding Eq to typeclass v ^/ a = (1/a) ^ v negateVector v = (-1) ^ v v1 ^-^ _ = v1 ^+^ v1 -- (negateVector v2) norm v = sqrt (v `dot` v) normalize v = if...	Could not deduce (Eq a), adding Eq to typeclass Could not deduce (Eq a), adding Eq to typeclass haskell a the Could AFRPVectorSpace.hs:51:25 VectorSpace AFRPVectorSpace.hs Possible Floating Deriving Could not deduce (Eq a), adding Eq to typeclass I'm quite new to Haskell, and I ran into this bug when trying to compile ...	[ -0.00531005859375, 0.03125, -0.01251220703125, 0.026611328125, 0.0027008056640625, 0.007659912109375, 0.001220703125, -0.014404296875, 0.004730224609375, -0.0072021484375, -0.0299072265625, 0.0034027099609375, 0.0020751953125, 0.01361083984375, -0.038818359375, -0.004425048828125, 0....	[ 191147, 959, 8, 106357, 647, 864, 10, 154107, 241, 47, 10644, 67413, 1556, 142508, 70, 28211, 38796, 26455, 18770, 141012, 127, 37374, 21224, 2609, 115861, 38699, 26518, 1310, 14, 6496, 3525, 20625, 903, 54608, 9969, 1340, 7868, 177, 18151,...	[ 0.1622314453125, 0.1490478515625, 0.164306640625, 0.212158203125, 0.0234375, 0.1937255859375, 0.142333984375, 0.11181640625, 0.0616455078125, 0.0595703125, 0.15625, 0.2130126953125, 0.1055908203125, 0.2039794921875, 0.034759521484375, 0.002593994140625, 0.04022216796875, 0.07128906...	embed
23461932_c1	23461932	haskell	1	.csv" --PriceData/Daily/Yhoo.csv" let lineList :: [C.ByteString] = C.lines contents -- Break the contents into a list of lines let bars :: [Either String Bar] = map (parseOnly barParser) lineList -- Using the attoparsec let ohlcBarList :: OHLCBarList = barsToBarList bars -- Now I have a nice simple list of tuples with ...	.csv" --PriceData/Daily/Yhoo.csv" let lineList :: [C.ByteString] = C.lines contents -- Break the contents into a list of lines let bars :: [Either String Bar] = map (parseOnly barParser) lineList -- Using the attoparsec let ohlcBarList :: OHLCBarList = barsToBarList bars -- Now I have a nice simple list of tuples with ...	[ 0.0186767578125, 0.0186767578125, -0.013916015625, 0.023193359375, 0.0159912109375, 0.0263671875, 0.006805419921875, 0.007598876953125, 0.00567626953125, -0.0028839111328125, -0.016845703125, -0.009765625, -0.01123046875, -0.01220703125, -0.011474609375, 0.00176239013671875, -0.01696...	[ 5, 4439, 334, 4210, 33163, 329, 137989, 212128, 1723, 68336, 58, 2633, 13315, 154663, 441, 75358, 67, 71713, 214, 313, 59801, 10941, 131904, 70, 3934, 10, 5303, 124519, 1909, 9319, 23351, 3253, 22288, 2500, 20320, 28636, 2189, 345, 243, 3...	[ 0.06719970703125, 0.1319580078125, 0.248046875, 0.0199432373046875, 0.100341796875, 0.04559326171875, 0.11083984375, 0.1500244140625, 0.1036376953125, 0.232666015625, 0.008331298828125, 0.108154296875, 0.1474609375, 0.1953125, 0.017791748046875, 0.0714111328125, 0.0550537109375, 0....	embed
51213160_c0	51213160	haskell	0	Title: Making a custom list ADT instance of Monoid Problem title: Making a custom list ADT instance of Monoid Tags: haskell Problem: Making a custom list ADT instance of Monoid It's probably something obvious I'm missing, but it seems like this should work, yet it gives an Expecting one more argument to ‘Star' Expected...	Making a custom list ADT instance of Monoid Making a custom list ADT instance of Monoid haskell Making ADT Monoid Expecting Star Expected None Union Show Making a custom list ADT instance of Monoid It's probably something obvious I'm missing, but it seems like this should work, yet it gives an Expecting one more argume...	[ -0.0238037109375, 0.00130462646484375, 0.00799560546875, 0.0194091796875, 0.0034637451171875, 0.0030059814453125, -0.000293731689453125, -0.012451171875, 0.0091552734375, 0.006866455078125, 0.0084228515625, -0.0164794921875, -0.007781982421875, 0.00494384765625, -0.0196533203125, -0.00...	[ 13676, 114122, 5303, 62, 41072, 110527, 77879, 532, 214, 1556, 142508, 60075, 24762, 4612, 13, 89829, 438, 32528, 17367, 162520, 132283, 442, 37202, 5608, 4488, 14373, 1632, 1286, 10750, 44072, 10, 10644, 1284, 8562, 1639, 33079, 661, 18499, ...	[ 0.0406494140625, 0.1590576171875, 0.190185546875, 0.051300048828125, 0.186767578125, 0.1502685546875, 0.1475830078125, 0.1451416015625, 0.0435791015625, 0.07763671875, 0.1903076171875, 0.10101318359375, 0.134765625, 0.129150390625, 0.10614013671875, 0.104248046875, 0.06842041015625, ...	embed
53680811_c0	53680811	haskell	0	Title: Parsing list with nested list using Aeson Problem title: Parsing list with nested list using Aeson Tags: haskell, aeson Problem: Parsing list with nested list using Aeson When trying to parse some simple JSON using Aeson I get a type error I don't understand. I have the following JSON jsonString = "[\"a\", [\"b\...	Parsing list with nested list using Aeson Parsing list with nested list using Aeson haskell aeson Aeson Data.Aeson GHC.Generics qualified Parsing L.ByteString Data.ByteString.Lazy Show Generic FromJSON Either Left Error Array Parsing list with nested list using Aeson When trying to parse some simple JSON using Aeson I ...	[ -0.017578125, 0.01123046875, -0.02197265625, 0.037109375, -0.007568359375, 0.01123046875, -0.00125885009765625, -0.005279541015625, -0.00131988525390625, 0.00335693359375, 0.0135498046875, -0.0189208984375, 0.019775390625, 0.0103759765625, -0.0150146484375, 0.0017852783203125, 0.0012...	[ 2392, 6953, 5303, 678, 8512, 71, 17368, 62, 90, 191, 1556, 142508, 10, 11809, 73265, 135932, 12259, 217225, 75358, 71713, 67, 2729, 3285, 17367, 88342, 28090, 1375, 58627, 9319, 2480, 212059, 69253, 31577, 366, 184, 8781, 821, 10644, 18499,...	[ 0.14892578125, 0.0665283203125, 0.1600341796875, 0.0703125, 0.2030029296875, 0.108154296875, 0.057159423828125, 0.1043701171875, 0.1240234375, 0.1878662109375, 0.059295654296875, 0.1612548828125, 0.043731689453125, 0.034027099609375, 0.0970458984375, 0.0546875, 0.0176239013671875, ...	embed
19160306_c0	19160306	haskell	0	Title: Inferred type is not general enough Problem title: Inferred type is not general enough Tags: haskell, prefix Problem: Inferred type is not general enough I'm wondering if a list is a prefix of a second list, using the following code: prefix :: [a] -> [b] -> Bool prefix [] _ = True prefix _ [] = False prefix (x:x...	Inferred type is not general enough Inferred type is not general enough haskell prefix Inferred Bool x:xs y:ys Expression Expected Inferred type is not general enough I'm wondering if a list is a prefix of a second list, using the following code: But it returns an error: Can someone help me get this to work?	[ -0.00970458984375, 0.0079345703125, 0.0172119140625, 0.0133056640625, 0.003662109375, -0.004608154296875, -0.0125732421875, 0.002288818359375, 0.0018310546875, 0.0228271484375, 0.0064697265625, -0.031494140625, 0.0023651123046875, -0.01495361328125, -0.0037841796875, -0.000432968139648...	[ 360, 2875, 2822, 10644, 959, 4537, 20174, 83, 1556, 142508, 183114, 2460, 929, 1022, 425, 113, 4778, 25129, 60075, 13, 149016, 5303, 10, 111, 17932, 17368, 25632, 18151, 30646, 18499, 4358, 4488 ]	[ 0.0556640625, 0.18359375, 0.176025390625, 0.1771240234375, 0.1221923828125, 0.16796875, 0.1629638671875, 0.04449462890625, 0.100341796875, 0.1864013671875, 0.2203369140625, 0.045440673828125, 0.1317138671875, 0.014617919921875, 0.0386962890625, 0.018157958984375, 0.09649658203125, ...	embed
49317826_c1	49317826	haskell	1	:: [Parameter] } deriving (Eq, Show) data KeyAndParameters = KeyAndParameters Text [Parameter] parseParameter :: Parser Parameter parseParameter = do n <- takeWhile1 (notInClass "@") _ <- char '@' t <- takeWhile1 (const True) return $ Parameter { name = n, paramType = t } parseKeyAndParameters :: Parser KeyAndParamete...	:: [Parameter] } deriving (Eq, Show) data KeyAndParameters = KeyAndParameters Text [Parameter] parseParameter :: Parser Parameter parseParameter = do n <- takeWhile1 (notInClass "@") _ <- char '@' t <- takeWhile1 (const True) return $ Parameter { name = n, paramType = t } parseKeyAndParameters :: Parser KeyAndParamete...	[ -0.0205078125, 0.00677490234375, -0.03173828125, 0.007049560546875, -0.01275634765625, 0.0135498046875, -0.001556396484375, -0.0223388671875, 0.013671875, -0.005584716796875, 0.0208740234375, -0.01171875, 0.016357421875, 0.0064697265625, -0.0113525390625, 0.005096435546875, 0.0004348...	[ 1984, 55292, 29089, 51912, 16406, 6496, 864, 4, 17367, 2053, 26824, 37839, 2203, 24129, 366, 184, 2392, 2189, 1720, 54, 653, 5646, 1456, 979, 133, 418, 10869, 4153, 140803, 981, 21441, 808, 87599, 30646, 3650, 9351, 121, 196707, 162429, 2...	[ 0.1348876953125, 0.1907958984375, 0.254150390625, 0.048797607421875, 0.18115234375, 0.2113037109375, 0.18212890625, 0.0006103515625, 0.20458984375, 0.2152099609375, 0.216064453125, 0.2509765625, 0.0792236328125, 0.1986083984375, 0.1558837890625, 0.138671875, 0.1533203125, 0.1866455...	embed
78469720_c1	78469720	haskell	1	5) Just 5 Property (Just 5) Property 5 Basically, I want the (Just 5) in Property (Just 5) to be parenthesised, but not the 5 in Property 5 . I'm guessing I need some sort of check on the precedent n , and to add brackets conditionally, but I'm not sure what this check is. How can I write this Show instance to get wha...	5) Just 5 Property (Just 5) Property 5 Basically, I want the (Just 5) in Property (Just 5) to be parenthesised, but not the 5 in Property 5 . I'm guessing I need some sort of check on the precedent n , and to add brackets conditionally, but I'm not sure what this check is. How can I write this Show instance to get wha...	[ -0.0242919921875, 0.000751495361328125, 0.03076171875, 0.0179443359375, 0.0078125, 0.0198974609375, 0.04443359375, -0.02099609375, 0.033203125, 0.01422119140625, 0.005126953125, 0.0067138671875, -0.0064697265625, 0.0025177001953125, -0.00616455078125, 0.003021240234375, -0.0220947265...	[ 21162, 9563, 190, 206984, 127794, 3444, 70, 186, 49129, 160291, 5281, 1284, 959, 57767, 3871, 12765, 123132, 653, 15190, 1620, 27853, 35431, 33022, 17367, 110527, 2046, 2367, 151134, 45831, 19273, 238, 1022, 47, 534, 58, 6872, 4488, 15400, ...	[ 0.2274169921875, 0.1707763671875, 0.217529296875, 0.2491455078125, 0.16162109375, 0.10699462890625, 0.00079345703125, 0.00994873046875, 0.1405029296875, 0.1417236328125, 0.095947265625, 0.00848388671875, 0.0340576171875, 0.0015869140625, 0.005126953125, 0.146240234375, 0.203491210937...	embed
68967424_c0	68967424	haskell	0	Title: PostsController for href attribute Problem title: PostsController for href attribute Tags: ihp, haskell, blaze-html Problem: PostsController for href attribute import qualified Text.Blaze.Html5 as H import qualified Text.Blaze.Html5.Attributes as A Code signals: Data.String, Web.View.Prelude, qualified, PostsCon...	PostsController for href attribute PostsController for href attribute ihp haskell blaze-html Data.String Web.View.Prelude qualified PostsController View EditView PostsAction Posts Edit Post H.nav H.ol A.class_ H.li H.a A.href H.h1 Couldn H.AttributeValue PostsActiontypecheck Defined Dropbox Documents Web Types.hs:13:7 ...	[ 0.01513671875, -0.002777099609375, 0.00799560546875, 0.00109100341796875, 0.00372314453125, -0.007568359375, 0.021240234375, 0.0021514892578125, -0.00787353515625, -0.041748046875, -0.018798828125, -0.01129150390625, -0.0177001953125, -0.00616455078125, 0.006134033203125, -0.0057067871...	[ 2795, 7, 175904, 603, 100, 77867, 420, 150380, 9633, 254, 1556, 142508, 9932, 731, 7693, 11809, 71713, 4002, 100474, 19273, 822, 217225, 29805, 42079, 284, 10763, 572, 46069, 929, 62, 67413, 150, 127, 29087, 191147, 191145, 50986, 78292, 59...	[ 0.18359375, 0.044647216796875, 0.2464599609375, 0.139404296875, 0.0258941650390625, 0.197021484375, 0.16162109375, 0.2252197265625, 0.06890869140625, 0.10986328125, 0.1263427734375, 0.207763671875, 0.1829833984375, 0.153076171875, 0.2130126953125, 0.0633544921875, 0.1436767578125, ...	embed
23793076_c2	23793076	haskell	2	signature for dimDistance :: Key k => k -> V3 a -> V3 a -> Double at src/Data/KDTree.hs:47:3 Relevant bindings include k :: k (bound at src/Data/KDTree.hs:47:15) dimDistance :: k -> V3 a -> V3 a -> Double (bound at src/Data/KDTree.hs:47:3) In the pattern: V3X In a case alternative: V3X -> ax - bx In the second argumen...	signature for dimDistance :: Key k => k -> V3 a -> V3 a -> Double at src/Data/KDTree.hs:47:3 Relevant bindings include k :: k (bound at src/Data/KDTree.hs:47:15) dimDistance :: k -> V3 a -> V3 a -> Double (bound at src/Data/KDTree.hs:47:3) In the pattern: V3X In a case alternative: V3X -> ax - bx In the second argumen...	[ 0.025634765625, -0.00628662109375, -0.028076171875, -0.0308837890625, 0.01239013671875, -0.0225830078125, -0.013427734375, -0.008056640625, -0.0014190673828125, -0.00762939453125, 0.0025482177734375, -0.0186767578125, 0.01397705078125, -0.018798828125, -0.03515625, 0.00567626953125, ...	[ 138256, 100, 34355, 14055, 116071, 1984, 26824, 472, 44357, 33079, 310, 363, 10, 107172, 99, 19437, 137989, 605, 107, 13, 127, 33573, 133, 30624, 128239, 7, 26698, 99091, 12221, 21320, 103510, 1542, 7225, 30700, 425, 876, 17932, 10750, 111,...	[ 0.274169921875, 0.04656982421875, 0.2183837890625, 0.227783203125, 0.262451171875, 0.06048583984375, 0.2498779296875, 0.137451171875, 0.059356689453125, 0.038330078125, 0.1214599609375, 0.1737060546875, 0.1158447265625, 0.1632080078125, 0.007049560546875, 0.066162109375, 0.1016845703...	embed
39195297_c0	39195297	haskell	0	Title: Haskell even number iteration Problem title: Haskell even number iteration Tags: fold, recursion, iteration, haskell Problem: Haskell even number iteration I'm trying to drop all odd number from a list of integers.. however having some problems (I'm a total newbie), here's my code: evenfunc :: [Int] -> [Int] eve...	Haskell even number iteration Haskell even number iteration fold recursion iteration haskell list Haskell Haskell even number iteration I'm trying to drop all odd number from a list of integers.. however having some problems (I'm a total newbie), here's my code: Its giving me a 'parse error on input '='' message when t...	[ -0.008056640625, 0.010986328125, 0.023681640625, -0.00701904296875, -0.00113677978515625, 0.046630859375, 0.0029449462890625, -0.0089111328125, 0.00567626953125, -0.025146484375, 0.0140380859375, -0.0301513671875, -0.00836181640625, 0.01043701171875, 0.002960205078125, 0.0206298828125,...	[ 20625, 142508, 3853, 14012, 17, 720, 2320, 42822, 195625, 1556, 5303, 31577, 36069, 756, 70270, 1295, 892, 26255, 49903, 44402, 3622, 3525, 9014, 3688, 18151, 68772, 163, 2500, 184, 18499, 98, 107730, 1369, 4765, 26008, 11675, 903, 444, 205...	[ 0.13330078125, 0.1700439453125, 0.215087890625, 0.1817626953125, 0.0335693359375, 0.207275390625, 0.0408935546875, 0.1669921875, 0.1331787109375, 0.1226806640625, 0.140869140625, 0.09234619140625, 0.2088623046875, 0.08892822265625, 0.2005615234375, 0.08294677734375, 0.0906982421875, ...	embed
4074342_c0	4074342	haskell	0	Title: reading file and accessing in haskell (functional programming language) Problem title: reading file and accessing in haskell (functional programming language) Tags: haskell Problem: reading file and accessing in haskell (functional programming language) How do i read the following file which has columns of data ...	reading file and accessing in haskell (functional programming language) reading file and accessing in haskell (functional programming language) haskell reading file and accessing in haskell (functional programming language) How do i read the following file which has columns of data with header and space or tab delimite...	[ 0.027099609375, -0.0223388671875, -0.007537841796875, 0.030029296875, 0.004730224609375, -0.002166748046875, 0.00250244140625, 0.01531982421875, 0.007537841796875, 0.0108642578125, 0.0103759765625, -0.01312255859375, -0.011474609375, -0.0380859375, -0.0247802734375, -0.0081787109375, ...	[ 16454, 11435, 136, 17203, 1556, 142508, 137175, 56037, 46876, 23, 11249, 17, 12301, 25632, 3365, 316, 2053, 678, 10336, 56, 32628, 707, 20928, 8, 93343, 20625, 16193, 831, 12638, 12830, 107730, 27781, 903, 201, 390, 361, 50944, 425, 209462,...	[ 0.2216796875, 0.20166015625, 0.055145263671875, 0.168212890625, 0.1590576171875, 0.24365234375, 0.07037353515625, 0.0272216796875, 0.048004150390625, 0.0155792236328125, 0.0201263427734375, 0.06451416015625, 0.224853515625, 0.1129150390625, 0.09869384765625, 0.102294921875, 0.1275634...	embed
22728974_c1	22728974	haskell	1	to Haskell : Haskell also incorporates polymorphic types---types that are universally quantified in some way over all types. Polymorphic type expressions essentially describe families of types. For example, (forall a)[a] is the family of types consisting of, for every type a, the type of lists of a. Lists of integers ...	to Haskell : Haskell also incorporates polymorphic types---types that are universally quantified in some way over all types. Polymorphic type expressions essentially describe families of types. For example, (forall a)[a] is the family of types consisting of, for every type a, the type of lists of a. Lists of integers ...	[ 0.0034027099609375, 0.00677490234375, 0.015869140625, 0.004547119140625, -0.00860595703125, 0.00958251953125, 0.0260009765625, -0.006927490234375, 0.01708984375, 0.002166748046875, 0.01263427734375, -0.059814453125, 0.01446533203125, 0.016845703125, -0.032958984375, -0.013427734375, ...	[ 47, 20625, 142508, 152, 2843, 49504, 1636, 35874, 178851, 1771, 52895, 55479, 50986, 7, 621, 32813, 538, 55230, 47314, 3060, 3917, 645, 756, 63306, 10644, 125195, 85590, 98363, 87143, 27781, 2472, 5584, 10, 1065, 11, 83, 14449, 111, 58055, ...	[ 0.19189453125, 0.2080078125, 0.306396484375, 0.01763916015625, 0.0831298828125, 0.16650390625, 0.0723876953125, 0.2064208984375, 0.2471923828125, 0.0938720703125, 0.264892578125, 0.052459716796875, 0.2398681640625, 0.07757568359375, 0.001617431640625, 0.128173828125, 0.05450439453125...	embed
69605531_c0	69605531	haskell	0	Title: Returning number of occurences with condition from list in Haskell Problem title: Returning number of occurences with condition from list in Haskell Tags: haskell Problem: Returning number of occurences with condition from list in Haskell I want to filter number from list by condition that they have to be less t...	Returning number of occurences with condition from list in Haskell Returning number of occurences with condition from list in Haskell haskell list Returning Haskell Num Ord Returning number of occurences with condition from list in Haskell I want to filter number from list by condition that they have to be less than 3 ...	[ -0.01190185546875, 0.01904296875, -0.014404296875, -0.0024261474609375, 0.0289306640625, 0.0031890869140625, 0.021240234375, -0.00640869140625, 0.02490234375, -0.0024871826171875, -0.01080322265625, -0.022705078125, 0.021484375, 0.02685546875, -0.005462646484375, -0.01080322265625, 0...	[ 173340, 214, 14012, 74918, 69098, 678, 35431, 1295, 5303, 20625, 142508, 23, 1556, 52782, 35379, 3444, 46312, 390, 765, 40715, 3501, 138, 3642, 80854, 1884, 903, 72134, 37842, 104711, 16093, 8439, 10, 2203, 140909, 22027, 18, 4488, 26366 ]	[ 0.167724609375, 0.015289306640625, 0.180908203125, 0.2042236328125, 0.143310546875, 0.1334228515625, 0.253662109375, 0.133544921875, 0.1737060546875, 0.1658935546875, 0.219482421875, 0.0291748046875, 0.152099609375, 0.1563720703125, 0.2137451171875, 0.06939697265625, 0.1990966796875,...	embed
51635483_c2	51635483	haskell	2	_inputs, PortName, CLK_32MHZ, RESET, t_output, LED, Clock, System, Source, Asynchronous, Signal, Bit, HiddenClockReset, Word32, LIBRARY, USE, ieee.std_logic_1164.ALL, ENTITY, END, ARCHITECTURE, COMPONENT, PORT, std_logic, OUT, CLK_32MHZ_period, BEGIN, MAP, CLK_32MHZ_process, Automatically, VHDL-93, IEEE, IEEE.NUMERIC_S...	_inputs, PortName, CLK_32MHZ, RESET, t_output, LED, Clock, System, Source, Asynchronous, Signal, Bit, HiddenClockReset, Word32, LIBRARY, USE, ieee.std_logic_1164.ALL, ENTITY, END, ARCHITECTURE, COMPONENT, PORT, std_logic, OUT, CLK_32MHZ_period, BEGIN, MAP, CLK_32MHZ_process, Automatically, VHDL-93, IEEE, IEEE.NUMERIC_S...	[ 0.00714111328125, -0.002716064453125, -0.011962890625, -0.00176239013671875, -0.000640869140625, -0.00958251953125, -0.0096435546875, 0.000133514404296875, 0.0230712890625, -0.01361083984375, -0.00885009765625, -0.00116729736328125, -0.00070953369140625, 0.025390625, -0.00156402587890625...	[ 101, 73, 7077, 7, 4, 13791, 163612, 313, 43238, 6460, 594, 194718, 9069, 54080, 808, 454, 6056, 8908, 21135, 12353, 77641, 12654, 101966, 10821, 144000, 27774, 72483, 555, 4332, 3509, 22543, 16970, 53176, 34388, 78441, 17, 7039, 271, 71, ...	[ 0.1021728515625, 0.140380859375, 0.2413330078125, 0.05181884765625, 0.0634765625, 0.192138671875, 0.154296875, 0.04852294921875, 0.16845703125, 0.238037109375, 0.0246429443359375, 0.1900634765625, 0.11474609375, 0.21044921875, 0.0867919921875, 0.005218505859375, 0.1461181640625, 0....	embed
27704571_c0	27704571	haskell	0	Title: Not in scope: `HashMap.lookup' Problem title: Not in scope: `HashMap.lookup' Tags: json, haskell, hashmap Problem: Not in scope: `HashMap.lookup' I am having trouble with HashMap.lookup function. Please give your advise on how to fix following code (I am getting Not in scope: `HashMap.lookup' error): i...	Not in scope: `HashMap.lookup' Not in scope: `HashMap.lookup' json haskell hashmap Not HashMap.lookup JSON.FromJSON Document JSON.Object JSON Not in scope: `HashMap.lookup' I am having trouble with HashMap.lookup function. Please give your advise on how to fix following code (I am getting Not in scope: `HashM...	[ -0.015869140625, 0.00823974609375, -0.016357421875, 0.0086669921875, 0.0087890625, -0.0103759765625, 0.0098876953125, 0.00946044921875, -0.0166015625, -0.0027923583984375, -0.003875732421875, 0.0036468505859375, -0.01287841796875, 0.002471923828125, 0.0263671875, -0.007781982421875, ...	[ 11205, 23, 70820, 6495, 1495, 166179, 64747, 2037, 3768, 1647, 1681, 1556, 142508, 256, 80425, 254, 162087, 821, 58627, 168407, 1375, 43101, 46471, 75161, 63134, 5, 32354, 115992, 30022, 25632, 18151, 18499 ]	[ 0.2130126953125, 0.1898193359375, 0.2403564453125, 0.1724853515625, 0.1298828125, 0.2362060546875, 0.15234375, 0.1405029296875, 0.0775146484375, 0.05682373046875, 0.123046875, 0.1180419921875, 0.177490234375, 0.1064453125, 0.1085205078125, 0.10498046875, 0.180419921875, 0.054412841...	embed
28552092_c0	28552092	haskell	0	Title: Haskell: Function multiplying elements of list using high order functions Problem title: Haskell: Function multiplying elements of list using high order functions Tags: haskell Problem: Haskell: Function multiplying elements of list using high order functions I am new to Haskell so I'm trying to understand high ...	Haskell: Function multiplying elements of list using high order functions Haskell: Function multiplying elements of list using high order functions haskell high Haskell Haskell: Function multiplying elements of list using high order functions I am new to Haskell so I'm trying to understand high order functions and how ...	[ -0.0189208984375, 0.00738525390625, 0.0036163330078125, -0.01251220703125, -0.0003871917724609375, 0.023193359375, -0.009521484375, -0.00909423828125, -0.005340576171875, -0.040283203125, 0.0029449462890625, -0.015380859375, -0.0152587890625, 0.0012054443359375, -0.0238037109375, -0.01...	[ 20625, 142508, 28670, 10763, 6024, 62479, 214, 80854, 5303, 17368, 11192, 12989, 32354, 111, 1556, 7, 3525, 47, 31577, 28219, 4488, 22288, 46312, 18344, 7569, 20469, 418, 39933, 23972, 36663, 4034, 118126, 90, 23, 201505, 30646, 615, 765, 2...	[ 0.1192626953125, 0.23828125, 0.127685546875, 0.059814453125, 0.12451171875, 0.1707763671875, 0.022552490234375, 0.150390625, 0.1749267578125, 0.042724609375, 0.118408203125, 0.218505859375, 0.190185546875, 0.01361083984375, 0.11083984375, 0.02093505859375, 0.05804443359375, 0.01016...	embed
71902508_c0	71902508	haskell	0	Title: What is the equivalent function of fileChooserDialogNew with gi-gtk Problem title: What is the equivalent function of fileChooserDialogNew with gi-gtk Tags: gtk2hs, gtk3, haskell, gtk Problem: What is the equivalent function of fileChooserDialogNew with gi-gtk I'm making a GTK interface with gi-gtk for a Haskell...	What is the equivalent function of fileChooserDialogNew with gi-gtk What is the equivalent function of fileChooserDialogNew with gi-gtk gtk2hs gtk3 haskell gtk What gtk2hs gtk3 What is the equivalent function of fileChooserDialogNew with gi-gtk I'm making a GTK interface with gi-gtk for a Haskell program and I would li...	[ -0.010009765625, 0.006195068359375, -0.00927734375, 0.012451171875, -0.002899169921875, 0.00836181640625, 0.0016021728515625, -0.00186920166015625, 0.00787353515625, -0.034423828125, 0.00872802734375, -0.0654296875, -0.003265380859375, -0.009521484375, -0.0091552734375, 0.0007553100585...	[ 4865, 183234, 32354, 11435, 107522, 232, 56, 72838, 4867, 46568, 678, 3016, 5386, 92, 83, 70, 706, 31472, 304, 127, 363, 1556, 142508, 7, 9, 20662, 527, 29735, 101758, 20625, 1528, 1884, 28282, 26519, 47, 40, 343, 100, 102158, 105233, 9...	[ 0.041900634765625, 0.1788330078125, 0.1744384765625, 0.1513671875, 0.06817626953125, 0.108154296875, 0.0877685546875, 0.0706787109375, 0.10308837890625, 0.1888427734375, 0.1016845703125, 0.1954345703125, 0.144775390625, 0.15478515625, 0.0054931640625, 0.00665283203125, 0.048614501953...	embed
69578020_c0	69578020	haskell	0	Title: Why is there a quotation mark on the operators like 'mod'? Problem title: Why is there a quotation mark on the operators like 'mod'? Tags: haskell Problem: Why is there a quotation mark on the operators like 'mod'? I am new to Haskell and I probably have some really dumb questions (so sorry a...	Why is there a quotation mark on the operators like 'mod'? Why is there a quotation mark on the operators like 'mod'? haskell Why Why is there a quotation mark on the operators like 'mod'? I am new to Haskell and I probably have some really dumb questions (so sorry about that). I was reading some tu...	[ 0.0091552734375, 0.0155029296875, 0.015869140625, -0.01202392578125, 0.013671875, 0.00408935546875, 0.0107421875, 0.01068115234375, 0.01324462890625, 0.00238037109375, -0.009765625, -0.044921875, 0.0189208984375, -0.005126953125, -0.01953125, 0.0074462890625, -0.01556396484375, 0.0...	[ 44084, 83, 2685, 81732, 1363, 16188, 98, 39933, 7, 1884, 3768, 13415, 10, 54764, 1556, 142508, 3525, 47, 20625, 6492, 59090, 57143, 44177, 125195, 903, 3714, 2811, 136, 88, 195, 26950, 15400, 765, 2856 ]	[ 0.1473388671875, 0.06683349609375, 0.103515625, 0.2105712890625, 0.1134033203125, 0.177734375, 0.056243896484375, 0.2225341796875, 0.048126220703125, 0.06732177734375, 0.127685546875, 0.2318115234375, 0.0631103515625, 0.0188446044921875, 0.1414794921875, 0.2666015625, 0.0206146240234...	embed
57246616_c0	57246616	haskell	0	Title: What kinds of recursions are used in the definitions of `foldr` and `foldl`? Problem title: What kinds of recursions are used in the definitions of `foldr` and `foldl`? Tags: fold, haskell, recursion Problem: What kinds of recursions are used in the definitions of `foldr` and `foldl`? foldr :: (a -> b -> b) -> b...	What kinds of recursions are used in the definitions of `foldr` and `foldl`? What kinds of recursions are used in the definitions of `foldr` and `foldl`? fold haskell recursion What x:xs What kinds of recursions are used in the definitions of `foldr` and `foldl`? and seem to use different kinds of recursions. What kind...	[ -0.0213623046875, -0.0096435546875, 0.00445556640625, -0.0036468505859375, -0.01239013671875, 0.00494384765625, -0.01190185546875, -0.000843048095703125, 0.0098876953125, 0.00830078125, 0.00775146484375, -0.0322265625, -0.0086669921875, 0.01422119140625, 0.01409912109375, -0.0007591247...	[ 8562, 195625, 17514, 11814, 80934, 42822, 42, 136, 141, 1556, 142508, 1830, 4865, 1022, 12, 425, 111, 48903, 4527, 12921, 18344, 7569, 20469 ]	[ 0.12939453125, 0.20751953125, 0.135009765625, 0.084228515625, 0.1077880859375, 0.169677734375, 0.1793212890625, 0.07391357421875, 0.152099609375, 0.0867919921875, 0.1812744140625, 0.051544189453125, 0.01263427734375, 0.042205810546875, 0.014007568359375, 0.05084228515625, 0.006286621...	embed
61739508_c0	61739508	haskell	0	Title: Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) Problem title: Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) Tags: haskell, dhall Problem: Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) What is the best way to encode the Haskell type Map ([Text], [Text]) Text in dhall? Attempt. It seem...	Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) haskell dhall Encoding Map Text Haskell config.dhall List Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) What is the best way to encode the Haskell type Map ([Text], [Text]) Text in dhall? Attempt. I...	[ 0.018798828125, -0.0208740234375, 0.00122833251953125, 0.0036773681640625, -0.03173828125, -0.006011962890625, 0.0008392333984375, -0.0013275146484375, -0.01092529296875, -0.004791259765625, -0.023681640625, 0.016357421875, 0.01519775390625, 0.01348876953125, -0.00061798095703125, -0.0...	[ 357, 587, 6238, 166179, 174379, 24129, 23, 104, 29907, 6495, 7, 142508, 1556, 42719, 20625, 153837, 71, 32036, 2965, 3917, 22, 40899, 10644, 34224, 1650, 831, 18, 4527, 47, 903, 3871, 77758, 22288 ]	[ 0.094970703125, 0.207763671875, 0.058319091796875, 0.24267578125, 0.203857421875, 0.2340087890625, 0.0775146484375, 0.098876953125, 0.2330322265625, 0.1068115234375, 0.07781982421875, 0.2298583984375, 0.1094970703125, 0.234619140625, 0.1324462890625, 0.1226806640625, 0.05181884765625...	embed
12273315_c0	12273315	haskell	0	Title: How to recompile Haskell with cabal build showing only warnings Problem title: How to recompile Haskell with cabal build showing only warnings Tags: haskell, cabal Problem: How to recompile Haskell with cabal build showing only warnings When I cabal build my projects, warnings (especially with -Wall ) are only s...	How to recompile Haskell with cabal build showing only warnings How to recompile Haskell with cabal build showing only warnings haskell cabal How Haskell Wall How to recompile Haskell with cabal build showing only warnings When I cabal build my projects, warnings (especially with -Wall ) are only shown the first time. ...	[ -0.00946044921875, 0.00115203857421875, 0.01043701171875, -0.00225830078125, 0.002716064453125, 0.00762939453125, -0.0242919921875, 0.007171630859375, 0.0026702880859375, 0.00982666015625, -0.00714111328125, -0.0294189453125, 0.0031585693359375, 0.01116943359375, 0.00167083740234375, 0...	[ 11249, 456, 58875, 1340, 20625, 142508, 678, 109524, 45367, 141377, 4734, 1631, 6977, 47, 1556, 23706, 77635, 20, 198076, 127887, 5117, 1733, 221419, 26818, 82365, 3444, 1957, 756, 13452, 13438, 46622, 9486, 109585, 420, 50930, 107, 51776, 57...	[ 0.035308837890625, 0.1561279296875, 0.156494140625, 0.1513671875, 0.1654052734375, 0.2437744140625, 0.03350830078125, 0.2261962890625, 0.147216796875, 0.06805419921875, 0.09613037109375, 0.168701171875, 0.1409912109375, 0.00006103515625, 0.142333984375, 0.1695556640625, 0.10388183593...	embed
34725315_c0	34725315	haskell	0	Title: Pure function with haskell and database access Problem title: Pure function with haskell and database access Tags: haskell, functional-programming Problem: Pure function with haskell and database access How can it be possible to tell that a function is pure : statelessness : given the same parameters, the result...	Pure function with haskell and database access Pure function with haskell and database access haskell functional-programming Pure Pure function with haskell and database access How can it be possible to tell that a function is pure : statelessness : given the same parameters, the result is stricly the same (1+2 = 3) im...	[ -0.0034637451171875, 0.0021514892578125, -0.00457763671875, -0.006256103515625, 0.005615234375, 0.0277099609375, -0.00714111328125, -0.007232666015625, 0.007171630859375, -0.03759765625, 0.019287109375, -0.0137939453125, -0.0205078125, 0.00640869140625, -0.006195068359375, -0.001823425...	[ 118233, 32354, 678, 1556, 142508, 136, 63399, 17203, 123309, 28966, 7722, 47, 14192, 83, 34166, 11341, 9393, 7432, 5701, 171859, 16750, 210422, 538, 2858, 54651, 8439, 566, 14311, 41159, 34292, 18, 15549, 1733, 2053, 43701, 2046, 43512, 97351...	[ 0.26318359375, 0.218017578125, 0.0955810546875, 0.1380615234375, 0.220703125, 0.05950927734375, 0.1138916015625, 0.159912109375, 0.16162109375, 0.09619140625, 0.046478271484375, 0.001129150390625, 0.1396484375, 0.08251953125, 0.27294921875, 0.158447265625, 0.168212890625, 0.0831298...	embed
36464907_c0	36464907	haskell	0	Title: haskell list to list pattern matching Problem title: haskell list to list pattern matching Tags: haskell Problem: haskell list to list pattern matching Here's my code: newcell :: [Cell] -> [Cell] newcell [Cell {cellPosition = cp, cellState = cs}] = [Cell {cellPosition = cp, cellState = (nextCellState cs)}] nextC...	haskell list to list pattern matching haskell list to list pattern matching haskell Cell StudentSources LangtonsAnt.hs:141:1 Warning Pattern Patterns haskell list to list pattern matching Here's my code: nextCellState is just a function, but it says could not match the pattern.	[ -0.036865234375, -0.0034027099609375, 0.0074462890625, 0.0306396484375, 0.009033203125, 0.00142669677734375, -0.0234375, 0.002655029296875, 0.01007080078125, 0.004852294921875, -0.00109100341796875, 0.0084228515625, 0.0123291015625, -0.00665283203125, -0.00811767578125, -0.01220703125,...	[ 1556, 142508, 5303, 47, 103510, 14858, 214, 80743, 26696, 211235, 15786, 67772, 78931, 127, 7, 146893, 19721, 5550, 592, 9876, 22766, 18151, 11737, 441, 6796, 135206, 13, 1660, 32354, 1284, 17378, 5809, 959 ]	[ 0.1676025390625, 0.2274169921875, 0.2159423828125, 0.115234375, 0.2169189453125, 0.22998046875, 0.01348876953125, 0.190673828125, 0.1116943359375, 0.084228515625, 0.08489990234375, 0.1015625, 0.06280517578125, 0.06829833984375, 0.004474639892578125, 0.08184814453125, 0.02189636230468...	embed
38349273_c0	38349273	haskell	0	Title: Where does GHC allocate foreign memory and how does the garbage collector treat it? Problem title: Where does GHC allocate foreign memory and how does the garbage collector treat it? Tags: ghc, garbage-collection, haskell, memory-management Problem: Where does GHC allocate foreign memory and how does the garbage...	Where does GHC allocate foreign memory and how does the garbage collector treat it? Where does GHC allocate foreign memory and how does the garbage collector treat it? ghc garbage-collection haskell memory-management Where GHC Foreign.Marshal.Alloc Foreign.ForeignPtr Where does GHC allocate foreign memory and how does ...	[ 0.03564453125, 0.03955078125, -0.0074462890625, 0.001983642578125, -0.0152587890625, 0.00860595703125, -0.0081787109375, 0.01202392578125, 0.000736236572265625, 0.005035400390625, 0.022705078125, -0.027099609375, 0.0208740234375, 0.023681640625, -0.0037384033203125, -0.007171630859375,...	[ 78662, 527, 73265, 24286, 33478, 110613, 98323, 3642, 3671, 402, 429, 43799, 748, 85689, 442, 31380, 238, 196352, 1556, 142508, 87140, 184293, 16305, 4200, 43512, 6652, 18537, 38529, 683, 4448, 14602, 32354, 408, 136, 960, 55043, 1295, 3525, ...	[ 0.1427001953125, 0.12158203125, 0.2491455078125, 0.18896484375, 0.127197265625, 0.2398681640625, 0.252685546875, 0.0634765625, 0.08062744140625, 0.167724609375, 0.1025390625, 0.1524658203125, 0.1202392578125, 0.148681640625, 0.051605224609375, 0.10516357421875, 0.1273193359375, 0.1...	embed
75362080_c0	75362080	haskell	0	Title: Take k smallest numbers from a list time complixity in Haskell Problem title: Take k smallest numbers from a list time complixity in Haskell Tags: haskell, algorithm, time-complexity Problem: Take k smallest numbers from a list time complixity in Haskell Is the time complexity of the next Haskell programm n * lo...	Take k smallest numbers from a list time complixity in Haskell Take k smallest numbers from a list time complixity in Haskell haskell algorithm time-complexity a Data.List Take Haskell Take k smallest numbers from a list time complixity in Haskell Is the time complexity of the next Haskell programm n * log(n) or n * lo...	[ 0.0037078857421875, 0.01513671875, 0.02001953125, -0.0286865234375, 0.00469970703125, 0.0146484375, 0.00087738037109375, -0.0146484375, -0.0007781982421875, -0.0257568359375, 0.0211181640625, 0.00714111328125, -0.0135498046875, 0.035888671875, -0.0185546875, 0.0076904296875, 0.012329...	[ 46673, 472, 19336, 525, 101935, 1295, 5303, 1733, 9969, 68904, 2481, 20625, 142508, 1556, 234873, 277, 44974, 11809, 154663, 2071, 27140, 11737, 28966, 653, 661, 12684, 132, 19, 707, 92, 3642, 69307, 83, 140909, 107730, 14012, 5117, 80854, ...	[ 0.1434326171875, 0.177001953125, 0.1552734375, 0.150634765625, 0.1470947265625, 0.041107177734375, 0.1689453125, 0.1861572265625, 0.1180419921875, 0.1455078125, 0.1243896484375, 0.1636962890625, 0.252197265625, 0.13037109375, 0.171630859375, 0.1072998046875, 0.1854248046875, 0.0661...	embed
75579152_c1	75579152	haskell	1	: is this the only way to achieve what I want (Using GADTs/Families)? what I don't like there, that I need to introduce additional boilerplate tags for Input/Output values, is it possible to make it less boilerplaty way? My second question: is a more advanced logic of mapping possible? Say I want the input to be mapped...	: is this the only way to achieve what I want (Using GADTs/Families)? what I don't like there, that I need to introduce additional boilerplate tags for Input/Output values, is it possible to make it less boilerplaty way? My second question: is a more advanced logic of mapping possible? Say I want the input to be mapped...	[ -0.0157470703125, 0.0028076171875, -0.0157470703125, -0.006439208984375, -0.0196533203125, -0.00640869140625, -0.005340576171875, -0.0030670166015625, 0.0157470703125, 0.01214599609375, -0.004791259765625, -0.031494140625, 0.00628662109375, 0.005340576171875, -0.00958251953125, 0.00003...	[ 83, 903, 4734, 3917, 69307, 2367, 3444, 1062, 23749, 41072, 7, 919, 1191, 25720, 2301, 18, 1884, 65508, 78301, 337, 34759, 92558, 69141, 360, 7077, 79858, 142424, 7722, 40715, 9189, 17932, 9655, 1286, 175961, 62775, 111, 291, 26783, 107730,...	[ 0.010955810546875, 0.0849609375, 0.03643798828125, 0.043914794921875, 0.1343994140625, 0.041717529296875, 0.1175537109375, 0.008575439453125, 0.101318359375, 0.1507568359375, 0.03363037109375, 0.03204345703125, 0.0911865234375, 0.1009521484375, 0.04833984375, 0.0582275390625, 0.13037...	embed
44773452_c0	44773452	haskell	0	Title: confused about dot-operator in haskell Problem title: confused about dot-operator in haskell Tags: haskell Problem: confused about dot-operator in haskell (head.group) "1234" It work. head.group "1234" I get errors: <interactive>:8:6: Couldn't match expected type `a0 -> [c0]' with actual type `[[Char]]' In the r...	confused about dot-operator in haskell confused about dot-operator in haskell haskell head.group Couldn Char Probable confused about dot-operator in haskell It work. I get errors: I think (head.group) is same as head.group, why (head.group) work and head.group not.	[ 0.01611328125, -0.002197265625, -0.004241943359375, 0.011474609375, 0.00372314453125, 0.00921630859375, -0.01153564453125, 0.00830078125, 0.0052490234375, -0.0267333984375, -0.0118408203125, 0.006866455078125, 0.00994873046875, -0.0018310546875, -0.0311279296875, -0.036865234375, 0.0...	[ 55681, 5281, 1672, 20633, 206469, 1556, 142508, 9, 23, 10336, 51588, 191147, 21656, 275, 2886, 4488, 18499, 5351, 31251, 5, 83, 5701, 15400, 136, 959 ]	[ 0.14599609375, 0.08978271484375, 0.042144775390625, 0.2069091796875, 0.24609375, 0.1552734375, 0.2381591796875, 0.018218994140625, 0.0196990966796875, 0.213623046875, 0.202880859375, 0.089599609375, 0.146728515625, 0.055816650390625, 0.0056610107421875, 0.1536865234375, 0.15979003906...	embed
64892274_c1	64892274	haskell	1	* In the expression: sort (((d p x), x) : ys) In an equation for `create': create d p (x : xs) ys \| length xs == 0 = sort (((d p x), x) : ys) \| otherwise = create d p xs (((d p x), x) : ys) I used type Point a = (Int, Int) at first and it was working fine but in the specification it is required that Point is type Poin...	* In the expression: sort (((d p x), x) : ys) In an equation for `create': create d p (x : xs) ys \| length xs == 0 = sort (((d p x), x) : ys) \| otherwise = create d p xs (((d p x), x) : ys) I used type Point a = (Int, Int) at first and it was working fine but in the specification it is required that Point is type Poin...	[ 0.0177001953125, 0.00726318359375, -0.00006914138793945312, -0.00811767578125, -0.00011730194091796875, -0.0106201171875, -0.00970458984375, -0.01361083984375, 0.02392578125, -0.01019287109375, -0.00872802734375, 0.0107421875, -0.00092315673828125, -0.0205078125, -0.01092529296875, 0.0...	[ 125195, 12096, 71, 915, 1022, 152, 113, 7, 28, 5490, 2320, 7612, 2182, 28282, 104, 425, 140909, 69112, 757, 120262, 11814, 10644, 41097, 10, 2203, 4153, 18, 360, 5117, 20697, 5885, 29458, 56065, 83, 11, 18499, 2967, 53418, 15549, 32354, ...	[ 0.1959228515625, 0.247802734375, 0.0865478515625, 0.11572265625, 0.1005859375, 0.022247314453125, 0.1422119140625, 0.11279296875, 0.012542724609375, 0.1610107421875, 0.001617431640625, 0.1307373046875, 0.10296630859375, 0.1661376953125, 0.11767578125, 0.0511474609375, 0.1468505859375...	embed
65874681_c0	65874681	haskell	0	Title: How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell Problem title: How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell Tags: haskell, lambda-calculus Problem: How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell I have given a task to make the Integer...	How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell haskell lambda-calculus How Integer-List Generator Lambda Calculus Haskell How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell I have given a task to mak...	[ 0.0040283203125, -0.0098876953125, 0.0130615234375, 0.00193023681640625, 0.0185546875, -0.00421142578125, 0.016845703125, -0.01409912109375, 0.00150299072265625, -0.042724609375, -0.00177001953125, -0.02392578125, 0.01202392578125, -0.000354766845703125, 0.00872802734375, -0.0162353515...	[ 11249, 15504, 44401, 154663, 222518, 39, 153, 23, 122930, 85, 212467, 223, 20625, 142508, 47, 9, 1556, 21, 6492, 6827, 94739, 34475, 66211, 3249, 75606, 44805, 5608, 4393, 116115, 80934, 990, 563, 347, 246242, 1723, 22183, 4879, 44841, 3714...	[ 0.061431884765625, 0.1531982421875, 0.220947265625, 0.214111328125, 0.261962890625, 0.1781005859375, 0.109619140625, 0.034515380859375, 0.1982421875, 0.15478515625, 0.177490234375, 0.105712890625, 0.150390625, 0.2431640625, 0.0216522216796875, 0.048492431640625, 0.1136474609375, 0....	embed
58855451_c0	58855451	haskell	0	Title: Generating .cabal file dependency versions Problem title: Generating .cabal file dependency versions Tags: haskell-stack, haskell, cabal Problem: Generating .cabal file dependency versions I use Stack to build on my local machine, but Homebrew uses Cabal. This means that sometimes a build will work fine for me, ...	Generating .cabal file dependency versions Generating .cabal file dependency versions haskell-stack haskell cabal Generating package.yaml Generating .cabal file dependency versions I use Stack to build on my local machine, but Homebrew uses Cabal. This means that sometimes a build will work fine for me, but then not wo...	[ 0.0235595703125, 0.00701904296875, 0.001495361328125, -0.00628662109375, -0.005462646484375, 0.003662109375, 0.0045166015625, 0.01397705078125, -0.0098876953125, -0.00250244140625, -0.0218505859375, -0.0220947265625, 0.00775146484375, 0.01239013671875, 0.003692626953125, 0.006805419921...	[ 155370, 1916, 5, 408, 3571, 11435, 42548, 27771, 11389, 1556, 142508, 590, 2594, 109524, 98169, 14520, 141, 4527, 6512, 45367, 4000, 36279, 2005, 143006, 30438, 289, 68018, 4488, 5885, 959, 42850, 58061, 3917, 139392, 191082, 35509, 43581, 17...	[ 0.1478271484375, 0.013519287109375, 0.0232696533203125, 0.1634521484375, 0.245849609375, 0.1187744140625, 0.1925048828125, 0.083984375, 0.153076171875, 0.0911865234375, 0.178955078125, 0.0799560546875, 0.1644287109375, 0.231201171875, 0.1707763671875, 0.1669921875, 0.1614990234375, ...	embed
10903940_c0	10903940	haskell	0	Title: Haskell FFI - How to handle C functions that accept or return structs instead of pointers to structs? Problem title: Haskell FFI - How to handle C functions that accept or return structs instead of pointers to structs? Tags: c, ffi, haskell Problem: Haskell FFI - How to handle C functions that accept or return s...	Haskell FFI - How to handle C functions that accept or return structs instead of pointers to structs? Haskell FFI - How to handle C functions that accept or return structs instead of pointers to structs? c ffi haskell Haskell FFI How Haskell FFI - How to handle C functions that accept or return structs instead of point...	[ 0.01348876953125, 0.0245361328125, -0.01104736328125, -0.00738525390625, -0.008544921875, -0.00193023681640625, 0.00872802734375, -0.007476806640625, 0.00543212890625, -0.02099609375, 0.0101318359375, -0.01446533203125, 0.006195068359375, 0.013916015625, 0.007720947265625, 0.005859375,...	[ 20625, 142508, 563, 22724, 11249, 34831, 313, 32354, 26946, 707, 30646, 36716, 64457, 6275, 1314, 47, 7, 450, 501, 24500, 1556, 35166, 209303, 27875, 78219, 22832, 12282, 46389, 98323, 3642, 71864, 31089, 32562, 137565, 1264, 5609, 192, 29806...	[ 0.1329345703125, 0.2271728515625, 0.09393310546875, 0.25146484375, 0.0628662109375, 0.17236328125, 0.1890869140625, 0.23779296875, 0.165771484375, 0.0980224609375, 0.1494140625, 0.222900390625, 0.176513671875, 0.193603515625, 0.1151123046875, 0.0546875, 0.005126953125, 0.0500183105...	embed
1415309_c0	1415309	haskell	0	Title: Problem using Network package in GHC Problem title: Problem using Network package in GHC Tags: ghc, haskell Problem: Problem using Network package in GHC I have this simple code: import Network main = return () executing it with runhaskell fails: >runhaskell test.hs test.hs: C:\ghc\ghc-6.10.4\network-2.2.1.2\HSn...	Problem using Network package in GHC Problem using Network package in GHC ghc haskell Network Problem GHC test.hs ghc-6.10.4 network-2.2.1.2 HSnetwork-2.2.1.2.o _getnameinfo Problem using Network package in GHC I have this simple code: executing it with runhaskell fails: GHCi also gives simillar error message. What can...	[ 0.007354736328125, 0.005462646484375, 0.0159912109375, 0.031494140625, 0.006439208984375, 0.01324462890625, -0.0135498046875, 0.00390625, -0.024169921875, -0.032958984375, 0.00653076171875, -0.032470703125, 0.0023193359375, -0.006317138671875, -0.01446533203125, 0.01495361328125, 0.0...	[ 15649, 17368, 28997, 98169, 23, 527, 73265, 31380, 238, 1556, 142508, 3034, 127, 7, 13545, 10179, 617, 33120, 70147, 48400, 39718, 1179, 18244, 31, 3794, 11627, 7319, 8781, 18151, 71924, 678, 11675, 10557, 35782, 14, 2843, 76199, 78, 61716,...	[ 0.123779296875, 0.1221923828125, 0.208251953125, 0.2142333984375, 0.05609130859375, 0.11767578125, 0.2392578125, 0.12890625, 0.1453857421875, 0.1346435546875, 0.2459716796875, 0.14990234375, 0.0697021484375, 0.035369873046875, 0.043243408203125, 0.10693359375, 0.072509765625, 0.147...	embed
16145721_c0	16145721	haskell	0	Title: Installing Haskell Platform overrides gcc location in system PATH Problem title: Installing Haskell Platform overrides gcc location in system PATH Tags: mingw, path, environment-variables, haskell Problem: Installing Haskell Platform overrides gcc location in system PATH I am running the latest version of MinGW ...	Installing Haskell Platform overrides gcc location in system PATH Installing Haskell Platform overrides gcc location in system PATH mingw path environment-variables haskell Installing Haskell Platform PATH Installing Haskell Platform overrides gcc location in system PATH I am running the latest version of MinGW GCC 4.7...	[ 0.0096435546875, 0.006134033203125, 0.0133056640625, 0.0028839111328125, -0.0034027099609375, -0.010498046875, -0.010009765625, -0.010009765625, -0.01409912109375, 0.009521484375, 0.003997802734375, -0.01416015625, -0.0086669921875, -0.005859375, 0.0230712890625, 0.0087890625, -0.009...	[ 107951, 20625, 142508, 70968, 645, 416, 988, 22109, 238, 31913, 23, 5426, 436, 139909, 46996, 434, 60875, 65998, 21690, 1556, 51042, 42850, 11389, 4211, 102550, 527, 13709, 1398, 179642, 20697, 5885, 678, 271, 1369, 37223, 1662, 8108, 20600, ...	[ 0.167724609375, 0.1812744140625, 0.28662109375, 0.234130859375, 0.12744140625, 0.189208984375, 0.02581787109375, 0.184814453125, 0.148193359375, 0.21142578125, 0.05889892578125, 0.1212158203125, 0.1011962890625, 0.1944580078125, 0.10491943359375, 0.1502685546875, 0.18603515625, 0.0...	embed
23386451_c0	23386451	haskell	0	Title: Recursive Function on a List in Haskell Problem title: Recursive Function on a List in Haskell Tags: haskell, recursion, list Problem: Recursive Function on a List in Haskell I want to get the max and min value out of a List as a tuple by using recursion. I tried it with this code below and cant really figure ou...	Recursive Function on a List in Haskell Recursive Function on a List in Haskell haskell recursion list Recursive List Haskell Double x:rest Recursive Function on a List in Haskell I want to get the max and min value out of a List as a tuple by using recursion. I tried it with this code below and cant really figure out ...	[ -0.0135498046875, 0.004638671875, 0.016845703125, 0.00653076171875, 0.01092529296875, 0.0225830078125, -0.00714111328125, 0.0054931640625, 0.022705078125, -0.0019989013671875, 0.002197265625, -0.01202392578125, -0.00116729736328125, 0.0185546875, 0.021728515625, -0.0030975341796875, ...	[ 853, 48650, 5844, 28670, 10763, 98, 32036, 20625, 142508, 23, 1556, 195625, 1830, 5303, 107172, 1022, 56644, 3444, 2046, 70, 18389, 136, 881, 34292, 1810, 237, 370, 8705, 17368, 37842, 678, 18151, 35064, 45767, 26366, 15400, 14602, 959, 448...	[ 0.0853271484375, 0.2239990234375, 0.14453125, 0.1402587890625, 0.05078125, 0.08831787109375, 0.203369140625, 0.1304931640625, 0.2095947265625, 0.014923095703125, 0.12255859375, 0.2325439453125, 0.140625, 0.1573486328125, 0.1240234375, 0.111083984375, 0.210205078125, 0.0894165039062...	embed
29031687_c0	29031687	haskell	0	Title: Make monadic functions invocation point free Problem title: Make monadic functions invocation point free Tags: haskell Problem: Make monadic functions invocation point free I have code that compiles: \f st -> f1 >>= \m-> f2 m f st f1 is of type m a and f2 of type a -> b -> c -> m d , in the same Monad m. I can't...	Make monadic functions invocation point free Make monadic functions invocation point free haskell Make Make monadic functions invocation point free I have code that compiles: f1 is of type m a and f2 of type a -> b -> c -> m d , in the same Monad m. I can't for the life of me rewrite this expression pointfree, without ...	[ -0.022216796875, -0.0035552978515625, -0.0027923583984375, -0.0079345703125, 0.005340576171875, -0.00138092041015625, -0.0037689208984375, -0.00074005126953125, 0.0004062652587890625, -0.039794921875, -0.004547119140625, -0.01287841796875, 0.001190185546875, 0.0225830078125, -0.007720947...	[ 26176, 2667, 11, 18403, 32354, 23, 202010, 6275, 4092, 7, 1556, 142508, 18151, 9969, 1340, 1238, 418, 10644, 347, 10, 136, 304, 876, 501, 104, 5701, 60331, 71, 831, 18, 100, 6897, 456, 434, 18781, 125195, 32087, 15490, 75, 110608, 41872...	[ 0.1234130859375, 0.1617431640625, 0.08734130859375, 0.1328125, 0.2064208984375, 0.096435546875, 0.1973876953125, 0.15673828125, 0.1942138671875, 0.015350341796875, 0.1314697265625, 0.22509765625, 0.134033203125, 0.052764892578125, 0.0478515625, 0.099365234375, 0.076904296875, 0.137...	embed
20922071_c0	20922071	haskell	0	Title: Haskell Container class Problem title: Haskell Container class Tags: haskell Problem: Haskell Container class Is there a good standard (or just stable) implementation of (ordered) Container class? Container class should provide basic manipulation operations with it's instance s. Typical instances should be: Arra...	Haskell Container class Haskell Container class haskell Haskell Container Haskell Container class Is there a good standard (or just stable) implementation of (ordered) Container class? Container class should provide basic manipulation operations with it's instance s. Typical instances should be: Array, List, e.t.c. Ope...	[ -0.005401611328125, 0.01171875, -0.0011444091796875, -0.000782012939453125, -0.0079345703125, -0.009521484375, -0.0012054443359375, 0.003173828125, 0.0211181640625, -0.0037841796875, -0.0068359375, -0.0238037109375, 0.000701904296875, -0.01422119140625, -0.027099609375, -0.004821777343...	[ 20625, 142508, 34749, 20037, 18507, 1556, 2071, 2685, 4127, 5570, 748, 1660, 144142, 208124, 80596, 297, 5608, 22691, 62822, 45258, 1363, 41018, 678, 110527, 91, 33417, 186, 69253, 53, 32036, 102203, 621, 5646, 653, 927, 12830, 1295, 116419, ...	[ 0.128173828125, 0.218017578125, 0.20068359375, 0.2060546875, 0.249267578125, 0.1142578125, 0.0174102783203125, 0.0148468017578125, 0.08660888671875, 0.167236328125, 0.01104736328125, 0.014007568359375, 0.1649169921875, 0.172119140625, 0.1680908203125, 0.0889892578125, 0.0870361328125...	embed
44066766_c0	44066766	haskell	0	Title: binary tree in generalized statement Problem title: binary tree in generalized statement Tags: haskell Problem: binary tree in generalized statement I have to implement a Code which accepts a binary tree and shows a generalised Statement: this is my Code mkBTree xs \| (m == 0) = Leaf (unwrap xs) \| otherwise = For...	binary tree in generalized statement binary tree in generalized statement haskell Leaf Fork Data binary tree in generalized statement I have to implement a Code which accepts a binary tree and shows a generalised Statement: this is my Code but the only thing i get is something like: Failed, modules loaded: none. What i...	[ 0.01153564453125, 0.016357421875, -0.01953125, -0.0206298828125, 0.035400390625, 0.0098876953125, -0.02490234375, -0.016357421875, 0.004425048828125, -0.0191650390625, -0.0279541015625, -0.0341796875, 0.00537109375, 0.00000947713851928711, -0.0146484375, 0.019775390625, 0.01647949218...	[ 2394, 6635, 53201, 23, 4537, 29367, 63805, 1556, 142508, 636, 2407, 1326, 92, 11809, 29479, 28864, 26946, 52021, 22836, 674, 903, 83, 759, 4734, 190355, 88996, 72367, 297, 351, 13, 44691 ]	[ 0.183837890625, 0.1234130859375, 0.255126953125, 0.0145721435546875, 0.1346435546875, 0.1112060546875, 0.176513671875, 0.07232666015625, 0.17236328125, 0.0178985595703125, 0.1053466796875, 0.10205078125, 0.06121826171875, 0.09368896484375, 0.123046875, 0.1419677734375, 0.071655273437...	embed
60022571_c0	60022571	haskell	0	Title: how can i append a value to a list inside a tuple in Haskell? Problem title: how can i append a value to a list inside a tuple in Haskell? Tags: list, tuples, haskell Problem: how can i append a value to a list inside a tuple in Haskell? For example, if I have a list of tuples such as [("a1", ["a2", "a3"]), ("b1...	how can i append a value to a list inside a tuple in Haskell? how can i append a value to a list inside a tuple in Haskell? list tuples haskell Haskell how can i append a value to a list inside a tuple in Haskell? For example, if I have a list of tuples such as [("a1", ["a2", "a3"]), ("b1", ["b2", "b3"])] and I want to...	[ 0.0024261474609375, 0.025390625, 0.000865936279296875, 0.005096435546875, -0.00128173828125, 0.003875732421875, -0.0238037109375, 0.00494384765625, 0.018798828125, 0.00567626953125, 0.005645751953125, -0.018798828125, -0.00518798828125, 0.0081787109375, -0.000270843505859375, -0.003646...	[ 3642, 831, 17, 114689, 71, 34292, 47, 5303, 46132, 370, 8705, 23, 20625, 142508, 10, 99726, 1556, 11, 363, 3444, 15190, 617, 17368, 619, 107730, 28350, 140992, 51515, 218500, 117008 ]	[ 0.0804443359375, 0.07958984375, 0.07220458984375, 0.19287109375, 0.1368408203125, 0.2196044921875, 0.1146240234375, 0.208984375, 0.173828125, 0.137451171875, 0.2276611328125, 0.049713134765625, 0.1378173828125, 0.23779296875, 0.057525634765625, 0.2069091796875, 0.0986328125, 0.0335...	embed
11726563_c0	11726563	haskell	0	Title: How can I convert a Haskell String into a Ptr (Ptr GLchar)? Problem title: How can I convert a Haskell String into a Ptr (Ptr GLchar)? Tags: opengl, ffi, haskell Problem: How can I convert a Haskell String into a Ptr (Ptr GLchar)? I wish to call the function glShaderSource :: GLuint -> GLsizei -> GHC.Ptr.Ptr (GH...	How can I convert a Haskell String into a Ptr (Ptr GLchar)? How can I convert a Haskell String into a Ptr (Ptr GLchar)? opengl ffi haskell How Haskell Ptr GLchar GLuint GLsizei GHC.Ptr.Ptr GLint How can I convert a Haskell String into a Ptr (Ptr GLchar)? I wish to call the function The third argument is the shader prog...	[ -0.015380859375, 0.015380859375, -0.005218505859375, -0.01318359375, -0.009521484375, 0.0076904296875, 0.007568359375, -0.026611328125, -0.0001087188720703125, -0.00445556640625, 0.01385498046875, -0.0257568359375, -0.0068359375, -0.01318359375, -0.00811767578125, -0.0040283203125, -...	[ 11249, 831, 87, 96760, 20625, 142508, 23351, 214, 3934, 10, 436, 4448, 683, 90799, 9254, 9803, 11016, 24500, 1556, 34, 4288, 62539, 14, 527, 73265, 32599, 11782, 32354, 50960, 10750, 9638, 820, 1528, 79315, 41877, 441, 39575, 40798, 211235 ...	[ 0.07080078125, 0.073486328125, 0.033538818359375, 0.1595458984375, 0.15625, 0.27587890625, 0.2236328125, 0.1312255859375, 0.0960693359375, 0.052215576171875, 0.10546875, 0.26123046875, 0.06689453125, 0.1607666015625, 0.234375, 0.08636474609375, 0.1336669921875, 0.1171875, 0.11267...	embed
36474604_c0	36474604	haskell	0	Title: What's the difference between (function (x :< _)) = x and (function (x :_)) = x Problem title: What's the difference between (function (x :< _)) = x and (function (x :_)) = x Tags: haskell Problem: What's the difference between (function (x :< _)) = x and (function (x :_)) = x What is the less th...	What's the difference between (function (x :< _)) = x and (function (x :_)) = x What's the difference between (function (x :< _)) = x and (function (x :_)) = x haskell What x:_ x:xs What's the difference between (function (x :< _)) = x and (function (x :_)) = x What is the less than symbol used in the n...	[ 0.01483154296875, 0.00823974609375, -0.004150390625, 0.0030364990234375, -0.00994873046875, -0.0002651214599609375, 0.00848388671875, -0.00909423828125, 0.02001953125, 0.0198974609375, 0.036376953125, -0.015380859375, 0.017578125, 0.0185546875, 0.006866455078125, -0.0012969970703125, ...	[ 3768, 60212, 17721, 137175, 425, 152, 1230, 1277, 74, 101, 2203, 1022, 136, 454, 1556, 142508, 4865, 12, 70, 16093, 40715, 3501, 26582, 11814, 110, 22062, 7, 1369, 29459, 32354, 51776, 79315, 76199, 10336, 140992, 1940, 152028, 2661, 16031,...	[ 0.0672607421875, 0.1842041015625, 0.1083984375, 0.2015380859375, 0.10162353515625, 0.0860595703125, 0.006103515625, 0.0631103515625, 0.0163726806640625, 0.09332275390625, 0.0718994140625, 0.09405517578125, 0.06268310546875, 0.157470703125, 0.086669921875, 0.1904296875, 0.000640869140...	embed
50170540_c1	50170540	haskell	1	full if you downvoted it, or it will be closed, but anyway The code works better if in the last line I use: toString' (x:xs) = show x ++ ", " ++ (toString' xs) but still don't understand why I need the Show (I mean, why I can't remove it from the code?) UPDATE 3 I see my error with Show , if you use a variable type a a...	full if you downvoted it, or it will be closed, but anyway The code works better if in the last line I use: toString' (x:xs) = show x ++ ", " ++ (toString' xs) but still don't understand why I need the Show (I mean, why I can't remove it from the code?) UPDATE 3 I see my error with Show , if you use a variable type a a...	[ -0.00183868408203125, 0.00518798828125, 0.006927490234375, 0.007476806640625, -0.011474609375, 0.01165771484375, 0.01019287109375, 0.000823974609375, 0.006591796875, -0.00445556640625, -0.00604248046875, -0.0478515625, 0.042236328125, 0.0106201171875, -0.030029296875, -0.0072021484375,...	[ 4393, 7565, 965, 3674, 155738, 109954, 18151, 43240, 11522, 4568, 13315, 4527, 47, 71713, 214, 25, 425, 12, 7, 7639, 1022, 37223, 188, 28219, 15400, 3871, 70, 17367, 87388, 442, 18499, 678, 77336, 10644, 10, 959, 23351, 5809, 20625, 14250...	[ 0.2115478515625, 0.1009521484375, 0.1724853515625, 0.0167388916015625, 0.1239013671875, 0.057373046875, 0.188720703125, 0.1019287109375, 0.10546875, 0.1295166015625, 0.088623046875, 0.0633544921875, 0.1590576171875, 0.1572265625, 0.08636474609375, 0.08795166015625, 0.1224365234375, ...	embed
46507959_c0	46507959	haskell	0	Title: How to stop a function that going through an infinite list Problem title: How to stop a function that going through an infinite list Tags: haskell Problem: How to stop a function that going through an infinite list I'm basically trying to solve the Project Euler's question number 5. I'm trying to find the smalle...	How to stop a function that going through an infinite list How to stop a function that going through an infinite list haskell How set2 How to stop a function that going through an infinite list I'm basically trying to solve the Project Euler's question number 5. I'm trying to find the smallest number that's divisible b...	[ -0.002197265625, -0.00164794921875, 0.0234375, -0.00970458984375, 0.0181884765625, 0.003997802734375, -0.0040283203125, -0.02783203125, 0.021728515625, -0.03759765625, 0.0126953125, -0.000705718994140625, 0.0130615234375, -0.015869140625, 0.006591796875, 0.0113525390625, -0.007141113...	[ 11249, 47, 7279, 32354, 450, 7730, 8305, 54241, 13, 5303, 10, 142, 1556, 142508, 5423, 304, 31577, 86869, 27331, 5177, 603, 9655, 1892, 7413, 19336, 525, 14012, 45, 99017, 390, 106, 9193, 2060, 26785, 35166, 442, 13695, 98, 3249, 24145, ...	[ 0.10528564453125, 0.0869140625, 0.25439453125, 0.2158203125, 0.0849609375, 0.09112548828125, 0.1639404296875, 0.1624755859375, 0.081298828125, 0.2012939453125, 0.024322509765625, 0.0250244140625, 0.128662109375, 0.2186279296875, 0.135498046875, 0.1090087890625, 0.07086181640625, 0....	embed
32576173_c0	32576173	haskell	0	Title: Example of a data structure with lazy spine and strict leaves Problem title: Example of a data structure with lazy spine and strict leaves Tags: haskell, data-structures Problem: Example of a data structure with lazy spine and strict leaves One of the performance trick mentioned here is this: As a safe default: ...	Example of a data structure with lazy spine and strict leaves Example of a data structure with lazy spine and strict leaves haskell data-structures Example Example of a data structure with lazy spine and strict leaves One of the performance trick mentioned here is this: I'm having trouble imagining such a data structur...	[ 0.0277099609375, 0.025146484375, -0.0294189453125, -0.00628662109375, 0.0240478515625, 0.017822265625, 0.017333984375, -0.00848388671875, 0.010986328125, -0.033203125, 0.0164794921875, -0.010498046875, -0.007232666015625, 0.002227783203125, 0.006744384765625, 0.041259765625, 0.015502...	[ 89536, 8705, 2053, 45646, 678, 21, 3285, 25927, 13, 136, 81113, 31358, 1556, 142508, 137656, 23718, 88308, 63134, 86898, 6044, 32036, 27781, 23, 186, 191082, 7 ]	[ 0.0997314453125, 0.0274810791015625, 0.1378173828125, 0.20263671875, 0.01690673828125, 0.10028076171875, 0.1409912109375, 0.1700439453125, 0.1004638671875, 0.045867919921875, 0.239501953125, 0.18505859375, 0.107666015625, 0.2296142578125, 0.1541748046875, 0.1563720703125, 0.158447265...	embed
56761514_c0	56761514	haskell	0	Title: Difference between -> and => symbols. What do they mean? Problem title: Difference between -> and => symbols. What do they mean? Tags: haskell Problem: Difference between -> and => symbols. What do they mean? In Haskell, when we talk type declaration. I've seen both -> and => . As an example: I can m...	Difference between -> and => symbols. What do they mean? Difference between -> and => symbols. What do they mean? haskell Difference What Floating Difference between -> and => symbols. What do they mean? In Haskell, when we talk type declaration. I've seen both -> and => . As an example: I can make my own t...	[ 0.0037078857421875, 0.00701904296875, 0.0111083984375, 0.005828857421875, -0.0031280517578125, 0.0118408203125, -0.0002384185791015625, 0.0030517578125, 0.0040283203125, 0.0179443359375, 0.005462646484375, -0.039306640625, -0.0081787109375, 0.0091552734375, -0.003387451171875, -0.01696...	[ 803, 18234, 6620, 17721, 20, 1230, 5386, 136, 2203, 26582, 7, 29459, 1556, 142508, 4865, 38699, 26518, 33079, 44357, 1836, 20625, 22120, 10644, 21635, 51592, 15044, 27781, 831, 10002, 43240, 5885, 18, 864, 3198, 6275, 4527, 3229, 14847, 783...	[ 0.08966064453125, 0.1708984375, 0.0816650390625, 0.07208251953125, 0.07275390625, 0.09503173828125, 0.174072265625, 0.1214599609375, 0.1380615234375, 0.2230224609375, 0.054901123046875, 0.07696533203125, 0.08544921875, 0.22412109375, 0.00628662109375, 0.1212158203125, 0.1067504882812...	embed
58262463_c0	58262463	haskell	0	Title: Filter subsets based on length? Problem title: Filter subsets based on length? Tags: pointfree, list, lambda, haskell, function-call Problem: Filter subsets based on length? Trying to extract the subsets with length k using filter. Not sure how to approach it? The list has 100 elements . subsets :: [a] -> [[a]] ...	Filter subsets based on length? Filter subsets based on length? pointfree list lambda haskell function-call Filter x:xs x:ys Filter subsets based on length? Trying to extract the subsets with length k using filter. Not sure how to approach it? The list has 100 elements . If i use filter this is what i thought it would ...	[ 0.0050048828125, 0.04248046875, 0.007354736328125, -0.01324462890625, 0.000652313232421875, -0.00860595703125, 0.0164794921875, 0.003875732421875, 0.0203857421875, 0.01116943359375, 0.006622314453125, -0.0068359375, -0.005096435546875, 0.006103515625, -0.017822265625, 0.003036499023437...	[ 128896, 1614, 3509, 7, 35509, 98, 140909, 32, 6275, 32087, 5303, 21, 6492, 85, 1556, 142508, 32354, 85763, 1022, 425, 12, 4778, 40858, 125663, 678, 472, 17368, 46312, 9077, 51515, 805, 80854, 4527, 903, 17569, 31895, 44691, 12921, 3525 ]	[ 0.2498779296875, 0.184814453125, 0.203857421875, 0.032135009765625, 0.146484375, 0.089111328125, 0.2271728515625, 0.00250244140625, 0.101806640625, 0.194091796875, 0.1697998046875, 0.003082275390625, 0.130615234375, 0.06927490234375, 0.1268310546875, 0.2139892578125, 0.118408203125, ...	embed
58890798_c0	58890798	haskell	0	Title: Is there a GHC extension for enabling overloaded character literals? Problem title: Is there a GHC extension for enabling overloaded character literals? Tags: haskell, ghc, language-extension Problem: Is there a GHC extension for enabling overloaded character literals? I am aware that there is a GHC extension, O...	Is there a GHC extension for enabling overloaded character literals? Is there a GHC extension for enabling overloaded character literals? haskell ghc language-extension GHC OverloadedStrings Is there a GHC extension for enabling overloaded character literals? I am aware that there is a GHC extension, OverloadedStrings ...	[ 0.0242919921875, -0.01177978515625, 0.016357421875, 0.0167236328125, 0.00396728515625, 0.0084228515625, 0.0034637451171875, -0.013427734375, -0.00115966796875, -0.005340576171875, 0.00174713134765625, -0.0361328125, -0.00634765625, -0.003753662109375, -0.029296875, 0.01177978515625, ...	[ 2071, 2685, 10, 527, 73265, 111938, 100, 22, 11, 79298, 645, 63033, 297, 62816, 15659, 16765, 1556, 142508, 31380, 238, 46876, 3355, 128872, 9578, 71713, 5180, 107419, 114864, 79315, 93343, 390, 44, 24209, 35874, 178851, 21373, 88303, 123166,...	[ 0.040557861328125, 0.0830078125, 0.0777587890625, 0.1195068359375, 0.233154296875, 0.225341796875, 0.065673828125, 0.06646728515625, 0.0836181640625, 0.0982666015625, 0.166748046875, 0.2232666015625, 0.0870361328125, 0.189697265625, 0.2091064453125, 0.13330078125, 0.10552978515625, ...	embed
12025230_c0	12025230	haskell	0	Title: Function composition hint Problem title: Function composition hint Tags: monads, reader-monad, function-composition, haskell, type-inference Problem: Function composition hint just looking for an explanation how does following composition work: (=<<) . return where (=<<) :: (a -> m b) -> m a -> m b return :: a -...	Function composition hint Function composition hint monads reader-monad function-composition haskell type-inference GHCi Monad Function composition hint just looking for an explanation how does following composition work: where The final type: I cann't grasp how can match m a with (a -> m b) , ie. how can apply result ...	[ -0.01177978515625, 0.0076904296875, 0.0294189453125, 0.033447265625, 0.009765625, 0.007537841796875, 0.0091552734375, -0.0118408203125, -0.00823974609375, -0.0185546875, 0.01043701171875, -0.00567626953125, 0.00909423828125, 0.00970458984375, 0.00171661376953125, -0.0283203125, 0.002...	[ 28670, 10763, 166577, 5122, 18, 2667, 712, 155255, 3796, 32354, 277, 40322, 1556, 142508, 10644, 69988, 527, 73265, 14, 60331, 71, 187136, 3642, 14602, 25632, 4488, 7440, 2704, 27689, 254, 831, 14858, 347, 10, 678, 11, 33079, 876, 59911, ...	[ 0.1016845703125, 0.0226898193359375, 0.225830078125, 0.172119140625, 0.0692138671875, 0.058868408203125, 0.086669921875, 0.136962890625, 0.03662109375, 0.1094970703125, 0.06976318359375, 0.0689697265625, 0.039703369140625, 0.172607421875, 0.1328125, 0.045562744140625, 0.0055541992187...	embed
18297285_c0	18297285	haskell	0	Title: Haskell: Get data constructor name as string Problem title: Haskell: Get data constructor name as string Tags: reflection, generic-programming, ghc, deriving, haskell Problem: Haskell: Get data constructor name as string Let us say we have data D = X Int \| Y Int Int \| Z String I wish to have a function getDConst...	Haskell: Get data constructor name as string Haskell: Get data constructor name as string reflection generic-programming ghc deriving haskell Haskell Get Data.Typeable Haskell: Get data constructor name as string Let us say we have I wish to have a function getDConst that returns either "X", "Y", or "Z", according to t...	[ 0.0220947265625, -0.0098876953125, 0.00396728515625, 0.02734375, 0.027587890625, 0.018798828125, -0.0101318359375, -0.0026092529296875, 0.005401611328125, -0.0250244140625, 0.005096435546875, -0.0242919921875, -0.00872802734375, 0.01153564453125, -0.008056640625, 0.0205078125, -0.005...	[ 20625, 142508, 20779, 2053, 64549, 748, 9351, 237, 79315, 44961, 1830, 189534, 28966, 31380, 238, 16406, 1556, 11809, 196707, 2886, 5154, 765, 32599, 32354, 2046, 21960, 191, 271, 30646, 40101, 1542, 1723, 707, 1511, 59499, 11814, 107730, 391...	[ 0.111572265625, 0.22216796875, 0.10650634765625, 0.1356201171875, 0.18115234375, 0.1585693359375, 0.1478271484375, 0.1119384765625, 0.2093505859375, 0.1776123046875, 0.052947998046875, 0.1903076171875, 0.06683349609375, 0.053131103515625, 0.0860595703125, 0.05096435546875, 0.09338378...	embed
39054543_c0	39054543	haskell	0	Title: How to do inverse series sum in haskell efficiently? Problem title: How to do inverse series sum in haskell efficiently? Tags: haskell Problem: How to do inverse series sum in haskell efficiently? This is the code I am trying to convert in haskell. But immutability creates the problem. How to do calculation with...	How to do inverse series sum in haskell efficiently? How to do inverse series sum in haskell efficiently? haskell How How to do inverse series sum in haskell efficiently? This is the code I am trying to convert in haskell. But immutability creates the problem. How to do calculation without mutable variables. Creating a...	[ -0.0216064453125, 0.01190185546875, 0.0125732421875, -0.01104736328125, -0.035888671875, 0.000835418701171875, 0.002899169921875, 0.0242919921875, 0.006927490234375, -0.0257568359375, 0.01190185546875, 0.000736236572265625, 0.027099609375, -0.00616455078125, -0.00750732421875, 0.024902...	[ 11249, 54, 23, 37676, 36549, 10554, 1556, 142508, 93766, 538, 47, 18151, 31577, 96760, 566, 14311, 41159, 28282, 2967, 74481, 15490, 842, 22819, 77336, 56781, 5303, 68252, 1549, 291, 26783, 645, 32628, 88308, 53088, 144281 ]	[ 0.06378173828125, 0.07171630859375, 0.115234375, 0.2452392578125, 0.195068359375, 0.21435546875, 0.151611328125, 0.2386474609375, 0.177734375, 0.09100341796875, 0.0147857666015625, 0.1092529296875, 0.0265960693359375, 0.114990234375, 0.056060791015625, 0.1368408203125, 0.102172851562...	embed
40060162_c1	40060162	haskell	1	you write the code. If you unpack the type of Reader’s apply above, you get the following. <*> :: (r -> a -> b) -> (r -> a) -> (r -> b) -- contrast this with the type of fmap fmap :: (a -> b) -> (r -> a) -> (r -> b) So what’s the difference? The difference is that apply , unlike fmap , also takes an argument of type r...	you write the code. If you unpack the type of Reader’s apply above, you get the following. <*> :: (r -> a -> b) -> (r -> a) -> (r -> b) -- contrast this with the type of fmap fmap :: (a -> b) -> (r -> a) -> (r -> b) So what’s the difference? The difference is that apply , unlike fmap , also takes an argument of type r...	[ 0.003875732421875, -0.0067138671875, 0.0042724609375, 0.0272216796875, -0.00176239013671875, 0.006622314453125, -0.00927734375, 0.01470947265625, 0.022216796875, 0.00396728515625, 0.02001953125, -0.003448486328125, 0.01611328125, 0.001220703125, -0.00421142578125, -0.034423828125, 0....	[ 398, 33022, 70, 18151, 51, 29102, 10644, 122636, 26, 7, 59911, 36917, 2046, 25632, 1639, 1984, 42, 33079, 10, 876, 69822, 678, 1238, 62346, 11, 2367, 60212, 5062, 2843, 51776, 10750, 1690, 26176, 221, 32635, 3642, 3249, 71, 108564, 4, 9...	[ 0.038787841796875, 0.156005859375, 0.055633544921875, 0.2071533203125, 0.0758056640625, 0.1331787109375, 0.169677734375, 0.257568359375, 0.0938720703125, 0.041961669921875, 0.2958984375, 0.00579833984375, 0.0150146484375, 0.0556640625, 0.035919189453125, 0.0160980224609375, 0.1184082...	embed
50547500_c0	50547500	haskell	0	Title: How to work with high order functions inside lists in haskell? Problem title: How to work with high order functions inside lists in haskell? Tags: haskell Problem: How to work with high order functions inside lists in haskell? I'm learning haskell by myself and I have a lot of doubts about how [f x \| ......] wor...	How to work with high order functions inside lists in haskell? How to work with high order functions inside lists in haskell? haskell How How to work with high order functions inside lists in haskell? I'm learning haskell by myself and I have a lot of doubts about how works. For example I have this expression: And it r...	[ -0.0030517578125, -0.016845703125, -0.010986328125, -0.0128173828125, 0.006591796875, 0.01226806640625, -0.00885009765625, 0.0015869140625, 0.01300048828125, -0.0218505859375, 0.000362396240234375, -0.0274658203125, 0.0030670166015625, 0.00136566162109375, -0.018798828125, -0.023803710...	[ 11249, 47, 4488, 678, 11192, 12989, 32354, 7, 46132, 5303, 23, 1556, 142508, 52080, 35978, 5915, 92814, 3642, 43240, 765, 903, 125195, 3493, 30646, 12, 6183, 28219, 32497, 450, 93192, 4358, 187136, 209806, 18, 2046 ]	[ 0.0970458984375, 0.06591796875, 0.156494140625, 0.136962890625, 0.150146484375, 0.218017578125, 0.2000732421875, 0.0732421875, 0.189208984375, 0.1964111328125, 0.07757568359375, 0.138427734375, 0.2391357421875, 0.040618896484375, 0.022857666015625, 0.0145416259765625, 0.0437316894531...	embed
8261345_c0	8261345	haskell	0	Title: Why Haskell range needs spaces when using [LT .. GT]? Problem title: Why Haskell range needs spaces when using [LT .. GT]? Tags: haskell Problem: Why Haskell range needs spaces when using [LT .. GT]? Why is it that when I do range in Haskell, this works: [LT .. GT] but this doesn't: [LT..GT] and what does this c...	Why Haskell range needs spaces when using [LT .. GT]? Why Haskell range needs spaces when using [LT .. GT]? haskell Why Haskell LT..GT Failed Use Why Haskell range needs spaces when using [LT .. GT]? Why is it that when I do range in Haskell, this works: but this doesn't: and what does this cryptic error mean: However,...	[ -0.017333984375, 0.0155029296875, -0.00616455078125, -0.0024261474609375, -0.0220947265625, 0.015869140625, -0.0057373046875, -0.00799560546875, -0.021484375, 0.01190185546875, 0.00933837890625, -0.01287841796875, -0.0152587890625, -0.013427734375, 0.000919342041015625, -0.002838134765...	[ 44084, 20625, 142508, 37457, 27117, 32628, 7, 17368, 27026, 1468, 43448, 1556, 64765, 37315, 190355, 36836, 43240, 903, 22027, 18, 91190, 112569, 18499, 4527, 360, 933, 17932, 3173, 6056 ]	[ 0.0841064453125, 0.1470947265625, 0.2406005859375, 0.23095703125, 0.14892578125, 0.25830078125, 0.126708984375, 0.04974365234375, 0.1531982421875, 0.096435546875, 0.20263671875, 0.114501953125, 0.168701171875, 0.2073974609375, 0.11474609375, 0.07562255859375, 0.0853271484375, 0.007...	embed
11959764_c0	11959764	haskell	0	Title: What is the "coverage condition"? Problem title: What is the "coverage condition"? Tags: functional-dependencies, haskell Problem: What is the "coverage condition"? The source for the State transformer in mtl states: -- -------------------------------------------------------------------------...	What is the "coverage condition"? What is the "coverage condition"? functional-dependencies haskell What State Instances All UndecidableInstances What is the "coverage condition"? The source for the State transformer in mtl states: What is the "coverage condition"? All I can tell is that it has some...	[ 0.006134033203125, -0.00262451171875, 0.00634765625, 0.006561279296875, 0.0030059814453125, 0.00457763671875, -0.0037994384765625, -0.00799560546875, 0.01190185546875, 0.0003795623779296875, 0.0011444091796875, -0.0111083984375, 0.006256103515625, 0.0167236328125, -0.0006103515625, 0.0...	[ 4865, 83, 70, 63127, 4588, 35431, 123309, 105254, 1556, 142508, 22836, 116071, 3164, 79912, 24750, 2661, 31344, 27198, 56, 347, 18, 141, 117249, 9844, 47, 54, 678, 36812, 12233, 9458, 4517 ]	[ 0.06011962890625, 0.054046630859375, 0.07373046875, 0.2254638671875, 0.19873046875, 0.261962890625, 0.1248779296875, 0.117919921875, 0.1123046875, 0.195068359375, 0.1676025390625, 0.07373046875, 0.0010986328125, 0.040374755859375, 0.1202392578125, 0.059295654296875, 0.152099609375, ...	embed
13858976_c0	13858976	haskell	0	Title: hex values in haskell Problem title: hex values in haskell Tags: haskell Problem: hex values in haskell I have the following code in haskell that i want to make some changes to it: unwords . map (printf "%02X") $ zipWith (\x y -> -(fromIntegral (ord x)) + y - 2 :: Word8) "Aa123456" [0..] After running this code ...	hex values in haskell hex values in haskell haskell Word8 Aa123456 hex values in haskell I have the following code in haskell that i want to make some changes to it: After running this code i get: Basically i want the inverse of this function, so the function can get the hex values "BD 9E CF CF CF CF CF CF" and return ...	[ 0.0030670166015625, -0.0069580078125, -0.0050048828125, 0.02685546875, -0.0172119140625, 0.01153564453125, 0.012451171875, -0.0054931640625, 0.00823974609375, 0.01226806640625, 0.0198974609375, -0.0196533203125, 0.031494140625, 0.023681640625, -0.01507568359375, 0.0019683837890625, 0...	[ 764, 425, 142424, 23, 1556, 142508, 22543, 1019, 62, 11, 190875, 13683, 25632, 18151, 3444, 3249, 65572, 51042, 12506, 37676, 903, 32354, 70, 831, 2046, 48969, 483, 647, 73754, 30646, 284, 9077, 15549, 28412, 420, 63805, 3642, 139124, 26499...	[ 0.1973876953125, 0.197021484375, 0.2218017578125, 0.1129150390625, 0.170166015625, 0.242919921875, 0.15576171875, 0.197998046875, 0.0831298828125, 0.1336669921875, 0.170166015625, 0.219970703125, 0.03955078125, 0.1129150390625, 0.1075439453125, 0.014373779296875, 0.1212158203125, 0...	embed
39787541_c1	39787541	haskell	1	of the string I can just change the definition of closeBracket to closeBracket = (Parsec.char ']' >> return ()) <\|> Parsec.eof But despite quite a bit of trial and error I haven't found a solution to match unmatched ] s against the start of the string. I know that the usual solution to left recursion in Parsec is the ...	of the string I can just change the definition of closeBracket to closeBracket = (Parsec.char ']' >> return ()) <\|> Parsec.eof But despite quite a bit of trial and error I haven't found a solution to match unmatched ] s against the start of the string. I know that the usual solution to left recursion in Parsec is the ...	[ -0.003509521484375, 0.004119873046875, -0.0263671875, 0.0155029296875, 0.004852294921875, 0.00433349609375, 0.00087738037109375, -0.03271484375, 0.01904296875, -0.00885009765625, -0.00653076171875, -0.01251220703125, -0.00909423828125, 0.002349853515625, 0.0111083984375, -0.00524902343...	[ 111, 79315, 831, 15549, 80934, 20903, 49960, 27853, 47, 2203, 28636, 39797, 9254, 268, 6396, 30646, 2392, 13, 4390, 110324, 29806, 14858, 51, 98753, 297, 10114, 91, 26548, 4034, 115723, 25737, 195625, 1830, 121293, 141, 418, 32354, 32233, 2...	[ 0.1318359375, 0.236328125, 0.024627685546875, 0.1802978515625, 0.189208984375, 0.2127685546875, 0.1888427734375, 0.2218017578125, 0.0285797119140625, 0.00311279296875, 0.0960693359375, 0.215576171875, 0.1759033203125, 0.0999755859375, 0.015716552734375, 0.222900390625, 0.126220703125...	embed
27694624_c1	27694624	haskell	1	(LevelExpr f) ts) -> (TList f ts -> LevelExpr f t) -> LevelExpr f t Var :: f t -> LevelExpr f t Vertex :: (Float, Float) -> LevelExpr f VertexId Code signals: Control.Applicative, ts, the, v1, Why, GADT, LANGUAGE, GADTs, DataKinds, PolyKinds, KindSignatures, RankNTypes, TypeOperators, TList, TNil, Applicative, WallId,...	(LevelExpr f) ts) -> (TList f ts -> LevelExpr f t) -> LevelExpr f t Var :: f t -> LevelExpr f t Vertex :: (Float, Float) -> LevelExpr f VertexId Code signals: Control.Applicative, ts, the, v1, Why, GADT, LANGUAGE, GADTs, DataKinds, PolyKinds, KindSignatures, RankNTypes, TypeOperators, TList, TNil, Applicative, WallId,...	[ 0.00140380859375, -0.003631591796875, -0.0189208984375, -0.0000324249267578125, 0.040283203125, 0.003143310546875, -0.01300048828125, -0.001068115234375, -0.002288818359375, -0.00139617919921875, 0.011474609375, -0.028564453125, 0.01416015625, 0.0172119140625, 0.0118408203125, 0.000240...	[ 5267, 2601, 19279, 10287, 1238, 61636, 33079, 41445, 1419, 84136, 808, 3323, 1984, 1446, 24371, 365, 257, 38699, 568, 71, 28864, 26073, 7, 27131, 39179, 11048, 4935, 70, 81, 418, 44084, 23749, 41072, 3358, 98064, 75930, 11809, 7250, 63306, ...	[ 0.1082763671875, 0.2254638671875, 0.1304931640625, 0.194091796875, 0.168212890625, 0.19921875, 0.09820556640625, 0.05816650390625, 0.150634765625, 0.2734375, 0.06744384765625, 0.18310546875, 0.006988525390625, 0.151123046875, 0.187255859375, 0.1064453125, 0.046051025390625, 0.16210...	embed
28922514_c0	28922514	haskell	0	Title: haskell quick sort, why the first let uses <= instead of <? Problem title: haskell quick sort, why the first let uses <= instead of <? Tags: sorting, list, haskell Problem: haskell quick sort, why the first let uses <= instead of quicksort :: (Ord a) => [a] -> [a] quicksort [] = [] quicksort (x:xs) =...	haskell quick sort, why the first let uses <= instead of <? haskell quick sort, why the first let uses <= instead of <? sorting list haskell Ord x:xs haskell quick sort, why the first let uses <= instead of in Haskell quick sort, why the first let uses <= instead of < ? I think <= will duplicate that x many...	[ -0.010986328125, 0.0086669921875, 0.0255126953125, -0.02392578125, -0.0054931640625, 0.0038299560546875, 0.00506591796875, -0.002593994140625, 0.01483154296875, 0.0277099609375, -0.004791259765625, 0.0194091796875, 0.029541015625, 0.000362396240234375, 0.0089111328125, 0.00131988525390...	[ 1556, 142508, 63773, 12096, 15400, 5117, 2633, 4527, 619, 1277, 74, 1369, 64457, 5303, 35379, 425, 4426, 20625, 5351, 1221, 171763, 67, 1022, 5941, 20028, 44084 ]	[ 0.0936279296875, 0.1683349609375, 0.143798828125, 0.1883544921875, 0.0933837890625, 0.10040283203125, 0.1839599609375, 0.0657958984375, 0.006011962890625, 0.07342529296875, 0.000701904296875, 0.161376953125, 0.10302734375, 0.093994140625, 0.10211181640625, 0.0157318115234375, 0.13549...	embed
29184644_c0	29184644	haskell	0	Title: Efficiency of Haskell Tail-recursive functions Problem title: Efficiency of Haskell Tail-recursive functions Tags: tail-recursion, recursion, haskell Problem: Efficiency of Haskell Tail-recursive functions I have the following basic Haskell code: prodsum x = prod x + sum x prod 0 = 1 prod n = n * prod (n-1) sum ...	Efficiency of Haskell Tail-recursive functions Efficiency of Haskell Tail-recursive functions tail-recursion recursion haskell Efficiency Haskell Tail-recursive n-1 Efficiency of Haskell Tail-recursive functions I have the following basic Haskell code: Can anyone explain me why the code below is more efficient:	[ -0.011474609375, -0.0027618408203125, 0.0155029296875, 0.0167236328125, 0.0021514892578125, -0.00799560546875, -0.0098876953125, -0.0093994140625, -0.000274658203125, 0.0022125244140625, 0.006927490234375, -0.007232666015625, -0.00958251953125, -0.01007080078125, 0.004486083984375, 0.0...	[ 14467, 11044, 33, 2408, 20625, 142508, 1218, 379, 107, 48650, 5844, 32354, 46741, 1830, 195625, 1556, 5759, 765, 25632, 62822, 18151, 4171, 35672, 73342, 163, 15400, 35064, 83, 1286, 93766 ]	[ 0.1240234375, 0.1634521484375, 0.100341796875, 0.038421630859375, 0.1546630859375, 0.2281494140625, 0.1610107421875, 0.1572265625, 0.067626953125, 0.1727294921875, 0.1094970703125, 0.1656494140625, 0.234130859375, 0.05499267578125, 0.1971435546875, 0.151123046875, 0.095947265625, 0...	embed
30547004_c0	30547004	haskell	0	Title: How to I get the Haskell data value from the request body in Snap framework Problem title: How to I get the Haskell data value from the request body in Snap framework Tags: haskell, haskell-snap-framework Problem: How to I get the Haskell data value from the request body in Snap framework I am new Snap and Haske...	How to I get the Haskell data value from the request body in Snap framework How to I get the Haskell data value from the request body in Snap framework haskell haskell-snap-framework the How Haskell Snap How to I get the Haskell data value from the request body in Snap framework I am new Snap and Haskell web developmen...	[ 0.00086212158203125, 0.0264892578125, -0.01220703125, -0.00439453125, -0.006317138671875, 0.040771484375, -0.0013885498046875, 0.000896453857421875, 0.00011301040649414062, -0.03662109375, -0.001708984375, -0.028564453125, -0.014892578125, -0.018798828125, 0.0067138671875, -0.005371093...	[ 11249, 87, 2046, 70, 20625, 142508, 2053, 34292, 1295, 50336, 14361, 121190, 170846, 1556, 10957, 160328, 23, 1467, 34754, 366, 184, 47, 27781, 32102, 2414, 1121, 937, 145482, 12986, 302, 1052, 525, 7844, 127, 5570, 8999 ]	[ 0.0523681640625, 0.018341064453125, 0.10260009765625, 0.06256103515625, 0.1453857421875, 0.2578125, 0.162353515625, 0.2025146484375, 0.0750732421875, 0.1812744140625, 0.1904296875, 0.2244873046875, 0.213623046875, 0.06268310546875, 0.1767578125, 0.058349609375, 0.0194549560546875, ...	embed
33894774_c0	33894774	haskell	0	Title: Haskell - Creating rectangle of 1s with height and width of user input Problem title: Haskell - Creating rectangle of 1s with height and width of user input Tags: haskell Problem: Haskell - Creating rectangle of 1s with height and width of user input I am trying to create a function that will take two integer va...	Haskell - Creating rectangle of 1s with height and width of user input Haskell - Creating rectangle of 1s with height and width of user input haskell Haskell Creating Main Haskell - Creating rectangle of 1s with height and width of user input I am trying to create a function that will take two integer values that corre...	[ 0.0031280517578125, 0.01483154296875, 0.0081787109375, 0.003387451171875, -0.002410888671875, 0.0247802734375, -0.0030670166015625, -0.01226806640625, -0.009765625, -0.0186767578125, -0.005767822265625, -0.034423828125, -0.0023193359375, -0.004638671875, 0.000911712646484375, -0.004302...	[ 20625, 142508, 56781, 148734, 449, 133, 111, 106, 7, 678, 155955, 136, 146984, 38937, 107730, 1916, 1556, 12321, 31577, 28282, 32354, 1221, 5646, 6626, 892, 1505, 142424, 42518, 140992, 1884, 221, 9842, 1679, 99, 110, 16981, 6275, 77947, 47...	[ 0.158447265625, 0.2408447265625, 0.1490478515625, 0.156494140625, 0.1492919921875, 0.1431884765625, 0.063232421875, 0.1273193359375, 0.120361328125, 0.048553466796875, 0.223388671875, 0.0877685546875, 0.1826171875, 0.1641845703125, 0.1881103515625, 0.0181427001953125, 0.134521484375,...	embed
35613184_c0	35613184	haskell	0	Title: How do I prevent GHCI from evaluating an infinite stream? Problem title: How do I prevent GHCI from evaluating an infinite stream? Tags: haskell, ghci Problem: How do I prevent GHCI from evaluating an infinite stream? Sometimes when using GHCI I accidentally try to evaluate an infinite stream (e.g. [1..] ). It k...	How do I prevent GHCI from evaluating an infinite stream? How do I prevent GHCI from evaluating an infinite stream? haskell ghci evaluating How GHCI How do I prevent GHCI from evaluating an infinite stream? Sometimes when using GHCI I accidentally try to evaluate an infinite stream (e.g. [1..] ). It keeps printing... a...	[ -0.019287109375, 0.01068115234375, 0.0179443359375, -0.01416015625, 0.0042724609375, -0.0027618408203125, 0.01611328125, -0.00921630859375, 0.005615234375, -0.030517578125, 0.0123291015625, -0.0380859375, 0.025146484375, -0.0028533935546875, 0.00689697265625, 0.0185546875, 0.01422119...	[ 11249, 54, 87, 56282, 41877, 17304, 1295, 151575, 214, 54241, 13, 75973, 1556, 142508, 31380, 318, 160193, 17368, 27998, 9790, 47, 142, 13695, 7, 2448, 1916, 136, 2967, 83, 4734, 3917, 7279, 569, 18, 130250, 388, 41884, 21771, 16940, 5600...	[ 0.0765380859375, 0.038330078125, 0.00457763671875, 0.2230224609375, 0.1575927734375, 0.2293701171875, 0.07421875, 0.2078857421875, 0.050628662109375, 0.149658203125, 0.06097412109375, 0.194091796875, 0.12548828125, 0.23779296875, 0.1461181640625, 0.1881103515625, 0.0301971435546875, ...	embed
40638337_c0	40638337	haskell	0	Title: Haskell - Quadratic Formula Problem title: Haskell - Quadratic Formula Tags: haskell, functional-programming Problem: Haskell - Quadratic Formula Today I started reading a book regarding Haskell and told myself I give it a try to implemement something basic such as the "quadratic formula". quadHelper a b c op = ...	Haskell - Quadratic Formula Haskell - Quadratic Formula haskell functional-programming Haskell Quadratic Formula NaN Haskell - Quadratic Formula Today I started reading a book regarding Haskell and told myself I give it a try to implemement something basic such as the "quadratic formula". Unfortunately, my first implem...	[ 0.018798828125, -0.00074005126953125, 0.010986328125, -0.02783203125, 0.01104736328125, -0.0025787353515625, 0.00020503997802734375, -0.00994873046875, -0.019287109375, -0.016357421875, -0.00750732421875, -0.0302734375, 0.000759124755859375, -0.0223388671875, -0.0115966796875, -0.04125...	[ 20625, 142508, 83227, 219, 9523, 72791, 20, 1556, 123309, 28966, 353, 839, 38396, 26859, 16454, 12877, 118861, 30745, 35978, 8337, 9790, 21980, 14230, 674, 9844, 62822, 111533, 26168, 185397, 5117, 208124, 22027, 18, 4488, 84751, 2046, 378, 4...	[ 0.1622314453125, 0.260009765625, 0.1336669921875, 0.1153564453125, 0.1080322265625, 0.2177734375, 0.00054931640625, 0.1505126953125, 0.152099609375, 0.1175537109375, 0.166015625, 0.1915283203125, 0.06097412109375, 0.0290985107421875, 0.1080322265625, 0.1348876953125, 0.01416015625, ...	embed
5216473_c0	5216473	haskell	0	Title: Why doesn't `putStrLn getLine` work? Problem title: Why doesn't `putStrLn getLine` work? Tags: stdio, haskell Problem: Why doesn't `putStrLn getLine` work? I'm complete newbie on Haskell. My Haskell script with GHCi , Prelude> let a = putStrLn getLine makes an error like this. <interactive>:1:17: Could...	Why doesn't `putStrLn getLine` work? Why doesn't `putStrLn getLine` work? stdio haskell Why GHCi Prelude Couldn Why doesn't `putStrLn getLine` work? I'm complete newbie on Haskell. My Haskell script with GHCi , makes an error like this. Why doesn't it work and how can I print something input from stdin ?	[ -0.007537841796875, -0.00179290771484375, 0.00225830078125, 0.0263671875, 0.000904083251953125, 0.00994873046875, 0.002655029296875, -0.00142669677734375, -0.00171661376953125, -0.018310546875, -0.0015869140625, -0.0147705078125, -0.004608154296875, -0.0002307891845703125, -0.00064086914...	[ 44084, 22027, 3768, 18, 7077, 71713, 866, 19, 2046, 93232, 4488, 6138, 5670, 1556, 142508, 527, 73265, 14, 1914, 822, 112, 191147, 28484, 9014, 20625, 26499, 18499, 1884, 903, 28412, 107730, 1295, 3035 ]	[ 0.085205078125, 0.096923828125, 0.037200927734375, 0.0869140625, 0.147216796875, 0.2142333984375, 0.108642578125, 0.107421875, 0.13427734375, 0.2100830078125, 0.133056640625, 0.1209716796875, 0.1474609375, 0.077392578125, 0.1966552734375, 0.04815673828125, 0.07757568359375, 0.14050...	embed
26705025_c0	26705025	haskell	0	Title: Pattern matching and infinite lists Problem title: Pattern matching and infinite lists Tags: fold, haskell, infinite, lazy-evaluation, list Problem: Pattern matching and infinite lists I'm having trouble understanding this simple snippet of code: -- This works: foldr go1 [] [1..] -- This doesn't: foldr go2 [] [1...	Pattern matching and infinite lists Pattern matching and infinite lists fold haskell infinite lazy-evaluation list Pattern go1 go2 Pattern matching and infinite lists I'm having trouble understanding this simple snippet of code: Folding with go1 immediately starts returning values, but go2 appears to be waiting for the...	[ -0.00121307373046875, -0.00116729736328125, 0.00055694580078125, -0.0155029296875, -0.0147705078125, 0.005096435546875, -0.0030670166015625, 0.0128173828125, 0.0223388671875, -0.0152587890625, 0.0252685546875, -0.0281982421875, -0.0026397705078125, -0.0033721923828125, -0.000633239746093...	[ 9876, 22766, 14858, 214, 136, 54241, 13, 5303, 42822, 1556, 142508, 21, 3285, 159258, 738, 418, 304, 63134, 100094, 8781, 58134, 18151, 30077, 6238, 678, 109312, 4034, 30646, 142424, 1284, 135179, 89289, 100, 3564, 111, 103510, 216806, 34831,...	[ 0.1513671875, 0.1436767578125, 0.1995849609375, 0.07391357421875, 0.0207672119140625, 0.1168212890625, 0.06439208984375, 0.1800537109375, 0.1368408203125, 0.06689453125, 0.17822265625, 0.004852294921875, 0.1080322265625, 0.091552734375, 0.1357421875, 0.117919921875, 0.1627197265625, ...	embed
20328238_c0	20328238	haskell	0	Title: Haskell sendFile function Problem title: Haskell sendFile function Tags: sendfile, network-programming, haskell Problem: Haskell sendFile function Where can I find some actual examples of sendFile function (Network.Socket.SendFile lib). When I tried to do all by official manual, I got an error: Exception: {file ...	Haskell sendFile function Haskell sendFile function sendfile network-programming haskell Haskell Exception Broken AF_INET Stream SockAddrInet Haskell sendFile function Where can I find some actual examples of sendFile function (Network.Socket.SendFile lib). When I tried to do all by official manual, I got an error: is ...	[ 0.0093994140625, 0.0050048828125, 0.000064849853515625, 0.00640869140625, 0.0019683837890625, -0.002655029296875, -0.00384521484375, -0.000797271728515625, -0.01458740234375, -0.0234375, 0.0228271484375, 0.01446533203125, -0.01708984375, 0.00421142578125, -0.00066375732421875, -0.00582...	[ 20625, 142508, 25379, 174350, 32354, 29822, 33120, 28966, 1556, 5443, 63928, 13177, 28211, 17777, 115061, 1061, 7569, 126, 7413, 8561, 27781, 24447, 18244, 8912, 27853, 294, 3611, 25474, 756, 51521, 23009, 18499, 22729, 100033, 127689, 31344 ]	[ 0.1214599609375, 0.2159423828125, 0.1805419921875, 0.306396484375, 0.164794921875, 0.287353515625, 0.08251953125, 0.075927734375, 0.0941162109375, 0.0277557373046875, 0.08953857421875, 0.1165771484375, 0.116455078125, 0.1220703125, 0.1470947265625, 0.063232421875, 0.0146636962890625,...	embed
75049887_c0	75049887	haskell	0	Title: How do you lift a binary function to monad transformers? Problem title: How do you lift a binary function to monad transformers? Tags: monads, monad-transformers, haskell Problem: How do you lift a binary function to monad transformers? I know you can lift functions to monads with liftM , but I it doesn't seem t...	How do you lift a binary function to monad transformers? How do you lift a binary function to monad transformers? monads monad-transformers haskell How ExceptT Maybe Couldn How do you lift a binary function to monad transformers? I know you can lift functions to monads with liftM , but I it doesn't seem to work with bi...	[ 0.004913330078125, 0.00384521484375, 0.01312255859375, -0.004150390625, 0.01214599609375, 0.015625, -0.0036773681640625, -0.0279541015625, 0.01434326171875, -0.03515625, 0.0181884765625, -0.01068115234375, 0.0029449462890625, 0.01202392578125, 0.018798828125, -0.024658203125, 0.01147...	[ 11249, 54, 398, 60520, 2394, 6635, 32354, 47, 2667, 712, 27198, 1314, 215175, 1556, 142508, 218288, 618, 83425, 191147, 19, 831, 7, 678, 594, 4488, 37842, 22183, 18 ]	[ 0.0831298828125, 0.0611572265625, 0.0210113525390625, 0.220703125, 0.1619873046875, 0.15234375, 0.1871337890625, 0.123779296875, 0.1318359375, 0.208984375, 0.215087890625, 0.1094970703125, 0.2005615234375, 0.0789794921875, 0.1898193359375, 0.113037109375, 0.0157012939453125, 0.1212...	embed
47187317_c0	47187317	haskell	0	Title: haskell show with function application Problem title: haskell show with function application Tags: show, haskell Problem: haskell show with function application this line of code in Haskell produces an error on compilation: lineStat :: String -> [String] lineStat xs = zipWith (\n line -> show n ++ " " ++ show $ ...	haskell show with function application haskell show with function application show haskell Char haskell show with function application this line of code in Haskell produces an error on compilation: Error: Couldn't match expected type Int -> String with actual type [Char] The first argument of ($) takes one argument,but...	[ -0.004058837890625, 0.003814697265625, 0.01544189453125, 0.033447265625, -0.005584716796875, -0.001129150390625, 0.0166015625, -0.0037384033203125, 0.000606536865234375, 0.01226806640625, -0.0186767578125, -0.01544189453125, 0.0023345947265625, 0.0107421875, -0.0101318359375, 0.0075988...	[ 1556, 142508, 7639, 678, 32354, 38415, 21656, 13315, 18151, 20625, 27489, 18499, 98, 98352, 212059, 191147, 18, 14858, 84751, 10644, 360, 33079, 23351, 214, 8561, 84068, 5117, 10750, 4369, 51776, 1632, 8789, 351, 903, 111, 43240, 44084 ]	[ 0.1207275390625, 0.200927734375, 0.1888427734375, 0.1422119140625, 0.1934814453125, 0.1702880859375, 0.1485595703125, 0.07757568359375, 0.0721435546875, 0.10205078125, 0.0694580078125, 0.157470703125, 0.0203704833984375, 0.1566162109375, 0.1304931640625, 0.06329345703125, 0.068420410...	embed
48083426_c1	48083426	haskell	1	.2 ide-haskell-cabal 2.1.0 language-haskell 1.17.2 Atom itself is version 1.23.2 x64. $ stack --version Version 1.6.3, Git revision b27e629b8c4ce369e3b8273f04db193b060000db (5454 commits) x86_64 hpack-0.20.0 I believe that everything is up-to-date. I've read https://atom-haskell.github.io/core-packages/haskell-ghc-mod/...	.2 ide-haskell-cabal 2.1.0 language-haskell 1.17.2 Atom itself is version 1.23.2 x64. $ stack --version Version 1.6.3, Git revision b27e629b8c4ce369e3b8273f04db193b060000db (5454 commits) x86_64 hpack-0.20.0 I believe that everything is up-to-date. I've read https://atom-haskell.github.io/core-packages/haskell-ghc-mod/...	[ 0.006103515625, 0.007568359375, 0.007232666015625, 0.0130615234375, 0.0074462890625, 0.0247802734375, 0.0019378662109375, -0.01300048828125, -0.01507568359375, -0.01019287109375, 0.00372314453125, -0.053466796875, 0.011962890625, 0.007598876953125, 0.0091552734375, -0.004241943359375, ...	[ 5, 304, 5415, 10557, 142508, 408, 3571, 787, 102107, 46876, 38245, 179642, 69728, 68034, 83, 11389, 34635, 107033, 13307, 3650, 177261, 46354, 40647, 615, 200768, 527, 217, 111666, 3768, 4235, 125832, 13574, 2947, 28568, 48073, 152463, 375, 4...	[ 0.0513916015625, 0.12060546875, 0.2137451171875, 0.17236328125, 0.286376953125, 0.111572265625, 0.210205078125, 0.0751953125, 0.14453125, 0.161376953125, 0.08331298828125, 0.139892578125, 0.225341796875, 0.1199951171875, 0.03607177734375, 0.138427734375, 0.097900390625, 0.163818359...	embed
67644496_c0	67644496	haskell	0	Title: How to retrieve comments using Megaparsec? Problem title: How to retrieve comments using Megaparsec? Tags: parsec, megaparsec, haskell, abstract-syntax-tree Problem: How to retrieve comments using Megaparsec? I'm printing an AST in order to format the source file, from which the AST is generated using Megaparsec...	How to retrieve comments using Megaparsec? How to retrieve comments using Megaparsec? parsec megaparsec haskell abstract-syntax-tree Megaparsec How How to retrieve comments using Megaparsec? I'm printing an AST in order to format the source file, from which the AST is generated using Megaparsec. Comments are missing fr...	[ -0.01397705078125, 0.0020751953125, -0.004180908203125, 0.01239013671875, 0.003570556640625, 0.018798828125, -0.0072021484375, -0.0032958984375, -0.0003910064697265625, -0.039306640625, -0.008544921875, 0.00146484375, 0.0089111328125, -0.004241943359375, -0.02099609375, 0.0201416015625...	[ 11249, 456, 3996, 3134, 24626, 17368, 26842, 2500, 39797, 47, 366, 31534, 1556, 142508, 164789, 12654, 86531, 62600, 2448, 48963, 9384, 31344, 11435, 139392, 11427, 132283, 1295, 150661, 13695, 23491, 19514, 3917, 113054, 756, 13315, 46389, 866...	[ 0.08868408203125, 0.0955810546875, 0.148681640625, 0.1202392578125, 0.271728515625, 0.11328125, 0.1683349609375, 0.155029296875, 0.2197265625, 0.0201568603515625, 0.030120849609375, 0.1102294921875, 0.08148193359375, 0.1904296875, 0.1524658203125, 0.009796142578125, 0.1068115234375, ...	embed
3077866_c1	3077866	haskell	1	for the data streams to a set of data structures, and I can implement each processing step as a pure function. The processing steps required for one piece of data will depend on its value and others'. Some of the steps should be followed by side-effects like GUI updates or database queries. What's the 'Right' way to t...	for the data streams to a set of data structures, and I can implement each processing step as a pure function. The processing steps required for one piece of data will depend on its value and others'. Some of the steps should be followed by side-effects like GUI updates or database queries. What's the 'Right' way to t...	[ -0.00007534027099609375, 0.018310546875, 0.010986328125, 0.02392578125, 0.0091552734375, 0.0281982421875, 0.014892578125, -0.0238037109375, 0.0079345703125, -0.024169921875, -0.004638671875, -0.0198974609375, -0.0050048828125, 0.01068115234375, -0.0169677734375, 0.000667572021484375, ...	[ 100, 2053, 75973, 7, 47, 5423, 45646, 87, 831, 29479, 12638, 9433, 214, 29954, 237, 34166, 32354, 98441, 56065, 63847, 56566, 98, 34292, 134629, 5609, 171760, 195490, 114419, 63399, 1052, 22553, 3917, 4817, 70, 136, 366, 6953, 26267, 6561, ...	[ 0.049591064453125, 0.155517578125, 0.2017822265625, 0.013763427734375, 0.0965576171875, 0.06280517578125, 0.1871337890625, 0.0274658203125, 0.029388427734375, 0.151123046875, 0.057098388671875, 0.1202392578125, 0.0596923828125, 0.1641845703125, 0.006866455078125, 0.1182861328125, 0.1...	embed
33194267_c0	33194267	haskell	0	Title: Haskell State Monad Problem title: Haskell State Monad Tags: haskell, state-monad Problem: Haskell State Monad Does the put function of the State Monad update the actual state or does it just return a new state with the new value? My question is, can the State Monad be used like a "global variable" in an imperat...	Haskell State Monad Haskell State Monad haskell state-monad Haskell State Monad Haskell State Monad Does the put function of the State Monad update the actual state or does it just return a new state with the new value? My question is, can the State Monad be used like a "global variable" in an imperative setting? And d...	[ -0.01318359375, 0.021484375, 0.017822265625, 0.0087890625, 0.00732421875, 0.0223388671875, -0.0162353515625, 0.00775146484375, 0.0033416748046875, 0.000644683837890625, 0.00799560546875, 0.0169677734375, -0.01458740234375, -0.002471923828125, -0.007720947265625, 0.00041961669921875, ...	[ 20625, 142508, 22836, 60331, 71, 1556, 11341, 3796, 712, 101790, 70, 3884, 32354, 28350, 8561, 707, 14602, 30646, 3525, 34292, 831, 11814, 1884, 156566, 77336, 222530, 53550, 2811, 40383, 100094, 9520, 442, 86725, 61475, 17368, 2667, 11, 1840...	[ 0.134521484375, 0.26904296875, 0.2139892578125, 0.2081298828125, 0.1849365234375, 0.12744140625, 0.1939697265625, 0.1007080078125, 0.09320068359375, 0.008819580078125, 0.002960205078125, 0.239501953125, 0.169189453125, 0.2138671875, 0.11767578125, 0.011810302734375, 0.06341552734375,...	embed
54963972_c0	54963972	haskell	0	Title: Need help to understand how this function composition works Problem title: Need help to understand how this function composition works Tags: haskell, function-composition Problem: Need help to understand how this function composition works I can understand this line of code without problem let f s = filter (isDi...	Need help to understand how this function composition works Need help to understand how this function composition works haskell function-composition Need isDigit.head Need help to understand how this function composition works I can understand this line of code without problem when I call f "123abc345" , it returns ["1...	[ -0.00194549560546875, 0.0010223388671875, -0.023193359375, 0.006591796875, -0.0205078125, 0.01513671875, 0.009033203125, 0.017822265625, 0.0101318359375, -0.0260009765625, 0.000457763671875, 0.031005859375, 0.01055908203125, 0.005706787109375, -0.0089111328125, -0.020263671875, 0.012...	[ 52889, 4358, 47, 28219, 3642, 903, 32354, 166577, 43240, 1556, 142508, 277, 40322, 83, 14055, 15769, 5, 31251, 831, 13315, 111, 18151, 15490, 11782, 1238, 48636, 2055, 238, 96060, 30646, 7, 830, 7941, 1733, 100094, 15400, 25632, 5701, 11249...	[ 0.1409912109375, 0.1124267578125, 0.04986572265625, 0.1573486328125, 0.1185302734375, 0.132080078125, 0.1993408203125, 0.25732421875, 0.1668701171875, 0.161376953125, 0.2371826171875, 0.1376953125, 0.1632080078125, 0.1593017578125, 0.1024169921875, 0.1766357421875, 0.0614013671875, ...	embed
57129956_c2	57129956	haskell	2	5 num7 = App suc num6 num8 = App suc num7 num9 = App suc num8 num10 = App suc num9 fv (Var x) = [x] fv (Lam x e) = delete x (fv e) fv (App e1 e2) = union (fv e1) (fv e2) rename x y (Var z) \| x == z = Var y \| otherwise = Var z rename x y (Lam z e) \| x == z = Lam y (rename x y e) \| otherwise = Lam z (rename x y e) rename...	5 num7 = App suc num6 num8 = App suc num7 num9 = App suc num8 num10 = App suc num9 fv (Var x) = [x] fv (Lam x e) = delete x (fv e) fv (App e1 e2) = union (fv e1) (fv e2) rename x y (Var z) \| x == z = Var y \| otherwise = Var z rename x y (Lam z e) \| x == z = Lam y (rename x y e) \| otherwise = Lam z (rename x y e) rename...	[ 0.01043701171875, 0.0155029296875, -0.007110595703125, 0.0018310546875, 0.0201416015625, 0.01226806640625, -0.006011962890625, 0.0106201171875, 0.021728515625, 0.00860595703125, -0.01434326171875, -0.0162353515625, 0.01904296875, -0.00008821487426757812, 0.0020904541015625, -0.0234375,...	[ 190, 13269, 966, 2203, 5659, 42593, 910, 1019, 1126, 963, 1238, 334, 81827, 1022, 425, 2729, 39, 28, 154109, 15, 39179, 418, 10461, 69941, 17727, 456, 11627, 113, 97, 58745, 6, 69112, 3323, 120262, 59387, 107, 196842, 21320, 28864, 26073,...	[ 0.190185546875, 0.25732421875, 0.2298583984375, 0.1568603515625, 0.255615234375, 0.1907958984375, 0.1768798828125, 0.188232421875, 0.215087890625, 0.233642578125, 0.04132080078125, 0.1668701171875, 0.214599609375, 0.2440185546875, 0.091552734375, 0.1732177734375, 0.2076416015625, 0...	embed
64668462_c0	64668462	haskell	0	Title: haskell combinations with repetition Problem title: haskell combinations with repetition Tags: haskell Problem: haskell combinations with repetition Here is my function that generates all combinations for k items from given set: combR :: [t] -> Int -> [[t]] combR _ 0 = [ [] ] combR [] k = [] combR (x:xs) k = com...	haskell combinations with repetition haskell combinations with repetition haskell x:xs x:t k-1 haskell combinations with repetition Here is my function that generates all combinations for k items from given set: However, what it does is, that it only generates combinations without repetition and does not include those,...	[ -0.0301513671875, 0.025634765625, 0.00634765625, -0.00811767578125, 0.006622314453125, -0.004608154296875, -0.01043701171875, -0.0031280517578125, 0.00897216796875, -0.003021240234375, 0.004730224609375, -0.0028839111328125, 0.04296875, 0.02392578125, -0.01263427734375, 0.0224609375, ...	[ 1556, 142508, 162515, 678, 57346, 1363, 1022, 425, 7, 18, 472, 5759, 759, 32354, 139392, 756, 55769, 1295, 34475, 5423, 33306, 14602, 4734, 15490, 959, 26698, 5608, 119140, 107730, 375, 275, 1052, 2389, 133063, 116, 140992, 76172, 90173, 20...	[ 0.1534423828125, 0.207763671875, 0.2294921875, 0.0968017578125, 0.263427734375, 0.0204925537109375, 0.05145263671875, 0.0660400390625, 0.028106689453125, 0.065673828125, 0.119384765625, 0.13916015625, 0.0251922607421875, 0.1429443359375, 0.1646728515625, 0.057159423828125, 0.14636230...	embed
17904830_c0	17904830	haskell	0	Title: Syntactic correctness of a function Problem title: Syntactic correctness of a function Tags: haskell Problem: Syntactic correctness of a function Here is a definition of a function: fmap :: (a -> b) -> f a -> f b Can you guys explain what it means exactly? The thing I don't understand are f a and f b : why is it...	Syntactic correctness of a function Syntactic correctness of a function haskell Syntactic Syntactic correctness of a function Here is a definition of a function: Can you guys explain what it means exactly? The thing I don't understand are f a and f b : why is it possible to write this way? I mean, why is it syntaсtic c...	[ 0.006134033203125, -0.00160980224609375, -0.0115966796875, 0.005218505859375, -0.00421142578125, 0.0205078125, -0.00384521484375, 0.021240234375, 0.005615234375, 0.009033203125, -0.01043701171875, -0.03173828125, -0.00811767578125, 0.01190185546875, 0.00885009765625, -0.004791259765625...	[ 19010, 102, 49086, 26785, 7432, 111, 32354, 1556, 142508, 10, 80934, 4171, 73342, 2367, 442, 26950, 66161, 13580, 2301, 18, 28219, 1238, 136, 876, 15400, 83, 7722, 33022, 903, 3917, 6002, 9523, 9969, 1340, 5299, 5608, 4734, 1632, 77336, 3...	[ 0.1541748046875, 0.1910400390625, 0.1817626953125, 0.2244873046875, 0.07171630859375, 0.051055908203125, 0.2362060546875, 0.144287109375, 0.2109375, 0.097412109375, 0.177001953125, 0.0068359375, 0.10589599609375, 0.0482177734375, 0.06219482421875, 0.13916015625, 0.08123779296875, 0...	embed
25476248_c0	25476248	haskell	0	Title: Powerset Function 1-Liner Problem title: Powerset Function 1-Liner Tags: haskell Problem: Powerset Function 1-Liner Learn You a Haskell demonstrates the powerset function: The powerset of some set is a set of all subsets of that set. powerset :: [a] -> [[a]] powerset xs = filterM (\x -> [True, False]) xs And run...	Powerset Function 1-Liner Powerset Function 1-Liner haskell Powerset Liner Monad Bool Powerset Function 1-Liner Learn You a Haskell demonstrates the powerset function: And running it: What's going on here? I see filterM 's signature (shown below), but I don't understand how it's executing. filterM :: Monad m => (a -> m...	[ 0.0029296875, -0.00628662109375, 0.01373291015625, -0.006378173828125, 0.0045166015625, 0.006744384765625, 0.01385498046875, -0.005126953125, 0.01025390625, -0.00604248046875, 0.0001354217529296875, 0.0198974609375, -0.01611328125, -0.00173187255859375, 0.0009002685546875, 0.0235595703...	[ 17170, 3509, 28670, 4317, 93232, 42, 1556, 142508, 16777, 60331, 71, 2460, 929, 134031, 2583, 20625, 106804, 14537, 32354, 51042, 442, 4865, 7730, 98, 3688, 1957, 46312, 594, 138256, 35064, 2301, 18, 28219, 3642, 71924, 214, 1984, 347, 4435...	[ 0.2073974609375, 0.265380859375, 0.1490478515625, 0.07000732421875, 0.1658935546875, 0.06817626953125, 0.1142578125, 0.27001953125, 0.1490478515625, 0.1492919921875, 0.1365966796875, 0.09320068359375, 0.1978759765625, 0.1090087890625, 0.0733642578125, 0.1324462890625, 0.13720703125, ...	embed
46691651_c0	46691651	haskell	0	Title: Why is the definition of null function in Haskell Prelude so strange? Problem title: Why is the definition of null function in Haskell Prelude so strange? Tags: compiler-optimization, functional-programming, haskell Problem: Why is the definition of null function in Haskell Prelude so strange? The definition of ...	Why is the definition of null function in Haskell Prelude so strange? Why is the definition of null function in Haskell Prelude so strange? compiler-optimization functional-programming haskell Why Haskell Prelude Bool _:_ Why is the definition of null function in Haskell Prelude so strange? The definition of null funct...	[ 0.0115966796875, -0.001617431640625, 0.0279541015625, -0.010986328125, -0.01068115234375, 0.01043701171875, 0.010009765625, -0.024169921875, 0.00726318359375, 0.013671875, 0.010498046875, -0.01104736328125, 0.001922607421875, -0.0074462890625, 0.01116943359375, -0.01104736328125, 0.0...	[ 44084, 80934, 56574, 32354, 20625, 142508, 1914, 822, 112, 221, 114453, 9969, 34759, 100433, 123309, 1556, 2460, 929, 111, 55681, 50960, 13315, 15400, 33022, 54, 87235 ]	[ 0.065673828125, 0.1812744140625, 0.26708984375, 0.2218017578125, 0.12109375, 0.2279052734375, 0.1160888671875, 0.17529296875, 0.13720703125, 0.06280517578125, 0.1400146484375, 0.0794677734375, 0.0989990234375, 0.0765380859375, 0.096435546875, 0.0667724609375, 0.06768798828125, 0.13...	embed

58056158_c0

58056158

haskell

0

Title: How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windows)? Problem title: How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windows)? Tags: haskell-stack, haskell Problem: How can I solve this problem The GHC located at ___ failed to comp...

How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windows)? How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windows)? haskell-stack haskell How GHC ___ How can I solve this problem The GHC located at ___ failed to compile a sanity check. (windo...

[ 0.00372314453125, 0.00927734375, 0.00714111328125, 0.00372314453125, -0.000850677490234375, 0.01080322265625, -0.0189208984375, -0.0023956298828125, -0.0269775390625, 0.0019989013671875, -0.008544921875, -0.01300048828125, 0.02197265625, 0.0032806396484375, 0.007568359375, 0.0125732421...

[ 11249, 831, 86869, 903, 2967, 581, 527, 73265, 105866, 99, 116185, 165523, 47, 9969, 1340, 10, 112243, 53, 12765, 229792, 1556, 142508, 590, 2594, 31577, 4527, 98, 3773, 678, 21176, 12275, 18151, 87, 169581, 18499 ]

[ 0.06353759765625, 0.0147705078125, 0.162841796875, 0.08251953125, 0.148193359375, 0.0283050537109375, 0.1229248046875, 0.2335205078125, 0.16943359375, 0.1112060546875, 0.10302734375, 0.2003173828125, 0.01361083984375, 0.16015625, 0.1507568359375, 0.026397705078125, 0.2022705078125, ...

embed

61806668_c0

61806668

haskell

0

Title: Basic Implementation of Equals in Haskell Problem title: Basic Implementation of Equals in Haskell Tags: haskell Problem: Basic Implementation of Equals in Haskell I have something like data Example = Ex Integer How would I go about implementing equals for this? Furthest I have gotten is instance Eq Example wher...

Basic Implementation of Equals in Haskell Basic Implementation of Equals in Haskell haskell Basic Implementation Equals Haskell Example Integer Basic Implementation of Equals in Haskell I have something like How would I go about implementing equals for this? Furthest I have gotten is But that is wrong because that alwa...

[ -0.0016021728515625, 0.0198974609375, 0.0198974609375, 0.011474609375, 0.0040283203125, 0.01556396484375, -0.000942230224609375, -0.01446533203125, 0.00799560546875, 0.02392578125, 0.006072998046875, -0.027099609375, 0.0142822265625, 0.023193359375, -0.017578125, 0.0081787109375, 0.0...

[ 91692, 153941, 241, 71723, 7, 23, 20625, 142508, 2320, 1556, 89536, 44401, 11249, 2806, 1672, 29479, 214, 105950, 100, 903, 44691, 11343, 151575, 47, 29568, 5809, 3884, 122776, 110527, 892, 1505, 64457, 454, 62816, 11907 ]

[ 0.1710205078125, 0.1962890625, 0.10546875, 0.2235107421875, 0.132080078125, 0.0670166015625, 0.162353515625, 0.237060546875, 0.005767822265625, 0.1544189453125, 0.10174560546875, 0.1636962890625, 0.01959228515625, 0.01312255859375, 0.03466796875, 0.2022705078125, 0.004547119140625, ...

embed

61829221_c1

61829221

haskell

1

that I have cloned and dropped into my project (in the "static" directory): https://github.com/jgthms/bulma/blob/master/css/bulma.css I do not understand why the "button is-primary" and "button is-link" parts are not applying correctly. Other parts of bulma.css seem to be applying, as the fonts of the text are from bu...

[ 0.0001735687255859375, 0.0130615234375, 0.0164794921875, 0.0281982421875, 0.0019073486328125, 0.0128173828125, -0.0032196044921875, -0.0223388671875, -0.0123291015625, -0.01318359375, -0.0296630859375, -0.01348876953125, 0.00213623046875, -0.0098876953125, -0.0186767578125, -0.01757812...

[ 765, 20450, 14534, 136, 36069, 20051, 3934, 13452, 201939, 14364, 15769, 32102, 170, 18337, 8516, 192, 12986, 275, 47327, 4439, 959, 28219, 15400, 8789, 1507, 83, 44526, 1294, 10187, 63920, 59911, 214, 26785, 64511, 183685, 7, 12401, 7986, ...

[ 0.003631591796875, 0.1507568359375, 0.08843994140625, 0.034942626953125, 0.08380126953125, 0.015594482421875, 0.05291748046875, 0.136474609375, 0.15185546875, 0.046112060546875, 0.06494140625, 0.144775390625, 0.001220703125, 0.078125, 0.139404296875, 0.2227783203125, 0.073486328125, ...

embed

61875223_c0

61875223

haskell

0

Title: How to turn all pedantic mode for hie in haskell? Problem title: How to turn all pedantic mode for hie in haskell? Tags: haskell-ide-engine, haskell Problem: How to turn all pedantic mode for hie in haskell? Is it possible to somehow pass --pedantic (as in stack build --pedantic) switch to Haskell-ide-engine? I'...

How to turn all pedantic mode for hie in haskell? How to turn all pedantic mode for hie in haskell? haskell-ide-engine haskell How How to turn all pedantic mode for hie in haskell? Is it possible to somehow pass --pedantic (as in stack build --pedantic) switch to Haskell-ide-engine? I'd like to see more errors in IDE d...

[ -0.007598876953125, -0.0137939453125, 0.00689697265625, -0.0091552734375, 0.00023365020751953125, 0.031982421875, 0.004119873046875, 0.019775390625, -0.018310546875, -0.038330078125, 0.01068115234375, -0.0203857421875, 0.01007080078125, 0.0191650390625, -0.0057373046875, 0.000816345214...

[ 11249, 47, 15504, 756, 50426, 109109, 13736, 100, 51965, 23, 1556, 142508, 2506, 128897, 7722, 209303, 27875, 4210, 20051, 177261, 45367, 101089, 20625, 1884, 1957, 1286, 18499, 36497, 20271, 9969, 1340, 1733, 46876, 351, 18391, 7225, 103510, ...

[ 0.09429931640625, 0.0494384765625, 0.1690673828125, 0.1390380859375, 0.1888427734375, 0.20458984375, 0.186767578125, 0.058074951171875, 0.266357421875, 0.08831787109375, 0.16162109375, 0.2447509765625, 0.2078857421875, 0.196044921875, 0.0694580078125, 0.032989501953125, 0.10876464843...

embed

6396672_c0

6396672

haskell

0

Title: Haskell string to list Problem title: Haskell string to list Tags: haskell Problem: Haskell string to list ["6","","[[1,2,3,4,5,6],[7,8,9,10,11,12],[13,14,15,16,17,18],[19,20,21,22,23,24],[25,26,27,28,29,30],[31,32,33,34,35,36]]"] I must get from this 6 and [[1,2,3,4,5,6],[7,8,9,10,11,12],[13,14,15,16,17,18],[19...

Haskell string to list Haskell string to list haskell Haskell Haskell string to list ["6","","[[1,2,3,4,5,6],[7,8,9,10,11,12],[13,14,15,16,17,18],[19,20,21,22,23,24],[25,26,27,28,29,30],[31,32,33,34,35,36]]"] I must get from this 6 and [[1,2,3,4,5,6],[7,8,9,10,11,12],[13,14,15,16,17,18],[19,20,21,22,23,24],[25,26,27,28...

[ 0.00482177734375, -0.005340576171875, -0.017578125, 0.0162353515625, -0.005279541015625, 0.0225830078125, 0.000518798828125, -0.010009765625, -0.00250244140625, -0.0096435546875, -0.0003509521484375, -0.04736328125, -0.0113525390625, 0.0034332275390625, -0.0040283203125, -0.00011157989...

[ 20625, 142508, 79315, 47, 5303, 1556, 378, 58, 910, 830, 1065, 133063, 4, 82449, 104629, 268, 966, 145180, 963, 1662, 1530, 2681, 2592, 1837, 2485, 2489, 1819, 2947, 1549, 3117, 4015, 3742, 2357, 2588, 4046, 3768, 3882, 4235, 1197, 5016, ...

[ 0.20263671875, 0.2705078125, 0.306396484375, 0.129150390625, 0.280029296875, 0.2001953125, 0.0125732421875, 0.0192718505859375, 0.2322998046875, 0.043670654296875, 0.0139617919921875, 0.141357421875, 0.014190673828125, 0.1900634765625, 0.2137451171875, 0.00677490234375, 0.06372070312...

embed

12442671_c0

12442671

haskell

0

Title: How do closures work in Haskell? Problem title: How do closures work in Haskell? Tags: haskell Problem: How do closures work in Haskell? I'm reading about the math foundation behind Haskell - I've learned about how closures can be used to save state in a function. I was wondering if Haskell allows closures, and ...

How do closures work in Haskell? How do closures work in Haskell? haskell How Haskell How do closures work in Haskell? I'm reading about the math foundation behind Haskell - I've learned about how closures can be used to save state in a function. I was wondering if Haskell allows closures, and how they work because the...

[ 0.00799560546875, 0.020751953125, 0.0159912109375, 0.0021820068359375, 0.01287841796875, 0.0030517578125, -0.004730224609375, -0.00157928466796875, 0.005706787109375, -0.0017547607421875, -0.00787353515625, -0.01373291015625, -0.003997802734375, 0.0084228515625, 0.0198974609375, -0.005...

[ 11249, 54, 6, 170224, 7, 4488, 23, 20625, 142508, 1556, 48909, 137374, 50155, 3642, 831, 11814, 47, 30098, 11341, 32354, 114864, 959, 34166, 73197, 155738, 5465, 87709, 68772, 12921, 140992, 31943, 107730, 2967, 456, 162, 31304, 77336, 7103, ...

[ 0.09521484375, 0.051788330078125, 0.0184783935546875, 0.267822265625, 0.1595458984375, 0.1614990234375, 0.0916748046875, 0.1444091796875, 0.240478515625, 0.1290283203125, 0.046844482421875, 0.0809326171875, 0.025543212890625, 0.02801513671875, 0.018035888671875, 0.08203125, 0.0141601...

embed

52115153_c0

52115153

haskell

0

Title: Passing RTS-opts to `stack test` Problem title: Passing RTS-opts to `stack test` Tags: haskell-stack, haskell Problem: Passing RTS-opts to `stack test` How can I pass RTS options to the test-suite of my project using stack? stack exec allows for passing options to the executable, but since stack test is a synony...

Passing RTS-opts to `stack test` Passing RTS-opts to `stack test` haskell-stack haskell Passing RTS-opts Passing RTS-opts to `stack test` How can I pass RTS options to the test-suite of my project using stack? stack exec allows for passing options to the executable, but since stack test is a synonym for stack build --t...

[ 0.0016632080078125, 0.0074462890625, -0.018798828125, -0.013671875, 0.003082275390625, -0.03173828125, -0.0164794921875, 0.00176239013671875, -0.01495361328125, -0.0179443359375, -0.007598876953125, 0.0228271484375, 0.011474609375, 0.0107421875, -0.0052490234375, 0.0272216796875, 0.0...

[ 28872, 27389, 294, 2146, 933, 47, 590, 2594, 3034, 1556, 142508, 831, 27875, 50717, 68879, 13, 13452, 177261, 1119, 3240, 114864, 452, 71924, 2886, 164661, 45367, 6954, 163846, 139392, 821, 58627, 51727, 105609, 140992, 35829, 170, 527, 73265...

[ 0.1146240234375, 0.174072265625, 0.173828125, 0.1507568359375, 0.0693359375, 0.0654296875, 0.1253662109375, 0.1142578125, 0.2275390625, 0.058074951171875, 0.1490478515625, 0.003875732421875, 0.135986328125, 0.21142578125, 0.13037109375, 0.0194854736328125, 0.0872802734375, 0.218994...

embed

28238177_c0

28238177

haskell

0

Title: Distributing cabal sandboxes Problem title: Distributing cabal sandboxes Tags: cabal, haskell Problem: Distributing cabal sandboxes I have a program that uses GHC-API to work with Haskell source files. The source files import modules from specific cabal-packages, which means that the cabal packages must be insta...

Distributing cabal sandboxes Distributing cabal sandboxes cabal haskell Distributing Distributing cabal sandboxes I have a program that uses GHC-API to work with Haskell source files. The source files import modules from specific cabal-packages, which means that the cabal packages must be installed to the system where ...

[ 0.0087890625, -0.0038604736328125, 0.00909423828125, -0.000766754150390625, -0.01806640625, -0.0022430419921875, -0.0004520416259765625, 0.0181884765625, 0.006805419921875, -0.00457763671875, 0.01470947265625, -0.0211181640625, -0.0111083984375, 0.01153564453125, 0.003204345703125, 0.0...

[ 75571, 1916, 109524, 19096, 11728, 90, 1556, 142508, 1528, 4527, 527, 73265, 9, 74220, 4488, 678, 20625, 31344, 102158, 24927, 88996, 29458, 29102, 98169, 8110, 20600, 5426, 13028, 28, 1544, 525, 3917, 47, 15917, 67, 759, 959, 1884, 31380, ...

[ 0.23876953125, 0.0560302734375, 0.262939453125, 0.1712646484375, 0.240478515625, 0.04547119140625, 0.1407470703125, 0.23046875, 0.18310546875, 0.048858642578125, 0.09375, 0.1895751953125, 0.0281982421875, 0.183837890625, 0.043365478515625, 0.06903076171875, 0.121826171875, 0.140991...

embed

45918288_c0

45918288

haskell

0

Title: What are 'Latch' and 'Pulse' in reactive-banana? Problem title: What are 'Latch' and 'Pulse' in reactive-banana? Tags: reactive-banana, reactive-programming, frp, haskell Problem: What are 'Latch' and 'Pulse' in reactive-banana? Do the Latch and Pulse types exist in FRP li...

What are 'Latch' and 'Pulse' in reactive-banana? What are 'Latch' and 'Pulse' in reactive-banana? reactive-banana reactive-programming frp haskell What Latch Pulse What are 'Latch' and 'Pulse' in reactive-banana? Do the Latch and Pulse types exist in FRP literature, or are they a...

[ 0.006805419921875, 0.0013427734375, -0.01263427734375, 0.01123046875, -0.011962890625, 0, -0.0009002685546875, 0.0274658203125, -0.0035247802734375, -0.015625, 0.0040283203125, -0.033203125, -0.021240234375, 0.005615234375, -0.00079345703125, 0.0113525390625, 0.0062255859375, 0.004...

[ 4865, 621, 3768, 2729, 18, 206, 136, 27559, 11971, 23, 456, 71232, 105281, 11, 28966, 14119, 254, 1556, 142508, 75346, 21694, 184, 52895, 32316, 563, 38796, 163136, 57241, 42179, 16487, 1836, 166904, 42518, 873, 98409, 36943, 1884, 3714, 60...

[ 0.06085205078125, 0.045745849609375, 0.054931640625, 0.1021728515625, 0.104736328125, 0.2069091796875, 0.1517333984375, 0.208984375, 0.2060546875, 0.03955078125, 0.1142578125, 0.213623046875, 0.191162109375, 0.166748046875, 0.11962890625, 0.048583984375, 0.0966796875, 0.06628417968...

embed

46626507_c1

46626507

haskell

1

Lam (Leaf) = 0 countLam (NodeOne a) = 1 + countLam a countLam (NodeTwo a b) = countLam a + countLam b countLeaf :: Tree a -> Int countLeaf (Leaf) = 1 countLeaf (NodeOne a) = countLeaf a countLeaf (NodeTwo a b) = countLeaf a + countLeaf b This attempt fails ofcourse. I don't know how to decrement the counter(s) for the ...

[ 0.018798828125, 0.01019287109375, -0.0133056640625, 0.01312255859375, 0.030029296875, 0.003997802734375, -0.0031280517578125, -0.01556396484375, 0.0093994140625, -0.04833984375, -0.00848388671875, -0.0028076171875, 0.01239013671875, 0.0029144287109375, 0.022216796875, -0.01409912109375...

[ 59387, 5267, 2407, 757, 54529, 2729, 39, 5021, 112, 62068, 10, 106, 997, 3613, 876, 101344, 360, 81887, 35782, 3714, 3642, 8, 7612, 674, 70, 105416, 110, 195625, 1830, 32354, 2046, 41170, 988, 14507, 56073, 4527, 28282, 122799, 53201, 449...

[ 0.1973876953125, 0.0916748046875, 0.198486328125, 0.105224609375, 0.1463623046875, 0.0418701171875, 0.145263671875, 0.1234130859375, 0.1453857421875, 0.1568603515625, 0.048583984375, 0.037811279296875, 0.06854248046875, 0.13720703125, 0.052490234375, 0.1885986328125, 0.00482177734375...

embed

58715748_c0

58715748

haskell

0

Title: Is there a turtle function or other Haskell abstraction for joining commands using .&& Problem title: Is there a turtle function or other Haskell abstraction for joining commands using .&& Tags: haskell, haskell-turtle Problem: Is there a turtle function or other Haskell abstraction for joining c...

Is there a turtle function or other Haskell abstraction for joining commands using .&& Is there a turtle function or other Haskell abstraction for joining commands using .&& haskell haskell-turtle Haskell ExitSuccess Is there a turtle function or other Haskell abstraction for joining commands using .&& ...

[ 0.0038604736328125, -0.0026397705078125, -0.0023345947265625, 0.029541015625, 0.002777099609375, 0.001373291015625, -0.0137939453125, -0.0252685546875, -0.0000514984130859375, -0.000064849853515625, 0.000286102294921875, 0.011962890625, -0.0028839111328125, 0.00518798828125, -0.018432617...

[ 2071, 2685, 2130, 17991, 32354, 707, 3789, 20625, 142508, 164789, 1830, 100, 33284, 214, 75101, 17368, 5, 1230, 10, 1556, 987, 5443, 217, 14168, 238, 26531, 18151, 4527, 242, 39933, 11522, 59911, 50339, 3060, 54686, 194583, 79459, 7 ]

[ 0.025177001953125, 0.0528564453125, 0.1597900390625, 0.2149658203125, 0.18701171875, 0.010284423828125, 0.01641845703125, 0.08575439453125, 0.2144775390625, 0.1788330078125, 0.08331298828125, 0.000274658203125, 0.1751708984375, 0.048858642578125, 0.2161865234375, 0.060089111328125, 0...

embed

10786485_c1

10786485

haskell

1

even though y and w are both in their correct places in the lambda-expressions, how would the program "know" that the first y represents the first w and the second y represents the second w . I would need to be consistent about this in an implementation. In short, how would I go about implementing an error-free versio...

[ -0.006103515625, 0.005584716796875, -0.00006198883056640625, 0.0047607421875, -0.006256103515625, -0.004852294921875, 0.000102996826171875, 0.01141357421875, 0.01483154296875, 0.0191650390625, 0.000690460205078125, -0.01409912109375, 0.006866455078125, -0.0186767578125, 0.004425048828125...

[ 113, 136, 148, 15044, 23, 26785, 44677, 70, 21, 6492, 85, 204629, 3642, 2806, 1528, 69723, 450, 5117, 33636, 7, 17932, 74729, 208124, 1672, 29479, 18499, 9, 32087, 11389, 32354, 83, 6210, 14612, 11935, 38242, 2517, 24763, 91736, 28960, 44...

[ 0.177001953125, 0.0743408203125, 0.1837158203125, 0.07220458984375, 0.03375244140625, 0.1552734375, 0.123046875, 0.00311279296875, 0.07025146484375, 0.196533203125, 0.162353515625, 0.1802978515625, 0.046142578125, 0.0202789306640625, 0.1632080078125, 0.1678466796875, 0.0355224609375,...

embed

35534795_c0

35534795

haskell

0

Title: Can't display unicode Problem title: Can't display unicode Tags: haskell, unicode, ghc Problem: Can't display unicode I have a feeling that this has already been answered somewhere: if so I apologise. I am trying to use an executable that writes Unicode characters to standard output. All I get is this ...

Can't display unicode Can't display unicode haskell unicode ghc Can Can't display unicode I have a feeling that this has already been answered somewhere: if so I apologise. I am trying to use an executable that writes Unicode characters to standard output. All I get is this error message (hPutChar from Haskel...

[ 0.0081787109375, 0.018310546875, 0.0162353515625, -0.01263427734375, 0.004730224609375, 0.01214599609375, 0.0167236328125, 0.0015106201171875, -0.0147705078125, 0.032470703125, -0.01519775390625, -0.019775390625, 0.00921630859375, 0.01239013671875, -0.0264892578125, 0.00946044921875, ...

[ 4171, 3768, 18, 44116, 60347, 112, 1556, 142508, 31380, 238, 194663, 12524, 31577, 4527, 71924, 2886, 33022, 219778, 124850, 47, 5570, 140992, 3164, 903, 18499, 26008, 127, 27559, 84068, 1295, 20625, 34735, 959, 5665, 87, 53418, 15549, 2367, ...

[ 0.090576171875, 0.10125732421875, 0.0816650390625, 0.214111328125, 0.2122802734375, 0.1719970703125, 0.1400146484375, 0.2442626953125, 0.1171875, 0.0823974609375, 0.010223388671875, 0.0206146240234375, 0.06927490234375, 0.037841796875, 0.1370849609375, 0.126220703125, 0.0565795898437...

embed

1834169_c0

1834169

haskell

0

Title: Mapping the :edit command to a certain editor Problem title: Mapping the :edit command to a certain editor Tags: emacs, haskell Problem: Mapping the :edit command to a certain editor I've got the Haskell interpreter running in Emacs. With this I've got the typical Emacs setup of 2 open windows, the source file I...

Mapping the :edit command to a certain editor Mapping the :edit command to a certain editor emacs haskell Mapping Mapping the :edit command to a certain editor I've got the Haskell interpreter running in Emacs. With this I've got the typical Emacs setup of 2 open windows, the source file I'm editing the Haskell interpr...

[ 0.00933837890625, -0.00421142578125, 0.00007486343383789062, -0.00872802734375, -0.0076904296875, 0.0206298828125, -0.01043701171875, 0.0028839111328125, 0.00921630859375, -0.04833984375, 0.007232666015625, -0.01123046875, 0.0042724609375, 0.01495361328125, -0.003143310546875, -0.00817...

[ 911, 26783, 152, 45082, 75101, 47, 24233, 30391, 352, 2263, 1556, 142508, 20625, 29481, 56, 51042, 85269, 4439, 222201, 169581, 116, 9803, 54825, 31344, 11435, 27211, 14192, 18622, 4299, 3917, 22288, 4527, 64457, 127, 7, 111938, 291, 48398, ...

[ 0.1937255859375, 0.06427001953125, 0.07568359375, 0.260009765625, 0.1881103515625, 0.0802001953125, 0.06671142578125, 0.19580078125, 0.06890869140625, 0.07861328125, 0.1112060546875, 0.218017578125, 0.1124267578125, 0.1707763671875, 0.0938720703125, 0.017120361328125, 0.1639404296875...

embed

23901801_c0

23901801

haskell

0

Title: Why can't a monad be decomposed? Problem title: Why can't a monad be decomposed? Tags: monads, happstack, io, haskell Problem: Why can't a monad be decomposed? I don't understand why I can't decompose a (let's say IO) monad. Like IO a -> a ? My question originated when using happstack and wanting to ge...

Why can't a monad be decomposed? Why can't a monad be decomposed? monads happstack io haskell Why Text ServerPart Maybe Why can't a monad be decomposed? I don't understand why I can't decompose a (let's say IO) monad. Like IO a -> a ? My question originated when using happstack and wanting to get the Text out...

[ -0.0027923583984375, 0.0054931640625, 0.00543212890625, 0.04345703125, 0.000904083251953125, 0.00933837890625, 0.0040283203125, -0.009521484375, -0.004547119140625, -0.01348876953125, 0.0037841796875, -0.0157470703125, -0.000667572021484375, 0.00537109375, 0.00616455078125, -0.00300598...

[ 44084, 831, 3768, 18, 2667, 712, 186, 8, 277, 144429, 256, 6366, 590, 2594, 22995, 1556, 142508, 24129, 22687, 58229, 83425, 10, 28219, 15400, 78381, 17780, 33079, 62038, 17368, 2046, 1810, 176377, 109585, 3650, 6713, 174379, 56206, 37629, ...

[ 0.139404296875, 0.1302490234375, 0.03985595703125, 0.12939453125, 0.1693115234375, 0.2459716796875, 0.06201171875, 0.181884765625, 0.1834716796875, 0.1846923828125, 0.06683349609375, 0.080322265625, 0.128173828125, 0.10516357421875, 0.180419921875, 0.076416015625, 0.1990966796875, ...

embed

74376390_c0

74376390

haskell

0

Title: Time complexity of a haskell function Problem title: Time complexity of a haskell function Tags: time-complexity, haskell Problem: Time complexity of a haskell function Consider the following code for a function isPrime. f :: Integer -> Integer f n = head (filter isPrime [0..n]) Assuming that isPrime k computes ...

Time complexity of a haskell function Time complexity of a haskell function time-complexity haskell Time Integer Time complexity of a haskell function Consider the following code for a function isPrime. Assuming that isPrime k computes a boolean in O(k) time, what is the time complexity of f n ? My thought process was ...

[ -0.01611328125, 0.0196533203125, 0.015625, -0.00150299072265625, 0.01385498046875, -0.00946044921875, 0.0233154296875, -0.0201416015625, -0.01361083984375, -0.0517578125, 0.0135498046875, 0.00164794921875, -0.0076904296875, -0.0009765625, -0.01177978515625, 0.0078125, 0.0294189453125...

[ 19055, 27140, 2481, 1556, 142508, 32354, 111, 1733, 277, 44974, 44401, 137399, 25632, 18151, 83, 145111, 13, 66596, 472, 375, 7077, 337, 31, 34677, 180, 92, 2367, 70, 1238, 653, 17569, 9433, 46312, 192617, 5608, 19, 5, 26785, 23468, 36298...

[ 0.1708984375, 0.229736328125, 0.12939453125, 0.1627197265625, 0.2587890625, 0.1881103515625, 0.046142578125, 0.19580078125, 0.05810546875, 0.170654296875, 0.1470947265625, 0.011138916015625, 0.00921630859375, 0.1568603515625, 0.12841796875, 0.188232421875, 0.10443115234375, 0.03384...

embed

49508251_c1

49508251

haskell

1

x -- problem is in this leftover (x, xs) -> do yield x leftover $ BS.tail xs message The idea I had is that if there is nothing coming from the upstream combinator will have to wait until there will be something, such that it can send a complete message downstream. But it seams that conduit starts spinning on CPU a lo...

[ 0.004669189453125, 0.0205078125, -0.005767822265625, 0.012939453125, 0.002960205078125, -0.000957489013671875, 0.0169677734375, -0.0281982421875, 0.01324462890625, -0.0123291015625, -0.00958251953125, -0.00121307373046875, 0.036865234375, 0.0230712890625, 0.0074462890625, 0.01031494140...

[ 1022, 4210, 2967, 83, 23, 903, 25737, 5465, 425, 7, 54, 11180, 19388, 3650, 84145, 46741, 26008, 6528, 1902, 33720, 38162, 1257, 86429, 22321, 1290, 40485, 24189, 9844, 25379, 28484, 7565, 40, 8256, 120565, 4034, 25927, 592, 98, 86039, 59...

[ 0.1522216796875, 0.027557373046875, 0.1773681640625, 0.044342041015625, 0.06439208984375, 0.109375, 0.1865234375, 0.2164306640625, 0.1177978515625, 0.1173095703125, 0.074951171875, 0.1700439453125, 0.229248046875, 0.10015869140625, 0.101318359375, 0.2166748046875, 0.129638671875, 0...

embed

7669658_c0

7669658

haskell

0

Title: Haskell Peano Numbers Problem title: Haskell Peano Numbers Tags: peano-numbers, integer, haskell Problem: Haskell Peano Numbers I'm trying to write a function toPeano :: Int -> Nat toPeano n = that turns an Integer into its Peano Number. I have the data: data Nat = Zero | Succ Nat deriving Show For example, toPe...

Haskell Peano Numbers Haskell Peano Numbers peano-numbers integer haskell Haskell Peano Numbers Nat Zero Succ Show Haskell Peano Numbers I'm trying to write a function that turns an Integer into its Peano Number. I have the data: For example, and so on. I have no idea how to get it to print out the Peano Numbers given ...

[ -0.01708984375, -0.0118408203125, 0.00787353515625, 0.0089111328125, -0.0159912109375, 0.03076171875, 0.0172119140625, 0.006103515625, -0.00994873046875, -0.009765625, -0.0079345703125, -0.02490234375, -0.00836181640625, 0.0264892578125, -0.0142822265625, 0.01312255859375, 0.00092697...

[ 20625, 142508, 1460, 3922, 103332, 7, 280, 9, 2606, 1297, 892, 1505, 1556, 68875, 83947, 1832, 10060, 17367, 87, 31577, 33022, 32354, 15504, 44401, 3934, 6863, 765, 2053, 27781, 221, 98, 110, 6528, 3642, 2046, 442, 47, 28412, 1810, 70, ...

[ 0.158935546875, 0.27099609375, 0.20703125, 0.30517578125, 0.25, 0.0792236328125, 0.16748046875, 0.0310821533203125, 0.190185546875, 0.195068359375, 0.1484375, 0.1553955078125, 0.126953125, 0.189453125, 0.205078125, 0.1370849609375, 0.1651611328125, 0.17724609375, 0.02264404296875...

embed

69201225_c0

69201225

haskell

0

Title: Undoing a prefix sum Problem title: Undoing a prefix sum Tags: haskell, prefix-sum Problem: Undoing a prefix sum The simple way to calculate a prefix sum in Haskell is scanl1 (+) [1,2,3,4,5,6] which produces the output [1,3,6,10,15,21] I needed to write the inverse, and this is what I came up with: undo_prefix_s...

Undoing a prefix sum Undoing a prefix sum haskell prefix-sum Undoing scanl1 undo_prefix_sum Num Undoing a prefix sum The simple way to calculate a prefix sum in Haskell is which produces the output I needed to write the inverse, and this is what I came up with: This seems to be correct (but I might have missed somethin...

[ -0.0087890625, 0.0228271484375, 0.0186767578125, 0.0174560546875, -0.01318359375, 0.0037078857421875, -0.0147705078125, 0.01361083984375, 0.00058746337890625, -0.017822265625, -0.000591278076171875, -0.00958251953125, -0.00080108642578125, 0.01458740234375, 0.00347900390625, 0.01110839...

[ 5533, 31, 183114, 10554, 1556, 142508, 11832, 44954, 141, 418, 165, 4692, 55923, 52782, 8781, 3917, 74481, 67, 10, 23, 20625, 27489, 140992, 44841, 33022, 37676, 1257, 678, 37202, 26785, 13648, 156304, 93766, 54, 903, 17368 ]

[ 0.1431884765625, 0.151123046875, 0.2410888671875, 0.22509765625, 0.12841796875, 0.2415771484375, 0.2178955078125, 0.1395263671875, 0.0777587890625, 0.02020263671875, 0.1422119140625, 0.0693359375, 0.1710205078125, 0.1103515625, 0.1142578125, 0.0345458984375, 0.1749267578125, 0.0420...

embed

31145309_c0

31145309

haskell

0

Title: Type classes - Brief Explanation Problem title: Type classes - Brief Explanation Tags: haskell, typeclass, types Problem: Type classes - Brief Explanation I am new to Haskell and i come from c++ background. I am having some trouble understanding the relation between types and type classes. From what i understand...

Type classes - Brief Explanation Type classes - Brief Explanation haskell typeclass types Type Brief Explanation Type classes - Brief Explanation I am new to Haskell and i come from c++ background. I am having some trouble understanding the relation between types and type classes. From what i understand type classes sp...

[ 0.01513671875, 0.0238037109375, 0.0054931640625, 0.0169677734375, 0.007659912109375, 0.00457763671875, 0.00775146484375, 0.008056640625, -0.0029449462890625, -0.0034027099609375, -0.0137939453125, -0.0272216796875, 0.005706787109375, 0.00982666015625, -0.01239013671875, 0.0164794921875...

[ 60457, 61112, 101936, 5443, 5868, 20, 1556, 142508, 10644, 67413, 52895, 3525, 20625, 37223, 76615, 63134, 100094, 41911, 17721, 136, 28219, 40140, 147306, 32354, 70, 864, 18507, 58735, 69112, 248, 1369, 139124, 808, 29459, 5154, 83, 110527, ...

[ 0.2646484375, 0.26953125, 0.16064453125, 0.03436279296875, 0.1495361328125, 0.00836181640625, 0.1217041015625, 0.1973876953125, 0.26611328125, 0.26318359375, 0.25830078125, 0.0280609130859375, 0.1043701171875, 0.123046875, 0.051971435546875, 0.0288848876953125, 0.057220458984375, 0...

embed

31598608_c0

31598608

haskell

0

Title: compare contents of Either type Problem title: compare contents of Either type Tags: haskell Problem: compare contents of Either type is there a way to use pattern wildcards for type constructors to make this ugly code shorter: eitherCompare (Left a) (Left b) = compare a b eitherCompare (Left a) (Right b) = comp...

compare contents of Either type compare contents of Either type haskell Either Left Right Ord Ordering compare contents of Either type is there a way to use pattern wildcards for type constructors to make this ugly code shorter: something like (which won't compile) or some other method?

[ -0.0081787109375, -0.01263427734375, -0.0128173828125, -0.007781982421875, -0.00531005859375, -0.00604248046875, -0.0086669921875, -0.0230712890625, -0.0002841949462890625, 0.0169677734375, 0.0191650390625, -0.00494384765625, 0.0140380859375, -0.0120849609375, -0.002471923828125, -0.02...

[ 69101, 10941, 4565, 9319, 10644, 1556, 142508, 2480, 90911, 35379, 81206, 3917, 4527, 103510, 56409, 38931, 64549, 25251, 3249, 75, 110608, 18151, 16610, 56, 23742, 18, 9969, 1340, 55300 ]

[ 0.1522216796875, 0.169921875, 0.03216552734375, 0.1539306640625, 0.17529296875, 0.096435546875, 0.1907958984375, 0.034637451171875, 0.0732421875, 0.1409912109375, 0.1419677734375, 0.0177001953125, 0.0219573974609375, 0.1636962890625, 0.11883544921875, 0.21728515625, 0.111328125, 0....

embed

6292613_c0

6292613

haskell

0

Title: a Haskell program using Head and Tail to relate 2 strings Problem title: a Haskell program using Head and Tail to relate 2 strings Tags: haskell Problem: a Haskell program using Head and Tail to relate 2 strings I need to determine whether a string is a substring of another string. I think is comparing the head ...

a Haskell program using Head and Tail to relate 2 strings a Haskell program using Head and Tail to relate 2 strings haskell Head Haskell Tail a Haskell program using Head and Tail to relate 2 strings I need to determine whether a string is a substring of another string. I think is comparing the head of one string with ...

[ 0.0274658203125, -0.000644683837890625, -0.0135498046875, 0.02783203125, -0.0108642578125, 0.0189208984375, 0.0184326171875, 0.00445556640625, 0.0098876953125, -0.0098876953125, 0.008056640625, -0.005340576171875, -0.005126953125, 0.0194091796875, -0.006683349609375, -0.01123046875, ...

[ 20625, 142508, 1528, 17368, 44816, 136, 1218, 379, 33444, 13, 116, 79315, 10, 1556, 3871, 47, 83324, 36766, 83, 1614, 91693, 111, 15700, 5351, 37397, 10336, 1632, 678, 46741, 69101, 12638, 12830, 119131, 7, 5281, 3789, 44841, 4358, 32354, ...

[ 0.1434326171875, 0.2362060546875, 0.1798095703125, 0.0712890625, 0.221435546875, 0.148193359375, 0.1719970703125, 0.1448974609375, 0.1834716796875, 0.0966796875, 0.10540771484375, 0.2144775390625, 0.04888916015625, 0.129150390625, 0.06756591796875, 0.052947998046875, 0.1837158203125,...

embed

35364007_c0

35364007

haskell

0

Title: getLine doesn't stop Problem title: getLine doesn't stop Tags: user-input, haskell, ghc Problem: getLine doesn't stop My program goes something like main :: IO String main = do putStrLn "input a" a <- getChar putStrLn "input b" b <- getLine putStrLn "input c" c <- getChar return a:c:b Behaviour: I get ...

getLine doesn't stop getLine doesn't stop user-input haskell ghc a:c:b getLine doesn't stop My program goes something like Behaviour: I get "input a" printed, and the program waits for me to type a Char and press return. From there, it scrolls past getLine without ever letting me input something. How can I ma...

[ 0.003204345703125, 0.005401611328125, 0.00469970703125, 0.0147705078125, -0.01153564453125, -0.00010442733764648438, 0.0228271484375, -0.007568359375, 0.004486083984375, -0.03173828125, 0.015869140625, -0.0096435546875, -0.02099609375, 0.007232666015625, -0.00909423828125, -0.001785278...

[ 2046, 93232, 22027, 3768, 18, 7279, 38937, 73, 7077, 1556, 142508, 31380, 238, 10, 275, 1528, 60899, 873, 98409, 34639, 28412, 40485, 10644, 21656, 24234, 30646, 192046, 11015, 15490, 17669, 95, 19514, 107730, 9844, 3249, 54, 150661, 44402, ...

[ 0.1556396484375, 0.28515625, 0.09564208984375, 0.0654296875, 0.0899658203125, 0.201416015625, 0.1192626953125, 0.06976318359375, 0.11181640625, 0.1055908203125, 0.2095947265625, 0.06573486328125, 0.032745361328125, 0.09393310546875, 0.022918701171875, 0.139892578125, 0.01837158203125...

embed

15491707_c0

15491707

haskell

0

Title: Could not deduce (Eq a), adding Eq to typeclass Problem title: Could not deduce (Eq a), adding Eq to typeclass Tags: haskell Problem: Could not deduce (Eq a), adding Eq to typeclass v ^/ a = (1/a) *^ v negateVector v = (-1) *^ v v1 ^-^ _ = v1 ^+^ v1 -- (negateVector v2) norm v = sqrt (v `dot` v) normalize v = if...

Could not deduce (Eq a), adding Eq to typeclass Could not deduce (Eq a), adding Eq to typeclass haskell a the Could AFRPVectorSpace.hs:51:25 VectorSpace AFRPVectorSpace.hs Possible Floating Deriving Could not deduce (Eq a), adding Eq to typeclass I'm quite new to Haskell, and I ran into this bug when trying to compile ...

[ -0.00531005859375, 0.03125, -0.01251220703125, 0.026611328125, 0.0027008056640625, 0.007659912109375, 0.001220703125, -0.014404296875, 0.004730224609375, -0.0072021484375, -0.0299072265625, 0.0034027099609375, 0.0020751953125, 0.01361083984375, -0.038818359375, -0.004425048828125, 0....

[ 191147, 959, 8, 106357, 647, 864, 10, 154107, 241, 47, 10644, 67413, 1556, 142508, 70, 28211, 38796, 26455, 18770, 141012, 127, 37374, 21224, 2609, 115861, 38699, 26518, 1310, 14, 6496, 3525, 20625, 903, 54608, 9969, 1340, 7868, 177, 18151,...

[ 0.1622314453125, 0.1490478515625, 0.164306640625, 0.212158203125, 0.0234375, 0.1937255859375, 0.142333984375, 0.11181640625, 0.0616455078125, 0.0595703125, 0.15625, 0.2130126953125, 0.1055908203125, 0.2039794921875, 0.034759521484375, 0.002593994140625, 0.04022216796875, 0.07128906...

embed

23461932_c1

23461932

haskell

1

.csv" --PriceData/Daily/Yhoo.csv" let lineList :: [C.ByteString] = C.lines contents -- Break the contents into a list of lines let bars :: [Either String Bar] = map (parseOnly barParser) lineList -- Using the attoparsec let ohlcBarList :: OHLCBarList = barsToBarList bars -- Now I have a nice simple list of tuples with ...

[ 0.0186767578125, 0.0186767578125, -0.013916015625, 0.023193359375, 0.0159912109375, 0.0263671875, 0.006805419921875, 0.007598876953125, 0.00567626953125, -0.0028839111328125, -0.016845703125, -0.009765625, -0.01123046875, -0.01220703125, -0.011474609375, 0.00176239013671875, -0.01696...

[ 5, 4439, 334, 4210, 33163, 329, 137989, 212128, 1723, 68336, 58, 2633, 13315, 154663, 441, 75358, 67, 71713, 214, 313, 59801, 10941, 131904, 70, 3934, 10, 5303, 124519, 1909, 9319, 23351, 3253, 22288, 2500, 20320, 28636, 2189, 345, 243, 3...

[ 0.06719970703125, 0.1319580078125, 0.248046875, 0.0199432373046875, 0.100341796875, 0.04559326171875, 0.11083984375, 0.1500244140625, 0.1036376953125, 0.232666015625, 0.008331298828125, 0.108154296875, 0.1474609375, 0.1953125, 0.017791748046875, 0.0714111328125, 0.0550537109375, 0....

embed

51213160_c0

51213160

haskell

0

Title: Making a custom list ADT instance of Monoid Problem title: Making a custom list ADT instance of Monoid Tags: haskell Problem: Making a custom list ADT instance of Monoid It's probably something obvious I'm missing, but it seems like this should work, yet it gives an Expecting one more argument to ‘Star' Expected...

Making a custom list ADT instance of Monoid Making a custom list ADT instance of Monoid haskell Making ADT Monoid Expecting Star Expected None Union Show Making a custom list ADT instance of Monoid It's probably something obvious I'm missing, but it seems like this should work, yet it gives an Expecting one more argume...

[ -0.0238037109375, 0.00130462646484375, 0.00799560546875, 0.0194091796875, 0.0034637451171875, 0.0030059814453125, -0.000293731689453125, -0.012451171875, 0.0091552734375, 0.006866455078125, 0.0084228515625, -0.0164794921875, -0.007781982421875, 0.00494384765625, -0.0196533203125, -0.00...

[ 13676, 114122, 5303, 62, 41072, 110527, 77879, 532, 214, 1556, 142508, 60075, 24762, 4612, 13, 89829, 438, 32528, 17367, 162520, 132283, 442, 37202, 5608, 4488, 14373, 1632, 1286, 10750, 44072, 10, 10644, 1284, 8562, 1639, 33079, 661, 18499, ...

[ 0.0406494140625, 0.1590576171875, 0.190185546875, 0.051300048828125, 0.186767578125, 0.1502685546875, 0.1475830078125, 0.1451416015625, 0.0435791015625, 0.07763671875, 0.1903076171875, 0.10101318359375, 0.134765625, 0.129150390625, 0.10614013671875, 0.104248046875, 0.06842041015625, ...

embed

53680811_c0

53680811

haskell

0

Title: Parsing list with nested list using Aeson Problem title: Parsing list with nested list using Aeson Tags: haskell, aeson Problem: Parsing list with nested list using Aeson When trying to parse some simple JSON using Aeson I get a type error I don't understand. I have the following JSON jsonString = "[\"a\", [\"b\...

Parsing list with nested list using Aeson Parsing list with nested list using Aeson haskell aeson Aeson Data.Aeson GHC.Generics qualified Parsing L.ByteString Data.ByteString.Lazy Show Generic FromJSON Either Left Error Array Parsing list with nested list using Aeson When trying to parse some simple JSON using Aeson I ...

[ -0.017578125, 0.01123046875, -0.02197265625, 0.037109375, -0.007568359375, 0.01123046875, -0.00125885009765625, -0.005279541015625, -0.00131988525390625, 0.00335693359375, 0.0135498046875, -0.0189208984375, 0.019775390625, 0.0103759765625, -0.0150146484375, 0.0017852783203125, 0.0012...

[ 2392, 6953, 5303, 678, 8512, 71, 17368, 62, 90, 191, 1556, 142508, 10, 11809, 73265, 135932, 12259, 217225, 75358, 71713, 67, 2729, 3285, 17367, 88342, 28090, 1375, 58627, 9319, 2480, 212059, 69253, 31577, 366, 184, 8781, 821, 10644, 18499,...

[ 0.14892578125, 0.0665283203125, 0.1600341796875, 0.0703125, 0.2030029296875, 0.108154296875, 0.057159423828125, 0.1043701171875, 0.1240234375, 0.1878662109375, 0.059295654296875, 0.1612548828125, 0.043731689453125, 0.034027099609375, 0.0970458984375, 0.0546875, 0.0176239013671875, ...

embed

19160306_c0

19160306

haskell

0

Title: Inferred type is not general enough Problem title: Inferred type is not general enough Tags: haskell, prefix Problem: Inferred type is not general enough I'm wondering if a list is a prefix of a second list, using the following code: prefix :: [a] -> [b] -> Bool prefix [] _ = True prefix _ [] = False prefix (x:x...

Inferred type is not general enough Inferred type is not general enough haskell prefix Inferred Bool x:xs y:ys Expression Expected Inferred type is not general enough I'm wondering if a list is a prefix of a second list, using the following code: But it returns an error: Can someone help me get this to work?

[ -0.00970458984375, 0.0079345703125, 0.0172119140625, 0.0133056640625, 0.003662109375, -0.004608154296875, -0.0125732421875, 0.002288818359375, 0.0018310546875, 0.0228271484375, 0.0064697265625, -0.031494140625, 0.0023651123046875, -0.01495361328125, -0.0037841796875, -0.000432968139648...

[ 360, 2875, 2822, 10644, 959, 4537, 20174, 83, 1556, 142508, 183114, 2460, 929, 1022, 425, 113, 4778, 25129, 60075, 13, 149016, 5303, 10, 111, 17932, 17368, 25632, 18151, 30646, 18499, 4358, 4488 ]

[ 0.0556640625, 0.18359375, 0.176025390625, 0.1771240234375, 0.1221923828125, 0.16796875, 0.1629638671875, 0.04449462890625, 0.100341796875, 0.1864013671875, 0.2203369140625, 0.045440673828125, 0.1317138671875, 0.014617919921875, 0.0386962890625, 0.018157958984375, 0.09649658203125, ...

embed

49317826_c1

49317826

haskell

1

:: [Parameter] } deriving (Eq, Show) data KeyAndParameters = KeyAndParameters Text [Parameter] parseParameter :: Parser Parameter parseParameter = do n <- takeWhile1 (notInClass "@") _ <- char '@' t <- takeWhile1 (const True) return $ Parameter { name = n, paramType = t } parseKeyAndParameters :: Parser KeyAndParamete...

[ -0.0205078125, 0.00677490234375, -0.03173828125, 0.007049560546875, -0.01275634765625, 0.0135498046875, -0.001556396484375, -0.0223388671875, 0.013671875, -0.005584716796875, 0.0208740234375, -0.01171875, 0.016357421875, 0.0064697265625, -0.0113525390625, 0.005096435546875, 0.0004348...

[ 1984, 55292, 29089, 51912, 16406, 6496, 864, 4, 17367, 2053, 26824, 37839, 2203, 24129, 366, 184, 2392, 2189, 1720, 54, 653, 5646, 1456, 979, 133, 418, 10869, 4153, 140803, 981, 21441, 808, 87599, 30646, 3650, 9351, 121, 196707, 162429, 2...

[ 0.1348876953125, 0.1907958984375, 0.254150390625, 0.048797607421875, 0.18115234375, 0.2113037109375, 0.18212890625, 0.0006103515625, 0.20458984375, 0.2152099609375, 0.216064453125, 0.2509765625, 0.0792236328125, 0.1986083984375, 0.1558837890625, 0.138671875, 0.1533203125, 0.1866455...

embed

78469720_c1

78469720

haskell

1

5) Just 5 Property (Just 5) Property 5 Basically, I want the (Just 5) in Property (Just 5) to be parenthesised, but not the 5 in Property 5 . I'm guessing I need some sort of check on the precedent n , and to add brackets conditionally, but I'm not sure what this check is. How can I write this Show instance to get wha...

[ -0.0242919921875, 0.000751495361328125, 0.03076171875, 0.0179443359375, 0.0078125, 0.0198974609375, 0.04443359375, -0.02099609375, 0.033203125, 0.01422119140625, 0.005126953125, 0.0067138671875, -0.0064697265625, 0.0025177001953125, -0.00616455078125, 0.003021240234375, -0.0220947265...

[ 21162, 9563, 190, 206984, 127794, 3444, 70, 186, 49129, 160291, 5281, 1284, 959, 57767, 3871, 12765, 123132, 653, 15190, 1620, 27853, 35431, 33022, 17367, 110527, 2046, 2367, 151134, 45831, 19273, 238, 1022, 47, 534, 58, 6872, 4488, 15400, ...

[ 0.2274169921875, 0.1707763671875, 0.217529296875, 0.2491455078125, 0.16162109375, 0.10699462890625, 0.00079345703125, 0.00994873046875, 0.1405029296875, 0.1417236328125, 0.095947265625, 0.00848388671875, 0.0340576171875, 0.0015869140625, 0.005126953125, 0.146240234375, 0.203491210937...

embed

68967424_c0

68967424

haskell

0

Title: PostsController for href attribute Problem title: PostsController for href attribute Tags: ihp, haskell, blaze-html Problem: PostsController for href attribute import qualified Text.Blaze.Html5 as H import qualified Text.Blaze.Html5.Attributes as A Code signals: Data.String, Web.View.Prelude, qualified, PostsCon...

PostsController for href attribute PostsController for href attribute ihp haskell blaze-html Data.String Web.View.Prelude qualified PostsController View EditView PostsAction Posts Edit Post H.nav H.ol A.class_ H.li H.a A.href H.h1 Couldn H.AttributeValue PostsActiontypecheck Defined Dropbox Documents Web Types.hs:13:7 ...

[ 0.01513671875, -0.002777099609375, 0.00799560546875, 0.00109100341796875, 0.00372314453125, -0.007568359375, 0.021240234375, 0.0021514892578125, -0.00787353515625, -0.041748046875, -0.018798828125, -0.01129150390625, -0.0177001953125, -0.00616455078125, 0.006134033203125, -0.0057067871...

[ 2795, 7, 175904, 603, 100, 77867, 420, 150380, 9633, 254, 1556, 142508, 9932, 731, 7693, 11809, 71713, 4002, 100474, 19273, 822, 217225, 29805, 42079, 284, 10763, 572, 46069, 929, 62, 67413, 150, 127, 29087, 191147, 191145, 50986, 78292, 59...

[ 0.18359375, 0.044647216796875, 0.2464599609375, 0.139404296875, 0.0258941650390625, 0.197021484375, 0.16162109375, 0.2252197265625, 0.06890869140625, 0.10986328125, 0.1263427734375, 0.207763671875, 0.1829833984375, 0.153076171875, 0.2130126953125, 0.0633544921875, 0.1436767578125, ...

embed

23793076_c2

23793076

haskell

2

signature for dimDistance :: Key k => k -> V3 a -> V3 a -> Double at src/Data/KDTree.hs:47:3 Relevant bindings include k :: k (bound at src/Data/KDTree.hs:47:15) dimDistance :: k -> V3 a -> V3 a -> Double (bound at src/Data/KDTree.hs:47:3) In the pattern: V3X In a case alternative: V3X -> ax - bx In the second argumen...

[ 0.025634765625, -0.00628662109375, -0.028076171875, -0.0308837890625, 0.01239013671875, -0.0225830078125, -0.013427734375, -0.008056640625, -0.0014190673828125, -0.00762939453125, 0.0025482177734375, -0.0186767578125, 0.01397705078125, -0.018798828125, -0.03515625, 0.00567626953125, ...

[ 138256, 100, 34355, 14055, 116071, 1984, 26824, 472, 44357, 33079, 310, 363, 10, 107172, 99, 19437, 137989, 605, 107, 13, 127, 33573, 133, 30624, 128239, 7, 26698, 99091, 12221, 21320, 103510, 1542, 7225, 30700, 425, 876, 17932, 10750, 111,...

[ 0.274169921875, 0.04656982421875, 0.2183837890625, 0.227783203125, 0.262451171875, 0.06048583984375, 0.2498779296875, 0.137451171875, 0.059356689453125, 0.038330078125, 0.1214599609375, 0.1737060546875, 0.1158447265625, 0.1632080078125, 0.007049560546875, 0.066162109375, 0.1016845703...

embed

39195297_c0

39195297

haskell

0

Title: Haskell even number iteration Problem title: Haskell even number iteration Tags: fold, recursion, iteration, haskell Problem: Haskell even number iteration I'm trying to drop all odd number from a list of integers.. however having some problems (I'm a total newbie), here's my code: evenfunc :: [Int] -> [Int] eve...

Haskell even number iteration Haskell even number iteration fold recursion iteration haskell list Haskell Haskell even number iteration I'm trying to drop all odd number from a list of integers.. however having some problems (I'm a total newbie), here's my code: Its giving me a 'parse error on input '='' message when t...

[ -0.008056640625, 0.010986328125, 0.023681640625, -0.00701904296875, -0.00113677978515625, 0.046630859375, 0.0029449462890625, -0.0089111328125, 0.00567626953125, -0.025146484375, 0.0140380859375, -0.0301513671875, -0.00836181640625, 0.01043701171875, 0.002960205078125, 0.0206298828125,...

[ 20625, 142508, 3853, 14012, 17, 720, 2320, 42822, 195625, 1556, 5303, 31577, 36069, 756, 70270, 1295, 892, 26255, 49903, 44402, 3622, 3525, 9014, 3688, 18151, 68772, 163, 2500, 184, 18499, 98, 107730, 1369, 4765, 26008, 11675, 903, 444, 205...

[ 0.13330078125, 0.1700439453125, 0.215087890625, 0.1817626953125, 0.0335693359375, 0.207275390625, 0.0408935546875, 0.1669921875, 0.1331787109375, 0.1226806640625, 0.140869140625, 0.09234619140625, 0.2088623046875, 0.08892822265625, 0.2005615234375, 0.08294677734375, 0.0906982421875, ...

embed

4074342_c0

4074342

haskell

0

Title: reading file and accessing in haskell (functional programming language) Problem title: reading file and accessing in haskell (functional programming language) Tags: haskell Problem: reading file and accessing in haskell (functional programming language) How do i read the following file which has columns of data ...

reading file and accessing in haskell (functional programming language) reading file and accessing in haskell (functional programming language) haskell reading file and accessing in haskell (functional programming language) How do i read the following file which has columns of data with header and space or tab delimite...

[ 0.027099609375, -0.0223388671875, -0.007537841796875, 0.030029296875, 0.004730224609375, -0.002166748046875, 0.00250244140625, 0.01531982421875, 0.007537841796875, 0.0108642578125, 0.0103759765625, -0.01312255859375, -0.011474609375, -0.0380859375, -0.0247802734375, -0.0081787109375, ...

[ 16454, 11435, 136, 17203, 1556, 142508, 137175, 56037, 46876, 23, 11249, 17, 12301, 25632, 3365, 316, 2053, 678, 10336, 56, 32628, 707, 20928, 8, 93343, 20625, 16193, 831, 12638, 12830, 107730, 27781, 903, 201, 390, 361, 50944, 425, 209462,...

[ 0.2216796875, 0.20166015625, 0.055145263671875, 0.168212890625, 0.1590576171875, 0.24365234375, 0.07037353515625, 0.0272216796875, 0.048004150390625, 0.0155792236328125, 0.0201263427734375, 0.06451416015625, 0.224853515625, 0.1129150390625, 0.09869384765625, 0.102294921875, 0.1275634...

embed

22728974_c1

22728974

haskell

1

to Haskell : Haskell also incorporates polymorphic types---types that are universally quantified in some way over all types. Polymorphic type expressions essentially describe families of types. For example, (forall a)[a] is the family of types consisting of, for every type a, the type of lists of a. Lists of integers ...

[ 0.0034027099609375, 0.00677490234375, 0.015869140625, 0.004547119140625, -0.00860595703125, 0.00958251953125, 0.0260009765625, -0.006927490234375, 0.01708984375, 0.002166748046875, 0.01263427734375, -0.059814453125, 0.01446533203125, 0.016845703125, -0.032958984375, -0.013427734375, ...

[ 47, 20625, 142508, 152, 2843, 49504, 1636, 35874, 178851, 1771, 52895, 55479, 50986, 7, 621, 32813, 538, 55230, 47314, 3060, 3917, 645, 756, 63306, 10644, 125195, 85590, 98363, 87143, 27781, 2472, 5584, 10, 1065, 11, 83, 14449, 111, 58055, ...

[ 0.19189453125, 0.2080078125, 0.306396484375, 0.01763916015625, 0.0831298828125, 0.16650390625, 0.0723876953125, 0.2064208984375, 0.2471923828125, 0.0938720703125, 0.264892578125, 0.052459716796875, 0.2398681640625, 0.07757568359375, 0.001617431640625, 0.128173828125, 0.05450439453125...

embed

69605531_c0

69605531

haskell

0

Title: Returning number of occurences with condition from list in Haskell Problem title: Returning number of occurences with condition from list in Haskell Tags: haskell Problem: Returning number of occurences with condition from list in Haskell I want to filter number from list by condition that they have to be less t...

Returning number of occurences with condition from list in Haskell Returning number of occurences with condition from list in Haskell haskell list Returning Haskell Num Ord Returning number of occurences with condition from list in Haskell I want to filter number from list by condition that they have to be less than 3 ...

[ -0.01190185546875, 0.01904296875, -0.014404296875, -0.0024261474609375, 0.0289306640625, 0.0031890869140625, 0.021240234375, -0.00640869140625, 0.02490234375, -0.0024871826171875, -0.01080322265625, -0.022705078125, 0.021484375, 0.02685546875, -0.005462646484375, -0.01080322265625, 0...

[ 173340, 214, 14012, 74918, 69098, 678, 35431, 1295, 5303, 20625, 142508, 23, 1556, 52782, 35379, 3444, 46312, 390, 765, 40715, 3501, 138, 3642, 80854, 1884, 903, 72134, 37842, 104711, 16093, 8439, 10, 2203, 140909, 22027, 18, 4488, 26366 ]

[ 0.167724609375, 0.015289306640625, 0.180908203125, 0.2042236328125, 0.143310546875, 0.1334228515625, 0.253662109375, 0.133544921875, 0.1737060546875, 0.1658935546875, 0.219482421875, 0.0291748046875, 0.152099609375, 0.1563720703125, 0.2137451171875, 0.06939697265625, 0.1990966796875,...

embed

51635483_c2

51635483

haskell

2

_inputs, PortName, CLK_32MHZ, RESET, t_output, LED, Clock, System, Source, Asynchronous, Signal, Bit, HiddenClockReset, Word32, LIBRARY, USE, ieee.std_logic_1164.ALL, ENTITY, END, ARCHITECTURE, COMPONENT, PORT, std_logic, OUT, CLK_32MHZ_period, BEGIN, MAP, CLK_32MHZ_process, Automatically, VHDL-93, IEEE, IEEE.NUMERIC_S...

[ 0.00714111328125, -0.002716064453125, -0.011962890625, -0.00176239013671875, -0.000640869140625, -0.00958251953125, -0.0096435546875, 0.000133514404296875, 0.0230712890625, -0.01361083984375, -0.00885009765625, -0.00116729736328125, -0.00070953369140625, 0.025390625, -0.00156402587890625...

[ 101, 73, 7077, 7, 4, 13791, 163612, 313, 43238, 6460, 594, 194718, 9069, 54080, 808, 454, 6056, 8908, 21135, 12353, 77641, 12654, 101966, 10821, 144000, 27774, 72483, 555, 4332, 3509, 22543, 16970, 53176, 34388, 78441, 17, 7039, 271, 71, ...

[ 0.1021728515625, 0.140380859375, 0.2413330078125, 0.05181884765625, 0.0634765625, 0.192138671875, 0.154296875, 0.04852294921875, 0.16845703125, 0.238037109375, 0.0246429443359375, 0.1900634765625, 0.11474609375, 0.21044921875, 0.0867919921875, 0.005218505859375, 0.1461181640625, 0....

embed

27704571_c0

27704571

haskell

0

Title: Not in scope: `HashMap.lookup' Problem title: Not in scope: `HashMap.lookup' Tags: json, haskell, hashmap Problem: Not in scope: `HashMap.lookup' I am having trouble with HashMap.lookup function. Please give your advise on how to fix following code (I am getting Not in scope: `HashMap.lookup' error): i...

Not in scope: `HashMap.lookup' Not in scope: `HashMap.lookup' json haskell hashmap Not HashMap.lookup JSON.FromJSON Document JSON.Object JSON Not in scope: `HashMap.lookup' I am having trouble with HashMap.lookup function. Please give your advise on how to fix following code (I am getting Not in scope: `HashM...

[ -0.015869140625, 0.00823974609375, -0.016357421875, 0.0086669921875, 0.0087890625, -0.0103759765625, 0.0098876953125, 0.00946044921875, -0.0166015625, -0.0027923583984375, -0.003875732421875, 0.0036468505859375, -0.01287841796875, 0.002471923828125, 0.0263671875, -0.007781982421875, ...

[ 11205, 23, 70820, 6495, 1495, 166179, 64747, 2037, 3768, 1647, 1681, 1556, 142508, 256, 80425, 254, 162087, 821, 58627, 168407, 1375, 43101, 46471, 75161, 63134, 5, 32354, 115992, 30022, 25632, 18151, 18499 ]

[ 0.2130126953125, 0.1898193359375, 0.2403564453125, 0.1724853515625, 0.1298828125, 0.2362060546875, 0.15234375, 0.1405029296875, 0.0775146484375, 0.05682373046875, 0.123046875, 0.1180419921875, 0.177490234375, 0.1064453125, 0.1085205078125, 0.10498046875, 0.180419921875, 0.054412841...

embed

28552092_c0

28552092

haskell

0

Title: Haskell: Function multiplying elements of list using high order functions Problem title: Haskell: Function multiplying elements of list using high order functions Tags: haskell Problem: Haskell: Function multiplying elements of list using high order functions I am new to Haskell so I'm trying to understand high ...

Haskell: Function multiplying elements of list using high order functions Haskell: Function multiplying elements of list using high order functions haskell high Haskell Haskell: Function multiplying elements of list using high order functions I am new to Haskell so I'm trying to understand high order functions and how ...

[ -0.0189208984375, 0.00738525390625, 0.0036163330078125, -0.01251220703125, -0.0003871917724609375, 0.023193359375, -0.009521484375, -0.00909423828125, -0.005340576171875, -0.040283203125, 0.0029449462890625, -0.015380859375, -0.0152587890625, 0.0012054443359375, -0.0238037109375, -0.01...

[ 20625, 142508, 28670, 10763, 6024, 62479, 214, 80854, 5303, 17368, 11192, 12989, 32354, 111, 1556, 7, 3525, 47, 31577, 28219, 4488, 22288, 46312, 18344, 7569, 20469, 418, 39933, 23972, 36663, 4034, 118126, 90, 23, 201505, 30646, 615, 765, 2...

[ 0.1192626953125, 0.23828125, 0.127685546875, 0.059814453125, 0.12451171875, 0.1707763671875, 0.022552490234375, 0.150390625, 0.1749267578125, 0.042724609375, 0.118408203125, 0.218505859375, 0.190185546875, 0.01361083984375, 0.11083984375, 0.02093505859375, 0.05804443359375, 0.01016...

embed

71902508_c0

71902508

haskell

0

Title: What is the equivalent function of fileChooserDialogNew with gi-gtk Problem title: What is the equivalent function of fileChooserDialogNew with gi-gtk Tags: gtk2hs, gtk3, haskell, gtk Problem: What is the equivalent function of fileChooserDialogNew with gi-gtk I'm making a GTK interface with gi-gtk for a Haskell...

What is the equivalent function of fileChooserDialogNew with gi-gtk What is the equivalent function of fileChooserDialogNew with gi-gtk gtk2hs gtk3 haskell gtk What gtk2hs gtk3 What is the equivalent function of fileChooserDialogNew with gi-gtk I'm making a GTK interface with gi-gtk for a Haskell program and I would li...

[ -0.010009765625, 0.006195068359375, -0.00927734375, 0.012451171875, -0.002899169921875, 0.00836181640625, 0.0016021728515625, -0.00186920166015625, 0.00787353515625, -0.034423828125, 0.00872802734375, -0.0654296875, -0.003265380859375, -0.009521484375, -0.0091552734375, 0.0007553100585...

[ 4865, 183234, 32354, 11435, 107522, 232, 56, 72838, 4867, 46568, 678, 3016, 5386, 92, 83, 70, 706, 31472, 304, 127, 363, 1556, 142508, 7, 9, 20662, 527, 29735, 101758, 20625, 1528, 1884, 28282, 26519, 47, 40, 343, 100, 102158, 105233, 9...

[ 0.041900634765625, 0.1788330078125, 0.1744384765625, 0.1513671875, 0.06817626953125, 0.108154296875, 0.0877685546875, 0.0706787109375, 0.10308837890625, 0.1888427734375, 0.1016845703125, 0.1954345703125, 0.144775390625, 0.15478515625, 0.0054931640625, 0.00665283203125, 0.048614501953...

embed

69578020_c0

69578020

haskell

0

Title: Why is there a quotation mark on the operators like 'mod'? Problem title: Why is there a quotation mark on the operators like 'mod'? Tags: haskell Problem: Why is there a quotation mark on the operators like 'mod'? I am new to Haskell and I probably have some really dumb questions (so sorry a...

Why is there a quotation mark on the operators like 'mod'? Why is there a quotation mark on the operators like 'mod'? haskell Why Why is there a quotation mark on the operators like 'mod'? I am new to Haskell and I probably have some really dumb questions (so sorry about that). I was reading some tu...

[ 0.0091552734375, 0.0155029296875, 0.015869140625, -0.01202392578125, 0.013671875, 0.00408935546875, 0.0107421875, 0.01068115234375, 0.01324462890625, 0.00238037109375, -0.009765625, -0.044921875, 0.0189208984375, -0.005126953125, -0.01953125, 0.0074462890625, -0.01556396484375, 0.0...

[ 44084, 83, 2685, 81732, 1363, 16188, 98, 39933, 7, 1884, 3768, 13415, 10, 54764, 1556, 142508, 3525, 47, 20625, 6492, 59090, 57143, 44177, 125195, 903, 3714, 2811, 136, 88, 195, 26950, 15400, 765, 2856 ]

[ 0.1473388671875, 0.06683349609375, 0.103515625, 0.2105712890625, 0.1134033203125, 0.177734375, 0.056243896484375, 0.2225341796875, 0.048126220703125, 0.06732177734375, 0.127685546875, 0.2318115234375, 0.0631103515625, 0.0188446044921875, 0.1414794921875, 0.2666015625, 0.0206146240234...

embed

57246616_c0

57246616

haskell

0

Title: What kinds of recursions are used in the definitions of `foldr` and `foldl`? Problem title: What kinds of recursions are used in the definitions of `foldr` and `foldl`? Tags: fold, haskell, recursion Problem: What kinds of recursions are used in the definitions of `foldr` and `foldl`? foldr :: (a -> b -> b) -> b...

What kinds of recursions are used in the definitions of `foldr` and `foldl`? What kinds of recursions are used in the definitions of `foldr` and `foldl`? fold haskell recursion What x:xs What kinds of recursions are used in the definitions of `foldr` and `foldl`? and seem to use different kinds of recursions. What kind...

[ -0.0213623046875, -0.0096435546875, 0.00445556640625, -0.0036468505859375, -0.01239013671875, 0.00494384765625, -0.01190185546875, -0.000843048095703125, 0.0098876953125, 0.00830078125, 0.00775146484375, -0.0322265625, -0.0086669921875, 0.01422119140625, 0.01409912109375, -0.0007591247...

[ 8562, 195625, 17514, 11814, 80934, 42822, 42, 136, 141, 1556, 142508, 1830, 4865, 1022, 12, 425, 111, 48903, 4527, 12921, 18344, 7569, 20469 ]

[ 0.12939453125, 0.20751953125, 0.135009765625, 0.084228515625, 0.1077880859375, 0.169677734375, 0.1793212890625, 0.07391357421875, 0.152099609375, 0.0867919921875, 0.1812744140625, 0.051544189453125, 0.01263427734375, 0.042205810546875, 0.014007568359375, 0.05084228515625, 0.006286621...

embed

61739508_c0

61739508

haskell

0

Title: Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) Problem title: Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) Tags: haskell, dhall Problem: Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) What is the best way to encode the Haskell type Map ([Text], [Text]) Text in dhall? Attempt. It seem...

Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) haskell dhall Encoding Map Text Haskell config.dhall List Encoding `Map ([Text], [Text]) Text` in dhall (Haskell) What is the best way to encode the Haskell type Map ([Text], [Text]) Text in dhall? Attempt. I...

[ 0.018798828125, -0.0208740234375, 0.00122833251953125, 0.0036773681640625, -0.03173828125, -0.006011962890625, 0.0008392333984375, -0.0013275146484375, -0.01092529296875, -0.004791259765625, -0.023681640625, 0.016357421875, 0.01519775390625, 0.01348876953125, -0.00061798095703125, -0.0...

[ 357, 587, 6238, 166179, 174379, 24129, 23, 104, 29907, 6495, 7, 142508, 1556, 42719, 20625, 153837, 71, 32036, 2965, 3917, 22, 40899, 10644, 34224, 1650, 831, 18, 4527, 47, 903, 3871, 77758, 22288 ]

[ 0.094970703125, 0.207763671875, 0.058319091796875, 0.24267578125, 0.203857421875, 0.2340087890625, 0.0775146484375, 0.098876953125, 0.2330322265625, 0.1068115234375, 0.07781982421875, 0.2298583984375, 0.1094970703125, 0.234619140625, 0.1324462890625, 0.1226806640625, 0.05181884765625...

embed

12273315_c0

12273315

haskell

0

Title: How to recompile Haskell with cabal build showing only warnings Problem title: How to recompile Haskell with cabal build showing only warnings Tags: haskell, cabal Problem: How to recompile Haskell with cabal build showing only warnings When I cabal build my projects, warnings (especially with -Wall ) are only s...

How to recompile Haskell with cabal build showing only warnings How to recompile Haskell with cabal build showing only warnings haskell cabal How Haskell Wall How to recompile Haskell with cabal build showing only warnings When I cabal build my projects, warnings (especially with -Wall ) are only shown the first time. ...

[ -0.00946044921875, 0.00115203857421875, 0.01043701171875, -0.00225830078125, 0.002716064453125, 0.00762939453125, -0.0242919921875, 0.007171630859375, 0.0026702880859375, 0.00982666015625, -0.00714111328125, -0.0294189453125, 0.0031585693359375, 0.01116943359375, 0.00167083740234375, 0...

[ 11249, 456, 58875, 1340, 20625, 142508, 678, 109524, 45367, 141377, 4734, 1631, 6977, 47, 1556, 23706, 77635, 20, 198076, 127887, 5117, 1733, 221419, 26818, 82365, 3444, 1957, 756, 13452, 13438, 46622, 9486, 109585, 420, 50930, 107, 51776, 57...

[ 0.035308837890625, 0.1561279296875, 0.156494140625, 0.1513671875, 0.1654052734375, 0.2437744140625, 0.03350830078125, 0.2261962890625, 0.147216796875, 0.06805419921875, 0.09613037109375, 0.168701171875, 0.1409912109375, 0.00006103515625, 0.142333984375, 0.1695556640625, 0.10388183593...

embed

34725315_c0

34725315

haskell

0

Title: Pure function with haskell and database access Problem title: Pure function with haskell and database access Tags: haskell, functional-programming Problem: Pure function with haskell and database access How can it be possible to tell that a function is pure : statelessness : given the same parameters, the result...

Pure function with haskell and database access Pure function with haskell and database access haskell functional-programming Pure Pure function with haskell and database access How can it be possible to tell that a function is pure : statelessness : given the same parameters, the result is stricly the same (1+2 = 3) im...

[ -0.0034637451171875, 0.0021514892578125, -0.00457763671875, -0.006256103515625, 0.005615234375, 0.0277099609375, -0.00714111328125, -0.007232666015625, 0.007171630859375, -0.03759765625, 0.019287109375, -0.0137939453125, -0.0205078125, 0.00640869140625, -0.006195068359375, -0.001823425...

[ 118233, 32354, 678, 1556, 142508, 136, 63399, 17203, 123309, 28966, 7722, 47, 14192, 83, 34166, 11341, 9393, 7432, 5701, 171859, 16750, 210422, 538, 2858, 54651, 8439, 566, 14311, 41159, 34292, 18, 15549, 1733, 2053, 43701, 2046, 43512, 97351...

[ 0.26318359375, 0.218017578125, 0.0955810546875, 0.1380615234375, 0.220703125, 0.05950927734375, 0.1138916015625, 0.159912109375, 0.16162109375, 0.09619140625, 0.046478271484375, 0.001129150390625, 0.1396484375, 0.08251953125, 0.27294921875, 0.158447265625, 0.168212890625, 0.0831298...

embed

36464907_c0

36464907

haskell

0

Title: haskell list to list pattern matching Problem title: haskell list to list pattern matching Tags: haskell Problem: haskell list to list pattern matching Here's my code: newcell :: [Cell] -> [Cell] newcell [Cell {cellPosition = cp, cellState = cs}] = [Cell {cellPosition = cp, cellState = (nextCellState cs)}] nextC...

haskell list to list pattern matching haskell list to list pattern matching haskell Cell StudentSources LangtonsAnt.hs:141:1 Warning Pattern Patterns haskell list to list pattern matching Here's my code: nextCellState is just a function, but it says could not match the pattern.

[ -0.036865234375, -0.0034027099609375, 0.0074462890625, 0.0306396484375, 0.009033203125, 0.00142669677734375, -0.0234375, 0.002655029296875, 0.01007080078125, 0.004852294921875, -0.00109100341796875, 0.0084228515625, 0.0123291015625, -0.00665283203125, -0.00811767578125, -0.01220703125,...

[ 1556, 142508, 5303, 47, 103510, 14858, 214, 80743, 26696, 211235, 15786, 67772, 78931, 127, 7, 146893, 19721, 5550, 592, 9876, 22766, 18151, 11737, 441, 6796, 135206, 13, 1660, 32354, 1284, 17378, 5809, 959 ]

[ 0.1676025390625, 0.2274169921875, 0.2159423828125, 0.115234375, 0.2169189453125, 0.22998046875, 0.01348876953125, 0.190673828125, 0.1116943359375, 0.084228515625, 0.08489990234375, 0.1015625, 0.06280517578125, 0.06829833984375, 0.004474639892578125, 0.08184814453125, 0.02189636230468...

embed

38349273_c0

38349273

haskell

0

Title: Where does GHC allocate foreign memory and how does the garbage collector treat it? Problem title: Where does GHC allocate foreign memory and how does the garbage collector treat it? Tags: ghc, garbage-collection, haskell, memory-management Problem: Where does GHC allocate foreign memory and how does the garbage...

Where does GHC allocate foreign memory and how does the garbage collector treat it? Where does GHC allocate foreign memory and how does the garbage collector treat it? ghc garbage-collection haskell memory-management Where GHC Foreign.Marshal.Alloc Foreign.ForeignPtr Where does GHC allocate foreign memory and how does ...

[ 0.03564453125, 0.03955078125, -0.0074462890625, 0.001983642578125, -0.0152587890625, 0.00860595703125, -0.0081787109375, 0.01202392578125, 0.000736236572265625, 0.005035400390625, 0.022705078125, -0.027099609375, 0.0208740234375, 0.023681640625, -0.0037384033203125, -0.007171630859375,...

[ 78662, 527, 73265, 24286, 33478, 110613, 98323, 3642, 3671, 402, 429, 43799, 748, 85689, 442, 31380, 238, 196352, 1556, 142508, 87140, 184293, 16305, 4200, 43512, 6652, 18537, 38529, 683, 4448, 14602, 32354, 408, 136, 960, 55043, 1295, 3525, ...

[ 0.1427001953125, 0.12158203125, 0.2491455078125, 0.18896484375, 0.127197265625, 0.2398681640625, 0.252685546875, 0.0634765625, 0.08062744140625, 0.167724609375, 0.1025390625, 0.1524658203125, 0.1202392578125, 0.148681640625, 0.051605224609375, 0.10516357421875, 0.1273193359375, 0.1...

embed

75362080_c0

75362080

haskell

0

Title: Take k smallest numbers from a list time complixity in Haskell Problem title: Take k smallest numbers from a list time complixity in Haskell Tags: haskell, algorithm, time-complexity Problem: Take k smallest numbers from a list time complixity in Haskell Is the time complexity of the next Haskell programm n * lo...

Take k smallest numbers from a list time complixity in Haskell Take k smallest numbers from a list time complixity in Haskell haskell algorithm time-complexity a Data.List Take Haskell Take k smallest numbers from a list time complixity in Haskell Is the time complexity of the next Haskell programm n * log(n) or n * lo...

[ 0.0037078857421875, 0.01513671875, 0.02001953125, -0.0286865234375, 0.00469970703125, 0.0146484375, 0.00087738037109375, -0.0146484375, -0.0007781982421875, -0.0257568359375, 0.0211181640625, 0.00714111328125, -0.0135498046875, 0.035888671875, -0.0185546875, 0.0076904296875, 0.012329...

[ 46673, 472, 19336, 525, 101935, 1295, 5303, 1733, 9969, 68904, 2481, 20625, 142508, 1556, 234873, 277, 44974, 11809, 154663, 2071, 27140, 11737, 28966, 653, 661, 12684, 132, 19, 707, 92, 3642, 69307, 83, 140909, 107730, 14012, 5117, 80854, ...

[ 0.1434326171875, 0.177001953125, 0.1552734375, 0.150634765625, 0.1470947265625, 0.041107177734375, 0.1689453125, 0.1861572265625, 0.1180419921875, 0.1455078125, 0.1243896484375, 0.1636962890625, 0.252197265625, 0.13037109375, 0.171630859375, 0.1072998046875, 0.1854248046875, 0.0661...

embed

75579152_c1

75579152

haskell

1

: is this the only way to achieve what I want (Using GADTs/Families)? what I don't like there, that I need to introduce additional boilerplate tags for Input/Output values, is it possible to make it less boilerplaty way? My second question: is a more advanced logic of mapping possible? Say I want the input to be mapped...

[ -0.0157470703125, 0.0028076171875, -0.0157470703125, -0.006439208984375, -0.0196533203125, -0.00640869140625, -0.005340576171875, -0.0030670166015625, 0.0157470703125, 0.01214599609375, -0.004791259765625, -0.031494140625, 0.00628662109375, 0.005340576171875, -0.00958251953125, 0.00003...

[ 83, 903, 4734, 3917, 69307, 2367, 3444, 1062, 23749, 41072, 7, 919, 1191, 25720, 2301, 18, 1884, 65508, 78301, 337, 34759, 92558, 69141, 360, 7077, 79858, 142424, 7722, 40715, 9189, 17932, 9655, 1286, 175961, 62775, 111, 291, 26783, 107730,...

[ 0.010955810546875, 0.0849609375, 0.03643798828125, 0.043914794921875, 0.1343994140625, 0.041717529296875, 0.1175537109375, 0.008575439453125, 0.101318359375, 0.1507568359375, 0.03363037109375, 0.03204345703125, 0.0911865234375, 0.1009521484375, 0.04833984375, 0.0582275390625, 0.13037...

embed

44773452_c0

44773452

haskell

0

Title: confused about dot-operator in haskell Problem title: confused about dot-operator in haskell Tags: haskell Problem: confused about dot-operator in haskell (head.group) "1234" It work. head.group "1234" I get errors: <interactive>:8:6: Couldn't match expected type `a0 -> [c0]' with actual type `[[Char]]' In the r...

confused about dot-operator in haskell confused about dot-operator in haskell haskell head.group Couldn Char Probable confused about dot-operator in haskell It work. I get errors: I think (head.group) is same as head.group, why (head.group) work and head.group not.

[ 0.01611328125, -0.002197265625, -0.004241943359375, 0.011474609375, 0.00372314453125, 0.00921630859375, -0.01153564453125, 0.00830078125, 0.0052490234375, -0.0267333984375, -0.0118408203125, 0.006866455078125, 0.00994873046875, -0.0018310546875, -0.0311279296875, -0.036865234375, 0.0...

[ 55681, 5281, 1672, 20633, 206469, 1556, 142508, 9, 23, 10336, 51588, 191147, 21656, 275, 2886, 4488, 18499, 5351, 31251, 5, 83, 5701, 15400, 136, 959 ]

[ 0.14599609375, 0.08978271484375, 0.042144775390625, 0.2069091796875, 0.24609375, 0.1552734375, 0.2381591796875, 0.018218994140625, 0.0196990966796875, 0.213623046875, 0.202880859375, 0.089599609375, 0.146728515625, 0.055816650390625, 0.0056610107421875, 0.1536865234375, 0.15979003906...

embed

64892274_c1

64892274

haskell

1

* In the expression: sort (((d p x), x) : ys) In an equation for `create': create d p (x : xs) ys | length xs == 0 = sort (((d p x), x) : ys) | otherwise = create d p xs (((d p x), x) : ys) I used type Point a = (Int, Int) at first and it was working fine but in the specification it is required that Point is type Poin...

[ 0.0177001953125, 0.00726318359375, -0.00006914138793945312, -0.00811767578125, -0.00011730194091796875, -0.0106201171875, -0.00970458984375, -0.01361083984375, 0.02392578125, -0.01019287109375, -0.00872802734375, 0.0107421875, -0.00092315673828125, -0.0205078125, -0.01092529296875, 0.0...

[ 125195, 12096, 71, 915, 1022, 152, 113, 7, 28, 5490, 2320, 7612, 2182, 28282, 104, 425, 140909, 69112, 757, 120262, 11814, 10644, 41097, 10, 2203, 4153, 18, 360, 5117, 20697, 5885, 29458, 56065, 83, 11, 18499, 2967, 53418, 15549, 32354, ...

[ 0.1959228515625, 0.247802734375, 0.0865478515625, 0.11572265625, 0.1005859375, 0.022247314453125, 0.1422119140625, 0.11279296875, 0.012542724609375, 0.1610107421875, 0.001617431640625, 0.1307373046875, 0.10296630859375, 0.1661376953125, 0.11767578125, 0.0511474609375, 0.1468505859375...

embed

65874681_c0

65874681

haskell

0

Title: How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell Problem title: How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell Tags: haskell, lambda-calculus Problem: How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell I have given a task to make the Integer...

How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell haskell lambda-calculus How Integer-List Generator Lambda Calculus Haskell How to turn Integer-List Generator [m ...] in Lambda Calculus in Haskell I have given a task to mak...

[ 0.0040283203125, -0.0098876953125, 0.0130615234375, 0.00193023681640625, 0.0185546875, -0.00421142578125, 0.016845703125, -0.01409912109375, 0.00150299072265625, -0.042724609375, -0.00177001953125, -0.02392578125, 0.01202392578125, -0.000354766845703125, 0.00872802734375, -0.0162353515...

[ 11249, 15504, 44401, 154663, 222518, 39, 153, 23, 122930, 85, 212467, 223, 20625, 142508, 47, 9, 1556, 21, 6492, 6827, 94739, 34475, 66211, 3249, 75606, 44805, 5608, 4393, 116115, 80934, 990, 563, 347, 246242, 1723, 22183, 4879, 44841, 3714...

[ 0.061431884765625, 0.1531982421875, 0.220947265625, 0.214111328125, 0.261962890625, 0.1781005859375, 0.109619140625, 0.034515380859375, 0.1982421875, 0.15478515625, 0.177490234375, 0.105712890625, 0.150390625, 0.2431640625, 0.0216522216796875, 0.048492431640625, 0.1136474609375, 0....

embed

58855451_c0

58855451

haskell

0

Title: Generating .cabal file dependency versions Problem title: Generating .cabal file dependency versions Tags: haskell-stack, haskell, cabal Problem: Generating .cabal file dependency versions I use Stack to build on my local machine, but Homebrew uses Cabal. This means that sometimes a build will work fine for me, ...

Generating .cabal file dependency versions Generating .cabal file dependency versions haskell-stack haskell cabal Generating package.yaml Generating .cabal file dependency versions I use Stack to build on my local machine, but Homebrew uses Cabal. This means that sometimes a build will work fine for me, but then not wo...

[ 0.0235595703125, 0.00701904296875, 0.001495361328125, -0.00628662109375, -0.005462646484375, 0.003662109375, 0.0045166015625, 0.01397705078125, -0.0098876953125, -0.00250244140625, -0.0218505859375, -0.0220947265625, 0.00775146484375, 0.01239013671875, 0.003692626953125, 0.006805419921...

[ 155370, 1916, 5, 408, 3571, 11435, 42548, 27771, 11389, 1556, 142508, 590, 2594, 109524, 98169, 14520, 141, 4527, 6512, 45367, 4000, 36279, 2005, 143006, 30438, 289, 68018, 4488, 5885, 959, 42850, 58061, 3917, 139392, 191082, 35509, 43581, 17...

[ 0.1478271484375, 0.013519287109375, 0.0232696533203125, 0.1634521484375, 0.245849609375, 0.1187744140625, 0.1925048828125, 0.083984375, 0.153076171875, 0.0911865234375, 0.178955078125, 0.0799560546875, 0.1644287109375, 0.231201171875, 0.1707763671875, 0.1669921875, 0.1614990234375, ...

embed

10903940_c0

10903940

haskell

0

Title: Haskell FFI - How to handle C functions that accept or return structs instead of pointers to structs? Problem title: Haskell FFI - How to handle C functions that accept or return structs instead of pointers to structs? Tags: c, ffi, haskell Problem: Haskell FFI - How to handle C functions that accept or return s...

Haskell FFI - How to handle C functions that accept or return structs instead of pointers to structs? Haskell FFI - How to handle C functions that accept or return structs instead of pointers to structs? c ffi haskell Haskell FFI How Haskell FFI - How to handle C functions that accept or return structs instead of point...

[ 0.01348876953125, 0.0245361328125, -0.01104736328125, -0.00738525390625, -0.008544921875, -0.00193023681640625, 0.00872802734375, -0.007476806640625, 0.00543212890625, -0.02099609375, 0.0101318359375, -0.01446533203125, 0.006195068359375, 0.013916015625, 0.007720947265625, 0.005859375,...

[ 20625, 142508, 563, 22724, 11249, 34831, 313, 32354, 26946, 707, 30646, 36716, 64457, 6275, 1314, 47, 7, 450, 501, 24500, 1556, 35166, 209303, 27875, 78219, 22832, 12282, 46389, 98323, 3642, 71864, 31089, 32562, 137565, 1264, 5609, 192, 29806...

[ 0.1329345703125, 0.2271728515625, 0.09393310546875, 0.25146484375, 0.0628662109375, 0.17236328125, 0.1890869140625, 0.23779296875, 0.165771484375, 0.0980224609375, 0.1494140625, 0.222900390625, 0.176513671875, 0.193603515625, 0.1151123046875, 0.0546875, 0.005126953125, 0.0500183105...

embed

1415309_c0

1415309

haskell

0

Title: Problem using Network package in GHC Problem title: Problem using Network package in GHC Tags: ghc, haskell Problem: Problem using Network package in GHC I have this simple code: import Network main = return () executing it with runhaskell fails: >runhaskell test.hs test.hs: C:\ghc\ghc-6.10.4\network-2.2.1.2\HSn...

Problem using Network package in GHC Problem using Network package in GHC ghc haskell Network Problem GHC test.hs ghc-6.10.4 network-2.2.1.2 HSnetwork-2.2.1.2.o _getnameinfo Problem using Network package in GHC I have this simple code: executing it with runhaskell fails: GHCi also gives simillar error message. What can...

[ 0.007354736328125, 0.005462646484375, 0.0159912109375, 0.031494140625, 0.006439208984375, 0.01324462890625, -0.0135498046875, 0.00390625, -0.024169921875, -0.032958984375, 0.00653076171875, -0.032470703125, 0.0023193359375, -0.006317138671875, -0.01446533203125, 0.01495361328125, 0.0...

[ 15649, 17368, 28997, 98169, 23, 527, 73265, 31380, 238, 1556, 142508, 3034, 127, 7, 13545, 10179, 617, 33120, 70147, 48400, 39718, 1179, 18244, 31, 3794, 11627, 7319, 8781, 18151, 71924, 678, 11675, 10557, 35782, 14, 2843, 76199, 78, 61716,...

[ 0.123779296875, 0.1221923828125, 0.208251953125, 0.2142333984375, 0.05609130859375, 0.11767578125, 0.2392578125, 0.12890625, 0.1453857421875, 0.1346435546875, 0.2459716796875, 0.14990234375, 0.0697021484375, 0.035369873046875, 0.043243408203125, 0.10693359375, 0.072509765625, 0.147...

embed

16145721_c0

16145721

haskell

0

Title: Installing Haskell Platform overrides gcc location in system PATH Problem title: Installing Haskell Platform overrides gcc location in system PATH Tags: mingw, path, environment-variables, haskell Problem: Installing Haskell Platform overrides gcc location in system PATH I am running the latest version of MinGW ...

Installing Haskell Platform overrides gcc location in system PATH Installing Haskell Platform overrides gcc location in system PATH mingw path environment-variables haskell Installing Haskell Platform PATH Installing Haskell Platform overrides gcc location in system PATH I am running the latest version of MinGW GCC 4.7...

[ 0.0096435546875, 0.006134033203125, 0.0133056640625, 0.0028839111328125, -0.0034027099609375, -0.010498046875, -0.010009765625, -0.010009765625, -0.01409912109375, 0.009521484375, 0.003997802734375, -0.01416015625, -0.0086669921875, -0.005859375, 0.0230712890625, 0.0087890625, -0.009...

[ 107951, 20625, 142508, 70968, 645, 416, 988, 22109, 238, 31913, 23, 5426, 436, 139909, 46996, 434, 60875, 65998, 21690, 1556, 51042, 42850, 11389, 4211, 102550, 527, 13709, 1398, 179642, 20697, 5885, 678, 271, 1369, 37223, 1662, 8108, 20600, ...

[ 0.167724609375, 0.1812744140625, 0.28662109375, 0.234130859375, 0.12744140625, 0.189208984375, 0.02581787109375, 0.184814453125, 0.148193359375, 0.21142578125, 0.05889892578125, 0.1212158203125, 0.1011962890625, 0.1944580078125, 0.10491943359375, 0.1502685546875, 0.18603515625, 0.0...

embed

23386451_c0

23386451

haskell

0

Title: Recursive Function on a List in Haskell Problem title: Recursive Function on a List in Haskell Tags: haskell, recursion, list Problem: Recursive Function on a List in Haskell I want to get the max and min value out of a List as a tuple by using recursion. I tried it with this code below and cant really figure ou...

Recursive Function on a List in Haskell Recursive Function on a List in Haskell haskell recursion list Recursive List Haskell Double x:rest Recursive Function on a List in Haskell I want to get the max and min value out of a List as a tuple by using recursion. I tried it with this code below and cant really figure out ...

[ -0.0135498046875, 0.004638671875, 0.016845703125, 0.00653076171875, 0.01092529296875, 0.0225830078125, -0.00714111328125, 0.0054931640625, 0.022705078125, -0.0019989013671875, 0.002197265625, -0.01202392578125, -0.00116729736328125, 0.0185546875, 0.021728515625, -0.0030975341796875, ...

[ 853, 48650, 5844, 28670, 10763, 98, 32036, 20625, 142508, 23, 1556, 195625, 1830, 5303, 107172, 1022, 56644, 3444, 2046, 70, 18389, 136, 881, 34292, 1810, 237, 370, 8705, 17368, 37842, 678, 18151, 35064, 45767, 26366, 15400, 14602, 959, 448...

[ 0.0853271484375, 0.2239990234375, 0.14453125, 0.1402587890625, 0.05078125, 0.08831787109375, 0.203369140625, 0.1304931640625, 0.2095947265625, 0.014923095703125, 0.12255859375, 0.2325439453125, 0.140625, 0.1573486328125, 0.1240234375, 0.111083984375, 0.210205078125, 0.0894165039062...

embed

29031687_c0

29031687

haskell

0

Title: Make monadic functions invocation point free Problem title: Make monadic functions invocation point free Tags: haskell Problem: Make monadic functions invocation point free I have code that compiles: \f st -> f1 >>= \m-> f2 m f st f1 is of type m a and f2 of type a -> b -> c -> m d , in the same Monad m. I can't...

Make monadic functions invocation point free Make monadic functions invocation point free haskell Make Make monadic functions invocation point free I have code that compiles: f1 is of type m a and f2 of type a -> b -> c -> m d , in the same Monad m. I can't for the life of me rewrite this expression pointfree, without ...

[ -0.022216796875, -0.0035552978515625, -0.0027923583984375, -0.0079345703125, 0.005340576171875, -0.00138092041015625, -0.0037689208984375, -0.00074005126953125, 0.0004062652587890625, -0.039794921875, -0.004547119140625, -0.01287841796875, 0.001190185546875, 0.0225830078125, -0.007720947...

[ 26176, 2667, 11, 18403, 32354, 23, 202010, 6275, 4092, 7, 1556, 142508, 18151, 9969, 1340, 1238, 418, 10644, 347, 10, 136, 304, 876, 501, 104, 5701, 60331, 71, 831, 18, 100, 6897, 456, 434, 18781, 125195, 32087, 15490, 75, 110608, 41872...

[ 0.1234130859375, 0.1617431640625, 0.08734130859375, 0.1328125, 0.2064208984375, 0.096435546875, 0.1973876953125, 0.15673828125, 0.1942138671875, 0.015350341796875, 0.1314697265625, 0.22509765625, 0.134033203125, 0.052764892578125, 0.0478515625, 0.099365234375, 0.076904296875, 0.137...

embed

20922071_c0

20922071

haskell

0

Title: Haskell Container class Problem title: Haskell Container class Tags: haskell Problem: Haskell Container class Is there a good standard (or just stable) implementation of (ordered) Container class? Container class should provide basic manipulation operations with it's instance s. Typical instances should be: Arra...

Haskell Container class Haskell Container class haskell Haskell Container Haskell Container class Is there a good standard (or just stable) implementation of (ordered) Container class? Container class should provide basic manipulation operations with it's instance s. Typical instances should be: Array, List, e.t.c. Ope...

[ -0.005401611328125, 0.01171875, -0.0011444091796875, -0.000782012939453125, -0.0079345703125, -0.009521484375, -0.0012054443359375, 0.003173828125, 0.0211181640625, -0.0037841796875, -0.0068359375, -0.0238037109375, 0.000701904296875, -0.01422119140625, -0.027099609375, -0.004821777343...

[ 20625, 142508, 34749, 20037, 18507, 1556, 2071, 2685, 4127, 5570, 748, 1660, 144142, 208124, 80596, 297, 5608, 22691, 62822, 45258, 1363, 41018, 678, 110527, 91, 33417, 186, 69253, 53, 32036, 102203, 621, 5646, 653, 927, 12830, 1295, 116419, ...

[ 0.128173828125, 0.218017578125, 0.20068359375, 0.2060546875, 0.249267578125, 0.1142578125, 0.0174102783203125, 0.0148468017578125, 0.08660888671875, 0.167236328125, 0.01104736328125, 0.014007568359375, 0.1649169921875, 0.172119140625, 0.1680908203125, 0.0889892578125, 0.0870361328125...

embed

44066766_c0

44066766

haskell

0

Title: binary tree in generalized statement Problem title: binary tree in generalized statement Tags: haskell Problem: binary tree in generalized statement I have to implement a Code which accepts a binary tree and shows a generalised Statement: this is my Code mkBTree xs | (m == 0) = Leaf (unwrap xs) | otherwise = For...

binary tree in generalized statement binary tree in generalized statement haskell Leaf Fork Data binary tree in generalized statement I have to implement a Code which accepts a binary tree and shows a generalised Statement: this is my Code but the only thing i get is something like: Failed, modules loaded: none. What i...

[ 0.01153564453125, 0.016357421875, -0.01953125, -0.0206298828125, 0.035400390625, 0.0098876953125, -0.02490234375, -0.016357421875, 0.004425048828125, -0.0191650390625, -0.0279541015625, -0.0341796875, 0.00537109375, 0.00000947713851928711, -0.0146484375, 0.019775390625, 0.01647949218...

[ 2394, 6635, 53201, 23, 4537, 29367, 63805, 1556, 142508, 636, 2407, 1326, 92, 11809, 29479, 28864, 26946, 52021, 22836, 674, 903, 83, 759, 4734, 190355, 88996, 72367, 297, 351, 13, 44691 ]

[ 0.183837890625, 0.1234130859375, 0.255126953125, 0.0145721435546875, 0.1346435546875, 0.1112060546875, 0.176513671875, 0.07232666015625, 0.17236328125, 0.0178985595703125, 0.1053466796875, 0.10205078125, 0.06121826171875, 0.09368896484375, 0.123046875, 0.1419677734375, 0.071655273437...

embed

60022571_c0

60022571

haskell

0

Title: how can i append a value to a list inside a tuple in Haskell? Problem title: how can i append a value to a list inside a tuple in Haskell? Tags: list, tuples, haskell Problem: how can i append a value to a list inside a tuple in Haskell? For example, if I have a list of tuples such as [("a1", ["a2", "a3"]), ("b1...

how can i append a value to a list inside a tuple in Haskell? how can i append a value to a list inside a tuple in Haskell? list tuples haskell Haskell how can i append a value to a list inside a tuple in Haskell? For example, if I have a list of tuples such as [("a1", ["a2", "a3"]), ("b1", ["b2", "b3"])] and I want to...

[ 0.0024261474609375, 0.025390625, 0.000865936279296875, 0.005096435546875, -0.00128173828125, 0.003875732421875, -0.0238037109375, 0.00494384765625, 0.018798828125, 0.00567626953125, 0.005645751953125, -0.018798828125, -0.00518798828125, 0.0081787109375, -0.000270843505859375, -0.003646...

[ 3642, 831, 17, 114689, 71, 34292, 47, 5303, 46132, 370, 8705, 23, 20625, 142508, 10, 99726, 1556, 11, 363, 3444, 15190, 617, 17368, 619, 107730, 28350, 140992, 51515, 218500, 117008 ]

[ 0.0804443359375, 0.07958984375, 0.07220458984375, 0.19287109375, 0.1368408203125, 0.2196044921875, 0.1146240234375, 0.208984375, 0.173828125, 0.137451171875, 0.2276611328125, 0.049713134765625, 0.1378173828125, 0.23779296875, 0.057525634765625, 0.2069091796875, 0.0986328125, 0.0335...

embed

11726563_c0

11726563

haskell

0

Title: How can I convert a Haskell String into a Ptr (Ptr GLchar)? Problem title: How can I convert a Haskell String into a Ptr (Ptr GLchar)? Tags: opengl, ffi, haskell Problem: How can I convert a Haskell String into a Ptr (Ptr GLchar)? I wish to call the function glShaderSource :: GLuint -> GLsizei -> GHC.Ptr.Ptr (GH...

How can I convert a Haskell String into a Ptr (Ptr GLchar)? How can I convert a Haskell String into a Ptr (Ptr GLchar)? opengl ffi haskell How Haskell Ptr GLchar GLuint GLsizei GHC.Ptr.Ptr GLint How can I convert a Haskell String into a Ptr (Ptr GLchar)? I wish to call the function The third argument is the shader prog...

[ -0.015380859375, 0.015380859375, -0.005218505859375, -0.01318359375, -0.009521484375, 0.0076904296875, 0.007568359375, -0.026611328125, -0.0001087188720703125, -0.00445556640625, 0.01385498046875, -0.0257568359375, -0.0068359375, -0.01318359375, -0.00811767578125, -0.0040283203125, -...

[ 11249, 831, 87, 96760, 20625, 142508, 23351, 214, 3934, 10, 436, 4448, 683, 90799, 9254, 9803, 11016, 24500, 1556, 34, 4288, 62539, 14, 527, 73265, 32599, 11782, 32354, 50960, 10750, 9638, 820, 1528, 79315, 41877, 441, 39575, 40798, 211235 ...

[ 0.07080078125, 0.073486328125, 0.033538818359375, 0.1595458984375, 0.15625, 0.27587890625, 0.2236328125, 0.1312255859375, 0.0960693359375, 0.052215576171875, 0.10546875, 0.26123046875, 0.06689453125, 0.1607666015625, 0.234375, 0.08636474609375, 0.1336669921875, 0.1171875, 0.11267...

embed

36474604_c0

36474604

haskell

0

Title: What's the difference between (function (x :< _)) = x and (function (x :_)) = x Problem title: What's the difference between (function (x :< _)) = x and (function (x :_)) = x Tags: haskell Problem: What's the difference between (function (x :< _)) = x and (function (x :_)) = x What is the less th...

What's the difference between (function (x :< _)) = x and (function (x :_)) = x What's the difference between (function (x :< _)) = x and (function (x :_)) = x haskell What x:_ x:xs What's the difference between (function (x :< _)) = x and (function (x :_)) = x What is the less than symbol used in the n...

[ 0.01483154296875, 0.00823974609375, -0.004150390625, 0.0030364990234375, -0.00994873046875, -0.0002651214599609375, 0.00848388671875, -0.00909423828125, 0.02001953125, 0.0198974609375, 0.036376953125, -0.015380859375, 0.017578125, 0.0185546875, 0.006866455078125, -0.0012969970703125, ...

[ 3768, 60212, 17721, 137175, 425, 152, 1230, 1277, 74, 101, 2203, 1022, 136, 454, 1556, 142508, 4865, 12, 70, 16093, 40715, 3501, 26582, 11814, 110, 22062, 7, 1369, 29459, 32354, 51776, 79315, 76199, 10336, 140992, 1940, 152028, 2661, 16031,...

[ 0.0672607421875, 0.1842041015625, 0.1083984375, 0.2015380859375, 0.10162353515625, 0.0860595703125, 0.006103515625, 0.0631103515625, 0.0163726806640625, 0.09332275390625, 0.0718994140625, 0.09405517578125, 0.06268310546875, 0.157470703125, 0.086669921875, 0.1904296875, 0.000640869140...

embed

50170540_c1

50170540

haskell

1

full if you downvoted it, or it will be closed, but anyway The code works better if in the last line I use: toString' (x:xs) = show x ++ ", " ++ (toString' xs) but still don't understand why I need the Show (I mean, why I can't remove it from the code?) UPDATE 3 I see my error with Show , if you use a variable type a a...

[ -0.00183868408203125, 0.00518798828125, 0.006927490234375, 0.007476806640625, -0.011474609375, 0.01165771484375, 0.01019287109375, 0.000823974609375, 0.006591796875, -0.00445556640625, -0.00604248046875, -0.0478515625, 0.042236328125, 0.0106201171875, -0.030029296875, -0.0072021484375,...

[ 4393, 7565, 965, 3674, 155738, 109954, 18151, 43240, 11522, 4568, 13315, 4527, 47, 71713, 214, 25, 425, 12, 7, 7639, 1022, 37223, 188, 28219, 15400, 3871, 70, 17367, 87388, 442, 18499, 678, 77336, 10644, 10, 959, 23351, 5809, 20625, 14250...

[ 0.2115478515625, 0.1009521484375, 0.1724853515625, 0.0167388916015625, 0.1239013671875, 0.057373046875, 0.188720703125, 0.1019287109375, 0.10546875, 0.1295166015625, 0.088623046875, 0.0633544921875, 0.1590576171875, 0.1572265625, 0.08636474609375, 0.08795166015625, 0.1224365234375, ...

embed

46507959_c0

46507959

haskell

0

Title: How to stop a function that going through an infinite list Problem title: How to stop a function that going through an infinite list Tags: haskell Problem: How to stop a function that going through an infinite list I'm basically trying to solve the Project Euler's question number 5. I'm trying to find the smalle...

How to stop a function that going through an infinite list How to stop a function that going through an infinite list haskell How set2 How to stop a function that going through an infinite list I'm basically trying to solve the Project Euler's question number 5. I'm trying to find the smallest number that's divisible b...

[ -0.002197265625, -0.00164794921875, 0.0234375, -0.00970458984375, 0.0181884765625, 0.003997802734375, -0.0040283203125, -0.02783203125, 0.021728515625, -0.03759765625, 0.0126953125, -0.000705718994140625, 0.0130615234375, -0.015869140625, 0.006591796875, 0.0113525390625, -0.007141113...

[ 11249, 47, 7279, 32354, 450, 7730, 8305, 54241, 13, 5303, 10, 142, 1556, 142508, 5423, 304, 31577, 86869, 27331, 5177, 603, 9655, 1892, 7413, 19336, 525, 14012, 45, 99017, 390, 106, 9193, 2060, 26785, 35166, 442, 13695, 98, 3249, 24145, ...

[ 0.10528564453125, 0.0869140625, 0.25439453125, 0.2158203125, 0.0849609375, 0.09112548828125, 0.1639404296875, 0.1624755859375, 0.081298828125, 0.2012939453125, 0.024322509765625, 0.0250244140625, 0.128662109375, 0.2186279296875, 0.135498046875, 0.1090087890625, 0.07086181640625, 0....

embed

32576173_c0

32576173

haskell

0

Title: Example of a data structure with lazy spine and strict leaves Problem title: Example of a data structure with lazy spine and strict leaves Tags: haskell, data-structures Problem: Example of a data structure with lazy spine and strict leaves One of the performance trick mentioned here is this: As a safe default: ...

Example of a data structure with lazy spine and strict leaves Example of a data structure with lazy spine and strict leaves haskell data-structures Example Example of a data structure with lazy spine and strict leaves One of the performance trick mentioned here is this: I'm having trouble imagining such a data structur...

[ 0.0277099609375, 0.025146484375, -0.0294189453125, -0.00628662109375, 0.0240478515625, 0.017822265625, 0.017333984375, -0.00848388671875, 0.010986328125, -0.033203125, 0.0164794921875, -0.010498046875, -0.007232666015625, 0.002227783203125, 0.006744384765625, 0.041259765625, 0.015502...

[ 89536, 8705, 2053, 45646, 678, 21, 3285, 25927, 13, 136, 81113, 31358, 1556, 142508, 137656, 23718, 88308, 63134, 86898, 6044, 32036, 27781, 23, 186, 191082, 7 ]

[ 0.0997314453125, 0.0274810791015625, 0.1378173828125, 0.20263671875, 0.01690673828125, 0.10028076171875, 0.1409912109375, 0.1700439453125, 0.1004638671875, 0.045867919921875, 0.239501953125, 0.18505859375, 0.107666015625, 0.2296142578125, 0.1541748046875, 0.1563720703125, 0.158447265...

embed

56761514_c0

56761514

haskell

0

Title: Difference between -> and => symbols. What do they mean? Problem title: Difference between -> and => symbols. What do they mean? Tags: haskell Problem: Difference between -> and => symbols. What do they mean? In Haskell, when we talk type declaration. I've seen both -> and => . As an example: I can m...

Difference between -> and => symbols. What do they mean? Difference between -> and => symbols. What do they mean? haskell Difference What Floating Difference between -> and => symbols. What do they mean? In Haskell, when we talk type declaration. I've seen both -> and => . As an example: I can make my own t...

[ 0.0037078857421875, 0.00701904296875, 0.0111083984375, 0.005828857421875, -0.0031280517578125, 0.0118408203125, -0.0002384185791015625, 0.0030517578125, 0.0040283203125, 0.0179443359375, 0.005462646484375, -0.039306640625, -0.0081787109375, 0.0091552734375, -0.003387451171875, -0.01696...

[ 803, 18234, 6620, 17721, 20, 1230, 5386, 136, 2203, 26582, 7, 29459, 1556, 142508, 4865, 38699, 26518, 33079, 44357, 1836, 20625, 22120, 10644, 21635, 51592, 15044, 27781, 831, 10002, 43240, 5885, 18, 864, 3198, 6275, 4527, 3229, 14847, 783...

[ 0.08966064453125, 0.1708984375, 0.0816650390625, 0.07208251953125, 0.07275390625, 0.09503173828125, 0.174072265625, 0.1214599609375, 0.1380615234375, 0.2230224609375, 0.054901123046875, 0.07696533203125, 0.08544921875, 0.22412109375, 0.00628662109375, 0.1212158203125, 0.1067504882812...

embed

58262463_c0

58262463

haskell

0

Title: Filter subsets based on length? Problem title: Filter subsets based on length? Tags: pointfree, list, lambda, haskell, function-call Problem: Filter subsets based on length? Trying to extract the subsets with length k using filter. Not sure how to approach it? The list has 100 elements . subsets :: [a] -> [[a]] ...

Filter subsets based on length? Filter subsets based on length? pointfree list lambda haskell function-call Filter x:xs x:ys Filter subsets based on length? Trying to extract the subsets with length k using filter. Not sure how to approach it? The list has 100 elements . If i use filter this is what i thought it would ...

[ 0.0050048828125, 0.04248046875, 0.007354736328125, -0.01324462890625, 0.000652313232421875, -0.00860595703125, 0.0164794921875, 0.003875732421875, 0.0203857421875, 0.01116943359375, 0.006622314453125, -0.0068359375, -0.005096435546875, 0.006103515625, -0.017822265625, 0.003036499023437...

[ 128896, 1614, 3509, 7, 35509, 98, 140909, 32, 6275, 32087, 5303, 21, 6492, 85, 1556, 142508, 32354, 85763, 1022, 425, 12, 4778, 40858, 125663, 678, 472, 17368, 46312, 9077, 51515, 805, 80854, 4527, 903, 17569, 31895, 44691, 12921, 3525 ]

[ 0.2498779296875, 0.184814453125, 0.203857421875, 0.032135009765625, 0.146484375, 0.089111328125, 0.2271728515625, 0.00250244140625, 0.101806640625, 0.194091796875, 0.1697998046875, 0.003082275390625, 0.130615234375, 0.06927490234375, 0.1268310546875, 0.2139892578125, 0.118408203125, ...

embed

58890798_c0

58890798

haskell

0

Title: Is there a GHC extension for enabling overloaded character literals? Problem title: Is there a GHC extension for enabling overloaded character literals? Tags: haskell, ghc, language-extension Problem: Is there a GHC extension for enabling overloaded character literals? I am aware that there is a GHC extension, O...

Is there a GHC extension for enabling overloaded character literals? Is there a GHC extension for enabling overloaded character literals? haskell ghc language-extension GHC OverloadedStrings Is there a GHC extension for enabling overloaded character literals? I am aware that there is a GHC extension, OverloadedStrings ...

[ 0.0242919921875, -0.01177978515625, 0.016357421875, 0.0167236328125, 0.00396728515625, 0.0084228515625, 0.0034637451171875, -0.013427734375, -0.00115966796875, -0.005340576171875, 0.00174713134765625, -0.0361328125, -0.00634765625, -0.003753662109375, -0.029296875, 0.01177978515625, ...

[ 2071, 2685, 10, 527, 73265, 111938, 100, 22, 11, 79298, 645, 63033, 297, 62816, 15659, 16765, 1556, 142508, 31380, 238, 46876, 3355, 128872, 9578, 71713, 5180, 107419, 114864, 79315, 93343, 390, 44, 24209, 35874, 178851, 21373, 88303, 123166,...

[ 0.040557861328125, 0.0830078125, 0.0777587890625, 0.1195068359375, 0.233154296875, 0.225341796875, 0.065673828125, 0.06646728515625, 0.0836181640625, 0.0982666015625, 0.166748046875, 0.2232666015625, 0.0870361328125, 0.189697265625, 0.2091064453125, 0.13330078125, 0.10552978515625, ...

embed

12025230_c0

12025230

haskell

0

Title: Function composition hint Problem title: Function composition hint Tags: monads, reader-monad, function-composition, haskell, type-inference Problem: Function composition hint just looking for an explanation how does following composition work: (=<<) . return where (=<<) :: (a -> m b) -> m a -> m b return :: a -...

Function composition hint Function composition hint monads reader-monad function-composition haskell type-inference GHCi Monad Function composition hint just looking for an explanation how does following composition work: where The final type: I cann't grasp how can match m a with (a -> m b) , ie. how can apply result ...

[ -0.01177978515625, 0.0076904296875, 0.0294189453125, 0.033447265625, 0.009765625, 0.007537841796875, 0.0091552734375, -0.0118408203125, -0.00823974609375, -0.0185546875, 0.01043701171875, -0.00567626953125, 0.00909423828125, 0.00970458984375, 0.00171661376953125, -0.0283203125, 0.002...

[ 28670, 10763, 166577, 5122, 18, 2667, 712, 155255, 3796, 32354, 277, 40322, 1556, 142508, 10644, 69988, 527, 73265, 14, 60331, 71, 187136, 3642, 14602, 25632, 4488, 7440, 2704, 27689, 254, 831, 14858, 347, 10, 678, 11, 33079, 876, 59911, ...

[ 0.1016845703125, 0.0226898193359375, 0.225830078125, 0.172119140625, 0.0692138671875, 0.058868408203125, 0.086669921875, 0.136962890625, 0.03662109375, 0.1094970703125, 0.06976318359375, 0.0689697265625, 0.039703369140625, 0.172607421875, 0.1328125, 0.045562744140625, 0.0055541992187...

embed

18297285_c0

18297285

haskell

0

Title: Haskell: Get data constructor name as string Problem title: Haskell: Get data constructor name as string Tags: reflection, generic-programming, ghc, deriving, haskell Problem: Haskell: Get data constructor name as string Let us say we have data D = X Int | Y Int Int | Z String I wish to have a function getDConst...

Haskell: Get data constructor name as string Haskell: Get data constructor name as string reflection generic-programming ghc deriving haskell Haskell Get Data.Typeable Haskell: Get data constructor name as string Let us say we have I wish to have a function getDConst that returns either "X", "Y", or "Z", according to t...

[ 0.0220947265625, -0.0098876953125, 0.00396728515625, 0.02734375, 0.027587890625, 0.018798828125, -0.0101318359375, -0.0026092529296875, 0.005401611328125, -0.0250244140625, 0.005096435546875, -0.0242919921875, -0.00872802734375, 0.01153564453125, -0.008056640625, 0.0205078125, -0.005...

[ 20625, 142508, 20779, 2053, 64549, 748, 9351, 237, 79315, 44961, 1830, 189534, 28966, 31380, 238, 16406, 1556, 11809, 196707, 2886, 5154, 765, 32599, 32354, 2046, 21960, 191, 271, 30646, 40101, 1542, 1723, 707, 1511, 59499, 11814, 107730, 391...

[ 0.111572265625, 0.22216796875, 0.10650634765625, 0.1356201171875, 0.18115234375, 0.1585693359375, 0.1478271484375, 0.1119384765625, 0.2093505859375, 0.1776123046875, 0.052947998046875, 0.1903076171875, 0.06683349609375, 0.053131103515625, 0.0860595703125, 0.05096435546875, 0.09338378...

embed

39054543_c0

39054543

haskell

0

Title: How to do inverse series sum in haskell efficiently? Problem title: How to do inverse series sum in haskell efficiently? Tags: haskell Problem: How to do inverse series sum in haskell efficiently? This is the code I am trying to convert in haskell. But immutability creates the problem. How to do calculation with...

How to do inverse series sum in haskell efficiently? How to do inverse series sum in haskell efficiently? haskell How How to do inverse series sum in haskell efficiently? This is the code I am trying to convert in haskell. But immutability creates the problem. How to do calculation without mutable variables. Creating a...

[ -0.0216064453125, 0.01190185546875, 0.0125732421875, -0.01104736328125, -0.035888671875, 0.000835418701171875, 0.002899169921875, 0.0242919921875, 0.006927490234375, -0.0257568359375, 0.01190185546875, 0.000736236572265625, 0.027099609375, -0.00616455078125, -0.00750732421875, 0.024902...

[ 11249, 54, 23, 37676, 36549, 10554, 1556, 142508, 93766, 538, 47, 18151, 31577, 96760, 566, 14311, 41159, 28282, 2967, 74481, 15490, 842, 22819, 77336, 56781, 5303, 68252, 1549, 291, 26783, 645, 32628, 88308, 53088, 144281 ]

[ 0.06378173828125, 0.07171630859375, 0.115234375, 0.2452392578125, 0.195068359375, 0.21435546875, 0.151611328125, 0.2386474609375, 0.177734375, 0.09100341796875, 0.0147857666015625, 0.1092529296875, 0.0265960693359375, 0.114990234375, 0.056060791015625, 0.1368408203125, 0.102172851562...

embed

40060162_c1

40060162

haskell

1

you write the code. If you unpack the type of Reader’s apply above, you get the following. <*> :: (r -> a -> b) -> (r -> a) -> (r -> b) -- contrast this with the type of fmap fmap :: (a -> b) -> (r -> a) -> (r -> b) So what’s the difference? The difference is that apply , unlike fmap , also takes an argument of type r...

[ 0.003875732421875, -0.0067138671875, 0.0042724609375, 0.0272216796875, -0.00176239013671875, 0.006622314453125, -0.00927734375, 0.01470947265625, 0.022216796875, 0.00396728515625, 0.02001953125, -0.003448486328125, 0.01611328125, 0.001220703125, -0.00421142578125, -0.034423828125, 0....

[ 398, 33022, 70, 18151, 51, 29102, 10644, 122636, 26, 7, 59911, 36917, 2046, 25632, 1639, 1984, 42, 33079, 10, 876, 69822, 678, 1238, 62346, 11, 2367, 60212, 5062, 2843, 51776, 10750, 1690, 26176, 221, 32635, 3642, 3249, 71, 108564, 4, 9...

[ 0.038787841796875, 0.156005859375, 0.055633544921875, 0.2071533203125, 0.0758056640625, 0.1331787109375, 0.169677734375, 0.257568359375, 0.0938720703125, 0.041961669921875, 0.2958984375, 0.00579833984375, 0.0150146484375, 0.0556640625, 0.035919189453125, 0.0160980224609375, 0.1184082...

embed

50547500_c0

50547500

haskell

0

Title: How to work with high order functions inside lists in haskell? Problem title: How to work with high order functions inside lists in haskell? Tags: haskell Problem: How to work with high order functions inside lists in haskell? I'm learning haskell by myself and I have a lot of doubts about how [f x | ......] wor...

How to work with high order functions inside lists in haskell? How to work with high order functions inside lists in haskell? haskell How How to work with high order functions inside lists in haskell? I'm learning haskell by myself and I have a lot of doubts about how works. For example I have this expression: And it r...

[ -0.0030517578125, -0.016845703125, -0.010986328125, -0.0128173828125, 0.006591796875, 0.01226806640625, -0.00885009765625, 0.0015869140625, 0.01300048828125, -0.0218505859375, 0.000362396240234375, -0.0274658203125, 0.0030670166015625, 0.00136566162109375, -0.018798828125, -0.023803710...

[ 11249, 47, 4488, 678, 11192, 12989, 32354, 7, 46132, 5303, 23, 1556, 142508, 52080, 35978, 5915, 92814, 3642, 43240, 765, 903, 125195, 3493, 30646, 12, 6183, 28219, 32497, 450, 93192, 4358, 187136, 209806, 18, 2046 ]

[ 0.0970458984375, 0.06591796875, 0.156494140625, 0.136962890625, 0.150146484375, 0.218017578125, 0.2000732421875, 0.0732421875, 0.189208984375, 0.1964111328125, 0.07757568359375, 0.138427734375, 0.2391357421875, 0.040618896484375, 0.022857666015625, 0.0145416259765625, 0.0437316894531...

embed

8261345_c0

8261345

haskell

0

Title: Why Haskell range needs spaces when using [LT .. GT]? Problem title: Why Haskell range needs spaces when using [LT .. GT]? Tags: haskell Problem: Why Haskell range needs spaces when using [LT .. GT]? Why is it that when I do range in Haskell, this works: [LT .. GT] but this doesn't: [LT..GT] and what does this c...

Why Haskell range needs spaces when using [LT .. GT]? Why Haskell range needs spaces when using [LT .. GT]? haskell Why Haskell LT..GT Failed Use Why Haskell range needs spaces when using [LT .. GT]? Why is it that when I do range in Haskell, this works: but this doesn't: and what does this cryptic error mean: However,...

[ -0.017333984375, 0.0155029296875, -0.00616455078125, -0.0024261474609375, -0.0220947265625, 0.015869140625, -0.0057373046875, -0.00799560546875, -0.021484375, 0.01190185546875, 0.00933837890625, -0.01287841796875, -0.0152587890625, -0.013427734375, 0.000919342041015625, -0.002838134765...

[ 44084, 20625, 142508, 37457, 27117, 32628, 7, 17368, 27026, 1468, 43448, 1556, 64765, 37315, 190355, 36836, 43240, 903, 22027, 18, 91190, 112569, 18499, 4527, 360, 933, 17932, 3173, 6056 ]

[ 0.0841064453125, 0.1470947265625, 0.2406005859375, 0.23095703125, 0.14892578125, 0.25830078125, 0.126708984375, 0.04974365234375, 0.1531982421875, 0.096435546875, 0.20263671875, 0.114501953125, 0.168701171875, 0.2073974609375, 0.11474609375, 0.07562255859375, 0.0853271484375, 0.007...

embed

11959764_c0

11959764

haskell

0

Title: What is the "coverage condition"? Problem title: What is the "coverage condition"? Tags: functional-dependencies, haskell Problem: What is the "coverage condition"? The source for the State transformer in mtl states: -- -------------------------------------------------------------------------...

What is the "coverage condition"? What is the "coverage condition"? functional-dependencies haskell What State Instances All UndecidableInstances What is the "coverage condition"? The source for the State transformer in mtl states: What is the "coverage condition"? All I can tell is that it has some...

[ 0.006134033203125, -0.00262451171875, 0.00634765625, 0.006561279296875, 0.0030059814453125, 0.00457763671875, -0.0037994384765625, -0.00799560546875, 0.01190185546875, 0.0003795623779296875, 0.0011444091796875, -0.0111083984375, 0.006256103515625, 0.0167236328125, -0.0006103515625, 0.0...

[ 4865, 83, 70, 63127, 4588, 35431, 123309, 105254, 1556, 142508, 22836, 116071, 3164, 79912, 24750, 2661, 31344, 27198, 56, 347, 18, 141, 117249, 9844, 47, 54, 678, 36812, 12233, 9458, 4517 ]

[ 0.06011962890625, 0.054046630859375, 0.07373046875, 0.2254638671875, 0.19873046875, 0.261962890625, 0.1248779296875, 0.117919921875, 0.1123046875, 0.195068359375, 0.1676025390625, 0.07373046875, 0.0010986328125, 0.040374755859375, 0.1202392578125, 0.059295654296875, 0.152099609375, ...

embed

13858976_c0

13858976

haskell

0

Title: hex values in haskell Problem title: hex values in haskell Tags: haskell Problem: hex values in haskell I have the following code in haskell that i want to make some changes to it: unwords . map (printf "%02X") $ zipWith (\x y -> -(fromIntegral (ord x)) + y - 2 :: Word8) "Aa123456" [0..] After running this code ...

hex values in haskell hex values in haskell haskell Word8 Aa123456 hex values in haskell I have the following code in haskell that i want to make some changes to it: After running this code i get: Basically i want the inverse of this function, so the function can get the hex values "BD 9E CF CF CF CF CF CF" and return ...

[ 0.0030670166015625, -0.0069580078125, -0.0050048828125, 0.02685546875, -0.0172119140625, 0.01153564453125, 0.012451171875, -0.0054931640625, 0.00823974609375, 0.01226806640625, 0.0198974609375, -0.0196533203125, 0.031494140625, 0.023681640625, -0.01507568359375, 0.0019683837890625, 0...

[ 764, 425, 142424, 23, 1556, 142508, 22543, 1019, 62, 11, 190875, 13683, 25632, 18151, 3444, 3249, 65572, 51042, 12506, 37676, 903, 32354, 70, 831, 2046, 48969, 483, 647, 73754, 30646, 284, 9077, 15549, 28412, 420, 63805, 3642, 139124, 26499...

[ 0.1973876953125, 0.197021484375, 0.2218017578125, 0.1129150390625, 0.170166015625, 0.242919921875, 0.15576171875, 0.197998046875, 0.0831298828125, 0.1336669921875, 0.170166015625, 0.219970703125, 0.03955078125, 0.1129150390625, 0.1075439453125, 0.014373779296875, 0.1212158203125, 0...

embed

39787541_c1

39787541

haskell

1

of the string I can just change the definition of closeBracket to closeBracket = (Parsec.char ']' >> return ()) <|> Parsec.eof But despite quite a bit of trial and error I haven't found a solution to match unmatched ] s against the start of the string. I know that the usual solution to left recursion in Parsec is the ...

[ -0.003509521484375, 0.004119873046875, -0.0263671875, 0.0155029296875, 0.004852294921875, 0.00433349609375, 0.00087738037109375, -0.03271484375, 0.01904296875, -0.00885009765625, -0.00653076171875, -0.01251220703125, -0.00909423828125, 0.002349853515625, 0.0111083984375, -0.00524902343...

[ 111, 79315, 831, 15549, 80934, 20903, 49960, 27853, 47, 2203, 28636, 39797, 9254, 268, 6396, 30646, 2392, 13, 4390, 110324, 29806, 14858, 51, 98753, 297, 10114, 91, 26548, 4034, 115723, 25737, 195625, 1830, 121293, 141, 418, 32354, 32233, 2...

[ 0.1318359375, 0.236328125, 0.024627685546875, 0.1802978515625, 0.189208984375, 0.2127685546875, 0.1888427734375, 0.2218017578125, 0.0285797119140625, 0.00311279296875, 0.0960693359375, 0.215576171875, 0.1759033203125, 0.0999755859375, 0.015716552734375, 0.222900390625, 0.126220703125...

embed

27694624_c1

27694624

haskell

1

(LevelExpr f) ts) -> (TList f ts -> LevelExpr f t) -> LevelExpr f t Var :: f t -> LevelExpr f t Vertex :: (Float, Float) -> LevelExpr f VertexId Code signals: Control.Applicative, ts, the, v1, Why, GADT, LANGUAGE, GADTs, DataKinds, PolyKinds, KindSignatures, RankNTypes, TypeOperators, TList, TNil, Applicative, WallId,...

[ 0.00140380859375, -0.003631591796875, -0.0189208984375, -0.0000324249267578125, 0.040283203125, 0.003143310546875, -0.01300048828125, -0.001068115234375, -0.002288818359375, -0.00139617919921875, 0.011474609375, -0.028564453125, 0.01416015625, 0.0172119140625, 0.0118408203125, 0.000240...

[ 5267, 2601, 19279, 10287, 1238, 61636, 33079, 41445, 1419, 84136, 808, 3323, 1984, 1446, 24371, 365, 257, 38699, 568, 71, 28864, 26073, 7, 27131, 39179, 11048, 4935, 70, 81, 418, 44084, 23749, 41072, 3358, 98064, 75930, 11809, 7250, 63306, ...

[ 0.1082763671875, 0.2254638671875, 0.1304931640625, 0.194091796875, 0.168212890625, 0.19921875, 0.09820556640625, 0.05816650390625, 0.150634765625, 0.2734375, 0.06744384765625, 0.18310546875, 0.006988525390625, 0.151123046875, 0.187255859375, 0.1064453125, 0.046051025390625, 0.16210...

embed

28922514_c0

28922514

haskell

0

Title: haskell quick sort, why the first let uses <= instead of <? Problem title: haskell quick sort, why the first let uses <= instead of <? Tags: sorting, list, haskell Problem: haskell quick sort, why the first let uses <= instead of quicksort :: (Ord a) => [a] -> [a] quicksort [] = [] quicksort (x:xs) =...

haskell quick sort, why the first let uses <= instead of <? haskell quick sort, why the first let uses <= instead of <? sorting list haskell Ord x:xs haskell quick sort, why the first let uses <= instead of in Haskell quick sort, why the first let uses <= instead of < ? I think <= will duplicate that x many...

[ -0.010986328125, 0.0086669921875, 0.0255126953125, -0.02392578125, -0.0054931640625, 0.0038299560546875, 0.00506591796875, -0.002593994140625, 0.01483154296875, 0.0277099609375, -0.004791259765625, 0.0194091796875, 0.029541015625, 0.000362396240234375, 0.0089111328125, 0.00131988525390...

[ 1556, 142508, 63773, 12096, 15400, 5117, 2633, 4527, 619, 1277, 74, 1369, 64457, 5303, 35379, 425, 4426, 20625, 5351, 1221, 171763, 67, 1022, 5941, 20028, 44084 ]

[ 0.0936279296875, 0.1683349609375, 0.143798828125, 0.1883544921875, 0.0933837890625, 0.10040283203125, 0.1839599609375, 0.0657958984375, 0.006011962890625, 0.07342529296875, 0.000701904296875, 0.161376953125, 0.10302734375, 0.093994140625, 0.10211181640625, 0.0157318115234375, 0.13549...

embed

29184644_c0

29184644

haskell

0

Title: Efficiency of Haskell Tail-recursive functions Problem title: Efficiency of Haskell Tail-recursive functions Tags: tail-recursion, recursion, haskell Problem: Efficiency of Haskell Tail-recursive functions I have the following basic Haskell code: prodsum x = prod x + sum x prod 0 = 1 prod n = n * prod (n-1) sum ...

Efficiency of Haskell Tail-recursive functions Efficiency of Haskell Tail-recursive functions tail-recursion recursion haskell Efficiency Haskell Tail-recursive n-1 Efficiency of Haskell Tail-recursive functions I have the following basic Haskell code: Can anyone explain me why the code below is more efficient:

[ -0.011474609375, -0.0027618408203125, 0.0155029296875, 0.0167236328125, 0.0021514892578125, -0.00799560546875, -0.0098876953125, -0.0093994140625, -0.000274658203125, 0.0022125244140625, 0.006927490234375, -0.007232666015625, -0.00958251953125, -0.01007080078125, 0.004486083984375, 0.0...

[ 14467, 11044, 33, 2408, 20625, 142508, 1218, 379, 107, 48650, 5844, 32354, 46741, 1830, 195625, 1556, 5759, 765, 25632, 62822, 18151, 4171, 35672, 73342, 163, 15400, 35064, 83, 1286, 93766 ]

[ 0.1240234375, 0.1634521484375, 0.100341796875, 0.038421630859375, 0.1546630859375, 0.2281494140625, 0.1610107421875, 0.1572265625, 0.067626953125, 0.1727294921875, 0.1094970703125, 0.1656494140625, 0.234130859375, 0.05499267578125, 0.1971435546875, 0.151123046875, 0.095947265625, 0...

embed

30547004_c0

30547004

haskell

0

Title: How to I get the Haskell data value from the request body in Snap framework Problem title: How to I get the Haskell data value from the request body in Snap framework Tags: haskell, haskell-snap-framework Problem: How to I get the Haskell data value from the request body in Snap framework I am new Snap and Haske...

How to I get the Haskell data value from the request body in Snap framework How to I get the Haskell data value from the request body in Snap framework haskell haskell-snap-framework the How Haskell Snap How to I get the Haskell data value from the request body in Snap framework I am new Snap and Haskell web developmen...

[ 0.00086212158203125, 0.0264892578125, -0.01220703125, -0.00439453125, -0.006317138671875, 0.040771484375, -0.0013885498046875, 0.000896453857421875, 0.00011301040649414062, -0.03662109375, -0.001708984375, -0.028564453125, -0.014892578125, -0.018798828125, 0.0067138671875, -0.005371093...

[ 11249, 87, 2046, 70, 20625, 142508, 2053, 34292, 1295, 50336, 14361, 121190, 170846, 1556, 10957, 160328, 23, 1467, 34754, 366, 184, 47, 27781, 32102, 2414, 1121, 937, 145482, 12986, 302, 1052, 525, 7844, 127, 5570, 8999 ]

[ 0.0523681640625, 0.018341064453125, 0.10260009765625, 0.06256103515625, 0.1453857421875, 0.2578125, 0.162353515625, 0.2025146484375, 0.0750732421875, 0.1812744140625, 0.1904296875, 0.2244873046875, 0.213623046875, 0.06268310546875, 0.1767578125, 0.058349609375, 0.0194549560546875, ...

embed

33894774_c0

33894774

haskell

0

Title: Haskell - Creating rectangle of 1s with height and width of user input Problem title: Haskell - Creating rectangle of 1s with height and width of user input Tags: haskell Problem: Haskell - Creating rectangle of 1s with height and width of user input I am trying to create a function that will take two integer va...

Haskell - Creating rectangle of 1s with height and width of user input Haskell - Creating rectangle of 1s with height and width of user input haskell Haskell Creating Main Haskell - Creating rectangle of 1s with height and width of user input I am trying to create a function that will take two integer values that corre...

[ 0.0031280517578125, 0.01483154296875, 0.0081787109375, 0.003387451171875, -0.002410888671875, 0.0247802734375, -0.0030670166015625, -0.01226806640625, -0.009765625, -0.0186767578125, -0.005767822265625, -0.034423828125, -0.0023193359375, -0.004638671875, 0.000911712646484375, -0.004302...

[ 20625, 142508, 56781, 148734, 449, 133, 111, 106, 7, 678, 155955, 136, 146984, 38937, 107730, 1916, 1556, 12321, 31577, 28282, 32354, 1221, 5646, 6626, 892, 1505, 142424, 42518, 140992, 1884, 221, 9842, 1679, 99, 110, 16981, 6275, 77947, 47...

[ 0.158447265625, 0.2408447265625, 0.1490478515625, 0.156494140625, 0.1492919921875, 0.1431884765625, 0.063232421875, 0.1273193359375, 0.120361328125, 0.048553466796875, 0.223388671875, 0.0877685546875, 0.1826171875, 0.1641845703125, 0.1881103515625, 0.0181427001953125, 0.134521484375,...

embed

35613184_c0

35613184

haskell

0

Title: How do I prevent GHCI from evaluating an infinite stream? Problem title: How do I prevent GHCI from evaluating an infinite stream? Tags: haskell, ghci Problem: How do I prevent GHCI from evaluating an infinite stream? Sometimes when using GHCI I accidentally try to evaluate an infinite stream (e.g. [1..] ). It k...

How do I prevent GHCI from evaluating an infinite stream? How do I prevent GHCI from evaluating an infinite stream? haskell ghci evaluating How GHCI How do I prevent GHCI from evaluating an infinite stream? Sometimes when using GHCI I accidentally try to evaluate an infinite stream (e.g. [1..] ). It keeps printing... a...

[ -0.019287109375, 0.01068115234375, 0.0179443359375, -0.01416015625, 0.0042724609375, -0.0027618408203125, 0.01611328125, -0.00921630859375, 0.005615234375, -0.030517578125, 0.0123291015625, -0.0380859375, 0.025146484375, -0.0028533935546875, 0.00689697265625, 0.0185546875, 0.01422119...

[ 11249, 54, 87, 56282, 41877, 17304, 1295, 151575, 214, 54241, 13, 75973, 1556, 142508, 31380, 318, 160193, 17368, 27998, 9790, 47, 142, 13695, 7, 2448, 1916, 136, 2967, 83, 4734, 3917, 7279, 569, 18, 130250, 388, 41884, 21771, 16940, 5600...

[ 0.0765380859375, 0.038330078125, 0.00457763671875, 0.2230224609375, 0.1575927734375, 0.2293701171875, 0.07421875, 0.2078857421875, 0.050628662109375, 0.149658203125, 0.06097412109375, 0.194091796875, 0.12548828125, 0.23779296875, 0.1461181640625, 0.1881103515625, 0.0301971435546875, ...

embed

40638337_c0

40638337

haskell

0

Title: Haskell - Quadratic Formula Problem title: Haskell - Quadratic Formula Tags: haskell, functional-programming Problem: Haskell - Quadratic Formula Today I started reading a book regarding Haskell and told myself I give it a try to implemement something basic such as the "quadratic formula". quadHelper a b c op = ...

Haskell - Quadratic Formula Haskell - Quadratic Formula haskell functional-programming Haskell Quadratic Formula NaN Haskell - Quadratic Formula Today I started reading a book regarding Haskell and told myself I give it a try to implemement something basic such as the "quadratic formula". Unfortunately, my first implem...

[ 0.018798828125, -0.00074005126953125, 0.010986328125, -0.02783203125, 0.01104736328125, -0.0025787353515625, 0.00020503997802734375, -0.00994873046875, -0.019287109375, -0.016357421875, -0.00750732421875, -0.0302734375, 0.000759124755859375, -0.0223388671875, -0.0115966796875, -0.04125...

[ 20625, 142508, 83227, 219, 9523, 72791, 20, 1556, 123309, 28966, 353, 839, 38396, 26859, 16454, 12877, 118861, 30745, 35978, 8337, 9790, 21980, 14230, 674, 9844, 62822, 111533, 26168, 185397, 5117, 208124, 22027, 18, 4488, 84751, 2046, 378, 4...

[ 0.1622314453125, 0.260009765625, 0.1336669921875, 0.1153564453125, 0.1080322265625, 0.2177734375, 0.00054931640625, 0.1505126953125, 0.152099609375, 0.1175537109375, 0.166015625, 0.1915283203125, 0.06097412109375, 0.0290985107421875, 0.1080322265625, 0.1348876953125, 0.01416015625, ...

embed

5216473_c0

5216473

haskell

0

Title: Why doesn't `putStrLn getLine` work? Problem title: Why doesn't `putStrLn getLine` work? Tags: stdio, haskell Problem: Why doesn't `putStrLn getLine` work? I'm complete newbie on Haskell. My Haskell script with GHCi , Prelude> let a = putStrLn getLine makes an error like this. <interactive>:1:17: Could...

Why doesn't `putStrLn getLine` work? Why doesn't `putStrLn getLine` work? stdio haskell Why GHCi Prelude Couldn Why doesn't `putStrLn getLine` work? I'm complete newbie on Haskell. My Haskell script with GHCi , makes an error like this. Why doesn't it work and how can I print something input from stdin ?

[ -0.007537841796875, -0.00179290771484375, 0.00225830078125, 0.0263671875, 0.000904083251953125, 0.00994873046875, 0.002655029296875, -0.00142669677734375, -0.00171661376953125, -0.018310546875, -0.0015869140625, -0.0147705078125, -0.004608154296875, -0.0002307891845703125, -0.00064086914...

[ 44084, 22027, 3768, 18, 7077, 71713, 866, 19, 2046, 93232, 4488, 6138, 5670, 1556, 142508, 527, 73265, 14, 1914, 822, 112, 191147, 28484, 9014, 20625, 26499, 18499, 1884, 903, 28412, 107730, 1295, 3035 ]

[ 0.085205078125, 0.096923828125, 0.037200927734375, 0.0869140625, 0.147216796875, 0.2142333984375, 0.108642578125, 0.107421875, 0.13427734375, 0.2100830078125, 0.133056640625, 0.1209716796875, 0.1474609375, 0.077392578125, 0.1966552734375, 0.04815673828125, 0.07757568359375, 0.14050...

embed

26705025_c0

26705025

haskell

0

Title: Pattern matching and infinite lists Problem title: Pattern matching and infinite lists Tags: fold, haskell, infinite, lazy-evaluation, list Problem: Pattern matching and infinite lists I'm having trouble understanding this simple snippet of code: -- This works: foldr go1 [] [1..] -- This doesn't: foldr go2 [] [1...

Pattern matching and infinite lists Pattern matching and infinite lists fold haskell infinite lazy-evaluation list Pattern go1 go2 Pattern matching and infinite lists I'm having trouble understanding this simple snippet of code: Folding with go1 immediately starts returning values, but go2 appears to be waiting for the...

[ -0.00121307373046875, -0.00116729736328125, 0.00055694580078125, -0.0155029296875, -0.0147705078125, 0.005096435546875, -0.0030670166015625, 0.0128173828125, 0.0223388671875, -0.0152587890625, 0.0252685546875, -0.0281982421875, -0.0026397705078125, -0.0033721923828125, -0.000633239746093...

[ 9876, 22766, 14858, 214, 136, 54241, 13, 5303, 42822, 1556, 142508, 21, 3285, 159258, 738, 418, 304, 63134, 100094, 8781, 58134, 18151, 30077, 6238, 678, 109312, 4034, 30646, 142424, 1284, 135179, 89289, 100, 3564, 111, 103510, 216806, 34831,...

[ 0.1513671875, 0.1436767578125, 0.1995849609375, 0.07391357421875, 0.0207672119140625, 0.1168212890625, 0.06439208984375, 0.1800537109375, 0.1368408203125, 0.06689453125, 0.17822265625, 0.004852294921875, 0.1080322265625, 0.091552734375, 0.1357421875, 0.117919921875, 0.1627197265625, ...

embed

20328238_c0

20328238

haskell

0

Title: Haskell sendFile function Problem title: Haskell sendFile function Tags: sendfile, network-programming, haskell Problem: Haskell sendFile function Where can I find some actual examples of sendFile function (Network.Socket.SendFile lib). When I tried to do all by official manual, I got an error: Exception: {file ...

Haskell sendFile function Haskell sendFile function sendfile network-programming haskell Haskell Exception Broken AF_INET Stream SockAddrInet Haskell sendFile function Where can I find some actual examples of sendFile function (Network.Socket.SendFile lib). When I tried to do all by official manual, I got an error: is ...

[ 0.0093994140625, 0.0050048828125, 0.000064849853515625, 0.00640869140625, 0.0019683837890625, -0.002655029296875, -0.00384521484375, -0.000797271728515625, -0.01458740234375, -0.0234375, 0.0228271484375, 0.01446533203125, -0.01708984375, 0.00421142578125, -0.00066375732421875, -0.00582...

[ 20625, 142508, 25379, 174350, 32354, 29822, 33120, 28966, 1556, 5443, 63928, 13177, 28211, 17777, 115061, 1061, 7569, 126, 7413, 8561, 27781, 24447, 18244, 8912, 27853, 294, 3611, 25474, 756, 51521, 23009, 18499, 22729, 100033, 127689, 31344 ]

[ 0.1214599609375, 0.2159423828125, 0.1805419921875, 0.306396484375, 0.164794921875, 0.287353515625, 0.08251953125, 0.075927734375, 0.0941162109375, 0.0277557373046875, 0.08953857421875, 0.1165771484375, 0.116455078125, 0.1220703125, 0.1470947265625, 0.063232421875, 0.0146636962890625,...

embed

75049887_c0

75049887

haskell

0

Title: How do you lift a binary function to monad transformers? Problem title: How do you lift a binary function to monad transformers? Tags: monads, monad-transformers, haskell Problem: How do you lift a binary function to monad transformers? I know you can lift functions to monads with liftM , but I it doesn't seem t...

How do you lift a binary function to monad transformers? How do you lift a binary function to monad transformers? monads monad-transformers haskell How ExceptT Maybe Couldn How do you lift a binary function to monad transformers? I know you can lift functions to monads with liftM , but I it doesn't seem to work with bi...

[ 0.004913330078125, 0.00384521484375, 0.01312255859375, -0.004150390625, 0.01214599609375, 0.015625, -0.0036773681640625, -0.0279541015625, 0.01434326171875, -0.03515625, 0.0181884765625, -0.01068115234375, 0.0029449462890625, 0.01202392578125, 0.018798828125, -0.024658203125, 0.01147...

[ 11249, 54, 398, 60520, 2394, 6635, 32354, 47, 2667, 712, 27198, 1314, 215175, 1556, 142508, 218288, 618, 83425, 191147, 19, 831, 7, 678, 594, 4488, 37842, 22183, 18 ]

[ 0.0831298828125, 0.0611572265625, 0.0210113525390625, 0.220703125, 0.1619873046875, 0.15234375, 0.1871337890625, 0.123779296875, 0.1318359375, 0.208984375, 0.215087890625, 0.1094970703125, 0.2005615234375, 0.0789794921875, 0.1898193359375, 0.113037109375, 0.0157012939453125, 0.1212...

embed

47187317_c0

47187317

haskell

0

Title: haskell show with function application Problem title: haskell show with function application Tags: show, haskell Problem: haskell show with function application this line of code in Haskell produces an error on compilation: lineStat :: String -> [String] lineStat xs = zipWith (\n line -> show n ++ " " ++ show $ ...

haskell show with function application haskell show with function application show haskell Char haskell show with function application this line of code in Haskell produces an error on compilation: Error: Couldn't match expected type Int -> String with actual type [Char] The first argument of ($) takes one argument,but...

[ -0.004058837890625, 0.003814697265625, 0.01544189453125, 0.033447265625, -0.005584716796875, -0.001129150390625, 0.0166015625, -0.0037384033203125, 0.000606536865234375, 0.01226806640625, -0.0186767578125, -0.01544189453125, 0.0023345947265625, 0.0107421875, -0.0101318359375, 0.0075988...

[ 1556, 142508, 7639, 678, 32354, 38415, 21656, 13315, 18151, 20625, 27489, 18499, 98, 98352, 212059, 191147, 18, 14858, 84751, 10644, 360, 33079, 23351, 214, 8561, 84068, 5117, 10750, 4369, 51776, 1632, 8789, 351, 903, 111, 43240, 44084 ]

[ 0.1207275390625, 0.200927734375, 0.1888427734375, 0.1422119140625, 0.1934814453125, 0.1702880859375, 0.1485595703125, 0.07757568359375, 0.0721435546875, 0.10205078125, 0.0694580078125, 0.157470703125, 0.0203704833984375, 0.1566162109375, 0.1304931640625, 0.06329345703125, 0.068420410...

embed

48083426_c1

48083426

haskell

1

.2 ide-haskell-cabal 2.1.0 language-haskell 1.17.2 Atom itself is version 1.23.2 x64. $ stack --version Version 1.6.3, Git revision b27e629b8c4ce369e3b8273f04db193b060000db (5454 commits) x86_64 hpack-0.20.0 I believe that everything is up-to-date. I've read https://atom-haskell.github.io/core-packages/haskell-ghc-mod/...

[ 0.006103515625, 0.007568359375, 0.007232666015625, 0.0130615234375, 0.0074462890625, 0.0247802734375, 0.0019378662109375, -0.01300048828125, -0.01507568359375, -0.01019287109375, 0.00372314453125, -0.053466796875, 0.011962890625, 0.007598876953125, 0.0091552734375, -0.004241943359375, ...

[ 5, 304, 5415, 10557, 142508, 408, 3571, 787, 102107, 46876, 38245, 179642, 69728, 68034, 83, 11389, 34635, 107033, 13307, 3650, 177261, 46354, 40647, 615, 200768, 527, 217, 111666, 3768, 4235, 125832, 13574, 2947, 28568, 48073, 152463, 375, 4...

[ 0.0513916015625, 0.12060546875, 0.2137451171875, 0.17236328125, 0.286376953125, 0.111572265625, 0.210205078125, 0.0751953125, 0.14453125, 0.161376953125, 0.08331298828125, 0.139892578125, 0.225341796875, 0.1199951171875, 0.03607177734375, 0.138427734375, 0.097900390625, 0.163818359...

embed

67644496_c0

67644496

haskell

0

Title: How to retrieve comments using Megaparsec? Problem title: How to retrieve comments using Megaparsec? Tags: parsec, megaparsec, haskell, abstract-syntax-tree Problem: How to retrieve comments using Megaparsec? I'm printing an AST in order to format the source file, from which the AST is generated using Megaparsec...

How to retrieve comments using Megaparsec? How to retrieve comments using Megaparsec? parsec megaparsec haskell abstract-syntax-tree Megaparsec How How to retrieve comments using Megaparsec? I'm printing an AST in order to format the source file, from which the AST is generated using Megaparsec. Comments are missing fr...

[ -0.01397705078125, 0.0020751953125, -0.004180908203125, 0.01239013671875, 0.003570556640625, 0.018798828125, -0.0072021484375, -0.0032958984375, -0.0003910064697265625, -0.039306640625, -0.008544921875, 0.00146484375, 0.0089111328125, -0.004241943359375, -0.02099609375, 0.0201416015625...

[ 11249, 456, 3996, 3134, 24626, 17368, 26842, 2500, 39797, 47, 366, 31534, 1556, 142508, 164789, 12654, 86531, 62600, 2448, 48963, 9384, 31344, 11435, 139392, 11427, 132283, 1295, 150661, 13695, 23491, 19514, 3917, 113054, 756, 13315, 46389, 866...

[ 0.08868408203125, 0.0955810546875, 0.148681640625, 0.1202392578125, 0.271728515625, 0.11328125, 0.1683349609375, 0.155029296875, 0.2197265625, 0.0201568603515625, 0.030120849609375, 0.1102294921875, 0.08148193359375, 0.1904296875, 0.1524658203125, 0.009796142578125, 0.1068115234375, ...

embed

3077866_c1

3077866

haskell

1

for the data streams to a set of data structures, and I can implement each processing step as a pure function. The processing steps required for one piece of data will depend on its value and others'. Some of the steps should be followed by side-effects like GUI updates or database queries. What's the 'Right' way to t...

[ -0.00007534027099609375, 0.018310546875, 0.010986328125, 0.02392578125, 0.0091552734375, 0.0281982421875, 0.014892578125, -0.0238037109375, 0.0079345703125, -0.024169921875, -0.004638671875, -0.0198974609375, -0.0050048828125, 0.01068115234375, -0.0169677734375, 0.000667572021484375, ...

[ 100, 2053, 75973, 7, 47, 5423, 45646, 87, 831, 29479, 12638, 9433, 214, 29954, 237, 34166, 32354, 98441, 56065, 63847, 56566, 98, 34292, 134629, 5609, 171760, 195490, 114419, 63399, 1052, 22553, 3917, 4817, 70, 136, 366, 6953, 26267, 6561, ...

[ 0.049591064453125, 0.155517578125, 0.2017822265625, 0.013763427734375, 0.0965576171875, 0.06280517578125, 0.1871337890625, 0.0274658203125, 0.029388427734375, 0.151123046875, 0.057098388671875, 0.1202392578125, 0.0596923828125, 0.1641845703125, 0.006866455078125, 0.1182861328125, 0.1...

embed

33194267_c0

33194267

haskell

0

Title: Haskell State Monad Problem title: Haskell State Monad Tags: haskell, state-monad Problem: Haskell State Monad Does the put function of the State Monad update the actual state or does it just return a new state with the new value? My question is, can the State Monad be used like a "global variable" in an imperat...

Haskell State Monad Haskell State Monad haskell state-monad Haskell State Monad Haskell State Monad Does the put function of the State Monad update the actual state or does it just return a new state with the new value? My question is, can the State Monad be used like a "global variable" in an imperative setting? And d...

[ -0.01318359375, 0.021484375, 0.017822265625, 0.0087890625, 0.00732421875, 0.0223388671875, -0.0162353515625, 0.00775146484375, 0.0033416748046875, 0.000644683837890625, 0.00799560546875, 0.0169677734375, -0.01458740234375, -0.002471923828125, -0.007720947265625, 0.00041961669921875, ...

[ 20625, 142508, 22836, 60331, 71, 1556, 11341, 3796, 712, 101790, 70, 3884, 32354, 28350, 8561, 707, 14602, 30646, 3525, 34292, 831, 11814, 1884, 156566, 77336, 222530, 53550, 2811, 40383, 100094, 9520, 442, 86725, 61475, 17368, 2667, 11, 1840...

[ 0.134521484375, 0.26904296875, 0.2139892578125, 0.2081298828125, 0.1849365234375, 0.12744140625, 0.1939697265625, 0.1007080078125, 0.09320068359375, 0.008819580078125, 0.002960205078125, 0.239501953125, 0.169189453125, 0.2138671875, 0.11767578125, 0.011810302734375, 0.06341552734375,...

embed

54963972_c0

54963972

haskell

0

Title: Need help to understand how this function composition works Problem title: Need help to understand how this function composition works Tags: haskell, function-composition Problem: Need help to understand how this function composition works I can understand this line of code without problem let f s = filter (isDi...

Need help to understand how this function composition works Need help to understand how this function composition works haskell function-composition Need isDigit.head Need help to understand how this function composition works I can understand this line of code without problem when I call f "123abc345" , it returns ["1...

[ -0.00194549560546875, 0.0010223388671875, -0.023193359375, 0.006591796875, -0.0205078125, 0.01513671875, 0.009033203125, 0.017822265625, 0.0101318359375, -0.0260009765625, 0.000457763671875, 0.031005859375, 0.01055908203125, 0.005706787109375, -0.0089111328125, -0.020263671875, 0.012...

[ 52889, 4358, 47, 28219, 3642, 903, 32354, 166577, 43240, 1556, 142508, 277, 40322, 83, 14055, 15769, 5, 31251, 831, 13315, 111, 18151, 15490, 11782, 1238, 48636, 2055, 238, 96060, 30646, 7, 830, 7941, 1733, 100094, 15400, 25632, 5701, 11249...

[ 0.1409912109375, 0.1124267578125, 0.04986572265625, 0.1573486328125, 0.1185302734375, 0.132080078125, 0.1993408203125, 0.25732421875, 0.1668701171875, 0.161376953125, 0.2371826171875, 0.1376953125, 0.1632080078125, 0.1593017578125, 0.1024169921875, 0.1766357421875, 0.0614013671875, ...

embed

57129956_c2

57129956

haskell

2

5 num7 = App suc num6 num8 = App suc num7 num9 = App suc num8 num10 = App suc num9 fv (Var x) = [x] fv (Lam x e) = delete x (fv e) fv (App e1 e2) = union (fv e1) (fv e2) rename x y (Var z) | x == z = Var y | otherwise = Var z rename x y (Lam z e) | x == z = Lam y (rename x y e) | otherwise = Lam z (rename x y e) rename...

[ 0.01043701171875, 0.0155029296875, -0.007110595703125, 0.0018310546875, 0.0201416015625, 0.01226806640625, -0.006011962890625, 0.0106201171875, 0.021728515625, 0.00860595703125, -0.01434326171875, -0.0162353515625, 0.01904296875, -0.00008821487426757812, 0.0020904541015625, -0.0234375,...

[ 190, 13269, 966, 2203, 5659, 42593, 910, 1019, 1126, 963, 1238, 334, 81827, 1022, 425, 2729, 39, 28, 154109, 15, 39179, 418, 10461, 69941, 17727, 456, 11627, 113, 97, 58745, 6, 69112, 3323, 120262, 59387, 107, 196842, 21320, 28864, 26073,...

[ 0.190185546875, 0.25732421875, 0.2298583984375, 0.1568603515625, 0.255615234375, 0.1907958984375, 0.1768798828125, 0.188232421875, 0.215087890625, 0.233642578125, 0.04132080078125, 0.1668701171875, 0.214599609375, 0.2440185546875, 0.091552734375, 0.1732177734375, 0.2076416015625, 0...

embed

64668462_c0

64668462

haskell

0

Title: haskell combinations with repetition Problem title: haskell combinations with repetition Tags: haskell Problem: haskell combinations with repetition Here is my function that generates all combinations for k items from given set: combR :: [t] -> Int -> [[t]] combR _ 0 = [ [] ] combR [] k = [] combR (x:xs) k = com...

haskell combinations with repetition haskell combinations with repetition haskell x:xs x:t k-1 haskell combinations with repetition Here is my function that generates all combinations for k items from given set: However, what it does is, that it only generates combinations without repetition and does not include those,...

[ -0.0301513671875, 0.025634765625, 0.00634765625, -0.00811767578125, 0.006622314453125, -0.004608154296875, -0.01043701171875, -0.0031280517578125, 0.00897216796875, -0.003021240234375, 0.004730224609375, -0.0028839111328125, 0.04296875, 0.02392578125, -0.01263427734375, 0.0224609375, ...

[ 1556, 142508, 162515, 678, 57346, 1363, 1022, 425, 7, 18, 472, 5759, 759, 32354, 139392, 756, 55769, 1295, 34475, 5423, 33306, 14602, 4734, 15490, 959, 26698, 5608, 119140, 107730, 375, 275, 1052, 2389, 133063, 116, 140992, 76172, 90173, 20...

[ 0.1534423828125, 0.207763671875, 0.2294921875, 0.0968017578125, 0.263427734375, 0.0204925537109375, 0.05145263671875, 0.0660400390625, 0.028106689453125, 0.065673828125, 0.119384765625, 0.13916015625, 0.0251922607421875, 0.1429443359375, 0.1646728515625, 0.057159423828125, 0.14636230...

embed

17904830_c0

17904830

haskell

0

Title: Syntactic correctness of a function Problem title: Syntactic correctness of a function Tags: haskell Problem: Syntactic correctness of a function Here is a definition of a function: fmap :: (a -> b) -> f a -> f b Can you guys explain what it means exactly? The thing I don't understand are f a and f b : why is it...

Syntactic correctness of a function Syntactic correctness of a function haskell Syntactic Syntactic correctness of a function Here is a definition of a function: Can you guys explain what it means exactly? The thing I don't understand are f a and f b : why is it possible to write this way? I mean, why is it syntaсtic c...

[ 0.006134033203125, -0.00160980224609375, -0.0115966796875, 0.005218505859375, -0.00421142578125, 0.0205078125, -0.00384521484375, 0.021240234375, 0.005615234375, 0.009033203125, -0.01043701171875, -0.03173828125, -0.00811767578125, 0.01190185546875, 0.00885009765625, -0.004791259765625...

[ 19010, 102, 49086, 26785, 7432, 111, 32354, 1556, 142508, 10, 80934, 4171, 73342, 2367, 442, 26950, 66161, 13580, 2301, 18, 28219, 1238, 136, 876, 15400, 83, 7722, 33022, 903, 3917, 6002, 9523, 9969, 1340, 5299, 5608, 4734, 1632, 77336, 3...

[ 0.1541748046875, 0.1910400390625, 0.1817626953125, 0.2244873046875, 0.07171630859375, 0.051055908203125, 0.2362060546875, 0.144287109375, 0.2109375, 0.097412109375, 0.177001953125, 0.0068359375, 0.10589599609375, 0.0482177734375, 0.06219482421875, 0.13916015625, 0.08123779296875, 0...

embed

25476248_c0

25476248

haskell

0

Title: Powerset Function 1-Liner Problem title: Powerset Function 1-Liner Tags: haskell Problem: Powerset Function 1-Liner Learn You a Haskell demonstrates the powerset function: The powerset of some set is a set of all subsets of that set. powerset :: [a] -> [[a]] powerset xs = filterM (\x -> [True, False]) xs And run...

Powerset Function 1-Liner Powerset Function 1-Liner haskell Powerset Liner Monad Bool Powerset Function 1-Liner Learn You a Haskell demonstrates the powerset function: And running it: What's going on here? I see filterM 's signature (shown below), but I don't understand how it's executing. filterM :: Monad m => (a -> m...

[ 0.0029296875, -0.00628662109375, 0.01373291015625, -0.006378173828125, 0.0045166015625, 0.006744384765625, 0.01385498046875, -0.005126953125, 0.01025390625, -0.00604248046875, 0.0001354217529296875, 0.0198974609375, -0.01611328125, -0.00173187255859375, 0.0009002685546875, 0.0235595703...

[ 17170, 3509, 28670, 4317, 93232, 42, 1556, 142508, 16777, 60331, 71, 2460, 929, 134031, 2583, 20625, 106804, 14537, 32354, 51042, 442, 4865, 7730, 98, 3688, 1957, 46312, 594, 138256, 35064, 2301, 18, 28219, 3642, 71924, 214, 1984, 347, 4435...

[ 0.2073974609375, 0.265380859375, 0.1490478515625, 0.07000732421875, 0.1658935546875, 0.06817626953125, 0.1142578125, 0.27001953125, 0.1490478515625, 0.1492919921875, 0.1365966796875, 0.09320068359375, 0.1978759765625, 0.1090087890625, 0.0733642578125, 0.1324462890625, 0.13720703125, ...

embed

46691651_c0

46691651

haskell

0

Title: Why is the definition of null function in Haskell Prelude so strange? Problem title: Why is the definition of null function in Haskell Prelude so strange? Tags: compiler-optimization, functional-programming, haskell Problem: Why is the definition of null function in Haskell Prelude so strange? The definition of ...

Why is the definition of null function in Haskell Prelude so strange? Why is the definition of null function in Haskell Prelude so strange? compiler-optimization functional-programming haskell Why Haskell Prelude Bool _:_ Why is the definition of null function in Haskell Prelude so strange? The definition of null funct...

[ 0.0115966796875, -0.001617431640625, 0.0279541015625, -0.010986328125, -0.01068115234375, 0.01043701171875, 0.010009765625, -0.024169921875, 0.00726318359375, 0.013671875, 0.010498046875, -0.01104736328125, 0.001922607421875, -0.0074462890625, 0.01116943359375, -0.01104736328125, 0.0...

[ 44084, 80934, 56574, 32354, 20625, 142508, 1914, 822, 112, 221, 114453, 9969, 34759, 100433, 123309, 1556, 2460, 929, 111, 55681, 50960, 13315, 15400, 33022, 54, 87235 ]

[ 0.065673828125, 0.1812744140625, 0.26708984375, 0.2218017578125, 0.12109375, 0.2279052734375, 0.1160888671875, 0.17529296875, 0.13720703125, 0.06280517578125, 0.1400146484375, 0.0794677734375, 0.0989990234375, 0.0765380859375, 0.096435546875, 0.0667724609375, 0.06768798828125, 0.13...

embed