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
25046000_c1	25046000	haskell	1	I could create a map of ResumableSinks, there is a library in Hackage for that, but it depends on an old and very specific version of Conduit, so cabal couldn't install it. In the end I didn't find a way to write the function with the previous type, able to work with any sink, so I came up with a function that works w...	I could create a map of ResumableSinks, there is a library in Hackage for that, but it depends on an old and very specific version of Conduit, so cabal couldn't install it. In the end I didn't find a way to write the function with the previous type, able to work with any sink, so I came up with a function that works w...	[ 0.00653076171875, -0.0108642578125, -0.00372314453125, -0.00592041015625, -0.01409912109375, -0.017822265625, 0.0010528564453125, 0.0048828125, -0.00958251953125, 0.00014495849609375, -0.00830078125, 0.010009765625, 0.0191650390625, 0.0235595703125, 0.0028076171875, -0.021240234375, ...	[ 5809, 28282, 22288, 9624, 316, 2886, 294, 14068, 7, 35773, 1294, 52922, 4588, 56566, 10332, 4552, 29458, 11389, 1657, 112061, 109524, 69427, 18, 20600, 3564, 33022, 32354, 96362, 10644, 4488, 2499, 880, 92, 1257, 43240, 678, 102158, 105237, ...	[ 0.048492431640625, 0.1497802734375, 0.23193359375, 0.077392578125, 0.1956787109375, 0.1661376953125, 0.089599609375, 0.2222900390625, 0.06298828125, 0.14501953125, 0.0217437744140625, 0.1807861328125, 0.2056884765625, 0.1153564453125, 0.0179595947265625, 0.005828857421875, 0.08715820...	embed
42384473_c0	42384473	haskell	0	Title: confusion over the passing of State monad in Haskell Problem title: confusion over the passing of State monad in Haskell Tags: monads, state-monad, haskell Problem: confusion over the passing of State monad in Haskell In Haskell the State is monad is passed around to extract and store state. And in the two follo...	confusion over the passing of State monad in Haskell confusion over the passing of State monad in Haskell monads state-monad haskell State Haskell GameValue GameState Bool score-1 confusion over the passing of State monad in Haskell In Haskell the State is monad is passed around to extract and store state. And in the t...	[ -0.0062255859375, 0.00182342529296875, 0.01458740234375, -0.018798828125, 0.0072021484375, -0.01470947265625, -0.0164794921875, -0.0035400390625, 0.0023193359375, -0.0133056640625, 0.02099609375, 0.0341796875, -0.0224609375, 0.01165771484375, -0.007598876953125, -0.007232666015625, 0...	[ 169463, 645, 452, 6953, 111, 22836, 2667, 712, 23, 20625, 142508, 11341, 3796, 1556, 13547, 856, 50770, 135206, 2460, 929, 47763, 5759, 70, 83, 115081, 10932, 47, 125663, 136, 4343, 6626, 25632, 27781, 15044, 27875, 17368, 6396, 20903, 493,...	[ 0.199462890625, 0.036376953125, 0.140625, 0.03912353515625, 0.0093994140625, 0.2476806640625, 0.14453125, 0.221435546875, 0.1121826171875, 0.1580810546875, 0.287841796875, 0.220703125, 0.11083984375, 0.126953125, 0.0848388671875, 0.1129150390625, 0.1036376953125, 0.1395263671875, ...	embed
10345504_c0	10345504	haskell	0	Title: Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary Problem title: Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary Tags: haskell, quickcheck Problem: Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary I have a function that takes a Respons...	Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary haskell quickcheck an Generate Network.HTTP.ResponseCode Arbitrary ResponseCode Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary I have a functi...	[ -0.01544189453125, 0.000949859619140625, 0.0235595703125, -0.004425048828125, 0.0078125, 0.00970458984375, -0.0220947265625, -0.014892578125, -0.0002880096435546875, -0.0194091796875, -0.004974365234375, 0.01611328125, 0.0135498046875, 0.01068115234375, 0.0024871826171875, -0.000059843...	[ 155370, 67, 162738, 24447, 18244, 18544, 23658, 94399, 114211, 17368, 110527, 242522, 1294, 1556, 142508, 63773, 78292, 28997, 92748, 32354, 51776, 3034, 89038, 202567, 33022, 23, 933, 35773, 10644, 4153, 18, 360, 54397, 527, 73265, 186992, 391...	[ 0.1678466796875, 0.030426025390625, 0.283203125, 0.01318359375, 0.05792236328125, 0.03228759765625, 0.09759521484375, 0.142822265625, 0.1937255859375, 0.01885986328125, 0.1514892578125, 0.200927734375, 0.163818359375, 0.0977783203125, 0.1800537109375, 0.09130859375, 0.2161865234375, ...	embed
34052377_c0	34052377	haskell	0	Title: Visualizing the Free Monad Problem title: Visualizing the Free Monad Tags: free-monad, haskell, monads Problem: Visualizing the Free Monad I think I have rough idea of what the free monad is, but I would like to have a better way to visualize it. It makes sense that free magmas are just binary trees because that...	Visualizing the Free Monad Visualizing the Free Monad free-monad haskell monads Visualizing Free Monad Visualizing the Free Monad I think I have rough idea of what the free monad is, but I would like to have a better way to visualize it. It makes sense that free magmas are just binary trees because that's as "general" ...	[ 0.006134033203125, 0.015625, 0.00011873245239257812, 0.004180908203125, 0.0169677734375, 0.00531005859375, -0.0230712890625, 0.002471923828125, -0.011962890625, 0.00037384033203125, 0.002899169921875, -0.013671875, 0.001068115234375, 0.0189208984375, -0.020263671875, -0.002273559570312...	[ 73372, 84382, 5153, 60331, 71, 4092, 3796, 712, 1556, 142508, 2667, 166904, 6528, 2367, 70, 83, 11522, 21176, 20650, 10422, 1697, 1510, 621, 1660, 2394, 6635, 1360, 237, 180300, 15490, 388, 4677, 22460, 30185, 5303, 12989, 41018, 18, 26866,...	[ 0.1837158203125, 0.08935546875, 0.171142578125, 0.18115234375, 0.156494140625, 0.211181640625, 0.111328125, 0.2073974609375, 0.052734375, 0.1788330078125, 0.1514892578125, 0.009307861328125, 0.04541015625, 0.03436279296875, 0.01409912109375, 0.06640625, 0.0229034423828125, 0.183349...	embed
24350542_c0	24350542	haskell	0	Title: Optimizing sum, ZipList, Vector, and unboxed types Problem title: Optimizing sum, ZipList, Vector, and unboxed types Tags: optimization, lazy-evaluation, haskell Problem: Optimizing sum, ZipList, Vector, and unboxed types I have identified the following hotspot function that is currently 25% of my program execut...	Optimizing sum, ZipList, Vector, and unboxed types Optimizing sum, ZipList, Vector, and unboxed types optimization lazy-evaluation haskell Optimizing ZipList Vector EncodeLookup GF256Elm Given Polynomial COST CENTRE calc.f calc.f.s calc.f.lst calc.f.zl Optimizing sum, ZipList, Vector, and unboxed types I have identifie...	[ 0.00982666015625, 0.005126953125, 0.01263427734375, -0.004791259765625, -0.0235595703125, -0.01531982421875, 0.006134033203125, -0.00311279296875, 0.0177001953125, -0.007659912109375, 0.0072021484375, -0.00506591796875, -0.00083160400390625, -0.019775390625, -0.0107421875, 0.0092773437...	[ 43938, 84382, 10554, 162150, 154663, 2609, 18770, 51, 11728, 52895, 87235, 21, 3285, 159258, 1556, 142508, 357, 40899, 15363, 31, 11322, 79035, 127892, 7623, 39, 63306, 1687, 313, 34274, 89859, 6510, 420, 207487, 25632, 8010, 53370, 32354, 82...	[ 0.193115234375, 0.0849609375, 0.2353515625, 0.21240234375, 0.239013671875, 0.16455078125, 0.175537109375, 0.078125, 0.1875, 0.1885986328125, 0.174072265625, 0.07525634765625, 0.1494140625, 0.13671875, 0.0994873046875, 0.194580078125, 0.006927490234375, 0.1082763671875, 0.02210998...	embed
20941828_c0	20941828	haskell	0	Title: quickcheck test failing Problem title: quickcheck test failing Tags: quickcheck, haskell Problem: quickcheck test failing I have a simple function set of converse functions (simple shift codes): encode, decode :: Int -> String -> String and they test fine by some simple manual tests, but a quickCheck test report...	quickcheck test failing quickcheck test failing quickcheck haskell Data.Char Failed Falsifiable Main let2int int2let Char quickcheck test failing I have a simple function set of converse functions (simple shift codes): and they test fine by some simple manual tests, but a quickCheck test reports a failure: But running ...	[ 0.00616455078125, 0.005615234375, 0.0184326171875, 0.01806640625, -0.01129150390625, -0.01312255859375, -0.000530242919921875, -0.01708984375, -0.006805419921875, 0.04541015625, 0.0032806396484375, -0.0093994140625, 0.013427734375, 0.000560760498046875, -0.021240234375, 0.01123046875, ...	[ 63773, 78292, 3034, 35782, 1556, 142508, 11809, 84068, 190355, 22225, 27430, 12321, 2633, 4288, 304, 1974, 21656, 8781, 32354, 5423, 158, 37676, 191560, 122925, 18151, 5885, 23009, 109921, 202567, 117729, 137578, 51042, 5701, 3535, 43240, 15400, ...	[ 0.1243896484375, 0.2474365234375, 0.171875, 0.185546875, 0.051055908203125, 0.16845703125, 0.0266265869140625, 0.1390380859375, 0.12109375, 0.049407958984375, 0.03839111328125, 0.0118408203125, 0.07086181640625, 0.0545654296875, 0.0256805419921875, 0.132568359375, 0.1209716796875, ...	embed
37040814_c0	37040814	haskell	0	Title: Why Haskell takes one argument Problem title: Why Haskell takes one argument Tags: currying, haskell Problem: Why Haskell takes one argument I'm trying to figure out the cause and effect logics behind "Currying" and comes to the following results： Multiple arguments function can be expressed as either tuple(comb...	Why Haskell takes one argument Why Haskell takes one argument currying haskell Why Haskell Why Haskell takes one argument I'm trying to figure out the cause and effect logics behind "Currying" and comes to the following results： Multiple arguments function can be expressed as either tuple(combining multiple arguments w...	[ 0.0164794921875, -0.00653076171875, 0.01129150390625, 0.008056640625, 0.01043701171875, 0.0108642578125, -0.0002079010009765625, 0.0029754638671875, 0.007537841796875, -0.0284423828125, 0.00634765625, -0.041748046875, -0.01177978515625, 0.010498046875, -0.017578125, -0.01080322265625, ...	[ 44084, 20625, 142508, 51776, 1632, 10750, 198555, 214, 1556, 26366, 22304, 21543, 62775, 50155, 33177, 56216, 19335, 8705, 32354, 36510, 370, 277, 964, 48716, 52895, 5303, 5701, 10644, 756, 831, 237, 11001, 23, 4734, 29479, 155937, 345, 17065...	[ 0.0904541015625, 0.1395263671875, 0.2440185546875, 0.1248779296875, 0.2037353515625, 0.26611328125, 0.221435546875, 0.137451171875, 0.1082763671875, 0.0096435546875, 0.042724609375, 0.0743408203125, 0.138671875, 0.061126708984375, 0.0843505859375, 0.1490478515625, 0.1165771484375, ...	embed
27696465_c0	27696465	haskell	0	Title: How is FRP handled in terms of memory? Problem title: How is FRP handled in terms of memory? Tags: frp, haskell, memory-management Problem: How is FRP handled in terms of memory? Reading about FRP ( Functional Reactive Programming ) I'm amazed about how intuitive and logical it seems compared to the standard imp...	How is FRP handled in terms of memory? How is FRP handled in terms of memory? frp haskell memory-management How FRP How is FRP handled in terms of memory? Reading about FRP ( Functional Reactive Programming ) I'm amazed about how intuitive and logical it seems compared to the standard imperative approach; one thing how...	[ 0.00341796875, 0.02001953125, 0.0017242431640625, 0.0162353515625, 0.000255584716796875, 0.01220703125, 0.02001953125, 0.00677490234375, 0.0157470703125, -0.032470703125, 0.00897216796875, 0.010009765625, 0.01513671875, 0.032470703125, 0.0042724609375, 0.004364013671875, 0.0079956054...	[ 11249, 563, 38796, 34831, 71, 69407, 98323, 14119, 254, 1556, 142508, 87140, 83, 111, 28670, 10763, 853, 71232, 27958, 100270, 62775, 37202, 5570, 222530, 51515, 104192, 22027, 18, 13909, 109312, 11675, 1810, 20594, 23, 28484, 32692, 3166, 13...	[ 0.070068359375, 0.1304931640625, 0.291748046875, 0.175048828125, 0.1097412109375, 0.115478515625, 0.2100830078125, 0.135498046875, 0.176513671875, 0.0977783203125, 0.21337890625, 0.1405029296875, 0.0235443115234375, 0.01849365234375, 0.0654296875, 0.003509521484375, 0.0865478515625, ...	embed
41687700_c1	41687700	haskell	1	# LANGUAGE TemplateHaskell #-} {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE ViewPatterns #-} import Yesod import Network.Wai (pathInfo, rawPathInfo, requestMethod, responseLBS) import Data.Text (Text) import Text.Blaze (preEscapedText) import Control.Exception (IOException, try) import Control.Monad (when) data HelloWorl...	# LANGUAGE TemplateHaskell #-} {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE ViewPatterns #-} import Yesod import Network.Wai (pathInfo, rawPathInfo, requestMethod, responseLBS) import Data.Text (Text) import Text.Blaze (preEscapedText) import Control.Exception (IOException, try) import Control.Monad (when) data HelloWorl...	[ 0.0279541015625, 0.016357421875, -0.0040283203125, 0.00098419189453125, -0.00982666015625, 0.0020751953125, 0.00506591796875, -0.0208740234375, 0.0029754638671875, -0.05517578125, -0.000499725341796875, 0.004669189453125, -0.03515625, -0.0289306640625, 0.0106201171875, 0.00241088867187...	[ 98064, 196631, 6495, 7, 142508, 60457, 919, 1191, 29805, 8335, 3055, 24927, 32635, 2199, 28997, 22489, 14, 128405, 93147, 49649, 10519, 50336, 7352, 57553, 48097, 11809, 174379, 24129, 94901, 4692, 98224, 27131, 5, 63928, 17780, 9790, 46674, ...	[ 0.083251953125, 0.215576171875, 0.0911865234375, 0.039825439453125, 0.2333984375, 0.152099609375, 0.009063720703125, 0.08648681640625, 0.093994140625, 0.0615234375, 0.031219482421875, 0.135986328125, 0.1357421875, 0.2076416015625, 0.083251953125, 0.102294921875, 0.091796875, 0.0621...	embed
45069784_c1	45069784	haskell	1	::Text) 4 But when I try to typecheck the type definition that appears for somefunction "" ( (IsString t, AClass t) => AType t ) I get an ugly error from the type checker, even when I'm just copying the type I got from the typechecker! Main> :t somefunction "" somefunction "" :: (IsString t, AClass t) => AType t Main...	::Text) 4 But when I try to typecheck the type definition that appears for somefunction "" ( (IsString t, AClass t) => AType t ) I get an ugly error from the type checker, even when I'm just copying the type I got from the typechecker! Main> :t somefunction "" somefunction "" :: (IsString t, AClass t) => AType t Main...	[ 0.01214599609375, -0.032958984375, -0.00016498565673828125, 0.0037384033203125, -0.0003261566162109375, -0.017578125, 0.0135498046875, 0.006378173828125, -0.00762939453125, -0.00127410888671875, -0.0022125244140625, -0.0184326171875, -0.00457763671875, -0.021484375, 0.0028533935546875, ...	[ 1984, 174379, 201, 4966, 9790, 10644, 78292, 80934, 135179, 3060, 137175, 29598, 71713, 214, 808, 62, 140803, 196707, 110608, 18499, 12765, 56, 43658, 4163, 168793, 18, 44, 10433, 71232, 16619, 191147, 14858, 84751, 284, 678, 8561, 2389, 3235...	[ 0.0257415771484375, 0.10675048828125, 0.0811767578125, 0.01824951171875, 0.05841064453125, 0.250244140625, 0.259521484375, 0.1920166015625, 0.0999755859375, 0.13134765625, 0.214599609375, 0.0771484375, 0.1402587890625, 0.05908203125, 0.1168212890625, 0.0931396484375, 0.1949462890625,...	embed
6945288_c0	6945288	haskell	0	Title: Lock-free programming in Haskell Problem title: Lock-free programming in Haskell Tags: haskell, lock-free Problem: Lock-free programming in Haskell Does anyone know if it is possible to do lock-free programming in Haskell? I'm interested both in the question of whether the appropriate low-level primitives are av...	Lock-free programming in Haskell Lock-free programming in Haskell haskell lock-free Lock-free Haskell Lock-free programming in Haskell Does anyone know if it is possible to do lock-free programming in Haskell? I'm interested both in the question of whether the appropriate low-level primitives are available, and (if the...	[ 0.00335693359375, 0.03125, 0.015625, -0.0198974609375, 0.00958251953125, -0.0019683837890625, -0.0093994140625, -0.01019287109375, -0.01019287109375, -0.029052734375, -0.0081787109375, -0.031494140625, 0.00732421875, 0.014892578125, -0.0038909912109375, 0.019287109375, 0.004119873046...	[ 80002, 32087, 56037, 449, 23, 20625, 142508, 1556, 56776, 35672, 3714, 2174, 7722, 54, 9, 60892, 95307, 27226, 67919, 128489, 90, 19882, 4677, 43240, 17368, 45367, 150679, 57965, 76519, 123309, 43701, 28219, 27131, 163812, 127008, 86723, 88303,...	[ 0.189697265625, 0.2220458984375, 0.2081298828125, 0.0889892578125, 0.08050537109375, 0.1343994140625, 0.2430419921875, 0.10595703125, 0.19091796875, 0.01934814453125, 0.07171630859375, 0.01776123046875, 0.1339111328125, 0.045684814453125, 0.04779052734375, 0.029998779296875, 0.070861...	embed
56607901_c0	56607901	haskell	0	Title: How to extract Values from Sqllite in Yesod persistant Problem title: How to extract Values from Sqllite in Yesod persistant Tags: haskell, yesod Problem: How to extract Values from Sqllite in Yesod persistant I am using Yesod for the first time, I tried out the scaffolded website ,with some minor changes I was ...	How to extract Values from Sqllite in Yesod persistant How to extract Values from Sqllite in Yesod persistant haskell yesod Sqllite How Values Yesod SELECT WHERE PersistText google-uid:11111111111 User Text UniqueUser Typeable Couldn EntityField Maybe UserId How to extract Values from Sqllite in Yesod persistant I am u...	[ 0.0091552734375, 0.014892578125, 0.00016498565673828125, -0.00213623046875, -0.00836181640625, 0.0223388671875, -0.014892578125, -0.00067901611328125, 0.0002918243408203125, -0.041015625, 0.01495361328125, -0.0274658203125, -0.0272216796875, -0.0263671875, -0.0025482177734375, -0.01495...	[ 11249, 125663, 190060, 7, 1295, 159, 99247, 27287, 32635, 2199, 70560, 1236, 47, 23, 1556, 142508, 2422, 23722, 6755, 144832, 841, 30096, 57309, 271, 174379, 26484, 34, 532, 97024, 159019, 53400, 24129, 11789, 1062, 2189, 60457, 2886, 191147,...	[ 0.044036865234375, 0.2276611328125, 0.2490234375, 0.0982666015625, 0.126220703125, 0.0810546875, 0.1954345703125, 0.300537109375, 0.1751708984375, 0.2493896484375, 0.1875, 0.135986328125, 0.00677490234375, 0.027130126953125, 0.0958251953125, 0.1881103515625, 0.108154296875, 0.17272...	embed
59093287_c0	59093287	haskell	0	Title: Equations for `someFunction' have different numbers of arguments Problem title: Equations for `someFunction' have different numbers of arguments Tags: haskell Problem: Equations for `someFunction' have different numbers of arguments I'm using in order to practice/learn Haskell. I'm having trouble under...	Equations for `someFunction' have different numbers of arguments Equations for `someFunction' have different numbers of arguments haskell Data.List System.IO Equations Codewars.Kata.Negative Num Codewars Kata Negative.hs:4:1 Negative.hs:4:1-22 Negative.hs:5:1-41 Equations for `someFunction' have different num...	[ 0.0194091796875, -0.01214599609375, -0.035888671875, -0.020263671875, 0.006866455078125, 0.0120849609375, 0.00101470947265625, 0.0009002685546875, 0.0086669921875, 0.01324462890625, -0.0230712890625, -0.05224609375, 0.00592041015625, 0.01409912109375, -0.0059814453125, -0.0027160644531...	[ 241, 13722, 5256, 100, 43452, 97249, 10763, 3768, 765, 12921, 101935, 10750, 1556, 142508, 11809, 154663, 12353, 17780, 28864, 4205, 7, 79940, 11, 6433, 208, 4935, 52782, 15267, 221717, 127, 617, 19721, 31043, 758, 179437, 418, 41361, 20625, ...	[ 0.05426025390625, 0.25244140625, 0.08447265625, 0.07196044921875, 0.107666015625, 0.1865234375, 0.111083984375, 0.09503173828125, 0.08660888671875, 0.1982421875, 0.1826171875, 0.277099609375, 0.1082763671875, 0.19873046875, 0.004425048828125, 0.0706787109375, 0.0194244384765625, 0....	embed
16353066_c0	16353066	haskell	0	Title: How are functors in Haskell and OCaml similar? Problem title: How are functors in Haskell and OCaml similar? Tags: ocaml, haskell Problem: How are functors in Haskell and OCaml similar? I've been toying around in a Haskell for the past year or so and I'm actually starting to 'get' it, up until Monads, Lenses, Ty...	How are functors in Haskell and OCaml similar? How are functors in Haskell and OCaml similar? ocaml haskell How Haskell OCaml How are functors in Haskell and OCaml similar? I've been toying around in a Haskell for the past year or so and I'm actually starting to 'get' it, up until Monads, Lenses, Type Families, ... the...	[ 0.01275634765625, 0.00994873046875, 0.00885009765625, -0.004669189453125, 0.01556396484375, -0.00160980224609375, -0.01007080078125, -0.01239013671875, -0.005889892578125, -0.016357421875, -0.0091552734375, -0.00909423828125, -0.0142822265625, -0.01287841796875, -0.005218505859375, -0....	[ 11249, 621, 7477, 18770, 7, 20625, 142508, 136, 180, 105272, 141, 21373, 23, 36, 9779, 1556, 2809, 47, 38543, 10932, 11015, 6602, 20653, 72134, 3794, 24189, 60331, 6468, 339, 47754, 60457, 24641, 5915, 1672, 31358, 47506, 20288, 10176, 9856...	[ 0.1160888671875, 0.04119873046875, 0.2301025390625, 0.253173828125, 0.06439208984375, 0.13720703125, 0.247802734375, 0.0816650390625, 0.13232421875, 0.194091796875, 0.1629638671875, 0.17919921875, 0.061279296875, 0.0767822265625, 0.1392822265625, 0.11962890625, 0.00048828125, 0.056...	embed
40497229_c1	40497229	haskell	1	changes from "foo" to "bar" , then we need to change that string in the DOM. However, changing ms1_text should never cause the sibling or parent nodes to be redrawn. How should I structure my code? Is this even possible, given the getLatestState api as a building block? Am I entirely missing the point of Reflex by try...	changes from "foo" to "bar" , then we need to change that string in the DOM. However, changing ms1_text should never cause the sibling or parent nodes to be redrawn. How should I structure my code? Is this even possible, given the getLatestState api as a building block? Am I entirely missing the point of Reflex by try...	[ -0.005645751953125, -0.01446533203125, -0.007415771484375, -0.00131988525390625, 0.00616455078125, 0.020263671875, -0.00836181640625, -0.004852294921875, 0.012451171875, -0.0008697509765625, 0.000152587890625, 0.0054931640625, -0.00543212890625, 0.005828857421875, 0.012451171875, 0.001...	[ 65572, 1295, 3584, 31, 47, 1299, 15549, 79315, 69285, 151134, 68163, 418, 22829, 8306, 78, 79298, 49129, 110, 988, 456, 86905, 11249, 45646, 18151, 7722, 2046, 2729, 6954, 135206, 31470, 33976, 46389, 132283, 6275, 179043, 45367, 5773, 11001,...	[ 0.2198486328125, 0.056732177734375, 0.193359375, 0.212158203125, 0.072265625, 0.23388671875, 0.19970703125, 0.1673583984375, 0.169189453125, 0.1732177734375, 0.0833740234375, 0.09173583984375, 0.197509765625, 0.056732177734375, 0.066162109375, 0.1265869140625, 0.0880126953125, 0.13...	embed
1956518_c1	1956518	haskell	1	Seed seed val' = even seed' put (Random seed' val') return val' updateSeed seed = let (a,b,m) = (1664525, 1013904223, 2^32) in (a*seed + c) `mod` m And finally: getNRandSt n = replicateM n nextVal getNRand :: Int -> Seed -> [Bool] getNRand n seed = evalState (getNRandStates n) (Random seed True) Ok, this works fine and...	Seed seed val' = even seed' put (Random seed' val') return val' updateSeed seed = let (a,b,m) = (1664525, 1013904223, 2^32) in (a*seed + c) `mod` m And finally: getNRandSt n = replicateM n nextVal getNRand :: Int -> Seed -> [Bool] getNRand n seed = evalState (getNRandStates n) (Random seed True) Ok, this works fine and...	[ -0.0205078125, 0.0142822265625, 0.00787353515625, -0.005615234375, 0.0108642578125, 0.018798828125, 0.006317138671875, -0.029541015625, 0.00494384765625, -0.006195068359375, 0.00933837890625, 0.0263671875, -0.0167236328125, 0.0242919921875, 0.00909423828125, -0.00116729736328125, -0....	[ 503, 297, 40, 3502, 25, 3853, 3884, 126525, 3815, 30646, 28350, 4233, 2633, 39, 23175, 191802, 2588, 21027, 150197, 13023, 3742, 91887, 184, 997, 13415, 347, 2046, 2940, 37455, 653, 143126, 67, 594, 11737, 42272, 12647, 929, 28, 1405, 135...	[ 0.1611328125, 0.196533203125, 0.16259765625, 0.209228515625, 0.013641357421875, 0.1214599609375, 0.15087890625, 0.059051513671875, 0.11474609375, 0.124267578125, 0.1231689453125, 0.063232421875, 0.04669189453125, 0.082275390625, 0.058563232421875, 0.07421875, 0.1241455078125, 0.003...	embed
19573212_c0	19573212	haskell	0	Title: How can i separate tuples in Haskell? Problem title: How can i separate tuples in Haskell? Tags: list, haskell Problem: How can i separate tuples in Haskell? How can i merge a list of tuples without repeating any items in those tuples ? for example : from the list [("a","b"),("c,"d"),("a","b)], it should return ...	How can i separate tuples in Haskell? How can i separate tuples in Haskell? list haskell a How Haskell Possible P.hs:9:1 Probable XNoMonomorphismRestriction Note GHC.Real.Ratio Defined GHC.Real GHC.Classes How can i separate tuples in Haskell? How can i merge a list of tuples without repeating any items in those tuples...	[ -0.0034027099609375, 0.01300048828125, 0.0093994140625, 0.00347900390625, -0.0020751953125, -0.01007080078125, 0.0011444091796875, -0.0052490234375, 0.0089111328125, -0.00140380859375, -0.0145263671875, -0.00299072265625, 0.0277099609375, 0.00982666015625, -0.01043701171875, -0.0004158...	[ 11249, 831, 17, 84797, 370, 99726, 20625, 142508, 23, 5303, 1556, 10, 115861, 127, 1126, 19721, 1250, 275, 1193, 5021, 46674, 178851, 7655, 18622, 73265, 68996, 28645, 140803, 42564, 15490, 119140, 55769, 1295, 30646, 11, 238, 71, 18499, 26...	[ 0.034637451171875, 0.0352783203125, 0.03863525390625, 0.2325439453125, 0.1546630859375, 0.244384765625, 0.146728515625, 0.2353515625, 0.015167236328125, 0.1319580078125, 0.12646484375, 0.04315185546875, 0.0740966796875, 0.035675048828125, 0.0899658203125, 0.0714111328125, 0.071166992...	embed
62763711_c0	62763711	haskell	0	Title: possible solution that dealing with result end up with "(RealFrac a,Integral a)=>a" Problem title: possible solution that dealing with result end up with "(RealFrac a,Integral a)=>a" Tags: haskell Problem: possible solution that dealing with result end up with "(RealFrac a,Integral a)=>...	possible solution that dealing with result end up with "(RealFrac a,Integral a)=>a" possible solution that dealing with result end up with "(RealFrac a,Integral a)=>a" haskell a being RealFrac Integral Ambiguous Show Probable These Either Defined Data.Either Ordering GHC.Show Integer GHCi poss...	[ 0.000804901123046875, -0.008056640625, 0.003631591796875, -0.008544921875, 0.0224609375, -0.005126953125, -0.017822265625, 0.0019683837890625, -0.000865936279296875, -0.0087890625, 0.006439208984375, -0.0302734375, 0.021484375, 0.00872802734375, 0.01031494140625, -0.00469970703125, 0...	[ 7722, 29806, 184017, 678, 16750, 3564, 1257, 68996, 919, 20251, 10, 4, 67, 5739, 5386, 11, 450, 1369, 41502, 1556, 142508, 8035, 5120, 204681, 10250, 12282, 10821, 17367, 1250, 275, 2886, 32255, 9319, 5983, 11809, 14, 81206, 527, 73265, 1...	[ 0.1737060546875, 0.18505859375, 0.13232421875, 0.07354736328125, 0.244140625, 0.13818359375, 0.0848388671875, 0.21484375, 0.0885009765625, 0.2025146484375, 0.1304931640625, 0.0147552490234375, 0.11279296875, 0.105712890625, 0.1053466796875, 0.141845703125, 0.00360107421875, 0.00555...	embed
1418967_c0	1418967	haskell	0	Title: How to work with assertEqual with parameterized types Problem title: How to work with assertEqual with parameterized types Tags: haskell, hunit, testing Problem: How to work with assertEqual with parameterized types I'm trying to do the exercises in Real World Haskell in a TDD fashion, using HUnit . As you proba...	How to work with assertEqual with parameterized types How to work with assertEqual with parameterized types haskell hunit testing List Test.HUnit How List_Test.hs:6:27-58 List_Test TestCase Nil Cons Show How to work with assertEqual with parameterized types I'm trying to do the exercises in Real World Haskell in a TDD ...	[ -0.00885009765625, 0.005584716796875, -0.01708984375, 0.011962890625, -0.017822265625, -0.01080322265625, 0.00014209747314453125, -0.000835418701171875, -0.0120849609375, 0.02783203125, 0.0050048828125, -0.029541015625, 0.005767822265625, 0.0130615234375, -0.010009765625, -0.0220947265...	[ 11249, 4488, 678, 237, 33657, 647, 71723, 171859, 29367, 52895, 1556, 142508, 1926, 217, 134234, 32036, 8647, 27204, 6773, 111337, 127, 910, 27592, 10057, 441, 77175, 39215, 81979, 5120, 6661, 20625, 24057, 54543, 22438, 103608, 18499, 31380, ...	[ 0.01715087890625, 0.115234375, 0.088623046875, 0.07537841796875, 0.2386474609375, 0.035919189453125, 0.1966552734375, 0.20751953125, 0.0997314453125, 0.204345703125, 0.0938720703125, 0.1800537109375, 0.1265869140625, 0.129150390625, 0.13427734375, 0.166259765625, 0.1260986328125, 0...	embed
16898616_c0	16898616	haskell	0	Title: Haskell Linear-Time Online Algorithm Problem title: Haskell Linear-Time Online Algorithm Tags: haskell, algorithm, text-compression Problem: Haskell Linear-Time Online Algorithm Please forgive me if I misused the big words in the title; I'm not too knowledgeable about them but hope they describe my problem. I wr...	Haskell Linear-Time Online Algorithm Haskell Linear-Time Online Algorithm haskell algorithm text-compression Haskell Linear-Time Online Algorithm z:zs Haskell Linear-Time Online Algorithm Please forgive me if I misused the big words in the title; I'm not too knowledgeable about them but hope they describe my problem. I...	[ 0.01507568359375, -0.004425048828125, -0.00010395050048828125, 0.00640869140625, -0.0235595703125, -0.0081787109375, 0.0234375, -0.0128173828125, 0.0018768310546875, -0.00787353515625, 0.005889892578125, 0.0096435546875, 0.0169677734375, -0.0057373046875, -0.01544189453125, 0.020629882...	[ 20625, 142508, 16777, 147, 70059, 2823, 109847, 2783, 1556, 234873, 7986, 277, 48448, 97, 12, 169, 18337, 100, 96259, 1239, 33740, 6957, 34153, 44759, 51359, 15673, 98363, 2967, 54397, 121151, 150370, 9790, 136, 22, 40899, 79315, 59499, 6097,...	[ 0.14501953125, 0.2342529296875, 0.126708984375, 0.027801513671875, 0.1719970703125, 0.191650390625, 0.128173828125, 0.110595703125, 0.1456298828125, 0.1988525390625, 0.132568359375, 0.0892333984375, 0.1708984375, 0.0899658203125, 0.0269012451171875, 0.07269287109375, 0.03231811523437...	embed
7457090_c1	7457090	haskell	1	junction (TT_Boolean "f") (TT_Boolean "f") = TT_Boolean "f" This compiles and runs exactly like I expect it. The problem is, that I plan on implementing about 20 different TruthTypes, and many more functions for each one. So it makes more sense to group my functions based on which TruthType constructor they are acting ...	junction (TT_Boolean "f") (TT_Boolean "f") = TT_Boolean "f" This compiles and runs exactly like I expect it. The problem is, that I plan on implementing about 20 different TruthTypes, and many more functions for each one. So it makes more sense to group my functions based on which TruthType constructor they are acting ...	[ 0.001922607421875, -0.008056640625, -0.00634765625, 0.013671875, -0.0030670166015625, -0.00555419921875, 0.003814697265625, -0.00567626953125, 0.0150146484375, 0.01226806640625, -0.0111083984375, 0.01080322265625, 0.0128173828125, -0.0189208984375, -0.01300048828125, 0.015869140625, ...	[ 27022, 10763, 13739, 12647, 31, 34677, 420, 2203, 62497, 3293, 9969, 1340, 136, 127877, 66161, 1884, 87, 41206, 2967, 1774, 98, 29479, 1672, 387, 12921, 184431, 196707, 5941, 1286, 32354, 7, 10422, 21115, 759, 35509, 64549, 748, 1030, 54799...	[ 0.249267578125, 0.2120361328125, 0.1986083984375, 0.072021484375, 0.114013671875, 0.1915283203125, 0.15576171875, 0.0278167724609375, 0.224365234375, 0.052337646484375, 0.1514892578125, 0.1055908203125, 0.0670166015625, 0.1148681640625, 0.0970458984375, 0.0999755859375, 0.00964355468...	embed
42189666_c1	42189666	haskell	1	kind ‘[Symbol]’ with ‘*’ When matching the kind of ‘proxy’ • In the second argument of ‘formURL’, namely ‘p’ In the expression: formURL c p In an equation for ‘url’: url = formURL c p • Relevant bindings include p :: proxy s (bound at app/Main.hs:36:18) redirectPrompt :: OAuthClient -> proxy s -> IO (OAuthCode s) (bou...	kind ‘[Symbol]’ with ‘*’ When matching the kind of ‘proxy’ • In the second argument of ‘formURL’, namely ‘p’ In the expression: formURL c p In an equation for ‘url’: url = formURL c p • Relevant bindings include p :: proxy s (bound at app/Main.hs:36:18) redirectPrompt :: OAuthClient -> proxy s -> IO (OAuthCode s) (bou...	[ 0.00159454345703125, 0.0228271484375, -0.00537109375, -0.01031494140625, -0.01531982421875, -0.0106201171875, 0.0024871826171875, 0.0260009765625, -0.0089111328125, -0.00811767578125, 0.021240234375, -0.05322265625, 0.00885009765625, -0.0101318359375, 0.003265380859375, -0.000564575195...	[ 8562, 65183, 36846, 678, 1639, 14858, 214, 64101, 53, 17932, 10750, 5037, 95538, 254, 125195, 3173, 501, 915, 5490, 25002, 133, 128239, 502, 50878, 91, 99091, 4027, 168793, 32944, 24033, 456, 80581, 2676, 180, 67362, 927, 150, 17780, 34, ...	[ 0.257568359375, 0.1593017578125, 0.2454833984375, 0.0906982421875, 0.17626953125, 0.2030029296875, 0.06085205078125, 0.2181396484375, 0.16015625, 0.1314697265625, 0.2392578125, 0.19287109375, 0.2470703125, 0.133544921875, 0.1817626953125, 0.2216796875, 0.0243682861328125, 0.1568603...	embed
42440396_c0	42440396	haskell	0	Title: How to prevent allocations in unrollable code? Problem title: How to prevent allocations in unrollable code? Tags: haskell Problem: How to prevent allocations in unrollable code? Given the following pieces of (boiled down and pseudo Haskell-ish) code: import qualified Data.Vector.Unboxed as V minimum3 :: Double ...	How to prevent allocations in unrollable code? How to prevent allocations in unrollable code? haskell qualified How Data.Vector.Unboxed minimum3 Double readMinimum3 V.Vector V.unsafeRead median15 How to prevent allocations in unrollable code? Given the following pieces of (boiled down and pseudo Haskell-ish) code: mini...	[ 0.000911712646484375, 0.01068115234375, 0.0166015625, -0.0118408203125, -0.005401611328125, -0.0045166015625, 0.0040283203125, -0.02978515625, 0.0016021728515625, -0.02783203125, -0.020751953125, -0.00775146484375, 0.0213623046875, -0.0008697509765625, 0.00738525390625, 0.0015716552734...	[ 11249, 56282, 144, 87632, 51, 27722, 2886, 18151, 47, 7, 23, 1556, 142508, 217225, 11809, 26455, 18770, 14256, 11728, 15440, 363, 107172, 12301, 114986, 24105, 310, 309, 115840, 31345, 2450, 1837, 126371, 7565, 74189, 20625, 9157, 73, 167785,...	[ 0.0635986328125, 0.25927734375, 0.1612548828125, 0.240234375, 0.1104736328125, 0.190673828125, 0.175048828125, 0.195556640625, 0.031524658203125, 0.05267333984375, 0.040618896484375, 0.10595703125, 0.2174072265625, 0.1304931640625, 0.08935546875, 0.1099853515625, 0.099853515625, 0....	embed
58974359_c1	58974359	haskell	1	anywhere.) (I parse the input into a bunch of two-element vectors that indicate the step to take for each instruction. That code works fine, and quickly.) import qualified Data.Set as S import Linear (V2(..)) import Control.Monad.State.Strict import Control.Monad.Extra (concatMapM) type Coord = V2 Integer -- x, y, wit...	anywhere.) (I parse the input into a bunch of two-element vectors that indicate the step to take for each instruction. That code works fine, and quickly.) import qualified Data.Set as S import Linear (V2(..)) import Control.Monad.State.Strict import Control.Monad.Extra (concatMapM) type Coord = V2 Integer -- x, y, wit...	[ -0.014404296875, 0.0087890625, 0.004302978515625, 0.00347900390625, -0.00970458984375, 0.0155029296875, -0.0037078857421875, -0.00933837890625, -0.0025482177734375, -0.04443359375, 0.0120849609375, 0.048095703125, 0.002349853515625, 0.014404296875, -0.018310546875, 0.001434326171875, ...	[ 151107, 5, 16, 568, 366, 184, 107730, 3934, 147306, 6626, 62766, 22834, 22230, 117414, 29954, 5646, 12638, 6, 188336, 18151, 43240, 5885, 69405, 24927, 217225, 11809, 294, 126, 237, 159, 16777, 147, 856, 304, 27131, 46674, 712, 135206, 6223...	[ 0.26904296875, 0.059234619140625, 0.05035400390625, 0.026336669921875, 0.1494140625, 0.0716552734375, 0.19482421875, 0.072265625, 0.043548583984375, 0.046051025390625, 0.141357421875, 0.1641845703125, 0.0997314453125, 0.0758056640625, 0.1531982421875, 0.048126220703125, 0.0888671875,...	embed
3524485_c1	3524485	haskell	1	<- eval env p case v1 of ValInt x -> if x /= 0 then eval env t else eval env f _ -> throwError "First arg of If must be an int" eval env (Let x e1 e2) = do v1 <- eval env e1 eval ((x, v1):env) e2 eval env (LetRec bs e) = do env' <- evalBinds eval env' e where evalBinds = mfix $ \env' -> do env'' <- mapM (\(x, e') -> e...	<- eval env p case v1 of ValInt x -> if x /= 0 then eval env t else eval env f _ -> throwError "First arg of If must be an int" eval env (Let x e1 e2) = do v1 <- eval env e1 eval ((x, v1):env) e2 eval env (LetRec bs e) = do env' <- evalBinds eval env' e where evalBinds = mfix $ \env' -> do env'' <- mapM (\(x, e') -> e...	[ -0.020263671875, 0.002166748046875, 0.01055908203125, -0.00775146484375, 0.0242919921875, 0.015380859375, -0.00604248046875, -0.01611328125, 0.01239013671875, -0.014404296875, -0.01007080078125, 0.017578125, 0.01177978515625, 0.00543212890625, 0.0390625, -0.0048828125, -0.01635742187...	[ 28, 1405, 22, 334, 915, 7225, 81, 418, 4769, 4153, 18, 1022, 2174, 248, 1369, 757, 808, 1238, 104250, 18468, 31611, 207263, 79459, 111, 4263, 8110, 186, 23, 124480, 10461, 54, 17727, 33, 4332, 238, 7250, 7, 55923, 22288, 594, 30646, 3...	[ 0.0830078125, 0.25634765625, 0.1419677734375, 0.2384033203125, 0.0943603515625, 0.08197021484375, 0.142822265625, 0.033782958984375, 0.1473388671875, 0.090087890625, 0.09185791015625, 0.052459716796875, 0.10205078125, 0.0224761962890625, 0.015655517578125, 0.13818359375, 0.0414733886...	embed
42562695_c0	42562695	haskell	0	Title: Why is this pattern irrefulable? Problem title: Why is this pattern irrefulable? Tags: pattern-matching, haskell, functional-programming Problem: Why is this pattern irrefulable? I'm new to Haskell and trying to create a function that evaluates an arithmetic expression: data Expr = Number Rational \| Variable Str...	Why is this pattern irrefulable? Why is this pattern irrefulable? pattern-matching haskell functional-programming Why Expr Number Rational Variable Plus Show Read main.hs:5:9-27 Irrefutable Main.Number Why is this pattern irrefulable? I'm new to Haskell and trying to create a function that evaluates an arithmetic expre...	[ -0.0196533203125, 0.0034637451171875, 0.0203857421875, 0.0194091796875, 0.01275634765625, 0.0284423828125, -0.0269775390625, -0.01025390625, 0.0118408203125, -0.00927734375, 0.013427734375, -0.01007080078125, 0.01416015625, 0.006805419921875, 0.01300048828125, -0.00104522705078125, 0...	[ 44084, 83, 903, 103510, 66617, 7844, 2886, 98753, 1556, 142508, 123309, 28966, 60075, 42, 103332, 2552, 43315, 84572, 8183, 17367, 4764, 5201, 127, 1126, 50994, 6921, 107, 3125, 22819, 12321, 18444, 26278, 3525, 20625, 28282, 32354, 151575, 8...	[ 0.1353759765625, 0.06475830078125, 0.10357666015625, 0.2333984375, 0.15380859375, 0.211669921875, 0.1737060546875, 0.1494140625, 0.090087890625, 0.214111328125, 0.0875244140625, 0.0452880859375, 0.0960693359375, 0.08843994140625, 0.142578125, 0.114501953125, 0.1016845703125, 0.1484...	embed
37243638_c0	37243638	haskell	0	Title: Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable Problem title: Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable Tags: vector, haskell Problem: Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable I want to create a list containing a random permutatio...	Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable vector haskell qualified System.Random Creating Data.Vector.Unboxed.Mutable VUM.swap Data.Vector.Unboxed VUM VU.Vector VU.unsafeThaw VU.enumFromN VU.forM_ VU.fromList VUM.length ...	[ -0.007171630859375, 0.013427734375, 0.00335693359375, -0.0283203125, 0.00439453125, 0.01129150390625, -0.0201416015625, -0.033203125, -0.00982666015625, -0.04248046875, 0.01446533203125, 0.01141357421875, 0.012939453125, 0.018798828125, -0.007537841796875, 0.0093994140625, -0.0139770...	[ 56781, 1916, 96759, 117, 561, 22062, 615, 5, 839, 678, 11809, 26455, 18770, 14256, 11728, 10685, 22819, 173, 1556, 142508, 217225, 12353, 126525, 3815, 310, 11893, 634, 254, 120403, 309, 115840, 78122, 316, 168407, 2472, 161063, 154663, 23986...	[ 0.1407470703125, 0.0216217041015625, 0.1695556640625, 0.0966796875, 0.183837890625, 0.0784912109375, 0.1124267578125, 0.045257568359375, 0.1466064453125, 0.09033203125, 0.1236572265625, 0.211669921875, 0.193359375, 0.07745361328125, 0.1712646484375, 0.09613037109375, 0.1478271484375,...	embed
50214331_c0	50214331	haskell	0	Title: Yesod Network.Socket.bind permission denied (permission denied) Problem title: Yesod Network.Socket.bind permission denied (permission denied) Tags: yesod, haskell-stack, haskell Problem: Yesod Network.Socket.bind permission denied (permission denied) When trying to execute my project from stack I get this error...	Yesod Network.Socket.bind permission denied (permission denied) Yesod Network.Socket.bind permission denied (permission denied) yesod haskell-stack haskell InternalError Yesod Network.Socket.bind Permission May Error Network.Socket.connect Connection core-1.4.37.3-9gXfYzTigbs72LNNfHDGk9:Yesod.Core.Internal.Run Core Int...	[ -0.024658203125, 0.04296875, -0.00013065338134765625, -0.002044677734375, -0.006103515625, 0.00933837890625, -0.00994873046875, -0.003997802734375, -0.01171875, -0.033935546875, 0.009765625, -0.0166015625, 0.000759124755859375, 0.023193359375, -0.00933837890625, -0.00872802734375, -0...	[ 32635, 2199, 28997, 8912, 27853, 89817, 168081, 8, 93, 1264, 21150, 2422, 23722, 1556, 142508, 590, 2594, 106745, 18468, 908, 4347, 212059, 135457, 62448, 56458, 158406, 145515, 12825, 1126, 91480, 50886, 44851, 163321, 31365, 28398, 127, 10558...	[ 0.169921875, 0.243896484375, 0.14306640625, 0.0994873046875, 0.1402587890625, 0.224853515625, 0.2105712890625, 0.10028076171875, 0.1229248046875, 0.10357666015625, 0.1431884765625, 0.13720703125, 0.215087890625, 0.06927490234375, 0.166015625, 0.122314453125, 0.0970458984375, 0.1091...	embed
26756056_c0	26756056	haskell	0	Title: ghci cabal sandbox flags for Emacs Haskell inferior mode Problem title: ghci cabal sandbox flags for Emacs Haskell inferior mode Tags: ghci, emacs, haskell Problem: ghci cabal sandbox flags for Emacs Haskell inferior mode I would like GHCI to have the local cabal sandbox in scope when I work in emacs. From bash,...	ghci cabal sandbox flags for Emacs Haskell inferior mode ghci cabal sandbox flags for Emacs Haskell inferior mode ghci emacs haskell arguments Emacs Haskell packages.conf.d Custom e.g C-h ghci cabal sandbox flags for Emacs Haskell inferior mode I would like GHCI to have the local cabal sandbox in scope when I work in e...	[ 0.0018768310546875, -0.0225830078125, 0.00762939453125, 0.00653076171875, -0.0264892578125, 0.02294921875, 0.000020623207092285156, 0.02783203125, 0.004302978515625, 0.0025482177734375, 0.00830078125, -0.02197265625, -0.0213623046875, -0.0115966796875, 0.000637054443359375, 0.005584716...	[ 31380, 318, 109524, 19096, 11728, 49938, 85269, 4439, 20625, 142508, 44157, 13736, 352, 2263, 1556, 10750, 98169, 70547, 130664, 313, 9, 127, 1884, 41877, 17304, 765, 4000, 70820, 4488, 87109, 6002, 86531, 157, 65918, 29102, 48073, 408, 3571,...	[ 0.1322021484375, 0.1702880859375, 0.2626953125, 0.1568603515625, 0.18359375, 0.2415771484375, 0.1370849609375, 0.125, 0.121337890625, 0.2066650390625, 0.2476806640625, 0.135009765625, 0.06256103515625, 0.1263427734375, 0.103271484375, 0.1453857421875, 0.174072265625, 0.129760742187...	embed
19016756_c0	19016756	haskell	0	Title: Attoparsec `many` method not found Problem title: Attoparsec `many` method not found Tags: attoparsec, haskell Problem: Attoparsec `many` method not found I tried running the tests for Bryan O'Sullivan's Attoparsec-based HTTP parser ( http://www.serpentine.com/blog/2010/03/03/whats-in-a-parser-attoparsec-rewired...	Attoparsec `many` method not found Attoparsec `many` method not found attoparsec haskell Prelude Data.ByteString.Char8 Data.Attoparsec Attoparsec TestRFC2616.hs TestRFC2616.hs:13:30 Not Perhaps B.any GHCi www.haskell.org Loading many1 Attoparsec `many` method not found I tried running the tests for Bryan O'Sullivan's A...	[ -0.00193023681640625, 0.01806640625, -0.006195068359375, 0.017333984375, 0.00140380859375, 0.02392578125, 0.00494384765625, -0.02099609375, 0.0216064453125, -0.0380859375, -0.01446533203125, -0.043212890625, 0.00110626220703125, -0.0107421875, 0.0031280517578125, -0.019287109375, -0....	[ 9208, 31, 2500, 39797, 669, 53, 55300, 959, 14037, 243, 1556, 142508, 1914, 822, 11809, 75358, 67, 71713, 84068, 1019, 284, 10628, 8647, 54612, 4046, 2485, 127, 1197, 11205, 181799, 335, 4848, 527, 73265, 14, 10557, 1478, 228006, 5941, 41...	[ 0.198486328125, 0.16357421875, 0.1612548828125, 0.2215576171875, 0.2008056640625, 0.21337890625, 0.222412109375, 0.1143798828125, 0.1727294921875, 0.15966796875, 0.11767578125, 0.22998046875, 0.044921875, 0.1392822265625, 0.0858154296875, 0.031768798828125, 0.00189208984375, 0.0303...	embed
74739974_c1	74739974	haskell	1	+ -1 on 2-adics. Now, I'm interested in the hyper-operation sequence function, i.e.: hyp :: Int -> Adic -> Adic -> Adic hyp 0 a b = add a b hyp 1 a b = mul a b hyp 2 a b = exp a b hyp 3 a b = tet a b ... An efficient way to implement it is by generalizing the exponentiation by squaring algorithm, as follows: hyp :: In...	+ -1 on 2-adics. Now, I'm interested in the hyper-operation sequence function, i.e.: hyp :: Int -> Adic -> Adic -> Adic hyp 0 a b = add a b hyp 1 a b = mul a b hyp 2 a b = exp a b hyp 3 a b = tet a b ... An efficient way to implement it is by generalizing the exponentiation by squaring algorithm, as follows: hyp :: In...	[ -0.0390625, 0.025634765625, 0.009521484375, 0.005157470703125, 0.003753662109375, -0.01531982421875, 0.00138092041015625, 0.002410888671875, 0.004302978515625, -0.01092529296875, -0.000278472900390625, 0.0093994140625, -0.010009765625, -0.00421142578125, -0.00897216796875, -0.029296875...	[ 997, 68940, 4720, 712, 28021, 60892, 59058, 21473, 1363, 40, 944, 3956, 32354, 2119, 254, 1984, 360, 18, 33079, 62, 18403, 757, 10, 876, 15190, 106, 16690, 14700, 138, 120, 93766, 3917, 29479, 4537, 78643, 21616, 94727, 214, 234873, 91, ...	[ 0.1834716796875, 0.2052001953125, 0.13720703125, 0.1214599609375, 0.1697998046875, 0.0721435546875, 0.18212890625, 0.1968994140625, 0.0286407470703125, 0.07293701171875, 0.1192626953125, 0.06097412109375, 0.15869140625, 0.201171875, 0.1971435546875, 0.04681396484375, 0.086669921875, ...	embed
33445898_c1	33445898	haskell	1	gives cannot satisfy -package-id attoparse... error. Resolving dependencies... Configuring aeson-0.10.0.0... Building aeson-0.10.0.0... Failed to install aeson-0.10.0.0 Build log ( /Users/smcho/.cabal/logs/aeson-0.10.0.0.log ): Configuring aeson-0.10.0.0... Building aeson-0.10.0.0... Preprocessing library aeson-0.10.0...	gives cannot satisfy -package-id attoparse... error. Resolving dependencies... Configuring aeson-0.10.0.0... Building aeson-0.10.0.0... Failed to install aeson-0.10.0.0 Build log ( /Users/smcho/.cabal/logs/aeson-0.10.0.0.log ): Configuring aeson-0.10.0.0... Building aeson-0.10.0.0... Preprocessing library aeson-0.10.0...	[ -0.0257568359375, -0.000789642333984375, 0.00093841552734375, 0.00213623046875, 0.0033721923828125, -0.00994873046875, -0.005218505859375, -0.00994873046875, -0.0012359619140625, 0.0272216796875, -0.004119873046875, -0.0103759765625, 0.009521484375, 0.019287109375, 0.00787353515625, -0...	[ 76199, 53418, 40407, 53, 20, 29102, 4588, 532, 243, 2146, 28004, 27, 18499, 132944, 42548, 117538, 59994, 10, 90, 191, 23320, 10179, 99929, 104919, 190355, 20600, 121137, 12684, 39, 3089, 408, 3571, 4867, 11, 1657, 1914, 63923, 35773, 1294,...	[ 0.1435546875, 0.1927490234375, 0.241943359375, 0.116455078125, 0.052093505859375, 0.1900634765625, 0.07843017578125, 0.13232421875, 0.17529296875, 0.1346435546875, 0.1754150390625, 0.02825927734375, 0.16943359375, 0.158203125, 0.1800537109375, 0.0771484375, 0.137451171875, 0.086914...	embed
7232375_c0	7232375	haskell	0	Title: couldn't match expected type (Int -> Int -> Int) with actual type `(t0, t1, t2)' Problem title: couldn't match expected type (Int -> Int -> Int) with actual type `(t0, t1, t2)' Tags: haskell, tuples, types Problem: couldn't match expected type (Int -> Int -> Int) with actual type ...	couldn't match expected type (Int -> Int -> Int) with actual type `(t0, t1, t2)' couldn't match expected type (Int -> Int -> Int) with actual type `(t0, t1, t2)' haskell tuples types Prelude orderList.hs:23:13 Couldn couldn't match expected type (Int -> Int -> Int) with actual type `(t0,...	[ 0.00634765625, 0.004669189453125, 0.0130615234375, -0.005523681640625, 0.005218505859375, 0.01324462890625, -0.0224609375, -0.00811767578125, 0.01116943359375, -0.00927734375, -0.001068115234375, -0.004547119140625, 0.0096435546875, -0.016845703125, -0.00093841552734375, -0.00093841552...	[ 69427, 3768, 18, 14858, 84751, 10644, 4153, 5386, 360, 678, 8561, 2389, 808, 418, 10461, 1556, 142508, 370, 99726, 52895, 1914, 822, 112, 12989, 154663, 127, 24864, 22618, 191147, 9842, 1679, 57143, 20625, 22, 33558, 19844, 41664, 179933, 1...	[ 0.1605224609375, 0.07403564453125, 0.1566162109375, 0.197265625, 0.1728515625, 0.1766357421875, 0.0799560546875, 0.088623046875, 0.1107177734375, 0.0765380859375, 0.1466064453125, 0.1378173828125, 0.051788330078125, 0.06414794921875, 0.1806640625, 0.1390380859375, 0.2509765625, 0.0...	embed
65903835_c0	65903835	haskell	0	Title: How to iterate through a list, element by element Problem title: How to iterate through a list, element by element Tags: haskell, pattern-matching, loops, list Problem: How to iterate through a list, element by element I have just started learning Haskell and I am trying to write some basic functions in order to...	How to iterate through a list, element by element How to iterate through a list, element by element haskell pattern-matching loops list How x:_ _:x How to iterate through a list, element by element I have just started learning Haskell and I am trying to write some basic functions in order to get a better understanding ...	[ -0.0126953125, -0.006683349609375, 0.01171875, 0.001007080078125, -0.00081634521484375, 0.0018463134765625, 0.01251220703125, 0.0022125244140625, 0.0166015625, -0.04638671875, 0.0322265625, -0.029296875, -0.000644683837890625, -0.0018463134765625, -0.00732421875, -0.01507568359375, 0...	[ 11249, 47, 17, 8560, 67, 8305, 10, 5303, 4, 12830, 390, 1556, 142508, 103510, 98753, 214, 40956, 1022, 12, 454, 101, 425, 52080, 20625, 33022, 62822, 32354, 11522, 100094, 46876, 3444, 51776, 136, 360, 18, 541, 10750, 30646, 99, 63262, ...	[ 0.10137939453125, 0.0498046875, 0.0831298828125, 0.2413330078125, 0.108154296875, 0.185791015625, 0.03167724609375, 0.2154541015625, 0.001129150390625, 0.2110595703125, 0.1439208984375, 0.14697265625, 0.215576171875, 0.1781005859375, 0.1881103515625, 0.039154052734375, 0.155639648437...	embed
22018670_c0	22018670	haskell	0	Title: After reading a file I have IO [Char], but I need [IO Char] Problem title: After reading a file I have IO [Char], but I need [IO Char] Tags: monads, haskell Problem: After reading a file I have IO [Char], but I need [IO Char] I have a file number.txt which contains a large number and I read it into an IO String ...	After reading a file I have IO [Char], but I need [IO Char] After reading a file I have IO [Char], but I need [IO Char] monads haskell Control.Monad Data.Char After Char number.txt Couldn Main After reading a file I have IO [Char], but I need [IO Char] I have a file number.txt which contains a large number and I read i...	[ -0.00836181640625, -0.01531982421875, 0.00506591796875, 0.007598876953125, 0.0037689208984375, 0.0216064453125, 0.009765625, -0.00732421875, 0.00341796875, -0.025634765625, 0.005218505859375, -0.039794921875, -0.01409912109375, 0.0260009765625, 0.01068115234375, -0.01336669921875, -0...	[ 24372, 16454, 11435, 87, 765, 17780, 84068, 1284, 3871, 378, 21656, 2667, 712, 7, 1556, 142508, 27131, 46674, 11809, 14012, 124326, 191147, 12321, 5, 70541, 21334, 12301, 3934, 23351, 214, 1884, 903, 15700, 32354, 3444, 28282, 5303, 111, 36...	[ 0.144775390625, 0.1964111328125, 0.1800537109375, 0.0260772705078125, 0.07476806640625, 0.24658203125, 0.227783203125, 0.088623046875, 0.171630859375, 0.002227783203125, 0.23583984375, 0.10284423828125, 0.145751953125, 0.0240936279296875, 0.1427001953125, 0.2396240234375, 0.204833984...	embed
74670390_c0	74670390	haskell	0	Title: Move and resize XMonad window - RationalRect call compiler error Problem title: Move and resize XMonad window - RationalRect call compiler error Tags: haskell, compiler-errors, xmonad Problem: Move and resize XMonad window - RationalRect call compiler error to send the focused window to the center of the screen ...	Move and resize XMonad window - RationalRect call compiler error Move and resize XMonad window - RationalRect call compiler error haskell compiler-errors xmonad Move XMonad RationalRect xK_space xK_0 xmonad.hs:87:58 Data Ratio Move and resize XMonad window - RationalRect call compiler error to send the focused window t...	[ -0.002197265625, 0.006683349609375, 0.004119873046875, -0.0016021728515625, 0.01446533203125, 0.028564453125, -0.007781982421875, -0.017333984375, -0.004791259765625, -0.0157470703125, 0.01080322265625, -0.01483154296875, 0.0162353515625, -0.00872802734375, 0.006011962890625, -0.003051...	[ 135828, 136, 456, 62539, 1193, 46674, 712, 76896, 2552, 43315, 1052, 24762, 11782, 9969, 34759, 18499, 1556, 142508, 188800, 1022, 3796, 605, 65421, 2389, 127, 19308, 33593, 11809, 5565, 25379, 162393, 27585, 49119, 180346, 87388, 47, 22799, ...	[ 0.1505126953125, 0.046966552734375, 0.0775146484375, 0.17529296875, 0.09149169921875, 0.143798828125, 0.143310546875, 0.17822265625, 0.126708984375, 0.1275634765625, 0.1424560546875, 0.172607421875, 0.14306640625, 0.13037109375, 0.113525390625, 0.1463623046875, 0.046630859375, 0.16...	embed
65584927_c0	65584927	haskell	0	Title: Haskell: Find two related elements in a list Problem title: Haskell: Find two related elements in a list Tags: haskell, list Problem: Haskell: Find two related elements in a list I am new to Haskell/FP. I want to solve this task: This list is given: [1721, 979, 366, 299, 675, 1456] Find the two elements that sum...	Haskell: Find two related elements in a list Haskell: Find two related elements in a list haskell list Haskell Find Haskell: Find two related elements in a list I am new to Haskell/FP. I want to solve this task: This list is given: [1721, 979, 366, 299, 675, 1456] Find the two elements that sum to 2020 and multiply the...	[ -0.019775390625, -0.006500244140625, -0.0069580078125, 0.023193359375, -0.00113677978515625, 0.03173828125, -0.0174560546875, 0.01300048828125, 0.0177001953125, -0.0235595703125, 0.0107421875, -0.01275634765625, 0.0035400390625, 0.0048828125, -0.026611328125, -0.000492095947265625, 0...	[ 20625, 142508, 26040, 6626, 62548, 80854, 23, 5303, 12, 10, 1556, 3525, 51006, 3444, 86869, 66211, 34475, 2489, 3117, 199439, 110144, 122418, 158045, 616, 13683, 450, 10554, 47, 11075, 136, 6024, 62479, 2856, 29806, 729, 661, 5351, 72977, 4...	[ 0.17822265625, 0.284423828125, 0.173828125, 0.234375, 0.282958984375, 0.2490234375, 0.09368896484375, 0.226318359375, 0.005889892578125, 0.015899658203125, 0.1517333984375, 0.032958984375, 0.1407470703125, 0.003753662109375, 0.1201171875, 0.1109619140625, 0.043121337890625, 0.14086...	embed
21265454_c0	21265454	haskell	0	Title: subsequences of length n from list performance Problem title: subsequences of length n from list performance Tags: performance, haskell Problem: subsequences of length n from list performance I implemented a version of this answer https://stackoverflow.com/a/9920425/1261166 (I don't know what was intended by the...	subsequences of length n from list performance subsequences of length n from list performance performance haskell list n-1 COST CENTRE MODULE Main sublistofsize.sublistsThatDontStartWithX sublistofsize.sublistsThatStartWithX subsequences of length n from list performance I implemented a version of this answer https://s...	[ -0.0020751953125, 0.01544189453125, 0.0198974609375, -0.001495361328125, -0.00799560546875, -0.01348876953125, -0.0026702880859375, 0.0027313232421875, 0.01434326171875, -0.0223388671875, 0.018798828125, 0.003448486328125, 0.0218505859375, 0.00982666015625, -0.01806640625, 0.0067138671...	[ 1614, 184, 26513, 140909, 653, 1295, 5303, 23718, 1556, 142508, 5759, 313, 34274, 89859, 98610, 12321, 150, 36834, 62539, 22144, 6562, 115743, 60728, 18, 126597, 194583, 1542, 29479, 11389, 51646, 7, 2203, 22288, 12, 19, 110218, 1022, 425, ...	[ 0.2152099609375, 0.135498046875, 0.165283203125, 0.1522216796875, 0.1207275390625, 0.121337890625, 0.181884765625, 0.205810546875, 0.09765625, 0.196533203125, 0.07421875, 0.04534912109375, 0.1260986328125, 0.0693359375, 0.0517578125, 0.00238037109375, 0.10693359375, 0.056640625, ...	embed
71370866_c2	71370866	haskell	2	Configuring library for text-short-0.1.5.. Preprocessing library for text-short-0.1.5.. Building library for text-short-0.1.5.. [1 of 5] Compiling PrimOps ( src-ghc804/PrimOps.hs, dist/build/PrimOps.o, dist/build/PrimOps.dyn_o ) [2 of 5] Compiling Data.Text.Short.Internal ( src/Data/Text/Short/Internal.hs, dist/build/...	Configuring library for text-short-0.1.5.. Preprocessing library for text-short-0.1.5.. Building library for text-short-0.1.5.. [1 of 5] Compiling PrimOps ( src-ghc804/PrimOps.hs, dist/build/PrimOps.o, dist/build/PrimOps.dyn_o ) [2 of 5] Compiling Data.Text.Short.Internal ( src/Data/Text/Short/Internal.hs, dist/build/...	[ -0.00016498565673828125, 0.00555419921875, 0.00653076171875, -0.000015497207641601562, 0.00168609619140625, -0.03515625, -0.0045166015625, 0.0213623046875, -0.00011920928955078125, 0.044921875, -0.0074462890625, -0.01806640625, 0.0016326904296875, 0.00185394287109375, 0.01397705078125, ...	[ 1657, 59994, 214, 35773, 1294, 100, 7986, 9, 186500, 102014, 45955, 5, 1914, 63923, 104919, 111, 190, 15612, 49725, 44506, 39029, 7, 19437, 9486, 4836, 77212, 145111, 127, 45, 271, 177149, 31, 17872, 11809, 174379, 115729, 44851, 137989, 28...	[ 0.06903076171875, 0.2161865234375, 0.0457763671875, 0.2359619140625, 0.154541015625, 0.0302734375, 0.2364501953125, 0.049560546875, 0.29345703125, 0.150146484375, 0.1942138671875, 0.027252197265625, 0.140869140625, 0.1595458984375, 0.159912109375, 0.00921630859375, 0.04498291015625, ...	embed
32121241_c1	32121241	haskell	1	= [[x,y,z] \| x<-[0.. isqrt n], y<- [0.. isqrt (n - x^2)], z<-[max 0 (isqrt ((n-x^2 -y^2) `div` 3))], x^2 +y^2 + z^2 ==n] latticePoints :: Int -> [[Int]] latticePoints n = [ zipWith (*) [x1,x2,x3] y \| [x1,x2,x3] <- (latticePointsWithoutNegatives n), y <- [[a,b,c] \| a <- (if x1 == 0 then [0] else [-1,1]), b<-(if x2 == 0...	= [[x,y,z] \| x<-[0.. isqrt n], y<- [0.. isqrt (n - x^2)], z<-[max 0 (isqrt ((n-x^2 -y^2) `div` 3))], x^2 +y^2 + z^2 ==n] latticePoints :: Int -> [[Int]] latticePoints n = [ zipWith (*) [x1,x2,x3] y \| [x1,x2,x3] <- (latticePointsWithoutNegatives n), y <- [[a,b,c] \| a <- (if x1 == 0 then [0] else [-1,1]), b<-(if x2 == 0...	[ -0.023681640625, -0.00567626953125, -0.01068115234375, 0.0027923583984375, -0.007537841796875, -0.00982666015625, 0.006683349609375, -0.0091552734375, 0.01409912109375, -0.0296630859375, 0.01446533203125, -0.0301513671875, 0.0150146484375, -0.0145263671875, -0.027099609375, 0.009155273...	[ 2203, 425, 53, 169, 58745, 1022, 16093, 2389, 83, 864, 3198, 653, 113, 9, 10461, 97, 24084, 757, 304, 30618, 8439, 997, 69112, 10495, 24494, 147534, 1984, 360, 18, 68330, 194583, 2335, 6056, 6433, 208, 42991, 3190, 876, 501, 363, 53234,...	[ 0.10394287109375, 0.01373291015625, 0.032745361328125, 0.10687255859375, 0.0076904296875, 0.046630859375, 0.043243408203125, 0.05242919921875, 0.005828857421875, 0.04412841796875, 0.135009765625, 0.01556396484375, 0.058807373046875, 0.00543212890625, 0.066162109375, 0.08154296875, 0....	embed
15588173_c0	15588173	haskell	0	Title: Could someone de-sugar this monad transform snippet? Problem title: Could someone de-sugar this monad transform snippet? Tags: monad-transformers, haskell Problem: Could someone de-sugar this monad transform snippet? Written in this handy do-notation, this seems pretty clear to me. But I can't seem to get the de...	Could someone de-sugar this monad transform snippet? Could someone de-sugar this monad transform snippet? monad-transformers haskell Could stack1 StateT Identity runstack1 stack3 runStack3 Could someone de-sugar this monad transform snippet? Written in this handy do-notation, this seems pretty clear to me. But I can't ...	[ -0.0130615234375, 0.01904296875, 0.0047607421875, 0.004180908203125, 0.0179443359375, 0.00579833984375, -0.001556396484375, -0.0166015625, 0.004791259765625, -0.00750732421875, 0.02392578125, 0.01336669921875, -0.01226806640625, 0.01007080078125, 0.004669189453125, 0.00075531005859375,...	[ 191147, 22008, 8, 1159, 1970, 903, 2667, 712, 27198, 93, 58134, 9, 215175, 1314, 1556, 142508, 177261, 418, 22836, 618, 71257, 2481, 11675, 590, 2594, 363, 42378, 91, 128538, 3535, 54, 157, 22062, 37202, 34735, 831, 48903, 7, 16565, 2822,...	[ 0.1314697265625, 0.0703125, 0.237060546875, 0.1732177734375, 0.2147216796875, 0.114501953125, 0.14013671875, 0.1910400390625, 0.2493896484375, 0.1248779296875, 0.1236572265625, 0.023162841796875, 0.2061767578125, 0.046142578125, 0.10302734375, 0.1998291015625, 0.1820068359375, 0.10...	embed
18060029_c0	18060029	haskell	0	Title: Suppress certain Haskell Alex/Happy compilation messages Problem title: Suppress certain Haskell Alex/Happy compilation messages Tags: parser-generator, haskell, happy, alex Problem: Suppress certain Haskell Alex/Happy compilation messages When creating either a Lexer.x or a Parser.y parser using the Alex lexer ...	Suppress certain Haskell Alex/Happy compilation messages Suppress certain Haskell Alex/Happy compilation messages parser-generator haskell happy alex Suppress Haskell Alex Happy Lexer.x Parser.y Lexer line-map.c Compiling Lexer.hs Lexer.o Parser Parser.hs Parser.o LINE Suppress certain Haskell Alex/Happy compilation me...	[ -0.0079345703125, 0.01019287109375, 0.0167236328125, -0.004852294921875, -0.022216796875, 0.01385498046875, 0.00439453125, 0.0037384033203125, -0.0035400390625, -0.0027313232421875, -0.0250244140625, -0.002410888671875, 0.0164794921875, 0.0007171630859375, 0.015869140625, 0.01080322265...	[ 47004, 11856, 24233, 20625, 142508, 20984, 64, 184870, 98352, 89914, 366, 2189, 48281, 1556, 17723, 662, 425, 32506, 99078, 56, 2392, 53, 13315, 62346, 15612, 127, 31, 130028, 105233, 95, 34058, 145823, 9969, 49725, 102158, 36746, 114977, 139...	[ 0.13134765625, 0.1422119140625, 0.09912109375, 0.1126708984375, 0.2073974609375, 0.188720703125, 0.00848388671875, 0.193359375, 0.1976318359375, 0.16455078125, 0.10675048828125, 0.1177978515625, 0.09228515625, 0.056793212890625, 0.1265869140625, 0.006256103515625, 0.0797119140625, ...	embed
41735956_c0	41735956	haskell	0	Title: Performance of pattern matching in GHC Problem title: Performance of pattern matching in GHC Tags: ghc, pattern-matching, haskell Problem: Performance of pattern matching in GHC I'm writing an "append" function for a data type I've created (which basically deals with "streams"). However, this data type has 12 di...	Performance of pattern matching in GHC Performance of pattern matching in GHC ghc pattern-matching haskell Performance GHC Performance of pattern matching in GHC I'm writing an "append" function for a data type I've created (which basically deals with "streams"). However, this data type has 12 different constructors, d...	[ -0.006378173828125, 0.01470947265625, 0.01507568359375, -0.0048828125, 0.01220703125, -0.0213623046875, -0.028564453125, -0.0050048828125, 0.0169677734375, -0.0191650390625, 0.0198974609375, -0.026611328125, 0.00750732421875, -0.000148773193359375, -0.001983642578125, -0.00049591064453...	[ 94030, 103510, 14858, 214, 527, 73265, 111, 23, 31380, 238, 98753, 1556, 142508, 32562, 9007, 3611, 32354, 2053, 10644, 75935, 198343, 8, 16765, 86429, 427, 12921, 64549, 184017, 52895, 54241, 56574, 188347, 140909, 77336, 21771, 114689, 62775,...	[ 0.2054443359375, 0.2318115234375, 0.238037109375, 0.08001708984375, 0.1318359375, 0.230224609375, 0.059722900390625, 0.078857421875, 0.1190185546875, 0.1357421875, 0.2236328125, 0.1083984375, 0.2099609375, 0.0711669921875, 0.098876953125, 0.1458740234375, 0.1263427734375, 0.1010742...	embed
68110623_c1	68110623	haskell	1	' = x == x' && y == y' _ == _ = False It does not typecheck (with ghc 8.6.5 ), the error is the following: [1 of 1] Compiling Main ( Main.hs, Main.o ) instance Eq a => Eq (Expr a b) where -- same implementation eval :: Expr a b -> a -- same implementation This approach does not seem scalable to me, once more constructo...	' = x == x' && y == y' _ == _ = False It does not typecheck (with ghc 8.6.5 ), the error is the following: [1 of 1] Compiling Main ( Main.hs, Main.o ) instance Eq a => Eq (Expr a b) where -- same implementation eval :: Expr a b -> a -- same implementation This approach does not seem scalable to me, once more constructo...	[ -0.00848388671875, -0.0037689208984375, 0.0155029296875, 0.00008058547973632812, 0.026123046875, 0.005584716796875, -0.005615234375, -0.003265380859375, 0.007110595703125, 0.00860595703125, -0.01495361328125, -0.01165771484375, 0.0162353515625, -0.007720947265625, -0.00897216796875, 0....	[ 2203, 1022, 69112, 619, 1230, 113, 101, 22225, 1650, 14602, 959, 10644, 78292, 31380, 238, 3217, 136473, 18499, 25632, 15612, 49725, 12321, 127, 5, 31, 110527, 241, 864, 19279, 10287, 10, 876, 4210, 5701, 208124, 28, 1405, 60075, 42, 5151...	[ 0.11181640625, 0.1151123046875, 0.227783203125, 0.029876708984375, 0.0897216796875, 0.153076171875, 0.0010986328125, 0.1053466796875, 0.0147552490234375, 0.013580322265625, 0.0826416015625, 0.2030029296875, 0.283935546875, 0.1324462890625, 0.1356201171875, 0.1163330078125, 0.21301269...	embed
33312250_c0	33312250	haskell	0	Title: "For all" statements in Haskell Problem title: "For all" statements in Haskell Tags: types, haskell, conditional-statements, type-conversion, if-statement Problem: "For all" statements in Haskell I'm building comfort going through some Haskell toy problems and I've written the following speck...	"For all" statements in Haskell "For all" statements in Haskell types haskell conditional-statements type-conversion if-statement Haskell "For all" statements in Haskell I'm building comfort going through some Haskell toy problems and I've written the following speck of code which successfully prefo...	[ 0.0079345703125, 0.006591796875, -0.002777099609375, 0.006866455078125, 0.0185546875, 0.0118408203125, 0.005615234375, -0.0072021484375, 0.0123291015625, 0.0025634765625, -0.00102996826171875, 0.004180908203125, 0.00994873046875, 0.007415771484375, -0.0296630859375, 0.007354736328125, ...	[ 18537, 756, 41502, 63805, 20625, 142508, 52895, 1556, 35431, 289, 61340, 10644, 46354, 2174, 47506, 72713, 44402, 25632, 48502, 18151, 65771, 5037, 41018, 3444, 32354, 64457, 128219, 12830, 5423, 118126, 60089, 106, 31358, 75447, 8337, 16750, 1...	[ 0.1773681640625, 0.234130859375, 0.0596923828125, 0.2025146484375, 0.137451171875, 0.221435546875, 0.1224365234375, 0.113525390625, 0.0867919921875, 0.002166748046875, 0.1260986328125, 0.1121826171875, 0.07470703125, 0.0484619140625, 0.1029052734375, 0.1103515625, 0.0477294921875, ...	embed
15400549_c0	15400549	haskell	0	Title: How can I fix the "Unacceptable result type in foreign declaration: CULong" error building gtk2hs packages? Problem title: How can I fix the "Unacceptable result type in foreign declaration: CULong" error building gtk2hs packages? Tags: haskell, gtk2hs Problem: How can I fix the "Unacceptable...	How can I fix the "Unacceptable result type in foreign declaration: CULong" error building gtk2hs packages? How can I fix the "Unacceptable result type in foreign declaration: CULong" error building gtk2hs packages? haskell gtk2hs ccall How Unacceptable CULong gtk2hs Compiling Graphics.Rendering.Pan...	[ 0.003204345703125, 0.0245361328125, 0.00982666015625, -0.00958251953125, 0.018310546875, -0.004669189453125, -0.017578125, -0.0216064453125, -0.0157470703125, -0.0128173828125, 0.015625, -0.0751953125, 0.002471923828125, -0.0157470703125, -0.0021514892578125, 0.00640869140625, -0.010...	[ 30022, 14256, 135372, 2661, 16750, 10644, 110613, 21635, 143255, 4021, 18499, 33976, 706, 31472, 304, 127, 7, 98169, 1556, 142508, 85763, 992, 15612, 189682, 27803, 196707, 63137, 43531, 31, 60457, 206, 25732, 1126, 19721, 8743, 22829, 3794, ...	[ 0.09527587890625, 0.07220458984375, 0.19091796875, 0.0887451171875, 0.15087890625, 0.16943359375, 0.174560546875, 0.16748046875, 0.034515380859375, 0.198974609375, 0.1585693359375, 0.1612548828125, 0.0178680419921875, 0.1611328125, 0.09710693359375, 0.122802734375, 0.02972412109375, ...	embed
25788202_c0	25788202	haskell	0	Title: Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? Problem title: Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? Tags: haskell Problem: Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? I have the following data type: data Suit = ...	Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? haskell Enum Bounded Ord Haskell Suit Club Diamond Heart Spade Rank R10 Jack Queen King Ace Card suit::Suit rank::Rank Update Is there a way to plus one to an Enum Bo...	[ -0.01220703125, 0.00579833984375, 0.0152587890625, 0.0067138671875, 0.0047607421875, 0.01141357421875, -0.0031280517578125, -0.00921630859375, 0.02392578125, 0.0201416015625, 0.00701904296875, -0.0010986328125, 0.004241943359375, -0.002655029296875, -0.01422119140625, -0.026123046875, ...	[ 3917, 1001, 1632, 47, 357, 316, 335, 167457, 35379, 10644, 5303, 23, 20625, 142508, 1556, 1832, 7687, 69124, 60861, 10959, 112, 134405, 627, 963, 21763, 44109, 18813, 70280, 23660, 60813, 7143, 30648, 126525, 28641, 2685, 10, 2053, 156119, ...	[ 0.1009521484375, 0.231201171875, 0.1475830078125, 0.0810546875, 0.1236572265625, 0.1690673828125, 0.056121826171875, 0.1566162109375, 0.2127685546875, 0.16943359375, 0.215087890625, 0.035125732421875, 0.1357421875, 0.249755859375, 0.073486328125, 0.05389404296875, 0.16064453125, 0....	embed
53643823_c1	53643823	haskell	1	) -> IsJust m -> a justGetIt (Just y) ItIsJust = y print : RPS -> String print rps with (isItJust (print' rps)) \| Yes itIs = justGetIt (print' rps) itIs \| No itsNot = absurd $ itsNot $ print_exhaustive rps Now in my opinion this is fantastic. I am able to declare in exactly one place in my code what the correlation bet...	) -> IsJust m -> a justGetIt (Just y) ItIsJust = y print : RPS -> String print rps with (isItJust (print' rps)) \| Yes itIs = justGetIt (print' rps) itIs \| No itsNot = absurd $ itsNot $ print_exhaustive rps Now in my opinion this is fantastic. I am able to declare in exactly one place in my code what the correlation bet...	[ -0.018310546875, 0.0026092529296875, -0.011962890625, 0.018310546875, -0.0147705078125, 0.0257568359375, 0.01177978515625, -0.003326416015625, 0.006439208984375, 0.0033721923828125, 0.00469970703125, 0.0162353515625, -0.01507568359375, 0.00604248046875, -0.0068359375, 0.003250122070312...	[ 33079, 2071, 127794, 347, 1660, 724, 126, 23389, 113, 1650, 29598, 28412, 627, 9059, 23351, 214, 10681, 7, 678, 164, 35662, 25, 32635, 442, 438, 6863, 122116, 48152, 3650, 3355, 18391, 4935, 33153, 903, 83, 47823, 19048, 159978, 66161, 16...	[ 0.012451171875, 0.1256103515625, 0.2447509765625, 0.1241455078125, 0.119140625, 0.0902099609375, 0.08349609375, 0.1959228515625, 0.137939453125, 0.1668701171875, 0.20166015625, 0.1727294921875, 0.05096435546875, 0.189697265625, 0.1165771484375, 0.029876708984375, 0.15283203125, 0.0...	embed
21977487_c1	21977487	haskell	1	: maps f' xs So the idea is you have a function that takes and returns a state like (a -> s -> (b, s)) , but we modify it so that instead of returning an output/state tuple we return an output/X tuple, where X is the same type as our initial function. So its sort of like (a -> (b, a -> (b, ...))) . I was initially try...	: maps f' xs So the idea is you have a function that takes and returns a state like (a -> s -> (b, s)) , but we modify it so that instead of returning an output/state tuple we return an output/X tuple, where X is the same type as our initial function. So its sort of like (a -> (b, a -> (b, ...))) . I was initially try...	[ -0.004638671875, 0.0093994140625, -0.001983642578125, -0.0191650390625, -0.01611328125, 0.006866455078125, 0.0040283203125, -0.01165771484375, 0.0216064453125, -0.01190185546875, 0.0155029296875, 0.0078125, 0.00115203857421875, 0.0269775390625, -0.000568389892578125, -0.0157470703125, ...	[ 152, 22288, 7, 1238, 25, 1022, 6528, 83, 765, 32354, 51776, 136, 30646, 11341, 1884, 11, 33079, 91, 275, 2811, 40383, 64457, 140992, 61340, 370, 8705, 1542, 1193, 5701, 10644, 2446, 61475, 6863, 31577, 102337, 40099, 22836, 2667, 712, 176...	[ 0.02032470703125, 0.1741943359375, 0.0614013671875, 0.0880126953125, 0.1099853515625, 0.1124267578125, 0.1173095703125, 0.005462646484375, 0.022369384765625, 0.187744140625, 0.1204833984375, 0.065185546875, 0.1824951171875, 0.1890869140625, 0.0814208984375, 0.06573486328125, 0.112548...	embed
58963601_c1	58963601	haskell	1	.toList nexs let xsHead = strangeHeadMay xs let nexsHead = strangeHeadMay nexs pure () headMay :: Foldable f => f a -> Maybe a headMay = foldr (const . Just) Nothing tailMay :: Foldable f => f a -> Maybe (f a) tailMay = foldr (seq . Just) Nothing The error is /home/brandon/workspace/foldNEmaybes.hs:34:18: error: • No i...	.toList nexs let xsHead = strangeHeadMay xs let nexsHead = strangeHeadMay nexs pure () headMay :: Foldable f => f a -> Maybe a headMay = foldr (const . Just) Nothing tailMay :: Foldable f => f a -> Maybe (f a) tailMay = foldr (seq . Just) Nothing The error is /home/brandon/workspace/foldNEmaybes.hs:34:18: error: • No i...	[ -0.02783203125, 0.0081787109375, 0.020751953125, -0.00909423828125, 0.003692626953125, 0.0322265625, 0.000766754150390625, -0.016845703125, 0.025634765625, -0.00506591796875, 0.00113677978515625, 0.0147705078125, 0.00872802734375, 0.00994873046875, 0.00836181640625, -0.0267333984375, ...	[ 5, 188, 154663, 108, 425, 7, 2633, 1022, 13025, 712, 114453, 82419, 34166, 10336, 30077, 71, 2886, 1238, 83425, 18344, 7569, 25553, 9563, 182747, 46741, 18499, 29552, 43264, 18244, 65421, 42822, 8015, 11354, 7438, 30197, 24033, 438, 110527, ...	[ 0.0228118896484375, 0.1724853515625, 0.258544921875, 0.143310546875, 0.210693359375, 0.11279296875, 0.202392578125, 0.09100341796875, 0.15869140625, 0.1649169921875, 0.161865234375, 0.286865234375, 0.140869140625, 0.1600341796875, 0.12939453125, 0.0660400390625, 0.1302490234375, 0....	embed
63371157_c0	63371157	haskell	0	Title: Haskell Average Function using Foldmap Problem title: Haskell Average Function using Foldmap Tags: haskell, arguments, average Problem: Haskell Average Function using Foldmap I am trying to write a definition "average" in haskell using the code below so that the function produces the average (mean) of all of the...	Haskell Average Function using Foldmap Haskell Average Function using Foldmap haskell arguments average Foldmap Haskell Average RunningTotal Sum Float Foldable Haskell Average Function using Foldmap I am trying to write a definition "average" in haskell using the code below so that the function produces the average (me...	[ 0.004425048828125, -0.0167236328125, 0.00897216796875, 0.00689697265625, -0.0205078125, 0.01226806640625, 0.01104736328125, 0.00787353515625, 0.00154876708984375, -0.017333984375, 0.006317138671875, -0.02978515625, -0.00130462646484375, 0.01123046875, 0.00194549560546875, 0.00689697265...	[ 20625, 142508, 40168, 29838, 28670, 17368, 30077, 62346, 71, 1556, 10750, 83080, 28398, 169473, 36335, 38699, 257, 2886, 31577, 33022, 80934, 8216, 18151, 35064, 32354, 27489, 282, 66, 756, 80854, 107730, 42486, 2060, 18499, 119140, 5701, 15044...	[ 0.09619140625, 0.2015380859375, 0.1890869140625, 0.2203369140625, 0.1424560546875, 0.029998779296875, 0.1405029296875, 0.2130126953125, 0.0196075439453125, 0.11083984375, 0.1982421875, 0.249755859375, 0.04705810546875, 0.075927734375, 0.1224365234375, 0.11962890625, 0.023941040039062...	embed
74587307_c1	74587307	haskell	1	://b.abc.com > ... my naive parser will return, http://b.abc.com which is incorrect. I want it to error (so later I can use <\|> ) It's been a 3 days on this problem trying different approaches .. including just trying to find a parser to do what I wanted .. i.e. find the first thing (LINK) before you find the second th...	://b.abc.com > ... my naive parser will return, http://b.abc.com which is incorrect. I want it to error (so later I can use <\|> ) It's been a 3 days on this problem trying different approaches .. including just trying to find a parser to do what I wanted .. i.e. find the first thing (LINK) before you find the second th...	[ -0.0084228515625, 0.0137939453125, 0.005615234375, 0.0262451171875, -0.01055908203125, 0.03271484375, -0.0135498046875, 0.00006246566772460938, 0.003936767578125, -0.0186767578125, -0.026123046875, -0.000102996826171875, -0.0023040771484375, -0.0172119140625, 0.004547119140625, 0.00637...	[ 696, 275, 2055, 238, 277, 977, 153, 759, 24, 5844, 366, 2189, 1221, 30646, 1621, 83, 214552, 3444, 47, 18499, 14432, 4527, 4426, 58745, 2740, 2809, 138, 13312, 903, 2967, 31577, 12921, 51515, 7413, 54, 36663, 5117, 13580, 96787, 8108, 1...	[ 0.0919189453125, 0.095458984375, 0.1614990234375, 0.1572265625, 0.182861328125, 0.1864013671875, 0.050048828125, 0.04736328125, 0.1192626953125, 0.230224609375, 0.1988525390625, 0.2099609375, 0.05572509765625, 0.2015380859375, 0.137451171875, 0.0902099609375, 0.2041015625, 0.101562...	embed
35392658_c1	35392658	haskell	1	n x (i+1) v where h = v!i Most optimal solution that I've found constantly updates 2 arrays. One array being the main target, and other array being for fast index look ups. Better Java solution public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int k = input.nextI...	n x (i+1) v where h = v!i Most optimal solution that I've found constantly updates 2 arrays. One array being the main target, and other array being for fast index look ups. Better Java solution public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int k = input.nextI...	[ -0.03173828125, 0.0380859375, 0.004486083984375, -0.011962890625, -0.011962890625, 0.01068115234375, -0.018798828125, -0.000102996826171875, -0.007781982421875, -0.005889892578125, 0.0086669921875, 0.00726318359375, -0.01470947265625, 0.01129150390625, -0.01416015625, -0.0140380859375,...	[ 653, 1022, 14, 21748, 81, 7440, 1096, 2203, 38, 17006, 24087, 29806, 14037, 178308, 114419, 116, 10298, 4778, 6561, 8035, 5201, 30388, 4, 3789, 100, 4271, 63262, 6713, 1257, 7, 177154, 41925, 3835, 201939, 2292, 71, 132, 71713, 214, 1065,...	[ 0.1375732421875, 0.212646484375, 0.143798828125, 0.298583984375, 0.25732421875, 0.06390380859375, 0.193115234375, 0.0838623046875, 0.153076171875, 0.07745361328125, 0.2239990234375, 0.183837890625, 0.0635986328125, 0.2080078125, 0.2496337890625, 0.1370849609375, 0.181640625, 0.1383...	embed
26834510_c0	26834510	haskell	0	Title: Stack overflow in my recursive function Problem title: Stack overflow in my recursive function Tags: recursion, stack-overflow, haskell Problem: Stack overflow in my recursive function Code is here , when i call numberOf 3 or numberOf integer>2 im getting this error ERROR - C stack overflow . My code should chan...	Stack overflow in my recursive function Stack overflow in my recursive function recursion stack-overflow haskell Stack Integer Bool Stack overflow in my recursive function Code is here , when i call numberOf 3 or numberOf integer>2 im getting this error ERROR - C stack overflow . My code should change numbers between 2...	[ -0.0123291015625, -0.00115203857421875, -0.007293701171875, 0.007415771484375, 0.008056640625, 0.0196533203125, -0.01458740234375, 0.00836181640625, 0.016357421875, -0.0111083984375, -0.004058837890625, -0.021484375, 0.01806640625, 0.0059814453125, 0.0272216796875, -0.014404296875, 0...	[ 6512, 2594, 645, 118664, 23, 759, 195625, 5844, 32354, 1830, 177261, 5465, 1556, 142508, 44401, 2460, 929, 28864, 3688, 3229, 11782, 14012, 132887, 138, 707, 892, 1505, 2740, 304, 566, 903, 18499, 151206, 24638, 20, 313, 18151, 5608, 15549,...	[ 0.1640625, 0.1259765625, 0.1505126953125, 0.282958984375, 0.03326416015625, 0.0643310546875, 0.1983642578125, 0.1241455078125, 0.1495361328125, 0.0352783203125, 0.2156982421875, 0.11474609375, 0.0858154296875, 0.1937255859375, 0.14697265625, 0.0909423828125, 0.190673828125, 0.09368...	embed
209751_c0	209751	haskell	0	Title: Any Real-World Experience Using Software Transactional Memory? Problem title: Any Real-World Experience Using Software Transactional Memory? Tags: stm, clojure, haskell, language-agnostic, scala Problem: Any Real-World Experience Using Software Transactional Memory? It seems that there has been a recent rising i...	Any Real-World Experience Using Software Transactional Memory? Any Real-World Experience Using Software Transactional Memory? stm clojure haskell language-agnostic scala Any Real-World Experience Using Software Transactional Memory Any Real-World Experience Using Software Transactional Memory? It seems that there has b...	[ 0.006805419921875, 0.0142822265625, 0.0126953125, -0.0126953125, 0.0250244140625, -0.014404296875, 0.0103759765625, 0.03125, -0.0076904296875, -0.033447265625, -0.0023193359375, 0.0079345703125, -0.016845703125, 0.00360107421875, 0.00897216796875, 0.0172119140625, 0.01251220703125, ...	[ 28541, 5120, 70646, 135634, 345, 6953, 23752, 11062, 44713, 289, 172681, 6138, 39, 20450, 461, 107, 1556, 142508, 46876, 2895, 146232, 9588, 33946, 159, 10111, 155247, 124161, 98323, 170846, 111938, 51053, 40881, 208124, 4527, 66160, 13709, 144...	[ 0.0826416015625, 0.1756591796875, 0.173095703125, 0.226806640625, 0.119140625, 0.02581787109375, 0.2073974609375, 0.1651611328125, 0.1690673828125, 0.07421875, 0.244140625, 0.1383056640625, 0.1329345703125, 0.136962890625, 0.1844482421875, 0.186279296875, 0.10986328125, 0.236206054...	embed
7984755_c1	7984755	haskell	1	' searchWord subList = [def \| x <- subList, (wrd x) == searchWord] --search' searchWord subList = [def x \| x <- subList, (wrd x) == searchWord] --search' searchWord subList = [x->def \| x <- subList, (x->wrd) == searchWord] search :: [Run] -> Word -> String search runList searchWord = search' searchWord $ runList!!wrdLe...	' searchWord subList = [def \| x <- subList, (wrd x) == searchWord] --search' searchWord subList = [def x \| x <- subList, (wrd x) == searchWord] --search' searchWord subList = [x->def \| x <- subList, (x->wrd) == searchWord] search :: [Run] -> Word -> String search runList searchWord = search' searchWord $ runList!!wrdLe...	[ -0.0007171630859375, 0.002471923828125, 0.017578125, -0.000797271728515625, -0.013916015625, 0.00860595703125, 0.00167083740234375, 0.0038604736328125, 0.025390625, 0.0024566650390625, 0.0140380859375, -0.00177764892578125, -0.015869140625, 0.01556396484375, -0.0211181640625, 0.0018463...	[ 33938, 164805, 1614, 154663, 112, 1022, 5429, 86250, 425, 69112, 163321, 22543, 23351, 11675, 3650, 1146, 71, 866, 33, 148, 4216, 23986, 3871, 4358, 678, 25, 32354, 527, 73265, 14, 84751, 10644, 83, 21441, 8561, 357, 15123, 103607, 214, 1...	[ 0.29638671875, 0.226806640625, 0.2158203125, 0.20068359375, 0.016204833984375, 0.08428955078125, 0.03460693359375, 0.2191162109375, 0.0491943359375, 0.1041259765625, 0.16650390625, 0.20947265625, 0.138427734375, 0.114013671875, 0.0228271484375, 0.0706787109375, 0.03411865234375, 0....	embed
13102034_c0	13102034	haskell	0	Title: The last statement in a 'do' construct must be an expression : is there any indentation error Problem title: The last statement in a 'do' construct must be an expression : is there any indentation error Tags: haskell Problem: The last statement in a 'do' construct must be an expression : is t...	The last statement in a 'do' construct must be an expression : is there any indentation error The last statement in a 'do' construct must be an expression : is there any indentation error haskell Data.ByteString Data.ByteString.Internal Data.Bits B.pack B.length Prelude.rem Just top4 B.index bottom4...	[ 0.002227783203125, 0.0001621246337890625, -0.0048828125, 0.0078125, -0.004638671875, 0.0234375, -0.02001953125, -0.00009775161743164062, 0.00970458984375, 0.002532958984375, 0.003936767578125, -0.03173828125, -0.003631591796875, -0.001068115234375, -0.00701904296875, 0.01251220703125, ...	[ 4568, 63805, 3768, 246, 64549, 8110, 186, 125195, 83, 2685, 2499, 18597, 22062, 18499, 23, 1556, 142508, 11809, 75358, 71713, 44851, 335, 29102, 23986, 1914, 822, 7328, 9563, 2663, 617, 4711, 103136, 3137, 96760, 134165, 47416, 1019, 434, 9...	[ 0.2235107421875, 0.21044921875, 0.07489013671875, 0.2060546875, 0.2418212890625, 0.1131591796875, 0.0220947265625, 0.22119140625, 0.040008544921875, 0.0904541015625, 0.1038818359375, 0.1875, 0.1407470703125, 0.1907958984375, 0.013427734375, 0.0819091796875, 0.2125244140625, 0.02870...	embed
23810809_c1	23810809	haskell	1	True else False isnumber :: String -> Bool isnumber (h:t) = if (h>='0' && h<='9') then isnumber t else False paranthesis :: String -> Int -> Bool paranthesis [] a = if (a==0) then True else False paranthesis (h:t) a = if (h=='(') then (paranthesis t (a+1)) else (if (h==')') then paranthesis t (a-1) else paranthesis t ...	True else False isnumber :: String -> Bool isnumber (h:t) = if (h>='0' && h<='9') then isnumber t else False paranthesis :: String -> Int -> Bool paranthesis [] a = if (a==0) then True else False paranthesis (h:t) a = if (h=='(') then (paranthesis t (a+1)) else (if (h==')') then paranthesis t (a-1) else paranthesis t ...	[ -0.01348876953125, -0.01483154296875, -0.0010833740234375, 0.043212890625, 0, 0.01068115234375, 0.00457763671875, 0.00799560546875, -0.00775146484375, 0.006988525390625, -0.00032806396484375, -0.03564453125, -0.0067138671875, -0.00185394287109375, -0.01385498046875, 0.006256103515625, ...	[ 87599, 37076, 22225, 184, 83, 2606, 1297, 1984, 23351, 214, 33079, 2460, 929, 127, 12, 18, 2203, 2174, 2389, 619, 1096, 1126, 808, 121, 19, 2347, 6023, 360, 10, 11, 69112, 77495, 96899, 21748, 3190, 7068, 110218, 757, 31192, 12271, 6029...	[ 0.21337890625, 0.2459716796875, 0.211669921875, 0.1195068359375, 0.1875, 0.2437744140625, 0.197021484375, 0.05963134765625, 0.1939697265625, 0.1142578125, 0.046875, 0.1365966796875, 0.20654296875, 0.1475830078125, 0.10687255859375, 0.1558837890625, 0.01153564453125, 0.095458984375,...	embed
25251282_c0	25251282	haskell	0	Title: Core dump upon invoking newForeignPtr Problem title: Core dump upon invoking newForeignPtr Tags: ffi, garbage-collection, ghc, haskell, memory-management Problem: Core dump upon invoking newForeignPtr The following program : {-# LANGUAGE ForeignFunctionInterface #-} module Main where import qualified Data.Vector...	Core dump upon invoking newForeignPtr Core dump upon invoking newForeignPtr ffi garbage-collection ghc haskell memory-management qualified Data.Vector.Storable.Internal Foreign.ForeignPtr Foreign.Marshal.Alloc Core LANGUAGE ForeignFunctionInterface Main Data.Vector.Storable S.unsafeToForeignPtr S.fromList Error test2 A...	[ 0.00946044921875, 0.029296875, -0.0107421875, 0.0062255859375, -0.0023193359375, 0.00174713134765625, -0.0115966796875, -0.00112152099609375, -0.020263671875, -0.032958984375, 0.0191650390625, -0.0150146484375, 0.00555419921875, 0.0172119140625, -0.003692626953125, -0.00775146484375, ...	[ 31365, 115, 2676, 54799, 23253, 3525, 18537, 38529, 683, 4448, 24500, 3671, 402, 429, 196352, 31380, 238, 1556, 142508, 98323, 87140, 217225, 11809, 26455, 18770, 2886, 184293, 4200, 6652, 98064, 97249, 44851, 12321, 159, 115840, 161063, 154663...	[ 0.205810546875, 0.1839599609375, 0.200439453125, 0.050567626953125, 0.1202392578125, 0.121337890625, 0.122802734375, 0.1524658203125, 0.05487060546875, 0.1666259765625, 0.10614013671875, 0.05865478515625, 0.13037109375, 0.0411376953125, 0.117431640625, 0.0955810546875, 0.088684082031...	embed
41429680_c0	41429680	haskell	0	Title: Workflow for using stack to test Hackage packages (not in Stackage) Problem title: Workflow for using stack to test Hackage packages (not in Stackage) Tags: haskell, haskell-stack Problem: Workflow for using stack to test Hackage packages (not in Stackage) What is the workflow for using stack to preform an isola...	Workflow for using stack to test Hackage packages (not in Stackage) Workflow for using stack to test Hackage packages (not in Stackage) haskell haskell-stack stack Workflow Hackage Stackage Then PKG Workflow for using stack to test Hackage packages (not in Stackage) What is the workflow for using stack to preform an is...	[ -0.0126953125, 0.00921630859375, -0.0054931640625, -0.0035400390625, -0.00970458984375, 0.001129150390625, -0.0146484375, -0.00958251953125, 0.0032501220703125, 0.000583648681640625, -0.0078125, -0.00860595703125, -0.0036468505859375, 0.00494384765625, -0.005523681640625, -0.0028839111...	[ 27985, 118664, 17368, 177261, 3034, 52922, 4588, 98169, 10869, 6512, 11387, 429, 47, 1556, 142508, 590, 2594, 436, 45214, 4488, 479, 5037, 54015, 7026, 20600, 134234, 28007, 20625, 959, 129980, 50339, 18499, 88996, 43581, 1528, 51529, 24927, ...	[ 0.0997314453125, 0.241455078125, 0.0955810546875, 0.2352294921875, 0.1903076171875, 0.1798095703125, 0.1427001953125, 0.1845703125, 0.047271728515625, 0.1121826171875, 0.1417236328125, 0.1068115234375, 0.006439208984375, 0.07659912109375, 0.214599609375, 0.066650390625, 0.07391357421...	embed
44336324_c0	44336324	haskell	0	Title: Haskell Non-exhaustive patterns in function error in Maybe? Problem title: Haskell Non-exhaustive patterns in function error in Maybe? Tags: option-type, haskell, design-patterns Problem: Haskell Non-exhaustive patterns in function error in Maybe? I am writing a function that takes a list of Dates and evaluates ...	Haskell Non-exhaustive patterns in function error in Maybe? Haskell Non-exhaustive patterns in function error in Maybe? option-type haskell design-patterns Haskell Non-exhaustive Maybe Date Show isOlder2 Bool Just Nothing Haskell Non-exhaustive patterns in function error in Maybe? I am writing a function that takes a l...	[ -0.01055908203125, 0.013671875, 0.01025390625, 0.005706787109375, 0.0089111328125, 0.0244140625, -0.0140380859375, -0.020751953125, -0.00179290771484375, 0.00555419921875, 0.007080078125, -0.0004100799560546875, 0.019775390625, -0.01092529296875, -0.000629425048828125, -0.0032806396484...	[ 20625, 142508, 3775, 3355, 18391, 4935, 103510, 32354, 18499, 83425, 23, 35829, 50986, 1556, 4331, 4453, 22766, 25512, 17367, 83, 31178, 304, 2460, 929, 9563, 182747, 32562, 51776, 5303, 151575, 4153, 360, 18, 4263, 201505, 47, 104, 10332, ...	[ 0.1295166015625, 0.2232666015625, 0.1810302734375, 0.050811767578125, 0.1651611328125, 0.0849609375, 0.24853515625, 0.1690673828125, 0.209228515625, 0.321533203125, 0.0447998046875, 0.1490478515625, 0.0833740234375, 0.1312255859375, 0.1383056640625, 0.10064697265625, 0.0831298828125,...	embed
11690146_c0	11690146	haskell	0	Title: Why does GHC consider the LHS syntactically when inlining? Problem title: Why does GHC consider the LHS syntactically when inlining? Tags: optimization, haskell, ghc Problem: Why does GHC consider the LHS syntactically when inlining? According to the GHC docs : ...GHC will only inline the function if it is...	Why does GHC consider the LHS syntactically when inlining? Why does GHC consider the LHS syntactically when inlining? optimization haskell ghc Why GHC LHS comp1 INLINE comp2 Why does GHC consider the LHS syntactically when inlining? According to the GHC docs : Where the example given is two semantically-equivalen...	[ 0.0034637451171875, -0.00144195556640625, 0.0169677734375, 0.01361083984375, 0.0003147125244140625, 0.0272216796875, -0.005126953125, -0.0015411376953125, 0.00726318359375, -0.00090789794921875, 0.0279541015625, -0.009521484375, -0.001708984375, -0.00125885009765625, 0.004913330078125, ...	[ 44084, 527, 73265, 16916, 339, 38131, 12654, 18, 47013, 71407, 23, 150, 592, 87235, 1556, 142508, 31380, 238, 9969, 418, 5881, 57339, 304, 27781, 85540, 80934, 58827, 1510, 81113, 123166, 6002, 102, 21455, 68416, 294, 2256, 110, 27198, 3235...	[ 0.053985595703125, 0.0841064453125, 0.1832275390625, 0.0882568359375, 0.06561279296875, 0.1695556640625, 0.113525390625, 0.09320068359375, 0.1236572265625, 0.057373046875, 0.1158447265625, 0.154052734375, 0.0780029296875, 0.1383056640625, 0.0816650390625, 0.186767578125, 0.0641479492...	embed
25432290_c1	25432290	haskell	1	ums which I call Muls . class Muls a b c \| a b -> c instance '[] '[] '[] instance (Num n, Mul a b c, Muls as bs cs) => Muls (Dim.Dimensional v a n ': as) (Dim.Dimensional v b n ': bs) (Dim.Dimensional v c n ': cs) !! :: (Muls as bs cs) => F as -> F bs -> F cs (F a) !! (F b) = F (a ++ "*" ++ b) I got an Illegal Instan...	ums which I call Muls . class Muls a b c \| a b -> c instance '[] '[] '[] instance (Num n, Mul a b c, Muls as bs cs) => Muls (Dim.Dimensional v a n ': as) (Dim.Dimensional v b n ': bs) (Dim.Dimensional v c n ': cs) !! :: (Muls as bs cs) => F as -> F bs -> F cs (F a) !! (F b) = F (a ++ "*" ++ b) I got an Illegal Instan...	[ -0.005218505859375, -0.0128173828125, 0.0118408203125, -0.011962890625, -0.0196533203125, 0.0177001953125, -0.000640869140625, -0.031494140625, 0.00927734375, -0.01239013671875, -0.003753662109375, -0.0098876953125, 0.01611328125, -0.00811767578125, -0.0179443359375, -0.00537109375, ...	[ 286, 7, 3129, 87, 11782, 21442, 18507, 10, 876, 501, 6, 33079, 110527, 268, 316, 653, 237, 20763, 16, 464, 39330, 30283, 81, 15, 242, 12, 711, 1639, 38, 50657, 44357, 563, 919, 2203, 11, 37223, 58, 891, 86966, 360, 116071, 21635, 13...	[ 0.1109619140625, 0.1942138671875, 0.0248260498046875, 0.011566162109375, 0.07958984375, 0.27001953125, 0.1546630859375, 0.0416259765625, 0.10601806640625, 0.0819091796875, 0.01080322265625, 0.10528564453125, 0.2188720703125, 0.011199951171875, 0.08282470703125, 0.06488037109375, 0.12...	embed
50738164_c0	50738164	haskell	0	Title: Pattern synonyms deriving read? Problem title: Pattern synonyms deriving read? Tags: haskell, pattern-synonyms Problem: Pattern synonyms deriving read? Pattern synonyms provide a shorthand way to express a value; also they can provide an abstract name to avoid a client module breaking into the data decl. Here's ...	Pattern synonyms deriving read? Pattern synonyms deriving read? haskell pattern-synonyms Pattern MyNum MkNum Zero Read Pattern synonyms deriving read? Pattern synonyms provide a shorthand way to express a value; also they can provide an abstract name to avoid a client module breaking into the data decl. Here's a not ve...	[ -0.00860595703125, 0.0059814453125, -0.000568389892578125, 0.021240234375, 0.00408935546875, 0.01397705078125, 0.0198974609375, -0.01385498046875, -0.00830078125, -0.0213623046875, 0.010986328125, -0.020263671875, 0.0106201171875, -0.017822265625, 0.0147705078125, -0.004150390625, -0...	[ 9876, 22766, 164661, 7, 16406, 6496, 12301, 32, 1556, 142508, 103510, 12654, 45757, 2646, 839, 316, 276, 92, 83947, 4764, 22691, 16610, 12336, 3917, 47, 36510, 34292, 831, 164789, 9351, 71864, 23282, 88996, 116987, 2053, 8, 34937, 959, 8023...	[ 0.1871337890625, 0.177490234375, 0.225830078125, 0.05828857421875, 0.1260986328125, 0.0697021484375, 0.231689453125, 0.004302978515625, 0.09490966796875, 0.1829833984375, 0.226806640625, 0.039459228515625, 0.1358642578125, 0.13330078125, 0.1082763671875, 0.153076171875, 0.00677490234...	embed
42474546_c0	42474546	haskell	0	Title: Couldn't match type IO with Map and couldn't match type Map with [Char] Problem title: Couldn't match type IO with Map and couldn't match type Map with [Char] Tags: types, haskell Problem: Couldn't match type IO with Map and couldn't match type Map with [Char] I am new to Haskell and the foll...	Couldn't match type IO with Map and couldn't match type Map with [Char] Couldn't match type IO with Map and couldn't match type Map with [Char] types haskell Control.Monad Control.Applicative System.IO qualified Data.Maybe Couldn Map Char Data.Map Map.Map Map.empty Map.insert n-1 Couldn't match type...	[ -0.01055908203125, -0.002899169921875, -0.0027618408203125, 0.00909423828125, -0.0244140625, 0.0021820068359375, -0.006500244140625, -0.004791259765625, -0.004058837890625, -0.026611328125, 0.0108642578125, -0.0380859375, 0.019775390625, 0.00799560546875, 0.00811767578125, 0.0151977539...	[ 191147, 3768, 18, 14858, 10644, 17780, 678, 42719, 69427, 84068, 52895, 1556, 142508, 27131, 46674, 712, 11048, 12353, 217225, 11809, 21656, 166179, 33548, 33657, 5759, 3525, 47, 20625, 25632, 18151, 6626, 18499, 5117, 13315, 2046, 93232, 5, ...	[ 0.131103515625, 0.0736083984375, 0.1124267578125, 0.2308349609375, 0.19970703125, 0.229248046875, 0.1058349609375, 0.2239990234375, 0.088134765625, 0.187744140625, 0.1597900390625, 0.10595703125, 0.227783203125, 0.1707763671875, 0.045806884765625, 0.004669189453125, 0.029525756835937...	embed
49561881_c0	49561881	haskell	0	Title: Haskell: memoization of recursion Problem title: Haskell: memoization of recursion Tags: memoization, haskell Problem: Haskell: memoization of recursion if I have the following function: go xxs t i \| t == 0 = 1 \| t < 0 = 0 \| i < 0 = 0 \| t < (xxs !! i) = go xxs t (i-1) \| otherwise = go xxs (t - (xxs !! i)) (i-1) ...	Haskell: memoization of recursion Haskell: memoization of recursion memoization haskell Haskell i-1 Haskell: memoization of recursion if I have the following function: what is the best way to memoize the results? I can't seem to get my head how to store a dynamic set of tuples and update and return the value at the sam...	[ -0.0081787109375, 0.00927734375, 0.013916015625, -0.013916015625, 0.0084228515625, -0.012451171875, 0.00799560546875, 0.021484375, 0.0211181640625, -0.004638671875, 0.02001953125, -0.0166015625, 0.003448486328125, -0.00909423828125, 0.01507568359375, 0.021484375, 0.009033203125, -0...	[ 20625, 142508, 163, 432, 47691, 111, 195625, 1830, 12, 1556, 17, 5759, 2174, 25632, 32354, 2367, 2965, 3917, 47, 20650, 50339, 831, 48903, 10336, 4343, 84079, 5423, 370, 99726, 136, 28350, 30646, 34292, 5701, 183234, 31577, 17198, 50828, 19...	[ 0.1484375, 0.2293701171875, 0.168701171875, 0.1939697265625, 0.1505126953125, 0.07183837890625, 0.2406005859375, 0.110107421875, 0.0154266357421875, 0.146728515625, 0.0423583984375, 0.0806884765625, 0.00823974609375, 0.06396484375, 0.1729736328125, 0.0120849609375, 0.1441650390625, ...	embed
5926169_c0	5926169	haskell	0	Title: How do I convert the first 32 bits of the fractional part of a Float into a Word32? Problem title: How do I convert the first 32 bits of the fractional part of a Float into a Word32? Tags: haskell, sha, sha256, floating-point Problem: How do I convert the first 32 bits of the fractional part of a Float into a Wo...	How do I convert the first 32 bits of the fractional part of a Float into a Word32? How do I convert the first 32 bits of the fractional part of a Float into a Word32? haskell sha sha256 floating-point How Float Word32 Note All Initialize sha256 How do I convert the first 32 bits of the fractional part of a Float into ...	[ -0.0022735595703125, 0.0016632080078125, 0.0037994384765625, -0.0028228759765625, -0.005645751953125, 0.01080322265625, -0.00830078125, -0.007415771484375, 0.00154876708984375, 0.01019287109375, -0.000579833984375, 0.0303955078125, -0.00384521484375, 0.0166015625, -0.004364013671875, 0...	[ 11249, 54, 87, 96760, 5117, 2789, 4785, 175921, 289, 2831, 38699, 257, 3934, 10, 22543, 6460, 1556, 142508, 9638, 127892, 21917, 26518, 38496, 18622, 3164, 40705, 25916, 765, 3444, 74189, 40899, 20697, 7168, 116392, 37842, 20594, 74912, 864, ...	[ 0.045623779296875, 0.02294921875, 0.0144195556640625, 0.1727294921875, 0.1072998046875, 0.2001953125, 0.174072265625, 0.1539306640625, 0.056304931640625, 0.10687255859375, 0.2091064453125, 0.1539306640625, 0.092041015625, 0.043975830078125, 0.14404296875, 0.2445068359375, 0.090332031...	embed
75844764_c0	75844764	haskell	0	Title: "fatal error: 'ffi.h' file not found" when trying to install hashable via cabal Problem title: "fatal error: 'ffi.h' file not found" when trying to install hashable via cabal Tags: haskell Problem: "fatal error: 'ffi.h' file not found" when trying to install hashable via c...	"fatal error: 'ffi.h' file not found" when trying to install hashable via cabal "fatal error: 'ffi.h' file not found" when trying to install hashable via cabal haskell ffi.h Building hashable-1.4.2.0 Compiling Data.Hashable.Imports Data Hashable Imports.hs Imports.o Imports.dyn_o...	[ 0.0054931640625, 0.0029296875, 0.004974365234375, 0.00830078125, 0.003448486328125, -0.007049560546875, 0.00144195556640625, -0.00927734375, -0.003997802734375, -0.009521484375, -0.0142822265625, -0.0439453125, 0.0150146484375, 0.02099609375, 0.00860595703125, -0.00201416015625, -0.0...	[ 1021, 1803, 18499, 3768, 24500, 5, 127, 11435, 959, 14037, 31577, 20600, 1556, 2886, 1829, 109524, 142508, 104919, 91977, 73011, 15612, 49725, 11809, 6495, 6982, 162087, 92966, 15363, 61187, 2601, 181155, 31380, 152261, 238, 963, 15110, 34759, ...	[ 0.112548828125, 0.076171875, 0.14892578125, 0.1474609375, 0.2464599609375, 0.0751953125, 0.2098388671875, 0.177734375, 0.12451171875, 0.1536865234375, 0.07586669921875, 0.1490478515625, 0.1802978515625, 0.19677734375, 0.075927734375, 0.2274169921875, 0.2210693359375, 0.166381835937...	embed
41910663_c0	41910663	haskell	0	Title: Haskell: Assigning a value to a String Problem title: Haskell: Assigning a value to a String Tags: haskell Problem: Haskell: Assigning a value to a String My task consists in imitating features of an imperative programming language in Haskell. Now I'm struggling with assigning a value to a string. The point is t...	Haskell: Assigning a value to a String Haskell: Assigning a value to a String haskell Haskell Assigning Loc Location Env Sigma Haskell: Assigning a value to a String My task consists in imitating features of an imperative programming language in Haskell. Now I'm struggling with assigning a value to a string. The point ...	[ -0.006500244140625, -0.0208740234375, -0.00830078125, 0.0267333984375, -0.00750732421875, 0.009521484375, -0.01019287109375, 0.006683349609375, 0.0010986328125, 0.01495361328125, -0.0098876953125, -0.002349853515625, -0.007080078125, -0.008544921875, -0.013916015625, -0.009033203125, ...	[ 20625, 142508, 1301, 31304, 34292, 47, 23351, 214, 1556, 88784, 90788, 357, 334, 173328, 66211, 97751, 66139, 222530, 56037, 46876, 237875, 95486, 79315, 52895, 136, 21690, 9351, 10, 29458, 18151, 3714, 3642, 54, 32354, 1528, 5608, 4343, 7001...	[ 0.1256103515625, 0.2420654296875, 0.10333251953125, 0.240966796875, 0.1988525390625, 0.1351318359375, 0.2069091796875, 0.122802734375, 0.1064453125, 0.2093505859375, 0.2247314453125, 0.1341552734375, 0.2215576171875, 0.24755859375, 0.09014892578125, 0.1334228515625, 0.07958984375, ...	embed
44797426_c1	44797426	haskell	1	head (heap2list heap (Node x t1 t2))) then Just 0 else if ((contains heap e t1) == Just 0) then Just 0 else contains heap e t2 With that if the integer is in, it will return "Just 0" and else "Nothing". By the way, I am not allowed to use any "helper" functions written by myself. The function I am allowed to use are: e...	head (heap2list heap (Node x t1 t2))) then Just 0 else if ((contains heap e t1) == Just 0) then Just 0 else contains heap e t2 With that if the integer is in, it will return "Just 0" and else "Nothing". By the way, I am not allowed to use any "helper" functions written by myself. The function I am allowed to use are: e...	[ -0.0162353515625, 0.004852294921875, -0.01025390625, -0.018310546875, 0.02880859375, 0.0179443359375, -0.005889892578125, -0.0205078125, 0.022705078125, -0.017822265625, -0.01190185546875, 0.0026702880859375, 0.01171875, 0.005767822265625, 0.0167236328125, -0.00946044921875, -0.01458...	[ 10336, 1106, 2631, 304, 6562, 764, 5021, 112, 1022, 808, 418, 32149, 9563, 757, 37076, 98102, 5425, 28, 17727, 70541, 2174, 892, 1505, 23, 30646, 127794, 136, 64113, 107003, 4527, 73866, 56, 32354, 59121, 35978, 444, 201505, 1984, 183540, ...	[ 0.218994140625, 0.0999755859375, 0.1790771484375, 0.12109375, 0.162841796875, 0.1669921875, 0.08795166015625, 0.1190185546875, 0.07537841796875, 0.1044921875, 0.021514892578125, 0.0032958984375, 0.129638671875, 0.1942138671875, 0.07177734375, 0.15185546875, 0.0115966796875, 0.11242...	embed
33158502_c0	33158502	haskell	0	Title: Haskell - list product Problem title: Haskell - list product Tags: haskell Problem: Haskell - list product I know this question has been asked before. I worked through various posts but can't seem to find a solution to the problem. I have a simple Haskell program that creates a list of values. I then want to eit...	Haskell - list product Haskell - list product haskell Haskell Main x:xs Haskell - list product I know this question has been asked before. I worked through various posts but can't seem to find a solution to the problem. I have a simple Haskell program that creates a list of values. I then want to either call Prelude's ...	[ 0.005279541015625, 0.01385498046875, 0.015869140625, -0.00421142578125, -0.0252685546875, -0.0002899169921875, 0.0033721923828125, -0.003204345703125, 0.01708984375, -0.01068115234375, 0.01019287109375, -0.00799560546875, -0.000240325927734375, -0.016357421875, -0.007415771484375, 0.00...	[ 20625, 142508, 5303, 12996, 1556, 12321, 1022, 425, 8108, 29806, 2967, 8781, 1528, 28282, 142424, 3444, 11782, 1914, 822, 112, 32354, 10002, 12638, 1733, 48281, 1916, 2046, 45234, 16750, 10554, 49814, 26785, 5351, 95134, 127664, 1363, 17368, ...	[ 0.1385498046875, 0.2437744140625, 0.20166015625, 0.262451171875, 0.0994873046875, 0.06005859375, 0.026947021484375, 0.0823974609375, 0.0797119140625, 0.081787109375, 0.04840087890625, 0.066162109375, 0.10614013671875, 0.068359375, 0.150390625, 0.047210693359375, 0.116943359375, 0.0...	embed
58747995_c1	58747995	haskell	1	isErrorResult (UnexpectedString _) = True -- \| Runs the given function on a successful parse result. Otherwise return the same failing parse result. onResult :: ParseResult a -> (Input -> a -> ParseResult b) -> ParseResult b onResult UnexpectedEof _ = UnexpectedEof onResult (ExpectedEof i) _ = ExpectedEof i onResult (...	isErrorResult (UnexpectedString _) = True -- \| Runs the given function on a successful parse result. Otherwise return the same failing parse result. onResult :: ParseResult a -> (Input -> a -> ParseResult b) -> ParseResult b onResult UnexpectedEof _ = UnexpectedEof onResult (ExpectedEof i) _ = ExpectedEof i onResult (...	[ -0.0115966796875, 0.0189208984375, 0.0031585693359375, 0.003631591796875, -0.0002689361572265625, 0.0186767578125, -0.01007080078125, -0.031005859375, 0.01043701171875, 0.005218505859375, -0.00689697265625, -0.015625, -0.0015869140625, 0.017822265625, -0.034423828125, 0.0079345703125, ...	[ 83, 18468, 31611, 4332, 7, 7136, 14256, 83613, 13, 89829, 71713, 214, 101, 2203, 87599, 4210, 58745, 28398, 34475, 32354, 98, 65771, 366, 184, 16750, 30646, 5701, 35782, 2392, 10, 876, 647, 4390, 1081, 84068, 91, 472, 2053, 2189, 436, 9...	[ 0.1556396484375, 0.1597900390625, 0.194091796875, 0.1341552734375, 0.1756591796875, 0.2152099609375, 0.0899658203125, 0.133056640625, 0.123291015625, 0.1258544921875, 0.1846923828125, 0.08795166015625, 0.15234375, 0.06121826171875, 0.190185546875, 0.08135986328125, 0.04632568359375, ...	embed
53749540_c0	53749540	haskell	0	Title: Override poorly encapsulated instance in Haskell Problem title: Override poorly encapsulated instance in Haskell Tags: haskell Problem: Override poorly encapsulated instance in Haskell My program depends on a library that decodes JSON that I provide into its internal data type. The library tries to encapsulate t...	Override poorly encapsulated instance in Haskell Override poorly encapsulated instance in Haskell haskell Override Haskell Override poorly encapsulated instance in Haskell My program depends on a library that decodes JSON that I provide into its internal data type. The library tries to encapsulate too much. It hides co...	[ -0.0019989013671875, 0.00445556640625, 0.00238037109375, 0.011474609375, 0.004150390625, -0.0013427734375, -0.0233154296875, -0.0002841949462890625, 0.004241943359375, 0.019287109375, -0.016357421875, -0.03271484375, 0.017333984375, 0.0247802734375, 0.015625, -0.00982666015625, 0.028...	[ 9578, 416, 70425, 538, 22, 15644, 77593, 110527, 20625, 142508, 23, 1556, 112, 1528, 56566, 35773, 8, 40899, 821, 58627, 22691, 70796, 2053, 10644, 1294, 1927, 5792, 5045, 1274, 94878, 41653, 35686, 9384, 12233, 44462, 23468, 4527, 2967, 45...	[ 0.10009765625, 0.178955078125, 0.1844482421875, 0.0498046875, 0.0684814453125, 0.186279296875, 0.1788330078125, 0.264404296875, 0.1627197265625, 0.24755859375, 0.0175628662109375, 0.1431884765625, 0.0557861328125, 0.080810546875, 0.149658203125, 0.1905517578125, 0.140380859375, 0.1...	embed
70426554_c1	70426554	haskell	1	as well and recompacting the list as you go line = [(1,4),(0,5),(1,2),(0,1),(1,3),(0,1),(1,1),(0,2),(1,2),(0,3),(1,1),(0,2),(1,2),(0,1)] I've got this to get started tally = foldl (\acc elem -> if (snd(elem)+acc) >= 9 then (snd(elem)+acc)-9 else (snd(elem)+acc)) 0 and when I feed it line tally [(1,4),(0,5),(1,2),(0,1)...	as well and recompacting the list as you go line = [(1,4),(0,5),(1,2),(0,1),(1,3),(0,1),(1,1),(0,2),(1,2),(0,3),(1,1),(0,2),(1,2),(0,1)] I've got this to get started tally = foldl (\acc elem -> if (snd(elem)+acc) >= 9 then (snd(elem)+acc)-9 else (snd(elem)+acc)) 0 and when I feed it line tally [(1,4),(0,5),(1,2),(0,1)...	[ -0.00799560546875, -0.00555419921875, 0.00012063980102539062, 0.0306396484375, -0.007232666015625, 0.0216064453125, -0.00799560546875, 0.0166015625, 0.0145263671875, -0.00099945068359375, -0.00885009765625, 0.002960205078125, 0.0218505859375, 0.029296875, -0.032958984375, -0.0054931640...	[ 5299, 136, 456, 62268, 1916, 5303, 237, 738, 13315, 2203, 163324, 124940, 133063, 2389, 17727, 41600, 21320, 10461, 4163, 903, 2046, 26859, 2776, 538, 18344, 20469, 10060, 88, 195, 2174, 2208, 27889, 1328, 483, 15205, 757, 61590, 442, 51776...	[ 0.028106689453125, 0.013916015625, 0.03997802734375, 0.091552734375, 0.0023193359375, 0.1868896484375, 0.05010986328125, 0.04290771484375, 0.2091064453125, 0.01324462890625, 0.2017822265625, 0.2113037109375, 0.1346435546875, 0.056854248046875, 0.04888916015625, 0.003021240234375, 0.0...	embed
49431519_c0	49431519	haskell	0	Title: Doctest with GHC < 8.0: "phase `C pre-processor' failed" with "missing binary operator before token "("" Problem title: Doctest with GHC < 8.0: "phase `C pre-processor' failed" with "missing binary operator before token "("" Tags: c-prep...	Doctest with GHC < 8.0: "phase `C pre-processor' failed" with "missing binary operator before token "("" Doctest with GHC < 8.0: "phase `C pre-processor' failed" with "missing binary operator before token "("" c-preprocessor ghc doctest haskell...	[ 0.017822265625, -0.0010528564453125, 0.0147705078125, -0.00897216796875, -0.007415771484375, 0.00927734375, 0.00567626953125, -0.005157470703125, -0.01226806640625, 0.001800537109375, -0.011474609375, 0.000732421875, -0.01531982421875, 0.00171661376953125, 0.016357421875, -0.0003547668...	[ 29048, 6954, 678, 527, 73265, 1277, 3217, 2389, 153213, 441, 479, 63923, 748, 3768, 74, 165523, 619, 45188, 2394, 6635, 39933, 8108, 47, 1098, 132, 1230, 41502, 501, 4692, 31380, 238, 51584, 1556, 142508, 3311, 71713, 121137, 135913, 112204...	[ 0.169189453125, 0.254150390625, 0.060211181640625, 0.1060791015625, 0.225830078125, 0.064453125, 0.162109375, 0.179443359375, 0.165771484375, 0.119873046875, 0.17724609375, 0.1099853515625, 0.0806884765625, 0.1162109375, 0.003936767578125, 0.1693115234375, 0.003082275390625, 0.1457...	embed
64286597_c0	64286597	haskell	0	Title: Haskell:update a binary tree Problem title: Haskell:update a binary tree Tags: haskell, binary-tree, dictionary Problem: Haskell:update a binary tree I want to implement a map function ,mapLeaves ,which a function only map to the leaves in binary tree.And return a updated tree. data Tree = TNode Int [Tree] \| Tle...	Haskell:update a binary tree Haskell:update a binary tree haskell binary-tree dictionary Haskell:update Tree TNode Tleaf y:ys Haskell:update a binary tree I want to implement a map function ,mapLeaves ,which a function only map to the leaves in binary tree.And return a updated tree. this is where i stop,how can i make ...	[ 0.00007915496826171875, 0.017822265625, 0.00323486328125, -0.004974365234375, 0.0177001953125, 0.01080322265625, -0.0166015625, -0.0012054443359375, 0.00518798828125, -0.0228271484375, -0.005523681640625, -0.0146484375, 0.00946044921875, 0.006988525390625, 0.029296875, 0.007080078125, ...	[ 20625, 142508, 117008, 2394, 6635, 53201, 1556, 62600, 10763, 101344, 384, 5021, 112, 133, 2407, 113, 4778, 10, 3444, 29479, 22288, 32354, 62346, 178381, 7, 4734, 47, 31358, 23, 30646, 150011, 7279, 47251, 3249, 903, 32036, 808, 127887, 369...	[ 0.1337890625, 0.2269287109375, 0.1710205078125, 0.16162109375, 0.128662109375, 0.2181396484375, 0.114990234375, 0.1802978515625, 0.04913330078125, 0.2052001953125, 0.0880126953125, 0.1644287109375, 0.1400146484375, 0.072509765625, 0.1395263671875, 0.08123779296875, 0.0855712890625, ...	embed
19114194_c0	19114194	haskell	0	Title: Vertex2 confusion with haskell openGL bindings Problem title: Vertex2 confusion with haskell openGL bindings Tags: opengl, vertex, haskell Problem: Vertex2 confusion with haskell openGL bindings I'm using Haskell openGL bindings to try to make a particle generator. I want to store information about a particle in...	Vertex2 confusion with haskell openGL bindings Vertex2 confusion with haskell openGL bindings opengl vertex haskell Vertex2 Particle GLfloat Couldn Expected Actual Vertex2 confusion with haskell openGL bindings I'm using Haskell openGL bindings to try to make a particle generator. I want to store information about a pa...	[ -0.02294921875, -0.00518798828125, -0.00113677978515625, -0.01123046875, 0.032958984375, 0.018310546875, 0.00946044921875, 0.0005950927734375, 0.007049560546875, -0.00341796875, 0.00372314453125, -0.031982421875, 0.0152587890625, -0.033203125, -0.0152587890625, -0.0159912109375, 0.00...	[ 1446, 24371, 304, 169463, 678, 1556, 142508, 9803, 78703, 128239, 11016, 493, 436, 26147, 90799, 52347, 257, 191147, 60075, 13, 100582, 17368, 20625, 9790, 915, 145823, 3444, 4343, 4677, 17164, 831, 27875, 44457, 28350, 95307, 19069, 237, 542...	[ 0.19677734375, 0.2369384765625, 0.23974609375, 0.1905517578125, 0.034942626953125, 0.11279296875, 0.2049560546875, 0.106201171875, 0.201171875, 0.1802978515625, 0.157958984375, 0.10888671875, 0.0154876708984375, 0.1778564453125, 0.1737060546875, 0.224365234375, 0.1375732421875, 0.0...	embed
22319457_c0	22319457	haskell	0	Title: Proxies, type level symbols, and JSON Problem title: Proxies, type level symbols, and JSON Tags: haskell, vinyl, proxy, types Problem: Proxies, type level symbols, and JSON I'm trying to add automagical json parsing to Data.Vinyl Here is an instance for FromJSON for records with exactly one element. It almost wo...	Proxies, type level symbols, and JSON Proxies, type level symbols, and JSON haskell vinyl proxy types a the Proxies JSON KnownSymbol FromJSON PlainRec Object json_name Field T.pack Could sym0 Proxies, type level symbols, and JSON I'm trying to add automagical json parsing to Data.Vinyl Here is an instance for FromJSON ...	[ -0.01092529296875, -0.0101318359375, -0.0023651123046875, 0.00994873046875, -0.0174560546875, 0.002685546875, -0.0198974609375, 0.0224609375, -0.004913330078125, -0.0159912109375, -0.0185546875, -0.000476837158203125, -0.0029144287109375, 0.00927734375, -0.0125732421875, 0.017944335937...	[ 1250, 5134, 90, 10644, 17366, 26582, 136, 821, 58627, 1556, 142508, 193289, 502, 50878, 52895, 70829, 19, 65183, 36846, 28090, 1375, 8950, 4332, 238, 134549, 1647, 1681, 11627, 117657, 384, 29102, 191147, 954, 39, 2389, 15190, 1809, 15429, ...	[ 0.16748046875, 0.2080078125, 0.048004150390625, 0.1856689453125, 0.2222900390625, 0.2265625, 0.03466796875, 0.1273193359375, 0.208984375, 0.09423828125, 0.2037353515625, 0.236083984375, 0.128662109375, 0.2347412109375, 0.1593017578125, 0.150146484375, 0.038970947265625, 0.108520507...	embed
57551851_c0	57551851	haskell	0	Title: Parsing a Type using a GHC-Plugin Problem title: Parsing a Type using a GHC-Plugin Tags: haskell, ghc, ghc-api Problem: Parsing a Type using a GHC-Plugin I'm working on a compiler plugin that should abort compilation if a declaration doesn't have a type that given as a plugin argument. I think the function Unify...	Parsing a Type using a GHC-Plugin Parsing a Type using a GHC-Plugin haskell ghc ghc-api a Parsing Type GHC-Plugin Unify.tcMatchTy Maybe TCvSubstS Text:0:0 Not GHC tcl_env Parsing a Type using a GHC-Plugin I'm working on a compiler plugin that should abort compilation if a declaration doesn't have a type that given as a...	[ -0.00058746337890625, 0.015869140625, -0.013916015625, 0.005126953125, -0.01116943359375, 0.0002994537353515625, -0.0213623046875, -0.0113525390625, -0.00885009765625, -0.0498046875, -0.00048065185546875, -0.004058837890625, -0.00164794921875, -0.0106201171875, -0.004241943359375, 0.00...	[ 2392, 6953, 60457, 17368, 527, 73265, 9, 683, 35159, 73, 10, 1556, 142508, 31380, 238, 40897, 992, 40383, 79520, 618, 53, 80844, 334, 96472, 271, 294, 24129, 53861, 34937, 20697, 9969, 34759, 69993, 64853, 98352, 21635, 22027, 18, 10644, ...	[ 0.178955078125, 0.0528564453125, 0.29150390625, 0.0277557373046875, 0.08465576171875, 0.22119140625, 0.00433349609375, 0.04193115234375, 0.1707763671875, 0.1435546875, 0.072265625, 0.0609130859375, 0.1939697265625, 0.07537841796875, 0.066650390625, 0.08648681640625, 0.0821533203125, ...	embed
23803725_c1	23803725	haskell	1	.8 hs-source-dirs: src default-language: Haskell2010 ghc-options: -Wall -fno-warn-orphans test-suite tests type: exitcode-stdio-1.0 default-language: Haskell2010 hs-source-dirs: tests main-is: Test.hs ghc-options: -Wall -fno-warn-orphans build-depends: base == 4.*, QuickCheck >=2.6 && <2.7, test-framework-quickcheck2 >...	.8 hs-source-dirs: src default-language: Haskell2010 ghc-options: -Wall -fno-warn-orphans test-suite tests type: exitcode-stdio-1.0 default-language: Haskell2010 hs-source-dirs: tests main-is: Test.hs ghc-options: -Wall -fno-warn-orphans build-depends: base == 4.*, QuickCheck >=2.6 && <2.7, test-framework-quickcheck2 >...	[ -0.006378173828125, 0.00341796875, -0.00439453125, -0.006378173828125, -0.01239013671875, 0.0004749298095703125, 0.001251220703125, 0.005035400390625, 0.0166015625, -0.0185546875, -0.001922607421875, 0.0025787353515625, 0.0023651123046875, 0.021240234375, 0.01275634765625, 0.0230712890...	[ 5, 1019, 1096, 7, 60427, 936, 19437, 114977, 196651, 20625, 142508, 11436, 31380, 238, 109585, 198076, 157, 4205, 19, 748, 68743, 3034, 68879, 109921, 10644, 82230, 40899, 271, 5670, 102107, 5201, 8647, 127, 420, 45367, 105254, 3647, 1398, ...	[ 0.0137939453125, 0.14697265625, 0.0679931640625, 0.05303955078125, 0.130126953125, 0.0650634765625, 0.0828857421875, 0.17578125, 0.1649169921875, 0.1319580078125, 0.216796875, 0.1533203125, 0.0777587890625, 0.0222930908203125, 0.1444091796875, 0.1256103515625, 0.1278076171875, 0.06...	embed
38557834_c0	38557834	haskell	0	Title: Haskell Type matching error when passing two Lists Problem title: Haskell Type matching error when passing two Lists Tags: haskell, type-mismatch, list Problem: Haskell Type matching error when passing two Lists I'm getting started learning Haskell and have to create a really simple function that takes two Lists...	Haskell Type matching error when passing two Lists Haskell Type matching error when passing two Lists haskell type-mismatch list Criterion.Main Haskell Type Lists Couldn Integer Haskell Type matching error when passing two Lists I'm getting started learning Haskell and have to create a really simple function that takes...	[ 0.000080108642578125, -0.000873565673828125, -0.0087890625, 0.0002193450927734375, 0.008056640625, 0.00982666015625, 0.0081787109375, -0.0087890625, 0.01007080078125, -0.0059814453125, 0.0140380859375, -0.027587890625, -0.000789642333984375, -0.00872802734375, -0.0009307861328125, -0.0...	[ 20625, 142508, 60457, 14858, 18499, 452, 6626, 32036, 1556, 10644, 2179, 98753, 5303, 26315, 720, 1830, 168793, 191147, 44401, 214, 6953, 52080, 28282, 8781, 32354, 51776, 158, 4460, 66211, 240057, 164917, 28484, 18151, 25632, 9969, 49725, 3578...	[ 0.1143798828125, 0.2099609375, 0.2220458984375, 0.186767578125, 0.1820068359375, 0.07525634765625, 0.12548828125, 0.18017578125, 0.1075439453125, 0.185302734375, 0.0965576171875, 0.2303466796875, 0.1083984375, 0.06707763671875, 0.0902099609375, 0.11865234375, 0.008209228515625, 0.0...	embed
60698299_c0	60698299	haskell	0	Title: Using exported symbols Problem title: Using exported symbols Tags: module, haskell Problem: Using exported symbols I have a Haskell file called maxflow.hs that exports few symbols module MaxFlow (solveMaxFlow,MaxFlowNet,Vertex,Graph) where import Data.List data Vertex = Vertex { vertexLabel :: String , vertexNei...	Using exported symbols Using exported symbols module haskell Data.List MaxFlow Using MaxFlowNet Vertex Graph Show maxBound::Int elimination.hs:4:17 Data Char Integer Using exported symbols I have a Haskell file called maxflow.hs that exports few symbols In the same directory I have another file called elimination.hs th...	[ -0.005828857421875, 0.003326416015625, -0.004302978515625, 0.0277099609375, -0.0033721923828125, 0.0201416015625, 0.0030059814453125, 0.02490234375, -0.0013580322265625, -0.0225830078125, -0.01031494140625, -0.042236328125, 0.03466796875, -0.0030059814453125, 0.0022430419921875, 0.0054...	[ 345, 31255, 297, 26582, 7, 88996, 1556, 142508, 11809, 154663, 9920, 919, 17336, 24447, 1446, 24371, 6524, 11727, 17367, 18389, 12647, 7030, 18, 27169, 1363, 127, 617, 22950, 21656, 44401, 20625, 11435, 118664, 10846, 14364, 765, 1927, 4527, ...	[ 0.0843505859375, 0.24169921875, 0.109130859375, 0.23095703125, 0.08447265625, 0.131591796875, 0.1292724609375, 0.2088623046875, 0.1107177734375, 0.1151123046875, 0.1092529296875, 0.10498046875, 0.193359375, 0.1041259765625, 0.044158935546875, 0.109375, 0.10150146484375, 0.077331542...	embed
17078607_c0	17078607	haskell	0	Title: Evaluation of nullary functions in Haskell Problem title: Evaluation of nullary functions in Haskell Tags: functional-programming, lazy-evaluation, haskell Problem: Evaluation of nullary functions in Haskell Suppose you have a nullary function in Haskell, which is used several times in the code. Is it always eva...	Evaluation of nullary functions in Haskell Evaluation of nullary functions in Haskell functional-programming lazy-evaluation haskell Evaluation Haskell Hello n-1 Evaluation of nullary functions in Haskell Suppose you have a nullary function in Haskell, which is used several times in the code. Is it always evaluated onl...	[ -0.00183868408203125, -0.004913330078125, 0.022705078125, 0.006622314453125, 0.007659912109375, 0.0010223388671875, 0.017333984375, -0.02392578125, -0.00262451171875, 0.00162506103515625, -0.0228271484375, -0.0174560546875, 0.0081787109375, 0.00408935546875, 0.0152587890625, 0.01318359...	[ 151228, 9229, 1294, 32354, 20625, 142508, 123309, 28966, 21, 3285, 159258, 1556, 35378, 653, 5759, 11814, 40368, 20028, 18151, 11343, 151575, 4734, 24145, 21771, 3034, 11782, 209, 33022, 841, 13817, 16750, 4343, 7103, 5117, 219836, 442, 142027,...	[ 0.2388916015625, 0.205810546875, 0.1905517578125, 0.1954345703125, 0.130615234375, 0.2357177734375, 0.1072998046875, 0.042144775390625, 0.0287017822265625, 0.10028076171875, 0.174072265625, 0.07818603515625, 0.1912841796875, 0.014373779296875, 0.12353515625, 0.1331787109375, 0.145385...	embed
42517497_c0	42517497	haskell	0	Title: How do I use hdevtools with ghcjs within stack Problem title: How do I use hdevtools with ghcjs within stack Tags: ghc, hdevtools, haskell-stack, haskell, ghcjs Problem: How do I use hdevtools with ghcjs within stack So it looks like hdevtools cannot be directly used with ghcjs. Using stack install hdevtools wit...	How do I use hdevtools with ghcjs within stack How do I use hdevtools with ghcjs within stack ghc hdevtools haskell-stack haskell ghcjs How Error While hdevtools-0.1.5.0 Plan How do I use hdevtools with ghcjs within stack So it looks like hdevtools cannot be directly used with ghcjs. Using stack install hdevtools withi...	[ -0.01129150390625, 0.02490234375, -0.0068359375, -0.0030059814453125, 0.0037384033203125, 0.006195068359375, -0.0201416015625, 0.00732421875, -0.002655029296875, -0.015625, 0.007781982421875, -0.036865234375, 0.000453948974609375, 0.0146484375, 0.0033111572265625, 0.01055908203125, -...	[ 4527, 1096, 18548, 89110, 7, 678, 31380, 238, 28175, 28032, 177261, 1556, 142508, 590, 2594, 212059, 51404, 102014, 187461, 5586, 53418, 105237, 11814, 345, 20600, 527, 73265, 64977, 13452, 15673, 5701, 18499, 52895, 37382, 2806, 17723, 997, ...	[ 0.0965576171875, 0.1141357421875, 0.2257080078125, 0.2447509765625, 0.080322265625, 0.08453369140625, 0.10150146484375, 0.1053466796875, 0.1737060546875, 0.1209716796875, 0.163330078125, 0.054962158203125, 0.134033203125, 0.041351318359375, 0.05157470703125, 0.152587890625, 0.0225524...	embed
43443961_c1	43443961	haskell	1	ix { } After doing this, I executed nix-build release.nix and got back these derivations will be built: /nix/store/p481alkpm89712n3hnwai0nxhmjrm8b2-project-0.1.0.0.drv building path(s) ‘/nix/store/yszy2a6wd88pf6zlw0nw99l5wzvc0s9x-project-0.1.0.0’ setupCompilerEnvironmentPhase Build with /nix/store/d5w12a8bprd2518xnqp1c...	ix { } After doing this, I executed nix-build release.nix and got back these derivations will be built: /nix/store/p481alkpm89712n3hnwai0nxhmjrm8b2-project-0.1.0.0.drv building path(s) ‘/nix/store/yszy2a6wd88pf6zlw0nw99l5wzvc0s9x-project-0.1.0.0’ setupCompilerEnvironmentPhase Build with /nix/store/d5w12a8bprd2518xnqp1c...	[ -0.01348876953125, -0.006561279296875, -0.00701904296875, 0.005950927734375, 0.00299072265625, 0.0057373046875, -0.007781982421875, -0.000946044921875, 0.0087890625, 0.00445556640625, 0.004486083984375, -0.019287109375, 0.01483154296875, -0.007293701171875, -0.0013885498046875, -0.0019...	[ 4084, 24372, 20594, 903, 87, 71924, 300, 425, 177149, 54452, 93, 4163, 4420, 6097, 30057, 5256, 1221, 186, 88303, 45804, 185689, 26822, 14773, 634, 18504, 95322, 102014, 99929, 7569, 334, 33976, 60875, 169581, 108161, 686, 1900, 45689, 6991, ...	[ 0.1453857421875, 0.033599853515625, 0.0212860107421875, 0.036651611328125, 0.056396484375, 0.1407470703125, 0.1412353515625, 0.1810302734375, 0.200439453125, 0.1365966796875, 0.144287109375, 0.0003662109375, 0.10577392578125, 0.0928955078125, 0.2293701171875, 0.1170654296875, 0.08502...	embed
42232207_c0	42232207	haskell	0	Title: Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? Problem title: Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? Tags: haskell, text-processing Problem: Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? I want to remove trailing character...	Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? haskell text-processing qualified Why Haskell Data.ByteString.Lazy.Char8 LANGUAGE OverloadedStrings C.null C.empty C.head C.group C.zip C.concat Char Bytestring Why doe...	[ 0.028564453125, 0.036376953125, 0.025634765625, 0.023193359375, -0.0086669921875, 0.0244140625, -0.0113525390625, -0.0098876953125, -0.00616455078125, 0.0257568359375, -0.0206298828125, -0.0038909912109375, -0.0028076171875, 0.00872802734375, -0.0208740234375, 0.01141357421875, 0.021...	[ 44084, 22027, 3768, 18, 20625, 142508, 11809, 75358, 67, 71713, 214, 2729, 3285, 84068, 1019, 765, 51, 50836, 32354, 1556, 7986, 63923, 217225, 98064, 9578, 63033, 139550, 33548, 31251, 51588, 313, 2271, 4460, 21656, 3311, 91693, 3444, 87388,...	[ 0.10748291015625, 0.03997802734375, 0.0308837890625, 0.0736083984375, 0.09332275390625, 0.220458984375, 0.1248779296875, 0.07537841796875, 0.0853271484375, 0.156005859375, 0.0809326171875, 0.12109375, 0.1861572265625, 0.1824951171875, 0.21337890625, 0.0203094482421875, 0.125366210937...	embed
42936372_c0	42936372	haskell	0	Title: What is wrong in this Haskell function? Problem title: What is wrong in this Haskell function? Tags: haskell Problem: What is wrong in this Haskell function? I decided to dive in functional programming world recently, and a friend told me about Haskell. I started my own researches on the language particularity a...	What is wrong in this Haskell function? What is wrong in this Haskell function? haskell What Haskell What is wrong in this Haskell function? I decided to dive in functional programming world recently, and a friend told me about Haskell. I started my own researches on the language particularity and soon I got the main c...	[ -0.003204345703125, 0.0126953125, 0.0057373046875, 0.00811767578125, -0.0068359375, 0.0086669921875, -0.00628662109375, -0.0057373046875, 0.0108642578125, 0.00048065185546875, 0.01483154296875, 0.0130615234375, -0.0037841796875, 0.0076904296875, 0.014404296875, 0.001739501953125, 0.0...	[ 4865, 83, 44691, 23, 903, 20625, 142508, 32354, 1556, 45, 123309, 56037, 8999, 34391, 25188, 46876, 17311, 23755, 20697, 5303, 456, 434, 18781, 99707, 41361, 7228, 11389, 39531, 184, 35839, 18, 61924, 35064, 43240, 169123, 163, 29569, 15700, ...	[ 0.0941162109375, 0.0701904296875, 0.2139892578125, 0.099609375, 0.14697265625, 0.144287109375, 0.252685546875, 0.195556640625, 0.122802734375, 0.009033203125, 0.148681640625, 0.09979248046875, 0.010345458984375, 0.035736083984375, 0.023040771484375, 0.0877685546875, 0.02044677734375,...	embed
56013322_c0	56013322	haskell	0	Title: Why is Haskell Stack hanging while attempting to build my project? Problem title: Why is Haskell Stack hanging while attempting to build my project? Tags: haskell, macos, haskell-stack, build Problem: Why is Haskell Stack hanging while attempting to build my project? Warning: this is an unsupported build that ma...	Why is Haskell Stack hanging while attempting to build my project? Why is Haskell Stack hanging while attempting to build my project? haskell macos haskell-stack build --extra-lib-dirs Why Haskell Stack regex-posix-0.95.2 Download x86_64 Compiled Cabal-2.4.0.1 Glob-0.9.3 HUnit-1.6.0.0 QuickCheck-2.11.3 StateVar-1.1.1.1...	[ -0.027099609375, 0.012939453125, -0.004974365234375, -0.005126953125, -0.0166015625, -0.004180908203125, -0.01385498046875, -0.0003452301025390625, -0.00079345703125, 0.01422119140625, 0.006561279296875, -0.0419921875, 0.0111083984375, 0.0003032684326171875, 0.006256103515625, 0.000556...	[ 44084, 83, 20625, 142508, 6512, 2594, 10756, 214, 12960, 81887, 45367, 759, 13452, 47, 1556, 291, 7840, 590, 112779, 5612, 936, 6835, 3355, 67890, 425, 143161, 158296, 4857, 15276, 13307, 15612, 14, 6259, 30438, 289, 9, 116591, 5, 102014, ...	[ 0.1649169921875, 0.08245849609375, 0.17236328125, 0.277587890625, 0.2176513671875, 0.2235107421875, 0.257568359375, 0.1705322265625, 0.1419677734375, 0.16357421875, 0.1795654296875, 0.0347900390625, 0.1585693359375, 0.003631591796875, 0.1453857421875, 0.05859375, 0.1285400390625, 0...	embed
33509984_c0	33509984	haskell	0	Title: Can GHCI be used to explain coercions? Problem title: Can GHCI be used to explain coercions? Tags: haskell Problem: Can GHCI be used to explain coercions? How to ask GHCI to explain why the following: Lib> sum Nothing 0 Even compiles? Was there Monoid involved somehow? It's not in the signature! Lib> :i Foldab...	Can GHCI be used to explain coercions? Can GHCI be used to explain coercions? haskell Can GHCI Lib Nothing Monoid Foldable Ord Num Defined Data.Foldable Maybe Either Integer GHC.Num Word Float GHC.Float Double Can GHCI be used to explain coercions? How to ask GHCI to explain why the following: Even compiles? Was there ...	[ -0.0169677734375, -0.018798828125, 0.01336669921875, 0.0286865234375, -0.00921630859375, 0.0308837890625, -0.00640869140625, 0.00107574462890625, 0.01348876953125, 0.01092529296875, -0.0157470703125, -0.047119140625, -0.0057373046875, 0.000934600830078125, -0.00518798828125, -0.0025634...	[ 4171, 41877, 17304, 11814, 47, 73342, 552, 56, 5746, 1556, 142508, 43278, 182747, 77879, 532, 30077, 71, 2886, 35379, 52782, 5983, 11809, 18345, 44401, 527, 73265, 316, 22543, 38699, 365, 107172, 186, 26458, 15400, 25632, 31267, 9969, 1340, ...	[ 0.046417236328125, 0.164794921875, 0.2291259765625, 0.0911865234375, 0.05450439453125, 0.1871337890625, 0.1025390625, 0.168701171875, 0.1270751953125, 0.1087646484375, 0.2191162109375, 0.1566162109375, 0.112548828125, 0.12939453125, 0.1429443359375, 0.1004638671875, 0.017166137695312...	embed
70856865_c1	70856865	haskell	1	) as bs = quack p (p < x) x xs as bs -- Helper function for `split` quack p False x xs as bs = split p xs (x : as) bs quack p True x xs as bs = split p xs as (x : bs) -- Merges two lists as a sorted one merge [] ys = ys merge xs [] = xs merge (x : xs) (y : ys) = place (x < y) x xs y ys -- Helper function for `merge` pl...	) as bs = quack p (p < x) x xs as bs -- Helper function for `split` quack p False x xs as bs = split p xs (x : as) bs quack p True x xs as bs = split p xs as (x : bs) -- Merges two lists as a sorted one merge [] ys = ys merge xs [] = xs merge (x : xs) (y : ys) = place (x < y) x xs y ys -- Helper function for `merge` pl...	[ -0.007049560546875, 0.011474609375, 0.024169921875, -0.0228271484375, -0.016357421875, 0.01007080078125, -0.0062255859375, -0.0196533203125, 0.016357421875, 0.0302734375, 0.00946044921875, 0.0126953125, 0.01446533203125, 0.0030059814453125, -0.015869140625, -0.0081787109375, -0.00335...	[ 1388, 237, 876, 7, 2203, 2799, 2594, 915, 254, 4426, 1022, 4210, 39527, 56, 32354, 7008, 4353, 22225, 65450, 87599, 6035, 4188, 6626, 5303, 17497, 1632, 42564, 113, 3687, 1991, 429, 5201, 17780, 2633, 96, 96759, 154663, 757, 197094, 62351...	[ 0.01019287109375, 0.154052734375, 0.1492919921875, 0.1722412109375, 0.046356201171875, 0.1973876953125, 0.1728515625, 0.1319580078125, 0.05224609375, 0.095947265625, 0.094482421875, 0.03204345703125, 0.2066650390625, 0.1502685546875, 0.1632080078125, 0.061553955078125, 0.172485351562...	embed
3138249_c0	3138249	haskell	0	Title: How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? Problem title: How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? Tags: performance, haskell, arrays Problem: How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? I have a st...	How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? performance haskell arrays How Size Patch Strict.ByteString Position How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? I have a...	[ 0.00341796875, 0.00872802734375, -0.00592041015625, 0.0216064453125, -0.007568359375, 0.031494140625, -0.0242919921875, -0.0113525390625, 0.007568359375, 0.00689697265625, 0.0208740234375, 0.0029754638671875, 0.0263671875, -0.0098876953125, -0.0299072265625, 0.0019683837890625, -0.00...	[ 11249, 831, 93766, 43658, 4720, 157955, 10298, 4778, 390, 3934, 150679, 116, 397, 53, 87, 538, 1636, 23718, 1556, 142508, 80378, 159954, 73425, 15390, 75358, 67, 71713, 99428, 45646, 33636, 2053, 3444, 64549, 1295, 5423, 164917, 95486, 19069,...	[ 0.061981201171875, 0.0849609375, 0.2047119140625, 0.237548828125, 0.1346435546875, 0.175537109375, 0.15966796875, 0.09967041015625, 0.1199951171875, 0.142578125, 0.1552734375, 0.150146484375, 0.155029296875, 0.07342529296875, 0.0140533447265625, 0.007904052734375, 0.053558349609375, ...	embed
3213490_c0	3213490	haskell	0	Title: How do I write, "if typeclass a, then a is also an instance of b by this definition." Problem title: How do I write, "if typeclass a, then a is also an instance of b by this definition." Tags: haskell Problem: How do I write, "if typeclass a, then a is also an instance of b by this definition...	How do I write, "if typeclass a, then a is also an instance of b by this definition." How do I write, "if typeclass a, then a is also an instance of b by this definition." haskell How MyClass Show Constraint Foo Bar How do I write, "if typeclass a, then a is also an instance of b by this definition....	[ -0.0108642578125, -0.00933837890625, 0.01519775390625, 0.03466796875, 0.01123046875, 0.00372314453125, 0.003753662109375, -0.0216064453125, 0.02294921875, 0.00015163421630859375, -0.0228271484375, -0.0079345703125, -0.001983642578125, 0.0264892578125, -0.006378173828125, -0.01794433593...	[ 11249, 54, 87, 33022, 3190, 10644, 67413, 10, 7068, 83, 2843, 142, 110527, 111, 876, 390, 903, 80934, 1556, 142508, 2646, 140803, 17367, 1657, 2816, 4288, 9572, 31, 3253, 44, 32354, 27489, 23351, 214, 4527, 21980, 27875, 52895, 29479, 763...	[ 0.07177734375, 0.0290985107421875, 0.022003173828125, 0.1885986328125, 0.167724609375, 0.225341796875, 0.2548828125, 0.1455078125, 0.0960693359375, 0.038055419921875, 0.1246337890625, 0.040374755859375, 0.260498046875, 0.12109375, 0.1614990234375, 0.0972900390625, 0.07421875, 0.151...	embed
40580164_c0	40580164	haskell	0	Title: Parsing block comments with Megaparsec using symbols for start and end Problem title: Parsing block comments with Megaparsec using symbols for start and end Tags: haskell, megaparsec Problem: Parsing block comments with Megaparsec using symbols for start and end I want to parse text similar to this in Haskell us...	Parsing block comments with Megaparsec using symbols for start and end Parsing block comments with Megaparsec using symbols for start and end haskell megaparsec symbols Parsing Megaparsec START SKIP Foo END Parser Parsing block comments with Megaparsec using symbols for start and end I want to parse text similar to thi...	[ -0.028564453125, 0.0111083984375, 0.0014190673828125, 0.009033203125, -0.0203857421875, 0.0308837890625, -0.0091552734375, -0.01470947265625, 0.01397705078125, -0.01031494140625, -0.00201416015625, 0.0289306640625, 0.0052490234375, 0.01275634765625, -0.0086669921875, 0.0322265625, 0....	[ 2392, 6953, 46389, 24626, 678, 26842, 2500, 39797, 17368, 26582, 4034, 136, 3564, 1556, 142508, 31534, 188359, 159, 169000, 9572, 31, 39015, 2189, 3444, 366, 184, 7986, 21373, 20625, 16188, 21658, 166191, 10770, 674, 30646, 124519, 17721, 713...	[ 0.14111328125, 0.1046142578125, 0.190673828125, 0.24609375, 0.0275726318359375, 0.1630859375, 0.131103515625, 0.2257080078125, 0.023040771484375, 0.2178955078125, 0.1341552734375, 0.1048583984375, 0.1468505859375, 0.08917236328125, 0.2171630859375, 0.10723876953125, 0.177490234375, ...	embed
47211690_c1	47211690	haskell	1	In the expression: unfold extractMin In an equation for ‘ssort'’: ssort' = unfold extractMin test.hs:13:17: No instance for (Ord t0) arising from a use of ‘extractMin’ The type variable ‘t0’ is ambiguous Relevant bindings include ssort' :: [t0] -> [t0] (bound at test.hs:13:1) Note: there are several potential instance...	In the expression: unfold extractMin In an equation for ‘ssort'’: ssort' = unfold extractMin test.hs:13:17: No instance for (Ord t0) arising from a use of ‘extractMin’ The type variable ‘t0’ is ambiguous Relevant bindings include ssort' :: [t0] -> [t0] (bound at test.hs:13:1) Note: there are several potential instance...	[ 0.00396728515625, -0.0004100799560546875, 0.02294921875, -0.01495361328125, 0.000392913818359375, -0.00933837890625, -0.005889892578125, -0.0206298828125, 0.0205078125, 0.01007080078125, -0.00518798828125, -0.004547119140625, 0.0107421875, -0.0211181640625, 0.0034027099609375, 0.000572...	[ 125195, 51, 42822, 125663, 59076, 5490, 7, 62351, 91, 25, 3034, 22618, 22950, 438, 110527, 143045, 77495, 187, 4527, 112779, 15390, 10644, 77336, 2389, 920, 12282, 128239, 99091, 138577, 38516, 35379, 876, 9319, 5983, 137989, 5584, 94049, 107...	[ 0.1812744140625, 0.10064697265625, 0.210693359375, 0.20849609375, 0.2451171875, 0.1544189453125, 0.06280517578125, 0.304931640625, 0.10137939453125, 0.004913330078125, 0.0765380859375, 0.042510986328125, 0.0948486328125, 0.052520751953125, 0.1865234375, 0.138671875, 0.1104736328125, ...	embed
65657675_c1	65657675	haskell	1	Statement_ env (Do cond expr) = evalDo env (Do cond expr) evalStatement_ env (Print val) = do x <- evalVal env val liftIO $ putStrLn $ show x evalDo :: Env -> HStatement -> IOThrowsError () evalDo env (Do cond expr) = evalVal env cond >>= \x -> case x of HBool False -> return () HBool True -> do traverse_ (evalVal env)...	Statement_ env (Do cond expr) = evalDo env (Do cond expr) evalStatement_ env (Print val) = do x <- evalVal env val liftIO $ putStrLn $ show x evalDo :: Env -> HStatement -> IOThrowsError () evalDo env (Do cond expr) = evalVal env cond >>= \x -> case x of HBool False -> return () HBool True -> do traverse_ (evalVal env)...	[ -0.032958984375, -0.00732421875, -0.00921630859375, -0.0057373046875, -0.0257568359375, 0.01953125, 0.003997802734375, -0.029296875, -0.00982666015625, 0.016845703125, 0.005035400390625, -0.01031494140625, 0.01031494140625, -0.010986328125, -0.01116943359375, 0.0036163330078125, -0.0...	[ 22836, 674, 454, 22, 334, 8331, 158, 71, 14700, 42, 28, 1405, 135206, 5911, 112079, 18, 3502, 54, 1022, 42272, 60520, 17780, 3884, 71713, 7639, 357, 39718, 19888, 87, 23973, 127, 15555, 7, 18468, 31611, 7225, 572, 12647, 929, 22225, 306...	[ 0.2227783203125, 0.14501953125, 0.05889892578125, 0.0875244140625, 0.208251953125, 0.1968994140625, 0.0902099609375, 0.0780029296875, 0.087890625, 0.08782958984375, 0.069580078125, 0.2344970703125, 0.187744140625, 0.1263427734375, 0.1529541015625, 0.0867919921875, 0.15576171875, 0....	embed
57194718_c0	57194718	haskell	0	Title: How to convert type-level list into chain of pairs Problem title: How to convert type-level list into chain of pairs Tags: haskell, singleton-type, functional-programming Problem: How to convert type-level list into chain of pairs The singletons library seems too difficult to deal with it without strong backgrou...	How to convert type-level list into chain of pairs How to convert type-level list into chain of pairs haskell singleton-type functional-programming Data.Singletons.Prelude.List Data.Singletons.Prelude.Tuple How LANGUAGE TypeFamilies TypeInType ExpandList IntoChainOfPairs Sing SCons SNil STuple2 STuple0 How to convert t...	[ -0.006439208984375, -0.00421142578125, -0.00872802734375, 0.0201416015625, 0.0033721923828125, 0.01239013671875, -0.022216796875, -0.01397705078125, 0.015869140625, -0.0213623046875, -0.01123046875, -0.0026397705078125, 0.010498046875, 0.009033203125, -0.0218505859375, 0.00692749023437...	[ 11249, 96760, 10644, 67919, 5303, 3934, 121293, 111, 80836, 1556, 142508, 11001, 1507, 50986, 123309, 28966, 11809, 213039, 67772, 19273, 822, 154663, 112, 15665, 8705, 98064, 60457, 1191, 4153, 196707, 60075, 2940, 360, 188, 62467, 73, 132887,...	[ 0.0197906494140625, 0.171630859375, 0.20849609375, 0.237548828125, 0.208740234375, 0.1083984375, 0.250244140625, 0.09912109375, 0.26806640625, 0.10577392578125, 0.1827392578125, 0.15283203125, 0.1124267578125, 0.1123046875, 0.103271484375, 0.07763671875, 0.02752685546875, 0.1118164...	embed
36943608_c0	36943608	haskell	0	Title: Looking for `flatten :: Event [a] -> Event a` in Reactive Banana Problem title: Looking for `flatten :: Event [a] -> Event a` in Reactive Banana Tags: haskell, reactive-banana Problem: Looking for `flatten :: Event [a] -> Event a` in Reactive Banana I'm looking for something like flatten :: Event [a] -> Ev...	Looking for `flatten :: Event [a] -> Event a` in Reactive Banana Looking for `flatten :: Event [a] -> Event a` in Reactive Banana haskell reactive-banana Looking Event Reactive Banana Foldable Banana.MomentIO Banana.Event Banana.newEvent mapM_ Looking for `flatten :: Event [a] -> Event a` in Reactive Banana I'm l...	[ -0.007781982421875, 0.0206298828125, 0.00543212890625, -0.00982666015625, -0.01611328125, -0.0086669921875, 0.01348876953125, 0.0108642578125, 0.0045166015625, -0.0269775390625, -0.01092529296875, -0.0034027099609375, -0.003662109375, 0.01507568359375, -0.006683349609375, -0.0048828125...	[ 157268, 100, 150632, 510, 1984, 36943, 11, 5386, 10, 853, 71232, 53592, 76, 23, 1556, 142508, 456, 105281, 30077, 71, 2886, 9083, 674, 17780, 192134, 54936, 22288, 16487, 9844, 1884, 49878, 634, 678, 1238, 2174, 3444, 2806, 139392, 84797, ...	[ 0.108642578125, 0.07867431640625, 0.2003173828125, 0.245849609375, 0.048431396484375, 0.224609375, 0.1466064453125, 0.152099609375, 0.162841796875, 0.0931396484375, 0.2015380859375, 0.165283203125, 0.1602783203125, 0.0278167724609375, 0.0804443359375, 0.1734619140625, 0.0721435546875...	embed
19709899_c0	19709899	haskell	0	Title: Monadic comprehension syntax in C# Problem title: Monadic comprehension syntax in C# Tags: monads, haskell, functional-programming, c%23 Problem: Monadic comprehension syntax in C# I've been hanging out in a #haskell IRC room a couple of days ago and someone mentioned that C# has syntax for doing monadic compreh...	Monadic comprehension syntax in C# Monadic comprehension syntax in C# monads haskell functional-programming c%23 x y Monadic IEnumerable SelectMany xs.SelectMany ys.Select Task Monadic comprehension syntax in C# I've been hanging out in a #haskell IRC room a couple of days ago and someone mentioned that C# has syntax f...	[ -0.024658203125, 0.03662109375, 0.0133056640625, 0.01068115234375, -0.0098876953125, 0.01104736328125, -0.001373291015625, 0.0098876953125, 0.004638671875, -0.041259765625, -0.0172119140625, -0.023681640625, 0.002197265625, 0.0023956298828125, -0.015625, 0.001861572265625, 0.00177001...	[ 60331, 18403, 46683, 3220, 6889, 6002, 86531, 23, 313, 4904, 2667, 712, 1556, 142508, 123309, 28966, 3949, 3742, 113, 75536, 2606, 56, 2886, 51620, 12662, 53, 1022, 100184, 9598, 10756, 1810, 10557, 25740, 17155, 100, 20594, 11, 29459, 2821...	[ 0.2113037109375, 0.194580078125, 0.2052001953125, 0.2152099609375, 0.08392333984375, 0.170166015625, 0.2242431640625, 0.037994384765625, 0.0855712890625, 0.21240234375, 0.162109375, 0.158935546875, 0.0897216796875, 0.1903076171875, 0.14599609375, 0.08038330078125, 0.010101318359375, ...	embed
7223901_c1	7223901	haskell	1	Step' q cs scheduleOrStep' q ((Step b g):cs) = scheduleOrStep' (q . (g b:)) cs scheduleOrStep' q [] = s q -- schedule all completed compuations, step all the rest once, and repeat -- (may never complete for infinite lists) -- checking each row of -- [ [ c0s0, c1s0, c2s0, ... ] -- , [ c0s1, c1s1, c2s1, ... ] -- , [ c0s2...	Step' q cs scheduleOrStep' q ((Step b g):cs) = scheduleOrStep' (q . (g b:)) cs scheduleOrStep' q [] = s q -- schedule all completed compuations, step all the rest once, and repeat -- (may never complete for infinite lists) -- checking each row of -- [ [ c0s0, c1s0, c2s0, ... ] -- , [ c0s1, c1s1, c2s1, ... ] -- , [ c0s2...	[ -0.019287109375, 0.0284423828125, 0.004852294921875, 0.01409912109375, 0.002227783203125, -0.01416015625, 0.00738525390625, -0.01025390625, 0.0218505859375, 0.00168609619140625, -0.0142822265625, 0.02685546875, 0.0048828125, -0.0026702880859375, -0.0250244140625, -0.003570556640625, ...	[ 50478, 25, 8096, 20763, 80889, 19060, 191644, 876, 706, 2077, 4439, 2203, 864, 177, 84142, 91, 4210, 756, 140528, 9969, 34, 4, 29954, 10588, 24145, 136, 119140, 11354, 8306, 28484, 54241, 5303, 175199, 12638, 15555, 111, 2389, 304, 594, 1...	[ 0.286376953125, 0.176025390625, 0.2384033203125, 0.1290283203125, 0.30078125, 0.196044921875, 0.2427978515625, 0.1171875, 0.1171875, 0.035888671875, 0.14306640625, 0.0662841796875, 0.1260986328125, 0.055694580078125, 0.036895751953125, 0.1282958984375, 0.0830078125, 0.1279296875, ...	embed
7635720_c0	7635720	haskell	0	Title: type declarations in 'where' -- what's going on? Problem title: type declarations in 'where' -- what's going on? Tags: haskell, types, where-clause Problem: type declarations in 'where' -- what's going on? While reading the QuickCheck Manual , I came across the following example: pr...	type declarations in 'where' -- what's going on? type declarations in 'where' -- what's going on? haskell types where-clause prop_RevRev Bool type declarations in 'where' -- what's going on? While reading the QuickCheck Manual , I came across the following example: The manual goes on to sa...	[ 0.01177978515625, 0.0230712890625, -0.003265380859375, -0.016845703125, -0.020751953125, 0.006378173828125, 0.006683349609375, -0.01080322265625, 0.00011491775512695312, -0.0023651123046875, -0.002288818359375, -0.01239013671875, -0.000942230224609375, -0.04052734375, -0.002471923828125,...	[ 10644, 21635, 5256, 23, 3768, 136913, 2367, 7730, 98, 1556, 142508, 52895, 7440, 18347, 4032, 25793, 4332, 334, 2460, 929, 89038, 202567, 111021, 27781, 23009, 8306, 51592, 6044, 88308, 20625, 8108, 6183, 44402, 44084, 903, 6002, 86531, 32316...	[ 0.2459716796875, 0.233154296875, 0.0711669921875, 0.097900390625, 0.08837890625, 0.237060546875, 0.0621337890625, 0.0989990234375, 0.1085205078125, 0.1036376953125, 0.23779296875, 0.183349609375, 0.2047119140625, 0.0797119140625, 0.0203399658203125, 0.17822265625, 0.08837890625, 0....	embed

25046000_c1

25046000

haskell

1

I could create a map of ResumableSinks, there is a library in Hackage for that, but it depends on an old and very specific version of Conduit, so cabal couldn't install it. In the end I didn't find a way to write the function with the previous type, able to work with any sink, so I came up with a function that works w...

[ 0.00653076171875, -0.0108642578125, -0.00372314453125, -0.00592041015625, -0.01409912109375, -0.017822265625, 0.0010528564453125, 0.0048828125, -0.00958251953125, 0.00014495849609375, -0.00830078125, 0.010009765625, 0.0191650390625, 0.0235595703125, 0.0028076171875, -0.021240234375, ...

[ 5809, 28282, 22288, 9624, 316, 2886, 294, 14068, 7, 35773, 1294, 52922, 4588, 56566, 10332, 4552, 29458, 11389, 1657, 112061, 109524, 69427, 18, 20600, 3564, 33022, 32354, 96362, 10644, 4488, 2499, 880, 92, 1257, 43240, 678, 102158, 105237, ...

[ 0.048492431640625, 0.1497802734375, 0.23193359375, 0.077392578125, 0.1956787109375, 0.1661376953125, 0.089599609375, 0.2222900390625, 0.06298828125, 0.14501953125, 0.0217437744140625, 0.1807861328125, 0.2056884765625, 0.1153564453125, 0.0179595947265625, 0.005828857421875, 0.08715820...

embed

42384473_c0

42384473

haskell

0

Title: confusion over the passing of State monad in Haskell Problem title: confusion over the passing of State monad in Haskell Tags: monads, state-monad, haskell Problem: confusion over the passing of State monad in Haskell In Haskell the State is monad is passed around to extract and store state. And in the two follo...

confusion over the passing of State monad in Haskell confusion over the passing of State monad in Haskell monads state-monad haskell State Haskell GameValue GameState Bool score-1 confusion over the passing of State monad in Haskell In Haskell the State is monad is passed around to extract and store state. And in the t...

[ -0.0062255859375, 0.00182342529296875, 0.01458740234375, -0.018798828125, 0.0072021484375, -0.01470947265625, -0.0164794921875, -0.0035400390625, 0.0023193359375, -0.0133056640625, 0.02099609375, 0.0341796875, -0.0224609375, 0.01165771484375, -0.007598876953125, -0.007232666015625, 0...

[ 169463, 645, 452, 6953, 111, 22836, 2667, 712, 23, 20625, 142508, 11341, 3796, 1556, 13547, 856, 50770, 135206, 2460, 929, 47763, 5759, 70, 83, 115081, 10932, 47, 125663, 136, 4343, 6626, 25632, 27781, 15044, 27875, 17368, 6396, 20903, 493,...

[ 0.199462890625, 0.036376953125, 0.140625, 0.03912353515625, 0.0093994140625, 0.2476806640625, 0.14453125, 0.221435546875, 0.1121826171875, 0.1580810546875, 0.287841796875, 0.220703125, 0.11083984375, 0.126953125, 0.0848388671875, 0.1129150390625, 0.1036376953125, 0.1395263671875, ...

embed

10345504_c0

10345504

haskell

0

Title: Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary Problem title: Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary Tags: haskell, quickcheck Problem: Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary I have a function that takes a Respons...

Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary haskell quickcheck an Generate Network.HTTP.ResponseCode Arbitrary ResponseCode Generate triple (Network.HTTP.ResponseCode) using an instance of Arbitrary I have a functi...

[ -0.01544189453125, 0.000949859619140625, 0.0235595703125, -0.004425048828125, 0.0078125, 0.00970458984375, -0.0220947265625, -0.014892578125, -0.0002880096435546875, -0.0194091796875, -0.004974365234375, 0.01611328125, 0.0135498046875, 0.01068115234375, 0.0024871826171875, -0.000059843...

[ 155370, 67, 162738, 24447, 18244, 18544, 23658, 94399, 114211, 17368, 110527, 242522, 1294, 1556, 142508, 63773, 78292, 28997, 92748, 32354, 51776, 3034, 89038, 202567, 33022, 23, 933, 35773, 10644, 4153, 18, 360, 54397, 527, 73265, 186992, 391...

[ 0.1678466796875, 0.030426025390625, 0.283203125, 0.01318359375, 0.05792236328125, 0.03228759765625, 0.09759521484375, 0.142822265625, 0.1937255859375, 0.01885986328125, 0.1514892578125, 0.200927734375, 0.163818359375, 0.0977783203125, 0.1800537109375, 0.09130859375, 0.2161865234375, ...

embed

34052377_c0

34052377

haskell

0

Title: Visualizing the Free Monad Problem title: Visualizing the Free Monad Tags: free-monad, haskell, monads Problem: Visualizing the Free Monad I think I have rough idea of what the free monad is, but I would like to have a better way to visualize it. It makes sense that free magmas are just binary trees because that...

Visualizing the Free Monad Visualizing the Free Monad free-monad haskell monads Visualizing Free Monad Visualizing the Free Monad I think I have rough idea of what the free monad is, but I would like to have a better way to visualize it. It makes sense that free magmas are just binary trees because that's as "general" ...

[ 0.006134033203125, 0.015625, 0.00011873245239257812, 0.004180908203125, 0.0169677734375, 0.00531005859375, -0.0230712890625, 0.002471923828125, -0.011962890625, 0.00037384033203125, 0.002899169921875, -0.013671875, 0.001068115234375, 0.0189208984375, -0.020263671875, -0.002273559570312...

[ 73372, 84382, 5153, 60331, 71, 4092, 3796, 712, 1556, 142508, 2667, 166904, 6528, 2367, 70, 83, 11522, 21176, 20650, 10422, 1697, 1510, 621, 1660, 2394, 6635, 1360, 237, 180300, 15490, 388, 4677, 22460, 30185, 5303, 12989, 41018, 18, 26866,...

[ 0.1837158203125, 0.08935546875, 0.171142578125, 0.18115234375, 0.156494140625, 0.211181640625, 0.111328125, 0.2073974609375, 0.052734375, 0.1788330078125, 0.1514892578125, 0.009307861328125, 0.04541015625, 0.03436279296875, 0.01409912109375, 0.06640625, 0.0229034423828125, 0.183349...

embed

24350542_c0

24350542

haskell

0

Title: Optimizing sum, ZipList, Vector, and unboxed types Problem title: Optimizing sum, ZipList, Vector, and unboxed types Tags: optimization, lazy-evaluation, haskell Problem: Optimizing sum, ZipList, Vector, and unboxed types I have identified the following hotspot function that is currently 25% of my program execut...

Optimizing sum, ZipList, Vector, and unboxed types Optimizing sum, ZipList, Vector, and unboxed types optimization lazy-evaluation haskell Optimizing ZipList Vector EncodeLookup GF256Elm Given Polynomial COST CENTRE calc.f calc.f.s calc.f.lst calc.f.zl Optimizing sum, ZipList, Vector, and unboxed types I have identifie...

[ 0.00982666015625, 0.005126953125, 0.01263427734375, -0.004791259765625, -0.0235595703125, -0.01531982421875, 0.006134033203125, -0.00311279296875, 0.0177001953125, -0.007659912109375, 0.0072021484375, -0.00506591796875, -0.00083160400390625, -0.019775390625, -0.0107421875, 0.0092773437...

[ 43938, 84382, 10554, 162150, 154663, 2609, 18770, 51, 11728, 52895, 87235, 21, 3285, 159258, 1556, 142508, 357, 40899, 15363, 31, 11322, 79035, 127892, 7623, 39, 63306, 1687, 313, 34274, 89859, 6510, 420, 207487, 25632, 8010, 53370, 32354, 82...

[ 0.193115234375, 0.0849609375, 0.2353515625, 0.21240234375, 0.239013671875, 0.16455078125, 0.175537109375, 0.078125, 0.1875, 0.1885986328125, 0.174072265625, 0.07525634765625, 0.1494140625, 0.13671875, 0.0994873046875, 0.194580078125, 0.006927490234375, 0.1082763671875, 0.02210998...

embed

20941828_c0

20941828

haskell

0

Title: quickcheck test failing Problem title: quickcheck test failing Tags: quickcheck, haskell Problem: quickcheck test failing I have a simple function set of converse functions (simple shift codes): encode, decode :: Int -> String -> String and they test fine by some simple manual tests, but a quickCheck test report...

quickcheck test failing quickcheck test failing quickcheck haskell Data.Char Failed Falsifiable Main let2int int2let Char quickcheck test failing I have a simple function set of converse functions (simple shift codes): and they test fine by some simple manual tests, but a quickCheck test reports a failure: But running ...

[ 0.00616455078125, 0.005615234375, 0.0184326171875, 0.01806640625, -0.01129150390625, -0.01312255859375, -0.000530242919921875, -0.01708984375, -0.006805419921875, 0.04541015625, 0.0032806396484375, -0.0093994140625, 0.013427734375, 0.000560760498046875, -0.021240234375, 0.01123046875, ...

[ 63773, 78292, 3034, 35782, 1556, 142508, 11809, 84068, 190355, 22225, 27430, 12321, 2633, 4288, 304, 1974, 21656, 8781, 32354, 5423, 158, 37676, 191560, 122925, 18151, 5885, 23009, 109921, 202567, 117729, 137578, 51042, 5701, 3535, 43240, 15400, ...

[ 0.1243896484375, 0.2474365234375, 0.171875, 0.185546875, 0.051055908203125, 0.16845703125, 0.0266265869140625, 0.1390380859375, 0.12109375, 0.049407958984375, 0.03839111328125, 0.0118408203125, 0.07086181640625, 0.0545654296875, 0.0256805419921875, 0.132568359375, 0.1209716796875, ...

embed

37040814_c0

37040814

haskell

0

Title: Why Haskell takes one argument Problem title: Why Haskell takes one argument Tags: currying, haskell Problem: Why Haskell takes one argument I'm trying to figure out the cause and effect logics behind "Currying" and comes to the following results： Multiple arguments function can be expressed as either tuple(comb...

Why Haskell takes one argument Why Haskell takes one argument currying haskell Why Haskell Why Haskell takes one argument I'm trying to figure out the cause and effect logics behind "Currying" and comes to the following results： Multiple arguments function can be expressed as either tuple(combining multiple arguments w...

[ 0.0164794921875, -0.00653076171875, 0.01129150390625, 0.008056640625, 0.01043701171875, 0.0108642578125, -0.0002079010009765625, 0.0029754638671875, 0.007537841796875, -0.0284423828125, 0.00634765625, -0.041748046875, -0.01177978515625, 0.010498046875, -0.017578125, -0.01080322265625, ...

[ 44084, 20625, 142508, 51776, 1632, 10750, 198555, 214, 1556, 26366, 22304, 21543, 62775, 50155, 33177, 56216, 19335, 8705, 32354, 36510, 370, 277, 964, 48716, 52895, 5303, 5701, 10644, 756, 831, 237, 11001, 23, 4734, 29479, 155937, 345, 17065...

[ 0.0904541015625, 0.1395263671875, 0.2440185546875, 0.1248779296875, 0.2037353515625, 0.26611328125, 0.221435546875, 0.137451171875, 0.1082763671875, 0.0096435546875, 0.042724609375, 0.0743408203125, 0.138671875, 0.061126708984375, 0.0843505859375, 0.1490478515625, 0.1165771484375, ...

embed

27696465_c0

27696465

haskell

0

Title: How is FRP handled in terms of memory? Problem title: How is FRP handled in terms of memory? Tags: frp, haskell, memory-management Problem: How is FRP handled in terms of memory? Reading about FRP ( Functional Reactive Programming ) I'm amazed about how intuitive and logical it seems compared to the standard imp...

How is FRP handled in terms of memory? How is FRP handled in terms of memory? frp haskell memory-management How FRP How is FRP handled in terms of memory? Reading about FRP ( Functional Reactive Programming ) I'm amazed about how intuitive and logical it seems compared to the standard imperative approach; one thing how...

[ 0.00341796875, 0.02001953125, 0.0017242431640625, 0.0162353515625, 0.000255584716796875, 0.01220703125, 0.02001953125, 0.00677490234375, 0.0157470703125, -0.032470703125, 0.00897216796875, 0.010009765625, 0.01513671875, 0.032470703125, 0.0042724609375, 0.004364013671875, 0.0079956054...

[ 11249, 563, 38796, 34831, 71, 69407, 98323, 14119, 254, 1556, 142508, 87140, 83, 111, 28670, 10763, 853, 71232, 27958, 100270, 62775, 37202, 5570, 222530, 51515, 104192, 22027, 18, 13909, 109312, 11675, 1810, 20594, 23, 28484, 32692, 3166, 13...

[ 0.070068359375, 0.1304931640625, 0.291748046875, 0.175048828125, 0.1097412109375, 0.115478515625, 0.2100830078125, 0.135498046875, 0.176513671875, 0.0977783203125, 0.21337890625, 0.1405029296875, 0.0235443115234375, 0.01849365234375, 0.0654296875, 0.003509521484375, 0.0865478515625, ...

embed

41687700_c1

41687700

haskell

1

# LANGUAGE TemplateHaskell #-} {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE ViewPatterns #-} import Yesod import Network.Wai (pathInfo, rawPathInfo, requestMethod, responseLBS) import Data.Text (Text) import Text.Blaze (preEscapedText) import Control.Exception (IOException, try) import Control.Monad (when) data HelloWorl...

[ 0.0279541015625, 0.016357421875, -0.0040283203125, 0.00098419189453125, -0.00982666015625, 0.0020751953125, 0.00506591796875, -0.0208740234375, 0.0029754638671875, -0.05517578125, -0.000499725341796875, 0.004669189453125, -0.03515625, -0.0289306640625, 0.0106201171875, 0.00241088867187...

[ 98064, 196631, 6495, 7, 142508, 60457, 919, 1191, 29805, 8335, 3055, 24927, 32635, 2199, 28997, 22489, 14, 128405, 93147, 49649, 10519, 50336, 7352, 57553, 48097, 11809, 174379, 24129, 94901, 4692, 98224, 27131, 5, 63928, 17780, 9790, 46674, ...

[ 0.083251953125, 0.215576171875, 0.0911865234375, 0.039825439453125, 0.2333984375, 0.152099609375, 0.009063720703125, 0.08648681640625, 0.093994140625, 0.0615234375, 0.031219482421875, 0.135986328125, 0.1357421875, 0.2076416015625, 0.083251953125, 0.102294921875, 0.091796875, 0.0621...

embed

45069784_c1

45069784

haskell

1

::Text) 4 But when I try to typecheck the type definition that appears for somefunction "" ( (IsString t, AClass t) => AType t ) I get an ugly error from the type checker, even when I'm just copying the type I got from the typechecker! *Main> :t somefunction "" somefunction "" :: (IsString t, AClass t) => AType t *Main...

[ 0.01214599609375, -0.032958984375, -0.00016498565673828125, 0.0037384033203125, -0.0003261566162109375, -0.017578125, 0.0135498046875, 0.006378173828125, -0.00762939453125, -0.00127410888671875, -0.0022125244140625, -0.0184326171875, -0.00457763671875, -0.021484375, 0.0028533935546875, ...

[ 1984, 174379, 201, 4966, 9790, 10644, 78292, 80934, 135179, 3060, 137175, 29598, 71713, 214, 808, 62, 140803, 196707, 110608, 18499, 12765, 56, 43658, 4163, 168793, 18, 44, 10433, 71232, 16619, 191147, 14858, 84751, 284, 678, 8561, 2389, 3235...

[ 0.0257415771484375, 0.10675048828125, 0.0811767578125, 0.01824951171875, 0.05841064453125, 0.250244140625, 0.259521484375, 0.1920166015625, 0.0999755859375, 0.13134765625, 0.214599609375, 0.0771484375, 0.1402587890625, 0.05908203125, 0.1168212890625, 0.0931396484375, 0.1949462890625,...

embed

6945288_c0

6945288

haskell

0

Title: Lock-free programming in Haskell Problem title: Lock-free programming in Haskell Tags: haskell, lock-free Problem: Lock-free programming in Haskell Does anyone know if it is possible to do lock-free programming in Haskell? I'm interested both in the question of whether the appropriate low-level primitives are av...

Lock-free programming in Haskell Lock-free programming in Haskell haskell lock-free Lock-free Haskell Lock-free programming in Haskell Does anyone know if it is possible to do lock-free programming in Haskell? I'm interested both in the question of whether the appropriate low-level primitives are available, and (if the...

[ 0.00335693359375, 0.03125, 0.015625, -0.0198974609375, 0.00958251953125, -0.0019683837890625, -0.0093994140625, -0.01019287109375, -0.01019287109375, -0.029052734375, -0.0081787109375, -0.031494140625, 0.00732421875, 0.014892578125, -0.0038909912109375, 0.019287109375, 0.004119873046...

[ 80002, 32087, 56037, 449, 23, 20625, 142508, 1556, 56776, 35672, 3714, 2174, 7722, 54, 9, 60892, 95307, 27226, 67919, 128489, 90, 19882, 4677, 43240, 17368, 45367, 150679, 57965, 76519, 123309, 43701, 28219, 27131, 163812, 127008, 86723, 88303,...

[ 0.189697265625, 0.2220458984375, 0.2081298828125, 0.0889892578125, 0.08050537109375, 0.1343994140625, 0.2430419921875, 0.10595703125, 0.19091796875, 0.01934814453125, 0.07171630859375, 0.01776123046875, 0.1339111328125, 0.045684814453125, 0.04779052734375, 0.029998779296875, 0.070861...

embed

56607901_c0

56607901

haskell

0

Title: How to extract Values from Sqllite in Yesod persistant Problem title: How to extract Values from Sqllite in Yesod persistant Tags: haskell, yesod Problem: How to extract Values from Sqllite in Yesod persistant I am using Yesod for the first time, I tried out the scaffolded website ,with some minor changes I was ...

How to extract Values from Sqllite in Yesod persistant How to extract Values from Sqllite in Yesod persistant haskell yesod Sqllite How Values Yesod SELECT WHERE PersistText google-uid:11111111111 User Text UniqueUser Typeable Couldn EntityField Maybe UserId How to extract Values from Sqllite in Yesod persistant I am u...

[ 0.0091552734375, 0.014892578125, 0.00016498565673828125, -0.00213623046875, -0.00836181640625, 0.0223388671875, -0.014892578125, -0.00067901611328125, 0.0002918243408203125, -0.041015625, 0.01495361328125, -0.0274658203125, -0.0272216796875, -0.0263671875, -0.0025482177734375, -0.01495...

[ 11249, 125663, 190060, 7, 1295, 159, 99247, 27287, 32635, 2199, 70560, 1236, 47, 23, 1556, 142508, 2422, 23722, 6755, 144832, 841, 30096, 57309, 271, 174379, 26484, 34, 532, 97024, 159019, 53400, 24129, 11789, 1062, 2189, 60457, 2886, 191147,...

[ 0.044036865234375, 0.2276611328125, 0.2490234375, 0.0982666015625, 0.126220703125, 0.0810546875, 0.1954345703125, 0.300537109375, 0.1751708984375, 0.2493896484375, 0.1875, 0.135986328125, 0.00677490234375, 0.027130126953125, 0.0958251953125, 0.1881103515625, 0.108154296875, 0.17272...

embed

59093287_c0

59093287

haskell

0

Title: Equations for `someFunction' have different numbers of arguments Problem title: Equations for `someFunction' have different numbers of arguments Tags: haskell Problem: Equations for `someFunction' have different numbers of arguments I'm using in order to practice/learn Haskell. I'm having trouble under...

Equations for `someFunction' have different numbers of arguments Equations for `someFunction' have different numbers of arguments haskell Data.List System.IO Equations Codewars.Kata.Negative Num Codewars Kata Negative.hs:4:1 Negative.hs:4:1-22 Negative.hs:5:1-41 Equations for `someFunction' have different num...

[ 0.0194091796875, -0.01214599609375, -0.035888671875, -0.020263671875, 0.006866455078125, 0.0120849609375, 0.00101470947265625, 0.0009002685546875, 0.0086669921875, 0.01324462890625, -0.0230712890625, -0.05224609375, 0.00592041015625, 0.01409912109375, -0.0059814453125, -0.0027160644531...

[ 241, 13722, 5256, 100, 43452, 97249, 10763, 3768, 765, 12921, 101935, 10750, 1556, 142508, 11809, 154663, 12353, 17780, 28864, 4205, 7, 79940, 11, 6433, 208, 4935, 52782, 15267, 221717, 127, 617, 19721, 31043, 758, 179437, 418, 41361, 20625, ...

[ 0.05426025390625, 0.25244140625, 0.08447265625, 0.07196044921875, 0.107666015625, 0.1865234375, 0.111083984375, 0.09503173828125, 0.08660888671875, 0.1982421875, 0.1826171875, 0.277099609375, 0.1082763671875, 0.19873046875, 0.004425048828125, 0.0706787109375, 0.0194244384765625, 0....

embed

16353066_c0

16353066

haskell

0

Title: How are functors in Haskell and OCaml similar? Problem title: How are functors in Haskell and OCaml similar? Tags: ocaml, haskell Problem: How are functors in Haskell and OCaml similar? I've been toying around in a Haskell for the past year or so and I'm actually starting to 'get' it, up until Monads, Lenses, Ty...

How are functors in Haskell and OCaml similar? How are functors in Haskell and OCaml similar? ocaml haskell How Haskell OCaml How are functors in Haskell and OCaml similar? I've been toying around in a Haskell for the past year or so and I'm actually starting to 'get' it, up until Monads, Lenses, Type Families, ... the...

[ 0.01275634765625, 0.00994873046875, 0.00885009765625, -0.004669189453125, 0.01556396484375, -0.00160980224609375, -0.01007080078125, -0.01239013671875, -0.005889892578125, -0.016357421875, -0.0091552734375, -0.00909423828125, -0.0142822265625, -0.01287841796875, -0.005218505859375, -0....

[ 11249, 621, 7477, 18770, 7, 20625, 142508, 136, 180, 105272, 141, 21373, 23, 36, 9779, 1556, 2809, 47, 38543, 10932, 11015, 6602, 20653, 72134, 3794, 24189, 60331, 6468, 339, 47754, 60457, 24641, 5915, 1672, 31358, 47506, 20288, 10176, 9856...

[ 0.1160888671875, 0.04119873046875, 0.2301025390625, 0.253173828125, 0.06439208984375, 0.13720703125, 0.247802734375, 0.0816650390625, 0.13232421875, 0.194091796875, 0.1629638671875, 0.17919921875, 0.061279296875, 0.0767822265625, 0.1392822265625, 0.11962890625, 0.00048828125, 0.056...

embed

40497229_c1

40497229

haskell

1

changes from "foo" to "bar" , then we need to change that string in the DOM. However, changing ms1_text should never cause the sibling or parent nodes to be redrawn. How should I structure my code? Is this even possible, given the getLatestState api as a building block? Am I entirely missing the point of Reflex by try...

[ -0.005645751953125, -0.01446533203125, -0.007415771484375, -0.00131988525390625, 0.00616455078125, 0.020263671875, -0.00836181640625, -0.004852294921875, 0.012451171875, -0.0008697509765625, 0.000152587890625, 0.0054931640625, -0.00543212890625, 0.005828857421875, 0.012451171875, 0.001...

[ 65572, 1295, 3584, 31, 47, 1299, 15549, 79315, 69285, 151134, 68163, 418, 22829, 8306, 78, 79298, 49129, 110, 988, 456, 86905, 11249, 45646, 18151, 7722, 2046, 2729, 6954, 135206, 31470, 33976, 46389, 132283, 6275, 179043, 45367, 5773, 11001,...

[ 0.2198486328125, 0.056732177734375, 0.193359375, 0.212158203125, 0.072265625, 0.23388671875, 0.19970703125, 0.1673583984375, 0.169189453125, 0.1732177734375, 0.0833740234375, 0.09173583984375, 0.197509765625, 0.056732177734375, 0.066162109375, 0.1265869140625, 0.0880126953125, 0.13...

embed

1956518_c1

1956518

haskell

1

Seed seed val' = even seed' put (Random seed' val') return val' updateSeed seed = let (a,b,m) = (1664525, 1013904223, 2^32) in (a*seed + c) `mod` m And finally: getNRandSt n = replicateM n nextVal getNRand :: Int -> Seed -> [Bool] getNRand n seed = evalState (getNRandStates n) (Random seed True) Ok, this works fine and...

[ -0.0205078125, 0.0142822265625, 0.00787353515625, -0.005615234375, 0.0108642578125, 0.018798828125, 0.006317138671875, -0.029541015625, 0.00494384765625, -0.006195068359375, 0.00933837890625, 0.0263671875, -0.0167236328125, 0.0242919921875, 0.00909423828125, -0.00116729736328125, -0....

[ 503, 297, 40, 3502, 25, 3853, 3884, 126525, 3815, 30646, 28350, 4233, 2633, 39, 23175, 191802, 2588, 21027, 150197, 13023, 3742, 91887, 184, 997, 13415, 347, 2046, 2940, 37455, 653, 143126, 67, 594, 11737, 42272, 12647, 929, 28, 1405, 135...

[ 0.1611328125, 0.196533203125, 0.16259765625, 0.209228515625, 0.013641357421875, 0.1214599609375, 0.15087890625, 0.059051513671875, 0.11474609375, 0.124267578125, 0.1231689453125, 0.063232421875, 0.04669189453125, 0.082275390625, 0.058563232421875, 0.07421875, 0.1241455078125, 0.003...

embed

19573212_c0

19573212

haskell

0

Title: How can i separate tuples in Haskell? Problem title: How can i separate tuples in Haskell? Tags: list, haskell Problem: How can i separate tuples in Haskell? How can i merge a list of tuples without repeating any items in those tuples ? for example : from the list [("a","b"),("c,"d"),("a","b)], it should return ...

How can i separate tuples in Haskell? How can i separate tuples in Haskell? list haskell a How Haskell Possible P.hs:9:1 Probable XNoMonomorphismRestriction Note GHC.Real.Ratio Defined GHC.Real GHC.Classes How can i separate tuples in Haskell? How can i merge a list of tuples without repeating any items in those tuples...

[ -0.0034027099609375, 0.01300048828125, 0.0093994140625, 0.00347900390625, -0.0020751953125, -0.01007080078125, 0.0011444091796875, -0.0052490234375, 0.0089111328125, -0.00140380859375, -0.0145263671875, -0.00299072265625, 0.0277099609375, 0.00982666015625, -0.01043701171875, -0.0004158...

[ 11249, 831, 17, 84797, 370, 99726, 20625, 142508, 23, 5303, 1556, 10, 115861, 127, 1126, 19721, 1250, 275, 1193, 5021, 46674, 178851, 7655, 18622, 73265, 68996, 28645, 140803, 42564, 15490, 119140, 55769, 1295, 30646, 11, 238, 71, 18499, 26...

[ 0.034637451171875, 0.0352783203125, 0.03863525390625, 0.2325439453125, 0.1546630859375, 0.244384765625, 0.146728515625, 0.2353515625, 0.015167236328125, 0.1319580078125, 0.12646484375, 0.04315185546875, 0.0740966796875, 0.035675048828125, 0.0899658203125, 0.0714111328125, 0.071166992...

embed

62763711_c0

62763711

haskell

0

Title: possible solution that dealing with result end up with "(RealFrac a,Integral a)=>a" Problem title: possible solution that dealing with result end up with "(RealFrac a,Integral a)=>a" Tags: haskell Problem: possible solution that dealing with result end up with "(RealFrac a,Integral a)=>...

possible solution that dealing with result end up with "(RealFrac a,Integral a)=>a" possible solution that dealing with result end up with "(RealFrac a,Integral a)=>a" haskell a being RealFrac Integral Ambiguous Show Probable These Either Defined Data.Either Ordering GHC.Show Integer GHCi poss...

[ 0.000804901123046875, -0.008056640625, 0.003631591796875, -0.008544921875, 0.0224609375, -0.005126953125, -0.017822265625, 0.0019683837890625, -0.000865936279296875, -0.0087890625, 0.006439208984375, -0.0302734375, 0.021484375, 0.00872802734375, 0.01031494140625, -0.00469970703125, 0...

[ 7722, 29806, 184017, 678, 16750, 3564, 1257, 68996, 919, 20251, 10, 4, 67, 5739, 5386, 11, 450, 1369, 41502, 1556, 142508, 8035, 5120, 204681, 10250, 12282, 10821, 17367, 1250, 275, 2886, 32255, 9319, 5983, 11809, 14, 81206, 527, 73265, 1...

[ 0.1737060546875, 0.18505859375, 0.13232421875, 0.07354736328125, 0.244140625, 0.13818359375, 0.0848388671875, 0.21484375, 0.0885009765625, 0.2025146484375, 0.1304931640625, 0.0147552490234375, 0.11279296875, 0.105712890625, 0.1053466796875, 0.141845703125, 0.00360107421875, 0.00555...

embed

1418967_c0

1418967

haskell

0

Title: How to work with assertEqual with parameterized types Problem title: How to work with assertEqual with parameterized types Tags: haskell, hunit, testing Problem: How to work with assertEqual with parameterized types I'm trying to do the exercises in Real World Haskell in a TDD fashion, using HUnit . As you proba...

How to work with assertEqual with parameterized types How to work with assertEqual with parameterized types haskell hunit testing List Test.HUnit How List_Test.hs:6:27-58 List_Test TestCase Nil Cons Show How to work with assertEqual with parameterized types I'm trying to do the exercises in Real World Haskell in a TDD ...

[ -0.00885009765625, 0.005584716796875, -0.01708984375, 0.011962890625, -0.017822265625, -0.01080322265625, 0.00014209747314453125, -0.000835418701171875, -0.0120849609375, 0.02783203125, 0.0050048828125, -0.029541015625, 0.005767822265625, 0.0130615234375, -0.010009765625, -0.0220947265...

[ 11249, 4488, 678, 237, 33657, 647, 71723, 171859, 29367, 52895, 1556, 142508, 1926, 217, 134234, 32036, 8647, 27204, 6773, 111337, 127, 910, 27592, 10057, 441, 77175, 39215, 81979, 5120, 6661, 20625, 24057, 54543, 22438, 103608, 18499, 31380, ...

[ 0.01715087890625, 0.115234375, 0.088623046875, 0.07537841796875, 0.2386474609375, 0.035919189453125, 0.1966552734375, 0.20751953125, 0.0997314453125, 0.204345703125, 0.0938720703125, 0.1800537109375, 0.1265869140625, 0.129150390625, 0.13427734375, 0.166259765625, 0.1260986328125, 0...

embed

16898616_c0

16898616

haskell

0

Title: Haskell Linear-Time Online Algorithm Problem title: Haskell Linear-Time Online Algorithm Tags: haskell, algorithm, text-compression Problem: Haskell Linear-Time Online Algorithm Please forgive me if I misused the big words in the title; I'm not too knowledgeable about them but hope they describe my problem. I wr...

Haskell Linear-Time Online Algorithm Haskell Linear-Time Online Algorithm haskell algorithm text-compression Haskell Linear-Time Online Algorithm z:zs Haskell Linear-Time Online Algorithm Please forgive me if I misused the big words in the title; I'm not too knowledgeable about them but hope they describe my problem. I...

[ 0.01507568359375, -0.004425048828125, -0.00010395050048828125, 0.00640869140625, -0.0235595703125, -0.0081787109375, 0.0234375, -0.0128173828125, 0.0018768310546875, -0.00787353515625, 0.005889892578125, 0.0096435546875, 0.0169677734375, -0.0057373046875, -0.01544189453125, 0.020629882...

[ 20625, 142508, 16777, 147, 70059, 2823, 109847, 2783, 1556, 234873, 7986, 277, 48448, 97, 12, 169, 18337, 100, 96259, 1239, 33740, 6957, 34153, 44759, 51359, 15673, 98363, 2967, 54397, 121151, 150370, 9790, 136, 22, 40899, 79315, 59499, 6097,...

[ 0.14501953125, 0.2342529296875, 0.126708984375, 0.027801513671875, 0.1719970703125, 0.191650390625, 0.128173828125, 0.110595703125, 0.1456298828125, 0.1988525390625, 0.132568359375, 0.0892333984375, 0.1708984375, 0.0899658203125, 0.0269012451171875, 0.07269287109375, 0.03231811523437...

embed

7457090_c1

7457090

haskell

1

junction (TT_Boolean "f") (TT_Boolean "f") = TT_Boolean "f" This compiles and runs exactly like I expect it. The problem is, that I plan on implementing about 20 different TruthTypes, and many more functions for each one. So it makes more sense to group my functions based on which TruthType constructor they are acting ...

[ 0.001922607421875, -0.008056640625, -0.00634765625, 0.013671875, -0.0030670166015625, -0.00555419921875, 0.003814697265625, -0.00567626953125, 0.0150146484375, 0.01226806640625, -0.0111083984375, 0.01080322265625, 0.0128173828125, -0.0189208984375, -0.01300048828125, 0.015869140625, ...

[ 27022, 10763, 13739, 12647, 31, 34677, 420, 2203, 62497, 3293, 9969, 1340, 136, 127877, 66161, 1884, 87, 41206, 2967, 1774, 98, 29479, 1672, 387, 12921, 184431, 196707, 5941, 1286, 32354, 7, 10422, 21115, 759, 35509, 64549, 748, 1030, 54799...

[ 0.249267578125, 0.2120361328125, 0.1986083984375, 0.072021484375, 0.114013671875, 0.1915283203125, 0.15576171875, 0.0278167724609375, 0.224365234375, 0.052337646484375, 0.1514892578125, 0.1055908203125, 0.0670166015625, 0.1148681640625, 0.0970458984375, 0.0999755859375, 0.00964355468...

embed

42189666_c1

42189666

haskell

1

kind ‘[Symbol]’ with ‘*’ When matching the kind of ‘proxy’ • In the second argument of ‘formURL’, namely ‘p’ In the expression: formURL c p In an equation for ‘url’: url = formURL c p • Relevant bindings include p :: proxy s (bound at app/Main.hs:36:18) redirectPrompt :: OAuthClient -> proxy s -> IO (OAuthCode s) (bou...

[ 0.00159454345703125, 0.0228271484375, -0.00537109375, -0.01031494140625, -0.01531982421875, -0.0106201171875, 0.0024871826171875, 0.0260009765625, -0.0089111328125, -0.00811767578125, 0.021240234375, -0.05322265625, 0.00885009765625, -0.0101318359375, 0.003265380859375, -0.000564575195...

[ 8562, 65183, 36846, 678, 1639, 14858, 214, 64101, 53, 17932, 10750, 5037, 95538, 254, 125195, 3173, 501, 915, 5490, 25002, 133, 128239, 502, 50878, 91, 99091, 4027, 168793, 32944, 24033, 456, 80581, 2676, 180, 67362, 927, 150, 17780, 34, ...

[ 0.257568359375, 0.1593017578125, 0.2454833984375, 0.0906982421875, 0.17626953125, 0.2030029296875, 0.06085205078125, 0.2181396484375, 0.16015625, 0.1314697265625, 0.2392578125, 0.19287109375, 0.2470703125, 0.133544921875, 0.1817626953125, 0.2216796875, 0.0243682861328125, 0.1568603...

embed

42440396_c0

42440396

haskell

0

Title: How to prevent allocations in unrollable code? Problem title: How to prevent allocations in unrollable code? Tags: haskell Problem: How to prevent allocations in unrollable code? Given the following pieces of (boiled down and pseudo Haskell-ish) code: import qualified Data.Vector.Unboxed as V minimum3 :: Double ...

How to prevent allocations in unrollable code? How to prevent allocations in unrollable code? haskell qualified How Data.Vector.Unboxed minimum3 Double readMinimum3 V.Vector V.unsafeRead median15 How to prevent allocations in unrollable code? Given the following pieces of (boiled down and pseudo Haskell-ish) code: mini...

[ 0.000911712646484375, 0.01068115234375, 0.0166015625, -0.0118408203125, -0.005401611328125, -0.0045166015625, 0.0040283203125, -0.02978515625, 0.0016021728515625, -0.02783203125, -0.020751953125, -0.00775146484375, 0.0213623046875, -0.0008697509765625, 0.00738525390625, 0.0015716552734...

[ 11249, 56282, 144, 87632, 51, 27722, 2886, 18151, 47, 7, 23, 1556, 142508, 217225, 11809, 26455, 18770, 14256, 11728, 15440, 363, 107172, 12301, 114986, 24105, 310, 309, 115840, 31345, 2450, 1837, 126371, 7565, 74189, 20625, 9157, 73, 167785,...

[ 0.0635986328125, 0.25927734375, 0.1612548828125, 0.240234375, 0.1104736328125, 0.190673828125, 0.175048828125, 0.195556640625, 0.031524658203125, 0.05267333984375, 0.040618896484375, 0.10595703125, 0.2174072265625, 0.1304931640625, 0.08935546875, 0.1099853515625, 0.099853515625, 0....

embed

58974359_c1

58974359

haskell

1

anywhere.) (I parse the input into a bunch of two-element vectors that indicate the step to take for each instruction. That code works fine, and quickly.) import qualified Data.Set as S import Linear (V2(..)) import Control.Monad.State.Strict import Control.Monad.Extra (concatMapM) type Coord = V2 Integer -- x, y, wit...

[ -0.014404296875, 0.0087890625, 0.004302978515625, 0.00347900390625, -0.00970458984375, 0.0155029296875, -0.0037078857421875, -0.00933837890625, -0.0025482177734375, -0.04443359375, 0.0120849609375, 0.048095703125, 0.002349853515625, 0.014404296875, -0.018310546875, 0.001434326171875, ...

[ 151107, 5, 16, 568, 366, 184, 107730, 3934, 147306, 6626, 62766, 22834, 22230, 117414, 29954, 5646, 12638, 6, 188336, 18151, 43240, 5885, 69405, 24927, 217225, 11809, 294, 126, 237, 159, 16777, 147, 856, 304, 27131, 46674, 712, 135206, 6223...

[ 0.26904296875, 0.059234619140625, 0.05035400390625, 0.026336669921875, 0.1494140625, 0.0716552734375, 0.19482421875, 0.072265625, 0.043548583984375, 0.046051025390625, 0.141357421875, 0.1641845703125, 0.0997314453125, 0.0758056640625, 0.1531982421875, 0.048126220703125, 0.0888671875,...

embed

3524485_c1

3524485

haskell

1

<- eval env p case v1 of ValInt x -> if x /= 0 then eval env t else eval env f _ -> throwError "First arg of If must be an int" eval env (Let x e1 e2) = do v1 <- eval env e1 eval ((x, v1):env) e2 eval env (LetRec bs e) = do env' <- evalBinds eval env' e where evalBinds = mfix $ \env' -> do env'' <- mapM (\(x, e') -> e...

[ -0.020263671875, 0.002166748046875, 0.01055908203125, -0.00775146484375, 0.0242919921875, 0.015380859375, -0.00604248046875, -0.01611328125, 0.01239013671875, -0.014404296875, -0.01007080078125, 0.017578125, 0.01177978515625, 0.00543212890625, 0.0390625, -0.0048828125, -0.01635742187...

[ 28, 1405, 22, 334, 915, 7225, 81, 418, 4769, 4153, 18, 1022, 2174, 248, 1369, 757, 808, 1238, 104250, 18468, 31611, 207263, 79459, 111, 4263, 8110, 186, 23, 124480, 10461, 54, 17727, 33, 4332, 238, 7250, 7, 55923, 22288, 594, 30646, 3...

[ 0.0830078125, 0.25634765625, 0.1419677734375, 0.2384033203125, 0.0943603515625, 0.08197021484375, 0.142822265625, 0.033782958984375, 0.1473388671875, 0.090087890625, 0.09185791015625, 0.052459716796875, 0.10205078125, 0.0224761962890625, 0.015655517578125, 0.13818359375, 0.0414733886...

embed

42562695_c0

42562695

haskell

0

Title: Why is this pattern irrefulable? Problem title: Why is this pattern irrefulable? Tags: pattern-matching, haskell, functional-programming Problem: Why is this pattern irrefulable? I'm new to Haskell and trying to create a function that evaluates an arithmetic expression: data Expr = Number Rational | Variable Str...

Why is this pattern irrefulable? Why is this pattern irrefulable? pattern-matching haskell functional-programming Why Expr Number Rational Variable Plus Show Read main.hs:5:9-27 Irrefutable Main.Number Why is this pattern irrefulable? I'm new to Haskell and trying to create a function that evaluates an arithmetic expre...

[ -0.0196533203125, 0.0034637451171875, 0.0203857421875, 0.0194091796875, 0.01275634765625, 0.0284423828125, -0.0269775390625, -0.01025390625, 0.0118408203125, -0.00927734375, 0.013427734375, -0.01007080078125, 0.01416015625, 0.006805419921875, 0.01300048828125, -0.00104522705078125, 0...

[ 44084, 83, 903, 103510, 66617, 7844, 2886, 98753, 1556, 142508, 123309, 28966, 60075, 42, 103332, 2552, 43315, 84572, 8183, 17367, 4764, 5201, 127, 1126, 50994, 6921, 107, 3125, 22819, 12321, 18444, 26278, 3525, 20625, 28282, 32354, 151575, 8...

[ 0.1353759765625, 0.06475830078125, 0.10357666015625, 0.2333984375, 0.15380859375, 0.211669921875, 0.1737060546875, 0.1494140625, 0.090087890625, 0.214111328125, 0.0875244140625, 0.0452880859375, 0.0960693359375, 0.08843994140625, 0.142578125, 0.114501953125, 0.1016845703125, 0.1484...

embed

37243638_c0

37243638

haskell

0

Title: Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable Problem title: Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable Tags: vector, haskell Problem: Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable I want to create a list containing a random permutatio...

Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable Creating a random permutation of 1..N with Data.Vector.Unboxed.Mutable vector haskell qualified System.Random Creating Data.Vector.Unboxed.Mutable VUM.swap Data.Vector.Unboxed VUM VU.Vector VU.unsafeThaw VU.enumFromN VU.forM_ VU.fromList VUM.length ...

[ -0.007171630859375, 0.013427734375, 0.00335693359375, -0.0283203125, 0.00439453125, 0.01129150390625, -0.0201416015625, -0.033203125, -0.00982666015625, -0.04248046875, 0.01446533203125, 0.01141357421875, 0.012939453125, 0.018798828125, -0.007537841796875, 0.0093994140625, -0.0139770...

[ 56781, 1916, 96759, 117, 561, 22062, 615, 5, 839, 678, 11809, 26455, 18770, 14256, 11728, 10685, 22819, 173, 1556, 142508, 217225, 12353, 126525, 3815, 310, 11893, 634, 254, 120403, 309, 115840, 78122, 316, 168407, 2472, 161063, 154663, 23986...

[ 0.1407470703125, 0.0216217041015625, 0.1695556640625, 0.0966796875, 0.183837890625, 0.0784912109375, 0.1124267578125, 0.045257568359375, 0.1466064453125, 0.09033203125, 0.1236572265625, 0.211669921875, 0.193359375, 0.07745361328125, 0.1712646484375, 0.09613037109375, 0.1478271484375,...

embed

50214331_c0

50214331

haskell

0

Title: Yesod Network.Socket.bind permission denied (permission denied) Problem title: Yesod Network.Socket.bind permission denied (permission denied) Tags: yesod, haskell-stack, haskell Problem: Yesod Network.Socket.bind permission denied (permission denied) When trying to execute my project from stack I get this error...

Yesod Network.Socket.bind permission denied (permission denied) Yesod Network.Socket.bind permission denied (permission denied) yesod haskell-stack haskell InternalError Yesod Network.Socket.bind Permission May Error Network.Socket.connect Connection core-1.4.37.3-9gXfYzTigbs72LNNfHDGk9:Yesod.Core.Internal.Run Core Int...

[ -0.024658203125, 0.04296875, -0.00013065338134765625, -0.002044677734375, -0.006103515625, 0.00933837890625, -0.00994873046875, -0.003997802734375, -0.01171875, -0.033935546875, 0.009765625, -0.0166015625, 0.000759124755859375, 0.023193359375, -0.00933837890625, -0.00872802734375, -0...

[ 32635, 2199, 28997, 8912, 27853, 89817, 168081, 8, 93, 1264, 21150, 2422, 23722, 1556, 142508, 590, 2594, 106745, 18468, 908, 4347, 212059, 135457, 62448, 56458, 158406, 145515, 12825, 1126, 91480, 50886, 44851, 163321, 31365, 28398, 127, 10558...

[ 0.169921875, 0.243896484375, 0.14306640625, 0.0994873046875, 0.1402587890625, 0.224853515625, 0.2105712890625, 0.10028076171875, 0.1229248046875, 0.10357666015625, 0.1431884765625, 0.13720703125, 0.215087890625, 0.06927490234375, 0.166015625, 0.122314453125, 0.0970458984375, 0.1091...

embed

26756056_c0

26756056

haskell

0

Title: ghci cabal sandbox flags for Emacs Haskell inferior mode Problem title: ghci cabal sandbox flags for Emacs Haskell inferior mode Tags: ghci, emacs, haskell Problem: ghci cabal sandbox flags for Emacs Haskell inferior mode I would like GHCI to have the local cabal sandbox in scope when I work in emacs. From bash,...

ghci cabal sandbox flags for Emacs Haskell inferior mode ghci cabal sandbox flags for Emacs Haskell inferior mode ghci emacs haskell arguments Emacs Haskell packages.conf.d Custom e.g C-h ghci cabal sandbox flags for Emacs Haskell inferior mode I would like GHCI to have the local cabal sandbox in scope when I work in e...

[ 0.0018768310546875, -0.0225830078125, 0.00762939453125, 0.00653076171875, -0.0264892578125, 0.02294921875, 0.000020623207092285156, 0.02783203125, 0.004302978515625, 0.0025482177734375, 0.00830078125, -0.02197265625, -0.0213623046875, -0.0115966796875, 0.000637054443359375, 0.005584716...

[ 31380, 318, 109524, 19096, 11728, 49938, 85269, 4439, 20625, 142508, 44157, 13736, 352, 2263, 1556, 10750, 98169, 70547, 130664, 313, 9, 127, 1884, 41877, 17304, 765, 4000, 70820, 4488, 87109, 6002, 86531, 157, 65918, 29102, 48073, 408, 3571,...

[ 0.1322021484375, 0.1702880859375, 0.2626953125, 0.1568603515625, 0.18359375, 0.2415771484375, 0.1370849609375, 0.125, 0.121337890625, 0.2066650390625, 0.2476806640625, 0.135009765625, 0.06256103515625, 0.1263427734375, 0.103271484375, 0.1453857421875, 0.174072265625, 0.129760742187...

embed

19016756_c0

19016756

haskell

0

Title: Attoparsec `many` method not found Problem title: Attoparsec `many` method not found Tags: attoparsec, haskell Problem: Attoparsec `many` method not found I tried running the tests for Bryan O'Sullivan's Attoparsec-based HTTP parser ( http://www.serpentine.com/blog/2010/03/03/whats-in-a-parser-attoparsec-rewired...

Attoparsec `many` method not found Attoparsec `many` method not found attoparsec haskell Prelude Data.ByteString.Char8 Data.Attoparsec Attoparsec TestRFC2616.hs TestRFC2616.hs:13:30 Not Perhaps B.any GHCi www.haskell.org Loading many1 Attoparsec `many` method not found I tried running the tests for Bryan O'Sullivan's A...

[ -0.00193023681640625, 0.01806640625, -0.006195068359375, 0.017333984375, 0.00140380859375, 0.02392578125, 0.00494384765625, -0.02099609375, 0.0216064453125, -0.0380859375, -0.01446533203125, -0.043212890625, 0.00110626220703125, -0.0107421875, 0.0031280517578125, -0.019287109375, -0....

[ 9208, 31, 2500, 39797, 669, 53, 55300, 959, 14037, 243, 1556, 142508, 1914, 822, 11809, 75358, 67, 71713, 84068, 1019, 284, 10628, 8647, 54612, 4046, 2485, 127, 1197, 11205, 181799, 335, 4848, 527, 73265, 14, 10557, 1478, 228006, 5941, 41...

[ 0.198486328125, 0.16357421875, 0.1612548828125, 0.2215576171875, 0.2008056640625, 0.21337890625, 0.222412109375, 0.1143798828125, 0.1727294921875, 0.15966796875, 0.11767578125, 0.22998046875, 0.044921875, 0.1392822265625, 0.0858154296875, 0.031768798828125, 0.00189208984375, 0.0303...

embed

74739974_c1

74739974

haskell

1

+ -1 on 2-adics. Now, I'm interested in the hyper-operation sequence function, i.e.: hyp :: Int -> Adic -> Adic -> Adic hyp 0 a b = add a b hyp 1 a b = mul a b hyp 2 a b = exp a b hyp 3 a b = tet a b ... An efficient way to implement it is by generalizing the exponentiation by squaring algorithm, as follows: hyp :: In...

[ -0.0390625, 0.025634765625, 0.009521484375, 0.005157470703125, 0.003753662109375, -0.01531982421875, 0.00138092041015625, 0.002410888671875, 0.004302978515625, -0.01092529296875, -0.000278472900390625, 0.0093994140625, -0.010009765625, -0.00421142578125, -0.00897216796875, -0.029296875...

[ 997, 68940, 4720, 712, 28021, 60892, 59058, 21473, 1363, 40, 944, 3956, 32354, 2119, 254, 1984, 360, 18, 33079, 62, 18403, 757, 10, 876, 15190, 106, 16690, 14700, 138, 120, 93766, 3917, 29479, 4537, 78643, 21616, 94727, 214, 234873, 91, ...

[ 0.1834716796875, 0.2052001953125, 0.13720703125, 0.1214599609375, 0.1697998046875, 0.0721435546875, 0.18212890625, 0.1968994140625, 0.0286407470703125, 0.07293701171875, 0.1192626953125, 0.06097412109375, 0.15869140625, 0.201171875, 0.1971435546875, 0.04681396484375, 0.086669921875, ...

embed

33445898_c1

33445898

haskell

1

gives cannot satisfy -package-id attoparse... error. Resolving dependencies... Configuring aeson-0.10.0.0... Building aeson-0.10.0.0... Failed to install aeson-0.10.0.0 Build log ( /Users/smcho/.cabal/logs/aeson-0.10.0.0.log ): Configuring aeson-0.10.0.0... Building aeson-0.10.0.0... Preprocessing library aeson-0.10.0...

[ -0.0257568359375, -0.000789642333984375, 0.00093841552734375, 0.00213623046875, 0.0033721923828125, -0.00994873046875, -0.005218505859375, -0.00994873046875, -0.0012359619140625, 0.0272216796875, -0.004119873046875, -0.0103759765625, 0.009521484375, 0.019287109375, 0.00787353515625, -0...

[ 76199, 53418, 40407, 53, 20, 29102, 4588, 532, 243, 2146, 28004, 27, 18499, 132944, 42548, 117538, 59994, 10, 90, 191, 23320, 10179, 99929, 104919, 190355, 20600, 121137, 12684, 39, 3089, 408, 3571, 4867, 11, 1657, 1914, 63923, 35773, 1294,...

[ 0.1435546875, 0.1927490234375, 0.241943359375, 0.116455078125, 0.052093505859375, 0.1900634765625, 0.07843017578125, 0.13232421875, 0.17529296875, 0.1346435546875, 0.1754150390625, 0.02825927734375, 0.16943359375, 0.158203125, 0.1800537109375, 0.0771484375, 0.137451171875, 0.086914...

embed

7232375_c0

7232375

haskell

0

Title: couldn't match expected type (Int -> Int -> Int) with actual type `(t0, t1, t2)' Problem title: couldn't match expected type (Int -> Int -> Int) with actual type `(t0, t1, t2)' Tags: haskell, tuples, types Problem: couldn't match expected type (Int -> Int -> Int) with actual type ...

couldn't match expected type (Int -> Int -> Int) with actual type `(t0, t1, t2)' couldn't match expected type (Int -> Int -> Int) with actual type `(t0, t1, t2)' haskell tuples types Prelude orderList.hs:23:13 Couldn couldn't match expected type (Int -> Int -> Int) with actual type `(t0,...

[ 0.00634765625, 0.004669189453125, 0.0130615234375, -0.005523681640625, 0.005218505859375, 0.01324462890625, -0.0224609375, -0.00811767578125, 0.01116943359375, -0.00927734375, -0.001068115234375, -0.004547119140625, 0.0096435546875, -0.016845703125, -0.00093841552734375, -0.00093841552...

[ 69427, 3768, 18, 14858, 84751, 10644, 4153, 5386, 360, 678, 8561, 2389, 808, 418, 10461, 1556, 142508, 370, 99726, 52895, 1914, 822, 112, 12989, 154663, 127, 24864, 22618, 191147, 9842, 1679, 57143, 20625, 22, 33558, 19844, 41664, 179933, 1...

[ 0.1605224609375, 0.07403564453125, 0.1566162109375, 0.197265625, 0.1728515625, 0.1766357421875, 0.0799560546875, 0.088623046875, 0.1107177734375, 0.0765380859375, 0.1466064453125, 0.1378173828125, 0.051788330078125, 0.06414794921875, 0.1806640625, 0.1390380859375, 0.2509765625, 0.0...

embed

65903835_c0

65903835

haskell

0

Title: How to iterate through a list, element by element Problem title: How to iterate through a list, element by element Tags: haskell, pattern-matching, loops, list Problem: How to iterate through a list, element by element I have just started learning Haskell and I am trying to write some basic functions in order to...

How to iterate through a list, element by element How to iterate through a list, element by element haskell pattern-matching loops list How x:_ _:x How to iterate through a list, element by element I have just started learning Haskell and I am trying to write some basic functions in order to get a better understanding ...

[ -0.0126953125, -0.006683349609375, 0.01171875, 0.001007080078125, -0.00081634521484375, 0.0018463134765625, 0.01251220703125, 0.0022125244140625, 0.0166015625, -0.04638671875, 0.0322265625, -0.029296875, -0.000644683837890625, -0.0018463134765625, -0.00732421875, -0.01507568359375, 0...

[ 11249, 47, 17, 8560, 67, 8305, 10, 5303, 4, 12830, 390, 1556, 142508, 103510, 98753, 214, 40956, 1022, 12, 454, 101, 425, 52080, 20625, 33022, 62822, 32354, 11522, 100094, 46876, 3444, 51776, 136, 360, 18, 541, 10750, 30646, 99, 63262, ...

[ 0.10137939453125, 0.0498046875, 0.0831298828125, 0.2413330078125, 0.108154296875, 0.185791015625, 0.03167724609375, 0.2154541015625, 0.001129150390625, 0.2110595703125, 0.1439208984375, 0.14697265625, 0.215576171875, 0.1781005859375, 0.1881103515625, 0.039154052734375, 0.155639648437...

embed

22018670_c0

22018670

haskell

0

Title: After reading a file I have IO [Char], but I need [IO Char] Problem title: After reading a file I have IO [Char], but I need [IO Char] Tags: monads, haskell Problem: After reading a file I have IO [Char], but I need [IO Char] I have a file number.txt which contains a large number and I read it into an IO String ...

After reading a file I have IO [Char], but I need [IO Char] After reading a file I have IO [Char], but I need [IO Char] monads haskell Control.Monad Data.Char After Char number.txt Couldn Main After reading a file I have IO [Char], but I need [IO Char] I have a file number.txt which contains a large number and I read i...

[ -0.00836181640625, -0.01531982421875, 0.00506591796875, 0.007598876953125, 0.0037689208984375, 0.0216064453125, 0.009765625, -0.00732421875, 0.00341796875, -0.025634765625, 0.005218505859375, -0.039794921875, -0.01409912109375, 0.0260009765625, 0.01068115234375, -0.01336669921875, -0...

[ 24372, 16454, 11435, 87, 765, 17780, 84068, 1284, 3871, 378, 21656, 2667, 712, 7, 1556, 142508, 27131, 46674, 11809, 14012, 124326, 191147, 12321, 5, 70541, 21334, 12301, 3934, 23351, 214, 1884, 903, 15700, 32354, 3444, 28282, 5303, 111, 36...

[ 0.144775390625, 0.1964111328125, 0.1800537109375, 0.0260772705078125, 0.07476806640625, 0.24658203125, 0.227783203125, 0.088623046875, 0.171630859375, 0.002227783203125, 0.23583984375, 0.10284423828125, 0.145751953125, 0.0240936279296875, 0.1427001953125, 0.2396240234375, 0.204833984...

embed

74670390_c0

74670390

haskell

0

Title: Move and resize XMonad window - RationalRect call compiler error Problem title: Move and resize XMonad window - RationalRect call compiler error Tags: haskell, compiler-errors, xmonad Problem: Move and resize XMonad window - RationalRect call compiler error to send the focused window to the center of the screen ...

Move and resize XMonad window - RationalRect call compiler error Move and resize XMonad window - RationalRect call compiler error haskell compiler-errors xmonad Move XMonad RationalRect xK_space xK_0 xmonad.hs:87:58 Data Ratio Move and resize XMonad window - RationalRect call compiler error to send the focused window t...

[ -0.002197265625, 0.006683349609375, 0.004119873046875, -0.0016021728515625, 0.01446533203125, 0.028564453125, -0.007781982421875, -0.017333984375, -0.004791259765625, -0.0157470703125, 0.01080322265625, -0.01483154296875, 0.0162353515625, -0.00872802734375, 0.006011962890625, -0.003051...

[ 135828, 136, 456, 62539, 1193, 46674, 712, 76896, 2552, 43315, 1052, 24762, 11782, 9969, 34759, 18499, 1556, 142508, 188800, 1022, 3796, 605, 65421, 2389, 127, 19308, 33593, 11809, 5565, 25379, 162393, 27585, 49119, 180346, 87388, 47, 22799, ...

[ 0.1505126953125, 0.046966552734375, 0.0775146484375, 0.17529296875, 0.09149169921875, 0.143798828125, 0.143310546875, 0.17822265625, 0.126708984375, 0.1275634765625, 0.1424560546875, 0.172607421875, 0.14306640625, 0.13037109375, 0.113525390625, 0.1463623046875, 0.046630859375, 0.16...

embed

65584927_c0

65584927

haskell

0

Title: Haskell: Find two related elements in a list Problem title: Haskell: Find two related elements in a list Tags: haskell, list Problem: Haskell: Find two related elements in a list I am new to Haskell/FP. I want to solve this task: This list is given: [1721, 979, 366, 299, 675, 1456] Find the two elements that sum...

Haskell: Find two related elements in a list Haskell: Find two related elements in a list haskell list Haskell Find Haskell: Find two related elements in a list I am new to Haskell/FP. I want to solve this task: This list is given: [1721, 979, 366, 299, 675, 1456] Find the two elements that sum to 2020 and multiply the...

[ -0.019775390625, -0.006500244140625, -0.0069580078125, 0.023193359375, -0.00113677978515625, 0.03173828125, -0.0174560546875, 0.01300048828125, 0.0177001953125, -0.0235595703125, 0.0107421875, -0.01275634765625, 0.0035400390625, 0.0048828125, -0.026611328125, -0.000492095947265625, 0...

[ 20625, 142508, 26040, 6626, 62548, 80854, 23, 5303, 12, 10, 1556, 3525, 51006, 3444, 86869, 66211, 34475, 2489, 3117, 199439, 110144, 122418, 158045, 616, 13683, 450, 10554, 47, 11075, 136, 6024, 62479, 2856, 29806, 729, 661, 5351, 72977, 4...

[ 0.17822265625, 0.284423828125, 0.173828125, 0.234375, 0.282958984375, 0.2490234375, 0.09368896484375, 0.226318359375, 0.005889892578125, 0.015899658203125, 0.1517333984375, 0.032958984375, 0.1407470703125, 0.003753662109375, 0.1201171875, 0.1109619140625, 0.043121337890625, 0.14086...

embed

21265454_c0

21265454

haskell

0

Title: subsequences of length n from list performance Problem title: subsequences of length n from list performance Tags: performance, haskell Problem: subsequences of length n from list performance I implemented a version of this answer https://stackoverflow.com/a/9920425/1261166 (I don't know what was intended by the...

subsequences of length n from list performance subsequences of length n from list performance performance haskell list n-1 COST CENTRE MODULE Main sublistofsize.sublistsThatDontStartWithX sublistofsize.sublistsThatStartWithX subsequences of length n from list performance I implemented a version of this answer https://s...

[ -0.0020751953125, 0.01544189453125, 0.0198974609375, -0.001495361328125, -0.00799560546875, -0.01348876953125, -0.0026702880859375, 0.0027313232421875, 0.01434326171875, -0.0223388671875, 0.018798828125, 0.003448486328125, 0.0218505859375, 0.00982666015625, -0.01806640625, 0.0067138671...

[ 1614, 184, 26513, 140909, 653, 1295, 5303, 23718, 1556, 142508, 5759, 313, 34274, 89859, 98610, 12321, 150, 36834, 62539, 22144, 6562, 115743, 60728, 18, 126597, 194583, 1542, 29479, 11389, 51646, 7, 2203, 22288, 12, 19, 110218, 1022, 425, ...

[ 0.2152099609375, 0.135498046875, 0.165283203125, 0.1522216796875, 0.1207275390625, 0.121337890625, 0.181884765625, 0.205810546875, 0.09765625, 0.196533203125, 0.07421875, 0.04534912109375, 0.1260986328125, 0.0693359375, 0.0517578125, 0.00238037109375, 0.10693359375, 0.056640625, ...

embed

71370866_c2

71370866

haskell

2

Configuring library for text-short-0.1.5.. Preprocessing library for text-short-0.1.5.. Building library for text-short-0.1.5.. [1 of 5] Compiling PrimOps ( src-ghc804/PrimOps.hs, dist/build/PrimOps.o, dist/build/PrimOps.dyn_o ) [2 of 5] Compiling Data.Text.Short.Internal ( src/Data/Text/Short/Internal.hs, dist/build/...

[ -0.00016498565673828125, 0.00555419921875, 0.00653076171875, -0.000015497207641601562, 0.00168609619140625, -0.03515625, -0.0045166015625, 0.0213623046875, -0.00011920928955078125, 0.044921875, -0.0074462890625, -0.01806640625, 0.0016326904296875, 0.00185394287109375, 0.01397705078125, ...

[ 1657, 59994, 214, 35773, 1294, 100, 7986, 9, 186500, 102014, 45955, 5, 1914, 63923, 104919, 111, 190, 15612, 49725, 44506, 39029, 7, 19437, 9486, 4836, 77212, 145111, 127, 45, 271, 177149, 31, 17872, 11809, 174379, 115729, 44851, 137989, 28...

[ 0.06903076171875, 0.2161865234375, 0.0457763671875, 0.2359619140625, 0.154541015625, 0.0302734375, 0.2364501953125, 0.049560546875, 0.29345703125, 0.150146484375, 0.1942138671875, 0.027252197265625, 0.140869140625, 0.1595458984375, 0.159912109375, 0.00921630859375, 0.04498291015625, ...

embed

32121241_c1

32121241

haskell

1

= [[x,y,z] | x<-[0.. isqrt n], y<- [0.. isqrt (n - x^2)], z<-[max 0 (isqrt ((n-x^2 -y^2) `div` 3))], x^2 +y^2 + z^2 ==n] latticePoints :: Int -> [[Int]] latticePoints n = [ zipWith (*) [x1,x2,x3] y | [x1,x2,x3] <- (latticePointsWithoutNegatives n), y <- [[a,b,c] | a <- (if x1 == 0 then [0] else [-1,1]), b<-(if x2 == 0...

[ -0.023681640625, -0.00567626953125, -0.01068115234375, 0.0027923583984375, -0.007537841796875, -0.00982666015625, 0.006683349609375, -0.0091552734375, 0.01409912109375, -0.0296630859375, 0.01446533203125, -0.0301513671875, 0.0150146484375, -0.0145263671875, -0.027099609375, 0.009155273...

[ 2203, 425, 53, 169, 58745, 1022, 16093, 2389, 83, 864, 3198, 653, 113, 9, 10461, 97, 24084, 757, 304, 30618, 8439, 997, 69112, 10495, 24494, 147534, 1984, 360, 18, 68330, 194583, 2335, 6056, 6433, 208, 42991, 3190, 876, 501, 363, 53234,...

[ 0.10394287109375, 0.01373291015625, 0.032745361328125, 0.10687255859375, 0.0076904296875, 0.046630859375, 0.043243408203125, 0.05242919921875, 0.005828857421875, 0.04412841796875, 0.135009765625, 0.01556396484375, 0.058807373046875, 0.00543212890625, 0.066162109375, 0.08154296875, 0....

embed

15588173_c0

15588173

haskell

0

Title: Could someone de-sugar this monad transform snippet? Problem title: Could someone de-sugar this monad transform snippet? Tags: monad-transformers, haskell Problem: Could someone de-sugar this monad transform snippet? Written in this handy do-notation, this seems pretty clear to me. But I can't seem to get the de...

Could someone de-sugar this monad transform snippet? Could someone de-sugar this monad transform snippet? monad-transformers haskell Could stack1 StateT Identity runstack1 stack3 runStack3 Could someone de-sugar this monad transform snippet? Written in this handy do-notation, this seems pretty clear to me. But I can't ...

[ -0.0130615234375, 0.01904296875, 0.0047607421875, 0.004180908203125, 0.0179443359375, 0.00579833984375, -0.001556396484375, -0.0166015625, 0.004791259765625, -0.00750732421875, 0.02392578125, 0.01336669921875, -0.01226806640625, 0.01007080078125, 0.004669189453125, 0.00075531005859375,...

[ 191147, 22008, 8, 1159, 1970, 903, 2667, 712, 27198, 93, 58134, 9, 215175, 1314, 1556, 142508, 177261, 418, 22836, 618, 71257, 2481, 11675, 590, 2594, 363, 42378, 91, 128538, 3535, 54, 157, 22062, 37202, 34735, 831, 48903, 7, 16565, 2822,...

[ 0.1314697265625, 0.0703125, 0.237060546875, 0.1732177734375, 0.2147216796875, 0.114501953125, 0.14013671875, 0.1910400390625, 0.2493896484375, 0.1248779296875, 0.1236572265625, 0.023162841796875, 0.2061767578125, 0.046142578125, 0.10302734375, 0.1998291015625, 0.1820068359375, 0.10...

embed

18060029_c0

18060029

haskell

0

Title: Suppress certain Haskell Alex/Happy compilation messages Problem title: Suppress certain Haskell Alex/Happy compilation messages Tags: parser-generator, haskell, happy, alex Problem: Suppress certain Haskell Alex/Happy compilation messages When creating either a Lexer.x or a Parser.y parser using the Alex lexer ...

Suppress certain Haskell Alex/Happy compilation messages Suppress certain Haskell Alex/Happy compilation messages parser-generator haskell happy alex Suppress Haskell Alex Happy Lexer.x Parser.y Lexer line-map.c Compiling Lexer.hs Lexer.o Parser Parser.hs Parser.o LINE Suppress certain Haskell Alex/Happy compilation me...

[ -0.0079345703125, 0.01019287109375, 0.0167236328125, -0.004852294921875, -0.022216796875, 0.01385498046875, 0.00439453125, 0.0037384033203125, -0.0035400390625, -0.0027313232421875, -0.0250244140625, -0.002410888671875, 0.0164794921875, 0.0007171630859375, 0.015869140625, 0.01080322265...

[ 47004, 11856, 24233, 20625, 142508, 20984, 64, 184870, 98352, 89914, 366, 2189, 48281, 1556, 17723, 662, 425, 32506, 99078, 56, 2392, 53, 13315, 62346, 15612, 127, 31, 130028, 105233, 95, 34058, 145823, 9969, 49725, 102158, 36746, 114977, 139...

[ 0.13134765625, 0.1422119140625, 0.09912109375, 0.1126708984375, 0.2073974609375, 0.188720703125, 0.00848388671875, 0.193359375, 0.1976318359375, 0.16455078125, 0.10675048828125, 0.1177978515625, 0.09228515625, 0.056793212890625, 0.1265869140625, 0.006256103515625, 0.0797119140625, ...

embed

41735956_c0

41735956

haskell

0

Title: Performance of pattern matching in GHC Problem title: Performance of pattern matching in GHC Tags: ghc, pattern-matching, haskell Problem: Performance of pattern matching in GHC I'm writing an "append" function for a data type I've created (which basically deals with "streams"). However, this data type has 12 di...

Performance of pattern matching in GHC Performance of pattern matching in GHC ghc pattern-matching haskell Performance GHC Performance of pattern matching in GHC I'm writing an "append" function for a data type I've created (which basically deals with "streams"). However, this data type has 12 different constructors, d...

[ -0.006378173828125, 0.01470947265625, 0.01507568359375, -0.0048828125, 0.01220703125, -0.0213623046875, -0.028564453125, -0.0050048828125, 0.0169677734375, -0.0191650390625, 0.0198974609375, -0.026611328125, 0.00750732421875, -0.000148773193359375, -0.001983642578125, -0.00049591064453...

[ 94030, 103510, 14858, 214, 527, 73265, 111, 23, 31380, 238, 98753, 1556, 142508, 32562, 9007, 3611, 32354, 2053, 10644, 75935, 198343, 8, 16765, 86429, 427, 12921, 64549, 184017, 52895, 54241, 56574, 188347, 140909, 77336, 21771, 114689, 62775,...

[ 0.2054443359375, 0.2318115234375, 0.238037109375, 0.08001708984375, 0.1318359375, 0.230224609375, 0.059722900390625, 0.078857421875, 0.1190185546875, 0.1357421875, 0.2236328125, 0.1083984375, 0.2099609375, 0.0711669921875, 0.098876953125, 0.1458740234375, 0.1263427734375, 0.1010742...

embed

68110623_c1

68110623

haskell

1

' = x == x' && y == y' _ == _ = False It does not typecheck (with ghc 8.6.5 ), the error is the following: [1 of 1] Compiling Main ( Main.hs, Main.o ) instance Eq a => Eq (Expr a b) where -- same implementation eval :: Expr a b -> a -- same implementation This approach does not seem scalable to me, once more constructo...

[ -0.00848388671875, -0.0037689208984375, 0.0155029296875, 0.00008058547973632812, 0.026123046875, 0.005584716796875, -0.005615234375, -0.003265380859375, 0.007110595703125, 0.00860595703125, -0.01495361328125, -0.01165771484375, 0.0162353515625, -0.007720947265625, -0.00897216796875, 0....

[ 2203, 1022, 69112, 619, 1230, 113, 101, 22225, 1650, 14602, 959, 10644, 78292, 31380, 238, 3217, 136473, 18499, 25632, 15612, 49725, 12321, 127, 5, 31, 110527, 241, 864, 19279, 10287, 10, 876, 4210, 5701, 208124, 28, 1405, 60075, 42, 5151...

[ 0.11181640625, 0.1151123046875, 0.227783203125, 0.029876708984375, 0.0897216796875, 0.153076171875, 0.0010986328125, 0.1053466796875, 0.0147552490234375, 0.013580322265625, 0.0826416015625, 0.2030029296875, 0.283935546875, 0.1324462890625, 0.1356201171875, 0.1163330078125, 0.21301269...

embed

33312250_c0

33312250

haskell

0

Title: "For all" statements in Haskell Problem title: "For all" statements in Haskell Tags: types, haskell, conditional-statements, type-conversion, if-statement Problem: "For all" statements in Haskell I'm building comfort going through some Haskell toy problems and I've written the following speck...

"For all" statements in Haskell "For all" statements in Haskell types haskell conditional-statements type-conversion if-statement Haskell "For all" statements in Haskell I'm building comfort going through some Haskell toy problems and I've written the following speck of code which successfully prefo...

[ 0.0079345703125, 0.006591796875, -0.002777099609375, 0.006866455078125, 0.0185546875, 0.0118408203125, 0.005615234375, -0.0072021484375, 0.0123291015625, 0.0025634765625, -0.00102996826171875, 0.004180908203125, 0.00994873046875, 0.007415771484375, -0.0296630859375, 0.007354736328125, ...

[ 18537, 756, 41502, 63805, 20625, 142508, 52895, 1556, 35431, 289, 61340, 10644, 46354, 2174, 47506, 72713, 44402, 25632, 48502, 18151, 65771, 5037, 41018, 3444, 32354, 64457, 128219, 12830, 5423, 118126, 60089, 106, 31358, 75447, 8337, 16750, 1...

[ 0.1773681640625, 0.234130859375, 0.0596923828125, 0.2025146484375, 0.137451171875, 0.221435546875, 0.1224365234375, 0.113525390625, 0.0867919921875, 0.002166748046875, 0.1260986328125, 0.1121826171875, 0.07470703125, 0.0484619140625, 0.1029052734375, 0.1103515625, 0.0477294921875, ...

embed

15400549_c0

15400549

haskell

0

Title: How can I fix the "Unacceptable result type in foreign declaration: CULong" error building gtk2hs packages? Problem title: How can I fix the "Unacceptable result type in foreign declaration: CULong" error building gtk2hs packages? Tags: haskell, gtk2hs Problem: How can I fix the "Unacceptable...

How can I fix the "Unacceptable result type in foreign declaration: CULong" error building gtk2hs packages? How can I fix the "Unacceptable result type in foreign declaration: CULong" error building gtk2hs packages? haskell gtk2hs ccall How Unacceptable CULong gtk2hs Compiling Graphics.Rendering.Pan...

[ 0.003204345703125, 0.0245361328125, 0.00982666015625, -0.00958251953125, 0.018310546875, -0.004669189453125, -0.017578125, -0.0216064453125, -0.0157470703125, -0.0128173828125, 0.015625, -0.0751953125, 0.002471923828125, -0.0157470703125, -0.0021514892578125, 0.00640869140625, -0.010...

[ 30022, 14256, 135372, 2661, 16750, 10644, 110613, 21635, 143255, 4021, 18499, 33976, 706, 31472, 304, 127, 7, 98169, 1556, 142508, 85763, 992, 15612, 189682, 27803, 196707, 63137, 43531, 31, 60457, 206, 25732, 1126, 19721, 8743, 22829, 3794, ...

[ 0.09527587890625, 0.07220458984375, 0.19091796875, 0.0887451171875, 0.15087890625, 0.16943359375, 0.174560546875, 0.16748046875, 0.034515380859375, 0.198974609375, 0.1585693359375, 0.1612548828125, 0.0178680419921875, 0.1611328125, 0.09710693359375, 0.122802734375, 0.02972412109375, ...

embed

25788202_c0

25788202

haskell

0

Title: Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? Problem title: Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? Tags: haskell Problem: Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? I have the following data type: data Suit = ...

Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? Is there a way to plus one to an Enum Bounded Ord type in a list in Haskell? haskell Enum Bounded Ord Haskell Suit Club Diamond Heart Spade Rank R10 Jack Queen King Ace Card suit::Suit rank::Rank Update Is there a way to plus one to an Enum Bo...

[ -0.01220703125, 0.00579833984375, 0.0152587890625, 0.0067138671875, 0.0047607421875, 0.01141357421875, -0.0031280517578125, -0.00921630859375, 0.02392578125, 0.0201416015625, 0.00701904296875, -0.0010986328125, 0.004241943359375, -0.002655029296875, -0.01422119140625, -0.026123046875, ...

[ 3917, 1001, 1632, 47, 357, 316, 335, 167457, 35379, 10644, 5303, 23, 20625, 142508, 1556, 1832, 7687, 69124, 60861, 10959, 112, 134405, 627, 963, 21763, 44109, 18813, 70280, 23660, 60813, 7143, 30648, 126525, 28641, 2685, 10, 2053, 156119, ...

[ 0.1009521484375, 0.231201171875, 0.1475830078125, 0.0810546875, 0.1236572265625, 0.1690673828125, 0.056121826171875, 0.1566162109375, 0.2127685546875, 0.16943359375, 0.215087890625, 0.035125732421875, 0.1357421875, 0.249755859375, 0.073486328125, 0.05389404296875, 0.16064453125, 0....

embed

53643823_c1

53643823

haskell

1

) -> IsJust m -> a justGetIt (Just y) ItIsJust = y print : RPS -> String print rps with (isItJust (print' rps)) | Yes itIs = justGetIt (print' rps) itIs | No itsNot = absurd $ itsNot $ print_exhaustive rps Now in my opinion this is fantastic. I am able to declare in exactly one place in my code what the correlation bet...

[ -0.018310546875, 0.0026092529296875, -0.011962890625, 0.018310546875, -0.0147705078125, 0.0257568359375, 0.01177978515625, -0.003326416015625, 0.006439208984375, 0.0033721923828125, 0.00469970703125, 0.0162353515625, -0.01507568359375, 0.00604248046875, -0.0068359375, 0.003250122070312...

[ 33079, 2071, 127794, 347, 1660, 724, 126, 23389, 113, 1650, 29598, 28412, 627, 9059, 23351, 214, 10681, 7, 678, 164, 35662, 25, 32635, 442, 438, 6863, 122116, 48152, 3650, 3355, 18391, 4935, 33153, 903, 83, 47823, 19048, 159978, 66161, 16...

[ 0.012451171875, 0.1256103515625, 0.2447509765625, 0.1241455078125, 0.119140625, 0.0902099609375, 0.08349609375, 0.1959228515625, 0.137939453125, 0.1668701171875, 0.20166015625, 0.1727294921875, 0.05096435546875, 0.189697265625, 0.1165771484375, 0.029876708984375, 0.15283203125, 0.0...

embed

21977487_c1

21977487

haskell

1

: maps f' xs So the idea is you have a function that takes and returns a state like (a -> s -> (b, s)) , but we modify it so that instead of returning an output/state tuple we return an output/X tuple, where X is the same type as our initial function. So its sort of like (a -> (b, a -> (b, ...))) . I was initially try...

[ -0.004638671875, 0.0093994140625, -0.001983642578125, -0.0191650390625, -0.01611328125, 0.006866455078125, 0.0040283203125, -0.01165771484375, 0.0216064453125, -0.01190185546875, 0.0155029296875, 0.0078125, 0.00115203857421875, 0.0269775390625, -0.000568389892578125, -0.0157470703125, ...

[ 152, 22288, 7, 1238, 25, 1022, 6528, 83, 765, 32354, 51776, 136, 30646, 11341, 1884, 11, 33079, 91, 275, 2811, 40383, 64457, 140992, 61340, 370, 8705, 1542, 1193, 5701, 10644, 2446, 61475, 6863, 31577, 102337, 40099, 22836, 2667, 712, 176...

[ 0.02032470703125, 0.1741943359375, 0.0614013671875, 0.0880126953125, 0.1099853515625, 0.1124267578125, 0.1173095703125, 0.005462646484375, 0.022369384765625, 0.187744140625, 0.1204833984375, 0.065185546875, 0.1824951171875, 0.1890869140625, 0.0814208984375, 0.06573486328125, 0.112548...

embed

58963601_c1

58963601

haskell

1

.toList nexs let xsHead = strangeHeadMay xs let nexsHead = strangeHeadMay nexs pure () headMay :: Foldable f => f a -> Maybe a headMay = foldr (const . Just) Nothing tailMay :: Foldable f => f a -> Maybe (f a) tailMay = foldr (seq . Just) Nothing The error is /home/brandon/workspace/foldNEmaybes.hs:34:18: error: • No i...

[ -0.02783203125, 0.0081787109375, 0.020751953125, -0.00909423828125, 0.003692626953125, 0.0322265625, 0.000766754150390625, -0.016845703125, 0.025634765625, -0.00506591796875, 0.00113677978515625, 0.0147705078125, 0.00872802734375, 0.00994873046875, 0.00836181640625, -0.0267333984375, ...

[ 5, 188, 154663, 108, 425, 7, 2633, 1022, 13025, 712, 114453, 82419, 34166, 10336, 30077, 71, 2886, 1238, 83425, 18344, 7569, 25553, 9563, 182747, 46741, 18499, 29552, 43264, 18244, 65421, 42822, 8015, 11354, 7438, 30197, 24033, 438, 110527, ...

[ 0.0228118896484375, 0.1724853515625, 0.258544921875, 0.143310546875, 0.210693359375, 0.11279296875, 0.202392578125, 0.09100341796875, 0.15869140625, 0.1649169921875, 0.161865234375, 0.286865234375, 0.140869140625, 0.1600341796875, 0.12939453125, 0.0660400390625, 0.1302490234375, 0....

embed

63371157_c0

63371157

haskell

0

Title: Haskell Average Function using Foldmap Problem title: Haskell Average Function using Foldmap Tags: haskell, arguments, average Problem: Haskell Average Function using Foldmap I am trying to write a definition "average" in haskell using the code below so that the function produces the average (mean) of all of the...

Haskell Average Function using Foldmap Haskell Average Function using Foldmap haskell arguments average Foldmap Haskell Average RunningTotal Sum Float Foldable Haskell Average Function using Foldmap I am trying to write a definition "average" in haskell using the code below so that the function produces the average (me...

[ 0.004425048828125, -0.0167236328125, 0.00897216796875, 0.00689697265625, -0.0205078125, 0.01226806640625, 0.01104736328125, 0.00787353515625, 0.00154876708984375, -0.017333984375, 0.006317138671875, -0.02978515625, -0.00130462646484375, 0.01123046875, 0.00194549560546875, 0.00689697265...

[ 20625, 142508, 40168, 29838, 28670, 17368, 30077, 62346, 71, 1556, 10750, 83080, 28398, 169473, 36335, 38699, 257, 2886, 31577, 33022, 80934, 8216, 18151, 35064, 32354, 27489, 282, 66, 756, 80854, 107730, 42486, 2060, 18499, 119140, 5701, 15044...

[ 0.09619140625, 0.2015380859375, 0.1890869140625, 0.2203369140625, 0.1424560546875, 0.029998779296875, 0.1405029296875, 0.2130126953125, 0.0196075439453125, 0.11083984375, 0.1982421875, 0.249755859375, 0.04705810546875, 0.075927734375, 0.1224365234375, 0.11962890625, 0.023941040039062...

embed

74587307_c1

74587307

haskell

1

://b.abc.com > ... my naive parser will return, http://b.abc.com which is incorrect. I want it to error (so later I can use <|> ) It's been a 3 days on this problem trying different approaches .. including just trying to find a parser to do what I wanted .. i.e. find the first thing (LINK) before you find the second th...

[ -0.0084228515625, 0.0137939453125, 0.005615234375, 0.0262451171875, -0.01055908203125, 0.03271484375, -0.0135498046875, 0.00006246566772460938, 0.003936767578125, -0.0186767578125, -0.026123046875, -0.000102996826171875, -0.0023040771484375, -0.0172119140625, 0.004547119140625, 0.00637...

[ 696, 275, 2055, 238, 277, 977, 153, 759, 24, 5844, 366, 2189, 1221, 30646, 1621, 83, 214552, 3444, 47, 18499, 14432, 4527, 4426, 58745, 2740, 2809, 138, 13312, 903, 2967, 31577, 12921, 51515, 7413, 54, 36663, 5117, 13580, 96787, 8108, 1...

[ 0.0919189453125, 0.095458984375, 0.1614990234375, 0.1572265625, 0.182861328125, 0.1864013671875, 0.050048828125, 0.04736328125, 0.1192626953125, 0.230224609375, 0.1988525390625, 0.2099609375, 0.05572509765625, 0.2015380859375, 0.137451171875, 0.0902099609375, 0.2041015625, 0.101562...

embed

35392658_c1

35392658

haskell

1

n x (i+1) v where h = v!i Most optimal solution that I've found constantly updates 2 arrays. One array being the main target, and other array being for fast index look ups. Better Java solution public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int k = input.nextI...

[ -0.03173828125, 0.0380859375, 0.004486083984375, -0.011962890625, -0.011962890625, 0.01068115234375, -0.018798828125, -0.000102996826171875, -0.007781982421875, -0.005889892578125, 0.0086669921875, 0.00726318359375, -0.01470947265625, 0.01129150390625, -0.01416015625, -0.0140380859375,...

[ 653, 1022, 14, 21748, 81, 7440, 1096, 2203, 38, 17006, 24087, 29806, 14037, 178308, 114419, 116, 10298, 4778, 6561, 8035, 5201, 30388, 4, 3789, 100, 4271, 63262, 6713, 1257, 7, 177154, 41925, 3835, 201939, 2292, 71, 132, 71713, 214, 1065,...

[ 0.1375732421875, 0.212646484375, 0.143798828125, 0.298583984375, 0.25732421875, 0.06390380859375, 0.193115234375, 0.0838623046875, 0.153076171875, 0.07745361328125, 0.2239990234375, 0.183837890625, 0.0635986328125, 0.2080078125, 0.2496337890625, 0.1370849609375, 0.181640625, 0.1383...

embed

26834510_c0

26834510

haskell

0

Title: Stack overflow in my recursive function Problem title: Stack overflow in my recursive function Tags: recursion, stack-overflow, haskell Problem: Stack overflow in my recursive function Code is here , when i call numberOf 3 or numberOf integer>2 im getting this error ERROR - C stack overflow . My code should chan...

Stack overflow in my recursive function Stack overflow in my recursive function recursion stack-overflow haskell Stack Integer Bool Stack overflow in my recursive function Code is here , when i call numberOf 3 or numberOf integer>2 im getting this error ERROR - C stack overflow . My code should change numbers between 2...

[ -0.0123291015625, -0.00115203857421875, -0.007293701171875, 0.007415771484375, 0.008056640625, 0.0196533203125, -0.01458740234375, 0.00836181640625, 0.016357421875, -0.0111083984375, -0.004058837890625, -0.021484375, 0.01806640625, 0.0059814453125, 0.0272216796875, -0.014404296875, 0...

[ 6512, 2594, 645, 118664, 23, 759, 195625, 5844, 32354, 1830, 177261, 5465, 1556, 142508, 44401, 2460, 929, 28864, 3688, 3229, 11782, 14012, 132887, 138, 707, 892, 1505, 2740, 304, 566, 903, 18499, 151206, 24638, 20, 313, 18151, 5608, 15549,...

[ 0.1640625, 0.1259765625, 0.1505126953125, 0.282958984375, 0.03326416015625, 0.0643310546875, 0.1983642578125, 0.1241455078125, 0.1495361328125, 0.0352783203125, 0.2156982421875, 0.11474609375, 0.0858154296875, 0.1937255859375, 0.14697265625, 0.0909423828125, 0.190673828125, 0.09368...

embed

209751_c0

209751

haskell

0

Title: Any Real-World Experience Using Software Transactional Memory? Problem title: Any Real-World Experience Using Software Transactional Memory? Tags: stm, clojure, haskell, language-agnostic, scala Problem: Any Real-World Experience Using Software Transactional Memory? It seems that there has been a recent rising i...

Any Real-World Experience Using Software Transactional Memory? Any Real-World Experience Using Software Transactional Memory? stm clojure haskell language-agnostic scala Any Real-World Experience Using Software Transactional Memory Any Real-World Experience Using Software Transactional Memory? It seems that there has b...

[ 0.006805419921875, 0.0142822265625, 0.0126953125, -0.0126953125, 0.0250244140625, -0.014404296875, 0.0103759765625, 0.03125, -0.0076904296875, -0.033447265625, -0.0023193359375, 0.0079345703125, -0.016845703125, 0.00360107421875, 0.00897216796875, 0.0172119140625, 0.01251220703125, ...

[ 28541, 5120, 70646, 135634, 345, 6953, 23752, 11062, 44713, 289, 172681, 6138, 39, 20450, 461, 107, 1556, 142508, 46876, 2895, 146232, 9588, 33946, 159, 10111, 155247, 124161, 98323, 170846, 111938, 51053, 40881, 208124, 4527, 66160, 13709, 144...

[ 0.0826416015625, 0.1756591796875, 0.173095703125, 0.226806640625, 0.119140625, 0.02581787109375, 0.2073974609375, 0.1651611328125, 0.1690673828125, 0.07421875, 0.244140625, 0.1383056640625, 0.1329345703125, 0.136962890625, 0.1844482421875, 0.186279296875, 0.10986328125, 0.236206054...

embed

7984755_c1

7984755

haskell

1

' searchWord subList = [def | x <- subList, (wrd x) == searchWord] --search' searchWord subList = [def x | x <- subList, (wrd x) == searchWord] --search' searchWord subList = [x->def | x <- subList, (x->wrd) == searchWord] search :: [Run] -> Word -> String search runList searchWord = search' searchWord $ runList!!wrdLe...

[ -0.0007171630859375, 0.002471923828125, 0.017578125, -0.000797271728515625, -0.013916015625, 0.00860595703125, 0.00167083740234375, 0.0038604736328125, 0.025390625, 0.0024566650390625, 0.0140380859375, -0.00177764892578125, -0.015869140625, 0.01556396484375, -0.0211181640625, 0.0018463...

[ 33938, 164805, 1614, 154663, 112, 1022, 5429, 86250, 425, 69112, 163321, 22543, 23351, 11675, 3650, 1146, 71, 866, 33, 148, 4216, 23986, 3871, 4358, 678, 25, 32354, 527, 73265, 14, 84751, 10644, 83, 21441, 8561, 357, 15123, 103607, 214, 1...

[ 0.29638671875, 0.226806640625, 0.2158203125, 0.20068359375, 0.016204833984375, 0.08428955078125, 0.03460693359375, 0.2191162109375, 0.0491943359375, 0.1041259765625, 0.16650390625, 0.20947265625, 0.138427734375, 0.114013671875, 0.0228271484375, 0.0706787109375, 0.03411865234375, 0....

embed

13102034_c0

13102034

haskell

0

Title: The last statement in a 'do' construct must be an expression : is there any indentation error Problem title: The last statement in a 'do' construct must be an expression : is there any indentation error Tags: haskell Problem: The last statement in a 'do' construct must be an expression : is t...

The last statement in a 'do' construct must be an expression : is there any indentation error The last statement in a 'do' construct must be an expression : is there any indentation error haskell Data.ByteString Data.ByteString.Internal Data.Bits B.pack B.length Prelude.rem Just top4 B.index bottom4...

[ 0.002227783203125, 0.0001621246337890625, -0.0048828125, 0.0078125, -0.004638671875, 0.0234375, -0.02001953125, -0.00009775161743164062, 0.00970458984375, 0.002532958984375, 0.003936767578125, -0.03173828125, -0.003631591796875, -0.001068115234375, -0.00701904296875, 0.01251220703125, ...

[ 4568, 63805, 3768, 246, 64549, 8110, 186, 125195, 83, 2685, 2499, 18597, 22062, 18499, 23, 1556, 142508, 11809, 75358, 71713, 44851, 335, 29102, 23986, 1914, 822, 7328, 9563, 2663, 617, 4711, 103136, 3137, 96760, 134165, 47416, 1019, 434, 9...

[ 0.2235107421875, 0.21044921875, 0.07489013671875, 0.2060546875, 0.2418212890625, 0.1131591796875, 0.0220947265625, 0.22119140625, 0.040008544921875, 0.0904541015625, 0.1038818359375, 0.1875, 0.1407470703125, 0.1907958984375, 0.013427734375, 0.0819091796875, 0.2125244140625, 0.02870...

embed

23810809_c1

23810809

haskell

1

True else False isnumber :: String -> Bool isnumber (h:t) = if (h>='0' && h<='9') then isnumber t else False paranthesis :: String -> Int -> Bool paranthesis [] a = if (a==0) then True else False paranthesis (h:t) a = if (h=='(') then (paranthesis t (a+1)) else (if (h==')') then paranthesis t (a-1) else paranthesis t ...

[ -0.01348876953125, -0.01483154296875, -0.0010833740234375, 0.043212890625, 0, 0.01068115234375, 0.00457763671875, 0.00799560546875, -0.00775146484375, 0.006988525390625, -0.00032806396484375, -0.03564453125, -0.0067138671875, -0.00185394287109375, -0.01385498046875, 0.006256103515625, ...

[ 87599, 37076, 22225, 184, 83, 2606, 1297, 1984, 23351, 214, 33079, 2460, 929, 127, 12, 18, 2203, 2174, 2389, 619, 1096, 1126, 808, 121, 19, 2347, 6023, 360, 10, 11, 69112, 77495, 96899, 21748, 3190, 7068, 110218, 757, 31192, 12271, 6029...

[ 0.21337890625, 0.2459716796875, 0.211669921875, 0.1195068359375, 0.1875, 0.2437744140625, 0.197021484375, 0.05963134765625, 0.1939697265625, 0.1142578125, 0.046875, 0.1365966796875, 0.20654296875, 0.1475830078125, 0.10687255859375, 0.1558837890625, 0.01153564453125, 0.095458984375,...

embed

25251282_c0

25251282

haskell

0

Title: Core dump upon invoking newForeignPtr Problem title: Core dump upon invoking newForeignPtr Tags: ffi, garbage-collection, ghc, haskell, memory-management Problem: Core dump upon invoking newForeignPtr The following program : {-# LANGUAGE ForeignFunctionInterface #-} module Main where import qualified Data.Vector...

Core dump upon invoking newForeignPtr Core dump upon invoking newForeignPtr ffi garbage-collection ghc haskell memory-management qualified Data.Vector.Storable.Internal Foreign.ForeignPtr Foreign.Marshal.Alloc Core LANGUAGE ForeignFunctionInterface Main Data.Vector.Storable S.unsafeToForeignPtr S.fromList Error test2 A...

[ 0.00946044921875, 0.029296875, -0.0107421875, 0.0062255859375, -0.0023193359375, 0.00174713134765625, -0.0115966796875, -0.00112152099609375, -0.020263671875, -0.032958984375, 0.0191650390625, -0.0150146484375, 0.00555419921875, 0.0172119140625, -0.003692626953125, -0.00775146484375, ...

[ 31365, 115, 2676, 54799, 23253, 3525, 18537, 38529, 683, 4448, 24500, 3671, 402, 429, 196352, 31380, 238, 1556, 142508, 98323, 87140, 217225, 11809, 26455, 18770, 2886, 184293, 4200, 6652, 98064, 97249, 44851, 12321, 159, 115840, 161063, 154663...

[ 0.205810546875, 0.1839599609375, 0.200439453125, 0.050567626953125, 0.1202392578125, 0.121337890625, 0.122802734375, 0.1524658203125, 0.05487060546875, 0.1666259765625, 0.10614013671875, 0.05865478515625, 0.13037109375, 0.0411376953125, 0.117431640625, 0.0955810546875, 0.088684082031...

embed

41429680_c0

41429680

haskell

0

Title: Workflow for using stack to test Hackage packages (not in Stackage) Problem title: Workflow for using stack to test Hackage packages (not in Stackage) Tags: haskell, haskell-stack Problem: Workflow for using stack to test Hackage packages (not in Stackage) What is the workflow for using stack to preform an isola...

Workflow for using stack to test Hackage packages (not in Stackage) Workflow for using stack to test Hackage packages (not in Stackage) haskell haskell-stack stack Workflow Hackage Stackage Then PKG Workflow for using stack to test Hackage packages (not in Stackage) What is the workflow for using stack to preform an is...

[ -0.0126953125, 0.00921630859375, -0.0054931640625, -0.0035400390625, -0.00970458984375, 0.001129150390625, -0.0146484375, -0.00958251953125, 0.0032501220703125, 0.000583648681640625, -0.0078125, -0.00860595703125, -0.0036468505859375, 0.00494384765625, -0.005523681640625, -0.0028839111...

[ 27985, 118664, 17368, 177261, 3034, 52922, 4588, 98169, 10869, 6512, 11387, 429, 47, 1556, 142508, 590, 2594, 436, 45214, 4488, 479, 5037, 54015, 7026, 20600, 134234, 28007, 20625, 959, 129980, 50339, 18499, 88996, 43581, 1528, 51529, 24927, ...

[ 0.0997314453125, 0.241455078125, 0.0955810546875, 0.2352294921875, 0.1903076171875, 0.1798095703125, 0.1427001953125, 0.1845703125, 0.047271728515625, 0.1121826171875, 0.1417236328125, 0.1068115234375, 0.006439208984375, 0.07659912109375, 0.214599609375, 0.066650390625, 0.07391357421...

embed

44336324_c0

44336324

haskell

0

Title: Haskell Non-exhaustive patterns in function error in Maybe? Problem title: Haskell Non-exhaustive patterns in function error in Maybe? Tags: option-type, haskell, design-patterns Problem: Haskell Non-exhaustive patterns in function error in Maybe? I am writing a function that takes a list of Dates and evaluates ...

Haskell Non-exhaustive patterns in function error in Maybe? Haskell Non-exhaustive patterns in function error in Maybe? option-type haskell design-patterns Haskell Non-exhaustive Maybe Date Show isOlder2 Bool Just Nothing Haskell Non-exhaustive patterns in function error in Maybe? I am writing a function that takes a l...

[ -0.01055908203125, 0.013671875, 0.01025390625, 0.005706787109375, 0.0089111328125, 0.0244140625, -0.0140380859375, -0.020751953125, -0.00179290771484375, 0.00555419921875, 0.007080078125, -0.0004100799560546875, 0.019775390625, -0.01092529296875, -0.000629425048828125, -0.0032806396484...

[ 20625, 142508, 3775, 3355, 18391, 4935, 103510, 32354, 18499, 83425, 23, 35829, 50986, 1556, 4331, 4453, 22766, 25512, 17367, 83, 31178, 304, 2460, 929, 9563, 182747, 32562, 51776, 5303, 151575, 4153, 360, 18, 4263, 201505, 47, 104, 10332, ...

[ 0.1295166015625, 0.2232666015625, 0.1810302734375, 0.050811767578125, 0.1651611328125, 0.0849609375, 0.24853515625, 0.1690673828125, 0.209228515625, 0.321533203125, 0.0447998046875, 0.1490478515625, 0.0833740234375, 0.1312255859375, 0.1383056640625, 0.10064697265625, 0.0831298828125,...

embed

11690146_c0

11690146

haskell

0

Title: Why does GHC consider the LHS *syntactically* when inlining? Problem title: Why does GHC consider the LHS *syntactically* when inlining? Tags: optimization, haskell, ghc Problem: Why does GHC consider the LHS *syntactically* when inlining? According to the GHC docs : ...GHC will only inline the function if it is...

Why does GHC consider the LHS *syntactically* when inlining? Why does GHC consider the LHS *syntactically* when inlining? optimization haskell ghc Why GHC LHS comp1 INLINE comp2 Why does GHC consider the LHS *syntactically* when inlining? According to the GHC docs : Where the example given is two semantically-equivalen...

[ 0.0034637451171875, -0.00144195556640625, 0.0169677734375, 0.01361083984375, 0.0003147125244140625, 0.0272216796875, -0.005126953125, -0.0015411376953125, 0.00726318359375, -0.00090789794921875, 0.0279541015625, -0.009521484375, -0.001708984375, -0.00125885009765625, 0.004913330078125, ...

[ 44084, 527, 73265, 16916, 339, 38131, 12654, 18, 47013, 71407, 23, 150, 592, 87235, 1556, 142508, 31380, 238, 9969, 418, 5881, 57339, 304, 27781, 85540, 80934, 58827, 1510, 81113, 123166, 6002, 102, 21455, 68416, 294, 2256, 110, 27198, 3235...

[ 0.053985595703125, 0.0841064453125, 0.1832275390625, 0.0882568359375, 0.06561279296875, 0.1695556640625, 0.113525390625, 0.09320068359375, 0.1236572265625, 0.057373046875, 0.1158447265625, 0.154052734375, 0.0780029296875, 0.1383056640625, 0.0816650390625, 0.186767578125, 0.0641479492...

embed

25432290_c1

25432290

haskell

1

ums which I call Muls . class Muls a b c | a b -> c instance '[] '[] '[] instance (Num n, Mul a b c, Muls as bs cs) => Muls (Dim.Dimensional v a n ': as) (Dim.Dimensional v b n ': bs) (Dim.Dimensional v c n ': cs) !*! :: (Muls as bs cs) => F as -> F bs -> F cs (F a) !*! (F b) = F (a ++ "*" ++ b) I got an Illegal Instan...

[ -0.005218505859375, -0.0128173828125, 0.0118408203125, -0.011962890625, -0.0196533203125, 0.0177001953125, -0.000640869140625, -0.031494140625, 0.00927734375, -0.01239013671875, -0.003753662109375, -0.0098876953125, 0.01611328125, -0.00811767578125, -0.0179443359375, -0.00537109375, ...

[ 286, 7, 3129, 87, 11782, 21442, 18507, 10, 876, 501, 6, 33079, 110527, 268, 316, 653, 237, 20763, 16, 464, 39330, 30283, 81, 15, 242, 12, 711, 1639, 38, 50657, 44357, 563, 919, 2203, 11, 37223, 58, 891, 86966, 360, 116071, 21635, 13...

[ 0.1109619140625, 0.1942138671875, 0.0248260498046875, 0.011566162109375, 0.07958984375, 0.27001953125, 0.1546630859375, 0.0416259765625, 0.10601806640625, 0.0819091796875, 0.01080322265625, 0.10528564453125, 0.2188720703125, 0.011199951171875, 0.08282470703125, 0.06488037109375, 0.12...

embed

50738164_c0

50738164

haskell

0

Title: Pattern synonyms deriving read? Problem title: Pattern synonyms deriving read? Tags: haskell, pattern-synonyms Problem: Pattern synonyms deriving read? Pattern synonyms provide a shorthand way to express a value; also they can provide an abstract name to avoid a client module breaking into the data decl. Here's ...

Pattern synonyms deriving read? Pattern synonyms deriving read? haskell pattern-synonyms Pattern MyNum MkNum Zero Read Pattern synonyms deriving read? Pattern synonyms provide a shorthand way to express a value; also they can provide an abstract name to avoid a client module breaking into the data decl. Here's a not ve...

[ -0.00860595703125, 0.0059814453125, -0.000568389892578125, 0.021240234375, 0.00408935546875, 0.01397705078125, 0.0198974609375, -0.01385498046875, -0.00830078125, -0.0213623046875, 0.010986328125, -0.020263671875, 0.0106201171875, -0.017822265625, 0.0147705078125, -0.004150390625, -0...

[ 9876, 22766, 164661, 7, 16406, 6496, 12301, 32, 1556, 142508, 103510, 12654, 45757, 2646, 839, 316, 276, 92, 83947, 4764, 22691, 16610, 12336, 3917, 47, 36510, 34292, 831, 164789, 9351, 71864, 23282, 88996, 116987, 2053, 8, 34937, 959, 8023...

[ 0.1871337890625, 0.177490234375, 0.225830078125, 0.05828857421875, 0.1260986328125, 0.0697021484375, 0.231689453125, 0.004302978515625, 0.09490966796875, 0.1829833984375, 0.226806640625, 0.039459228515625, 0.1358642578125, 0.13330078125, 0.1082763671875, 0.153076171875, 0.00677490234...

embed

42474546_c0

42474546

haskell

0

Title: Couldn't match type IO with Map and couldn't match type Map with [Char] Problem title: Couldn't match type IO with Map and couldn't match type Map with [Char] Tags: types, haskell Problem: Couldn't match type IO with Map and couldn't match type Map with [Char] I am new to Haskell and the foll...

Couldn't match type IO with Map and couldn't match type Map with [Char] Couldn't match type IO with Map and couldn't match type Map with [Char] types haskell Control.Monad Control.Applicative System.IO qualified Data.Maybe Couldn Map Char Data.Map Map.Map Map.empty Map.insert n-1 Couldn't match type...

[ -0.01055908203125, -0.002899169921875, -0.0027618408203125, 0.00909423828125, -0.0244140625, 0.0021820068359375, -0.006500244140625, -0.004791259765625, -0.004058837890625, -0.026611328125, 0.0108642578125, -0.0380859375, 0.019775390625, 0.00799560546875, 0.00811767578125, 0.0151977539...

[ 191147, 3768, 18, 14858, 10644, 17780, 678, 42719, 69427, 84068, 52895, 1556, 142508, 27131, 46674, 712, 11048, 12353, 217225, 11809, 21656, 166179, 33548, 33657, 5759, 3525, 47, 20625, 25632, 18151, 6626, 18499, 5117, 13315, 2046, 93232, 5, ...

[ 0.131103515625, 0.0736083984375, 0.1124267578125, 0.2308349609375, 0.19970703125, 0.229248046875, 0.1058349609375, 0.2239990234375, 0.088134765625, 0.187744140625, 0.1597900390625, 0.10595703125, 0.227783203125, 0.1707763671875, 0.045806884765625, 0.004669189453125, 0.029525756835937...

embed

49561881_c0

49561881

haskell

0

Title: Haskell: memoization of recursion Problem title: Haskell: memoization of recursion Tags: memoization, haskell Problem: Haskell: memoization of recursion if I have the following function: go xxs t i | t == 0 = 1 | t < 0 = 0 | i < 0 = 0 | t < (xxs !! i) = go xxs t (i-1) | otherwise = go xxs (t - (xxs !! i)) (i-1) ...

Haskell: memoization of recursion Haskell: memoization of recursion memoization haskell Haskell i-1 Haskell: memoization of recursion if I have the following function: what is the best way to memoize the results? I can't seem to get my head how to store a dynamic set of tuples and update and return the value at the sam...

[ -0.0081787109375, 0.00927734375, 0.013916015625, -0.013916015625, 0.0084228515625, -0.012451171875, 0.00799560546875, 0.021484375, 0.0211181640625, -0.004638671875, 0.02001953125, -0.0166015625, 0.003448486328125, -0.00909423828125, 0.01507568359375, 0.021484375, 0.009033203125, -0...

[ 20625, 142508, 163, 432, 47691, 111, 195625, 1830, 12, 1556, 17, 5759, 2174, 25632, 32354, 2367, 2965, 3917, 47, 20650, 50339, 831, 48903, 10336, 4343, 84079, 5423, 370, 99726, 136, 28350, 30646, 34292, 5701, 183234, 31577, 17198, 50828, 19...

[ 0.1484375, 0.2293701171875, 0.168701171875, 0.1939697265625, 0.1505126953125, 0.07183837890625, 0.2406005859375, 0.110107421875, 0.0154266357421875, 0.146728515625, 0.0423583984375, 0.0806884765625, 0.00823974609375, 0.06396484375, 0.1729736328125, 0.0120849609375, 0.1441650390625, ...

embed

5926169_c0

5926169

haskell

0

Title: How do I convert the first 32 bits of the fractional part of a Float into a Word32? Problem title: How do I convert the first 32 bits of the fractional part of a Float into a Word32? Tags: haskell, sha, sha256, floating-point Problem: How do I convert the first 32 bits of the fractional part of a Float into a Wo...

How do I convert the first 32 bits of the fractional part of a Float into a Word32? How do I convert the first 32 bits of the fractional part of a Float into a Word32? haskell sha sha256 floating-point How Float Word32 Note All Initialize sha256 How do I convert the first 32 bits of the fractional part of a Float into ...

[ -0.0022735595703125, 0.0016632080078125, 0.0037994384765625, -0.0028228759765625, -0.005645751953125, 0.01080322265625, -0.00830078125, -0.007415771484375, 0.00154876708984375, 0.01019287109375, -0.000579833984375, 0.0303955078125, -0.00384521484375, 0.0166015625, -0.004364013671875, 0...

[ 11249, 54, 87, 96760, 5117, 2789, 4785, 175921, 289, 2831, 38699, 257, 3934, 10, 22543, 6460, 1556, 142508, 9638, 127892, 21917, 26518, 38496, 18622, 3164, 40705, 25916, 765, 3444, 74189, 40899, 20697, 7168, 116392, 37842, 20594, 74912, 864, ...

[ 0.045623779296875, 0.02294921875, 0.0144195556640625, 0.1727294921875, 0.1072998046875, 0.2001953125, 0.174072265625, 0.1539306640625, 0.056304931640625, 0.10687255859375, 0.2091064453125, 0.1539306640625, 0.092041015625, 0.043975830078125, 0.14404296875, 0.2445068359375, 0.090332031...

embed

75844764_c0

75844764

haskell

0

Title: "fatal error: 'ffi.h' file not found" when trying to install hashable via cabal Problem title: "fatal error: 'ffi.h' file not found" when trying to install hashable via cabal Tags: haskell Problem: "fatal error: 'ffi.h' file not found" when trying to install hashable via c...

"fatal error: 'ffi.h' file not found" when trying to install hashable via cabal "fatal error: 'ffi.h' file not found" when trying to install hashable via cabal haskell ffi.h Building hashable-1.4.2.0 Compiling Data.Hashable.Imports Data Hashable Imports.hs Imports.o Imports.dyn_o...

[ 0.0054931640625, 0.0029296875, 0.004974365234375, 0.00830078125, 0.003448486328125, -0.007049560546875, 0.00144195556640625, -0.00927734375, -0.003997802734375, -0.009521484375, -0.0142822265625, -0.0439453125, 0.0150146484375, 0.02099609375, 0.00860595703125, -0.00201416015625, -0.0...

[ 1021, 1803, 18499, 3768, 24500, 5, 127, 11435, 959, 14037, 31577, 20600, 1556, 2886, 1829, 109524, 142508, 104919, 91977, 73011, 15612, 49725, 11809, 6495, 6982, 162087, 92966, 15363, 61187, 2601, 181155, 31380, 152261, 238, 963, 15110, 34759, ...

[ 0.112548828125, 0.076171875, 0.14892578125, 0.1474609375, 0.2464599609375, 0.0751953125, 0.2098388671875, 0.177734375, 0.12451171875, 0.1536865234375, 0.07586669921875, 0.1490478515625, 0.1802978515625, 0.19677734375, 0.075927734375, 0.2274169921875, 0.2210693359375, 0.166381835937...

embed

41910663_c0

41910663

haskell

0

Title: Haskell: Assigning a value to a String Problem title: Haskell: Assigning a value to a String Tags: haskell Problem: Haskell: Assigning a value to a String My task consists in imitating features of an imperative programming language in Haskell. Now I'm struggling with assigning a value to a string. The point is t...

Haskell: Assigning a value to a String Haskell: Assigning a value to a String haskell Haskell Assigning Loc Location Env Sigma Haskell: Assigning a value to a String My task consists in imitating features of an imperative programming language in Haskell. Now I'm struggling with assigning a value to a string. The point ...

[ -0.006500244140625, -0.0208740234375, -0.00830078125, 0.0267333984375, -0.00750732421875, 0.009521484375, -0.01019287109375, 0.006683349609375, 0.0010986328125, 0.01495361328125, -0.0098876953125, -0.002349853515625, -0.007080078125, -0.008544921875, -0.013916015625, -0.009033203125, ...

[ 20625, 142508, 1301, 31304, 34292, 47, 23351, 214, 1556, 88784, 90788, 357, 334, 173328, 66211, 97751, 66139, 222530, 56037, 46876, 237875, 95486, 79315, 52895, 136, 21690, 9351, 10, 29458, 18151, 3714, 3642, 54, 32354, 1528, 5608, 4343, 7001...

[ 0.1256103515625, 0.2420654296875, 0.10333251953125, 0.240966796875, 0.1988525390625, 0.1351318359375, 0.2069091796875, 0.122802734375, 0.1064453125, 0.2093505859375, 0.2247314453125, 0.1341552734375, 0.2215576171875, 0.24755859375, 0.09014892578125, 0.1334228515625, 0.07958984375, ...

embed

44797426_c1

44797426

haskell

1

head (heap2list heap (Node x t1 t2))) then Just 0 else if ((contains heap e t1) == Just 0) then Just 0 else contains heap e t2 With that if the integer is in, it will return "Just 0" and else "Nothing". By the way, I am not allowed to use any "helper" functions written by myself. The function I am allowed to use are: e...

[ -0.0162353515625, 0.004852294921875, -0.01025390625, -0.018310546875, 0.02880859375, 0.0179443359375, -0.005889892578125, -0.0205078125, 0.022705078125, -0.017822265625, -0.01190185546875, 0.0026702880859375, 0.01171875, 0.005767822265625, 0.0167236328125, -0.00946044921875, -0.01458...

[ 10336, 1106, 2631, 304, 6562, 764, 5021, 112, 1022, 808, 418, 32149, 9563, 757, 37076, 98102, 5425, 28, 17727, 70541, 2174, 892, 1505, 23, 30646, 127794, 136, 64113, 107003, 4527, 73866, 56, 32354, 59121, 35978, 444, 201505, 1984, 183540, ...

[ 0.218994140625, 0.0999755859375, 0.1790771484375, 0.12109375, 0.162841796875, 0.1669921875, 0.08795166015625, 0.1190185546875, 0.07537841796875, 0.1044921875, 0.021514892578125, 0.0032958984375, 0.129638671875, 0.1942138671875, 0.07177734375, 0.15185546875, 0.0115966796875, 0.11242...

embed

33158502_c0

33158502

haskell

0

Title: Haskell - list product Problem title: Haskell - list product Tags: haskell Problem: Haskell - list product I know this question has been asked before. I worked through various posts but can't seem to find a solution to the problem. I have a simple Haskell program that creates a list of values. I then want to eit...

Haskell - list product Haskell - list product haskell Haskell Main x:xs Haskell - list product I know this question has been asked before. I worked through various posts but can't seem to find a solution to the problem. I have a simple Haskell program that creates a list of values. I then want to either call Prelude's ...

[ 0.005279541015625, 0.01385498046875, 0.015869140625, -0.00421142578125, -0.0252685546875, -0.0002899169921875, 0.0033721923828125, -0.003204345703125, 0.01708984375, -0.01068115234375, 0.01019287109375, -0.00799560546875, -0.000240325927734375, -0.016357421875, -0.007415771484375, 0.00...

[ 20625, 142508, 5303, 12996, 1556, 12321, 1022, 425, 8108, 29806, 2967, 8781, 1528, 28282, 142424, 3444, 11782, 1914, 822, 112, 32354, 10002, 12638, 1733, 48281, 1916, 2046, 45234, 16750, 10554, 49814, 26785, 5351, 95134, 127664, 1363, 17368, ...

[ 0.1385498046875, 0.2437744140625, 0.20166015625, 0.262451171875, 0.0994873046875, 0.06005859375, 0.026947021484375, 0.0823974609375, 0.0797119140625, 0.081787109375, 0.04840087890625, 0.066162109375, 0.10614013671875, 0.068359375, 0.150390625, 0.047210693359375, 0.116943359375, 0.0...

embed

58747995_c1

58747995

haskell

1

isErrorResult (UnexpectedString _) = True -- | Runs the given function on a successful parse result. Otherwise return the same failing parse result. onResult :: ParseResult a -> (Input -> a -> ParseResult b) -> ParseResult b onResult UnexpectedEof _ = UnexpectedEof onResult (ExpectedEof i) _ = ExpectedEof i onResult (...

[ -0.0115966796875, 0.0189208984375, 0.0031585693359375, 0.003631591796875, -0.0002689361572265625, 0.0186767578125, -0.01007080078125, -0.031005859375, 0.01043701171875, 0.005218505859375, -0.00689697265625, -0.015625, -0.0015869140625, 0.017822265625, -0.034423828125, 0.0079345703125, ...

[ 83, 18468, 31611, 4332, 7, 7136, 14256, 83613, 13, 89829, 71713, 214, 101, 2203, 87599, 4210, 58745, 28398, 34475, 32354, 98, 65771, 366, 184, 16750, 30646, 5701, 35782, 2392, 10, 876, 647, 4390, 1081, 84068, 91, 472, 2053, 2189, 436, 9...

[ 0.1556396484375, 0.1597900390625, 0.194091796875, 0.1341552734375, 0.1756591796875, 0.2152099609375, 0.0899658203125, 0.133056640625, 0.123291015625, 0.1258544921875, 0.1846923828125, 0.08795166015625, 0.15234375, 0.06121826171875, 0.190185546875, 0.08135986328125, 0.04632568359375, ...

embed

53749540_c0

53749540

haskell

0

Title: Override poorly encapsulated instance in Haskell Problem title: Override poorly encapsulated instance in Haskell Tags: haskell Problem: Override poorly encapsulated instance in Haskell My program depends on a library that decodes JSON that I provide into its internal data type. The library tries to encapsulate t...

Override poorly encapsulated instance in Haskell Override poorly encapsulated instance in Haskell haskell Override Haskell Override poorly encapsulated instance in Haskell My program depends on a library that decodes JSON that I provide into its internal data type. The library tries to encapsulate too much. It hides co...

[ -0.0019989013671875, 0.00445556640625, 0.00238037109375, 0.011474609375, 0.004150390625, -0.0013427734375, -0.0233154296875, -0.0002841949462890625, 0.004241943359375, 0.019287109375, -0.016357421875, -0.03271484375, 0.017333984375, 0.0247802734375, 0.015625, -0.00982666015625, 0.028...

[ 9578, 416, 70425, 538, 22, 15644, 77593, 110527, 20625, 142508, 23, 1556, 112, 1528, 56566, 35773, 8, 40899, 821, 58627, 22691, 70796, 2053, 10644, 1294, 1927, 5792, 5045, 1274, 94878, 41653, 35686, 9384, 12233, 44462, 23468, 4527, 2967, 45...

[ 0.10009765625, 0.178955078125, 0.1844482421875, 0.0498046875, 0.0684814453125, 0.186279296875, 0.1788330078125, 0.264404296875, 0.1627197265625, 0.24755859375, 0.0175628662109375, 0.1431884765625, 0.0557861328125, 0.080810546875, 0.149658203125, 0.1905517578125, 0.140380859375, 0.1...

embed

70426554_c1

70426554

haskell

1

as well and recompacting the list as you go line = [(1,4),(0,5),(1,2),(0,1),(1,3),(0,1),(1,1),(0,2),(1,2),(0,3),(1,1),(0,2),(1,2),(0,1)] I've got this to get started tally = foldl (\acc elem -> if (snd(elem)+acc) >= 9 then (snd(elem)+acc)-9 else (snd(elem)+acc)) 0 and when I feed it line tally [(1,4),(0,5),(1,2),(0,1)...

[ -0.00799560546875, -0.00555419921875, 0.00012063980102539062, 0.0306396484375, -0.007232666015625, 0.0216064453125, -0.00799560546875, 0.0166015625, 0.0145263671875, -0.00099945068359375, -0.00885009765625, 0.002960205078125, 0.0218505859375, 0.029296875, -0.032958984375, -0.0054931640...

[ 5299, 136, 456, 62268, 1916, 5303, 237, 738, 13315, 2203, 163324, 124940, 133063, 2389, 17727, 41600, 21320, 10461, 4163, 903, 2046, 26859, 2776, 538, 18344, 20469, 10060, 88, 195, 2174, 2208, 27889, 1328, 483, 15205, 757, 61590, 442, 51776...

[ 0.028106689453125, 0.013916015625, 0.03997802734375, 0.091552734375, 0.0023193359375, 0.1868896484375, 0.05010986328125, 0.04290771484375, 0.2091064453125, 0.01324462890625, 0.2017822265625, 0.2113037109375, 0.1346435546875, 0.056854248046875, 0.04888916015625, 0.003021240234375, 0.0...

embed

49431519_c0

49431519

haskell

0

Title: Doctest with GHC < 8.0: "phase `C pre-processor' failed" with "missing binary operator before token "("" Problem title: Doctest with GHC < 8.0: "phase `C pre-processor' failed" with "missing binary operator before token "("" Tags: c-prep...

Doctest with GHC < 8.0: "phase `C pre-processor' failed" with "missing binary operator before token "("" Doctest with GHC < 8.0: "phase `C pre-processor' failed" with "missing binary operator before token "("" c-preprocessor ghc doctest haskell...

[ 0.017822265625, -0.0010528564453125, 0.0147705078125, -0.00897216796875, -0.007415771484375, 0.00927734375, 0.00567626953125, -0.005157470703125, -0.01226806640625, 0.001800537109375, -0.011474609375, 0.000732421875, -0.01531982421875, 0.00171661376953125, 0.016357421875, -0.0003547668...

[ 29048, 6954, 678, 527, 73265, 1277, 3217, 2389, 153213, 441, 479, 63923, 748, 3768, 74, 165523, 619, 45188, 2394, 6635, 39933, 8108, 47, 1098, 132, 1230, 41502, 501, 4692, 31380, 238, 51584, 1556, 142508, 3311, 71713, 121137, 135913, 112204...

[ 0.169189453125, 0.254150390625, 0.060211181640625, 0.1060791015625, 0.225830078125, 0.064453125, 0.162109375, 0.179443359375, 0.165771484375, 0.119873046875, 0.17724609375, 0.1099853515625, 0.0806884765625, 0.1162109375, 0.003936767578125, 0.1693115234375, 0.003082275390625, 0.1457...

embed

64286597_c0

64286597

haskell

0

Title: Haskell:update a binary tree Problem title: Haskell:update a binary tree Tags: haskell, binary-tree, dictionary Problem: Haskell:update a binary tree I want to implement a map function ,mapLeaves ,which a function only map to the leaves in binary tree.And return a updated tree. data Tree = TNode Int [Tree] | Tle...

Haskell:update a binary tree Haskell:update a binary tree haskell binary-tree dictionary Haskell:update Tree TNode Tleaf y:ys Haskell:update a binary tree I want to implement a map function ,mapLeaves ,which a function only map to the leaves in binary tree.And return a updated tree. this is where i stop,how can i make ...

[ 0.00007915496826171875, 0.017822265625, 0.00323486328125, -0.004974365234375, 0.0177001953125, 0.01080322265625, -0.0166015625, -0.0012054443359375, 0.00518798828125, -0.0228271484375, -0.005523681640625, -0.0146484375, 0.00946044921875, 0.006988525390625, 0.029296875, 0.007080078125, ...

[ 20625, 142508, 117008, 2394, 6635, 53201, 1556, 62600, 10763, 101344, 384, 5021, 112, 133, 2407, 113, 4778, 10, 3444, 29479, 22288, 32354, 62346, 178381, 7, 4734, 47, 31358, 23, 30646, 150011, 7279, 47251, 3249, 903, 32036, 808, 127887, 369...

[ 0.1337890625, 0.2269287109375, 0.1710205078125, 0.16162109375, 0.128662109375, 0.2181396484375, 0.114990234375, 0.1802978515625, 0.04913330078125, 0.2052001953125, 0.0880126953125, 0.1644287109375, 0.1400146484375, 0.072509765625, 0.1395263671875, 0.08123779296875, 0.0855712890625, ...

embed

19114194_c0

19114194

haskell

0

Title: Vertex2 confusion with haskell openGL bindings Problem title: Vertex2 confusion with haskell openGL bindings Tags: opengl, vertex, haskell Problem: Vertex2 confusion with haskell openGL bindings I'm using Haskell openGL bindings to try to make a particle generator. I want to store information about a particle in...

Vertex2 confusion with haskell openGL bindings Vertex2 confusion with haskell openGL bindings opengl vertex haskell Vertex2 Particle GLfloat Couldn Expected Actual Vertex2 confusion with haskell openGL bindings I'm using Haskell openGL bindings to try to make a particle generator. I want to store information about a pa...

[ -0.02294921875, -0.00518798828125, -0.00113677978515625, -0.01123046875, 0.032958984375, 0.018310546875, 0.00946044921875, 0.0005950927734375, 0.007049560546875, -0.00341796875, 0.00372314453125, -0.031982421875, 0.0152587890625, -0.033203125, -0.0152587890625, -0.0159912109375, 0.00...

[ 1446, 24371, 304, 169463, 678, 1556, 142508, 9803, 78703, 128239, 11016, 493, 436, 26147, 90799, 52347, 257, 191147, 60075, 13, 100582, 17368, 20625, 9790, 915, 145823, 3444, 4343, 4677, 17164, 831, 27875, 44457, 28350, 95307, 19069, 237, 542...

[ 0.19677734375, 0.2369384765625, 0.23974609375, 0.1905517578125, 0.034942626953125, 0.11279296875, 0.2049560546875, 0.106201171875, 0.201171875, 0.1802978515625, 0.157958984375, 0.10888671875, 0.0154876708984375, 0.1778564453125, 0.1737060546875, 0.224365234375, 0.1375732421875, 0.0...

embed

22319457_c0

22319457

haskell

0

Title: Proxies, type level symbols, and JSON Problem title: Proxies, type level symbols, and JSON Tags: haskell, vinyl, proxy, types Problem: Proxies, type level symbols, and JSON I'm trying to add automagical json parsing to Data.Vinyl Here is an instance for FromJSON for records with exactly one element. It almost wo...

Proxies, type level symbols, and JSON Proxies, type level symbols, and JSON haskell vinyl proxy types a the Proxies JSON KnownSymbol FromJSON PlainRec Object json_name Field T.pack Could sym0 Proxies, type level symbols, and JSON I'm trying to add automagical json parsing to Data.Vinyl Here is an instance for FromJSON ...

[ -0.01092529296875, -0.0101318359375, -0.0023651123046875, 0.00994873046875, -0.0174560546875, 0.002685546875, -0.0198974609375, 0.0224609375, -0.004913330078125, -0.0159912109375, -0.0185546875, -0.000476837158203125, -0.0029144287109375, 0.00927734375, -0.0125732421875, 0.017944335937...

[ 1250, 5134, 90, 10644, 17366, 26582, 136, 821, 58627, 1556, 142508, 193289, 502, 50878, 52895, 70829, 19, 65183, 36846, 28090, 1375, 8950, 4332, 238, 134549, 1647, 1681, 11627, 117657, 384, 29102, 191147, 954, 39, 2389, 15190, 1809, 15429, ...

[ 0.16748046875, 0.2080078125, 0.048004150390625, 0.1856689453125, 0.2222900390625, 0.2265625, 0.03466796875, 0.1273193359375, 0.208984375, 0.09423828125, 0.2037353515625, 0.236083984375, 0.128662109375, 0.2347412109375, 0.1593017578125, 0.150146484375, 0.038970947265625, 0.108520507...

embed

57551851_c0

57551851

haskell

0

Title: Parsing a Type using a GHC-Plugin Problem title: Parsing a Type using a GHC-Plugin Tags: haskell, ghc, ghc-api Problem: Parsing a Type using a GHC-Plugin I'm working on a compiler plugin that should abort compilation if a declaration doesn't have a type that given as a plugin argument. I think the function Unify...

Parsing a Type using a GHC-Plugin Parsing a Type using a GHC-Plugin haskell ghc ghc-api a Parsing Type GHC-Plugin Unify.tcMatchTy Maybe TCvSubstS Text:0:0 Not GHC tcl_env Parsing a Type using a GHC-Plugin I'm working on a compiler plugin that should abort compilation if a declaration doesn't have a type that given as a...

[ -0.00058746337890625, 0.015869140625, -0.013916015625, 0.005126953125, -0.01116943359375, 0.0002994537353515625, -0.0213623046875, -0.0113525390625, -0.00885009765625, -0.0498046875, -0.00048065185546875, -0.004058837890625, -0.00164794921875, -0.0106201171875, -0.004241943359375, 0.00...

[ 2392, 6953, 60457, 17368, 527, 73265, 9, 683, 35159, 73, 10, 1556, 142508, 31380, 238, 40897, 992, 40383, 79520, 618, 53, 80844, 334, 96472, 271, 294, 24129, 53861, 34937, 20697, 9969, 34759, 69993, 64853, 98352, 21635, 22027, 18, 10644, ...

[ 0.178955078125, 0.0528564453125, 0.29150390625, 0.0277557373046875, 0.08465576171875, 0.22119140625, 0.00433349609375, 0.04193115234375, 0.1707763671875, 0.1435546875, 0.072265625, 0.0609130859375, 0.1939697265625, 0.07537841796875, 0.066650390625, 0.08648681640625, 0.0821533203125, ...

embed

23803725_c1

23803725

haskell

1

.8 hs-source-dirs: src default-language: Haskell2010 ghc-options: -Wall -fno-warn-orphans test-suite tests type: exitcode-stdio-1.0 default-language: Haskell2010 hs-source-dirs: tests main-is: Test.hs ghc-options: -Wall -fno-warn-orphans build-depends: base == 4.*, QuickCheck >=2.6 && <2.7, test-framework-quickcheck2 >...

[ -0.006378173828125, 0.00341796875, -0.00439453125, -0.006378173828125, -0.01239013671875, 0.0004749298095703125, 0.001251220703125, 0.005035400390625, 0.0166015625, -0.0185546875, -0.001922607421875, 0.0025787353515625, 0.0023651123046875, 0.021240234375, 0.01275634765625, 0.0230712890...

[ 5, 1019, 1096, 7, 60427, 936, 19437, 114977, 196651, 20625, 142508, 11436, 31380, 238, 109585, 198076, 157, 4205, 19, 748, 68743, 3034, 68879, 109921, 10644, 82230, 40899, 271, 5670, 102107, 5201, 8647, 127, 420, 45367, 105254, 3647, 1398, ...

[ 0.0137939453125, 0.14697265625, 0.0679931640625, 0.05303955078125, 0.130126953125, 0.0650634765625, 0.0828857421875, 0.17578125, 0.1649169921875, 0.1319580078125, 0.216796875, 0.1533203125, 0.0777587890625, 0.0222930908203125, 0.1444091796875, 0.1256103515625, 0.1278076171875, 0.06...

embed

38557834_c0

38557834

haskell

0

Title: Haskell Type matching error when passing two Lists Problem title: Haskell Type matching error when passing two Lists Tags: haskell, type-mismatch, list Problem: Haskell Type matching error when passing two Lists I'm getting started learning Haskell and have to create a really simple function that takes two Lists...

Haskell Type matching error when passing two Lists Haskell Type matching error when passing two Lists haskell type-mismatch list Criterion.Main Haskell Type Lists Couldn Integer Haskell Type matching error when passing two Lists I'm getting started learning Haskell and have to create a really simple function that takes...

[ 0.000080108642578125, -0.000873565673828125, -0.0087890625, 0.0002193450927734375, 0.008056640625, 0.00982666015625, 0.0081787109375, -0.0087890625, 0.01007080078125, -0.0059814453125, 0.0140380859375, -0.027587890625, -0.000789642333984375, -0.00872802734375, -0.0009307861328125, -0.0...

[ 20625, 142508, 60457, 14858, 18499, 452, 6626, 32036, 1556, 10644, 2179, 98753, 5303, 26315, 720, 1830, 168793, 191147, 44401, 214, 6953, 52080, 28282, 8781, 32354, 51776, 158, 4460, 66211, 240057, 164917, 28484, 18151, 25632, 9969, 49725, 3578...

[ 0.1143798828125, 0.2099609375, 0.2220458984375, 0.186767578125, 0.1820068359375, 0.07525634765625, 0.12548828125, 0.18017578125, 0.1075439453125, 0.185302734375, 0.0965576171875, 0.2303466796875, 0.1083984375, 0.06707763671875, 0.0902099609375, 0.11865234375, 0.008209228515625, 0.0...

embed

60698299_c0

60698299

haskell

0

Title: Using exported symbols Problem title: Using exported symbols Tags: module, haskell Problem: Using exported symbols I have a Haskell file called maxflow.hs that exports few symbols module MaxFlow (solveMaxFlow,MaxFlowNet,Vertex,Graph) where import Data.List data Vertex = Vertex { vertexLabel :: String , vertexNei...

Using exported symbols Using exported symbols module haskell Data.List MaxFlow Using MaxFlowNet Vertex Graph Show maxBound::Int elimination.hs:4:17 Data Char Integer Using exported symbols I have a Haskell file called maxflow.hs that exports few symbols In the same directory I have another file called elimination.hs th...

[ -0.005828857421875, 0.003326416015625, -0.004302978515625, 0.0277099609375, -0.0033721923828125, 0.0201416015625, 0.0030059814453125, 0.02490234375, -0.0013580322265625, -0.0225830078125, -0.01031494140625, -0.042236328125, 0.03466796875, -0.0030059814453125, 0.0022430419921875, 0.0054...

[ 345, 31255, 297, 26582, 7, 88996, 1556, 142508, 11809, 154663, 9920, 919, 17336, 24447, 1446, 24371, 6524, 11727, 17367, 18389, 12647, 7030, 18, 27169, 1363, 127, 617, 22950, 21656, 44401, 20625, 11435, 118664, 10846, 14364, 765, 1927, 4527, ...

[ 0.0843505859375, 0.24169921875, 0.109130859375, 0.23095703125, 0.08447265625, 0.131591796875, 0.1292724609375, 0.2088623046875, 0.1107177734375, 0.1151123046875, 0.1092529296875, 0.10498046875, 0.193359375, 0.1041259765625, 0.044158935546875, 0.109375, 0.10150146484375, 0.077331542...

embed

17078607_c0

17078607

haskell

0

Title: Evaluation of nullary functions in Haskell Problem title: Evaluation of nullary functions in Haskell Tags: functional-programming, lazy-evaluation, haskell Problem: Evaluation of nullary functions in Haskell Suppose you have a nullary function in Haskell, which is used several times in the code. Is it always eva...

Evaluation of nullary functions in Haskell Evaluation of nullary functions in Haskell functional-programming lazy-evaluation haskell Evaluation Haskell Hello n-1 Evaluation of nullary functions in Haskell Suppose you have a nullary function in Haskell, which is used several times in the code. Is it always evaluated onl...

[ -0.00183868408203125, -0.004913330078125, 0.022705078125, 0.006622314453125, 0.007659912109375, 0.0010223388671875, 0.017333984375, -0.02392578125, -0.00262451171875, 0.00162506103515625, -0.0228271484375, -0.0174560546875, 0.0081787109375, 0.00408935546875, 0.0152587890625, 0.01318359...

[ 151228, 9229, 1294, 32354, 20625, 142508, 123309, 28966, 21, 3285, 159258, 1556, 35378, 653, 5759, 11814, 40368, 20028, 18151, 11343, 151575, 4734, 24145, 21771, 3034, 11782, 209, 33022, 841, 13817, 16750, 4343, 7103, 5117, 219836, 442, 142027,...

[ 0.2388916015625, 0.205810546875, 0.1905517578125, 0.1954345703125, 0.130615234375, 0.2357177734375, 0.1072998046875, 0.042144775390625, 0.0287017822265625, 0.10028076171875, 0.174072265625, 0.07818603515625, 0.1912841796875, 0.014373779296875, 0.12353515625, 0.1331787109375, 0.145385...

embed

42517497_c0

42517497

haskell

0

Title: How do I use hdevtools with ghcjs within stack Problem title: How do I use hdevtools with ghcjs within stack Tags: ghc, hdevtools, haskell-stack, haskell, ghcjs Problem: How do I use hdevtools with ghcjs within stack So it looks like hdevtools cannot be directly used with ghcjs. Using stack install hdevtools wit...

How do I use hdevtools with ghcjs within stack How do I use hdevtools with ghcjs within stack ghc hdevtools haskell-stack haskell ghcjs How Error While hdevtools-0.1.5.0 Plan How do I use hdevtools with ghcjs within stack So it looks like hdevtools cannot be directly used with ghcjs. Using stack install hdevtools withi...

[ -0.01129150390625, 0.02490234375, -0.0068359375, -0.0030059814453125, 0.0037384033203125, 0.006195068359375, -0.0201416015625, 0.00732421875, -0.002655029296875, -0.015625, 0.007781982421875, -0.036865234375, 0.000453948974609375, 0.0146484375, 0.0033111572265625, 0.01055908203125, -...

[ 4527, 1096, 18548, 89110, 7, 678, 31380, 238, 28175, 28032, 177261, 1556, 142508, 590, 2594, 212059, 51404, 102014, 187461, 5586, 53418, 105237, 11814, 345, 20600, 527, 73265, 64977, 13452, 15673, 5701, 18499, 52895, 37382, 2806, 17723, 997, ...

[ 0.0965576171875, 0.1141357421875, 0.2257080078125, 0.2447509765625, 0.080322265625, 0.08453369140625, 0.10150146484375, 0.1053466796875, 0.1737060546875, 0.1209716796875, 0.163330078125, 0.054962158203125, 0.134033203125, 0.041351318359375, 0.05157470703125, 0.152587890625, 0.0225524...

embed

43443961_c1

43443961

haskell

1

ix { } After doing this, I executed nix-build release.nix and got back these derivations will be built: /nix/store/p481alkpm89712n3hnwai0nxhmjrm8b2-project-0.1.0.0.drv building path(s) ‘/nix/store/yszy2a6wd88pf6zlw0nw99l5wzvc0s9x-project-0.1.0.0’ setupCompilerEnvironmentPhase Build with /nix/store/d5w12a8bprd2518xnqp1c...

[ -0.01348876953125, -0.006561279296875, -0.00701904296875, 0.005950927734375, 0.00299072265625, 0.0057373046875, -0.007781982421875, -0.000946044921875, 0.0087890625, 0.00445556640625, 0.004486083984375, -0.019287109375, 0.01483154296875, -0.007293701171875, -0.0013885498046875, -0.0019...

[ 4084, 24372, 20594, 903, 87, 71924, 300, 425, 177149, 54452, 93, 4163, 4420, 6097, 30057, 5256, 1221, 186, 88303, 45804, 185689, 26822, 14773, 634, 18504, 95322, 102014, 99929, 7569, 334, 33976, 60875, 169581, 108161, 686, 1900, 45689, 6991, ...

[ 0.1453857421875, 0.033599853515625, 0.0212860107421875, 0.036651611328125, 0.056396484375, 0.1407470703125, 0.1412353515625, 0.1810302734375, 0.200439453125, 0.1365966796875, 0.144287109375, 0.0003662109375, 0.10577392578125, 0.0928955078125, 0.2293701171875, 0.1170654296875, 0.08502...

embed

42232207_c0

42232207

haskell

0

Title: Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? Problem title: Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? Tags: haskell, text-processing Problem: Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? I want to remove trailing character...

Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? Why doesn't Haskell Data.ByteString.Lazy.Char8 have an unzip function? haskell text-processing qualified Why Haskell Data.ByteString.Lazy.Char8 LANGUAGE OverloadedStrings C.null C.empty C.head C.group C.zip C.concat Char Bytestring Why doe...

[ 0.028564453125, 0.036376953125, 0.025634765625, 0.023193359375, -0.0086669921875, 0.0244140625, -0.0113525390625, -0.0098876953125, -0.00616455078125, 0.0257568359375, -0.0206298828125, -0.0038909912109375, -0.0028076171875, 0.00872802734375, -0.0208740234375, 0.01141357421875, 0.021...

[ 44084, 22027, 3768, 18, 20625, 142508, 11809, 75358, 67, 71713, 214, 2729, 3285, 84068, 1019, 765, 51, 50836, 32354, 1556, 7986, 63923, 217225, 98064, 9578, 63033, 139550, 33548, 31251, 51588, 313, 2271, 4460, 21656, 3311, 91693, 3444, 87388,...

[ 0.10748291015625, 0.03997802734375, 0.0308837890625, 0.0736083984375, 0.09332275390625, 0.220458984375, 0.1248779296875, 0.07537841796875, 0.0853271484375, 0.156005859375, 0.0809326171875, 0.12109375, 0.1861572265625, 0.1824951171875, 0.21337890625, 0.0203094482421875, 0.125366210937...

embed

42936372_c0

42936372

haskell

0

Title: What is wrong in this Haskell function? Problem title: What is wrong in this Haskell function? Tags: haskell Problem: What is wrong in this Haskell function? I decided to dive in functional programming world recently, and a friend told me about Haskell. I started my own researches on the language particularity a...

What is wrong in this Haskell function? What is wrong in this Haskell function? haskell What Haskell What is wrong in this Haskell function? I decided to dive in functional programming world recently, and a friend told me about Haskell. I started my own researches on the language particularity and soon I got the main c...

[ -0.003204345703125, 0.0126953125, 0.0057373046875, 0.00811767578125, -0.0068359375, 0.0086669921875, -0.00628662109375, -0.0057373046875, 0.0108642578125, 0.00048065185546875, 0.01483154296875, 0.0130615234375, -0.0037841796875, 0.0076904296875, 0.014404296875, 0.001739501953125, 0.0...

[ 4865, 83, 44691, 23, 903, 20625, 142508, 32354, 1556, 45, 123309, 56037, 8999, 34391, 25188, 46876, 17311, 23755, 20697, 5303, 456, 434, 18781, 99707, 41361, 7228, 11389, 39531, 184, 35839, 18, 61924, 35064, 43240, 169123, 163, 29569, 15700, ...

[ 0.0941162109375, 0.0701904296875, 0.2139892578125, 0.099609375, 0.14697265625, 0.144287109375, 0.252685546875, 0.195556640625, 0.122802734375, 0.009033203125, 0.148681640625, 0.09979248046875, 0.010345458984375, 0.035736083984375, 0.023040771484375, 0.0877685546875, 0.02044677734375,...

embed

56013322_c0

56013322

haskell

0

Title: Why is Haskell Stack hanging while attempting to build my project? Problem title: Why is Haskell Stack hanging while attempting to build my project? Tags: haskell, macos, haskell-stack, build Problem: Why is Haskell Stack hanging while attempting to build my project? Warning: this is an unsupported build that ma...

Why is Haskell Stack hanging while attempting to build my project? Why is Haskell Stack hanging while attempting to build my project? haskell macos haskell-stack build --extra-lib-dirs Why Haskell Stack regex-posix-0.95.2 Download x86_64 Compiled Cabal-2.4.0.1 Glob-0.9.3 HUnit-1.6.0.0 QuickCheck-2.11.3 StateVar-1.1.1.1...

[ -0.027099609375, 0.012939453125, -0.004974365234375, -0.005126953125, -0.0166015625, -0.004180908203125, -0.01385498046875, -0.0003452301025390625, -0.00079345703125, 0.01422119140625, 0.006561279296875, -0.0419921875, 0.0111083984375, 0.0003032684326171875, 0.006256103515625, 0.000556...

[ 44084, 83, 20625, 142508, 6512, 2594, 10756, 214, 12960, 81887, 45367, 759, 13452, 47, 1556, 291, 7840, 590, 112779, 5612, 936, 6835, 3355, 67890, 425, 143161, 158296, 4857, 15276, 13307, 15612, 14, 6259, 30438, 289, 9, 116591, 5, 102014, ...

[ 0.1649169921875, 0.08245849609375, 0.17236328125, 0.277587890625, 0.2176513671875, 0.2235107421875, 0.257568359375, 0.1705322265625, 0.1419677734375, 0.16357421875, 0.1795654296875, 0.0347900390625, 0.1585693359375, 0.003631591796875, 0.1453857421875, 0.05859375, 0.1285400390625, 0...

embed

33509984_c0

33509984

haskell

0

Title: Can GHCI be used to explain coercions? Problem title: Can GHCI be used to explain coercions? Tags: haskell Problem: Can GHCI be used to explain coercions? How to ask GHCI to explain why the following: *Lib> sum Nothing 0 Even compiles? Was there Monoid involved somehow? It's not in the signature! *Lib> :i Foldab...

Can GHCI be used to explain coercions? Can GHCI be used to explain coercions? haskell Can GHCI Lib Nothing Monoid Foldable Ord Num Defined Data.Foldable Maybe Either Integer GHC.Num Word Float GHC.Float Double Can GHCI be used to explain coercions? How to ask GHCI to explain why the following: Even compiles? Was there ...

[ -0.0169677734375, -0.018798828125, 0.01336669921875, 0.0286865234375, -0.00921630859375, 0.0308837890625, -0.00640869140625, 0.00107574462890625, 0.01348876953125, 0.01092529296875, -0.0157470703125, -0.047119140625, -0.0057373046875, 0.000934600830078125, -0.00518798828125, -0.0025634...

[ 4171, 41877, 17304, 11814, 47, 73342, 552, 56, 5746, 1556, 142508, 43278, 182747, 77879, 532, 30077, 71, 2886, 35379, 52782, 5983, 11809, 18345, 44401, 527, 73265, 316, 22543, 38699, 365, 107172, 186, 26458, 15400, 25632, 31267, 9969, 1340, ...

[ 0.046417236328125, 0.164794921875, 0.2291259765625, 0.0911865234375, 0.05450439453125, 0.1871337890625, 0.1025390625, 0.168701171875, 0.1270751953125, 0.1087646484375, 0.2191162109375, 0.1566162109375, 0.112548828125, 0.12939453125, 0.1429443359375, 0.1004638671875, 0.017166137695312...

embed

70856865_c1

70856865

haskell

1

) as bs = quack p (p < x) x xs as bs -- Helper function for `split` quack p False x xs as bs = split p xs (x : as) bs quack p True x xs as bs = split p xs as (x : bs) -- Merges two lists as a sorted one merge [] ys = ys merge xs [] = xs merge (x : xs) (y : ys) = place (x < y) x xs y ys -- Helper function for `merge` pl...

[ -0.007049560546875, 0.011474609375, 0.024169921875, -0.0228271484375, -0.016357421875, 0.01007080078125, -0.0062255859375, -0.0196533203125, 0.016357421875, 0.0302734375, 0.00946044921875, 0.0126953125, 0.01446533203125, 0.0030059814453125, -0.015869140625, -0.0081787109375, -0.00335...

[ 1388, 237, 876, 7, 2203, 2799, 2594, 915, 254, 4426, 1022, 4210, 39527, 56, 32354, 7008, 4353, 22225, 65450, 87599, 6035, 4188, 6626, 5303, 17497, 1632, 42564, 113, 3687, 1991, 429, 5201, 17780, 2633, 96, 96759, 154663, 757, 197094, 62351...

[ 0.01019287109375, 0.154052734375, 0.1492919921875, 0.1722412109375, 0.046356201171875, 0.1973876953125, 0.1728515625, 0.1319580078125, 0.05224609375, 0.095947265625, 0.094482421875, 0.03204345703125, 0.2066650390625, 0.1502685546875, 0.1632080078125, 0.061553955078125, 0.172485351562...

embed

3138249_c0

3138249

haskell

0

Title: How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? Problem title: How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? Tags: performance, haskell, arrays Problem: How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? I have a st...

How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? performance haskell arrays How Size Patch Strict.ByteString Position How can I efficiently copy 2-dimensional arrays of bytes into a larger 2D array? I have a...

[ 0.00341796875, 0.00872802734375, -0.00592041015625, 0.0216064453125, -0.007568359375, 0.031494140625, -0.0242919921875, -0.0113525390625, 0.007568359375, 0.00689697265625, 0.0208740234375, 0.0029754638671875, 0.0263671875, -0.0098876953125, -0.0299072265625, 0.0019683837890625, -0.00...

[ 11249, 831, 93766, 43658, 4720, 157955, 10298, 4778, 390, 3934, 150679, 116, 397, 53, 87, 538, 1636, 23718, 1556, 142508, 80378, 159954, 73425, 15390, 75358, 67, 71713, 99428, 45646, 33636, 2053, 3444, 64549, 1295, 5423, 164917, 95486, 19069,...

[ 0.061981201171875, 0.0849609375, 0.2047119140625, 0.237548828125, 0.1346435546875, 0.175537109375, 0.15966796875, 0.09967041015625, 0.1199951171875, 0.142578125, 0.1552734375, 0.150146484375, 0.155029296875, 0.07342529296875, 0.0140533447265625, 0.007904052734375, 0.053558349609375, ...

embed

3213490_c0

3213490

haskell

0

Title: How do I write, "if typeclass a, then a is also an instance of b by this definition." Problem title: How do I write, "if typeclass a, then a is also an instance of b by this definition." Tags: haskell Problem: How do I write, "if typeclass a, then a is also an instance of b by this definition...

How do I write, "if typeclass a, then a is also an instance of b by this definition." How do I write, "if typeclass a, then a is also an instance of b by this definition." haskell How MyClass Show Constraint Foo Bar How do I write, "if typeclass a, then a is also an instance of b by this definition....

[ -0.0108642578125, -0.00933837890625, 0.01519775390625, 0.03466796875, 0.01123046875, 0.00372314453125, 0.003753662109375, -0.0216064453125, 0.02294921875, 0.00015163421630859375, -0.0228271484375, -0.0079345703125, -0.001983642578125, 0.0264892578125, -0.006378173828125, -0.01794433593...

[ 11249, 54, 87, 33022, 3190, 10644, 67413, 10, 7068, 83, 2843, 142, 110527, 111, 876, 390, 903, 80934, 1556, 142508, 2646, 140803, 17367, 1657, 2816, 4288, 9572, 31, 3253, 44, 32354, 27489, 23351, 214, 4527, 21980, 27875, 52895, 29479, 763...

[ 0.07177734375, 0.0290985107421875, 0.022003173828125, 0.1885986328125, 0.167724609375, 0.225341796875, 0.2548828125, 0.1455078125, 0.0960693359375, 0.038055419921875, 0.1246337890625, 0.040374755859375, 0.260498046875, 0.12109375, 0.1614990234375, 0.0972900390625, 0.07421875, 0.151...

embed

40580164_c0

40580164

haskell

0

Title: Parsing block comments with Megaparsec using symbols for start and end Problem title: Parsing block comments with Megaparsec using symbols for start and end Tags: haskell, megaparsec Problem: Parsing block comments with Megaparsec using symbols for start and end I want to parse text similar to this in Haskell us...

Parsing block comments with Megaparsec using symbols for start and end Parsing block comments with Megaparsec using symbols for start and end haskell megaparsec symbols Parsing Megaparsec START SKIP Foo END Parser Parsing block comments with Megaparsec using symbols for start and end I want to parse text similar to thi...

[ -0.028564453125, 0.0111083984375, 0.0014190673828125, 0.009033203125, -0.0203857421875, 0.0308837890625, -0.0091552734375, -0.01470947265625, 0.01397705078125, -0.01031494140625, -0.00201416015625, 0.0289306640625, 0.0052490234375, 0.01275634765625, -0.0086669921875, 0.0322265625, 0....

[ 2392, 6953, 46389, 24626, 678, 26842, 2500, 39797, 17368, 26582, 4034, 136, 3564, 1556, 142508, 31534, 188359, 159, 169000, 9572, 31, 39015, 2189, 3444, 366, 184, 7986, 21373, 20625, 16188, 21658, 166191, 10770, 674, 30646, 124519, 17721, 713...

[ 0.14111328125, 0.1046142578125, 0.190673828125, 0.24609375, 0.0275726318359375, 0.1630859375, 0.131103515625, 0.2257080078125, 0.023040771484375, 0.2178955078125, 0.1341552734375, 0.1048583984375, 0.1468505859375, 0.08917236328125, 0.2171630859375, 0.10723876953125, 0.177490234375, ...

embed

47211690_c1

47211690

haskell

1

In the expression: unfold extractMin In an equation for ‘ssort'’: ssort' = unfold extractMin test.hs:13:17: No instance for (Ord t0) arising from a use of ‘extractMin’ The type variable ‘t0’ is ambiguous Relevant bindings include ssort' :: [t0] -> [t0] (bound at test.hs:13:1) Note: there are several potential instance...

[ 0.00396728515625, -0.0004100799560546875, 0.02294921875, -0.01495361328125, 0.000392913818359375, -0.00933837890625, -0.005889892578125, -0.0206298828125, 0.0205078125, 0.01007080078125, -0.00518798828125, -0.004547119140625, 0.0107421875, -0.0211181640625, 0.0034027099609375, 0.000572...

[ 125195, 51, 42822, 125663, 59076, 5490, 7, 62351, 91, 25, 3034, 22618, 22950, 438, 110527, 143045, 77495, 187, 4527, 112779, 15390, 10644, 77336, 2389, 920, 12282, 128239, 99091, 138577, 38516, 35379, 876, 9319, 5983, 137989, 5584, 94049, 107...

[ 0.1812744140625, 0.10064697265625, 0.210693359375, 0.20849609375, 0.2451171875, 0.1544189453125, 0.06280517578125, 0.304931640625, 0.10137939453125, 0.004913330078125, 0.0765380859375, 0.042510986328125, 0.0948486328125, 0.052520751953125, 0.1865234375, 0.138671875, 0.1104736328125, ...

embed

65657675_c1

65657675

haskell

1

Statement_ env (Do cond expr) = evalDo env (Do cond expr) evalStatement_ env (Print val) = do x <- evalVal env val liftIO $ putStrLn $ show x evalDo :: Env -> HStatement -> IOThrowsError () evalDo env (Do cond expr) = evalVal env cond >>= \x -> case x of HBool False -> return () HBool True -> do traverse_ (evalVal env)...

[ -0.032958984375, -0.00732421875, -0.00921630859375, -0.0057373046875, -0.0257568359375, 0.01953125, 0.003997802734375, -0.029296875, -0.00982666015625, 0.016845703125, 0.005035400390625, -0.01031494140625, 0.01031494140625, -0.010986328125, -0.01116943359375, 0.0036163330078125, -0.0...

[ 22836, 674, 454, 22, 334, 8331, 158, 71, 14700, 42, 28, 1405, 135206, 5911, 112079, 18, 3502, 54, 1022, 42272, 60520, 17780, 3884, 71713, 7639, 357, 39718, 19888, 87, 23973, 127, 15555, 7, 18468, 31611, 7225, 572, 12647, 929, 22225, 306...

[ 0.2227783203125, 0.14501953125, 0.05889892578125, 0.0875244140625, 0.208251953125, 0.1968994140625, 0.0902099609375, 0.0780029296875, 0.087890625, 0.08782958984375, 0.069580078125, 0.2344970703125, 0.187744140625, 0.1263427734375, 0.1529541015625, 0.0867919921875, 0.15576171875, 0....

embed

57194718_c0

57194718

haskell

0

Title: How to convert type-level list into chain of pairs Problem title: How to convert type-level list into chain of pairs Tags: haskell, singleton-type, functional-programming Problem: How to convert type-level list into chain of pairs The singletons library seems too difficult to deal with it without strong backgrou...

How to convert type-level list into chain of pairs How to convert type-level list into chain of pairs haskell singleton-type functional-programming Data.Singletons.Prelude.List Data.Singletons.Prelude.Tuple How LANGUAGE TypeFamilies TypeInType ExpandList IntoChainOfPairs Sing SCons SNil STuple2 STuple0 How to convert t...

[ -0.006439208984375, -0.00421142578125, -0.00872802734375, 0.0201416015625, 0.0033721923828125, 0.01239013671875, -0.022216796875, -0.01397705078125, 0.015869140625, -0.0213623046875, -0.01123046875, -0.0026397705078125, 0.010498046875, 0.009033203125, -0.0218505859375, 0.00692749023437...

[ 11249, 96760, 10644, 67919, 5303, 3934, 121293, 111, 80836, 1556, 142508, 11001, 1507, 50986, 123309, 28966, 11809, 213039, 67772, 19273, 822, 154663, 112, 15665, 8705, 98064, 60457, 1191, 4153, 196707, 60075, 2940, 360, 188, 62467, 73, 132887,...

[ 0.0197906494140625, 0.171630859375, 0.20849609375, 0.237548828125, 0.208740234375, 0.1083984375, 0.250244140625, 0.09912109375, 0.26806640625, 0.10577392578125, 0.1827392578125, 0.15283203125, 0.1124267578125, 0.1123046875, 0.103271484375, 0.07763671875, 0.02752685546875, 0.1118164...

embed

36943608_c0

36943608

haskell

0

Title: Looking for `flatten :: Event [a] -> Event a` in Reactive Banana Problem title: Looking for `flatten :: Event [a] -> Event a` in Reactive Banana Tags: haskell, reactive-banana Problem: Looking for `flatten :: Event [a] -> Event a` in Reactive Banana I'm looking for something like flatten :: Event [a] -> Ev...

Looking for `flatten :: Event [a] -> Event a` in Reactive Banana Looking for `flatten :: Event [a] -> Event a` in Reactive Banana haskell reactive-banana Looking Event Reactive Banana Foldable Banana.MomentIO Banana.Event Banana.newEvent mapM_ Looking for `flatten :: Event [a] -> Event a` in Reactive Banana I'm l...

[ -0.007781982421875, 0.0206298828125, 0.00543212890625, -0.00982666015625, -0.01611328125, -0.0086669921875, 0.01348876953125, 0.0108642578125, 0.0045166015625, -0.0269775390625, -0.01092529296875, -0.0034027099609375, -0.003662109375, 0.01507568359375, -0.006683349609375, -0.0048828125...

[ 157268, 100, 150632, 510, 1984, 36943, 11, 5386, 10, 853, 71232, 53592, 76, 23, 1556, 142508, 456, 105281, 30077, 71, 2886, 9083, 674, 17780, 192134, 54936, 22288, 16487, 9844, 1884, 49878, 634, 678, 1238, 2174, 3444, 2806, 139392, 84797, ...

[ 0.108642578125, 0.07867431640625, 0.2003173828125, 0.245849609375, 0.048431396484375, 0.224609375, 0.1466064453125, 0.152099609375, 0.162841796875, 0.0931396484375, 0.2015380859375, 0.165283203125, 0.1602783203125, 0.0278167724609375, 0.0804443359375, 0.1734619140625, 0.0721435546875...

embed

19709899_c0

19709899

haskell

0

Title: Monadic comprehension syntax in C# Problem title: Monadic comprehension syntax in C# Tags: monads, haskell, functional-programming, c%23 Problem: Monadic comprehension syntax in C# I've been hanging out in a #haskell IRC room a couple of days ago and someone mentioned that C# has syntax for doing monadic compreh...

Monadic comprehension syntax in C# Monadic comprehension syntax in C# monads haskell functional-programming c%23 x y Monadic IEnumerable SelectMany xs.SelectMany ys.Select Task Monadic comprehension syntax in C# I've been hanging out in a #haskell IRC room a couple of days ago and someone mentioned that C# has syntax f...

[ -0.024658203125, 0.03662109375, 0.0133056640625, 0.01068115234375, -0.0098876953125, 0.01104736328125, -0.001373291015625, 0.0098876953125, 0.004638671875, -0.041259765625, -0.0172119140625, -0.023681640625, 0.002197265625, 0.0023956298828125, -0.015625, 0.001861572265625, 0.00177001...

[ 60331, 18403, 46683, 3220, 6889, 6002, 86531, 23, 313, 4904, 2667, 712, 1556, 142508, 123309, 28966, 3949, 3742, 113, 75536, 2606, 56, 2886, 51620, 12662, 53, 1022, 100184, 9598, 10756, 1810, 10557, 25740, 17155, 100, 20594, 11, 29459, 2821...

[ 0.2113037109375, 0.194580078125, 0.2052001953125, 0.2152099609375, 0.08392333984375, 0.170166015625, 0.2242431640625, 0.037994384765625, 0.0855712890625, 0.21240234375, 0.162109375, 0.158935546875, 0.0897216796875, 0.1903076171875, 0.14599609375, 0.08038330078125, 0.010101318359375, ...

embed

7223901_c1

7223901

haskell

1

Step' q cs scheduleOrStep' q ((Step b g):cs) = scheduleOrStep' (q . (g b:)) cs scheduleOrStep' q [] = s q -- schedule all completed compuations, step all the rest once, and repeat -- (may never complete for infinite lists) -- checking each row of -- [ [ c0s0, c1s0, c2s0, ... ] -- , [ c0s1, c1s1, c2s1, ... ] -- , [ c0s2...

[ -0.019287109375, 0.0284423828125, 0.004852294921875, 0.01409912109375, 0.002227783203125, -0.01416015625, 0.00738525390625, -0.01025390625, 0.0218505859375, 0.00168609619140625, -0.0142822265625, 0.02685546875, 0.0048828125, -0.0026702880859375, -0.0250244140625, -0.003570556640625, ...

[ 50478, 25, 8096, 20763, 80889, 19060, 191644, 876, 706, 2077, 4439, 2203, 864, 177, 84142, 91, 4210, 756, 140528, 9969, 34, 4, 29954, 10588, 24145, 136, 119140, 11354, 8306, 28484, 54241, 5303, 175199, 12638, 15555, 111, 2389, 304, 594, 1...

[ 0.286376953125, 0.176025390625, 0.2384033203125, 0.1290283203125, 0.30078125, 0.196044921875, 0.2427978515625, 0.1171875, 0.1171875, 0.035888671875, 0.14306640625, 0.0662841796875, 0.1260986328125, 0.055694580078125, 0.036895751953125, 0.1282958984375, 0.0830078125, 0.1279296875, ...

embed

7635720_c0

7635720

haskell

0

Title: type declarations in 'where' -- what's going on? Problem title: type declarations in 'where' -- what's going on? Tags: haskell, types, where-clause Problem: type declarations in 'where' -- what's going on? While reading the QuickCheck Manual , I came across the following example: pr...

type declarations in 'where' -- what's going on? type declarations in 'where' -- what's going on? haskell types where-clause prop_RevRev Bool type declarations in 'where' -- what's going on? While reading the QuickCheck Manual , I came across the following example: The manual goes on to sa...

[ 0.01177978515625, 0.0230712890625, -0.003265380859375, -0.016845703125, -0.020751953125, 0.006378173828125, 0.006683349609375, -0.01080322265625, 0.00011491775512695312, -0.0023651123046875, -0.002288818359375, -0.01239013671875, -0.000942230224609375, -0.04052734375, -0.002471923828125,...

[ 10644, 21635, 5256, 23, 3768, 136913, 2367, 7730, 98, 1556, 142508, 52895, 7440, 18347, 4032, 25793, 4332, 334, 2460, 929, 89038, 202567, 111021, 27781, 23009, 8306, 51592, 6044, 88308, 20625, 8108, 6183, 44402, 44084, 903, 6002, 86531, 32316...

[ 0.2459716796875, 0.233154296875, 0.0711669921875, 0.097900390625, 0.08837890625, 0.237060546875, 0.0621337890625, 0.0989990234375, 0.1085205078125, 0.1036376953125, 0.23779296875, 0.183349609375, 0.2047119140625, 0.0797119140625, 0.0203399658203125, 0.17822265625, 0.08837890625, 0....

embed