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
33743442_c1	33743442	haskell	1	, LLVMBitReader, LLVMExecutionEngine, LLVMMC, LLVMCore, LLVMSupport This problem can usually be solved by installing the system packages that provide these libraries (you may need the "-dev" versions). If the libraries are already installed but in a non-standard location then you can use the flags --extra-include-dirs=...	, LLVMBitReader, LLVMExecutionEngine, LLVMMC, LLVMCore, LLVMSupport This problem can usually be solved by installing the system packages that provide these libraries (you may need the "-dev" versions). If the libraries are already installed but in a non-standard location then you can use the flags --extra-include-dirs=...	[ 0.01190185546875, -0.004119873046875, -0.0027923583984375, 0.00457763671875, 0.004547119140625, -0.0004367828369140625, -0.005889892578125, -0.013427734375, -0.0223388671875, 0.02099609375, 0.002593994140625, -0.03564453125, 0.031005859375, 0.0005950927734375, 0.0184326171875, -0.00323...	[ 6, 339, 32811, 12689, 217, 31345, 56, 99954, 47599, 211603, 91384, 1212, 32557, 4524, 2037, 6982, 3293, 2967, 831, 56104, 86869, 390, 20600, 5426, 98169, 22691, 6097, 35773, 10484, 18548, 11389, 21771, 351, 66589, 31913, 4527, 49938, 112779, ...	[ 0.018402099609375, 0.061767578125, 0.1453857421875, 0.0311279296875, 0.07708740234375, 0.18310546875, 0.0557861328125, 0.078369140625, 0.18310546875, 0.0640869140625, 0.027557373046875, 0.04168701171875, 0.0767822265625, 0.1162109375, 0.128173828125, 0.091796875, 0.06732177734375, ...	embed
34635495_c1	34635495	haskell	1	Battlefield battleUntilOver randBfield = do bfield <- randBfield traceM $ "bfield::" ++ show bfield ++ "::" if battleOver bfield then return bfield else battleUntilOver $ battle bfield Here is the output: *Risk> evalRandIO $ invade Battlefield {attackers=10,defenders=10} bfield::Battlefield {attackers = 10, defenders ...	Battlefield battleUntilOver randBfield = do bfield <- randBfield traceM $ "bfield::" ++ show bfield ++ "::" if battleOver bfield then return bfield else battleUntilOver $ battle bfield Here is the output: *Risk> evalRandIO $ invade Battlefield {attackers=10,defenders=10} bfield::Battlefield {attackers = 10, defenders ...	[ -0.00909423828125, 0.0008697509765625, 0.0203857421875, 0.00811767578125, 0.010498046875, -0.00360107421875, 0.01092529296875, -0.031494140625, -0.003509521484375, 0.004608154296875, 0.006561279296875, 0.0233154296875, 0.013427734375, -0.0281982421875, 0.01446533203125, -0.025146484375...	[ 212276, 133868, 14256, 3675, 156673, 27388, 571, 28394, 54, 876, 144851, 594, 3650, 275, 37223, 7639, 30646, 140992, 1052, 6581, 28, 1405, 2940, 17780, 205491, 102, 11050, 963, 6211, 46401, 209, 86841, 382, 305, 201, 190, 106, 28219, 15400,...	[ 0.259521484375, 0.2060546875, 0.1068115234375, 0.2137451171875, 0.297119140625, 0.2073974609375, 0.054931640625, 0.20654296875, 0.038299560546875, 0.056671142578125, 0.195556640625, 0.0849609375, 0.0882568359375, 0.016815185546875, 0.033233642578125, 0.0712890625, 0.1258544921875, ...	embed
37066405_c0	37066405	haskell	0	Title: Hosting applications written in Haskell: Heroku vs IaaS Problem title: Hosting applications written in Haskell: Heroku vs IaaS Tags: heroku, haskell, hosting, iaas, paas Problem: Hosting applications written in Haskell: Heroku vs IaaS I'm considering the different options for hosting a web application written in...	Hosting applications written in Haskell: Heroku vs IaaS Hosting applications written in Haskell: Heroku vs IaaS heroku haskell hosting iaas paas Hosting Haskell Heroku IaaS Hosting applications written in Haskell: Heroku vs IaaS I'm considering the different options for hosting a web application written in Haskell. Her...	[ -0.00433349609375, 0.015380859375, 0.000038623809814453125, 0.009033203125, -0.00811767578125, 0.00640869140625, -0.008544921875, -0.033447265625, -0.002685546875, -0.0016326904296875, -0.0048828125, -0.0076904296875, 0.0036163330078125, 0.001220703125, -0.00970458984375, 0.00860595703...	[ 168098, 86685, 59121, 20625, 142508, 12, 56889, 319, 20209, 12044, 11, 294, 23, 40814, 1556, 70496, 5326, 162, 249, 179635, 12921, 50717, 1467, 38415, 37202, 1884, 225530, 30700, 8060, 11675, 6032, 24702, 32233, 47041, 3871, 37067, 9433, 7661...	[ 0.2310791015625, 0.156982421875, 0.112548828125, 0.1959228515625, 0.2509765625, 0.00567626953125, 0.262939453125, 0.224365234375, 0.17822265625, 0.189697265625, 0.1571044921875, 0.1435546875, 0.06756591796875, 0.20263671875, 0.126708984375, 0.211181640625, 0.1505126953125, 0.119995...	embed
24897133_c1	24897133	haskell	1	I don't run the report every days but only when I need it. So I don't want to run report every 24 hours. It's easy to do with a makefile except the timing bit, they are wor around but once again it's a contrived example to understand deeply how Shake work. So, when I first do make report it backup the db run everythin...	I don't run the report every days but only when I need it. So I don't want to run report every 24 hours. It's easy to do with a makefile except the timing bit, they are wor around but once again it's a contrived example to understand deeply how Shake work. So, when I first do make report it backup the db run everythin...	[ -0.0031585693359375, 0.041748046875, 0.0186767578125, 0.0206298828125, -0.005828857421875, 0.005401611328125, -0.03955078125, 0.0238037109375, 0.01336669921875, -0.00012683868408203125, -0.007232666015625, -0.01361083984375, 0.0079345703125, 0.0137939453125, 0.005462646484375, -0.02014...	[ 2301, 18, 11675, 13416, 11907, 13312, 3229, 3871, 3444, 744, 21974, 23468, 54, 3249, 29822, 5527, 214, 4785, 10932, 27781, 28219, 68161, 13, 4488, 5117, 126502, 40041, 26818, 139392, 47, 2811, 40383, 134234, 94410, 3674, 4000, 63399, 210651, ...	[ 0.03125, 0.053985595703125, 0.144287109375, 0.2646484375, 0.03228759765625, 0.062042236328125, 0.046905517578125, 0.16552734375, 0.09368896484375, 0.1290283203125, 0.1314697265625, 0.07281494140625, 0.014617919921875, 0.1195068359375, 0.22607421875, 0.1397705078125, 0.004302978515625...	embed
39530111_c1	39530111	haskell	1	Hughes's functional difference lists, but likely somewhat worse. In heavily persistent settings, however, it does much better, because it takes advantage of sharing. The banker's queue guarantees (amortized) O(1) snoc and O(1) uncons, meaning that we can think of toListSB as an O(1) conversion to a list-like structure...	Hughes's functional difference lists, but likely somewhat worse. In heavily persistent settings, however, it does much better, because it takes advantage of sharing. The banker's queue guarantees (amortized) O(1) snoc and O(1) uncons, meaning that we can think of toListSB as an O(1) conversion to a list-like structure...	[ 0.002349853515625, 0.00001990795135498047, -0.00286865234375, -0.0186767578125, -0.023681640625, 0.0022125244140625, -0.0025787353515625, 0.0103759765625, 0.018798828125, -0.01513671875, 0.011474609375, 0.006256103515625, 0.0252685546875, 0.0240478515625, -0.01239013671875, -0.00279235...	[ 177099, 25, 123309, 60212, 5303, 7, 47041, 208806, 124632, 5115, 70560, 53550, 14602, 5045, 11522, 92940, 53371, 150065, 41, 13388, 142027, 77529, 18, 29367, 180, 27750, 91, 54387, 51, 25553, 5351, 47, 154663, 36474, 142477, 5062, 45646, 5369...	[ 0.281982421875, 0.02593994140625, 0.20458984375, 0.260986328125, 0.214111328125, 0.0199737548828125, 0.0384521484375, 0.0182342529296875, 0.1253662109375, 0.051177978515625, 0.1341552734375, 0.042877197265625, 0.0684814453125, 0.0145416259765625, 0.1090087890625, 0.1483154296875, 0.1...	embed
21553435_c0	21553435	haskell	0	Title: error when updating cabal Problem title: error when updating cabal Tags: haskell, cabal Problem: error when updating cabal I cannot update cabal on windows seven. When running cabal install cabal-install , I get the following error: Linking C:\Users\sberg\AppData\Local\Temp\Cabal-1.18.1.2-10956\Cabal-1.18.1.2\di...	error when updating cabal error when updating cabal haskell cabal Linking Users AppData Local Temp Cabal-1.18.1.2-10956 Cabal-1.18.1.2 setup.exe Configuring Failed Error ExitFailure cabal-install-1.18.0.2 error when updating cabal I cannot update cabal on windows seven. When running cabal install cabal-install , I get ...	[ 0.017578125, 0.0023345947265625, 0.0233154296875, -0.00543212890625, 0.006622314453125, 0.00099945068359375, -0.0137939453125, -0.00872802734375, 0, 0.0196533203125, -0.0142822265625, -0.0289306640625, -0.0002536773681640625, -0.0172119140625, 0.00701904296875, -0.000499725341796875, ...	[ 18499, 3229, 1257, 56464, 109524, 1556, 142508, 12779, 53400, 5659, 137989, 24172, 37446, 30438, 289, 5759, 1819, 48400, 106000, 13683, 5, 169581, 46480, 59994, 190355, 212059, 5443, 217, 17647, 379, 80383, 133684, 53418, 28350, 98, 54825, 5967...	[ 0.1763916015625, 0.051300048828125, 0.1649169921875, 0.180908203125, 0.290771484375, 0.1182861328125, 0.21630859375, 0.13720703125, 0.1160888671875, 0.1270751953125, 0.1182861328125, 0.1099853515625, 0.186279296875, 0.2215576171875, 0.1990966796875, 0.044708251953125, 0.136962890625,...	embed
4405341_c0	4405341	haskell	0	Title: Issues with dependencies when trying to configure Setup.hs despite having dependencies installed Problem title: Issues with dependencies when trying to configure Setup.hs despite having dependencies installed Tags: haskell, cabal, cabal-install Problem: Issues with dependencies when trying to configure Setup.hs ...	Issues with dependencies when trying to configure Setup.hs despite having dependencies installed Issues with dependencies when trying to configure Setup.hs despite having dependencies installed haskell cabal cabal-install Issues Setup.hs Issues with dependencies when trying to configure Setup.hs despite having dependen...	[ 0.000911712646484375, 0.0012359619140625, 0.0157470703125, 0.00408935546875, -0.0267333984375, 0.0123291015625, -0.01806640625, 0.003082275390625, 0.0074462890625, 0.0177001953125, -0.030517578125, -0.032470703125, 0.00186920166015625, 0.0179443359375, 0.009765625, 0.0164794921875, 0...	[ 223317, 7, 678, 42548, 117538, 31577, 222495, 19943, 2037, 127, 61518, 19441, 20600, 1556, 142508, 109524, 80383, 62952, 5, 11435, 31344, 18151, 9790, 390, 25632, 2046, 18499, 272, 16792, 6097, 17368, 11675, 75101, 13438, 5701, 64557, 3525, 4...	[ 0.1856689453125, 0.1326904296875, 0.0770263671875, 0.240966796875, 0.162841796875, 0.09991455078125, 0.2314453125, 0.1827392578125, 0.1402587890625, 0.145263671875, 0.1314697265625, 0.108154296875, 0.2076416015625, 0.1158447265625, 0.2158203125, 0.230224609375, 0.12646484375, 0.054...	embed
46942579_c1	46942579	haskell	1	'" and "getFPS" to a list of images and saves the output-video to a user defined location. ---------------------------------------------------------------------------------------------} saveVideo :: String -> [Image PixelYA8] -> Int -> IO () saveVideo path imgs fps = do -- program stops after hitting next line -- frame...	'" and "getFPS" to a list of images and saves the output-video to a user defined location. ---------------------------------------------------------------------------------------------} saveVideo :: String -> [Image PixelYA8] -> Int -> IO () saveVideo path imgs fps = do -- program stops after hitting next line -- frame...	[ 0.006378173828125, -0.003875732421875, -0.00518798828125, 0.0296630859375, -0.007171630859375, -0.00567626953125, 0.0036468505859375, -0.002105712890625, 0.0081787109375, -0.01226806640625, -0.01055908203125, 0.017822265625, 0.01531982421875, 0.00112152099609375, -0.006439208984375, 0....	[ 242, 136, 3794, 919, 9059, 47, 10, 5303, 43079, 30098, 140992, 10248, 38937, 61924, 31913, 25073, 23351, 216960, 111159, 14671, 1019, 18, 17780, 60875, 566, 9405, 192983, 54, 1528, 7279, 7103, 5962, 11737, 13315, 123789, 2783, 254, 1914, 82...	[ 0.06109619140625, 0.0596923828125, 0.1591796875, 0.149658203125, 0.26171875, 0.0703125, 0.0035400390625, 0.113525390625, 0.1839599609375, 0.187744140625, 0.152587890625, 0.2132568359375, 0.11669921875, 0.128173828125, 0.15771484375, 0.2044677734375, 0.1029052734375, 0.1619873046875...	embed
78034649_c0	78034649	haskell	0	Title: Every Lens' is a Traversal'... how? Problem title: Every Lens' is a Traversal'... how? Tags: functor, applicative, haskell-lens, haskell Problem: Every Lens' is a Traversal'... how? Control.Lens.Tutorial says: type Traversal' a b = forall f . Applicative f => (b -> f b) -> (a -> f a) type Len...	Every Lens' is a Traversal'... how? Every Lens' is a Traversal'... how? functor applicative haskell-lens haskell Every Lens Traversal Applicative Functor Every Lens' is a Traversal'... how? Control.Lens.Tutorial says: I simply don't follow the logical sequence here. We know that every Applicative is...	[ 0.00567626953125, 0.0125732421875, -0.0118408203125, 0.010009765625, 0.005889892578125, 0.006256103515625, 0.00421142578125, -0.021240234375, 0.017333984375, -0.00970458984375, -0.0011749267578125, -0.0017547607421875, -0.006622314453125, 0.008544921875, -0.0091552734375, 0.00018501281...	[ 87769, 18226, 7, 3768, 83, 10, 4937, 814, 2317, 3642, 7477, 18770, 41816, 4935, 1556, 142508, 1977, 5659, 11048, 28670, 25, 27131, 866, 1755, 15665, 77275, 2301, 18, 28960, 62775, 944, 3688, 3714, 11907, 57143, 158, 37676, 93192 ]	[ 0.26171875, 0.271484375, 0.161376953125, 0.080322265625, 0.0811767578125, 0.069580078125, 0.167236328125, 0.242431640625, 0.2242431640625, 0.13623046875, 0.100830078125, 0.1815185546875, 0.165283203125, 0.161865234375, 0.10650634765625, 0.2127685546875, 0.138427734375, 0.150390625,...	embed
6600134_c0	6600134	haskell	0	Title: Why putStrLn end of line is out of thread lock? Problem title: Why putStrLn end of line is out of thread lock? Tags: io, haskell, multithreading Problem: Why putStrLn end of line is out of thread lock? When I use putStrLn txt from several threads in Haskell, it's possible to get the text intercalated with the en...	Why putStrLn end of line is out of thread lock? Why putStrLn end of line is out of thread lock? io haskell multithreading Why base-4.2.0.2 Why putStrLn end of line is out of thread lock? When I use putStrLn txt from several threads in Haskell, it's possible to get the text intercalated with the end of lines, but if I u...	[ 0.006744384765625, -0.003662109375, 0.0113525390625, 0.005767822265625, -0.004425048828125, 0.00775146484375, 0.0003910064697265625, 0.00885009765625, -0.016357421875, -0.01361083984375, -0.013427734375, -0.029541015625, 0.006927490234375, -0.01129150390625, 0.0057373046875, 0.01257324...	[ 44084, 3884, 71713, 866, 19, 3564, 111, 13315, 1810, 86997, 56776, 22995, 1556, 142508, 3869, 65847, 3647, 117904, 133684, 124326, 1295, 40368, 20625, 7722, 7986, 1940, 6827, 27686, 678, 124519, 4527, 3650, 37223, 41872, 11343, 43240, 7108, 4...	[ 0.0804443359375, 0.199951171875, 0.27734375, 0.1427001953125, 0.092041015625, 0.1700439453125, 0.1226806640625, 0.1427001953125, 0.145751953125, 0.1773681640625, 0.20751953125, 0.1177978515625, 0.0982666015625, 0.2314453125, 0.0654296875, 0.093505859375, 0.1822509765625, 0.15405273...	embed
32159328_c0	32159328	haskell	0	Title: Can csv-conduit read a string in csv form and parse it into some intermediate datatype? Problem title: Can csv-conduit read a string in csv form and parse it into some intermediate datatype? Tags: parsing, haskell, csv, conduit Problem: Can csv-conduit read a string in csv form and parse it into some intermediat...	Can csv-conduit read a string in csv form and parse it into some intermediate datatype? Can csv-conduit read a string in csv form and parse it into some intermediate datatype? parsing haskell csv conduit Can column1 column2 column3 column4 Row Just Can csv-conduit read a string in csv form and parse it into some interm...	[ -0.012939453125, -0.00186920166015625, 0.00799560546875, 0.059326171875, -0.00154876708984375, 0.0113525390625, 0.019287109375, -0.009765625, -0.00555419921875, 0.0087890625, -0.0380859375, -0.02587890625, -0.01416015625, 0.01043701171875, -0.007171630859375, -0.0025634765625, -0.014...	[ 4171, 20763, 334, 9, 2271, 112061, 12301, 79315, 23, 3173, 366, 184, 3934, 81814, 2182, 2053, 50986, 136, 6953, 1556, 142508, 120565, 3365, 316, 418, 304, 363, 617, 96190, 9563, 209806, 62270, 32102, 44954, 4527, 7225, 16454, 27198, 10644, ...	[ 0.09100341796875, 0.09930419921875, 0.2286376953125, 0.07415771484375, 0.113525390625, 0.232666015625, 0.2073974609375, 0.199951171875, 0.027435302734375, 0.138671875, 0.1541748046875, 0.0657958984375, 0.03533935546875, 0.1549072265625, 0.0560302734375, 0.098876953125, 0.193481445312...	embed
55651807_c0	55651807	haskell	0	Title: How to code the function drop without the prelude module in Haskell? Problem title: How to code the function drop without the prelude module in Haskell? Tags: recursion, haskell Problem: How to code the function drop without the prelude module in Haskell? I want to write some prelude functions by myself in Haske...	How to code the function drop without the prelude module in Haskell? How to code the function drop without the prelude module in Haskell? recursion haskell How Haskell TAKE DROP take1 x:xs x:take1 n-1 Input Output drop1 List How to code the function drop without the prelude module in Haskell? I want to write some prelu...	[ 0.0030670166015625, 0.0250244140625, -0.005523681640625, 0.0025482177734375, -0.00921630859375, 0.0019073486328125, 0.01019287109375, -0.0098876953125, 0.00927734375, -0.0135498046875, 0.01129150390625, -0.037841796875, -0.00799560546875, 0.01202392578125, 0.0103759765625, 0.0011138916...	[ 11249, 18151, 32354, 36069, 15490, 479, 822, 112, 88996, 20625, 142508, 195625, 1830, 1556, 60079, 647, 391, 148197, 5646, 1022, 425, 78219, 5759, 360, 13538, 418, 32036, 23, 33022, 35978, 28219, 81979, 21771, 44402 ]	[ 0.027069091796875, 0.1923828125, 0.1824951171875, 0.29443359375, 0.12841796875, 0.092529296875, 0.1632080078125, 0.1165771484375, 0.1649169921875, 0.127685546875, 0.231201171875, 0.1190185546875, 0.045684814453125, 0.10888671875, 0.156494140625, 0.09228515625, 0.1107177734375, 0.25...	embed
58695184_c0	58695184	haskell	0	Title: Couldn't match expected type `[Integer]' with actual type `Bool' Problem title: Couldn't match expected type `[Integer]' with actual type `Bool' Tags: haskell, functional-programming, list, recursion Problem: Couldn't match expected type `[Integer]' with actual type `Bool' I'm tryin...	Couldn't match expected type `[Integer]' with actual type `Bool' Couldn't match expected type `[Integer]' with actual type `Bool' haskell functional-programming list recursion Couldn Integer Bool _:s Couldn't match expected type `[Integer]' with actual type `Bool' I'm trying to iterate rec...	[ -0.00543212890625, -0.00445556640625, -0.01300048828125, 0.01385498046875, -0.005706787109375, -0.0133056640625, -0.0037384033203125, 0.008544921875, -0.00057220458984375, 0.0167236328125, 0.0223388671875, -0.020751953125, 0.0169677734375, 0.006011962890625, -0.002166748046875, -0.0069...	[ 191147, 3768, 18, 14858, 84751, 10644, 4153, 67, 1505, 678, 8561, 12647, 929, 1556, 142508, 123309, 28966, 5303, 195625, 1830, 19, 44401, 2460, 101, 12, 7, 31577, 8560, 5844, 645, 175199, 2174, 756, 142424, 105950, 757, 18499, 566, 20949, ...	[ 0.1060791015625, 0.11083984375, 0.08709716796875, 0.1822509765625, 0.1649169921875, 0.164794921875, 0.056640625, 0.143798828125, 0.1334228515625, 0.09124755859375, 0.1365966796875, 0.10113525390625, 0.162353515625, 0.10400390625, 0.1881103515625, 0.15283203125, 0.08258056640625, 0....	embed
18214179_c0	18214179	haskell	0	Title: Combining lexer and parser in a parser combinator Problem title: Combining lexer and parser in a parser combinator Tags: parsing, parser-combinators, haskell, uu-parsinglib Problem: Combining lexer and parser in a parser combinator I'm using uu-parsinglib , but I think the following question is parser combinator...	Combining lexer and parser in a parser combinator Combining lexer and parser in a parser combinator parsing parser-combinators haskell uu-parsinglib Combining MyToken AST LineColPos Combining lexer and parser in a parser combinator I'm using uu-parsinglib , but I think the following question is parser combinator generi...	[ -0.0274658203125, 0.0023040771484375, 0.00433349609375, 0.020263671875, -0.01177978515625, 0.021728515625, 0.013671875, -0.0196533203125, -0.0028076171875, -0.048583984375, 0.0101318359375, 0.033203125, 0.0185546875, -0.00421142578125, -0.008544921875, -0.00189971923828125, -0.014465...	[ 106935, 592, 95, 34058, 136, 366, 2189, 23, 22321, 1290, 6953, 277, 19155, 22230, 1556, 142508, 2051, 2500, 5612, 2646, 7763, 1098, 48963, 16777, 78457, 7192, 17368, 9655, 189534, 27781, 678, 915, 5267, 425, 27489, 5303, 47, 84694, 10644, ...	[ 0.2266845703125, 0.0177459716796875, 0.1610107421875, 0.292724609375, 0.1319580078125, 0.1890869140625, 0.2216796875, 0.06353759765625, 0.24755859375, 0.170166015625, 0.051727294921875, 0.05242919921875, 0.2138671875, 0.0914306640625, 0.079833984375, 0.17626953125, 0.17138671875, 0...	embed
24158551_c0	24158551	haskell	0	Title: How to use random numbers within recursion? Problem title: How to use random numbers within recursion? Tags: haskell, random, recursion Problem: How to use random numbers within recursion? I'm trying to select a random element from a list but that'll make the function impure thus fail to compile. What should I d...	How to use random numbers within recursion? How to use random numbers within recursion? haskell random recursion How Jabberwocky Integer Syllables Middle Consonant Vowel Ending How to use random numbers within recursion? I'm trying to select a random element from a list but that'll make the function impure thus fail to...	[ -0.0281982421875, 0.01611328125, 0.01239013671875, -0.0159912109375, -0.00909423828125, 0.032958984375, -0.0040283203125, -0.0196533203125, -0.00885009765625, -0.0322265625, 0.02490234375, -0.031005859375, -0.01165771484375, -0.00128936767578125, 0.0274658203125, -0.008056640625, -0....	[ 11249, 47, 4527, 96759, 101935, 28032, 195625, 1830, 32, 1556, 142508, 60200, 1297, 3613, 25160, 44401, 1165, 13566, 102256, 1681, 5346, 8420, 357, 87, 31577, 36849, 12830, 5303, 32354, 21980, 3408, 35782, 9969, 1340, 5844, 26946, 17780, 2263...	[ 0.0948486328125, 0.1043701171875, 0.1522216796875, 0.2191162109375, 0.202392578125, 0.1710205078125, 0.2340087890625, 0.146728515625, 0.008056640625, 0.0938720703125, 0.197265625, 0.065673828125, 0.0721435546875, 0.0926513671875, 0.120361328125, 0.1142578125, 0.0675048828125, 0.032...	embed
25255289_c0	25255289	haskell	0	Title: Idiomatic way to express general computations in Haskell Problem title: Idiomatic way to express general computations in Haskell Tags: symbolic-computation, haskell Problem: Idiomatic way to express general computations in Haskell There must exist a good idiomatic way to express general computations in Haskell o...	Idiomatic way to express general computations in Haskell Idiomatic way to express general computations in Haskell symbolic-computation haskell Idiomatic Haskell Computation Double Square Scale Idiomatic way to express general computations in Haskell There must exist a good idiomatic way to express general computations ...	[ -0.0206298828125, 0.0026702880859375, 0.0098876953125, 0.01470947265625, 0.010986328125, 0.0220947265625, -0.0036163330078125, -0.0096435546875, 0.0091552734375, -0.0267333984375, -0.0257568359375, -0.00872802734375, 0.005157470703125, -0.009765625, -0.0113525390625, 0.000732421875, ...	[ 5670, 47148, 3917, 36510, 4537, 181135, 5256, 20625, 142508, 128201, 277, 7077, 1556, 159415, 107172, 68305, 152653, 8110, 32316, 4127, 49666, 9523, 10644, 17366, 831, 1380, 1257, 903, 2186, 2870, 30563, 97751, 1363, 41143, 1884, 112033, 9803, ...	[ 0.1407470703125, 0.1104736328125, 0.06585693359375, 0.143310546875, 0.1597900390625, 0.195068359375, 0.047393798828125, 0.1319580078125, 0.2347412109375, 0.13818359375, 0.0159912109375, 0.0889892578125, 0.1121826171875, 0.13134765625, 0.0352783203125, 0.059326171875, 0.064697265625, ...	embed
53460700_c0	53460700	haskell	0	Title: Concatenate to a list of string another string Problem title: Concatenate to a list of string another string Tags: concatenation, haskell, string, list Problem: Concatenate to a list of string another string The below code gives back a list of String but I want it work on multiple cases. The problem is that I ca...	Concatenate to a list of string another string Concatenate to a list of string another string concatenation haskell string list Concatenate Char x:xs Concatenate to a list of string another string The below code gives back a list of String but I want it work on multiple cases. The problem is that I can't create the sam...	[ 0.00994873046875, -0.006683349609375, -0.0079345703125, 0.01116943359375, -0.00933837890625, 0.0003681182861328125, 0.0216064453125, 0.008544921875, 0.029541015625, 0.005401611328125, 0.020263671875, -0.02880859375, 0.0081787109375, 0.00897216796875, -0.0135498046875, -0.00367736816406...	[ 1657, 33478, 76, 67, 47, 5303, 79315, 15700, 158, 4460, 33, 1556, 142508, 21656, 1022, 425, 35064, 18151, 76199, 4420, 23351, 214, 3444, 4488, 98, 48716, 50218, 2967, 28282, 5701, 24763, 16750, 195625, 1830, 1528, 25632, 51713, 60552, 18, ...	[ 0.07708740234375, 0.1966552734375, 0.1427001953125, 0.07623291015625, 0.0926513671875, 0.1451416015625, 0.1898193359375, 0.06671142578125, 0.098388671875, 0.23095703125, 0.0997314453125, 0.0908203125, 0.1776123046875, 0.108642578125, 0.0240478515625, 0.05010986328125, 0.0538024902343...	embed
22003307_c0	22003307	haskell	0	Title: Depth of a tree (Haskell) Problem title: Depth of a tree (Haskell) Tags: haskell, tree Problem: Depth of a tree (Haskell) I'm trying to figure out how to calculate the depth of a general tree in Haskell. I can figure out the solution for simple binary trees, but not for general trees with any number of leaves. H...	Depth of a tree (Haskell) Depth of a tree (Haskell) haskell tree Depth Haskell Tree Nil Node Depth of a tree (Haskell) I'm trying to figure out how to calculate the depth of a general tree in Haskell. I can figure out the solution for simple binary trees, but not for general trees with any number of leaves. Here's the ...	[ 0.02294921875, 0.02294921875, 0.0027008056640625, -0.00494384765625, 0.02294921875, 0.0084228515625, -0.01220703125, -0.0245361328125, 0.01385498046875, -0.040771484375, 0.002685546875, -0.04638671875, 0.00096893310546875, 0.0177001953125, 0.0025634765625, 0.01239013671875, 0.0286865...	[ 262, 254, 927, 111, 10, 53201, 6495, 7, 142508, 1556, 20625, 101344, 77175, 438, 112, 31577, 26366, 3642, 74481, 67, 70, 168867, 4537, 23, 29806, 8781, 2394, 6635, 1360, 959, 678, 14012, 31358, 18151, 2811, 40383, 90, 9082, 70541, 5303, ...	[ 0.184814453125, 0.2152099609375, 0.1591796875, 0.09039306640625, 0.01300048828125, 0.255859375, 0.09161376953125, 0.06951904296875, 0.239013671875, 0.1094970703125, 0.1292724609375, 0.1949462890625, 0.1943359375, 0.117919921875, 0.023468017578125, 0.015777587890625, 0.0809326171875, ...	embed
69465400_c1	69465400	haskell	1	nub rankings main :: IO () main = interact (unlines . map show . solution . map (map read . words) . getInputs . lines) Test Case in GHCI :l "solution" let i = "7\n100 100 50 40 40 20 10\n4\n5 25 50 120" solution i // "6\n4\n2\n1\n" Specific questions I have: Will the duplicateRemovedRankings variable be calculated on...	nub rankings main :: IO () main = interact (unlines . map show . solution . map (map read . words) . getInputs . lines) Test Case in GHCI :l "solution" let i = "7\n100 100 50 40 40 20 10\n4\n5 25 50 120" solution i // "6\n4\n2\n1\n" Specific questions I have: Will the duplicateRemovedRankings variable be calculated on...	[ -0.02392578125, 0.01519775390625, -0.004913330078125, -0.023193359375, -0.0022430419921875, 0.0064697265625, 0.00823974609375, -0.0062255859375, 0.01263427734375, 0.016845703125, -0.020751953125, -0.00006031990051269531, 0.0311279296875, -0.01519775390625, -0.0216064453125, 0.001815795...	[ 315, 275, 77918, 7, 5201, 1984, 17780, 2203, 78974, 309, 59801, 22288, 7639, 29806, 62346, 12301, 34153, 2046, 4153, 7077, 124519, 8647, 43731, 41877, 17304, 141, 166589, 17, 966, 3559, 805, 836, 1112, 209, 617, 758, 714, 5390, 910, 20905...	[ 0.218994140625, 0.2337646484375, 0.311279296875, 0.1009521484375, 0.18310546875, 0.041259765625, 0.208251953125, 0.056610107421875, 0.2178955078125, 0.05206298828125, 0.1346435546875, 0.16845703125, 0.0555419921875, 0.139892578125, 0.1451416015625, 0.09442138671875, 0.0684814453125, ...	embed
18775712_c1	18775712	haskell	1	-insensitive-1.1 Downloading http-types-0.8.1... Building void-0.6.1... Building unordered-containers-0.2.3.2... Building lifted-base-0.2.1.0... Confi ! Push rejected, failed to compile Multipack app And every time, it stops on a different line and a different place in the line. I've tried it with various buildpacks an...	-insensitive-1.1 Downloading http-types-0.8.1... Building void-0.6.1... Building unordered-containers-0.2.3.2... Building lifted-base-0.2.1.0... Confi ! Push rejected, failed to compile Multipack app And every time, it stops on a different line and a different place in the line. I've tried it with various buildpacks an...	[ -0.01708984375, 0.011962890625, -0.005889892578125, 0.00970458984375, -0.005126953125, 0.0203857421875, 0.0023651123046875, -0.0272216796875, 0.005889892578125, 0.01397705078125, -0.0108642578125, -0.031494140625, 0.005035400390625, 0.02294921875, -0.000732421875, 0.0223388671875, 0....	[ 73, 176302, 13, 92134, 4857, 1621, 50986, 23320, 206730, 104919, 2292, 173245, 51, 80596, 98102, 1314, 133684, 107033, 60520, 297, 37382, 102107, 139403, 114405, 34590, 89829, 165523, 9969, 1340, 19335, 29102, 4027, 11907, 1733, 7279, 12921, 13...	[ 0.08154296875, 0.249267578125, 0.072021484375, 0.120849609375, 0.1473388671875, 0.1143798828125, 0.13671875, 0.000274658203125, 0.13232421875, 0.151123046875, 0.1209716796875, 0.1123046875, 0.0086669921875, 0.1563720703125, 0.126953125, 0.016845703125, 0.070068359375, 0.05880737304...	embed
5132350_c0	5132350	haskell	0	Title: How do Haskell compilers decide whether to allocate on the heap or the stack? Problem title: How do Haskell compilers decide whether to allocate on the heap or the stack? Tags: haskell, heap-memory, stack-memory, memory-management Problem: How do Haskell compilers decide whether to allocate on the heap or the st...	How do Haskell compilers decide whether to allocate on the heap or the stack? How do Haskell compilers decide whether to allocate on the heap or the stack? haskell heap-memory stack-memory memory-management How Haskell How do Haskell compilers decide whether to allocate on the heap or the stack? Haskell doesn't feature...	[ 0.0120849609375, 0.0189208984375, 0.005950927734375, 0.00836181640625, -0.00750732421875, 0.004486083984375, -0.0181884765625, 0.01214599609375, -0.0037078857421875, -0.00921630859375, 0.00140380859375, -0.03759765625, 0.027587890625, 0.0264892578125, 0.004058837890625, 0.0024871826171...	[ 11249, 20625, 142508, 9969, 34759, 28288, 36766, 24286, 33478, 98, 764, 2631, 707, 177261, 1556, 109005, 98323, 87140, 22027, 18, 60213, 143726, 24365, 756, 36746, 115081, 34292, 110, 162520, 91067, 54529, 402, 42486, 205794, 139392, 18151, 144...	[ 0.0753173828125, 0.1497802734375, 0.271240234375, 0.150146484375, 0.1734619140625, 0.1551513671875, 0.016571044921875, 0.189697265625, 0.1337890625, 0.1312255859375, 0.1766357421875, 0.180419921875, 0.080078125, 0.217041015625, 0.1197509765625, 0.10986328125, 0.192138671875, 0.1281...	embed
45849782_c1	45849782	haskell	1	" putStrLn (show isNum ++ " is what percent of " ++ show ofNum ++ "?\n" ) putStr "> " ans <- getLine submitStringAnswer (ans, percentStr ++ "%") submitStringAnswer :: (String, String) -> IO () submitStringAnswer (myAns, correctAns) = do if myAns == correctAns then putStrLn "Congratz!" else do putStrLn ("Sorry the corre...	" putStrLn (show isNum ++ " is what percent of " ++ show ofNum ++ "?\n" ) putStr "> " ans <- getLine submitStringAnswer (ans, percentStr ++ "%") submitStringAnswer :: (String, String) -> IO () submitStringAnswer (myAns, correctAns) = do if myAns == correctAns then putStrLn "Congratz!" else do putStrLn ("Sorry the corre...	[ -0.015869140625, -0.0203857421875, -0.00775146484375, 0.015380859375, 0.00604248046875, 0.02392578125, -0.0064697265625, -0.0177001953125, 0.002105712890625, 0.0091552734375, -0.0128173828125, -0.00156402587890625, 0.00958251953125, -0.00555419921875, -0.01953125, 0.006866455078125, ...	[ 3884, 71713, 866, 19, 15, 31374, 83, 839, 316, 37223, 2367, 33297, 111, 7639, 58, 70902, 7210, 2046, 93232, 137447, 214, 7251, 7, 6488, 10133, 6, 3949, 23351, 16, 17780, 1176, 4, 26785, 759, 11935, 71867, 169, 158240, 1294, 70, 35166, ...	[ 0.242919921875, 0.31298828125, 0.12255859375, 0.1416015625, 0.009613037109375, 0.1761474609375, 0.1661376953125, 0.035400390625, 0.179443359375, 0.232666015625, 0.0262908935546875, 0.302001953125, 0.2191162109375, 0.1685791015625, 0.008941650390625, 0.0252532958984375, 0.13818359375,...	embed
49084482_c0	49084482	haskell	0	Title: Where is class Ord defined in GHC library? Problem title: Where is class Ord defined in GHC library? Tags: haskell, ghc Problem: Where is class Ord defined in GHC library? Source for GHC.Base has the note at the beginning saying in part The overall structure of the GHC Prelude is a bit tricky... So the rough str...	Where is class Ord defined in GHC library? Where is class Ord defined in GHC library? haskell ghc Where Ord GHC GHC.Base Prelude GHC.Prim Has GHC.Prim.hi-boot GHC.Prim.hi Classes Functor Monad Types Bool Ordering Char Where is class Ord defined in GHC library? Source for GHC.Base has the note at the beginning saying in...	[ 0.009521484375, 0.0068359375, 0.01611328125, -0.0086669921875, 0.0157470703125, 0.0230712890625, -0.0000095367431640625, -0.0118408203125, -0.00250244140625, -0.000591278076171875, 0.0010986328125, -0.059326171875, 0.003387451171875, -0.00933837890625, -0.0032501220703125, 0.0238037109...	[ 78662, 18507, 35379, 61924, 71, 527, 73265, 35773, 1294, 23, 1556, 142508, 31380, 238, 63473, 1914, 822, 112, 145111, 979, 80765, 35014, 28670, 18770, 60331, 60457, 2460, 929, 81206, 214, 21656, 77641, 20537, 31344, 11435, 56112, 18, 51584, ...	[ 0.0838623046875, 0.2164306640625, 0.2919921875, 0.1689453125, 0.050933837890625, 0.080322265625, 0.201904296875, 0.1119384765625, 0.0133056640625, 0.0250244140625, 0.0875244140625, 0.17578125, 0.090087890625, 0.09063720703125, 0.12890625, 0.06365966796875, 0.14404296875, 0.12414550...	embed
27924699_c0	27924699	haskell	0	Title: Unusual Kinds and Data Constructors Problem title: Unusual Kinds and Data Constructors Tags: type-kinds, polymorphism, data-kinds, dependent-type, haskell Problem: Unusual Kinds and Data Constructors I don't know how I didn't notice this, but data constructors and function definitions alike can't use types with ...	Unusual Kinds and Data Constructors Unusual Kinds and Data Constructors type-kinds polymorphism data-kinds dependent-type haskell Unusual Kinds Data Constructors XPolyKinds LANGUAGE DataKinds KindSignatures Nat Foo Fails Expected Unusual Kinds and Data Constructors I don't know how I didn't notice this, but data constr...	[ 0.004364013671875, 0.018310546875, -0.013427734375, -0.01953125, 0.01043701171875, -0.0024261474609375, -0.0111083984375, 0.005340576171875, -0.002655029296875, -0.0299072265625, 0.00921630859375, -0.0517578125, 0.009033203125, -0.0035247802734375, 0.0019989013671875, -0.00018501281738...	[ 56979, 64010, 27435, 136, 11809, 82084, 18770, 7, 10644, 68347, 35874, 178851, 2053, 108750, 50986, 1556, 142508, 45005, 48381, 605, 7250, 98064, 218723, 11, 68875, 9572, 31, 190355, 60075, 13, 64549, 25251, 32354, 80934, 5062, 831, 18, 4527,...	[ 0.0863037109375, 0.1365966796875, 0.1439208984375, 0.04974365234375, 0.0697021484375, 0.1339111328125, 0.12353515625, 0.015869140625, 0.1641845703125, 0.1700439453125, 0.064453125, 0.1365966796875, 0.1212158203125, 0.09808349609375, 0.1519775390625, 0.06201171875, 0.181640625, 0.01...	embed
4359521_c1	4359521	haskell	1	Parse any single character item = P $ \s -> case s of [] -> Nothing (c:cs) -> Just (c,cs) -- (+++) parse either using p or else using q infixr 5 +++ (+++) :: Parser a -> Parser a -> Parser a p +++ q = P $ \s -> listToMaybe [ x \| Just x <- [parse p s, parse q s]] -- (p >*> f) parse using p to produce a. -- Then parse u...	Parse any single character item = P $ \s -> case s of [] -> Nothing (c:cs) -> Just (c,cs) -- (+++) parse either using p or else using q infixr 5 +++ (+++) :: Parser a -> Parser a -> Parser a p +++ q = P $ \s -> listToMaybe [ x \| Just x <- [parse p s, parse q s]] -- (p >*> f) parse using p to produce a. -- Then parse u...	[ -0.00653076171875, 0.0228271484375, 0.00958251953125, 0.00225830078125, -0.00171661376953125, 0.0179443359375, -0.006561279296875, -0.032958984375, 0.0223388671875, 0.00775146484375, 0.01263427734375, -0.007781982421875, -0.00653076171875, 0.006011962890625, -0.0177001953125, 0.0129394...	[ 2392, 184, 2499, 11001, 62816, 35735, 2203, 436, 3650, 6, 41872, 7, 33079, 7225, 91, 111, 268, 182747, 238, 12, 4439, 9563, 4210, 86409, 366, 40101, 17368, 915, 707, 37076, 8096, 23, 55923, 42, 190, 1984, 2189, 10, 5303, 7763, 82419, ...	[ 0.249267578125, 0.218994140625, 0.1226806640625, 0.1815185546875, 0.228515625, 0.2259521484375, 0.03216552734375, 0.16259765625, 0.16357421875, 0.00518798828125, 0.1043701171875, 0.1060791015625, 0.0260162353515625, 0.1539306640625, 0.13037109375, 0.1031494140625, 0.0091552734375, ...	embed
44838547_c0	44838547	haskell	0	Title: How to use replicate to generate a matrix Problem title: How to use replicate to generate a matrix Tags: haskell Problem: How to use replicate to generate a matrix I was curious how to use replicate in Haskell to create a list of integers that repeated a set of numbers. This is for a homework and the rules kind ...	How to use replicate to generate a matrix How to use replicate to generate a matrix haskell How How to use replicate to generate a matrix I was curious how to use replicate in Haskell to create a list of integers that repeated a set of numbers. This is for a homework and the rules kind of confuse me to begin with but e...	[ 0.0020904541015625, 0.00176239013671875, -0.004150390625, 0.0201416015625, -0.015869140625, 0.01141357421875, -0.0189208984375, 0.015869140625, 0.006134033203125, -0.04931640625, -0.0296630859375, -0.032958984375, 0.0118408203125, 0.02587890625, -0.034423828125, -0.01904296875, 0.005...	[ 11249, 4527, 143126, 67, 47, 139392, 10, 50944, 425, 1556, 142508, 193844, 3642, 23, 20625, 28282, 5303, 892, 26255, 119140, 5423, 101935, 100, 5368, 18244, 91736, 55681, 85590, 3444, 615, 1126, 483, 20028, 16503, 1660, 12638, 1733, 26484, ...	[ 0.0643310546875, 0.1363525390625, 0.278564453125, 0.2225341796875, 0.052886962890625, 0.2137451171875, 0.0333251953125, 0.2091064453125, 0.1533203125, 0.1400146484375, 0.2274169921875, 0.026336669921875, 0.032958984375, 0.04486083984375, 0.13134765625, 0.1197509765625, 0.160400390625...	embed
4733019_c0	4733019	haskell	0	Title: How many arguments takes the foldr function of Haskell? Problem title: How many arguments takes the foldr function of Haskell? Tags: haskell, function, fold, arguments Problem: How many arguments takes the foldr function of Haskell? I am new to Haskell and I am reading the book "Real World Haskell" . In the Chap...	How many arguments takes the foldr function of Haskell? How many arguments takes the foldr function of Haskell? haskell function fold arguments How Haskell Bool y:ys x:y How many arguments takes the foldr function of Haskell? I am new to Haskell and I am reading the book "Real World Haskell" . In the Chapter 4 of the b...	[ -0.0003185272216796875, 0.00726318359375, -0.01141357421875, -0.0026702880859375, 0.0013885498046875, 0.0172119140625, -0.0113525390625, 0.00836181640625, 0.012939453125, -0.01416015625, -0.005615234375, -0.037841796875, -0.006805419921875, 0.0196533203125, -0.00665283203125, -0.002807...	[ 11249, 5941, 10750, 7, 51776, 18344, 7569, 32354, 111, 20625, 142508, 1556, 42822, 2460, 929, 113, 4778, 1022, 53, 16454, 12877, 68996, 6661, 201, 26458, 81979, 456, 434, 18781, 21115, 75358, 17368, 120709, 22591, 1010, 29806, 138, 61475, 3...	[ 0.06103515625, 0.135498046875, 0.265380859375, 0.14111328125, 0.14794921875, 0.1702880859375, 0.24755859375, 0.1849365234375, 0.06536865234375, 0.138916015625, 0.254150390625, 0.1231689453125, 0.241943359375, 0.0635986328125, 0.1646728515625, 0.055938720703125, 0.0718994140625, 0.0...	embed
8852642_c1	8852642	haskell	1	MySnaplet -> Snaplet SubSnaplet instead. There is a class+instance like in 3. that provides a Lens MySnaplet (Snaplet SubSnaplet) . The class+instance requires a Lens (Snaplet MySnaplet) (Snaplet SubSnaplet) . The class+instance assumes that MySnaplet is the "top Snaplet" of the application, and requires an absolute l...	MySnaplet -> Snaplet SubSnaplet instead. There is a class+instance like in 3. that provides a Lens MySnaplet (Snaplet SubSnaplet) . The class+instance requires a Lens (Snaplet MySnaplet) (Snaplet SubSnaplet) . The class+instance assumes that MySnaplet is the "top Snaplet" of the application, and requires an absolute l...	[ -0.01708984375, 0.01385498046875, 0.0179443359375, -0.0179443359375, -0.028564453125, 0.0010223388671875, -0.00506591796875, 0.00408935546875, 0.019775390625, -0.0166015625, -0.0203857421875, 0.0263671875, -0.006988525390625, 0.01287841796875, 0.005462646484375, -0.0201416015625, 0.0...	[ 2646, 294, 76, 54572, 33079, 121190, 1974, 8273, 64457, 8622, 18507, 1328, 116071, 1884, 1031, 87344, 18226, 7, 73, 144570, 41591, 13784, 38415, 89931, 3098, 239879, 8110, 70, 876, 60331, 71, 1957, 91067, 8562, 10422, 12301, 191, 787, 2174,...	[ 0.1959228515625, 0.09222412109375, 0.18994140625, 0.281494140625, 0.0439453125, 0.2479248046875, 0.261474609375, 0.2125244140625, 0.11181640625, 0.00677490234375, 0.24169921875, 0.125, 0.1436767578125, 0.02471923828125, 0.1063232421875, 0.1190185546875, 0.20654296875, 0.08715820312...	embed
57027138_c0	57027138	haskell	0	Title: Is my understanding of a reducible expression i.e. redex correct? Problem title: Is my understanding of a reducible expression i.e. redex correct? Tags: redex, haskell, functional-programming Problem: Is my understanding of a reducible expression i.e. redex correct? Programming in Haskell by Hutton says: An expr...	Is my understanding of a reducible expression i.e. redex correct? Is my understanding of a reducible expression i.e. redex correct? redex haskell functional-programming i.e Is my understanding of a reducible expression i.e. redex correct? Programming in Haskell by Hutton says: Is a reducible expression i.e. redex exact...	[ -0.007659912109375, -0.010009765625, 0.012451171875, 0.0262451171875, 0.0003204345703125, 0.0208740234375, -0.01397705078125, 0.002410888671875, -0.00469970703125, 0.0059814453125, 0.01287841796875, -0.038818359375, 0.006561279296875, 0.0089111328125, 0.00341796875, 0.00457763671875, ...	[ 100094, 74906, 28236, 125195, 15265, 425, 26785, 759, 10, 1556, 142508, 123309, 28966, 27958, 23, 20625, 97595, 1507, 66161, 32354, 38415, 959, 16750, 15700, 9351, 6492, 85, 628, 32166, 5510, 219836, 113857, 151575, 2878, 9709, 46572 ]	[ 0.1129150390625, 0.2022705078125, 0.216064453125, 0.2489013671875, 0.2137451171875, 0.25390625, 0.1236572265625, 0.02056884765625, 0.041534423828125, 0.0633544921875, 0.215576171875, 0.0860595703125, 0.07196044921875, 0.09490966796875, 0.0023193359375, 0.07012939453125, 0.01251220703...	embed
58684085_c0	58684085	haskell	0	Title: Number conversion in haskell Problem title: Number conversion in haskell Tags: haskell Problem: Number conversion in haskell The following code gives me an error which is somehow related to any type conversion issue: testfn:: Float -> Integer testfn n = 4.99 * fromIntegral(ceiling(n * (1.0/4.0))) calculate_price...	Number conversion in haskell Number conversion in haskell haskell the Number Float Integer calculate_price Fractional Number conversion in haskell The following code gives me an error which is somehow related to any type conversion issue: I'm new to haskell and I do not really understand why a multiplication is such a ...	[ -0.029052734375, -0.0155029296875, 0.00469970703125, -0.001007080078125, 0.00701904296875, -0.0002899169921875, -0.023193359375, 0.00775146484375, 0.00982666015625, 0.001922607421875, -0.039306640625, -0.021240234375, 0.0012664794921875, 0.0050048828125, -0.000591278076171875, 0.004730...	[ 103332, 142477, 23, 1556, 142508, 38699, 257, 44401, 74481, 5293, 329, 7868, 10763, 25632, 18151, 76199, 163, 18499, 209303, 62548, 2499, 10644, 31089, 3525, 28219, 15400, 127664, 1363, 83, 6044, 10, 24503, 9969, 1340, 678, 31380, 238, 116, ...	[ 0.2080078125, 0.223388671875, 0.09442138671875, 0.181640625, 0.234375, 0.1636962890625, 0.0628662109375, 0.202392578125, 0.1046142578125, 0.130615234375, 0.1016845703125, 0.1343994140625, 0.052734375, 0.0711669921875, 0.1141357421875, 0.001220703125, 0.0186004638671875, 0.201171875...	embed
58983734_c0	58983734	haskell	0	Title: Processing a list of states to a state with a list value Problem title: Processing a list of states to a state with a list value Tags: haskell Problem: Processing a list of states to a state with a list value I am new to Haskell and I am trying to understand Monads and States right now. I have been tasked with w...	Processing a list of states to a state with a list value Processing a list of states to a state with a list value haskell Processing State.State Processing a list of states to a state with a list value I am new to Haskell and I am trying to understand Monads and States right now. I have been tasked with writing a funct...	[ -0.012451171875, -0.01007080078125, -0.0120849609375, 0.006622314453125, -0.0150146484375, -0.0015106201171875, 0.0034027099609375, -0.0030059814453125, 0.01263427734375, -0.00457763671875, 0.0155029296875, 0.00799560546875, -0.01031494140625, 0.0218505859375, -0.013916015625, -0.01330...	[ 123996, 214, 5303, 117249, 47, 11341, 678, 34292, 10, 1556, 142508, 22836, 135206, 20625, 28219, 60331, 6468, 136, 46684, 66211, 32562, 32354, 25632, 138256, 208124, 41653, 9319, 4734, 1632, 169022, 903, 86595, 3444, 121293, 159029, 3564, 2704,...	[ 0.1805419921875, 0.0360107421875, 0.193115234375, 0.230712890625, 0.1524658203125, 0.205810546875, 0.06884765625, 0.1802978515625, 0.0128173828125, 0.143310546875, 0.2147216796875, 0.2113037109375, 0.17431640625, 0.1097412109375, 0.0865478515625, 0.1524658203125, 0.130859375, 0.022...	embed
12451906_c0	12451906	haskell	0	Title: Overload resolution during JSON parsing in Haskell Problem title: Overload resolution during JSON parsing in Haskell Tags: typeclass, parsing, overloading, haskell Problem: Overload resolution during JSON parsing in Haskell I am reading "Real World Haskell" (great book) and I have some confusion about how the co...	Overload resolution during JSON parsing in Haskell Overload resolution during JSON parsing in Haskell typeclass parsing overloading haskell JSONError Overload JSON Haskell JValue Either Bool JBool Right Left JString Overload resolution during JSON parsing in Haskell I am reading "Real World Haskell" (great book) and I ...	[ -0.00860595703125, 0.00634765625, -0.00173187255859375, 0.00031280517578125, -0.0059814453125, 0.01141357421875, -0.0191650390625, -0.00665283203125, -0.003875732421875, 0.01055908203125, -0.0218505859375, -0.03466796875, 0.00732421875, -0.018310546875, 0.00061798095703125, 0.009094238...	[ 9578, 63033, 158839, 20271, 821, 58627, 366, 20625, 142508, 6953, 10644, 67413, 645, 1556, 18468, 856, 50770, 2460, 929, 12647, 90911, 636, 2480, 71713, 23, 16454, 68996, 6661, 12877, 169463, 3642, 9969, 34759, 36849, 7, 297, 32354, 18507, ...	[ 0.13525390625, 0.28466796875, 0.2205810546875, 0.06072998046875, 0.134521484375, 0.218994140625, 0.127685546875, 0.138671875, 0.2427978515625, 0.0341796875, 0.17724609375, 0.183837890625, 0.1475830078125, 0.1253662109375, 0.06097412109375, 0.1405029296875, 0.1982421875, 0.053466796...	embed
17719620_c0	17719620	haskell	0	Title: While loop in Haskell with a condition Problem title: While loop in Haskell with a condition Tags: loops, haskell, while-loop Problem: While loop in Haskell with a condition I'm having a little Haskell Situation over here. I'm trying to write two functions with monads. First one is supposed to iterate through a ...	While loop in Haskell with a condition While loop in Haskell with a condition loops haskell while-loop While Haskell Test Bool power2 Please While loop in Haskell with a condition I'm having a little Haskell Situation over here. I'm trying to write two functions with monads. First one is supposed to iterate through a f...	[ 0, -0.002838134765625, 0.006072998046875, 0.0303955078125, 0.00750732421875, 0.015869140625, 0.00506591796875, -0.003021240234375, -0.0087890625, -0.01190185546875, 0.0230712890625, 0.005767822265625, -0.0341796875, 0.0166015625, 0.0054931640625, 0.005218505859375, 0.0096435546875, ...	[ 51404, 40956, 23, 20625, 142508, 678, 10, 35431, 1556, 12960, 28354, 8647, 2460, 929, 14537, 304, 30607, 10176, 53577, 31577, 33022, 6626, 32354, 2667, 712, 7, 134598, 8560, 8305, 4989, 29568, 107730, 140992, 77648, 4527, 5646, 14012, 237, ...	[ 0.22509765625, 0.228759765625, 0.048736572265625, 0.1422119140625, 0.23388671875, 0.1463623046875, 0.098876953125, 0.274169921875, 0.13623046875, 0.2352294921875, 0.2044677734375, 0.150390625, 0.056121826171875, 0.154052734375, 0.168701171875, 0.10528564453125, 0.1314697265625, 0.0...	embed
18577735_c0	18577735	haskell	0	Title: Can’t load libgd when trying to use Graphics.GD on OS X Problem title: Can’t load libgd when trying to use Graphics.GD on OS X Tags: ghci, haskell, macos Problem: Can’t load libgd when trying to use Graphics.GD on OS X I’m trying to use Graphics.GD : Prelude> import Graphics.GD Prelude Graphics.GD> x <- loadPngF...	Can’t load libgd when trying to use Graphics.GD on OS X Can’t load libgd when trying to use Graphics.GD on OS X ghci haskell macos Graphics.GD Can Prelude test.png Loading array-0.4.0.1 deepseq-1.3.0.1 bytestring-0.10.0.2 gd-3000.7.3 DLL libgd.dylib Can’t load libgd when trying to use Graphics.GD on OS X I’m trying to ...	[ -0.01434326171875, 0.01104736328125, -0.009521484375, -0.0014495849609375, -0.01519775390625, 0.00433349609375, -0.00933837890625, -0.00665283203125, -0.026123046875, 0.00118255615234375, -0.000431060791015625, -0.047607421875, -0.0037078857421875, -0.00762939453125, 0.0038299560546875, ...	[ 4171, 18, 72367, 25474, 177, 71, 31577, 4527, 189682, 7, 5, 88668, 11787, 1193, 31380, 318, 1556, 142508, 7840, 1914, 822, 112, 3034, 128468, 228006, 10298, 121254, 102014, 53894, 184, 864, 91693, 10179, 133684, 706, 36605, 145515, 23708, 1...	[ 0.097900390625, 0.0799560546875, 0.18212890625, 0.1783447265625, 0.1658935546875, 0.21044921875, 0.059783935546875, 0.05438232421875, 0.20361328125, 0.072265625, 0.004913330078125, 0.267822265625, 0.1339111328125, 0.12744140625, 0.1143798828125, 0.1600341796875, 0.0614013671875, 0....	embed
43941551_c0	43941551	haskell	0	Title: Explicit Purely-Functional Data-Structure For Difference Lists Problem title: Explicit Purely-Functional Data-Structure For Difference Lists Tags: data-structures, haskell, purely-functional, difference-lists Problem: Explicit Purely-Functional Data-Structure For Difference Lists In Haskell, difference lists , i...	Explicit Purely-Functional Data-Structure For Difference Lists Explicit Purely-Functional Data-Structure For Difference Lists data-structures haskell purely-functional difference-lists Explicit Purely-Functional Data-Structure Difference Lists Explicit Purely-Functional Data-Structure For Difference Lists In Haskell, d...	[ 0.01953125, 0.005126953125, -0.0018310546875, 0.0135498046875, 0.006439208984375, 0.025634765625, -0.008544921875, -0.010009765625, -0.00811767578125, -0.027587890625, -0.00147247314453125, -0.0035858154296875, -0.00567626953125, 0.00830078125, 0.003021240234375, 0.0169677734375, 0.0...	[ 60075, 60923, 118233, 538, 97249, 10763, 11809, 71713, 18190, 1326, 803, 18234, 6620, 32036, 2053, 137656, 1556, 142508, 34166, 137175, 60212, 6562, 20625, 5303, 48903, 29479, 32354, 166577, 28670, 136, 242554, 8110, 33636, 209303, 13909, 98323, ...	[ 0.06280517578125, 0.1484375, 0.094482421875, 0.04718017578125, 0.114990234375, 0.0736083984375, 0.0904541015625, 0.134033203125, 0.120849609375, 0.030029296875, 0.055084228515625, 0.1522216796875, 0.0537109375, 0.1793212890625, 0.1092529296875, 0.16845703125, 0.1011962890625, 0.243...	embed
44872846_c0	44872846	haskell	0	Title: Step by step installing Haskell on Windows 7 Problem title: Step by step installing Haskell on Windows 7 Tags: haskell, windows Problem: Step by step installing Haskell on Windows 7 I'm aware of the following posts: Installing Haskell on Windows, cabal config How to modify cabal config file on windows But they h...	Step by step installing Haskell on Windows 7 Step by step installing Haskell on Windows 7 haskell windows Step Haskell Windows Car Show Integer Step by step installing Haskell on Windows 7 I'm aware of the following posts: Installing Haskell on Windows, cabal config How to modify cabal config file on windows But they h...	[ 0.025390625, -0.0025634765625, 0.01483154296875, 0.01318359375, -0.000255584716796875, 0.01251220703125, 0.0057373046875, -0.013916015625, -0.00482177734375, -0.032470703125, -0.017578125, -0.029296875, -0.00897216796875, 0.0022430419921875, -0.0016632080078125, 0.00933837890625, -0....	[ 50478, 390, 29954, 20600, 214, 20625, 142508, 98, 3773, 361, 1556, 54825, 3980, 17367, 44401, 107419, 107951, 109524, 153837, 2811, 40383, 11435, 194663, 765, 297, 170846, 41877, 40658, 3688, 7464, 237875, 678, 51042, 8781, 102158, 272, 57, 2...	[ 0.0887451171875, 0.03485107421875, 0.0985107421875, 0.173095703125, 0.024169921875, 0.1776123046875, 0.280517578125, 0.07476806640625, 0.1513671875, 0.1710205078125, 0.1614990234375, 0.111572265625, 0.1290283203125, 0.152587890625, 0.1287841796875, 0.0219268798828125, 0.1485595703125...	embed
33228010_c0	33228010	haskell	0	Title: haskell bubblesort stops at first step Problem title: haskell bubblesort stops at first step Tags: haskell, sorting Problem: haskell bubblesort stops at first step bubblesort input \| input == sorted = sorted \| otherwise = bubblesort sorted where sorted = sort_once input sort_once::String->String sort_once [] = [...	haskell bubblesort stops at first step haskell bubblesort stops at first step haskell sorting Data.Char sort_once sort_once::String x:y sort_two x:y:xy sort_two::String Char aa:bb bb:aa aa::Int bb::Int string_to_int_arr greater::Int lesser::Int haskell bubblesort stops at first step Why this code sort only once? It sho...	[ -0.00909423828125, 0.015625, 0.01336669921875, 0.004364013671875, -0.0020751953125, 0.01708984375, 0.005615234375, -0.035400390625, -0.004638671875, 0.008544921875, 0.0167236328125, 0.0225830078125, -0.01019287109375, -0.005126953125, 0.00189971923828125, -0.022216796875, 0.009216308...	[ 1556, 142508, 373, 73163, 62351, 7279, 99, 5117, 29954, 12096, 11809, 84068, 191, 329, 71713, 1022, 53, 55547, 50878, 21656, 10, 11, 5125, 79315, 188, 4288, 117396, 18, 199, 2189, 7, 44084, 903, 18151, 4734, 24145, 5608, 738, 195625, 1830...	[ 0.1358642578125, 0.2037353515625, 0.07861328125, 0.182861328125, 0.2373046875, 0.1883544921875, 0.0828857421875, 0.1378173828125, 0.16748046875, 0.227783203125, 0.11474609375, 0.1466064453125, 0.0924072265625, 0.1053466796875, 0.087158203125, 0.000335693359375, 0.080810546875, 0.11...	embed
34398239_c0	34398239	haskell	0	Title: With monads, can join be defined in terms of bind? Problem title: With monads, can join be defined in terms of bind? Tags: haskell, monads Problem: With monads, can join be defined in terms of bind? In Haskell, monads are defined in terms of the functions return and bind, where return has type a -> m a and bind ...	With monads, can join be defined in terms of bind? With monads, can join be defined in terms of bind? haskell monads With monads, can join be defined in terms of bind? In Haskell, monads are defined in terms of the functions return and bind, where return has type a -> m a and bind has type m a -> (a -> m b) -> m b . It...	[ -0.0277099609375, 0.01495361328125, 0.005859375, 0.00701904296875, -0.000598907470703125, 0.01177978515625, -0.00555419921875, -0.01007080078125, 0.01483154296875, -0.031005859375, 0.0011138916015625, -0.019775390625, -0.0162353515625, -0.0238037109375, -0.0024871826171875, 0.025878906...	[ 17106, 2667, 712, 7, 831, 33284, 61924, 71, 69407, 68557, 1556, 142508, 20625, 32354, 30646, 136, 10644, 33079, 347, 10, 876, 39, 16666, 39531, 184, 7722, 4171, 177417, 6528, 16200, 32290, 2980, 137565, 20051, 11, 18403, 34292, 7477, 18770,...	[ 0.030487060546875, 0.12841796875, 0.2047119140625, 0.10540771484375, 0.0411376953125, 0.240234375, 0.1728515625, 0.1522216796875, 0.0980224609375, 0.235595703125, 0.059967041015625, 0.23388671875, 0.0933837890625, 0.13134765625, 0.185302734375, 0.05010986328125, 0.12890625, 0.01174...	embed
36221125_c1	36221125	haskell	1	train.csv" let !a = decode HasHeader csv :: Records(V.Vector(BL.ByteString)) let !res = V.fromList $ Data.Foldable.toList a print $ res V.! 0 Note that I don't give you the program I made based on attoparsec-csv because it is almost exactly the same with Vector instead of List. The memory usage of that solution is stil...	train.csv" let !a = decode HasHeader csv :: Records(V.Vector(BL.ByteString)) let !res = V.fromList $ Data.Foldable.toList a print $ res V.! 0 Note that I don't give you the program I made based on attoparsec-csv because it is almost exactly the same with Vector instead of List. The memory usage of that solution is stil...	[ -0.007476806640625, 0.0025787353515625, -0.0128173828125, 0.022705078125, 0.0201416015625, 0.0133056640625, -0.0115966796875, -0.011962890625, 0.01153564453125, -0.0400390625, -0.0159912109375, -0.027587890625, 0.001434326171875, 0.0218505859375, -0.0263671875, -0.0167236328125, 0.00...	[ 25550, 4439, 334, 2633, 711, 11, 8, 40899, 20625, 13025, 38970, 20763, 89916, 856, 26455, 18770, 38274, 75358, 67, 71713, 2109, 310, 161063, 154663, 11809, 919, 18345, 2886, 188, 28412, 3650, 3332, 757, 8337, 1528, 7228, 35509, 243, 31, 2...	[ 0.294189453125, 0.1119384765625, 0.248046875, 0.047821044921875, 0.0137939453125, 0.0340576171875, 0.1732177734375, 0.1956787109375, 0.161376953125, 0.2044677734375, 0.17041015625, 0.10546875, 0.1685791015625, 0.1561279296875, 0.18408203125, 0.2059326171875, 0.044769287109375, 0.02...	embed
42173776_c0	42173776	haskell	0	Title: How to define multiple patterns in Frege? Problem title: How to define multiple patterns in Frege? Tags: frege, haskell Problem: How to define multiple patterns in Frege? I'm having some trouble defining a function in Frege that uses multiple patterns. Basically, I'm defining a mapping by iterating through a lis...	How to define multiple patterns in Frege? How to define multiple patterns in Frege? frege haskell How Frege morse.fr:3 How to define multiple patterns in Frege? I'm having some trouble defining a function in Frege that uses multiple patterns. Basically, I'm defining a mapping by iterating through a list of tuples. I've...	[ -0.006927490234375, -0.000621795654296875, -0.01483154296875, 0.0186767578125, -0.004791259765625, -0.018310546875, -0.00640869140625, 0.0030364990234375, 0.02587890625, -0.013916015625, 0.0167236328125, -0.0238037109375, 0.01141357421875, 0.00762939453125, 0.0025482177734375, 0.004943...	[ 11249, 61924, 48716, 103510, 7, 23, 21612, 429, 47, 183559, 13, 1556, 142508, 2993, 184, 7079, 363, 63134, 13204, 32354, 4527, 291, 26783, 67, 98767, 5303, 370, 99726, 112892, 1029, 25632, 18499, 27781, 903, 80934, 44691, 20625, 132283, 996...	[ 0.0521240234375, 0.2059326171875, 0.25244140625, 0.251708984375, 0.12158203125, 0.05926513671875, 0.204833984375, 0.2249755859375, 0.000244140625, 0.120361328125, 0.108154296875, 0.04925537109375, 0.1700439453125, 0.105712890625, 0.1287841796875, 0.059600830078125, 0.0477294921875, ...	embed
44218776_c0	44218776	haskell	0	Title: Haskell: class and function overloading: Problem title: Haskell: class and function overloading: Tags: haskell Problem: Haskell: class and function overloading: I am quite new to Haskell. I am trying to overload a custom function 'myadd' for different containers. My understanding is that you have to do it throug...	Haskell: class and function overloading: Haskell: class and function overloading: haskell Haskell Addition Maybe Just test.hs:7:19 Expecting Expected Haskell: class and function overloading: I am quite new to Haskell. I am trying to overload a custom function 'myadd' for different containers. My understanding is that y...	[ -0.01165771484375, 0.005889892578125, 0.01055908203125, 0.00238037109375, -0.01470947265625, 0.0198974609375, -0.0000667572021484375, -0.01104736328125, 0.01458740234375, -0.012451171875, 0.0019989013671875, -0.051025390625, -0.00616455078125, -0.0074462890625, 0.0106201171875, -0.0262...	[ 20625, 142508, 18507, 136, 32354, 645, 63033, 214, 1556, 29117, 14, 83425, 9563, 3034, 127, 7, 966, 23988, 60075, 24762, 13, 32233, 3525, 31577, 114122, 1176, 11, 4028, 100, 12921, 116419, 100094, 765, 8305, 61112, 37842, 25632, 18499 ]	[ 0.12890625, 0.216796875, 0.1695556640625, 0.1026611328125, 0.194580078125, 0.158203125, 0.2158203125, 0.062469482421875, 0.111572265625, 0.0811767578125, 0.05352783203125, 0.1158447265625, 0.0430908203125, 0.202392578125, 0.06549072265625, 0.00115966796875, 0.033050537109375, 0.135...	embed
48752973_c0	48752973	haskell	0	Title: number of leaves is one greater than number of nodes in Haskell Problem title: number of leaves is one greater than number of nodes in Haskell Tags: haskell Problem: number of leaves is one greater than number of nodes in Haskell I have to prove that given a binary tree, the number of leaves is equal to the numb...	number of leaves is one greater than number of nodes in Haskell number of leaves is one greater than number of nodes in Haskell haskell Haskell Tree Leaf Node number of leaves is one greater than number of nodes in Haskell I have to prove that given a binary tree, the number of leaves is equal to the number of nodes pl...	[ 0.0279541015625, 0.00096893310546875, -0.001373291015625, 0.01483154296875, 0.0244140625, 0.00035858154296875, -0.0172119140625, -0.032470703125, 0.01019287109375, -0.037353515625, -0.0206298828125, -0.02001953125, 0.006134033203125, 0.0196533203125, 0.013427734375, -0.0006675720214843...	[ 14012, 31358, 7, 1632, 117396, 3501, 110, 988, 20625, 142508, 83, 23, 1556, 101344, 636, 2407, 438, 112, 111, 23534, 34475, 2394, 6635, 53201, 105950, 1001, 77391, 10644, 61924, 6626, 32354, 136, 30646, 3647, 7225, 757, 29954, 170933, 6023,...	[ 0.1424560546875, 0.263671875, 0.1038818359375, 0.173583984375, 0.1607666015625, 0.08349609375, 0.1495361328125, 0.1387939453125, 0.139404296875, 0.2232666015625, 0.01129150390625, 0.10009765625, 0.1053466796875, 0.1708984375, 0.069580078125, 0.11083984375, 0.1219482421875, 0.018020...	embed
10000074_c0	10000074	haskell	0	Title: Which FRP package to choose? Problem title: Which FRP package to choose? Tags: frp, haskell, reactive-banana Problem: Which FRP package to choose? I'm just starting to look into the world of Functional Reactive Programming in Haskell, and I would like to experiment with GUI programming (with gtk, because of subs...	Which FRP package to choose? Which FRP package to choose? frp haskell reactive-banana Which FRP Which FRP package to choose? I'm just starting to look into the world of Functional Reactive Programming in Haskell, and I would like to experiment with GUI programming (with gtk, because of substantial binding) in a reactio...	[ 0.0059814453125, -0.000027418136596679688, 0.00677490234375, -0.0047607421875, -0.0059814453125, -0.0030364990234375, 0.00726318359375, -0.0008697509765625, 0.0157470703125, 0.0166015625, 0.003814697265625, -0.038818359375, -0.00162506103515625, 0.00909423828125, -0.014404296875, 0.006...	[ 130078, 563, 38796, 98169, 55076, 47, 14119, 254, 1556, 142508, 456, 71232, 105281, 11, 72134, 6713, 8999, 28670, 10763, 853, 27958, 20625, 28007, 195490, 56037, 76228, 706, 31472, 193984, 128239, 132539, 53550, 16487, 6524, 1081, 23129, 217, ...	[ 0.0732421875, 0.10205078125, 0.278076171875, 0.284423828125, 0.11572265625, 0.040283203125, 0.1231689453125, 0.1455078125, 0.131591796875, 0.22265625, 0.1129150390625, 0.20458984375, 0.175537109375, 0.1619873046875, 0.007781982421875, 0.00958251953125, 0.0175933837890625, 0.0479431...	embed
51044581_c1	51044581	haskell	1	.otherwise(pair) .continueWith(highCard) } Result , as it is: Encompasses a type ([Card]) into a broader context (R a) Has an id (result) function that put an object of type a into a minimum "result" context (a -> R a) But... It has not just one generic >>= bind function, but several specific ones, that takes R a -> (...	.otherwise(pair) .continueWith(highCard) } Result , as it is: Encompasses a type ([Card]) into a broader context (R a) Has an id (result) function that put an object of type a into a minimum "result" context (a -> R a) But... It has not just one generic >>= bind function, but several specific ones, that takes R a -> (...	[ -0.013916015625, 0.0125732421875, 0.0130615234375, 0.008544921875, 0.01336669921875, 0.00125885009765625, -0.003265380859375, -0.01513671875, 0.0230712890625, -0.033203125, 0.00555419921875, 0.005584716796875, -0.0115966796875, -0.00006961822509765625, -0.0145263671875, -0.007995605468...	[ 5, 126340, 90825, 109637, 133891, 13, 194583, 84396, 156119, 126684, 237, 83, 277, 13409, 90, 10644, 3934, 134744, 56, 43701, 1052, 10, 20625, 3447, 2109, 7136, 32354, 3884, 36746, 15440, 11, 33079, 627, 1556, 189534, 6396, 1369, 68557, 403...	[ 0.043487548828125, 0.0863037109375, 0.1937255859375, 0.2264404296875, 0.1141357421875, 0.030426025390625, 0.11962890625, 0.117919921875, 0.212646484375, 0.3232421875, 0.028106689453125, 0.052490234375, 0.059906005859375, 0.1099853515625, 0.0254364013671875, 0.170166015625, 0.06347656...	embed
27253281_c1	27253281	haskell	1	44(%r13),%r12 ja _c28m movq 7(%rbx),%rax testq %rax,%rax jne _c28p movl $lvl_r23w_closure+1,%ebx addq $8,%rbp addq $-16,%r12 jmp 0(%rbp) _c28m: movq $16,192(%r13) _c28k: jmp -16(%r13) _c28p: leaq -1(%rax),%rsi movq %rsi,%rdx sarq $1,%rdx movq %rsi,%rcx orq %rdx,%rcx sarq $2,%rcx movq %rdx,%rax orq %rcx,%rax movq %rsi...	44(%r13),%r12 ja _c28m movq 7(%rbx),%rax testq %rax,%rax jne _c28p movl $lvl_r23w_closure+1,%ebx addq $8,%rbp addq $-16,%r12 jmp 0(%rbp) _c28m: movq $16,192(%r13) _c28k: jmp -16(%r13) _c28p: leaq -1(%rax),%rsi movq %rsi,%rdx sarq $1,%rdx movq %rsi,%rcx orq %rdx,%rcx sarq $2,%rcx movq %rdx,%rax orq %rcx,%rax movq %rsi...	[ 0.00506591796875, 0.01092529296875, -0.004058837890625, 0.0150146484375, -0.00335693359375, 0.0279541015625, -0.017822265625, 0.0050048828125, -0.005035400390625, 0.0017852783203125, 0.01190185546875, 0.01446533203125, 0.00933837890625, -0.001251220703125, 0.006134033203125, 0.02307128...	[ 5896, 3949, 63258, 4, 1530, 79, 101, 3882, 39, 6, 30464, 864, 361, 13471, 425, 247, 3034, 52035, 254, 931, 50132, 3650, 3723, 454, 3742, 434, 170224, 21748, 6403, 15190, 1019, 13528, 1647, 2676, 2389, 132, 16, 238, 12, 2485, 2947, 304...	[ 0.31201171875, 0.042144775390625, 0.1583251953125, 0.049560546875, 0.1573486328125, 0.150146484375, 0.0465087890625, 0.173095703125, 0.050140380859375, 0.08984375, 0.205078125, 0.115966796875, 0.1448974609375, 0.0635986328125, 0.1209716796875, 0.005645751953125, 0.2430419921875, 0....	embed
42743230_c0	42743230	haskell	0	Title: Count elements in a list while preserving order Problem title: Count elements in a list while preserving order Tags: list, haskell Problem: Count elements in a list while preserving order I am wondering if there is a way to count the distinct elements in a list and group the counts into tuples, for example [4,4,...	Count elements in a list while preserving order Count elements in a list while preserving order list haskell Data.List Count Count elements in a list while preserving order I am wondering if there is a way to count the distinct elements in a list and group the counts into tuples, for example or would yield while preser...	[ 0.00128173828125, 0.0014190673828125, -0.006866455078125, 0.007232666015625, 0.01177978515625, -0.00897216796875, -0.017822265625, -0.01239013671875, 0.0167236328125, -0.0250244140625, -0.032470703125, -0.0019073486328125, 0.0213623046875, 0.03955078125, -0.01513671875, 0.0072021484375...	[ 108210, 80854, 23, 5303, 12960, 9498, 56, 6496, 12989, 1556, 142508, 11809, 154663, 149016, 3917, 47, 54529, 117781, 21115, 3934, 370, 99726, 11180, 19388, 7311, 24626, 31089, 81887, 37202, 24500, 64549, 1286, 93766, 37317, 4734, 1632, 1733 ]	[ 0.21826171875, 0.2144775390625, 0.05584716796875, 0.1993408203125, 0.1241455078125, 0.0906982421875, 0.101806640625, 0.05963134765625, 0.2059326171875, 0.1041259765625, 0.1922607421875, 0.0654296875, 0.1361083984375, 0.03125, 0.03717041015625, 0.01348876953125, 0.2122802734375, 0.1...	embed
6477541_c0	6477541	haskell	0	Title: User state in Parsec Problem title: User state in Parsec Tags: parsec, state, haskell Problem: User state in Parsec I'm parsing an expression using Parsec and I want to keep track of variables in these expressions using the user state in Parsec. Unfortunately I don't really get how to do it. Given the following ...	User state in Parsec User state in Parsec parsec state haskell Data.Set User Parsec Set many1 Set.empty Left Right ParsecT Set.Set Set.insert User state in Parsec I'm parsing an expression using Parsec and I want to keep track of variables in these expressions using the user state in Parsec. Unfortunately I don't reall...	[ -0.004364013671875, 0.0079345703125, -0.00142669677734375, 0.0194091796875, -0.00299072265625, 0.02734375, -0.0179443359375, -0.001617431640625, 0.0098876953125, -0.0255126953125, -0.004425048828125, 0.02880859375, 0.0169677734375, 0.005218505859375, -0.0022125244140625, 0.007873535156...	[ 53400, 11341, 23, 2392, 39797, 366, 1556, 142508, 11809, 294, 126, 19943, 5941, 418, 33548, 2480, 90911, 618, 73, 33657, 6953, 125195, 17368, 3444, 13695, 28560, 77336, 38937, 185397, 3642, 18151, 70, 75, 10, 2806, 186, 5, 78779, 13, 2835...	[ 0.2138671875, 0.23876953125, 0.05914306640625, 0.170654296875, 0.248046875, 0.1551513671875, 0.092529296875, 0.19677734375, 0.06719970703125, 0.1427001953125, 0.172119140625, 0.2022705078125, 0.1397705078125, 0.004486083984375, 0.0799560546875, 0.0135498046875, 0.0628662109375, 0.1...	embed
29941633_c0	29941633	haskell	0	Title: Haskell State monad with tuples as state Problem title: Haskell State monad with tuples as state Tags: haskell, monads, state Problem: Haskell State monad with tuples as state My apologies if my question is stupid (I'm still quite new to monads), but I couldn't find the answer to it so far. I want to store pairs...	Haskell State monad with tuples as state Haskell State monad with tuples as state haskell monads state Control.Monad.State a Haskell State Prelude MonadState StateT Data.Functor.Identity.Identity Haskell State monad with tuples as state My apologies if my question is stupid (I'm still quite new to monads), but I couldn...	[ -0.02392578125, 0.006591796875, 0.005126953125, 0.0130615234375, 0.000965118408203125, 0.008544921875, -0.00946044921875, -0.0184326171875, -0.00787353515625, -0.0267333984375, 0.0118408203125, 0.0216064453125, -0.0179443359375, 0.01287841796875, -0.0167236328125, -0.00494384765625, ...	[ 20625, 142508, 22836, 2667, 712, 678, 370, 99726, 237, 11341, 1556, 7, 27131, 46674, 135206, 1914, 822, 60331, 71, 618, 11809, 97249, 18770, 37379, 2481, 1747, 18709, 9655, 110833, 32233, 69427, 35166, 3444, 47, 4343, 80836, 23, 33306, 9790...	[ 0.1490478515625, 0.259033203125, 0.212646484375, 0.1365966796875, 0.1983642578125, 0.07452392578125, 0.13916015625, 0.251220703125, 0.1224365234375, 0.2437744140625, 0.1309814453125, 0.036865234375, 0.1856689453125, 0.08282470703125, 0.138427734375, 0.012664794921875, 0.0855712890625...	embed
56693849_c0	56693849	haskell	0	Title: How to write a fixed point function in haskell Problem title: How to write a fixed point function in haskell Tags: fixed-point-iteration, functional-programming, haskell Problem: How to write a fixed point function in haskell I have a function with the following signature: simCon :: [Constraint] -> Maybe [Constr...	How to write a fixed point function in haskell How to write a fixed point function in haskell fixed-point-iteration functional-programming haskell How Constraint Maybe Just How to write a fixed point function in haskell I have a function with the following signature: I would like to write a method which, incase simCon ...	[ 0.00167083740234375, 0.0010223388671875, 0.018310546875, 0.007110595703125, 0.0238037109375, -0.0076904296875, -0.004486083984375, -0.00445556640625, -0.0086669921875, -0.0096435546875, -0.00823974609375, 0.01312255859375, -0.0086669921875, 0.0123291015625, 0.0216064453125, 0.001564025...	[ 11249, 47, 33022, 10, 188347, 6275, 32354, 23, 1556, 142508, 38496, 16840, 123309, 28966, 1657, 2816, 4288, 83425, 9563, 25632, 138256, 1884, 55300, 58437, 10777, 11935, 30646, 3444, 61590, 4420, 3934, 456, 16428, 13695, 24189, 107730, 5701, ...	[ 0.0943603515625, 0.047454833984375, 0.2052001953125, 0.03375244140625, 0.25244140625, 0.1920166015625, 0.208984375, 0.07330322265625, 0.151611328125, 0.23388671875, 0.1248779296875, 0.1273193359375, 0.12841796875, 0.08056640625, 0.08001708984375, 0.196044921875, 0.0892333984375, 0....	embed
24661157_c0	24661157	haskell	0	Title: Type is inferred differently in a lexical binding in GHCi Problem title: Type is inferred differently in a lexical binding in GHCi Tags: haskell, type-inference, ghci Problem: Type is inferred differently in a lexical binding in GHCi Greeting, I am a little surprised that I get two different type in GHCi with th...	Type is inferred differently in a lexical binding in GHCi Type is inferred differently in a lexical binding in GHCi haskell type-inference ghci Type GHCi Show Tree Type is inferred differently in a lexical binding in GHCi Greeting, I am a little surprised that I get two different type in GHCi with the same expression w...	[ -0.00701904296875, 0.001068115234375, -0.0079345703125, 0.01007080078125, 0.0091552734375, 0.015869140625, -0.00836181640625, -0.003173828125, 0.00848388671875, -0.0032196044921875, -0.0013885498046875, -0.0244140625, -0.0023040771484375, 0.0081787109375, 0.019287109375, 0.008422851562...	[ 60457, 83, 53498, 2822, 12921, 538, 75675, 21533, 128239, 527, 73265, 14, 23, 1556, 142508, 10644, 69988, 31380, 318, 17367, 101344, 10255, 13, 1916, 144285, 6626, 5701, 125195, 68557, 61924, 32354, 28412, 38937, 101786, 9384, 79442, 62731, 1...	[ 0.285888671875, 0.0151214599609375, 0.2164306640625, 0.1378173828125, 0.1895751953125, 0.0751953125, 0.106201171875, 0.122314453125, 0.1973876953125, 0.0775146484375, 0.126220703125, 0.191162109375, 0.0203399658203125, 0.084716796875, 0.1973876953125, 0.2210693359375, 0.111083984375,...	embed
38224436_c0	38224436	haskell	0	Title: How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? Problem title: How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? Tags: haskell, parsec, parsing Problem: How can I parse non-contiguous elements of a permutation phrase using Parsec's...	How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? haskell parsec parsing Parsec How Perm How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? Haskell's Parsec...	[ -0.01434326171875, 0.0115966796875, -0.002044677734375, 0.0262451171875, -0.01165771484375, 0.03466796875, -0.00193023681640625, -0.035888671875, -0.000759124755859375, -0.018798828125, -0.002593994140625, 0.0235595703125, 0.0289306640625, 0.00653076171875, -0.029296875, 0.017822265625...	[ 11249, 831, 366, 184, 351, 2271, 118, 1234, 80854, 117, 561, 22062, 113860, 2392, 39797, 3768, 908, 39, 1556, 142508, 6953, 17368, 20625, 8060, 1829, 88996, 209806, 67, 67842, 14311, 21094, 2055, 238, 76596, 65037, 275, 83151, 5281, 27781, ...	[ 0.046234130859375, 0.03369140625, 0.179931640625, 0.117919921875, 0.142578125, 0.0369873046875, 0.119384765625, 0.1265869140625, 0.1658935546875, 0.1004638671875, 0.1710205078125, 0.040435791015625, 0.1993408203125, 0.123779296875, 0.2200927734375, 0.02752685546875, 0.1881103515625, ...	embed
20158392_c1	20158392	haskell	1	terms of function composition instead of reverse function composition. That is: (:.) = flip $ (.) (.) (.) -- instead of (:.) = (>>>) (>>>) (>>>) Of course (>>>) (>>>) (>>>) is of the wrong type. It's not the function that I am looking for. The beauty of function composition is that it can be composed with itself to fo...	terms of function composition instead of reverse function composition. That is: (:.) = flip $ (.) (.) (.) -- instead of (:.) = (>>>) (>>>) (>>>) Of course (>>>) (>>>) (>>>) is of the wrong type. It's not the function that I am looking for. The beauty of function composition is that it can be composed with itself to fo...	[ -0.006103515625, 0.022705078125, 0.012451171875, 0.006195068359375, -0.0201416015625, -0.00933837890625, 0.0225830078125, -0.00225830078125, 0.0284423828125, 0.00909423828125, -0.007171630859375, 0.0228271484375, 0.0035247802734375, -0.0074462890625, 0.00653076171875, -0.0159912109375,...	[ 69407, 111, 32354, 166577, 64457, 39531, 184, 12, 5, 2203, 147505, 3650, 130910, 44691, 10644, 959, 16487, 100, 62607, 831, 150350, 678, 68034, 3173, 84396, 56, 12989, 106804, 102971, 138256, 100270, 4420, 19364, 442, 20653, 40225, 73342, 154...	[ 0.1773681640625, 0.041259765625, 0.2198486328125, 0.28466796875, 0.166748046875, 0.224853515625, 0.162841796875, 0.084228515625, 0.06146240234375, 0.032928466796875, 0.2215576171875, 0.138671875, 0.1280517578125, 0.1051025390625, 0.16455078125, 0.0194854736328125, 0.0567626953125, ...	embed
73903292_c1	73903292	haskell	1	halt with infinity , but it doesn't. It halts, but with the wrong answer, and I don't know why. ghci> take 14 [1, 9 .. 100] [1,9,17,25,33,41,49,57,65,73,81,89,97] ghci> take 14 [1, 9 .. infinity] [9,17,25,33,41,49,57,65,73,81,89,97,105,113] ghci> [100, 9 .. 0] [100,9] ghci> [infinity, 9 .. 0] [9] ghci> [6, 100 .. 7] [...	halt with infinity , but it doesn't. It halts, but with the wrong answer, and I don't know why. ghci> take 14 [1, 9 .. 100] [1,9,17,25,33,41,49,57,65,73,81,89,97] ghci> take 14 [1, 9 .. infinity] [9,17,25,33,41,49,57,65,73,81,89,97,105,113] ghci> [100, 9 .. 0] [100,9] ghci> [infinity, 9 .. 0] [9] ghci> [6, 100 .. 7] [...	[ -0.00335693359375, -0.0037841796875, -0.00250244140625, -0.0157470703125, -0.01025390625, 0.018798828125, 0.00323486328125, 0.00958251953125, 0.0089111328125, -0.0263671875, 0.008056640625, -0.003143310546875, 0.01806640625, 0.01422119140625, 0.0224609375, 0.00604248046875, 0.0112915...	[ 58810, 678, 54241, 53, 1284, 442, 22027, 18, 1650, 7, 44691, 35166, 2301, 3714, 15400, 31380, 318, 5646, 616, 68252, 483, 1468, 805, 198889, 2489, 2588, 82449, 163324, 93754, 135461, 13556, 18949, 14773, 2740, 1126, 168628, 46659, 116597, 3...	[ 0.266845703125, 0.1278076171875, 0.2113037109375, 0.12353515625, 0.093994140625, 0.0587158203125, 0.1348876953125, 0.1302490234375, 0.0289459228515625, 0.095947265625, 0.185302734375, 0.1976318359375, 0.042388916015625, 0.07537841796875, 0.10400390625, 0.107421875, 0.1510009765625, ...	embed
77474598_c0	77474598	haskell	0	Title: State Monad - HASKELL Problem title: State Monad - HASKELL Tags: haskell, state-monad, monad-transformers Problem: State Monad - HASKELL instance Monad ST where --return :: a -> ST a return x = S (\s -> (x,s)) --(>>=) :: ST a -> (a -> ST b) -> ST b st >>= f = S (\s -> let (x, s') = app st s in app (f x) s') type...	State Monad - HASKELL State Monad - HASKELL haskell state-monad monad-transformers State Monad HASKELL Tree Leaf Node Show State Monad - HASKELL Hi, so this my code and I want to ensure that my understanding of the expansion of the mlabel function is correct. And I am not using any additional imports.	[ -0.01324462890625, 0.0054931640625, -0.000058650970458984375, 0.00604248046875, 0.016845703125, 0.005859375, 0.002716064453125, -0.01422119140625, 0.01324462890625, -0.031005859375, 0.01361083984375, -0.0189208984375, -0.006103515625, 0.0016937255859375, 0.011962890625, -0.008972167968...	[ 22836, 60331, 71, 11666, 10762, 56051, 1556, 142508, 11341, 3796, 712, 2667, 215175, 101344, 636, 2407, 438, 112, 17367, 2673, 903, 18151, 3444, 47, 63284, 100094, 14700, 66, 6889, 347, 152526, 32354, 83, 26785, 959, 17368, 78301, 24927 ]	[ 0.1683349609375, 0.181640625, 0.09869384765625, 0.0947265625, 0.09820556640625, 0.1661376953125, 0.103759765625, 0.1845703125, 0.12890625, 0.09423828125, 0.0836181640625, 0.094970703125, 0.165771484375, 0.1141357421875, 0.0289154052734375, 0.10107421875, 0.130615234375, 0.047576904...	embed
8692156_c0	8692156	haskell	0	Title: Sort by constructor ignoring (part of) value Problem title: Sort by constructor ignoring (part of) value Tags: haskell Problem: Sort by constructor ignoring (part of) value Suppose I have data Foo = A String Int \| B Int I want to take an xs :: [Foo] and sort it such that all the A s are at the beginning, sorted ...	Sort by constructor ignoring (part of) value Sort by constructor ignoring (part of) value haskell Sort Foo Sort by constructor ignoring (part of) value Suppose I have I want to take an xs :: [Foo] and sort it such that all the A s are at the beginning, sorted by their strings, but with the ints in the order they appear...	[ 0.01495361328125, -0.0045166015625, -0.017333984375, 0.0023956298828125, 0.00064849853515625, -0.005706787109375, -0.0115966796875, 0.0004558563232421875, 0.0142822265625, -0.00421142578125, -0.006378173828125, 0.0205078125, 0.01141357421875, 0.01263427734375, -0.0255126953125, -0.0274...	[ 53666, 390, 64549, 748, 47438, 17365, 34292, 1556, 142508, 9572, 31, 3444, 5646, 1022, 7, 1984, 27591, 12096, 6044, 756, 62, 91, 86595, 17497, 79315, 23, 933, 12989, 118775, 5303, 335, 3564, 5701, 28282, 3525, 6615, 5117, 13204, 32354, 35...	[ 0.1981201171875, 0.1448974609375, 0.20361328125, 0.124267578125, 0.153564453125, 0.0863037109375, 0.1729736328125, 0.1060791015625, 0.2099609375, 0.16796875, 0.0950927734375, 0.04168701171875, 0.030731201171875, 0.054107666015625, 0.0282135009765625, 0.054779052734375, 0.1015625, 0...	embed
58015610_c0	58015610	haskell	0	Title: Value constructors in haskell Problem title: Value constructors in haskell Tags: haskell, nlp-question-answering, function, value-constructor, list Problem: Value constructors in haskell I have a question about Haskell. I'm new so I don't understand too well, but if anyone could help me I'd really appreciate. I ...	Value constructors in haskell Value constructors in haskell haskell nlp-question-answering function value-constructor list Value Question Yes Show Value constructors in haskell I have a question about Haskell. I'm new so I don't understand too well, but if anyone could help me I'd really appreciate. I have this exercis...	[ 0.00787353515625, 0.0115966796875, 0.007568359375, 0.017822265625, -0.000942230224609375, 0.0174560546875, 0.0036773681640625, 0.0030059814453125, 0.01251220703125, -0.00616455078125, 0.003387451171875, -0.01416015625, -0.0013427734375, -0.004150390625, -0.01202392578125, -0.0079345703...	[ 190060, 64549, 25251, 23, 1556, 142508, 653, 26775, 7162, 1363, 10133, 144784, 32354, 34292, 2271, 36716, 748, 5303, 68185, 32635, 17367, 9655, 20625, 3525, 28219, 4358, 77947, 81979, 1295, 12877, 123997, 195136, 53299, 171859, 30646, 757, 100,...	[ 0.253662109375, 0.2469482421875, 0.1640625, 0.055511474609375, 0.1466064453125, 0.2139892578125, 0.01995849609375, 0.1844482421875, 0.0980224609375, 0.0911865234375, 0.0830078125, 0.134033203125, 0.1763916015625, 0.230224609375, 0.09814453125, 0.2047119140625, 0.087646484375, 0.180...	embed
34958735_c0	34958735	haskell	0	Title: Functional Programming Idiom to compute maximum of 4 numbers without mutation in racket/haskell Problem title: Functional Programming Idiom to compute maximum of 4 numbers without mutation in racket/haskell Tags: scheme, algorithm, functional-programming, haskell, racket Problem: Functional Programming Idiom to ...	Functional Programming Idiom to compute maximum of 4 numbers without mutation in racket/haskell Functional Programming Idiom to compute maximum of 4 numbers without mutation in racket/haskell scheme algorithm functional-programming haskell racket Functional Programming Idiom count1 char1 count2 char2 Functional Program...	[ -0.00775146484375, -0.0037841796875, 0.01507568359375, 0.0291748046875, 0.00408935546875, 0.00323486328125, -0.0230712890625, -0.004669189453125, -0.000972747802734375, -0.0274658203125, -0.01226806640625, -0.0228271484375, -0.0027313232421875, -0.0016326904296875, 0.007568359375, -0.0...	[ 28670, 10763, 27958, 87, 428, 306, 9969, 6743, 38132, 201, 101935, 15490, 199334, 673, 27853, 10557, 142508, 150370, 234873, 123309, 28966, 1556, 54529, 418, 21441, 304, 47, 23, 765, 14012, 74918, 22759, 124850, 79315, 77336, 876, 501, 104, ...	[ 0.11181640625, 0.09075927734375, 0.1280517578125, 0.050201416015625, 0.15478515625, 0.158203125, 0.1114501953125, 0.07568359375, 0.2061767578125, 0.20654296875, 0.1939697265625, 0.1190185546875, 0.156005859375, 0.064453125, 0.138916015625, 0.08758544921875, 0.20361328125, 0.0997314...	embed
36199659_c0	36199659	haskell	0	Title: Haskell - Use of Take and Drop to split a list into three parts Problem title: Haskell - Use of Take and Drop to split a list into three parts Tags: function-definition, take, haskell, list Problem: Haskell - Use of Take and Drop to split a list into three parts So I've came across this function definition that ...	Haskell - Use of Take and Drop to split a list into three parts Haskell - Use of Take and Drop to split a list into three parts function-definition take haskell list Haskell Use Take Drop SPLITS LIST INTO THREE PARTS split3 Haskell - Use of Take and Drop to split a list into three parts So I've came across this functio...	[ 0.007537841796875, 0.0184326171875, -0.00128936767578125, -0.0093994140625, -0.0240478515625, 0.0125732421875, 0.019287109375, -0.00592041015625, 0.0238037109375, 0.000835418701171875, -0.010009765625, -0.015869140625, 0.010986328125, 0.0010833740234375, -0.0064697265625, 0.02160644531...	[ 20625, 142508, 36836, 46673, 136, 130403, 65450, 5303, 3934, 17262, 63920, 20, 47, 32354, 49919, 5646, 1556, 12047, 107287, 195977, 213354, 12232, 148776, 28358, 363, 36880, 903, 80934, 51776, 10, 425, 7, 237, 140992, 13580, 19441, 34844, 100...	[ 0.116455078125, 0.2445068359375, 0.094482421875, 0.21142578125, 0.15234375, 0.2374267578125, 0.2213134765625, 0.2200927734375, 0.12890625, 0.193359375, 0.2054443359375, 0.003387451171875, 0.00714111328125, 0.1883544921875, 0.122314453125, 0.203857421875, 0.114501953125, 0.068054199...	embed
29039251_c0	29039251	haskell	0	Title: What does "No instance for (Comparable Integer)" mean? Problem title: What does "No instance for (Comparable Integer)" mean? Tags: haskell, typeclass Problem: What does "No instance for (Comparable Integer)" mean? data Set a = Set [a] i1 = Set [1, 2, 3] i2 = Set [3, 2, 1] member xs x = elem x...	What does "No instance for (Comparable Integer)" mean? What does "No instance for (Comparable Integer)" mean? haskell typeclass a What Comparable Integer Set What does "No instance for (Comparable Integer)" mean? When executing: cmp i1 i2 I get the following error: I'd like to know what it means? Th...	[ 0.00213623046875, 0.00927734375, 0.01470947265625, 0.01129150390625, -0.0052490234375, 0.02099609375, 0.0126953125, -0.0037841796875, 0.00946044921875, 0.00360107421875, -0.02197265625, 0.01239013671875, 0.017822265625, -0.009033203125, -0.0167236328125, -0.0206298828125, 0.000690460...	[ 4865, 14602, 5021, 110527, 100, 108161, 147, 2886, 44401, 29459, 1556, 142508, 10644, 67413, 113307, 19943, 71924, 1827, 254, 17, 418, 304, 25632, 18499, 1884, 3714, 2367, 442, 26950 ]	[ 0.0367431640625, 0.0309600830078125, 0.1468505859375, 0.25390625, 0.1187744140625, 0.1005859375, 0.1346435546875, 0.1224365234375, 0.16064453125, 0.1121826171875, 0.08062744140625, 0.18896484375, 0.063232421875, 0.099609375, 0.1680908203125, 0.133056640625, 0.074462890625, 0.104736...	embed
18894440_c0	18894440	haskell	0	Title: Why can't I substitute a value with a variable of the same value in Haskell port numbers? Problem title: Why can't I substitute a value with a variable of the same value in Haskell port numbers? Tags: ghci, haskell Problem: Why can't I substitute a value with a variable of the same value in Haskell por...	Why can't I substitute a value with a variable of the same value in Haskell port numbers? Why can't I substitute a value with a variable of the same value in Haskell port numbers? ghci haskell Network Why Haskell Prelude PortNumber Couldn Integer Word16 Why can't I substitute a value with a variable of the sa...	[ -0.0299072265625, -0.00775146484375, 0.0021209716796875, 0.01043701171875, -0.0009002685546875, -0.0047607421875, -0.03564453125, -0.00048828125, 0.017578125, 0.004058837890625, -0.005401611328125, -0.00019073486328125, 0.01190185546875, 0.000370025634765625, -0.01104736328125, -0.0128...	[ 44084, 831, 3768, 18, 161740, 13, 34292, 678, 77336, 5701, 20625, 142508, 11469, 101935, 318, 1556, 28997, 1914, 822, 112, 13791, 18444, 26278, 191147, 44401, 22543, 2485, 41877, 17304, 56002, 22027, 903, 4488, 4343, 16454, 38937, 107730, 110...	[ 0.0804443359375, 0.0909423828125, 0.00048828125, 0.061920166015625, 0.2142333984375, 0.05133056640625, 0.173095703125, 0.1002197265625, 0.2386474609375, 0.1126708984375, 0.1007080078125, 0.2093505859375, 0.1378173828125, 0.1407470703125, 0.05072021484375, 0.047210693359375, 0.0222778...	embed
75297085_c0	75297085	haskell	0	Title: Where to add a flag in the package.yaml? Problem title: Where to add a flag in the package.yaml? Tags: haskell, haskell-stack Problem: Where to add a flag in the package.yaml? I have a package.yaml file like: name: ... version: ... ... flags: strict: ... description: ... ... dependencies: ... ... Mostly typical ...	Where to add a flag in the package.yaml? Where to add a flag in the package.yaml? haskell haskell-stack Where package.yaml Where to add a flag in the package.yaml? I have a package.yaml file like: Mostly typical package.yaml file. And one of the dependencies uses a library (so it's a transitive dependency) which has fl...	[ 0.0093994140625, -0.002166748046875, 0.02099609375, -0.0164794921875, -0.00124359130859375, -0.007415771484375, -0.0252685546875, -0.0027923583984375, -0.0101318359375, 0.0206298828125, 0.0133056640625, -0.037841796875, -0.00238037109375, 0.009033203125, -0.0106201171875, 0.00723266601...	[ 78662, 47, 15190, 10, 49938, 23, 98169, 14520, 141, 1556, 142508, 590, 2594, 5, 11435, 17006, 222201, 42548, 117538, 4527, 35773, 62621, 5844, 27771, 8517, 153837, 15504, 98, 903, 527, 73265, 35829, 40059, 959, 4488, 98352, 130250, 140992, ...	[ 0.1317138671875, 0.045562744140625, 0.166259765625, 0.103759765625, 0.285888671875, 0.0596923828125, 0.2193603515625, 0.2171630859375, 0.20703125, 0.0902099609375, 0.1954345703125, 0.07293701171875, 0.09246826171875, 0.006103515625, 0.09393310546875, 0.009063720703125, 0.079956054687...	embed
49610110_c0	49610110	haskell	0	Title: It it possible to store stack's custom snaphot in a private github repository? Problem title: It it possible to store stack's custom snaphot in a private github repository? Tags: github, haskell, haskell-stack Problem: It it possible to store stack's custom snaphot in a private github repository? Curre...	It it possible to store stack's custom snaphot in a private github repository? It it possible to store stack's custom snaphot in a private github repository? github haskell haskell-stack raw.githubusercontent.com snapshot.yaml AJ_tHmg3nl_bW6LdG9DSgzIIKs0zqKICks2by0i4wA It it possible to store stack's custom s...	[ -0.000164031982421875, 0.024169921875, -0.0029449462890625, -0.01513671875, -0.0225830078125, -0.004791259765625, 0.003997802734375, 0.0169677734375, -0.00128936767578125, -0.011474609375, -0.01507568359375, -0.0206298828125, -0.0247802734375, -0.00286865234375, -0.004150390625, 0.0050...	[ 1650, 7722, 4343, 177261, 3768, 114122, 76685, 21620, 23, 14375, 62270, 32102, 64722, 31667, 14, 1556, 142508, 590, 2594, 49649, 15769, 69246, 72697, 14520, 4527, 9932, 127, 275, 1566, 3835, 93392, 24145, 3249, 24209, 78301, 47, 1098, 18, 1...	[ 0.0203094482421875, 0.1365966796875, 0.1741943359375, 0.211181640625, 0.06109619140625, 0.201171875, 0.1837158203125, 0.23486328125, 0.06060791015625, 0.203857421875, 0.1270751953125, 0.1951904296875, 0.100341796875, 0.0736083984375, 0.0299072265625, 0.0980224609375, 0.183349609375, ...	embed
8877541_c0	8877541	haskell	0	Title: How to write an instance for all types in another type class? Problem title: How to write an instance for all types in another type class? Tags: haskell Problem: How to write an instance for all types in another type class? I have to define a type class Truthy which contains a method true converting an instance ...	How to write an instance for all types in another type class? How to write an instance for all types in another type class? haskell How Truthy Bool Num How to write an instance for all types in another type class? I have to define a type class Truthy which contains a method true converting an instance of the type class...	[ -0.0108642578125, 0.0130615234375, 0.01239013671875, 0.00213623046875, -0.0003204345703125, 0.003753662109375, 0.0020294189453125, -0.0101318359375, 0.01470947265625, 0.0189208984375, -0.033447265625, -0.0218505859375, -0.0008392333984375, 0.0030517578125, -0.0177001953125, 0.009765625...	[ 11249, 47, 33022, 142, 110527, 100, 756, 52895, 23, 15700, 10644, 18507, 1556, 142508, 184431, 53, 2460, 929, 52782, 61924, 70541, 55300, 29568, 96760, 34292, 21635, 67842, 5303, 54744, 360, 18, 91, 3917, 54, 24145, 154107, 2816, 4288, 959,...	[ 0.1029052734375, 0.03704833984375, 0.187744140625, 0.03375244140625, 0.29296875, 0.13134765625, 0.1385498046875, 0.2498779296875, 0.06951904296875, 0.1181640625, 0.20947265625, 0.202880859375, 0.1055908203125, 0.199951171875, 0.1585693359375, 0.1348876953125, 0.086181640625, 0.1934...	embed
3668686_c0	3668686	haskell	0	Title: Get the middle of an Ix range in O(1) time in Haskell Problem title: Get the middle of an Ix range in O(1) time in Haskell Tags: time-complexity, arrays, functional-programming, haskell, complexity-theory Problem: Get the middle of an Ix range in O(1) time in Haskell I was playing around with this code kata in H...	Get the middle of an Ix range in O(1) time in Haskell Get the middle of an Ix range in O(1) time in Haskell time-complexity arrays functional-programming haskell complexity-theory Get Haskell Get the middle of an Ix range in O(1) time in Haskell I was playing around with this code kata in Haskell, and I came across the...	[ -0.015380859375, 0.000362396240234375, 0.0289306640625, -0.003631591796875, 0.003082275390625, 0.01043701171875, -0.00994873046875, -0.0157470703125, 0.01287841796875, -0.0255126953125, -0.00140380859375, 0.0198974609375, -0.00823974609375, 0.00168609619140625, -0.005279541015625, -0.0...	[ 20779, 70, 86991, 111, 87, 425, 37457, 180, 27750, 1733, 20625, 142508, 23, 44974, 10298, 123309, 28966, 1556, 27140, 75169, 10932, 18151, 3441, 1927, 686, 289, 7413, 4122, 38496, 63262, 11001, 54744, 34292, 110527, 10644, 67413, 370, 8705, ...	[ 0.1016845703125, 0.047607421875, 0.26025390625, 0.1246337890625, 0.11474609375, 0.181640625, 0.22900390625, 0.171142578125, 0.1312255859375, 0.172607421875, 0.14208984375, 0.25634765625, 0.0299835205078125, 0.05487060546875, 0.1690673828125, 0.0712890625, 0.0157470703125, 0.0577697...	embed
16824706_c0	16824706	haskell	0	Title: Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? Problem title: Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? Tags: haskell, monoids Problem: Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? I'm writing a function pad that tak...	Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? haskell monoids Haskell Monoid Sum Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? I'm writing a function pad that takes a list and pads ...	[ -0.01019287109375, -0.006683349609375, 0.016357421875, 0.03564453125, -0.0068359375, 0.03125, -0.01806640625, -0.0137939453125, 0.00946044921875, -0.00119781494140625, -0.01129150390625, -0.014404296875, 0.006072998046875, 0.00286865234375, 0.007568359375, -0.02587890625, 0.004791259...	[ 20625, 142508, 137565, 10366, 136, 51, 5429, 11, 26783, 3525, 50986, 21777, 99156, 3917, 1556, 22460, 30185, 77879, 532, 36335, 83, 2685, 32562, 32354, 7922, 51776, 5303, 24189, 24233, 13267, 37842, 116, 208124, 5117, 37202, 62775, 127689, 15...	[ 0.1339111328125, 0.27978515625, 0.1810302734375, 0.096923828125, 0.058135986328125, 0.1043701171875, 0.1134033203125, 0.094970703125, 0.067138671875, 0.111328125, 0.2469482421875, 0.1685791015625, 0.1768798828125, 0.08111572265625, 0.100341796875, 0.1256103515625, 0.1346435546875, ...	embed
23770200_c0	23770200	haskell	0	Title: Pattern matching against a type with only one constructor Problem title: Pattern matching against a type with only one constructor Tags: haskell, types, pattern-matching, constructor, lazy-evaluation Problem: Pattern matching against a type with only one constructor If I pattern-match against an expression whose...	Pattern matching against a type with only one constructor Pattern matching against a type with only one constructor haskell types pattern-matching constructor lazy-evaluation Pattern Prelude Test Fail Pattern matching against a type with only one constructor If I pattern-match against an expression whose type has only ...	[ -0.005279541015625, 0.00933837890625, -0.007293701171875, 0.00897216796875, 0.00726318359375, 0.001617431640625, -0.007232666015625, 0.00054168701171875, 0.01080322265625, -0.030517578125, 0.003997802734375, -0.007232666015625, 0.003875732421875, -0.01092529296875, -0.000957489013671875,...	[ 9876, 22766, 14858, 214, 26548, 10644, 4734, 1632, 64549, 1556, 142508, 52895, 103510, 98753, 748, 21, 3285, 159258, 822, 8647, 190355, 125195, 7464, 37772, 11675, 6032, 151575, 601, 841, 73493, 28007, 442, 22027, 18, 2806, 765, 84751, 18499,...	[ 0.15673828125, 0.1466064453125, 0.216552734375, 0.0143890380859375, 0.174560546875, 0.15234375, 0.0859375, 0.1243896484375, 0.1270751953125, 0.082275390625, 0.2039794921875, 0.1119384765625, 0.217041015625, 0.2421875, 0.1046142578125, 0.0062255859375, 0.08612060546875, 0.0992431640...	embed
8582444_c0	8582444	haskell	0	Title: Could Not Match Expected Type Integer with actual type float Problem title: Could Not Match Expected Type Integer with actual type float Tags: haskell Problem: Could Not Match Expected Type Integer with actual type float countSequences :: Int -> Int -> Integer countSequences 0 m = 0 countSequences m 0 = 0 countS...	Could Not Match Expected Type Integer with actual type float Could Not Match Expected Type Integer with actual type float haskell Could Not Match Expected Type Integer n-1 Float x-1 Could Not Match Expected Type Integer with actual type float i cant really understand why this error keep coming up .. the truncate is sup...	[ 0.00811767578125, 0.00872802734375, -0.02197265625, -0.00946044921875, 0.013916015625, -0.0155029296875, -0.0101318359375, -0.0024871826171875, 0.00665283203125, -0.001800537109375, -0.01806640625, -0.020263671875, 0.0189208984375, -0.002410888671875, 0.021484375, 0.00775146484375, 0...	[ 191147, 11205, 67407, 60075, 13, 89829, 60457, 44401, 678, 8561, 10644, 21917, 257, 1556, 142508, 653, 5759, 38699, 1022, 45767, 6183, 28219, 15400, 903, 18499, 13695, 1257, 14617, 19, 33478, 134598, 96760, 70, 1295, 47, 221 ]	[ 0.094482421875, 0.149658203125, 0.2025146484375, 0.121826171875, 0.1304931640625, 0.0662841796875, 0.1932373046875, 0.1986083984375, 0.1055908203125, 0.127197265625, 0.182861328125, 0.17724609375, 0.09857177734375, 0.1510009765625, 0.2216796875, 0.0277099609375, 0.156005859375, 0.1...	embed
9616515_c0	9616515	haskell	0	Title: Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? Problem title: Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? Tags: concurrency, atomic, haskell Problem: Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? I ...	Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? concurrency atomic haskell Control.Concurrent.Chan Chan MVar Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? I need ...	[ -0.00738525390625, 0.0111083984375, 0.01171875, 0.024169921875, -0.013916015625, 0.001678466796875, 0.002044677734375, -0.0250244140625, -0.01129150390625, -0.0169677734375, -0.0111083984375, 0.003204345703125, 0.006988525390625, 0.0220947265625, -0.00360107421875, 0.0019683837890625, ...	[ 15901, 1556, 142508, 86723, 7, 175904, 11935, 163812, 127008, 46002, 100, 48716, 120709, 102446, 1314, 108636, 982, 34627, 27131, 30448, 66160, 147, 25842, 133244, 5426, 1632, 99764, 17721, 86997, 4734, 107222, 5941, 108558, 209806, 1631, 14012, ...	[ 0.0294342041015625, 0.1341552734375, 0.2381591796875, 0.2222900390625, 0.045867919921875, 0.197021484375, 0.0477294921875, 0.2064208984375, 0.21435546875, 0.2027587890625, 0.04241943359375, 0.212646484375, 0.240478515625, 0.1788330078125, 0.05126953125, 0.1328125, 0.06781005859375, ...	embed
3107432_c0	3107432	haskell	0	Title: Using Haskell to extend Perl? Problem title: Using Haskell to extend Perl? Tags: haskell, perl, ffi Problem: Using Haskell to extend Perl? Has anyone ever written a Haskell extension to Perl? Maybe something simple, like a function that calculates the fib. sequence? I'm interested in using Haskell, and I see som...	Using Haskell to extend Perl? Using Haskell to extend Perl? haskell perl ffi Using Haskell Perl Using Haskell to extend Perl? Has anyone ever written a Haskell extension to Perl? Maybe something simple, like a function that calculates the fib. sequence? I'm interested in using Haskell, and I see some overlap between th...	[ 0.0196533203125, 0.024169921875, 0.0216064453125, -0.01043701171875, -0.004241943359375, -0.00701904296875, -0.017578125, -0.0084228515625, -0.0026702880859375, -0.0634765625, 0.006378173828125, -0.01141357421875, 0.027099609375, 0.004638671875, -0.0150146484375, -0.007476806640625, ...	[ 345, 6953, 20625, 142508, 47, 65042, 908, 141, 32, 1556, 117, 24500, 35672, 17669, 59121, 111938, 83425, 8781, 32354, 74481, 809, 275, 5, 40, 944, 3956, 60892, 17368, 645, 6324, 17721, 136, 26908, 6275, 77635, 21185, 8966, 111240, 4527, 1...	[ 0.1290283203125, 0.08123779296875, 0.1595458984375, 0.2548828125, 0.1002197265625, 0.197021484375, 0.201904296875, 0.197998046875, 0.026153564453125, 0.1317138671875, 0.15625, 0.1553955078125, 0.0177001953125, 0.04949951171875, 0.0736083984375, 0.2071533203125, 0.00909423828125, 0....	embed
35878282_c0	35878282	haskell	0	Title: Haskell get types of Data Constructor Problem title: Haskell get types of Data Constructor Tags: introspection, haskell Problem: Haskell get types of Data Constructor I was wondering if given a constructor, such as: data UserType = User { username :: String , password :: String } -- deriving whatever necessary W...	Haskell get types of Data Constructor Haskell get types of Data Constructor introspection haskell Haskell Data Constructor UserType User Typeable Haskell get types of Data Constructor I was wondering if given a constructor, such as: What the easiest way is for me to get something on the lines of [("username", String), ...	[ 0.0269775390625, -0.00543212890625, -0.01287841796875, 0.037353515625, -0.00872802734375, 0.013427734375, -0.002471923828125, 0.002838134765625, 0.0037689208984375, -0.06591796875, -0.0010223388671875, -0.029052734375, 0.00170135498046875, -0.0022430419921875, -0.011962890625, 0.001007...	[ 20625, 142508, 2046, 52895, 111, 11809, 82084, 18770, 64627, 16711, 1556, 53400, 196707, 60457, 2886, 149016, 34475, 64549, 748, 28, 1544, 525, 3917, 47, 9844, 124519, 65918, 11627, 830, 23351, 13409, 47416, 16610, 1660, 23009, 32562, 442, 27...	[ 0.128662109375, 0.1995849609375, 0.1463623046875, 0.257080078125, 0.055511474609375, 0.1370849609375, 0.1925048828125, 0.1695556640625, 0.042144775390625, 0.056854248046875, 0.1021728515625, 0.1544189453125, 0.2318115234375, 0.2056884765625, 0.177490234375, 0.0465087890625, 0.0383605...	embed
42240533_c0	42240533	haskell	0	Title: Infer constraints for both if and else of type equality Problem title: Infer constraints for both if and else of type equality Tags: type-families, dependent-type, haskell Problem: Infer constraints for both if and else of type equality I am trying to fill the hole in the following snippet import Data.Proxy impo...	Infer constraints for both if and else of type equality Infer constraints for both if and else of type equality type-families dependent-type haskell Data.Proxy GHC.TypeLits Data.Type.Equality Data.Type.Bool Unsafe.Coerce Infer Nat KnownNat Proxy Either Just Refl Left Nothing Right Infer constraints for both if and else...	[ -0.006500244140625, -0.011474609375, -0.00933837890625, 0.01214599609375, 0.0098876953125, -0.0022125244140625, -0.01953125, -0.0042724609375, -0.00046539306640625, 0.007354736328125, 0.01422119140625, -0.00250244140625, 0.012451171875, 0.01385498046875, 0.01416015625, -0.0029144287109...	[ 360, 2875, 158, 2816, 4288, 100, 15044, 2174, 136, 37076, 10644, 28, 161789, 69128, 108750, 50986, 1556, 142508, 11809, 10752, 50878, 73265, 196707, 9506, 933, 647, 929, 992, 115840, 10625, 56, 329, 68875, 70829, 4645, 18, 1250, 9563, 53295...	[ 0.1046142578125, 0.27392578125, 0.10394287109375, 0.2037353515625, 0.1402587890625, 0.021575927734375, 0.1060791015625, 0.1761474609375, 0.079833984375, 0.1796875, 0.1871337890625, 0.049407958984375, 0.2158203125, 0.1043701171875, 0.176025390625, 0.115966796875, 0.0965576171875, 0....	embed
6887244_c1	6887244	haskell	1	In the second argument of `(>>=)', namely `look cToD' I've found that this variation compiles well (type definitions are the same): x :: A -> M.Map A B -> M.Map B C -> Maybe C x a aToB bToC = look aToB a >>= look bToC where look = flip M.lookup y :: A -> M.Map A B -> M.Map B C -> M.Map C D -> Maybe D y a aToB bToC cTo...	In the second argument of `(>>=)', namely `look cToD' I've found that this variation compiles well (type definitions are the same): x :: A -> M.Map A B -> M.Map B C -> Maybe C x a aToB bToC = look aToB a >>= look bToC where look = flip M.lookup y :: A -> M.Map A B -> M.Map B C -> M.Map C D -> Maybe D y a aToB bToC cTo...	[ 0.01031494140625, -0.0028228759765625, 0.00799560546875, 0.0174560546875, -0.00171661376953125, 0.017822265625, -0.0091552734375, 0.00665283203125, 0.0072021484375, -0.0052490234375, -0.005096435546875, -0.0126953125, -0.00141143798828125, 0.005828857421875, 0.0277099609375, -0.0071411...	[ 17932, 10750, 30813, 1369, 64747, 501, 7763, 397, 14037, 903, 143834, 9969, 1340, 7, 5299, 50986, 80934, 5701, 1022, 62, 33079, 276, 166179, 335, 313, 83425, 10, 571, 876, 441, 6713, 147505, 113, 391, 425, 2037, 28007, 3884, 10644, 143726...	[ 0.11865234375, 0.212890625, 0.237548828125, 0.2249755859375, 0.2724609375, 0.044036865234375, 0.2042236328125, 0.177734375, 0.04376220703125, 0.06146240234375, 0.2310791015625, 0.17041015625, 0.1783447265625, 0.0299072265625, 0.123291015625, 0.2142333984375, 0.1580810546875, 0.0899...	embed
13686078_c0	13686078	haskell	0	Title: Pattern match failure Problem title: Pattern match failure Tags: hugs, haskell Problem: Pattern match failure or am i just blind? Very easy easy function, throws "Pattern match failure: get_rtg db" type Movie = (Title,Regisseur,MainActors,ReleaseDate,Genre,SalesPrice) type Title = String type Regisseur = String ...	Pattern match failure Pattern match failure hugs haskell Pattern Movie Title Regisseur MainActors ReleaseDate Genre SalesPrice Actor Thriller Fantasy ScienceFiction Comedy Ord Show Database get_rtg ger_rtg Pattern match failure or am i just blind? Very easy easy function, throws "Pattern match failure: get_rtg db"	[ -0.0067138671875, 0.021728515625, 0.004241943359375, -0.01165771484375, 0.00579833984375, 0.000751495361328125, -0.0286865234375, 0.0068359375, 0.029541015625, -0.01904296875, 0.004791259765625, 0.00439453125, -0.004608154296875, -0.00494384765625, -0.00112152099609375, 0.0004844665527...	[ 9876, 22766, 14858, 137578, 35875, 7, 1556, 142508, 10348, 48962, 11678, 98138, 12321, 39450, 22230, 152590, 86291, 15937, 88583, 33163, 185617, 237110, 115016, 28745, 6159, 116512, 35379, 17367, 187781, 2046, 3198, 177, 4155, 707, 444, 17, 166...	[ 0.228759765625, 0.1953125, 0.251953125, 0.2880859375, 0.229736328125, 0.1090087890625, 0.159912109375, 0.275634765625, 0.1417236328125, 0.05621337890625, 0.0599365234375, 0.05145263671875, 0.035888671875, 0.06591796875, 0.00408935546875, 0.10272216796875, 0.0689697265625, 0.0972900...	embed
13831368_c1	13831368	haskell	1	0 r0 loop x r p rs i \| (varLog "residual = " $ sqrt rs') < tol = (x',i) \| otherwise = loop x' r' p' rs' (i+1) where mAp = mulMV mA p alpha = rs / (dot p mAp) x' = x + (alpha .* p) r' = r - (alpha .* mAp) rs' = dot r' r' beta = rs' / rs p' = r' + (beta .* p) (.) :: (Num a) => a -> SpVCR a -> SpVCR a (.) s v = fmap (s ...	0 r0 loop x r p rs i \| (varLog "residual = " $ sqrt rs') < tol = (x',i) \| otherwise = loop x' r' p' rs' (i+1) where mAp = mulMV mA p alpha = rs / (dot p mAp) x' = x + (alpha .* p) r' = r - (alpha .* mAp) rs' = dot r' r' beta = rs' / rs p' = r' + (beta .* p) (.) :: (Num a) => a -> SpVCR a -> SpVCR a (.) s v = fmap (s ...	[ -0.0267333984375, 0.0311279296875, 0.00933837890625, -0.0007171630859375, 0.0286865234375, 0.0026702880859375, -0.005279541015625, 0.0159912109375, 0.0137939453125, 0.0218505859375, 0.0108642578125, 0.01043701171875, -0.02001953125, -0.0081787109375, -0.0172119140625, 0.00537109375, ...	[ 757, 1690, 2389, 40956, 1022, 915, 151756, 17, 58745, 1961, 113972, 107, 5151, 20605, 2203, 3650, 864, 3198, 25, 4426, 31917, 425, 14, 120262, 21748, 47677, 16690, 61922, 144, 14612, 15464, 997, 20633, 51703, 59865, 839, 316, 10, 8019, 85...	[ 0.1728515625, 0.1490478515625, 0.1839599609375, 0.2437744140625, 0.10626220703125, 0.1429443359375, 0.154541015625, 0.126953125, 0.0227203369140625, 0.1351318359375, 0.237548828125, 0.070068359375, 0.1953125, 0.1939697265625, 0.011993408203125, 0.05517578125, 0.0904541015625, 0.151...	embed
40234447_c0	40234447	haskell	0	Title: Non-exhaustive functions in Haskell Problem title: Non-exhaustive functions in Haskell Tags: haskell Problem: Non-exhaustive functions in Haskell I wrote a function in Haskell: recognize :: [GrammarRule] -> State -> [String] -> Bool recognize [] x [s] = False recognize gr x [s] = if elem True (map (\state -> ele...	Non-exhaustive functions in Haskell Non-exhaustive functions in Haskell haskell Non-exhaustive Haskell GrammarRule State Bool w:ws r:rs End Step Non-exhaustive functions in Haskell I wrote a function in Haskell: this is non-exhaustive. What's the problem with the recognize function? Thanks a lot!!	[ -0.013427734375, 0.005218505859375, -0.00634765625, 0.0091552734375, -0.004058837890625, 0.00732421875, -0.00823974609375, -0.01055908203125, 0.002685546875, 0.00506591796875, 0.00933837890625, -0.00012493133544921875, 0.00335693359375, -0.01171875, 0.00299072265625, 0.0038909912109375...	[ 3775, 3355, 18391, 4935, 32354, 23, 20625, 142508, 1556, 48078, 1727, 26951, 133, 22836, 2460, 929, 148, 19725, 1690, 4295, 18878, 50478, 54397, 903, 83, 351, 9, 2967, 125296 ]	[ 0.1983642578125, 0.05743408203125, 0.156494140625, 0.1324462890625, 0.2093505859375, 0.032958984375, 0.1529541015625, 0.253173828125, 0.142333984375, 0.09234619140625, 0.07769775390625, 0.1695556640625, 0.042724609375, 0.1365966796875, 0.0775146484375, 0.163330078125, 0.0149841308593...	embed
19808944_c0	19808944	haskell	0	Title: Haskell input multiple numbers -> output multiple numbers + divide Problem title: Haskell input multiple numbers -> output multiple numbers + divide Tags: haskell Problem: Haskell input multiple numbers -> output multiple numbers + divide I want to get as an input 3 numbers and give as an output multiple r...	Haskell input multiple numbers -> output multiple numbers + divide Haskell input multiple numbers -> output multiple numbers + divide haskell a Haskell Integer Lab2.hs:17:17 Fractional Possible Failed Haskell input multiple numbers -> output multiple numbers + divide I want to get as an input 3 numbers and give a...	[ -0.00701904296875, 0.0001430511474609375, -0.003570556640625, 0.00775146484375, 0.006622314453125, 0.0038299560546875, 0.0010528564453125, -0.005950927734375, 0.0064697265625, -0.024658203125, -0.01171875, -0.01434326171875, 0.0179443359375, 0.016845703125, -0.01220703125, -0.002853393...	[ 20625, 142508, 107730, 48716, 101935, 5386, 140992, 997, 101637, 1556, 44401, 21488, 22950, 7868, 10763, 289, 115861, 2661, 190355, 297, 3444, 2046, 237, 138, 8337, 50339, 18151, 4966, 37202, 2967, 3688, 33172, 87, 9790, 54 ]	[ 0.15283203125, 0.227294921875, 0.1826171875, 0.2286376953125, 0.1524658203125, 0.11669921875, 0.1983642578125, 0.09588623046875, 0.2154541015625, 0.1544189453125, 0.1279296875, 0.0723876953125, 0.03619384765625, 0.11767578125, 0.07958984375, 0.03759765625, 0.1165771484375, 0.071105...	embed
9919954_c0	9919954	haskell	0	Title: Writing a function to get all subsequences of size n in Haskell? Problem title: Writing a function to get all subsequences of size n in Haskell? Tags: functional-programming, haskell Problem: Writing a function to get all subsequences of size n in Haskell? I was trying to write a function to get all subsequences...	Writing a function to get all subsequences of size n in Haskell? Writing a function to get all subsequences of size n in Haskell? functional-programming haskell Writing Haskell Writing a function to get all subsequences of size n in Haskell? I was trying to write a function to get all subsequences of a list that are of...	[ 0.00531005859375, 0.0155029296875, 0.00958251953125, 0.000545501708984375, -0.002105712890625, -0.0022125244140625, -0.014404296875, -0.00665283203125, 0.010986328125, -0.0103759765625, 0.0068359375, -0.015380859375, 0.0032958984375, 0.008056640625, -0.0093994140625, 0.00872802734375, ...	[ 213185, 32354, 2046, 756, 1614, 184, 26513, 5170, 13267, 653, 20625, 142508, 47, 23, 123309, 28966, 1556, 31577, 33022, 5303, 621, 111, 9077, 1672, 47644, 88303, 11809, 154663, 22144, 46312, 1810, 959, 115095, 71864, 25647, 3444, 10644, 17306...	[ 0.1390380859375, 0.2103271484375, 0.0811767578125, 0.1551513671875, 0.1597900390625, 0.15234375, 0.1749267578125, 0.04071044921875, 0.1583251953125, 0.1602783203125, 0.1451416015625, 0.2342529296875, 0.030059814453125, 0.02142333984375, 0.1080322265625, 0.03448486328125, 0.1096191406...	embed
31288206_c0	31288206	haskell	0	Title: How to insert a list in a list in all possible ways? Problem title: How to insert a list in a list in all possible ways? Tags: haskell, list Problem: How to insert a list in a list in all possible ways? I am trying to enumerate all the possible merges of two lists. In example inserting "bb" into "aaa" would look...	How to insert a list in a list in all possible ways? How to insert a list in a list in all possible ways? haskell list Data.List How Char How to insert a list in a list in all possible ways? I am trying to enumerate all the possible merges of two lists. In example inserting "bb" into "aaa" would look like What I curren...	[ 0.0017547607421875, 0.003387451171875, 0.007537841796875, 0.024169921875, -0.009521484375, 0.00994873046875, -0.02587890625, -0.034912109375, -0.0037384033203125, 0.00836181640625, 0.0152587890625, -0.0174560546875, 0.00762939453125, -0.00167083740234375, -0.0240478515625, 0.0155029296...	[ 11249, 47, 183540, 10, 5303, 23, 756, 7722, 48322, 1556, 142508, 11809, 154663, 21656, 31577, 189085, 42564, 7, 111, 6626, 27781, 5125, 3934, 84022, 2806, 6713, 1884, 82424, 903, 30646, 100, 158, 4460, 33, 79315, 37842, 20662, 1660, 53418, ...	[ 0.1376953125, 0.0865478515625, 0.2705078125, 0.072265625, 0.255126953125, 0.1378173828125, 0.1297607421875, 0.1470947265625, 0.1304931640625, 0.12353515625, 0.225830078125, 0.1046142578125, 0.1839599609375, 0.1611328125, 0.05792236328125, 0.12890625, 0.1614990234375, 0.012298583984...	embed
57892797_c0	57892797	haskell	0	Title: How to indent OSC config correctly Problem title: How to indent OSC config correctly Tags: haskell, indentation Problem: How to indent OSC config correctly I am trying to find the right indentation for an OSC configuration in a haskell file. When I write the following in two lines it unityTarget :: OSCTarget uni...	How to indent OSC config correctly How to indent OSC config correctly haskell indentation How OSC OSCTarget Nothing MessageStamp How to indent OSC config correctly I am trying to find the right indentation for an OSC configuration in a haskell file. When I write the following in two lines it works but if I use the foll...	[ -0.00070953369140625, -0.00909423828125, -0.003997802734375, 0.004791259765625, 0.0166015625, -0.00152587890625, -0.023193359375, -0.022216796875, -0.0005645751953125, -0.0027618408203125, -0.0057373046875, -0.0341796875, 0.0026397705078125, -0.00592041015625, 0.01068115234375, -0.0245...	[ 11249, 18597, 18, 180, 14495, 153837, 26785, 1556, 142508, 22062, 11787, 147, 3794, 182747, 48205, 4588, 42378, 2676, 538, 7108, 180346, 11435, 33022, 25632, 6626, 124519, 43240, 22027, 366, 18499, 44691, 98753, 1620, 27853, 143834 ]	[ 0.0216827392578125, 0.1727294921875, 0.1370849609375, 0.13330078125, 0.1922607421875, 0.239501953125, 0.119873046875, 0.10577392578125, 0.198486328125, 0.1199951171875, 0.1483154296875, 0.07421875, 0.139892578125, 0.1343994140625, 0.05023193359375, 0.0225830078125, 0.0550537109375, ...	embed
25944132_c0	25944132	haskell	0	Title: Do threaded binary tree structures offer any advantages in Haskell? Problem title: Do threaded binary tree structures offer any advantages in Haskell? Tags: algorithm, functional-programming, haskell, tree Problem: Do threaded binary tree structures offer any advantages in Haskell? I was reading this mailing lis...	Do threaded binary tree structures offer any advantages in Haskell? Do threaded binary tree structures offer any advantages in Haskell? algorithm functional-programming haskell tree Haskell Do threaded binary tree structures offer any advantages in Haskell? I was reading this mailing list post , where someone had a que...	[ 0.01611328125, 0.00848388671875, 0.007110595703125, -0.02001953125, 0.01513671875, 0.0078125, -0.01953125, -0.0031890869140625, -0.0040283203125, -0.04443359375, 0.0048828125, -0.006622314453125, -0.01324462890625, -0.01129150390625, -0.0054931640625, 0.0103759765625, 0.0078125, 0....	[ 86997, 297, 2394, 6635, 53201, 45646, 18645, 2499, 92940, 7, 20625, 142508, 23, 234873, 123309, 28966, 1556, 984, 45176, 105233, 1360, 90, 137567, 959, 4127, 6528, 6713, 37317, 1286, 93766, 222530, 5809, 64549, 7722 ]	[ 0.2100830078125, 0.109375, 0.1719970703125, 0.09735107421875, 0.2216796875, 0.1763916015625, 0.07611083984375, 0.044952392578125, 0.1646728515625, 0.03509521484375, 0.125, 0.2230224609375, 0.0291900634765625, 0.1038818359375, 0.1116943359375, 0.06817626953125, 0.090576171875, 0.033...	embed
50820687_c0	50820687	haskell	0	Title: How to convert string to an actual term in Haskell? Problem title: How to convert string to an actual term in Haskell? Tags: functional-programming, haskell Problem: How to convert string to an actual term in Haskell? I have defined the following data type data EventType = RUN_EVENT Integer \| GIVE_ITEM Integer I...	How to convert string to an actual term in Haskell? How to convert string to an actual term in Haskell? functional-programming haskell How Haskell EventType RUN_EVENT Integer GIVE_ITEM Show How to convert string to an actual term in Haskell? I have defined the following data type and from some test, I'm retrieving data...	[ -0.0059814453125, 0.004638671875, -0.01904296875, 0.017333984375, -0.00189971923828125, 0.0003376007080078125, -0.00000155717134475708, -0.0026092529296875, -0.012939453125, -0.041015625, 0.005767822265625, -0.020751953125, 0.006591796875, 0.01300048828125, -0.0218505859375, 0.00141143...	[ 11249, 47, 96760, 79315, 142, 8561, 13579, 23, 20625, 142508, 123309, 28966, 1556, 36943, 196707, 130747, 647, 113114, 44401, 527, 96479, 25216, 594, 17367, 61924, 25632, 2053, 10644, 3034, 97351, 35064, 7103, 1884, 64549, 34292, 1496, 963, 2...	[ 0.0843505859375, 0.1240234375, 0.1947021484375, 0.2734375, 0.058563232421875, 0.2120361328125, 0.2357177734375, 0.06500244140625, 0.144287109375, 0.25146484375, 0.12109375, 0.052734375, 0.1104736328125, 0.1864013671875, 0.2061767578125, 0.1685791015625, 0.1207275390625, 0.226928710...	embed
46575006_c1	46575006	haskell	1	graphColor "abc" [1..6] e1 []) [[(6,'c'),(5,'a'),(4,'a'),(3,'c'),(2,'b'),(1,'a')]] Ex2: > take 1 (graphColor "abc" [1..4] e2 []) [] This is my code thus far which just returns the empty list no matter what. graphColor :: [Color] -> [Node] -> [Edge] -> Coloring -> [Coloring] -- Fill in your code here graphColor colors n...	graphColor "abc" [1..6] e1 []) [[(6,'c'),(5,'a'),(4,'a'),(3,'c'),(2,'b'),(1,'a')]] Ex2: > take 1 (graphColor "abc" [1..4] e2 []) [] This is my code thus far which just returns the empty list no matter what. graphColor :: [Color] -> [Node] -> [Edge] -> Coloring -> [Coloring] -- Fill in your code here graphColor colors n...	[ -0.0294189453125, 0.006256103515625, -0.008544921875, 0.0093994140625, -0.000171661376953125, 0.0028228759765625, -0.04345703125, -0.007568359375, 0.00689697265625, 0.0205078125, -0.0048828125, -0.0022430419921875, 0.000885009765625, -0.00860595703125, -0.0086669921875, 0.0034484863281...	[ 41382, 10625, 1484, 2055, 238, 68252, 910, 28, 418, 139303, 104116, 105801, 86827, 275, 11, 5443, 304, 5646, 106, 617, 3293, 759, 18151, 2060, 1660, 30646, 201505, 5303, 110, 26866, 2367, 5021, 69489, 51193, 214, 140423, 23, 3688, 104988, ...	[ 0.2349853515625, 0.15234375, 0.2298583984375, 0.109130859375, 0.07464599609375, 0.0209197998046875, 0.0814208984375, 0.09027099609375, 0.0305328369140625, 0.06805419921875, 0.0159759521484375, 0.0313720703125, 0.0158843994140625, 0.0081787109375, 0.00152587890625, 0.0946044921875, 0....	embed
46749678_c0	46749678	haskell	0	Title: Haskell getter of data type Problem title: Haskell getter of data type Tags: haskell Problem: Haskell getter of data type Basically, I have 2 different structures - Point and Cell. Since there is an aggregation between them, I would like to somehow get the value of the Point just by having the cell - let's say a...	Haskell getter of data type Haskell getter of data type haskell Haskell Wall Point a.point a.point.x Show Cell Path Start End Haskell getter of data type Basically, I have 2 different structures - Point and Cell. Since there is an aggregation between them, I would like to somehow get the value of the Point just by havi...	[ -0.002166748046875, 0.0034942626953125, 0.00421142578125, 0.00408935546875, 0.006683349609375, -0.00567626953125, 0.00112152099609375, -0.01287841796875, 0.0008087158203125, -0.0230712890625, -0.0208740234375, 0.00148773193359375, -0.0174560546875, -0.0021514892578125, -0.0203857421875, ...	[ 20625, 142508, 2046, 720, 111, 2053, 10644, 1556, 23706, 41097, 10, 38496, 425, 17367, 80743, 108421, 13794, 18878, 116, 12921, 45646, 136, 197564, 17721, 2806, 1884, 209303, 34292, 1660, 390, 19441, 38750, 3095, 4734, 765, 32599, 6863, 31913...	[ 0.161865234375, 0.224609375, 0.1668701171875, 0.1629638671875, 0.068359375, 0.1214599609375, 0.142822265625, 0.16162109375, 0.20263671875, 0.1995849609375, 0.1290283203125, 0.2269287109375, 0.0816650390625, 0.11083984375, 0.1962890625, 0.17626953125, 0.090576171875, 0.11083984375, ...	embed
9515388_c1	9515388	haskell	1	arbitrary type, but constrained on their -- tk parameter. The StructV associated type captures the return -- type of the combined UI class (UITK tk) => FieldList tk l where type StructV tk l instance (UITK tk) => FieldList tk HNil where type StructV tk HNil = HNil instance (UITK tk, FieldList tk l) => FieldList tk (HC...	arbitrary type, but constrained on their -- tk parameter. The StructV associated type captures the return -- type of the combined UI class (UITK tk) => FieldList tk l where type StructV tk l instance (UITK tk) => FieldList tk HNil where type StructV tk HNil = HNil instance (UITK tk, FieldList tk l) => FieldList tk (HC...	[ 0.0118408203125, 0.01904296875, -0.004119873046875, -0.0242919921875, 0.009033203125, 0.00323486328125, 0.01239013671875, -0.01708984375, 0.0186767578125, -0.00537109375, -0.0087890625, -0.0223388671875, 0.005462646484375, 0.00848388671875, -0.002044677734375, -0.0277099609375, 0.035...	[ 61799, 1294, 10644, 1284, 158, 9297, 122009, 98, 2363, 4210, 31472, 171859, 63667, 15390, 856, 137272, 141621, 30646, 70163, 111481, 18507, 33457, 29735, 117657, 154663, 96, 7440, 110527, 79059, 379, 73265, 5245, 10, 71713, 25553, 81118, 14240,...	[ 0.169921875, 0.050872802734375, 0.227783203125, 0.09918212890625, 0.0625, 0.1334228515625, 0.07720947265625, 0.015106201171875, 0.01300048828125, 0.043487548828125, 0.1817626953125, 0.1986083984375, 0.1934814453125, 0.1165771484375, 0.283203125, 0.1983642578125, 0.130859375, 0.1381...	embed
65704097_c1	65704097	haskell	1	1)-> r := r + 0 fi print(r) ./Main prog 1 1 1 1 1 ... The issue is probably a misuse of the spaces function but I can't seem to get the parsing correct even when I remove all of the instances of spaces such that everything is on a single line concatenated together. Even when I do that, it won't accept "fi" in the Parse...	1)-> r := r + 0 fi print(r) ./Main prog 1 1 1 1 1 ... The issue is probably a misuse of the spaces function but I can't seem to get the parsing correct even when I remove all of the instances of spaces such that everything is on a single line concatenated together. Even when I do that, it won't accept "fi" in the Parse...	[ -0.0108642578125, 0.00927734375, -0.01519775390625, 0.0223388671875, -0.0108642578125, 0.005035400390625, 0.0159912109375, -0.028076171875, 0.0203857421875, -0.01275634765625, -0.0224609375, -0.013916015625, -0.02587890625, -0.0074462890625, -0.000911712646484375, 0.00726318359375, 0...	[ 4879, 103607, 1690, 1369, 997, 757, 809, 28412, 42, 168793, 67973, 106, 153, 31089, 31895, 1239, 4032, 32628, 7, 32354, 831, 48903, 366, 6953, 26785, 87388, 756, 111, 110527, 26818, 98, 11001, 13315, 158, 4460, 33, 27686, 25842, 26946, 10...	[ 0.1168212890625, 0.148193359375, 0.162353515625, 0.0782470703125, 0.11083984375, 0.1597900390625, 0.232421875, 0.1981201171875, 0.1309814453125, 0.1690673828125, 0.2064208984375, 0.1220703125, 0.001129150390625, 0.06219482421875, 0.00982666015625, 0.035400390625, 0.0633544921875, 0...	embed
29860661_c0	29860661	haskell	0	Title: How do I force a function to be called immediately in Haskell? Problem title: How do I force a function to be called immediately in Haskell? Tags: memoization, lazy-evaluation, haskell Problem: How do I force a function to be called immediately in Haskell? This is my code: import Data.Function.Memoize import Deb...	How do I force a function to be called immediately in Haskell? How do I force a function to be called immediately in Haskell? memoization lazy-evaluation haskell Data.Function.Memoize Debug.Trace How Haskell How do I force a function to be called immediately in Haskell? This is my code: I expected it to print: But, ins...	[ 0.0031585693359375, 0.0106201171875, 0.02099609375, 0.000324249267578125, 0.0205078125, 0.00142669677734375, 0.006622314453125, 0.0002460479736328125, -0.0016937255859375, -0.040771484375, 0.0093994140625, 0.00885009765625, -0.01177978515625, 0.01220703125, 0.025146484375, -0.000507354...	[ 11249, 54, 37772, 32354, 47, 186, 35839, 109312, 23, 20625, 142508, 87, 163, 432, 47691, 21, 3285, 159258, 1556, 11809, 97249, 10763, 6696, 20650, 262, 85779, 28542, 18151, 84751, 28412, 4966, 64457, 903, 959, 29367, 237, 12638, 1733, 3584,...	[ 0.059326171875, 0.03338623046875, 0.2509765625, 0.2376708984375, 0.07373046875, 0.05316162109375, 0.22265625, 0.2391357421875, 0.052215576171875, 0.1756591796875, 0.26953125, 0.0285491943359375, 0.1551513671875, 0.1749267578125, 0.1005859375, 0.073486328125, 0.1224365234375, 0.1353...	embed
61416756_c2	61416756	haskell	2	out that this is because getRandomRs calls split on the current generator. This can be checked directly in this way: λ> λ> (sg0a, sg0b) = split sg0 λ> (tg0a, tg0b) = split tg0 λ> λ> :{ \|λ> let { getRandomDouble :: RandomGen g => g -> Double ; \|λ> getRandomDouble g = fst $ random g } \|λ> :} λ> λ> λ> λ> getRandomDouble ...	out that this is because getRandomRs calls split on the current generator. This can be checked directly in this way: λ> λ> (sg0a, sg0b) = split sg0 λ> (tg0a, tg0b) = split tg0 λ> λ> :{ \|λ> let { getRandomDouble :: RandomGen g => g -> Double ; \|λ> getRandomDouble g = fst $ random g } \|λ> :} λ> λ> λ> λ> getRandomDouble ...	[ -0.002593994140625, 0.0179443359375, -0.0010986328125, -0.0283203125, 0.0019683837890625, 0.01220703125, 0.01141357421875, -0.0166015625, 0.0018768310546875, -0.03369140625, 0.00958251953125, 0.037841796875, -0.00787353515625, 0.0146484375, 0.0228271484375, -0.002471923828125, -0.020...	[ 1810, 450, 903, 83, 6637, 2046, 126525, 3815, 1052, 7, 11782, 65450, 98, 43581, 145823, 5, 3293, 831, 12765, 297, 105237, 111147, 2740, 2389, 93170, 275, 2203, 8331, 34, 2661, 39643, 306, 105376, 706, 44357, 33079, 107172, 271, 3650, 9675...	[ 0.152587890625, 0.0657958984375, 0.108642578125, 0.0843505859375, 0.0787353515625, 0.13623046875, 0.1806640625, 0.1986083984375, 0.206787109375, 0.080810546875, 0.1253662109375, 0.2080078125, 0.036224365234375, 0.230712890625, 0.2418212890625, 0.012359619140625, 0.0284423828125, 0....	embed
29055867_c1	29055867	haskell	1	cast, year, fans) <- filmList] No instance for (IsChar [Char]) arising from a use of `printf' Possible fix: add an instance declaration for (IsChar [Char]) In the expression: printf ("\|%s\| \|%-20s\| \|%2d\| \|%.1f\|") title cast year fans In the first argument of `sequence_', namely `[printf ("\|%s\| \|%-20s\| \|%2d\| \|%.1f\|") ti...	cast, year, fans) <- filmList] No instance for (IsChar [Char]) arising from a use of `printf' Possible fix: add an instance declaration for (IsChar [Char]) In the expression: printf ("\|%s\| \|%-20s\| \|%2d\| \|%.1f\|") title cast year fans In the first argument of `sequence_', namely `[printf ("\|%s\| \|%-20s\| \|%2d\| \|%.1f\|") ti...	[ 0.0045166015625, -0.0034942626953125, -0.0022125244140625, 0.01165771484375, -0.01409912109375, -0.0096435546875, 0.0017852783203125, 0.0252685546875, 0.0003681182861328125, 0.0294189453125, 0.0020599365234375, -0.021728515625, -0.0086669921875, 0.00191497802734375, -0.026123046875, -0...	[ 37702, 6602, 35992, 1346, 154663, 438, 110527, 100, 29598, 84068, 187, 72219, 4527, 35662, 420, 115861, 30022, 15190, 21635, 125195, 28412, 3949, 11033, 167218, 44759, 5117, 10750, 184, 944, 3956, 5440, 40, 71, 28864, 26073, 1914, 822, 11809,...	[ 0.185302734375, 0.2178955078125, 0.264892578125, 0.097412109375, 0.1824951171875, 0.06597900390625, 0.244140625, 0.06829833984375, 0.08837890625, 0.271240234375, 0.0675048828125, 0.034210205078125, 0.10638427734375, 0.199951171875, 0.2423095703125, 0.1302490234375, 0.1527099609375, ...	embed
20724962_c0	20724962	haskell	0	Title: mapping over entire data set to get results Problem title: mapping over entire data set to get results Tags: haskell Problem: mapping over entire data set to get results Suppose I have the arrays: A = "ABACUS" B = "YELLOW" And they are zipped so: Pairing = zip A B I also have a function Connect :: Char -> [(Char...	mapping over entire data set to get results mapping over entire data set to get results haskell ABACUS YELLOW Pairing Connect Char mapping over entire data set to get results Suppose I have the arrays: And they are zipped so: Pairing = zip A B I also have a function Connect :: Char -> [(Char,Char)] -> [(Char,Char,Int)]...	[ 0.0027313232421875, 0.0031585693359375, 0.0036773681640625, 0.0225830078125, -0.0047607421875, 0.014404296875, 0.006195068359375, -0.0177001953125, 0.00897216796875, -0.005706787109375, -0.0017242431640625, -0.0089111328125, -0.005828857421875, 0.00311279296875, -0.02587890625, -0.0134...	[ 291, 26783, 645, 64194, 2053, 5423, 2046, 50339, 47, 1556, 142508, 11321, 15012, 8762, 990, 174444, 1456, 37897, 2852, 62448, 21656, 10298, 4778, 3546, 48398, 68330, 62, 335, 32354, 84068, 18, 3444, 54, 34475, 21441, 7413, 136044, 7440, 133...	[ 0.1859130859375, 0.13623046875, 0.144287109375, 0.181640625, 0.1165771484375, 0.139404296875, 0.0968017578125, 0.2066650390625, 0.00146484375, 0.094482421875, 0.260986328125, 0.052459716796875, 0.0748291015625, 0.10986328125, 0.03216552734375, 0.1158447265625, 0.041534423828125, 0....	embed
4745921_c0	4745921	haskell	0	Title: How do I run my package's tests using different versions of its prerequisites? Problem title: How do I run my package's tests using different versions of its prerequisites? Tags: cabal, testing, integration-testing, haskell Problem: How do I run my package's tests using different versions of its prereq...	How do I run my package's tests using different versions of its prerequisites? How do I run my package's tests using different versions of its prerequisites? cabal testing integration-testing haskell different How How do I run my package's tests using different versions of its prerequisites? Suppose I've writ...	[ 0.01470947265625, -0.001953125, 0.0225830078125, 0.0017852783203125, -0.012451171875, 0.0091552734375, -0.005340576171875, 0.00150299072265625, 0.0034027099609375, 0.01031494140625, 0.00567626953125, 0.003662109375, 0.00160980224609375, 0.01708984375, -0.003936767578125, 0.01123046875,...	[ 11249, 54, 87, 11675, 759, 98169, 3768, 109921, 17368, 12921, 11389, 479, 107, 3181, 100758, 6863, 109524, 134234, 157353, 6954, 1556, 142508, 121691, 59121, 20625, 1884, 54452, 47, 52922, 4588, 11408, 297, 3714, 43240, 36279, 527, 73265, 206...	[ 0.10009765625, 0.03125, 0.0236053466796875, 0.1827392578125, 0.06939697265625, 0.2205810546875, 0.06475830078125, 0.27392578125, 0.087646484375, 0.20751953125, 0.21435546875, 0.1146240234375, 0.07489013671875, 0.145751953125, 0.1165771484375, 0.01873779296875, 0.1796875, 0.23583984...	embed
55316898_c1	55316898	haskell	1	The second part of my question is how to translate this into Hypothesis. AFAICT Hypothesis does not have any equivalent of the frequency generator. I am wondering whether I should attempt to build a frequency strategy myself from existing Hypothesis strategies, or if the idiom itself is not worth translating and I sho...	The second part of my question is how to translate this into Hypothesis. AFAICT Hypothesis does not have any equivalent of the frequency generator. I am wondering whether I should attempt to build a frequency strategy myself from existing Hypothesis strategies, or if the idiom itself is not worth translating and I sho...	[ -0.014404296875, -0.0194091796875, 0.00146484375, -0.007659912109375, -0.0079345703125, 0.00170135498046875, 0.019775390625, -0.044189453125, 0.0224609375, -0.004791259765625, 0.00897216796875, 0.047607421875, -0.00024318695068359375, 0.0185546875, 0.006378173828125, -0.000850677490234...	[ 17932, 3642, 3900, 19309, 903, 3934, 168034, 2347, 6023, 164094, 959, 765, 183234, 12478, 944, 27771, 145823, 149016, 5608, 81887, 45367, 113857, 35978, 1295, 144573, 50531, 13373, 306, 68034, 41965, 143, 1916, 170846, 139392, 35604, 56649, 277...	[ 0.03021240234375, 0.0287322998046875, 0.1607666015625, 0.2039794921875, 0.06219482421875, 0.087158203125, 0.2100830078125, 0.2186279296875, 0.1781005859375, 0.055328369140625, 0.01318359375, 0.0179443359375, 0.1092529296875, 0.16162109375, 0.126708984375, 0.0535888671875, 0.261230468...	embed
33877487_c0	33877487	haskell	0	Title: Applicative implementation of Const Monoid Problem title: Applicative implementation of Const Monoid Tags: applicative, haskell, monoids Problem: Applicative implementation of Const Monoid instance Monoid m => Applicative (Const m) where pure _ = Const mempty Const f <*> Const v = Const (f `mappend` v) I do not ...	Applicative implementation of Const Monoid Applicative implementation of Const Monoid applicative haskell monoids Applicative Monoid Functor Identity Applicative implementation of Const Monoid I do not understand how can the definition of <> type-check. On the left side f is constrained by the signature of <> as in t...	[ -0.007354736328125, -0.0091552734375, 0.006500244140625, 0.0322265625, 0.04541015625, 0.01806640625, -0.005218505859375, -0.0025634765625, -0.0078125, -0.01495361328125, 0.0181884765625, -0.01055908203125, -0.00787353515625, 0.0277099609375, -0.00469970703125, 0.0025634765625, -0.000...	[ 5659, 11048, 4935, 208124, 1657, 271, 77879, 532, 41816, 1556, 142508, 22460, 30185, 28670, 18770, 71257, 959, 28219, 3642, 831, 80934, 1639, 2740, 10644, 9, 78292, 2161, 70, 25737, 5609, 1238, 158, 9297, 122009, 138256, 23, 151134, 123055, ...	[ 0.1627197265625, 0.188720703125, 0.1824951171875, 0.164794921875, 0.1644287109375, 0.1788330078125, 0.231689453125, 0.2198486328125, 0.1796875, 0.1041259765625, 0.217529296875, 0.1824951171875, 0.134521484375, 0.089599609375, 0.07098388671875, 0.150146484375, 0.0020751953125, 0.108...	embed
23572396_c1	23572396	haskell	1	type signature for withTempFile :: (MonadIO m, MonadCatch m) => FilePath -> String -> (FilePath -> Handle -> m a) -> m a In the expression: bracket (liftIO (openTempFile tmpDir template)) (\ (name, handle) -> liftIO (hClose handle >> ignoringIOErrors (removeFile name))) (uncurry action) In an equation for `withTempFil...	type signature for withTempFile :: (MonadIO m, MonadCatch m) => FilePath -> String -> (FilePath -> Handle -> m a) -> m a In the expression: bracket (liftIO (openTempFile tmpDir template)) (\ (name, handle) -> liftIO (hClose handle >> ignoringIOErrors (removeFile name))) (uncurry action) In an equation for `withTempFil...	[ 0.0031890869140625, 0.01470947265625, -0.015380859375, -0.0264892578125, -0.000598907470703125, -0.009521484375, -0.01434326171875, -0.016357421875, 0.01007080078125, 0.002349853515625, 0.0030059814453125, 0.0001888275146484375, -0.0113525390625, 0.01422119140625, 0.01153564453125, -0....	[ 10644, 138256, 100, 678, 159065, 174350, 1984, 46674, 712, 17780, 347, 60331, 71, 76775, 206, 42724, 683, 10519, 23351, 214, 10639, 133, 10, 125195, 1620, 27853, 104501, 59636, 808, 2676, 397, 481, 110934, 11627, 34831, 60520, 59453, 47438, ...	[ 0.2303466796875, 0.279052734375, 0.020050048828125, 0.2147216796875, 0.26416015625, 0.266357421875, 0.0015869140625, 0.07177734375, 0.07958984375, 0.1939697265625, 0.09503173828125, 0.1234130859375, 0.0517578125, 0.135498046875, 0.1097412109375, 0.1231689453125, 0.053009033203125, ...	embed
43022221_c0	43022221	haskell	0	Title: Haskell Instances required for definition Problem title: Haskell Instances required for definition Tags: function, haskell Problem: Haskell Instances required for definition I have the following Haskell code, a function that checks how many digits are the same in a number and based on how many of them were the s...	Haskell Instances required for definition Haskell Instances required for definition function haskell Haskell Instances Haskell Instances required for definition I have the following Haskell code, a function that checks how many digits are the same in a number and based on how many of them were the same takes a value. I...	[ 0.0025482177734375, -0.0036468505859375, 0.0047607421875, -0.00836181640625, -0.0155029296875, 0.0169677734375, -0.0115966796875, -0.00927734375, 0.01708984375, -0.0145263671875, -0.014404296875, -0.018798828125, 0.01470947265625, 0.01904296875, 0.016845703125, -0.01531982421875, 0.0...	[ 20625, 142508, 360, 116071, 56065, 80934, 100, 32354, 1556, 25632, 18151, 12765, 3642, 5941, 153939, 621, 5701, 14012, 35509, 111, 2856, 3542, 51776, 10, 34292, 13695, 18499, 4865, 444, 87, 20594, 44691, 14602, 70, 29459, 66161, 1884, 43240, ...	[ 0.142578125, 0.2257080078125, 0.04547119140625, 0.2052001953125, 0.201416015625, 0.22412109375, 0.0215606689453125, 0.1563720703125, 0.126220703125, 0.0648193359375, 0.11865234375, 0.16064453125, 0.0289764404296875, 0.098876953125, 0.1907958984375, 0.042022705078125, 0.182861328125, ...	embed
57076728_c0	57076728	haskell	0	Title: What is the benefit of the MonadCatch? Problem title: What is the benefit of the MonadCatch? Tags: haskell Problem: What is the benefit of the MonadCatch? When I am writing some function which can fail: somefun :: (Monad m, ...) -> ... -> m a somefun ... = ... fail "some error" I can use fail to fail. But also I...	What is the benefit of the MonadCatch? What is the benefit of the MonadCatch? haskell What MonadCatch Monad MonadThrow Some MonadFail What is the benefit of the MonadCatch? When I am writing some function which can fail: I can use fail to fail. But also I can rewrite this function to use MonadThrow , so: So, today we g...	[ -0.0101318359375, 0.01904296875, 0.0128173828125, 0.0101318359375, 0.0245361328125, -0.016845703125, 0.00787353515625, 0, 0.0159912109375, 0.00823974609375, -0.01214599609375, -0.0223388671875, -0.0027923583984375, -0.009521484375, 0.0225830078125, -0.027099609375, -0.01422119140625,...	[ 4865, 68073, 111, 60331, 71, 76775, 206, 1556, 142508, 20800, 15555, 31384, 17647, 379, 83, 70, 32562, 32354, 831, 35782, 4527, 47, 456, 434, 18781, 678, 104250, 594, 33022, 12763, 5759, 133760, 20209, 35773, 1632, 55300, 28219, 142458, 676...	[ 0.0352783203125, 0.193603515625, 0.037109375, 0.182373046875, 0.1558837890625, 0.201416015625, 0.17431640625, 0.08709716796875, 0.2076416015625, 0.09967041015625, 0.187744140625, 0.0040283203125, 0.153564453125, 0.1298828125, 0.011871337890625, 0.042633056640625, 0.12744140625, 0.1...	embed
23375370_c0	23375370	haskell	0	Title: ghci show only typeclass methods Problem title: ghci show only typeclass methods Tags: haskell, ghci Problem: ghci show only typeclass methods In ghci you can run the :info command to learn about the methods defined on a type class, as well as see instances of that type class. For example, :info Eq outputs class...	ghci show only typeclass methods ghci show only typeclass methods haskell ghci Bool Defined GHC.Classes Map containers-0.5.0.0:Data.Map.Base Maybe Data.Maybe ghci show only typeclass methods In ghci you can run the :info command to learn about the methods defined on a type class, as well as see instances of that type c...	[ 0.009033203125, 0.0096435546875, 0.013427734375, 0.024658203125, -0.01171875, 0.0106201171875, -0.002838134765625, -0.003631591796875, 0.00555419921875, -0.01104736328125, -0.03076171875, -0.047119140625, -0.006072998046875, 0.0169677734375, -0.00762939453125, 0.006927490234375, -0.0...	[ 31380, 318, 7639, 4734, 10644, 67413, 150624, 1556, 142508, 2460, 929, 5983, 527, 73265, 140803, 42719, 116419, 93645, 99929, 137989, 166179, 63473, 83425, 11809, 82419, 831, 11675, 152, 7319, 75101, 30698, 61924, 18507, 1957, 110527, 864, 1409...	[ 0.13720703125, 0.1961669921875, 0.125244140625, 0.111572265625, 0.217041015625, 0.2357177734375, 0.22998046875, 0.11962890625, 0.195068359375, 0.05511474609375, 0.1363525390625, 0.09912109375, 0.05792236328125, 0.12109375, 0.1710205078125, 0.09637451171875, 0.1356201171875, 0.07598...	embed
2784698_c0	2784698	haskell	0	Title: Why is the recursion idiom in Haskell "'n+1' and 'n'" and not "'n' and 'n-1'"? Problem title: Why is the recursion idiom in Haskell "'n+1' and 'n'" and not "'n' and 'n-1'"? Tags: idioms, haskel...	Why is the recursion idiom in Haskell "'n+1' and 'n'" and not "'n' and 'n-1'"? Why is the recursion idiom in Haskell "'n+1' and 'n'" and not "'n' and 'n-1'"? idioms haskell recursion Why Haskell n-1 m...	[ -0.027587890625, 0.0014190673828125, 0.00592041015625, 0.0174560546875, 0.00118255615234375, 0.013427734375, -0.001129150390625, 0.0038299560546875, 0.0167236328125, -0.029052734375, 0.0225830078125, -0.0301513671875, 0.006561279296875, 0.0003662109375, 0.02099609375, -0.0233154296875,...	[ 44084, 83, 195625, 1830, 13373, 306, 23, 20625, 142508, 3768, 19, 21748, 959, 5759, 28016, 1556, 653, 759, 4332, 52721, 67, 418, 304, 136, 147756, 97595, 1507, 12877, 27983, 103510, 98753, 450, 25632, 37202, 123309, 31943, 1286, 100270, 132...	[ 0.146240234375, 0.05462646484375, 0.252197265625, 0.1104736328125, 0.177490234375, 0.1783447265625, 0.030487060546875, 0.1600341796875, 0.241455078125, 0.1441650390625, 0.127197265625, 0.2666015625, 0.0966796875, 0.1834716796875, 0.0660400390625, 0.09710693359375, 0.0823974609375, ...	embed
20036672_c0	20036672	haskell	0	Title: Haskell Recursion Scanl Problem title: Haskell Recursion Scanl Tags: loops, list, haskell, function, recursion Problem: Haskell Recursion Scanl I am trying to recursively pass in different values looping over eachother to be put into a function. I have this so far: randNum f = take 20 (iterate f 300) where f n =...	Haskell Recursion Scanl Haskell Recursion Scanl loops list haskell function recursion Haskell Recursion Scanl Point Expression Term Type Integer Does Haskell Recursion Scanl I am trying to recursively pass in different values looping over eachother to be put into a function. I have this so far: ( getInts is simply cycl...	[ -0.0189208984375, -0.00133514404296875, 0.00634765625, 0.001434326171875, -0.0169677734375, 0.02197265625, 0.0037841796875, -0.0030364990234375, 0.0034027099609375, -0.041748046875, 0.02294921875, -0.00885009765625, -0.00091552734375, -0.004913330078125, 0.0118408203125, -0.0126953125,...	[ 20625, 142508, 165428, 42, 6889, 65533, 141, 40956, 5303, 1556, 32354, 195625, 41097, 25129, 2994, 60457, 44401, 101790, 31577, 5844, 27875, 23, 12921, 142424, 645, 126340, 3884, 2060, 2046, 4153, 933, 42856, 105823, 101935, 27388, 839, 316, ...	[ 0.125244140625, 0.226806640625, 0.142822265625, 0.1591796875, 0.126220703125, 0.200927734375, 0.1649169921875, 0.1580810546875, 0.1378173828125, 0.1234130859375, 0.1397705078125, 0.2049560546875, 0.1219482421875, 0.1175537109375, 0.0931396484375, 0.130126953125, 0.19287109375, 0.04...	embed
20109660_c0	20109660	haskell	0	Title: Should I be removing vertex buffer objects on every draw? Problem title: Should I be removing vertex buffer objects on every draw? Tags: opengl, openglraw, haskell Problem: Should I be removing vertex buffer objects on every draw? I have some Haskell / OpenGLRaw code that does something like this: verticesPtr <-...	Should I be removing vertex buffer objects on every draw? Should I be removing vertex buffer objects on every draw? opengl openglraw haskell Should gl_DOUBLE gl_ARRAY_BUFFER gl_STREAM_DRAW gl_LINE_STRIP Should I be removing vertex buffer objects on every draw? I have some Haskell / OpenGLRaw code that does something li...	[ -0.01458740234375, 0.01953125, 0.00213623046875, -0.0234375, -0.007293701171875, 0.00148773193359375, 0.007354736328125, 0.004425048828125, 0.004974365234375, -0.0185546875, 0.0093994140625, -0.058349609375, 0.015869140625, -0.02783203125, -0.02099609375, -0.00982666015625, 0.0079345...	[ 151117, 49146, 6496, 493, 24371, 373, 18234, 36746, 11907, 79442, 98, 9803, 11016, 81456, 1556, 142508, 39575, 32616, 125149, 166007, 1723, 15639, 919, 66804, 56564, 8922, 397, 118324, 57339, 94539, 10931, 7, 20625, 13527, 78703, 12248, 434, ...	[ 0.0712890625, 0.1107177734375, 0.0606689453125, 0.1353759765625, 0.2137451171875, 0.1334228515625, 0.265869140625, 0.201904296875, 0.140380859375, 0.201171875, 0.050567626953125, 0.0888671875, 0.1175537109375, 0.1971435546875, 0.06488037109375, 0.2171630859375, 0.120361328125, 0.06...	embed
46826700_c0	46826700	haskell	0	Title: How to create a generic Complex type in haskell? Problem title: How to create a generic Complex type in haskell? Tags: haskell Problem: How to create a generic Complex type in haskell? I want to create a Complex type to represent complex numbers. Following works: Prelude> data Complex = Complex Int Int Prelude> ...	How to create a generic Complex type in haskell? How to create a generic Complex type in haskell? haskell How Complex Prelude Num Data Use ExistentialQuantification GADTs How to create a generic Complex type in haskell? I want to create a Complex type to represent complex numbers. Following works: How can I change this...	[ -0.003662109375, 0.0380859375, 0.0057373046875, 0.0101318359375, 0.0260009765625, 0.0032806396484375, 0.00689697265625, -0.013916015625, 0.00048828125, -0.013671875, -0.00176239013671875, -0.0478515625, 0.00025177001953125, -0.007354736328125, -0.02783203125, 0.0198974609375, -0.0093...	[ 11249, 28282, 189534, 113197, 10644, 23, 1556, 142508, 47, 10, 1914, 822, 52782, 11809, 122688, 41274, 23749, 41072, 3444, 33636, 27140, 101935, 77168, 15549, 903, 26946, 2499, 64457, 360, 18, 25632, 18499, 4358 ]	[ 0.034393310546875, 0.15087890625, 0.2393798828125, 0.26806640625, 0.2232666015625, 0.04815673828125, 0.1383056640625, 0.209228515625, 0.0283203125, 0.032470703125, 0.01873779296875, 0.0858154296875, 0.1646728515625, 0.0517578125, 0.07861328125, 0.019500732421875, 0.00506591796875, ...	embed

33743442_c1

33743442

haskell

1

, LLVMBitReader, LLVMExecutionEngine, LLVMMC, LLVMCore, LLVMSupport This problem can usually be solved by installing the system packages that provide these libraries (you may need the "-dev" versions). If the libraries are already installed but in a non-standard location then you can use the flags --extra-include-dirs=...

[ 0.01190185546875, -0.004119873046875, -0.0027923583984375, 0.00457763671875, 0.004547119140625, -0.0004367828369140625, -0.005889892578125, -0.013427734375, -0.0223388671875, 0.02099609375, 0.002593994140625, -0.03564453125, 0.031005859375, 0.0005950927734375, 0.0184326171875, -0.00323...

[ 6, 339, 32811, 12689, 217, 31345, 56, 99954, 47599, 211603, 91384, 1212, 32557, 4524, 2037, 6982, 3293, 2967, 831, 56104, 86869, 390, 20600, 5426, 98169, 22691, 6097, 35773, 10484, 18548, 11389, 21771, 351, 66589, 31913, 4527, 49938, 112779, ...

[ 0.018402099609375, 0.061767578125, 0.1453857421875, 0.0311279296875, 0.07708740234375, 0.18310546875, 0.0557861328125, 0.078369140625, 0.18310546875, 0.0640869140625, 0.027557373046875, 0.04168701171875, 0.0767822265625, 0.1162109375, 0.128173828125, 0.091796875, 0.06732177734375, ...

embed

34635495_c1

34635495

haskell

1

Battlefield battleUntilOver randBfield = do bfield <- randBfield traceM $ "bfield::" ++ show bfield ++ "::" if battleOver bfield then return bfield else battleUntilOver $ battle bfield Here is the output: *Risk> evalRandIO $ invade Battlefield {attackers=10,defenders=10} bfield::Battlefield {attackers = 10, defenders ...

[ -0.00909423828125, 0.0008697509765625, 0.0203857421875, 0.00811767578125, 0.010498046875, -0.00360107421875, 0.01092529296875, -0.031494140625, -0.003509521484375, 0.004608154296875, 0.006561279296875, 0.0233154296875, 0.013427734375, -0.0281982421875, 0.01446533203125, -0.025146484375...

[ 212276, 133868, 14256, 3675, 156673, 27388, 571, 28394, 54, 876, 144851, 594, 3650, 275, 37223, 7639, 30646, 140992, 1052, 6581, 28, 1405, 2940, 17780, 205491, 102, 11050, 963, 6211, 46401, 209, 86841, 382, 305, 201, 190, 106, 28219, 15400,...

[ 0.259521484375, 0.2060546875, 0.1068115234375, 0.2137451171875, 0.297119140625, 0.2073974609375, 0.054931640625, 0.20654296875, 0.038299560546875, 0.056671142578125, 0.195556640625, 0.0849609375, 0.0882568359375, 0.016815185546875, 0.033233642578125, 0.0712890625, 0.1258544921875, ...

embed

37066405_c0

37066405

haskell

0

Title: Hosting applications written in Haskell: Heroku vs IaaS Problem title: Hosting applications written in Haskell: Heroku vs IaaS Tags: heroku, haskell, hosting, iaas, paas Problem: Hosting applications written in Haskell: Heroku vs IaaS I'm considering the different options for hosting a web application written in...

Hosting applications written in Haskell: Heroku vs IaaS Hosting applications written in Haskell: Heroku vs IaaS heroku haskell hosting iaas paas Hosting Haskell Heroku IaaS Hosting applications written in Haskell: Heroku vs IaaS I'm considering the different options for hosting a web application written in Haskell. Her...

[ -0.00433349609375, 0.015380859375, 0.000038623809814453125, 0.009033203125, -0.00811767578125, 0.00640869140625, -0.008544921875, -0.033447265625, -0.002685546875, -0.0016326904296875, -0.0048828125, -0.0076904296875, 0.0036163330078125, 0.001220703125, -0.00970458984375, 0.00860595703...

[ 168098, 86685, 59121, 20625, 142508, 12, 56889, 319, 20209, 12044, 11, 294, 23, 40814, 1556, 70496, 5326, 162, 249, 179635, 12921, 50717, 1467, 38415, 37202, 1884, 225530, 30700, 8060, 11675, 6032, 24702, 32233, 47041, 3871, 37067, 9433, 7661...

[ 0.2310791015625, 0.156982421875, 0.112548828125, 0.1959228515625, 0.2509765625, 0.00567626953125, 0.262939453125, 0.224365234375, 0.17822265625, 0.189697265625, 0.1571044921875, 0.1435546875, 0.06756591796875, 0.20263671875, 0.126708984375, 0.211181640625, 0.1505126953125, 0.119995...

embed

24897133_c1

24897133

haskell

1

I don't run the report every days but only when I need it. So I don't want to run report every 24 hours. It's easy to do with a makefile except the timing bit, they are wor around but once again it's a contrived example to understand deeply how Shake work. So, when I first do make report it backup the db run everythin...

[ -0.0031585693359375, 0.041748046875, 0.0186767578125, 0.0206298828125, -0.005828857421875, 0.005401611328125, -0.03955078125, 0.0238037109375, 0.01336669921875, -0.00012683868408203125, -0.007232666015625, -0.01361083984375, 0.0079345703125, 0.0137939453125, 0.005462646484375, -0.02014...

[ 2301, 18, 11675, 13416, 11907, 13312, 3229, 3871, 3444, 744, 21974, 23468, 54, 3249, 29822, 5527, 214, 4785, 10932, 27781, 28219, 68161, 13, 4488, 5117, 126502, 40041, 26818, 139392, 47, 2811, 40383, 134234, 94410, 3674, 4000, 63399, 210651, ...

[ 0.03125, 0.053985595703125, 0.144287109375, 0.2646484375, 0.03228759765625, 0.062042236328125, 0.046905517578125, 0.16552734375, 0.09368896484375, 0.1290283203125, 0.1314697265625, 0.07281494140625, 0.014617919921875, 0.1195068359375, 0.22607421875, 0.1397705078125, 0.004302978515625...

embed

39530111_c1

39530111

haskell

1

Hughes's functional difference lists, but likely somewhat worse. In heavily persistent settings, however, it does much better, because it takes advantage of sharing. The banker's queue guarantees (amortized) O(1) snoc and O(1) uncons, meaning that we can think of toListSB as an O(1) conversion to a list-like structure...

[ 0.002349853515625, 0.00001990795135498047, -0.00286865234375, -0.0186767578125, -0.023681640625, 0.0022125244140625, -0.0025787353515625, 0.0103759765625, 0.018798828125, -0.01513671875, 0.011474609375, 0.006256103515625, 0.0252685546875, 0.0240478515625, -0.01239013671875, -0.00279235...

[ 177099, 25, 123309, 60212, 5303, 7, 47041, 208806, 124632, 5115, 70560, 53550, 14602, 5045, 11522, 92940, 53371, 150065, 41, 13388, 142027, 77529, 18, 29367, 180, 27750, 91, 54387, 51, 25553, 5351, 47, 154663, 36474, 142477, 5062, 45646, 5369...

[ 0.281982421875, 0.02593994140625, 0.20458984375, 0.260986328125, 0.214111328125, 0.0199737548828125, 0.0384521484375, 0.0182342529296875, 0.1253662109375, 0.051177978515625, 0.1341552734375, 0.042877197265625, 0.0684814453125, 0.0145416259765625, 0.1090087890625, 0.1483154296875, 0.1...

embed

21553435_c0

21553435

haskell

0

Title: error when updating cabal Problem title: error when updating cabal Tags: haskell, cabal Problem: error when updating cabal I cannot update cabal on windows seven. When running cabal install cabal-install , I get the following error: Linking C:\Users\sberg\AppData\Local\Temp\Cabal-1.18.1.2-10956\Cabal-1.18.1.2\di...

error when updating cabal error when updating cabal haskell cabal Linking Users AppData Local Temp Cabal-1.18.1.2-10956 Cabal-1.18.1.2 setup.exe Configuring Failed Error ExitFailure cabal-install-1.18.0.2 error when updating cabal I cannot update cabal on windows seven. When running cabal install cabal-install , I get ...

[ 0.017578125, 0.0023345947265625, 0.0233154296875, -0.00543212890625, 0.006622314453125, 0.00099945068359375, -0.0137939453125, -0.00872802734375, 0, 0.0196533203125, -0.0142822265625, -0.0289306640625, -0.0002536773681640625, -0.0172119140625, 0.00701904296875, -0.000499725341796875, ...

[ 18499, 3229, 1257, 56464, 109524, 1556, 142508, 12779, 53400, 5659, 137989, 24172, 37446, 30438, 289, 5759, 1819, 48400, 106000, 13683, 5, 169581, 46480, 59994, 190355, 212059, 5443, 217, 17647, 379, 80383, 133684, 53418, 28350, 98, 54825, 5967...

[ 0.1763916015625, 0.051300048828125, 0.1649169921875, 0.180908203125, 0.290771484375, 0.1182861328125, 0.21630859375, 0.13720703125, 0.1160888671875, 0.1270751953125, 0.1182861328125, 0.1099853515625, 0.186279296875, 0.2215576171875, 0.1990966796875, 0.044708251953125, 0.136962890625,...

embed

4405341_c0

4405341

haskell

0

Title: Issues with dependencies when trying to configure Setup.hs despite having dependencies installed Problem title: Issues with dependencies when trying to configure Setup.hs despite having dependencies installed Tags: haskell, cabal, cabal-install Problem: Issues with dependencies when trying to configure Setup.hs ...

Issues with dependencies when trying to configure Setup.hs despite having dependencies installed Issues with dependencies when trying to configure Setup.hs despite having dependencies installed haskell cabal cabal-install Issues Setup.hs Issues with dependencies when trying to configure Setup.hs despite having dependen...

[ 0.000911712646484375, 0.0012359619140625, 0.0157470703125, 0.00408935546875, -0.0267333984375, 0.0123291015625, -0.01806640625, 0.003082275390625, 0.0074462890625, 0.0177001953125, -0.030517578125, -0.032470703125, 0.00186920166015625, 0.0179443359375, 0.009765625, 0.0164794921875, 0...

[ 223317, 7, 678, 42548, 117538, 31577, 222495, 19943, 2037, 127, 61518, 19441, 20600, 1556, 142508, 109524, 80383, 62952, 5, 11435, 31344, 18151, 9790, 390, 25632, 2046, 18499, 272, 16792, 6097, 17368, 11675, 75101, 13438, 5701, 64557, 3525, 4...

[ 0.1856689453125, 0.1326904296875, 0.0770263671875, 0.240966796875, 0.162841796875, 0.09991455078125, 0.2314453125, 0.1827392578125, 0.1402587890625, 0.145263671875, 0.1314697265625, 0.108154296875, 0.2076416015625, 0.1158447265625, 0.2158203125, 0.230224609375, 0.12646484375, 0.054...

embed

46942579_c1

46942579

haskell

1

'" and "getFPS" to a list of images and saves the output-video to a user defined location. ---------------------------------------------------------------------------------------------} saveVideo :: String -> [Image PixelYA8] -> Int -> IO () saveVideo path imgs fps = do -- program stops after hitting next line -- frame...

[ 0.006378173828125, -0.003875732421875, -0.00518798828125, 0.0296630859375, -0.007171630859375, -0.00567626953125, 0.0036468505859375, -0.002105712890625, 0.0081787109375, -0.01226806640625, -0.01055908203125, 0.017822265625, 0.01531982421875, 0.00112152099609375, -0.006439208984375, 0....

[ 242, 136, 3794, 919, 9059, 47, 10, 5303, 43079, 30098, 140992, 10248, 38937, 61924, 31913, 25073, 23351, 216960, 111159, 14671, 1019, 18, 17780, 60875, 566, 9405, 192983, 54, 1528, 7279, 7103, 5962, 11737, 13315, 123789, 2783, 254, 1914, 82...

[ 0.06109619140625, 0.0596923828125, 0.1591796875, 0.149658203125, 0.26171875, 0.0703125, 0.0035400390625, 0.113525390625, 0.1839599609375, 0.187744140625, 0.152587890625, 0.2132568359375, 0.11669921875, 0.128173828125, 0.15771484375, 0.2044677734375, 0.1029052734375, 0.1619873046875...

embed

78034649_c0

78034649

haskell

0

Title: Every Lens' is a Traversal'... how? Problem title: Every Lens' is a Traversal'... how? Tags: functor, applicative, haskell-lens, haskell Problem: Every Lens' is a Traversal'... how? Control.Lens.Tutorial says: type Traversal' a b = forall f . Applicative f => (b -> f b) -> (a -> f a) type Len...

Every Lens' is a Traversal'... how? Every Lens' is a Traversal'... how? functor applicative haskell-lens haskell Every Lens Traversal Applicative Functor Every Lens' is a Traversal'... how? Control.Lens.Tutorial says: I simply don't follow the logical sequence here. We know that every Applicative is...

[ 0.00567626953125, 0.0125732421875, -0.0118408203125, 0.010009765625, 0.005889892578125, 0.006256103515625, 0.00421142578125, -0.021240234375, 0.017333984375, -0.00970458984375, -0.0011749267578125, -0.0017547607421875, -0.006622314453125, 0.008544921875, -0.0091552734375, 0.00018501281...

[ 87769, 18226, 7, 3768, 83, 10, 4937, 814, 2317, 3642, 7477, 18770, 41816, 4935, 1556, 142508, 1977, 5659, 11048, 28670, 25, 27131, 866, 1755, 15665, 77275, 2301, 18, 28960, 62775, 944, 3688, 3714, 11907, 57143, 158, 37676, 93192 ]

[ 0.26171875, 0.271484375, 0.161376953125, 0.080322265625, 0.0811767578125, 0.069580078125, 0.167236328125, 0.242431640625, 0.2242431640625, 0.13623046875, 0.100830078125, 0.1815185546875, 0.165283203125, 0.161865234375, 0.10650634765625, 0.2127685546875, 0.138427734375, 0.150390625,...

embed

6600134_c0

6600134

haskell

0

Title: Why putStrLn end of line is out of thread lock? Problem title: Why putStrLn end of line is out of thread lock? Tags: io, haskell, multithreading Problem: Why putStrLn end of line is out of thread lock? When I use putStrLn txt from several threads in Haskell, it's possible to get the text intercalated with the en...

Why putStrLn end of line is out of thread lock? Why putStrLn end of line is out of thread lock? io haskell multithreading Why base-4.2.0.2 Why putStrLn end of line is out of thread lock? When I use putStrLn txt from several threads in Haskell, it's possible to get the text intercalated with the end of lines, but if I u...

[ 0.006744384765625, -0.003662109375, 0.0113525390625, 0.005767822265625, -0.004425048828125, 0.00775146484375, 0.0003910064697265625, 0.00885009765625, -0.016357421875, -0.01361083984375, -0.013427734375, -0.029541015625, 0.006927490234375, -0.01129150390625, 0.0057373046875, 0.01257324...

[ 44084, 3884, 71713, 866, 19, 3564, 111, 13315, 1810, 86997, 56776, 22995, 1556, 142508, 3869, 65847, 3647, 117904, 133684, 124326, 1295, 40368, 20625, 7722, 7986, 1940, 6827, 27686, 678, 124519, 4527, 3650, 37223, 41872, 11343, 43240, 7108, 4...

[ 0.0804443359375, 0.199951171875, 0.27734375, 0.1427001953125, 0.092041015625, 0.1700439453125, 0.1226806640625, 0.1427001953125, 0.145751953125, 0.1773681640625, 0.20751953125, 0.1177978515625, 0.0982666015625, 0.2314453125, 0.0654296875, 0.093505859375, 0.1822509765625, 0.15405273...

embed

32159328_c0

32159328

haskell

0

Title: Can csv-conduit read a string in csv form and parse it into some intermediate datatype? Problem title: Can csv-conduit read a string in csv form and parse it into some intermediate datatype? Tags: parsing, haskell, csv, conduit Problem: Can csv-conduit read a string in csv form and parse it into some intermediat...

Can csv-conduit read a string in csv form and parse it into some intermediate datatype? Can csv-conduit read a string in csv form and parse it into some intermediate datatype? parsing haskell csv conduit Can column1 column2 column3 column4 Row Just Can csv-conduit read a string in csv form and parse it into some interm...

[ -0.012939453125, -0.00186920166015625, 0.00799560546875, 0.059326171875, -0.00154876708984375, 0.0113525390625, 0.019287109375, -0.009765625, -0.00555419921875, 0.0087890625, -0.0380859375, -0.02587890625, -0.01416015625, 0.01043701171875, -0.007171630859375, -0.0025634765625, -0.014...

[ 4171, 20763, 334, 9, 2271, 112061, 12301, 79315, 23, 3173, 366, 184, 3934, 81814, 2182, 2053, 50986, 136, 6953, 1556, 142508, 120565, 3365, 316, 418, 304, 363, 617, 96190, 9563, 209806, 62270, 32102, 44954, 4527, 7225, 16454, 27198, 10644, ...

[ 0.09100341796875, 0.09930419921875, 0.2286376953125, 0.07415771484375, 0.113525390625, 0.232666015625, 0.2073974609375, 0.199951171875, 0.027435302734375, 0.138671875, 0.1541748046875, 0.0657958984375, 0.03533935546875, 0.1549072265625, 0.0560302734375, 0.098876953125, 0.193481445312...

embed

55651807_c0

55651807

haskell

0

Title: How to code the function drop without the prelude module in Haskell? Problem title: How to code the function drop without the prelude module in Haskell? Tags: recursion, haskell Problem: How to code the function drop without the prelude module in Haskell? I want to write some prelude functions by myself in Haske...

How to code the function drop without the prelude module in Haskell? How to code the function drop without the prelude module in Haskell? recursion haskell How Haskell TAKE DROP take1 x:xs x:take1 n-1 Input Output drop1 List How to code the function drop without the prelude module in Haskell? I want to write some prelu...

[ 0.0030670166015625, 0.0250244140625, -0.005523681640625, 0.0025482177734375, -0.00921630859375, 0.0019073486328125, 0.01019287109375, -0.0098876953125, 0.00927734375, -0.0135498046875, 0.01129150390625, -0.037841796875, -0.00799560546875, 0.01202392578125, 0.0103759765625, 0.0011138916...

[ 11249, 18151, 32354, 36069, 15490, 479, 822, 112, 88996, 20625, 142508, 195625, 1830, 1556, 60079, 647, 391, 148197, 5646, 1022, 425, 78219, 5759, 360, 13538, 418, 32036, 23, 33022, 35978, 28219, 81979, 21771, 44402 ]

[ 0.027069091796875, 0.1923828125, 0.1824951171875, 0.29443359375, 0.12841796875, 0.092529296875, 0.1632080078125, 0.1165771484375, 0.1649169921875, 0.127685546875, 0.231201171875, 0.1190185546875, 0.045684814453125, 0.10888671875, 0.156494140625, 0.09228515625, 0.1107177734375, 0.25...

embed

58695184_c0

58695184

haskell

0

Title: Couldn't match expected type `[Integer]' with actual type `Bool' Problem title: Couldn't match expected type `[Integer]' with actual type `Bool' Tags: haskell, functional-programming, list, recursion Problem: Couldn't match expected type `[Integer]' with actual type `Bool' I'm tryin...

Couldn't match expected type `[Integer]' with actual type `Bool' Couldn't match expected type `[Integer]' with actual type `Bool' haskell functional-programming list recursion Couldn Integer Bool _:s Couldn't match expected type `[Integer]' with actual type `Bool' I'm trying to iterate rec...

[ -0.00543212890625, -0.00445556640625, -0.01300048828125, 0.01385498046875, -0.005706787109375, -0.0133056640625, -0.0037384033203125, 0.008544921875, -0.00057220458984375, 0.0167236328125, 0.0223388671875, -0.020751953125, 0.0169677734375, 0.006011962890625, -0.002166748046875, -0.0069...

[ 191147, 3768, 18, 14858, 84751, 10644, 4153, 67, 1505, 678, 8561, 12647, 929, 1556, 142508, 123309, 28966, 5303, 195625, 1830, 19, 44401, 2460, 101, 12, 7, 31577, 8560, 5844, 645, 175199, 2174, 756, 142424, 105950, 757, 18499, 566, 20949, ...

[ 0.1060791015625, 0.11083984375, 0.08709716796875, 0.1822509765625, 0.1649169921875, 0.164794921875, 0.056640625, 0.143798828125, 0.1334228515625, 0.09124755859375, 0.1365966796875, 0.10113525390625, 0.162353515625, 0.10400390625, 0.1881103515625, 0.15283203125, 0.08258056640625, 0....

embed

18214179_c0

18214179

haskell

0

Title: Combining lexer and parser in a parser combinator Problem title: Combining lexer and parser in a parser combinator Tags: parsing, parser-combinators, haskell, uu-parsinglib Problem: Combining lexer and parser in a parser combinator I'm using uu-parsinglib , but I think the following question is parser combinator...

Combining lexer and parser in a parser combinator Combining lexer and parser in a parser combinator parsing parser-combinators haskell uu-parsinglib Combining MyToken AST LineColPos Combining lexer and parser in a parser combinator I'm using uu-parsinglib , but I think the following question is parser combinator generi...

[ -0.0274658203125, 0.0023040771484375, 0.00433349609375, 0.020263671875, -0.01177978515625, 0.021728515625, 0.013671875, -0.0196533203125, -0.0028076171875, -0.048583984375, 0.0101318359375, 0.033203125, 0.0185546875, -0.00421142578125, -0.008544921875, -0.00189971923828125, -0.014465...

[ 106935, 592, 95, 34058, 136, 366, 2189, 23, 22321, 1290, 6953, 277, 19155, 22230, 1556, 142508, 2051, 2500, 5612, 2646, 7763, 1098, 48963, 16777, 78457, 7192, 17368, 9655, 189534, 27781, 678, 915, 5267, 425, 27489, 5303, 47, 84694, 10644, ...

[ 0.2266845703125, 0.0177459716796875, 0.1610107421875, 0.292724609375, 0.1319580078125, 0.1890869140625, 0.2216796875, 0.06353759765625, 0.24755859375, 0.170166015625, 0.051727294921875, 0.05242919921875, 0.2138671875, 0.0914306640625, 0.079833984375, 0.17626953125, 0.17138671875, 0...

embed

24158551_c0

24158551

haskell

0

Title: How to use random numbers within recursion? Problem title: How to use random numbers within recursion? Tags: haskell, random, recursion Problem: How to use random numbers within recursion? I'm trying to select a random element from a list but that'll make the function impure thus fail to compile. What should I d...

How to use random numbers within recursion? How to use random numbers within recursion? haskell random recursion How Jabberwocky Integer Syllables Middle Consonant Vowel Ending How to use random numbers within recursion? I'm trying to select a random element from a list but that'll make the function impure thus fail to...

[ -0.0281982421875, 0.01611328125, 0.01239013671875, -0.0159912109375, -0.00909423828125, 0.032958984375, -0.0040283203125, -0.0196533203125, -0.00885009765625, -0.0322265625, 0.02490234375, -0.031005859375, -0.01165771484375, -0.00128936767578125, 0.0274658203125, -0.008056640625, -0....

[ 11249, 47, 4527, 96759, 101935, 28032, 195625, 1830, 32, 1556, 142508, 60200, 1297, 3613, 25160, 44401, 1165, 13566, 102256, 1681, 5346, 8420, 357, 87, 31577, 36849, 12830, 5303, 32354, 21980, 3408, 35782, 9969, 1340, 5844, 26946, 17780, 2263...

[ 0.0948486328125, 0.1043701171875, 0.1522216796875, 0.2191162109375, 0.202392578125, 0.1710205078125, 0.2340087890625, 0.146728515625, 0.008056640625, 0.0938720703125, 0.197265625, 0.065673828125, 0.0721435546875, 0.0926513671875, 0.120361328125, 0.1142578125, 0.0675048828125, 0.032...

embed

25255289_c0

25255289

haskell

0

Title: Idiomatic way to express general computations in Haskell Problem title: Idiomatic way to express general computations in Haskell Tags: symbolic-computation, haskell Problem: Idiomatic way to express general computations in Haskell There must exist a good idiomatic way to express general computations in Haskell o...

Idiomatic way to express general computations in Haskell Idiomatic way to express general computations in Haskell symbolic-computation haskell Idiomatic Haskell Computation Double Square Scale Idiomatic way to express general computations in Haskell There must exist a good idiomatic way to express general computations ...

[ -0.0206298828125, 0.0026702880859375, 0.0098876953125, 0.01470947265625, 0.010986328125, 0.0220947265625, -0.0036163330078125, -0.0096435546875, 0.0091552734375, -0.0267333984375, -0.0257568359375, -0.00872802734375, 0.005157470703125, -0.009765625, -0.0113525390625, 0.000732421875, ...

[ 5670, 47148, 3917, 36510, 4537, 181135, 5256, 20625, 142508, 128201, 277, 7077, 1556, 159415, 107172, 68305, 152653, 8110, 32316, 4127, 49666, 9523, 10644, 17366, 831, 1380, 1257, 903, 2186, 2870, 30563, 97751, 1363, 41143, 1884, 112033, 9803, ...

[ 0.1407470703125, 0.1104736328125, 0.06585693359375, 0.143310546875, 0.1597900390625, 0.195068359375, 0.047393798828125, 0.1319580078125, 0.2347412109375, 0.13818359375, 0.0159912109375, 0.0889892578125, 0.1121826171875, 0.13134765625, 0.0352783203125, 0.059326171875, 0.064697265625, ...

embed

53460700_c0

53460700

haskell

0

Title: Concatenate to a list of string another string Problem title: Concatenate to a list of string another string Tags: concatenation, haskell, string, list Problem: Concatenate to a list of string another string The below code gives back a list of String but I want it work on multiple cases. The problem is that I ca...

Concatenate to a list of string another string Concatenate to a list of string another string concatenation haskell string list Concatenate Char x:xs Concatenate to a list of string another string The below code gives back a list of String but I want it work on multiple cases. The problem is that I can't create the sam...

[ 0.00994873046875, -0.006683349609375, -0.0079345703125, 0.01116943359375, -0.00933837890625, 0.0003681182861328125, 0.0216064453125, 0.008544921875, 0.029541015625, 0.005401611328125, 0.020263671875, -0.02880859375, 0.0081787109375, 0.00897216796875, -0.0135498046875, -0.00367736816406...

[ 1657, 33478, 76, 67, 47, 5303, 79315, 15700, 158, 4460, 33, 1556, 142508, 21656, 1022, 425, 35064, 18151, 76199, 4420, 23351, 214, 3444, 4488, 98, 48716, 50218, 2967, 28282, 5701, 24763, 16750, 195625, 1830, 1528, 25632, 51713, 60552, 18, ...

[ 0.07708740234375, 0.1966552734375, 0.1427001953125, 0.07623291015625, 0.0926513671875, 0.1451416015625, 0.1898193359375, 0.06671142578125, 0.098388671875, 0.23095703125, 0.0997314453125, 0.0908203125, 0.1776123046875, 0.108642578125, 0.0240478515625, 0.05010986328125, 0.0538024902343...

embed

22003307_c0

22003307

haskell

0

Title: Depth of a tree (Haskell) Problem title: Depth of a tree (Haskell) Tags: haskell, tree Problem: Depth of a tree (Haskell) I'm trying to figure out how to calculate the depth of a general tree in Haskell. I can figure out the solution for simple binary trees, but not for general trees with any number of leaves. H...

Depth of a tree (Haskell) Depth of a tree (Haskell) haskell tree Depth Haskell Tree Nil Node Depth of a tree (Haskell) I'm trying to figure out how to calculate the depth of a general tree in Haskell. I can figure out the solution for simple binary trees, but not for general trees with any number of leaves. Here's the ...

[ 0.02294921875, 0.02294921875, 0.0027008056640625, -0.00494384765625, 0.02294921875, 0.0084228515625, -0.01220703125, -0.0245361328125, 0.01385498046875, -0.040771484375, 0.002685546875, -0.04638671875, 0.00096893310546875, 0.0177001953125, 0.0025634765625, 0.01239013671875, 0.0286865...

[ 262, 254, 927, 111, 10, 53201, 6495, 7, 142508, 1556, 20625, 101344, 77175, 438, 112, 31577, 26366, 3642, 74481, 67, 70, 168867, 4537, 23, 29806, 8781, 2394, 6635, 1360, 959, 678, 14012, 31358, 18151, 2811, 40383, 90, 9082, 70541, 5303, ...

[ 0.184814453125, 0.2152099609375, 0.1591796875, 0.09039306640625, 0.01300048828125, 0.255859375, 0.09161376953125, 0.06951904296875, 0.239013671875, 0.1094970703125, 0.1292724609375, 0.1949462890625, 0.1943359375, 0.117919921875, 0.023468017578125, 0.015777587890625, 0.0809326171875, ...

embed

69465400_c1

69465400

haskell

1

nub rankings main :: IO () main = interact (unlines . map show . solution . map (map read . words) . getInputs . lines) Test Case in GHCI :l "solution" let i = "7\n100 100 50 40 40 20 10\n4\n5 25 50 120" solution i // "6\n4\n2\n1\n" Specific questions I have: Will the duplicateRemovedRankings variable be calculated on...

[ -0.02392578125, 0.01519775390625, -0.004913330078125, -0.023193359375, -0.0022430419921875, 0.0064697265625, 0.00823974609375, -0.0062255859375, 0.01263427734375, 0.016845703125, -0.020751953125, -0.00006031990051269531, 0.0311279296875, -0.01519775390625, -0.0216064453125, 0.001815795...

[ 315, 275, 77918, 7, 5201, 1984, 17780, 2203, 78974, 309, 59801, 22288, 7639, 29806, 62346, 12301, 34153, 2046, 4153, 7077, 124519, 8647, 43731, 41877, 17304, 141, 166589, 17, 966, 3559, 805, 836, 1112, 209, 617, 758, 714, 5390, 910, 20905...

[ 0.218994140625, 0.2337646484375, 0.311279296875, 0.1009521484375, 0.18310546875, 0.041259765625, 0.208251953125, 0.056610107421875, 0.2178955078125, 0.05206298828125, 0.1346435546875, 0.16845703125, 0.0555419921875, 0.139892578125, 0.1451416015625, 0.09442138671875, 0.0684814453125, ...

embed

18775712_c1

18775712

haskell

1

-insensitive-1.1 Downloading http-types-0.8.1... Building void-0.6.1... Building unordered-containers-0.2.3.2... Building lifted-base-0.2.1.0... Confi ! Push rejected, failed to compile Multipack app And every time, it stops on a different line and a different place in the line. I've tried it with various buildpacks an...

[ -0.01708984375, 0.011962890625, -0.005889892578125, 0.00970458984375, -0.005126953125, 0.0203857421875, 0.0023651123046875, -0.0272216796875, 0.005889892578125, 0.01397705078125, -0.0108642578125, -0.031494140625, 0.005035400390625, 0.02294921875, -0.000732421875, 0.0223388671875, 0....

[ 73, 176302, 13, 92134, 4857, 1621, 50986, 23320, 206730, 104919, 2292, 173245, 51, 80596, 98102, 1314, 133684, 107033, 60520, 297, 37382, 102107, 139403, 114405, 34590, 89829, 165523, 9969, 1340, 19335, 29102, 4027, 11907, 1733, 7279, 12921, 13...

[ 0.08154296875, 0.249267578125, 0.072021484375, 0.120849609375, 0.1473388671875, 0.1143798828125, 0.13671875, 0.000274658203125, 0.13232421875, 0.151123046875, 0.1209716796875, 0.1123046875, 0.0086669921875, 0.1563720703125, 0.126953125, 0.016845703125, 0.070068359375, 0.05880737304...

embed

5132350_c0

5132350

haskell

0

Title: How do Haskell compilers decide whether to allocate on the heap or the stack? Problem title: How do Haskell compilers decide whether to allocate on the heap or the stack? Tags: haskell, heap-memory, stack-memory, memory-management Problem: How do Haskell compilers decide whether to allocate on the heap or the st...

How do Haskell compilers decide whether to allocate on the heap or the stack? How do Haskell compilers decide whether to allocate on the heap or the stack? haskell heap-memory stack-memory memory-management How Haskell How do Haskell compilers decide whether to allocate on the heap or the stack? Haskell doesn't feature...

[ 0.0120849609375, 0.0189208984375, 0.005950927734375, 0.00836181640625, -0.00750732421875, 0.004486083984375, -0.0181884765625, 0.01214599609375, -0.0037078857421875, -0.00921630859375, 0.00140380859375, -0.03759765625, 0.027587890625, 0.0264892578125, 0.004058837890625, 0.0024871826171...

[ 11249, 20625, 142508, 9969, 34759, 28288, 36766, 24286, 33478, 98, 764, 2631, 707, 177261, 1556, 109005, 98323, 87140, 22027, 18, 60213, 143726, 24365, 756, 36746, 115081, 34292, 110, 162520, 91067, 54529, 402, 42486, 205794, 139392, 18151, 144...

[ 0.0753173828125, 0.1497802734375, 0.271240234375, 0.150146484375, 0.1734619140625, 0.1551513671875, 0.016571044921875, 0.189697265625, 0.1337890625, 0.1312255859375, 0.1766357421875, 0.180419921875, 0.080078125, 0.217041015625, 0.1197509765625, 0.10986328125, 0.192138671875, 0.1281...

embed

45849782_c1

45849782

haskell

1

" putStrLn (show isNum ++ " is what percent of " ++ show ofNum ++ "?\n" ) putStr "> " ans <- getLine submitStringAnswer (ans, percentStr ++ "%") submitStringAnswer :: (String, String) -> IO () submitStringAnswer (myAns, correctAns) = do if myAns == correctAns then putStrLn "Congratz!" else do putStrLn ("Sorry the corre...

[ -0.015869140625, -0.0203857421875, -0.00775146484375, 0.015380859375, 0.00604248046875, 0.02392578125, -0.0064697265625, -0.0177001953125, 0.002105712890625, 0.0091552734375, -0.0128173828125, -0.00156402587890625, 0.00958251953125, -0.00555419921875, -0.01953125, 0.006866455078125, ...

[ 3884, 71713, 866, 19, 15, 31374, 83, 839, 316, 37223, 2367, 33297, 111, 7639, 58, 70902, 7210, 2046, 93232, 137447, 214, 7251, 7, 6488, 10133, 6, 3949, 23351, 16, 17780, 1176, 4, 26785, 759, 11935, 71867, 169, 158240, 1294, 70, 35166, ...

[ 0.242919921875, 0.31298828125, 0.12255859375, 0.1416015625, 0.009613037109375, 0.1761474609375, 0.1661376953125, 0.035400390625, 0.179443359375, 0.232666015625, 0.0262908935546875, 0.302001953125, 0.2191162109375, 0.1685791015625, 0.008941650390625, 0.0252532958984375, 0.13818359375,...

embed

49084482_c0

49084482

haskell

0

Title: Where is class Ord defined in GHC library? Problem title: Where is class Ord defined in GHC library? Tags: haskell, ghc Problem: Where is class Ord defined in GHC library? Source for GHC.Base has the note at the beginning saying in part The overall structure of the GHC Prelude is a bit tricky... So the rough str...

Where is class Ord defined in GHC library? Where is class Ord defined in GHC library? haskell ghc Where Ord GHC GHC.Base Prelude GHC.Prim Has GHC.Prim.hi-boot GHC.Prim.hi Classes Functor Monad Types Bool Ordering Char Where is class Ord defined in GHC library? Source for GHC.Base has the note at the beginning saying in...

[ 0.009521484375, 0.0068359375, 0.01611328125, -0.0086669921875, 0.0157470703125, 0.0230712890625, -0.0000095367431640625, -0.0118408203125, -0.00250244140625, -0.000591278076171875, 0.0010986328125, -0.059326171875, 0.003387451171875, -0.00933837890625, -0.0032501220703125, 0.0238037109...

[ 78662, 18507, 35379, 61924, 71, 527, 73265, 35773, 1294, 23, 1556, 142508, 31380, 238, 63473, 1914, 822, 112, 145111, 979, 80765, 35014, 28670, 18770, 60331, 60457, 2460, 929, 81206, 214, 21656, 77641, 20537, 31344, 11435, 56112, 18, 51584, ...

[ 0.0838623046875, 0.2164306640625, 0.2919921875, 0.1689453125, 0.050933837890625, 0.080322265625, 0.201904296875, 0.1119384765625, 0.0133056640625, 0.0250244140625, 0.0875244140625, 0.17578125, 0.090087890625, 0.09063720703125, 0.12890625, 0.06365966796875, 0.14404296875, 0.12414550...

embed

27924699_c0

27924699

haskell

0

Title: Unusual Kinds and Data Constructors Problem title: Unusual Kinds and Data Constructors Tags: type-kinds, polymorphism, data-kinds, dependent-type, haskell Problem: Unusual Kinds and Data Constructors I don't know how I didn't notice this, but data constructors and function definitions alike can't use types with ...

Unusual Kinds and Data Constructors Unusual Kinds and Data Constructors type-kinds polymorphism data-kinds dependent-type haskell Unusual Kinds Data Constructors XPolyKinds LANGUAGE DataKinds KindSignatures Nat Foo Fails Expected Unusual Kinds and Data Constructors I don't know how I didn't notice this, but data constr...

[ 0.004364013671875, 0.018310546875, -0.013427734375, -0.01953125, 0.01043701171875, -0.0024261474609375, -0.0111083984375, 0.005340576171875, -0.002655029296875, -0.0299072265625, 0.00921630859375, -0.0517578125, 0.009033203125, -0.0035247802734375, 0.0019989013671875, -0.00018501281738...

[ 56979, 64010, 27435, 136, 11809, 82084, 18770, 7, 10644, 68347, 35874, 178851, 2053, 108750, 50986, 1556, 142508, 45005, 48381, 605, 7250, 98064, 218723, 11, 68875, 9572, 31, 190355, 60075, 13, 64549, 25251, 32354, 80934, 5062, 831, 18, 4527,...

[ 0.0863037109375, 0.1365966796875, 0.1439208984375, 0.04974365234375, 0.0697021484375, 0.1339111328125, 0.12353515625, 0.015869140625, 0.1641845703125, 0.1700439453125, 0.064453125, 0.1365966796875, 0.1212158203125, 0.09808349609375, 0.1519775390625, 0.06201171875, 0.181640625, 0.01...

embed

4359521_c1

4359521

haskell

1

Parse any single character item = P $ \s -> case s of [] -> Nothing (c:cs) -> Just (c,cs) -- (+++) parse either using p or else using q infixr 5 +++ (+++) :: Parser a -> Parser a -> Parser a p +++ q = P $ \s -> listToMaybe [ x | Just x <- [parse p s, parse q s]] -- (p >*> f) parse using p to produce a. -- Then parse u...

[ -0.00653076171875, 0.0228271484375, 0.00958251953125, 0.00225830078125, -0.00171661376953125, 0.0179443359375, -0.006561279296875, -0.032958984375, 0.0223388671875, 0.00775146484375, 0.01263427734375, -0.007781982421875, -0.00653076171875, 0.006011962890625, -0.0177001953125, 0.0129394...

[ 2392, 184, 2499, 11001, 62816, 35735, 2203, 436, 3650, 6, 41872, 7, 33079, 7225, 91, 111, 268, 182747, 238, 12, 4439, 9563, 4210, 86409, 366, 40101, 17368, 915, 707, 37076, 8096, 23, 55923, 42, 190, 1984, 2189, 10, 5303, 7763, 82419, ...

[ 0.249267578125, 0.218994140625, 0.1226806640625, 0.1815185546875, 0.228515625, 0.2259521484375, 0.03216552734375, 0.16259765625, 0.16357421875, 0.00518798828125, 0.1043701171875, 0.1060791015625, 0.0260162353515625, 0.1539306640625, 0.13037109375, 0.1031494140625, 0.0091552734375, ...

embed

44838547_c0

44838547

haskell

0

Title: How to use replicate to generate a matrix Problem title: How to use replicate to generate a matrix Tags: haskell Problem: How to use replicate to generate a matrix I was curious how to use replicate in Haskell to create a list of integers that repeated a set of numbers. This is for a homework and the rules kind ...

How to use replicate to generate a matrix How to use replicate to generate a matrix haskell How How to use replicate to generate a matrix I was curious how to use replicate in Haskell to create a list of integers that repeated a set of numbers. This is for a homework and the rules kind of confuse me to begin with but e...

[ 0.0020904541015625, 0.00176239013671875, -0.004150390625, 0.0201416015625, -0.015869140625, 0.01141357421875, -0.0189208984375, 0.015869140625, 0.006134033203125, -0.04931640625, -0.0296630859375, -0.032958984375, 0.0118408203125, 0.02587890625, -0.034423828125, -0.01904296875, 0.005...

[ 11249, 4527, 143126, 67, 47, 139392, 10, 50944, 425, 1556, 142508, 193844, 3642, 23, 20625, 28282, 5303, 892, 26255, 119140, 5423, 101935, 100, 5368, 18244, 91736, 55681, 85590, 3444, 615, 1126, 483, 20028, 16503, 1660, 12638, 1733, 26484, ...

[ 0.0643310546875, 0.1363525390625, 0.278564453125, 0.2225341796875, 0.052886962890625, 0.2137451171875, 0.0333251953125, 0.2091064453125, 0.1533203125, 0.1400146484375, 0.2274169921875, 0.026336669921875, 0.032958984375, 0.04486083984375, 0.13134765625, 0.1197509765625, 0.160400390625...

embed

4733019_c0

4733019

haskell

0

Title: How many arguments takes the foldr function of Haskell? Problem title: How many arguments takes the foldr function of Haskell? Tags: haskell, function, fold, arguments Problem: How many arguments takes the foldr function of Haskell? I am new to Haskell and I am reading the book "Real World Haskell" . In the Chap...

How many arguments takes the foldr function of Haskell? How many arguments takes the foldr function of Haskell? haskell function fold arguments How Haskell Bool y:ys x:y How many arguments takes the foldr function of Haskell? I am new to Haskell and I am reading the book "Real World Haskell" . In the Chapter 4 of the b...

[ -0.0003185272216796875, 0.00726318359375, -0.01141357421875, -0.0026702880859375, 0.0013885498046875, 0.0172119140625, -0.0113525390625, 0.00836181640625, 0.012939453125, -0.01416015625, -0.005615234375, -0.037841796875, -0.006805419921875, 0.0196533203125, -0.00665283203125, -0.002807...

[ 11249, 5941, 10750, 7, 51776, 18344, 7569, 32354, 111, 20625, 142508, 1556, 42822, 2460, 929, 113, 4778, 1022, 53, 16454, 12877, 68996, 6661, 201, 26458, 81979, 456, 434, 18781, 21115, 75358, 17368, 120709, 22591, 1010, 29806, 138, 61475, 3...

[ 0.06103515625, 0.135498046875, 0.265380859375, 0.14111328125, 0.14794921875, 0.1702880859375, 0.24755859375, 0.1849365234375, 0.06536865234375, 0.138916015625, 0.254150390625, 0.1231689453125, 0.241943359375, 0.0635986328125, 0.1646728515625, 0.055938720703125, 0.0718994140625, 0.0...

embed

8852642_c1

8852642

haskell

1

MySnaplet -> Snaplet SubSnaplet instead. There is a class+instance like in 3. that provides a Lens MySnaplet (Snaplet SubSnaplet) . The class+instance requires a Lens (Snaplet MySnaplet) (Snaplet SubSnaplet) . The class+instance assumes that MySnaplet is the "top Snaplet" of the application, and requires an absolute l...

[ -0.01708984375, 0.01385498046875, 0.0179443359375, -0.0179443359375, -0.028564453125, 0.0010223388671875, -0.00506591796875, 0.00408935546875, 0.019775390625, -0.0166015625, -0.0203857421875, 0.0263671875, -0.006988525390625, 0.01287841796875, 0.005462646484375, -0.0201416015625, 0.0...

[ 2646, 294, 76, 54572, 33079, 121190, 1974, 8273, 64457, 8622, 18507, 1328, 116071, 1884, 1031, 87344, 18226, 7, 73, 144570, 41591, 13784, 38415, 89931, 3098, 239879, 8110, 70, 876, 60331, 71, 1957, 91067, 8562, 10422, 12301, 191, 787, 2174,...

[ 0.1959228515625, 0.09222412109375, 0.18994140625, 0.281494140625, 0.0439453125, 0.2479248046875, 0.261474609375, 0.2125244140625, 0.11181640625, 0.00677490234375, 0.24169921875, 0.125, 0.1436767578125, 0.02471923828125, 0.1063232421875, 0.1190185546875, 0.20654296875, 0.08715820312...

embed

57027138_c0

57027138

haskell

0

Title: Is my understanding of a reducible expression i.e. redex correct? Problem title: Is my understanding of a reducible expression i.e. redex correct? Tags: redex, haskell, functional-programming Problem: Is my understanding of a reducible expression i.e. redex correct? Programming in Haskell by Hutton says: An expr...

Is my understanding of a reducible expression i.e. redex correct? Is my understanding of a reducible expression i.e. redex correct? redex haskell functional-programming i.e Is my understanding of a reducible expression i.e. redex correct? Programming in Haskell by Hutton says: Is a reducible expression i.e. redex exact...

[ -0.007659912109375, -0.010009765625, 0.012451171875, 0.0262451171875, 0.0003204345703125, 0.0208740234375, -0.01397705078125, 0.002410888671875, -0.00469970703125, 0.0059814453125, 0.01287841796875, -0.038818359375, 0.006561279296875, 0.0089111328125, 0.00341796875, 0.00457763671875, ...

[ 100094, 74906, 28236, 125195, 15265, 425, 26785, 759, 10, 1556, 142508, 123309, 28966, 27958, 23, 20625, 97595, 1507, 66161, 32354, 38415, 959, 16750, 15700, 9351, 6492, 85, 628, 32166, 5510, 219836, 113857, 151575, 2878, 9709, 46572 ]

[ 0.1129150390625, 0.2022705078125, 0.216064453125, 0.2489013671875, 0.2137451171875, 0.25390625, 0.1236572265625, 0.02056884765625, 0.041534423828125, 0.0633544921875, 0.215576171875, 0.0860595703125, 0.07196044921875, 0.09490966796875, 0.0023193359375, 0.07012939453125, 0.01251220703...

embed

58684085_c0

58684085

haskell

0

Title: Number conversion in haskell Problem title: Number conversion in haskell Tags: haskell Problem: Number conversion in haskell The following code gives me an error which is somehow related to any type conversion issue: testfn:: Float -> Integer testfn n = 4.99 * fromIntegral(ceiling(n * (1.0/4.0))) calculate_price...

Number conversion in haskell Number conversion in haskell haskell the Number Float Integer calculate_price Fractional Number conversion in haskell The following code gives me an error which is somehow related to any type conversion issue: I'm new to haskell and I do not really understand why a multiplication is such a ...

[ -0.029052734375, -0.0155029296875, 0.00469970703125, -0.001007080078125, 0.00701904296875, -0.0002899169921875, -0.023193359375, 0.00775146484375, 0.00982666015625, 0.001922607421875, -0.039306640625, -0.021240234375, 0.0012664794921875, 0.0050048828125, -0.000591278076171875, 0.004730...

[ 103332, 142477, 23, 1556, 142508, 38699, 257, 44401, 74481, 5293, 329, 7868, 10763, 25632, 18151, 76199, 163, 18499, 209303, 62548, 2499, 10644, 31089, 3525, 28219, 15400, 127664, 1363, 83, 6044, 10, 24503, 9969, 1340, 678, 31380, 238, 116, ...

[ 0.2080078125, 0.223388671875, 0.09442138671875, 0.181640625, 0.234375, 0.1636962890625, 0.0628662109375, 0.202392578125, 0.1046142578125, 0.130615234375, 0.1016845703125, 0.1343994140625, 0.052734375, 0.0711669921875, 0.1141357421875, 0.001220703125, 0.0186004638671875, 0.201171875...

embed

58983734_c0

58983734

haskell

0

Title: Processing a list of states to a state with a list value Problem title: Processing a list of states to a state with a list value Tags: haskell Problem: Processing a list of states to a state with a list value I am new to Haskell and I am trying to understand Monads and States right now. I have been tasked with w...

Processing a list of states to a state with a list value Processing a list of states to a state with a list value haskell Processing State.State Processing a list of states to a state with a list value I am new to Haskell and I am trying to understand Monads and States right now. I have been tasked with writing a funct...

[ -0.012451171875, -0.01007080078125, -0.0120849609375, 0.006622314453125, -0.0150146484375, -0.0015106201171875, 0.0034027099609375, -0.0030059814453125, 0.01263427734375, -0.00457763671875, 0.0155029296875, 0.00799560546875, -0.01031494140625, 0.0218505859375, -0.013916015625, -0.01330...

[ 123996, 214, 5303, 117249, 47, 11341, 678, 34292, 10, 1556, 142508, 22836, 135206, 20625, 28219, 60331, 6468, 136, 46684, 66211, 32562, 32354, 25632, 138256, 208124, 41653, 9319, 4734, 1632, 169022, 903, 86595, 3444, 121293, 159029, 3564, 2704,...

[ 0.1805419921875, 0.0360107421875, 0.193115234375, 0.230712890625, 0.1524658203125, 0.205810546875, 0.06884765625, 0.1802978515625, 0.0128173828125, 0.143310546875, 0.2147216796875, 0.2113037109375, 0.17431640625, 0.1097412109375, 0.0865478515625, 0.1524658203125, 0.130859375, 0.022...

embed

12451906_c0

12451906

haskell

0

Title: Overload resolution during JSON parsing in Haskell Problem title: Overload resolution during JSON parsing in Haskell Tags: typeclass, parsing, overloading, haskell Problem: Overload resolution during JSON parsing in Haskell I am reading "Real World Haskell" (great book) and I have some confusion about how the co...

Overload resolution during JSON parsing in Haskell Overload resolution during JSON parsing in Haskell typeclass parsing overloading haskell JSONError Overload JSON Haskell JValue Either Bool JBool Right Left JString Overload resolution during JSON parsing in Haskell I am reading "Real World Haskell" (great book) and I ...

[ -0.00860595703125, 0.00634765625, -0.00173187255859375, 0.00031280517578125, -0.0059814453125, 0.01141357421875, -0.0191650390625, -0.00665283203125, -0.003875732421875, 0.01055908203125, -0.0218505859375, -0.03466796875, 0.00732421875, -0.018310546875, 0.00061798095703125, 0.009094238...

[ 9578, 63033, 158839, 20271, 821, 58627, 366, 20625, 142508, 6953, 10644, 67413, 645, 1556, 18468, 856, 50770, 2460, 929, 12647, 90911, 636, 2480, 71713, 23, 16454, 68996, 6661, 12877, 169463, 3642, 9969, 34759, 36849, 7, 297, 32354, 18507, ...

[ 0.13525390625, 0.28466796875, 0.2205810546875, 0.06072998046875, 0.134521484375, 0.218994140625, 0.127685546875, 0.138671875, 0.2427978515625, 0.0341796875, 0.17724609375, 0.183837890625, 0.1475830078125, 0.1253662109375, 0.06097412109375, 0.1405029296875, 0.1982421875, 0.053466796...

embed

17719620_c0

17719620

haskell

0

Title: While loop in Haskell with a condition Problem title: While loop in Haskell with a condition Tags: loops, haskell, while-loop Problem: While loop in Haskell with a condition I'm having a little Haskell Situation over here. I'm trying to write two functions with monads. First one is supposed to iterate through a ...

While loop in Haskell with a condition While loop in Haskell with a condition loops haskell while-loop While Haskell Test Bool power2 Please While loop in Haskell with a condition I'm having a little Haskell Situation over here. I'm trying to write two functions with monads. First one is supposed to iterate through a f...

[ 0, -0.002838134765625, 0.006072998046875, 0.0303955078125, 0.00750732421875, 0.015869140625, 0.00506591796875, -0.003021240234375, -0.0087890625, -0.01190185546875, 0.0230712890625, 0.005767822265625, -0.0341796875, 0.0166015625, 0.0054931640625, 0.005218505859375, 0.0096435546875, ...

[ 51404, 40956, 23, 20625, 142508, 678, 10, 35431, 1556, 12960, 28354, 8647, 2460, 929, 14537, 304, 30607, 10176, 53577, 31577, 33022, 6626, 32354, 2667, 712, 7, 134598, 8560, 8305, 4989, 29568, 107730, 140992, 77648, 4527, 5646, 14012, 237, ...

[ 0.22509765625, 0.228759765625, 0.048736572265625, 0.1422119140625, 0.23388671875, 0.1463623046875, 0.098876953125, 0.274169921875, 0.13623046875, 0.2352294921875, 0.2044677734375, 0.150390625, 0.056121826171875, 0.154052734375, 0.168701171875, 0.10528564453125, 0.1314697265625, 0.0...

embed

18577735_c0

18577735

haskell

0

Title: Can’t load libgd when trying to use Graphics.GD on OS X Problem title: Can’t load libgd when trying to use Graphics.GD on OS X Tags: ghci, haskell, macos Problem: Can’t load libgd when trying to use Graphics.GD on OS X I’m trying to use Graphics.GD : Prelude> import Graphics.GD Prelude Graphics.GD> x <- loadPngF...

Can’t load libgd when trying to use Graphics.GD on OS X Can’t load libgd when trying to use Graphics.GD on OS X ghci haskell macos Graphics.GD Can Prelude test.png Loading array-0.4.0.1 deepseq-1.3.0.1 bytestring-0.10.0.2 gd-3000.7.3 DLL libgd.dylib Can’t load libgd when trying to use Graphics.GD on OS X I’m trying to ...

[ -0.01434326171875, 0.01104736328125, -0.009521484375, -0.0014495849609375, -0.01519775390625, 0.00433349609375, -0.00933837890625, -0.00665283203125, -0.026123046875, 0.00118255615234375, -0.000431060791015625, -0.047607421875, -0.0037078857421875, -0.00762939453125, 0.0038299560546875, ...

[ 4171, 18, 72367, 25474, 177, 71, 31577, 4527, 189682, 7, 5, 88668, 11787, 1193, 31380, 318, 1556, 142508, 7840, 1914, 822, 112, 3034, 128468, 228006, 10298, 121254, 102014, 53894, 184, 864, 91693, 10179, 133684, 706, 36605, 145515, 23708, 1...

[ 0.097900390625, 0.0799560546875, 0.18212890625, 0.1783447265625, 0.1658935546875, 0.21044921875, 0.059783935546875, 0.05438232421875, 0.20361328125, 0.072265625, 0.004913330078125, 0.267822265625, 0.1339111328125, 0.12744140625, 0.1143798828125, 0.1600341796875, 0.0614013671875, 0....

embed

43941551_c0

43941551

haskell

0

Title: Explicit Purely-Functional Data-Structure For Difference Lists Problem title: Explicit Purely-Functional Data-Structure For Difference Lists Tags: data-structures, haskell, purely-functional, difference-lists Problem: Explicit Purely-Functional Data-Structure For Difference Lists In Haskell, difference lists , i...

Explicit Purely-Functional Data-Structure For Difference Lists Explicit Purely-Functional Data-Structure For Difference Lists data-structures haskell purely-functional difference-lists Explicit Purely-Functional Data-Structure Difference Lists Explicit Purely-Functional Data-Structure For Difference Lists In Haskell, d...

[ 0.01953125, 0.005126953125, -0.0018310546875, 0.0135498046875, 0.006439208984375, 0.025634765625, -0.008544921875, -0.010009765625, -0.00811767578125, -0.027587890625, -0.00147247314453125, -0.0035858154296875, -0.00567626953125, 0.00830078125, 0.003021240234375, 0.0169677734375, 0.0...

[ 60075, 60923, 118233, 538, 97249, 10763, 11809, 71713, 18190, 1326, 803, 18234, 6620, 32036, 2053, 137656, 1556, 142508, 34166, 137175, 60212, 6562, 20625, 5303, 48903, 29479, 32354, 166577, 28670, 136, 242554, 8110, 33636, 209303, 13909, 98323, ...

[ 0.06280517578125, 0.1484375, 0.094482421875, 0.04718017578125, 0.114990234375, 0.0736083984375, 0.0904541015625, 0.134033203125, 0.120849609375, 0.030029296875, 0.055084228515625, 0.1522216796875, 0.0537109375, 0.1793212890625, 0.1092529296875, 0.16845703125, 0.1011962890625, 0.243...

embed

44872846_c0

44872846

haskell

0

Title: Step by step installing Haskell on Windows 7 Problem title: Step by step installing Haskell on Windows 7 Tags: haskell, windows Problem: Step by step installing Haskell on Windows 7 I'm aware of the following posts: Installing Haskell on Windows, cabal config How to modify cabal config file on windows But they h...

Step by step installing Haskell on Windows 7 Step by step installing Haskell on Windows 7 haskell windows Step Haskell Windows Car Show Integer Step by step installing Haskell on Windows 7 I'm aware of the following posts: Installing Haskell on Windows, cabal config How to modify cabal config file on windows But they h...

[ 0.025390625, -0.0025634765625, 0.01483154296875, 0.01318359375, -0.000255584716796875, 0.01251220703125, 0.0057373046875, -0.013916015625, -0.00482177734375, -0.032470703125, -0.017578125, -0.029296875, -0.00897216796875, 0.0022430419921875, -0.0016632080078125, 0.00933837890625, -0....

[ 50478, 390, 29954, 20600, 214, 20625, 142508, 98, 3773, 361, 1556, 54825, 3980, 17367, 44401, 107419, 107951, 109524, 153837, 2811, 40383, 11435, 194663, 765, 297, 170846, 41877, 40658, 3688, 7464, 237875, 678, 51042, 8781, 102158, 272, 57, 2...

[ 0.0887451171875, 0.03485107421875, 0.0985107421875, 0.173095703125, 0.024169921875, 0.1776123046875, 0.280517578125, 0.07476806640625, 0.1513671875, 0.1710205078125, 0.1614990234375, 0.111572265625, 0.1290283203125, 0.152587890625, 0.1287841796875, 0.0219268798828125, 0.1485595703125...

embed

33228010_c0

33228010

haskell

0

Title: haskell bubblesort stops at first step Problem title: haskell bubblesort stops at first step Tags: haskell, sorting Problem: haskell bubblesort stops at first step bubblesort input | input == sorted = sorted | otherwise = bubblesort sorted where sorted = sort_once input sort_once::String->String sort_once [] = [...

haskell bubblesort stops at first step haskell bubblesort stops at first step haskell sorting Data.Char sort_once sort_once::String x:y sort_two x:y:xy sort_two::String Char aa:bb bb:aa aa::Int bb::Int string_to_int_arr greater::Int lesser::Int haskell bubblesort stops at first step Why this code sort only once? It sho...

[ -0.00909423828125, 0.015625, 0.01336669921875, 0.004364013671875, -0.0020751953125, 0.01708984375, 0.005615234375, -0.035400390625, -0.004638671875, 0.008544921875, 0.0167236328125, 0.0225830078125, -0.01019287109375, -0.005126953125, 0.00189971923828125, -0.022216796875, 0.009216308...

[ 1556, 142508, 373, 73163, 62351, 7279, 99, 5117, 29954, 12096, 11809, 84068, 191, 329, 71713, 1022, 53, 55547, 50878, 21656, 10, 11, 5125, 79315, 188, 4288, 117396, 18, 199, 2189, 7, 44084, 903, 18151, 4734, 24145, 5608, 738, 195625, 1830...

[ 0.1358642578125, 0.2037353515625, 0.07861328125, 0.182861328125, 0.2373046875, 0.1883544921875, 0.0828857421875, 0.1378173828125, 0.16748046875, 0.227783203125, 0.11474609375, 0.1466064453125, 0.0924072265625, 0.1053466796875, 0.087158203125, 0.000335693359375, 0.080810546875, 0.11...

embed

34398239_c0

34398239

haskell

0

Title: With monads, can join be defined in terms of bind? Problem title: With monads, can join be defined in terms of bind? Tags: haskell, monads Problem: With monads, can join be defined in terms of bind? In Haskell, monads are defined in terms of the functions return and bind, where return has type a -> m a and bind ...

With monads, can join be defined in terms of bind? With monads, can join be defined in terms of bind? haskell monads With monads, can join be defined in terms of bind? In Haskell, monads are defined in terms of the functions return and bind, where return has type a -> m a and bind has type m a -> (a -> m b) -> m b . It...

[ -0.0277099609375, 0.01495361328125, 0.005859375, 0.00701904296875, -0.000598907470703125, 0.01177978515625, -0.00555419921875, -0.01007080078125, 0.01483154296875, -0.031005859375, 0.0011138916015625, -0.019775390625, -0.0162353515625, -0.0238037109375, -0.0024871826171875, 0.025878906...

[ 17106, 2667, 712, 7, 831, 33284, 61924, 71, 69407, 68557, 1556, 142508, 20625, 32354, 30646, 136, 10644, 33079, 347, 10, 876, 39, 16666, 39531, 184, 7722, 4171, 177417, 6528, 16200, 32290, 2980, 137565, 20051, 11, 18403, 34292, 7477, 18770,...

[ 0.030487060546875, 0.12841796875, 0.2047119140625, 0.10540771484375, 0.0411376953125, 0.240234375, 0.1728515625, 0.1522216796875, 0.0980224609375, 0.235595703125, 0.059967041015625, 0.23388671875, 0.0933837890625, 0.13134765625, 0.185302734375, 0.05010986328125, 0.12890625, 0.01174...

embed

36221125_c1

36221125

haskell

1

train.csv" let !a = decode HasHeader csv :: Records(V.Vector(BL.ByteString)) let !res = V.fromList $ Data.Foldable.toList a print $ res V.! 0 Note that I don't give you the program I made based on attoparsec-csv because it is almost exactly the same with Vector instead of List. The memory usage of that solution is stil...

[ -0.007476806640625, 0.0025787353515625, -0.0128173828125, 0.022705078125, 0.0201416015625, 0.0133056640625, -0.0115966796875, -0.011962890625, 0.01153564453125, -0.0400390625, -0.0159912109375, -0.027587890625, 0.001434326171875, 0.0218505859375, -0.0263671875, -0.0167236328125, 0.00...

[ 25550, 4439, 334, 2633, 711, 11, 8, 40899, 20625, 13025, 38970, 20763, 89916, 856, 26455, 18770, 38274, 75358, 67, 71713, 2109, 310, 161063, 154663, 11809, 919, 18345, 2886, 188, 28412, 3650, 3332, 757, 8337, 1528, 7228, 35509, 243, 31, 2...

[ 0.294189453125, 0.1119384765625, 0.248046875, 0.047821044921875, 0.0137939453125, 0.0340576171875, 0.1732177734375, 0.1956787109375, 0.161376953125, 0.2044677734375, 0.17041015625, 0.10546875, 0.1685791015625, 0.1561279296875, 0.18408203125, 0.2059326171875, 0.044769287109375, 0.02...

embed

42173776_c0

42173776

haskell

0

Title: How to define multiple patterns in Frege? Problem title: How to define multiple patterns in Frege? Tags: frege, haskell Problem: How to define multiple patterns in Frege? I'm having some trouble defining a function in Frege that uses multiple patterns. Basically, I'm defining a mapping by iterating through a lis...

How to define multiple patterns in Frege? How to define multiple patterns in Frege? frege haskell How Frege morse.fr:3 How to define multiple patterns in Frege? I'm having some trouble defining a function in Frege that uses multiple patterns. Basically, I'm defining a mapping by iterating through a list of tuples. I've...

[ -0.006927490234375, -0.000621795654296875, -0.01483154296875, 0.0186767578125, -0.004791259765625, -0.018310546875, -0.00640869140625, 0.0030364990234375, 0.02587890625, -0.013916015625, 0.0167236328125, -0.0238037109375, 0.01141357421875, 0.00762939453125, 0.0025482177734375, 0.004943...

[ 11249, 61924, 48716, 103510, 7, 23, 21612, 429, 47, 183559, 13, 1556, 142508, 2993, 184, 7079, 363, 63134, 13204, 32354, 4527, 291, 26783, 67, 98767, 5303, 370, 99726, 112892, 1029, 25632, 18499, 27781, 903, 80934, 44691, 20625, 132283, 996...

[ 0.0521240234375, 0.2059326171875, 0.25244140625, 0.251708984375, 0.12158203125, 0.05926513671875, 0.204833984375, 0.2249755859375, 0.000244140625, 0.120361328125, 0.108154296875, 0.04925537109375, 0.1700439453125, 0.105712890625, 0.1287841796875, 0.059600830078125, 0.0477294921875, ...

embed

44218776_c0

44218776

haskell

0

Title: Haskell: class and function overloading: Problem title: Haskell: class and function overloading: Tags: haskell Problem: Haskell: class and function overloading: I am quite new to Haskell. I am trying to overload a custom function 'myadd' for different containers. My understanding is that you have to do it throug...

Haskell: class and function overloading: Haskell: class and function overloading: haskell Haskell Addition Maybe Just test.hs:7:19 Expecting Expected Haskell: class and function overloading: I am quite new to Haskell. I am trying to overload a custom function 'myadd' for different containers. My understanding is that y...

[ -0.01165771484375, 0.005889892578125, 0.01055908203125, 0.00238037109375, -0.01470947265625, 0.0198974609375, -0.0000667572021484375, -0.01104736328125, 0.01458740234375, -0.012451171875, 0.0019989013671875, -0.051025390625, -0.00616455078125, -0.0074462890625, 0.0106201171875, -0.0262...

[ 20625, 142508, 18507, 136, 32354, 645, 63033, 214, 1556, 29117, 14, 83425, 9563, 3034, 127, 7, 966, 23988, 60075, 24762, 13, 32233, 3525, 31577, 114122, 1176, 11, 4028, 100, 12921, 116419, 100094, 765, 8305, 61112, 37842, 25632, 18499 ]

[ 0.12890625, 0.216796875, 0.1695556640625, 0.1026611328125, 0.194580078125, 0.158203125, 0.2158203125, 0.062469482421875, 0.111572265625, 0.0811767578125, 0.05352783203125, 0.1158447265625, 0.0430908203125, 0.202392578125, 0.06549072265625, 0.00115966796875, 0.033050537109375, 0.135...

embed

48752973_c0

48752973

haskell

0

Title: number of leaves is one greater than number of nodes in Haskell Problem title: number of leaves is one greater than number of nodes in Haskell Tags: haskell Problem: number of leaves is one greater than number of nodes in Haskell I have to prove that given a binary tree, the number of leaves is equal to the numb...

number of leaves is one greater than number of nodes in Haskell number of leaves is one greater than number of nodes in Haskell haskell Haskell Tree Leaf Node number of leaves is one greater than number of nodes in Haskell I have to prove that given a binary tree, the number of leaves is equal to the number of nodes pl...

[ 0.0279541015625, 0.00096893310546875, -0.001373291015625, 0.01483154296875, 0.0244140625, 0.00035858154296875, -0.0172119140625, -0.032470703125, 0.01019287109375, -0.037353515625, -0.0206298828125, -0.02001953125, 0.006134033203125, 0.0196533203125, 0.013427734375, -0.0006675720214843...

[ 14012, 31358, 7, 1632, 117396, 3501, 110, 988, 20625, 142508, 83, 23, 1556, 101344, 636, 2407, 438, 112, 111, 23534, 34475, 2394, 6635, 53201, 105950, 1001, 77391, 10644, 61924, 6626, 32354, 136, 30646, 3647, 7225, 757, 29954, 170933, 6023,...

[ 0.1424560546875, 0.263671875, 0.1038818359375, 0.173583984375, 0.1607666015625, 0.08349609375, 0.1495361328125, 0.1387939453125, 0.139404296875, 0.2232666015625, 0.01129150390625, 0.10009765625, 0.1053466796875, 0.1708984375, 0.069580078125, 0.11083984375, 0.1219482421875, 0.018020...

embed

10000074_c0

10000074

haskell

0

Title: Which FRP package to choose? Problem title: Which FRP package to choose? Tags: frp, haskell, reactive-banana Problem: Which FRP package to choose? I'm just starting to look into the world of Functional Reactive Programming in Haskell, and I would like to experiment with GUI programming (with gtk, because of subs...

Which FRP package to choose? Which FRP package to choose? frp haskell reactive-banana Which FRP Which FRP package to choose? I'm just starting to look into the world of Functional Reactive Programming in Haskell, and I would like to experiment with GUI programming (with gtk, because of substantial binding) in a reactio...

[ 0.0059814453125, -0.000027418136596679688, 0.00677490234375, -0.0047607421875, -0.0059814453125, -0.0030364990234375, 0.00726318359375, -0.0008697509765625, 0.0157470703125, 0.0166015625, 0.003814697265625, -0.038818359375, -0.00162506103515625, 0.00909423828125, -0.014404296875, 0.006...

[ 130078, 563, 38796, 98169, 55076, 47, 14119, 254, 1556, 142508, 456, 71232, 105281, 11, 72134, 6713, 8999, 28670, 10763, 853, 27958, 20625, 28007, 195490, 56037, 76228, 706, 31472, 193984, 128239, 132539, 53550, 16487, 6524, 1081, 23129, 217, ...

[ 0.0732421875, 0.10205078125, 0.278076171875, 0.284423828125, 0.11572265625, 0.040283203125, 0.1231689453125, 0.1455078125, 0.131591796875, 0.22265625, 0.1129150390625, 0.20458984375, 0.175537109375, 0.1619873046875, 0.007781982421875, 0.00958251953125, 0.0175933837890625, 0.0479431...

embed

51044581_c1

51044581

haskell

1

.otherwise(pair) .continueWith(highCard) } Result , as it is: Encompasses a type ([Card]) into a broader context (R a) Has an id (result) function that put an object of type a into a minimum "result" context (a -> R a) But... It has not just one generic >>= bind function, but several specific ones, that takes R a -> (...

[ -0.013916015625, 0.0125732421875, 0.0130615234375, 0.008544921875, 0.01336669921875, 0.00125885009765625, -0.003265380859375, -0.01513671875, 0.0230712890625, -0.033203125, 0.00555419921875, 0.005584716796875, -0.0115966796875, -0.00006961822509765625, -0.0145263671875, -0.007995605468...

[ 5, 126340, 90825, 109637, 133891, 13, 194583, 84396, 156119, 126684, 237, 83, 277, 13409, 90, 10644, 3934, 134744, 56, 43701, 1052, 10, 20625, 3447, 2109, 7136, 32354, 3884, 36746, 15440, 11, 33079, 627, 1556, 189534, 6396, 1369, 68557, 403...

[ 0.043487548828125, 0.0863037109375, 0.1937255859375, 0.2264404296875, 0.1141357421875, 0.030426025390625, 0.11962890625, 0.117919921875, 0.212646484375, 0.3232421875, 0.028106689453125, 0.052490234375, 0.059906005859375, 0.1099853515625, 0.0254364013671875, 0.170166015625, 0.06347656...

embed

27253281_c1

27253281

haskell

1

44(%r13),%r12 ja _c28m movq 7(%rbx),%rax testq %rax,%rax jne _c28p movl $lvl_r23w_closure+1,%ebx addq $8,%rbp addq $-16,%r12 jmp *0(%rbp) _c28m: movq $16,192(%r13) _c28k: jmp *-16(%r13) _c28p: leaq -1(%rax),%rsi movq %rsi,%rdx sarq $1,%rdx movq %rsi,%rcx orq %rdx,%rcx sarq $2,%rcx movq %rdx,%rax orq %rcx,%rax movq %rsi...

[ 0.00506591796875, 0.01092529296875, -0.004058837890625, 0.0150146484375, -0.00335693359375, 0.0279541015625, -0.017822265625, 0.0050048828125, -0.005035400390625, 0.0017852783203125, 0.01190185546875, 0.01446533203125, 0.00933837890625, -0.001251220703125, 0.006134033203125, 0.02307128...

[ 5896, 3949, 63258, 4, 1530, 79, 101, 3882, 39, 6, 30464, 864, 361, 13471, 425, 247, 3034, 52035, 254, 931, 50132, 3650, 3723, 454, 3742, 434, 170224, 21748, 6403, 15190, 1019, 13528, 1647, 2676, 2389, 132, 16, 238, 12, 2485, 2947, 304...

[ 0.31201171875, 0.042144775390625, 0.1583251953125, 0.049560546875, 0.1573486328125, 0.150146484375, 0.0465087890625, 0.173095703125, 0.050140380859375, 0.08984375, 0.205078125, 0.115966796875, 0.1448974609375, 0.0635986328125, 0.1209716796875, 0.005645751953125, 0.2430419921875, 0....

embed

42743230_c0

42743230

haskell

0

Title: Count elements in a list while preserving order Problem title: Count elements in a list while preserving order Tags: list, haskell Problem: Count elements in a list while preserving order I am wondering if there is a way to count the distinct elements in a list and group the counts into tuples, for example [4,4,...

Count elements in a list while preserving order Count elements in a list while preserving order list haskell Data.List Count Count elements in a list while preserving order I am wondering if there is a way to count the distinct elements in a list and group the counts into tuples, for example or would yield while preser...

[ 0.00128173828125, 0.0014190673828125, -0.006866455078125, 0.007232666015625, 0.01177978515625, -0.00897216796875, -0.017822265625, -0.01239013671875, 0.0167236328125, -0.0250244140625, -0.032470703125, -0.0019073486328125, 0.0213623046875, 0.03955078125, -0.01513671875, 0.0072021484375...

[ 108210, 80854, 23, 5303, 12960, 9498, 56, 6496, 12989, 1556, 142508, 11809, 154663, 149016, 3917, 47, 54529, 117781, 21115, 3934, 370, 99726, 11180, 19388, 7311, 24626, 31089, 81887, 37202, 24500, 64549, 1286, 93766, 37317, 4734, 1632, 1733 ]

[ 0.21826171875, 0.2144775390625, 0.05584716796875, 0.1993408203125, 0.1241455078125, 0.0906982421875, 0.101806640625, 0.05963134765625, 0.2059326171875, 0.1041259765625, 0.1922607421875, 0.0654296875, 0.1361083984375, 0.03125, 0.03717041015625, 0.01348876953125, 0.2122802734375, 0.1...

embed

6477541_c0

6477541

haskell

0

Title: User state in Parsec Problem title: User state in Parsec Tags: parsec, state, haskell Problem: User state in Parsec I'm parsing an expression using Parsec and I want to keep track of variables in these expressions using the user state in Parsec. Unfortunately I don't really get how to do it. Given the following ...

User state in Parsec User state in Parsec parsec state haskell Data.Set User Parsec Set many1 Set.empty Left Right ParsecT Set.Set Set.insert User state in Parsec I'm parsing an expression using Parsec and I want to keep track of variables in these expressions using the user state in Parsec. Unfortunately I don't reall...

[ -0.004364013671875, 0.0079345703125, -0.00142669677734375, 0.0194091796875, -0.00299072265625, 0.02734375, -0.0179443359375, -0.001617431640625, 0.0098876953125, -0.0255126953125, -0.004425048828125, 0.02880859375, 0.0169677734375, 0.005218505859375, -0.0022125244140625, 0.007873535156...

[ 53400, 11341, 23, 2392, 39797, 366, 1556, 142508, 11809, 294, 126, 19943, 5941, 418, 33548, 2480, 90911, 618, 73, 33657, 6953, 125195, 17368, 3444, 13695, 28560, 77336, 38937, 185397, 3642, 18151, 70, 75, 10, 2806, 186, 5, 78779, 13, 2835...

[ 0.2138671875, 0.23876953125, 0.05914306640625, 0.170654296875, 0.248046875, 0.1551513671875, 0.092529296875, 0.19677734375, 0.06719970703125, 0.1427001953125, 0.172119140625, 0.2022705078125, 0.1397705078125, 0.004486083984375, 0.0799560546875, 0.0135498046875, 0.0628662109375, 0.1...

embed

29941633_c0

29941633

haskell

0

Title: Haskell State monad with tuples as state Problem title: Haskell State monad with tuples as state Tags: haskell, monads, state Problem: Haskell State monad with tuples as state My apologies if my question is stupid (I'm still quite new to monads), but I couldn't find the answer to it so far. I want to store pairs...

Haskell State monad with tuples as state Haskell State monad with tuples as state haskell monads state Control.Monad.State a Haskell State Prelude MonadState StateT Data.Functor.Identity.Identity Haskell State monad with tuples as state My apologies if my question is stupid (I'm still quite new to monads), but I couldn...

[ -0.02392578125, 0.006591796875, 0.005126953125, 0.0130615234375, 0.000965118408203125, 0.008544921875, -0.00946044921875, -0.0184326171875, -0.00787353515625, -0.0267333984375, 0.0118408203125, 0.0216064453125, -0.0179443359375, 0.01287841796875, -0.0167236328125, -0.00494384765625, ...

[ 20625, 142508, 22836, 2667, 712, 678, 370, 99726, 237, 11341, 1556, 7, 27131, 46674, 135206, 1914, 822, 60331, 71, 618, 11809, 97249, 18770, 37379, 2481, 1747, 18709, 9655, 110833, 32233, 69427, 35166, 3444, 47, 4343, 80836, 23, 33306, 9790...

[ 0.1490478515625, 0.259033203125, 0.212646484375, 0.1365966796875, 0.1983642578125, 0.07452392578125, 0.13916015625, 0.251220703125, 0.1224365234375, 0.2437744140625, 0.1309814453125, 0.036865234375, 0.1856689453125, 0.08282470703125, 0.138427734375, 0.012664794921875, 0.0855712890625...

embed

56693849_c0

56693849

haskell

0

Title: How to write a fixed point function in haskell Problem title: How to write a fixed point function in haskell Tags: fixed-point-iteration, functional-programming, haskell Problem: How to write a fixed point function in haskell I have a function with the following signature: simCon :: [Constraint] -> Maybe [Constr...

How to write a fixed point function in haskell How to write a fixed point function in haskell fixed-point-iteration functional-programming haskell How Constraint Maybe Just How to write a fixed point function in haskell I have a function with the following signature: I would like to write a method which, incase simCon ...

[ 0.00167083740234375, 0.0010223388671875, 0.018310546875, 0.007110595703125, 0.0238037109375, -0.0076904296875, -0.004486083984375, -0.00445556640625, -0.0086669921875, -0.0096435546875, -0.00823974609375, 0.01312255859375, -0.0086669921875, 0.0123291015625, 0.0216064453125, 0.001564025...

[ 11249, 47, 33022, 10, 188347, 6275, 32354, 23, 1556, 142508, 38496, 16840, 123309, 28966, 1657, 2816, 4288, 83425, 9563, 25632, 138256, 1884, 55300, 58437, 10777, 11935, 30646, 3444, 61590, 4420, 3934, 456, 16428, 13695, 24189, 107730, 5701, ...

[ 0.0943603515625, 0.047454833984375, 0.2052001953125, 0.03375244140625, 0.25244140625, 0.1920166015625, 0.208984375, 0.07330322265625, 0.151611328125, 0.23388671875, 0.1248779296875, 0.1273193359375, 0.12841796875, 0.08056640625, 0.08001708984375, 0.196044921875, 0.0892333984375, 0....

embed

24661157_c0

24661157

haskell

0

Title: Type is inferred differently in a lexical binding in GHCi Problem title: Type is inferred differently in a lexical binding in GHCi Tags: haskell, type-inference, ghci Problem: Type is inferred differently in a lexical binding in GHCi Greeting, I am a little surprised that I get two different type in GHCi with th...

Type is inferred differently in a lexical binding in GHCi Type is inferred differently in a lexical binding in GHCi haskell type-inference ghci Type GHCi Show Tree Type is inferred differently in a lexical binding in GHCi Greeting, I am a little surprised that I get two different type in GHCi with the same expression w...

[ -0.00701904296875, 0.001068115234375, -0.0079345703125, 0.01007080078125, 0.0091552734375, 0.015869140625, -0.00836181640625, -0.003173828125, 0.00848388671875, -0.0032196044921875, -0.0013885498046875, -0.0244140625, -0.0023040771484375, 0.0081787109375, 0.019287109375, 0.008422851562...

[ 60457, 83, 53498, 2822, 12921, 538, 75675, 21533, 128239, 527, 73265, 14, 23, 1556, 142508, 10644, 69988, 31380, 318, 17367, 101344, 10255, 13, 1916, 144285, 6626, 5701, 125195, 68557, 61924, 32354, 28412, 38937, 101786, 9384, 79442, 62731, 1...

[ 0.285888671875, 0.0151214599609375, 0.2164306640625, 0.1378173828125, 0.1895751953125, 0.0751953125, 0.106201171875, 0.122314453125, 0.1973876953125, 0.0775146484375, 0.126220703125, 0.191162109375, 0.0203399658203125, 0.084716796875, 0.1973876953125, 0.2210693359375, 0.111083984375,...

embed

38224436_c0

38224436

haskell

0

Title: How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? Problem title: How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? Tags: haskell, parsec, parsing Problem: How can I parse non-contiguous elements of a permutation phrase using Parsec's...

How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? haskell parsec parsing Parsec How Perm How can I parse non-contiguous elements of a permutation phrase using Parsec's Perm? Haskell's Parsec...

[ -0.01434326171875, 0.0115966796875, -0.002044677734375, 0.0262451171875, -0.01165771484375, 0.03466796875, -0.00193023681640625, -0.035888671875, -0.000759124755859375, -0.018798828125, -0.002593994140625, 0.0235595703125, 0.0289306640625, 0.00653076171875, -0.029296875, 0.017822265625...

[ 11249, 831, 366, 184, 351, 2271, 118, 1234, 80854, 117, 561, 22062, 113860, 2392, 39797, 3768, 908, 39, 1556, 142508, 6953, 17368, 20625, 8060, 1829, 88996, 209806, 67, 67842, 14311, 21094, 2055, 238, 76596, 65037, 275, 83151, 5281, 27781, ...

[ 0.046234130859375, 0.03369140625, 0.179931640625, 0.117919921875, 0.142578125, 0.0369873046875, 0.119384765625, 0.1265869140625, 0.1658935546875, 0.1004638671875, 0.1710205078125, 0.040435791015625, 0.1993408203125, 0.123779296875, 0.2200927734375, 0.02752685546875, 0.1881103515625, ...

embed

20158392_c1

20158392

haskell

1

terms of function composition instead of reverse function composition. That is: (:.) = flip $ (.) (.) (.) -- instead of (:.) = (>>>) (>>>) (>>>) Of course (>>>) (>>>) (>>>) is of the wrong type. It's not the function that I am looking for. The beauty of function composition is that it can be composed with itself to fo...

[ -0.006103515625, 0.022705078125, 0.012451171875, 0.006195068359375, -0.0201416015625, -0.00933837890625, 0.0225830078125, -0.00225830078125, 0.0284423828125, 0.00909423828125, -0.007171630859375, 0.0228271484375, 0.0035247802734375, -0.0074462890625, 0.00653076171875, -0.0159912109375,...

[ 69407, 111, 32354, 166577, 64457, 39531, 184, 12, 5, 2203, 147505, 3650, 130910, 44691, 10644, 959, 16487, 100, 62607, 831, 150350, 678, 68034, 3173, 84396, 56, 12989, 106804, 102971, 138256, 100270, 4420, 19364, 442, 20653, 40225, 73342, 154...

[ 0.1773681640625, 0.041259765625, 0.2198486328125, 0.28466796875, 0.166748046875, 0.224853515625, 0.162841796875, 0.084228515625, 0.06146240234375, 0.032928466796875, 0.2215576171875, 0.138671875, 0.1280517578125, 0.1051025390625, 0.16455078125, 0.0194854736328125, 0.0567626953125, ...

embed

73903292_c1

73903292

haskell

1

halt with infinity , but it doesn't. It halts, but with the wrong answer, and I don't know why. ghci> take 14 [1, 9 .. 100] [1,9,17,25,33,41,49,57,65,73,81,89,97] ghci> take 14 [1, 9 .. infinity] [9,17,25,33,41,49,57,65,73,81,89,97,105,113] ghci> [100, 9 .. 0] [100,9] ghci> [infinity, 9 .. 0] [9] ghci> [6, 100 .. 7] [...

[ -0.00335693359375, -0.0037841796875, -0.00250244140625, -0.0157470703125, -0.01025390625, 0.018798828125, 0.00323486328125, 0.00958251953125, 0.0089111328125, -0.0263671875, 0.008056640625, -0.003143310546875, 0.01806640625, 0.01422119140625, 0.0224609375, 0.00604248046875, 0.0112915...

[ 58810, 678, 54241, 53, 1284, 442, 22027, 18, 1650, 7, 44691, 35166, 2301, 3714, 15400, 31380, 318, 5646, 616, 68252, 483, 1468, 805, 198889, 2489, 2588, 82449, 163324, 93754, 135461, 13556, 18949, 14773, 2740, 1126, 168628, 46659, 116597, 3...

[ 0.266845703125, 0.1278076171875, 0.2113037109375, 0.12353515625, 0.093994140625, 0.0587158203125, 0.1348876953125, 0.1302490234375, 0.0289459228515625, 0.095947265625, 0.185302734375, 0.1976318359375, 0.042388916015625, 0.07537841796875, 0.10400390625, 0.107421875, 0.1510009765625, ...

embed

77474598_c0

77474598

haskell

0

Title: State Monad - HASKELL Problem title: State Monad - HASKELL Tags: haskell, state-monad, monad-transformers Problem: State Monad - HASKELL instance Monad ST where --return :: a -> ST a return x = S (\s -> (x,s)) --(>>=) :: ST a -> (a -> ST b) -> ST b st >>= f = S (\s -> let (x, s') = app st s in app (f x) s') type...

State Monad - HASKELL State Monad - HASKELL haskell state-monad monad-transformers State Monad HASKELL Tree Leaf Node Show State Monad - HASKELL Hi, so this my code and I want to ensure that my understanding of the expansion of the mlabel function is correct. And I am not using any additional imports.

[ -0.01324462890625, 0.0054931640625, -0.000058650970458984375, 0.00604248046875, 0.016845703125, 0.005859375, 0.002716064453125, -0.01422119140625, 0.01324462890625, -0.031005859375, 0.01361083984375, -0.0189208984375, -0.006103515625, 0.0016937255859375, 0.011962890625, -0.008972167968...

[ 22836, 60331, 71, 11666, 10762, 56051, 1556, 142508, 11341, 3796, 712, 2667, 215175, 101344, 636, 2407, 438, 112, 17367, 2673, 903, 18151, 3444, 47, 63284, 100094, 14700, 66, 6889, 347, 152526, 32354, 83, 26785, 959, 17368, 78301, 24927 ]

[ 0.1683349609375, 0.181640625, 0.09869384765625, 0.0947265625, 0.09820556640625, 0.1661376953125, 0.103759765625, 0.1845703125, 0.12890625, 0.09423828125, 0.0836181640625, 0.094970703125, 0.165771484375, 0.1141357421875, 0.0289154052734375, 0.10107421875, 0.130615234375, 0.047576904...

embed

8692156_c0

8692156

haskell

0

Title: Sort by constructor ignoring (part of) value Problem title: Sort by constructor ignoring (part of) value Tags: haskell Problem: Sort by constructor ignoring (part of) value Suppose I have data Foo = A String Int | B Int I want to take an xs :: [Foo] and sort it such that all the A s are at the beginning, sorted ...

Sort by constructor ignoring (part of) value Sort by constructor ignoring (part of) value haskell Sort Foo Sort by constructor ignoring (part of) value Suppose I have I want to take an xs :: [Foo] and sort it such that all the A s are at the beginning, sorted by their strings, but with the ints in the order they appear...

[ 0.01495361328125, -0.0045166015625, -0.017333984375, 0.0023956298828125, 0.00064849853515625, -0.005706787109375, -0.0115966796875, 0.0004558563232421875, 0.0142822265625, -0.00421142578125, -0.006378173828125, 0.0205078125, 0.01141357421875, 0.01263427734375, -0.0255126953125, -0.0274...

[ 53666, 390, 64549, 748, 47438, 17365, 34292, 1556, 142508, 9572, 31, 3444, 5646, 1022, 7, 1984, 27591, 12096, 6044, 756, 62, 91, 86595, 17497, 79315, 23, 933, 12989, 118775, 5303, 335, 3564, 5701, 28282, 3525, 6615, 5117, 13204, 32354, 35...

[ 0.1981201171875, 0.1448974609375, 0.20361328125, 0.124267578125, 0.153564453125, 0.0863037109375, 0.1729736328125, 0.1060791015625, 0.2099609375, 0.16796875, 0.0950927734375, 0.04168701171875, 0.030731201171875, 0.054107666015625, 0.0282135009765625, 0.054779052734375, 0.1015625, 0...

embed

58015610_c0

58015610

haskell

0

Title: Value constructors in haskell Problem title: Value constructors in haskell Tags: haskell, nlp-question-answering, function, value-constructor, list Problem: Value constructors in haskell I have a question about Haskell. I'm new so I don't understand too well, but if anyone could help me I'd really appreciate. I ...

Value constructors in haskell Value constructors in haskell haskell nlp-question-answering function value-constructor list Value Question Yes Show Value constructors in haskell I have a question about Haskell. I'm new so I don't understand too well, but if anyone could help me I'd really appreciate. I have this exercis...

[ 0.00787353515625, 0.0115966796875, 0.007568359375, 0.017822265625, -0.000942230224609375, 0.0174560546875, 0.0036773681640625, 0.0030059814453125, 0.01251220703125, -0.00616455078125, 0.003387451171875, -0.01416015625, -0.0013427734375, -0.004150390625, -0.01202392578125, -0.0079345703...

[ 190060, 64549, 25251, 23, 1556, 142508, 653, 26775, 7162, 1363, 10133, 144784, 32354, 34292, 2271, 36716, 748, 5303, 68185, 32635, 17367, 9655, 20625, 3525, 28219, 4358, 77947, 81979, 1295, 12877, 123997, 195136, 53299, 171859, 30646, 757, 100,...

[ 0.253662109375, 0.2469482421875, 0.1640625, 0.055511474609375, 0.1466064453125, 0.2139892578125, 0.01995849609375, 0.1844482421875, 0.0980224609375, 0.0911865234375, 0.0830078125, 0.134033203125, 0.1763916015625, 0.230224609375, 0.09814453125, 0.2047119140625, 0.087646484375, 0.180...

embed

34958735_c0

34958735

haskell

0

Title: Functional Programming Idiom to compute maximum of 4 numbers without mutation in racket/haskell Problem title: Functional Programming Idiom to compute maximum of 4 numbers without mutation in racket/haskell Tags: scheme, algorithm, functional-programming, haskell, racket Problem: Functional Programming Idiom to ...

Functional Programming Idiom to compute maximum of 4 numbers without mutation in racket/haskell Functional Programming Idiom to compute maximum of 4 numbers without mutation in racket/haskell scheme algorithm functional-programming haskell racket Functional Programming Idiom count1 char1 count2 char2 Functional Program...

[ -0.00775146484375, -0.0037841796875, 0.01507568359375, 0.0291748046875, 0.00408935546875, 0.00323486328125, -0.0230712890625, -0.004669189453125, -0.000972747802734375, -0.0274658203125, -0.01226806640625, -0.0228271484375, -0.0027313232421875, -0.0016326904296875, 0.007568359375, -0.0...

[ 28670, 10763, 27958, 87, 428, 306, 9969, 6743, 38132, 201, 101935, 15490, 199334, 673, 27853, 10557, 142508, 150370, 234873, 123309, 28966, 1556, 54529, 418, 21441, 304, 47, 23, 765, 14012, 74918, 22759, 124850, 79315, 77336, 876, 501, 104, ...

[ 0.11181640625, 0.09075927734375, 0.1280517578125, 0.050201416015625, 0.15478515625, 0.158203125, 0.1114501953125, 0.07568359375, 0.2061767578125, 0.20654296875, 0.1939697265625, 0.1190185546875, 0.156005859375, 0.064453125, 0.138916015625, 0.08758544921875, 0.20361328125, 0.0997314...

embed

36199659_c0

36199659

haskell

0

Title: Haskell - Use of Take and Drop to split a list into three parts Problem title: Haskell - Use of Take and Drop to split a list into three parts Tags: function-definition, take, haskell, list Problem: Haskell - Use of Take and Drop to split a list into three parts So I've came across this function definition that ...

Haskell - Use of Take and Drop to split a list into three parts Haskell - Use of Take and Drop to split a list into three parts function-definition take haskell list Haskell Use Take Drop SPLITS LIST INTO THREE PARTS split3 Haskell - Use of Take and Drop to split a list into three parts So I've came across this functio...

[ 0.007537841796875, 0.0184326171875, -0.00128936767578125, -0.0093994140625, -0.0240478515625, 0.0125732421875, 0.019287109375, -0.00592041015625, 0.0238037109375, 0.000835418701171875, -0.010009765625, -0.015869140625, 0.010986328125, 0.0010833740234375, -0.0064697265625, 0.02160644531...

[ 20625, 142508, 36836, 46673, 136, 130403, 65450, 5303, 3934, 17262, 63920, 20, 47, 32354, 49919, 5646, 1556, 12047, 107287, 195977, 213354, 12232, 148776, 28358, 363, 36880, 903, 80934, 51776, 10, 425, 7, 237, 140992, 13580, 19441, 34844, 100...

[ 0.116455078125, 0.2445068359375, 0.094482421875, 0.21142578125, 0.15234375, 0.2374267578125, 0.2213134765625, 0.2200927734375, 0.12890625, 0.193359375, 0.2054443359375, 0.003387451171875, 0.00714111328125, 0.1883544921875, 0.122314453125, 0.203857421875, 0.114501953125, 0.068054199...

embed

29039251_c0

29039251

haskell

0

Title: What does "No instance for (Comparable Integer)" mean? Problem title: What does "No instance for (Comparable Integer)" mean? Tags: haskell, typeclass Problem: What does "No instance for (Comparable Integer)" mean? data Set a = Set [a] i1 = Set [1, 2, 3] i2 = Set [3, 2, 1] member xs x = elem x...

What does "No instance for (Comparable Integer)" mean? What does "No instance for (Comparable Integer)" mean? haskell typeclass a What Comparable Integer Set What does "No instance for (Comparable Integer)" mean? When executing: cmp i1 i2 I get the following error: I'd like to know what it means? Th...

[ 0.00213623046875, 0.00927734375, 0.01470947265625, 0.01129150390625, -0.0052490234375, 0.02099609375, 0.0126953125, -0.0037841796875, 0.00946044921875, 0.00360107421875, -0.02197265625, 0.01239013671875, 0.017822265625, -0.009033203125, -0.0167236328125, -0.0206298828125, 0.000690460...

[ 4865, 14602, 5021, 110527, 100, 108161, 147, 2886, 44401, 29459, 1556, 142508, 10644, 67413, 113307, 19943, 71924, 1827, 254, 17, 418, 304, 25632, 18499, 1884, 3714, 2367, 442, 26950 ]

[ 0.0367431640625, 0.0309600830078125, 0.1468505859375, 0.25390625, 0.1187744140625, 0.1005859375, 0.1346435546875, 0.1224365234375, 0.16064453125, 0.1121826171875, 0.08062744140625, 0.18896484375, 0.063232421875, 0.099609375, 0.1680908203125, 0.133056640625, 0.074462890625, 0.104736...

embed

18894440_c0

18894440

haskell

0

Title: Why can't I substitute a value with a variable of the same value in Haskell port numbers? Problem title: Why can't I substitute a value with a variable of the same value in Haskell port numbers? Tags: ghci, haskell Problem: Why can't I substitute a value with a variable of the same value in Haskell por...

Why can't I substitute a value with a variable of the same value in Haskell port numbers? Why can't I substitute a value with a variable of the same value in Haskell port numbers? ghci haskell Network Why Haskell Prelude PortNumber Couldn Integer Word16 Why can't I substitute a value with a variable of the sa...

[ -0.0299072265625, -0.00775146484375, 0.0021209716796875, 0.01043701171875, -0.0009002685546875, -0.0047607421875, -0.03564453125, -0.00048828125, 0.017578125, 0.004058837890625, -0.005401611328125, -0.00019073486328125, 0.01190185546875, 0.000370025634765625, -0.01104736328125, -0.0128...

[ 44084, 831, 3768, 18, 161740, 13, 34292, 678, 77336, 5701, 20625, 142508, 11469, 101935, 318, 1556, 28997, 1914, 822, 112, 13791, 18444, 26278, 191147, 44401, 22543, 2485, 41877, 17304, 56002, 22027, 903, 4488, 4343, 16454, 38937, 107730, 110...

[ 0.0804443359375, 0.0909423828125, 0.00048828125, 0.061920166015625, 0.2142333984375, 0.05133056640625, 0.173095703125, 0.1002197265625, 0.2386474609375, 0.1126708984375, 0.1007080078125, 0.2093505859375, 0.1378173828125, 0.1407470703125, 0.05072021484375, 0.047210693359375, 0.0222778...

embed

75297085_c0

75297085

haskell

0

Title: Where to add a flag in the package.yaml? Problem title: Where to add a flag in the package.yaml? Tags: haskell, haskell-stack Problem: Where to add a flag in the package.yaml? I have a package.yaml file like: name: ... version: ... ... flags: strict: ... description: ... ... dependencies: ... ... Mostly typical ...

Where to add a flag in the package.yaml? Where to add a flag in the package.yaml? haskell haskell-stack Where package.yaml Where to add a flag in the package.yaml? I have a package.yaml file like: Mostly typical package.yaml file. And one of the dependencies uses a library (so it's a transitive dependency) which has fl...

[ 0.0093994140625, -0.002166748046875, 0.02099609375, -0.0164794921875, -0.00124359130859375, -0.007415771484375, -0.0252685546875, -0.0027923583984375, -0.0101318359375, 0.0206298828125, 0.0133056640625, -0.037841796875, -0.00238037109375, 0.009033203125, -0.0106201171875, 0.00723266601...

[ 78662, 47, 15190, 10, 49938, 23, 98169, 14520, 141, 1556, 142508, 590, 2594, 5, 11435, 17006, 222201, 42548, 117538, 4527, 35773, 62621, 5844, 27771, 8517, 153837, 15504, 98, 903, 527, 73265, 35829, 40059, 959, 4488, 98352, 130250, 140992, ...

[ 0.1317138671875, 0.045562744140625, 0.166259765625, 0.103759765625, 0.285888671875, 0.0596923828125, 0.2193603515625, 0.2171630859375, 0.20703125, 0.0902099609375, 0.1954345703125, 0.07293701171875, 0.09246826171875, 0.006103515625, 0.09393310546875, 0.009063720703125, 0.079956054687...

embed

49610110_c0

49610110

haskell

0

Title: It it possible to store stack's custom snaphot in a private github repository? Problem title: It it possible to store stack's custom snaphot in a private github repository? Tags: github, haskell, haskell-stack Problem: It it possible to store stack's custom snaphot in a private github repository? Curre...

It it possible to store stack's custom snaphot in a private github repository? It it possible to store stack's custom snaphot in a private github repository? github haskell haskell-stack raw.githubusercontent.com snapshot.yaml AJ_tHmg3nl_bW6LdG9DSgzIIKs0zqKICks2by0i4wA It it possible to store stack's custom s...

[ -0.000164031982421875, 0.024169921875, -0.0029449462890625, -0.01513671875, -0.0225830078125, -0.004791259765625, 0.003997802734375, 0.0169677734375, -0.00128936767578125, -0.011474609375, -0.01507568359375, -0.0206298828125, -0.0247802734375, -0.00286865234375, -0.004150390625, 0.0050...

[ 1650, 7722, 4343, 177261, 3768, 114122, 76685, 21620, 23, 14375, 62270, 32102, 64722, 31667, 14, 1556, 142508, 590, 2594, 49649, 15769, 69246, 72697, 14520, 4527, 9932, 127, 275, 1566, 3835, 93392, 24145, 3249, 24209, 78301, 47, 1098, 18, 1...

[ 0.0203094482421875, 0.1365966796875, 0.1741943359375, 0.211181640625, 0.06109619140625, 0.201171875, 0.1837158203125, 0.23486328125, 0.06060791015625, 0.203857421875, 0.1270751953125, 0.1951904296875, 0.100341796875, 0.0736083984375, 0.0299072265625, 0.0980224609375, 0.183349609375, ...

embed

8877541_c0

8877541

haskell

0

Title: How to write an instance for all types in another type class? Problem title: How to write an instance for all types in another type class? Tags: haskell Problem: How to write an instance for all types in another type class? I have to define a type class Truthy which contains a method true converting an instance ...

How to write an instance for all types in another type class? How to write an instance for all types in another type class? haskell How Truthy Bool Num How to write an instance for all types in another type class? I have to define a type class Truthy which contains a method true converting an instance of the type class...

[ -0.0108642578125, 0.0130615234375, 0.01239013671875, 0.00213623046875, -0.0003204345703125, 0.003753662109375, 0.0020294189453125, -0.0101318359375, 0.01470947265625, 0.0189208984375, -0.033447265625, -0.0218505859375, -0.0008392333984375, 0.0030517578125, -0.0177001953125, 0.009765625...

[ 11249, 47, 33022, 142, 110527, 100, 756, 52895, 23, 15700, 10644, 18507, 1556, 142508, 184431, 53, 2460, 929, 52782, 61924, 70541, 55300, 29568, 96760, 34292, 21635, 67842, 5303, 54744, 360, 18, 91, 3917, 54, 24145, 154107, 2816, 4288, 959,...

[ 0.1029052734375, 0.03704833984375, 0.187744140625, 0.03375244140625, 0.29296875, 0.13134765625, 0.1385498046875, 0.2498779296875, 0.06951904296875, 0.1181640625, 0.20947265625, 0.202880859375, 0.1055908203125, 0.199951171875, 0.1585693359375, 0.1348876953125, 0.086181640625, 0.1934...

embed

3668686_c0

3668686

haskell

0

Title: Get the middle of an Ix range in O(1) time in Haskell Problem title: Get the middle of an Ix range in O(1) time in Haskell Tags: time-complexity, arrays, functional-programming, haskell, complexity-theory Problem: Get the middle of an Ix range in O(1) time in Haskell I was playing around with this code kata in H...

Get the middle of an Ix range in O(1) time in Haskell Get the middle of an Ix range in O(1) time in Haskell time-complexity arrays functional-programming haskell complexity-theory Get Haskell Get the middle of an Ix range in O(1) time in Haskell I was playing around with this code kata in Haskell, and I came across the...

[ -0.015380859375, 0.000362396240234375, 0.0289306640625, -0.003631591796875, 0.003082275390625, 0.01043701171875, -0.00994873046875, -0.0157470703125, 0.01287841796875, -0.0255126953125, -0.00140380859375, 0.0198974609375, -0.00823974609375, 0.00168609619140625, -0.005279541015625, -0.0...

[ 20779, 70, 86991, 111, 87, 425, 37457, 180, 27750, 1733, 20625, 142508, 23, 44974, 10298, 123309, 28966, 1556, 27140, 75169, 10932, 18151, 3441, 1927, 686, 289, 7413, 4122, 38496, 63262, 11001, 54744, 34292, 110527, 10644, 67413, 370, 8705, ...

[ 0.1016845703125, 0.047607421875, 0.26025390625, 0.1246337890625, 0.11474609375, 0.181640625, 0.22900390625, 0.171142578125, 0.1312255859375, 0.172607421875, 0.14208984375, 0.25634765625, 0.0299835205078125, 0.05487060546875, 0.1690673828125, 0.0712890625, 0.0157470703125, 0.0577697...

embed

16824706_c0

16824706

haskell

0

Title: Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? Problem title: Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? Tags: haskell, monoids Problem: Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? I'm writing a function pad that tak...

Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? haskell monoids Haskell Monoid Sum Haskell - wrapping and unwrapping newtype wrappers - is there an easier way? I'm writing a function pad that takes a list and pads ...

[ -0.01019287109375, -0.006683349609375, 0.016357421875, 0.03564453125, -0.0068359375, 0.03125, -0.01806640625, -0.0137939453125, 0.00946044921875, -0.00119781494140625, -0.01129150390625, -0.014404296875, 0.006072998046875, 0.00286865234375, 0.007568359375, -0.02587890625, 0.004791259...

[ 20625, 142508, 137565, 10366, 136, 51, 5429, 11, 26783, 3525, 50986, 21777, 99156, 3917, 1556, 22460, 30185, 77879, 532, 36335, 83, 2685, 32562, 32354, 7922, 51776, 5303, 24189, 24233, 13267, 37842, 116, 208124, 5117, 37202, 62775, 127689, 15...

[ 0.1339111328125, 0.27978515625, 0.1810302734375, 0.096923828125, 0.058135986328125, 0.1043701171875, 0.1134033203125, 0.094970703125, 0.067138671875, 0.111328125, 0.2469482421875, 0.1685791015625, 0.1768798828125, 0.08111572265625, 0.100341796875, 0.1256103515625, 0.1346435546875, ...

embed

23770200_c0

23770200

haskell

0

Title: Pattern matching against a type with only one constructor Problem title: Pattern matching against a type with only one constructor Tags: haskell, types, pattern-matching, constructor, lazy-evaluation Problem: Pattern matching against a type with only one constructor If I pattern-match against an expression whose...

Pattern matching against a type with only one constructor Pattern matching against a type with only one constructor haskell types pattern-matching constructor lazy-evaluation Pattern Prelude Test Fail Pattern matching against a type with only one constructor If I pattern-match against an expression whose type has only ...

[ -0.005279541015625, 0.00933837890625, -0.007293701171875, 0.00897216796875, 0.00726318359375, 0.001617431640625, -0.007232666015625, 0.00054168701171875, 0.01080322265625, -0.030517578125, 0.003997802734375, -0.007232666015625, 0.003875732421875, -0.01092529296875, -0.000957489013671875,...

[ 9876, 22766, 14858, 214, 26548, 10644, 4734, 1632, 64549, 1556, 142508, 52895, 103510, 98753, 748, 21, 3285, 159258, 822, 8647, 190355, 125195, 7464, 37772, 11675, 6032, 151575, 601, 841, 73493, 28007, 442, 22027, 18, 2806, 765, 84751, 18499,...

[ 0.15673828125, 0.1466064453125, 0.216552734375, 0.0143890380859375, 0.174560546875, 0.15234375, 0.0859375, 0.1243896484375, 0.1270751953125, 0.082275390625, 0.2039794921875, 0.1119384765625, 0.217041015625, 0.2421875, 0.1046142578125, 0.0062255859375, 0.08612060546875, 0.0992431640...

embed

8582444_c0

8582444

haskell

0

Title: Could Not Match Expected Type Integer with actual type float Problem title: Could Not Match Expected Type Integer with actual type float Tags: haskell Problem: Could Not Match Expected Type Integer with actual type float countSequences :: Int -> Int -> Integer countSequences 0 m = 0 countSequences m 0 = 0 countS...

Could Not Match Expected Type Integer with actual type float Could Not Match Expected Type Integer with actual type float haskell Could Not Match Expected Type Integer n-1 Float x-1 Could Not Match Expected Type Integer with actual type float i cant really understand why this error keep coming up .. the truncate is sup...

[ 0.00811767578125, 0.00872802734375, -0.02197265625, -0.00946044921875, 0.013916015625, -0.0155029296875, -0.0101318359375, -0.0024871826171875, 0.00665283203125, -0.001800537109375, -0.01806640625, -0.020263671875, 0.0189208984375, -0.002410888671875, 0.021484375, 0.00775146484375, 0...

[ 191147, 11205, 67407, 60075, 13, 89829, 60457, 44401, 678, 8561, 10644, 21917, 257, 1556, 142508, 653, 5759, 38699, 1022, 45767, 6183, 28219, 15400, 903, 18499, 13695, 1257, 14617, 19, 33478, 134598, 96760, 70, 1295, 47, 221 ]

[ 0.094482421875, 0.149658203125, 0.2025146484375, 0.121826171875, 0.1304931640625, 0.0662841796875, 0.1932373046875, 0.1986083984375, 0.1055908203125, 0.127197265625, 0.182861328125, 0.17724609375, 0.09857177734375, 0.1510009765625, 0.2216796875, 0.0277099609375, 0.156005859375, 0.1...

embed

9616515_c0

9616515

haskell

0

Title: Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? Problem title: Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? Tags: concurrency, atomic, haskell Problem: Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? I ...

Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? concurrency atomic haskell Control.Concurrent.Chan Chan MVar Are haskell channels `Control.Concurrent.Chan` safe for multiple readers/producers? I need ...

[ -0.00738525390625, 0.0111083984375, 0.01171875, 0.024169921875, -0.013916015625, 0.001678466796875, 0.002044677734375, -0.0250244140625, -0.01129150390625, -0.0169677734375, -0.0111083984375, 0.003204345703125, 0.006988525390625, 0.0220947265625, -0.00360107421875, 0.0019683837890625, ...

[ 15901, 1556, 142508, 86723, 7, 175904, 11935, 163812, 127008, 46002, 100, 48716, 120709, 102446, 1314, 108636, 982, 34627, 27131, 30448, 66160, 147, 25842, 133244, 5426, 1632, 99764, 17721, 86997, 4734, 107222, 5941, 108558, 209806, 1631, 14012, ...

[ 0.0294342041015625, 0.1341552734375, 0.2381591796875, 0.2222900390625, 0.045867919921875, 0.197021484375, 0.0477294921875, 0.2064208984375, 0.21435546875, 0.2027587890625, 0.04241943359375, 0.212646484375, 0.240478515625, 0.1788330078125, 0.05126953125, 0.1328125, 0.06781005859375, ...

embed

3107432_c0

3107432

haskell

0

Title: Using Haskell to extend Perl? Problem title: Using Haskell to extend Perl? Tags: haskell, perl, ffi Problem: Using Haskell to extend Perl? Has anyone ever written a Haskell extension to Perl? Maybe something simple, like a function that calculates the fib. sequence? I'm interested in using Haskell, and I see som...

Using Haskell to extend Perl? Using Haskell to extend Perl? haskell perl ffi Using Haskell Perl Using Haskell to extend Perl? Has anyone ever written a Haskell extension to Perl? Maybe something simple, like a function that calculates the fib. sequence? I'm interested in using Haskell, and I see some overlap between th...

[ 0.0196533203125, 0.024169921875, 0.0216064453125, -0.01043701171875, -0.004241943359375, -0.00701904296875, -0.017578125, -0.0084228515625, -0.0026702880859375, -0.0634765625, 0.006378173828125, -0.01141357421875, 0.027099609375, 0.004638671875, -0.0150146484375, -0.007476806640625, ...

[ 345, 6953, 20625, 142508, 47, 65042, 908, 141, 32, 1556, 117, 24500, 35672, 17669, 59121, 111938, 83425, 8781, 32354, 74481, 809, 275, 5, 40, 944, 3956, 60892, 17368, 645, 6324, 17721, 136, 26908, 6275, 77635, 21185, 8966, 111240, 4527, 1...

[ 0.1290283203125, 0.08123779296875, 0.1595458984375, 0.2548828125, 0.1002197265625, 0.197021484375, 0.201904296875, 0.197998046875, 0.026153564453125, 0.1317138671875, 0.15625, 0.1553955078125, 0.0177001953125, 0.04949951171875, 0.0736083984375, 0.2071533203125, 0.00909423828125, 0....

embed

35878282_c0

35878282

haskell

0

Title: Haskell get types of Data Constructor Problem title: Haskell get types of Data Constructor Tags: introspection, haskell Problem: Haskell get types of Data Constructor I was wondering if given a constructor, such as: data UserType = User { username :: String , password :: String } -- deriving whatever necessary W...

Haskell get types of Data Constructor Haskell get types of Data Constructor introspection haskell Haskell Data Constructor UserType User Typeable Haskell get types of Data Constructor I was wondering if given a constructor, such as: What the easiest way is for me to get something on the lines of [("username", String), ...

[ 0.0269775390625, -0.00543212890625, -0.01287841796875, 0.037353515625, -0.00872802734375, 0.013427734375, -0.002471923828125, 0.002838134765625, 0.0037689208984375, -0.06591796875, -0.0010223388671875, -0.029052734375, 0.00170135498046875, -0.0022430419921875, -0.011962890625, 0.001007...

[ 20625, 142508, 2046, 52895, 111, 11809, 82084, 18770, 64627, 16711, 1556, 53400, 196707, 60457, 2886, 149016, 34475, 64549, 748, 28, 1544, 525, 3917, 47, 9844, 124519, 65918, 11627, 830, 23351, 13409, 47416, 16610, 1660, 23009, 32562, 442, 27...

[ 0.128662109375, 0.1995849609375, 0.1463623046875, 0.257080078125, 0.055511474609375, 0.1370849609375, 0.1925048828125, 0.1695556640625, 0.042144775390625, 0.056854248046875, 0.1021728515625, 0.1544189453125, 0.2318115234375, 0.2056884765625, 0.177490234375, 0.0465087890625, 0.0383605...

embed

42240533_c0

42240533

haskell

0

Title: Infer constraints for both if and else of type equality Problem title: Infer constraints for both if and else of type equality Tags: type-families, dependent-type, haskell Problem: Infer constraints for both if and else of type equality I am trying to fill the hole in the following snippet import Data.Proxy impo...

Infer constraints for both if and else of type equality Infer constraints for both if and else of type equality type-families dependent-type haskell Data.Proxy GHC.TypeLits Data.Type.Equality Data.Type.Bool Unsafe.Coerce Infer Nat KnownNat Proxy Either Just Refl Left Nothing Right Infer constraints for both if and else...

[ -0.006500244140625, -0.011474609375, -0.00933837890625, 0.01214599609375, 0.0098876953125, -0.0022125244140625, -0.01953125, -0.0042724609375, -0.00046539306640625, 0.007354736328125, 0.01422119140625, -0.00250244140625, 0.012451171875, 0.01385498046875, 0.01416015625, -0.0029144287109...

[ 360, 2875, 158, 2816, 4288, 100, 15044, 2174, 136, 37076, 10644, 28, 161789, 69128, 108750, 50986, 1556, 142508, 11809, 10752, 50878, 73265, 196707, 9506, 933, 647, 929, 992, 115840, 10625, 56, 329, 68875, 70829, 4645, 18, 1250, 9563, 53295...

[ 0.1046142578125, 0.27392578125, 0.10394287109375, 0.2037353515625, 0.1402587890625, 0.021575927734375, 0.1060791015625, 0.1761474609375, 0.079833984375, 0.1796875, 0.1871337890625, 0.049407958984375, 0.2158203125, 0.1043701171875, 0.176025390625, 0.115966796875, 0.0965576171875, 0....

embed

6887244_c1

6887244

haskell

1

In the second argument of `(>>=)', namely `look cToD' I've found that this variation compiles well (type definitions are the same): x :: A -> M.Map A B -> M.Map B C -> Maybe C x a aToB bToC = look aToB a >>= look bToC where look = flip M.lookup y :: A -> M.Map A B -> M.Map B C -> M.Map C D -> Maybe D y a aToB bToC cTo...

[ 0.01031494140625, -0.0028228759765625, 0.00799560546875, 0.0174560546875, -0.00171661376953125, 0.017822265625, -0.0091552734375, 0.00665283203125, 0.0072021484375, -0.0052490234375, -0.005096435546875, -0.0126953125, -0.00141143798828125, 0.005828857421875, 0.0277099609375, -0.0071411...

[ 17932, 10750, 30813, 1369, 64747, 501, 7763, 397, 14037, 903, 143834, 9969, 1340, 7, 5299, 50986, 80934, 5701, 1022, 62, 33079, 276, 166179, 335, 313, 83425, 10, 571, 876, 441, 6713, 147505, 113, 391, 425, 2037, 28007, 3884, 10644, 143726...

[ 0.11865234375, 0.212890625, 0.237548828125, 0.2249755859375, 0.2724609375, 0.044036865234375, 0.2042236328125, 0.177734375, 0.04376220703125, 0.06146240234375, 0.2310791015625, 0.17041015625, 0.1783447265625, 0.0299072265625, 0.123291015625, 0.2142333984375, 0.1580810546875, 0.0899...

embed

13686078_c0

13686078

haskell

0

Title: Pattern match failure Problem title: Pattern match failure Tags: hugs, haskell Problem: Pattern match failure or am i just blind? Very easy easy function, throws "Pattern match failure: get_rtg db" type Movie = (Title,Regisseur,MainActors,ReleaseDate,Genre,SalesPrice) type Title = String type Regisseur = String ...

Pattern match failure Pattern match failure hugs haskell Pattern Movie Title Regisseur MainActors ReleaseDate Genre SalesPrice Actor Thriller Fantasy ScienceFiction Comedy Ord Show Database get_rtg ger_rtg Pattern match failure or am i just blind? Very easy easy function, throws "Pattern match failure: get_rtg db"

[ -0.0067138671875, 0.021728515625, 0.004241943359375, -0.01165771484375, 0.00579833984375, 0.000751495361328125, -0.0286865234375, 0.0068359375, 0.029541015625, -0.01904296875, 0.004791259765625, 0.00439453125, -0.004608154296875, -0.00494384765625, -0.00112152099609375, 0.0004844665527...

[ 9876, 22766, 14858, 137578, 35875, 7, 1556, 142508, 10348, 48962, 11678, 98138, 12321, 39450, 22230, 152590, 86291, 15937, 88583, 33163, 185617, 237110, 115016, 28745, 6159, 116512, 35379, 17367, 187781, 2046, 3198, 177, 4155, 707, 444, 17, 166...

[ 0.228759765625, 0.1953125, 0.251953125, 0.2880859375, 0.229736328125, 0.1090087890625, 0.159912109375, 0.275634765625, 0.1417236328125, 0.05621337890625, 0.0599365234375, 0.05145263671875, 0.035888671875, 0.06591796875, 0.00408935546875, 0.10272216796875, 0.0689697265625, 0.0972900...

embed

13831368_c1

13831368

haskell

1

0 r0 loop x r p rs i | (varLog "residual = " $ sqrt rs') < tol = (x',i) | otherwise = loop x' r' p' rs' (i+1) where mAp = mulMV mA p alpha = rs / (dot p mAp) x' = x + (alpha .* p) r' = r - (alpha .* mAp) rs' = dot r' r' beta = rs' / rs p' = r' + (beta .* p) (.*) :: (Num a) => a -> SpVCR a -> SpVCR a (.*) s v = fmap (s ...

[ -0.0267333984375, 0.0311279296875, 0.00933837890625, -0.0007171630859375, 0.0286865234375, 0.0026702880859375, -0.005279541015625, 0.0159912109375, 0.0137939453125, 0.0218505859375, 0.0108642578125, 0.01043701171875, -0.02001953125, -0.0081787109375, -0.0172119140625, 0.00537109375, ...

[ 757, 1690, 2389, 40956, 1022, 915, 151756, 17, 58745, 1961, 113972, 107, 5151, 20605, 2203, 3650, 864, 3198, 25, 4426, 31917, 425, 14, 120262, 21748, 47677, 16690, 61922, 144, 14612, 15464, 997, 20633, 51703, 59865, 839, 316, 10, 8019, 85...

[ 0.1728515625, 0.1490478515625, 0.1839599609375, 0.2437744140625, 0.10626220703125, 0.1429443359375, 0.154541015625, 0.126953125, 0.0227203369140625, 0.1351318359375, 0.237548828125, 0.070068359375, 0.1953125, 0.1939697265625, 0.011993408203125, 0.05517578125, 0.0904541015625, 0.151...

embed

40234447_c0

40234447

haskell

0

Title: Non-exhaustive functions in Haskell Problem title: Non-exhaustive functions in Haskell Tags: haskell Problem: Non-exhaustive functions in Haskell I wrote a function in Haskell: recognize :: [GrammarRule] -> State -> [String] -> Bool recognize [] x [s] = False recognize gr x [s] = if elem True (map (\state -> ele...

Non-exhaustive functions in Haskell Non-exhaustive functions in Haskell haskell Non-exhaustive Haskell GrammarRule State Bool w:ws r:rs End Step Non-exhaustive functions in Haskell I wrote a function in Haskell: this is non-exhaustive. What's the problem with the recognize function? Thanks a lot!!

[ -0.013427734375, 0.005218505859375, -0.00634765625, 0.0091552734375, -0.004058837890625, 0.00732421875, -0.00823974609375, -0.01055908203125, 0.002685546875, 0.00506591796875, 0.00933837890625, -0.00012493133544921875, 0.00335693359375, -0.01171875, 0.00299072265625, 0.0038909912109375...

[ 3775, 3355, 18391, 4935, 32354, 23, 20625, 142508, 1556, 48078, 1727, 26951, 133, 22836, 2460, 929, 148, 19725, 1690, 4295, 18878, 50478, 54397, 903, 83, 351, 9, 2967, 125296 ]

[ 0.1983642578125, 0.05743408203125, 0.156494140625, 0.1324462890625, 0.2093505859375, 0.032958984375, 0.1529541015625, 0.253173828125, 0.142333984375, 0.09234619140625, 0.07769775390625, 0.1695556640625, 0.042724609375, 0.1365966796875, 0.0775146484375, 0.163330078125, 0.0149841308593...

embed

19808944_c0

19808944

haskell

0

Title: Haskell input multiple numbers -> output multiple numbers + divide Problem title: Haskell input multiple numbers -> output multiple numbers + divide Tags: haskell Problem: Haskell input multiple numbers -> output multiple numbers + divide I want to get as an input 3 numbers and give as an output multiple r...

Haskell input multiple numbers -> output multiple numbers + divide Haskell input multiple numbers -> output multiple numbers + divide haskell a Haskell Integer Lab2.hs:17:17 Fractional Possible Failed Haskell input multiple numbers -> output multiple numbers + divide I want to get as an input 3 numbers and give a...

[ -0.00701904296875, 0.0001430511474609375, -0.003570556640625, 0.00775146484375, 0.006622314453125, 0.0038299560546875, 0.0010528564453125, -0.005950927734375, 0.0064697265625, -0.024658203125, -0.01171875, -0.01434326171875, 0.0179443359375, 0.016845703125, -0.01220703125, -0.002853393...

[ 20625, 142508, 107730, 48716, 101935, 5386, 140992, 997, 101637, 1556, 44401, 21488, 22950, 7868, 10763, 289, 115861, 2661, 190355, 297, 3444, 2046, 237, 138, 8337, 50339, 18151, 4966, 37202, 2967, 3688, 33172, 87, 9790, 54 ]

[ 0.15283203125, 0.227294921875, 0.1826171875, 0.2286376953125, 0.1524658203125, 0.11669921875, 0.1983642578125, 0.09588623046875, 0.2154541015625, 0.1544189453125, 0.1279296875, 0.0723876953125, 0.03619384765625, 0.11767578125, 0.07958984375, 0.03759765625, 0.1165771484375, 0.071105...

embed

9919954_c0

9919954

haskell

0

Title: Writing a function to get all subsequences of size n in Haskell? Problem title: Writing a function to get all subsequences of size n in Haskell? Tags: functional-programming, haskell Problem: Writing a function to get all subsequences of size n in Haskell? I was trying to write a function to get all subsequences...

Writing a function to get all subsequences of size n in Haskell? Writing a function to get all subsequences of size n in Haskell? functional-programming haskell Writing Haskell Writing a function to get all subsequences of size n in Haskell? I was trying to write a function to get all subsequences of a list that are of...

[ 0.00531005859375, 0.0155029296875, 0.00958251953125, 0.000545501708984375, -0.002105712890625, -0.0022125244140625, -0.014404296875, -0.00665283203125, 0.010986328125, -0.0103759765625, 0.0068359375, -0.015380859375, 0.0032958984375, 0.008056640625, -0.0093994140625, 0.00872802734375, ...

[ 213185, 32354, 2046, 756, 1614, 184, 26513, 5170, 13267, 653, 20625, 142508, 47, 23, 123309, 28966, 1556, 31577, 33022, 5303, 621, 111, 9077, 1672, 47644, 88303, 11809, 154663, 22144, 46312, 1810, 959, 115095, 71864, 25647, 3444, 10644, 17306...

[ 0.1390380859375, 0.2103271484375, 0.0811767578125, 0.1551513671875, 0.1597900390625, 0.15234375, 0.1749267578125, 0.04071044921875, 0.1583251953125, 0.1602783203125, 0.1451416015625, 0.2342529296875, 0.030059814453125, 0.02142333984375, 0.1080322265625, 0.03448486328125, 0.1096191406...

embed

31288206_c0

31288206

haskell

0

Title: How to insert a list in a list in all possible ways? Problem title: How to insert a list in a list in all possible ways? Tags: haskell, list Problem: How to insert a list in a list in all possible ways? I am trying to enumerate all the possible merges of two lists. In example inserting "bb" into "aaa" would look...

How to insert a list in a list in all possible ways? How to insert a list in a list in all possible ways? haskell list Data.List How Char How to insert a list in a list in all possible ways? I am trying to enumerate all the possible merges of two lists. In example inserting "bb" into "aaa" would look like What I curren...

[ 0.0017547607421875, 0.003387451171875, 0.007537841796875, 0.024169921875, -0.009521484375, 0.00994873046875, -0.02587890625, -0.034912109375, -0.0037384033203125, 0.00836181640625, 0.0152587890625, -0.0174560546875, 0.00762939453125, -0.00167083740234375, -0.0240478515625, 0.0155029296...

[ 11249, 47, 183540, 10, 5303, 23, 756, 7722, 48322, 1556, 142508, 11809, 154663, 21656, 31577, 189085, 42564, 7, 111, 6626, 27781, 5125, 3934, 84022, 2806, 6713, 1884, 82424, 903, 30646, 100, 158, 4460, 33, 79315, 37842, 20662, 1660, 53418, ...

[ 0.1376953125, 0.0865478515625, 0.2705078125, 0.072265625, 0.255126953125, 0.1378173828125, 0.1297607421875, 0.1470947265625, 0.1304931640625, 0.12353515625, 0.225830078125, 0.1046142578125, 0.1839599609375, 0.1611328125, 0.05792236328125, 0.12890625, 0.1614990234375, 0.012298583984...

embed

57892797_c0

57892797

haskell

0

Title: How to indent OSC config correctly Problem title: How to indent OSC config correctly Tags: haskell, indentation Problem: How to indent OSC config correctly I am trying to find the right indentation for an OSC configuration in a haskell file. When I write the following in two lines it unityTarget :: OSCTarget uni...

How to indent OSC config correctly How to indent OSC config correctly haskell indentation How OSC OSCTarget Nothing MessageStamp How to indent OSC config correctly I am trying to find the right indentation for an OSC configuration in a haskell file. When I write the following in two lines it works but if I use the foll...

[ -0.00070953369140625, -0.00909423828125, -0.003997802734375, 0.004791259765625, 0.0166015625, -0.00152587890625, -0.023193359375, -0.022216796875, -0.0005645751953125, -0.0027618408203125, -0.0057373046875, -0.0341796875, 0.0026397705078125, -0.00592041015625, 0.01068115234375, -0.0245...

[ 11249, 18597, 18, 180, 14495, 153837, 26785, 1556, 142508, 22062, 11787, 147, 3794, 182747, 48205, 4588, 42378, 2676, 538, 7108, 180346, 11435, 33022, 25632, 6626, 124519, 43240, 22027, 366, 18499, 44691, 98753, 1620, 27853, 143834 ]

[ 0.0216827392578125, 0.1727294921875, 0.1370849609375, 0.13330078125, 0.1922607421875, 0.239501953125, 0.119873046875, 0.10577392578125, 0.198486328125, 0.1199951171875, 0.1483154296875, 0.07421875, 0.139892578125, 0.1343994140625, 0.05023193359375, 0.0225830078125, 0.0550537109375, ...

embed

25944132_c0

25944132

haskell

0

Title: Do threaded binary tree structures offer any advantages in Haskell? Problem title: Do threaded binary tree structures offer any advantages in Haskell? Tags: algorithm, functional-programming, haskell, tree Problem: Do threaded binary tree structures offer any advantages in Haskell? I was reading this mailing lis...

Do threaded binary tree structures offer any advantages in Haskell? Do threaded binary tree structures offer any advantages in Haskell? algorithm functional-programming haskell tree Haskell Do threaded binary tree structures offer any advantages in Haskell? I was reading this mailing list post , where someone had a que...

[ 0.01611328125, 0.00848388671875, 0.007110595703125, -0.02001953125, 0.01513671875, 0.0078125, -0.01953125, -0.0031890869140625, -0.0040283203125, -0.04443359375, 0.0048828125, -0.006622314453125, -0.01324462890625, -0.01129150390625, -0.0054931640625, 0.0103759765625, 0.0078125, 0....

[ 86997, 297, 2394, 6635, 53201, 45646, 18645, 2499, 92940, 7, 20625, 142508, 23, 234873, 123309, 28966, 1556, 984, 45176, 105233, 1360, 90, 137567, 959, 4127, 6528, 6713, 37317, 1286, 93766, 222530, 5809, 64549, 7722 ]

[ 0.2100830078125, 0.109375, 0.1719970703125, 0.09735107421875, 0.2216796875, 0.1763916015625, 0.07611083984375, 0.044952392578125, 0.1646728515625, 0.03509521484375, 0.125, 0.2230224609375, 0.0291900634765625, 0.1038818359375, 0.1116943359375, 0.06817626953125, 0.090576171875, 0.033...

embed

50820687_c0

50820687

haskell

0

Title: How to convert string to an actual term in Haskell? Problem title: How to convert string to an actual term in Haskell? Tags: functional-programming, haskell Problem: How to convert string to an actual term in Haskell? I have defined the following data type data EventType = RUN_EVENT Integer | GIVE_ITEM Integer I...

How to convert string to an actual term in Haskell? How to convert string to an actual term in Haskell? functional-programming haskell How Haskell EventType RUN_EVENT Integer GIVE_ITEM Show How to convert string to an actual term in Haskell? I have defined the following data type and from some test, I'm retrieving data...

[ -0.0059814453125, 0.004638671875, -0.01904296875, 0.017333984375, -0.00189971923828125, 0.0003376007080078125, -0.00000155717134475708, -0.0026092529296875, -0.012939453125, -0.041015625, 0.005767822265625, -0.020751953125, 0.006591796875, 0.01300048828125, -0.0218505859375, 0.00141143...

[ 11249, 47, 96760, 79315, 142, 8561, 13579, 23, 20625, 142508, 123309, 28966, 1556, 36943, 196707, 130747, 647, 113114, 44401, 527, 96479, 25216, 594, 17367, 61924, 25632, 2053, 10644, 3034, 97351, 35064, 7103, 1884, 64549, 34292, 1496, 963, 2...

[ 0.0843505859375, 0.1240234375, 0.1947021484375, 0.2734375, 0.058563232421875, 0.2120361328125, 0.2357177734375, 0.06500244140625, 0.144287109375, 0.25146484375, 0.12109375, 0.052734375, 0.1104736328125, 0.1864013671875, 0.2061767578125, 0.1685791015625, 0.1207275390625, 0.226928710...

embed

46575006_c1

46575006

haskell

1

graphColor "abc" [1..6] e1 []) [[(6,'c'),(5,'a'),(4,'a'),(3,'c'),(2,'b'),(1,'a')]] Ex2: > take 1 (graphColor "abc" [1..4] e2 []) [] This is my code thus far which just returns the empty list no matter what. graphColor :: [Color] -> [Node] -> [Edge] -> Coloring -> [Coloring] -- Fill in your code here graphColor colors n...

[ -0.0294189453125, 0.006256103515625, -0.008544921875, 0.0093994140625, -0.000171661376953125, 0.0028228759765625, -0.04345703125, -0.007568359375, 0.00689697265625, 0.0205078125, -0.0048828125, -0.0022430419921875, 0.000885009765625, -0.00860595703125, -0.0086669921875, 0.0034484863281...

[ 41382, 10625, 1484, 2055, 238, 68252, 910, 28, 418, 139303, 104116, 105801, 86827, 275, 11, 5443, 304, 5646, 106, 617, 3293, 759, 18151, 2060, 1660, 30646, 201505, 5303, 110, 26866, 2367, 5021, 69489, 51193, 214, 140423, 23, 3688, 104988, ...

[ 0.2349853515625, 0.15234375, 0.2298583984375, 0.109130859375, 0.07464599609375, 0.0209197998046875, 0.0814208984375, 0.09027099609375, 0.0305328369140625, 0.06805419921875, 0.0159759521484375, 0.0313720703125, 0.0158843994140625, 0.0081787109375, 0.00152587890625, 0.0946044921875, 0....

embed

46749678_c0

46749678

haskell

0

Title: Haskell getter of data type Problem title: Haskell getter of data type Tags: haskell Problem: Haskell getter of data type Basically, I have 2 different structures - Point and Cell. Since there is an aggregation between them, I would like to somehow get the value of the Point just by having the cell - let's say a...

Haskell getter of data type Haskell getter of data type haskell Haskell Wall Point a.point a.point.x Show Cell Path Start End Haskell getter of data type Basically, I have 2 different structures - Point and Cell. Since there is an aggregation between them, I would like to somehow get the value of the Point just by havi...

[ -0.002166748046875, 0.0034942626953125, 0.00421142578125, 0.00408935546875, 0.006683349609375, -0.00567626953125, 0.00112152099609375, -0.01287841796875, 0.0008087158203125, -0.0230712890625, -0.0208740234375, 0.00148773193359375, -0.0174560546875, -0.0021514892578125, -0.0203857421875, ...

[ 20625, 142508, 2046, 720, 111, 2053, 10644, 1556, 23706, 41097, 10, 38496, 425, 17367, 80743, 108421, 13794, 18878, 116, 12921, 45646, 136, 197564, 17721, 2806, 1884, 209303, 34292, 1660, 390, 19441, 38750, 3095, 4734, 765, 32599, 6863, 31913...

[ 0.161865234375, 0.224609375, 0.1668701171875, 0.1629638671875, 0.068359375, 0.1214599609375, 0.142822265625, 0.16162109375, 0.20263671875, 0.1995849609375, 0.1290283203125, 0.2269287109375, 0.0816650390625, 0.11083984375, 0.1962890625, 0.17626953125, 0.090576171875, 0.11083984375, ...

embed

9515388_c1

9515388

haskell

1

arbitrary type, but constrained on their -- tk parameter. The StructV associated type captures the return -- type of the combined UI class (UITK tk) => FieldList tk l where type StructV tk l instance (UITK tk) => FieldList tk HNil where type StructV tk HNil = HNil instance (UITK tk, FieldList tk l) => FieldList tk (HC...

[ 0.0118408203125, 0.01904296875, -0.004119873046875, -0.0242919921875, 0.009033203125, 0.00323486328125, 0.01239013671875, -0.01708984375, 0.0186767578125, -0.00537109375, -0.0087890625, -0.0223388671875, 0.005462646484375, 0.00848388671875, -0.002044677734375, -0.0277099609375, 0.035...

[ 61799, 1294, 10644, 1284, 158, 9297, 122009, 98, 2363, 4210, 31472, 171859, 63667, 15390, 856, 137272, 141621, 30646, 70163, 111481, 18507, 33457, 29735, 117657, 154663, 96, 7440, 110527, 79059, 379, 73265, 5245, 10, 71713, 25553, 81118, 14240,...

[ 0.169921875, 0.050872802734375, 0.227783203125, 0.09918212890625, 0.0625, 0.1334228515625, 0.07720947265625, 0.015106201171875, 0.01300048828125, 0.043487548828125, 0.1817626953125, 0.1986083984375, 0.1934814453125, 0.1165771484375, 0.283203125, 0.1983642578125, 0.130859375, 0.1381...

embed

65704097_c1

65704097

haskell

1

1)-> r := r + 0 fi print(r) ./Main prog 1 1 1 1 1 ... The issue is probably a misuse of the spaces function but I can't seem to get the parsing correct even when I remove all of the instances of spaces such that everything is on a single line concatenated together. Even when I do that, it won't accept "fi" in the Parse...

[ -0.0108642578125, 0.00927734375, -0.01519775390625, 0.0223388671875, -0.0108642578125, 0.005035400390625, 0.0159912109375, -0.028076171875, 0.0203857421875, -0.01275634765625, -0.0224609375, -0.013916015625, -0.02587890625, -0.0074462890625, -0.000911712646484375, 0.00726318359375, 0...

[ 4879, 103607, 1690, 1369, 997, 757, 809, 28412, 42, 168793, 67973, 106, 153, 31089, 31895, 1239, 4032, 32628, 7, 32354, 831, 48903, 366, 6953, 26785, 87388, 756, 111, 110527, 26818, 98, 11001, 13315, 158, 4460, 33, 27686, 25842, 26946, 10...

[ 0.1168212890625, 0.148193359375, 0.162353515625, 0.0782470703125, 0.11083984375, 0.1597900390625, 0.232421875, 0.1981201171875, 0.1309814453125, 0.1690673828125, 0.2064208984375, 0.1220703125, 0.001129150390625, 0.06219482421875, 0.00982666015625, 0.035400390625, 0.0633544921875, 0...

embed

29860661_c0

29860661

haskell

0

Title: How do I force a function to be called immediately in Haskell? Problem title: How do I force a function to be called immediately in Haskell? Tags: memoization, lazy-evaluation, haskell Problem: How do I force a function to be called immediately in Haskell? This is my code: import Data.Function.Memoize import Deb...

How do I force a function to be called immediately in Haskell? How do I force a function to be called immediately in Haskell? memoization lazy-evaluation haskell Data.Function.Memoize Debug.Trace How Haskell How do I force a function to be called immediately in Haskell? This is my code: I expected it to print: But, ins...

[ 0.0031585693359375, 0.0106201171875, 0.02099609375, 0.000324249267578125, 0.0205078125, 0.00142669677734375, 0.006622314453125, 0.0002460479736328125, -0.0016937255859375, -0.040771484375, 0.0093994140625, 0.00885009765625, -0.01177978515625, 0.01220703125, 0.025146484375, -0.000507354...

[ 11249, 54, 37772, 32354, 47, 186, 35839, 109312, 23, 20625, 142508, 87, 163, 432, 47691, 21, 3285, 159258, 1556, 11809, 97249, 10763, 6696, 20650, 262, 85779, 28542, 18151, 84751, 28412, 4966, 64457, 903, 959, 29367, 237, 12638, 1733, 3584,...

[ 0.059326171875, 0.03338623046875, 0.2509765625, 0.2376708984375, 0.07373046875, 0.05316162109375, 0.22265625, 0.2391357421875, 0.052215576171875, 0.1756591796875, 0.26953125, 0.0285491943359375, 0.1551513671875, 0.1749267578125, 0.1005859375, 0.073486328125, 0.1224365234375, 0.1353...

embed

61416756_c2

61416756

haskell

2

out that this is because getRandomRs calls split on the current generator. This can be checked directly in this way: λ> λ> (sg0a, sg0b) = split sg0 λ> (tg0a, tg0b) = split tg0 λ> λ> :{ |λ> let { getRandomDouble :: RandomGen g => g -> Double ; |λ> getRandomDouble g = fst $ random g } |λ> :} λ> λ> λ> λ> getRandomDouble ...

[ -0.002593994140625, 0.0179443359375, -0.0010986328125, -0.0283203125, 0.0019683837890625, 0.01220703125, 0.01141357421875, -0.0166015625, 0.0018768310546875, -0.03369140625, 0.00958251953125, 0.037841796875, -0.00787353515625, 0.0146484375, 0.0228271484375, -0.002471923828125, -0.020...

[ 1810, 450, 903, 83, 6637, 2046, 126525, 3815, 1052, 7, 11782, 65450, 98, 43581, 145823, 5, 3293, 831, 12765, 297, 105237, 111147, 2740, 2389, 93170, 275, 2203, 8331, 34, 2661, 39643, 306, 105376, 706, 44357, 33079, 107172, 271, 3650, 9675...

[ 0.152587890625, 0.0657958984375, 0.108642578125, 0.0843505859375, 0.0787353515625, 0.13623046875, 0.1806640625, 0.1986083984375, 0.206787109375, 0.080810546875, 0.1253662109375, 0.2080078125, 0.036224365234375, 0.230712890625, 0.2418212890625, 0.012359619140625, 0.0284423828125, 0....

embed

29055867_c1

29055867

haskell

1

cast, year, fans) <- filmList] No instance for (IsChar [Char]) arising from a use of `printf' Possible fix: add an instance declaration for (IsChar [Char]) In the expression: printf ("|%s| |%-20s| |%2d| |%.1f|") title cast year fans In the first argument of `sequence_', namely `[printf ("|%s| |%-20s| |%2d| |%.1f|") ti...

[ 0.0045166015625, -0.0034942626953125, -0.0022125244140625, 0.01165771484375, -0.01409912109375, -0.0096435546875, 0.0017852783203125, 0.0252685546875, 0.0003681182861328125, 0.0294189453125, 0.0020599365234375, -0.021728515625, -0.0086669921875, 0.00191497802734375, -0.026123046875, -0...

[ 37702, 6602, 35992, 1346, 154663, 438, 110527, 100, 29598, 84068, 187, 72219, 4527, 35662, 420, 115861, 30022, 15190, 21635, 125195, 28412, 3949, 11033, 167218, 44759, 5117, 10750, 184, 944, 3956, 5440, 40, 71, 28864, 26073, 1914, 822, 11809,...

[ 0.185302734375, 0.2178955078125, 0.264892578125, 0.097412109375, 0.1824951171875, 0.06597900390625, 0.244140625, 0.06829833984375, 0.08837890625, 0.271240234375, 0.0675048828125, 0.034210205078125, 0.10638427734375, 0.199951171875, 0.2423095703125, 0.1302490234375, 0.1527099609375, ...

embed

20724962_c0

20724962

haskell

0

Title: mapping over entire data set to get results Problem title: mapping over entire data set to get results Tags: haskell Problem: mapping over entire data set to get results Suppose I have the arrays: A = "ABACUS" B = "YELLOW" And they are zipped so: Pairing = zip A B I also have a function Connect :: Char -> [(Char...

mapping over entire data set to get results mapping over entire data set to get results haskell ABACUS YELLOW Pairing Connect Char mapping over entire data set to get results Suppose I have the arrays: And they are zipped so: Pairing = zip A B I also have a function Connect :: Char -> [(Char,Char)] -> [(Char,Char,Int)]...

[ 0.0027313232421875, 0.0031585693359375, 0.0036773681640625, 0.0225830078125, -0.0047607421875, 0.014404296875, 0.006195068359375, -0.0177001953125, 0.00897216796875, -0.005706787109375, -0.0017242431640625, -0.0089111328125, -0.005828857421875, 0.00311279296875, -0.02587890625, -0.0134...

[ 291, 26783, 645, 64194, 2053, 5423, 2046, 50339, 47, 1556, 142508, 11321, 15012, 8762, 990, 174444, 1456, 37897, 2852, 62448, 21656, 10298, 4778, 3546, 48398, 68330, 62, 335, 32354, 84068, 18, 3444, 54, 34475, 21441, 7413, 136044, 7440, 133...

[ 0.1859130859375, 0.13623046875, 0.144287109375, 0.181640625, 0.1165771484375, 0.139404296875, 0.0968017578125, 0.2066650390625, 0.00146484375, 0.094482421875, 0.260986328125, 0.052459716796875, 0.0748291015625, 0.10986328125, 0.03216552734375, 0.1158447265625, 0.041534423828125, 0....

embed

4745921_c0

4745921

haskell

0

Title: How do I run my package's tests using different versions of its prerequisites? Problem title: How do I run my package's tests using different versions of its prerequisites? Tags: cabal, testing, integration-testing, haskell Problem: How do I run my package's tests using different versions of its prereq...

How do I run my package's tests using different versions of its prerequisites? How do I run my package's tests using different versions of its prerequisites? cabal testing integration-testing haskell different How How do I run my package's tests using different versions of its prerequisites? Suppose I've writ...

[ 0.01470947265625, -0.001953125, 0.0225830078125, 0.0017852783203125, -0.012451171875, 0.0091552734375, -0.005340576171875, 0.00150299072265625, 0.0034027099609375, 0.01031494140625, 0.00567626953125, 0.003662109375, 0.00160980224609375, 0.01708984375, -0.003936767578125, 0.01123046875,...

[ 11249, 54, 87, 11675, 759, 98169, 3768, 109921, 17368, 12921, 11389, 479, 107, 3181, 100758, 6863, 109524, 134234, 157353, 6954, 1556, 142508, 121691, 59121, 20625, 1884, 54452, 47, 52922, 4588, 11408, 297, 3714, 43240, 36279, 527, 73265, 206...

[ 0.10009765625, 0.03125, 0.0236053466796875, 0.1827392578125, 0.06939697265625, 0.2205810546875, 0.06475830078125, 0.27392578125, 0.087646484375, 0.20751953125, 0.21435546875, 0.1146240234375, 0.07489013671875, 0.145751953125, 0.1165771484375, 0.01873779296875, 0.1796875, 0.23583984...

embed

55316898_c1

55316898

haskell

1

The second part of my question is how to translate this into Hypothesis. AFAICT Hypothesis does not have any equivalent of the frequency generator. I am wondering whether I should attempt to build a frequency strategy myself from existing Hypothesis strategies, or if the idiom itself is not worth translating and I sho...

[ -0.014404296875, -0.0194091796875, 0.00146484375, -0.007659912109375, -0.0079345703125, 0.00170135498046875, 0.019775390625, -0.044189453125, 0.0224609375, -0.004791259765625, 0.00897216796875, 0.047607421875, -0.00024318695068359375, 0.0185546875, 0.006378173828125, -0.000850677490234...

[ 17932, 3642, 3900, 19309, 903, 3934, 168034, 2347, 6023, 164094, 959, 765, 183234, 12478, 944, 27771, 145823, 149016, 5608, 81887, 45367, 113857, 35978, 1295, 144573, 50531, 13373, 306, 68034, 41965, 143, 1916, 170846, 139392, 35604, 56649, 277...

[ 0.03021240234375, 0.0287322998046875, 0.1607666015625, 0.2039794921875, 0.06219482421875, 0.087158203125, 0.2100830078125, 0.2186279296875, 0.1781005859375, 0.055328369140625, 0.01318359375, 0.0179443359375, 0.1092529296875, 0.16162109375, 0.126708984375, 0.0535888671875, 0.261230468...

embed

33877487_c0

33877487

haskell

0

Title: Applicative implementation of Const Monoid Problem title: Applicative implementation of Const Monoid Tags: applicative, haskell, monoids Problem: Applicative implementation of Const Monoid instance Monoid m => Applicative (Const m) where pure _ = Const mempty Const f <*> Const v = Const (f `mappend` v) I do not ...

Applicative implementation of Const Monoid Applicative implementation of Const Monoid applicative haskell monoids Applicative Monoid Functor Identity Applicative implementation of Const Monoid I do not understand how can the definition of <*> type-check. On the left side f is constrained by the signature of <*> as in t...

[ -0.007354736328125, -0.0091552734375, 0.006500244140625, 0.0322265625, 0.04541015625, 0.01806640625, -0.005218505859375, -0.0025634765625, -0.0078125, -0.01495361328125, 0.0181884765625, -0.01055908203125, -0.00787353515625, 0.0277099609375, -0.00469970703125, 0.0025634765625, -0.000...

[ 5659, 11048, 4935, 208124, 1657, 271, 77879, 532, 41816, 1556, 142508, 22460, 30185, 28670, 18770, 71257, 959, 28219, 3642, 831, 80934, 1639, 2740, 10644, 9, 78292, 2161, 70, 25737, 5609, 1238, 158, 9297, 122009, 138256, 23, 151134, 123055, ...

[ 0.1627197265625, 0.188720703125, 0.1824951171875, 0.164794921875, 0.1644287109375, 0.1788330078125, 0.231689453125, 0.2198486328125, 0.1796875, 0.1041259765625, 0.217529296875, 0.1824951171875, 0.134521484375, 0.089599609375, 0.07098388671875, 0.150146484375, 0.0020751953125, 0.108...

embed

23572396_c1

23572396

haskell

1

type signature for withTempFile :: (MonadIO m, MonadCatch m) => FilePath -> String -> (FilePath -> Handle -> m a) -> m a In the expression: bracket (liftIO (openTempFile tmpDir template)) (\ (name, handle) -> liftIO (hClose handle >> ignoringIOErrors (removeFile name))) (uncurry action) In an equation for `withTempFil...

[ 0.0031890869140625, 0.01470947265625, -0.015380859375, -0.0264892578125, -0.000598907470703125, -0.009521484375, -0.01434326171875, -0.016357421875, 0.01007080078125, 0.002349853515625, 0.0030059814453125, 0.0001888275146484375, -0.0113525390625, 0.01422119140625, 0.01153564453125, -0....

[ 10644, 138256, 100, 678, 159065, 174350, 1984, 46674, 712, 17780, 347, 60331, 71, 76775, 206, 42724, 683, 10519, 23351, 214, 10639, 133, 10, 125195, 1620, 27853, 104501, 59636, 808, 2676, 397, 481, 110934, 11627, 34831, 60520, 59453, 47438, ...

[ 0.2303466796875, 0.279052734375, 0.020050048828125, 0.2147216796875, 0.26416015625, 0.266357421875, 0.0015869140625, 0.07177734375, 0.07958984375, 0.1939697265625, 0.09503173828125, 0.1234130859375, 0.0517578125, 0.135498046875, 0.1097412109375, 0.1231689453125, 0.053009033203125, ...

embed

43022221_c0

43022221

haskell

0

Title: Haskell Instances required for definition Problem title: Haskell Instances required for definition Tags: function, haskell Problem: Haskell Instances required for definition I have the following Haskell code, a function that checks how many digits are the same in a number and based on how many of them were the s...

Haskell Instances required for definition Haskell Instances required for definition function haskell Haskell Instances Haskell Instances required for definition I have the following Haskell code, a function that checks how many digits are the same in a number and based on how many of them were the same takes a value. I...

[ 0.0025482177734375, -0.0036468505859375, 0.0047607421875, -0.00836181640625, -0.0155029296875, 0.0169677734375, -0.0115966796875, -0.00927734375, 0.01708984375, -0.0145263671875, -0.014404296875, -0.018798828125, 0.01470947265625, 0.01904296875, 0.016845703125, -0.01531982421875, 0.0...

[ 20625, 142508, 360, 116071, 56065, 80934, 100, 32354, 1556, 25632, 18151, 12765, 3642, 5941, 153939, 621, 5701, 14012, 35509, 111, 2856, 3542, 51776, 10, 34292, 13695, 18499, 4865, 444, 87, 20594, 44691, 14602, 70, 29459, 66161, 1884, 43240, ...

[ 0.142578125, 0.2257080078125, 0.04547119140625, 0.2052001953125, 0.201416015625, 0.22412109375, 0.0215606689453125, 0.1563720703125, 0.126220703125, 0.0648193359375, 0.11865234375, 0.16064453125, 0.0289764404296875, 0.098876953125, 0.1907958984375, 0.042022705078125, 0.182861328125, ...

embed

57076728_c0

57076728

haskell

0

Title: What is the benefit of the MonadCatch? Problem title: What is the benefit of the MonadCatch? Tags: haskell Problem: What is the benefit of the MonadCatch? When I am writing some function which can fail: somefun :: (Monad m, ...) -> ... -> m a somefun ... = ... fail "some error" I can use fail to fail. But also I...

What is the benefit of the MonadCatch? What is the benefit of the MonadCatch? haskell What MonadCatch Monad MonadThrow Some MonadFail What is the benefit of the MonadCatch? When I am writing some function which can fail: I can use fail to fail. But also I can rewrite this function to use MonadThrow , so: So, today we g...

[ -0.0101318359375, 0.01904296875, 0.0128173828125, 0.0101318359375, 0.0245361328125, -0.016845703125, 0.00787353515625, 0, 0.0159912109375, 0.00823974609375, -0.01214599609375, -0.0223388671875, -0.0027923583984375, -0.009521484375, 0.0225830078125, -0.027099609375, -0.01422119140625,...

[ 4865, 68073, 111, 60331, 71, 76775, 206, 1556, 142508, 20800, 15555, 31384, 17647, 379, 83, 70, 32562, 32354, 831, 35782, 4527, 47, 456, 434, 18781, 678, 104250, 594, 33022, 12763, 5759, 133760, 20209, 35773, 1632, 55300, 28219, 142458, 676...

[ 0.0352783203125, 0.193603515625, 0.037109375, 0.182373046875, 0.1558837890625, 0.201416015625, 0.17431640625, 0.08709716796875, 0.2076416015625, 0.09967041015625, 0.187744140625, 0.0040283203125, 0.153564453125, 0.1298828125, 0.011871337890625, 0.042633056640625, 0.12744140625, 0.1...

embed

23375370_c0

23375370

haskell

0

Title: ghci show only typeclass methods Problem title: ghci show only typeclass methods Tags: haskell, ghci Problem: ghci show only typeclass methods In ghci you can run the :info command to learn about the methods defined on a type class, as well as see instances of that type class. For example, :info Eq outputs class...

ghci show only typeclass methods ghci show only typeclass methods haskell ghci Bool Defined GHC.Classes Map containers-0.5.0.0:Data.Map.Base Maybe Data.Maybe ghci show only typeclass methods In ghci you can run the :info command to learn about the methods defined on a type class, as well as see instances of that type c...

[ 0.009033203125, 0.0096435546875, 0.013427734375, 0.024658203125, -0.01171875, 0.0106201171875, -0.002838134765625, -0.003631591796875, 0.00555419921875, -0.01104736328125, -0.03076171875, -0.047119140625, -0.006072998046875, 0.0169677734375, -0.00762939453125, 0.006927490234375, -0.0...

[ 31380, 318, 7639, 4734, 10644, 67413, 150624, 1556, 142508, 2460, 929, 5983, 527, 73265, 140803, 42719, 116419, 93645, 99929, 137989, 166179, 63473, 83425, 11809, 82419, 831, 11675, 152, 7319, 75101, 30698, 61924, 18507, 1957, 110527, 864, 1409...

[ 0.13720703125, 0.1961669921875, 0.125244140625, 0.111572265625, 0.217041015625, 0.2357177734375, 0.22998046875, 0.11962890625, 0.195068359375, 0.05511474609375, 0.1363525390625, 0.09912109375, 0.05792236328125, 0.12109375, 0.1710205078125, 0.09637451171875, 0.1356201171875, 0.07598...

embed

2784698_c0

2784698

haskell

0

Title: Why is the recursion idiom in Haskell "'n+1' and 'n'" and not "'n' and 'n-1'"? Problem title: Why is the recursion idiom in Haskell "'n+1' and 'n'" and not "'n' and 'n-1'"? Tags: idioms, haskel...

Why is the recursion idiom in Haskell "'n+1' and 'n'" and not "'n' and 'n-1'"? Why is the recursion idiom in Haskell "'n+1' and 'n'" and not "'n' and 'n-1'"? idioms haskell recursion Why Haskell n-1 m...

[ -0.027587890625, 0.0014190673828125, 0.00592041015625, 0.0174560546875, 0.00118255615234375, 0.013427734375, -0.001129150390625, 0.0038299560546875, 0.0167236328125, -0.029052734375, 0.0225830078125, -0.0301513671875, 0.006561279296875, 0.0003662109375, 0.02099609375, -0.0233154296875,...

[ 44084, 83, 195625, 1830, 13373, 306, 23, 20625, 142508, 3768, 19, 21748, 959, 5759, 28016, 1556, 653, 759, 4332, 52721, 67, 418, 304, 136, 147756, 97595, 1507, 12877, 27983, 103510, 98753, 450, 25632, 37202, 123309, 31943, 1286, 100270, 132...

[ 0.146240234375, 0.05462646484375, 0.252197265625, 0.1104736328125, 0.177490234375, 0.1783447265625, 0.030487060546875, 0.1600341796875, 0.241455078125, 0.1441650390625, 0.127197265625, 0.2666015625, 0.0966796875, 0.1834716796875, 0.0660400390625, 0.09710693359375, 0.0823974609375, ...

embed

20036672_c0

20036672

haskell

0

Title: Haskell Recursion Scanl Problem title: Haskell Recursion Scanl Tags: loops, list, haskell, function, recursion Problem: Haskell Recursion Scanl I am trying to recursively pass in different values looping over eachother to be put into a function. I have this so far: randNum f = take 20 (iterate f 300) where f n =...

Haskell Recursion Scanl Haskell Recursion Scanl loops list haskell function recursion Haskell Recursion Scanl Point Expression Term Type Integer Does Haskell Recursion Scanl I am trying to recursively pass in different values looping over eachother to be put into a function. I have this so far: ( getInts is simply cycl...

[ -0.0189208984375, -0.00133514404296875, 0.00634765625, 0.001434326171875, -0.0169677734375, 0.02197265625, 0.0037841796875, -0.0030364990234375, 0.0034027099609375, -0.041748046875, 0.02294921875, -0.00885009765625, -0.00091552734375, -0.004913330078125, 0.0118408203125, -0.0126953125,...

[ 20625, 142508, 165428, 42, 6889, 65533, 141, 40956, 5303, 1556, 32354, 195625, 41097, 25129, 2994, 60457, 44401, 101790, 31577, 5844, 27875, 23, 12921, 142424, 645, 126340, 3884, 2060, 2046, 4153, 933, 42856, 105823, 101935, 27388, 839, 316, ...

[ 0.125244140625, 0.226806640625, 0.142822265625, 0.1591796875, 0.126220703125, 0.200927734375, 0.1649169921875, 0.1580810546875, 0.1378173828125, 0.1234130859375, 0.1397705078125, 0.2049560546875, 0.1219482421875, 0.1175537109375, 0.0931396484375, 0.130126953125, 0.19287109375, 0.04...

embed

20109660_c0

20109660

haskell

0

Title: Should I be removing vertex buffer objects on every draw? Problem title: Should I be removing vertex buffer objects on every draw? Tags: opengl, openglraw, haskell Problem: Should I be removing vertex buffer objects on every draw? I have some Haskell / OpenGLRaw code that does something like this: verticesPtr <-...

Should I be removing vertex buffer objects on every draw? Should I be removing vertex buffer objects on every draw? opengl openglraw haskell Should gl_DOUBLE gl_ARRAY_BUFFER gl_STREAM_DRAW gl_LINE_STRIP Should I be removing vertex buffer objects on every draw? I have some Haskell / OpenGLRaw code that does something li...

[ -0.01458740234375, 0.01953125, 0.00213623046875, -0.0234375, -0.007293701171875, 0.00148773193359375, 0.007354736328125, 0.004425048828125, 0.004974365234375, -0.0185546875, 0.0093994140625, -0.058349609375, 0.015869140625, -0.02783203125, -0.02099609375, -0.00982666015625, 0.0079345...

[ 151117, 49146, 6496, 493, 24371, 373, 18234, 36746, 11907, 79442, 98, 9803, 11016, 81456, 1556, 142508, 39575, 32616, 125149, 166007, 1723, 15639, 919, 66804, 56564, 8922, 397, 118324, 57339, 94539, 10931, 7, 20625, 13527, 78703, 12248, 434, ...

[ 0.0712890625, 0.1107177734375, 0.0606689453125, 0.1353759765625, 0.2137451171875, 0.1334228515625, 0.265869140625, 0.201904296875, 0.140380859375, 0.201171875, 0.050567626953125, 0.0888671875, 0.1175537109375, 0.1971435546875, 0.06488037109375, 0.2171630859375, 0.120361328125, 0.06...

embed

46826700_c0

46826700

haskell

0

Title: How to create a generic Complex type in haskell? Problem title: How to create a generic Complex type in haskell? Tags: haskell Problem: How to create a generic Complex type in haskell? I want to create a Complex type to represent complex numbers. Following works: Prelude> data Complex = Complex Int Int Prelude> ...

How to create a generic Complex type in haskell? How to create a generic Complex type in haskell? haskell How Complex Prelude Num Data Use ExistentialQuantification GADTs How to create a generic Complex type in haskell? I want to create a Complex type to represent complex numbers. Following works: How can I change this...

[ -0.003662109375, 0.0380859375, 0.0057373046875, 0.0101318359375, 0.0260009765625, 0.0032806396484375, 0.00689697265625, -0.013916015625, 0.00048828125, -0.013671875, -0.00176239013671875, -0.0478515625, 0.00025177001953125, -0.007354736328125, -0.02783203125, 0.0198974609375, -0.0093...

[ 11249, 28282, 189534, 113197, 10644, 23, 1556, 142508, 47, 10, 1914, 822, 52782, 11809, 122688, 41274, 23749, 41072, 3444, 33636, 27140, 101935, 77168, 15549, 903, 26946, 2499, 64457, 360, 18, 25632, 18499, 4358 ]

[ 0.034393310546875, 0.15087890625, 0.2393798828125, 0.26806640625, 0.2232666015625, 0.04815673828125, 0.1383056640625, 0.209228515625, 0.0283203125, 0.032470703125, 0.01873779296875, 0.0858154296875, 0.1646728515625, 0.0517578125, 0.07861328125, 0.019500732421875, 0.00506591796875, ...

embed