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
36007149_c1	36007149	haskell	1	-> FunPtr RebalanceCbFun -> IO () I don't understand what part is missing Ptr or FunPtr here. I also tried to wrap the whole rdKafkaConfSetRebalanceCb into FunPtr like: foreign import ccall unsafe "rd_kafka.h &rd_kafka_conf_set_rebalance_cb" rdKafkaConfSetRebalanceCb :: FunPtr (Ptr RdKafkaConfT -> FunPtr RebalanceCbFu...	-> FunPtr RebalanceCbFun -> IO () I don't understand what part is missing Ptr or FunPtr here. I also tried to wrap the whole rdKafkaConfSetRebalanceCb into FunPtr like: foreign import ccall unsafe "rd_kafka.h &rd_kafka_conf_set_rebalance_cb" rdKafkaConfSetRebalanceCb :: FunPtr (Ptr RdKafkaConfT -> FunPtr RebalanceCbFu...	[ 0.00185394287109375, 0.006103515625, -0.01446533203125, -0.00396728515625, -0.0024261474609375, -0.002197265625, -0.005340576171875, -0.00811767578125, 0.007537841796875, -0.0037994384765625, -0.0172119140625, -0.00799560546875, -0.00823974609375, -0.006988525390625, -0.01544189453125, ...	[ 33079, 28670, 683, 4448, 853, 173212, 441, 275, 97249, 17780, 28219, 2831, 132283, 436, 3688, 37842, 137565, 28271, 4216, 2407, 161, 11935, 420, 294, 126, 4332, 3934, 110613, 24927, 85763, 115840, 127, 70547, 3509, 107, 71, 618, 10422, 9969...	[ 0.0035400390625, 0.1629638671875, 0.1170654296875, 0.258056640625, 0.0841064453125, 0.28662109375, 0.03375244140625, 0.1409912109375, 0.1981201171875, 0.20947265625, 0.096923828125, 0.1270751953125, 0.1907958984375, 0.074951171875, 0.034423828125, 0.030975341796875, 0.1383056640625, ...	embed
29380363_c0	29380363	haskell	0	Title: how to parse a uniprot-file with parsec? Problem title: how to parse a uniprot-file with parsec? Tags: haskell Problem: how to parse a uniprot-file with parsec? I am a newbie to Haskell, but it seems like a powerful language that I want to learn. I was adopting some code from the chapter in real world Haskell on...	how to parse a uniprot-file with parsec? how to parse a uniprot-file with parsec? haskell ParseError Text.ParserCombinators.Parsec Either uniprot_sprot.fasta how to parse a uniprot-file with parsec? I am a newbie to Haskell, but it seems like a powerful language that I want to learn. I was adopting some code from the c...	[ -0.00927734375, 0.020751953125, -0.0029144287109375, 0.0234375, -0.0025634765625, -0.0034332275390625, 0.004852294921875, -0.03515625, -0.0106201171875, -0.0145263671875, -0.006256103515625, 0.0011138916015625, 0.01007080078125, -0.003570556640625, 0.00653076171875, 0.00048828125, 0....	[ 3642, 366, 184, 19844, 18606, 29822, 678, 39797, 1556, 142508, 2392, 18468, 31611, 24129, 28636, 2189, 19155, 22230, 39473, 11, 9014, 20625, 113138, 46876, 30698, 30666, 18151, 139539, 2773, 8999, 10002, 11389, 10941, 11435, 58055, 115923, 4034...	[ 0.05572509765625, 0.1591796875, 0.1248779296875, 0.1717529296875, 0.3115234375, 0.1988525390625, 0.06787109375, 0.26318359375, 0.06768798828125, 0.2100830078125, 0.10791015625, 0.0703125, 0.052032470703125, 0.10040283203125, 0.1099853515625, 0.06231689453125, 0.1468505859375, 0.084...	embed
7288929_c0	7288929	haskell	0	Title: Coerce to multiple-parameter type in Haskell Problem title: Coerce to multiple-parameter type in Haskell Tags: coercion, polymorphism, haskell Problem: Coerce to multiple-parameter type in Haskell I have a type class IntegerAsType a where value :: a -> Integer data T5 instance IntegerAsType T5 where value _ = 5 ...	Coerce to multiple-parameter type in Haskell Coerce to multiple-parameter type in Haskell coercion polymorphism haskell Coerce Haskell IntegerAsType Integer Num PolyRing Couldn Coerce to multiple-parameter type in Haskell I have a type My main question is: how do I define a variable in a particular PolyRing ? It should...	[ -0.033447265625, 0.002044677734375, -0.004669189453125, 0.0169677734375, -0.0081787109375, 0.0032958984375, -0.009033203125, -0.005126953125, 0.006134033203125, -0.00982666015625, -0.0021209716796875, -0.02783203125, 0.0223388671875, -0.01177978515625, -0.033447265625, -0.0252685546875...	[ 1311, 56, 329, 47, 48716, 6276, 29089, 10644, 20625, 142508, 23, 552, 6447, 35874, 178851, 1556, 44401, 19659, 196707, 52782, 63306, 1052, 214, 191147, 765, 5201, 9655, 3642, 61924, 77336, 17311, 1650, 5351, 581, 26785, 6002, 86531, 7103, 7...	[ 0.1107177734375, 0.18310546875, 0.1375732421875, 0.073974609375, 0.19384765625, 0.0999755859375, 0.1309814453125, 0.1920166015625, 0.14892578125, 0.241943359375, 0.048980712890625, 0.05572509765625, 0.07476806640625, 0.1055908203125, 0.1485595703125, 0.13525390625, 0.1475830078125, ...	embed
45967186_c0	45967186	haskell	0	Title: Two function calls but only one trace displayed Problem title: Two function calls but only one trace displayed Tags: trace, haskell, ghc Problem: Two function calls but only one trace displayed With GHC version 8.0.2 the following program: import Debug.Trace f=trace("f was called")$(+1) main = do print $ f 1 pri...	Two function calls but only one trace displayed Two function calls but only one trace displayed trace haskell ghc Debug.Trace Two called:1 called:2 Two function calls but only one trace displayed With GHC version 8.0.2 the following program: outputs: Is it the expected behaviour? If yes, why? I expected the string f wa...	[ 0.0216064453125, -0.00982666015625, -0.006805419921875, 0.0167236328125, 0.00836181640625, 0.0078125, 0.0034027099609375, 0.00180816650390625, 0.00927734375, 0.006256103515625, 0.01318359375, -0.0135498046875, -0.0250244140625, 0.0033416748046875, 0.007781982421875, 0.00872802734375, ...	[ 32964, 32354, 11782, 7, 1284, 4734, 1632, 144851, 44116, 1556, 142508, 31380, 238, 262, 85779, 28542, 329, 35839, 19721, 304, 527, 73265, 11389, 3217, 133684, 25632, 1528, 140992, 2071, 70, 84751, 224833, 72272, 15400, 79315, 1238, 509, 28412...	[ 0.18359375, 0.2083740234375, 0.2294921875, 0.06103515625, 0.0819091796875, 0.157958984375, 0.167724609375, 0.2548828125, 0.1898193359375, 0.1212158203125, 0.208984375, 0.146728515625, 0.1182861328125, 0.087646484375, 0.20849609375, 0.17822265625, 0.06243896484375, 0.181640625, 0....	embed
7924251_c0	7924251	haskell	0	Title: haskell -- odd ambiguous type variable error message for code in "where" statement with TypeFamilies extension Problem title: haskell -- odd ambiguous type variable error message for code in "where" statement with TypeFamilies extension Tags: ambiguity, ghc, types, haskell Problem: haskell --...	haskell -- odd ambiguous type variable error message for code in "where" statement with TypeFamilies extension haskell -- odd ambiguous type variable error message for code in "where" statement with TypeFamilies extension ambiguity ghc types haskell a TypeFamilies LANGUAGE NoMonomorphismRestriction ...	[ 0.01416015625, -0.0120849609375, -0.01141357421875, -0.0078125, 0.01123046875, -0.0027008056640625, -0.0174560546875, 0.0021820068359375, -0.0042724609375, -0.003570556640625, 0.01409912109375, -0.032958984375, 0.016357421875, -0.01953125, 0.00897216796875, 0.0113525390625, 0.0158691...	[ 1556, 142508, 70270, 920, 12282, 10821, 10644, 77336, 18499, 26008, 18151, 136913, 63805, 60457, 919, 1191, 25720, 111938, 678, 31380, 238, 52895, 98064, 438, 46674, 178851, 7655, 8647, 44401, 127, 24864, 12221, 10250, 1250, 275, 2886, 190355, ...	[ 0.14697265625, 0.27294921875, 0.1341552734375, 0.1141357421875, 0.2001953125, 0.011566162109375, 0.1439208984375, 0.2178955078125, 0.1636962890625, 0.086669921875, 0.1768798828125, 0.1981201171875, 0.1771240234375, 0.19287109375, 0.042510986328125, 0.0975341796875, 0.10162353515625, ...	embed
6401936_c2	6401936	haskell	2	ghc-prim ... linking ... done. Loading package integer-gmp ... linking ... done. Loading package base ... linking ... done. Prelude> t <- Data.HashTable.new (==) Data.HashTable.hashString * Parser: * Desugar: * Simplify: * CorePrep: * ByteCodeGen: Prelude> Data.HashTable.insert t "Joni" 1 * Parser: <intera...	ghc-prim ... linking ... done. Loading package integer-gmp ... linking ... done. Loading package base ... linking ... done. Prelude> t <- Data.HashTable.new (==) Data.HashTable.hashString * Parser: * Desugar: * Simplify: * CorePrep: * ByteCodeGen: Prelude> Data.HashTable.insert t "Joni" 1 * Parser: <intera...	[ -0.020751953125, -0.006378173828125, 0.01031494140625, 0.0067138671875, 0.00634765625, 0.01239013671875, -0.004486083984375, -0.017822265625, 0.01409912109375, -0.0255126953125, -0.0198974609375, -0.0162353515625, -0.0096435546875, 0.010986328125, 0.0086669921875, 0.00762939453125, 0...	[ 31380, 238, 9, 35188, 153, 3126, 214, 16940, 228006, 98169, 892, 1505, 177, 2676, 3647, 1914, 822, 112, 808, 11809, 6495, 1495, 618, 2886, 54936, 69112, 126234, 71713, 2392, 5581, 34, 1970, 55331, 28574, 31365, 19273, 3311, 67, 114211, 10...	[ 0.185302734375, 0.1806640625, 0.047607421875, 0.277587890625, 0.04376220703125, 0.172119140625, 0.08477783203125, 0.130859375, 0.218505859375, 0.1826171875, 0.1434326171875, 0.050079345703125, 0.04144287109375, 0.223388671875, 0.16748046875, 0.0889892578125, 0.161376953125, 0.01321...	embed
23483849_c0	23483849	haskell	0	Title: Standard Haskell development environment as of 2014 Problem title: Standard Haskell development environment as of 2014 Tags: emacs, haskell Problem: Standard Haskell development environment as of 2014 This question might be duplicate of https://stackoverflow.com/questions/68504/what-are-my-ide-editor-choices-for...	Standard Haskell development environment as of 2014 Standard Haskell development environment as of 2014 emacs haskell Standard Haskell Standard Haskell development environment as of 2014 This question might be duplicate of https://stackoverflow.com/questions/68504/what-are-my-ide-editor-choices-for-haskell , but the an...	[ 0.00372314453125, -0.00115966796875, -0.0023040771484375, -0.002166748046875, -0.01031494140625, 0.033447265625, -0.01495361328125, -0.007598876953125, -0.003173828125, -0.021240234375, -0.002349853515625, -0.00958251953125, 0.00567626953125, -0.00031280517578125, 0.006805419921875, -0...	[ 20744, 20625, 142508, 34754, 65998, 237, 1049, 352, 2263, 7, 1556, 111, 171763, 118664, 124409, 1046, 1176, 2506, 175583, 3089, 2980, 2472, 10557, 4358, 169549, 31577, 33022, 10975, 678, 959, 3525, 9014, 97384, 1492, 75935, 103391, 5570, 8526...	[ 0.200927734375, 0.1790771484375, 0.26318359375, 0.1561279296875, 0.2119140625, 0.056671142578125, 0.2529296875, 0.09600830078125, 0.130126953125, 0.00732421875, 0.1328125, 0.0144805908203125, 0.009521484375, 0.03509521484375, 0.01629638671875, 0.014373779296875, 0.060394287109375, ...	embed
72067550_c0	72067550	haskell	0	Title: Where is Haskell's or GHC's main defined? Problem title: Where is Haskell's or GHC's main defined? Tags: language-lawyer, program-entry-point, standards, haskell Problem: Where is Haskell's or GHC's main defined? In Haskell, the execution of a compiled program starts with executing main in mo...	Where is Haskell's or GHC's main defined? Where is Haskell's or GHC's main defined? language-lawyer program-entry-point standards haskell Where Haskell GHC Main Where is Haskell's or GHC's main defined? In Haskell, the execution of a compiled program starts with executing main in module Main . This ...	[ 0.0244140625, 0.02783203125, 0.00830078125, 0.01361083984375, -0.0106201171875, 0.0087890625, 0.007537841796875, 0.00274658203125, -0.0196533203125, -0.020263671875, 0.000095367431640625, -0.0242919921875, -0.0150146484375, -0.0113525390625, 0.0196533203125, 0.005828857421875, 0.0123...	[ 78662, 83, 20625, 142508, 3768, 707, 527, 73265, 5201, 61924, 71, 32, 46876, 19729, 8889, 1528, 33, 15123, 38496, 5570, 1556, 12321, 25, 360, 71924, 1830, 10, 375, 5974, 4034, 7, 678, 214, 23, 88996, 3293, 32354, 8110, 10644, 17780, 910...	[ 0.1490478515625, 0.097412109375, 0.1981201171875, 0.316650390625, 0.08837890625, 0.0574951171875, 0.152099609375, 0.25634765625, 0.283447265625, 0.2493896484375, 0.1429443359375, 0.001922607421875, 0.0855712890625, 0.0765380859375, 0.046844482421875, 0.22314453125, 0.03857421875, 0...	embed
75018725_c1	75018725	haskell	1	.tar.xz.tmp", [ ... ] "https://downloads.haskell.org/~ghc/9.4.3/ghc-9.4.3-x86_64-unknown-mingw32.tar.xz"] failed with exit code 35. [ Error ] Also check the logs in C:\ghcup\logs This is what logs say: Debug: Identified Platform as: Windows Debug: last access was 9.7176814s ago, cache interval is 300s Debug: Decoding y...	.tar.xz.tmp", [ ... ] "https://downloads.haskell.org/~ghc/9.4.3/ghc-9.4.3-x86_64-unknown-mingw32.tar.xz"] failed with exit code 35. [ Error ] Also check the logs in C:\ghcup\logs This is what logs say: Debug: Identified Platform as: Windows Debug: last access was 9.7176814s ago, cache interval is 300s Debug: Decoding y...	[ 0.0038604736328125, 0.0255126953125, 0.025634765625, -0.01226806640625, 0.0028839111328125, -0.009521484375, -0.03173828125, -0.0125732421875, 0.01190185546875, 0.0322265625, 0.0125732421875, -0.0067138671875, -0.001190185546875, -0.002838134765625, 0.0031890869140625, -0.0007591247558...	[ 867, 425, 169, 18, 2676, 10114, 61754, 10557, 142508, 1478, 9486, 238, 22364, 158406, 15205, 15276, 13307, 309, 69723, 19, 14578, 434, 6460, 165523, 82230, 18151, 2273, 212059, 12765, 12684, 313, 33874, 4867, 5154, 262, 85779, 189543, 297, ...	[ 0.1871337890625, 0.06365966796875, 0.1348876953125, 0.034759521484375, 0.2103271484375, 0.00030517578125, 0.1907958984375, 0.124267578125, 0.275390625, 0.0802001953125, 0.14453125, 0.14208984375, 0.13427734375, 0.2724609375, 0.1656494140625, 0.21630859375, 0.19677734375, 0.06219482...	embed
4279627_c0	4279627	haskell	0	Title: Correct ReadP usage in Haskell Problem title: Correct ReadP usage in Haskell Tags: haskell, parsing Problem: Correct ReadP usage in Haskell I did a very simple parser for lists of numbers in a file, using ReadP in Haskell. It works, but it is very slow... is this normal behavior of this type of parser or am I do...	Correct ReadP usage in Haskell Correct ReadP usage in Haskell haskell parsing Text.ParserCombinators.ReadP qualified Data.Char Correct ReadP Haskell Data.IntSet IntSet IntSet.IntSet int_list sepBy1 IntSet.fromList many1 whole_file readP_to_S Correct ReadP usage in Haskell I did a very simple parser for lists of numbers...	[ -0.01251220703125, 0.00982666015625, 0.019775390625, 0.007568359375, -0.01141357421875, 0.018798828125, -0.002197265625, -0.0220947265625, -0.00194549560546875, -0.02587890625, 0.008544921875, -0.004180908203125, 0.01025390625, -0.0252685546875, -0.00982666015625, 0.00555419921875, -...	[ 46348, 15390, 4764, 683, 127689, 20625, 142508, 23, 1556, 366, 24129, 28636, 2189, 19155, 22230, 31345, 217225, 11809, 84068, 18, 294, 126, 6562, 25040, 75358, 161063, 154663, 5941, 418, 28271, 29822, 12301, 188, 4552, 8781, 100, 5303, 101935...	[ 0.149169921875, 0.06182861328125, 0.2117919921875, 0.2296142578125, 0.1624755859375, 0.1414794921875, 0.2274169921875, 0.00433349609375, 0.125, 0.1268310546875, 0.091552734375, 0.10321044921875, 0.129150390625, 0.1256103515625, 0.052520751953125, 0.1605224609375, 0.155517578125, 0....	embed
9524884_c0	9524884	haskell	0	Title: How to print data of Map as a table? Problem title: How to print data of Map as a table? Tags: haskell Problem: How to print data of Map as a table? I have a Map (Int, Int) a where a can be any type. Based on the Tuple2 stored in the array as key I wanna create a String table which stores the values of the map. ...	How to print data of Map as a table? How to print data of Map as a table? haskell How Map Array.ofDim table.rows How to print data of Map as a table? I have a Map (Int, Int) a where a can be any type. Based on the Tuple2 stored in the array as key I wanna create a String table which stores the values of the map. Becaus...	[ 0.0125732421875, -0.00897216796875, 0.004302978515625, 0.00052642822265625, -0.01434326171875, 0.000743865966796875, 0.006072998046875, 0.00176239013671875, 0.0034942626953125, 0.022216796875, -0.00101470947265625, -0.00970458984375, 0.01019287109375, 0.01190185546875, -0.00677490234375,...	[ 11249, 47, 28412, 2053, 111, 42719, 237, 10, 23180, 1556, 142508, 69253, 53, 4390, 397, 464, 15555, 4153, 18, 360, 831, 2499, 10644, 44978, 1371, 8705, 304, 4343, 10298, 22799, 6165, 28282, 23351, 214, 142424, 22288, 111340, 51529, 5117, ...	[ 0.09466552734375, 0.03497314453125, 0.2410888671875, 0.201416015625, 0.130615234375, 0.25244140625, 0.1590576171875, 0.099853515625, 0.259521484375, 0.111083984375, 0.2275390625, 0.09735107421875, 0.05902099609375, 0.15966796875, 0.08331298828125, 0.149658203125, 0.1500244140625, 0...	embed
67153496_c1	67153496	haskell	1	fits their description: "Currently it has * and k~>k as the only alternatives"). Thus, the (forall a::k1 . (t::k2)) formula means that if we take an inhabited type k1 , it can be mapped onto another k2 iff it is inhabited (due to Curry-Howard working for kinds the same way it works for types). Is that right? (P.S.: I s...	fits their description: "Currently it has * and k~>k as the only alternatives"). Thus, the (forall a::k1 . (t::k2)) formula means that if we take an inhabited type k1 , it can be mapped onto another k2 iff it is inhabited (due to Curry-Howard working for kinds the same way it works for types). Is that right? (P.S.: I s...	[ 0.00994873046875, 0.0009613037109375, 0.009033203125, -0.0181884765625, 0.01348876953125, -0.020751953125, -0.005767822265625, -0.0184326171875, 0.007232666015625, -0.01446533203125, 0.005157470703125, -0.01422119140625, -0.007598876953125, 0.0205078125, 0.002777099609375, -0.014465332...	[ 11177, 76811, 474, 15724, 1556, 661, 136, 472, 2306, 2740, 92, 4734, 30700, 5584, 10, 418, 5, 18, 10461, 26168, 26950, 2174, 5646, 23, 54815, 10644, 831, 291, 48398, 98, 188, 15700, 304, 32920, 17065, 1294, 11193, 19364, 20697, 8562, 43...	[ 0.0908203125, 0.068603515625, 0.007080078125, 0.05621337890625, 0.00634765625, 0.0684814453125, 0.0308837890625, 0.1119384765625, 0.016143798828125, 0.050811767578125, 0.12939453125, 0.094482421875, 0.1728515625, 0.0799560546875, 0.091064453125, 0.1441650390625, 0.02386474609375, 0...	embed
38252767_c0	38252767	haskell	0	Title: Haskell: Data Type error by parsing Problem title: Haskell: Data Type error by parsing Tags: haskell Problem: Haskell: Data Type error by parsing I have a string that I Need to parse to Array of Array or otherwise. This is the Code I have import Test.HUnit (runTestTT,Test(TestLabel,TestList),(~?=)) import qualif...	Haskell: Data Type error by parsing Haskell: Data Type error by parsing haskell Test.HUnit qualified Text.ParserCombinators.Parsec Text.Parsec.String Text.Parsec.Char Text.PrettyPrint.HughesPJ Data.Maybe Data.List.Split Haskell Data Type Test TestLabel TestList Text.Parsec CSV Row Show Parser Maybe P.runP Left Nothing ...	[ -0.0026092529296875, 0.00885009765625, 0.002349853515625, 0.040771484375, 0.002777099609375, 0.01434326171875, -0.01171875, -0.016845703125, -0.0096435546875, 0.0216064453125, -0.00506591796875, -0.0299072265625, 0.0189208984375, -0.01068115234375, -0.0089111328125, -0.0011520385742187...	[ 20625, 142508, 11809, 60457, 18499, 390, 366, 6953, 12, 1556, 8647, 27204, 6773, 217225, 24129, 28636, 2189, 19155, 22230, 39797, 71713, 84068, 19273, 15145, 112079, 18788, 78934, 154663, 5, 4353, 4063, 43486, 96190, 17367, 2392, 83425, 16428, ...	[ 0.1400146484375, 0.222412109375, 0.1224365234375, 0.2607421875, 0.18994140625, 0.0439453125, 0.1705322265625, 0.07763671875, 0.0169525146484375, 0.14453125, 0.1005859375, 0.047027587890625, 0.1197509765625, 0.140625, 0.0950927734375, 0.0999755859375, 0.10284423828125, 0.13134765625...	embed
26843529_c0	26843529	haskell	0	Title: Haskell Fibonacci Explanation Problem title: Haskell Fibonacci Explanation Tags: lazy-evaluation, thunk, haskell, functional-programming, fibonacci Problem: Haskell Fibonacci Explanation I am quite new to Haskell and I'm trying to wrap my head around how the lazy expression of Fibonacci sequences work. I know th...	Haskell Fibonacci Explanation Haskell Fibonacci Explanation lazy-evaluation thunk haskell functional-programming fibonacci Haskell Fibonacci Explanation Haskell Fibonacci Explanation I am quite new to Haskell and I'm trying to wrap my head around how the lazy expression of Fibonacci sequences work. I know this has been...	[ 0.01519775390625, 0.009765625, 0.0007476806640625, 0.009033203125, -0.00555419921875, 0.005828857421875, 0.0036163330078125, -0.004638671875, 0.00732421875, 0.004241943359375, 0.003326416015625, -0.000885009765625, -0.005523681640625, 0.0174560546875, 0.01275634765625, 0.01373291015625...	[ 20625, 142508, 3698, 20990, 52544, 5443, 5868, 21, 3285, 159258, 5675, 3678, 1556, 123309, 28966, 809, 32233, 3525, 10336, 125195, 40, 26513, 4488, 21176, 16750, 18151, 74413, 21533, 17368, 68330, 194583, 28219, 218500, 7, 6626, 5303, 25842, ...	[ 0.1435546875, 0.245361328125, 0.12158203125, 0.1514892578125, 0.183837890625, 0.015869140625, 0.114501953125, 0.1407470703125, 0.2071533203125, 0.1375732421875, 0.03253173828125, 0.194580078125, 0.1142578125, 0.094482421875, 0.0489501953125, 0.1768798828125, 0.007354736328125, 0.00...	embed
48139031_c0	48139031	haskell	0	Title: Is it possible to generate record fields in haskell? Problem title: Is it possible to generate record fields in haskell? Tags: template-haskell, haskell, code-generation, record Problem: Is it possible to generate record fields in haskell? Suppose I have a prefix p and list of strings ss . I would like to genera...	Is it possible to generate record fields in haskell? Is it possible to generate record fields in haskell? template-haskell haskell code-generation record Example field1 field2 prefixString1 Maybe prefixString2 prefixString3 Show field_1 field_2 field_1_x field_2_x field_1_y field_2_y Is it possible to generate record f...	[ -0.00927734375, 0.000766754150390625, -0.00732421875, -0.00135040283203125, -0.00787353515625, 0.00113677978515625, 0.00567626953125, -0.01177978515625, 0.0022735595703125, -0.0026397705078125, -0.003631591796875, -0.028076171875, 0.013916015625, -0.0181884765625, -0.0015411376953125, ...	[ 2071, 442, 7722, 47, 139392, 17164, 44457, 7, 23, 1556, 142508, 110934, 10557, 18151, 48281, 89536, 304, 183114, 71713, 83425, 363, 17367, 115187, 425, 53, 915, 5303, 79315, 91, 1884, 9351, 37223, 12638, 32562, 61687, 23282, 87, 959, 10002,...	[ 0.05902099609375, 0.05352783203125, 0.170166015625, 0.044647216796875, 0.233642578125, 0.25830078125, 0.282958984375, 0.0977783203125, 0.08502197265625, 0.158447265625, 0.2425537109375, 0.1629638671875, 0.122314453125, 0.1483154296875, 0.14599609375, 0.012420654296875, 0.026214599609...	embed
69969060_c0	69969060	haskell	0	Title: haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instance Problem title: haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instance Tags: hdbc, haskell, odbc, mysql Problem: haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instanc...	haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instance haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instance hdbc haskell odbc mysql SqlError seNativeError ODBC MySQL Connecting Connected USE Done Tried Connection haskell `hdbc` ODBC connection gets dispose...	[ 0.005523681640625, 0.044921875, 0.0017852783203125, 0.00054931640625, 0.0213623046875, 0.0230712890625, -0.017822265625, -0.0294189453125, 0.00885009765625, -0.021728515625, 0.0308837890625, -0.0458984375, 0.01202392578125, -0.019775390625, -0.026611328125, -0.00579833984375, 0.00093...	[ 1556, 142508, 20257, 65037, 34687, 24318, 94878, 60458, 71, 111, 109312, 100, 148814, 157146, 110527, 26488, 229, 759, 99247, 18468, 40, 4645, 4935, 62448, 78441, 984, 86, 4699, 297, 62163, 31577, 37067, 63399, 11675, 80866, 41, 136, 2199, ...	[ 0.1260986328125, 0.2296142578125, 0.1097412109375, 0.18505859375, 0.1632080078125, 0.2354736328125, 0.2017822265625, 0.152587890625, 0.054656982421875, 0.0826416015625, 0.1732177734375, 0.0292510986328125, 0.1986083984375, 0.2015380859375, 0.1357421875, 0.125244140625, 0.114013671875...	embed
55907243_c1	55907243	haskell	1	to do this (such as writing to an IORef) would require it to have a reference to such an object. In the example I've tried using exceptions to communicate but they don't get caught, which I suspect is due to handle_input being called by a foreign library. If anyone can suggest how I might solve this (i.e. get an Int b...	to do this (such as writing to an IORef) would require it to have a reference to such an object. In the example I've tried using exceptions to communicate but they don't get caught, which I suspect is due to handle_input being called by a foreign library. If anyone can suggest how I might solve this (i.e. get an Int b...	[ -0.01507568359375, 0.0238037109375, -0.0234375, -0.0166015625, 0.00628662109375, 0.01348876953125, 0.0040283203125, -0.032470703125, -0.0057373046875, -0.004364013671875, -0.0026092529296875, -0.037109375, 0.00128936767578125, 0.00482177734375, -0.01177978515625, 0.0027923583984375, ...	[ 54, 903, 32562, 47, 123435, 4240, 64209, 91067, 6044, 36746, 27781, 37842, 17368, 131527, 6, 127219, 2301, 18, 156892, 92610, 34831, 73, 7077, 35839, 110613, 35773, 1294, 42459, 3642, 13648, 86869, 2046, 360, 4420, 1295, 11782, 12620, 26008, ...	[ 0.06201171875, 0.08135986328125, 0.1622314453125, 0.061676025390625, 0.125244140625, 0.2247314453125, 0.06524658203125, 0.204833984375, 0.04217529296875, 0.20751953125, 0.1123046875, 0.02996826171875, 0.0592041015625, 0.2646484375, 0.011322021484375, 0.1973876953125, 0.00927734375, ...	embed
37150564_c0	37150564	haskell	0	Title: Mapping a list to the product of the elements excluding the current index without using division Problem title: Mapping a list to the product of the elements excluding the current index without using division Tags: haskell, arrays Problem: Mapping a list to the product of the elements excluding the current index...	Mapping a list to the product of the elements excluding the current index without using division Mapping a list to the product of the elements excluding the current index without using division haskell arrays division Data.List Mapping foldl1 Mapping a list to the product of the elements excluding the current index wit...	[ -0.0458984375, 0.0294189453125, -0.01318359375, -0.01251220703125, -0.033447265625, -0.005340576171875, 0.005279541015625, 0.00732421875, 0.0185546875, -0.0302734375, -0.00531005859375, 0.0211181640625, 0.002838134765625, 0.00171661376953125, -0.00177764892578125, -0.006683349609375, ...	[ 911, 26783, 5303, 47, 12996, 80854, 39041, 6238, 43581, 63262, 15490, 17368, 91853, 1556, 142508, 10298, 4778, 11809, 154663, 18344, 20469, 418, 56785, 20625, 20697, 40899, 38953, 57877, 4390, 19305, 53, 3355, 19462, 39379, 19048, 54, 72546, ...	[ 0.19775390625, 0.109130859375, 0.2064208984375, 0.146484375, 0.255126953125, 0.179443359375, 0.19091796875, 0.075927734375, 0.1724853515625, 0.1806640625, 0.138427734375, 0.06561279296875, 0.258544921875, 0.1241455078125, 0.2354736328125, 0.1102294921875, 0.06317138671875, 0.061401...	embed
41260982_c0	41260982	haskell	0	Title: Reading from encrypted zips in Haskell using LibZip Problem title: Reading from encrypted zips in Haskell using LibZip Tags: encryption, haskell, zip, archive, libzip Problem: Reading from encrypted zips in Haskell using LibZip I try to open encrypted zip file and then to write it again. Unfortunately I keep get...	Reading from encrypted zips in Haskell using LibZip Reading from encrypted zips in Haskell using LibZip encryption haskell zip archive libzip encrypted LibZip Reading Haskell FilePath ZipSource CreateFlag mapM_ Password CheckConsFlag protected_file2.zip unprotected.zip Reading from encrypted zips in Haskell using LibZi...	[ 0.0040283203125, -0.01300048828125, -0.01007080078125, -0.000021338462829589844, -0.0145263671875, -0.0186767578125, -0.0035858154296875, -0.00021076202392578125, 0.005096435546875, -0.00238037109375, 0.01007080078125, 0.0042724609375, 0.0067138671875, 0.038330078125, -0.0006675720214843...	[ 104951, 1295, 22, 136791, 68330, 20625, 142508, 17368, 43278, 1511, 3442, 7, 1556, 147488, 25474, 50836, 42724, 10519, 162150, 211235, 151313, 3668, 22288, 594, 170461, 38679, 11935, 30312, 29822, 5442, 51, 208202, 9790, 9803, 11435, 33022, 134...	[ 0.2008056640625, 0.0914306640625, 0.045257568359375, 0.2294921875, 0.2105712890625, 0.12744140625, 0.253173828125, 0.01153564453125, 0.1729736328125, 0.154541015625, 0.1993408203125, 0.015045166015625, 0.1103515625, 0.096923828125, 0.094970703125, 0.1861572265625, 0.03814697265625, ...	embed
19946446_c0	19946446	haskell	0	Title: Generating random vectors with constant stack space Problem title: Generating random vectors with constant stack space Tags: lazy-evaluation, haskell, monads, stack-overflow Problem: Generating random vectors with constant stack space I'm working with the packages System.Random.Mersenne.Pure64 and Control.Monad....	Generating random vectors with constant stack space Generating random vectors with constant stack space lazy-evaluation haskell monads stack-overflow qualified Data.Int System.Random.Mersenne.Pure64 Control.Monad.Mersenne.Random Generating Data.Vector.Unboxed U.replicateM getInt64 U.Vector Int64 U.head Generating rando...	[ -0.0084228515625, 0.03173828125, 0.005218505859375, -0.0135498046875, 0.0098876953125, -0.00518798828125, -0.001617431640625, -0.040771484375, -0.000965118408203125, -0.07470703125, 0.0081787109375, 0.00799560546875, 0.012939453125, -0.00005173683166503906, 0.01409912109375, -0.0046081...	[ 155370, 96759, 22834, 22230, 678, 53697, 177261, 32628, 21, 3285, 159258, 1556, 142508, 2667, 712, 5465, 118664, 217225, 11809, 18, 12353, 126525, 3815, 30248, 1015, 86, 3408, 13307, 27131, 46674, 26455, 18770, 11728, 345, 52721, 67, 594, 312...	[ 0.145751953125, 0.1700439453125, 0.2198486328125, 0.1539306640625, 0.0270843505859375, 0.2022705078125, 0.201904296875, 0.206787109375, 0.05810546875, 0.1298828125, 0.1231689453125, 0.059478759765625, 0.1943359375, 0.07550048828125, 0.11376953125, 0.07476806640625, 0.2410888671875, ...	embed
720517_c0	720517	haskell	0	Title: Contrasting C# generics with Haskell parameterized types Problem title: Contrasting C# generics with Haskell parameterized types Tags: c%23, type-systems, polymorphism, haskell, generics Problem: Contrasting C# generics with Haskell parameterized types Based on some advice I found on StackOverflow, I'm digging i...	Contrasting C# generics with Haskell parameterized types Contrasting C# generics with Haskell parameterized types c%23 type-systems polymorphism haskell generics Contrasting Haskell Contrasting C# generics with Haskell parameterized types Based on some advice I found on StackOverflow, I'm digging into Haskell. I was pl...	[ -0.00616455078125, 0.024169921875, 0.00714111328125, -0.00075531005859375, 0.000812530517578125, 0.001190185546875, -0.009765625, -0.00836181640625, 0.004425048828125, 0.003997802734375, -0.0135498046875, -0.04345703125, 0.005218505859375, 0.0067138671875, -0.015625, -0.00787353515625,...	[ 45380, 7, 1916, 313, 4904, 189534, 678, 20625, 142508, 171859, 29367, 52895, 3742, 10644, 16751, 35874, 178851, 1556, 67660, 156673, 118664, 174849, 68991, 1884, 149766, 46876, 115992, 11001, 31330, 15044, 76465, 161740, 8561, 11969, 5222, 23755,...	[ 0.1510009765625, 0.09039306640625, 0.0157470703125, 0.024169921875, 0.2020263671875, 0.208740234375, 0.05340576171875, 0.1513671875, 0.242919921875, 0.21923828125, 0.10595703125, 0.2056884765625, 0.09619140625, 0.189453125, 0.1126708984375, 0.07781982421875, 0.173095703125, 0.10260...	embed
45905951_c0	45905951	haskell	0	Title: Hakyll: enabling pandoc extensions? Problem title: Hakyll: enabling pandoc extensions? Tags: pandoc, haskell, hakyll Problem: Hakyll: enabling pandoc extensions? I wanted to enable the Ext_autolink_bare_uris pandoc extension for Hakyll posts. I followed the instructions given here , and everything seems to be wo...	Hakyll: enabling pandoc extensions? Hakyll: enabling pandoc extensions? pandoc haskell hakyll qualified Text.Pandoc.Options Hakyll site.hs Data.Set Compiler Item Ext_autolink_bare_uris S.insert Hakyll: enabling pandoc extensions? I wanted to enable the Ext_autolink_bare_uris pandoc extension for Hakyll posts. I followe...	[ 0.0019989013671875, 0.013427734375, 0.02783203125, 0.003997802734375, -0.01202392578125, -0.004547119140625, -0.01458740234375, -0.006439208984375, -0.0098876953125, -0.0306396484375, -0.0068359375, -0.0086669921875, 0.01953125, -0.010986328125, -0.0029296875, -0.0014495849609375, 0....	[ 23493, 53, 1181, 22, 11, 79298, 2652, 29713, 111938, 7, 1556, 142508, 256, 1002, 217225, 24129, 55956, 39029, 1764, 127, 11809, 15612, 34759, 78426, 5443, 18, 8913, 10187, 9837, 62210, 159, 33657, 36663, 2886, 32323, 134629, 167934, 26818, ...	[ 0.1796875, 0.1663818359375, 0.210205078125, 0.06494140625, 0.063232421875, 0.112548828125, 0.1431884765625, 0.2161865234375, 0.256103515625, 0.0231170654296875, 0.1011962890625, 0.1658935546875, 0.1024169921875, 0.1676025390625, 0.150146484375, 0.0645751953125, 0.086181640625, 0.11...	embed
48286026_c1	48286026	haskell	1	(remocollatz x)) + 1 collatzPairs :: Integral a => a -> [(a, Int)] collatzPairs n = zip [1..n] (collatzLength <$> [1..n]) longestCollatz :: Integral a => a -> (a, Int) longestCollatz n = maximumBy order $ collatzPairs n where order :: Ord b => (a, b) -> (a, b) -> Ordering order x y = snd x `compare` snd y main :: IO (...	(remocollatz x)) + 1 collatzPairs :: Integral a => a -> [(a, Int)] collatzPairs n = zip [1..n] (collatzLength <$> [1..n]) longestCollatz :: Integral a => a -> (a, Int) longestCollatz n = maximumBy order $ collatzPairs n where order :: Ord b => (a, b) -> (a, b) -> Ordering order x y = snd x `compare` snd y main :: IO (...	[ -0.0113525390625, -0.00142669677734375, -0.00531005859375, 0.0022430419921875, 0.004486083984375, 0.005615234375, 0.00017261505126953125, -0.00482177734375, 0.0260009765625, -0.044677734375, 0.0172119140625, 0.01251220703125, 0.016357421875, 0.0208740234375, 0.0184326171875, -0.0034942...	[ 26973, 181989, 9136, 1022, 997, 106, 65780, 8335, 481, 1984, 204681, 10, 33079, 360, 18, 653, 2203, 68330, 19, 449, 4989, 525, 78457, 2335, 169, 38132, 12989, 35379, 876, 81206, 16082, 2208, 113, 5201, 17780, 28412, 3650, 13267, 31380, 23...	[ 0.1978759765625, 0.1546630859375, 0.2369384765625, 0.1358642578125, 0.1220703125, 0.050933837890625, 0.1864013671875, 0.1492919921875, 0.1400146484375, 0.039947509765625, 0.2266845703125, 0.054443359375, 0.028839111328125, 0.0216827392578125, 0.0625, 0.0733642578125, 0.00326538085937...	embed
51384015_c0	51384015	haskell	0	Title: Check type signature of inputted value and compare part of values Problem title: Check type signature of inputted value and compare part of values Tags: haskell Problem: Check type signature of inputted value and compare part of values If I was to use '( ) <- getLine', how would I check the type signature of the...	Check type signature of inputted value and compare part of values Check type signature of inputted value and compare part of values haskell Check They Check type signature of inputted value and compare part of values If I was to use '( ) <- getLine', how would I check the type signature of the value on output through a...	[ -0.013916015625, -0.0045166015625, -0.018798828125, 0.042724609375, -0.0084228515625, -0.000896453857421875, 0.006561279296875, 0.0020751953125, -0.0035552978515625, 0.0205078125, -0.0057373046875, 0.01116943359375, -0.00072479248046875, 0.01202392578125, -0.02197265625, -0.00643920898...	[ 38679, 10644, 138256, 111, 107730, 3674, 34292, 69101, 2831, 142424, 1556, 142508, 10660, 4527, 132, 2046, 93232, 12765, 140992, 3884, 71713, 866, 19, 28412, 2565, 2606, 3630, 32354, 67688, 11249, 2806, 6626, 79315, 30957, 62, 1530, 96060, 13...	[ 0.183837890625, 0.2364501953125, 0.24072265625, 0.06494140625, 0.1248779296875, 0.04864501953125, 0.1552734375, 0.207275390625, 0.07464599609375, 0.1507568359375, 0.1151123046875, 0.2061767578125, 0.097900390625, 0.00927734375, 0.00958251953125, 0.0870361328125, 0.17529296875, 0.19...	embed
67355210_c0	67355210	haskell	0	Title: How to fix this Haskell lookup function type mismatch? Problem title: How to fix this Haskell lookup function type mismatch? Tags: lookup, haskell, function, algebraic-data-types, type-mismatch Problem: How to fix this Haskell lookup function type mismatch? If someone could lend a hand fixing this error, it woul...	How to fix this Haskell lookup function type mismatch? How to fix this Haskell lookup function type mismatch? lookup haskell function algebraic-data-types type-mismatch How Haskell Name Coordinates Pop TotalPop City York Washingotn Los Angeles Couldn Maybe How to fix this Haskell lookup function type mismatch? If someo...	[ -0.0045166015625, -0.00421142578125, 0.0128173828125, 0.0206298828125, -0.00421142578125, -0.0024261474609375, 0.005828857421875, 0.0234375, 0.0064697265625, 0.0030059814453125, 0.01220703125, -0.01031494140625, -0.01141357421875, -0.0272216796875, 0.00531005859375, -0.0240478515625, ...	[ 11249, 47, 30022, 903, 20625, 142508, 6713, 2037, 32354, 10644, 1239, 98753, 1556, 144, 429, 2844, 10135, 50986, 2179, 15757, 1311, 43297, 11584, 33867, 127642, 6406, 5753, 5282, 33059, 818, 19, 3731, 31754, 191147, 83425, 22008, 5809, 50771,...	[ 0.0765380859375, 0.0298919677734375, 0.1844482421875, 0.103759765625, 0.166748046875, 0.28515625, 0.13134765625, 0.1505126953125, 0.1728515625, 0.2276611328125, 0.1461181640625, 0.2880859375, 0.156005859375, 0.0140380859375, 0.0689697265625, 0.1072998046875, 0.1097412109375, 0.2249...	embed
61761223_c0	61761223	haskell	0	Title: Haskell HUnit Function Testing Problem title: Haskell HUnit Function Testing Tags: haskell, hunit, visual-studio-code Problem: Haskell HUnit Function Testing I'm trying to set up a series of tests for a simple tic tac toe program I've written in Haskell and I'm unable to get past my first test due to a strange e...	Haskell HUnit Function Testing Haskell HUnit Function Testing haskell hunit visual-studio-code Haskell HUnit Testing Tests.hs:11:61 Couldn test_user_value TestCase test1 Failed Haskell HUnit Function Testing I'm trying to set up a series of tests for a simple tic tac toe program I've written in Haskell and I'm unable t...	[ 0.000156402587890625, -0.009033203125, -0.00787353515625, -0.00555419921875, -0.003387451171875, -0.00390625, -0.00015735626220703125, -0.0027313232421875, -0.0027618408203125, 0.017333984375, 0.00384521484375, -0.01202392578125, -0.00130462646484375, 0.003448486328125, 0.0128173828125, ...	[ 20625, 142508, 22438, 6773, 28670, 8647, 1556, 1926, 217, 21176, 52629, 40899, 127, 11540, 191147, 19, 3034, 65918, 27494, 441, 6991, 418, 190355, 10763, 31577, 5423, 36549, 109921, 8781, 96212, 36322, 4375, 1528, 59121, 51, 2886, 11015, 5117...	[ 0.150390625, 0.240478515625, 0.1480712890625, 0.2666015625, 0.150390625, 0.20361328125, 0.1241455078125, 0.1416015625, 0.1773681640625, 0.1490478515625, 0.1148681640625, 0.06524658203125, 0.00421142578125, 0.037841796875, 0.08282470703125, 0.011932373046875, 0.2069091796875, 0.1699...	embed
10464764_c0	10464764	haskell	0	Title: Custom Ord instance hangs on lists Problem title: Custom Ord instance hangs on lists Tags: haskell, typeclass Problem: Custom Ord instance hangs on lists import Data.Function (on) import Data.List (sort) data Monomial = Monomial { m_coeff :: Coefficient , m_powers :: [(Variable, Power)] } deriving () instance Or...	Custom Ord instance hangs on lists Custom Ord instance hangs on lists haskell typeclass Data.Function Data.List Custom Ord Monomial m_coeff Coefficient m_powers Variable Power Main Computation Custom Ord instance hangs on lists That's an excerpt from my code, cut down to principal size. Let's try comparing: On a side n...	[ -0.01397705078125, 0.003753662109375, 0.00836181640625, -0.0025634765625, -0.003692626953125, 0.0166015625, 0.0159912109375, -0.0184326171875, 0.01226806640625, -0.01287841796875, 0.01263427734375, 0.002471923828125, 0.0145263671875, -0.01239013671875, -0.009033203125, -0.0093383789062...	[ 130664, 35379, 110527, 10756, 98, 5303, 1556, 142508, 10644, 67413, 11809, 97249, 154663, 77879, 266, 289, 347, 68053, 62783, 84572, 17170, 12321, 159415, 18151, 7893, 9790, 37397, 49041, 91995, 91, 64, 2740, 1369, 177, 21635, 1221, 959, 809,...	[ 0.227783203125, 0.249267578125, 0.25537109375, 0.2144775390625, 0.10601806640625, 0.2061767578125, 0.09814453125, 0.2142333984375, 0.06512451171875, 0.1588134765625, 0.038543701171875, 0.03515625, 0.1063232421875, 0.04998779296875, 0.090576171875, 0.00927734375, 0.04058837890625, 0...	embed
15537100_c0	15537100	haskell	0	Title: HW: Unfolding a list in a specific way Problem title: HW: Unfolding a list in a specific way Tags: haskell, functional-programming, unfold Problem: HW: Unfolding a list in a specific way In Programming in Haskell, Graham Hutton defines an unfold for lists as follows: unfold :: (b -> Bool ) -> (b -> a) -> (b -> b...	HW: Unfolding a list in a specific way HW: Unfolding a list in a specific way haskell functional-programming unfold Unfolding Bool Nothing Just x:xs HW: Unfolding a list in a specific way In Programming in Haskell, Graham Hutton defines an unfold for lists as follows: Define a function that is similar to the one above ...	[ -0.00335693359375, 0.0152587890625, 0.021240234375, 0.008056640625, 0.00008153915405273438, 0.0206298828125, -0.014892578125, -0.002532958984375, 0.01263427734375, 0.006378173828125, -0.005889892578125, -0.0277099609375, 0.0115966796875, 0.0172119140625, -0.0203857421875, 0.01684570312...	[ 572, 1456, 992, 42822, 5303, 29458, 3917, 1556, 142508, 123309, 28966, 51, 2460, 929, 182747, 9563, 1022, 12, 425, 214, 27958, 20625, 147756, 97595, 1507, 61924, 142, 100, 262, 64552, 32354, 21373, 36917, 4527, 42, 208124, 351, 48650, 31577...	[ 0.059112548828125, 0.1068115234375, 0.116455078125, 0.276611328125, 0.2298583984375, 0.1409912109375, 0.0777587890625, 0.0965576171875, 0.209716796875, 0.1370849609375, 0.084228515625, 0.1273193359375, 0.061126708984375, 0.1260986328125, 0.134521484375, 0.0782470703125, 0.11743164062...	embed
5337419_c0	5337419	haskell	0	Title: Debugging infinite loops in Haskell programs with GHCi Problem title: Debugging infinite loops in Haskell programs with GHCi Tags: infinite-loop, haskell, ghci, ghc, debugging Problem: Debugging infinite loops in Haskell programs with GHCi For the first time I've encountered an infinite loop in a Haskell program...	Debugging infinite loops in Haskell programs with GHCi Debugging infinite loops in Haskell programs with GHCi infinite-loop haskell ghci ghc debugging Debugging Haskell GHCi Data.Map.Map Debugging infinite loops in Haskell programs with GHCi For the first time I've encountered an infinite loop in a Haskell program I'm ...	[ -0.007659912109375, 0.003875732421875, 0.02197265625, 0.015380859375, 0.00634765625, 0.00064849853515625, -0.0002613067626953125, 0.002349853515625, 0.0062255859375, -0.04541015625, 0.025390625, -0.0191650390625, 0.0078125, 0.01446533203125, 0.038330078125, 0.024169921875, 0.01495361...	[ 262, 978, 36659, 54241, 13, 40956, 7, 20625, 142508, 103391, 527, 73265, 14, 678, 28354, 1556, 31380, 318, 238, 8, 11809, 166179, 5117, 1733, 190647, 1528, 32562, 40059, 18151, 53418, 38496, 351, 30524, 26518, 195625, 5844, 80934, 16031, 39...	[ 0.112548828125, 0.22119140625, 0.02142333984375, 0.1793212890625, 0.0894775390625, 0.2252197265625, 0.05743408203125, 0.110595703125, 0.2083740234375, 0.10601806640625, 0.056610107421875, 0.124267578125, 0.158447265625, 0.00189208984375, 0.18603515625, 0.0693359375, 0.05706787109375,...	embed
9658268_c0	9658268	haskell	0	Title: Concat parse results Problem title: Concat parse results Tags: haskell, parsec Problem: Concat parse results I can create a parser which can handle two or three numbers, separated by comma, like this: number :: Parser Int number = many1 digit >>= return . read <?> "number" numbers = do n1 <- number n2 <- char ':...	Concat parse results Concat parse results haskell parsec Concat Parser many1 Option input.parseAs None Some Concat parse results I can create a parser which can handle two or three numbers, separated by comma, like this: Only the numbers are important, the rest can be discarded. Is there a way to concatenate the interm...	[ 0.00994873046875, -0.00830078125, -0.00885009765625, 0.024169921875, 0.001434326171875, 0.00439453125, -0.005615234375, -0.019287109375, 0.01123046875, -0.0011749267578125, -0.01611328125, -0.009521484375, 0.018310546875, 0.0194091796875, -0.0079345703125, -0.00139617919921875, -0.01...	[ 1657, 4460, 366, 184, 50339, 1556, 142508, 39797, 2392, 2189, 5941, 418, 86769, 107730, 2500, 19659, 438, 831, 28282, 34831, 6626, 17262, 101935, 84797, 390, 96117, 87293, 5526, 10588, 17116, 5861, 10, 3917, 158, 33478, 76, 67, 81814, 2182,...	[ 0.14697265625, 0.271240234375, 0.175048828125, 0.1199951171875, 0.1842041015625, 0.0960693359375, 0.2083740234375, 0.2244873046875, 0.169677734375, 0.1866455078125, 0.113525390625, 0.0215911865234375, 0.135498046875, 0.1568603515625, 0.1480712890625, 0.0313720703125, 0.047607421875, ...	embed
10658480_c0	10658480	haskell	0	Title: Ambiguous type variable `f0' in the constraint: Haskell Problem title: Ambiguous type variable `f0' in the constraint: Haskell Tags: haskell Problem: Ambiguous type variable `f0' in the constraint: Haskell Note: there may be some typos (capitals etc) as my wireless card has broken on my computer and I ...	Ambiguous type variable `f0' in the constraint: Haskell Ambiguous type variable `f0' in the constraint: Haskell haskell a Ambiguous Haskell Config Line Nums Indent Run Show Result Test Probable Ambiguous type variable `f0' in the constraint: Haskell Note: there may be some typos (capitals etc) as my wireless ...	[ -0.0218505859375, -0.00823974609375, -0.017333984375, 0.01239013671875, 0.0079345703125, -0.01287841796875, -0.006195068359375, -0.00017547607421875, -0.00022220611572265625, 0.00927734375, -0.007720947265625, -0.0167236328125, -0.0106201171875, 0.002716064453125, 0.004486083984375, -0...	[ 10250, 12282, 10821, 10644, 77336, 420, 2389, 3768, 158, 2816, 4288, 20625, 142508, 1556, 139403, 177, 16777, 52782, 37379, 28398, 17367, 126684, 8647, 1250, 275, 23, 11417, 232, 215652, 135051, 20596, 148431, 13909, 45767, 20600, 456, 46280, ...	[ 0.1380615234375, 0.1890869140625, 0.07489013671875, 0.1536865234375, 0.2388916015625, 0.07568359375, 0.16748046875, 0.1148681640625, 0.051116943359375, 0.1427001953125, 0.09295654296875, 0.134765625, 0.25439453125, 0.1290283203125, 0.2095947265625, 0.08026123046875, 0.1148681640625, ...	embed
13747447_c1	13747447	haskell	1	Parser {getDParser :: Parser e t MaybeT a} instance Monad (DParser e t) where return = DParser . return (DParser d) >>= f = DParser (d >>= (getDParser . f)) instance MonadPlus (DParser e t) where mzero = DParser (StateT (const (MaybeT (Right Nothing)))) mplus = undefined -- will worry about later instance MonadState [t...	Parser {getDParser :: Parser e t MaybeT a} instance Monad (DParser e t) where return = DParser . return (DParser d) >>= f = DParser (d >>= (getDParser . f)) instance MonadPlus (DParser e t) where mzero = DParser (StateT (const (MaybeT (Right Nothing)))) mplus = undefined -- will worry about later instance MonadState [t...	[ -0.013671875, 0.00860595703125, 0.0115966796875, -0.0009613037109375, 0.006744384765625, 0.02099609375, -0.0179443359375, -0.01287841796875, -0.007598876953125, -0.005340576171875, 0.007598876953125, 0.0164794921875, 0.0021820068359375, 0.0016937255859375, -0.00811767578125, 0.02136230...	[ 2392, 2189, 3794, 28399, 147, 1984, 28, 808, 83425, 618, 10, 8152, 110527, 60331, 71, 15, 7440, 30646, 2203, 72445, 104, 1238, 88225, 347, 80510, 135206, 25553, 82419, 372, 1052, 22553, 182747, 32108, 9232, 5983, 1221, 90908, 14432, 13, 1...	[ 0.2496337890625, 0.296630859375, 0.1414794921875, 0.05364990234375, 0.1806640625, 0.0258026123046875, 0.12890625, 0.1441650390625, 0.20263671875, 0.1373291015625, 0.130615234375, 0.0008544921875, 0.27197265625, 0.21826171875, 0.2088623046875, 0.0164947509765625, 0.0215606689453125, ...	embed
14670205_c0	14670205	haskell	0	Title: Irrefutable pattern failed inside of Let statement Problem title: Irrefutable pattern failed inside of Let statement Tags: haskell, design-patterns, let Problem: Irrefutable pattern failed inside of Let statement I'm learning haskell and am currently trying to parse Integers and Floats from strings. However, whe...	Irrefutable pattern failed inside of Let statement Irrefutable pattern failed inside of Let statement haskell design-patterns let Irrefutable Token IntTok FloatTok Float EOF a:as b:c:bs i::Int Irrefutable pattern failed inside of Let statement I'm learning haskell and am currently trying to parse Integers and Floats fr...	[ -0.0205078125, 0.020263671875, 0.00095367431640625, 0.01507568359375, 0.0035400390625, 0.0130615234375, -0.006683349609375, -0.0267333984375, -0.004119873046875, 0.000675201416015625, -0.0135498046875, 0.00775146484375, -0.002838134765625, 0.0028076171875, 0.02880859375, -0.01348876953...	[ 6921, 107, 3125, 22819, 103510, 165523, 46132, 10842, 63805, 1556, 142508, 4331, 4453, 22766, 2633, 717, 1098, 618, 685, 38699, 257, 241, 82341, 162, 876, 16145, 17, 18, 52080, 366, 44401, 136, 9821, 1295, 79315, 31577, 12301, 839, 316, 3...	[ 0.020477294921875, 0.052642822265625, 0.13330078125, 0.10662841796875, 0.2322998046875, 0.1864013671875, 0.126953125, 0.2159423828125, 0.1607666015625, 0.102294921875, 0.1885986328125, 0.1480712890625, 0.1162109375, 0.09393310546875, 0.0860595703125, 0.045135498046875, 0.123657226562...	embed
18929369_c0	18929369	haskell	0	Title: Yesod Forms or JSON/Ajax or Other Problem title: Yesod Forms or JSON/Ajax or Other Tags: yesod, haskell, aeson Problem: Yesod Forms or JSON/Ajax or Other I'm writing a CRUD interface for my Yesod-based site, but I'm having a problem with some values. In particular, I am trying to CRUD on values like: data Value ...	Yesod Forms or JSON/Ajax or Other Yesod Forms or JSON/Ajax or Other yesod haskell aeson Yesod Forms JSON Ajax Other Value UUID Stuff Nothing Yesod Forms or JSON/Ajax or Other I'm writing a CRUD interface for my Yesod-based site, but I'm having a problem with some values. In particular, I am trying to CRUD on values lik...	[ -0.009033203125, 0.0262451171875, -0.00958251953125, -0.0152587890625, -0.00665283203125, -0.003631591796875, 0.00927734375, -0.01226806640625, -0.013671875, -0.04541015625, 0.0157470703125, -0.006744384765625, -0.021240234375, -0.01031494140625, 0.00421142578125, -0.00872802734375, ...	[ 32635, 2199, 15236, 7, 707, 821, 58627, 284, 145, 425, 64511, 2422, 23722, 1556, 142508, 10, 90, 191, 157715, 190060, 91916, 7146, 2907, 21493, 182747, 64, 32562, 25109, 26119, 101758, 77007, 1764, 19441, 2967, 142424, 31577, 98, 1884, 6313...	[ 0.19873046875, 0.268798828125, 0.268798828125, 0.0341796875, 0.04248046875, 0.142822265625, 0.2320556640625, 0.057373046875, 0.122802734375, 0.1695556640625, 0.1043701171875, 0.152587890625, 0.236572265625, 0.1134033203125, 0.2088623046875, 0.0718994140625, 0.117431640625, 0.189331...	embed
65919503_c1	65919503	haskell	1	this has left me really confused because in this case, the program doesn't stop. The other possible issue could be down to my representation of if-statements. data HVal = HInteger Integer \| HBool Bool \| HString String \| HList [HVal] \| Length HVal \| Arith HVal Op HVal \| Assign String HVal deriving (Eq, Read) data HStat...	this has left me really confused because in this case, the program doesn't stop. The other possible issue could be down to my representation of if-statements. data HVal = HInteger Integer \| HBool Bool \| HString String \| HList [HVal] \| Length HVal \| Arith HVal Op HVal \| Assign String HVal deriving (Eq, Read) data HStat...	[ -0.01409912109375, 0.01043701171875, 0.002838134765625, 0.022705078125, -0.0024871826171875, 0.0142822265625, 0.0086669921875, -0.00994873046875, 0.0074462890625, 0.004302978515625, -0.025146484375, -0.002716064453125, -0.027587890625, -0.0108642578125, -0.002349853515625, 0.0158691406...	[ 903, 1556, 25737, 163, 6183, 55681, 5281, 7225, 70, 1528, 22027, 18, 7279, 7722, 31089, 5809, 7565, 759, 18811, 2174, 61340, 9035, 2053, 572, 42272, 2203, 35848, 1479, 1505, 44401, 12647, 929, 2460, 39718, 2852, 23351, 214, 154663, 101422, ...	[ 0.0906982421875, 0.06292724609375, 0.089599609375, 0.048675537109375, 0.0660400390625, 0.1529541015625, 0.109619140625, 0.045501708984375, 0.032318115234375, 0.2181396484375, 0.09332275390625, 0.0699462890625, 0.2093505859375, 0.06903076171875, 0.122802734375, 0.0234527587890625, 0.0...	embed
62732941_c1	62732941	haskell	1	al library is in the ghc package set.. ok but the thing is, the version of Nixpkgs I am using above (i.e. the one pinned in the following JSON) ... { "url": "https://github.com/nixos/nixpkgs.git", "rev": "6cf0ed0c04fb3aa7f81b46d0c90bae6457964b3f", "date": "2020-07-02T07:24:47+02:00", "path": "/nix/store/gkilcm4l6qsp31l...	up in my GHC packages inside a nix shell? I have a problem which boils down to this simplified example. Say I have the following shell.nix file: this is just a dummy derivation. I fire off 'nix-shell' and inside the shell: So version 3.0.1.0 of the Cabal library is in the ghc package set.. ok but the thing is, the ver...	[ -0.00150299072265625, -0.0147705078125, 0.0216064453125, 0.002105712890625, 0.00213623046875, 0.0140380859375, -0.0086669921875, 0.004608154296875, 0.01055908203125, 0.005950927734375, -0.0032196044921875, -0.052001953125, 0.0130615234375, -0.00103759765625, 0.0068359375, -0.0055236816...	[ 1257, 23, 527, 73265, 98169, 46132, 300, 425, 128019, 2967, 112892, 27781, 93, 11435, 8473, 1176, 30057, 1363, 11476, 5773, 11389, 17596, 102107, 30438, 289, 35773, 1294, 31380, 238, 5423, 1520, 38988, 9405, 36917, 6520, 25632, 821, 58627, ...	[ 0.1656494140625, 0.035736083984375, 0.072998046875, 0.17529296875, 0.171630859375, 0.148193359375, 0.094970703125, 0.1304931640625, 0.204345703125, 0.0762939453125, 0.03338623046875, 0.04779052734375, 0.1005859375, 0.1246337890625, 0.1253662109375, 0.1107177734375, 0.154296875, 0.0...	embed
19768657_c0	19768657	haskell	0	Title: Can't catch "Prelude.read: no parse" exception with Control.Exception.try Problem title: Can't catch "Prelude.read: no parse" exception with Control.Exception.try Tags: haskell Problem: Can't catch "Prelude.read: no parse" exception with Control.Exception.try I trying to read some v...	Can't catch "Prelude.read: no parse" exception with Control.Exception.try Can't catch "Prelude.read: no parse" exception with Control.Exception.try haskell Control.Exception SomeException Can Prelude.read Control.Exception.try Either Left Right Exception Can't catch "Prelude.read: no parse...	[ -0.0037689208984375, 0.01544189453125, -0.007171630859375, 0.0057373046875, 0.0079345703125, 0.01556396484375, -0.0003223419189453125, -0.018798828125, 0.0081787109375, -0.0211181640625, 0.000965118408203125, -0.0311279296875, -0.00148773193359375, 0.0003414154052734375, 0.026611328125, ...	[ 4171, 3768, 105556, 19273, 822, 112, 39116, 110, 366, 184, 131527, 678, 27131, 63928, 15123, 1556, 142508, 19279, 31384, 1914, 9319, 636, 2480, 90911, 5443, 18, 12, 31577, 12301, 34292, 1810, 11435, 11907, 13648, 74918, 1544, 56, 26458, 100...	[ 0.029632568359375, 0.040740966796875, 0.169921875, 0.0986328125, 0.1812744140625, 0.1097412109375, 0.2216796875, 0.1251220703125, 0.1871337890625, 0.132568359375, 0.2205810546875, 0.044281005859375, 0.223388671875, 0.1893310546875, 0.1497802734375, 0.0889892578125, 0.1929931640625, ...	embed
72014079_c0	72014079	haskell	0	Title: How to render diagrams in gi-gtk? Problem title: How to render diagrams in gi-gtk? Tags: gtk, haskell, gtk2hs, gtk3 Problem: How to render diagrams in gi-gtk? I want to render a diagram on top of a GUI written with gi-gtk . I tryed to use the defaultRender function from the Diagrams.Backend.Gtk but the compiler ...	How to render diagrams in gi-gtk? How to render diagrams in gi-gtk? gtk haskell gtk2hs gtk3 How Diagrams.Backend.Gtk Couldn gtk-0.15.5:Graphics.UI.Gtk.Types.DrawingArea Gtk.DrawingArea GI.Gtk.Objects.DrawingArea gi-gtk-3.0.36 Graphics.UI.Gtk.Types gtk-0.15.5 gtk2hs gtk3 How to render diagrams in gi-gtk? I want to rende...	[ -0.0250244140625, 0.0211181640625, 0.01312255859375, -0.006072998046875, -0.00494384765625, -0.004150390625, -0.00799560546875, 0.0010528564453125, -0.006622314453125, -0.0177001953125, -0.01025390625, -0.039794921875, 0.005462646484375, -0.0120849609375, -0.008544921875, 0.00680541992...	[ 11249, 47, 89159, 117233, 7, 23, 3016, 9, 5386, 92, 706, 31472, 1556, 142508, 304, 127, 363, 4512, 25561, 152470, 3611, 724, 191147, 102014, 148462, 37878, 19379, 33457, 196707, 219, 14775, 1283, 42887, 75161, 132265, 8659, 189682, 3444, 26...	[ 0.06549072265625, 0.047454833984375, 0.223876953125, 0.26171875, 0.07147216796875, 0.0806884765625, 0.216064453125, 0.0462646484375, 0.1387939453125, 0.143798828125, 0.0321044921875, 0.160400390625, 0.05584716796875, 0.1737060546875, 0.04351806640625, 0.034027099609375, 0.07781982421...	embed
72124976_c0	72124976	haskell	0	Title: Why isn't (b) of (a -> (b -> c)) the first parameter in the function definition but the second in type signature? Problem title: Why isn't (b) of (a -> (b -> c)) the first parameter in the function definition but the second in type signature? Tags: type-signature, haskell, currying Problem:...	Why isn't (b) of (a -> (b -> c)) the first parameter in the function definition but the second in type signature? Why isn't (b) of (a -> (b -> c)) the first parameter in the function definition but the second in type signature? type-signature haskell currying Why Why isn't (b) of (a -> (b -> c)) t...	[ 0.00958251953125, -0.00112152099609375, 0.0004291534423828125, 0.01116943359375, -0.021240234375, 0.01434326171875, 0.003173828125, -0.0213623046875, 0.00933837890625, 0.0023040771484375, 0.00836181640625, -0.0174560546875, -0.0164794921875, -0.0093994140625, 0, -0.00885009765625, 0....	[ 44084, 56112, 3768, 18, 275, 111, 11, 20, 1230, 5386, 501, 5117, 171859, 32354, 80934, 17932, 10644, 138256, 1284, 137432, 1556, 142508, 198555, 214, 33079, 39958, 38415, 25737, 45388, 45023, 16750, 82449, 183234, 5701, 7108, 8966, 5609, 1515...	[ 0.089111328125, 0.057586669921875, 0.017974853515625, 0.06793212890625, 0.11669921875, 0.1085205078125, 0.0435791015625, 0.005035400390625, 0.008087158203125, 0.0982666015625, 0.0897216796875, 0.126708984375, 0.2369384765625, 0.1641845703125, 0.14697265625, 0.1407470703125, 0.2194824...	embed
47757073_c0	47757073	haskell	0	Title: Grow a tree from parent relations in Haskell Problem title: Grow a tree from parent relations in Haskell Tags: tree, haskell, functional-programming Problem: Grow a tree from parent relations in Haskell I have the following data: data Item a = { id :: ID , parentId :: Maybe ID , data :: a } data ItemTree a = Ite...	Grow a tree from parent relations in Haskell Grow a tree from parent relations in Haskell tree haskell functional-programming parent Grow Haskell Item Maybe ItemTree Grow a tree from parent relations in Haskell I have the following data: And I want to to have this function: buildForest :: [Item a] -> [ItemTree a] which...	[ 0.0021820068359375, 0.0201416015625, -0.0220947265625, -0.015869140625, 0.0186767578125, 0.00543212890625, -0.031982421875, -0.0191650390625, 0.00469970703125, -0.046142578125, 0.033935546875, 0.0072021484375, -0.0018768310546875, 0.041259765625, 0.01171875, -0.02099609375, -0.011657...	[ 14854, 434, 53201, 1295, 49129, 91582, 20625, 142508, 23, 1556, 123309, 28966, 78426, 83425, 62731, 25632, 2053, 3444, 765, 903, 32354, 45367, 18537, 525, 1984, 2982, 10, 33079, 13, 30646, 351, 3996, 686, 100, 15072, 41591, 11338, 12638, 35...	[ 0.172119140625, 0.04010009765625, 0.2408447265625, 0.116943359375, 0.2276611328125, 0.22119140625, 0.1307373046875, 0.237548828125, 0.040985107421875, 0.10205078125, 0.12353515625, 0.0943603515625, 0.1514892578125, 0.067626953125, 0.20458984375, 0.019073486328125, 0.077392578125, 0...	embed
2694015_c0	2694015	haskell	0	Title: Improve a haskell script Problem title: Improve a haskell script Tags: haskell, coding-style Problem: Improve a haskell script I'm a newbie in Haskell and I'd like some opinions about improving this script. This is a code generator and requires a command line argument to generate the sql script. ./GenCode "peopl...	Improve a haskell script Improve a haskell script haskell coding-style Data.List System.Environment Improve GenCode name:string age:integer create_table CREATE TABLE x:xs create_fields CHARACTER VARYING INTEGER DATE SERIAL You Improve a haskell script I'm a newbie in Haskell and I'd like some opinions about improving t...	[ 0.0038604736328125, 0.0002593994140625, -0.00543212890625, 0.014404296875, 0.00262451171875, 0.0081787109375, 0.00823974609375, -0.0255126953125, -0.01019287109375, -0.0260009765625, 0.01373291015625, -0.007293701171875, -0.011962890625, 0.0032196044921875, -0.0230712890625, 0.00778198...	[ 3370, 66187, 10, 1556, 142508, 26499, 552, 6238, 40946, 11809, 154663, 12353, 686, 1900, 15937, 114211, 9351, 91693, 32070, 6191, 1505, 28282, 22819, 175151, 384, 183057, 1022, 425, 7, 28394, 126349, 310, 123275, 102686, 56599, 391, 35746, 11...	[ 0.1187744140625, 0.2088623046875, 0.051483154296875, 0.1566162109375, 0.2230224609375, 0.24853515625, 0.1153564453125, 0.037811279296875, 0.1719970703125, 0.08349609375, 0.114013671875, 0.077880859375, 0.040985107421875, 0.06085205078125, 0.156494140625, 0.1722412109375, 0.0480346679...	embed
66885274_c0	66885274	haskell	0	Title: Declaring type class instance for composition of constructors Problem title: Declaring type class instance for composition of constructors Tags: haskell Problem: Declaring type class instance for composition of constructors In trying to answer this SO question i wondered: Suppose I want to be able to write fmap ...	Declaring type class instance for composition of constructors Declaring type class instance for composition of constructors haskell Declaring Just fmap.fmap Maybe Functor Nothing Lambda ListT Declaring type class instance for composition of constructors In trying to answer this SO question i wondered: Suppose I want to...	[ -0.006103515625, -0.00096893310546875, 0.006103515625, 0.005706787109375, -0.00634765625, 0.0225830078125, -0.0078125, 0.00096893310546875, 0.0233154296875, -0.0057373046875, -0.0093994140625, -0.00823974609375, 0.0027008056640625, 0.006744384765625, -0.02294921875, -0.0164794921875, ...	[ 25755, 320, 10644, 18507, 110527, 100, 166577, 64549, 25251, 1556, 142508, 9563, 1238, 62346, 420, 83425, 28670, 18770, 182747, 122930, 85, 32036, 618, 15969, 121691, 3444, 19048, 33022, 22183, 17727, 127794, 116, 64457, 6626, 7477, 15700, 9790...	[ 0.086181640625, 0.1146240234375, 0.207763671875, 0.208740234375, 0.2646484375, 0.013214111328125, 0.2197265625, 0.169677734375, 0.1041259765625, 0.1138916015625, 0.2293701171875, 0.0230865478515625, 0.0860595703125, 0.1910400390625, 0.05712890625, 0.22509765625, 0.1260986328125, 0....	embed
32706873_c0	32706873	haskell	0	Title: How come `par` uses only one core but faster? Problem title: How come `par` uses only one core but faster? Tags: haskell Problem: How come `par` uses only one core but faster? I'm trying to test the parallel package, specifically the par function. I wrote a simple program to test whether parallelism would speed ...	How come `par` uses only one core but faster? How come `par` uses only one core but faster? haskell Control.Parallel How User System Percent CPU Elapsed h:mm:ss m:ss How come `par` uses only one core but faster? I'm trying to test the parallel package, specifically the par function. I wrote a simple program to test whe...	[ -0.004791259765625, 0.0027618408203125, 0.000553131103515625, -0.002197265625, 0.01226806640625, -0.0018463134765625, 0.0037689208984375, -0.0079345703125, 0.004150390625, -0.04296875, 0.00008392333984375, 0.01531982421875, -0.00156402587890625, 0.0174560546875, 0.00032806396484375, -0...	[ 11249, 1380, 2500, 4527, 4734, 1632, 56458, 1284, 4271, 56, 1556, 142508, 27131, 55292, 1229, 53400, 12353, 908, 16797, 86039, 127966, 3034, 95103, 98169, 366, 32354, 8781, 1528, 8780, 38352, 1257, 243228, 54397, 6626, 26499, 289, 17932, 5974...	[ 0.012054443359375, 0.067626953125, 0.2242431640625, 0.128173828125, 0.0994873046875, 0.1412353515625, 0.2080078125, 0.0299224853515625, 0.1490478515625, 0.1016845703125, 0.05328369140625, 0.18505859375, 0.127197265625, 0.0870361328125, 0.0982666015625, 0.0908203125, 0.03692626953125,...	embed
11148838_c1	11148838	haskell	1	0 requires base ==4.2.0.0 base-4.3.0.0 was excluded because process-1.0.1.2 requires base ==4.2.0.0 base-4.3.0.0 was excluded because pretty-1.0.1.1 requires base ==4.2.0.0 base-4.3.0.0 was excluded because old-time-1.0.0.3 requires base ==4.2.0.0 base-4.3.0.0 was excluded because old-locale-1.0.0.2 requires base ==4.2...	0 requires base ==4.2.0.0 base-4.3.0.0 was excluded because process-1.0.1.2 requires base ==4.2.0.0 base-4.3.0.0 was excluded because pretty-1.0.1.1 requires base ==4.2.0.0 base-4.3.0.0 was excluded because old-time-1.0.0.3 requires base ==4.2.0.0 base-4.3.0.0 was excluded because old-locale-1.0.0.2 requires base ==4.2...	[ -0.03369140625, -0.003173828125, 0.01483154296875, 0.01556396484375, 0.00689697265625, -0.004852294921875, -0.03955078125, 0.01708984375, 0.00970458984375, 0.040771484375, -0.0111083984375, -0.00823974609375, -0.00787353515625, 0.01507568359375, 0.0021514892578125, -0.00004649162292480...	[ 757, 144570, 3647, 69112, 117904, 5, 99929, 9, 158406, 509, 39041, 48141, 6637, 9433, 102107, 48400, 28875, 83783, 10332, 6032, 170179, 98908, 133684, 118258, 238, 93645, 121254, 6, 31380, 19155, 1294, 11435, 128405, 92134, 14364, 116419, 390, ...	[ 0.1904296875, 0.209228515625, 0.241943359375, 0.0968017578125, 0.25048828125, 0.045989990234375, 0.25048828125, 0.00750732421875, 0.27001953125, 0.0517578125, 0.200927734375, 0.1318359375, 0.0850830078125, 0.1793212890625, 0.154296875, 0.16259765625, 0.2012939453125, 0.154174804687...	embed
12605776_c0	12605776	haskell	0	Title: Error while accessing Int/Integer element from the List using '!!' Problem title: Error while accessing Int/Integer element from the List using '!!' Tags: haskell, list Problem: Error while accessing Int/Integer element from the List using '!!' Level of Haskell : Newbie Goal : Find the root o...	Error while accessing Int/Integer element from the List using '!!' Error while accessing Int/Integer element from the List using '!!' haskell list the Error Integer List getRoot::Integer test2.hs:111 Type Expression Term Does Error while accessing Int/Integer element from the List using '!!' Level o...	[ -0.01318359375, 0.005950927734375, 0.01080322265625, -0.015380859375, 0.00244140625, 0.00811767578125, 0.003662109375, -0.01953125, 0.00823974609375, -0.02880859375, 0.039306640625, -0.004150390625, -0.000957489013671875, -0.0130615234375, 0.00946044921875, -0.0274658203125, 0.005340...	[ 212059, 12960, 17203, 214, 360, 18, 64, 4153, 67, 1505, 12830, 1295, 32036, 17368, 54764, 3768, 1146, 1556, 142508, 5303, 44401, 2046, 12724, 818, 3034, 5442, 127, 97024, 60457, 25129, 2994, 101790, 84136, 20625, 2356, 9014, 2016, 289, 2604...	[ 0.2265625, 0.060302734375, 0.2132568359375, 0.0229034423828125, 0.15087890625, 0.193603515625, 0.09124755859375, 0.130615234375, 0.19970703125, 0.162353515625, 0.156982421875, 0.0972900390625, 0.190673828125, 0.06781005859375, 0.04644775390625, 0.131591796875, 0.199951171875, 0.129...	embed
16015487_c0	16015487	haskell	0	Title: Hughes' Arrowed FilterA Exercise Problem title: Hughes' Arrowed FilterA Exercise Tags: haskell, arrow-abstraction Problem: Hughes' Arrowed FilterA Exercise I've been reading through John Hughes' Programming with Arrows, and I got to first exercise in which he asks the reader to implement a generic filt...	Hughes' Arrowed FilterA Exercise Hughes' Arrowed FilterA Exercise haskell arrow-abstraction Hughes Arrowed FilterA Exercise Left x:xs Right ArrowChoice Bool Hughes' Arrowed FilterA Exercise I've been reading through John Hughes' Programming with Arrows, and I got to first exercise in which he asks the reader ...	[ -0.0068359375, -0.0003604888916015625, 0.0159912109375, 0.00897216796875, -0.0040283203125, -0.01385498046875, -0.003173828125, 0.002838134765625, 0.01043701171875, 0.0294189453125, 0.01263427734375, 0.003082275390625, -0.01141357421875, 0.0216064453125, 0.00130462646484375, -0.0086059...	[ 177099, 3768, 1172, 15555, 128896, 284, 155534, 1556, 142508, 118201, 2055, 7, 117474, 2480, 1022, 425, 90911, 107522, 2460, 929, 4939, 27958, 678, 81979, 29479, 189534, 46312, 32354, 48502, 68991, 1884, 645, 103607, 594, 45325, 90, 150, 2896...	[ 0.2320556640625, 0.0426025390625, 0.03643798828125, 0.1556396484375, 0.220703125, 0.178955078125, 0.135009765625, 0.055694580078125, 0.1680908203125, 0.2193603515625, 0.04534912109375, 0.009368896484375, 0.0850830078125, 0.030426025390625, 0.000946044921875, 0.0059814453125, 0.079162...	embed
78553453_c1	78553453	haskell	1	timeZone today) [0 .. daysInAdvanceToShow] previousRanges = map (mkPreviousRange timeZone . warpNDaysAtMidnight timeZone today) [daysInPastToShow .. 0] pure $ previousRanges ++ advancedRanges where daysInAdvanceToShow = 60 daysInPastToShow = -2 mkPreviousRange timeZone moment = TimeRange { slotStart = addSecondsToZone...	timeZone today) [0 .. daysInAdvanceToShow] previousRanges = map (mkPreviousRange timeZone . warpNDaysAtMidnight timeZone today) [daysInPastToShow .. 0] pure $ previousRanges ++ advancedRanges where daysInAdvanceToShow = 60 daysInPastToShow = -2 mkPreviousRange timeZone moment = TimeRange { slotStart = addSecondsToZone...	[ -0.0264892578125, 0.024169921875, -0.0028228759765625, 0.00121307373046875, -0.016845703125, 0.004730224609375, -0.017333984375, -0.0145263671875, 0.013916015625, -0.0291748046875, -0.0033416748046875, 0.0140380859375, 0.0029449462890625, 0.023193359375, 0.0017242431640625, 0.011047363...	[ 1733, 60551, 86, 18925, 16, 2389, 1468, 13312, 4153, 22409, 157000, 7763, 168660, 96362, 126525, 4188, 2203, 22288, 19201, 235588, 1052, 51459, 1631, 254, 839, 97141, 28848, 532, 54350, 5636, 65619, 18, 757, 34166, 3650, 37223, 175961, 1496, ...	[ 0.213134765625, 0.254150390625, 0.1724853515625, 0.292236328125, 0.0159912109375, 0.103271484375, 0.06646728515625, 0.1466064453125, 0.1322021484375, 0.0450439453125, 0.163818359375, 0.1220703125, 0.1971435546875, 0.1767578125, 0.2232666015625, 0.2147216796875, 0.071044921875, 0.16...	embed
55977311_c0	55977311	haskell	0	Title: How to define the fibonacci sequence using a fold for natural numbers? Problem title: How to define the fibonacci sequence using a fold for natural numbers? Tags: recursion-schemes, catamorphism, fold, haskell, recursion Problem: How to define the fibonacci sequence using a fold for natural numbers? I am current...	How to define the fibonacci sequence using a fold for natural numbers? How to define the fibonacci sequence using a fold for natural numbers? recursion-schemes catamorphism fold haskell recursion a How n-1 How to define the fibonacci sequence using a fold for natural numbers? I am currently learning folds in the sense ...	[ -0.003265380859375, 0.00848388671875, -0.00335693359375, 0.0106201171875, -0.00238037109375, -0.0024871826171875, -0.009765625, -0.0103759765625, 0.0002994537353515625, -0.026611328125, 0.004608154296875, -0.0303955078125, -0.0255126953125, 0.025634765625, 0.015625, -0.01385498046875, ...	[ 11249, 61924, 809, 20990, 52544, 40, 944, 3956, 17368, 10, 42822, 100, 6083, 101935, 47, 195625, 1830, 7560, 3716, 60199, 178851, 8780, 1556, 142508, 5759, 82424, 52080, 7, 118990, 36437, 29479, 14537, 136, 31461, 15403, 20625, 18151, 39908, ...	[ 0.052459716796875, 0.2039794921875, 0.160888671875, 0.1607666015625, 0.2056884765625, 0.08642578125, 0.1463623046875, 0.1053466796875, 0.060791015625, 0.06353759765625, 0.263671875, 0.0614013671875, 0.212158203125, 0.187744140625, 0.005218505859375, 0.13232421875, 0.0312347412109375,...	embed
56376882_c0	56376882	haskell	0	Title: What is a measure? Problem title: What is a measure? Tags: liquid-haskell, haskell Problem: What is a measure? I am reading this where I find this: Measures -- In order to allow Haskell functions to appear in refinement types, we need to lift them to the refinement type level. And there are other documents asser...	What is a measure? What is a measure? liquid-haskell haskell haskell What List Nat Nil Cons x:y x:xs Cannot What is a measure? I am reading this where I find this: And there are other documents asserting that measures are needed to use such function in contract. But I tried this: and this works but len is not measure ....	[ 0.01239013671875, 0.013671875, 0.01531982421875, 0.006988525390625, -0.0033111572265625, -0.0028076171875, -0.004913330078125, 0.00958251953125, 0.0284423828125, -0.01348876953125, -0.0087890625, -0.0172119140625, 0.006744384765625, 0.01513671875, 0.01190185546875, 0.0015411376953125, ...	[ 4865, 83, 10, 72350, 41931, 10557, 142508, 1556, 32036, 68875, 77175, 39215, 1022, 425, 4171, 10869, 16454, 60525, 44841, 4527, 32354, 18264, 37842, 43240, 3098, 959, 2367, 66161, 3229, 3871, 442, 27781, 4488, 15490, 70166, 9, 981, 140909, ...	[ 0.1044921875, 0.130859375, 0.175048828125, 0.33447265625, 0.1553955078125, 0.107177734375, 0.2427978515625, 0.1341552734375, 0.09161376953125, 0.131591796875, 0.1705322265625, 0.12890625, 0.034423828125, 0.0310821533203125, 0.06976318359375, 0.1796875, 0.008087158203125, 0.06210327...	embed
60723486_c0	60723486	haskell	0	Title: Struggling to extract a section of a list in Haskell Problem title: Struggling to extract a section of a list in Haskell Tags: haskell, list-comprehension, list Problem: Struggling to extract a section of a list in Haskell I am trying to implement a basic function but I'm out of practice with Haskell and struggl...	Struggling to extract a section of a list in Haskell Struggling to extract a section of a list in Haskell haskell list-comprehension list Struggling Haskell Node Branch Graph Struggling to extract a section of a list in Haskell I am trying to implement a basic function but I'm out of practice with Haskell and strugglin...	[ -0.042236328125, 0.033935546875, 0.01611328125, 0.0167236328125, 0.0093994140625, 0.00726318359375, -0.015869140625, 0.013916015625, 0.00994873046875, 0.01031494140625, -0.01068115234375, -0.021728515625, -0.00604248046875, 0.0174560546875, -0.01556396484375, 0.006622314453125, 0.019...	[ 63667, 9815, 2069, 125663, 40059, 111, 5303, 20625, 142508, 23, 1556, 4692, 3220, 438, 112, 21110, 206, 6524, 11727, 10, 31577, 29479, 62822, 32354, 1810, 41361, 237875, 77947, 4358, 183037, 3642, 36849, 390, 63262, 3714, 3789, 46876, 46683, ...	[ 0.13330078125, 0.1202392578125, 0.0791015625, 0.234375, 0.224609375, 0.051727294921875, 0.1959228515625, 0.1285400390625, 0.2220458984375, 0.021270751953125, 0.1212158203125, 0.0830078125, 0.0855712890625, 0.09912109375, 0.1175537109375, 0.0953369140625, 0.0253448486328125, 0.09423...	embed
11350948_c1	11350948	haskell	1	":"AddWorkout","data":{"uuid":"a60806a0-efd6-4647-bc62-a48298ce55cd","date":"2012-04-04","workout_type":"Pushups","description":"","sets":[]}} And so on and so forth. Each line in the file represents one full object that I have serialized. Then I load up the file using readFile and I see no problems: *Main> f <- readFi...	":"AddWorkout","data":{"uuid":"a60806a0-efd6-4647-bc62-a48298ce55cd","date":"2012-04-04","workout_type":"Pushups","description":"","sets":[]}} And so on and so forth. Each line in the file represents one full object that I have serialized. Then I load up the file using readFile and I see no problems: *Main> f <- readFi...	[ 0.01446533203125, 0.00341796875, -0.0081787109375, 0.0166015625, 0.00148773193359375, -0.0123291015625, -0.0014495849609375, 0.001983642578125, -0.0126953125, 0.002777099609375, 0.00347900390625, -0.01531982421875, 0.0029296875, -0.00933837890625, -0.01129150390625, -0.003173828125, ...	[ 284, 4028, 108259, 6056, 10135, 170285, 11663, 10693, 18244, 50986, 33768, 74854, 59478, 3509, 98423, 13315, 11435, 33636, 1632, 4393, 36746, 35686, 72367, 1257, 12301, 174350, 44402, 168793, 1238, 32121, 93, 239469, 170, 1681, 86429, 5646, 836...	[ 0.0703125, 0.1572265625, 0.1689453125, 0.22119140625, 0.07098388671875, 0.002593994140625, 0.027191162109375, 0.0180511474609375, 0.1357421875, 0.1353759765625, 0.10321044921875, 0.1376953125, 0.07928466796875, 0.056396484375, 0.0295867919921875, 0.08642578125, 0.1380615234375, 0.1...	embed
14798613_c0	14798613	haskell	0	Title: How fast is Data.Sequence.Seq compared to []? Problem title: How fast is Data.Sequence.Seq compared to []? Tags: finger-tree, performance, list, haskell Problem: How fast is Data.Sequence.Seq compared to []? Clearly Seq asymptotically performs the same or better as [] for all possible operations. But since its s...	How fast is Data.Sequence.Seq compared to []? How fast is Data.Sequence.Seq compared to []? finger-tree performance list haskell How Data.Sequence.Seq Seq How fast is Data.Sequence.Seq compared to []? Clearly Seq asymptotically performs the same or better as [] for all possible operations. But since its structure is mo...	[ 0.014404296875, 0.00726318359375, 0.011962890625, -0.01190185546875, 0.004608154296875, -0.027099609375, -0.012939453125, -0.005218505859375, 0.01190185546875, -0.006256103515625, 0.0003986358642578125, -0.003448486328125, 0.001861572265625, 0.018310546875, -0.01519775390625, -0.002593...	[ 11249, 4271, 83, 11809, 4233, 944, 3956, 864, 154186, 51287, 62600, 23718, 5303, 1556, 142508, 503, 5, 47, 2676, 21737, 51339, 5701, 11522, 756, 7722, 41018, 45646, 1286, 96704, 19336, 13267, 53697, 645, 31251, 31895, 3249, 72803, 56, 1884,...	[ 0.056121826171875, 0.1971435546875, 0.04150390625, 0.1263427734375, 0.12890625, 0.0965576171875, 0.0648193359375, 0.2264404296875, 0.1800537109375, 0.1510009765625, 0.18896484375, 0.177734375, 0.1494140625, 0.096435546875, 0.18798828125, 0.1707763671875, 0.021087646484375, 0.018432...	embed
29476988_c0	29476988	haskell	0	Title: Ambiguous definition error while trying to define Eq for custom Tree data structure Problem title: Ambiguous definition error while trying to define Eq for custom Tree data structure Tags: haskell Problem: Ambiguous definition error while trying to define Eq for custom Tree data structure I'm trying to implement...	Ambiguous definition error while trying to define Eq for custom Tree data structure Ambiguous definition error while trying to define Eq for custom Tree data structure haskell Data.List Ambiguous Tree Ord Leaf Internal Prelude Ambiguous definition error while trying to define Eq for custom Tree data structure I'm tryin...	[ 0.0283203125, 0.00927734375, -0.01318359375, 0.005096435546875, 0.0294189453125, -0.005889892578125, -0.00148773193359375, -0.007659912109375, -0.0164794921875, -0.006500244140625, 0.00023651123046875, -0.02880859375, 0.028076171875, 0.007659912109375, 0.0012359619140625, 0.00628662109...	[ 10250, 12282, 10821, 80934, 18499, 31577, 61924, 241, 864, 114122, 101344, 2053, 45646, 1556, 142508, 11809, 154663, 35379, 2407, 106745, 1914, 822, 29479, 136, 572, 21493, 669, 53201, 28540, 1234, 70820, 27781, 10557, 67413, 920, 69112, 13648,...	[ 0.1368408203125, 0.1878662109375, 0.1591796875, 0.1927490234375, 0.1610107421875, 0.060577392578125, 0.14794921875, 0.047332763671875, 0.1973876953125, 0.138916015625, 0.203369140625, 0.080810546875, 0.125, 0.0980224609375, 0.1778564453125, 0.06427001953125, 0.073486328125, 0.18054...	embed
20478982_c0	20478982	haskell	0	Title: First attempt at Haskell: Converting lower case letters to upper case Problem title: First attempt at Haskell: Converting lower case letters to upper case Tags: haskell, functional-programming Problem: First attempt at Haskell: Converting lower case letters to upper case I have recently started learning Haskell,...	First attempt at Haskell: Converting lower case letters to upper case First attempt at Haskell: Converting lower case letters to upper case haskell functional-programming First Haskell Converting First attempt at Haskell: Converting lower case letters to upper case I have recently started learning Haskell, and I've tri...	[ 0.0020904541015625, -0.0037078857421875, 0.005859375, -0.0023651123046875, 0.0137939453125, 0.01177978515625, 0.003814697265625, 0.0027008056640625, 0.01031494140625, 0.0150146484375, 0.002838134765625, -0.00286865234375, 0.0272216796875, 0.0274658203125, -0.004364013671875, 0.00848388...	[ 23972, 81887, 20625, 142508, 1657, 814, 92319, 7225, 120820, 47, 1407, 56, 99, 1556, 123309, 28966, 26859, 52080, 37842, 105233, 32354, 96760, 2565, 142, 43240, 18, 3642, 4127, 17582, 28864, 2301, 1884, 3917, 115081, 136, 69427, 159978, 7964,...	[ 0.03692626953125, 0.1275634765625, 0.1009521484375, 0.217041015625, 0.019744873046875, 0.1158447265625, 0.2127685546875, 0.2095947265625, 0.1805419921875, 0.0853271484375, 0.144775390625, 0.1168212890625, 0.0009765625, 0.0789794921875, 0.0977783203125, 0.036376953125, 0.0038757324218...	embed
43185686_c0	43185686	haskell	0	Title: Readline dependencie error with stack Problem title: Readline dependencie error with stack Tags: haskell-stack, haskell Problem: Readline dependencie error with stack I have this error when I add this dependencie to my project.cabal file. Warning: defaultUserHooks in Setup script is deprecated. Configuring readl...	Readline dependencie error with stack Readline dependencie error with stack haskell-stack haskell the Readline Warning Setup Configuring readline-1.0.3.0 a.out GNU ISO C89 GNUreadline.framework rl_readline_version See config.log Readline dependencie error with stack I have this error when I add this dependencie to my p...	[ -0.00970458984375, -0.0106201171875, -0.0018310546875, 0.016845703125, 0.00726318359375, -0.005096435546875, 0.00115203857421875, 0, -0.01287841796875, -0.0079345703125, -0.00384521484375, -0.032470703125, -0.00872802734375, -0.0006256103515625, 0.007720947265625, 0.00165557861328125, ...	[ 4764, 2256, 42548, 19, 1474, 18499, 678, 177261, 1556, 142508, 590, 2594, 5550, 19943, 59994, 12301, 102107, 132265, 6056, 165132, 17408, 18949, 39116, 160328, 54123, 46354, 153837, 4867, 903, 15190, 13452, 408, 3571, 11435, 86869 ]	[ 0.231689453125, 0.2496337890625, 0.1898193359375, 0.05157470703125, 0.0906982421875, 0.163818359375, 0.110595703125, 0.2281494140625, 0.11181640625, 0.2120361328125, 0.076904296875, 0.1044921875, 0.07073974609375, 0.055755615234375, 0.06927490234375, 0.1824951171875, 0.06500244140625...	embed
44590358_c0	44590358	haskell	0	Title: `instance` for concrete type instead of typeclass? Problem title: `instance` for concrete type instead of typeclass? Tags: typeclass, haskell Problem: `instance` for concrete type instead of typeclass? I defined a simple list type: data MyList a = End \|Entry a (MyList a) Instead of deriving (Show) I implemented ...	`instance` for concrete type instead of typeclass? `instance` for concrete type instead of typeclass? typeclass haskell MyList End Entry Show Illegal All Use FlexibleInstances `instance` for concrete type instead of typeclass? I defined a simple list type: Instead of deriving (Show) I implemented that explicitly myself...	[ -0.01080322265625, -0.01025390625, 0.017822265625, -0.00677490234375, 0.006011962890625, 0.005950927734375, -0.010009765625, 0.0091552734375, 0.01422119140625, -0.01336669921875, -0.01519775390625, -0.041015625, 0.0250244140625, 0.019287109375, -0.0126953125, -0.0216064453125, 0.0186...	[ 73, 116071, 100, 122776, 10644, 64457, 67413, 1556, 142508, 2646, 154663, 18878, 357, 15123, 17367, 891, 86966, 3164, 36836, 180842, 2661, 61924, 8781, 5303, 175399, 111, 16406, 6496, 168660, 29479, 143726, 35978, 756, 10, 110527, 43240, 169123...	[ 0.109375, 0.2178955078125, 0.04815673828125, 0.2236328125, 0.1983642578125, 0.1361083984375, 0.2484130859375, 0.109619140625, 0.2047119140625, 0.130859375, 0.2198486328125, 0.1226806640625, 0.0863037109375, 0.0911865234375, 0.237548828125, 0.068359375, 0.1802978515625, 0.0556640625...	embed
28840749_c0	28840749	haskell	0	Title: Error installing fast-logger for yesod setup, Ubuntu Problem title: Error installing fast-logger for yesod setup, Ubuntu Tags: cabal, haskell, ubuntu, yesod Problem: Error installing fast-logger for yesod setup, Ubuntu I've been struggling to get Yesod running. I'm finally down to only one missing dependency, fa...	Error installing fast-logger for yesod setup, Ubuntu Error installing fast-logger for yesod setup, Ubuntu cabal haskell ubuntu yesod Error Ubuntu fast-logger-2.2.3 System Log FastLogger IO.hs:9:8 Could Blaze.ByteString.Builder.Internal.Types blaze-builder-0.3.3.4 Perhaps Use Failed ExitFailure Error installing fast-log...	[ 0.015869140625, 0.013427734375, -0.0113525390625, -0.0224609375, -0.0005645751953125, 0.006805419921875, -0.00640869140625, -0.0106201171875, -0.01171875, 0.003631591796875, 0.0145263671875, -0.031005859375, -0.002532958984375, -0.0107421875, 0.001556396484375, -0.0174560546875, -0.0...	[ 212059, 20600, 214, 4271, 9, 365, 21407, 100, 2422, 23722, 169581, 116890, 109524, 1556, 142508, 198996, 5428, 120883, 12353, 13146, 25290, 113972, 1505, 17780, 1126, 1019, 191147, 22446, 731, 75358, 71713, 121137, 44851, 196707, 9932, 177149, ...	[ 0.1617431640625, 0.1793212890625, 0.0310821533203125, 0.187255859375, 0.06396484375, 0.15087890625, 0.1937255859375, 0.07049560546875, 0.156982421875, 0.24169921875, 0.150146484375, 0.1829833984375, 0.170166015625, 0.0849609375, 0.1766357421875, 0.1396484375, 0.03302001953125, 0.14...	embed
46074184_c0	46074184	haskell	0	Title: Applying functions to lists with substitution Problem title: Applying functions to lists with substitution Tags: haskell, functional-programming Problem: Applying functions to lists with substitution I was trying to make a function that quickly calculates fractions. In my particular case there a factorials, so i...	Applying functions to lists with substitution Applying functions to lists with substitution haskell functional-programming Applying make_coprime x:xs Applying functions to lists with substitution I was trying to make a function that quickly calculates fractions. In my particular case there a factorials, so it s kinda e...	[ -0.0223388671875, 0.01708984375, 0.01129150390625, 0.00020599365234375, 0.0003910064697265625, -0.001922607421875, 0.0036468505859375, 0.005401611328125, 0.0294189453125, -0.0101318359375, 0.00201416015625, 0.00469970703125, 0.021484375, 0.01324462890625, 0.00152587890625, -0.007934570...	[ 5659, 538, 32354, 47, 5303, 7, 678, 161740, 1830, 1556, 142508, 123309, 28966, 3249, 587, 114654, 1022, 425, 31577, 69405, 74481, 175921, 31461, 15403, 8562, 23468, 54397, 30482, 6626, 101935, 552, 30646, 80836, 15044, 10176, 102678, 4785, 57...	[ 0.1214599609375, 0.09423828125, 0.1827392578125, 0.1046142578125, 0.2083740234375, 0.06402587890625, 0.1029052734375, 0.2071533203125, 0.05657958984375, 0.085693359375, 0.1966552734375, 0.120849609375, 0.0986328125, 0.1295166015625, 0.1175537109375, 0.250732421875, 0.04425048828125, ...	embed
66261288_c0	66261288	haskell	0	Title: Lens name leads to "not found" error, but it exists Problem title: Lens name leads to "not found" error, but it exists Tags: haskell Problem: Lens name leads to "not found" error, but it exists I have several modules. One of them defines a type Xyz and generates lens for it: -- module A data ...	Lens name leads to "not found" error, but it exists Lens name leads to "not found" error, but it exists haskell qualified Lens Xyz _xyzField _xyzState SomeState Generic Show A.Xyz A.field ERRORS HERE A.state THERE ERROR Not Lens name leads to "not found" error, but it exists I have several modules. ...	[ -0.007171630859375, -0.006591796875, -0.0093994140625, 0.01202392578125, -0.00167083740234375, 0.0186767578125, -0.0072021484375, 0.001953125, -0.00848388671875, -0.0150146484375, 0.01129150390625, 0.01007080078125, 0.00738525390625, -0.0179443359375, 0.01611328125, -0.01470947265625, ...	[ 18226, 7, 9351, 37105, 10869, 14037, 18499, 1284, 442, 32316, 1556, 142508, 217225, 1193, 32189, 50878, 169, 6159, 19388, 135206, 31384, 88342, 17367, 62, 1542, 28394, 151206, 24638, 65791, 61340, 11766, 11205, 88996, 61924, 10644, 139392, 3098...	[ 0.2308349609375, 0.0867919921875, 0.195068359375, 0.1485595703125, 0.189453125, 0.1981201171875, 0.2020263671875, 0.1171875, 0.0810546875, 0.2218017578125, 0.1036376953125, 0.2083740234375, 0.175537109375, 0.04193115234375, 0.17626953125, 0.054656982421875, 0.028564453125, 0.059631...	embed
37644382_c0	37644382	haskell	0	Title: Splitting a BinTree with tail recursion in Haskell Problem title: Splitting a BinTree with tail recursion in Haskell Tags: tail-recursion, recursion, binary-tree, haskell Problem: Splitting a BinTree with tail recursion in Haskell So this week we learned about union types, tail recursion and binary trees in Hask...	Splitting a BinTree with tail recursion in Haskell Splitting a BinTree with tail recursion in Haskell tail-recursion recursion binary-tree haskell Splitting BinTree Haskell Empty Node Show Maybe Nothing Just Splitting a BinTree with tail recursion in Haskell So this week we learned about union types, tail recursion and...	[ -0.001617431640625, 0.0247802734375, -0.004852294921875, -0.00604248046875, 0.004791259765625, 0.0140380859375, -0.0185546875, -0.02587890625, -0.000690460205078125, -0.01300048828125, 0.000591278076171875, -0.01055908203125, -0.005706787109375, -0.0003948211669921875, 0.0279541015625, ...	[ 46474, 1916, 16666, 62731, 13, 678, 46741, 195625, 1830, 20625, 142508, 48650, 2394, 6635, 62600, 1556, 31678, 438, 112, 17367, 83425, 182747, 5895, 69941, 52895, 1360, 61924, 53201, 2053, 10644, 37170, 33022, 32354, 7413, 2684, 25737, 110, 3...	[ 0.178466796875, 0.06072998046875, 0.15283203125, 0.243408203125, 0.058990478515625, 0.0235748291015625, 0.266845703125, 0.226806640625, 0.10638427734375, 0.1278076171875, 0.2213134765625, 0.152099609375, 0.114990234375, 0.07177734375, 0.14208984375, 0.100341796875, 0.12109375, 0.10...	embed
28685119_c0	28685119	haskell	0	Title: Fibonacci sequence generation Problem title: Fibonacci sequence generation Tags: fibonacci, haskell Problem: Fibonacci sequence generation I was writing a fibonacci sequence generator, and I was trying to understand the following code in Haskell fibs = 1 : 1 : zipWith (+) fibs (tail fibs) I understand what zipWi...	Fibonacci sequence generation Fibonacci sequence generation fibonacci haskell Fibonacci Fibonacci sequence generation I was writing a fibonacci sequence generator, and I was trying to understand the following code in Haskell fibs = 1 : 1 : zipWith (+) fibs (tail fibs) I understand what zipWith is, but I do not exactly ...	[ 0.01611328125, 0.0186767578125, -0.01287841796875, 0.000010073184967041016, 0.000972747802734375, 0.01318359375, 0.0015869140625, 0.000957489013671875, 0.0106201171875, -0.0294189453125, -0.005401611328125, 0.0037994384765625, 0.00191497802734375, 0.0252685546875, 0.006622314453125, 0....	[ 3698, 20990, 52544, 40, 944, 58093, 809, 1556, 142508, 32562, 3956, 145823, 31577, 28219, 18151, 20625, 16145, 2203, 106, 152, 68330, 194583, 22183, 46741, 1528, 71924, 15400, 14602, 139392, 756, 101935, 959, 121011, 17368, 65998, 23755, 123309...	[ 0.127685546875, 0.1649169921875, 0.17626953125, 0.055084228515625, 0.137939453125, 0.192138671875, 0.1832275390625, 0.123291015625, 0.22705078125, 0.0491943359375, 0.0225982666015625, 0.1934814453125, 0.00128173828125, 0.049224853515625, 0.1177978515625, 0.1241455078125, 0.1324462890...	embed
7663988_c0	7663988	haskell	0	Title: ScopedTypeVariables are sometimes in scope, sometimes not Problem title: ScopedTypeVariables are sometimes in scope, sometimes not Tags: haskell, parameterized, scope, types Problem: ScopedTypeVariables are sometimes in scope, sometimes not I'm trying to figure out when my type parameters will be in scope. I hav...	ScopedTypeVariables are sometimes in scope, sometimes not ScopedTypeVariables are sometimes in scope, sometimes not haskell parameterized scope types ScopedTypeVariables LANGUAGE IntegerAsType Integer BaseRing Num WORKS DOES NOT WORK ScopedTypeVariables are sometimes in scope, sometimes not I'm trying to figure out whe...	[ 0.004486083984375, 0.01446533203125, -0.00799560546875, -0.002227783203125, -0.0084228515625, -0.000850677490234375, -0.00860595703125, 0.0106201171875, 0.01324462890625, 0.0030059814453125, 0.0093994140625, -0.00946044921875, 0.00179290771484375, -0.017822265625, 0.004852294921875, -0...	[ 182783, 297, 196707, 81827, 14, 19736, 68018, 23, 70820, 959, 1556, 142508, 171859, 52895, 98064, 44401, 19659, 44978, 1052, 214, 52782, 231355, 6197, 6706, 86725, 26366, 3229, 10644, 135179, 6626, 31943, 27781, 22027, 18, 4488, 60212, 17721, ...	[ 0.23095703125, 0.1231689453125, 0.2454833984375, 0.1597900390625, 0.1197509765625, 0.1195068359375, 0.1612548828125, 0.124267578125, 0.2457275390625, 0.13671875, 0.125244140625, 0.2230224609375, 0.1881103515625, 0.153564453125, 0.1187744140625, 0.151611328125, 0.08367919921875, 0.1...	embed
25727072_c0	25727072	haskell	0	Title: Function application in Haskell Problem title: Function application in Haskell Tags: haskell, operator-sections, function, operators, partial-application Problem: Function application in Haskell OK, it's been a long day and my brain may not function at Haskell level, but I just cannot understand one example from...	Function application in Haskell Function application in Haskell haskell operator-sections function operators partial-application Haskell Main Function application in Haskell OK, it's been a long day and my brain may not function at Haskell level, but I just cannot understand one example from 'Learn You a Haskell'. The ...	[ -0.00634765625, 0.01708984375, 0.0208740234375, -0.01031494140625, -0.015380859375, 0.01806640625, 0.005096435546875, 0.0057373046875, -0.004241943359375, -0.0181884765625, -0.00665283203125, -0.035888671875, 0.0000782012939453125, 0.03271484375, -0.0064697265625, 0.01019287109375, 0...	[ 28670, 10763, 38415, 20625, 142508, 23, 1556, 39933, 7, 58994, 32354, 2878, 289, 101687, 12321, 78574, 1543, 959, 17366, 53418, 28219, 1632, 27781, 147, 2583, 40059, 104921, 678, 3650, 61924, 2060, 26818, 34735, 4568, 22288, 4369, 8439, 36880...	[ 0.1680908203125, 0.1287841796875, 0.226318359375, 0.1407470703125, 0.24658203125, 0.03729248046875, 0.1282958984375, 0.1549072265625, 0.005615234375, 0.10015869140625, 0.2041015625, 0.1356201171875, 0.06072998046875, 0.1883544921875, 0.061279296875, 0.109619140625, 0.06109619140625, ...	embed
40028933_c0	40028933	haskell	0	Title: Can I use Haskell's stack to compile and run _only_ the tests? Problem title: Can I use Haskell's stack to compile and run _only_ the tests? Tags: haskell-stack, haskell Problem: Can I use Haskell's stack to compile and run _only_ the tests? When I run a stack test or a stack test <package>:<test-suite...	Can I use Haskell's stack to compile and run _only_ the tests? Can I use Haskell's stack to compile and run _only_ the tests? haskell-stack haskell Can Haskell _only_ Can I use Haskell's stack to compile and run _only_ the tests? When I run a stack test or a stack test <package>:<test-suite> then the output l...	[ 0.00286865234375, 0.00994873046875, 0.00396728515625, -0.00897216796875, -0.005828857421875, 0.0096435546875, 0.0011138916015625, -0.00186920166015625, 0.006683349609375, 0.006072998046875, -0.00628662109375, 0.0023040771484375, 0.004364013671875, 0.0272216796875, 0, 0.01416015625, -...	[ 4171, 4527, 20625, 142508, 3768, 177261, 9969, 1340, 11675, 191, 538, 109921, 1556, 590, 2594, 70, 3034, 29102, 6954, 68879, 140992, 33342, 1884, 198343, 49725, 756, 65572, 186351, 24145, 97733, 25474, 17932, 1733, 75101, 4210, 27489, 49938, ...	[ 0.053314208984375, 0.0980224609375, 0.10052490234375, 0.2186279296875, 0.029388427734375, 0.2286376953125, 0.1474609375, 0.1336669921875, 0.1175537109375, 0.123291015625, 0.1234130859375, 0.2396240234375, 0.06988525390625, 0.07861328125, 0.07440185546875, 0.0062255859375, 0.203125, ...	embed
53950520_c0	53950520	haskell	0	Title: Playing random note durations with Euterpea / Haskell Problem title: Playing random note durations with Euterpea / Haskell Tags: euterpea, haskell Problem: Playing random note durations with Euterpea / Haskell I'm just getting started with Euterpea / Haskell, and I am trying to write a simple script that randomi...	Playing random note durations with Euterpea / Haskell Playing random note durations with Euterpea / Haskell euterpea haskell Euterpea System.Random Playing Haskell Playing random note durations with Euterpea / Haskell I'm just getting started with Euterpea / Haskell, and I am trying to write a simple script that random...	[ -0.009033203125, 0.0120849609375, 0.00433349609375, 0.002105712890625, 0.00185394287109375, 0.00457763671875, 0.0031890869140625, -0.01275634765625, -0.0111083984375, -0.052734375, -0.00124359130859375, 0.01324462890625, -0.0021514892578125, -0.0024566650390625, -0.01214599609375, 0.01...	[ 11356, 96759, 20537, 21025, 5256, 678, 5177, 720, 29518, 248, 20625, 142508, 25208, 1556, 12353, 126525, 3815, 214, 20949, 26859, 31577, 33022, 8781, 26499, 20650, 54397, 903, 43240, 12301, 48738, 4390, 10557, 17137, 76228, 2844, 160328, 46258,...	[ 0.1275634765625, 0.2183837890625, 0.191162109375, 0.1611328125, 0.060882568359375, 0.069091796875, 0.0753173828125, 0.1444091796875, 0.2236328125, 0.013336181640625, 0.128173828125, 0.2269287109375, 0.10711669921875, 0.10186767578125, 0.12646484375, 0.10479736328125, 0.1348876953125,...	embed
41927624_c0	41927624	haskell	0	Title: Matching expected type with actual type Problem title: Matching expected type with actual type Tags: types, haskell, typeclass Problem: Matching expected type with actual type What I am currently trying to do is create a type called Value : data Value = Num Int \| Sum Int Int \| Dif Int Int \| Neg Int deriving (Eq)...	Matching expected type with actual type Matching expected type with actual type types haskell typeclass Matching Value Num Sum Dif Neg Matching expected type with actual type What I am currently trying to do is create a type called Value : With which I want to implement an eval function: My expected results should be: ...	[ -0.01397705078125, 0.0022735595703125, 0.02099609375, 0.0162353515625, -0.006072998046875, 0.0185546875, -0.00927734375, -0.000583648681640625, 0.01129150390625, 0.011474609375, -0.01068115234375, -0.0201416015625, -0.0002193450927734375, -0.0189208984375, -0.008544921875, 0.0043640136...	[ 67407, 214, 84751, 10644, 678, 8561, 52895, 1556, 142508, 67413, 190060, 52782, 36335, 803, 420, 799, 177, 82424, 31577, 28282, 17106, 3444, 29479, 28, 1405, 32354, 50339, 43581, 18151, 19048, 3034, 12638, 39933, 61261, 2967, 187, 9790, 51339...	[ 0.2041015625, 0.0697021484375, 0.2005615234375, 0.2298583984375, 0.1204833984375, 0.1854248046875, 0.182861328125, 0.1328125, 0.202880859375, 0.177734375, 0.2122802734375, 0.07177734375, 0.1319580078125, 0.10211181640625, 0.0970458984375, 0.084228515625, 0.109619140625, 0.002197265...	embed
58050250_c1	58050250	haskell	1	<\|> (Parser g) = Parser $ \inp -> case f inp of Nothing -> g inp Just r -> Just r some p = (:) <$> p <*> (some p <\|> pure []) instance Monad Parser where (Parser f) >>= g = Parser $ \inp -> case f inp of Nothing -> Nothing Just (a, inp') -> runParser (g a) inp' satisfy p = Parser $ \case (x:xs) \| p x -> Just (x, xs) _...	<\|> (Parser g) = Parser $ \inp -> case f inp of Nothing -> g inp Just r -> Just r some p = (:) <$> p <*> (some p <\|> pure []) instance Monad Parser where (Parser f) >>= g = Parser $ \inp -> case f inp of Nothing -> Nothing Just (a, inp') -> runParser (g a) inp' satisfy p = Parser $ \case (x:xs) \| p x -> Just (x, xs) _...	[ 0.0040283203125, 0.0255126953125, 0.0018768310546875, 0.00933837890625, -0.005096435546875, 0.0260009765625, -0.0093994140625, -0.02490234375, 0.01611328125, 0.00095367431640625, 0.01116943359375, -0.004608154296875, -0.005279541015625, -0.00982666015625, -0.0078125, -0.001502990722656...	[ 58745, 28636, 2189, 706, 2203, 2392, 3650, 73, 254, 7225, 1238, 23, 111, 182747, 9563, 1690, 33079, 3060, 915, 12, 43452, 34166, 110527, 60331, 71, 11675, 177, 10, 40407, 58437, 425, 1022, 21441, 21656, 501, 79315, 23351, 4439, 20763, 306...	[ 0.051605224609375, 0.2052001953125, 0.218017578125, 0.1636962890625, 0.053955078125, 0.191162109375, 0.086181640625, 0.0853271484375, 0.1220703125, 0.1539306640625, 0.1302490234375, 0.0997314453125, 0.0875244140625, 0.1485595703125, 0.119140625, 0.0848388671875, 0.016937255859375, ...	embed
45228875_c0	45228875	haskell	0	Title: Haskell image processing library - hip - readImageExact OK, readImage compile error Problem title: Haskell image processing library - hip - readImageExact OK, readImage compile error Tags: image-processing, haskell Problem: Haskell image processing library - hip - readImageExact OK, readImage compile error I am ...	Haskell image processing library - hip - readImageExact OK, readImage compile error Haskell image processing library - hip - readImageExact OK, readImage compile error image-processing haskell Graphics.Image Graphics.Image.IO a Haskell BasicImage Image YCbCr Word8 JPG frog.jpg Readable InputFormat Haskell image process...	[ -0.006134033203125, -0.00396728515625, -0.00439453125, 0.02880859375, 0.0087890625, 0.032958984375, -0.0048828125, -0.0050048828125, -0.00750732421875, -0.0201416015625, 0.005584716796875, -0.01611328125, 0.004730224609375, -0.0147705078125, 0.003875732421875, -0.0191650390625, -0.00...	[ 20625, 142508, 29569, 9433, 35773, 26177, 12301, 216960, 19279, 47013, 14315, 9969, 1340, 18499, 63923, 1556, 189682, 17780, 91692, 22710, 990, 42, 22543, 1019, 124906, 211209, 25687, 4764, 2886, 102973, 214, 198932, 177261, 96, 933, 17376, 374...	[ 0.141845703125, 0.228271484375, 0.1322021484375, 0.0936279296875, 0.1806640625, 0.205322265625, 0.2091064453125, 0.25048828125, 0.1365966796875, 0.201416015625, 0.142333984375, 0.1636962890625, 0.1566162109375, 0.169921875, 0.0972900390625, 0.11279296875, 0.1214599609375, 0.1168212...	embed
77255208_c1	77255208	haskell	1	ToYao Char where type YaoType Char = Yao toYao c \| c `elem` ['0', '1'] = Right $ Yao c \| otherwise = Left "Yao can only be '0' or '1'" instance ToYao Value where type YaoType Value = (Yao, Yao) toYao v \| v == Value '6' = toYao ('0','1') \| v == Value '7' = toYao ('1','1') \| v == Value '8' = toYao ('0','0') \| v == Value...	ToYao Char where type YaoType Char = Yao toYao c \| c `elem` ['0', '1'] = Right $ Yao c \| otherwise = Left "Yao can only be '0' or '1'" instance ToYao Value where type YaoType Value = (Yao, Yao) toYao v \| v == Value '6' = toYao ('0','1') \| v == Value '7' = toYao ('1','1') \| v == Value '8' = toYao ('0','0') \| v == Value...	[ -0.0013885498046875, -0.0191650390625, 0.02001953125, 0.01312255859375, -0.0118408203125, 0.000659942626953125, 0.004364013671875, -0.01202392578125, 0.0093994140625, 0.028564453125, -0.00128936767578125, -0.0267333984375, 0.0023651123046875, -0.01068115234375, -0.01953125, -0.015625, ...	[ 717, 21566, 31, 21656, 7440, 10644, 2369, 196707, 2203, 47, 501, 6, 27889, 1135, 25, 2389, 4, 242, 418, 268, 90911, 3650, 120262, 636, 2480, 831, 4734, 186, 707, 58, 110527, 190060, 16, 81, 69112, 910, 15, 58745, 966, 1019, 1126, 903,...	[ 0.2376708984375, 0.291015625, 0.221435546875, 0.2215576171875, 0.0848388671875, 0.2205810546875, 0.2186279296875, 0.27001953125, 0.044708251953125, 0.2117919921875, 0.061309814453125, 0.012939453125, 0.1510009765625, 0.011962890625, 0.012847900390625, 0.1669921875, 0.0163116455078125...	embed
9270899_c0	9270899	haskell	0	Title: How to use UndecidableInstances locally? Problem title: How to use UndecidableInstances locally? Tags: type-systems, termination, haskell, ghc, typeclass Problem: How to use UndecidableInstances locally? Yes, I know that UndecidableInstances can be bad. I really tried hard to design my module so that it doesn't ...	How to use UndecidableInstances locally? How to use UndecidableInstances locally? type-systems termination haskell ghc typeclass How UndecidableInstances Foo Bar How to use UndecidableInstances locally? Yes, I know that UndecidableInstances can be bad. I really tried hard to design my module so that it doesn't need it ...	[ 0.0230712890625, 0.020263671875, 0.0072021484375, -0.007720947265625, 0.002349853515625, 0.008056640625, 0.005126953125, -0.002044677734375, 0.00799560546875, -0.034423828125, -0.0172119140625, -0.027099609375, 0.025634765625, 0.03271484375, 0.0164794921875, -0.01483154296875, 0.0151...	[ 11249, 4527, 79912, 24750, 2661, 4153, 116071, 7, 4000, 538, 47, 10644, 16751, 29527, 1556, 142508, 31380, 238, 67413, 9572, 31, 3253, 3714, 831, 186, 6494, 37842, 7941, 4331, 88996, 3871, 151134, 61687, 50697, 56786, 8306, 40956, 11, 79298...	[ 0.072509765625, 0.152099609375, 0.115478515625, 0.1871337890625, 0.1732177734375, 0.09423828125, 0.21435546875, 0.06951904296875, 0.1640625, 0.077880859375, 0.012481689453125, 0.123046875, 0.1033935546875, 0.1466064453125, 0.0531005859375, 0.1524658203125, 0.040191650390625, 0.0314...	embed
33336722_c0	33336722	haskell	0	Title: Monad facade for a MonadState in Haskell Problem title: Monad facade for a MonadState in Haskell Tags: monad-transformers, state-monad, facade, haskell Problem: Monad facade for a MonadState in Haskell Background: I'm creating a game with a stateful monad for reading and writing changes to the global state of th...	Monad facade for a MonadState in Haskell Monad facade for a MonadState in Haskell monad-transformers state-monad facade haskell Monad MonadState Haskell Character World Monad facade for a MonadState in Haskell Background: I'm creating a game with a stateful monad for reading and writing changes to the global state of t...	[ -0.00787353515625, -0.00051116943359375, -0.01318359375, -0.007476806640625, 0.0128173828125, -0.00860595703125, -0.0179443359375, -0.01318359375, 0.005828857421875, -0.0284423828125, 0.0030059814453125, 0.004180908203125, -0.01434326171875, 0.01531982421875, -0.0196533203125, -0.01843...	[ 60331, 71, 49304, 112, 100, 135206, 13, 23, 20625, 142508, 2667, 712, 215175, 1314, 11341, 3796, 1556, 21656, 2263, 6661, 10, 64330, 105233, 6712, 7844, 16454, 32562, 65572, 7964, 2806, 1884, 101637, 82761, 84068, 101904, 77758, 29458, 3917, ...	[ 0.2255859375, 0.1849365234375, 0.239990234375, 0.1282958984375, 0.0814208984375, 0.2198486328125, 0.0791015625, 0.07098388671875, 0.16259765625, 0.263427734375, 0.1514892578125, 0.193115234375, 0.214599609375, 0.10369873046875, 0.1826171875, 0.10638427734375, 0.11279296875, 0.06665...	embed
70347620_c1	70347620	haskell	1	ATGTGATTAAGGTCTAAGGTATGTCTTCCACCAGACAACGGACACAGTCAATTAGAAGCTGGGTAAAGGGGTCTCTCCTGCGGAGCGGGGAGCGCCAAGCCAGGGACAATAATGGCCTGAAGTTCATTCTCCCGGAGATGGGGGTAGAAGCAGGTGCAGGTGCCTTAGAGGGGTCAAAAATAAGAGGAACAGGGTTCACTCTAAGCGGTCTCCCAGGGAAGGCTGCGGGTTGGAGCAAGGGTCCAAGATTCTAAGGGCCAGGACTCAGCTCCAGAAGCTCGATCCCGCCCCACGCGTTCCTGCTCCGGCCAGGGGAGGGG...	ATGTGATTAAGGTCTAAGGTATGTCTTCCACCAGACAACGGACACAGTCAATTAGAAGCTGGGTAAAGGGGTCTCTCCTGCGGAGCGGGGAGCGCCAAGCCAGGGACAATAATGGCCTGAAGTTCATTCTCCCGGAGATGGGGGTAGAAGCAGGTGCAGGTGCCTTAGAGGGGTCAAAAATAAGAGGAACAGGGTTCACTCTAAGCGGTCTCCCAGGGAAGGCTGCGGGTTGGAGCAAGGGTCCAAGATTCTAAGGGCCAGGACTCAGCTCCAGAAGCTCGATCCCGCCCCACGCGTTCCTGCTCCGGCCAGGGGAGGGG...	[ 0.0010223388671875, 0.00909423828125, 0.007476806640625, 0.00179290771484375, 0.01397705078125, 0.015869140625, 0.0019683837890625, 0.0084228515625, 0.0185546875, -0.0133056640625, 0.0145263671875, -0.0018768310546875, 0.00142669677734375, -0.00147247314453125, 0.01434326171875, 0.0056...	[ 17672, 37315, 132819, 7783, 127489, 96481, 35979, 46754, 23613, 56367, 69657, 13133, 13709, 618, 14849, 98062, 20499, 134982, 113438, 13739, 15467, 724, 84161, 43379, 284, 441, 15012, 85955, 127673, 2646, 92814, 759, 103510, 14858, 214, 56050, ...	[ 0.04656982421875, 0.0635986328125, 0.048187255859375, 0.034912109375, 0.0292205810546875, 0.051177978515625, 0.0295867919921875, 0.013092041015625, 0.001556396484375, 0.001220703125, 0.001251220703125, 0.001251220703125, 0.091796875, 0.00067138671875, 0.00128173828125, 0.00213623046875...	embed
71950562_c0	71950562	haskell	0	Title: How to define overlappable depending instances? Problem title: How to define overlappable depending instances? Tags: derivingvia, haskell Problem: How to define overlappable depending instances? So I have a typeclass somewhat like this class Stringify x where stringify :: x -> String and I have two other typecla...	How to define overlappable depending instances? How to define overlappable depending instances? derivingvia haskell How Stringify LTextify L.Text Textify T.Text L.unpack T.unpack How to define overlappable depending instances? So I have a typeclass somewhat like this and I have two other typeclasses somewhat like those...	[ 0.00897216796875, -0.0115966796875, -0.010986328125, 0.0030670166015625, 0.0035400390625, 0.00787353515625, -0.00439453125, -0.00457763671875, 0.007781982421875, -0.00057220458984375, -0.01300048828125, -0.0191650390625, 0.024658203125, 0.01141357421875, -0.007415771484375, 0.008789062...	[ 11249, 61924, 645, 143, 6366, 2886, 8, 96819, 110527, 47, 16406, 6496, 3459, 1556, 142508, 23351, 214, 40383, 339, 174379, 24129, 384, 309, 29102, 10644, 67413, 208806, 1884, 903, 6626, 108750, 186992, 693, 52721, 67, 21635, 29568, 75169, 1...	[ 0.04693603515625, 0.1915283203125, 0.1490478515625, 0.2025146484375, 0.176025390625, 0.18798828125, 0.1182861328125, 0.224609375, 0.241455078125, 0.000457763671875, 0.06298828125, 0.04833984375, 0.1025390625, 0.08251953125, 0.187255859375, 0.097412109375, 0.05450439453125, 0.189819...	embed
45941163_c0	45941163	haskell	0	Title: Haskell FFI - return updated structure Problem title: Haskell FFI - return updated structure Tags: haskell, c2hs, haskell-ffi Problem: Haskell FFI - return updated structure I have the following C function that I want to call from Haskell : void read_params_for (property_list_t *props); The function is supposed ...	Haskell FFI - return updated structure Haskell FFI - return updated structure haskell c2hs haskell-ffi ccall Haskell FFI read_params_for property_list_t Storable ForeignPtr PropertyListT C2HS Ptr Haskell FFI - return updated structure I have the following C function that I want to call from Haskell : The function is su...	[ 0.013916015625, 0.02685546875, -0.0050048828125, -0.00836181640625, 0.0019989013671875, 0.010498046875, 0.003631591796875, -0.0277099609375, -0.0155029296875, 0.0030670166015625, 0.028564453125, -0.0230712890625, -0.00811767578125, -0.0181884765625, 0.0140380859375, -0.01214599609375, ...	[ 20625, 142508, 563, 22724, 30646, 150011, 45646, 1556, 304, 127, 24500, 501, 85763, 12301, 2500, 8256, 57266, 6562, 23604, 2886, 184293, 4448, 206984, 154663, 618, 313, 38131, 436, 25632, 32354, 3444, 11782, 1295, 134598, 53299, 18, 27623, 14...	[ 0.1400146484375, 0.236083984375, 0.0960693359375, 0.2491455078125, 0.174072265625, 0.1883544921875, 0.239501953125, 0.12890625, 0.122802734375, 0.07666015625, 0.183349609375, 0.00006103515625, 0.150634765625, 0.13134765625, 0.06988525390625, 0.092041015625, 0.171630859375, 0.160278...	embed
77968904_c1	77968904	haskell	1	0..] l where { e (u, v) = if mod u 2 == 0 then v else -v } search :: [Int] -> String search l = if c then "YES\n" else "NO\n" where { b = zip l $ tail l; c = any (\(x, y) -> x == y) b; } solution :: [Int] -> String solution = search.sort.flock.floss des :: IO String des = do io <- readInts let t = head io all_data <- s...	0..] l where { e (u, v) = if mod u 2 == 0 then v else -v } search :: [Int] -> String search l = if c then "YES\n" else "NO\n" where { b = zip l $ tail l; c = any (\(x, y) -> x == y) b; } solution :: [Int] -> String solution = search.sort.flock.floss des :: IO String des = do io <- readInts let t = head io all_data <- s...	[ -0.01043701171875, 0.0223388671875, 0.007232666015625, -0.0029449462890625, -0.00164794921875, -0.0003261566162109375, -0.01263427734375, 0.00592041015625, 0.00897216796875, -0.01220703125, 0.007293701171875, -0.019287109375, 0.0194091796875, 0.0186767578125, -0.0089111328125, -0.00619...	[ 757, 5, 268, 96, 7440, 28, 34, 81, 2174, 2811, 75, 116, 69112, 7068, 37076, 334, 33938, 1984, 4153, 18, 33079, 23351, 214, 2203, 501, 46445, 294, 8575, 876, 68330, 3650, 46741, 2499, 425, 113, 1022, 29806, 62351, 420, 21135, 52347, 7,...	[ 0.1829833984375, 0.039093017578125, 0.002716064453125, 0.151611328125, 0.02117919921875, 0.1090087890625, 0.1253662109375, 0.1895751953125, 0.033721923828125, 0.191650390625, 0.160400390625, 0.103515625, 0.0628662109375, 0.00885009765625, 0.102783203125, 0.188720703125, 0.23352050781...	embed
31729752_c0	31729752	haskell	0	Title: How to use unless (or when) in an Esqueleto query? Problem title: How to use unless (or when) in an Esqueleto query? Tags: esqueleto, haskell, sql Problem: How to use unless (or when) in an Esqueleto query? I build a query that joins a few tables and restricts the result further unless one field called IncludeAl...	How to use unless (or when) in an Esqueleto query? How to use unless (or when) in an Esqueleto query? esqueleto haskell sql $ How Esqueleto IncludeAll where_ AId BField1 AField2 CField1 AField3 BIncludeAll BField2 CField2 Bool Database.Esqueleto.Internal.Language.Value Value SqlExpr How to use unless (or when) in an Es...	[ -0.0272216796875, 0.0087890625, 0.0142822265625, 0.0003662109375, 0.0047607421875, 0.01129150390625, 0.0005645751953125, -0.00946044921875, -0.01507568359375, -0.0169677734375, 0.0208740234375, 0.01416015625, 0.0029754638671875, -0.005645751953125, -0.00921630859375, 0.01165771484375, ...	[ 11249, 4527, 117934, 748, 3229, 1184, 37631, 31580, 41, 1294, 23, 66660, 133, 188, 1556, 142508, 99247, 8942, 822, 112, 43512, 7440, 38730, 6159, 19388, 363, 29786, 929, 187781, 10393, 856, 50770, 190060, 19279, 10287, 45367, 33284, 23180, ...	[ 0.0439453125, 0.1522216796875, 0.322021484375, 0.155029296875, 0.2327880859375, 0.05810546875, 0.1485595703125, 0.228271484375, 0.1270751953125, 0.11767578125, 0.008544921875, 0.1002197265625, 0.14111328125, 0.134033203125, 0.0369873046875, 0.1629638671875, 0.1339111328125, 0.07586...	embed
17207566_c0	17207566	haskell	0	Title: How can I have a pipe with multiple communication types? Problem title: How can I have a pipe with multiple communication types? Tags: haskell, haskell-pipes Problem: How can I have a pipe with multiple communication types? Say I have this code: import Control.Monad.State hiding (StateT) import Control.Proxy ser...	How can I have a pipe with multiple communication types? How can I have a pipe with multiple communication types? haskell haskell-pipes Control.Monad.State Control.Proxy How StateT Proxy Monad Server Bool Client Either How can I have a pipe with multiple communication types? Say I have this code: Currently the client a...	[ 0.003936767578125, 0.00445556640625, -0.025390625, 0.0179443359375, -0.023681640625, -0.00174713134765625, -0.0341796875, -0.0191650390625, 0.005401611328125, -0.0181884765625, -0.0016021728515625, -0.0029754638671875, 0.0322265625, 0.015869140625, -0.000576019287109375, 0.011352539062...	[ 11249, 831, 765, 137158, 678, 48716, 36398, 52895, 10, 1556, 142508, 1434, 13569, 27131, 46674, 712, 135206, 10752, 50878, 22836, 618, 1250, 60331, 71, 22687, 2460, 929, 91732, 9319, 87, 18151, 114063, 23282, 11343, 25379, 360, 18, 53299, 3...	[ 0.0791015625, 0.06365966796875, 0.1278076171875, 0.25634765625, 0.0865478515625, 0.226806640625, 0.2320556640625, 0.2242431640625, 0.0267791748046875, 0.0802001953125, 0.1868896484375, 0.1248779296875, 0.06182861328125, 0.1551513671875, 0.0701904296875, 0.1016845703125, 0.04962158203...	embed
41069249_c2	41069249	haskell	2	lVUQ", "scope" : "GOOGLE", "types" : [ "bowling_alley", "bakery", "lodging", "restaurant", "food", "store", "point_of_interest", "establishment" ], "vicinity" : "проспект Михаила Нагибина, 19, Ростов-на-Дону" }, / more items here "status" : "ok" } I created data for representing JSON: data Restaurant = Restaurant {stat...	lVUQ", "scope" : "GOOGLE", "types" : [ "bowling_alley", "bakery", "lodging", "restaurant", "food", "store", "point_of_interest", "establishment" ], "vicinity" : "проспект Михаила Нагибина, 19, Ростов-на-Дону" }, / more items here "status" : "ok" } I created data for representing JSON: data Restaurant = Restaurant {stat...	[ -0.0181884765625, 0.011962890625, -0.003082275390625, -0.0096435546875, 0.01251220703125, 0.030517578125, 0.000797271728515625, -0.03076171875, 0.0208740234375, 0.005462646484375, 0.006195068359375, -0.0054931640625, -0.0037994384765625, -0.01708984375, -0.01251220703125, -0.0085449218...	[ 96, 51947, 2737, 70820, 19930, 670, 126833, 50986, 84201, 2069, 13474, 53, 10075, 26976, 61488, 9966, 173874, 49558, 45804, 38496, 50171, 29511, 15227, 54731, 19, 2481, 7044, 53940, 65960, 672, 3281, 82470, 17846, 148484, 212, 205407, 55769, ...	[ 0.0115966796875, 0.1507568359375, 0.137451171875, 0.140380859375, 0.0207977294921875, 0.054351806640625, 0.10552978515625, 0.1510009765625, 0.08282470703125, 0.150390625, 0.11669921875, 0.06536865234375, 0.0643310546875, 0.1209716796875, 0.1015625, 0.130615234375, 0.2103271484375, ...	embed
76067567_c0	76067567	haskell	0	Title: What is the utility of this kind of implementation of data structures using functions? Problem title: What is the utility of this kind of implementation of data structures using functions? Tags: haskell Problem: What is the utility of this kind of implementation of data structures using functions? I'm implementi...	What is the utility of this kind of implementation of data structures using functions? What is the utility of this kind of implementation of data structures using functions? haskell functions What Bool Set _combine What is the utility of this kind of implementation of data structures using functions? I'm implementing a...	[ -0.000156402587890625, 0.0250244140625, 0.0189208984375, 0.0111083984375, -0.0026092529296875, 0.00173187255859375, 0.00921630859375, -0.01171875, 0.0155029296875, -0.00762939453125, -0.01251220703125, 0.0079345703125, 0.00115203857421875, -0.006072998046875, -0.008056640625, 0.0077514...	[ 4865, 83, 19537, 939, 111, 903, 8562, 208124, 2053, 45646, 17368, 32354, 7, 1556, 142508, 2460, 929, 19943, 277, 46187, 70, 29479, 10644, 10, 18151, 2060, 831, 18, 200103, 5423, 6097, 52895, 80234, 4527, 7225, 154186, 678, 5303 ]	[ 0.0697021484375, 0.062255859375, 0.19921875, 0.1424560546875, 0.026702880859375, 0.109375, 0.1551513671875, 0.175537109375, 0.1070556640625, 0.2098388671875, 0.09735107421875, 0.2318115234375, 0.0572509765625, 0.1173095703125, 0.220703125, 0.1220703125, 0.2227783203125, 0.209838867...	embed
26792397_c0	26792397	haskell	0	Title: Haskell recursive nextWord function Problem title: Haskell recursive nextWord function Tags: haskell, recursion Problem: Haskell recursive nextWord function I wanted to implement a function nextWord which given a list of characters s (i.e. a String ) returns a pair consisiting of the next word in s and the remai...	Haskell recursive nextWord function Haskell recursive nextWord function haskell recursion Haskell next:rest Haskell recursive nextWord function I wanted to implement a function nextWord which given a list of characters s (i.e. a String ) returns a pair consisiting of the next word in s and the remaining characters in s...	[ -0.004791259765625, 0.005645751953125, 0.01092529296875, 0.037109375, -0.0029144287109375, 0.0189208984375, -0.000713348388671875, -0.008544921875, 0.0107421875, 0.003936767578125, 0.0291748046875, -0.0133056640625, -0.0126953125, -0.0033416748046875, -0.0146484375, 0.0019378662109375,...	[ 20625, 142508, 195625, 5844, 11737, 164805, 32354, 1556, 56644, 36663, 29479, 34475, 5303, 124850, 91, 23351, 214, 30646, 80836, 56493, 1916, 2565, 47143, 7103, 5117, 184750, 18499, 89914, 29806, 102337, 6492, 107777, 43240, 169123, 15400, 15935,...	[ 0.0928955078125, 0.184814453125, 0.178955078125, 0.097412109375, 0.188720703125, 0.2314453125, 0.1837158203125, 0.09375, 0.19677734375, 0.021636962890625, 0.109375, 0.0177001953125, 0.1044921875, 0.122802734375, 0.1143798828125, 0.0997314453125, 0.08856201171875, 0.1385498046875, ...	embed
47560058_c0	47560058	haskell	0	Title: Trapezoid Rule in Haskell Problem title: Trapezoid Rule in Haskell Tags: haskell, integration Problem: Trapezoid Rule in Haskell I'm trying to define the trapezoid rule in Haskell. I created a helper function innerSum, which is sum portion of the trapezoid rule. Then in the integral definition I multiple by the ...	Trapezoid Rule in Haskell Trapezoid Rule in Haskell haskell integration Trapezoid Rule Haskell Double Integer n::Double Trapezoid Rule in Haskell I'm trying to define the trapezoid rule in Haskell. I created a helper function innerSum, which is sum portion of the trapezoid rule. Then in the integral definition I multip...	[ -0.0101318359375, 0.0107421875, -0.0068359375, 0.0118408203125, -0.00147247314453125, 0.00341796875, -0.007171630859375, -0.0157470703125, 0.00017642974853515625, 0.006988525390625, -0.00537109375, 0.001708984375, -0.00927734375, 0.00909423828125, 0.03173828125, 0.02490234375, 0.0128...	[ 4937, 1081, 1158, 532, 139118, 20625, 142508, 23, 1556, 157353, 107172, 44401, 653, 8331, 34, 2661, 31577, 61924, 63819, 1255, 48899, 79986, 75935, 4358, 56, 32354, 75414, 294, 316, 10554, 126826, 28970, 80934, 48716, 62488, 5646, 92319, 9909...	[ 0.1358642578125, 0.11376953125, 0.1689453125, 0.11181640625, 0.236572265625, 0.1663818359375, 0.27197265625, 0.036956787109375, 0.156982421875, 0.2137451171875, 0.130615234375, 0.206787109375, 0.0975341796875, 0.012451171875, 0.0567626953125, 0.0733642578125, 0.019500732421875, 0.1...	embed
26146870_c0	26146870	haskell	0	Title: Idiomatic way to share lens field definitions among modules Problem title: Idiomatic way to share lens field definitions among modules Tags: haskell-lens, haskell Problem: Idiomatic way to share lens field definitions among modules If I have two modules that both use Control.Lens.TH ' makeFields to generate fiel...	Idiomatic way to share lens field definitions among modules Idiomatic way to share lens field definitions among modules haskell-lens haskell Control.Lens First Second Idiomatic Control.Lens.TH HasName SharedFields Bool Read Show Third Idiomatic way to share lens field definitions among modules If I have two modules tha...	[ -0.00145721435546875, 0.0002346038818359375, -0.01312255859375, 0.01458740234375, 0.00860595703125, 0.01080322265625, 0.01458740234375, -0.0240478515625, 0.006134033203125, -0.0201416015625, 0.005218505859375, 0.02734375, 0.001739501953125, -0.0128173828125, 0.0140380859375, 0.00601196...	[ 5670, 47148, 3917, 12008, 3098, 7, 44457, 80934, 54940, 88996, 1556, 142508, 1977, 27131, 866, 1755, 77648, 23415, 20625, 163612, 29790, 6159, 19388, 2460, 929, 4764, 17367, 198387, 6626, 15044, 3249, 139392, 17164, 12921, 5701, 9351, 2965, 1...	[ 0.1419677734375, 0.1258544921875, 0.059112548828125, 0.2242431640625, 0.20654296875, 0.107177734375, 0.2420654296875, 0.1898193359375, 0.1492919921875, 0.2109375, 0.1058349609375, 0.216064453125, 0.16357421875, 0.1817626953125, 0.1181640625, 0.1719970703125, 0.015777587890625, 0.13...	embed
27569283_c1	27569283	haskell	1	,SongChord) let (mbsctext, sc) = fromScf scf mbscid = fromPathPiece mbsctext :: Maybe (Key SongChord) sck <- case mbscid of Nothing -> do runDB $ insert sc Just sc_id -> do -- runDB $ insert sc -- here's the problem! runDB $ replace sc_id sc defaultLayout $ [whamlet\| <h1> #{show mbscid} <br> #{show sck} <br> #{show scf...	,SongChord) let (mbsctext, sc) = fromScf scf mbscid = fromPathPiece mbsctext :: Maybe (Key SongChord) sck <- case mbscid of Nothing -> do runDB $ insert sc Just sc_id -> do -- runDB $ insert sc -- here's the problem! runDB $ replace sc_id sc defaultLayout $ [whamlet\| <h1> #{show mbscid} <br> #{show sck} <br> #{show scf...	[ -0.01043701171875, 0.0162353515625, 0.013916015625, -0.0238037109375, -0.00054931640625, 0.015380859375, -0.0274658203125, -0.029052734375, -0.0032958984375, -0.0140380859375, -0.0010833740234375, -0.004180908203125, 0.00201416015625, -0.017333984375, -0.00677490234375, 0.0051879882812...	[ 4, 294, 4021, 15982, 6651, 2633, 6492, 10382, 22829, 9023, 2203, 1295, 67466, 420, 39369, 7, 55964, 683, 10519, 111242, 83425, 162429, 5986, 91, 2594, 7225, 111, 182747, 11675, 39463, 3650, 183540, 532, 3688, 2967, 91995, 454, 114977, 53, ...	[ 0.01104736328125, 0.012664794921875, 0.1544189453125, 0.11572265625, 0.1824951171875, 0.0963134765625, 0.05743408203125, 0.0830078125, 0.2327880859375, 0.1827392578125, 0.007049560546875, 0.124267578125, 0.184326171875, 0.16015625, 0.1126708984375, 0.05853271484375, 0.2568359375, 0...	embed
69236252_c0	69236252	haskell	0	Title: A kind of sliding window Problem title: A kind of sliding window Tags: haskell, sliding-window Problem: A kind of sliding window This function comes from some code to calculate convolutions of finite sequences. window n k = [ drop (i-k) $ take i $ [1..n] \| i <- [1..(n+k)-1] ] *Main> window 4 6 [[1],[1,2],[1,2,3]...	A kind of sliding window A kind of sliding window haskell sliding-window Main Prelude A kind of sliding window This function comes from some code to calculate convolutions of finite sequences. It's sliding window of length k over a sequence of length n , where k can be larger than n . The code calls take and drop on th...	[ -0.015869140625, 0.023681640625, 0.012451171875, -0.0172119140625, -0.0269775390625, 0.01171875, -0.0186767578125, -0.0123291015625, 0.008056640625, -0.02197265625, 0.002655029296875, -0.01611328125, 0.01177978515625, 0.0264892578125, -0.005279541015625, 0.00787353515625, 0.014038085...	[ 62, 8562, 132692, 214, 76896, 111, 1556, 142508, 9494, 24293, 12321, 822, 3293, 32354, 32497, 1295, 18151, 47, 74481, 158, 137089, 94418, 13, 40, 26513, 5170, 140909, 472, 645, 944, 653, 831, 150679, 11782, 5646, 136, 36069, 31344, 5303, ...	[ 0.06634521484375, 0.193359375, 0.2291259765625, 0.134033203125, 0.255859375, 0.05511474609375, 0.1312255859375, 0.2470703125, 0.1488037109375, 0.1617431640625, 0.006134033203125, 0.049957275390625, 0.021484375, 0.196044921875, 0.0697021484375, 0.0290985107421875, 0.1668701171875, 0...	embed
5467890_c0	5467890	haskell	0	Title: IO in where clause Problem title: IO in where clause Tags: io, monads, haskell Problem: IO in where clause I thought I was beginning to understand IO in Haskell until I ran into the following problem. I have the following function, which returns type IO Float: getFundPrice :: Int -> Int -> IO Float getFundPrice ...	IO in where clause IO in where clause io monads haskell Float Shares Period Fund IO in where clause I thought I was beginning to understand IO in Haskell until I ran into the following problem. I have the following function, which returns type IO Float: The function getFundPrice' uses the takusen database library and r...	[ 0.003692626953125, 0.0130615234375, -0.012939453125, -0.017578125, -0.0179443359375, 0.00091552734375, -0.010498046875, -0.0098876953125, 0.0211181640625, -0.0146484375, 0.01434326171875, -0.0150146484375, -0.00023555755615234375, -0.04150390625, 0.00311279296875, 0.015625, -0.009094...	[ 17780, 23, 7440, 70731, 13, 22995, 2667, 712, 1556, 142508, 38699, 257, 29790, 92329, 32897, 17569, 86595, 28219, 20625, 2967, 25632, 32354, 30646, 10644, 2046, 919, 7030, 33163, 329, 4527, 466, 223, 33, 63399, 35773, 5303, 365, 65771, 3034...	[ 0.251708984375, 0.0848388671875, 0.195556640625, 0.17431640625, 0.07720947265625, 0.19775390625, 0.04522705078125, 0.060760498046875, 0.1019287109375, 0.2220458984375, 0.196044921875, 0.1273193359375, 0.1026611328125, 0.115478515625, 0.187255859375, 0.07879638671875, 0.01318359375, ...	embed
40620913_c0	40620913	haskell	0	Title: Why do We Need Sum Types? Problem title: Why do We Need Sum Types? Tags: haskell, type-theory Problem: Why do We Need Sum Types? Imagine a language which doesn't allow multiple value constructors for a data type. Instead of writing data Color = White \| Black \| Blue we would have data White = White data Black = B...	Why do We Need Sum Types? Why do We Need Sum Types? haskell type-theory Why Need Sum Types Color White Black Blue ColorsStartingWithB Nil Cons List Why do We Need Sum Types? Imagine a language which doesn't allow multiple value constructors for a data type. Instead of writing we would have where :\|: (here it's not \| to...	[ -0.01202392578125, -0.000461578369140625, -0.00092315673828125, 0.005615234375, -0.0220947265625, -0.004364013671875, -0.024169921875, 0.005035400390625, 0.00567626953125, 0.000759124755859375, -0.00750732421875, -0.033203125, 0.013671875, 0.01104736328125, 0, 0.01300048828125, 0.023...	[ 44084, 54, 1401, 52889, 36335, 60457, 7, 1556, 142508, 10644, 2347, 30675, 51193, 22392, 10074, 22928, 126597, 194583, 571, 77175, 39215, 32036, 133196, 46876, 22027, 18, 63769, 48716, 34292, 64549, 25251, 2053, 175399, 32562, 2806, 7440, 959, ...	[ 0.1497802734375, 0.049072265625, 0.0780029296875, 0.1998291015625, 0.2498779296875, 0.29541015625, 0.102294921875, 0.09588623046875, 0.2132568359375, 0.208984375, 0.0516357421875, 0.0225677490234375, 0.18505859375, 0.131103515625, 0.1173095703125, 0.1248779296875, 0.03839111328125, ...	embed
7732243_c0	7732243	haskell	0	Title: Haskell: Remove largest list Problem title: Haskell: Remove largest list Tags: list, haskell Problem: Haskell: Remove largest list I have a list of lists, and a function that returns the list with the most items: extract ::[Plateau]->Plateau extract(x:xs) \|x==maximumBy(compare `on` length)(x:xs)=x \|otherwise = e...	Haskell: Remove largest list Haskell: Remove largest list list haskell Haskell Remove Plateau x:xs Haskell: Remove largest list I have a list of lists, and a function that returns the list with the most items: Now I need a function to take the same [Plateau] and return a new [Plateau] that has the previous largest remo...	[ -0.00823974609375, 0.0242919921875, 0.007110595703125, 0.01324462890625, -0.0036163330078125, 0.0130615234375, 0.005218505859375, -0.01446533203125, 0.027099609375, 0.020751953125, 0.010498046875, 0.010498046875, 0.01251220703125, -0.0101318359375, 0.00970458984375, 0.00433349609375, ...	[ 20625, 142508, 181139, 142105, 5303, 1556, 22387, 8918, 1022, 425, 32354, 30646, 678, 2684, 55769, 3871, 5646, 5701, 117231, 3525, 96362, 184750, 11782, 25230, 86, 12096, 75358, 4568, 4488, 26785, 32036, 37385, 6287, 33342, 1884, 3688, 442, 1...	[ 0.1334228515625, 0.232421875, 0.1492919921875, 0.1634521484375, 0.22216796875, 0.109375, 0.16552734375, 0.2108154296875, 0.000457763671875, 0.0345458984375, 0.15380859375, 0.1072998046875, 0.07025146484375, 0.1282958984375, 0.1336669921875, 0.05621337890625, 0.022491455078125, 0.02...	embed
67286262_c0	67286262	haskell	0	Title: Encoding Algebraic Data Types with Aeson in Haskell Problem title: Encoding Algebraic Data Types with Aeson in Haskell Tags: algebraic-data-types, to-json, haskell, aeson Problem: Encoding Algebraic Data Types with Aeson in Haskell I have the following ADT implementation: data FeatureValue = FvInt Int \| FvFloat ...	Encoding Algebraic Data Types with Aeson in Haskell Encoding Algebraic Data Types with Aeson in Haskell algebraic-data-types to-json haskell aeson Encoding Algebraic Data Types Aeson Haskell FeatureValue FvInt FvFloat Float FvText Text FvBool Bool Show ApiResponse Online Maybe Offline Just Nothing ToJSON Encoding Algeb...	[ -0.00118255615234375, -0.0012359619140625, -0.01043701171875, 0.01080322265625, -0.0257568359375, -0.026611328125, -0.01416015625, 0.0167236328125, -0.013671875, 0.0250244140625, -0.01263427734375, 0.010009765625, 0.0037841796875, 0.030029296875, 0.01043701171875, -0.0166015625, 0.01...	[ 357, 587, 6238, 884, 429, 2844, 11809, 60457, 678, 62, 90, 191, 23, 20625, 142508, 144, 10135, 50986, 47, 170, 1681, 1556, 10, 106594, 856, 50770, 334, 4153, 365, 38699, 174379, 24129, 12647, 929, 2460, 17367, 5787, 94399, 2823, 83425, ...	[ 0.047149658203125, 0.17236328125, 0.0277557373046875, 0.0267333984375, 0.07220458984375, 0.1099853515625, 0.1131591796875, 0.1990966796875, 0.07110595703125, 0.10009765625, 0.1383056640625, 0.182373046875, 0.01763916015625, 0.135986328125, 0.230224609375, 0.0172576904296875, 0.097473...	embed
13170803_c0	13170803	haskell	0	Title: Type algebra and Knuth's up arrow notation Problem title: Type algebra and Knuth's up arrow notation Tags: types, algebraic-data-types, haskell, functional-programming Problem: Type algebra and Knuth's up arrow notation Reading through this question and this blog post got me thinking more about type al...	Type algebra and Knuth's up arrow notation Type algebra and Knuth's up arrow notation types algebraic-data-types haskell functional-programming Type Knuth Either Type algebra and Knuth's up arrow notation Reading through this question and this blog post got me thinking more about type algebra and specifically...	[ 0.004119873046875, 0.0206298828125, -0.001861572265625, 0.01214599609375, -0.01171875, -0.0074462890625, -0.01422119140625, -0.0106201171875, -0.0030975341796875, -0.01416015625, 0.002777099609375, -0.0152587890625, 0.005126953125, 0.00885009765625, 0.016845703125, -0.01202392578125, ...	[ 60457, 144, 429, 2844, 136, 136820, 127, 3768, 1257, 118201, 110, 22062, 52895, 10135, 50986, 1556, 142508, 123309, 28966, 9319, 47644, 1286, 10644, 3642, 47, 128431, 442, 831, 5351, 111, 62, 335, 237, 66044, 1328, 571, 4958, 12989, 80836, ...	[ 0.26171875, 0.054473876953125, 0.137939453125, 0.1390380859375, 0.043975830078125, 0.1688232421875, 0.168701171875, 0.0977783203125, 0.1541748046875, 0.208251953125, 0.1590576171875, 0.037628173828125, 0.2261962890625, 0.09765625, 0.2344970703125, 0.06298828125, 0.1683349609375, 0....	embed
23607190_c1	23607190	haskell	1	"input" typeOne <- runEitherT $ do result <- (decode (pack input) :: Maybe Value) ?? "Could not parse. Input JSON document is malformed" typeTwoObj <- (result ^? key "typeTwo") ?? "Could not find key typeTwo in JSON document." typeThreeObj <- (result ^? key "typeThree") ?? "Could not find key typeThree in JSON documen...	"input" typeOne <- runEitherT $ do result <- (decode (pack input) :: Maybe Value) ?? "Could not parse. Input JSON document is malformed" typeTwoObj <- (result ^? key "typeTwo") ?? "Could not find key typeTwo in JSON document." typeThreeObj <- (result ^? key "typeThree") ?? "Could not find key typeThree in JSON documen...	[ -0.0211181640625, 0.005584716796875, -0.0201416015625, -0.002716064453125, 0.012451171875, 0.015380859375, -0.011474609375, -0.00982666015625, -0.01214599609375, -0.023681640625, 0.0164794921875, 0.023193359375, -0.00616455078125, 0.0003986358642578125, -0.006439208984375, 0.0125122070...	[ 73, 7077, 10644, 62068, 11675, 9319, 618, 3650, 54, 16750, 112, 40899, 29102, 107730, 83425, 190060, 24610, 52366, 959, 366, 184, 360, 821, 58627, 12937, 960, 5037, 297, 3613, 46471, 170, 2109, 7136, 22799, 50986, 7413, 107, 13, 9351, 116...	[ 0.07891845703125, 0.14794921875, 0.2264404296875, 0.18994140625, 0.07421875, 0.1529541015625, 0.1134033203125, 0.08123779296875, 0.0155792236328125, 0.144287109375, 0.1224365234375, 0.1864013671875, 0.13916015625, 0.1693115234375, 0.17138671875, 0.1920166015625, 0.0667724609375, 0....	embed
71833731_c0	71833731	haskell	0	Title: Does GHC generate optimized code for `mapM_`? Problem title: Does GHC generate optimized code for `mapM_`? Tags: io, haskell Problem: Does GHC generate optimized code for `mapM_`? I wrote this code, import System.FilePath ((</>)) fp = "/Users/USER/Documents/Test/" fpAcc = fp </> "acc.txt" paths = map (fp </>) ["...	Does GHC generate optimized code for `mapM_`? Does GHC generate optimized code for `mapM_`? io haskell System.FilePath Does GHC mapM_ Users USER Documents Test acc.txt A.txt B.txt C.txt Foldable Monad See Note List INLINE Does GHC generate optimized code for `mapM_`? I wrote this code, and this is the definition of map...	[ 0, 0.0196533203125, 0.017333984375, -0.0020294189453125, -0.0137939453125, 0.01556396484375, -0.01019287109375, -0.00445556640625, -0.00038909912109375, 0.00311279296875, -0.005218505859375, -0.0042724609375, 0.00311279296875, 0.027099609375, 0.005096435546875, 0.00390625, -0.0063171...	[ 101790, 527, 73265, 139392, 15572, 29367, 18151, 62346, 594, 454, 22995, 1556, 142508, 12353, 174350, 683, 10519, 22288, 53400, 345, 50184, 43101, 8647, 50015, 124326, 62, 335, 30077, 71, 2886, 60331, 18622, 57339, 100, 80934, 125195, 9007, 3...	[ 0.03192138671875, 0.0970458984375, 0.213623046875, 0.1639404296875, 0.188232421875, 0.102783203125, 0.2105712890625, 0.1995849609375, 0.2030029296875, 0.1524658203125, 0.14697265625, 0.100830078125, 0.1949462890625, 0.05670166015625, 0.156494140625, 0.033935546875, 0.10400390625, 0...	embed
32496864_c1	32496864	haskell	1	plus’, namely ‘1.0’ In the second argument of ‘($)’, namely ‘plus 1.0 2.0’ In a stmt of a 'do' block: print $ plus 1.0 2.0 The same happens when trying to call sort twice with different types: main = do print $ plus' 1.0 2.0 print $ plus 1.0 2.0 print $ sort [3, 1, 2] print $ sort "cba" produces the following error: te...	plus’, namely ‘1.0’ In the second argument of ‘($)’, namely ‘plus 1.0 2.0’ In a stmt of a 'do' block: print $ plus 1.0 2.0 The same happens when trying to call sort twice with different types: main = do print $ plus' 1.0 2.0 print $ plus 1.0 2.0 print $ sort [3, 1, 2] print $ sort "cba" produces the following error: te...	[ -0.005126953125, 0.01300048828125, 0.029296875, -0.004974365234375, 0.01214599609375, 0.015380859375, 0.0025634765625, -0.020263671875, 0.006317138671875, -0.01116943359375, -0.0081787109375, -0.015380859375, -0.0062255859375, -0.01611328125, -0.01104736328125, -0.004608154296875, -0...	[ 1001, 110987, 102107, 17932, 10750, 4369, 32108, 53855, 16655, 6138, 39, 18, 246, 46389, 28412, 3650, 96276, 31577, 11782, 12096, 186351, 12921, 52895, 5201, 116, 238, 402, 27489, 25632, 18499, 3034, 5, 127, 22635, 22950, 438, 110527, 839, ...	[ 0.285888671875, 0.032958984375, 0.1697998046875, 0.0845947265625, 0.207275390625, 0.1199951171875, 0.2705078125, 0.1458740234375, 0.1827392578125, 0.03668212890625, 0.009124755859375, 0.138671875, 0.104736328125, 0.1773681640625, 0.1458740234375, 0.0682373046875, 0.009552001953125, ...	embed
32908793_c1	32908793	haskell	1	Nothing,Nothing,Just 7, Just 1, Just 2, Nothing,Nothing] , [Nothing,Just 5, Nothing,Nothing,Nothing,Nothing,Just 1, Just 8, Nothing] , [Nothing,Nothing,Just 9, Just 2, Nothing,Just 4, Just 7, Nothing,Nothing] , [Nothing,Nothing,Nothing,Nothing,Just 1, Just 3, Nothing,Just 2, Just 8] , [Just 4, Nothing,Nothing,Just 5, ...	Nothing,Nothing,Just 7, Just 1, Just 2, Nothing,Nothing] , [Nothing,Just 5, Nothing,Nothing,Nothing,Nothing,Just 1, Just 8, Nothing] , [Nothing,Nothing,Just 9, Just 2, Nothing,Just 4, Just 7, Nothing,Nothing] , [Nothing,Nothing,Nothing,Nothing,Just 1, Just 3, Nothing,Just 2, Just 8] , [Just 4, Nothing,Nothing,Just 5, ...	[ -0.0089111328125, 0.047119140625, 0.011474609375, -0.01080322265625, 0.00677490234375, 0.016845703125, 0.00002014636993408203, 0.0162353515625, 0.01080322265625, 0.043212890625, -0.005645751953125, 0.001190185546875, 0.0015716552734375, 0.00628662109375, -0.03466796875, 0.009521484375,...	[ 182747, 4, 5021, 64113, 127794, 361, 9563, 106, 116, 268, 190, 382, 483, 201, 138, 305, 10114, 4210, 56656, 2822, 184345, 7103, 167201, 110558, 28864, 26073, 12, 11062, 5037, 756, 363, 425, 81409, 80231, 83425 ]	[ 0.29296875, 0.1005859375, 0.119384765625, 0.251953125, 0.2337646484375, 0.1923828125, 0.2064208984375, 0.1129150390625, 0.149169921875, 0.0587158203125, 0.149169921875, 0.14697265625, 0.1724853515625, 0.1298828125, 0.171875, 0.13232421875, 0.01171875, 0.08270263671875, 0.23779296...	embed
64403376_c0	64403376	haskell	0	Title: Cabal: How to configure transitive build-dependencies in the same project Problem title: Cabal: How to configure transitive build-dependencies in the same project Tags: cabal, haskell Problem: Cabal: How to configure transitive build-dependencies in the same project I have a cabal project. It has library and tes...	Cabal: How to configure transitive build-dependencies in the same project Cabal: How to configure transitive build-dependencies in the same project cabal haskell Cabal How Lib DeriveGeneric cryptohash-sha1 Test.hs Cabal: How to configure transitive build-dependencies in the same project I have a cabal project. It has l...	[ -0.00104522705078125, 0.01031494140625, -0.0028228759765625, 0.0034027099609375, -0.0064697265625, -0.0242919921875, -0.019287109375, 0.01068115234375, 0.0174560546875, -0.0108642578125, 0.003662109375, -0.008056640625, -0.000080108642578125, 0.035888671875, 0.007232666015625, -0.01599...	[ 30438, 289, 11249, 222495, 62621, 5844, 45367, 105254, 13, 117538, 5701, 13452, 109524, 1556, 142508, 43278, 1310, 135932, 12259, 215637, 126234, 2420, 418, 8647, 127, 35773, 3034, 30388, 56566, 109921, 1294, 123309, 2967, 217684, 15190, 98169, ...	[ 0.1583251953125, 0.1669921875, 0.056671142578125, 0.2225341796875, 0.1824951171875, 0.13427734375, 0.138427734375, 0.158447265625, 0.0703125, 0.062744140625, 0.1036376953125, 0.1368408203125, 0.224853515625, 0.0806884765625, 0.1734619140625, 0.10888671875, 0.069580078125, 0.1026611...	embed
52355940_c0	52355940	haskell	0	Title: Iterate and getStdRandom Problem title: Iterate and getStdRandom Tags: haskell, random Problem: Iterate and getStdRandom I have the following code (trying to simulate a Gaussian random walk): import System.Random import Control.Applicative getStdNormal :: StdGen -> (Float,StdGen) getStdNormal g = let l = drop 1 ...	Iterate and getStdRandom Iterate and getStdRandom haskell random System.Random Control.Applicative Iterate StdGen Float Iterate and getStdRandom I have the following code (trying to simulate a Gaussian random walk): l1 is evaluated to the list of (apparently normal) random values, just as I can expect: However, l2 beha...	[ -0.0032501220703125, -0.006683349609375, -0.0012969970703125, -0.01446533203125, -0.004608154296875, 0.0157470703125, 0.0078125, -0.0169677734375, -0.002410888671875, -0.04736328125, 0.0242919921875, 0.042724609375, -0.0032958984375, -0.00921630859375, 0.01458740234375, 0.0154418945312...	[ 87, 8560, 67, 136, 2046, 37455, 71, 126525, 3815, 1556, 142508, 96759, 12353, 27131, 39179, 11048, 2907, 105376, 38699, 257, 765, 25632, 18151, 15123, 40226, 26336, 7, 39209, 35691, 96, 418, 83, 151575, 47, 5303, 77978, 3638, 142424, 1660, ...	[ 0.0361328125, 0.283935546875, 0.13720703125, 0.09075927734375, 0.1259765625, 0.170166015625, 0.08612060546875, 0.1719970703125, 0.173583984375, 0.109619140625, 0.19287109375, 0.214599609375, 0.07476806640625, 0.125244140625, 0.00518798828125, 0.041839599609375, 0.173828125, 0.13696...	embed
20296936_c0	20296936	haskell	0	Title: Is it possible to create a Functor instance for sorted binary trees in Haskell? Problem title: Is it possible to create a Functor instance for sorted binary trees in Haskell? Tags: functional-programming, design-patterns, functor, haskell Problem: Is it possible to create a Functor instance for sorted binary tre...	Is it possible to create a Functor instance for sorted binary trees in Haskell? Is it possible to create a Functor instance for sorted binary trees in Haskell? functional-programming design-patterns functor haskell Functor Haskell SortBinTree EmptyNode Node Ord Is it possible to create a Functor instance for sorted bin...	[ 0.01019287109375, -0.0029144287109375, -0.0027008056640625, -0.031494140625, 0.008544921875, 0.0146484375, -0.004852294921875, -0.0252685546875, -0.00115203857421875, 0.00360107421875, -0.004913330078125, -0.0177001953125, 0.004852294921875, -0.003753662109375, -0.0002956390380859375, ...	[ 2071, 7722, 28282, 28670, 18770, 110527, 100, 17497, 71, 2394, 6635, 1360, 20625, 142508, 10, 90, 23, 123309, 28966, 4331, 7477, 1556, 53666, 571, 73, 62731, 31678, 5021, 438, 35379, 442, 10644, 64549, 748, 61924, 10422, 18507, 2684, 32354,...	[ 0.0239410400390625, 0.1414794921875, 0.1331787109375, 0.169677734375, 0.19189453125, 0.2340087890625, 0.03857421875, 0.1820068359375, 0.0645751953125, 0.145263671875, 0.05645751953125, 0.1678466796875, 0.116455078125, 0.2254638671875, 0.0213165283203125, 0.035186767578125, 0.02919006...	embed
2270277_c0	2270277	haskell	0	Title: What is [] (list constructor) in Haskell? Problem title: What is [] (list constructor) in Haskell? Tags: types, list, haskell, data-structures Problem: What is [] (list constructor) in Haskell? I'm Having problems understanding functors, specifically what a concrete type is in LYAH. I believe this is because I d...	What is [] (list constructor) in Haskell? What is [] (list constructor) in Haskell? types list haskell data-structures What Haskell Maybe Just What is [] (list constructor) in Haskell? I'm Having problems understanding functors, specifically what a concrete type is in LYAH. I believe this is because I don't understand ...	[ 0.02099609375, -0.004791259765625, -0.0010223388671875, 0.0228271484375, 0.00014209747314453125, 0.0125732421875, -0.00115966796875, 0.0032806396484375, 0.00081634521484375, 0.01348876953125, 0.00531005859375, -0.042236328125, 0.004547119140625, -0.01611328125, -0.0155029296875, -0.002...	[ 4865, 83, 378, 268, 6562, 64549, 748, 23, 20625, 142508, 32, 15, 52895, 5303, 1556, 2053, 137656, 83425, 9563, 44402, 100094, 7477, 18770, 183037, 2367, 10, 122776, 10644, 339, 192583, 28219, 6183, 2071, 9, 2271, 36716, 442, 34292, 29459, ...	[ 0.1051025390625, 0.0946044921875, 0.1180419921875, 0.1395263671875, 0.220703125, 0.23828125, 0.17236328125, 0.097412109375, 0.1463623046875, 0.2418212890625, 0.00439453125, 0.02545166015625, 0.185546875, 0.151123046875, 0.1231689453125, 0.050750732421875, 0.0855712890625, 0.2291259...	embed
10747079_c1	10747079	haskell	1	:.i:.j:.2 Which takes this much time to process a 640x420 image on my 2Ghz core 2 duo laptop: real 2m32.572s user 4m57.324s sys 0m1.870s I know something must be quite wrong, because I have gotten much better performance on much more complex algorithms using Repa 2. Under that API, the big improvement I found came from...	:.i:.j:.2 Which takes this much time to process a 640x420 image on my 2Ghz core 2 duo laptop: real 2m32.572s user 4m57.324s sys 0m1.870s I know something must be quite wrong, because I have gotten much better performance on much more complex algorithms using Repa 2. Under that API, the big improvement I found came from...	[ -0.01361083984375, -0.0130615234375, -0.0167236328125, 0.015869140625, 0.00811767578125, 0.01318359375, -0.024169921875, -0.0111083984375, -0.0054931640625, -0.032470703125, 0.01312255859375, -0.0024261474609375, -0.00811767578125, -0.003173828125, -0.0017547607421875, 0.0164794921875,...	[ 170, 304, 51776, 903, 5045, 1733, 9433, 112311, 425, 120377, 29569, 98, 116, 56458, 34965, 26367, 2773, 39, 6460, 177917, 38937, 201, 758, 145515, 2357, 954, 119044, 5757, 3714, 8110, 32233, 44691, 17763, 33, 11522, 23718, 1286, 27140, 2348...	[ 0.06024169921875, 0.1019287109375, 0.094482421875, 0.0738525390625, 0.09246826171875, 0.1278076171875, 0.1575927734375, 0.2022705078125, 0.047882080078125, 0.240234375, 0.205322265625, 0.030517578125, 0.1314697265625, 0.111572265625, 0.130859375, 0.2132568359375, 0.1839599609375, 0...	embed
11104182_c0	11104182	haskell	0	Title: Matrix division in Haskell Problem title: Matrix division in Haskell Tags: haskell Problem: Matrix division in Haskell What is wrong? This code is supposed to do matrix division by finding a times b inverse. I try to understand what its errors are but I fail to see how to link it. import List import Ratio invers...	Matrix division in Haskell Matrix division in Haskell haskell List Ratio Data.Array Matrix Haskell Rational Just Num Array Matrix division in Haskell What is wrong? This code is supposed to do matrix division by finding a times b inverse. I try to understand what its errors are but I fail to see how to link it. How can...	[ -0.021240234375, 0.029296875, 0.011474609375, -0.0108642578125, -0.000209808349609375, -0.0125732421875, -0.0128173828125, 0.006866455078125, 0.000362396240234375, 0.00188446044921875, -0.0031585693359375, 0.01055908203125, 0.0185546875, -0.01806640625, -0.01373291015625, -0.0099487304...	[ 194234, 91853, 23, 20625, 142508, 1556, 32036, 2552, 5565, 11809, 7092, 43315, 9563, 52782, 69253, 53, 4865, 83, 44691, 3293, 18151, 134598, 47, 54, 50944, 425, 390, 90791, 10, 20028, 876, 37676, 9790, 28219, 18499, 35782, 3126, 678, 6024, ...	[ 0.2705078125, 0.255126953125, 0.1131591796875, 0.16259765625, 0.251953125, 0.1497802734375, 0.111083984375, 0.1094970703125, 0.1317138671875, 0.060028076171875, 0.111083984375, 0.10174560546875, 0.10382080078125, 0.085693359375, 0.07843017578125, 0.006744384765625, 0.0210723876953125...	embed
25066616_c0	25066616	haskell	0	Title: Find a certain tag in html Problem title: Find a certain tag in html Tags: haskell, html-parsing Problem: Find a certain tag in html I need to find a certain tag (the tag itself and its content) in html: import Text.XML.Cursor import Text.HTML.DOM (parseLBS) page <- simpleHttp "example.com" let cursor = fromDocu...	Find a certain tag in html Find a certain tag in html haskell html-parsing Text.XML.Cursor Text.HTML.DOM Find example.com Value TX.elementName Data.String.fromString TX.Name T.pack Map.member TX.elementAttributes Couldn T.Text Expected Map.Map Actual Find a certain tag in html I need to find a certain tag (the tag itse...	[ -0.00372314453125, 0.0150146484375, 0.00147247314453125, -0.01806640625, 0.00408935546875, 0.0167236328125, -0.00885009765625, -0.00836181640625, 0.0028839111328125, -0.04150390625, 0.0189208984375, -0.0177001953125, -0.01531982421875, -0.0115966796875, 0.0023651123046875, 0.0057067871...	[ 26040, 24233, 7909, 23, 7693, 10, 1556, 142508, 2500, 6953, 24129, 39456, 474, 4970, 127068, 127214, 27781, 277, 190060, 54047, 62766, 163612, 11809, 71713, 161063, 384, 29102, 42719, 27417, 191145, 191147, 174379, 60075, 13, 166179, 100582, 38...	[ 0.1492919921875, 0.1927490234375, 0.2666015625, 0.12158203125, 0.239013671875, 0.013946533203125, 0.117431640625, 0.218505859375, 0.08837890625, 0.01025390625, 0.0928955078125, 0.0814208984375, 0.0870361328125, 0.1583251953125, 0.193115234375, 0.13818359375, 0.1529541015625, 0.0777...	embed

36007149_c1

36007149

haskell

1

-> FunPtr RebalanceCbFun -> IO () I don't understand what part is missing Ptr or FunPtr here. I also tried to wrap the whole rdKafkaConfSetRebalanceCb into FunPtr like: foreign import ccall unsafe "rd_kafka.h &rd_kafka_conf_set_rebalance_cb" rdKafkaConfSetRebalanceCb :: FunPtr (Ptr RdKafkaConfT -> FunPtr RebalanceCbFu...

[ 0.00185394287109375, 0.006103515625, -0.01446533203125, -0.00396728515625, -0.0024261474609375, -0.002197265625, -0.005340576171875, -0.00811767578125, 0.007537841796875, -0.0037994384765625, -0.0172119140625, -0.00799560546875, -0.00823974609375, -0.006988525390625, -0.01544189453125, ...

[ 33079, 28670, 683, 4448, 853, 173212, 441, 275, 97249, 17780, 28219, 2831, 132283, 436, 3688, 37842, 137565, 28271, 4216, 2407, 161, 11935, 420, 294, 126, 4332, 3934, 110613, 24927, 85763, 115840, 127, 70547, 3509, 107, 71, 618, 10422, 9969...

[ 0.0035400390625, 0.1629638671875, 0.1170654296875, 0.258056640625, 0.0841064453125, 0.28662109375, 0.03375244140625, 0.1409912109375, 0.1981201171875, 0.20947265625, 0.096923828125, 0.1270751953125, 0.1907958984375, 0.074951171875, 0.034423828125, 0.030975341796875, 0.1383056640625, ...

embed

29380363_c0

29380363

haskell

0

Title: how to parse a uniprot-file with parsec? Problem title: how to parse a uniprot-file with parsec? Tags: haskell Problem: how to parse a uniprot-file with parsec? I am a newbie to Haskell, but it seems like a powerful language that I want to learn. I was adopting some code from the chapter in real world Haskell on...

how to parse a uniprot-file with parsec? how to parse a uniprot-file with parsec? haskell ParseError Text.ParserCombinators.Parsec Either uniprot_sprot.fasta how to parse a uniprot-file with parsec? I am a newbie to Haskell, but it seems like a powerful language that I want to learn. I was adopting some code from the c...

[ -0.00927734375, 0.020751953125, -0.0029144287109375, 0.0234375, -0.0025634765625, -0.0034332275390625, 0.004852294921875, -0.03515625, -0.0106201171875, -0.0145263671875, -0.006256103515625, 0.0011138916015625, 0.01007080078125, -0.003570556640625, 0.00653076171875, 0.00048828125, 0....

[ 3642, 366, 184, 19844, 18606, 29822, 678, 39797, 1556, 142508, 2392, 18468, 31611, 24129, 28636, 2189, 19155, 22230, 39473, 11, 9014, 20625, 113138, 46876, 30698, 30666, 18151, 139539, 2773, 8999, 10002, 11389, 10941, 11435, 58055, 115923, 4034...

[ 0.05572509765625, 0.1591796875, 0.1248779296875, 0.1717529296875, 0.3115234375, 0.1988525390625, 0.06787109375, 0.26318359375, 0.06768798828125, 0.2100830078125, 0.10791015625, 0.0703125, 0.052032470703125, 0.10040283203125, 0.1099853515625, 0.06231689453125, 0.1468505859375, 0.084...

embed

7288929_c0

7288929

haskell

0

Title: Coerce to multiple-parameter type in Haskell Problem title: Coerce to multiple-parameter type in Haskell Tags: coercion, polymorphism, haskell Problem: Coerce to multiple-parameter type in Haskell I have a type class IntegerAsType a where value :: a -> Integer data T5 instance IntegerAsType T5 where value _ = 5 ...

Coerce to multiple-parameter type in Haskell Coerce to multiple-parameter type in Haskell coercion polymorphism haskell Coerce Haskell IntegerAsType Integer Num PolyRing Couldn Coerce to multiple-parameter type in Haskell I have a type My main question is: how do I define a variable in a particular PolyRing ? It should...

[ -0.033447265625, 0.002044677734375, -0.004669189453125, 0.0169677734375, -0.0081787109375, 0.0032958984375, -0.009033203125, -0.005126953125, 0.006134033203125, -0.00982666015625, -0.0021209716796875, -0.02783203125, 0.0223388671875, -0.01177978515625, -0.033447265625, -0.0252685546875...

[ 1311, 56, 329, 47, 48716, 6276, 29089, 10644, 20625, 142508, 23, 552, 6447, 35874, 178851, 1556, 44401, 19659, 196707, 52782, 63306, 1052, 214, 191147, 765, 5201, 9655, 3642, 61924, 77336, 17311, 1650, 5351, 581, 26785, 6002, 86531, 7103, 7...

[ 0.1107177734375, 0.18310546875, 0.1375732421875, 0.073974609375, 0.19384765625, 0.0999755859375, 0.1309814453125, 0.1920166015625, 0.14892578125, 0.241943359375, 0.048980712890625, 0.05572509765625, 0.07476806640625, 0.1055908203125, 0.1485595703125, 0.13525390625, 0.1475830078125, ...

embed

45967186_c0

45967186

haskell

0

Title: Two function calls but only one trace displayed Problem title: Two function calls but only one trace displayed Tags: trace, haskell, ghc Problem: Two function calls but only one trace displayed With GHC version 8.0.2 the following program: import Debug.Trace f=trace("f was called")$(+1) main = do print $ f 1 pri...

Two function calls but only one trace displayed Two function calls but only one trace displayed trace haskell ghc Debug.Trace Two called:1 called:2 Two function calls but only one trace displayed With GHC version 8.0.2 the following program: outputs: Is it the expected behaviour? If yes, why? I expected the string f wa...

[ 0.0216064453125, -0.00982666015625, -0.006805419921875, 0.0167236328125, 0.00836181640625, 0.0078125, 0.0034027099609375, 0.00180816650390625, 0.00927734375, 0.006256103515625, 0.01318359375, -0.0135498046875, -0.0250244140625, 0.0033416748046875, 0.007781982421875, 0.00872802734375, ...

[ 32964, 32354, 11782, 7, 1284, 4734, 1632, 144851, 44116, 1556, 142508, 31380, 238, 262, 85779, 28542, 329, 35839, 19721, 304, 527, 73265, 11389, 3217, 133684, 25632, 1528, 140992, 2071, 70, 84751, 224833, 72272, 15400, 79315, 1238, 509, 28412...

[ 0.18359375, 0.2083740234375, 0.2294921875, 0.06103515625, 0.0819091796875, 0.157958984375, 0.167724609375, 0.2548828125, 0.1898193359375, 0.1212158203125, 0.208984375, 0.146728515625, 0.1182861328125, 0.087646484375, 0.20849609375, 0.17822265625, 0.06243896484375, 0.181640625, 0....

embed

7924251_c0

7924251

haskell

0

Title: haskell -- odd ambiguous type variable error message for code in "where" statement with TypeFamilies extension Problem title: haskell -- odd ambiguous type variable error message for code in "where" statement with TypeFamilies extension Tags: ambiguity, ghc, types, haskell Problem: haskell --...

haskell -- odd ambiguous type variable error message for code in "where" statement with TypeFamilies extension haskell -- odd ambiguous type variable error message for code in "where" statement with TypeFamilies extension ambiguity ghc types haskell a TypeFamilies LANGUAGE NoMonomorphismRestriction ...

[ 0.01416015625, -0.0120849609375, -0.01141357421875, -0.0078125, 0.01123046875, -0.0027008056640625, -0.0174560546875, 0.0021820068359375, -0.0042724609375, -0.003570556640625, 0.01409912109375, -0.032958984375, 0.016357421875, -0.01953125, 0.00897216796875, 0.0113525390625, 0.0158691...

[ 1556, 142508, 70270, 920, 12282, 10821, 10644, 77336, 18499, 26008, 18151, 136913, 63805, 60457, 919, 1191, 25720, 111938, 678, 31380, 238, 52895, 98064, 438, 46674, 178851, 7655, 8647, 44401, 127, 24864, 12221, 10250, 1250, 275, 2886, 190355, ...

[ 0.14697265625, 0.27294921875, 0.1341552734375, 0.1141357421875, 0.2001953125, 0.011566162109375, 0.1439208984375, 0.2178955078125, 0.1636962890625, 0.086669921875, 0.1768798828125, 0.1981201171875, 0.1771240234375, 0.19287109375, 0.042510986328125, 0.0975341796875, 0.10162353515625, ...

embed

6401936_c2

6401936

haskell

2

ghc-prim ... linking ... done. Loading package integer-gmp ... linking ... done. Loading package base ... linking ... done. Prelude> t <- Data.HashTable.new (==) Data.HashTable.hashString *** Parser: *** Desugar: *** Simplify: *** CorePrep: *** ByteCodeGen: Prelude> Data.HashTable.insert t "Joni" 1 *** Parser: <intera...

[ -0.020751953125, -0.006378173828125, 0.01031494140625, 0.0067138671875, 0.00634765625, 0.01239013671875, -0.004486083984375, -0.017822265625, 0.01409912109375, -0.0255126953125, -0.0198974609375, -0.0162353515625, -0.0096435546875, 0.010986328125, 0.0086669921875, 0.00762939453125, 0...

[ 31380, 238, 9, 35188, 153, 3126, 214, 16940, 228006, 98169, 892, 1505, 177, 2676, 3647, 1914, 822, 112, 808, 11809, 6495, 1495, 618, 2886, 54936, 69112, 126234, 71713, 2392, 5581, 34, 1970, 55331, 28574, 31365, 19273, 3311, 67, 114211, 10...

[ 0.185302734375, 0.1806640625, 0.047607421875, 0.277587890625, 0.04376220703125, 0.172119140625, 0.08477783203125, 0.130859375, 0.218505859375, 0.1826171875, 0.1434326171875, 0.050079345703125, 0.04144287109375, 0.223388671875, 0.16748046875, 0.0889892578125, 0.161376953125, 0.01321...

embed

23483849_c0

23483849

haskell

0

Title: Standard Haskell development environment as of 2014 Problem title: Standard Haskell development environment as of 2014 Tags: emacs, haskell Problem: Standard Haskell development environment as of 2014 This question might be duplicate of https://stackoverflow.com/questions/68504/what-are-my-ide-editor-choices-for...

Standard Haskell development environment as of 2014 Standard Haskell development environment as of 2014 emacs haskell Standard Haskell Standard Haskell development environment as of 2014 This question might be duplicate of https://stackoverflow.com/questions/68504/what-are-my-ide-editor-choices-for-haskell , but the an...

[ 0.00372314453125, -0.00115966796875, -0.0023040771484375, -0.002166748046875, -0.01031494140625, 0.033447265625, -0.01495361328125, -0.007598876953125, -0.003173828125, -0.021240234375, -0.002349853515625, -0.00958251953125, 0.00567626953125, -0.00031280517578125, 0.006805419921875, -0...

[ 20744, 20625, 142508, 34754, 65998, 237, 1049, 352, 2263, 7, 1556, 111, 171763, 118664, 124409, 1046, 1176, 2506, 175583, 3089, 2980, 2472, 10557, 4358, 169549, 31577, 33022, 10975, 678, 959, 3525, 9014, 97384, 1492, 75935, 103391, 5570, 8526...

[ 0.200927734375, 0.1790771484375, 0.26318359375, 0.1561279296875, 0.2119140625, 0.056671142578125, 0.2529296875, 0.09600830078125, 0.130126953125, 0.00732421875, 0.1328125, 0.0144805908203125, 0.009521484375, 0.03509521484375, 0.01629638671875, 0.014373779296875, 0.060394287109375, ...

embed

72067550_c0

72067550

haskell

0

Title: Where is Haskell's or GHC's main defined? Problem title: Where is Haskell's or GHC's main defined? Tags: language-lawyer, program-entry-point, standards, haskell Problem: Where is Haskell's or GHC's main defined? In Haskell, the execution of a compiled program starts with executing main in mo...

Where is Haskell's or GHC's main defined? Where is Haskell's or GHC's main defined? language-lawyer program-entry-point standards haskell Where Haskell GHC Main Where is Haskell's or GHC's main defined? In Haskell, the execution of a compiled program starts with executing main in module Main . This ...

[ 0.0244140625, 0.02783203125, 0.00830078125, 0.01361083984375, -0.0106201171875, 0.0087890625, 0.007537841796875, 0.00274658203125, -0.0196533203125, -0.020263671875, 0.000095367431640625, -0.0242919921875, -0.0150146484375, -0.0113525390625, 0.0196533203125, 0.005828857421875, 0.0123...

[ 78662, 83, 20625, 142508, 3768, 707, 527, 73265, 5201, 61924, 71, 32, 46876, 19729, 8889, 1528, 33, 15123, 38496, 5570, 1556, 12321, 25, 360, 71924, 1830, 10, 375, 5974, 4034, 7, 678, 214, 23, 88996, 3293, 32354, 8110, 10644, 17780, 910...

[ 0.1490478515625, 0.097412109375, 0.1981201171875, 0.316650390625, 0.08837890625, 0.0574951171875, 0.152099609375, 0.25634765625, 0.283447265625, 0.2493896484375, 0.1429443359375, 0.001922607421875, 0.0855712890625, 0.0765380859375, 0.046844482421875, 0.22314453125, 0.03857421875, 0...

embed

75018725_c1

75018725

haskell

1

.tar.xz.tmp", [ ... ] "https://downloads.haskell.org/~ghc/9.4.3/ghc-9.4.3-x86_64-unknown-mingw32.tar.xz"] failed with exit code 35. [ Error ] Also check the logs in C:\ghcup\logs This is what logs say: Debug: Identified Platform as: Windows Debug: last access was 9.7176814s ago, cache interval is 300s Debug: Decoding y...

[ 0.0038604736328125, 0.0255126953125, 0.025634765625, -0.01226806640625, 0.0028839111328125, -0.009521484375, -0.03173828125, -0.0125732421875, 0.01190185546875, 0.0322265625, 0.0125732421875, -0.0067138671875, -0.001190185546875, -0.002838134765625, 0.0031890869140625, -0.0007591247558...

[ 867, 425, 169, 18, 2676, 10114, 61754, 10557, 142508, 1478, 9486, 238, 22364, 158406, 15205, 15276, 13307, 309, 69723, 19, 14578, 434, 6460, 165523, 82230, 18151, 2273, 212059, 12765, 12684, 313, 33874, 4867, 5154, 262, 85779, 189543, 297, ...

[ 0.1871337890625, 0.06365966796875, 0.1348876953125, 0.034759521484375, 0.2103271484375, 0.00030517578125, 0.1907958984375, 0.124267578125, 0.275390625, 0.0802001953125, 0.14453125, 0.14208984375, 0.13427734375, 0.2724609375, 0.1656494140625, 0.21630859375, 0.19677734375, 0.06219482...

embed

4279627_c0

4279627

haskell

0

Title: Correct ReadP usage in Haskell Problem title: Correct ReadP usage in Haskell Tags: haskell, parsing Problem: Correct ReadP usage in Haskell I did a very simple parser for lists of numbers in a file, using ReadP in Haskell. It works, but it is very slow... is this normal behavior of this type of parser or am I do...

Correct ReadP usage in Haskell Correct ReadP usage in Haskell haskell parsing Text.ParserCombinators.ReadP qualified Data.Char Correct ReadP Haskell Data.IntSet IntSet IntSet.IntSet int_list sepBy1 IntSet.fromList many1 whole_file readP_to_S Correct ReadP usage in Haskell I did a very simple parser for lists of numbers...

[ -0.01251220703125, 0.00982666015625, 0.019775390625, 0.007568359375, -0.01141357421875, 0.018798828125, -0.002197265625, -0.0220947265625, -0.00194549560546875, -0.02587890625, 0.008544921875, -0.004180908203125, 0.01025390625, -0.0252685546875, -0.00982666015625, 0.00555419921875, -...

[ 46348, 15390, 4764, 683, 127689, 20625, 142508, 23, 1556, 366, 24129, 28636, 2189, 19155, 22230, 31345, 217225, 11809, 84068, 18, 294, 126, 6562, 25040, 75358, 161063, 154663, 5941, 418, 28271, 29822, 12301, 188, 4552, 8781, 100, 5303, 101935...

[ 0.149169921875, 0.06182861328125, 0.2117919921875, 0.2296142578125, 0.1624755859375, 0.1414794921875, 0.2274169921875, 0.00433349609375, 0.125, 0.1268310546875, 0.091552734375, 0.10321044921875, 0.129150390625, 0.1256103515625, 0.052520751953125, 0.1605224609375, 0.155517578125, 0....

embed

9524884_c0

9524884

haskell

0

Title: How to print data of Map as a table? Problem title: How to print data of Map as a table? Tags: haskell Problem: How to print data of Map as a table? I have a Map (Int, Int) a where a can be any type. Based on the Tuple2 stored in the array as key I wanna create a String table which stores the values of the map. ...

How to print data of Map as a table? How to print data of Map as a table? haskell How Map Array.ofDim table.rows How to print data of Map as a table? I have a Map (Int, Int) a where a can be any type. Based on the Tuple2 stored in the array as key I wanna create a String table which stores the values of the map. Becaus...

[ 0.0125732421875, -0.00897216796875, 0.004302978515625, 0.00052642822265625, -0.01434326171875, 0.000743865966796875, 0.006072998046875, 0.00176239013671875, 0.0034942626953125, 0.022216796875, -0.00101470947265625, -0.00970458984375, 0.01019287109375, 0.01190185546875, -0.00677490234375,...

[ 11249, 47, 28412, 2053, 111, 42719, 237, 10, 23180, 1556, 142508, 69253, 53, 4390, 397, 464, 15555, 4153, 18, 360, 831, 2499, 10644, 44978, 1371, 8705, 304, 4343, 10298, 22799, 6165, 28282, 23351, 214, 142424, 22288, 111340, 51529, 5117, ...

[ 0.09466552734375, 0.03497314453125, 0.2410888671875, 0.201416015625, 0.130615234375, 0.25244140625, 0.1590576171875, 0.099853515625, 0.259521484375, 0.111083984375, 0.2275390625, 0.09735107421875, 0.05902099609375, 0.15966796875, 0.08331298828125, 0.149658203125, 0.1500244140625, 0...

embed

67153496_c1

67153496

haskell

1

fits their description: "Currently it has * and k~>k as the only alternatives"). Thus, the (forall a::k1 . (t::k2)) formula means that if we take an inhabited type k1 , it can be mapped onto another k2 iff it is inhabited (due to Curry-Howard working for kinds the same way it works for types). Is that right? (P.S.: I s...

[ 0.00994873046875, 0.0009613037109375, 0.009033203125, -0.0181884765625, 0.01348876953125, -0.020751953125, -0.005767822265625, -0.0184326171875, 0.007232666015625, -0.01446533203125, 0.005157470703125, -0.01422119140625, -0.007598876953125, 0.0205078125, 0.002777099609375, -0.014465332...

[ 11177, 76811, 474, 15724, 1556, 661, 136, 472, 2306, 2740, 92, 4734, 30700, 5584, 10, 418, 5, 18, 10461, 26168, 26950, 2174, 5646, 23, 54815, 10644, 831, 291, 48398, 98, 188, 15700, 304, 32920, 17065, 1294, 11193, 19364, 20697, 8562, 43...

[ 0.0908203125, 0.068603515625, 0.007080078125, 0.05621337890625, 0.00634765625, 0.0684814453125, 0.0308837890625, 0.1119384765625, 0.016143798828125, 0.050811767578125, 0.12939453125, 0.094482421875, 0.1728515625, 0.0799560546875, 0.091064453125, 0.1441650390625, 0.02386474609375, 0...

embed

38252767_c0

38252767

haskell

0

Title: Haskell: Data Type error by parsing Problem title: Haskell: Data Type error by parsing Tags: haskell Problem: Haskell: Data Type error by parsing I have a string that I Need to parse to Array of Array or otherwise. This is the Code I have import Test.HUnit (runTestTT,Test(TestLabel,TestList),(~?=)) import qualif...

Haskell: Data Type error by parsing Haskell: Data Type error by parsing haskell Test.HUnit qualified Text.ParserCombinators.Parsec Text.Parsec.String Text.Parsec.Char Text.PrettyPrint.HughesPJ Data.Maybe Data.List.Split Haskell Data Type Test TestLabel TestList Text.Parsec CSV Row Show Parser Maybe P.runP Left Nothing ...

[ -0.0026092529296875, 0.00885009765625, 0.002349853515625, 0.040771484375, 0.002777099609375, 0.01434326171875, -0.01171875, -0.016845703125, -0.0096435546875, 0.0216064453125, -0.00506591796875, -0.0299072265625, 0.0189208984375, -0.01068115234375, -0.0089111328125, -0.0011520385742187...

[ 20625, 142508, 11809, 60457, 18499, 390, 366, 6953, 12, 1556, 8647, 27204, 6773, 217225, 24129, 28636, 2189, 19155, 22230, 39797, 71713, 84068, 19273, 15145, 112079, 18788, 78934, 154663, 5, 4353, 4063, 43486, 96190, 17367, 2392, 83425, 16428, ...

[ 0.1400146484375, 0.222412109375, 0.1224365234375, 0.2607421875, 0.18994140625, 0.0439453125, 0.1705322265625, 0.07763671875, 0.0169525146484375, 0.14453125, 0.1005859375, 0.047027587890625, 0.1197509765625, 0.140625, 0.0950927734375, 0.0999755859375, 0.10284423828125, 0.13134765625...

embed

26843529_c0

26843529

haskell

0

Title: Haskell Fibonacci Explanation Problem title: Haskell Fibonacci Explanation Tags: lazy-evaluation, thunk, haskell, functional-programming, fibonacci Problem: Haskell Fibonacci Explanation I am quite new to Haskell and I'm trying to wrap my head around how the lazy expression of Fibonacci sequences work. I know th...

Haskell Fibonacci Explanation Haskell Fibonacci Explanation lazy-evaluation thunk haskell functional-programming fibonacci Haskell Fibonacci Explanation Haskell Fibonacci Explanation I am quite new to Haskell and I'm trying to wrap my head around how the lazy expression of Fibonacci sequences work. I know this has been...

[ 0.01519775390625, 0.009765625, 0.0007476806640625, 0.009033203125, -0.00555419921875, 0.005828857421875, 0.0036163330078125, -0.004638671875, 0.00732421875, 0.004241943359375, 0.003326416015625, -0.000885009765625, -0.005523681640625, 0.0174560546875, 0.01275634765625, 0.01373291015625...

[ 20625, 142508, 3698, 20990, 52544, 5443, 5868, 21, 3285, 159258, 5675, 3678, 1556, 123309, 28966, 809, 32233, 3525, 10336, 125195, 40, 26513, 4488, 21176, 16750, 18151, 74413, 21533, 17368, 68330, 194583, 28219, 218500, 7, 6626, 5303, 25842, ...

[ 0.1435546875, 0.245361328125, 0.12158203125, 0.1514892578125, 0.183837890625, 0.015869140625, 0.114501953125, 0.1407470703125, 0.2071533203125, 0.1375732421875, 0.03253173828125, 0.194580078125, 0.1142578125, 0.094482421875, 0.0489501953125, 0.1768798828125, 0.007354736328125, 0.00...

embed

48139031_c0

48139031

haskell

0

Title: Is it possible to generate record fields in haskell? Problem title: Is it possible to generate record fields in haskell? Tags: template-haskell, haskell, code-generation, record Problem: Is it possible to generate record fields in haskell? Suppose I have a prefix p and list of strings ss . I would like to genera...

Is it possible to generate record fields in haskell? Is it possible to generate record fields in haskell? template-haskell haskell code-generation record Example field1 field2 prefixString1 Maybe prefixString2 prefixString3 Show field_1 field_2 field_1_x field_2_x field_1_y field_2_y Is it possible to generate record f...

[ -0.00927734375, 0.000766754150390625, -0.00732421875, -0.00135040283203125, -0.00787353515625, 0.00113677978515625, 0.00567626953125, -0.01177978515625, 0.0022735595703125, -0.0026397705078125, -0.003631591796875, -0.028076171875, 0.013916015625, -0.0181884765625, -0.0015411376953125, ...

[ 2071, 442, 7722, 47, 139392, 17164, 44457, 7, 23, 1556, 142508, 110934, 10557, 18151, 48281, 89536, 304, 183114, 71713, 83425, 363, 17367, 115187, 425, 53, 915, 5303, 79315, 91, 1884, 9351, 37223, 12638, 32562, 61687, 23282, 87, 959, 10002,...

[ 0.05902099609375, 0.05352783203125, 0.170166015625, 0.044647216796875, 0.233642578125, 0.25830078125, 0.282958984375, 0.0977783203125, 0.08502197265625, 0.158447265625, 0.2425537109375, 0.1629638671875, 0.122314453125, 0.1483154296875, 0.14599609375, 0.012420654296875, 0.026214599609...

embed

69969060_c0

69969060

haskell

0

Title: haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instance Problem title: haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instance Tags: hdbc, haskell, odbc, mysql Problem: haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instanc...

haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instance haskell `hdbc` ODBC connection gets disposed of immediately for remote MySQL instance hdbc haskell odbc mysql SqlError seNativeError ODBC MySQL Connecting Connected USE Done Tried Connection haskell `hdbc` ODBC connection gets dispose...

[ 0.005523681640625, 0.044921875, 0.0017852783203125, 0.00054931640625, 0.0213623046875, 0.0230712890625, -0.017822265625, -0.0294189453125, 0.00885009765625, -0.021728515625, 0.0308837890625, -0.0458984375, 0.01202392578125, -0.019775390625, -0.026611328125, -0.00579833984375, 0.00093...

[ 1556, 142508, 20257, 65037, 34687, 24318, 94878, 60458, 71, 111, 109312, 100, 148814, 157146, 110527, 26488, 229, 759, 99247, 18468, 40, 4645, 4935, 62448, 78441, 984, 86, 4699, 297, 62163, 31577, 37067, 63399, 11675, 80866, 41, 136, 2199, ...

[ 0.1260986328125, 0.2296142578125, 0.1097412109375, 0.18505859375, 0.1632080078125, 0.2354736328125, 0.2017822265625, 0.152587890625, 0.054656982421875, 0.0826416015625, 0.1732177734375, 0.0292510986328125, 0.1986083984375, 0.2015380859375, 0.1357421875, 0.125244140625, 0.114013671875...

embed

55907243_c1

55907243

haskell

1

to do this (such as writing to an IORef) would require it to have a reference to such an object. In the example I've tried using exceptions to communicate but they don't get caught, which I suspect is due to handle_input being called by a foreign library. If anyone can suggest how I might solve this (i.e. get an Int b...

[ -0.01507568359375, 0.0238037109375, -0.0234375, -0.0166015625, 0.00628662109375, 0.01348876953125, 0.0040283203125, -0.032470703125, -0.0057373046875, -0.004364013671875, -0.0026092529296875, -0.037109375, 0.00128936767578125, 0.00482177734375, -0.01177978515625, 0.0027923583984375, ...

[ 54, 903, 32562, 47, 123435, 4240, 64209, 91067, 6044, 36746, 27781, 37842, 17368, 131527, 6, 127219, 2301, 18, 156892, 92610, 34831, 73, 7077, 35839, 110613, 35773, 1294, 42459, 3642, 13648, 86869, 2046, 360, 4420, 1295, 11782, 12620, 26008, ...

[ 0.06201171875, 0.08135986328125, 0.1622314453125, 0.061676025390625, 0.125244140625, 0.2247314453125, 0.06524658203125, 0.204833984375, 0.04217529296875, 0.20751953125, 0.1123046875, 0.02996826171875, 0.0592041015625, 0.2646484375, 0.011322021484375, 0.1973876953125, 0.00927734375, ...

embed

37150564_c0

37150564

haskell

0

Title: Mapping a list to the product of the elements excluding the current index without using division Problem title: Mapping a list to the product of the elements excluding the current index without using division Tags: haskell, arrays Problem: Mapping a list to the product of the elements excluding the current index...

Mapping a list to the product of the elements excluding the current index without using division Mapping a list to the product of the elements excluding the current index without using division haskell arrays division Data.List Mapping foldl1 Mapping a list to the product of the elements excluding the current index wit...

[ -0.0458984375, 0.0294189453125, -0.01318359375, -0.01251220703125, -0.033447265625, -0.005340576171875, 0.005279541015625, 0.00732421875, 0.0185546875, -0.0302734375, -0.00531005859375, 0.0211181640625, 0.002838134765625, 0.00171661376953125, -0.00177764892578125, -0.006683349609375, ...

[ 911, 26783, 5303, 47, 12996, 80854, 39041, 6238, 43581, 63262, 15490, 17368, 91853, 1556, 142508, 10298, 4778, 11809, 154663, 18344, 20469, 418, 56785, 20625, 20697, 40899, 38953, 57877, 4390, 19305, 53, 3355, 19462, 39379, 19048, 54, 72546, ...

[ 0.19775390625, 0.109130859375, 0.2064208984375, 0.146484375, 0.255126953125, 0.179443359375, 0.19091796875, 0.075927734375, 0.1724853515625, 0.1806640625, 0.138427734375, 0.06561279296875, 0.258544921875, 0.1241455078125, 0.2354736328125, 0.1102294921875, 0.06317138671875, 0.061401...

embed

41260982_c0

41260982

haskell

0

Title: Reading from encrypted zips in Haskell using LibZip Problem title: Reading from encrypted zips in Haskell using LibZip Tags: encryption, haskell, zip, archive, libzip Problem: Reading from encrypted zips in Haskell using LibZip I try to open encrypted zip file and then to write it again. Unfortunately I keep get...

Reading from encrypted zips in Haskell using LibZip Reading from encrypted zips in Haskell using LibZip encryption haskell zip archive libzip encrypted LibZip Reading Haskell FilePath ZipSource CreateFlag mapM_ Password CheckConsFlag protected_file2.zip unprotected.zip Reading from encrypted zips in Haskell using LibZi...

[ 0.0040283203125, -0.01300048828125, -0.01007080078125, -0.000021338462829589844, -0.0145263671875, -0.0186767578125, -0.0035858154296875, -0.00021076202392578125, 0.005096435546875, -0.00238037109375, 0.01007080078125, 0.0042724609375, 0.0067138671875, 0.038330078125, -0.0006675720214843...

[ 104951, 1295, 22, 136791, 68330, 20625, 142508, 17368, 43278, 1511, 3442, 7, 1556, 147488, 25474, 50836, 42724, 10519, 162150, 211235, 151313, 3668, 22288, 594, 170461, 38679, 11935, 30312, 29822, 5442, 51, 208202, 9790, 9803, 11435, 33022, 134...

[ 0.2008056640625, 0.0914306640625, 0.045257568359375, 0.2294921875, 0.2105712890625, 0.12744140625, 0.253173828125, 0.01153564453125, 0.1729736328125, 0.154541015625, 0.1993408203125, 0.015045166015625, 0.1103515625, 0.096923828125, 0.094970703125, 0.1861572265625, 0.03814697265625, ...

embed

19946446_c0

19946446

haskell

0

Title: Generating random vectors with constant stack space Problem title: Generating random vectors with constant stack space Tags: lazy-evaluation, haskell, monads, stack-overflow Problem: Generating random vectors with constant stack space I'm working with the packages System.Random.Mersenne.Pure64 and Control.Monad....

Generating random vectors with constant stack space Generating random vectors with constant stack space lazy-evaluation haskell monads stack-overflow qualified Data.Int System.Random.Mersenne.Pure64 Control.Monad.Mersenne.Random Generating Data.Vector.Unboxed U.replicateM getInt64 U.Vector Int64 U.head Generating rando...

[ -0.0084228515625, 0.03173828125, 0.005218505859375, -0.0135498046875, 0.0098876953125, -0.00518798828125, -0.001617431640625, -0.040771484375, -0.000965118408203125, -0.07470703125, 0.0081787109375, 0.00799560546875, 0.012939453125, -0.00005173683166503906, 0.01409912109375, -0.0046081...

[ 155370, 96759, 22834, 22230, 678, 53697, 177261, 32628, 21, 3285, 159258, 1556, 142508, 2667, 712, 5465, 118664, 217225, 11809, 18, 12353, 126525, 3815, 30248, 1015, 86, 3408, 13307, 27131, 46674, 26455, 18770, 11728, 345, 52721, 67, 594, 312...

[ 0.145751953125, 0.1700439453125, 0.2198486328125, 0.1539306640625, 0.0270843505859375, 0.2022705078125, 0.201904296875, 0.206787109375, 0.05810546875, 0.1298828125, 0.1231689453125, 0.059478759765625, 0.1943359375, 0.07550048828125, 0.11376953125, 0.07476806640625, 0.2410888671875, ...

embed

720517_c0

720517

haskell

0

Title: Contrasting C# generics with Haskell parameterized types Problem title: Contrasting C# generics with Haskell parameterized types Tags: c%23, type-systems, polymorphism, haskell, generics Problem: Contrasting C# generics with Haskell parameterized types Based on some advice I found on StackOverflow, I'm digging i...

Contrasting C# generics with Haskell parameterized types Contrasting C# generics with Haskell parameterized types c%23 type-systems polymorphism haskell generics Contrasting Haskell Contrasting C# generics with Haskell parameterized types Based on some advice I found on StackOverflow, I'm digging into Haskell. I was pl...

[ -0.00616455078125, 0.024169921875, 0.00714111328125, -0.00075531005859375, 0.000812530517578125, 0.001190185546875, -0.009765625, -0.00836181640625, 0.004425048828125, 0.003997802734375, -0.0135498046875, -0.04345703125, 0.005218505859375, 0.0067138671875, -0.015625, -0.00787353515625,...

[ 45380, 7, 1916, 313, 4904, 189534, 678, 20625, 142508, 171859, 29367, 52895, 3742, 10644, 16751, 35874, 178851, 1556, 67660, 156673, 118664, 174849, 68991, 1884, 149766, 46876, 115992, 11001, 31330, 15044, 76465, 161740, 8561, 11969, 5222, 23755,...

[ 0.1510009765625, 0.09039306640625, 0.0157470703125, 0.024169921875, 0.2020263671875, 0.208740234375, 0.05340576171875, 0.1513671875, 0.242919921875, 0.21923828125, 0.10595703125, 0.2056884765625, 0.09619140625, 0.189453125, 0.1126708984375, 0.07781982421875, 0.173095703125, 0.10260...

embed

45905951_c0

45905951

haskell

0

Title: Hakyll: enabling pandoc extensions? Problem title: Hakyll: enabling pandoc extensions? Tags: pandoc, haskell, hakyll Problem: Hakyll: enabling pandoc extensions? I wanted to enable the Ext_autolink_bare_uris pandoc extension for Hakyll posts. I followed the instructions given here , and everything seems to be wo...

Hakyll: enabling pandoc extensions? Hakyll: enabling pandoc extensions? pandoc haskell hakyll qualified Text.Pandoc.Options Hakyll site.hs Data.Set Compiler Item Ext_autolink_bare_uris S.insert Hakyll: enabling pandoc extensions? I wanted to enable the Ext_autolink_bare_uris pandoc extension for Hakyll posts. I followe...

[ 0.0019989013671875, 0.013427734375, 0.02783203125, 0.003997802734375, -0.01202392578125, -0.004547119140625, -0.01458740234375, -0.006439208984375, -0.0098876953125, -0.0306396484375, -0.0068359375, -0.0086669921875, 0.01953125, -0.010986328125, -0.0029296875, -0.0014495849609375, 0....

[ 23493, 53, 1181, 22, 11, 79298, 2652, 29713, 111938, 7, 1556, 142508, 256, 1002, 217225, 24129, 55956, 39029, 1764, 127, 11809, 15612, 34759, 78426, 5443, 18, 8913, 10187, 9837, 62210, 159, 33657, 36663, 2886, 32323, 134629, 167934, 26818, ...

[ 0.1796875, 0.1663818359375, 0.210205078125, 0.06494140625, 0.063232421875, 0.112548828125, 0.1431884765625, 0.2161865234375, 0.256103515625, 0.0231170654296875, 0.1011962890625, 0.1658935546875, 0.1024169921875, 0.1676025390625, 0.150146484375, 0.0645751953125, 0.086181640625, 0.11...

embed

48286026_c1

48286026

haskell

1

(remocollatz x)) + 1 collatzPairs :: Integral a => a -> [(a, Int)] collatzPairs n = zip [1..n] (collatzLength <$> [1..n]) longestCollatz :: Integral a => a -> (a, Int) longestCollatz n = maximumBy order $ collatzPairs n where order :: Ord b => (a, b) -> (a, b) -> Ordering order x y = snd x `compare` snd y main :: IO (...

[ -0.0113525390625, -0.00142669677734375, -0.00531005859375, 0.0022430419921875, 0.004486083984375, 0.005615234375, 0.00017261505126953125, -0.00482177734375, 0.0260009765625, -0.044677734375, 0.0172119140625, 0.01251220703125, 0.016357421875, 0.0208740234375, 0.0184326171875, -0.0034942...

[ 26973, 181989, 9136, 1022, 997, 106, 65780, 8335, 481, 1984, 204681, 10, 33079, 360, 18, 653, 2203, 68330, 19, 449, 4989, 525, 78457, 2335, 169, 38132, 12989, 35379, 876, 81206, 16082, 2208, 113, 5201, 17780, 28412, 3650, 13267, 31380, 23...

[ 0.1978759765625, 0.1546630859375, 0.2369384765625, 0.1358642578125, 0.1220703125, 0.050933837890625, 0.1864013671875, 0.1492919921875, 0.1400146484375, 0.039947509765625, 0.2266845703125, 0.054443359375, 0.028839111328125, 0.0216827392578125, 0.0625, 0.0733642578125, 0.00326538085937...

embed

51384015_c0

51384015

haskell

0

Title: Check type signature of inputted value and compare part of values Problem title: Check type signature of inputted value and compare part of values Tags: haskell Problem: Check type signature of inputted value and compare part of values If I was to use '( ) <- getLine', how would I check the type signature of the...

Check type signature of inputted value and compare part of values Check type signature of inputted value and compare part of values haskell Check They Check type signature of inputted value and compare part of values If I was to use '( ) <- getLine', how would I check the type signature of the value on output through a...

[ -0.013916015625, -0.0045166015625, -0.018798828125, 0.042724609375, -0.0084228515625, -0.000896453857421875, 0.006561279296875, 0.0020751953125, -0.0035552978515625, 0.0205078125, -0.0057373046875, 0.01116943359375, -0.00072479248046875, 0.01202392578125, -0.02197265625, -0.00643920898...

[ 38679, 10644, 138256, 111, 107730, 3674, 34292, 69101, 2831, 142424, 1556, 142508, 10660, 4527, 132, 2046, 93232, 12765, 140992, 3884, 71713, 866, 19, 28412, 2565, 2606, 3630, 32354, 67688, 11249, 2806, 6626, 79315, 30957, 62, 1530, 96060, 13...

[ 0.183837890625, 0.2364501953125, 0.24072265625, 0.06494140625, 0.1248779296875, 0.04864501953125, 0.1552734375, 0.207275390625, 0.07464599609375, 0.1507568359375, 0.1151123046875, 0.2061767578125, 0.097900390625, 0.00927734375, 0.00958251953125, 0.0870361328125, 0.17529296875, 0.19...

embed

67355210_c0

67355210

haskell

0

Title: How to fix this Haskell lookup function type mismatch? Problem title: How to fix this Haskell lookup function type mismatch? Tags: lookup, haskell, function, algebraic-data-types, type-mismatch Problem: How to fix this Haskell lookup function type mismatch? If someone could lend a hand fixing this error, it woul...

How to fix this Haskell lookup function type mismatch? How to fix this Haskell lookup function type mismatch? lookup haskell function algebraic-data-types type-mismatch How Haskell Name Coordinates Pop TotalPop City York Washingotn Los Angeles Couldn Maybe How to fix this Haskell lookup function type mismatch? If someo...

[ -0.0045166015625, -0.00421142578125, 0.0128173828125, 0.0206298828125, -0.00421142578125, -0.0024261474609375, 0.005828857421875, 0.0234375, 0.0064697265625, 0.0030059814453125, 0.01220703125, -0.01031494140625, -0.01141357421875, -0.0272216796875, 0.00531005859375, -0.0240478515625, ...

[ 11249, 47, 30022, 903, 20625, 142508, 6713, 2037, 32354, 10644, 1239, 98753, 1556, 144, 429, 2844, 10135, 50986, 2179, 15757, 1311, 43297, 11584, 33867, 127642, 6406, 5753, 5282, 33059, 818, 19, 3731, 31754, 191147, 83425, 22008, 5809, 50771,...

[ 0.0765380859375, 0.0298919677734375, 0.1844482421875, 0.103759765625, 0.166748046875, 0.28515625, 0.13134765625, 0.1505126953125, 0.1728515625, 0.2276611328125, 0.1461181640625, 0.2880859375, 0.156005859375, 0.0140380859375, 0.0689697265625, 0.1072998046875, 0.1097412109375, 0.2249...

embed

61761223_c0

61761223

haskell

0

Title: Haskell HUnit Function Testing Problem title: Haskell HUnit Function Testing Tags: haskell, hunit, visual-studio-code Problem: Haskell HUnit Function Testing I'm trying to set up a series of tests for a simple tic tac toe program I've written in Haskell and I'm unable to get past my first test due to a strange e...

Haskell HUnit Function Testing Haskell HUnit Function Testing haskell hunit visual-studio-code Haskell HUnit Testing Tests.hs:11:61 Couldn test_user_value TestCase test1 Failed Haskell HUnit Function Testing I'm trying to set up a series of tests for a simple tic tac toe program I've written in Haskell and I'm unable t...

[ 0.000156402587890625, -0.009033203125, -0.00787353515625, -0.00555419921875, -0.003387451171875, -0.00390625, -0.00015735626220703125, -0.0027313232421875, -0.0027618408203125, 0.017333984375, 0.00384521484375, -0.01202392578125, -0.00130462646484375, 0.003448486328125, 0.0128173828125, ...

[ 20625, 142508, 22438, 6773, 28670, 8647, 1556, 1926, 217, 21176, 52629, 40899, 127, 11540, 191147, 19, 3034, 65918, 27494, 441, 6991, 418, 190355, 10763, 31577, 5423, 36549, 109921, 8781, 96212, 36322, 4375, 1528, 59121, 51, 2886, 11015, 5117...

[ 0.150390625, 0.240478515625, 0.1480712890625, 0.2666015625, 0.150390625, 0.20361328125, 0.1241455078125, 0.1416015625, 0.1773681640625, 0.1490478515625, 0.1148681640625, 0.06524658203125, 0.00421142578125, 0.037841796875, 0.08282470703125, 0.011932373046875, 0.2069091796875, 0.1699...

embed

10464764_c0

10464764

haskell

0

Title: Custom Ord instance hangs on lists Problem title: Custom Ord instance hangs on lists Tags: haskell, typeclass Problem: Custom Ord instance hangs on lists import Data.Function (on) import Data.List (sort) data Monomial = Monomial { m_coeff :: Coefficient , m_powers :: [(Variable, Power)] } deriving () instance Or...

Custom Ord instance hangs on lists Custom Ord instance hangs on lists haskell typeclass Data.Function Data.List Custom Ord Monomial m_coeff Coefficient m_powers Variable Power Main Computation Custom Ord instance hangs on lists That's an excerpt from my code, cut down to principal size. Let's try comparing: On a side n...

[ -0.01397705078125, 0.003753662109375, 0.00836181640625, -0.0025634765625, -0.003692626953125, 0.0166015625, 0.0159912109375, -0.0184326171875, 0.01226806640625, -0.01287841796875, 0.01263427734375, 0.002471923828125, 0.0145263671875, -0.01239013671875, -0.009033203125, -0.0093383789062...

[ 130664, 35379, 110527, 10756, 98, 5303, 1556, 142508, 10644, 67413, 11809, 97249, 154663, 77879, 266, 289, 347, 68053, 62783, 84572, 17170, 12321, 159415, 18151, 7893, 9790, 37397, 49041, 91995, 91, 64, 2740, 1369, 177, 21635, 1221, 959, 809,...

[ 0.227783203125, 0.249267578125, 0.25537109375, 0.2144775390625, 0.10601806640625, 0.2061767578125, 0.09814453125, 0.2142333984375, 0.06512451171875, 0.1588134765625, 0.038543701171875, 0.03515625, 0.1063232421875, 0.04998779296875, 0.090576171875, 0.00927734375, 0.04058837890625, 0...

embed

15537100_c0

15537100

haskell

0

Title: HW: Unfolding a list in a specific way Problem title: HW: Unfolding a list in a specific way Tags: haskell, functional-programming, unfold Problem: HW: Unfolding a list in a specific way In Programming in Haskell, Graham Hutton defines an unfold for lists as follows: unfold :: (b -> Bool ) -> (b -> a) -> (b -> b...

HW: Unfolding a list in a specific way HW: Unfolding a list in a specific way haskell functional-programming unfold Unfolding Bool Nothing Just x:xs HW: Unfolding a list in a specific way In Programming in Haskell, Graham Hutton defines an unfold for lists as follows: Define a function that is similar to the one above ...

[ -0.00335693359375, 0.0152587890625, 0.021240234375, 0.008056640625, 0.00008153915405273438, 0.0206298828125, -0.014892578125, -0.002532958984375, 0.01263427734375, 0.006378173828125, -0.005889892578125, -0.0277099609375, 0.0115966796875, 0.0172119140625, -0.0203857421875, 0.01684570312...

[ 572, 1456, 992, 42822, 5303, 29458, 3917, 1556, 142508, 123309, 28966, 51, 2460, 929, 182747, 9563, 1022, 12, 425, 214, 27958, 20625, 147756, 97595, 1507, 61924, 142, 100, 262, 64552, 32354, 21373, 36917, 4527, 42, 208124, 351, 48650, 31577...

[ 0.059112548828125, 0.1068115234375, 0.116455078125, 0.276611328125, 0.2298583984375, 0.1409912109375, 0.0777587890625, 0.0965576171875, 0.209716796875, 0.1370849609375, 0.084228515625, 0.1273193359375, 0.061126708984375, 0.1260986328125, 0.134521484375, 0.0782470703125, 0.11743164062...

embed

5337419_c0

5337419

haskell

0

Title: Debugging infinite loops in Haskell programs with GHCi Problem title: Debugging infinite loops in Haskell programs with GHCi Tags: infinite-loop, haskell, ghci, ghc, debugging Problem: Debugging infinite loops in Haskell programs with GHCi For the first time I've encountered an infinite loop in a Haskell program...

Debugging infinite loops in Haskell programs with GHCi Debugging infinite loops in Haskell programs with GHCi infinite-loop haskell ghci ghc debugging Debugging Haskell GHCi Data.Map.Map Debugging infinite loops in Haskell programs with GHCi For the first time I've encountered an infinite loop in a Haskell program I'm ...

[ -0.007659912109375, 0.003875732421875, 0.02197265625, 0.015380859375, 0.00634765625, 0.00064849853515625, -0.0002613067626953125, 0.002349853515625, 0.0062255859375, -0.04541015625, 0.025390625, -0.0191650390625, 0.0078125, 0.01446533203125, 0.038330078125, 0.024169921875, 0.01495361...

[ 262, 978, 36659, 54241, 13, 40956, 7, 20625, 142508, 103391, 527, 73265, 14, 678, 28354, 1556, 31380, 318, 238, 8, 11809, 166179, 5117, 1733, 190647, 1528, 32562, 40059, 18151, 53418, 38496, 351, 30524, 26518, 195625, 5844, 80934, 16031, 39...

[ 0.112548828125, 0.22119140625, 0.02142333984375, 0.1793212890625, 0.0894775390625, 0.2252197265625, 0.05743408203125, 0.110595703125, 0.2083740234375, 0.10601806640625, 0.056610107421875, 0.124267578125, 0.158447265625, 0.00189208984375, 0.18603515625, 0.0693359375, 0.05706787109375,...

embed

9658268_c0

9658268

haskell

0

Title: Concat parse results Problem title: Concat parse results Tags: haskell, parsec Problem: Concat parse results I can create a parser which can handle two or three numbers, separated by comma, like this: number :: Parser Int number = many1 digit >>= return . read <?> "number" numbers = do n1 <- number n2 <- char ':...

Concat parse results Concat parse results haskell parsec Concat Parser many1 Option input.parseAs None Some Concat parse results I can create a parser which can handle two or three numbers, separated by comma, like this: Only the numbers are important, the rest can be discarded. Is there a way to concatenate the interm...

[ 0.00994873046875, -0.00830078125, -0.00885009765625, 0.024169921875, 0.001434326171875, 0.00439453125, -0.005615234375, -0.019287109375, 0.01123046875, -0.0011749267578125, -0.01611328125, -0.009521484375, 0.018310546875, 0.0194091796875, -0.0079345703125, -0.00139617919921875, -0.01...

[ 1657, 4460, 366, 184, 50339, 1556, 142508, 39797, 2392, 2189, 5941, 418, 86769, 107730, 2500, 19659, 438, 831, 28282, 34831, 6626, 17262, 101935, 84797, 390, 96117, 87293, 5526, 10588, 17116, 5861, 10, 3917, 158, 33478, 76, 67, 81814, 2182,...

[ 0.14697265625, 0.271240234375, 0.175048828125, 0.1199951171875, 0.1842041015625, 0.0960693359375, 0.2083740234375, 0.2244873046875, 0.169677734375, 0.1866455078125, 0.113525390625, 0.0215911865234375, 0.135498046875, 0.1568603515625, 0.1480712890625, 0.0313720703125, 0.047607421875, ...

embed

10658480_c0

10658480

haskell

0

Title: Ambiguous type variable `f0' in the constraint: Haskell Problem title: Ambiguous type variable `f0' in the constraint: Haskell Tags: haskell Problem: Ambiguous type variable `f0' in the constraint: Haskell Note: there may be some typos (capitals etc) as my wireless card has broken on my computer and I ...

Ambiguous type variable `f0' in the constraint: Haskell Ambiguous type variable `f0' in the constraint: Haskell haskell a Ambiguous Haskell Config Line Nums Indent Run Show Result Test Probable Ambiguous type variable `f0' in the constraint: Haskell Note: there may be some typos (capitals etc) as my wireless ...

[ -0.0218505859375, -0.00823974609375, -0.017333984375, 0.01239013671875, 0.0079345703125, -0.01287841796875, -0.006195068359375, -0.00017547607421875, -0.00022220611572265625, 0.00927734375, -0.007720947265625, -0.0167236328125, -0.0106201171875, 0.002716064453125, 0.004486083984375, -0...

[ 10250, 12282, 10821, 10644, 77336, 420, 2389, 3768, 158, 2816, 4288, 20625, 142508, 1556, 139403, 177, 16777, 52782, 37379, 28398, 17367, 126684, 8647, 1250, 275, 23, 11417, 232, 215652, 135051, 20596, 148431, 13909, 45767, 20600, 456, 46280, ...

[ 0.1380615234375, 0.1890869140625, 0.07489013671875, 0.1536865234375, 0.2388916015625, 0.07568359375, 0.16748046875, 0.1148681640625, 0.051116943359375, 0.1427001953125, 0.09295654296875, 0.134765625, 0.25439453125, 0.1290283203125, 0.2095947265625, 0.08026123046875, 0.1148681640625, ...

embed

13747447_c1

13747447

haskell

1

Parser {getDParser :: Parser e t MaybeT a} instance Monad (DParser e t) where return = DParser . return (DParser d) >>= f = DParser (d >>= (getDParser . f)) instance MonadPlus (DParser e t) where mzero = DParser (StateT (const (MaybeT (Right Nothing)))) mplus = undefined -- will worry about later instance MonadState [t...

[ -0.013671875, 0.00860595703125, 0.0115966796875, -0.0009613037109375, 0.006744384765625, 0.02099609375, -0.0179443359375, -0.01287841796875, -0.007598876953125, -0.005340576171875, 0.007598876953125, 0.0164794921875, 0.0021820068359375, 0.0016937255859375, -0.00811767578125, 0.02136230...

[ 2392, 2189, 3794, 28399, 147, 1984, 28, 808, 83425, 618, 10, 8152, 110527, 60331, 71, 15, 7440, 30646, 2203, 72445, 104, 1238, 88225, 347, 80510, 135206, 25553, 82419, 372, 1052, 22553, 182747, 32108, 9232, 5983, 1221, 90908, 14432, 13, 1...

[ 0.2496337890625, 0.296630859375, 0.1414794921875, 0.05364990234375, 0.1806640625, 0.0258026123046875, 0.12890625, 0.1441650390625, 0.20263671875, 0.1373291015625, 0.130615234375, 0.0008544921875, 0.27197265625, 0.21826171875, 0.2088623046875, 0.0164947509765625, 0.0215606689453125, ...

embed

14670205_c0

14670205

haskell

0

Title: Irrefutable pattern failed inside of Let statement Problem title: Irrefutable pattern failed inside of Let statement Tags: haskell, design-patterns, let Problem: Irrefutable pattern failed inside of Let statement I'm learning haskell and am currently trying to parse Integers and Floats from strings. However, whe...

Irrefutable pattern failed inside of Let statement Irrefutable pattern failed inside of Let statement haskell design-patterns let Irrefutable Token IntTok FloatTok Float EOF a:as b:c:bs i::Int Irrefutable pattern failed inside of Let statement I'm learning haskell and am currently trying to parse Integers and Floats fr...

[ -0.0205078125, 0.020263671875, 0.00095367431640625, 0.01507568359375, 0.0035400390625, 0.0130615234375, -0.006683349609375, -0.0267333984375, -0.004119873046875, 0.000675201416015625, -0.0135498046875, 0.00775146484375, -0.002838134765625, 0.0028076171875, 0.02880859375, -0.01348876953...

[ 6921, 107, 3125, 22819, 103510, 165523, 46132, 10842, 63805, 1556, 142508, 4331, 4453, 22766, 2633, 717, 1098, 618, 685, 38699, 257, 241, 82341, 162, 876, 16145, 17, 18, 52080, 366, 44401, 136, 9821, 1295, 79315, 31577, 12301, 839, 316, 3...

[ 0.020477294921875, 0.052642822265625, 0.13330078125, 0.10662841796875, 0.2322998046875, 0.1864013671875, 0.126953125, 0.2159423828125, 0.1607666015625, 0.102294921875, 0.1885986328125, 0.1480712890625, 0.1162109375, 0.09393310546875, 0.0860595703125, 0.045135498046875, 0.123657226562...

embed

18929369_c0

18929369

haskell

0

Title: Yesod Forms or JSON/Ajax or Other Problem title: Yesod Forms or JSON/Ajax or Other Tags: yesod, haskell, aeson Problem: Yesod Forms or JSON/Ajax or Other I'm writing a CRUD interface for my Yesod-based site, but I'm having a problem with some values. In particular, I am trying to CRUD on values like: data Value ...

Yesod Forms or JSON/Ajax or Other Yesod Forms or JSON/Ajax or Other yesod haskell aeson Yesod Forms JSON Ajax Other Value UUID Stuff Nothing Yesod Forms or JSON/Ajax or Other I'm writing a CRUD interface for my Yesod-based site, but I'm having a problem with some values. In particular, I am trying to CRUD on values lik...

[ -0.009033203125, 0.0262451171875, -0.00958251953125, -0.0152587890625, -0.00665283203125, -0.003631591796875, 0.00927734375, -0.01226806640625, -0.013671875, -0.04541015625, 0.0157470703125, -0.006744384765625, -0.021240234375, -0.01031494140625, 0.00421142578125, -0.00872802734375, ...

[ 32635, 2199, 15236, 7, 707, 821, 58627, 284, 145, 425, 64511, 2422, 23722, 1556, 142508, 10, 90, 191, 157715, 190060, 91916, 7146, 2907, 21493, 182747, 64, 32562, 25109, 26119, 101758, 77007, 1764, 19441, 2967, 142424, 31577, 98, 1884, 6313...

[ 0.19873046875, 0.268798828125, 0.268798828125, 0.0341796875, 0.04248046875, 0.142822265625, 0.2320556640625, 0.057373046875, 0.122802734375, 0.1695556640625, 0.1043701171875, 0.152587890625, 0.236572265625, 0.1134033203125, 0.2088623046875, 0.0718994140625, 0.117431640625, 0.189331...

embed

65919503_c1

65919503

haskell

1

this has left me really confused because in this case, the program doesn't stop. The other possible issue could be down to my representation of if-statements. data HVal = HInteger Integer | HBool Bool | HString String | HList [HVal] | Length HVal | Arith HVal Op HVal | Assign String HVal deriving (Eq, Read) data HStat...

[ -0.01409912109375, 0.01043701171875, 0.002838134765625, 0.022705078125, -0.0024871826171875, 0.0142822265625, 0.0086669921875, -0.00994873046875, 0.0074462890625, 0.004302978515625, -0.025146484375, -0.002716064453125, -0.027587890625, -0.0108642578125, -0.002349853515625, 0.0158691406...

[ 903, 1556, 25737, 163, 6183, 55681, 5281, 7225, 70, 1528, 22027, 18, 7279, 7722, 31089, 5809, 7565, 759, 18811, 2174, 61340, 9035, 2053, 572, 42272, 2203, 35848, 1479, 1505, 44401, 12647, 929, 2460, 39718, 2852, 23351, 214, 154663, 101422, ...

[ 0.0906982421875, 0.06292724609375, 0.089599609375, 0.048675537109375, 0.0660400390625, 0.1529541015625, 0.109619140625, 0.045501708984375, 0.032318115234375, 0.2181396484375, 0.09332275390625, 0.0699462890625, 0.2093505859375, 0.06903076171875, 0.122802734375, 0.0234527587890625, 0.0...

embed

62732941_c1

62732941

haskell

1

al library is in the ghc package set.. ok but the thing is, the version of Nixpkgs I am using above (i.e. the one pinned in the following JSON) ... { "url": "https://github.com/nixos/nixpkgs.git", "rev": "6cf0ed0c04fb3aa7f81b46d0c90bae6457964b3f", "date": "2020-07-02T07:24:47+02:00", "path": "/nix/store/gkilcm4l6qsp31l...

up in my GHC packages inside a nix shell? I have a problem which boils down to this simplified example. Say I have the following shell.nix file: this is just a dummy derivation. I fire off 'nix-shell' and inside the shell: So version 3.0.1.0 of the Cabal library is in the ghc package set.. ok but the thing is, the ver...

[ -0.00150299072265625, -0.0147705078125, 0.0216064453125, 0.002105712890625, 0.00213623046875, 0.0140380859375, -0.0086669921875, 0.004608154296875, 0.01055908203125, 0.005950927734375, -0.0032196044921875, -0.052001953125, 0.0130615234375, -0.00103759765625, 0.0068359375, -0.0055236816...

[ 1257, 23, 527, 73265, 98169, 46132, 300, 425, 128019, 2967, 112892, 27781, 93, 11435, 8473, 1176, 30057, 1363, 11476, 5773, 11389, 17596, 102107, 30438, 289, 35773, 1294, 31380, 238, 5423, 1520, 38988, 9405, 36917, 6520, 25632, 821, 58627, ...

[ 0.1656494140625, 0.035736083984375, 0.072998046875, 0.17529296875, 0.171630859375, 0.148193359375, 0.094970703125, 0.1304931640625, 0.204345703125, 0.0762939453125, 0.03338623046875, 0.04779052734375, 0.1005859375, 0.1246337890625, 0.1253662109375, 0.1107177734375, 0.154296875, 0.0...

embed

19768657_c0

19768657

haskell

0

Title: Can't catch "Prelude.read: no parse" exception with Control.Exception.try Problem title: Can't catch "Prelude.read: no parse" exception with Control.Exception.try Tags: haskell Problem: Can't catch "Prelude.read: no parse" exception with Control.Exception.try I trying to read some v...

Can't catch "Prelude.read: no parse" exception with Control.Exception.try Can't catch "Prelude.read: no parse" exception with Control.Exception.try haskell Control.Exception SomeException Can Prelude.read Control.Exception.try Either Left Right Exception Can't catch "Prelude.read: no parse...

[ -0.0037689208984375, 0.01544189453125, -0.007171630859375, 0.0057373046875, 0.0079345703125, 0.01556396484375, -0.0003223419189453125, -0.018798828125, 0.0081787109375, -0.0211181640625, 0.000965118408203125, -0.0311279296875, -0.00148773193359375, 0.0003414154052734375, 0.026611328125, ...

[ 4171, 3768, 105556, 19273, 822, 112, 39116, 110, 366, 184, 131527, 678, 27131, 63928, 15123, 1556, 142508, 19279, 31384, 1914, 9319, 636, 2480, 90911, 5443, 18, 12, 31577, 12301, 34292, 1810, 11435, 11907, 13648, 74918, 1544, 56, 26458, 100...

[ 0.029632568359375, 0.040740966796875, 0.169921875, 0.0986328125, 0.1812744140625, 0.1097412109375, 0.2216796875, 0.1251220703125, 0.1871337890625, 0.132568359375, 0.2205810546875, 0.044281005859375, 0.223388671875, 0.1893310546875, 0.1497802734375, 0.0889892578125, 0.1929931640625, ...

embed

72014079_c0

72014079

haskell

0

Title: How to render diagrams in gi-gtk? Problem title: How to render diagrams in gi-gtk? Tags: gtk, haskell, gtk2hs, gtk3 Problem: How to render diagrams in gi-gtk? I want to render a diagram on top of a GUI written with gi-gtk . I tryed to use the defaultRender function from the Diagrams.Backend.Gtk but the compiler ...

How to render diagrams in gi-gtk? How to render diagrams in gi-gtk? gtk haskell gtk2hs gtk3 How Diagrams.Backend.Gtk Couldn gtk-0.15.5:Graphics.UI.Gtk.Types.DrawingArea Gtk.DrawingArea GI.Gtk.Objects.DrawingArea gi-gtk-3.0.36 Graphics.UI.Gtk.Types gtk-0.15.5 gtk2hs gtk3 How to render diagrams in gi-gtk? I want to rende...

[ -0.0250244140625, 0.0211181640625, 0.01312255859375, -0.006072998046875, -0.00494384765625, -0.004150390625, -0.00799560546875, 0.0010528564453125, -0.006622314453125, -0.0177001953125, -0.01025390625, -0.039794921875, 0.005462646484375, -0.0120849609375, -0.008544921875, 0.00680541992...

[ 11249, 47, 89159, 117233, 7, 23, 3016, 9, 5386, 92, 706, 31472, 1556, 142508, 304, 127, 363, 4512, 25561, 152470, 3611, 724, 191147, 102014, 148462, 37878, 19379, 33457, 196707, 219, 14775, 1283, 42887, 75161, 132265, 8659, 189682, 3444, 26...

[ 0.06549072265625, 0.047454833984375, 0.223876953125, 0.26171875, 0.07147216796875, 0.0806884765625, 0.216064453125, 0.0462646484375, 0.1387939453125, 0.143798828125, 0.0321044921875, 0.160400390625, 0.05584716796875, 0.1737060546875, 0.04351806640625, 0.034027099609375, 0.07781982421...

embed

72124976_c0

72124976

haskell

0

Title: Why isn't (b) of (a -> (b -> c)) the first parameter in the function definition but the second in type signature? Problem title: Why isn't (b) of (a -> (b -> c)) the first parameter in the function definition but the second in type signature? Tags: type-signature, haskell, currying Problem:...

Why isn't (b) of (a -> (b -> c)) the first parameter in the function definition but the second in type signature? Why isn't (b) of (a -> (b -> c)) the first parameter in the function definition but the second in type signature? type-signature haskell currying Why Why isn't (b) of (a -> (b -> c)) t...

[ 0.00958251953125, -0.00112152099609375, 0.0004291534423828125, 0.01116943359375, -0.021240234375, 0.01434326171875, 0.003173828125, -0.0213623046875, 0.00933837890625, 0.0023040771484375, 0.00836181640625, -0.0174560546875, -0.0164794921875, -0.0093994140625, 0, -0.00885009765625, 0....

[ 44084, 56112, 3768, 18, 275, 111, 11, 20, 1230, 5386, 501, 5117, 171859, 32354, 80934, 17932, 10644, 138256, 1284, 137432, 1556, 142508, 198555, 214, 33079, 39958, 38415, 25737, 45388, 45023, 16750, 82449, 183234, 5701, 7108, 8966, 5609, 1515...

[ 0.089111328125, 0.057586669921875, 0.017974853515625, 0.06793212890625, 0.11669921875, 0.1085205078125, 0.0435791015625, 0.005035400390625, 0.008087158203125, 0.0982666015625, 0.0897216796875, 0.126708984375, 0.2369384765625, 0.1641845703125, 0.14697265625, 0.1407470703125, 0.2194824...

embed

47757073_c0

47757073

haskell

0

Title: Grow a tree from parent relations in Haskell Problem title: Grow a tree from parent relations in Haskell Tags: tree, haskell, functional-programming Problem: Grow a tree from parent relations in Haskell I have the following data: data Item a = { id :: ID , parentId :: Maybe ID , data :: a } data ItemTree a = Ite...

Grow a tree from parent relations in Haskell Grow a tree from parent relations in Haskell tree haskell functional-programming parent Grow Haskell Item Maybe ItemTree Grow a tree from parent relations in Haskell I have the following data: And I want to to have this function: buildForest :: [Item a] -> [ItemTree a] which...

[ 0.0021820068359375, 0.0201416015625, -0.0220947265625, -0.015869140625, 0.0186767578125, 0.00543212890625, -0.031982421875, -0.0191650390625, 0.00469970703125, -0.046142578125, 0.033935546875, 0.0072021484375, -0.0018768310546875, 0.041259765625, 0.01171875, -0.02099609375, -0.011657...

[ 14854, 434, 53201, 1295, 49129, 91582, 20625, 142508, 23, 1556, 123309, 28966, 78426, 83425, 62731, 25632, 2053, 3444, 765, 903, 32354, 45367, 18537, 525, 1984, 2982, 10, 33079, 13, 30646, 351, 3996, 686, 100, 15072, 41591, 11338, 12638, 35...

[ 0.172119140625, 0.04010009765625, 0.2408447265625, 0.116943359375, 0.2276611328125, 0.22119140625, 0.1307373046875, 0.237548828125, 0.040985107421875, 0.10205078125, 0.12353515625, 0.0943603515625, 0.1514892578125, 0.067626953125, 0.20458984375, 0.019073486328125, 0.077392578125, 0...

embed

2694015_c0

2694015

haskell

0

Title: Improve a haskell script Problem title: Improve a haskell script Tags: haskell, coding-style Problem: Improve a haskell script I'm a newbie in Haskell and I'd like some opinions about improving this script. This is a code generator and requires a command line argument to generate the sql script. ./GenCode "peopl...

Improve a haskell script Improve a haskell script haskell coding-style Data.List System.Environment Improve GenCode name:string age:integer create_table CREATE TABLE x:xs create_fields CHARACTER VARYING INTEGER DATE SERIAL You Improve a haskell script I'm a newbie in Haskell and I'd like some opinions about improving t...

[ 0.0038604736328125, 0.0002593994140625, -0.00543212890625, 0.014404296875, 0.00262451171875, 0.0081787109375, 0.00823974609375, -0.0255126953125, -0.01019287109375, -0.0260009765625, 0.01373291015625, -0.007293701171875, -0.011962890625, 0.0032196044921875, -0.0230712890625, 0.00778198...

[ 3370, 66187, 10, 1556, 142508, 26499, 552, 6238, 40946, 11809, 154663, 12353, 686, 1900, 15937, 114211, 9351, 91693, 32070, 6191, 1505, 28282, 22819, 175151, 384, 183057, 1022, 425, 7, 28394, 126349, 310, 123275, 102686, 56599, 391, 35746, 11...

[ 0.1187744140625, 0.2088623046875, 0.051483154296875, 0.1566162109375, 0.2230224609375, 0.24853515625, 0.1153564453125, 0.037811279296875, 0.1719970703125, 0.08349609375, 0.114013671875, 0.077880859375, 0.040985107421875, 0.06085205078125, 0.156494140625, 0.1722412109375, 0.0480346679...

embed

66885274_c0

66885274

haskell

0

Title: Declaring type class instance for composition of constructors Problem title: Declaring type class instance for composition of constructors Tags: haskell Problem: Declaring type class instance for composition of constructors In trying to answer this SO question i wondered: Suppose I want to be able to write fmap ...

Declaring type class instance for composition of constructors Declaring type class instance for composition of constructors haskell Declaring Just fmap.fmap Maybe Functor Nothing Lambda ListT Declaring type class instance for composition of constructors In trying to answer this SO question i wondered: Suppose I want to...

[ -0.006103515625, -0.00096893310546875, 0.006103515625, 0.005706787109375, -0.00634765625, 0.0225830078125, -0.0078125, 0.00096893310546875, 0.0233154296875, -0.0057373046875, -0.0093994140625, -0.00823974609375, 0.0027008056640625, 0.006744384765625, -0.02294921875, -0.0164794921875, ...

[ 25755, 320, 10644, 18507, 110527, 100, 166577, 64549, 25251, 1556, 142508, 9563, 1238, 62346, 420, 83425, 28670, 18770, 182747, 122930, 85, 32036, 618, 15969, 121691, 3444, 19048, 33022, 22183, 17727, 127794, 116, 64457, 6626, 7477, 15700, 9790...

[ 0.086181640625, 0.1146240234375, 0.207763671875, 0.208740234375, 0.2646484375, 0.013214111328125, 0.2197265625, 0.169677734375, 0.1041259765625, 0.1138916015625, 0.2293701171875, 0.0230865478515625, 0.0860595703125, 0.1910400390625, 0.05712890625, 0.22509765625, 0.1260986328125, 0....

embed

32706873_c0

32706873

haskell

0

Title: How come `par` uses only one core but faster? Problem title: How come `par` uses only one core but faster? Tags: haskell Problem: How come `par` uses only one core but faster? I'm trying to test the parallel package, specifically the par function. I wrote a simple program to test whether parallelism would speed ...

How come `par` uses only one core but faster? How come `par` uses only one core but faster? haskell Control.Parallel How User System Percent CPU Elapsed h:mm:ss m:ss How come `par` uses only one core but faster? I'm trying to test the parallel package, specifically the par function. I wrote a simple program to test whe...

[ -0.004791259765625, 0.0027618408203125, 0.000553131103515625, -0.002197265625, 0.01226806640625, -0.0018463134765625, 0.0037689208984375, -0.0079345703125, 0.004150390625, -0.04296875, 0.00008392333984375, 0.01531982421875, -0.00156402587890625, 0.0174560546875, 0.00032806396484375, -0...

[ 11249, 1380, 2500, 4527, 4734, 1632, 56458, 1284, 4271, 56, 1556, 142508, 27131, 55292, 1229, 53400, 12353, 908, 16797, 86039, 127966, 3034, 95103, 98169, 366, 32354, 8781, 1528, 8780, 38352, 1257, 243228, 54397, 6626, 26499, 289, 17932, 5974...

[ 0.012054443359375, 0.067626953125, 0.2242431640625, 0.128173828125, 0.0994873046875, 0.1412353515625, 0.2080078125, 0.0299224853515625, 0.1490478515625, 0.1016845703125, 0.05328369140625, 0.18505859375, 0.127197265625, 0.0870361328125, 0.0982666015625, 0.0908203125, 0.03692626953125,...

embed

11148838_c1

11148838

haskell

1

0 requires base ==4.2.0.0 base-4.3.0.0 was excluded because process-1.0.1.2 requires base ==4.2.0.0 base-4.3.0.0 was excluded because pretty-1.0.1.1 requires base ==4.2.0.0 base-4.3.0.0 was excluded because old-time-1.0.0.3 requires base ==4.2.0.0 base-4.3.0.0 was excluded because old-locale-1.0.0.2 requires base ==4.2...

[ -0.03369140625, -0.003173828125, 0.01483154296875, 0.01556396484375, 0.00689697265625, -0.004852294921875, -0.03955078125, 0.01708984375, 0.00970458984375, 0.040771484375, -0.0111083984375, -0.00823974609375, -0.00787353515625, 0.01507568359375, 0.0021514892578125, -0.00004649162292480...

[ 757, 144570, 3647, 69112, 117904, 5, 99929, 9, 158406, 509, 39041, 48141, 6637, 9433, 102107, 48400, 28875, 83783, 10332, 6032, 170179, 98908, 133684, 118258, 238, 93645, 121254, 6, 31380, 19155, 1294, 11435, 128405, 92134, 14364, 116419, 390, ...

[ 0.1904296875, 0.209228515625, 0.241943359375, 0.0968017578125, 0.25048828125, 0.045989990234375, 0.25048828125, 0.00750732421875, 0.27001953125, 0.0517578125, 0.200927734375, 0.1318359375, 0.0850830078125, 0.1793212890625, 0.154296875, 0.16259765625, 0.2012939453125, 0.154174804687...

embed

12605776_c0

12605776

haskell

0

Title: Error while accessing Int/Integer element from the List using '!!' Problem title: Error while accessing Int/Integer element from the List using '!!' Tags: haskell, list Problem: Error while accessing Int/Integer element from the List using '!!' Level of Haskell : Newbie Goal : Find the root o...

Error while accessing Int/Integer element from the List using '!!' Error while accessing Int/Integer element from the List using '!!' haskell list the Error Integer List getRoot::Integer test2.hs:111 Type Expression Term Does Error while accessing Int/Integer element from the List using '!!' Level o...

[ -0.01318359375, 0.005950927734375, 0.01080322265625, -0.015380859375, 0.00244140625, 0.00811767578125, 0.003662109375, -0.01953125, 0.00823974609375, -0.02880859375, 0.039306640625, -0.004150390625, -0.000957489013671875, -0.0130615234375, 0.00946044921875, -0.0274658203125, 0.005340...

[ 212059, 12960, 17203, 214, 360, 18, 64, 4153, 67, 1505, 12830, 1295, 32036, 17368, 54764, 3768, 1146, 1556, 142508, 5303, 44401, 2046, 12724, 818, 3034, 5442, 127, 97024, 60457, 25129, 2994, 101790, 84136, 20625, 2356, 9014, 2016, 289, 2604...

[ 0.2265625, 0.060302734375, 0.2132568359375, 0.0229034423828125, 0.15087890625, 0.193603515625, 0.09124755859375, 0.130615234375, 0.19970703125, 0.162353515625, 0.156982421875, 0.0972900390625, 0.190673828125, 0.06781005859375, 0.04644775390625, 0.131591796875, 0.199951171875, 0.129...

embed

16015487_c0

16015487

haskell

0

Title: Hughes' Arrowed FilterA Exercise Problem title: Hughes' Arrowed FilterA Exercise Tags: haskell, arrow-abstraction Problem: Hughes' Arrowed FilterA Exercise I've been reading through John Hughes' Programming with Arrows, and I got to first exercise in which he asks the reader to implement a generic filt...

Hughes' Arrowed FilterA Exercise Hughes' Arrowed FilterA Exercise haskell arrow-abstraction Hughes Arrowed FilterA Exercise Left x:xs Right ArrowChoice Bool Hughes' Arrowed FilterA Exercise I've been reading through John Hughes' Programming with Arrows, and I got to first exercise in which he asks the reader ...

[ -0.0068359375, -0.0003604888916015625, 0.0159912109375, 0.00897216796875, -0.0040283203125, -0.01385498046875, -0.003173828125, 0.002838134765625, 0.01043701171875, 0.0294189453125, 0.01263427734375, 0.003082275390625, -0.01141357421875, 0.0216064453125, 0.00130462646484375, -0.0086059...

[ 177099, 3768, 1172, 15555, 128896, 284, 155534, 1556, 142508, 118201, 2055, 7, 117474, 2480, 1022, 425, 90911, 107522, 2460, 929, 4939, 27958, 678, 81979, 29479, 189534, 46312, 32354, 48502, 68991, 1884, 645, 103607, 594, 45325, 90, 150, 2896...

[ 0.2320556640625, 0.0426025390625, 0.03643798828125, 0.1556396484375, 0.220703125, 0.178955078125, 0.135009765625, 0.055694580078125, 0.1680908203125, 0.2193603515625, 0.04534912109375, 0.009368896484375, 0.0850830078125, 0.030426025390625, 0.000946044921875, 0.0059814453125, 0.079162...

embed

78553453_c1

78553453

haskell

1

timeZone today) [0 .. daysInAdvanceToShow] previousRanges = map (mkPreviousRange timeZone . warpNDaysAtMidnight timeZone today) [daysInPastToShow .. 0] pure $ previousRanges ++ advancedRanges where daysInAdvanceToShow = 60 daysInPastToShow = -2 mkPreviousRange timeZone moment = TimeRange { slotStart = addSecondsToZone...

[ -0.0264892578125, 0.024169921875, -0.0028228759765625, 0.00121307373046875, -0.016845703125, 0.004730224609375, -0.017333984375, -0.0145263671875, 0.013916015625, -0.0291748046875, -0.0033416748046875, 0.0140380859375, 0.0029449462890625, 0.023193359375, 0.0017242431640625, 0.011047363...

[ 1733, 60551, 86, 18925, 16, 2389, 1468, 13312, 4153, 22409, 157000, 7763, 168660, 96362, 126525, 4188, 2203, 22288, 19201, 235588, 1052, 51459, 1631, 254, 839, 97141, 28848, 532, 54350, 5636, 65619, 18, 757, 34166, 3650, 37223, 175961, 1496, ...

[ 0.213134765625, 0.254150390625, 0.1724853515625, 0.292236328125, 0.0159912109375, 0.103271484375, 0.06646728515625, 0.1466064453125, 0.1322021484375, 0.0450439453125, 0.163818359375, 0.1220703125, 0.1971435546875, 0.1767578125, 0.2232666015625, 0.2147216796875, 0.071044921875, 0.16...

embed

55977311_c0

55977311

haskell

0

Title: How to define the fibonacci sequence using a fold for natural numbers? Problem title: How to define the fibonacci sequence using a fold for natural numbers? Tags: recursion-schemes, catamorphism, fold, haskell, recursion Problem: How to define the fibonacci sequence using a fold for natural numbers? I am current...

How to define the fibonacci sequence using a fold for natural numbers? How to define the fibonacci sequence using a fold for natural numbers? recursion-schemes catamorphism fold haskell recursion a How n-1 How to define the fibonacci sequence using a fold for natural numbers? I am currently learning folds in the sense ...

[ -0.003265380859375, 0.00848388671875, -0.00335693359375, 0.0106201171875, -0.00238037109375, -0.0024871826171875, -0.009765625, -0.0103759765625, 0.0002994537353515625, -0.026611328125, 0.004608154296875, -0.0303955078125, -0.0255126953125, 0.025634765625, 0.015625, -0.01385498046875, ...

[ 11249, 61924, 809, 20990, 52544, 40, 944, 3956, 17368, 10, 42822, 100, 6083, 101935, 47, 195625, 1830, 7560, 3716, 60199, 178851, 8780, 1556, 142508, 5759, 82424, 52080, 7, 118990, 36437, 29479, 14537, 136, 31461, 15403, 20625, 18151, 39908, ...

[ 0.052459716796875, 0.2039794921875, 0.160888671875, 0.1607666015625, 0.2056884765625, 0.08642578125, 0.1463623046875, 0.1053466796875, 0.060791015625, 0.06353759765625, 0.263671875, 0.0614013671875, 0.212158203125, 0.187744140625, 0.005218505859375, 0.13232421875, 0.0312347412109375,...

embed

56376882_c0

56376882

haskell

0

Title: What is a measure? Problem title: What is a measure? Tags: liquid-haskell, haskell Problem: What is a measure? I am reading this where I find this: Measures -- In order to allow Haskell functions to appear in refinement types, we need to lift them to the refinement type level. And there are other documents asser...

What is a measure? What is a measure? liquid-haskell haskell haskell What List Nat Nil Cons x:y x:xs Cannot What is a measure? I am reading this where I find this: And there are other documents asserting that measures are needed to use such function in contract. But I tried this: and this works but len is not measure ....

[ 0.01239013671875, 0.013671875, 0.01531982421875, 0.006988525390625, -0.0033111572265625, -0.0028076171875, -0.004913330078125, 0.00958251953125, 0.0284423828125, -0.01348876953125, -0.0087890625, -0.0172119140625, 0.006744384765625, 0.01513671875, 0.01190185546875, 0.0015411376953125, ...

[ 4865, 83, 10, 72350, 41931, 10557, 142508, 1556, 32036, 68875, 77175, 39215, 1022, 425, 4171, 10869, 16454, 60525, 44841, 4527, 32354, 18264, 37842, 43240, 3098, 959, 2367, 66161, 3229, 3871, 442, 27781, 4488, 15490, 70166, 9, 981, 140909, ...

[ 0.1044921875, 0.130859375, 0.175048828125, 0.33447265625, 0.1553955078125, 0.107177734375, 0.2427978515625, 0.1341552734375, 0.09161376953125, 0.131591796875, 0.1705322265625, 0.12890625, 0.034423828125, 0.0310821533203125, 0.06976318359375, 0.1796875, 0.008087158203125, 0.06210327...

embed

60723486_c0

60723486

haskell

0

Title: Struggling to extract a section of a list in Haskell Problem title: Struggling to extract a section of a list in Haskell Tags: haskell, list-comprehension, list Problem: Struggling to extract a section of a list in Haskell I am trying to implement a basic function but I'm out of practice with Haskell and struggl...

Struggling to extract a section of a list in Haskell Struggling to extract a section of a list in Haskell haskell list-comprehension list Struggling Haskell Node Branch Graph Struggling to extract a section of a list in Haskell I am trying to implement a basic function but I'm out of practice with Haskell and strugglin...

[ -0.042236328125, 0.033935546875, 0.01611328125, 0.0167236328125, 0.0093994140625, 0.00726318359375, -0.015869140625, 0.013916015625, 0.00994873046875, 0.01031494140625, -0.01068115234375, -0.021728515625, -0.00604248046875, 0.0174560546875, -0.01556396484375, 0.006622314453125, 0.019...

[ 63667, 9815, 2069, 125663, 40059, 111, 5303, 20625, 142508, 23, 1556, 4692, 3220, 438, 112, 21110, 206, 6524, 11727, 10, 31577, 29479, 62822, 32354, 1810, 41361, 237875, 77947, 4358, 183037, 3642, 36849, 390, 63262, 3714, 3789, 46876, 46683, ...

[ 0.13330078125, 0.1202392578125, 0.0791015625, 0.234375, 0.224609375, 0.051727294921875, 0.1959228515625, 0.1285400390625, 0.2220458984375, 0.021270751953125, 0.1212158203125, 0.0830078125, 0.0855712890625, 0.09912109375, 0.1175537109375, 0.0953369140625, 0.0253448486328125, 0.09423...

embed

11350948_c1

11350948

haskell

1

":"AddWorkout","data":{"uuid":"a60806a0-efd6-4647-bc62-a48298ce55cd","date":"2012-04-04","workout_type":"Pushups","description":"","sets":[]}} And so on and so forth. Each line in the file represents one full object that I have serialized. Then I load up the file using readFile and I see no problems: *Main> f <- readFi...

[ 0.01446533203125, 0.00341796875, -0.0081787109375, 0.0166015625, 0.00148773193359375, -0.0123291015625, -0.0014495849609375, 0.001983642578125, -0.0126953125, 0.002777099609375, 0.00347900390625, -0.01531982421875, 0.0029296875, -0.00933837890625, -0.01129150390625, -0.003173828125, ...

[ 284, 4028, 108259, 6056, 10135, 170285, 11663, 10693, 18244, 50986, 33768, 74854, 59478, 3509, 98423, 13315, 11435, 33636, 1632, 4393, 36746, 35686, 72367, 1257, 12301, 174350, 44402, 168793, 1238, 32121, 93, 239469, 170, 1681, 86429, 5646, 836...

[ 0.0703125, 0.1572265625, 0.1689453125, 0.22119140625, 0.07098388671875, 0.002593994140625, 0.027191162109375, 0.0180511474609375, 0.1357421875, 0.1353759765625, 0.10321044921875, 0.1376953125, 0.07928466796875, 0.056396484375, 0.0295867919921875, 0.08642578125, 0.1380615234375, 0.1...

embed

14798613_c0

14798613

haskell

0

Title: How fast is Data.Sequence.Seq compared to []? Problem title: How fast is Data.Sequence.Seq compared to []? Tags: finger-tree, performance, list, haskell Problem: How fast is Data.Sequence.Seq compared to []? Clearly Seq asymptotically performs the same or better as [] for all possible operations. But since its s...

How fast is Data.Sequence.Seq compared to []? How fast is Data.Sequence.Seq compared to []? finger-tree performance list haskell How Data.Sequence.Seq Seq How fast is Data.Sequence.Seq compared to []? Clearly Seq asymptotically performs the same or better as [] for all possible operations. But since its structure is mo...

[ 0.014404296875, 0.00726318359375, 0.011962890625, -0.01190185546875, 0.004608154296875, -0.027099609375, -0.012939453125, -0.005218505859375, 0.01190185546875, -0.006256103515625, 0.0003986358642578125, -0.003448486328125, 0.001861572265625, 0.018310546875, -0.01519775390625, -0.002593...

[ 11249, 4271, 83, 11809, 4233, 944, 3956, 864, 154186, 51287, 62600, 23718, 5303, 1556, 142508, 503, 5, 47, 2676, 21737, 51339, 5701, 11522, 756, 7722, 41018, 45646, 1286, 96704, 19336, 13267, 53697, 645, 31251, 31895, 3249, 72803, 56, 1884,...

[ 0.056121826171875, 0.1971435546875, 0.04150390625, 0.1263427734375, 0.12890625, 0.0965576171875, 0.0648193359375, 0.2264404296875, 0.1800537109375, 0.1510009765625, 0.18896484375, 0.177734375, 0.1494140625, 0.096435546875, 0.18798828125, 0.1707763671875, 0.021087646484375, 0.018432...

embed

29476988_c0

29476988

haskell

0

Title: Ambiguous definition error while trying to define Eq for custom Tree data structure Problem title: Ambiguous definition error while trying to define Eq for custom Tree data structure Tags: haskell Problem: Ambiguous definition error while trying to define Eq for custom Tree data structure I'm trying to implement...

Ambiguous definition error while trying to define Eq for custom Tree data structure Ambiguous definition error while trying to define Eq for custom Tree data structure haskell Data.List Ambiguous Tree Ord Leaf Internal Prelude Ambiguous definition error while trying to define Eq for custom Tree data structure I'm tryin...

[ 0.0283203125, 0.00927734375, -0.01318359375, 0.005096435546875, 0.0294189453125, -0.005889892578125, -0.00148773193359375, -0.007659912109375, -0.0164794921875, -0.006500244140625, 0.00023651123046875, -0.02880859375, 0.028076171875, 0.007659912109375, 0.0012359619140625, 0.00628662109...

[ 10250, 12282, 10821, 80934, 18499, 31577, 61924, 241, 864, 114122, 101344, 2053, 45646, 1556, 142508, 11809, 154663, 35379, 2407, 106745, 1914, 822, 29479, 136, 572, 21493, 669, 53201, 28540, 1234, 70820, 27781, 10557, 67413, 920, 69112, 13648,...

[ 0.1368408203125, 0.1878662109375, 0.1591796875, 0.1927490234375, 0.1610107421875, 0.060577392578125, 0.14794921875, 0.047332763671875, 0.1973876953125, 0.138916015625, 0.203369140625, 0.080810546875, 0.125, 0.0980224609375, 0.1778564453125, 0.06427001953125, 0.073486328125, 0.18054...

embed

20478982_c0

20478982

haskell

0

Title: First attempt at Haskell: Converting lower case letters to upper case Problem title: First attempt at Haskell: Converting lower case letters to upper case Tags: haskell, functional-programming Problem: First attempt at Haskell: Converting lower case letters to upper case I have recently started learning Haskell,...

First attempt at Haskell: Converting lower case letters to upper case First attempt at Haskell: Converting lower case letters to upper case haskell functional-programming First Haskell Converting First attempt at Haskell: Converting lower case letters to upper case I have recently started learning Haskell, and I've tri...

[ 0.0020904541015625, -0.0037078857421875, 0.005859375, -0.0023651123046875, 0.0137939453125, 0.01177978515625, 0.003814697265625, 0.0027008056640625, 0.01031494140625, 0.0150146484375, 0.002838134765625, -0.00286865234375, 0.0272216796875, 0.0274658203125, -0.004364013671875, 0.00848388...

[ 23972, 81887, 20625, 142508, 1657, 814, 92319, 7225, 120820, 47, 1407, 56, 99, 1556, 123309, 28966, 26859, 52080, 37842, 105233, 32354, 96760, 2565, 142, 43240, 18, 3642, 4127, 17582, 28864, 2301, 1884, 3917, 115081, 136, 69427, 159978, 7964,...

[ 0.03692626953125, 0.1275634765625, 0.1009521484375, 0.217041015625, 0.019744873046875, 0.1158447265625, 0.2127685546875, 0.2095947265625, 0.1805419921875, 0.0853271484375, 0.144775390625, 0.1168212890625, 0.0009765625, 0.0789794921875, 0.0977783203125, 0.036376953125, 0.0038757324218...

embed

43185686_c0

43185686

haskell

0

Title: Readline dependencie error with stack Problem title: Readline dependencie error with stack Tags: haskell-stack, haskell Problem: Readline dependencie error with stack I have this error when I add this dependencie to my project.cabal file. Warning: defaultUserHooks in Setup script is deprecated. Configuring readl...

Readline dependencie error with stack Readline dependencie error with stack haskell-stack haskell the Readline Warning Setup Configuring readline-1.0.3.0 a.out GNU ISO C89 GNUreadline.framework rl_readline_version See config.log Readline dependencie error with stack I have this error when I add this dependencie to my p...

[ -0.00970458984375, -0.0106201171875, -0.0018310546875, 0.016845703125, 0.00726318359375, -0.005096435546875, 0.00115203857421875, 0, -0.01287841796875, -0.0079345703125, -0.00384521484375, -0.032470703125, -0.00872802734375, -0.0006256103515625, 0.007720947265625, 0.00165557861328125, ...

[ 4764, 2256, 42548, 19, 1474, 18499, 678, 177261, 1556, 142508, 590, 2594, 5550, 19943, 59994, 12301, 102107, 132265, 6056, 165132, 17408, 18949, 39116, 160328, 54123, 46354, 153837, 4867, 903, 15190, 13452, 408, 3571, 11435, 86869 ]

[ 0.231689453125, 0.2496337890625, 0.1898193359375, 0.05157470703125, 0.0906982421875, 0.163818359375, 0.110595703125, 0.2281494140625, 0.11181640625, 0.2120361328125, 0.076904296875, 0.1044921875, 0.07073974609375, 0.055755615234375, 0.06927490234375, 0.1824951171875, 0.06500244140625...

embed

44590358_c0

44590358

haskell

0

Title: `instance` for concrete type instead of typeclass? Problem title: `instance` for concrete type instead of typeclass? Tags: typeclass, haskell Problem: `instance` for concrete type instead of typeclass? I defined a simple list type: data MyList a = End |Entry a (MyList a) Instead of deriving (Show) I implemented ...

`instance` for concrete type instead of typeclass? `instance` for concrete type instead of typeclass? typeclass haskell MyList End Entry Show Illegal All Use FlexibleInstances `instance` for concrete type instead of typeclass? I defined a simple list type: Instead of deriving (Show) I implemented that explicitly myself...

[ -0.01080322265625, -0.01025390625, 0.017822265625, -0.00677490234375, 0.006011962890625, 0.005950927734375, -0.010009765625, 0.0091552734375, 0.01422119140625, -0.01336669921875, -0.01519775390625, -0.041015625, 0.0250244140625, 0.019287109375, -0.0126953125, -0.0216064453125, 0.0186...

[ 73, 116071, 100, 122776, 10644, 64457, 67413, 1556, 142508, 2646, 154663, 18878, 357, 15123, 17367, 891, 86966, 3164, 36836, 180842, 2661, 61924, 8781, 5303, 175399, 111, 16406, 6496, 168660, 29479, 143726, 35978, 756, 10, 110527, 43240, 169123...

[ 0.109375, 0.2178955078125, 0.04815673828125, 0.2236328125, 0.1983642578125, 0.1361083984375, 0.2484130859375, 0.109619140625, 0.2047119140625, 0.130859375, 0.2198486328125, 0.1226806640625, 0.0863037109375, 0.0911865234375, 0.237548828125, 0.068359375, 0.1802978515625, 0.0556640625...

embed

28840749_c0

28840749

haskell

0

Title: Error installing fast-logger for yesod setup, Ubuntu Problem title: Error installing fast-logger for yesod setup, Ubuntu Tags: cabal, haskell, ubuntu, yesod Problem: Error installing fast-logger for yesod setup, Ubuntu I've been struggling to get Yesod running. I'm finally down to only one missing dependency, fa...

Error installing fast-logger for yesod setup, Ubuntu Error installing fast-logger for yesod setup, Ubuntu cabal haskell ubuntu yesod Error Ubuntu fast-logger-2.2.3 System Log FastLogger IO.hs:9:8 Could Blaze.ByteString.Builder.Internal.Types blaze-builder-0.3.3.4 Perhaps Use Failed ExitFailure Error installing fast-log...

[ 0.015869140625, 0.013427734375, -0.0113525390625, -0.0224609375, -0.0005645751953125, 0.006805419921875, -0.00640869140625, -0.0106201171875, -0.01171875, 0.003631591796875, 0.0145263671875, -0.031005859375, -0.002532958984375, -0.0107421875, 0.001556396484375, -0.0174560546875, -0.0...

[ 212059, 20600, 214, 4271, 9, 365, 21407, 100, 2422, 23722, 169581, 116890, 109524, 1556, 142508, 198996, 5428, 120883, 12353, 13146, 25290, 113972, 1505, 17780, 1126, 1019, 191147, 22446, 731, 75358, 71713, 121137, 44851, 196707, 9932, 177149, ...

[ 0.1617431640625, 0.1793212890625, 0.0310821533203125, 0.187255859375, 0.06396484375, 0.15087890625, 0.1937255859375, 0.07049560546875, 0.156982421875, 0.24169921875, 0.150146484375, 0.1829833984375, 0.170166015625, 0.0849609375, 0.1766357421875, 0.1396484375, 0.03302001953125, 0.14...

embed

46074184_c0

46074184

haskell

0

Title: Applying functions to lists with substitution Problem title: Applying functions to lists with substitution Tags: haskell, functional-programming Problem: Applying functions to lists with substitution I was trying to make a function that quickly calculates fractions. In my particular case there a factorials, so i...

Applying functions to lists with substitution Applying functions to lists with substitution haskell functional-programming Applying make_coprime x:xs Applying functions to lists with substitution I was trying to make a function that quickly calculates fractions. In my particular case there a factorials, so it s kinda e...

[ -0.0223388671875, 0.01708984375, 0.01129150390625, 0.00020599365234375, 0.0003910064697265625, -0.001922607421875, 0.0036468505859375, 0.005401611328125, 0.0294189453125, -0.0101318359375, 0.00201416015625, 0.00469970703125, 0.021484375, 0.01324462890625, 0.00152587890625, -0.007934570...

[ 5659, 538, 32354, 47, 5303, 7, 678, 161740, 1830, 1556, 142508, 123309, 28966, 3249, 587, 114654, 1022, 425, 31577, 69405, 74481, 175921, 31461, 15403, 8562, 23468, 54397, 30482, 6626, 101935, 552, 30646, 80836, 15044, 10176, 102678, 4785, 57...

[ 0.1214599609375, 0.09423828125, 0.1827392578125, 0.1046142578125, 0.2083740234375, 0.06402587890625, 0.1029052734375, 0.2071533203125, 0.05657958984375, 0.085693359375, 0.1966552734375, 0.120849609375, 0.0986328125, 0.1295166015625, 0.1175537109375, 0.250732421875, 0.04425048828125, ...

embed

66261288_c0

66261288

haskell

0

Title: Lens name leads to "not found" error, but it exists Problem title: Lens name leads to "not found" error, but it exists Tags: haskell Problem: Lens name leads to "not found" error, but it exists I have several modules. One of them defines a type Xyz and generates lens for it: -- module A data ...

Lens name leads to "not found" error, but it exists Lens name leads to "not found" error, but it exists haskell qualified Lens Xyz _xyzField _xyzState SomeState Generic Show A.Xyz A.field ERRORS HERE A.state THERE ERROR Not Lens name leads to "not found" error, but it exists I have several modules. ...

[ -0.007171630859375, -0.006591796875, -0.0093994140625, 0.01202392578125, -0.00167083740234375, 0.0186767578125, -0.0072021484375, 0.001953125, -0.00848388671875, -0.0150146484375, 0.01129150390625, 0.01007080078125, 0.00738525390625, -0.0179443359375, 0.01611328125, -0.01470947265625, ...

[ 18226, 7, 9351, 37105, 10869, 14037, 18499, 1284, 442, 32316, 1556, 142508, 217225, 1193, 32189, 50878, 169, 6159, 19388, 135206, 31384, 88342, 17367, 62, 1542, 28394, 151206, 24638, 65791, 61340, 11766, 11205, 88996, 61924, 10644, 139392, 3098...

[ 0.2308349609375, 0.0867919921875, 0.195068359375, 0.1485595703125, 0.189453125, 0.1981201171875, 0.2020263671875, 0.1171875, 0.0810546875, 0.2218017578125, 0.1036376953125, 0.2083740234375, 0.175537109375, 0.04193115234375, 0.17626953125, 0.054656982421875, 0.028564453125, 0.059631...

embed

37644382_c0

37644382

haskell

0

Title: Splitting a BinTree with tail recursion in Haskell Problem title: Splitting a BinTree with tail recursion in Haskell Tags: tail-recursion, recursion, binary-tree, haskell Problem: Splitting a BinTree with tail recursion in Haskell So this week we learned about union types, tail recursion and binary trees in Hask...

Splitting a BinTree with tail recursion in Haskell Splitting a BinTree with tail recursion in Haskell tail-recursion recursion binary-tree haskell Splitting BinTree Haskell Empty Node Show Maybe Nothing Just Splitting a BinTree with tail recursion in Haskell So this week we learned about union types, tail recursion and...

[ -0.001617431640625, 0.0247802734375, -0.004852294921875, -0.00604248046875, 0.004791259765625, 0.0140380859375, -0.0185546875, -0.02587890625, -0.000690460205078125, -0.01300048828125, 0.000591278076171875, -0.01055908203125, -0.005706787109375, -0.0003948211669921875, 0.0279541015625, ...

[ 46474, 1916, 16666, 62731, 13, 678, 46741, 195625, 1830, 20625, 142508, 48650, 2394, 6635, 62600, 1556, 31678, 438, 112, 17367, 83425, 182747, 5895, 69941, 52895, 1360, 61924, 53201, 2053, 10644, 37170, 33022, 32354, 7413, 2684, 25737, 110, 3...

[ 0.178466796875, 0.06072998046875, 0.15283203125, 0.243408203125, 0.058990478515625, 0.0235748291015625, 0.266845703125, 0.226806640625, 0.10638427734375, 0.1278076171875, 0.2213134765625, 0.152099609375, 0.114990234375, 0.07177734375, 0.14208984375, 0.100341796875, 0.12109375, 0.10...

embed

28685119_c0

28685119

haskell

0

Title: Fibonacci sequence generation Problem title: Fibonacci sequence generation Tags: fibonacci, haskell Problem: Fibonacci sequence generation I was writing a fibonacci sequence generator, and I was trying to understand the following code in Haskell fibs = 1 : 1 : zipWith (+) fibs (tail fibs) I understand what zipWi...

Fibonacci sequence generation Fibonacci sequence generation fibonacci haskell Fibonacci Fibonacci sequence generation I was writing a fibonacci sequence generator, and I was trying to understand the following code in Haskell fibs = 1 : 1 : zipWith (+) fibs (tail fibs) I understand what zipWith is, but I do not exactly ...

[ 0.01611328125, 0.0186767578125, -0.01287841796875, 0.000010073184967041016, 0.000972747802734375, 0.01318359375, 0.0015869140625, 0.000957489013671875, 0.0106201171875, -0.0294189453125, -0.005401611328125, 0.0037994384765625, 0.00191497802734375, 0.0252685546875, 0.006622314453125, 0....

[ 3698, 20990, 52544, 40, 944, 58093, 809, 1556, 142508, 32562, 3956, 145823, 31577, 28219, 18151, 20625, 16145, 2203, 106, 152, 68330, 194583, 22183, 46741, 1528, 71924, 15400, 14602, 139392, 756, 101935, 959, 121011, 17368, 65998, 23755, 123309...

[ 0.127685546875, 0.1649169921875, 0.17626953125, 0.055084228515625, 0.137939453125, 0.192138671875, 0.1832275390625, 0.123291015625, 0.22705078125, 0.0491943359375, 0.0225982666015625, 0.1934814453125, 0.00128173828125, 0.049224853515625, 0.1177978515625, 0.1241455078125, 0.1324462890...

embed

7663988_c0

7663988

haskell

0

Title: ScopedTypeVariables are sometimes in scope, sometimes not Problem title: ScopedTypeVariables are sometimes in scope, sometimes not Tags: haskell, parameterized, scope, types Problem: ScopedTypeVariables are sometimes in scope, sometimes not I'm trying to figure out when my type parameters will be in scope. I hav...

ScopedTypeVariables are sometimes in scope, sometimes not ScopedTypeVariables are sometimes in scope, sometimes not haskell parameterized scope types ScopedTypeVariables LANGUAGE IntegerAsType Integer BaseRing Num WORKS DOES NOT WORK ScopedTypeVariables are sometimes in scope, sometimes not I'm trying to figure out whe...

[ 0.004486083984375, 0.01446533203125, -0.00799560546875, -0.002227783203125, -0.0084228515625, -0.000850677490234375, -0.00860595703125, 0.0106201171875, 0.01324462890625, 0.0030059814453125, 0.0093994140625, -0.00946044921875, 0.00179290771484375, -0.017822265625, 0.004852294921875, -0...

[ 182783, 297, 196707, 81827, 14, 19736, 68018, 23, 70820, 959, 1556, 142508, 171859, 52895, 98064, 44401, 19659, 44978, 1052, 214, 52782, 231355, 6197, 6706, 86725, 26366, 3229, 10644, 135179, 6626, 31943, 27781, 22027, 18, 4488, 60212, 17721, ...

[ 0.23095703125, 0.1231689453125, 0.2454833984375, 0.1597900390625, 0.1197509765625, 0.1195068359375, 0.1612548828125, 0.124267578125, 0.2457275390625, 0.13671875, 0.125244140625, 0.2230224609375, 0.1881103515625, 0.153564453125, 0.1187744140625, 0.151611328125, 0.08367919921875, 0.1...

embed

25727072_c0

25727072

haskell

0

Title: Function application in Haskell Problem title: Function application in Haskell Tags: haskell, operator-sections, function, operators, partial-application Problem: Function application in Haskell OK, it's been a long day and my brain may not function at Haskell level, but I just cannot understand one example from...

Function application in Haskell Function application in Haskell haskell operator-sections function operators partial-application Haskell Main Function application in Haskell OK, it's been a long day and my brain may not function at Haskell level, but I just cannot understand one example from 'Learn You a Haskell'. The ...

[ -0.00634765625, 0.01708984375, 0.0208740234375, -0.01031494140625, -0.015380859375, 0.01806640625, 0.005096435546875, 0.0057373046875, -0.004241943359375, -0.0181884765625, -0.00665283203125, -0.035888671875, 0.0000782012939453125, 0.03271484375, -0.0064697265625, 0.01019287109375, 0...

[ 28670, 10763, 38415, 20625, 142508, 23, 1556, 39933, 7, 58994, 32354, 2878, 289, 101687, 12321, 78574, 1543, 959, 17366, 53418, 28219, 1632, 27781, 147, 2583, 40059, 104921, 678, 3650, 61924, 2060, 26818, 34735, 4568, 22288, 4369, 8439, 36880...

[ 0.1680908203125, 0.1287841796875, 0.226318359375, 0.1407470703125, 0.24658203125, 0.03729248046875, 0.1282958984375, 0.1549072265625, 0.005615234375, 0.10015869140625, 0.2041015625, 0.1356201171875, 0.06072998046875, 0.1883544921875, 0.061279296875, 0.109619140625, 0.06109619140625, ...

embed

40028933_c0

40028933

haskell

0

Title: Can I use Haskell's stack to compile and run _only_ the tests? Problem title: Can I use Haskell's stack to compile and run _only_ the tests? Tags: haskell-stack, haskell Problem: Can I use Haskell's stack to compile and run _only_ the tests? When I run a stack test or a stack test <package>:<test-suite...

Can I use Haskell's stack to compile and run _only_ the tests? Can I use Haskell's stack to compile and run _only_ the tests? haskell-stack haskell Can Haskell _only_ Can I use Haskell's stack to compile and run _only_ the tests? When I run a stack test or a stack test <package>:<test-suite> then the output l...

[ 0.00286865234375, 0.00994873046875, 0.00396728515625, -0.00897216796875, -0.005828857421875, 0.0096435546875, 0.0011138916015625, -0.00186920166015625, 0.006683349609375, 0.006072998046875, -0.00628662109375, 0.0023040771484375, 0.004364013671875, 0.0272216796875, 0, 0.01416015625, -...

[ 4171, 4527, 20625, 142508, 3768, 177261, 9969, 1340, 11675, 191, 538, 109921, 1556, 590, 2594, 70, 3034, 29102, 6954, 68879, 140992, 33342, 1884, 198343, 49725, 756, 65572, 186351, 24145, 97733, 25474, 17932, 1733, 75101, 4210, 27489, 49938, ...

[ 0.053314208984375, 0.0980224609375, 0.10052490234375, 0.2186279296875, 0.029388427734375, 0.2286376953125, 0.1474609375, 0.1336669921875, 0.1175537109375, 0.123291015625, 0.1234130859375, 0.2396240234375, 0.06988525390625, 0.07861328125, 0.07440185546875, 0.0062255859375, 0.203125, ...

embed

53950520_c0

53950520

haskell

0

Title: Playing random note durations with Euterpea / Haskell Problem title: Playing random note durations with Euterpea / Haskell Tags: euterpea, haskell Problem: Playing random note durations with Euterpea / Haskell I'm just getting started with Euterpea / Haskell, and I am trying to write a simple script that randomi...

Playing random note durations with Euterpea / Haskell Playing random note durations with Euterpea / Haskell euterpea haskell Euterpea System.Random Playing Haskell Playing random note durations with Euterpea / Haskell I'm just getting started with Euterpea / Haskell, and I am trying to write a simple script that random...

[ -0.009033203125, 0.0120849609375, 0.00433349609375, 0.002105712890625, 0.00185394287109375, 0.00457763671875, 0.0031890869140625, -0.01275634765625, -0.0111083984375, -0.052734375, -0.00124359130859375, 0.01324462890625, -0.0021514892578125, -0.0024566650390625, -0.01214599609375, 0.01...

[ 11356, 96759, 20537, 21025, 5256, 678, 5177, 720, 29518, 248, 20625, 142508, 25208, 1556, 12353, 126525, 3815, 214, 20949, 26859, 31577, 33022, 8781, 26499, 20650, 54397, 903, 43240, 12301, 48738, 4390, 10557, 17137, 76228, 2844, 160328, 46258,...

[ 0.1275634765625, 0.2183837890625, 0.191162109375, 0.1611328125, 0.060882568359375, 0.069091796875, 0.0753173828125, 0.1444091796875, 0.2236328125, 0.013336181640625, 0.128173828125, 0.2269287109375, 0.10711669921875, 0.10186767578125, 0.12646484375, 0.10479736328125, 0.1348876953125,...

embed

41927624_c0

41927624

haskell

0

Title: Matching expected type with actual type Problem title: Matching expected type with actual type Tags: types, haskell, typeclass Problem: Matching expected type with actual type What I am currently trying to do is create a type called Value : data Value = Num Int | Sum Int Int | Dif Int Int | Neg Int deriving (Eq)...

Matching expected type with actual type Matching expected type with actual type types haskell typeclass Matching Value Num Sum Dif Neg Matching expected type with actual type What I am currently trying to do is create a type called Value : With which I want to implement an eval function: My expected results should be: ...

[ -0.01397705078125, 0.0022735595703125, 0.02099609375, 0.0162353515625, -0.006072998046875, 0.0185546875, -0.00927734375, -0.000583648681640625, 0.01129150390625, 0.011474609375, -0.01068115234375, -0.0201416015625, -0.0002193450927734375, -0.0189208984375, -0.008544921875, 0.0043640136...

[ 67407, 214, 84751, 10644, 678, 8561, 52895, 1556, 142508, 67413, 190060, 52782, 36335, 803, 420, 799, 177, 82424, 31577, 28282, 17106, 3444, 29479, 28, 1405, 32354, 50339, 43581, 18151, 19048, 3034, 12638, 39933, 61261, 2967, 187, 9790, 51339...

[ 0.2041015625, 0.0697021484375, 0.2005615234375, 0.2298583984375, 0.1204833984375, 0.1854248046875, 0.182861328125, 0.1328125, 0.202880859375, 0.177734375, 0.2122802734375, 0.07177734375, 0.1319580078125, 0.10211181640625, 0.0970458984375, 0.084228515625, 0.109619140625, 0.002197265...

embed

58050250_c1

58050250

haskell

1

<|> (Parser g) = Parser $ \inp -> case f inp of Nothing -> g inp Just r -> Just r some p = (:) <$> p <*> (some p <|> pure []) instance Monad Parser where (Parser f) >>= g = Parser $ \inp -> case f inp of Nothing -> Nothing Just (a, inp') -> runParser (g a) inp' satisfy p = Parser $ \case (x:xs) | p x -> Just (x, xs) _...

[ 0.0040283203125, 0.0255126953125, 0.0018768310546875, 0.00933837890625, -0.005096435546875, 0.0260009765625, -0.0093994140625, -0.02490234375, 0.01611328125, 0.00095367431640625, 0.01116943359375, -0.004608154296875, -0.005279541015625, -0.00982666015625, -0.0078125, -0.001502990722656...

[ 58745, 28636, 2189, 706, 2203, 2392, 3650, 73, 254, 7225, 1238, 23, 111, 182747, 9563, 1690, 33079, 3060, 915, 12, 43452, 34166, 110527, 60331, 71, 11675, 177, 10, 40407, 58437, 425, 1022, 21441, 21656, 501, 79315, 23351, 4439, 20763, 306...

[ 0.051605224609375, 0.2052001953125, 0.218017578125, 0.1636962890625, 0.053955078125, 0.191162109375, 0.086181640625, 0.0853271484375, 0.1220703125, 0.1539306640625, 0.1302490234375, 0.0997314453125, 0.0875244140625, 0.1485595703125, 0.119140625, 0.0848388671875, 0.016937255859375, ...

embed

45228875_c0

45228875

haskell

0

Title: Haskell image processing library - hip - readImageExact OK, readImage compile error Problem title: Haskell image processing library - hip - readImageExact OK, readImage compile error Tags: image-processing, haskell Problem: Haskell image processing library - hip - readImageExact OK, readImage compile error I am ...

Haskell image processing library - hip - readImageExact OK, readImage compile error Haskell image processing library - hip - readImageExact OK, readImage compile error image-processing haskell Graphics.Image Graphics.Image.IO a Haskell BasicImage Image YCbCr Word8 JPG frog.jpg Readable InputFormat Haskell image process...

[ -0.006134033203125, -0.00396728515625, -0.00439453125, 0.02880859375, 0.0087890625, 0.032958984375, -0.0048828125, -0.0050048828125, -0.00750732421875, -0.0201416015625, 0.005584716796875, -0.01611328125, 0.004730224609375, -0.0147705078125, 0.003875732421875, -0.0191650390625, -0.00...

[ 20625, 142508, 29569, 9433, 35773, 26177, 12301, 216960, 19279, 47013, 14315, 9969, 1340, 18499, 63923, 1556, 189682, 17780, 91692, 22710, 990, 42, 22543, 1019, 124906, 211209, 25687, 4764, 2886, 102973, 214, 198932, 177261, 96, 933, 17376, 374...

[ 0.141845703125, 0.228271484375, 0.1322021484375, 0.0936279296875, 0.1806640625, 0.205322265625, 0.2091064453125, 0.25048828125, 0.1365966796875, 0.201416015625, 0.142333984375, 0.1636962890625, 0.1566162109375, 0.169921875, 0.0972900390625, 0.11279296875, 0.1214599609375, 0.1168212...

embed

77255208_c1

77255208

haskell

1

ToYao Char where type YaoType Char = Yao toYao c | c `elem` ['0', '1'] = Right $ Yao c | otherwise = Left "Yao can only be '0' or '1'" instance ToYao Value where type YaoType Value = (Yao, Yao) toYao v | v == Value '6' = toYao ('0','1') | v == Value '7' = toYao ('1','1') | v == Value '8' = toYao ('0','0') | v == Value...

[ -0.0013885498046875, -0.0191650390625, 0.02001953125, 0.01312255859375, -0.0118408203125, 0.000659942626953125, 0.004364013671875, -0.01202392578125, 0.0093994140625, 0.028564453125, -0.00128936767578125, -0.0267333984375, 0.0023651123046875, -0.01068115234375, -0.01953125, -0.015625, ...

[ 717, 21566, 31, 21656, 7440, 10644, 2369, 196707, 2203, 47, 501, 6, 27889, 1135, 25, 2389, 4, 242, 418, 268, 90911, 3650, 120262, 636, 2480, 831, 4734, 186, 707, 58, 110527, 190060, 16, 81, 69112, 910, 15, 58745, 966, 1019, 1126, 903,...

[ 0.2376708984375, 0.291015625, 0.221435546875, 0.2215576171875, 0.0848388671875, 0.2205810546875, 0.2186279296875, 0.27001953125, 0.044708251953125, 0.2117919921875, 0.061309814453125, 0.012939453125, 0.1510009765625, 0.011962890625, 0.012847900390625, 0.1669921875, 0.0163116455078125...

embed

9270899_c0

9270899

haskell

0

Title: How to use UndecidableInstances locally? Problem title: How to use UndecidableInstances locally? Tags: type-systems, termination, haskell, ghc, typeclass Problem: How to use UndecidableInstances locally? Yes, I know that UndecidableInstances can be bad. I really tried hard to design my module so that it doesn't ...

How to use UndecidableInstances locally? How to use UndecidableInstances locally? type-systems termination haskell ghc typeclass How UndecidableInstances Foo Bar How to use UndecidableInstances locally? Yes, I know that UndecidableInstances can be bad. I really tried hard to design my module so that it doesn't need it ...

[ 0.0230712890625, 0.020263671875, 0.0072021484375, -0.007720947265625, 0.002349853515625, 0.008056640625, 0.005126953125, -0.002044677734375, 0.00799560546875, -0.034423828125, -0.0172119140625, -0.027099609375, 0.025634765625, 0.03271484375, 0.0164794921875, -0.01483154296875, 0.0151...

[ 11249, 4527, 79912, 24750, 2661, 4153, 116071, 7, 4000, 538, 47, 10644, 16751, 29527, 1556, 142508, 31380, 238, 67413, 9572, 31, 3253, 3714, 831, 186, 6494, 37842, 7941, 4331, 88996, 3871, 151134, 61687, 50697, 56786, 8306, 40956, 11, 79298...

[ 0.072509765625, 0.152099609375, 0.115478515625, 0.1871337890625, 0.1732177734375, 0.09423828125, 0.21435546875, 0.06951904296875, 0.1640625, 0.077880859375, 0.012481689453125, 0.123046875, 0.1033935546875, 0.1466064453125, 0.0531005859375, 0.1524658203125, 0.040191650390625, 0.0314...

embed

33336722_c0

33336722

haskell

0

Title: Monad facade for a MonadState in Haskell Problem title: Monad facade for a MonadState in Haskell Tags: monad-transformers, state-monad, facade, haskell Problem: Monad facade for a MonadState in Haskell Background: I'm creating a game with a stateful monad for reading and writing changes to the global state of th...

Monad facade for a MonadState in Haskell Monad facade for a MonadState in Haskell monad-transformers state-monad facade haskell Monad MonadState Haskell Character World Monad facade for a MonadState in Haskell Background: I'm creating a game with a stateful monad for reading and writing changes to the global state of t...

[ -0.00787353515625, -0.00051116943359375, -0.01318359375, -0.007476806640625, 0.0128173828125, -0.00860595703125, -0.0179443359375, -0.01318359375, 0.005828857421875, -0.0284423828125, 0.0030059814453125, 0.004180908203125, -0.01434326171875, 0.01531982421875, -0.0196533203125, -0.01843...

[ 60331, 71, 49304, 112, 100, 135206, 13, 23, 20625, 142508, 2667, 712, 215175, 1314, 11341, 3796, 1556, 21656, 2263, 6661, 10, 64330, 105233, 6712, 7844, 16454, 32562, 65572, 7964, 2806, 1884, 101637, 82761, 84068, 101904, 77758, 29458, 3917, ...

[ 0.2255859375, 0.1849365234375, 0.239990234375, 0.1282958984375, 0.0814208984375, 0.2198486328125, 0.0791015625, 0.07098388671875, 0.16259765625, 0.263427734375, 0.1514892578125, 0.193115234375, 0.214599609375, 0.10369873046875, 0.1826171875, 0.10638427734375, 0.11279296875, 0.06665...

embed

70347620_c1

70347620

haskell

1

ATGTGATTAAGGTCTAAGGTATGTCTTCCACCAGACAACGGACACAGTCAATTAGAAGCTGGGTAAAGGGGTCTCTCCTGCGGAGCGGGGAGCGCCAAGCCAGGGACAATAATGGCCTGAAGTTCATTCTCCCGGAGATGGGGGTAGAAGCAGGTGCAGGTGCCTTAGAGGGGTCAAAAATAAGAGGAACAGGGTTCACTCTAAGCGGTCTCCCAGGGAAGGCTGCGGGTTGGAGCAAGGGTCCAAGATTCTAAGGGCCAGGACTCAGCTCCAGAAGCTCGATCCCGCCCCACGCGTTCCTGCTCCGGCCAGGGGAGGGG...

[ 0.0010223388671875, 0.00909423828125, 0.007476806640625, 0.00179290771484375, 0.01397705078125, 0.015869140625, 0.0019683837890625, 0.0084228515625, 0.0185546875, -0.0133056640625, 0.0145263671875, -0.0018768310546875, 0.00142669677734375, -0.00147247314453125, 0.01434326171875, 0.0056...

[ 17672, 37315, 132819, 7783, 127489, 96481, 35979, 46754, 23613, 56367, 69657, 13133, 13709, 618, 14849, 98062, 20499, 134982, 113438, 13739, 15467, 724, 84161, 43379, 284, 441, 15012, 85955, 127673, 2646, 92814, 759, 103510, 14858, 214, 56050, ...

[ 0.04656982421875, 0.0635986328125, 0.048187255859375, 0.034912109375, 0.0292205810546875, 0.051177978515625, 0.0295867919921875, 0.013092041015625, 0.001556396484375, 0.001220703125, 0.001251220703125, 0.001251220703125, 0.091796875, 0.00067138671875, 0.00128173828125, 0.00213623046875...

embed

71950562_c0

71950562

haskell

0

Title: How to define overlappable depending instances? Problem title: How to define overlappable depending instances? Tags: derivingvia, haskell Problem: How to define overlappable depending instances? So I have a typeclass somewhat like this class Stringify x where stringify :: x -> String and I have two other typecla...

How to define overlappable depending instances? How to define overlappable depending instances? derivingvia haskell How Stringify LTextify L.Text Textify T.Text L.unpack T.unpack How to define overlappable depending instances? So I have a typeclass somewhat like this and I have two other typeclasses somewhat like those...

[ 0.00897216796875, -0.0115966796875, -0.010986328125, 0.0030670166015625, 0.0035400390625, 0.00787353515625, -0.00439453125, -0.00457763671875, 0.007781982421875, -0.00057220458984375, -0.01300048828125, -0.0191650390625, 0.024658203125, 0.01141357421875, -0.007415771484375, 0.008789062...

[ 11249, 61924, 645, 143, 6366, 2886, 8, 96819, 110527, 47, 16406, 6496, 3459, 1556, 142508, 23351, 214, 40383, 339, 174379, 24129, 384, 309, 29102, 10644, 67413, 208806, 1884, 903, 6626, 108750, 186992, 693, 52721, 67, 21635, 29568, 75169, 1...

[ 0.04693603515625, 0.1915283203125, 0.1490478515625, 0.2025146484375, 0.176025390625, 0.18798828125, 0.1182861328125, 0.224609375, 0.241455078125, 0.000457763671875, 0.06298828125, 0.04833984375, 0.1025390625, 0.08251953125, 0.187255859375, 0.097412109375, 0.05450439453125, 0.189819...

embed

45941163_c0

45941163

haskell

0

Title: Haskell FFI - return updated structure Problem title: Haskell FFI - return updated structure Tags: haskell, c2hs, haskell-ffi Problem: Haskell FFI - return updated structure I have the following C function that I want to call from Haskell : void read_params_for (property_list_t *props); The function is supposed ...

Haskell FFI - return updated structure Haskell FFI - return updated structure haskell c2hs haskell-ffi ccall Haskell FFI read_params_for property_list_t Storable ForeignPtr PropertyListT C2HS Ptr Haskell FFI - return updated structure I have the following C function that I want to call from Haskell : The function is su...

[ 0.013916015625, 0.02685546875, -0.0050048828125, -0.00836181640625, 0.0019989013671875, 0.010498046875, 0.003631591796875, -0.0277099609375, -0.0155029296875, 0.0030670166015625, 0.028564453125, -0.0230712890625, -0.00811767578125, -0.0181884765625, 0.0140380859375, -0.01214599609375, ...

[ 20625, 142508, 563, 22724, 30646, 150011, 45646, 1556, 304, 127, 24500, 501, 85763, 12301, 2500, 8256, 57266, 6562, 23604, 2886, 184293, 4448, 206984, 154663, 618, 313, 38131, 436, 25632, 32354, 3444, 11782, 1295, 134598, 53299, 18, 27623, 14...

[ 0.1400146484375, 0.236083984375, 0.0960693359375, 0.2491455078125, 0.174072265625, 0.1883544921875, 0.239501953125, 0.12890625, 0.122802734375, 0.07666015625, 0.183349609375, 0.00006103515625, 0.150634765625, 0.13134765625, 0.06988525390625, 0.092041015625, 0.171630859375, 0.160278...

embed

77968904_c1

77968904

haskell

1

0..] l where { e (u, v) = if mod u 2 == 0 then v else -v } search :: [Int] -> String search l = if c then "YES\n" else "NO\n" where { b = zip l $ tail l; c = any (\(x, y) -> x == y) b; } solution :: [Int] -> String solution = search.sort.flock.floss des :: IO String des = do io <- readInts let t = head io all_data <- s...

[ -0.01043701171875, 0.0223388671875, 0.007232666015625, -0.0029449462890625, -0.00164794921875, -0.0003261566162109375, -0.01263427734375, 0.00592041015625, 0.00897216796875, -0.01220703125, 0.007293701171875, -0.019287109375, 0.0194091796875, 0.0186767578125, -0.0089111328125, -0.00619...

[ 757, 5, 268, 96, 7440, 28, 34, 81, 2174, 2811, 75, 116, 69112, 7068, 37076, 334, 33938, 1984, 4153, 18, 33079, 23351, 214, 2203, 501, 46445, 294, 8575, 876, 68330, 3650, 46741, 2499, 425, 113, 1022, 29806, 62351, 420, 21135, 52347, 7,...

[ 0.1829833984375, 0.039093017578125, 0.002716064453125, 0.151611328125, 0.02117919921875, 0.1090087890625, 0.1253662109375, 0.1895751953125, 0.033721923828125, 0.191650390625, 0.160400390625, 0.103515625, 0.0628662109375, 0.00885009765625, 0.102783203125, 0.188720703125, 0.23352050781...

embed

31729752_c0

31729752

haskell

0

Title: How to use unless (or when) in an Esqueleto query? Problem title: How to use unless (or when) in an Esqueleto query? Tags: esqueleto, haskell, sql Problem: How to use unless (or when) in an Esqueleto query? I build a query that joins a few tables and restricts the result further unless one field called IncludeAl...

How to use unless (or when) in an Esqueleto query? How to use unless (or when) in an Esqueleto query? esqueleto haskell sql $ How Esqueleto IncludeAll where_ AId BField1 AField2 CField1 AField3 BIncludeAll BField2 CField2 Bool Database.Esqueleto.Internal.Language.Value Value SqlExpr How to use unless (or when) in an Es...

[ -0.0272216796875, 0.0087890625, 0.0142822265625, 0.0003662109375, 0.0047607421875, 0.01129150390625, 0.0005645751953125, -0.00946044921875, -0.01507568359375, -0.0169677734375, 0.0208740234375, 0.01416015625, 0.0029754638671875, -0.005645751953125, -0.00921630859375, 0.01165771484375, ...

[ 11249, 4527, 117934, 748, 3229, 1184, 37631, 31580, 41, 1294, 23, 66660, 133, 188, 1556, 142508, 99247, 8942, 822, 112, 43512, 7440, 38730, 6159, 19388, 363, 29786, 929, 187781, 10393, 856, 50770, 190060, 19279, 10287, 45367, 33284, 23180, ...

[ 0.0439453125, 0.1522216796875, 0.322021484375, 0.155029296875, 0.2327880859375, 0.05810546875, 0.1485595703125, 0.228271484375, 0.1270751953125, 0.11767578125, 0.008544921875, 0.1002197265625, 0.14111328125, 0.134033203125, 0.0369873046875, 0.1629638671875, 0.1339111328125, 0.07586...

embed

17207566_c0

17207566

haskell

0

Title: How can I have a pipe with multiple communication types? Problem title: How can I have a pipe with multiple communication types? Tags: haskell, haskell-pipes Problem: How can I have a pipe with multiple communication types? Say I have this code: import Control.Monad.State hiding (StateT) import Control.Proxy ser...

How can I have a pipe with multiple communication types? How can I have a pipe with multiple communication types? haskell haskell-pipes Control.Monad.State Control.Proxy How StateT Proxy Monad Server Bool Client Either How can I have a pipe with multiple communication types? Say I have this code: Currently the client a...

[ 0.003936767578125, 0.00445556640625, -0.025390625, 0.0179443359375, -0.023681640625, -0.00174713134765625, -0.0341796875, -0.0191650390625, 0.005401611328125, -0.0181884765625, -0.0016021728515625, -0.0029754638671875, 0.0322265625, 0.015869140625, -0.000576019287109375, 0.011352539062...

[ 11249, 831, 765, 137158, 678, 48716, 36398, 52895, 10, 1556, 142508, 1434, 13569, 27131, 46674, 712, 135206, 10752, 50878, 22836, 618, 1250, 60331, 71, 22687, 2460, 929, 91732, 9319, 87, 18151, 114063, 23282, 11343, 25379, 360, 18, 53299, 3...

[ 0.0791015625, 0.06365966796875, 0.1278076171875, 0.25634765625, 0.0865478515625, 0.226806640625, 0.2320556640625, 0.2242431640625, 0.0267791748046875, 0.0802001953125, 0.1868896484375, 0.1248779296875, 0.06182861328125, 0.1551513671875, 0.0701904296875, 0.1016845703125, 0.04962158203...

embed

41069249_c2

41069249

haskell

2

lVUQ", "scope" : "GOOGLE", "types" : [ "bowling_alley", "bakery", "lodging", "restaurant", "food", "store", "point_of_interest", "establishment" ], "vicinity" : "проспект Михаила Нагибина, 19, Ростов-на-Дону" }, / more items here "status" : "ok" } I created data for representing JSON: data Restaurant = Restaurant {stat...

[ -0.0181884765625, 0.011962890625, -0.003082275390625, -0.0096435546875, 0.01251220703125, 0.030517578125, 0.000797271728515625, -0.03076171875, 0.0208740234375, 0.005462646484375, 0.006195068359375, -0.0054931640625, -0.0037994384765625, -0.01708984375, -0.01251220703125, -0.0085449218...

[ 96, 51947, 2737, 70820, 19930, 670, 126833, 50986, 84201, 2069, 13474, 53, 10075, 26976, 61488, 9966, 173874, 49558, 45804, 38496, 50171, 29511, 15227, 54731, 19, 2481, 7044, 53940, 65960, 672, 3281, 82470, 17846, 148484, 212, 205407, 55769, ...

[ 0.0115966796875, 0.1507568359375, 0.137451171875, 0.140380859375, 0.0207977294921875, 0.054351806640625, 0.10552978515625, 0.1510009765625, 0.08282470703125, 0.150390625, 0.11669921875, 0.06536865234375, 0.0643310546875, 0.1209716796875, 0.1015625, 0.130615234375, 0.2103271484375, ...

embed

76067567_c0

76067567

haskell

0

Title: What is the utility of this kind of implementation of data structures using functions? Problem title: What is the utility of this kind of implementation of data structures using functions? Tags: haskell Problem: What is the utility of this kind of implementation of data structures using functions? I'm implementi...

What is the utility of this kind of implementation of data structures using functions? What is the utility of this kind of implementation of data structures using functions? haskell functions What Bool Set _combine What is the utility of this kind of implementation of data structures using functions? I'm implementing a...

[ -0.000156402587890625, 0.0250244140625, 0.0189208984375, 0.0111083984375, -0.0026092529296875, 0.00173187255859375, 0.00921630859375, -0.01171875, 0.0155029296875, -0.00762939453125, -0.01251220703125, 0.0079345703125, 0.00115203857421875, -0.006072998046875, -0.008056640625, 0.0077514...

[ 4865, 83, 19537, 939, 111, 903, 8562, 208124, 2053, 45646, 17368, 32354, 7, 1556, 142508, 2460, 929, 19943, 277, 46187, 70, 29479, 10644, 10, 18151, 2060, 831, 18, 200103, 5423, 6097, 52895, 80234, 4527, 7225, 154186, 678, 5303 ]

[ 0.0697021484375, 0.062255859375, 0.19921875, 0.1424560546875, 0.026702880859375, 0.109375, 0.1551513671875, 0.175537109375, 0.1070556640625, 0.2098388671875, 0.09735107421875, 0.2318115234375, 0.0572509765625, 0.1173095703125, 0.220703125, 0.1220703125, 0.2227783203125, 0.209838867...

embed

26792397_c0

26792397

haskell

0

Title: Haskell recursive nextWord function Problem title: Haskell recursive nextWord function Tags: haskell, recursion Problem: Haskell recursive nextWord function I wanted to implement a function nextWord which given a list of characters s (i.e. a String ) returns a pair consisiting of the next word in s and the remai...

Haskell recursive nextWord function Haskell recursive nextWord function haskell recursion Haskell next:rest Haskell recursive nextWord function I wanted to implement a function nextWord which given a list of characters s (i.e. a String ) returns a pair consisiting of the next word in s and the remaining characters in s...

[ -0.004791259765625, 0.005645751953125, 0.01092529296875, 0.037109375, -0.0029144287109375, 0.0189208984375, -0.000713348388671875, -0.008544921875, 0.0107421875, 0.003936767578125, 0.0291748046875, -0.0133056640625, -0.0126953125, -0.0033416748046875, -0.0146484375, 0.0019378662109375,...

[ 20625, 142508, 195625, 5844, 11737, 164805, 32354, 1556, 56644, 36663, 29479, 34475, 5303, 124850, 91, 23351, 214, 30646, 80836, 56493, 1916, 2565, 47143, 7103, 5117, 184750, 18499, 89914, 29806, 102337, 6492, 107777, 43240, 169123, 15400, 15935,...

[ 0.0928955078125, 0.184814453125, 0.178955078125, 0.097412109375, 0.188720703125, 0.2314453125, 0.1837158203125, 0.09375, 0.19677734375, 0.021636962890625, 0.109375, 0.0177001953125, 0.1044921875, 0.122802734375, 0.1143798828125, 0.0997314453125, 0.08856201171875, 0.1385498046875, ...

embed

47560058_c0

47560058

haskell

0

Title: Trapezoid Rule in Haskell Problem title: Trapezoid Rule in Haskell Tags: haskell, integration Problem: Trapezoid Rule in Haskell I'm trying to define the trapezoid rule in Haskell. I created a helper function innerSum, which is sum portion of the trapezoid rule. Then in the integral definition I multiple by the ...

Trapezoid Rule in Haskell Trapezoid Rule in Haskell haskell integration Trapezoid Rule Haskell Double Integer n::Double Trapezoid Rule in Haskell I'm trying to define the trapezoid rule in Haskell. I created a helper function innerSum, which is sum portion of the trapezoid rule. Then in the integral definition I multip...

[ -0.0101318359375, 0.0107421875, -0.0068359375, 0.0118408203125, -0.00147247314453125, 0.00341796875, -0.007171630859375, -0.0157470703125, 0.00017642974853515625, 0.006988525390625, -0.00537109375, 0.001708984375, -0.00927734375, 0.00909423828125, 0.03173828125, 0.02490234375, 0.0128...

[ 4937, 1081, 1158, 532, 139118, 20625, 142508, 23, 1556, 157353, 107172, 44401, 653, 8331, 34, 2661, 31577, 61924, 63819, 1255, 48899, 79986, 75935, 4358, 56, 32354, 75414, 294, 316, 10554, 126826, 28970, 80934, 48716, 62488, 5646, 92319, 9909...

[ 0.1358642578125, 0.11376953125, 0.1689453125, 0.11181640625, 0.236572265625, 0.1663818359375, 0.27197265625, 0.036956787109375, 0.156982421875, 0.2137451171875, 0.130615234375, 0.206787109375, 0.0975341796875, 0.012451171875, 0.0567626953125, 0.0733642578125, 0.019500732421875, 0.1...

embed

26146870_c0

26146870

haskell

0

Title: Idiomatic way to share lens field definitions among modules Problem title: Idiomatic way to share lens field definitions among modules Tags: haskell-lens, haskell Problem: Idiomatic way to share lens field definitions among modules If I have two modules that both use Control.Lens.TH ' makeFields to generate fiel...

Idiomatic way to share lens field definitions among modules Idiomatic way to share lens field definitions among modules haskell-lens haskell Control.Lens First Second Idiomatic Control.Lens.TH HasName SharedFields Bool Read Show Third Idiomatic way to share lens field definitions among modules If I have two modules tha...

[ -0.00145721435546875, 0.0002346038818359375, -0.01312255859375, 0.01458740234375, 0.00860595703125, 0.01080322265625, 0.01458740234375, -0.0240478515625, 0.006134033203125, -0.0201416015625, 0.005218505859375, 0.02734375, 0.001739501953125, -0.0128173828125, 0.0140380859375, 0.00601196...

[ 5670, 47148, 3917, 12008, 3098, 7, 44457, 80934, 54940, 88996, 1556, 142508, 1977, 27131, 866, 1755, 77648, 23415, 20625, 163612, 29790, 6159, 19388, 2460, 929, 4764, 17367, 198387, 6626, 15044, 3249, 139392, 17164, 12921, 5701, 9351, 2965, 1...

[ 0.1419677734375, 0.1258544921875, 0.059112548828125, 0.2242431640625, 0.20654296875, 0.107177734375, 0.2420654296875, 0.1898193359375, 0.1492919921875, 0.2109375, 0.1058349609375, 0.216064453125, 0.16357421875, 0.1817626953125, 0.1181640625, 0.1719970703125, 0.015777587890625, 0.13...

embed

27569283_c1

27569283

haskell

1

,SongChord) let (mbsctext, sc) = fromScf scf mbscid = fromPathPiece mbsctext :: Maybe (Key SongChord) sck <- case mbscid of Nothing -> do runDB $ insert sc Just sc_id -> do -- runDB $ insert sc -- here's the problem! runDB $ replace sc_id sc defaultLayout $ [whamlet| <h1> #{show mbscid} <br> #{show sck} <br> #{show scf...

[ -0.01043701171875, 0.0162353515625, 0.013916015625, -0.0238037109375, -0.00054931640625, 0.015380859375, -0.0274658203125, -0.029052734375, -0.0032958984375, -0.0140380859375, -0.0010833740234375, -0.004180908203125, 0.00201416015625, -0.017333984375, -0.00677490234375, 0.0051879882812...

[ 4, 294, 4021, 15982, 6651, 2633, 6492, 10382, 22829, 9023, 2203, 1295, 67466, 420, 39369, 7, 55964, 683, 10519, 111242, 83425, 162429, 5986, 91, 2594, 7225, 111, 182747, 11675, 39463, 3650, 183540, 532, 3688, 2967, 91995, 454, 114977, 53, ...

[ 0.01104736328125, 0.012664794921875, 0.1544189453125, 0.11572265625, 0.1824951171875, 0.0963134765625, 0.05743408203125, 0.0830078125, 0.2327880859375, 0.1827392578125, 0.007049560546875, 0.124267578125, 0.184326171875, 0.16015625, 0.1126708984375, 0.05853271484375, 0.2568359375, 0...

embed

69236252_c0

69236252

haskell

0

Title: A kind of sliding window Problem title: A kind of sliding window Tags: haskell, sliding-window Problem: A kind of sliding window This function comes from some code to calculate convolutions of finite sequences. window n k = [ drop (i-k) $ take i $ [1..n] | i <- [1..(n+k)-1] ] *Main> window 4 6 [[1],[1,2],[1,2,3]...

A kind of sliding window A kind of sliding window haskell sliding-window Main Prelude A kind of sliding window This function comes from some code to calculate convolutions of finite sequences. It's sliding window of length k over a sequence of length n , where k can be larger than n . The code calls take and drop on th...

[ -0.015869140625, 0.023681640625, 0.012451171875, -0.0172119140625, -0.0269775390625, 0.01171875, -0.0186767578125, -0.0123291015625, 0.008056640625, -0.02197265625, 0.002655029296875, -0.01611328125, 0.01177978515625, 0.0264892578125, -0.005279541015625, 0.00787353515625, 0.014038085...

[ 62, 8562, 132692, 214, 76896, 111, 1556, 142508, 9494, 24293, 12321, 822, 3293, 32354, 32497, 1295, 18151, 47, 74481, 158, 137089, 94418, 13, 40, 26513, 5170, 140909, 472, 645, 944, 653, 831, 150679, 11782, 5646, 136, 36069, 31344, 5303, ...

[ 0.06634521484375, 0.193359375, 0.2291259765625, 0.134033203125, 0.255859375, 0.05511474609375, 0.1312255859375, 0.2470703125, 0.1488037109375, 0.1617431640625, 0.006134033203125, 0.049957275390625, 0.021484375, 0.196044921875, 0.0697021484375, 0.0290985107421875, 0.1668701171875, 0...

embed

5467890_c0

5467890

haskell

0

Title: IO in where clause Problem title: IO in where clause Tags: io, monads, haskell Problem: IO in where clause I thought I was beginning to understand IO in Haskell until I ran into the following problem. I have the following function, which returns type IO Float: getFundPrice :: Int -> Int -> IO Float getFundPrice ...

IO in where clause IO in where clause io monads haskell Float Shares Period Fund IO in where clause I thought I was beginning to understand IO in Haskell until I ran into the following problem. I have the following function, which returns type IO Float: The function getFundPrice' uses the takusen database library and r...

[ 0.003692626953125, 0.0130615234375, -0.012939453125, -0.017578125, -0.0179443359375, 0.00091552734375, -0.010498046875, -0.0098876953125, 0.0211181640625, -0.0146484375, 0.01434326171875, -0.0150146484375, -0.00023555755615234375, -0.04150390625, 0.00311279296875, 0.015625, -0.009094...

[ 17780, 23, 7440, 70731, 13, 22995, 2667, 712, 1556, 142508, 38699, 257, 29790, 92329, 32897, 17569, 86595, 28219, 20625, 2967, 25632, 32354, 30646, 10644, 2046, 919, 7030, 33163, 329, 4527, 466, 223, 33, 63399, 35773, 5303, 365, 65771, 3034...

[ 0.251708984375, 0.0848388671875, 0.195556640625, 0.17431640625, 0.07720947265625, 0.19775390625, 0.04522705078125, 0.060760498046875, 0.1019287109375, 0.2220458984375, 0.196044921875, 0.1273193359375, 0.1026611328125, 0.115478515625, 0.187255859375, 0.07879638671875, 0.01318359375, ...

embed

40620913_c0

40620913

haskell

0

Title: Why do We Need Sum Types? Problem title: Why do We Need Sum Types? Tags: haskell, type-theory Problem: Why do We Need Sum Types? Imagine a language which doesn't allow multiple value constructors for a data type. Instead of writing data Color = White | Black | Blue we would have data White = White data Black = B...

Why do We Need Sum Types? Why do We Need Sum Types? haskell type-theory Why Need Sum Types Color White Black Blue ColorsStartingWithB Nil Cons List Why do We Need Sum Types? Imagine a language which doesn't allow multiple value constructors for a data type. Instead of writing we would have where :|: (here it's not | to...

[ -0.01202392578125, -0.000461578369140625, -0.00092315673828125, 0.005615234375, -0.0220947265625, -0.004364013671875, -0.024169921875, 0.005035400390625, 0.00567626953125, 0.000759124755859375, -0.00750732421875, -0.033203125, 0.013671875, 0.01104736328125, 0, 0.01300048828125, 0.023...

[ 44084, 54, 1401, 52889, 36335, 60457, 7, 1556, 142508, 10644, 2347, 30675, 51193, 22392, 10074, 22928, 126597, 194583, 571, 77175, 39215, 32036, 133196, 46876, 22027, 18, 63769, 48716, 34292, 64549, 25251, 2053, 175399, 32562, 2806, 7440, 959, ...

[ 0.1497802734375, 0.049072265625, 0.0780029296875, 0.1998291015625, 0.2498779296875, 0.29541015625, 0.102294921875, 0.09588623046875, 0.2132568359375, 0.208984375, 0.0516357421875, 0.0225677490234375, 0.18505859375, 0.131103515625, 0.1173095703125, 0.1248779296875, 0.03839111328125, ...

embed

7732243_c0

7732243

haskell

0

Title: Haskell: Remove largest list Problem title: Haskell: Remove largest list Tags: list, haskell Problem: Haskell: Remove largest list I have a list of lists, and a function that returns the list with the most items: extract ::[Plateau]->Plateau extract(x:xs) |x==maximumBy(compare `on` length)(x:xs)=x |otherwise = e...

Haskell: Remove largest list Haskell: Remove largest list list haskell Haskell Remove Plateau x:xs Haskell: Remove largest list I have a list of lists, and a function that returns the list with the most items: Now I need a function to take the same [Plateau] and return a new [Plateau] that has the previous largest remo...

[ -0.00823974609375, 0.0242919921875, 0.007110595703125, 0.01324462890625, -0.0036163330078125, 0.0130615234375, 0.005218505859375, -0.01446533203125, 0.027099609375, 0.020751953125, 0.010498046875, 0.010498046875, 0.01251220703125, -0.0101318359375, 0.00970458984375, 0.00433349609375, ...

[ 20625, 142508, 181139, 142105, 5303, 1556, 22387, 8918, 1022, 425, 32354, 30646, 678, 2684, 55769, 3871, 5646, 5701, 117231, 3525, 96362, 184750, 11782, 25230, 86, 12096, 75358, 4568, 4488, 26785, 32036, 37385, 6287, 33342, 1884, 3688, 442, 1...

[ 0.1334228515625, 0.232421875, 0.1492919921875, 0.1634521484375, 0.22216796875, 0.109375, 0.16552734375, 0.2108154296875, 0.000457763671875, 0.0345458984375, 0.15380859375, 0.1072998046875, 0.07025146484375, 0.1282958984375, 0.1336669921875, 0.05621337890625, 0.022491455078125, 0.02...

embed

67286262_c0

67286262

haskell

0

Title: Encoding Algebraic Data Types with Aeson in Haskell Problem title: Encoding Algebraic Data Types with Aeson in Haskell Tags: algebraic-data-types, to-json, haskell, aeson Problem: Encoding Algebraic Data Types with Aeson in Haskell I have the following ADT implementation: data FeatureValue = FvInt Int | FvFloat ...

Encoding Algebraic Data Types with Aeson in Haskell Encoding Algebraic Data Types with Aeson in Haskell algebraic-data-types to-json haskell aeson Encoding Algebraic Data Types Aeson Haskell FeatureValue FvInt FvFloat Float FvText Text FvBool Bool Show ApiResponse Online Maybe Offline Just Nothing ToJSON Encoding Algeb...

[ -0.00118255615234375, -0.0012359619140625, -0.01043701171875, 0.01080322265625, -0.0257568359375, -0.026611328125, -0.01416015625, 0.0167236328125, -0.013671875, 0.0250244140625, -0.01263427734375, 0.010009765625, 0.0037841796875, 0.030029296875, 0.01043701171875, -0.0166015625, 0.01...

[ 357, 587, 6238, 884, 429, 2844, 11809, 60457, 678, 62, 90, 191, 23, 20625, 142508, 144, 10135, 50986, 47, 170, 1681, 1556, 10, 106594, 856, 50770, 334, 4153, 365, 38699, 174379, 24129, 12647, 929, 2460, 17367, 5787, 94399, 2823, 83425, ...

[ 0.047149658203125, 0.17236328125, 0.0277557373046875, 0.0267333984375, 0.07220458984375, 0.1099853515625, 0.1131591796875, 0.1990966796875, 0.07110595703125, 0.10009765625, 0.1383056640625, 0.182373046875, 0.01763916015625, 0.135986328125, 0.230224609375, 0.0172576904296875, 0.097473...

embed

13170803_c0

13170803

haskell

0

Title: Type algebra and Knuth's up arrow notation Problem title: Type algebra and Knuth's up arrow notation Tags: types, algebraic-data-types, haskell, functional-programming Problem: Type algebra and Knuth's up arrow notation Reading through this question and this blog post got me thinking more about type al...

Type algebra and Knuth's up arrow notation Type algebra and Knuth's up arrow notation types algebraic-data-types haskell functional-programming Type Knuth Either Type algebra and Knuth's up arrow notation Reading through this question and this blog post got me thinking more about type algebra and specifically...

[ 0.004119873046875, 0.0206298828125, -0.001861572265625, 0.01214599609375, -0.01171875, -0.0074462890625, -0.01422119140625, -0.0106201171875, -0.0030975341796875, -0.01416015625, 0.002777099609375, -0.0152587890625, 0.005126953125, 0.00885009765625, 0.016845703125, -0.01202392578125, ...

[ 60457, 144, 429, 2844, 136, 136820, 127, 3768, 1257, 118201, 110, 22062, 52895, 10135, 50986, 1556, 142508, 123309, 28966, 9319, 47644, 1286, 10644, 3642, 47, 128431, 442, 831, 5351, 111, 62, 335, 237, 66044, 1328, 571, 4958, 12989, 80836, ...

[ 0.26171875, 0.054473876953125, 0.137939453125, 0.1390380859375, 0.043975830078125, 0.1688232421875, 0.168701171875, 0.0977783203125, 0.1541748046875, 0.208251953125, 0.1590576171875, 0.037628173828125, 0.2261962890625, 0.09765625, 0.2344970703125, 0.06298828125, 0.1683349609375, 0....

embed

23607190_c1

23607190

haskell

1

"input" typeOne <- runEitherT $ do result <- (decode (pack input) :: Maybe Value) ?? "Could not parse. Input JSON document is malformed" typeTwoObj <- (result ^? key "typeTwo") ?? "Could not find key typeTwo in JSON document." typeThreeObj <- (result ^? key "typeThree") ?? "Could not find key typeThree in JSON documen...

[ -0.0211181640625, 0.005584716796875, -0.0201416015625, -0.002716064453125, 0.012451171875, 0.015380859375, -0.011474609375, -0.00982666015625, -0.01214599609375, -0.023681640625, 0.0164794921875, 0.023193359375, -0.00616455078125, 0.0003986358642578125, -0.006439208984375, 0.0125122070...

[ 73, 7077, 10644, 62068, 11675, 9319, 618, 3650, 54, 16750, 112, 40899, 29102, 107730, 83425, 190060, 24610, 52366, 959, 366, 184, 360, 821, 58627, 12937, 960, 5037, 297, 3613, 46471, 170, 2109, 7136, 22799, 50986, 7413, 107, 13, 9351, 116...

[ 0.07891845703125, 0.14794921875, 0.2264404296875, 0.18994140625, 0.07421875, 0.1529541015625, 0.1134033203125, 0.08123779296875, 0.0155792236328125, 0.144287109375, 0.1224365234375, 0.1864013671875, 0.13916015625, 0.1693115234375, 0.17138671875, 0.1920166015625, 0.0667724609375, 0....

embed

71833731_c0

71833731

haskell

0

Title: Does GHC generate optimized code for `mapM_`? Problem title: Does GHC generate optimized code for `mapM_`? Tags: io, haskell Problem: Does GHC generate optimized code for `mapM_`? I wrote this code, import System.FilePath ((</>)) fp = "/Users/USER/Documents/Test/" fpAcc = fp </> "acc.txt" paths = map (fp </>) ["...

Does GHC generate optimized code for `mapM_`? Does GHC generate optimized code for `mapM_`? io haskell System.FilePath Does GHC mapM_ Users USER Documents Test acc.txt A.txt B.txt C.txt Foldable Monad See Note List INLINE Does GHC generate optimized code for `mapM_`? I wrote this code, and this is the definition of map...

[ 0, 0.0196533203125, 0.017333984375, -0.0020294189453125, -0.0137939453125, 0.01556396484375, -0.01019287109375, -0.00445556640625, -0.00038909912109375, 0.00311279296875, -0.005218505859375, -0.0042724609375, 0.00311279296875, 0.027099609375, 0.005096435546875, 0.00390625, -0.0063171...

[ 101790, 527, 73265, 139392, 15572, 29367, 18151, 62346, 594, 454, 22995, 1556, 142508, 12353, 174350, 683, 10519, 22288, 53400, 345, 50184, 43101, 8647, 50015, 124326, 62, 335, 30077, 71, 2886, 60331, 18622, 57339, 100, 80934, 125195, 9007, 3...

[ 0.03192138671875, 0.0970458984375, 0.213623046875, 0.1639404296875, 0.188232421875, 0.102783203125, 0.2105712890625, 0.1995849609375, 0.2030029296875, 0.1524658203125, 0.14697265625, 0.100830078125, 0.1949462890625, 0.05670166015625, 0.156494140625, 0.033935546875, 0.10400390625, 0...

embed

32496864_c1

32496864

haskell

1

plus’, namely ‘1.0’ In the second argument of ‘($)’, namely ‘plus 1.0 2.0’ In a stmt of a 'do' block: print $ plus 1.0 2.0 The same happens when trying to call sort twice with different types: main = do print $ plus' 1.0 2.0 print $ plus 1.0 2.0 print $ sort [3, 1, 2] print $ sort "cba" produces the following error: te...

[ -0.005126953125, 0.01300048828125, 0.029296875, -0.004974365234375, 0.01214599609375, 0.015380859375, 0.0025634765625, -0.020263671875, 0.006317138671875, -0.01116943359375, -0.0081787109375, -0.015380859375, -0.0062255859375, -0.01611328125, -0.01104736328125, -0.004608154296875, -0...

[ 1001, 110987, 102107, 17932, 10750, 4369, 32108, 53855, 16655, 6138, 39, 18, 246, 46389, 28412, 3650, 96276, 31577, 11782, 12096, 186351, 12921, 52895, 5201, 116, 238, 402, 27489, 25632, 18499, 3034, 5, 127, 22635, 22950, 438, 110527, 839, ...

[ 0.285888671875, 0.032958984375, 0.1697998046875, 0.0845947265625, 0.207275390625, 0.1199951171875, 0.2705078125, 0.1458740234375, 0.1827392578125, 0.03668212890625, 0.009124755859375, 0.138671875, 0.104736328125, 0.1773681640625, 0.1458740234375, 0.0682373046875, 0.009552001953125, ...

embed

32908793_c1

32908793

haskell

1

Nothing,Nothing,Just 7, Just 1, Just 2, Nothing,Nothing] , [Nothing,Just 5, Nothing,Nothing,Nothing,Nothing,Just 1, Just 8, Nothing] , [Nothing,Nothing,Just 9, Just 2, Nothing,Just 4, Just 7, Nothing,Nothing] , [Nothing,Nothing,Nothing,Nothing,Just 1, Just 3, Nothing,Just 2, Just 8] , [Just 4, Nothing,Nothing,Just 5, ...

[ -0.0089111328125, 0.047119140625, 0.011474609375, -0.01080322265625, 0.00677490234375, 0.016845703125, 0.00002014636993408203, 0.0162353515625, 0.01080322265625, 0.043212890625, -0.005645751953125, 0.001190185546875, 0.0015716552734375, 0.00628662109375, -0.03466796875, 0.009521484375,...

[ 182747, 4, 5021, 64113, 127794, 361, 9563, 106, 116, 268, 190, 382, 483, 201, 138, 305, 10114, 4210, 56656, 2822, 184345, 7103, 167201, 110558, 28864, 26073, 12, 11062, 5037, 756, 363, 425, 81409, 80231, 83425 ]

[ 0.29296875, 0.1005859375, 0.119384765625, 0.251953125, 0.2337646484375, 0.1923828125, 0.2064208984375, 0.1129150390625, 0.149169921875, 0.0587158203125, 0.149169921875, 0.14697265625, 0.1724853515625, 0.1298828125, 0.171875, 0.13232421875, 0.01171875, 0.08270263671875, 0.23779296...

embed

64403376_c0

64403376

haskell

0

Title: Cabal: How to configure transitive build-dependencies in the same project Problem title: Cabal: How to configure transitive build-dependencies in the same project Tags: cabal, haskell Problem: Cabal: How to configure transitive build-dependencies in the same project I have a cabal project. It has library and tes...

Cabal: How to configure transitive build-dependencies in the same project Cabal: How to configure transitive build-dependencies in the same project cabal haskell Cabal How Lib DeriveGeneric cryptohash-sha1 Test.hs Cabal: How to configure transitive build-dependencies in the same project I have a cabal project. It has l...

[ -0.00104522705078125, 0.01031494140625, -0.0028228759765625, 0.0034027099609375, -0.0064697265625, -0.0242919921875, -0.019287109375, 0.01068115234375, 0.0174560546875, -0.0108642578125, 0.003662109375, -0.008056640625, -0.000080108642578125, 0.035888671875, 0.007232666015625, -0.01599...

[ 30438, 289, 11249, 222495, 62621, 5844, 45367, 105254, 13, 117538, 5701, 13452, 109524, 1556, 142508, 43278, 1310, 135932, 12259, 215637, 126234, 2420, 418, 8647, 127, 35773, 3034, 30388, 56566, 109921, 1294, 123309, 2967, 217684, 15190, 98169, ...

[ 0.1583251953125, 0.1669921875, 0.056671142578125, 0.2225341796875, 0.1824951171875, 0.13427734375, 0.138427734375, 0.158447265625, 0.0703125, 0.062744140625, 0.1036376953125, 0.1368408203125, 0.224853515625, 0.0806884765625, 0.1734619140625, 0.10888671875, 0.069580078125, 0.1026611...

embed

52355940_c0

52355940

haskell

0

Title: Iterate and getStdRandom Problem title: Iterate and getStdRandom Tags: haskell, random Problem: Iterate and getStdRandom I have the following code (trying to simulate a Gaussian random walk): import System.Random import Control.Applicative getStdNormal :: StdGen -> (Float,StdGen) getStdNormal g = let l = drop 1 ...

Iterate and getStdRandom Iterate and getStdRandom haskell random System.Random Control.Applicative Iterate StdGen Float Iterate and getStdRandom I have the following code (trying to simulate a Gaussian random walk): l1 is evaluated to the list of (apparently normal) random values, just as I can expect: However, l2 beha...

[ -0.0032501220703125, -0.006683349609375, -0.0012969970703125, -0.01446533203125, -0.004608154296875, 0.0157470703125, 0.0078125, -0.0169677734375, -0.002410888671875, -0.04736328125, 0.0242919921875, 0.042724609375, -0.0032958984375, -0.00921630859375, 0.01458740234375, 0.0154418945312...

[ 87, 8560, 67, 136, 2046, 37455, 71, 126525, 3815, 1556, 142508, 96759, 12353, 27131, 39179, 11048, 2907, 105376, 38699, 257, 765, 25632, 18151, 15123, 40226, 26336, 7, 39209, 35691, 96, 418, 83, 151575, 47, 5303, 77978, 3638, 142424, 1660, ...

[ 0.0361328125, 0.283935546875, 0.13720703125, 0.09075927734375, 0.1259765625, 0.170166015625, 0.08612060546875, 0.1719970703125, 0.173583984375, 0.109619140625, 0.19287109375, 0.214599609375, 0.07476806640625, 0.125244140625, 0.00518798828125, 0.041839599609375, 0.173828125, 0.13696...

embed

20296936_c0

20296936

haskell

0

Title: Is it possible to create a Functor instance for sorted binary trees in Haskell? Problem title: Is it possible to create a Functor instance for sorted binary trees in Haskell? Tags: functional-programming, design-patterns, functor, haskell Problem: Is it possible to create a Functor instance for sorted binary tre...

Is it possible to create a Functor instance for sorted binary trees in Haskell? Is it possible to create a Functor instance for sorted binary trees in Haskell? functional-programming design-patterns functor haskell Functor Haskell SortBinTree EmptyNode Node Ord Is it possible to create a Functor instance for sorted bin...

[ 0.01019287109375, -0.0029144287109375, -0.0027008056640625, -0.031494140625, 0.008544921875, 0.0146484375, -0.004852294921875, -0.0252685546875, -0.00115203857421875, 0.00360107421875, -0.004913330078125, -0.0177001953125, 0.004852294921875, -0.003753662109375, -0.0002956390380859375, ...

[ 2071, 7722, 28282, 28670, 18770, 110527, 100, 17497, 71, 2394, 6635, 1360, 20625, 142508, 10, 90, 23, 123309, 28966, 4331, 7477, 1556, 53666, 571, 73, 62731, 31678, 5021, 438, 35379, 442, 10644, 64549, 748, 61924, 10422, 18507, 2684, 32354,...

[ 0.0239410400390625, 0.1414794921875, 0.1331787109375, 0.169677734375, 0.19189453125, 0.2340087890625, 0.03857421875, 0.1820068359375, 0.0645751953125, 0.145263671875, 0.05645751953125, 0.1678466796875, 0.116455078125, 0.2254638671875, 0.0213165283203125, 0.035186767578125, 0.02919006...

embed

2270277_c0

2270277

haskell

0

Title: What is [] (list constructor) in Haskell? Problem title: What is [] (list constructor) in Haskell? Tags: types, list, haskell, data-structures Problem: What is [] (list constructor) in Haskell? I'm Having problems understanding functors, specifically what a concrete type is in LYAH. I believe this is because I d...

What is [] (list constructor) in Haskell? What is [] (list constructor) in Haskell? types list haskell data-structures What Haskell Maybe Just What is [] (list constructor) in Haskell? I'm Having problems understanding functors, specifically what a concrete type is in LYAH. I believe this is because I don't understand ...

[ 0.02099609375, -0.004791259765625, -0.0010223388671875, 0.0228271484375, 0.00014209747314453125, 0.0125732421875, -0.00115966796875, 0.0032806396484375, 0.00081634521484375, 0.01348876953125, 0.00531005859375, -0.042236328125, 0.004547119140625, -0.01611328125, -0.0155029296875, -0.002...

[ 4865, 83, 378, 268, 6562, 64549, 748, 23, 20625, 142508, 32, 15, 52895, 5303, 1556, 2053, 137656, 83425, 9563, 44402, 100094, 7477, 18770, 183037, 2367, 10, 122776, 10644, 339, 192583, 28219, 6183, 2071, 9, 2271, 36716, 442, 34292, 29459, ...

[ 0.1051025390625, 0.0946044921875, 0.1180419921875, 0.1395263671875, 0.220703125, 0.23828125, 0.17236328125, 0.097412109375, 0.1463623046875, 0.2418212890625, 0.00439453125, 0.02545166015625, 0.185546875, 0.151123046875, 0.1231689453125, 0.050750732421875, 0.0855712890625, 0.2291259...

embed

10747079_c1

10747079

haskell

1

:.i:.j:.2 Which takes this much time to process a 640x420 image on my 2Ghz core 2 duo laptop: real 2m32.572s user 4m57.324s sys 0m1.870s I know something must be quite wrong, because I have gotten much better performance on much more complex algorithms using Repa 2. Under that API, the big improvement I found came from...

[ -0.01361083984375, -0.0130615234375, -0.0167236328125, 0.015869140625, 0.00811767578125, 0.01318359375, -0.024169921875, -0.0111083984375, -0.0054931640625, -0.032470703125, 0.01312255859375, -0.0024261474609375, -0.00811767578125, -0.003173828125, -0.0017547607421875, 0.0164794921875,...

[ 170, 304, 51776, 903, 5045, 1733, 9433, 112311, 425, 120377, 29569, 98, 116, 56458, 34965, 26367, 2773, 39, 6460, 177917, 38937, 201, 758, 145515, 2357, 954, 119044, 5757, 3714, 8110, 32233, 44691, 17763, 33, 11522, 23718, 1286, 27140, 2348...

[ 0.06024169921875, 0.1019287109375, 0.094482421875, 0.0738525390625, 0.09246826171875, 0.1278076171875, 0.1575927734375, 0.2022705078125, 0.047882080078125, 0.240234375, 0.205322265625, 0.030517578125, 0.1314697265625, 0.111572265625, 0.130859375, 0.2132568359375, 0.1839599609375, 0...

embed

11104182_c0

11104182

haskell

0

Title: Matrix division in Haskell Problem title: Matrix division in Haskell Tags: haskell Problem: Matrix division in Haskell What is wrong? This code is supposed to do matrix division by finding a times b inverse. I try to understand what its errors are but I fail to see how to link it. import List import Ratio invers...

Matrix division in Haskell Matrix division in Haskell haskell List Ratio Data.Array Matrix Haskell Rational Just Num Array Matrix division in Haskell What is wrong? This code is supposed to do matrix division by finding a times b inverse. I try to understand what its errors are but I fail to see how to link it. How can...

[ -0.021240234375, 0.029296875, 0.011474609375, -0.0108642578125, -0.000209808349609375, -0.0125732421875, -0.0128173828125, 0.006866455078125, 0.000362396240234375, 0.00188446044921875, -0.0031585693359375, 0.01055908203125, 0.0185546875, -0.01806640625, -0.01373291015625, -0.0099487304...

[ 194234, 91853, 23, 20625, 142508, 1556, 32036, 2552, 5565, 11809, 7092, 43315, 9563, 52782, 69253, 53, 4865, 83, 44691, 3293, 18151, 134598, 47, 54, 50944, 425, 390, 90791, 10, 20028, 876, 37676, 9790, 28219, 18499, 35782, 3126, 678, 6024, ...

[ 0.2705078125, 0.255126953125, 0.1131591796875, 0.16259765625, 0.251953125, 0.1497802734375, 0.111083984375, 0.1094970703125, 0.1317138671875, 0.060028076171875, 0.111083984375, 0.10174560546875, 0.10382080078125, 0.085693359375, 0.07843017578125, 0.006744384765625, 0.0210723876953125...

embed

25066616_c0

25066616

haskell

0

Title: Find a certain tag in html Problem title: Find a certain tag in html Tags: haskell, html-parsing Problem: Find a certain tag in html I need to find a certain tag (the tag itself and its content) in html: import Text.XML.Cursor import Text.HTML.DOM (parseLBS) page <- simpleHttp "example.com" let cursor = fromDocu...

Find a certain tag in html Find a certain tag in html haskell html-parsing Text.XML.Cursor Text.HTML.DOM Find example.com Value TX.elementName Data.String.fromString TX.Name T.pack Map.member TX.elementAttributes Couldn T.Text Expected Map.Map Actual Find a certain tag in html I need to find a certain tag (the tag itse...

[ -0.00372314453125, 0.0150146484375, 0.00147247314453125, -0.01806640625, 0.00408935546875, 0.0167236328125, -0.00885009765625, -0.00836181640625, 0.0028839111328125, -0.04150390625, 0.0189208984375, -0.0177001953125, -0.01531982421875, -0.0115966796875, 0.0023651123046875, 0.0057067871...

[ 26040, 24233, 7909, 23, 7693, 10, 1556, 142508, 2500, 6953, 24129, 39456, 474, 4970, 127068, 127214, 27781, 277, 190060, 54047, 62766, 163612, 11809, 71713, 161063, 384, 29102, 42719, 27417, 191145, 191147, 174379, 60075, 13, 166179, 100582, 38...

[ 0.1492919921875, 0.1927490234375, 0.2666015625, 0.12158203125, 0.239013671875, 0.013946533203125, 0.117431640625, 0.218505859375, 0.08837890625, 0.01025390625, 0.0928955078125, 0.0814208984375, 0.0870361328125, 0.1583251953125, 0.193115234375, 0.13818359375, 0.1529541015625, 0.0777...

embed