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
16242041_c0	16242041	haskell	0	Title: Need help understanding (\x -> ) in Haskell Problem title: Need help understanding (\x -> ) in Haskell Tags: haskell Problem: Need help understanding (\x -> ) in Haskell On ZVON, one of the definitions provided for the takeWhile function is Input: takeWhile (\x -> 6*x < 100) [1..20] Output: [1,2,3,4,5,6,7,...	Need help understanding (\x -> ) in Haskell Need help understanding (\x -> ) in Haskell haskell Need Haskell Input Output Need help understanding (\x -> ) in Haskell On ZVON, one of the definitions provided for the takeWhile function is Can someone explain what the portion (\x -> 6*x < 100) means?	[ 0.0240478515625, 0.023681640625, 0.00665283203125, 0.005584716796875, 0.0081787109375, 0.031982421875, 0.0091552734375, -0.006103515625, 0.0177001953125, -0.01531982421875, 0.0185546875, -0.00555419921875, -0.0098876953125, -0.007171630859375, 0.00121307373046875, 0.00124359130859375, ...	[ 52889, 4358, 100094, 41872, 425, 20, 1230, 5386, 23, 20625, 142508, 1556, 360, 13538, 33079, 182773, 15513, 70, 80934, 5646, 1456, 979, 133, 32354, 73342, 2367, 126826, 305, 1639, 4426, 805, 26950 ]	[ 0.077392578125, 0.0823974609375, 0.123779296875, 0.06756591796875, 0.132568359375, 0.107177734375, 0.0911865234375, 0.1611328125, 0.03436279296875, 0.1309814453125, 0.2105712890625, 0.1048583984375, 0.05078125, 0.08990478515625, 0.232666015625, 0.1168212890625, 0.1376953125, 0.0030...	embed
37474405_c0	37474405	haskell	0	Title: Understanding Type of IO () in `let` Expression Problem title: Understanding Type of IO () in `let` Expression Tags: haskell Problem: Understanding Type of IO () in `let` Expression Given: λ: let f = putStrLn "foo" in 42 42 What is f 's type? Why does "foo" not get printed before showing the result of 42 ? Lastl...	Understanding Type of IO () in `let` Expression Understanding Type of IO () in `let` Expression haskell Understanding Type Expression Not Understanding Type of IO () in `let` Expression Given: What is f 's type? Why does "foo" not get printed before showing the result of 42 ? Lastly, why doesn't the following work?	[ -0.001708984375, -0.00970458984375, -0.0037994384765625, 0.0235595703125, 0.00616455078125, -0.005462646484375, -0.00946044921875, 0.01507568359375, -0.0068359375, 0.01043701171875, -0.0098876953125, -0.032470703125, 0.000762939453125, 0.0118408203125, 0.0157470703125, -0.0128784179687...	[ 9626, 144057, 60457, 111, 17780, 23, 1974, 25129, 1830, 1556, 142508, 11205, 4865, 83, 1238, 242, 7, 10644, 44084, 14602, 3584, 31, 959, 2046, 28412, 297, 8108, 141377, 16750, 4828, 15400, 22027, 18, 70, 25632, 4488 ]	[ 0.1025390625, 0.085693359375, 0.2047119140625, 0.0291290283203125, 0.19287109375, 0.0262908935546875, 0.1822509765625, 0.1605224609375, 0.0106201171875, 0.117919921875, 0.2054443359375, 0.049957275390625, 0.039154052734375, 0.050018310546875, 0.1739501953125, 0.002349853515625, 0.024...	embed
48163259_c0	48163259	haskell	0	Title: Does GHC compare pointers before invoking Eq? Problem title: Does GHC compare pointers before invoking Eq? Tags: haskell, comparison Problem: Does GHC compare pointers before invoking Eq? This entry on the mailing list from 2014 seems to indicate that the answer is no. If it's still no, how can I quickly compare...	Does GHC compare pointers before invoking Eq? Does GHC compare pointers before invoking Eq? haskell comparison Does GHC Does GHC compare pointers before invoking Eq? This entry on the mailing list from 2014 seems to indicate that the answer is no. If it's still no, how can I quickly compare two giant data structures wh...	[ 0.00848388671875, 0.007110595703125, 0.0152587890625, 0.00439453125, -0.00157928466796875, 0.01123046875, -0.00958251953125, 0.004364013671875, -0.0015716552734375, -0.000042438507080078125, 0.00823974609375, -0.006103515625, 0.0135498046875, 0.01458740234375, 0.01318359375, 0.01135253...	[ 101790, 527, 73265, 69101, 6275, 1314, 8108, 23, 23253, 241, 864, 1556, 142508, 225490, 5303, 1049, 37202, 117414, 35166, 110, 69405, 6626, 6051, 2053, 45646, 24763, 14858, 3789, 161549, 98816, 11389 ]	[ 0.043609619140625, 0.1290283203125, 0.242431640625, 0.2275390625, 0.2166748046875, 0.1590576171875, 0.115478515625, 0.030914306640625, 0.1458740234375, 0.05328369140625, 0.196533203125, 0.12109375, 0.205078125, 0.196044921875, 0.01043701171875, 0.089599609375, 0.008697509765625, 0....	embed
31798004_c2	31798004	haskell	2	bytes copied during GC 82,325,144 bytes maximum Code signals: qualified, Control.Monad.Par, -N2, Diagnosing, Data.ByteString.Char8, Data.Attoparsec.ByteString.Char8, P.Parser, Complex, Data.ByteString.Lazy.Char8, Data.Attoparsec.ByteString.Lazy, LP.Result, LB.words, LB.readFile, out.txt, extr.LP.parse, Tot, Avg, Max, ...	bytes copied during GC 82,325,144 bytes maximum Code signals: qualified, Control.Monad.Par, -N2, Diagnosing, Data.ByteString.Char8, Data.Attoparsec.ByteString.Char8, P.Parser, Complex, Data.ByteString.Lazy.Char8, Data.Attoparsec.ByteString.Lazy, LP.Result, LB.words, LB.readFile, out.txt, extr.LP.parse, Tot, Avg, Max, ...	[ 0.0159912109375, 0.0128173828125, 0.0079345703125, 0.007720947265625, 0.01116943359375, 0.0120849609375, -0.00848388671875, -0.00131988525390625, 0.00897216796875, -0.01190185546875, 0.0029144287109375, -0.01220703125, -0.005645751953125, 0.0106201171875, 0.0021514892578125, 0.00158691...	[ 390, 1636, 71200, 71, 20271, 6, 69657, 382, 155761, 2588, 131663, 38132, 28864, 26073, 7, 12, 217225, 27131, 46674, 712, 28636, 20, 839, 304, 128198, 214, 11809, 5, 75358, 67, 71713, 84068, 1019, 10628, 39797, 436, 2189, 113197, 2729, 328...	[ 0.1884765625, 0.1346435546875, 0.258056640625, 0.09515380859375, 0.18603515625, 0.01373291015625, 0.261962890625, 0.094970703125, 0.050384521484375, 0.1605224609375, 0.1473388671875, 0.2283935546875, 0.252685546875, 0.270263671875, 0.1005859375, 0.0242919921875, 0.220703125, 0.1914...	embed
62713410_c2	62713410	haskell	2	Int32, FibreUInt32, FibreInt64, FibreUInt64, FibreFloat, FibreBool, FibreJSON, FibreList, Show, Ord, FibreAccess, FibreReadable, FibreReadWriteable, FibreObject, FibreValue, _fibreValueName, _fibreValueEndpoint, Word16, _fibreValueType, _fibreValueAccess, FibreFunction, _fibreFunctionName, _fibreFunctionEndpoint, _fibr...	Int32, FibreUInt32, FibreInt64, FibreUInt64, FibreFloat, FibreBool, FibreJSON, FibreList, Show, Ord, FibreAccess, FibreReadable, FibreReadWriteable, FibreObject, FibreValue, _fibreValueName, _fibreValueEndpoint, Word16, _fibreValueType, _fibreValueAccess, FibreFunction, _fibreFunctionName, _fibreFunctionEndpoint, _fibr...	[ 0.01300048828125, -0.0189208984375, 0.0045166015625, -0.0007781982421875, -0.002960205078125, 0.0169677734375, 0.01220703125, -0.0172119140625, 0.0263671875, 0.0296630859375, 0.00128936767578125, 0.0057373046875, -0.0030670166015625, 0.019775390625, 0.0242919921875, -0.007476806640625,...	[ 360, 18, 6460, 4, 3698, 4134, 33457, 660, 4153, 13307, 919, 365, 257, 12647, 929, 1375, 58627, 154663, 17367, 35379, 39450, 26531, 31345, 2886, 18781, 46471, 75161, 856, 50770, 101, 1029, 163612, 152378, 38496, 22543, 2485, 196707, 97249, 7...	[ 0.1204833984375, 0.1583251953125, 0.2744140625, 0.08648681640625, 0.2056884765625, 0.218017578125, 0.054931640625, 0.1558837890625, 0.09228515625, 0.2548828125, 0.054351806640625, 0.15576171875, 0.1387939453125, 0.109619140625, 0.1820068359375, 0.107421875, 0.199462890625, 0.194824...	embed
29099732_c0	29099732	haskell	0	Title: Haskell "abc123de45" to [123,45] Problem title: Haskell "abc123de45" to [123,45] Tags: string, int, haskell Problem: Haskell "abc123de45" to [123,45] From a String like "abc123def45" i want to get -> [123, 45]. I have the following now: getDecimals :: String -> [Int] getDecimals xs = [ digitT...	Haskell "abc123de45" to [123,45] Haskell "abc123de45" to [123,45] string int haskell Haskell abc123de45 Haskell "abc123de45" to [123,45] From a String like "abc123def45" i want to get -> [123, 45]. I have the following now: Only this method is returning -> [1,2,3,4,5]. How can i do this? Tnx!	[ -0.00101470947265625, 0.00604248046875, -0.01611328125, 0.018310546875, -0.01190185546875, 0.034423828125, -0.00860595703125, -0.0078125, 0.016845703125, -0.0013580322265625, 0.00341796875, -0.029052734375, -0.0108642578125, -0.000652313232421875, -0.00823974609375, 0.00186920166015625...	[ 20625, 142508, 2055, 238, 48636, 112, 4633, 47, 79315, 23, 18, 1556, 1563, 28090, 23351, 1884, 420, 17, 3444, 2046, 33079, 4, 2678, 25632, 5036, 87293, 903, 55300, 30646, 68252, 155761, 80389, 831, 54 ]	[ 0.1512451171875, 0.254150390625, 0.06878662109375, 0.05078125, 0.2437744140625, 0.1600341796875, 0.2666015625, 0.10986328125, 0.1627197265625, 0.04156494140625, 0.07275390625, 0.143798828125, 0.0760498046875, 0.121826171875, 0.1646728515625, 0.05755615234375, 0.102783203125, 0.0101...	embed
57655853_c0	57655853	haskell	0	Title: Parse nested yaml with Haskell Problem title: Parse nested yaml with Haskell Tags: yaml, haskell Problem: Parse nested yaml with Haskell How would one define a type for the following yaml configuration: request: a: "https://google/1" b: "https://google/2" c: "https://google/3" Would it be like this? data Config ...	Parse nested yaml with Haskell Parse nested yaml with Haskell yaml haskell Parse Haskell Config Show Generic Parse nested yaml with Haskell How would one define a type for the following yaml configuration: Would it be like this? and then define id' later?	[ 0.0008392333984375, 0.0172119140625, -0.01116943359375, 0.01214599609375, 0.01416015625, 0.027587890625, -0.0054931640625, -0.037353515625, -0.0166015625, 0.000965118408203125, -0.0220947265625, -0.03369140625, -0.006988525390625, -0.007232666015625, -0.00848388671875, 0.010498046875, ...	[ 2392, 184, 8512, 71, 151, 7237, 678, 20625, 142508, 1556, 139403, 17367, 88342, 61924, 10644, 25632, 180346, 154559, 1884, 903, 3447, 25, 14432 ]	[ 0.12060546875, 0.072509765625, 0.20849609375, 0.06695556640625, 0.1514892578125, 0.2205810546875, 0.074462890625, 0.1119384765625, 0.201416015625, 0.1090087890625, 0.1029052734375, 0.07476806640625, 0.096435546875, 0.150146484375, 0.2034912109375, 0.05889892578125, 0.162841796875, ...	embed
38724911_c1	38724911	haskell	1	),(1.0,0.0,2.0,1.0)] because Node 1 has successors 2(2.0,0.0) and 3(2.0,1.0) EDIT: I wrote functions : pairs [] = [] pairs ((nodeId,nodesucc):xs) = map (nodeId,) nodesucc : pairs xs pairsConcat = concat $ pairs $ edg graph2 so now second list looks like: [(1,2),(1,3),(2,4),(2,5),(3,14),(4,6),(5,7),(14,6),(14,7),(14,13)...	),(1.0,0.0,2.0,1.0)] because Node 1 has successors 2(2.0,0.0) and 3(2.0,1.0) EDIT: I wrote functions : pairs [] = [] pairs ((nodeId,nodesucc):xs) = map (nodeId,) nodesucc : pairs xs pairsConcat = concat $ pairs $ edg graph2 so now second list looks like: [(1,2),(1,3),(2,4),(2,5),(3,14),(4,6),(5,7),(14,6),(14,7),(14,13)...	[ -0.0003719329833984375, 0.007720947265625, -0.0211181640625, 0.01416015625, -0.004302978515625, 0.00982666015625, -0.044921875, 0.00958251953125, 0.01409912109375, -0.0174560546875, -0.0098876953125, -0.0169677734375, -0.007080078125, -0.020751953125, 0.00579833984375, 0.00579833984375...	[ 247, 102107, 99929, 73011, 6637, 438, 112, 106, 1556, 39457, 4295, 116, 138, 172864, 54397, 32354, 80836, 7, 157, 71, 988, 34, 10060, 425, 22288, 110, 1022, 11935, 4460, 158, 2223, 177, 41382, 304, 17932, 5303, 33342, 1884, 133063, 21320,...	[ 0.05657958984375, 0.14306640625, 0.1654052734375, 0.1668701171875, 0.055145263671875, 0.1708984375, 0.143798828125, 0.06463623046875, 0.03533935546875, 0.17333984375, 0.0848388671875, 0.049835205078125, 0.1365966796875, 0.00396728515625, 0.0302734375, 0.14990234375, 0.1898193359375, ...	embed
26474202_c2	26474202	haskell	2	Programming/Haskell/eggs.hs:8:9) Note: there are several Code signals: the, a, x, Haskell, Users, Dennis, Google, Drive, Programming, eggs.hs:1:27, Enum, Relevant, eggs.hs:1:9, Note, Double, Defined, GHC.Float, Float, Integral, GHC.Real.Ratio, GHC.Real, eggs.hs:1:28, Num, eggs.hs:8:22, Bool, eggs.hs:8:28, eggs.hs:8:18,...	Programming/Haskell/eggs.hs:8:9) Note: there are several Code signals: the, a, x, Haskell, Users, Dennis, Google, Drive, Programming, eggs.hs:1:27, Enum, Relevant, eggs.hs:1:9, Note, Double, Defined, GHC.Float, Float, Integral, GHC.Real.Ratio, GHC.Real, eggs.hs:1:28, Num, eggs.hs:8:22, Bool, eggs.hs:8:28, eggs.hs:8:18,...	[ 0.007049560546875, -0.0030364990234375, -0.0019989013671875, 0.015869140625, -0.0001544952392578125, 0.038818359375, -0.0263671875, 0.0084228515625, -0.00022125244140625, 0.000873565673828125, -0.0205078125, -0.030029296875, 0.0115966796875, 0.000858306884765625, -0.005706787109375, 0....	[ 27958, 214, 6495, 7, 142508, 2507, 9405, 127, 1019, 12, 1126, 18622, 2685, 40368, 28864, 26073, 70, 10, 1022, 20625, 53400, 124748, 1815, 50161, 56125, 19721, 27592, 357, 316, 133, 30624, 107172, 262, 5983, 527, 73265, 365, 38699, 204681, ...	[ 0.166748046875, 0.084716796875, 0.1298828125, 0.1151123046875, 0.292724609375, 0.151611328125, 0.18505859375, 0.1173095703125, 0.1307373046875, 0.0279541015625, 0.2061767578125, 0.1827392578125, 0.02813720703125, 0.1004638671875, 0.2353515625, 0.267578125, 0.09869384765625, 0.12048...	embed
2175045_c0	2175045	haskell	0	Title: How to read bytes from a Socket in Haskell Problem title: How to read bytes from a Socket in Haskell Tags: network-programming, haskell, sockets Problem: How to read bytes from a Socket in Haskell I'm trying to read a number of Bytes from a socket in Haskell. Bascially I want to do something equivalent to this: ...	How to read bytes from a Socket in Haskell How to read bytes from a Socket in Haskell network-programming haskell sockets a How Socket Haskell client_socket.recv Python How to read bytes from a Socket in Haskell I'm trying to read a number of Bytes from a socket in Haskell. Bascially I want to do something equivalent t...	[ 0.005523681640625, 0.0184326171875, 0.01007080078125, -0.0018157958984375, 0.00396728515625, 0.002960205078125, -0.007110595703125, -0.0123291015625, -0.0103759765625, -0.0311279296875, 0.0302734375, -0.035888671875, -0.007293701171875, 0.00127410888671875, -0.0021514892578125, -0.0222...	[ 11249, 47, 12301, 390, 1636, 1295, 1061, 27853, 23, 20625, 142508, 33120, 28966, 1556, 221, 23282, 991, 334, 145581, 10, 31577, 14012, 3311, 3444, 183234, 903, 2965, 3917, 20594 ]	[ 0.051849365234375, 0.06121826171875, 0.200439453125, 0.1446533203125, 0.1668701171875, 0.1142578125, 0.1370849609375, 0.2340087890625, 0.0513916015625, 0.1348876953125, 0.2254638671875, 0.0237579345703125, 0.042816162109375, 0.09906005859375, 0.1141357421875, 0.1075439453125, 0.06591...	embed
46002600_c0	46002600	haskell	0	Title: grouping elements in a list in haskell Problem title: grouping elements in a list in haskell Tags: haskell, list Problem: grouping elements in a list in haskell I want to transform a list from [1,26,3,94,51,6,7,8,9,10,11,12,73,29,19,90,76,87,1] to [[1],[26,3],[94,51,6],[7,8,9,10],[11,12,73,29,19]] and so on till...	grouping elements in a list in haskell grouping elements in a list in haskell haskell list grouping elements in a list in haskell I want to transform a list from [1,26,3,94,51,6,7,8,9,10,11,12,73,29,19,90,76,87,1] to [[1],[26,3],[94,51,6],[7,8,9,10],[11,12,73,29,19]] and so on till end in haskell. (I'm trying to group ...	[ 0.004547119140625, 0.01092529296875, -0.003997802734375, -0.0030517578125, -0.006072998046875, 0.0198974609375, -0.0223388671875, -0.0032196044921875, 0.0103759765625, 0.008056640625, 0.013916015625, -0.005645751953125, 0.007049560546875, -0.004302978515625, -0.0257568359375, 0.0013122...	[ 21115, 214, 80854, 23, 10, 5303, 1556, 142508, 87, 3444, 47, 27198, 1295, 68252, 4046, 125157, 80389, 418, 136555, 145180, 963, 1662, 1530, 13574, 4235, 193328, 11835, 19308, 76172, 378, 25256, 96386, 1126, 163090, 966, 2947, 98, 570, 3564,...	[ 0.2474365234375, 0.138671875, 0.258544921875, 0.119140625, 0.062103271484375, 0.240966796875, 0.192626953125, 0.2587890625, 0.033905029296875, 0.151611328125, 0.1583251953125, 0.2470703125, 0.134765625, 0.06182861328125, 0.2337646484375, 0.133544921875, 0.1458740234375, 0.098999023...	embed
65805098_c0	65805098	haskell	0	Title: Functor instance of kind * Problem title: Functor instance of kind * Tags: haskell Problem: Functor instance of kind * I have newtype: newtype Foo = Foo ([Int]) I would like to simply apply Int -> Int function over it like it is possible with fmap. I thought it will be enough to derive or implement Functor insta...	Functor instance of kind * Functor instance of kind * haskell Functor Foo Functor instance of kind * I have newtype: I would like to simply apply Int -> Int function over it like it is possible with fmap. I thought it will be enough to derive or implement Functor instance, but it requires type of * -> * kind. Is there ...	[ -0.0031890869140625, -0.0230712890625, 0.01129150390625, -0.01190185546875, 0.006103515625, 0.0098876953125, -0.007171630859375, -0.0067138671875, 0.013916015625, -0.015380859375, -0.0107421875, -0.0262451171875, -0.004547119140625, 0.01300048828125, -0.0283203125, -0.0419921875, 0.0...	[ 28670, 18770, 110527, 111, 8562, 661, 1556, 142508, 9572, 31, 3525, 50986, 2806, 1884, 42856, 59911, 360, 18, 33079, 32354, 645, 442, 7722, 1238, 62346, 17569, 20174, 122, 5844, 29479, 4, 1284, 144570, 10644, 88303, 73, 3917, 3249, 2878, ...	[ 0.1612548828125, 0.1795654296875, 0.260498046875, 0.0672607421875, 0.1905517578125, 0.054168701171875, 0.1131591796875, 0.2154541015625, 0.1617431640625, 0.1121826171875, 0.0938720703125, 0.2425537109375, 0.04193115234375, 0.07843017578125, 0.034149169921875, 0.1407470703125, 0.11511...	embed
67699175_c1	67699175	haskell	1	second argument of ‘elem'’, namely ‘xs’ In the first argument of ‘(==)’, namely ‘(elem' a xs)’ In the expression: ((elem' a xs) == (elem a xs)) <interactive>:258:54: error: • Couldn't match expected type ‘[()]’ with actual type ‘Int’ • In the second argument of ‘elem’, namely ‘xs’ In the second argument of ‘(==)’, nam...	second argument of ‘elem'’, namely ‘xs’ In the first argument of ‘(==)’, namely ‘(elem' a xs)’ In the expression: ((elem' a xs) == (elem a xs)) <interactive>:258:54: error: • Couldn't match expected type ‘[()]’ with actual type ‘Int’ • In the second argument of ‘elem’, namely ‘xs’ In the second argument of ‘(==)’, nam...	[ -0.005584716796875, -0.004425048828125, 0.002471923828125, -0.01123046875, 0.007293701171875, 0.01171875, -0.01190185546875, -0.0201416015625, 0.0106201171875, 0.00921630859375, 0.00250244140625, 0.01025390625, 0.004364013671875, -0.006500244140625, -0.01226806640625, -0.0281982421875,...	[ 17932, 10750, 111, 27889, 110987, 425, 7, 360, 70, 5117, 69112, 132, 25, 10, 1022, 125195, 60494, 10433, 71232, 21224, 1019, 34417, 18499, 768, 191147, 18, 14858, 84751, 10644, 1065, 678, 8561, 4153, 26, 28864, 26073, 8647, 5, 96010, 2594...	[ 0.215087890625, 0.27880859375, 0.02874755859375, 0.2237548828125, 0.072509765625, 0.1724853515625, 0.1187744140625, 0.047943115234375, 0.022369384765625, 0.1240234375, 0.265380859375, 0.1192626953125, 0.06396484375, 0.09381103515625, 0.1571044921875, 0.21142578125, 0.103271484375, ...	embed
10188276_c0	10188276	haskell	0	Title: Faster `elem` Using Binary Search In Haskell Problem title: Faster `elem` Using Binary Search In Haskell Tags: haskell Problem: Faster `elem` Using Binary Search In Haskell I have a list of Text s, and they are in sorted order. Seems to me that I can write a much faster version of elem by implementing it as a bi...	Faster `elem` Using Binary Search In Haskell Faster `elem` Using Binary Search In Haskell haskell Faster Using Binary Search Haskell Text Faster `elem` Using Binary Search In Haskell I have a list of Text s, and they are in sorted order. Seems to me that I can write a much faster version of elem by implementing it as a...	[ 0.0145263671875, -0.000514984130859375, 0.0181884765625, 0.0010528564453125, 0.00238037109375, 0.021728515625, 0.008056640625, -0.01226806640625, -0.022216796875, -0.009033203125, 0.0078125, 0.0030517578125, 0.007110595703125, 0.01043701171875, 0.0194091796875, -0.006927490234375, 0....	[ 25290, 56, 27889, 345, 54092, 1294, 33086, 360, 20625, 142508, 6953, 1556, 24129, 765, 5303, 91, 17497, 12989, 6872, 831, 33022, 5045, 4271, 11389, 88, 195, 29479, 237, 2394, 6635, 33938, 64457, 192617, 101790, 6044, 32316, 21771 ]	[ 0.147216796875, 0.1253662109375, 0.20751953125, 0.05926513671875, 0.19677734375, 0.1341552734375, 0.238037109375, 0.0560302734375, 0.140380859375, 0.2464599609375, 0.033538818359375, 0.1241455078125, 0.152587890625, 0.03558349609375, 0.096435546875, 0.0540771484375, 0.1192626953125, ...	embed
21900843_c2	21900843	haskell	2	=> (a, a) -> [a] -> [a] at mfilter.hs:8:12 Expected type: [a] -> a Actual type: [a] -> [a] In the return type of a call of `exclude' In the first argument of `map', namely `(exclude (first, Code signals: the, Haskell, Sat, Feb, Ord, range:t, x:t, Prelude, mfilter.hs, Compiling, Main, mfilter.hs:5:42, Could, mfilter.hs...	=> (a, a) -> [a] -> [a] at mfilter.hs:8:12 Expected type: [a] -> a Actual type: [a] -> [a] In the return type of a call of `exclude' In the first argument of `map', namely `(exclude (first, Code signals: the, Haskell, Sat, Feb, Ord, range:t, x:t, Prelude, mfilter.hs, Compiling, Main, mfilter.hs:5:42, Could, mfilter.hs...	[ -0.01708984375, 0.011474609375, -0.00139617919921875, -0.00159454345703125, -0.0037384033203125, 0.0029449462890625, -0.0152587890625, 0.000659942626953125, 0.0225830078125, -0.00909423828125, -0.013916015625, 0.00933837890625, 0.01904296875, -0.0036163330078125, 0.006805419921875, -0....	[ 44357, 11, 10, 33079, 99, 347, 120337, 127, 7, 1019, 20927, 60075, 13, 89829, 10644, 100582, 360, 30646, 11782, 158928, 9233, 5117, 10750, 62346, 13448, 271, 28864, 26073, 70, 20625, 142508, 20745, 43677, 35379, 37457, 18, 1022, 1914, 822, ...	[ 0.155029296875, 0.09344482421875, 0.10888671875, 0.07928466796875, 0.0228424072265625, 0.04315185546875, 0.26611328125, 0.05633544921875, 0.021697998046875, 0.0782470703125, 0.1502685546875, 0.1324462890625, 0.1466064453125, 0.09490966796875, 0.1773681640625, 0.25146484375, 0.0207824...	embed
64523388_c0	64523388	haskell	0	Title: Haskell filter using fst and snd in query Problem title: Haskell filter using fst and snd in query Tags: haskell Problem: Haskell filter using fst and snd in query I'm very new to haskell and am trying to filter all the tuples where the first element is bigger than the second. I don't understand why this doesn't...	Haskell filter using fst and snd in query Haskell filter using fst and snd in query haskell fst Haskell Haskell filter using fst and snd in query I'm very new to haskell and am trying to filter all the tuples where the first element is bigger than the second. I don't understand why this doesn't work, any help?	[ 0.004425048828125, 0.0311279296875, -0.0157470703125, -0.005889892578125, -0.0003108978271484375, -0.0005950927734375, -0.009765625, 0.004608154296875, 0.0108642578125, -0.0216064453125, -0.004058837890625, 0.003509521484375, -0.0034332275390625, 0.003875732421875, -0.0101318359375, 0....	[ 20625, 142508, 46312, 17368, 1238, 271, 136, 91, 2208, 41, 1294, 23, 1556, 3525, 31577, 756, 370, 99726, 5117, 12830, 167785, 3501, 17932, 28219, 15400, 903, 22027, 18, 4488, 4358 ]	[ 0.132568359375, 0.2130126953125, 0.2449951171875, 0.04241943359375, 0.10205078125, 0.1593017578125, 0.082763671875, 0.06768798828125, 0.1900634765625, 0.125732421875, 0.05914306640625, 0.018768310546875, 0.123046875, 0.035369873046875, 0.03790283203125, 0.00775146484375, 0.1036376953...	embed
10376963_c0	10376963	haskell	0	Title: Why doesn't this Haskell typeclass code work? Problem title: Why doesn't this Haskell typeclass code work? Tags: typeclass, haskell Problem: Why doesn't this Haskell typeclass code work? Trying to figure out Haskell typeclasses. Why doesn't the following work? {-# LANGUAGE FlexibleInstances #-} class I...	Why doesn't this Haskell typeclass code work? Why doesn't this Haskell typeclass code work? typeclass haskell the Why Haskell LANGUAGE FlexibleInstances IntClass Could f.hs:10:1-16 f.hs:10:1 Why doesn't this Haskell typeclass code work? Trying to figure out Haskell typeclasses. Why doesn't the following work?...	[ -0.012939453125, -0.0020751953125, 0.014404296875, 0.011474609375, -0.0118408203125, 0.0111083984375, -0.010498046875, 0.004730224609375, -0.01275634765625, 0.0002956390380859375, -0.0118408203125, -0.023681640625, 0.000240325927734375, 0.01507568359375, -0.0111083984375, -0.0290527343...	[ 44084, 22027, 3768, 18, 903, 20625, 142508, 10644, 67413, 18151, 4488, 1556, 70, 98064, 180842, 2661, 116071, 360, 140803, 191147, 1238, 127, 15110, 19721, 13528, 26366, 25632, 73, 29459, 18499, 26008, 959, 28219 ]	[ 0.10577392578125, 0.1314697265625, 0.0660400390625, 0.1373291015625, 0.1104736328125, 0.1318359375, 0.2132568359375, 0.1773681640625, 0.2491455078125, 0.1517333984375, 0.1405029296875, 0.129150390625, 0.046966552734375, 0.0321044921875, 0.1031494140625, 0.09033203125, 0.1865234375, ...	embed
16633101_c0	16633101	haskell	0	Title: How does this Haskell function work? Problem title: How does this Haskell function work? Tags: haskell Problem: How does this Haskell function work? I was struggling to see how this function worked. For the nth number it should calculate the sum of the previous three elements. f' :: Integer->Integer f' = helper ...	How does this Haskell function work? How does this Haskell function work? haskell How Haskell Integer n-1 How does this Haskell function work? I was struggling to see how this function worked. For the nth number it should calculate the sum of the previous three elements. Thanks for your time	[ 0.0003337860107421875, -0.001953125, 0.00445556640625, 0.01031494140625, -0.00994873046875, 0.0181884765625, -0.003997802734375, -0.0004177093505859375, 0.004730224609375, -0.02783203125, -0.000942230224609375, -0.0302734375, -0.00090789794921875, 0.01165771484375, 0.0107421875, -0.006...	[ 11249, 14602, 903, 20625, 142508, 32354, 4488, 1556, 44401, 653, 5759, 237875, 1957, 3642, 79786, 1326, 927, 14012, 442, 5608, 74481, 10554, 96362, 17262, 80854, 1733 ]	[ 0.1263427734375, 0.1314697265625, 0.1468505859375, 0.1705322265625, 0.27880859375, 0.2266845703125, 0.171875, 0.1483154296875, 0.210693359375, 0.1455078125, 0.2017822265625, 0.08465576171875, 0.0105743408203125, 0.0765380859375, 0.1365966796875, 0.0357666015625, 0.1622314453125, 0....	embed
73592196_c0	73592196	haskell	0	Title: How can I run a list of independent IO actions in parallel? Problem title: How can I run a list of independent IO actions in parallel? Tags: haskell, concurrency Problem: How can I run a list of independent IO actions in parallel? Is there something that does the same thing as sequenceA does to [IO a] , but that...	How can I run a list of independent IO actions in parallel? How can I run a list of independent IO actions in parallel? haskell concurrency How How can I run a list of independent IO actions in parallel? Is there something that does the same thing as sequenceA does to [IO a] , but that runs them concurrently? I don’t n...	[ -0.016845703125, 0.00142669677734375, -0.0096435546875, 0.001800537109375, -0.0022125244140625, 0.00933837890625, -0.007476806640625, -0.0035552978515625, 0.0059814453125, -0.01611328125, -0.004486083984375, -0.0009307861328125, 0.01300048828125, 0.0274658203125, -0.01043701171875, -0....	[ 11249, 831, 87, 11675, 5303, 111, 41371, 17780, 61972, 23, 95103, 1556, 142508, 108636, 982, 14602, 5701, 40, 944, 3956, 284, 47, 10, 1284, 127877, 2856, 133244, 3871, 56776, 214, 756 ]	[ 0.08721923828125, 0.10076904296875, 0.042572021484375, 0.15576171875, 0.167236328125, 0.0616455078125, 0.208251953125, 0.2218017578125, 0.1817626953125, 0.0821533203125, 0.2401123046875, 0.1107177734375, 0.213134765625, 0.1092529296875, 0.06829833984375, 0.0201568603515625, 0.0218963...	embed
74873397_c1	74873397	haskell	1	[1, 5, 8] [2, 6, 67] == [[1, 2], [1, 6], [1, 67], [5, 6], [5, 67], [8, 67], [1, 2, 5, 6, 8, 67], [5, 6, 8, 67], [1, 2, 5, 67], [1, 6, 8, 67], [1, 2, 8, 67], [1, 2, 5, 6]] -- But this is what i actually get( and the problem comes from the processMore, but don't know how to fix it): generate [1, 5, 8] [2, 6, 67] -> [[1,...	[1, 5, 8] [2, 6, 67] == [[1, 2], [1, 6], [1, 67], [5, 6], [5, 67], [8, 67], [1, 2, 5, 6, 8, 67], [5, 6, 8, 67], [1, 2, 5, 67], [1, 6, 8, 67], [1, 2, 8, 67], [1, 2, 5, 6]] -- But this is what i actually get( and the problem comes from the processMore, but don't know how to fix it): generate [1, 5, 8] [2, 6, 67] -> [[1,...	[ 0.0024566650390625, 0.01318359375, 0.0020294189453125, 0.005157470703125, -0.013916015625, 0.01953125, -0.0244140625, -0.01434326171875, 0.0166015625, -0.0091552734375, 0.003997802734375, 0.0164794921875, 0.017822265625, 0.0203857421875, -0.01483154296875, -0.0064697265625, 0.0163574...	[ 68252, 190, 382, 268, 304, 305, 12661, 69112, 110558, 418, 116, 4, 758, 1019, 4966, 903, 2367, 17, 20653, 2046, 2967, 32497, 9433, 122880, 1284, 3714, 30022, 2077, 139392, 33079, 133063, 163090, 966, 104629, 18197, 71928, 151664, 28864, 260...	[ 0.09735107421875, 0.22509765625, 0.247314453125, 0.07537841796875, 0.13330078125, 0.1884765625, 0.2548828125, 0.185302734375, 0.001007080078125, 0.04241943359375, 0.11572265625, 0.04791259765625, 0.12939453125, 0.1419677734375, 0.23681640625, 0.0245513916015625, 0.0144195556640625, ...	embed
4776750_c0	4776750	haskell	0	Title: What is an idiomatic way to add lists in Haskell? Problem title: What is an idiomatic way to add lists in Haskell? Tags: nested-lists, haskell Problem: What is an idiomatic way to add lists in Haskell? Suppose I want to add two lists in Haskell. What is the most usual way to do this? Here's what I did: addLists ...	What is an idiomatic way to add lists in Haskell? What is an idiomatic way to add lists in Haskell? nested-lists haskell What Haskell Integral What is an idiomatic way to add lists in Haskell? Suppose I want to add two lists in Haskell. What is the most usual way to do this? Here's what I did:	[ -0.01251220703125, -0.001068115234375, -0.00616455078125, 0.0030975341796875, -0.00714111328125, 0.034912109375, -0.00093841552734375, -0.0233154296875, 0.003204345703125, -0.022216796875, 0.0157470703125, -0.0279541015625, -0.0022735595703125, 0.0286865234375, -0.0003108978271484375, ...	[ 4865, 49666, 9523, 3917, 15190, 5303, 7, 23, 20625, 142508, 83, 142, 47, 8512, 71, 6562, 1556, 204681, 121691, 3444, 6626, 2684, 115723, 54, 903 ]	[ 0.02490234375, 0.19921875, 0.1497802734375, 0.0888671875, 0.1767578125, 0.228759765625, 0.113037109375, 0.0667724609375, 0.1585693359375, 0.2408447265625, 0.032135009765625, 0.05364990234375, 0.04852294921875, 0.17333984375, 0.1025390625, 0.212158203125, 0.143310546875, 0.208862304...	embed
5818377_c0	5818377	haskell	0	Title: How do i write the following function with the >>= operator Problem title: How do i write the following function with the >>= operator Tags: monads, haskell Problem: How do i write the following function with the >>= operator How do I write this function using the >>= operator? parseNumber2 :: Parser...	How do i write the following function with the >>= operator How do i write the following function with the >>= operator monads haskell How parseNumber2 Parser LispVal many1 Number How do i write the following function with the >>= operator How do I write this function using the >>= operator?	[ -0.0299072265625, 0.00384521484375, -0.00116729736328125, 0.010498046875, 0.01104736328125, 0.035400390625, -0.009521484375, -0.006256103515625, 0.0238037109375, -0.031494140625, 0.006134033203125, -0.0211181640625, 0.00185394287109375, -0.0013580322265625, 0.0140380859375, 0.003936767...	[ 11249, 54, 17, 33022, 25632, 32354, 678, 619, 5386, 74, 1230, 1369, 39933, 70, 2667, 712, 7, 1556, 142508, 366, 184, 18444, 26278, 304, 2392, 2189, 1261, 7008, 42272, 5941, 418, 103332, 6396, 87, 903, 17368 ]	[ 0.0926513671875, 0.04547119140625, 0.09771728515625, 0.177490234375, 0.15576171875, 0.2064208984375, 0.08245849609375, 0.048828125, 0.1644287109375, 0.03485107421875, 0.0601806640625, 0.15673828125, 0.238037109375, 0.04632568359375, 0.100830078125, 0.14306640625, 0.0548095703125, 0...	embed
58575205_c0	58575205	haskell	0	Title: How To uninstall a stack package Problem title: How To uninstall a stack package Tags: haskell-stack, uninstallation, haskell Problem: How To uninstall a stack package I installed yesod via stack install yesod-bin And it installed it on my $HOME/.local/bin directory, I'm trying to uninstall it over stack uninsta...	How To uninstall a stack package How To uninstall a stack package haskell-stack uninstallation haskell How How To uninstall a stack package I installed yesod via And it installed it on my $HOME/.local/bin directory, I'm trying to uninstall it over stack uninstall yesod-bin, but I'm not being successful, wonder if I jus...	[ -0.00787353515625, 0.00909423828125, 0.01263427734375, 0.01556396484375, -0.027099609375, -0.0028533935546875, -0.01092529296875, -0.006927490234375, -0.01275634765625, 0.004974365234375, -0.00653076171875, -0.007598876953125, -0.00933837890625, 0.01556396484375, -0.015625, 0.001670837...	[ 11249, 717, 51, 80383, 177261, 98169, 10, 1556, 142508, 590, 2594, 105348, 20600, 2422, 23722, 1829, 442, 98, 91245, 5, 98908, 7568, 14364, 31577, 645, 65771, 32195, 154109, 186, 20174, 20949, 5773, 5426 ]	[ 0.0439453125, 0.06085205078125, 0.1527099609375, 0.222412109375, 0.2257080078125, 0.229248046875, 0.0152740478515625, 0.12548828125, 0.211181640625, 0.09552001953125, 0.1248779296875, 0.1588134765625, 0.121826171875, 0.162353515625, 0.2314453125, 0.09527587890625, 0.0863037109375, ...	embed
9220986_c0	9220986	haskell	0	Title: Is there any haskell function to concatenate list with separator? Problem title: Is there any haskell function to concatenate list with separator? Tags: haskell, list, concatenation Problem: Is there any haskell function to concatenate list with separator? Is there a function to concatenate elements of a list wi...	Is there any haskell function to concatenate list with separator? Is there any haskell function to concatenate list with separator? haskell list concatenation Is there any haskell function to concatenate list with separator? Is there a function to concatenate elements of a list with a separator? For example: Thanks for...	[ 0.00225830078125, -0.0269775390625, -0.0027008056640625, 0.004119873046875, -0.00762939453125, -0.0029754638671875, 0.005462646484375, 0.007537841796875, -0.001007080078125, -0.01422119140625, -0.006072998046875, -0.0152587890625, 0.01007080078125, -0.003021240234375, -0.026611328125, ...	[ 2071, 2685, 2499, 1556, 142508, 32354, 47, 158, 33478, 76, 67, 5303, 678, 38310, 748, 4460, 33, 2320, 10, 80854, 27781 ]	[ 0.00830078125, 0.049407958984375, 0.07958984375, 0.12255859375, 0.2379150390625, 0.2122802734375, 0.06097412109375, 0.09478759765625, 0.173583984375, 0.123779296875, 0.04351806640625, 0.1998291015625, 0.1136474609375, 0.2086181640625, 0.1715087890625, 0.1441650390625, 0.1055908203125...	embed
60354247_c0	60354247	haskell	0	Title: Is there a function in Haskell to group the elements of a list in the following way? Problem title: Is there a function in Haskell to group the elements of a list in the following way? Tags: haskell Problem: Is there a function in Haskell to group the elements of a list in the following way? Suppose I have a lis...	Is there a function in Haskell to group the elements of a list in the following way? Is there a function in Haskell to group the elements of a list in the following way? haskell Haskell Is there a function in Haskell to group the elements of a list in the following way? Suppose I have a list [0,1,2,3] and I want a new ...	[ 0.00133514404296875, 0.0115966796875, -0.00982666015625, -0.006927490234375, -0.006622314453125, 0.02490234375, -0.03271484375, -0.0098876953125, 0.0103759765625, 0.01171875, 0.0029449462890625, -0.0098876953125, 0.0030517578125, 0.007080078125, -0.0228271484375, 0.00909423828125, 0....	[ 2071, 2685, 10, 32354, 23, 20625, 142508, 47, 21115, 70, 80854, 5303, 25632, 3917, 111, 1556, 121691, 2389, 133063, 96386, 3444, 3525, 678, 17727, 155761, 54, 903 ]	[ 0.0144500732421875, 0.056671142578125, 0.0716552734375, 0.239013671875, 0.0888671875, 0.139892578125, 0.258056640625, 0.0770263671875, 0.2626953125, 0.048797607421875, 0.210693359375, 0.2230224609375, 0.130615234375, 0.1123046875, 0.04486083984375, 0.09393310546875, 0.023956298828125...	embed
12546757_c0	12546757	haskell	0	Title: How do I use cabal's MIN_VERSION_ and other macros with ghci? Problem title: How do I use cabal's MIN_VERSION_ and other macros with ghci? Tags: cabal, ghci, haskell Problem: How do I use cabal's MIN_VERSION_ and other macros with ghci? When I use Cabal's various MIN_VERSION_ macros in a Haskell projec...	How do I use cabal's MIN_VERSION_ and other macros with ghci? How do I use cabal's MIN_VERSION_ and other macros with ghci? cabal ghci haskell How MIN_VERSION_ How do I use cabal's MIN_VERSION_ and other macros with ghci? When I use Cabal's various MIN_VERSION_ macros in a Haskell project, how can I ensure th...	[ 0.0022430419921875, -0.0037841796875, 0.03173828125, 0.01611328125, -0.024169921875, 0.004913330078125, 0.00653076171875, 0.0245361328125, 0.01104736328125, 0.01519775390625, -0.017822265625, -0.055419921875, -0.000736236572265625, -0.00726318359375, 0.004364013671875, -0.0025177001953...	[ 11249, 4527, 109524, 3768, 69048, 33255, 118596, 111789, 678, 31380, 318, 1556, 142508, 454, 136, 30438, 289, 67842, 20625, 13452, 63284, 26785, 61924, 17368, 134234, 527, 73265, 14 ]	[ 0.041046142578125, 0.1229248046875, 0.2366943359375, 0.020050048828125, 0.22705078125, 0.1771240234375, 0.130126953125, 0.189453125, 0.0576171875, 0.097900390625, 0.127197265625, 0.0885009765625, 0.209228515625, 0.010467529296875, 0.009033203125, 0.1307373046875, 0.1488037109375, 0...	embed
34603107_c0	34603107	haskell	0	Title: decoding haskell pcap header Problem title: decoding haskell pcap header Tags: pcap, haskell Problem: decoding haskell pcap header I am trying to get more information out of PktHdr in the pcap Haskell library. But it seems like the type does not give me much. How can I get things like source address, destination...	decoding haskell pcap header decoding haskell pcap header pcap haskell PktHdr decoding haskell pcap header I am trying to get more information out of PktHdr in the pcap Haskell library. But it seems like the type does not give me much. How can I get things like source address, destination address and port? Do I have to...	[ 0.0184326171875, -0.0030364990234375, -0.003173828125, 0.050048828125, 0.020263671875, -0.002899169921875, -0.002532958984375, -0.01318359375, -0.005401611328125, 0.0036773681640625, -0.0011138916015625, -0.0439453125, 0.006195068359375, -0.0068359375, -0.0238037109375, -0.001815795898...	[ 8, 587, 6238, 1556, 142508, 915, 15644, 10336, 56, 436, 4164, 841, 7569, 31577, 2046, 1286, 4677, 1810, 20625, 35773, 10644, 959, 8337, 5045, 11249, 831, 8966, 1884, 31344, 29823, 78869, 11469, 3900, 19309, 390, 1636, 35978, 16454, 51584, ...	[ 0.1231689453125, 0.1566162109375, 0.0428466796875, 0.1253662109375, 0.1954345703125, 0.0706787109375, 0.209228515625, 0.16259765625, 0.03851318359375, 0.0777587890625, 0.134521484375, 0.097900390625, 0.176025390625, 0.01025390625, 0.08355712890625, 0.041656494140625, 0.1055908203125,...	embed
15030876_c0	15030876	haskell	0	Title: Haskell in Excel Problem title: Haskell in Excel Tags: haskell Problem: Haskell in Excel I've seen a couple of sources casually refer to the idea of "Haskell in an Excel spreadsheet" - as if this is something that everybody is familiar with and knows about. This is certainly news to me. The idea has obvious appe...	Haskell in Excel Haskell in Excel haskell Haskell Excel Haskell in Excel I've seen a couple of sources casually refer to the idea of "Haskell in an Excel spreadsheet" - as if this is something that everybody is familiar with and knows about. This is certainly news to me. The idea has obvious appeal - Haskell would be i...	[ 0.024169921875, 0.01220703125, -0.0019989013671875, 0.022216796875, 0.0019683837890625, 0.0027008056640625, 0.00119781494140625, -0.0135498046875, -0.01104736328125, -0.0093994140625, -0.016845703125, -0.00958251953125, -0.000789642333984375, 0.0205078125, -0.00537109375, -0.0119628906...	[ 20625, 142508, 23, 30326, 1556, 51592, 24941, 111, 97264, 63044, 15005, 6528, 6495, 7, 142, 93403, 7816, 126, 237, 2174, 195348, 16031, 93002, 68782, 7123, 47, 162520, 149528, 2806, 6397, 14947, 8562, 2499, 37873, 17669, 20653, 4163, 903, 4...	[ 0.2034912109375, 0.305419921875, 0.125244140625, 0.2509765625, 0.179443359375, 0.03619384765625, 0.022430419921875, 0.005645751953125, 0.087646484375, 0.0963134765625, 0.082275390625, 0.12744140625, 0.1746826171875, 0.1552734375, 0.0316162109375, 0.17529296875, 0.177490234375, 0.09...	embed
16182156_c0	16182156	haskell	0	Title: How to use '(<)' as a variable? Problem title: How to use '(<)' as a variable? Tags: haskell Problem: How to use '(<)' as a variable? How would I use the greater or less than sign as a variable so that when I enter Main> mySort (<) [1,5,3,6,4,1,3,3,2] or Main> mySort (>) [1,5,3,6,4,1,3,...	How to use '(<)' as a variable? How to use '(<)' as a variable? haskell How Main How to use '(<)' as a variable? How would I use the greater or less than sign as a variable so that when I enter Main> mySort (<) [1,5,3,6,4,1,3,3,2] or Main> mySort (>) [1,5,3,6,4,1,3,3,2] it will sort the list f...	[ 0.0120849609375, 0.0186767578125, -0.00439453125, -0.02587890625, -0.0120849609375, 0.012939453125, 0.00167083740234375, -0.01104736328125, -0.003173828125, -0.00628662109375, 0.003509521484375, -0.01007080078125, 0.009521484375, 0.0014190673828125, 0.0030670166015625, -0.0093994140625...	[ 11249, 47, 4527, 54764, 3768, 74, 1230, 1277, 237, 10, 77336, 1556, 142508, 12321, 132, 16093, 16, 25, 2806, 117396, 707, 40715, 3501, 24092, 30957, 2740, 759, 158240, 57626, 363, 150643, 90173, 12096, 5303, 1295, 167375, 25617, 96819, 1966...	[ 0.0927734375, 0.0382080078125, 0.144287109375, 0.055633544921875, 0.15966796875, 0.0887451171875, 0.046905517578125, 0.0634765625, 0.103759765625, 0.08056640625, 0.306640625, 0.14404296875, 0.232421875, 0.1160888671875, 0.074951171875, 0.228759765625, 0.08349609375, 0.0247192382812...	embed
23419189_c0	23419189	haskell	0	Title: Printing a values in a tuple in a format Problem title: Printing a values in a tuple in a format Tags: haskell Problem: Printing a values in a tuple in a format This question may seem silly but kindly bear with me i was intending to print a tuple as String1 - 10 Sritng2 - 20 String3 - 30 but if i am putStrLn $ s...	Printing a values in a tuple in a format Printing a values in a tuple in a format haskell Printing String1 Sritng2 String3 Printing a values in a tuple in a format This question may seem silly but kindly bear with me i was intending to print a tuple as but if i am It is giving me the out put as [("String",10),("String"...	[ 0.0079345703125, -0.01007080078125, -0.00457763671875, 0.0234375, 0.00341796875, -0.00127410888671875, -0.0032806396484375, 0.0111083984375, -0.0033721923828125, 0.0296630859375, -0.0028533935546875, -0.02685546875, 0.00567626953125, 0.002288818359375, -0.0181884765625, 0.0101928710937...	[ 39754, 142424, 23, 370, 8705, 9384, 10, 1556, 142508, 23351, 214, 418, 9292, 449, 304, 363, 9655, 1543, 48903, 12097, 8562, 81148, 892, 33770, 28412, 237, 1284, 2174, 17, 444, 68772, 163, 1810, 3884, 71713, 50258, 73419, 62946 ]	[ 0.21044921875, 0.22314453125, 0.036865234375, 0.1373291015625, 0.2420654296875, 0.19970703125, 0.00445556640625, 0.1312255859375, 0.2332763671875, 0.1468505859375, 0.1138916015625, 0.0295562744140625, 0.05621337890625, 0.114990234375, 0.034271240234375, 0.1099853515625, 0.00643920898...	embed
40275080_c0	40275080	haskell	0	Title: How do you use TypeApplications in Haskell? Problem title: How do you use TypeApplications in Haskell? Tags: ghc, types, language-extension, haskell Problem: How do you use TypeApplications in Haskell? With -XTypeApplications in GHC 8.0, you can specify types explicitly with @ preceding function arguments. What ...	How do you use TypeApplications in Haskell? How do you use TypeApplications in Haskell? ghc types language-extension haskell How TypeApplications Haskell XTypeApplications How do you use TypeApplications in Haskell? With -XTypeApplications in GHC 8.0, you can specify types explicitly with @ preceding function arguments...	[ 0.00112152099609375, 0.010986328125, 0.007171630859375, 0.013916015625, -0.002899169921875, 0.011474609375, -0.00958251953125, 0.00732421875, -0.0019683837890625, -0.004791259765625, 0.0274658203125, -0.0390625, 0.002685546875, 0.0115966796875, -0.0018768310546875, -0.0021820068359375,...	[ 11249, 4527, 60457, 47677, 182867, 7, 23, 20625, 142508, 54, 398, 31380, 238, 52895, 46876, 3355, 128872, 1556, 1193, 196707, 17106, 20, 1542, 527, 73265, 3217, 2389, 831, 40140, 18929, 143726, 1374, 107671, 32354, 10750, 66161, 40368, 65508 ...	[ 0.0926513671875, 0.12451171875, 0.2454833984375, 0.1561279296875, 0.2115478515625, 0.03997802734375, 0.0679931640625, 0.1405029296875, 0.23828125, 0.01873779296875, 0.005859375, 0.08563232421875, 0.06915283203125, 0.2216796875, 0.0616455078125, 0.01019287109375, 0.091064453125, 0.1...	embed
28258030_c0	28258030	haskell	0	Title: gtk2Hs : Combo box with text and pictures Problem title: gtk2Hs : Combo box with text and pictures Tags: gtk2hs, haskell, combobox Problem: gtk2Hs : Combo box with text and pictures The basic ComboBox provided by Gtk can only handle a String or a Pixbuf But I wanted a text and a picture nearby on the same row of...	gtk2Hs : Combo box with text and pictures gtk2Hs : Combo box with text and pictures gtk2hs haskell combobox gtk2Hs Combo ComboBox Pixbuf gtk2Hs : Combo box with text and pictures The basic ComboBox provided by Gtk can only handle a String or a Pixbuf But I wanted a text and a picture nearby on the same row of selection...	[ 0.00714111328125, 0.01953125, -0.0167236328125, 0.0439453125, 0.0115966796875, 0.0198974609375, -0.006256103515625, 0.0159912109375, -0.000919342041015625, 0.01123046875, 0.0023345947265625, -0.0308837890625, 0.032470703125, -0.00148773193359375, -0.0167236328125, -0.0103759765625, -...	[ 706, 31472, 304, 841, 7, 3288, 837, 16530, 678, 7986, 136, 75073, 127, 1556, 142508, 375, 11728, 72295, 159939, 978, 420, 62822, 62952, 527, 831, 4734, 34831, 23351, 214, 707, 36663, 49726, 43573, 1272, 5701, 15555, 132216, 113054, 16750, ...	[ 0.05718994140625, 0.254638671875, 0.1488037109375, 0.1776123046875, 0.1192626953125, 0.1578369140625, 0.1983642578125, 0.2071533203125, 0.051025390625, 0.221435546875, 0.1058349609375, 0.1710205078125, 0.13720703125, 0.09686279296875, 0.2607421875, 0.10888671875, 0.2001953125, 0.23...	embed
28469119_c0	28469119	haskell	0	Title: wxc-0.91.0.0 failed to install Problem title: wxc-0.91.0.0 failed to install Tags: haskell, cabal, wxwidgets, reactive-banana Problem: wxc-0.91.0.0 failed to install Code signals: integer, wxc-0.91.0.0, eljlistctrl.cpp, ListCmp, eljlistctrl.cpp:16:23, Wint-to-pointer-cast, eljlistctrl.cpp:16:53, wxListCtrl_SortI...	wxc-0.91.0.0 failed to install wxc-0.91.0.0 failed to install haskell cabal wxwidgets reactive-banana integer wxc-0.91.0.0 eljlistctrl.cpp ListCmp eljlistctrl.cpp:16:23 Wint-to-pointer-cast eljlistctrl.cpp:16:53 wxListCtrl_SortItems eljlistctrl.cpp:478:41 EiffelSort _EiffelSort eljlistctrl.cpp:478:44 wxWidgets-3.0.2 li...	[ -0.00909423828125, -0.0018157958984375, 0.0035858154296875, 0.00341796875, -0.0166015625, -0.00823974609375, -0.003143310546875, -0.0167236328125, -0.006805419921875, 0.03369140625, -0.002471923828125, -0.02978515625, -0.00787353515625, -0.01025390625, -0.0040283203125, 0.0136108398437...	[ 148, 425, 238, 23320, 12183, 99929, 165523, 20600, 1556, 142508, 109524, 32306, 3794, 456, 71232, 105281, 11, 892, 1505, 88, 170, 6562, 54123, 32036, 2676, 6366, 22354, 17686, 18, 188, 38496, 56, 55741, 154663, 4448, 158240, 2982, 157376, 1...	[ 0.1217041015625, 0.1409912109375, 0.1402587890625, 0.042327880859375, 0.23193359375, 0.1746826171875, 0.2047119140625, 0.20361328125, 0.102783203125, 0.1943359375, 0.2216796875, 0.127685546875, 0.1754150390625, 0.081298828125, 0.182861328125, 0.1490478515625, 0.1534423828125, 0.109...	embed
22474411_c0	22474411	haskell	0	Title: Random integer generating in Haskell Problem title: Random integer generating in Haskell Tags: haskell Problem: Random integer generating in Haskell Is there any inbuilt function in Haskell that gives a random number in a range like x = random(a,b) such that x gives an integer lies between a and b . a <= x <= b ...	Random integer generating in Haskell Random integer generating in Haskell haskell Random Haskell Random integer generating in Haskell Is there any inbuilt function in Haskell that gives a random number in a range like x = random(a,b) such that x gives an integer lies between a and b . a <= x <= b And some functions in ...	[ -0.0157470703125, 0.0054931640625, 0.023193359375, -0.007049560546875, 0.0120849609375, 0.0361328125, -0.0155029296875, -0.03369140625, -0.00933837890625, -0.0306396484375, -0.007049560546875, -0.00885009765625, -0.00799560546875, 0.0211181640625, 0.0224609375, -0.020751953125, -0.00...	[ 39643, 306, 892, 1505, 12663, 1916, 23, 20625, 142508, 1556, 2071, 2685, 2499, 978, 24908, 32354, 450, 76199, 96759, 14012, 37457, 1884, 1022, 2203, 11, 4, 275, 6044, 400, 17721, 10, 136, 876, 4426, 1369, 3060, 5701, 3229, 71924, 48716, ...	[ 0.1749267578125, 0.10498046875, 0.146240234375, 0.141845703125, 0.1693115234375, 0.0517578125, 0.1021728515625, 0.157958984375, 0.2568359375, 0.1339111328125, 0.024566650390625, 0.04327392578125, 0.0650634765625, 0.1192626953125, 0.1357421875, 0.1900634765625, 0.0245361328125, 0.08...	embed
64952967_c0	64952967	haskell	0	Title: redefining the 'all' function in haskell Problem title: redefining the 'all' function in haskell Tags: haskell, fold, higher-order-functions Problem: redefining the 'all' function in haskell How can I redefine the all function in haskell using foldr ? I tried writing it like this and I'm not ...	redefining the 'all' function in haskell redefining the 'all' function in haskell haskell fold higher-order-functions Bool x:xs redefining the 'all' function in haskell How can I redefine the all function in haskell using foldr ? I tried writing it like this and I'm not sure why it doesn't work.	[ -0.004913330078125, 0.00946044921875, -0.00005316734313964844, 0.0166015625, 0.003631591796875, 0.025634765625, 0.0030364990234375, 0.000667572021484375, 0.01361083984375, -0.0111083984375, 0.018310546875, -0.01153564453125, -0.00007534027099609375, 0.0224609375, -0.01025390625, 0.0173...	[ 456, 49919, 449, 3768, 5584, 32354, 23, 1556, 142508, 42822, 77546, 80596, 137175, 2460, 929, 1022, 425, 7, 831, 15265, 64552, 70, 756, 17368, 18344, 7569, 37842, 32562, 1884, 903, 9077, 15400, 22027, 18, 4488 ]	[ 0.1162109375, 0.1832275390625, 0.0496826171875, 0.0810546875, 0.2047119140625, 0.23046875, 0.045135498046875, 0.1334228515625, 0.2265625, 0.202880859375, 0.0799560546875, 0.1436767578125, 0.1591796875, 0.020782470703125, 0.1221923828125, 0.0447998046875, 0.041229248046875, 0.030975...	embed
12748659_c1	12748659	haskell	1	)) : tokenize (dropWhile isDigit xs) else tokenize(xs) ast :: [String] -> (AST,[String]) ast [] = error "Empty string" ast (x:xs) \| all isDigit x = (Leaf (read x),xs) \| x == "-" = let (y,xs') = ast xs in (Min y,xs') \| x == "*" = (Prod y y',xs'') where (y,xs') = ast xs (y',xs'') = ast xs' \| x == "+" = (Sum y y',xs'') wh...	)) : tokenize (dropWhile isDigit xs) else tokenize(xs) ast :: [String] -> (AST,[String]) ast [] = error "Empty string" ast (x:xs) \| all isDigit x = (Leaf (read x),xs) \| x == "-" = let (y,xs') = ast xs in (Min y,xs') \| x == "*" = (Prod y y',xs'') where (y,xs') = ast xs (y',xs'') = ast xs' \| x == "+" = (Sum y y',xs'') wh...	[ -0.0005340576171875, 0.0016326904296875, -0.000637054443359375, 0.0142822265625, -0.006866455078125, 0.0021209716796875, 0.00372314453125, -0.021484375, -0.011474609375, -0.0009613037109375, -0.004791259765625, -0.003204345703125, -0.0147705078125, -0.0125732421875, -0.0150146484375, 0...	[ 78960, 152, 47, 1098, 20650, 138810, 1456, 979, 133, 83, 14055, 15769, 1022, 7, 37076, 425, 10, 271, 1984, 71713, 214, 33079, 48963, 2203, 18499, 134332, 939, 79315, 12, 756, 5267, 2407, 39116, 69112, 9, 2633, 53, 25, 23, 59076, 113, ...	[ 0.1424560546875, 0.031494140625, 0.15234375, 0.2225341796875, 0.1885986328125, 0.232177734375, 0.01873779296875, 0.1268310546875, 0.0704345703125, 0.1363525390625, 0.0916748046875, 0.17431640625, 0.1297607421875, 0.12890625, 0.06964111328125, 0.159912109375, 0.0633544921875, 0.1771...	embed
35215660_c0	35215660	haskell	0	Title: How to write a recursive function with initial condition in Haskell? Problem title: How to write a recursive function with initial condition in Haskell? Tags: definition, haskell, recursion Problem: How to write a recursive function with initial condition in Haskell? In F# I can define like this: let rec sum = f...	How to write a recursive function with initial condition in Haskell? How to write a recursive function with initial condition in Haskell? definition haskell recursion How Haskell x::xs How to write a recursive function with initial condition in Haskell? In F# I can define like this: Looks quite convenient. Is there its...	[ -0.00604248046875, 0.009765625, 0.01708984375, 0.0045166015625, -0.00104522705078125, 0.0028228759765625, 0.013916015625, 0.01025390625, 0.031494140625, -0.0244140625, 0.029541015625, -0.007415771484375, 0.01031494140625, 0.012451171875, 0.02734375, 0.00347900390625, 0.0128173828125,...	[ 11249, 33022, 195625, 5844, 32354, 678, 61475, 35431, 20625, 142508, 47, 23, 80934, 1556, 1830, 1022, 425, 7, 563, 4904, 831, 61924, 1884, 60818, 32233, 142267, 6863, 42518 ]	[ 0.051666259765625, 0.1513671875, 0.21337890625, 0.14306640625, 0.166015625, 0.0841064453125, 0.171142578125, 0.228759765625, 0.1412353515625, 0.2197265625, 0.0203399658203125, 0.02862548828125, 0.087890625, 0.1363525390625, 0.0989990234375, 0.0196685791015625, 0.05902099609375, 0.0...	embed
26659648_c0	26659648	haskell	0	Title: How does this do block work? Problem title: How does this do block work? Tags: syntax, haskell Problem: How does this do block work? I just started learning haskell a few weeks ago and I saw this: moves = do f <- [(+), subtract] g <- [(+), subtract] (x, y) <- [(1, 2), (2, 1)] [f x *** g y] I haven't seen a do bl...	How does this do block work? How does this do block work? syntax haskell How How does this do block work? I just started learning haskell a few weeks ago and I saw this: I haven't seen a do block ending in a list before, it was part of a solution to the knights tour problem.. Can somebody explain how it works?	[ -0.002899169921875, 0.01300048828125, -0.000946044921875, 0.00714111328125, -0.0057373046875, 0.014404296875, -0.00958251953125, 0.002227783203125, 0.032470703125, -0.01385498046875, -0.00250244140625, -0.0135498046875, -0.008544921875, -0.0147705078125, -0.045166015625, -0.00830078125...	[ 11249, 14602, 903, 54, 46389, 4488, 6002, 86531, 1556, 142508, 26859, 52080, 24124, 38246, 51592, 10, 86658, 23, 5303, 8108, 29806, 54350, 7, 9742, 2967, 73342, 3642, 442, 43240 ]	[ 0.1322021484375, 0.1295166015625, 0.1630859375, 0.16796875, 0.27734375, 0.185791015625, 0.039398193359375, 0.11328125, 0.1328125, 0.2010498046875, 0.003082275390625, 0.063232421875, 0.03955078125, 0.002777099609375, 0.060577392578125, 0.0252838134765625, 0.1793212890625, 0.03347778...	embed
19238091_c0	19238091	haskell	0	Title: Union Function in Haskell Problem title: Union Function in Haskell Tags: union, haskell Problem: Union Function in Haskell I have been getting my hands around coding in Haskell, but couldn't grasp the idea of implementing union function. I have also found some function definition embedded inside the Haskell plat...	Union Function in Haskell Union Function in Haskell union haskell Union Haskell Union Function in Haskell I have been getting my hands around coding in Haskell, but couldn't grasp the idea of implementing union function. I have also found some function definition embedded inside the Haskell platform. but the problem is...	[ 0.0159912109375, 0.047119140625, 0.0137939453125, -0.005462646484375, 0.0028533935546875, 0.007720947265625, -0.0203857421875, -0.0035858154296875, -0.006927490234375, -0.0194091796875, 0.0022125244140625, -0.036376953125, 0.00347900390625, 0.0185546875, -0.00848388671875, 0.0168457031...	[ 32528, 28670, 10763, 23, 20625, 142508, 69941, 1556, 44540, 10932, 552, 6238, 69427, 18, 27689, 254, 6528, 29479, 32354, 80934, 55720, 69819, 46132, 13651, 2967, 3871, 22021, 28219, 3917, 3249, 4488, 4358 ]	[ 0.289306640625, 0.2110595703125, 0.097412109375, 0.07110595703125, 0.1243896484375, 0.2186279296875, 0.259765625, 0.1212158203125, 0.02557373046875, 0.016021728515625, 0.0858154296875, 0.0182037353515625, 0.031402587890625, 0.016754150390625, 0.05682373046875, 0.046661376953125, 0.05...	embed
21726509_c0	21726509	haskell	0	Title: Filter with two conditions Problem title: Filter with two conditions Tags: list, haskell, filter Problem: Filter with two conditions I have a list like this: [('a','b',13), ('c','b', 2), ('c','d',4)]. And I want to remove the element ('a', 'b', 13), but I can't do it like this: filter (\(a,b,w) -> a /= 'a' && b ...	Filter with two conditions Filter with two conditions list haskell filter Filter Filter with two conditions I have a list like this: [('a','b',13), ('c','b', 2), ('c','d',4)]. And I want to remove the element ('a', 'b', 13), but I can't do it like this: This also removes ('c', 'b', 2). I'm new to haskell and don't real...	[ 0.0194091796875, 0.015625, -0.0255126953125, 0.0162353515625, -0.004364013671875, 0.001739501953125, 0.0009613037109375, 0.00616455078125, 0.0203857421875, 0.0205078125, -0.0001659393310546875, 0.0036468505859375, 0.00159454345703125, 0.0118408203125, -0.0361328125, 0.01507568359375, ...	[ 128896, 678, 6626, 27289, 5303, 1556, 142508, 46312, 765, 10, 1884, 903, 11, 275, 63258, 238, 4958, 71, 29557, 3444, 47, 87388, 70, 12830, 702, 831, 18, 2843, 7, 216806 ]	[ 0.274658203125, 0.1221923828125, 0.2080078125, 0.249267578125, 0.176513671875, 0.1505126953125, 0.216796875, 0.192626953125, 0.031402587890625, 0.012359619140625, 0.05029296875, 0.043701171875, 0.0545654296875, 0.1090087890625, 0.1492919921875, 0.07769775390625, 0.10186767578125, 0...	embed
45514315_c1	45514315	haskell	1	what exactly happens. First: pure (\x y -> (x,y)) => P (\inp1 -> [(\x y -> (x,y), inp1)]) I have now a parser with one parameter. Then: P (\inp1 -> [(\x y -> (x,y), inp1)]) <*> item => P (\inp2 -> case parse (\inp1 -> [(\x y -> (x,y), inp1)]) inp2 of ??? I really don't understand what happens here. Can someone explain...	what exactly happens. First: pure (\x y -> (x,y)) => P (\inp1 -> [(\x y -> (x,y), inp1)]) I have now a parser with one parameter. Then: P (\inp1 -> [(\x y -> (x,y), inp1)]) <*> item => P (\inp2 -> case parse (\inp1 -> [(\x y -> (x,y), inp1)]) inp2 of ??? I really don't understand what happens here. Can someone explain...	[ 0.0022735595703125, 0.0294189453125, 0.004547119140625, 0.00823974609375, -0.0003223419189453125, 0.038818359375, -0.00897216796875, -0.046875, 0.017822265625, -0.005157470703125, 0.015869140625, -0.004486083984375, -0.004302978515625, 0.0179443359375, -0.0142822265625, 0.0048828125, ...	[ 2367, 66161, 96276, 5, 23972, 34166, 425, 113, 33079, 53, 44357, 436, 73, 254, 418, 23, 17727, 16, 366, 2189, 1632, 171859, 1639, 35735, 304, 7225, 184, 111, 37336, 6183, 2301, 18, 28219, 3688, 4171, 22008, 73342, 29954, 5036, 24189, 35...	[ 0.0662841796875, 0.091552734375, 0.16796875, 0.0555419921875, 0.0313720703125, 0.259521484375, 0.0489501953125, 0.11962890625, 0.0794677734375, 0.0596923828125, 0.04412841796875, 0.1258544921875, 0.1053466796875, 0.151123046875, 0.06597900390625, 0.1361083984375, 0.0684814453125, 0...	embed
37088840_c1	37088840	haskell	1	phi' . (mv m) ) v sc2 :: Floating a => [a] -> [Matrix a] -> a sc2 v [m1, m2] = foldr (+) 0 $ (phi' . (mv m2) . phi' . (mv m1) ) v Code signals: Numeric.AD.Mode.Reverse, Data.Traversable, Data.Foldable, Automatic, Haskell, Numeric.AD, LANGUAGE, DeriveTraversable, DeriveFunctor, DeriveFoldable, Non-linear, x:xs, Matrix, ...	phi' . (mv m) ) v sc2 :: Floating a => [a] -> [Matrix a] -> a sc2 v [m1, m2] = foldr (+) 0 $ (phi' . (mv m2) . phi' . (mv m1) ) v Code signals: Numeric.AD.Mode.Reverse, Data.Traversable, Data.Foldable, Automatic, Haskell, Numeric.AD, LANGUAGE, DeriveTraversable, DeriveFunctor, DeriveFoldable, Non-linear, x:xs, Matrix, ...	[ -0.025390625, 0.031494140625, 0.002471923828125, 0.00433349609375, 0.0257568359375, 0.0194091796875, -0.01251220703125, 0.0198974609375, 0.0286865234375, -0.021484375, -0.00173187255859375, 0.03125, 0.01397705078125, -0.02001953125, -0.037353515625, -0.00225830078125, -0.024780273437...	[ 44171, 25, 6, 5, 334, 347, 81, 9023, 304, 1984, 38699, 26518, 10, 44357, 11, 33079, 4613, 87427, 39, 418, 90173, 2203, 18344, 7569, 22183, 757, 3650, 19379, 10461, 17727, 28864, 26073, 7, 12, 93511, 1771, 12351, 9083, 4332, 37676, 11809...	[ 0.2296142578125, 0.168212890625, 0.0292816162109375, 0.0587158203125, 0.171875, 0.122802734375, 0.18310546875, 0.1265869140625, 0.1754150390625, 0.050048828125, 0.2061767578125, 0.177978515625, 0.1136474609375, 0.038299560546875, 0.05804443359375, 0.0357666015625, 0.035064697265625, ...	embed
40566508_c0	40566508	haskell	0	Title: How do you implement Haskell's IO type in Java? Problem title: How do you implement Haskell's IO type in Java? Tags: haskell, java Problem: How do you implement Haskell's IO type in Java? Code signals: java.util.function, java.util.ArrayList, How, Haskell, Java, World, Tuple, ArrayList, this.stdin, thi...	How do you implement Haskell's IO type in Java? How do you implement Haskell's IO type in Java? haskell java java.util.function java.util.ArrayList How Haskell Java World Tuple ArrayList this.stdin this.stdout this.fst this.snd this.transform io.transform.apply f.apply result.snd ioB.transform.apply result.fs...	[ 0.0027923583984375, -0.00543212890625, 0.02197265625, 0.0283203125, 0.009033203125, 0.00116729736328125, -0.0087890625, -0.0108642578125, -0.009033203125, 0.0169677734375, 0.0234375, -0.03173828125, -0.00933837890625, 0.00921630859375, -0.015869140625, -0.005096435546875, 0.005371093...	[ 11249, 54, 29479, 20625, 142508, 3768, 17780, 10644, 23, 41925, 1556, 79, 330, 5, 3675, 137175, 7092, 154663, 6661, 1371, 8705, 69253, 903, 271, 3035, 1003, 2208, 215175, 22995, 9007, 1238, 16750, 571, 24071, 29223, 134549, 5117, 81887, 979...	[ 0.08624267578125, 0.021270751953125, 0.2020263671875, 0.163330078125, 0.270751953125, 0.12548828125, 0.2183837890625, 0.2244873046875, 0.09735107421875, 0.259765625, 0.144287109375, 0.07623291015625, 0.1368408203125, 0.00689697265625, 0.088134765625, 0.0682373046875, 0.0526123046875,...	embed
27463253_c0	27463253	haskell	0	Title: validating haskell-platform compiled from source? Problem title: validating haskell-platform compiled from source? Tags: cabal, haskell-platform, haskell, ghc Problem: validating haskell-platform compiled from source? Is there a recommended way to validate Haskell Platform built from source? I do see a test targ...	validating haskell-platform compiled from source? validating haskell-platform compiled from source? cabal haskell-platform haskell ghc source Makefile platform.sh validating haskell-platform compiled from source? Is there a recommended way to validate Haskell Platform built from source? I do see a test target in the GH...	[ -0.0042724609375, 0.0198974609375, 0.020263671875, 0.0179443359375, 0.0012054443359375, 0.0036773681640625, -0.0223388671875, -0.02001953125, -0.0012359619140625, 0.0140380859375, 0.037109375, -0.01239013671875, 0.0240478515625, -0.00159454345703125, -0.01123046875, 0.01312255859375, ...	[ 44622, 1916, 1556, 142508, 172121, 375, 5974, 297, 1295, 31344, 32, 109524, 31380, 238, 26176, 29822, 13651, 1495, 170198, 3917, 47, 67, 20625, 70968, 88303, 1957, 3034, 30388, 527, 73265, 18, 48903, 40059, 5, 26499 ]	[ 0.2332763671875, 0.1038818359375, 0.1568603515625, 0.24609375, 0.23583984375, 0.039886474609375, 0.15380859375, 0.029510498046875, 0.1568603515625, 0.23046875, 0.013427734375, 0.1788330078125, 0.09686279296875, 0.0877685546875, 0.1156005859375, 0.2000732421875, 0.2236328125, 0.1293...	embed
66324364_c1	66324364	haskell	1	the files searched for. \| 4 \| import Graphics.Gloss \| ^^^^^^^^^^^^^^^^^^^^^ I am unsure what the problem here is and how to solve it. Code signals: Graphics.Gloss, Adding, LICENSE, package.yaml, stack.yaml, README.md, stack.yaml.lock, Setup.hs, project39.cabal, TAGS, acme-missiles-0.3, github.com, stack.git, e7b331f14...	the files searched for. \| 4 \| import Graphics.Gloss \| ^^^^^^^^^^^^^^^^^^^^^ I am unsure what the problem here is and how to solve it. Code signals: Graphics.Gloss, Adding, LICENSE, package.yaml, stack.yaml, README.md, stack.yaml.lock, Setup.hs, project39.cabal, TAGS, acme-missiles-0.3, github.com, stack.git, e7b331f14...	[ -0.01348876953125, -0.0027313232421875, -0.0027313232421875, 0.01708984375, -0.0306396484375, 0.0223388671875, 0.00225830078125, -0.01251220703125, 0.0057373046875, 0.01904296875, 0.00799560546875, -0.035400390625, 0.001708984375, 0.0145263671875, 0.005584716796875, 0.01416015625, -0...	[ 70, 102158, 33938, 297, 100, 5, 58745, 201, 24927, 189682, 7, 724, 2400, 6, 16377, 15729, 87, 444, 51646, 2967, 3688, 86869, 442, 28864, 26073, 12, 62, 59725, 107615, 207771, 98169, 14520, 141, 177261, 188300, 10611, 54686, 21135, 19943, ...	[ 0.04229736328125, 0.240478515625, 0.19873046875, 0.123291015625, 0.1490478515625, 0.043060302734375, 0.03314208984375, 0.1461181640625, 0.2130126953125, 0.2158203125, 0.1678466796875, 0.08856201171875, 0.2127685546875, 0.006805419921875, 0.000152587890625, 0.040435791015625, 0.006683...	embed
31481037_c0	31481037	haskell	0	Title: Numeric matrix tiles in Haskell Problem title: Numeric matrix tiles in Haskell Tags: haskell Problem: Numeric matrix tiles in Haskell Having a numeric matrix, how can tiles be extracted from it using Haskell? Example: Int -> Int -> Int -> Int -> [Int] -> Int -> Int -> [Int] getTile height width x y xs matrix_hei...	Numeric matrix tiles in Haskell Numeric matrix tiles in Haskell haskell Numeric Haskell matrix_height matrix_width Numeric matrix tiles in Haskell Having a numeric matrix, how can tiles be extracted from it using Haskell? Example:	[ 0.008544921875, -0.0017852783203125, 0.012451171875, -0.0098876953125, 0.0113525390625, 0.007537841796875, -0.0322265625, -0.0057373046875, 0.00628662109375, 0.00823974609375, -0.007354736328125, -0.01385498046875, -0.0244140625, -0.00860595703125, -0.01708984375, -0.00799560546875, ...	[ 93511, 1771, 50944, 425, 139, 90, 23, 20625, 142508, 1556, 1106, 22553, 146984, 171855, 54744, 238, 3642, 831, 125663, 297, 1295, 442, 17368, 89536 ]	[ 0.14794921875, 0.02435302734375, 0.1925048828125, 0.09716796875, 0.19091796875, 0.08966064453125, 0.03680419921875, 0.1279296875, 0.232421875, 0.113525390625, 0.08416748046875, 0.0732421875, 0.14208984375, 0.00618743896484375, 0.1832275390625, 0.032958984375, 0.051544189453125, 0.0...	embed
32223008_c0	32223008	haskell	0	Title: What's the difference between Const and Constant? Problem title: What's the difference between Const and Constant? Tags: haskell Problem: What's the difference between Const and Constant? There seems to be two implementations of the constant functor: Const in Control.Applicative Constant in Data.Functo...	What's the difference between Const and Constant? What's the difference between Const and Constant? haskell What Constant Control.Applicative Data.Functor.Constant What's the difference between Const and Constant? There seems to be two implementations of the constant functor: Const in Control.Applicative Cons...	[ 0.019287109375, 0.0048828125, -0.00167083740234375, 0.0028839111328125, 0.034912109375, 0.0069580078125, -0.01019287109375, -0.01287841796875, 0.001068115234375, -0.002838134765625, -0.00159454345703125, -0.0281982421875, 0.0194091796875, 0.0439453125, -0.01708984375, 0.03125, 0.0117...	[ 4865, 3768, 70, 60212, 17721, 1657, 271, 136, 148416, 1556, 142508, 27131, 39179, 11048, 11809, 97249, 18770, 11935, 42539, 37202, 6626, 208124, 53697, 7477, 23, 5, 4935, 44084, 15044, 2856, 32316, 5608, 4527 ]	[ 0.033477783203125, 0.072509765625, 0.069580078125, 0.1993408203125, 0.1229248046875, 0.2000732421875, 0.2476806640625, 0.1209716796875, 0.291015625, 0.1329345703125, 0.2322998046875, 0.2060546875, 0.068359375, 0.1197509765625, 0.1126708984375, 0.09393310546875, 0.1658935546875, 0.1...	embed
13575041_c0	13575041	haskell	0	Title: is the Y-Combinator a monad? Problem title: is the Y-Combinator a monad? Tags: functional-programming, haskell, lisp Problem: is the Y-Combinator a monad? I'm trying to understand the similarities between abstracting functions using the y-combinator and the continuation monad. Intuitively, it feels to me like th...	is the Y-Combinator a monad? is the Y-Combinator a monad? functional-programming haskell lisp Y-Combinator is the Y-Combinator a monad? I'm trying to understand the similarities between abstracting functions using the y-combinator and the continuation monad. Intuitively, it feels to me like they have things in common, ...	[ -0.0027008056640625, 0.00177764892578125, 0.0225830078125, 0.0230712890625, 0.026611328125, 0.004669189453125, -0.0020599365234375, -0.015380859375, -0.0257568359375, -0.022705078125, -0.00665283203125, -0.0126953125, -0.01025390625, -0.036376953125, -0.004974365234375, -0.005645751953...	[ 83, 70, 990, 9, 10770, 19155, 1290, 10, 2667, 712, 32, 123309, 28966, 1556, 142508, 400, 7008, 28219, 21373, 31075, 164789, 214, 32354, 17368, 113, 277, 9454, 1363, 18425, 12319, 1884, 39210, 217064, 35166, 4358 ]	[ 0.0869140625, 0.03759765625, 0.2398681640625, 0.07196044921875, 0.120361328125, 0.2403564453125, 0.181884765625, 0.0958251953125, 0.1536865234375, 0.213134765625, 0.009918212890625, 0.1190185546875, 0.08221435546875, 0.08062744140625, 0.1790771484375, 0.0712890625, 0.1365966796875, ...	embed
35257487_c0	35257487	haskell	0	Title: Haskell IDE Leskah cannot install Problem title: Haskell IDE Leskah cannot install Tags: haskell, leksah Problem: Haskell IDE Leskah cannot install Code signals: Haskell, IDE, Leskah, libgtksourceview-3.0-dev, libwebkitgtk-3.0-dev, Cabal, XFlexibleContexts, gtk2hs-buildtools, Installing, Installed, gtk2hs-buildt...	Haskell IDE Leskah cannot install Haskell IDE Leskah cannot install haskell leksah Haskell IDE Leskah libgtksourceview-3.0-dev libwebkitgtk-3.0-dev Cabal XFlexibleContexts gtk2hs-buildtools Installing Installed gtk2hs-buildtools-0.13.0.5 Resolving Could leksah-0.15.1.4 hlint-1.9.28 haskell-src-exts-1.17.1 haskell-src-e...	[ 0.00469970703125, 0.0250244140625, 0.0037689208984375, -0.00921630859375, -0.00445556640625, 0.00390625, -0.005828857421875, -0.0174560546875, -0.0002231597900390625, 0.02978515625, 0.013916015625, -0.044677734375, 0.006683349609375, 0.0040283203125, 0.00811767578125, 0.0103759765625, ...	[ 20625, 142508, 36497, 1734, 6577, 53418, 20600, 1556, 17143, 23474, 25474, 5386, 92, 60427, 22751, 132265, 18548, 9488, 30438, 289, 1193, 74070, 28236, 22829, 31472, 304, 127, 177149, 89110, 107951, 93645, 132944, 191147, 1837, 91977, 75084, 42...	[ 0.1309814453125, 0.2408447265625, 0.2286376953125, 0.1685791015625, 0.248779296875, 0.1474609375, 0.209716796875, 0.1314697265625, 0.13232421875, 0.2318115234375, 0.053497314453125, 0.0672607421875, 0.0233306884765625, 0.06597900390625, 0.1907958984375, 0.13037109375, 0.099853515625,...	embed
15529785_c0	15529785	haskell	0	Title: How to generate Intel assembler syntax from ghc of haskell? Problem title: How to generate Intel assembler syntax from ghc of haskell? Tags: assembly, ghc, haskell Problem: How to generate Intel assembler syntax from ghc of haskell? I know there is a -S flag in ghc in haskell, and it generates a .s file which is...	How to generate Intel assembler syntax from ghc of haskell? How to generate Intel assembler syntax from ghc of haskell? assembly ghc haskell ghc How Intel How to generate Intel assembler syntax from ghc of haskell? I know there is a -S flag in ghc in haskell, and it generates a .s file which is an assembling file. I am...	[ -0.0086669921875, -0.0096435546875, -0.00494384765625, 0.0079345703125, -0.0230712890625, -0.0023040771484375, -0.031982421875, -0.006866455078125, -0.0191650390625, -0.018798828125, -0.002532958984375, -0.0145263671875, -0.0040283203125, -0.01904296875, 0.0032958984375, -0.00637817382...	[ 11249, 47, 139392, 24018, 93457, 42, 6002, 86531, 1295, 31380, 238, 111, 1556, 142508, 89845, 38526, 3714, 2685, 20, 294, 49938, 23, 5, 7, 11435, 10, 79298, 527, 73265, 7722, 678 ]	[ 0.08642578125, 0.06036376953125, 0.216064453125, 0.2127685546875, 0.236328125, 0.142333984375, 0.1568603515625, 0.198486328125, 0.0953369140625, 0.117431640625, 0.12158203125, 0.071044921875, 0.1256103515625, 0.219482421875, 0.178955078125, 0.0263214111328125, 0.01385498046875, 0.0...	embed
25427590_c0	25427590	haskell	0	Title: Why "and []" is True and "or []" is False Problem title: Why "and []" is True and "or []" is False Tags: monoids, haskell Problem: Why "and []" is True and "or []" is False Why "and" on an empty list returns true, does it imply that an empty list holds True? Sorry but I ca...	Why "and []" is True and "or []" is False Why "and []" is True and "or []" is False monoids haskell Why Prelude Why "and []" is True and "or []" is False Why "and" on an empty list returns true, does it imply that an empty list holds True? Sorry but I cannot read and comprehend t...	[ 0.013671875, -0.0030670166015625, -0.000377655029296875, 0.01324462890625, -0.01025390625, 0.0225830078125, 0.00958251953125, -0.0128173828125, 0.00131988525390625, 0.013916015625, -0.00238037109375, -0.024658203125, -0.01336669921875, 0.00885009765625, -0.0101318359375, -0.01721191406...	[ 44084, 41502, 2940, 378, 268, 83, 87599, 136, 748, 74, 22225, 184, 22460, 30185, 1556, 142508, 1914, 822, 112, 44, 98, 201505, 5303, 30646, 7, 29568, 14602, 442, 21980, 16401, 90502, 53418, 12301, 232460, 26785 ]	[ 0.1749267578125, 0.1187744140625, 0.2445068359375, 0.0352783203125, 0.0594482421875, 0.0726318359375, 0.195068359375, 0.1268310546875, 0.1995849609375, 0.000244140625, 0.1448974609375, 0.1219482421875, 0.133056640625, 0.139892578125, 0.108154296875, 0.2095947265625, 0.0794677734375, ...	embed
40710801_c1	40710801	haskell	1	foo = bar (Proxy :: Proxy t) bar :: forall t1 . () => Proxy t1 -> NS (NP I) (Code t1) -> DSum (GTag t1) (NP I) bar _ (Z x) = GTag (Z Refl) :=> x bar _ (S x) = undefined Code signals: Data.Dependent.Sum, Data.GADT.Compare, Data.Proxy, Generics.SOP, qualified, where, How, Tag-shaped, DSum, LANGUAGE, GADTs, DataKinds, Ty...	foo = bar (Proxy :: Proxy t) bar :: forall t1 . () => Proxy t1 -> NS (NP I) (Code t1) -> DSum (GTag t1) (NP I) bar _ (Z x) = GTag (Z Refl) :=> x bar _ (S x) = undefined Code signals: Data.Dependent.Sum, Data.GADT.Compare, Data.Proxy, Generics.SOP, qualified, where, How, Tag-shaped, DSum, LANGUAGE, GADTs, DataKinds, Ty...	[ 0.0084228515625, 0.0145263671875, -0.00048065185546875, -0.017822265625, 0.01263427734375, 0.004425048828125, -0.00982666015625, 0.00860595703125, 0.000453948974609375, -0.0247802734375, 0.0004138946533203125, 0.00170135498046875, -0.0101318359375, -0.001129150390625, -0.0162353515625, ...	[ 5775, 31, 2203, 1909, 10752, 50878, 1984, 1250, 808, 100, 5584, 418, 52700, 28814, 87, 114211, 17727, 41869, 316, 724, 66448, 1511, 1022, 527, 53295, 141, 9232, 5983, 297, 28864, 26073, 11809, 26885, 294, 5, 14849, 41072, 108161, 1046, 88...	[ 0.203369140625, 0.1978759765625, 0.07110595703125, 0.199951171875, 0.1605224609375, 0.254150390625, 0.027313232421875, 0.1688232421875, 0.109130859375, 0.04888916015625, 0.160400390625, 0.035552978515625, 0.120361328125, 0.105224609375, 0.08294677734375, 0.1771240234375, 0.0480346679...	embed
19725292_c0	19725292	haskell	0	Title: How to reverse an integer in haskell? Problem title: How to reverse an integer in haskell? Tags: haskell, int, integer Problem: How to reverse an integer in haskell? I need help on how to reverse a Integer in Haskell with the following type signature: reverseInt :: Integer -> Integer reverseInt a = undefined -- ...	How to reverse an integer in haskell? How to reverse an integer in haskell? haskell int integer How Integer How to reverse an integer in haskell? I need help on how to reverse a Integer in Haskell with the following type signature: I need the Integer input number to be reversed like the example below. Example:	[ -0.046875, 0.019287109375, 0.0186767578125, 0.0264892578125, -0.008544921875, 0.02587890625, 0.01409912109375, -0.0037384033203125, -0.0025177001953125, -0.0203857421875, 0.00110626220703125, 0.007080078125, -0.00732421875, 0.0279541015625, 0.01171875, -0.00101470947265625, 0.0043334...	[ 11249, 47, 39531, 184, 142, 892, 1505, 23, 1556, 142508, 32, 18, 44401, 3871, 4358, 3642, 10, 20625, 678, 25632, 10644, 138256, 107730, 14012, 186, 5281, 1884, 27781, 35064, 89536 ]	[ 0.093994140625, 0.10540771484375, 0.2225341796875, 0.16162109375, 0.0548095703125, 0.15673828125, 0.173095703125, 0.09320068359375, 0.1627197265625, 0.2333984375, 0.0079345703125, 0.089111328125, 0.1966552734375, 0.06793212890625, 0.048583984375, 0.047821044921875, 0.0221710205078125...	embed
7213676_c0	7213676	haskell	0	Title: forall in Scala Problem title: forall in Scala Tags: scala, haskell, forall Problem: forall in Scala As shown below, in Haskell, it's possible to store in a list values with heterogeneous types with certain context bounds on them: data ShowBox = forall s. Show s => ShowBox s heteroList :: [ShowBox] heteroList = ...	forall in Scala forall in Scala scala haskell forall Scala ShowBox Show forall in Scala As shown below, in Haskell, it's possible to store in a list values with heterogeneous types with certain context bounds on them: How can I achieve the same in Scala, preferably without subtyping?	[ 0.0286865234375, 0.0050048828125, -0.006805419921875, -0.00848388671875, -0.00897216796875, -0.0262451171875, 0.00958251953125, -0.00063323974609375, 0.0142822265625, -0.0028839111328125, -0.009033203125, -0.03857421875, 0.00933837890625, -0.00102996826171875, -0.00177001953125, -0.012...	[ 100, 5584, 23, 152653, 11, 146232, 1556, 142508, 17367, 72295, 127887, 35064, 20625, 7722, 4343, 5303, 142424, 678, 77099, 15292, 52895, 24233, 43701, 99091, 69307, 5701, 15490, 1614, 46280 ]	[ 0.1351318359375, 0.2222900390625, 0.07171630859375, 0.2105712890625, 0.1650390625, 0.1947021484375, 0.11529541015625, 0.237060546875, 0.1273193359375, 0.1727294921875, 0.0005488395690917969, 0.0230712890625, 0.11920166015625, 0.09088134765625, 0.166259765625, 0.1705322265625, 0.17517...	embed
47817114_c0	47817114	haskell	0	Title: Non type-variable argument for MonadWriter Problem title: Non type-variable argument for MonadWriter Tags: haskell, monads Problem: Non type-variable argument for MonadWriter I just tried to use writer : writer (5, "Hello, World") But I noticed I get an error: Non type-variable argument in the constraint MonadWr...	Non type-variable argument for MonadWriter Non type-variable argument for MonadWriter haskell monads Non MonadWriter Hello World Char Non type-variable argument for MonadWriter I just tried to use writer : But I noticed I get an error: But I wonder what constraint I don't fulfill? [a] after all is a Monoid...	[ -0.030029296875, 0.0194091796875, 0.0079345703125, 0.0198974609375, 0.0233154296875, -0.00147247314453125, -0.00823974609375, -0.02099609375, -0.0235595703125, -0.00531005859375, -0.00958251953125, -0.0225830078125, 0.01068115234375, -0.000797271728515625, 0.006317138671875, -0.0180664...	[ 3775, 10644, 21690, 2886, 10750, 60331, 71, 1456, 2783, 56, 1556, 142508, 2667, 712, 35378, 6661, 21656, 37842, 4527, 70035, 156672, 18499, 32195, 158, 2816, 4288, 2301, 18, 211394, 11, 7103, 756, 83, 77879, 532 ]	[ 0.1865234375, 0.2154541015625, 0.172607421875, 0.057403564453125, 0.2352294921875, 0.16455078125, 0.09375, 0.119140625, 0.2003173828125, 0.128173828125, 0.1025390625, 0.208740234375, 0.108154296875, 0.1292724609375, 0.1285400390625, 0.1109619140625, 0.11962890625, 0.07135009765625,...	embed
7961604_c0	7961604	haskell	0	Title: Fixing issues noted by ghc-pkg check Problem title: Fixing issues noted by ghc-pkg check Tags: haskell, dependencies, ghc Problem: Fixing issues noted by ghc-pkg check It's rather nice that ghc-pkg check will list broken packages, and why they are broken. But as far as I know, there is no automated way to take c...	Fixing issues noted by ghc-pkg check Fixing issues noted by ghc-pkg check haskell dependencies ghc Fixing Fixing issues noted by ghc-pkg check It's rather nice that ghc-pkg check will list broken packages, and why they are broken. But as far as I know, there is no automated way to take care of those broken packages. Wh...	[ -0.00921630859375, -0.01141357421875, 0.01422119140625, 0.01141357421875, -0.0174560546875, 0.0184326171875, -0.027587890625, -0.007049560546875, 0.005645751953125, 0.0238037109375, 0.00885009765625, -0.01373291015625, 0.00238037109375, 0.025390625, 0.0111083984375, 0.008544921875, 0...	[ 96746, 214, 37348, 959, 31380, 238, 8517, 12765, 1556, 142508, 42548, 254, 43257, 26267, 1221, 5303, 148431, 98169, 15400, 621, 110, 11408, 3917, 5646, 517, 111, 8382, 70, 170198, 47, 35142, 678, 7, 2875, 80383, 527, 73265 ]	[ 0.161865234375, 0.014068603515625, 0.1224365234375, 0.0706787109375, 0.1309814453125, 0.148193359375, 0.1868896484375, 0.183349609375, 0.08984375, 0.1617431640625, 0.1453857421875, 0.0193023681640625, 0.03955078125, 0.057586669921875, 0.002777099609375, 0.09814453125, 0.1710205078125...	embed
8554756_c0	8554756	haskell	0	Title: Sum over Haskell Map Problem title: Sum over Haskell Map Tags: dictionary, haskell Problem: Sum over Haskell Map Is there a standard function to sum all values in a Haskell map. My Map reads something like [(a,2),(b,4),(c,6)]? Essentially what I am trying to do is a normalized frequency distribution. So the valu...	Sum over Haskell Map Sum over Haskell Map dictionary haskell Sum Haskell Map Sum over Haskell Map Is there a standard function to sum all values in a Haskell map. My Map reads something like [(a,2),(b,4),(c,6)]? Essentially what I am trying to do is a normalized frequency distribution. So the values of the keys in the ...	[ 0.00445556640625, 0.000640869140625, -0.0035400390625, -0.0208740234375, -0.01544189453125, -0.00482177734375, -0.01080322265625, 0.0034332275390625, 0.0026397705078125, -0.017333984375, 0.002105712890625, -0.003326416015625, 0.0306396484375, -0.004913330078125, 0.0002994537353515625, ...	[ 36335, 645, 20625, 142508, 42719, 45, 10763, 1556, 2071, 2685, 10, 5570, 32354, 47, 10554, 756, 142424, 23, 22288, 12301, 1884, 10461, 275, 29557, 238, 59690, 179769, 31577, 3638, 29367, 12478, 944, 113068, 22799, 36917, 54529, 100, 3871, 2...	[ 0.249267578125, 0.1746826171875, 0.1519775390625, 0.25341796875, 0.2127685546875, 0.00921630859375, 0.08001708984375, 0.1298828125, 0.0133056640625, 0.04510498046875, 0.05438232421875, 0.1925048828125, 0.187744140625, 0.10498046875, 0.2607421875, 0.155517578125, 0.22607421875, 0.08...	embed
54539981_c0	54539981	haskell	0	Title: Pattern matching on the last element of a List Problem title: Pattern matching on the last element of a List Tags: haskell, pattern-matching Problem: Pattern matching on the last element of a List we use (x:xs) to pattern match on the first element as in this example : head' :: [a] -> a head' xs = case xs of [] ...	Pattern matching on the last element of a List Pattern matching on the last element of a List haskell pattern-matching Pattern List x:xs x:_ Pattern matching on the last element of a List we use (x:xs) to pattern match on the first element as in this example : is there a way to pattern match on the last element ?	[ -0.005279541015625, 0.033203125, -0.001983642578125, -0.0213623046875, -0.0140380859375, 0.01220703125, -0.00799560546875, 0.005859375, 0.017822265625, 0.006256103515625, 0.029296875, -0.03466796875, 0.02197265625, -0.00067901611328125, -0.00494384765625, -0.0084228515625, 0.01647949...	[ 9876, 22766, 14858, 214, 98, 4568, 12830, 111, 32036, 1556, 142508, 103510, 98753, 1022, 12, 425, 7, 454, 4527, 5117, 23, 27781, 83, 2685, 3917, 47 ]	[ 0.1575927734375, 0.140380859375, 0.218017578125, 0.077880859375, 0.082763671875, 0.2098388671875, 0.143798828125, 0.0001220703125, 0.1724853515625, 0.1092529296875, 0.1910400390625, 0.221923828125, 0.21044921875, 0.045928955078125, 0.06256103515625, 0.08819580078125, 0.07366943359375...	embed
62794803_c1	62794803	haskell	1	able s, Mergeable w, Mergeable a, forall a. Mergeable a => Mergeable (m a)) => Mergeable (RWST r w s m a) where symbolicMerge force cond thn els = Lazy.RWST $ symbolicMerge force cond (runRWST thn) (runRWST els) So stripping away all the newtype s, I'd like to branch into something of type r -> s -> (a, s, w) s.t. Merg...	able s, Mergeable w, Mergeable a, forall a. Mergeable a => Mergeable (m a)) => Mergeable (RWST r w s m a) where symbolicMerge force cond thn els = Lazy.RWST $ symbolicMerge force cond (runRWST thn) (runRWST els) So stripping away all the newtype s, I'd like to branch into something of type r -> s -> (a, s, w) s.t. Merg...	[ -0.01251220703125, 0.00787353515625, 0.00579833984375, -0.007110595703125, -0.00787353515625, 0.0098876953125, -0.010986328125, 0.0079345703125, 0.0107421875, 0.020263671875, -0.01287841796875, 0.03955078125, 0.0001544952392578125, 0.0054931640625, 0.000614166259765625, 0.0089721679687...	[ 19048, 91, 6035, 429, 2886, 148, 10, 100, 5584, 44357, 39, 78691, 8545, 1690, 347, 16, 128201, 30248, 37772, 158, 71, 1115, 239, 3285, 3650, 16428, 19, 43613, 3525, 50986, 1884, 32845, 206, 3934, 9844, 10644, 11, 18, 136, 28864, 26073, ...	[ 0.234619140625, 0.1654052734375, 0.194091796875, 0.176513671875, 0.2242431640625, 0.182861328125, 0.167236328125, 0.07269287109375, 0.146484375, 0.004730224609375, 0.064697265625, 0.09442138671875, 0.14794921875, 0.1619873046875, 0.01220703125, 0.005157470703125, 0.1842041015625, 0...	embed
51181957_c0	51181957	haskell	0	Title: which one is the correct way of converting String to ByteString? Problem title: which one is the correct way of converting String to ByteString? Tags: haskell, string Problem: which one is the correct way of converting String to ByteString? I found the following two functions that convert String to ByteString , ...	which one is the correct way of converting String to ByteString? which one is the correct way of converting String to ByteString? haskell string ByteString which one is the correct way of converting String to ByteString? I found the following two functions that convert String to ByteString , which one is the correct wa...	[ 0.01361083984375, 0.00994873046875, -0.002838134765625, 0.00408935546875, -0.021484375, 0.00531005859375, -0.0062255859375, -0.00113677978515625, 0.0021209716796875, 0.016845703125, 0.0159912109375, -0.0247802734375, 0.01275634765625, 0.03173828125, -0.0224609375, 0.003631591796875, ...	[ 3129, 1632, 83, 26785, 3917, 96760, 214, 23351, 47, 3311, 67, 71713, 32, 111, 1556, 142508, 79315, 70, 25632, 6626, 32354, 450, 60212, 11809, 75358, 84068, 1019, 29102, 919, 161063 ]	[ 0.05560302734375, 0.071044921875, 0.045684814453125, 0.1656494140625, 0.091064453125, 0.1763916015625, 0.1729736328125, 0.2127685546875, 0.125732421875, 0.132080078125, 0.183837890625, 0.2254638671875, 0.011474609375, 0.000396728515625, 0.134033203125, 0.2420654296875, 0.216674804687...	embed
28645159_c0	28645159	haskell	0	Title: Why Sum and Product aren't Functors Problem title: Why Sum and Product aren't Functors Tags: haskell, typeclass Problem: Why Sum and Product aren't Functors Sum defined in base 4.7.0.2 doesn't have Functor instance. Why? For example types defined in semigroups package have Functor , Applicative and Mon...	Why Sum and Product aren't Functors Why Sum and Product aren't Functors haskell typeclass Why Sum Product Functors Functor Applicative Monad Min Why Sum and Product aren't Functors Sum defined in base 4.7.0.2 doesn't have Functor instance. Why? For example types defined in semigroups package have Functor , Ap...	[ -0.0018463134765625, 0.017333984375, 0.0152587890625, 0.012939453125, -0.01239013671875, 0.0166015625, -0.0069580078125, -0.0142822265625, 0.01171875, 0.030029296875, -0.01336669921875, 0.0025634765625, 0.0011138916015625, 0.003753662109375, -0.00165557861328125, 0.016357421875, -0.0...	[ 44084, 36335, 136, 73111, 125381, 3768, 18, 28670, 18770, 1556, 142508, 10644, 67413, 5659, 11048, 4935, 60331, 71, 4211, 61924, 3647, 201, 53489, 133684, 22027, 765, 110527, 52895, 36137, 51588, 98169, 98, 68991, 1884, 37379, 2481, 10422 ]	[ 0.108642578125, 0.258544921875, 0.1187744140625, 0.2861328125, 0.0880126953125, 0.0455322265625, 0.1143798828125, 0.212646484375, 0.220947265625, 0.12890625, 0.22021484375, 0.1273193359375, 0.1505126953125, 0.0714111328125, 0.124755859375, 0.06524658203125, 0.1463623046875, 0.07202...	embed
11711996_c0	11711996	haskell	0	Title: randomly choosing and filling datatype Problem title: randomly choosing and filling datatype Tags: haskell Problem: randomly choosing and filling datatype So I have two data types. For simplicity say one holds an Int and one holds a String . So let's say I have data ranData = randInt Int \| randString String How ...	randomly choosing and filling datatype randomly choosing and filling datatype haskell randomly choosing and filling datatype So I have two data types. For simplicity say one holds an Int and one holds a String . So let's say I have How can I make a function that will either choose one of these and then give it a random...	[ -0.0004596710205078125, -0.00762939453125, 0.0030364990234375, 0.0003070831298828125, -0.0125732421875, 0.0196533203125, -0.01373291015625, -0.0029449462890625, 0.00110626220703125, -0.03369140625, 0.0245361328125, -0.013916015625, 0.0015869140625, -0.0014801025390625, -0.00537109375, ...	[ 96759, 538, 218873, 136, 26292, 214, 2053, 50986, 1556, 142508, 765, 6626, 52895, 134381, 1632, 16401, 360, 18, 23351, 11249, 831, 3249, 32354, 1221, 40101, 55076, 111, 6097, 8337, 10, 34292, 25647, 43257, 71216, 5 ]	[ 0.21533203125, 0.044769287109375, 0.1668701171875, 0.09002685546875, 0.1602783203125, 0.05279541015625, 0.14013671875, 0.26123046875, 0.1302490234375, 0.212890625, 0.044219970703125, 0.1055908203125, 0.2359619140625, 0.09423828125, 0.07330322265625, 0.1097412109375, 0.051361083984375...	embed
13670055_c0	13670055	haskell	0	Title: Instance show with Tree data structure Problem title: Instance show with Tree data structure Tags: haskell Problem: Instance show with Tree data structure I am new at haskell and I want to instance Tree a with the class show. data Tree a = Null \|Node (Tree a) a (Tree a) instance Show (Tree a) where show Null = "...	Instance show with Tree data structure Instance show with Tree data structure haskell Instance Tree Node Show Instance show with Tree data structure I am new at haskell and I want to instance Tree a with the class show. Thanks for your help.	[ 0.00628662109375, -0.001739501953125, 0.01544189453125, 0.02197265625, 0.0035400390625, 0.0191650390625, -0.00543212890625, -0.0203857421875, 0.001678466796875, 0.01055908203125, -0.01336669921875, -0.0311279296875, 0.0155029296875, 0.0133056640625, 0.00151824951171875, -0.010803222656...	[ 360, 116071, 7639, 678, 101344, 2053, 45646, 1556, 142508, 438, 112, 17367, 3525, 3444, 47, 110527, 10, 18507, 4358 ]	[ 0.01419830322265625, 0.1763916015625, 0.1744384765625, 0.09356689453125, 0.287353515625, 0.085205078125, 0.1773681640625, 0.1397705078125, 0.183349609375, 0.09930419921875, 0.142822265625, 0.15234375, 0.051727294921875, 0.05047607421875, 0.00582122802734375, 0.2081298828125, 0.078247...	embed
36605036_c0	36605036	haskell	0	Title: cabal build gives parse error, but code works fine in GHCi Problem title: cabal build gives parse error, but code works fine in GHCi Tags: cabal, haskell Problem: cabal build gives parse error, but code works fine in GHCi My code works in GHCi, but when I try to build the project with cabal build , it gives the ...	cabal build gives parse error, but code works fine in GHCi cabal build gives parse error, but code works fine in GHCi cabal haskell GHCi cabal build gives parse error, but code works fine in GHCi My code works in GHCi, but when I try to build the project with cabal build , it gives the error parse error on input ‘<-’ H...	[ 0.00555419921875, 0.006439208984375, -0.01043701171875, 0.012451171875, -0.007110595703125, 0.021728515625, -0.0050048828125, -0.0003070831298828125, -0.00787353515625, -0.0146484375, -0.0019989013671875, -0.03466796875, 0.006256103515625, -0.00897216796875, 0.0205078125, -0.0250244140...	[ 109524, 45367, 76199, 366, 184, 18499, 1284, 18151, 43240, 5885, 23, 527, 73265, 14, 1556, 142508, 9790, 13452, 678, 107730, 16093, 9, 20187, 27781 ]	[ 0.25341796875, 0.232177734375, 0.07861328125, 0.1510009765625, 0.1683349609375, 0.20849609375, 0.07171630859375, 0.1959228515625, 0.08538818359375, 0.11328125, 0.042388916015625, 0.084716796875, 0.1126708984375, 0.1915283203125, 0.0867919921875, 0.1827392578125, 0.043914794921875, ...	embed
24103475_c1	24103475	haskell	1	depends on wxc-0.90.1.1 which failed to install Before this I did and they installed without errors: apt-get install libwxgtk2.8-dev apt-get install libglu-dev apt-get install g++ I also ran $ cabal update How do I fix this? Code signals: this, Unable, Resolving, Compiling, Main, wxc-0.90.1.1-30692, wxc-0.90.1.1, Setu...	depends on wxc-0.90.1.1 which failed to install Before this I did and they installed without errors: apt-get install libwxgtk2.8-dev apt-get install libglu-dev apt-get install g++ I also ran $ cabal update How do I fix this? Code signals: this, Unable, Resolving, Compiling, Main, wxc-0.90.1.1-30692, wxc-0.90.1.1, Setu...	[ -0.00927734375, 0.01806640625, -0.004974365234375, -0.0024261474609375, -0.02392578125, -0.00848388671875, -0.00946044921875, -0.002716064453125, -0.0125732421875, 0.02685546875, -0.004730224609375, -0.05126953125, -0.009521484375, -0.01416015625, -0.0033721923828125, 0.011474609375, ...	[ 56566, 7, 148, 425, 238, 23320, 5039, 83783, 165523, 47, 20600, 15490, 18499, 1747, 18, 3794, 25474, 434, 5386, 92, 82295, 18548, 39529, 706, 37223, 13028, 3650, 109524, 28350, 54, 87, 30022, 903, 28864, 26073, 992, 2886, 132944, 214, 156...	[ 0.188720703125, 0.045989990234375, 0.12255859375, 0.159423828125, 0.1536865234375, 0.03851318359375, 0.254150390625, 0.1268310546875, 0.2083740234375, 0.00115966796875, 0.1617431640625, 0.06500244140625, 0.135498046875, 0.0689697265625, 0.00103759765625, 0.056060791015625, 0.10424804...	embed
29284764_c0	29284764	haskell	0	Title: Haskell, Given two ints and return a list Problem title: Haskell, Given two ints and return a list Tags: recursion, haskell Problem: Haskell, Given two ints and return a list I have a function but I don't really know how to use recursion to implement it.. Could anyone give me some hint? getList :: Int -> Int -> ...	Haskell, Given two ints and return a list Haskell, Given two ints and return a list recursion haskell Haskell Given Haskell, Given two ints and return a list I have a function but I don't really know how to use recursion to implement it.. Could anyone give me some hint? And it has the following performance	[ -0.014892578125, 0.002471923828125, -0.01611328125, 0.0159912109375, 0.00439453125, 0.0211181640625, -0.0201416015625, 0.00872802734375, 0.006744384765625, -0.007598876953125, 0.0126953125, -0.01312255859375, -0.006439208984375, 0.0267333984375, 0.00128173828125, -0.007354736328125, ...	[ 20625, 142508, 77878, 6626, 23, 933, 136, 30646, 5303, 19, 195625, 1830, 1556, 765, 32354, 2301, 18, 6183, 3714, 3642, 4527, 29479, 8337, 5122, 25632, 23718 ]	[ 0.1412353515625, 0.2509765625, 0.137451171875, 0.1846923828125, 0.145263671875, 0.1627197265625, 0.05120849609375, 0.1790771484375, 0.1798095703125, 0.045013427734375, 0.2197265625, 0.1397705078125, 0.1328125, 0.025390625, 0.174560546875, 0.0233306884765625, 0.033935546875, 0.00634...	embed
47704945_c0	47704945	haskell	0	Title: Haskell Lambda Alpha Equivalence Problem title: Haskell Lambda Alpha Equivalence Tags: lambda-calculus, haskell Problem: Haskell Lambda Alpha Equivalence I am trying to write down an alpha equivalence function in Haskell for lambda. data Expr = App Expr Expr \| Lam Int Expr \| Var Int deriving (Show,Eq) I've read ...	Haskell Lambda Alpha Equivalence Haskell Lambda Alpha Equivalence lambda-calculus haskell Haskell Lambda Alpha Equivalence Expr App Lam Show Haskell Lambda Alpha Equivalence I am trying to write down an alpha equivalence function in Haskell for lambda. data Expr = App Expr Expr \| Lam Int Expr \| Var Int deriving (Show,E...	[ 0.00384521484375, 0.021728515625, 0.017578125, 0.0181884765625, 0.00732421875, -0.005584716796875, 0.0079345703125, 0.00830078125, -0.004364013671875, -0.0028839111328125, -0.0003070831298828125, -0.029052734375, 0.0213623046875, 0.012939453125, 0.01190185546875, -0.020751953125, -0....	[ 20625, 142508, 122930, 85, 76569, 145666, 1405, 6620, 21, 6492, 6827, 94739, 1556, 60075, 42, 5659, 59387, 17367, 31577, 33022, 7565, 144, 14612, 224743, 3956, 32354, 2053, 360, 18, 6, 3323, 16406, 6496, 168660, 647, 864, 12301, 1118, 65514...	[ 0.13671875, 0.2568359375, 0.18798828125, 0.1456298828125, 0.253173828125, 0.1202392578125, 0.1649169921875, 0.053619384765625, 0.0516357421875, 0.1923828125, 0.09130859375, 0.1644287109375, 0.1192626953125, 0.156494140625, 0.192626953125, 0.20458984375, 0.1885986328125, 0.160034179...	embed
54496068_c0	54496068	haskell	0	Title: why do i get a Parse input error in haskell Problem title: why do i get a Parse input error in haskell Tags: haskell Problem: why do i get a Parse input error in haskell I get a parse input error and 'e'. Why is this? Fixed my indentations too if not(true) then do g Node value e else return() where f = false g =...	why do i get a Parse input error in haskell why do i get a Parse input error in haskell haskell Parse Node Map.delete Map.insert Nothing why do i get a Parse input error in haskell I get a parse input error and 'e'. Why is this? Fixed my indentations too	[ -0.0167236328125, 0.006011962890625, -0.0115966796875, 0.006561279296875, -0.002349853515625, 0.0255126953125, -0.01171875, -0.0203857421875, 0.006103515625, -0.006378173828125, -0.00469970703125, -0.0091552734375, 0.003082275390625, 0.00616455078125, 0.016357421875, -0.002487182617187...	[ 15400, 54, 2046, 2392, 184, 107730, 18499, 1556, 142508, 10, 23, 438, 112, 42719, 8520, 67, 33657, 182747, 17, 366, 136, 13, 44084, 96746, 18597, 22062 ]	[ 0.1116943359375, 0.0148162841796875, 0.0775146484375, 0.1524658203125, 0.1829833984375, 0.2269287109375, 0.2030029296875, 0.1624755859375, 0.2325439453125, 0.02630615234375, 0.05267333984375, 0.1104736328125, 0.10107421875, 0.1407470703125, 0.1295166015625, 0.06475830078125, 0.073486...	embed
5953293_c0	5953293	haskell	0	Title: cabal install libClang (Haskell) dont work under minGW Problem title: cabal install libClang (Haskell) dont work under minGW Tags: cabal, windows, haskell, clang Problem: cabal install libClang (Haskell) dont work under minGW i always get the error: clang library not found i have installed the newest mingw and h...	cabal install libClang (Haskell) dont work under minGW cabal install libClang (Haskell) dont work under minGW cabal windows haskell clang Haskell cabal install libClang (Haskell) dont work under minGW i always get the error: i have installed the newest mingw and haskell plattform under win7 also i copied the llvm-2.9-m...	[ 0.0028076171875, 0.000820159912109375, 0.007598876953125, 0.00830078125, -0.00077056884765625, -0.00604248046875, 0.01434326171875, -0.01422119140625, -0.015625, 0.0034637451171875, -0.002166748046875, -0.02978515625, 0.0257568359375, -0.002349853515625, 0.0196533203125, -0.00506591796...	[ 109524, 20600, 25474, 441, 3066, 6495, 7, 142508, 13319, 4488, 1379, 881, 102550, 16, 54825, 1556, 501, 20625, 11343, 18499, 765, 297, 3525, 525, 46996, 434, 136, 6, 88402, 19916, 966, 71200, 71, 70, 96, 3723, 39, 5428, 1126, 9, 14578, ...	[ 0.2469482421875, 0.1533203125, 0.133056640625, 0.12060546875, 0.3017578125, 0.1326904296875, 0.12548828125, 0.286865234375, 0.1253662109375, 0.1546630859375, 0.2138671875, 0.1859130859375, 0.2548828125, 0.005828857421875, 0.08819580078125, 0.1529541015625, 0.06121826171875, 0.14074...	embed
25566517_c0	25566517	haskell	0	Title: Can Haskell inline functions passed as an argument? Problem title: Can Haskell inline functions passed as an argument? Tags: haskell, optimization Problem: Can Haskell inline functions passed as an argument? Let's say I pass a small function f to map . Can Haskell inline f with map to produce a small imperative ...	Can Haskell inline functions passed as an argument? Can Haskell inline functions passed as an argument? haskell optimization Can Haskell Can Haskell inline functions passed as an argument? Let's say I pass a small function f to map . Can Haskell inline f with map to produce a small imperative loop? If so, how does Hask...	[ 0.00165557861328125, 0.00019073486328125, 0.025146484375, 0.0028839111328125, -0.01611328125, 0.00069427490234375, -0.0023040771484375, -0.006866455078125, -0.0031890869140625, -0.015380859375, 0.00799560546875, -0.0024871826171875, 0.00390625, 0.0252685546875, 0.01171875, -0.016723632...	[ 4171, 20625, 142508, 23, 2256, 32354, 115081, 237, 142, 10750, 7, 1556, 87235, 27875, 19336, 1238, 47, 22288, 678, 27489, 222530, 13, 40956, 13695, 28560, 6183, 83, 1172, 15555, 22321, 22230 ]	[ 0.0706787109375, 0.146728515625, 0.248046875, 0.1427001953125, 0.23291015625, 0.22265625, 0.1463623046875, 0.08880615234375, 0.05670166015625, 0.2568359375, 0.041107177734375, 0.10595703125, 0.1343994140625, 0.11328125, 0.09771728515625, 0.1412353515625, 0.05474853515625, 0.1638183...	embed
3882949_c0	3882949	haskell	0	Title: Authentication for hackage downloads? Problem title: Authentication for hackage downloads? Tags: haskell, hackage Problem: Authentication for hackage downloads? Is there any way to ensure authenticity of downloads from hackage? As far as I can see, there's nothing. No https for hackage, and neither (strong) chec...	Authentication for hackage downloads? Authentication for hackage downloads? haskell hackage Authentication Authentication for hackage downloads? Is there any way to ensure authenticity of downloads from hackage? As far as I can see, there's nothing. No https for hackage, and neither (strong) checksums for tarballs, and...	[ 0.00787353515625, 0.02685546875, 0.0211181640625, 0.0186767578125, -0.000751495361328125, 0.0162353515625, -0.0169677734375, 0.0022735595703125, -0.006072998046875, 0.0179443359375, 0.00060272216796875, -0.0272216796875, -0.0113525390625, 0.017578125, -0.0322265625, -0.007110595703125,...	[ 52236, 63250, 120639, 100, 85526, 4588, 7026, 7, 32, 1556, 142508, 2071, 2685, 2499, 3917, 47, 63284, 195734, 2481, 111, 1295, 2060, 1957, 33720, 438, 3975, 4, 2725, 9319, 6639, 449, 16, 12765, 10321, 2405, 12126, 181141, 3642, 831, 87, ...	[ 0.1676025390625, 0.2381591796875, 0.1646728515625, 0.1309814453125, 0.257568359375, 0.2381591796875, 0.2415771484375, 0.0841064453125, 0.039642333984375, 0.1654052734375, 0.254638671875, 0.0301513671875, 0.055023193359375, 0.0711669921875, 0.11181640625, 0.06591796875, 0.196411132812...	embed
40316605_c0	40316605	haskell	0	Title: Implementing Alpha-Equivalence in haskell Problem title: Implementing Alpha-Equivalence in haskell Tags: haskell, lambda-calculus Problem: Implementing Alpha-Equivalence in haskell I want to define Alpha-Equivalence using this data definition type Sym = Char data Exp = Var Sym \| App Term Exp \| Lam Sym Exp derivi...	Implementing Alpha-Equivalence in haskell Implementing Alpha-Equivalence in haskell haskell lambda-calculus Implementing Alpha-Equivalence Sym Char Exp App Term Lam Read Show Implementing Alpha-Equivalence in haskell I want to define Alpha-Equivalence using this data definition What is the best way to do this?	[ 0.0032958984375, 0.01263427734375, 0.01513671875, 0.0157470703125, 0.00177764892578125, -0.000949859619140625, 0.01055908203125, -0.00135040283203125, 0.0057373046875, 0.004119873046875, -0.000789642333984375, -0.00982666015625, 0.022216796875, 0.029541015625, -0.0169677734375, -0.0054...	[ 153941, 214, 76569, 9, 647, 3181, 1405, 6620, 23, 1556, 142508, 21, 6492, 85, 6827, 94739, 4843, 39, 21656, 60075, 5659, 2994, 59387, 4764, 17367, 3444, 61924, 17368, 903, 2053, 80934, 2965, 3917 ]	[ 0.2135009765625, 0.0169525146484375, 0.263427734375, 0.0703125, 0.104248046875, 0.135986328125, 0.190185546875, 0.1446533203125, 0.04266357421875, 0.1617431640625, 0.2489013671875, 0.008453369140625, 0.1168212890625, 0.07293701171875, 0.1009521484375, 0.132080078125, 0.01962280273437...	embed
29172356_c0	29172356	haskell	0	Title: Haskell custom data type expression Problem title: Haskell custom data type expression Tags: haskell Problem: Haskell custom data type expression If I have the custom data type as follows: data MyType :: * -> * where Zero:: MyType a One:: a -> MyType a Two:: MyType a -> MyType b -> MyType (a,b) Is it the same as...	Haskell custom data type expression Haskell custom data type expression haskell Haskell MyType Zero One Two Haskell custom data type expression If I have the custom data type as follows: Is it the same as writing them as: Is the above correct? And how do I represent Two?	[ 0.00738525390625, -0.005157470703125, -0.002899169921875, 0.03369140625, 0.0008392333984375, 0.00811767578125, -0.00390625, 0.0074462890625, 0.018798828125, 0.01068115234375, 0.005157470703125, -0.034423828125, 0.01141357421875, -0.016845703125, -0.0167236328125, -0.000827789306640625,...	[ 20625, 142508, 114122, 2053, 10644, 125195, 1556, 2646, 196707, 83947, 6561, 32964, 765, 28960, 2071, 70, 5701, 32562, 2856, 237, 36917, 26785, 3642, 33636 ]	[ 0.1400146484375, 0.2088623046875, 0.24365234375, 0.159912109375, 0.23828125, 0.2249755859375, 0.122802734375, 0.138916015625, 0.259033203125, 0.1669921875, 0.158203125, 0.239013671875, 0.0255584716796875, 0.0760498046875, 0.004497528076171875, 0.0003070831298828125, 0.0758056640625, ...	embed
7152183_c0	7152183	haskell	0	Title: Is (reverse . f . reverse) efficient? Problem title: Is (reverse . f . reverse) efficient? Tags: haskell Problem: Is (reverse . f . reverse) efficient? Many times I see functions which operate on the head of a list, e.g: trimHead ('\n':xs) = xs trimHead xs = xs then I see the the definition: trimTail = reverse ....	Is (reverse . f . reverse) efficient? Is (reverse . f . reverse) efficient? haskell Is (reverse . f . reverse) efficient? Many times I see functions which operate on the head of a list, e.g: then I see the the definition: then I see: They are clean, but are trimTail and trimBoth efficient? Is there a better way?	[ 0.0025177001953125, 0.0057373046875, 0.0198974609375, 0.0084228515625, -0.017822265625, 0.01123046875, 0.00396728515625, 0.014892578125, 0.01025390625, -0.0096435546875, -0.00133514404296875, 0.0224609375, 0.0185546875, -0.0068359375, 0.005828857421875, -0.005126953125, 0.00598144531...	[ 2071, 107, 37676, 1238, 39531, 184, 93766, 1556, 142508, 5, 16, 20028, 1957, 32354, 160404, 98, 10336, 111, 5303, 80934, 10660, 621, 46622, 1284, 85247, 9874, 379, 12647, 927, 11522, 3917 ]	[ 0.09661865234375, 0.128173828125, 0.285400390625, 0.14599609375, 0.2529296875, 0.217529296875, 0.2445068359375, 0.1220703125, 0.2308349609375, 0.01953125, 0.0159454345703125, 0.018707275390625, 0.087890625, 0.1663818359375, 0.122314453125, 0.0477294921875, 0.1136474609375, 0.012786...	embed
9121277_c2	9121277	haskell	2	\s z -> ((\s z -> ((\s z -> ((\s z -> (((\s z -> ((\s z -> (s . s) z) . (\s z -> (s . s . s) z)) s z) s) . ((\s z -> s z) s)) z) . (\s z -> (((\s z -> ((\s z -> ((\s z -> (s . s) z) . (\s z -> (s . s) z)) s z) . (\s z -> (s . s . s) z)) s z) s) . ((\s z -> s z) s)) z)) s z) . (\s z -> (((\s z -> ((\s z -> (s . s) z) (\...	\s z -> ((\s z -> ((\s z -> ((\s z -> (((\s z -> ((\s z -> (s . s) z) . (\s z -> (s . s . s) z)) s z) s) . ((\s z -> s z) s)) z) . (\s z -> (((\s z -> ((\s z -> ((\s z -> (s . s) z) . (\s z -> (s . s) z)) s z) . (\s z -> (s . s . s) z)) s z) s) . ((\s z -> s z) s)) z)) s z) . (\s z -> (((\s z -> ((\s z -> (s . s) z) (\...	[ 0.0155029296875, 0.005950927734375, -0.02490234375, 0.0146484375, 0.009765625, -0.004547119140625, -0.0257568359375, -0.012451171875, 0.01556396484375, -0.0084228515625, -0.0067138671875, 0.00970458984375, 0.01043701171875, 0.004302978515625, 0.000797271728515625, 0.005401611328125, ...	[ 41872, 7, 97, 33079, 60494, 128258, 5, 91, 16, 15, 28864, 26073, 12, 70, 20625, 142508, 52782, 808, 1549, 115861, 2661 ]	[ 0.1053466796875, 0.1239013671875, 0.2410888671875, 0.1580810546875, 0.16064453125, 0.1292724609375, 0.040130615234375, 0.1448974609375, 0.0113525390625, 0.0232696533203125, 0.2255859375, 0.26220703125, 0.04296875, 0.220703125, 0.161865234375, 0.28271484375, 0.1790771484375, 0.05966...	embed
56276815_c0	56276815	haskell	0	Title: Is it possible to use one line contracts in Liquid Haskell? Problem title: Is it possible to use one line contracts in Liquid Haskell? Tags: liquid-haskell, haskell Problem: Is it possible to use one line contracts in Liquid Haskell? Liquid Haskell uses comments like {-@ ... @-} for contracts block. Is it possib...	Is it possible to use one line contracts in Liquid Haskell? Is it possible to use one line contracts in Liquid Haskell? liquid-haskell haskell Liquid Haskell Is it possible to use one line contracts in Liquid Haskell? Liquid Haskell uses comments like {-@ ... @-} for contracts block. Is it possible (with command line o...	[ 0.0166015625, 0.000614166259765625, -0.0198974609375, 0.0002231597900390625, -0.02734375, 0.008056640625, -0.00494384765625, 0.0279541015625, -0.0016326904296875, -0.0057373046875, -0.0225830078125, 0.01904296875, 0.011962890625, -0.00732421875, -0.000553131103515625, 0.0169677734375, ...	[ 2071, 7722, 4527, 1632, 13315, 18264, 7, 23, 170527, 20625, 142508, 41931, 10557, 1556, 442, 24626, 1884, 9, 981, 153, 1374, 46389, 75101, 35829, 153837, 40140, 18929, 20623, 4210, 100 ]	[ 0.00030517578125, 0.14599609375, 0.1068115234375, 0.1456298828125, 0.2003173828125, 0.252685546875, 0.0654296875, 0.04058837890625, 0.2247314453125, 0.126953125, 0.2120361328125, 0.17724609375, 0.09344482421875, 0.10137939453125, 0.01324462890625, 0.1876220703125, 0.035797119140625, ...	embed
36073879_c0	36073879	haskell	0	Title: exporting chose funcitons/datatypes in Haskell Problem title: exporting chose funcitons/datatypes in Haskell Tags: debugging, haskell Problem: exporting chose funcitons/datatypes in Haskell I am newbie when it comes to haskell. Tell me please, where the bug is ? t :: Int -> Args t k = Args { replay = Nothing, ma...	exporting chose funcitons/datatypes in Haskell exporting chose funcitons/datatypes in Haskell debugging haskell Haskell Args Nothing exporting chose funcitons/datatypes in Haskell I am newbie when it comes to haskell. Tell me please, where the bug is ?	[ 0.0159912109375, -0.01324462890625, 0.0026397705078125, 0.024658203125, -0.00007152557373046875, 0.01141357421875, -0.000396728515625, -0.00445556640625, -0.0013885498046875, 0.026123046875, 0.0111083984375, -0.0103759765625, 0.0172119140625, 0.00897216796875, 0.0208740234375, -0.00117...	[ 31255, 214, 19667, 7477, 67772, 10135, 50986, 20625, 142508, 23, 8, 978, 1556, 1172, 9405, 182747, 64, 9014, 59488, 22936, 7440, 54608 ]	[ 0.231201171875, 0.0142822265625, 0.153564453125, 0.1270751953125, 0.138671875, 0.042816162109375, 0.21875, 0.1334228515625, 0.2288818359375, 0.040679931640625, 0.08782958984375, 0.125, 0.1038818359375, 0.12005615234375, 0.060028076171875, 0.09527587890625, 0.0201873779296875, 0.076...	embed
23282772_c0	23282772	haskell	0	Title: Useful ReadLn in Haskell Problem title: Useful ReadLn in Haskell Tags: functional-programming, io, haskell Problem: Useful ReadLn in Haskell Is there in Haskell a built-in function like ReadLn in Pascal? I want smth like this: λ> pascalReadLn :: IO (Int, Int, Int, Int) 1 2 3 4 (1,2,3,4) λ> pascalReadLn :: IO (In...	Useful ReadLn in Haskell Useful ReadLn in Haskell functional-programming io haskell Useful ReadLn Haskell Useful ReadLn in Haskell Is there in Haskell a built-in function like ReadLn in Pascal? I want smth like this:	[ -0.00250244140625, 0.00689697265625, 0.01080322265625, 0.006988525390625, 0.005767822265625, 0.019287109375, 0.003753662109375, -0.0240478515625, -0.0057373046875, -0.0306396484375, 0.0034637451171875, -0.0308837890625, 0.006805419921875, 0.005615234375, 0.011474609375, 0.0044860839843...	[ 36836, 7844, 4764, 866, 19, 23, 20625, 142508, 123309, 28966, 22995, 1556, 2685, 88303, 73, 32354, 1884, 167599, 3444, 14050, 927, 903 ]	[ 0.174560546875, 0.173095703125, 0.220947265625, 0.2125244140625, 0.221923828125, 0.0809326171875, 0.1561279296875, 0.251708984375, 0.1474609375, 0.09295654296875, 0.1475830078125, 0.13427734375, 0.03521728515625, 0.16162109375, 0.11175537109375, 0.2001953125, 0.086181640625, 0.1789...	embed
49869233_c0	49869233	haskell	0	Title: Get foreground window title using Haskell on Linux Problem title: Get foreground window title using Haskell on Linux Tags: linux, foreground, window, haskell Problem: Get foreground window title using Haskell on Linux Under Windows, it is possible to get the foreground window title using: getForegroundWindow Is ...	Get foreground window title using Haskell on Linux Get foreground window title using Haskell on Linux linux foreground window haskell Haskell Get Linux Get foreground window title using Haskell on Linux Under Windows, it is possible to get the foreground window title using: getForegroundWindow Is there an equivalent wa...	[ 0.022705078125, 0.0208740234375, -0.01470947265625, 0.0157470703125, 0.00341796875, -0.005645751953125, 0.0213623046875, -0.021484375, -0.01544189453125, -0.0390625, 0.020751953125, -0.0106201171875, -0.00946044921875, 0.02099609375, -0.01177978515625, 0.01202392578125, -0.0043334960...	[ 20779, 100, 13, 64330, 76896, 44759, 17368, 20625, 142508, 98, 29908, 11508, 1556, 9626, 3773, 83, 7722, 2046, 18537, 92049, 24293, 183234, 3917, 563, 22724 ]	[ 0.0877685546875, 0.082763671875, 0.09173583984375, 0.18798828125, 0.17138671875, 0.1982421875, 0.058837890625, 0.1490478515625, 0.273681640625, 0.06298828125, 0.225830078125, 0.0869140625, 0.1173095703125, 0.0780029296875, 0.140380859375, 0.00433349609375, 0.07666015625, 0.10034179...	embed
23727796_c0	23727796	haskell	0	Title: what's the point of System.IO.Error Problem title: what's the point of System.IO.Error Tags: haskell, exception Problem: what's the point of System.IO.Error I noticed there is a IOException type in Control.Exception as well, what's the point of having a separate System.IO.Error module and IOError type?...	what's the point of System.IO.Error what's the point of System.IO.Error haskell exception System.IO.Error what's the point of System.IO.Error I noticed there is a IOException type in Control.Exception as well, what's the point of having a separate System.IO.Error module and IOError type? Is it there just beca...	[ 0.0150146484375, 0.00927734375, -0.017578125, -0.008056640625, 0.01483154296875, 0.009765625, 0.00811767578125, -0.00457763671875, -0.00262451171875, 0.0164794921875, 0.0213623046875, -0.038330078125, 0.025390625, -0.009765625, -0.00057220458984375, 0.00396728515625, 0.00701904296875...	[ 2367, 3768, 70, 6275, 111, 12353, 5, 17780, 18468, 31611, 1556, 142508, 131527, 7, 156672, 2685, 10, 19279, 63928, 10644, 23, 27131, 5299, 19441, 84797, 88996, 136, 6637, 186768, 151117, 71864, 17368, 12601 ]	[ 0.0804443359375, 0.103515625, 0.1070556640625, 0.1890869140625, 0.1046142578125, 0.1881103515625, 0.0745849609375, 0.275146484375, 0.1695556640625, 0.163818359375, 0.1395263671875, 0.225830078125, 0.1944580078125, 0.060943603515625, 0.04974365234375, 0.0399169921875, 0.02381896972656...	embed
67934377_c0	67934377	haskell	0	Title: Bind operator for non-monadic functions Problem title: Bind operator for non-monadic functions Tags: monads, haskell, bind Problem: Bind operator for non-monadic functions I more or less wrapped my head around monads, but i can't deduct how expression (>>=) id (+) 3 evaluates to 6. It just seems the expression s...	Bind operator for non-monadic functions Bind operator for non-monadic functions monads haskell bind Bind Bind operator for non-monadic functions I more or less wrapped my head around monads, but i can't deduct how expression evaluates to 6. It just seems the expression somehow got simplified to but how? How is 3 applie...	[ -0.006011962890625, -0.011962890625, 0.0235595703125, 0.006866455078125, 0.0220947265625, 0.01129150390625, 0.0037078857421875, -0.01318359375, 0.007415771484375, -0.037353515625, -0.000957489013671875, -0.0233154296875, 0.002685546875, 0.0106201171875, 0.01153564453125, -0.00088500976...	[ 16666, 71, 39933, 351, 87039, 18403, 32354, 2667, 712, 1556, 142508, 68557, 100, 10336, 7, 77193, 125195, 151575, 47, 2289, 37202, 112892, 1029, 138, 190659, 186351, 73342, 28302 ]	[ 0.1898193359375, 0.104248046875, 0.25537109375, 0.1326904296875, 0.10064697265625, 0.06640625, 0.157470703125, 0.121826171875, 0.1556396484375, 0.09619140625, 0.1942138671875, 0.198974609375, 0.02117919921875, 0.03021240234375, 0.052001953125, 0.035003662109375, 0.17431640625, 0.11...	embed
61476770_c3	61476770	haskell	3	-2.7.1.0, xhtml-3000.2.1, nightly-2015-08-26, stm-2.4.4, acme-missiles-0.3, helloworld-0.1.0.0, Lib.hs, Lib, package.yaml, stack.yaml, LTS, Stack, GHC, Cabal, Configuring, Preprocessing, Building, Compiling, Acme.Missiles.STM, Installing, c1955c78, x86_64-windows-ghc-8.8.3, acme-missiles-0.3-5Q3zlWTjrQa, Fyz88eRyQT2, R...	-2.7.1.0, xhtml-3000.2.1, nightly-2015-08-26, stm-2.4.4, acme-missiles-0.3, helloworld-0.1.0.0, Lib.hs, Lib, package.yaml, stack.yaml, LTS, Stack, GHC, Cabal, Configuring, Preprocessing, Building, Compiling, Acme.Missiles.STM, Installing, c1955c78, x86_64-windows-ghc-8.8.3, acme-missiles-0.3-5Q3zlWTjrQa, Fyz88eRyQT2, R...	[ 0.01446533203125, -0.01312255859375, -0.001617431640625, 0.0262451171875, -0.0098876953125, 0.0272216796875, -0.0030975341796875, -0.0037384033203125, 0.0016021728515625, 0.0286865234375, -0.00762939453125, -0.0101318359375, 0.00244140625, -0.003387451171875, -0.01202392578125, 0.00430...	[ 122297, 53489, 102107, 4, 1022, 7693, 9, 36605, 5, 68107, 17431, 538, 44906, 47355, 4046, 6138, 39, 5428, 180874, 1030, 282, 86811, 1577, 170179, 33600, 31, 32554, 102014, 99929, 43278, 127, 98169, 14520, 141, 177261, 12763, 6512, 2594, 527...	[ 0.1444091796875, 0.141357421875, 0.168701171875, 0.07525634765625, 0.076904296875, 0.259521484375, 0.0797119140625, 0.167724609375, 0.074951171875, 0.144287109375, 0.162841796875, 0.1614990234375, 0.1767578125, 0.03936767578125, 0.0927734375, 0.0909423828125, 0.151611328125, 0.0786...	embed
11443324_c0	11443324	haskell	0	Title: Haskell type class for Queue Problem title: Haskell type class for Queue Tags: haskell, typeclass Problem: Haskell type class for Queue Has anyone written a Haskell type class (or is there a combination of type classes) that describes a FIFO queue. Data.Collection.Sequence seems too strong, but on the other hand...	Haskell type class for Queue Haskell type class for Queue haskell typeclass Haskell Queue Haskell type class for Queue Has anyone written a Haskell type class (or is there a combination of type classes) that describes a FIFO queue. Data.Collection.Sequence seems too strong, but on the other hand Data.Collection.Unfolda...	[ 0.024658203125, 0.0267333984375, -0.01171875, 0.007476806640625, -0.001007080078125, -0.02978515625, -0.004791259765625, -0.0169677734375, -0.014404296875, -0.0038299560546875, -0.019287109375, -0.0242919921875, 0.004150390625, 0.0037384033203125, -0.0218505859375, 0.0191650390625, -...	[ 20625, 142508, 10644, 18507, 100, 5813, 13388, 1556, 67413, 35672, 59121, 83, 162515, 61112, 98363, 7, 32983, 51980, 41, 11809, 133, 944, 37202, 5792, 37515, 78457, 10763, 14256, 42822, 2886, 642, 344, 12989, 959, 61924, 41313, 4488 ]	[ 0.1444091796875, 0.2283935546875, 0.1942138671875, 0.22509765625, 0.0673828125, 0.1796875, 0.1890869140625, 0.1324462890625, 0.12890625, 0.0526123046875, 0.08294677734375, 0.005462646484375, 0.0482177734375, 0.1805419921875, 0.0909423828125, 0.0269317626953125, 0.1640625, 0.2255859...	embed
37919343_c0	37919343	haskell	0	Title: Reduce lambda-expressions in WHNF Problem title: Reduce lambda-expressions in WHNF Tags: lazy-evaluation, lambda-calculus, haskell, weak-head-normal-form Problem: Reduce lambda-expressions in WHNF I have to reduce the following lambda-expression into WHNF, but I am not quite sure how to do it: (λx y. x 3) (+ 4) ...	Reduce lambda-expressions in WHNF Reduce lambda-expressions in WHNF lazy-evaluation lambda-calculus haskell weak-head-normal-form Reduce WHNF Reduce lambda-expressions in WHNF I have to reduce the following lambda-expression into WHNF, but I am not quite sure how to do it: So, how do I do it? Call-By-Name Reduction? Is...	[ -0.0028533935546875, 0.01171875, 0.01019287109375, 0.0186767578125, 0.003082275390625, 0.005340576171875, 0.0034027099609375, -0.007293701171875, 0.0255126953125, -0.00823974609375, -0.00958251953125, -0.0220947265625, -0.005859375, 0.00165557861328125, 0.002105712890625, -0.0062561035...	[ 853, 106357, 21, 6492, 85, 204629, 601, 841, 73493, 3285, 159258, 6827, 94739, 1556, 142508, 642, 344, 31251, 33176, 5037, 34390, 25632, 3934, 3642, 54, 26265, 75358, 163612, 77391, 125195, 27781, 169, 1022, 5970, 425, 97, 23, 14373 ]	[ 0.1370849609375, 0.1541748046875, 0.05615234375, 0.1966552734375, 0.155517578125, 0.2061767578125, 0.07904052734375, 0.129638671875, 0.256103515625, 0.1456298828125, 0.1390380859375, 0.0645751953125, 0.1026611328125, 0.06121826171875, 0.1961669921875, 0.04229736328125, 0.069152832031...	embed
4084790_c0	4084790	haskell	0	Title: Compilers for Haskell Problem title: Compilers for Haskell Tags: haskell, ghc Problem: Compilers for Haskell AFAIK GHC is the most common compiler today, but I also see, that some other compilers are available too. Is GHC really the best choice for all purposes or may I use something else instead? For instance, ...	Compilers for Haskell Compilers for Haskell haskell ghc Compilers Haskell Compilers for Haskell AFAIK GHC is the most common compiler today, but I also see, that some other compilers are available too. Is GHC really the best choice for all purposes or may I use something else instead? For instance, I read that some com...	[ 0.01043701171875, 0.006561279296875, 0.0250244140625, -0.01190185546875, -0.0113525390625, 0.0162353515625, -0.032470703125, -0.0167236328125, -0.01104736328125, -0.00738525390625, -0.0166015625, -0.024658203125, 0.01153564453125, 0.0196533203125, -0.004425048828125, -0.001121520996093...	[ 15612, 34759, 100, 20625, 142508, 1556, 31380, 238, 151334, 17756, 527, 73265, 83, 70, 2684, 39210, 9969, 18925, 3789, 621, 19882, 2071, 6183, 2965, 44126, 756, 60042, 1543, 4527, 9844, 37076, 64457, 12301, 3060, 9904, 9351, 14602, 11522, 9...	[ 0.187744140625, 0.218994140625, 0.101318359375, 0.1710205078125, 0.267333984375, 0.137939453125, 0.1268310546875, 0.120849609375, 0.062347412109375, 0.053131103515625, 0.1402587890625, 0.2286376953125, 0.053497314453125, 0.06719970703125, 0.13916015625, 0.1710205078125, 0.18579101562...	embed
53351894_c0	53351894	haskell	0	Title: Finding a "free theorem" Problem title: Finding a "free theorem" Tags: haskell, free-theorem Problem: Finding a "free theorem" How do I derive the free theorem for the type: data F a = C1 Nat \| C2 Bool Nat a where Nat is simply data Nat = Z \| S Nat ? In principle, this can be answered by the ...	Finding a "free theorem" Finding a "free theorem" haskell free-theorem Finding Nat Bool Finding a "free theorem" How do I derive the free theorem for the type: where Nat is simply data Nat = Z \| S Nat ? In principle, this can be answered by the Haskell 'free-theorems' package, but it's too elderly t...	[ 0.0303955078125, 0.00185394287109375, 0.0079345703125, 0.00823974609375, 0.009033203125, -0.011962890625, -0.01275634765625, 0.003875732421875, 0.009765625, -0.0216064453125, 0.0057373046875, -0.01806640625, -0.007080078125, 0.0181884765625, -0.0047607421875, 0.0133056640625, 0.00854...	[ 26040, 32087, 70, 58391, 1556, 142508, 4092, 2347, 68875, 2460, 929, 122, 5844, 10644, 7440, 83, 42856, 2053, 2203, 567, 58745, 159, 24702, 194663, 20625, 25, 98169, 5792, 820, 9969, 1340, 1379, 527, 73265, 11389, 31635, 20600 ]	[ 0.109130859375, 0.1728515625, 0.0792236328125, 0.21044921875, 0.08489990234375, 0.2308349609375, 0.18701171875, 0.057373046875, 0.23681640625, 0.0906982421875, 0.170654296875, 0.1051025390625, 0.095458984375, 0.1396484375, 0.056732177734375, 0.0203704833984375, 0.1151123046875, 0.1...	embed
1913954_c0	1913954	haskell	0	Title: How to make an unboxed array of floats I can get a Ptr to Problem title: How to make an unboxed array of floats I can get a Ptr to Tags: arrays, c, haskell, opengl, unboxing Problem: How to make an unboxed array of floats I can get a Ptr to I am trying to do some work with HopenGL and I need a Ptr that points to...	How to make an unboxed array of floats I can get a Ptr to How to make an unboxed array of floats I can get a Ptr to arrays c haskell opengl unboxing How Ptr How to make an unboxed array of floats I can get a Ptr to I am trying to do some work with HopenGL and I need a Ptr that points to a array of floats. From what I h...	[ 0.01904296875, 0.028076171875, -0.0093994140625, -0.0223388671875, 0.0048828125, -0.004150390625, 0.0135498046875, -0.0264892578125, -0.00058746337890625, 0.004302978515625, -0.013427734375, -0.031494140625, 0.0184326171875, -0.00421142578125, 0.002899169921875, -0.00933837890625, -0...	[ 11249, 3249, 51, 11728, 297, 10298, 53, 111, 21917, 9821, 87, 831, 2046, 10, 436, 4448, 47, 4778, 501, 1556, 142508, 9803, 11016, 4488, 75359, 78703, 3871, 26847, 2240, 7092, 136, 3082, 2886, 7614, 48903, 3917, 162515 ]	[ 0.0706787109375, 0.097412109375, 0.0869140625, 0.197998046875, 0.045654296875, 0.170166015625, 0.136962890625, 0.052520751953125, 0.2027587890625, 0.123046875, 0.001373291015625, 0.037841796875, 0.07861328125, 0.034912109375, 0.04840087890625, 0.19921875, 0.162841796875, 0.09692382...	embed
76049049_c1	76049049	haskell	1	C .\| Data.Conduit.Text.lines .\| mapC (\a -> a =~ ("[fd]oo" :: Text) :: Text) .\| log1 .\| unlinesC .\| encodeUtf8C .\| stdoutC But why does order of await matters? log1 :: ConduitT Text Text (ResourceT IO) () log1 = do Just l <- await -- <- has to be first liftIO $ print l yield l Code signals: Conduit, Data.Text, Text.Reg...	C .\| Data.Conduit.Text.lines .\| mapC (\a -> a =~ ("[fd]oo" :: Text) :: Text) .\| log1 .\| unlinesC .\| encodeUtf8C .\| stdoutC But why does order of await matters? log1 :: ConduitT Text Text (ResourceT IO) () log1 = do Just l <- await -- <- has to be first liftIO $ print l yield l Code signals: Conduit, Data.Text, Text.Reg...	[ -0.0003108978271484375, -0.01141357421875, 0.000843048095703125, 0.0213623046875, 0.01019287109375, 0.001220703125, 0.0419921875, 0.01708984375, -0.01495361328125, -0.0286865234375, -0.00156402587890625, 0.00099945068359375, 0.00933837890625, -0.0014801025390625, 0.0208740234375, -0.02...	[ 313, 11809, 11935, 112061, 174379, 59801, 22288, 441, 11, 33079, 10, 16635, 24129, 1984, 12684, 418, 51, 40899, 6138, 1003, 15400, 14602, 12989, 111, 634, 217, 26866, 7, 1657, 618, 4332, 60427, 17780, 54, 9563, 96, 1556, 5117, 60520, 3650...	[ 0.0875244140625, 0.1131591796875, 0.040740966796875, 0.211669921875, 0.2000732421875, 0.1473388671875, 0.136474609375, 0.05426025390625, 0.0404052734375, 0.0208740234375, 0.058319091796875, 0.14208984375, 0.194091796875, 0.00909423828125, 0.207275390625, 0.1318359375, 0.037841796875,...	embed
41574250_c0	41574250	haskell	0	Title: How do I properly do Haskell pattern matching on a list? Problem title: How do I properly do Haskell pattern matching on a list? Tags: haskell, pattern-matching Problem: How do I properly do Haskell pattern matching on a list? Code signals: xs, How, Haskell, ch03, Intersperse.hs, Intersperse, Compiling, Main, x:...	How do I properly do Haskell pattern matching on a list? How do I properly do Haskell pattern matching on a list? haskell pattern-matching xs How Haskell ch03 Intersperse.hs Intersperse Compiling Main x:xs intersperse.hs:4:24 Couldn intersperse.hs:1:16 Relevant intersperse.hs:4:18 intersperse.hs:4:16 intersperse.hs:4:1...	[ -0.0228271484375, 0.0164794921875, 0.0191650390625, -0.006927490234375, -0.0133056640625, 0.0247802734375, -0.0096435546875, -0.0020904541015625, 0.0130615234375, -0.00811767578125, 0.0062255859375, -0.0093994140625, 0.0162353515625, -0.00074005126953125, -0.0008087158203125, -0.007598...	[ 11249, 155965, 54, 20625, 142508, 103510, 14858, 214, 98, 5303, 1556, 98753, 1022, 3863, 9513, 5337, 20595, 184, 127, 15612, 49725, 12321, 425, 1940, 617, 25732, 191147, 19, 22354, 133, 30624, 24033, 22618, 19721, 81979, 103136, 20697, 966, ...	[ 0.06170654296875, 0.156494140625, 0.0703125, 0.1441650390625, 0.20361328125, 0.253173828125, 0.22607421875, 0.1201171875, 0.0513916015625, 0.205322265625, 0.1324462890625, 0.2333984375, 0.0672607421875, 0.035400390625, 0.1512451171875, 0.08740234375, 0.1773681640625, 0.081787109375...	embed
16309432_c0	16309432	haskell	0	Title: Error with main function Problem title: Error with main function Tags: haskell Problem: Error with main function I'm new to Haskell and still trying to workout some of syntax/idioms. Can anyone explain what I'm doing wrong in this code? main should print out a list of 5 random numbers. This works find in GHCi, b...	Error with main function Error with main function haskell System.Random Error Error with main function I'm new to Haskell and still trying to workout some of syntax/idioms. Can anyone explain what I'm doing wrong in this code? main should print out a list of 5 random numbers. This works find in GHCi, but not in a file....	[ -0.00150299072265625, 0.01348876953125, 0.0020294189453125, -0.01708984375, -0.00015163421630859375, 0.0125732421875, -0.00004744529724121094, 0.0017242431640625, -0.02880859375, -0.06201171875, 0.0015869140625, -0.0172119140625, 0.0101318359375, -0.0020294189453125, 0.0225830078125, -...	[ 212059, 678, 5201, 32354, 1556, 142508, 12353, 126525, 3815, 3525, 20625, 31577, 184732, 6002, 86531, 57840, 4432, 4171, 73342, 20594, 44691, 18151, 5608, 28412, 1810, 5303, 190, 96759, 101935, 43240, 7413, 527, 73265, 14, 1284, 959, 23, 1143...	[ 0.208740234375, 0.165771484375, 0.1826171875, 0.2117919921875, 0.1444091796875, 0.248291015625, 0.1199951171875, 0.1072998046875, 0.168701171875, 0.068115234375, 0.117431640625, 0.0098876953125, 0.086181640625, 0.0287322998046875, 0.1143798828125, 0.06903076171875, 0.0009765625, 0....	embed
18441565_c0	18441565	haskell	0	Title: Where has hSetEncoding gone? Problem title: Where has hSetEncoding gone? Tags: io, haskell, character-encoding Problem: Where has hSetEncoding gone? I was fairly sure that a while back GHC added the ability to explicitly set the character encoding on a Handle . However, when I look in System.IO , I don't see any...	Where has hSetEncoding gone? Where has hSetEncoding gone? io haskell character-encoding Where Handle System.IO Where has hSetEncoding gone? I was fairly sure that a while back GHC added the ability to explicitly set the character encoding on a Handle . However, when I look in System.IO , I don't see anything relating t...	[ 0.0038909912109375, 0.009521484375, 0.012451171875, -0.00543212890625, -0.00860595703125, 0.00112152099609375, -0.018310546875, 0.004486083984375, -0.0034027099609375, 0.01904296875, 0.000972747802734375, -0.034423828125, 0.009521484375, -0.00909423828125, -0.005096435546875, 0.0040283...	[ 78662, 1556, 1096, 294, 126, 7768, 587, 6238, 74955, 22995, 142508, 62816, 66332, 10639, 133, 12353, 5, 17780, 9077, 527, 73265, 49814, 81273, 143726, 5423, 22, 98, 6713, 2301, 18, 1957, 23937, 33444, 20625, 70968, 1324, 29485, 99929, 44948...	[ 0.1226806640625, 0.163818359375, 0.159423828125, 0.146728515625, 0.196533203125, 0.1400146484375, 0.2200927734375, 0.1776123046875, 0.11767578125, 0.18359375, 0.2283935546875, 0.1767578125, 0.193603515625, 0.17578125, 0.173583984375, 0.1488037109375, 0.010772705078125, 0.1931152343...	embed
23018679_c0	23018679	haskell	0	Title: Cancel main without closing ghci Problem title: Cancel main without closing ghci Tags: haskell Problem: Cancel main without closing ghci I'm working on a web server using Scotty . I can run ghci and keep using :r to get it to reload my code, but if I even run main I cant' restart the web server without killing g...	Cancel main without closing ghci Cancel main without closing ghci haskell Cancel Cancel main without closing ghci I'm working on a web server using Scotty . I can run ghci and keep using :r to get it to reload my code, but if I even run main I cant' restart the web server without killing ghci. How can I cancel main wit...	[ 0.01220703125, 0.0179443359375, 0.006439208984375, 0.00445556640625, -0.037353515625, -0.000629425048828125, -0.0062255859375, -0.004913330078125, -0.013916015625, -0.038330078125, -0.0208740234375, -0.030517578125, 0.0031890869140625, 0.01220703125, 0.0189208984375, -0.00732421875, ...	[ 80392, 5201, 15490, 20450, 31380, 318, 6953, 1556, 142508, 20697, 1467, 10723, 17368, 50695, 53, 831, 11675, 13695, 152, 42, 456, 63033, 18151, 45767, 17137, 200, 30319, 11249, 53017, 11522, 34831, 191082 ]	[ 0.239013671875, 0.172119140625, 0.115234375, 0.141845703125, 0.1397705078125, 0.206787109375, 0.05352783203125, 0.11962890625, 0.2138671875, 0.0626220703125, 0.056915283203125, 0.115966796875, 0.0261993408203125, 0.1357421875, 0.145263671875, 0.043060302734375, 0.09735107421875, 0....	embed
412919_c0	412919	haskell	0	Title: How does Haskell tail recursion work? Problem title: How does Haskell tail recursion work? Tags: tail-recursion, haskell Problem: How does Haskell tail recursion work? I wrote this snippet of code and I assume len is tail-recursive, but a stack overflow still occurs. What is wrong? myLength :: [a] -> Integer myL...	How does Haskell tail recursion work? How does Haskell tail recursion work? tail-recursion haskell How Haskell Integer x:xs How does Haskell tail recursion work? I wrote this snippet of code and I assume len is tail-recursive, but a stack overflow still occurs. What is wrong?	[ 0.002685546875, 0.0262451171875, 0.0137939453125, 0.0201416015625, 0.004974365234375, -0.007476806640625, -0.00142669677734375, -0.02197265625, 0.0238037109375, -0.033935546875, 0.01153564453125, -0.00982666015625, 0.023193359375, 0.0128173828125, 0.0306396484375, 0.000926971435546875,...	[ 11249, 14602, 20625, 142508, 46741, 195625, 1830, 4488, 107, 48650, 1556, 44401, 1022, 12, 425, 7, 58134, 18151, 41591, 3098, 83, 5844, 177261, 645, 118664, 7464, 74918, 44691 ]	[ 0.0948486328125, 0.087158203125, 0.1544189453125, 0.228759765625, 0.25830078125, 0.205322265625, 0.1259765625, 0.15966796875, 0.06689453125, 0.15625, 0.146728515625, 0.1785888671875, 0.084716796875, 0.07391357421875, 0.099609375, 0.002197265625, 0.010833740234375, 0.034393310546875...	embed
41347412_c0	41347412	haskell	0	Title: Replace keys in Data.Map Problem title: Replace keys in Data.Map Tags: dictionary, key, haskell Problem: Replace keys in Data.Map If I have two keys k0 and k1, which are in the Data.Map M, how can I remove k0 from the map and replace k1 with k0? What would be the best approach to complete this task? I have tried...	Replace keys in Data.Map Replace keys in Data.Map dictionary key haskell Replace Data.Map Replace keys in Data.Map If I have two keys k0 and k1, which are in the Data.Map M, how can I remove k0 from the map and replace k1 with k0? What would be the best approach to complete this task? I have tried to go through the doc...	[ 0.0000782012939453125, 0.0184326171875, -0.003204345703125, 0.0002117156982421875, -0.004180908203125, -0.027587890625, -0.00537109375, -0.0079345703125, 0.00469970703125, 0.0220947265625, 0.0208740234375, 0.02197265625, 0.00186920166015625, 0.024658203125, 0.0135498046875, 0.010498046...	[ 853, 23935, 22799, 7, 23, 11809, 5, 166179, 45, 10763, 1556, 142508, 765, 6626, 472, 2389, 136, 418, 276, 3642, 831, 87388, 1295, 22288, 91995, 678, 2965, 51515, 28484, 66211, 209806, 32354, 15549, 142424 ]	[ 0.107421875, 0.2025146484375, 0.2337646484375, 0.1300048828125, 0.0401611328125, 0.17138671875, 0.053955078125, 0.2193603515625, 0.045654296875, 0.081787109375, 0.138671875, 0.2293701171875, 0.02740478515625, 0.1241455078125, 0.1414794921875, 0.2110595703125, 0.0748291015625, 0.160...	embed
2098314_c0	2098314	haskell	0	Title: Haskell's Text.Regex.subRegex using TDFA implementation? Problem title: Haskell's Text.Regex.subRegex using TDFA implementation? Tags: regex, haskell Problem: Haskell's Text.Regex.subRegex using TDFA implementation? Is there a way to use the TDFA implementation of Regex with the functions in Text.Regex...	Haskell's Text.Regex.subRegex using TDFA implementation? Haskell's Text.Regex.subRegex using TDFA implementation? regex haskell TDFA Haskell Text.Regex.subRegex Haskell's Text.Regex.subRegex using TDFA implementation? Is there a way to use the TDFA implementation of Regex with the functions in Text.Regex such...	[ -0.0101318359375, 0, 0.027099609375, 0.0303955078125, 0.013916015625, -0.006011962890625, -0.0216064453125, 0.0078125, -0.00445556640625, -0.0145263671875, 0.0128173828125, 0.0198974609375, 0.01953125, -0.022216796875, 0.0101318359375, -0.0001583099365234375, 0.02880859375, 0.01599...	[ 20625, 142508, 3768, 24129, 54601, 3355, 22144, 17368, 117295, 14676, 208124, 6835, 1556, 5, 3917, 4527, 11678, 678, 32354, 1614, 209806, 8110, 54602, 21487, 4734 ]	[ 0.109619140625, 0.224609375, 0.047454833984375, 0.1964111328125, 0.1728515625, 0.2235107421875, 0.1595458984375, 0.07025146484375, 0.1396484375, 0.241455078125, 0.1715087890625, 0.1275634765625, 0.10595703125, 0.002899169921875, 0.048187255859375, 0.103271484375, 0.148193359375, 0....	embed
63248640_c0	63248640	haskell	0	Title: Why Nothing == (pure Nothing) returns False in Haskell? Problem title: Why Nothing == (pure Nothing) returns False in Haskell? Tags: haskell Problem: Why Nothing == (pure Nothing) returns False in Haskell? Seems I understood something wrong, but I tried the following: GHCi, version 8.6.5 Nothing == Nothing => Tr...	Why Nothing == (pure Nothing) returns False in Haskell? Why Nothing == (pure Nothing) returns False in Haskell? haskell Why Nothing Haskell GHCi Why Nothing == (pure Nothing) returns False in Haskell? Seems I understood something wrong, but I tried the following: Could you please explain what happens here?	[ -0.00848388671875, 0.01190185546875, 0.01373291015625, -0.00830078125, 0.01104736328125, 0.008056640625, 0.000885009765625, -0.0225830078125, 0.00164794921875, 0.00445556640625, 0.000843048095703125, -0.010498046875, -0.01336669921875, 0.01422119140625, -0.0029754638671875, -0.00927734...	[ 44084, 182747, 69112, 4717, 13, 30646, 22225, 184, 23, 20625, 142508, 1556, 527, 73265, 14, 44691, 37842, 73342 ]	[ 0.0989990234375, 0.1922607421875, 0.2705078125, 0.1134033203125, 0.04180908203125, 0.16455078125, 0.128662109375, 0.1448974609375, 0.0413818359375, 0.139404296875, 0.2410888671875, 0.1007080078125, 0.02215576171875, 0.022979736328125, 0.08935546875, 0.03399658203125, 0.00735473632812...	embed
51167568_c0	51167568	haskell	0	Title: Problems implementing "toEnum" in Haskell Problem title: Problems implementing "toEnum" in Haskell Tags: haskell, dictionary Problem: Problems implementing "toEnum" in Haskell haven't got implementation problems with fromEnum, keep running into them using toEnum. Tried different type sigs, bu...	Problems implementing "toEnum" in Haskell Problems implementing "toEnum" in Haskell haskell dictionary Problems Haskell Problems implementing "toEnum" in Haskell haven't got implementation problems with fromEnum, keep running into them using toEnum. Tried different type sigs, but keep getting it all...	[ 0.00982666015625, -0.00335693359375, 0.007080078125, 0.004913330078125, -0.027587890625, 0.0115966796875, -0.007598876953125, 0.01141357421875, -0.0142822265625, -0.000766754150390625, -0.0093994140625, -0.0284423828125, 0.01361083984375, 0.0250244140625, -0.016357421875, -0.0027465820...	[ 15649, 29479, 188, 647, 2606, 20625, 142508, 41502, 23, 1556, 45, 10763, 38246, 18, 208124, 44402, 1295, 13695, 51042, 3934, 17368, 47, 4699, 12921, 10644, 1144, 756, 44691, 4358 ]	[ 0.2015380859375, 0.1829833984375, 0.227783203125, 0.156982421875, 0.30224609375, 0.1661376953125, 0.240966796875, 0.013031005859375, 0.03057861328125, 0.142822265625, 0.044097900390625, 0.10089111328125, 0.001800537109375, 0.00128173828125, 0.168701171875, 0.13916015625, 0.1428222656...	embed
20367665_c0	20367665	haskell	0	Title: Is it possible to nest `at` with setters? Problem title: Is it possible to nest `at` with setters? Tags: haskell, haskell-lens Problem: Is it possible to nest `at` with setters? I'd like to set a value in 2 level map - i.e. to a key in a map which is a value for some key in an "outer" map. For ordinary Map I cou...	Is it possible to nest `at` with setters? Is it possible to nest `at` with setters? haskell haskell-lens Is it possible to nest `at` with setters? I'd like to set a value in 2 level map - i.e. to a key in a map which is a value for some key in an "outer" map. For ordinary Map I could use something like m & at 42 ?= "va...	[ -0.021484375, 0.0009307861328125, -0.004730224609375, -0.033935546875, 0.004791259765625, 0.00958251953125, -0.00799560546875, -0.007720947265625, 0.0030517578125, -0.0380859375, 0.0023040771484375, 0.054443359375, 0.0213623046875, 0.012451171875, 0.0189208984375, -0.0018157958984375, ...	[ 2071, 442, 7722, 47, 91280, 257, 678, 88685, 7, 1556, 142508, 1977, 1884, 5423, 34292, 116, 17366, 22288, 22799, 6056, 56, 23335, 42719, 5809, 4527, 347, 619, 99, 4828, 27494, 959, 3917, 242, 1544, 6044, 8512, 71, 3098 ]	[ 0.05303955078125, 0.0806884765625, 0.189453125, 0.072509765625, 0.227783203125, 0.2171630859375, 0.1669921875, 0.244873046875, 0.14404296875, 0.10009765625, 0.221923828125, 0.1650390625, 0.07391357421875, 0.163818359375, 0.169921875, 0.136962890625, 0.1810302734375, 0.1243896484375...	embed
21868427_c1	21868427	haskell	1	isors(n): divs = set() for i in range(1, int(sqrt(n)) + 1): if n % i == 0: divs.add(i) divs.add(n // i) return divs def sigma2(n): return sum(map(lambda x: x**2, get_divisors(n))) def big_sigma2(n): total = 0 for i in range(1, n + 1): total += sigma2(i) return total if __name__ == "__main__": find_answer() Code signals...	isors(n): divs = set() for i in range(1, int(sqrt(n)) + 1): if n % i == 0: divs.add(i) divs.add(n // i) return divs def sigma2(n): return sum(map(lambda x: x**2, get_divisors(n))) def big_sigma2(n): total = 0 for i in range(1, n + 1): total += sigma2(i) return total if __name__ == "__main__": find_answer() Code signals...	[ -0.0189208984375, 0.00347900390625, 0.006439208984375, -0.006256103515625, -0.00970458984375, -0.005096435546875, -0.01043701171875, 0.0146484375, -0.002410888671875, -0.021484375, 0.002410888671875, -0.000385284423828125, 0.0023345947265625, -0.00107574462890625, -0.019287109375, -0.0...	[ 83, 25251, 19, 2077, 18221, 7, 2203, 5423, 132, 100, 17, 37457, 41600, 23, 18, 864, 3198, 997, 4879, 2174, 653, 1745, 69112, 757, 4028, 14, 30646, 8, 420, 1144, 192, 304, 10554, 62346, 6492, 85, 1022, 2046, 428, 51858, 6957, 20561, ...	[ 0.17822265625, 0.296630859375, 0.1558837890625, 0.057098388671875, 0.2408447265625, 0.1240234375, 0.045196533203125, 0.1500244140625, 0.0255126953125, 0.00299072265625, 0.0911865234375, 0.1820068359375, 0.0192413330078125, 0.046234130859375, 0.08343505859375, 0.07830810546875, 0.1385...	embed
73878832_c1	73878832	haskell	1	The type of hidden f should be inferred -- It does not infer a most general type of f and produces exception Exception: Couldn't match expected type ‘(a0 -> b0 -> a0) -> t2 -> t3 -> t7 -> t3’ with actual type ‘p’ because type variables ‘t2’, ‘t3’, ‘t7’ would escape their scope In this case, type of f should be f1->f2-...	The type of hidden f should be inferred -- It does not infer a most general type of f and produces exception Exception: Couldn't match expected type ‘(a0 -> b0 -> a0) -> t2 -> t3 -> t7 -> t3’ with actual type ‘p’ because type variables ‘t2’, ‘t3’, ‘t7’ would escape their scope In this case, type of f should be f1->f2-...	[ 0.007110595703125, 0.01153564453125, -0.01251220703125, 0.005645751953125, 0.0137939453125, -0.01300048828125, 0.01043701171875, -0.001434326171875, -0.006866455078125, -0.01470947265625, -0.00970458984375, -0.01275634765625, 0.00482177734375, 0.00051116943359375, 0.0003185272216796875, ...	[ 10644, 111, 204105, 1238, 5608, 53498, 2822, 1650, 14602, 959, 2684, 4537, 27489, 131527, 63928, 191147, 18, 14858, 84751, 11, 2389, 33079, 876, 77495, 808, 304, 363, 966, 678, 8561, 254, 77336, 2806, 144281, 70820, 903, 7225, 186, 418, 1...	[ 0.2353515625, 0.121826171875, 0.25634765625, 0.205810546875, 0.1182861328125, 0.2041015625, 0.09637451171875, 0.0107421875, 0.04034423828125, 0.109375, 0.061614990234375, 0.111328125, 0.121826171875, 0.1964111328125, 0.1278076171875, 0.055694580078125, 0.043243408203125, 0.17004394...	embed

16242041_c0

16242041

haskell

0

Title: Need help understanding (\x -> ) in Haskell Problem title: Need help understanding (\x -> ) in Haskell Tags: haskell Problem: Need help understanding (\x -> ) in Haskell On ZVON, one of the definitions provided for the takeWhile function is Input: takeWhile (\x -> 6*x < 100) [1..20] Output: [1,2,3,4,5,6,7,...

Need help understanding (\x -> ) in Haskell Need help understanding (\x -> ) in Haskell haskell Need Haskell Input Output Need help understanding (\x -> ) in Haskell On ZVON, one of the definitions provided for the takeWhile function is Can someone explain what the portion (\x -> 6*x < 100) means?

[ 0.0240478515625, 0.023681640625, 0.00665283203125, 0.005584716796875, 0.0081787109375, 0.031982421875, 0.0091552734375, -0.006103515625, 0.0177001953125, -0.01531982421875, 0.0185546875, -0.00555419921875, -0.0098876953125, -0.007171630859375, 0.00121307373046875, 0.00124359130859375, ...

[ 52889, 4358, 100094, 41872, 425, 20, 1230, 5386, 23, 20625, 142508, 1556, 360, 13538, 33079, 182773, 15513, 70, 80934, 5646, 1456, 979, 133, 32354, 73342, 2367, 126826, 305, 1639, 4426, 805, 26950 ]

[ 0.077392578125, 0.0823974609375, 0.123779296875, 0.06756591796875, 0.132568359375, 0.107177734375, 0.0911865234375, 0.1611328125, 0.03436279296875, 0.1309814453125, 0.2105712890625, 0.1048583984375, 0.05078125, 0.08990478515625, 0.232666015625, 0.1168212890625, 0.1376953125, 0.0030...

embed

37474405_c0

37474405

haskell

0

Title: Understanding Type of IO () in `let` Expression Problem title: Understanding Type of IO () in `let` Expression Tags: haskell Problem: Understanding Type of IO () in `let` Expression Given: λ: let f = putStrLn "foo" in 42 42 What is f 's type? Why does "foo" not get printed before showing the result of 42 ? Lastl...

Understanding Type of IO () in `let` Expression Understanding Type of IO () in `let` Expression haskell Understanding Type Expression Not Understanding Type of IO () in `let` Expression Given: What is f 's type? Why does "foo" not get printed before showing the result of 42 ? Lastly, why doesn't the following work?

[ -0.001708984375, -0.00970458984375, -0.0037994384765625, 0.0235595703125, 0.00616455078125, -0.005462646484375, -0.00946044921875, 0.01507568359375, -0.0068359375, 0.01043701171875, -0.0098876953125, -0.032470703125, 0.000762939453125, 0.0118408203125, 0.0157470703125, -0.0128784179687...

[ 9626, 144057, 60457, 111, 17780, 23, 1974, 25129, 1830, 1556, 142508, 11205, 4865, 83, 1238, 242, 7, 10644, 44084, 14602, 3584, 31, 959, 2046, 28412, 297, 8108, 141377, 16750, 4828, 15400, 22027, 18, 70, 25632, 4488 ]

[ 0.1025390625, 0.085693359375, 0.2047119140625, 0.0291290283203125, 0.19287109375, 0.0262908935546875, 0.1822509765625, 0.1605224609375, 0.0106201171875, 0.117919921875, 0.2054443359375, 0.049957275390625, 0.039154052734375, 0.050018310546875, 0.1739501953125, 0.002349853515625, 0.024...

embed

48163259_c0

48163259

haskell

0

Title: Does GHC compare pointers before invoking Eq? Problem title: Does GHC compare pointers before invoking Eq? Tags: haskell, comparison Problem: Does GHC compare pointers before invoking Eq? This entry on the mailing list from 2014 seems to indicate that the answer is no. If it's still no, how can I quickly compare...

Does GHC compare pointers before invoking Eq? Does GHC compare pointers before invoking Eq? haskell comparison Does GHC Does GHC compare pointers before invoking Eq? This entry on the mailing list from 2014 seems to indicate that the answer is no. If it's still no, how can I quickly compare two giant data structures wh...

[ 0.00848388671875, 0.007110595703125, 0.0152587890625, 0.00439453125, -0.00157928466796875, 0.01123046875, -0.00958251953125, 0.004364013671875, -0.0015716552734375, -0.000042438507080078125, 0.00823974609375, -0.006103515625, 0.0135498046875, 0.01458740234375, 0.01318359375, 0.01135253...

[ 101790, 527, 73265, 69101, 6275, 1314, 8108, 23, 23253, 241, 864, 1556, 142508, 225490, 5303, 1049, 37202, 117414, 35166, 110, 69405, 6626, 6051, 2053, 45646, 24763, 14858, 3789, 161549, 98816, 11389 ]

[ 0.043609619140625, 0.1290283203125, 0.242431640625, 0.2275390625, 0.2166748046875, 0.1590576171875, 0.115478515625, 0.030914306640625, 0.1458740234375, 0.05328369140625, 0.196533203125, 0.12109375, 0.205078125, 0.196044921875, 0.01043701171875, 0.089599609375, 0.008697509765625, 0....

embed

31798004_c2

31798004

haskell

2

bytes copied during GC 82,325,144 bytes maximum Code signals: qualified, Control.Monad.Par, -N2, Diagnosing, Data.ByteString.Char8, Data.Attoparsec.ByteString.Char8, P.Parser, Complex, Data.ByteString.Lazy.Char8, Data.Attoparsec.ByteString.Lazy, LP.Result, LB.words, LB.readFile, out.txt, extr.LP.parse, Tot, Avg, Max, ...

[ 0.0159912109375, 0.0128173828125, 0.0079345703125, 0.007720947265625, 0.01116943359375, 0.0120849609375, -0.00848388671875, -0.00131988525390625, 0.00897216796875, -0.01190185546875, 0.0029144287109375, -0.01220703125, -0.005645751953125, 0.0106201171875, 0.0021514892578125, 0.00158691...

[ 390, 1636, 71200, 71, 20271, 6, 69657, 382, 155761, 2588, 131663, 38132, 28864, 26073, 7, 12, 217225, 27131, 46674, 712, 28636, 20, 839, 304, 128198, 214, 11809, 5, 75358, 67, 71713, 84068, 1019, 10628, 39797, 436, 2189, 113197, 2729, 328...

[ 0.1884765625, 0.1346435546875, 0.258056640625, 0.09515380859375, 0.18603515625, 0.01373291015625, 0.261962890625, 0.094970703125, 0.050384521484375, 0.1605224609375, 0.1473388671875, 0.2283935546875, 0.252685546875, 0.270263671875, 0.1005859375, 0.0242919921875, 0.220703125, 0.1914...

embed

62713410_c2

62713410

haskell

2

Int32, FibreUInt32, FibreInt64, FibreUInt64, FibreFloat, FibreBool, FibreJSON, FibreList, Show, Ord, FibreAccess, FibreReadable, FibreReadWriteable, FibreObject, FibreValue, _fibreValueName, _fibreValueEndpoint, Word16, _fibreValueType, _fibreValueAccess, FibreFunction, _fibreFunctionName, _fibreFunctionEndpoint, _fibr...

[ 0.01300048828125, -0.0189208984375, 0.0045166015625, -0.0007781982421875, -0.002960205078125, 0.0169677734375, 0.01220703125, -0.0172119140625, 0.0263671875, 0.0296630859375, 0.00128936767578125, 0.0057373046875, -0.0030670166015625, 0.019775390625, 0.0242919921875, -0.007476806640625,...

[ 360, 18, 6460, 4, 3698, 4134, 33457, 660, 4153, 13307, 919, 365, 257, 12647, 929, 1375, 58627, 154663, 17367, 35379, 39450, 26531, 31345, 2886, 18781, 46471, 75161, 856, 50770, 101, 1029, 163612, 152378, 38496, 22543, 2485, 196707, 97249, 7...

[ 0.1204833984375, 0.1583251953125, 0.2744140625, 0.08648681640625, 0.2056884765625, 0.218017578125, 0.054931640625, 0.1558837890625, 0.09228515625, 0.2548828125, 0.054351806640625, 0.15576171875, 0.1387939453125, 0.109619140625, 0.1820068359375, 0.107421875, 0.199462890625, 0.194824...

embed

29099732_c0

29099732

haskell

0

Title: Haskell "abc123de45" to [123,45] Problem title: Haskell "abc123de45" to [123,45] Tags: string, int, haskell Problem: Haskell "abc123de45" to [123,45] From a String like "abc123def45" i want to get -> [123, 45]. I have the following now: getDecimals :: String -> [Int] getDecimals xs = [ digitT...

Haskell "abc123de45" to [123,45] Haskell "abc123de45" to [123,45] string int haskell Haskell abc123de45 Haskell "abc123de45" to [123,45] From a String like "abc123def45" i want to get -> [123, 45]. I have the following now: Only this method is returning -> [1,2,3,4,5]. How can i do this? Tnx!

[ -0.00101470947265625, 0.00604248046875, -0.01611328125, 0.018310546875, -0.01190185546875, 0.034423828125, -0.00860595703125, -0.0078125, 0.016845703125, -0.0013580322265625, 0.00341796875, -0.029052734375, -0.0108642578125, -0.000652313232421875, -0.00823974609375, 0.00186920166015625...

[ 20625, 142508, 2055, 238, 48636, 112, 4633, 47, 79315, 23, 18, 1556, 1563, 28090, 23351, 1884, 420, 17, 3444, 2046, 33079, 4, 2678, 25632, 5036, 87293, 903, 55300, 30646, 68252, 155761, 80389, 831, 54 ]

[ 0.1512451171875, 0.254150390625, 0.06878662109375, 0.05078125, 0.2437744140625, 0.1600341796875, 0.2666015625, 0.10986328125, 0.1627197265625, 0.04156494140625, 0.07275390625, 0.143798828125, 0.0760498046875, 0.121826171875, 0.1646728515625, 0.05755615234375, 0.102783203125, 0.0101...

embed

57655853_c0

57655853

haskell

0

Title: Parse nested yaml with Haskell Problem title: Parse nested yaml with Haskell Tags: yaml, haskell Problem: Parse nested yaml with Haskell How would one define a type for the following yaml configuration: request: a: "https://google/1" b: "https://google/2" c: "https://google/3" Would it be like this? data Config ...

Parse nested yaml with Haskell Parse nested yaml with Haskell yaml haskell Parse Haskell Config Show Generic Parse nested yaml with Haskell How would one define a type for the following yaml configuration: Would it be like this? and then define id' later?

[ 0.0008392333984375, 0.0172119140625, -0.01116943359375, 0.01214599609375, 0.01416015625, 0.027587890625, -0.0054931640625, -0.037353515625, -0.0166015625, 0.000965118408203125, -0.0220947265625, -0.03369140625, -0.006988525390625, -0.007232666015625, -0.00848388671875, 0.010498046875, ...

[ 2392, 184, 8512, 71, 151, 7237, 678, 20625, 142508, 1556, 139403, 17367, 88342, 61924, 10644, 25632, 180346, 154559, 1884, 903, 3447, 25, 14432 ]

[ 0.12060546875, 0.072509765625, 0.20849609375, 0.06695556640625, 0.1514892578125, 0.2205810546875, 0.074462890625, 0.1119384765625, 0.201416015625, 0.1090087890625, 0.1029052734375, 0.07476806640625, 0.096435546875, 0.150146484375, 0.2034912109375, 0.05889892578125, 0.162841796875, ...

embed

38724911_c1

38724911

haskell

1

),(1.0,0.0,2.0,1.0)] because Node 1 has successors 2(2.0,0.0) and 3(2.0,1.0) EDIT: I wrote functions : pairs [] = [] pairs ((nodeId,nodesucc):xs) = map (nodeId,) nodesucc : pairs xs pairsConcat = concat $ pairs $ edg graph2 so now second list looks like: [(1,2),(1,3),(2,4),(2,5),(3,14),(4,6),(5,7),(14,6),(14,7),(14,13)...

[ -0.0003719329833984375, 0.007720947265625, -0.0211181640625, 0.01416015625, -0.004302978515625, 0.00982666015625, -0.044921875, 0.00958251953125, 0.01409912109375, -0.0174560546875, -0.0098876953125, -0.0169677734375, -0.007080078125, -0.020751953125, 0.00579833984375, 0.00579833984375...

[ 247, 102107, 99929, 73011, 6637, 438, 112, 106, 1556, 39457, 4295, 116, 138, 172864, 54397, 32354, 80836, 7, 157, 71, 988, 34, 10060, 425, 22288, 110, 1022, 11935, 4460, 158, 2223, 177, 41382, 304, 17932, 5303, 33342, 1884, 133063, 21320,...

[ 0.05657958984375, 0.14306640625, 0.1654052734375, 0.1668701171875, 0.055145263671875, 0.1708984375, 0.143798828125, 0.06463623046875, 0.03533935546875, 0.17333984375, 0.0848388671875, 0.049835205078125, 0.1365966796875, 0.00396728515625, 0.0302734375, 0.14990234375, 0.1898193359375, ...

embed

26474202_c2

26474202

haskell

2

Programming/Haskell/eggs.hs:8:9) Note: there are several Code signals: the, a, x, Haskell, Users, Dennis, Google, Drive, Programming, eggs.hs:1:27, Enum, Relevant, eggs.hs:1:9, Note, Double, Defined, GHC.Float, Float, Integral, GHC.Real.Ratio, GHC.Real, eggs.hs:1:28, Num, eggs.hs:8:22, Bool, eggs.hs:8:28, eggs.hs:8:18,...

[ 0.007049560546875, -0.0030364990234375, -0.0019989013671875, 0.015869140625, -0.0001544952392578125, 0.038818359375, -0.0263671875, 0.0084228515625, -0.00022125244140625, 0.000873565673828125, -0.0205078125, -0.030029296875, 0.0115966796875, 0.000858306884765625, -0.005706787109375, 0....

[ 27958, 214, 6495, 7, 142508, 2507, 9405, 127, 1019, 12, 1126, 18622, 2685, 40368, 28864, 26073, 70, 10, 1022, 20625, 53400, 124748, 1815, 50161, 56125, 19721, 27592, 357, 316, 133, 30624, 107172, 262, 5983, 527, 73265, 365, 38699, 204681, ...

[ 0.166748046875, 0.084716796875, 0.1298828125, 0.1151123046875, 0.292724609375, 0.151611328125, 0.18505859375, 0.1173095703125, 0.1307373046875, 0.0279541015625, 0.2061767578125, 0.1827392578125, 0.02813720703125, 0.1004638671875, 0.2353515625, 0.267578125, 0.09869384765625, 0.12048...

embed

2175045_c0

2175045

haskell

0

Title: How to read bytes from a Socket in Haskell Problem title: How to read bytes from a Socket in Haskell Tags: network-programming, haskell, sockets Problem: How to read bytes from a Socket in Haskell I'm trying to read a number of Bytes from a socket in Haskell. Bascially I want to do something equivalent to this: ...

How to read bytes from a Socket in Haskell How to read bytes from a Socket in Haskell network-programming haskell sockets a How Socket Haskell client_socket.recv Python How to read bytes from a Socket in Haskell I'm trying to read a number of Bytes from a socket in Haskell. Bascially I want to do something equivalent t...

[ 0.005523681640625, 0.0184326171875, 0.01007080078125, -0.0018157958984375, 0.00396728515625, 0.002960205078125, -0.007110595703125, -0.0123291015625, -0.0103759765625, -0.0311279296875, 0.0302734375, -0.035888671875, -0.007293701171875, 0.00127410888671875, -0.0021514892578125, -0.0222...

[ 11249, 47, 12301, 390, 1636, 1295, 1061, 27853, 23, 20625, 142508, 33120, 28966, 1556, 221, 23282, 991, 334, 145581, 10, 31577, 14012, 3311, 3444, 183234, 903, 2965, 3917, 20594 ]

[ 0.051849365234375, 0.06121826171875, 0.200439453125, 0.1446533203125, 0.1668701171875, 0.1142578125, 0.1370849609375, 0.2340087890625, 0.0513916015625, 0.1348876953125, 0.2254638671875, 0.0237579345703125, 0.042816162109375, 0.09906005859375, 0.1141357421875, 0.1075439453125, 0.06591...

embed

46002600_c0

46002600

haskell

0

Title: grouping elements in a list in haskell Problem title: grouping elements in a list in haskell Tags: haskell, list Problem: grouping elements in a list in haskell I want to transform a list from [1,26,3,94,51,6,7,8,9,10,11,12,73,29,19,90,76,87,1] to [[1],[26,3],[94,51,6],[7,8,9,10],[11,12,73,29,19]] and so on till...

grouping elements in a list in haskell grouping elements in a list in haskell haskell list grouping elements in a list in haskell I want to transform a list from [1,26,3,94,51,6,7,8,9,10,11,12,73,29,19,90,76,87,1] to [[1],[26,3],[94,51,6],[7,8,9,10],[11,12,73,29,19]] and so on till end in haskell. (I'm trying to group ...

[ 0.004547119140625, 0.01092529296875, -0.003997802734375, -0.0030517578125, -0.006072998046875, 0.0198974609375, -0.0223388671875, -0.0032196044921875, 0.0103759765625, 0.008056640625, 0.013916015625, -0.005645751953125, 0.007049560546875, -0.004302978515625, -0.0257568359375, 0.0013122...

[ 21115, 214, 80854, 23, 10, 5303, 1556, 142508, 87, 3444, 47, 27198, 1295, 68252, 4046, 125157, 80389, 418, 136555, 145180, 963, 1662, 1530, 13574, 4235, 193328, 11835, 19308, 76172, 378, 25256, 96386, 1126, 163090, 966, 2947, 98, 570, 3564,...

[ 0.2474365234375, 0.138671875, 0.258544921875, 0.119140625, 0.062103271484375, 0.240966796875, 0.192626953125, 0.2587890625, 0.033905029296875, 0.151611328125, 0.1583251953125, 0.2470703125, 0.134765625, 0.06182861328125, 0.2337646484375, 0.133544921875, 0.1458740234375, 0.098999023...

embed

65805098_c0

65805098

haskell

0

Title: Functor instance of kind * Problem title: Functor instance of kind * Tags: haskell Problem: Functor instance of kind * I have newtype: newtype Foo = Foo ([Int]) I would like to simply apply Int -> Int function over it like it is possible with fmap. I thought it will be enough to derive or implement Functor insta...

Functor instance of kind * Functor instance of kind * haskell Functor Foo Functor instance of kind * I have newtype: I would like to simply apply Int -> Int function over it like it is possible with fmap. I thought it will be enough to derive or implement Functor instance, but it requires type of * -> * kind. Is there ...

[ -0.0031890869140625, -0.0230712890625, 0.01129150390625, -0.01190185546875, 0.006103515625, 0.0098876953125, -0.007171630859375, -0.0067138671875, 0.013916015625, -0.015380859375, -0.0107421875, -0.0262451171875, -0.004547119140625, 0.01300048828125, -0.0283203125, -0.0419921875, 0.0...

[ 28670, 18770, 110527, 111, 8562, 661, 1556, 142508, 9572, 31, 3525, 50986, 2806, 1884, 42856, 59911, 360, 18, 33079, 32354, 645, 442, 7722, 1238, 62346, 17569, 20174, 122, 5844, 29479, 4, 1284, 144570, 10644, 88303, 73, 3917, 3249, 2878, ...

[ 0.1612548828125, 0.1795654296875, 0.260498046875, 0.0672607421875, 0.1905517578125, 0.054168701171875, 0.1131591796875, 0.2154541015625, 0.1617431640625, 0.1121826171875, 0.0938720703125, 0.2425537109375, 0.04193115234375, 0.07843017578125, 0.034149169921875, 0.1407470703125, 0.11511...

embed

67699175_c1

67699175

haskell

1

second argument of ‘elem'’, namely ‘xs’ In the first argument of ‘(==)’, namely ‘(elem' a xs)’ In the expression: ((elem' a xs) == (elem a xs)) <interactive>:258:54: error: • Couldn't match expected type ‘[()]’ with actual type ‘Int’ • In the second argument of ‘elem’, namely ‘xs’ In the second argument of ‘(==)’, nam...

[ -0.005584716796875, -0.004425048828125, 0.002471923828125, -0.01123046875, 0.007293701171875, 0.01171875, -0.01190185546875, -0.0201416015625, 0.0106201171875, 0.00921630859375, 0.00250244140625, 0.01025390625, 0.004364013671875, -0.006500244140625, -0.01226806640625, -0.0281982421875,...

[ 17932, 10750, 111, 27889, 110987, 425, 7, 360, 70, 5117, 69112, 132, 25, 10, 1022, 125195, 60494, 10433, 71232, 21224, 1019, 34417, 18499, 768, 191147, 18, 14858, 84751, 10644, 1065, 678, 8561, 4153, 26, 28864, 26073, 8647, 5, 96010, 2594...

[ 0.215087890625, 0.27880859375, 0.02874755859375, 0.2237548828125, 0.072509765625, 0.1724853515625, 0.1187744140625, 0.047943115234375, 0.022369384765625, 0.1240234375, 0.265380859375, 0.1192626953125, 0.06396484375, 0.09381103515625, 0.1571044921875, 0.21142578125, 0.103271484375, ...

embed

10188276_c0

10188276

haskell

0

Title: Faster `elem` Using Binary Search In Haskell Problem title: Faster `elem` Using Binary Search In Haskell Tags: haskell Problem: Faster `elem` Using Binary Search In Haskell I have a list of Text s, and they are in sorted order. Seems to me that I can write a much faster version of elem by implementing it as a bi...

Faster `elem` Using Binary Search In Haskell Faster `elem` Using Binary Search In Haskell haskell Faster Using Binary Search Haskell Text Faster `elem` Using Binary Search In Haskell I have a list of Text s, and they are in sorted order. Seems to me that I can write a much faster version of elem by implementing it as a...

[ 0.0145263671875, -0.000514984130859375, 0.0181884765625, 0.0010528564453125, 0.00238037109375, 0.021728515625, 0.008056640625, -0.01226806640625, -0.022216796875, -0.009033203125, 0.0078125, 0.0030517578125, 0.007110595703125, 0.01043701171875, 0.0194091796875, -0.006927490234375, 0....

[ 25290, 56, 27889, 345, 54092, 1294, 33086, 360, 20625, 142508, 6953, 1556, 24129, 765, 5303, 91, 17497, 12989, 6872, 831, 33022, 5045, 4271, 11389, 88, 195, 29479, 237, 2394, 6635, 33938, 64457, 192617, 101790, 6044, 32316, 21771 ]

[ 0.147216796875, 0.1253662109375, 0.20751953125, 0.05926513671875, 0.19677734375, 0.1341552734375, 0.238037109375, 0.0560302734375, 0.140380859375, 0.2464599609375, 0.033538818359375, 0.1241455078125, 0.152587890625, 0.03558349609375, 0.096435546875, 0.0540771484375, 0.1192626953125, ...

embed

21900843_c2

21900843

haskell

2

=> (a, a) -> [a] -> [a] at mfilter.hs:8:12 Expected type: [a] -> a Actual type: [a] -> [a] In the return type of a call of `exclude' In the first argument of `map', namely `(exclude (first, Code signals: the, Haskell, Sat, Feb, Ord, range:t, x:t, Prelude, mfilter.hs, Compiling, Main, mfilter.hs:5:42, Could, mfilter.hs...

[ -0.01708984375, 0.011474609375, -0.00139617919921875, -0.00159454345703125, -0.0037384033203125, 0.0029449462890625, -0.0152587890625, 0.000659942626953125, 0.0225830078125, -0.00909423828125, -0.013916015625, 0.00933837890625, 0.01904296875, -0.0036163330078125, 0.006805419921875, -0....

[ 44357, 11, 10, 33079, 99, 347, 120337, 127, 7, 1019, 20927, 60075, 13, 89829, 10644, 100582, 360, 30646, 11782, 158928, 9233, 5117, 10750, 62346, 13448, 271, 28864, 26073, 70, 20625, 142508, 20745, 43677, 35379, 37457, 18, 1022, 1914, 822, ...

[ 0.155029296875, 0.09344482421875, 0.10888671875, 0.07928466796875, 0.0228424072265625, 0.04315185546875, 0.26611328125, 0.05633544921875, 0.021697998046875, 0.0782470703125, 0.1502685546875, 0.1324462890625, 0.1466064453125, 0.09490966796875, 0.1773681640625, 0.25146484375, 0.0207824...

embed

64523388_c0

64523388

haskell

0

Title: Haskell filter using fst and snd in query Problem title: Haskell filter using fst and snd in query Tags: haskell Problem: Haskell filter using fst and snd in query I'm very new to haskell and am trying to filter all the tuples where the first element is bigger than the second. I don't understand why this doesn't...

Haskell filter using fst and snd in query Haskell filter using fst and snd in query haskell fst Haskell Haskell filter using fst and snd in query I'm very new to haskell and am trying to filter all the tuples where the first element is bigger than the second. I don't understand why this doesn't work, any help?

[ 0.004425048828125, 0.0311279296875, -0.0157470703125, -0.005889892578125, -0.0003108978271484375, -0.0005950927734375, -0.009765625, 0.004608154296875, 0.0108642578125, -0.0216064453125, -0.004058837890625, 0.003509521484375, -0.0034332275390625, 0.003875732421875, -0.0101318359375, 0....

[ 20625, 142508, 46312, 17368, 1238, 271, 136, 91, 2208, 41, 1294, 23, 1556, 3525, 31577, 756, 370, 99726, 5117, 12830, 167785, 3501, 17932, 28219, 15400, 903, 22027, 18, 4488, 4358 ]

[ 0.132568359375, 0.2130126953125, 0.2449951171875, 0.04241943359375, 0.10205078125, 0.1593017578125, 0.082763671875, 0.06768798828125, 0.1900634765625, 0.125732421875, 0.05914306640625, 0.018768310546875, 0.123046875, 0.035369873046875, 0.03790283203125, 0.00775146484375, 0.1036376953...

embed

10376963_c0

10376963

haskell

0

Title: Why doesn't this Haskell typeclass code work? Problem title: Why doesn't this Haskell typeclass code work? Tags: typeclass, haskell Problem: Why doesn't this Haskell typeclass code work? Trying to figure out Haskell typeclasses. Why doesn't the following work? {-# LANGUAGE FlexibleInstances #-} class I...

Why doesn't this Haskell typeclass code work? Why doesn't this Haskell typeclass code work? typeclass haskell the Why Haskell LANGUAGE FlexibleInstances IntClass Could f.hs:10:1-16 f.hs:10:1 Why doesn't this Haskell typeclass code work? Trying to figure out Haskell typeclasses. Why doesn't the following work?...

[ -0.012939453125, -0.0020751953125, 0.014404296875, 0.011474609375, -0.0118408203125, 0.0111083984375, -0.010498046875, 0.004730224609375, -0.01275634765625, 0.0002956390380859375, -0.0118408203125, -0.023681640625, 0.000240325927734375, 0.01507568359375, -0.0111083984375, -0.0290527343...

[ 44084, 22027, 3768, 18, 903, 20625, 142508, 10644, 67413, 18151, 4488, 1556, 70, 98064, 180842, 2661, 116071, 360, 140803, 191147, 1238, 127, 15110, 19721, 13528, 26366, 25632, 73, 29459, 18499, 26008, 959, 28219 ]

[ 0.10577392578125, 0.1314697265625, 0.0660400390625, 0.1373291015625, 0.1104736328125, 0.1318359375, 0.2132568359375, 0.1773681640625, 0.2491455078125, 0.1517333984375, 0.1405029296875, 0.129150390625, 0.046966552734375, 0.0321044921875, 0.1031494140625, 0.09033203125, 0.1865234375, ...

embed

16633101_c0

16633101

haskell

0

Title: How does this Haskell function work? Problem title: How does this Haskell function work? Tags: haskell Problem: How does this Haskell function work? I was struggling to see how this function worked. For the nth number it should calculate the sum of the previous three elements. f' :: Integer->Integer f' = helper ...

How does this Haskell function work? How does this Haskell function work? haskell How Haskell Integer n-1 How does this Haskell function work? I was struggling to see how this function worked. For the nth number it should calculate the sum of the previous three elements. Thanks for your time

[ 0.0003337860107421875, -0.001953125, 0.00445556640625, 0.01031494140625, -0.00994873046875, 0.0181884765625, -0.003997802734375, -0.0004177093505859375, 0.004730224609375, -0.02783203125, -0.000942230224609375, -0.0302734375, -0.00090789794921875, 0.01165771484375, 0.0107421875, -0.006...

[ 11249, 14602, 903, 20625, 142508, 32354, 4488, 1556, 44401, 653, 5759, 237875, 1957, 3642, 79786, 1326, 927, 14012, 442, 5608, 74481, 10554, 96362, 17262, 80854, 1733 ]

[ 0.1263427734375, 0.1314697265625, 0.1468505859375, 0.1705322265625, 0.27880859375, 0.2266845703125, 0.171875, 0.1483154296875, 0.210693359375, 0.1455078125, 0.2017822265625, 0.08465576171875, 0.0105743408203125, 0.0765380859375, 0.1365966796875, 0.0357666015625, 0.1622314453125, 0....

embed

73592196_c0

73592196

haskell

0

Title: How can I run a list of independent IO actions in parallel? Problem title: How can I run a list of independent IO actions in parallel? Tags: haskell, concurrency Problem: How can I run a list of independent IO actions in parallel? Is there something that does the same thing as sequenceA does to [IO a] , but that...

How can I run a list of independent IO actions in parallel? How can I run a list of independent IO actions in parallel? haskell concurrency How How can I run a list of independent IO actions in parallel? Is there something that does the same thing as sequenceA does to [IO a] , but that runs them concurrently? I don’t n...

[ -0.016845703125, 0.00142669677734375, -0.0096435546875, 0.001800537109375, -0.0022125244140625, 0.00933837890625, -0.007476806640625, -0.0035552978515625, 0.0059814453125, -0.01611328125, -0.004486083984375, -0.0009307861328125, 0.01300048828125, 0.0274658203125, -0.01043701171875, -0....

[ 11249, 831, 87, 11675, 5303, 111, 41371, 17780, 61972, 23, 95103, 1556, 142508, 108636, 982, 14602, 5701, 40, 944, 3956, 284, 47, 10, 1284, 127877, 2856, 133244, 3871, 56776, 214, 756 ]

[ 0.08721923828125, 0.10076904296875, 0.042572021484375, 0.15576171875, 0.167236328125, 0.0616455078125, 0.208251953125, 0.2218017578125, 0.1817626953125, 0.0821533203125, 0.2401123046875, 0.1107177734375, 0.213134765625, 0.1092529296875, 0.06829833984375, 0.0201568603515625, 0.0218963...

embed

74873397_c1

74873397

haskell

1

[1, 5, 8] [2, 6, 67] == [[1, 2], [1, 6], [1, 67], [5, 6], [5, 67], [8, 67], [1, 2, 5, 6, 8, 67], [5, 6, 8, 67], [1, 2, 5, 67], [1, 6, 8, 67], [1, 2, 8, 67], [1, 2, 5, 6]] -- But this is what i actually get( and the problem comes from the processMore, but don't know how to fix it): generate [1, 5, 8] [2, 6, 67] -> [[1,...

[ 0.0024566650390625, 0.01318359375, 0.0020294189453125, 0.005157470703125, -0.013916015625, 0.01953125, -0.0244140625, -0.01434326171875, 0.0166015625, -0.0091552734375, 0.003997802734375, 0.0164794921875, 0.017822265625, 0.0203857421875, -0.01483154296875, -0.0064697265625, 0.0163574...

[ 68252, 190, 382, 268, 304, 305, 12661, 69112, 110558, 418, 116, 4, 758, 1019, 4966, 903, 2367, 17, 20653, 2046, 2967, 32497, 9433, 122880, 1284, 3714, 30022, 2077, 139392, 33079, 133063, 163090, 966, 104629, 18197, 71928, 151664, 28864, 260...

[ 0.09735107421875, 0.22509765625, 0.247314453125, 0.07537841796875, 0.13330078125, 0.1884765625, 0.2548828125, 0.185302734375, 0.001007080078125, 0.04241943359375, 0.11572265625, 0.04791259765625, 0.12939453125, 0.1419677734375, 0.23681640625, 0.0245513916015625, 0.0144195556640625, ...

embed

4776750_c0

4776750

haskell

0

Title: What is an idiomatic way to add lists in Haskell? Problem title: What is an idiomatic way to add lists in Haskell? Tags: nested-lists, haskell Problem: What is an idiomatic way to add lists in Haskell? Suppose I want to add two lists in Haskell. What is the most usual way to do this? Here's what I did: addLists ...

What is an idiomatic way to add lists in Haskell? What is an idiomatic way to add lists in Haskell? nested-lists haskell What Haskell Integral What is an idiomatic way to add lists in Haskell? Suppose I want to add two lists in Haskell. What is the most usual way to do this? Here's what I did:

[ -0.01251220703125, -0.001068115234375, -0.00616455078125, 0.0030975341796875, -0.00714111328125, 0.034912109375, -0.00093841552734375, -0.0233154296875, 0.003204345703125, -0.022216796875, 0.0157470703125, -0.0279541015625, -0.0022735595703125, 0.0286865234375, -0.0003108978271484375, ...

[ 4865, 49666, 9523, 3917, 15190, 5303, 7, 23, 20625, 142508, 83, 142, 47, 8512, 71, 6562, 1556, 204681, 121691, 3444, 6626, 2684, 115723, 54, 903 ]

[ 0.02490234375, 0.19921875, 0.1497802734375, 0.0888671875, 0.1767578125, 0.228759765625, 0.113037109375, 0.0667724609375, 0.1585693359375, 0.2408447265625, 0.032135009765625, 0.05364990234375, 0.04852294921875, 0.17333984375, 0.1025390625, 0.212158203125, 0.143310546875, 0.208862304...

embed

5818377_c0

5818377

haskell

0

Title: How do i write the following function with the >>= operator Problem title: How do i write the following function with the >>= operator Tags: monads, haskell Problem: How do i write the following function with the >>= operator How do I write this function using the >>= operator? parseNumber2 :: Parser...

How do i write the following function with the >>= operator How do i write the following function with the >>= operator monads haskell How parseNumber2 Parser LispVal many1 Number How do i write the following function with the >>= operator How do I write this function using the >>= operator?

[ -0.0299072265625, 0.00384521484375, -0.00116729736328125, 0.010498046875, 0.01104736328125, 0.035400390625, -0.009521484375, -0.006256103515625, 0.0238037109375, -0.031494140625, 0.006134033203125, -0.0211181640625, 0.00185394287109375, -0.0013580322265625, 0.0140380859375, 0.003936767...

[ 11249, 54, 17, 33022, 25632, 32354, 678, 619, 5386, 74, 1230, 1369, 39933, 70, 2667, 712, 7, 1556, 142508, 366, 184, 18444, 26278, 304, 2392, 2189, 1261, 7008, 42272, 5941, 418, 103332, 6396, 87, 903, 17368 ]

[ 0.0926513671875, 0.04547119140625, 0.09771728515625, 0.177490234375, 0.15576171875, 0.2064208984375, 0.08245849609375, 0.048828125, 0.1644287109375, 0.03485107421875, 0.0601806640625, 0.15673828125, 0.238037109375, 0.04632568359375, 0.100830078125, 0.14306640625, 0.0548095703125, 0...

embed

58575205_c0

58575205

haskell

0

Title: How To uninstall a stack package Problem title: How To uninstall a stack package Tags: haskell-stack, uninstallation, haskell Problem: How To uninstall a stack package I installed yesod via stack install yesod-bin And it installed it on my $HOME/.local/bin directory, I'm trying to uninstall it over stack uninsta...

How To uninstall a stack package How To uninstall a stack package haskell-stack uninstallation haskell How How To uninstall a stack package I installed yesod via And it installed it on my $HOME/.local/bin directory, I'm trying to uninstall it over stack uninstall yesod-bin, but I'm not being successful, wonder if I jus...

[ -0.00787353515625, 0.00909423828125, 0.01263427734375, 0.01556396484375, -0.027099609375, -0.0028533935546875, -0.01092529296875, -0.006927490234375, -0.01275634765625, 0.004974365234375, -0.00653076171875, -0.007598876953125, -0.00933837890625, 0.01556396484375, -0.015625, 0.001670837...

[ 11249, 717, 51, 80383, 177261, 98169, 10, 1556, 142508, 590, 2594, 105348, 20600, 2422, 23722, 1829, 442, 98, 91245, 5, 98908, 7568, 14364, 31577, 645, 65771, 32195, 154109, 186, 20174, 20949, 5773, 5426 ]

[ 0.0439453125, 0.06085205078125, 0.1527099609375, 0.222412109375, 0.2257080078125, 0.229248046875, 0.0152740478515625, 0.12548828125, 0.211181640625, 0.09552001953125, 0.1248779296875, 0.1588134765625, 0.121826171875, 0.162353515625, 0.2314453125, 0.09527587890625, 0.0863037109375, ...

embed

9220986_c0

9220986

haskell

0

Title: Is there any haskell function to concatenate list with separator? Problem title: Is there any haskell function to concatenate list with separator? Tags: haskell, list, concatenation Problem: Is there any haskell function to concatenate list with separator? Is there a function to concatenate elements of a list wi...

Is there any haskell function to concatenate list with separator? Is there any haskell function to concatenate list with separator? haskell list concatenation Is there any haskell function to concatenate list with separator? Is there a function to concatenate elements of a list with a separator? For example: Thanks for...

[ 0.00225830078125, -0.0269775390625, -0.0027008056640625, 0.004119873046875, -0.00762939453125, -0.0029754638671875, 0.005462646484375, 0.007537841796875, -0.001007080078125, -0.01422119140625, -0.006072998046875, -0.0152587890625, 0.01007080078125, -0.003021240234375, -0.026611328125, ...

[ 2071, 2685, 2499, 1556, 142508, 32354, 47, 158, 33478, 76, 67, 5303, 678, 38310, 748, 4460, 33, 2320, 10, 80854, 27781 ]

[ 0.00830078125, 0.049407958984375, 0.07958984375, 0.12255859375, 0.2379150390625, 0.2122802734375, 0.06097412109375, 0.09478759765625, 0.173583984375, 0.123779296875, 0.04351806640625, 0.1998291015625, 0.1136474609375, 0.2086181640625, 0.1715087890625, 0.1441650390625, 0.1055908203125...

embed

60354247_c0

60354247

haskell

0

Title: Is there a function in Haskell to group the elements of a list in the following way? Problem title: Is there a function in Haskell to group the elements of a list in the following way? Tags: haskell Problem: Is there a function in Haskell to group the elements of a list in the following way? Suppose I have a lis...

Is there a function in Haskell to group the elements of a list in the following way? Is there a function in Haskell to group the elements of a list in the following way? haskell Haskell Is there a function in Haskell to group the elements of a list in the following way? Suppose I have a list [0,1,2,3] and I want a new ...

[ 0.00133514404296875, 0.0115966796875, -0.00982666015625, -0.006927490234375, -0.006622314453125, 0.02490234375, -0.03271484375, -0.0098876953125, 0.0103759765625, 0.01171875, 0.0029449462890625, -0.0098876953125, 0.0030517578125, 0.007080078125, -0.0228271484375, 0.00909423828125, 0....

[ 2071, 2685, 10, 32354, 23, 20625, 142508, 47, 21115, 70, 80854, 5303, 25632, 3917, 111, 1556, 121691, 2389, 133063, 96386, 3444, 3525, 678, 17727, 155761, 54, 903 ]

[ 0.0144500732421875, 0.056671142578125, 0.0716552734375, 0.239013671875, 0.0888671875, 0.139892578125, 0.258056640625, 0.0770263671875, 0.2626953125, 0.048797607421875, 0.210693359375, 0.2230224609375, 0.130615234375, 0.1123046875, 0.04486083984375, 0.09393310546875, 0.023956298828125...

embed

12546757_c0

12546757

haskell

0

Title: How do I use cabal's MIN_VERSION_ and other macros with ghci? Problem title: How do I use cabal's MIN_VERSION_ and other macros with ghci? Tags: cabal, ghci, haskell Problem: How do I use cabal's MIN_VERSION_ and other macros with ghci? When I use Cabal's various MIN_VERSION_ macros in a Haskell projec...

How do I use cabal's MIN_VERSION_ and other macros with ghci? How do I use cabal's MIN_VERSION_ and other macros with ghci? cabal ghci haskell How MIN_VERSION_ How do I use cabal's MIN_VERSION_ and other macros with ghci? When I use Cabal's various MIN_VERSION_ macros in a Haskell project, how can I ensure th...

[ 0.0022430419921875, -0.0037841796875, 0.03173828125, 0.01611328125, -0.024169921875, 0.004913330078125, 0.00653076171875, 0.0245361328125, 0.01104736328125, 0.01519775390625, -0.017822265625, -0.055419921875, -0.000736236572265625, -0.00726318359375, 0.004364013671875, -0.0025177001953...

[ 11249, 4527, 109524, 3768, 69048, 33255, 118596, 111789, 678, 31380, 318, 1556, 142508, 454, 136, 30438, 289, 67842, 20625, 13452, 63284, 26785, 61924, 17368, 134234, 527, 73265, 14 ]

[ 0.041046142578125, 0.1229248046875, 0.2366943359375, 0.020050048828125, 0.22705078125, 0.1771240234375, 0.130126953125, 0.189453125, 0.0576171875, 0.097900390625, 0.127197265625, 0.0885009765625, 0.209228515625, 0.010467529296875, 0.009033203125, 0.1307373046875, 0.1488037109375, 0...

embed

34603107_c0

34603107

haskell

0

Title: decoding haskell pcap header Problem title: decoding haskell pcap header Tags: pcap, haskell Problem: decoding haskell pcap header I am trying to get more information out of PktHdr in the pcap Haskell library. But it seems like the type does not give me much. How can I get things like source address, destination...

decoding haskell pcap header decoding haskell pcap header pcap haskell PktHdr decoding haskell pcap header I am trying to get more information out of PktHdr in the pcap Haskell library. But it seems like the type does not give me much. How can I get things like source address, destination address and port? Do I have to...

[ 0.0184326171875, -0.0030364990234375, -0.003173828125, 0.050048828125, 0.020263671875, -0.002899169921875, -0.002532958984375, -0.01318359375, -0.005401611328125, 0.0036773681640625, -0.0011138916015625, -0.0439453125, 0.006195068359375, -0.0068359375, -0.0238037109375, -0.001815795898...

[ 8, 587, 6238, 1556, 142508, 915, 15644, 10336, 56, 436, 4164, 841, 7569, 31577, 2046, 1286, 4677, 1810, 20625, 35773, 10644, 959, 8337, 5045, 11249, 831, 8966, 1884, 31344, 29823, 78869, 11469, 3900, 19309, 390, 1636, 35978, 16454, 51584, ...

[ 0.1231689453125, 0.1566162109375, 0.0428466796875, 0.1253662109375, 0.1954345703125, 0.0706787109375, 0.209228515625, 0.16259765625, 0.03851318359375, 0.0777587890625, 0.134521484375, 0.097900390625, 0.176025390625, 0.01025390625, 0.08355712890625, 0.041656494140625, 0.1055908203125,...

embed

15030876_c0

15030876

haskell

0

Title: Haskell in Excel Problem title: Haskell in Excel Tags: haskell Problem: Haskell in Excel I've seen a couple of sources casually refer to the idea of "Haskell in an Excel spreadsheet" - as if this is something that everybody is familiar with and knows about. This is certainly news to me. The idea has obvious appe...

Haskell in Excel Haskell in Excel haskell Haskell Excel Haskell in Excel I've seen a couple of sources casually refer to the idea of "Haskell in an Excel spreadsheet" - as if this is something that everybody is familiar with and knows about. This is certainly news to me. The idea has obvious appeal - Haskell would be i...

[ 0.024169921875, 0.01220703125, -0.0019989013671875, 0.022216796875, 0.0019683837890625, 0.0027008056640625, 0.00119781494140625, -0.0135498046875, -0.01104736328125, -0.0093994140625, -0.016845703125, -0.00958251953125, -0.000789642333984375, 0.0205078125, -0.00537109375, -0.0119628906...

[ 20625, 142508, 23, 30326, 1556, 51592, 24941, 111, 97264, 63044, 15005, 6528, 6495, 7, 142, 93403, 7816, 126, 237, 2174, 195348, 16031, 93002, 68782, 7123, 47, 162520, 149528, 2806, 6397, 14947, 8562, 2499, 37873, 17669, 20653, 4163, 903, 4...

[ 0.2034912109375, 0.305419921875, 0.125244140625, 0.2509765625, 0.179443359375, 0.03619384765625, 0.022430419921875, 0.005645751953125, 0.087646484375, 0.0963134765625, 0.082275390625, 0.12744140625, 0.1746826171875, 0.1552734375, 0.0316162109375, 0.17529296875, 0.177490234375, 0.09...

embed

16182156_c0

16182156

haskell

0

Title: How to use '(<)' as a variable? Problem title: How to use '(<)' as a variable? Tags: haskell Problem: How to use '(<)' as a variable? How would I use the greater or less than sign as a variable so that when I enter Main> mySort (<) [1,5,3,6,4,1,3,3,2] or Main> mySort (>) [1,5,3,6,4,1,3,...

How to use '(<)' as a variable? How to use '(<)' as a variable? haskell How Main How to use '(<)' as a variable? How would I use the greater or less than sign as a variable so that when I enter Main> mySort (<) [1,5,3,6,4,1,3,3,2] or Main> mySort (>) [1,5,3,6,4,1,3,3,2] it will sort the list f...

[ 0.0120849609375, 0.0186767578125, -0.00439453125, -0.02587890625, -0.0120849609375, 0.012939453125, 0.00167083740234375, -0.01104736328125, -0.003173828125, -0.00628662109375, 0.003509521484375, -0.01007080078125, 0.009521484375, 0.0014190673828125, 0.0030670166015625, -0.0093994140625...

[ 11249, 47, 4527, 54764, 3768, 74, 1230, 1277, 237, 10, 77336, 1556, 142508, 12321, 132, 16093, 16, 25, 2806, 117396, 707, 40715, 3501, 24092, 30957, 2740, 759, 158240, 57626, 363, 150643, 90173, 12096, 5303, 1295, 167375, 25617, 96819, 1966...

[ 0.0927734375, 0.0382080078125, 0.144287109375, 0.055633544921875, 0.15966796875, 0.0887451171875, 0.046905517578125, 0.0634765625, 0.103759765625, 0.08056640625, 0.306640625, 0.14404296875, 0.232421875, 0.1160888671875, 0.074951171875, 0.228759765625, 0.08349609375, 0.0247192382812...

embed

23419189_c0

23419189

haskell

0

Title: Printing a values in a tuple in a format Problem title: Printing a values in a tuple in a format Tags: haskell Problem: Printing a values in a tuple in a format This question may seem silly but kindly bear with me i was intending to print a tuple as String1 - 10 Sritng2 - 20 String3 - 30 but if i am putStrLn $ s...

Printing a values in a tuple in a format Printing a values in a tuple in a format haskell Printing String1 Sritng2 String3 Printing a values in a tuple in a format This question may seem silly but kindly bear with me i was intending to print a tuple as but if i am It is giving me the out put as [("String",10),("String"...

[ 0.0079345703125, -0.01007080078125, -0.00457763671875, 0.0234375, 0.00341796875, -0.00127410888671875, -0.0032806396484375, 0.0111083984375, -0.0033721923828125, 0.0296630859375, -0.0028533935546875, -0.02685546875, 0.00567626953125, 0.002288818359375, -0.0181884765625, 0.0101928710937...

[ 39754, 142424, 23, 370, 8705, 9384, 10, 1556, 142508, 23351, 214, 418, 9292, 449, 304, 363, 9655, 1543, 48903, 12097, 8562, 81148, 892, 33770, 28412, 237, 1284, 2174, 17, 444, 68772, 163, 1810, 3884, 71713, 50258, 73419, 62946 ]

[ 0.21044921875, 0.22314453125, 0.036865234375, 0.1373291015625, 0.2420654296875, 0.19970703125, 0.00445556640625, 0.1312255859375, 0.2332763671875, 0.1468505859375, 0.1138916015625, 0.0295562744140625, 0.05621337890625, 0.114990234375, 0.034271240234375, 0.1099853515625, 0.00643920898...

embed

40275080_c0

40275080

haskell

0

Title: How do you use TypeApplications in Haskell? Problem title: How do you use TypeApplications in Haskell? Tags: ghc, types, language-extension, haskell Problem: How do you use TypeApplications in Haskell? With -XTypeApplications in GHC 8.0, you can specify types explicitly with @ preceding function arguments. What ...

How do you use TypeApplications in Haskell? How do you use TypeApplications in Haskell? ghc types language-extension haskell How TypeApplications Haskell XTypeApplications How do you use TypeApplications in Haskell? With -XTypeApplications in GHC 8.0, you can specify types explicitly with @ preceding function arguments...

[ 0.00112152099609375, 0.010986328125, 0.007171630859375, 0.013916015625, -0.002899169921875, 0.011474609375, -0.00958251953125, 0.00732421875, -0.0019683837890625, -0.004791259765625, 0.0274658203125, -0.0390625, 0.002685546875, 0.0115966796875, -0.0018768310546875, -0.0021820068359375,...

[ 11249, 4527, 60457, 47677, 182867, 7, 23, 20625, 142508, 54, 398, 31380, 238, 52895, 46876, 3355, 128872, 1556, 1193, 196707, 17106, 20, 1542, 527, 73265, 3217, 2389, 831, 40140, 18929, 143726, 1374, 107671, 32354, 10750, 66161, 40368, 65508 ...

[ 0.0926513671875, 0.12451171875, 0.2454833984375, 0.1561279296875, 0.2115478515625, 0.03997802734375, 0.0679931640625, 0.1405029296875, 0.23828125, 0.01873779296875, 0.005859375, 0.08563232421875, 0.06915283203125, 0.2216796875, 0.0616455078125, 0.01019287109375, 0.091064453125, 0.1...

embed

28258030_c0

28258030

haskell

0

Title: gtk2Hs : Combo box with text and pictures Problem title: gtk2Hs : Combo box with text and pictures Tags: gtk2hs, haskell, combobox Problem: gtk2Hs : Combo box with text and pictures The basic ComboBox provided by Gtk can only handle a String or a Pixbuf But I wanted a text and a picture nearby on the same row of...

gtk2Hs : Combo box with text and pictures gtk2Hs : Combo box with text and pictures gtk2hs haskell combobox gtk2Hs Combo ComboBox Pixbuf gtk2Hs : Combo box with text and pictures The basic ComboBox provided by Gtk can only handle a String or a Pixbuf But I wanted a text and a picture nearby on the same row of selection...

[ 0.00714111328125, 0.01953125, -0.0167236328125, 0.0439453125, 0.0115966796875, 0.0198974609375, -0.006256103515625, 0.0159912109375, -0.000919342041015625, 0.01123046875, 0.0023345947265625, -0.0308837890625, 0.032470703125, -0.00148773193359375, -0.0167236328125, -0.0103759765625, -...

[ 706, 31472, 304, 841, 7, 3288, 837, 16530, 678, 7986, 136, 75073, 127, 1556, 142508, 375, 11728, 72295, 159939, 978, 420, 62822, 62952, 527, 831, 4734, 34831, 23351, 214, 707, 36663, 49726, 43573, 1272, 5701, 15555, 132216, 113054, 16750, ...

[ 0.05718994140625, 0.254638671875, 0.1488037109375, 0.1776123046875, 0.1192626953125, 0.1578369140625, 0.1983642578125, 0.2071533203125, 0.051025390625, 0.221435546875, 0.1058349609375, 0.1710205078125, 0.13720703125, 0.09686279296875, 0.2607421875, 0.10888671875, 0.2001953125, 0.23...

embed

28469119_c0

28469119

haskell

0

Title: wxc-0.91.0.0 failed to install Problem title: wxc-0.91.0.0 failed to install Tags: haskell, cabal, wxwidgets, reactive-banana Problem: wxc-0.91.0.0 failed to install Code signals: integer, wxc-0.91.0.0, eljlistctrl.cpp, ListCmp, eljlistctrl.cpp:16:23, Wint-to-pointer-cast, eljlistctrl.cpp:16:53, wxListCtrl_SortI...

wxc-0.91.0.0 failed to install wxc-0.91.0.0 failed to install haskell cabal wxwidgets reactive-banana integer wxc-0.91.0.0 eljlistctrl.cpp ListCmp eljlistctrl.cpp:16:23 Wint-to-pointer-cast eljlistctrl.cpp:16:53 wxListCtrl_SortItems eljlistctrl.cpp:478:41 EiffelSort _EiffelSort eljlistctrl.cpp:478:44 wxWidgets-3.0.2 li...

[ -0.00909423828125, -0.0018157958984375, 0.0035858154296875, 0.00341796875, -0.0166015625, -0.00823974609375, -0.003143310546875, -0.0167236328125, -0.006805419921875, 0.03369140625, -0.002471923828125, -0.02978515625, -0.00787353515625, -0.01025390625, -0.0040283203125, 0.0136108398437...

[ 148, 425, 238, 23320, 12183, 99929, 165523, 20600, 1556, 142508, 109524, 32306, 3794, 456, 71232, 105281, 11, 892, 1505, 88, 170, 6562, 54123, 32036, 2676, 6366, 22354, 17686, 18, 188, 38496, 56, 55741, 154663, 4448, 158240, 2982, 157376, 1...

[ 0.1217041015625, 0.1409912109375, 0.1402587890625, 0.042327880859375, 0.23193359375, 0.1746826171875, 0.2047119140625, 0.20361328125, 0.102783203125, 0.1943359375, 0.2216796875, 0.127685546875, 0.1754150390625, 0.081298828125, 0.182861328125, 0.1490478515625, 0.1534423828125, 0.109...

embed

22474411_c0

22474411

haskell

0

Title: Random integer generating in Haskell Problem title: Random integer generating in Haskell Tags: haskell Problem: Random integer generating in Haskell Is there any inbuilt function in Haskell that gives a random number in a range like x = random(a,b) such that x gives an integer lies between a and b . a <= x <= b ...

Random integer generating in Haskell Random integer generating in Haskell haskell Random Haskell Random integer generating in Haskell Is there any inbuilt function in Haskell that gives a random number in a range like x = random(a,b) such that x gives an integer lies between a and b . a <= x <= b And some functions in ...

[ -0.0157470703125, 0.0054931640625, 0.023193359375, -0.007049560546875, 0.0120849609375, 0.0361328125, -0.0155029296875, -0.03369140625, -0.00933837890625, -0.0306396484375, -0.007049560546875, -0.00885009765625, -0.00799560546875, 0.0211181640625, 0.0224609375, -0.020751953125, -0.00...

[ 39643, 306, 892, 1505, 12663, 1916, 23, 20625, 142508, 1556, 2071, 2685, 2499, 978, 24908, 32354, 450, 76199, 96759, 14012, 37457, 1884, 1022, 2203, 11, 4, 275, 6044, 400, 17721, 10, 136, 876, 4426, 1369, 3060, 5701, 3229, 71924, 48716, ...

[ 0.1749267578125, 0.10498046875, 0.146240234375, 0.141845703125, 0.1693115234375, 0.0517578125, 0.1021728515625, 0.157958984375, 0.2568359375, 0.1339111328125, 0.024566650390625, 0.04327392578125, 0.0650634765625, 0.1192626953125, 0.1357421875, 0.1900634765625, 0.0245361328125, 0.08...

embed

64952967_c0

64952967

haskell

0

Title: redefining the 'all' function in haskell Problem title: redefining the 'all' function in haskell Tags: haskell, fold, higher-order-functions Problem: redefining the 'all' function in haskell How can I redefine the all function in haskell using foldr ? I tried writing it like this and I'm not ...

redefining the 'all' function in haskell redefining the 'all' function in haskell haskell fold higher-order-functions Bool x:xs redefining the 'all' function in haskell How can I redefine the all function in haskell using foldr ? I tried writing it like this and I'm not sure why it doesn't work.

[ -0.004913330078125, 0.00946044921875, -0.00005316734313964844, 0.0166015625, 0.003631591796875, 0.025634765625, 0.0030364990234375, 0.000667572021484375, 0.01361083984375, -0.0111083984375, 0.018310546875, -0.01153564453125, -0.00007534027099609375, 0.0224609375, -0.01025390625, 0.0173...

[ 456, 49919, 449, 3768, 5584, 32354, 23, 1556, 142508, 42822, 77546, 80596, 137175, 2460, 929, 1022, 425, 7, 831, 15265, 64552, 70, 756, 17368, 18344, 7569, 37842, 32562, 1884, 903, 9077, 15400, 22027, 18, 4488 ]

[ 0.1162109375, 0.1832275390625, 0.0496826171875, 0.0810546875, 0.2047119140625, 0.23046875, 0.045135498046875, 0.1334228515625, 0.2265625, 0.202880859375, 0.0799560546875, 0.1436767578125, 0.1591796875, 0.020782470703125, 0.1221923828125, 0.0447998046875, 0.041229248046875, 0.030975...

embed

12748659_c1

12748659

haskell

1

)) : tokenize (dropWhile isDigit xs) else tokenize(xs) ast :: [String] -> (AST,[String]) ast [] = error "Empty string" ast (x:xs) | all isDigit x = (Leaf (read x),xs) | x == "-" = let (y,xs') = ast xs in (Min y,xs') | x == "*" = (Prod y y',xs'') where (y,xs') = ast xs (y',xs'') = ast xs' | x == "+" = (Sum y y',xs'') wh...

[ -0.0005340576171875, 0.0016326904296875, -0.000637054443359375, 0.0142822265625, -0.006866455078125, 0.0021209716796875, 0.00372314453125, -0.021484375, -0.011474609375, -0.0009613037109375, -0.004791259765625, -0.003204345703125, -0.0147705078125, -0.0125732421875, -0.0150146484375, 0...

[ 78960, 152, 47, 1098, 20650, 138810, 1456, 979, 133, 83, 14055, 15769, 1022, 7, 37076, 425, 10, 271, 1984, 71713, 214, 33079, 48963, 2203, 18499, 134332, 939, 79315, 12, 756, 5267, 2407, 39116, 69112, 9, 2633, 53, 25, 23, 59076, 113, ...

[ 0.1424560546875, 0.031494140625, 0.15234375, 0.2225341796875, 0.1885986328125, 0.232177734375, 0.01873779296875, 0.1268310546875, 0.0704345703125, 0.1363525390625, 0.0916748046875, 0.17431640625, 0.1297607421875, 0.12890625, 0.06964111328125, 0.159912109375, 0.0633544921875, 0.1771...

embed

35215660_c0

35215660

haskell

0

Title: How to write a recursive function with initial condition in Haskell? Problem title: How to write a recursive function with initial condition in Haskell? Tags: definition, haskell, recursion Problem: How to write a recursive function with initial condition in Haskell? In F# I can define like this: let rec sum = f...

How to write a recursive function with initial condition in Haskell? How to write a recursive function with initial condition in Haskell? definition haskell recursion How Haskell x::xs How to write a recursive function with initial condition in Haskell? In F# I can define like this: Looks quite convenient. Is there its...

[ -0.00604248046875, 0.009765625, 0.01708984375, 0.0045166015625, -0.00104522705078125, 0.0028228759765625, 0.013916015625, 0.01025390625, 0.031494140625, -0.0244140625, 0.029541015625, -0.007415771484375, 0.01031494140625, 0.012451171875, 0.02734375, 0.00347900390625, 0.0128173828125,...

[ 11249, 33022, 195625, 5844, 32354, 678, 61475, 35431, 20625, 142508, 47, 23, 80934, 1556, 1830, 1022, 425, 7, 563, 4904, 831, 61924, 1884, 60818, 32233, 142267, 6863, 42518 ]

[ 0.051666259765625, 0.1513671875, 0.21337890625, 0.14306640625, 0.166015625, 0.0841064453125, 0.171142578125, 0.228759765625, 0.1412353515625, 0.2197265625, 0.0203399658203125, 0.02862548828125, 0.087890625, 0.1363525390625, 0.0989990234375, 0.0196685791015625, 0.05902099609375, 0.0...

embed

26659648_c0

26659648

haskell

0

Title: How does this do block work? Problem title: How does this do block work? Tags: syntax, haskell Problem: How does this do block work? I just started learning haskell a few weeks ago and I saw this: moves = do f <- [(+), subtract] g <- [(+), subtract] (x, y) <- [(1, 2), (2, 1)] [f x *** g y] I haven't seen a do bl...

How does this do block work? How does this do block work? syntax haskell How How does this do block work? I just started learning haskell a few weeks ago and I saw this: I haven't seen a do block ending in a list before, it was part of a solution to the knights tour problem.. Can somebody explain how it works?

[ -0.002899169921875, 0.01300048828125, -0.000946044921875, 0.00714111328125, -0.0057373046875, 0.014404296875, -0.00958251953125, 0.002227783203125, 0.032470703125, -0.01385498046875, -0.00250244140625, -0.0135498046875, -0.008544921875, -0.0147705078125, -0.045166015625, -0.00830078125...

[ 11249, 14602, 903, 54, 46389, 4488, 6002, 86531, 1556, 142508, 26859, 52080, 24124, 38246, 51592, 10, 86658, 23, 5303, 8108, 29806, 54350, 7, 9742, 2967, 73342, 3642, 442, 43240 ]

[ 0.1322021484375, 0.1295166015625, 0.1630859375, 0.16796875, 0.27734375, 0.185791015625, 0.039398193359375, 0.11328125, 0.1328125, 0.2010498046875, 0.003082275390625, 0.063232421875, 0.03955078125, 0.002777099609375, 0.060577392578125, 0.0252838134765625, 0.1793212890625, 0.03347778...

embed

19238091_c0

19238091

haskell

0

Title: Union Function in Haskell Problem title: Union Function in Haskell Tags: union, haskell Problem: Union Function in Haskell I have been getting my hands around coding in Haskell, but couldn't grasp the idea of implementing union function. I have also found some function definition embedded inside the Haskell plat...

Union Function in Haskell Union Function in Haskell union haskell Union Haskell Union Function in Haskell I have been getting my hands around coding in Haskell, but couldn't grasp the idea of implementing union function. I have also found some function definition embedded inside the Haskell platform. but the problem is...

[ 0.0159912109375, 0.047119140625, 0.0137939453125, -0.005462646484375, 0.0028533935546875, 0.007720947265625, -0.0203857421875, -0.0035858154296875, -0.006927490234375, -0.0194091796875, 0.0022125244140625, -0.036376953125, 0.00347900390625, 0.0185546875, -0.00848388671875, 0.0168457031...

[ 32528, 28670, 10763, 23, 20625, 142508, 69941, 1556, 44540, 10932, 552, 6238, 69427, 18, 27689, 254, 6528, 29479, 32354, 80934, 55720, 69819, 46132, 13651, 2967, 3871, 22021, 28219, 3917, 3249, 4488, 4358 ]

[ 0.289306640625, 0.2110595703125, 0.097412109375, 0.07110595703125, 0.1243896484375, 0.2186279296875, 0.259765625, 0.1212158203125, 0.02557373046875, 0.016021728515625, 0.0858154296875, 0.0182037353515625, 0.031402587890625, 0.016754150390625, 0.05682373046875, 0.046661376953125, 0.05...

embed

21726509_c0

21726509

haskell

0

Title: Filter with two conditions Problem title: Filter with two conditions Tags: list, haskell, filter Problem: Filter with two conditions I have a list like this: [('a','b',13), ('c','b', 2), ('c','d',4)]. And I want to remove the element ('a', 'b', 13), but I can't do it like this: filter (\(a,b,w) -> a /= 'a' && b ...

Filter with two conditions Filter with two conditions list haskell filter Filter Filter with two conditions I have a list like this: [('a','b',13), ('c','b', 2), ('c','d',4)]. And I want to remove the element ('a', 'b', 13), but I can't do it like this: This also removes ('c', 'b', 2). I'm new to haskell and don't real...

[ 0.0194091796875, 0.015625, -0.0255126953125, 0.0162353515625, -0.004364013671875, 0.001739501953125, 0.0009613037109375, 0.00616455078125, 0.0203857421875, 0.0205078125, -0.0001659393310546875, 0.0036468505859375, 0.00159454345703125, 0.0118408203125, -0.0361328125, 0.01507568359375, ...

[ 128896, 678, 6626, 27289, 5303, 1556, 142508, 46312, 765, 10, 1884, 903, 11, 275, 63258, 238, 4958, 71, 29557, 3444, 47, 87388, 70, 12830, 702, 831, 18, 2843, 7, 216806 ]

[ 0.274658203125, 0.1221923828125, 0.2080078125, 0.249267578125, 0.176513671875, 0.1505126953125, 0.216796875, 0.192626953125, 0.031402587890625, 0.012359619140625, 0.05029296875, 0.043701171875, 0.0545654296875, 0.1090087890625, 0.1492919921875, 0.07769775390625, 0.10186767578125, 0...

embed

45514315_c1

45514315

haskell

1

what exactly happens. First: pure (\x y -> (x,y)) => P (\inp1 -> [(\x y -> (x,y), inp1)]) I have now a parser with one parameter. Then: P (\inp1 -> [(\x y -> (x,y), inp1)]) <*> item => P (\inp2 -> case parse (\inp1 -> [(\x y -> (x,y), inp1)]) inp2 of ??? I really don't understand what happens here. Can someone explain...

[ 0.0022735595703125, 0.0294189453125, 0.004547119140625, 0.00823974609375, -0.0003223419189453125, 0.038818359375, -0.00897216796875, -0.046875, 0.017822265625, -0.005157470703125, 0.015869140625, -0.004486083984375, -0.004302978515625, 0.0179443359375, -0.0142822265625, 0.0048828125, ...

[ 2367, 66161, 96276, 5, 23972, 34166, 425, 113, 33079, 53, 44357, 436, 73, 254, 418, 23, 17727, 16, 366, 2189, 1632, 171859, 1639, 35735, 304, 7225, 184, 111, 37336, 6183, 2301, 18, 28219, 3688, 4171, 22008, 73342, 29954, 5036, 24189, 35...

[ 0.0662841796875, 0.091552734375, 0.16796875, 0.0555419921875, 0.0313720703125, 0.259521484375, 0.0489501953125, 0.11962890625, 0.0794677734375, 0.0596923828125, 0.04412841796875, 0.1258544921875, 0.1053466796875, 0.151123046875, 0.06597900390625, 0.1361083984375, 0.0684814453125, 0...

embed

37088840_c1

37088840

haskell

1

phi' . (mv m) ) v sc2 :: Floating a => [a] -> [Matrix a] -> a sc2 v [m1, m2] = foldr (+) 0 $ (phi' . (mv m2) . phi' . (mv m1) ) v Code signals: Numeric.AD.Mode.Reverse, Data.Traversable, Data.Foldable, Automatic, Haskell, Numeric.AD, LANGUAGE, DeriveTraversable, DeriveFunctor, DeriveFoldable, Non-linear, x:xs, Matrix, ...

[ -0.025390625, 0.031494140625, 0.002471923828125, 0.00433349609375, 0.0257568359375, 0.0194091796875, -0.01251220703125, 0.0198974609375, 0.0286865234375, -0.021484375, -0.00173187255859375, 0.03125, 0.01397705078125, -0.02001953125, -0.037353515625, -0.00225830078125, -0.024780273437...

[ 44171, 25, 6, 5, 334, 347, 81, 9023, 304, 1984, 38699, 26518, 10, 44357, 11, 33079, 4613, 87427, 39, 418, 90173, 2203, 18344, 7569, 22183, 757, 3650, 19379, 10461, 17727, 28864, 26073, 7, 12, 93511, 1771, 12351, 9083, 4332, 37676, 11809...

[ 0.2296142578125, 0.168212890625, 0.0292816162109375, 0.0587158203125, 0.171875, 0.122802734375, 0.18310546875, 0.1265869140625, 0.1754150390625, 0.050048828125, 0.2061767578125, 0.177978515625, 0.1136474609375, 0.038299560546875, 0.05804443359375, 0.0357666015625, 0.035064697265625, ...

embed

40566508_c0

40566508

haskell

0

Title: How do you implement Haskell's IO type in Java? Problem title: How do you implement Haskell's IO type in Java? Tags: haskell, java Problem: How do you implement Haskell's IO type in Java? Code signals: java.util.function, java.util.ArrayList, How, Haskell, Java, World, Tuple, ArrayList, this.stdin, thi...

How do you implement Haskell's IO type in Java? How do you implement Haskell's IO type in Java? haskell java java.util.function java.util.ArrayList How Haskell Java World Tuple ArrayList this.stdin this.stdout this.fst this.snd this.transform io.transform.apply f.apply result.snd ioB.transform.apply result.fs...

[ 0.0027923583984375, -0.00543212890625, 0.02197265625, 0.0283203125, 0.009033203125, 0.00116729736328125, -0.0087890625, -0.0108642578125, -0.009033203125, 0.0169677734375, 0.0234375, -0.03173828125, -0.00933837890625, 0.00921630859375, -0.015869140625, -0.005096435546875, 0.005371093...

[ 11249, 54, 29479, 20625, 142508, 3768, 17780, 10644, 23, 41925, 1556, 79, 330, 5, 3675, 137175, 7092, 154663, 6661, 1371, 8705, 69253, 903, 271, 3035, 1003, 2208, 215175, 22995, 9007, 1238, 16750, 571, 24071, 29223, 134549, 5117, 81887, 979...

[ 0.08624267578125, 0.021270751953125, 0.2020263671875, 0.163330078125, 0.270751953125, 0.12548828125, 0.2183837890625, 0.2244873046875, 0.09735107421875, 0.259765625, 0.144287109375, 0.07623291015625, 0.1368408203125, 0.00689697265625, 0.088134765625, 0.0682373046875, 0.0526123046875,...

embed

27463253_c0

27463253

haskell

0

Title: validating haskell-platform compiled from source? Problem title: validating haskell-platform compiled from source? Tags: cabal, haskell-platform, haskell, ghc Problem: validating haskell-platform compiled from source? Is there a recommended way to validate Haskell Platform built from source? I do see a test targ...

validating haskell-platform compiled from source? validating haskell-platform compiled from source? cabal haskell-platform haskell ghc source Makefile platform.sh validating haskell-platform compiled from source? Is there a recommended way to validate Haskell Platform built from source? I do see a test target in the GH...

[ -0.0042724609375, 0.0198974609375, 0.020263671875, 0.0179443359375, 0.0012054443359375, 0.0036773681640625, -0.0223388671875, -0.02001953125, -0.0012359619140625, 0.0140380859375, 0.037109375, -0.01239013671875, 0.0240478515625, -0.00159454345703125, -0.01123046875, 0.01312255859375, ...

[ 44622, 1916, 1556, 142508, 172121, 375, 5974, 297, 1295, 31344, 32, 109524, 31380, 238, 26176, 29822, 13651, 1495, 170198, 3917, 47, 67, 20625, 70968, 88303, 1957, 3034, 30388, 527, 73265, 18, 48903, 40059, 5, 26499 ]

[ 0.2332763671875, 0.1038818359375, 0.1568603515625, 0.24609375, 0.23583984375, 0.039886474609375, 0.15380859375, 0.029510498046875, 0.1568603515625, 0.23046875, 0.013427734375, 0.1788330078125, 0.09686279296875, 0.0877685546875, 0.1156005859375, 0.2000732421875, 0.2236328125, 0.1293...

embed

66324364_c1

66324364

haskell

1

the files searched for. | 4 | import Graphics.Gloss | ^^^^^^^^^^^^^^^^^^^^^ I am unsure what the problem here is and how to solve it. Code signals: Graphics.Gloss, Adding, LICENSE, package.yaml, stack.yaml, README.md, stack.yaml.lock, Setup.hs, project39.cabal, TAGS, acme-missiles-0.3, github.com, stack.git, e7b331f14...

[ -0.01348876953125, -0.0027313232421875, -0.0027313232421875, 0.01708984375, -0.0306396484375, 0.0223388671875, 0.00225830078125, -0.01251220703125, 0.0057373046875, 0.01904296875, 0.00799560546875, -0.035400390625, 0.001708984375, 0.0145263671875, 0.005584716796875, 0.01416015625, -0...

[ 70, 102158, 33938, 297, 100, 5, 58745, 201, 24927, 189682, 7, 724, 2400, 6, 16377, 15729, 87, 444, 51646, 2967, 3688, 86869, 442, 28864, 26073, 12, 62, 59725, 107615, 207771, 98169, 14520, 141, 177261, 188300, 10611, 54686, 21135, 19943, ...

[ 0.04229736328125, 0.240478515625, 0.19873046875, 0.123291015625, 0.1490478515625, 0.043060302734375, 0.03314208984375, 0.1461181640625, 0.2130126953125, 0.2158203125, 0.1678466796875, 0.08856201171875, 0.2127685546875, 0.006805419921875, 0.000152587890625, 0.040435791015625, 0.006683...

embed

31481037_c0

31481037

haskell

0

Title: Numeric matrix tiles in Haskell Problem title: Numeric matrix tiles in Haskell Tags: haskell Problem: Numeric matrix tiles in Haskell Having a numeric matrix, how can tiles be extracted from it using Haskell? Example: Int -> Int -> Int -> Int -> [Int] -> Int -> Int -> [Int] getTile height width x y xs matrix_hei...

Numeric matrix tiles in Haskell Numeric matrix tiles in Haskell haskell Numeric Haskell matrix_height matrix_width Numeric matrix tiles in Haskell Having a numeric matrix, how can tiles be extracted from it using Haskell? Example:

[ 0.008544921875, -0.0017852783203125, 0.012451171875, -0.0098876953125, 0.0113525390625, 0.007537841796875, -0.0322265625, -0.0057373046875, 0.00628662109375, 0.00823974609375, -0.007354736328125, -0.01385498046875, -0.0244140625, -0.00860595703125, -0.01708984375, -0.00799560546875, ...

[ 93511, 1771, 50944, 425, 139, 90, 23, 20625, 142508, 1556, 1106, 22553, 146984, 171855, 54744, 238, 3642, 831, 125663, 297, 1295, 442, 17368, 89536 ]

[ 0.14794921875, 0.02435302734375, 0.1925048828125, 0.09716796875, 0.19091796875, 0.08966064453125, 0.03680419921875, 0.1279296875, 0.232421875, 0.113525390625, 0.08416748046875, 0.0732421875, 0.14208984375, 0.00618743896484375, 0.1832275390625, 0.032958984375, 0.051544189453125, 0.0...

embed

32223008_c0

32223008

haskell

0

Title: What's the difference between Const and Constant? Problem title: What's the difference between Const and Constant? Tags: haskell Problem: What's the difference between Const and Constant? There seems to be two implementations of the constant functor: Const in Control.Applicative Constant in Data.Functo...

What's the difference between Const and Constant? What's the difference between Const and Constant? haskell What Constant Control.Applicative Data.Functor.Constant What's the difference between Const and Constant? There seems to be two implementations of the constant functor: Const in Control.Applicative Cons...

[ 0.019287109375, 0.0048828125, -0.00167083740234375, 0.0028839111328125, 0.034912109375, 0.0069580078125, -0.01019287109375, -0.01287841796875, 0.001068115234375, -0.002838134765625, -0.00159454345703125, -0.0281982421875, 0.0194091796875, 0.0439453125, -0.01708984375, 0.03125, 0.0117...

[ 4865, 3768, 70, 60212, 17721, 1657, 271, 136, 148416, 1556, 142508, 27131, 39179, 11048, 11809, 97249, 18770, 11935, 42539, 37202, 6626, 208124, 53697, 7477, 23, 5, 4935, 44084, 15044, 2856, 32316, 5608, 4527 ]

[ 0.033477783203125, 0.072509765625, 0.069580078125, 0.1993408203125, 0.1229248046875, 0.2000732421875, 0.2476806640625, 0.1209716796875, 0.291015625, 0.1329345703125, 0.2322998046875, 0.2060546875, 0.068359375, 0.1197509765625, 0.1126708984375, 0.09393310546875, 0.1658935546875, 0.1...

embed

13575041_c0

13575041

haskell

0

Title: is the Y-Combinator a monad? Problem title: is the Y-Combinator a monad? Tags: functional-programming, haskell, lisp Problem: is the Y-Combinator a monad? I'm trying to understand the similarities between abstracting functions using the y-combinator and the continuation monad. Intuitively, it feels to me like th...

is the Y-Combinator a monad? is the Y-Combinator a monad? functional-programming haskell lisp Y-Combinator is the Y-Combinator a monad? I'm trying to understand the similarities between abstracting functions using the y-combinator and the continuation monad. Intuitively, it feels to me like they have things in common, ...

[ -0.0027008056640625, 0.00177764892578125, 0.0225830078125, 0.0230712890625, 0.026611328125, 0.004669189453125, -0.0020599365234375, -0.015380859375, -0.0257568359375, -0.022705078125, -0.00665283203125, -0.0126953125, -0.01025390625, -0.036376953125, -0.004974365234375, -0.005645751953...

[ 83, 70, 990, 9, 10770, 19155, 1290, 10, 2667, 712, 32, 123309, 28966, 1556, 142508, 400, 7008, 28219, 21373, 31075, 164789, 214, 32354, 17368, 113, 277, 9454, 1363, 18425, 12319, 1884, 39210, 217064, 35166, 4358 ]

[ 0.0869140625, 0.03759765625, 0.2398681640625, 0.07196044921875, 0.120361328125, 0.2403564453125, 0.181884765625, 0.0958251953125, 0.1536865234375, 0.213134765625, 0.009918212890625, 0.1190185546875, 0.08221435546875, 0.08062744140625, 0.1790771484375, 0.0712890625, 0.1365966796875, ...

embed

35257487_c0

35257487

haskell

0

Title: Haskell IDE Leskah cannot install Problem title: Haskell IDE Leskah cannot install Tags: haskell, leksah Problem: Haskell IDE Leskah cannot install Code signals: Haskell, IDE, Leskah, libgtksourceview-3.0-dev, libwebkitgtk-3.0-dev, Cabal, XFlexibleContexts, gtk2hs-buildtools, Installing, Installed, gtk2hs-buildt...

Haskell IDE Leskah cannot install Haskell IDE Leskah cannot install haskell leksah Haskell IDE Leskah libgtksourceview-3.0-dev libwebkitgtk-3.0-dev Cabal XFlexibleContexts gtk2hs-buildtools Installing Installed gtk2hs-buildtools-0.13.0.5 Resolving Could leksah-0.15.1.4 hlint-1.9.28 haskell-src-exts-1.17.1 haskell-src-e...

[ 0.00469970703125, 0.0250244140625, 0.0037689208984375, -0.00921630859375, -0.00445556640625, 0.00390625, -0.005828857421875, -0.0174560546875, -0.0002231597900390625, 0.02978515625, 0.013916015625, -0.044677734375, 0.006683349609375, 0.0040283203125, 0.00811767578125, 0.0103759765625, ...

[ 20625, 142508, 36497, 1734, 6577, 53418, 20600, 1556, 17143, 23474, 25474, 5386, 92, 60427, 22751, 132265, 18548, 9488, 30438, 289, 1193, 74070, 28236, 22829, 31472, 304, 127, 177149, 89110, 107951, 93645, 132944, 191147, 1837, 91977, 75084, 42...

[ 0.1309814453125, 0.2408447265625, 0.2286376953125, 0.1685791015625, 0.248779296875, 0.1474609375, 0.209716796875, 0.1314697265625, 0.13232421875, 0.2318115234375, 0.053497314453125, 0.0672607421875, 0.0233306884765625, 0.06597900390625, 0.1907958984375, 0.13037109375, 0.099853515625,...

embed

15529785_c0

15529785

haskell

0

Title: How to generate Intel assembler syntax from ghc of haskell? Problem title: How to generate Intel assembler syntax from ghc of haskell? Tags: assembly, ghc, haskell Problem: How to generate Intel assembler syntax from ghc of haskell? I know there is a -S flag in ghc in haskell, and it generates a .s file which is...

How to generate Intel assembler syntax from ghc of haskell? How to generate Intel assembler syntax from ghc of haskell? assembly ghc haskell ghc How Intel How to generate Intel assembler syntax from ghc of haskell? I know there is a -S flag in ghc in haskell, and it generates a .s file which is an assembling file. I am...

[ -0.0086669921875, -0.0096435546875, -0.00494384765625, 0.0079345703125, -0.0230712890625, -0.0023040771484375, -0.031982421875, -0.006866455078125, -0.0191650390625, -0.018798828125, -0.002532958984375, -0.0145263671875, -0.0040283203125, -0.01904296875, 0.0032958984375, -0.00637817382...

[ 11249, 47, 139392, 24018, 93457, 42, 6002, 86531, 1295, 31380, 238, 111, 1556, 142508, 89845, 38526, 3714, 2685, 20, 294, 49938, 23, 5, 7, 11435, 10, 79298, 527, 73265, 7722, 678 ]

[ 0.08642578125, 0.06036376953125, 0.216064453125, 0.2127685546875, 0.236328125, 0.142333984375, 0.1568603515625, 0.198486328125, 0.0953369140625, 0.117431640625, 0.12158203125, 0.071044921875, 0.1256103515625, 0.219482421875, 0.178955078125, 0.0263214111328125, 0.01385498046875, 0.0...

embed

25427590_c0

25427590

haskell

0

Title: Why "and []" is True and "or []" is False Problem title: Why "and []" is True and "or []" is False Tags: monoids, haskell Problem: Why "and []" is True and "or []" is False Why "and" on an empty list returns true, does it imply that an empty list holds True? Sorry but I ca...

Why "and []" is True and "or []" is False Why "and []" is True and "or []" is False monoids haskell Why Prelude Why "and []" is True and "or []" is False Why "and" on an empty list returns true, does it imply that an empty list holds True? Sorry but I cannot read and comprehend t...

[ 0.013671875, -0.0030670166015625, -0.000377655029296875, 0.01324462890625, -0.01025390625, 0.0225830078125, 0.00958251953125, -0.0128173828125, 0.00131988525390625, 0.013916015625, -0.00238037109375, -0.024658203125, -0.01336669921875, 0.00885009765625, -0.0101318359375, -0.01721191406...

[ 44084, 41502, 2940, 378, 268, 83, 87599, 136, 748, 74, 22225, 184, 22460, 30185, 1556, 142508, 1914, 822, 112, 44, 98, 201505, 5303, 30646, 7, 29568, 14602, 442, 21980, 16401, 90502, 53418, 12301, 232460, 26785 ]

[ 0.1749267578125, 0.1187744140625, 0.2445068359375, 0.0352783203125, 0.0594482421875, 0.0726318359375, 0.195068359375, 0.1268310546875, 0.1995849609375, 0.000244140625, 0.1448974609375, 0.1219482421875, 0.133056640625, 0.139892578125, 0.108154296875, 0.2095947265625, 0.0794677734375, ...

embed

40710801_c1

40710801

haskell

1

foo = bar (Proxy :: Proxy t) bar :: forall t1 . () => Proxy t1 -> NS (NP I) (Code t1) -> DSum (GTag t1) (NP I) bar _ (Z x) = GTag (Z Refl) :=> x bar _ (S x) = undefined Code signals: Data.Dependent.Sum, Data.GADT.Compare, Data.Proxy, Generics.SOP, qualified, where, How, Tag-shaped, DSum, LANGUAGE, GADTs, DataKinds, Ty...

[ 0.0084228515625, 0.0145263671875, -0.00048065185546875, -0.017822265625, 0.01263427734375, 0.004425048828125, -0.00982666015625, 0.00860595703125, 0.000453948974609375, -0.0247802734375, 0.0004138946533203125, 0.00170135498046875, -0.0101318359375, -0.001129150390625, -0.0162353515625, ...

[ 5775, 31, 2203, 1909, 10752, 50878, 1984, 1250, 808, 100, 5584, 418, 52700, 28814, 87, 114211, 17727, 41869, 316, 724, 66448, 1511, 1022, 527, 53295, 141, 9232, 5983, 297, 28864, 26073, 11809, 26885, 294, 5, 14849, 41072, 108161, 1046, 88...

[ 0.203369140625, 0.1978759765625, 0.07110595703125, 0.199951171875, 0.1605224609375, 0.254150390625, 0.027313232421875, 0.1688232421875, 0.109130859375, 0.04888916015625, 0.160400390625, 0.035552978515625, 0.120361328125, 0.105224609375, 0.08294677734375, 0.1771240234375, 0.0480346679...

embed

19725292_c0

19725292

haskell

0

Title: How to reverse an integer in haskell? Problem title: How to reverse an integer in haskell? Tags: haskell, int, integer Problem: How to reverse an integer in haskell? I need help on how to reverse a Integer in Haskell with the following type signature: reverseInt :: Integer -> Integer reverseInt a = undefined -- ...

How to reverse an integer in haskell? How to reverse an integer in haskell? haskell int integer How Integer How to reverse an integer in haskell? I need help on how to reverse a Integer in Haskell with the following type signature: I need the Integer input number to be reversed like the example below. Example:

[ -0.046875, 0.019287109375, 0.0186767578125, 0.0264892578125, -0.008544921875, 0.02587890625, 0.01409912109375, -0.0037384033203125, -0.0025177001953125, -0.0203857421875, 0.00110626220703125, 0.007080078125, -0.00732421875, 0.0279541015625, 0.01171875, -0.00101470947265625, 0.0043334...

[ 11249, 47, 39531, 184, 142, 892, 1505, 23, 1556, 142508, 32, 18, 44401, 3871, 4358, 3642, 10, 20625, 678, 25632, 10644, 138256, 107730, 14012, 186, 5281, 1884, 27781, 35064, 89536 ]

[ 0.093994140625, 0.10540771484375, 0.2225341796875, 0.16162109375, 0.0548095703125, 0.15673828125, 0.173095703125, 0.09320068359375, 0.1627197265625, 0.2333984375, 0.0079345703125, 0.089111328125, 0.1966552734375, 0.06793212890625, 0.048583984375, 0.047821044921875, 0.0221710205078125...

embed

7213676_c0

7213676

haskell

0

Title: forall in Scala Problem title: forall in Scala Tags: scala, haskell, forall Problem: forall in Scala As shown below, in Haskell, it's possible to store in a list values with heterogeneous types with certain context bounds on them: data ShowBox = forall s. Show s => ShowBox s heteroList :: [ShowBox] heteroList = ...

forall in Scala forall in Scala scala haskell forall Scala ShowBox Show forall in Scala As shown below, in Haskell, it's possible to store in a list values with heterogeneous types with certain context bounds on them: How can I achieve the same in Scala, preferably without subtyping?

[ 0.0286865234375, 0.0050048828125, -0.006805419921875, -0.00848388671875, -0.00897216796875, -0.0262451171875, 0.00958251953125, -0.00063323974609375, 0.0142822265625, -0.0028839111328125, -0.009033203125, -0.03857421875, 0.00933837890625, -0.00102996826171875, -0.00177001953125, -0.012...

[ 100, 5584, 23, 152653, 11, 146232, 1556, 142508, 17367, 72295, 127887, 35064, 20625, 7722, 4343, 5303, 142424, 678, 77099, 15292, 52895, 24233, 43701, 99091, 69307, 5701, 15490, 1614, 46280 ]

[ 0.1351318359375, 0.2222900390625, 0.07171630859375, 0.2105712890625, 0.1650390625, 0.1947021484375, 0.11529541015625, 0.237060546875, 0.1273193359375, 0.1727294921875, 0.0005488395690917969, 0.0230712890625, 0.11920166015625, 0.09088134765625, 0.166259765625, 0.1705322265625, 0.17517...

embed

47817114_c0

47817114

haskell

0

Title: Non type-variable argument for MonadWriter Problem title: Non type-variable argument for MonadWriter Tags: haskell, monads Problem: Non type-variable argument for MonadWriter I just tried to use writer : writer (5, "Hello, World") But I noticed I get an error: Non type-variable argument in the constraint MonadWr...

Non type-variable argument for MonadWriter Non type-variable argument for MonadWriter haskell monads Non MonadWriter Hello World Char Non type-variable argument for MonadWriter I just tried to use writer : But I noticed I get an error: But I wonder what constraint I don't fulfill? [a] after all is a Monoid...

[ -0.030029296875, 0.0194091796875, 0.0079345703125, 0.0198974609375, 0.0233154296875, -0.00147247314453125, -0.00823974609375, -0.02099609375, -0.0235595703125, -0.00531005859375, -0.00958251953125, -0.0225830078125, 0.01068115234375, -0.000797271728515625, 0.006317138671875, -0.0180664...

[ 3775, 10644, 21690, 2886, 10750, 60331, 71, 1456, 2783, 56, 1556, 142508, 2667, 712, 35378, 6661, 21656, 37842, 4527, 70035, 156672, 18499, 32195, 158, 2816, 4288, 2301, 18, 211394, 11, 7103, 756, 83, 77879, 532 ]

[ 0.1865234375, 0.2154541015625, 0.172607421875, 0.057403564453125, 0.2352294921875, 0.16455078125, 0.09375, 0.119140625, 0.2003173828125, 0.128173828125, 0.1025390625, 0.208740234375, 0.108154296875, 0.1292724609375, 0.1285400390625, 0.1109619140625, 0.11962890625, 0.07135009765625,...

embed

7961604_c0

7961604

haskell

0

Title: Fixing issues noted by ghc-pkg check Problem title: Fixing issues noted by ghc-pkg check Tags: haskell, dependencies, ghc Problem: Fixing issues noted by ghc-pkg check It's rather nice that ghc-pkg check will list broken packages, and why they are broken. But as far as I know, there is no automated way to take c...

Fixing issues noted by ghc-pkg check Fixing issues noted by ghc-pkg check haskell dependencies ghc Fixing Fixing issues noted by ghc-pkg check It's rather nice that ghc-pkg check will list broken packages, and why they are broken. But as far as I know, there is no automated way to take care of those broken packages. Wh...

[ -0.00921630859375, -0.01141357421875, 0.01422119140625, 0.01141357421875, -0.0174560546875, 0.0184326171875, -0.027587890625, -0.007049560546875, 0.005645751953125, 0.0238037109375, 0.00885009765625, -0.01373291015625, 0.00238037109375, 0.025390625, 0.0111083984375, 0.008544921875, 0...

[ 96746, 214, 37348, 959, 31380, 238, 8517, 12765, 1556, 142508, 42548, 254, 43257, 26267, 1221, 5303, 148431, 98169, 15400, 621, 110, 11408, 3917, 5646, 517, 111, 8382, 70, 170198, 47, 35142, 678, 7, 2875, 80383, 527, 73265 ]

[ 0.161865234375, 0.014068603515625, 0.1224365234375, 0.0706787109375, 0.1309814453125, 0.148193359375, 0.1868896484375, 0.183349609375, 0.08984375, 0.1617431640625, 0.1453857421875, 0.0193023681640625, 0.03955078125, 0.057586669921875, 0.002777099609375, 0.09814453125, 0.1710205078125...

embed

8554756_c0

8554756

haskell

0

Title: Sum over Haskell Map Problem title: Sum over Haskell Map Tags: dictionary, haskell Problem: Sum over Haskell Map Is there a standard function to sum all values in a Haskell map. My Map reads something like [(a,2),(b,4),(c,6)]? Essentially what I am trying to do is a normalized frequency distribution. So the valu...

Sum over Haskell Map Sum over Haskell Map dictionary haskell Sum Haskell Map Sum over Haskell Map Is there a standard function to sum all values in a Haskell map. My Map reads something like [(a,2),(b,4),(c,6)]? Essentially what I am trying to do is a normalized frequency distribution. So the values of the keys in the ...

[ 0.00445556640625, 0.000640869140625, -0.0035400390625, -0.0208740234375, -0.01544189453125, -0.00482177734375, -0.01080322265625, 0.0034332275390625, 0.0026397705078125, -0.017333984375, 0.002105712890625, -0.003326416015625, 0.0306396484375, -0.004913330078125, 0.0002994537353515625, ...

[ 36335, 645, 20625, 142508, 42719, 45, 10763, 1556, 2071, 2685, 10, 5570, 32354, 47, 10554, 756, 142424, 23, 22288, 12301, 1884, 10461, 275, 29557, 238, 59690, 179769, 31577, 3638, 29367, 12478, 944, 113068, 22799, 36917, 54529, 100, 3871, 2...

[ 0.249267578125, 0.1746826171875, 0.1519775390625, 0.25341796875, 0.2127685546875, 0.00921630859375, 0.08001708984375, 0.1298828125, 0.0133056640625, 0.04510498046875, 0.05438232421875, 0.1925048828125, 0.187744140625, 0.10498046875, 0.2607421875, 0.155517578125, 0.22607421875, 0.08...

embed

54539981_c0

54539981

haskell

0

Title: Pattern matching on the last element of a List Problem title: Pattern matching on the last element of a List Tags: haskell, pattern-matching Problem: Pattern matching on the last element of a List we use (x:xs) to pattern match on the first element as in this example : head' :: [a] -> a head' xs = case xs of [] ...

Pattern matching on the last element of a List Pattern matching on the last element of a List haskell pattern-matching Pattern List x:xs x:_ Pattern matching on the last element of a List we use (x:xs) to pattern match on the first element as in this example : is there a way to pattern match on the last element ?

[ -0.005279541015625, 0.033203125, -0.001983642578125, -0.0213623046875, -0.0140380859375, 0.01220703125, -0.00799560546875, 0.005859375, 0.017822265625, 0.006256103515625, 0.029296875, -0.03466796875, 0.02197265625, -0.00067901611328125, -0.00494384765625, -0.0084228515625, 0.01647949...

[ 9876, 22766, 14858, 214, 98, 4568, 12830, 111, 32036, 1556, 142508, 103510, 98753, 1022, 12, 425, 7, 454, 4527, 5117, 23, 27781, 83, 2685, 3917, 47 ]

[ 0.1575927734375, 0.140380859375, 0.218017578125, 0.077880859375, 0.082763671875, 0.2098388671875, 0.143798828125, 0.0001220703125, 0.1724853515625, 0.1092529296875, 0.1910400390625, 0.221923828125, 0.21044921875, 0.045928955078125, 0.06256103515625, 0.08819580078125, 0.07366943359375...

embed

62794803_c1

62794803

haskell

1

able s, Mergeable w, Mergeable a, forall a. Mergeable a => Mergeable (m a)) => Mergeable (RWST r w s m a) where symbolicMerge force cond thn els = Lazy.RWST $ symbolicMerge force cond (runRWST thn) (runRWST els) So stripping away all the newtype s, I'd like to branch into something of type r -> s -> (a, s, w) s.t. Merg...

[ -0.01251220703125, 0.00787353515625, 0.00579833984375, -0.007110595703125, -0.00787353515625, 0.0098876953125, -0.010986328125, 0.0079345703125, 0.0107421875, 0.020263671875, -0.01287841796875, 0.03955078125, 0.0001544952392578125, 0.0054931640625, 0.000614166259765625, 0.0089721679687...

[ 19048, 91, 6035, 429, 2886, 148, 10, 100, 5584, 44357, 39, 78691, 8545, 1690, 347, 16, 128201, 30248, 37772, 158, 71, 1115, 239, 3285, 3650, 16428, 19, 43613, 3525, 50986, 1884, 32845, 206, 3934, 9844, 10644, 11, 18, 136, 28864, 26073, ...

[ 0.234619140625, 0.1654052734375, 0.194091796875, 0.176513671875, 0.2242431640625, 0.182861328125, 0.167236328125, 0.07269287109375, 0.146484375, 0.004730224609375, 0.064697265625, 0.09442138671875, 0.14794921875, 0.1619873046875, 0.01220703125, 0.005157470703125, 0.1842041015625, 0...

embed

51181957_c0

51181957

haskell

0

Title: which one is the correct way of converting String to ByteString? Problem title: which one is the correct way of converting String to ByteString? Tags: haskell, string Problem: which one is the correct way of converting String to ByteString? I found the following two functions that convert String to ByteString , ...

which one is the correct way of converting String to ByteString? which one is the correct way of converting String to ByteString? haskell string ByteString which one is the correct way of converting String to ByteString? I found the following two functions that convert String to ByteString , which one is the correct wa...

[ 0.01361083984375, 0.00994873046875, -0.002838134765625, 0.00408935546875, -0.021484375, 0.00531005859375, -0.0062255859375, -0.00113677978515625, 0.0021209716796875, 0.016845703125, 0.0159912109375, -0.0247802734375, 0.01275634765625, 0.03173828125, -0.0224609375, 0.003631591796875, ...

[ 3129, 1632, 83, 26785, 3917, 96760, 214, 23351, 47, 3311, 67, 71713, 32, 111, 1556, 142508, 79315, 70, 25632, 6626, 32354, 450, 60212, 11809, 75358, 84068, 1019, 29102, 919, 161063 ]

[ 0.05560302734375, 0.071044921875, 0.045684814453125, 0.1656494140625, 0.091064453125, 0.1763916015625, 0.1729736328125, 0.2127685546875, 0.125732421875, 0.132080078125, 0.183837890625, 0.2254638671875, 0.011474609375, 0.000396728515625, 0.134033203125, 0.2420654296875, 0.216674804687...

embed

28645159_c0

28645159

haskell

0

Title: Why Sum and Product aren't Functors Problem title: Why Sum and Product aren't Functors Tags: haskell, typeclass Problem: Why Sum and Product aren't Functors Sum defined in base 4.7.0.2 doesn't have Functor instance. Why? For example types defined in semigroups package have Functor , Applicative and Mon...

Why Sum and Product aren't Functors Why Sum and Product aren't Functors haskell typeclass Why Sum Product Functors Functor Applicative Monad Min Why Sum and Product aren't Functors Sum defined in base 4.7.0.2 doesn't have Functor instance. Why? For example types defined in semigroups package have Functor , Ap...

[ -0.0018463134765625, 0.017333984375, 0.0152587890625, 0.012939453125, -0.01239013671875, 0.0166015625, -0.0069580078125, -0.0142822265625, 0.01171875, 0.030029296875, -0.01336669921875, 0.0025634765625, 0.0011138916015625, 0.003753662109375, -0.00165557861328125, 0.016357421875, -0.0...

[ 44084, 36335, 136, 73111, 125381, 3768, 18, 28670, 18770, 1556, 142508, 10644, 67413, 5659, 11048, 4935, 60331, 71, 4211, 61924, 3647, 201, 53489, 133684, 22027, 765, 110527, 52895, 36137, 51588, 98169, 98, 68991, 1884, 37379, 2481, 10422 ]

[ 0.108642578125, 0.258544921875, 0.1187744140625, 0.2861328125, 0.0880126953125, 0.0455322265625, 0.1143798828125, 0.212646484375, 0.220947265625, 0.12890625, 0.22021484375, 0.1273193359375, 0.1505126953125, 0.0714111328125, 0.124755859375, 0.06524658203125, 0.1463623046875, 0.07202...

embed

11711996_c0

11711996

haskell

0

Title: randomly choosing and filling datatype Problem title: randomly choosing and filling datatype Tags: haskell Problem: randomly choosing and filling datatype So I have two data types. For simplicity say one holds an Int and one holds a String . So let's say I have data ranData = randInt Int | randString String How ...

randomly choosing and filling datatype randomly choosing and filling datatype haskell randomly choosing and filling datatype So I have two data types. For simplicity say one holds an Int and one holds a String . So let's say I have How can I make a function that will either choose one of these and then give it a random...

[ -0.0004596710205078125, -0.00762939453125, 0.0030364990234375, 0.0003070831298828125, -0.0125732421875, 0.0196533203125, -0.01373291015625, -0.0029449462890625, 0.00110626220703125, -0.03369140625, 0.0245361328125, -0.013916015625, 0.0015869140625, -0.0014801025390625, -0.00537109375, ...

[ 96759, 538, 218873, 136, 26292, 214, 2053, 50986, 1556, 142508, 765, 6626, 52895, 134381, 1632, 16401, 360, 18, 23351, 11249, 831, 3249, 32354, 1221, 40101, 55076, 111, 6097, 8337, 10, 34292, 25647, 43257, 71216, 5 ]

[ 0.21533203125, 0.044769287109375, 0.1668701171875, 0.09002685546875, 0.1602783203125, 0.05279541015625, 0.14013671875, 0.26123046875, 0.1302490234375, 0.212890625, 0.044219970703125, 0.1055908203125, 0.2359619140625, 0.09423828125, 0.07330322265625, 0.1097412109375, 0.051361083984375...

embed

13670055_c0

13670055

haskell

0

Title: Instance show with Tree data structure Problem title: Instance show with Tree data structure Tags: haskell Problem: Instance show with Tree data structure I am new at haskell and I want to instance Tree a with the class show. data Tree a = Null |Node (Tree a) a (Tree a) instance Show (Tree a) where show Null = "...

Instance show with Tree data structure Instance show with Tree data structure haskell Instance Tree Node Show Instance show with Tree data structure I am new at haskell and I want to instance Tree a with the class show. Thanks for your help.

[ 0.00628662109375, -0.001739501953125, 0.01544189453125, 0.02197265625, 0.0035400390625, 0.0191650390625, -0.00543212890625, -0.0203857421875, 0.001678466796875, 0.01055908203125, -0.01336669921875, -0.0311279296875, 0.0155029296875, 0.0133056640625, 0.00151824951171875, -0.010803222656...

[ 360, 116071, 7639, 678, 101344, 2053, 45646, 1556, 142508, 438, 112, 17367, 3525, 3444, 47, 110527, 10, 18507, 4358 ]

[ 0.01419830322265625, 0.1763916015625, 0.1744384765625, 0.09356689453125, 0.287353515625, 0.085205078125, 0.1773681640625, 0.1397705078125, 0.183349609375, 0.09930419921875, 0.142822265625, 0.15234375, 0.051727294921875, 0.05047607421875, 0.00582122802734375, 0.2081298828125, 0.078247...

embed

36605036_c0

36605036

haskell

0

Title: cabal build gives parse error, but code works fine in GHCi Problem title: cabal build gives parse error, but code works fine in GHCi Tags: cabal, haskell Problem: cabal build gives parse error, but code works fine in GHCi My code works in GHCi, but when I try to build the project with cabal build , it gives the ...

cabal build gives parse error, but code works fine in GHCi cabal build gives parse error, but code works fine in GHCi cabal haskell GHCi cabal build gives parse error, but code works fine in GHCi My code works in GHCi, but when I try to build the project with cabal build , it gives the error parse error on input ‘<-’ H...

[ 0.00555419921875, 0.006439208984375, -0.01043701171875, 0.012451171875, -0.007110595703125, 0.021728515625, -0.0050048828125, -0.0003070831298828125, -0.00787353515625, -0.0146484375, -0.0019989013671875, -0.03466796875, 0.006256103515625, -0.00897216796875, 0.0205078125, -0.0250244140...

[ 109524, 45367, 76199, 366, 184, 18499, 1284, 18151, 43240, 5885, 23, 527, 73265, 14, 1556, 142508, 9790, 13452, 678, 107730, 16093, 9, 20187, 27781 ]

[ 0.25341796875, 0.232177734375, 0.07861328125, 0.1510009765625, 0.1683349609375, 0.20849609375, 0.07171630859375, 0.1959228515625, 0.08538818359375, 0.11328125, 0.042388916015625, 0.084716796875, 0.1126708984375, 0.1915283203125, 0.0867919921875, 0.1827392578125, 0.043914794921875, ...

embed

24103475_c1

24103475

haskell

1

depends on wxc-0.90.1.1 which failed to install Before this I did and they installed without errors: apt-get install libwxgtk2.8-dev apt-get install libglu-dev apt-get install g++ I also ran $ cabal update How do I fix this? Code signals: this, Unable, Resolving, Compiling, Main, wxc-0.90.1.1-30692, wxc-0.90.1.1, Setu...

[ -0.00927734375, 0.01806640625, -0.004974365234375, -0.0024261474609375, -0.02392578125, -0.00848388671875, -0.00946044921875, -0.002716064453125, -0.0125732421875, 0.02685546875, -0.004730224609375, -0.05126953125, -0.009521484375, -0.01416015625, -0.0033721923828125, 0.011474609375, ...

[ 56566, 7, 148, 425, 238, 23320, 5039, 83783, 165523, 47, 20600, 15490, 18499, 1747, 18, 3794, 25474, 434, 5386, 92, 82295, 18548, 39529, 706, 37223, 13028, 3650, 109524, 28350, 54, 87, 30022, 903, 28864, 26073, 992, 2886, 132944, 214, 156...

[ 0.188720703125, 0.045989990234375, 0.12255859375, 0.159423828125, 0.1536865234375, 0.03851318359375, 0.254150390625, 0.1268310546875, 0.2083740234375, 0.00115966796875, 0.1617431640625, 0.06500244140625, 0.135498046875, 0.0689697265625, 0.00103759765625, 0.056060791015625, 0.10424804...

embed

29284764_c0

29284764

haskell

0

Title: Haskell, Given two ints and return a list Problem title: Haskell, Given two ints and return a list Tags: recursion, haskell Problem: Haskell, Given two ints and return a list I have a function but I don't really know how to use recursion to implement it.. Could anyone give me some hint? getList :: Int -> Int -> ...

Haskell, Given two ints and return a list Haskell, Given two ints and return a list recursion haskell Haskell Given Haskell, Given two ints and return a list I have a function but I don't really know how to use recursion to implement it.. Could anyone give me some hint? And it has the following performance

[ -0.014892578125, 0.002471923828125, -0.01611328125, 0.0159912109375, 0.00439453125, 0.0211181640625, -0.0201416015625, 0.00872802734375, 0.006744384765625, -0.007598876953125, 0.0126953125, -0.01312255859375, -0.006439208984375, 0.0267333984375, 0.00128173828125, -0.007354736328125, ...

[ 20625, 142508, 77878, 6626, 23, 933, 136, 30646, 5303, 19, 195625, 1830, 1556, 765, 32354, 2301, 18, 6183, 3714, 3642, 4527, 29479, 8337, 5122, 25632, 23718 ]

[ 0.1412353515625, 0.2509765625, 0.137451171875, 0.1846923828125, 0.145263671875, 0.1627197265625, 0.05120849609375, 0.1790771484375, 0.1798095703125, 0.045013427734375, 0.2197265625, 0.1397705078125, 0.1328125, 0.025390625, 0.174560546875, 0.0233306884765625, 0.033935546875, 0.00634...

embed

47704945_c0

47704945

haskell

0

Title: Haskell Lambda Alpha Equivalence Problem title: Haskell Lambda Alpha Equivalence Tags: lambda-calculus, haskell Problem: Haskell Lambda Alpha Equivalence I am trying to write down an alpha equivalence function in Haskell for lambda. data Expr = App Expr Expr | Lam Int Expr | Var Int deriving (Show,Eq) I've read ...

Haskell Lambda Alpha Equivalence Haskell Lambda Alpha Equivalence lambda-calculus haskell Haskell Lambda Alpha Equivalence Expr App Lam Show Haskell Lambda Alpha Equivalence I am trying to write down an alpha equivalence function in Haskell for lambda. data Expr = App Expr Expr | Lam Int Expr | Var Int deriving (Show,E...

[ 0.00384521484375, 0.021728515625, 0.017578125, 0.0181884765625, 0.00732421875, -0.005584716796875, 0.0079345703125, 0.00830078125, -0.004364013671875, -0.0028839111328125, -0.0003070831298828125, -0.029052734375, 0.0213623046875, 0.012939453125, 0.01190185546875, -0.020751953125, -0....

[ 20625, 142508, 122930, 85, 76569, 145666, 1405, 6620, 21, 6492, 6827, 94739, 1556, 60075, 42, 5659, 59387, 17367, 31577, 33022, 7565, 144, 14612, 224743, 3956, 32354, 2053, 360, 18, 6, 3323, 16406, 6496, 168660, 647, 864, 12301, 1118, 65514...

[ 0.13671875, 0.2568359375, 0.18798828125, 0.1456298828125, 0.253173828125, 0.1202392578125, 0.1649169921875, 0.053619384765625, 0.0516357421875, 0.1923828125, 0.09130859375, 0.1644287109375, 0.1192626953125, 0.156494140625, 0.192626953125, 0.20458984375, 0.1885986328125, 0.160034179...

embed

54496068_c0

54496068

haskell

0

Title: why do i get a Parse input error in haskell Problem title: why do i get a Parse input error in haskell Tags: haskell Problem: why do i get a Parse input error in haskell I get a parse input error and 'e'. Why is this? Fixed my indentations too if not(true) then do g Node value e else return() where f = false g =...

why do i get a Parse input error in haskell why do i get a Parse input error in haskell haskell Parse Node Map.delete Map.insert Nothing why do i get a Parse input error in haskell I get a parse input error and 'e'. Why is this? Fixed my indentations too

[ -0.0167236328125, 0.006011962890625, -0.0115966796875, 0.006561279296875, -0.002349853515625, 0.0255126953125, -0.01171875, -0.0203857421875, 0.006103515625, -0.006378173828125, -0.00469970703125, -0.0091552734375, 0.003082275390625, 0.00616455078125, 0.016357421875, -0.002487182617187...

[ 15400, 54, 2046, 2392, 184, 107730, 18499, 1556, 142508, 10, 23, 438, 112, 42719, 8520, 67, 33657, 182747, 17, 366, 136, 13, 44084, 96746, 18597, 22062 ]

[ 0.1116943359375, 0.0148162841796875, 0.0775146484375, 0.1524658203125, 0.1829833984375, 0.2269287109375, 0.2030029296875, 0.1624755859375, 0.2325439453125, 0.02630615234375, 0.05267333984375, 0.1104736328125, 0.10107421875, 0.1407470703125, 0.1295166015625, 0.06475830078125, 0.073486...

embed

5953293_c0

5953293

haskell

0

Title: cabal install libClang (Haskell) dont work under minGW Problem title: cabal install libClang (Haskell) dont work under minGW Tags: cabal, windows, haskell, clang Problem: cabal install libClang (Haskell) dont work under minGW i always get the error: clang library not found i have installed the newest mingw and h...

cabal install libClang (Haskell) dont work under minGW cabal install libClang (Haskell) dont work under minGW cabal windows haskell clang Haskell cabal install libClang (Haskell) dont work under minGW i always get the error: i have installed the newest mingw and haskell plattform under win7 also i copied the llvm-2.9-m...

[ 0.0028076171875, 0.000820159912109375, 0.007598876953125, 0.00830078125, -0.00077056884765625, -0.00604248046875, 0.01434326171875, -0.01422119140625, -0.015625, 0.0034637451171875, -0.002166748046875, -0.02978515625, 0.0257568359375, -0.002349853515625, 0.0196533203125, -0.00506591796...

[ 109524, 20600, 25474, 441, 3066, 6495, 7, 142508, 13319, 4488, 1379, 881, 102550, 16, 54825, 1556, 501, 20625, 11343, 18499, 765, 297, 3525, 525, 46996, 434, 136, 6, 88402, 19916, 966, 71200, 71, 70, 96, 3723, 39, 5428, 1126, 9, 14578, ...

[ 0.2469482421875, 0.1533203125, 0.133056640625, 0.12060546875, 0.3017578125, 0.1326904296875, 0.12548828125, 0.286865234375, 0.1253662109375, 0.1546630859375, 0.2138671875, 0.1859130859375, 0.2548828125, 0.005828857421875, 0.08819580078125, 0.1529541015625, 0.06121826171875, 0.14074...

embed

25566517_c0

25566517

haskell

0

Title: Can Haskell inline functions passed as an argument? Problem title: Can Haskell inline functions passed as an argument? Tags: haskell, optimization Problem: Can Haskell inline functions passed as an argument? Let's say I pass a small function f to map . Can Haskell inline f with map to produce a small imperative ...

Can Haskell inline functions passed as an argument? Can Haskell inline functions passed as an argument? haskell optimization Can Haskell Can Haskell inline functions passed as an argument? Let's say I pass a small function f to map . Can Haskell inline f with map to produce a small imperative loop? If so, how does Hask...

[ 0.00165557861328125, 0.00019073486328125, 0.025146484375, 0.0028839111328125, -0.01611328125, 0.00069427490234375, -0.0023040771484375, -0.006866455078125, -0.0031890869140625, -0.015380859375, 0.00799560546875, -0.0024871826171875, 0.00390625, 0.0252685546875, 0.01171875, -0.016723632...

[ 4171, 20625, 142508, 23, 2256, 32354, 115081, 237, 142, 10750, 7, 1556, 87235, 27875, 19336, 1238, 47, 22288, 678, 27489, 222530, 13, 40956, 13695, 28560, 6183, 83, 1172, 15555, 22321, 22230 ]

[ 0.0706787109375, 0.146728515625, 0.248046875, 0.1427001953125, 0.23291015625, 0.22265625, 0.1463623046875, 0.08880615234375, 0.05670166015625, 0.2568359375, 0.041107177734375, 0.10595703125, 0.1343994140625, 0.11328125, 0.09771728515625, 0.1412353515625, 0.05474853515625, 0.1638183...

embed

3882949_c0

3882949

haskell

0

Title: Authentication for hackage downloads? Problem title: Authentication for hackage downloads? Tags: haskell, hackage Problem: Authentication for hackage downloads? Is there any way to ensure authenticity of downloads from hackage? As far as I can see, there's nothing. No https for hackage, and neither (strong) chec...

Authentication for hackage downloads? Authentication for hackage downloads? haskell hackage Authentication Authentication for hackage downloads? Is there any way to ensure authenticity of downloads from hackage? As far as I can see, there's nothing. No https for hackage, and neither (strong) checksums for tarballs, and...

[ 0.00787353515625, 0.02685546875, 0.0211181640625, 0.0186767578125, -0.000751495361328125, 0.0162353515625, -0.0169677734375, 0.0022735595703125, -0.006072998046875, 0.0179443359375, 0.00060272216796875, -0.0272216796875, -0.0113525390625, 0.017578125, -0.0322265625, -0.007110595703125,...

[ 52236, 63250, 120639, 100, 85526, 4588, 7026, 7, 32, 1556, 142508, 2071, 2685, 2499, 3917, 47, 63284, 195734, 2481, 111, 1295, 2060, 1957, 33720, 438, 3975, 4, 2725, 9319, 6639, 449, 16, 12765, 10321, 2405, 12126, 181141, 3642, 831, 87, ...

[ 0.1676025390625, 0.2381591796875, 0.1646728515625, 0.1309814453125, 0.257568359375, 0.2381591796875, 0.2415771484375, 0.0841064453125, 0.039642333984375, 0.1654052734375, 0.254638671875, 0.0301513671875, 0.055023193359375, 0.0711669921875, 0.11181640625, 0.06591796875, 0.196411132812...

embed

40316605_c0

40316605

haskell

0

Title: Implementing Alpha-Equivalence in haskell Problem title: Implementing Alpha-Equivalence in haskell Tags: haskell, lambda-calculus Problem: Implementing Alpha-Equivalence in haskell I want to define Alpha-Equivalence using this data definition type Sym = Char data Exp = Var Sym | App Term Exp | Lam Sym Exp derivi...

Implementing Alpha-Equivalence in haskell Implementing Alpha-Equivalence in haskell haskell lambda-calculus Implementing Alpha-Equivalence Sym Char Exp App Term Lam Read Show Implementing Alpha-Equivalence in haskell I want to define Alpha-Equivalence using this data definition What is the best way to do this?

[ 0.0032958984375, 0.01263427734375, 0.01513671875, 0.0157470703125, 0.00177764892578125, -0.000949859619140625, 0.01055908203125, -0.00135040283203125, 0.0057373046875, 0.004119873046875, -0.000789642333984375, -0.00982666015625, 0.022216796875, 0.029541015625, -0.0169677734375, -0.0054...

[ 153941, 214, 76569, 9, 647, 3181, 1405, 6620, 23, 1556, 142508, 21, 6492, 85, 6827, 94739, 4843, 39, 21656, 60075, 5659, 2994, 59387, 4764, 17367, 3444, 61924, 17368, 903, 2053, 80934, 2965, 3917 ]

[ 0.2135009765625, 0.0169525146484375, 0.263427734375, 0.0703125, 0.104248046875, 0.135986328125, 0.190185546875, 0.1446533203125, 0.04266357421875, 0.1617431640625, 0.2489013671875, 0.008453369140625, 0.1168212890625, 0.07293701171875, 0.1009521484375, 0.132080078125, 0.01962280273437...

embed

29172356_c0

29172356

haskell

0

Title: Haskell custom data type expression Problem title: Haskell custom data type expression Tags: haskell Problem: Haskell custom data type expression If I have the custom data type as follows: data MyType :: * -> * where Zero:: MyType a One:: a -> MyType a Two:: MyType a -> MyType b -> MyType (a,b) Is it the same as...

Haskell custom data type expression Haskell custom data type expression haskell Haskell MyType Zero One Two Haskell custom data type expression If I have the custom data type as follows: Is it the same as writing them as: Is the above correct? And how do I represent Two?

[ 0.00738525390625, -0.005157470703125, -0.002899169921875, 0.03369140625, 0.0008392333984375, 0.00811767578125, -0.00390625, 0.0074462890625, 0.018798828125, 0.01068115234375, 0.005157470703125, -0.034423828125, 0.01141357421875, -0.016845703125, -0.0167236328125, -0.000827789306640625,...

[ 20625, 142508, 114122, 2053, 10644, 125195, 1556, 2646, 196707, 83947, 6561, 32964, 765, 28960, 2071, 70, 5701, 32562, 2856, 237, 36917, 26785, 3642, 33636 ]

[ 0.1400146484375, 0.2088623046875, 0.24365234375, 0.159912109375, 0.23828125, 0.2249755859375, 0.122802734375, 0.138916015625, 0.259033203125, 0.1669921875, 0.158203125, 0.239013671875, 0.0255584716796875, 0.0760498046875, 0.004497528076171875, 0.0003070831298828125, 0.0758056640625, ...

embed

7152183_c0

7152183

haskell

0

Title: Is (reverse . f . reverse) efficient? Problem title: Is (reverse . f . reverse) efficient? Tags: haskell Problem: Is (reverse . f . reverse) efficient? Many times I see functions which operate on the head of a list, e.g: trimHead ('\n':xs) = xs trimHead xs = xs then I see the the definition: trimTail = reverse ....

Is (reverse . f . reverse) efficient? Is (reverse . f . reverse) efficient? haskell Is (reverse . f . reverse) efficient? Many times I see functions which operate on the head of a list, e.g: then I see the the definition: then I see: They are clean, but are trimTail and trimBoth efficient? Is there a better way?

[ 0.0025177001953125, 0.0057373046875, 0.0198974609375, 0.0084228515625, -0.017822265625, 0.01123046875, 0.00396728515625, 0.014892578125, 0.01025390625, -0.0096435546875, -0.00133514404296875, 0.0224609375, 0.0185546875, -0.0068359375, 0.005828857421875, -0.005126953125, 0.00598144531...

[ 2071, 107, 37676, 1238, 39531, 184, 93766, 1556, 142508, 5, 16, 20028, 1957, 32354, 160404, 98, 10336, 111, 5303, 80934, 10660, 621, 46622, 1284, 85247, 9874, 379, 12647, 927, 11522, 3917 ]

[ 0.09661865234375, 0.128173828125, 0.285400390625, 0.14599609375, 0.2529296875, 0.217529296875, 0.2445068359375, 0.1220703125, 0.2308349609375, 0.01953125, 0.0159454345703125, 0.018707275390625, 0.087890625, 0.1663818359375, 0.122314453125, 0.0477294921875, 0.1136474609375, 0.012786...

embed

9121277_c2

9121277

haskell

2

\s z -> ((\s z -> ((\s z -> ((\s z -> (((\s z -> ((\s z -> (s . s) z) . (\s z -> (s . s . s) z)) s z) s) . ((\s z -> s z) s)) z) . (\s z -> (((\s z -> ((\s z -> ((\s z -> (s . s) z) . (\s z -> (s . s) z)) s z) . (\s z -> (s . s . s) z)) s z) s) . ((\s z -> s z) s)) z)) s z) . (\s z -> (((\s z -> ((\s z -> (s . s) z) (\...

[ 0.0155029296875, 0.005950927734375, -0.02490234375, 0.0146484375, 0.009765625, -0.004547119140625, -0.0257568359375, -0.012451171875, 0.01556396484375, -0.0084228515625, -0.0067138671875, 0.00970458984375, 0.01043701171875, 0.004302978515625, 0.000797271728515625, 0.005401611328125, ...

[ 41872, 7, 97, 33079, 60494, 128258, 5, 91, 16, 15, 28864, 26073, 12, 70, 20625, 142508, 52782, 808, 1549, 115861, 2661 ]

[ 0.1053466796875, 0.1239013671875, 0.2410888671875, 0.1580810546875, 0.16064453125, 0.1292724609375, 0.040130615234375, 0.1448974609375, 0.0113525390625, 0.0232696533203125, 0.2255859375, 0.26220703125, 0.04296875, 0.220703125, 0.161865234375, 0.28271484375, 0.1790771484375, 0.05966...

embed

56276815_c0

56276815

haskell

0

Title: Is it possible to use one line contracts in Liquid Haskell? Problem title: Is it possible to use one line contracts in Liquid Haskell? Tags: liquid-haskell, haskell Problem: Is it possible to use one line contracts in Liquid Haskell? Liquid Haskell uses comments like {-@ ... @-} for contracts block. Is it possib...

Is it possible to use one line contracts in Liquid Haskell? Is it possible to use one line contracts in Liquid Haskell? liquid-haskell haskell Liquid Haskell Is it possible to use one line contracts in Liquid Haskell? Liquid Haskell uses comments like {-@ ... @-} for contracts block. Is it possible (with command line o...

[ 0.0166015625, 0.000614166259765625, -0.0198974609375, 0.0002231597900390625, -0.02734375, 0.008056640625, -0.00494384765625, 0.0279541015625, -0.0016326904296875, -0.0057373046875, -0.0225830078125, 0.01904296875, 0.011962890625, -0.00732421875, -0.000553131103515625, 0.0169677734375, ...

[ 2071, 7722, 4527, 1632, 13315, 18264, 7, 23, 170527, 20625, 142508, 41931, 10557, 1556, 442, 24626, 1884, 9, 981, 153, 1374, 46389, 75101, 35829, 153837, 40140, 18929, 20623, 4210, 100 ]

[ 0.00030517578125, 0.14599609375, 0.1068115234375, 0.1456298828125, 0.2003173828125, 0.252685546875, 0.0654296875, 0.04058837890625, 0.2247314453125, 0.126953125, 0.2120361328125, 0.17724609375, 0.09344482421875, 0.10137939453125, 0.01324462890625, 0.1876220703125, 0.035797119140625, ...

embed

36073879_c0

36073879

haskell

0

Title: exporting chose funcitons/datatypes in Haskell Problem title: exporting chose funcitons/datatypes in Haskell Tags: debugging, haskell Problem: exporting chose funcitons/datatypes in Haskell I am newbie when it comes to haskell. Tell me please, where the bug is ? t :: Int -> Args t k = Args { replay = Nothing, ma...

exporting chose funcitons/datatypes in Haskell exporting chose funcitons/datatypes in Haskell debugging haskell Haskell Args Nothing exporting chose funcitons/datatypes in Haskell I am newbie when it comes to haskell. Tell me please, where the bug is ?

[ 0.0159912109375, -0.01324462890625, 0.0026397705078125, 0.024658203125, -0.00007152557373046875, 0.01141357421875, -0.000396728515625, -0.00445556640625, -0.0013885498046875, 0.026123046875, 0.0111083984375, -0.0103759765625, 0.0172119140625, 0.00897216796875, 0.0208740234375, -0.00117...

[ 31255, 214, 19667, 7477, 67772, 10135, 50986, 20625, 142508, 23, 8, 978, 1556, 1172, 9405, 182747, 64, 9014, 59488, 22936, 7440, 54608 ]

[ 0.231201171875, 0.0142822265625, 0.153564453125, 0.1270751953125, 0.138671875, 0.042816162109375, 0.21875, 0.1334228515625, 0.2288818359375, 0.040679931640625, 0.08782958984375, 0.125, 0.1038818359375, 0.12005615234375, 0.060028076171875, 0.09527587890625, 0.0201873779296875, 0.076...

embed

23282772_c0

23282772

haskell

0

Title: Useful ReadLn in Haskell Problem title: Useful ReadLn in Haskell Tags: functional-programming, io, haskell Problem: Useful ReadLn in Haskell Is there in Haskell a built-in function like ReadLn in Pascal? I want smth like this: λ> pascalReadLn :: IO (Int, Int, Int, Int) 1 2 3 4 (1,2,3,4) λ> pascalReadLn :: IO (In...

Useful ReadLn in Haskell Useful ReadLn in Haskell functional-programming io haskell Useful ReadLn Haskell Useful ReadLn in Haskell Is there in Haskell a built-in function like ReadLn in Pascal? I want smth like this:

[ -0.00250244140625, 0.00689697265625, 0.01080322265625, 0.006988525390625, 0.005767822265625, 0.019287109375, 0.003753662109375, -0.0240478515625, -0.0057373046875, -0.0306396484375, 0.0034637451171875, -0.0308837890625, 0.006805419921875, 0.005615234375, 0.011474609375, 0.0044860839843...

[ 36836, 7844, 4764, 866, 19, 23, 20625, 142508, 123309, 28966, 22995, 1556, 2685, 88303, 73, 32354, 1884, 167599, 3444, 14050, 927, 903 ]

[ 0.174560546875, 0.173095703125, 0.220947265625, 0.2125244140625, 0.221923828125, 0.0809326171875, 0.1561279296875, 0.251708984375, 0.1474609375, 0.09295654296875, 0.1475830078125, 0.13427734375, 0.03521728515625, 0.16162109375, 0.11175537109375, 0.2001953125, 0.086181640625, 0.1789...

embed

49869233_c0

49869233

haskell

0

Title: Get foreground window title using Haskell on Linux Problem title: Get foreground window title using Haskell on Linux Tags: linux, foreground, window, haskell Problem: Get foreground window title using Haskell on Linux Under Windows, it is possible to get the foreground window title using: getForegroundWindow Is ...

Get foreground window title using Haskell on Linux Get foreground window title using Haskell on Linux linux foreground window haskell Haskell Get Linux Get foreground window title using Haskell on Linux Under Windows, it is possible to get the foreground window title using: getForegroundWindow Is there an equivalent wa...

[ 0.022705078125, 0.0208740234375, -0.01470947265625, 0.0157470703125, 0.00341796875, -0.005645751953125, 0.0213623046875, -0.021484375, -0.01544189453125, -0.0390625, 0.020751953125, -0.0106201171875, -0.00946044921875, 0.02099609375, -0.01177978515625, 0.01202392578125, -0.0043334960...

[ 20779, 100, 13, 64330, 76896, 44759, 17368, 20625, 142508, 98, 29908, 11508, 1556, 9626, 3773, 83, 7722, 2046, 18537, 92049, 24293, 183234, 3917, 563, 22724 ]

[ 0.0877685546875, 0.082763671875, 0.09173583984375, 0.18798828125, 0.17138671875, 0.1982421875, 0.058837890625, 0.1490478515625, 0.273681640625, 0.06298828125, 0.225830078125, 0.0869140625, 0.1173095703125, 0.0780029296875, 0.140380859375, 0.00433349609375, 0.07666015625, 0.10034179...

embed

23727796_c0

23727796

haskell

0

Title: what's the point of System.IO.Error Problem title: what's the point of System.IO.Error Tags: haskell, exception Problem: what's the point of System.IO.Error I noticed there is a IOException type in Control.Exception as well, what's the point of having a separate System.IO.Error module and IOError type?...

what's the point of System.IO.Error what's the point of System.IO.Error haskell exception System.IO.Error what's the point of System.IO.Error I noticed there is a IOException type in Control.Exception as well, what's the point of having a separate System.IO.Error module and IOError type? Is it there just beca...

[ 0.0150146484375, 0.00927734375, -0.017578125, -0.008056640625, 0.01483154296875, 0.009765625, 0.00811767578125, -0.00457763671875, -0.00262451171875, 0.0164794921875, 0.0213623046875, -0.038330078125, 0.025390625, -0.009765625, -0.00057220458984375, 0.00396728515625, 0.00701904296875...

[ 2367, 3768, 70, 6275, 111, 12353, 5, 17780, 18468, 31611, 1556, 142508, 131527, 7, 156672, 2685, 10, 19279, 63928, 10644, 23, 27131, 5299, 19441, 84797, 88996, 136, 6637, 186768, 151117, 71864, 17368, 12601 ]

[ 0.0804443359375, 0.103515625, 0.1070556640625, 0.1890869140625, 0.1046142578125, 0.1881103515625, 0.0745849609375, 0.275146484375, 0.1695556640625, 0.163818359375, 0.1395263671875, 0.225830078125, 0.1944580078125, 0.060943603515625, 0.04974365234375, 0.0399169921875, 0.02381896972656...

embed

67934377_c0

67934377

haskell

0

Title: Bind operator for non-monadic functions Problem title: Bind operator for non-monadic functions Tags: monads, haskell, bind Problem: Bind operator for non-monadic functions I more or less wrapped my head around monads, but i can't deduct how expression (>>=) id (+) 3 evaluates to 6. It just seems the expression s...

Bind operator for non-monadic functions Bind operator for non-monadic functions monads haskell bind Bind Bind operator for non-monadic functions I more or less wrapped my head around monads, but i can't deduct how expression evaluates to 6. It just seems the expression somehow got simplified to but how? How is 3 applie...

[ -0.006011962890625, -0.011962890625, 0.0235595703125, 0.006866455078125, 0.0220947265625, 0.01129150390625, 0.0037078857421875, -0.01318359375, 0.007415771484375, -0.037353515625, -0.000957489013671875, -0.0233154296875, 0.002685546875, 0.0106201171875, 0.01153564453125, -0.00088500976...

[ 16666, 71, 39933, 351, 87039, 18403, 32354, 2667, 712, 1556, 142508, 68557, 100, 10336, 7, 77193, 125195, 151575, 47, 2289, 37202, 112892, 1029, 138, 190659, 186351, 73342, 28302 ]

[ 0.1898193359375, 0.104248046875, 0.25537109375, 0.1326904296875, 0.10064697265625, 0.06640625, 0.157470703125, 0.121826171875, 0.1556396484375, 0.09619140625, 0.1942138671875, 0.198974609375, 0.02117919921875, 0.03021240234375, 0.052001953125, 0.035003662109375, 0.17431640625, 0.11...

embed

61476770_c3

61476770

haskell

3

-2.7.1.0, xhtml-3000.2.1, nightly-2015-08-26, stm-2.4.4, acme-missiles-0.3, helloworld-0.1.0.0, Lib.hs, Lib, package.yaml, stack.yaml, LTS, Stack, GHC, Cabal, Configuring, Preprocessing, Building, Compiling, Acme.Missiles.STM, Installing, c1955c78, x86_64-windows-ghc-8.8.3, acme-missiles-0.3-5Q3zlWTjrQa, Fyz88eRyQT2, R...

[ 0.01446533203125, -0.01312255859375, -0.001617431640625, 0.0262451171875, -0.0098876953125, 0.0272216796875, -0.0030975341796875, -0.0037384033203125, 0.0016021728515625, 0.0286865234375, -0.00762939453125, -0.0101318359375, 0.00244140625, -0.003387451171875, -0.01202392578125, 0.00430...

[ 122297, 53489, 102107, 4, 1022, 7693, 9, 36605, 5, 68107, 17431, 538, 44906, 47355, 4046, 6138, 39, 5428, 180874, 1030, 282, 86811, 1577, 170179, 33600, 31, 32554, 102014, 99929, 43278, 127, 98169, 14520, 141, 177261, 12763, 6512, 2594, 527...

[ 0.1444091796875, 0.141357421875, 0.168701171875, 0.07525634765625, 0.076904296875, 0.259521484375, 0.0797119140625, 0.167724609375, 0.074951171875, 0.144287109375, 0.162841796875, 0.1614990234375, 0.1767578125, 0.03936767578125, 0.0927734375, 0.0909423828125, 0.151611328125, 0.0786...

embed

11443324_c0

11443324

haskell

0

Title: Haskell type class for Queue Problem title: Haskell type class for Queue Tags: haskell, typeclass Problem: Haskell type class for Queue Has anyone written a Haskell type class (or is there a combination of type classes) that describes a FIFO queue. Data.Collection.Sequence seems too strong, but on the other hand...

Haskell type class for Queue Haskell type class for Queue haskell typeclass Haskell Queue Haskell type class for Queue Has anyone written a Haskell type class (or is there a combination of type classes) that describes a FIFO queue. Data.Collection.Sequence seems too strong, but on the other hand Data.Collection.Unfolda...

[ 0.024658203125, 0.0267333984375, -0.01171875, 0.007476806640625, -0.001007080078125, -0.02978515625, -0.004791259765625, -0.0169677734375, -0.014404296875, -0.0038299560546875, -0.019287109375, -0.0242919921875, 0.004150390625, 0.0037384033203125, -0.0218505859375, 0.0191650390625, -...

[ 20625, 142508, 10644, 18507, 100, 5813, 13388, 1556, 67413, 35672, 59121, 83, 162515, 61112, 98363, 7, 32983, 51980, 41, 11809, 133, 944, 37202, 5792, 37515, 78457, 10763, 14256, 42822, 2886, 642, 344, 12989, 959, 61924, 41313, 4488 ]

[ 0.1444091796875, 0.2283935546875, 0.1942138671875, 0.22509765625, 0.0673828125, 0.1796875, 0.1890869140625, 0.1324462890625, 0.12890625, 0.0526123046875, 0.08294677734375, 0.005462646484375, 0.0482177734375, 0.1805419921875, 0.0909423828125, 0.0269317626953125, 0.1640625, 0.2255859...

embed

37919343_c0

37919343

haskell

0

Title: Reduce lambda-expressions in WHNF Problem title: Reduce lambda-expressions in WHNF Tags: lazy-evaluation, lambda-calculus, haskell, weak-head-normal-form Problem: Reduce lambda-expressions in WHNF I have to reduce the following lambda-expression into WHNF, but I am not quite sure how to do it: (λx y. x 3) (+ 4) ...

Reduce lambda-expressions in WHNF Reduce lambda-expressions in WHNF lazy-evaluation lambda-calculus haskell weak-head-normal-form Reduce WHNF Reduce lambda-expressions in WHNF I have to reduce the following lambda-expression into WHNF, but I am not quite sure how to do it: So, how do I do it? Call-By-Name Reduction? Is...

[ -0.0028533935546875, 0.01171875, 0.01019287109375, 0.0186767578125, 0.003082275390625, 0.005340576171875, 0.0034027099609375, -0.007293701171875, 0.0255126953125, -0.00823974609375, -0.00958251953125, -0.0220947265625, -0.005859375, 0.00165557861328125, 0.002105712890625, -0.0062561035...

[ 853, 106357, 21, 6492, 85, 204629, 601, 841, 73493, 3285, 159258, 6827, 94739, 1556, 142508, 642, 344, 31251, 33176, 5037, 34390, 25632, 3934, 3642, 54, 26265, 75358, 163612, 77391, 125195, 27781, 169, 1022, 5970, 425, 97, 23, 14373 ]

[ 0.1370849609375, 0.1541748046875, 0.05615234375, 0.1966552734375, 0.155517578125, 0.2061767578125, 0.07904052734375, 0.129638671875, 0.256103515625, 0.1456298828125, 0.1390380859375, 0.0645751953125, 0.1026611328125, 0.06121826171875, 0.1961669921875, 0.04229736328125, 0.069152832031...

embed

4084790_c0

4084790

haskell

0

Title: Compilers for Haskell Problem title: Compilers for Haskell Tags: haskell, ghc Problem: Compilers for Haskell AFAIK GHC is the most common compiler today, but I also see, that some other compilers are available too. Is GHC really the best choice for all purposes or may I use something else instead? For instance, ...

Compilers for Haskell Compilers for Haskell haskell ghc Compilers Haskell Compilers for Haskell AFAIK GHC is the most common compiler today, but I also see, that some other compilers are available too. Is GHC really the best choice for all purposes or may I use something else instead? For instance, I read that some com...

[ 0.01043701171875, 0.006561279296875, 0.0250244140625, -0.01190185546875, -0.0113525390625, 0.0162353515625, -0.032470703125, -0.0167236328125, -0.01104736328125, -0.00738525390625, -0.0166015625, -0.024658203125, 0.01153564453125, 0.0196533203125, -0.004425048828125, -0.001121520996093...

[ 15612, 34759, 100, 20625, 142508, 1556, 31380, 238, 151334, 17756, 527, 73265, 83, 70, 2684, 39210, 9969, 18925, 3789, 621, 19882, 2071, 6183, 2965, 44126, 756, 60042, 1543, 4527, 9844, 37076, 64457, 12301, 3060, 9904, 9351, 14602, 11522, 9...

[ 0.187744140625, 0.218994140625, 0.101318359375, 0.1710205078125, 0.267333984375, 0.137939453125, 0.1268310546875, 0.120849609375, 0.062347412109375, 0.053131103515625, 0.1402587890625, 0.2286376953125, 0.053497314453125, 0.06719970703125, 0.13916015625, 0.1710205078125, 0.18579101562...

embed

53351894_c0

53351894

haskell

0

Title: Finding a "free theorem" Problem title: Finding a "free theorem" Tags: haskell, free-theorem Problem: Finding a "free theorem" How do I derive the free theorem for the type: data F a = C1 Nat | C2 Bool Nat a where Nat is simply data Nat = Z | S Nat ? In principle, this can be answered by the ...

Finding a "free theorem" Finding a "free theorem" haskell free-theorem Finding Nat Bool Finding a "free theorem" How do I derive the free theorem for the type: where Nat is simply data Nat = Z | S Nat ? In principle, this can be answered by the Haskell 'free-theorems' package, but it's too elderly t...

[ 0.0303955078125, 0.00185394287109375, 0.0079345703125, 0.00823974609375, 0.009033203125, -0.011962890625, -0.01275634765625, 0.003875732421875, 0.009765625, -0.0216064453125, 0.0057373046875, -0.01806640625, -0.007080078125, 0.0181884765625, -0.0047607421875, 0.0133056640625, 0.00854...

[ 26040, 32087, 70, 58391, 1556, 142508, 4092, 2347, 68875, 2460, 929, 122, 5844, 10644, 7440, 83, 42856, 2053, 2203, 567, 58745, 159, 24702, 194663, 20625, 25, 98169, 5792, 820, 9969, 1340, 1379, 527, 73265, 11389, 31635, 20600 ]

[ 0.109130859375, 0.1728515625, 0.0792236328125, 0.21044921875, 0.08489990234375, 0.2308349609375, 0.18701171875, 0.057373046875, 0.23681640625, 0.0906982421875, 0.170654296875, 0.1051025390625, 0.095458984375, 0.1396484375, 0.056732177734375, 0.0203704833984375, 0.1151123046875, 0.1...

embed

1913954_c0

1913954

haskell

0

Title: How to make an unboxed array of floats I can get a Ptr to Problem title: How to make an unboxed array of floats I can get a Ptr to Tags: arrays, c, haskell, opengl, unboxing Problem: How to make an unboxed array of floats I can get a Ptr to I am trying to do some work with HopenGL and I need a Ptr that points to...

How to make an unboxed array of floats I can get a Ptr to How to make an unboxed array of floats I can get a Ptr to arrays c haskell opengl unboxing How Ptr How to make an unboxed array of floats I can get a Ptr to I am trying to do some work with HopenGL and I need a Ptr that points to a array of floats. From what I h...

[ 0.01904296875, 0.028076171875, -0.0093994140625, -0.0223388671875, 0.0048828125, -0.004150390625, 0.0135498046875, -0.0264892578125, -0.00058746337890625, 0.004302978515625, -0.013427734375, -0.031494140625, 0.0184326171875, -0.00421142578125, 0.002899169921875, -0.00933837890625, -0...

[ 11249, 3249, 51, 11728, 297, 10298, 53, 111, 21917, 9821, 87, 831, 2046, 10, 436, 4448, 47, 4778, 501, 1556, 142508, 9803, 11016, 4488, 75359, 78703, 3871, 26847, 2240, 7092, 136, 3082, 2886, 7614, 48903, 3917, 162515 ]

[ 0.0706787109375, 0.097412109375, 0.0869140625, 0.197998046875, 0.045654296875, 0.170166015625, 0.136962890625, 0.052520751953125, 0.2027587890625, 0.123046875, 0.001373291015625, 0.037841796875, 0.07861328125, 0.034912109375, 0.04840087890625, 0.19921875, 0.162841796875, 0.09692382...

embed

76049049_c1

76049049

haskell

1

C .| Data.Conduit.Text.lines .| mapC (\a -> a =~ ("[fd]oo" :: Text) :: Text) .| log1 .| unlinesC .| encodeUtf8C .| stdoutC But why does order of await matters? log1 :: ConduitT Text Text (ResourceT IO) () log1 = do Just l <- await -- <- has to be first liftIO $ print l yield l Code signals: Conduit, Data.Text, Text.Reg...

[ -0.0003108978271484375, -0.01141357421875, 0.000843048095703125, 0.0213623046875, 0.01019287109375, 0.001220703125, 0.0419921875, 0.01708984375, -0.01495361328125, -0.0286865234375, -0.00156402587890625, 0.00099945068359375, 0.00933837890625, -0.0014801025390625, 0.0208740234375, -0.02...

[ 313, 11809, 11935, 112061, 174379, 59801, 22288, 441, 11, 33079, 10, 16635, 24129, 1984, 12684, 418, 51, 40899, 6138, 1003, 15400, 14602, 12989, 111, 634, 217, 26866, 7, 1657, 618, 4332, 60427, 17780, 54, 9563, 96, 1556, 5117, 60520, 3650...

[ 0.0875244140625, 0.1131591796875, 0.040740966796875, 0.211669921875, 0.2000732421875, 0.1473388671875, 0.136474609375, 0.05426025390625, 0.0404052734375, 0.0208740234375, 0.058319091796875, 0.14208984375, 0.194091796875, 0.00909423828125, 0.207275390625, 0.1318359375, 0.037841796875,...

embed

41574250_c0

41574250

haskell

0

Title: How do I properly do Haskell pattern matching on a list? Problem title: How do I properly do Haskell pattern matching on a list? Tags: haskell, pattern-matching Problem: How do I properly do Haskell pattern matching on a list? Code signals: xs, How, Haskell, ch03, Intersperse.hs, Intersperse, Compiling, Main, x:...

How do I properly do Haskell pattern matching on a list? How do I properly do Haskell pattern matching on a list? haskell pattern-matching xs How Haskell ch03 Intersperse.hs Intersperse Compiling Main x:xs intersperse.hs:4:24 Couldn intersperse.hs:1:16 Relevant intersperse.hs:4:18 intersperse.hs:4:16 intersperse.hs:4:1...

[ -0.0228271484375, 0.0164794921875, 0.0191650390625, -0.006927490234375, -0.0133056640625, 0.0247802734375, -0.0096435546875, -0.0020904541015625, 0.0130615234375, -0.00811767578125, 0.0062255859375, -0.0093994140625, 0.0162353515625, -0.00074005126953125, -0.0008087158203125, -0.007598...

[ 11249, 155965, 54, 20625, 142508, 103510, 14858, 214, 98, 5303, 1556, 98753, 1022, 3863, 9513, 5337, 20595, 184, 127, 15612, 49725, 12321, 425, 1940, 617, 25732, 191147, 19, 22354, 133, 30624, 24033, 22618, 19721, 81979, 103136, 20697, 966, ...

[ 0.06170654296875, 0.156494140625, 0.0703125, 0.1441650390625, 0.20361328125, 0.253173828125, 0.22607421875, 0.1201171875, 0.0513916015625, 0.205322265625, 0.1324462890625, 0.2333984375, 0.0672607421875, 0.035400390625, 0.1512451171875, 0.08740234375, 0.1773681640625, 0.081787109375...

embed

16309432_c0

16309432

haskell

0

Title: Error with main function Problem title: Error with main function Tags: haskell Problem: Error with main function I'm new to Haskell and still trying to workout some of syntax/idioms. Can anyone explain what I'm doing wrong in this code? main should print out a list of 5 random numbers. This works find in GHCi, b...

Error with main function Error with main function haskell System.Random Error Error with main function I'm new to Haskell and still trying to workout some of syntax/idioms. Can anyone explain what I'm doing wrong in this code? main should print out a list of 5 random numbers. This works find in GHCi, but not in a file....

[ -0.00150299072265625, 0.01348876953125, 0.0020294189453125, -0.01708984375, -0.00015163421630859375, 0.0125732421875, -0.00004744529724121094, 0.0017242431640625, -0.02880859375, -0.06201171875, 0.0015869140625, -0.0172119140625, 0.0101318359375, -0.0020294189453125, 0.0225830078125, -...

[ 212059, 678, 5201, 32354, 1556, 142508, 12353, 126525, 3815, 3525, 20625, 31577, 184732, 6002, 86531, 57840, 4432, 4171, 73342, 20594, 44691, 18151, 5608, 28412, 1810, 5303, 190, 96759, 101935, 43240, 7413, 527, 73265, 14, 1284, 959, 23, 1143...

[ 0.208740234375, 0.165771484375, 0.1826171875, 0.2117919921875, 0.1444091796875, 0.248291015625, 0.1199951171875, 0.1072998046875, 0.168701171875, 0.068115234375, 0.117431640625, 0.0098876953125, 0.086181640625, 0.0287322998046875, 0.1143798828125, 0.06903076171875, 0.0009765625, 0....

embed

18441565_c0

18441565

haskell

0

Title: Where has hSetEncoding gone? Problem title: Where has hSetEncoding gone? Tags: io, haskell, character-encoding Problem: Where has hSetEncoding gone? I was fairly sure that a while back GHC added the ability to explicitly set the character encoding on a Handle . However, when I look in System.IO , I don't see any...

Where has hSetEncoding gone? Where has hSetEncoding gone? io haskell character-encoding Where Handle System.IO Where has hSetEncoding gone? I was fairly sure that a while back GHC added the ability to explicitly set the character encoding on a Handle . However, when I look in System.IO , I don't see anything relating t...

[ 0.0038909912109375, 0.009521484375, 0.012451171875, -0.00543212890625, -0.00860595703125, 0.00112152099609375, -0.018310546875, 0.004486083984375, -0.0034027099609375, 0.01904296875, 0.000972747802734375, -0.034423828125, 0.009521484375, -0.00909423828125, -0.005096435546875, 0.0040283...

[ 78662, 1556, 1096, 294, 126, 7768, 587, 6238, 74955, 22995, 142508, 62816, 66332, 10639, 133, 12353, 5, 17780, 9077, 527, 73265, 49814, 81273, 143726, 5423, 22, 98, 6713, 2301, 18, 1957, 23937, 33444, 20625, 70968, 1324, 29485, 99929, 44948...

[ 0.1226806640625, 0.163818359375, 0.159423828125, 0.146728515625, 0.196533203125, 0.1400146484375, 0.2200927734375, 0.1776123046875, 0.11767578125, 0.18359375, 0.2283935546875, 0.1767578125, 0.193603515625, 0.17578125, 0.173583984375, 0.1488037109375, 0.010772705078125, 0.1931152343...

embed

23018679_c0

23018679

haskell

0

Title: Cancel main without closing ghci Problem title: Cancel main without closing ghci Tags: haskell Problem: Cancel main without closing ghci I'm working on a web server using Scotty . I can run ghci and keep using :r to get it to reload my code, but if I even run main I cant' restart the web server without killing g...

Cancel main without closing ghci Cancel main without closing ghci haskell Cancel Cancel main without closing ghci I'm working on a web server using Scotty . I can run ghci and keep using :r to get it to reload my code, but if I even run main I cant' restart the web server without killing ghci. How can I cancel main wit...

[ 0.01220703125, 0.0179443359375, 0.006439208984375, 0.00445556640625, -0.037353515625, -0.000629425048828125, -0.0062255859375, -0.004913330078125, -0.013916015625, -0.038330078125, -0.0208740234375, -0.030517578125, 0.0031890869140625, 0.01220703125, 0.0189208984375, -0.00732421875, ...

[ 80392, 5201, 15490, 20450, 31380, 318, 6953, 1556, 142508, 20697, 1467, 10723, 17368, 50695, 53, 831, 11675, 13695, 152, 42, 456, 63033, 18151, 45767, 17137, 200, 30319, 11249, 53017, 11522, 34831, 191082 ]

[ 0.239013671875, 0.172119140625, 0.115234375, 0.141845703125, 0.1397705078125, 0.206787109375, 0.05352783203125, 0.11962890625, 0.2138671875, 0.0626220703125, 0.056915283203125, 0.115966796875, 0.0261993408203125, 0.1357421875, 0.145263671875, 0.043060302734375, 0.09735107421875, 0....

embed

412919_c0

412919

haskell

0

Title: How does Haskell tail recursion work? Problem title: How does Haskell tail recursion work? Tags: tail-recursion, haskell Problem: How does Haskell tail recursion work? I wrote this snippet of code and I assume len is tail-recursive, but a stack overflow still occurs. What is wrong? myLength :: [a] -> Integer myL...

How does Haskell tail recursion work? How does Haskell tail recursion work? tail-recursion haskell How Haskell Integer x:xs How does Haskell tail recursion work? I wrote this snippet of code and I assume len is tail-recursive, but a stack overflow still occurs. What is wrong?

[ 0.002685546875, 0.0262451171875, 0.0137939453125, 0.0201416015625, 0.004974365234375, -0.007476806640625, -0.00142669677734375, -0.02197265625, 0.0238037109375, -0.033935546875, 0.01153564453125, -0.00982666015625, 0.023193359375, 0.0128173828125, 0.0306396484375, 0.000926971435546875,...

[ 11249, 14602, 20625, 142508, 46741, 195625, 1830, 4488, 107, 48650, 1556, 44401, 1022, 12, 425, 7, 58134, 18151, 41591, 3098, 83, 5844, 177261, 645, 118664, 7464, 74918, 44691 ]

[ 0.0948486328125, 0.087158203125, 0.1544189453125, 0.228759765625, 0.25830078125, 0.205322265625, 0.1259765625, 0.15966796875, 0.06689453125, 0.15625, 0.146728515625, 0.1785888671875, 0.084716796875, 0.07391357421875, 0.099609375, 0.002197265625, 0.010833740234375, 0.034393310546875...

embed

41347412_c0

41347412

haskell

0

Title: Replace keys in Data.Map Problem title: Replace keys in Data.Map Tags: dictionary, key, haskell Problem: Replace keys in Data.Map If I have two keys k0 and k1, which are in the Data.Map M, how can I remove k0 from the map and replace k1 with k0? What would be the best approach to complete this task? I have tried...

Replace keys in Data.Map Replace keys in Data.Map dictionary key haskell Replace Data.Map Replace keys in Data.Map If I have two keys k0 and k1, which are in the Data.Map M, how can I remove k0 from the map and replace k1 with k0? What would be the best approach to complete this task? I have tried to go through the doc...

[ 0.0000782012939453125, 0.0184326171875, -0.003204345703125, 0.0002117156982421875, -0.004180908203125, -0.027587890625, -0.00537109375, -0.0079345703125, 0.00469970703125, 0.0220947265625, 0.0208740234375, 0.02197265625, 0.00186920166015625, 0.024658203125, 0.0135498046875, 0.010498046...

[ 853, 23935, 22799, 7, 23, 11809, 5, 166179, 45, 10763, 1556, 142508, 765, 6626, 472, 2389, 136, 418, 276, 3642, 831, 87388, 1295, 22288, 91995, 678, 2965, 51515, 28484, 66211, 209806, 32354, 15549, 142424 ]

[ 0.107421875, 0.2025146484375, 0.2337646484375, 0.1300048828125, 0.0401611328125, 0.17138671875, 0.053955078125, 0.2193603515625, 0.045654296875, 0.081787109375, 0.138671875, 0.2293701171875, 0.02740478515625, 0.1241455078125, 0.1414794921875, 0.2110595703125, 0.0748291015625, 0.160...

embed

2098314_c0

2098314

haskell

0

Title: Haskell's Text.Regex.subRegex using TDFA implementation? Problem title: Haskell's Text.Regex.subRegex using TDFA implementation? Tags: regex, haskell Problem: Haskell's Text.Regex.subRegex using TDFA implementation? Is there a way to use the TDFA implementation of Regex with the functions in Text.Regex...

Haskell's Text.Regex.subRegex using TDFA implementation? Haskell's Text.Regex.subRegex using TDFA implementation? regex haskell TDFA Haskell Text.Regex.subRegex Haskell's Text.Regex.subRegex using TDFA implementation? Is there a way to use the TDFA implementation of Regex with the functions in Text.Regex such...

[ -0.0101318359375, 0, 0.027099609375, 0.0303955078125, 0.013916015625, -0.006011962890625, -0.0216064453125, 0.0078125, -0.00445556640625, -0.0145263671875, 0.0128173828125, 0.0198974609375, 0.01953125, -0.022216796875, 0.0101318359375, -0.0001583099365234375, 0.02880859375, 0.01599...

[ 20625, 142508, 3768, 24129, 54601, 3355, 22144, 17368, 117295, 14676, 208124, 6835, 1556, 5, 3917, 4527, 11678, 678, 32354, 1614, 209806, 8110, 54602, 21487, 4734 ]

[ 0.109619140625, 0.224609375, 0.047454833984375, 0.1964111328125, 0.1728515625, 0.2235107421875, 0.1595458984375, 0.07025146484375, 0.1396484375, 0.241455078125, 0.1715087890625, 0.1275634765625, 0.10595703125, 0.002899169921875, 0.048187255859375, 0.103271484375, 0.148193359375, 0....

embed

63248640_c0

63248640

haskell

0

Title: Why Nothing == (pure Nothing) returns False in Haskell? Problem title: Why Nothing == (pure Nothing) returns False in Haskell? Tags: haskell Problem: Why Nothing == (pure Nothing) returns False in Haskell? Seems I understood something wrong, but I tried the following: GHCi, version 8.6.5 Nothing == Nothing => Tr...

Why Nothing == (pure Nothing) returns False in Haskell? Why Nothing == (pure Nothing) returns False in Haskell? haskell Why Nothing Haskell GHCi Why Nothing == (pure Nothing) returns False in Haskell? Seems I understood something wrong, but I tried the following: Could you please explain what happens here?

[ -0.00848388671875, 0.01190185546875, 0.01373291015625, -0.00830078125, 0.01104736328125, 0.008056640625, 0.000885009765625, -0.0225830078125, 0.00164794921875, 0.00445556640625, 0.000843048095703125, -0.010498046875, -0.01336669921875, 0.01422119140625, -0.0029754638671875, -0.00927734...

[ 44084, 182747, 69112, 4717, 13, 30646, 22225, 184, 23, 20625, 142508, 1556, 527, 73265, 14, 44691, 37842, 73342 ]

[ 0.0989990234375, 0.1922607421875, 0.2705078125, 0.1134033203125, 0.04180908203125, 0.16455078125, 0.128662109375, 0.1448974609375, 0.0413818359375, 0.139404296875, 0.2410888671875, 0.1007080078125, 0.02215576171875, 0.022979736328125, 0.08935546875, 0.03399658203125, 0.00735473632812...

embed

51167568_c0

51167568

haskell

0

Title: Problems implementing "toEnum" in Haskell Problem title: Problems implementing "toEnum" in Haskell Tags: haskell, dictionary Problem: Problems implementing "toEnum" in Haskell haven't got implementation problems with fromEnum, keep running into them using toEnum. Tried different type sigs, bu...

Problems implementing "toEnum" in Haskell Problems implementing "toEnum" in Haskell haskell dictionary Problems Haskell Problems implementing "toEnum" in Haskell haven't got implementation problems with fromEnum, keep running into them using toEnum. Tried different type sigs, but keep getting it all...

[ 0.00982666015625, -0.00335693359375, 0.007080078125, 0.004913330078125, -0.027587890625, 0.0115966796875, -0.007598876953125, 0.01141357421875, -0.0142822265625, -0.000766754150390625, -0.0093994140625, -0.0284423828125, 0.01361083984375, 0.0250244140625, -0.016357421875, -0.0027465820...

[ 15649, 29479, 188, 647, 2606, 20625, 142508, 41502, 23, 1556, 45, 10763, 38246, 18, 208124, 44402, 1295, 13695, 51042, 3934, 17368, 47, 4699, 12921, 10644, 1144, 756, 44691, 4358 ]

[ 0.2015380859375, 0.1829833984375, 0.227783203125, 0.156982421875, 0.30224609375, 0.1661376953125, 0.240966796875, 0.013031005859375, 0.03057861328125, 0.142822265625, 0.044097900390625, 0.10089111328125, 0.001800537109375, 0.00128173828125, 0.168701171875, 0.13916015625, 0.1428222656...

embed

20367665_c0

20367665

haskell

0

Title: Is it possible to nest `at` with setters? Problem title: Is it possible to nest `at` with setters? Tags: haskell, haskell-lens Problem: Is it possible to nest `at` with setters? I'd like to set a value in 2 level map - i.e. to a key in a map which is a value for some key in an "outer" map. For ordinary Map I cou...

Is it possible to nest `at` with setters? Is it possible to nest `at` with setters? haskell haskell-lens Is it possible to nest `at` with setters? I'd like to set a value in 2 level map - i.e. to a key in a map which is a value for some key in an "outer" map. For ordinary Map I could use something like m & at 42 ?= "va...

[ -0.021484375, 0.0009307861328125, -0.004730224609375, -0.033935546875, 0.004791259765625, 0.00958251953125, -0.00799560546875, -0.007720947265625, 0.0030517578125, -0.0380859375, 0.0023040771484375, 0.054443359375, 0.0213623046875, 0.012451171875, 0.0189208984375, -0.0018157958984375, ...

[ 2071, 442, 7722, 47, 91280, 257, 678, 88685, 7, 1556, 142508, 1977, 1884, 5423, 34292, 116, 17366, 22288, 22799, 6056, 56, 23335, 42719, 5809, 4527, 347, 619, 99, 4828, 27494, 959, 3917, 242, 1544, 6044, 8512, 71, 3098 ]

[ 0.05303955078125, 0.0806884765625, 0.189453125, 0.072509765625, 0.227783203125, 0.2171630859375, 0.1669921875, 0.244873046875, 0.14404296875, 0.10009765625, 0.221923828125, 0.1650390625, 0.07391357421875, 0.163818359375, 0.169921875, 0.136962890625, 0.1810302734375, 0.1243896484375...

embed

21868427_c1

21868427

haskell

1

isors(n): divs = set() for i in range(1, int(sqrt(n)) + 1): if n % i == 0: divs.add(i) divs.add(n // i) return divs def sigma2(n): return sum(map(lambda x: x**2, get_divisors(n))) def big_sigma2(n): total = 0 for i in range(1, n + 1): total += sigma2(i) return total if __name__ == "__main__": find_answer() Code signals...

[ -0.0189208984375, 0.00347900390625, 0.006439208984375, -0.006256103515625, -0.00970458984375, -0.005096435546875, -0.01043701171875, 0.0146484375, -0.002410888671875, -0.021484375, 0.002410888671875, -0.000385284423828125, 0.0023345947265625, -0.00107574462890625, -0.019287109375, -0.0...

[ 83, 25251, 19, 2077, 18221, 7, 2203, 5423, 132, 100, 17, 37457, 41600, 23, 18, 864, 3198, 997, 4879, 2174, 653, 1745, 69112, 757, 4028, 14, 30646, 8, 420, 1144, 192, 304, 10554, 62346, 6492, 85, 1022, 2046, 428, 51858, 6957, 20561, ...

[ 0.17822265625, 0.296630859375, 0.1558837890625, 0.057098388671875, 0.2408447265625, 0.1240234375, 0.045196533203125, 0.1500244140625, 0.0255126953125, 0.00299072265625, 0.0911865234375, 0.1820068359375, 0.0192413330078125, 0.046234130859375, 0.08343505859375, 0.07830810546875, 0.1385...

embed

73878832_c1

73878832

haskell

1

The type of hidden f should be inferred -- It does not infer a most general type of f and produces exception Exception: Couldn't match expected type ‘(a0 -> b0 -> a0) -> t2 -> t3 -> t7 -> t3’ with actual type ‘p’ because type variables ‘t2’, ‘t3’, ‘t7’ would escape their scope In this case, type of f should be f1->f2-...

[ 0.007110595703125, 0.01153564453125, -0.01251220703125, 0.005645751953125, 0.0137939453125, -0.01300048828125, 0.01043701171875, -0.001434326171875, -0.006866455078125, -0.01470947265625, -0.00970458984375, -0.01275634765625, 0.00482177734375, 0.00051116943359375, 0.0003185272216796875, ...

[ 10644, 111, 204105, 1238, 5608, 53498, 2822, 1650, 14602, 959, 2684, 4537, 27489, 131527, 63928, 191147, 18, 14858, 84751, 11, 2389, 33079, 876, 77495, 808, 304, 363, 966, 678, 8561, 254, 77336, 2806, 144281, 70820, 903, 7225, 186, 418, 1...

[ 0.2353515625, 0.121826171875, 0.25634765625, 0.205810546875, 0.1182861328125, 0.2041015625, 0.09637451171875, 0.0107421875, 0.04034423828125, 0.109375, 0.061614990234375, 0.111328125, 0.121826171875, 0.1964111328125, 0.1278076171875, 0.055694580078125, 0.043243408203125, 0.17004394...

embed