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
57967169_c0	57967169	haskell	0	Title: Trying to Upgrade Haskell stack Problem title: Trying to Upgrade Haskell stack Tags: haskell, haskell-stack, command-line Problem: Trying to Upgrade Haskell stack I have Haskell stack installed on my computer and when I type in stack --version I get Version 1.5.1 x86_64 Compiled with: and it's a bunch of differe...	Trying to Upgrade Haskell stack Trying to Upgrade Haskell stack haskell haskell-stack command-line Trying Upgrade Haskell Version x86_64 Compiled Downloading github.com v2.1.3 stack-2.1.3-linux-x86_64-static.tar.gz Download Git hpack-0.31.2 WARNING Installation PATH Trying to Upgrade Haskell stack I have Haskell stack ...	[ -0.00653076171875, 0.0235595703125, 0.0147705078125, 0.01177978515625, -0.0012664794921875, -0.00537109375, -0.0299072265625, 0.0035247802734375, -0.0145263671875, 0.0242919921875, 0.00034332275390625, -0.00970458984375, 0.01519775390625, -0.0078125, -0.00159454345703125, -0.0014572143...	[ 40858, 214, 10091, 44286, 20625, 142508, 177261, 47, 1556, 590, 2594, 75101, 2256, 40647, 1022, 15276, 13307, 15612, 4857, 62270, 32102, 5, 277, 81, 5442, 81046, 5428, 2397, 6077, 201939, 867, 527, 217, 1096, 29102, 170179, 48400, 60873, 25...	[ 0.1549072265625, 0.04681396484375, 0.1561279296875, 0.1947021484375, 0.1671142578125, 0.27197265625, 0.22607421875, 0.0310516357421875, 0.1517333984375, 0.165283203125, 0.14453125, 0.13916015625, 0.075439453125, 0.119384765625, 0.003814697265625, 0.2005615234375, 0.1722412109375, 0...	embed
16987904_c0	16987904	haskell	0	Title: Haskell: typeclass and instance (Not in scope: data constructor..) Problem title: Haskell: typeclass and instance (Not in scope: data constructor..) Tags: typeclass, instance, haskell Problem: Haskell: typeclass and instance (Not in scope: data constructor..) I want to make a typeclass Size with a method that gi...	Haskell: typeclass and instance (Not in scope: data constructor..) Haskell: typeclass and instance (Not in scope: data constructor..) typeclass instance haskell Haskell Not Size Bool example4 Haskell: typeclass and instance (Not in scope: data constructor..) I want to make a typeclass Size with a method that given a va...	[ 0.007476806640625, -0.00067901611328125, 0.00714111328125, 0.02001953125, 0.0009765625, 0.00518798828125, -0.004241943359375, 0.01312255859375, 0.0032806396484375, -0.0084228515625, -0.0198974609375, -0.031005859375, 0.00897216796875, 0.019775390625, 0.01043701171875, -0.00381469726562...	[ 20625, 142508, 10644, 67413, 136, 110527, 122116, 70820, 2053, 64549, 748, 1556, 11205, 80378, 2460, 929, 27781, 617, 3444, 3249, 55300, 34475, 34292, 7077, 14012, 25251, 23, 903, 5608, 8337, 190, 18499, 48205, 12, 127167, 13, 4527, 360, 18...	[ 0.1185302734375, 0.2191162109375, 0.20556640625, 0.259521484375, 0.0682373046875, 0.2122802734375, 0.138671875, 0.1875, 0.09747314453125, 0.1689453125, 0.10693359375, 0.08306884765625, 0.1385498046875, 0.1953125, 0.084716796875, 0.168701171875, 0.09210205078125, 0.1080322265625, ...	embed
17518749_c0	17518749	haskell	0	Title: How to "change" single values in large objects in elegant way? Problem title: How to "change" single values in large objects in elegant way? Tags: haskell Problem: How to "change" single values in large objects in elegant way? For example, i have data ShipDesign = ShipDesign { offense :: Offe...	How to "change" single values in large objects in elegant way? How to "change" single values in large objects in elegant way? haskell How ShipDesign Offense Defense Integer How to "change" single values in large objects in elegant way? For example, i have Now i want to change the defense. The known ...	[ -0.00830078125, 0.00445556640625, 0.00201416015625, 0.0185546875, 0.010498046875, -0.0115966796875, -0.0322265625, -0.008544921875, 0.0106201171875, 0.02978515625, -0.000789642333984375, 0.014892578125, 0.0026397705078125, 0.00057220458984375, 0.0098876953125, -0.020751953125, -0.005...	[ 11249, 47, 152028, 11001, 142424, 23, 21334, 36746, 27650, 3917, 1556, 142508, 8294, 254, 128640, 9791, 21161, 207068, 44401, 765, 14240, 17, 3444, 15549, 70, 165815, 51529, 54, 903, 56112, 18, 27528, 6863, 39210, 1660, 10846, 117, 29954, 3...	[ 0.128173828125, 0.0806884765625, 0.26123046875, 0.231201171875, 0.2386474609375, 0.0802001953125, 0.1693115234375, 0.2049560546875, 0.2086181640625, 0.1038818359375, 0.1339111328125, 0.2218017578125, 0.1444091796875, 0.0682373046875, 0.2237548828125, 0.12939453125, 0.064697265625, ...	embed
24346667_c0	24346667	haskell	0	Title: Converting Integer into list of digits without 'mod' and 'div' Problem title: Converting Integer into list of digits without 'mod' and 'div' Tags: haskell Problem: Converting Integer into list of digits without 'mod' and 'div' I currently have the Haskell function below wh...	Converting Integer into list of digits without 'mod' and 'div' Converting Integer into list of digits without 'mod' and 'div' haskell Converting Integer Converting Integer into list of digits without 'mod' and 'div' I currently have the Haskell function below which converts an in...	[ -0.0162353515625, 0.0028076171875, 0.0004405975341796875, -0.00640869140625, -0.005767822265625, 0.025390625, -0.0216064453125, -0.005859375, -0.005950927734375, -0.037841796875, -0.000339508056640625, -0.0181884765625, -0.0072021484375, 0.00494384765625, -0.0023651123046875, 0.0031280...	[ 1657, 814, 1916, 44401, 3934, 5303, 111, 153939, 7, 15490, 3768, 13415, 30618, 1556, 142508, 136, 82424, 765, 20625, 32354, 35064, 96760, 892, 1505, 39958, 1295, 7311, 9655, 3917, 54, 903, 17368, 2811, 18221, 2174, 36663, 5701, 13580, 678, ...	[ 0.053466796875, 0.13916015625, 0.0570068359375, 0.255615234375, 0.11865234375, 0.1806640625, 0.045867919921875, 0.208984375, 0.06573486328125, 0.1357421875, 0.07562255859375, 0.15966796875, 0.1854248046875, 0.1212158203125, 0.239013671875, 0.0816650390625, 0.080810546875, 0.0211181...	embed
52615752_c0	52615752	haskell	0	Title: Having trouble getting the first value from a Haskell Tuple Problem title: Having trouble getting the first value from a Haskell Tuple Tags: haskell, functional-programming Problem: Having trouble getting the first value from a Haskell Tuple I have a value that is in the form of ([(Int, Int, Int)], Int, Int) I n...	Having trouble getting the first value from a Haskell Tuple Having trouble getting the first value from a Haskell Tuple haskell functional-programming a it Having Haskell Tuple Couldn Relevant Having trouble getting the first value from a Haskell Tuple I have a value that is in the form of ([(Int, Int, Int)], Int, Int)...	[ 0.017578125, 0.00112152099609375, -0.004302978515625, 0.0166015625, -0.0098876953125, 0.0081787109375, -0.00543212890625, 0.002227783203125, 0.00933837890625, -0.039794921875, 0.007049560546875, 0.004608154296875, -0.0079345703125, 0.0291748046875, -0.01336669921875, 0.0003547668457031...	[ 171855, 63134, 20949, 5117, 34292, 1295, 20625, 142508, 1371, 8705, 70, 1556, 123309, 28966, 442, 191147, 19, 853, 133, 30624, 765, 3173, 4153, 18, 360, 3871, 32354, 5646, 2053, 30646, 759, 5303, 24, 4806, 11675, 1238, 271, 903, 18499, 10...	[ 0.04522705078125, 0.1654052734375, 0.1258544921875, 0.1947021484375, 0.232666015625, 0.094970703125, 0.147705078125, 0.2381591796875, 0.1292724609375, 0.1983642578125, 0.030548095703125, 0.1396484375, 0.1448974609375, 0.06976318359375, 0.114990234375, 0.14599609375, 0.01861572265625,...	embed
32861367_c0	32861367	haskell	0	Title: infinite type error in haskell when trying to translate python function into haskell. Why? Problem title: infinite type error in haskell when trying to translate python function into haskell. Why? Tags: haskell, algorithm, python Problem: infinite type error in haskell when trying to translate python function in...	infinite type error in haskell when trying to translate python function into haskell. Why? infinite type error in haskell when trying to translate python function into haskell. Why? haskell algorithm python acc iter Why get_N_Partition_Permutations n-1 partitionArr.hs Occurs Expected Actual Relevant partitionArr.hs:21:...	[ -0.009521484375, -0.0181884765625, -0.00007963180541992188, -0.011962890625, -0.0108642578125, 0.00811767578125, -0.0067138671875, -0.02392578125, 0.0038299560546875, -0.0181884765625, -0.00193023681640625, -0.0179443359375, 0.0247802734375, -0.0108642578125, -0.00909423828125, 0.00939...	[ 54241, 13, 10644, 18499, 1556, 142508, 31577, 3900, 19309, 17198, 50828, 32354, 3934, 44084, 234873, 50015, 720, 2046, 839, 58229, 14, 1363, 15277, 14311, 21094, 653, 5759, 2878, 7614, 42, 127, 48650, 60075, 100582, 133, 25619, 23988, 527, ...	[ 0.182861328125, 0.0787353515625, 0.208984375, 0.205810546875, 0.1473388671875, 0.2242431640625, 0.0433349609375, 0.10455322265625, 0.1361083984375, 0.0938720703125, 0.1268310546875, 0.1241455078125, 0.1041259765625, 0.06793212890625, 0.13818359375, 0.0391845703125, 0.1544189453125, ...	embed
54527244_c0	54527244	haskell	0	Title: Checking multiple conditions in a case Problem title: Checking multiple conditions in a case Tags: ghc, ghci, haskell Problem: Checking multiple conditions in a case Suppose I have this (inserting into a BST): mybstInsert k inp@(INode left key right) \| k < key = myNode (mybstInsert k left) key right \| k > key = ...	Checking multiple conditions in a case Checking multiple conditions in a case ghc ghci haskell Checking INode Checking multiple conditions in a case Suppose I have this (inserting into a BST): What I want is, in the second condition, I want another check as well (checking if right is empty or not). So I want to break t...	[ -0.0181884765625, -0.01171875, 0.003326416015625, 0.00003600120544433594, 0.01019287109375, 0.00634765625, 0.0035858154296875, -0.0234375, 0.03466796875, -0.01318359375, 0.02734375, -0.0098876953125, -0.00396728515625, -0.00689697265625, -0.01068115234375, 0.01470947265625, 0.0173339...	[ 38679, 214, 48716, 27289, 7225, 23, 31380, 238, 318, 1556, 142508, 5881, 31, 112, 2189, 335, 8545, 3444, 17932, 35431, 15700, 12765, 78292, 2174, 7108, 201505, 959, 36356, 7565, 3934, 6626, 83, 134332, 939, 32354, 51776, 1614, 62600, 14192,...	[ 0.200927734375, 0.046051025390625, 0.209228515625, 0.260498046875, 0.2098388671875, 0.039215087890625, 0.0819091796875, 0.08746337890625, 0.1163330078125, 0.09332275390625, 0.2078857421875, 0.029571533203125, 0.1129150390625, 0.1600341796875, 0.05413818359375, 0.02069091796875, 0.166...	embed
62234428_c1	62234428	haskell	1	uce (B g0) arising from a use of ‘d’ from the context: (B n, F n) bound by the type signature for: m :: forall (n :: * -> *) o. (B n, F n) => o -> o at j.hs:19:1-37 The type variable ‘g0’ is ambiguous These potential instance exist: instance B J -- Defined at j.hs:13:10 • In the second argument of ‘(.)’, namely ‘d’ In ...	uce (B g0) arising from a use of ‘d’ from the context: (B n, F n) bound by the type signature for: m :: forall (n :: * -> *) o. (B n, F n) => o -> o at j.hs:19:1-37 The type variable ‘g0’ is ambiguous These potential instance exist: instance B J -- Defined at j.hs:13:10 • In the second argument of ‘(.)’, namely ‘d’ In ...	[ 0.004150390625, 0.00775146484375, 0.00634765625, 0.0023345947265625, 0.00933837890625, 0.0113525390625, -0.0203857421875, -0.005706787109375, 0.01202392578125, -0.0224609375, -0.006072998046875, -0.01177978515625, 0.0194091796875, -0.0091552734375, -0.00897216796875, -0.0123291015625, ...	[ 75, 329, 571, 706, 77495, 187, 4527, 71, 1295, 43701, 653, 563, 99091, 10644, 138256, 347, 1984, 5584, 661, 36, 33079, 1647, 23988, 133015, 966, 77336, 177, 2389, 920, 12282, 10821, 38516, 110527, 32316, 335, 821, 5983, 15110, 17932, 1075...	[ 0.046417236328125, 0.1466064453125, 0.1270751953125, 0.02301025390625, 0.134521484375, 0.0295562744140625, 0.0992431640625, 0.18994140625, 0.034881591796875, 0.1524658203125, 0.062744140625, 0.1373291015625, 0.1396484375, 0.2098388671875, 0.18701171875, 0.1102294921875, 0.02500915527...	embed
62848784_c0	62848784	haskell	0	Title: Problem with understanding an equation used to define a monoid on the natural numbers Problem title: Problem with understanding an equation used to define a monoid on the natural numbers Tags: haskell, monoids Problem: Problem with understanding an equation used to define a monoid on the natural numbers Consider...	Problem with understanding an equation used to define a monoid on the natural numbers Problem with understanding an equation used to define a monoid on the natural numbers haskell monoids Data.Semigroup Problem Sum Ord Show Num Semigroup Monoid Problem with understanding an equation used to define a monoid on the natur...	[ -0.0185546875, 0.00994873046875, 0.00604248046875, 0.04150390625, -0.00040435791015625, 0.01611328125, -0.003021240234375, 0.0087890625, 0.022216796875, -0.0042724609375, -0.013427734375, -0.006103515625, -0.01483154296875, -0.0042724609375, -0.006805419921875, 0.00262451171875, 0.00...	[ 15649, 100094, 28, 5490, 2320, 11814, 61924, 22460, 532, 6083, 101935, 98, 1556, 142508, 30185, 11809, 266, 51588, 36335, 35379, 17367, 52782, 84420, 77879, 18151, 28219, 13315, 3525, 50986, 10, 2203, 2046, 316, 1984, 26950, 10644, 35874, 178...	[ 0.1171875, 0.1649169921875, 0.0185699462890625, 0.1912841796875, 0.04693603515625, 0.06732177734375, 0.1483154296875, 0.1519775390625, 0.1591796875, 0.11865234375, 0.1082763671875, 0.011199951171875, 0.0770263671875, 0.1866455078125, 0.077392578125, 0.017181396484375, 0.051025390625,...	embed
12764082_c0	12764082	haskell	0	Title: Haskell: Pattern Matching with Lists Problem title: Haskell: Pattern Matching with Lists Tags: haskell, list Problem: Haskell: Pattern Matching with Lists I'm trying to make a function that takes in a list, and if one of the elements is negative, then any elements in that list that are equal to its positive coun...	Haskell: Pattern Matching with Lists Haskell: Pattern Matching with Lists haskell list Haskell Pattern Matching Lists x:zs:y:ws x:xs Haskell: Pattern Matching with Lists I'm trying to make a function that takes in a list, and if one of the elements is negative, then any elements in that list that are equal to its posit...	[ -0.023193359375, 0.003997802734375, -0.01318359375, -0.00421142578125, -0.007080078125, 0.0027008056640625, 0.0033721923828125, 0.0186767578125, 0.01287841796875, 0.0478515625, 0.0018157958984375, 0.0048828125, 0.01092529296875, -0.002044677734375, 0.007537841796875, -0.001373291015625...	[ 20625, 142508, 9876, 22766, 67407, 214, 678, 32036, 12, 1556, 5303, 169, 53, 19725, 1022, 425, 31577, 3249, 32354, 51776, 23, 2174, 1632, 80854, 40907, 2499, 105950, 24491, 105416, 17365, 5608, 98816, 47, 757, 10, 122297, 756, 116, 25, 25...	[ 0.1292724609375, 0.2183837890625, 0.135009765625, 0.1112060546875, 0.20849609375, 0.0491943359375, 0.074462890625, 0.1685791015625, 0.004608154296875, 0.11962890625, 0.1868896484375, 0.052886962890625, 0.0183563232421875, 0.07342529296875, 0.002777099609375, 0.0233154296875, 0.045593...	embed
16552650_c0	16552650	haskell	0	Title: Haskell - list comprehension can't enumerate N × N Problem title: Haskell - list comprehension can't enumerate N × N Tags: performance, list, list-comprehension, haskell Problem: Haskell - list comprehension can't enumerate N × N I have to write a function which returns a list of all pairs (x,y) where ...	Haskell - list comprehension can't enumerate N × N Haskell - list comprehension can't enumerate N × N performance list list-comprehension haskell Haskell Haskell - list comprehension can't enumerate N × N I have to write a function which returns a list of all pairs (x,y) where x, y ∈ N , and : x is the produc...	[ -0.0120849609375, 0.01373291015625, 0.00799560546875, 0.00096893310546875, 0.0086669921875, 0.00982666015625, -0.0198974609375, -0.00860595703125, -0.004852294921875, -0.0208740234375, 0.007415771484375, 0.015625, 0.01434326171875, -0.017822265625, -0.0260009765625, 0.0027313232421875,...	[ 20625, 142508, 5303, 46683, 3220, 831, 3768, 18, 189085, 67, 541, 34070, 23718, 4692, 1556, 6889, 33022, 32354, 30646, 756, 80836, 425, 53, 1022, 113, 245918, 12996, 6626, 6083, 101935, 768, 876, 6183, 167785, 190, 164917, 2101, 108047, 140...	[ 0.1541748046875, 0.247802734375, 0.223388671875, 0.1812744140625, 0.174560546875, 0.09619140625, 0.03936767578125, 0.0958251953125, 0.267333984375, 0.06689453125, 0.1739501953125, 0.2203369140625, 0.1781005859375, 0.1068115234375, 0.1260986328125, 0.03179931640625, 0.1092529296875, ...	embed
2587635_c0	2587635	haskell	0	Title: How do I create a suitable .tar.gz file for use with `cabal upload`? Problem title: How do I create a suitable .tar.gz file for use with `cabal upload`? Tags: cabal, hackage, haskell-platform, haskell Problem: How do I create a suitable .tar.gz file for use with `cabal upload`? The standard way to share a Haskel...	How do I create a suitable .tar.gz file for use with `cabal upload`? How do I create a suitable .tar.gz file for use with `cabal upload`? cabal hackage haskell-platform haskell How tar.gz How do I create a suitable .tar.gz file for use with `cabal upload`? The standard way to share a Haskell library with other programm...	[ 0.0162353515625, 0.007049560546875, 0.007476806640625, 0.0037689208984375, -0.01123046875, -0.0101318359375, 0.00194549560546875, 0.00958251953125, 0.00726318359375, 0.0196533203125, 0.013427734375, -0.0242919921875, -0.002593994140625, 0.0213623046875, -0.00543212890625, 0.01025390625...	[ 11249, 28282, 202319, 5, 867, 177, 169, 11435, 4527, 678, 408, 3571, 70622, 109524, 85526, 4588, 1556, 142508, 172121, 2405, 5570, 3917, 12008, 20625, 35773, 3789, 77848, 30438, 289, 98169, 139509, 10557, 1478, 59121, 1294, 32599, 65771, 7593...	[ 0.076416015625, 0.1824951171875, 0.212890625, 0.056732177734375, 0.257080078125, 0.1402587890625, 0.1424560546875, 0.1890869140625, 0.1129150390625, 0.058135986328125, 0.153076171875, 0.2066650390625, 0.2490234375, 0.2296142578125, 0.1754150390625, 0.1939697265625, 0.125, 0.2492675...	embed
38778320_c0	38778320	haskell	0	Title: (r ->) applicative functor Problem title: (r ->) applicative functor Tags: haskell, functor, applicative Problem: (r ->) applicative functor I am having some trouble understanding how the function instance (->) r of Applicative works in Haskell. For example if I have (+) <$> (+3) <> (100) $ 5 I know you ...	(r ->) applicative functor (r ->) applicative functor haskell functor applicative (r ->) applicative functor I am having some trouble understanding how the function instance (->) r of Applicative works in Haskell. For example if I have I know you get the result 508, I sort of understand that you take the result o...	[ 0.020751953125, 0.0064697265625, 0.0011749267578125, 0.0031890869140625, 0.00726318359375, 0.0242919921875, -0.006683349609375, -0.00022125244140625, 0.00872802734375, -0.042724609375, 0.0262451171875, -0.024658203125, -0.004150390625, 0.0159912109375, -0.008544921875, -0.0166015625, ...	[ 42, 20, 1230, 5386, 41816, 4935, 7477, 18770, 1556, 142508, 33079, 63134, 100094, 3642, 32354, 110527, 103607, 16, 1690, 5659, 11048, 43240, 20625, 3714, 16750, 836, 1019, 28219, 5646, 11516, 997, 8439, 136, 661, 805, 59911, 70, 22183, 1504...	[ 0.1524658203125, 0.0560302734375, 0.015380859375, 0.09869384765625, 0.195556640625, 0.1602783203125, 0.1331787109375, 0.1513671875, 0.1256103515625, 0.2432861328125, 0.14501953125, 0.0207977294921875, 0.05877685546875, 0.0389404296875, 0.145751953125, 0.1966552734375, 0.1845703125, ...	embed
20145943_c0	20145943	haskell	0	Title: Flexible instances needed? Problem title: Flexible instances needed? Tags: haskell, typeclass Problem: Flexible instances needed? I want to write a Convertible instance for a Haskell type to its C representation It looks like this: instance Convertible Variable (IO (Ptr ())) where Now GHC complains: Illegal inst...	Flexible instances needed? Flexible instances needed? haskell typeclass Flexible Convertible Variable Ptr Illegal All Use XFlexibleInstances Flexible instances needed? I want to write a Convertible instance for a Haskell type to its C representation It looks like this: Now GHC complains: I thought Flexible Instances we...	[ 0.00799560546875, 0.003875732421875, -0.0037384033203125, 0.002960205078125, -0.01519775390625, 0.03173828125, -0.0238037109375, -0.0022430419921875, 0.01397705078125, -0.018798828125, 0.00830078125, -0.04150390625, 0.0152587890625, 0.0274658203125, -0.0177001953125, -0.00653076171875,...	[ 180842, 2661, 110527, 7, 44841, 32, 1556, 142508, 10644, 67413, 1657, 41418, 84572, 2886, 4448, 891, 86966, 3164, 36836, 1193, 919, 74070, 28236, 4153, 116071, 3444, 33022, 20625, 313, 18811, 33342, 73265, 186992, 17569, 360, 3542, 4092, 5289...	[ 0.2320556640625, 0.1787109375, 0.257568359375, 0.039764404296875, 0.1888427734375, 0.001434326171875, 0.11181640625, 0.236328125, 0.1494140625, 0.156494140625, 0.0283660888671875, 0.1466064453125, 0.1468505859375, 0.06475830078125, 0.1575927734375, 0.06036376953125, 0.1759033203125, ...	embed
65549385_c0	65549385	haskell	0	Title: Error in simple haskell program with generic data type Problem title: Error in simple haskell program with generic data type Tags: interpreter, functional-programming, haskell, parsing Problem: Error in simple haskell program with generic data type I'm writing a generic interpreter in Haskell but I have a proble...	Error in simple haskell program with generic data type Error in simple haskell program with generic data type interpreter functional-programming haskell parsing Error Variable Rather Env Expected Error in simple haskell program with generic data type I'm writing a generic interpreter in Haskell but I have a problem wit...	[ -0.0091552734375, -0.00482177734375, -0.01080322265625, 0.015869140625, 0.007476806640625, 0.0164794921875, -0.004302978515625, 0.01141357421875, -0.0003185272216796875, -0.0203857421875, -0.00762939453125, -0.033447265625, -0.00823974609375, -0.0262451171875, -0.009765625, 0.002487182...	[ 212059, 23, 8781, 1556, 142508, 1528, 678, 189534, 2053, 10644, 29481, 56, 123309, 28966, 366, 84572, 2886, 152201, 357, 334, 60075, 13, 32562, 20625, 2967, 80934, 111, 65998, 45646, 3871, 61924, 10778, 153210, 32036, 33022, 25632, 4358, 1297...	[ 0.201904296875, 0.059783935546875, 0.1761474609375, 0.146728515625, 0.220947265625, 0.1505126953125, 0.048004150390625, 0.22119140625, 0.09033203125, 0.133544921875, 0.15771484375, 0.071044921875, 0.117919921875, 0.0972900390625, 0.08251953125, 0.166259765625, 0.130126953125, 0.122...	embed
68186871_c1	68186871	haskell	1	(fromString "Some error occured.") This can result in fairly significantly less cluttered code due to these conversions being elided, however, in a fairly similar and common case, where operations applied to the string literal force it to be typed as a String , this benefit is lost. For example, consider: import quali...	(fromString "Some error occured.") This can result in fairly significantly less cluttered code due to these conversions being elided, however, in a fairly similar and common case, where operations applied to the string literal force it to be typed as a String , this benefit is lost. For example, consider: import quali...	[ -0.005035400390625, -0.00445556640625, -0.0244140625, 0.0159912109375, 0.0191650390625, 0.004119873046875, -0.000759124755859375, -0.0235595703125, -0.0013275146484375, -0.01409912109375, 0.006622314453125, -0.033447265625, 0.01904296875, -0.0034027099609375, 0.00323486328125, -0.00469...	[ 161063, 71713, 214, 8912, 282, 18499, 74918, 297, 5, 3293, 831, 16750, 180663, 207583, 40715, 29786, 3055, 18151, 142477, 15296, 48141, 49903, 21373, 39210, 41018, 190659, 79315, 15659, 289, 37772, 10644, 71, 237, 10, 23351, 68073, 72856, 169...	[ 0.1221923828125, 0.11865234375, 0.07281494140625, 0.06915283203125, 0.09503173828125, 0.263671875, 0.1802978515625, 0.1187744140625, 0.00128173828125, 0.0306549072265625, 0.06036376953125, 0.0804443359375, 0.027191162109375, 0.0684814453125, 0.0936279296875, 0.130126953125, 0.1457519...	embed
62362053_c0	62362053	haskell	0	Title: How to convert Either to MonadThrow Problem title: How to convert Either to MonadThrow Tags: monads, haskell, exception, either, types Problem: How to convert Either to MonadThrow I have a function that handles errors via Either : funErrViaEither :: a -> Either SomeException b I want to use this function in anot...	How to convert Either to MonadThrow How to convert Either to MonadThrow monads haskell exception either types SomeException MyCustomException How Either MonadThrow Left How to convert Either to MonadThrow I have a function that handles errors via Either : I want to use this function in another function that should be m...	[ -0.011962890625, 0.00445556640625, -0.0027008056640625, -0.0115966796875, 0.01019287109375, 0.0032501220703125, -0.00885009765625, -0.0242919921875, 0.01312255859375, -0.016845703125, -0.0064697265625, -0.00457763671875, 0.00677490234375, -0.017333984375, 0.0169677734375, -0.0344238281...	[ 11249, 96760, 4565, 9319, 47, 60331, 71, 20800, 15555, 2667, 712, 1556, 142508, 131527, 40101, 52895, 31384, 19279, 63928, 2646, 223, 5928, 636, 2480, 32354, 34831, 18499, 1829, 3444, 4527, 1286, 110677, 30646, 347, 959, 9969, 1340, 10644, ...	[ 0.04327392578125, 0.1470947265625, 0.1312255859375, 0.2489013671875, 0.086669921875, 0.1611328125, 0.1085205078125, 0.140869140625, 0.2119140625, 0.088134765625, 0.1102294921875, 0.0723876953125, 0.1763916015625, 0.157958984375, 0.058837890625, 0.12890625, 0.1009521484375, 0.031066...	embed
39215958_c0	39215958	haskell	0	Title: Data Constructor Limitations Problem title: Data Constructor Limitations Tags: haskell Problem: Data Constructor Limitations I have data structures as such: data IfTree = If Expr Statement IfTree \| Else Statement \| EndIf data Statement = IfStatement IfTree What is want is to make it impossible to do any of these...	Data Constructor Limitations Data Constructor Limitations haskell Data Constructor Limitations IfTree Expr Statement EndIf IfStatement Maybe Stat IfStat IfElseStat Data Constructor Limitations I have data structures as such: data IfTree = If Expr Statement IfTree \| Else Statement \| EndIf data Statement = IfStatement If...	[ 0.0115966796875, 0.020751953125, -0.0103759765625, 0.01806640625, 0.01611328125, 0.0045166015625, -0.006256103515625, 0.01025390625, 0.0096435546875, -0.0137939453125, 0.0012054443359375, -0.0179443359375, 0.033935546875, 0.006866455078125, -0.003814697265625, 0.0016021728515625, 0.0...	[ 11809, 82084, 18770, 125177, 21094, 1556, 142508, 4263, 62731, 60075, 42, 22836, 18878, 91306, 135206, 5911, 83425, 23888, 7623, 2053, 45646, 13, 540, 3444, 3249, 69201, 54, 6097, 162515, 5608, 4734, 19048, 5646, 107419, 831, 1274, 64549, 252...	[ 0.1474609375, 0.21826171875, 0.171875, 0.2237548828125, 0.040802001953125, 0.1212158203125, 0.21142578125, 0.2232666015625, 0.2249755859375, 0.1151123046875, 0.140380859375, 0.1754150390625, 0.1138916015625, 0.181396484375, 0.2076416015625, 0.1273193359375, 0.08251953125, 0.1668701...	embed
22637515_c0	22637515	haskell	0	Title: How is Ratio implemented in Haskell? Problem title: How is Ratio implemented in Haskell? Tags: haskell Problem: How is Ratio implemented in Haskell? This is something I have been confused about for a while and I am not sure how I can learn more about it. Let's say I have the following program: main :: IO () main...	How is Ratio implemented in Haskell? How is Ratio implemented in Haskell? haskell How Ratio Haskell How is Ratio implemented in Haskell? This is something I have been confused about for a while and I am not sure how I can learn more about it. Let's say I have the following program: If I run this with the input 6 and 2 ...	[ -0.009033203125, 0.014892578125, 0.01556396484375, -0.00238037109375, 0.032470703125, 0.0096435546875, -0.00144195556640625, -0.00274658203125, 0.005126953125, -0.006195068359375, 0.0164794921875, -0.0301513671875, 0.0191650390625, -0.0103759765625, -0.0186767578125, 0.00701904296875, ...	[ 11249, 83, 2552, 5565, 29479, 297, 23, 20625, 142508, 1556, 55681, 30698, 1528, 11675, 107730, 305, 136, 116, 28412, 138, 1745, 106, 6275, 162365, 2320, 53383, 91853, 390, 22109, 71, 7639, 1379, 18811, 168487, 7464, 26244, 49128, 2053, 6454...	[ 0.1279296875, 0.0673828125, 0.1971435546875, 0.27880859375, 0.221435546875, 0.0946044921875, 0.10113525390625, 0.16748046875, 0.258544921875, 0.1348876953125, 0.050048828125, 0.00506591796875, 0.07635498046875, 0.07745361328125, 0.1318359375, 0.1024169921875, 0.06689453125, 0.09216...	embed
49365698_c0	49365698	haskell	0	Title: Haskell recursive function that returns number strings, Prelude.read: no parse Problem title: Haskell recursive function that returns number strings, Prelude.read: no parse Tags: string, recursion, numbers, haskell Problem: Haskell recursive function that returns number strings, Prelude.read: no parse I'm new at...	Haskell recursive function that returns number strings, Prelude.read: no parse Haskell recursive function that returns number strings, Prelude.read: no parse string recursion numbers haskell Haskell Prelude.read Integer n-1 Haskell recursive function that returns number strings, Prelude.read: no parse I'm new at Haskel...	[ -0.0031280517578125, -0.00433349609375, 0.000293731689453125, 0.01385498046875, 0.007080078125, 0.027587890625, 0.007293701171875, -0.031005859375, -0.00836181640625, 0.005706787109375, -0.0152587890625, -0.04541015625, 0.005859375, 0.0022430419921875, 0.006561279296875, -0.01098632812...	[ 20625, 142508, 195625, 5844, 32354, 30646, 14012, 79315, 1914, 822, 112, 39116, 110, 366, 184, 1830, 101935, 1556, 44401, 5759, 3525, 56037, 31577, 6493, 2198, 532, 242810, 757, 2389, 106, 206808, 116, 138, 363, 28350, 5443, 63928, 19273, 1...	[ 0.12158203125, 0.1968994140625, 0.21337890625, 0.1158447265625, 0.1346435546875, 0.1434326171875, 0.136474609375, 0.1844482421875, 0.11474609375, 0.213134765625, 0.16455078125, 0.238037109375, 0.1439208984375, 0.178955078125, 0.15576171875, 0.05712890625, 0.110107421875, 0.09741210...	embed
801785_c0	801785	haskell	0	Title: Should I use GHC Haskell extensions or not? Problem title: Should I use GHC Haskell extensions or not? Tags: ghc, haskell Problem: Should I use GHC Haskell extensions or not? As I am learning Haskell, I see that there is a lot of language extensions used in real life code. As a beginner, should I learn to use th...	Should I use GHC Haskell extensions or not? Should I use GHC Haskell extensions or not? ghc haskell Should GHC Haskell Should I use GHC Haskell extensions or not? As I am learning Haskell, I see that there is a lot of language extensions used in real life code. As a beginner, should I learn to use them, or should I avo...	[ -0.00096893310546875, 0.01080322265625, 0.034912109375, -0.00080108642578125, 0.003692626953125, 0.00439453125, -0.024658203125, -0.01153564453125, -0.01080322265625, -0.0244140625, -0.006072998046875, -0.0267333984375, 0.0106201171875, 0.0014190673828125, -0.01495361328125, 0.00735473...	[ 151117, 4527, 527, 73265, 20625, 142508, 111938, 7, 959, 87, 31380, 238, 1556, 52080, 5915, 46876, 11814, 2773, 6897, 18151, 9842, 5608, 30698, 71864, 11034, 36356, 112793, 16193, 17475, 98169, 52922, 4588, 191, 130812, 26908, 17368, 14315, 1...	[ 0.1158447265625, 0.1072998046875, 0.10089111328125, 0.20751953125, 0.140625, 0.1988525390625, 0.202392578125, 0.028167724609375, 0.06005859375, 0.014251708984375, 0.1156005859375, 0.0927734375, 0.129638671875, 0.04962158203125, 0.02984619140625, 0.1658935546875, 0.0728759765625, 0....	embed
64898375_c0	64898375	haskell	0	Title: Haskell - List of combinations of elements from list of lists Problem title: Haskell - List of combinations of elements from list of lists Tags: functional-programming, haskell, combinatorics, list-comprehension, nested-lists Problem: Haskell - List of combinations of elements from list of lists Say I have some ...	Haskell - List of combinations of elements from list of lists Haskell - List of combinations of elements from list of lists functional-programming haskell combinatorics list-comprehension nested-lists list Haskell Haskell - List of combinations of elements from list of lists Say I have some list of lists [[a, b], [c], ...	[ -0.0172119140625, 0.033203125, -0.0130615234375, -0.001495361328125, 0.005828857421875, 0.03125, -0.01263427734375, -0.017578125, -0.006439208984375, -0.0267333984375, -0.01287841796875, -0.015625, 0.024658203125, 0.0166015625, -0.035888671875, 0.006927490234375, 0.01287841796875, ...	[ 20625, 142508, 32036, 162515, 7, 80854, 1295, 5303, 111, 123309, 28966, 1556, 22321, 3826, 4692, 3220, 8512, 71, 6562, 20, 765, 876, 28, 1238, 831, 2499, 140909, 17497, 16610, 525, 1380, 5117, 3444, 139392, 756, 23, 2046, 501, 104, 151134...	[ 0.1368408203125, 0.25439453125, 0.153564453125, 0.256591796875, 0.07611083984375, 0.19580078125, 0.1142578125, 0.2232666015625, 0.06787109375, 0.1141357421875, 0.08544921875, 0.127685546875, 0.1630859375, 0.059112548828125, 0.02325439453125, 0.040313720703125, 0.135986328125, 0.008...	embed
36878083_c1	36878083	haskell	1	.map (**2) jf1 :: forall a. (a ~ CDouble) => V.Vector a -> V.Vector (V.Vector a) jf1 = AD.jacobian go where go :: forall t. (AD.Scalar t ~ a, AD.Mode t) => V.Vector t -> V.Vector t go x = f1 (V.map AD.auto x) instance AD.Mode CDouble where type Scalar CDouble = CDouble -- isKnownConstant _ = True -- isKnownZero x = 0 =...	.map (**2) jf1 :: forall a. (a ~ CDouble) => V.Vector a -> V.Vector (V.Vector a) jf1 = AD.jacobian go where go :: forall t. (AD.Scalar t ~ a, AD.Mode t) => V.Vector t -> V.Vector t go x = f1 (V.map AD.auto x) instance AD.Mode CDouble where type Scalar CDouble = CDouble -- isKnownConstant _ = True -- isKnownZero x = 0 =...	[ -0.000823974609375, 0.0198974609375, -0.0185546875, -0.00689697265625, 0.00531005859375, 0.003936767578125, -0.0020294189453125, 0.00506591796875, -0.00408935546875, -0.03857421875, -0.0108642578125, 0.01190185546875, -0.01495361328125, 0.00775146484375, -0.006072998046875, -0.00280761...	[ 5, 62346, 25442, 10461, 39271, 418, 1984, 100, 5584, 10, 11, 7915, 796, 2661, 310, 26455, 18770, 33079, 856, 19831, 145, 587, 62806, 738, 7440, 808, 12351, 408, 320, 9083, 1022, 1238, 8913, 110527, 10644, 81543, 83, 35613, 42539, 87599, ...	[ 0.1038818359375, 0.2421875, 0.0543212890625, 0.154296875, 0.2181396484375, 0.1343994140625, 0.032501220703125, 0.06634521484375, 0.1656494140625, 0.09564208984375, 0.050048828125, 0.073486328125, 0.191650390625, 0.1702880859375, 0.161865234375, 0.1658935546875, 0.1710205078125, 0.0...	embed
20861205_c1	20861205	haskell	1	I've tried to force values after decoding them (using deepseq), I've tried adding bangs to data types, but this hasn't really helped. I've tried copying all bytestrings I keep in the file structure, which brought down the memory usage a bit, but it's still unacceptably high, especially when I want to analyze the entir...	I've tried to force values after decoding them (using deepseq), I've tried adding bangs to data types, but this hasn't really helped. I've tried copying all bytestrings I keep in the file structure, which brought down the memory usage a bit, but it's still unacceptably high, especially when I want to analyze the entir...	[ 0.0286865234375, 0.0185546875, -0.01361083984375, 0.0025634765625, 0.005584716796875, -0.0081787109375, -0.00897216796875, 0.01007080078125, 0.01519775390625, -0.01953125, 0.0162353515625, -0.00188446044921875, 0.01312255859375, 0.0037841796875, -0.0034637451171875, 0.0218505859375, ...	[ 272, 37842, 47, 37772, 142424, 7103, 8, 587, 6238, 53894, 184, 864, 154107, 11339, 7, 2053, 52895, 6183, 104902, 43658, 390, 6954, 46828, 13695, 11435, 45646, 7565, 98323, 127689, 4785, 7464, 135372, 11192, 7968, 64194, 3509, 5955, 12689, 1...	[ 0.001953125, 0.107421875, 0.024200439453125, 0.2044677734375, 0.21630859375, 0.059051513671875, 0.145263671875, 0.1724853515625, 0.0220489501953125, 0.08734130859375, 0.0689697265625, 0.1221923828125, 0.070068359375, 0.1846923828125, 0.001953125, 0.0821533203125, 0.1759033203125, 0...	embed
44557129_c0	44557129	haskell	0	Title: Generic Lift Class Problem title: Generic Lift Class Tags: monad-transformers, haskell Problem: Generic Lift Class I've just hacked up the following class as follows: {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE MultiParamTypeClasses #-} {-# LANGUAGE FlexibleInstances #-} import Control.Monad.Trans.Class (MonadTra...	Generic Lift Class Generic Lift Class monad-transformers haskell Control.Monad.Trans.Class Generic Lift LANGUAGE TypeFamilies MultiParamTypeClasses FlexibleInstances MonadTrans GenericLift Monad Generic Lift Class I've just hacked up the following class as follows: This allows lifting an arbitrary number of levels, whi...	[ -0.0118408203125, 0.0123291015625, 0.01385498046875, -0.01336669921875, 0.01165771484375, -0.0057373046875, -0.00567626953125, -0.025390625, 0.006378173828125, 0.000476837158203125, 0.0162353515625, -0.01611328125, -0.001861572265625, -0.00051116943359375, -0.010498046875, 0.0047302246...	[ 88342, 1771, 166562, 35014, 2667, 712, 215175, 1314, 1556, 142508, 27131, 46674, 62624, 140803, 3358, 98064, 60457, 1191, 19335, 55292, 196707, 180842, 2661, 116071, 60331, 71, 9506, 2480, 1660, 256, 76622, 1257, 25632, 18507, 28960, 3293, 1148...	[ 0.1934814453125, 0.073974609375, 0.263916015625, 0.2442626953125, 0.1131591796875, 0.12451171875, 0.1907958984375, 0.0265350341796875, 0.0941162109375, 0.205078125, 0.12548828125, 0.0684814453125, 0.1258544921875, 0.1781005859375, 0.0069580078125, 0.11083984375, 0.10552978515625, 0...	embed
69794379_c0	69794379	haskell	0	Title: Haskell Polymorphism on Datatype Problem title: Haskell Polymorphism on Datatype Tags: function, haskell Problem: Haskell Polymorphism on Datatype I want to define a polymorphic datatype to represent expressions involving addition, multiplication and numbers data Expr = Number (Integer, Double) \| Plus Expr Expr ...	Haskell Polymorphism on Datatype Haskell Polymorphism on Datatype function haskell Haskell Polymorphism Datatype Expr Number Integer Double Plus Times Show expr1 expr2 expr3 testEval1 Expected testEval2 Haskell Polymorphism on Datatype I want to define a polymorphic datatype to represent expressions involving addition,...	[ -0.00162506103515625, 0.0036468505859375, 0.01953125, 0.0167236328125, 0.0108642578125, 0.0238037109375, 0.0128173828125, -0.00075531005859375, -0.00469970703125, -0.0294189453125, 0.0021209716796875, -0.038330078125, -0.0078125, -0.00872802734375, -0.01348876953125, 0.01092529296875, ...	[ 20625, 142508, 63306, 178851, 8780, 98, 11809, 50986, 32354, 1556, 60075, 42, 103332, 44401, 107172, 8183, 19114, 17367, 14700, 418, 304, 363, 3034, 1405, 3444, 61924, 10, 35874, 1771, 2053, 33636, 125195, 3784, 66044, 127664, 136, 101935, 25...	[ 0.156494140625, 0.24169921875, 0.2412109375, 0.265625, 0.107666015625, 0.084716796875, 0.1419677734375, 0.2900390625, 0.1337890625, 0.1331787109375, 0.1246337890625, 0.116943359375, 0.162109375, 0.1646728515625, 0.124267578125, 0.1617431640625, 0.185302734375, 0.113525390625, 0.0...	embed
5535728_c0	5535728	haskell	0	Title: Specify arch in GHC? Problem title: Specify arch in GHC? Tags: ncurses, ghc, haskell, x86, x86-64 Problem: Specify arch in GHC? I'm writing a multiplatform ncurses text adventure game. The required C library, ncursesw, is configured for x86, but my OS is Mac OS X 10.6.6 x86_64. ghc --make -o rogue rogue.hs [1 of...	Specify arch in GHC? Specify arch in GHC? ncurses ghc haskell x86 x86-64 Specify GHC rogue.hs Compiling Dungeon Dungeon.hs Dungeon.o Main rogue.o Linking libncursesw.dylib i386 x86 x86-64 Specify arch in GHC? I'm writing a multiplatform ncurses text adventure game. The required C library, ncursesw, is configured for x8...	[ -0.009521484375, 0.00823974609375, 0.00311279296875, 0.00110626220703125, 0.00004100799560546875, -0.00811767578125, -0.0216064453125, -0.01416015625, -0.011962890625, 0.01336669921875, 0.004119873046875, -0.0341796875, -0.01513671875, -0.006317138671875, -0.0262451171875, -0.005615234...	[ 24990, 40383, 187, 206, 23, 527, 73265, 653, 48650, 90, 31380, 238, 1556, 142508, 15276, 13307, 2062, 6261, 127, 15612, 49725, 125669, 13, 191, 31, 12321, 12779, 25474, 434, 5612, 105742, 32562, 6024, 172121, 7986, 156578, 6712, 56065, 313,...	[ 0.1805419921875, 0.1383056640625, 0.181640625, 0.1949462890625, 0.1085205078125, 0.11767578125, 0.25048828125, 0.046844482421875, 0.197265625, 0.12060546875, 0.1123046875, 0.1160888671875, 0.08447265625, 0.1756591796875, 0.210205078125, 0.1702880859375, 0.07879638671875, 0.17407226...	embed
55835048_c0	55835048	haskell	0	Title: putStrLn etc. not showing because of using map with a function which uses IO Monads? Problem title: putStrLn etc. not showing because of using map with a function which uses IO Monads? Tags: haskell Problem: putStrLn etc. not showing because of using map with a function which uses IO Monads? I want to write a fu...	putStrLn etc. not showing because of using map with a function which uses IO Monads? putStrLn etc. not showing because of using map with a function which uses IO Monads? haskell map Monads All n-1 n-2 putStrLn etc. not showing because of using map with a function which uses IO Monads? I want to write a function which r...	[ 0.0108642578125, -0.003173828125, 0.0003566741943359375, -0.00142669677734375, -0.0098876953125, 0.01190185546875, 0.0196533203125, -0.01507568359375, 0.015869140625, -0.027099609375, -0.0025482177734375, -0.018310546875, 0.0033416748046875, 0.024658203125, 0.0164794921875, -0.01226806...	[ 3884, 71713, 866, 19, 3021, 959, 141377, 6637, 17368, 22288, 678, 32354, 4527, 17780, 60331, 6468, 1556, 142508, 3164, 653, 5759, 5428, 87, 3444, 33022, 30646, 1492, 96759, 101935, 140909, 12638, 14012, 42518, 927, 3698, 20990, 52544, 18151, ...	[ 0.20361328125, 0.22802734375, 0.136962890625, 0.161376953125, 0.0167694091796875, 0.1201171875, 0.1866455078125, 0.0341796875, 0.05364990234375, 0.191650390625, 0.060760498046875, 0.2001953125, 0.0538330078125, 0.2115478515625, 0.16845703125, 0.1397705078125, 0.0999755859375, 0.246...	embed
10689358_c0	10689358	haskell	0	Title: Haskell sublists Problem title: Haskell sublists Tags: haskell Problem: Haskell sublists I have to make a function that finds specific sublists. function :: Integer -> Integer -> [[Integer]] function n m = … If m is smaller then n the program exits. If the (mod (sum [1..n]) m) /= 0 then again error. Otherwise th...	Haskell sublists Haskell sublists haskell Haskell Integer Haskell sublists I have to make a function that finds specific sublists. If m is smaller then n the program exits. If the (mod (sum [1..n]) m) /= 0 then again error. Otherwise the program should find sublists. And the primary list is generated from [1..n] For ex...	[ -0.0167236328125, 0.01068115234375, 0.02880859375, -0.004730224609375, -0.0023651123046875, 0.019775390625, -0.0045166015625, 0.00014495849609375, 0.00070953369140625, 0.002838134765625, 0.0069580078125, -0.0206298828125, 0.01904296875, -0.01007080078125, -0.004425048828125, 0.00309753...	[ 20625, 142508, 1614, 6562, 1556, 44401, 7, 87, 765, 3249, 32354, 7413, 29458, 4263, 347, 83, 164917, 653, 70, 1528, 82230, 13415, 11832, 19, 1369, 757, 13438, 18499, 158978, 5303, 139392, 1295, 68252, 5, 27781, 2174, 101935, 2203, 305, 13...	[ 0.1561279296875, 0.2237548828125, 0.2344970703125, 0.283447265625, 0.153564453125, 0.187744140625, 0.02630615234375, 0.00469970703125, 0.0291290283203125, 0.03289794921875, 0.1427001953125, 0.1058349609375, 0.157958984375, 0.01220703125, 0.1383056640625, 0.055511474609375, 0.19189453...	embed
35353404_c0	35353404	haskell	0	Title: How to code the output value in Haskell that equals a function? Problem title: How to code the output value in Haskell that equals a function? Tags: haskell Problem: How to code the output value in Haskell that equals a function? I have a function that finds empty cells in a chess game I am making, and I want to...	How to code the output value in Haskell that equals a function? How to code the output value in Haskell that equals a function? haskell How Haskell GameState Player Cell Black How to code the output value in Haskell that equals a function? I have a function that finds empty cells in a chess game I am making, and I want...	[ 0.0021820068359375, -0.006011962890625, 0.0185546875, 0.0191650390625, 0.01025390625, 0.005218505859375, 0.006683349609375, 0.002532958984375, -0.01043701171875, -0.0084228515625, 0.0020294189453125, 0.030029296875, 0.0062255859375, -0.004241943359375, -0.01092529296875, -0.00300598144...	[ 11249, 47, 18151, 140992, 34292, 23, 20625, 142508, 450, 105950, 7, 32354, 1556, 13547, 135206, 60560, 80743, 10074, 70, 7413, 201505, 38750, 290, 6712, 20662, 3444, 91995, 126371, 3934, 13162, 14037, 441, 88510, 18499, 18, 765, 37076, 22304,...	[ 0.05804443359375, 0.019378662109375, 0.2415771484375, 0.2220458984375, 0.1776123046875, 0.049713134765625, 0.1510009765625, 0.242919921875, 0.047454833984375, 0.1669921875, 0.0751953125, 0.2047119140625, 0.1307373046875, 0.07757568359375, 0.1151123046875, 0.13427734375, 0.16467285156...	embed
35828128_c0	35828128	haskell	0	Title: Lifted „if“-function behaves unexpectedly Problem title: Lifted „if“-function behaves unexpectedly Tags: io-monad, monads, lifting, haskell, applicative Problem: Lifted „if“-function behaves unexpectedly in my program I use a function if' defined in one of the modules instead of the built-in if-then-else constru...	Lifted „if“-function behaves unexpectedly Lifted „if“-function behaves unexpectedly io-monad monads lifting haskell applicative Lifted Bool action1 action2 Main Lifted „if“-function behaves unexpectedly in my program I use a function if' defined in one of the modules instead of the built-in if-then-else construct. It i...	[ 0.0029754638671875, 0.01416015625, 0.013671875, 0.01373291015625, 0.0220947265625, 0.0194091796875, 0.01104736328125, -0.0037994384765625, -0.01141357421875, -0.0081787109375, 0.0279541015625, 0.0093994140625, -0.027099609375, 0.00180816650390625, 0.0162353515625, -0.009521484375, -0...	[ 166562, 297, 3190, 137175, 186, 68991, 241957, 137, 22995, 3796, 712, 2667, 177691, 1556, 142508, 41816, 2460, 929, 22631, 304, 7, 1528, 4527, 32354, 2174, 25, 61924, 1632, 88996, 64457, 88303, 73, 92733, 5557, 64549, 686, 43240, 5885, 3687...	[ 0.259765625, 0.159912109375, 0.261962890625, 0.2076416015625, 0.050567626953125, 0.1761474609375, 0.17724609375, 0.026763916015625, 0.1527099609375, 0.0721435546875, 0.1785888671875, 0.1336669921875, 0.2132568359375, 0.077880859375, 0.210205078125, 0.11962890625, 0.10260009765625, ...	embed
14948765_c0	14948765	haskell	0	Title: Haskell Couldn't match expected type 'String' with actual type 'Char' Problem title: Haskell Couldn't match expected type 'String' with actual type 'Char' Tags: string, haskell, char Problem: Haskell Couldn't match expected type 'String' with actual type 'Char' I...	Haskell Couldn't match expected type 'String' with actual type 'Char' Haskell Couldn't match expected type 'String' with actual type 'Char' string haskell char Haskell Couldn Char Integer Haskell Couldn't match expected type 'String' with actual type 'Char' I am wonderi...	[ -0.0023193359375, -0.017578125, 0.002777099609375, 0.006256103515625, -0.0106201171875, 0.00732421875, -0.0172119140625, -0.02783203125, -0.000400543212890625, 0.0263671875, 0.0021209716796875, -0.02685546875, 0.0234375, 0.00506591796875, 0.0118408203125, -0.030517578125, -0.00032043...	[ 20625, 142508, 191147, 3768, 18, 14858, 84751, 10644, 71713, 214, 678, 8561, 84068, 79315, 1556, 21441, 19, 21656, 44401, 149016, 15400, 903, 18499, 95486, 96760, 1295, 892, 1505, 47, 764, 425, 34292, 11782, 4358, 56, 142477, 32354, 2811, 3...	[ 0.1490478515625, 0.2398681640625, 0.1258544921875, 0.1353759765625, 0.1011962890625, 0.1920166015625, 0.1866455078125, 0.174072265625, 0.1571044921875, 0.0960693359375, 0.0841064453125, 0.1507568359375, 0.2125244140625, 0.1806640625, 0.118896484375, 0.1627197265625, 0.06561279296875,...	embed
38594469_c0	38594469	haskell	0	Title: What if I know the result is an integer, but ghc is not so sure? Problem title: What if I know the result is an integer, but ghc is not so sure? Tags: haskell Problem: What if I know the result is an integer, but ghc is not so sure? Let's say I have this piece of code: demo::Integer -> Integer demo x = x*(x+1)/2...	What if I know the result is an integer, but ghc is not so sure? What if I know the result is an integer, but ghc is not so sure? haskell a What demo::Integer Integer Compiling Main debug.hs debug.o debug.hs:2:17 Fractional Possible What if I know the result is an integer, but ghc is not so sure? Let's say I have this ...	[ -0.0179443359375, 0.01446533203125, 0.003143310546875, -0.003387451171875, 0.002288818359375, 0.03466796875, -0.016357421875, -0.00677490234375, -0.003936767578125, -0.01519775390625, -0.01141357421875, -0.017333984375, -0.0133056640625, 0.00823974609375, 0.0145263671875, -0.0131225585...	[ 4865, 2174, 87, 3714, 16750, 83, 142, 892, 1505, 1284, 31380, 238, 959, 221, 9077, 1556, 142508, 53397, 4153, 67, 44401, 15612, 49725, 12321, 8, 85779, 127, 31, 22950, 7868, 10763, 289, 115861, 2661, 63847, 111, 18151, 123019, 237, 1022, ...	[ 0.03704833984375, 0.122314453125, 0.042633056640625, 0.1597900390625, 0.209228515625, 0.07354736328125, 0.060455322265625, 0.146240234375, 0.161865234375, 0.09271240234375, 0.10687255859375, 0.09130859375, 0.129638671875, 0.1131591796875, 0.1644287109375, 0.1146240234375, 0.206787109...	embed
43534944_c0	43534944	haskell	0	Title: Why does a recursive lazy list blow the stack in Scala? Problem title: Why does a recursive lazy list blow the stack in Scala? Tags: linked-list, lazy-evaluation, haskell, scala Problem: Why does a recursive lazy list blow the stack in Scala? I saw this snippet of Haskell in this answer by proud haskeller on Met...	Why does a recursive lazy list blow the stack in Scala? Why does a recursive lazy list blow the stack in Scala? linked-list lazy-evaluation haskell scala StackOverflowException Why Scala List x.head Why does a recursive lazy list blow the stack in Scala? I saw this snippet of Haskell in this answer by proud haskeller o...	[ -0.000461578369140625, 0.0145263671875, 0.006256103515625, -0.0030975341796875, 0.006988525390625, -0.0034332275390625, 0.005401611328125, 0.013916015625, 0.0107421875, -0.014404296875, 0.01239013671875, -0.01287841796875, 0.031005859375, 0.009521484375, 0.0216064453125, -0.00106048583...	[ 44084, 195625, 5844, 21, 3285, 5303, 102310, 177261, 152653, 11, 23, 3126, 297, 6562, 159258, 1556, 142508, 146232, 6512, 2594, 156673, 118664, 63928, 32036, 1022, 5, 31251, 14602, 70, 20625, 79961, 14191, 36939, 56367, 17569, 634, 217, 831, ...	[ 0.08447265625, 0.177490234375, 0.0963134765625, 0.14599609375, 0.1953125, 0.2027587890625, 0.240966796875, 0.21240234375, 0.216064453125, 0.1728515625, 0.0274810791015625, 0.06768798828125, 0.0195465087890625, 0.135498046875, 0.08233642578125, 0.0325927734375, 0.1942138671875, 0.16...	embed
10064758_c0	10064758	haskell	0	Title: Counting frequencies of enum values Problem title: Counting frequencies of enum values Tags: enums, haskell Problem: Counting frequencies of enum values Suppose I have an enum like data T = A \| B \| C deriving (Enum) and a list of enum values as input: [B, C, C, A, C, A, C] What I'm looking for is a function that...	Counting frequencies of enum values Counting frequencies of enum values enums haskell Counting Enum Word Counting frequencies of enum values Suppose I have an enum like and a list of enum values as input: What I'm looking for is a function that, given this input, returns how often each element occurs in the input. A si...	[ -0.00762939453125, -0.01123046875, -0.006317138671875, -0.00262451171875, -0.00262451171875, -0.0123291015625, -0.006378173828125, -0.019775390625, 0.00341796875, -0.01214599609375, 0.000583648681640625, 0.0027923583984375, 0.034423828125, 0.0478515625, -0.0169677734375, -0.01904296875...	[ 1311, 128396, 12478, 944, 117538, 111, 22, 316, 142424, 10321, 1556, 142508, 357, 22543, 1884, 5303, 107730, 16487, 100, 32354, 34475, 30646, 3642, 27983, 12638, 12830, 74918, 8781, 3173, 140992, 304, 106, 201, 64209, 43581, 51515, 33342, 432...	[ 0.134033203125, 0.1544189453125, 0.20947265625, 0.1798095703125, 0.08489990234375, 0.0567626953125, 0.1295166015625, 0.20166015625, 0.2078857421875, 0.1971435546875, 0.1439208984375, 0.224365234375, 0.13232421875, 0.17822265625, 0.1375732421875, 0.093994140625, 0.1644287109375, 0.0...	embed
12651735_c0	12651735	haskell	0	Title: How to collect output from pipes to file in Haskell Problem title: How to collect output from pipes to file in Haskell Tags: conduit, haskell Problem: How to collect output from pipes to file in Haskell I have a producer pipe and I have used the print pipe. I would like to write the output to a file. If I use Co...	How to collect output from pipes to file in Haskell How to collect output from pipes to file in Haskell conduit haskell pipes How Haskell test2file CB.sinkFile fn3 Couldn Pipe void-0.5.8:Data.Void.Void Data.Conduit.Internal.Pipe Data.ByteString.Internal.ByteString How to collect output from pipes to file in Haskell I h...	[ 0.01171875, 0.002960205078125, -0.01177978515625, 0.0234375, -0.014404296875, 0.0201416015625, -0.0247802734375, -0.026123046875, -0.018798828125, 0.0093994140625, -0.0081787109375, 0.010009765625, 0.0341796875, 0.01031494140625, 0.0031890869140625, -0.000614166259765625, -0.01397705...	[ 11249, 43799, 140992, 1295, 137158, 7, 47, 11435, 20625, 142508, 23, 120565, 1556, 3034, 304, 29822, 76984, 14068, 174350, 14783, 363, 191147, 93128, 13, 2292, 153451, 137989, 36635, 11809, 112061, 44851, 48672, 71713, 108558, 11814, 28412, 188...	[ 0.053955078125, 0.2225341796875, 0.2476806640625, 0.106689453125, 0.2235107421875, 0.08984375, 0.119140625, 0.23291015625, 0.1419677734375, 0.23046875, 0.011993408203125, 0.15087890625, 0.116943359375, 0.1209716796875, 0.0126953125, 0.1790771484375, 0.08447265625, 0.1136474609375, ...	embed
50581476_c1	50581476	haskell	1	ThenWait i = putStr (show i ++ " ") *> threadDelay 1000000 runLoop = sequence_ $ printThenWait <$> [1..] nothing _ = pure () handler e \| Just (e' :: IOError) <- fromException e = putStrLn "It's an IOError!" \| (Nothing :: Maybe IOError) <- fromException e = putStrLn "We got Nothing!" I'm a bit confused about the danger ...	ThenWait i = putStr (show i ++ " ") *> threadDelay 1000000 runLoop = sequence_ $ printThenWait <$> [1..] nothing _ = pure () handler e \| Just (e' :: IOError) <- fromException e = putStrLn "It's an IOError!" \| (Nothing :: Maybe IOError) <- fromException e = putStrLn "We got Nothing!" I'm a bit confused about the danger ...	[ 0.0030975341796875, 0.018310546875, 0.0125732421875, -0.02392578125, 0.01324462890625, 0.0252685546875, 0.0012359619140625, -0.0172119140625, 0.01434326171875, -0.03515625, 0.00823974609375, -0.013427734375, 0.00008487701416015625, -0.004241943359375, 0.0211181640625, -0.00726318359375...	[ 47009, 22489, 217, 17, 3884, 71713, 31374, 37223, 86997, 4657, 5259, 805, 28568, 11675, 15363, 2146, 944, 3650, 28412, 3957, 19, 33720, 34166, 35863, 28, 9563, 13, 17780, 18468, 31611, 1295, 63928, 23389, 3890, 5021, 64113, 83425, 12137, 41...	[ 0.175048828125, 0.242919921875, 0.2374267578125, 0.1329345703125, 0.077880859375, 0.1815185546875, 0.0712890625, 0.11083984375, 0.159912109375, 0.0789794921875, 0.228515625, 0.03472900390625, 0.1141357421875, 0.052734375, 0.035552978515625, 0.0792236328125, 0.040618896484375, 0.016...	embed
71618243_c1	71618243	haskell	1	m @d, a) fromObject o = do (msg::Word8, a) <- fromObject o when (msg /= msgId @m @d) (fail $ "Unexpected MESSAGE: " <> show msg) pure $ MyTagsMP a and before to write the same couple of instances for 'ResourcesM I was thinking - is it possible to reduce manual work - maybe with some generic? Actually I have more than T...	m @d, a) fromObject o = do (msg::Word8, a) <- fromObject o when (msg /= msgId @m @d) (fail $ "Unexpected MESSAGE: " <> show msg) pure $ MyTagsMP a and before to write the same couple of instances for 'ResourcesM I was thinking - is it possible to reduce manual work - maybe with some generic? Actually I have more than T...	[ -0.0179443359375, -0.01348876953125, -0.012451171875, -0.006622314453125, -0.00811767578125, 0.01141357421875, -0.003997802734375, 0.0179443359375, 0.00089263916015625, -0.034912109375, 0.0240478515625, -0.0157470703125, 0.0244140625, 0.005035400390625, -0.01165771484375, 0.01251220703...	[ 347, 1374, 10, 1295, 46471, 75161, 36, 2203, 54, 4432, 177, 164805, 1019, 3229, 68163, 568, 71, 120540, 14256, 83613, 276, 64397, 75930, 7639, 34166, 3650, 2646, 66448, 9088, 33022, 24941, 110527, 4332, 60427, 7, 594, 47644, 7722, 34390, ...	[ 0.08056640625, 0.043243408203125, 0.063232421875, 0.20166015625, 0.13671875, 0.21728515625, 0.1739501953125, 0.038116455078125, 0.1146240234375, 0.047637939453125, 0.10693359375, 0.10015869140625, 0.19921875, 0.0274658203125, 0.040283203125, 0.0150299072265625, 0.0693359375, 0.1746...	embed
75441647_c0	75441647	haskell	0	Title: How to run web server (Warp) in async/concurrent mode? Problem title: How to run web server (Warp) in async/concurrent mode? Tags: haskell, concurrency, haskell-warp, haskell-wai Problem: How to run web server (Warp) in async/concurrent mode? I'm using https://hackage.haskell.org/package/warp-3.3.24/docs/Network...	How to run web server (Warp) in async/concurrent mode? How to run web server (Warp) in async/concurrent mode? haskell concurrency haskell-warp haskell-wai How Warp Warp.run How to run web server (Warp) in async/concurrent mode? I'm using https://hackage.haskell.org/package/warp-3.3.24/docs/Network-Wai-Handler-Warp.html...	[ 0.0020599365234375, -0.007110595703125, -0.0159912109375, -0.0019378662109375, -0.02685546875, 0.0152587890625, -0.0038604736328125, -0.00927734375, -0.0033721923828125, -0.047119140625, 0.0045166015625, 0.0162353515625, 0.01220703125, 0.00933837890625, 0.0123291015625, 0.0018844604492...	[ 11249, 47, 11675, 1467, 10723, 71947, 254, 23, 10, 12654, 238, 2271, 163812, 13736, 1556, 142508, 108636, 982, 4205, 634, 14, 5550, 16428, 139509, 4588, 10557, 29102, 134693, 2357, 22489, 135679, 603, 6626, 12921, 11469, 98, 17287, 20697, 8...	[ 0.06170654296875, 0.004974365234375, 0.1629638671875, 0.1412353515625, 0.1962890625, 0.1734619140625, 0.2098388671875, 0.0577392578125, 0.052398681640625, 0.19921875, 0.086669921875, 0.08673095703125, 0.2587890625, 0.163818359375, 0.0946044921875, 0.2119140625, 0.1424560546875, 0.1...	embed
42195555_c1	42195555	haskell	1	, volume :: !Integer , adjClose :: !Double } instance FromNamedRecord StockInfo where parseNamedRecord m = StockInfo <$> m .: "Date" <> m .: "Open" <> m .: "High" <> m .: "Low" <> m .: "Close" <> m .: "Volume" <> m .: "Adj Close" instance ToNamedRecord StockInfo where toNamedRecord (StockInfo date open high low ...	, volume :: !Integer , adjClose :: !Double } instance FromNamedRecord StockInfo where parseNamedRecord m = StockInfo <$> m .: "Date" <> m .: "Open" <> m .: "High" <> m .: "Low" <> m .: "Close" <> m .: "Volume" <> m .: "Adj Close" instance ToNamedRecord StockInfo where toNamedRecord (StockInfo date open high low ...	[ -0.0174560546875, 0.015380859375, 0.00885009765625, 0.0289306640625, -0.000946044921875, 0.01300048828125, -0.01177978515625, 0.0045166015625, 0.0167236328125, 0.020751953125, -0.0185546875, -0.012451171875, 0.0205078125, -0.0040283203125, -0.0147705078125, 0.007080078125, -0.0207519...	[ 4, 21950, 1984, 711, 67, 1505, 606, 170, 59453, 34, 2661, 51912, 110527, 28090, 163612, 71, 4332, 32271, 68804, 93147, 7440, 366, 184, 347, 2203, 4369, 2740, 6, 5, 12, 86291, 58, 4426, 1639, 44, 103264, 163025, 15363, 434, 441, 73668, ...	[ 0.06707763671875, 0.25634765625, 0.0850830078125, 0.0673828125, 0.1082763671875, 0.072021484375, 0.0718994140625, 0.172119140625, 0.1610107421875, 0.0241851806640625, 0.053802490234375, 0.040252685546875, 0.253173828125, 0.1708984375, 0.1990966796875, 0.11962890625, 0.086669921875, ...	embed
8751188_c0	8751188	haskell	0	Title: Exceptions in Haskell Problem title: Exceptions in Haskell Tags: exception, haskell Problem: Exceptions in Haskell If I understood rightly, exceptions in Haskell basically intended to deal within IO monad. At least exception could be caught inside IO monad. But sometimes even pure functions may throw an exceptio...	Exceptions in Haskell Exceptions in Haskell exception haskell Exceptions Haskell Exceptions in Haskell If I understood rightly, exceptions in Haskell basically intended to deal within IO monad. At least exception could be caught inside IO monad. But sometimes even pure functions may throw an exception, e.g. read "..." ...	[ -0.0042724609375, 0.024658203125, -0.003570556640625, -0.0047607421875, 0.01544189453125, 0.0115966796875, -0.00007724761962890625, -0.006927490234375, -0.01251220703125, -0.005157470703125, 0.002716064453125, -0.026123046875, -0.00823974609375, -0.00958251953125, 0.0223388671875, -0.0...	[ 218288, 17514, 23, 20625, 142508, 131527, 1556, 217064, 7, 198343, 179140, 47, 35142, 28032, 17780, 2667, 712, 19713, 5809, 156892, 46132, 68018, 3853, 34166, 32354, 1543, 104250, 12301, 7673, 1984, 360, 18, 3220, 16454, 79315, 959, 33636, 89...	[ 0.2271728515625, 0.142822265625, 0.0826416015625, 0.1644287109375, 0.277099609375, 0.298583984375, 0.1324462890625, 0.016265869140625, 0.114013671875, 0.03668212890625, 0.10528564453125, 0.0130615234375, 0.11767578125, 0.1114501953125, 0.1915283203125, 0.10455322265625, 0.11791992187...	embed
64873882_c0	64873882	haskell	0	Title: haskell words from alphabet of a given length Problem title: haskell words from alphabet of a given length Tags: haskell Problem: haskell words from alphabet of a given length I have this function that generates a list of all words with a min length 0 and max length n, equals given as an input to the function: i...	haskell words from alphabet of a given length haskell words from alphabet of a given length haskell alphabet Data.List n-1 ch:w AAA BAA ABA BBA AAB BAB ABB BBB haskell words from alphabet of a given length I have this function that generates a list of all words with a min length 0 and max length n, equals given as an i...	[ -0.00121307373046875, 0.00164794921875, 0.002838134765625, 0.0032196044921875, 0.000751495361328125, 0.00689697265625, 0.0234375, 0.00004267692565917969, 0.005035400390625, -0.033203125, -0.003997802734375, -0.028564453125, 0.041259765625, 0.02197265625, -0.0115966796875, 0.00291442871...	[ 1556, 142508, 34153, 1295, 229231, 111, 34475, 140909, 11809, 154663, 653, 5759, 3863, 434, 155616, 8678, 284, 49068, 8031, 62, 11040, 59584, 22312, 32354, 139392, 5303, 756, 881, 757, 18389, 105950, 107730, 11675, 140992, 25632, 2967, 3688, ...	[ 0.18359375, 0.265869140625, 0.217529296875, 0.114501953125, 0.2235107421875, 0.081787109375, 0.117431640625, 0.1888427734375, 0.1202392578125, 0.13623046875, 0.0655517578125, 0.1365966796875, 0.1142578125, 0.124267578125, 0.2296142578125, 0.11328125, 0.043121337890625, 0.1368408203...	embed
32126423_c0	32126423	haskell	0	Title: Linking cabalized Haskell package to C program (undefined reference linker error) Problem title: Linking cabalized Haskell package to C program (undefined reference linker error) Tags: haskell, gcc, linker Problem: Linking cabalized Haskell package to C program (undefined reference linker error) Code signals: Li...	Linking cabalized Haskell package to C program (undefined reference linker error) Linking cabalized Haskell package to C program (undefined reference linker error) haskell gcc linker Linking Haskell m32 ParseInt.exe ParseInt.o hsbracket.o ia32 lHSarray-0.5.0.0-ghc7.8.3 lHSbin-package-db-0.0.0.0-ghc7.8.3 lHSbinary-0.7.1...	[ -0.002349853515625, 0.004364013671875, 0.006622314453125, 0.00537109375, -0.0038299560546875, 0.002349853515625, -0.0035858154296875, 0.014404296875, -0.0033111572265625, -0.014404296875, -0.016845703125, -0.050537109375, 0.007537841796875, 0.00323486328125, 0.004119873046875, -0.00427...	[ 12779, 214, 109524, 29367, 20625, 142508, 98169, 47, 313, 1528, 59437, 5983, 297, 91067, 3126, 56, 18499, 16, 1556, 22109, 238, 347, 6460, 2392, 184, 4153, 18, 5, 46480, 1096, 2844, 27853, 31, 5326, 96, 38131, 19305, 53, 9, 93645, 99929...	[ 0.2213134765625, 0.055145263671875, 0.2242431640625, 0.146240234375, 0.1824951171875, 0.2861328125, 0.2203369140625, 0.14697265625, 0.152099609375, 0.1732177734375, 0.0494384765625, 0.173095703125, 0.00152587890625, 0.2044677734375, 0.1917724609375, 0.1439208984375, 0.161865234375, ...	embed
58358574_c2	58358574	haskell	2	VWK KcI5tA8BLEhRBKJLjez6a7MLq7XZtp+yyOawwCBtkiBVZDKzRk4NN7NQBMYPHiZDFhXY+p9ff7F961vVcnl4R5I2ykJ5XFN7Ab7Gc61VoipNBKF+PDyztu5lfrSLT/wIwCxq0CAGtXHZTzqR2jtwQiXONma6hHpj9sLT7YaPxfTXuZdBGA02Wi7FS48YiTfj+i2Nhq tdhP5RC8mh2/Op7y0v6eAcWVLFT8D7kWX5S9mepp+C450MV6aWL1cGnvkxbwHtLW2B9AOkLeUd9KEDuh9fl/7CEj7YH5g+3r/lWfF9In7tPz6T4IIwBJO...	VWK KcI5tA8BLEhRBKJLjez6a7MLq7XZtp+yyOawwCBtkiBVZDKzRk4NN7NQBMYPHiZDFhXY+p9ff7F961vVcnl4R5I2ykJ5XFN7Ab7Gc61VoipNBKF+PDyztu5lfrSLT/wIwCxq0CAGtXHZTzqR2jtwQiXONma6hHpj9sLT7YaPxfTXuZdBGA02Wi7FS48YiTfj+i2Nhq tdhP5RC8mh2/Op7y0v6eAcWVLFT8D7kWX5S9mepp+C450MV6aWL1cGnvkxbwHtLW2B9AOkLeUd9KEDuh9fl/7CEj7YH5g+3r/lWfF9In7tPz6T4IIwBJO...	[ -0.0142822265625, 0.0184326171875, 0.002166748046875, -0.00732421875, 0.031005859375, 0.004669189453125, 0.01239013671875, 0.017822265625, 0.00408935546875, -0.0152587890625, 0.0093994140625, 0.019775390625, -0.02880859375, -0.00518798828125, 0.0147705078125, -0.018310546875, 0.01574...	[ 86779, 605, 341, 758, 125149, 45176, 39456, 47307, 15473, 143907, 85398, 16, 581, 177953, 83, 96436, 2661, 99, 432, 25160, 846, 4902, 28541, 25647, 28864, 26073, 7, 3000, 2298, 841, 3062, 254, 19279, 63928, 56504, 114211, 11249, 79794, 2062...	[ 0.208251953125, 0.1832275390625, 0.0257568359375, 0.0273284912109375, 0.050384521484375, 0.028533935546875, 0.0268096923828125, 0.00799560546875, 0.040985107421875, 0.036865234375, 0.007110595703125, 0.001800537109375, 0.02459716796875, 0.23974609375, 0.018310546875, 0.1512451171875, ...	embed
13319870_c1	13319870	haskell	1	generated the tarfile I uploaded to hackage using something other than cabal sdist , and that process left out ReadArgsSpec.hs . I altered my ReadArgs.cabal file before I ran cabal sdist in such a way as to exclude ReadArgsSpec.hs but failed to commit my change. Hackage removed ReadArgsSpec.hs from the package file. I...	generated the tarfile I uploaded to hackage using something other than cabal sdist , and that process left out ReadArgsSpec.hs . I altered my ReadArgs.cabal file before I ran cabal sdist in such a way as to exclude ReadArgsSpec.hs but failed to commit my change. Hackage removed ReadArgsSpec.hs from the package file. I...	[ 0.012939453125, 0.017578125, 0.0225830078125, -0.00750732421875, -0.01385498046875, 0.00127410888671875, -0.000545501708984375, 0.00457763671875, -0.01263427734375, 0.045654296875, 0.01165771484375, -0.01708984375, -0.0281982421875, 0.000324249267578125, 0.009765625, 0.00921630859375, ...	[ 139392, 2405, 29822, 70622, 85526, 4588, 3789, 109524, 91, 46295, 9433, 25737, 1810, 4764, 7614, 9405, 294, 47107, 127, 7, 37264, 408, 3571, 11435, 13028, 39041, 165523, 15549, 52922, 184750, 98169, 21455, 7722, 5062, 6626, 11389, 48903, 5701...	[ 0.0921630859375, 0.17724609375, 0.1781005859375, 0.142333984375, 0.181396484375, 0.1873779296875, 0.00201416015625, 0.18994140625, 0.0357666015625, 0.1536865234375, 0.03607177734375, 0.052886962890625, 0.0205841064453125, 0.1917724609375, 0.2064208984375, 0.1888427734375, 0.034454345...	embed
33707468_c0	33707468	haskell	0	Title: getting <<loop>> message when run haskell programme Problem title: getting <<loop>> message when run haskell programme Tags: haskell Problem: getting < > message when run haskell programme I have written code like this import System.Environment import Control.Exception import Data.List f ...	getting <<loop>> message when run haskell programme getting <<loop>> message when run haskell programme haskell Control.Exception System.Environment Data.List run.hs some_string some_over_arguments some_hardcoded_list getting < > message when run haskell programme I have written code like this b...	[ 0.01531982421875, 0.0003986358642578125, -0.027587890625, 0.01019287109375, 0.0107421875, 0.017578125, 0.00689697265625, 0.002349853515625, 0.005828857421875, -0.0247802734375, 0.0296630859375, -0.00848388671875, 0.0032501220703125, -0.0020599365234375, 0.01385498046875, -0.00442504882...	[ 20949, 28354, 5386, 26008, 3229, 11675, 1556, 142508, 26693, 27131, 63928, 12353, 686, 1900, 11809, 154663, 127, 7, 3060, 91693, 5465, 155937, 25612, 40899, 71, 6562, 4426, 977, 18151, 9969, 31577, 11343, 4734, 35166, 44691, 28994, 133, 27875...	[ 0.0718994140625, 0.259033203125, 0.05511474609375, 0.1697998046875, 0.0838623046875, 0.1805419921875, 0.1591796875, 0.2255859375, 0.1744384765625, 0.104736328125, 0.1160888671875, 0.0242919921875, 0.00091552734375, 0.02703857421875, 0.04803466796875, 0.0750732421875, 0.098388671875, ...	embed
38309347_c0	38309347	haskell	0	Title: llvm-general-pure fail at compilation Problem title: llvm-general-pure fail at compilation Tags: cabal, haskell, llvm Problem: llvm-general-pure fail at compilation I want to install the "llvm-general" package from cabal. But the "llvm-general-pure" (dependencies) fail at compilation : [19 of 28] Compiling LLVM....	llvm-general-pure fail at compilation llvm-general-pure fail at compilation cabal haskell llvm Compiling LLVM.General.Internal.PrettyPrint LLVM General Internal PrettyPrint.hs PrettyPrint.o PrettyPrint.hs:166:19 DataD TyConI llvm-general-pure fail at compilation I want to install the "llvm-general" package from cabal. ...	[ -0.0159912109375, 0.0213623046875, -0.000591278076171875, -0.007232666015625, -0.003448486328125, -0.0054931640625, -0.00872802734375, -0.015869140625, -0.0086669921875, -0.0118408203125, 0.01470947265625, -0.03759765625, 0.004241943359375, 0.01177978515625, 0.016845703125, 0.00390625,...	[ 96, 3723, 39, 180300, 4717, 35782, 99, 98352, 13, 109524, 1556, 142508, 15612, 99954, 47599, 159342, 44851, 19273, 15145, 112079, 9082, 106745, 197570, 127, 18, 31, 156215, 23988, 11809, 397, 8064, 11935, 568, 3444, 20600, 1181, 334, 98169, ...	[ 0.03753662109375, 0.177001953125, 0.2010498046875, 0.1927490234375, 0.1810302734375, 0.206787109375, 0.0889892578125, 0.226318359375, 0.09033203125, 0.2154541015625, 0.0736083984375, 0.1846923828125, 0.114013671875, 0.10400390625, 0.22802734375, 0.1436767578125, 0.03216552734375, 0...	embed
42823762_c0	42823762	haskell	0	Title: remove type from type list haskell Problem title: remove type from type list haskell Tags: haskell, list, types Problem: remove type from type list haskell So i'm new to Haskell, and I was wondering if anyone could help me. I've got a list of a custom data type like so: type Title = String type Manager = String ...	remove type from type list haskell remove type from type list haskell haskell list types type Title Manager Year Fan Album remove type from type list haskell So i'm new to Haskell, and I was wondering if anyone could help me. I've got a list of a custom data type like so: And I have a pre-made static database of albums...	[ 0.028076171875, 0.021484375, -0.0062255859375, 0.02392578125, -0.01263427734375, 0.0098876953125, -0.0201416015625, 0.01507568359375, -0.00189208984375, -0.0108642578125, -0.00433349609375, -0.0267333984375, 0.0103759765625, -0.001251220703125, -0.00909423828125, 0.01513671875, -0.00...	[ 87388, 10644, 1295, 5303, 1556, 142508, 52895, 48962, 30195, 42552, 11213, 37340, 20625, 4358, 114122, 2053, 479, 42424, 201939, 63399, 7156, 32354, 30646, 756, 31095, 7228, 3525, 3871, 3996, 4734, 35992, 36069, 136, 14192, 3444, 903, 44457, ...	[ 0.135009765625, 0.2369384765625, 0.09320068359375, 0.1861572265625, 0.157958984375, 0.20849609375, 0.19482421875, 0.160400390625, 0.2144775390625, 0.15478515625, 0.1854248046875, 0.1754150390625, 0.1180419921875, 0.025909423828125, 0.147705078125, 0.101318359375, 0.0228729248046875, ...	embed
43794488_c2	43794488	haskell	2	TmvWUcS1U1IKHT0levwg3 -L/usr/lib/ghc/rts /tmp/ghc54ce_0/ghc_2.o /tmp/ghc54ce_0/ghc_5.o -Wl,-u,ghczmprim_GHCziTypes_Izh_static_info -Wl,-u,ghczmprim_GHCziTypes_Czh_static_info -Wl,-u,ghczmprim_GHCziTypes_Fzh_static_info -Wl,-u,ghczmprim_GHCziTypes_Dzh_static_info -Wl,-u,base_GHCziPtr_Ptr_static_info -Wl,-u,ghczmprim_GHC...	... I have a file helloworld.hs whose contents are simply If I run ghc -c -o helloworld.o helloworld.hs to generate assembly. I would like to know how to manually link helloworld.o If I run ghc -o runnable helloworld.o -v3 to see how ghc accomplishes this (with verbose output) I see this. I cannot simply use a similar ...	[ -0.021240234375, -0.01507568359375, 0.01080322265625, -0.003021240234375, -0.005401611328125, -0.00041961669921875, -0.002105712890625, 0.0024566650390625, -0.0167236328125, -0.01220703125, -0.01123046875, -0.0174560546875, 0.0018463134765625, -0.014892578125, 0.000614166259765625, -0....	[ 153, 765, 11435, 33600, 31, 32554, 127, 7, 10941, 42856, 11675, 31380, 238, 20, 139392, 10, 89845, 38526, 3714, 3642, 23009, 538, 3126, 5, 19, 2886, 334, 363, 1957, 163846, 57823, 140992, 53418, 21373, 11782, 22109, 35978, 28282, 248, 267...	[ 0.00982666015625, 0.019439697265625, 0.1500244140625, 0.1583251953125, 0.172607421875, 0.2254638671875, 0.1376953125, 0.082275390625, 0.08282470703125, 0.054931640625, 0.1192626953125, 0.1307373046875, 0.120361328125, 0.007293701171875, 0.1865234375, 0.0141448974609375, 0.19567871093...	embed
78244252_c1	78244252	haskell	1	/ toEnum . The origin of the question (in case you have spare suggestions) I was using Word32 , but then it took me quite a while to undertand the reason of a but in my program. Essentially, quite a good chunk of my logic was assuming that the value of Word32 s is not 0 . Therefore, I thought of using a more appropria...	/ toEnum . The origin of the question (in case you have spare suggestions) I was using Word32 , but then it took me quite a while to undertand the reason of a but in my program. Essentially, quite a good chunk of my logic was assuming that the value of Word32 s is not 0 . Therefore, I thought of using a more appropria...	[ -0.0247802734375, -0.01055908203125, 0.01318359375, -0.00103759765625, -0.0031890869140625, 0.009765625, 0.0157470703125, -0.00634765625, 0.01031494140625, -0.02197265625, -0.0030975341796875, 0.011962890625, 0.0106201171875, -0.0009613037109375, -0.00156402587890625, 0.007781982421875...	[ 248, 47, 647, 2606, 5, 59665, 9655, 157666, 17368, 22543, 6460, 34739, 32233, 12960, 1379, 31635, 10, 1284, 1528, 179769, 62775, 66596, 34292, 91, 959, 757, 17569, 1286, 95307, 2053, 10644, 29479, 18507, 198, 36880, 44401, 7192, 172, 4935, ...	[ 0.080810546875, 0.231689453125, 0.1285400390625, 0.3271484375, 0.024932861328125, 0.116943359375, 0.0253448486328125, 0.0711669921875, 0.0830078125, 0.16015625, 0.265625, 0.0628662109375, 0.0148162841796875, 0.0421142578125, 0.031890869140625, 0.10693359375, 0.01300048828125, 0.237...	embed
31843006_c0	31843006	haskell	0	Title: Haskell cycle a vector Problem title: Haskell cycle a vector Tags: vector, haskell Problem: Haskell cycle a vector Is there a vector alternative of Data.List's cycle ? The Data.Vector docs have a section titled Recycling support that sounds like it is what I would want but the functions new and clone clearly don...	Haskell cycle a vector Haskell cycle a vector vector haskell Haskell Data.List.cycle Vector Haskell cycle a vector Is there a vector alternative of Data.List's cycle ? The Data.Vector docs have a section titled Recycling support that sounds like it is what I would want but the functions new and clone clearly don't do w...	[ -0.004974365234375, 0.0162353515625, -0.0179443359375, 0.01904296875, 0.018798828125, -0.01434326171875, -0.01458740234375, -0.033203125, -0.0033416748046875, -0.04296875, -0.024658203125, 0.0294189453125, -0.0150146484375, 0.0294189453125, -0.0198974609375, 0.0101318359375, -0.02441...	[ 20625, 142508, 105823, 10, 173, 18770, 1556, 11809, 154663, 75457, 2609, 2685, 30700, 111, 5, 26455, 54, 40059, 853, 166871, 8060, 102678, 2806, 3444, 1284, 32354, 3525, 136, 20450, 123019, 18, 29806, 47644, 119140, 63262, 678, 105416, 2811, ...	[ 0.1256103515625, 0.2279052734375, 0.2457275390625, 0.06976318359375, 0.19384765625, 0.207275390625, 0.109619140625, 0.1253662109375, 0.1846923828125, 0.2239990234375, 0.1842041015625, 0.01214599609375, 0.1739501953125, 0.046478271484375, 0.04095458984375, 0.18603515625, 0.01260375976...	embed
25107542_c0	25107542	haskell	0	Title: Solving Euler #31 in Haskell Problem title: Solving Euler #31 in Haskell Tags: haskell Problem: Solving Euler #31 in Haskell I compared my solution to the one published on haskell.org http://www.haskell.org/haskellwiki/Euler_problems/31_to_40 and don't know what to think of it. Is what I wrote so non-idiomatic, ...	Solving Euler #31 in Haskell Solving Euler #31 in Haskell haskell Solving Euler Haskell c:cs Solving Euler #31 in Haskell I compared my solution to the one published on haskell.org http://www.haskell.org/haskellwiki/Euler_problems/31_to_40 and don't know what to think of it. Is what I wrote so non-idiomatic, that an av...	[ -0.041748046875, -0.00127410888671875, 0.00555419921875, -0.0033111572265625, -0.0179443359375, 0.0216064453125, -0.001708984375, -0.0035858154296875, 0.03173828125, -0.021484375, 0.01251220703125, -0.006134033203125, 0.001556396484375, 0.01361083984375, -0.022705078125, 0.006256103515...	[ 6678, 6496, 5177, 603, 468, 5016, 20625, 142508, 23, 1556, 501, 4439, 154186, 29806, 47, 1632, 91376, 1478, 10557, 13691, 52283, 38953, 188, 2839, 3714, 5351, 2071, 2367, 54397, 221, 351, 57840, 47148, 83080, 106001, 2806, 109312, 60199, 66...	[ 0.138671875, 0.06396484375, 0.1708984375, 0.193603515625, 0.0205841064453125, 0.255859375, 0.141845703125, 0.22412109375, 0.05194091796875, 0.121337890625, 0.0204010009765625, 0.1065673828125, 0.1070556640625, 0.13916015625, 0.054534912109375, 0.03759765625, 0.09326171875, 0.047546...	embed
7055146_c0	7055146	haskell	0	Title: Why do 3 and x (which was assigned 3) have different inferred types in Haskell? Problem title: Why do 3 and x (which was assigned 3) have different inferred types in Haskell? Tags: type-inference, monomorphism-restriction, haskell Problem: Why do 3 and x (which was assigned 3) have different inferred types in Ha...	Why do 3 and x (which was assigned 3) have different inferred types in Haskell? Why do 3 and x (which was assigned 3) have different inferred types in Haskell? type-inference monomorphism-restriction haskell Why Haskell Prelude Num Integer Why do 3 and x (which was assigned 3) have different inferred types in Haskell? ...	[ -0.00140380859375, 0.00823974609375, 0.0108642578125, 0.0133056640625, 0.01361083984375, 0.0027923583984375, -0.0022125244140625, -0.0177001953125, 0.0078125, 0.00103759765625, -0.007415771484375, -0.04931640625, 0.00970458984375, 0.0013580322265625, 0.003662109375, 0.013916015625, 0...	[ 44084, 138, 136, 1022, 95486, 8439, 12921, 53498, 2822, 52895, 20625, 142508, 765, 23, 10644, 73, 69988, 22460, 178851, 8780, 7655, 1556, 1914, 822, 112, 52782, 44401, 143321, 60457, 6620, 4785, 52080, 9709, 4127, 8781, 27781, 25632, 127, 1...	[ 0.1134033203125, 0.1937255859375, 0.14404296875, 0.1251220703125, 0.1279296875, 0.1968994140625, 0.194091796875, 0.2003173828125, 0.11083984375, 0.2177734375, 0.127685546875, 0.23193359375, 0.06463623046875, 0.0159759521484375, 0.220458984375, 0.0222320556640625, 0.1427001953125, 0...	embed
70752333_c0	70752333	haskell	0	Title: Alternative of Show that only uses name Problem title: Alternative of Show that only uses name Tags: deriving, generics, haskell Problem: Alternative of Show that only uses name Is there something like Show (deriving Show) that only uses an algebraic datatype's constructors? (please don't mind that I'm using the...	Alternative of Show that only uses name Alternative of Show that only uses name deriving generics haskell Alternative Show Alternative of Show that only uses name Is there something like Show (deriving Show) that only uses an algebraic datatype's constructors? (please don't mind that I'm using the word constructor, I d...	[ 0.0274658203125, 0.005401611328125, 0.00714111328125, 0.0380859375, 0.002777099609375, 0.00537109375, -0.0033416748046875, 0.00445556640625, -0.002044677734375, -0.0036468505859375, -0.01611328125, -0.00958251953125, 0.003387451171875, 0.026611328125, 0, 0.00051116943359375, -0.01550...	[ 103905, 111, 17367, 450, 4734, 4527, 9351, 16406, 6496, 189534, 1556, 142508, 2685, 9844, 1884, 820, 14, 429, 2844, 2053, 50986, 64549, 25251, 17368, 2565, 748, 3714, 3444, 10941, 122, 5844, 7464, 21647, 8, 85779, 4677, 11814, 29479, 141377...	[ 0.2373046875, 0.1966552734375, 0.30029296875, 0.031829833984375, 0.16455078125, 0.1517333984375, 0.2088623046875, 0.1361083984375, 0.1422119140625, 0.1900634765625, 0.11767578125, 0.218505859375, 0.044647216796875, 0.051422119140625, 0.053375244140625, 0.0916748046875, 0.052032470703...	embed
43891738_c0	43891738	haskell	0	Title: Why does this Parsec parser enter an infinite loop? Problem title: Why does this Parsec parser enter an infinite loop? Tags: haskell, parsec Problem: Why does this Parsec parser enter an infinite loop? The following parser enters an infinite loop for any input. data Ast = Number Int \| Identifier String \| Operati...	Why does this Parsec parser enter an infinite loop? Why does this Parsec parser enter an infinite loop? haskell parsec Why Parsec Ast Number Identifier Operation BinOp Show Plus Minus Enum many1 Parser Why does this Parsec parser enter an infinite loop? The following parser enters an infinite loop for any input. The pr...	[ -0.0054931640625, -0.01611328125, 0.01434326171875, 0.0283203125, 0.001373291015625, 0.00066375732421875, 0.00457763671875, -0.009765625, 0.007171630859375, -0.0223388671875, 0.01483154296875, 0.01251220703125, 0.003753662109375, 0.01141357421875, 0.007659912109375, 0.007293701171875, ...	[ 44084, 14602, 903, 2392, 39797, 366, 2189, 30957, 142, 54241, 13, 40956, 1556, 142508, 62, 271, 103332, 189543, 102203, 16666, 39029, 17367, 8183, 24169, 357, 316, 5941, 418, 25632, 7, 100, 2499, 107730, 2967, 174653, 41018, 62548, 75939, 6...	[ 0.1451416015625, 0.059539794921875, 0.0909423828125, 0.1434326171875, 0.2332763671875, 0.1483154296875, 0.1688232421875, 0.1622314453125, 0.05438232421875, 0.1492919921875, 0.0830078125, 0.18310546875, 0.1116943359375, 0.187255859375, 0.03387451171875, 0.1259765625, 0.0869140625, 0...	embed
69717825_c0	69717825	haskell	0	Title: How to prove that the type parameters of an Injective Type Family are Equivalent? Problem title: How to prove that the type parameters of an Injective Type Family are Equivalent? Tags: injective-function, type-families, haskell, dependent-type Problem: How to prove that the type parameters of an Injective Type F...	How to prove that the type parameters of an Injective Type Family are Equivalent? How to prove that the type parameters of an Injective Type Family are Equivalent? injective-function type-families haskell dependent-type How Injective Type Family Equivalent MyTF Refl How to prove that the type parameters of an Injective...	[ 0.0084228515625, -0.0125732421875, -0.007415771484375, 0.01007080078125, -0.040283203125, -0.0189208984375, 0.004913330078125, -0.0142822265625, -0.00537109375, -0.021728515625, -0.010986328125, -0.00482177734375, 0.01397705078125, 0.0213623046875, 0.0106201171875, -0.0262451171875, ...	[ 11249, 23534, 10644, 171859, 360, 170, 100034, 60457, 59745, 145666, 85540, 621, 115049, 5844, 137175, 69128, 1556, 142508, 108750, 50986, 2646, 30992, 53295, 141, 14449, 98869, 224743, 2046, 3956, 2965, 4527, 51, 115840, 10625, 56, 329, 105506...	[ 0.0272216796875, 0.166015625, 0.2215576171875, 0.2125244140625, 0.03662109375, 0.1566162109375, 0.164306640625, 0.2003173828125, 0.1717529296875, 0.0753173828125, 0.1715087890625, 0.0098876953125, 0.19873046875, 0.136474609375, 0.10699462890625, 0.11767578125, 0.054962158203125, 0....	embed
36611647_c0	36611647	haskell	0	Title: Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Problem title: Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Tags: haskell Problem: Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Within Haskell I have a program that scrapes the html off a page and stores ...	Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error haskell Haskell Regex Couldn Char matches_list Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Within Haskell I have a program that scrapes the html off a page and store...	[ -0.00543212890625, 0.01483154296875, 0.01458740234375, 0.01397705078125, 0.0054931640625, 0.0281982421875, -0.033447265625, 0.0198974609375, 0.01611328125, -0.04541015625, 0.002288818359375, -0.03173828125, 0.01031494140625, -0.01397705078125, 0.0157470703125, 0.0004367828369140625, ...	[ 20625, 142508, 11678, 3355, 191147, 3768, 18, 14858, 10644, 1065, 84068, 678, 17780, 18499, 1556, 19, 21656, 90, 6562, 1528, 120948, 7693, 5773, 9191, 4343, 77336, 3444, 139392, 5303, 23351, 214, 16401, 756, 103510, 6626, 124519, 35064, 1295,...	[ 0.110595703125, 0.1912841796875, 0.1192626953125, 0.185791015625, 0.1146240234375, 0.1361083984375, 0.0948486328125, 0.2332763671875, 0.1953125, 0.03533935546875, 0.2008056640625, 0.09698486328125, 0.209716796875, 0.156982421875, 0.07415771484375, 0.0221405029296875, 0.17578125, 0....	embed
37081460_c0	37081460	haskell	0	Title: Number guessing game error and keeping count of guesses Problem title: Number guessing game error and keeping count of guesses Tags: io, haskell, random Problem: Number guessing game error and keeping count of guesses easy :: IO () easy = do putStrLn "Guess a number between 1 and 13: " rNumber <- randomRIO (1, 1...	Number guessing game error and keeping count of guesses Number guessing game error and keeping count of guesses io haskell random System.Random Number finalename.hs:5:10 Parse Possibly Easy Medium Hard Select You Guess Correct Number guessing game error and keeping count of guesses I am doing a number guessing game in ...	[ -0.005096435546875, -0.008544921875, -0.0098876953125, 0.01104736328125, 0.036376953125, 0.024169921875, -0.0235595703125, -0.004791259765625, -0.003143310546875, -0.01318359375, -0.005523681640625, -0.0186767578125, 0.01409912109375, 0.0257568359375, 0.03466796875, 0.01214599609375, ...	[ 103332, 57767, 214, 6712, 18499, 136, 120260, 54529, 111, 22995, 1556, 142508, 96759, 12353, 126525, 3815, 22688, 11627, 127, 758, 15110, 2392, 115861, 71975, 174413, 39391, 51620, 96274, 7, 46348, 15390, 90, 20594, 14012, 20625, 138, 34844, ...	[ 0.167724609375, 0.2197265625, 0.0853271484375, 0.1619873046875, 0.21142578125, 0.0557861328125, 0.1705322265625, 0.18408203125, 0.11474609375, 0.15478515625, 0.119873046875, 0.222412109375, 0.1043701171875, 0.0921630859375, 0.04638671875, 0.102294921875, 0.1517333984375, 0.10974121...	embed
17916302_c0	17916302	haskell	0	Title: Yesod live reload of Hamlet with GHCI instead of GHC? Problem title: Yesod live reload of Hamlet with GHCI instead of GHC? Tags: type-safety, yesod, haskell, ghci, ghc Problem: Yesod live reload of Hamlet with GHCI instead of GHC? I just heard about Yesod and started reading the book. In the Shakespeare chapter,...	Yesod live reload of Hamlet with GHCI instead of GHC? Yesod live reload of Hamlet with GHCI instead of GHC? type-safety yesod haskell ghci ghc Yesod Hamlet GHCI GHC Yesod live reload of Hamlet with GHCI instead of GHC? I just heard about Yesod and started reading the book. In the Shakespeare chapter, about 3/4 down, th...	[ -0.0101318359375, 0.01263427734375, 0.005767822265625, -0.00555419921875, -0.0205078125, 0.0050048828125, -0.0181884765625, 0.0303955078125, -0.01708984375, -0.0274658203125, -0.0028076171875, -0.041259765625, -0.0189208984375, 0.00335693359375, 0.032958984375, -0.004608154296875, -0...	[ 32635, 2199, 6867, 456, 63033, 111, 10699, 1974, 678, 41877, 17304, 64457, 527, 73265, 10644, 115840, 2422, 23722, 1556, 142508, 31380, 318, 238, 49782, 16454, 70, 12877, 113154, 139539, 4, 83849, 2804, 4332, 13736, 83, 959, 19882, 100, 473...	[ 0.183349609375, 0.254150390625, 0.190185546875, 0.1060791015625, 0.2459716796875, 0.0596923828125, 0.1702880859375, 0.2242431640625, 0.05731201171875, 0.169677734375, 0.20458984375, 0.0941162109375, 0.10418701171875, 0.1822509765625, 0.1268310546875, 0.15185546875, 0.1444091796875, ...	embed
2391773_c0	2391773	haskell	0	Title: Implementing CTCP commands in an IRC bot (Haskell) Problem title: Implementing CTCP commands in an IRC bot (Haskell) Tags: haskell, bots, irc Problem: Implementing CTCP commands in an IRC bot (Haskell) I have followed the tutorial on the Haskell wiki about i mplementing an IRC bot. and everything worked out fine...	Implementing CTCP commands in an IRC bot (Haskell) Implementing CTCP commands in an IRC bot (Haskell) haskell bots irc Implementing CTCP IRC Haskell PRIVMSG Haskellbot v1.0 GHCi Implementing CTCP commands in an IRC bot (Haskell) I have followed the tutorial on the Haskell wiki about i mplementing an IRC bot. and everyt...	[ 0.006317138671875, 0.023681640625, 0.0196533203125, 0.032958984375, 0.0166015625, 0.02587890625, -0.00494384765625, -0.01092529296875, -0.0177001953125, -0.00677490234375, -0.002288818359375, -0.039794921875, -0.0011749267578125, 0.0159912109375, -0.0250244140625, 0.00830078125, 0.01...	[ 153941, 71885, 17854, 75101, 7, 87, 25740, 13820, 6495, 142508, 1556, 193, 238, 20625, 29852, 47599, 74322, 9190, 102107, 73265, 14, 134629, 57143, 34356, 17, 19929, 65042, 35644, 50336, 3789, 72095, 11389, 136, 33429, 4488, 10723, 1284, 959,...	[ 0.191162109375, 0.154541015625, 0.2401123046875, 0.2222900390625, 0.0345458984375, 0.048797607421875, 0.1923828125, 0.1844482421875, 0.06634521484375, 0.2049560546875, 0.06402587890625, 0.107421875, 0.0185394287109375, 0.0841064453125, 0.05474853515625, 0.0692138671875, 0.10925292968...	embed
8218904_c0	8218904	haskell	0	Title: Speed up Data.Array row extraction and filtering Problem title: Speed up Data.Array row extraction and filtering Tags: haskell, arrays Problem: Speed up Data.Array row extraction and filtering I have a very simple function in my application that does a lot of work and occupies the most computation time: f :: Int...	Speed up Data.Array row extraction and filtering Speed up Data.Array row extraction and filtering haskell arrays Speed Data.Array Array Speed up Data.Array row extraction and filtering I have a very simple function in my application that does a lot of work and occupies the most computation time: What this does is: extr...	[ -0.01123046875, 0.00494384765625, 0.01806640625, 0.0026092529296875, 0.000415802001953125, -0.037109375, 0.0078125, 0.0074462890625, 0.01318359375, 0.00186920166015625, 0.0035858154296875, -0.000240325927734375, -0.019287109375, 0.0123291015625, -0.00058746337890625, -0.00390625, 0.0...	[ 63349, 1257, 11809, 7614, 7092, 15555, 4173, 10763, 46312, 1556, 142508, 10298, 4778, 69253, 53, 136, 214, 4552, 8781, 32354, 38415, 14602, 5915, 4488, 143414, 2684, 181135, 1733, 125663, 99, 63262, 1022, 1295, 187, 42, 30646, 756, 3365, 31...	[ 0.195068359375, 0.119140625, 0.1634521484375, 0.1141357421875, 0.178466796875, 0.2181396484375, 0.1861572265625, 0.0643310546875, 0.2001953125, 0.095703125, 0.1781005859375, 0.1243896484375, 0.013458251953125, 0.12744140625, 0.05596923828125, 0.016082763671875, 0.05328369140625, 0....	embed
31697883_c1	31697883	haskell	1	etymological_origin_of") then False else True tsv = do x <- ATL.many1 line return $ fmap M.fromList x main = (putStrLn . show . ATL.parse tsv) =<< text It works for small amounts of input, but quickly grows too inefficient. I'm not quite clear on where the problem is, and soon realized that even trivial tasks like view...	etymological_origin_of") then False else True tsv = do x <- ATL.many1 line return $ fmap M.fromList x main = (putStrLn . show . ATL.parse tsv) =<< text It works for small amounts of input, but quickly grows too inefficient. I'm not quite clear on where the problem is, and soon realized that even trivial tasks like view...	[ 0.004241943359375, 0.00537109375, -0.0157470703125, 0.02294921875, 0.00506591796875, -0.00176239013671875, 0.01239013671875, -0.010009765625, -0.00078582763671875, -0.03369140625, 0.00262451171875, -0.015869140625, 0.00830078125, 0.0189208984375, -0.01544189453125, 0.00836181640625, ...	[ 82, 4650, 109622, 3929, 6820, 4390, 22225, 184, 37076, 87599, 61636, 334, 54, 1022, 62, 41445, 669, 53, 418, 13315, 30646, 1238, 62346, 276, 161063, 154663, 5201, 7639, 2500, 16093, 7986, 1650, 43240, 19336, 41170, 107730, 1284, 69405, 5599...	[ 0.07623291015625, 0.184814453125, 0.1734619140625, 0.1898193359375, 0.1900634765625, 0.253662109375, 0.10650634765625, 0.068359375, 0.0181427001953125, 0.1234130859375, 0.142333984375, 0.227294921875, 0.0643310546875, 0.0305938720703125, 0.00311279296875, 0.1759033203125, 0.082580566...	embed
38819801_c1	38819801	haskell	1	>>=)’, namely ‘\ state -> modifying Slack.userState $ set appState $ f state’ Which makes sense given the signature for modifying : modifying :: MonadState s m => ASetter s s a b -> (a -> b) -> m () However, upon looking at the documentation for Slack.userState : userState :: forall s s. Lens (SlackState s) (SlackState...	>>=)’, namely ‘\ state -> modifying Slack.userState $ set appState $ f state’ Which makes sense given the signature for modifying : modifying :: MonadState s m => ASetter s s a b -> (a -> b) -> m () However, upon looking at the documentation for Slack.userState : userState :: forall s s. Lens (SlackState s) (SlackState...	[ -0.0234375, 0.00970458984375, 0.01507568359375, -0.004058837890625, -0.003997802734375, 0.0185546875, 0.003448486328125, -0.01434326171875, 0.009033203125, 0.00396728515625, -0.0181884765625, 0.0196533203125, -0.0098876953125, -0.00848388671875, 0.01531982421875, -0.014892578125, 0.0...	[ 6396, 1369, 41872, 11341, 2811, 151138, 159, 123660, 5, 65918, 135206, 13, 3650, 5423, 4027, 1238, 30482, 10422, 138256, 60331, 71, 91, 347, 62593, 876, 209806, 38937, 100, 5584, 18226, 77641, 2053, 82084, 18770, 116071, 17367, 211235, 15400,...	[ 0.045166015625, 0.071533203125, 0.021209716796875, 0.2047119140625, 0.1461181640625, 0.130859375, 0.07891845703125, 0.26220703125, 0.015869140625, 0.1319580078125, 0.2587890625, 0.1239013671875, 0.05694580078125, 0.13623046875, 0.1844482421875, 0.1209716796875, 0.0133056640625, 0.1...	embed
52879635_c0	52879635	haskell	0	Title: Parse a String using Parsec? Problem title: Parse a String using Parsec? Tags: parsing, parsec, haskell Problem: Parse a String using Parsec? I am trying to parse a String using parsec in Haskell, however every attempt throws another type of error. import Text.ParserCombinators.Parsec csvFile = endBy line eol li...	Parse a String using Parsec? Parse a String using Parsec? parsing parsec haskell ParseError Parsec Text.ParserCombinators.Parsec Parse Either Parse a String using Parsec? I am trying to parse a String using parsec in Haskell, however every attempt throws another type of error. This code, when run through stack ghci pro...	[ -0.0201416015625, -0.00025177001953125, -0.0033721923828125, 0.05712890625, 0.006072998046875, 0.0216064453125, -0.005462646484375, -0.0299072265625, -0.01458740234375, -0.0167236328125, -0.019775390625, -0.036376953125, 0.0026702880859375, 0.00124359130859375, -0.0172119140625, 0.0050...	[ 2392, 184, 10, 23351, 214, 17368, 39797, 32, 366, 6953, 1556, 142508, 18468, 31611, 24129, 28636, 2189, 19155, 22230, 31577, 20625, 11907, 81887, 104250, 15700, 10644, 18499, 18151, 11675, 8305, 177261, 31380, 318, 27489, 6431, 21690, 2886, 1...	[ 0.172119140625, 0.1416015625, 0.03192138671875, 0.2213134765625, 0.127197265625, 0.1063232421875, 0.26904296875, 0.017852783203125, 0.1683349609375, 0.064697265625, 0.1072998046875, 0.2198486328125, 0.048248291015625, 0.008270263671875, 0.1431884765625, 0.12353515625, 0.0594177246093...	embed
67254536_c0	67254536	haskell	0	Title: How can I infer types for recursive functions? Problem title: How can I infer types for recursive functions? Tags: haskell, type-inference, recursion, hindley-milner Problem: How can I infer types for recursive functions? I'm trying to implement language with type inference based on Hindley-Milner algorithm. But...	How can I infer types for recursive functions? How can I infer types for recursive functions? haskell type-inference recursion hindley-milner How How can I infer types for recursive functions? I'm trying to implement language with type inference based on Hindley-Milner algorithm. But I don't know how to infer types for...	[ -0.00335693359375, -0.01220703125, -0.000690460205078125, 0.026611328125, -0.006195068359375, -0.00537109375, -0.0107421875, 0.0027923583984375, -0.0172119140625, -0.041259765625, 0.007598876953125, -0.0274658203125, -0.01312255859375, 0.004791259765625, 0.021728515625, -0.002044677734...	[ 11249, 831, 87, 53498, 52895, 100, 195625, 5844, 32354, 1556, 142508, 10644, 73, 69988, 1830, 34866, 4293, 12397, 1679, 29479, 46876, 6620, 35509, 67944, 92369, 234873, 3714, 3642, 8110, 139392, 86869, 158, 2816, 4288, 1238, 136, 706, 25842, ...	[ 0.088134765625, 0.06884765625, 0.0548095703125, 0.280517578125, 0.26708984375, 0.0899658203125, 0.2271728515625, 0.1385498046875, 0.139892578125, 0.08544921875, 0.185791015625, 0.215087890625, 0.03436279296875, 0.15380859375, 0.00537109375, 0.07965087890625, 0.1573486328125, 0.0632...	embed
69516792_c0	69516792	haskell	0	Title: Are haskell list comprehensions lazy? Problem title: Are haskell list comprehensions lazy? Tags: ghci, haskell, idioms, lazy-evaluation, performance Problem: Are haskell list comprehensions lazy? After a long while dealing with other languages, I wanted to refresh my aging Haskell skills a little with some codeg...	Are haskell list comprehensions lazy? Are haskell list comprehensions lazy? ghci haskell idioms lazy-evaluation performance Data.Word Word32 Are haskell list comprehensions lazy? After a long while dealing with other languages, I wanted to refresh my aging Haskell skills a little with some codegolf inspired computation...	[ -0.00113677978515625, 0.001068115234375, -0.00323486328125, 0.002838134765625, 0.00396728515625, 0.0233154296875, 0.003753662109375, 0.021728515625, 0.017578125, -0.00775146484375, -0.0128173828125, -0.0021820068359375, 0.00836181640625, 0.005615234375, -0.0185546875, 0.021240234375, ...	[ 15901, 1556, 142508, 5303, 46683, 3220, 63239, 21, 3285, 32, 31380, 318, 13373, 28016, 159258, 23718, 11809, 164805, 22543, 6460, 184017, 46876, 36663, 210651, 66398, 20625, 59376, 10176, 18151, 120291, 191722, 181135, 179140, 140909, 35064, 2870...	[ 0.0799560546875, 0.1419677734375, 0.2364501953125, 0.208251953125, 0.1383056640625, 0.1434326171875, 0.0906982421875, 0.153564453125, 0.1995849609375, 0.004425048828125, 0.03997802734375, 0.06353759765625, 0.074951171875, 0.0212860107421875, 0.08074951171875, 0.10302734375, 0.0484924...	embed
12795230_c1	12795230	haskell	1	SocketT = StateT ClientSocket type HNT m = ClientSocketT (NetworkEnvT m) initialNetwork :: NetworkEnv initialNetwork = NetworkEnv { getMulticastIP = _MULTICAST_IP_ADDR_, getMulticastPort = _MULTICAST_PORT_ } openClientConnection :: HNT m a -> m a openClientConnection func = do env <- ask (sock, addr) <- liftIO $ multic...	SocketT = StateT ClientSocket type HNT m = ClientSocketT (NetworkEnvT m) initialNetwork :: NetworkEnv initialNetwork = NetworkEnv { getMulticastIP = _MULTICAST_IP_ADDR_, getMulticastPort = _MULTICAST_PORT_ } openClientConnection :: HNT m a -> m a openClientConnection func = do env <- ask (sock, addr) <- liftIO $ multic...	[ -0.021240234375, 0.005340576171875, 0.000675201416015625, 0.0211181640625, 0.0218505859375, -0.00958251953125, -0.00970458984375, -0.0145263671875, -0.0194091796875, -0.04248046875, 0.0028228759765625, 0.0264892578125, 0.00098419189453125, -0.008544921875, -0.006011962890625, -0.013671...	[ 1061, 27853, 618, 2203, 22836, 91732, 8912, 10644, 572, 22879, 347, 18244, 7768, 334, 61475, 24447, 28997, 2046, 50657, 10931, 176851, 8545, 23498, 60006, 91599, 9803, 150, 235603, 10, 2517, 7477, 54, 22, 26458, 991, 15190, 60520, 17780, 60...	[ 0.1495361328125, 0.228759765625, 0.185791015625, 0.03594970703125, 0.1285400390625, 0.226806640625, 0.16943359375, 0.169189453125, 0.0809326171875, 0.19091796875, 0.1318359375, 0.09625244140625, 0.09991455078125, 0.16943359375, 0.146728515625, 0.06243896484375, 0.092529296875, 0.01...	embed
35581300_c0	35581300	haskell	0	Title: Interoperability with Java in Frege, especially in IO Monad Problem title: Interoperability with Java in Frege, especially in IO Monad Tags: java, haskell, frege Problem: Interoperability with Java in Frege, especially in IO Monad I would like to translate this java code into Frege Haskell: PApplet pApplet = new...	Interoperability with Java in Frege, especially in IO Monad Interoperability with Java in Frege, especially in IO Monad java haskell frege Interoperability Java Frege Monad PApplet System.out.print pApplet.toString PApplet.runSketch processing.core.PApplet processing.core.PApplet.runSketch ArrayOf RealWorld PApplet.new...	[ -0.003570556640625, -0.006561279296875, -0.00469970703125, 0.017578125, -0.00531005859375, 0.0238037109375, 0.01123046875, -0.000701904296875, 0.007720947265625, -0.008056640625, 0.0164794921875, -0.036865234375, 0.000156402587890625, 0.00104522705078125, -0.0074462890625, 0.0008621215...	[ 5337, 42227, 41159, 678, 41925, 23, 21612, 429, 41866, 17780, 60331, 71, 79, 330, 1556, 142508, 183559, 13, 436, 75339, 18, 12353, 6056, 35662, 915, 188, 71713, 16428, 3473, 9433, 30854, 683, 69253, 132887, 5120, 70646, 54936, 7092, 161063,...	[ 0.110595703125, 0.228759765625, 0.0758056640625, 0.1185302734375, 0.272705078125, 0.028900146484375, 0.216552734375, 0.218017578125, 0.003631591796875, 0.1783447265625, 0.1405029296875, 0.09368896484375, 0.1197509765625, 0.20166015625, 0.06085205078125, 0.2042236328125, 0.13916015625...	embed
18767086_c1	18767086	haskell	1	17:56: Couldn't match expected type `ByteString' with actual type `bytestring-0.10.0.2:Data.ByteString.Internal.ByteString' In the first argument of `decode', namely `x' In the first argument of `(<>)', namely `decode x' In the second argument of `(<>)', namely `decode x <> ";"' So, my guess this error has something to...	17:56: Couldn't match expected type `ByteString' with actual type `bytestring-0.10.0.2:Data.ByteString.Internal.ByteString' In the first argument of `decode', namely `x' In the first argument of `(<>)', namely `decode x' In the second argument of `(<>)', namely `decode x <> ";"' So, my guess this error has something to...	[ 0.016845703125, 0.004486083984375, -0.0078125, -0.004730224609375, -0.00732421875, 0.012939453125, -0.006683349609375, 0.0079345703125, -0.00347900390625, 0.007781982421875, 0.014404296875, 0.00070953369140625, 0.020263671875, 0.00994873046875, -0.01806640625, -0.0074462890625, -0.00...	[ 34546, 191147, 18, 14858, 84751, 10644, 75358, 67, 71713, 214, 678, 8561, 61028, 91693, 23320, 10179, 133684, 137989, 44851, 6236, 5117, 10750, 112, 40899, 110987, 425, 16093, 2740, 1022, 17932, 4426, 57767, 18499, 91732, 294, 90, 6889, 20653...	[ 0.08251953125, 0.123779296875, 0.0823974609375, 0.220458984375, 0.200439453125, 0.1790771484375, 0.111572265625, 0.1165771484375, 0.1988525390625, 0.093994140625, 0.09246826171875, 0.121826171875, 0.143310546875, 0.2296142578125, 0.0220794677734375, 0.121337890625, 0.1468505859375, ...	embed
24072177_c0	24072177	haskell	0	Title: Haskell selecting last items from the list of lists Problem title: Haskell selecting last items from the list of lists Tags: list, haskell Problem: Haskell selecting last items from the list of lists Hi guys I have a little problem that I have been struggling with for a couple of hours, so I thought that maybe y...	Haskell selecting last items from the list of lists Haskell selecting last items from the list of lists list haskell the Haskell Field Map Haskell selecting last items from the list of lists Hi guys I have a little problem that I have been struggling with for a couple of hours, so I thought that maybe you could help me...	[ -0.00982666015625, 0.003570556640625, 0.000774383544921875, 0.0009765625, -0.0220947265625, 0.0067138671875, -0.00179290771484375, 0.000812530517578125, 0.006072998046875, 0.008056640625, 0.01141357421875, -0.0238037109375, 0.0203857421875, 0.01507568359375, -0.025390625, 0.00066757202...	[ 20625, 142508, 36849, 214, 4568, 55769, 1295, 5303, 111, 1556, 117657, 42719, 51484, 10176, 2967, 237875, 100, 21974, 4358, 6275, 52080, 2053, 50986, 10644, 75935, 176866, 44457, 32354, 30646, 103033, 1884, 903, 2831, 179933, 3871, 33022, 51776...	[ 0.1343994140625, 0.206298828125, 0.1649169921875, 0.005615234375, 0.22509765625, 0.18115234375, 0.0904541015625, 0.2022705078125, 0.04010009765625, 0.12353515625, 0.156494140625, 0.2001953125, 0.032745361328125, 0.053985595703125, 0.056976318359375, 0.057220458984375, 0.0105590820312...	embed
52156838_c0	52156838	haskell	0	Title: Can I append to a file using binary's Data.Binary? Problem title: Can I append to a file using binary's Data.Binary? Tags: binary, disk, haskell, append Problem: Can I append to a file using binary's Data.Binary? I've got a [Something] value, I'd like to save this value to disk every n seconds. However...	Can I append to a file using binary's Data.Binary? Can I append to a file using binary's Data.Binary? binary disk haskell append binary Can Data.Binary Something Can I append to a file using binary's Data.Binary? I've got a [Something] value, I'd like to save this value to disk every n seconds. However this v...	[ 0.0022125244140625, 0.01190185546875, 0.01068115234375, -0.003021240234375, 0.01068115234375, 0.01904296875, -0.0034332275390625, 0.00909423828125, 0.03662109375, -0.01055908203125, -0.002166748046875, -0.015869140625, -0.000598907470703125, 0.028564453125, 0.020263671875, -0.014404296...	[ 4171, 87, 114689, 71, 47, 11435, 17368, 2394, 6635, 3768, 11809, 5, 571, 73, 28338, 1556, 142508, 200905, 10, 4163, 64113, 34292, 1884, 30098, 11907, 653, 94131, 5809, 80854, 32562, 28484, 1733, 38516, 95549, 16487, 64457, 5303, 68034, 282,...	[ 0.1219482421875, 0.0633544921875, 0.230224609375, 0.1876220703125, 0.138916015625, 0.196533203125, 0.10009765625, 0.1856689453125, 0.203125, 0.0404052734375, 0.18212890625, 0.05621337890625, 0.1180419921875, 0.192626953125, 0.085693359375, 0.09564208984375, 0.21435546875, 0.1163330...	embed
49246572_c0	49246572	haskell	0	Title: Gap function that returns the integer distance between first appearance of two elements in a list using either foldl or foldr.(Haskell) Problem title: Gap function that returns the integer distance between first appearance of two elements in a list using either foldl or foldr.(Haskell) Tags: fold, haskell, list ...	Gap function that returns the integer distance between first appearance of two elements in a list using either foldl or foldr.(Haskell) Gap function that returns the integer distance between first appearance of two elements in a list using either foldl or foldr.(Haskell) fold haskell list either Gap Haskell Gap functio...	[ 0.0020294189453125, 0.007598876953125, 0.00738525390625, -0.01202392578125, -0.01263427734375, 0.034912109375, 0.00110626220703125, 0.012451171875, -0.000698089599609375, -0.00689697265625, -0.00982666015625, -0.0174560546875, -0.01953125, 0.0177001953125, -0.0037994384765625, 0.001174...	[ 2902, 254, 32354, 30646, 892, 1505, 62488, 17721, 5117, 170894, 6626, 80854, 5303, 17368, 18344, 20469, 7569, 6495, 7, 142508, 707, 42822, 1556, 40101, 20625, 10644, 61924, 28960, 43599, 1984, 864, 10, 44357, 33079, 11, 268, 83425, 360, 18,...	[ 0.267333984375, 0.234375, 0.220947265625, 0.172119140625, 0.132568359375, 0.0704345703125, 0.252197265625, 0.1365966796875, 0.08642578125, 0.17919921875, 0.10693359375, 0.1539306640625, 0.1942138671875, 0.0396728515625, 0.1495361328125, 0.18408203125, 0.179443359375, 0.0634765625, ...	embed
60245449_c0	60245449	haskell	0	Title: newtype-like operational semantics for a GADT where the type fully determines the constructor Problem title: newtype-like operational semantics for a GADT where the type fully determines the constructor Tags: gadt, haskell, coercion, newtype Problem: newtype-like operational semantics for a GADT where the type f...	newtype-like operational semantics for a GADT where the type fully determines the constructor newtype-like operational semantics for a GADT where the type fully determines the constructor gadt haskell coercion newtype GADT Tag Payload Double Bool Coercible PayloadA PayloadB PayloadC newtype-like operational semantics f...	[ 0.0012359619140625, -0.0125732421875, -0.006988525390625, 0.00157928466796875, 0.0054931640625, 0.0033416748046875, -0.0108642578125, -0.00811767578125, 0.003631591796875, -0.0008544921875, -0.00518798828125, -0.032470703125, -0.00189971923828125, -0.005279541015625, -0.00360107421875, ...	[ 3525, 50986, 5062, 41018, 289, 484, 109109, 23749, 41072, 10644, 89554, 83324, 64549, 748, 914, 13384, 1556, 142508, 552, 56, 6447, 4837, 17166, 63033, 107172, 2460, 929, 1311, 318, 2661, 284, 571, 441, 1884, 3444, 110, 11675, 6032, 18811, ...	[ 0.17822265625, 0.285888671875, 0.164306640625, 0.1619873046875, 0.0207977294921875, 0.105712890625, 0.1209716796875, 0.1336669921875, 0.197509765625, 0.2197265625, 0.081298828125, 0.1392822265625, 0.086181640625, 0.0631103515625, 0.073486328125, 0.1405029296875, 0.09283447265625, 0...	embed
36162127_c0	36162127	haskell	0	Title: Is the Cake Pattern missing from Haskell? Why and when would I need to use the Cake Pattern in Haskell? Problem title: Is the Cake Pattern missing from Haskell? Why and when would I need to use the Cake Pattern in Haskell? Tags: haskell, scala, cake-pattern Problem: Is the Cake Pattern missing from Haskell? Why ...	Is the Cake Pattern missing from Haskell? Why and when would I need to use the Cake Pattern in Haskell? Is the Cake Pattern missing from Haskell? Why and when would I need to use the Cake Pattern in Haskell? haskell scala cake-pattern Haskell Cake Pattern Why Is the Cake Pattern missing from Haskell? Why and when would...	[ -0.004425048828125, 0.01123046875, 0.019287109375, -0.00640869140625, 0.001739501953125, 0.005645751953125, -0.01092529296875, 0.0191650390625, -0.000728607177734375, 0.0223388671875, -0.0177001953125, -0.0211181640625, -0.0089111328125, 0.00775146484375, 0.0113525390625, 0.00156402587...	[ 2071, 2041, 350, 9876, 22766, 132283, 1295, 20625, 142508, 44084, 3229, 3871, 4527, 23, 1556, 146232, 86963, 4453, 174489, 26908, 152653, 11, 92635, 1452, 1297, 959, 6044, 31089, 131148, 4358, 21334, 6827, 76519, 18749, 7722, 75935, 678, 1766...	[ 0.00946044921875, 0.20703125, 0.16796875, 0.1893310546875, 0.1558837890625, 0.141845703125, 0.058563232421875, 0.113525390625, 0.217529296875, 0.0462646484375, 0.0143585205078125, 0.04290771484375, 0.0670166015625, 0.0266571044921875, 0.07098388671875, 0.144287109375, 0.2142333984375...	embed
36290449_c0	36290449	haskell	0	Title: Haskell function that outputs all combinations within the input list that add to the input number Problem title: Haskell function that outputs all combinations within the input list that add to the input number Tags: recursion, list, haskell Problem: Haskell function that outputs all combinations within the inpu...	Haskell function that outputs all combinations within the input list that add to the input number Haskell function that outputs all combinations within the input list that add to the input number recursion list haskell Haskell Integer Haskell function that outputs all combinations within the input list that add to the ...	[ -0.03515625, 0.00439453125, 0.006195068359375, 0.01226806640625, -0.01055908203125, 0.026123046875, 0.003509521484375, -0.01214599609375, 0.006744384765625, -0.0076904296875, 0.00970458984375, -0.006988525390625, 0.0120849609375, 0.0157470703125, -0.00445556640625, -0.00082015991210937...	[ 20625, 142508, 32354, 450, 140992, 756, 162515, 7, 28032, 107730, 5303, 15190, 47, 14012, 195625, 1830, 1556, 44401, 3444, 33022, 51776, 892, 26255, 136, 1505, 34292, 237, 70541, 80854, 1257, 759, 97249, 238, 122101, 109631, 1126, 2681, 2489,...	[ 0.1470947265625, 0.23291015625, 0.20849609375, 0.012451171875, 0.1942138671875, 0.1163330078125, 0.257080078125, 0.0494384765625, 0.118408203125, 0.201904296875, 0.1807861328125, 0.16748046875, 0.07177734375, 0.1458740234375, 0.175048828125, 0.05535888671875, 0.140625, 0.1920166015...	embed
23428949_c0	23428949	haskell	0	Title: GHCi is crashing when executed from a directory that has a Prelude.hs Problem title: GHCi is crashing when executed from a directory that has a Prelude.hs Tags: haskell, ghci, ghc Problem: GHCi is crashing when executed from a directory that has a Prelude.hs GHCi crashes when I try to start it from my src direct...	GHCi is crashing when executed from a directory that has a Prelude.hs GHCi is crashing when executed from a directory that has a Prelude.hs haskell ghci ghc a GHCi Prelude.hs XNoImplicitPrelude XPackageImports Prelude www.haskell.org Loading Top GHCi is crashing when executed from a directory that has a Prelude.hs GHCi...	[ -0.01025390625, -0.005157470703125, 0.021484375, 0.0023345947265625, -0.00921630859375, 0.0244140625, 0.0067138671875, -0.0130615234375, -0.01171875, -0.057373046875, -0.0123291015625, 0.00531005859375, -0.025634765625, -0.013671875, 0.00836181640625, 0.0093994140625, -0.014038085937...	[ 527, 73265, 14, 150631, 214, 3229, 71924, 1295, 14364, 1556, 1914, 822, 112, 127, 7, 142508, 31380, 318, 238, 1193, 5021, 128878, 60923, 19273, 205956, 61637, 6982, 10557, 1478, 228006, 4792, 5, 90, 9790, 4034, 91, 19437, 11435, 123087, 5...	[ 0.1138916015625, 0.1644287109375, 0.251220703125, 0.21337890625, 0.0987548828125, 0.07000732421875, 0.171875, 0.111328125, 0.1298828125, 0.1231689453125, 0.1346435546875, 0.2188720703125, 0.16455078125, 0.161376953125, 0.11767578125, 0.2291259765625, 0.1192626953125, 0.160034179687...	embed
23940487_c1	23940487	haskell	1	of these could similarly ignore the a type. For example: atRiskForDiabetes :: Person a -> Bool atRiskForDiabetes p = age p + weight p > 200 --Clearly, I am not actually a doctor Now, if we have a heterogeneous list of people (of type [exists a. Person a] ), we would like to be able to map some of our functions over th...	of these could similarly ignore the a type. For example: atRiskForDiabetes :: Person a -> Bool atRiskForDiabetes p = age p + weight p > 200 --Clearly, I am not actually a doctor Now, if we have a heterogeneous list of people (of type [exists a. Person a] ), we would like to be able to map some of our functions over th...	[ 0.00011968612670898438, 0.00762939453125, 0.000476837158203125, 0.0196533203125, -0.0238037109375, 0.009033203125, -0.0205078125, 0.00201416015625, 0.007110595703125, -0.0172119140625, -0.00115966796875, -0.0069580078125, 0.0106201171875, 0.0027923583984375, -0.005126953125, -0.0311279...	[ 111, 6097, 5809, 21373, 124962, 10, 10644, 27781, 99, 1052, 6581, 18537, 72838, 47212, 1984, 15270, 2460, 929, 915, 2203, 32070, 997, 57888, 1781, 444, 959, 20653, 22072, 2174, 765, 77099, 15292, 5303, 3395, 4390, 54376, 642, 1884, 19048, ...	[ 0.0091552734375, 0.0174407958984375, 0.042236328125, 0.07598876953125, 0.200927734375, 0.1103515625, 0.2099609375, 0.1121826171875, 0.0968017578125, 0.112548828125, 0.1278076171875, 0.131591796875, 0.055084228515625, 0.1541748046875, 0.0279388427734375, 0.1431884765625, 0.05490112304...	embed
77688448_c1	77688448	haskell	1	like with the first definition I can do: f (Dynamic tr x) = ... Instead of f (Dynamic @a x) = ... But what I find I do anyway is: f (Dynamic @a _ x) = ... Because the type is really handy to have in scope if f has any sub-functions defined that are explicitly typed, and not many functions take TypeRep a as an argument...	like with the first definition I can do: f (Dynamic tr x) = ... Instead of f (Dynamic @a x) = ... But what I find I do anyway is: f (Dynamic @a _ x) = ... Because the type is really handy to have in scope if f has any sub-functions defined that are explicitly typed, and not many functions take TypeRep a as an argument...	[ 0.007659912109375, -0.01318359375, -0.00689697265625, 0.000812530517578125, 0.002471923828125, -0.013671875, -0.009033203125, 0.0019683837890625, 0.0172119140625, -0.0045166015625, -0.00634765625, -0.036865234375, -0.018798828125, 0.00390625, 0.004669189453125, 0.00860595703125, 0.02...	[ 1884, 678, 5117, 80934, 831, 1238, 397, 29673, 21068, 4307, 1022, 2203, 175399, 1374, 11, 7413, 109954, 101, 10644, 6183, 3535, 53, 70820, 1614, 137175, 61924, 143726, 5941, 32354, 60457, 4332, 254, 10, 10750, 38415, 1250, 50878, 3871, 4764...	[ 0.04754638671875, 0.0144805908203125, 0.0246429443359375, 0.2088623046875, 0.04730224609375, 0.1739501953125, 0.062469482421875, 0.174560546875, 0.183837890625, 0.1441650390625, 0.1458740234375, 0.08184814453125, 0.1048583984375, 0.130615234375, 0.0526123046875, 0.0633544921875, 0.07...	embed
70038456_c0	70038456	haskell	0	Title: How should I use all combinations in applicative Problem title: How should I use all combinations in applicative Tags: haskell Problem: How should I use all combinations in applicative I encountered with a haskell problem. Here is the question. toList $ fromList [(+),()] <> fromList [1..3] <*> fromList [10,100...	How should I use all combinations in applicative How should I use all combinations in applicative haskell How Tree Branch Leaf Show Applicative How should I use all combinations in applicative I encountered with a haskell problem. Here is the question. toList is a function that convert the Tree type into list and fromL...	[ 0.002685546875, 0.03466796875, -0.0101318359375, 0.01904296875, 0.0201416015625, 0.0244140625, 0.0054931640625, -0.009521484375, 0.007568359375, -0.03955078125, 0.0002269744873046875, -0.027099609375, 0.0186767578125, 0.041748046875, -0.0223388671875, -0.0023193359375, 0.01611328125,...	[ 11249, 5608, 87, 4527, 756, 162515, 7, 23, 41816, 4935, 1556, 142508, 101344, 21110, 206, 636, 2407, 17367, 5659, 11048, 190647, 2967, 47, 154663, 32354, 96760, 10644, 3934, 5303, 1295, 83, 60457, 12447, 29479, 34166, 136, 1639, 39933, 3501...	[ 0.1033935546875, 0.118408203125, 0.04180908203125, 0.177490234375, 0.2158203125, 0.283203125, 0.1500244140625, 0.068603515625, 0.2152099609375, 0.1903076171875, 0.13232421875, 0.2149658203125, 0.2060546875, 0.1204833984375, 0.05572509765625, 0.0699462890625, 0.1531982421875, 0.1225...	embed
10427217_c0	10427217	haskell	0	Title: Haskell records, cleaner approach? Problem title: Haskell records, cleaner approach? Tags: record, haskell Problem: Haskell records, cleaner approach? I've read about some of the issues with Haskell records, in particular, the fact that two elements in the same module can not have the same name. I understand you...	Haskell records, cleaner approach? Haskell records, cleaner approach? record haskell Haskell HasX d1_x d2_x Haskell records, cleaner approach? I've read about some of the issues with Haskell records, in particular, the fact that two elements in the same module can not have the same name. I understand you can work aroun...	[ -0.00469970703125, 0.00384521484375, 0.0103759765625, -0.0013580322265625, 0.00384521484375, 0.0185546875, -0.0068359375, 0.0011444091796875, 0.0106201171875, -0.0240478515625, -0.009521484375, 0.004180908203125, 0.0106201171875, -0.006561279296875, -0.00830078125, -0.01416015625, 0....	[ 20625, 142508, 115923, 46622, 56, 51515, 17164, 1556, 1542, 104, 418, 304, 425, 37348, 6626, 80854, 5701, 88996, 831, 959, 9351, 4488, 10932, 84797, 73243, 4734, 14602, 62163, 5423, 1286, 18151, 18507, 136, 110527, 21635, 5256, 1884, 34759, ...	[ 0.16748046875, 0.22119140625, 0.2498779296875, 0.2352294921875, 0.140869140625, 0.1756591796875, 0.20068359375, 0.1353759765625, 0.10760498046875, 0.0394287109375, 0.0048828125, 0.029327392578125, 0.015655517578125, 0.093994140625, 0.1326904296875, 0.186767578125, 0.130859375, 0.20...	embed
13757883_c1	13757883	haskell	1	. Is there some way of saying something like this? The alternatives I can see are explicitly giving the full type: m :: Maybe (Char, ((String, String), String, [String], String), String) m = return ('I', (("don't", "really"), "care", ["what", "this"], "type"), "is") Or giving a type signature to a part of the expressi...	. Is there some way of saying something like this? The alternatives I can see are explicitly giving the full type: m :: Maybe (Char, ((String, String), String, [String], String), String) m = return ('I', (("don't", "really"), "care", ["what", "this"], "type"), "is") Or giving a type signature to a part of the expressi...	[ -0.0106201171875, 0.0081787109375, 0.0211181640625, -0.00130462646484375, 0.021484375, -0.0030975341796875, -0.0003833770751953125, -0.01611328125, -0.002960205078125, -0.016845703125, 0.006683349609375, -0.01177978515625, -0.0033721923828125, 0.00860595703125, 0, -0.0079345703125, -...	[ 5, 2685, 3060, 3917, 111, 54433, 9844, 1884, 903, 30700, 831, 1957, 143726, 68772, 4393, 10644, 347, 1984, 83425, 84068, 71713, 23351, 2203, 30646, 568, 4445, 18, 107, 25958, 8804, 124409, 100231, 50986, 164, 138256, 2831, 125195, 21543, 15...	[ 0.0268096923828125, 0.01971435546875, 0.030181884765625, 0.1112060546875, 0.00201416015625, 0.18017578125, 0.10357666015625, 0.13916015625, 0.139404296875, 0.1597900390625, 0.11962890625, 0.03558349609375, 0.12109375, 0.1151123046875, 0.095458984375, 0.2220458984375, 0.149658203125, ...	embed
52591336_c0	52591336	haskell	0	Title: Can I escape the `IO` in `catch` Problem title: Can I escape the `IO` in `catch` Tags: haskell Problem: Can I escape the `IO` in `catch` Here's a type-puzzle for you. So we have catch :: Exception e => IO a -> (e -> IO a) -> IO a Is it possible for me to safely escape IO in the handler. I'm interested in a funct...	Can I escape the `IO` in `catch` Can I escape the `IO` in `catch` haskell MonadError Can Exception MonadIO Can I escape the `IO` in `catch` Here's a type-puzzle for you. So we have Is it possible for me to safely escape IO in the handler. I'm interested in a function with a signature similar to the following: Is this s...	[ -0.0205078125, 0.022216796875, 0.005401611328125, 0.004058837890625, 0.014892578125, -0.00750732421875, -0.0098876953125, -0.0152587890625, 0.0002231597900390625, -0.0123291015625, -0.005279541015625, -0.046875, 0.003753662109375, -0.0007781982421875, 0.01385498046875, 0.00376892089843...	[ 4171, 87, 144281, 70, 17780, 23, 4460, 206, 1556, 142508, 60331, 71, 18468, 31611, 5443, 63928, 10644, 1766, 13894, 133, 765, 2071, 442, 7722, 100, 163, 47, 46002, 35863, 60892, 32354, 138256, 21373, 25632, 903, 82091, 16487, 44691, 43701, ...	[ 0.127685546875, 0.07232666015625, 0.26416015625, 0.0762939453125, 0.26220703125, 0.065673828125, 0.1875, 0.19091796875, 0.10125732421875, 0.230712890625, 0.16845703125, 0.1341552734375, 0.0953369140625, 0.035186767578125, 0.09808349609375, 0.211181640625, 0.0682373046875, 0.0063781...	embed
69489703_c0	69489703	haskell	0	Title: Function to increase count of a tuple in Haskell Problem title: Function to increase count of a tuple in Haskell Tags: tuples, haskell Problem: Function to increase count of a tuple in Haskell So I have a function that takes a character and a list of tuples [tuple is a pair containing a character and an integer]...	Function to increase count of a tuple in Haskell Function to increase count of a tuple in Haskell tuples haskell Haskell Function to increase count of a tuple in Haskell So I have a function that takes a character and a list of tuples [tuple is a pair containing a character and an integer]. If the character matches the...	[ 0.00921630859375, 0.01055908203125, -0.000949859619140625, 0.0025634765625, 0.017333984375, -0.0034332275390625, -0.0252685546875, -0.00494384765625, 0.019775390625, 0.007415771484375, 0.0072021484375, -0.0107421875, 0.0014495849609375, 0.02978515625, 0, -0.00167083740234375, 0.01116...	[ 28670, 10763, 51312, 54529, 111, 10, 370, 8705, 20625, 142508, 47, 23, 99726, 1556, 32354, 51776, 62816, 136, 5303, 458, 80836, 70541, 892, 1505, 14858, 42518, 14012, 158661, 390, 1632, 28412, 237, 83, 151117, 11180, 19388, 18151, 21658, 24...	[ 0.14501953125, 0.0207061767578125, 0.2152099609375, 0.1986083984375, 0.0386962890625, 0.04022216796875, 0.163330078125, 0.227294921875, 0.151611328125, 0.2222900390625, 0.011871337890625, 0.0396728515625, 0.2127685546875, 0.1285400390625, 0.158447265625, 0.046112060546875, 0.13110351...	embed
3012064_c0	3012064	haskell	0	Title: Right rotate of tree in Haskell: how is it work? Problem title: Right rotate of tree in Haskell: how is it work? Tags: haskell, syntax, binary-tree, functional-programming Problem: Right rotate of tree in Haskell: how is it work? I don't know haskell syntax, but I know some FP concepts (like algebraic data types...	Right rotate of tree in Haskell: how is it work? Right rotate of tree in Haskell: how is it work? haskell syntax binary-tree functional-programming Right Haskell Tree Leaf Fork Right rotate of tree in Haskell: how is it work? I don't know haskell syntax, but I know some FP concepts (like algebraic data types, pattern m...	[ 0.02685546875, 0.005401611328125, 0.01507568359375, -0.01495361328125, 0.009765625, 0.00543212890625, -0.0301513671875, -0.015869140625, 0.0022735595703125, -0.016357421875, 0.00142669677734375, 0.00130462646484375, -0.005645751953125, 0.01055908203125, 0.002593994140625, 0.01080322265...	[ 90911, 47014, 67, 53201, 20625, 142508, 3642, 83, 442, 4488, 111, 23, 1556, 6002, 86531, 2394, 62600, 123309, 101344, 636, 2407, 1326, 92, 51006, 23755, 429, 2844, 2053, 52895, 103510, 14858, 77546, 80596, 32354, 73342, 903, 18151, 29459, 2...	[ 0.2103271484375, 0.1861572265625, 0.1224365234375, 0.227783203125, 0.1282958984375, 0.2379150390625, 0.10601806640625, 0.045684814453125, 0.04901123046875, 0.166259765625, 0.0242462158203125, 0.038177490234375, 0.114013671875, 0.048553466796875, 0.1102294921875, 0.0289764404296875, 0...	embed
27289476_c0	27289476	haskell	0	Title: Prime sieve results in (me going to) stack overflow Problem title: Prime sieve results in (me going to) stack overflow Tags: performance, haskell, primes, sieve-algorithm, time-complexity Problem: Prime sieve results in (me going to) stack overflow For project euler i was looking for a way to implement the sieve...	Prime sieve results in (me going to) stack overflow Prime sieve results in (me going to) stack overflow performance haskell primes sieve-algorithm time-complexity Prime x:xs Prime sieve results in (me going to) stack overflow For project euler i was looking for a way to implement the sieve of Eratosthenes because i exp...	[ -0.01470947265625, 0.03271484375, 0.0089111328125, 0.002777099609375, -0.0029754638671875, -0.0150146484375, 0.0113525390625, -0.0120849609375, 0.015380859375, -0.029296875, 0.040771484375, 0.00579833984375, 0.02392578125, 0.0022125244140625, 0.015869140625, 0.004547119140625, -0.009...	[ 56195, 78, 3134, 50339, 282, 7730, 47, 177261, 645, 118664, 23718, 1556, 142508, 20809, 100628, 2783, 1733, 44974, 1022, 425, 23, 13452, 1175, 603, 3917, 29479, 14825, 1952, 2347, 1444, 84751, 4271, 56, 208124, 1257, 32354, 43240, 1284, 596...	[ 0.186767578125, 0.16259765625, 0.1944580078125, 0.153076171875, 0.1131591796875, 0.1075439453125, 0.1171875, 0.15380859375, 0.09857177734375, 0.23779296875, 0.1690673828125, 0.057647705078125, 0.1988525390625, 0.1346435546875, 0.0491943359375, 0.06280517578125, 0.0494384765625, 0.0...	embed
8519964_c0	8519964	haskell	0	Title: How does GHCi pick names for type variables? Problem title: How does GHCi pick names for type variables? Tags: ghc, ghci, haskell, type-inference, type-variables Problem: How does GHCi pick names for type variables? When using the interactive GHC interpreter, it's possible to ask for the inferred type of an expr...	How does GHCi pick names for type variables? How does GHCi pick names for type variables? ghc ghci haskell type-inference type-variables How GHCi Prelude x:xs How does GHCi pick names for type variables? When using the interactive GHC interpreter, it's possible to ask for the inferred type of an expression: It seems th...	[ 0.01416015625, 0.0013275146484375, 0.01153564453125, 0.0230712890625, -0.015869140625, -0.0023651123046875, -0.0113525390625, 0.00946044921875, 0.00921630859375, 0.007537841796875, 0.007110595703125, -0.022216796875, 0.00341796875, 0.01373291015625, 0.006561279296875, 0.00933837890625,...	[ 11249, 14602, 527, 73265, 14, 39580, 123055, 100, 10644, 77336, 31380, 238, 318, 1556, 142508, 73, 69988, 21690, 19736, 1914, 822, 112, 1022, 425, 7, 212398, 29481, 56, 7722, 26458, 53498, 2822, 125195, 37202, 51776, 1295, 138256, 22288, 61...	[ 0.07568359375, 0.0165557861328125, 0.0950927734375, 0.2208251953125, 0.2294921875, 0.1844482421875, 0.2037353515625, 0.0701904296875, 0.2403564453125, 0.2666015625, 0.110107421875, 0.07574462890625, 0.1383056640625, 0.09228515625, 0.1859130859375, 0.01080322265625, 0.1103515625, 0....	embed
3144722_c1	3144722	haskell	1	istribution/Client/BuildReports/Types.o ) [ 2 of 40] Compiling Distribution.Client.Utils ( Distribution/Client/Utils.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Utils.o ) ... two warnings about not used addPackageExcludeConstraint and response ... [39 of 40] Compiling Distribution.Client.Install ( Distribution/C...	istribution/Client/BuildReports/Types.o ) [ 2 of 40] Compiling Distribution.Client.Utils ( Distribution/Client/Utils.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Utils.o ) ... two warnings about not used addPackageExcludeConstraint and response ... [39 of 40] Compiling Distribution.Client.Install ( Distribution/C...	[ 0.010498046875, 0.00115966796875, 0.0235595703125, -0.007659912109375, -0.0164794921875, -0.0203857421875, -0.01251220703125, 0.003570556640625, 0.0079345703125, 0.02490234375, -0.0025482177734375, -0.01116943359375, 0.00732421875, 0.01068115234375, -0.001678466796875, -0.0075073242187...	[ 83, 179236, 150, 2517, 121137, 56829, 196707, 31, 1112, 15612, 49725, 75571, 1363, 106742, 7870, 127, 271, 177149, 408, 3571, 2676, 6626, 1631, 959, 11814, 15190, 205956, 4588, 29786, 2816, 57553, 9323, 92621, 2839, 12321, 168793, 12779, 45, ...	[ 0.038543701171875, 0.1583251953125, 0.1002197265625, 0.0933837890625, 0.09521484375, 0.1529541015625, 0.1478271484375, 0.1114501953125, 0.0943603515625, 0.09033203125, 0.0972900390625, 0.18310546875, 0.00018310546875, 0.1201171875, 0.1048583984375, 0.04925537109375, 0.0426025390625, ...	embed
14180111_c0	14180111	haskell	0	Title: Chaining Haskell Functions in data types Problem title: Chaining Haskell Functions in data types Tags: ghc, haskell Problem: Chaining Haskell Functions in data types Lets say I have the following: data FuncAndValue v res = FuncAndValue (v -> res) v chain :: (res -> new_res) -> FuncAndValue v res -> FuncAndValue ...	Chaining Haskell Functions in data types Chaining Haskell Functions in data types ghc haskell Chaining Haskell Functions FuncAndValue new_res new_f old_f Chaining Haskell Functions in data types Lets say I have the following: Is GHC likely to be able to combine functions new_f and old_f into a single function through i...	[ -0.00555419921875, 0.00034332275390625, -0.0003223419189453125, 0.01495361328125, 0.013427734375, 0.00946044921875, -0.01953125, -0.01507568359375, 0.0137939453125, -0.0245361328125, -0.0126953125, -0.00506591796875, 0.01220703125, -0.0013427734375, -0.001983642578125, 0.00711059570312...	[ 4841, 14653, 20625, 142508, 28670, 10763, 2053, 52895, 31380, 238, 1556, 37839, 856, 50770, 3525, 2109, 420, 10332, 527, 73265, 47041, 19048, 70163, 32354, 454, 136, 11001, 8305, 23, 150, 592, 3082, 214, 109954, 173702, 18, 87235, 5256, 188...	[ 0.1748046875, 0.1312255859375, 0.1610107421875, 0.272216796875, 0.1751708984375, 0.05975341796875, 0.1279296875, 0.2578125, 0.1236572265625, 0.0958251953125, 0.161865234375, 0.080322265625, 0.079833984375, 0.110107421875, 0.117431640625, 0.1055908203125, 0.1702880859375, 0.14147949...	embed
3875369_c1	3875369	haskell	1	any way to restructure the function so that it is tail-recursive (or at least doesn't overflow the stack)? Thanks in advance, and sorry for the massive code listing. playAll' :: (Num a) => UnscoredPlayer -> Bool -> String -> [String] -> (a,a,a) -> (a,a,a) playAll' player playerTurn board boards (w,ls,t)= if won == sel...	any way to restructure the function so that it is tail-recursive (or at least doesn't overflow the stack)? Thanks in advance, and sorry for the massive code listing. playAll' :: (Num a) => UnscoredPlayer -> Bool -> String -> [String] -> (a,a,a) -> (a,a,a) playAll' player playerTurn board boards (w,ls,t)= if won == sel...	[ -0.00107574462890625, 0.014404296875, 0.01806640625, 0.0166015625, 0.0167236328125, -0.001495361328125, -0.0191650390625, -0.0201416015625, 0.0164794921875, 0.015869140625, 0.01226806640625, 0.0194091796875, 0.01416015625, 0.00726318359375, -0.00616455078125, -0.018310546875, -0.0183...	[ 2499, 3917, 47, 456, 137656, 70, 32354, 221, 450, 83, 46741, 107, 48650, 5844, 19713, 22027, 18, 645, 118664, 177261, 59090, 106750, 18151, 5303, 5, 11301, 43512, 25, 1984, 839, 316, 10, 44357, 992, 12064, 2822, 142581, 33079, 2460, 929, ...	[ 0.0277862548828125, 0.08111572265625, 0.045318603515625, 0.135009765625, 0.2841796875, 0.0328369140625, 0.2275390625, 0.043853759765625, 0.0157470703125, 0.03912353515625, 0.265869140625, 0.058624267578125, 0.18701171875, 0.10791015625, 0.030731201171875, 0.01849365234375, 0.03536987...	embed
28547428_c0	28547428	haskell	0	Title: Creating a csv file in haskell Problem title: Creating a csv file in haskell Tags: haskell, csv Problem: Creating a csv file in haskell I suspect this a bit of a noobie question... So I have a list myList that I would like to write to a csv file, using the cassava library: import qualified Data.ByteString.Lazy a...	Creating a csv file in haskell Creating a csv file in haskell haskell csv qualified Data.Csv Creating Data.ByteString.Lazy Data.Vector BL.writeFile V.fromList ToRecord Vector ByteString Couldn V.Vector Creating a csv file in haskell I suspect this a bit of a noobie question... So I have a list myList that I would like ...	[ -0.001678466796875, 0.003814697265625, 0.001922607421875, 0.020751953125, 0.00128173828125, 0.007049560546875, -0.000644683837890625, -0.00384521484375, 0.005279541015625, -0.003021240234375, -0.01263427734375, -0.03173828125, 0.016357421875, 0.0152587890625, -0.0284423828125, -0.01574...	[ 56781, 20763, 334, 11435, 1556, 142508, 23, 217225, 11809, 441, 67756, 75358, 67, 71713, 214, 2729, 3285, 26455, 18770, 68170, 18781, 174350, 310, 161063, 154663, 717, 32271, 2609, 3311, 191147, 19, 92610, 4785, 9014, 5303, 759, 1884, 33022, ...	[ 0.1405029296875, 0.1422119140625, 0.248046875, 0.1591796875, 0.143310546875, 0.2442626953125, 0.03607177734375, 0.166748046875, 0.07037353515625, 0.01666259765625, 0.2225341796875, 0.06500244140625, 0.1065673828125, 0.163330078125, 0.054412841796875, 0.0635986328125, 0.1448974609375,...	embed
43253228_c0	43253228	haskell	0	Title: GLUT Error in Haskell Program Problem title: GLUT Error in Haskell Program Tags: freeglut, glut, opengl, haskell Problem: GLUT Error in Haskell Program I'm using OpenGL with Haskell. I tried a sample program, it compiled successfully using ghc Compiler but when I run it, I get this error user error (unknown GLUT...	GLUT Error in Haskell Program GLUT Error in Haskell Program freeglut glut opengl haskell Graphics.Rendering.OpenGL Graphics.UI.GLUT GLUT Error Haskell Program _progName _args _window Hello World ColorBuffer GLUT Error in Haskell Program I'm using OpenGL with Haskell. I tried a sample program, it compiled successfully u...	[ 0.00860595703125, 0.0191650390625, -0.0026702880859375, -0.016845703125, 0.006927490234375, 0.003631591796875, -0.0022430419921875, -0.020263671875, -0.00604248046875, -0.0078125, 0.0025177001953125, -0.04248046875, 0.00860595703125, -0.006072998046875, -0.00201416015625, 0.00018978118...	[ 527, 143662, 212059, 23, 20625, 142508, 7663, 4092, 159632, 167994, 9803, 11016, 1556, 189682, 111747, 103264, 78703, 33457, 724, 75620, 163612, 61477, 9494, 24293, 35378, 6661, 51193, 7235, 18234, 13527, 678, 37842, 121413, 1528, 5974, 65771, ...	[ 0.11962890625, 0.301513671875, 0.200927734375, 0.0243682861328125, 0.14453125, 0.255859375, 0.1859130859375, 0.079833984375, 0.277099609375, 0.265869140625, 0.0849609375, 0.1544189453125, 0.113037109375, 0.1358642578125, 0.06390380859375, 0.067138671875, 0.1964111328125, 0.02790832...	embed
31735944_c1	31735944	haskell	1	m) (StateT st' m) st st') arising from a use of `zoom' from the context (Zoomed (Engine st m) ~ Zoomed (Engine st' m), mtl-2.1.3.1:Control.Monad.State.Class.MonadState st (Engine st m), mtl-2.1.3.1:Control.Monad.State.Class.MonadState st' (Engine st' m), Monad m) bound by the instance declaration at Test.hs:22:10-62 I...	m) (StateT st' m) st st') arising from a use of `zoom' from the context (Zoomed (Engine st m) ~ Zoomed (Engine st' m), mtl-2.1.3.1:Control.Monad.State.Class.MonadState st (Engine st m), mtl-2.1.3.1:Control.Monad.State.Class.MonadState st' (Engine st' m), Monad m) bound by the instance declaration at Test.hs:22:10-62 I...	[ -0.01263427734375, -0.006256103515625, 0.002105712890625, -0.00098419189453125, -0.0072021484375, 0.0032501220703125, -0.022216796875, -0.0263671875, -0.0146484375, 0.00750732421875, 0.002044677734375, 0.0269775390625, 0.003387451171875, 0.000514984130859375, 0.00124359130859375, -0.00...	[ 347, 16, 135206, 13, 618, 6138, 25, 187, 72219, 1295, 4527, 111, 1158, 306, 43701, 60551, 297, 91384, 1212, 97170, 141, 68107, 97109, 175904, 5, 46674, 712, 140803, 60331, 71, 99091, 110527, 21635, 1363, 8647, 127, 24070, 15110, 10837, 36...	[ 0.1678466796875, 0.0838623046875, 0.149169921875, 0.0740966796875, 0.1539306640625, 0.1519775390625, 0.1343994140625, 0.1253662109375, 0.0743408203125, 0.07208251953125, 0.1348876953125, 0.00482177734375, 0.18359375, 0.218505859375, 0.179443359375, 0.1668701171875, 0.1414794921875, ...	embed
55380861_c0	55380861	haskell	0	Title: default values for PersistList on SQLite - Yesod Problem title: default values for PersistList on SQLite - Yesod Tags: yesod, persistent, haskell Problem: default values for PersistList on SQLite - Yesod I would like to add a PersistList value into a user entity with a default value. My model file looks like thi...	default values for PersistList on SQLite - Yesod default values for PersistList on SQLite - Yesod yesod persistent haskell PersistList SQLite Yesod Models.hs User Text Maybe UniqueUser Privileges PrvDemoOne Typeable PrvDemoTwo Show Read default values for PersistList on SQLite - Yesod I would like to add a PersistList ...	[ 0.00482177734375, 0.0216064453125, -0.001953125, 0.0059814453125, -0.01373291015625, 0.0128173828125, -0.00927734375, -0.0216064453125, 0.01202392578125, 0.009521484375, 0.00555419921875, -0.000637054443359375, 0.00439453125, 0.021728515625, -0.03076171875, -0.004852294921875, 0.0186...	[ 114977, 142424, 57309, 271, 154663, 98, 80866, 1486, 32635, 2199, 2422, 23722, 70560, 1556, 142508, 13293, 127, 53400, 24129, 83425, 11789, 1062, 2189, 241114, 15853, 334, 168678, 62068, 60457, 2886, 3613, 17367, 4764, 1884, 15190, 34292, 38937...	[ 0.281005859375, 0.21533203125, 0.1986083984375, 0.1612548828125, 0.259765625, 0.02288818359375, 0.151123046875, 0.2093505859375, 0.1343994140625, 0.2130126953125, 0.0751953125, 0.1553955078125, 0.2135009765625, 0.07598876953125, 0.1815185546875, 0.185302734375, 0.0830078125, 0.0952...	embed
55434665_c0	55434665	haskell	0	Title: Normalizing TypeNats Inequalities Problem title: Normalizing TypeNats Inequalities Tags: types, data-kinds, haskell Problem: Normalizing TypeNats Inequalities I have two functions both with a Nat (from TypeNats) kind that both have a comparison type operator <= . The constraint 2 <= n for function b contains the...	Normalizing TypeNats Inequalities Normalizing TypeNats Inequalities types data-kinds haskell GHC.TypeNats Data.Proxy a the b Normalizing TypeNats Inequalities LANGUAGE KindSignatures TypeOperators ScopedTypeVariables DataKinds TypeFamilies Nat Proxy Could Example.hs:9:1-48 Relevant Example.hs:10:1 Normalizing TypeNats ...	[ -0.002349853515625, -0.0135498046875, 0.003204345703125, 0.0169677734375, 0.00653076171875, 0.0069580078125, -0.0283203125, 0.00494384765625, -0.00482177734375, 0.0177001953125, 0.0033416748046875, -0.01312255859375, 0.0174560546875, 0.0218505859375, 0.01165771484375, -0.00057983398437...	[ 28723, 84382, 60457, 4645, 933, 360, 13, 71723, 52895, 2053, 68347, 1556, 142508, 527, 73265, 196707, 11809, 10752, 50878, 10, 70, 876, 98064, 27435, 218723, 156823, 182783, 81827, 7250, 68875, 1250, 191147, 89536, 127, 1126, 19721, 9285, 151...	[ 0.1846923828125, 0.117431640625, 0.1881103515625, 0.1669921875, 0.06488037109375, 0.0755615234375, 0.083984375, 0.140869140625, 0.173095703125, 0.057342529296875, 0.1136474609375, 0.08917236328125, 0.1875, 0.047515869140625, 0.1265869140625, 0.1611328125, 0.044097900390625, 0.09637...	embed
59461779_c0	59461779	haskell	0	Title: Unexpected result from combinatory recursive function Problem title: Unexpected result from combinatory recursive function Tags: haskell, recursion Problem: Unexpected result from combinatory recursive function I have a sequence of natural numbers at specific power ( n ) until an upper limit ( x ) starting from ...	Unexpected result from combinatory recursive function Unexpected result from combinatory recursive function haskell recursion combinatory Unexpected x:xs CORRECT WRONG Unexpected result from combinatory recursive function I have a sequence of natural numbers at specific power ( n ) until an upper limit ( x ) starting f...	[ -0.022216796875, 0.0184326171875, 0.004730224609375, -0.0011138916015625, 0.004486083984375, 0.002471923828125, 0.003570556640625, 0.01055908203125, 0.01708984375, -0.013671875, 0.0028228759765625, -0.00244140625, 0.02099609375, 0.0196533203125, -0.002777099609375, -0.00035858154296875...	[ 992, 83613, 13, 89829, 16750, 1295, 22321, 31667, 195625, 5844, 32354, 1556, 142508, 1830, 1022, 12, 425, 70555, 1052, 115055, 765, 40, 944, 3956, 6083, 101935, 99, 29458, 14537, 653, 24189, 1407, 56, 17475, 72134, 615, 116, 190, 201, 483...	[ 0.04425048828125, 0.1014404296875, 0.0950927734375, 0.05108642578125, 0.1461181640625, 0.0606689453125, 0.215576171875, 0.13720703125, 0.21142578125, 0.07464599609375, 0.1434326171875, 0.1129150390625, 0.206298828125, 0.006591796875, 0.0780029296875, 0.047637939453125, 0.07861328125,...	embed
60068693_c0	60068693	haskell	0	Title: Understanding output of runWriter (return 3 :: Writer String Int) Problem title: Understanding output of runWriter (return 3 :: Writer String Int) Tags: haskell Problem: Understanding output of runWriter (return 3 :: Writer String Int) I'm reading http://learnyouahaskell.com/for-a-few-monads-more and there's thi...	Understanding output of runWriter (return 3 :: Writer String Int) Understanding output of runWriter (return 3 :: Writer String Int) haskell Understanding Writer Monoid Monad Understanding output of runWriter (return 3 :: Writer String Int) I'm reading http://learnyouahaskell.com/for-a-few-monads-more and there's this e...	[ -0.01495361328125, 0.006134033203125, 0.002716064453125, 0.00579833984375, 0.0035858154296875, 0.007049560546875, 0.0021514892578125, -0.030517578125, 0.000759124755859375, 0.019287109375, 0.00052642822265625, 0.0096435546875, 0.00830078125, 0.01263427734375, 0.00616455078125, -0.01611...	[ 9626, 144057, 140992, 11675, 1456, 2783, 56, 65395, 138, 23351, 360, 18, 1556, 142508, 601, 77879, 532, 60331, 71, 214, 16454, 7232, 7, 87039, 6468, 27781, 219836, 30646, 158, 9297, 10644, 5608, 8337, 363, 757, 3884, 163, 2676, 939, 186, ...	[ 0.04296875, 0.032135009765625, 0.212646484375, 0.114501953125, 0.0665283203125, 0.185302734375, 0.1627197265625, 0.1243896484375, 0.1610107421875, 0.1287841796875, 0.10577392578125, 0.09649658203125, 0.09869384765625, 0.18701171875, 0.02093505859375, 0.09649658203125, 0.0702514648437...	embed
24597954_c1	24597954	haskell	1	... Preprocessing executable 'jmacro-snap-example' for jmacro-snap-example-0.1.0.0... [1 of 1] Compiling Main ( Main.hs, dist/build/jmacro-snap-example/jmacro-snap-example-tmp/Main.o ) Main.hs:22:38: parse error on input `{' So it seems like the ghc's having an issue with the jmacro quasi-quoter expression. I'm not sur...	... Preprocessing executable 'jmacro-snap-example' for jmacro-snap-example-0.1.0.0... [1 of 1] Compiling Main ( Main.hs, dist/build/jmacro-snap-example/jmacro-snap-example-tmp/Main.o ) Main.hs:22:38: parse error on input `{' So it seems like the ghc's having an issue with the jmacro quasi-quoter expression. I'm not sur...	[ -0.0074462890625, 0.01092529296875, -0.01458740234375, -0.00860595703125, -0.00677490234375, 0.04052734375, -0.006134033203125, -0.000690460205078125, -0.006072998046875, -0.028076171875, -0.0172119140625, -0.016845703125, -0.00933837890625, -0.024169921875, 0.006988525390625, 0.017822...	[ 1914, 63923, 71924, 2886, 170, 192, 15322, 10957, 3355, 11, 33209, 1647, 102014, 99929, 15612, 49725, 12321, 127, 271, 177149, 2676, 168793, 31, 24070, 34179, 366, 184, 18499, 98, 107730, 9473, 24854, 37202, 31380, 238, 31089, 12404, 9, 415...	[ 0.1268310546875, 0.181640625, 0.1339111328125, 0.0933837890625, 0.0963134765625, 0.121337890625, 0.229248046875, 0.224853515625, 0.139404296875, 0.1510009765625, 0.1334228515625, 0.1236572265625, 0.1744384765625, 0.1865234375, 0.1004638671875, 0.13818359375, 0.1285400390625, 0.0526...	embed
48324939_c1	48324939	haskell	1	Post I need a data structure like this one in Servant data BlogPostRequest = BlogPostRequest { title :: String, published :: DateTime, public :: Bool, category_ids :: Maybe [Int], tag_ids :: Maybe [Int] } The endpoint will take all the fields related to the Blog model and store it as a new Blog instance. It will then ...	Post I need a data structure like this one in Servant data BlogPostRequest = BlogPostRequest { title :: String, published :: DateTime, public :: Bool, category_ids :: Maybe [Int], tag_ids :: Maybe [Int] } The endpoint will take all the fields related to the Blog model and store it as a new Blog instance. It will then ...	[ 0.0038909912109375, 0.0146484375, 0.00897216796875, -0.0050048828125, -0.00628662109375, 0.02783203125, 0.00003123283386230469, -0.0045166015625, 0.0145263671875, -0.03564453125, 0.005706787109375, 0.0028228759765625, -0.020751953125, 0.0087890625, -0.006103515625, 0.0019989013671875, ...	[ 2795, 3871, 2053, 45646, 1884, 5406, 30624, 5061, 49411, 4332, 75616, 44759, 23351, 91376, 70059, 3835, 2460, 929, 95487, 30185, 83425, 7909, 3564, 38496, 5646, 756, 44457, 62548, 3299, 4343, 3525, 110527, 91582, 13379, 116822, 23180, 50509, ...	[ 0.1217041015625, 0.090576171875, 0.1558837890625, 0.214599609375, 0.04705810546875, 0.1444091796875, 0.2294921875, 0.1773681640625, 0.1148681640625, 0.02587890625, 0.1434326171875, 0.088134765625, 0.091796875, 0.0950927734375, 0.1219482421875, 0.09619140625, 0.02197265625, 0.151367...	embed
793935_c0	793935	haskell	0	Title: Haskell: Replacing element with a given key in an association list Problem title: Haskell: Replacing element with a given key in an association list Tags: list, haskell Problem: Haskell: Replacing element with a given key in an association list I've got to make a function which is given a key (as a String ), a v...	Haskell: Replacing element with a given key in an association list Haskell: Replacing element with a given key in an association list list haskell Haskell Replacing Maybe Haskell: Replacing element with a given key in an association list I've got to make a function which is given a key (as a String ), a value (as a Str...	[ -0.0196533203125, 0.0179443359375, -0.0079345703125, -0.0018310546875, 0.003875732421875, 0.00506591796875, 0.000972747802734375, -0.00396728515625, 0.01611328125, 0.030029296875, 0.01519775390625, 0.0035400390625, -0.004852294921875, -0.02783203125, 0.007354736328125, 0.00588989257812...	[ 20625, 142508, 853, 133266, 12830, 678, 34475, 22799, 125413, 5303, 1556, 83425, 23, 3249, 32354, 162, 23351, 34292, 136, 142424, 71713, 131148, 15190, 27494, 80836, 3564, 21771, 13379, 137272, 154109, 10332, 37842, 6713, 2037, 98, 9077, 140992...	[ 0.1021728515625, 0.21923828125, 0.0723876953125, 0.165283203125, 0.1558837890625, 0.0968017578125, 0.0869140625, 0.1968994140625, 0.1810302734375, 0.171630859375, 0.069091796875, 0.2437744140625, 0.004608154296875, 0.021697998046875, 0.1785888671875, 0.053955078125, 0.1290283203125, ...	embed
68892302_c0	68892302	haskell	0	Title: Is it possible to write an Alternative instance for Identity a if there's a Monoid for a? Problem title: Is it possible to write an Alternative instance for Identity a if there's a Monoid for a? Tags: alternative-functor, haskell Problem: Is it possible to write an Alternative instance for Identity a i...	Is it possible to write an Alternative instance for Identity a if there's a Monoid for a? Is it possible to write an Alternative instance for Identity a if there's a Monoid for a? alternative-functor haskell Alternative Identity Monoid Is it possible to write an Alternative instance for Identity a if there's ...	[ -0.01409912109375, 0.00830078125, 0.0203857421875, 0.027099609375, 0.0128173828125, 0.016357421875, -0.004974365234375, -0.006072998046875, 0.00107574462890625, 0.01202392578125, -0.00933837890625, 0.0220947265625, 0.006866455078125, 0.00958251953125, -0.0017852783203125, -0.0034332275...	[ 2071, 442, 7722, 33022, 142, 103905, 110527, 100, 71257, 2481, 10, 2174, 2685, 3768, 77879, 532, 47, 30700, 16498, 18770, 1556, 142508, 1884, 3525, 50986, 182355, 191, 7941, 208124, 69201, 52895, 23468, 14192, 9969, 34759, 3444, 61924, 4734, ...	[ 0.04095458984375, 0.0231170654296875, 0.176513671875, 0.1951904296875, 0.060882568359375, 0.2305908203125, 0.259765625, 0.10247802734375, 0.1925048828125, 0.1380615234375, 0.195068359375, 0.09521484375, 0.045928955078125, 0.0333251953125, 0.220703125, 0.2227783203125, 0.0246276855468...	embed

57967169_c0

57967169

haskell

0

Title: Trying to Upgrade Haskell stack Problem title: Trying to Upgrade Haskell stack Tags: haskell, haskell-stack, command-line Problem: Trying to Upgrade Haskell stack I have Haskell stack installed on my computer and when I type in stack --version I get Version 1.5.1 x86_64 Compiled with: and it's a bunch of differe...

Trying to Upgrade Haskell stack Trying to Upgrade Haskell stack haskell haskell-stack command-line Trying Upgrade Haskell Version x86_64 Compiled Downloading github.com v2.1.3 stack-2.1.3-linux-x86_64-static.tar.gz Download Git hpack-0.31.2 WARNING Installation PATH Trying to Upgrade Haskell stack I have Haskell stack ...

[ -0.00653076171875, 0.0235595703125, 0.0147705078125, 0.01177978515625, -0.0012664794921875, -0.00537109375, -0.0299072265625, 0.0035247802734375, -0.0145263671875, 0.0242919921875, 0.00034332275390625, -0.00970458984375, 0.01519775390625, -0.0078125, -0.00159454345703125, -0.0014572143...

[ 40858, 214, 10091, 44286, 20625, 142508, 177261, 47, 1556, 590, 2594, 75101, 2256, 40647, 1022, 15276, 13307, 15612, 4857, 62270, 32102, 5, 277, 81, 5442, 81046, 5428, 2397, 6077, 201939, 867, 527, 217, 1096, 29102, 170179, 48400, 60873, 25...

[ 0.1549072265625, 0.04681396484375, 0.1561279296875, 0.1947021484375, 0.1671142578125, 0.27197265625, 0.22607421875, 0.0310516357421875, 0.1517333984375, 0.165283203125, 0.14453125, 0.13916015625, 0.075439453125, 0.119384765625, 0.003814697265625, 0.2005615234375, 0.1722412109375, 0...

embed

16987904_c0

16987904

haskell

0

Title: Haskell: typeclass and instance (Not in scope: data constructor..) Problem title: Haskell: typeclass and instance (Not in scope: data constructor..) Tags: typeclass, instance, haskell Problem: Haskell: typeclass and instance (Not in scope: data constructor..) I want to make a typeclass Size with a method that gi...

Haskell: typeclass and instance (Not in scope: data constructor..) Haskell: typeclass and instance (Not in scope: data constructor..) typeclass instance haskell Haskell Not Size Bool example4 Haskell: typeclass and instance (Not in scope: data constructor..) I want to make a typeclass Size with a method that given a va...

[ 0.007476806640625, -0.00067901611328125, 0.00714111328125, 0.02001953125, 0.0009765625, 0.00518798828125, -0.004241943359375, 0.01312255859375, 0.0032806396484375, -0.0084228515625, -0.0198974609375, -0.031005859375, 0.00897216796875, 0.019775390625, 0.01043701171875, -0.00381469726562...

[ 20625, 142508, 10644, 67413, 136, 110527, 122116, 70820, 2053, 64549, 748, 1556, 11205, 80378, 2460, 929, 27781, 617, 3444, 3249, 55300, 34475, 34292, 7077, 14012, 25251, 23, 903, 5608, 8337, 190, 18499, 48205, 12, 127167, 13, 4527, 360, 18...

[ 0.1185302734375, 0.2191162109375, 0.20556640625, 0.259521484375, 0.0682373046875, 0.2122802734375, 0.138671875, 0.1875, 0.09747314453125, 0.1689453125, 0.10693359375, 0.08306884765625, 0.1385498046875, 0.1953125, 0.084716796875, 0.168701171875, 0.09210205078125, 0.1080322265625, ...

embed

17518749_c0

17518749

haskell

0

Title: How to "change" single values in large objects in elegant way? Problem title: How to "change" single values in large objects in elegant way? Tags: haskell Problem: How to "change" single values in large objects in elegant way? For example, i have data ShipDesign = ShipDesign { offense :: Offe...

How to "change" single values in large objects in elegant way? How to "change" single values in large objects in elegant way? haskell How ShipDesign Offense Defense Integer How to "change" single values in large objects in elegant way? For example, i have Now i want to change the defense. The known ...

[ -0.00830078125, 0.00445556640625, 0.00201416015625, 0.0185546875, 0.010498046875, -0.0115966796875, -0.0322265625, -0.008544921875, 0.0106201171875, 0.02978515625, -0.000789642333984375, 0.014892578125, 0.0026397705078125, 0.00057220458984375, 0.0098876953125, -0.020751953125, -0.005...

[ 11249, 47, 152028, 11001, 142424, 23, 21334, 36746, 27650, 3917, 1556, 142508, 8294, 254, 128640, 9791, 21161, 207068, 44401, 765, 14240, 17, 3444, 15549, 70, 165815, 51529, 54, 903, 56112, 18, 27528, 6863, 39210, 1660, 10846, 117, 29954, 3...

[ 0.128173828125, 0.0806884765625, 0.26123046875, 0.231201171875, 0.2386474609375, 0.0802001953125, 0.1693115234375, 0.2049560546875, 0.2086181640625, 0.1038818359375, 0.1339111328125, 0.2218017578125, 0.1444091796875, 0.0682373046875, 0.2237548828125, 0.12939453125, 0.064697265625, ...

embed

24346667_c0

24346667

haskell

0

Title: Converting Integer into list of digits without 'mod' and 'div' Problem title: Converting Integer into list of digits without 'mod' and 'div' Tags: haskell Problem: Converting Integer into list of digits without 'mod' and 'div' I currently have the Haskell function below wh...

Converting Integer into list of digits without 'mod' and 'div' Converting Integer into list of digits without 'mod' and 'div' haskell Converting Integer Converting Integer into list of digits without 'mod' and 'div' I currently have the Haskell function below which converts an in...

[ -0.0162353515625, 0.0028076171875, 0.0004405975341796875, -0.00640869140625, -0.005767822265625, 0.025390625, -0.0216064453125, -0.005859375, -0.005950927734375, -0.037841796875, -0.000339508056640625, -0.0181884765625, -0.0072021484375, 0.00494384765625, -0.0023651123046875, 0.0031280...

[ 1657, 814, 1916, 44401, 3934, 5303, 111, 153939, 7, 15490, 3768, 13415, 30618, 1556, 142508, 136, 82424, 765, 20625, 32354, 35064, 96760, 892, 1505, 39958, 1295, 7311, 9655, 3917, 54, 903, 17368, 2811, 18221, 2174, 36663, 5701, 13580, 678, ...

[ 0.053466796875, 0.13916015625, 0.0570068359375, 0.255615234375, 0.11865234375, 0.1806640625, 0.045867919921875, 0.208984375, 0.06573486328125, 0.1357421875, 0.07562255859375, 0.15966796875, 0.1854248046875, 0.1212158203125, 0.239013671875, 0.0816650390625, 0.080810546875, 0.0211181...

embed

52615752_c0

52615752

haskell

0

Title: Having trouble getting the first value from a Haskell Tuple Problem title: Having trouble getting the first value from a Haskell Tuple Tags: haskell, functional-programming Problem: Having trouble getting the first value from a Haskell Tuple I have a value that is in the form of ([(Int, Int, Int)], Int, Int) I n...

Having trouble getting the first value from a Haskell Tuple Having trouble getting the first value from a Haskell Tuple haskell functional-programming a it Having Haskell Tuple Couldn Relevant Having trouble getting the first value from a Haskell Tuple I have a value that is in the form of ([(Int, Int, Int)], Int, Int)...

[ 0.017578125, 0.00112152099609375, -0.004302978515625, 0.0166015625, -0.0098876953125, 0.0081787109375, -0.00543212890625, 0.002227783203125, 0.00933837890625, -0.039794921875, 0.007049560546875, 0.004608154296875, -0.0079345703125, 0.0291748046875, -0.01336669921875, 0.0003547668457031...

[ 171855, 63134, 20949, 5117, 34292, 1295, 20625, 142508, 1371, 8705, 70, 1556, 123309, 28966, 442, 191147, 19, 853, 133, 30624, 765, 3173, 4153, 18, 360, 3871, 32354, 5646, 2053, 30646, 759, 5303, 24, 4806, 11675, 1238, 271, 903, 18499, 10...

[ 0.04522705078125, 0.1654052734375, 0.1258544921875, 0.1947021484375, 0.232666015625, 0.094970703125, 0.147705078125, 0.2381591796875, 0.1292724609375, 0.1983642578125, 0.030548095703125, 0.1396484375, 0.1448974609375, 0.06976318359375, 0.114990234375, 0.14599609375, 0.01861572265625,...

embed

32861367_c0

32861367

haskell

0

Title: infinite type error in haskell when trying to translate python function into haskell. Why? Problem title: infinite type error in haskell when trying to translate python function into haskell. Why? Tags: haskell, algorithm, python Problem: infinite type error in haskell when trying to translate python function in...

infinite type error in haskell when trying to translate python function into haskell. Why? infinite type error in haskell when trying to translate python function into haskell. Why? haskell algorithm python acc iter Why get_N_Partition_Permutations n-1 partitionArr.hs Occurs Expected Actual Relevant partitionArr.hs:21:...

[ -0.009521484375, -0.0181884765625, -0.00007963180541992188, -0.011962890625, -0.0108642578125, 0.00811767578125, -0.0067138671875, -0.02392578125, 0.0038299560546875, -0.0181884765625, -0.00193023681640625, -0.0179443359375, 0.0247802734375, -0.0108642578125, -0.00909423828125, 0.00939...

[ 54241, 13, 10644, 18499, 1556, 142508, 31577, 3900, 19309, 17198, 50828, 32354, 3934, 44084, 234873, 50015, 720, 2046, 839, 58229, 14, 1363, 15277, 14311, 21094, 653, 5759, 2878, 7614, 42, 127, 48650, 60075, 100582, 133, 25619, 23988, 527, ...

[ 0.182861328125, 0.0787353515625, 0.208984375, 0.205810546875, 0.1473388671875, 0.2242431640625, 0.0433349609375, 0.10455322265625, 0.1361083984375, 0.0938720703125, 0.1268310546875, 0.1241455078125, 0.1041259765625, 0.06793212890625, 0.13818359375, 0.0391845703125, 0.1544189453125, ...

embed

54527244_c0

54527244

haskell

0

Title: Checking multiple conditions in a case Problem title: Checking multiple conditions in a case Tags: ghc, ghci, haskell Problem: Checking multiple conditions in a case Suppose I have this (inserting into a BST): mybstInsert k inp@(INode left key right) | k < key = myNode (mybstInsert k left) key right | k > key = ...

Checking multiple conditions in a case Checking multiple conditions in a case ghc ghci haskell Checking INode Checking multiple conditions in a case Suppose I have this (inserting into a BST): What I want is, in the second condition, I want another check as well (checking if right is empty or not). So I want to break t...

[ -0.0181884765625, -0.01171875, 0.003326416015625, 0.00003600120544433594, 0.01019287109375, 0.00634765625, 0.0035858154296875, -0.0234375, 0.03466796875, -0.01318359375, 0.02734375, -0.0098876953125, -0.00396728515625, -0.00689697265625, -0.01068115234375, 0.01470947265625, 0.0173339...

[ 38679, 214, 48716, 27289, 7225, 23, 31380, 238, 318, 1556, 142508, 5881, 31, 112, 2189, 335, 8545, 3444, 17932, 35431, 15700, 12765, 78292, 2174, 7108, 201505, 959, 36356, 7565, 3934, 6626, 83, 134332, 939, 32354, 51776, 1614, 62600, 14192,...

[ 0.200927734375, 0.046051025390625, 0.209228515625, 0.260498046875, 0.2098388671875, 0.039215087890625, 0.0819091796875, 0.08746337890625, 0.1163330078125, 0.09332275390625, 0.2078857421875, 0.029571533203125, 0.1129150390625, 0.1600341796875, 0.05413818359375, 0.02069091796875, 0.166...

embed

62234428_c1

62234428

haskell

1

uce (B g0) arising from a use of ‘d’ from the context: (B n, F n) bound by the type signature for: m :: forall (n :: * -> *) o. (B n, F n) => o -> o at j.hs:19:1-37 The type variable ‘g0’ is ambiguous These potential instance exist: instance B J -- Defined at j.hs:13:10 • In the second argument of ‘(.)’, namely ‘d’ In ...

[ 0.004150390625, 0.00775146484375, 0.00634765625, 0.0023345947265625, 0.00933837890625, 0.0113525390625, -0.0203857421875, -0.005706787109375, 0.01202392578125, -0.0224609375, -0.006072998046875, -0.01177978515625, 0.0194091796875, -0.0091552734375, -0.00897216796875, -0.0123291015625, ...

[ 75, 329, 571, 706, 77495, 187, 4527, 71, 1295, 43701, 653, 563, 99091, 10644, 138256, 347, 1984, 5584, 661, 36, 33079, 1647, 23988, 133015, 966, 77336, 177, 2389, 920, 12282, 10821, 38516, 110527, 32316, 335, 821, 5983, 15110, 17932, 1075...

[ 0.046417236328125, 0.1466064453125, 0.1270751953125, 0.02301025390625, 0.134521484375, 0.0295562744140625, 0.0992431640625, 0.18994140625, 0.034881591796875, 0.1524658203125, 0.062744140625, 0.1373291015625, 0.1396484375, 0.2098388671875, 0.18701171875, 0.1102294921875, 0.02500915527...

embed

62848784_c0

62848784

haskell

0

Title: Problem with understanding an equation used to define a monoid on the natural numbers Problem title: Problem with understanding an equation used to define a monoid on the natural numbers Tags: haskell, monoids Problem: Problem with understanding an equation used to define a monoid on the natural numbers Consider...

Problem with understanding an equation used to define a monoid on the natural numbers Problem with understanding an equation used to define a monoid on the natural numbers haskell monoids Data.Semigroup Problem Sum Ord Show Num Semigroup Monoid Problem with understanding an equation used to define a monoid on the natur...

[ -0.0185546875, 0.00994873046875, 0.00604248046875, 0.04150390625, -0.00040435791015625, 0.01611328125, -0.003021240234375, 0.0087890625, 0.022216796875, -0.0042724609375, -0.013427734375, -0.006103515625, -0.01483154296875, -0.0042724609375, -0.006805419921875, 0.00262451171875, 0.00...

[ 15649, 100094, 28, 5490, 2320, 11814, 61924, 22460, 532, 6083, 101935, 98, 1556, 142508, 30185, 11809, 266, 51588, 36335, 35379, 17367, 52782, 84420, 77879, 18151, 28219, 13315, 3525, 50986, 10, 2203, 2046, 316, 1984, 26950, 10644, 35874, 178...

[ 0.1171875, 0.1649169921875, 0.0185699462890625, 0.1912841796875, 0.04693603515625, 0.06732177734375, 0.1483154296875, 0.1519775390625, 0.1591796875, 0.11865234375, 0.1082763671875, 0.011199951171875, 0.0770263671875, 0.1866455078125, 0.077392578125, 0.017181396484375, 0.051025390625,...

embed

12764082_c0

12764082

haskell

0

Title: Haskell: Pattern Matching with Lists Problem title: Haskell: Pattern Matching with Lists Tags: haskell, list Problem: Haskell: Pattern Matching with Lists I'm trying to make a function that takes in a list, and if one of the elements is negative, then any elements in that list that are equal to its positive coun...

Haskell: Pattern Matching with Lists Haskell: Pattern Matching with Lists haskell list Haskell Pattern Matching Lists x:zs:y:ws x:xs Haskell: Pattern Matching with Lists I'm trying to make a function that takes in a list, and if one of the elements is negative, then any elements in that list that are equal to its posit...

[ -0.023193359375, 0.003997802734375, -0.01318359375, -0.00421142578125, -0.007080078125, 0.0027008056640625, 0.0033721923828125, 0.0186767578125, 0.01287841796875, 0.0478515625, 0.0018157958984375, 0.0048828125, 0.01092529296875, -0.002044677734375, 0.007537841796875, -0.001373291015625...

[ 20625, 142508, 9876, 22766, 67407, 214, 678, 32036, 12, 1556, 5303, 169, 53, 19725, 1022, 425, 31577, 3249, 32354, 51776, 23, 2174, 1632, 80854, 40907, 2499, 105950, 24491, 105416, 17365, 5608, 98816, 47, 757, 10, 122297, 756, 116, 25, 25...

[ 0.1292724609375, 0.2183837890625, 0.135009765625, 0.1112060546875, 0.20849609375, 0.0491943359375, 0.074462890625, 0.1685791015625, 0.004608154296875, 0.11962890625, 0.1868896484375, 0.052886962890625, 0.0183563232421875, 0.07342529296875, 0.002777099609375, 0.0233154296875, 0.045593...

embed

16552650_c0

16552650

haskell

0

Title: Haskell - list comprehension can't enumerate N × N Problem title: Haskell - list comprehension can't enumerate N × N Tags: performance, list, list-comprehension, haskell Problem: Haskell - list comprehension can't enumerate N × N I have to write a function which returns a list of all pairs (x,y) where ...

Haskell - list comprehension can't enumerate N × N Haskell - list comprehension can't enumerate N × N performance list list-comprehension haskell Haskell Haskell - list comprehension can't enumerate N × N I have to write a function which returns a list of all pairs (x,y) where x, y ∈ N , and : x is the produc...

[ -0.0120849609375, 0.01373291015625, 0.00799560546875, 0.00096893310546875, 0.0086669921875, 0.00982666015625, -0.0198974609375, -0.00860595703125, -0.004852294921875, -0.0208740234375, 0.007415771484375, 0.015625, 0.01434326171875, -0.017822265625, -0.0260009765625, 0.0027313232421875,...

[ 20625, 142508, 5303, 46683, 3220, 831, 3768, 18, 189085, 67, 541, 34070, 23718, 4692, 1556, 6889, 33022, 32354, 30646, 756, 80836, 425, 53, 1022, 113, 245918, 12996, 6626, 6083, 101935, 768, 876, 6183, 167785, 190, 164917, 2101, 108047, 140...

[ 0.1541748046875, 0.247802734375, 0.223388671875, 0.1812744140625, 0.174560546875, 0.09619140625, 0.03936767578125, 0.0958251953125, 0.267333984375, 0.06689453125, 0.1739501953125, 0.2203369140625, 0.1781005859375, 0.1068115234375, 0.1260986328125, 0.03179931640625, 0.1092529296875, ...

embed

2587635_c0

2587635

haskell

0

Title: How do I create a suitable .tar.gz file for use with `cabal upload`? Problem title: How do I create a suitable .tar.gz file for use with `cabal upload`? Tags: cabal, hackage, haskell-platform, haskell Problem: How do I create a suitable .tar.gz file for use with `cabal upload`? The standard way to share a Haskel...

How do I create a suitable .tar.gz file for use with `cabal upload`? How do I create a suitable .tar.gz file for use with `cabal upload`? cabal hackage haskell-platform haskell How tar.gz How do I create a suitable .tar.gz file for use with `cabal upload`? The standard way to share a Haskell library with other programm...

[ 0.0162353515625, 0.007049560546875, 0.007476806640625, 0.0037689208984375, -0.01123046875, -0.0101318359375, 0.00194549560546875, 0.00958251953125, 0.00726318359375, 0.0196533203125, 0.013427734375, -0.0242919921875, -0.002593994140625, 0.0213623046875, -0.00543212890625, 0.01025390625...

[ 11249, 28282, 202319, 5, 867, 177, 169, 11435, 4527, 678, 408, 3571, 70622, 109524, 85526, 4588, 1556, 142508, 172121, 2405, 5570, 3917, 12008, 20625, 35773, 3789, 77848, 30438, 289, 98169, 139509, 10557, 1478, 59121, 1294, 32599, 65771, 7593...

[ 0.076416015625, 0.1824951171875, 0.212890625, 0.056732177734375, 0.257080078125, 0.1402587890625, 0.1424560546875, 0.1890869140625, 0.1129150390625, 0.058135986328125, 0.153076171875, 0.2066650390625, 0.2490234375, 0.2296142578125, 0.1754150390625, 0.1939697265625, 0.125, 0.2492675...

embed

38778320_c0

38778320

haskell

0

Title: (r ->) applicative functor Problem title: (r ->) applicative functor Tags: haskell, functor, applicative Problem: (r ->) applicative functor I am having some trouble understanding how the function instance (->) r of Applicative works in Haskell. For example if I have (+) <$> (+3) <*> (*100) $ 5 I know you ...

(r ->) applicative functor (r ->) applicative functor haskell functor applicative (r ->) applicative functor I am having some trouble understanding how the function instance (->) r of Applicative works in Haskell. For example if I have I know you get the result 508, I sort of understand that you take the result o...

[ 0.020751953125, 0.0064697265625, 0.0011749267578125, 0.0031890869140625, 0.00726318359375, 0.0242919921875, -0.006683349609375, -0.00022125244140625, 0.00872802734375, -0.042724609375, 0.0262451171875, -0.024658203125, -0.004150390625, 0.0159912109375, -0.008544921875, -0.0166015625, ...

[ 42, 20, 1230, 5386, 41816, 4935, 7477, 18770, 1556, 142508, 33079, 63134, 100094, 3642, 32354, 110527, 103607, 16, 1690, 5659, 11048, 43240, 20625, 3714, 16750, 836, 1019, 28219, 5646, 11516, 997, 8439, 136, 661, 805, 59911, 70, 22183, 1504...

[ 0.1524658203125, 0.0560302734375, 0.015380859375, 0.09869384765625, 0.195556640625, 0.1602783203125, 0.1331787109375, 0.1513671875, 0.1256103515625, 0.2432861328125, 0.14501953125, 0.0207977294921875, 0.05877685546875, 0.0389404296875, 0.145751953125, 0.1966552734375, 0.1845703125, ...

embed

20145943_c0

20145943

haskell

0

Title: Flexible instances needed? Problem title: Flexible instances needed? Tags: haskell, typeclass Problem: Flexible instances needed? I want to write a Convertible instance for a Haskell type to its C representation It looks like this: instance Convertible Variable (IO (Ptr ())) where Now GHC complains: Illegal inst...

Flexible instances needed? Flexible instances needed? haskell typeclass Flexible Convertible Variable Ptr Illegal All Use XFlexibleInstances Flexible instances needed? I want to write a Convertible instance for a Haskell type to its C representation It looks like this: Now GHC complains: I thought Flexible Instances we...

[ 0.00799560546875, 0.003875732421875, -0.0037384033203125, 0.002960205078125, -0.01519775390625, 0.03173828125, -0.0238037109375, -0.0022430419921875, 0.01397705078125, -0.018798828125, 0.00830078125, -0.04150390625, 0.0152587890625, 0.0274658203125, -0.0177001953125, -0.00653076171875,...

[ 180842, 2661, 110527, 7, 44841, 32, 1556, 142508, 10644, 67413, 1657, 41418, 84572, 2886, 4448, 891, 86966, 3164, 36836, 1193, 919, 74070, 28236, 4153, 116071, 3444, 33022, 20625, 313, 18811, 33342, 73265, 186992, 17569, 360, 3542, 4092, 5289...

[ 0.2320556640625, 0.1787109375, 0.257568359375, 0.039764404296875, 0.1888427734375, 0.001434326171875, 0.11181640625, 0.236328125, 0.1494140625, 0.156494140625, 0.0283660888671875, 0.1466064453125, 0.1468505859375, 0.06475830078125, 0.1575927734375, 0.06036376953125, 0.1759033203125, ...

embed

65549385_c0

65549385

haskell

0

Title: Error in simple haskell program with generic data type Problem title: Error in simple haskell program with generic data type Tags: interpreter, functional-programming, haskell, parsing Problem: Error in simple haskell program with generic data type I'm writing a generic interpreter in Haskell but I have a proble...

Error in simple haskell program with generic data type Error in simple haskell program with generic data type interpreter functional-programming haskell parsing Error Variable Rather Env Expected Error in simple haskell program with generic data type I'm writing a generic interpreter in Haskell but I have a problem wit...

[ -0.0091552734375, -0.00482177734375, -0.01080322265625, 0.015869140625, 0.007476806640625, 0.0164794921875, -0.004302978515625, 0.01141357421875, -0.0003185272216796875, -0.0203857421875, -0.00762939453125, -0.033447265625, -0.00823974609375, -0.0262451171875, -0.009765625, 0.002487182...

[ 212059, 23, 8781, 1556, 142508, 1528, 678, 189534, 2053, 10644, 29481, 56, 123309, 28966, 366, 84572, 2886, 152201, 357, 334, 60075, 13, 32562, 20625, 2967, 80934, 111, 65998, 45646, 3871, 61924, 10778, 153210, 32036, 33022, 25632, 4358, 1297...

[ 0.201904296875, 0.059783935546875, 0.1761474609375, 0.146728515625, 0.220947265625, 0.1505126953125, 0.048004150390625, 0.22119140625, 0.09033203125, 0.133544921875, 0.15771484375, 0.071044921875, 0.117919921875, 0.0972900390625, 0.08251953125, 0.166259765625, 0.130126953125, 0.122...

embed

68186871_c1

68186871

haskell

1

(fromString "Some error occured.") This can result in fairly significantly less cluttered code due to these conversions being elided, however, in a fairly similar and common case, where operations applied to the string literal force it to be typed as a String , this benefit is lost. For example, consider: import quali...

[ -0.005035400390625, -0.00445556640625, -0.0244140625, 0.0159912109375, 0.0191650390625, 0.004119873046875, -0.000759124755859375, -0.0235595703125, -0.0013275146484375, -0.01409912109375, 0.006622314453125, -0.033447265625, 0.01904296875, -0.0034027099609375, 0.00323486328125, -0.00469...

[ 161063, 71713, 214, 8912, 282, 18499, 74918, 297, 5, 3293, 831, 16750, 180663, 207583, 40715, 29786, 3055, 18151, 142477, 15296, 48141, 49903, 21373, 39210, 41018, 190659, 79315, 15659, 289, 37772, 10644, 71, 237, 10, 23351, 68073, 72856, 169...

[ 0.1221923828125, 0.11865234375, 0.07281494140625, 0.06915283203125, 0.09503173828125, 0.263671875, 0.1802978515625, 0.1187744140625, 0.00128173828125, 0.0306549072265625, 0.06036376953125, 0.0804443359375, 0.027191162109375, 0.0684814453125, 0.0936279296875, 0.130126953125, 0.1457519...

embed

62362053_c0

62362053

haskell

0

Title: How to convert Either to MonadThrow Problem title: How to convert Either to MonadThrow Tags: monads, haskell, exception, either, types Problem: How to convert Either to MonadThrow I have a function that handles errors via Either : funErrViaEither :: a -> Either SomeException b I want to use this function in anot...

How to convert Either to MonadThrow How to convert Either to MonadThrow monads haskell exception either types SomeException MyCustomException How Either MonadThrow Left How to convert Either to MonadThrow I have a function that handles errors via Either : I want to use this function in another function that should be m...

[ -0.011962890625, 0.00445556640625, -0.0027008056640625, -0.0115966796875, 0.01019287109375, 0.0032501220703125, -0.00885009765625, -0.0242919921875, 0.01312255859375, -0.016845703125, -0.0064697265625, -0.00457763671875, 0.00677490234375, -0.017333984375, 0.0169677734375, -0.0344238281...

[ 11249, 96760, 4565, 9319, 47, 60331, 71, 20800, 15555, 2667, 712, 1556, 142508, 131527, 40101, 52895, 31384, 19279, 63928, 2646, 223, 5928, 636, 2480, 32354, 34831, 18499, 1829, 3444, 4527, 1286, 110677, 30646, 347, 959, 9969, 1340, 10644, ...

[ 0.04327392578125, 0.1470947265625, 0.1312255859375, 0.2489013671875, 0.086669921875, 0.1611328125, 0.1085205078125, 0.140869140625, 0.2119140625, 0.088134765625, 0.1102294921875, 0.0723876953125, 0.1763916015625, 0.157958984375, 0.058837890625, 0.12890625, 0.1009521484375, 0.031066...

embed

39215958_c0

39215958

haskell

0

Title: Data Constructor Limitations Problem title: Data Constructor Limitations Tags: haskell Problem: Data Constructor Limitations I have data structures as such: data IfTree = If Expr Statement IfTree | Else Statement | EndIf data Statement = IfStatement IfTree What is want is to make it impossible to do any of these...

Data Constructor Limitations Data Constructor Limitations haskell Data Constructor Limitations IfTree Expr Statement EndIf IfStatement Maybe Stat IfStat IfElseStat Data Constructor Limitations I have data structures as such: data IfTree = If Expr Statement IfTree | Else Statement | EndIf data Statement = IfStatement If...

[ 0.0115966796875, 0.020751953125, -0.0103759765625, 0.01806640625, 0.01611328125, 0.0045166015625, -0.006256103515625, 0.01025390625, 0.0096435546875, -0.0137939453125, 0.0012054443359375, -0.0179443359375, 0.033935546875, 0.006866455078125, -0.003814697265625, 0.0016021728515625, 0.0...

[ 11809, 82084, 18770, 125177, 21094, 1556, 142508, 4263, 62731, 60075, 42, 22836, 18878, 91306, 135206, 5911, 83425, 23888, 7623, 2053, 45646, 13, 540, 3444, 3249, 69201, 54, 6097, 162515, 5608, 4734, 19048, 5646, 107419, 831, 1274, 64549, 252...

[ 0.1474609375, 0.21826171875, 0.171875, 0.2237548828125, 0.040802001953125, 0.1212158203125, 0.21142578125, 0.2232666015625, 0.2249755859375, 0.1151123046875, 0.140380859375, 0.1754150390625, 0.1138916015625, 0.181396484375, 0.2076416015625, 0.1273193359375, 0.08251953125, 0.1668701...

embed

22637515_c0

22637515

haskell

0

Title: How is Ratio implemented in Haskell? Problem title: How is Ratio implemented in Haskell? Tags: haskell Problem: How is Ratio implemented in Haskell? This is something I have been confused about for a while and I am not sure how I can learn more about it. Let's say I have the following program: main :: IO () main...

How is Ratio implemented in Haskell? How is Ratio implemented in Haskell? haskell How Ratio Haskell How is Ratio implemented in Haskell? This is something I have been confused about for a while and I am not sure how I can learn more about it. Let's say I have the following program: If I run this with the input 6 and 2 ...

[ -0.009033203125, 0.014892578125, 0.01556396484375, -0.00238037109375, 0.032470703125, 0.0096435546875, -0.00144195556640625, -0.00274658203125, 0.005126953125, -0.006195068359375, 0.0164794921875, -0.0301513671875, 0.0191650390625, -0.0103759765625, -0.0186767578125, 0.00701904296875, ...

[ 11249, 83, 2552, 5565, 29479, 297, 23, 20625, 142508, 1556, 55681, 30698, 1528, 11675, 107730, 305, 136, 116, 28412, 138, 1745, 106, 6275, 162365, 2320, 53383, 91853, 390, 22109, 71, 7639, 1379, 18811, 168487, 7464, 26244, 49128, 2053, 6454...

[ 0.1279296875, 0.0673828125, 0.1971435546875, 0.27880859375, 0.221435546875, 0.0946044921875, 0.10113525390625, 0.16748046875, 0.258544921875, 0.1348876953125, 0.050048828125, 0.00506591796875, 0.07635498046875, 0.07745361328125, 0.1318359375, 0.1024169921875, 0.06689453125, 0.09216...

embed

49365698_c0

49365698

haskell

0

Title: Haskell recursive function that returns number strings, Prelude.read: no parse Problem title: Haskell recursive function that returns number strings, Prelude.read: no parse Tags: string, recursion, numbers, haskell Problem: Haskell recursive function that returns number strings, Prelude.read: no parse I'm new at...

Haskell recursive function that returns number strings, Prelude.read: no parse Haskell recursive function that returns number strings, Prelude.read: no parse string recursion numbers haskell Haskell Prelude.read Integer n-1 Haskell recursive function that returns number strings, Prelude.read: no parse I'm new at Haskel...

[ -0.0031280517578125, -0.00433349609375, 0.000293731689453125, 0.01385498046875, 0.007080078125, 0.027587890625, 0.007293701171875, -0.031005859375, -0.00836181640625, 0.005706787109375, -0.0152587890625, -0.04541015625, 0.005859375, 0.0022430419921875, 0.006561279296875, -0.01098632812...

[ 20625, 142508, 195625, 5844, 32354, 30646, 14012, 79315, 1914, 822, 112, 39116, 110, 366, 184, 1830, 101935, 1556, 44401, 5759, 3525, 56037, 31577, 6493, 2198, 532, 242810, 757, 2389, 106, 206808, 116, 138, 363, 28350, 5443, 63928, 19273, 1...

[ 0.12158203125, 0.1968994140625, 0.21337890625, 0.1158447265625, 0.1346435546875, 0.1434326171875, 0.136474609375, 0.1844482421875, 0.11474609375, 0.213134765625, 0.16455078125, 0.238037109375, 0.1439208984375, 0.178955078125, 0.15576171875, 0.05712890625, 0.110107421875, 0.09741210...

embed

801785_c0

801785

haskell

0

Title: Should I use GHC Haskell extensions or not? Problem title: Should I use GHC Haskell extensions or not? Tags: ghc, haskell Problem: Should I use GHC Haskell extensions or not? As I am learning Haskell, I see that there is a lot of language extensions used in real life code. As a beginner, should I learn to use th...

Should I use GHC Haskell extensions or not? Should I use GHC Haskell extensions or not? ghc haskell Should GHC Haskell Should I use GHC Haskell extensions or not? As I am learning Haskell, I see that there is a lot of language extensions used in real life code. As a beginner, should I learn to use them, or should I avo...

[ -0.00096893310546875, 0.01080322265625, 0.034912109375, -0.00080108642578125, 0.003692626953125, 0.00439453125, -0.024658203125, -0.01153564453125, -0.01080322265625, -0.0244140625, -0.006072998046875, -0.0267333984375, 0.0106201171875, 0.0014190673828125, -0.01495361328125, 0.00735473...

[ 151117, 4527, 527, 73265, 20625, 142508, 111938, 7, 959, 87, 31380, 238, 1556, 52080, 5915, 46876, 11814, 2773, 6897, 18151, 9842, 5608, 30698, 71864, 11034, 36356, 112793, 16193, 17475, 98169, 52922, 4588, 191, 130812, 26908, 17368, 14315, 1...

[ 0.1158447265625, 0.1072998046875, 0.10089111328125, 0.20751953125, 0.140625, 0.1988525390625, 0.202392578125, 0.028167724609375, 0.06005859375, 0.014251708984375, 0.1156005859375, 0.0927734375, 0.129638671875, 0.04962158203125, 0.02984619140625, 0.1658935546875, 0.0728759765625, 0....

embed

64898375_c0

64898375

haskell

0

Title: Haskell - List of combinations of elements from list of lists Problem title: Haskell - List of combinations of elements from list of lists Tags: functional-programming, haskell, combinatorics, list-comprehension, nested-lists Problem: Haskell - List of combinations of elements from list of lists Say I have some ...

Haskell - List of combinations of elements from list of lists Haskell - List of combinations of elements from list of lists functional-programming haskell combinatorics list-comprehension nested-lists list Haskell Haskell - List of combinations of elements from list of lists Say I have some list of lists [[a, b], [c], ...

[ -0.0172119140625, 0.033203125, -0.0130615234375, -0.001495361328125, 0.005828857421875, 0.03125, -0.01263427734375, -0.017578125, -0.006439208984375, -0.0267333984375, -0.01287841796875, -0.015625, 0.024658203125, 0.0166015625, -0.035888671875, 0.006927490234375, 0.01287841796875, ...

[ 20625, 142508, 32036, 162515, 7, 80854, 1295, 5303, 111, 123309, 28966, 1556, 22321, 3826, 4692, 3220, 8512, 71, 6562, 20, 765, 876, 28, 1238, 831, 2499, 140909, 17497, 16610, 525, 1380, 5117, 3444, 139392, 756, 23, 2046, 501, 104, 151134...

[ 0.1368408203125, 0.25439453125, 0.153564453125, 0.256591796875, 0.07611083984375, 0.19580078125, 0.1142578125, 0.2232666015625, 0.06787109375, 0.1141357421875, 0.08544921875, 0.127685546875, 0.1630859375, 0.059112548828125, 0.02325439453125, 0.040313720703125, 0.135986328125, 0.008...

embed

36878083_c1

36878083

haskell

1

.map (**2) jf1 :: forall a. (a ~ CDouble) => V.Vector a -> V.Vector (V.Vector a) jf1 = AD.jacobian go where go :: forall t. (AD.Scalar t ~ a, AD.Mode t) => V.Vector t -> V.Vector t go x = f1 (V.map AD.auto x) instance AD.Mode CDouble where type Scalar CDouble = CDouble -- isKnownConstant _ = True -- isKnownZero x = 0 =...

[ -0.000823974609375, 0.0198974609375, -0.0185546875, -0.00689697265625, 0.00531005859375, 0.003936767578125, -0.0020294189453125, 0.00506591796875, -0.00408935546875, -0.03857421875, -0.0108642578125, 0.01190185546875, -0.01495361328125, 0.00775146484375, -0.006072998046875, -0.00280761...

[ 5, 62346, 25442, 10461, 39271, 418, 1984, 100, 5584, 10, 11, 7915, 796, 2661, 310, 26455, 18770, 33079, 856, 19831, 145, 587, 62806, 738, 7440, 808, 12351, 408, 320, 9083, 1022, 1238, 8913, 110527, 10644, 81543, 83, 35613, 42539, 87599, ...

[ 0.1038818359375, 0.2421875, 0.0543212890625, 0.154296875, 0.2181396484375, 0.1343994140625, 0.032501220703125, 0.06634521484375, 0.1656494140625, 0.09564208984375, 0.050048828125, 0.073486328125, 0.191650390625, 0.1702880859375, 0.161865234375, 0.1658935546875, 0.1710205078125, 0.0...

embed

20861205_c1

20861205

haskell

1

I've tried to force values after decoding them (using deepseq), I've tried adding bangs to data types, but this hasn't really helped. I've tried copying all bytestrings I keep in the file structure, which brought down the memory usage a bit, but it's still unacceptably high, especially when I want to analyze the entir...

[ 0.0286865234375, 0.0185546875, -0.01361083984375, 0.0025634765625, 0.005584716796875, -0.0081787109375, -0.00897216796875, 0.01007080078125, 0.01519775390625, -0.01953125, 0.0162353515625, -0.00188446044921875, 0.01312255859375, 0.0037841796875, -0.0034637451171875, 0.0218505859375, ...

[ 272, 37842, 47, 37772, 142424, 7103, 8, 587, 6238, 53894, 184, 864, 154107, 11339, 7, 2053, 52895, 6183, 104902, 43658, 390, 6954, 46828, 13695, 11435, 45646, 7565, 98323, 127689, 4785, 7464, 135372, 11192, 7968, 64194, 3509, 5955, 12689, 1...

[ 0.001953125, 0.107421875, 0.024200439453125, 0.2044677734375, 0.21630859375, 0.059051513671875, 0.145263671875, 0.1724853515625, 0.0220489501953125, 0.08734130859375, 0.0689697265625, 0.1221923828125, 0.070068359375, 0.1846923828125, 0.001953125, 0.0821533203125, 0.1759033203125, 0...

embed

44557129_c0

44557129

haskell

0

Title: Generic Lift Class Problem title: Generic Lift Class Tags: monad-transformers, haskell Problem: Generic Lift Class I've just hacked up the following class as follows: {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE MultiParamTypeClasses #-} {-# LANGUAGE FlexibleInstances #-} import Control.Monad.Trans.Class (MonadTra...

Generic Lift Class Generic Lift Class monad-transformers haskell Control.Monad.Trans.Class Generic Lift LANGUAGE TypeFamilies MultiParamTypeClasses FlexibleInstances MonadTrans GenericLift Monad Generic Lift Class I've just hacked up the following class as follows: This allows lifting an arbitrary number of levels, whi...

[ -0.0118408203125, 0.0123291015625, 0.01385498046875, -0.01336669921875, 0.01165771484375, -0.0057373046875, -0.00567626953125, -0.025390625, 0.006378173828125, 0.000476837158203125, 0.0162353515625, -0.01611328125, -0.001861572265625, -0.00051116943359375, -0.010498046875, 0.0047302246...

[ 88342, 1771, 166562, 35014, 2667, 712, 215175, 1314, 1556, 142508, 27131, 46674, 62624, 140803, 3358, 98064, 60457, 1191, 19335, 55292, 196707, 180842, 2661, 116071, 60331, 71, 9506, 2480, 1660, 256, 76622, 1257, 25632, 18507, 28960, 3293, 1148...

[ 0.1934814453125, 0.073974609375, 0.263916015625, 0.2442626953125, 0.1131591796875, 0.12451171875, 0.1907958984375, 0.0265350341796875, 0.0941162109375, 0.205078125, 0.12548828125, 0.0684814453125, 0.1258544921875, 0.1781005859375, 0.0069580078125, 0.11083984375, 0.10552978515625, 0...

embed

69794379_c0

69794379

haskell

0

Title: Haskell Polymorphism on Datatype Problem title: Haskell Polymorphism on Datatype Tags: function, haskell Problem: Haskell Polymorphism on Datatype I want to define a polymorphic datatype to represent expressions involving addition, multiplication and numbers data Expr = Number (Integer, Double) | Plus Expr Expr ...

Haskell Polymorphism on Datatype Haskell Polymorphism on Datatype function haskell Haskell Polymorphism Datatype Expr Number Integer Double Plus Times Show expr1 expr2 expr3 testEval1 Expected testEval2 Haskell Polymorphism on Datatype I want to define a polymorphic datatype to represent expressions involving addition,...

[ -0.00162506103515625, 0.0036468505859375, 0.01953125, 0.0167236328125, 0.0108642578125, 0.0238037109375, 0.0128173828125, -0.00075531005859375, -0.00469970703125, -0.0294189453125, 0.0021209716796875, -0.038330078125, -0.0078125, -0.00872802734375, -0.01348876953125, 0.01092529296875, ...

[ 20625, 142508, 63306, 178851, 8780, 98, 11809, 50986, 32354, 1556, 60075, 42, 103332, 44401, 107172, 8183, 19114, 17367, 14700, 418, 304, 363, 3034, 1405, 3444, 61924, 10, 35874, 1771, 2053, 33636, 125195, 3784, 66044, 127664, 136, 101935, 25...

[ 0.156494140625, 0.24169921875, 0.2412109375, 0.265625, 0.107666015625, 0.084716796875, 0.1419677734375, 0.2900390625, 0.1337890625, 0.1331787109375, 0.1246337890625, 0.116943359375, 0.162109375, 0.1646728515625, 0.124267578125, 0.1617431640625, 0.185302734375, 0.113525390625, 0.0...

embed

5535728_c0

5535728

haskell

0

Title: Specify arch in GHC? Problem title: Specify arch in GHC? Tags: ncurses, ghc, haskell, x86, x86-64 Problem: Specify arch in GHC? I'm writing a multiplatform ncurses text adventure game. The required C library, ncursesw, is configured for x86, but my OS is Mac OS X 10.6.6 x86_64. ghc --make -o rogue rogue.hs [1 of...

Specify arch in GHC? Specify arch in GHC? ncurses ghc haskell x86 x86-64 Specify GHC rogue.hs Compiling Dungeon Dungeon.hs Dungeon.o Main rogue.o Linking libncursesw.dylib i386 x86 x86-64 Specify arch in GHC? I'm writing a multiplatform ncurses text adventure game. The required C library, ncursesw, is configured for x8...

[ -0.009521484375, 0.00823974609375, 0.00311279296875, 0.00110626220703125, 0.00004100799560546875, -0.00811767578125, -0.0216064453125, -0.01416015625, -0.011962890625, 0.01336669921875, 0.004119873046875, -0.0341796875, -0.01513671875, -0.006317138671875, -0.0262451171875, -0.005615234...

[ 24990, 40383, 187, 206, 23, 527, 73265, 653, 48650, 90, 31380, 238, 1556, 142508, 15276, 13307, 2062, 6261, 127, 15612, 49725, 125669, 13, 191, 31, 12321, 12779, 25474, 434, 5612, 105742, 32562, 6024, 172121, 7986, 156578, 6712, 56065, 313,...

[ 0.1805419921875, 0.1383056640625, 0.181640625, 0.1949462890625, 0.1085205078125, 0.11767578125, 0.25048828125, 0.046844482421875, 0.197265625, 0.12060546875, 0.1123046875, 0.1160888671875, 0.08447265625, 0.1756591796875, 0.210205078125, 0.1702880859375, 0.07879638671875, 0.17407226...

embed

55835048_c0

55835048

haskell

0

Title: putStrLn etc. not showing because of using map with a function which uses IO Monads? Problem title: putStrLn etc. not showing because of using map with a function which uses IO Monads? Tags: haskell Problem: putStrLn etc. not showing because of using map with a function which uses IO Monads? I want to write a fu...

putStrLn etc. not showing because of using map with a function which uses IO Monads? putStrLn etc. not showing because of using map with a function which uses IO Monads? haskell map Monads All n-1 n-2 putStrLn etc. not showing because of using map with a function which uses IO Monads? I want to write a function which r...

[ 0.0108642578125, -0.003173828125, 0.0003566741943359375, -0.00142669677734375, -0.0098876953125, 0.01190185546875, 0.0196533203125, -0.01507568359375, 0.015869140625, -0.027099609375, -0.0025482177734375, -0.018310546875, 0.0033416748046875, 0.024658203125, 0.0164794921875, -0.01226806...

[ 3884, 71713, 866, 19, 3021, 959, 141377, 6637, 17368, 22288, 678, 32354, 4527, 17780, 60331, 6468, 1556, 142508, 3164, 653, 5759, 5428, 87, 3444, 33022, 30646, 1492, 96759, 101935, 140909, 12638, 14012, 42518, 927, 3698, 20990, 52544, 18151, ...

[ 0.20361328125, 0.22802734375, 0.136962890625, 0.161376953125, 0.0167694091796875, 0.1201171875, 0.1866455078125, 0.0341796875, 0.05364990234375, 0.191650390625, 0.060760498046875, 0.2001953125, 0.0538330078125, 0.2115478515625, 0.16845703125, 0.1397705078125, 0.0999755859375, 0.246...

embed

10689358_c0

10689358

haskell

0

Title: Haskell sublists Problem title: Haskell sublists Tags: haskell Problem: Haskell sublists I have to make a function that finds specific sublists. function :: Integer -> Integer -> [[Integer]] function n m = … If m is smaller then n the program exits. If the (mod (sum [1..n]) m) /= 0 then again error. Otherwise th...

Haskell sublists Haskell sublists haskell Haskell Integer Haskell sublists I have to make a function that finds specific sublists. If m is smaller then n the program exits. If the (mod (sum [1..n]) m) /= 0 then again error. Otherwise the program should find sublists. And the primary list is generated from [1..n] For ex...

[ -0.0167236328125, 0.01068115234375, 0.02880859375, -0.004730224609375, -0.0023651123046875, 0.019775390625, -0.0045166015625, 0.00014495849609375, 0.00070953369140625, 0.002838134765625, 0.0069580078125, -0.0206298828125, 0.01904296875, -0.01007080078125, -0.004425048828125, 0.00309753...

[ 20625, 142508, 1614, 6562, 1556, 44401, 7, 87, 765, 3249, 32354, 7413, 29458, 4263, 347, 83, 164917, 653, 70, 1528, 82230, 13415, 11832, 19, 1369, 757, 13438, 18499, 158978, 5303, 139392, 1295, 68252, 5, 27781, 2174, 101935, 2203, 305, 13...

[ 0.1561279296875, 0.2237548828125, 0.2344970703125, 0.283447265625, 0.153564453125, 0.187744140625, 0.02630615234375, 0.00469970703125, 0.0291290283203125, 0.03289794921875, 0.1427001953125, 0.1058349609375, 0.157958984375, 0.01220703125, 0.1383056640625, 0.055511474609375, 0.19189453...

embed

35353404_c0

35353404

haskell

0

Title: How to code the output value in Haskell that equals a function? Problem title: How to code the output value in Haskell that equals a function? Tags: haskell Problem: How to code the output value in Haskell that equals a function? I have a function that finds empty cells in a chess game I am making, and I want to...

How to code the output value in Haskell that equals a function? How to code the output value in Haskell that equals a function? haskell How Haskell GameState Player Cell Black How to code the output value in Haskell that equals a function? I have a function that finds empty cells in a chess game I am making, and I want...

[ 0.0021820068359375, -0.006011962890625, 0.0185546875, 0.0191650390625, 0.01025390625, 0.005218505859375, 0.006683349609375, 0.002532958984375, -0.01043701171875, -0.0084228515625, 0.0020294189453125, 0.030029296875, 0.0062255859375, -0.004241943359375, -0.01092529296875, -0.00300598144...

[ 11249, 47, 18151, 140992, 34292, 23, 20625, 142508, 450, 105950, 7, 32354, 1556, 13547, 135206, 60560, 80743, 10074, 70, 7413, 201505, 38750, 290, 6712, 20662, 3444, 91995, 126371, 3934, 13162, 14037, 441, 88510, 18499, 18, 765, 37076, 22304,...

[ 0.05804443359375, 0.019378662109375, 0.2415771484375, 0.2220458984375, 0.1776123046875, 0.049713134765625, 0.1510009765625, 0.242919921875, 0.047454833984375, 0.1669921875, 0.0751953125, 0.2047119140625, 0.1307373046875, 0.07757568359375, 0.1151123046875, 0.13427734375, 0.16467285156...

embed

35828128_c0

35828128

haskell

0

Title: Lifted „if“-function behaves unexpectedly Problem title: Lifted „if“-function behaves unexpectedly Tags: io-monad, monads, lifting, haskell, applicative Problem: Lifted „if“-function behaves unexpectedly in my program I use a function if' defined in one of the modules instead of the built-in if-then-else constru...

Lifted „if“-function behaves unexpectedly Lifted „if“-function behaves unexpectedly io-monad monads lifting haskell applicative Lifted Bool action1 action2 Main Lifted „if“-function behaves unexpectedly in my program I use a function if' defined in one of the modules instead of the built-in if-then-else construct. It i...

[ 0.0029754638671875, 0.01416015625, 0.013671875, 0.01373291015625, 0.0220947265625, 0.0194091796875, 0.01104736328125, -0.0037994384765625, -0.01141357421875, -0.0081787109375, 0.0279541015625, 0.0093994140625, -0.027099609375, 0.00180816650390625, 0.0162353515625, -0.009521484375, -0...

[ 166562, 297, 3190, 137175, 186, 68991, 241957, 137, 22995, 3796, 712, 2667, 177691, 1556, 142508, 41816, 2460, 929, 22631, 304, 7, 1528, 4527, 32354, 2174, 25, 61924, 1632, 88996, 64457, 88303, 73, 92733, 5557, 64549, 686, 43240, 5885, 3687...

[ 0.259765625, 0.159912109375, 0.261962890625, 0.2076416015625, 0.050567626953125, 0.1761474609375, 0.17724609375, 0.026763916015625, 0.1527099609375, 0.0721435546875, 0.1785888671875, 0.1336669921875, 0.2132568359375, 0.077880859375, 0.210205078125, 0.11962890625, 0.10260009765625, ...

embed

14948765_c0

14948765

haskell

0

Title: Haskell Couldn't match expected type 'String' with actual type 'Char' Problem title: Haskell Couldn't match expected type 'String' with actual type 'Char' Tags: string, haskell, char Problem: Haskell Couldn't match expected type 'String' with actual type 'Char' I...

Haskell Couldn't match expected type 'String' with actual type 'Char' Haskell Couldn't match expected type 'String' with actual type 'Char' string haskell char Haskell Couldn Char Integer Haskell Couldn't match expected type 'String' with actual type 'Char' I am wonderi...

[ -0.0023193359375, -0.017578125, 0.002777099609375, 0.006256103515625, -0.0106201171875, 0.00732421875, -0.0172119140625, -0.02783203125, -0.000400543212890625, 0.0263671875, 0.0021209716796875, -0.02685546875, 0.0234375, 0.00506591796875, 0.0118408203125, -0.030517578125, -0.00032043...

[ 20625, 142508, 191147, 3768, 18, 14858, 84751, 10644, 71713, 214, 678, 8561, 84068, 79315, 1556, 21441, 19, 21656, 44401, 149016, 15400, 903, 18499, 95486, 96760, 1295, 892, 1505, 47, 764, 425, 34292, 11782, 4358, 56, 142477, 32354, 2811, 3...

[ 0.1490478515625, 0.2398681640625, 0.1258544921875, 0.1353759765625, 0.1011962890625, 0.1920166015625, 0.1866455078125, 0.174072265625, 0.1571044921875, 0.0960693359375, 0.0841064453125, 0.1507568359375, 0.2125244140625, 0.1806640625, 0.118896484375, 0.1627197265625, 0.06561279296875,...

embed

38594469_c0

38594469

haskell

0

Title: What if I know the result is an integer, but ghc is not so sure? Problem title: What if I know the result is an integer, but ghc is not so sure? Tags: haskell Problem: What if I know the result is an integer, but ghc is not so sure? Let's say I have this piece of code: demo::Integer -> Integer demo x = x*(x+1)/2...

What if I know the result is an integer, but ghc is not so sure? What if I know the result is an integer, but ghc is not so sure? haskell a What demo::Integer Integer Compiling Main debug.hs debug.o debug.hs:2:17 Fractional Possible What if I know the result is an integer, but ghc is not so sure? Let's say I have this ...

[ -0.0179443359375, 0.01446533203125, 0.003143310546875, -0.003387451171875, 0.002288818359375, 0.03466796875, -0.016357421875, -0.00677490234375, -0.003936767578125, -0.01519775390625, -0.01141357421875, -0.017333984375, -0.0133056640625, 0.00823974609375, 0.0145263671875, -0.0131225585...

[ 4865, 2174, 87, 3714, 16750, 83, 142, 892, 1505, 1284, 31380, 238, 959, 221, 9077, 1556, 142508, 53397, 4153, 67, 44401, 15612, 49725, 12321, 8, 85779, 127, 31, 22950, 7868, 10763, 289, 115861, 2661, 63847, 111, 18151, 123019, 237, 1022, ...

[ 0.03704833984375, 0.122314453125, 0.042633056640625, 0.1597900390625, 0.209228515625, 0.07354736328125, 0.060455322265625, 0.146240234375, 0.161865234375, 0.09271240234375, 0.10687255859375, 0.09130859375, 0.129638671875, 0.1131591796875, 0.1644287109375, 0.1146240234375, 0.206787109...

embed

43534944_c0

43534944

haskell

0

Title: Why does a recursive lazy list blow the stack in Scala? Problem title: Why does a recursive lazy list blow the stack in Scala? Tags: linked-list, lazy-evaluation, haskell, scala Problem: Why does a recursive lazy list blow the stack in Scala? I saw this snippet of Haskell in this answer by proud haskeller on Met...

Why does a recursive lazy list blow the stack in Scala? Why does a recursive lazy list blow the stack in Scala? linked-list lazy-evaluation haskell scala StackOverflowException Why Scala List x.head Why does a recursive lazy list blow the stack in Scala? I saw this snippet of Haskell in this answer by proud haskeller o...

[ -0.000461578369140625, 0.0145263671875, 0.006256103515625, -0.0030975341796875, 0.006988525390625, -0.0034332275390625, 0.005401611328125, 0.013916015625, 0.0107421875, -0.014404296875, 0.01239013671875, -0.01287841796875, 0.031005859375, 0.009521484375, 0.0216064453125, -0.00106048583...

[ 44084, 195625, 5844, 21, 3285, 5303, 102310, 177261, 152653, 11, 23, 3126, 297, 6562, 159258, 1556, 142508, 146232, 6512, 2594, 156673, 118664, 63928, 32036, 1022, 5, 31251, 14602, 70, 20625, 79961, 14191, 36939, 56367, 17569, 634, 217, 831, ...

[ 0.08447265625, 0.177490234375, 0.0963134765625, 0.14599609375, 0.1953125, 0.2027587890625, 0.240966796875, 0.21240234375, 0.216064453125, 0.1728515625, 0.0274810791015625, 0.06768798828125, 0.0195465087890625, 0.135498046875, 0.08233642578125, 0.0325927734375, 0.1942138671875, 0.16...

embed

10064758_c0

10064758

haskell

0

Title: Counting frequencies of enum values Problem title: Counting frequencies of enum values Tags: enums, haskell Problem: Counting frequencies of enum values Suppose I have an enum like data T = A | B | C deriving (Enum) and a list of enum values as input: [B, C, C, A, C, A, C] What I'm looking for is a function that...

Counting frequencies of enum values Counting frequencies of enum values enums haskell Counting Enum Word Counting frequencies of enum values Suppose I have an enum like and a list of enum values as input: What I'm looking for is a function that, given this input, returns how often each element occurs in the input. A si...

[ -0.00762939453125, -0.01123046875, -0.006317138671875, -0.00262451171875, -0.00262451171875, -0.0123291015625, -0.006378173828125, -0.019775390625, 0.00341796875, -0.01214599609375, 0.000583648681640625, 0.0027923583984375, 0.034423828125, 0.0478515625, -0.0169677734375, -0.01904296875...

[ 1311, 128396, 12478, 944, 117538, 111, 22, 316, 142424, 10321, 1556, 142508, 357, 22543, 1884, 5303, 107730, 16487, 100, 32354, 34475, 30646, 3642, 27983, 12638, 12830, 74918, 8781, 3173, 140992, 304, 106, 201, 64209, 43581, 51515, 33342, 432...

[ 0.134033203125, 0.1544189453125, 0.20947265625, 0.1798095703125, 0.08489990234375, 0.0567626953125, 0.1295166015625, 0.20166015625, 0.2078857421875, 0.1971435546875, 0.1439208984375, 0.224365234375, 0.13232421875, 0.17822265625, 0.1375732421875, 0.093994140625, 0.1644287109375, 0.0...

embed

12651735_c0

12651735

haskell

0

Title: How to collect output from pipes to file in Haskell Problem title: How to collect output from pipes to file in Haskell Tags: conduit, haskell Problem: How to collect output from pipes to file in Haskell I have a producer pipe and I have used the print pipe. I would like to write the output to a file. If I use Co...

How to collect output from pipes to file in Haskell How to collect output from pipes to file in Haskell conduit haskell pipes How Haskell test2file CB.sinkFile fn3 Couldn Pipe void-0.5.8:Data.Void.Void Data.Conduit.Internal.Pipe Data.ByteString.Internal.ByteString How to collect output from pipes to file in Haskell I h...

[ 0.01171875, 0.002960205078125, -0.01177978515625, 0.0234375, -0.014404296875, 0.0201416015625, -0.0247802734375, -0.026123046875, -0.018798828125, 0.0093994140625, -0.0081787109375, 0.010009765625, 0.0341796875, 0.01031494140625, 0.0031890869140625, -0.000614166259765625, -0.01397705...

[ 11249, 43799, 140992, 1295, 137158, 7, 47, 11435, 20625, 142508, 23, 120565, 1556, 3034, 304, 29822, 76984, 14068, 174350, 14783, 363, 191147, 93128, 13, 2292, 153451, 137989, 36635, 11809, 112061, 44851, 48672, 71713, 108558, 11814, 28412, 188...

[ 0.053955078125, 0.2225341796875, 0.2476806640625, 0.106689453125, 0.2235107421875, 0.08984375, 0.119140625, 0.23291015625, 0.1419677734375, 0.23046875, 0.011993408203125, 0.15087890625, 0.116943359375, 0.1209716796875, 0.0126953125, 0.1790771484375, 0.08447265625, 0.1136474609375, ...

embed

50581476_c1

50581476

haskell

1

ThenWait i = putStr (show i ++ " ") *> threadDelay 1000000 runLoop = sequence_ $ printThenWait <$> [1..] nothing _ = pure () handler e | Just (e' :: IOError) <- fromException e = putStrLn "It's an IOError!" | (Nothing :: Maybe IOError) <- fromException e = putStrLn "We got Nothing!" I'm a bit confused about the danger ...

[ 0.0030975341796875, 0.018310546875, 0.0125732421875, -0.02392578125, 0.01324462890625, 0.0252685546875, 0.0012359619140625, -0.0172119140625, 0.01434326171875, -0.03515625, 0.00823974609375, -0.013427734375, 0.00008487701416015625, -0.004241943359375, 0.0211181640625, -0.00726318359375...

[ 47009, 22489, 217, 17, 3884, 71713, 31374, 37223, 86997, 4657, 5259, 805, 28568, 11675, 15363, 2146, 944, 3650, 28412, 3957, 19, 33720, 34166, 35863, 28, 9563, 13, 17780, 18468, 31611, 1295, 63928, 23389, 3890, 5021, 64113, 83425, 12137, 41...

[ 0.175048828125, 0.242919921875, 0.2374267578125, 0.1329345703125, 0.077880859375, 0.1815185546875, 0.0712890625, 0.11083984375, 0.159912109375, 0.0789794921875, 0.228515625, 0.03472900390625, 0.1141357421875, 0.052734375, 0.035552978515625, 0.0792236328125, 0.040618896484375, 0.016...

embed

71618243_c1

71618243

haskell

1

m @d, a) fromObject o = do (msg::Word8, a) <- fromObject o when (msg /= msgId @m @d) (fail $ "Unexpected MESSAGE: " <> show msg) pure $ MyTagsMP a and before to write the same couple of instances for 'ResourcesM I was thinking - is it possible to reduce manual work - maybe with some generic? Actually I have more than T...

[ -0.0179443359375, -0.01348876953125, -0.012451171875, -0.006622314453125, -0.00811767578125, 0.01141357421875, -0.003997802734375, 0.0179443359375, 0.00089263916015625, -0.034912109375, 0.0240478515625, -0.0157470703125, 0.0244140625, 0.005035400390625, -0.01165771484375, 0.01251220703...

[ 347, 1374, 10, 1295, 46471, 75161, 36, 2203, 54, 4432, 177, 164805, 1019, 3229, 68163, 568, 71, 120540, 14256, 83613, 276, 64397, 75930, 7639, 34166, 3650, 2646, 66448, 9088, 33022, 24941, 110527, 4332, 60427, 7, 594, 47644, 7722, 34390, ...

[ 0.08056640625, 0.043243408203125, 0.063232421875, 0.20166015625, 0.13671875, 0.21728515625, 0.1739501953125, 0.038116455078125, 0.1146240234375, 0.047637939453125, 0.10693359375, 0.10015869140625, 0.19921875, 0.0274658203125, 0.040283203125, 0.0150299072265625, 0.0693359375, 0.1746...

embed

75441647_c0

75441647

haskell

0

Title: How to run web server (Warp) in async/concurrent mode? Problem title: How to run web server (Warp) in async/concurrent mode? Tags: haskell, concurrency, haskell-warp, haskell-wai Problem: How to run web server (Warp) in async/concurrent mode? I'm using https://hackage.haskell.org/package/warp-3.3.24/docs/Network...

How to run web server (Warp) in async/concurrent mode? How to run web server (Warp) in async/concurrent mode? haskell concurrency haskell-warp haskell-wai How Warp Warp.run How to run web server (Warp) in async/concurrent mode? I'm using https://hackage.haskell.org/package/warp-3.3.24/docs/Network-Wai-Handler-Warp.html...

[ 0.0020599365234375, -0.007110595703125, -0.0159912109375, -0.0019378662109375, -0.02685546875, 0.0152587890625, -0.0038604736328125, -0.00927734375, -0.0033721923828125, -0.047119140625, 0.0045166015625, 0.0162353515625, 0.01220703125, 0.00933837890625, 0.0123291015625, 0.0018844604492...

[ 11249, 47, 11675, 1467, 10723, 71947, 254, 23, 10, 12654, 238, 2271, 163812, 13736, 1556, 142508, 108636, 982, 4205, 634, 14, 5550, 16428, 139509, 4588, 10557, 29102, 134693, 2357, 22489, 135679, 603, 6626, 12921, 11469, 98, 17287, 20697, 8...

[ 0.06170654296875, 0.004974365234375, 0.1629638671875, 0.1412353515625, 0.1962890625, 0.1734619140625, 0.2098388671875, 0.0577392578125, 0.052398681640625, 0.19921875, 0.086669921875, 0.08673095703125, 0.2587890625, 0.163818359375, 0.0946044921875, 0.2119140625, 0.1424560546875, 0.1...

embed

42195555_c1

42195555

haskell

1

, volume :: !Integer , adjClose :: !Double } instance FromNamedRecord StockInfo where parseNamedRecord m = StockInfo <$> m .: "Date" <*> m .: "Open" <*> m .: "High" <*> m .: "Low" <*> m .: "Close" <*> m .: "Volume" <*> m .: "Adj Close" instance ToNamedRecord StockInfo where toNamedRecord (StockInfo date open high low ...

[ -0.0174560546875, 0.015380859375, 0.00885009765625, 0.0289306640625, -0.000946044921875, 0.01300048828125, -0.01177978515625, 0.0045166015625, 0.0167236328125, 0.020751953125, -0.0185546875, -0.012451171875, 0.0205078125, -0.0040283203125, -0.0147705078125, 0.007080078125, -0.0207519...

[ 4, 21950, 1984, 711, 67, 1505, 606, 170, 59453, 34, 2661, 51912, 110527, 28090, 163612, 71, 4332, 32271, 68804, 93147, 7440, 366, 184, 347, 2203, 4369, 2740, 6, 5, 12, 86291, 58, 4426, 1639, 44, 103264, 163025, 15363, 434, 441, 73668, ...

[ 0.06707763671875, 0.25634765625, 0.0850830078125, 0.0673828125, 0.1082763671875, 0.072021484375, 0.0718994140625, 0.172119140625, 0.1610107421875, 0.0241851806640625, 0.053802490234375, 0.040252685546875, 0.253173828125, 0.1708984375, 0.1990966796875, 0.11962890625, 0.086669921875, ...

embed

8751188_c0

8751188

haskell

0

Title: Exceptions in Haskell Problem title: Exceptions in Haskell Tags: exception, haskell Problem: Exceptions in Haskell If I understood rightly, exceptions in Haskell basically intended to deal within IO monad. At least exception could be caught inside IO monad. But sometimes even pure functions may throw an exceptio...

Exceptions in Haskell Exceptions in Haskell exception haskell Exceptions Haskell Exceptions in Haskell If I understood rightly, exceptions in Haskell basically intended to deal within IO monad. At least exception could be caught inside IO monad. But sometimes even pure functions may throw an exception, e.g. read "..." ...

[ -0.0042724609375, 0.024658203125, -0.003570556640625, -0.0047607421875, 0.01544189453125, 0.0115966796875, -0.00007724761962890625, -0.006927490234375, -0.01251220703125, -0.005157470703125, 0.002716064453125, -0.026123046875, -0.00823974609375, -0.00958251953125, 0.0223388671875, -0.0...

[ 218288, 17514, 23, 20625, 142508, 131527, 1556, 217064, 7, 198343, 179140, 47, 35142, 28032, 17780, 2667, 712, 19713, 5809, 156892, 46132, 68018, 3853, 34166, 32354, 1543, 104250, 12301, 7673, 1984, 360, 18, 3220, 16454, 79315, 959, 33636, 89...

[ 0.2271728515625, 0.142822265625, 0.0826416015625, 0.1644287109375, 0.277099609375, 0.298583984375, 0.1324462890625, 0.016265869140625, 0.114013671875, 0.03668212890625, 0.10528564453125, 0.0130615234375, 0.11767578125, 0.1114501953125, 0.1915283203125, 0.10455322265625, 0.11791992187...

embed

64873882_c0

64873882

haskell

0

Title: haskell words from alphabet of a given length Problem title: haskell words from alphabet of a given length Tags: haskell Problem: haskell words from alphabet of a given length I have this function that generates a list of all words with a min length 0 and max length n, equals given as an input to the function: i...

haskell words from alphabet of a given length haskell words from alphabet of a given length haskell alphabet Data.List n-1 ch:w AAA BAA ABA BBA AAB BAB ABB BBB haskell words from alphabet of a given length I have this function that generates a list of all words with a min length 0 and max length n, equals given as an i...

[ -0.00121307373046875, 0.00164794921875, 0.002838134765625, 0.0032196044921875, 0.000751495361328125, 0.00689697265625, 0.0234375, 0.00004267692565917969, 0.005035400390625, -0.033203125, -0.003997802734375, -0.028564453125, 0.041259765625, 0.02197265625, -0.0115966796875, 0.00291442871...

[ 1556, 142508, 34153, 1295, 229231, 111, 34475, 140909, 11809, 154663, 653, 5759, 3863, 434, 155616, 8678, 284, 49068, 8031, 62, 11040, 59584, 22312, 32354, 139392, 5303, 756, 881, 757, 18389, 105950, 107730, 11675, 140992, 25632, 2967, 3688, ...

[ 0.18359375, 0.265869140625, 0.217529296875, 0.114501953125, 0.2235107421875, 0.081787109375, 0.117431640625, 0.1888427734375, 0.1202392578125, 0.13623046875, 0.0655517578125, 0.1365966796875, 0.1142578125, 0.124267578125, 0.2296142578125, 0.11328125, 0.043121337890625, 0.1368408203...

embed

32126423_c0

32126423

haskell

0

Title: Linking cabalized Haskell package to C program (undefined reference linker error) Problem title: Linking cabalized Haskell package to C program (undefined reference linker error) Tags: haskell, gcc, linker Problem: Linking cabalized Haskell package to C program (undefined reference linker error) Code signals: Li...

Linking cabalized Haskell package to C program (undefined reference linker error) Linking cabalized Haskell package to C program (undefined reference linker error) haskell gcc linker Linking Haskell m32 ParseInt.exe ParseInt.o hsbracket.o ia32 lHSarray-0.5.0.0-ghc7.8.3 lHSbin-package-db-0.0.0.0-ghc7.8.3 lHSbinary-0.7.1...

[ -0.002349853515625, 0.004364013671875, 0.006622314453125, 0.00537109375, -0.0038299560546875, 0.002349853515625, -0.0035858154296875, 0.014404296875, -0.0033111572265625, -0.014404296875, -0.016845703125, -0.050537109375, 0.007537841796875, 0.00323486328125, 0.004119873046875, -0.00427...

[ 12779, 214, 109524, 29367, 20625, 142508, 98169, 47, 313, 1528, 59437, 5983, 297, 91067, 3126, 56, 18499, 16, 1556, 22109, 238, 347, 6460, 2392, 184, 4153, 18, 5, 46480, 1096, 2844, 27853, 31, 5326, 96, 38131, 19305, 53, 9, 93645, 99929...

[ 0.2213134765625, 0.055145263671875, 0.2242431640625, 0.146240234375, 0.1824951171875, 0.2861328125, 0.2203369140625, 0.14697265625, 0.152099609375, 0.1732177734375, 0.0494384765625, 0.173095703125, 0.00152587890625, 0.2044677734375, 0.1917724609375, 0.1439208984375, 0.161865234375, ...

embed

58358574_c2

58358574

haskell

2

VWK KcI5tA8BLEhRBKJLjez6a7MLq7XZtp+yyOawwCBtkiBVZDKzRk4NN7NQBMYPHiZDFhXY+p9ff7F961vVcnl4R5I2ykJ5XFN7Ab7Gc61VoipNBKF+PDyztu5lfrSLT/wIwCxq0CAGtXHZTzqR2jtwQiXONma6hHpj9sLT7YaPxfTXuZdBGA02Wi7FS48YiTfj+i2Nhq tdhP5RC8mh2/Op7y0v6eAcWVLFT8D7kWX5S9mepp+C450MV6aWL1cGnvkxbwHtLW2B9AOkLeUd9KEDuh9fl/7CEj7YH5g+3r/lWfF9In7tPz6T4IIwBJO...

[ -0.0142822265625, 0.0184326171875, 0.002166748046875, -0.00732421875, 0.031005859375, 0.004669189453125, 0.01239013671875, 0.017822265625, 0.00408935546875, -0.0152587890625, 0.0093994140625, 0.019775390625, -0.02880859375, -0.00518798828125, 0.0147705078125, -0.018310546875, 0.01574...

[ 86779, 605, 341, 758, 125149, 45176, 39456, 47307, 15473, 143907, 85398, 16, 581, 177953, 83, 96436, 2661, 99, 432, 25160, 846, 4902, 28541, 25647, 28864, 26073, 7, 3000, 2298, 841, 3062, 254, 19279, 63928, 56504, 114211, 11249, 79794, 2062...

[ 0.208251953125, 0.1832275390625, 0.0257568359375, 0.0273284912109375, 0.050384521484375, 0.028533935546875, 0.0268096923828125, 0.00799560546875, 0.040985107421875, 0.036865234375, 0.007110595703125, 0.001800537109375, 0.02459716796875, 0.23974609375, 0.018310546875, 0.1512451171875, ...

embed

13319870_c1

13319870

haskell

1

generated the tarfile I uploaded to hackage using something other than cabal sdist , and that process left out ReadArgsSpec.hs . I altered my ReadArgs.cabal file before I ran cabal sdist in such a way as to exclude ReadArgsSpec.hs but failed to commit my change. Hackage removed ReadArgsSpec.hs from the package file. I...

[ 0.012939453125, 0.017578125, 0.0225830078125, -0.00750732421875, -0.01385498046875, 0.00127410888671875, -0.000545501708984375, 0.00457763671875, -0.01263427734375, 0.045654296875, 0.01165771484375, -0.01708984375, -0.0281982421875, 0.000324249267578125, 0.009765625, 0.00921630859375, ...

[ 139392, 2405, 29822, 70622, 85526, 4588, 3789, 109524, 91, 46295, 9433, 25737, 1810, 4764, 7614, 9405, 294, 47107, 127, 7, 37264, 408, 3571, 11435, 13028, 39041, 165523, 15549, 52922, 184750, 98169, 21455, 7722, 5062, 6626, 11389, 48903, 5701...

[ 0.0921630859375, 0.17724609375, 0.1781005859375, 0.142333984375, 0.181396484375, 0.1873779296875, 0.00201416015625, 0.18994140625, 0.0357666015625, 0.1536865234375, 0.03607177734375, 0.052886962890625, 0.0205841064453125, 0.1917724609375, 0.2064208984375, 0.1888427734375, 0.034454345...

embed

33707468_c0

33707468

haskell

0

Title: getting <<loop>> message when run haskell programme Problem title: getting <<loop>> message when run haskell programme Tags: haskell Problem: getting < > message when run haskell programme I have written code like this import System.Environment import Control.Exception import Data.List f ...

getting <<loop>> message when run haskell programme getting <<loop>> message when run haskell programme haskell Control.Exception System.Environment Data.List run.hs some_string some_over_arguments some_hardcoded_list getting < > message when run haskell programme I have written code like this b...

[ 0.01531982421875, 0.0003986358642578125, -0.027587890625, 0.01019287109375, 0.0107421875, 0.017578125, 0.00689697265625, 0.002349853515625, 0.005828857421875, -0.0247802734375, 0.0296630859375, -0.00848388671875, 0.0032501220703125, -0.0020599365234375, 0.01385498046875, -0.00442504882...

[ 20949, 28354, 5386, 26008, 3229, 11675, 1556, 142508, 26693, 27131, 63928, 12353, 686, 1900, 11809, 154663, 127, 7, 3060, 91693, 5465, 155937, 25612, 40899, 71, 6562, 4426, 977, 18151, 9969, 31577, 11343, 4734, 35166, 44691, 28994, 133, 27875...

[ 0.0718994140625, 0.259033203125, 0.05511474609375, 0.1697998046875, 0.0838623046875, 0.1805419921875, 0.1591796875, 0.2255859375, 0.1744384765625, 0.104736328125, 0.1160888671875, 0.0242919921875, 0.00091552734375, 0.02703857421875, 0.04803466796875, 0.0750732421875, 0.098388671875, ...

embed

38309347_c0

38309347

haskell

0

Title: llvm-general-pure fail at compilation Problem title: llvm-general-pure fail at compilation Tags: cabal, haskell, llvm Problem: llvm-general-pure fail at compilation I want to install the "llvm-general" package from cabal. But the "llvm-general-pure" (dependencies) fail at compilation : [19 of 28] Compiling LLVM....

llvm-general-pure fail at compilation llvm-general-pure fail at compilation cabal haskell llvm Compiling LLVM.General.Internal.PrettyPrint LLVM General Internal PrettyPrint.hs PrettyPrint.o PrettyPrint.hs:166:19 DataD TyConI llvm-general-pure fail at compilation I want to install the "llvm-general" package from cabal. ...

[ -0.0159912109375, 0.0213623046875, -0.000591278076171875, -0.007232666015625, -0.003448486328125, -0.0054931640625, -0.00872802734375, -0.015869140625, -0.0086669921875, -0.0118408203125, 0.01470947265625, -0.03759765625, 0.004241943359375, 0.01177978515625, 0.016845703125, 0.00390625,...

[ 96, 3723, 39, 180300, 4717, 35782, 99, 98352, 13, 109524, 1556, 142508, 15612, 99954, 47599, 159342, 44851, 19273, 15145, 112079, 9082, 106745, 197570, 127, 18, 31, 156215, 23988, 11809, 397, 8064, 11935, 568, 3444, 20600, 1181, 334, 98169, ...

[ 0.03753662109375, 0.177001953125, 0.2010498046875, 0.1927490234375, 0.1810302734375, 0.206787109375, 0.0889892578125, 0.226318359375, 0.09033203125, 0.2154541015625, 0.0736083984375, 0.1846923828125, 0.114013671875, 0.10400390625, 0.22802734375, 0.1436767578125, 0.03216552734375, 0...

embed

42823762_c0

42823762

haskell

0

Title: remove type from type list haskell Problem title: remove type from type list haskell Tags: haskell, list, types Problem: remove type from type list haskell So i'm new to Haskell, and I was wondering if anyone could help me. I've got a list of a custom data type like so: type Title = String type Manager = String ...

remove type from type list haskell remove type from type list haskell haskell list types type Title Manager Year Fan Album remove type from type list haskell So i'm new to Haskell, and I was wondering if anyone could help me. I've got a list of a custom data type like so: And I have a pre-made static database of albums...

[ 0.028076171875, 0.021484375, -0.0062255859375, 0.02392578125, -0.01263427734375, 0.0098876953125, -0.0201416015625, 0.01507568359375, -0.00189208984375, -0.0108642578125, -0.00433349609375, -0.0267333984375, 0.0103759765625, -0.001251220703125, -0.00909423828125, 0.01513671875, -0.00...

[ 87388, 10644, 1295, 5303, 1556, 142508, 52895, 48962, 30195, 42552, 11213, 37340, 20625, 4358, 114122, 2053, 479, 42424, 201939, 63399, 7156, 32354, 30646, 756, 31095, 7228, 3525, 3871, 3996, 4734, 35992, 36069, 136, 14192, 3444, 903, 44457, ...

[ 0.135009765625, 0.2369384765625, 0.09320068359375, 0.1861572265625, 0.157958984375, 0.20849609375, 0.19482421875, 0.160400390625, 0.2144775390625, 0.15478515625, 0.1854248046875, 0.1754150390625, 0.1180419921875, 0.025909423828125, 0.147705078125, 0.101318359375, 0.0228729248046875, ...

embed

43794488_c2

43794488

haskell

2

TmvWUcS1U1IKHT0levwg3 -L/usr/lib/ghc/rts /tmp/ghc54ce_0/ghc_2.o /tmp/ghc54ce_0/ghc_5.o -Wl,-u,ghczmprim_GHCziTypes_Izh_static_info -Wl,-u,ghczmprim_GHCziTypes_Czh_static_info -Wl,-u,ghczmprim_GHCziTypes_Fzh_static_info -Wl,-u,ghczmprim_GHCziTypes_Dzh_static_info -Wl,-u,base_GHCziPtr_Ptr_static_info -Wl,-u,ghczmprim_GHC...

... I have a file helloworld.hs whose contents are simply If I run ghc -c -o helloworld.o helloworld.hs to generate assembly. I would like to know how to manually link helloworld.o If I run ghc -o runnable helloworld.o -v3 to see how ghc accomplishes this (with verbose output) I see this. I cannot simply use a similar ...

[ -0.021240234375, -0.01507568359375, 0.01080322265625, -0.003021240234375, -0.005401611328125, -0.00041961669921875, -0.002105712890625, 0.0024566650390625, -0.0167236328125, -0.01220703125, -0.01123046875, -0.0174560546875, 0.0018463134765625, -0.014892578125, 0.000614166259765625, -0....

[ 153, 765, 11435, 33600, 31, 32554, 127, 7, 10941, 42856, 11675, 31380, 238, 20, 139392, 10, 89845, 38526, 3714, 3642, 23009, 538, 3126, 5, 19, 2886, 334, 363, 1957, 163846, 57823, 140992, 53418, 21373, 11782, 22109, 35978, 28282, 248, 267...

[ 0.00982666015625, 0.019439697265625, 0.1500244140625, 0.1583251953125, 0.172607421875, 0.2254638671875, 0.1376953125, 0.082275390625, 0.08282470703125, 0.054931640625, 0.1192626953125, 0.1307373046875, 0.120361328125, 0.007293701171875, 0.1865234375, 0.0141448974609375, 0.19567871093...

embed

78244252_c1

78244252

haskell

1

/ toEnum . The origin of the question (in case you have spare suggestions) I was using Word32 , but then it took me quite a while to undertand the reason of a but in my program. Essentially, quite a good chunk of my logic was assuming that the value of Word32 s is not 0 . Therefore, I thought of using a more appropria...

[ -0.0247802734375, -0.01055908203125, 0.01318359375, -0.00103759765625, -0.0031890869140625, 0.009765625, 0.0157470703125, -0.00634765625, 0.01031494140625, -0.02197265625, -0.0030975341796875, 0.011962890625, 0.0106201171875, -0.0009613037109375, -0.00156402587890625, 0.007781982421875...

[ 248, 47, 647, 2606, 5, 59665, 9655, 157666, 17368, 22543, 6460, 34739, 32233, 12960, 1379, 31635, 10, 1284, 1528, 179769, 62775, 66596, 34292, 91, 959, 757, 17569, 1286, 95307, 2053, 10644, 29479, 18507, 198, 36880, 44401, 7192, 172, 4935, ...

[ 0.080810546875, 0.231689453125, 0.1285400390625, 0.3271484375, 0.024932861328125, 0.116943359375, 0.0253448486328125, 0.0711669921875, 0.0830078125, 0.16015625, 0.265625, 0.0628662109375, 0.0148162841796875, 0.0421142578125, 0.031890869140625, 0.10693359375, 0.01300048828125, 0.237...

embed

31843006_c0

31843006

haskell

0

Title: Haskell cycle a vector Problem title: Haskell cycle a vector Tags: vector, haskell Problem: Haskell cycle a vector Is there a vector alternative of Data.List's cycle ? The Data.Vector docs have a section titled Recycling support that sounds like it is what I would want but the functions new and clone clearly don...

Haskell cycle a vector Haskell cycle a vector vector haskell Haskell Data.List.cycle Vector Haskell cycle a vector Is there a vector alternative of Data.List's cycle ? The Data.Vector docs have a section titled Recycling support that sounds like it is what I would want but the functions new and clone clearly don't do w...

[ -0.004974365234375, 0.0162353515625, -0.0179443359375, 0.01904296875, 0.018798828125, -0.01434326171875, -0.01458740234375, -0.033203125, -0.0033416748046875, -0.04296875, -0.024658203125, 0.0294189453125, -0.0150146484375, 0.0294189453125, -0.0198974609375, 0.0101318359375, -0.02441...

[ 20625, 142508, 105823, 10, 173, 18770, 1556, 11809, 154663, 75457, 2609, 2685, 30700, 111, 5, 26455, 54, 40059, 853, 166871, 8060, 102678, 2806, 3444, 1284, 32354, 3525, 136, 20450, 123019, 18, 29806, 47644, 119140, 63262, 678, 105416, 2811, ...

[ 0.1256103515625, 0.2279052734375, 0.2457275390625, 0.06976318359375, 0.19384765625, 0.207275390625, 0.109619140625, 0.1253662109375, 0.1846923828125, 0.2239990234375, 0.1842041015625, 0.01214599609375, 0.1739501953125, 0.046478271484375, 0.04095458984375, 0.18603515625, 0.01260375976...

embed

25107542_c0

25107542

haskell

0

Title: Solving Euler #31 in Haskell Problem title: Solving Euler #31 in Haskell Tags: haskell Problem: Solving Euler #31 in Haskell I compared my solution to the one published on haskell.org http://www.haskell.org/haskellwiki/Euler_problems/31_to_40 and don't know what to think of it. Is what I wrote so non-idiomatic, ...

Solving Euler #31 in Haskell Solving Euler #31 in Haskell haskell Solving Euler Haskell c:cs Solving Euler #31 in Haskell I compared my solution to the one published on haskell.org http://www.haskell.org/haskellwiki/Euler_problems/31_to_40 and don't know what to think of it. Is what I wrote so non-idiomatic, that an av...

[ -0.041748046875, -0.00127410888671875, 0.00555419921875, -0.0033111572265625, -0.0179443359375, 0.0216064453125, -0.001708984375, -0.0035858154296875, 0.03173828125, -0.021484375, 0.01251220703125, -0.006134033203125, 0.001556396484375, 0.01361083984375, -0.022705078125, 0.006256103515...

[ 6678, 6496, 5177, 603, 468, 5016, 20625, 142508, 23, 1556, 501, 4439, 154186, 29806, 47, 1632, 91376, 1478, 10557, 13691, 52283, 38953, 188, 2839, 3714, 5351, 2071, 2367, 54397, 221, 351, 57840, 47148, 83080, 106001, 2806, 109312, 60199, 66...

[ 0.138671875, 0.06396484375, 0.1708984375, 0.193603515625, 0.0205841064453125, 0.255859375, 0.141845703125, 0.22412109375, 0.05194091796875, 0.121337890625, 0.0204010009765625, 0.1065673828125, 0.1070556640625, 0.13916015625, 0.054534912109375, 0.03759765625, 0.09326171875, 0.047546...

embed

7055146_c0

7055146

haskell

0

Title: Why do 3 and x (which was assigned 3) have different inferred types in Haskell? Problem title: Why do 3 and x (which was assigned 3) have different inferred types in Haskell? Tags: type-inference, monomorphism-restriction, haskell Problem: Why do 3 and x (which was assigned 3) have different inferred types in Ha...

Why do 3 and x (which was assigned 3) have different inferred types in Haskell? Why do 3 and x (which was assigned 3) have different inferred types in Haskell? type-inference monomorphism-restriction haskell Why Haskell Prelude Num Integer Why do 3 and x (which was assigned 3) have different inferred types in Haskell? ...

[ -0.00140380859375, 0.00823974609375, 0.0108642578125, 0.0133056640625, 0.01361083984375, 0.0027923583984375, -0.0022125244140625, -0.0177001953125, 0.0078125, 0.00103759765625, -0.007415771484375, -0.04931640625, 0.00970458984375, 0.0013580322265625, 0.003662109375, 0.013916015625, 0...

[ 44084, 138, 136, 1022, 95486, 8439, 12921, 53498, 2822, 52895, 20625, 142508, 765, 23, 10644, 73, 69988, 22460, 178851, 8780, 7655, 1556, 1914, 822, 112, 52782, 44401, 143321, 60457, 6620, 4785, 52080, 9709, 4127, 8781, 27781, 25632, 127, 1...

[ 0.1134033203125, 0.1937255859375, 0.14404296875, 0.1251220703125, 0.1279296875, 0.1968994140625, 0.194091796875, 0.2003173828125, 0.11083984375, 0.2177734375, 0.127685546875, 0.23193359375, 0.06463623046875, 0.0159759521484375, 0.220458984375, 0.0222320556640625, 0.1427001953125, 0...

embed

70752333_c0

70752333

haskell

0

Title: Alternative of Show that only uses name Problem title: Alternative of Show that only uses name Tags: deriving, generics, haskell Problem: Alternative of Show that only uses name Is there something like Show (deriving Show) that only uses an algebraic datatype's constructors? (please don't mind that I'm using the...

Alternative of Show that only uses name Alternative of Show that only uses name deriving generics haskell Alternative Show Alternative of Show that only uses name Is there something like Show (deriving Show) that only uses an algebraic datatype's constructors? (please don't mind that I'm using the word constructor, I d...

[ 0.0274658203125, 0.005401611328125, 0.00714111328125, 0.0380859375, 0.002777099609375, 0.00537109375, -0.0033416748046875, 0.00445556640625, -0.002044677734375, -0.0036468505859375, -0.01611328125, -0.00958251953125, 0.003387451171875, 0.026611328125, 0, 0.00051116943359375, -0.01550...

[ 103905, 111, 17367, 450, 4734, 4527, 9351, 16406, 6496, 189534, 1556, 142508, 2685, 9844, 1884, 820, 14, 429, 2844, 2053, 50986, 64549, 25251, 17368, 2565, 748, 3714, 3444, 10941, 122, 5844, 7464, 21647, 8, 85779, 4677, 11814, 29479, 141377...

[ 0.2373046875, 0.1966552734375, 0.30029296875, 0.031829833984375, 0.16455078125, 0.1517333984375, 0.2088623046875, 0.1361083984375, 0.1422119140625, 0.1900634765625, 0.11767578125, 0.218505859375, 0.044647216796875, 0.051422119140625, 0.053375244140625, 0.0916748046875, 0.052032470703...

embed

43891738_c0

43891738

haskell

0

Title: Why does this Parsec parser enter an infinite loop? Problem title: Why does this Parsec parser enter an infinite loop? Tags: haskell, parsec Problem: Why does this Parsec parser enter an infinite loop? The following parser enters an infinite loop for any input. data Ast = Number Int | Identifier String | Operati...

Why does this Parsec parser enter an infinite loop? Why does this Parsec parser enter an infinite loop? haskell parsec Why Parsec Ast Number Identifier Operation BinOp Show Plus Minus Enum many1 Parser Why does this Parsec parser enter an infinite loop? The following parser enters an infinite loop for any input. The pr...

[ -0.0054931640625, -0.01611328125, 0.01434326171875, 0.0283203125, 0.001373291015625, 0.00066375732421875, 0.00457763671875, -0.009765625, 0.007171630859375, -0.0223388671875, 0.01483154296875, 0.01251220703125, 0.003753662109375, 0.01141357421875, 0.007659912109375, 0.007293701171875, ...

[ 44084, 14602, 903, 2392, 39797, 366, 2189, 30957, 142, 54241, 13, 40956, 1556, 142508, 62, 271, 103332, 189543, 102203, 16666, 39029, 17367, 8183, 24169, 357, 316, 5941, 418, 25632, 7, 100, 2499, 107730, 2967, 174653, 41018, 62548, 75939, 6...

[ 0.1451416015625, 0.059539794921875, 0.0909423828125, 0.1434326171875, 0.2332763671875, 0.1483154296875, 0.1688232421875, 0.1622314453125, 0.05438232421875, 0.1492919921875, 0.0830078125, 0.18310546875, 0.1116943359375, 0.187255859375, 0.03387451171875, 0.1259765625, 0.0869140625, 0...

embed

69717825_c0

69717825

haskell

0

Title: How to prove that the type parameters of an Injective Type Family are Equivalent? Problem title: How to prove that the type parameters of an Injective Type Family are Equivalent? Tags: injective-function, type-families, haskell, dependent-type Problem: How to prove that the type parameters of an Injective Type F...

How to prove that the type parameters of an Injective Type Family are Equivalent? How to prove that the type parameters of an Injective Type Family are Equivalent? injective-function type-families haskell dependent-type How Injective Type Family Equivalent MyTF Refl How to prove that the type parameters of an Injective...

[ 0.0084228515625, -0.0125732421875, -0.007415771484375, 0.01007080078125, -0.040283203125, -0.0189208984375, 0.004913330078125, -0.0142822265625, -0.00537109375, -0.021728515625, -0.010986328125, -0.00482177734375, 0.01397705078125, 0.0213623046875, 0.0106201171875, -0.0262451171875, ...

[ 11249, 23534, 10644, 171859, 360, 170, 100034, 60457, 59745, 145666, 85540, 621, 115049, 5844, 137175, 69128, 1556, 142508, 108750, 50986, 2646, 30992, 53295, 141, 14449, 98869, 224743, 2046, 3956, 2965, 4527, 51, 115840, 10625, 56, 329, 105506...

[ 0.0272216796875, 0.166015625, 0.2215576171875, 0.2125244140625, 0.03662109375, 0.1566162109375, 0.164306640625, 0.2003173828125, 0.1717529296875, 0.0753173828125, 0.1715087890625, 0.0098876953125, 0.19873046875, 0.136474609375, 0.10699462890625, 0.11767578125, 0.054962158203125, 0....

embed

36611647_c0

36611647

haskell

0

Title: Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Problem title: Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Tags: haskell Problem: Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Within Haskell I have a program that scrapes the html off a page and stores ...

Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error haskell Haskell Regex Couldn Char matches_list Haskell Regex - Couldn't match type ‘[Char]’ with ‘IO () error Within Haskell I have a program that scrapes the html off a page and store...

[ -0.00543212890625, 0.01483154296875, 0.01458740234375, 0.01397705078125, 0.0054931640625, 0.0281982421875, -0.033447265625, 0.0198974609375, 0.01611328125, -0.04541015625, 0.002288818359375, -0.03173828125, 0.01031494140625, -0.01397705078125, 0.0157470703125, 0.0004367828369140625, ...

[ 20625, 142508, 11678, 3355, 191147, 3768, 18, 14858, 10644, 1065, 84068, 678, 17780, 18499, 1556, 19, 21656, 90, 6562, 1528, 120948, 7693, 5773, 9191, 4343, 77336, 3444, 139392, 5303, 23351, 214, 16401, 756, 103510, 6626, 124519, 35064, 1295,...

[ 0.110595703125, 0.1912841796875, 0.1192626953125, 0.185791015625, 0.1146240234375, 0.1361083984375, 0.0948486328125, 0.2332763671875, 0.1953125, 0.03533935546875, 0.2008056640625, 0.09698486328125, 0.209716796875, 0.156982421875, 0.07415771484375, 0.0221405029296875, 0.17578125, 0....

embed

37081460_c0

37081460

haskell

0

Title: Number guessing game error and keeping count of guesses Problem title: Number guessing game error and keeping count of guesses Tags: io, haskell, random Problem: Number guessing game error and keeping count of guesses easy :: IO () easy = do putStrLn "Guess a number between 1 and 13: " rNumber <- randomRIO (1, 1...

Number guessing game error and keeping count of guesses Number guessing game error and keeping count of guesses io haskell random System.Random Number finalename.hs:5:10 Parse Possibly Easy Medium Hard Select You Guess Correct Number guessing game error and keeping count of guesses I am doing a number guessing game in ...

[ -0.005096435546875, -0.008544921875, -0.0098876953125, 0.01104736328125, 0.036376953125, 0.024169921875, -0.0235595703125, -0.004791259765625, -0.003143310546875, -0.01318359375, -0.005523681640625, -0.0186767578125, 0.01409912109375, 0.0257568359375, 0.03466796875, 0.01214599609375, ...

[ 103332, 57767, 214, 6712, 18499, 136, 120260, 54529, 111, 22995, 1556, 142508, 96759, 12353, 126525, 3815, 22688, 11627, 127, 758, 15110, 2392, 115861, 71975, 174413, 39391, 51620, 96274, 7, 46348, 15390, 90, 20594, 14012, 20625, 138, 34844, ...

[ 0.167724609375, 0.2197265625, 0.0853271484375, 0.1619873046875, 0.21142578125, 0.0557861328125, 0.1705322265625, 0.18408203125, 0.11474609375, 0.15478515625, 0.119873046875, 0.222412109375, 0.1043701171875, 0.0921630859375, 0.04638671875, 0.102294921875, 0.1517333984375, 0.10974121...

embed

17916302_c0

17916302

haskell

0

Title: Yesod live reload of Hamlet with GHCI instead of GHC? Problem title: Yesod live reload of Hamlet with GHCI instead of GHC? Tags: type-safety, yesod, haskell, ghci, ghc Problem: Yesod live reload of Hamlet with GHCI instead of GHC? I just heard about Yesod and started reading the book. In the Shakespeare chapter,...

Yesod live reload of Hamlet with GHCI instead of GHC? Yesod live reload of Hamlet with GHCI instead of GHC? type-safety yesod haskell ghci ghc Yesod Hamlet GHCI GHC Yesod live reload of Hamlet with GHCI instead of GHC? I just heard about Yesod and started reading the book. In the Shakespeare chapter, about 3/4 down, th...

[ -0.0101318359375, 0.01263427734375, 0.005767822265625, -0.00555419921875, -0.0205078125, 0.0050048828125, -0.0181884765625, 0.0303955078125, -0.01708984375, -0.0274658203125, -0.0028076171875, -0.041259765625, -0.0189208984375, 0.00335693359375, 0.032958984375, -0.004608154296875, -0...

[ 32635, 2199, 6867, 456, 63033, 111, 10699, 1974, 678, 41877, 17304, 64457, 527, 73265, 10644, 115840, 2422, 23722, 1556, 142508, 31380, 318, 238, 49782, 16454, 70, 12877, 113154, 139539, 4, 83849, 2804, 4332, 13736, 83, 959, 19882, 100, 473...

[ 0.183349609375, 0.254150390625, 0.190185546875, 0.1060791015625, 0.2459716796875, 0.0596923828125, 0.1702880859375, 0.2242431640625, 0.05731201171875, 0.169677734375, 0.20458984375, 0.0941162109375, 0.10418701171875, 0.1822509765625, 0.1268310546875, 0.15185546875, 0.1444091796875, ...

embed

2391773_c0

2391773

haskell

0

Title: Implementing CTCP commands in an IRC bot (Haskell) Problem title: Implementing CTCP commands in an IRC bot (Haskell) Tags: haskell, bots, irc Problem: Implementing CTCP commands in an IRC bot (Haskell) I have followed the tutorial on the Haskell wiki about i mplementing an IRC bot. and everything worked out fine...

Implementing CTCP commands in an IRC bot (Haskell) Implementing CTCP commands in an IRC bot (Haskell) haskell bots irc Implementing CTCP IRC Haskell PRIVMSG Haskellbot v1.0 GHCi Implementing CTCP commands in an IRC bot (Haskell) I have followed the tutorial on the Haskell wiki about i mplementing an IRC bot. and everyt...

[ 0.006317138671875, 0.023681640625, 0.0196533203125, 0.032958984375, 0.0166015625, 0.02587890625, -0.00494384765625, -0.01092529296875, -0.0177001953125, -0.00677490234375, -0.002288818359375, -0.039794921875, -0.0011749267578125, 0.0159912109375, -0.0250244140625, 0.00830078125, 0.01...

[ 153941, 71885, 17854, 75101, 7, 87, 25740, 13820, 6495, 142508, 1556, 193, 238, 20625, 29852, 47599, 74322, 9190, 102107, 73265, 14, 134629, 57143, 34356, 17, 19929, 65042, 35644, 50336, 3789, 72095, 11389, 136, 33429, 4488, 10723, 1284, 959,...

[ 0.191162109375, 0.154541015625, 0.2401123046875, 0.2222900390625, 0.0345458984375, 0.048797607421875, 0.1923828125, 0.1844482421875, 0.06634521484375, 0.2049560546875, 0.06402587890625, 0.107421875, 0.0185394287109375, 0.0841064453125, 0.05474853515625, 0.0692138671875, 0.10925292968...

embed

8218904_c0

8218904

haskell

0

Title: Speed up Data.Array row extraction and filtering Problem title: Speed up Data.Array row extraction and filtering Tags: haskell, arrays Problem: Speed up Data.Array row extraction and filtering I have a very simple function in my application that does a lot of work and occupies the most computation time: f :: Int...

Speed up Data.Array row extraction and filtering Speed up Data.Array row extraction and filtering haskell arrays Speed Data.Array Array Speed up Data.Array row extraction and filtering I have a very simple function in my application that does a lot of work and occupies the most computation time: What this does is: extr...

[ -0.01123046875, 0.00494384765625, 0.01806640625, 0.0026092529296875, 0.000415802001953125, -0.037109375, 0.0078125, 0.0074462890625, 0.01318359375, 0.00186920166015625, 0.0035858154296875, -0.000240325927734375, -0.019287109375, 0.0123291015625, -0.00058746337890625, -0.00390625, 0.0...

[ 63349, 1257, 11809, 7614, 7092, 15555, 4173, 10763, 46312, 1556, 142508, 10298, 4778, 69253, 53, 136, 214, 4552, 8781, 32354, 38415, 14602, 5915, 4488, 143414, 2684, 181135, 1733, 125663, 99, 63262, 1022, 1295, 187, 42, 30646, 756, 3365, 31...

[ 0.195068359375, 0.119140625, 0.1634521484375, 0.1141357421875, 0.178466796875, 0.2181396484375, 0.1861572265625, 0.0643310546875, 0.2001953125, 0.095703125, 0.1781005859375, 0.1243896484375, 0.013458251953125, 0.12744140625, 0.05596923828125, 0.016082763671875, 0.05328369140625, 0....

embed

31697883_c1

31697883

haskell

1

etymological_origin_of") then False else True tsv = do x <- ATL.many1 line return $ fmap M.fromList x main = (putStrLn . show . ATL.parse tsv) =<< text It works for small amounts of input, but quickly grows too inefficient. I'm not quite clear on where the problem is, and soon realized that even trivial tasks like view...

[ 0.004241943359375, 0.00537109375, -0.0157470703125, 0.02294921875, 0.00506591796875, -0.00176239013671875, 0.01239013671875, -0.010009765625, -0.00078582763671875, -0.03369140625, 0.00262451171875, -0.015869140625, 0.00830078125, 0.0189208984375, -0.01544189453125, 0.00836181640625, ...

[ 82, 4650, 109622, 3929, 6820, 4390, 22225, 184, 37076, 87599, 61636, 334, 54, 1022, 62, 41445, 669, 53, 418, 13315, 30646, 1238, 62346, 276, 161063, 154663, 5201, 7639, 2500, 16093, 7986, 1650, 43240, 19336, 41170, 107730, 1284, 69405, 5599...

[ 0.07623291015625, 0.184814453125, 0.1734619140625, 0.1898193359375, 0.1900634765625, 0.253662109375, 0.10650634765625, 0.068359375, 0.0181427001953125, 0.1234130859375, 0.142333984375, 0.227294921875, 0.0643310546875, 0.0305938720703125, 0.00311279296875, 0.1759033203125, 0.082580566...

embed

38819801_c1

38819801

haskell

1

>>=)’, namely ‘\ state -> modifying Slack.userState $ set appState $ f state’ Which makes sense given the signature for modifying : modifying :: MonadState s m => ASetter s s a b -> (a -> b) -> m () However, upon looking at the documentation for Slack.userState : userState :: forall s s. Lens (SlackState s) (SlackState...

[ -0.0234375, 0.00970458984375, 0.01507568359375, -0.004058837890625, -0.003997802734375, 0.0185546875, 0.003448486328125, -0.01434326171875, 0.009033203125, 0.00396728515625, -0.0181884765625, 0.0196533203125, -0.0098876953125, -0.00848388671875, 0.01531982421875, -0.014892578125, 0.0...

[ 6396, 1369, 41872, 11341, 2811, 151138, 159, 123660, 5, 65918, 135206, 13, 3650, 5423, 4027, 1238, 30482, 10422, 138256, 60331, 71, 91, 347, 62593, 876, 209806, 38937, 100, 5584, 18226, 77641, 2053, 82084, 18770, 116071, 17367, 211235, 15400,...

[ 0.045166015625, 0.071533203125, 0.021209716796875, 0.2047119140625, 0.1461181640625, 0.130859375, 0.07891845703125, 0.26220703125, 0.015869140625, 0.1319580078125, 0.2587890625, 0.1239013671875, 0.05694580078125, 0.13623046875, 0.1844482421875, 0.1209716796875, 0.0133056640625, 0.1...

embed

52879635_c0

52879635

haskell

0

Title: Parse a String using Parsec? Problem title: Parse a String using Parsec? Tags: parsing, parsec, haskell Problem: Parse a String using Parsec? I am trying to parse a String using parsec in Haskell, however every attempt throws another type of error. import Text.ParserCombinators.Parsec csvFile = endBy line eol li...

Parse a String using Parsec? Parse a String using Parsec? parsing parsec haskell ParseError Parsec Text.ParserCombinators.Parsec Parse Either Parse a String using Parsec? I am trying to parse a String using parsec in Haskell, however every attempt throws another type of error. This code, when run through stack ghci pro...

[ -0.0201416015625, -0.00025177001953125, -0.0033721923828125, 0.05712890625, 0.006072998046875, 0.0216064453125, -0.005462646484375, -0.0299072265625, -0.01458740234375, -0.0167236328125, -0.019775390625, -0.036376953125, 0.0026702880859375, 0.00124359130859375, -0.0172119140625, 0.0050...

[ 2392, 184, 10, 23351, 214, 17368, 39797, 32, 366, 6953, 1556, 142508, 18468, 31611, 24129, 28636, 2189, 19155, 22230, 31577, 20625, 11907, 81887, 104250, 15700, 10644, 18499, 18151, 11675, 8305, 177261, 31380, 318, 27489, 6431, 21690, 2886, 1...

[ 0.172119140625, 0.1416015625, 0.03192138671875, 0.2213134765625, 0.127197265625, 0.1063232421875, 0.26904296875, 0.017852783203125, 0.1683349609375, 0.064697265625, 0.1072998046875, 0.2198486328125, 0.048248291015625, 0.008270263671875, 0.1431884765625, 0.12353515625, 0.0594177246093...

embed

67254536_c0

67254536

haskell

0

Title: How can I infer types for recursive functions? Problem title: How can I infer types for recursive functions? Tags: haskell, type-inference, recursion, hindley-milner Problem: How can I infer types for recursive functions? I'm trying to implement language with type inference based on Hindley-Milner algorithm. But...

How can I infer types for recursive functions? How can I infer types for recursive functions? haskell type-inference recursion hindley-milner How How can I infer types for recursive functions? I'm trying to implement language with type inference based on Hindley-Milner algorithm. But I don't know how to infer types for...

[ -0.00335693359375, -0.01220703125, -0.000690460205078125, 0.026611328125, -0.006195068359375, -0.00537109375, -0.0107421875, 0.0027923583984375, -0.0172119140625, -0.041259765625, 0.007598876953125, -0.0274658203125, -0.01312255859375, 0.004791259765625, 0.021728515625, -0.002044677734...

[ 11249, 831, 87, 53498, 52895, 100, 195625, 5844, 32354, 1556, 142508, 10644, 73, 69988, 1830, 34866, 4293, 12397, 1679, 29479, 46876, 6620, 35509, 67944, 92369, 234873, 3714, 3642, 8110, 139392, 86869, 158, 2816, 4288, 1238, 136, 706, 25842, ...

[ 0.088134765625, 0.06884765625, 0.0548095703125, 0.280517578125, 0.26708984375, 0.0899658203125, 0.2271728515625, 0.1385498046875, 0.139892578125, 0.08544921875, 0.185791015625, 0.215087890625, 0.03436279296875, 0.15380859375, 0.00537109375, 0.07965087890625, 0.1573486328125, 0.0632...

embed

69516792_c0

69516792

haskell

0

Title: Are haskell list comprehensions lazy? Problem title: Are haskell list comprehensions lazy? Tags: ghci, haskell, idioms, lazy-evaluation, performance Problem: Are haskell list comprehensions lazy? After a long while dealing with other languages, I wanted to refresh my aging Haskell skills a little with some codeg...

Are haskell list comprehensions lazy? Are haskell list comprehensions lazy? ghci haskell idioms lazy-evaluation performance Data.Word Word32 Are haskell list comprehensions lazy? After a long while dealing with other languages, I wanted to refresh my aging Haskell skills a little with some codegolf inspired computation...

[ -0.00113677978515625, 0.001068115234375, -0.00323486328125, 0.002838134765625, 0.00396728515625, 0.0233154296875, 0.003753662109375, 0.021728515625, 0.017578125, -0.00775146484375, -0.0128173828125, -0.0021820068359375, 0.00836181640625, 0.005615234375, -0.0185546875, 0.021240234375, ...

[ 15901, 1556, 142508, 5303, 46683, 3220, 63239, 21, 3285, 32, 31380, 318, 13373, 28016, 159258, 23718, 11809, 164805, 22543, 6460, 184017, 46876, 36663, 210651, 66398, 20625, 59376, 10176, 18151, 120291, 191722, 181135, 179140, 140909, 35064, 2870...

[ 0.0799560546875, 0.1419677734375, 0.2364501953125, 0.208251953125, 0.1383056640625, 0.1434326171875, 0.0906982421875, 0.153564453125, 0.1995849609375, 0.004425048828125, 0.03997802734375, 0.06353759765625, 0.074951171875, 0.0212860107421875, 0.08074951171875, 0.10302734375, 0.0484924...

embed

12795230_c1

12795230

haskell

1

SocketT = StateT ClientSocket type HNT m = ClientSocketT (NetworkEnvT m) initialNetwork :: NetworkEnv initialNetwork = NetworkEnv { getMulticastIP = _MULTICAST_IP_ADDR_, getMulticastPort = _MULTICAST_PORT_ } openClientConnection :: HNT m a -> m a openClientConnection func = do env <- ask (sock, addr) <- liftIO $ multic...

[ -0.021240234375, 0.005340576171875, 0.000675201416015625, 0.0211181640625, 0.0218505859375, -0.00958251953125, -0.00970458984375, -0.0145263671875, -0.0194091796875, -0.04248046875, 0.0028228759765625, 0.0264892578125, 0.00098419189453125, -0.008544921875, -0.006011962890625, -0.013671...

[ 1061, 27853, 618, 2203, 22836, 91732, 8912, 10644, 572, 22879, 347, 18244, 7768, 334, 61475, 24447, 28997, 2046, 50657, 10931, 176851, 8545, 23498, 60006, 91599, 9803, 150, 235603, 10, 2517, 7477, 54, 22, 26458, 991, 15190, 60520, 17780, 60...

[ 0.1495361328125, 0.228759765625, 0.185791015625, 0.03594970703125, 0.1285400390625, 0.226806640625, 0.16943359375, 0.169189453125, 0.0809326171875, 0.19091796875, 0.1318359375, 0.09625244140625, 0.09991455078125, 0.16943359375, 0.146728515625, 0.06243896484375, 0.092529296875, 0.01...

embed

35581300_c0

35581300

haskell

0

Title: Interoperability with Java in Frege, especially in IO Monad Problem title: Interoperability with Java in Frege, especially in IO Monad Tags: java, haskell, frege Problem: Interoperability with Java in Frege, especially in IO Monad I would like to translate this java code into Frege Haskell: PApplet pApplet = new...

Interoperability with Java in Frege, especially in IO Monad Interoperability with Java in Frege, especially in IO Monad java haskell frege Interoperability Java Frege Monad PApplet System.out.print pApplet.toString PApplet.runSketch processing.core.PApplet processing.core.PApplet.runSketch ArrayOf RealWorld PApplet.new...

[ -0.003570556640625, -0.006561279296875, -0.00469970703125, 0.017578125, -0.00531005859375, 0.0238037109375, 0.01123046875, -0.000701904296875, 0.007720947265625, -0.008056640625, 0.0164794921875, -0.036865234375, 0.000156402587890625, 0.00104522705078125, -0.0074462890625, 0.0008621215...

[ 5337, 42227, 41159, 678, 41925, 23, 21612, 429, 41866, 17780, 60331, 71, 79, 330, 1556, 142508, 183559, 13, 436, 75339, 18, 12353, 6056, 35662, 915, 188, 71713, 16428, 3473, 9433, 30854, 683, 69253, 132887, 5120, 70646, 54936, 7092, 161063,...

[ 0.110595703125, 0.228759765625, 0.0758056640625, 0.1185302734375, 0.272705078125, 0.028900146484375, 0.216552734375, 0.218017578125, 0.003631591796875, 0.1783447265625, 0.1405029296875, 0.09368896484375, 0.1197509765625, 0.20166015625, 0.06085205078125, 0.2042236328125, 0.13916015625...

embed

18767086_c1

18767086

haskell

1

17:56: Couldn't match expected type `ByteString' with actual type `bytestring-0.10.0.2:Data.ByteString.Internal.ByteString' In the first argument of `decode', namely `x' In the first argument of `(<>)', namely `decode x' In the second argument of `(<>)', namely `decode x <> ";"' So, my guess this error has something to...

[ 0.016845703125, 0.004486083984375, -0.0078125, -0.004730224609375, -0.00732421875, 0.012939453125, -0.006683349609375, 0.0079345703125, -0.00347900390625, 0.007781982421875, 0.014404296875, 0.00070953369140625, 0.020263671875, 0.00994873046875, -0.01806640625, -0.0074462890625, -0.00...

[ 34546, 191147, 18, 14858, 84751, 10644, 75358, 67, 71713, 214, 678, 8561, 61028, 91693, 23320, 10179, 133684, 137989, 44851, 6236, 5117, 10750, 112, 40899, 110987, 425, 16093, 2740, 1022, 17932, 4426, 57767, 18499, 91732, 294, 90, 6889, 20653...

[ 0.08251953125, 0.123779296875, 0.0823974609375, 0.220458984375, 0.200439453125, 0.1790771484375, 0.111572265625, 0.1165771484375, 0.1988525390625, 0.093994140625, 0.09246826171875, 0.121826171875, 0.143310546875, 0.2296142578125, 0.0220794677734375, 0.121337890625, 0.1468505859375, ...

embed

24072177_c0

24072177

haskell

0

Title: Haskell selecting last items from the list of lists Problem title: Haskell selecting last items from the list of lists Tags: list, haskell Problem: Haskell selecting last items from the list of lists Hi guys I have a little problem that I have been struggling with for a couple of hours, so I thought that maybe y...

Haskell selecting last items from the list of lists Haskell selecting last items from the list of lists list haskell the Haskell Field Map Haskell selecting last items from the list of lists Hi guys I have a little problem that I have been struggling with for a couple of hours, so I thought that maybe you could help me...

[ -0.00982666015625, 0.003570556640625, 0.000774383544921875, 0.0009765625, -0.0220947265625, 0.0067138671875, -0.00179290771484375, 0.000812530517578125, 0.006072998046875, 0.008056640625, 0.01141357421875, -0.0238037109375, 0.0203857421875, 0.01507568359375, -0.025390625, 0.00066757202...

[ 20625, 142508, 36849, 214, 4568, 55769, 1295, 5303, 111, 1556, 117657, 42719, 51484, 10176, 2967, 237875, 100, 21974, 4358, 6275, 52080, 2053, 50986, 10644, 75935, 176866, 44457, 32354, 30646, 103033, 1884, 903, 2831, 179933, 3871, 33022, 51776...

[ 0.1343994140625, 0.206298828125, 0.1649169921875, 0.005615234375, 0.22509765625, 0.18115234375, 0.0904541015625, 0.2022705078125, 0.04010009765625, 0.12353515625, 0.156494140625, 0.2001953125, 0.032745361328125, 0.053985595703125, 0.056976318359375, 0.057220458984375, 0.0105590820312...

embed

52156838_c0

52156838

haskell

0

Title: Can I append to a file using binary's Data.Binary? Problem title: Can I append to a file using binary's Data.Binary? Tags: binary, disk, haskell, append Problem: Can I append to a file using binary's Data.Binary? I've got a [Something] value, I'd like to save this value to disk every n seconds. However...

Can I append to a file using binary's Data.Binary? Can I append to a file using binary's Data.Binary? binary disk haskell append binary Can Data.Binary Something Can I append to a file using binary's Data.Binary? I've got a [Something] value, I'd like to save this value to disk every n seconds. However this v...

[ 0.0022125244140625, 0.01190185546875, 0.01068115234375, -0.003021240234375, 0.01068115234375, 0.01904296875, -0.0034332275390625, 0.00909423828125, 0.03662109375, -0.01055908203125, -0.002166748046875, -0.015869140625, -0.000598907470703125, 0.028564453125, 0.020263671875, -0.014404296...

[ 4171, 87, 114689, 71, 47, 11435, 17368, 2394, 6635, 3768, 11809, 5, 571, 73, 28338, 1556, 142508, 200905, 10, 4163, 64113, 34292, 1884, 30098, 11907, 653, 94131, 5809, 80854, 32562, 28484, 1733, 38516, 95549, 16487, 64457, 5303, 68034, 282,...

[ 0.1219482421875, 0.0633544921875, 0.230224609375, 0.1876220703125, 0.138916015625, 0.196533203125, 0.10009765625, 0.1856689453125, 0.203125, 0.0404052734375, 0.18212890625, 0.05621337890625, 0.1180419921875, 0.192626953125, 0.085693359375, 0.09564208984375, 0.21435546875, 0.1163330...

embed

49246572_c0

49246572

haskell

0

Title: Gap function that returns the integer distance between first appearance of two elements in a list using either foldl or foldr.(Haskell) Problem title: Gap function that returns the integer distance between first appearance of two elements in a list using either foldl or foldr.(Haskell) Tags: fold, haskell, list ...

Gap function that returns the integer distance between first appearance of two elements in a list using either foldl or foldr.(Haskell) Gap function that returns the integer distance between first appearance of two elements in a list using either foldl or foldr.(Haskell) fold haskell list either Gap Haskell Gap functio...

[ 0.0020294189453125, 0.007598876953125, 0.00738525390625, -0.01202392578125, -0.01263427734375, 0.034912109375, 0.00110626220703125, 0.012451171875, -0.000698089599609375, -0.00689697265625, -0.00982666015625, -0.0174560546875, -0.01953125, 0.0177001953125, -0.0037994384765625, 0.001174...

[ 2902, 254, 32354, 30646, 892, 1505, 62488, 17721, 5117, 170894, 6626, 80854, 5303, 17368, 18344, 20469, 7569, 6495, 7, 142508, 707, 42822, 1556, 40101, 20625, 10644, 61924, 28960, 43599, 1984, 864, 10, 44357, 33079, 11, 268, 83425, 360, 18,...

[ 0.267333984375, 0.234375, 0.220947265625, 0.172119140625, 0.132568359375, 0.0704345703125, 0.252197265625, 0.1365966796875, 0.08642578125, 0.17919921875, 0.10693359375, 0.1539306640625, 0.1942138671875, 0.0396728515625, 0.1495361328125, 0.18408203125, 0.179443359375, 0.0634765625, ...

embed

60245449_c0

60245449

haskell

0

Title: newtype-like operational semantics for a GADT where the type fully determines the constructor Problem title: newtype-like operational semantics for a GADT where the type fully determines the constructor Tags: gadt, haskell, coercion, newtype Problem: newtype-like operational semantics for a GADT where the type f...

newtype-like operational semantics for a GADT where the type fully determines the constructor newtype-like operational semantics for a GADT where the type fully determines the constructor gadt haskell coercion newtype GADT Tag Payload Double Bool Coercible PayloadA PayloadB PayloadC newtype-like operational semantics f...

[ 0.0012359619140625, -0.0125732421875, -0.006988525390625, 0.00157928466796875, 0.0054931640625, 0.0033416748046875, -0.0108642578125, -0.00811767578125, 0.003631591796875, -0.0008544921875, -0.00518798828125, -0.032470703125, -0.00189971923828125, -0.005279541015625, -0.00360107421875, ...

[ 3525, 50986, 5062, 41018, 289, 484, 109109, 23749, 41072, 10644, 89554, 83324, 64549, 748, 914, 13384, 1556, 142508, 552, 56, 6447, 4837, 17166, 63033, 107172, 2460, 929, 1311, 318, 2661, 284, 571, 441, 1884, 3444, 110, 11675, 6032, 18811, ...

[ 0.17822265625, 0.285888671875, 0.164306640625, 0.1619873046875, 0.0207977294921875, 0.105712890625, 0.1209716796875, 0.1336669921875, 0.197509765625, 0.2197265625, 0.081298828125, 0.1392822265625, 0.086181640625, 0.0631103515625, 0.073486328125, 0.1405029296875, 0.09283447265625, 0...

embed

36162127_c0

36162127

haskell

0

Title: Is the Cake Pattern missing from Haskell? Why and when would I need to use the Cake Pattern in Haskell? Problem title: Is the Cake Pattern missing from Haskell? Why and when would I need to use the Cake Pattern in Haskell? Tags: haskell, scala, cake-pattern Problem: Is the Cake Pattern missing from Haskell? Why ...

Is the Cake Pattern missing from Haskell? Why and when would I need to use the Cake Pattern in Haskell? Is the Cake Pattern missing from Haskell? Why and when would I need to use the Cake Pattern in Haskell? haskell scala cake-pattern Haskell Cake Pattern Why Is the Cake Pattern missing from Haskell? Why and when would...

[ -0.004425048828125, 0.01123046875, 0.019287109375, -0.00640869140625, 0.001739501953125, 0.005645751953125, -0.01092529296875, 0.0191650390625, -0.000728607177734375, 0.0223388671875, -0.0177001953125, -0.0211181640625, -0.0089111328125, 0.00775146484375, 0.0113525390625, 0.00156402587...

[ 2071, 2041, 350, 9876, 22766, 132283, 1295, 20625, 142508, 44084, 3229, 3871, 4527, 23, 1556, 146232, 86963, 4453, 174489, 26908, 152653, 11, 92635, 1452, 1297, 959, 6044, 31089, 131148, 4358, 21334, 6827, 76519, 18749, 7722, 75935, 678, 1766...

[ 0.00946044921875, 0.20703125, 0.16796875, 0.1893310546875, 0.1558837890625, 0.141845703125, 0.058563232421875, 0.113525390625, 0.217529296875, 0.0462646484375, 0.0143585205078125, 0.04290771484375, 0.0670166015625, 0.0266571044921875, 0.07098388671875, 0.144287109375, 0.2142333984375...

embed

36290449_c0

36290449

haskell

0

Title: Haskell function that outputs all combinations within the input list that add to the input number Problem title: Haskell function that outputs all combinations within the input list that add to the input number Tags: recursion, list, haskell Problem: Haskell function that outputs all combinations within the inpu...

Haskell function that outputs all combinations within the input list that add to the input number Haskell function that outputs all combinations within the input list that add to the input number recursion list haskell Haskell Integer Haskell function that outputs all combinations within the input list that add to the ...

[ -0.03515625, 0.00439453125, 0.006195068359375, 0.01226806640625, -0.01055908203125, 0.026123046875, 0.003509521484375, -0.01214599609375, 0.006744384765625, -0.0076904296875, 0.00970458984375, -0.006988525390625, 0.0120849609375, 0.0157470703125, -0.00445556640625, -0.00082015991210937...

[ 20625, 142508, 32354, 450, 140992, 756, 162515, 7, 28032, 107730, 5303, 15190, 47, 14012, 195625, 1830, 1556, 44401, 3444, 33022, 51776, 892, 26255, 136, 1505, 34292, 237, 70541, 80854, 1257, 759, 97249, 238, 122101, 109631, 1126, 2681, 2489,...

[ 0.1470947265625, 0.23291015625, 0.20849609375, 0.012451171875, 0.1942138671875, 0.1163330078125, 0.257080078125, 0.0494384765625, 0.118408203125, 0.201904296875, 0.1807861328125, 0.16748046875, 0.07177734375, 0.1458740234375, 0.175048828125, 0.05535888671875, 0.140625, 0.1920166015...

embed

23428949_c0

23428949

haskell

0

Title: GHCi is crashing when executed from a directory that has a Prelude.hs Problem title: GHCi is crashing when executed from a directory that has a Prelude.hs Tags: haskell, ghci, ghc Problem: GHCi is crashing when executed from a directory that has a Prelude.hs GHCi crashes when I try to start it from my src direct...

GHCi is crashing when executed from a directory that has a Prelude.hs GHCi is crashing when executed from a directory that has a Prelude.hs haskell ghci ghc a GHCi Prelude.hs XNoImplicitPrelude XPackageImports Prelude www.haskell.org Loading Top GHCi is crashing when executed from a directory that has a Prelude.hs GHCi...

[ -0.01025390625, -0.005157470703125, 0.021484375, 0.0023345947265625, -0.00921630859375, 0.0244140625, 0.0067138671875, -0.0130615234375, -0.01171875, -0.057373046875, -0.0123291015625, 0.00531005859375, -0.025634765625, -0.013671875, 0.00836181640625, 0.0093994140625, -0.014038085937...

[ 527, 73265, 14, 150631, 214, 3229, 71924, 1295, 14364, 1556, 1914, 822, 112, 127, 7, 142508, 31380, 318, 238, 1193, 5021, 128878, 60923, 19273, 205956, 61637, 6982, 10557, 1478, 228006, 4792, 5, 90, 9790, 4034, 91, 19437, 11435, 123087, 5...

[ 0.1138916015625, 0.1644287109375, 0.251220703125, 0.21337890625, 0.0987548828125, 0.07000732421875, 0.171875, 0.111328125, 0.1298828125, 0.1231689453125, 0.1346435546875, 0.2188720703125, 0.16455078125, 0.161376953125, 0.11767578125, 0.2291259765625, 0.1192626953125, 0.160034179687...

embed

23940487_c1

23940487

haskell

1

of these could similarly ignore the a type. For example: atRiskForDiabetes :: Person a -> Bool atRiskForDiabetes p = age p + weight p > 200 --Clearly, I am not actually a doctor Now, if we have a heterogeneous list of people (of type [exists a. Person a] ), we would like to be able to map some of our functions over th...

[ 0.00011968612670898438, 0.00762939453125, 0.000476837158203125, 0.0196533203125, -0.0238037109375, 0.009033203125, -0.0205078125, 0.00201416015625, 0.007110595703125, -0.0172119140625, -0.00115966796875, -0.0069580078125, 0.0106201171875, 0.0027923583984375, -0.005126953125, -0.0311279...

[ 111, 6097, 5809, 21373, 124962, 10, 10644, 27781, 99, 1052, 6581, 18537, 72838, 47212, 1984, 15270, 2460, 929, 915, 2203, 32070, 997, 57888, 1781, 444, 959, 20653, 22072, 2174, 765, 77099, 15292, 5303, 3395, 4390, 54376, 642, 1884, 19048, ...

[ 0.0091552734375, 0.0174407958984375, 0.042236328125, 0.07598876953125, 0.200927734375, 0.1103515625, 0.2099609375, 0.1121826171875, 0.0968017578125, 0.112548828125, 0.1278076171875, 0.131591796875, 0.055084228515625, 0.1541748046875, 0.0279388427734375, 0.1431884765625, 0.05490112304...

embed

77688448_c1

77688448

haskell

1

like with the first definition I can do: f (Dynamic tr x) = ... Instead of f (Dynamic @a x) = ... But what I find I do anyway is: f (Dynamic @a _ x) = ... Because the type is really handy to have in scope if f has any sub-functions defined that are explicitly typed, and not many functions take TypeRep a as an argument...

[ 0.007659912109375, -0.01318359375, -0.00689697265625, 0.000812530517578125, 0.002471923828125, -0.013671875, -0.009033203125, 0.0019683837890625, 0.0172119140625, -0.0045166015625, -0.00634765625, -0.036865234375, -0.018798828125, 0.00390625, 0.004669189453125, 0.00860595703125, 0.02...

[ 1884, 678, 5117, 80934, 831, 1238, 397, 29673, 21068, 4307, 1022, 2203, 175399, 1374, 11, 7413, 109954, 101, 10644, 6183, 3535, 53, 70820, 1614, 137175, 61924, 143726, 5941, 32354, 60457, 4332, 254, 10, 10750, 38415, 1250, 50878, 3871, 4764...

[ 0.04754638671875, 0.0144805908203125, 0.0246429443359375, 0.2088623046875, 0.04730224609375, 0.1739501953125, 0.062469482421875, 0.174560546875, 0.183837890625, 0.1441650390625, 0.1458740234375, 0.08184814453125, 0.1048583984375, 0.130615234375, 0.0526123046875, 0.0633544921875, 0.07...

embed

70038456_c0

70038456

haskell

0

Title: How should I use all combinations in applicative Problem title: How should I use all combinations in applicative Tags: haskell Problem: How should I use all combinations in applicative I encountered with a haskell problem. Here is the question. toList $ fromList [(+),(*)] <*> fromList [1..3] <*> fromList [10,100...

How should I use all combinations in applicative How should I use all combinations in applicative haskell How Tree Branch Leaf Show Applicative How should I use all combinations in applicative I encountered with a haskell problem. Here is the question. toList is a function that convert the Tree type into list and fromL...

[ 0.002685546875, 0.03466796875, -0.0101318359375, 0.01904296875, 0.0201416015625, 0.0244140625, 0.0054931640625, -0.009521484375, 0.007568359375, -0.03955078125, 0.0002269744873046875, -0.027099609375, 0.0186767578125, 0.041748046875, -0.0223388671875, -0.0023193359375, 0.01611328125,...

[ 11249, 5608, 87, 4527, 756, 162515, 7, 23, 41816, 4935, 1556, 142508, 101344, 21110, 206, 636, 2407, 17367, 5659, 11048, 190647, 2967, 47, 154663, 32354, 96760, 10644, 3934, 5303, 1295, 83, 60457, 12447, 29479, 34166, 136, 1639, 39933, 3501...

[ 0.1033935546875, 0.118408203125, 0.04180908203125, 0.177490234375, 0.2158203125, 0.283203125, 0.1500244140625, 0.068603515625, 0.2152099609375, 0.1903076171875, 0.13232421875, 0.2149658203125, 0.2060546875, 0.1204833984375, 0.05572509765625, 0.0699462890625, 0.1531982421875, 0.1225...

embed

10427217_c0

10427217

haskell

0

Title: Haskell records, cleaner approach? Problem title: Haskell records, cleaner approach? Tags: record, haskell Problem: Haskell records, cleaner approach? I've read about some of the issues with Haskell records, in particular, the fact that two elements in the same module can not have the same name. I understand you...

Haskell records, cleaner approach? Haskell records, cleaner approach? record haskell Haskell HasX d1_x d2_x Haskell records, cleaner approach? I've read about some of the issues with Haskell records, in particular, the fact that two elements in the same module can not have the same name. I understand you can work aroun...

[ -0.00469970703125, 0.00384521484375, 0.0103759765625, -0.0013580322265625, 0.00384521484375, 0.0185546875, -0.0068359375, 0.0011444091796875, 0.0106201171875, -0.0240478515625, -0.009521484375, 0.004180908203125, 0.0106201171875, -0.006561279296875, -0.00830078125, -0.01416015625, 0....

[ 20625, 142508, 115923, 46622, 56, 51515, 17164, 1556, 1542, 104, 418, 304, 425, 37348, 6626, 80854, 5701, 88996, 831, 959, 9351, 4488, 10932, 84797, 73243, 4734, 14602, 62163, 5423, 1286, 18151, 18507, 136, 110527, 21635, 5256, 1884, 34759, ...

[ 0.16748046875, 0.22119140625, 0.2498779296875, 0.2352294921875, 0.140869140625, 0.1756591796875, 0.20068359375, 0.1353759765625, 0.10760498046875, 0.0394287109375, 0.0048828125, 0.029327392578125, 0.015655517578125, 0.093994140625, 0.1326904296875, 0.186767578125, 0.130859375, 0.20...

embed

13757883_c1

13757883

haskell

1

. Is there some way of saying something like this? The alternatives I can see are explicitly giving the full type: m :: Maybe (Char, ((String, String), String, [String], String), String) m = return ('I', (("don't", "really"), "care", ["what", "this"], "type"), "is") Or giving a type signature to a part of the expressi...

[ -0.0106201171875, 0.0081787109375, 0.0211181640625, -0.00130462646484375, 0.021484375, -0.0030975341796875, -0.0003833770751953125, -0.01611328125, -0.002960205078125, -0.016845703125, 0.006683349609375, -0.01177978515625, -0.0033721923828125, 0.00860595703125, 0, -0.0079345703125, -...

[ 5, 2685, 3060, 3917, 111, 54433, 9844, 1884, 903, 30700, 831, 1957, 143726, 68772, 4393, 10644, 347, 1984, 83425, 84068, 71713, 23351, 2203, 30646, 568, 4445, 18, 107, 25958, 8804, 124409, 100231, 50986, 164, 138256, 2831, 125195, 21543, 15...

[ 0.0268096923828125, 0.01971435546875, 0.030181884765625, 0.1112060546875, 0.00201416015625, 0.18017578125, 0.10357666015625, 0.13916015625, 0.139404296875, 0.1597900390625, 0.11962890625, 0.03558349609375, 0.12109375, 0.1151123046875, 0.095458984375, 0.2220458984375, 0.149658203125, ...

embed

52591336_c0

52591336

haskell

0

Title: Can I escape the `IO` in `catch` Problem title: Can I escape the `IO` in `catch` Tags: haskell Problem: Can I escape the `IO` in `catch` Here's a type-puzzle for you. So we have catch :: Exception e => IO a -> (e -> IO a) -> IO a Is it possible for me to safely escape IO in the handler. I'm interested in a funct...

Can I escape the `IO` in `catch` Can I escape the `IO` in `catch` haskell MonadError Can Exception MonadIO Can I escape the `IO` in `catch` Here's a type-puzzle for you. So we have Is it possible for me to safely escape IO in the handler. I'm interested in a function with a signature similar to the following: Is this s...

[ -0.0205078125, 0.022216796875, 0.005401611328125, 0.004058837890625, 0.014892578125, -0.00750732421875, -0.0098876953125, -0.0152587890625, 0.0002231597900390625, -0.0123291015625, -0.005279541015625, -0.046875, 0.003753662109375, -0.0007781982421875, 0.01385498046875, 0.00376892089843...

[ 4171, 87, 144281, 70, 17780, 23, 4460, 206, 1556, 142508, 60331, 71, 18468, 31611, 5443, 63928, 10644, 1766, 13894, 133, 765, 2071, 442, 7722, 100, 163, 47, 46002, 35863, 60892, 32354, 138256, 21373, 25632, 903, 82091, 16487, 44691, 43701, ...

[ 0.127685546875, 0.07232666015625, 0.26416015625, 0.0762939453125, 0.26220703125, 0.065673828125, 0.1875, 0.19091796875, 0.10125732421875, 0.230712890625, 0.16845703125, 0.1341552734375, 0.0953369140625, 0.035186767578125, 0.09808349609375, 0.211181640625, 0.0682373046875, 0.0063781...

embed

69489703_c0

69489703

haskell

0

Title: Function to increase count of a tuple in Haskell Problem title: Function to increase count of a tuple in Haskell Tags: tuples, haskell Problem: Function to increase count of a tuple in Haskell So I have a function that takes a character and a list of tuples [tuple is a pair containing a character and an integer]...

Function to increase count of a tuple in Haskell Function to increase count of a tuple in Haskell tuples haskell Haskell Function to increase count of a tuple in Haskell So I have a function that takes a character and a list of tuples [tuple is a pair containing a character and an integer]. If the character matches the...

[ 0.00921630859375, 0.01055908203125, -0.000949859619140625, 0.0025634765625, 0.017333984375, -0.0034332275390625, -0.0252685546875, -0.00494384765625, 0.019775390625, 0.007415771484375, 0.0072021484375, -0.0107421875, 0.0014495849609375, 0.02978515625, 0, -0.00167083740234375, 0.01116...

[ 28670, 10763, 51312, 54529, 111, 10, 370, 8705, 20625, 142508, 47, 23, 99726, 1556, 32354, 51776, 62816, 136, 5303, 458, 80836, 70541, 892, 1505, 14858, 42518, 14012, 158661, 390, 1632, 28412, 237, 83, 151117, 11180, 19388, 18151, 21658, 24...

[ 0.14501953125, 0.0207061767578125, 0.2152099609375, 0.1986083984375, 0.0386962890625, 0.04022216796875, 0.163330078125, 0.227294921875, 0.151611328125, 0.2222900390625, 0.011871337890625, 0.0396728515625, 0.2127685546875, 0.1285400390625, 0.158447265625, 0.046112060546875, 0.13110351...

embed

3012064_c0

3012064

haskell

0

Title: Right rotate of tree in Haskell: how is it work? Problem title: Right rotate of tree in Haskell: how is it work? Tags: haskell, syntax, binary-tree, functional-programming Problem: Right rotate of tree in Haskell: how is it work? I don't know haskell syntax, but I know some FP concepts (like algebraic data types...

Right rotate of tree in Haskell: how is it work? Right rotate of tree in Haskell: how is it work? haskell syntax binary-tree functional-programming Right Haskell Tree Leaf Fork Right rotate of tree in Haskell: how is it work? I don't know haskell syntax, but I know some FP concepts (like algebraic data types, pattern m...

[ 0.02685546875, 0.005401611328125, 0.01507568359375, -0.01495361328125, 0.009765625, 0.00543212890625, -0.0301513671875, -0.015869140625, 0.0022735595703125, -0.016357421875, 0.00142669677734375, 0.00130462646484375, -0.005645751953125, 0.01055908203125, 0.002593994140625, 0.01080322265...

[ 90911, 47014, 67, 53201, 20625, 142508, 3642, 83, 442, 4488, 111, 23, 1556, 6002, 86531, 2394, 62600, 123309, 101344, 636, 2407, 1326, 92, 51006, 23755, 429, 2844, 2053, 52895, 103510, 14858, 77546, 80596, 32354, 73342, 903, 18151, 29459, 2...

[ 0.2103271484375, 0.1861572265625, 0.1224365234375, 0.227783203125, 0.1282958984375, 0.2379150390625, 0.10601806640625, 0.045684814453125, 0.04901123046875, 0.166259765625, 0.0242462158203125, 0.038177490234375, 0.114013671875, 0.048553466796875, 0.1102294921875, 0.0289764404296875, 0...

embed

27289476_c0

27289476

haskell

0

Title: Prime sieve results in (me going to) stack overflow Problem title: Prime sieve results in (me going to) stack overflow Tags: performance, haskell, primes, sieve-algorithm, time-complexity Problem: Prime sieve results in (me going to) stack overflow For project euler i was looking for a way to implement the sieve...

Prime sieve results in (me going to) stack overflow Prime sieve results in (me going to) stack overflow performance haskell primes sieve-algorithm time-complexity Prime x:xs Prime sieve results in (me going to) stack overflow For project euler i was looking for a way to implement the sieve of Eratosthenes because i exp...

[ -0.01470947265625, 0.03271484375, 0.0089111328125, 0.002777099609375, -0.0029754638671875, -0.0150146484375, 0.0113525390625, -0.0120849609375, 0.015380859375, -0.029296875, 0.040771484375, 0.00579833984375, 0.02392578125, 0.0022125244140625, 0.015869140625, 0.004547119140625, -0.009...

[ 56195, 78, 3134, 50339, 282, 7730, 47, 177261, 645, 118664, 23718, 1556, 142508, 20809, 100628, 2783, 1733, 44974, 1022, 425, 23, 13452, 1175, 603, 3917, 29479, 14825, 1952, 2347, 1444, 84751, 4271, 56, 208124, 1257, 32354, 43240, 1284, 596...

[ 0.186767578125, 0.16259765625, 0.1944580078125, 0.153076171875, 0.1131591796875, 0.1075439453125, 0.1171875, 0.15380859375, 0.09857177734375, 0.23779296875, 0.1690673828125, 0.057647705078125, 0.1988525390625, 0.1346435546875, 0.0491943359375, 0.06280517578125, 0.0494384765625, 0.0...

embed

8519964_c0

8519964

haskell

0

Title: How does GHCi pick names for type variables? Problem title: How does GHCi pick names for type variables? Tags: ghc, ghci, haskell, type-inference, type-variables Problem: How does GHCi pick names for type variables? When using the interactive GHC interpreter, it's possible to ask for the inferred type of an expr...

How does GHCi pick names for type variables? How does GHCi pick names for type variables? ghc ghci haskell type-inference type-variables How GHCi Prelude x:xs How does GHCi pick names for type variables? When using the interactive GHC interpreter, it's possible to ask for the inferred type of an expression: It seems th...

[ 0.01416015625, 0.0013275146484375, 0.01153564453125, 0.0230712890625, -0.015869140625, -0.0023651123046875, -0.0113525390625, 0.00946044921875, 0.00921630859375, 0.007537841796875, 0.007110595703125, -0.022216796875, 0.00341796875, 0.01373291015625, 0.006561279296875, 0.00933837890625,...

[ 11249, 14602, 527, 73265, 14, 39580, 123055, 100, 10644, 77336, 31380, 238, 318, 1556, 142508, 73, 69988, 21690, 19736, 1914, 822, 112, 1022, 425, 7, 212398, 29481, 56, 7722, 26458, 53498, 2822, 125195, 37202, 51776, 1295, 138256, 22288, 61...

[ 0.07568359375, 0.0165557861328125, 0.0950927734375, 0.2208251953125, 0.2294921875, 0.1844482421875, 0.2037353515625, 0.0701904296875, 0.2403564453125, 0.2666015625, 0.110107421875, 0.07574462890625, 0.1383056640625, 0.09228515625, 0.1859130859375, 0.01080322265625, 0.1103515625, 0....

embed

3144722_c1

3144722

haskell

1

istribution/Client/BuildReports/Types.o ) [ 2 of 40] Compiling Distribution.Client.Utils ( Distribution/Client/Utils.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Utils.o ) ... two warnings about not used addPackageExcludeConstraint and response ... [39 of 40] Compiling Distribution.Client.Install ( Distribution/C...

[ 0.010498046875, 0.00115966796875, 0.0235595703125, -0.007659912109375, -0.0164794921875, -0.0203857421875, -0.01251220703125, 0.003570556640625, 0.0079345703125, 0.02490234375, -0.0025482177734375, -0.01116943359375, 0.00732421875, 0.01068115234375, -0.001678466796875, -0.0075073242187...

[ 83, 179236, 150, 2517, 121137, 56829, 196707, 31, 1112, 15612, 49725, 75571, 1363, 106742, 7870, 127, 271, 177149, 408, 3571, 2676, 6626, 1631, 959, 11814, 15190, 205956, 4588, 29786, 2816, 57553, 9323, 92621, 2839, 12321, 168793, 12779, 45, ...

[ 0.038543701171875, 0.1583251953125, 0.1002197265625, 0.0933837890625, 0.09521484375, 0.1529541015625, 0.1478271484375, 0.1114501953125, 0.0943603515625, 0.09033203125, 0.0972900390625, 0.18310546875, 0.00018310546875, 0.1201171875, 0.1048583984375, 0.04925537109375, 0.0426025390625, ...

embed

14180111_c0

14180111

haskell

0

Title: Chaining Haskell Functions in data types Problem title: Chaining Haskell Functions in data types Tags: ghc, haskell Problem: Chaining Haskell Functions in data types Lets say I have the following: data FuncAndValue v res = FuncAndValue (v -> res) v chain :: (res -> new_res) -> FuncAndValue v res -> FuncAndValue ...

Chaining Haskell Functions in data types Chaining Haskell Functions in data types ghc haskell Chaining Haskell Functions FuncAndValue new_res new_f old_f Chaining Haskell Functions in data types Lets say I have the following: Is GHC likely to be able to combine functions new_f and old_f into a single function through i...

[ -0.00555419921875, 0.00034332275390625, -0.0003223419189453125, 0.01495361328125, 0.013427734375, 0.00946044921875, -0.01953125, -0.01507568359375, 0.0137939453125, -0.0245361328125, -0.0126953125, -0.00506591796875, 0.01220703125, -0.0013427734375, -0.001983642578125, 0.00711059570312...

[ 4841, 14653, 20625, 142508, 28670, 10763, 2053, 52895, 31380, 238, 1556, 37839, 856, 50770, 3525, 2109, 420, 10332, 527, 73265, 47041, 19048, 70163, 32354, 454, 136, 11001, 8305, 23, 150, 592, 3082, 214, 109954, 173702, 18, 87235, 5256, 188...

[ 0.1748046875, 0.1312255859375, 0.1610107421875, 0.272216796875, 0.1751708984375, 0.05975341796875, 0.1279296875, 0.2578125, 0.1236572265625, 0.0958251953125, 0.161865234375, 0.080322265625, 0.079833984375, 0.110107421875, 0.117431640625, 0.1055908203125, 0.1702880859375, 0.14147949...

embed

3875369_c1

3875369

haskell

1

any way to restructure the function so that it is tail-recursive (or at least doesn't overflow the stack)? Thanks in advance, and sorry for the massive code listing. playAll' :: (Num a) => UnscoredPlayer -> Bool -> String -> [String] -> (a,a,a) -> (a,a,a) playAll' player playerTurn board boards (w,ls,t)= if won == sel...

[ -0.00107574462890625, 0.014404296875, 0.01806640625, 0.0166015625, 0.0167236328125, -0.001495361328125, -0.0191650390625, -0.0201416015625, 0.0164794921875, 0.015869140625, 0.01226806640625, 0.0194091796875, 0.01416015625, 0.00726318359375, -0.00616455078125, -0.018310546875, -0.0183...

[ 2499, 3917, 47, 456, 137656, 70, 32354, 221, 450, 83, 46741, 107, 48650, 5844, 19713, 22027, 18, 645, 118664, 177261, 59090, 106750, 18151, 5303, 5, 11301, 43512, 25, 1984, 839, 316, 10, 44357, 992, 12064, 2822, 142581, 33079, 2460, 929, ...

[ 0.0277862548828125, 0.08111572265625, 0.045318603515625, 0.135009765625, 0.2841796875, 0.0328369140625, 0.2275390625, 0.043853759765625, 0.0157470703125, 0.03912353515625, 0.265869140625, 0.058624267578125, 0.18701171875, 0.10791015625, 0.030731201171875, 0.01849365234375, 0.03536987...

embed

28547428_c0

28547428

haskell

0

Title: Creating a csv file in haskell Problem title: Creating a csv file in haskell Tags: haskell, csv Problem: Creating a csv file in haskell I suspect this a bit of a noobie question... So I have a list myList that I would like to write to a csv file, using the cassava library: import qualified Data.ByteString.Lazy a...

Creating a csv file in haskell Creating a csv file in haskell haskell csv qualified Data.Csv Creating Data.ByteString.Lazy Data.Vector BL.writeFile V.fromList ToRecord Vector ByteString Couldn V.Vector Creating a csv file in haskell I suspect this a bit of a noobie question... So I have a list myList that I would like ...

[ -0.001678466796875, 0.003814697265625, 0.001922607421875, 0.020751953125, 0.00128173828125, 0.007049560546875, -0.000644683837890625, -0.00384521484375, 0.005279541015625, -0.003021240234375, -0.01263427734375, -0.03173828125, 0.016357421875, 0.0152587890625, -0.0284423828125, -0.01574...

[ 56781, 20763, 334, 11435, 1556, 142508, 23, 217225, 11809, 441, 67756, 75358, 67, 71713, 214, 2729, 3285, 26455, 18770, 68170, 18781, 174350, 310, 161063, 154663, 717, 32271, 2609, 3311, 191147, 19, 92610, 4785, 9014, 5303, 759, 1884, 33022, ...

[ 0.1405029296875, 0.1422119140625, 0.248046875, 0.1591796875, 0.143310546875, 0.2442626953125, 0.03607177734375, 0.166748046875, 0.07037353515625, 0.01666259765625, 0.2225341796875, 0.06500244140625, 0.1065673828125, 0.163330078125, 0.054412841796875, 0.0635986328125, 0.1448974609375,...

embed

43253228_c0

43253228

haskell

0

Title: GLUT Error in Haskell Program Problem title: GLUT Error in Haskell Program Tags: freeglut, glut, opengl, haskell Problem: GLUT Error in Haskell Program I'm using OpenGL with Haskell. I tried a sample program, it compiled successfully using ghc Compiler but when I run it, I get this error user error (unknown GLUT...

GLUT Error in Haskell Program GLUT Error in Haskell Program freeglut glut opengl haskell Graphics.Rendering.OpenGL Graphics.UI.GLUT GLUT Error Haskell Program _progName _args _window Hello World ColorBuffer GLUT Error in Haskell Program I'm using OpenGL with Haskell. I tried a sample program, it compiled successfully u...

[ 0.00860595703125, 0.0191650390625, -0.0026702880859375, -0.016845703125, 0.006927490234375, 0.003631591796875, -0.0022430419921875, -0.020263671875, -0.00604248046875, -0.0078125, 0.0025177001953125, -0.04248046875, 0.00860595703125, -0.006072998046875, -0.00201416015625, 0.00018978118...

[ 527, 143662, 212059, 23, 20625, 142508, 7663, 4092, 159632, 167994, 9803, 11016, 1556, 189682, 111747, 103264, 78703, 33457, 724, 75620, 163612, 61477, 9494, 24293, 35378, 6661, 51193, 7235, 18234, 13527, 678, 37842, 121413, 1528, 5974, 65771, ...

[ 0.11962890625, 0.301513671875, 0.200927734375, 0.0243682861328125, 0.14453125, 0.255859375, 0.1859130859375, 0.079833984375, 0.277099609375, 0.265869140625, 0.0849609375, 0.1544189453125, 0.113037109375, 0.1358642578125, 0.06390380859375, 0.067138671875, 0.1964111328125, 0.02790832...

embed

31735944_c1

31735944

haskell

1

m) (StateT st' m) st st') arising from a use of `zoom' from the context (Zoomed (Engine st m) ~ Zoomed (Engine st' m), mtl-2.1.3.1:Control.Monad.State.Class.MonadState st (Engine st m), mtl-2.1.3.1:Control.Monad.State.Class.MonadState st' (Engine st' m), Monad m) bound by the instance declaration at Test.hs:22:10-62 I...

[ -0.01263427734375, -0.006256103515625, 0.002105712890625, -0.00098419189453125, -0.0072021484375, 0.0032501220703125, -0.022216796875, -0.0263671875, -0.0146484375, 0.00750732421875, 0.002044677734375, 0.0269775390625, 0.003387451171875, 0.000514984130859375, 0.00124359130859375, -0.00...

[ 347, 16, 135206, 13, 618, 6138, 25, 187, 72219, 1295, 4527, 111, 1158, 306, 43701, 60551, 297, 91384, 1212, 97170, 141, 68107, 97109, 175904, 5, 46674, 712, 140803, 60331, 71, 99091, 110527, 21635, 1363, 8647, 127, 24070, 15110, 10837, 36...

[ 0.1678466796875, 0.0838623046875, 0.149169921875, 0.0740966796875, 0.1539306640625, 0.1519775390625, 0.1343994140625, 0.1253662109375, 0.0743408203125, 0.07208251953125, 0.1348876953125, 0.00482177734375, 0.18359375, 0.218505859375, 0.179443359375, 0.1668701171875, 0.1414794921875, ...

embed

55380861_c0

55380861

haskell

0

Title: default values for PersistList on SQLite - Yesod Problem title: default values for PersistList on SQLite - Yesod Tags: yesod, persistent, haskell Problem: default values for PersistList on SQLite - Yesod I would like to add a PersistList value into a user entity with a default value. My model file looks like thi...

default values for PersistList on SQLite - Yesod default values for PersistList on SQLite - Yesod yesod persistent haskell PersistList SQLite Yesod Models.hs User Text Maybe UniqueUser Privileges PrvDemoOne Typeable PrvDemoTwo Show Read default values for PersistList on SQLite - Yesod I would like to add a PersistList ...

[ 0.00482177734375, 0.0216064453125, -0.001953125, 0.0059814453125, -0.01373291015625, 0.0128173828125, -0.00927734375, -0.0216064453125, 0.01202392578125, 0.009521484375, 0.00555419921875, -0.000637054443359375, 0.00439453125, 0.021728515625, -0.03076171875, -0.004852294921875, 0.0186...

[ 114977, 142424, 57309, 271, 154663, 98, 80866, 1486, 32635, 2199, 2422, 23722, 70560, 1556, 142508, 13293, 127, 53400, 24129, 83425, 11789, 1062, 2189, 241114, 15853, 334, 168678, 62068, 60457, 2886, 3613, 17367, 4764, 1884, 15190, 34292, 38937...

[ 0.281005859375, 0.21533203125, 0.1986083984375, 0.1612548828125, 0.259765625, 0.02288818359375, 0.151123046875, 0.2093505859375, 0.1343994140625, 0.2130126953125, 0.0751953125, 0.1553955078125, 0.2135009765625, 0.07598876953125, 0.1815185546875, 0.185302734375, 0.0830078125, 0.0952...

embed

55434665_c0

55434665

haskell

0

Title: Normalizing TypeNats Inequalities Problem title: Normalizing TypeNats Inequalities Tags: types, data-kinds, haskell Problem: Normalizing TypeNats Inequalities I have two functions both with a Nat (from TypeNats) kind that both have a comparison type operator <= . The constraint 2 <= n for function b contains the...

Normalizing TypeNats Inequalities Normalizing TypeNats Inequalities types data-kinds haskell GHC.TypeNats Data.Proxy a the b Normalizing TypeNats Inequalities LANGUAGE KindSignatures TypeOperators ScopedTypeVariables DataKinds TypeFamilies Nat Proxy Could Example.hs:9:1-48 Relevant Example.hs:10:1 Normalizing TypeNats ...

[ -0.002349853515625, -0.0135498046875, 0.003204345703125, 0.0169677734375, 0.00653076171875, 0.0069580078125, -0.0283203125, 0.00494384765625, -0.00482177734375, 0.0177001953125, 0.0033416748046875, -0.01312255859375, 0.0174560546875, 0.0218505859375, 0.01165771484375, -0.00057983398437...

[ 28723, 84382, 60457, 4645, 933, 360, 13, 71723, 52895, 2053, 68347, 1556, 142508, 527, 73265, 196707, 11809, 10752, 50878, 10, 70, 876, 98064, 27435, 218723, 156823, 182783, 81827, 7250, 68875, 1250, 191147, 89536, 127, 1126, 19721, 9285, 151...

[ 0.1846923828125, 0.117431640625, 0.1881103515625, 0.1669921875, 0.06488037109375, 0.0755615234375, 0.083984375, 0.140869140625, 0.173095703125, 0.057342529296875, 0.1136474609375, 0.08917236328125, 0.1875, 0.047515869140625, 0.1265869140625, 0.1611328125, 0.044097900390625, 0.09637...

embed

59461779_c0

59461779

haskell

0

Title: Unexpected result from combinatory recursive function Problem title: Unexpected result from combinatory recursive function Tags: haskell, recursion Problem: Unexpected result from combinatory recursive function I have a sequence of natural numbers at specific power ( n ) until an upper limit ( x ) starting from ...

Unexpected result from combinatory recursive function Unexpected result from combinatory recursive function haskell recursion combinatory Unexpected x:xs CORRECT WRONG Unexpected result from combinatory recursive function I have a sequence of natural numbers at specific power ( n ) until an upper limit ( x ) starting f...

[ -0.022216796875, 0.0184326171875, 0.004730224609375, -0.0011138916015625, 0.004486083984375, 0.002471923828125, 0.003570556640625, 0.01055908203125, 0.01708984375, -0.013671875, 0.0028228759765625, -0.00244140625, 0.02099609375, 0.0196533203125, -0.002777099609375, -0.00035858154296875...

[ 992, 83613, 13, 89829, 16750, 1295, 22321, 31667, 195625, 5844, 32354, 1556, 142508, 1830, 1022, 12, 425, 70555, 1052, 115055, 765, 40, 944, 3956, 6083, 101935, 99, 29458, 14537, 653, 24189, 1407, 56, 17475, 72134, 615, 116, 190, 201, 483...

[ 0.04425048828125, 0.1014404296875, 0.0950927734375, 0.05108642578125, 0.1461181640625, 0.0606689453125, 0.215576171875, 0.13720703125, 0.21142578125, 0.07464599609375, 0.1434326171875, 0.1129150390625, 0.206298828125, 0.006591796875, 0.0780029296875, 0.047637939453125, 0.07861328125,...

embed

60068693_c0

60068693

haskell

0

Title: Understanding output of runWriter (return 3 :: Writer String Int) Problem title: Understanding output of runWriter (return 3 :: Writer String Int) Tags: haskell Problem: Understanding output of runWriter (return 3 :: Writer String Int) I'm reading http://learnyouahaskell.com/for-a-few-monads-more and there's thi...

Understanding output of runWriter (return 3 :: Writer String Int) Understanding output of runWriter (return 3 :: Writer String Int) haskell Understanding Writer Monoid Monad Understanding output of runWriter (return 3 :: Writer String Int) I'm reading http://learnyouahaskell.com/for-a-few-monads-more and there's this e...

[ -0.01495361328125, 0.006134033203125, 0.002716064453125, 0.00579833984375, 0.0035858154296875, 0.007049560546875, 0.0021514892578125, -0.030517578125, 0.000759124755859375, 0.019287109375, 0.00052642822265625, 0.0096435546875, 0.00830078125, 0.01263427734375, 0.00616455078125, -0.01611...

[ 9626, 144057, 140992, 11675, 1456, 2783, 56, 65395, 138, 23351, 360, 18, 1556, 142508, 601, 77879, 532, 60331, 71, 214, 16454, 7232, 7, 87039, 6468, 27781, 219836, 30646, 158, 9297, 10644, 5608, 8337, 363, 757, 3884, 163, 2676, 939, 186, ...

[ 0.04296875, 0.032135009765625, 0.212646484375, 0.114501953125, 0.0665283203125, 0.185302734375, 0.1627197265625, 0.1243896484375, 0.1610107421875, 0.1287841796875, 0.10577392578125, 0.09649658203125, 0.09869384765625, 0.18701171875, 0.02093505859375, 0.09649658203125, 0.0702514648437...

embed

24597954_c1

24597954

haskell

1

... Preprocessing executable 'jmacro-snap-example' for jmacro-snap-example-0.1.0.0... [1 of 1] Compiling Main ( Main.hs, dist/build/jmacro-snap-example/jmacro-snap-example-tmp/Main.o ) Main.hs:22:38: parse error on input `{' So it seems like the ghc's having an issue with the jmacro quasi-quoter expression. I'm not sur...

[ -0.0074462890625, 0.01092529296875, -0.01458740234375, -0.00860595703125, -0.00677490234375, 0.04052734375, -0.006134033203125, -0.000690460205078125, -0.006072998046875, -0.028076171875, -0.0172119140625, -0.016845703125, -0.00933837890625, -0.024169921875, 0.006988525390625, 0.017822...

[ 1914, 63923, 71924, 2886, 170, 192, 15322, 10957, 3355, 11, 33209, 1647, 102014, 99929, 15612, 49725, 12321, 127, 271, 177149, 2676, 168793, 31, 24070, 34179, 366, 184, 18499, 98, 107730, 9473, 24854, 37202, 31380, 238, 31089, 12404, 9, 415...

[ 0.1268310546875, 0.181640625, 0.1339111328125, 0.0933837890625, 0.0963134765625, 0.121337890625, 0.229248046875, 0.224853515625, 0.139404296875, 0.1510009765625, 0.1334228515625, 0.1236572265625, 0.1744384765625, 0.1865234375, 0.1004638671875, 0.13818359375, 0.1285400390625, 0.0526...

embed

48324939_c1

48324939

haskell

1

Post I need a data structure like this one in Servant data BlogPostRequest = BlogPostRequest { title :: String, published :: DateTime, public :: Bool, category_ids :: Maybe [Int], tag_ids :: Maybe [Int] } The endpoint will take all the fields related to the Blog model and store it as a new Blog instance. It will then ...

[ 0.0038909912109375, 0.0146484375, 0.00897216796875, -0.0050048828125, -0.00628662109375, 0.02783203125, 0.00003123283386230469, -0.0045166015625, 0.0145263671875, -0.03564453125, 0.005706787109375, 0.0028228759765625, -0.020751953125, 0.0087890625, -0.006103515625, 0.0019989013671875, ...

[ 2795, 3871, 2053, 45646, 1884, 5406, 30624, 5061, 49411, 4332, 75616, 44759, 23351, 91376, 70059, 3835, 2460, 929, 95487, 30185, 83425, 7909, 3564, 38496, 5646, 756, 44457, 62548, 3299, 4343, 3525, 110527, 91582, 13379, 116822, 23180, 50509, ...

[ 0.1217041015625, 0.090576171875, 0.1558837890625, 0.214599609375, 0.04705810546875, 0.1444091796875, 0.2294921875, 0.1773681640625, 0.1148681640625, 0.02587890625, 0.1434326171875, 0.088134765625, 0.091796875, 0.0950927734375, 0.1219482421875, 0.09619140625, 0.02197265625, 0.151367...

embed

793935_c0

793935

haskell

0

Title: Haskell: Replacing element with a given key in an association list Problem title: Haskell: Replacing element with a given key in an association list Tags: list, haskell Problem: Haskell: Replacing element with a given key in an association list I've got to make a function which is given a key (as a String ), a v...

Haskell: Replacing element with a given key in an association list Haskell: Replacing element with a given key in an association list list haskell Haskell Replacing Maybe Haskell: Replacing element with a given key in an association list I've got to make a function which is given a key (as a String ), a value (as a Str...

[ -0.0196533203125, 0.0179443359375, -0.0079345703125, -0.0018310546875, 0.003875732421875, 0.00506591796875, 0.000972747802734375, -0.00396728515625, 0.01611328125, 0.030029296875, 0.01519775390625, 0.0035400390625, -0.004852294921875, -0.02783203125, 0.007354736328125, 0.00588989257812...

[ 20625, 142508, 853, 133266, 12830, 678, 34475, 22799, 125413, 5303, 1556, 83425, 23, 3249, 32354, 162, 23351, 34292, 136, 142424, 71713, 131148, 15190, 27494, 80836, 3564, 21771, 13379, 137272, 154109, 10332, 37842, 6713, 2037, 98, 9077, 140992...

[ 0.1021728515625, 0.21923828125, 0.0723876953125, 0.165283203125, 0.1558837890625, 0.0968017578125, 0.0869140625, 0.1968994140625, 0.1810302734375, 0.171630859375, 0.069091796875, 0.2437744140625, 0.004608154296875, 0.021697998046875, 0.1785888671875, 0.053955078125, 0.1290283203125, ...

embed

68892302_c0

68892302

haskell

0

Title: Is it possible to write an Alternative instance for Identity a if there's a Monoid for a? Problem title: Is it possible to write an Alternative instance for Identity a if there's a Monoid for a? Tags: alternative-functor, haskell Problem: Is it possible to write an Alternative instance for Identity a i...

Is it possible to write an Alternative instance for Identity a if there's a Monoid for a? Is it possible to write an Alternative instance for Identity a if there's a Monoid for a? alternative-functor haskell Alternative Identity Monoid Is it possible to write an Alternative instance for Identity a if there's ...

[ -0.01409912109375, 0.00830078125, 0.0203857421875, 0.027099609375, 0.0128173828125, 0.016357421875, -0.004974365234375, -0.006072998046875, 0.00107574462890625, 0.01202392578125, -0.00933837890625, 0.0220947265625, 0.006866455078125, 0.00958251953125, -0.0017852783203125, -0.0034332275...

[ 2071, 442, 7722, 33022, 142, 103905, 110527, 100, 71257, 2481, 10, 2174, 2685, 3768, 77879, 532, 47, 30700, 16498, 18770, 1556, 142508, 1884, 3525, 50986, 182355, 191, 7941, 208124, 69201, 52895, 23468, 14192, 9969, 34759, 3444, 61924, 4734, ...

[ 0.04095458984375, 0.0231170654296875, 0.176513671875, 0.1951904296875, 0.060882568359375, 0.2305908203125, 0.259765625, 0.10247802734375, 0.1925048828125, 0.1380615234375, 0.195068359375, 0.09521484375, 0.045928955078125, 0.0333251953125, 0.220703125, 0.2227783203125, 0.0246276855468...

embed