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
43223842_c0	43223842	haskell	0	Title: Does a functor always return a lifted type in haskell when the fmap transformation is applied? Problem title: Does a functor always return a lifted type in haskell when the fmap transformation is applied? Tags: category-theory, functor, haskell, lifting Problem: Does a functor always return a lifted type in hask...	Does a functor always return a lifted type in haskell when the fmap transformation is applied? Does a functor always return a lifted type in haskell when the fmap transformation is applied? category-theory functor haskell lifting Does Maybe Does a functor always return a lifted type in haskell when the fmap transformat...	[ 0.003936767578125, -0.002685546875, 0.0142822265625, 0.00958251953125, 0.01483154296875, 0.01019287109375, -0.00531005859375, 0.00116729736328125, -0.0024566650390625, 0.00537109375, 0.0177001953125, -0.01806640625, -0.0159912109375, 0.01397705078125, 0.0050048828125, -0.00836181640625...	[ 101790, 7477, 18770, 11343, 30646, 60520, 297, 10644, 1556, 142508, 1238, 62346, 167201, 190659, 23, 95487, 177691, 83425, 3229, 765, 360, 18, 59911, 237, 137565, 20051, 16916 ]	[ 0.0677490234375, 0.1839599609375, 0.2322998046875, 0.171142578125, 0.2108154296875, 0.2447509765625, 0.1025390625, 0.2265625, 0.1402587890625, 0.245361328125, 0.1085205078125, 0.2001953125, 0.205078125, 0.11865234375, 0.04376220703125, 0.06158447265625, 0.2568359375, 0.256103515625...	embed
43397137_c0	43397137	haskell	0	Title: String concatenation in Haskell Problem title: String concatenation in Haskell Tags: string, haskell Problem: String concatenation in Haskell My problem is to build a function that given a person and an amount of hours( Integer ) it adds "erp" at the start of the name, but the "r" must multiply the amount of hou...	String concatenation in Haskell String concatenation in Haskell string haskell Haskell Integer Client Aperson String concatenation in Haskell My problem is to build a function that given a person and an amount of hours( Integer ) it adds "erp" at the start of the name, but the "r" must multiply the amount of hours. My ...	[ -0.01025390625, 0.00147247314453125, -0.00007534027099609375, 0.0224609375, -0.00182342529296875, 0.00457763671875, -0.03515625, 0.0235595703125, 0.030517578125, -0.021728515625, 0.009521484375, -0.01141357421875, 0.025390625, 0.0091552734375, -0.01043701171875, -0.0234375, -0.001136...	[ 23351, 214, 158, 4460, 33, 2320, 23, 20625, 142508, 79315, 1556, 44401, 91732, 62, 30816, 2967, 45367, 32354, 34475, 10, 3445, 41170, 21974, 15190, 56, 254, 4034, 70, 9351, 1284, 42, 8110, 6024, 62479, 2646, 10644, 27781, 3714, 3642, 1331...	[ 0.1993408203125, 0.1119384765625, 0.1171875, 0.1717529296875, 0.12744140625, 0.02630615234375, 0.043243408203125, 0.1380615234375, 0.2318115234375, 0.2091064453125, 0.1141357421875, 0.1690673828125, 0.2012939453125, 0.054443359375, 0.1903076171875, 0.0933837890625, 0.1058349609375, ...	embed
9654975_c0	9654975	haskell	0	Title: Why does haskell throw this error? Problem title: Why does haskell throw this error? Tags: haskell Problem: Why does haskell throw this error? Trying to write function that numerize items of list and returns list of tuples with numbers, ya I know I can do it with 'zip' function, but task is to write it with recu...	Why does haskell throw this error? Why does haskell throw this error? haskell Why x:xs Why does haskell throw this error? Trying to write function that numerize items of list and returns list of tuples with numbers, ya I know I can do it with 'zip' function, but task is to write it with recursion: so I get What am I do...	[ -0.021484375, 0.0152587890625, -0.0029754638671875, 0.0064697265625, 0.00445556640625, 0.01300048828125, -0.0174560546875, 0.01251220703125, 0.025634765625, 0.00872802734375, 0.0032806396484375, -0.03662109375, 0.0164794921875, 0.0076904296875, -0.004302978515625, -0.0125732421875, 0...	[ 44084, 14602, 1556, 142508, 104250, 903, 18499, 1022, 12, 425, 7, 40858, 33022, 32354, 54744, 731, 55769, 111, 5303, 30646, 370, 99726, 101935, 151, 3714, 831, 50836, 66211, 678, 195625, 1830, 2046, 4865, 444, 20594, 44691 ]	[ 0.130615234375, 0.06982421875, 0.159912109375, 0.236083984375, 0.1739501953125, 0.1319580078125, 0.2254638671875, 0.0953369140625, 0.09100341796875, 0.131591796875, 0.0865478515625, 0.046356201171875, 0.083740234375, 0.125732421875, 0.1092529296875, 0.0299530029296875, 0.094055175781...	embed
29719142_c0	29719142	haskell	0	Title: Do I need to worry about packed primops in GHC? Problem title: Do I need to worry about packed primops in GHC? Tags: performance, haskell Problem: Do I need to worry about packed primops in GHC? There is an additional (internal) layer in GHC which just wraps the primitive known to meet the Int abstraction requir...	Do I need to worry about packed primops in GHC? Do I need to worry about packed primops in GHC? performance haskell GHC CTYPE HsInt Do I need to worry about packed primops in GHC? There is an additional (internal) layer in GHC which just wraps the primitive known to meet the Int abstraction requirements. As a GHC user,...	[ 0.010009765625, -0.000171661376953125, 0.0135498046875, 0.0157470703125, -0.0093994140625, 0.0252685546875, -0.0172119140625, -0.019775390625, 0.0059814453125, -0.005279541015625, 0.01336669921875, -0.02001953125, -0.0125732421875, 0.018798828125, -0.003509521484375, 0.0224609375, 0....	[ 90908, 43824, 297, 10014, 6423, 527, 73265, 23, 23718, 1556, 142508, 27143, 572, 4153, 18, 3871, 78301, 10433, 135355, 137565, 128489, 13, 23356, 360, 164789, 96679, 38937, 84751, 4527, 100094, 16992, 724, 139392, 18151, 4904, 10366 ]	[ 0.03424072265625, 0.1834716796875, 0.037261962890625, 0.1357421875, 0.1295166015625, 0.095947265625, 0.21240234375, 0.042327880859375, 0.1318359375, 0.1107177734375, 0.200439453125, 0.047821044921875, 0.034027099609375, 0.014984130859375, 0.025299072265625, 0.012420654296875, 0.06451...	embed
56870837_c0	56870837	haskell	0	Title: Module export list: how to export imported module? Problem title: Module export list: how to export imported module? Tags: haskell Problem: Module export list: how to export imported module? I can re-export imported module like: module My ( module Another , A ) where import Another But this form will export only...	Module export list: how to export imported module? Module export list: how to export imported module? haskell Another Module Module export list: how to export imported module? I can re-export imported module like: But this form will export only Another and A . How to export anything (all!) and imported module without t...	[ -0.01611328125, -0.00592041015625, -0.0135498046875, 0.0380859375, -0.0028839111328125, 0.002410888671875, -0.002777099609375, 0.0064697265625, 0.02001953125, 0.01202392578125, 0.0010528564453125, -0.016845703125, 0.01202392578125, 0.040283203125, -0.0081787109375, -0.00604248046875, ...	[ 63014, 31255, 5303, 3642, 47, 76242, 71, 88996, 13, 1556, 142508, 116267, 831, 456, 180758, 3173, 4734, 136, 62, 11249, 23937, 5584, 15490, 189085, 756, 214, 26582, 7940, 4568, 24927, 7722, 28271 ]	[ 0.171875, 0.267822265625, 0.156005859375, 0.088134765625, 0.040740966796875, 0.231201171875, 0.1007080078125, 0.249755859375, 0.036407470703125, 0.11181640625, 0.192626953125, 0.16650390625, 0.012481689453125, 0.1082763671875, 0.252197265625, 0.1297607421875, 0.022064208984375, 0.0...	embed
59144172_c0	59144172	haskell	0	Title: Case - why am i getting illegal lambda expression Problem title: Case - why am i getting illegal lambda expression Tags: haskell Problem: Case - why am i getting illegal lambda expression data Nat = Zero \| Succ Nat data NatSig val = NatSig {zero_ :: val, succ :: val -> val} foldNat :: NatSig val -> Nat -> val fo...	Case - why am i getting illegal lambda expression Case - why am i getting illegal lambda expression haskell Case Nat Zero Succ NatSig zero_ Illegal XLambdaCase Case - why am i getting illegal lambda expression Hello this is a code from my University but if i want to run it i get an error some one know why?	[ -0.0277099609375, 0.005096435546875, -0.00970458984375, -0.0027618408203125, 0.0020294189453125, 0.00091552734375, 0.0106201171875, 0.01080322265625, 0.000804901123046875, -0.036865234375, 0.023193359375, -0.0252685546875, -0.00531005859375, 0.004852294921875, 0.0068359375, -0.01867675...	[ 43731, 15400, 444, 17, 20949, 85325, 21, 6492, 85, 125195, 1556, 142508, 68875, 83947, 1832, 10060, 294, 872, 45234, 891, 86966, 60696, 441, 6991, 35378, 18151, 1295, 12535, 3444, 11675, 442, 2046, 18499, 3060, 1632, 3714 ]	[ 0.1986083984375, 0.1431884765625, 0.096435546875, 0.0404052734375, 0.092529296875, 0.190185546875, 0.05963134765625, 0.1781005859375, 0.1654052734375, 0.2008056640625, 0.0770263671875, 0.1885986328125, 0.142822265625, 0.1378173828125, 0.06402587890625, 0.048553466796875, 0.0090637207...	embed
34069245_c0	34069245	haskell	0	Title: Haskell Type class using foldr Problem title: Haskell Type class using foldr Tags: haskell, types, typeclass, list Problem: Haskell Type class using foldr I wrote a function using foldr that determines the length of a list or string. I'm a little confused as to why Haskell determined the type class to be of Num....	Haskell Type class using foldr Haskell Type class using foldr haskell types typeclass list foldr Haskell Type Num Haskell Type class using foldr I wrote a function using foldr that determines the length of a list or string. I'm a little confused as to why Haskell determined the type class to be of Num. Surely strings a...	[ -0.016357421875, 0.01251220703125, 0.004302978515625, 0.021728515625, -0.008056640625, 0.02734375, 0.01019287109375, -0.00092315673828125, 0.00139617919921875, -0.0361328125, -0.02392578125, -0.060546875, 0.007568359375, -0.003509521484375, -0.0142822265625, -0.0076904296875, -0.0191...	[ 20625, 142508, 60457, 18507, 17368, 18344, 7569, 1556, 52895, 10644, 67413, 5303, 52782, 54397, 32354, 83324, 140909, 707, 79315, 10176, 55681, 15400, 71, 47, 186, 111, 18, 99201, 23, 903, 51636, 8110, 221, 23742, 4488, 191147, 4358, 17306 ]	[ 0.14111328125, 0.237060546875, 0.216064453125, 0.2127685546875, 0.06683349609375, 0.1439208984375, 0.2025146484375, 0.1279296875, 0.188720703125, 0.2158203125, 0.1522216796875, 0.1470947265625, 0.2215576171875, 0.041259765625, 0.1546630859375, 0.1114501953125, 0.1373291015625, 0.00...	embed
52245576_c0	52245576	haskell	0	Title: Conditional Cabal Build Flag Failing Problem title: Conditional Cabal Build Flag Failing Tags: cabal, haskell Problem: Conditional Cabal Build Flag Failing I have set the following structure in my project's cabal file: library if flag(no-tracking) hs-source-dirs: src, no-telemetry else hs-source-dirs: src, telem...	Conditional Cabal Build Flag Failing Conditional Cabal Build Flag Failing cabal haskell Conditional Cabal Build Flag Failing Conditional Cabal Build Flag Failing I have set the following structure in my project's cabal file: But I get "can't find source for " errors. I have verified that both hs-source-dirs: src, telem...	[ -0.00347900390625, 0.00518798828125, -0.002288818359375, 0.0107421875, -0.00107574462890625, -0.006927490234375, -0.00009679794311523438, 0.01422119140625, -0.0174560546875, 0.0322265625, 0.0037689208984375, -0.0277099609375, 0.00799560546875, 0.0059814453125, 0.009521484375, 0.0148315...	[ 46347, 43315, 30438, 289, 121137, 125726, 190355, 214, 109524, 1556, 142508, 5423, 25632, 45646, 13452, 11435, 4398, 18, 7413, 31344, 100, 18499, 493, 47314, 1096, 7, 60427, 936, 19437, 5501, 1928, 110, 3025, 1294, 4488, 15490, 35431, 7225, ...	[ 0.1591796875, 0.10577392578125, 0.166259765625, 0.130615234375, 0.135498046875, 0.1888427734375, 0.1693115234375, 0.06689453125, 0.2147216796875, 0.10589599609375, 0.2076416015625, 0.068115234375, 0.0258636474609375, 0.1851806640625, 0.085205078125, 0.063232421875, 0.070556640625, ...	embed
42100206_c0	42100206	haskell	0	Title: Options.Applicative, (<>) and the Monoid type class Problem title: Options.Applicative, (<>) and the Monoid type class Tags: haskell Problem: Options.Applicative, (<>) and the Monoid type class I am learning about Haskell. I am importing the Options.Applicative module, like so: import Options.Applica...	Options.Applicative, (<>) and the Monoid type class Options.Applicative, (<>) and the Monoid type class haskell Options.Applicative qualified Monoid Parser Module Options.Applicative, (<>) and the Monoid type class I am learning about Haskell. I am importing the Options.Applicative module, like so: However,...	[ -0.0123291015625, 0.003936767578125, 0.01031494140625, 0.04541015625, 0.00014495849609375, 0.01953125, 0.0086669921875, -0.0269775390625, -0.0079345703125, 0.00653076171875, 0.004547119140625, -0.009765625, 0.00799560546875, 0.0103759765625, -0.0107421875, -0.00811767578125, -0.00381...	[ 152448, 5, 39179, 11048, 4935, 5386, 136, 77879, 532, 10644, 18507, 1556, 142508, 217225, 2392, 2189, 63014, 52080, 20625, 24927, 214, 88996, 1884, 221, 903, 30646, 4865, 83, 44691, 3293, 209806, 42459, 5608, 7722 ]	[ 0.24658203125, 0.004241943359375, 0.09466552734375, 0.1424560546875, 0.159912109375, 0.01763916015625, 0.0165863037109375, 0.1796875, 0.1368408203125, 0.1202392578125, 0.1639404296875, 0.13623046875, 0.2286376953125, 0.14794921875, 0.06884765625, 0.0751953125, 0.09521484375, 0.0387...	embed
65281573_c0	65281573	haskell	0	Title: How do we partition list in Haskell by a separator element of the list? Problem title: How do we partition list in Haskell by a separator element of the list? Tags: haskell Problem: How do we partition list in Haskell by a separator element of the list? I want to take an Int value and a list that returns a list ...	How do we partition list in Haskell by a separator element of the list? How do we partition list in Haskell by a separator element of the list? haskell How Haskell How do we partition list in Haskell by a separator element of the list? I want to take an Int value and a list that returns a list of lists where the Int va...	[ -0.00299072265625, 0.0054931640625, -0.009521484375, 0.001678466796875, -0.0262451171875, 0.0081787109375, -0.0016021728515625, -0.01019287109375, 0.00136566162109375, 0.0118408203125, -0.0174560546875, 0.008544921875, 0.0002994537353515625, 0.01055908203125, -0.015869140625, -0.008972...	[ 11249, 54, 642, 2878, 1363, 5303, 23, 20625, 142508, 390, 38310, 748, 12830, 111, 1556, 3444, 5646, 360, 18, 34292, 136, 30646, 84797, 142424, 3934, 94407, 27781, 35064, 89536 ]	[ 0.09844970703125, 0.045989990234375, 0.05963134765625, 0.21435546875, 0.166748046875, 0.2315673828125, 0.0653076171875, 0.134521484375, 0.2342529296875, 0.07958984375, 0.174560546875, 0.1427001953125, 0.1458740234375, 0.017791748046875, 0.1138916015625, 0.06610107421875, 0.0511169433...	embed
68429042_c0	68429042	haskell	0	Title: Replace where case of with guards Problem title: Replace where case of with guards Tags: haskell Problem: Replace where case of with guards I have specific situation I've checked a link here and I was wondering if the same strategy could be applied within a where statement in haskell. Suppose I have a function: ...	Replace where case of with guards Replace where case of with guards haskell Replace Func1 Term Foo Func1a Func1b Bar Replace where case of with guards I have specific situation I've checked a link here and I was wondering if the same strategy could be applied within a where statement in haskell. Suppose I have a functi...	[ -0.006591796875, 0.009033203125, 0.0023651123046875, -0.00897216796875, 0.0033416748046875, -0.0001583099365234375, -0.0235595703125, 0.00579833984375, 0.004302978515625, -0.006195068359375, 0.0166015625, 0.00738525390625, 0.0004596710205078125, -0.00173187255859375, 0.0130615234375, -...	[ 853, 23935, 7440, 7225, 111, 678, 56050, 7, 1556, 142508, 28670, 238, 418, 2994, 9572, 31, 11, 275, 3253, 29458, 16648, 12765, 149016, 5701, 113857, 5809, 190659, 28032, 63805, 23, 32354, 3917, 47, 91995, 70 ]	[ 0.0765380859375, 0.1590576171875, 0.2054443359375, 0.217529296875, 0.259765625, 0.12548828125, 0.266845703125, 0.1385498046875, 0.16552734375, 0.2431640625, 0.1392822265625, 0.01300048828125, 0.01141357421875, 0.1094970703125, 0.119384765625, 0.0950927734375, 0.0182342529296875, 0....	embed
58039818_c0	58039818	haskell	0	Title: Data.Text constants in Haskell Problem title: Data.Text constants in Haskell Tags: text, compiler-errors, string, haskell Problem: Data.Text constants in Haskell In the documentation of Data.Text, there are examples such as replace "oo" "foo" "oo" . However, when I try to run this, it tells me that the function ...	Data.Text constants in Haskell Data.Text constants in Haskell text compiler-errors string haskell Data.Text Haskell Data.Text constants in Haskell In the documentation of Data.Text, there are examples such as replace "oo" "foo" "oo" . However, when I try to run this, it tells me that the function replace was expecting ...	[ 0.02783203125, -0.0004825592041015625, -0.006866455078125, 0.022216796875, 0.004058837890625, 0.00067901611328125, -0.006744384765625, -0.01165771484375, -0.01116943359375, 0.001373291015625, -0.0019073486328125, -0.0098876953125, 0.0079345703125, 0.002105712890625, 0.0091552734375, 0....	[ 11809, 174379, 53697, 23, 20625, 142508, 7986, 9969, 34759, 188800, 79315, 1556, 7, 209806, 5, 27781, 91995, 16635, 3584, 31, 9790, 11675, 903, 163, 32354, 41206, 214, 24129, 1284, 4163, 23351, 43824, 12912, 11907, 15504, 5180, 3934, 10644, ...	[ 0.152099609375, 0.255126953125, 0.24365234375, 0.0166473388671875, 0.134521484375, 0.2177734375, 0.2274169921875, 0.09033203125, 0.091064453125, 0.173095703125, 0.16015625, 0.107177734375, 0.056640625, 0.1693115234375, 0.0179901123046875, 0.1680908203125, 0.1876220703125, 0.1765136...	embed
61699509_c0	61699509	haskell	0	Title: Haskell, hGetContents blocking problem (reading more lines) Problem title: Haskell, hGetContents blocking problem (reading more lines) Tags: haskell Problem: Haskell, hGetContents blocking problem (reading more lines) I am writing a TCP client-server and I want to pass more lines from server to client. Server: h...	Haskell, hGetContents blocking problem (reading more lines) Haskell, hGetContents blocking problem (reading more lines) haskell Haskell Haskell, hGetContents blocking problem (reading more lines) I am writing a TCP client-server and I want to pass more lines from server to client. Server: Client: However, I get the mes...	[ -0.0024261474609375, 0.0162353515625, 0.00927734375, -0.010009765625, -0.0089111328125, -0.0072021484375, 0.00537109375, -0.006011962890625, 0.005615234375, -0.0244140625, 0.015869140625, -0.01275634765625, 0.0159912109375, -0.014892578125, 0.0038909912109375, 0.0203857421875, 0.0324...	[ 20625, 142508, 4, 1096, 724, 126, 11935, 25352, 46389, 2967, 39116, 214, 1286, 124519, 1556, 32562, 17854, 23282, 39642, 3444, 27875, 1295, 10723, 47, 22687, 91732, 33306, 2046, 26008, 1284, 7103, 2448, 136, 79315, 64007, 3890, 959, 28412, ...	[ 0.1304931640625, 0.21826171875, 0.000823974609375, 0.0787353515625, 0.09423828125, 0.14013671875, 0.106689453125, 0.1787109375, 0.2274169921875, 0.154296875, 0.1717529296875, 0.0275115966796875, 0.16796875, 0.1700439453125, 0.1141357421875, 0.1201171875, 0.102294921875, 0.188720703...	embed
34257148_c0	34257148	haskell	0	Title: How to detect last chunk in a Haskell Pipe? Problem title: How to detect last chunk in a Haskell Pipe? Tags: haskell, haskell-pipes Problem: How to detect last chunk in a Haskell Pipe? I have a small Haskell Pipe that prints out how many times it has run: counterPipe :: Pipe String String IO r counterPipe = go 0...	How to detect last chunk in a Haskell Pipe? How to detect last chunk in a Haskell Pipe? haskell haskell-pipes How Haskell Pipe Chunk How to detect last chunk in a Haskell Pipe? I have a small Haskell Pipe that prints out how many times it has run: I'd like to be able to print out a message, and potentially perform othe...	[ -0.00106048583984375, 0.004547119140625, 0.006195068359375, 0.0157470703125, -0.0157470703125, 0.012451171875, -0.011962890625, -0.027099609375, -0.01806640625, -0.0016632080078125, -0.005126953125, -0.0074462890625, 0.03076171875, 0.02490234375, 0.01708984375, 0.003387451171875, -0....	[ 11249, 47, 96391, 4568, 7839, 92, 23, 20625, 142508, 93128, 13, 1556, 1434, 13569, 112204, 10, 765, 19336, 28412, 1810, 3642, 5941, 20028, 11675, 1884, 19048, 26008, 38516, 51339, 3789, 66211, 24145, 9433, 903 ]	[ 0.080322265625, 0.06475830078125, 0.2139892578125, 0.225341796875, 0.2047119140625, 0.13232421875, 0.06744384765625, 0.13525390625, 0.2286376953125, 0.152587890625, 0.1004638671875, 0.1258544921875, 0.09906005859375, 0.05938720703125, 0.1859130859375, 0.000244140625, 0.00167846679687...	embed
34474655_c0	34474655	haskell	0	Title: How to write inline YAML (flow style) in Haskell? Problem title: How to write inline YAML (flow style) in Haskell? Tags: pretty-print, yaml, aeson, haskell Problem: How to write inline YAML (flow style) in Haskell? I'm using Data.Yaml to store some data in human readable format. However, some parts of the data a...	How to write inline YAML (flow style) in Haskell? How to write inline YAML (flow style) in Haskell? pretty-print yaml aeson haskell How YAML Haskell Data.Yaml How to write inline YAML (flow style) in Haskell? I'm using Data.Yaml to store some data in human readable format. However, some parts of the data are lists or m...	[ 0.006500244140625, -0.01300048828125, 0.015869140625, -0.0147705078125, 0.006378173828125, -0.0128173828125, 0.0098876953125, -0.02197265625, -0.007659912109375, 0.024658203125, 0.005523681640625, 0.00653076171875, 0.009765625, -0.01220703125, -0.004364013671875, -0.005279541015625, ...	[ 11249, 47, 33022, 23, 2256, 3320, 39456, 118664, 20623, 20625, 142508, 28875, 35662, 151, 7237, 90, 191, 1556, 11809, 21566, 17368, 5, 4343, 2053, 14135, 12301, 9384, 63920, 5303, 50944, 101935, 140992, 46389, 40, 944, 32233, 57823, 175399, ...	[ 0.0909423828125, 0.040008544921875, 0.1990966796875, 0.1107177734375, 0.2227783203125, 0.19384765625, 0.279052734375, 0.2484130859375, 0.240966796875, 0.1541748046875, 0.25146484375, 0.131591796875, 0.1279296875, 0.166259765625, 0.24853515625, 0.00897216796875, 0.0836181640625, 0.1...	embed
37865083_c0	37865083	haskell	0	Title: Mapping Over Either Problem title: Mapping Over Either Tags: haskell Problem: Mapping Over Either Why doesn't the case with (-1) work here: λ> (+1) <$> Right 10 Right 11 Prelude λ> (-1) <$> Right 10 <interactive>:22:1: error: • Non type-variable argument in the constraint: Num (a -> b) (Use FlexibleContexts to p...	Mapping Over Either Mapping Over Either haskell Mapping Over Either Right Prelude Non Num Use FlexibleContexts When Mapping Over Either Why doesn't the case with (-1) work here:	[ -0.01019287109375, 0.0128173828125, 0.0162353515625, -0.01806640625, -0.006317138671875, 0.01251220703125, -0.009033203125, -0.015625, 0.015625, -0.004364013671875, -0.00592041015625, -0.032470703125, -0.00140380859375, 0.000637054443359375, -0.003387451171875, -0.0283203125, -0.0050...	[ 911, 26783, 9578, 4565, 9319, 1556, 142508, 90911, 1914, 822, 3775, 52782, 36836, 180842, 2661, 11935, 22829, 14847, 44084, 22027, 18, 7225, 678, 15, 110218, 4488, 3688 ]	[ 0.1820068359375, 0.161865234375, 0.206298828125, 0.1033935546875, 0.1944580078125, 0.124755859375, 0.232421875, 0.111572265625, 0.03582763671875, 0.124267578125, 0.09912109375, 0.151123046875, 0.052947998046875, 0.1724853515625, 0.1552734375, 0.040130615234375, 0.1734619140625, 0.0...	embed
29060916_c1	29060916	haskell	1	Rules r) -- \| Print gramma showGramma :: GrammaStruct -> IO () showGramma gr = do putStrLn $ show gr -- \| Transforms string given from file of stdin into gramma representation in app getGramma :: String -> GrammaStruct getGramma hIn = procLns (lines hIn) -- \| Depending on option given, provides required functionality d...	Rules r) -- \| Print gramma showGramma :: GrammaStruct -> IO () showGramma gr = do putStrLn $ show gr -- \| Transforms string given from file of stdin into gramma representation in app getGramma :: String -> GrammaStruct getGramma hIn = procLns (lines hIn) -- \| Depending on option given, provides required functionality d...	[ 0.005767822265625, 0.0142822265625, -0.0020904541015625, 0.018310546875, -0.00775146484375, 0.0194091796875, 0.006561279296875, -0.0037078857421875, 0.01324462890625, 0.0093994140625, -0.0004482269287109375, -0.00958251953125, -0.0172119140625, -0.00179290771484375, -0.0027313232421875, ...	[ 139118, 7, 1690, 58745, 39754, 122092, 11, 7639, 37878, 18023, 48078, 192, 71713, 18190, 18, 17780, 4452, 2203, 54, 3884, 866, 19, 3650, 11062, 5037, 79315, 34475, 1295, 11435, 6138, 3035, 3934, 18811, 4027, 2046, 23351, 214, 4153, 10402, ...	[ 0.2244873046875, 0.06280517578125, 0.10009765625, 0.0064697265625, 0.22802734375, 0.2445068359375, 0.161865234375, 0.1759033203125, 0.2105712890625, 0.17822265625, 0.1533203125, 0.1185302734375, 0.14208984375, 0.10345458984375, 0.01220703125, 0.172607421875, 0.1566162109375, 0.0272...	embed
29220765_c0	29220765	haskell	0	Title: How to implement rotate function on infinite lists? Problem title: How to implement rotate function on infinite lists? Tags: haskell, infinite-loop Problem: How to implement rotate function on infinite lists? I try to implement rotate function, which can work with infinite lists. I have problem with infinite lis...	How to implement rotate function on infinite lists? How to implement rotate function on infinite lists? haskell infinite-loop How How to implement rotate function on infinite lists? I try to implement rotate function, which can work with infinite lists. I have problem with infinite lists . My function is: I try use my ...	[ -0.0087890625, -0.008544921875, 0.0166015625, -0.007476806640625, -0.0240478515625, -0.00183868408203125, 0.0023193359375, 0.006591796875, -0.003204345703125, -0.039306640625, -0.0003719329833984375, 0.0003795623779296875, 0.0022735595703125, -0.004669189453125, -0.0003223419189453125, ...	[ 11249, 47, 29479, 47014, 67, 32354, 98, 54241, 13, 5303, 7, 1556, 142508, 28354, 9790, 4488, 678, 2967, 4527, 237, 87, 3444, 2046, 378, 963, 4, 534 ]	[ 0.0711669921875, 0.04736328125, 0.188720703125, 0.2196044921875, 0.2042236328125, 0.203369140625, 0.09423828125, 0.166015625, 0.0953369140625, 0.2120361328125, 0.05426025390625, 0.1265869140625, 0.2100830078125, 0.1990966796875, 0.043243408203125, 0.0204620361328125, 0.0361328125, ...	embed
21319196_c0	21319196	haskell	0	Title: Type error in generator , haskell list using tuple Problem title: Type error in generator , haskell list using tuple Tags: list, haskell, tuples Problem: Type error in generator , haskell list using tuple Currently working with Haskell on a function that takes a String in parameters and return a list of (Char, I...	Type error in generator , haskell list using tuple Type error in generator , haskell list using tuple list haskell tuples tuple Type occur::Eq x:xs word::String ERROR file.hs Term Char Does Type error in generator , haskell list using tuple Currently working with Haskell on a function that takes a String in parameters ...	[ -0.0020599365234375, -0.005889892578125, -0.004425048828125, -0.003753662109375, 0.008056640625, -0.012451171875, -0.0031585693359375, -0.0125732421875, -0.00811767578125, -0.036865234375, -0.0037384033203125, -0.0028076171875, 0.0205078125, 0.017578125, -0.0050048828125, -0.0154418945...	[ 60457, 18499, 145823, 1556, 142508, 5303, 17368, 370, 8705, 23, 99726, 74918, 864, 1022, 425, 2565, 71713, 214, 151206, 24638, 11435, 127, 2994, 21656, 101790, 20697, 20625, 32354, 51776, 23351, 171859, 30646, 84068, 18, 43240, 678, 48716, 10...	[ 0.252685546875, 0.215576171875, 0.2322998046875, 0.1043701171875, 0.17578125, 0.145263671875, 0.0537109375, 0.09423828125, 0.1646728515625, 0.0232086181640625, 0.14111328125, 0.22509765625, 0.0869140625, 0.016448974609375, 0.0096435546875, 0.17626953125, 0.07568359375, 0.0306701660...	embed
60773572_c0	60773572	haskell	0	Title: How to change/extract the value of part of a manually defined datatype? Problem title: How to change/extract the value of part of a manually defined datatype? Tags: data-manipulation, types, haskell Problem: How to change/extract the value of part of a manually defined datatype? Say I have the following datatype...	How to change/extract the value of part of a manually defined datatype? How to change/extract the value of part of a manually defined datatype? data-manipulation types haskell How MyType Element1 Maybe Element2 instance1 Just instance2 How to change/extract the value of part of a manually defined datatype? Say I have t...	[ -0.005889892578125, -0.009033203125, 0.01507568359375, 0.00836181640625, 0.00701904296875, 0.023193359375, -0.0245361328125, 0.00640869140625, 0.0107421875, -0.01446533203125, 0.0027618408203125, 0.00775146484375, -0.01416015625, 0.01531982421875, 0.0218505859375, -0.00469970703125, ...	[ 11249, 47, 15549, 64, 112779, 15390, 34292, 2831, 23009, 61924, 2053, 50986, 32, 9051, 254, 72403, 52895, 1556, 142508, 2646, 196707, 48325, 418, 83425, 304, 110527, 9563, 25632, 4865, 831, 4527, 3687, 32354, 221, 127794, 4958 ]	[ 0.09979248046875, 0.054473876953125, 0.2369384765625, 0.0802001953125, 0.2091064453125, 0.1473388671875, 0.1973876953125, 0.1519775390625, 0.1607666015625, 0.18310546875, 0.120849609375, 0.29541015625, 0.00067138671875, 0.02020263671875, 0.09002685546875, 0.0941162109375, 0.164550781...	embed
23316255_c1	23316255	haskell	1	a) Nothing Just b = Just (Right b) Just a Just b = Just (Left a) -- ick, but it does satisfy the laws instance PtS [] where unit = [] xs ** ys = map Left xs ++ map Right ys It seems like turning sum into other monoidal structures is made less interesting by unit :: Void -> f Void being uniquely determined, so yo...	a) Nothing Just b = Just (Right b) Just a Just b = Just (Left a) -- ick, but it does satisfy the laws instance PtS [] where unit = [] xs ** ys = map Left xs ++ map Right ys It seems like turning sum into other monoidal structures is made less interesting by unit :: Void -> f Void being uniquely determined, so yo...	[ 0.006927490234375, 0.01177978515625, 0.0032958984375, -0.011962890625, -0.0035247802734375, 0.01025390625, -0.004669189453125, -0.0203857421875, 0.006134033203125, 0.0185546875, 0.01141357421875, -0.017822265625, -0.00531005859375, -0.01263427734375, -0.0177001953125, -0.00570678710937...	[ 10, 182747, 16459, 9563, 876, 2203, 1052, 22553, 2480, 2594, 1284, 14602, 40407, 53, 131703, 110527, 436, 18, 294, 25072, 1022, 7, 113, 22288, 37223, 90911, 37202, 174548, 10554, 3934, 3789, 22460, 14, 2465, 45646, 40715, 49041, 22591, 71, ...	[ 0.06298828125, 0.1829833984375, 0.03082275390625, 0.1533203125, 0.1170654296875, 0.052947998046875, 0.001861572265625, 0.05792236328125, 0.0946044921875, 0.0958251953125, 0.01092529296875, 0.007568359375, 0.1279296875, 0.01068115234375, 0.1436767578125, 0.112060546875, 0.045318603515...	embed
38425796_c0	38425796	haskell	0	Title: What is going on in this let expression? Problem title: What is going on in this let expression? Tags: haskell, let, syntax Problem: What is going on in this let expression? I am reading through this blog post about writing an API in Haskell with Scotty, and I came across the section on monad transformers. I und...	What is going on in this let expression? What is going on in this let expression? haskell let syntax What What is going on in this let expression? I am reading through this blog post about writing an API in Haskell with Scotty, and I came across the section on monad transformers. I understand the concept of monad trans...	[ -0.00150299072265625, 0.01019287109375, 0.0206298828125, 0.006622314453125, 0.02734375, -0.011474609375, -0.00958251953125, 0.00121307373046875, -0.00286865234375, -0.0140380859375, -0.0034942626953125, 0.00927734375, 0.0000782012939453125, -0.00897216796875, 0.01171875, -0.00494384765...	[ 4865, 83, 7730, 98, 23, 903, 2633, 125195, 1556, 142508, 6002, 86531, 32562, 61687, 20625, 678, 50695, 53, 2667, 712, 27198, 1314, 28219, 23755, 53418, 137565, 10336, 3688, 91067, 347, 159978, 5701, 4527 ]	[ 0.0855712890625, 0.0765380859375, 0.1263427734375, 0.1273193359375, 0.10284423828125, 0.1134033203125, 0.2469482421875, 0.25341796875, 0.10791015625, 0.2215576171875, 0.04608154296875, 0.1182861328125, 0.03009033203125, 0.1251220703125, 0.0989990234375, 0.01953125, 0.057861328125, ...	embed
52608452_c0	52608452	haskell	0	Title: How to compare two UTCTime values and get the difference in days? Problem title: How to compare two UTCTime values and get the difference in days? Tags: time, haskell, haskell-stack Problem: How to compare two UTCTime values and get the difference in days? I want to take away from UTCTime - UTCTime. I found the ...	How to compare two UTCTime values and get the difference in days? How to compare two UTCTime values and get the difference in days? time haskell haskell-stack How UTCTime NominalDiffTime How to compare two UTCTime values and get the difference in days? I want to take away from UTCTime - UTCTime. I found the following f...	[ 0.0025482177734375, 0.00836181640625, -0.0057373046875, 0.019775390625, 0.00738525390625, -0.0166015625, 0.00174713134765625, 0.0157470703125, 0.005279541015625, -0.033203125, -0.001922607421875, -0.00124359130859375, -0.003143310546875, 0.00482177734375, -0.0027923583984375, -0.010314...	[ 11249, 47, 69101, 6626, 99577, 70059, 142424, 136, 2046, 70, 60212, 23, 13312, 1733, 1556, 142508, 590, 2594, 438, 1249, 289, 397, 32920, 3444, 5646, 16065, 14037, 25632, 32354, 71337, 45962, 1984, 3871, 903, 109650, 7763, 4233, 2271, 6468,...	[ 0.07427978515625, 0.043182373046875, 0.216552734375, 0.1168212890625, 0.2181396484375, 0.2626953125, 0.161376953125, 0.0280609130859375, 0.08404541015625, 0.0220947265625, 0.2073974609375, 0.075927734375, 0.1798095703125, 0.1005859375, 0.06707763671875, 0.17431640625, 0.04736328125, ...	embed
27648229_c0	27648229	haskell	0	Title: Ambiguous occurrence of == when creating a type as an instance of Eq Problem title: Ambiguous occurrence of == when creating a type as an instance of Eq Tags: haskell, operator-overloading Problem: Ambiguous occurrence of == when creating a type as an instance of Eq From Learn You a Haskell for Great Good : clas...	Ambiguous occurrence of == when creating a type as an instance of Eq Ambiguous occurrence of == when creating a type as an instance of Eq haskell operator-overloading Ambiguous Eq1 Bool TrafficLight Red Yellow Green baby.hs:213:9 Main baby.hs:225:5 Prelude baby.hs:1:1 GHC.Classes Ambiguous occurrence of == when creatin...	[ 0.008544921875, 0.01239013671875, 0.004150390625, 0.02294921875, 0.0159912109375, -0.005462646484375, 0.0031585693359375, 0.010009765625, 0.003021240234375, 0.003936767578125, 0.007110595703125, -0.007110595703125, 0.01953125, -0.004791259765625, -0.004974365234375, -0.003662109375, ...	[ 10250, 12282, 10821, 74918, 42, 69112, 3229, 105233, 10644, 237, 142, 110527, 241, 864, 6620, 1556, 142508, 39933, 5465, 63033, 2460, 929, 180952, 187459, 6096, 146762, 15497, 15546, 127, 7, 363, 1126, 12321, 5, 144025, 758, 1914, 822, 112,...	[ 0.1507568359375, 0.2064208984375, 0.05670166015625, 0.1309814453125, 0.0994873046875, 0.287353515625, 0.009521484375, 0.156005859375, 0.22314453125, 0.042510986328125, 0.03271484375, 0.143310546875, 0.038848876953125, 0.20654296875, 0.0009765625, 0.0989990234375, 0.2159423828125, 0...	embed
41619756_c2	41619756	haskell	2	swappable" Swappable integers are two integers that, when concatenated, are prime. Any new sets created with n are returned check ::[[Integer]] -> Integer -> Code signals: Data.List, System.Random, qualified, probablistic, Data.Set, Intersect, Intersection, Runtime, S.intersection, S.fromList, Check, Swappable, Any, In...	swappable" Swappable integers are two integers that, when concatenated, are prime. Any new sets created with n are returned check ::[[Integer]] -> Integer -> Code signals: Data.List, System.Random, qualified, probablistic, Data.Set, Intersect, Intersection, Runtime, S.intersection, S.fromList, Check, Swappable, Any, In...	[ -0.01806640625, -0.00017261505126953125, 0.01324462890625, 0.01434326171875, -0.0067138671875, -0.00537109375, -0.00982666015625, -0.00830078125, 0.01141357421875, -0.000843048095703125, 0.01287841796875, 0.0177001953125, 0.006988525390625, -0.010986328125, -0.00946044921875, 0.0066528...	[ 202317, 254, 2886, 58, 43062, 6366, 892, 26255, 621, 6626, 450, 3229, 158, 4460, 33, 27686, 20809, 28541, 3525, 5423, 75935, 678, 653, 176377, 12765, 4153, 67, 1505, 44401, 28864, 26073, 7, 11809, 154663, 12353, 126525, 3815, 217225, 21652,...	[ 0.298095703125, 0.2294921875, 0.31201171875, 0.048583984375, 0.286865234375, 0.2744140625, 0.2359619140625, 0.2012939453125, 0.150390625, 0.176513671875, 0.03375244140625, 0.0875244140625, 0.12353515625, 0.157470703125, 0.1273193359375, 0.039703369140625, 0.261962890625, 0.10119628...	embed
46315857_c0	46315857	haskell	0	Title: Instance Declarations Problem title: Instance Declarations Tags: haskell Problem: Instance Declarations Bit curious why the instance declaration is needed in the following as a default implementation is provided. module Example where class Eq a => EQ a where eq :: a -> a -> Bool eq = (==) -- why is this instance...	Instance Declarations Instance Declarations haskell Instance Declarations Example Bool Instance Declarations Bit curious why the instance declaration is needed in the following as a default implementation is provided. If I leave out the instance declaration I get an error. I'm sure it's explained somewhere in the Haske...	[ 0.01556396484375, 0.01141357421875, 0.0164794921875, 0.00762939453125, -0.00634765625, 0.0203857421875, -0.004608154296875, -0.02392578125, 0.00144195556640625, 0.00982666015625, -0.01312255859375, -0.01043701171875, -0.007659912109375, 0.0185546875, 0.0024871826171875, 0.0039672851562...	[ 360, 116071, 98501, 5256, 1556, 142508, 89536, 2460, 929, 193844, 15400, 70, 110527, 21635, 1363, 83, 44841, 25632, 237, 10, 114977, 208124, 62952, 31358, 1810, 18499, 189050, 20625, 13416, 12960, 7413 ]	[ 0.07012939453125, 0.2467041015625, 0.24072265625, 0.05462646484375, 0.116943359375, 0.24169921875, 0.0841064453125, 0.092529296875, 0.19287109375, 0.06854248046875, 0.09716796875, 0.0386962890625, 0.29345703125, 0.2349853515625, 0.09375, 0.076416015625, 0.189697265625, 0.1268310546...	embed
79443400_c0	79443400	haskell	0	Title: "conflicting types for 'SDL_main'" while trying to install the sdl2-image haskell module with stack Problem title: "conflicting types for 'SDL_main'" while trying to install the sdl2-image haskell module with stack Tags: c, sdl, haskell Problem: "conflicting types for 'SDL...	"conflicting types for 'SDL_main'" while trying to install the sdl2-image haskell module with stack "conflicting types for 'SDL_main'" while trying to install the sdl2-image haskell module with stack c sdl haskell macro SDL_main sdl2-image Image.hsc:77:5 Users AppData Local Progr...	[ 0.0159912109375, -0.01007080078125, 0.0072021484375, 0.0157470703125, -0.0030975341796875, -0.005462646484375, -0.003021240234375, -0.000774383544921875, -0.02294921875, 0.013427734375, 0.003936767578125, -0.01312255859375, 0.01361083984375, -0.01104736328125, 0.017578125, 0.0016403198...	[ 2271, 134225, 214, 52895, 100, 3768, 294, 27502, 24931, 31577, 20600, 91, 20469, 18504, 37926, 1556, 142508, 88996, 678, 177261, 501, 111789, 159, 22710, 10382, 14546, 53400, 5659, 137989, 24172, 7663, 15276, 13307, 229792, 94924, 304, 2357, ...	[ 0.111572265625, 0.23681640625, 0.1259765625, 0.2431640625, 0.0285797119140625, 0.049346923828125, 0.05413818359375, 0.1995849609375, 0.18798828125, 0.074951171875, 0.126708984375, 0.07281494140625, 0.1624755859375, 0.202880859375, 0.1680908203125, 0.09979248046875, 0.225341796875, ...	embed
65257586_c1	65257586	haskell	1	),e)] e1) = eval env' e1 where env' = env ++ map (\(v,e) -> (v, eval env' e)) [(x,e)] This is my test function I want to evaluate: t1 = LetRec [ (("not", INT:->INT), Lam ("i",INT) $ If (Var "i") (Val 0) (Val 1)) , (("even", INT:->INT), Lam ("i",INT) $ If (Var "i") (App (Var "not") (App (Var "odd") (Var "i" `Add` Val (-...	),e)] e1) = eval env' e1 where env' = env ++ map (\(v,e) -> (v, eval env' e)) [(x,e)] This is my test function I want to evaluate: t1 = LetRec [ (("not", INT:->INT), Lam ("i",INT) $ If (Var "i") (Val 0) (Val 1)) , (("even", INT:->INT), Lam ("i",INT) $ If (Var "i") (App (Var "not") (App (Var "odd") (Var "i" `Add` Val (-...	[ -0.00390625, 0.01416015625, 0.0128173828125, 0.0101318359375, 0.023193359375, 0.006072998046875, -0.0157470703125, 0.0167236328125, 0.01202392578125, -0.005401611328125, -0.01263427734375, 0.0174560546875, 0.0162353515625, 0.01373291015625, 0.0299072265625, -0.0036773681640625, -0.01...	[ 247, 13, 16, 268, 28, 17727, 2203, 1405, 22, 334, 25, 418, 37223, 22288, 33079, 425, 3293, 759, 3034, 32354, 3444, 151575, 808, 10842, 4332, 238, 10869, 830, 59537, 103607, 59387, 14, 3650, 4263, 15, 81827, 18939, 42272, 757, 4879, 4, ...	[ 0.043182373046875, 0.1085205078125, 0.030120849609375, 0.0141143798828125, 0.1549072265625, 0.1767578125, 0.0751953125, 0.25244140625, 0.113525390625, 0.224609375, 0.09814453125, 0.1776123046875, 0.1575927734375, 0.1353759765625, 0.02410888671875, 0.02764892578125, 0.00518798828125, ...	embed
59275883_c0	59275883	haskell	0	Title: Reverse own list a more optimal way Problem title: Reverse own list a more optimal way Tags: haskell Problem: Reverse own list a more optimal way Tried to mimic the reverse function to the ADT List below, data List a = Nil \| Cons a (List a) deriving (Show) reverseList = convert . reverse' where reverse' Nil = []...	Reverse own list a more optimal way Reverse own list a more optimal way haskell Reverse List Nil Cons Show x:xs Reverse own list a more optimal way Tried to mimic the reverse function to the ADT List below, The reverseList is composed of convert and reverse' , how to achieve it optimally for instance without the aid of...	[ -0.0164794921875, 0.032958984375, 0.01324462890625, 0.006988525390625, -0.009033203125, -0.007232666015625, 0.0025482177734375, -0.01025390625, 0.01513671875, 0.007659912109375, 0.004730224609375, 0.0146484375, 0.0303955078125, 0.006378173828125, -0.00732421875, 0.0169677734375, 0.02...	[ 853, 37676, 10002, 5303, 1286, 24087, 3917, 1556, 142508, 32036, 77175, 39215, 17367, 1022, 425, 4699, 324, 21068, 39531, 184, 32354, 62, 41072, 35064, 154663, 150350, 111, 96760, 136, 3642, 69307, 15490, 36442, 88303, 73 ]	[ 0.09423828125, 0.28857421875, 0.1885986328125, 0.2412109375, 0.1058349609375, 0.201904296875, 0.0831298828125, 0.1129150390625, 0.1903076171875, 0.2196044921875, 0.175048828125, 0.2000732421875, 0.1231689453125, 0.0227203369140625, 0.053985595703125, 0.06304931640625, 0.0671997070312...	embed
60492776_c0	60492776	haskell	0	Title: How can I make a map of lists in Haskell? Problem title: How can I make a map of lists in Haskell? Tags: haskell Problem: How can I make a map of lists in Haskell? I have a list of key-value pairs that I want to reduce. So given [("a", 2), ("b", 3), ("a", 4)] , I want to produce Map ("a", [2, 4]), ("b", [3]) . I...	How can I make a map of lists in Haskell? How can I make a map of lists in Haskell? haskell How Haskell Map Data.Map.fromListWith Data.List.insert How can I make a map of lists in Haskell? I have a list of key-value pairs that I want to reduce. So given [("a", 2), ("b", 3), ("a", 4)] , I want to produce Map ("a", [2, 4...	[ -0.01129150390625, -0.00677490234375, -0.0030975341796875, 0.0012969970703125, -0.025634765625, 0.006927490234375, -0.0120849609375, 0.000919342041015625, 0, -0.01611328125, 0.0113525390625, 0.00008106231689453125, 0.0283203125, 0.0159912109375, -0.0152587890625, 0.001708984375, -0.0...	[ 11249, 831, 3249, 10, 22288, 111, 5303, 7, 23, 20625, 142508, 87, 1556, 42719, 11809, 166179, 161063, 154663, 194583, 73, 33657, 22799, 27494, 80836, 3444, 47, 34390, 34475, 4958, 275, 8439, 13956, 27489, 11, 304, 201, 14037, 47644, 1295, ...	[ 0.092529296875, 0.085205078125, 0.133056640625, 0.0947265625, 0.27880859375, 0.1558837890625, 0.2705078125, 0.10302734375, 0.07806396484375, 0.177001953125, 0.265380859375, 0.04144287109375, 0.1502685546875, 0.25732421875, 0.1304931640625, 0.210693359375, 0.1346435546875, 0.2296142...	embed
21192268_c1	21192268	haskell	1	.2 using version 1.16.0 of the Cabal library GHC version: $ ghc --version The Glorious Glasgow Haskell Compilation System, version 7.6.3 Some of the tutorials mention using a cabal sandbox, but my version of cabal (1.16) is too old for that. If the sandbox is likely too help I'll try and get that working (had a little ...	.2 using version 1.16.0 of the Cabal library GHC version: $ ghc --version The Glorious Glasgow Haskell Compilation System, version 7.6.3 Some of the tutorials mention using a cabal sandbox, but my version of cabal (1.16) is too old for that. If the sandbox is likely too help I'll try and get that working (had a little ...	[ -0.0057373046875, 0.024169921875, 0.002471923828125, 0.008544921875, -0.0162353515625, 0.0137939453125, -0.01544189453125, -0.00811767578125, -0.0257568359375, -0.00099945068359375, -0.0247802734375, -0.03955078125, -0.00131988525390625, 0.00958251953125, 0.01043701171875, -0.004302978...	[ 6, 5, 304, 17368, 11389, 615, 2485, 2389, 30438, 289, 35773, 1294, 527, 73265, 3650, 31380, 238, 46354, 46173, 93905, 181787, 20625, 142508, 15612, 14, 57860, 12353, 2861, 200768, 57143, 109524, 19096, 11728, 2858, 60978, 5792, 10332, 70, 8...	[ 0.028533935546875, 0.12841796875, 0.2127685546875, 0.09814453125, 0.16796875, 0.0828857421875, 0.200439453125, 0.1527099609375, 0.1712646484375, 0.1875, 0.1414794921875, 0.048980712890625, 0.05999755859375, 0.18603515625, 0.085693359375, 0.085205078125, 0.09228515625, 0.10729980468...	embed
7523151_c0	7523151	haskell	0	Title: Hoogle data on Windows Problem title: Hoogle data on Windows Tags: haskell, haskell-platform Problem: Hoogle data on Windows I can install hoogle using cabal install hoogle on Windows, however, when I run hoogle data from MinGW shell, I encounter the following error: $ hoogle data Extracting tarball... gzip: ..\...	Hoogle data on Windows Hoogle data on Windows haskell haskell-platform Hoogle Windows Extracting hackage-cabal.tar.gz hoogle.exe System hackage-cabal.ta r.gz Hoogle data on Windows I can install hoogle using cabal install hoogle on Windows, however, when I run hoogle data from MinGW shell, I encounter the following err...	[ 0.025390625, 0.006683349609375, 0.00909423828125, 0.005523681640625, 0.00390625, 0.01507568359375, 0.010498046875, -0.004669189453125, 0.003082275390625, -0.00689697265625, -0.003021240234375, -0.0272216796875, 0.0089111328125, 0.00848388671875, 0.0038604736328125, 0.01141357421875, ...	[ 152488, 133, 2053, 98, 3773, 1556, 142508, 172121, 31501, 85526, 4588, 408, 3571, 867, 177, 28994, 46480, 12353, 102, 831, 20600, 109524, 11675, 1295, 4211, 102550, 128019, 190647, 25632, 18499, 72546 ]	[ 0.234375, 0.292724609375, 0.1732177734375, 0.07940673828125, 0.204833984375, 0.0980224609375, 0.2073974609375, 0.103759765625, 0.09814453125, 0.17236328125, 0.1070556640625, 0.0498046875, 0.159423828125, 0.0885009765625, 0.004974365234375, 0.2147216796875, 0.0931396484375, 0.053710...	embed
47512813_c0	47512813	haskell	0	Title: unixODBC: invalid handle when handle is allocated in a Haskell thread Problem title: unixODBC: invalid handle when handle is allocated in a Haskell thread Tags: odbc, multithreading, haskell, unixodbc Problem: unixODBC: invalid handle when handle is allocated in a Haskell thread I am building an ODBC application...	unixODBC: invalid handle when handle is allocated in a Haskell thread unixODBC: invalid handle when handle is allocated in a Haskell thread odbc multithreading haskell unixodbc Haskell unixODBC: invalid handle when handle is allocated in a Haskell thread I am building an ODBC application in Haskell, using foreign calls...	[ 0.020751953125, 0.01904296875, -0.0078125, -0.00118255615234375, -0.01177978515625, -0.0032806396484375, 0.00994873046875, -0.01513671875, -0.001007080078125, -0.051513671875, 0.01287841796875, -0.03173828125, 0.0194091796875, -0.011962890625, -0.0103759765625, -0.01092529296875, 0.0...	[ 51, 4084, 43740, 24318, 56649, 34831, 3229, 144, 116292, 20625, 142508, 86997, 23, 229, 65037, 3869, 65847, 11, 1556, 33976, 34687, 38415, 17368, 110613, 11782, 159029, 32354, 100, 92, 17780, 7285, 99091, 167457, 98, 5701, 70, 30646, 18499, ...	[ 0.08740234375, 0.051361083984375, 0.1141357421875, 0.22705078125, 0.265625, 0.278076171875, 0.0587158203125, 0.08502197265625, 0.186767578125, 0.1180419921875, 0.2369384765625, 0.1888427734375, 0.05621337890625, 0.1434326171875, 0.21728515625, 0.055389404296875, 0.1207275390625, 0....	embed
77398398_c0	77398398	haskell	0	Title: Remove duplicates of a Data.Sequence Problem title: Remove duplicates of a Data.Sequence Tags: unique, haskell, containers Problem: Remove duplicates of a Data.Sequence I have a sequence Seq a with Eq a and I want to remove the duplicates inside this sequence. I do fromList $ nub $ toList mysequence Is there a m...	Remove duplicates of a Data.Sequence Remove duplicates of a Data.Sequence unique haskell containers Remove Data.Sequence Seq Edge Show Read Bool Remove duplicates of a Data.Sequence I have a sequence Seq a with Eq a and I want to remove the duplicates inside this sequence. I do Is there a more efficient way? This is a ...	[ -0.007568359375, 0.0341796875, 0.0205078125, -0.0040283203125, 0.02099609375, -0.003997802734375, -0.004364013671875, 0.01025390625, -0.0167236328125, -0.02880859375, -0.021240234375, 0.0205078125, 0.0118408203125, 0.01513671875, -0.00946044921875, 0.016357421875, -0.012939453125, ...	[ 181139, 171763, 1636, 111, 11809, 5, 4233, 944, 3956, 36998, 1556, 142508, 116419, 503, 864, 69030, 17367, 4764, 2460, 929, 10, 87, 765, 40, 678, 3444, 47, 87388, 70, 46132, 903, 54, 1286, 93766, 3917, 3293 ]	[ 0.1702880859375, 0.2705078125, 0.1593017578125, 0.08740234375, 0.1444091796875, 0.0521240234375, 0.1060791015625, 0.1572265625, 0.09619140625, 0.166259765625, 0.1402587890625, 0.2081298828125, 0.1956787109375, 0.100341796875, 0.1922607421875, 0.178955078125, 0.0975341796875, 0.1132...	embed
30002615_c0	30002615	haskell	0	Title: Writing own repeat function in Haskell: getting error C stack overflow Problem title: Writing own repeat function in Haskell: getting error C stack overflow Tags: stack-overflow, haskell Problem: Writing own repeat function in Haskell: getting error C stack overflow When I'm trying to write repeat in Haskell, th...	Writing own repeat function in Haskell: getting error C stack overflow Writing own repeat function in Haskell: getting error C stack overflow stack-overflow haskell Writing Haskell Writing own repeat function in Haskell: getting error C stack overflow When I'm trying to write repeat in Haskell, the ERROR - C stack over...	[ 0.0023193359375, 0.0245361328125, 0.00634765625, 0.0137939453125, 0.0068359375, -0.0021514892578125, -0.0174560546875, -0.00970458984375, 0.00677490234375, -0.0306396484375, -0.0020599365234375, -0.00726318359375, 0.0169677734375, 0.012451171875, 0.01708984375, -0.00015544891357421875,...	[ 213185, 10002, 119140, 32354, 20625, 142508, 20949, 18499, 313, 177261, 645, 118664, 5465, 1556, 31577, 33022, 23, 151206, 24638, 7426, 1257, 107419, 7108, 3917, 26458, 15400, 96276, 44691, 5117 ]	[ 0.1627197265625, 0.154052734375, 0.26416015625, 0.1485595703125, 0.118408203125, 0.223876953125, 0.06317138671875, 0.19580078125, 0.148193359375, 0.1732177734375, 0.129150390625, 0.2452392578125, 0.1015625, 0.09765625, 0.1051025390625, 0.1624755859375, 0.029541015625, 0.13134765625...	embed
13814274_c0	13814274	haskell	0	Title: Snap: correct use of PreRun hook Problem title: Snap: correct use of PreRun hook Tags: haskell-snap-framework, haskell Problem: Snap: correct use of PreRun hook I cant figure out how to run a function before any template loads. For instance: I have a function called 'authenticate' that returns a Maybe value. I w...	Snap: correct use of PreRun hook Snap: correct use of PreRun hook haskell-snap-framework haskell Snap PreRun Snap: correct use of PreRun hook I cant figure out how to run a function before any template loads. For instance: I have a function called 'authenticate' that returns a Maybe value. I want to run it before any t...	[ 0.0069580078125, -0.00921630859375, -0.006622314453125, 0.003875732421875, -0.035400390625, 0.006988525390625, 0.009521484375, -0.0106201171875, 0.0078125, -0.05029296875, 0.002288818359375, -0.025146484375, -0.0201416015625, -0.0093994140625, 0.0164794921875, -0.01031494140625, -0.0...	[ 121190, 26785, 4527, 1914, 163321, 150522, 1556, 142508, 10957, 160328, 18244, 111, 45767, 26366, 1810, 3642, 47, 11675, 32354, 8108, 2499, 110934, 72367, 765, 1003, 63250, 33478, 30646, 83425, 34292, 3444, 442, 456, 80581, 35431, 136, 2161, ...	[ 0.2763671875, 0.1505126953125, 0.131591796875, 0.2137451171875, 0.27197265625, 0.2432861328125, 0.0867919921875, 0.1864013671875, 0.21875, 0.0899658203125, 0.008544921875, 0.0018310546875, 0.054901123046875, 0.0906982421875, 0.009185791015625, 0.0706787109375, 0.049285888671875, 0....	embed
36731014_c0	36731014	haskell	0	Title: Haskell - wait for the first event (no busy waiting) Problem title: Haskell - wait for the first event (no busy waiting) Tags: events, haskell Problem: Haskell - wait for the first event (no busy waiting) I wanted to have in Haskell a very simple code in which events are handled. For instance, I'm looking for so...	Haskell - wait for the first event (no busy waiting) Haskell - wait for the first event (no busy waiting) events haskell Haskell Something Haskell - wait for the first event (no busy waiting) I wanted to have in Haskell a very simple code in which events are handled. For instance, I'm looking for something like this: I...	[ 0.013916015625, 0.007110595703125, -0.00173187255859375, -0.01068115234375, -0.0037841796875, -0.031494140625, 0.035888671875, -0.0089111328125, -0.0024566650390625, -0.0791015625, 0.00445556640625, -0.006866455078125, -0.01385498046875, 0.02001953125, 0.00118255615234375, 0.0032806396...	[ 20625, 142508, 40485, 100, 5117, 19732, 157, 86352, 89289, 47353, 1556, 200905, 36663, 765, 23, 4552, 8781, 18151, 3129, 34831, 5, 110527, 16487, 1884, 903, 2046, 5646, 3687, 15490, 4223, 53 ]	[ 0.15576171875, 0.2413330078125, 0.23876953125, 0.1566162109375, 0.1544189453125, 0.2061767578125, 0.1263427734375, 0.2275390625, 0.2362060546875, 0.206787109375, 0.1246337890625, 0.07305908203125, 0.0745849609375, 0.009033203125, 0.005035400390625, 0.025238037109375, 0.1220703125, ...	embed
14357039_c0	14357039	haskell	0	Title: Haskell non-tail recursion Problem title: Haskell non-tail recursion Tags: haskell Problem: Haskell non-tail recursion I want to know if this represents a tail-recursion. And if it isn't how can I do it. countP :: [a] -> (a->Bool) -> Int countP [] _ = 0 countP (x:xs) p = countP_aux (x:xs) p 0 countP_aux [] _ _ =...	Haskell non-tail recursion Haskell non-tail recursion haskell Haskell Bool x:xs countP_aux Haskell non-tail recursion I want to know if this represents a tail-recursion. And if it isn't how can I do it. This exercise show how many values in a list are verified by p condition. Thanks	[ -0.0023040771484375, 0.01373291015625, 0.01513671875, 0.021240234375, 0.0123291015625, 0.02392578125, -0.005615234375, -0.035888671875, 0.00909423828125, -0.0150146484375, 0.017333984375, -0.0255126953125, 0.0228271484375, 0.004486083984375, 0.0177001953125, 0.01092529296875, 0.00958...	[ 20625, 142508, 351, 46741, 195625, 1556, 2460, 929, 1022, 12, 425, 7, 54529, 683, 454, 10442, 1830, 3444, 3714, 2174, 903, 33636, 10, 9, 107, 48650, 56112, 54, 81979, 7639, 3642, 5941, 142424, 23, 5303, 493, 47314, 390, 915, 35431 ]	[ 0.142822265625, 0.230224609375, 0.1822509765625, 0.2705078125, 0.2120361328125, 0.14501953125, 0.09942626953125, 0.203369140625, 0.09259033203125, 0.000335693359375, 0.10028076171875, 0.06744384765625, 0.2052001953125, 0.147705078125, 0.012451171875, 0.2607421875, 0.1143798828125, ...	embed
16600399_c0	16600399	haskell	0	Title: Anyone having trouble install Control.Pipe? Problem title: Anyone having trouble install Control.Pipe? Tags: cabal, cabal-install, haskell, ghci, ghc Problem: Anyone having trouble install Control.Pipe? I have the current version of cabal and running cabal install Pipe gave me no issues. But I tried these two im...	Anyone having trouble install Control.Pipe? Anyone having trouble install Control.Pipe? cabal cabal-install haskell ghci ghc Control.Proxy Control.Pipe Anyone Pipe Could Anyone having trouble install Control.Pipe? I have the current version of cabal and running cabal install Pipe gave me no issues. But I tried these tw...	[ 0.018798828125, -0.0022430419921875, -0.00933837890625, 0.0125732421875, -0.0234375, 0.0196533203125, 0.0004711151123046875, -0.0238037109375, -0.0025177001953125, -0.000865936279296875, -0.014404296875, -0.03857421875, 0.01171875, -0.006927490234375, -0.0014801025390625, 0.02136230468...	[ 28541, 3630, 19441, 63134, 20600, 27131, 5, 683, 48672, 109524, 80383, 1556, 142508, 31380, 318, 238, 10752, 50878, 93128, 13, 191147, 43581, 11389, 111, 51042, 37348, 37842, 6626, 24927, 4966, 20949, 903, 18499, 26008, 3493, 5701, 100, 1250,...	[ 0.044952392578125, 0.08184814453125, 0.04541015625, 0.162353515625, 0.1898193359375, 0.2462158203125, 0.03826904296875, 0.1533203125, 0.2291259765625, 0.245361328125, 0.1312255859375, 0.0679931640625, 0.2000732421875, 0.037567138671875, 0.072509765625, 0.0498046875, 0.10113525390625,...	embed
29319771_c0	29319771	haskell	0	Title: "takeWhile" within a list comprehension Problem title: "takeWhile" within a list comprehension Tags: haskell, list, syntax, infinite, list-comprehension Problem: "takeWhile" within a list comprehension I have something like the following: [bla z\|n<-[0..], let z = foo n, z < 42] The thing is, ...	"takeWhile" within a list comprehension "takeWhile" within a list comprehension haskell list syntax infinite list-comprehension "takeWhile" within a list comprehension I have something like the following: The thing is, I want the list comprehension to end as soon as z < 42 fails, as if it were a tak...	[ 0.0062255859375, -0.00189971923828125, 0.007659912109375, 0.0013885498046875, 0.005828857421875, 0.0130615234375, -0.0033416748046875, 0.01007080078125, 0.0164794921875, -0.052001953125, 0.00537109375, 0.031005859375, -0.00141143798828125, -0.0026092529296875, 0.0031280517578125, -0.00...	[ 78219, 1456, 979, 133, 28032, 5303, 46683, 3220, 6889, 41502, 1556, 142508, 6002, 86531, 54241, 277, 4692, 765, 1884, 25632, 13580, 3444, 47, 3564, 33662, 237, 97, 4426, 4828, 35782, 2174, 5646, 5809, 144810, 46312, 22288, 186, 5045, 1286, ...	[ 0.244384765625, 0.1141357421875, 0.25634765625, 0.2119140625, 0.1544189453125, 0.2110595703125, 0.1708984375, 0.162841796875, 0.07562255859375, 0.001190185546875, 0.13232421875, 0.2227783203125, 0.07489013671875, 0.0694580078125, 0.131103515625, 0.035491943359375, 0.141357421875, 0...	embed
19048615_c0	19048615	haskell	0	Title: Haskell Homework - Decimal List [Int] -> Int Problem title: Haskell Homework - Decimal List [Int] -> Int Tags: fold, haskell Problem: Haskell Homework - Decimal List [Int] -> Int The assignment is to define function decimal :: [Int] -> Int in which a list of positive ints is to give the decimal number so t...	Haskell Homework - Decimal List [Int] -> Int Haskell Homework - Decimal List [Int] -> Int fold haskell Haskell Homework Decimal List Integer Haskell Homework - Decimal List [Int] -> Int The assignment is to define function decimal :: [Int] -> Int in which a list of positive ints is to give the decimal number so t...	[ -0.009765625, 0.0185546875, 0.0064697265625, 0.01287841796875, -0.0220947265625, 0.028076171875, -0.0244140625, -0.000614166259765625, -0.0079345703125, -0.0076904296875, -0.01226806640625, -0.034912109375, -0.0146484375, 0.03564453125, -0.004364013671875, -0.014404296875, -0.0026397...	[ 20625, 142508, 2005, 18244, 49132, 2749, 32036, 4153, 18, 5386, 360, 42822, 1556, 44401, 33079, 95486, 674, 83, 61924, 32354, 32380, 1984, 5303, 24491, 23, 933, 47, 8337, 14012, 221, 163324, 363, 198889, 30646, 66566, 2947, 444, 4527, 6183,...	[ 0.1378173828125, 0.221435546875, 0.129150390625, 0.1728515625, 0.15673828125, 0.1944580078125, 0.1829833984375, 0.09478759765625, 0.162841796875, 0.0745849609375, 0.109375, 0.2269287109375, 0.10693359375, 0.1678466796875, 0.06805419921875, 0.1148681640625, 0.0699462890625, 0.037597...	embed
21359525_c0	21359525	haskell	0	Title: Haskell bzlib-conduit/zlib-conduit example Problem title: Haskell bzlib-conduit/zlib-conduit example Tags: bzlib-conduit, zlib-conduit, haskell, conduit Problem: Haskell bzlib-conduit/zlib-conduit example Let's assume we create the file a.txt.gz as follows: $ echo "foobar" > a.txt $ gzip a.txt I intend to use zl...	Haskell bzlib-conduit/zlib-conduit example Haskell bzlib-conduit/zlib-conduit example bzlib-conduit zlib-conduit haskell conduit Haskell a.txt.gz a.txt Haskell bzlib-conduit/zlib-conduit example Let's assume we create the file a.txt.gz as follows: I intend to use zlib-conduit in order to emulate zcat in Haskell. I'm lo...	[ 0.006744384765625, 0.000499725341796875, 0.0062255859375, 0.017822265625, 0.000659942626953125, 0.0255126953125, -0.01043701171875, 0.004486083984375, 0.0047607421875, 0.000843048095703125, -0.00787353515625, 0.0146484375, 0.01495361328125, 0.021240234375, -0.01483154296875, -0.0084228...	[ 20625, 142508, 876, 169, 5612, 2271, 112061, 27781, 97, 1556, 120565, 10, 124326, 177, 7, 41591, 28282, 11435, 5, 28960, 150661, 4527, 19908, 4460, 16487, 8781, 190659, 109312, 1230, 209480, 91177, 25188, 71834 ]	[ 0.120361328125, 0.20849609375, 0.0298919677734375, 0.09112548828125, 0.23388671875, 0.0731201171875, 0.172607421875, 0.1796875, 0.109619140625, 0.0992431640625, 0.1962890625, 0.10888671875, 0.1756591796875, 0.03277587890625, 0.00006103515625, 0.0345458984375, 0.05865478515625, 0.11...	embed
23042199_c0	23042199	haskell	0	Title: Why does this use Double instead of giving me an ambiguity error? Problem title: Why does this use Double instead of giving me an ambiguity error? Tags: haskell Problem: Why does this use Double instead of giving me an ambiguity error? For the code class Boomable a where boom :: a instance Boomable Int where boo...	Why does this use Double instead of giving me an ambiguity error? Why does this use Double instead of giving me an ambiguity error? haskell Why Double Boomable Why does this use Double instead of giving me an ambiguity error? For the code Why does give me 2.2 ? Why does it use the Double version instead of giving me an...	[ 0.012939453125, -0.0272216796875, -0.006195068359375, 0.002655029296875, -0.004608154296875, 0.0128173828125, -0.024169921875, 0.0010833740234375, 0.01031494140625, -0.002349853515625, -0.00396728515625, -0.03125, -0.00188446044921875, -0.02734375, -0.0194091796875, -0.02880859375, 0...	[ 44084, 14602, 903, 4527, 107172, 64457, 111, 68772, 163, 920, 12282, 2481, 18499, 1556, 142508, 167240, 2886, 70, 18151, 8337, 41187, 11389, 142, 84751, 1984, 4153, 18, 707, 8331, 34, 2661, 40101, 77227, 106, 47, 4488, 5 ]	[ 0.153564453125, 0.070556640625, 0.135986328125, 0.1383056640625, 0.271484375, 0.1329345703125, 0.03173828125, 0.0662841796875, 0.085693359375, 0.1163330078125, 0.17724609375, 0.09368896484375, 0.1708984375, 0.1397705078125, 0.2452392578125, 0.2044677734375, 0.245849609375, 0.003448...	embed
72752084_c0	72752084	haskell	0	Title: How do I use pattern matching in GHCi? Problem title: How do I use pattern matching in GHCi? Tags: ghci, pattern-matching, haskell Problem: How do I use pattern matching in GHCi? I've got this code: oof [] = 1 oof [(i,j)] = i+j oof [(i,7),(5,j)] = i*j oof (_:_:xs) = foo xs and I typed it into ghci. When I try to...	How do I use pattern matching in GHCi? How do I use pattern matching in GHCi? ghci pattern-matching haskell How GHCi _:_:xs Exception Non-exhaustive How do I use pattern matching in GHCi? I've got this code: and I typed it into ghci. When I try to execute the expression: it should make use of the third line and return ...	[ -0.0303955078125, 0.002685546875, 0.00457763671875, 0.0084228515625, 0.01019287109375, 0.0172119140625, -0.00860595703125, 0.0087890625, 0.0341796875, -0.00738525390625, 0.0191650390625, -0.035400390625, 0.004852294921875, -0.02001953125, 0.01348876953125, -0.005157470703125, 0.02197...	[ 11249, 87, 4527, 103510, 14858, 214, 23, 527, 73265, 14, 54, 31380, 318, 98753, 1556, 142508, 454, 12, 425, 5443, 63928, 3775, 3355, 18391, 4935, 903, 18151, 10644, 3934, 9790, 71924, 125195, 5608, 50960, 13315, 30646, 305, 18499, 26008, ...	[ 0.043304443359375, 0.019134521484375, 0.109130859375, 0.22265625, 0.217529296875, 0.1212158203125, 0.037353515625, 0.089111328125, 0.1224365234375, 0.20263671875, 0.00555419921875, 0.1123046875, 0.1719970703125, 0.2010498046875, 0.0987548828125, 0.1715087890625, 0.006744384765625, ...	embed
72947117_c2	72947117	haskell	2	Ex.GHC.Settings.Config, a, being, x, How, EpAnn, Located, HsModule, haskell-playground.cabal, Main.hs, Wall, Haskell2010, AnnListItem, Main, ParserOpts, ParseResult, HasCallStack, POk, PFailed, Parse, Bool, EpAnnNotUsed, Outputable, DynFlags, FilePath, Build, ghc-9.2.2, haskell-playground-0.1.0.0, exe:haskell-playgroun...	Ex.GHC.Settings.Config, a, being, x, How, EpAnn, Located, HsModule, haskell-playground.cabal, Main.hs, Wall, Haskell2010, AnnListItem, Main, ParserOpts, ParseResult, HasCallStack, POk, PFailed, Parse, Bool, EpAnnNotUsed, Outputable, DynFlags, FilePath, Build, ghc-9.2.2, haskell-playground-0.1.0.0, exe:haskell-playgroun...	[ -0.0004215240478515625, 0.01123046875, -0.00823974609375, 0.00927734375, 0.022705078125, 0.01312255859375, -0.00531005859375, -0.00927734375, 0.015869140625, 0.0015106201171875, -0.00653076171875, -0.0198974609375, 0.00921630859375, -0.005706787109375, 0.00506591796875, 0.0053405761718...	[ 5443, 41877, 441, 105548, 11935, 83671, 10, 8035, 1022, 11249, 43816, 7251, 19, 135016, 3674, 572, 7, 91616, 8782, 1556, 142508, 20706, 64330, 408, 3571, 12321, 127, 23706, 20625, 11436, 35512, 154663, 2982, 2392, 2189, 39029, 7136, 5584, 4...	[ 0.1571044921875, 0.159423828125, 0.1527099609375, 0.253662109375, 0.042083740234375, 0.2138671875, 0.087158203125, 0.1890869140625, 0.07470703125, 0.08935546875, 0.0858154296875, 0.1417236328125, 0.076416015625, 0.12451171875, 0.050384521484375, 0.076904296875, 0.028778076171875, 0...	embed
68240183_c0	68240183	haskell	0	Title: Integrating Halogen into Yesod build process Problem title: Integrating Halogen into Yesod build process Tags: haskell, halogen, purescript, yesod Problem: Integrating Halogen into Yesod build process I would like to put together a webapp using Yesod for the back end and Halogen (PureScript) for the front end. I...	Integrating Halogen into Yesod build process Integrating Halogen into Yesod build process haskell halogen purescript yesod Integrating Halogen Yesod Integrating Halogen into Yesod build process I would like to put together a webapp using Yesod for the back end and Halogen (PureScript) for the front end. Is there a best...	[ -0.0023040771484375, 0.018798828125, 0.000347137451171875, -0.00262451171875, -0.0264892578125, 0.050537109375, 0.0024261474609375, -0.034912109375, 0.003173828125, -0.02197265625, -0.0052490234375, -0.01953125, -0.005523681640625, 0.0133056640625, 0.002655029296875, -0.01275634765625,...	[ 91969, 1916, 1391, 112537, 3934, 32635, 2199, 45367, 9433, 1556, 142508, 256, 34166, 32032, 2422, 23722, 1884, 25842, 1467, 9007, 17368, 100, 4420, 3564, 136, 683, 3408, 147845, 12912, 2965, 41361, 19441, 78779, 297, 6626, 4127, 3917, 11001, ...	[ 0.19775390625, 0.0340576171875, 0.169189453125, 0.255859375, 0.1002197265625, 0.1669921875, 0.2412109375, 0.1517333984375, 0.117919921875, 0.0992431640625, 0.2269287109375, 0.1385498046875, 0.136962890625, 0.255126953125, 0.130615234375, 0.1787109375, 0.019073486328125, 0.046966552...	embed
15283429_c0	15283429	haskell	0	Title: In Haskell, can you create an object of a class? Problem title: In Haskell, can you create an object of a class? Tags: class, haskell, types Problem: In Haskell, can you create an object of a class? In a Haskell program I'm trying to debug, there is a class defined: class Dictionary d where lookupIn :: d -> Word...	In Haskell, can you create an object of a class? In Haskell, can you create an object of a class? class haskell types Haskell Dictionary Word In Haskell, can you create an object of a class? In a Haskell program I'm trying to debug, there is a class defined: I'd like to create a variable called runs and make it of type...	[ 0.002838134765625, 0.01470947265625, 0.00194549560546875, 0.0194091796875, 0.0019073486328125, 0.023193359375, -0.017333984375, 0.00555419921875, -0.00616455078125, 0.00144195556640625, 0.000972747802734375, -0.023681640625, -0.00191497802734375, -0.01953125, -0.0125732421875, 0.001884...	[ 360, 20625, 142508, 831, 28282, 36746, 111, 18507, 398, 142, 10, 1556, 52895, 147638, 22543, 1528, 8, 85779, 61924, 1884, 77336, 127877, 3249, 10644, 4527, 6713, 2037, 4153, 32354, 33720, 20697, 2053 ]	[ 0.0653076171875, 0.1275634765625, 0.2288818359375, 0.11962890625, 0.19140625, 0.215576171875, 0.1287841796875, 0.228515625, 0.030975341796875, 0.031768798828125, 0.03839111328125, 0.1107177734375, 0.1627197265625, 0.18359375, 0.1051025390625, 0.03955078125, 0.0645751953125, 0.16113...	embed
39926456_c0	39926456	haskell	0	Title: In Haskell, how do you check whether a string is a substring of another? Problem title: In Haskell, how do you check whether a string is a substring of another? Tags: string, haskell Problem: In Haskell, how do you check whether a string is a substring of another? I'm using Data.Text and all I could find are fin...	In Haskell, how do you check whether a string is a substring of another? In Haskell, how do you check whether a string is a substring of another? string haskell Haskell In Haskell, how do you check whether a string is a substring of another? I'm using Data.Text and all I could find are find , which only takes a Char as...	[ 0.0037689208984375, -0.0152587890625, 0.00083160400390625, 0.03173828125, -0.01458740234375, 0.01318359375, 0.01025390625, -0.0189208984375, -0.0022735595703125, 0.00013256072998046875, -0.007110595703125, -0.012939453125, -0.007720947265625, 0.00445556640625, -0.013671875, 0.015869140...	[ 360, 20625, 142508, 3642, 12765, 36766, 79315, 83, 10, 1614, 91693, 111, 15700, 1556, 54, 17368, 11809, 174379, 7413, 51776, 21656, 237, 1653, 2063, 36356, 20320, 3444, 37202, 119261, 11522, 35773, 10484, 71713, 214, 67 ]	[ 0.0174560546875, 0.1121826171875, 0.2188720703125, 0.0484619140625, 0.2249755859375, 0.1219482421875, 0.2469482421875, 0.125732421875, 0.09100341796875, 0.20654296875, 0.1978759765625, 0.070068359375, 0.1195068359375, 0.0826416015625, 0.0499267578125, 0.0015869140625, 0.091552734375,...	embed
20034933_c0	20034933	haskell	0	Title: Cabal: can't find source for xxx_h in dist/build/autogen Problem title: Cabal: can't find source for xxx_h in dist/build/autogen Tags: cabal, haskell Problem: Cabal: can't find source for xxx_h in dist/build/autogen I am trying to install http://open-projects.net/~shahn/darcs/H3D/ but I get the followi...	Cabal: can't find source for xxx_h in dist/build/autogen Cabal: can't find source for xxx_h in dist/build/autogen cabal haskell Horde3DUtils_h Cabal xxx_h Cabal: can't find source for xxx_h in dist/build/autogen I am trying to install http://open-projects.net/~shahn/darcs/H3D/ but I get the following error me...	[ -0.0028076171875, 0.01324462890625, 0.00970458984375, -0.006561279296875, -0.0255126953125, 0.0054931640625, -0.00616455078125, 0.0037384033203125, 0.0023040771484375, -0.014892578125, -0.0017242431640625, -0.042724609375, -0.00921630859375, 0.005096435546875, -0.0023651123046875, -0.0...	[ 30438, 289, 831, 3768, 18, 7413, 31344, 20112, 454, 127, 45, 271, 177149, 8913, 1409, 109524, 1556, 142508, 7974, 112, 363, 3675, 100, 31577, 20600, 59636, 95322, 1179, 115512, 19, 1506, 4439, 841, 397, 25632, 18499, 26008, 959, 5, 11435,...	[ 0.1527099609375, 0.1656494140625, 0.060272216796875, 0.065185546875, 0.07421875, 0.130859375, 0.214111328125, 0.1324462890625, 0.052520751953125, 0.1712646484375, 0.0273590087890625, 0.0645751953125, 0.119140625, 0.1597900390625, 0.1700439453125, 0.2076416015625, 0.056854248046875, ...	embed
26399299_c1	26399299	haskell	1	remains blocked indefinitely inside a STM transaction: "Done heavy work" "Dying with Right ()" "Dying with Left thread blocked indefinitely in an STM transaction" "Dying with Left thread blocked indefinitely in an STM transaction" "Dying with Left thread blocked indefinitely in an STM transaction" ... I suspect the ke...	remains blocked indefinitely inside a STM transaction: "Done heavy work" "Dying with Right ()" "Dying with Left thread blocked indefinitely in an STM transaction" "Dying with Left thread blocked indefinitely in an STM transaction" "Dying with Left thread blocked indefinitely in an STM transaction" ... I suspect the ke...	[ -0.031982421875, 0.0211181640625, 0.021240234375, -0.0198974609375, 0.02001953125, -0.004730224609375, 0.0103759765625, 0.003082275390625, -0.00135040283203125, -0.02490234375, 0.001617431640625, 0.004669189453125, 0.00750732421875, 0.01043701171875, 0.016845703125, 0.01385498046875, ...	[ 47143, 7, 46389, 297, 23, 49919, 37838, 46132, 159, 10111, 124161, 60728, 13, 99162, 4488, 397, 38543, 678, 90911, 2480, 86997, 636, 92610, 22799, 400, 484, 109109, 34627, 71407, 6528, 74733, 31, 28864, 26073, 27131, 63928, 31384, 163812, 2...	[ 0.2169189453125, 0.0350341796875, 0.254150390625, 0.1029052734375, 0.0193023681640625, 0.155029296875, 0.0212554931640625, 0.121337890625, 0.0419921875, 0.217041015625, 0.2127685546875, 0.0831298828125, 0.040985107421875, 0.16845703125, 0.181884765625, 0.061492919921875, 0.1447753906...	embed
41166137_c0	41166137	haskell	0	Title: Haskell PointFree Problem title: Haskell PointFree Tags: haskell Problem: Haskell PointFree How can I convert my function test' that takes l (list of elements) ,n (step) and returns list of selected by step elements to PointFree function? test' n l = test'' n l 0 test'' n [] c = [] test'' n (x:xs) 0 = x:(test'' ...	Haskell PointFree Haskell PointFree haskell Haskell PointFree x:xs ASDFG Haskell PointFree How can I convert my function test' that takes l (list of elements) ,n (step) and returns list of selected by step elements to PointFree function? Method2 test' 2 [1,2,3,4,5] Result [1,3,5] test' 2 "ASDFG Result "ADG" P.S Can't u...	[ -0.01239013671875, 0.01043701171875, -0.00182342529296875, -0.01239013671875, 0.006805419921875, 0.0011749267578125, -0.005828857421875, -0.0174560546875, 0.0196533203125, -0.018310546875, 0.00433349609375, -0.03173828125, -0.004180908203125, 0.0174560546875, -0.023681640625, 0.0163574...	[ 20625, 142508, 41097, 81437, 1556, 425, 6483, 38997, 724, 831, 96760, 32354, 3034, 25, 51776, 96, 6562, 80854, 19, 95528, 30646, 5303, 111, 133291, 390, 29954, 47, 74644, 304, 116, 155761, 80389, 126684, 92714, 9713, 12351, 4527, 24927 ]	[ 0.072998046875, 0.181396484375, 0.1434326171875, 0.2393798828125, 0.0728759765625, 0.03240966796875, 0.0577392578125, 0.08447265625, 0.0826416015625, 0.045806884765625, 0.1802978515625, 0.1788330078125, 0.23193359375, 0.04058837890625, 0.03997802734375, 0.08441162109375, 0.1071777343...	embed
53638120_c0	53638120	haskell	0	Title: separate even and odd elements of list haskell Problem title: separate even and odd elements of list haskell Tags: haskell Problem: separate even and odd elements of list haskell I am trying to separate elements of a list into to further lists, one for the odd and one for even numbers. For Example, input: [1,2,3...	separate even and odd elements of list haskell separate even and odd elements of list haskell haskell x:xs separate even and odd elements of list haskell I am trying to separate elements of a list into to further lists, one for the odd and one for even numbers. For Example, It gives error on ...++ sepList xs anyone cou...	[ 0.00151824951171875, 0.0034027099609375, -0.0036468505859375, -0.013671875, -0.0250244140625, 0.0218505859375, -0.0079345703125, 0.01251220703125, 0.020263671875, 0.0159912109375, 0.0255126953125, -0.0302734375, 0.02392578125, 0.018798828125, 0.00225830078125, -0.006103515625, 0.0149...	[ 84797, 3853, 136, 70270, 80854, 5303, 1556, 142508, 111, 1022, 12, 425, 7, 31577, 3934, 47, 53333, 1632, 100, 101935, 89536, 76199, 18499, 98, 153, 37223, 25040, 154663, 35672, 17997 ]	[ 0.231201171875, 0.2052001953125, 0.1541748046875, 0.229248046875, 0.2012939453125, 0.2030029296875, 0.13330078125, 0.2154541015625, 0.0501708984375, 0.1141357421875, 0.001983642578125, 0.1146240234375, 0.09686279296875, 0.06463623046875, 0.1151123046875, 0.104248046875, 0.11193847656...	embed
20911363_c0	20911363	haskell	0	Title: Stopping/Pickling/Unpickling/Resuming a computation Problem title: Stopping/Pickling/Unpickling/Resuming a computation Tags: haskell, computation Problem: Stopping/Pickling/Unpickling/Resuming a computation Is there any Haskell way of stopping/pickling/unpickling/resuming a computation ? Some relevant discussion...	Stopping/Pickling/Unpickling/Resuming a computation Stopping/Pickling/Unpickling/Resuming a computation haskell computation Stopping Pickling Unpickling Resuming Stopping/Pickling/Unpickling/Resuming a computation Is there any Haskell way of stopping/pickling/unpickling/resuming a computation ? Some relevant discussion...	[ -0.0245361328125, 0.0064697265625, 0.0164794921875, 0.00021648406982421875, 0.0005035400390625, -0.004791259765625, -0.0091552734375, 0.0009765625, -0.00506591796875, -0.03564453125, -0.033203125, -0.0115966796875, 0.00921630859375, 0.02880859375, 0.007293701171875, 0.0111083984375, ...	[ 42284, 10366, 64, 683, 41113, 2069, 14256, 18695, 63664, 4332, 11832, 214, 10, 181135, 1363, 1556, 142508, 122554, 992, 9624, 316, 2071, 2685, 2499, 20625, 3917, 111, 7279, 309, 2109, 29191, 35107, 115058, 53383, 3688, 110, 27798, 29806, 81...	[ 0.1859130859375, 0.177978515625, 0.047943115234375, 0.079833984375, 0.1466064453125, 0.160400390625, 0.09735107421875, 0.1727294921875, 0.1820068359375, 0.10546875, 0.18310546875, 0.08258056640625, 0.049072265625, 0.231689453125, 0.11376953125, 0.146240234375, 0.2685546875, 0.19592...	embed
72761991_c2	72761991	haskell	2	.encode, hashlib.sha256, api_passphrase.encode, KC-API-SIGN, KC-API-TIMESTAMP, KC-API-KEY, KC-API-PASSPHRASE, KC-API-KEY-VERSION, requests.request, response.json, response.request.headers, response.request.body, Config, Crypto.Hash.SHA256, Data.Aeson, Data.ByteString, Data.ByteString.Base64, Data.ByteString.Char8, Data...	.encode, hashlib.sha256, api_passphrase.encode, KC-API-SIGN, KC-API-TIMESTAMP, KC-API-KEY, KC-API-PASSPHRASE, KC-API-KEY-VERSION, requests.request, response.json, response.request.headers, response.request.body, Config, Crypto.Hash.SHA256, Data.Aeson, Data.ByteString, Data.ByteString.Base64, Data.ByteString.Char8, Data...	[ 0.00885009765625, 0.00714111328125, 0.0023956298828125, -0.030517578125, 0.00848388671875, -0.01031494140625, -0.0076904296875, -0.01104736328125, 0.006866455078125, 0.029052734375, 0.021240234375, 0.005645751953125, -0.000823974609375, 0.00543212890625, -0.030517578125, 0.014770507812...	[ 6, 5, 33, 40899, 4, 1556, 127, 5612, 2420, 127892, 31470, 454, 13409, 179665, 184, 341, 441, 9, 74220, 294, 151657, 68665, 55669, 9088, 186104, 98185, 9434, 29562, 76783, 33255, 118596, 50336, 7, 75616, 57553, 170, 1681, 107, 31251, 1314,...	[ 0.1041259765625, 0.1890869140625, 0.180419921875, 0.30224609375, 0.1107177734375, 0.1837158203125, 0.08892822265625, 0.25146484375, 0.1357421875, 0.284423828125, 0.225830078125, 0.07196044921875, 0.1168212890625, 0.2127685546875, 0.164794921875, 0.1240234375, 0.172607421875, 0.0759...	embed
41753345_c1	41753345	haskell	1	: evilId :: Typeable a => a -> a evilId (EqT (n :: Int)) = n + 1 evilId (EqT (str :: String)) = reverse str evilId x = x Sadly, this does not work at all. GHC does not seem to consult my type annotations before typechecking the pattern, so it believes b is an ambiguous variable in each pattern. Is there any way I can c...	: evilId :: Typeable a => a -> a evilId (EqT (n :: Int)) = n + 1 evilId (EqT (str :: String)) = reverse str evilId x = x Sadly, this does not work at all. GHC does not seem to consult my type annotations before typechecking the pattern, so it believes b is an ambiguous variable in each pattern. Is there any way I can c...	[ -0.00860595703125, 0.0036773681640625, 0.0032806396484375, 0.004119873046875, 0.012451171875, 0.0018463134765625, -0.0224609375, -0.005615234375, 0.01129150390625, -0.04443359375, 0.024169921875, 0.005279541015625, -0.0006103515625, -0.01348876953125, 0.0159912109375, 0.00396728515625,...	[ 28, 5115, 568, 71, 60457, 2886, 10, 44357, 33079, 864, 618, 19, 1984, 360, 18, 653, 997, 106, 9297, 23351, 39531, 184, 7704, 1022, 903, 959, 4488, 756, 527, 73265, 75463, 10644, 8668, 22062, 78292, 103510, 18822, 876, 920, 12282, 77336,...	[ 0.07025146484375, 0.220458984375, 0.10296630859375, 0.1650390625, 0.211181640625, 0.2071533203125, 0.111083984375, 0.060577392578125, 0.1162109375, 0.065185546875, 0.0797119140625, 0.0054931640625, 0.0155181884765625, 0.00506591796875, 0.042144775390625, 0.02081298828125, 0.109375, ...	embed
31703966_c0	31703966	haskell	0	Title: QuickCheck: How to combine two generators? Problem title: QuickCheck: How to combine two generators? Tags: quickcheck, haskell, frege Problem: QuickCheck: How to combine two generators? I have two generators, gen_n & gen_arr : gen_n :: Gen Int gen_n = suchThat arbitrary (\i -> i >= 0 && i <= 10) gen_elem :: Gen ...	QuickCheck: How to combine two generators? QuickCheck: How to combine two generators? quickcheck haskell frege QuickCheck How gen_n gen_arr Gen gen_elem combine_two_gens QuickCheck: How to combine two generators? I have two generators, gen_n & gen_arr : How can I combine these two into a Gen (Int, [Int]) ?	[ -0.0177001953125, 0.007354736328125, -0.01556396484375, 0.0035247802734375, -0.0025634765625, 0.042724609375, 0.003997802734375, -0.037841796875, 0.006195068359375, -0.032470703125, 0.01495361328125, 0.016845703125, 0.005767822265625, 0.00811767578125, -0.016357421875, -0.0242919921875...	[ 89038, 202567, 11249, 70163, 6626, 145823, 7, 47, 63773, 78292, 1556, 142508, 183559, 13, 9226, 19, 147, 42, 15937, 27889, 55547, 20583, 765, 454, 619, 831, 3934, 4153, 18 ]	[ 0.1507568359375, 0.2369384765625, 0.116943359375, 0.2391357421875, 0.1741943359375, 0.2484130859375, 0.1187744140625, 0.049468994140625, 0.1058349609375, 0.1953125, 0.0474853515625, 0.156982421875, 0.0592041015625, 0.057891845703125, 0.159423828125, 0.12890625, 0.0777587890625, 0.1...	embed
24913656_c0	24913656	haskell	0	Title: Haskell -- Is there a monad sequence function for tuples? Problem title: Haskell -- Is there a monad sequence function for tuples? Tags: haskell, monads, sequence, tuples Problem: Haskell -- Is there a monad sequence function for tuples? Suppose I have a value of type Monad m => (m a, m a) , and I want to "seque...	Haskell -- Is there a monad sequence function for tuples? Haskell -- Is there a monad sequence function for tuples? haskell monads sequence tuples Haskell Monad Haskell -- Is there a monad sequence function for tuples? Suppose I have a value of type Monad m => (m a, m a) , and I want to "sequence" the pair to create a ...	[ 0.010009765625, 0.0194091796875, 0.0037384033203125, 0.0439453125, 0.020263671875, 0.003936767578125, -0.015625, -0.01153564453125, -0.004058837890625, -0.01495361328125, -0.004302978515625, 0.0107421875, -0.00921630859375, 0.01263427734375, 0.00165557861328125, -0.01470947265625, -0...	[ 20625, 142508, 4210, 2071, 2685, 10, 2667, 712, 40, 944, 3956, 32354, 100, 370, 99726, 1556, 60331, 71, 34292, 10644, 347, 44357, 39, 3444, 184, 80836, 28282, 11, 70163, 18403, 43701, 6626, 142424, 5570, 3917, 41018, 10422 ]	[ 0.1246337890625, 0.25244140625, 0.0262908935546875, 0.05645751953125, 0.07421875, 0.08319091796875, 0.150390625, 0.1614990234375, 0.0928955078125, 0.1578369140625, 0.1292724609375, 0.232421875, 0.07562255859375, 0.164794921875, 0.258056640625, 0.08050537109375, 0.1600341796875, 0.1...	embed
2502143_c1	2502143	haskell	1	ex.Posix.String> :i RegexMaker class (RegexOptions regex compOpt execOpt) => RegexMaker regex compOpt execOpt source \| regex -> compOpt execOpt, compOpt -> regex execOpt, execOpt -> regex compOpt where makeRegex :: source -> regex makeRegexOpts :: compOpt -> execOpt -> source -> regex makeRegexM :: (Monad m) => source ...	ex.Posix.String> :i RegexMaker class (RegexOptions regex compOpt execOpt) => RegexMaker regex compOpt execOpt source \| regex -> compOpt execOpt, compOpt -> regex execOpt, execOpt -> regex compOpt where makeRegex :: source -> regex makeRegexOpts :: compOpt -> execOpt -> source -> regex makeRegexM :: (Monad m) => source ...	[ -0.02392578125, 0.020751953125, 0.0152587890625, 0.0137939453125, -0.0032806396484375, 0.021240234375, 0.00457763671875, -0.0022735595703125, 0.00653076171875, -0.0225830078125, -0.0211181640625, 0.00799560546875, 0.0194091796875, -0.004241943359375, -0.01507568359375, 0.00349426269531...	[ 1119, 7192, 7, 4084, 71713, 214, 14, 11678, 3355, 76978, 56, 18507, 54601, 39029, 5256, 6835, 9969, 18, 3240, 44357, 31344, 7440, 3249, 594, 46674, 712, 347, 262, 5983, 24129, 63473, 156607, 28864, 26073, 10, 20625, 142508, 1914, 822, 216...	[ 0.1510009765625, 0.046783447265625, 0.043060302734375, 0.200439453125, 0.121337890625, 0.004150390625, 0.096923828125, 0.181640625, 0.2320556640625, 0.226318359375, 0.1297607421875, 0.179931640625, 0.174072265625, 0.244384765625, 0.0810546875, 0.1563720703125, 0.1519775390625, 0.10...	embed
39607475_c0	39607475	haskell	0	Title: Is it possible to modify an element in an infinite list? Problem title: Is it possible to modify an element in an infinite list? Tags: haskell Problem: Is it possible to modify an element in an infinite list? Let's say I have a list of zeroes: zeroes = repeat 0 And I'd like to modify the nth member of that list....	Is it possible to modify an element in an infinite list? Is it possible to modify an element in an infinite list? haskell Is it possible to modify an element in an infinite list? Let's say I have a list of zeroes: And I'd like to modify the nth member of that list. Is there a built in for this, or some function I could...	[ -0.025634765625, 0.0020904541015625, 0.007080078125, -0.00897216796875, 0.005035400390625, -0.0079345703125, 0.000873565673828125, -0.0086669921875, 0.01953125, -0.01470947265625, 0.005767822265625, 0.00537109375, 0.0152587890625, -0.00506591796875, -0.004730224609375, 0.00479125976562...	[ 2071, 442, 7722, 47, 2811, 40383, 12830, 23, 142, 54241, 13, 5303, 1556, 142508, 765, 111, 45234, 90, 1884, 653, 927, 32786, 88303, 903, 32354, 33022, 32635, 831, 6183, 23937, 15490, 11341, 2667, 712, 85689, 91084, 36716, 3525, 66161, 319...	[ 0.0714111328125, 0.08203125, 0.205078125, 0.1015625, 0.212646484375, 0.202880859375, 0.2161865234375, 0.1026611328125, 0.04345703125, 0.2025146484375, 0.1246337890625, 0.2401123046875, 0.1641845703125, 0.26611328125, 0.020660400390625, 0.0223541259765625, 0.154541015625, 0.08758544...	embed
39850051_c0	39850051	haskell	0	Title: error: parse error on input ‘where’ Problem title: error: parse error on input ‘where’ Tags: haskell, ghc Problem: error: parse error on input ‘where’ Struggling to understand the GHC compiler and it's mysterious indentation rules but unfortunately this block of code refuses to compile Sorry I know this question...	error: parse error on input ‘where’ error: parse error on input ‘where’ haskell ghc n-1 n-2 Exception error: parse error on input ‘where’ Struggling to understand the GHC compiler and it's mysterious indentation rules but unfortunately this block of code refuses to compile Sorry I know this question has been asked befo...	[ 0.0054931640625, 0.0191650390625, -0.01953125, -0.01373291015625, -0.0030517578125, 0.024169921875, 0.01458740234375, -0.005706787109375, 0.00677490234375, -0.02490234375, 0.01177978515625, -0.03466796875, 0.02099609375, -0.01904296875, 0.01220703125, 0.0010833740234375, 0.0038146972...	[ 18499, 366, 184, 98, 107730, 136913, 12, 1556, 142508, 31380, 238, 653, 5759, 5428, 63928, 204, 63667, 9815, 28219, 527, 73265, 9969, 34759, 759, 824, 93905, 18597, 22062, 91736, 104272, 903, 46389, 18151, 128120, 7, 47, 1340, 90502, 2809, ...	[ 0.222412109375, 0.15966796875, 0.1741943359375, 0.1240234375, 0.215087890625, 0.2344970703125, 0.008056640625, 0.107666015625, 0.2218017578125, 0.1376953125, 0.126220703125, 0.0013427734375, 0.1080322265625, 0.161865234375, 0.15087890625, 0.008331298828125, 0.00457763671875, 0.0062...	embed
27194426_c0	27194426	haskell	0	Title: Haskell : Check for an exact substring Problem title: Haskell : Check for an exact substring Tags: substring, haskell Problem: Haskell : Check for an exact substring I want to write a function which will check for an EXACT substring in the given string. All I am using right now is isInfixOf but my friend just po...	Haskell : Check for an exact substring Haskell : Check for an exact substring substring haskell Haskell Check Haskell : Check for an exact substring I want to write a function which will check for an EXACT substring in the given string. All I am using right now is isInfixOf but my friend just pointed out that it doesn'...	[ 0.02685546875, -0.00347900390625, -0.0027008056640625, 0.03125, -0.017333984375, 0.0206298828125, 0.0128173828125, -0.01409912109375, 0.007415771484375, 0.00836181640625, 0.0093994140625, 0.01007080078125, 0.005462646484375, 0.0118408203125, -0.003082275390625, 0.00421142578125, 0.03...	[ 20625, 142508, 38679, 100, 24763, 1614, 91693, 152, 1556, 142, 3444, 33022, 32354, 12765, 29426, 84161, 23, 34475, 79315, 3164, 17368, 5036, 83, 4153, 55923, 132887, 34391, 6275, 22027, 18, 2565, 32562, 903, 30646, 87599, 2301, 5608, 4734, ...	[ 0.1453857421875, 0.25244140625, 0.23486328125, 0.14013671875, 0.255859375, 0.2152099609375, 0.2418212890625, 0.007110595703125, 0.1422119140625, 0.009918212890625, 0.093017578125, 0.093505859375, 0.1614990234375, 0.213134765625, 0.1353759765625, 0.2119140625, 0.02838134765625, 0.01...	embed
74052263_c0	74052263	haskell	0	Title: Can I use where in Haskell to find function parameter given the function output? Problem title: Can I use where in Haskell to find function parameter given the function output? Tags: functional-programming, haskell, where-clause Problem: Can I use where in Haskell to find function parameter given the function ou...	Can I use where in Haskell to find function parameter given the function output? Can I use where in Haskell to find function parameter given the function output? functional-programming haskell where-clause Can Haskell Integer Can I use where in Haskell to find function parameter given the function output? This is my pr...	[ -0.01287841796875, 0.029296875, -0.00933837890625, -0.0113525390625, -0.00087738037109375, 0.01318359375, 0.0089111328125, -0.00006079673767089844, 0.0011444091796875, -0.007781982421875, 0.00543212890625, -0.033203125, 0.0177001953125, -0.005462646484375, 0.0208740234375, -0.018188476...	[ 4171, 87, 4527, 7440, 23, 20625, 142508, 7413, 32354, 171859, 34475, 140992, 47, 123309, 28966, 1556, 18347, 4032, 44401, 1528, 31380, 318, 9969, 1340, 65771, 9790, 28412, 1022, 33949, 62163, 179933, 959, 7722, 107730, 1295 ]	[ 0.0906982421875, 0.021270751953125, 0.120849609375, 0.20947265625, 0.1005859375, 0.1396484375, 0.241943359375, 0.160400390625, 0.2064208984375, 0.243408203125, 0.0938720703125, 0.193115234375, 0.0374755859375, 0.130859375, 0.059478759765625, 0.10009765625, 0.07403564453125, 0.05181...	embed
45421681_c0	45421681	haskell	0	Title: Add element to the end of a list without going through the whole list (haskell) Problem title: Add element to the end of a list without going through the whole list (haskell) Tags: haskell Problem: Add element to the end of a list without going through the whole list (haskell) Is there a way in Haskell to add an...	Add element to the end of a list without going through the whole list (haskell) Add element to the end of a list without going through the whole list (haskell) haskell Add Add element to the end of a list without going through the whole list (haskell) Is there a way in Haskell to add an element to the end of a list wit...	[ -0.004241943359375, 0.037353515625, 0.01348876953125, -0.009765625, -0.00634765625, 0.01055908203125, -0.0185546875, 0.0068359375, -0.005401611328125, -0.053466796875, 0.0269775390625, -0.032958984375, 0.0262451171875, 0.017578125, -0.016845703125, -0.0033416748046875, 0.010375976562...	[ 29117, 12830, 47, 70, 3564, 111, 5303, 15490, 8305, 28271, 10557, 142508, 1556, 2685, 10, 3917, 23, 20625, 15190, 142, 19441, 89536, 133063, 82449, 3444, 190, 1884, 155761, 80389, 28219, 37223, 39933, 219, 2601, 32233, 24500, 45964 ]	[ 0.168701171875, 0.20703125, 0.119873046875, 0.0302734375, 0.23828125, 0.08795166015625, 0.22314453125, 0.121826171875, 0.10791015625, 0.08087158203125, 0.10064697265625, 0.2471923828125, 0.13037109375, 0.0152435302734375, 0.0428466796875, 0.10736083984375, 0.048553466796875, 0.1448...	embed
7914235_c0	7914235	haskell	0	Title: Haskell: function to accept random Int Problem title: Haskell: function to accept random Int Tags: random, haskell Problem: Haskell: function to accept random Int I have a basic function that accepts an Int and returns a list: generateCode rnd = [sharpOrDot i rnd \| i <- [0..24]] I call it from my main function l...	Haskell: function to accept random Int Haskell: function to accept random Int random haskell Haskell Couldn Char Haskell: function to accept random Int I have a basic function that accepts an Int and returns a list: I call it from my main function like this: Shouldn't r <- (randomIO :: Int) "unpack" the Int part from I...	[ 0.00469970703125, 0.0069580078125, 0.0152587890625, -0.00994873046875, 0.012939453125, 0.01361083984375, -0.00714111328125, -0.0167236328125, -0.005645751953125, -0.030517578125, 0.006988525390625, -0.01953125, -0.006866455078125, 0.0224609375, -0.004669189453125, -0.009765625, 0.013...	[ 20625, 142508, 32354, 47, 26946, 96759, 360, 18, 12, 1556, 191147, 19, 21656, 62822, 30646, 10, 5303, 11782, 1295, 5201, 1884, 903, 151117, 1690, 4426, 9, 46258, 39, 17780, 1984, 309, 29102, 2831, 27875, 139392, 114211, 18499 ]	[ 0.14599609375, 0.256103515625, 0.2099609375, 0.1014404296875, 0.2398681640625, 0.216064453125, 0.1651611328125, 0.1712646484375, 0.00579833984375, 0.1297607421875, 0.1063232421875, 0.03436279296875, 0.1678466796875, 0.1163330078125, 0.1109619140625, 0.002105712890625, 0.1195068359375...	embed
12115193_c0	12115193	haskell	0	Title: GHCI character limit? Problem title: GHCI character limit? Tags: runhaskell, emacs, haskell Problem: GHCI character limit? I'm using ghci to do some incremental development using Emacs' run-haskell . Every once in a while, I get an error that looks like <interactive>:[line]:[character]: _Lexical error at charact...	GHCI character limit? GHCI character limit? runhaskell emacs haskell GHCI _Lexical EOT GHCI character limit? I'm using ghci to do some incremental development using Emacs' run-haskell . Every once in a while, I get an error that looks like Setting up an intermediate variable or two gets a working response, and the file...	[ -0.0028533935546875, -0.004913330078125, 0.0152587890625, -0.005706787109375, 0.0038299560546875, 0.004150390625, 0.00787353515625, 0.0022430419921875, 0.00921630859375, -0.007720947265625, -0.003662109375, -0.0283203125, 0.0074462890625, -0.007080078125, 0.0213623046875, 0.00105285644...	[ 41877, 17304, 62816, 17475, 11675, 10557, 142508, 352, 2263, 1556, 5267, 425, 21533, 241, 23973, 32, 17368, 31380, 318, 145322, 34754, 85269, 4439, 87769, 24145, 12960, 18499, 33342, 503, 19514, 1257, 81814, 77336, 6626, 20697, 57553, 11435, ...	[ 0.1578369140625, 0.199462890625, 0.2259521484375, 0.20849609375, 0.08203125, 0.0894775390625, 0.20849609375, 0.041595458984375, 0.084716796875, 0.1138916015625, 0.03839111328125, 0.07684326171875, 0.0914306640625, 0.07275390625, 0.1962890625, 0.001129150390625, 0.04278564453125, 0....	embed
33847819_c0	33847819	haskell	0	Title: Using stack for profiling Problem title: Using stack for profiling Tags: haskell-stack, haskell Problem: Using stack for profiling I'm trying to do some profiling using stack --enable-profiling and I'm a bit confused about what's happening exactly. Do I need to use also --enable-library ?. Also, is it build in a...	Using stack for profiling Using stack for profiling haskell-stack haskell Using Using stack for profiling I'm trying to do some profiling using stack --enable-profiling and I'm a bit confused about what's happening exactly. Do I need to use also --enable-library ?. Also, is it build in a separate directory ?What happen...	[ -0.006866455078125, -0.007232666015625, -0.01104736328125, -0.019287109375, -0.01422119140625, 0.01300048828125, -0.007598876953125, -0.006317138671875, 0.00775146484375, -0.021728515625, 0.007232666015625, -0.0034332275390625, 0.0252685546875, 0.00112152099609375, -0.0062255859375, 0....	[ 345, 177261, 100, 9468, 214, 1556, 142508, 590, 2594, 6953, 31577, 17368, 4210, 33, 2886, 58395, 55681, 123087, 3871, 4527, 150, 2844, 1294, 45367, 84797, 14364, 37629, 13736, 170198, 60641, 4348, 20, 670, 304, 35829, 5423, 442, 191082 ]	[ 0.0650634765625, 0.25537109375, 0.033050537109375, 0.254150390625, 0.10986328125, 0.0997314453125, 0.197021484375, 0.08624267578125, 0.090576171875, 0.0057373046875, 0.00128173828125, 0.031890869140625, 0.094970703125, 0.07122802734375, 0.154296875, 0.239013671875, 0.027435302734375,...	embed
18382349_c1	18382349	haskell	1	need to sort the rows afterwards, and Repa seems to have no support for sorting, and I don't want to be writing sort algorithms myself. So I don't know how to have a giant rectangular array and yet still sort it. Suggestions for libraries to use, GC flags to set, or anything else? The machine has 24 cores and 24GB of ...	need to sort the rows afterwards, and Repa seems to have no support for sorting, and I don't want to be writing sort algorithms myself. So I don't know how to have a giant rectangular array and yet still sort it. Suggestions for libraries to use, GC flags to set, or anything else? The machine has 24 cores and 24GB of ...	[ 0.00537109375, 0.0277099609375, 0.00145721435546875, 0.0238037109375, -0.0096435546875, -0.005279541015625, -0.0035552978515625, -0.022216796875, -0.00113677978515625, 0.0157470703125, -0.01123046875, -0.029052734375, 0.00194549560546875, -0.017578125, -0.03955078125, -0.010009765625, ...	[ 3871, 12096, 15555, 7, 7103, 19364, 33742, 11, 37202, 110, 8060, 214, 3444, 32562, 234873, 35978, 18, 3714, 3642, 765, 6051, 148734, 10393, 320, 10298, 53, 136, 14373, 7464, 442, 104235, 141933, 35773, 4527, 69657, 49938, 5423, 36279, 1556,...	[ 0.1041259765625, 0.271728515625, 0.193359375, 0.028533935546875, 0.037353515625, 0.0548095703125, 0.1593017578125, 0.151123046875, 0.01239013671875, 0.0694580078125, 0.1868896484375, 0.07537841796875, 0.09197998046875, 0.0218048095703125, 0.14697265625, 0.04833984375, 0.0469055175781...	embed
38019758_c0	38019758	haskell	0	Title: Does GHC optimize away unused code and packages? Problem title: Does GHC optimize away unused code and packages? Tags: compiler-optimization, package, module, haskell, ghc Problem: Does GHC optimize away unused code and packages? Let's say a big package is included to a project and only one function from the pac...	Does GHC optimize away unused code and packages? Does GHC optimize away unused code and packages? compiler-optimization package module haskell ghc Does GHC Does GHC optimize away unused code and packages? Let's say a big package is included to a project and only one function from the package is used, is the rest of the...	[ 0.0145263671875, 0.005828857421875, 0.021728515625, 0.006622314453125, -0.0184326171875, 0.00830078125, -0.007659912109375, -0.0064697265625, -0.0133056640625, 0.03271484375, -0.006744384765625, -0.0220947265625, 0.007476806640625, 0.0289306640625, 0.01153564453125, 0.02294921875, 0....	[ 527, 73265, 15572, 20650, 16065, 51, 33740, 18151, 136, 98169, 101790, 9969, 34759, 100433, 88996, 1556, 142508, 31380, 238, 6957, 99201, 13452, 4734, 1632, 32354, 11814, 10588, 29367, 49725, 2704, 2394, 6635, 3564, 8306, 24927, 10644, 35773, ...	[ 0.1146240234375, 0.239013671875, 0.1695556640625, 0.1009521484375, 0.1419677734375, 0.069091796875, 0.1697998046875, 0.1624755859375, 0.054931640625, 0.18994140625, 0.03948974609375, 0.119140625, 0.080078125, 0.123779296875, 0.1180419921875, 0.0858154296875, 0.1761474609375, 0.1258...	embed
42428194_c0	42428194	haskell	0	Title: New line indentation Haskell Problem title: New line indentation Haskell Tags: string, indentation, haskell Problem: New line indentation Haskell I am a complete novice in Haskell and have the following question: I intend to create the function, which puts three Strings on different lines. Here is the code: onTh...	New line indentation Haskell New line indentation Haskell string indentation haskell Haskell Life New line indentation Haskell I am a complete novice in Haskell and have the following question: I intend to create the function, which puts three Strings on different lines. Here is the code: Here is what I run: And what I...	[ -0.0269775390625, -0.02587890625, 0.0029296875, 0.0128173828125, 0.006988525390625, 0.0142822265625, 0.0185546875, 0.0086669921875, 0.003021240234375, -0.016845703125, -0.01458740234375, -0.01171875, -0.01251220703125, 0.0157470703125, -0.0120849609375, 0.018310546875, 0.029174804687...	[ 2356, 13315, 18597, 22062, 20625, 142508, 79315, 1556, 16505, 28484, 95968, 9655, 150661, 28282, 32354, 3884, 17262, 23351, 5180, 12921, 124519, 18151, 11675, 37842, 25632, 62816, 22027, 18, 4488 ]	[ 0.10137939453125, 0.1644287109375, 0.15673828125, 0.109130859375, 0.1275634765625, 0.2132568359375, 0.1658935546875, 0.10791015625, 0.13330078125, 0.011871337890625, 0.09051513671875, 0.007293701171875, 0.07470703125, 0.07891845703125, 0.172607421875, 0.08636474609375, 0.163452148437...	embed
4505850_c0	4505850	haskell	0	Title: Pairing adjacent list items in Haskell Problem title: Pairing adjacent list items in Haskell Tags: zip, haskell, list Problem: Pairing adjacent list items in Haskell I have a chained list like ["root", "foo", "bar", "blah"] And I'd like to convert it to a list of tuples, using adjacent pairs. Like so [("root", "...	Pairing adjacent list items in Haskell Pairing adjacent list items in Haskell zip haskell list Pairing Haskell Pairing adjacent list items in Haskell I have a chained list like And I'd like to convert it to a list of tuples, using adjacent pairs. Like so At the moment, I'm using this to do it: However, I don't really l...	[ -0.004730224609375, -0.0013275146484375, -0.00885009765625, 0.0177001953125, 0.00872802734375, 0.0341796875, -0.0322265625, 0.000286102294921875, 0.005584716796875, -0.0185546875, 0.01025390625, -0.00160980224609375, -0.00022125244140625, 0.01104736328125, -0.0096435546875, 0.001098632...	[ 37897, 2852, 123594, 16797, 5303, 55769, 20625, 142508, 23, 68330, 1556, 765, 121293, 297, 1884, 3493, 96760, 47, 10, 370, 99726, 17368, 80836, 18852, 3095, 903, 33306, 2301, 18, 6183, 55300, 5351, 11522, 3917, 162520, 1747, 12524, 180663, ...	[ 0.1983642578125, 0.09033203125, 0.1580810546875, 0.1900634765625, 0.2108154296875, 0.1705322265625, 0.14111328125, 0.2198486328125, 0.0257720947265625, 0.1796875, 0.1328125, 0.015838623046875, 0.14111328125, 0.09783935546875, 0.123291015625, 0.08489990234375, 0.1636962890625, 0.077...	embed
9707190_c0	9707190	haskell	0	Title: Time cost of Haskell `seq` operator Problem title: Time cost of Haskell `seq` operator Tags: lazy-evaluation, haskell, strict, seq Problem: Time cost of Haskell `seq` operator This FAQ says that The seq operator is seq :: a -> b -> b x seq y will evaluate x, enough to check that it is not bottom, then discard th...	Time cost of Haskell `seq` operator Time cost of Haskell `seq` operator lazy-evaluation haskell strict seq Time Haskell Time cost of Haskell `seq` operator This FAQ says that That's awfully nice of Haskell, but does it mean that in the cost of evaluating x will be paid twice ("discard the result")?	[ 0.0142822265625, 0.0255126953125, 0.01300048828125, 0.0213623046875, 0.0267333984375, -0.0027008056640625, 0.004608154296875, 0.016845703125, -0.0048828125, -0.031494140625, -0.0111083984375, 0.0081787109375, 0.006134033203125, 0.0223388671875, -0.015869140625, 0.0037078857421875, -0...	[ 19055, 11034, 20625, 142508, 184, 864, 39933, 21, 3285, 159258, 1556, 81113, 40, 52064, 434, 126351, 26267, 29459, 151575, 214, 1022, 1221, 72090, 186351, 3827, 38931, 16750 ]	[ 0.1246337890625, 0.1942138671875, 0.119140625, 0.2314453125, 0.094970703125, 0.200439453125, 0.178466796875, 0.0623779296875, 0.15380859375, 0.142333984375, 0.0997314453125, 0.112548828125, 0.0816650390625, 0.1083984375, 0.0284423828125, 0.050048828125, 0.09674072265625, 0.06488037...	embed
5744380_c0	5744380	haskell	0	Title: Not in scope: `S.elementOf' Problem title: Not in scope: `S.elementOf' Tags: haskell Problem: Not in scope: `S.elementOf' why load a normal file, have error Not in scope: `S.elementOf' import Control.Monad.Reader import Control.Monad.State import Control.Monad.Error import qualified Data.Set as S .... ...	Not in scope: `S.elementOf' Not in scope: `S.elementOf' haskell Control.Monad.Error Control.Monad.Reader Control.Monad.State qualified Not S.elementOf Data.Set S.insert Not in scope: `S.elementOf' why load a normal file, have error Not in scope: `S.elementOf'	[ 0.0015869140625, 0.0031890869140625, -0.00347900390625, 0.0279541015625, -0.01116943359375, -0.005462646484375, -0.0028533935546875, -0.01239013671875, 0.0076904296875, -0.0205078125, 0, 0.00933837890625, 0.0133056640625, -0.004638671875, 0.0216064453125, -0.00506591796875, -0.002899...	[ 11205, 23, 70820, 294, 5, 62766, 132887, 3768, 1556, 142508, 27131, 46674, 712, 18468, 31611, 31345, 135206, 217225, 159, 11809, 126, 33657, 15400, 72367, 3638, 11435, 765, 18499 ]	[ 0.2186279296875, 0.1878662109375, 0.24072265625, 0.113037109375, 0.048095703125, 0.2044677734375, 0.2978515625, 0.1082763671875, 0.1202392578125, 0.240478515625, 0.1624755859375, 0.059906005859375, 0.092529296875, 0.038726806640625, 0.07440185546875, 0.116943359375, 0.067626953125, ...	embed
36407995_c0	36407995	haskell	0	Title: Html Tag parser in Haskell Problem title: Html Tag parser in Haskell Tags: parsing, html, haskell Problem: Html Tag parser in Haskell Hi I have an assignment which is supposed to check given a string if it can become a valid html file. like for example running this: doc2 = “<head> Test2 <body> Testing </body>" s...	Html Tag parser in Haskell Html Tag parser in Haskell parsing html haskell Html Tag Haskell doc2 Test2 Testing Html Tag parser in Haskell Hi I have an assignment which is supposed to check given a string if it can become a valid html file. like for example running this: should output this: the trouble I am having is cr...	[ 0.017578125, 0.0147705078125, 0.000020623207092285156, 0.01116943359375, -0.01287841796875, 0.0267333984375, -0.025146484375, -0.0230712890625, 0.00162506103515625, -0.00872802734375, 0.0020294189453125, -0.025390625, -0.01483154296875, -0.0142822265625, -0.004730224609375, 0.003753662...	[ 572, 18, 7237, 4837, 366, 2189, 23, 20625, 142508, 6953, 7693, 1556, 51584, 304, 8647, 95486, 674, 134598, 12765, 34475, 79315, 2174, 831, 24209, 35604, 11435, 27781, 51042, 903, 5608, 140992, 63134, 19441, 105233, 100, 69141, 3714, 83, 981...	[ 0.042022705078125, 0.1278076171875, 0.1622314453125, 0.1917724609375, 0.1514892578125, 0.1798095703125, 0.036773681640625, 0.140380859375, 0.219970703125, 0.03912353515625, 0.1959228515625, 0.1318359375, 0.0416259765625, 0.053863525390625, 0.0941162109375, 0.142822265625, 0.057464599...	embed
39136975_c0	39136975	haskell	0	Title: Haskell: Define product with foldr Problem title: Haskell: Define product with foldr Tags: haskell Problem: Haskell: Define product with foldr I'm trying to define product with foldr : I could do it with: new_product xs = foldr () 1 xs but not: new_product = foldr () 1 or: new_product = \xs -> foldr (*) 1 xs B...	Haskell: Define product with foldr Haskell: Define product with foldr haskell Haskell Define new_product Haskell: Define product with foldr I'm trying to define product with foldr : I could do it with: new_product xs = foldr () 1 xs but not: new_product = foldr () 1 or: new_product = \xs -> foldr (*) 1 xs Both defini...	[ -0.0177001953125, 0.01904296875, -0.0128173828125, 0.00537109375, -0.02099609375, 0.0216064453125, -0.0086669921875, 0.0107421875, 0.004425048828125, -0.0286865234375, 0.0031280517578125, -0.02294921875, -0.010498046875, -0.005615234375, 0.00153350830078125, -0.00970458984375, -0.001...	[ 20625, 142508, 262, 64552, 12996, 678, 18344, 7569, 1556, 3525, 57877, 31577, 61924, 5809, 54, 1022, 7, 80019, 106, 1284, 959, 2203, 707, 41872, 425, 149766, 80934, 27489, 5701, 18499, 10644, 30022 ]	[ 0.1265869140625, 0.217041015625, 0.07244873046875, 0.170654296875, 0.246826171875, 0.10174560546875, 0.1650390625, 0.21875, 0.1199951171875, 0.139404296875, 0.263916015625, 0.05194091796875, 0.1904296875, 0.0487060546875, 0.016143798828125, 0.08636474609375, 0.0777587890625, 0.0808...	embed
50336662_c0	50336662	haskell	0	Title: Is there a function in Haskell that returns the type of its argument (or a string showing the type)? Problem title: Is there a function in Haskell that returns the type of its argument (or a string showing the type)? Tags: haskell Problem: Is there a function in Haskell that returns the type of its argument (or ...	Is there a function in Haskell that returns the type of its argument (or a string showing the type)? Is there a function in Haskell that returns the type of its argument (or a string showing the type)? haskell Haskell Is there a function in Haskell that returns the type of its argument (or a string showing the type)? I...	[ 0.017333984375, -0.003265380859375, 0.014404296875, 0.0257568359375, -0.0022735595703125, 0.014404296875, -0.0093994140625, -0.00089263916015625, -0.0120849609375, -0.01397705078125, 0.007598876953125, -0.037109375, -0.0164794921875, -0.0025177001953125, -0.00136566162109375, 0.0058898...	[ 2685, 32354, 23, 20625, 142508, 30646, 10644, 111, 6863, 10750, 79315, 141377, 10, 1556, 450, 7, 1632, 831, 11782, 28032, 1528, 14602, 2367, 152, 18, 212398, 53418, 10422, 176377, 9351, 237, 23351, 214 ]	[ 0.050750732421875, 0.2052001953125, 0.07696533203125, 0.12109375, 0.2310791015625, 0.1898193359375, 0.2320556640625, 0.0645751953125, 0.052276611328125, 0.2012939453125, 0.1676025390625, 0.092529296875, 0.060455322265625, 0.076416015625, 0.0174407958984375, 0.0421142578125, 0.0021057...	embed
51028_c0	51028	haskell	0	Title: Create background process in windows without visible console window Problem title: Create background process in windows without visible console window Tags: windows, haskell Problem: Create background process in windows without visible console window How do I create a background process with Haskell on windows w...	Create background process in windows without visible console window Create background process in windows without visible console window windows haskell Create Create background process in windows without visible console window How do I create a background process with Haskell on windows without a visible command window...	[ -0.0021209716796875, 0.028076171875, -0.015869140625, 0.01611328125, -0.0126953125, 0.00897216796875, 0.00469970703125, -0.0262451171875, 0.006744384765625, -0.02294921875, -0.0196533203125, 0.01708984375, 0.0281982421875, 0.0164794921875, 0.0147705078125, 0.0169677734375, 0.01544189...	[ 151313, 76615, 9433, 23, 54825, 15490, 75693, 130250, 76896, 1556, 142508, 28282, 678, 20625, 98, 75101, 75935, 54397, 1528, 126502, 14922, 11907, 1733, 11675, 9803, 7, 2663, 756, 1884, 47, 2046, 31351, 111, 903, 30362 ]	[ 0.1417236328125, 0.23681640625, 0.183349609375, 0.0655517578125, 0.1490478515625, 0.1361083984375, 0.1649169921875, 0.1910400390625, 0.17236328125, 0.133056640625, 0.2418212890625, 0.150146484375, 0.05413818359375, 0.1378173828125, 0.0179443359375, 0.1993408203125, 0.10247802734375, ...	embed
71678825_c0	71678825	haskell	0	Title: Case matching on read function in Haskell Problem title: Case matching on read function in Haskell Tags: switch-statement, record, haskell, parsing Problem: Case matching on read function in Haskell I am wondering how to check success or failure (resulting in Prelude.read: no parse) of the read function in Haske...	Case matching on read function in Haskell Case matching on read function in Haskell switch-statement record haskell parsing Case Haskell Case matching on read function in Haskell I am wondering how to check success or failure (resulting in Prelude.read: no parse) of the read function in Haskell. In my case i run "(read...	[ -0.0289306640625, -0.004425048828125, 0.005462646484375, 0.01287841796875, 0.0084228515625, 0.006256103515625, -0.0001659393310546875, -0.006988525390625, 0.000263214111328125, 0.016357421875, 0.0233154296875, -0.01129150390625, -0.02197265625, -0.0361328125, 0.017578125, -0.0297851562...	[ 43731, 14858, 214, 98, 12301, 32354, 20625, 142508, 23, 101089, 61340, 17164, 1556, 366, 149016, 47, 12765, 36272, 707, 137578, 202, 1914, 822, 112, 39116, 110, 184, 7225, 11675, 9384, 3674, 1984, 360, 18, 18151, 45646, 44457, 13648, 11001,...	[ 0.2254638671875, 0.214599609375, 0.06610107421875, 0.035888671875, 0.250244140625, 0.1671142578125, 0.138671875, 0.2347412109375, 0.03436279296875, 0.1680908203125, 0.123779296875, 0.1417236328125, 0.1116943359375, 0.141357421875, 0.01751708984375, 0.013885498046875, 0.1956787109375,...	embed
76887204_c0	76887204	haskell	0	Title: Joining NonEmpty types in Haskell Problem title: Joining NonEmpty types in Haskell Tags: list, haskell Problem: Joining NonEmpty types in Haskell <interactive>:65:6: error: • Couldn't match expected type: [a] with actual type: NonEmpty a1 • In the second argument of ‘(++)’, namely ‘y’ In the expression: x ++ y I...	Joining NonEmpty types in Haskell Joining NonEmpty types in Haskell list haskell it Joining NonEmpty Haskell Couldn Relevant Joining NonEmpty types in Haskell If I have two generic objects of type (NonEmpty a), how can I join those two objects into a new (NonEmpty a), just like ++ does with lists? I was expecting to be...	[ -0.0263671875, -0.00168609619140625, 0.015625, -0.00592041015625, 0.00531005859375, 0.02392578125, -0.031982421875, 0.0012359619140625, 0.00714111328125, -0.00677490234375, -0.00045013427734375, -0.032470703125, 0.0032501220703125, -0.017333984375, -0.01556396484375, 0.0147705078125, ...	[ 113053, 3775, 134332, 939, 52895, 20625, 142508, 23, 5303, 1556, 191147, 765, 6626, 189534, 36746, 10644, 59881, 10, 3642, 831, 33284, 3934, 3525, 37223, 41206, 25632, 18499, 39933, 56112, 18, 61924, 21373, 19882 ]	[ 0.217041015625, 0.1561279296875, 0.200439453125, 0.12939453125, 0.2227783203125, 0.12353515625, 0.23974609375, 0.024078369140625, 0.1263427734375, 0.1087646484375, 0.03753662109375, 0.0164031982421875, 0.1148681640625, 0.145751953125, 0.1463623046875, 0.159423828125, 0.1300048828125,...	embed
29993609_c0	29993609	haskell	0	Title: Do Cabal recognize packages installed by system package manager Problem title: Do Cabal recognize packages installed by system package manager Tags: package-managers, linker, haskell, cabal Problem: Do Cabal recognize packages installed by system package manager I had lately linker problem during compilation of ...	Do Cabal recognize packages installed by system package manager Do Cabal recognize packages installed by system package manager package-managers linker haskell cabal Cabal Do Cabal recognize packages installed by system package manager I had lately linker problem during compilation of Haskell code and I wonder whether ...	[ 0.0157470703125, -0.005279541015625, 0.01483154296875, 0.00531005859375, 0.00299072265625, 0.03125, -0.0006256103515625, 0.0167236328125, -0.015625, 0.0233154296875, -0.00762939453125, -0.01904296875, -0.00750732421875, 0.00933837890625, -0.0013580322265625, 0.01025390625, -0.0044555...	[ 984, 30438, 289, 125296, 98169, 7, 20600, 390, 5426, 31095, 141395, 3126, 56, 1556, 142508, 109524, 297, 2967, 98352, 20625, 18151, 831, 7413, 11787, 98504, 1193, 56566, 990, 21771, 10002, 11389, 214 ]	[ 0.0472412109375, 0.1864013671875, 0.1951904296875, 0.1737060546875, 0.23974609375, 0.011810302734375, 0.1748046875, 0.0986328125, 0.0767822265625, 0.2236328125, 0.1661376953125, 0.1514892578125, 0.12890625, 0.101318359375, 0.1956787109375, 0.2286376953125, 0.012542724609375, 0.0847...	embed
63022817_c0	63022817	haskell	0	Title: Tasty xml and html generation? Problem title: Tasty xml and html generation? Tags: automated-tests, haskell Problem: Tasty xml and html generation? I would like to use both tasty-ant-xml and tasty-html simultaneously. However, defaultMainWithIngredients (antXMLRunner:htmlRunner:defaultIngredients) Doing th...	Tasty xml and html generation? Tasty xml and html generation? automated-tests haskell Tasty antXMLRunner:htmlRunner:defaultIngredients Tasty xml and html generation? I would like to use both tasty-ant-xml and tasty-html simultaneously. However, Doing this and supplying both --html and --xml options at the command...	[ 0.0081787109375, 0.008056640625, 0.0113525390625, -0.0118408203125, -0.00811767578125, -0.0079345703125, -0.006103515625, -0.0123291015625, 0.0003299713134765625, 0.001556396484375, -0.00250244140625, -0.00592041015625, 0.004974365234375, 0.0067138671875, -0.0014801025390625, -0.003219...	[ 9598, 939, 131492, 2940, 7693, 58093, 11408, 297, 6954, 1556, 142508, 12936, 1542, 39456, 163321, 1679, 214810, 242238, 1884, 4527, 15044, 308, 8946, 1236, 136, 134477, 100677, 4210, 50717, 75101, 13315, 4734, 140992, 3917, 2046, 6397, 47, 13...	[ 0.2177734375, 0.2413330078125, 0.24169921875, 0.1268310546875, 0.216064453125, 0.196044921875, 0.10198974609375, 0.0171356201171875, 0.138916015625, 0.057037353515625, 0.15625, 0.10174560546875, 0.0238494873046875, 0.1624755859375, 0.0777587890625, 0.051605224609375, 0.174560546875, ...	embed
26260752_c0	26260752	haskell	0	Title: Sort one list by the order of another list Problem title: Sort one list by the order of another list Tags: haskell, sorting Problem: Sort one list by the order of another list I need to sort one list by the order of another, but I don't know how it can be done. For example: I could have a list a similar to: [C, ...	Sort one list by the order of another list Sort one list by the order of another list haskell sorting Sort Sort one list by the order of another list I need to sort one list by the order of another, but I don't know how it can be done. For example: I could have a list a similar to: And a list b (that sets the order): (...	[ 0.01531982421875, 0.005523681640625, -0.00165557861328125, 0.000675201416015625, -0.0086669921875, 0.00421142578125, -0.0196533203125, -0.00592041015625, 0.0230712890625, 0.0126953125, -0.006317138671875, 0.0096435546875, 0.000377655029296875, 0.0196533203125, -0.015869140625, -0.01708...	[ 53666, 1632, 5303, 390, 12989, 111, 15700, 1556, 142508, 12096, 214, 3871, 3714, 16940, 5809, 21373, 47, 876, 5423, 27781, 8561, 142424, 10, 5608, 17497, 71, 5701, 32036, 24209, 11249, 903 ]	[ 0.1890869140625, 0.0787353515625, 0.211669921875, 0.0362548828125, 0.1746826171875, 0.0635986328125, 0.1190185546875, 0.0987548828125, 0.1927490234375, 0.213623046875, 0.055908203125, 0.05279541015625, 0.00372314453125, 0.03662109375, 0.012359619140625, 0.083251953125, 0.072875976562...	embed
19594655_c0	19594655	haskell	0	Title: Random number in Haskell Problem title: Random number in Haskell Tags: haskell, random Problem: Random number in Haskell I'm trying to get a random number in Haskell. (Which I'm currently learning and haven't got on to Monads or IO, etc) the problem is the functions in System.Random all return an IO Int, which I...	Random number in Haskell Random number in Haskell haskell random Random Haskell Random number in Haskell I'm trying to get a random number in Haskell. (Which I'm currently learning and haven't got on to Monads or IO, etc) the problem is the functions in System.Random all return an IO Int, which I then can't use in the ...	[ -0.0027008056640625, 0.00201416015625, 0.00836181640625, -0.0003833770751953125, -0.00159454345703125, 0.0177001953125, -0.0277099609375, -0.03369140625, -0.019287109375, -0.0419921875, 0.01416015625, -0.01483154296875, -0.01483154296875, -0.0037994384765625, 0.002777099609375, -0.0024...	[ 39643, 306, 14012, 23, 20625, 142508, 1556, 96759, 31577, 2046, 82424, 52080, 38246, 60331, 6468, 17780, 2967, 32354, 12353, 126525, 3815, 756, 30646, 360, 18, 831, 4527, 18151, 136, 38699, 257, 151814, 3688, 55076, 80836, 5303, 5117, 21917, ...	[ 0.180908203125, 0.14013671875, 0.21142578125, 0.0753173828125, 0.1533203125, 0.2353515625, 0.13818359375, 0.21435546875, 0.05242919921875, 0.0748291015625, 0.031951904296875, 0.04486083984375, 0.0032958984375, 0.0545654296875, 0.04217529296875, 0.1629638671875, 0.097412109375, 0.14...	embed
72839991_c0	72839991	haskell	0	Title: Non-exhaustive patterns in function with tuples HASKELL Problem title: Non-exhaustive patterns in function with tuples HASKELL Tags: haskell Problem: Non-exhaustive patterns in function with tuples HASKELL regiuleishon :: (Bool, Integer) -> Integer regiuleishon (True, _) = 0 reguleishon (False, x) \| x >= 0 = 1 \|...	Non-exhaustive patterns in function with tuples HASKELL Non-exhaustive patterns in function with tuples HASKELL haskell Non-exhaustive HASKELL Bool Integer Non-exhaustive patterns in function with tuples HASKELL Why doesn't this code work? The program says: I try to put -> (True, 2) and the response is 0 but if I put (...	[ -0.0189208984375, 0.00775146484375, 0.00145721435546875, 0.01129150390625, 0.00421142578125, 0.016845703125, -0.00408935546875, -0.0128173828125, 0.00958251953125, 0.0076904296875, 0.01141357421875, 0.00372314453125, 0.00457763671875, 0.0089111328125, 0.019287109375, 0.0103759765625, ...	[ 3775, 3355, 18391, 4935, 103510, 32354, 678, 370, 99726, 11666, 10762, 56051, 1556, 142508, 2460, 929, 44401, 22027, 18, 903, 18151, 4488, 1528, 17378, 9790, 3884, 33079, 882, 4958, 57553, 757, 2174, 17647, 11971, 1781, 31124, 131527, 135179 ...	[ 0.146728515625, 0.025665283203125, 0.1441650390625, 0.052642822265625, 0.197021484375, 0.1331787109375, 0.06591796875, 0.094970703125, 0.1473388671875, 0.10595703125, 0.1114501953125, 0.1644287109375, 0.12890625, 0.19873046875, 0.0582275390625, 0.125244140625, 0.1468505859375, 0.09...	embed
7804802_c0	7804802	haskell	0	Title: Haskell: Types don't match Problem title: Haskell: Types don't match Tags: haskell, signature Problem: Haskell: Types don't match I just tried to write a simple function to calculate the average of the input-Ints: avg :: Int -> Int -> Int -> Float avg x y z = (x+y+z)/3 When I exchange the signature to ...	Haskell: Types don't match Haskell: Types don't match haskell signature Haskell Types Float Haskell: Types don't match I just tried to write a simple function to calculate the average of the input-Ints: When I exchange the signature to it works fine, but with the one above I get the following error message: C...	[ 0.001129150390625, -0.00665283203125, -0.00160980224609375, 0.000583648681640625, -0.0250244140625, -0.01031494140625, 0.0033416748046875, -0.001678466796875, -0.001678466796875, 0.016357421875, 0.0009613037109375, -0.03564453125, 0.0211181640625, 0.01202392578125, 0.007080078125, 0.00...	[ 20625, 142508, 60457, 7, 2301, 3768, 18, 14858, 1556, 138256, 38699, 257, 37842, 33022, 8781, 32354, 74481, 83080, 107730, 4153, 933, 121122, 43240, 5885, 18499, 26008, 191147, 84751, 10644, 919, 365, 678, 8561, 97370, 4527, 5117, 26946, 360,...	[ 0.1246337890625, 0.23583984375, 0.2347412109375, 0.027923583984375, 0.059173583984375, 0.06011962890625, 0.127685546875, 0.2030029296875, 0.1199951171875, 0.2154541015625, 0.1953125, 0.1236572265625, 0.019317626953125, 0.0157318115234375, 0.043365478515625, 0.0992431640625, 0.1136474...	embed
32026739_c0	32026739	haskell	0	Title: Could dynamic linking hurt inlining thus performance in GHC? Problem title: Could dynamic linking hurt inlining thus performance in GHC? Tags: inline, haskell, dynamic-linking, ghc Problem: Could dynamic linking hurt inlining thus performance in GHC? It's no secret that inlining is what's enabling a lot of the s...	Could dynamic linking hurt inlining thus performance in GHC? Could dynamic linking hurt inlining thus performance in GHC? inline haskell dynamic-linking ghc Could GHC Could dynamic linking hurt inlining thus performance in GHC? It's no secret that inlining is what's enabling a lot of the sophisticated optimizations GHC...	[ 0.0047607421875, -0.0107421875, 0.013916015625, 0.0031890869140625, -0.0145263671875, 0.0196533203125, -0.0184326171875, -0.0037078857421875, -0.009521484375, -0.0135498046875, -0.0029449462890625, -0.016357421875, 0.00469970703125, 0.006072998046875, 0.0145263671875, 0.00982666015625,...	[ 191147, 84079, 3126, 214, 103049, 23, 150, 592, 23718, 527, 73265, 2256, 1556, 142508, 10187, 31380, 238, 87235, 35773, 8561, 81717, 991, 11435, 5809, 7464, 7440, 201939, 56566, 10588, 40715 ]	[ 0.09375, 0.2232666015625, 0.197021484375, 0.08551025390625, 0.1790771484375, 0.1363525390625, 0.1685791015625, 0.1219482421875, 0.1611328125, 0.0794677734375, 0.1873779296875, 0.2044677734375, 0.0955810546875, 0.19580078125, 0.1741943359375, 0.0826416015625, 0.04949951171875, 0.115...	embed
14543805_c1	14543805	haskell	1	), 2180 ms doesn't cut it. So why is my first solution so ridiculously slow? Even by following the profiling tips from Real World Haskell I still can't make sense of this (all I could figure out was that the majority of time was spent in readIntPair function, which didn't help much). If you want to do some testing of y...	), 2180 ms doesn't cut it. So why is my first solution so ridiculously slow? Even by following the profiling tips from Real World Haskell I still can't make sense of this (all I could figure out was that the majority of time was spent in readIntPair function, which didn't help much). If you want to do some testing of y...	[ -0.0284423828125, 0.0078125, -0.004150390625, -0.002960205078125, -0.011474609375, 0.003997802734375, -0.025390625, -0.00567626953125, -0.005340576171875, -0.01708984375, 0.02392578125, -0.0086669921875, 0.0032958984375, 0.006927490234375, -0.00116729736328125, -0.01068115234375, -0....	[ 247, 116, 39425, 68163, 22027, 18, 59226, 442, 15400, 83, 5117, 29806, 221, 236873, 538, 72803, 9468, 6305, 5120, 6661, 20625, 142508, 7464, 831, 3249, 10422, 26366, 144732, 1733, 66933, 12301, 4153, 8335, 481, 32354, 4358, 5045, 134234, 10...	[ 0.043853759765625, 0.1009521484375, 0.225341796875, 0.173828125, 0.024261474609375, 0.0902099609375, 0.1317138671875, 0.0245819091796875, 0.0928955078125, 0.03753662109375, 0.09765625, 0.1954345703125, 0.10638427734375, 0.1121826171875, 0.03948974609375, 0.247802734375, 0.17529296875...	embed
52932828_c0	52932828	haskell	0	Title: How do I avoid stackoverflow error in Haskell Problem title: How do I avoid stackoverflow error in Haskell Tags: functional-programming, haskell, stack-overflow Problem: How do I avoid stackoverflow error in Haskell I want to make this Function: calling customPower 2 2 would give back 2^2 + 2^1 + 1 calling custo...	How do I avoid stackoverflow error in Haskell How do I avoid stackoverflow error in Haskell functional-programming haskell stack-overflow How Haskell y-1 How do I avoid stackoverflow error in Haskell I want to make this Function: calling customPower 2 2 would give back 2^2 + 2^1 + 1 calling customPower 3 3 would give b...	[ -0.00506591796875, -0.0029449462890625, 0.0033416748046875, 0.0126953125, -0.0107421875, -0.00811767578125, -0.007171630859375, 0.00628662109375, 0.0050048828125, -0.022216796875, 0.021240234375, -0.01544189453125, -0.0057373046875, -0.00469970703125, 0.032470703125, 0.004547119140625,...	[ 11249, 71864, 177261, 5465, 118664, 18499, 23, 20625, 142508, 54, 87, 123309, 28966, 1556, 113, 5759, 3444, 28670, 10763, 159029, 114122, 105022, 116, 2806, 8337, 4420, 8353, 997, 106, 138, 363, 18151, 76199, 645, 131527, 7413, 171581, 37202,...	[ 0.04840087890625, 0.219482421875, 0.1671142578125, 0.1668701171875, 0.2445068359375, 0.194091796875, 0.031005859375, 0.1585693359375, 0.2509765625, 0.002532958984375, 0.00823974609375, 0.136474609375, 0.056732177734375, 0.13525390625, 0.0966796875, 0.12060546875, 0.0384521484375, 0...	embed
74706989_c0	74706989	haskell	0	Title: How to map a function over a tree in haskell? Problem title: How to map a function over a tree in haskell? Tags: tree, haskell, function Problem: How to map a function over a tree in haskell? data Tree a = Empty \| Node a (Tree a) (Tree a) deriving (Show, Eq) mapTree :: (a -> b) -> Tree a -> Tree b maptree f Empt...	How to map a function over a tree in haskell? How to map a function over a tree in haskell? tree haskell function How Tree Empty Node Show How to map a function over a tree in haskell? This is the function I've written to try to map a function over a tree but it doesn't work as expected Why does my function return "Non...	[ -0.00653076171875, 0.006561279296875, 0.01080322265625, 0.0020751953125, 0.00164794921875, 0.00193023681640625, -0.008056640625, -0.0203857421875, -0.0106201171875, -0.0279541015625, 0.00762939453125, -0.0130615234375, -0.000579833984375, 0.0172119140625, 0.0146484375, 0.00279235839843...	[ 11249, 47, 22288, 32354, 645, 53201, 23, 1556, 142508, 101344, 31678, 939, 438, 112, 17367, 9790, 1284, 22027, 18, 4488, 237, 84751, 30646, 59881, 18391, 4935, 103510, 62731 ]	[ 0.0579833984375, 0.06378173828125, 0.1895751953125, 0.203369140625, 0.140380859375, 0.2247314453125, 0.032012939453125, 0.11376953125, 0.198486328125, 0.2196044921875, 0.14697265625, 0.107666015625, 0.114990234375, 0.11083984375, 0.0880126953125, 0.038360595703125, 0.003326416015625,...	embed
63509950_c0	63509950	haskell	0	Title: Is it possible to capture global keyboard events on macos with haskell? Problem title: Is it possible to capture global keyboard events on macos with haskell? Tags: macos, haskell Problem: Is it possible to capture global keyboard events on macos with haskell? Is there an API for haskell on macos that lets me ca...	Is it possible to capture global keyboard events on macos with haskell? Is it possible to capture global keyboard events on macos with haskell? macos haskell Is it possible to capture global keyboard events on macos with haskell? Is there an API for haskell on macos that lets me capture global keyboard events? All I fo...	[ 0.00112152099609375, 0.01275634765625, -0.0137939453125, -0.00848388671875, 0.006378173828125, 0.00182342529296875, 0.0174560546875, -0.003326416015625, -0.01495361328125, -0.03564453125, -0.00238037109375, -0.01806640625, -0.01226806640625, 0.00897216796875, -0.00616455078125, 0.00329...	[ 2071, 442, 7722, 47, 141621, 7964, 149186, 47353, 98, 291, 7840, 678, 1556, 142508, 61687, 100, 2633, 163, 14037, 1467, 62548, 58359, 43581, 38415, 33949, 12301, 2256, 17086, 3444, 1940, 19462, 3540, 7, 21135, 22799, 34695, 15549, 91084, 17...	[ 0.053253173828125, 0.04205322265625, 0.169921875, 0.04974365234375, 0.199462890625, 0.1934814453125, 0.254150390625, 0.1993408203125, 0.0950927734375, 0.116943359375, 0.197265625, 0.1151123046875, 0.16650390625, 0.268798828125, 0.1715087890625, 0.02685546875, 0.047393798828125, 0.0...	embed
22836320_c0	22836320	haskell	0	Title: Haskell Rewriting Min Class Problem title: Haskell Rewriting Min Class Tags: class, haskell, function Problem: Haskell Rewriting Min Class I'm quite new to Haskell and I'm writing a function that is similar to min instead of just accepting 2 values it'll accept 3. I've worked out the class as shown here: min3 ::...	Haskell Rewriting Min Class Haskell Rewriting Min Class class haskell function Haskell Rewriting Min min3 Haskell Rewriting Min Class I'm quite new to Haskell and I'm writing a function that is similar to min instead of just accepting 2 values it'll accept 3. I've worked out the class as shown here: However what would ...	[ -0.01336669921875, 0.0023956298828125, 0.0108642578125, -0.006256103515625, -0.0137939453125, 0.015869140625, 0.01263427734375, -0.0113525390625, 0.01348876953125, 0.0069580078125, -0.0177001953125, -0.038330078125, 0.021728515625, -0.00823974609375, -0.006378173828125, 0.0087280273437...	[ 20625, 142508, 853, 199332, 4211, 35014, 18507, 1556, 32354, 881, 363, 32233, 3525, 32562, 21373, 64457, 26946, 116, 142424, 1181, 1031, 79786, 1810, 70, 127887, 3688, 2367, 2806, 3884, 678, 68034, 7103, 3642, 5941, 107730, 77336, 31895, 1108...	[ 0.1326904296875, 0.2047119140625, 0.127685546875, 0.205322265625, 0.243408203125, 0.2279052734375, 0.1932373046875, 0.1287841796875, 0.19921875, 0.248046875, 0.1717529296875, 0.0394287109375, 0.052764892578125, 0.140625, 0.095458984375, 0.0645751953125, 0.15673828125, 0.08020019531...	embed
23927744_c0	23927744	haskell	0	Title: Where is libHSprimitive-0.5.3.0.so Problem title: Where is libHSprimitive-0.5.3.0.so Tags: haskell, mflow Problem: Where is libHSprimitive-0.5.3.0.so Trying to install MFlow on linux mint. sudo cabal install MFlow gives me this: Loading package primitive-0.5.3.0 ... : can't load .so/.DLL for: libHSprimitive-0.5....	Where is libHSprimitive-0.5.3.0.so Where is libHSprimitive-0.5.3.0.so haskell mflow Where libHSprimitive-0.5.3.0.so Where is libHSprimitive-0.5.3.0.so Trying to install MFlow on linux mint. sudo cabal install MFlow gives me this: Loading package primitive-0.5.3.0 ... : can't load .so/.DLL for: libHSprimitive-0.5.3.0.so...	[ 0.0015411376953125, 0.0181884765625, -0.01422119140625, -0.006866455078125, -0.003936767578125, 0.0072021484375, 0.0047607421875, -0.00128936767578125, -0.00099945068359375, -0.020751953125, 0.01409912109375, -0.042724609375, 0.00872802734375, -0.006988525390625, -0.0169677734375, 0.01...	[ 78662, 83, 25474, 38131, 58460, 4935, 93645, 5, 132265, 991, 1556, 142508, 347, 118664, 9, 40858, 20600, 99234, 17336, 11508, 6077, 4090, 166, 246, 109524, 228006, 98169, 128489, 13, 831, 18, 72367, 23708, 100, 5612, 53418, 9803, 99764, 367...	[ 0.1298828125, 0.06903076171875, 0.1317138671875, 0.1490478515625, 0.2071533203125, 0.209228515625, 0.2420654296875, 0.0190887451171875, 0.228515625, 0.18994140625, 0.1063232421875, 0.22607421875, 0.0828857421875, 0.2763671875, 0.022796630859375, 0.002777099609375, 0.12353515625, 0....	embed
28382932_c0	28382932	haskell	0	Title: Sorting tuples in haskell lists Problem title: Sorting tuples in haskell lists Tags: tuples, haskell, list Problem: Sorting tuples in haskell lists I'd like to sort a list of tuples by the third or fourth element (say c or d) in the list of type: myList = [(a,b,c,d,e)] I know if the tuple is of type (a,b) I can ...	Sorting tuples in haskell lists Sorting tuples in haskell lists tuples haskell list Sorting Ordering Sorting tuples in haskell lists I'd like to sort a list of tuples by the third or fourth element (say c or d) in the list of type: I know if the tuple is of type (a,b) I can use the following approach: But the type of s...	[ -0.005859375, 0.020751953125, -0.00118255615234375, 0.00135040283203125, -0.0045166015625, -0.01116943359375, -0.0179443359375, -0.004974365234375, 0.003509521484375, -0.01470947265625, -0.01251220703125, -0.00640869140625, 0.0006561279296875, -0.00933837890625, -0.01397705078125, -0.0...	[ 53666, 214, 370, 99726, 23, 1556, 142508, 5303, 81206, 1884, 47, 12096, 390, 50960, 22759, 927, 12830, 501, 104, 10644, 3714, 8705, 111, 11, 275, 25632, 51515, 75358, 959, 4488, 140909, 6626, 32562, 97841, 32354, 5675, 71, 1238 ]	[ 0.2059326171875, 0.05755615234375, 0.1527099609375, 0.2496337890625, 0.026519775390625, 0.13818359375, 0.2117919921875, 0.18798828125, 0.15478515625, 0.06146240234375, 0.006500244140625, 0.2266845703125, 0.059814453125, 0.1680908203125, 0.11962890625, 0.08984375, 0.1177978515625, 0...	embed
66350887_c0	66350887	haskell	0	Title: What is the meaning of comma separated names in brackets - as a binding? Problem title: What is the meaning of comma separated names in brackets - as a binding? Tags: haskell Problem: What is the meaning of comma separated names in brackets - as a binding? In a document ( https://riptutorial.com/Download/haskell...	What is the meaning of comma separated names in brackets - as a binding? What is the meaning of comma separated names in brackets - as a binding? haskell What Double What is the meaning of comma separated names in brackets - as a binding? In a document ( https://riptutorial.com/Download/haskell-language.pdf ), in Chapt...	[ -0.023681640625, -0.003326416015625, -0.0021514892578125, 0.01171875, 0.01318359375, 0.03173828125, 0.002166748046875, -0.01025390625, 0.007598876953125, 0.0281982421875, -0.005767822265625, -0.0169677734375, 0.0101318359375, -0.01025390625, -0.00116729736328125, 0.003082275390625, -...	[ 4865, 70, 91084, 96117, 84797, 71, 123055, 23, 1620, 27853, 7, 237, 128239, 1556, 142508, 107172, 83, 10, 77275, 144786, 10557, 196651, 1172, 15555, 190647, 27781, 125195, 7134, 46429, 4, 164917, 29459 ]	[ 0.06109619140625, 0.0215911865234375, 0.1954345703125, 0.23828125, 0.2091064453125, 0.0721435546875, 0.1832275390625, 0.0693359375, 0.1710205078125, 0.2042236328125, 0.00823974609375, 0.0870361328125, 0.2017822265625, 0.130859375, 0.2169189453125, 0.18994140625, 0.0294647216796875, ...	embed
13940377_c0	13940377	haskell	0	Title: Does tail recursion necessarily need an accumulator? Problem title: Does tail recursion necessarily need an accumulator? Tags: recursion, tail-recursion, haskell Problem: Does tail recursion necessarily need an accumulator? For instance, since the following function don't have an accumulator, is it still tail re...	Does tail recursion necessarily need an accumulator? Does tail recursion necessarily need an accumulator? recursion tail-recursion haskell Does Ord Bool h:t Does tail recursion necessarily need an accumulator? For instance, since the following function don't have an accumulator, is it still tail recursive? All the comp...	[ -0.0020599365234375, 0.029296875, 0.00946044921875, 0.022705078125, -0.004486083984375, 0.0113525390625, -0.013427734375, -0.0255126953125, -0.00049591064453125, -0.0130615234375, 0.041015625, -0.0194091796875, 0.01092529296875, 0.0157470703125, 0.024169921875, -0.00182342529296875, ...	[ 46741, 195625, 1830, 204988, 3871, 183278, 1290, 107, 48650, 1556, 142508, 101790, 35379, 2460, 929, 1096, 18, 142, 25632, 32354, 2301, 765, 7464, 5844, 181135, 9433, 8108, 11782, 129980, 35431, 90698 ]	[ 0.2384033203125, 0.19482421875, 0.0899658203125, 0.1217041015625, 0.1239013671875, 0.1939697265625, 0.1715087890625, 0.0304107666015625, 0.139892578125, 0.111083984375, 0.18896484375, 0.0067138671875, 0.1573486328125, 0.07427978515625, 0.1656494140625, 0.0188446044921875, 0.060302734...	embed
39645184_c0	39645184	haskell	0	Title: How is Haskell's seq used? Problem title: How is Haskell's seq used? Tags: haskell, strictness Problem: How is Haskell's seq used? So, Haskell seq function forces the evaluation of it's first argument and returns the second. Consequently it is an infix operator. If you want to force the evaluation of a...	How is Haskell's seq used? How is Haskell's seq used? haskell strictness How Haskell How is Haskell's seq used? So, Haskell seq function forces the evaluation of it's first argument and returns the second. Consequently it is an infix operator. If you want to force the evaluation of an expression, intuitively ...	[ 0.00897216796875, 0.0177001953125, 0.0263671875, 0.03515625, 0.030029296875, 0.014404296875, -0.0021514892578125, 0.01416015625, -0.0045166015625, -0.016845703125, 0.00170135498046875, -0.0025634765625, 0.0024261474609375, 0.0179443359375, -0.01373291015625, -0.0086669921875, -0.0018...	[ 11249, 83, 20625, 142508, 3768, 7, 40, 864, 11814, 1556, 81113, 7432, 25, 32354, 84616, 219836, 5117, 10750, 136, 30646, 17932, 142, 23, 55923, 39933, 3444, 37772, 125195, 100270, 6044, 60213, 220, 1294, 64457, 2174, 34292, 10, 15400, 876, ...	[ 0.1123046875, 0.0914306640625, 0.165283203125, 0.281982421875, 0.08526611328125, 0.066650390625, 0.1717529296875, 0.259033203125, 0.20068359375, 0.140869140625, 0.20263671875, 0.09039306640625, 0.033721923828125, 0.1739501953125, 0.1719970703125, 0.171142578125, 0.0556640625, 0.182...	embed
53210737_c0	53210737	haskell	0	Title: How get yesterday in Haskell? Current date - 1 day? Problem title: How get yesterday in Haskell? Current date - 1 day? Tags: haskell Problem: How get yesterday in Haskell? Current date - 1 day? How get yesterday in Haskell? For the current day - of course it works like this: date :: IO (Integer,Int,Int) -- :: (y...	How get yesterday in Haskell? Current date - 1 day? How get yesterday in Haskell? Current date - 1 day? haskell sysdba.routine How Haskell Current Integer How get yesterday in Haskell? Current date - 1 day? How get yesterday in Haskell? For the current day - of course it works like this: But for yesterday? Does that wo...	[ -0.0164794921875, -0.00121307373046875, 0.01220703125, 0.03515625, 0.01214599609375, -0.0018768310546875, -0.0035400390625, 0.003265380859375, -0.00836181640625, -0.047607421875, -0.015869140625, -0.005889892578125, -0.01043701171875, -0.0004100799560546875, -0.00124359130859375, -0.00...	[ 11249, 2046, 131101, 23, 20625, 142508, 114063, 5622, 106, 5155, 1556, 954, 54353, 14179, 10325, 44401, 1326, 43581, 43240, 1884, 903, 4966, 100, 450, 4488, 71337, 45962, 70059, 17106, 99247, 678 ]	[ 0.131591796875, 0.160888671875, 0.29248046875, 0.0816650390625, 0.150146484375, 0.263916015625, 0.21826171875, 0.1456298828125, 0.0958251953125, 0.1488037109375, 0.1243896484375, 0.0269317626953125, 0.1087646484375, 0.06463623046875, 0.08001708984375, 0.2060546875, 0.035888671875, ...	embed
22246317_c0	22246317	haskell	0	Title: If we should avoid foldl in Haskell, should we also avoid all helpers based on it? Problem title: If we should avoid foldl in Haskell, should we also avoid all helpers based on it? Tags: haskell, fold, performance Problem: If we should avoid foldl in Haskell, should we also avoid all helpers based on it? Given (...	If we should avoid foldl in Haskell, should we also avoid all helpers based on it? If we should avoid foldl in Haskell, should we also avoid all helpers based on it? haskell fold performance Haskell If we should avoid foldl in Haskell, should we also avoid all helpers based on it? Given (?) that foldl' is always prefer...	[ -0.011474609375, -0.0211181640625, 0.025146484375, -0.005859375, -0.0216064453125, 0.01904296875, -0.0228271484375, -0.023681640625, -0.00555419921875, -0.037841796875, 0.005340576171875, -0.0162353515625, -0.007568359375, 0.0020904541015625, 0.000827789306640625, 0.000392913818359375,...	[ 71864, 18344, 20469, 20625, 142508, 4358, 1314, 35509, 756, 1556, 42822, 23718, 5608, 442, 25, 11343, 12601, 2822, 38132, 2965, 4527, 98169, 93766, 51359, 127689 ]	[ 0.129638671875, 0.164306640625, 0.21337890625, 0.1063232421875, 0.2132568359375, 0.1654052734375, 0.1136474609375, 0.084716796875, 0.029449462890625, 0.0831298828125, 0.2076416015625, 0.1639404296875, 0.0059814453125, 0.0149383544921875, 0.034912109375, 0.06134033203125, 0.0806884765...	embed
48552715_c0	48552715	haskell	0	Title: "typeclass-constrained type variable when beta reducing" use case Problem title: "typeclass-constrained type variable when beta reducing" use case Tags: haskell Problem: "typeclass-constrained type variable when beta reducing" use case I'm learning Haskell and there is a logic I don't underst...	"typeclass-constrained type variable when beta reducing" use case "typeclass-constrained type variable when beta reducing" use case haskell Prelude Ord Num "typeclass-constrained type variable when beta reducing" use case I'm learning Haskell and there is a logic I don't understand when we reduce th...	[ 0.009521484375, -0.0245361328125, 0.0101318359375, 0.0159912109375, 0.01904296875, -0.0064697265625, -0.0174560546875, 0.00122833251953125, 0.00390625, -0.00185394287109375, -0.01226806640625, -0.045166015625, 0.01397705078125, -0.00360107421875, 0, -0.0233154296875, -0.0104370117187...	[ 50986, 67413, 2271, 9297, 122009, 10644, 77336, 51703, 241866, 4527, 7225, 3229, 1556, 142508, 1914, 822, 35379, 52782, 20625, 83, 62775, 28219, 34390, 125195, 15400, 158, 84751, 1286 ]	[ 0.162841796875, 0.2144775390625, 0.06982421875, 0.14990234375, 0.0732421875, 0.1630859375, 0.2027587890625, 0.1759033203125, 0.1981201171875, 0.06036376953125, 0.1063232421875, 0.026641845703125, 0.08056640625, 0.168212890625, 0.0161590576171875, 0.0845947265625, 0.1259765625, 0.18...	embed
8959226_c0	8959226	haskell	0	Title: Constructing IOVector from Storable MVector Problem title: Constructing IOVector from Storable MVector Tags: haskell, vector Problem: Constructing IOVector from Storable MVector How do you build IOVector from MVector ? IOVector is documented as: type IOVector = MVector RealWorld I have a MVector like below, and ...	Constructing IOVector from Storable MVector Constructing IOVector from Storable MVector haskell vector Storable Constructing IOVector MVector RealWorld MSV.replicate PrimState CShort Constructing IOVector from Storable MVector How do you build IOVector from MVector ? IOVector is documented as: I have a MVector like bel...	[ -0.01336669921875, 0.0244140625, -0.0198974609375, -0.0001220703125, 0.0155029296875, 0.0213623046875, -0.0341796875, -0.000949859619140625, -0.0169677734375, -0.02001953125, 0.016845703125, -0.0380859375, 0.0294189453125, -0.001983642578125, -0.0006103515625, -0.00023555755615234375, ...	[ 1657, 36716, 214, 87, 31719, 13, 18770, 1295, 23604, 2886, 66160, 1556, 142508, 173, 5120, 70646, 276, 43486, 52721, 44506, 135206, 5922, 11249, 54, 398, 45367, 705, 83, 12937, 237, 765, 1884, 35064, 1221, 64549, 107730, 5, 309, 115840, 1...	[ 0.0716552734375, 0.1424560546875, 0.0440673828125, 0.236572265625, 0.239501953125, 0.22265625, 0.291748046875, 0.15771484375, 0.1829833984375, 0.192138671875, 0.2003173828125, 0.109619140625, 0.200927734375, 0.197509765625, 0.1015625, 0.09649658203125, 0.1231689453125, 0.2993164062...	embed
31439991_c1	31439991	haskell	1	" .= object ["tel" .= tel]] ... let reply3 = AttachMsg3 attach BL.putStrLn (encode reply3) and got the answer I wanted: {"attach":{"tel":"+447890"}} . @bheklilr is there a way to use Attach's (already defined) serialisation, instead of defining it again? I've tried some nonsense syntax, but understandably it doesn't co...	" .= object ["tel" .= tel]] ... let reply3 = AttachMsg3 attach BL.putStrLn (encode reply3) and got the answer I wanted: {"attach":{"tel":"+447890"}} . @bheklilr is there a way to use Attach's (already defined) serialisation, instead of defining it again? I've tried some nonsense syntax, but understandably it doesn't co...	[ -0.0047607421875, -0.0036468505859375, 0.00927734375, -0.00848388671875, -0.01220703125, -0.0157470703125, -0.016845703125, 0.0245361328125, 0.00860595703125, -0.0267333984375, -0.0062255859375, -0.00958251953125, 0.0223388671875, 0.0106201171875, 0.008056640625, 0.0264892578125, -0....	[ 1369, 36746, 1708, 8131, 2633, 75836, 363, 9208, 934, 594, 7, 177, 243, 68170, 7077, 71713, 866, 19, 33, 40899, 21320, 35166, 36663, 257, 52438, 130262, 157376, 5039, 2685, 3917, 4527, 1283, 61924, 35686, 15032, 64457, 13204, 449, 442, 13...	[ 0.05712890625, 0.1951904296875, 0.142333984375, 0.1304931640625, 0.02349853515625, 0.180908203125, 0.1412353515625, 0.2164306640625, 0.272216796875, 0.010955810546875, 0.047760009765625, 0.04132080078125, 0.14599609375, 0.0867919921875, 0.1068115234375, 0.094482421875, 0.02099609375,...	embed

43223842_c0

43223842

haskell

0

Title: Does a functor always return a lifted type in haskell when the fmap transformation is applied? Problem title: Does a functor always return a lifted type in haskell when the fmap transformation is applied? Tags: category-theory, functor, haskell, lifting Problem: Does a functor always return a lifted type in hask...

Does a functor always return a lifted type in haskell when the fmap transformation is applied? Does a functor always return a lifted type in haskell when the fmap transformation is applied? category-theory functor haskell lifting Does Maybe Does a functor always return a lifted type in haskell when the fmap transformat...

[ 0.003936767578125, -0.002685546875, 0.0142822265625, 0.00958251953125, 0.01483154296875, 0.01019287109375, -0.00531005859375, 0.00116729736328125, -0.0024566650390625, 0.00537109375, 0.0177001953125, -0.01806640625, -0.0159912109375, 0.01397705078125, 0.0050048828125, -0.00836181640625...

[ 101790, 7477, 18770, 11343, 30646, 60520, 297, 10644, 1556, 142508, 1238, 62346, 167201, 190659, 23, 95487, 177691, 83425, 3229, 765, 360, 18, 59911, 237, 137565, 20051, 16916 ]

[ 0.0677490234375, 0.1839599609375, 0.2322998046875, 0.171142578125, 0.2108154296875, 0.2447509765625, 0.1025390625, 0.2265625, 0.1402587890625, 0.245361328125, 0.1085205078125, 0.2001953125, 0.205078125, 0.11865234375, 0.04376220703125, 0.06158447265625, 0.2568359375, 0.256103515625...

embed

43397137_c0

43397137

haskell

0

Title: String concatenation in Haskell Problem title: String concatenation in Haskell Tags: string, haskell Problem: String concatenation in Haskell My problem is to build a function that given a person and an amount of hours( Integer ) it adds "erp" at the start of the name, but the "r" must multiply the amount of hou...

String concatenation in Haskell String concatenation in Haskell string haskell Haskell Integer Client Aperson String concatenation in Haskell My problem is to build a function that given a person and an amount of hours( Integer ) it adds "erp" at the start of the name, but the "r" must multiply the amount of hours. My ...

[ -0.01025390625, 0.00147247314453125, -0.00007534027099609375, 0.0224609375, -0.00182342529296875, 0.00457763671875, -0.03515625, 0.0235595703125, 0.030517578125, -0.021728515625, 0.009521484375, -0.01141357421875, 0.025390625, 0.0091552734375, -0.01043701171875, -0.0234375, -0.001136...

[ 23351, 214, 158, 4460, 33, 2320, 23, 20625, 142508, 79315, 1556, 44401, 91732, 62, 30816, 2967, 45367, 32354, 34475, 10, 3445, 41170, 21974, 15190, 56, 254, 4034, 70, 9351, 1284, 42, 8110, 6024, 62479, 2646, 10644, 27781, 3714, 3642, 1331...

[ 0.1993408203125, 0.1119384765625, 0.1171875, 0.1717529296875, 0.12744140625, 0.02630615234375, 0.043243408203125, 0.1380615234375, 0.2318115234375, 0.2091064453125, 0.1141357421875, 0.1690673828125, 0.2012939453125, 0.054443359375, 0.1903076171875, 0.0933837890625, 0.1058349609375, ...

embed

9654975_c0

9654975

haskell

0

Title: Why does haskell throw this error? Problem title: Why does haskell throw this error? Tags: haskell Problem: Why does haskell throw this error? Trying to write function that numerize items of list and returns list of tuples with numbers, ya I know I can do it with 'zip' function, but task is to write it with recu...

Why does haskell throw this error? Why does haskell throw this error? haskell Why x:xs Why does haskell throw this error? Trying to write function that numerize items of list and returns list of tuples with numbers, ya I know I can do it with 'zip' function, but task is to write it with recursion: so I get What am I do...

[ -0.021484375, 0.0152587890625, -0.0029754638671875, 0.0064697265625, 0.00445556640625, 0.01300048828125, -0.0174560546875, 0.01251220703125, 0.025634765625, 0.00872802734375, 0.0032806396484375, -0.03662109375, 0.0164794921875, 0.0076904296875, -0.004302978515625, -0.0125732421875, 0...

[ 44084, 14602, 1556, 142508, 104250, 903, 18499, 1022, 12, 425, 7, 40858, 33022, 32354, 54744, 731, 55769, 111, 5303, 30646, 370, 99726, 101935, 151, 3714, 831, 50836, 66211, 678, 195625, 1830, 2046, 4865, 444, 20594, 44691 ]

[ 0.130615234375, 0.06982421875, 0.159912109375, 0.236083984375, 0.1739501953125, 0.1319580078125, 0.2254638671875, 0.0953369140625, 0.09100341796875, 0.131591796875, 0.0865478515625, 0.046356201171875, 0.083740234375, 0.125732421875, 0.1092529296875, 0.0299530029296875, 0.094055175781...

embed

29719142_c0

29719142

haskell

0

Title: Do I need to worry about packed primops in GHC? Problem title: Do I need to worry about packed primops in GHC? Tags: performance, haskell Problem: Do I need to worry about packed primops in GHC? There is an additional (internal) layer in GHC which just wraps the primitive known to meet the Int abstraction requir...

Do I need to worry about packed primops in GHC? Do I need to worry about packed primops in GHC? performance haskell GHC CTYPE HsInt Do I need to worry about packed primops in GHC? There is an additional (internal) layer in GHC which just wraps the primitive known to meet the Int abstraction requirements. As a GHC user,...

[ 0.010009765625, -0.000171661376953125, 0.0135498046875, 0.0157470703125, -0.0093994140625, 0.0252685546875, -0.0172119140625, -0.019775390625, 0.0059814453125, -0.005279541015625, 0.01336669921875, -0.02001953125, -0.0125732421875, 0.018798828125, -0.003509521484375, 0.0224609375, 0....

[ 90908, 43824, 297, 10014, 6423, 527, 73265, 23, 23718, 1556, 142508, 27143, 572, 4153, 18, 3871, 78301, 10433, 135355, 137565, 128489, 13, 23356, 360, 164789, 96679, 38937, 84751, 4527, 100094, 16992, 724, 139392, 18151, 4904, 10366 ]

[ 0.03424072265625, 0.1834716796875, 0.037261962890625, 0.1357421875, 0.1295166015625, 0.095947265625, 0.21240234375, 0.042327880859375, 0.1318359375, 0.1107177734375, 0.200439453125, 0.047821044921875, 0.034027099609375, 0.014984130859375, 0.025299072265625, 0.012420654296875, 0.06451...

embed

56870837_c0

56870837

haskell

0

Title: Module export list: how to export imported module? Problem title: Module export list: how to export imported module? Tags: haskell Problem: Module export list: how to export imported module? I can re-export imported module like: module My ( module Another , A ) where import Another But this form will export only...

Module export list: how to export imported module? Module export list: how to export imported module? haskell Another Module Module export list: how to export imported module? I can re-export imported module like: But this form will export only Another and A . How to export anything (all!) and imported module without t...

[ -0.01611328125, -0.00592041015625, -0.0135498046875, 0.0380859375, -0.0028839111328125, 0.002410888671875, -0.002777099609375, 0.0064697265625, 0.02001953125, 0.01202392578125, 0.0010528564453125, -0.016845703125, 0.01202392578125, 0.040283203125, -0.0081787109375, -0.00604248046875, ...

[ 63014, 31255, 5303, 3642, 47, 76242, 71, 88996, 13, 1556, 142508, 116267, 831, 456, 180758, 3173, 4734, 136, 62, 11249, 23937, 5584, 15490, 189085, 756, 214, 26582, 7940, 4568, 24927, 7722, 28271 ]

[ 0.171875, 0.267822265625, 0.156005859375, 0.088134765625, 0.040740966796875, 0.231201171875, 0.1007080078125, 0.249755859375, 0.036407470703125, 0.11181640625, 0.192626953125, 0.16650390625, 0.012481689453125, 0.1082763671875, 0.252197265625, 0.1297607421875, 0.022064208984375, 0.0...

embed

59144172_c0

59144172

haskell

0

Title: Case - why am i getting illegal lambda expression Problem title: Case - why am i getting illegal lambda expression Tags: haskell Problem: Case - why am i getting illegal lambda expression data Nat = Zero | Succ Nat data NatSig val = NatSig {zero_ :: val, succ :: val -> val} foldNat :: NatSig val -> Nat -> val fo...

Case - why am i getting illegal lambda expression Case - why am i getting illegal lambda expression haskell Case Nat Zero Succ NatSig zero_ Illegal XLambdaCase Case - why am i getting illegal lambda expression Hello this is a code from my University but if i want to run it i get an error some one know why?

[ -0.0277099609375, 0.005096435546875, -0.00970458984375, -0.0027618408203125, 0.0020294189453125, 0.00091552734375, 0.0106201171875, 0.01080322265625, 0.000804901123046875, -0.036865234375, 0.023193359375, -0.0252685546875, -0.00531005859375, 0.004852294921875, 0.0068359375, -0.01867675...

[ 43731, 15400, 444, 17, 20949, 85325, 21, 6492, 85, 125195, 1556, 142508, 68875, 83947, 1832, 10060, 294, 872, 45234, 891, 86966, 60696, 441, 6991, 35378, 18151, 1295, 12535, 3444, 11675, 442, 2046, 18499, 3060, 1632, 3714 ]

[ 0.1986083984375, 0.1431884765625, 0.096435546875, 0.0404052734375, 0.092529296875, 0.190185546875, 0.05963134765625, 0.1781005859375, 0.1654052734375, 0.2008056640625, 0.0770263671875, 0.1885986328125, 0.142822265625, 0.1378173828125, 0.06402587890625, 0.048553466796875, 0.0090637207...

embed

34069245_c0

34069245

haskell

0

Title: Haskell Type class using foldr Problem title: Haskell Type class using foldr Tags: haskell, types, typeclass, list Problem: Haskell Type class using foldr I wrote a function using foldr that determines the length of a list or string. I'm a little confused as to why Haskell determined the type class to be of Num....

Haskell Type class using foldr Haskell Type class using foldr haskell types typeclass list foldr Haskell Type Num Haskell Type class using foldr I wrote a function using foldr that determines the length of a list or string. I'm a little confused as to why Haskell determined the type class to be of Num. Surely strings a...

[ -0.016357421875, 0.01251220703125, 0.004302978515625, 0.021728515625, -0.008056640625, 0.02734375, 0.01019287109375, -0.00092315673828125, 0.00139617919921875, -0.0361328125, -0.02392578125, -0.060546875, 0.007568359375, -0.003509521484375, -0.0142822265625, -0.0076904296875, -0.0191...

[ 20625, 142508, 60457, 18507, 17368, 18344, 7569, 1556, 52895, 10644, 67413, 5303, 52782, 54397, 32354, 83324, 140909, 707, 79315, 10176, 55681, 15400, 71, 47, 186, 111, 18, 99201, 23, 903, 51636, 8110, 221, 23742, 4488, 191147, 4358, 17306 ]

[ 0.14111328125, 0.237060546875, 0.216064453125, 0.2127685546875, 0.06683349609375, 0.1439208984375, 0.2025146484375, 0.1279296875, 0.188720703125, 0.2158203125, 0.1522216796875, 0.1470947265625, 0.2215576171875, 0.041259765625, 0.1546630859375, 0.1114501953125, 0.1373291015625, 0.00...

embed

52245576_c0

52245576

haskell

0

Title: Conditional Cabal Build Flag Failing Problem title: Conditional Cabal Build Flag Failing Tags: cabal, haskell Problem: Conditional Cabal Build Flag Failing I have set the following structure in my project's cabal file: library if flag(no-tracking) hs-source-dirs: src, no-telemetry else hs-source-dirs: src, telem...

Conditional Cabal Build Flag Failing Conditional Cabal Build Flag Failing cabal haskell Conditional Cabal Build Flag Failing Conditional Cabal Build Flag Failing I have set the following structure in my project's cabal file: But I get "can't find source for " errors. I have verified that both hs-source-dirs: src, telem...

[ -0.00347900390625, 0.00518798828125, -0.002288818359375, 0.0107421875, -0.00107574462890625, -0.006927490234375, -0.00009679794311523438, 0.01422119140625, -0.0174560546875, 0.0322265625, 0.0037689208984375, -0.0277099609375, 0.00799560546875, 0.0059814453125, 0.009521484375, 0.0148315...

[ 46347, 43315, 30438, 289, 121137, 125726, 190355, 214, 109524, 1556, 142508, 5423, 25632, 45646, 13452, 11435, 4398, 18, 7413, 31344, 100, 18499, 493, 47314, 1096, 7, 60427, 936, 19437, 5501, 1928, 110, 3025, 1294, 4488, 15490, 35431, 7225, ...

[ 0.1591796875, 0.10577392578125, 0.166259765625, 0.130615234375, 0.135498046875, 0.1888427734375, 0.1693115234375, 0.06689453125, 0.2147216796875, 0.10589599609375, 0.2076416015625, 0.068115234375, 0.0258636474609375, 0.1851806640625, 0.085205078125, 0.063232421875, 0.070556640625, ...

embed

42100206_c0

42100206

haskell

0

Title: Options.Applicative, (<>) and the Monoid type class Problem title: Options.Applicative, (<>) and the Monoid type class Tags: haskell Problem: Options.Applicative, (<>) and the Monoid type class I am learning about Haskell. I am importing the Options.Applicative module, like so: import Options.Applica...

Options.Applicative, (<>) and the Monoid type class Options.Applicative, (<>) and the Monoid type class haskell Options.Applicative qualified Monoid Parser Module Options.Applicative, (<>) and the Monoid type class I am learning about Haskell. I am importing the Options.Applicative module, like so: However,...

[ -0.0123291015625, 0.003936767578125, 0.01031494140625, 0.04541015625, 0.00014495849609375, 0.01953125, 0.0086669921875, -0.0269775390625, -0.0079345703125, 0.00653076171875, 0.004547119140625, -0.009765625, 0.00799560546875, 0.0103759765625, -0.0107421875, -0.00811767578125, -0.00381...

[ 152448, 5, 39179, 11048, 4935, 5386, 136, 77879, 532, 10644, 18507, 1556, 142508, 217225, 2392, 2189, 63014, 52080, 20625, 24927, 214, 88996, 1884, 221, 903, 30646, 4865, 83, 44691, 3293, 209806, 42459, 5608, 7722 ]

[ 0.24658203125, 0.004241943359375, 0.09466552734375, 0.1424560546875, 0.159912109375, 0.01763916015625, 0.0165863037109375, 0.1796875, 0.1368408203125, 0.1202392578125, 0.1639404296875, 0.13623046875, 0.2286376953125, 0.14794921875, 0.06884765625, 0.0751953125, 0.09521484375, 0.0387...

embed

65281573_c0

65281573

haskell

0

Title: How do we partition list in Haskell by a separator element of the list? Problem title: How do we partition list in Haskell by a separator element of the list? Tags: haskell Problem: How do we partition list in Haskell by a separator element of the list? I want to take an Int value and a list that returns a list ...

How do we partition list in Haskell by a separator element of the list? How do we partition list in Haskell by a separator element of the list? haskell How Haskell How do we partition list in Haskell by a separator element of the list? I want to take an Int value and a list that returns a list of lists where the Int va...

[ -0.00299072265625, 0.0054931640625, -0.009521484375, 0.001678466796875, -0.0262451171875, 0.0081787109375, -0.0016021728515625, -0.01019287109375, 0.00136566162109375, 0.0118408203125, -0.0174560546875, 0.008544921875, 0.0002994537353515625, 0.01055908203125, -0.015869140625, -0.008972...

[ 11249, 54, 642, 2878, 1363, 5303, 23, 20625, 142508, 390, 38310, 748, 12830, 111, 1556, 3444, 5646, 360, 18, 34292, 136, 30646, 84797, 142424, 3934, 94407, 27781, 35064, 89536 ]

[ 0.09844970703125, 0.045989990234375, 0.05963134765625, 0.21435546875, 0.166748046875, 0.2315673828125, 0.0653076171875, 0.134521484375, 0.2342529296875, 0.07958984375, 0.174560546875, 0.1427001953125, 0.1458740234375, 0.017791748046875, 0.1138916015625, 0.06610107421875, 0.0511169433...

embed

68429042_c0

68429042

haskell

0

Title: Replace where case of with guards Problem title: Replace where case of with guards Tags: haskell Problem: Replace where case of with guards I have specific situation I've checked a link here and I was wondering if the same strategy could be applied within a where statement in haskell. Suppose I have a function: ...

Replace where case of with guards Replace where case of with guards haskell Replace Func1 Term Foo Func1a Func1b Bar Replace where case of with guards I have specific situation I've checked a link here and I was wondering if the same strategy could be applied within a where statement in haskell. Suppose I have a functi...

[ -0.006591796875, 0.009033203125, 0.0023651123046875, -0.00897216796875, 0.0033416748046875, -0.0001583099365234375, -0.0235595703125, 0.00579833984375, 0.004302978515625, -0.006195068359375, 0.0166015625, 0.00738525390625, 0.0004596710205078125, -0.00173187255859375, 0.0130615234375, -...

[ 853, 23935, 7440, 7225, 111, 678, 56050, 7, 1556, 142508, 28670, 238, 418, 2994, 9572, 31, 11, 275, 3253, 29458, 16648, 12765, 149016, 5701, 113857, 5809, 190659, 28032, 63805, 23, 32354, 3917, 47, 91995, 70 ]

[ 0.0765380859375, 0.1590576171875, 0.2054443359375, 0.217529296875, 0.259765625, 0.12548828125, 0.266845703125, 0.1385498046875, 0.16552734375, 0.2431640625, 0.1392822265625, 0.01300048828125, 0.01141357421875, 0.1094970703125, 0.119384765625, 0.0950927734375, 0.0182342529296875, 0....

embed

58039818_c0

58039818

haskell

0

Title: Data.Text constants in Haskell Problem title: Data.Text constants in Haskell Tags: text, compiler-errors, string, haskell Problem: Data.Text constants in Haskell In the documentation of Data.Text, there are examples such as replace "oo" "foo" "oo" . However, when I try to run this, it tells me that the function ...

Data.Text constants in Haskell Data.Text constants in Haskell text compiler-errors string haskell Data.Text Haskell Data.Text constants in Haskell In the documentation of Data.Text, there are examples such as replace "oo" "foo" "oo" . However, when I try to run this, it tells me that the function replace was expecting ...

[ 0.02783203125, -0.0004825592041015625, -0.006866455078125, 0.022216796875, 0.004058837890625, 0.00067901611328125, -0.006744384765625, -0.01165771484375, -0.01116943359375, 0.001373291015625, -0.0019073486328125, -0.0098876953125, 0.0079345703125, 0.002105712890625, 0.0091552734375, 0....

[ 11809, 174379, 53697, 23, 20625, 142508, 7986, 9969, 34759, 188800, 79315, 1556, 7, 209806, 5, 27781, 91995, 16635, 3584, 31, 9790, 11675, 903, 163, 32354, 41206, 214, 24129, 1284, 4163, 23351, 43824, 12912, 11907, 15504, 5180, 3934, 10644, ...

[ 0.152099609375, 0.255126953125, 0.24365234375, 0.0166473388671875, 0.134521484375, 0.2177734375, 0.2274169921875, 0.09033203125, 0.091064453125, 0.173095703125, 0.16015625, 0.107177734375, 0.056640625, 0.1693115234375, 0.0179901123046875, 0.1680908203125, 0.1876220703125, 0.1765136...

embed

61699509_c0

61699509

haskell

0

Title: Haskell, hGetContents blocking problem (reading more lines) Problem title: Haskell, hGetContents blocking problem (reading more lines) Tags: haskell Problem: Haskell, hGetContents blocking problem (reading more lines) I am writing a TCP client-server and I want to pass more lines from server to client. Server: h...

Haskell, hGetContents blocking problem (reading more lines) Haskell, hGetContents blocking problem (reading more lines) haskell Haskell Haskell, hGetContents blocking problem (reading more lines) I am writing a TCP client-server and I want to pass more lines from server to client. Server: Client: However, I get the mes...

[ -0.0024261474609375, 0.0162353515625, 0.00927734375, -0.010009765625, -0.0089111328125, -0.0072021484375, 0.00537109375, -0.006011962890625, 0.005615234375, -0.0244140625, 0.015869140625, -0.01275634765625, 0.0159912109375, -0.014892578125, 0.0038909912109375, 0.0203857421875, 0.0324...

[ 20625, 142508, 4, 1096, 724, 126, 11935, 25352, 46389, 2967, 39116, 214, 1286, 124519, 1556, 32562, 17854, 23282, 39642, 3444, 27875, 1295, 10723, 47, 22687, 91732, 33306, 2046, 26008, 1284, 7103, 2448, 136, 79315, 64007, 3890, 959, 28412, ...

[ 0.1304931640625, 0.21826171875, 0.000823974609375, 0.0787353515625, 0.09423828125, 0.14013671875, 0.106689453125, 0.1787109375, 0.2274169921875, 0.154296875, 0.1717529296875, 0.0275115966796875, 0.16796875, 0.1700439453125, 0.1141357421875, 0.1201171875, 0.102294921875, 0.188720703...

embed

34257148_c0

34257148

haskell

0

Title: How to detect last chunk in a Haskell Pipe? Problem title: How to detect last chunk in a Haskell Pipe? Tags: haskell, haskell-pipes Problem: How to detect last chunk in a Haskell Pipe? I have a small Haskell Pipe that prints out how many times it has run: counterPipe :: Pipe String String IO r counterPipe = go 0...

How to detect last chunk in a Haskell Pipe? How to detect last chunk in a Haskell Pipe? haskell haskell-pipes How Haskell Pipe Chunk How to detect last chunk in a Haskell Pipe? I have a small Haskell Pipe that prints out how many times it has run: I'd like to be able to print out a message, and potentially perform othe...

[ -0.00106048583984375, 0.004547119140625, 0.006195068359375, 0.0157470703125, -0.0157470703125, 0.012451171875, -0.011962890625, -0.027099609375, -0.01806640625, -0.0016632080078125, -0.005126953125, -0.0074462890625, 0.03076171875, 0.02490234375, 0.01708984375, 0.003387451171875, -0....

[ 11249, 47, 96391, 4568, 7839, 92, 23, 20625, 142508, 93128, 13, 1556, 1434, 13569, 112204, 10, 765, 19336, 28412, 1810, 3642, 5941, 20028, 11675, 1884, 19048, 26008, 38516, 51339, 3789, 66211, 24145, 9433, 903 ]

[ 0.080322265625, 0.06475830078125, 0.2139892578125, 0.225341796875, 0.2047119140625, 0.13232421875, 0.06744384765625, 0.13525390625, 0.2286376953125, 0.152587890625, 0.1004638671875, 0.1258544921875, 0.09906005859375, 0.05938720703125, 0.1859130859375, 0.000244140625, 0.00167846679687...

embed

34474655_c0

34474655

haskell

0

Title: How to write inline YAML (flow style) in Haskell? Problem title: How to write inline YAML (flow style) in Haskell? Tags: pretty-print, yaml, aeson, haskell Problem: How to write inline YAML (flow style) in Haskell? I'm using Data.Yaml to store some data in human readable format. However, some parts of the data a...

How to write inline YAML (flow style) in Haskell? How to write inline YAML (flow style) in Haskell? pretty-print yaml aeson haskell How YAML Haskell Data.Yaml How to write inline YAML (flow style) in Haskell? I'm using Data.Yaml to store some data in human readable format. However, some parts of the data are lists or m...

[ 0.006500244140625, -0.01300048828125, 0.015869140625, -0.0147705078125, 0.006378173828125, -0.0128173828125, 0.0098876953125, -0.02197265625, -0.007659912109375, 0.024658203125, 0.005523681640625, 0.00653076171875, 0.009765625, -0.01220703125, -0.004364013671875, -0.005279541015625, ...

[ 11249, 47, 33022, 23, 2256, 3320, 39456, 118664, 20623, 20625, 142508, 28875, 35662, 151, 7237, 90, 191, 1556, 11809, 21566, 17368, 5, 4343, 2053, 14135, 12301, 9384, 63920, 5303, 50944, 101935, 140992, 46389, 40, 944, 32233, 57823, 175399, ...

[ 0.0909423828125, 0.040008544921875, 0.1990966796875, 0.1107177734375, 0.2227783203125, 0.19384765625, 0.279052734375, 0.2484130859375, 0.240966796875, 0.1541748046875, 0.25146484375, 0.131591796875, 0.1279296875, 0.166259765625, 0.24853515625, 0.00897216796875, 0.0836181640625, 0.1...

embed

37865083_c0

37865083

haskell

0

Title: Mapping Over Either Problem title: Mapping Over Either Tags: haskell Problem: Mapping Over Either Why doesn't the case with (-1) work here: λ> (+1) <$> Right 10 Right 11 Prelude λ> (-1) <$> Right 10 <interactive>:22:1: error: • Non type-variable argument in the constraint: Num (a -> b) (Use FlexibleContexts to p...

Mapping Over Either Mapping Over Either haskell Mapping Over Either Right Prelude Non Num Use FlexibleContexts When Mapping Over Either Why doesn't the case with (-1) work here:

[ -0.01019287109375, 0.0128173828125, 0.0162353515625, -0.01806640625, -0.006317138671875, 0.01251220703125, -0.009033203125, -0.015625, 0.015625, -0.004364013671875, -0.00592041015625, -0.032470703125, -0.00140380859375, 0.000637054443359375, -0.003387451171875, -0.0283203125, -0.0050...

[ 911, 26783, 9578, 4565, 9319, 1556, 142508, 90911, 1914, 822, 3775, 52782, 36836, 180842, 2661, 11935, 22829, 14847, 44084, 22027, 18, 7225, 678, 15, 110218, 4488, 3688 ]

[ 0.1820068359375, 0.161865234375, 0.206298828125, 0.1033935546875, 0.1944580078125, 0.124755859375, 0.232421875, 0.111572265625, 0.03582763671875, 0.124267578125, 0.09912109375, 0.151123046875, 0.052947998046875, 0.1724853515625, 0.1552734375, 0.040130615234375, 0.1734619140625, 0.0...

embed

29060916_c1

29060916

haskell

1

Rules r) -- | Print gramma showGramma :: GrammaStruct -> IO () showGramma gr = do putStrLn $ show gr -- | Transforms string given from file of stdin into gramma representation in app getGramma :: String -> GrammaStruct getGramma hIn = procLns (lines hIn) -- | Depending on option given, provides required functionality d...

[ 0.005767822265625, 0.0142822265625, -0.0020904541015625, 0.018310546875, -0.00775146484375, 0.0194091796875, 0.006561279296875, -0.0037078857421875, 0.01324462890625, 0.0093994140625, -0.0004482269287109375, -0.00958251953125, -0.0172119140625, -0.00179290771484375, -0.0027313232421875, ...

[ 139118, 7, 1690, 58745, 39754, 122092, 11, 7639, 37878, 18023, 48078, 192, 71713, 18190, 18, 17780, 4452, 2203, 54, 3884, 866, 19, 3650, 11062, 5037, 79315, 34475, 1295, 11435, 6138, 3035, 3934, 18811, 4027, 2046, 23351, 214, 4153, 10402, ...

[ 0.2244873046875, 0.06280517578125, 0.10009765625, 0.0064697265625, 0.22802734375, 0.2445068359375, 0.161865234375, 0.1759033203125, 0.2105712890625, 0.17822265625, 0.1533203125, 0.1185302734375, 0.14208984375, 0.10345458984375, 0.01220703125, 0.172607421875, 0.1566162109375, 0.0272...

embed

29220765_c0

29220765

haskell

0

Title: How to implement rotate function on infinite lists? Problem title: How to implement rotate function on infinite lists? Tags: haskell, infinite-loop Problem: How to implement rotate function on infinite lists? I try to implement rotate function, which can work with infinite lists. I have problem with infinite lis...

How to implement rotate function on infinite lists? How to implement rotate function on infinite lists? haskell infinite-loop How How to implement rotate function on infinite lists? I try to implement rotate function, which can work with infinite lists. I have problem with infinite lists . My function is: I try use my ...

[ -0.0087890625, -0.008544921875, 0.0166015625, -0.007476806640625, -0.0240478515625, -0.00183868408203125, 0.0023193359375, 0.006591796875, -0.003204345703125, -0.039306640625, -0.0003719329833984375, 0.0003795623779296875, 0.0022735595703125, -0.004669189453125, -0.0003223419189453125, ...

[ 11249, 47, 29479, 47014, 67, 32354, 98, 54241, 13, 5303, 7, 1556, 142508, 28354, 9790, 4488, 678, 2967, 4527, 237, 87, 3444, 2046, 378, 963, 4, 534 ]

[ 0.0711669921875, 0.04736328125, 0.188720703125, 0.2196044921875, 0.2042236328125, 0.203369140625, 0.09423828125, 0.166015625, 0.0953369140625, 0.2120361328125, 0.05426025390625, 0.1265869140625, 0.2100830078125, 0.1990966796875, 0.043243408203125, 0.0204620361328125, 0.0361328125, ...

embed

21319196_c0

21319196

haskell

0

Title: Type error in generator , haskell list using tuple Problem title: Type error in generator , haskell list using tuple Tags: list, haskell, tuples Problem: Type error in generator , haskell list using tuple Currently working with Haskell on a function that takes a String in parameters and return a list of (Char, I...

Type error in generator , haskell list using tuple Type error in generator , haskell list using tuple list haskell tuples tuple Type occur::Eq x:xs word::String ERROR file.hs Term Char Does Type error in generator , haskell list using tuple Currently working with Haskell on a function that takes a String in parameters ...

[ -0.0020599365234375, -0.005889892578125, -0.004425048828125, -0.003753662109375, 0.008056640625, -0.012451171875, -0.0031585693359375, -0.0125732421875, -0.00811767578125, -0.036865234375, -0.0037384033203125, -0.0028076171875, 0.0205078125, 0.017578125, -0.0050048828125, -0.0154418945...

[ 60457, 18499, 145823, 1556, 142508, 5303, 17368, 370, 8705, 23, 99726, 74918, 864, 1022, 425, 2565, 71713, 214, 151206, 24638, 11435, 127, 2994, 21656, 101790, 20697, 20625, 32354, 51776, 23351, 171859, 30646, 84068, 18, 43240, 678, 48716, 10...

[ 0.252685546875, 0.215576171875, 0.2322998046875, 0.1043701171875, 0.17578125, 0.145263671875, 0.0537109375, 0.09423828125, 0.1646728515625, 0.0232086181640625, 0.14111328125, 0.22509765625, 0.0869140625, 0.016448974609375, 0.0096435546875, 0.17626953125, 0.07568359375, 0.0306701660...

embed

60773572_c0

60773572

haskell

0

Title: How to change/extract the value of part of a manually defined datatype? Problem title: How to change/extract the value of part of a manually defined datatype? Tags: data-manipulation, types, haskell Problem: How to change/extract the value of part of a manually defined datatype? Say I have the following datatype...

How to change/extract the value of part of a manually defined datatype? How to change/extract the value of part of a manually defined datatype? data-manipulation types haskell How MyType Element1 Maybe Element2 instance1 Just instance2 How to change/extract the value of part of a manually defined datatype? Say I have t...

[ -0.005889892578125, -0.009033203125, 0.01507568359375, 0.00836181640625, 0.00701904296875, 0.023193359375, -0.0245361328125, 0.00640869140625, 0.0107421875, -0.01446533203125, 0.0027618408203125, 0.00775146484375, -0.01416015625, 0.01531982421875, 0.0218505859375, -0.00469970703125, ...

[ 11249, 47, 15549, 64, 112779, 15390, 34292, 2831, 23009, 61924, 2053, 50986, 32, 9051, 254, 72403, 52895, 1556, 142508, 2646, 196707, 48325, 418, 83425, 304, 110527, 9563, 25632, 4865, 831, 4527, 3687, 32354, 221, 127794, 4958 ]

[ 0.09979248046875, 0.054473876953125, 0.2369384765625, 0.0802001953125, 0.2091064453125, 0.1473388671875, 0.1973876953125, 0.1519775390625, 0.1607666015625, 0.18310546875, 0.120849609375, 0.29541015625, 0.00067138671875, 0.02020263671875, 0.09002685546875, 0.0941162109375, 0.164550781...

embed

23316255_c1

23316255

haskell

1

a) Nothing ** Just b = Just (Right b) Just a ** Just b = Just (Left a) -- ick, but it does satisfy the laws instance PtS [] where unit = [] xs ** ys = map Left xs ++ map Right ys It seems like turning sum into other monoidal structures is made less interesting by unit :: Void -> f Void being uniquely determined, so yo...

[ 0.006927490234375, 0.01177978515625, 0.0032958984375, -0.011962890625, -0.0035247802734375, 0.01025390625, -0.004669189453125, -0.0203857421875, 0.006134033203125, 0.0185546875, 0.01141357421875, -0.017822265625, -0.00531005859375, -0.01263427734375, -0.0177001953125, -0.00570678710937...

[ 10, 182747, 16459, 9563, 876, 2203, 1052, 22553, 2480, 2594, 1284, 14602, 40407, 53, 131703, 110527, 436, 18, 294, 25072, 1022, 7, 113, 22288, 37223, 90911, 37202, 174548, 10554, 3934, 3789, 22460, 14, 2465, 45646, 40715, 49041, 22591, 71, ...

[ 0.06298828125, 0.1829833984375, 0.03082275390625, 0.1533203125, 0.1170654296875, 0.052947998046875, 0.001861572265625, 0.05792236328125, 0.0946044921875, 0.0958251953125, 0.01092529296875, 0.007568359375, 0.1279296875, 0.01068115234375, 0.1436767578125, 0.112060546875, 0.045318603515...

embed

38425796_c0

38425796

haskell

0

Title: What is going on in this let expression? Problem title: What is going on in this let expression? Tags: haskell, let, syntax Problem: What is going on in this let expression? I am reading through this blog post about writing an API in Haskell with Scotty, and I came across the section on monad transformers. I und...

What is going on in this let expression? What is going on in this let expression? haskell let syntax What What is going on in this let expression? I am reading through this blog post about writing an API in Haskell with Scotty, and I came across the section on monad transformers. I understand the concept of monad trans...

[ -0.00150299072265625, 0.01019287109375, 0.0206298828125, 0.006622314453125, 0.02734375, -0.011474609375, -0.00958251953125, 0.00121307373046875, -0.00286865234375, -0.0140380859375, -0.0034942626953125, 0.00927734375, 0.0000782012939453125, -0.00897216796875, 0.01171875, -0.00494384765...

[ 4865, 83, 7730, 98, 23, 903, 2633, 125195, 1556, 142508, 6002, 86531, 32562, 61687, 20625, 678, 50695, 53, 2667, 712, 27198, 1314, 28219, 23755, 53418, 137565, 10336, 3688, 91067, 347, 159978, 5701, 4527 ]

[ 0.0855712890625, 0.0765380859375, 0.1263427734375, 0.1273193359375, 0.10284423828125, 0.1134033203125, 0.2469482421875, 0.25341796875, 0.10791015625, 0.2215576171875, 0.04608154296875, 0.1182861328125, 0.03009033203125, 0.1251220703125, 0.0989990234375, 0.01953125, 0.057861328125, ...

embed

52608452_c0

52608452

haskell

0

Title: How to compare two UTCTime values and get the difference in days? Problem title: How to compare two UTCTime values and get the difference in days? Tags: time, haskell, haskell-stack Problem: How to compare two UTCTime values and get the difference in days? I want to take away from UTCTime - UTCTime. I found the ...

How to compare two UTCTime values and get the difference in days? How to compare two UTCTime values and get the difference in days? time haskell haskell-stack How UTCTime NominalDiffTime How to compare two UTCTime values and get the difference in days? I want to take away from UTCTime - UTCTime. I found the following f...

[ 0.0025482177734375, 0.00836181640625, -0.0057373046875, 0.019775390625, 0.00738525390625, -0.0166015625, 0.00174713134765625, 0.0157470703125, 0.005279541015625, -0.033203125, -0.001922607421875, -0.00124359130859375, -0.003143310546875, 0.00482177734375, -0.0027923583984375, -0.010314...

[ 11249, 47, 69101, 6626, 99577, 70059, 142424, 136, 2046, 70, 60212, 23, 13312, 1733, 1556, 142508, 590, 2594, 438, 1249, 289, 397, 32920, 3444, 5646, 16065, 14037, 25632, 32354, 71337, 45962, 1984, 3871, 903, 109650, 7763, 4233, 2271, 6468,...

[ 0.07427978515625, 0.043182373046875, 0.216552734375, 0.1168212890625, 0.2181396484375, 0.2626953125, 0.161376953125, 0.0280609130859375, 0.08404541015625, 0.0220947265625, 0.2073974609375, 0.075927734375, 0.1798095703125, 0.1005859375, 0.06707763671875, 0.17431640625, 0.04736328125, ...

embed

27648229_c0

27648229

haskell

0

Title: Ambiguous occurrence of == when creating a type as an instance of Eq Problem title: Ambiguous occurrence of == when creating a type as an instance of Eq Tags: haskell, operator-overloading Problem: Ambiguous occurrence of == when creating a type as an instance of Eq From Learn You a Haskell for Great Good : clas...

Ambiguous occurrence of == when creating a type as an instance of Eq Ambiguous occurrence of == when creating a type as an instance of Eq haskell operator-overloading Ambiguous Eq1 Bool TrafficLight Red Yellow Green baby.hs:213:9 Main baby.hs:225:5 Prelude baby.hs:1:1 GHC.Classes Ambiguous occurrence of == when creatin...

[ 0.008544921875, 0.01239013671875, 0.004150390625, 0.02294921875, 0.0159912109375, -0.005462646484375, 0.0031585693359375, 0.010009765625, 0.003021240234375, 0.003936767578125, 0.007110595703125, -0.007110595703125, 0.01953125, -0.004791259765625, -0.004974365234375, -0.003662109375, ...

[ 10250, 12282, 10821, 74918, 42, 69112, 3229, 105233, 10644, 237, 142, 110527, 241, 864, 6620, 1556, 142508, 39933, 5465, 63033, 2460, 929, 180952, 187459, 6096, 146762, 15497, 15546, 127, 7, 363, 1126, 12321, 5, 144025, 758, 1914, 822, 112,...

[ 0.1507568359375, 0.2064208984375, 0.05670166015625, 0.1309814453125, 0.0994873046875, 0.287353515625, 0.009521484375, 0.156005859375, 0.22314453125, 0.042510986328125, 0.03271484375, 0.143310546875, 0.038848876953125, 0.20654296875, 0.0009765625, 0.0989990234375, 0.2159423828125, 0...

embed

41619756_c2

41619756

haskell

2

swappable" Swappable integers are two integers that, when concatenated, are prime. Any new sets created with n are returned check ::[[Integer]] -> Integer -> Code signals: Data.List, System.Random, qualified, probablistic, Data.Set, Intersect, Intersection, Runtime, S.intersection, S.fromList, Check, Swappable, Any, In...

[ -0.01806640625, -0.00017261505126953125, 0.01324462890625, 0.01434326171875, -0.0067138671875, -0.00537109375, -0.00982666015625, -0.00830078125, 0.01141357421875, -0.000843048095703125, 0.01287841796875, 0.0177001953125, 0.006988525390625, -0.010986328125, -0.00946044921875, 0.0066528...

[ 202317, 254, 2886, 58, 43062, 6366, 892, 26255, 621, 6626, 450, 3229, 158, 4460, 33, 27686, 20809, 28541, 3525, 5423, 75935, 678, 653, 176377, 12765, 4153, 67, 1505, 44401, 28864, 26073, 7, 11809, 154663, 12353, 126525, 3815, 217225, 21652,...

[ 0.298095703125, 0.2294921875, 0.31201171875, 0.048583984375, 0.286865234375, 0.2744140625, 0.2359619140625, 0.2012939453125, 0.150390625, 0.176513671875, 0.03375244140625, 0.0875244140625, 0.12353515625, 0.157470703125, 0.1273193359375, 0.039703369140625, 0.261962890625, 0.10119628...

embed

46315857_c0

46315857

haskell

0

Title: Instance Declarations Problem title: Instance Declarations Tags: haskell Problem: Instance Declarations Bit curious why the instance declaration is needed in the following as a default implementation is provided. module Example where class Eq a => EQ a where eq :: a -> a -> Bool eq = (==) -- why is this instance...

Instance Declarations Instance Declarations haskell Instance Declarations Example Bool Instance Declarations Bit curious why the instance declaration is needed in the following as a default implementation is provided. If I leave out the instance declaration I get an error. I'm sure it's explained somewhere in the Haske...

[ 0.01556396484375, 0.01141357421875, 0.0164794921875, 0.00762939453125, -0.00634765625, 0.0203857421875, -0.004608154296875, -0.02392578125, 0.00144195556640625, 0.00982666015625, -0.01312255859375, -0.01043701171875, -0.007659912109375, 0.0185546875, 0.0024871826171875, 0.0039672851562...

[ 360, 116071, 98501, 5256, 1556, 142508, 89536, 2460, 929, 193844, 15400, 70, 110527, 21635, 1363, 83, 44841, 25632, 237, 10, 114977, 208124, 62952, 31358, 1810, 18499, 189050, 20625, 13416, 12960, 7413 ]

[ 0.07012939453125, 0.2467041015625, 0.24072265625, 0.05462646484375, 0.116943359375, 0.24169921875, 0.0841064453125, 0.092529296875, 0.19287109375, 0.06854248046875, 0.09716796875, 0.0386962890625, 0.29345703125, 0.2349853515625, 0.09375, 0.076416015625, 0.189697265625, 0.1268310546...

embed

79443400_c0

79443400

haskell

0

Title: "conflicting types for 'SDL_main'" while trying to install the sdl2-image haskell module with stack Problem title: "conflicting types for 'SDL_main'" while trying to install the sdl2-image haskell module with stack Tags: c, sdl, haskell Problem: "conflicting types for 'SDL...

"conflicting types for 'SDL_main'" while trying to install the sdl2-image haskell module with stack "conflicting types for 'SDL_main'" while trying to install the sdl2-image haskell module with stack c sdl haskell macro SDL_main sdl2-image Image.hsc:77:5 Users AppData Local Progr...

[ 0.0159912109375, -0.01007080078125, 0.0072021484375, 0.0157470703125, -0.0030975341796875, -0.005462646484375, -0.003021240234375, -0.000774383544921875, -0.02294921875, 0.013427734375, 0.003936767578125, -0.01312255859375, 0.01361083984375, -0.01104736328125, 0.017578125, 0.0016403198...

[ 2271, 134225, 214, 52895, 100, 3768, 294, 27502, 24931, 31577, 20600, 91, 20469, 18504, 37926, 1556, 142508, 88996, 678, 177261, 501, 111789, 159, 22710, 10382, 14546, 53400, 5659, 137989, 24172, 7663, 15276, 13307, 229792, 94924, 304, 2357, ...

[ 0.111572265625, 0.23681640625, 0.1259765625, 0.2431640625, 0.0285797119140625, 0.049346923828125, 0.05413818359375, 0.1995849609375, 0.18798828125, 0.074951171875, 0.126708984375, 0.07281494140625, 0.1624755859375, 0.202880859375, 0.1680908203125, 0.09979248046875, 0.225341796875, ...

embed

65257586_c1

65257586

haskell

1

),e)] e1) = eval env' e1 where env' = env ++ map (\(v,e) -> (v, eval env' e)) [(x,e)] This is my test function I want to evaluate: t1 = LetRec [ (("not", INT:->INT), Lam ("i",INT) $ If (Var "i") (Val 0) (Val 1)) , (("even", INT:->INT), Lam ("i",INT) $ If (Var "i") (App (Var "not") (App (Var "odd") (Var "i" `Add` Val (-...

[ -0.00390625, 0.01416015625, 0.0128173828125, 0.0101318359375, 0.023193359375, 0.006072998046875, -0.0157470703125, 0.0167236328125, 0.01202392578125, -0.005401611328125, -0.01263427734375, 0.0174560546875, 0.0162353515625, 0.01373291015625, 0.0299072265625, -0.0036773681640625, -0.01...

[ 247, 13, 16, 268, 28, 17727, 2203, 1405, 22, 334, 25, 418, 37223, 22288, 33079, 425, 3293, 759, 3034, 32354, 3444, 151575, 808, 10842, 4332, 238, 10869, 830, 59537, 103607, 59387, 14, 3650, 4263, 15, 81827, 18939, 42272, 757, 4879, 4, ...

[ 0.043182373046875, 0.1085205078125, 0.030120849609375, 0.0141143798828125, 0.1549072265625, 0.1767578125, 0.0751953125, 0.25244140625, 0.113525390625, 0.224609375, 0.09814453125, 0.1776123046875, 0.1575927734375, 0.1353759765625, 0.02410888671875, 0.02764892578125, 0.00518798828125, ...

embed

59275883_c0

59275883

haskell

0

Title: Reverse own list a more optimal way Problem title: Reverse own list a more optimal way Tags: haskell Problem: Reverse own list a more optimal way Tried to mimic the reverse function to the ADT List below, data List a = Nil | Cons a (List a) deriving (Show) reverseList = convert . reverse' where reverse' Nil = []...

Reverse own list a more optimal way Reverse own list a more optimal way haskell Reverse List Nil Cons Show x:xs Reverse own list a more optimal way Tried to mimic the reverse function to the ADT List below, The reverseList is composed of convert and reverse' , how to achieve it optimally for instance without the aid of...

[ -0.0164794921875, 0.032958984375, 0.01324462890625, 0.006988525390625, -0.009033203125, -0.007232666015625, 0.0025482177734375, -0.01025390625, 0.01513671875, 0.007659912109375, 0.004730224609375, 0.0146484375, 0.0303955078125, 0.006378173828125, -0.00732421875, 0.0169677734375, 0.02...

[ 853, 37676, 10002, 5303, 1286, 24087, 3917, 1556, 142508, 32036, 77175, 39215, 17367, 1022, 425, 4699, 324, 21068, 39531, 184, 32354, 62, 41072, 35064, 154663, 150350, 111, 96760, 136, 3642, 69307, 15490, 36442, 88303, 73 ]

[ 0.09423828125, 0.28857421875, 0.1885986328125, 0.2412109375, 0.1058349609375, 0.201904296875, 0.0831298828125, 0.1129150390625, 0.1903076171875, 0.2196044921875, 0.175048828125, 0.2000732421875, 0.1231689453125, 0.0227203369140625, 0.053985595703125, 0.06304931640625, 0.0671997070312...

embed

60492776_c0

60492776

haskell

0

Title: How can I make a map of lists in Haskell? Problem title: How can I make a map of lists in Haskell? Tags: haskell Problem: How can I make a map of lists in Haskell? I have a list of key-value pairs that I want to reduce. So given [("a", 2), ("b", 3), ("a", 4)] , I want to produce Map ("a", [2, 4]), ("b", [3]) . I...

How can I make a map of lists in Haskell? How can I make a map of lists in Haskell? haskell How Haskell Map Data.Map.fromListWith Data.List.insert How can I make a map of lists in Haskell? I have a list of key-value pairs that I want to reduce. So given [("a", 2), ("b", 3), ("a", 4)] , I want to produce Map ("a", [2, 4...

[ -0.01129150390625, -0.00677490234375, -0.0030975341796875, 0.0012969970703125, -0.025634765625, 0.006927490234375, -0.0120849609375, 0.000919342041015625, 0, -0.01611328125, 0.0113525390625, 0.00008106231689453125, 0.0283203125, 0.0159912109375, -0.0152587890625, 0.001708984375, -0.0...

[ 11249, 831, 3249, 10, 22288, 111, 5303, 7, 23, 20625, 142508, 87, 1556, 42719, 11809, 166179, 161063, 154663, 194583, 73, 33657, 22799, 27494, 80836, 3444, 47, 34390, 34475, 4958, 275, 8439, 13956, 27489, 11, 304, 201, 14037, 47644, 1295, ...

[ 0.092529296875, 0.085205078125, 0.133056640625, 0.0947265625, 0.27880859375, 0.1558837890625, 0.2705078125, 0.10302734375, 0.07806396484375, 0.177001953125, 0.265380859375, 0.04144287109375, 0.1502685546875, 0.25732421875, 0.1304931640625, 0.210693359375, 0.1346435546875, 0.2296142...

embed

21192268_c1

21192268

haskell

1

.2 using version 1.16.0 of the Cabal library GHC version: $ ghc --version The Glorious Glasgow Haskell Compilation System, version 7.6.3 Some of the tutorials mention using a cabal sandbox, but my version of cabal (1.16) is too old for that. If the sandbox is likely too help I'll try and get that working (had a little ...

[ -0.0057373046875, 0.024169921875, 0.002471923828125, 0.008544921875, -0.0162353515625, 0.0137939453125, -0.01544189453125, -0.00811767578125, -0.0257568359375, -0.00099945068359375, -0.0247802734375, -0.03955078125, -0.00131988525390625, 0.00958251953125, 0.01043701171875, -0.004302978...

[ 6, 5, 304, 17368, 11389, 615, 2485, 2389, 30438, 289, 35773, 1294, 527, 73265, 3650, 31380, 238, 46354, 46173, 93905, 181787, 20625, 142508, 15612, 14, 57860, 12353, 2861, 200768, 57143, 109524, 19096, 11728, 2858, 60978, 5792, 10332, 70, 8...

[ 0.028533935546875, 0.12841796875, 0.2127685546875, 0.09814453125, 0.16796875, 0.0828857421875, 0.200439453125, 0.1527099609375, 0.1712646484375, 0.1875, 0.1414794921875, 0.048980712890625, 0.05999755859375, 0.18603515625, 0.085693359375, 0.085205078125, 0.09228515625, 0.10729980468...

embed

7523151_c0

7523151

haskell

0

Title: Hoogle data on Windows Problem title: Hoogle data on Windows Tags: haskell, haskell-platform Problem: Hoogle data on Windows I can install hoogle using cabal install hoogle on Windows, however, when I run hoogle data from MinGW shell, I encounter the following error: $ hoogle data Extracting tarball... gzip: ..\...

Hoogle data on Windows Hoogle data on Windows haskell haskell-platform Hoogle Windows Extracting hackage-cabal.tar.gz hoogle.exe System hackage-cabal.ta r.gz Hoogle data on Windows I can install hoogle using cabal install hoogle on Windows, however, when I run hoogle data from MinGW shell, I encounter the following err...

[ 0.025390625, 0.006683349609375, 0.00909423828125, 0.005523681640625, 0.00390625, 0.01507568359375, 0.010498046875, -0.004669189453125, 0.003082275390625, -0.00689697265625, -0.003021240234375, -0.0272216796875, 0.0089111328125, 0.00848388671875, 0.0038604736328125, 0.01141357421875, ...

[ 152488, 133, 2053, 98, 3773, 1556, 142508, 172121, 31501, 85526, 4588, 408, 3571, 867, 177, 28994, 46480, 12353, 102, 831, 20600, 109524, 11675, 1295, 4211, 102550, 128019, 190647, 25632, 18499, 72546 ]

[ 0.234375, 0.292724609375, 0.1732177734375, 0.07940673828125, 0.204833984375, 0.0980224609375, 0.2073974609375, 0.103759765625, 0.09814453125, 0.17236328125, 0.1070556640625, 0.0498046875, 0.159423828125, 0.0885009765625, 0.004974365234375, 0.2147216796875, 0.0931396484375, 0.053710...

embed

47512813_c0

47512813

haskell

0

Title: unixODBC: invalid handle when handle is allocated in a Haskell thread Problem title: unixODBC: invalid handle when handle is allocated in a Haskell thread Tags: odbc, multithreading, haskell, unixodbc Problem: unixODBC: invalid handle when handle is allocated in a Haskell thread I am building an ODBC application...

unixODBC: invalid handle when handle is allocated in a Haskell thread unixODBC: invalid handle when handle is allocated in a Haskell thread odbc multithreading haskell unixodbc Haskell unixODBC: invalid handle when handle is allocated in a Haskell thread I am building an ODBC application in Haskell, using foreign calls...

[ 0.020751953125, 0.01904296875, -0.0078125, -0.00118255615234375, -0.01177978515625, -0.0032806396484375, 0.00994873046875, -0.01513671875, -0.001007080078125, -0.051513671875, 0.01287841796875, -0.03173828125, 0.0194091796875, -0.011962890625, -0.0103759765625, -0.01092529296875, 0.0...

[ 51, 4084, 43740, 24318, 56649, 34831, 3229, 144, 116292, 20625, 142508, 86997, 23, 229, 65037, 3869, 65847, 11, 1556, 33976, 34687, 38415, 17368, 110613, 11782, 159029, 32354, 100, 92, 17780, 7285, 99091, 167457, 98, 5701, 70, 30646, 18499, ...

[ 0.08740234375, 0.051361083984375, 0.1141357421875, 0.22705078125, 0.265625, 0.278076171875, 0.0587158203125, 0.08502197265625, 0.186767578125, 0.1180419921875, 0.2369384765625, 0.1888427734375, 0.05621337890625, 0.1434326171875, 0.21728515625, 0.055389404296875, 0.1207275390625, 0....

embed

77398398_c0

77398398

haskell

0

Title: Remove duplicates of a Data.Sequence Problem title: Remove duplicates of a Data.Sequence Tags: unique, haskell, containers Problem: Remove duplicates of a Data.Sequence I have a sequence Seq a with Eq a and I want to remove the duplicates inside this sequence. I do fromList $ nub $ toList mysequence Is there a m...

Remove duplicates of a Data.Sequence Remove duplicates of a Data.Sequence unique haskell containers Remove Data.Sequence Seq Edge Show Read Bool Remove duplicates of a Data.Sequence I have a sequence Seq a with Eq a and I want to remove the duplicates inside this sequence. I do Is there a more efficient way? This is a ...

[ -0.007568359375, 0.0341796875, 0.0205078125, -0.0040283203125, 0.02099609375, -0.003997802734375, -0.004364013671875, 0.01025390625, -0.0167236328125, -0.02880859375, -0.021240234375, 0.0205078125, 0.0118408203125, 0.01513671875, -0.00946044921875, 0.016357421875, -0.012939453125, ...

[ 181139, 171763, 1636, 111, 11809, 5, 4233, 944, 3956, 36998, 1556, 142508, 116419, 503, 864, 69030, 17367, 4764, 2460, 929, 10, 87, 765, 40, 678, 3444, 47, 87388, 70, 46132, 903, 54, 1286, 93766, 3917, 3293 ]

[ 0.1702880859375, 0.2705078125, 0.1593017578125, 0.08740234375, 0.1444091796875, 0.0521240234375, 0.1060791015625, 0.1572265625, 0.09619140625, 0.166259765625, 0.1402587890625, 0.2081298828125, 0.1956787109375, 0.100341796875, 0.1922607421875, 0.178955078125, 0.0975341796875, 0.1132...

embed

30002615_c0

30002615

haskell

0

Title: Writing own repeat function in Haskell: getting error C stack overflow Problem title: Writing own repeat function in Haskell: getting error C stack overflow Tags: stack-overflow, haskell Problem: Writing own repeat function in Haskell: getting error C stack overflow When I'm trying to write repeat in Haskell, th...

Writing own repeat function in Haskell: getting error C stack overflow Writing own repeat function in Haskell: getting error C stack overflow stack-overflow haskell Writing Haskell Writing own repeat function in Haskell: getting error C stack overflow When I'm trying to write repeat in Haskell, the ERROR - C stack over...

[ 0.0023193359375, 0.0245361328125, 0.00634765625, 0.0137939453125, 0.0068359375, -0.0021514892578125, -0.0174560546875, -0.00970458984375, 0.00677490234375, -0.0306396484375, -0.0020599365234375, -0.00726318359375, 0.0169677734375, 0.012451171875, 0.01708984375, -0.00015544891357421875,...

[ 213185, 10002, 119140, 32354, 20625, 142508, 20949, 18499, 313, 177261, 645, 118664, 5465, 1556, 31577, 33022, 23, 151206, 24638, 7426, 1257, 107419, 7108, 3917, 26458, 15400, 96276, 44691, 5117 ]

[ 0.1627197265625, 0.154052734375, 0.26416015625, 0.1485595703125, 0.118408203125, 0.223876953125, 0.06317138671875, 0.19580078125, 0.148193359375, 0.1732177734375, 0.129150390625, 0.2452392578125, 0.1015625, 0.09765625, 0.1051025390625, 0.1624755859375, 0.029541015625, 0.13134765625...

embed

13814274_c0

13814274

haskell

0

Title: Snap: correct use of PreRun hook Problem title: Snap: correct use of PreRun hook Tags: haskell-snap-framework, haskell Problem: Snap: correct use of PreRun hook I cant figure out how to run a function before any template loads. For instance: I have a function called 'authenticate' that returns a Maybe value. I w...

Snap: correct use of PreRun hook Snap: correct use of PreRun hook haskell-snap-framework haskell Snap PreRun Snap: correct use of PreRun hook I cant figure out how to run a function before any template loads. For instance: I have a function called 'authenticate' that returns a Maybe value. I want to run it before any t...

[ 0.0069580078125, -0.00921630859375, -0.006622314453125, 0.003875732421875, -0.035400390625, 0.006988525390625, 0.009521484375, -0.0106201171875, 0.0078125, -0.05029296875, 0.002288818359375, -0.025146484375, -0.0201416015625, -0.0093994140625, 0.0164794921875, -0.01031494140625, -0.0...

[ 121190, 26785, 4527, 1914, 163321, 150522, 1556, 142508, 10957, 160328, 18244, 111, 45767, 26366, 1810, 3642, 47, 11675, 32354, 8108, 2499, 110934, 72367, 765, 1003, 63250, 33478, 30646, 83425, 34292, 3444, 442, 456, 80581, 35431, 136, 2161, ...

[ 0.2763671875, 0.1505126953125, 0.131591796875, 0.2137451171875, 0.27197265625, 0.2432861328125, 0.0867919921875, 0.1864013671875, 0.21875, 0.0899658203125, 0.008544921875, 0.0018310546875, 0.054901123046875, 0.0906982421875, 0.009185791015625, 0.0706787109375, 0.049285888671875, 0....

embed

36731014_c0

36731014

haskell

0

Title: Haskell - wait for the first event (no busy waiting) Problem title: Haskell - wait for the first event (no busy waiting) Tags: events, haskell Problem: Haskell - wait for the first event (no busy waiting) I wanted to have in Haskell a very simple code in which events are handled. For instance, I'm looking for so...

Haskell - wait for the first event (no busy waiting) Haskell - wait for the first event (no busy waiting) events haskell Haskell Something Haskell - wait for the first event (no busy waiting) I wanted to have in Haskell a very simple code in which events are handled. For instance, I'm looking for something like this: I...

[ 0.013916015625, 0.007110595703125, -0.00173187255859375, -0.01068115234375, -0.0037841796875, -0.031494140625, 0.035888671875, -0.0089111328125, -0.0024566650390625, -0.0791015625, 0.00445556640625, -0.006866455078125, -0.01385498046875, 0.02001953125, 0.00118255615234375, 0.0032806396...

[ 20625, 142508, 40485, 100, 5117, 19732, 157, 86352, 89289, 47353, 1556, 200905, 36663, 765, 23, 4552, 8781, 18151, 3129, 34831, 5, 110527, 16487, 1884, 903, 2046, 5646, 3687, 15490, 4223, 53 ]

[ 0.15576171875, 0.2413330078125, 0.23876953125, 0.1566162109375, 0.1544189453125, 0.2061767578125, 0.1263427734375, 0.2275390625, 0.2362060546875, 0.206787109375, 0.1246337890625, 0.07305908203125, 0.0745849609375, 0.009033203125, 0.005035400390625, 0.025238037109375, 0.1220703125, ...

embed

14357039_c0

14357039

haskell

0

Title: Haskell non-tail recursion Problem title: Haskell non-tail recursion Tags: haskell Problem: Haskell non-tail recursion I want to know if this represents a tail-recursion. And if it isn't how can I do it. countP :: [a] -> (a->Bool) -> Int countP [] _ = 0 countP (x:xs) p = countP_aux (x:xs) p 0 countP_aux [] _ _ =...

Haskell non-tail recursion Haskell non-tail recursion haskell Haskell Bool x:xs countP_aux Haskell non-tail recursion I want to know if this represents a tail-recursion. And if it isn't how can I do it. This exercise show how many values in a list are verified by p condition. Thanks

[ -0.0023040771484375, 0.01373291015625, 0.01513671875, 0.021240234375, 0.0123291015625, 0.02392578125, -0.005615234375, -0.035888671875, 0.00909423828125, -0.0150146484375, 0.017333984375, -0.0255126953125, 0.0228271484375, 0.004486083984375, 0.0177001953125, 0.01092529296875, 0.00958...

[ 20625, 142508, 351, 46741, 195625, 1556, 2460, 929, 1022, 12, 425, 7, 54529, 683, 454, 10442, 1830, 3444, 3714, 2174, 903, 33636, 10, 9, 107, 48650, 56112, 54, 81979, 7639, 3642, 5941, 142424, 23, 5303, 493, 47314, 390, 915, 35431 ]

[ 0.142822265625, 0.230224609375, 0.1822509765625, 0.2705078125, 0.2120361328125, 0.14501953125, 0.09942626953125, 0.203369140625, 0.09259033203125, 0.000335693359375, 0.10028076171875, 0.06744384765625, 0.2052001953125, 0.147705078125, 0.012451171875, 0.2607421875, 0.1143798828125, ...

embed

16600399_c0

16600399

haskell

0

Title: Anyone having trouble install Control.Pipe? Problem title: Anyone having trouble install Control.Pipe? Tags: cabal, cabal-install, haskell, ghci, ghc Problem: Anyone having trouble install Control.Pipe? I have the current version of cabal and running cabal install Pipe gave me no issues. But I tried these two im...

Anyone having trouble install Control.Pipe? Anyone having trouble install Control.Pipe? cabal cabal-install haskell ghci ghc Control.Proxy Control.Pipe Anyone Pipe Could Anyone having trouble install Control.Pipe? I have the current version of cabal and running cabal install Pipe gave me no issues. But I tried these tw...

[ 0.018798828125, -0.0022430419921875, -0.00933837890625, 0.0125732421875, -0.0234375, 0.0196533203125, 0.0004711151123046875, -0.0238037109375, -0.0025177001953125, -0.000865936279296875, -0.014404296875, -0.03857421875, 0.01171875, -0.006927490234375, -0.0014801025390625, 0.02136230468...

[ 28541, 3630, 19441, 63134, 20600, 27131, 5, 683, 48672, 109524, 80383, 1556, 142508, 31380, 318, 238, 10752, 50878, 93128, 13, 191147, 43581, 11389, 111, 51042, 37348, 37842, 6626, 24927, 4966, 20949, 903, 18499, 26008, 3493, 5701, 100, 1250,...

[ 0.044952392578125, 0.08184814453125, 0.04541015625, 0.162353515625, 0.1898193359375, 0.2462158203125, 0.03826904296875, 0.1533203125, 0.2291259765625, 0.245361328125, 0.1312255859375, 0.0679931640625, 0.2000732421875, 0.037567138671875, 0.072509765625, 0.0498046875, 0.10113525390625,...

embed

29319771_c0

29319771

haskell

0

Title: "takeWhile" within a list comprehension Problem title: "takeWhile" within a list comprehension Tags: haskell, list, syntax, infinite, list-comprehension Problem: "takeWhile" within a list comprehension I have something like the following: [bla z|n<-[0..], let z = foo n, z < 42] The thing is, ...

"takeWhile" within a list comprehension "takeWhile" within a list comprehension haskell list syntax infinite list-comprehension "takeWhile" within a list comprehension I have something like the following: The thing is, I want the list comprehension to end as soon as z < 42 fails, as if it were a tak...

[ 0.0062255859375, -0.00189971923828125, 0.007659912109375, 0.0013885498046875, 0.005828857421875, 0.0130615234375, -0.0033416748046875, 0.01007080078125, 0.0164794921875, -0.052001953125, 0.00537109375, 0.031005859375, -0.00141143798828125, -0.0026092529296875, 0.0031280517578125, -0.00...

[ 78219, 1456, 979, 133, 28032, 5303, 46683, 3220, 6889, 41502, 1556, 142508, 6002, 86531, 54241, 277, 4692, 765, 1884, 25632, 13580, 3444, 47, 3564, 33662, 237, 97, 4426, 4828, 35782, 2174, 5646, 5809, 144810, 46312, 22288, 186, 5045, 1286, ...

[ 0.244384765625, 0.1141357421875, 0.25634765625, 0.2119140625, 0.1544189453125, 0.2110595703125, 0.1708984375, 0.162841796875, 0.07562255859375, 0.001190185546875, 0.13232421875, 0.2227783203125, 0.07489013671875, 0.0694580078125, 0.131103515625, 0.035491943359375, 0.141357421875, 0...

embed

19048615_c0

19048615

haskell

0

Title: Haskell Homework - Decimal List [Int] -> Int Problem title: Haskell Homework - Decimal List [Int] -> Int Tags: fold, haskell Problem: Haskell Homework - Decimal List [Int] -> Int The assignment is to define function decimal :: [Int] -> Int in which a list of positive ints is to give the decimal number so t...

Haskell Homework - Decimal List [Int] -> Int Haskell Homework - Decimal List [Int] -> Int fold haskell Haskell Homework Decimal List Integer Haskell Homework - Decimal List [Int] -> Int The assignment is to define function decimal :: [Int] -> Int in which a list of positive ints is to give the decimal number so t...

[ -0.009765625, 0.0185546875, 0.0064697265625, 0.01287841796875, -0.0220947265625, 0.028076171875, -0.0244140625, -0.000614166259765625, -0.0079345703125, -0.0076904296875, -0.01226806640625, -0.034912109375, -0.0146484375, 0.03564453125, -0.004364013671875, -0.014404296875, -0.0026397...

[ 20625, 142508, 2005, 18244, 49132, 2749, 32036, 4153, 18, 5386, 360, 42822, 1556, 44401, 33079, 95486, 674, 83, 61924, 32354, 32380, 1984, 5303, 24491, 23, 933, 47, 8337, 14012, 221, 163324, 363, 198889, 30646, 66566, 2947, 444, 4527, 6183,...

[ 0.1378173828125, 0.221435546875, 0.129150390625, 0.1728515625, 0.15673828125, 0.1944580078125, 0.1829833984375, 0.09478759765625, 0.162841796875, 0.0745849609375, 0.109375, 0.2269287109375, 0.10693359375, 0.1678466796875, 0.06805419921875, 0.1148681640625, 0.0699462890625, 0.037597...

embed

21359525_c0

21359525

haskell

0

Title: Haskell bzlib-conduit/zlib-conduit example Problem title: Haskell bzlib-conduit/zlib-conduit example Tags: bzlib-conduit, zlib-conduit, haskell, conduit Problem: Haskell bzlib-conduit/zlib-conduit example Let's assume we create the file a.txt.gz as follows: $ echo "foobar" > a.txt $ gzip a.txt I intend to use zl...

Haskell bzlib-conduit/zlib-conduit example Haskell bzlib-conduit/zlib-conduit example bzlib-conduit zlib-conduit haskell conduit Haskell a.txt.gz a.txt Haskell bzlib-conduit/zlib-conduit example Let's assume we create the file a.txt.gz as follows: I intend to use zlib-conduit in order to emulate zcat in Haskell. I'm lo...

[ 0.006744384765625, 0.000499725341796875, 0.0062255859375, 0.017822265625, 0.000659942626953125, 0.0255126953125, -0.01043701171875, 0.004486083984375, 0.0047607421875, 0.000843048095703125, -0.00787353515625, 0.0146484375, 0.01495361328125, 0.021240234375, -0.01483154296875, -0.0084228...

[ 20625, 142508, 876, 169, 5612, 2271, 112061, 27781, 97, 1556, 120565, 10, 124326, 177, 7, 41591, 28282, 11435, 5, 28960, 150661, 4527, 19908, 4460, 16487, 8781, 190659, 109312, 1230, 209480, 91177, 25188, 71834 ]

[ 0.120361328125, 0.20849609375, 0.0298919677734375, 0.09112548828125, 0.23388671875, 0.0731201171875, 0.172607421875, 0.1796875, 0.109619140625, 0.0992431640625, 0.1962890625, 0.10888671875, 0.1756591796875, 0.03277587890625, 0.00006103515625, 0.0345458984375, 0.05865478515625, 0.11...

embed

23042199_c0

23042199

haskell

0

Title: Why does this use Double instead of giving me an ambiguity error? Problem title: Why does this use Double instead of giving me an ambiguity error? Tags: haskell Problem: Why does this use Double instead of giving me an ambiguity error? For the code class Boomable a where boom :: a instance Boomable Int where boo...

Why does this use Double instead of giving me an ambiguity error? Why does this use Double instead of giving me an ambiguity error? haskell Why Double Boomable Why does this use Double instead of giving me an ambiguity error? For the code Why does give me 2.2 ? Why does it use the Double version instead of giving me an...

[ 0.012939453125, -0.0272216796875, -0.006195068359375, 0.002655029296875, -0.004608154296875, 0.0128173828125, -0.024169921875, 0.0010833740234375, 0.01031494140625, -0.002349853515625, -0.00396728515625, -0.03125, -0.00188446044921875, -0.02734375, -0.0194091796875, -0.02880859375, 0...

[ 44084, 14602, 903, 4527, 107172, 64457, 111, 68772, 163, 920, 12282, 2481, 18499, 1556, 142508, 167240, 2886, 70, 18151, 8337, 41187, 11389, 142, 84751, 1984, 4153, 18, 707, 8331, 34, 2661, 40101, 77227, 106, 47, 4488, 5 ]

[ 0.153564453125, 0.070556640625, 0.135986328125, 0.1383056640625, 0.271484375, 0.1329345703125, 0.03173828125, 0.0662841796875, 0.085693359375, 0.1163330078125, 0.17724609375, 0.09368896484375, 0.1708984375, 0.1397705078125, 0.2452392578125, 0.2044677734375, 0.245849609375, 0.003448...

embed

72752084_c0

72752084

haskell

0

Title: How do I use pattern matching in GHCi? Problem title: How do I use pattern matching in GHCi? Tags: ghci, pattern-matching, haskell Problem: How do I use pattern matching in GHCi? I've got this code: oof [] = 1 oof [(i,j)] = i+j oof [(i,7),(5,j)] = i*j oof (_:_:xs) = foo xs and I typed it into ghci. When I try to...

How do I use pattern matching in GHCi? How do I use pattern matching in GHCi? ghci pattern-matching haskell How GHCi _:_:xs Exception Non-exhaustive How do I use pattern matching in GHCi? I've got this code: and I typed it into ghci. When I try to execute the expression: it should make use of the third line and return ...

[ -0.0303955078125, 0.002685546875, 0.00457763671875, 0.0084228515625, 0.01019287109375, 0.0172119140625, -0.00860595703125, 0.0087890625, 0.0341796875, -0.00738525390625, 0.0191650390625, -0.035400390625, 0.004852294921875, -0.02001953125, 0.01348876953125, -0.005157470703125, 0.02197...

[ 11249, 87, 4527, 103510, 14858, 214, 23, 527, 73265, 14, 54, 31380, 318, 98753, 1556, 142508, 454, 12, 425, 5443, 63928, 3775, 3355, 18391, 4935, 903, 18151, 10644, 3934, 9790, 71924, 125195, 5608, 50960, 13315, 30646, 305, 18499, 26008, ...

[ 0.043304443359375, 0.019134521484375, 0.109130859375, 0.22265625, 0.217529296875, 0.1212158203125, 0.037353515625, 0.089111328125, 0.1224365234375, 0.20263671875, 0.00555419921875, 0.1123046875, 0.1719970703125, 0.2010498046875, 0.0987548828125, 0.1715087890625, 0.006744384765625, ...

embed

72947117_c2

72947117

haskell

2

Ex.GHC.Settings.Config, a, being, x, How, EpAnn, Located, HsModule, haskell-playground.cabal, Main.hs, Wall, Haskell2010, AnnListItem, Main, ParserOpts, ParseResult, HasCallStack, POk, PFailed, Parse, Bool, EpAnnNotUsed, Outputable, DynFlags, FilePath, Build, ghc-9.2.2, haskell-playground-0.1.0.0, exe:haskell-playgroun...

[ -0.0004215240478515625, 0.01123046875, -0.00823974609375, 0.00927734375, 0.022705078125, 0.01312255859375, -0.00531005859375, -0.00927734375, 0.015869140625, 0.0015106201171875, -0.00653076171875, -0.0198974609375, 0.00921630859375, -0.005706787109375, 0.00506591796875, 0.0053405761718...

[ 5443, 41877, 441, 105548, 11935, 83671, 10, 8035, 1022, 11249, 43816, 7251, 19, 135016, 3674, 572, 7, 91616, 8782, 1556, 142508, 20706, 64330, 408, 3571, 12321, 127, 23706, 20625, 11436, 35512, 154663, 2982, 2392, 2189, 39029, 7136, 5584, 4...

[ 0.1571044921875, 0.159423828125, 0.1527099609375, 0.253662109375, 0.042083740234375, 0.2138671875, 0.087158203125, 0.1890869140625, 0.07470703125, 0.08935546875, 0.0858154296875, 0.1417236328125, 0.076416015625, 0.12451171875, 0.050384521484375, 0.076904296875, 0.028778076171875, 0...

embed

68240183_c0

68240183

haskell

0

Title: Integrating Halogen into Yesod build process Problem title: Integrating Halogen into Yesod build process Tags: haskell, halogen, purescript, yesod Problem: Integrating Halogen into Yesod build process I would like to put together a webapp using Yesod for the back end and Halogen (PureScript) for the front end. I...

Integrating Halogen into Yesod build process Integrating Halogen into Yesod build process haskell halogen purescript yesod Integrating Halogen Yesod Integrating Halogen into Yesod build process I would like to put together a webapp using Yesod for the back end and Halogen (PureScript) for the front end. Is there a best...

[ -0.0023040771484375, 0.018798828125, 0.000347137451171875, -0.00262451171875, -0.0264892578125, 0.050537109375, 0.0024261474609375, -0.034912109375, 0.003173828125, -0.02197265625, -0.0052490234375, -0.01953125, -0.005523681640625, 0.0133056640625, 0.002655029296875, -0.01275634765625,...

[ 91969, 1916, 1391, 112537, 3934, 32635, 2199, 45367, 9433, 1556, 142508, 256, 34166, 32032, 2422, 23722, 1884, 25842, 1467, 9007, 17368, 100, 4420, 3564, 136, 683, 3408, 147845, 12912, 2965, 41361, 19441, 78779, 297, 6626, 4127, 3917, 11001, ...

[ 0.19775390625, 0.0340576171875, 0.169189453125, 0.255859375, 0.1002197265625, 0.1669921875, 0.2412109375, 0.1517333984375, 0.117919921875, 0.0992431640625, 0.2269287109375, 0.1385498046875, 0.136962890625, 0.255126953125, 0.130615234375, 0.1787109375, 0.019073486328125, 0.046966552...

embed

15283429_c0

15283429

haskell

0

Title: In Haskell, can you create an object of a class? Problem title: In Haskell, can you create an object of a class? Tags: class, haskell, types Problem: In Haskell, can you create an object of a class? In a Haskell program I'm trying to debug, there is a class defined: class Dictionary d where lookupIn :: d -> Word...

In Haskell, can you create an object of a class? In Haskell, can you create an object of a class? class haskell types Haskell Dictionary Word In Haskell, can you create an object of a class? In a Haskell program I'm trying to debug, there is a class defined: I'd like to create a variable called runs and make it of type...

[ 0.002838134765625, 0.01470947265625, 0.00194549560546875, 0.0194091796875, 0.0019073486328125, 0.023193359375, -0.017333984375, 0.00555419921875, -0.00616455078125, 0.00144195556640625, 0.000972747802734375, -0.023681640625, -0.00191497802734375, -0.01953125, -0.0125732421875, 0.001884...

[ 360, 20625, 142508, 831, 28282, 36746, 111, 18507, 398, 142, 10, 1556, 52895, 147638, 22543, 1528, 8, 85779, 61924, 1884, 77336, 127877, 3249, 10644, 4527, 6713, 2037, 4153, 32354, 33720, 20697, 2053 ]

[ 0.0653076171875, 0.1275634765625, 0.2288818359375, 0.11962890625, 0.19140625, 0.215576171875, 0.1287841796875, 0.228515625, 0.030975341796875, 0.031768798828125, 0.03839111328125, 0.1107177734375, 0.1627197265625, 0.18359375, 0.1051025390625, 0.03955078125, 0.0645751953125, 0.16113...

embed

39926456_c0

39926456

haskell

0

Title: In Haskell, how do you check whether a string is a substring of another? Problem title: In Haskell, how do you check whether a string is a substring of another? Tags: string, haskell Problem: In Haskell, how do you check whether a string is a substring of another? I'm using Data.Text and all I could find are fin...

In Haskell, how do you check whether a string is a substring of another? In Haskell, how do you check whether a string is a substring of another? string haskell Haskell In Haskell, how do you check whether a string is a substring of another? I'm using Data.Text and all I could find are find , which only takes a Char as...

[ 0.0037689208984375, -0.0152587890625, 0.00083160400390625, 0.03173828125, -0.01458740234375, 0.01318359375, 0.01025390625, -0.0189208984375, -0.0022735595703125, 0.00013256072998046875, -0.007110595703125, -0.012939453125, -0.007720947265625, 0.00445556640625, -0.013671875, 0.015869140...

[ 360, 20625, 142508, 3642, 12765, 36766, 79315, 83, 10, 1614, 91693, 111, 15700, 1556, 54, 17368, 11809, 174379, 7413, 51776, 21656, 237, 1653, 2063, 36356, 20320, 3444, 37202, 119261, 11522, 35773, 10484, 71713, 214, 67 ]

[ 0.0174560546875, 0.1121826171875, 0.2188720703125, 0.0484619140625, 0.2249755859375, 0.1219482421875, 0.2469482421875, 0.125732421875, 0.09100341796875, 0.20654296875, 0.1978759765625, 0.070068359375, 0.1195068359375, 0.0826416015625, 0.0499267578125, 0.0015869140625, 0.091552734375,...

embed

20034933_c0

20034933

haskell

0

Title: Cabal: can't find source for xxx_h in dist/build/autogen Problem title: Cabal: can't find source for xxx_h in dist/build/autogen Tags: cabal, haskell Problem: Cabal: can't find source for xxx_h in dist/build/autogen I am trying to install http://open-projects.net/~shahn/darcs/H3D/ but I get the followi...

Cabal: can't find source for xxx_h in dist/build/autogen Cabal: can't find source for xxx_h in dist/build/autogen cabal haskell Horde3DUtils_h Cabal xxx_h Cabal: can't find source for xxx_h in dist/build/autogen I am trying to install http://open-projects.net/~shahn/darcs/H3D/ but I get the following error me...

[ -0.0028076171875, 0.01324462890625, 0.00970458984375, -0.006561279296875, -0.0255126953125, 0.0054931640625, -0.00616455078125, 0.0037384033203125, 0.0023040771484375, -0.014892578125, -0.0017242431640625, -0.042724609375, -0.00921630859375, 0.005096435546875, -0.0023651123046875, -0.0...

[ 30438, 289, 831, 3768, 18, 7413, 31344, 20112, 454, 127, 45, 271, 177149, 8913, 1409, 109524, 1556, 142508, 7974, 112, 363, 3675, 100, 31577, 20600, 59636, 95322, 1179, 115512, 19, 1506, 4439, 841, 397, 25632, 18499, 26008, 959, 5, 11435,...

[ 0.1527099609375, 0.1656494140625, 0.060272216796875, 0.065185546875, 0.07421875, 0.130859375, 0.214111328125, 0.1324462890625, 0.052520751953125, 0.1712646484375, 0.0273590087890625, 0.0645751953125, 0.119140625, 0.1597900390625, 0.1700439453125, 0.2076416015625, 0.056854248046875, ...

embed

26399299_c1

26399299

haskell

1

remains blocked indefinitely inside a STM transaction: "Done heavy work" "Dying with Right ()" "Dying with Left thread blocked indefinitely in an STM transaction" "Dying with Left thread blocked indefinitely in an STM transaction" "Dying with Left thread blocked indefinitely in an STM transaction" ... I suspect the ke...

[ -0.031982421875, 0.0211181640625, 0.021240234375, -0.0198974609375, 0.02001953125, -0.004730224609375, 0.0103759765625, 0.003082275390625, -0.00135040283203125, -0.02490234375, 0.001617431640625, 0.004669189453125, 0.00750732421875, 0.01043701171875, 0.016845703125, 0.01385498046875, ...

[ 47143, 7, 46389, 297, 23, 49919, 37838, 46132, 159, 10111, 124161, 60728, 13, 99162, 4488, 397, 38543, 678, 90911, 2480, 86997, 636, 92610, 22799, 400, 484, 109109, 34627, 71407, 6528, 74733, 31, 28864, 26073, 27131, 63928, 31384, 163812, 2...

[ 0.2169189453125, 0.0350341796875, 0.254150390625, 0.1029052734375, 0.0193023681640625, 0.155029296875, 0.0212554931640625, 0.121337890625, 0.0419921875, 0.217041015625, 0.2127685546875, 0.0831298828125, 0.040985107421875, 0.16845703125, 0.181884765625, 0.061492919921875, 0.1447753906...

embed

41166137_c0

41166137

haskell

0

Title: Haskell PointFree Problem title: Haskell PointFree Tags: haskell Problem: Haskell PointFree How can I convert my function test' that takes l (list of elements) ,n (step) and returns list of selected by step elements to PointFree function? test' n l = test'' n l 0 test'' n [] c = [] test'' n (x:xs) 0 = x:(test'' ...

Haskell PointFree Haskell PointFree haskell Haskell PointFree x:xs ASDFG Haskell PointFree How can I convert my function test' that takes l (list of elements) ,n (step) and returns list of selected by step elements to PointFree function? Method2 test' 2 [1,2,3,4,5] Result [1,3,5] test' 2 "ASDFG Result "ADG" P.S Can't u...

[ -0.01239013671875, 0.01043701171875, -0.00182342529296875, -0.01239013671875, 0.006805419921875, 0.0011749267578125, -0.005828857421875, -0.0174560546875, 0.0196533203125, -0.018310546875, 0.00433349609375, -0.03173828125, -0.004180908203125, 0.0174560546875, -0.023681640625, 0.0163574...

[ 20625, 142508, 41097, 81437, 1556, 425, 6483, 38997, 724, 831, 96760, 32354, 3034, 25, 51776, 96, 6562, 80854, 19, 95528, 30646, 5303, 111, 133291, 390, 29954, 47, 74644, 304, 116, 155761, 80389, 126684, 92714, 9713, 12351, 4527, 24927 ]

[ 0.072998046875, 0.181396484375, 0.1434326171875, 0.2393798828125, 0.0728759765625, 0.03240966796875, 0.0577392578125, 0.08447265625, 0.0826416015625, 0.045806884765625, 0.1802978515625, 0.1788330078125, 0.23193359375, 0.04058837890625, 0.03997802734375, 0.08441162109375, 0.1071777343...

embed

53638120_c0

53638120

haskell

0

Title: separate even and odd elements of list haskell Problem title: separate even and odd elements of list haskell Tags: haskell Problem: separate even and odd elements of list haskell I am trying to separate elements of a list into to further lists, one for the odd and one for even numbers. For Example, input: [1,2,3...

separate even and odd elements of list haskell separate even and odd elements of list haskell haskell x:xs separate even and odd elements of list haskell I am trying to separate elements of a list into to further lists, one for the odd and one for even numbers. For Example, It gives error on ...++ sepList xs anyone cou...

[ 0.00151824951171875, 0.0034027099609375, -0.0036468505859375, -0.013671875, -0.0250244140625, 0.0218505859375, -0.0079345703125, 0.01251220703125, 0.020263671875, 0.0159912109375, 0.0255126953125, -0.0302734375, 0.02392578125, 0.018798828125, 0.00225830078125, -0.006103515625, 0.0149...

[ 84797, 3853, 136, 70270, 80854, 5303, 1556, 142508, 111, 1022, 12, 425, 7, 31577, 3934, 47, 53333, 1632, 100, 101935, 89536, 76199, 18499, 98, 153, 37223, 25040, 154663, 35672, 17997 ]

[ 0.231201171875, 0.2052001953125, 0.1541748046875, 0.229248046875, 0.2012939453125, 0.2030029296875, 0.13330078125, 0.2154541015625, 0.0501708984375, 0.1141357421875, 0.001983642578125, 0.1146240234375, 0.09686279296875, 0.06463623046875, 0.1151123046875, 0.104248046875, 0.11193847656...

embed

20911363_c0

20911363

haskell

0

Title: Stopping/Pickling/Unpickling/Resuming a computation Problem title: Stopping/Pickling/Unpickling/Resuming a computation Tags: haskell, computation Problem: Stopping/Pickling/Unpickling/Resuming a computation Is there any Haskell way of stopping/pickling/unpickling/resuming a computation ? Some relevant discussion...

Stopping/Pickling/Unpickling/Resuming a computation Stopping/Pickling/Unpickling/Resuming a computation haskell computation Stopping Pickling Unpickling Resuming Stopping/Pickling/Unpickling/Resuming a computation Is there any Haskell way of stopping/pickling/unpickling/resuming a computation ? Some relevant discussion...

[ -0.0245361328125, 0.0064697265625, 0.0164794921875, 0.00021648406982421875, 0.0005035400390625, -0.004791259765625, -0.0091552734375, 0.0009765625, -0.00506591796875, -0.03564453125, -0.033203125, -0.0115966796875, 0.00921630859375, 0.02880859375, 0.007293701171875, 0.0111083984375, ...

[ 42284, 10366, 64, 683, 41113, 2069, 14256, 18695, 63664, 4332, 11832, 214, 10, 181135, 1363, 1556, 142508, 122554, 992, 9624, 316, 2071, 2685, 2499, 20625, 3917, 111, 7279, 309, 2109, 29191, 35107, 115058, 53383, 3688, 110, 27798, 29806, 81...

[ 0.1859130859375, 0.177978515625, 0.047943115234375, 0.079833984375, 0.1466064453125, 0.160400390625, 0.09735107421875, 0.1727294921875, 0.1820068359375, 0.10546875, 0.18310546875, 0.08258056640625, 0.049072265625, 0.231689453125, 0.11376953125, 0.146240234375, 0.2685546875, 0.19592...

embed

72761991_c2

72761991

haskell

2

.encode, hashlib.sha256, api_passphrase.encode, KC-API-SIGN, KC-API-TIMESTAMP, KC-API-KEY, KC-API-PASSPHRASE, KC-API-KEY-VERSION, requests.request, response.json, response.request.headers, response.request.body, Config, Crypto.Hash.SHA256, Data.Aeson, Data.ByteString, Data.ByteString.Base64, Data.ByteString.Char8, Data...

[ 0.00885009765625, 0.00714111328125, 0.0023956298828125, -0.030517578125, 0.00848388671875, -0.01031494140625, -0.0076904296875, -0.01104736328125, 0.006866455078125, 0.029052734375, 0.021240234375, 0.005645751953125, -0.000823974609375, 0.00543212890625, -0.030517578125, 0.014770507812...

[ 6, 5, 33, 40899, 4, 1556, 127, 5612, 2420, 127892, 31470, 454, 13409, 179665, 184, 341, 441, 9, 74220, 294, 151657, 68665, 55669, 9088, 186104, 98185, 9434, 29562, 76783, 33255, 118596, 50336, 7, 75616, 57553, 170, 1681, 107, 31251, 1314,...

[ 0.1041259765625, 0.1890869140625, 0.180419921875, 0.30224609375, 0.1107177734375, 0.1837158203125, 0.08892822265625, 0.25146484375, 0.1357421875, 0.284423828125, 0.225830078125, 0.07196044921875, 0.1168212890625, 0.2127685546875, 0.164794921875, 0.1240234375, 0.172607421875, 0.0759...

embed

41753345_c1

41753345

haskell

1

: evilId :: Typeable a => a -> a evilId (EqT (n :: Int)) = n + 1 evilId (EqT (str :: String)) = reverse str evilId x = x Sadly, this does not work at all. GHC does not seem to consult my type annotations before typechecking the pattern, so it believes b is an ambiguous variable in each pattern. Is there any way I can c...

[ -0.00860595703125, 0.0036773681640625, 0.0032806396484375, 0.004119873046875, 0.012451171875, 0.0018463134765625, -0.0224609375, -0.005615234375, 0.01129150390625, -0.04443359375, 0.024169921875, 0.005279541015625, -0.0006103515625, -0.01348876953125, 0.0159912109375, 0.00396728515625,...

[ 28, 5115, 568, 71, 60457, 2886, 10, 44357, 33079, 864, 618, 19, 1984, 360, 18, 653, 997, 106, 9297, 23351, 39531, 184, 7704, 1022, 903, 959, 4488, 756, 527, 73265, 75463, 10644, 8668, 22062, 78292, 103510, 18822, 876, 920, 12282, 77336,...

[ 0.07025146484375, 0.220458984375, 0.10296630859375, 0.1650390625, 0.211181640625, 0.2071533203125, 0.111083984375, 0.060577392578125, 0.1162109375, 0.065185546875, 0.0797119140625, 0.0054931640625, 0.0155181884765625, 0.00506591796875, 0.042144775390625, 0.02081298828125, 0.109375, ...

embed

31703966_c0

31703966

haskell

0

Title: QuickCheck: How to combine two generators? Problem title: QuickCheck: How to combine two generators? Tags: quickcheck, haskell, frege Problem: QuickCheck: How to combine two generators? I have two generators, gen_n & gen_arr : gen_n :: Gen Int gen_n = suchThat arbitrary (\i -> i >= 0 && i <= 10) gen_elem :: Gen ...

QuickCheck: How to combine two generators? QuickCheck: How to combine two generators? quickcheck haskell frege QuickCheck How gen_n gen_arr Gen gen_elem combine_two_gens QuickCheck: How to combine two generators? I have two generators, gen_n & gen_arr : How can I combine these two into a Gen (Int, [Int]) ?

[ -0.0177001953125, 0.007354736328125, -0.01556396484375, 0.0035247802734375, -0.0025634765625, 0.042724609375, 0.003997802734375, -0.037841796875, 0.006195068359375, -0.032470703125, 0.01495361328125, 0.016845703125, 0.005767822265625, 0.00811767578125, -0.016357421875, -0.0242919921875...

[ 89038, 202567, 11249, 70163, 6626, 145823, 7, 47, 63773, 78292, 1556, 142508, 183559, 13, 9226, 19, 147, 42, 15937, 27889, 55547, 20583, 765, 454, 619, 831, 3934, 4153, 18 ]

[ 0.1507568359375, 0.2369384765625, 0.116943359375, 0.2391357421875, 0.1741943359375, 0.2484130859375, 0.1187744140625, 0.049468994140625, 0.1058349609375, 0.1953125, 0.0474853515625, 0.156982421875, 0.0592041015625, 0.057891845703125, 0.159423828125, 0.12890625, 0.0777587890625, 0.1...

embed

24913656_c0

24913656

haskell

0

Title: Haskell -- Is there a monad sequence function for tuples? Problem title: Haskell -- Is there a monad sequence function for tuples? Tags: haskell, monads, sequence, tuples Problem: Haskell -- Is there a monad sequence function for tuples? Suppose I have a value of type Monad m => (m a, m a) , and I want to "seque...

Haskell -- Is there a monad sequence function for tuples? Haskell -- Is there a monad sequence function for tuples? haskell monads sequence tuples Haskell Monad Haskell -- Is there a monad sequence function for tuples? Suppose I have a value of type Monad m => (m a, m a) , and I want to "sequence" the pair to create a ...

[ 0.010009765625, 0.0194091796875, 0.0037384033203125, 0.0439453125, 0.020263671875, 0.003936767578125, -0.015625, -0.01153564453125, -0.004058837890625, -0.01495361328125, -0.004302978515625, 0.0107421875, -0.00921630859375, 0.01263427734375, 0.00165557861328125, -0.01470947265625, -0...

[ 20625, 142508, 4210, 2071, 2685, 10, 2667, 712, 40, 944, 3956, 32354, 100, 370, 99726, 1556, 60331, 71, 34292, 10644, 347, 44357, 39, 3444, 184, 80836, 28282, 11, 70163, 18403, 43701, 6626, 142424, 5570, 3917, 41018, 10422 ]

[ 0.1246337890625, 0.25244140625, 0.0262908935546875, 0.05645751953125, 0.07421875, 0.08319091796875, 0.150390625, 0.1614990234375, 0.0928955078125, 0.1578369140625, 0.1292724609375, 0.232421875, 0.07562255859375, 0.164794921875, 0.258056640625, 0.08050537109375, 0.1600341796875, 0.1...

embed

2502143_c1

2502143

haskell

1

ex.Posix.String> :i RegexMaker class (RegexOptions regex compOpt execOpt) => RegexMaker regex compOpt execOpt source | regex -> compOpt execOpt, compOpt -> regex execOpt, execOpt -> regex compOpt where makeRegex :: source -> regex makeRegexOpts :: compOpt -> execOpt -> source -> regex makeRegexM :: (Monad m) => source ...

[ -0.02392578125, 0.020751953125, 0.0152587890625, 0.0137939453125, -0.0032806396484375, 0.021240234375, 0.00457763671875, -0.0022735595703125, 0.00653076171875, -0.0225830078125, -0.0211181640625, 0.00799560546875, 0.0194091796875, -0.004241943359375, -0.01507568359375, 0.00349426269531...

[ 1119, 7192, 7, 4084, 71713, 214, 14, 11678, 3355, 76978, 56, 18507, 54601, 39029, 5256, 6835, 9969, 18, 3240, 44357, 31344, 7440, 3249, 594, 46674, 712, 347, 262, 5983, 24129, 63473, 156607, 28864, 26073, 10, 20625, 142508, 1914, 822, 216...

[ 0.1510009765625, 0.046783447265625, 0.043060302734375, 0.200439453125, 0.121337890625, 0.004150390625, 0.096923828125, 0.181640625, 0.2320556640625, 0.226318359375, 0.1297607421875, 0.179931640625, 0.174072265625, 0.244384765625, 0.0810546875, 0.1563720703125, 0.1519775390625, 0.10...

embed

39607475_c0

39607475

haskell

0

Title: Is it possible to modify an element in an infinite list? Problem title: Is it possible to modify an element in an infinite list? Tags: haskell Problem: Is it possible to modify an element in an infinite list? Let's say I have a list of zeroes: zeroes = repeat 0 And I'd like to modify the nth member of that list....

Is it possible to modify an element in an infinite list? Is it possible to modify an element in an infinite list? haskell Is it possible to modify an element in an infinite list? Let's say I have a list of zeroes: And I'd like to modify the nth member of that list. Is there a built in for this, or some function I could...

[ -0.025634765625, 0.0020904541015625, 0.007080078125, -0.00897216796875, 0.005035400390625, -0.0079345703125, 0.000873565673828125, -0.0086669921875, 0.01953125, -0.01470947265625, 0.005767822265625, 0.00537109375, 0.0152587890625, -0.00506591796875, -0.004730224609375, 0.00479125976562...

[ 2071, 442, 7722, 47, 2811, 40383, 12830, 23, 142, 54241, 13, 5303, 1556, 142508, 765, 111, 45234, 90, 1884, 653, 927, 32786, 88303, 903, 32354, 33022, 32635, 831, 6183, 23937, 15490, 11341, 2667, 712, 85689, 91084, 36716, 3525, 66161, 319...

[ 0.0714111328125, 0.08203125, 0.205078125, 0.1015625, 0.212646484375, 0.202880859375, 0.2161865234375, 0.1026611328125, 0.04345703125, 0.2025146484375, 0.1246337890625, 0.2401123046875, 0.1641845703125, 0.26611328125, 0.020660400390625, 0.0223541259765625, 0.154541015625, 0.08758544...

embed

39850051_c0

39850051

haskell

0

Title: error: parse error on input ‘where’ Problem title: error: parse error on input ‘where’ Tags: haskell, ghc Problem: error: parse error on input ‘where’ Struggling to understand the GHC compiler and it's mysterious indentation rules but unfortunately this block of code refuses to compile Sorry I know this question...

error: parse error on input ‘where’ error: parse error on input ‘where’ haskell ghc n-1 n-2 Exception error: parse error on input ‘where’ Struggling to understand the GHC compiler and it's mysterious indentation rules but unfortunately this block of code refuses to compile Sorry I know this question has been asked befo...

[ 0.0054931640625, 0.0191650390625, -0.01953125, -0.01373291015625, -0.0030517578125, 0.024169921875, 0.01458740234375, -0.005706787109375, 0.00677490234375, -0.02490234375, 0.01177978515625, -0.03466796875, 0.02099609375, -0.01904296875, 0.01220703125, 0.0010833740234375, 0.0038146972...

[ 18499, 366, 184, 98, 107730, 136913, 12, 1556, 142508, 31380, 238, 653, 5759, 5428, 63928, 204, 63667, 9815, 28219, 527, 73265, 9969, 34759, 759, 824, 93905, 18597, 22062, 91736, 104272, 903, 46389, 18151, 128120, 7, 47, 1340, 90502, 2809, ...

[ 0.222412109375, 0.15966796875, 0.1741943359375, 0.1240234375, 0.215087890625, 0.2344970703125, 0.008056640625, 0.107666015625, 0.2218017578125, 0.1376953125, 0.126220703125, 0.0013427734375, 0.1080322265625, 0.161865234375, 0.15087890625, 0.008331298828125, 0.00457763671875, 0.0062...

embed

27194426_c0

27194426

haskell

0

Title: Haskell : Check for an exact substring Problem title: Haskell : Check for an exact substring Tags: substring, haskell Problem: Haskell : Check for an exact substring I want to write a function which will check for an EXACT substring in the given string. All I am using right now is isInfixOf but my friend just po...

Haskell : Check for an exact substring Haskell : Check for an exact substring substring haskell Haskell Check Haskell : Check for an exact substring I want to write a function which will check for an EXACT substring in the given string. All I am using right now is isInfixOf but my friend just pointed out that it doesn'...

[ 0.02685546875, -0.00347900390625, -0.0027008056640625, 0.03125, -0.017333984375, 0.0206298828125, 0.0128173828125, -0.01409912109375, 0.007415771484375, 0.00836181640625, 0.0093994140625, 0.01007080078125, 0.005462646484375, 0.0118408203125, -0.003082275390625, 0.00421142578125, 0.03...

[ 20625, 142508, 38679, 100, 24763, 1614, 91693, 152, 1556, 142, 3444, 33022, 32354, 12765, 29426, 84161, 23, 34475, 79315, 3164, 17368, 5036, 83, 4153, 55923, 132887, 34391, 6275, 22027, 18, 2565, 32562, 903, 30646, 87599, 2301, 5608, 4734, ...

[ 0.1453857421875, 0.25244140625, 0.23486328125, 0.14013671875, 0.255859375, 0.2152099609375, 0.2418212890625, 0.007110595703125, 0.1422119140625, 0.009918212890625, 0.093017578125, 0.093505859375, 0.1614990234375, 0.213134765625, 0.1353759765625, 0.2119140625, 0.02838134765625, 0.01...

embed

74052263_c0

74052263

haskell

0

Title: Can I use where in Haskell to find function parameter given the function output? Problem title: Can I use where in Haskell to find function parameter given the function output? Tags: functional-programming, haskell, where-clause Problem: Can I use where in Haskell to find function parameter given the function ou...

Can I use where in Haskell to find function parameter given the function output? Can I use where in Haskell to find function parameter given the function output? functional-programming haskell where-clause Can Haskell Integer Can I use where in Haskell to find function parameter given the function output? This is my pr...

[ -0.01287841796875, 0.029296875, -0.00933837890625, -0.0113525390625, -0.00087738037109375, 0.01318359375, 0.0089111328125, -0.00006079673767089844, 0.0011444091796875, -0.007781982421875, 0.00543212890625, -0.033203125, 0.0177001953125, -0.005462646484375, 0.0208740234375, -0.018188476...

[ 4171, 87, 4527, 7440, 23, 20625, 142508, 7413, 32354, 171859, 34475, 140992, 47, 123309, 28966, 1556, 18347, 4032, 44401, 1528, 31380, 318, 9969, 1340, 65771, 9790, 28412, 1022, 33949, 62163, 179933, 959, 7722, 107730, 1295 ]

[ 0.0906982421875, 0.021270751953125, 0.120849609375, 0.20947265625, 0.1005859375, 0.1396484375, 0.241943359375, 0.160400390625, 0.2064208984375, 0.243408203125, 0.0938720703125, 0.193115234375, 0.0374755859375, 0.130859375, 0.059478759765625, 0.10009765625, 0.07403564453125, 0.05181...

embed

45421681_c0

45421681

haskell

0

Title: Add element to the end of a list without going through the whole list (haskell) Problem title: Add element to the end of a list without going through the whole list (haskell) Tags: haskell Problem: Add element to the end of a list without going through the whole list (haskell) Is there a way in Haskell to add an...

Add element to the end of a list without going through the whole list (haskell) Add element to the end of a list without going through the whole list (haskell) haskell Add Add element to the end of a list without going through the whole list (haskell) Is there a way in Haskell to add an element to the end of a list wit...

[ -0.004241943359375, 0.037353515625, 0.01348876953125, -0.009765625, -0.00634765625, 0.01055908203125, -0.0185546875, 0.0068359375, -0.005401611328125, -0.053466796875, 0.0269775390625, -0.032958984375, 0.0262451171875, 0.017578125, -0.016845703125, -0.0033416748046875, 0.010375976562...

[ 29117, 12830, 47, 70, 3564, 111, 5303, 15490, 8305, 28271, 10557, 142508, 1556, 2685, 10, 3917, 23, 20625, 15190, 142, 19441, 89536, 133063, 82449, 3444, 190, 1884, 155761, 80389, 28219, 37223, 39933, 219, 2601, 32233, 24500, 45964 ]

[ 0.168701171875, 0.20703125, 0.119873046875, 0.0302734375, 0.23828125, 0.08795166015625, 0.22314453125, 0.121826171875, 0.10791015625, 0.08087158203125, 0.10064697265625, 0.2471923828125, 0.13037109375, 0.0152435302734375, 0.0428466796875, 0.10736083984375, 0.048553466796875, 0.1448...

embed

7914235_c0

7914235

haskell

0

Title: Haskell: function to accept random Int Problem title: Haskell: function to accept random Int Tags: random, haskell Problem: Haskell: function to accept random Int I have a basic function that accepts an Int and returns a list: generateCode rnd = [sharpOrDot i rnd | i <- [0..24]] I call it from my main function l...

Haskell: function to accept random Int Haskell: function to accept random Int random haskell Haskell Couldn Char Haskell: function to accept random Int I have a basic function that accepts an Int and returns a list: I call it from my main function like this: Shouldn't r <- (randomIO :: Int) "unpack" the Int part from I...

[ 0.00469970703125, 0.0069580078125, 0.0152587890625, -0.00994873046875, 0.012939453125, 0.01361083984375, -0.00714111328125, -0.0167236328125, -0.005645751953125, -0.030517578125, 0.006988525390625, -0.01953125, -0.006866455078125, 0.0224609375, -0.004669189453125, -0.009765625, 0.013...

[ 20625, 142508, 32354, 47, 26946, 96759, 360, 18, 12, 1556, 191147, 19, 21656, 62822, 30646, 10, 5303, 11782, 1295, 5201, 1884, 903, 151117, 1690, 4426, 9, 46258, 39, 17780, 1984, 309, 29102, 2831, 27875, 139392, 114211, 18499 ]

[ 0.14599609375, 0.256103515625, 0.2099609375, 0.1014404296875, 0.2398681640625, 0.216064453125, 0.1651611328125, 0.1712646484375, 0.00579833984375, 0.1297607421875, 0.1063232421875, 0.03436279296875, 0.1678466796875, 0.1163330078125, 0.1109619140625, 0.002105712890625, 0.1195068359375...

embed

12115193_c0

12115193

haskell

0

Title: GHCI character limit? Problem title: GHCI character limit? Tags: runhaskell, emacs, haskell Problem: GHCI character limit? I'm using ghci to do some incremental development using Emacs' run-haskell . Every once in a while, I get an error that looks like <interactive>:[line]:[character]: _Lexical error at charact...

GHCI character limit? GHCI character limit? runhaskell emacs haskell GHCI _Lexical EOT GHCI character limit? I'm using ghci to do some incremental development using Emacs' run-haskell . Every once in a while, I get an error that looks like Setting up an intermediate variable or two gets a working response, and the file...

[ -0.0028533935546875, -0.004913330078125, 0.0152587890625, -0.005706787109375, 0.0038299560546875, 0.004150390625, 0.00787353515625, 0.0022430419921875, 0.00921630859375, -0.007720947265625, -0.003662109375, -0.0283203125, 0.0074462890625, -0.007080078125, 0.0213623046875, 0.00105285644...

[ 41877, 17304, 62816, 17475, 11675, 10557, 142508, 352, 2263, 1556, 5267, 425, 21533, 241, 23973, 32, 17368, 31380, 318, 145322, 34754, 85269, 4439, 87769, 24145, 12960, 18499, 33342, 503, 19514, 1257, 81814, 77336, 6626, 20697, 57553, 11435, ...

[ 0.1578369140625, 0.199462890625, 0.2259521484375, 0.20849609375, 0.08203125, 0.0894775390625, 0.20849609375, 0.041595458984375, 0.084716796875, 0.1138916015625, 0.03839111328125, 0.07684326171875, 0.0914306640625, 0.07275390625, 0.1962890625, 0.001129150390625, 0.04278564453125, 0....

embed

33847819_c0

33847819

haskell

0

Title: Using stack for profiling Problem title: Using stack for profiling Tags: haskell-stack, haskell Problem: Using stack for profiling I'm trying to do some profiling using stack --enable-profiling and I'm a bit confused about what's happening exactly. Do I need to use also --enable-library ?. Also, is it build in a...

Using stack for profiling Using stack for profiling haskell-stack haskell Using Using stack for profiling I'm trying to do some profiling using stack --enable-profiling and I'm a bit confused about what's happening exactly. Do I need to use also --enable-library ?. Also, is it build in a separate directory ?What happen...

[ -0.006866455078125, -0.007232666015625, -0.01104736328125, -0.019287109375, -0.01422119140625, 0.01300048828125, -0.007598876953125, -0.006317138671875, 0.00775146484375, -0.021728515625, 0.007232666015625, -0.0034332275390625, 0.0252685546875, 0.00112152099609375, -0.0062255859375, 0....

[ 345, 177261, 100, 9468, 214, 1556, 142508, 590, 2594, 6953, 31577, 17368, 4210, 33, 2886, 58395, 55681, 123087, 3871, 4527, 150, 2844, 1294, 45367, 84797, 14364, 37629, 13736, 170198, 60641, 4348, 20, 670, 304, 35829, 5423, 442, 191082 ]

[ 0.0650634765625, 0.25537109375, 0.033050537109375, 0.254150390625, 0.10986328125, 0.0997314453125, 0.197021484375, 0.08624267578125, 0.090576171875, 0.0057373046875, 0.00128173828125, 0.031890869140625, 0.094970703125, 0.07122802734375, 0.154296875, 0.239013671875, 0.027435302734375,...

embed

18382349_c1

18382349

haskell

1

need to sort the rows afterwards, and Repa seems to have no support for sorting, and I don't want to be writing sort algorithms myself. So I don't know how to have a giant rectangular array and yet still sort it. Suggestions for libraries to use, GC flags to set, or anything else? The machine has 24 cores and 24GB of ...

[ 0.00537109375, 0.0277099609375, 0.00145721435546875, 0.0238037109375, -0.0096435546875, -0.005279541015625, -0.0035552978515625, -0.022216796875, -0.00113677978515625, 0.0157470703125, -0.01123046875, -0.029052734375, 0.00194549560546875, -0.017578125, -0.03955078125, -0.010009765625, ...

[ 3871, 12096, 15555, 7, 7103, 19364, 33742, 11, 37202, 110, 8060, 214, 3444, 32562, 234873, 35978, 18, 3714, 3642, 765, 6051, 148734, 10393, 320, 10298, 53, 136, 14373, 7464, 442, 104235, 141933, 35773, 4527, 69657, 49938, 5423, 36279, 1556,...

[ 0.1041259765625, 0.271728515625, 0.193359375, 0.028533935546875, 0.037353515625, 0.0548095703125, 0.1593017578125, 0.151123046875, 0.01239013671875, 0.0694580078125, 0.1868896484375, 0.07537841796875, 0.09197998046875, 0.0218048095703125, 0.14697265625, 0.04833984375, 0.0469055175781...

embed

38019758_c0

38019758

haskell

0

Title: Does GHC optimize away unused code and packages? Problem title: Does GHC optimize away unused code and packages? Tags: compiler-optimization, package, module, haskell, ghc Problem: Does GHC optimize away unused code and packages? Let's say a big package is included to a project and only one function from the pac...

Does GHC optimize away unused code and packages? Does GHC optimize away unused code and packages? compiler-optimization package module haskell ghc Does GHC Does GHC optimize away unused code and packages? Let's say a big package is included to a project and only one function from the package is used, is the rest of the...

[ 0.0145263671875, 0.005828857421875, 0.021728515625, 0.006622314453125, -0.0184326171875, 0.00830078125, -0.007659912109375, -0.0064697265625, -0.0133056640625, 0.03271484375, -0.006744384765625, -0.0220947265625, 0.007476806640625, 0.0289306640625, 0.01153564453125, 0.02294921875, 0....

[ 527, 73265, 15572, 20650, 16065, 51, 33740, 18151, 136, 98169, 101790, 9969, 34759, 100433, 88996, 1556, 142508, 31380, 238, 6957, 99201, 13452, 4734, 1632, 32354, 11814, 10588, 29367, 49725, 2704, 2394, 6635, 3564, 8306, 24927, 10644, 35773, ...

[ 0.1146240234375, 0.239013671875, 0.1695556640625, 0.1009521484375, 0.1419677734375, 0.069091796875, 0.1697998046875, 0.1624755859375, 0.054931640625, 0.18994140625, 0.03948974609375, 0.119140625, 0.080078125, 0.123779296875, 0.1180419921875, 0.0858154296875, 0.1761474609375, 0.1258...

embed

42428194_c0

42428194

haskell

0

Title: New line indentation Haskell Problem title: New line indentation Haskell Tags: string, indentation, haskell Problem: New line indentation Haskell I am a complete novice in Haskell and have the following question: I intend to create the function, which puts three Strings on different lines. Here is the code: onTh...

New line indentation Haskell New line indentation Haskell string indentation haskell Haskell Life New line indentation Haskell I am a complete novice in Haskell and have the following question: I intend to create the function, which puts three Strings on different lines. Here is the code: Here is what I run: And what I...

[ -0.0269775390625, -0.02587890625, 0.0029296875, 0.0128173828125, 0.006988525390625, 0.0142822265625, 0.0185546875, 0.0086669921875, 0.003021240234375, -0.016845703125, -0.01458740234375, -0.01171875, -0.01251220703125, 0.0157470703125, -0.0120849609375, 0.018310546875, 0.029174804687...

[ 2356, 13315, 18597, 22062, 20625, 142508, 79315, 1556, 16505, 28484, 95968, 9655, 150661, 28282, 32354, 3884, 17262, 23351, 5180, 12921, 124519, 18151, 11675, 37842, 25632, 62816, 22027, 18, 4488 ]

[ 0.10137939453125, 0.1644287109375, 0.15673828125, 0.109130859375, 0.1275634765625, 0.2132568359375, 0.1658935546875, 0.10791015625, 0.13330078125, 0.011871337890625, 0.09051513671875, 0.007293701171875, 0.07470703125, 0.07891845703125, 0.172607421875, 0.08636474609375, 0.163452148437...

embed

4505850_c0

4505850

haskell

0

Title: Pairing adjacent list items in Haskell Problem title: Pairing adjacent list items in Haskell Tags: zip, haskell, list Problem: Pairing adjacent list items in Haskell I have a chained list like ["root", "foo", "bar", "blah"] And I'd like to convert it to a list of tuples, using adjacent pairs. Like so [("root", "...

Pairing adjacent list items in Haskell Pairing adjacent list items in Haskell zip haskell list Pairing Haskell Pairing adjacent list items in Haskell I have a chained list like And I'd like to convert it to a list of tuples, using adjacent pairs. Like so At the moment, I'm using this to do it: However, I don't really l...

[ -0.004730224609375, -0.0013275146484375, -0.00885009765625, 0.0177001953125, 0.00872802734375, 0.0341796875, -0.0322265625, 0.000286102294921875, 0.005584716796875, -0.0185546875, 0.01025390625, -0.00160980224609375, -0.00022125244140625, 0.01104736328125, -0.0096435546875, 0.001098632...

[ 37897, 2852, 123594, 16797, 5303, 55769, 20625, 142508, 23, 68330, 1556, 765, 121293, 297, 1884, 3493, 96760, 47, 10, 370, 99726, 17368, 80836, 18852, 3095, 903, 33306, 2301, 18, 6183, 55300, 5351, 11522, 3917, 162520, 1747, 12524, 180663, ...

[ 0.1983642578125, 0.09033203125, 0.1580810546875, 0.1900634765625, 0.2108154296875, 0.1705322265625, 0.14111328125, 0.2198486328125, 0.0257720947265625, 0.1796875, 0.1328125, 0.015838623046875, 0.14111328125, 0.09783935546875, 0.123291015625, 0.08489990234375, 0.1636962890625, 0.077...

embed

9707190_c0

9707190

haskell

0

Title: Time cost of Haskell `seq` operator Problem title: Time cost of Haskell `seq` operator Tags: lazy-evaluation, haskell, strict, seq Problem: Time cost of Haskell `seq` operator This FAQ says that The seq operator is seq :: a -> b -> b x seq y will evaluate x, enough to check that it is not bottom, then discard th...

Time cost of Haskell `seq` operator Time cost of Haskell `seq` operator lazy-evaluation haskell strict seq Time Haskell Time cost of Haskell `seq` operator This FAQ says that That's awfully nice of Haskell, but does it mean that in the cost of evaluating x will be paid twice ("discard the result")?

[ 0.0142822265625, 0.0255126953125, 0.01300048828125, 0.0213623046875, 0.0267333984375, -0.0027008056640625, 0.004608154296875, 0.016845703125, -0.0048828125, -0.031494140625, -0.0111083984375, 0.0081787109375, 0.006134033203125, 0.0223388671875, -0.015869140625, 0.0037078857421875, -0...

[ 19055, 11034, 20625, 142508, 184, 864, 39933, 21, 3285, 159258, 1556, 81113, 40, 52064, 434, 126351, 26267, 29459, 151575, 214, 1022, 1221, 72090, 186351, 3827, 38931, 16750 ]

[ 0.1246337890625, 0.1942138671875, 0.119140625, 0.2314453125, 0.094970703125, 0.200439453125, 0.178466796875, 0.0623779296875, 0.15380859375, 0.142333984375, 0.0997314453125, 0.112548828125, 0.0816650390625, 0.1083984375, 0.0284423828125, 0.050048828125, 0.09674072265625, 0.06488037...

embed

5744380_c0

5744380

haskell

0

Title: Not in scope: `S.elementOf' Problem title: Not in scope: `S.elementOf' Tags: haskell Problem: Not in scope: `S.elementOf' why load a normal file, have error Not in scope: `S.elementOf' import Control.Monad.Reader import Control.Monad.State import Control.Monad.Error import qualified Data.Set as S .... ...

Not in scope: `S.elementOf' Not in scope: `S.elementOf' haskell Control.Monad.Error Control.Monad.Reader Control.Monad.State qualified Not S.elementOf Data.Set S.insert Not in scope: `S.elementOf' why load a normal file, have error Not in scope: `S.elementOf'

[ 0.0015869140625, 0.0031890869140625, -0.00347900390625, 0.0279541015625, -0.01116943359375, -0.005462646484375, -0.0028533935546875, -0.01239013671875, 0.0076904296875, -0.0205078125, 0, 0.00933837890625, 0.0133056640625, -0.004638671875, 0.0216064453125, -0.00506591796875, -0.002899...

[ 11205, 23, 70820, 294, 5, 62766, 132887, 3768, 1556, 142508, 27131, 46674, 712, 18468, 31611, 31345, 135206, 217225, 159, 11809, 126, 33657, 15400, 72367, 3638, 11435, 765, 18499 ]

[ 0.2186279296875, 0.1878662109375, 0.24072265625, 0.113037109375, 0.048095703125, 0.2044677734375, 0.2978515625, 0.1082763671875, 0.1202392578125, 0.240478515625, 0.1624755859375, 0.059906005859375, 0.092529296875, 0.038726806640625, 0.07440185546875, 0.116943359375, 0.067626953125, ...

embed

36407995_c0

36407995

haskell

0

Title: Html Tag parser in Haskell Problem title: Html Tag parser in Haskell Tags: parsing, html, haskell Problem: Html Tag parser in Haskell Hi I have an assignment which is supposed to check given a string if it can become a valid html file. like for example running this: doc2 = “<head> Test2 <body> Testing </body>" s...

Html Tag parser in Haskell Html Tag parser in Haskell parsing html haskell Html Tag Haskell doc2 Test2 Testing Html Tag parser in Haskell Hi I have an assignment which is supposed to check given a string if it can become a valid html file. like for example running this: should output this: the trouble I am having is cr...

[ 0.017578125, 0.0147705078125, 0.000020623207092285156, 0.01116943359375, -0.01287841796875, 0.0267333984375, -0.025146484375, -0.0230712890625, 0.00162506103515625, -0.00872802734375, 0.0020294189453125, -0.025390625, -0.01483154296875, -0.0142822265625, -0.004730224609375, 0.003753662...

[ 572, 18, 7237, 4837, 366, 2189, 23, 20625, 142508, 6953, 7693, 1556, 51584, 304, 8647, 95486, 674, 134598, 12765, 34475, 79315, 2174, 831, 24209, 35604, 11435, 27781, 51042, 903, 5608, 140992, 63134, 19441, 105233, 100, 69141, 3714, 83, 981...

[ 0.042022705078125, 0.1278076171875, 0.1622314453125, 0.1917724609375, 0.1514892578125, 0.1798095703125, 0.036773681640625, 0.140380859375, 0.219970703125, 0.03912353515625, 0.1959228515625, 0.1318359375, 0.0416259765625, 0.053863525390625, 0.0941162109375, 0.142822265625, 0.057464599...

embed

39136975_c0

39136975

haskell

0

Title: Haskell: Define product with foldr Problem title: Haskell: Define product with foldr Tags: haskell Problem: Haskell: Define product with foldr I'm trying to define product with foldr : I could do it with: new_product xs = foldr (*) 1 xs but not: new_product = foldr (*) 1 or: new_product = \xs -> foldr (*) 1 xs B...

Haskell: Define product with foldr Haskell: Define product with foldr haskell Haskell Define new_product Haskell: Define product with foldr I'm trying to define product with foldr : I could do it with: new_product xs = foldr (*) 1 xs but not: new_product = foldr (*) 1 or: new_product = \xs -> foldr (*) 1 xs Both defini...

[ -0.0177001953125, 0.01904296875, -0.0128173828125, 0.00537109375, -0.02099609375, 0.0216064453125, -0.0086669921875, 0.0107421875, 0.004425048828125, -0.0286865234375, 0.0031280517578125, -0.02294921875, -0.010498046875, -0.005615234375, 0.00153350830078125, -0.00970458984375, -0.001...

[ 20625, 142508, 262, 64552, 12996, 678, 18344, 7569, 1556, 3525, 57877, 31577, 61924, 5809, 54, 1022, 7, 80019, 106, 1284, 959, 2203, 707, 41872, 425, 149766, 80934, 27489, 5701, 18499, 10644, 30022 ]

[ 0.1265869140625, 0.217041015625, 0.07244873046875, 0.170654296875, 0.246826171875, 0.10174560546875, 0.1650390625, 0.21875, 0.1199951171875, 0.139404296875, 0.263916015625, 0.05194091796875, 0.1904296875, 0.0487060546875, 0.016143798828125, 0.08636474609375, 0.0777587890625, 0.0808...

embed

50336662_c0

50336662

haskell

0

Title: Is there a function in Haskell that returns the type of its argument (or a string showing the type)? Problem title: Is there a function in Haskell that returns the type of its argument (or a string showing the type)? Tags: haskell Problem: Is there a function in Haskell that returns the type of its argument (or ...

Is there a function in Haskell that returns the type of its argument (or a string showing the type)? Is there a function in Haskell that returns the type of its argument (or a string showing the type)? haskell Haskell Is there a function in Haskell that returns the type of its argument (or a string showing the type)? I...

[ 0.017333984375, -0.003265380859375, 0.014404296875, 0.0257568359375, -0.0022735595703125, 0.014404296875, -0.0093994140625, -0.00089263916015625, -0.0120849609375, -0.01397705078125, 0.007598876953125, -0.037109375, -0.0164794921875, -0.0025177001953125, -0.00136566162109375, 0.0058898...

[ 2685, 32354, 23, 20625, 142508, 30646, 10644, 111, 6863, 10750, 79315, 141377, 10, 1556, 450, 7, 1632, 831, 11782, 28032, 1528, 14602, 2367, 152, 18, 212398, 53418, 10422, 176377, 9351, 237, 23351, 214 ]

[ 0.050750732421875, 0.2052001953125, 0.07696533203125, 0.12109375, 0.2310791015625, 0.1898193359375, 0.2320556640625, 0.0645751953125, 0.052276611328125, 0.2012939453125, 0.1676025390625, 0.092529296875, 0.060455322265625, 0.076416015625, 0.0174407958984375, 0.0421142578125, 0.0021057...

embed

51028_c0

51028

haskell

0

Title: Create background process in windows without visible console window Problem title: Create background process in windows without visible console window Tags: windows, haskell Problem: Create background process in windows without visible console window How do I create a background process with Haskell on windows w...

Create background process in windows without visible console window Create background process in windows without visible console window windows haskell Create Create background process in windows without visible console window How do I create a background process with Haskell on windows without a visible command window...

[ -0.0021209716796875, 0.028076171875, -0.015869140625, 0.01611328125, -0.0126953125, 0.00897216796875, 0.00469970703125, -0.0262451171875, 0.006744384765625, -0.02294921875, -0.0196533203125, 0.01708984375, 0.0281982421875, 0.0164794921875, 0.0147705078125, 0.0169677734375, 0.01544189...

[ 151313, 76615, 9433, 23, 54825, 15490, 75693, 130250, 76896, 1556, 142508, 28282, 678, 20625, 98, 75101, 75935, 54397, 1528, 126502, 14922, 11907, 1733, 11675, 9803, 7, 2663, 756, 1884, 47, 2046, 31351, 111, 903, 30362 ]

[ 0.1417236328125, 0.23681640625, 0.183349609375, 0.0655517578125, 0.1490478515625, 0.1361083984375, 0.1649169921875, 0.1910400390625, 0.17236328125, 0.133056640625, 0.2418212890625, 0.150146484375, 0.05413818359375, 0.1378173828125, 0.0179443359375, 0.1993408203125, 0.10247802734375, ...

embed

71678825_c0

71678825

haskell

0

Title: Case matching on read function in Haskell Problem title: Case matching on read function in Haskell Tags: switch-statement, record, haskell, parsing Problem: Case matching on read function in Haskell I am wondering how to check success or failure (resulting in Prelude.read: no parse) of the read function in Haske...

Case matching on read function in Haskell Case matching on read function in Haskell switch-statement record haskell parsing Case Haskell Case matching on read function in Haskell I am wondering how to check success or failure (resulting in Prelude.read: no parse) of the read function in Haskell. In my case i run "(read...

[ -0.0289306640625, -0.004425048828125, 0.005462646484375, 0.01287841796875, 0.0084228515625, 0.006256103515625, -0.0001659393310546875, -0.006988525390625, 0.000263214111328125, 0.016357421875, 0.0233154296875, -0.01129150390625, -0.02197265625, -0.0361328125, 0.017578125, -0.0297851562...

[ 43731, 14858, 214, 98, 12301, 32354, 20625, 142508, 23, 101089, 61340, 17164, 1556, 366, 149016, 47, 12765, 36272, 707, 137578, 202, 1914, 822, 112, 39116, 110, 184, 7225, 11675, 9384, 3674, 1984, 360, 18, 18151, 45646, 44457, 13648, 11001,...

[ 0.2254638671875, 0.214599609375, 0.06610107421875, 0.035888671875, 0.250244140625, 0.1671142578125, 0.138671875, 0.2347412109375, 0.03436279296875, 0.1680908203125, 0.123779296875, 0.1417236328125, 0.1116943359375, 0.141357421875, 0.01751708984375, 0.013885498046875, 0.1956787109375,...

embed

76887204_c0

76887204

haskell

0

Title: Joining NonEmpty types in Haskell Problem title: Joining NonEmpty types in Haskell Tags: list, haskell Problem: Joining NonEmpty types in Haskell <interactive>:65:6: error: • Couldn't match expected type: [a] with actual type: NonEmpty a1 • In the second argument of ‘(++)’, namely ‘y’ In the expression: x ++ y I...

Joining NonEmpty types in Haskell Joining NonEmpty types in Haskell list haskell it Joining NonEmpty Haskell Couldn Relevant Joining NonEmpty types in Haskell If I have two generic objects of type (NonEmpty a), how can I join those two objects into a new (NonEmpty a), just like ++ does with lists? I was expecting to be...

[ -0.0263671875, -0.00168609619140625, 0.015625, -0.00592041015625, 0.00531005859375, 0.02392578125, -0.031982421875, 0.0012359619140625, 0.00714111328125, -0.00677490234375, -0.00045013427734375, -0.032470703125, 0.0032501220703125, -0.017333984375, -0.01556396484375, 0.0147705078125, ...

[ 113053, 3775, 134332, 939, 52895, 20625, 142508, 23, 5303, 1556, 191147, 765, 6626, 189534, 36746, 10644, 59881, 10, 3642, 831, 33284, 3934, 3525, 37223, 41206, 25632, 18499, 39933, 56112, 18, 61924, 21373, 19882 ]

[ 0.217041015625, 0.1561279296875, 0.200439453125, 0.12939453125, 0.2227783203125, 0.12353515625, 0.23974609375, 0.024078369140625, 0.1263427734375, 0.1087646484375, 0.03753662109375, 0.0164031982421875, 0.1148681640625, 0.145751953125, 0.1463623046875, 0.159423828125, 0.1300048828125,...

embed

29993609_c0

29993609

haskell

0

Title: Do Cabal recognize packages installed by system package manager Problem title: Do Cabal recognize packages installed by system package manager Tags: package-managers, linker, haskell, cabal Problem: Do Cabal recognize packages installed by system package manager I had lately linker problem during compilation of ...

Do Cabal recognize packages installed by system package manager Do Cabal recognize packages installed by system package manager package-managers linker haskell cabal Cabal Do Cabal recognize packages installed by system package manager I had lately linker problem during compilation of Haskell code and I wonder whether ...

[ 0.0157470703125, -0.005279541015625, 0.01483154296875, 0.00531005859375, 0.00299072265625, 0.03125, -0.0006256103515625, 0.0167236328125, -0.015625, 0.0233154296875, -0.00762939453125, -0.01904296875, -0.00750732421875, 0.00933837890625, -0.0013580322265625, 0.01025390625, -0.0044555...

[ 984, 30438, 289, 125296, 98169, 7, 20600, 390, 5426, 31095, 141395, 3126, 56, 1556, 142508, 109524, 297, 2967, 98352, 20625, 18151, 831, 7413, 11787, 98504, 1193, 56566, 990, 21771, 10002, 11389, 214 ]

[ 0.0472412109375, 0.1864013671875, 0.1951904296875, 0.1737060546875, 0.23974609375, 0.011810302734375, 0.1748046875, 0.0986328125, 0.0767822265625, 0.2236328125, 0.1661376953125, 0.1514892578125, 0.12890625, 0.101318359375, 0.1956787109375, 0.2286376953125, 0.012542724609375, 0.0847...

embed

63022817_c0

63022817

haskell

0

Title: Tasty xml *and* html generation? Problem title: Tasty xml *and* html generation? Tags: automated-tests, haskell Problem: Tasty xml *and* html generation? I would like to use both tasty-ant-xml and tasty-html simultaneously. However, defaultMainWithIngredients (antXMLRunner:htmlRunner:defaultIngredients) Doing th...

Tasty xml *and* html generation? Tasty xml *and* html generation? automated-tests haskell Tasty antXMLRunner:htmlRunner:defaultIngredients Tasty xml *and* html generation? I would like to use both tasty-ant-xml and tasty-html simultaneously. However, Doing this and supplying both --html and --xml options at the command...

[ 0.0081787109375, 0.008056640625, 0.0113525390625, -0.0118408203125, -0.00811767578125, -0.0079345703125, -0.006103515625, -0.0123291015625, 0.0003299713134765625, 0.001556396484375, -0.00250244140625, -0.00592041015625, 0.004974365234375, 0.0067138671875, -0.0014801025390625, -0.003219...

[ 9598, 939, 131492, 2940, 7693, 58093, 11408, 297, 6954, 1556, 142508, 12936, 1542, 39456, 163321, 1679, 214810, 242238, 1884, 4527, 15044, 308, 8946, 1236, 136, 134477, 100677, 4210, 50717, 75101, 13315, 4734, 140992, 3917, 2046, 6397, 47, 13...

[ 0.2177734375, 0.2413330078125, 0.24169921875, 0.1268310546875, 0.216064453125, 0.196044921875, 0.10198974609375, 0.0171356201171875, 0.138916015625, 0.057037353515625, 0.15625, 0.10174560546875, 0.0238494873046875, 0.1624755859375, 0.0777587890625, 0.051605224609375, 0.174560546875, ...

embed

26260752_c0

26260752

haskell

0

Title: Sort one list by the order of another list Problem title: Sort one list by the order of another list Tags: haskell, sorting Problem: Sort one list by the order of another list I need to sort one list by the order of another, but I don't know how it can be done. For example: I could have a list a similar to: [C, ...

Sort one list by the order of another list Sort one list by the order of another list haskell sorting Sort Sort one list by the order of another list I need to sort one list by the order of another, but I don't know how it can be done. For example: I could have a list a similar to: And a list b (that sets the order): (...

[ 0.01531982421875, 0.005523681640625, -0.00165557861328125, 0.000675201416015625, -0.0086669921875, 0.00421142578125, -0.0196533203125, -0.00592041015625, 0.0230712890625, 0.0126953125, -0.006317138671875, 0.0096435546875, 0.000377655029296875, 0.0196533203125, -0.015869140625, -0.01708...

[ 53666, 1632, 5303, 390, 12989, 111, 15700, 1556, 142508, 12096, 214, 3871, 3714, 16940, 5809, 21373, 47, 876, 5423, 27781, 8561, 142424, 10, 5608, 17497, 71, 5701, 32036, 24209, 11249, 903 ]

[ 0.1890869140625, 0.0787353515625, 0.211669921875, 0.0362548828125, 0.1746826171875, 0.0635986328125, 0.1190185546875, 0.0987548828125, 0.1927490234375, 0.213623046875, 0.055908203125, 0.05279541015625, 0.00372314453125, 0.03662109375, 0.012359619140625, 0.083251953125, 0.072875976562...

embed

19594655_c0

19594655

haskell

0

Title: Random number in Haskell Problem title: Random number in Haskell Tags: haskell, random Problem: Random number in Haskell I'm trying to get a random number in Haskell. (Which I'm currently learning and haven't got on to Monads or IO, etc) the problem is the functions in System.Random all return an IO Int, which I...

Random number in Haskell Random number in Haskell haskell random Random Haskell Random number in Haskell I'm trying to get a random number in Haskell. (Which I'm currently learning and haven't got on to Monads or IO, etc) the problem is the functions in System.Random all return an IO Int, which I then can't use in the ...

[ -0.0027008056640625, 0.00201416015625, 0.00836181640625, -0.0003833770751953125, -0.00159454345703125, 0.0177001953125, -0.0277099609375, -0.03369140625, -0.019287109375, -0.0419921875, 0.01416015625, -0.01483154296875, -0.01483154296875, -0.0037994384765625, 0.002777099609375, -0.0024...

[ 39643, 306, 14012, 23, 20625, 142508, 1556, 96759, 31577, 2046, 82424, 52080, 38246, 60331, 6468, 17780, 2967, 32354, 12353, 126525, 3815, 756, 30646, 360, 18, 831, 4527, 18151, 136, 38699, 257, 151814, 3688, 55076, 80836, 5303, 5117, 21917, ...

[ 0.180908203125, 0.14013671875, 0.21142578125, 0.0753173828125, 0.1533203125, 0.2353515625, 0.13818359375, 0.21435546875, 0.05242919921875, 0.0748291015625, 0.031951904296875, 0.04486083984375, 0.0032958984375, 0.0545654296875, 0.04217529296875, 0.1629638671875, 0.097412109375, 0.14...

embed

72839991_c0

72839991

haskell

0

Title: Non-exhaustive patterns in function with tuples HASKELL Problem title: Non-exhaustive patterns in function with tuples HASKELL Tags: haskell Problem: Non-exhaustive patterns in function with tuples HASKELL regiuleishon :: (Bool, Integer) -> Integer regiuleishon (True, _) = 0 reguleishon (False, x) | x >= 0 = 1 |...

Non-exhaustive patterns in function with tuples HASKELL Non-exhaustive patterns in function with tuples HASKELL haskell Non-exhaustive HASKELL Bool Integer Non-exhaustive patterns in function with tuples HASKELL Why doesn't this code work? The program says: I try to put -> (True, 2) and the response is 0 but if I put (...

[ -0.0189208984375, 0.00775146484375, 0.00145721435546875, 0.01129150390625, 0.00421142578125, 0.016845703125, -0.00408935546875, -0.0128173828125, 0.00958251953125, 0.0076904296875, 0.01141357421875, 0.00372314453125, 0.00457763671875, 0.0089111328125, 0.019287109375, 0.0103759765625, ...

[ 3775, 3355, 18391, 4935, 103510, 32354, 678, 370, 99726, 11666, 10762, 56051, 1556, 142508, 2460, 929, 44401, 22027, 18, 903, 18151, 4488, 1528, 17378, 9790, 3884, 33079, 882, 4958, 57553, 757, 2174, 17647, 11971, 1781, 31124, 131527, 135179 ...

[ 0.146728515625, 0.025665283203125, 0.1441650390625, 0.052642822265625, 0.197021484375, 0.1331787109375, 0.06591796875, 0.094970703125, 0.1473388671875, 0.10595703125, 0.1114501953125, 0.1644287109375, 0.12890625, 0.19873046875, 0.0582275390625, 0.125244140625, 0.1468505859375, 0.09...

embed

7804802_c0

7804802

haskell

0

Title: Haskell: Types don't match Problem title: Haskell: Types don't match Tags: haskell, signature Problem: Haskell: Types don't match I just tried to write a simple function to calculate the average of the input-Ints: avg :: Int -> Int -> Int -> Float avg x y z = (x+y+z)/3 When I exchange the signature to ...

Haskell: Types don't match Haskell: Types don't match haskell signature Haskell Types Float Haskell: Types don't match I just tried to write a simple function to calculate the average of the input-Ints: When I exchange the signature to it works fine, but with the one above I get the following error message: C...

[ 0.001129150390625, -0.00665283203125, -0.00160980224609375, 0.000583648681640625, -0.0250244140625, -0.01031494140625, 0.0033416748046875, -0.001678466796875, -0.001678466796875, 0.016357421875, 0.0009613037109375, -0.03564453125, 0.0211181640625, 0.01202392578125, 0.007080078125, 0.00...

[ 20625, 142508, 60457, 7, 2301, 3768, 18, 14858, 1556, 138256, 38699, 257, 37842, 33022, 8781, 32354, 74481, 83080, 107730, 4153, 933, 121122, 43240, 5885, 18499, 26008, 191147, 84751, 10644, 919, 365, 678, 8561, 97370, 4527, 5117, 26946, 360,...

[ 0.1246337890625, 0.23583984375, 0.2347412109375, 0.027923583984375, 0.059173583984375, 0.06011962890625, 0.127685546875, 0.2030029296875, 0.1199951171875, 0.2154541015625, 0.1953125, 0.1236572265625, 0.019317626953125, 0.0157318115234375, 0.043365478515625, 0.0992431640625, 0.1136474...

embed

32026739_c0

32026739

haskell

0

Title: Could dynamic linking hurt inlining thus performance in GHC? Problem title: Could dynamic linking hurt inlining thus performance in GHC? Tags: inline, haskell, dynamic-linking, ghc Problem: Could dynamic linking hurt inlining thus performance in GHC? It's no secret that inlining is what's enabling a lot of the s...

Could dynamic linking hurt inlining thus performance in GHC? Could dynamic linking hurt inlining thus performance in GHC? inline haskell dynamic-linking ghc Could GHC Could dynamic linking hurt inlining thus performance in GHC? It's no secret that inlining is what's enabling a lot of the sophisticated optimizations GHC...

[ 0.0047607421875, -0.0107421875, 0.013916015625, 0.0031890869140625, -0.0145263671875, 0.0196533203125, -0.0184326171875, -0.0037078857421875, -0.009521484375, -0.0135498046875, -0.0029449462890625, -0.016357421875, 0.00469970703125, 0.006072998046875, 0.0145263671875, 0.00982666015625,...

[ 191147, 84079, 3126, 214, 103049, 23, 150, 592, 23718, 527, 73265, 2256, 1556, 142508, 10187, 31380, 238, 87235, 35773, 8561, 81717, 991, 11435, 5809, 7464, 7440, 201939, 56566, 10588, 40715 ]

[ 0.09375, 0.2232666015625, 0.197021484375, 0.08551025390625, 0.1790771484375, 0.1363525390625, 0.1685791015625, 0.1219482421875, 0.1611328125, 0.0794677734375, 0.1873779296875, 0.2044677734375, 0.0955810546875, 0.19580078125, 0.1741943359375, 0.0826416015625, 0.04949951171875, 0.115...

embed

14543805_c1

14543805

haskell

1

), 2180 ms doesn't cut it. So why is my first solution so ridiculously slow? Even by following the profiling tips from Real World Haskell I still can't make sense of this (all I could figure out was that the majority of time was spent in readIntPair function, which didn't help much). If you want to do some testing of y...

[ -0.0284423828125, 0.0078125, -0.004150390625, -0.002960205078125, -0.011474609375, 0.003997802734375, -0.025390625, -0.00567626953125, -0.005340576171875, -0.01708984375, 0.02392578125, -0.0086669921875, 0.0032958984375, 0.006927490234375, -0.00116729736328125, -0.01068115234375, -0....

[ 247, 116, 39425, 68163, 22027, 18, 59226, 442, 15400, 83, 5117, 29806, 221, 236873, 538, 72803, 9468, 6305, 5120, 6661, 20625, 142508, 7464, 831, 3249, 10422, 26366, 144732, 1733, 66933, 12301, 4153, 8335, 481, 32354, 4358, 5045, 134234, 10...

[ 0.043853759765625, 0.1009521484375, 0.225341796875, 0.173828125, 0.024261474609375, 0.0902099609375, 0.1317138671875, 0.0245819091796875, 0.0928955078125, 0.03753662109375, 0.09765625, 0.1954345703125, 0.10638427734375, 0.1121826171875, 0.03948974609375, 0.247802734375, 0.17529296875...

embed

52932828_c0

52932828

haskell

0

Title: How do I avoid stackoverflow error in Haskell Problem title: How do I avoid stackoverflow error in Haskell Tags: functional-programming, haskell, stack-overflow Problem: How do I avoid stackoverflow error in Haskell I want to make this Function: calling customPower 2 2 would give back 2^2 + 2^1 + 1 calling custo...

How do I avoid stackoverflow error in Haskell How do I avoid stackoverflow error in Haskell functional-programming haskell stack-overflow How Haskell y-1 How do I avoid stackoverflow error in Haskell I want to make this Function: calling customPower 2 2 would give back 2^2 + 2^1 + 1 calling customPower 3 3 would give b...

[ -0.00506591796875, -0.0029449462890625, 0.0033416748046875, 0.0126953125, -0.0107421875, -0.00811767578125, -0.007171630859375, 0.00628662109375, 0.0050048828125, -0.022216796875, 0.021240234375, -0.01544189453125, -0.0057373046875, -0.00469970703125, 0.032470703125, 0.004547119140625,...

[ 11249, 71864, 177261, 5465, 118664, 18499, 23, 20625, 142508, 54, 87, 123309, 28966, 1556, 113, 5759, 3444, 28670, 10763, 159029, 114122, 105022, 116, 2806, 8337, 4420, 8353, 997, 106, 138, 363, 18151, 76199, 645, 131527, 7413, 171581, 37202,...

[ 0.04840087890625, 0.219482421875, 0.1671142578125, 0.1668701171875, 0.2445068359375, 0.194091796875, 0.031005859375, 0.1585693359375, 0.2509765625, 0.002532958984375, 0.00823974609375, 0.136474609375, 0.056732177734375, 0.13525390625, 0.0966796875, 0.12060546875, 0.0384521484375, 0...

embed

74706989_c0

74706989

haskell

0

Title: How to map a function over a tree in haskell? Problem title: How to map a function over a tree in haskell? Tags: tree, haskell, function Problem: How to map a function over a tree in haskell? data Tree a = Empty | Node a (Tree a) (Tree a) deriving (Show, Eq) mapTree :: (a -> b) -> Tree a -> Tree b maptree f Empt...

How to map a function over a tree in haskell? How to map a function over a tree in haskell? tree haskell function How Tree Empty Node Show How to map a function over a tree in haskell? This is the function I've written to try to map a function over a tree but it doesn't work as expected Why does my function return "Non...

[ -0.00653076171875, 0.006561279296875, 0.01080322265625, 0.0020751953125, 0.00164794921875, 0.00193023681640625, -0.008056640625, -0.0203857421875, -0.0106201171875, -0.0279541015625, 0.00762939453125, -0.0130615234375, -0.000579833984375, 0.0172119140625, 0.0146484375, 0.00279235839843...

[ 11249, 47, 22288, 32354, 645, 53201, 23, 1556, 142508, 101344, 31678, 939, 438, 112, 17367, 9790, 1284, 22027, 18, 4488, 237, 84751, 30646, 59881, 18391, 4935, 103510, 62731 ]

[ 0.0579833984375, 0.06378173828125, 0.1895751953125, 0.203369140625, 0.140380859375, 0.2247314453125, 0.032012939453125, 0.11376953125, 0.198486328125, 0.2196044921875, 0.14697265625, 0.107666015625, 0.114990234375, 0.11083984375, 0.0880126953125, 0.038360595703125, 0.003326416015625,...

embed

63509950_c0

63509950

haskell

0

Title: Is it possible to capture global keyboard events on macos with haskell? Problem title: Is it possible to capture global keyboard events on macos with haskell? Tags: macos, haskell Problem: Is it possible to capture global keyboard events on macos with haskell? Is there an API for haskell on macos that lets me ca...

Is it possible to capture global keyboard events on macos with haskell? Is it possible to capture global keyboard events on macos with haskell? macos haskell Is it possible to capture global keyboard events on macos with haskell? Is there an API for haskell on macos that lets me capture global keyboard events? All I fo...

[ 0.00112152099609375, 0.01275634765625, -0.0137939453125, -0.00848388671875, 0.006378173828125, 0.00182342529296875, 0.0174560546875, -0.003326416015625, -0.01495361328125, -0.03564453125, -0.00238037109375, -0.01806640625, -0.01226806640625, 0.00897216796875, -0.00616455078125, 0.00329...

[ 2071, 442, 7722, 47, 141621, 7964, 149186, 47353, 98, 291, 7840, 678, 1556, 142508, 61687, 100, 2633, 163, 14037, 1467, 62548, 58359, 43581, 38415, 33949, 12301, 2256, 17086, 3444, 1940, 19462, 3540, 7, 21135, 22799, 34695, 15549, 91084, 17...

[ 0.053253173828125, 0.04205322265625, 0.169921875, 0.04974365234375, 0.199462890625, 0.1934814453125, 0.254150390625, 0.1993408203125, 0.0950927734375, 0.116943359375, 0.197265625, 0.1151123046875, 0.16650390625, 0.268798828125, 0.1715087890625, 0.02685546875, 0.047393798828125, 0.0...

embed

22836320_c0

22836320

haskell

0

Title: Haskell Rewriting Min Class Problem title: Haskell Rewriting Min Class Tags: class, haskell, function Problem: Haskell Rewriting Min Class I'm quite new to Haskell and I'm writing a function that is similar to min instead of just accepting 2 values it'll accept 3. I've worked out the class as shown here: min3 ::...

Haskell Rewriting Min Class Haskell Rewriting Min Class class haskell function Haskell Rewriting Min min3 Haskell Rewriting Min Class I'm quite new to Haskell and I'm writing a function that is similar to min instead of just accepting 2 values it'll accept 3. I've worked out the class as shown here: However what would ...

[ -0.01336669921875, 0.0023956298828125, 0.0108642578125, -0.006256103515625, -0.0137939453125, 0.015869140625, 0.01263427734375, -0.0113525390625, 0.01348876953125, 0.0069580078125, -0.0177001953125, -0.038330078125, 0.021728515625, -0.00823974609375, -0.006378173828125, 0.0087280273437...

[ 20625, 142508, 853, 199332, 4211, 35014, 18507, 1556, 32354, 881, 363, 32233, 3525, 32562, 21373, 64457, 26946, 116, 142424, 1181, 1031, 79786, 1810, 70, 127887, 3688, 2367, 2806, 3884, 678, 68034, 7103, 3642, 5941, 107730, 77336, 31895, 1108...

[ 0.1326904296875, 0.2047119140625, 0.127685546875, 0.205322265625, 0.243408203125, 0.2279052734375, 0.1932373046875, 0.1287841796875, 0.19921875, 0.248046875, 0.1717529296875, 0.0394287109375, 0.052764892578125, 0.140625, 0.095458984375, 0.0645751953125, 0.15673828125, 0.08020019531...

embed

23927744_c0

23927744

haskell

0

Title: Where is libHSprimitive-0.5.3.0.so Problem title: Where is libHSprimitive-0.5.3.0.so Tags: haskell, mflow Problem: Where is libHSprimitive-0.5.3.0.so Trying to install MFlow on linux mint. sudo cabal install MFlow gives me this: Loading package primitive-0.5.3.0 ... : can't load .so/.DLL for: libHSprimitive-0.5....

Where is libHSprimitive-0.5.3.0.so Where is libHSprimitive-0.5.3.0.so haskell mflow Where libHSprimitive-0.5.3.0.so Where is libHSprimitive-0.5.3.0.so Trying to install MFlow on linux mint. sudo cabal install MFlow gives me this: Loading package primitive-0.5.3.0 ... : can't load .so/.DLL for: libHSprimitive-0.5.3.0.so...

[ 0.0015411376953125, 0.0181884765625, -0.01422119140625, -0.006866455078125, -0.003936767578125, 0.0072021484375, 0.0047607421875, -0.00128936767578125, -0.00099945068359375, -0.020751953125, 0.01409912109375, -0.042724609375, 0.00872802734375, -0.006988525390625, -0.0169677734375, 0.01...

[ 78662, 83, 25474, 38131, 58460, 4935, 93645, 5, 132265, 991, 1556, 142508, 347, 118664, 9, 40858, 20600, 99234, 17336, 11508, 6077, 4090, 166, 246, 109524, 228006, 98169, 128489, 13, 831, 18, 72367, 23708, 100, 5612, 53418, 9803, 99764, 367...

[ 0.1298828125, 0.06903076171875, 0.1317138671875, 0.1490478515625, 0.2071533203125, 0.209228515625, 0.2420654296875, 0.0190887451171875, 0.228515625, 0.18994140625, 0.1063232421875, 0.22607421875, 0.0828857421875, 0.2763671875, 0.022796630859375, 0.002777099609375, 0.12353515625, 0....

embed

28382932_c0

28382932

haskell

0

Title: Sorting tuples in haskell lists Problem title: Sorting tuples in haskell lists Tags: tuples, haskell, list Problem: Sorting tuples in haskell lists I'd like to sort a list of tuples by the third or fourth element (say c or d) in the list of type: myList = [(a,b,c,d,e)] I know if the tuple is of type (a,b) I can ...

Sorting tuples in haskell lists Sorting tuples in haskell lists tuples haskell list Sorting Ordering Sorting tuples in haskell lists I'd like to sort a list of tuples by the third or fourth element (say c or d) in the list of type: I know if the tuple is of type (a,b) I can use the following approach: But the type of s...

[ -0.005859375, 0.020751953125, -0.00118255615234375, 0.00135040283203125, -0.0045166015625, -0.01116943359375, -0.0179443359375, -0.004974365234375, 0.003509521484375, -0.01470947265625, -0.01251220703125, -0.00640869140625, 0.0006561279296875, -0.00933837890625, -0.01397705078125, -0.0...

[ 53666, 214, 370, 99726, 23, 1556, 142508, 5303, 81206, 1884, 47, 12096, 390, 50960, 22759, 927, 12830, 501, 104, 10644, 3714, 8705, 111, 11, 275, 25632, 51515, 75358, 959, 4488, 140909, 6626, 32562, 97841, 32354, 5675, 71, 1238 ]

[ 0.2059326171875, 0.05755615234375, 0.1527099609375, 0.2496337890625, 0.026519775390625, 0.13818359375, 0.2117919921875, 0.18798828125, 0.15478515625, 0.06146240234375, 0.006500244140625, 0.2266845703125, 0.059814453125, 0.1680908203125, 0.11962890625, 0.08984375, 0.1177978515625, 0...

embed

66350887_c0

66350887

haskell

0

Title: What is the meaning of comma separated names in brackets - as a binding? Problem title: What is the meaning of comma separated names in brackets - as a binding? Tags: haskell Problem: What is the meaning of comma separated names in brackets - as a binding? In a document ( https://riptutorial.com/Download/haskell...

What is the meaning of comma separated names in brackets - as a binding? What is the meaning of comma separated names in brackets - as a binding? haskell What Double What is the meaning of comma separated names in brackets - as a binding? In a document ( https://riptutorial.com/Download/haskell-language.pdf ), in Chapt...

[ -0.023681640625, -0.003326416015625, -0.0021514892578125, 0.01171875, 0.01318359375, 0.03173828125, 0.002166748046875, -0.01025390625, 0.007598876953125, 0.0281982421875, -0.005767822265625, -0.0169677734375, 0.0101318359375, -0.01025390625, -0.00116729736328125, 0.003082275390625, -...

[ 4865, 70, 91084, 96117, 84797, 71, 123055, 23, 1620, 27853, 7, 237, 128239, 1556, 142508, 107172, 83, 10, 77275, 144786, 10557, 196651, 1172, 15555, 190647, 27781, 125195, 7134, 46429, 4, 164917, 29459 ]

[ 0.06109619140625, 0.0215911865234375, 0.1954345703125, 0.23828125, 0.2091064453125, 0.0721435546875, 0.1832275390625, 0.0693359375, 0.1710205078125, 0.2042236328125, 0.00823974609375, 0.0870361328125, 0.2017822265625, 0.130859375, 0.2169189453125, 0.18994140625, 0.0294647216796875, ...

embed

13940377_c0

13940377

haskell

0

Title: Does tail recursion necessarily need an accumulator? Problem title: Does tail recursion necessarily need an accumulator? Tags: recursion, tail-recursion, haskell Problem: Does tail recursion necessarily need an accumulator? For instance, since the following function don't have an accumulator, is it still tail re...

Does tail recursion necessarily need an accumulator? Does tail recursion necessarily need an accumulator? recursion tail-recursion haskell Does Ord Bool h:t Does tail recursion necessarily need an accumulator? For instance, since the following function don't have an accumulator, is it still tail recursive? All the comp...

[ -0.0020599365234375, 0.029296875, 0.00946044921875, 0.022705078125, -0.004486083984375, 0.0113525390625, -0.013427734375, -0.0255126953125, -0.00049591064453125, -0.0130615234375, 0.041015625, -0.0194091796875, 0.01092529296875, 0.0157470703125, 0.024169921875, -0.00182342529296875, ...

[ 46741, 195625, 1830, 204988, 3871, 183278, 1290, 107, 48650, 1556, 142508, 101790, 35379, 2460, 929, 1096, 18, 142, 25632, 32354, 2301, 765, 7464, 5844, 181135, 9433, 8108, 11782, 129980, 35431, 90698 ]

[ 0.2384033203125, 0.19482421875, 0.0899658203125, 0.1217041015625, 0.1239013671875, 0.1939697265625, 0.1715087890625, 0.0304107666015625, 0.139892578125, 0.111083984375, 0.18896484375, 0.0067138671875, 0.1573486328125, 0.07427978515625, 0.1656494140625, 0.0188446044921875, 0.060302734...

embed

39645184_c0

39645184

haskell

0

Title: How is Haskell's seq used? Problem title: How is Haskell's seq used? Tags: haskell, strictness Problem: How is Haskell's seq used? So, Haskell seq function forces the evaluation of it's first argument and returns the second. Consequently it is an infix operator. If you want to force the evaluation of a...

How is Haskell's seq used? How is Haskell's seq used? haskell strictness How Haskell How is Haskell's seq used? So, Haskell seq function forces the evaluation of it's first argument and returns the second. Consequently it is an infix operator. If you want to force the evaluation of an expression, intuitively ...

[ 0.00897216796875, 0.0177001953125, 0.0263671875, 0.03515625, 0.030029296875, 0.014404296875, -0.0021514892578125, 0.01416015625, -0.0045166015625, -0.016845703125, 0.00170135498046875, -0.0025634765625, 0.0024261474609375, 0.0179443359375, -0.01373291015625, -0.0086669921875, -0.0018...

[ 11249, 83, 20625, 142508, 3768, 7, 40, 864, 11814, 1556, 81113, 7432, 25, 32354, 84616, 219836, 5117, 10750, 136, 30646, 17932, 142, 23, 55923, 39933, 3444, 37772, 125195, 100270, 6044, 60213, 220, 1294, 64457, 2174, 34292, 10, 15400, 876, ...

[ 0.1123046875, 0.0914306640625, 0.165283203125, 0.281982421875, 0.08526611328125, 0.066650390625, 0.1717529296875, 0.259033203125, 0.20068359375, 0.140869140625, 0.20263671875, 0.09039306640625, 0.033721923828125, 0.1739501953125, 0.1719970703125, 0.171142578125, 0.0556640625, 0.182...

embed

53210737_c0

53210737

haskell

0

Title: How get yesterday in Haskell? Current date - 1 day? Problem title: How get yesterday in Haskell? Current date - 1 day? Tags: haskell Problem: How get yesterday in Haskell? Current date - 1 day? How get yesterday in Haskell? For the current day - of course it works like this: date :: IO (Integer,Int,Int) -- :: (y...

How get yesterday in Haskell? Current date - 1 day? How get yesterday in Haskell? Current date - 1 day? haskell sysdba.routine How Haskell Current Integer How get yesterday in Haskell? Current date - 1 day? How get yesterday in Haskell? For the current day - of course it works like this: But for yesterday? Does that wo...

[ -0.0164794921875, -0.00121307373046875, 0.01220703125, 0.03515625, 0.01214599609375, -0.0018768310546875, -0.0035400390625, 0.003265380859375, -0.00836181640625, -0.047607421875, -0.015869140625, -0.005889892578125, -0.01043701171875, -0.0004100799560546875, -0.00124359130859375, -0.00...

[ 11249, 2046, 131101, 23, 20625, 142508, 114063, 5622, 106, 5155, 1556, 954, 54353, 14179, 10325, 44401, 1326, 43581, 43240, 1884, 903, 4966, 100, 450, 4488, 71337, 45962, 70059, 17106, 99247, 678 ]

[ 0.131591796875, 0.160888671875, 0.29248046875, 0.0816650390625, 0.150146484375, 0.263916015625, 0.21826171875, 0.1456298828125, 0.0958251953125, 0.1488037109375, 0.1243896484375, 0.0269317626953125, 0.1087646484375, 0.06463623046875, 0.08001708984375, 0.2060546875, 0.035888671875, ...

embed

22246317_c0

22246317

haskell

0

Title: If we should avoid foldl in Haskell, should we also avoid all helpers based on it? Problem title: If we should avoid foldl in Haskell, should we also avoid all helpers based on it? Tags: haskell, fold, performance Problem: If we should avoid foldl in Haskell, should we also avoid all helpers based on it? Given (...

If we should avoid foldl in Haskell, should we also avoid all helpers based on it? If we should avoid foldl in Haskell, should we also avoid all helpers based on it? haskell fold performance Haskell If we should avoid foldl in Haskell, should we also avoid all helpers based on it? Given (?) that foldl' is always prefer...

[ -0.011474609375, -0.0211181640625, 0.025146484375, -0.005859375, -0.0216064453125, 0.01904296875, -0.0228271484375, -0.023681640625, -0.00555419921875, -0.037841796875, 0.005340576171875, -0.0162353515625, -0.007568359375, 0.0020904541015625, 0.000827789306640625, 0.000392913818359375,...

[ 71864, 18344, 20469, 20625, 142508, 4358, 1314, 35509, 756, 1556, 42822, 23718, 5608, 442, 25, 11343, 12601, 2822, 38132, 2965, 4527, 98169, 93766, 51359, 127689 ]

[ 0.129638671875, 0.164306640625, 0.21337890625, 0.1063232421875, 0.2132568359375, 0.1654052734375, 0.1136474609375, 0.084716796875, 0.029449462890625, 0.0831298828125, 0.2076416015625, 0.1639404296875, 0.0059814453125, 0.0149383544921875, 0.034912109375, 0.06134033203125, 0.0806884765...

embed

48552715_c0

48552715

haskell

0

Title: "typeclass-constrained type variable when beta reducing" use case Problem title: "typeclass-constrained type variable when beta reducing" use case Tags: haskell Problem: "typeclass-constrained type variable when beta reducing" use case I'm learning Haskell and there is a logic I don't underst...

"typeclass-constrained type variable when beta reducing" use case "typeclass-constrained type variable when beta reducing" use case haskell Prelude Ord Num "typeclass-constrained type variable when beta reducing" use case I'm learning Haskell and there is a logic I don't understand when we reduce th...

[ 0.009521484375, -0.0245361328125, 0.0101318359375, 0.0159912109375, 0.01904296875, -0.0064697265625, -0.0174560546875, 0.00122833251953125, 0.00390625, -0.00185394287109375, -0.01226806640625, -0.045166015625, 0.01397705078125, -0.00360107421875, 0, -0.0233154296875, -0.0104370117187...

[ 50986, 67413, 2271, 9297, 122009, 10644, 77336, 51703, 241866, 4527, 7225, 3229, 1556, 142508, 1914, 822, 35379, 52782, 20625, 83, 62775, 28219, 34390, 125195, 15400, 158, 84751, 1286 ]

[ 0.162841796875, 0.2144775390625, 0.06982421875, 0.14990234375, 0.0732421875, 0.1630859375, 0.2027587890625, 0.1759033203125, 0.1981201171875, 0.06036376953125, 0.1063232421875, 0.026641845703125, 0.08056640625, 0.168212890625, 0.0161590576171875, 0.0845947265625, 0.1259765625, 0.18...

embed

8959226_c0

8959226

haskell

0

Title: Constructing IOVector from Storable MVector Problem title: Constructing IOVector from Storable MVector Tags: haskell, vector Problem: Constructing IOVector from Storable MVector How do you build IOVector from MVector ? IOVector is documented as: type IOVector = MVector RealWorld I have a MVector like below, and ...

Constructing IOVector from Storable MVector Constructing IOVector from Storable MVector haskell vector Storable Constructing IOVector MVector RealWorld MSV.replicate PrimState CShort Constructing IOVector from Storable MVector How do you build IOVector from MVector ? IOVector is documented as: I have a MVector like bel...

[ -0.01336669921875, 0.0244140625, -0.0198974609375, -0.0001220703125, 0.0155029296875, 0.0213623046875, -0.0341796875, -0.000949859619140625, -0.0169677734375, -0.02001953125, 0.016845703125, -0.0380859375, 0.0294189453125, -0.001983642578125, -0.0006103515625, -0.00023555755615234375, ...

[ 1657, 36716, 214, 87, 31719, 13, 18770, 1295, 23604, 2886, 66160, 1556, 142508, 173, 5120, 70646, 276, 43486, 52721, 44506, 135206, 5922, 11249, 54, 398, 45367, 705, 83, 12937, 237, 765, 1884, 35064, 1221, 64549, 107730, 5, 309, 115840, 1...

[ 0.0716552734375, 0.1424560546875, 0.0440673828125, 0.236572265625, 0.239501953125, 0.22265625, 0.291748046875, 0.15771484375, 0.1829833984375, 0.192138671875, 0.2003173828125, 0.109619140625, 0.200927734375, 0.197509765625, 0.1015625, 0.09649658203125, 0.1231689453125, 0.2993164062...

embed

31439991_c1

31439991

haskell

1

" .= object ["tel" .= tel]] ... let reply3 = AttachMsg3 attach BL.putStrLn (encode reply3) and got the answer I wanted: {"attach":{"tel":"+447890"}} . @bheklilr is there a way to use Attach's (already defined) serialisation, instead of defining it again? I've tried some nonsense syntax, but understandably it doesn't co...

[ -0.0047607421875, -0.0036468505859375, 0.00927734375, -0.00848388671875, -0.01220703125, -0.0157470703125, -0.016845703125, 0.0245361328125, 0.00860595703125, -0.0267333984375, -0.0062255859375, -0.00958251953125, 0.0223388671875, 0.0106201171875, 0.008056640625, 0.0264892578125, -0....

[ 1369, 36746, 1708, 8131, 2633, 75836, 363, 9208, 934, 594, 7, 177, 243, 68170, 7077, 71713, 866, 19, 33, 40899, 21320, 35166, 36663, 257, 52438, 130262, 157376, 5039, 2685, 3917, 4527, 1283, 61924, 35686, 15032, 64457, 13204, 449, 442, 13...

[ 0.05712890625, 0.1951904296875, 0.142333984375, 0.1304931640625, 0.02349853515625, 0.180908203125, 0.1412353515625, 0.2164306640625, 0.272216796875, 0.010955810546875, 0.047760009765625, 0.04132080078125, 0.14599609375, 0.0867919921875, 0.1068115234375, 0.094482421875, 0.02099609375,...

embed