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
59335289_c0	59335289	haskell	0	Title: How Lambda function works in Haskell Problem title: How Lambda function works in Haskell Tags: functional-programming, foldleft, haskell, fold, lambda Problem: How Lambda function works in Haskell I am new to Haskell, while working on small programs I found little confusions about functioning of lambda functions...	How Lambda function works in Haskell How Lambda function works in Haskell functional-programming foldleft haskell fold lambda How Lambda Haskell Bool How Lambda function works in Haskell I am new to Haskell, while working on small programs I found little confusions about functioning of lambda functions. Executing lastT...	[ 0.0025634765625, 0.0032806396484375, 0.00933837890625, -0.00946044921875, 0.0032958984375, 0.00982666015625, 0.00191497802734375, 0.009033203125, -0.001434326171875, -0.0269775390625, 0.0081787109375, -0.032470703125, -0.01263427734375, 0.003753662109375, 0.0152587890625, -0.0263671875...	[ 11249, 122930, 85, 32354, 43240, 23, 20625, 142508, 123309, 28966, 18344, 19298, 2480, 1556, 42822, 21, 6492, 2460, 929, 3525, 20697, 19336, 103391, 169463, 214, 211603, 4568, 115743, 2740, 77495, 805, 5759, 80389, 166590, 9193, 4163, 25632, ...	[ 0.12109375, 0.2080078125, 0.2139892578125, 0.2000732421875, 0.179931640625, 0.08172607421875, 0.13623046875, 0.255615234375, 0.145751953125, 0.10791015625, 0.09088134765625, 0.06396484375, 0.1680908203125, 0.126220703125, 0.1416015625, 0.05084228515625, 0.1939697265625, 0.090026855...	embed
10264044_c0	10264044	haskell	0	Title: Output Integer to stdout in Haskell Problem title: Output Integer to stdout in Haskell Tags: haskell, io Problem: Output Integer to stdout in Haskell I have a simple function like: nth :: Integer -> Integer And I try to print it's result as follows: main = do n <- getLine result <- nth (read n :: Integer) print ...	Output Integer to stdout in Haskell Output Integer to stdout in Haskell haskell io Output Integer Haskell Couldn Output Integer to stdout in Haskell I have a simple function like: And I try to print it's result as follows: The following error is generated: Also tried with putStrLn and a lot of other combinations with n...	[ -0.0216064453125, -0.0181884765625, 0.0081787109375, -0.0020904541015625, 0.006378173828125, 0.01483154296875, 0.009521484375, -0.0228271484375, -0.00457763671875, -0.03271484375, 0.00070953369140625, -0.04345703125, -0.0037994384765625, 0.0019989013671875, -0.00098419189453125, -0.013...	[ 13538, 7077, 44401, 47, 6138, 246, 1003, 23, 20625, 142508, 1556, 22995, 191147, 19, 8781, 32354, 1884, 9790, 28412, 16750, 28960, 25632, 18499, 139392, 37842, 3884, 71713, 866, 5915, 162515, 110, 84434, 26366, 4358, 28219, 41884, 43240, 1093...	[ 0.1781005859375, 0.1048583984375, 0.264892578125, 0.146728515625, 0.17578125, 0.113037109375, 0.2412109375, 0.06707763671875, 0.1578369140625, 0.2607421875, 0.151611328125, 0.179443359375, 0.12451171875, 0.06982421875, 0.0762939453125, 0.146728515625, 0.004730224609375, 0.056549072...	embed
1798996_c1	1798996	haskell	1	8 s ./fibs +RTS -N6 -> avg= 0.055703 s, deviation = 0.006537 s ./fibs +RTS -N7 -> avg= 0.058327 s, deviation = 0.007526 s My questions are: What exactly is happening when I evaluate: a `par` (b `pseq` (a + b)) ? I understand that a par b is supposed to hint the compiler about calculating a in parallel with b and return...	8 s ./fibs +RTS -N6 -> avg= 0.055703 s, deviation = 0.006537 s ./fibs +RTS -N7 -> avg= 0.058327 s, deviation = 0.007526 s My questions are: What exactly is happening when I evaluate: a `par` (b `pseq` (a + b)) ? I understand that a par b is supposed to hint the compiler about calculating a in parallel with b and return...	[ -0.00170135498046875, 0.01153564453125, 0.0023956298828125, 0.008544921875, 0.0002689361572265625, 0.00445556640625, 0.00408935546875, -0.01190185546875, -0.0106201171875, -0.03857421875, 0.00799560546875, 0.0218505859375, 0.01214599609375, 0.0196533203125, 0.00628662109375, -0.0181884...	[ 382, 91, 1029, 16145, 997, 20503, 294, 20, 839, 910, 185, 177, 1369, 89678, 159595, 9513, 30170, 2320, 179973, 966, 10057, 3768, 37509, 6873, 4046, 17582, 4865, 66161, 123087, 3229, 87, 151575, 2500, 275, 45616, 864, 876, 28219, 366, 1345...	[ 0.1278076171875, 0.1373291015625, 0.1051025390625, 0.1217041015625, 0.1846923828125, 0.09783935546875, 0.0986328125, 0.0146942138671875, 0.06085205078125, 0.1572265625, 0.142578125, 0.07196044921875, 0.00775146484375, 0.0521240234375, 0.098876953125, 0.050689697265625, 0.179321289062...	embed
41276454_c1	41276454	haskell	1	union and find etc. The actual implementation of these differ depending on whether the user knows their size at creation time or whether they need to dynamically grow, hence the type class. However once these data types are created they can be roughly treated the same. All this occurs in monad code, generally ST or IO...	union and find etc. The actual implementation of these differ depending on whether the user knows their size at creation time or whether they need to dynamically grow, hence the type class. However once these data types are created they can be roughly treated the same. All this occurs in monad code, generally ST or IO...	[ 0.00145721435546875, 0.011962890625, 0.0111083984375, -0.0009307861328125, 0.024169921875, -0.0233154296875, 0.003173828125, -0.00750732421875, -0.0059814453125, 0.0023193359375, -0.0004062652587890625, -0.0194091796875, -0.017333984375, 0.01513671875, 0.00150299072265625, 0.0140380859...	[ 69941, 136, 7413, 3021, 8561, 208124, 6097, 129927, 96819, 38937, 93002, 13267, 166635, 84079, 55993, 10644, 18507, 33306, 24145, 2053, 52895, 75935, 831, 166904, 191607, 5701, 74918, 2667, 712, 18151, 137567, 16992, 707, 6, 17780, 121392, 2393...	[ 0.24658203125, 0.07275390625, 0.2044677734375, 0.0204925537109375, 0.1212158203125, 0.1773681640625, 0.0343017578125, 0.17626953125, 0.0499267578125, 0.1182861328125, 0.0787353515625, 0.07586669921875, 0.101318359375, 0.0638427734375, 0.09814453125, 0.279052734375, 0.2335205078125, ...	embed
27964604_c0	27964604	haskell	0	Title: Lenses and prisms with sum types Problem title: Lenses and prisms with sum types Tags: haskell, haskell-lens Problem: Lenses and prisms with sum types This code won't compile. {-# LANGUAGE TemplateHaskell #-} import Control.Lens data A = A { _a1 :: B, _a2 :: Int } makeLenses ''A data B = B1 { _b1 :: Int } \| B2 m...	Lenses and prisms with sum types Lenses and prisms with sum types haskell haskell-lens Control.Lens Lenses LANGUAGE TemplateHaskell _a1 _a2 _b1 amy.hs:5:21 Not Lenses and prisms with sum types This code won't compile. The error is amy.hs:5:21: Not in scope: type constructor or class ‘B’ . I have two questions. Is there...	[ -0.0157470703125, 0.01226806640625, 0.00018405914306640625, 0.0205078125, -0.01336669921875, 0.01507568359375, -0.020263671875, -0.01055908203125, -0.00482177734375, -0.031005859375, 0.0186767578125, 0.035400390625, 0.01397705078125, -0.0159912109375, 0.0069580078125, 0.01104736328125,...	[ 339, 47754, 136, 4067, 4432, 678, 10554, 52895, 1556, 142508, 1977, 27131, 866, 1755, 98064, 196631, 6495, 7, 11, 418, 304, 275, 10, 1176, 127, 758, 25619, 11205, 3293, 18151, 23742, 18, 9969, 1340, 18499, 70820, 10644, 64549, 748, 707, ...	[ 0.152099609375, 0.1717529296875, 0.114990234375, 0.178955078125, 0.1236572265625, 0.0948486328125, 0.1982421875, 0.2113037109375, 0.1256103515625, 0.2161865234375, 0.132080078125, 0.1507568359375, 0.1033935546875, 0.13671875, 0.0811767578125, 0.162353515625, 0.0810546875, 0.0466613...	embed
47734825_c1	47734825	haskell	1	If I add an extra argument to f that pushes the choice of f outside the inner forall , then the program typechecks: f :: forall f a. f a -> (forall k. (F k ~ B f) => f k) -> A f _ _ = undefined g :: forall a. X a -> (forall k. (F k ~ B X) => X k) -> A g = f However, what specifically has me so confused in this particu...	If I add an extra argument to f that pushes the choice of f outside the inner forall , then the program typechecks: f :: forall f a. f a -> (forall k. (F k ~ B f) => f k) -> A f _ _ = undefined g :: forall a. X a -> (forall k. (F k ~ B X) => X k) -> A g = f However, what specifically has me so confused in this particu...	[ 0.0216064453125, -0.0027618408203125, -0.019775390625, -0.0084228515625, -0.0198974609375, -0.0023040771484375, -0.0140380859375, -0.00060272216796875, 0.00982666015625, 0.0240478515625, 0.00738525390625, -0.03515625, 0.00811767578125, 0.0120849609375, 0.00970458984375, -0.028686523437...	[ 15190, 4173, 10750, 1238, 25944, 44126, 50782, 75414, 100, 5584, 1528, 10644, 78292, 1984, 10, 33079, 2472, 472, 919, 335, 62, 9232, 5983, 706, 1193, 2203, 183037, 55681, 27781, 15400, 123309, 42548, 27771, 12921, 123166, 49782, 63043, 117538...	[ 0.0723876953125, 0.09991455078125, 0.2138671875, 0.144287109375, 0.1275634765625, 0.12255859375, 0.128662109375, 0.1336669921875, 0.058685302734375, 0.14697265625, 0.138427734375, 0.15869140625, 0.228271484375, 0.025787353515625, 0.030914306640625, 0.010711669921875, 0.03488159179687...	embed
76610110_c0	76610110	haskell	0	Title: Haskell Freestate evaluate to State Problem title: Haskell Freestate evaluate to State Tags: state, haskell Problem: Haskell Freestate evaluate to State I have a datatype called FreeState; data FreeState s a = Get (s -> FreeState s a) \| Put s (FreeState s a) \| Return a Now I need to evaluate this FreeState to a ...	Haskell Freestate evaluate to State Haskell Freestate evaluate to State state haskell Haskell Freestate State Get Put Haskell Freestate evaluate to State I have a datatype called FreeState; Now I need to evaluate this FreeState to a State; I do not think I understand States enough to do this. Can someone enlighten me, ...	[ 0.002899169921875, 0.0103759765625, -0.003021240234375, 0.002685546875, 0.00160980224609375, 0.00396728515625, -0.01171875, -0.004302978515625, 0.000385284423828125, 0.0030364990234375, 0.004913330078125, 0.01556396484375, 0.008544921875, 0.022216796875, -0.0196533203125, -0.0129394531...	[ 20625, 142508, 5153, 61340, 151575, 13, 47, 22836, 11341, 1556, 20779, 19577, 2053, 50986, 135206, 14240, 3871, 959, 5351, 28219, 46684, 20174, 4171, 22008, 20016, 33, 15673, 11522, 765, 5036, 154559, 903, 26785 ]	[ 0.1419677734375, 0.2288818359375, 0.1580810546875, 0.251953125, 0.170166015625, 0.1138916015625, 0.0963134765625, 0.2188720703125, 0.1199951171875, 0.130126953125, 0.039215087890625, 0.09381103515625, 0.0870361328125, 0.220458984375, 0.2275390625, 0.000335693359375, 0.07763671875, ...	embed
60336958_c0	60336958	haskell	0	Title: Can i get a record while pattern matching on its contents? Problem title: Can i get a record while pattern matching on its contents? Tags: haskell, record Problem: Can i get a record while pattern matching on its contents? Basically, i want to pattern match on the contents of a record, and then return a modifica...	Can i get a record while pattern matching on its contents? Can i get a record while pattern matching on its contents? haskell record Can Database Can i get a record while pattern matching on its contents? Basically, i want to pattern match on the contents of a record, and then return a modification of said record. So i...	[ -0.0223388671875, 0.005401611328125, 0.00811767578125, 0.0045166015625, 0.01239013671875, 0.01116943359375, -0.0220947265625, -0.0128173828125, 0.02001953125, -0.0087890625, 0.0211181640625, 0.00439453125, -0.00836181640625, -0.00970458984375, 0.010009765625, -0.01446533203125, 0.007...	[ 4171, 17, 2046, 17164, 12960, 103510, 14858, 214, 98, 10941, 7, 10, 6863, 1556, 142508, 187781, 3444, 47, 30646, 129344, 16648, 5915, 6626, 10750, 5608, 11343, 186, 5701, 3917, 4734, 452, 24145 ]	[ 0.1068115234375, 0.072021484375, 0.1090087890625, 0.228271484375, 0.13427734375, 0.235595703125, 0.2109375, 0.1068115234375, 0.04205322265625, 0.12548828125, 0.00457763671875, 0.029571533203125, 0.0166015625, 0.1138916015625, 0.1971435546875, 0.208251953125, 0.060546875, 0.01533508...	embed
33944276_c0	33944276	haskell	0	Title: how to get path from root to desired node i.e. includes first number as rooth then child -> child->upto parent of child Problem title: how to get path from root to desired node i.e. includes first number as rooth then child -> child->upto parent of child Tags: tree, haskell Problem: how to get path f...	how to get path from root to desired node i.e. includes first number as rooth then child -> child->upto parent of child how to get path from root to desired node i.e. includes first number as rooth then child -> child->upto parent of child tree haskell root i.e Tree Show ls:xs how to get path from root to d...	[ 0.01165771484375, 0.032958984375, -0.00994873046875, -0.01226806640625, 0.0002460479736328125, 0.021484375, 0.00104522705078125, -0.027587890625, 0.00933837890625, -0.06396484375, 0.00372314453125, 0.00018787384033203125, 0.006378173828125, 0.0263671875, -0.00128173828125, -0.002487182...	[ 3642, 47, 2046, 60875, 1295, 74855, 104851, 71, 110, 112, 96853, 5117, 14012, 127, 29041, 5386, 2037, 188, 49129, 111, 237, 53201, 1556, 142508, 101344, 17367, 425, 7, 33079, 37170, 100, 483, 5608, 30646, 882, 96386, 82230, 22027, 18, 323...	[ 0.07373046875, 0.1673583984375, 0.112548828125, 0.2227783203125, 0.138671875, 0.219970703125, 0.1614990234375, 0.07220458984375, 0.120849609375, 0.140625, 0.07763671875, 0.0885009765625, 0.15771484375, 0.149658203125, 0.1207275390625, 0.03924560546875, 0.0799560546875, 0.1652832031...	embed
42317607_c0	42317607	haskell	0	Title: Poor mans concurrency, understanding the monad instance? Problem title: Poor mans concurrency, understanding the monad instance? Tags: haskell, continuations, monads Problem: Poor mans concurrency, understanding the monad instance? I'm running through this guide to implementing concurrency and I'm having trouble...	Poor mans concurrency, understanding the monad instance? Poor mans concurrency, understanding the monad instance? haskell continuations monads Poor Action Atom Fork Stop Monad Poor mans concurrency, understanding the monad instance? I'm running through this guide to implementing concurrency and I'm having trouble under...	[ -0.01300048828125, 0.0026397705078125, 0.023681640625, -0.00099945068359375, 0.0125732421875, 0.00860595703125, 0.01019287109375, -0.00341796875, 0.0126953125, -0.02099609375, -0.01068115234375, -0.013671875, -0.01385498046875, 0.0034637451171875, 0.01806640625, -0.001434326171875, -...	[ 167626, 36679, 108636, 982, 2408, 100094, 2667, 712, 110527, 1556, 142508, 9454, 5256, 57945, 69728, 1326, 92, 42284, 60331, 71, 17997, 29479, 63134, 28219, 20531, 4527, 1363, 7, 237875, 32380, 94266, 21635 ]	[ 0.1934814453125, 0.12646484375, 0.1597900390625, 0.1314697265625, 0.06134033203125, 0.129638671875, 0.1087646484375, 0.154052734375, 0.1729736328125, 0.08642578125, 0.1917724609375, 0.130859375, 0.0093994140625, 0.1142578125, 0.122314453125, 0.0845947265625, 0.034149169921875, 0.12...	embed
54288280_c0	54288280	haskell	0	Title: How to fix writing a list content in a file Problem title: How to fix writing a list content in a file Tags: haskell Problem: How to fix writing a list content in a file I have a function which contains a list. I want just to write that list content in a file from main after user input. putTodo :: (Int, String) ...	How to fix writing a list content in a file How to fix writing a list content in a file haskell How mapM_ agenda.txt WriteMode How to fix writing a list content in a file I have a function which contains a list. I want just to write that list content in a file from main after user input. What I tried: Thank you.	[ -0.0206298828125, -0.0010833740234375, -0.00433349609375, 0.002777099609375, -0.010009765625, -0.003265380859375, 0.00052642822265625, 0.00909423828125, 0.00457763671875, 0.0140380859375, -0.007049560546875, -0.0185546875, 0.0169677734375, 0.037841796875, 0.0091552734375, -0.0099487304...	[ 11249, 47, 30022, 32562, 10, 5303, 10941, 23, 11435, 1556, 142508, 22288, 594, 29361, 124326, 601, 18781, 9083, 32354, 70541, 3444, 1660, 33022, 450, 1295, 5201, 7103, 38937, 107730, 37842 ]	[ 0.047454833984375, 0.03875732421875, 0.205078125, 0.2210693359375, 0.07220458984375, 0.2362060546875, 0.2264404296875, 0.0709228515625, 0.1875, 0.1348876953125, 0.20947265625, 0.11016845703125, 0.07513427734375, 0.22119140625, 0.157470703125, 0.023712158203125, 0.0615234375, 0.1416...	embed
56405751_c3	56405751	haskell	3	0.3.3-Ie3MD7O3orK6ZR8i7FuBEv, aeson-1.3.1.1-7JlrwYHW7OR9ca4RRZ9oOf, ansi-wl-pprint-0.6.8.2-9fh9v74MJQDJeSHE7X3Co6, async-2.2.1-7DQr5PBcpiwJNOuf7ZiSPa, base-4.11.1.0, base16-bytestring, base16-bytestring-0.1.1.6-I0igvRcEwRNBMqqPC2yQBh, base64-bytestring, base64-bytestring-1.0.0.1-4OCIe2BZn8jKI191JIXI37, binary-0.8.5.1, ...	fJgKGHBhOb vty-5.21-A2OCwk39Wv3J3RjR3BvHey witherable-0.2-2RYbFmOnVolGAqiDDS1CLe Shows Missing library : ff while building echidna using stack install I am trying to build echidna using stack install . https://github.com/crytic/echidna I am continuously getting the missing library error while installing at a progress s...	[ -0.01904296875, -0.031494140625, 0.00543212890625, 0.01165771484375, -0.0185546875, -0.006561279296875, 0.000720977783203125, 0.01287841796875, 0.0262451171875, 0.0284423828125, 0.01080322265625, -0.01470947265625, -0.00653076171875, -0.003082275390625, -0.01068115234375, 0.00469970703...	[ 41877, 46471, 81, 939, 10342, 3117, 133747, 678, 56, 2886, 133684, 73668, 17367, 16771, 214, 35773, 1294, 26472, 12960, 33976, 28, 1861, 39200, 17368, 177261, 20600, 31577, 45367, 15769, 32102, 9523, 7101, 532, 76, 19686, 132283, 18499, 42658...	[ 0.0171661376953125, 0.0845947265625, 0.0728759765625, 0.1512451171875, 0.006072998046875, 0.061492919921875, 0.1309814453125, 0.1099853515625, 0.0821533203125, 0.150634765625, 0.1453857421875, 0.0159149169921875, 0.0192718505859375, 0.11865234375, 0.05853271484375, 0.2366943359375, 0...	embed
58948248_c2	58948248	haskell	2	in-XPS-13-9360:~$ cabal info tidal * tidal (library) Synopsis: Pattern language for improvised music Versions available: 0.8.2, 0.9.9, 0.9.10, 1.2.1, 1.3.0, 1.4.1, 1.4.2, 1.4.3, 1.4.4 (and 99 others) Code signals: the, hackage.haskell.org, /home/justin/.ghc/x86_64-linux-8.6.5/environments/default, Haskell, Tidal, justi...	in-XPS-13-9360:~$ cabal info tidal * tidal (library) Synopsis: Pattern language for improvised music Versions available: 0.8.2, 0.9.9, 0.9.10, 1.2.1, 1.3.0, 1.4.1, 1.4.2, 1.4.3, 1.4.4 (and 99 others) Code signals: the, hackage.haskell.org, /home/justin/.ghc/x86_64-linux-8.6.5/environments/default, Haskell, Tidal, justi...	[ 0.0146484375, 0.000637054443359375, 0.01336669921875, 0.00970458984375, -0.002410888671875, 0.0074462890625, -0.007781982421875, 0.017822265625, 0.004425048828125, -0.01708984375, 0.00125885009765625, -0.038330078125, -0.01116943359375, 0.00439453125, 0.00640869140625, 0.00135040283203...	[ 23, 1542, 9059, 22820, 15205, 38230, 12, 2306, 4369, 109524, 3004, 2936, 289, 661, 150, 2844, 1294, 16, 19010, 31, 74988, 9876, 22766, 46876, 100, 128659, 52021, 19612, 40647, 19882, 757, 5, 128423, 176652, 143161, 963, 615, 68107, 132265, ...	[ 0.193359375, 0.1234130859375, 0.2286376953125, 0.210205078125, 0.1483154296875, 0.25048828125, 0.0245208740234375, 0.0806884765625, 0.1380615234375, 0.263427734375, 0.1614990234375, 0.2357177734375, 0.265625, 0.053863525390625, 0.084716796875, 0.139892578125, 0.0330810546875, 0.007...	embed
33767830_c3	33767830	haskell	3	Compilation, System, package.conf.d, Cabal-1.14.0, GLUT-2.1.2.2, HTTP-4000.2.3, HUnit-1.2.4.2, MonadCatchIO-mtl-0.3.0.4, OpenGL-2.2.3.1, QuickCheck-2.4.2, array-0.4.0.0, base-4.5.0.0, bin-package-db-0.0.0.0, binary-0.5.1.0, bytestring-0.9.2.1, cgi-3001.1.8.2, containers-0.4.2.1, deepseq-1.3.0.0, directory-1.1.0.2, ext...	Compilation, System, package.conf.d, Cabal-1.14.0, GLUT-2.1.2.2, HTTP-4000.2.3, HUnit-1.2.4.2, MonadCatchIO-mtl-0.3.0.4, OpenGL-2.2.3.1, QuickCheck-2.4.2, array-0.4.0.0, base-4.5.0.0, bin-package-db-0.0.0.0, binary-0.5.1.0, bytestring-0.9.2.1, cgi-3001.1.8.2, containers-0.4.2.1, deepseq-1.3.0.0, directory-1.1.0.2, ext...	[ -0.017822265625, -0.0069580078125, 0.009033203125, -0.004486083984375, 0.004638671875, -0.00011205673217773438, -0.0296630859375, -0.00127410888671875, -0.015625, 0.03515625, -0.0201416015625, -0.0191650390625, -0.0145263671875, -0.00823974609375, 0.006134033203125, -0.006988525390625,...	[ 15612, 14, 57860, 4, 12353, 98169, 5, 70547, 71, 30438, 289, 9, 92134, 151152, 527, 143662, 68107, 70147, 135913, 68037, 120883, 22438, 6773, 48400, 117904, 60331, 76775, 206, 17780, 141, 170179, 121254, 13527, 78703, 97109, 89038, 202567, 54...	[ 0.17919921875, 0.16845703125, 0.1690673828125, 0.13818359375, 0.206298828125, 0.265625, 0.10205078125, 0.2110595703125, 0.0869140625, 0.166748046875, 0.1776123046875, 0.1553955078125, 0.14453125, 0.2227783203125, 0.03582763671875, 0.244873046875, 0.1466064453125, 0.17041015625, 0...	embed
36962221_c0	36962221	haskell	0	Title: Haskell and multiple conditions Problem title: Haskell and multiple conditions Tags: conditional-statements, haskell, if-statement Problem: Haskell and multiple conditions If I have multiple conditions that are only slightly different, what is the best way to write a function (considering and inability to nest g...	Haskell and multiple conditions Haskell and multiple conditions conditional-statements haskell if-statement Haskell Haskell and multiple conditions If I have multiple conditions that are only slightly different, what is the best way to write a function (considering and inability to nest guards) of the form: etc Imagine...	[ -0.00543212890625, 0.006317138671875, -0.009033203125, 0.0111083984375, 0.006591796875, 0.0126953125, -0.01080322265625, -0.019287109375, 0.002197265625, 0.0157470703125, -0.00518798828125, -0.0157470703125, 0.004669189453125, 0.01507568359375, 0.0076904296875, 0.01458740234375, 0.01...	[ 20625, 142508, 136, 48716, 27289, 35431, 289, 61340, 1556, 2174, 765, 621, 4734, 161549, 12921, 2965, 3917, 33022, 32354, 212065, 23, 41159, 47, 91280, 56050, 3173, 133196, 5915, 1286, 41143, 1884, 8512, 71, 12765, 876, 959, 7722, 27781, 51...	[ 0.1395263671875, 0.2344970703125, 0.05072021484375, 0.20849609375, 0.261962890625, 0.1856689453125, 0.068115234375, 0.1522216796875, 0.14013671875, 0.1287841796875, 0.015899658203125, 0.0306396484375, 0.05902099609375, 0.1336669921875, 0.1966552734375, 0.0986328125, 0.05108642578125,...	embed
23832790_c0	23832790	haskell	0	Title: Debugging huffman decoding Problem title: Debugging huffman decoding Tags: haskell, decoding, huffman-code, tree Problem: Debugging huffman decoding While I was debugging my huffman decoding function decode :: (Tree a, [Bit]) -> [a] decode (tree, list) = case list of [] -> case tree of Leaf pos a -> replicate_Po...	Debugging huffman decoding Debugging huffman decoding haskell decoding huffman-code tree Debugging Tree Bit Leaf replicate_Pos num_only follow_bit_path_to_one_value huffman_decode list_only Debugging huffman decoding While I was debugging my huffman decoding function it comes up with a parse error on input "where"? Whe...	[ 0.006378173828125, 0.00787353515625, -0.0177001953125, 0.016845703125, 0.01611328125, 0.016845703125, -0.0286865234375, -0.0162353515625, 0.01043701171875, 0.01324462890625, -0.021240234375, -0.041748046875, 0.0216064453125, 0.0146484375, -0.007293701171875, -0.00421142578125, 0.0117...	[ 262, 978, 36659, 1096, 21493, 669, 8, 587, 1556, 142508, 40899, 53201, 101344, 27774, 636, 2407, 143126, 7192, 13269, 191, 28960, 3137, 128405, 188, 3630, 27494, 13, 112, 5303, 6238, 32354, 32497, 366, 184, 18499, 98, 107730, 136913, 78662,...	[ 0.1219482421875, 0.1943359375, 0.0740966796875, 0.0794677734375, 0.2137451171875, 0.1683349609375, 0.13427734375, 0.1495361328125, 0.091064453125, 0.1910400390625, 0.189208984375, 0.1365966796875, 0.137939453125, 0.095703125, 0.043212890625, 0.1224365234375, 0.154296875, 0.08361816...	embed
26327053_c0	26327053	haskell	0	Title: Specifying multiple alternatives in a single pattern match? Problem title: Specifying multiple alternatives in a single pattern match? Tags: haskell, pattern-matching Problem: Specifying multiple alternatives in a single pattern match? Take the following function as an example (the function is quite meaningless ...	Specifying multiple alternatives in a single pattern match? Specifying multiple alternatives in a single pattern match? haskell pattern-matching Specifying _:xs Specifying multiple alternatives in a single pattern match? Take the following function as an example (the function is quite meaningless but at least illustrat...	[ -0.0038604736328125, 0.0003910064697265625, 0.0074462890625, 0.0035247802734375, -0.0224609375, -0.01190185546875, -0.004730224609375, -0.01373291015625, 0.0419921875, 0.004669189453125, 0.025634765625, -0.012939453125, 0.019287109375, 0.0024261474609375, -0.0142822265625, 0.0079345703...	[ 24990, 151138, 48716, 30700, 23, 11001, 103510, 14858, 7, 1556, 142508, 98753, 214, 101, 12, 425, 25632, 32354, 27781, 32233, 91084, 9393, 58755, 759, 97249, 10763, 378, 136, 1022, 27489, 5701, 16750, 7722, 70163, 6097, 3934, 43257, 32562, ...	[ 0.1651611328125, 0.13525390625, 0.218505859375, 0.228271484375, 0.0330810546875, 0.19775390625, 0.2249755859375, 0.2197265625, 0.05859375, 0.1207275390625, 0.20263671875, 0.2464599609375, 0.02020263671875, 0.030487060546875, 0.034912109375, 0.114990234375, 0.047882080078125, 0.1181...	embed
40734253_c0	40734253	haskell	0	Title: Making "trace" optimise away like "assert"? Problem title: Making "trace" optimise away like "assert"? Tags: ghc, debugging, haskell Problem: Making "trace" optimise away like "assert"? GHC rewrites assert s when optimising as just id . Or alternatively, it's behaviour can...	Making "trace" optimise away like "assert"? Making "trace" optimise away like "assert"? ghc debugging haskell Making Making "trace" optimise away like "assert"? GHC rewrites assert s when optimising as just id . Or alternatively, it's behaviour can be changed with a compiler flag...	[ 0.017333984375, 0.0027618408203125, 0.0040283203125, 0.00069427490234375, 0.0009765625, 0.0047607421875, 0.00159454345703125, -0.00848388671875, 0.007568359375, 0.005126953125, 0.01043701171875, 0.02783203125, -0.0234375, -0.0120849609375, 0.022216796875, 0.02197265625, 0.009765625, ...	[ 13676, 39989, 13, 15572, 3075, 16065, 1884, 162, 33657, 31380, 238, 8, 978, 1556, 142508, 527, 73265, 456, 5429, 52164, 237, 91, 3229, 72219, 1660, 3447, 224833, 831, 98816, 678, 9969, 34759, 49938, 18, 144851, 11389, 3564, 2174, 707, 542...	[ 0.06768798828125, 0.2117919921875, 0.1351318359375, 0.1910400390625, 0.07440185546875, 0.1881103515625, 0.1116943359375, 0.0869140625, 0.25830078125, 0.0704345703125, 0.0823974609375, 0.0828857421875, 0.108642578125, 0.0777587890625, 0.182373046875, 0.1038818359375, 0.2056884765625, ...	embed
53119434_c0	53119434	haskell	0	Title: Add a typeclass constraint on a Record type Problem title: Add a typeclass constraint on a Record type Tags: haskell Problem: Add a typeclass constraint on a Record type Before this declaration was working well in my context : data PersistedCommand = PersistedCommand { offset :: Offset , command :: Command } ins...	Add a typeclass constraint on a Record type Add a typeclass constraint on a Record type haskell Add Record PersistedCommand Offset Command Show Add a typeclass constraint on a Record type Before this declaration was working well in my context : But I've changed Command from a data type to a type class. How do I express...	[ -0.01495361328125, 0.002960205078125, 0.003997802734375, 0.033203125, 0.00872802734375, 0.004608154296875, -0.026611328125, -0.00049591064453125, -0.004058837890625, -0.025146484375, 0, -0.0167236328125, 0.0007476806640625, 0.0091552734375, -0.01458740234375, -0.0228271484375, -0.012...	[ 29117, 10644, 67413, 158, 2816, 4288, 98, 54877, 10, 1556, 142508, 57309, 14437, 10770, 12018, 9791, 3509, 123573, 17367, 21635, 20697, 43701, 4966, 272, 98816, 1295, 2053, 47, 18507, 36510, 903, 5036, 70, 96362 ]	[ 0.104736328125, 0.23291015625, 0.264404296875, 0.0882568359375, 0.1705322265625, 0.1278076171875, 0.07098388671875, 0.185791015625, 0.028533935546875, 0.113037109375, 0.2025146484375, 0.1239013671875, 0.0953369140625, 0.0439453125, 0.14599609375, 0.1553955078125, 0.1119384765625, 0...	embed
78493013_c0	78493013	haskell	0	Title: How to configure HLS in nixpkgs? Problem title: How to configure HLS in nixpkgs? Tags: haskell-language-server, haskell, nix, nixpkgs Problem: How to configure HLS in nixpkgs? When using an older nixpkgs (2022), one can do the following to customize pkgs.haskellPackages.haskell-language-server to, for example, d...	How to configure HLS in nixpkgs? How to configure HLS in nixpkgs? haskell-language-server haskell nix nixpkgs How HLS pkgs.haskellPackages.haskell-language-server pkgs.haskell.lib.compose lib.flip lib.pipe drv.override How to configure HLS in nixpkgs? When using an older nixpkgs (2022), one can do the following to cust...	[ -0.000644683837890625, -0.01434326171875, 0.00946044921875, -0.0087890625, -0.009521484375, -0.0033111572265625, 0.005035400390625, -0.0086669921875, -0.00011587142944335938, 0.017822265625, -0.0137939453125, -0.001617431640625, 0.042724609375, -0.0003604888916015625, 0.00848388671875, ...	[ 11249, 47, 222495, 572, 19759, 23, 300, 425, 38988, 9405, 1556, 142508, 196651, 39642, 8517, 10557, 205956, 5612, 25474, 21392, 1434, 1081, 334, 5465, 416, 17368, 114210, 151159, 178036, 2837, 2886, 707, 432, 822, 136, 22759, 66139, 69307, ...	[ 0.0677490234375, 0.038787841796875, 0.2130126953125, 0.150146484375, 0.262939453125, 0.048065185546875, 0.0936279296875, 0.1236572265625, 0.153564453125, 0.16943359375, 0.0848388671875, 0.19580078125, 0.139892578125, 0.136962890625, 0.148681640625, 0.078857421875, 0.127685546875, 0...	embed
68363551_c0	68363551	haskell	0	Title: problem with let in binding in a predicate in haskell language? Problem title: problem with let in binding in a predicate in haskell language? Tags: haskell Problem: problem with let in binding in a predicate in haskell language? i'm newbie in haskell language. i wrote function get list of pairs as input and ret...	problem with let in binding in a predicate in haskell language? problem with let in binding in a predicate in haskell language? haskell RealFloat problem with let in binding in a predicate in haskell language? i'm newbie in haskell language. i wrote function get list of pairs as input and return list of BMI index: calc...	[ -0.0021820068359375, -0.0203857421875, -0.00531005859375, 0.004180908203125, 0.0208740234375, 0.01129150390625, 0.0267333984375, -0.0038299560546875, 0.02392578125, -0.00017452239990234375, -0.002288818359375, -0.000957489013671875, 0.005584716796875, -0.02392578125, -0.001983642578125, ...	[ 2967, 678, 2633, 23, 128239, 1653, 2063, 67, 1556, 142508, 46876, 10, 5120, 919, 365, 257, 9014, 54397, 32354, 2046, 5303, 80836, 237, 107730, 30646, 335, 10101, 63262, 6510, 238, 571, 68996, 1022, 16750, 434, 127, 425, 266, 16498, 148, ...	[ 0.1888427734375, 0.049346923828125, 0.2269287109375, 0.173095703125, 0.285400390625, 0.168212890625, 0.239990234375, 0.142578125, 0.1424560546875, 0.2423095703125, 0.153564453125, 0.05584716796875, 0.1702880859375, 0.06573486328125, 0.161865234375, 0.1214599609375, 0.067626953125, ...	embed
11814525_c0	11814525	haskell	0	Title: Haskell, parse error in input 'if' Problem title: Haskell, parse error in input 'if' Tags: haskell Problem: Haskell, parse error in input 'if' I can't for the life of me figure out why there is a problem with this if statement (haskell noobie.) Can anyone help me out? fst3 (a,b,c) = a snd3 (a...	Haskell, parse error in input 'if' Haskell, parse error in input 'if' haskell Haskell fst3 snd3 trd3 fst4 snd4 trd4 qud4 x:xs Haskell, parse error in input 'if' I can't for the life of me figure out why there is a problem with this if statement (haskell noobie.) Can anyone help me out?	[ -0.007171630859375, 0.01806640625, -0.01361083984375, 0.0157470703125, 0.0185546875, 0.033447265625, -0.00830078125, 0.01043701171875, 0.000797271728515625, -0.01324462890625, -0.0164794921875, -0.0016632080078125, 0.0196533203125, -0.004730224609375, -0.004638671875, 0.0220947265625, ...	[ 20625, 142508, 366, 184, 18499, 23, 107730, 3768, 3190, 4, 1556, 1238, 271, 363, 2208, 4307, 617, 1103, 425, 831, 18, 6897, 26366, 15400, 2685, 83, 2967, 903, 2174, 63805, 10557, 110, 31, 9014, 4171, 4358 ]	[ 0.15283203125, 0.2509765625, 0.167724609375, 0.1444091796875, 0.22802734375, 0.06158447265625, 0.1951904296875, 0.1468505859375, 0.2734375, 0.0228424072265625, 0.135009765625, 0.001007080078125, 0.0200042724609375, 0.07525634765625, 0.03094482421875, 0.02752685546875, 0.068603515625,...	embed
35524320_c0	35524320	haskell	0	Title: Functorial structure of functions Problem title: Functorial structure of functions Tags: haskell, functor Problem: Functorial structure of functions I'm having difficulties understanding the functorial structure of functions. I think I have a clue with ghci: Prelude> :t (->) (->) :: * -> * -> * So if feeded a ty...	Functorial structure of functions Functorial structure of functions haskell functor Functorial Prelude Integer Functorial structure of functions I'm having difficulties understanding the functorial structure of functions. I think I have a clue with ghci: So if feeded a type, applying on it (->) will have desired kind *...	[ 0.01708984375, 0.0031280517578125, 0.004638671875, 0.0050048828125, 0.01104736328125, 0.022705078125, 0.005035400390625, -0.01239013671875, 0.00150299072265625, -0.03515625, -0.0213623046875, -0.01373291015625, -0.005828857421875, 0.01446533203125, 0.01177978515625, -0.01519775390625, ...	[ 28670, 238, 77275, 45646, 32354, 111, 1556, 142508, 7477, 18770, 1914, 822, 44401, 34844, 100094, 29786, 31380, 318, 2174, 61590, 297, 10644, 59911, 98, 103607, 1221, 765, 104851, 8562, 661, 33079, 3664, 80934, 53418, 31635, 15400, 831, 33022...	[ 0.159423828125, 0.09686279296875, 0.1700439453125, 0.2117919921875, 0.22021484375, 0.0509033203125, 0.1077880859375, 0.2147216796875, 0.18310546875, 0.2332763671875, 0.04986572265625, 0.140625, 0.1427001953125, 0.0221405029296875, 0.072265625, 0.049652099609375, 0.067138671875, 0.1...	embed
38863820_c0	38863820	haskell	0	Title: How do you save a file using Conduit? Problem title: How do you save a file using Conduit? Tags: haskell-pipes, conduit, haskell Problem: How do you save a file using Conduit? How do you save a file using conduit's library? I looked through conduit's tutorial but can't seem to find anything, here is my use case:...	How do you save a file using Conduit? How do you save a file using Conduit? haskell-pipes conduit haskell Conduit How Monad How do you save a file using Conduit? How do you save a file using conduit's library? I looked through conduit's tutorial but can't seem to find anything, here is my use case: So there's two quest...	[ -0.00081634521484375, 0.0093994140625, 0.0098876953125, 0.032958984375, -0.006683349609375, 0.0186767578125, -0.0025787353515625, -0.0067138671875, 0.003387451171875, 0.0029144287109375, -0.01336669921875, 0.00019931793212890625, 0.0263671875, 0.01324462890625, 0.006103515625, -0.00549...	[ 11249, 54, 30098, 10, 11435, 17368, 1657, 112061, 1556, 142508, 1434, 13569, 120565, 60331, 71, 35773, 1294, 57143, 4527, 7225, 6626, 9655, 10422, 124519, 96760, 79315, 3934, 5303, 61590, 31344, 154663, 29479, 174350, 32354, 113664, 89554, 9433...	[ 0.08172607421875, 0.0257110595703125, 0.196533203125, 0.02685546875, 0.19970703125, 0.1348876953125, 0.1387939453125, 0.25048828125, 0.1002197265625, 0.202880859375, 0.1015625, 0.08245849609375, 0.25, 0.1082763671875, 0.070068359375, 0.1370849609375, 0.06365966796875, 0.07727050781...	embed
28016759_c0	28016759	haskell	0	Title: Leaf Trees in Haskell - non-exhaustive pattern Problem title: Leaf Trees in Haskell - non-exhaustive pattern Tags: haskell Problem: Leaf Trees in Haskell - non-exhaustive pattern This function follows a path of Bools, going left or right depending on False or True, respectively data LTree a = Leaf a \| Fork (LTre...	Leaf Trees in Haskell - non-exhaustive pattern Leaf Trees in Haskell - non-exhaustive pattern haskell Leaf Trees Haskell LTree Fork Show Bool Maybe l:ls Just b:bs Leaf Trees in Haskell - non-exhaustive pattern This function follows a path of Bools, going left or right depending on False or True, respectively The thing ...	[ 0.0014190673828125, 0.0038604736328125, -0.0027008056640625, -0.0106201171875, 0.0107421875, 0.0021820068359375, -0.0262451171875, -0.018798828125, 0.0054931640625, -0.011474609375, 0.01226806640625, 0.00732421875, -0.004119873046875, 0.0164794921875, 0.00061798095703125, 0.00093841552...	[ 636, 2407, 4804, 90, 23, 20625, 142508, 351, 18391, 4935, 103510, 1556, 107, 13, 1326, 92, 17367, 2460, 929, 83425, 8080, 9563, 876, 16145, 32354, 28960, 60875, 73783, 7730, 25737, 707, 7108, 96819, 22225, 87599, 13580, 64765, 14602, 959, ...	[ 0.07806396484375, 0.209228515625, 0.257568359375, 0.05029296875, 0.025299072265625, 0.128662109375, 0.256591796875, 0.0880126953125, 0.06268310546875, 0.017333984375, 0.1552734375, 0.089599609375, 0.2152099609375, 0.204345703125, 0.1744384765625, 0.116943359375, 0.12744140625, 0.06...	embed
21199840_c0	21199840	haskell	0	Title: parse error on input `=' in Haskell Problem title: parse error on input `=' in Haskell Tags: haskell, parse-error Problem: parse error on input `=' in Haskell I wrote the following function in Haskell coordenadas :: (Floating a) => String -> (a, a, a) coordenadas linea = (x, y, z) where (_ : xStr : ySt...	parse error on input `=' in Haskell parse error on input `=' in Haskell haskell parse-error Haskell Floating Float Z10 parse error on input `=' in Haskell I wrote the following function in Haskell This function is meant to receive a string like "N1 X2 Y1 Z10" and produce a tuple like (2, 1, 10) , but when I t...	[ 0.0032196044921875, 0.01214599609375, -0.0262451171875, 0.00946044921875, 0.00086212158203125, 0.0120849609375, 0.0103759765625, -0.0087890625, 0.01080322265625, -0.01275634765625, -0.01397705078125, -0.025146484375, 0.0322265625, -0.01263427734375, -0.0235595703125, 0.0177001953125, ...	[ 366, 184, 18499, 98, 107730, 9473, 1369, 54764, 425, 3768, 20625, 142508, 1556, 188800, 38699, 26518, 257, 567, 963, 54397, 25632, 32354, 131148, 53299, 79315, 1884, 839, 418, 1193, 304, 990, 27489, 370, 8705, 4700, 106, 209, 9790, 9969, ...	[ 0.151611328125, 0.1488037109375, 0.2105712890625, 0.05828857421875, 0.194091796875, 0.0239410400390625, 0.19921875, 0.0204620361328125, 0.007537841796875, 0.1634521484375, 0.1441650390625, 0.2352294921875, 0.1285400390625, 0.166015625, 0.177490234375, 0.02838134765625, 0.086181640625...	embed
7819801_c0	7819801	haskell	0	Title: Replace a 3 parameter list-comprehension by using map, concat Problem title: Replace a 3 parameter list-comprehension by using map, concat Tags: list-comprehension, haskell, higher-order-functions, translate, map-function Problem: Replace a 3 parameter list-comprehension by using map, concat I have some understa...	Replace a 3 parameter list-comprehension by using map, concat Replace a 3 parameter list-comprehension by using map, concat list-comprehension haskell higher-order-functions translate map-function map Replace Replace a 3 parameter list-comprehension by using map, concat I have some understanding of list comprehension. ...	[ -0.010009765625, -0.0068359375, -0.004241943359375, 0.002716064453125, -0.00201416015625, 0.006622314453125, -0.006134033203125, 0.010009765625, 0.0162353515625, -0.03955078125, -0.006072998046875, -0.00994873046875, 0.0211181640625, 0.00445556640625, -0.0281982421875, -0.0005073547363...	[ 853, 23935, 138, 171859, 5303, 277, 4692, 3220, 6889, 17368, 22288, 158, 4460, 1556, 142508, 77546, 80596, 137175, 3900, 19309, 4, 100094, 46683, 28219, 125195, 21543, 5701, 3789, 55300, 1884, 36917, 25632, 32354, 26366, 1810, 18499, 4358 ]	[ 0.080810546875, 0.19384765625, 0.1593017578125, 0.2359619140625, 0.2064208984375, 0.0782470703125, 0.17919921875, 0.1943359375, 0.081787109375, 0.094482421875, 0.258056640625, 0.1568603515625, 0.26416015625, 0.1171875, 0.21923828125, 0.0911865234375, 0.156494140625, 0.1529541015625...	embed
33263029_c0	33263029	haskell	0	Title: Turtle: Prompting for input, without a trailing newline Problem title: Turtle: Prompting for input, without a trailing newline Tags: haskell-turtle, haskell Problem: Turtle: Prompting for input, without a trailing newline I'm writing a console application that needs to prompt the user for several things. I'm usi...	Turtle: Prompting for input, without a trailing newline Turtle: Prompting for input, without a trailing newline haskell-turtle haskell Turtle Prompting Maybe Text Input raw_input Turtle: Prompting for input, without a trailing newline I'm writing a console application that needs to prompt the user for several things. I...	[ -0.0233154296875, 0.0125732421875, 0.005279541015625, 0.0274658203125, -0.01031494140625, 0.01202392578125, 0.0167236328125, -0.02294921875, -0.01348876953125, 0.00341796875, 0.0150146484375, 0.0000476837158203125, -0.0203857421875, 0.00482177734375, 0.00848388671875, 0.01226806640625,...	[ 4252, 17991, 1250, 2676, 1916, 100, 107730, 15490, 141037, 214, 3525, 2256, 1556, 142508, 987, 83425, 24129, 360, 49649, 73, 32562, 130250, 38415, 27117, 105876, 38937, 8966, 17368, 2130, 35773, 1294, 32354, 33342, 28, 3089, 29479, 3884, 7171...	[ 0.1883544921875, 0.2344970703125, 0.0936279296875, 0.18115234375, 0.0938720703125, 0.07415771484375, 0.19140625, 0.1162109375, 0.1505126953125, 0.0908203125, 0.08740234375, 0.1611328125, 0.07647705078125, 0.19873046875, 0.123046875, 0.0306243896484375, 0.120361328125, 0.08288574218...	embed
57540431_c1	57540431	haskell	1	02fd2/8.6.5/lib --bindir=/Users/808375/.stack/snapshots/x86_64-osx/de99b86bb99430d571d8ce91b535ceb539abe112ba7d6080374dd59296002fd2/8.6.5/bin --datadir=/Users/808375/.stack/snapshots/x86_64-osx/de99b86bb99430d571d8ce91b535ceb539abe112ba7d6080374dd59296002fd2/8.6.5/share --libexecdir=/Users/808375/.stack/snapshots/x86_6...	02fd2/8.6.5/lib --bindir=/Users/808375/.stack/snapshots/x86_64-osx/de99b86bb99430d571d8ce91b535ceb539abe112ba7d6080374dd59296002fd2/8.6.5/bin --datadir=/Users/808375/.stack/snapshots/x86_64-osx/de99b86bb99430d571d8ce91b535ceb539abe112ba7d6080374dd59296002fd2/8.6.5/share --libexecdir=/Users/808375/.stack/snapshots/x86_6...	[ -0.0150146484375, 0.031982421875, -0.005950927734375, 0.00189208984375, -0.00433349609375, 0.0220947265625, -0.01177978515625, 0.0101318359375, 0.003143310546875, 0.024169921875, -0.016357421875, -0.0198974609375, -0.00970458984375, -0.017822265625, 0.005279541015625, 0.0279541015625, ...	[ 4648, 420, 71, 304, 23538, 5, 136473, 64, 5612, 4210, 7568, 936, 1369, 1062, 7, 1314, 163736, 85433, 590, 2594, 10957, 72697, 425, 15276, 13307, 9, 232, 112, 5046, 275, 5125, 617, 1197, 178837, 1019, 329, 12183, 758, 5843, 188758, 34669...	[ 0.1943359375, 0.1243896484375, 0.1156005859375, 0.16748046875, 0.2034912109375, 0.08642578125, 0.2841796875, 0.107177734375, 0.2401123046875, 0.12451171875, 0.23583984375, 0.20556640625, 0.02166748046875, 0.166015625, 0.191650390625, 0.191650390625, 0.1939697265625, 0.262939453125,...	embed
10971232_c0	10971232	haskell	0	Title: How do I use Unboxed Vectors? Problem title: How do I use Unboxed Vectors? Tags: haskell Problem: How do I use Unboxed Vectors? I am trying to implement a ray data type using the Vector type found here: http://www.haskell.org/haskellwiki/Numeric_Haskell:_A_Vector_Tutorial#Importing_the_library The Vector will on...	How do I use Unboxed Vectors? How do I use Unboxed Vectors? haskell qualified How Unboxed Vectors Main Data.Vector.Unboxed Vector Ray Not Failed How do I use Unboxed Vectors? I am trying to implement a ray data type using the Vector type found here: http://www.haskell.org/haskellwiki/Numeric_Haskell:_A_Vector_Tutorial#...	[ 0.0126953125, 0.033447265625, 0.0087890625, 0.0069580078125, 0.01422119140625, 0.0205078125, -0.006744384765625, -0.027099609375, -0.01611328125, -0.035400390625, -0.013671875, -0.0152587890625, 0.005218505859375, -0.0169677734375, -0.0263671875, -0.01385498046875, 0.00848388671875, ...	[ 11249, 4527, 992, 11728, 297, 52884, 22230, 1556, 142508, 217225, 12321, 11809, 26455, 18770, 14256, 2609, 31681, 11205, 190355, 54, 31577, 29479, 62656, 2053, 10644, 17368, 10557, 13691, 6495, 7, 15665, 77275, 6982, 150, 2844, 1221, 4734, 16...	[ 0.060546875, 0.1705322265625, 0.1468505859375, 0.2296142578125, 0.131103515625, 0.2279052734375, 0.2137451171875, 0.10247802734375, 0.190185546875, 0.141845703125, 0.03985595703125, 0.08251953125, 0.1878662109375, 0.2139892578125, 0.124755859375, 0.201416015625, 0.1524658203125, 0....	embed
36366479_c0	36366479	haskell	0	Title: Haskell: How to use let-in construction? Problem title: Haskell: How to use let-in construction? Tags: haskell Problem: Haskell: How to use let-in construction? I wrote a sort function. It's pretty weird. sort :: (Eq a, Ord a) => [a] -> [a] sort xs = repeat'' sort' (xs) (length xs) repeat'' f xs 0 = xs repeat'' ...	Haskell: How to use let-in construction? Haskell: How to use let-in construction? haskell Haskell How Ord n-1 x:y:xs x:xs y:xs Haskell: How to use let-in construction? I wrote a sort function. It's pretty weird. How can I prettify it using let-in construction? I think my try doesn't look good:	[ -0.01251220703125, 0.005584716796875, 0.020751953125, -0.0009307861328125, 0.00732421875, -0.00078582763671875, -0.006103515625, -0.01287841796875, 0.018798828125, -0.00994873046875, 0.0125732421875, 0.01507568359375, 0.002685546875, 0.007171630859375, 0.00897216796875, 0.0010375976562...	[ 20625, 142508, 11249, 4527, 2633, 9, 73, 50961, 47, 1556, 35379, 653, 5759, 1022, 53, 425, 12, 113, 54397, 12096, 32354, 28875, 179459, 4589, 7737, 17368, 9790, 6713, 4127 ]	[ 0.1246337890625, 0.196044921875, 0.07177734375, 0.1129150390625, 0.1766357421875, 0.062164306640625, 0.187255859375, 0.2137451171875, 0.0214080810546875, 0.11181640625, 0.178466796875, 0.055145263671875, 0.1234130859375, 0.0272979736328125, 0.042449951171875, 0.033416748046875, 0.000...	embed
15179316_c0	15179316	haskell	0	Title: Eliminating repetition in cabal files Problem title: Eliminating repetition in cabal files Tags: cabal, haskell Problem: Eliminating repetition in cabal files I often have similar properties in many stanzas of my .cabal files. E.g. Library x ... ghc-options: -O2 -Wall -fno-warn-missing-signatures -fwarn-incomple...	Eliminating repetition in cabal files Eliminating repetition in cabal files cabal haskell Eliminating Library Wall Executable Eliminating repetition in cabal files I often have similar properties in many stanzas of my .cabal files. E.g. Keeping them consistent is tedious and error-prone. Is there a better way? Even tri...	[ -0.005035400390625, -0.00921630859375, 0.00457763671875, 0.01116943359375, 0.000335693359375, -0.015869140625, 0.0035247802734375, 0.0164794921875, 0.0162353515625, 0.00994873046875, -0.021240234375, 0.004730224609375, 0.00640869140625, 0.001861572265625, 0.0002918243408203125, 0.01025...	[ 203358, 1916, 57346, 1363, 23, 109524, 102158, 1556, 142508, 103835, 23706, 211603, 2886, 27983, 21373, 183871, 5941, 169218, 5, 408, 3571, 83041, 2856, 74729, 120, 5670, 18499, 3454, 86, 11522, 3917, 88308, 6815, 44457, 66161, 5701, 765, 403...	[ 0.194580078125, 0.0517578125, 0.26611328125, 0.097900390625, 0.0226287841796875, 0.256591796875, 0.1839599609375, 0.101318359375, 0.1820068359375, 0.1568603515625, 0.14892578125, 0.1197509765625, 0.058685302734375, 0.11083984375, 0.1256103515625, 0.1219482421875, 0.06793212890625, ...	embed
17961273_c1	17961273	haskell	1	Couldn't match type `MobileCarrier' with `[Char]' Expected type: M.Map PersonName BillingAddress Actual type: M.Map MobileCarrier BillingAddress In the first argument of `lookup', namely `addressMap' In the second argument of `(>>=)', namely `lookup addressMap' In the expression: return person >>= lookup phoneMap >>= ...	Couldn't match type `MobileCarrier' with `[Char]' Expected type: M.Map PersonName BillingAddress Actual type: M.Map MobileCarrier BillingAddress In the first argument of `lookup', namely `addressMap' In the second argument of `(>>=)', namely `lookup addressMap' In the expression: return person >>= lookup phoneMap >>= ...	[ -0.000789642333984375, 0.006988525390625, 0.0087890625, 0.0140380859375, 0.0025177001953125, 0.01806640625, 0.00665283203125, 0.000591278076171875, 0.00518798828125, -0.024658203125, 0.003997802734375, -0.00164031982421875, 0.00186920166015625, -0.005645751953125, 0.01165771484375, -0....	[ 191147, 18, 14858, 10644, 125833, 21851, 25388, 678, 84068, 60075, 13, 276, 5, 166179, 15270, 163612, 19893, 214, 161007, 100582, 19745, 5117, 10750, 64747, 2037, 107421, 17932, 30813, 1369, 29823, 125195, 30646, 3445, 6396, 6713, 24089, 2258, ...	[ 0.17626953125, 0.083251953125, 0.193603515625, 0.235595703125, 0.13818359375, 0.1278076171875, 0.2020263671875, 0.00177001953125, 0.21435546875, 0.1304931640625, 0.149658203125, 0.09600830078125, 0.00738525390625, 0.205078125, 0.1143798828125, 0.1605224609375, 0.1339111328125, 0.08...	embed
26333578_c0	26333578	haskell	0	Title: Conditionally perform an 'action' in do block Problem title: Conditionally perform an 'action' in do block Tags: haskell, conditional-statements Problem: Conditionally perform an 'action' in do block I have a function like this: myFnc :: foo -> StateT bar IO baz -- foo, bar, and baz are compl...	Conditionally perform an 'action' in do block Conditionally perform an 'action' in do block haskell conditional-statements Conditionally StateT Either Right Conditionally perform an 'action' in do block I have a function like this: I can think only of case : But case statement with only one clause l...	[ -0.00726318359375, -0.006744384765625, 0.0146484375, -0.01470947265625, -0.01141357421875, 0.01141357421875, 0.00054931640625, 0.01214599609375, 0.0103759765625, -0.007781982421875, 0.029296875, -0.00750732421875, -0.0184326171875, -0.0142822265625, -0.0107421875, 0.01904296875, -0.0...	[ 46347, 43315, 538, 51339, 3768, 44713, 54, 46389, 23, 1556, 142508, 35431, 289, 61340, 22836, 618, 9319, 90911, 32354, 1884, 831, 5351, 4734, 7225, 63805, 1632, 70731, 13, 33342, 114453, 11249, 25958 ]	[ 0.17236328125, 0.1622314453125, 0.043701171875, 0.179931640625, 0.09033203125, 0.1861572265625, 0.144775390625, 0.2152099609375, 0.044097900390625, 0.111572265625, 0.217041015625, 0.19775390625, 0.136474609375, 0.1502685546875, 0.1400146484375, 0.026153564453125, 0.029876708984375, ...	embed
21647780_c0	21647780	haskell	0	Title: Haskell: How to product a file like a list Problem title: Haskell: How to product a file like a list Tags: haskell Problem: Haskell: How to product a file like a list I am a new one for studying Haskell, and I want to write a small phone book program. I put the contact list in a file called phone.txt which like:...	Haskell: How to product a file like a list Haskell: How to product a file like a list haskell System.IO Haskell How phone.txt ReadMode Haskell: How to product a file like a list I am a new one for studying Haskell, and I want to write a small phone book program. I put the contact list in a file called phone.txt which l...	[ -0.003631591796875, 0.0019683837890625, 0.00958251953125, 0.0203857421875, -0.0072021484375, 0.0029754638671875, -0.015625, 0.0181884765625, -0.0032196044921875, -0.0230712890625, -0.01300048828125, -0.023193359375, -0.0023193359375, -0.01483154296875, 0.003997802734375, -0.00598144531...	[ 20625, 142508, 11249, 12996, 11435, 1884, 5303, 47, 10, 1556, 12353, 17780, 24089, 124326, 4764, 9083, 3525, 35187, 3444, 33022, 19336, 12877, 1528, 3884, 5470, 23, 5, 3293, 100, 16487, 14012, 390, 107730, 9351, 15400, 831, 959, 9969, 1340,...	[ 0.1357421875, 0.2408447265625, 0.0609130859375, 0.25439453125, 0.2108154296875, 0.18505859375, 0.2020263671875, 0.030914306640625, 0.0145721435546875, 0.1357421875, 0.079833984375, 0.1380615234375, 0.2010498046875, 0.253173828125, 0.1533203125, 0.1356201171875, 0.013763427734375, 0...	embed
8101067_c0	8101067	haskell	0	Title: Binary instance for an existential Problem title: Binary instance for an existential Tags: haskell Problem: Binary instance for an existential Given an existential data type, for example: data Foo = forall a . (Typeable a, Binary a) => Foo a I'd like to write instance Binary Foo . I can write the serialisation (...	Binary instance for an existential Binary instance for an existential haskell Binary Foo Typeable TypeRep Binary instance for an existential Given an existential data type, for example: I'd like to write instance Binary Foo . I can write the serialisation (serialise the TypeRep then serialise the value), but I can't fi...	[ 0.0283203125, -0.000148773193359375, -0.01019287109375, 0.0126953125, -0.00640869140625, 0.00579833984375, 0.000579833984375, 0.016357421875, 0.0103759765625, -0.025634765625, -0.01214599609375, -0.0177001953125, 0.0115966796875, 0.024658203125, -0.005157470703125, 0.000352859497070312...	[ 54092, 1294, 110527, 100, 99707, 15403, 1556, 142508, 9572, 31, 60457, 2886, 4332, 254, 2053, 10644, 27781, 1884, 33022, 831, 35686, 15032, 25435, 12811, 3075, 34292, 26366, 3642, 8, 184, 51626, 62822, 2967, 34475, 3871, 22288, 4420, 45, 10...	[ 0.2216796875, 0.142578125, 0.264404296875, 0.08331298828125, 0.1998291015625, 0.1295166015625, 0.12548828125, 0.2081298828125, 0.1787109375, 0.171630859375, 0.1988525390625, 0.165771484375, 0.1832275390625, 0.1510009765625, 0.1119384765625, 0.18115234375, 0.002685546875, 0.07629394...	embed
5784553_c0	5784553	haskell	0	Title: Getting the date in Haskell in the local timezone Problem title: Getting the date in Haskell in the local timezone Tags: date, haskell, time, timezone Problem: Getting the date in Haskell in the local timezone I am currently using the code below in a project date :: IO (Integer,Int,Int) -- :: (year,month,day) da...	Getting the date in Haskell in the local timezone Getting the date in Haskell in the local timezone date haskell time timezone Getting Haskell Integer Getting the date in Haskell in the local timezone I am currently using the code below in a project date :: IO (Integer,Int,Int) -- :: (year,month,day) date = getCurrentT...	[ 0.00153350830078125, -0.003753662109375, -0.002532958984375, 0.017578125, 0.01385498046875, -0.0005950927734375, -0.011474609375, 0.010986328125, -0.0159912109375, -0.044189453125, 0.00927734375, -0.007049560546875, 0.0032501220703125, 0.01116943359375, 0.00909423828125, 0.000938415527...	[ 210732, 5622, 23, 20625, 142508, 4000, 1733, 18979, 1556, 44401, 82424, 17368, 18151, 35064, 13452, 17780, 67, 1505, 18, 46799, 15477, 5636, 2046, 474, 15724, 70059, 30646, 47, 91127, 519, 9893, 486, 15390, 97141, 959, 8337, 26785, 11675, 3...	[ 0.0733642578125, 0.196533203125, 0.052703857421875, 0.145263671875, 0.25732421875, 0.146240234375, 0.1097412109375, 0.163330078125, 0.1134033203125, 0.1787109375, 0.010406494140625, 0.02587890625, 0.09130859375, 0.049102783203125, 0.1055908203125, 0.1556396484375, 0.0721435546875, ...	embed
60010138_c0	60010138	haskell	0	Title: Is it possible to combine sequence and join for monadically created ConduitTs that have actions in the same monad? Problem title: Is it possible to combine sequence and join for monadically created ConduitTs that have actions in the same monad? Tags: haskell, conduit Problem: Is it possible to combine sequence a...	Is it possible to combine sequence and join for monadically created ConduitTs that have actions in the same monad? Is it possible to combine sequence and join for monadically created ConduitTs that have actions in the same monad? haskell conduit ConduitTs ConduitT Foldable Is it possible to combine sequence and join fo...	[ -0.00179290771484375, 0.01385498046875, -0.0157470703125, 0.0230712890625, 0.00897216796875, -0.01019287109375, 0.00141143798828125, 0.00323486328125, 0.005584716796875, -0.021240234375, -0.02294921875, 0.0103759765625, 0.01123046875, 0.000263214111328125, -0.0186767578125, -0.00561523...	[ 2071, 7722, 70163, 40, 944, 3956, 136, 33284, 2667, 712, 75935, 1657, 112061, 618, 61972, 5701, 1556, 142508, 120565, 30077, 71, 2886, 442, 100, 765, 23, 209303, 32354, 168894, 2967, 110527, 42822, 19882, 1909, 44691, 53201 ]	[ 0.018707275390625, 0.1759033203125, 0.216064453125, 0.06756591796875, 0.140869140625, 0.12939453125, 0.0863037109375, 0.2164306640625, 0.10357666015625, 0.115966796875, 0.0897216796875, 0.0869140625, 0.1715087890625, 0.1837158203125, 0.156494140625, 0.04931640625, 0.09912109375, 0....	embed
15394608_c0	15394608	haskell	0	Title: Don't substitute HTML entities with HXT Problem title: Don't substitute HTML entities with HXT Tags: xml, hxt, haskell Problem: Don't substitute HTML entities with HXT How do you preserve HTML entities using HXT ? The withSubstHTMLEntities SystemConfig doesn't seem to change anything : runX $ xshow $ r...	Don't substitute HTML entities with HXT Don't substitute HTML entities with HXT xml hxt haskell Don HTML HXT Don't substitute HTML entities with HXT How do you preserve HTML entities using HXT ? The withSubstHTMLEntities SystemConfig doesn't seem to change anything : runX $ xshow $ readString [] "<doc><p> &gt...	[ 0.0048828125, 0.03857421875, 0.01275634765625, -0.0069580078125, -0.005950927734375, -0.01031494140625, -0.00012302398681640625, -0.0145263671875, 0.00811767578125, -0.0106201171875, -0.0179443359375, -0.0016937255859375, -0.02001953125, 0.021484375, 0.003265380859375, -0.0010528564453...	[ 3768, 18, 161740, 19097, 77630, 2449, 678, 572, 70981, 6, 131492, 1096, 29062, 1556, 142508, 7650, 54, 479, 86687, 17368, 96472, 271, 127068, 7768, 118, 12353, 83671, 48903, 15549, 11675, 1542, 1022, 31374, 3650, 12301, 71713, 214, 29713, 7...	[ 0.0709228515625, 0.03582763671875, 0.1923828125, 0.262939453125, 0.1884765625, 0.1180419921875, 0.1575927734375, 0.15869140625, 0.26708984375, 0.010955810546875, 0.1632080078125, 0.1007080078125, 0.1973876953125, 0.158447265625, 0.2177734375, 0.101806640625, 0.0062255859375, 0.1378...	embed
2496457_c0	2496457	haskell	0	Title: Haskell's type system treats a numerical value as function? Problem title: Haskell's type system treats a numerical value as function? Tags: haskell, numeric, typeclass, types Problem: Haskell's type system treats a numerical value as function? After playing around with haskell a bit I stumbled over th...	Haskell's type system treats a numerical value as function? Haskell's type system treats a numerical value as function? haskell numeric typeclass types Haskell Prelude Data.Maclaurin Num Haskell's type system treats a numerical value as function? After playing around with haskell a bit I stumbled over this fu...	[ 0.006072998046875, 0.01007080078125, 0.0064697265625, 0.012939453125, 0.003692626953125, 0.02880859375, -0.005889892578125, -0.00946044921875, -0.00982666015625, -0.034912109375, -0.0230712890625, 0.00133514404296875, -0.01031494140625, -0.0157470703125, 0, -0.01275634765625, 0.00665...	[ 20625, 142508, 3768, 10644, 5426, 85689, 54744, 6827, 34292, 237, 32354, 1556, 67413, 52895, 1914, 822, 11809, 55450, 17697, 2677, 52782, 7, 10, 75169, 10932, 4785, 18784, 40099, 645, 137989, 31255, 98169, 173, 18770, 9, 65421, 51776, 15700, ...	[ 0.1397705078125, 0.278564453125, 0.0562744140625, 0.258056640625, 0.2021484375, 0.1617431640625, 0.1849365234375, 0.12060546875, 0.2001953125, 0.13818359375, 0.2467041015625, 0.10546875, 0.1326904296875, 0.1439208984375, 0.05377197265625, 0.1392822265625, 0.0928955078125, 0.0632934...	embed
20948927_c0	20948927	haskell	0	Title: Can I make a pipe that consumes all of the producer output and passes it on as a list? Problem title: Can I make a pipe that consumes all of the producer output and passes it on as a list? Tags: haskell Problem: Can I make a pipe that consumes all of the producer output and passes it on as a list? I'm trying to ...	Can I make a pipe that consumes all of the producer output and passes it on as a list? Can I make a pipe that consumes all of the producer output and passes it on as a list? haskell Can Producer Pipe Consumer Can I make a pipe that consumes all of the producer output and passes it on as a list? I'm trying to use the Pi...	[ 0.01611328125, 0.0142822265625, -0.0238037109375, 0.035400390625, -0.0240478515625, 0.03173828125, -0.038818359375, 0.01123046875, -0.00015926361083984375, -0.014892578125, 0.0026702880859375, 0.01434326171875, 0.044921875, 0.00958251953125, -0.00628662109375, 0.000629425048828125, 0...	[ 4171, 87, 3249, 10, 137158, 450, 18588, 90, 756, 111, 108558, 140992, 10922, 98, 237, 5303, 136, 1556, 142508, 103687, 56, 93128, 13, 76980, 31577, 4527, 35773, 1294, 3299, 4488, 118664, 1884, 183278, 27875, 3714, 27489, 94418, 41170, 765, ...	[ 0.12744140625, 0.084716796875, 0.1549072265625, 0.045196533203125, 0.270751953125, 0.07208251953125, 0.2471923828125, 0.154296875, 0.1292724609375, 0.0728759765625, 0.23095703125, 0.2373046875, 0.1356201171875, 0.1552734375, 0.088134765625, 0.19873046875, 0.0310211181640625, 0.1372...	embed
21100762_c0	21100762	haskell	0	Title: How to pass command-line options to Alex in Cabal Problem title: How to pass command-line options to Alex in Cabal Tags: alex, haskell, cabal Problem: How to pass command-line options to Alex in Cabal In my current project I have a file Tokens.x that needs to be compiled to Tokens.hs by Alex. In my .cabal file I...	How to pass command-line options to Alex in Cabal How to pass command-line options to Alex in Cabal alex haskell cabal How Alex Cabal Tokens.x Tokens.hs Tokens How to pass command-line options to Alex in Cabal In my current project I have a file Tokens.x that needs to be compiled to Tokens.hs by Alex. In my .cabal file...	[ 0.01239013671875, 0.00135040283203125, 0.0159912109375, -0.0089111328125, -0.005950927734375, -0.007537841796875, 0.006561279296875, 0.0133056640625, 0.007080078125, 0.0010986328125, 0.00604248046875, -0.0172119140625, 0.0133056640625, 0.005767822265625, 0.002471923828125, 0.0128173828...	[ 11249, 27875, 75101, 2256, 50717, 47, 20984, 30438, 289, 23, 662, 425, 1556, 142508, 109524, 717, 84694, 127, 43581, 13452, 11435, 375, 5974, 408, 3571, 145870, 3789, 83279, 40059, 45367, 256, 7520, 28282, 15490, 20, 177, 35829, 36716, 527,...	[ 0.037353515625, 0.1221923828125, 0.1768798828125, 0.1260986328125, 0.2275390625, 0.115478515625, 0.2208251953125, 0.161865234375, 0.161376953125, 0.052337646484375, 0.0467529296875, 0.099853515625, 0.0694580078125, 0.152587890625, 0.193115234375, 0.1094970703125, 0.17236328125, 0.0...	embed
41491370_c0	41491370	haskell	0	Title: Access member of class instance from outside its definition Problem title: Access member of class instance from outside its definition Tags: haskell, monoids, typeclass Problem: Access member of class instance from outside its definition I have this type: newtype Mem s a = Mem { runMem :: s -> (a,s) } and I have...	Access member of class instance from outside its definition Access member of class instance from outside its definition haskell monoids typeclass outside Access Mem Monoid Access member of class instance from outside its definition I have this type: and I have to create an instance of monoid for this type, but to do so...	[ -0.0029144287109375, 0.00201416015625, 0.0235595703125, 0.0164794921875, 0.00133514404296875, 0.0264892578125, -0.0030059814453125, 0.0205078125, 0.0201416015625, -0.028564453125, 0.0014190673828125, 0.007781982421875, 0.00555419921875, 0.0108642578125, 0.00946044921875, -0.0224609375,...	[ 40266, 32786, 111, 18507, 110527, 1295, 50782, 6863, 80934, 1556, 142508, 22460, 30185, 10644, 67413, 17443, 77879, 532, 765, 903, 28282, 100, 4527, 163, 2676, 939, 136, 291, 9858, 71, 10, 211460, 1543, 2806, 1672, 20594, 450, 129745 ]	[ 0.22412109375, 0.25146484375, 0.11279296875, 0.205322265625, 0.24560546875, 0.1280517578125, 0.2098388671875, 0.0694580078125, 0.1663818359375, 0.1439208984375, 0.2432861328125, 0.19140625, 0.162109375, 0.1563720703125, 0.1624755859375, 0.168701171875, 0.1746826171875, 0.208984375,...	embed
48186231_c0	48186231	haskell	0	Title: What are the consequences of returning an IO action? Problem title: What are the consequences of returning an IO action? Tags: monads, io, io-monad, haskell Problem: What are the consequences of returning an IO action? In Haskell, the type constructor IO is a monad equipped with a return statement that lifts any...	What are the consequences of returning an IO action? What are the consequences of returning an IO action? monads io io-monad haskell What Hello What are the consequences of returning an IO action? In Haskell, the type constructor IO is a monad equipped with a return statement that lifts any expression to its IO version...	[ -0.01611328125, 0.00701904296875, -0.00106048583984375, 0.02294921875, 0.011962890625, 0.02392578125, 0.00531005859375, -0.0196533203125, -0.0177001953125, 0.005950927734375, 0.0059814453125, -0.041015625, -0.0068359375, 0.01409912109375, -0.007598876953125, -0.00970458984375, 0.0038...	[ 4865, 621, 70, 212678, 111, 30646, 214, 142, 17780, 22631, 2667, 712, 22995, 3796, 1556, 142508, 35378, 360, 20625, 10644, 64549, 748, 83, 10, 46979, 63805, 60520, 2499, 125195, 11389, 182747, 177691, 21771, 47, 3173, 831, 33022, 25632, 152...	[ 0.04229736328125, 0.0694580078125, 0.10986328125, 0.24609375, 0.0797119140625, 0.259033203125, 0.1160888671875, 0.055755615234375, 0.255615234375, 0.2095947265625, 0.108154296875, 0.1624755859375, 0.1915283203125, 0.05889892578125, 0.116455078125, 0.25634765625, 0.1033935546875, 0....	embed
9941199_c0	9941199	haskell	0	Title: how to translate Haskell into Scalaz? Problem title: how to translate Haskell into Scalaz? Tags: scala, scalaz, haskell, functor Problem: how to translate Haskell into Scalaz? One of my high school students and I are going to try to do a port of Haskell's Parsec parser combinator library into Scala. (It has the ...	how to translate Haskell into Scalaz? how to translate Haskell into Scalaz? scala scalaz haskell functor ParseError Haskell Scalaz Reply State Error Functor XXX scalaz.Functor ReplyFunctor ReplySU how to translate Haskell into Scalaz? One of my high school students and I are going to try to do a port of Haskell's Parse...	[ -0.0146484375, 0.01318359375, -0.0018768310546875, 0.0040283203125, 0.005401611328125, -0.00787353515625, -0.01019287109375, -0.037353515625, 0.007293701171875, -0.001556396484375, 0.00775146484375, -0.0137939453125, -0.0034942626953125, 0.01214599609375, -0.0169677734375, 0.0098876953...	[ 3642, 47, 3900, 19309, 20625, 142508, 3934, 152653, 1828, 32, 146232, 169, 1556, 7477, 18770, 2392, 184, 18468, 31611, 122813, 22836, 212059, 28670, 44585, 97249, 16395, 11192, 10696, 25921, 9790, 11469, 39797, 366, 2189, 22321, 35773, 11, 92...	[ 0.0858154296875, 0.04376220703125, 0.14697265625, 0.1741943359375, 0.1444091796875, 0.293701171875, 0.1744384765625, 0.199462890625, 0.2108154296875, 0.0113525390625, 0.193359375, 0.1524658203125, 0.1173095703125, 0.1138916015625, 0.1815185546875, 0.1024169921875, 0.04376220703125, ...	embed
24047364_c0	24047364	haskell	0	Title: How do I set up this package? Problem title: How do I set up this package? Tags: haskell, package, system Problem: How do I set up this package? This may be a bug, but I think I just need to set up my environment. I am on Ubuntu. I tried the package easyplot . It worked when I saved the plot to a file, but not t...	How do I set up this package? How do I set up this package? haskell package system How Prelude Graphics.EasyPlot X11 plot1.dat PNG test.png How do I set up this package? This may be a bug, but I think I just need to set up my environment. I am on Ubuntu. I tried the package easyplot . It worked when I saved the plot to...	[ 0.005828857421875, 0.0040283203125, 0.00909423828125, 0.0164794921875, -0.005645751953125, 0.006988525390625, 0.02099609375, -0.0244140625, 0.01226806640625, 0.031982421875, 0.004638671875, 0.0025482177734375, 0.0123291015625, 0.0084228515625, -0.002349853515625, 0.005767822265625, 0...	[ 11249, 5423, 1257, 903, 98169, 1556, 142508, 5426, 1914, 822, 112, 189682, 647, 162, 53, 683, 12631, 1193, 1662, 23577, 418, 5164, 8066, 3034, 128468, 54, 54608, 65998, 98, 116890, 37842, 23468, 105710, 79786, 57, 47, 11435, 959, 33949, 3...	[ 0.03961181640625, 0.12939453125, 0.1334228515625, 0.0743408203125, 0.222412109375, 0.0980224609375, 0.1937255859375, 0.1063232421875, 0.0787353515625, 0.15673828125, 0.1229248046875, 0.141845703125, 0.0229644775390625, 0.1290283203125, 0.0762939453125, 0.09521484375, 0.2125244140625,...	embed
58527107_c1	58527107	haskell	1	other functions and found that these operators are defined by the following definition: ghci> :t () () :: (Num a) => a -> a -> a However, when I run my code I get the following compilation error: Illegal polymorphic or qualified type: Num a => a -> a -> a Perhaps you intended to use RankNTypes or Rank2Types In the t...	other functions and found that these operators are defined by the following definition: ghci> :t () () :: (Num a) => a -> a -> a However, when I run my code I get the following compilation error: Illegal polymorphic or qualified type: Num a => a -> a -> a Perhaps you intended to use RankNTypes or Rank2Types In the t...	[ -0.002105712890625, -0.006988525390625, 0.0087890625, -0.00775146484375, 0.021240234375, 0.00628662109375, 0.01123046875, -0.01226806640625, 0.006683349609375, -0.025634765625, 0.00086212158203125, -0.037353515625, 0.016357421875, -0.03173828125, -0.01080322265625, -0.01177978515625, ...	[ 3789, 32354, 6097, 39933, 61924, 71, 80934, 31380, 318, 2740, 18, 80019, 1984, 839, 316, 10, 44357, 33079, 33306, 11675, 18151, 70, 25632, 98352, 1363, 18499, 891, 86966, 35874, 178851, 1771, 707, 217225, 10644, 52782, 181799, 179140, 4527, ...	[ 0.018890380859375, 0.155517578125, 0.0142669677734375, 0.2337646484375, 0.1395263671875, 0.0215606689453125, 0.143310546875, 0.131103515625, 0.177001953125, 0.1014404296875, 0.0804443359375, 0.07989501953125, 0.0189208984375, 0.03106689453125, 0.158935546875, 0.1328125, 0.01022338867...	embed
63991471_c0	63991471	haskell	0	Title: Communication between actions in Applicative style Problem title: Communication between actions in Applicative style Tags: haskell, applicative, ghci Problem: Communication between actions in Applicative style Haskell design patterns, writes this example: (+) <$> Nothing <> Just 10 <> Just 20 to justify that t...	Communication between actions in Applicative style Communication between actions in Applicative style haskell applicative ghci Communication Applicative Nothing Just Non Num Use FlexibleContexts When Maybe Communication between actions in Applicative style Haskell design patterns, writes this example: to justify that t...	[ -0.0137939453125, 0.0181884765625, -0.0019989013671875, 0.0262451171875, 0.01055908203125, 0.03076171875, 0.0003814697265625, 0.00131988525390625, 0.00131988525390625, -0.0035247802734375, 0.00604248046875, -0.032470703125, -0.005767822265625, 0.0238037109375, 0.001953125, -0.023559570...	[ 87398, 17721, 61972, 5659, 11048, 4935, 20623, 1556, 142508, 41816, 31380, 318, 182747, 9563, 3775, 52782, 36836, 180842, 2661, 22829, 14847, 83425, 20625, 4331, 103510, 33022, 27781, 1660, 40383, 84046, 36398, 23, 2967, 959, 2046, 903, 9969, ...	[ 0.2132568359375, 0.1605224609375, 0.1796875, 0.1204833984375, 0.1512451171875, 0.1083984375, 0.203369140625, 0.1400146484375, 0.2188720703125, 0.15869140625, 0.115966796875, 0.1575927734375, 0.119384765625, 0.05255126953125, 0.100341796875, 0.1387939453125, 0.060394287109375, 0.148...	embed
64503153_c0	64503153	haskell	0	Title: Examples with Haskell-src-exts package Problem title: Examples with Haskell-src-exts package Tags: haskell, parsing, haskell-src-exts Problem: Examples with Haskell-src-exts package I'm working with Haskell and I want to build a typechecker for this language. To do this I need a way to parse it and I know that H...	Examples with Haskell-src-exts package Examples with Haskell-src-exts package haskell parsing haskell-src-exts Examples Haskell-src-exts Examples with Haskell-src-exts package I'm working with Haskell and I want to build a typechecker for this language. To do this I need a way to parse it and I know that Haskell-src-ex...	[ 0.0257568359375, 0.0076904296875, 0.0147705078125, 0.0152587890625, 0.0103759765625, 0.0159912109375, -0.01507568359375, -0.0059814453125, -0.009033203125, -0.04638671875, 0.0034332275390625, -0.0400390625, 0.01171875, 0.0111083984375, 0.00634765625, 0.0194091796875, 0.0045166015625,...	[ 89536, 99726, 678, 20625, 142508, 19437, 3355, 933, 98169, 1556, 366, 6953, 7, 20697, 3444, 45367, 10644, 78292, 56, 903, 46876, 3917, 184, 442, 60813, 12447, 20016, 6528, 3642, 43240, 27781, 57143, 4358, 91067, 12877, 9803, 9790, 15700, 15...	[ 0.1583251953125, 0.0650634765625, 0.079833984375, 0.097412109375, 0.1964111328125, 0.197509765625, 0.14306640625, 0.1552734375, 0.1759033203125, 0.105224609375, 0.143798828125, 0.01043701171875, 0.007843017578125, 0.049346923828125, 0.0200958251953125, 0.045989990234375, 0.1416015625...	embed
10166640_c0	10166640	haskell	0	Title: Haskell: Why was `par` defined the way it was? Problem title: Haskell: Why was `par` defined the way it was? Tags: multithreading, par, haskell, parallel-processing Problem: Haskell: Why was `par` defined the way it was? par is declared as: par :: a -> b -> b Notice, that argument one is thrown away. In order to...	Haskell: Why was `par` defined the way it was? Haskell: Why was `par` defined the way it was? multithreading par haskell parallel-processing Haskell Why Haskell: Why was `par` defined the way it was? par is declared as: Notice, that argument one is thrown away. In order to use par you need to play tricks like using the...	[ -0.00482177734375, 0.01300048828125, 0.00347900390625, 0.003692626953125, 0.00537109375, 0.0166015625, -0.0076904296875, -0.0240478515625, 0.01055908203125, 0.00830078125, -0.0032806396484375, 0.005584716796875, -0.005462646484375, 0.0189208984375, -0.0024566650390625, -0.0049133300781...	[ 20625, 142508, 12, 44084, 2500, 61924, 71, 70, 3917, 442, 509, 1135, 3869, 65847, 11, 6238, 366, 1556, 95103, 63923, 83, 159978, 237, 24494, 10750, 1632, 104250, 16065, 12989, 4527, 3871, 11301, 88308, 17368, 5701, 125195, 48716, 20028, 600...	[ 0.13232421875, 0.25, 0.016754150390625, 0.1671142578125, 0.26416015625, 0.183837890625, 0.050140380859375, 0.05352783203125, 0.15478515625, 0.0535888671875, 0.0858154296875, 0.003631591796875, 0.08966064453125, 0.1214599609375, 0.019989013671875, 0.012847900390625, 0.253662109375, ...	embed
12737167_c0	12737167	haskell	0	Title: Haskell Recursion using an Accumulator Problem title: Haskell Recursion using an Accumulator Tags: accumulator, haskell, function, recursion Problem: Haskell Recursion using an Accumulator I'm trying to make a function that will look for 3 identical and adjacent numbers given a list, for a solver I am trying to ...	Haskell Recursion using an Accumulator Haskell Recursion using an Accumulator accumulator haskell function recursion an Haskell Recursion Accumulator Haskell Recursion using an Accumulator I'm trying to make a function that will look for 3 identical and adjacent numbers given a list, for a solver I am trying to impleme...	[ -0.0147705078125, 0.0169677734375, 0.003662109375, 0.014892578125, 0.01153564453125, 0.0220947265625, -0.0147705078125, -0.00180816650390625, 0.007720947265625, 0.00360107421875, 0.00946044921875, -0.00022220611572265625, 0.00665283203125, 0.007781982421875, 0.0167236328125, -0.0100708...	[ 20625, 142508, 165428, 42, 6889, 17368, 29899, 316, 129073, 142, 183278, 1290, 1556, 32354, 195625, 1830, 31577, 3249, 6713, 138, 31943, 123594, 101935, 34475, 5303, 3115, 814, 29479, 16188, 106, 271, 4216, 47, 2389, 5423, 86991, 34292, 40907...	[ 0.1534423828125, 0.2347412109375, 0.1414794921875, 0.1368408203125, 0.097412109375, 0.076416015625, 0.081787109375, 0.1539306640625, 0.2198486328125, 0.0198516845703125, 0.1953125, 0.1279296875, 0.1505126953125, 0.1617431640625, 0.209228515625, 0.08056640625, 0.065185546875, 0.0076...	embed
2292729_c1	2292729	haskell	1	maybe "<not present>" show $ filterElement (byUser userid) ps elemNamed :: String -> [Content] -> Element elemNamed name = head . filter ((==name).qName.elName) . onlyElems byUser :: String -> Element -> Bool byUser id e = maybe False (==id) (findAttr creator e) where creator = QName "OwnerUserId" Nothing Nothing Wher...	maybe "<not present>" show $ filterElement (byUser userid) ps elemNamed :: String -> [Content] -> Element elemNamed name = head . filter ((==name).qName.elName) . onlyElems byUser :: String -> Element -> Bool byUser id e = maybe False (==id) (findAttr creator e) where creator = QName "OwnerUserId" Nothing Nothing Wher...	[ -0.00101470947265625, 0.02392578125, 0.0087890625, -0.029541015625, 0.018798828125, 0.00628662109375, 0.00009632110595703125, -0.0172119140625, -0.01287841796875, -0.00872802734375, 0.01141357421875, 0.006011962890625, -0.0184326171875, -0.0164794921875, -0.00098419189453125, -0.004577...	[ 51139, 10869, 13379, 7639, 3650, 46312, 19929, 1272, 1062, 2189, 38937, 532, 24014, 88, 195, 163612, 71, 23351, 25352, 48325, 9351, 10336, 69112, 11627, 864, 4734, 7623, 390, 2460, 929, 3447, 28, 22225, 111607, 28848, 4448, 179505, 2396, 77...	[ 0.18212890625, 0.1619873046875, 0.255615234375, 0.12255859375, 0.1356201171875, 0.2044677734375, 0.16455078125, 0.0740966796875, 0.05767822265625, 0.12646484375, 0.125, 0.157470703125, 0.1163330078125, 0.00970458984375, 0.14892578125, 0.1466064453125, 0.082275390625, 0.09130859375,...	embed
37414984_c0	37414984	haskell	0	Title: switching component for ghc-mod Problem title: switching component for ghc-mod Tags: ghc-mod, haskell Problem: switching component for ghc-mod I have a project whose main cabal component is a library library hs-source-dirs: src ... and which also defines executable todo if !flag(example) Buildable: False ghc-opt...	switching component for ghc-mod switching component for ghc-mod ghc-mod haskell Buildable Wall DGHCJS_BROWSER Haskell2010 TodoDispatcher TodoStore TodoComponents Main.hs Configuring react-flux-1.0.3 EXCEPTION Could Use TodoViews.hs Locations x86_64-osx Cabal-1.22.8.0 TodoDispatcher.hs TodoDispatcher.lhs TodoDispatcher....	[ -0.01519775390625, 0.004058837890625, 0.01361083984375, -0.01458740234375, -0.005828857421875, -0.010986328125, -0.0142822265625, 0.0137939453125, 0.0225830078125, 0.0096435546875, 0.000507354736328125, -0.026611328125, 0.0194091796875, 0.018798828125, -0.00032806396484375, -0.01098632...	[ 101089, 214, 82761, 100, 31380, 238, 13415, 1556, 142508, 121137, 2886, 23706, 41877, 441, 64977, 20625, 11436, 26657, 44456, 4453, 165248, 10770, 54137, 12321, 127, 59994, 131300, 18026, 170179, 191147, 36836, 100474, 90788, 15276, 13307, 232, ...	[ 0.232421875, 0.072265625, 0.2479248046875, 0.045501708984375, 0.145263671875, 0.126220703125, 0.1766357421875, 0.09228515625, 0.1925048828125, 0.065185546875, 0.021820068359375, 0.1043701171875, 0.10382080078125, 0.010406494140625, 0.0963134765625, 0.090087890625, 0.119384765625, 0...	embed
39365402_c0	39365402	haskell	0	Title: Select which test to run with Hspec and stack Problem title: Select which test to run with Hspec and stack Tags: haskell-stack, hspec, haskell Problem: Select which test to run with Hspec and stack I've written a series of test, using the automatic spec discovery feature of Hspec. I'm also using stack as my buil...	Select which test to run with Hspec and stack Select which test to run with Hspec and stack haskell-stack hspec haskell Select Hspec Spec.hs Module0Spec.hs Module1Spec.hs Select which test to run with Hspec and stack I've written a series of test, using the automatic spec discovery feature of Hspec. I'm also using stac...	[ -0.005462646484375, -0.008544921875, -0.00506591796875, 0.006988525390625, -0.008056640625, 0.0019073486328125, -0.000518798828125, -0.005462646484375, 0.00787353515625, 0.00567626953125, 0.01092529296875, -0.000682830810546875, -0.001129150390625, 0.01519775390625, -0.0016021728515625, ...	[ 51620, 3034, 11675, 678, 572, 16711, 136, 177261, 1556, 142508, 590, 2594, 1096, 24990, 127, 63014, 2389, 47107, 59121, 36549, 101038, 48502, 103882, 60213, 17368, 237, 45367, 55516, 14364, 5, 7, 11435, 102158, 12921, 88996, 38415, 32562, 352...	[ 0.1175537109375, 0.2213134765625, 0.1492919921875, 0.1231689453125, 0.1605224609375, 0.26416015625, 0.0736083984375, 0.1986083984375, 0.1221923828125, 0.19140625, 0.080810546875, 0.070556640625, 0.096923828125, 0.1861572265625, 0.1195068359375, 0.0916748046875, 0.05224609375, 0.147...	embed
40959497_c0	40959497	haskell	0	Title: Are 'length' calls rewritten as constant ints by GHC? Problem title: Are 'length' calls rewritten as constant ints by GHC? Tags: haskell, ghc Problem: Are 'length' calls rewritten as constant ints by GHC? Just a random pondering looking at my numerous length calls, it occurs to me that surely...	Are 'length' calls rewritten as constant ints by GHC? Are 'length' calls rewritten as constant ints by GHC? haskell ghc GHC Are 'length' calls rewritten as constant ints by GHC? Just a random pondering looking at my numerous length calls, it occurs to me that surely the compiler can tell the length ...	[ 0.0087890625, 0.01513671875, 0.02001953125, 0.00093841552734375, -0.00060272216796875, 0.00628662109375, -0.01409912109375, 0.011474609375, 0.00469970703125, 0.000621795654296875, -0.01495361328125, -0.00689697265625, 0.005645751953125, 0.03076171875, 0.010009765625, 0.00537109375, 0...	[ 15901, 3768, 23986, 927, 11782, 7, 456, 5429, 75639, 237, 53697, 23, 933, 527, 73265, 32, 1556, 142508, 31380, 238, 390, 96759, 136300, 183851, 140909, 9077, 9969, 34759, 831, 14192, 2499, 5303, 45458, 566, 14311, 41159, 15005, 3900, 16082,...	[ 0.042694091796875, 0.0794677734375, 0.197021484375, 0.1700439453125, 0.2509765625, 0.0892333984375, 0.152587890625, 0.1767578125, 0.08636474609375, 0.06817626953125, 0.2125244140625, 0.1484375, 0.141845703125, 0.104248046875, 0.2264404296875, 0.001708984375, 0.115966796875, 0.24389...	embed
27192496_c0	27192496	haskell	0	Title: Parsec's satisfy equivalent in uu-parsinglib Problem title: Parsec's satisfy equivalent in uu-parsinglib Tags: haskell, uu-parsinglib, parser-combinators Problem: Parsec's satisfy equivalent in uu-parsinglib I am looking for a satisfy function like the one Parsec has. Something like: --The parser satis...	Parsec's satisfy equivalent in uu-parsinglib Parsec's satisfy equivalent in uu-parsinglib haskell uu-parsinglib parser-combinators Parsec Returns Char Bool Parser Insertion Parsec's satisfy equivalent in uu-parsinglib I am looking for a satisfy function like the one Parsec has. Something like: The only thing ...	[ -0.026123046875, 0.01422119140625, 0.0203857421875, 0.00421142578125, -0.01708984375, 0.01043701171875, 0.00555419921875, -0.018310546875, -0.01953125, 0.00567626953125, 0.00653076171875, -0.018798828125, 0.01495361328125, -0.009521484375, 0.007354736328125, -0.015380859375, -0.01562...	[ 2392, 39797, 3768, 40407, 53, 183234, 2051, 2500, 6953, 5612, 1556, 142508, 366, 2189, 19155, 22230, 173340, 21656, 2460, 929, 360, 16487, 100, 32354, 1884, 581, 4734, 13580, 14037, 915, 5464, 1814, 18929, 144570, 142, 1363, 237, 10750, 282...	[ 0.156494140625, 0.24365234375, 0.09881591796875, 0.2457275390625, 0.1453857421875, 0.1961669921875, 0.1661376953125, 0.132568359375, 0.0687255859375, 0.1549072265625, 0.084716796875, 0.201171875, 0.173828125, 0.20263671875, 0.1458740234375, 0.01531982421875, 0.154052734375, 0.11743...	embed
19301146_c0	19301146	haskell	0	Title: Constructing an identical lens Problem title: Constructing an identical lens Tags: lenses, haskell Problem: Constructing an identical lens I am trying to create a Lens from a getter and a setter which I got from another Lens : import Control.Lens idL :: Lens s t a b -> Lens s t a b idL l = lens (\s -> view l s) ...	Constructing an identical lens Constructing an identical lens lenses haskell Control.Lens Constructing Lens Expected Getting Actual Accessor Constructing an identical lens I am trying to create a Lens from a getter and a setter which I got from another Lens : However, it fails with an obscure (for me) error: What am I ...	[ -0.01129150390625, 0.0093994140625, -0.01031494140625, -0.00885009765625, 0.017822265625, -0.0059814453125, -0.01422119140625, -0.0167236328125, -0.01373291015625, -0.048095703125, 0.0081787109375, 0.037353515625, 0.0030975341796875, -0.018798828125, -0.0181884765625, 0.00201416015625,...	[ 1657, 36716, 214, 31943, 6827, 3098, 7, 142, 96, 47754, 1556, 142508, 27131, 866, 1755, 18226, 60075, 13, 210732, 100582, 40266, 748, 31577, 28282, 1295, 2046, 720, 136, 88685, 4163, 15700, 35782, 160608, 18499, 444, 20594, 44691, 62822, 75...	[ 0.06597900390625, 0.185791015625, 0.03326416015625, 0.1778564453125, 0.1458740234375, 0.2137451171875, 0.0804443359375, 0.0447998046875, 0.1285400390625, 0.102783203125, 0.112548828125, 0.18896484375, 0.15966796875, 0.0982666015625, 0.127197265625, 0.201171875, 0.05474853515625, 0....	embed
21991164_c0	21991164	haskell	0	Title: In Haskell, how can I replace an ASCII character sub-string in a ByteString? Problem title: In Haskell, how can I replace an ASCII character sub-string in a ByteString? Tags: bytestring, haskell Problem: In Haskell, how can I replace an ASCII character sub-string in a ByteString? In Haskell , how can I replace a...	In Haskell, how can I replace an ASCII character sub-string in a ByteString? In Haskell, how can I replace an ASCII character sub-string in a ByteString? bytestring haskell Haskell ASCII ByteString Data.ByteString.Search In Haskell, how can I replace an ASCII character sub-string in a ByteString? In Haskell , how can I...	[ 0.0016326904296875, 0.00933837890625, 0.01226806640625, 0.0264892578125, -0.0032196044921875, 0.00653076171875, 0.00106048583984375, -0.004547119140625, -0.003631591796875, 0.0439453125, 0.00970458984375, -0.0133056640625, -0.013916015625, 0.013916015625, -0.016845703125, -0.0075988769...	[ 360, 20625, 142508, 3642, 831, 91995, 125429, 10001, 62816, 1614, 9, 91693, 3311, 67, 71713, 214, 23, 390, 1556, 11809, 75358, 221175, 87, 11249, 4527, 32354, 79315, 10750, 48322, 51339, 674, 10422, 96760, 47, 23351, 161740, 16750, 4420 ]	[ 0.049896240234375, 0.1207275390625, 0.246826171875, 0.07049560546875, 0.05645751953125, 0.2119140625, 0.097412109375, 0.22509765625, 0.183349609375, 0.224853515625, 0.0198516845703125, 0.2373046875, 0.08929443359375, 0.154541015625, 0.197021484375, 0.1070556640625, 0.021331787109375,...	embed
8726279_c0	8726279	haskell	0	Title: Error building haskell llvm bindings on Linux Problem title: Error building haskell llvm bindings on Linux Tags: haskell, llvm, llvm-3.0 Problem: Error building haskell llvm bindings on Linux I built llvm 3.0, downloaded from here . I did: ./configure CC=gcc CXX=g++ --enable-shared sudo make -j5 -s install Next,...	Error building haskell llvm bindings on Linux Error building haskell llvm bindings on Linux haskell llvm llvm-3.0 Error Linux llvm-3.0 Error building haskell llvm bindings on Linux I built llvm 3.0, downloaded from here . I did: Next, I cloned the LLVM bindings from here . I am trying: But I get: I am running Linux Min...	[ -0.0096435546875, 0.014404296875, -0.01422119140625, -0.0146484375, 0.015869140625, -0.01068115234375, 0.0036773681640625, -0.0164794921875, -0.0078125, 0.007049560546875, -0.00048828125, -0.04296875, 0.019775390625, 0.0142822265625, 0.010009765625, 0.0169677734375, -0.00424194335937...	[ 212059, 33976, 1556, 142508, 96, 3723, 39, 128239, 7, 98, 29908, 132265, 88303, 17596, 7026, 297, 3688, 20450, 99954, 47599, 31577, 444, 51042, 62802, 7911, 3137, 3181, 85540, 47, 116890, 4541, 77495, 527, 73265, 83, 91532, 120883, 37842, 1...	[ 0.1668701171875, 0.194580078125, 0.161376953125, 0.2467041015625, 0.0633544921875, 0.21044921875, 0.208740234375, 0.2164306640625, 0.0736083984375, 0.091552734375, 0.1964111328125, 0.2442626953125, 0.11572265625, 0.2091064453125, 0.052093505859375, 0.0079345703125, 0.021148681640625,...	embed
68193099_c0	68193099	haskell	0	Title: What do bracketed double dots mean in Haskell? Problem title: What do bracketed double dots mean in Haskell? Tags: notation, haskell Problem: What do bracketed double dots mean in Haskell? I understand that .. can be used in ranges--i.e., [1..3] == [1,2,3] , and [10..] is an infinite list starting at 10. However...	What do bracketed double dots mean in Haskell? What do bracketed double dots mean in Haskell? notation haskell Colog What Haskell HasLog What do bracketed double dots mean in Haskell? I understand that .. can be used in ranges--i.e., [1..3] == [1,2,3] , and [10..] is an infinite list starting at 10. However, recently I...	[ 0.00022411346435546875, -0.0135498046875, -0.004150390625, 0.007598876953125, 0.00958251953125, 0.0133056640625, -0.007781982421875, -0.011474609375, 0.004852294921875, -0.004638671875, -0.00010251998901367188, -0.01031494140625, -0.01141357421875, -0.004730224609375, -0.006988525390625,...	[ 4865, 1620, 27853, 297, 41929, 54, 933, 29459, 23, 20625, 142508, 110, 22062, 1556, 313, 14071, 113972, 28219, 1468, 831, 11814, 37457, 68252, 96386, 69112, 155761, 963, 54241, 5303, 72134, 99, 4068, 86681, 6097, 46132, 237, 5, 10666, 24927...	[ 0.04974365234375, 0.1971435546875, 0.2073974609375, 0.0972900390625, 0.203369140625, 0.190673828125, 0.150390625, 0.15673828125, 0.0750732421875, 0.15771484375, 0.25439453125, 0.0889892578125, 0.017608642578125, 0.1163330078125, 0.043182373046875, 0.1917724609375, 0.224609375, 0.05...	embed
29777127_c0	29777127	haskell	0	Title: How to call multiple functions within the code in haskell Problem title: How to call multiple functions within the code in haskell Tags: haskell Problem: How to call multiple functions within the code in haskell I would like to call multiple functions from within the code, meaning that by executing the .hs file,...	How to call multiple functions within the code in haskell How to call multiple functions within the code in haskell haskell How para1 para2 How to call multiple functions within the code in haskell I would like to call multiple functions from within the code, meaning that by executing the .hs file, all functions named ...	[ -0.011474609375, -0.000202178955078125, -0.0091552734375, 0.026123046875, -0.0103759765625, 0.0062255859375, 0.0194091796875, -0.0240478515625, 0.01324462890625, -0.031982421875, 0.00653076171875, -0.033935546875, 0.0030670166015625, 0.02001953125, -0.00836181640625, -0.01226806640625,...	[ 11249, 47, 11782, 48716, 32354, 7, 28032, 18151, 23, 1556, 142508, 121, 418, 304, 1884, 1295, 71924, 5, 127, 11435, 756, 24, 4806, 1221, 37842, 5201, 678, 3884, 71713, 866, 19, 43257, 96704, 4488, 6528, 82428, 18, 759, 97249, 10763, 306...	[ 0.08172607421875, 0.0350341796875, 0.22119140625, 0.265869140625, 0.28271484375, 0.1080322265625, 0.18798828125, 0.20263671875, 0.08172607421875, 0.18310546875, 0.2381591796875, 0.127197265625, 0.05657958984375, 0.1292724609375, 0.037384033203125, 0.0941162109375, 0.163330078125, 0...	embed
64738061_c0	64738061	haskell	0	Title: Haskell find and replace values from list using map Problem title: Haskell find and replace values from list using map Tags: haskell Problem: Haskell find and replace values from list using map I have a list of lists in single chars like: [["a"],["b"],["c"],["d"]] , and I have a map for example [("a", "A"), ("b"...	Haskell find and replace values from list using map Haskell find and replace values from list using map haskell list map Haskell Haskell find and replace values from list using map I have a list of lists in single chars like: [["a"],["b"],["c"],["d"]] , and I have a map for example [("a", "A"), ("b", "B")] , I would li...	[ -0.00592041015625, 0.005523681640625, 0.00164794921875, -0.000698089599609375, -0.01263427734375, 0.010009765625, 0, 0.0169677734375, -0.00124359130859375, 0.0223388671875, 0.01251220703125, -0.01611328125, 0.0167236328125, 0.005218505859375, -0.0169677734375, 0.0025787353515625, 0.0...	[ 20625, 142508, 7413, 136, 91995, 142424, 1295, 5303, 17368, 22288, 1556, 87, 765, 11001, 21441, 1884, 11, 275, 238, 71, 27781, 571, 2806, 80854, 23, 450, 14858, 22799, 34292, 678, 100, 87388, 47143, 152028, 36917, 284, 3444, 2046, 4420, 9...	[ 0.1585693359375, 0.21533203125, 0.18603515625, 0.06689453125, 0.256591796875, 0.2340087890625, 0.179443359375, 0.2406005859375, 0.08795166015625, 0.253662109375, 0.17138671875, 0.001220703125, 0.0191650390625, 0.14453125, 0.149169921875, 0.06787109375, 0.035064697265625, 0.07006835...	embed
10055947_c0	10055947	haskell	0	Title: Sort a list of pairs using sort Haskell Problem title: Sort a list of pairs using sort Haskell Tags: haskell Problem: Sort a list of pairs using sort Haskell I have a function (frequency) which that counts how many times each distinct value in a list occurs in that list. For example, frequency "ababca" should re...	Sort a list of pairs using sort Haskell Sort a list of pairs using sort Haskell haskell sort Haskell Party Green Red Blue Sort a list of pairs using sort Haskell I have a function (frequency) which that counts how many times each distinct value in a list occurs in that list. For example, should return: This works fine ...	[ 0.00112152099609375, 0.00153350830078125, -0.0106201171875, -0.017333984375, -0.015380859375, -0.00946044921875, -0.01495361328125, -0.024169921875, -0.001739501953125, -0.004913330078125, -0.00958251953125, 0.005615234375, 0.0169677734375, -0.00640869140625, -0.013671875, -0.028320312...	[ 53666, 10, 5303, 111, 80836, 7, 17368, 12096, 20625, 142508, 1556, 31016, 15497, 6096, 22928, 32354, 12176, 944, 27771, 54529, 3642, 5941, 20028, 12638, 117781, 34292, 74918, 27781, 30646, 43240, 5885, 3871, 47, 5117, 12830, 28032, 104851, 14...	[ 0.26806640625, 0.005035400390625, 0.21435546875, 0.0235137939453125, 0.25390625, 0.048980712890625, 0.0843505859375, 0.262451171875, 0.1414794921875, 0.25146484375, 0.14111328125, 0.2171630859375, 0.148681640625, 0.134521484375, 0.1787109375, 0.1534423828125, 0.125, 0.130859375, ...	embed
50520423_c0	50520423	haskell	0	Title: Haskell - how to use if then else in list comprehension? Problem title: Haskell - how to use if then else in list comprehension? Tags: haskell Problem: Haskell - how to use if then else in list comprehension? I wish to generate a list of points from rolling two dice. If the two dice show the same value then the ...	Haskell - how to use if then else in list comprehension? Haskell - how to use if then else in list comprehension? haskell Haskell Haskell - how to use if then else in list comprehension? I wish to generate a list of points from rolling two dice. If the two dice show the same value then the output points will become (i,...	[ -0.000896453857421875, -0.004119873046875, 0.00665283203125, -0.009765625, 0.010009765625, 0.0184326171875, -0.004638671875, 0.0211181640625, -0.002044677734375, 0.00860595703125, 0.006561279296875, -0.0213623046875, 0.0027923583984375, 0.01092529296875, -0.01904296875, 0.0169677734375...	[ 20625, 142508, 3642, 4527, 2174, 7068, 37076, 5303, 46683, 3220, 6889, 23, 1556, 32599, 139392, 26847, 1295, 21972, 214, 6626, 13747, 4263, 7639, 5701, 34292, 140992, 24209, 14, 18151, 30957, 527, 73265, 53418, 375, 5974, 41206 ]	[ 0.100830078125, 0.2149658203125, 0.049835205078125, 0.11181640625, 0.1959228515625, 0.173828125, 0.2191162109375, 0.185546875, 0.1083984375, 0.1234130859375, 0.041259765625, 0.03765869140625, 0.080810546875, 0.047637939453125, 0.128662109375, 0.1561279296875, 0.05682373046875, 0.10...	embed
51113460_c1	51113460	haskell	1	course undesirable behaviour. Another issue is that this timeout is implemented after a new msg is received by a client. Instead I would like to the timeout to only be implemented when the game is in a particular state - that is a state in which the player represented by this particular thread is the next player to ac...	course undesirable behaviour. Another issue is that this timeout is implemented after a new msg is received by a client. Instead I would like to the timeout to only be implemented when the game is in a particular state - that is a state in which the player represented by this particular thread is the next player to ac...	[ -0.01708984375, -0.00885009765625, -0.005706787109375, -0.01123046875, 0.01556396484375, -0.0012054443359375, -0.000453948974609375, 0.01116943359375, 0.00982666015625, -0.03515625, 0.013427734375, 0.0032501220703125, -0.01904296875, 0.0020294189453125, -0.00830078125, 0.00503540039062...	[ 15411, 9232, 12915, 2886, 224833, 31089, 1733, 6056, 29479, 3525, 68163, 177, 75204, 23282, 1884, 4734, 297, 3229, 6712, 17311, 11341, 58585, 33636, 86997, 11737, 27992, 22631, 22, 23, 2684, 1632, 5701, 20596, 187016, 15504, 35509, 35431, 137...	[ 0.1839599609375, 0.06976318359375, 0.1622314453125, 0.01025390625, 0.177978515625, 0.055328369140625, 0.2293701171875, 0.216796875, 0.1343994140625, 0.0067138671875, 0.050018310546875, 0.055877685546875, 0.080322265625, 0.1297607421875, 0.03375244140625, 0.01080322265625, 0.018112182...	embed
51292955_c0	51292955	haskell	0	Title: Inherit typeclass with a function with the same name Problem title: Inherit typeclass with a function with the same name Tags: haskell Problem: Inherit typeclass with a function with the same name I have a inheritance of typeclasses with a function with the same name, but different types. Code: class Equatable a...	Inherit typeclass with a function with the same name Inherit typeclass with a function with the same name haskell Inherit Equatable Bool Entity type1 type2 TKey Inherit typeclass with a function with the same name I have a inheritance of typeclasses with a function with the same name, but different types. Code: Error: ...	[ 0.010986328125, 0.00897216796875, 0.0113525390625, 0.0201416015625, -0.0014801025390625, -0.01165771484375, 0.0028076171875, 0.01275634765625, 0.0032958984375, -0.0262451171875, -0.01312255859375, 0.00933837890625, -0.0014190673828125, 0.006011962890625, 0.0037384033203125, 0.006164550...	[ 360, 3334, 217, 10644, 67413, 678, 32354, 70, 5701, 9351, 10, 1556, 142508, 241, 90065, 2886, 2460, 929, 16511, 2481, 418, 304, 384, 162429, 765, 23, 7154, 111, 90, 4, 1284, 12921, 52895, 5, 28864, 212059, 31577, 40226, 67, 11737, 18151...	[ 0.10028076171875, 0.2269287109375, 0.1478271484375, 0.1943359375, 0.246337890625, 0.1014404296875, 0.18701171875, 0.024627685546875, 0.140869140625, 0.122314453125, 0.006561279296875, 0.1337890625, 0.2041015625, 0.0255126953125, 0.1309814453125, 0.0804443359375, 0.06170654296875, 0...	embed
73831759_c0	73831759	haskell	0	Title: Haskell Patterns not matched: (_:_) _ Problem title: Haskell Patterns not matched: (_:_) _ Tags: pattern-matching, haskell, guard-clause Problem: Haskell Patterns not matched: (_:_) _ I'm writing a function that takes an input a list, creates sublists, and retrieves n elements that it outputs into a new list. I'...	Haskell Patterns not matched: (_:_) _ Haskell Patterns not matched: (_:_) _ pattern-matching haskell guard-clause Haskell Patterns _:_ Empty Pattern Haskell Patterns not matched: (_:_) _ I'm writing a function that takes an input a list, creates sublists, and retrieves n elements that it outputs into a new list. I'm wr...	[ -0.0228271484375, 0.0230712890625, 0.0277099609375, -0.0107421875, -0.00152587890625, -0.001434326171875, -0.020263671875, -0.0174560546875, 0.01953125, 0.042236328125, 0.02392578125, -0.0220947265625, 0.0025787353515625, 0.000018596649169921875, -0.0022735595703125, -0.003997802734375...	[ 20625, 142508, 9876, 22766, 959, 14858, 297, 454, 103510, 98753, 1556, 56050, 18347, 4032, 31678, 32562, 32354, 107730, 5303, 1614, 6562, 97351, 653, 80854, 140992, 7, 96819, 34292, 13695, 18499, 8335, 3055, 1779, 12, 152, 101, 42485, 31089 ]	[ 0.132080078125, 0.21337890625, 0.1561279296875, 0.1591796875, 0.1771240234375, 0.2064208984375, 0.1131591796875, 0.040740966796875, 0.1881103515625, 0.1700439453125, 0.1185302734375, 0.2188720703125, 0.057891845703125, 0.0018310546875, 0.060089111328125, 0.0999755859375, 0.1025390625...	embed
24958878_c0	24958878	haskell	0	Title: Number of times that a word appears in a list of words haskell Problem title: Number of times that a word appears in a list of words haskell Tags: haskell, list, matrix, tuples Problem: Number of times that a word appears in a list of words haskell I just started programming in Haskell and I want to create a fun...	Number of times that a word appears in a list of words haskell Number of times that a word appears in a list of words haskell haskell list matrix tuples Number Number of times that a word appears in a list of words haskell I just started programming in Haskell and I want to create a function takes a list of words and a...	[ 0.0057373046875, -0.003875732421875, -0.0079345703125, 0.01214599609375, 0.01226806640625, -0.005035400390625, -0.002899169921875, 0.008544921875, 0.011474609375, -0.033935546875, -0.024658203125, -0.0240478515625, 0.01544189453125, 0.031494140625, -0.017822265625, 0.0091552734375, 0...	[ 103332, 111, 20028, 450, 2565, 135179, 23, 5303, 34153, 1556, 142508, 50944, 425, 370, 99726, 56037, 20625, 3444, 28282, 32354, 51776, 136, 120820, 15504, 33938, 104192, 30646, 74918, 5941, 32565, 8705, 21771, 3917, 32562, 1632, 100, 42, 7794...	[ 0.1478271484375, 0.06219482421875, 0.220947265625, 0.046539306640625, 0.1995849609375, 0.1741943359375, 0.081298828125, 0.1553955078125, 0.1810302734375, 0.1441650390625, 0.195068359375, 0.1602783203125, 0.0753173828125, 0.09716796875, 0.16357421875, 0.102294921875, 0.1190185546875, ...	embed
27711396_c0	27711396	haskell	0	Title: Indentation with Let Statements Problem title: Indentation with Let Statements Tags: haskell Problem: Indentation with Let Statements I'm afraid I'm tapped out on understanding this and the let block in general. The following code: splitWith tf xs \|(null xs) = [[]] \|((length xs) == 1) = [xs] \|otherwise = let tpl...	Indentation with Let Statements Indentation with Let Statements haskell Indentation Statements Indentation with Let Statements I'm afraid I'm tapped out on understanding this and the let block in general. The following code: Creates this syntax error: This happened after I got rid of tabs in Sublime Text 2 and put spac...	[ 0.00022125244140625, 0.01220703125, -0.0107421875, 0.0191650390625, -0.00299072265625, 0.01446533203125, 0.010986328125, -0.01153564453125, 0.0159912109375, -0.00775146484375, -0.006103515625, -0.01031494140625, -0.01068115234375, 0.01806640625, 0.0186767578125, -0.0019989013671875, ...	[ 360, 555, 22062, 678, 10842, 22836, 9035, 1556, 142508, 158200, 2633, 46389, 25632, 18151, 151313, 903, 6002, 86531, 18499, 31351, 20928, 8273, 150, 282, 24129, 116, 32628, 23, 13315, 77336, 2203, 24092, 7103, 1022, 44691 ]	[ 0.0482177734375, 0.1466064453125, 0.08721923828125, 0.081787109375, 0.2254638671875, 0.201904296875, 0.050048828125, 0.0911865234375, 0.168212890625, 0.035858154296875, 0.177490234375, 0.1634521484375, 0.006683349609375, 0.07379150390625, 0.042633056640625, 0.0166015625, 0.0438842773...	embed
44320709_c0	44320709	haskell	0	Title: Generating "expected" style error messages from Happy Problem title: Generating "expected" style error messages from Happy Tags: happy, haskell Problem: Generating "expected" style error messages from Happy As Happy generates a state machine and runs through it upon parsing, I presume when hi...	Generating "expected" style error messages from Happy Generating "expected" style error messages from Happy happy haskell Happy Generating Generating "expected" style error messages from Happy As Happy generates a state machine and runs through it upon parsing, I presume when hitting a parse error i...	[ 0.01263427734375, 0.006134033203125, -0.00714111328125, 0.019775390625, -0.00830078125, 0.00927734375, -0.01019287109375, -0.005126953125, 0.007354736328125, 0.00433349609375, 0.0150146484375, 0.002593994140625, -0.00144195556640625, -0.01092529296875, 0.001983642578125, 0.013793945312...	[ 155370, 1916, 83613, 13, 89829, 20623, 18499, 89914, 1295, 32506, 17723, 1556, 142508, 1301, 139392, 11341, 36279, 127877, 8305, 366, 5962, 184, 19048, 14192, 2367, 47, 84694, 509, 41206, 214, 109954, 2046, 903, 4677, 2831, 2448, 1810, 31913,...	[ 0.160400390625, 0.02410888671875, 0.08154296875, 0.1162109375, 0.1138916015625, 0.162841796875, 0.1866455078125, 0.1036376953125, 0.0191497802734375, 0.2103271484375, 0.1917724609375, 0.07958984375, 0.1805419921875, 0.01031494140625, 0.145751953125, 0.0921630859375, 0.0987548828125, ...	embed
48857586_c0	48857586	haskell	0	Title: Haskell circular definition interrupt Problem title: Haskell circular definition interrupt Tags: functional-programming, haskell Problem: Haskell circular definition interrupt Hello everyone i came over a curious thing trying to learn circular definition in Haskell. We have these two cases: module Main where mgo...	Haskell circular definition interrupt Haskell circular definition interrupt functional-programming haskell Haskell Main Haskell circular definition interrupt Hello everyone i came over a curious thing trying to learn circular definition in Haskell. We have these two cases: For the code above i get this output [1,1,1,1,...	[ 0.01171875, -0.0091552734375, 0.00665283203125, 0.00775146484375, -0.00823974609375, -0.0025787353515625, 0.00579833984375, 0.0130615234375, -0.00335693359375, -0.0277099609375, -0.00173187255859375, -0.00982666015625, 0.00701904296875, 0.028564453125, 0.0234375, 0.00020313262939453125...	[ 20625, 142508, 115339, 80934, 206735, 123309, 28966, 1556, 12321, 35378, 30309, 645, 193844, 13580, 31577, 30698, 23, 6626, 50218, 18151, 36917, 2046, 903, 140992, 68252, 4, 418, 76172, 28219, 15400, 1284, 502, 2661, 78662, 44851, 9167, 3674, ...	[ 0.1383056640625, 0.2294921875, 0.252197265625, 0.16455078125, 0.294189453125, 0.1470947265625, 0.12548828125, 0.1337890625, 0.08203125, 0.0207366943359375, 0.06060791015625, 0.046112060546875, 0.0677490234375, 0.03656005859375, 0.032806396484375, 0.05828857421875, 0.003936767578125, ...	embed
30691346_c0	30691346	haskell	0	Title: Pattern matching on variant without deconstructing in Haskell Problem title: Pattern matching on variant without deconstructing in Haskell Tags: haskell, pattern-matching Problem: Pattern matching on variant without deconstructing in Haskell In the following code, the function disp is defined by de-constructing ...	Pattern matching on variant without deconstructing in Haskell Pattern matching on variant without deconstructing in Haskell haskell pattern-matching Pattern Haskell Sum Expr Name Show Pattern matching on variant without deconstructing in Haskell In the following code, the function disp is defined by de-constructing Sum...	[ 0.006500244140625, -0.0002498626708984375, 0.0159912109375, 0.018310546875, 0.0030059814453125, 0.007110595703125, -0.043701171875, 0.0013885498046875, 0.0054931640625, -0.0177001953125, 0.040771484375, -0.03515625, -0.004486083984375, 0.00439453125, 0.009521484375, 0.01422119140625, ...	[ 9876, 22766, 14858, 214, 98, 20117, 15490, 8, 2271, 36716, 20625, 142508, 1556, 103510, 98753, 36335, 60075, 42, 15757, 17367, 25632, 18151, 32354, 58580, 61924, 390, 876, 501, 109312, 122905, 1916, 2967, 2301, 18, 3871, 136, 442, 10644, 39...	[ 0.149169921875, 0.1163330078125, 0.2261962890625, 0.044677734375, 0.0673828125, 0.226318359375, 0.134033203125, 0.19970703125, 0.06195068359375, 0.1168212890625, 0.13232421875, 0.232177734375, 0.1190185546875, 0.1859130859375, 0.23193359375, 0.16015625, 0.06292724609375, 0.08380126...	embed
5477164_c0	5477164	haskell	0	Title: Haskell understanding flow Problem title: Haskell understanding flow Tags: haskell Problem: Haskell understanding flow I'm new to haskell, I was trying to write a string split function delim = '\|' splitStr::[Char]->[[Char]]->[[Char]] splitStr list y \| sL > 0 && sL < length(list) = splitStr (drop (sL+1) list) [su...	Haskell understanding flow Haskell understanding flow haskell Haskell Char Main Haskell understanding flow I'm new to haskell, I was trying to write a string split function However, the above code always returns the String in reverse order changing from y++[subList] to [subList]++y still gives the same result. I know t...	[ -0.0103759765625, 0.0179443359375, 0.00396728515625, 0.0078125, -0.0250244140625, 0.0225830078125, 0.0023956298828125, 0.00836181640625, -0.005218505859375, 0.0162353515625, 0.02099609375, 0.006103515625, 0.0003204345703125, 0.004119873046875, -0.004119873046875, 0.0072021484375, 0.0...	[ 20625, 142508, 100094, 86608, 1556, 21656, 12321, 3525, 31577, 33022, 79315, 65450, 32354, 70, 36917, 18151, 11343, 30646, 23351, 214, 23, 39531, 184, 12989, 151134, 1295, 113, 37223, 22144, 154663, 47, 53, 7464, 76199, 5701, 16750, 11522, 15...	[ 0.1485595703125, 0.197998046875, 0.140869140625, 0.242431640625, 0.15087890625, 0.122314453125, 0.08544921875, 0.04296875, 0.0457763671875, 0.03985595703125, 0.203369140625, 0.2261962890625, 0.1478271484375, 0.040985107421875, 0.0792236328125, 0.10546875, 0.1158447265625, 0.1367187...	embed
11158023_c0	11158023	haskell	0	Title: How to use GADTs in Hugs Problem title: How to use GADTs in Hugs Tags: hugs, haskell, ghc, gadt, functional-programming Problem: How to use GADTs in Hugs I'd like to write a Haskell program that uses GADTs interactively on a platform not supported by GHCi (namely, GNU/Linux on mipsel). The problem is, the constr...	How to use GADTs in Hugs How to use GADTs in Hugs hugs haskell ghc gadt functional-programming How GADTs Hugs Term Lit Pair How to use GADTs in Hugs I'd like to write a Haskell program that uses GADTs interactively on a platform not supported by GHCi (namely, GNU/Linux on mipsel). The problem is, the construct that can...	[ 0.004364013671875, 0.01397705078125, -0.005462646484375, 0.005889892578125, 0.00168609619140625, -0.00762939453125, -0.025146484375, -0.00982666015625, -0.00087738037109375, -0.0311279296875, 0.007171630859375, -0.0546875, -0.0130615234375, -0.0164794921875, 0.0047607421875, 0.00994873...	[ 11249, 47, 4527, 23749, 41072, 7, 23, 99926, 35875, 1556, 142508, 31380, 238, 914, 13384, 123309, 28966, 2994, 27668, 1342, 1884, 33022, 20625, 1528, 212398, 13651, 8060, 527, 73265, 14, 165132, 150040, 324, 254, 1428, 2967, 64549, 11814, 6...	[ 0.088623046875, 0.044647216796875, 0.1632080078125, 0.1744384765625, 0.2310791015625, 0.14453125, 0.10711669921875, 0.2100830078125, 0.1859130859375, 0.0858154296875, 0.1844482421875, 0.0540771484375, 0.030059814453125, 0.1168212890625, 0.173828125, 0.106689453125, 0.0867919921875, ...	embed
15898329_c0	15898329	haskell	0	Title: How to use ByteStrings with QuickTest in DocTest? Problem title: How to use ByteStrings with QuickTest in DocTest? Tags: quickcheck, haskell, doctest Problem: How to use ByteStrings with QuickTest in DocTest? How do I define the Arbitrary instance (as stated here ) when using doctest and quickcheck? Doctest and ...	How to use ByteStrings with QuickTest in DocTest? How to use ByteStrings with QuickTest in DocTest? quickcheck haskell doctest How ByteStrings QuickTest DocTest Arbitrary ByteString Bool How to use ByteStrings with QuickTest in DocTest? How do I define the Arbitrary instance (as stated here ) when using doctest and qui...	[ 0.0174560546875, 0.00034332275390625, 0.0029144287109375, -0.007659912109375, -0.007049560546875, 0.00677490234375, 0.01416015625, -0.00653076171875, -0.0101318359375, 0.026123046875, -0.002105712890625, -0.0079345703125, 0.00469970703125, 0.002655029296875, -0.00775146484375, 0.011169...	[ 11249, 4527, 3311, 67, 71713, 5180, 678, 89038, 111337, 23, 29048, 47, 63773, 78292, 1556, 142508, 51584, 6954, 242522, 1294, 214, 2460, 929, 61924, 70, 110527, 17368, 136, 30438, 289, 5423, 151552, 84797, 14364, 109921, 13315, 33342, 1884, ...	[ 0.0672607421875, 0.1396484375, 0.08642578125, 0.148193359375, 0.1851806640625, 0.151611328125, 0.08648681640625, 0.1483154296875, 0.259521484375, 0.03131103515625, 0.1776123046875, 0.010284423828125, 0.0914306640625, 0.20361328125, 0.04022216796875, 0.1724853515625, 0.164306640625, ...	embed
22783637_c0	22783637	haskell	0	Title: Triggering a documentation update for a Hackage package Problem title: Triggering a documentation update for a Hackage package Tags: haskell, hackage Problem: Triggering a documentation update for a Hackage package I have two releases which were accidentally uploaded before some of their dependencies: http://hac...	Triggering a documentation update for a Hackage package Triggering a documentation update for a Hackage package haskell hackage Triggering Hackage Triggering a documentation update for a Hackage package I have two releases which were accidentally uploaded before some of their dependencies: http://hackage.haskell.org/pa...	[ -0.0025634765625, 0.025390625, -0.0001983642578125, -0.0040283203125, 0.006591796875, 0.01324462890625, -0.029296875, -0.0078125, 0.00051116943359375, 0.0301513671875, 0.0107421875, -0.0208740234375, -0.0032958984375, -0.00099945068359375, 0.01348876953125, -0.00848388671875, 0.02368...	[ 4699, 21407, 209806, 28350, 100, 52922, 4588, 98169, 1556, 142508, 85526, 765, 6626, 54452, 27998, 70622, 8108, 42548, 117538, 139509, 10557, 29102, 1434, 13569, 34814, 289, 32108, 23320, 5, 97109, 1478, 50986, 137656, 102107, 4989, 214521, 959...	[ 0.1844482421875, 0.168212890625, 0.262939453125, 0.1893310546875, 0.02630615234375, 0.2308349609375, 0.1741943359375, 0.1922607421875, 0.1378173828125, 0.2281494140625, 0.2001953125, 0.00341796875, 0.09716796875, 0.1650390625, 0.17626953125, 0.1865234375, 0.0892333984375, 0.1851806...	embed
48211978_c0	48211978	haskell	0	Title: Haskell function composition and fmap f Problem title: Haskell function composition and fmap f Tags: haskell Problem: Haskell function composition and fmap f I have two simple examples: 1) xt function (what is this?) Prelude> :t fmap fmap :: Functor f => (a -> b) -> f a -> f b Prelude> :{ Prelude\| f::Int->Int Pr...	Haskell function composition and fmap f Haskell function composition and fmap f haskell Haskell Prelude Functor f::Int Haskell function composition and fmap f I have two simple examples: 1) xt function (what is this?) 2) xq function (via composition) xq function I get through composition return(f(x)) . But what does th...	[ 0.002532958984375, -0.0162353515625, 0.0021209716796875, 0.001495361328125, -0.00592041015625, 0.021484375, 0.025146484375, 0.01068115234375, -0.00299072265625, 0.0037841796875, -0.01611328125, -0.01348876953125, 0.009033203125, 0.01116943359375, 0.008056640625, -0.0260009765625, 0.0...	[ 20625, 142508, 32354, 166577, 136, 1238, 62346, 1556, 1914, 822, 112, 28670, 18770, 4153, 18, 6626, 8781, 27781, 1022, 124409, 83, 903, 4958, 864, 3459, 2046, 8305, 30646, 420, 132, 425, 29459, 60212 ]	[ 0.143798828125, 0.25048828125, 0.1826171875, 0.2379150390625, 0.06646728515625, 0.1925048828125, 0.2464599609375, 0.1270751953125, 0.053466796875, 0.1611328125, 0.0701904296875, 0.083740234375, 0.0867919921875, 0.0228118896484375, 0.163818359375, 0.0181427001953125, 0.03814697265625,...	embed
65843114_c0	65843114	haskell	0	Title: Why is ap available inside Applicative? Problem title: Why is ap available inside Applicative? Tags: haskell Problem: Why is ap available inside Applicative? I am trying to implement MonadUnliftIO for Snap and analyzing Snap classes. I discovered that ap is used for implementing Applicative while ap requires Mon...	Why is ap available inside Applicative? Why is ap available inside Applicative? haskell Why Applicative Functor Monad Snap Why is ap available inside Applicative? I am trying to implement MonadUnliftIO for Snap and analyzing Snap classes. I discovered that ap is used for implementing Applicative while ap requires Monad...	[ -0.0025177001953125, 0.02392578125, 0.002166748046875, 0.017822265625, 0.0133056640625, 0.0159912109375, 0.005462646484375, -0.00592041015625, 0.015869140625, -0.024169921875, 0.0128173828125, -0.019287109375, -0.0240478515625, 0.01422119140625, 0.0014495849609375, -0.004241943359375, ...	[ 44084, 83, 1747, 19882, 46132, 5659, 11048, 4935, 1556, 142508, 28670, 18770, 60331, 71, 121190, 31577, 29479, 14256, 104501, 17780, 7968, 61112, 134053, 11814, 100, 12960, 144570, 33342, 1884, 40956, 17569, 570, 5036, 959, 7722, 33022, 6044, ...	[ 0.1387939453125, 0.059051513671875, 0.228271484375, 0.181884765625, 0.1588134765625, 0.1572265625, 0.1998291015625, 0.2080078125, 0.099853515625, 0.2210693359375, 0.09857177734375, 0.1063232421875, 0.1566162109375, 0.1337890625, 0.198974609375, 0.0081787109375, 0.1363525390625, 0.0...	embed
26538595_c0	26538595	haskell	0	Title: more efficient type-level computations using type families? Problem title: more efficient type-level computations using type families? Tags: functional-dependencies, ghc, haskell, type-families, type-level-computation Problem: more efficient type-level computations using type families? Based on the article in th...	more efficient type-level computations using type families? more efficient type-level computations using type families? functional-dependencies ghc haskell type-families type-level-computation type more efficient type-level computations using type families? Based on the article in the Monad Reader, Issue #8, I've coded...	[ 0.001312255859375, -0.01611328125, -0.0103759765625, 0.00183868408203125, -0.0172119140625, -0.00921630859375, -0.032470703125, -0.0157470703125, 0.00946044921875, -0.01190185546875, -0.0089111328125, -0.015869140625, 0.01019287109375, 0.01263427734375, -0.01953125, 0.026611328125, 0...	[ 1286, 93766, 10644, 67919, 181135, 5256, 17368, 87143, 123309, 105254, 13, 31380, 238, 1556, 142508, 69128, 277, 7077, 60331, 71, 122636, 223317, 18151, 1257, 29806, 4153, 42539, 360, 1462, 2481, 104192, 28670, 262, 26885, 60457, 24641, 9458, ...	[ 0.0819091796875, 0.1748046875, 0.2393798828125, 0.17822265625, 0.172607421875, 0.0343017578125, 0.027496337890625, 0.20703125, 0.1199951171875, 0.1248779296875, 0.0222625732421875, 0.0491943359375, 0.051727294921875, 0.08563232421875, 0.197265625, 0.1697998046875, 0.0204010009765625,...	embed
22034736_c0	22034736	haskell	0	Title: zipWith (++) an arbitrary number of lists Problem title: zipWith (++) an arbitrary number of lists Tags: haskell Problem: zipWith (++) an arbitrary number of lists I have to zip n lists with (++). I have found no better way to do that define this operator on lists: (+++) = zipWith (\x y -> x ++ " " ++ y) There i...	zipWith (++) an arbitrary number of lists zipWith (++) an arbitrary number of lists haskell xn-2 xn-1 zipWith (++) an arbitrary number of lists I have to zip n lists with (++). I have found no better way to do that define this operator on lists: There is a better solution? After Markus1189 answer , I formulate a more g...	[ -0.024169921875, -0.00787353515625, -0.0087890625, 0.0172119140625, -0.014892578125, 0.0255126953125, -0.000911712646484375, 0.005615234375, 0.013671875, -0.006866455078125, -0.0032196044921875, -0.010498046875, 0.01806640625, -0.010498046875, 0.00390625, 0.00946044921875, 0.00555419...	[ 68330, 194583, 37223, 61799, 1294, 14012, 111, 5303, 1556, 142508, 1022, 19, 5428, 5759, 7, 765, 653, 678, 11522, 61924, 903, 39933, 98, 29806, 111246, 18949, 10, 4537, 14602, 32316, 32354, 1884, 3293, 1528, 11814, 15, 86409, 27781, 501, ...	[ 0.2509765625, 0.30810546875, 0.25634765625, 0.12890625, 0.04107666015625, 0.071044921875, 0.0165557861328125, 0.228271484375, 0.11474609375, 0.2021484375, 0.02459716796875, 0.0156402587890625, 0.0865478515625, 0.07537841796875, 0.0770263671875, 0.0516357421875, 0.0802001953125, 0.1...	embed
22430160_c1	22430160	haskell	1	: (def my-vec-of-length-2 [0 1]) (defmacro compile-time-vec-length-check [x n] (let [x @(resolve x)] (assert (= n (count x))))) (compile-time-vec-length-check my-vec-of-length-2 3) Now this will fail, because I'm expecting a vector of length 3, but the underlying vector is of length 2. I got this information at Compile...	: (def my-vec-of-length-2 [0 1]) (defmacro compile-time-vec-length-check [x n] (let [x @(resolve x)] (assert (= n (count x))))) (compile-time-vec-length-check my-vec-of-length-2 3) Now this will fail, because I'm expecting a vector of length 3, but the underlying vector is of length 2. I got this information at Compile...	[ -0.0216064453125, 0.0225830078125, -0.021240234375, 0.025146484375, 0.005615234375, 0.02001953125, -0.01611328125, -0.0022430419921875, -0.01953125, -0.030517578125, -0.024658203125, -0.0264892578125, 0.00112152099609375, -0.00689697265625, 0.013916015625, -0.0035858154296875, -0.000...	[ 759, 35259, 4390, 23986, 5428, 2389, 112, 420, 15322, 9969, 1340, 6032, 78292, 86918, 162, 33657, 71013, 1022, 58875, 8439, 35782, 41206, 173, 18770, 140909, 138, 1284, 1379, 538, 111, 787, 4677, 15612, 19055, 95, 73, 1297, 3403, 49725, 3...	[ 0.09307861328125, 0.197998046875, 0.125244140625, 0.04449462890625, 0.1429443359375, 0.00341796875, 0.0157012939453125, 0.010955810546875, 0.1328125, 0.0980224609375, 0.12646484375, 0.111083984375, 0.179443359375, 0.042388916015625, 0.029510498046875, 0.1873779296875, 0.0333251953125...	embed
70483497_c0	70483497	haskell	0	Title: How to use integerFromInt from GHC.Num.Integer in Haskell Problem title: How to use integerFromInt from GHC.Num.Integer in Haskell Tags: cabal, haskell Problem: How to use integerFromInt from GHC.Num.Integer in Haskell I'm new in Haskell. I'm trying to use integerFromInt from GHC.Num.Integer. I tried to write in...	How to use integerFromInt from GHC.Num.Integer in Haskell How to use integerFromInt from GHC.Num.Integer in Haskell cabal haskell GHC.Num.Integer integer-gmp-1.0.3.0 How Haskell Variable Integer Could Perhaps GHC.Integer How to use integerFromInt from GHC.Num.Integer in Haskell I'm new in Haskell. I'm trying to use int...	[ -0.0152587890625, -0.0125732421875, -0.0015716552734375, 0.004119873046875, 0.0162353515625, 0.02783203125, -0.005340576171875, -0.01373291015625, -0.014404296875, -0.0284423828125, -0.0079345703125, -0.047119140625, -0.00872802734375, 0.01458740234375, 0.0142822265625, -0.006225585937...	[ 11249, 4527, 892, 1505, 168407, 4153, 18, 1295, 527, 73265, 5, 839, 316, 67, 23, 20625, 142508, 109524, 1556, 177, 2676, 102107, 132265, 84572, 2886, 44401, 191147, 181799, 3525, 31577, 37842, 33022, 15490, 24927, 959, 70820, 1984, 360, 330...	[ 0.050933837890625, 0.145751953125, 0.1435546875, 0.19873046875, 0.27001953125, 0.1851806640625, 0.1956787109375, 0.116455078125, 0.1153564453125, 0.2215576171875, 0.010467529296875, 0.09912109375, 0.175537109375, 0.1689453125, 0.06964111328125, 0.1737060546875, 0.25048828125, 0.229...	embed
70826544_c0	70826544	haskell	0	Title: How to interact with process in haskell Problem title: How to interact with process in haskell Tags: haskell, process Problem: How to interact with process in haskell I compiled the following program -- Alice.hs main = do putStrLn "Hello" l <- getLine putStrLn $ "you said " ++ l I want to communicate with Alice ...	How to interact with process in haskell How to interact with process in haskell haskell process System.IO System.Process How Alice.hs Hello Bob.hs Alice Nothing How to interact with process in haskell I compiled the following program I want to communicate with Alice in another program: Bob.hs. My failed attempt is: Bob...	[ -0.01202392578125, 0.0002269744873046875, -0.0029754638671875, 0.031982421875, -0.004058837890625, 0.0079345703125, 0.0047607421875, -0.00555419921875, -0.00750732421875, -0.0186767578125, -0.017578125, 0.023193359375, -0.01165771484375, 0.024658203125, 0.0091552734375, 0.0142822265625...	[ 11249, 47, 78974, 678, 9433, 23, 1556, 142508, 12353, 17780, 10752, 26531, 66083, 5, 127, 7, 35378, 25027, 182747, 375, 5974, 25632, 1528, 3444, 127219, 15700, 165523, 81887, 62163, 179933, 8108, 28412 ]	[ 0.081787109375, 0.07086181640625, 0.2476806640625, 0.2056884765625, 0.250244140625, 0.0941162109375, 0.18212890625, 0.251953125, 0.110107421875, 0.1446533203125, 0.0880126953125, 0.1441650390625, 0.1929931640625, 0.031707763671875, 0.1280517578125, 0.016204833984375, 0.2301025390625,...	embed
8945096_c0	8945096	haskell	0	Title: Any nice tools for untying knots in Haskell? Problem title: Any nice tools for untying knots in Haskell? Tags: circular-reference, haskell Problem: Any nice tools for untying knots in Haskell? I've a data structure with several different types of internal circular linking, making it infinite in the sense of say ...	Any nice tools for untying knots in Haskell? Any nice tools for untying knots in Haskell? circular-reference haskell Any Haskell Read Show Data.Serialize Any nice tools for untying knots in Haskell? I've a data structure with several different types of internal circular linking, making it infinite in the sense of say t...	[ -0.003021240234375, 0.01031494140625, -0.00897216796875, 0.014404296875, 0.001678466796875, -0.00921630859375, 0.01434326171875, -0.01708984375, 0.00193023681640625, -0.038330078125, -0.0164794921875, -0.01513671875, -0.000713348388671875, 0.044189453125, 0.00909423828125, -0.009460449...	[ 26267, 72977, 100, 51, 939, 214, 17075, 30591, 20625, 142508, 28541, 115339, 239879, 1556, 4764, 17367, 11809, 294, 25435, 119066, 23, 2053, 45646, 40368, 12921, 52895, 70796, 3126, 54241, 105823, 75101, 49041, 88996, 3365, 96091, 6044, 3934, ...	[ 0.10028076171875, 0.2066650390625, 0.03448486328125, 0.0672607421875, 0.16357421875, 0.06292724609375, 0.13134765625, 0.18310546875, 0.124267578125, 0.2410888671875, 0.01171875, 0.1593017578125, 0.2015380859375, 0.1224365234375, 0.1102294921875, 0.15625, 0.057525634765625, 0.019180...	embed
65347506_c0	65347506	haskell	0	Title: I am getting this error when trying to install Cardano-Node Problem title: I am getting this error when trying to install Cardano-Node Tags: cabal, cardano, haskell Problem: I am getting this error when trying to install Cardano-Node Code signals: non-upgradeable, Cardano-Node, Could, __0, Win32-network-0.1.0.0,...	I am getting this error when trying to install Cardano-Node I am getting this error when trying to install Cardano-Node cabal cardano haskell non-upgradeable Cardano-Node Could __0 Win32-network-0.1.0.0 __1 Win32-network base-4.14.1.0 installed-4.14.1.0 base-4.12.0.0 base-4.11.1.0 base-4.11.0.0 base-4.10.1.0 base-4.10....	[ -0.006072998046875, -0.0084228515625, 0.01708984375, 0.005889892578125, 0.004791259765625, -0.01544189453125, -0.014892578125, -0.0135498046875, -0.002349853515625, 0.00360107421875, 0.005615234375, -0.0419921875, 0.007354736328125, -0.0206298828125, -0.01300048828125, -0.019775390625,...	[ 444, 20949, 903, 18499, 3229, 31577, 20600, 23660, 3922, 9, 5021, 112, 109524, 20596, 1556, 142508, 351, 2037, 44286, 2886, 191147, 5953, 2389, 17686, 6460, 1179, 18244, 102014, 99929, 3647, 11565, 2592, 102107, 15654, 14556, 156982, 73011, 1...	[ 0.012908935546875, 0.05218505859375, 0.1058349609375, 0.2086181640625, 0.007781982421875, 0.1160888671875, 0.1881103515625, 0.224365234375, 0.270263671875, 0.0258941650390625, 0.20849609375, 0.1812744140625, 0.2330322265625, 0.1806640625, 0.1287841796875, 0.2261962890625, 0.128662109...	embed
56414329_c1	56414329	haskell	1	at https://nixos.org/nixos/nix-pills/nixpkgs-overriding-packages.html or would this work differently due to using the nixpkgs.pkgs.haskell.packages.${compiler}.callPackage function? Edit: Thanks to @sara's answer I now have: { nixpkgs ? import <nixpkgs> {}, compiler ? "ghc864" } : let gitchapter = nixpkgs.pkgs.haskell...	at https://nixos.org/nixos/nix-pills/nixpkgs-overriding-packages.html or would this work differently due to using the nixpkgs.pkgs.haskell.packages.${compiler}.callPackage function? Edit: Thanks to @sara's answer I now have: { nixpkgs ? import <nixpkgs> {}, compiler ? "ghc864" } : let gitchapter = nixpkgs.pkgs.haskell...	[ -0.0179443359375, -0.0027923583984375, 0.0128173828125, -0.01251220703125, 0.00640869140625, 0.00787353515625, 0.010986328125, -0.016357421875, 0.000705718994140625, 0.0005950927734375, -0.003997802734375, -0.01190185546875, -0.0014495849609375, 0.007568359375, 0.0203857421875, -0.0072...	[ 93, 47436, 425, 121934, 7, 38988, 9405, 5465, 416, 6238, 29102, 52467, 903, 4488, 12921, 300, 10557, 142508, 58875, 34759, 85763, 205956, 4588, 32354, 28884, 5036, 765, 24927, 9969, 9486, 238, 189864, 62270, 124453, 720, 20370, 3571, 304, 1...	[ 0.1246337890625, 0.1827392578125, 0.154052734375, 0.21337890625, 0.083251953125, 0.179443359375, 0.20751953125, 0.160888671875, 0.23095703125, 0.1259765625, 0.247314453125, 0.14306640625, 0.05450439453125, 0.05572509765625, 0.11279296875, 0.1314697265625, 0.053192138671875, 0.23291...	embed
52707869_c0	52707869	haskell	0	Title: How to deal with typeclass constraint in class member function Problem title: How to deal with typeclass constraint in class member function Tags: typeclass, haskell Problem: How to deal with typeclass constraint in class member function GHCI complains about the types of k and a inside of (k * a, k * b) . My gue...	How to deal with typeclass constraint in class member function How to deal with typeclass constraint in class member function typeclass haskell How Num Point Vector How to deal with typeclass constraint in class member function GHCI complains about the types of k and a inside of (k * a, k * b) . My guess is it doesn't ...	[ 0.005645751953125, -0.00830078125, 0.01611328125, 0.00010585784912109375, 0.0052490234375, -0.000331878662109375, -0.0245361328125, -0.01068115234375, 0.003875732421875, -0.0181884765625, -0.0157470703125, -0.04443359375, 0.000484466552734375, 0.0031280517578125, -0.027587890625, -0.01...	[ 11249, 47, 35142, 678, 10644, 67413, 158, 2816, 4288, 18507, 32786, 32354, 1556, 142508, 52782, 41097, 2609, 18770, 23, 41877, 17304, 186992, 52895, 111, 472, 136, 10, 46132, 92, 661, 876, 57767, 442, 22027, 18, 3714, 83, 3642, 40140, 189...	[ 0.09228515625, 0.0303955078125, 0.1358642578125, 0.10986328125, 0.20947265625, 0.260009765625, 0.10137939453125, 0.1976318359375, 0.125, 0.1702880859375, 0.213134765625, 0.146240234375, 0.145751953125, 0.2373046875, 0.19677734375, 0.18505859375, 0.1697998046875, 0.10693359375, 0....	embed
53570385_c0	53570385	haskell	0	Title: function composition in natural order in haskell Problem title: function composition in natural order in haskell Tags: haskell, functional-programming Problem: function composition in natural order in haskell We all know and love/hate composition from right to left : (.) :: (b -> c) -> (a -> b) -> a -> c What is...	function composition in natural order in haskell function composition in natural order in haskell haskell functional-programming function composition in natural order in haskell We all know and love/hate composition from right to left : What is the "most standard" operator (as in some sort of common library) for natura...	[ 0.01104736328125, 0.0032958984375, 0.01519775390625, 0.0206298828125, 0.00537109375, 0.006256103515625, -0.0037994384765625, 0.0028839111328125, 0.0107421875, -0.032958984375, -0.00311279296875, 0.0118408203125, 0.014892578125, -0.01287841796875, 0.0125732421875, -0.01495361328125, 0...	[ 32354, 166577, 23, 6083, 12989, 1556, 142508, 123309, 28966, 5161, 528, 67, 1295, 7108, 47, 25737, 840, 18, 5570, 39933, 39210, 35773, 64, 133, 2480, 4537, 10422, 142424, 19882, 5609, 9351, 6044, 48909, 4552, 27983, 59121, 17932, 2965, 1230...	[ 0.218994140625, 0.261474609375, 0.0484619140625, 0.2039794921875, 0.206787109375, 0.148681640625, 0.2432861328125, 0.171875, 0.119140625, 0.114990234375, 0.145751953125, 0.08154296875, 0.176513671875, 0.15869140625, 0.157470703125, 0.154296875, 0.0789794921875, 0.083740234375, 0....	embed
20644882_c0	20644882	haskell	0	Title: Why doesn't GHC complain when number constant out of range Problem title: Why doesn't GHC complain when number constant out of range Tags: haskell Problem: Why doesn't GHC complain when number constant out of range GHC silently ignores out-of-range bits in numerical constants. This behavior led me to w...	Why doesn't GHC complain when number constant out of range Why doesn't GHC complain when number constant out of range haskell Why GHC Word8 Why doesn't GHC complain when number constant out of range GHC silently ignores out-of-range bits in numerical constants. This behavior led me to wrestle with a rather st...	[ 0.0108642578125, -0.007171630859375, 0.012939453125, 0.011474609375, 0.00970458984375, 0.018798828125, -0.02490234375, 0.01806640625, 0.01507568359375, 0.031982421875, -0.0089111328125, -0.02783203125, 0.006866455078125, 0.01202392578125, -0.0096435546875, 0.005340576171875, 0.008789...	[ 44084, 22027, 3768, 18, 527, 73265, 186992, 3229, 14012, 53697, 1810, 111, 37457, 1556, 142508, 22543, 1019, 103967, 124962, 7, 4390, 94250, 4785, 23, 54744, 123166, 56644, 114453, 54608, 3714, 143434, 127892, 69112, 757, 20788, 8999, 15400, ...	[ 0.11572265625, 0.052490234375, 0.03216552734375, 0.0909423828125, 0.122314453125, 0.230712890625, 0.228515625, 0.05474853515625, 0.1683349609375, 0.240966796875, 0.1566162109375, 0.14990234375, 0.2305908203125, 0.160400390625, 0.2332763671875, 0.15966796875, 0.2215576171875, 0.1418...	embed
21597543_c1	21597543	haskell	1	16 + fromHex c2 fromHex = fromIntegral . digitToInt . BS.w2c rHexBSL :: BSL.ByteString -> BSL.ByteString rHexBSL = rHex' (BSL.null, BSL.empty, BSL.cons, BSL.head, BSL.tail, fromHex) rHexBS :: BS.ByteString -> BS.ByteString rHexBS = rHex' (BS.null, BS.empty, BS.cons, BS.head, BS.tail, fromHex) So I pass all needed funct...	16 + fromHex c2 fromHex = fromIntegral . digitToInt . BS.w2c rHexBSL :: BSL.ByteString -> BSL.ByteString rHexBSL = rHex' (BSL.null, BSL.empty, BSL.cons, BSL.head, BSL.tail, fromHex) rHexBS :: BS.ByteString -> BS.ByteString rHexBS = rHex' (BS.null, BS.empty, BS.cons, BS.head, BS.tail, fromHex) So I pass all needed funct...	[ -0.00830078125, -0.01043701171875, -0.0062255859375, -0.0233154296875, -0.01251220703125, 0.00009250640869140625, 0.00186920166015625, -0.007415771484375, -0.001312255859375, -0.0179443359375, 0.01104736328125, -0.0098876953125, 0.0164794921875, 0.0014495849609375, -0.0021209716796875, ...	[ 611, 997, 1295, 841, 3355, 501, 304, 2203, 67, 5739, 141, 153939, 7763, 4153, 18, 84145, 434, 238, 1690, 571, 30508, 1984, 335, 75358, 71713, 33079, 25, 139550, 33548, 25553, 31251, 46741, 20429, 27875, 756, 44841, 32354, 105237, 1286, 20...	[ 0.198486328125, 0.18359375, 0.2423095703125, 0.191162109375, 0.29833984375, 0.03411865234375, 0.16455078125, 0.045684814453125, 0.1529541015625, 0.1065673828125, 0.0115966796875, 0.1363525390625, 0.1422119140625, 0.061187744140625, 0.06982421875, 0.05218505859375, 0.01025390625, 0....	embed
41915463_c1	41915463	haskell	1	Nothing) return h main:: IO () main = C8.putStrLn "connecting, please wait" >> connectMud "aardwolf.org" "4000" >>= BS.hGetContents >>= C8.putStrLn The only difference between these two short scripts is that one is using Data.ByteString and the other one Data.ByteString.Lazy . The lazy version works fine but the stric...	Nothing) return h main:: IO () main = C8.putStrLn "connecting, please wait" >> connectMud "aardwolf.org" "4000" >>= BS.hGetContents >>= C8.putStrLn The only difference between these two short scripts is that one is using Data.ByteString and the other one Data.ByteString.Lazy . The lazy version works fine but the stric...	[ 0.0004596710205078125, 0.025146484375, -0.0027008056640625, 0.004425048828125, 0.0186767578125, 0.025390625, 0.0108642578125, -0.0078125, 0.0196533203125, -0.036376953125, 0.0157470703125, -0.022705078125, -0.0081787109375, -0.002960205078125, -0.00933837890625, -0.0213623046875, 0.0...	[ 182747, 16, 30646, 1096, 5201, 17780, 2203, 313, 1019, 7077, 71713, 19, 135457, 214, 22936, 40485, 37067, 10685, 71, 11, 5861, 25400, 420, 1478, 68037, 84145, 127, 724, 126, 11935, 25352, 4734, 60212, 17721, 6097, 6626, 16610, 26499, 83, ...	[ 0.270751953125, 0.0306243896484375, 0.2198486328125, 0.1673583984375, 0.1707763671875, 0.2076416015625, 0.014739990234375, 0.006591796875, 0.1712646484375, 0.0811767578125, 0.1429443359375, 0.0428466796875, 0.1766357421875, 0.103515625, 0.126953125, 0.245361328125, 0.18115234375, 0...	embed
8393223_c0	8393223	haskell	0	Title: Haskell case statement Problem title: Haskell case statement Tags: input, switch-statement, haskell, case Problem: Haskell case statement I have code something like this main :: [[String]] -> IO () main st = do answer <- getLine case answer of "q" -> return () "load" x -> main $ parseCSV $ readFile x This doesn'...	Haskell case statement Haskell case statement input switch-statement haskell case Haskell sample.csv test.csv helloworld.csv Haskell case statement I have code something like this This doesn't work, so my question is how can I use case switch statement for something of changing input For example in my code I want the i...	[ -0.0103759765625, -0.004608154296875, -0.015869140625, 0.0111083984375, 0.01214599609375, -0.00035858154296875, -0.0000629425048828125, 0.01129150390625, 0.00154876708984375, -0.0206298828125, -0.0033111572265625, -0.013427734375, -0.01239013671875, -0.01324462890625, -0.0213623046875, ...	[ 20625, 142508, 7225, 63805, 107730, 101089, 61340, 1556, 121413, 4439, 334, 3034, 33600, 31, 32554, 18151, 9844, 1884, 22027, 18, 4488, 3642, 831, 4527, 100, 111, 151134, 3444, 38937, 8096, 72367, 1284, 1221, 53697, 15549, 117414, 178308, 237...	[ 0.1287841796875, 0.225341796875, 0.2352294921875, 0.1983642578125, 0.2054443359375, 0.255859375, 0.14501953125, 0.1221923828125, 0.1307373046875, 0.061798095703125, 0.13720703125, 0.09686279296875, 0.0677490234375, 0.05987548828125, 0.0799560546875, 0.1287841796875, 0.027496337890625...	embed
32831287_c1	32831287	haskell	1	cons ex = check ex where check :: Monad m => Expr -> m (Maybe (Tok Expr, Expr)) check ex = case ex of Id s -> return $ Just (This (Id s), Apply []) Apply (x:xs) -> do mst <- check x return $ fmap (\(a, b) -> (Over a, b)) mst Which is using data Tok as kind of a Zipper breadcrumb (or at least I see it that way), to indi...	cons ex = check ex where check :: Monad m => Expr -> m (Maybe (Tok Expr, Expr)) check ex = case ex of Id s -> return $ Just (This (Id s), Apply []) Apply (x:xs) -> do mst <- check x return $ fmap (\(a, b) -> (Over a, b)) mst Which is using data Tok as kind of a Zipper breadcrumb (or at least I see it that way), to indi...	[ 0.0113525390625, 0.0072021484375, 0.0002460479736328125, 0.0091552734375, 0.01446533203125, 0.01385498046875, -0.007415771484375, -0.0150146484375, 0.015869140625, -0.0223388671875, 0.006256103515625, -0.006011962890625, 0.01177978515625, -0.00072479248046875, 0.0103759765625, 0.015441...	[ 158, 7, 1119, 2203, 12765, 7440, 60331, 71, 347, 60075, 42, 618, 685, 7225, 24799, 91, 30646, 9563, 73243, 5659, 538, 271, 1022, 3650, 1238, 62346, 876, 156673, 17368, 2053, 66196, 237, 8562, 9315, 8079, 179967, 47913, 6492, 117414, 3642,...	[ 0.2071533203125, 0.1114501953125, 0.2578125, 0.05340576171875, 0.244384765625, 0.128173828125, 0.15869140625, 0.1412353515625, 0.10601806640625, 0.085205078125, 0.1419677734375, 0.06817626953125, 0.1878662109375, 0.130615234375, 0.11669921875, 0.08087158203125, 0.1092529296875, 0.0...	embed
12999683_c0	12999683	haskell	0	Title: Using Fractions in Haskell Problem title: Using Fractions in Haskell Tags: rational-numbers, haskell, fractions Problem: Using Fractions in Haskell Continuing from the previous question: Power Series in Haskell I am trying to write the power series in Haskell, e^x = 1 + x + x^2/2! + x^3/3! + ... such that it wil...	Using Fractions in Haskell Using Fractions in Haskell rational-numbers haskell fractions a the Using Fractions Haskell Integral Ambiguous Fractional Num Probable Using Fractions in Haskell Continuing from the previous question: Power Series in Haskell I am trying to write the power series in Haskell, such that it will ...	[ -0.005523681640625, 0.0027618408203125, -0.00628662109375, -0.0205078125, 0.002838134765625, 0.002777099609375, 0.004730224609375, 0.01611328125, -0.0069580078125, -0.0167236328125, 0.00506591796875, 0.0108642578125, 0.0169677734375, -0.0213623046875, 0.003692626953125, 0.03662109375, ...	[ 345, 6953, 7868, 10763, 7, 23, 20625, 142508, 168487, 2606, 1297, 1556, 175921, 10, 204681, 10250, 12282, 52782, 1250, 275, 2886, 17170, 64876, 31577, 33022, 14537, 36549, 442, 140992, 21771, 765, 32354, 3688, 43240, 15490, 64, 144810, 15403,...	[ 0.12060546875, 0.02557373046875, 0.2469482421875, 0.210205078125, 0.037078857421875, 0.059326171875, 0.1405029296875, 0.256103515625, 0.12060546875, 0.085205078125, 0.0830078125, 0.12158203125, 0.21630859375, 0.0258331298828125, 0.07440185546875, 0.051666259765625, 0.09967041015625, ...	embed
34197567_c0	34197567	haskell	0	Title: What is the equivalent of Haskell's scanl in Java's streams? Problem title: What is the equivalent of Haskell's scanl in Java's streams? Tags: java, haskell, java-stream Problem: What is the equivalent of Haskell's scanl in Java's streams? As this question asked for python, what is the equiva...	What is the equivalent of Haskell's scanl in Java's streams? What is the equivalent of Haskell's scanl in Java's streams? java haskell java-stream What Haskell Java What is the equivalent of Haskell's scanl in Java's streams? As this question asked for python, what is the equivalent of Haskell's sca...	[ -0.01312255859375, 0.02978515625, -0.00421142578125, 0.0194091796875, 0.0037078857421875, 0.01141357421875, -0.007598876953125, -0.004425048828125, -0.005523681640625, -0.03515625, 0.01708984375, 0.010009765625, 0.0179443359375, 0.005645751953125, -0.01397705078125, -0.005706787109375,...	[ 4865, 183234, 20625, 142508, 3768, 44954, 141, 23, 41925, 75973, 79, 330, 1556, 9, 86429, 83, 17198, 50828, 2367, 2965, 1257, 2060, 4527, 678, 183278, 1290, 13695, 42850, 16750, 50339, 5303, 70163, 42, 44136, 11814, 56282, 442, 95103, 4488,...	[ 0.09814453125, 0.167724609375, 0.156982421875, 0.266845703125, 0.054656982421875, 0.1761474609375, 0.1866455078125, 0.04248046875, 0.2490234375, 0.2000732421875, 0.09527587890625, 0.1864013671875, 0.12451171875, 0.0264434814453125, 0.2132568359375, 0.015472412109375, 0.05337524414062...	embed
35801111_c1	35801111	haskell	1	el "li" $ dynText =<< mapDyn (T.unpack . decodeUtf8) m return () I feel like there should be a way to do this with tickLossy to send pings with timeout, like some dynamic which returns websockets and then reconnects if a ping goes a certain amount of time without a response? But I'm having trouble envisioning what the...	el "li" $ dynText =<< mapDyn (T.unpack . decodeUtf8) m return () I feel like there should be a way to do this with tickLossy to send pings with timeout, like some dynamic which returns websockets and then reconnects if a ping goes a certain amount of time without a response? But I'm having trouble envisioning what the...	[ -0.01214599609375, 0.0125732421875, 0.01068115234375, -0.01324462890625, -0.017822265625, 0.00531005859375, 0.005340576171875, 0.0130615234375, 0.01373291015625, -0.0247802734375, -0.002593994140625, -0.04931640625, 0.002838134765625, 0.013671875, 0.006439208984375, 0.01007080078125, ...	[ 88, 150, 3650, 65898, 174379, 22288, 397, 3371, 618, 309, 29102, 8, 40899, 420, 50490, 347, 30646, 12319, 5608, 3917, 54, 1053, 2594, 100604, 4861, 25379, 33429, 678, 1733, 6056, 84079, 1467, 991, 27853, 456, 135457, 2174, 60899, 24233, 4...	[ 0.1556396484375, 0.1510009765625, 0.07562255859375, 0.140380859375, 0.2379150390625, 0.1400146484375, 0.00897216796875, 0.1593017578125, 0.01025390625, 0.049224853515625, 0.205322265625, 0.0833740234375, 0.142578125, 0.011077880859375, 0.089599609375, 0.02117919921875, 0.146606445312...	embed
24800796_c0	24800796	haskell	0	Title: No instance for (Show a) arising from a use of `X' Problem title: No instance for (Show a) arising from a use of `X' Tags: gadt, haskell Problem: No instance for (Show a) arising from a use of `X' With this code {-# LANGUAGE GADTs #-} data X a where X :: (Show a, Num a) => a -> X a instance Show (X a) ...	No instance for (Show a) arising from a use of `X' No instance for (Show a) arising from a use of `X' gadt haskell a Show LANGUAGE GADTs Num Possible No instance for (Show a) arising from a use of `X' With this code I get this error: Can anyone explain why I get this error message?	[ -0.0079345703125, 0.012939453125, 0.00408935546875, -0.00634765625, -0.00156402587890625, 0.023193359375, 0.01361083984375, -0.0225830078125, 0.01470947265625, -0.01373291015625, -0.021240234375, -0.034423828125, -0.01123046875, 0.006591796875, 0.001922607421875, -0.011474609375, -0....	[ 438, 110527, 100, 168660, 10, 187, 72219, 1295, 4527, 1542, 3768, 914, 13384, 1556, 142508, 17367, 3358, 98064, 75930, 23749, 41072, 52782, 115861, 2661, 903, 18151, 2046, 18499, 73342, 15400, 26008 ]	[ 0.15185546875, 0.264892578125, 0.09423828125, 0.2060546875, 0.10791015625, 0.0986328125, 0.08892822265625, 0.07244873046875, 0.11376953125, 0.1724853515625, 0.1336669921875, 0.10284423828125, 0.173583984375, 0.1358642578125, 0.2318115234375, 0.187255859375, 0.023956298828125, 0.110...	embed
50234571_c0	50234571	haskell	0	Title: Access type fields in data constructor haskell Problem title: Access type fields in data constructor haskell Tags: syntax, types, output, haskell Problem: Access type fields in data constructor haskell I have a question how do I access certain types in a data constructor. Lets say I got this code sample data Obj...	Access type fields in data constructor haskell Access type fields in data constructor haskell syntax types output haskell Access Object Type1 Type2 Type3 Type4 Show Float Bool World Access type fields in data constructor haskell I have a question how do I access certain types in a data constructor. Lets say I got this ...	[ 0.01312255859375, -0.007415771484375, -0.007171630859375, 0.0302734375, 0.0089111328125, 0.00168609619140625, -0.006744384765625, 0.033203125, -0.000942230224609375, -0.000278472900390625, -0.007781982421875, -0.035888671875, 0.01031494140625, -0.01300048828125, -0.02197265625, -0.0075...	[ 40266, 10644, 44457, 7, 23, 2053, 64549, 748, 1556, 142508, 6002, 86531, 52895, 140992, 134549, 60457, 418, 304, 363, 617, 17367, 38699, 257, 2460, 929, 6661, 9655, 3642, 54, 87, 17203, 24233, 18151, 121413, 61924, 32354, 11249, 831, 28412,...	[ 0.255615234375, 0.248291015625, 0.26123046875, 0.0347900390625, 0.0650634765625, 0.122802734375, 0.2110595703125, 0.1236572265625, 0.149658203125, 0.21630859375, 0.07757568359375, 0.1531982421875, 0.2431640625, 0.137451171875, 0.156494140625, 0.189697265625, 0.038116455078125, 0.05...	embed
52908558_c0	52908558	haskell	0	Title: Tetris clearing full rows Problem title: Tetris clearing full rows Tags: functional-programming, haskell Problem: Tetris clearing full rows So I am making a tetris game using haskell and I am having troubles implementing the last feature, clearing the full rows and decrementing every tuple above it. as the bord ...	Tetris clearing full rows Tetris clearing full rows functional-programming haskell Tetris Tetris clearing full rows So I am making a tetris game using haskell and I am having troubles implementing the last feature, clearing the full rows and decrementing every tuple above it. as the bord I am using a list with [(xcoord...	[ 0.01123046875, 0.0159912109375, 0.01519775390625, 0.009033203125, -0.0205078125, -0.0281982421875, 0.0169677734375, 0.001129150390625, 0.00335693359375, 0.046142578125, 0.01129150390625, 0.01055908203125, 0.006500244140625, -0.001678466796875, -0.020263671875, 0.00396728515625, -0.00...	[ 1413, 43291, 34735, 214, 4393, 15555, 123309, 28966, 1556, 142508, 20662, 120, 6712, 17368, 63134, 29479, 4568, 60213, 136, 8, 7612, 11907, 370, 8705, 36917, 16307, 5303, 425, 587, 6651, 113, 4734, 176866, 95699, 138518, 47644, 175199, 423, ...	[ 0.096435546875, 0.2218017578125, 0.2091064453125, 0.056610107421875, 0.173828125, 0.2313232421875, 0.1337890625, 0.0933837890625, 0.10791015625, 0.1920166015625, 0.0168914794921875, 0.056884765625, 0.068359375, 0.033294677734375, 0.05419921875, 0.08380126953125, 0.05078125, 0.09655...	embed
67989933_c0	67989933	haskell	0	Title: How to write a Haskell function that inserts an element into a sorted list Problem title: How to write a Haskell function that inserts an element into a sorted list Tags: list, haskell, concatenation Problem: How to write a Haskell function that inserts an element into a sorted list I tried with something like t...	How to write a Haskell function that inserts an element into a sorted list How to write a Haskell function that inserts an element into a sorted list list haskell concatenation How Haskell x:xs insert2 How to write a Haskell function that inserts an element into a sorted list I tried with something like this but it doe...	[ -0.0137939453125, -0.00128173828125, 0.0059814453125, -0.00836181640625, -0.00151824951171875, 0.0252685546875, -0.020263671875, -0.0322265625, 0.0135498046875, -0.00122833251953125, 0.013916015625, -0.01361083984375, 0.0025787353515625, -0.00823974609375, -0.0081787109375, -0.00628662...	[ 11249, 33022, 20625, 142508, 32354, 183540, 12830, 3934, 17497, 71, 5303, 450, 1556, 158, 4460, 33, 1022, 12, 425, 7, 304, 10, 37842, 1884, 4488, 44691, 140992, 2046, 83, 82449, 104629, 76172 ]	[ 0.03802490234375, 0.1651611328125, 0.1187744140625, 0.20654296875, 0.198974609375, 0.216796875, 0.183837890625, 0.112548828125, 0.1949462890625, 0.1090087890625, 0.1873779296875, 0.01483154296875, 0.1060791015625, 0.0195770263671875, 0.09814453125, 0.08294677734375, 0.022262573242187...	embed

59335289_c0

59335289

haskell

0

Title: How Lambda function works in Haskell Problem title: How Lambda function works in Haskell Tags: functional-programming, foldleft, haskell, fold, lambda Problem: How Lambda function works in Haskell I am new to Haskell, while working on small programs I found little confusions about functioning of lambda functions...

How Lambda function works in Haskell How Lambda function works in Haskell functional-programming foldleft haskell fold lambda How Lambda Haskell Bool How Lambda function works in Haskell I am new to Haskell, while working on small programs I found little confusions about functioning of lambda functions. Executing lastT...

[ 0.0025634765625, 0.0032806396484375, 0.00933837890625, -0.00946044921875, 0.0032958984375, 0.00982666015625, 0.00191497802734375, 0.009033203125, -0.001434326171875, -0.0269775390625, 0.0081787109375, -0.032470703125, -0.01263427734375, 0.003753662109375, 0.0152587890625, -0.0263671875...

[ 11249, 122930, 85, 32354, 43240, 23, 20625, 142508, 123309, 28966, 18344, 19298, 2480, 1556, 42822, 21, 6492, 2460, 929, 3525, 20697, 19336, 103391, 169463, 214, 211603, 4568, 115743, 2740, 77495, 805, 5759, 80389, 166590, 9193, 4163, 25632, ...

[ 0.12109375, 0.2080078125, 0.2139892578125, 0.2000732421875, 0.179931640625, 0.08172607421875, 0.13623046875, 0.255615234375, 0.145751953125, 0.10791015625, 0.09088134765625, 0.06396484375, 0.1680908203125, 0.126220703125, 0.1416015625, 0.05084228515625, 0.1939697265625, 0.090026855...

embed

10264044_c0

10264044

haskell

0

Title: Output Integer to stdout in Haskell Problem title: Output Integer to stdout in Haskell Tags: haskell, io Problem: Output Integer to stdout in Haskell I have a simple function like: nth :: Integer -> Integer And I try to print it's result as follows: main = do n <- getLine result <- nth (read n :: Integer) print ...

Output Integer to stdout in Haskell Output Integer to stdout in Haskell haskell io Output Integer Haskell Couldn Output Integer to stdout in Haskell I have a simple function like: And I try to print it's result as follows: The following error is generated: Also tried with putStrLn and a lot of other combinations with n...

[ -0.0216064453125, -0.0181884765625, 0.0081787109375, -0.0020904541015625, 0.006378173828125, 0.01483154296875, 0.009521484375, -0.0228271484375, -0.00457763671875, -0.03271484375, 0.00070953369140625, -0.04345703125, -0.0037994384765625, 0.0019989013671875, -0.00098419189453125, -0.013...

[ 13538, 7077, 44401, 47, 6138, 246, 1003, 23, 20625, 142508, 1556, 22995, 191147, 19, 8781, 32354, 1884, 9790, 28412, 16750, 28960, 25632, 18499, 139392, 37842, 3884, 71713, 866, 5915, 162515, 110, 84434, 26366, 4358, 28219, 41884, 43240, 1093...

[ 0.1781005859375, 0.1048583984375, 0.264892578125, 0.146728515625, 0.17578125, 0.113037109375, 0.2412109375, 0.06707763671875, 0.1578369140625, 0.2607421875, 0.151611328125, 0.179443359375, 0.12451171875, 0.06982421875, 0.0762939453125, 0.146728515625, 0.004730224609375, 0.056549072...

embed

1798996_c1

1798996

haskell

1

8 s ./fibs +RTS -N6 -> avg= 0.055703 s, deviation = 0.006537 s ./fibs +RTS -N7 -> avg= 0.058327 s, deviation = 0.007526 s My questions are: What exactly is happening when I evaluate: a `par` (b `pseq` (a + b)) ? I understand that a par b is supposed to hint the compiler about calculating a in parallel with b and return...

[ -0.00170135498046875, 0.01153564453125, 0.0023956298828125, 0.008544921875, 0.0002689361572265625, 0.00445556640625, 0.00408935546875, -0.01190185546875, -0.0106201171875, -0.03857421875, 0.00799560546875, 0.0218505859375, 0.01214599609375, 0.0196533203125, 0.00628662109375, -0.0181884...

[ 382, 91, 1029, 16145, 997, 20503, 294, 20, 839, 910, 185, 177, 1369, 89678, 159595, 9513, 30170, 2320, 179973, 966, 10057, 3768, 37509, 6873, 4046, 17582, 4865, 66161, 123087, 3229, 87, 151575, 2500, 275, 45616, 864, 876, 28219, 366, 1345...

[ 0.1278076171875, 0.1373291015625, 0.1051025390625, 0.1217041015625, 0.1846923828125, 0.09783935546875, 0.0986328125, 0.0146942138671875, 0.06085205078125, 0.1572265625, 0.142578125, 0.07196044921875, 0.00775146484375, 0.0521240234375, 0.098876953125, 0.050689697265625, 0.179321289062...

embed

41276454_c1

41276454

haskell

1

union and find etc. The actual implementation of these differ depending on whether the user knows their size at creation time or whether they need to dynamically grow, hence the type class. However once these data types are created they can be roughly treated the same. All this occurs in monad code, generally ST or IO...

[ 0.00145721435546875, 0.011962890625, 0.0111083984375, -0.0009307861328125, 0.024169921875, -0.0233154296875, 0.003173828125, -0.00750732421875, -0.0059814453125, 0.0023193359375, -0.0004062652587890625, -0.0194091796875, -0.017333984375, 0.01513671875, 0.00150299072265625, 0.0140380859...

[ 69941, 136, 7413, 3021, 8561, 208124, 6097, 129927, 96819, 38937, 93002, 13267, 166635, 84079, 55993, 10644, 18507, 33306, 24145, 2053, 52895, 75935, 831, 166904, 191607, 5701, 74918, 2667, 712, 18151, 137567, 16992, 707, 6, 17780, 121392, 2393...

[ 0.24658203125, 0.07275390625, 0.2044677734375, 0.0204925537109375, 0.1212158203125, 0.1773681640625, 0.0343017578125, 0.17626953125, 0.0499267578125, 0.1182861328125, 0.0787353515625, 0.07586669921875, 0.101318359375, 0.0638427734375, 0.09814453125, 0.279052734375, 0.2335205078125, ...

embed

27964604_c0

27964604

haskell

0

Title: Lenses and prisms with sum types Problem title: Lenses and prisms with sum types Tags: haskell, haskell-lens Problem: Lenses and prisms with sum types This code won't compile. {-# LANGUAGE TemplateHaskell #-} import Control.Lens data A = A { _a1 :: B, _a2 :: Int } makeLenses ''A data B = B1 { _b1 :: Int } | B2 m...

Lenses and prisms with sum types Lenses and prisms with sum types haskell haskell-lens Control.Lens Lenses LANGUAGE TemplateHaskell _a1 _a2 _b1 amy.hs:5:21 Not Lenses and prisms with sum types This code won't compile. The error is amy.hs:5:21: Not in scope: type constructor or class ‘B’ . I have two questions. Is there...

[ -0.0157470703125, 0.01226806640625, 0.00018405914306640625, 0.0205078125, -0.01336669921875, 0.01507568359375, -0.020263671875, -0.01055908203125, -0.00482177734375, -0.031005859375, 0.0186767578125, 0.035400390625, 0.01397705078125, -0.0159912109375, 0.0069580078125, 0.01104736328125,...

[ 339, 47754, 136, 4067, 4432, 678, 10554, 52895, 1556, 142508, 1977, 27131, 866, 1755, 98064, 196631, 6495, 7, 11, 418, 304, 275, 10, 1176, 127, 758, 25619, 11205, 3293, 18151, 23742, 18, 9969, 1340, 18499, 70820, 10644, 64549, 748, 707, ...

[ 0.152099609375, 0.1717529296875, 0.114990234375, 0.178955078125, 0.1236572265625, 0.0948486328125, 0.1982421875, 0.2113037109375, 0.1256103515625, 0.2161865234375, 0.132080078125, 0.1507568359375, 0.1033935546875, 0.13671875, 0.0811767578125, 0.162353515625, 0.0810546875, 0.0466613...

embed

47734825_c1

47734825

haskell

1

If I add an extra argument to f that pushes the choice of f outside the inner forall , then the program typechecks: f :: forall f a. f a -> (forall k. (F k ~ B f) => f k) -> A f _ _ = undefined g :: forall a. X a -> (forall k. (F k ~ B X) => X k) -> A g = f However, what specifically has me so confused in this particu...

[ 0.0216064453125, -0.0027618408203125, -0.019775390625, -0.0084228515625, -0.0198974609375, -0.0023040771484375, -0.0140380859375, -0.00060272216796875, 0.00982666015625, 0.0240478515625, 0.00738525390625, -0.03515625, 0.00811767578125, 0.0120849609375, 0.00970458984375, -0.028686523437...

[ 15190, 4173, 10750, 1238, 25944, 44126, 50782, 75414, 100, 5584, 1528, 10644, 78292, 1984, 10, 33079, 2472, 472, 919, 335, 62, 9232, 5983, 706, 1193, 2203, 183037, 55681, 27781, 15400, 123309, 42548, 27771, 12921, 123166, 49782, 63043, 117538...

[ 0.0723876953125, 0.09991455078125, 0.2138671875, 0.144287109375, 0.1275634765625, 0.12255859375, 0.128662109375, 0.1336669921875, 0.058685302734375, 0.14697265625, 0.138427734375, 0.15869140625, 0.228271484375, 0.025787353515625, 0.030914306640625, 0.010711669921875, 0.03488159179687...

embed

76610110_c0

76610110

haskell

0

Title: Haskell Freestate evaluate to State Problem title: Haskell Freestate evaluate to State Tags: state, haskell Problem: Haskell Freestate evaluate to State I have a datatype called FreeState; data FreeState s a = Get (s -> FreeState s a) | Put s (FreeState s a) | Return a Now I need to evaluate this FreeState to a ...

Haskell Freestate evaluate to State Haskell Freestate evaluate to State state haskell Haskell Freestate State Get Put Haskell Freestate evaluate to State I have a datatype called FreeState; Now I need to evaluate this FreeState to a State; I do not think I understand States enough to do this. Can someone enlighten me, ...

[ 0.002899169921875, 0.0103759765625, -0.003021240234375, 0.002685546875, 0.00160980224609375, 0.00396728515625, -0.01171875, -0.004302978515625, 0.000385284423828125, 0.0030364990234375, 0.004913330078125, 0.01556396484375, 0.008544921875, 0.022216796875, -0.0196533203125, -0.0129394531...

[ 20625, 142508, 5153, 61340, 151575, 13, 47, 22836, 11341, 1556, 20779, 19577, 2053, 50986, 135206, 14240, 3871, 959, 5351, 28219, 46684, 20174, 4171, 22008, 20016, 33, 15673, 11522, 765, 5036, 154559, 903, 26785 ]

[ 0.1419677734375, 0.2288818359375, 0.1580810546875, 0.251953125, 0.170166015625, 0.1138916015625, 0.0963134765625, 0.2188720703125, 0.1199951171875, 0.130126953125, 0.039215087890625, 0.09381103515625, 0.0870361328125, 0.220458984375, 0.2275390625, 0.000335693359375, 0.07763671875, ...

embed

60336958_c0

60336958

haskell

0

Title: Can i get a record while pattern matching on its contents? Problem title: Can i get a record while pattern matching on its contents? Tags: haskell, record Problem: Can i get a record while pattern matching on its contents? Basically, i want to pattern match on the contents of a record, and then return a modifica...

Can i get a record while pattern matching on its contents? Can i get a record while pattern matching on its contents? haskell record Can Database Can i get a record while pattern matching on its contents? Basically, i want to pattern match on the contents of a record, and then return a modification of said record. So i...

[ -0.0223388671875, 0.005401611328125, 0.00811767578125, 0.0045166015625, 0.01239013671875, 0.01116943359375, -0.0220947265625, -0.0128173828125, 0.02001953125, -0.0087890625, 0.0211181640625, 0.00439453125, -0.00836181640625, -0.00970458984375, 0.010009765625, -0.01446533203125, 0.007...

[ 4171, 17, 2046, 17164, 12960, 103510, 14858, 214, 98, 10941, 7, 10, 6863, 1556, 142508, 187781, 3444, 47, 30646, 129344, 16648, 5915, 6626, 10750, 5608, 11343, 186, 5701, 3917, 4734, 452, 24145 ]

[ 0.1068115234375, 0.072021484375, 0.1090087890625, 0.228271484375, 0.13427734375, 0.235595703125, 0.2109375, 0.1068115234375, 0.04205322265625, 0.12548828125, 0.00457763671875, 0.029571533203125, 0.0166015625, 0.1138916015625, 0.1971435546875, 0.208251953125, 0.060546875, 0.01533508...

embed

33944276_c0

33944276

haskell

0

Title: how to get path from root to desired node i.e. includes first number as rooth then child -> child->upto parent of child Problem title: how to get path from root to desired node i.e. includes first number as rooth then child -> child->upto parent of child Tags: tree, haskell Problem: how to get path f...

how to get path from root to desired node i.e. includes first number as rooth then child -> child->upto parent of child how to get path from root to desired node i.e. includes first number as rooth then child -> child->upto parent of child tree haskell root i.e Tree Show ls:xs how to get path from root to d...

[ 0.01165771484375, 0.032958984375, -0.00994873046875, -0.01226806640625, 0.0002460479736328125, 0.021484375, 0.00104522705078125, -0.027587890625, 0.00933837890625, -0.06396484375, 0.00372314453125, 0.00018787384033203125, 0.006378173828125, 0.0263671875, -0.00128173828125, -0.002487182...

[ 3642, 47, 2046, 60875, 1295, 74855, 104851, 71, 110, 112, 96853, 5117, 14012, 127, 29041, 5386, 2037, 188, 49129, 111, 237, 53201, 1556, 142508, 101344, 17367, 425, 7, 33079, 37170, 100, 483, 5608, 30646, 882, 96386, 82230, 22027, 18, 323...

[ 0.07373046875, 0.1673583984375, 0.112548828125, 0.2227783203125, 0.138671875, 0.219970703125, 0.1614990234375, 0.07220458984375, 0.120849609375, 0.140625, 0.07763671875, 0.0885009765625, 0.15771484375, 0.149658203125, 0.1207275390625, 0.03924560546875, 0.0799560546875, 0.1652832031...

embed

42317607_c0

42317607

haskell

0

Title: Poor mans concurrency, understanding the monad instance? Problem title: Poor mans concurrency, understanding the monad instance? Tags: haskell, continuations, monads Problem: Poor mans concurrency, understanding the monad instance? I'm running through this guide to implementing concurrency and I'm having trouble...

Poor mans concurrency, understanding the monad instance? Poor mans concurrency, understanding the monad instance? haskell continuations monads Poor Action Atom Fork Stop Monad Poor mans concurrency, understanding the monad instance? I'm running through this guide to implementing concurrency and I'm having trouble under...

[ -0.01300048828125, 0.0026397705078125, 0.023681640625, -0.00099945068359375, 0.0125732421875, 0.00860595703125, 0.01019287109375, -0.00341796875, 0.0126953125, -0.02099609375, -0.01068115234375, -0.013671875, -0.01385498046875, 0.0034637451171875, 0.01806640625, -0.001434326171875, -...

[ 167626, 36679, 108636, 982, 2408, 100094, 2667, 712, 110527, 1556, 142508, 9454, 5256, 57945, 69728, 1326, 92, 42284, 60331, 71, 17997, 29479, 63134, 28219, 20531, 4527, 1363, 7, 237875, 32380, 94266, 21635 ]

[ 0.1934814453125, 0.12646484375, 0.1597900390625, 0.1314697265625, 0.06134033203125, 0.129638671875, 0.1087646484375, 0.154052734375, 0.1729736328125, 0.08642578125, 0.1917724609375, 0.130859375, 0.0093994140625, 0.1142578125, 0.122314453125, 0.0845947265625, 0.034149169921875, 0.12...

embed

54288280_c0

54288280

haskell

0

Title: How to fix writing a list content in a file Problem title: How to fix writing a list content in a file Tags: haskell Problem: How to fix writing a list content in a file I have a function which contains a list. I want just to write that list content in a file from main after user input. putTodo :: (Int, String) ...

How to fix writing a list content in a file How to fix writing a list content in a file haskell How mapM_ agenda.txt WriteMode How to fix writing a list content in a file I have a function which contains a list. I want just to write that list content in a file from main after user input. What I tried: Thank you.

[ -0.0206298828125, -0.0010833740234375, -0.00433349609375, 0.002777099609375, -0.010009765625, -0.003265380859375, 0.00052642822265625, 0.00909423828125, 0.00457763671875, 0.0140380859375, -0.007049560546875, -0.0185546875, 0.0169677734375, 0.037841796875, 0.0091552734375, -0.0099487304...

[ 11249, 47, 30022, 32562, 10, 5303, 10941, 23, 11435, 1556, 142508, 22288, 594, 29361, 124326, 601, 18781, 9083, 32354, 70541, 3444, 1660, 33022, 450, 1295, 5201, 7103, 38937, 107730, 37842 ]

[ 0.047454833984375, 0.03875732421875, 0.205078125, 0.2210693359375, 0.07220458984375, 0.2362060546875, 0.2264404296875, 0.0709228515625, 0.1875, 0.1348876953125, 0.20947265625, 0.11016845703125, 0.07513427734375, 0.22119140625, 0.157470703125, 0.023712158203125, 0.0615234375, 0.1416...

embed

56405751_c3

56405751

haskell

3

0.3.3-Ie3MD7O3orK6ZR8i7FuBEv, aeson-1.3.1.1-7JlrwYHW7OR9ca4RRZ9oOf, ansi-wl-pprint-0.6.8.2-9fh9v74MJQDJeSHE7X3Co6, async-2.2.1-7DQr5PBcpiwJNOuf7ZiSPa, base-4.11.1.0, base16-bytestring, base16-bytestring-0.1.1.6-I0igvRcEwRNBMqqPC2yQBh, base64-bytestring, base64-bytestring-1.0.0.1-4OCIe2BZn8jKI191JIXI37, binary-0.8.5.1, ...

fJgKGHBhOb vty-5.21-A2OCwk39Wv3J3RjR3BvHey witherable-0.2-2RYbFmOnVolGAqiDDS1CLe Shows Missing library : ff while building echidna using stack install I am trying to build echidna using stack install . https://github.com/crytic/echidna I am continuously getting the missing library error while installing at a progress s...

[ -0.01904296875, -0.031494140625, 0.00543212890625, 0.01165771484375, -0.0185546875, -0.006561279296875, 0.000720977783203125, 0.01287841796875, 0.0262451171875, 0.0284423828125, 0.01080322265625, -0.01470947265625, -0.00653076171875, -0.003082275390625, -0.01068115234375, 0.00469970703...

[ 41877, 46471, 81, 939, 10342, 3117, 133747, 678, 56, 2886, 133684, 73668, 17367, 16771, 214, 35773, 1294, 26472, 12960, 33976, 28, 1861, 39200, 17368, 177261, 20600, 31577, 45367, 15769, 32102, 9523, 7101, 532, 76, 19686, 132283, 18499, 42658...

[ 0.0171661376953125, 0.0845947265625, 0.0728759765625, 0.1512451171875, 0.006072998046875, 0.061492919921875, 0.1309814453125, 0.1099853515625, 0.0821533203125, 0.150634765625, 0.1453857421875, 0.0159149169921875, 0.0192718505859375, 0.11865234375, 0.05853271484375, 0.2366943359375, 0...

embed

58948248_c2

58948248

haskell

2

in-XPS-13-9360:~$ cabal info tidal * tidal (library) Synopsis: Pattern language for improvised music Versions available: 0.8.2, 0.9.9, 0.9.10, 1.2.1, 1.3.0, 1.4.1, 1.4.2, 1.4.3, 1.4.4 (and 99 others) Code signals: the, hackage.haskell.org, /home/justin/.ghc/x86_64-linux-8.6.5/environments/default, Haskell, Tidal, justi...

[ 0.0146484375, 0.000637054443359375, 0.01336669921875, 0.00970458984375, -0.002410888671875, 0.0074462890625, -0.007781982421875, 0.017822265625, 0.004425048828125, -0.01708984375, 0.00125885009765625, -0.038330078125, -0.01116943359375, 0.00439453125, 0.00640869140625, 0.00135040283203...

[ 23, 1542, 9059, 22820, 15205, 38230, 12, 2306, 4369, 109524, 3004, 2936, 289, 661, 150, 2844, 1294, 16, 19010, 31, 74988, 9876, 22766, 46876, 100, 128659, 52021, 19612, 40647, 19882, 757, 5, 128423, 176652, 143161, 963, 615, 68107, 132265, ...

[ 0.193359375, 0.1234130859375, 0.2286376953125, 0.210205078125, 0.1483154296875, 0.25048828125, 0.0245208740234375, 0.0806884765625, 0.1380615234375, 0.263427734375, 0.1614990234375, 0.2357177734375, 0.265625, 0.053863525390625, 0.084716796875, 0.139892578125, 0.0330810546875, 0.007...

embed

33767830_c3

33767830

haskell

3

Compilation, System, package.conf.d, Cabal-1.14.0, GLUT-2.1.2.2, HTTP-4000.2.3, HUnit-1.2.4.2, MonadCatchIO-mtl-0.3.0.4, OpenGL-2.2.3.1, QuickCheck-2.4.2, array-0.4.0.0, base-4.5.0.0, bin-package-db-0.0.0.0, binary-0.5.1.0, bytestring-0.9.2.1, cgi-3001.1.8.2, containers-0.4.2.1, deepseq-1.3.0.0, directory-1.1.0.2, ext...

[ -0.017822265625, -0.0069580078125, 0.009033203125, -0.004486083984375, 0.004638671875, -0.00011205673217773438, -0.0296630859375, -0.00127410888671875, -0.015625, 0.03515625, -0.0201416015625, -0.0191650390625, -0.0145263671875, -0.00823974609375, 0.006134033203125, -0.006988525390625,...

[ 15612, 14, 57860, 4, 12353, 98169, 5, 70547, 71, 30438, 289, 9, 92134, 151152, 527, 143662, 68107, 70147, 135913, 68037, 120883, 22438, 6773, 48400, 117904, 60331, 76775, 206, 17780, 141, 170179, 121254, 13527, 78703, 97109, 89038, 202567, 54...

[ 0.17919921875, 0.16845703125, 0.1690673828125, 0.13818359375, 0.206298828125, 0.265625, 0.10205078125, 0.2110595703125, 0.0869140625, 0.166748046875, 0.1776123046875, 0.1553955078125, 0.14453125, 0.2227783203125, 0.03582763671875, 0.244873046875, 0.1466064453125, 0.17041015625, 0...

embed

36962221_c0

36962221

haskell

0

Title: Haskell and multiple conditions Problem title: Haskell and multiple conditions Tags: conditional-statements, haskell, if-statement Problem: Haskell and multiple conditions If I have multiple conditions that are only slightly different, what is the best way to write a function (considering and inability to nest g...

Haskell and multiple conditions Haskell and multiple conditions conditional-statements haskell if-statement Haskell Haskell and multiple conditions If I have multiple conditions that are only slightly different, what is the best way to write a function (considering and inability to nest guards) of the form: etc Imagine...

[ -0.00543212890625, 0.006317138671875, -0.009033203125, 0.0111083984375, 0.006591796875, 0.0126953125, -0.01080322265625, -0.019287109375, 0.002197265625, 0.0157470703125, -0.00518798828125, -0.0157470703125, 0.004669189453125, 0.01507568359375, 0.0076904296875, 0.01458740234375, 0.01...

[ 20625, 142508, 136, 48716, 27289, 35431, 289, 61340, 1556, 2174, 765, 621, 4734, 161549, 12921, 2965, 3917, 33022, 32354, 212065, 23, 41159, 47, 91280, 56050, 3173, 133196, 5915, 1286, 41143, 1884, 8512, 71, 12765, 876, 959, 7722, 27781, 51...

[ 0.1395263671875, 0.2344970703125, 0.05072021484375, 0.20849609375, 0.261962890625, 0.1856689453125, 0.068115234375, 0.1522216796875, 0.14013671875, 0.1287841796875, 0.015899658203125, 0.0306396484375, 0.05902099609375, 0.1336669921875, 0.1966552734375, 0.0986328125, 0.05108642578125,...

embed

23832790_c0

23832790

haskell

0

Title: Debugging huffman decoding Problem title: Debugging huffman decoding Tags: haskell, decoding, huffman-code, tree Problem: Debugging huffman decoding While I was debugging my huffman decoding function decode :: (Tree a, [Bit]) -> [a] decode (tree, list) = case list of [] -> case tree of Leaf pos a -> replicate_Po...

Debugging huffman decoding Debugging huffman decoding haskell decoding huffman-code tree Debugging Tree Bit Leaf replicate_Pos num_only follow_bit_path_to_one_value huffman_decode list_only Debugging huffman decoding While I was debugging my huffman decoding function it comes up with a parse error on input "where"? Whe...

[ 0.006378173828125, 0.00787353515625, -0.0177001953125, 0.016845703125, 0.01611328125, 0.016845703125, -0.0286865234375, -0.0162353515625, 0.01043701171875, 0.01324462890625, -0.021240234375, -0.041748046875, 0.0216064453125, 0.0146484375, -0.007293701171875, -0.00421142578125, 0.0117...

[ 262, 978, 36659, 1096, 21493, 669, 8, 587, 1556, 142508, 40899, 53201, 101344, 27774, 636, 2407, 143126, 7192, 13269, 191, 28960, 3137, 128405, 188, 3630, 27494, 13, 112, 5303, 6238, 32354, 32497, 366, 184, 18499, 98, 107730, 136913, 78662,...

[ 0.1219482421875, 0.1943359375, 0.0740966796875, 0.0794677734375, 0.2137451171875, 0.1683349609375, 0.13427734375, 0.1495361328125, 0.091064453125, 0.1910400390625, 0.189208984375, 0.1365966796875, 0.137939453125, 0.095703125, 0.043212890625, 0.1224365234375, 0.154296875, 0.08361816...

embed

26327053_c0

26327053

haskell

0

Title: Specifying multiple alternatives in a single pattern match? Problem title: Specifying multiple alternatives in a single pattern match? Tags: haskell, pattern-matching Problem: Specifying multiple alternatives in a single pattern match? Take the following function as an example (the function is quite meaningless ...

Specifying multiple alternatives in a single pattern match? Specifying multiple alternatives in a single pattern match? haskell pattern-matching Specifying _:xs Specifying multiple alternatives in a single pattern match? Take the following function as an example (the function is quite meaningless but at least illustrat...

[ -0.0038604736328125, 0.0003910064697265625, 0.0074462890625, 0.0035247802734375, -0.0224609375, -0.01190185546875, -0.004730224609375, -0.01373291015625, 0.0419921875, 0.004669189453125, 0.025634765625, -0.012939453125, 0.019287109375, 0.0024261474609375, -0.0142822265625, 0.0079345703...

[ 24990, 151138, 48716, 30700, 23, 11001, 103510, 14858, 7, 1556, 142508, 98753, 214, 101, 12, 425, 25632, 32354, 27781, 32233, 91084, 9393, 58755, 759, 97249, 10763, 378, 136, 1022, 27489, 5701, 16750, 7722, 70163, 6097, 3934, 43257, 32562, ...

[ 0.1651611328125, 0.13525390625, 0.218505859375, 0.228271484375, 0.0330810546875, 0.19775390625, 0.2249755859375, 0.2197265625, 0.05859375, 0.1207275390625, 0.20263671875, 0.2464599609375, 0.02020263671875, 0.030487060546875, 0.034912109375, 0.114990234375, 0.047882080078125, 0.1181...

embed

40734253_c0

40734253

haskell

0

Title: Making "trace" optimise away like "assert"? Problem title: Making "trace" optimise away like "assert"? Tags: ghc, debugging, haskell Problem: Making "trace" optimise away like "assert"? GHC rewrites assert s when optimising as just id . Or alternatively, it's behaviour can...

Making "trace" optimise away like "assert"? Making "trace" optimise away like "assert"? ghc debugging haskell Making Making "trace" optimise away like "assert"? GHC rewrites assert s when optimising as just id . Or alternatively, it's behaviour can be changed with a compiler flag...

[ 0.017333984375, 0.0027618408203125, 0.0040283203125, 0.00069427490234375, 0.0009765625, 0.0047607421875, 0.00159454345703125, -0.00848388671875, 0.007568359375, 0.005126953125, 0.01043701171875, 0.02783203125, -0.0234375, -0.0120849609375, 0.022216796875, 0.02197265625, 0.009765625, ...

[ 13676, 39989, 13, 15572, 3075, 16065, 1884, 162, 33657, 31380, 238, 8, 978, 1556, 142508, 527, 73265, 456, 5429, 52164, 237, 91, 3229, 72219, 1660, 3447, 224833, 831, 98816, 678, 9969, 34759, 49938, 18, 144851, 11389, 3564, 2174, 707, 542...

[ 0.06768798828125, 0.2117919921875, 0.1351318359375, 0.1910400390625, 0.07440185546875, 0.1881103515625, 0.1116943359375, 0.0869140625, 0.25830078125, 0.0704345703125, 0.0823974609375, 0.0828857421875, 0.108642578125, 0.0777587890625, 0.182373046875, 0.1038818359375, 0.2056884765625, ...

embed

53119434_c0

53119434

haskell

0

Title: Add a typeclass constraint on a Record type Problem title: Add a typeclass constraint on a Record type Tags: haskell Problem: Add a typeclass constraint on a Record type Before this declaration was working well in my context : data PersistedCommand = PersistedCommand { offset :: Offset , command :: Command } ins...

Add a typeclass constraint on a Record type Add a typeclass constraint on a Record type haskell Add Record PersistedCommand Offset Command Show Add a typeclass constraint on a Record type Before this declaration was working well in my context : But I've changed Command from a data type to a type class. How do I express...

[ -0.01495361328125, 0.002960205078125, 0.003997802734375, 0.033203125, 0.00872802734375, 0.004608154296875, -0.026611328125, -0.00049591064453125, -0.004058837890625, -0.025146484375, 0, -0.0167236328125, 0.0007476806640625, 0.0091552734375, -0.01458740234375, -0.0228271484375, -0.012...

[ 29117, 10644, 67413, 158, 2816, 4288, 98, 54877, 10, 1556, 142508, 57309, 14437, 10770, 12018, 9791, 3509, 123573, 17367, 21635, 20697, 43701, 4966, 272, 98816, 1295, 2053, 47, 18507, 36510, 903, 5036, 70, 96362 ]

[ 0.104736328125, 0.23291015625, 0.264404296875, 0.0882568359375, 0.1705322265625, 0.1278076171875, 0.07098388671875, 0.185791015625, 0.028533935546875, 0.113037109375, 0.2025146484375, 0.1239013671875, 0.0953369140625, 0.0439453125, 0.14599609375, 0.1553955078125, 0.1119384765625, 0...

embed

78493013_c0

78493013

haskell

0

Title: How to configure HLS in nixpkgs? Problem title: How to configure HLS in nixpkgs? Tags: haskell-language-server, haskell, nix, nixpkgs Problem: How to configure HLS in nixpkgs? When using an older nixpkgs (2022), one can do the following to customize pkgs.haskellPackages.haskell-language-server to, for example, d...

How to configure HLS in nixpkgs? How to configure HLS in nixpkgs? haskell-language-server haskell nix nixpkgs How HLS pkgs.haskellPackages.haskell-language-server pkgs.haskell.lib.compose lib.flip lib.pipe drv.override How to configure HLS in nixpkgs? When using an older nixpkgs (2022), one can do the following to cust...

[ -0.000644683837890625, -0.01434326171875, 0.00946044921875, -0.0087890625, -0.009521484375, -0.0033111572265625, 0.005035400390625, -0.0086669921875, -0.00011587142944335938, 0.017822265625, -0.0137939453125, -0.001617431640625, 0.042724609375, -0.0003604888916015625, 0.00848388671875, ...

[ 11249, 47, 222495, 572, 19759, 23, 300, 425, 38988, 9405, 1556, 142508, 196651, 39642, 8517, 10557, 205956, 5612, 25474, 21392, 1434, 1081, 334, 5465, 416, 17368, 114210, 151159, 178036, 2837, 2886, 707, 432, 822, 136, 22759, 66139, 69307, ...

[ 0.0677490234375, 0.038787841796875, 0.2130126953125, 0.150146484375, 0.262939453125, 0.048065185546875, 0.0936279296875, 0.1236572265625, 0.153564453125, 0.16943359375, 0.0848388671875, 0.19580078125, 0.139892578125, 0.136962890625, 0.148681640625, 0.078857421875, 0.127685546875, 0...

embed

68363551_c0

68363551

haskell

0

Title: problem with let in binding in a predicate in haskell language? Problem title: problem with let in binding in a predicate in haskell language? Tags: haskell Problem: problem with let in binding in a predicate in haskell language? i'm newbie in haskell language. i wrote function get list of pairs as input and ret...

problem with let in binding in a predicate in haskell language? problem with let in binding in a predicate in haskell language? haskell RealFloat problem with let in binding in a predicate in haskell language? i'm newbie in haskell language. i wrote function get list of pairs as input and return list of BMI index: calc...

[ -0.0021820068359375, -0.0203857421875, -0.00531005859375, 0.004180908203125, 0.0208740234375, 0.01129150390625, 0.0267333984375, -0.0038299560546875, 0.02392578125, -0.00017452239990234375, -0.002288818359375, -0.000957489013671875, 0.005584716796875, -0.02392578125, -0.001983642578125, ...

[ 2967, 678, 2633, 23, 128239, 1653, 2063, 67, 1556, 142508, 46876, 10, 5120, 919, 365, 257, 9014, 54397, 32354, 2046, 5303, 80836, 237, 107730, 30646, 335, 10101, 63262, 6510, 238, 571, 68996, 1022, 16750, 434, 127, 425, 266, 16498, 148, ...

[ 0.1888427734375, 0.049346923828125, 0.2269287109375, 0.173095703125, 0.285400390625, 0.168212890625, 0.239990234375, 0.142578125, 0.1424560546875, 0.2423095703125, 0.153564453125, 0.05584716796875, 0.1702880859375, 0.06573486328125, 0.161865234375, 0.1214599609375, 0.067626953125, ...

embed

11814525_c0

11814525

haskell

0

Title: Haskell, parse error in input 'if' Problem title: Haskell, parse error in input 'if' Tags: haskell Problem: Haskell, parse error in input 'if' I can't for the life of me figure out why there is a problem with this if statement (haskell noobie.) Can anyone help me out? fst3 (a,b,c) = a snd3 (a...

Haskell, parse error in input 'if' Haskell, parse error in input 'if' haskell Haskell fst3 snd3 trd3 fst4 snd4 trd4 qud4 x:xs Haskell, parse error in input 'if' I can't for the life of me figure out why there is a problem with this if statement (haskell noobie.) Can anyone help me out?

[ -0.007171630859375, 0.01806640625, -0.01361083984375, 0.0157470703125, 0.0185546875, 0.033447265625, -0.00830078125, 0.01043701171875, 0.000797271728515625, -0.01324462890625, -0.0164794921875, -0.0016632080078125, 0.0196533203125, -0.004730224609375, -0.004638671875, 0.0220947265625, ...

[ 20625, 142508, 366, 184, 18499, 23, 107730, 3768, 3190, 4, 1556, 1238, 271, 363, 2208, 4307, 617, 1103, 425, 831, 18, 6897, 26366, 15400, 2685, 83, 2967, 903, 2174, 63805, 10557, 110, 31, 9014, 4171, 4358 ]

[ 0.15283203125, 0.2509765625, 0.167724609375, 0.1444091796875, 0.22802734375, 0.06158447265625, 0.1951904296875, 0.1468505859375, 0.2734375, 0.0228424072265625, 0.135009765625, 0.001007080078125, 0.0200042724609375, 0.07525634765625, 0.03094482421875, 0.02752685546875, 0.068603515625,...

embed

35524320_c0

35524320

haskell

0

Title: Functorial structure of functions Problem title: Functorial structure of functions Tags: haskell, functor Problem: Functorial structure of functions I'm having difficulties understanding the functorial structure of functions. I think I have a clue with ghci: Prelude> :t (->) (->) :: * -> * -> * So if feeded a ty...

Functorial structure of functions Functorial structure of functions haskell functor Functorial Prelude Integer Functorial structure of functions I'm having difficulties understanding the functorial structure of functions. I think I have a clue with ghci: So if feeded a type, applying on it (->) will have desired kind *...

[ 0.01708984375, 0.0031280517578125, 0.004638671875, 0.0050048828125, 0.01104736328125, 0.022705078125, 0.005035400390625, -0.01239013671875, 0.00150299072265625, -0.03515625, -0.0213623046875, -0.01373291015625, -0.005828857421875, 0.01446533203125, 0.01177978515625, -0.01519775390625, ...

[ 28670, 238, 77275, 45646, 32354, 111, 1556, 142508, 7477, 18770, 1914, 822, 44401, 34844, 100094, 29786, 31380, 318, 2174, 61590, 297, 10644, 59911, 98, 103607, 1221, 765, 104851, 8562, 661, 33079, 3664, 80934, 53418, 31635, 15400, 831, 33022...

[ 0.159423828125, 0.09686279296875, 0.1700439453125, 0.2117919921875, 0.22021484375, 0.0509033203125, 0.1077880859375, 0.2147216796875, 0.18310546875, 0.2332763671875, 0.04986572265625, 0.140625, 0.1427001953125, 0.0221405029296875, 0.072265625, 0.049652099609375, 0.067138671875, 0.1...

embed

38863820_c0

38863820

haskell

0

Title: How do you save a file using Conduit? Problem title: How do you save a file using Conduit? Tags: haskell-pipes, conduit, haskell Problem: How do you save a file using Conduit? How do you save a file using conduit's library? I looked through conduit's tutorial but can't seem to find anything, here is my use case:...

How do you save a file using Conduit? How do you save a file using Conduit? haskell-pipes conduit haskell Conduit How Monad How do you save a file using Conduit? How do you save a file using conduit's library? I looked through conduit's tutorial but can't seem to find anything, here is my use case: So there's two quest...

[ -0.00081634521484375, 0.0093994140625, 0.0098876953125, 0.032958984375, -0.006683349609375, 0.0186767578125, -0.0025787353515625, -0.0067138671875, 0.003387451171875, 0.0029144287109375, -0.01336669921875, 0.00019931793212890625, 0.0263671875, 0.01324462890625, 0.006103515625, -0.00549...

[ 11249, 54, 30098, 10, 11435, 17368, 1657, 112061, 1556, 142508, 1434, 13569, 120565, 60331, 71, 35773, 1294, 57143, 4527, 7225, 6626, 9655, 10422, 124519, 96760, 79315, 3934, 5303, 61590, 31344, 154663, 29479, 174350, 32354, 113664, 89554, 9433...

[ 0.08172607421875, 0.0257110595703125, 0.196533203125, 0.02685546875, 0.19970703125, 0.1348876953125, 0.1387939453125, 0.25048828125, 0.1002197265625, 0.202880859375, 0.1015625, 0.08245849609375, 0.25, 0.1082763671875, 0.070068359375, 0.1370849609375, 0.06365966796875, 0.07727050781...

embed

28016759_c0

28016759

haskell

0

Title: Leaf Trees in Haskell - non-exhaustive pattern Problem title: Leaf Trees in Haskell - non-exhaustive pattern Tags: haskell Problem: Leaf Trees in Haskell - non-exhaustive pattern This function follows a path of Bools, going left or right depending on False or True, respectively data LTree a = Leaf a | Fork (LTre...

Leaf Trees in Haskell - non-exhaustive pattern Leaf Trees in Haskell - non-exhaustive pattern haskell Leaf Trees Haskell LTree Fork Show Bool Maybe l:ls Just b:bs Leaf Trees in Haskell - non-exhaustive pattern This function follows a path of Bools, going left or right depending on False or True, respectively The thing ...

[ 0.0014190673828125, 0.0038604736328125, -0.0027008056640625, -0.0106201171875, 0.0107421875, 0.0021820068359375, -0.0262451171875, -0.018798828125, 0.0054931640625, -0.011474609375, 0.01226806640625, 0.00732421875, -0.004119873046875, 0.0164794921875, 0.00061798095703125, 0.00093841552...

[ 636, 2407, 4804, 90, 23, 20625, 142508, 351, 18391, 4935, 103510, 1556, 107, 13, 1326, 92, 17367, 2460, 929, 83425, 8080, 9563, 876, 16145, 32354, 28960, 60875, 73783, 7730, 25737, 707, 7108, 96819, 22225, 87599, 13580, 64765, 14602, 959, ...

[ 0.07806396484375, 0.209228515625, 0.257568359375, 0.05029296875, 0.025299072265625, 0.128662109375, 0.256591796875, 0.0880126953125, 0.06268310546875, 0.017333984375, 0.1552734375, 0.089599609375, 0.2152099609375, 0.204345703125, 0.1744384765625, 0.116943359375, 0.12744140625, 0.06...

embed

21199840_c0

21199840

haskell

0

Title: parse error on input `=' in Haskell Problem title: parse error on input `=' in Haskell Tags: haskell, parse-error Problem: parse error on input `=' in Haskell I wrote the following function in Haskell coordenadas :: (Floating a) => String -> (a, a, a) coordenadas linea = (x, y, z) where (_ : xStr : ySt...

parse error on input `=' in Haskell parse error on input `=' in Haskell haskell parse-error Haskell Floating Float Z10 parse error on input `=' in Haskell I wrote the following function in Haskell This function is meant to receive a string like "N1 X2 Y1 Z10" and produce a tuple like (2, 1, 10) , but when I t...

[ 0.0032196044921875, 0.01214599609375, -0.0262451171875, 0.00946044921875, 0.00086212158203125, 0.0120849609375, 0.0103759765625, -0.0087890625, 0.01080322265625, -0.01275634765625, -0.01397705078125, -0.025146484375, 0.0322265625, -0.01263427734375, -0.0235595703125, 0.0177001953125, ...

[ 366, 184, 18499, 98, 107730, 9473, 1369, 54764, 425, 3768, 20625, 142508, 1556, 188800, 38699, 26518, 257, 567, 963, 54397, 25632, 32354, 131148, 53299, 79315, 1884, 839, 418, 1193, 304, 990, 27489, 370, 8705, 4700, 106, 209, 9790, 9969, ...

[ 0.151611328125, 0.1488037109375, 0.2105712890625, 0.05828857421875, 0.194091796875, 0.0239410400390625, 0.19921875, 0.0204620361328125, 0.007537841796875, 0.1634521484375, 0.1441650390625, 0.2352294921875, 0.1285400390625, 0.166015625, 0.177490234375, 0.02838134765625, 0.086181640625...

embed

7819801_c0

7819801

haskell

0

Title: Replace a 3 parameter list-comprehension by using map, concat Problem title: Replace a 3 parameter list-comprehension by using map, concat Tags: list-comprehension, haskell, higher-order-functions, translate, map-function Problem: Replace a 3 parameter list-comprehension by using map, concat I have some understa...

Replace a 3 parameter list-comprehension by using map, concat Replace a 3 parameter list-comprehension by using map, concat list-comprehension haskell higher-order-functions translate map-function map Replace Replace a 3 parameter list-comprehension by using map, concat I have some understanding of list comprehension. ...

[ -0.010009765625, -0.0068359375, -0.004241943359375, 0.002716064453125, -0.00201416015625, 0.006622314453125, -0.006134033203125, 0.010009765625, 0.0162353515625, -0.03955078125, -0.006072998046875, -0.00994873046875, 0.0211181640625, 0.00445556640625, -0.0281982421875, -0.0005073547363...

[ 853, 23935, 138, 171859, 5303, 277, 4692, 3220, 6889, 17368, 22288, 158, 4460, 1556, 142508, 77546, 80596, 137175, 3900, 19309, 4, 100094, 46683, 28219, 125195, 21543, 5701, 3789, 55300, 1884, 36917, 25632, 32354, 26366, 1810, 18499, 4358 ]

[ 0.080810546875, 0.19384765625, 0.1593017578125, 0.2359619140625, 0.2064208984375, 0.0782470703125, 0.17919921875, 0.1943359375, 0.081787109375, 0.094482421875, 0.258056640625, 0.1568603515625, 0.26416015625, 0.1171875, 0.21923828125, 0.0911865234375, 0.156494140625, 0.1529541015625...

embed

33263029_c0

33263029

haskell

0

Title: Turtle: Prompting for input, without a trailing newline Problem title: Turtle: Prompting for input, without a trailing newline Tags: haskell-turtle, haskell Problem: Turtle: Prompting for input, without a trailing newline I'm writing a console application that needs to prompt the user for several things. I'm usi...

Turtle: Prompting for input, without a trailing newline Turtle: Prompting for input, without a trailing newline haskell-turtle haskell Turtle Prompting Maybe Text Input raw_input Turtle: Prompting for input, without a trailing newline I'm writing a console application that needs to prompt the user for several things. I...

[ -0.0233154296875, 0.0125732421875, 0.005279541015625, 0.0274658203125, -0.01031494140625, 0.01202392578125, 0.0167236328125, -0.02294921875, -0.01348876953125, 0.00341796875, 0.0150146484375, 0.0000476837158203125, -0.0203857421875, 0.00482177734375, 0.00848388671875, 0.01226806640625,...

[ 4252, 17991, 1250, 2676, 1916, 100, 107730, 15490, 141037, 214, 3525, 2256, 1556, 142508, 987, 83425, 24129, 360, 49649, 73, 32562, 130250, 38415, 27117, 105876, 38937, 8966, 17368, 2130, 35773, 1294, 32354, 33342, 28, 3089, 29479, 3884, 7171...

[ 0.1883544921875, 0.2344970703125, 0.0936279296875, 0.18115234375, 0.0938720703125, 0.07415771484375, 0.19140625, 0.1162109375, 0.1505126953125, 0.0908203125, 0.08740234375, 0.1611328125, 0.07647705078125, 0.19873046875, 0.123046875, 0.0306243896484375, 0.120361328125, 0.08288574218...

embed

57540431_c1

57540431

haskell

1

02fd2/8.6.5/lib --bindir=/Users/808375/.stack/snapshots/x86_64-osx/de99b86bb99430d571d8ce91b535ceb539abe112ba7d6080374dd59296002fd2/8.6.5/bin --datadir=/Users/808375/.stack/snapshots/x86_64-osx/de99b86bb99430d571d8ce91b535ceb539abe112ba7d6080374dd59296002fd2/8.6.5/share --libexecdir=/Users/808375/.stack/snapshots/x86_6...

[ -0.0150146484375, 0.031982421875, -0.005950927734375, 0.00189208984375, -0.00433349609375, 0.0220947265625, -0.01177978515625, 0.0101318359375, 0.003143310546875, 0.024169921875, -0.016357421875, -0.0198974609375, -0.00970458984375, -0.017822265625, 0.005279541015625, 0.0279541015625, ...

[ 4648, 420, 71, 304, 23538, 5, 136473, 64, 5612, 4210, 7568, 936, 1369, 1062, 7, 1314, 163736, 85433, 590, 2594, 10957, 72697, 425, 15276, 13307, 9, 232, 112, 5046, 275, 5125, 617, 1197, 178837, 1019, 329, 12183, 758, 5843, 188758, 34669...

[ 0.1943359375, 0.1243896484375, 0.1156005859375, 0.16748046875, 0.2034912109375, 0.08642578125, 0.2841796875, 0.107177734375, 0.2401123046875, 0.12451171875, 0.23583984375, 0.20556640625, 0.02166748046875, 0.166015625, 0.191650390625, 0.191650390625, 0.1939697265625, 0.262939453125,...

embed

10971232_c0

10971232

haskell

0

Title: How do I use Unboxed Vectors? Problem title: How do I use Unboxed Vectors? Tags: haskell Problem: How do I use Unboxed Vectors? I am trying to implement a ray data type using the Vector type found here: http://www.haskell.org/haskellwiki/Numeric_Haskell:_A_Vector_Tutorial#Importing_the_library The Vector will on...

How do I use Unboxed Vectors? How do I use Unboxed Vectors? haskell qualified How Unboxed Vectors Main Data.Vector.Unboxed Vector Ray Not Failed How do I use Unboxed Vectors? I am trying to implement a ray data type using the Vector type found here: http://www.haskell.org/haskellwiki/Numeric_Haskell:_A_Vector_Tutorial#...

[ 0.0126953125, 0.033447265625, 0.0087890625, 0.0069580078125, 0.01422119140625, 0.0205078125, -0.006744384765625, -0.027099609375, -0.01611328125, -0.035400390625, -0.013671875, -0.0152587890625, 0.005218505859375, -0.0169677734375, -0.0263671875, -0.01385498046875, 0.00848388671875, ...

[ 11249, 4527, 992, 11728, 297, 52884, 22230, 1556, 142508, 217225, 12321, 11809, 26455, 18770, 14256, 2609, 31681, 11205, 190355, 54, 31577, 29479, 62656, 2053, 10644, 17368, 10557, 13691, 6495, 7, 15665, 77275, 6982, 150, 2844, 1221, 4734, 16...

[ 0.060546875, 0.1705322265625, 0.1468505859375, 0.2296142578125, 0.131103515625, 0.2279052734375, 0.2137451171875, 0.10247802734375, 0.190185546875, 0.141845703125, 0.03985595703125, 0.08251953125, 0.1878662109375, 0.2139892578125, 0.124755859375, 0.201416015625, 0.1524658203125, 0....

embed

36366479_c0

36366479

haskell

0

Title: Haskell: How to use let-in construction? Problem title: Haskell: How to use let-in construction? Tags: haskell Problem: Haskell: How to use let-in construction? I wrote a sort function. It's pretty weird. sort :: (Eq a, Ord a) => [a] -> [a] sort xs = repeat'' sort' (xs) (length xs) repeat'' f xs 0 = xs repeat'' ...

Haskell: How to use let-in construction? Haskell: How to use let-in construction? haskell Haskell How Ord n-1 x:y:xs x:xs y:xs Haskell: How to use let-in construction? I wrote a sort function. It's pretty weird. How can I prettify it using let-in construction? I think my try doesn't look good:

[ -0.01251220703125, 0.005584716796875, 0.020751953125, -0.0009307861328125, 0.00732421875, -0.00078582763671875, -0.006103515625, -0.01287841796875, 0.018798828125, -0.00994873046875, 0.0125732421875, 0.01507568359375, 0.002685546875, 0.007171630859375, 0.00897216796875, 0.0010375976562...

[ 20625, 142508, 11249, 4527, 2633, 9, 73, 50961, 47, 1556, 35379, 653, 5759, 1022, 53, 425, 12, 113, 54397, 12096, 32354, 28875, 179459, 4589, 7737, 17368, 9790, 6713, 4127 ]

[ 0.1246337890625, 0.196044921875, 0.07177734375, 0.1129150390625, 0.1766357421875, 0.062164306640625, 0.187255859375, 0.2137451171875, 0.0214080810546875, 0.11181640625, 0.178466796875, 0.055145263671875, 0.1234130859375, 0.0272979736328125, 0.042449951171875, 0.033416748046875, 0.000...

embed

15179316_c0

15179316

haskell

0

Title: Eliminating repetition in cabal files Problem title: Eliminating repetition in cabal files Tags: cabal, haskell Problem: Eliminating repetition in cabal files I often have similar properties in many stanzas of my .cabal files. E.g. Library x ... ghc-options: -O2 -Wall -fno-warn-missing-signatures -fwarn-incomple...

Eliminating repetition in cabal files Eliminating repetition in cabal files cabal haskell Eliminating Library Wall Executable Eliminating repetition in cabal files I often have similar properties in many stanzas of my .cabal files. E.g. Keeping them consistent is tedious and error-prone. Is there a better way? Even tri...

[ -0.005035400390625, -0.00921630859375, 0.00457763671875, 0.01116943359375, 0.000335693359375, -0.015869140625, 0.0035247802734375, 0.0164794921875, 0.0162353515625, 0.00994873046875, -0.021240234375, 0.004730224609375, 0.00640869140625, 0.001861572265625, 0.0002918243408203125, 0.01025...

[ 203358, 1916, 57346, 1363, 23, 109524, 102158, 1556, 142508, 103835, 23706, 211603, 2886, 27983, 21373, 183871, 5941, 169218, 5, 408, 3571, 83041, 2856, 74729, 120, 5670, 18499, 3454, 86, 11522, 3917, 88308, 6815, 44457, 66161, 5701, 765, 403...

[ 0.194580078125, 0.0517578125, 0.26611328125, 0.097900390625, 0.0226287841796875, 0.256591796875, 0.1839599609375, 0.101318359375, 0.1820068359375, 0.1568603515625, 0.14892578125, 0.1197509765625, 0.058685302734375, 0.11083984375, 0.1256103515625, 0.1219482421875, 0.06793212890625, ...

embed

17961273_c1

17961273

haskell

1

Couldn't match type `MobileCarrier' with `[Char]' Expected type: M.Map PersonName BillingAddress Actual type: M.Map MobileCarrier BillingAddress In the first argument of `lookup', namely `addressMap' In the second argument of `(>>=)', namely `lookup addressMap' In the expression: return person >>= lookup phoneMap >>= ...

[ -0.000789642333984375, 0.006988525390625, 0.0087890625, 0.0140380859375, 0.0025177001953125, 0.01806640625, 0.00665283203125, 0.000591278076171875, 0.00518798828125, -0.024658203125, 0.003997802734375, -0.00164031982421875, 0.00186920166015625, -0.005645751953125, 0.01165771484375, -0....

[ 191147, 18, 14858, 10644, 125833, 21851, 25388, 678, 84068, 60075, 13, 276, 5, 166179, 15270, 163612, 19893, 214, 161007, 100582, 19745, 5117, 10750, 64747, 2037, 107421, 17932, 30813, 1369, 29823, 125195, 30646, 3445, 6396, 6713, 24089, 2258, ...

[ 0.17626953125, 0.083251953125, 0.193603515625, 0.235595703125, 0.13818359375, 0.1278076171875, 0.2020263671875, 0.00177001953125, 0.21435546875, 0.1304931640625, 0.149658203125, 0.09600830078125, 0.00738525390625, 0.205078125, 0.1143798828125, 0.1605224609375, 0.1339111328125, 0.08...

embed

26333578_c0

26333578

haskell

0

Title: Conditionally perform an 'action' in do block Problem title: Conditionally perform an 'action' in do block Tags: haskell, conditional-statements Problem: Conditionally perform an 'action' in do block I have a function like this: myFnc :: foo -> StateT bar IO baz -- foo, bar, and baz are compl...

Conditionally perform an 'action' in do block Conditionally perform an 'action' in do block haskell conditional-statements Conditionally StateT Either Right Conditionally perform an 'action' in do block I have a function like this: I can think only of case : But case statement with only one clause l...

[ -0.00726318359375, -0.006744384765625, 0.0146484375, -0.01470947265625, -0.01141357421875, 0.01141357421875, 0.00054931640625, 0.01214599609375, 0.0103759765625, -0.007781982421875, 0.029296875, -0.00750732421875, -0.0184326171875, -0.0142822265625, -0.0107421875, 0.01904296875, -0.0...

[ 46347, 43315, 538, 51339, 3768, 44713, 54, 46389, 23, 1556, 142508, 35431, 289, 61340, 22836, 618, 9319, 90911, 32354, 1884, 831, 5351, 4734, 7225, 63805, 1632, 70731, 13, 33342, 114453, 11249, 25958 ]

[ 0.17236328125, 0.1622314453125, 0.043701171875, 0.179931640625, 0.09033203125, 0.1861572265625, 0.144775390625, 0.2152099609375, 0.044097900390625, 0.111572265625, 0.217041015625, 0.19775390625, 0.136474609375, 0.1502685546875, 0.1400146484375, 0.026153564453125, 0.029876708984375, ...

embed

21647780_c0

21647780

haskell

0

Title: Haskell: How to product a file like a list Problem title: Haskell: How to product a file like a list Tags: haskell Problem: Haskell: How to product a file like a list I am a new one for studying Haskell, and I want to write a small phone book program. I put the contact list in a file called phone.txt which like:...

Haskell: How to product a file like a list Haskell: How to product a file like a list haskell System.IO Haskell How phone.txt ReadMode Haskell: How to product a file like a list I am a new one for studying Haskell, and I want to write a small phone book program. I put the contact list in a file called phone.txt which l...

[ -0.003631591796875, 0.0019683837890625, 0.00958251953125, 0.0203857421875, -0.0072021484375, 0.0029754638671875, -0.015625, 0.0181884765625, -0.0032196044921875, -0.0230712890625, -0.01300048828125, -0.023193359375, -0.0023193359375, -0.01483154296875, 0.003997802734375, -0.00598144531...

[ 20625, 142508, 11249, 12996, 11435, 1884, 5303, 47, 10, 1556, 12353, 17780, 24089, 124326, 4764, 9083, 3525, 35187, 3444, 33022, 19336, 12877, 1528, 3884, 5470, 23, 5, 3293, 100, 16487, 14012, 390, 107730, 9351, 15400, 831, 959, 9969, 1340,...

[ 0.1357421875, 0.2408447265625, 0.0609130859375, 0.25439453125, 0.2108154296875, 0.18505859375, 0.2020263671875, 0.030914306640625, 0.0145721435546875, 0.1357421875, 0.079833984375, 0.1380615234375, 0.2010498046875, 0.253173828125, 0.1533203125, 0.1356201171875, 0.013763427734375, 0...

embed

8101067_c0

8101067

haskell

0

Title: Binary instance for an existential Problem title: Binary instance for an existential Tags: haskell Problem: Binary instance for an existential Given an existential data type, for example: data Foo = forall a . (Typeable a, Binary a) => Foo a I'd like to write instance Binary Foo . I can write the serialisation (...

Binary instance for an existential Binary instance for an existential haskell Binary Foo Typeable TypeRep Binary instance for an existential Given an existential data type, for example: I'd like to write instance Binary Foo . I can write the serialisation (serialise the TypeRep then serialise the value), but I can't fi...

[ 0.0283203125, -0.000148773193359375, -0.01019287109375, 0.0126953125, -0.00640869140625, 0.00579833984375, 0.000579833984375, 0.016357421875, 0.0103759765625, -0.025634765625, -0.01214599609375, -0.0177001953125, 0.0115966796875, 0.024658203125, -0.005157470703125, 0.000352859497070312...

[ 54092, 1294, 110527, 100, 99707, 15403, 1556, 142508, 9572, 31, 60457, 2886, 4332, 254, 2053, 10644, 27781, 1884, 33022, 831, 35686, 15032, 25435, 12811, 3075, 34292, 26366, 3642, 8, 184, 51626, 62822, 2967, 34475, 3871, 22288, 4420, 45, 10...

[ 0.2216796875, 0.142578125, 0.264404296875, 0.08331298828125, 0.1998291015625, 0.1295166015625, 0.12548828125, 0.2081298828125, 0.1787109375, 0.171630859375, 0.1988525390625, 0.165771484375, 0.1832275390625, 0.1510009765625, 0.1119384765625, 0.18115234375, 0.002685546875, 0.07629394...

embed

5784553_c0

5784553

haskell

0

Title: Getting the date in Haskell in the local timezone Problem title: Getting the date in Haskell in the local timezone Tags: date, haskell, time, timezone Problem: Getting the date in Haskell in the local timezone I am currently using the code below in a project date :: IO (Integer,Int,Int) -- :: (year,month,day) da...

Getting the date in Haskell in the local timezone Getting the date in Haskell in the local timezone date haskell time timezone Getting Haskell Integer Getting the date in Haskell in the local timezone I am currently using the code below in a project date :: IO (Integer,Int,Int) -- :: (year,month,day) date = getCurrentT...

[ 0.00153350830078125, -0.003753662109375, -0.002532958984375, 0.017578125, 0.01385498046875, -0.0005950927734375, -0.011474609375, 0.010986328125, -0.0159912109375, -0.044189453125, 0.00927734375, -0.007049560546875, 0.0032501220703125, 0.01116943359375, 0.00909423828125, 0.000938415527...

[ 210732, 5622, 23, 20625, 142508, 4000, 1733, 18979, 1556, 44401, 82424, 17368, 18151, 35064, 13452, 17780, 67, 1505, 18, 46799, 15477, 5636, 2046, 474, 15724, 70059, 30646, 47, 91127, 519, 9893, 486, 15390, 97141, 959, 8337, 26785, 11675, 3...

[ 0.0733642578125, 0.196533203125, 0.052703857421875, 0.145263671875, 0.25732421875, 0.146240234375, 0.1097412109375, 0.163330078125, 0.1134033203125, 0.1787109375, 0.010406494140625, 0.02587890625, 0.09130859375, 0.049102783203125, 0.1055908203125, 0.1556396484375, 0.0721435546875, ...

embed

60010138_c0

60010138

haskell

0

Title: Is it possible to combine sequence and join for monadically created ConduitTs that have actions in the same monad? Problem title: Is it possible to combine sequence and join for monadically created ConduitTs that have actions in the same monad? Tags: haskell, conduit Problem: Is it possible to combine sequence a...

Is it possible to combine sequence and join for monadically created ConduitTs that have actions in the same monad? Is it possible to combine sequence and join for monadically created ConduitTs that have actions in the same monad? haskell conduit ConduitTs ConduitT Foldable Is it possible to combine sequence and join fo...

[ -0.00179290771484375, 0.01385498046875, -0.0157470703125, 0.0230712890625, 0.00897216796875, -0.01019287109375, 0.00141143798828125, 0.00323486328125, 0.005584716796875, -0.021240234375, -0.02294921875, 0.0103759765625, 0.01123046875, 0.000263214111328125, -0.0186767578125, -0.00561523...

[ 2071, 7722, 70163, 40, 944, 3956, 136, 33284, 2667, 712, 75935, 1657, 112061, 618, 61972, 5701, 1556, 142508, 120565, 30077, 71, 2886, 442, 100, 765, 23, 209303, 32354, 168894, 2967, 110527, 42822, 19882, 1909, 44691, 53201 ]

[ 0.018707275390625, 0.1759033203125, 0.216064453125, 0.06756591796875, 0.140869140625, 0.12939453125, 0.0863037109375, 0.2164306640625, 0.10357666015625, 0.115966796875, 0.0897216796875, 0.0869140625, 0.1715087890625, 0.1837158203125, 0.156494140625, 0.04931640625, 0.09912109375, 0....

embed

15394608_c0

15394608

haskell

0

Title: Don't substitute HTML entities with HXT Problem title: Don't substitute HTML entities with HXT Tags: xml, hxt, haskell Problem: Don't substitute HTML entities with HXT How do you preserve HTML entities using HXT ? The withSubstHTMLEntities SystemConfig doesn't seem to change anything : runX $ xshow $ r...

Don't substitute HTML entities with HXT Don't substitute HTML entities with HXT xml hxt haskell Don HTML HXT Don't substitute HTML entities with HXT How do you preserve HTML entities using HXT ? The withSubstHTMLEntities SystemConfig doesn't seem to change anything : runX $ xshow $ readString [] "<doc><p> &gt...

[ 0.0048828125, 0.03857421875, 0.01275634765625, -0.0069580078125, -0.005950927734375, -0.01031494140625, -0.00012302398681640625, -0.0145263671875, 0.00811767578125, -0.0106201171875, -0.0179443359375, -0.0016937255859375, -0.02001953125, 0.021484375, 0.003265380859375, -0.0010528564453...

[ 3768, 18, 161740, 19097, 77630, 2449, 678, 572, 70981, 6, 131492, 1096, 29062, 1556, 142508, 7650, 54, 479, 86687, 17368, 96472, 271, 127068, 7768, 118, 12353, 83671, 48903, 15549, 11675, 1542, 1022, 31374, 3650, 12301, 71713, 214, 29713, 7...

[ 0.0709228515625, 0.03582763671875, 0.1923828125, 0.262939453125, 0.1884765625, 0.1180419921875, 0.1575927734375, 0.15869140625, 0.26708984375, 0.010955810546875, 0.1632080078125, 0.1007080078125, 0.1973876953125, 0.158447265625, 0.2177734375, 0.101806640625, 0.0062255859375, 0.1378...

embed

2496457_c0

2496457

haskell

0

Title: Haskell's type system treats a numerical value as function? Problem title: Haskell's type system treats a numerical value as function? Tags: haskell, numeric, typeclass, types Problem: Haskell's type system treats a numerical value as function? After playing around with haskell a bit I stumbled over th...

Haskell's type system treats a numerical value as function? Haskell's type system treats a numerical value as function? haskell numeric typeclass types Haskell Prelude Data.Maclaurin Num Haskell's type system treats a numerical value as function? After playing around with haskell a bit I stumbled over this fu...

[ 0.006072998046875, 0.01007080078125, 0.0064697265625, 0.012939453125, 0.003692626953125, 0.02880859375, -0.005889892578125, -0.00946044921875, -0.00982666015625, -0.034912109375, -0.0230712890625, 0.00133514404296875, -0.01031494140625, -0.0157470703125, 0, -0.01275634765625, 0.00665...

[ 20625, 142508, 3768, 10644, 5426, 85689, 54744, 6827, 34292, 237, 32354, 1556, 67413, 52895, 1914, 822, 11809, 55450, 17697, 2677, 52782, 7, 10, 75169, 10932, 4785, 18784, 40099, 645, 137989, 31255, 98169, 173, 18770, 9, 65421, 51776, 15700, ...

[ 0.1397705078125, 0.278564453125, 0.0562744140625, 0.258056640625, 0.2021484375, 0.1617431640625, 0.1849365234375, 0.12060546875, 0.2001953125, 0.13818359375, 0.2467041015625, 0.10546875, 0.1326904296875, 0.1439208984375, 0.05377197265625, 0.1392822265625, 0.0928955078125, 0.0632934...

embed

20948927_c0

20948927

haskell

0

Title: Can I make a pipe that consumes all of the producer output and passes it on as a list? Problem title: Can I make a pipe that consumes all of the producer output and passes it on as a list? Tags: haskell Problem: Can I make a pipe that consumes all of the producer output and passes it on as a list? I'm trying to ...

Can I make a pipe that consumes all of the producer output and passes it on as a list? Can I make a pipe that consumes all of the producer output and passes it on as a list? haskell Can Producer Pipe Consumer Can I make a pipe that consumes all of the producer output and passes it on as a list? I'm trying to use the Pi...

[ 0.01611328125, 0.0142822265625, -0.0238037109375, 0.035400390625, -0.0240478515625, 0.03173828125, -0.038818359375, 0.01123046875, -0.00015926361083984375, -0.014892578125, 0.0026702880859375, 0.01434326171875, 0.044921875, 0.00958251953125, -0.00628662109375, 0.000629425048828125, 0...

[ 4171, 87, 3249, 10, 137158, 450, 18588, 90, 756, 111, 108558, 140992, 10922, 98, 237, 5303, 136, 1556, 142508, 103687, 56, 93128, 13, 76980, 31577, 4527, 35773, 1294, 3299, 4488, 118664, 1884, 183278, 27875, 3714, 27489, 94418, 41170, 765, ...

[ 0.12744140625, 0.084716796875, 0.1549072265625, 0.045196533203125, 0.270751953125, 0.07208251953125, 0.2471923828125, 0.154296875, 0.1292724609375, 0.0728759765625, 0.23095703125, 0.2373046875, 0.1356201171875, 0.1552734375, 0.088134765625, 0.19873046875, 0.0310211181640625, 0.1372...

embed

21100762_c0

21100762

haskell

0

Title: How to pass command-line options to Alex in Cabal Problem title: How to pass command-line options to Alex in Cabal Tags: alex, haskell, cabal Problem: How to pass command-line options to Alex in Cabal In my current project I have a file Tokens.x that needs to be compiled to Tokens.hs by Alex. In my .cabal file I...

How to pass command-line options to Alex in Cabal How to pass command-line options to Alex in Cabal alex haskell cabal How Alex Cabal Tokens.x Tokens.hs Tokens How to pass command-line options to Alex in Cabal In my current project I have a file Tokens.x that needs to be compiled to Tokens.hs by Alex. In my .cabal file...

[ 0.01239013671875, 0.00135040283203125, 0.0159912109375, -0.0089111328125, -0.005950927734375, -0.007537841796875, 0.006561279296875, 0.0133056640625, 0.007080078125, 0.0010986328125, 0.00604248046875, -0.0172119140625, 0.0133056640625, 0.005767822265625, 0.002471923828125, 0.0128173828...

[ 11249, 27875, 75101, 2256, 50717, 47, 20984, 30438, 289, 23, 662, 425, 1556, 142508, 109524, 717, 84694, 127, 43581, 13452, 11435, 375, 5974, 408, 3571, 145870, 3789, 83279, 40059, 45367, 256, 7520, 28282, 15490, 20, 177, 35829, 36716, 527,...

[ 0.037353515625, 0.1221923828125, 0.1768798828125, 0.1260986328125, 0.2275390625, 0.115478515625, 0.2208251953125, 0.161865234375, 0.161376953125, 0.052337646484375, 0.0467529296875, 0.099853515625, 0.0694580078125, 0.152587890625, 0.193115234375, 0.1094970703125, 0.17236328125, 0.0...

embed

41491370_c0

41491370

haskell

0

Title: Access member of class instance from outside its definition Problem title: Access member of class instance from outside its definition Tags: haskell, monoids, typeclass Problem: Access member of class instance from outside its definition I have this type: newtype Mem s a = Mem { runMem :: s -> (a,s) } and I have...

Access member of class instance from outside its definition Access member of class instance from outside its definition haskell monoids typeclass outside Access Mem Monoid Access member of class instance from outside its definition I have this type: and I have to create an instance of monoid for this type, but to do so...

[ -0.0029144287109375, 0.00201416015625, 0.0235595703125, 0.0164794921875, 0.00133514404296875, 0.0264892578125, -0.0030059814453125, 0.0205078125, 0.0201416015625, -0.028564453125, 0.0014190673828125, 0.007781982421875, 0.00555419921875, 0.0108642578125, 0.00946044921875, -0.0224609375,...

[ 40266, 32786, 111, 18507, 110527, 1295, 50782, 6863, 80934, 1556, 142508, 22460, 30185, 10644, 67413, 17443, 77879, 532, 765, 903, 28282, 100, 4527, 163, 2676, 939, 136, 291, 9858, 71, 10, 211460, 1543, 2806, 1672, 20594, 450, 129745 ]

[ 0.22412109375, 0.25146484375, 0.11279296875, 0.205322265625, 0.24560546875, 0.1280517578125, 0.2098388671875, 0.0694580078125, 0.1663818359375, 0.1439208984375, 0.2432861328125, 0.19140625, 0.162109375, 0.1563720703125, 0.1624755859375, 0.168701171875, 0.1746826171875, 0.208984375,...

embed

48186231_c0

48186231

haskell

0

Title: What are the consequences of returning an IO action? Problem title: What are the consequences of returning an IO action? Tags: monads, io, io-monad, haskell Problem: What are the consequences of returning an IO action? In Haskell, the type constructor IO is a monad equipped with a return statement that lifts any...

What are the consequences of returning an IO action? What are the consequences of returning an IO action? monads io io-monad haskell What Hello What are the consequences of returning an IO action? In Haskell, the type constructor IO is a monad equipped with a return statement that lifts any expression to its IO version...

[ -0.01611328125, 0.00701904296875, -0.00106048583984375, 0.02294921875, 0.011962890625, 0.02392578125, 0.00531005859375, -0.0196533203125, -0.0177001953125, 0.005950927734375, 0.0059814453125, -0.041015625, -0.0068359375, 0.01409912109375, -0.007598876953125, -0.00970458984375, 0.0038...

[ 4865, 621, 70, 212678, 111, 30646, 214, 142, 17780, 22631, 2667, 712, 22995, 3796, 1556, 142508, 35378, 360, 20625, 10644, 64549, 748, 83, 10, 46979, 63805, 60520, 2499, 125195, 11389, 182747, 177691, 21771, 47, 3173, 831, 33022, 25632, 152...

[ 0.04229736328125, 0.0694580078125, 0.10986328125, 0.24609375, 0.0797119140625, 0.259033203125, 0.1160888671875, 0.055755615234375, 0.255615234375, 0.2095947265625, 0.108154296875, 0.1624755859375, 0.1915283203125, 0.05889892578125, 0.116455078125, 0.25634765625, 0.1033935546875, 0....

embed

9941199_c0

9941199

haskell

0

Title: how to translate Haskell into Scalaz? Problem title: how to translate Haskell into Scalaz? Tags: scala, scalaz, haskell, functor Problem: how to translate Haskell into Scalaz? One of my high school students and I are going to try to do a port of Haskell's Parsec parser combinator library into Scala. (It has the ...

how to translate Haskell into Scalaz? how to translate Haskell into Scalaz? scala scalaz haskell functor ParseError Haskell Scalaz Reply State Error Functor XXX scalaz.Functor ReplyFunctor ReplySU how to translate Haskell into Scalaz? One of my high school students and I are going to try to do a port of Haskell's Parse...

[ -0.0146484375, 0.01318359375, -0.0018768310546875, 0.0040283203125, 0.005401611328125, -0.00787353515625, -0.01019287109375, -0.037353515625, 0.007293701171875, -0.001556396484375, 0.00775146484375, -0.0137939453125, -0.0034942626953125, 0.01214599609375, -0.0169677734375, 0.0098876953...

[ 3642, 47, 3900, 19309, 20625, 142508, 3934, 152653, 1828, 32, 146232, 169, 1556, 7477, 18770, 2392, 184, 18468, 31611, 122813, 22836, 212059, 28670, 44585, 97249, 16395, 11192, 10696, 25921, 9790, 11469, 39797, 366, 2189, 22321, 35773, 11, 92...

[ 0.0858154296875, 0.04376220703125, 0.14697265625, 0.1741943359375, 0.1444091796875, 0.293701171875, 0.1744384765625, 0.199462890625, 0.2108154296875, 0.0113525390625, 0.193359375, 0.1524658203125, 0.1173095703125, 0.1138916015625, 0.1815185546875, 0.1024169921875, 0.04376220703125, ...

embed

24047364_c0

24047364

haskell

0

Title: How do I set up this package? Problem title: How do I set up this package? Tags: haskell, package, system Problem: How do I set up this package? This may be a bug, but I think I just need to set up my environment. I am on Ubuntu. I tried the package easyplot . It worked when I saved the plot to a file, but not t...

How do I set up this package? How do I set up this package? haskell package system How Prelude Graphics.EasyPlot X11 plot1.dat PNG test.png How do I set up this package? This may be a bug, but I think I just need to set up my environment. I am on Ubuntu. I tried the package easyplot . It worked when I saved the plot to...

[ 0.005828857421875, 0.0040283203125, 0.00909423828125, 0.0164794921875, -0.005645751953125, 0.006988525390625, 0.02099609375, -0.0244140625, 0.01226806640625, 0.031982421875, 0.004638671875, 0.0025482177734375, 0.0123291015625, 0.0084228515625, -0.002349853515625, 0.005767822265625, 0...

[ 11249, 5423, 1257, 903, 98169, 1556, 142508, 5426, 1914, 822, 112, 189682, 647, 162, 53, 683, 12631, 1193, 1662, 23577, 418, 5164, 8066, 3034, 128468, 54, 54608, 65998, 98, 116890, 37842, 23468, 105710, 79786, 57, 47, 11435, 959, 33949, 3...

[ 0.03961181640625, 0.12939453125, 0.1334228515625, 0.0743408203125, 0.222412109375, 0.0980224609375, 0.1937255859375, 0.1063232421875, 0.0787353515625, 0.15673828125, 0.1229248046875, 0.141845703125, 0.0229644775390625, 0.1290283203125, 0.0762939453125, 0.09521484375, 0.2125244140625,...

embed

58527107_c1

58527107

haskell

1

other functions and found that these operators are defined by the following definition: ghci> :t (*) (*) :: (Num a) => a -> a -> a However, when I run my code I get the following compilation error: Illegal polymorphic or qualified type: Num a => a -> a -> a Perhaps you intended to use RankNTypes or Rank2Types In the t...

[ -0.002105712890625, -0.006988525390625, 0.0087890625, -0.00775146484375, 0.021240234375, 0.00628662109375, 0.01123046875, -0.01226806640625, 0.006683349609375, -0.025634765625, 0.00086212158203125, -0.037353515625, 0.016357421875, -0.03173828125, -0.01080322265625, -0.01177978515625, ...

[ 3789, 32354, 6097, 39933, 61924, 71, 80934, 31380, 318, 2740, 18, 80019, 1984, 839, 316, 10, 44357, 33079, 33306, 11675, 18151, 70, 25632, 98352, 1363, 18499, 891, 86966, 35874, 178851, 1771, 707, 217225, 10644, 52782, 181799, 179140, 4527, ...

[ 0.018890380859375, 0.155517578125, 0.0142669677734375, 0.2337646484375, 0.1395263671875, 0.0215606689453125, 0.143310546875, 0.131103515625, 0.177001953125, 0.1014404296875, 0.0804443359375, 0.07989501953125, 0.0189208984375, 0.03106689453125, 0.158935546875, 0.1328125, 0.01022338867...

embed

63991471_c0

63991471

haskell

0

Title: Communication between actions in Applicative style Problem title: Communication between actions in Applicative style Tags: haskell, applicative, ghci Problem: Communication between actions in Applicative style Haskell design patterns, writes this example: (+) <$> Nothing <*> Just 10 <*> Just 20 to justify that t...

Communication between actions in Applicative style Communication between actions in Applicative style haskell applicative ghci Communication Applicative Nothing Just Non Num Use FlexibleContexts When Maybe Communication between actions in Applicative style Haskell design patterns, writes this example: to justify that t...

[ -0.0137939453125, 0.0181884765625, -0.0019989013671875, 0.0262451171875, 0.01055908203125, 0.03076171875, 0.0003814697265625, 0.00131988525390625, 0.00131988525390625, -0.0035247802734375, 0.00604248046875, -0.032470703125, -0.005767822265625, 0.0238037109375, 0.001953125, -0.023559570...

[ 87398, 17721, 61972, 5659, 11048, 4935, 20623, 1556, 142508, 41816, 31380, 318, 182747, 9563, 3775, 52782, 36836, 180842, 2661, 22829, 14847, 83425, 20625, 4331, 103510, 33022, 27781, 1660, 40383, 84046, 36398, 23, 2967, 959, 2046, 903, 9969, ...

[ 0.2132568359375, 0.1605224609375, 0.1796875, 0.1204833984375, 0.1512451171875, 0.1083984375, 0.203369140625, 0.1400146484375, 0.2188720703125, 0.15869140625, 0.115966796875, 0.1575927734375, 0.119384765625, 0.05255126953125, 0.100341796875, 0.1387939453125, 0.060394287109375, 0.148...

embed

64503153_c0

64503153

haskell

0

Title: Examples with Haskell-src-exts package Problem title: Examples with Haskell-src-exts package Tags: haskell, parsing, haskell-src-exts Problem: Examples with Haskell-src-exts package I'm working with Haskell and I want to build a typechecker for this language. To do this I need a way to parse it and I know that H...

Examples with Haskell-src-exts package Examples with Haskell-src-exts package haskell parsing haskell-src-exts Examples Haskell-src-exts Examples with Haskell-src-exts package I'm working with Haskell and I want to build a typechecker for this language. To do this I need a way to parse it and I know that Haskell-src-ex...

[ 0.0257568359375, 0.0076904296875, 0.0147705078125, 0.0152587890625, 0.0103759765625, 0.0159912109375, -0.01507568359375, -0.0059814453125, -0.009033203125, -0.04638671875, 0.0034332275390625, -0.0400390625, 0.01171875, 0.0111083984375, 0.00634765625, 0.0194091796875, 0.0045166015625,...

[ 89536, 99726, 678, 20625, 142508, 19437, 3355, 933, 98169, 1556, 366, 6953, 7, 20697, 3444, 45367, 10644, 78292, 56, 903, 46876, 3917, 184, 442, 60813, 12447, 20016, 6528, 3642, 43240, 27781, 57143, 4358, 91067, 12877, 9803, 9790, 15700, 15...

[ 0.1583251953125, 0.0650634765625, 0.079833984375, 0.097412109375, 0.1964111328125, 0.197509765625, 0.14306640625, 0.1552734375, 0.1759033203125, 0.105224609375, 0.143798828125, 0.01043701171875, 0.007843017578125, 0.049346923828125, 0.0200958251953125, 0.045989990234375, 0.1416015625...

embed

10166640_c0

10166640

haskell

0

Title: Haskell: Why was `par` defined the way it was? Problem title: Haskell: Why was `par` defined the way it was? Tags: multithreading, par, haskell, parallel-processing Problem: Haskell: Why was `par` defined the way it was? par is declared as: par :: a -> b -> b Notice, that argument one is thrown away. In order to...

Haskell: Why was `par` defined the way it was? Haskell: Why was `par` defined the way it was? multithreading par haskell parallel-processing Haskell Why Haskell: Why was `par` defined the way it was? par is declared as: Notice, that argument one is thrown away. In order to use par you need to play tricks like using the...

[ -0.00482177734375, 0.01300048828125, 0.00347900390625, 0.003692626953125, 0.00537109375, 0.0166015625, -0.0076904296875, -0.0240478515625, 0.01055908203125, 0.00830078125, -0.0032806396484375, 0.005584716796875, -0.005462646484375, 0.0189208984375, -0.0024566650390625, -0.0049133300781...

[ 20625, 142508, 12, 44084, 2500, 61924, 71, 70, 3917, 442, 509, 1135, 3869, 65847, 11, 6238, 366, 1556, 95103, 63923, 83, 159978, 237, 24494, 10750, 1632, 104250, 16065, 12989, 4527, 3871, 11301, 88308, 17368, 5701, 125195, 48716, 20028, 600...

[ 0.13232421875, 0.25, 0.016754150390625, 0.1671142578125, 0.26416015625, 0.183837890625, 0.050140380859375, 0.05352783203125, 0.15478515625, 0.0535888671875, 0.0858154296875, 0.003631591796875, 0.08966064453125, 0.1214599609375, 0.019989013671875, 0.012847900390625, 0.253662109375, ...

embed

12737167_c0

12737167

haskell

0

Title: Haskell Recursion using an Accumulator Problem title: Haskell Recursion using an Accumulator Tags: accumulator, haskell, function, recursion Problem: Haskell Recursion using an Accumulator I'm trying to make a function that will look for 3 identical and adjacent numbers given a list, for a solver I am trying to ...

Haskell Recursion using an Accumulator Haskell Recursion using an Accumulator accumulator haskell function recursion an Haskell Recursion Accumulator Haskell Recursion using an Accumulator I'm trying to make a function that will look for 3 identical and adjacent numbers given a list, for a solver I am trying to impleme...

[ -0.0147705078125, 0.0169677734375, 0.003662109375, 0.014892578125, 0.01153564453125, 0.0220947265625, -0.0147705078125, -0.00180816650390625, 0.007720947265625, 0.00360107421875, 0.00946044921875, -0.00022220611572265625, 0.00665283203125, 0.007781982421875, 0.0167236328125, -0.0100708...

[ 20625, 142508, 165428, 42, 6889, 17368, 29899, 316, 129073, 142, 183278, 1290, 1556, 32354, 195625, 1830, 31577, 3249, 6713, 138, 31943, 123594, 101935, 34475, 5303, 3115, 814, 29479, 16188, 106, 271, 4216, 47, 2389, 5423, 86991, 34292, 40907...

[ 0.1534423828125, 0.2347412109375, 0.1414794921875, 0.1368408203125, 0.097412109375, 0.076416015625, 0.081787109375, 0.1539306640625, 0.2198486328125, 0.0198516845703125, 0.1953125, 0.1279296875, 0.1505126953125, 0.1617431640625, 0.209228515625, 0.08056640625, 0.065185546875, 0.0076...

embed

2292729_c1

2292729

haskell

1

maybe "<not present>" show $ filterElement (byUser userid) ps elemNamed :: String -> [Content] -> Element elemNamed name = head . filter ((==name).qName.elName) . onlyElems byUser :: String -> Element -> Bool byUser id e = maybe False (==id) (findAttr creator e) where creator = QName "OwnerUserId" Nothing Nothing Wher...

[ -0.00101470947265625, 0.02392578125, 0.0087890625, -0.029541015625, 0.018798828125, 0.00628662109375, 0.00009632110595703125, -0.0172119140625, -0.01287841796875, -0.00872802734375, 0.01141357421875, 0.006011962890625, -0.0184326171875, -0.0164794921875, -0.00098419189453125, -0.004577...

[ 51139, 10869, 13379, 7639, 3650, 46312, 19929, 1272, 1062, 2189, 38937, 532, 24014, 88, 195, 163612, 71, 23351, 25352, 48325, 9351, 10336, 69112, 11627, 864, 4734, 7623, 390, 2460, 929, 3447, 28, 22225, 111607, 28848, 4448, 179505, 2396, 77...

[ 0.18212890625, 0.1619873046875, 0.255615234375, 0.12255859375, 0.1356201171875, 0.2044677734375, 0.16455078125, 0.0740966796875, 0.05767822265625, 0.12646484375, 0.125, 0.157470703125, 0.1163330078125, 0.00970458984375, 0.14892578125, 0.1466064453125, 0.082275390625, 0.09130859375,...

embed

37414984_c0

37414984

haskell

0

Title: switching component for ghc-mod Problem title: switching component for ghc-mod Tags: ghc-mod, haskell Problem: switching component for ghc-mod I have a project whose main cabal component is a library library hs-source-dirs: src ... and which also defines executable todo if !flag(example) Buildable: False ghc-opt...

switching component for ghc-mod switching component for ghc-mod ghc-mod haskell Buildable Wall DGHCJS_BROWSER Haskell2010 TodoDispatcher TodoStore TodoComponents Main.hs Configuring react-flux-1.0.3 EXCEPTION Could Use TodoViews.hs Locations x86_64-osx Cabal-1.22.8.0 TodoDispatcher.hs TodoDispatcher.lhs TodoDispatcher....

[ -0.01519775390625, 0.004058837890625, 0.01361083984375, -0.01458740234375, -0.005828857421875, -0.010986328125, -0.0142822265625, 0.0137939453125, 0.0225830078125, 0.0096435546875, 0.000507354736328125, -0.026611328125, 0.0194091796875, 0.018798828125, -0.00032806396484375, -0.01098632...

[ 101089, 214, 82761, 100, 31380, 238, 13415, 1556, 142508, 121137, 2886, 23706, 41877, 441, 64977, 20625, 11436, 26657, 44456, 4453, 165248, 10770, 54137, 12321, 127, 59994, 131300, 18026, 170179, 191147, 36836, 100474, 90788, 15276, 13307, 232, ...

[ 0.232421875, 0.072265625, 0.2479248046875, 0.045501708984375, 0.145263671875, 0.126220703125, 0.1766357421875, 0.09228515625, 0.1925048828125, 0.065185546875, 0.021820068359375, 0.1043701171875, 0.10382080078125, 0.010406494140625, 0.0963134765625, 0.090087890625, 0.119384765625, 0...

embed

39365402_c0

39365402

haskell

0

Title: Select which test to run with Hspec and stack Problem title: Select which test to run with Hspec and stack Tags: haskell-stack, hspec, haskell Problem: Select which test to run with Hspec and stack I've written a series of test, using the automatic spec discovery feature of Hspec. I'm also using stack as my buil...

Select which test to run with Hspec and stack Select which test to run with Hspec and stack haskell-stack hspec haskell Select Hspec Spec.hs Module0Spec.hs Module1Spec.hs Select which test to run with Hspec and stack I've written a series of test, using the automatic spec discovery feature of Hspec. I'm also using stac...

[ -0.005462646484375, -0.008544921875, -0.00506591796875, 0.006988525390625, -0.008056640625, 0.0019073486328125, -0.000518798828125, -0.005462646484375, 0.00787353515625, 0.00567626953125, 0.01092529296875, -0.000682830810546875, -0.001129150390625, 0.01519775390625, -0.0016021728515625, ...

[ 51620, 3034, 11675, 678, 572, 16711, 136, 177261, 1556, 142508, 590, 2594, 1096, 24990, 127, 63014, 2389, 47107, 59121, 36549, 101038, 48502, 103882, 60213, 17368, 237, 45367, 55516, 14364, 5, 7, 11435, 102158, 12921, 88996, 38415, 32562, 352...

[ 0.1175537109375, 0.2213134765625, 0.1492919921875, 0.1231689453125, 0.1605224609375, 0.26416015625, 0.0736083984375, 0.1986083984375, 0.1221923828125, 0.19140625, 0.080810546875, 0.070556640625, 0.096923828125, 0.1861572265625, 0.1195068359375, 0.0916748046875, 0.05224609375, 0.147...

embed

40959497_c0

40959497

haskell

0

Title: Are 'length' calls rewritten as constant ints by GHC? Problem title: Are 'length' calls rewritten as constant ints by GHC? Tags: haskell, ghc Problem: Are 'length' calls rewritten as constant ints by GHC? Just a random pondering looking at my numerous length calls, it occurs to me that surely...

Are 'length' calls rewritten as constant ints by GHC? Are 'length' calls rewritten as constant ints by GHC? haskell ghc GHC Are 'length' calls rewritten as constant ints by GHC? Just a random pondering looking at my numerous length calls, it occurs to me that surely the compiler can tell the length ...

[ 0.0087890625, 0.01513671875, 0.02001953125, 0.00093841552734375, -0.00060272216796875, 0.00628662109375, -0.01409912109375, 0.011474609375, 0.00469970703125, 0.000621795654296875, -0.01495361328125, -0.00689697265625, 0.005645751953125, 0.03076171875, 0.010009765625, 0.00537109375, 0...

[ 15901, 3768, 23986, 927, 11782, 7, 456, 5429, 75639, 237, 53697, 23, 933, 527, 73265, 32, 1556, 142508, 31380, 238, 390, 96759, 136300, 183851, 140909, 9077, 9969, 34759, 831, 14192, 2499, 5303, 45458, 566, 14311, 41159, 15005, 3900, 16082,...

[ 0.042694091796875, 0.0794677734375, 0.197021484375, 0.1700439453125, 0.2509765625, 0.0892333984375, 0.152587890625, 0.1767578125, 0.08636474609375, 0.06817626953125, 0.2125244140625, 0.1484375, 0.141845703125, 0.104248046875, 0.2264404296875, 0.001708984375, 0.115966796875, 0.24389...

embed

27192496_c0

27192496

haskell

0

Title: Parsec's satisfy equivalent in uu-parsinglib Problem title: Parsec's satisfy equivalent in uu-parsinglib Tags: haskell, uu-parsinglib, parser-combinators Problem: Parsec's satisfy equivalent in uu-parsinglib I am looking for a satisfy function like the one Parsec has. Something like: --The parser satis...

Parsec's satisfy equivalent in uu-parsinglib Parsec's satisfy equivalent in uu-parsinglib haskell uu-parsinglib parser-combinators Parsec Returns Char Bool Parser Insertion Parsec's satisfy equivalent in uu-parsinglib I am looking for a satisfy function like the one Parsec has. Something like: The only thing ...

[ -0.026123046875, 0.01422119140625, 0.0203857421875, 0.00421142578125, -0.01708984375, 0.01043701171875, 0.00555419921875, -0.018310546875, -0.01953125, 0.00567626953125, 0.00653076171875, -0.018798828125, 0.01495361328125, -0.009521484375, 0.007354736328125, -0.015380859375, -0.01562...

[ 2392, 39797, 3768, 40407, 53, 183234, 2051, 2500, 6953, 5612, 1556, 142508, 366, 2189, 19155, 22230, 173340, 21656, 2460, 929, 360, 16487, 100, 32354, 1884, 581, 4734, 13580, 14037, 915, 5464, 1814, 18929, 144570, 142, 1363, 237, 10750, 282...

[ 0.156494140625, 0.24365234375, 0.09881591796875, 0.2457275390625, 0.1453857421875, 0.1961669921875, 0.1661376953125, 0.132568359375, 0.0687255859375, 0.1549072265625, 0.084716796875, 0.201171875, 0.173828125, 0.20263671875, 0.1458740234375, 0.01531982421875, 0.154052734375, 0.11743...

embed

19301146_c0

19301146

haskell

0

Title: Constructing an identical lens Problem title: Constructing an identical lens Tags: lenses, haskell Problem: Constructing an identical lens I am trying to create a Lens from a getter and a setter which I got from another Lens : import Control.Lens idL :: Lens s t a b -> Lens s t a b idL l = lens (\s -> view l s) ...

Constructing an identical lens Constructing an identical lens lenses haskell Control.Lens Constructing Lens Expected Getting Actual Accessor Constructing an identical lens I am trying to create a Lens from a getter and a setter which I got from another Lens : However, it fails with an obscure (for me) error: What am I ...

[ -0.01129150390625, 0.0093994140625, -0.01031494140625, -0.00885009765625, 0.017822265625, -0.0059814453125, -0.01422119140625, -0.0167236328125, -0.01373291015625, -0.048095703125, 0.0081787109375, 0.037353515625, 0.0030975341796875, -0.018798828125, -0.0181884765625, 0.00201416015625,...

[ 1657, 36716, 214, 31943, 6827, 3098, 7, 142, 96, 47754, 1556, 142508, 27131, 866, 1755, 18226, 60075, 13, 210732, 100582, 40266, 748, 31577, 28282, 1295, 2046, 720, 136, 88685, 4163, 15700, 35782, 160608, 18499, 444, 20594, 44691, 62822, 75...

[ 0.06597900390625, 0.185791015625, 0.03326416015625, 0.1778564453125, 0.1458740234375, 0.2137451171875, 0.0804443359375, 0.0447998046875, 0.1285400390625, 0.102783203125, 0.112548828125, 0.18896484375, 0.15966796875, 0.0982666015625, 0.127197265625, 0.201171875, 0.05474853515625, 0....

embed

21991164_c0

21991164

haskell

0

Title: In Haskell, how can I replace an ASCII character sub-string in a ByteString? Problem title: In Haskell, how can I replace an ASCII character sub-string in a ByteString? Tags: bytestring, haskell Problem: In Haskell, how can I replace an ASCII character sub-string in a ByteString? In Haskell , how can I replace a...

In Haskell, how can I replace an ASCII character sub-string in a ByteString? In Haskell, how can I replace an ASCII character sub-string in a ByteString? bytestring haskell Haskell ASCII ByteString Data.ByteString.Search In Haskell, how can I replace an ASCII character sub-string in a ByteString? In Haskell , how can I...

[ 0.0016326904296875, 0.00933837890625, 0.01226806640625, 0.0264892578125, -0.0032196044921875, 0.00653076171875, 0.00106048583984375, -0.004547119140625, -0.003631591796875, 0.0439453125, 0.00970458984375, -0.0133056640625, -0.013916015625, 0.013916015625, -0.016845703125, -0.0075988769...

[ 360, 20625, 142508, 3642, 831, 91995, 125429, 10001, 62816, 1614, 9, 91693, 3311, 67, 71713, 214, 23, 390, 1556, 11809, 75358, 221175, 87, 11249, 4527, 32354, 79315, 10750, 48322, 51339, 674, 10422, 96760, 47, 23351, 161740, 16750, 4420 ]

[ 0.049896240234375, 0.1207275390625, 0.246826171875, 0.07049560546875, 0.05645751953125, 0.2119140625, 0.097412109375, 0.22509765625, 0.183349609375, 0.224853515625, 0.0198516845703125, 0.2373046875, 0.08929443359375, 0.154541015625, 0.197021484375, 0.1070556640625, 0.021331787109375,...

embed

8726279_c0

8726279

haskell

0

Title: Error building haskell llvm bindings on Linux Problem title: Error building haskell llvm bindings on Linux Tags: haskell, llvm, llvm-3.0 Problem: Error building haskell llvm bindings on Linux I built llvm 3.0, downloaded from here . I did: ./configure CC=gcc CXX=g++ --enable-shared sudo make -j5 -s install Next,...

Error building haskell llvm bindings on Linux Error building haskell llvm bindings on Linux haskell llvm llvm-3.0 Error Linux llvm-3.0 Error building haskell llvm bindings on Linux I built llvm 3.0, downloaded from here . I did: Next, I cloned the LLVM bindings from here . I am trying: But I get: I am running Linux Min...

[ -0.0096435546875, 0.014404296875, -0.01422119140625, -0.0146484375, 0.015869140625, -0.01068115234375, 0.0036773681640625, -0.0164794921875, -0.0078125, 0.007049560546875, -0.00048828125, -0.04296875, 0.019775390625, 0.0142822265625, 0.010009765625, 0.0169677734375, -0.00424194335937...

[ 212059, 33976, 1556, 142508, 96, 3723, 39, 128239, 7, 98, 29908, 132265, 88303, 17596, 7026, 297, 3688, 20450, 99954, 47599, 31577, 444, 51042, 62802, 7911, 3137, 3181, 85540, 47, 116890, 4541, 77495, 527, 73265, 83, 91532, 120883, 37842, 1...

[ 0.1668701171875, 0.194580078125, 0.161376953125, 0.2467041015625, 0.0633544921875, 0.21044921875, 0.208740234375, 0.2164306640625, 0.0736083984375, 0.091552734375, 0.1964111328125, 0.2442626953125, 0.11572265625, 0.2091064453125, 0.052093505859375, 0.0079345703125, 0.021148681640625,...

embed

68193099_c0

68193099

haskell

0

Title: What do bracketed double dots mean in Haskell? Problem title: What do bracketed double dots mean in Haskell? Tags: notation, haskell Problem: What do bracketed double dots mean in Haskell? I understand that .. can be used in ranges--i.e., [1..3] == [1,2,3] , and [10..] is an infinite list starting at 10. However...

What do bracketed double dots mean in Haskell? What do bracketed double dots mean in Haskell? notation haskell Colog What Haskell HasLog What do bracketed double dots mean in Haskell? I understand that .. can be used in ranges--i.e., [1..3] == [1,2,3] , and [10..] is an infinite list starting at 10. However, recently I...

[ 0.00022411346435546875, -0.0135498046875, -0.004150390625, 0.007598876953125, 0.00958251953125, 0.0133056640625, -0.007781982421875, -0.011474609375, 0.004852294921875, -0.004638671875, -0.00010251998901367188, -0.01031494140625, -0.01141357421875, -0.004730224609375, -0.006988525390625,...

[ 4865, 1620, 27853, 297, 41929, 54, 933, 29459, 23, 20625, 142508, 110, 22062, 1556, 313, 14071, 113972, 28219, 1468, 831, 11814, 37457, 68252, 96386, 69112, 155761, 963, 54241, 5303, 72134, 99, 4068, 86681, 6097, 46132, 237, 5, 10666, 24927...

[ 0.04974365234375, 0.1971435546875, 0.2073974609375, 0.0972900390625, 0.203369140625, 0.190673828125, 0.150390625, 0.15673828125, 0.0750732421875, 0.15771484375, 0.25439453125, 0.0889892578125, 0.017608642578125, 0.1163330078125, 0.043182373046875, 0.1917724609375, 0.224609375, 0.05...

embed

29777127_c0

29777127

haskell

0

Title: How to call multiple functions within the code in haskell Problem title: How to call multiple functions within the code in haskell Tags: haskell Problem: How to call multiple functions within the code in haskell I would like to call multiple functions from within the code, meaning that by executing the .hs file,...

How to call multiple functions within the code in haskell How to call multiple functions within the code in haskell haskell How para1 para2 How to call multiple functions within the code in haskell I would like to call multiple functions from within the code, meaning that by executing the .hs file, all functions named ...

[ -0.011474609375, -0.000202178955078125, -0.0091552734375, 0.026123046875, -0.0103759765625, 0.0062255859375, 0.0194091796875, -0.0240478515625, 0.01324462890625, -0.031982421875, 0.00653076171875, -0.033935546875, 0.0030670166015625, 0.02001953125, -0.00836181640625, -0.01226806640625,...

[ 11249, 47, 11782, 48716, 32354, 7, 28032, 18151, 23, 1556, 142508, 121, 418, 304, 1884, 1295, 71924, 5, 127, 11435, 756, 24, 4806, 1221, 37842, 5201, 678, 3884, 71713, 866, 19, 43257, 96704, 4488, 6528, 82428, 18, 759, 97249, 10763, 306...

[ 0.08172607421875, 0.0350341796875, 0.22119140625, 0.265869140625, 0.28271484375, 0.1080322265625, 0.18798828125, 0.20263671875, 0.08172607421875, 0.18310546875, 0.2381591796875, 0.127197265625, 0.05657958984375, 0.1292724609375, 0.037384033203125, 0.0941162109375, 0.163330078125, 0...

embed

64738061_c0

64738061

haskell

0

Title: Haskell find and replace values from list using map Problem title: Haskell find and replace values from list using map Tags: haskell Problem: Haskell find and replace values from list using map I have a list of lists in single chars like: [["a"],["b"],["c"],["d"]] , and I have a map for example [("a", "A"), ("b"...

Haskell find and replace values from list using map Haskell find and replace values from list using map haskell list map Haskell Haskell find and replace values from list using map I have a list of lists in single chars like: [["a"],["b"],["c"],["d"]] , and I have a map for example [("a", "A"), ("b", "B")] , I would li...

[ -0.00592041015625, 0.005523681640625, 0.00164794921875, -0.000698089599609375, -0.01263427734375, 0.010009765625, 0, 0.0169677734375, -0.00124359130859375, 0.0223388671875, 0.01251220703125, -0.01611328125, 0.0167236328125, 0.005218505859375, -0.0169677734375, 0.0025787353515625, 0.0...

[ 20625, 142508, 7413, 136, 91995, 142424, 1295, 5303, 17368, 22288, 1556, 87, 765, 11001, 21441, 1884, 11, 275, 238, 71, 27781, 571, 2806, 80854, 23, 450, 14858, 22799, 34292, 678, 100, 87388, 47143, 152028, 36917, 284, 3444, 2046, 4420, 9...

[ 0.1585693359375, 0.21533203125, 0.18603515625, 0.06689453125, 0.256591796875, 0.2340087890625, 0.179443359375, 0.2406005859375, 0.08795166015625, 0.253662109375, 0.17138671875, 0.001220703125, 0.0191650390625, 0.14453125, 0.149169921875, 0.06787109375, 0.035064697265625, 0.07006835...

embed

10055947_c0

10055947

haskell

0

Title: Sort a list of pairs using sort Haskell Problem title: Sort a list of pairs using sort Haskell Tags: haskell Problem: Sort a list of pairs using sort Haskell I have a function (frequency) which that counts how many times each distinct value in a list occurs in that list. For example, frequency "ababca" should re...

Sort a list of pairs using sort Haskell Sort a list of pairs using sort Haskell haskell sort Haskell Party Green Red Blue Sort a list of pairs using sort Haskell I have a function (frequency) which that counts how many times each distinct value in a list occurs in that list. For example, should return: This works fine ...

[ 0.00112152099609375, 0.00153350830078125, -0.0106201171875, -0.017333984375, -0.015380859375, -0.00946044921875, -0.01495361328125, -0.024169921875, -0.001739501953125, -0.004913330078125, -0.00958251953125, 0.005615234375, 0.0169677734375, -0.00640869140625, -0.013671875, -0.028320312...

[ 53666, 10, 5303, 111, 80836, 7, 17368, 12096, 20625, 142508, 1556, 31016, 15497, 6096, 22928, 32354, 12176, 944, 27771, 54529, 3642, 5941, 20028, 12638, 117781, 34292, 74918, 27781, 30646, 43240, 5885, 3871, 47, 5117, 12830, 28032, 104851, 14...

[ 0.26806640625, 0.005035400390625, 0.21435546875, 0.0235137939453125, 0.25390625, 0.048980712890625, 0.0843505859375, 0.262451171875, 0.1414794921875, 0.25146484375, 0.14111328125, 0.2171630859375, 0.148681640625, 0.134521484375, 0.1787109375, 0.1534423828125, 0.125, 0.130859375, ...

embed

50520423_c0

50520423

haskell

0

Title: Haskell - how to use if then else in list comprehension? Problem title: Haskell - how to use if then else in list comprehension? Tags: haskell Problem: Haskell - how to use if then else in list comprehension? I wish to generate a list of points from rolling two dice. If the two dice show the same value then the ...

Haskell - how to use if then else in list comprehension? Haskell - how to use if then else in list comprehension? haskell Haskell Haskell - how to use if then else in list comprehension? I wish to generate a list of points from rolling two dice. If the two dice show the same value then the output points will become (i,...

[ -0.000896453857421875, -0.004119873046875, 0.00665283203125, -0.009765625, 0.010009765625, 0.0184326171875, -0.004638671875, 0.0211181640625, -0.002044677734375, 0.00860595703125, 0.006561279296875, -0.0213623046875, 0.0027923583984375, 0.01092529296875, -0.01904296875, 0.0169677734375...

[ 20625, 142508, 3642, 4527, 2174, 7068, 37076, 5303, 46683, 3220, 6889, 23, 1556, 32599, 139392, 26847, 1295, 21972, 214, 6626, 13747, 4263, 7639, 5701, 34292, 140992, 24209, 14, 18151, 30957, 527, 73265, 53418, 375, 5974, 41206 ]

[ 0.100830078125, 0.2149658203125, 0.049835205078125, 0.11181640625, 0.1959228515625, 0.173828125, 0.2191162109375, 0.185546875, 0.1083984375, 0.1234130859375, 0.041259765625, 0.03765869140625, 0.080810546875, 0.047637939453125, 0.128662109375, 0.1561279296875, 0.05682373046875, 0.10...

embed

51113460_c1

51113460

haskell

1

course undesirable behaviour. Another issue is that this timeout is implemented after a new msg is received by a client. Instead I would like to the timeout to only be implemented when the game is in a particular state - that is a state in which the player represented by this particular thread is the next player to ac...

[ -0.01708984375, -0.00885009765625, -0.005706787109375, -0.01123046875, 0.01556396484375, -0.0012054443359375, -0.000453948974609375, 0.01116943359375, 0.00982666015625, -0.03515625, 0.013427734375, 0.0032501220703125, -0.01904296875, 0.0020294189453125, -0.00830078125, 0.00503540039062...

[ 15411, 9232, 12915, 2886, 224833, 31089, 1733, 6056, 29479, 3525, 68163, 177, 75204, 23282, 1884, 4734, 297, 3229, 6712, 17311, 11341, 58585, 33636, 86997, 11737, 27992, 22631, 22, 23, 2684, 1632, 5701, 20596, 187016, 15504, 35509, 35431, 137...

[ 0.1839599609375, 0.06976318359375, 0.1622314453125, 0.01025390625, 0.177978515625, 0.055328369140625, 0.2293701171875, 0.216796875, 0.1343994140625, 0.0067138671875, 0.050018310546875, 0.055877685546875, 0.080322265625, 0.1297607421875, 0.03375244140625, 0.01080322265625, 0.018112182...

embed

51292955_c0

51292955

haskell

0

Title: Inherit typeclass with a function with the same name Problem title: Inherit typeclass with a function with the same name Tags: haskell Problem: Inherit typeclass with a function with the same name I have a inheritance of typeclasses with a function with the same name, but different types. Code: class Equatable a...

Inherit typeclass with a function with the same name Inherit typeclass with a function with the same name haskell Inherit Equatable Bool Entity type1 type2 TKey Inherit typeclass with a function with the same name I have a inheritance of typeclasses with a function with the same name, but different types. Code: Error: ...

[ 0.010986328125, 0.00897216796875, 0.0113525390625, 0.0201416015625, -0.0014801025390625, -0.01165771484375, 0.0028076171875, 0.01275634765625, 0.0032958984375, -0.0262451171875, -0.01312255859375, 0.00933837890625, -0.0014190673828125, 0.006011962890625, 0.0037384033203125, 0.006164550...

[ 360, 3334, 217, 10644, 67413, 678, 32354, 70, 5701, 9351, 10, 1556, 142508, 241, 90065, 2886, 2460, 929, 16511, 2481, 418, 304, 384, 162429, 765, 23, 7154, 111, 90, 4, 1284, 12921, 52895, 5, 28864, 212059, 31577, 40226, 67, 11737, 18151...

[ 0.10028076171875, 0.2269287109375, 0.1478271484375, 0.1943359375, 0.246337890625, 0.1014404296875, 0.18701171875, 0.024627685546875, 0.140869140625, 0.122314453125, 0.006561279296875, 0.1337890625, 0.2041015625, 0.0255126953125, 0.1309814453125, 0.0804443359375, 0.06170654296875, 0...

embed

73831759_c0

73831759

haskell

0

Title: Haskell Patterns not matched: (_:_) _ Problem title: Haskell Patterns not matched: (_:_) _ Tags: pattern-matching, haskell, guard-clause Problem: Haskell Patterns not matched: (_:_) _ I'm writing a function that takes an input a list, creates sublists, and retrieves n elements that it outputs into a new list. I'...

Haskell Patterns not matched: (_:_) _ Haskell Patterns not matched: (_:_) _ pattern-matching haskell guard-clause Haskell Patterns _:_ Empty Pattern Haskell Patterns not matched: (_:_) _ I'm writing a function that takes an input a list, creates sublists, and retrieves n elements that it outputs into a new list. I'm wr...

[ -0.0228271484375, 0.0230712890625, 0.0277099609375, -0.0107421875, -0.00152587890625, -0.001434326171875, -0.020263671875, -0.0174560546875, 0.01953125, 0.042236328125, 0.02392578125, -0.0220947265625, 0.0025787353515625, 0.000018596649169921875, -0.0022735595703125, -0.003997802734375...

[ 20625, 142508, 9876, 22766, 959, 14858, 297, 454, 103510, 98753, 1556, 56050, 18347, 4032, 31678, 32562, 32354, 107730, 5303, 1614, 6562, 97351, 653, 80854, 140992, 7, 96819, 34292, 13695, 18499, 8335, 3055, 1779, 12, 152, 101, 42485, 31089 ]

[ 0.132080078125, 0.21337890625, 0.1561279296875, 0.1591796875, 0.1771240234375, 0.2064208984375, 0.1131591796875, 0.040740966796875, 0.1881103515625, 0.1700439453125, 0.1185302734375, 0.2188720703125, 0.057891845703125, 0.0018310546875, 0.060089111328125, 0.0999755859375, 0.1025390625...

embed

24958878_c0

24958878

haskell

0

Title: Number of times that a word appears in a list of words haskell Problem title: Number of times that a word appears in a list of words haskell Tags: haskell, list, matrix, tuples Problem: Number of times that a word appears in a list of words haskell I just started programming in Haskell and I want to create a fun...

Number of times that a word appears in a list of words haskell Number of times that a word appears in a list of words haskell haskell list matrix tuples Number Number of times that a word appears in a list of words haskell I just started programming in Haskell and I want to create a function takes a list of words and a...

[ 0.0057373046875, -0.003875732421875, -0.0079345703125, 0.01214599609375, 0.01226806640625, -0.005035400390625, -0.002899169921875, 0.008544921875, 0.011474609375, -0.033935546875, -0.024658203125, -0.0240478515625, 0.01544189453125, 0.031494140625, -0.017822265625, 0.0091552734375, 0...

[ 103332, 111, 20028, 450, 2565, 135179, 23, 5303, 34153, 1556, 142508, 50944, 425, 370, 99726, 56037, 20625, 3444, 28282, 32354, 51776, 136, 120820, 15504, 33938, 104192, 30646, 74918, 5941, 32565, 8705, 21771, 3917, 32562, 1632, 100, 42, 7794...

[ 0.1478271484375, 0.06219482421875, 0.220947265625, 0.046539306640625, 0.1995849609375, 0.1741943359375, 0.081298828125, 0.1553955078125, 0.1810302734375, 0.1441650390625, 0.195068359375, 0.1602783203125, 0.0753173828125, 0.09716796875, 0.16357421875, 0.102294921875, 0.1190185546875, ...

embed

27711396_c0

27711396

haskell

0

Title: Indentation with Let Statements Problem title: Indentation with Let Statements Tags: haskell Problem: Indentation with Let Statements I'm afraid I'm tapped out on understanding this and the let block in general. The following code: splitWith tf xs |(null xs) = [[]] |((length xs) == 1) = [xs] |otherwise = let tpl...

Indentation with Let Statements Indentation with Let Statements haskell Indentation Statements Indentation with Let Statements I'm afraid I'm tapped out on understanding this and the let block in general. The following code: Creates this syntax error: This happened after I got rid of tabs in Sublime Text 2 and put spac...

[ 0.00022125244140625, 0.01220703125, -0.0107421875, 0.0191650390625, -0.00299072265625, 0.01446533203125, 0.010986328125, -0.01153564453125, 0.0159912109375, -0.00775146484375, -0.006103515625, -0.01031494140625, -0.01068115234375, 0.01806640625, 0.0186767578125, -0.0019989013671875, ...

[ 360, 555, 22062, 678, 10842, 22836, 9035, 1556, 142508, 158200, 2633, 46389, 25632, 18151, 151313, 903, 6002, 86531, 18499, 31351, 20928, 8273, 150, 282, 24129, 116, 32628, 23, 13315, 77336, 2203, 24092, 7103, 1022, 44691 ]

[ 0.0482177734375, 0.1466064453125, 0.08721923828125, 0.081787109375, 0.2254638671875, 0.201904296875, 0.050048828125, 0.0911865234375, 0.168212890625, 0.035858154296875, 0.177490234375, 0.1634521484375, 0.006683349609375, 0.07379150390625, 0.042633056640625, 0.0166015625, 0.0438842773...

embed

44320709_c0

44320709

haskell

0

Title: Generating "expected" style error messages from Happy Problem title: Generating "expected" style error messages from Happy Tags: happy, haskell Problem: Generating "expected" style error messages from Happy As Happy generates a state machine and runs through it upon parsing, I presume when hi...

Generating "expected" style error messages from Happy Generating "expected" style error messages from Happy happy haskell Happy Generating Generating "expected" style error messages from Happy As Happy generates a state machine and runs through it upon parsing, I presume when hitting a parse error i...

[ 0.01263427734375, 0.006134033203125, -0.00714111328125, 0.019775390625, -0.00830078125, 0.00927734375, -0.01019287109375, -0.005126953125, 0.007354736328125, 0.00433349609375, 0.0150146484375, 0.002593994140625, -0.00144195556640625, -0.01092529296875, 0.001983642578125, 0.013793945312...

[ 155370, 1916, 83613, 13, 89829, 20623, 18499, 89914, 1295, 32506, 17723, 1556, 142508, 1301, 139392, 11341, 36279, 127877, 8305, 366, 5962, 184, 19048, 14192, 2367, 47, 84694, 509, 41206, 214, 109954, 2046, 903, 4677, 2831, 2448, 1810, 31913,...

[ 0.160400390625, 0.02410888671875, 0.08154296875, 0.1162109375, 0.1138916015625, 0.162841796875, 0.1866455078125, 0.1036376953125, 0.0191497802734375, 0.2103271484375, 0.1917724609375, 0.07958984375, 0.1805419921875, 0.01031494140625, 0.145751953125, 0.0921630859375, 0.0987548828125, ...

embed

48857586_c0

48857586

haskell

0

Title: Haskell circular definition interrupt Problem title: Haskell circular definition interrupt Tags: functional-programming, haskell Problem: Haskell circular definition interrupt Hello everyone i came over a curious thing trying to learn circular definition in Haskell. We have these two cases: module Main where mgo...

Haskell circular definition interrupt Haskell circular definition interrupt functional-programming haskell Haskell Main Haskell circular definition interrupt Hello everyone i came over a curious thing trying to learn circular definition in Haskell. We have these two cases: For the code above i get this output [1,1,1,1,...

[ 0.01171875, -0.0091552734375, 0.00665283203125, 0.00775146484375, -0.00823974609375, -0.0025787353515625, 0.00579833984375, 0.0130615234375, -0.00335693359375, -0.0277099609375, -0.00173187255859375, -0.00982666015625, 0.00701904296875, 0.028564453125, 0.0234375, 0.00020313262939453125...

[ 20625, 142508, 115339, 80934, 206735, 123309, 28966, 1556, 12321, 35378, 30309, 645, 193844, 13580, 31577, 30698, 23, 6626, 50218, 18151, 36917, 2046, 903, 140992, 68252, 4, 418, 76172, 28219, 15400, 1284, 502, 2661, 78662, 44851, 9167, 3674, ...

[ 0.1383056640625, 0.2294921875, 0.252197265625, 0.16455078125, 0.294189453125, 0.1470947265625, 0.12548828125, 0.1337890625, 0.08203125, 0.0207366943359375, 0.06060791015625, 0.046112060546875, 0.0677490234375, 0.03656005859375, 0.032806396484375, 0.05828857421875, 0.003936767578125, ...

embed

30691346_c0

30691346

haskell

0

Title: Pattern matching on variant without deconstructing in Haskell Problem title: Pattern matching on variant without deconstructing in Haskell Tags: haskell, pattern-matching Problem: Pattern matching on variant without deconstructing in Haskell In the following code, the function disp is defined by de-constructing ...

Pattern matching on variant without deconstructing in Haskell Pattern matching on variant without deconstructing in Haskell haskell pattern-matching Pattern Haskell Sum Expr Name Show Pattern matching on variant without deconstructing in Haskell In the following code, the function disp is defined by de-constructing Sum...

[ 0.006500244140625, -0.0002498626708984375, 0.0159912109375, 0.018310546875, 0.0030059814453125, 0.007110595703125, -0.043701171875, 0.0013885498046875, 0.0054931640625, -0.0177001953125, 0.040771484375, -0.03515625, -0.004486083984375, 0.00439453125, 0.009521484375, 0.01422119140625, ...

[ 9876, 22766, 14858, 214, 98, 20117, 15490, 8, 2271, 36716, 20625, 142508, 1556, 103510, 98753, 36335, 60075, 42, 15757, 17367, 25632, 18151, 32354, 58580, 61924, 390, 876, 501, 109312, 122905, 1916, 2967, 2301, 18, 3871, 136, 442, 10644, 39...

[ 0.149169921875, 0.1163330078125, 0.2261962890625, 0.044677734375, 0.0673828125, 0.226318359375, 0.134033203125, 0.19970703125, 0.06195068359375, 0.1168212890625, 0.13232421875, 0.232177734375, 0.1190185546875, 0.1859130859375, 0.23193359375, 0.16015625, 0.06292724609375, 0.08380126...

embed

5477164_c0

5477164

haskell

0

Title: Haskell understanding flow Problem title: Haskell understanding flow Tags: haskell Problem: Haskell understanding flow I'm new to haskell, I was trying to write a string split function delim = '|' splitStr::[Char]->[[Char]]->[[Char]] splitStr list y | sL > 0 && sL < length(list) = splitStr (drop (sL+1) list) [su...

Haskell understanding flow Haskell understanding flow haskell Haskell Char Main Haskell understanding flow I'm new to haskell, I was trying to write a string split function However, the above code always returns the String in reverse order changing from y++[subList] to [subList]++y still gives the same result. I know t...

[ -0.0103759765625, 0.0179443359375, 0.00396728515625, 0.0078125, -0.0250244140625, 0.0225830078125, 0.0023956298828125, 0.00836181640625, -0.005218505859375, 0.0162353515625, 0.02099609375, 0.006103515625, 0.0003204345703125, 0.004119873046875, -0.004119873046875, 0.0072021484375, 0.0...

[ 20625, 142508, 100094, 86608, 1556, 21656, 12321, 3525, 31577, 33022, 79315, 65450, 32354, 70, 36917, 18151, 11343, 30646, 23351, 214, 23, 39531, 184, 12989, 151134, 1295, 113, 37223, 22144, 154663, 47, 53, 7464, 76199, 5701, 16750, 11522, 15...

[ 0.1485595703125, 0.197998046875, 0.140869140625, 0.242431640625, 0.15087890625, 0.122314453125, 0.08544921875, 0.04296875, 0.0457763671875, 0.03985595703125, 0.203369140625, 0.2261962890625, 0.1478271484375, 0.040985107421875, 0.0792236328125, 0.10546875, 0.1158447265625, 0.1367187...

embed

11158023_c0

11158023

haskell

0

Title: How to use GADTs in Hugs Problem title: How to use GADTs in Hugs Tags: hugs, haskell, ghc, gadt, functional-programming Problem: How to use GADTs in Hugs I'd like to write a Haskell program that uses GADTs interactively on a platform not supported by GHCi (namely, GNU/Linux on mipsel). The problem is, the constr...

How to use GADTs in Hugs How to use GADTs in Hugs hugs haskell ghc gadt functional-programming How GADTs Hugs Term Lit Pair How to use GADTs in Hugs I'd like to write a Haskell program that uses GADTs interactively on a platform not supported by GHCi (namely, GNU/Linux on mipsel). The problem is, the construct that can...

[ 0.004364013671875, 0.01397705078125, -0.005462646484375, 0.005889892578125, 0.00168609619140625, -0.00762939453125, -0.025146484375, -0.00982666015625, -0.00087738037109375, -0.0311279296875, 0.007171630859375, -0.0546875, -0.0130615234375, -0.0164794921875, 0.0047607421875, 0.00994873...

[ 11249, 47, 4527, 23749, 41072, 7, 23, 99926, 35875, 1556, 142508, 31380, 238, 914, 13384, 123309, 28966, 2994, 27668, 1342, 1884, 33022, 20625, 1528, 212398, 13651, 8060, 527, 73265, 14, 165132, 150040, 324, 254, 1428, 2967, 64549, 11814, 6...

[ 0.088623046875, 0.044647216796875, 0.1632080078125, 0.1744384765625, 0.2310791015625, 0.14453125, 0.10711669921875, 0.2100830078125, 0.1859130859375, 0.0858154296875, 0.1844482421875, 0.0540771484375, 0.030059814453125, 0.1168212890625, 0.173828125, 0.106689453125, 0.0867919921875, ...

embed

15898329_c0

15898329

haskell

0

Title: How to use ByteStrings with QuickTest in DocTest? Problem title: How to use ByteStrings with QuickTest in DocTest? Tags: quickcheck, haskell, doctest Problem: How to use ByteStrings with QuickTest in DocTest? How do I define the Arbitrary instance (as stated here ) when using doctest and quickcheck? Doctest and ...

How to use ByteStrings with QuickTest in DocTest? How to use ByteStrings with QuickTest in DocTest? quickcheck haskell doctest How ByteStrings QuickTest DocTest Arbitrary ByteString Bool How to use ByteStrings with QuickTest in DocTest? How do I define the Arbitrary instance (as stated here ) when using doctest and qui...

[ 0.0174560546875, 0.00034332275390625, 0.0029144287109375, -0.007659912109375, -0.007049560546875, 0.00677490234375, 0.01416015625, -0.00653076171875, -0.0101318359375, 0.026123046875, -0.002105712890625, -0.0079345703125, 0.00469970703125, 0.002655029296875, -0.00775146484375, 0.011169...

[ 11249, 4527, 3311, 67, 71713, 5180, 678, 89038, 111337, 23, 29048, 47, 63773, 78292, 1556, 142508, 51584, 6954, 242522, 1294, 214, 2460, 929, 61924, 70, 110527, 17368, 136, 30438, 289, 5423, 151552, 84797, 14364, 109921, 13315, 33342, 1884, ...

[ 0.0672607421875, 0.1396484375, 0.08642578125, 0.148193359375, 0.1851806640625, 0.151611328125, 0.08648681640625, 0.1483154296875, 0.259521484375, 0.03131103515625, 0.1776123046875, 0.010284423828125, 0.0914306640625, 0.20361328125, 0.04022216796875, 0.1724853515625, 0.164306640625, ...

embed

22783637_c0

22783637

haskell

0

Title: Triggering a documentation update for a Hackage package Problem title: Triggering a documentation update for a Hackage package Tags: haskell, hackage Problem: Triggering a documentation update for a Hackage package I have two releases which were accidentally uploaded before some of their dependencies: http://hac...

Triggering a documentation update for a Hackage package Triggering a documentation update for a Hackage package haskell hackage Triggering Hackage Triggering a documentation update for a Hackage package I have two releases which were accidentally uploaded before some of their dependencies: http://hackage.haskell.org/pa...

[ -0.0025634765625, 0.025390625, -0.0001983642578125, -0.0040283203125, 0.006591796875, 0.01324462890625, -0.029296875, -0.0078125, 0.00051116943359375, 0.0301513671875, 0.0107421875, -0.0208740234375, -0.0032958984375, -0.00099945068359375, 0.01348876953125, -0.00848388671875, 0.02368...

[ 4699, 21407, 209806, 28350, 100, 52922, 4588, 98169, 1556, 142508, 85526, 765, 6626, 54452, 27998, 70622, 8108, 42548, 117538, 139509, 10557, 29102, 1434, 13569, 34814, 289, 32108, 23320, 5, 97109, 1478, 50986, 137656, 102107, 4989, 214521, 959...

[ 0.1844482421875, 0.168212890625, 0.262939453125, 0.1893310546875, 0.02630615234375, 0.2308349609375, 0.1741943359375, 0.1922607421875, 0.1378173828125, 0.2281494140625, 0.2001953125, 0.00341796875, 0.09716796875, 0.1650390625, 0.17626953125, 0.1865234375, 0.0892333984375, 0.1851806...

embed

48211978_c0

48211978

haskell

0

Title: Haskell function composition and fmap f Problem title: Haskell function composition and fmap f Tags: haskell Problem: Haskell function composition and fmap f I have two simple examples: 1) xt function (what is this?) Prelude> :t fmap fmap :: Functor f => (a -> b) -> f a -> f b Prelude> :{ Prelude| f::Int->Int Pr...

Haskell function composition and fmap f Haskell function composition and fmap f haskell Haskell Prelude Functor f::Int Haskell function composition and fmap f I have two simple examples: 1) xt function (what is this?) 2) xq function (via composition) xq function I get through composition return(f(x)) . But what does th...

[ 0.002532958984375, -0.0162353515625, 0.0021209716796875, 0.001495361328125, -0.00592041015625, 0.021484375, 0.025146484375, 0.01068115234375, -0.00299072265625, 0.0037841796875, -0.01611328125, -0.01348876953125, 0.009033203125, 0.01116943359375, 0.008056640625, -0.0260009765625, 0.0...

[ 20625, 142508, 32354, 166577, 136, 1238, 62346, 1556, 1914, 822, 112, 28670, 18770, 4153, 18, 6626, 8781, 27781, 1022, 124409, 83, 903, 4958, 864, 3459, 2046, 8305, 30646, 420, 132, 425, 29459, 60212 ]

[ 0.143798828125, 0.25048828125, 0.1826171875, 0.2379150390625, 0.06646728515625, 0.1925048828125, 0.2464599609375, 0.1270751953125, 0.053466796875, 0.1611328125, 0.0701904296875, 0.083740234375, 0.0867919921875, 0.0228118896484375, 0.163818359375, 0.0181427001953125, 0.03814697265625,...

embed

65843114_c0

65843114

haskell

0

Title: Why is ap available inside Applicative? Problem title: Why is ap available inside Applicative? Tags: haskell Problem: Why is ap available inside Applicative? I am trying to implement MonadUnliftIO for Snap and analyzing Snap classes. I discovered that ap is used for implementing Applicative while ap requires Mon...

Why is ap available inside Applicative? Why is ap available inside Applicative? haskell Why Applicative Functor Monad Snap Why is ap available inside Applicative? I am trying to implement MonadUnliftIO for Snap and analyzing Snap classes. I discovered that ap is used for implementing Applicative while ap requires Monad...

[ -0.0025177001953125, 0.02392578125, 0.002166748046875, 0.017822265625, 0.0133056640625, 0.0159912109375, 0.005462646484375, -0.00592041015625, 0.015869140625, -0.024169921875, 0.0128173828125, -0.019287109375, -0.0240478515625, 0.01422119140625, 0.0014495849609375, -0.004241943359375, ...

[ 44084, 83, 1747, 19882, 46132, 5659, 11048, 4935, 1556, 142508, 28670, 18770, 60331, 71, 121190, 31577, 29479, 14256, 104501, 17780, 7968, 61112, 134053, 11814, 100, 12960, 144570, 33342, 1884, 40956, 17569, 570, 5036, 959, 7722, 33022, 6044, ...

[ 0.1387939453125, 0.059051513671875, 0.228271484375, 0.181884765625, 0.1588134765625, 0.1572265625, 0.1998291015625, 0.2080078125, 0.099853515625, 0.2210693359375, 0.09857177734375, 0.1063232421875, 0.1566162109375, 0.1337890625, 0.198974609375, 0.0081787109375, 0.1363525390625, 0.0...

embed

26538595_c0

26538595

haskell

0

Title: more efficient type-level computations using type families? Problem title: more efficient type-level computations using type families? Tags: functional-dependencies, ghc, haskell, type-families, type-level-computation Problem: more efficient type-level computations using type families? Based on the article in th...

more efficient type-level computations using type families? more efficient type-level computations using type families? functional-dependencies ghc haskell type-families type-level-computation type more efficient type-level computations using type families? Based on the article in the Monad Reader, Issue #8, I've coded...

[ 0.001312255859375, -0.01611328125, -0.0103759765625, 0.00183868408203125, -0.0172119140625, -0.00921630859375, -0.032470703125, -0.0157470703125, 0.00946044921875, -0.01190185546875, -0.0089111328125, -0.015869140625, 0.01019287109375, 0.01263427734375, -0.01953125, 0.026611328125, 0...

[ 1286, 93766, 10644, 67919, 181135, 5256, 17368, 87143, 123309, 105254, 13, 31380, 238, 1556, 142508, 69128, 277, 7077, 60331, 71, 122636, 223317, 18151, 1257, 29806, 4153, 42539, 360, 1462, 2481, 104192, 28670, 262, 26885, 60457, 24641, 9458, ...

[ 0.0819091796875, 0.1748046875, 0.2393798828125, 0.17822265625, 0.172607421875, 0.0343017578125, 0.027496337890625, 0.20703125, 0.1199951171875, 0.1248779296875, 0.0222625732421875, 0.0491943359375, 0.051727294921875, 0.08563232421875, 0.197265625, 0.1697998046875, 0.0204010009765625,...

embed

22034736_c0

22034736

haskell

0

Title: zipWith (++) an arbitrary number of lists Problem title: zipWith (++) an arbitrary number of lists Tags: haskell Problem: zipWith (++) an arbitrary number of lists I have to zip n lists with (++). I have found no better way to do that define this operator on lists: (+++) = zipWith (\x y -> x ++ " " ++ y) There i...

zipWith (++) an arbitrary number of lists zipWith (++) an arbitrary number of lists haskell xn-2 xn-1 zipWith (++) an arbitrary number of lists I have to zip n lists with (++). I have found no better way to do that define this operator on lists: There is a better solution? After Markus1189 answer , I formulate a more g...

[ -0.024169921875, -0.00787353515625, -0.0087890625, 0.0172119140625, -0.014892578125, 0.0255126953125, -0.000911712646484375, 0.005615234375, 0.013671875, -0.006866455078125, -0.0032196044921875, -0.010498046875, 0.01806640625, -0.010498046875, 0.00390625, 0.00946044921875, 0.00555419...

[ 68330, 194583, 37223, 61799, 1294, 14012, 111, 5303, 1556, 142508, 1022, 19, 5428, 5759, 7, 765, 653, 678, 11522, 61924, 903, 39933, 98, 29806, 111246, 18949, 10, 4537, 14602, 32316, 32354, 1884, 3293, 1528, 11814, 15, 86409, 27781, 501, ...

[ 0.2509765625, 0.30810546875, 0.25634765625, 0.12890625, 0.04107666015625, 0.071044921875, 0.0165557861328125, 0.228271484375, 0.11474609375, 0.2021484375, 0.02459716796875, 0.0156402587890625, 0.0865478515625, 0.07537841796875, 0.0770263671875, 0.0516357421875, 0.0802001953125, 0.1...

embed

22430160_c1

22430160

haskell

1

: (def my-vec-of-length-2 [0 1]) (defmacro compile-time-vec-length-check [x n] (let [x @(resolve x)] (assert (= n (count x))))) (compile-time-vec-length-check my-vec-of-length-2 3) Now this will fail, because I'm expecting a vector of length 3, but the underlying vector is of length 2. I got this information at Compile...

[ -0.0216064453125, 0.0225830078125, -0.021240234375, 0.025146484375, 0.005615234375, 0.02001953125, -0.01611328125, -0.0022430419921875, -0.01953125, -0.030517578125, -0.024658203125, -0.0264892578125, 0.00112152099609375, -0.00689697265625, 0.013916015625, -0.0035858154296875, -0.000...

[ 759, 35259, 4390, 23986, 5428, 2389, 112, 420, 15322, 9969, 1340, 6032, 78292, 86918, 162, 33657, 71013, 1022, 58875, 8439, 35782, 41206, 173, 18770, 140909, 138, 1284, 1379, 538, 111, 787, 4677, 15612, 19055, 95, 73, 1297, 3403, 49725, 3...

[ 0.09307861328125, 0.197998046875, 0.125244140625, 0.04449462890625, 0.1429443359375, 0.00341796875, 0.0157012939453125, 0.010955810546875, 0.1328125, 0.0980224609375, 0.12646484375, 0.111083984375, 0.179443359375, 0.042388916015625, 0.029510498046875, 0.1873779296875, 0.0333251953125...

embed

70483497_c0

70483497

haskell

0

Title: How to use integerFromInt from GHC.Num.Integer in Haskell Problem title: How to use integerFromInt from GHC.Num.Integer in Haskell Tags: cabal, haskell Problem: How to use integerFromInt from GHC.Num.Integer in Haskell I'm new in Haskell. I'm trying to use integerFromInt from GHC.Num.Integer. I tried to write in...

How to use integerFromInt from GHC.Num.Integer in Haskell How to use integerFromInt from GHC.Num.Integer in Haskell cabal haskell GHC.Num.Integer integer-gmp-1.0.3.0 How Haskell Variable Integer Could Perhaps GHC.Integer How to use integerFromInt from GHC.Num.Integer in Haskell I'm new in Haskell. I'm trying to use int...

[ -0.0152587890625, -0.0125732421875, -0.0015716552734375, 0.004119873046875, 0.0162353515625, 0.02783203125, -0.005340576171875, -0.01373291015625, -0.014404296875, -0.0284423828125, -0.0079345703125, -0.047119140625, -0.00872802734375, 0.01458740234375, 0.0142822265625, -0.006225585937...

[ 11249, 4527, 892, 1505, 168407, 4153, 18, 1295, 527, 73265, 5, 839, 316, 67, 23, 20625, 142508, 109524, 1556, 177, 2676, 102107, 132265, 84572, 2886, 44401, 191147, 181799, 3525, 31577, 37842, 33022, 15490, 24927, 959, 70820, 1984, 360, 330...

[ 0.050933837890625, 0.145751953125, 0.1435546875, 0.19873046875, 0.27001953125, 0.1851806640625, 0.1956787109375, 0.116455078125, 0.1153564453125, 0.2215576171875, 0.010467529296875, 0.09912109375, 0.175537109375, 0.1689453125, 0.06964111328125, 0.1737060546875, 0.25048828125, 0.229...

embed

70826544_c0

70826544

haskell

0

Title: How to interact with process in haskell Problem title: How to interact with process in haskell Tags: haskell, process Problem: How to interact with process in haskell I compiled the following program -- Alice.hs main = do putStrLn "Hello" l <- getLine putStrLn $ "you said " ++ l I want to communicate with Alice ...

How to interact with process in haskell How to interact with process in haskell haskell process System.IO System.Process How Alice.hs Hello Bob.hs Alice Nothing How to interact with process in haskell I compiled the following program I want to communicate with Alice in another program: Bob.hs. My failed attempt is: Bob...

[ -0.01202392578125, 0.0002269744873046875, -0.0029754638671875, 0.031982421875, -0.004058837890625, 0.0079345703125, 0.0047607421875, -0.00555419921875, -0.00750732421875, -0.0186767578125, -0.017578125, 0.023193359375, -0.01165771484375, 0.024658203125, 0.0091552734375, 0.0142822265625...

[ 11249, 47, 78974, 678, 9433, 23, 1556, 142508, 12353, 17780, 10752, 26531, 66083, 5, 127, 7, 35378, 25027, 182747, 375, 5974, 25632, 1528, 3444, 127219, 15700, 165523, 81887, 62163, 179933, 8108, 28412 ]

[ 0.081787109375, 0.07086181640625, 0.2476806640625, 0.2056884765625, 0.250244140625, 0.0941162109375, 0.18212890625, 0.251953125, 0.110107421875, 0.1446533203125, 0.0880126953125, 0.1441650390625, 0.1929931640625, 0.031707763671875, 0.1280517578125, 0.016204833984375, 0.2301025390625,...

embed

8945096_c0

8945096

haskell

0

Title: Any nice tools for untying knots in Haskell? Problem title: Any nice tools for untying knots in Haskell? Tags: circular-reference, haskell Problem: Any nice tools for untying knots in Haskell? I've a data structure with several different types of internal circular linking, making it infinite in the sense of say ...

Any nice tools for untying knots in Haskell? Any nice tools for untying knots in Haskell? circular-reference haskell Any Haskell Read Show Data.Serialize Any nice tools for untying knots in Haskell? I've a data structure with several different types of internal circular linking, making it infinite in the sense of say t...

[ -0.003021240234375, 0.01031494140625, -0.00897216796875, 0.014404296875, 0.001678466796875, -0.00921630859375, 0.01434326171875, -0.01708984375, 0.00193023681640625, -0.038330078125, -0.0164794921875, -0.01513671875, -0.000713348388671875, 0.044189453125, 0.00909423828125, -0.009460449...

[ 26267, 72977, 100, 51, 939, 214, 17075, 30591, 20625, 142508, 28541, 115339, 239879, 1556, 4764, 17367, 11809, 294, 25435, 119066, 23, 2053, 45646, 40368, 12921, 52895, 70796, 3126, 54241, 105823, 75101, 49041, 88996, 3365, 96091, 6044, 3934, ...

[ 0.10028076171875, 0.2066650390625, 0.03448486328125, 0.0672607421875, 0.16357421875, 0.06292724609375, 0.13134765625, 0.18310546875, 0.124267578125, 0.2410888671875, 0.01171875, 0.1593017578125, 0.2015380859375, 0.1224365234375, 0.1102294921875, 0.15625, 0.057525634765625, 0.019180...

embed

65347506_c0

65347506

haskell

0

Title: I am getting this error when trying to install Cardano-Node Problem title: I am getting this error when trying to install Cardano-Node Tags: cabal, cardano, haskell Problem: I am getting this error when trying to install Cardano-Node Code signals: non-upgradeable, Cardano-Node, Could, __0, Win32-network-0.1.0.0,...

I am getting this error when trying to install Cardano-Node I am getting this error when trying to install Cardano-Node cabal cardano haskell non-upgradeable Cardano-Node Could __0 Win32-network-0.1.0.0 __1 Win32-network base-4.14.1.0 installed-4.14.1.0 base-4.12.0.0 base-4.11.1.0 base-4.11.0.0 base-4.10.1.0 base-4.10....

[ -0.006072998046875, -0.0084228515625, 0.01708984375, 0.005889892578125, 0.004791259765625, -0.01544189453125, -0.014892578125, -0.0135498046875, -0.002349853515625, 0.00360107421875, 0.005615234375, -0.0419921875, 0.007354736328125, -0.0206298828125, -0.01300048828125, -0.019775390625,...

[ 444, 20949, 903, 18499, 3229, 31577, 20600, 23660, 3922, 9, 5021, 112, 109524, 20596, 1556, 142508, 351, 2037, 44286, 2886, 191147, 5953, 2389, 17686, 6460, 1179, 18244, 102014, 99929, 3647, 11565, 2592, 102107, 15654, 14556, 156982, 73011, 1...

[ 0.012908935546875, 0.05218505859375, 0.1058349609375, 0.2086181640625, 0.007781982421875, 0.1160888671875, 0.1881103515625, 0.224365234375, 0.270263671875, 0.0258941650390625, 0.20849609375, 0.1812744140625, 0.2330322265625, 0.1806640625, 0.1287841796875, 0.2261962890625, 0.128662109...

embed

56414329_c1

56414329

haskell

1

at https://nixos.org/nixos/nix-pills/nixpkgs-overriding-packages.html or would this work differently due to using the nixpkgs.pkgs.haskell.packages.${compiler}.callPackage function? Edit: Thanks to @sara's answer I now have: { nixpkgs ? import <nixpkgs> {}, compiler ? "ghc864" } : let gitchapter = nixpkgs.pkgs.haskell...

[ -0.0179443359375, -0.0027923583984375, 0.0128173828125, -0.01251220703125, 0.00640869140625, 0.00787353515625, 0.010986328125, -0.016357421875, 0.000705718994140625, 0.0005950927734375, -0.003997802734375, -0.01190185546875, -0.0014495849609375, 0.007568359375, 0.0203857421875, -0.0072...

[ 93, 47436, 425, 121934, 7, 38988, 9405, 5465, 416, 6238, 29102, 52467, 903, 4488, 12921, 300, 10557, 142508, 58875, 34759, 85763, 205956, 4588, 32354, 28884, 5036, 765, 24927, 9969, 9486, 238, 189864, 62270, 124453, 720, 20370, 3571, 304, 1...

[ 0.1246337890625, 0.1827392578125, 0.154052734375, 0.21337890625, 0.083251953125, 0.179443359375, 0.20751953125, 0.160888671875, 0.23095703125, 0.1259765625, 0.247314453125, 0.14306640625, 0.05450439453125, 0.05572509765625, 0.11279296875, 0.1314697265625, 0.053192138671875, 0.23291...

embed

52707869_c0

52707869

haskell

0

Title: How to deal with typeclass constraint in class member function Problem title: How to deal with typeclass constraint in class member function Tags: typeclass, haskell Problem: How to deal with typeclass constraint in class member function GHCI complains about the types of k and a inside of (k * a, k * b) . My gue...

How to deal with typeclass constraint in class member function How to deal with typeclass constraint in class member function typeclass haskell How Num Point Vector How to deal with typeclass constraint in class member function GHCI complains about the types of k and a inside of (k * a, k * b) . My guess is it doesn't ...

[ 0.005645751953125, -0.00830078125, 0.01611328125, 0.00010585784912109375, 0.0052490234375, -0.000331878662109375, -0.0245361328125, -0.01068115234375, 0.003875732421875, -0.0181884765625, -0.0157470703125, -0.04443359375, 0.000484466552734375, 0.0031280517578125, -0.027587890625, -0.01...

[ 11249, 47, 35142, 678, 10644, 67413, 158, 2816, 4288, 18507, 32786, 32354, 1556, 142508, 52782, 41097, 2609, 18770, 23, 41877, 17304, 186992, 52895, 111, 472, 136, 10, 46132, 92, 661, 876, 57767, 442, 22027, 18, 3714, 83, 3642, 40140, 189...

[ 0.09228515625, 0.0303955078125, 0.1358642578125, 0.10986328125, 0.20947265625, 0.260009765625, 0.10137939453125, 0.1976318359375, 0.125, 0.1702880859375, 0.213134765625, 0.146240234375, 0.145751953125, 0.2373046875, 0.19677734375, 0.18505859375, 0.1697998046875, 0.10693359375, 0....

embed

53570385_c0

53570385

haskell

0

Title: function composition in natural order in haskell Problem title: function composition in natural order in haskell Tags: haskell, functional-programming Problem: function composition in natural order in haskell We all know and love/hate composition from right to left : (.) :: (b -> c) -> (a -> b) -> a -> c What is...

function composition in natural order in haskell function composition in natural order in haskell haskell functional-programming function composition in natural order in haskell We all know and love/hate composition from right to left : What is the "most standard" operator (as in some sort of common library) for natura...

[ 0.01104736328125, 0.0032958984375, 0.01519775390625, 0.0206298828125, 0.00537109375, 0.006256103515625, -0.0037994384765625, 0.0028839111328125, 0.0107421875, -0.032958984375, -0.00311279296875, 0.0118408203125, 0.014892578125, -0.01287841796875, 0.0125732421875, -0.01495361328125, 0...

[ 32354, 166577, 23, 6083, 12989, 1556, 142508, 123309, 28966, 5161, 528, 67, 1295, 7108, 47, 25737, 840, 18, 5570, 39933, 39210, 35773, 64, 133, 2480, 4537, 10422, 142424, 19882, 5609, 9351, 6044, 48909, 4552, 27983, 59121, 17932, 2965, 1230...

[ 0.218994140625, 0.261474609375, 0.0484619140625, 0.2039794921875, 0.206787109375, 0.148681640625, 0.2432861328125, 0.171875, 0.119140625, 0.114990234375, 0.145751953125, 0.08154296875, 0.176513671875, 0.15869140625, 0.157470703125, 0.154296875, 0.0789794921875, 0.083740234375, 0....

embed

20644882_c0

20644882

haskell

0

Title: Why doesn't GHC complain when number constant out of range Problem title: Why doesn't GHC complain when number constant out of range Tags: haskell Problem: Why doesn't GHC complain when number constant out of range GHC silently ignores out-of-range bits in numerical constants. This behavior led me to w...

Why doesn't GHC complain when number constant out of range Why doesn't GHC complain when number constant out of range haskell Why GHC Word8 Why doesn't GHC complain when number constant out of range GHC silently ignores out-of-range bits in numerical constants. This behavior led me to wrestle with a rather st...

[ 0.0108642578125, -0.007171630859375, 0.012939453125, 0.011474609375, 0.00970458984375, 0.018798828125, -0.02490234375, 0.01806640625, 0.01507568359375, 0.031982421875, -0.0089111328125, -0.02783203125, 0.006866455078125, 0.01202392578125, -0.0096435546875, 0.005340576171875, 0.008789...

[ 44084, 22027, 3768, 18, 527, 73265, 186992, 3229, 14012, 53697, 1810, 111, 37457, 1556, 142508, 22543, 1019, 103967, 124962, 7, 4390, 94250, 4785, 23, 54744, 123166, 56644, 114453, 54608, 3714, 143434, 127892, 69112, 757, 20788, 8999, 15400, ...

[ 0.11572265625, 0.052490234375, 0.03216552734375, 0.0909423828125, 0.122314453125, 0.230712890625, 0.228515625, 0.05474853515625, 0.1683349609375, 0.240966796875, 0.1566162109375, 0.14990234375, 0.2305908203125, 0.160400390625, 0.2332763671875, 0.15966796875, 0.2215576171875, 0.1418...

embed

21597543_c1

21597543

haskell

1

16 + fromHex c2 fromHex = fromIntegral . digitToInt . BS.w2c rHexBSL :: BSL.ByteString -> BSL.ByteString rHexBSL = rHex' (BSL.null, BSL.empty, BSL.cons, BSL.head, BSL.tail, fromHex) rHexBS :: BS.ByteString -> BS.ByteString rHexBS = rHex' (BS.null, BS.empty, BS.cons, BS.head, BS.tail, fromHex) So I pass all needed funct...

[ -0.00830078125, -0.01043701171875, -0.0062255859375, -0.0233154296875, -0.01251220703125, 0.00009250640869140625, 0.00186920166015625, -0.007415771484375, -0.001312255859375, -0.0179443359375, 0.01104736328125, -0.0098876953125, 0.0164794921875, 0.0014495849609375, -0.0021209716796875, ...

[ 611, 997, 1295, 841, 3355, 501, 304, 2203, 67, 5739, 141, 153939, 7763, 4153, 18, 84145, 434, 238, 1690, 571, 30508, 1984, 335, 75358, 71713, 33079, 25, 139550, 33548, 25553, 31251, 46741, 20429, 27875, 756, 44841, 32354, 105237, 1286, 20...

[ 0.198486328125, 0.18359375, 0.2423095703125, 0.191162109375, 0.29833984375, 0.03411865234375, 0.16455078125, 0.045684814453125, 0.1529541015625, 0.1065673828125, 0.0115966796875, 0.1363525390625, 0.1422119140625, 0.061187744140625, 0.06982421875, 0.05218505859375, 0.01025390625, 0....

embed

41915463_c1

41915463

haskell

1

Nothing) return h main:: IO () main = C8.putStrLn "connecting, please wait" >> connectMud "aardwolf.org" "4000" >>= BS.hGetContents >>= C8.putStrLn The only difference between these two short scripts is that one is using Data.ByteString and the other one Data.ByteString.Lazy . The lazy version works fine but the stric...

[ 0.0004596710205078125, 0.025146484375, -0.0027008056640625, 0.004425048828125, 0.0186767578125, 0.025390625, 0.0108642578125, -0.0078125, 0.0196533203125, -0.036376953125, 0.0157470703125, -0.022705078125, -0.0081787109375, -0.002960205078125, -0.00933837890625, -0.0213623046875, 0.0...

[ 182747, 16, 30646, 1096, 5201, 17780, 2203, 313, 1019, 7077, 71713, 19, 135457, 214, 22936, 40485, 37067, 10685, 71, 11, 5861, 25400, 420, 1478, 68037, 84145, 127, 724, 126, 11935, 25352, 4734, 60212, 17721, 6097, 6626, 16610, 26499, 83, ...

[ 0.270751953125, 0.0306243896484375, 0.2198486328125, 0.1673583984375, 0.1707763671875, 0.2076416015625, 0.014739990234375, 0.006591796875, 0.1712646484375, 0.0811767578125, 0.1429443359375, 0.0428466796875, 0.1766357421875, 0.103515625, 0.126953125, 0.245361328125, 0.18115234375, 0...

embed

8393223_c0

8393223

haskell

0

Title: Haskell case statement Problem title: Haskell case statement Tags: input, switch-statement, haskell, case Problem: Haskell case statement I have code something like this main :: [[String]] -> IO () main st = do answer <- getLine case answer of "q" -> return () "load" x -> main $ parseCSV $ readFile x This doesn'...

Haskell case statement Haskell case statement input switch-statement haskell case Haskell sample.csv test.csv helloworld.csv Haskell case statement I have code something like this This doesn't work, so my question is how can I use case switch statement for something of changing input For example in my code I want the i...

[ -0.0103759765625, -0.004608154296875, -0.015869140625, 0.0111083984375, 0.01214599609375, -0.00035858154296875, -0.0000629425048828125, 0.01129150390625, 0.00154876708984375, -0.0206298828125, -0.0033111572265625, -0.013427734375, -0.01239013671875, -0.01324462890625, -0.0213623046875, ...

[ 20625, 142508, 7225, 63805, 107730, 101089, 61340, 1556, 121413, 4439, 334, 3034, 33600, 31, 32554, 18151, 9844, 1884, 22027, 18, 4488, 3642, 831, 4527, 100, 111, 151134, 3444, 38937, 8096, 72367, 1284, 1221, 53697, 15549, 117414, 178308, 237...

[ 0.1287841796875, 0.225341796875, 0.2352294921875, 0.1983642578125, 0.2054443359375, 0.255859375, 0.14501953125, 0.1221923828125, 0.1307373046875, 0.061798095703125, 0.13720703125, 0.09686279296875, 0.0677490234375, 0.05987548828125, 0.0799560546875, 0.1287841796875, 0.027496337890625...

embed

32831287_c1

32831287

haskell

1

cons ex = check ex where check :: Monad m => Expr -> m (Maybe (Tok Expr, Expr)) check ex = case ex of Id s -> return $ Just (This (Id s), Apply []) Apply (x:xs) -> do mst <- check x return $ fmap (\(a, b) -> (Over a, b)) mst Which is using data Tok as kind of a Zipper breadcrumb (or at least I see it that way), to indi...

[ 0.0113525390625, 0.0072021484375, 0.0002460479736328125, 0.0091552734375, 0.01446533203125, 0.01385498046875, -0.007415771484375, -0.0150146484375, 0.015869140625, -0.0223388671875, 0.006256103515625, -0.006011962890625, 0.01177978515625, -0.00072479248046875, 0.0103759765625, 0.015441...

[ 158, 7, 1119, 2203, 12765, 7440, 60331, 71, 347, 60075, 42, 618, 685, 7225, 24799, 91, 30646, 9563, 73243, 5659, 538, 271, 1022, 3650, 1238, 62346, 876, 156673, 17368, 2053, 66196, 237, 8562, 9315, 8079, 179967, 47913, 6492, 117414, 3642,...

[ 0.2071533203125, 0.1114501953125, 0.2578125, 0.05340576171875, 0.244384765625, 0.128173828125, 0.15869140625, 0.1412353515625, 0.10601806640625, 0.085205078125, 0.1419677734375, 0.06817626953125, 0.1878662109375, 0.130615234375, 0.11669921875, 0.08087158203125, 0.1092529296875, 0.0...

embed

12999683_c0

12999683

haskell

0

Title: Using Fractions in Haskell Problem title: Using Fractions in Haskell Tags: rational-numbers, haskell, fractions Problem: Using Fractions in Haskell Continuing from the previous question: Power Series in Haskell I am trying to write the power series in Haskell, e^x = 1 + x + x^2/2! + x^3/3! + ... such that it wil...

Using Fractions in Haskell Using Fractions in Haskell rational-numbers haskell fractions a the Using Fractions Haskell Integral Ambiguous Fractional Num Probable Using Fractions in Haskell Continuing from the previous question: Power Series in Haskell I am trying to write the power series in Haskell, such that it will ...

[ -0.005523681640625, 0.0027618408203125, -0.00628662109375, -0.0205078125, 0.002838134765625, 0.002777099609375, 0.004730224609375, 0.01611328125, -0.0069580078125, -0.0167236328125, 0.00506591796875, 0.0108642578125, 0.0169677734375, -0.0213623046875, 0.003692626953125, 0.03662109375, ...

[ 345, 6953, 7868, 10763, 7, 23, 20625, 142508, 168487, 2606, 1297, 1556, 175921, 10, 204681, 10250, 12282, 52782, 1250, 275, 2886, 17170, 64876, 31577, 33022, 14537, 36549, 442, 140992, 21771, 765, 32354, 3688, 43240, 15490, 64, 144810, 15403,...

[ 0.12060546875, 0.02557373046875, 0.2469482421875, 0.210205078125, 0.037078857421875, 0.059326171875, 0.1405029296875, 0.256103515625, 0.12060546875, 0.085205078125, 0.0830078125, 0.12158203125, 0.21630859375, 0.0258331298828125, 0.07440185546875, 0.051666259765625, 0.09967041015625, ...

embed

34197567_c0

34197567

haskell

0

Title: What is the equivalent of Haskell's scanl in Java's streams? Problem title: What is the equivalent of Haskell's scanl in Java's streams? Tags: java, haskell, java-stream Problem: What is the equivalent of Haskell's scanl in Java's streams? As this question asked for python, what is the equiva...

What is the equivalent of Haskell's scanl in Java's streams? What is the equivalent of Haskell's scanl in Java's streams? java haskell java-stream What Haskell Java What is the equivalent of Haskell's scanl in Java's streams? As this question asked for python, what is the equivalent of Haskell's sca...

[ -0.01312255859375, 0.02978515625, -0.00421142578125, 0.0194091796875, 0.0037078857421875, 0.01141357421875, -0.007598876953125, -0.004425048828125, -0.005523681640625, -0.03515625, 0.01708984375, 0.010009765625, 0.0179443359375, 0.005645751953125, -0.01397705078125, -0.005706787109375,...

[ 4865, 183234, 20625, 142508, 3768, 44954, 141, 23, 41925, 75973, 79, 330, 1556, 9, 86429, 83, 17198, 50828, 2367, 2965, 1257, 2060, 4527, 678, 183278, 1290, 13695, 42850, 16750, 50339, 5303, 70163, 42, 44136, 11814, 56282, 442, 95103, 4488,...

[ 0.09814453125, 0.167724609375, 0.156982421875, 0.266845703125, 0.054656982421875, 0.1761474609375, 0.1866455078125, 0.04248046875, 0.2490234375, 0.2000732421875, 0.09527587890625, 0.1864013671875, 0.12451171875, 0.0264434814453125, 0.2132568359375, 0.015472412109375, 0.05337524414062...

embed

35801111_c1

35801111

haskell

1

el "li" $ dynText =<< mapDyn (T.unpack . decodeUtf8) m return () I feel like there should be a way to do this with tickLossy to send pings with timeout, like some dynamic which returns websockets and then reconnects if a ping goes a certain amount of time without a response? But I'm having trouble envisioning what the...

[ -0.01214599609375, 0.0125732421875, 0.01068115234375, -0.01324462890625, -0.017822265625, 0.00531005859375, 0.005340576171875, 0.0130615234375, 0.01373291015625, -0.0247802734375, -0.002593994140625, -0.04931640625, 0.002838134765625, 0.013671875, 0.006439208984375, 0.01007080078125, ...

[ 88, 150, 3650, 65898, 174379, 22288, 397, 3371, 618, 309, 29102, 8, 40899, 420, 50490, 347, 30646, 12319, 5608, 3917, 54, 1053, 2594, 100604, 4861, 25379, 33429, 678, 1733, 6056, 84079, 1467, 991, 27853, 456, 135457, 2174, 60899, 24233, 4...

[ 0.1556396484375, 0.1510009765625, 0.07562255859375, 0.140380859375, 0.2379150390625, 0.1400146484375, 0.00897216796875, 0.1593017578125, 0.01025390625, 0.049224853515625, 0.205322265625, 0.0833740234375, 0.142578125, 0.011077880859375, 0.089599609375, 0.02117919921875, 0.146606445312...

embed

24800796_c0

24800796

haskell

0

Title: No instance for (Show a) arising from a use of `X' Problem title: No instance for (Show a) arising from a use of `X' Tags: gadt, haskell Problem: No instance for (Show a) arising from a use of `X' With this code {-# LANGUAGE GADTs #-} data X a where X :: (Show a, Num a) => a -> X a instance Show (X a) ...

No instance for (Show a) arising from a use of `X' No instance for (Show a) arising from a use of `X' gadt haskell a Show LANGUAGE GADTs Num Possible No instance for (Show a) arising from a use of `X' With this code I get this error: Can anyone explain why I get this error message?

[ -0.0079345703125, 0.012939453125, 0.00408935546875, -0.00634765625, -0.00156402587890625, 0.023193359375, 0.01361083984375, -0.0225830078125, 0.01470947265625, -0.01373291015625, -0.021240234375, -0.034423828125, -0.01123046875, 0.006591796875, 0.001922607421875, -0.011474609375, -0....

[ 438, 110527, 100, 168660, 10, 187, 72219, 1295, 4527, 1542, 3768, 914, 13384, 1556, 142508, 17367, 3358, 98064, 75930, 23749, 41072, 52782, 115861, 2661, 903, 18151, 2046, 18499, 73342, 15400, 26008 ]

[ 0.15185546875, 0.264892578125, 0.09423828125, 0.2060546875, 0.10791015625, 0.0986328125, 0.08892822265625, 0.07244873046875, 0.11376953125, 0.1724853515625, 0.1336669921875, 0.10284423828125, 0.173583984375, 0.1358642578125, 0.2318115234375, 0.187255859375, 0.023956298828125, 0.110...

embed

50234571_c0

50234571

haskell

0

Title: Access type fields in data constructor haskell Problem title: Access type fields in data constructor haskell Tags: syntax, types, output, haskell Problem: Access type fields in data constructor haskell I have a question how do I access certain types in a data constructor. Lets say I got this code sample data Obj...

Access type fields in data constructor haskell Access type fields in data constructor haskell syntax types output haskell Access Object Type1 Type2 Type3 Type4 Show Float Bool World Access type fields in data constructor haskell I have a question how do I access certain types in a data constructor. Lets say I got this ...

[ 0.01312255859375, -0.007415771484375, -0.007171630859375, 0.0302734375, 0.0089111328125, 0.00168609619140625, -0.006744384765625, 0.033203125, -0.000942230224609375, -0.000278472900390625, -0.007781982421875, -0.035888671875, 0.01031494140625, -0.01300048828125, -0.02197265625, -0.0075...

[ 40266, 10644, 44457, 7, 23, 2053, 64549, 748, 1556, 142508, 6002, 86531, 52895, 140992, 134549, 60457, 418, 304, 363, 617, 17367, 38699, 257, 2460, 929, 6661, 9655, 3642, 54, 87, 17203, 24233, 18151, 121413, 61924, 32354, 11249, 831, 28412,...

[ 0.255615234375, 0.248291015625, 0.26123046875, 0.0347900390625, 0.0650634765625, 0.122802734375, 0.2110595703125, 0.1236572265625, 0.149658203125, 0.21630859375, 0.07757568359375, 0.1531982421875, 0.2431640625, 0.137451171875, 0.156494140625, 0.189697265625, 0.038116455078125, 0.05...

embed

52908558_c0

52908558

haskell

0

Title: Tetris clearing full rows Problem title: Tetris clearing full rows Tags: functional-programming, haskell Problem: Tetris clearing full rows So I am making a tetris game using haskell and I am having troubles implementing the last feature, clearing the full rows and decrementing every tuple above it. as the bord ...

Tetris clearing full rows Tetris clearing full rows functional-programming haskell Tetris Tetris clearing full rows So I am making a tetris game using haskell and I am having troubles implementing the last feature, clearing the full rows and decrementing every tuple above it. as the bord I am using a list with [(xcoord...

[ 0.01123046875, 0.0159912109375, 0.01519775390625, 0.009033203125, -0.0205078125, -0.0281982421875, 0.0169677734375, 0.001129150390625, 0.00335693359375, 0.046142578125, 0.01129150390625, 0.01055908203125, 0.006500244140625, -0.001678466796875, -0.020263671875, 0.00396728515625, -0.00...

[ 1413, 43291, 34735, 214, 4393, 15555, 123309, 28966, 1556, 142508, 20662, 120, 6712, 17368, 63134, 29479, 4568, 60213, 136, 8, 7612, 11907, 370, 8705, 36917, 16307, 5303, 425, 587, 6651, 113, 4734, 176866, 95699, 138518, 47644, 175199, 423, ...

[ 0.096435546875, 0.2218017578125, 0.2091064453125, 0.056610107421875, 0.173828125, 0.2313232421875, 0.1337890625, 0.0933837890625, 0.10791015625, 0.1920166015625, 0.0168914794921875, 0.056884765625, 0.068359375, 0.033294677734375, 0.05419921875, 0.08380126953125, 0.05078125, 0.09655...

embed

67989933_c0

67989933

haskell

0

Title: How to write a Haskell function that inserts an element into a sorted list Problem title: How to write a Haskell function that inserts an element into a sorted list Tags: list, haskell, concatenation Problem: How to write a Haskell function that inserts an element into a sorted list I tried with something like t...

How to write a Haskell function that inserts an element into a sorted list How to write a Haskell function that inserts an element into a sorted list list haskell concatenation How Haskell x:xs insert2 How to write a Haskell function that inserts an element into a sorted list I tried with something like this but it doe...

[ -0.0137939453125, -0.00128173828125, 0.0059814453125, -0.00836181640625, -0.00151824951171875, 0.0252685546875, -0.020263671875, -0.0322265625, 0.0135498046875, -0.00122833251953125, 0.013916015625, -0.01361083984375, 0.0025787353515625, -0.00823974609375, -0.0081787109375, -0.00628662...

[ 11249, 33022, 20625, 142508, 32354, 183540, 12830, 3934, 17497, 71, 5303, 450, 1556, 158, 4460, 33, 1022, 12, 425, 7, 304, 10, 37842, 1884, 4488, 44691, 140992, 2046, 83, 82449, 104629, 76172 ]

[ 0.03802490234375, 0.1651611328125, 0.1187744140625, 0.20654296875, 0.198974609375, 0.216796875, 0.183837890625, 0.112548828125, 0.1949462890625, 0.1090087890625, 0.1873779296875, 0.01483154296875, 0.1060791015625, 0.0195770263671875, 0.09814453125, 0.08294677734375, 0.022262573242187...

embed