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
40248901_c0	40248901	haskell	0	Title: Can't open Odt file generated from Pandoc Problem title: Can't open Odt file generated from Pandoc Tags: pandoc, libreoffice, haskell Problem: Can't open Odt file generated from Pandoc I tried to generated a basic odt file with a mathematic formula with the Haskell pandoc library to verify if the probl...	Can't open Odt file generated from Pandoc Can't open Odt file generated from Pandoc pandoc libreoffice haskell Pandoc Text.Pandoc Data.Map qualified Can Odt Data.ByteString.Lazy Data.Set Set WriterOptions Nothing B.writeFile document.odt Meta Para Str Math Plain InlineMath A_e HorizontalRule Set.fromList Ext_...	[ -0.002227783203125, 0.00225830078125, -0.01416015625, 0.0031890869140625, -0.0042724609375, -0.0162353515625, 0.0031280517578125, -0.01611328125, -0.00579833984375, -0.006591796875, 0.0133056640625, -0.0037689208984375, 0.01336669921875, -0.01531982421875, 0.00518798828125, -0.00952148...	[ 4171, 3768, 18, 9803, 2365, 11435, 139392, 1295, 4378, 29713, 2652, 11506, 65024, 1556, 142508, 24129, 55956, 11809, 166179, 217225, 75358, 71713, 2729, 3285, 294, 126, 19943, 2783, 39029, 182747, 335, 434, 18781, 174350, 12937, 2199, 36939, ...	[ 0.05389404296875, 0.0631103515625, 0.1806640625, 0.1988525390625, 0.2012939453125, 0.1864013671875, 0.1494140625, 0.05328369140625, 0.1171875, 0.1944580078125, 0.1004638671875, 0.1541748046875, 0.2047119140625, 0.06231689453125, 0.187744140625, 0.04937744140625, 0.05023193359375, 0...	embed
2848105_c1	2848105	haskell	1	.0,10.0), textLabel = (), foregroundLabel = 0x000000, backgroundLabel = 0xFFFFFF}->[((1,3),3)] 1:NodeLabel {typeLabel = Terminator, sizeLabel = (30.0,10.0), textLabel = (), foregroundLabel = 0x000000, backgroundLabel = 0xFFFFFF}->[] 2:NodeLabel {typeLabel = HelpNode, sizeLabel = (0.0,0.0), textLabel = (), foregroundLab...	.0,10.0), textLabel = (), foregroundLabel = 0x000000, backgroundLabel = 0xFFFFFF}->[((1,3),3)] 1:NodeLabel {typeLabel = Terminator, sizeLabel = (30.0,10.0), textLabel = (), foregroundLabel = 0x000000, backgroundLabel = 0xFFFFFF}->[] 2:NodeLabel {typeLabel = HelpNode, sizeLabel = (0.0,0.0), textLabel = (), foregroundLab...	[ 0.005584716796875, 0.004608154296875, -0.007598876953125, 0.0184326171875, -0.003173828125, 0.015380859375, -0.024169921875, -0.01190185546875, 0.00537109375, 0.01092529296875, 0.00193023681640625, -0.0220947265625, -0.0172119140625, -0.0150146484375, -0.001983642578125, 0.011352539062...	[ 5, 2389, 963, 77495, 7986, 2729, 4063, 2203, 100, 13, 64330, 757, 197094, 76615, 30110, 103607, 41600, 21320, 13806, 5021, 112, 50986, 27366, 4597, 13267, 99929, 15573, 39527, 216969, 22408, 4263, 127, 166191, 206808, 29557, 27959, 2331, 1046...	[ 0.05340576171875, 0.11474609375, 0.1097412109375, 0.1162109375, 0.1646728515625, 0.142822265625, 0.27197265625, 0.0518798828125, 0.054534912109375, 0.047393798828125, 0.1671142578125, 0.0904541015625, 0.1641845703125, 0.161376953125, 0.0994873046875, 0.0224456787109375, 0.01043701171...	embed
29364056_c0	29364056	haskell	0	Title: How do I know who to blame for hackage inconsistencies Problem title: How do I know who to blame for hackage inconsistencies Tags: haskell, hackage, cabal, dependencies Problem: How do I know who to blame for hackage inconsistencies Trying to install criterion , I run into troubles with other packages that I rel...	How do I know who to blame for hackage inconsistencies How do I know who to blame for hackage inconsistencies haskell hackage cabal dependencies How Resolving Glob-0.7.5 abstract-deque-0.3 abstract-par-0.3.3 blaze-builder-0.4.0.1 cereal-0.4.1.1 erf-2.0.0.0 ieee754-0.7.6 hastache-0.6.1 monad-par-extras-0.3.3 parallel-3....	[ -0.003509521484375, 0.0096435546875, 0.01220703125, 0.01019287109375, 0.01397705078125, -0.00531005859375, -0.0107421875, -0.00311279296875, 0.0021820068359375, 0.022216796875, 0.00848388671875, -0.020751953125, -0.00811767578125, 0.00836181640625, 0.00872802734375, 0.0140380859375, ...	[ 11249, 87, 3714, 2750, 47, 9932, 282, 100, 85526, 4588, 23, 25553, 6892, 58732, 1556, 142508, 109524, 42548, 853, 132944, 214, 127129, 23320, 136563, 164789, 112, 944, 170179, 2500, 134693, 731, 177149, 56, 121254, 102014, 141233, 83783, 8682...	[ 0.0604248046875, 0.0210418701171875, 0.1641845703125, 0.152587890625, 0.080810546875, 0.2213134765625, 0.18359375, 0.12353515625, 0.2352294921875, 0.1705322265625, 0.1319580078125, 0.19775390625, 0.2427978515625, 0.05340576171875, 0.120361328125, 0.19580078125, 0.2041015625, 0.2083...	embed
16974868_c0	16974868	haskell	0	Title: A more succinct way to map functions onto fields of an algebraic datatype? Problem title: A more succinct way to map functions onto fields of an algebraic datatype? Tags: algebraic-data-types, haskell Problem: A more succinct way to map functions onto fields of an algebraic datatype? I have a datatype with lots ...	A more succinct way to map functions onto fields of an algebraic datatype? A more succinct way to map functions onto fields of an algebraic datatype? algebraic-data-types haskell ManyFields Note ManyField mapf1 Repeat mapf2 mf1 mf2 A more succinct way to map functions onto fields of an algebraic datatype? I have a data...	[ 0.0013885498046875, 0.008056640625, -0.01019287109375, 0.0142822265625, -0.01031494140625, -0.006744384765625, 0.006591796875, -0.003997802734375, 0.0133056640625, -0.031494140625, -0.0091552734375, -0.01080322265625, -0.00168609619140625, 0.00811767578125, -0.00634765625, -0.023193359...	[ 1286, 42593, 6333, 3917, 22288, 32354, 98, 188, 44457, 144, 429, 2844, 2053, 50986, 15390, 1771, 10135, 1556, 142508, 52455, 6159, 19388, 18622, 420, 418, 33742, 13, 304, 71358, 15649, 12638, 71864, 29479, 33342, 4552, 120, 5670, 57840, 535...	[ 0.05499267578125, 0.0290374755859375, 0.078369140625, 0.038238525390625, 0.201904296875, 0.204345703125, 0.068359375, 0.1146240234375, 0.21240234375, 0.00994873046875, 0.063720703125, 0.1046142578125, 0.10791015625, 0.239013671875, 0.0501708984375, 0.03228759765625, 0.0699462890625, ...	embed
51623611_c0	51623611	haskell	0	Title: Unable to install or build ghc-mod or other packages with Stack Problem title: Unable to install or build ghc-mod or other packages with Stack Tags: archlinux, haskell-stack, haskell Problem: Unable to install or build ghc-mod or other packages with Stack I am trying to set up a development environment for Haske...	Unable to install or build ghc-mod or other packages with Stack Unable to install or build ghc-mod or other packages with Stack archlinux haskell-stack haskell Unable Stack Cabal-1.24.2.0 base-4.9.1.0 cabal-helper-0.7.3.0 djinn-ghc-0.0.2.3 extra-1.5.3 ghc-syb-utils-0.2.3.3 haskell-src-exts-1.19.1 hlint-2.0.15 monad-jou...	[ -0.0223388671875, 0.01507568359375, 0.021484375, -0.0024871826171875, -0.01080322265625, 0.00010585784912109375, -0.0277099609375, 0.0098876953125, 0.0089111328125, 0.018310546875, -0.00726318359375, -0.05419921875, 0.007110595703125, 0.00872802734375, 0.0091552734375, -0.0014419555664...	[ 992, 2886, 20600, 707, 45367, 31380, 238, 13415, 98169, 678, 6512, 2594, 187, 206, 2397, 6077, 1556, 142508, 590, 30438, 289, 20682, 73011, 3647, 156982, 102107, 109524, 73866, 134926, 107473, 2230, 9486, 4173, 23811, 1003, 19437, 3355, 2947,...	[ 0.043792724609375, 0.13134765625, 0.1798095703125, 0.031402587890625, 0.1759033203125, 0.1697998046875, 0.140380859375, 0.2005615234375, 0.1812744140625, 0.04248046875, 0.1727294921875, 0.1475830078125, 0.040191650390625, 0.02679443359375, 0.0439453125, 0.05908203125, 0.1273193359375...	embed
41764189_c0	41764189	haskell	0	Title: Pattern overlapping, why is it happening? Problem title: Pattern overlapping, why is it happening? Tags: pattern-matching, haskell Problem: Pattern overlapping, why is it happening? I have a file OptionList.hs, with a new datatype named OptionList. I Want to hide the EmptyOpt when an OptionList is showed: module...	Pattern overlapping, why is it happening? Pattern overlapping, why is it happening? pattern-matching haskell OptionList Pattern EmptyOpt Read Show todo.hs OptionList.hs:12:9 Warning Pattern overlapping, why is it happening? I have a file OptionList.hs, with a new datatype named OptionList. I Want to hide the EmptyOpt w...	[ 0.0042724609375, -0.007080078125, 0.006927490234375, 0.018310546875, -0.005615234375, -0.017333984375, -0.00726318359375, -0.017578125, 0.00909423828125, 0.01104736328125, -0.00982666015625, -0.035400390625, 0.0244140625, 0.01483154296875, 0.000629425048828125, -0.00064849853515625, ...	[ 9876, 22766, 645, 143, 26783, 15400, 83, 442, 123087, 103510, 98753, 214, 1556, 142508, 86769, 154663, 31678, 939, 39029, 18, 4764, 17367, 1973, 127, 20927, 1126, 5550, 592, 11435, 3525, 2053, 50986, 42335, 1274, 112, 168360, 5201, 9969, 34...	[ 0.165283203125, 0.169189453125, 0.1793212890625, 0.233154296875, 0.188232421875, 0.1495361328125, 0.066650390625, 0.04559326171875, 0.1204833984375, 0.20703125, 0.17236328125, 0.00347900390625, 0.1123046875, 0.1986083984375, 0.1734619140625, 0.156494140625, 0.1072998046875, 0.08349...	embed
13337937_c0	13337937	haskell	0	Title: Couldn't match expected type `Bool' with actual type `IO Bool' Problem title: Couldn't match expected type `Bool' with actual type `IO Bool' Tags: haskell Problem: Couldn't match expected type `Bool' with actual type `IO Bool' I'm trying to write a prime number generator and utilizi...	Couldn't match expected type `Bool' with actual type `IO Bool' Couldn't match expected type `Bool' with actual type `IO Bool' haskell Couldn Bool Integer primesTo100 Integral i-1 Num Ord Random y-1 snd.head.dropWhile Couldn't match expected type `Bool' with actual type `IO Bool' I'm trying...	[ -0.010498046875, 0.01153564453125, 0.0022430419921875, 0.005401611328125, 0.02197265625, 0.004974365234375, 0.00372314453125, -0.0294189453125, -0.0086669921875, -0.013916015625, 0.018798828125, 0.00439453125, 0.00860595703125, -0.0174560546875, 0.01483154296875, -0.005645751953125, ...	[ 191147, 3768, 18, 14858, 84751, 10644, 12647, 929, 678, 8561, 17780, 2460, 1556, 142508, 19, 44401, 20809, 7763, 3559, 204681, 17, 5759, 52782, 35379, 39643, 113, 2208, 31251, 138810, 31577, 33022, 14012, 145823, 102617, 12248, 7568, 26168, 1...	[ 0.08935546875, 0.097412109375, 0.04840087890625, 0.179443359375, 0.1602783203125, 0.1741943359375, 0.121337890625, 0.2353515625, 0.081298828125, 0.1331787109375, 0.2344970703125, 0.1309814453125, 0.1195068359375, 0.2099609375, 0.0015869140625, 0.1702880859375, 0.195556640625, 0.088...	embed
34426601_c0	34426601	haskell	0	Title: ambiguous def with record update syntax Problem title: ambiguous def with record update syntax Tags: haskell Problem: ambiguous def with record update syntax Example: data Foo a = Foo { fooId :: a , fooName :: String , fooCount :: Int } instance Default a => Default (Foo a) where def = Foo { fooId = def , fooNam...	ambiguous def with record update syntax ambiguous def with record update syntax haskell Foo Default Maybe SomethingReallyCrazy ambiguous def with record update syntax Example: I think I understand why it's ambigouous. That is not the question. Imagine: Instead I would like to write: Does it even matter how GHC infers t...	[ -0.00421142578125, -0.00689697265625, 0.0064697265625, -0.00124359130859375, 0.032958984375, -0.010986328125, -0.044921875, 0.008544921875, 0.01458740234375, 0.002655029296875, -0.00020122528076171875, -0.015869140625, 0.01458740234375, -0.0003490447998046875, 0.0115966796875, -0.01391...	[ 920, 12282, 10821, 8, 420, 678, 17164, 28350, 6002, 86531, 1556, 142508, 9572, 31, 262, 1021, 7136, 83425, 200905, 68996, 538, 5272, 89536, 5351, 28219, 15400, 20828, 34, 133196, 33022, 26866, 527, 73265, 53498, 10644, 191147, 186, 82419, 5...	[ 0.1363525390625, 0.1922607421875, 0.1263427734375, 0.141357421875, 0.1463623046875, 0.052581787109375, 0.1666259765625, 0.18310546875, 0.1051025390625, 0.095703125, 0.1064453125, 0.2144775390625, 0.161865234375, 0.1446533203125, 0.0767822265625, 0.1527099609375, 0.0159759521484375, ...	embed
66413994_c0	66413994	haskell	0	Title: Is there a way to derive Lift for "IO a" in Haskell? Problem title: Is there a way to derive Lift for "IO a" in Haskell? Tags: template-haskell, haskell, free-monad Problem: Is there a way to derive Lift for "IO a" in Haskell? For awhile now, whenever people mention the performance hit of fre...	Is there a way to derive Lift for "IO a" in Haskell? Is there a way to derive Lift for "IO a" in Haskell? template-haskell haskell free-monad Lift Haskell MyFreeF MyFreeM Free TExp DeriveLift State GHC.IO Is there a way to derive Lift for "IO a" in Haskell? For awhile now, whenever people mention th...	[ -0.002105712890625, 0.0147705078125, -0.003570556640625, -0.005859375, -0.00811767578125, -0.003997802734375, 0.008056640625, -0.002593994140625, -0.003387451171875, -0.035888671875, 0.007537841796875, -0.01385498046875, 0.01287841796875, 0.005706787109375, -0.01470947265625, -0.003997...	[ 2685, 10, 3917, 122, 5844, 166562, 100, 17780, 23, 20625, 142508, 47, 110934, 10557, 1556, 4092, 3796, 712, 2646, 81437, 919, 594, 5153, 13018, 425, 1310, 9506, 2480, 22836, 527, 73265, 23718, 5962, 2667, 997, 29481, 56, 103510, 307, 6528...	[ 0.0283355712890625, 0.1986083984375, 0.1087646484375, 0.150390625, 0.1885986328125, 0.323486328125, 0.1171875, 0.217529296875, 0.065185546875, 0.1287841796875, 0.238037109375, 0.0196990966796875, 0.162841796875, 0.07733154296875, 0.08990478515625, 0.09991455078125, 0.05499267578125, ...	embed
62513201_c1	62513201	haskell	1	. When it actually should be: [StudentsFirstNameChangeEvent {oldName = "Alicja", newName = "Alicjax"},StudentsFirstNameChangeEvent {oldName = "Bartek", newName = "Bartekx"}, ...] enter code here I think im done with haskell, but this is my final progress: correctSplit :: [String] -> [[String]] correctSplit list = let x...	. When it actually should be: [StudentsFirstNameChangeEvent {oldName = "Alicja", newName = "Alicjax"},StudentsFirstNameChangeEvent {oldName = "Bartek", newName = "Bartekx"}, ...] enter code here I think im done with haskell, but this is my final progress: correctSplit :: [String] -> [[String]] correctSplit list = let x...	[ 0.00323486328125, 0.0150146484375, 0.006866455078125, 0.003936767578125, -0.01708984375, 0.01300048828125, -0.01068115234375, -0.0022430419921875, 0.0185546875, 0.00701904296875, 0.001220703125, 0.0301513671875, 0.0218505859375, 0.0301513671875, -0.00347900390625, -0.0036468505859375, ...	[ 5, 14847, 442, 20653, 5608, 186, 239825, 7, 207263, 163612, 127008, 429, 192134, 18345, 55725, 8615, 3525, 425, 25267, 2142, 30957, 18151, 3688, 5351, 566, 16940, 678, 1556, 142508, 2704, 42658, 26785, 31923, 4353, 1984, 71713, 5303, 2633, ...	[ 0.003570556640625, 0.0875244140625, 0.053955078125, 0.149169921875, 0.1541748046875, 0.089111328125, 0.243896484375, 0.0726318359375, 0.1226806640625, 0.197265625, 0.2125244140625, 0.094482421875, 0.208740234375, 0.10284423828125, 0.138427734375, 0.234375, 0.1148681640625, 0.123535...	embed
12176037_c0	12176037	haskell	0	Title: ScopedTypeVariables fail to work with nested where-clauses? Problem title: ScopedTypeVariables fail to work with nested where-clauses? Tags: haskell, type-variables Problem: ScopedTypeVariables fail to work with nested where-clauses? It's a horribly contrived example, but anyway... this typechecks: newtype Foo c...	ScopedTypeVariables fail to work with nested where-clauses? ScopedTypeVariables fail to work with nested where-clauses? haskell type-variables the ScopedTypeVariables Foo Bool Bar Could ScopedTypeVariables fail to work with nested where-clauses? It's a horribly contrived example, but anyway... this typechecks: and work...	[ 0.0091552734375, 0.0234375, -0.0126953125, -0.00150299072265625, 0.007415771484375, 0.0042724609375, -0.02392578125, 0.0087890625, -0.0098876953125, -0.01043701171875, -0.003997802734375, -0.023681640625, 0.0123291015625, 0.005035400390625, 0.01177978515625, -0.005706787109375, 0.001...	[ 182783, 297, 196707, 81827, 14, 19736, 35782, 4488, 678, 8512, 71, 7440, 18347, 29001, 1556, 142508, 10644, 21690, 9572, 31, 2460, 929, 3253, 191147, 9, 152240, 3996, 27781, 903, 78292, 43240, 1284, 15190, 162520, 138256, 4000, 32354, 116983,...	[ 0.233154296875, 0.146728515625, 0.2392578125, 0.140380859375, 0.0841064453125, 0.110107421875, 0.181640625, 0.1123046875, 0.1055908203125, 0.2113037109375, 0.08599853515625, 0.1798095703125, 0.1119384765625, 0.07293701171875, 0.09033203125, 0.2142333984375, 0.209228515625, 0.140747...	embed
25595547_c0	25595547	haskell	0	Title: Snap render list in Hamlet Problem title: Snap render list in Hamlet Tags: haskell-snap-framework, haskell, hamlet Problem: Snap render list in Hamlet Given this little project I'm using to learn Haskell, I would like to move my request handler's code generation to a Hamlet template, but am unsure how to pass th...	Snap render list in Hamlet Snap render list in Hamlet haskell-snap-framework haskell hamlet Snap Hamlet Couldn Probable fileList.hamlet view_root_json_files FilePath Text filtered_filenames Snap render list in Hamlet Given this little project I'm using to learn Haskell, I would like to move my request handler's code ge...	[ 0.0023956298828125, 0.00628662109375, -0.015869140625, 0.0013580322265625, -0.038330078125, 0.0106201171875, 0.000942230224609375, -0.007080078125, 0.0159912109375, -0.044921875, -0.0263671875, -0.02099609375, 0.0028839111328125, -0.0064697265625, -0.002349853515625, 0.00640869140625, ...	[ 121190, 89159, 5303, 10699, 1974, 23, 1556, 142508, 10957, 160328, 18244, 2057, 191147, 1250, 275, 11435, 154663, 3915, 21455, 148920, 170, 1681, 29822, 42724, 683, 10519, 24129, 46312, 11627, 10176, 13452, 30698, 20625, 1884, 25813, 50336, 358...	[ 0.20703125, 0.2255859375, 0.156494140625, 0.1947021484375, 0.250244140625, 0.0147552490234375, 0.09893798828125, 0.2042236328125, 0.1728515625, 0.0855712890625, 0.026763916015625, 0.1319580078125, 0.04803466796875, 0.0787353515625, 0.09942626953125, 0.09942626953125, 0.1341552734375,...	embed
27585900_c0	27585900	haskell	0	Title: haskell, is it possible to debug a parse error? Problem title: haskell, is it possible to debug a parse error? Tags: haskell Problem: haskell, is it possible to debug a parse error? I am working through some exercises I found accompanying a set of lectures online and have come across a problem I cannot overcome,...	haskell, is it possible to debug a parse error? haskell, is it possible to debug a parse error? haskell Integer x:x1:xs Parse haskell, is it possible to debug a parse error? I am working through some exercises I found accompanying a set of lectures online and have come across a problem I cannot overcome, essentially, I...	[ 0.006378173828125, 0.016845703125, -0.01019287109375, 0.0240478515625, 0.00119781494140625, 0.03466796875, -0.0264892578125, -0.00830078125, 0.009521484375, -0.02001953125, 0.0098876953125, -0.04150390625, 0.024658203125, -0.01544189453125, 0.000308990478515625, 0.029052734375, -0.01...	[ 1556, 142508, 83, 442, 7722, 8, 85779, 366, 184, 18499, 47, 10, 44401, 1022, 12, 425, 82825, 2392, 81979, 59619, 1118, 2967, 53418, 645, 45738, 32354, 61924, 11435, 54799, 72367, 2046, 4734, 903, 1543, 145755, 3917, 31380, 318, 14192, 268...	[ 0.1490478515625, 0.24853515625, 0.06597900390625, 0.0281524658203125, 0.1500244140625, 0.1591796875, 0.291015625, 0.1435546875, 0.1552734375, 0.2147216796875, 0.033355712890625, 0.0587158203125, 0.144287109375, 0.06634521484375, 0.003936767578125, 0.07769775390625, 0.0870361328125, ...	embed
29875831_c0	29875831	haskell	0	Title: Missing attributes for links and other types of elements in pandoc Problem title: Missing attributes for links and other types of elements in pandoc Tags: pandoc, haskell Problem: Missing attributes for links and other types of elements in pandoc I am trying to use pandoc (with hakyll , but this is probably not ...	Missing attributes for links and other types of elements in pandoc Missing attributes for links and other types of elements in pandoc pandoc haskell Text.Pandoc Text.Pandoc.Walk Missing _blank Inline Span Link Image RawInline Pandoc StackOverflow stackoverflow.com Missing attributes for links and other types of element...	[ -0.022216796875, -0.00628662109375, 0.00183868408203125, -0.01495361328125, -0.005584716796875, -0.0133056640625, -0.0042724609375, -0.00970458984375, -0.006134033203125, -0.01495361328125, 0.0031585693359375, -0.03662109375, 0.0084228515625, 0.004119873046875, -0.006744384765625, -0.0...	[ 16771, 214, 150380, 90, 100, 22317, 52895, 80854, 2652, 29713, 1556, 142508, 24129, 55956, 97207, 165839, 360, 2256, 63438, 12779, 22710, 109997, 4153, 4378, 156673, 118664, 177261, 5465, 31577, 4527, 76228, 256, 1002, 1181, 5526, 69307, 4764, ...	[ 0.1839599609375, 0.0291748046875, 0.238037109375, 0.0841064453125, 0.041595458984375, 0.23193359375, 0.1478271484375, 0.1683349609375, 0.1700439453125, 0.255615234375, 0.111328125, 0.219482421875, 0.098876953125, 0.0955810546875, 0.113525390625, 0.190185546875, 0.1402587890625, 0.2...	embed
54690534_c0	54690534	haskell	0	Title: Understanding (Traversable Product) Type Problem title: Understanding (Traversable Product) Type Tags: haskell Problem: Understanding (Traversable Product) Type Given the following from fp-course : data Product f g a = Product (f a) (g a) class Functor f where -- Pronounced, eff-map. (<$>) :: (a -> b) -> f a -> ...	Understanding (Traversable Product) Type Understanding (Traversable Product) Type haskell Understanding Traversable Product Type Functor Pronounced Applicative Course Traversable.hs:106:33 Occurs Expected Actual Understanding (Traversable Product) Type Given the following from fp-course : I attempted to define the Trav...	[ -0.0004100799560546875, 0.032958984375, -0.0196533203125, 0.0123291015625, -0.003997802734375, 0.00848388671875, -0.016357421875, 0.0022430419921875, 0.008056640625, -0.004547119140625, 0.0145263671875, -0.006317138671875, -0.00128936767578125, -0.0054931640625, -0.00640869140625, 0.00...	[ 9626, 144057, 28542, 7864, 2886, 73111, 60457, 1556, 142508, 4937, 28670, 18770, 19, 5659, 11048, 4935, 154162, 127, 54100, 31191, 48650, 60075, 13, 100582, 1238, 254, 100599, 81887, 61924, 110527, 706, 10, 9969, 34759, 18499, 28219, 759, 809...	[ 0.13232421875, 0.1495361328125, 0.1402587890625, 0.22802734375, 0.2288818359375, 0.257080078125, 0.23486328125, 0.1290283203125, 0.212890625, 0.169677734375, 0.10382080078125, 0.08837890625, 0.045166015625, 0.1224365234375, 0.15673828125, 0.1097412109375, 0.103271484375, 0.01863098...	embed
18534489_c0	18534489	haskell	0	Title: Can all constraints on data be represented as Algebraic Data Types? Problem title: Can all constraints on data be represented as Algebraic Data Types? Tags: haskell, algebraic-data-types Problem: Can all constraints on data be represented as Algebraic Data Types? Can all constraints on data and state be represen...	Can all constraints on data be represented as Algebraic Data Types? Can all constraints on data be represented as Algebraic Data Types? haskell algebraic-data-types Can Algebraic Data Types Can all constraints on data be represented as Algebraic Data Types? Can all constraints on data and state be represented as Algebr...	[ 0.0034332275390625, -0.005096435546875, -0.0079345703125, 0.0257568359375, 0.006622314453125, 0.003875732421875, -0.01544189453125, 0.0091552734375, -0.00701904296875, -0.00482177734375, -0.015869140625, -0.025146484375, 0.001220703125, 0.031494140625, -0.0042724609375, 0.02490234375, ...	[ 4171, 756, 158, 2816, 4288, 98, 2053, 33636, 297, 237, 884, 429, 2844, 1771, 11809, 60457, 1556, 142508, 144, 10135, 50986, 11341, 5161, 19048, 36510, 5426, 62, 41072, 3164, 7722, 142424, 117249, 110, 70820, 23, 25553, 6892, 11343, 7225, ...	[ 0.09130859375, 0.1434326171875, 0.1361083984375, 0.2257080078125, 0.18310546875, 0.1070556640625, 0.2012939453125, 0.213623046875, 0.0224761962890625, 0.039825439453125, 0.05615234375, 0.10986328125, 0.1658935546875, 0.06939697265625, 0.172119140625, 0.244140625, 0.09234619140625, ...	embed
40523355_c0	40523355	haskell	0	Title: How do I avoid referring to all state variables when updating only a few? Problem title: How do I avoid referring to all state variables when updating only a few? Tags: state-monad, haskell Problem: How do I avoid referring to all state variables when updating only a few? An idiom I use for composing a couple of...	How do I avoid referring to all state variables when updating only a few? How do I avoid referring to all state variables when updating only a few? state-monad haskell How State Bool IORef How do I avoid referring to all state variables when updating only a few? An idiom I use for composing a couple of procedures (with...	[ -0.0137939453125, 0.00970458984375, 0.00897216796875, 0.020751953125, -0.006500244140625, -0.006072998046875, -0.0242919921875, 0.002197265625, 0.0145263671875, 0.0142822265625, 0.002166748046875, 0.0211181640625, -0.00186920166015625, 0.01513671875, 0.0120849609375, 0.00244140625, -...	[ 11249, 71864, 15005, 2852, 47, 756, 11341, 77336, 7, 1257, 56464, 4734, 10846, 3796, 712, 1556, 142508, 22836, 2460, 929, 123435, 4240, 13373, 306, 4527, 9969, 232, 24941, 50491, 76228, 98323, 14012, 55993, 69405, 57823, 3917, 51, 33740, 47...	[ 0.058807373046875, 0.1962890625, 0.1661376953125, 0.049560546875, 0.051971435546875, 0.10577392578125, 0.18896484375, 0.26025390625, 0.06103515625, 0.14990234375, 0.1728515625, 0.095458984375, 0.1358642578125, 0.07977294921875, 0.1209716796875, 0.1129150390625, 0.2099609375, 0.1824...	embed
50844444_c1	50844444	haskell	1	b) -> a -> p n -> p (S n) mapFB cons f = \x ys -> cons (f x) ys {-# INLINE [0] mapFB #-} {-# NOINLINE [0] mapVect #-} {-# RULES "mapVect" [~1] forall f xs. mapVect f xs = buildVect (\nil cons -> foldVect nil (mapFB cons f) xs) #-} {-# INLINE [0] foldVect #-} -- base has this; I don't think it does anything without a "...	b) -> a -> p n -> p (S n) mapFB cons f = \x ys -> cons (f x) ys {-# INLINE [0] mapFB #-} {-# NOINLINE [0] mapVect #-} {-# RULES "mapVect" [~1] forall f xs. mapVect f xs = buildVect (\nil cons -> foldVect nil (mapFB cons f) xs) #-} {-# INLINE [0] foldVect #-} -- base has this; I don't think it does anything without a "...	[ -0.01611328125, 0.0164794921875, 0.00872802734375, -0.01416015625, 0.0008697509765625, 0.0081787109375, -0.00762939453125, -0.0126953125, 0.013671875, -0.0133056640625, 0.0003833770751953125, -0.02001953125, 0.007568359375, 0.021484375, -0.01324462890625, -0.0128173828125, -0.0015716...	[ 876, 33079, 10, 915, 653, 294, 22288, 101865, 158, 7, 1238, 113, 1022, 5881, 57339, 9520, 8852, 856, 24762, 46845, 47138, 62346, 5584, 45367, 17324, 42822, 3647, 1556, 903, 5351, 14602, 107, 214, 79986, 177149, 567, 25553, 347, 68875, 604...	[ 0.1304931640625, 0.0227508544921875, 0.07733154296875, 0.07269287109375, 0.062744140625, 0.00848388671875, 0.16796875, 0.20849609375, 0.2298583984375, 0.046844482421875, 0.1112060546875, 0.05328369140625, 0.02801513671875, 0.084716796875, 0.2178955078125, 0.07232666015625, 0.02655029...	embed
70628303_c1	70628303	haskell	1	Const a) = a eval (Mul a b) = (eval a) `mul` (eval b) <-- this line makes the problem visible in ghci I get the following error *Main> :r [2 of 3] Compiling Lib ( /home/michael/git/brokensquanchy/src/Lib.hs, interpreted ) /home/michael/git/brokensquanchy/src/Lib.hs:45:18: error: • Occurs check: cannot construct the inf...	Const a) = a eval (Mul a b) = (eval a) `mul` (eval b) <-- this line makes the problem visible in ghci I get the following error *Main> :r [2 of 3] Compiling Lib ( /home/michael/git/brokensquanchy/src/Lib.hs, interpreted ) /home/michael/git/brokensquanchy/src/Lib.hs:45:18: error: • Occurs check: cannot construct the inf...	[ -0.01123046875, -0.0142822265625, 0.0224609375, 0.0234375, 0.01019287109375, 0.004852294921875, -0.0118408203125, -0.0123291015625, -0.0123291015625, -0.01519775390625, -0.013916015625, -0.005767822265625, 0.0198974609375, -0.004913330078125, -0.026123046875, -0.0216064453125, 0.0123...	[ 1657, 271, 10, 2203, 28, 1405, 50657, 876, 13, 15458, 13315, 2967, 75693, 31380, 318, 25632, 18499, 168793, 42, 138, 15612, 49725, 43278, 29552, 1436, 583, 15769, 180407, 1755, 13722, 19, 7668, 19437, 104820, 127, 29481, 15989, 24033, 768, ...	[ 0.14453125, 0.150390625, 0.1395263671875, 0.061279296875, 0.0814208984375, 0.258544921875, 0.137451171875, 0.1339111328125, 0.06939697265625, 0.1669921875, 0.0175018310546875, 0.1148681640625, 0.119384765625, 0.09222412109375, 0.1346435546875, 0.0377197265625, 0.1663818359375, 0.10...	embed
71207242_c0	71207242	haskell	0	Title: Why aren't composed self-recursive functions with same data structure (same dims) on in and out inlined together with other recursions? Problem title: Why aren't composed self-recursive functions with same data structure (same dims) on in and out inlined together with other recursions? Tags: compiler-o...	Why aren't composed self-recursive functions with same data structure (same dims) on in and out inlined together with other recursions? Why aren't composed self-recursive functions with same data structure (same dims) on in and out inlined together with other recursions? compiler-optimization ghc haskell opti...	[ -0.00811767578125, -0.005279541015625, 0.0030059814453125, 0.010986328125, -0.01953125, 0.00439453125, -0.0004100799560546875, -0.01263427734375, -0.00170135498046875, -0.0031280517578125, -0.004180908203125, -0.029296875, -0.00408935546875, 0.0181884765625, 0.01397705078125, -0.017089...	[ 44084, 125381, 3768, 18, 150350, 15970, 107, 48650, 5844, 32354, 678, 5701, 2053, 45646, 40175, 34355, 7, 98, 136, 1810, 23, 2256, 25842, 195625, 17514, 3789, 9969, 34759, 100433, 31380, 238, 1556, 142508, 87235, 22288, 2389, 1022, 425, 183...	[ 0.0938720703125, 0.03802490234375, 0.0291748046875, 0.08026123046875, 0.2080078125, 0.132080078125, 0.034576416015625, 0.1719970703125, 0.05084228515625, 0.1717529296875, 0.0279388427734375, 0.113525390625, 0.0692138671875, 0.1558837890625, 0.10174560546875, 0.16357421875, 0.08068847...	embed
45498859_c1	45498859	haskell	1	type: a -> a * In the first argument of `diff', namely `f' In the second argument of `(/)', namely `(diff f x)' In the second argument of `(-)', namely `(f x) / (diff f x)' * Relevant bindings include x :: a (bound at fsolve.hs:8:10) f :: a -> a (bound at fsolve.hs:8:8) newton :: (a -> a) -> a -> a (bound at fsolve.hs...	type: a -> a * In the first argument of `diff', namely `f' In the second argument of `(/)', namely `(diff f x)' In the second argument of `(-)', namely `(f x) / (diff f x)' * Relevant bindings include x :: a (bound at fsolve.hs:8:10) f :: a -> a (bound at fsolve.hs:8:8) newton :: (a -> a) -> a -> a (bound at fsolve.hs...	[ -0.0240478515625, 0.01611328125, 0.002838134765625, 0.0087890625, -0.0003223419189453125, 0.01953125, 0.00640869140625, -0.0130615234375, -0.0026702880859375, -0.0220947265625, 0.00225830078125, 0.002227783203125, 0.01068115234375, 0.01458740234375, 0.006256103515625, -0.0201416015625,...	[ 10644, 10, 33079, 661, 5117, 10750, 152462, 110987, 420, 360, 17932, 64, 1238, 1022, 9, 248, 133, 30624, 128239, 1984, 99091, 86918, 1019, 15110, 3525, 1507, 127, 138577, 4527, 93511, 1771, 12351, 126525, 92, 418, 18537, 19364, 64457, 5, ...	[ 0.2001953125, 0.1900634765625, 0.255615234375, 0.009307861328125, 0.086181640625, 0.213134765625, 0.245361328125, 0.037353515625, 0.1533203125, 0.018402099609375, 0.1241455078125, 0.141845703125, 0.134521484375, 0.111572265625, 0.0877685546875, 0.05426025390625, 0.0718994140625, 0....	embed
78112183_c0	78112183	haskell	0	Title: Factoring out common constants in pattern synonym code? Problem title: Factoring out common constants in pattern synonym code? Tags: pattern-synonyms, overloaded-strings, haskell Problem: Factoring out common constants in pattern synonym code? I had some code like this: newtype T = T Text pattern Alice = T "Alic...	Factoring out common constants in pattern synonym code? Factoring out common constants in pattern synonym code? pattern-synonyms overloaded-strings haskell Factoring Text Alice Factoring out common constants in pattern synonym code? I had some code like this: This is fine, but I was using "Alice" in other places. So I ...	[ 0.0164794921875, 0.0157470703125, -0.00860595703125, 0.03125, 0.00162506103515625, -0.0078125, -0.0048828125, -0.00201416015625, -0.00083160400390625, -0.0277099609375, -0.00023174285888671875, -0.003753662109375, 0.018310546875, 0.0050048828125, -0.006011962890625, 0.0093994140625, ...	[ 117969, 1810, 39210, 53697, 7, 103510, 164661, 18151, 23, 12654, 45757, 645, 63033, 91693, 1556, 142508, 214, 24129, 66083, 5885, 17368, 284, 13348, 31461, 1884, 88303, 1631, 6977, 33740, 77336, 2773, 20653, 14858, 26818, 384, 179459, 107003, ...	[ 0.230712890625, 0.1483154296875, 0.160400390625, 0.18994140625, 0.056915283203125, 0.2340087890625, 0.1947021484375, 0.1739501953125, 0.0135498046875, 0.05340576171875, 0.13671875, 0.0679931640625, 0.1419677734375, 0.1392822265625, 0.0751953125, 0.1842041015625, 0.00335693359375, 0...	embed
36206281_c0	36206281	haskell	0	Title: Difference between type constructor and return function of a monad (in Haskell) Problem title: Difference between type constructor and return function of a monad (in Haskell) Tags: haskell, monads Problem: Difference between type constructor and return function of a monad (in Haskell) I'm trying to figure out mo...	Difference between type constructor and return function of a monad (in Haskell) Difference between type constructor and return function of a monad (in Haskell) haskell monads Difference Haskell Just China Difference between type constructor and return function of a monad (in Haskell) I'm trying to figure out monads in ...	[ -0.002166748046875, 0.0087890625, -0.0003509521484375, 0.0218505859375, 0.0230712890625, 0.006988525390625, -0.007598876953125, 0.00457763671875, -0.00921630859375, -0.01275634765625, 0.0220947265625, -0.035888671875, -0.0024871826171875, 0.01068115234375, -0.003204345703125, -0.010986...	[ 803, 18234, 6620, 17721, 10644, 64549, 748, 136, 30646, 32354, 2667, 712, 20625, 142508, 10, 73, 1556, 7, 9563, 9098, 26366, 81415, 6495, 144057, 87039, 6468, 47959, 57143, 73342, 60212, 217064, 1295, 34475, 34292, 62822, 2053, 3638, 1884, ...	[ 0.050323486328125, 0.1627197265625, 0.04205322265625, 0.0625, 0.2529296875, 0.218994140625, 0.1773681640625, 0.02215576171875, 0.264404296875, 0.1767578125, 0.1483154296875, 0.193115234375, 0.106689453125, 0.22119140625, 0.0187225341796875, 0.0183258056640625, 0.07489013671875, 0.0...	embed
41306420_c0	41306420	haskell	0	Title: Point-free destructuring with GHC Problem title: Point-free destructuring with GHC Tags: union, pattern-matching, haskell, ghc Problem: Point-free destructuring with GHC I do not like to destructure sum typed values with pattern matching. It feels alien for me because of its pointed style. I rather write and use...	Point-free destructuring with GHC Point-free destructuring with GHC union pattern-matching haskell ghc Point-free GHC Either Processor MakeProcessor Left Right Result Fail Success Point-free destructuring with GHC I do not like to destructure sum typed values with pattern matching. It feels alien for me because of its ...	[ -0.00836181640625, 0.021728515625, 0.00750732421875, -0.01556396484375, -0.0103759765625, -0.0228271484375, -0.033935546875, -0.00335693359375, 0.0186767578125, -0.0196533203125, 0.00023937225341796875, -0.024169921875, 0.019775390625, -0.0081787109375, -0.0062255859375, 0.011047363281...	[ 41097, 32087, 8, 36716, 53089, 678, 527, 73265, 69941, 103510, 98753, 1556, 142508, 31380, 238, 4565, 9319, 170582, 26176, 26531, 636, 2480, 90911, 126684, 190355, 144053, 959, 1884, 137656, 10554, 10644, 142424, 14858, 214, 12319, 66961, 6275,...	[ 0.136474609375, 0.17578125, 0.16357421875, 0.1373291015625, 0.0650634765625, 0.043212890625, 0.0870361328125, 0.2071533203125, 0.0987548828125, 0.16259765625, 0.14892578125, 0.0924072265625, 0.2081298828125, 0.099365234375, 0.0709228515625, 0.0980224609375, 0.2210693359375, 0.15148...	embed
20548518_c0	20548518	haskell	0	Title: Parsing Printable Text File in Haskell Problem title: Parsing Printable Text File in Haskell Tags: parsing, text, haskell Problem: Parsing Printable Text File in Haskell I'm trying to figure out the "right" way to parse a particular text file in Haskell. In F#, I loop over each line, testing it against a regular...	Parsing Printable Text File in Haskell Parsing Printable Text File in Haskell parsing text haskell Parsing Printable Text File Haskell COMPANY NAME PROGRAM LISTING STATE PRODUCT ProductName DESCRIPTION REPORT DATE Blah DIVISION XYZ FAA3 AGENT PAGE TARGET X-DATE YEAR ENCODING SMITH JOHN ABC SIZE JANE ACME YELLOW DOE MIC...	[ -0.0185546875, -0.0169677734375, 0.00897216796875, 0.03369140625, -0.0038604736328125, 0.01556396484375, -0.0252685546875, -0.0003604888916015625, 0.011474609375, 0.01031494140625, -0.01513671875, 0.00146484375, -0.02392578125, -0.026611328125, 0.004119873046875, 0.01495361328125, 0....	[ 2392, 6953, 39754, 2886, 24129, 42724, 23, 20625, 142508, 366, 7986, 1556, 61898, 182512, 59677, 67616, 144792, 183575, 73111, 163612, 145269, 1566, 5419, 222562, 143907, 15491, 363, 24639, 436, 55734, 397, 9688, 95409, 232105, 47457, 10000, 82...	[ 0.1968994140625, 0.0560302734375, 0.1993408203125, 0.1474609375, 0.185791015625, 0.1998291015625, 0.041778564453125, 0.1607666015625, 0.274169921875, 0.1685791015625, 0.150634765625, 0.1326904296875, 0.095703125, 0.02191162109375, 0.10113525390625, 0.016998291015625, 0.02110290527343...	embed
44023915_c0	44023915	haskell	0	Title: Operation on newly created data (update an array) Problem title: Operation on newly created data (update an array) Tags: functional-programming, haskell Problem: Operation on newly created data (update an array) I've created the following data types. {- Data declaration predefined in Haskell -} data Maybe_ a = N...	Operation on newly created data (update an array) Operation on newly created data (update an array) functional-programming haskell Operation Data Haskell Maybe_ Nothing_ Just_ Show Array Array_ new_value Operation on newly created data (update an array) I've created the following data types. Now, I'd like to create an ...	[ -0.02685546875, 0.016845703125, 0.01397705078125, 0.0012359619140625, 0.00799560546875, 0.016845703125, -0.00799560546875, 0.02001953125, 0.0157470703125, 0.022705078125, 0.01116943359375, -0.01806640625, -0.00811767578125, -0.00921630859375, 0.01611328125, -0.0255126953125, 0.013427...	[ 102203, 98, 3525, 75935, 2053, 117008, 10298, 53, 123309, 28966, 1556, 142508, 11809, 20625, 83425, 182747, 9563, 17367, 69253, 27494, 25632, 52895, 1884, 28282, 28350, 32354, 34475, 63262, 454, 136, 34292, 70, 99, 11853, 138256, 3688, 28484, ...	[ 0.1868896484375, 0.06298828125, 0.093994140625, 0.1134033203125, 0.155029296875, 0.237060546875, 0.130615234375, 0.0831298828125, 0.126708984375, 0.06591796875, 0.108154296875, 0.231201171875, 0.087158203125, 0.12255859375, 0.1544189453125, 0.09912109375, 0.1182861328125, 0.1342773...	embed
30486428_c1	30486428	haskell	1	iling TestInformation ( TestInformation.hs, interpreted ) TestInformation.hs:36:18: Couldn't match type ‘Response body10’ with ‘IO (Response Data.ByteString.Lazy.Internal.ByteString)’ Expected type: (body10 -> Const Data.ByteString.Lazy.Internal.ByteString body10) -> IO (Response Data.ByteString.Lazy.Internal.ByteStrin...	iling TestInformation ( TestInformation.hs, interpreted ) TestInformation.hs:36:18: Couldn't match type ‘Response body10’ with ‘IO (Response Data.ByteString.Lazy.Internal.ByteString)’ Expected type: (body10 -> Const Data.ByteString.Lazy.Internal.ByteString body10) -> IO (Response Data.ByteString.Lazy.Internal.ByteStrin...	[ -0.01361083984375, 0.01312255859375, 0.000020384788513183594, 0.004150390625, 0.0020904541015625, -0.0005340576171875, -0.011962890625, -0.0203857421875, -0.01116943359375, 0.01904296875, 0.0008087158203125, 0.02392578125, -0.01092529296875, -0.0018768310546875, -0.004425048828125, 0.0...	[ 17, 2069, 8647, 205169, 127, 29481, 7, 32944, 24033, 12, 191147, 18, 14858, 10644, 94399, 13, 14361, 963, 678, 17780, 11809, 75358, 71713, 2729, 3285, 44851, 60075, 37873, 1657, 50258, 33079, 100582, 92748, 5117, 10750, 5, 110987, 134719, 1...	[ 0.1927490234375, 0.26513671875, 0.168701171875, 0.2464599609375, 0.108154296875, 0.1593017578125, 0.021697998046875, 0.125, 0.1436767578125, 0.00299072265625, 0.1414794921875, 0.131591796875, 0.2105712890625, 0.209716796875, 0.1883544921875, 0.099853515625, 0.1900634765625, 0.23791...	embed
64160671_c0	64160671	haskell	0	Title: Reading dot files with graphviz package in haskell Problem title: Reading dot files with graphviz package in haskell Tags: graphviz, layout, haskell, dot Problem: Reading dot files with graphviz package in haskell For a program i have to reformat a dot file in Haskell to adjust the layout of its tree/content. I ...	Reading dot files with graphviz package in haskell Reading dot files with graphviz package in haskell graphviz layout haskell dot Reading Reading dot files with graphviz package in haskell For a program i have to reformat a dot file in Haskell to adjust the layout of its tree/content. I decided to use https://hackage.h...	[ 0.00970458984375, 0.017578125, -0.019775390625, -0.01336669921875, -0.004638671875, 0.00921630859375, -0.0211181640625, -0.01507568359375, -0.000896453857421875, -0.033447265625, 0.01513671875, -0.006622314453125, -0.0128173828125, 0.0037994384765625, -0.003936767578125, -0.00332641601...	[ 104951, 20633, 102158, 678, 41382, 22572, 98169, 1556, 142508, 23, 108802, 1528, 23491, 18, 11435, 20625, 126596, 53201, 69246, 4527, 139509, 10557, 29102, 56989, 5046, 1549, 102107, 29713, 137989, 37878, 11727, 6609, 169, 7693, 45767, 8781, 57...	[ 0.1861572265625, 0.234130859375, 0.1695556640625, 0.04425048828125, 0.175537109375, 0.2269287109375, 0.16845703125, 0.097900390625, 0.221435546875, 0.0175628662109375, 0.20751953125, 0.0802001953125, 0.1544189453125, 0.1087646484375, 0.1575927734375, 0.09649658203125, 0.176025390625,...	embed
10296185_c0	10296185	haskell	0	Title: Haskell : hide function in module (i.e. make function usable only by other functions in same module) Problem title: Haskell : hide function in module (i.e. make function usable only by other functions in same module) Tags: haskell, winghci, ghci, ghc Problem: Haskell : hide function in module (i.e. make function...	Haskell : hide function in module (i.e. make function usable only by other functions in same module) Haskell : hide function in module (i.e. make function usable only by other functions in same module) haskell winghci ghci ghc Haskell i.e NecessaryModule addNumber1 addNumber2 test2.hs Test2 Haskell : hide function in m...	[ 0.008056640625, -0.0101318359375, 0.0020904541015625, 0.0247802734375, -0.0010986328125, 0.01220703125, 0.007537841796875, -0.001953125, 0.0078125, 0.016357421875, -0.0113525390625, -0.0247802734375, -0.007537841796875, 0.000499725341796875, -0.0036468505859375, 0.0020904541015625, -...	[ 20625, 142508, 1274, 112, 32354, 23, 88996, 3249, 1821, 2886, 4734, 3789, 5701, 1556, 14775, 318, 161467, 7, 6635, 91616, 8782, 15190, 18444, 26278, 418, 304, 3034, 5442, 127, 8647, 11435, 70796, 15044, 19882, 43581, 70820, 3917, 1284, 959,...	[ 0.1231689453125, 0.23779296875, 0.1865234375, 0.17626953125, 0.2130126953125, 0.063720703125, 0.2044677734375, 0.02716064453125, 0.08868408203125, 0.046905517578125, 0.032684326171875, 0.061767578125, 0.054595947265625, 0.092529296875, 0.03887939453125, 0.0147705078125, 0.14575195312...	embed
37092580_c1	37092580	haskell	1	HIndex (x ': xs) Zero x where hIndex (x ::: xs) HZero = x instance HIndex xs i y => HIndex (x ': xs) (Succ i) y where hIndex (x ::: xs) (HSucc i) = hIndex xs i The Issue With that established I'll demonstrate the issue. Suppose I construct an HList containing a function that itself takes an HList and does something wi...	HIndex (x ': xs) Zero x where hIndex (x ::: xs) HZero = x instance HIndex xs i y => HIndex (x ': xs) (Succ i) y where hIndex (x ::: xs) (HSucc i) = hIndex xs i The Issue With that established I'll demonstrate the issue. Suppose I construct an HList containing a function that itself takes an HList and does something wi...	[ -0.00775146484375, 0.01104736328125, -0.00970458984375, -0.01214599609375, 0.0003185272216796875, -0.0162353515625, 0.01416015625, 0.0062255859375, 0.0133056640625, -0.0257568359375, -0.0225830078125, -0.0166015625, -0.0091552734375, 0.00543212890625, 0.01214599609375, -0.024658203125,...	[ 35848, 1067, 425, 242, 12, 1022, 7, 83947, 7440, 1096, 4153, 39659, 1984, 194718, 4036, 110527, 17, 113, 14168, 10060, 38131, 34, 223317, 170920, 106804, 31089, 121691, 87, 64549, 572, 154663, 70541, 32354, 450, 68034, 51776, 14602, 5117, 1...	[ 0.1619873046875, 0.1885986328125, 0.1773681640625, 0.023590087890625, 0.006561279296875, 0.1357421875, 0.08642578125, 0.2291259765625, 0.00201416015625, 0.1353759765625, 0.1427001953125, 0.2191162109375, 0.034149169921875, 0.0784912109375, 0.203125, 0.232666015625, 0.086669921875, ...	embed
37894290_c1	37894290	haskell	1	KStat s a) s’ which kind of makes sense, but then if I change KStat s a to KStat in the instance header I get this error: src/KindLang/Data/KStat.hs:27:10: Type synonym ‘KStat’ should have 2 arguments, but has been given none In the instance declaration for ‘MStat KStat s’ which seems to basically saying the exact oppo...	KStat s a) s’ which kind of makes sense, but then if I change KStat s a to KStat in the instance header I get this error: src/KindLang/Data/KStat.hs:27:10: Type synonym ‘KStat’ should have 2 arguments, but has been given none In the instance declaration for ‘MStat KStat s’ which seems to basically saying the exact oppo...	[ -0.00872802734375, 0.033935546875, -0.011474609375, -0.0262451171875, 0.0012664794921875, -0.003662109375, -0.002899169921875, -0.03125, 0.000804901123046875, -0.003997802734375, 0.0068359375, 0.002166748046875, -0.0048828125, -0.017333984375, -0.01348876953125, -0.0224609375, 0.0018...	[ 341, 135206, 91, 10, 16, 26, 8562, 30482, 10422, 1284, 15549, 47, 110527, 10336, 56, 903, 18499, 19437, 605, 7250, 2729, 449, 137989, 20113, 3935, 127, 27592, 15110, 60457, 164661, 5608, 765, 116, 10750, 1556, 2809, 34475, 351, 13, 21635,...	[ 0.1700439453125, 0.299072265625, 0.1575927734375, 0.14501953125, 0.0151824951171875, 0.08074951171875, 0.00714111328125, 0.025054931640625, 0.1102294921875, 0.07049560546875, 0.16259765625, 0.048492431640625, 0.22216796875, 0.1419677734375, 0.094482421875, 0.03948974609375, 0.2178955...	embed
16993831_c0	16993831	haskell	0	Title: Bug in while loop Problem title: Bug in while loop Tags: loops, haskell Problem: Bug in while loop I can't figure out what the bug is in the toy while loop I wrote below. It works for one input, but hangs for other inputs. Here is the code - the while loop takes a vector, a predicate on vector, and transformatio...	Bug in while loop Bug in while loop loops haskell Data.Vector.Unboxed Bug Vector Bool U.map U.fromList GHC Bug in while loop I can't figure out what the bug is in the toy while loop I wrote below. It works for one input, but hangs for other inputs. Here is the code - the while loop takes a vector, a predicate on vector...	[ 0.00555419921875, 0.021240234375, 0.004608154296875, 0.0146484375, 0.018310546875, 0.006103515625, -0.014892578125, -0.005096435546875, -0.00872802734375, -0.0245361328125, 0.00086212158203125, 0.016357421875, -0.012939453125, 0.0203857421875, 0.015380859375, -0.004974365234375, 0.00...	[ 57279, 23, 12960, 40956, 1556, 142508, 11809, 26455, 18770, 14256, 11728, 2609, 2460, 929, 345, 62346, 161063, 154663, 527, 73265, 831, 26366, 1810, 2367, 54608, 83, 72713, 35064, 43240, 100, 1632, 107730, 1284, 10756, 3789, 18151, 51776, 173...	[ 0.2222900390625, 0.08892822265625, 0.238037109375, 0.224853515625, 0.1209716796875, 0.2181396484375, 0.04266357421875, 0.1199951171875, 0.150390625, 0.0318603515625, 0.1470947265625, 0.159912109375, 0.0227813720703125, 0.1121826171875, 0.019805908203125, 0.0826416015625, 0.0747680664...	embed
70230144_c0	70230144	haskell	0	Title: Reachable nodes in a graph Problem title: Reachable nodes in a graph Tags: graph, haskell Problem: Reachable nodes in a graph I want to check from which nodes a node is reachable. So I want to give a graph and node and return a list of all nodes where I can reach the graph from. (I know there is Data.Graph, but ...	Reachable nodes in a graph Reachable nodes in a graph graph haskell Reachable Node node1 node2 node3 node4 node5 Reachable nodes in a graph I want to check from which nodes a node is reachable. So I want to give a graph and node and return a list of all nodes where I can reach the graph from. (I know there is Data.Grap...	[ -0.017822265625, 0.018798828125, 0.00384521484375, 0.04443359375, -0.0023651123046875, -0.01373291015625, -0.01190185546875, -0.0223388671875, 0.0167236328125, -0.0206298828125, -0.007049560546875, -0.03125, 0.007354736328125, 0.0120849609375, -0.0023040771484375, -0.006072998046875, ...	[ 853, 934, 2886, 110, 988, 23, 41382, 1556, 142508, 438, 112, 418, 304, 363, 617, 758, 3444, 47, 12765, 1295, 3129, 83, 58359, 8337, 136, 30646, 5303, 831, 11809, 37878, 11727, 28219, 4527, 45367, 25632, 23351, 214, 18811, 9351, 80581, 6...	[ 0.11083984375, 0.20458984375, 0.2069091796875, 0.188232421875, 0.1754150390625, 0.055145263671875, 0.2293701171875, 0.1273193359375, 0.20751953125, 0.1805419921875, 0.14453125, 0.0208587646484375, 0.007904052734375, 0.0261077880859375, 0.0654296875, 0.1143798828125, 0.0225830078125, ...	embed
57229411_c1	57229411	haskell	1	50) , Turn (RLit 90) , Forward (RLit 50) , Turn (RLit 90) , Forward (RLit 50) ] snd (deState (turbo stmt) initTurboMem) Here is the function in question that isn't taking previous statements into consideration turbo (Seq [x]) = turbo x turbo (Seq (x:xs)) = do state <- get let a0 = snd (deState (turbo x) state) state <...	50) , Turn (RLit 90) , Forward (RLit 50) , Turn (RLit 90) , Forward (RLit 50) ] snd (deState (turbo stmt) initTurboMem) Here is the function in question that isn't taking previous statements into consideration turbo (Seq [x]) = turbo x turbo (Seq (x:xs)) = do state <- get let a0 = snd (deState (turbo x) state) state <...	[ 0.01373291015625, -0.01446533203125, -0.0115966796875, 0.004425048828125, 0.0115966796875, -0.006256103515625, -0.003997802734375, -0.007232666015625, 0.0096435546875, -0.002197265625, -0.0108642578125, 0.032470703125, -0.002166748046875, 0.0267333984375, -0.01080322265625, 0.017211914...	[ 836, 16, 4, 41961, 30121, 217, 2510, 1326, 19364, 91, 2208, 112, 135206, 987, 837, 6138, 39, 18, 23, 42671, 594, 195, 11853, 32354, 9655, 450, 56112, 35971, 96362, 63805, 177229, 94779, 4233, 864, 425, 1022, 11341, 2046, 2633, 10, 2389,...	[ 0.2197265625, 0.0748291015625, 0.0250396728515625, 0.214599609375, 0.049102783203125, 0.1478271484375, 0.2042236328125, 0.06304931640625, 0.188232421875, 0.006622314453125, 0.132080078125, 0.163818359375, 0.1676025390625, 0.094970703125, 0.1507568359375, 0.0192718505859375, 0.0512695...	embed
57516944_c1	57516944	haskell	1	22:18:21 GMT"),("Via","1.1 varnish"),("Connection","keep-alive"),("X-Served-By","cache-mxp19828-MXP"),("X-Cache","MISS"),("X-Cache-Hits","0"),("X-Timer","S1565907502.529821,VS0,VE176"),("Vary","Authorization,Accept-Encoding"),("Access-Control-Allow-Origin","*"),("X-Fastly-Request-ID","9f869169dd207bbd8bb8a8fd4b274acf6...	22:18:21 GMT"),("Via","1.1 varnish"),("Connection","keep-alive"),("X-Served-By","cache-mxp19828-MXP"),("X-Cache","MISS"),("X-Cache-Hits","0"),("X-Timer","S1565907502.529821,VS0,VE176"),("Vary","Authorization,Accept-Encoding"),("Access-Control-Allow-Origin","*"),("X-Fastly-Request-ID","9f869169dd207bbd8bb8a8fd4b274acf6...	[ -0.01324462890625, 0.0179443359375, 0.0191650390625, -0.011962890625, 0.000453948974609375, 0.0016632080078125, -0.0166015625, -0.0036163330078125, 0.0096435546875, 0.01031494140625, 0.005126953125, -0.00823974609375, 0.007476806640625, 0.00433349609375, 0.0015869140625, 0.005340576171...	[ 1039, 24033, 25619, 99961, 36246, 92134, 285, 78183, 235603, 1830, 350, 4517, 24056, 1542, 63771, 75358, 408, 1430, 425, 254, 159027, 1019, 88939, 683, 46994, 53695, 841, 14481, 2389, 70059, 294, 155740, 116708, 48413, 122381, 3117, 47207, 24...	[ 0.04608154296875, 0.064697265625, 0.1160888671875, 0.1356201171875, 0.1986083984375, 0.1292724609375, 0.06549072265625, 0.0936279296875, 0.142822265625, 0.060150146484375, 0.0745849609375, 0.1116943359375, 0.18359375, 0.193359375, 0.1602783203125, 0.197021484375, 0.0843505859375, 0...	embed
40859405_c0	40859405	haskell	0	Title: In the meantime, how do I get executable coverage with stack? Problem title: In the meantime, how do I get executable coverage with stack? Tags: haskell, haskell-stack, code-coverage Problem: In the meantime, how do I get executable coverage with stack? My program consists of 4 executables, and basically zero li...	In the meantime, how do I get executable coverage with stack? In the meantime, how do I get executable coverage with stack? haskell haskell-stack code-coverage -optP.stack-work/dist/x86_64-linux/Cabal-1.24.0.0/build/autogen/cabal_macros.h x86_64-linux ghc-8.0.1 Cabal-1.24.0.0 i.stack-work optP.stack-work cabal_macros.h...	[ 0.0004024505615234375, 0.0026397705078125, -0.00051116943359375, 0.0098876953125, -0.00732421875, 0.0146484375, -0.0086669921875, -0.01446533203125, -0.0014495849609375, -0.020751953125, -0.0087890625, 0.0089111328125, 0.0045166015625, 0.004669189453125, 0.0106201171875, 0.029052734375...	[ 29459, 6032, 3642, 2046, 71924, 2886, 154271, 678, 177261, 1556, 142508, 590, 2594, 18151, 63127, 4588, 2146, 683, 18244, 46295, 15276, 13307, 2397, 6077, 20370, 3571, 5759, 20682, 99929, 177149, 8913, 1409, 408, 3666, 127, 17376, 102014, 304...	[ 0.086181640625, 0.0606689453125, 0.040679931640625, 0.0911865234375, 0.208984375, 0.1226806640625, 0.246826171875, 0.090087890625, 0.269775390625, 0.129638671875, 0.2401123046875, 0.1611328125, 0.1534423828125, 0.1431884765625, 0.194580078125, 0.099365234375, 0.03411865234375, 0.04...	embed
19455333_c0	19455333	haskell	0	Title: Termination checking in functional programs Problem title: Termination checking in functional programs Tags: denotational-semantics, haskell, agda Problem: Termination checking in functional programs Are there functional languages that can specify, in the typechecker, whether or not a certain computation is guar...	Termination checking in functional programs Termination checking in functional programs denotational-semantics haskell agda Termination Bool Lifted Termination checking in functional programs Are there functional languages that can specify, in the typechecker, whether or not a certain computation is guaranteed to termi...	[ 0.01275634765625, 0.01513671875, -0.00653076171875, -0.00262451171875, 0.0004215240478515625, -0.00860595703125, 0.0029754638671875, 0.0033416748046875, -0.01068115234375, -0.0267333984375, -0.01263427734375, -0.005706787109375, -0.00836181640625, 0.00171661376953125, 0.00872802734375, ...	[ 27366, 2320, 175199, 123309, 103391, 8, 58358, 43315, 5765, 109109, 1556, 142508, 1377, 85, 2460, 929, 166562, 297, 46876, 831, 40140, 10644, 78292, 56, 36766, 959, 24233, 181135, 1363, 83, 142027, 47, 121011, 13, 54, 20625, 12342, 756, 122...	[ 0.2366943359375, 0.095458984375, 0.231689453125, 0.2020263671875, 0.1741943359375, 0.0141754150390625, 0.0885009765625, 0.002197265625, 0.000244140625, 0.0287628173828125, 0.0994873046875, 0.25244140625, 0.095947265625, 0.14697265625, 0.1068115234375, 0.2008056640625, 0.237060546875,...	embed
48797597_c0	48797597	haskell	0	Title: Why strictness makes performance worse in Haskell Problem title: Why strictness makes performance worse in Haskell Tags: lazy-evaluation, haskell Problem: Why strictness makes performance worse in Haskell I played with strict evaluations, vectors and matrices and got a rather strange result. There is the followi...	Why strictness makes performance worse in Haskell Why strictness makes performance worse in Haskell lazy-evaluation haskell qualified Control.DeepSeq Why Haskell Test Data.Vector Data.Matrix M.Matrix M.nrows V.generate M.getCol V.sum V.unsafeIndex j-1 Main Why strictness makes performance worse in Haskell I played with...	[ 0.0057373046875, 0.0166015625, 0.015380859375, 0.00848388671875, 0.015869140625, -0.0103759765625, -0.006866455078125, -0.002044677734375, 0.00360107421875, -0.00885009765625, 0.00897216796875, -0.00396728515625, -0.00836181640625, 0.00732421875, -0.01513671875, 0.00811767578125, 0.0...	[ 44084, 81113, 7432, 30482, 23718, 124632, 20625, 142508, 21, 3285, 159258, 1556, 217225, 27131, 4517, 4233, 864, 8647, 11809, 26455, 18770, 87427, 15555, 310, 48281, 3794, 78457, 11832, 309, 115840, 39659, 1647, 5759, 23, 112730, 219836, 22834,...	[ 0.1021728515625, 0.255126953125, 0.146728515625, 0.105712890625, 0.174560546875, 0.177490234375, 0.15673828125, 0.26123046875, 0.042388916015625, 0.108642578125, 0.1318359375, 0.1204833984375, 0.098388671875, 0.080322265625, 0.036285400390625, 0.03509521484375, 0.043670654296875, 0...	embed
44644642_c0	44644642	haskell	0	Title: How to display overflow menu for ToolItems in a GTK Toolbar Problem title: How to display overflow menu for ToolItems in a GTK Toolbar Tags: gtk, haskell, gtk3, gtk2 Problem: How to display overflow menu for ToolItems in a GTK Toolbar A GTK Toolbar can display an overflow menu when the toolbar is not wide enough...	How to display overflow menu for ToolItems in a GTK Toolbar How to display overflow menu for ToolItems in a GTK Toolbar gtk haskell gtk3 gtk2 How ToolItems GTK Toolbar ComboBox ToolItem ToolButton gtk3 gtk2 How to display overflow menu for ToolItems in a GTK Toolbar A GTK Toolbar can display an overflow menu when the t...	[ 0.0022125244140625, 0.03564453125, -0.00433349609375, 0.00872802734375, 0.00799560546875, -0.000865936279296875, -0.0208740234375, -0.0084228515625, 0.006805419921875, 0.0130615234375, 0.0191650390625, -0.062255859375, 0.003509521484375, -0.0011444091796875, -0.006317138671875, -0.0058...	[ 11249, 44116, 645, 118664, 8026, 100, 92285, 568, 2982, 527, 29735, 1299, 23, 31472, 1556, 142508, 363, 304, 3288, 837, 72295, 82212, 55516, 959, 38134, 20174, 7639, 10941, 60213, 4488, 70541, 198, 137565, 27781, 18151, 106804, 31089, 20625, ...	[ 0.010162353515625, 0.1639404296875, 0.1331787109375, 0.258544921875, 0.2432861328125, 0.00665283203125, 0.1729736328125, 0.0309906005859375, 0.19287109375, 0.06170654296875, 0.220947265625, 0.17919921875, 0.00946044921875, 0.13818359375, 0.020538330078125, 0.18310546875, 0.076171875,...	embed
67147474_c0	67147474	haskell	0	Title: Haskell RegEx Matching on UTF8 file Problem title: Haskell RegEx Matching on UTF8 file Tags: regex, pcre, haskell, encoding Problem: Haskell RegEx Matching on UTF8 file I wrote this function module PdfParser (parseOptions) where import Text.Regex.PCRE import Data.List.Split parseOptions :: String -> [String] par...	Haskell RegEx Matching on UTF8 file Haskell RegEx Matching on UTF8 file regex pcre haskell encoding Text.Regex.PCRE Data.List.Split Test.Hspec Test.QuickCheck PdfParser Haskell RegEx Matching UTF8 OPTIONS INTERIEUR EQUIPEMENTS SERIE PdfParserSpec Spec List referential.txt Peinture Jantes Viva Stella RDIF21 Chargeur Rou...	[ -0.01336669921875, -0.0089111328125, 0.01361083984375, 0.01470947265625, -0.0086669921875, -0.009765625, 0.003143310546875, 0.018310546875, -0.015380859375, 0.01141357421875, -0.01416015625, -0.0081787109375, 0.007354736328125, -0.026611328125, 0.015869140625, 0.0035858154296875, 0.0...	[ 20625, 142508, 11678, 19279, 67407, 214, 98, 345, 30992, 1019, 11435, 6835, 3355, 36719, 107, 1556, 587, 24129, 54601, 12233, 11766, 154663, 4353, 8647, 841, 16711, 202567, 221998, 28636, 28023, 59692, 68019, 6755, 2189, 47107, 24990, 32036, ...	[ 0.151611328125, 0.250732421875, 0.1644287109375, 0.23388671875, 0.2021484375, 0.072021484375, 0.05377197265625, 0.03118896484375, 0.174072265625, 0.226318359375, 0.1666259765625, 0.1539306640625, 0.2161865234375, 0.04241943359375, 0.1651611328125, 0.14453125, 0.1202392578125, 0.122...	embed
24495135_c0	24495135	haskell	0	Title: Haskell (formidably long) palindrome check Problem title: Haskell (formidably long) palindrome check Tags: ghci, ghc, haskell, list, palindrome Problem: Haskell (formidably long) palindrome check I'm working my way up the infamous H-99 problems and I'm playing around problem #6 (find out whether a list is a pali...	Haskell (formidably long) palindrome check Haskell (formidably long) palindrome check ghci ghc haskell list palindrome Haskell x:xs Mon Jun Time Allocation Profiling Report Final h99 RTS COST CENTRE MODULE Main CAF GHC.Conc.Signal GHC.IO.Encoding GHC.IO.Encoding.Iconv GHC.IO.Handle.FD GHC.Show a..b Haskell (formidably ...	[ -0.00555419921875, 0.00543212890625, 0.00909423828125, -0.0079345703125, 0.000942230224609375, 0.0283203125, 0.013916015625, -0.0234375, -0.01806640625, -0.0135498046875, 0.0235595703125, -0.0194091796875, 0.01806640625, -0.01470947265625, -0.0003185272216796875, 0.00396728515625, 0....	[ 20625, 142508, 5037, 532, 78458, 4989, 17923, 19, 102851, 12765, 31380, 318, 238, 1556, 5303, 1022, 425, 7465, 13328, 19055, 884, 87632, 58848, 34798, 27188, 1096, 5046, 27389, 313, 34274, 89859, 98610, 12321, 166566, 527, 73265, 218723, 1778...	[ 0.134765625, 0.255859375, 0.047698974609375, 0.0911865234375, 0.1083984375, 0.1900634765625, 0.1588134765625, 0.06494140625, 0.1922607421875, 0.1920166015625, 0.06494140625, 0.0623779296875, 0.04681396484375, 0.110107421875, 0.2158203125, 0.1435546875, 0.084228515625, 0.03604125976...	embed
30569917_c1	30569917	haskell	1	iling SetupWrapper ( /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3/SetupWrapper.hs, /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3/dist/dist-sandbox-96c39190/setup/SetupWrapper.o ) [2 of 2] Compiling Main ( /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3/dist/dist-sandbox-96c39190/setup/setup.hs, /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3...	iling SetupWrapper ( /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3/SetupWrapper.hs, /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3/dist/dist-sandbox-96c39190/setup/SetupWrapper.o ) [2 of 2] Compiling Main ( /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3/dist/dist-sandbox-96c39190/setup/setup.hs, /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3...	[ 0.00311279296875, 0.0146484375, 0.01373291015625, -0.000598907470703125, -0.020751953125, 0.01544189453125, -0.025634765625, -0.01446533203125, 0.00579833984375, 0.0301513671875, -0.040771484375, -0.01220703125, 0.004669189453125, -0.0301513671875, 0.007354736328125, 0.0172119140625, ...	[ 17, 2069, 19943, 2037, 1456, 219, 8079, 2676, 102241, 31, 102014, 48413, 363, 22820, 136442, 40061, 126, 127, 18, 46295, 43882, 11728, 11648, 9323, 66951, 3509, 304, 111, 116, 15612, 49725, 12321, 168793, 12779, 214, 527, 31472, 841, 7, 5...	[ 0.186279296875, 0.24267578125, 0.199462890625, 0.1783447265625, 0.02471923828125, 0.175048828125, 0.2247314453125, 0.1739501953125, 0.16455078125, 0.2188720703125, 0.080078125, 0.19189453125, 0.04541015625, 0.01885986328125, 0.174072265625, 0.018829345703125, 0.1689453125, 0.097229...	embed
59362437_c1	59362437	haskell	1	turned " ++ show (clientAge c) ++ ", have you checked out our latest " ++ intercalate ", " (clientInterestedIn c) ++ " products? Give us a visit!" server3 :: Server API server3 = position :<\|> hello :<\|> marketing where position :: Int -> Int -> Handler Position position x y = return (Position x y) hello :: Maybe Stri...	turned " ++ show (clientAge c) ++ ", have you checked out our latest " ++ intercalate ", " (clientInterestedIn c) ++ " products? Give us a visit!" server3 :: Server API server3 = position :<\|> hello :<\|> marketing where position :: Int -> Int -> Handler Position position x y = return (Position x y) hello :: Maybe Stri...	[ -0.007476806640625, 0.00555419921875, 0.017822265625, 0.0150146484375, -0.01019287109375, 0.0264892578125, 0.0014495849609375, -0.00555419921875, 0.00946044921875, 0.000812530517578125, -0.007598876953125, 0.0072021484375, 0.0198974609375, -0.000021696090698242188, -0.01007080078125, 0...	[ 69347, 37223, 7639, 222978, 284, 429, 501, 765, 12765, 2446, 42850, 1940, 62309, 67, 44851, 525, 297, 4153, 38742, 77878, 1821, 10, 19922, 10723, 363, 22687, 61687, 2203, 19069, 33600, 7481, 7440, 10639, 603, 99428, 113, 30646, 7192, 172, ...	[ 0.155029296875, 0.1510009765625, 0.1610107421875, 0.1888427734375, 0.046600341796875, 0.1304931640625, 0.027618408203125, 0.0208892822265625, 0.050872802734375, 0.030059814453125, 0.0401611328125, 0.041229248046875, 0.116943359375, 0.06121826171875, 0.047943115234375, 0.071533203125, ...	embed
11828654_c0	11828654	haskell	0	Title: Controlling parallel execution Problem title: Controlling parallel execution Tags: haskell, parallel-processing Problem: Controlling parallel execution Haskell provides a par combinator, which queues a "spark" for possible evaluation in parallel with the current thread. It also provides a pseq combinator, which ...	Controlling parallel execution Controlling parallel execution haskell parallel-processing Controlling Controlling parallel execution Haskell provides a par combinator, which queues a "spark" for possible evaluation in parallel with the current thread. It also provides a pseq combinator, which forces evaluation of pure ...	[ -0.0107421875, 0.031494140625, -0.0220947265625, -0.0052490234375, 0.005279541015625, -0.0020599365234375, 0.0003032684326171875, -0.032958984375, 0.011474609375, -0.02587890625, 0.0017547607421875, 0.0152587890625, 0.007537841796875, 0.0240478515625, -0.01190185546875, 0.0062561035156...	[ 27131, 2069, 95103, 71924, 1830, 1556, 142508, 63923, 20625, 87344, 366, 22321, 1290, 41, 21049, 7, 10237, 100, 7722, 219836, 678, 43581, 86997, 24828, 864, 84616, 34166, 18151, 74918, 29458, 12989, 959, 108975, 22691, 3917, 139392, 40368, 13...	[ 0.18505859375, 0.0894775390625, 0.258056640625, 0.186279296875, 0.00421142578125, 0.139892578125, 0.2802734375, 0.1319580078125, 0.1478271484375, 0.1092529296875, 0.166748046875, 0.19970703125, 0.132568359375, 0.1102294921875, 0.06829833984375, 0.072021484375, 0.18212890625, 0.0015...	embed
17591276_c0	17591276	haskell	0	Title: What programming languages have something like Haskell’s `newtype` Problem title: What programming languages have something like Haskell’s `newtype` Tags: functional-programming, haskell, newtype, programming-languages Problem: What programming languages have something like Haskell’s `newtype` The Haskell progra...	What programming languages have something like Haskell’s `newtype` What programming languages have something like Haskell’s `newtype` functional-programming haskell newtype programming-languages What Haskell Foo Bar What programming languages have something like Haskell’s `newtype` The Haskell programming language has ...	[ 0.01031494140625, 0.000598907470703125, 0.015869140625, 0.007720947265625, -0.006103515625, 0.0128173828125, -0.023681640625, 0.01263427734375, 0.007598876953125, -0.010498046875, -0.012939453125, -0.037841796875, -0.000682830810546875, -0.01055908203125, -0.0216064453125, 0.0029602050...	[ 4865, 56037, 449, 46876, 7, 765, 9844, 1884, 20625, 142508, 26, 54936, 50986, 123309, 28966, 1556, 3525, 196651, 9572, 31, 3253, 23755, 4263, 33022, 25267, 10644, 75935, 13882, 178851, 47, 1582, 100034, 142477, 17721, 6626, 234994, 64549, 528...	[ 0.05047607421875, 0.1553955078125, 0.07489013671875, 0.207763671875, 0.0205841064453125, 0.0843505859375, 0.110107421875, 0.15576171875, 0.1693115234375, 0.279296875, 0.007965087890625, 0.188232421875, 0.342529296875, 0.1361083984375, 0.131103515625, 0.114990234375, 0.1861572265625, ...	embed
39239577_c0	39239577	haskell	0	Title: Partial application of data constructor Problem title: Partial application of data constructor Tags: currying, haskell, partial-application Problem: Partial application of data constructor I don't understand why the following exercise "works" in Haskell Programming from First Principles : type Subject = String t...	Partial application of data constructor Partial application of data constructor currying haskell partial-application a Partial Subject Verb Object Sentence Show Julie Main Possible GHCi Partial application of data constructor I don't understand why the following exercise "works" in Haskell Programming from First Princi...	[ 0.0167236328125, 0.0186767578125, 0.000720977783203125, 0.0155029296875, 0.0142822265625, 0.00543212890625, 0.004730224609375, -0.006683349609375, 0.00994873046875, -0.0054931640625, 0.000324249267578125, -0.031494140625, -0.0017547607421875, 0.00994873046875, -0.00921630859375, -0.007...	[ 9148, 289, 38415, 2053, 64549, 748, 198555, 1556, 142508, 2878, 101687, 94341, 1446, 134549, 63999, 6620, 17367, 64672, 12321, 527, 73265, 14, 18, 28219, 15400, 25632, 81979, 18244, 20625, 27958, 1295, 23972, 79680, 1577, 228006, 903, 31380, ...	[ 0.146484375, 0.06317138671875, 0.1220703125, 0.0904541015625, 0.1558837890625, 0.05517578125, 0.08984375, 0.07611083984375, 0.2227783203125, 0.1370849609375, 0.1407470703125, 0.10540771484375, 0.1175537109375, 0.2139892578125, 0.1239013671875, 0.10888671875, 0.1522216796875, 0.1000...	embed
72191993_c0	72191993	haskell	0	Title: Haskell Recursion Function (guards required) Problem title: Haskell Recursion Function (guards required) Tags: haskell, palindrome, recursion Problem: Haskell Recursion Function (guards required) Can someone tell me what's wrong with my implementation of this Haskell palindrome checker? Note: Before calling this...	Haskell Recursion Function (guards required) Haskell Recursion Function (guards required) haskell palindrome recursion Haskell Recursion Char Bool jdoodle.hs:43:42 Couldn Haskell Recursion Function (guards required) Can someone tell me what's wrong with my implementation of this Haskell palindrome checker? Note: Before...	[ -0.0218505859375, 0.0164794921875, 0.00823974609375, 0.00897216796875, 0.0184326171875, 0.0201416015625, -0.006072998046875, -0.0260009765625, 0.006103515625, 0.00445556640625, 0.03759765625, -0.02783203125, -0.006195068359375, 0.003936767578125, 0.00738525390625, -0.00116729736328125,...	[ 20625, 142508, 165428, 42, 6889, 28670, 10763, 32116, 7, 56065, 1556, 17923, 19, 102851, 195625, 21656, 2460, 929, 1647, 55742, 133, 127, 33210, 33529, 191147, 14192, 44691, 208124, 903, 12765, 56, 117371, 159029, 107730, 79315, 70, 11030, 66...	[ 0.134521484375, 0.2529296875, 0.1396484375, 0.1507568359375, 0.10986328125, 0.14794921875, 0.09564208984375, 0.2193603515625, 0.07623291015625, 0.1756591796875, 0.100830078125, 0.100341796875, 0.06951904296875, 0.1898193359375, 0.18359375, 0.1119384765625, 0.03466796875, 0.14575195...	embed
41404647_c0	41404647	haskell	0	Title: How to implement search in file system in haskell? Problem title: How to implement search in file system in haskell? Tags: concurrency, haskell Problem: How to implement search in file system in haskell? I'm not exactly new to haskell, but haven't used it much in real world. So what I want to do is to find all g...	How to implement search in file system in haskell? How to implement search in file system in haskell? concurrency haskell Control.Concurrent.Async System.Directory System.FilePath System.IO How FilePath Bool Traversable FTree Node How to implement search in file system in haskell? I'm not exactly new to haskell, but ha...	[ -0.007232666015625, 0.012939453125, -0.00634765625, -0.00213623046875, -0.00567626953125, 0.009765625, 0.0076904296875, -0.01336669921875, 0, -0.044921875, 0.0003604888916015625, 0.00830078125, -0.003082275390625, 0.0181884765625, -0.0018768310546875, 0.00982666015625, 0.004180908203...	[ 11249, 47, 29479, 33938, 23, 11435, 5426, 1556, 142508, 108636, 982, 2408, 27131, 11935, 163812, 12654, 12353, 174350, 683, 10519, 17780, 42724, 2460, 929, 4937, 7864, 2886, 563, 62731, 13, 438, 112, 3525, 38246, 11814, 5045, 2773, 8999, 74...	[ 0.07159423828125, 0.0252685546875, 0.1915283203125, 0.2646484375, 0.14501953125, 0.1500244140625, 0.159912109375, 0.1517333984375, 0.25146484375, 0.1470947265625, 0.115966796875, 0.005859375, 0.11669921875, 0.017913818359375, 0.19873046875, 0.10498046875, 0.056365966796875, 0.07116...	embed
20228733_c0	20228733	haskell	0	Title: How exactly do kind lists work? Problem title: How exactly do kind lists work? Tags: data-kinds, haskell Problem: How exactly do kind lists work? I've been reading on vinyl recently, which uses weird "list of kinds" kinda types. After reading a bit on kinds and vinyl, I've gotten somewhat of an intuitive underst...	How exactly do kind lists work? How exactly do kind lists work? data-kinds haskell the How LANGUAGE DataKinds TypeOperators FlexibleInstances FlexibleContexts KindSignatures GADTs Main HCons HList HNil Show ISum Integral Integer Defined test.hs:10:6 test.hs:17:10 test.hs:19:10 test.hs:25:10 test.hs:29:10 How exactly do...	[ 0.0022125244140625, -0.006683349609375, 0.01068115234375, 0.0027313232421875, 0.0027008056640625, 0.0052490234375, -0.00201416015625, -0.014404296875, 0.0159912109375, -0.01708984375, -0.0106201171875, -0.05078125, 0.021240234375, 0.01043701171875, -0.0166015625, -0.006256103515625, ...	[ 11249, 66161, 54, 8562, 5303, 7, 4488, 2053, 68347, 1556, 142508, 3358, 98064, 11809, 605, 7250, 60457, 156823, 22230, 180842, 2661, 116071, 22829, 27435, 218723, 23749, 41072, 12321, 81118, 5245, 572, 154663, 79059, 379, 17367, 15744, 316, 2...	[ 0.0894775390625, 0.1944580078125, 0.05950927734375, 0.264404296875, 0.26220703125, 0.12939453125, 0.1693115234375, 0.1151123046875, 0.203857421875, 0.1187744140625, 0.20849609375, 0.0262451171875, 0.1124267578125, 0.0860595703125, 0.045501708984375, 0.2203369140625, 0.156005859375, ...	embed
3329049_c0	3329049	haskell	0	Title: SceneGraph traversal in Haskell Problem title: SceneGraph traversal in Haskell Tags: tree-traversal, scenegraph, haskell Problem: SceneGraph traversal in Haskell I want to implement a simple SceneGraph in Haskell using Data.Tree consisting of Transform and Shape nodes. In a SceneGraph the spatial transformation ...	SceneGraph traversal in Haskell SceneGraph traversal in Haskell tree-traversal scenegraph haskell SceneGraph Haskell Data.Tree Transform Shape Vector2 Double Circle Square SceneNode XFormNode ShapeNode Node Position2 SceneGraph traversal in Haskell I want to implement a simple SceneGraph in Haskell using Data.Tree cons...	[ -0.0146484375, 0.021728515625, -0.0096435546875, -0.000850677490234375, -0.003936767578125, 0.00811767578125, -0.029541015625, -0.0240478515625, -0.01043701171875, -0.02197265625, 0.0128173828125, 0.01080322265625, -0.0084228515625, 0.005401611328125, -0.0111083984375, 0.018310546875, ...	[ 178460, 37878, 11727, 37317, 289, 23, 20625, 142508, 53201, 1517, 814, 2317, 28302, 41382, 1556, 11809, 62731, 11062, 5037, 7224, 1081, 2609, 18770, 304, 107172, 163731, 68305, 5021, 1193, 102973, 438, 99428, 29479, 8781, 58055, 136, 110, 562...	[ 0.2181396484375, 0.251708984375, 0.197998046875, 0.27001953125, 0.08978271484375, 0.02606201171875, 0.139892578125, 0.2445068359375, 0.2230224609375, 0.039031982421875, 0.1593017578125, 0.091552734375, 0.2091064453125, 0.22607421875, 0.08441162109375, 0.10137939453125, 0.18212890625,...	embed
26316233_c0	26316233	haskell	0	Title: Why don't all types get expanded? Problem title: Why don't all types get expanded? Tags: haskell, type-level-computation Problem: Why don't all types get expanded? Suppose type family F (x :: Nat) (y :: Nat) :: (Nat, Nat) where F x y = '(x, y) then :t Proxy :: Proxy '[ (F 1 2) ] Proxy :: Proxy '[ (F 1 ...	Why don't all types get expanded? Why don't all types get expanded? haskell type-level-computation Why Nat Proxy ZipWith Couldn Expected Actual LANGUAGE DataKinds TypeOperators KindSignatures GADTs Rank2Types ScopedTypeVariables MultiParamTypeClasses FlexibleInstances TypeFamilies UndecidableInstances PolyKin...	[ 0.0167236328125, -0.01123046875, -0.01055908203125, -0.00439453125, -0.01202392578125, 0.01300048828125, -0.007293701171875, 0.007568359375, 0.0224609375, 0.01141357421875, -0.008544921875, -0.01153564453125, -0.0012359619140625, -0.004486083984375, -0.0152587890625, 0.0208740234375, ...	[ 44084, 2301, 3768, 18, 756, 52895, 71062, 297, 2046, 1556, 142508, 10644, 67919, 68875, 1250, 50878, 162150, 194583, 13, 100582, 98064, 7250, 60457, 156823, 27435, 218723, 41072, 134405, 196707, 182783, 140803, 180842, 24750, 116071, 63306, 12169...	[ 0.07183837890625, 0.0284423828125, 0.0091552734375, 0.0748291015625, 0.1162109375, 0.210693359375, 0.190185546875, 0.061553955078125, 0.02471923828125, 0.058258056640625, 0.1688232421875, 0.1749267578125, 0.096923828125, 0.0772705078125, 0.013702392578125, 0.1202392578125, 0.05627441...	embed
26469218_c0	26469218	haskell	0	Title: How do alternative uses of recursion influence the efficiency of Haskell list reverse? Problem title: How do alternative uses of recursion influence the efficiency of Haskell list reverse? Tags: haskell, recursion Problem: How do alternative uses of recursion influence the efficiency of Haskell list reverse? I a...	How do alternative uses of recursion influence the efficiency of Haskell list reverse? How do alternative uses of recursion influence the efficiency of Haskell list reverse? haskell recursion How Haskell x:xs x:reversed How do alternative uses of recursion influence the efficiency of Haskell list reverse? I am giving m...	[ -0.0257568359375, 0.0272216796875, 0.0242919921875, 0.01202392578125, -0.00041961669921875, 0.0120849609375, -0.0123291015625, 0.0045166015625, 0.01416015625, 0.0142822265625, 0.007171630859375, -0.007232666015625, 0.01251220703125, 0.013916015625, 0.0062255859375, 0.0137939453125, 0...	[ 11249, 30700, 4527, 195625, 1830, 79507, 227066, 20625, 142508, 5303, 39531, 184, 1556, 1022, 12, 425, 7, 107, 7864, 297, 68772, 35978, 210651, 56, 10078, 15649, 29806, 758, 51347, 73342, 15400, 17932, 83, 1286, 93766, 3501, 5117, 15044, 28...	[ 0.07037353515625, 0.1898193359375, 0.1488037109375, 0.235107421875, 0.13720703125, 0.1595458984375, 0.2015380859375, 0.119873046875, 0.2109375, 0.1746826171875, 0.2047119140625, 0.1251220703125, 0.100830078125, 0.11474609375, 0.05108642578125, 0.10479736328125, 0.05401611328125, 0....	embed
28146009_c0	28146009	haskell	0	Title: How to speed Haskell IO with buffering? Problem title: How to speed Haskell IO with buffering? Tags: performance, buffering, haskell, io Problem: How to speed Haskell IO with buffering? I read about IO buffering in the "Real World Haskell" (ch. 7, p. 189), and tried to test, how different buffering size affects ...	How to speed Haskell IO with buffering? How to speed Haskell IO with buffering? performance buffering haskell io System.IO Data.Time.Clock Data.Char How Haskell bigFile.txt ReadMode BlockBuffering Just Current processed.txt How to speed Haskell IO with buffering? I read about IO buffering in the "Real World Haskell" (c...	[ -0.0250244140625, -0.00567626953125, 0.018310546875, -0.00543212890625, -0.0026702880859375, 0.0030517578125, 0.000052928924560546875, -0.005950927734375, -0.006683349609375, 0.01226806640625, 0.0054931640625, -0.01953125, 0.0179443359375, -0.01318359375, -0.01416015625, -0.01080322265...	[ 11249, 47, 38352, 20625, 142508, 17780, 678, 123759, 4209, 23718, 1556, 22995, 12353, 11809, 70059, 21135, 84068, 6957, 174350, 124326, 4764, 9083, 80231, 7235, 18234, 9563, 114063, 9433, 297, 12301, 68996, 6661, 104736, 37842, 3034, 12921, 132...	[ 0.076904296875, 0.06787109375, 0.205810546875, 0.1424560546875, 0.25146484375, 0.2130126953125, 0.1024169921875, 0.206787109375, 0.1612548828125, 0.1591796875, 0.1201171875, 0.177490234375, 0.05804443359375, 0.00775146484375, 0.05517578125, 0.07366943359375, 0.053009033203125, 0.05...	embed
60977498_c0	60977498	haskell	0	Title: How to properly do nested routing in Obelisk? Problem title: How to properly do nested routing in Obelisk? Tags: haskell-snap-framework, haskell, reflex Problem: How to properly do nested routing in Obelisk? I have been searching for examples , however most examples do a RouteSomething -> PathSegment "firstpath"...	How to properly do nested routing in Obelisk? How to properly do nested routing in Obelisk? haskell-snap-framework haskell reflex How Obelisk RouteSomething PathSegment Cat.id FullRoute_Backend BackendRoute_Missing BackendRoute_API Identity Common.Route Obelisk.Route How to properly do nested routing in Obelisk? I have...	[ -0.00074005126953125, 0.006744384765625, -0.00106048583984375, -0.01165771484375, -0.0172119140625, -0.000751495361328125, 0.01397705078125, -0.01708984375, 0.019287109375, -0.033447265625, -0.003509521484375, -0.0213623046875, 0.0035552978515625, 0.032470703125, -0.0093994140625, 0.01...	[ 11249, 155965, 54, 8512, 71, 22629, 1916, 23, 180, 14473, 1042, 47, 1556, 142508, 10957, 160328, 71181, 106015, 64113, 108421, 2507, 18826, 532, 9312, 12724, 6743, 152470, 3611, 26828, 135261, 74220, 71257, 151301, 27781, 2684, 282, 13448, 12...	[ 0.085693359375, 0.1702880859375, 0.08282470703125, 0.24609375, 0.166748046875, 0.188232421875, 0.1195068359375, 0.09130859375, 0.1181640625, 0.2266845703125, 0.2105712890625, 0.010894775390625, 0.064208984375, 0.1920166015625, 0.1734619140625, 0.077392578125, 0.19677734375, 0.18078...	embed
24117788_c0	24117788	haskell	0	Title: Mixing Threepenny-Gui and StateT Problem title: Mixing Threepenny-Gui and StateT Tags: threepenny-gui, haskell, state-monad, monad-transformers Problem: Mixing Threepenny-Gui and StateT I have a question on the interaction of Threepenny-Gui with StateT. Consider this toy program that, every time the button is cl...	Mixing Threepenny-Gui and StateT Mixing Threepenny-Gui and StateT threepenny-gui haskell state-monad monad-transformers Control.Monad Control.Monad.State qualified Graphics.UI.Threepenny.Core Mixing Threepenny-Gui StateT Graphics.UI.Threepenny Window Ciao Element UI.button Click UI.ul UI.click UI.li Mixing Threepenny-G...	[ -0.02978515625, 0.00811767578125, 0.000804901123046875, -0.0079345703125, 0.0291748046875, 0.013427734375, 0.0022125244140625, -0.0062255859375, -0.0030059814453125, -0.07666015625, 0.0194091796875, -0.0069580078125, -0.020263671875, 0.0228271484375, 0, -0.005828857421875, 0.02612304...	[ 37286, 214, 129335, 2278, 299, 9, 22769, 14, 136, 22836, 618, 17262, 17086, 1556, 142508, 11341, 3796, 712, 2667, 215175, 1314, 27131, 46674, 135206, 217225, 189682, 33457, 107, 13, 50886, 176501, 107786, 48325, 111481, 8789, 21138, 202, 1232...	[ 0.2271728515625, 0.09515380859375, 0.205810546875, 0.1802978515625, 0.1995849609375, 0.04925537109375, 0.2137451171875, 0.153076171875, 0.0860595703125, 0.1763916015625, 0.212158203125, 0.163330078125, 0.2276611328125, 0.087646484375, 0.193115234375, 0.1343994140625, 0.08447265625, ...	embed
7135540_c0	7135540	haskell	0	Title: What is the name of this monad-like functional programming pattern? Problem title: What is the name of this monad-like functional programming pattern? Tags: monads, haskell, functional-programming, design-patterns Problem: What is the name of this monad-like functional programming pattern? I have occasionally en...	What is the name of this monad-like functional programming pattern? What is the name of this monad-like functional programming pattern? monads haskell functional-programming design-patterns What TyT TyF TyOr Marked Show What is the name of this monad-like functional programming pattern? I have occasionally encountered ...	[ 0.01080322265625, 0.0184326171875, -0.00665283203125, 0.0289306640625, 0.004425048828125, 0.00335693359375, -0.0115966796875, 0.0021514892578125, -0.000629425048828125, -0.01422119140625, 0.015380859375, -0.0228271484375, -0.017822265625, -0.00107574462890625, 0.000926971435546875, 0.0...	[ 4865, 9351, 111, 903, 2667, 712, 5062, 123309, 56037, 449, 103510, 83, 7, 1556, 142508, 28966, 4331, 4453, 22766, 8064, 618, 919, 19060, 7880, 297, 17367, 70, 9, 46505, 190647, 18151, 3332, 195, 13566, 10, 1284, 959, 13695, 74729, 10644, ...	[ 0.0236663818359375, 0.1243896484375, 0.056121826171875, 0.1273193359375, 0.1650390625, 0.2069091796875, 0.2138671875, 0.187255859375, 0.1612548828125, 0.07110595703125, 0.245849609375, 0.041107177734375, 0.05615234375, 0.0860595703125, 0.2158203125, 0.08984375, 0.0963134765625, 0.1...	embed
68607694_c0	68607694	haskell	0	Title: New functions are not detected by vscode Haskell extension Problem title: New functions are not detected by vscode Haskell extension Tags: visual-studio-code, haskell, haskell-language-server Problem: New functions are not detected by vscode Haskell extension I have the following Visual Studio Code extensions fo...	New functions are not detected by vscode Haskell extension New functions are not detected by vscode Haskell extension visual-studio-code haskell haskell-language-server Haskell Lib.hs Main.hs OPTIONS_GHC Wno-deferred-out-of-scope-variables New functions are not detected by vscode Haskell extension I have the following ...	[ 0.014404296875, 0.0155029296875, 0.01104736328125, 0.0169677734375, -0.007476806640625, -0.00092315673828125, -0.029052734375, 0.015869140625, -0.0087890625, 0.0064697265625, 0.000949859619140625, -0.031494140625, 0.00811767578125, 0.0146484375, 0.019775390625, 0.01397705078125, 0.00...	[ 2356, 32354, 7, 959, 96391, 297, 20209, 40899, 20625, 142508, 111938, 21176, 52629, 1556, 196651, 39642, 43278, 127, 12321, 28023, 41877, 441, 157, 112, 2875, 2822, 6056, 70820, 21690, 73372, 22968, 28864, 20600, 28282, 3525, 177261, 13452, 1...	[ 0.12744140625, 0.2069091796875, 0.00604248046875, 0.1231689453125, 0.229736328125, 0.0264434814453125, 0.1710205078125, 0.257080078125, 0.1190185546875, 0.22900390625, 0.168701171875, 0.1353759765625, 0.13427734375, 0.06939697265625, 0.048492431640625, 0.0635986328125, 0.130004882812...	embed
45681982_c0	45681982	haskell	0	Title: is it possible to make program aliases in `stack exec`? Problem title: is it possible to make program aliases in `stack exec`? Tags: haskell-stack, haskell Problem: is it possible to make program aliases in `stack exec`? I have a project that has many small executable targets. It takes quite a lot of time whenev...	is it possible to make program aliases in `stack exec`? is it possible to make program aliases in `stack exec`? haskell-stack haskell PATH is it possible to make program aliases in `stack exec`? I have a project that has many small executable targets. It takes quite a lot of time whenever the source code changes due to...	[ 0.003997802734375, -0.00543212890625, 0.007781982421875, 0.0390625, -0.00823974609375, 0.01483154296875, -0.0269775390625, 0.02197265625, -0.0103759765625, -0.00201416015625, -0.00421142578125, 0.01336669921875, -0.006195068359375, 0.0177001953125, 0.00634765625, 0.001129150390625, 0...	[ 83, 7722, 3249, 1528, 55109, 90, 23, 590, 2594, 1119, 3240, 1556, 142508, 436, 139909, 442, 13452, 5941, 19336, 71924, 2886, 30388, 5915, 31344, 18151, 65572, 2967, 33976, 11907, 98927, 13566, 1632, 11001, 28288, 10002, 123166, 175199, 9351, ...	[ 0.009765625, 0.172607421875, 0.12939453125, 0.215087890625, 0.25390625, 0.2003173828125, 0.058380126953125, 0.1495361328125, 0.1676025390625, 0.1368408203125, 0.236572265625, 0.0814208984375, 0.207275390625, 0.042694091796875, 0.1568603515625, 0.01495361328125, 0.084228515625, 0.02...	embed
51661192_c0	51661192	haskell	0	Title: How do you get getLine to accept unicode characters? Problem title: How do you get getLine to accept unicode characters? Tags: windows, unicode, haskell, encoding, console Problem: How do you get getLine to accept unicode characters? When running the following code do line <- getLine putStrLn line or, getLine >>...	How do you get getLine to accept unicode characters? How do you get getLine to accept unicode characters? windows unicode haskell encoding console How utf8 NIL ghci.exe PROGRAMS Haskell Platform GHC.IO.Encoding.getLocaleEncoding UTF-8 System.IO.hGetEncoding Just How do you get getLine to accept unicode characters? When...	[ -0.01531982421875, -0.002410888671875, 0.018798828125, 0.01513671875, 0.000827789306640625, 0.00124359130859375, 0.032958984375, -0.00933837890625, -0.0198974609375, -0.003021240234375, -0.01275634765625, -0.0108642578125, -0.0057373046875, -0.0162353515625, -0.0030670166015625, 0.0120...	[ 11249, 2046, 93232, 47, 26946, 60347, 112, 124850, 54825, 1556, 142508, 22, 587, 130250, 486, 420, 1019, 16444, 31380, 318, 46480, 59677, 20625, 70968, 527, 73265, 17780, 7768, 3794, 203758, 30992, 17376, 12353, 127, 724, 126, 51042, 25632, ...	[ 0.0283203125, 0.1649169921875, 0.283935546875, 0.085205078125, 0.226318359375, 0.2210693359375, 0.19580078125, 0.211181640625, 0.0958251953125, 0.0789794921875, 0.1748046875, 0.08251953125, 0.1749267578125, 0.131591796875, 0.05682373046875, 0.0784912109375, 0.1776123046875, 0.06585...	embed
19892288_c0	19892288	haskell	0	Title: HandsomeSoup: Getting basic example to work Problem title: HandsomeSoup: Getting basic example to work Tags: html-parsing, hxt, haskell Problem: HandsomeSoup: Getting basic example to work I am trying to get the basic example from http://egonschiele.github.io/HandsomeSoup/ to work: main = do doc <- fromUrl "http...	HandsomeSoup: Getting basic example to work HandsomeSoup: Getting basic example to work html-parsing hxt haskell Text.HandsomeSoup Text.XML.HXT.Core Control.Monad HandsomeSoup Getting www.google.com h3.r mapM_ Main Main.hs Main.hs:8:21 Couldn IOSLA XIOState XmlTree hxt-9.3.0.1:Data.Tree.NTree.TypeDefs.NTree hxt-9.3.0.1...	[ -0.0029754638671875, -0.005035400390625, -0.00177001953125, -0.0125732421875, -0.013671875, 0.024169921875, 0.003631591796875, -0.006988525390625, 0.00213623046875, -0.060791015625, -0.0224609375, -0.039794921875, -0.00787353515625, -0.00537109375, 0.0033111572265625, -0.0108642578125,...	[ 10639, 43452, 8912, 2037, 210732, 62822, 27781, 47, 4488, 12, 7693, 2500, 1096, 29062, 1556, 142508, 24129, 135679, 39456, 841, 70981, 27131, 46674, 712, 1426, 59875, 277, 363, 42, 22288, 594, 12321, 127, 1019, 25619, 191147, 62390, 8356, 1...	[ 0.1873779296875, 0.2225341796875, 0.1546630859375, 0.20556640625, 0.07403564453125, 0.1717529296875, 0.263671875, 0.049530029296875, 0.12890625, 0.006591796875, 0.125, 0.06768798828125, 0.04852294921875, 0.1446533203125, 0.11181640625, 0.2034912109375, 0.0914306640625, 0.1572265625...	embed
22580260_c0	22580260	haskell	0	Title: Interactive Process Communication in Haskell Problem title: Interactive Process Communication in Haskell Tags: haskell, ipc Problem: Interactive Process Communication in Haskell I am trying to write a Haskell program that executes an interactive program (also written in Haskell), sending and receiving lines of t...	Interactive Process Communication in Haskell Interactive Process Communication in Haskell haskell ipc Interactive Process Communication Haskell PlayerMain LineBuffering NoBuffering Interactive Process Communication in Haskell I am trying to write a Haskell program that executes an interactive program (also written in H...	[ -0.008056640625, 0.0013580322265625, 0.0079345703125, 0.01531982421875, -0.0152587890625, 0.014404296875, -0.007110595703125, -0.0004119873046875, 0.00072479248046875, -0.019287109375, -0.006500244140625, 0.01324462890625, -0.00165557861328125, 0.0177001953125, -0.0023040771484375, 0.0...	[ 5337, 71232, 123996, 87398, 23, 20625, 142508, 1556, 57095, 60560, 168793, 16777, 7235, 18234, 438, 31577, 33022, 1528, 71924, 212398, 59121, 135834, 136, 217063, 124519, 7986, 12301, 6138, 4153, 71, 79858, 5570, 35773, 77443, 1286, 96704, 1453...	[ 0.1395263671875, 0.1385498046875, 0.2030029296875, 0.2215576171875, 0.04876708984375, 0.155029296875, 0.2288818359375, 0.109375, 0.12353515625, 0.1318359375, 0.05657958984375, 0.1143798828125, 0.05645751953125, 0.1488037109375, 0.0904541015625, 0.03814697265625, 0.0816650390625, 0....	embed
41798769_c0	41798769	haskell	0	Title: Haskell GHC create executable not depending on GMP? Problem title: Haskell GHC create executable not depending on GMP? Tags: haskell Problem: Haskell GHC create executable not depending on GMP? I have a simple program that doesn't appear to use libgmp at all. -- Sample.hs main = putStrLn "hi" If I compile it usi...	Haskell GHC create executable not depending on GMP? Haskell GHC create executable not depending on GMP? haskell Haskell GHC GMP Sample.hs Sample linux-vdso.so.1 libgmp.so.10 lib64 libm.so.6 librt.so.1 libdl.so.2 libc.so.6 ld-linux-x86-64.so.2 libpthread.so.0 libgmp.so Integer Haskell GHC create executable not depending...	[ -0.0245361328125, -0.0006103515625, 0.0029754638671875, 0.01214599609375, -0.00031280517578125, 0.0224609375, -0.01361083984375, -0.000804901123046875, -0.007171630859375, -0.01177978515625, 0.00469970703125, -0.0184326171875, -0.0062255859375, 0.004364013671875, -0.0152587890625, 0.01...	[ 20625, 142508, 527, 73265, 28282, 71924, 2886, 959, 8, 96819, 98, 9088, 1556, 947, 33209, 127, 11508, 6077, 59805, 991, 418, 25474, 177, 2676, 963, 13307, 39, 910, 3198, 20469, 304, 2397, 15276, 39116, 2389, 44401, 8781, 1528, 22027, 18, ...	[ 0.1180419921875, 0.2200927734375, 0.09320068359375, 0.2059326171875, 0.135498046875, 0.19091796875, 0.16162109375, 0.1190185546875, 0.059906005859375, 0.1337890625, 0.0285186767578125, 0.218994140625, 0.08978271484375, 0.135986328125, 0.24560546875, 0.096435546875, 0.05517578125, 0...	embed
3015962_c0	3015962	haskell	0	Title: Zipping with padding in Haskell Problem title: Zipping with padding in Haskell Tags: functional-programming, haskell Problem: Zipping with padding in Haskell A couple of times I've found myself wanting a zip in Haskell that adds padding to the shorter list instead of truncating the longer one. This is easy enoug...	Zipping with padding in Haskell Zipping with padding in Haskell functional-programming haskell Zipping Haskell Monoid x:xs y:ys zipPad3 zip3 z:zs Zipping with padding in Haskell A couple of times I've found myself wanting a zip in Haskell that adds padding to the shorter list instead of truncating the longer one. This ...	[ -0.01080322265625, 0.00994873046875, 0.000705718994140625, 0.006683349609375, -0.01263427734375, 0.01611328125, -0.01007080078125, -0.0133056640625, 0.01397705078125, -0.0050048828125, -0.0142822265625, -0.021728515625, 0.01275634765625, 0.0135498046875, -0.002960205078125, 0.004516601...	[ 9315, 26783, 678, 249, 59725, 20625, 142508, 123309, 28966, 1556, 77879, 532, 4778, 68330, 113954, 363, 97, 24941, 3444, 23, 15190, 16610, 5303, 64457, 14617, 16336, 51713, 23468, 43240, 27875, 80854, 4527, 51515, 110608, 61924, 10644, 22027, ...	[ 0.1781005859375, 0.1348876953125, 0.067138671875, 0.1605224609375, 0.1788330078125, 0.1248779296875, 0.2249755859375, 0.0985107421875, 0.05810546875, 0.1053466796875, 0.1328125, 0.10479736328125, 0.0233917236328125, 0.2166748046875, 0.2174072265625, 0.1446533203125, 0.01025390625, ...	embed
40319710_c1	40319710	haskell	1	= let acc' = acc ++ this in if null next then go acc' else yield acc' >> go next breakAfterEOL :: ByteString -> (ByteString, ByteString) breakAfterEOL = uncurry (\x -> maybe (x, "") (first (snoc x)) . uncons) . break (== 10) $ stack ghc --package={classy-prelude-conduit,conduit-extra} -- -O2 example.hs -o example $ fo...	= let acc' = acc ++ this in if null next then go acc' else yield acc' >> go next breakAfterEOL :: ByteString -> (ByteString, ByteString) breakAfterEOL = uncurry (\x -> maybe (x, "") (first (snoc x)) . uncons) . break (== 10) $ stack ghc --package={classy-prelude-conduit,conduit-extra} -- -O2 example.hs -o example $ fo...	[ 0.000247955322265625, 0.0014801025390625, 0.0033416748046875, 0.0146484375, -0.012939453125, 0.013671875, 0.001556396484375, -0.007568359375, 0.0125732421875, -0.01239013671875, -0.017333984375, 0.0108642578125, 0.0093994140625, 0.00823974609375, 0.01544189453125, 0.01348876953125, -...	[ 2203, 2633, 50015, 25, 37223, 903, 23, 2174, 56574, 11737, 738, 37076, 11180, 19388, 36356, 46327, 647, 22323, 1984, 3311, 67, 71713, 214, 33079, 75358, 51, 64240, 425, 51139, 13448, 54387, 1022, 25553, 69112, 209, 177261, 31380, 238, 29102...	[ 0.06072998046875, 0.0933837890625, 0.12646484375, 0.0989990234375, 0.154541015625, 0.0635986328125, 0.04449462890625, 0.090576171875, 0.2462158203125, 0.17578125, 0.08880615234375, 0.0219879150390625, 0.1201171875, 0.1402587890625, 0.1771240234375, 0.185546875, 0.033203125, 0.22448...	embed
79527347_c0	79527347	haskell	0	Title: How to select all text inside an input element with Reflex DOM Problem title: How to select all text inside an input element with Reflex DOM Tags: frp, haskell, reflex-dom, reflex Problem: How to select all text inside an input element with Reflex DOM I have the following function to create an input element: mkI...	How to select all text inside an input element with Reflex DOM How to select all text inside an input element with Reflex DOM frp haskell reflex-dom reflex How Reflex DOM DomBuilder PostBuild T.Text InputElement EventResult DomBuilderSpace inputElementConfig_initialValue input._inputElement_hasFocus input.focus How to ...	[ -0.00738525390625, -0.0025634765625, -0.00665283203125, 0.0025787353515625, -0.01220703125, -0.0172119140625, 0.00012874603271484375, -0.00118255615234375, -0.0020599365234375, -0.0272216796875, 0.03759765625, 0.00128173828125, -0.0255126953125, 0.03466796875, -0.0067138671875, -0.0017...	[ 11249, 36849, 756, 7986, 46132, 107730, 12830, 678, 179043, 69285, 14119, 1556, 142508, 71181, 3815, 9343, 121137, 2795, 174379, 7077, 19929, 36943, 7, 7136, 141012, 83671, 50770, 73, 10557, 27591, 11680, 3584, 32354, 28282, 18158, 3934, 27289,...	[ 0.032684326171875, 0.21240234375, 0.1883544921875, 0.21728515625, 0.19189453125, 0.2281494140625, 0.1767578125, 0.037628173828125, 0.27197265625, 0.20263671875, 0.008209228515625, 0.0809326171875, 0.1651611328125, 0.2325439453125, 0.1175537109375, 0.1026611328125, 0.1160888671875, ...	embed
60265599_c0	60265599	haskell	0	Title: Make Postgresql.Simple query results available to rest of .hs file Problem title: Make Postgresql.Simple query results available to rest of .hs file Tags: haskell Problem: Make Postgresql.Simple query results available to rest of .hs file I have a sensor that puts values in a postgres table and im using postgres...	Make Postgresql.Simple query results available to rest of .hs file Make Postgresql.Simple query results available to rest of .hs file haskell lightbool Make Postgresql.Simple mapM_ query_ sensor1 Only Bool myHost.rds.amazonaws.com Make Postgresql.Simple query results available to rest of .hs file I have a sensor that p...	[ 0.0164794921875, 0.02001953125, -0.0045166015625, 0.0011138916015625, 0.00848388671875, -0.003631591796875, 0.007659912109375, -0.02978515625, 0.0067138671875, -0.0101318359375, -0.00469970703125, -0.0167236328125, -0.00872802734375, -0.0027618408203125, -0.010009765625, 0.024658203125...	[ 26176, 2795, 17562, 99247, 8859, 33209, 41, 1294, 50339, 19882, 10588, 127, 7, 11435, 5, 1556, 142508, 22729, 142484, 22288, 594, 43111, 418, 87293, 2460, 929, 759, 11193, 2887, 19725, 142424, 23180, 1305, 191560, 12301, 5201, 17780, 32354, ...	[ 0.0601806640625, 0.06280517578125, 0.1463623046875, 0.15625, 0.1336669921875, 0.21630859375, 0.110595703125, 0.06292724609375, 0.1817626953125, 0.125244140625, 0.1031494140625, 0.122314453125, 0.1146240234375, 0.10382080078125, 0.0143890380859375, 0.1104736328125, 0.2249755859375, ...	embed
61495045_c0	61495045	haskell	0	Title: How to have Haskell Data.Map module available for import with stack tool and environment? Problem title: How to have Haskell Data.Map module available for import with stack tool and environment? Tags: haskell, haskell-stack Problem: How to have Haskell Data.Map module available for import with stack tool and env...	How to have Haskell Data.Map module available for import with stack tool and environment? How to have Haskell Data.Map module available for import with stack tool and environment? haskell haskell-stack with the How Haskell Data.Map package.yaml SpaceAge Wall List Tests.hs space-age-1.2.0.6 stack.yaml lts-15.8 How to ha...	[ -0.006744384765625, 0.002655029296875, 0.002288818359375, -0.0074462890625, -0.0034637451171875, 0.00830078125, 0.0020904541015625, 0.005035400390625, -0.0054931640625, 0.006561279296875, 0.010498046875, -0.02978515625, 0.0054931640625, 0.0225830078125, -0.003204345703125, 0.0104370117...	[ 11249, 765, 20625, 142508, 11809, 5, 166179, 88996, 19882, 24927, 678, 177261, 55516, 65998, 136, 1556, 590, 2594, 98169, 14520, 141, 43045, 284, 429, 23706, 32036, 8647, 127, 32628, 4588, 48400, 122887, 933, 13386, 1019, 1884, 17368, 154107,...	[ 0.07586669921875, 0.05401611328125, 0.1478271484375, 0.238525390625, 0.18896484375, 0.0271148681640625, 0.25048828125, 0.2071533203125, 0.12841796875, 0.2177734375, 0.1134033203125, 0.2132568359375, 0.16357421875, 0.1513671875, 0.03485107421875, 0.11474609375, 0.1016845703125, 0.11...	embed
39932707_c1	39932707	haskell	1	$ BL.fromStrict bs -- should read BytesString and return Word32 transform :: (Monad m, MonadResource m) => Conduit BS.ByteString m Word32 transform = do mbs <- await case mbs of Just bs -> do case C.null bs of False -> do yield $ getWord32 bs leftover $ BS.drop 4 bs transform True -> return () Nothing -> return () mai...	$ BL.fromStrict bs -- should read BytesString and return Word32 transform :: (Monad m, MonadResource m) => Conduit BS.ByteString m Word32 transform = do mbs <- await case mbs of Just bs -> do case C.null bs of False -> do yield $ getWord32 bs leftover $ BS.drop 4 bs transform True -> return () Nothing -> return () mai...	[ -0.01446533203125, 0.0196533203125, 0.005096435546875, -0.01141357421875, 0.0166015625, 0.0146484375, 0.018798828125, 0.00177764892578125, 0.0166015625, -0.0247802734375, 0.01318359375, -0.00482177734375, 0.00604248046875, -0.0029296875, -0.001953125, 0.00885009765625, -0.00848388671...	[ 3650, 68170, 5, 161063, 62233, 18, 876, 7, 5608, 12301, 3311, 1636, 71713, 214, 30646, 22543, 6460, 27198, 46674, 712, 347, 60331, 71, 4332, 60427, 16, 1657, 112061, 84145, 75358, 67, 39369, 10, 634, 217, 7225, 9563, 313, 139550, 22225, ...	[ 0.015106201171875, 0.1485595703125, 0.0267181396484375, 0.186279296875, 0.191162109375, 0.1395263671875, 0.110107421875, 0.1474609375, 0.06903076171875, 0.165771484375, 0.10284423828125, 0.1087646484375, 0.1558837890625, 0.05499267578125, 0.1024169921875, 0.1866455078125, 0.278808593...	embed
74634387_c0	74634387	haskell	0	Title: How to check instance of fractional class for zero value in haskell? Problem title: How to check instance of fractional class for zero value in haskell? Tags: haskell Problem: How to check instance of fractional class for zero value in haskell? If i have a value which is restricted to be fractional, is there a w...	How to check instance of fractional class for zero value in haskell? How to check instance of fractional class for zero value in haskell? haskell the How safe_idv Fractional Maybe safe_div Result Err Could AST2.hs:11:1-48 Possible How to check instance of fractional class for zero value in haskell? If i have a value wh...	[ -0.0220947265625, -0.006866455078125, 0.01458740234375, -0.0159912109375, -0.01025390625, 0.01007080078125, 0.004547119140625, -0.02392578125, -0.0150146484375, 0.002899169921875, -0.02001953125, 0.01123046875, 0.00927734375, -0.022705078125, 0.0030670166015625, -0.0130615234375, 0.0...	[ 11249, 12765, 110527, 175921, 289, 18507, 100, 45234, 34292, 1556, 142508, 47, 111, 23, 70, 46002, 334, 7868, 10763, 83425, 30618, 126684, 1004, 191147, 48963, 5442, 19993, 19721, 9285, 115861, 173072, 186, 3917, 442, 8035, 62276, 29479, 9185...	[ 0.0343017578125, 0.2158203125, 0.2310791015625, 0.2347412109375, 0.119384765625, 0.21240234375, 0.0595703125, 0.208251953125, 0.1781005859375, 0.1297607421875, 0.2239990234375, 0.01922607421875, 0.04486083984375, 0.0367431640625, 0.01513671875, 0.158447265625, 0.11328125, 0.1679687...	embed
79307665_c1	79307665	haskell	1	if ptr > 0 then arr else 0 : arr) (if ptr > 0 then ptr - 1 else 0) code pairs (current + 1) '>' -> BrainfuckRec (if ptr == (length arr) - 1 then arr ++ [0] else arr) (ptr + 1) code pairs (current + 1) '[' -> BrainfuckRec arr ptr code pairs (fst (pairs !! (findIndex ((== current) . snd) pairs))) ']' -> BrainfuckRec arr ...	if ptr > 0 then arr else 0 : arr) (if ptr > 0 then ptr - 1 else 0) code pairs (current + 1) '>' -> BrainfuckRec (if ptr == (length arr) - 1 then arr ++ [0] else arr) (ptr + 1) code pairs (current + 1) '[' -> BrainfuckRec arr ptr code pairs (fst (pairs !! (findIndex ((== current) . snd) pairs))) ']' -> BrainfuckRec arr ...	[ -0.0013275146484375, 0.002410888671875, 0.005828857421875, 0.0238037109375, 0.0164794921875, 0.021728515625, -0.005889892578125, -0.01080322265625, 0.0115966796875, -0.01385498046875, -0.0096435546875, -0.0028076171875, -0.022705078125, -0.003143310546875, -0.025390625, -0.029541015625...	[ 2174, 27037, 42, 977, 757, 7068, 187, 37076, 3190, 106, 18151, 80836, 163812, 997, 4879, 2740, 6163, 73, 93476, 4332, 238, 69112, 23986, 37223, 147352, 6328, 271, 109637, 6506, 111607, 39659, 43581, 2208, 3884, 84068, 147, 30646, 4711, 1077...	[ 0.05548095703125, 0.162841796875, 0.17919921875, 0.06170654296875, 0.153076171875, 0.001708984375, 0.1407470703125, 0.0697021484375, 0.020904541015625, 0.078857421875, 0.1834716796875, 0.2056884765625, 0.1737060546875, 0.0660400390625, 0.0716552734375, 0.0660400390625, 0.117309570312...	embed
30884995_c0	30884995	haskell	0	Title: Which language and lib is better suited for high-performant network devices polling server (SNMP)? Problem title: Which language and lib is better suited for high-performant network devices polling server (SNMP)? Tags: c, snmp, haskell, erlang, c%2B%2B Problem: Which language and lib is better suited for high-pe...	Which language and lib is better suited for high-performant network devices polling server (SNMP)? Which language and lib is better suited for high-performant network devices polling server (SNMP)? c snmp haskell erlang c%2B%2B Which SNMP Which language and lib is better suited for high-performant network devices polli...	[ -0.00075531005859375, 0.003814697265625, 0.0030059814453125, 0.029052734375, -0.005035400390625, -0.00677490234375, -0.01171875, 0.00176239013671875, -0.000396728515625, -0.0311279296875, 0.024169921875, 0.00592041015625, 0.021728515625, -0.00726318359375, 0.01019287109375, 0.010192871...	[ 46876, 136, 25474, 11522, 14947, 71, 11192, 1264, 5037, 33120, 128779, 160, 30319, 10723, 61533, 9088, 100, 501, 91, 19, 2676, 1556, 142508, 72, 3066, 130078, 101176, 20697, 97204, 29806, 4488, 67241, 50986, 59121, 98, 145581, 17368, 27512, ...	[ 0.2119140625, 0.0599365234375, 0.18896484375, 0.14501953125, 0.1611328125, 0.00567626953125, 0.09326171875, 0.029998779296875, 0.11376953125, 0.1080322265625, 0.1365966796875, 0.174072265625, 0.1878662109375, 0.176025390625, 0.119873046875, 0.255859375, 0.030120849609375, 0.0838623...	embed
57834521_c0	57834521	haskell	0	Title: Why do we need `startWatching` function from WalletApi? Problem title: Why do we need `startWatching` function from WalletApi? Tags: cardano, smartcontracts, plutus, haskell Problem: Why do we need `startWatching` function from WalletApi? In plutus playground in game example there is a function -- \| The "startGa...	Why do we need `startWatching` function from WalletApi? Why do we need `startWatching` function from WalletApi? cardano smartcontracts plutus haskell WalletApi Why See Contract MonadWallet API Player Why do we need `startWatching` function from WalletApi? In plutus playground in game example there is a function I don't...	[ -0.016845703125, 0.015380859375, 0.0166015625, -0.005859375, 0.0157470703125, 0.01611328125, -0.0130615234375, -0.0076904296875, 0.0091552734375, -0.016357421875, 0.005828857421875, 0.0157470703125, -0.013916015625, 0.01611328125, 0.01141357421875, -0.0184326171875, 0.04248046875, ...	[ 44084, 54, 642, 3871, 17137, 156378, 214, 32354, 1295, 23706, 126, 284, 1434, 20596, 3922, 18775, 184103, 12266, 2143, 1556, 142508, 6872, 149957, 60331, 71, 198076, 61687, 60560, 11301, 64330, 6712, 27781, 2301, 18, 1884, 6183, 3917, 37067, ...	[ 0.1199951171875, 0.01806640625, 0.0143585205078125, 0.1463623046875, 0.2054443359375, 0.28955078125, 0.146728515625, 0.1912841796875, 0.0298614501953125, 0.1158447265625, 0.08624267578125, 0.136962890625, 0.20849609375, 0.0322265625, 0.1361083984375, 0.0721435546875, 0.1654052734375,...	embed
19383237_c1	19383237	haskell	1	3 -- from the xev data keysToAdd x = [ ((mod4Mask, xK_F4 ), kill) , ((0, xF86XK_Calculator ), spawn "mate-calculator") , ((0, xF86XK_WWW ), spawn "firefox") , ((0, xF86XK_HomePage ), spawn "caja") , ((0, xK_Print ), spawn "mate-screenshot") , ((mod4Mask, xK_z ), spawn "emacs") ] ++ [((m .\|. homeMask, k), windows $ f i)...	3 -- from the xev data keysToAdd x = [ ((mod4Mask, xK_F4 ), kill) , ((0, xF86XK_Calculator ), spawn "mate-calculator") , ((0, xF86XK_WWW ), spawn "firefox") , ((0, xF86XK_HomePage ), spawn "caja") , ((0, xK_Print ), spawn "mate-screenshot") , ((mod4Mask, xK_z ), spawn "emacs") ] ++ [((m .\|. homeMask, k), windows $ f i)...	[ -0.004119873046875, 0.037353515625, -0.0047607421875, -0.022216796875, 0.0038909912109375, -0.0115966796875, 0.00927734375, -0.018798828125, 0.0126953125, -0.0311279296875, 0.0238037109375, 0.0128173828125, -0.00372314453125, 0.000392913818359375, -0.015625, -0.0145263671875, -0.0270...	[ 138, 4210, 1295, 4449, 334, 2053, 22799, 7, 7763, 284, 4028, 1022, 2203, 13415, 617, 53049, 92, 605, 919, 67153, 2389, 15276, 1542, 94553, 16735, 1290, 5623, 7710, 15829, 6827, 95162, 73702, 147797, 55376, 147101, 408, 145, 112079, 86667, ...	[ 0.10369873046875, 0.04254150390625, 0.09429931640625, 0.141357421875, 0.260986328125, 0.1697998046875, 0.249267578125, 0.0814208984375, 0.1622314453125, 0.10247802734375, 0.2142333984375, 0.176025390625, 0.0072021484375, 0.1588134765625, 0.11279296875, 0.1453857421875, 0.095336914062...	embed
21386451_c0	21386451	haskell	0	Title: http-conduit TLSSettingsSimple and error EOF problems Problem title: http-conduit TLSSettingsSimple and error EOF problems Tags: haskell, http-conduit Problem: http-conduit TLSSettingsSimple and error EOF problems I'm still a haskell newbie but i'm attempting a simple http-conduit example" import Network.HTTP.Co...	http-conduit TLSSettingsSimple and error EOF problems http-conduit TLSSettingsSimple and error EOF problems haskell http-conduit Network.HTTP.Conduit qualified TLSSettingsSimple EOF Data.ByteString.Lazy var2 Nothing github.com var3 blah_request_goes_here Exception Error_EOF http-conduit TLSSettingsSimple and error EOF ...	[ -0.00183868408203125, 0.010498046875, -0.0035247802734375, -0.003173828125, 0.00102996826171875, 0.019287109375, -0.005706787109375, 0.000499725341796875, 0.011474609375, 0.0103759765625, 0.0181884765625, -0.017578125, 0.018798828125, -0.010986328125, 0.00640869140625, -0.0005645751953...	[ 1621, 2271, 112061, 20602, 294, 105548, 33209, 136, 18499, 241, 82341, 44402, 1556, 142508, 28997, 23658, 11935, 217225, 11809, 71713, 2729, 3285, 285, 304, 182747, 62270, 32102, 363, 9932, 75616, 35593, 63928, 212059, 647, 9014, 81887, 8781, ...	[ 0.1629638671875, 0.0892333984375, 0.22509765625, 0.145751953125, 0.06195068359375, 0.195068359375, 0.1356201171875, 0.0236358642578125, 0.1739501953125, 0.087646484375, 0.297607421875, 0.122314453125, 0.09088134765625, 0.2010498046875, 0.049224853515625, 0.0258636474609375, 0.0739746...	embed
65327650_c1	65327650	haskell	1	Extra files to be distributed with the package, such as examples or a -- README. extra-source-files: README.md, ChangeLog.md -- Constraint on the version of Cabal needed to build this package. cabal-version: >=1.10 executable lsql-csv -- .hs or .lhs file containing the Main module. main-is: Main.hs ghc-options: -O3 --...	Extra files to be distributed with the package, such as examples or a -- README. extra-source-files: README.md, ChangeLog.md -- Constraint on the version of Cabal needed to build this package. cabal-version: >=1.10 executable lsql-csv -- .hs or .lhs file containing the Main module. main-is: Main.hs ghc-options: -O3 --...	[ 0.007720947265625, 0.0012359619140625, 0.01165771484375, 0.000720977783203125, 0.00518798828125, -0.000629425048828125, -0.0262451171875, -0.007049560546875, -0.003265380859375, 0.013427734375, -0.007659912109375, -0.054443359375, 0.010009765625, 0.0166015625, -0.007354736328125, -0.01...	[ 31501, 102158, 47, 15917, 3674, 678, 98169, 4, 27781, 7, 188300, 10611, 4173, 60427, 29822, 5, 54686, 87377, 113972, 1657, 2816, 4288, 70, 11389, 30438, 289, 44841, 45367, 903, 109524, 46354, 963, 71924, 96, 99247, 9, 4439, 334, 4210, 127...	[ 0.1888427734375, 0.247314453125, 0.021331787109375, 0.2291259765625, 0.0777587890625, 0.10302734375, 0.241943359375, 0.00311279296875, 0.1407470703125, 0.025146484375, 0.1395263671875, 0.1988525390625, 0.1658935546875, 0.157470703125, 0.1856689453125, 0.003875732421875, 0.12866210937...	embed
55779190_c1	55779190	haskell	1	sha256:f90d6ab73ad35c749e8547ca132e7ab5d32d2f8e7bb2e2ff6d597be26b58e061 - transformers-compat-0.5.1.4@sha256:1b4bfa8589afb1ca0e719129ab261bd90ef0cc3e6c0b9963f94970c082b61250 output from stack build : F:\Projects\Haskell\my-happstack>stack build Error: While constructing the build plan, the following exceptions were enc...	0.4.5.2 Some Set config.yaml Consider Recommended stack.yaml Win32-2.8.3.0 sha256:58fa6f52e8a0d455a74bb19445c177f2cc79a0975cae5fd96e2334bd38a516d4 transformers-compat-0.6.4 sha256:d298cd9d1bb7b05160229e244436bae825b53660865e3d5fd695ea0fafec1e6f Plan How to resolve dependency tree with different version ranges of same p...	[ -0.01708984375, 0.0004596710205078125, 0.0155029296875, 0.00004100799560546875, 0.00762939453125, -0.004974365234375, -0.013916015625, -0.005462646484375, 0.017822265625, 0.030517578125, 0.0174560546875, -0.0133056640625, 0.0306396484375, -0.00118255615234375, 0.01123046875, -0.0007438...	[ 121254, 158296, 31384, 19943, 153837, 14520, 141, 137399, 89002, 106133, 177261, 17686, 6460, 82295, 132265, 9638, 127892, 33593, 151210, 124618, 2485, 617, 27198, 1314, 4453, 122887, 17928, 5586, 103608, 42548, 27771, 53201, 678, 12921, 11389, 3...	[ 0.12548828125, 0.1375732421875, 0.065185546875, 0.1353759765625, 0.198486328125, 0.168701171875, 0.1722412109375, 0.072509765625, 0.042938232421875, 0.065185546875, 0.236328125, 0.00372314453125, 0.10369873046875, 0.1688232421875, 0.1375732421875, 0.0546875, 0.1585693359375, 0.0224...	embed
56672750_c0	56672750	haskell	0	Title: Partitioning a String into more pieces with separating char in Haskell Problem title: Partitioning a String into more pieces with separating char in Haskell Tags: haskell, list, function Problem: Partitioning a String into more pieces with separating char in Haskell I have the following homework: Define a functi...	Partitioning a String into more pieces with separating char in Haskell Partitioning a String into more pieces with separating char in Haskell haskell list function Partitioning Haskell Examples Char my_tail Partitioning a String into more pieces with separating char in Haskell I have the following homework: I have writ...	[ 0.0033111572265625, -0.00921630859375, -0.001983642578125, 0.0189208984375, -0.026123046875, 0.0201416015625, -0.005523681640625, -0.015625, 0.008056640625, -0.0186767578125, 0.00058746337890625, -0.0281982421875, -0.0115966796875, 0.0107421875, -0.011474609375, 0.00946044921875, 0.0...	[ 9148, 1363, 23351, 214, 3934, 1286, 126371, 678, 38310, 21441, 20625, 142508, 1556, 5303, 32354, 89536, 21656, 759, 46741, 5368, 18244, 59121, 25632, 14602, 959, 9969, 1340, 831, 1957, 15400, 46673, 1456, 979, 133, 15190, 756, 124850, 501, ...	[ 0.2054443359375, 0.1246337890625, 0.19775390625, 0.0770263671875, 0.1153564453125, 0.1260986328125, 0.179931640625, 0.023406982421875, 0.19873046875, 0.162353515625, 0.1121826171875, 0.21826171875, 0.09326171875, 0.15576171875, 0.156005859375, 0.06207275390625, 0.1182861328125, 0.1...	embed
36773098_c1	36773098	haskell	1	class above), but this has led to a bunch of fairly similar typeclasses that exist only to reify the type as singleton data. I thought maybe I could abstract those multiple typeclasses into a single type family, for example replacing SBool and Boolean above with: {-# LANGUAGE PolyKinds #-} {-# LANGUAGE ConstraintKinds...	class above), but this has led to a bunch of fairly similar typeclasses that exist only to reify the type as singleton data. I thought maybe I could abstract those multiple typeclasses into a single type family, for example replacing SBool and Boolean above with: {-# LANGUAGE PolyKinds #-} {-# LANGUAGE ConstraintKinds...	[ -0.00469970703125, 0.00457763671875, 0.000514984130859375, -0.0255126953125, -0.01141357421875, -0.008544921875, -0.0147705078125, -0.007354736328125, 0.00113677978515625, 0.01190185546875, -0.00494384765625, -0.0164794921875, -0.01171875, -0.0101318359375, -0.010009765625, 0.000789642...	[ 18507, 36917, 1284, 1556, 147306, 180663, 21373, 10644, 67413, 32316, 4734, 456, 40383, 11001, 1507, 2053, 17569, 164789, 48716, 14449, 133266, 90944, 43386, 136, 73783, 34677, 3358, 98064, 75930, 63306, 605, 7250, 2816, 43609, 18, 1984, 472, ...	[ 0.1754150390625, 0.119384765625, 0.006378173828125, 0.00732421875, 0.064453125, 0.04461669921875, 0.1126708984375, 0.23046875, 0.232666015625, 0.0931396484375, 0.0162200927734375, 0.07269287109375, 0.154296875, 0.1490478515625, 0.1907958984375, 0.1270751953125, 0.02886962890625, 0....	embed
45134724_c0	45134724	haskell	0	Title: Haskell: find to 2 numbers from list that add up to target sum Problem title: Haskell: find to 2 numbers from list that add up to target sum Tags: haskell, dynamic Problem: Haskell: find to 2 numbers from list that add up to target sum My aim: given a list of numbers, find the indices of the first pair of number...	Haskell: find to 2 numbers from list that add up to target sum Haskell: find to 2 numbers from list that add up to target sum haskell dynamic list qualified Haskell Data.HashMap M.empty M.lookup Just Nothing M.insert Haskell: find to 2 numbers from list that add up to target sum My aim: given a list of numbers, find th...	[ -0.035400390625, -0.0007781982421875, 0.007598876953125, 0.00052642822265625, -0.021240234375, 0.0159912109375, -0.004058837890625, 0.006744384765625, 0.0169677734375, -0.0247802734375, 0.0213623046875, -0.010009765625, 0.015625, 0.02880859375, 0.01904296875, -0.01312255859375, 0.006...	[ 20625, 142508, 7413, 47, 116, 101935, 1295, 5303, 450, 15190, 1257, 30388, 10554, 1556, 84079, 217225, 11809, 6495, 1495, 166179, 276, 33548, 64747, 2037, 9563, 182747, 73, 33657, 464, 34475, 136044, 5117, 80836, 14012, 2967, 26484, 40899, 50...	[ 0.16064453125, 0.255126953125, 0.1605224609375, 0.1705322265625, 0.1845703125, 0.2132568359375, 0.1256103515625, 0.2010498046875, 0.022064208984375, 0.1646728515625, 0.15771484375, 0.2445068359375, 0.216552734375, 0.1513671875, 0.1568603515625, 0.182373046875, 0.0821533203125, 0.13...	embed
49310194_c0	49310194	haskell	0	Title: How can I query RDF data using Haskell? Problem title: How can I query RDF data using Haskell? Tags: haskell, rdf, xml Problem: How can I query RDF data using Haskell? I'm a Haskell beginner. I have RDF XML from Project Gutenberg that looks like this: <?xml version="1.0" encoding="utf-8"?> <rdf:RDF xml:base="htt...	How can I query RDF data using Haskell? How can I query RDF data using Haskell? haskell rdf xml Haskell Anne How RDF utf-8 rdf:RDF xml:base www.gutenberg.org xmlns:rdf www.w3.org xmlns:dcterms purl.org xmlns:cc web.resource.org xmlns:dcam xmlns:rdfs xmlns:pgterms cc:Work rdf:about rdfs:comment Archives Gutenberg:Feeds ...	[ -0.00153350830078125, 0.023681640625, 0.003204345703125, 0.006134033203125, 0.0213623046875, -0.01263427734375, -0.0203857421875, -0.0203857421875, -0.0169677734375, -0.0537109375, 0.02099609375, -0.052978515625, -0.017822265625, -0.0179443359375, 0.002838134765625, 0.02099609375, -0...	[ 11249, 831, 87, 41, 1294, 627, 38997, 2053, 17368, 20625, 142508, 32, 1556, 4216, 420, 131492, 14245, 486, 17376, 12, 40756, 919, 37382, 1234, 150242, 1478, 1779, 363, 71, 147617, 4432, 7398, 141, 10060, 60427, 9779, 17447, 177, 32166, 10...	[ 0.083251953125, 0.0994873046875, 0.052154541015625, 0.16650390625, 0.151611328125, 0.1541748046875, 0.30078125, 0.2147216796875, 0.0975341796875, 0.1610107421875, 0.270751953125, 0.01141357421875, 0.1357421875, 0.1512451171875, 0.2015380859375, 0.2373046875, 0.1578369140625, 0.0579...	embed
29546721_c0	29546721	haskell	0	Title: How to parse multiple lines with start and end tokens in Parsec Problem title: How to parse multiple lines with start and end tokens in Parsec Tags: parsec, haskell Problem: How to parse multiple lines with start and end tokens in Parsec I am new at Parsec . Will appreciate pointers for the problem here. Say, I ...	How to parse multiple lines with start and end tokens in Parsec How to parse multiple lines with start and end tokens in Parsec parsec haskell How Parsec How to parse multiple lines with start and end tokens in Parsec I am new at Parsec . Will appreciate pointers for the problem here. Say, I have a csv file with fixed ...	[ -0.01507568359375, 0.007598876953125, 0.01031494140625, 0.04443359375, -0.0133056640625, 0.0145263671875, 0.007568359375, -0.00225830078125, 0.000255584716796875, -0.006561279296875, -0.0103759765625, 0.010009765625, -0.0036468505859375, 0.02294921875, 0.006103515625, 0.006683349609375...	[ 11249, 366, 184, 48716, 124519, 678, 4034, 136, 3564, 47, 84694, 2392, 39797, 1556, 142508, 23, 20763, 334, 11435, 188347, 10336, 1314, 6953, 13315, 1884, 6713, 100, 1098, 86595, 2046, 756, 24189, 11737, 351, 33548, 139118, 35604, 107730, 4...	[ 0.048980712890625, 0.171630859375, 0.1136474609375, 0.232177734375, 0.2071533203125, 0.0755615234375, 0.146728515625, 0.1085205078125, 0.164306640625, 0.1038818359375, 0.2109375, 0.13720703125, 0.2435302734375, 0.0765380859375, 0.17724609375, 0.0280609130859375, 0.0289459228515625, ...	embed
20599106_c0	20599106	haskell	0	Title: Get content of Cursor from unnormalized xml Problem title: Get content of Cursor from unnormalized xml Tags: xml, haskell, conduit Problem: Get content of Cursor from unnormalized xml Suppose there is xml file: <span id="assignee-val"> <span class="user-hover" id="issue_summary_assignee_m" rel="m"> <span class="...	Get content of Cursor from unnormalized xml Get content of Cursor from unnormalized xml xml haskell conduit unnormalized Get Cursor issue_summary_assignee_m Value Control.Applicative Data.ByteString.Lazy Text.HTML.DOM Text.XML.Cursor Prelude.map Data.ByteString.Lazy.readFile Get content of Cursor from unnormalized xml ...	[ -0.01165771484375, 0.04052734375, -0.017822265625, 0.0032501220703125, 0.008544921875, 0.00811767578125, -0.01123046875, -0.01904296875, -0.0087890625, -0.0166015625, 0.018798828125, -0.004241943359375, -0.0238037109375, -0.01544189453125, 0.00125885009765625, -0.00799560546875, 0.00...	[ 20779, 10941, 111, 58148, 42, 1295, 51, 33176, 29367, 131492, 1556, 142508, 120565, 31089, 112197, 7, 40255, 13, 39, 190060, 27131, 39179, 11048, 11809, 2729, 3285, 24129, 127068, 127214, 1542, 39456, 474, 4970, 1914, 822, 62346, 39116, 17435...	[ 0.119140625, 0.2264404296875, 0.109375, 0.221435546875, 0.1982421875, 0.1259765625, 0.115966796875, 0.19287109375, 0.1427001953125, 0.2509765625, 0.12109375, 0.2191162109375, 0.191650390625, 0.1407470703125, 0.10400390625, 0.001617431640625, 0.0748291015625, 0.040191650390625, 0....	embed
43056426_c0	43056426	haskell	0	Title: Microservices - using strict types to enforce the API? Problem title: Microservices - using strict types to enforce the API? Tags: json, types, service, microservices, haskell Problem: Microservices - using strict types to enforce the API? I am writing two separate services. The output of the first service feeds...	Microservices - using strict types to enforce the API? Microservices - using strict types to enforce the API? json types service microservices haskell strict Microservices API Application Products Score Microservices - using strict types to enforce the API? I am writing two separate services. The output of the first se...	[ -0.0089111328125, 0.0218505859375, 0.000766754150390625, 0.01708984375, -0.000698089599609375, 0.002593994140625, -0.006317138671875, 0.006988525390625, -0.00244140625, 0.022705078125, 0.014404296875, 0.004974365234375, 0.0012359619140625, 0.007415771484375, 0.0025787353515625, 0.01708...	[ 37992, 22584, 7, 20, 17368, 81113, 52895, 22, 50930, 61687, 32, 47, 1647, 1681, 4516, 11948, 1556, 142508, 104921, 100815, 168071, 32562, 6626, 84797, 11374, 140992, 111, 70, 5117, 61590, 3934, 17932, 151117, 4527, 10, 99764, 35773, 1294, 1...	[ 0.212890625, 0.291259765625, 0.06396484375, 0.0340576171875, 0.1246337890625, 0.26904296875, 0.299560546875, 0.0987548828125, 0.1986083984375, 0.2274169921875, 0.0169677734375, 0.01226806640625, 0.10107421875, 0.1417236328125, 0.170166015625, 0.17626953125, 0.1051025390625, 0.21203...	embed
49211198_c0	49211198	haskell	0	Title: Why is my insertion sort slower than library merge sort on (almost) sorted data? Problem title: Why is my insertion sort slower than library merge sort on (almost) sorted data? Tags: sorting, performance, haskell Problem: Why is my insertion sort slower than library merge sort on (almost) sorted data? The defaul...	Why is my insertion sort slower than library merge sort on (almost) sorted data? Why is my insertion sort slower than library merge sort on (almost) sorted data? sorting performance haskell Why Data.List.sort Ord Mv.IOVector forM_ Mv.length Mv.read x-1 x-2 Sort y:ys Mv.write Why is my insertion sort slower than library...	[ -0.02685546875, 0.0045166015625, 0.012939453125, -0.022216796875, 0.00016498565673828125, 0.01312255859375, -0.0240478515625, -0.032470703125, -0.010498046875, -0.0140380859375, 0.005859375, 0.00897216796875, 0.017578125, -0.004974365234375, -0.0128173828125, -0.0244140625, -0.010375...	[ 44084, 759, 241860, 12096, 72803, 56, 35773, 1294, 42564, 840, 18, 17497, 2053, 98, 71, 214, 23718, 1556, 142508, 11809, 154663, 62351, 35379, 334, 17780, 26455, 18770, 23986, 39116, 1022, 5759, 5428, 53666, 113, 4778, 3501, 114977, 5, 2947...	[ 0.0936279296875, 0.131103515625, 0.21875, 0.245849609375, 0.1949462890625, 0.0894775390625, 0.1383056640625, 0.045867919921875, 0.199462890625, 0.136962890625, 0.04248046875, 0.1859130859375, 0.07763671875, 0.007781982421875, 0.035675048828125, 0.038848876953125, 0.1602783203125, 0...	embed
67626352_c0	67626352	haskell	0	Title: How to do a recursive main function in Haskell Problem title: How to do a recursive main function in Haskell Tags: haskell, recursion Problem: How to do a recursive main function in Haskell So I wanted to make a program that prints out a ASCII triangle. The program asks you the height that you want your triangle...	How to do a recursive main function in Haskell How to do a recursive main function in Haskell haskell recursion How Haskell level-1 Couldn Char How to do a recursive main function in Haskell So I wanted to make a program that prints out a ASCII triangle. The program asks you the height that you want your triangle to be...	[ -0.01446533203125, 0.00421142578125, 0.01190185546875, 0.01104736328125, 0.00003910064697265625, 0.0147705078125, -0.005157470703125, -0.00174713134765625, -0.0048828125, -0.0048828125, 0.019775390625, -0.03173828125, -0.004913330078125, 0.004638671875, -0.0033416748046875, 0.002258300...	[ 11249, 47, 54, 10, 195625, 5844, 5201, 32354, 23, 20625, 142508, 1556, 1830, 17366, 5759, 191147, 21656, 36663, 3249, 1528, 28412, 1810, 125429, 10001, 1927, 109217, 26458, 155955, 3444, 186, 24189, 14012, 3884, 83, 361, 123840, 25550, 15592,...	[ 0.06842041015625, 0.03118896484375, 0.123779296875, 0.045562744140625, 0.2347412109375, 0.18505859375, 0.190185546875, 0.216064453125, 0.071533203125, 0.15185546875, 0.2607421875, 0.1329345703125, 0.0615234375, 0.144775390625, 0.0965576171875, 0.0885009765625, 0.1461181640625, 0.06...	embed
32343301_c1	32343301	haskell	1	5440/UTFTConverter-0.1.0.0/src/Format/C.hs Installing src/Format/Converter.hs to dist/src/sdist.-15440/UTFTConverter-0.1.0.0/src/Format/Converter.hs Installing src/Format/Raw.hs to dist/src/sdist.-15440/UTFTConverter-0.1.0.0/src/Format/Raw.hs Installing src/Format/RGB565.hs to dist/src/sdist.-15440/UTFTConverter-0.1.0....	5440/UTFTConverter-0.1.0.0/src/Format/C.hs Installing src/Format/Converter.hs to dist/src/sdist.-15440/UTFTConverter-0.1.0.0/src/Format/Converter.hs Installing src/Format/Raw.hs to dist/src/sdist.-15440/UTFTConverter-0.1.0.0/src/Format/Raw.hs Installing src/Format/RGB565.hs to dist/src/sdist.-15440/UTFTConverter-0.1.0....	[ 0.00726318359375, 0.01220703125, 0.01300048828125, -0.0198974609375, -0.00537109375, -0.0216064453125, -0.0107421875, -0.006561279296875, -0.001983642578125, 0.03857421875, -0.0004329681396484375, -0.0283203125, 0.0031585693359375, 0.0030059814453125, -0.003692626953125, -0.00799560546...	[ 8983, 2839, 17632, 25217, 11935, 814, 720, 102014, 5, 99929, 64, 7, 19437, 102973, 257, 441, 127, 107951, 214, 47, 45, 271, 46295, 13386, 141929, 9, 91, 12248, 434, 8359, 162689, 1052, 168793, 109921, 111337, 6954, 6, 107615, 207771, 2037...	[ 0.1361083984375, 0.21630859375, 0.1339111328125, 0.1927490234375, 0.1077880859375, 0.2060546875, 0.1754150390625, 0.1473388671875, 0.012664794921875, 0.1590576171875, 0.010009765625, 0.03277587890625, 0.183837890625, 0.1971435546875, 0.010101318359375, 0.00518798828125, 0.14599609375...	embed
32907157_c0	32907157	haskell	0	Title: how to count the number of nested in tuples and how to union this list of tuples Problem title: how to count the number of nested in tuples and how to union this list of tuples Tags: haskell Problem: how to count the number of nested in tuples and how to union this list of tuples 1.how to count the number of nes...	how to count the number of nested in tuples and how to union this list of tuples how to count the number of nested in tuples and how to union this list of tuples haskell a Expr Possible rev2 x:xs flatten1 Ord MM1 Show Main oo.hs Compiling oo.hs:140:12 Couldn oo.hs:140:21 how to count the number of nested in tuples and ...	[ -0.004302978515625, 0.0145263671875, 0.00616455078125, 0.002593994140625, 0.0198974609375, 0.0201416015625, -0.0201416015625, -0.0234375, 0.0289306640625, -0.0093994140625, -0.00994873046875, -0.0108642578125, 0.03515625, 0.007293701171875, 0.00299072265625, -0.01214599609375, 0.0052...	[ 3642, 47, 54529, 14012, 111, 8512, 71, 23, 370, 99726, 136, 69941, 903, 5303, 1556, 142508, 60075, 42, 115861, 37868, 304, 1022, 425, 49878, 510, 35379, 41646, 17367, 12321, 806, 127, 15612, 49725, 43900, 20927, 191147, 25619, 47251, 18499,...	[ 0.0687255859375, 0.05078125, 0.1976318359375, 0.1085205078125, 0.03814697265625, 0.274169921875, 0.1544189453125, 0.10760498046875, 0.1636962890625, 0.2354736328125, 0.04290771484375, 0.2198486328125, 0.054534912109375, 0.1094970703125, 0.1173095703125, 0.1939697265625, 0.05804443359...	embed
21792441_c1	21792441	haskell	1	install wl-pprint-text-1.1.0.2 Failed to install xml-types-0.3.4 cabal: Error: some packages failed to install: attoparsec-conduit-1.0.1.2 depends on lifted-base-0.2.2.0 which failed to install. authenticate-1.3.2.6 depends on xml-types-0.3.4 which failed to install. blaze-builder-conduit-1.0.0 depends on lifted-base-...	install wl-pprint-text-1.1.0.2 Failed to install xml-types-0.3.4 cabal: Error: some packages failed to install: attoparsec-conduit-1.0.1.2 depends on lifted-base-0.2.2.0 which failed to install. authenticate-1.3.2.6 depends on xml-types-0.3.4 which failed to install. blaze-builder-conduit-1.0.0 depends on lifted-base-...	[ 0.0047607421875, -0.0029296875, 0.00189208984375, -0.006256103515625, -0.0025787353515625, -0.010498046875, -0.005401611328125, -0.028564453125, 0.003265380859375, 0.0546875, -0.00396728515625, -0.0223388671875, 0.0016021728515625, -0.01025390625, -0.00116729736328125, -0.0063781738281...	[ 20600, 148, 141, 9, 254, 35662, 22829, 92134, 133684, 190355, 297, 47, 131492, 50986, 23320, 172508, 109524, 12, 212059, 3060, 98169, 165523, 243, 31, 2500, 39797, 2271, 112061, 102107, 48400, 56566, 60520, 37382, 73011, 3129, 195734, 81046, ...	[ 0.2132568359375, 0.0560302734375, 0.13134765625, 0.010894775390625, 0.0892333984375, 0.274169921875, 0.2325439453125, 0.133056640625, 0.213134765625, 0.190185546875, 0.126708984375, 0.0738525390625, 0.2451171875, 0.2244873046875, 0.08306884765625, 0.2371826171875, 0.2393798828125, ...	embed
31365904_c0	31365904	haskell	0	Title: Possible to generically remove function types from datatype, to allow deriveJSON? Problem title: Possible to generically remove function types from datatype, to allow deriveJSON? Tags: aeson, haskell, generic-programming Problem: Possible to generically remove function types from datatype, to allow deriveJSON? I...	Possible to generically remove function types from datatype, to allow deriveJSON? Possible to generically remove function types from datatype, to allow deriveJSON? aeson haskell generic-programming datatype Possible Foo ActionM Bar Maybe Possible to generically remove function types from datatype, to allow deriveJSON? ...	[ -0.007598876953125, 0.033935546875, -0.0033111572265625, 0.0093994140625, -0.00665283203125, -0.0079345703125, 0.0034332275390625, 0.00787353515625, 0.000736236572265625, -0.0164794921875, -0.007354736328125, 0.0150146484375, -0.022705078125, -0.006500244140625, 0.00183868408203125, 0....	[ 115861, 2661, 11212, 71407, 87388, 32354, 52895, 1295, 2053, 50986, 63769, 122, 5844, 1375, 58627, 10, 90, 191, 1556, 142508, 189534, 28966, 9572, 31, 57945, 594, 3253, 83425, 33636, 11341, 38415, 55720, 2667, 18403, 61972, 22, 40899, 2684, ...	[ 0.097412109375, 0.0230255126953125, 0.1649169921875, 0.03814697265625, 0.1978759765625, 0.190673828125, 0.252685546875, 0.0489501953125, 0.0931396484375, 0.237060546875, 0.091796875, 0.09735107421875, 0.131103515625, 0.12939453125, 0.2030029296875, 0.0191650390625, 0.0645751953125, ...	embed
56318633_c0	56318633	haskell	0	Title: Function that takes an array of chars and returns a concatenated string. Haskell Problem title: Function that takes an array of chars and returns a concatenated string. Haskell Tags: haskell, functional-programming Problem: Function that takes an array of chars and returns a concatenated string. Haskell Ugh... S...	Function that takes an array of chars and returns a concatenated string. Haskell Function that takes an array of chars and returns a concatenated string. Haskell haskell functional-programming System.Random Control.Monad Data.Array Data.List Haskell Array Char i-1 Function that takes an array of chars and returns a con...	[ -0.00238037109375, -0.0159912109375, 0.000021576881408691406, 0.004180908203125, 0.006011962890625, -0.0047607421875, 0.0115966796875, 0.00628662109375, 0.0078125, 0.00836181640625, -0.01434326171875, -0.02099609375, -0.008056640625, 0.003448486328125, -0.0130615234375, -0.011047363281...	[ 28670, 10763, 450, 51776, 10298, 53, 111, 21441, 7, 136, 30646, 158, 4460, 33, 79315, 20625, 142508, 1556, 123309, 28966, 12353, 126525, 3815, 27131, 46674, 712, 11809, 7092, 154663, 69253, 21656, 17, 5759, 9486, 63667, 9815, 678, 40858, 29...	[ 0.171630859375, 0.11083984375, 0.007568359375, 0.113525390625, 0.131103515625, 0.0782470703125, 0.00531005859375, 0.2025146484375, 0.03033447265625, 0.0258331298828125, 0.162109375, 0.09246826171875, 0.1251220703125, 0.0694580078125, 0.206787109375, 0.1212158203125, 0.232421875, 0....	embed
14114362_c0	14114362	haskell	0	Title: Yesod, howto generate type-safe link from JSON-data in Javascript / Julius Problem title: Yesod, howto generate type-safe link from JSON-data in Javascript / Julius Tags: yesod, haskell Problem: Yesod, howto generate type-safe link from JSON-data in Javascript / Julius I've a route /notes/#NoteId NoteR GET From ...	Yesod, howto generate type-safe link from JSON-data in Javascript / Julius Yesod, howto generate type-safe link from JSON-data in Javascript / Julius yesod haskell JSON-data Yesod Javascript Julius NoteId NoteR GET obj.id jQuery.getJSON NotesR obj.title window.onload Model.hs ToJSON Entity Note created_at updated_at Ye...	[ -0.009033203125, -0.002288818359375, 0.00157928466796875, -0.00885009765625, 0.004058837890625, -0.01312255859375, 0.007171630859375, 0.0169677734375, -0.01214599609375, -0.08837890625, -0.026611328125, -0.017578125, -0.0167236328125, -0.0167236328125, 0.0069580078125, -0.021484375, ...	[ 32635, 2199, 3642, 188, 139392, 10644, 9, 115840, 3126, 1295, 821, 58627, 10135, 23, 74181, 109112, 2422, 23722, 1556, 142508, 18622, 568, 71, 1052, 79794, 995, 170, 532, 231129, 3794, 1375, 5440, 76896, 191, 63033, 13293, 127, 717, 16511, ...	[ 0.1805419921875, 0.2454833984375, 0.050537109375, 0.05908203125, 0.1826171875, 0.22607421875, 0.0750732421875, 0.252197265625, 0.2279052734375, 0.1015625, 0.140380859375, 0.218017578125, 0.13134765625, 0.020599365234375, 0.23193359375, 0.259521484375, 0.10321044921875, 0.169921875,...	embed
41509628_c1	41509628	haskell	1	xs result = do n <- peek n xs <- peekArray n xs pokeArray result $ acumSum xs Code in C: (exactly the same of the mentioned blog post) Compiling: ghc -c SumRoots.hs ghc -c StartEnd.c ghc -shared -o SumRoots.dll SumRoots.o StartEnd.o Code in Mathematica: Needs["NETLink`"] hsStart = DefineDLLFunction["HsStart", "c:\\tem...	xs result = do n <- peek n xs <- peekArray n xs pokeArray result $ acumSum xs Code in C: (exactly the same of the mentioned blog post) Compiling: ghc -c SumRoots.hs ghc -c StartEnd.c ghc -shared -o SumRoots.dll SumRoots.o StartEnd.o Code in Mathematica: Needs["NETLink`"] hsStart = DefineDLLFunction["HsStart", "c:\\tem...	[ -0.007720947265625, 0.022705078125, -0.01080322265625, 0.00286865234375, -0.002227783203125, 0.01025390625, -0.010009765625, 0.01068115234375, 0.01708984375, -0.0498046875, 0.01025390625, 0.0177001953125, 0.013916015625, -0.0101318359375, -0.005340576171875, -0.01239013671875, 0.0275...	[ 1022, 7, 16750, 54, 653, 4426, 9, 280, 343, 7614, 7092, 160, 350, 3650, 9176, 294, 316, 28864, 23, 313, 12, 47013, 5701, 119056, 1415, 1305, 15612, 49725, 31380, 238, 36335, 12724, 30591, 127, 13794, 152378, 67886, 1181, 31, 123426, 888...	[ 0.1864013671875, 0.1773681640625, 0.25927734375, 0.08270263671875, 0.07623291015625, 0.08544921875, 0.030670166015625, 0.1531982421875, 0.1685791015625, 0.059844970703125, 0.1531982421875, 0.098876953125, 0.1324462890625, 0.000946044921875, 0.2362060546875, 0.114501953125, 0.25048828...	embed
47433796_c0	47433796	haskell	0	Title: How to apply single β-step at the root Problem title: How to apply single β-step at the root Tags: haskell, lambda Problem: How to apply single β-step at the root I got the following task: Let type Strat = Term -> [Term] be the type of reduction strategies. Implement the strategy root :: Strat which applies a si...	How to apply single β-step at the root How to apply single β-step at the root haskell lambda How Term App Abs Show How to apply single β-step at the root I got the following task: Now I know how the different strategies (applicative order reduction, normal order reduction, ...) work. My question now is, now: Every time...	[ -0.0015106201171875, 0.0255126953125, 0.008544921875, 0.0208740234375, 0.0186767578125, 0.0185546875, 0.0191650390625, -0.0113525390625, 0.00775146484375, -0.022216796875, 0.016357421875, -0.001953125, -0.00787353515625, 0.0081787109375, -0.002471923828125, -0.0137939453125, 0.006256...	[ 11249, 47, 59911, 11001, 9269, 9, 95528, 99, 70, 74855, 1556, 142508, 6492, 85, 2994, 39, 5659, 27174, 17367, 66211, 12921, 50531, 9007, 11048, 12989, 456, 77391, 3638, 4488, 87769, 1733, 13579, 2046, 15700, 44084, 5608, 30646, 5303, 69407,...	[ 0.07647705078125, 0.052734375, 0.1839599609375, 0.19873046875, 0.220947265625, 0.04425048828125, 0.2342529296875, 0.1221923828125, 0.019073486328125, 0.2476806640625, 0.1080322265625, 0.234375, 0.1378173828125, 0.07611083984375, 0.1080322265625, 0.0303955078125, 0.13720703125, 0.15...	embed
35510790_c0	35510790	haskell	0	Title: Haskell Terminology: Part of type signature following constraints Problem title: Haskell Terminology: Part of type signature following constraints Tags: haskell Problem: Haskell Terminology: Part of type signature following constraints Many type signatures in Haskell are of the following form: a :: (B) => C As I...	Haskell Terminology: Part of type signature following constraints Haskell Terminology: Part of type signature following constraints haskell Haskell Terminology Part Monad Haskell Terminology: Part of type signature following constraints Many type signatures in Haskell are of the following form: As I understand it, the ...	[ 0.0172119140625, -0.003173828125, 0.0157470703125, 0.0191650390625, -0.007293701171875, 0.011962890625, 0.0029449462890625, 0.00958251953125, -0.0101318359375, 0.013916015625, -0.0186767578125, -0.021728515625, -0.02685546875, 0.0047607421875, -0.008544921875, 0.006927490234375, -0.0...	[ 20625, 142508, 27366, 25443, 16995, 111, 10644, 138256, 25632, 158, 2816, 4288, 1556, 60331, 71, 52455, 3173, 28219, 13579, 50986, 15005, 64194, 64549, 10, 1984, 571, 313, 335, 13379, 35839, 2271, 6332, 47143, 820, 5570, 9351, 2831, 105866, ...	[ 0.114990234375, 0.237548828125, 0.10394287109375, 0.0810546875, 0.1326904296875, 0.048004150390625, 0.234130859375, 0.27587890625, 0.162353515625, 0.114501953125, 0.22314453125, 0.1593017578125, 0.084716796875, 0.166748046875, 0.1314697265625, 0.004119873046875, 0.1029052734375, 0....	embed
64128964_c1	64128964	haskell	1	mp mapped to integer-gmp-1.0.2.0 wired-in package base mapped to base-4.12.0.0 wired-in package rts mapped to rts-1.0 wired-in package template-haskell mapped to template-haskell-2.14.0.0 wired-in package ghc mapped to ghc-8.6.5 *** Chasing dependencies: Chasing modules from: *Test/CalcTests.hs !!! Chasing dependencies...	mp mapped to integer-gmp-1.0.2.0 wired-in package base mapped to base-4.12.0.0 wired-in package rts mapped to rts-1.0 wired-in package template-haskell mapped to template-haskell-2.14.0.0 wired-in package ghc mapped to ghc-8.6.5 *** Chasing dependencies: Chasing modules from: *Test/CalcTests.hs !!! Chasing dependencies...	[ 0.0001735687255859375, -0.00799560546875, 0.0162353515625, -0.0045166015625, 0.011474609375, 0.005645751953125, -0.007720947265625, -0.033935546875, 0.0244140625, 0.01300048828125, -0.00921630859375, -0.018798828125, -0.00051116943359375, 0.0166015625, 0.0185546875, 0.01239013671875, ...	[ 9607, 291, 48398, 47, 892, 1505, 177, 2676, 102107, 73011, 1439, 297, 73, 98169, 3647, 11565, 15654, 99929, 1690, 933, 110934, 10557, 142508, 2592, 9, 31380, 238, 17376, 136473, 24428, 4841, 6953, 42548, 117538, 88996, 7, 1295, 111337, 64, ...	[ 0.2220458984375, 0.19482421875, 0.1429443359375, 0.1385498046875, 0.1611328125, 0.1201171875, 0.057861328125, 0.254150390625, 0.1563720703125, 0.202392578125, 0.161865234375, 0.088134765625, 0.17431640625, 0.21923828125, 0.2122802734375, 0.03448486328125, 0.093994140625, 0.12707519...	embed
22857766_c0	22857766	haskell	0	Title: Infinite list in haskell combined with fold* doesn't calculate Problem title: Infinite list in haskell combined with fold* doesn't calculate Tags: fold, dictionary, haskell, infinite Problem: Infinite list in haskell combined with fold* doesn't calculate Let's say I want to get a sorted infinite list o...	Infinite list in haskell combined with fold* doesn't calculate Infinite list in haskell combined with fold* doesn't calculate fold dictionary haskell infinite Infinite Ord x:xs y:ys Integer p:xs Infinite list in haskell combined with fold* doesn't calculate Let's say I want to get a sorted infinite list of al...	[ -0.0045166015625, -0.00003647804260253906, 0.01336669921875, -0.00469970703125, 0.003021240234375, -0.0007781982421875, 0.01409912109375, -0.0137939453125, 0.0196533203125, -0.01409912109375, 0.0108642578125, 0.00970458984375, 0.0211181640625, 0.0157470703125, -0.00775146484375, -0.003...	[ 134322, 13, 5303, 1556, 142508, 70163, 678, 42822, 1639, 22027, 3768, 18, 74481, 10763, 54241, 35379, 4778, 44401, 915, 425, 23, 3444, 2046, 17497, 71, 756, 20809, 62783, 1257, 54137, 653, 32354, 42564, 6626, 76199, 11389, 132887, 145111, 7...	[ 0.15673828125, 0.0418701171875, 0.1998291015625, 0.1102294921875, 0.220703125, 0.13330078125, 0.041473388671875, 0.180908203125, 0.1151123046875, 0.013275146484375, 0.1378173828125, 0.0711669921875, 0.18359375, 0.03839111328125, 0.1229248046875, 0.11962890625, 0.009490966796875, 0....	embed
25913481_c0	25913481	haskell	0	Title: Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 Problem title: Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 Tags: haskell, performance Problem: Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 Given is a text file (for piping) with many numbers divided by a space...	Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 haskell performance stdin Control.Applicative Control.Arrow Data.Int Data.Maybe qualified Read Data.Vector.Unboxed.Vector Int64 Data.ByteString.Char8 Data.Vector.Unboxed B.getContents V.maximu...	[ -0.00762939453125, -0.0030975341796875, 0.004974365234375, 0.0037384033203125, -0.0093994140625, 0.0164794921875, 0.006744384765625, -0.0263671875, -0.0118408203125, -0.03857421875, -0.003143310546875, -0.007781982421875, 0.00970458984375, 0.00640869140625, 0.01171875, -0.0115356445312...	[ 4764, 101935, 1295, 6138, 3035, 3934, 10, 11809, 26455, 18770, 14256, 11728, 360, 18, 13307, 1556, 142508, 23718, 27131, 11048, 15555, 4153, 217225, 71713, 84068, 1019, 335, 3794, 25352, 310, 53950, 4353, 39116, 161063, 154663, 12613, 21693, ...	[ 0.198974609375, 0.201904296875, 0.107666015625, 0.184326171875, 0.176025390625, 0.1806640625, 0.044219970703125, 0.126953125, 0.205078125, 0.1527099609375, 0.095703125, 0.1790771484375, 0.061767578125, 0.091064453125, 0.2174072265625, 0.109130859375, 0.2044677734375, 0.141357421875...	embed
28660035_c1	28660035	haskell	1	TimeStep -> [Particle] -> [[Particle]] simulateParticlesPar ts = withStrategy (parList (parBuffer 250 particleStrategy)) . fmap (simulateParticle ts) -- Build a lazy infinite list of the particle's travel with each -- update being a TimeStep apart. simulateParticle :: TimeStep -> Particle -> [Particle] simulateParticl...	TimeStep -> [Particle] -> [[Particle]] simulateParticlesPar ts = withStrategy (parList (parBuffer 250 particleStrategy)) . fmap (simulateParticle ts) -- Build a lazy infinite list of the particle's travel with each -- update being a TimeStep apart. simulateParticle :: TimeStep -> Particle -> [Particle] simulateParticl...	[ -0.025634765625, 0.0159912109375, -0.01544189453125, -0.01007080078125, 0.01153564453125, 0.00125885009765625, 0.0093994140625, -0.0284423828125, 0.0034332275390625, -0.026123046875, -0.02099609375, 0.032470703125, 0.0128173828125, 0.01458740234375, -0.006378173828125, -0.0026550292968...	[ 19055, 191644, 33079, 683, 26147, 86245, 40226, 67, 7, 28636, 61636, 2203, 678, 97315, 3432, 2500, 154663, 7235, 18234, 5316, 915, 5, 1238, 62346, 137003, 4210, 121137, 21, 3285, 54241, 5303, 26983, 12638, 28350, 8035, 34955, 1984, 347, 299...	[ 0.1693115234375, 0.2802734375, 0.041839599609375, 0.05438232421875, 0.2122802734375, 0.0191650390625, 0.28271484375, 0.1558837890625, 0.01837158203125, 0.1856689453125, 0.1568603515625, 0.032501220703125, 0.1082763671875, 0.152099609375, 0.1041259765625, 0.07586669921875, 0.140014648...	embed
46112354_c1	46112354	haskell	1	Control.Lens (makeLenses, use, (.=), ASetter) import Control.Monad.State.Class (MonadState) import Control.Monad.Trans.Class (lift) import Control.Monad.Trans.State.Lazy (StateT(StateT), execStateT) data GameObject = GameObject { _num :: Int } deriving (Show) data Game = Game { _objects :: [GameObject] } deriving (Sho...	Control.Lens (makeLenses, use, (.=), ASetter) import Control.Monad.State.Class (MonadState) import Control.Monad.Trans.Class (lift) import Control.Monad.Trans.State.Lazy (StateT(StateT), execStateT) data GameObject = GameObject { _num :: Int } deriving (Show) data Game = Game { _objects :: [GameObject] } deriving (Sho...	[ -0.038818359375, 0.0079345703125, 0.004425048828125, -0.017333984375, 0.0166015625, -0.00994873046875, -0.0306396484375, -0.0172119140625, 0.00225830078125, -0.03125, -0.007781982421875, 0.035400390625, 0.01092529296875, -0.01239013671875, 0.018310546875, -0.0120849609375, 0.00121307...	[ 27131, 5, 866, 1755, 55898, 47754, 4527, 1369, 6483, 62593, 24927, 46674, 712, 135206, 140803, 62624, 104501, 2729, 3285, 618, 3240, 2053, 13547, 46471, 75161, 2606, 16406, 168660, 2203, 187694, 107576, 3249, 114977, 22288, 138, 2811, 151138, ...	[ 0.232666015625, 0.0196380615234375, 0.1824951171875, 0.1962890625, 0.0955810546875, 0.14697265625, 0.07427978515625, 0.0299072265625, 0.010345458984375, 0.2127685546875, 0.1661376953125, 0.06671142578125, 0.1124267578125, 0.152099609375, 0.182861328125, 0.0928955078125, 0.20458984375...	embed
69122738_c0	69122738	haskell	0	Title: How do I fix this error when installing GHC with ghcup? Problem title: How do I fix this error when installing GHC with ghcup? Tags: haskell, ghcup, ghc Problem: How do I fix this error when installing GHC with ghcup? I'm trying to install GHC with ghcup on an windows laptop running an Ubuntu subsystem. I keep g...	How do I fix this error when installing GHC with ghcup? How do I fix this error when installing GHC with ghcup? haskell ghcup ghc How GHC Info ghc-8.10.7-x86_64-fedora27-linux.tar.xz Unpacking ghcup-61d1fb5776edc19e Installing Win64 DLLs stage2 ghc-8.10.7 Couldn package.conf.d ghc.mk:985 install_packages Error Makefile...	[ 0.004974365234375, 0.00933837890625, 0.0238037109375, -0.005340576171875, 0.0045166015625, 0.00390625, -0.029541015625, -0.00946044921875, -0.00165557861328125, 0.015380859375, 0.014892578125, -0.01397705078125, 0.00185394287109375, 0.01177978515625, -0.00286865234375, 0.021484375, -...	[ 30022, 903, 18499, 20600, 214, 527, 73265, 678, 31380, 33874, 1556, 142508, 238, 14048, 17376, 10179, 50775, 15276, 13307, 2242, 11606, 3768, 2397, 6077, 867, 992, 29102, 11540, 11835, 2947, 107951, 17686, 23708, 36541, 304, 966, 191147, 9816...	[ 0.086181640625, 0.040069580078125, 0.1719970703125, 0.1661376953125, 0.038848876953125, 0.11279296875, 0.22802734375, 0.1483154296875, 0.146484375, 0.26025390625, 0.089111328125, 0.2125244140625, 0.11279296875, 0.0860595703125, 0.0848388671875, 0.17626953125, 0.014556884765625, 0.1...	embed

40248901_c0

40248901

haskell

0

Title: Can't open Odt file generated from Pandoc Problem title: Can't open Odt file generated from Pandoc Tags: pandoc, libreoffice, haskell Problem: Can't open Odt file generated from Pandoc I tried to generated a basic odt file with a mathematic formula with the Haskell pandoc library to verify if the probl...

Can't open Odt file generated from Pandoc Can't open Odt file generated from Pandoc pandoc libreoffice haskell Pandoc Text.Pandoc Data.Map qualified Can Odt Data.ByteString.Lazy Data.Set Set WriterOptions Nothing B.writeFile document.odt Meta Para Str Math Plain InlineMath A_e HorizontalRule Set.fromList Ext_...

[ -0.002227783203125, 0.00225830078125, -0.01416015625, 0.0031890869140625, -0.0042724609375, -0.0162353515625, 0.0031280517578125, -0.01611328125, -0.00579833984375, -0.006591796875, 0.0133056640625, -0.0037689208984375, 0.01336669921875, -0.01531982421875, 0.00518798828125, -0.00952148...

[ 4171, 3768, 18, 9803, 2365, 11435, 139392, 1295, 4378, 29713, 2652, 11506, 65024, 1556, 142508, 24129, 55956, 11809, 166179, 217225, 75358, 71713, 2729, 3285, 294, 126, 19943, 2783, 39029, 182747, 335, 434, 18781, 174350, 12937, 2199, 36939, ...

[ 0.05389404296875, 0.0631103515625, 0.1806640625, 0.1988525390625, 0.2012939453125, 0.1864013671875, 0.1494140625, 0.05328369140625, 0.1171875, 0.1944580078125, 0.1004638671875, 0.1541748046875, 0.2047119140625, 0.06231689453125, 0.187744140625, 0.04937744140625, 0.05023193359375, 0...

embed

2848105_c1

2848105

haskell

1

.0,10.0), textLabel = (), foregroundLabel = 0x000000, backgroundLabel = 0xFFFFFF}->[((1,3),3)] 1:NodeLabel {typeLabel = Terminator, sizeLabel = (30.0,10.0), textLabel = (), foregroundLabel = 0x000000, backgroundLabel = 0xFFFFFF}->[] 2:NodeLabel {typeLabel = HelpNode, sizeLabel = (0.0,0.0), textLabel = (), foregroundLab...

[ 0.005584716796875, 0.004608154296875, -0.007598876953125, 0.0184326171875, -0.003173828125, 0.015380859375, -0.024169921875, -0.01190185546875, 0.00537109375, 0.01092529296875, 0.00193023681640625, -0.0220947265625, -0.0172119140625, -0.0150146484375, -0.001983642578125, 0.011352539062...

[ 5, 2389, 963, 77495, 7986, 2729, 4063, 2203, 100, 13, 64330, 757, 197094, 76615, 30110, 103607, 41600, 21320, 13806, 5021, 112, 50986, 27366, 4597, 13267, 99929, 15573, 39527, 216969, 22408, 4263, 127, 166191, 206808, 29557, 27959, 2331, 1046...

[ 0.05340576171875, 0.11474609375, 0.1097412109375, 0.1162109375, 0.1646728515625, 0.142822265625, 0.27197265625, 0.0518798828125, 0.054534912109375, 0.047393798828125, 0.1671142578125, 0.0904541015625, 0.1641845703125, 0.161376953125, 0.0994873046875, 0.0224456787109375, 0.01043701171...

embed

29364056_c0

29364056

haskell

0

Title: How do I know who to blame for hackage inconsistencies Problem title: How do I know who to blame for hackage inconsistencies Tags: haskell, hackage, cabal, dependencies Problem: How do I know who to blame for hackage inconsistencies Trying to install criterion , I run into troubles with other packages that I rel...

How do I know who to blame for hackage inconsistencies How do I know who to blame for hackage inconsistencies haskell hackage cabal dependencies How Resolving Glob-0.7.5 abstract-deque-0.3 abstract-par-0.3.3 blaze-builder-0.4.0.1 cereal-0.4.1.1 erf-2.0.0.0 ieee754-0.7.6 hastache-0.6.1 monad-par-extras-0.3.3 parallel-3....

[ -0.003509521484375, 0.0096435546875, 0.01220703125, 0.01019287109375, 0.01397705078125, -0.00531005859375, -0.0107421875, -0.00311279296875, 0.0021820068359375, 0.022216796875, 0.00848388671875, -0.020751953125, -0.00811767578125, 0.00836181640625, 0.00872802734375, 0.0140380859375, ...

[ 11249, 87, 3714, 2750, 47, 9932, 282, 100, 85526, 4588, 23, 25553, 6892, 58732, 1556, 142508, 109524, 42548, 853, 132944, 214, 127129, 23320, 136563, 164789, 112, 944, 170179, 2500, 134693, 731, 177149, 56, 121254, 102014, 141233, 83783, 8682...

[ 0.0604248046875, 0.0210418701171875, 0.1641845703125, 0.152587890625, 0.080810546875, 0.2213134765625, 0.18359375, 0.12353515625, 0.2352294921875, 0.1705322265625, 0.1319580078125, 0.19775390625, 0.2427978515625, 0.05340576171875, 0.120361328125, 0.19580078125, 0.2041015625, 0.2083...

embed

16974868_c0

16974868

haskell

0

Title: A more succinct way to map functions onto fields of an algebraic datatype? Problem title: A more succinct way to map functions onto fields of an algebraic datatype? Tags: algebraic-data-types, haskell Problem: A more succinct way to map functions onto fields of an algebraic datatype? I have a datatype with lots ...

A more succinct way to map functions onto fields of an algebraic datatype? A more succinct way to map functions onto fields of an algebraic datatype? algebraic-data-types haskell ManyFields Note ManyField mapf1 Repeat mapf2 mf1 mf2 A more succinct way to map functions onto fields of an algebraic datatype? I have a data...

[ 0.0013885498046875, 0.008056640625, -0.01019287109375, 0.0142822265625, -0.01031494140625, -0.006744384765625, 0.006591796875, -0.003997802734375, 0.0133056640625, -0.031494140625, -0.0091552734375, -0.01080322265625, -0.00168609619140625, 0.00811767578125, -0.00634765625, -0.023193359...

[ 1286, 42593, 6333, 3917, 22288, 32354, 98, 188, 44457, 144, 429, 2844, 2053, 50986, 15390, 1771, 10135, 1556, 142508, 52455, 6159, 19388, 18622, 420, 418, 33742, 13, 304, 71358, 15649, 12638, 71864, 29479, 33342, 4552, 120, 5670, 57840, 535...

[ 0.05499267578125, 0.0290374755859375, 0.078369140625, 0.038238525390625, 0.201904296875, 0.204345703125, 0.068359375, 0.1146240234375, 0.21240234375, 0.00994873046875, 0.063720703125, 0.1046142578125, 0.10791015625, 0.239013671875, 0.0501708984375, 0.03228759765625, 0.0699462890625, ...

embed

51623611_c0

51623611

haskell

0

Title: Unable to install or build ghc-mod or other packages with Stack Problem title: Unable to install or build ghc-mod or other packages with Stack Tags: archlinux, haskell-stack, haskell Problem: Unable to install or build ghc-mod or other packages with Stack I am trying to set up a development environment for Haske...

Unable to install or build ghc-mod or other packages with Stack Unable to install or build ghc-mod or other packages with Stack archlinux haskell-stack haskell Unable Stack Cabal-1.24.2.0 base-4.9.1.0 cabal-helper-0.7.3.0 djinn-ghc-0.0.2.3 extra-1.5.3 ghc-syb-utils-0.2.3.3 haskell-src-exts-1.19.1 hlint-2.0.15 monad-jou...

[ -0.0223388671875, 0.01507568359375, 0.021484375, -0.0024871826171875, -0.01080322265625, 0.00010585784912109375, -0.0277099609375, 0.0098876953125, 0.0089111328125, 0.018310546875, -0.00726318359375, -0.05419921875, 0.007110595703125, 0.00872802734375, 0.0091552734375, -0.0014419555664...

[ 992, 2886, 20600, 707, 45367, 31380, 238, 13415, 98169, 678, 6512, 2594, 187, 206, 2397, 6077, 1556, 142508, 590, 30438, 289, 20682, 73011, 3647, 156982, 102107, 109524, 73866, 134926, 107473, 2230, 9486, 4173, 23811, 1003, 19437, 3355, 2947,...

[ 0.043792724609375, 0.13134765625, 0.1798095703125, 0.031402587890625, 0.1759033203125, 0.1697998046875, 0.140380859375, 0.2005615234375, 0.1812744140625, 0.04248046875, 0.1727294921875, 0.1475830078125, 0.040191650390625, 0.02679443359375, 0.0439453125, 0.05908203125, 0.1273193359375...

embed

41764189_c0

41764189

haskell

0

Title: Pattern overlapping, why is it happening? Problem title: Pattern overlapping, why is it happening? Tags: pattern-matching, haskell Problem: Pattern overlapping, why is it happening? I have a file OptionList.hs, with a new datatype named OptionList. I Want to hide the EmptyOpt when an OptionList is showed: module...

Pattern overlapping, why is it happening? Pattern overlapping, why is it happening? pattern-matching haskell OptionList Pattern EmptyOpt Read Show todo.hs OptionList.hs:12:9 Warning Pattern overlapping, why is it happening? I have a file OptionList.hs, with a new datatype named OptionList. I Want to hide the EmptyOpt w...

[ 0.0042724609375, -0.007080078125, 0.006927490234375, 0.018310546875, -0.005615234375, -0.017333984375, -0.00726318359375, -0.017578125, 0.00909423828125, 0.01104736328125, -0.00982666015625, -0.035400390625, 0.0244140625, 0.01483154296875, 0.000629425048828125, -0.00064849853515625, ...

[ 9876, 22766, 645, 143, 26783, 15400, 83, 442, 123087, 103510, 98753, 214, 1556, 142508, 86769, 154663, 31678, 939, 39029, 18, 4764, 17367, 1973, 127, 20927, 1126, 5550, 592, 11435, 3525, 2053, 50986, 42335, 1274, 112, 168360, 5201, 9969, 34...

[ 0.165283203125, 0.169189453125, 0.1793212890625, 0.233154296875, 0.188232421875, 0.1495361328125, 0.066650390625, 0.04559326171875, 0.1204833984375, 0.20703125, 0.17236328125, 0.00347900390625, 0.1123046875, 0.1986083984375, 0.1734619140625, 0.156494140625, 0.1072998046875, 0.08349...

embed

13337937_c0

13337937

haskell

0

Title: Couldn't match expected type `Bool' with actual type `IO Bool' Problem title: Couldn't match expected type `Bool' with actual type `IO Bool' Tags: haskell Problem: Couldn't match expected type `Bool' with actual type `IO Bool' I'm trying to write a prime number generator and utilizi...

Couldn't match expected type `Bool' with actual type `IO Bool' Couldn't match expected type `Bool' with actual type `IO Bool' haskell Couldn Bool Integer primesTo100 Integral i-1 Num Ord Random y-1 snd.head.dropWhile Couldn't match expected type `Bool' with actual type `IO Bool' I'm trying...

[ -0.010498046875, 0.01153564453125, 0.0022430419921875, 0.005401611328125, 0.02197265625, 0.004974365234375, 0.00372314453125, -0.0294189453125, -0.0086669921875, -0.013916015625, 0.018798828125, 0.00439453125, 0.00860595703125, -0.0174560546875, 0.01483154296875, -0.005645751953125, ...

[ 191147, 3768, 18, 14858, 84751, 10644, 12647, 929, 678, 8561, 17780, 2460, 1556, 142508, 19, 44401, 20809, 7763, 3559, 204681, 17, 5759, 52782, 35379, 39643, 113, 2208, 31251, 138810, 31577, 33022, 14012, 145823, 102617, 12248, 7568, 26168, 1...

[ 0.08935546875, 0.097412109375, 0.04840087890625, 0.179443359375, 0.1602783203125, 0.1741943359375, 0.121337890625, 0.2353515625, 0.081298828125, 0.1331787109375, 0.2344970703125, 0.1309814453125, 0.1195068359375, 0.2099609375, 0.0015869140625, 0.1702880859375, 0.195556640625, 0.088...

embed

34426601_c0

34426601

haskell

0

Title: ambiguous def with record update syntax Problem title: ambiguous def with record update syntax Tags: haskell Problem: ambiguous def with record update syntax Example: data Foo a = Foo { fooId :: a , fooName :: String , fooCount :: Int } instance Default a => Default (Foo a) where def = Foo { fooId = def , fooNam...

ambiguous def with record update syntax ambiguous def with record update syntax haskell Foo Default Maybe SomethingReallyCrazy ambiguous def with record update syntax Example: I think I understand why it's ambigouous. That is not the question. Imagine: Instead I would like to write: Does it even matter how GHC infers t...

[ -0.00421142578125, -0.00689697265625, 0.0064697265625, -0.00124359130859375, 0.032958984375, -0.010986328125, -0.044921875, 0.008544921875, 0.01458740234375, 0.002655029296875, -0.00020122528076171875, -0.015869140625, 0.01458740234375, -0.0003490447998046875, 0.0115966796875, -0.01391...

[ 920, 12282, 10821, 8, 420, 678, 17164, 28350, 6002, 86531, 1556, 142508, 9572, 31, 262, 1021, 7136, 83425, 200905, 68996, 538, 5272, 89536, 5351, 28219, 15400, 20828, 34, 133196, 33022, 26866, 527, 73265, 53498, 10644, 191147, 186, 82419, 5...

[ 0.1363525390625, 0.1922607421875, 0.1263427734375, 0.141357421875, 0.1463623046875, 0.052581787109375, 0.1666259765625, 0.18310546875, 0.1051025390625, 0.095703125, 0.1064453125, 0.2144775390625, 0.161865234375, 0.1446533203125, 0.0767822265625, 0.1527099609375, 0.0159759521484375, ...

embed

66413994_c0

66413994

haskell

0

Title: Is there a way to derive Lift for "IO a" in Haskell? Problem title: Is there a way to derive Lift for "IO a" in Haskell? Tags: template-haskell, haskell, free-monad Problem: Is there a way to derive Lift for "IO a" in Haskell? For awhile now, whenever people mention the performance hit of fre...

Is there a way to derive Lift for "IO a" in Haskell? Is there a way to derive Lift for "IO a" in Haskell? template-haskell haskell free-monad Lift Haskell MyFreeF MyFreeM Free TExp DeriveLift State GHC.IO Is there a way to derive Lift for "IO a" in Haskell? For awhile now, whenever people mention th...

[ -0.002105712890625, 0.0147705078125, -0.003570556640625, -0.005859375, -0.00811767578125, -0.003997802734375, 0.008056640625, -0.002593994140625, -0.003387451171875, -0.035888671875, 0.007537841796875, -0.01385498046875, 0.01287841796875, 0.005706787109375, -0.01470947265625, -0.003997...

[ 2685, 10, 3917, 122, 5844, 166562, 100, 17780, 23, 20625, 142508, 47, 110934, 10557, 1556, 4092, 3796, 712, 2646, 81437, 919, 594, 5153, 13018, 425, 1310, 9506, 2480, 22836, 527, 73265, 23718, 5962, 2667, 997, 29481, 56, 103510, 307, 6528...

[ 0.0283355712890625, 0.1986083984375, 0.1087646484375, 0.150390625, 0.1885986328125, 0.323486328125, 0.1171875, 0.217529296875, 0.065185546875, 0.1287841796875, 0.238037109375, 0.0196990966796875, 0.162841796875, 0.07733154296875, 0.08990478515625, 0.09991455078125, 0.05499267578125, ...

embed

62513201_c1

62513201

haskell

1

. When it actually should be: [StudentsFirstNameChangeEvent {oldName = "Alicja", newName = "Alicjax"},StudentsFirstNameChangeEvent {oldName = "Bartek", newName = "Bartekx"}, ...] enter code here I think im done with haskell, but this is my final progress: correctSplit :: [String] -> [[String]] correctSplit list = let x...

[ 0.00323486328125, 0.0150146484375, 0.006866455078125, 0.003936767578125, -0.01708984375, 0.01300048828125, -0.01068115234375, -0.0022430419921875, 0.0185546875, 0.00701904296875, 0.001220703125, 0.0301513671875, 0.0218505859375, 0.0301513671875, -0.00347900390625, -0.0036468505859375, ...

[ 5, 14847, 442, 20653, 5608, 186, 239825, 7, 207263, 163612, 127008, 429, 192134, 18345, 55725, 8615, 3525, 425, 25267, 2142, 30957, 18151, 3688, 5351, 566, 16940, 678, 1556, 142508, 2704, 42658, 26785, 31923, 4353, 1984, 71713, 5303, 2633, ...

[ 0.003570556640625, 0.0875244140625, 0.053955078125, 0.149169921875, 0.1541748046875, 0.089111328125, 0.243896484375, 0.0726318359375, 0.1226806640625, 0.197265625, 0.2125244140625, 0.094482421875, 0.208740234375, 0.10284423828125, 0.138427734375, 0.234375, 0.1148681640625, 0.123535...

embed

12176037_c0

12176037

haskell

0

Title: ScopedTypeVariables fail to work with nested where-clauses? Problem title: ScopedTypeVariables fail to work with nested where-clauses? Tags: haskell, type-variables Problem: ScopedTypeVariables fail to work with nested where-clauses? It's a horribly contrived example, but anyway... this typechecks: newtype Foo c...

ScopedTypeVariables fail to work with nested where-clauses? ScopedTypeVariables fail to work with nested where-clauses? haskell type-variables the ScopedTypeVariables Foo Bool Bar Could ScopedTypeVariables fail to work with nested where-clauses? It's a horribly contrived example, but anyway... this typechecks: and work...

[ 0.0091552734375, 0.0234375, -0.0126953125, -0.00150299072265625, 0.007415771484375, 0.0042724609375, -0.02392578125, 0.0087890625, -0.0098876953125, -0.01043701171875, -0.003997802734375, -0.023681640625, 0.0123291015625, 0.005035400390625, 0.01177978515625, -0.005706787109375, 0.001...

[ 182783, 297, 196707, 81827, 14, 19736, 35782, 4488, 678, 8512, 71, 7440, 18347, 29001, 1556, 142508, 10644, 21690, 9572, 31, 2460, 929, 3253, 191147, 9, 152240, 3996, 27781, 903, 78292, 43240, 1284, 15190, 162520, 138256, 4000, 32354, 116983,...

[ 0.233154296875, 0.146728515625, 0.2392578125, 0.140380859375, 0.0841064453125, 0.110107421875, 0.181640625, 0.1123046875, 0.1055908203125, 0.2113037109375, 0.08599853515625, 0.1798095703125, 0.1119384765625, 0.07293701171875, 0.09033203125, 0.2142333984375, 0.209228515625, 0.140747...

embed

25595547_c0

25595547

haskell

0

Title: Snap render list in Hamlet Problem title: Snap render list in Hamlet Tags: haskell-snap-framework, haskell, hamlet Problem: Snap render list in Hamlet Given this little project I'm using to learn Haskell, I would like to move my request handler's code generation to a Hamlet template, but am unsure how to pass th...

Snap render list in Hamlet Snap render list in Hamlet haskell-snap-framework haskell hamlet Snap Hamlet Couldn Probable fileList.hamlet view_root_json_files FilePath Text filtered_filenames Snap render list in Hamlet Given this little project I'm using to learn Haskell, I would like to move my request handler's code ge...

[ 0.0023956298828125, 0.00628662109375, -0.015869140625, 0.0013580322265625, -0.038330078125, 0.0106201171875, 0.000942230224609375, -0.007080078125, 0.0159912109375, -0.044921875, -0.0263671875, -0.02099609375, 0.0028839111328125, -0.0064697265625, -0.002349853515625, 0.00640869140625, ...

[ 121190, 89159, 5303, 10699, 1974, 23, 1556, 142508, 10957, 160328, 18244, 2057, 191147, 1250, 275, 11435, 154663, 3915, 21455, 148920, 170, 1681, 29822, 42724, 683, 10519, 24129, 46312, 11627, 10176, 13452, 30698, 20625, 1884, 25813, 50336, 358...

[ 0.20703125, 0.2255859375, 0.156494140625, 0.1947021484375, 0.250244140625, 0.0147552490234375, 0.09893798828125, 0.2042236328125, 0.1728515625, 0.0855712890625, 0.026763916015625, 0.1319580078125, 0.04803466796875, 0.0787353515625, 0.09942626953125, 0.09942626953125, 0.1341552734375,...

embed

27585900_c0

27585900

haskell

0

Title: haskell, is it possible to debug a parse error? Problem title: haskell, is it possible to debug a parse error? Tags: haskell Problem: haskell, is it possible to debug a parse error? I am working through some exercises I found accompanying a set of lectures online and have come across a problem I cannot overcome,...

haskell, is it possible to debug a parse error? haskell, is it possible to debug a parse error? haskell Integer x:x1:xs Parse haskell, is it possible to debug a parse error? I am working through some exercises I found accompanying a set of lectures online and have come across a problem I cannot overcome, essentially, I...

[ 0.006378173828125, 0.016845703125, -0.01019287109375, 0.0240478515625, 0.00119781494140625, 0.03466796875, -0.0264892578125, -0.00830078125, 0.009521484375, -0.02001953125, 0.0098876953125, -0.04150390625, 0.024658203125, -0.01544189453125, 0.000308990478515625, 0.029052734375, -0.01...

[ 1556, 142508, 83, 442, 7722, 8, 85779, 366, 184, 18499, 47, 10, 44401, 1022, 12, 425, 82825, 2392, 81979, 59619, 1118, 2967, 53418, 645, 45738, 32354, 61924, 11435, 54799, 72367, 2046, 4734, 903, 1543, 145755, 3917, 31380, 318, 14192, 268...

[ 0.1490478515625, 0.24853515625, 0.06597900390625, 0.0281524658203125, 0.1500244140625, 0.1591796875, 0.291015625, 0.1435546875, 0.1552734375, 0.2147216796875, 0.033355712890625, 0.0587158203125, 0.144287109375, 0.06634521484375, 0.003936767578125, 0.07769775390625, 0.0870361328125, ...

embed

29875831_c0

29875831

haskell

0

Title: Missing attributes for links and other types of elements in pandoc Problem title: Missing attributes for links and other types of elements in pandoc Tags: pandoc, haskell Problem: Missing attributes for links and other types of elements in pandoc I am trying to use pandoc (with hakyll , but this is probably not ...

Missing attributes for links and other types of elements in pandoc Missing attributes for links and other types of elements in pandoc pandoc haskell Text.Pandoc Text.Pandoc.Walk Missing _blank Inline Span Link Image RawInline Pandoc StackOverflow stackoverflow.com Missing attributes for links and other types of element...

[ -0.022216796875, -0.00628662109375, 0.00183868408203125, -0.01495361328125, -0.005584716796875, -0.0133056640625, -0.0042724609375, -0.00970458984375, -0.006134033203125, -0.01495361328125, 0.0031585693359375, -0.03662109375, 0.0084228515625, 0.004119873046875, -0.006744384765625, -0.0...

[ 16771, 214, 150380, 90, 100, 22317, 52895, 80854, 2652, 29713, 1556, 142508, 24129, 55956, 97207, 165839, 360, 2256, 63438, 12779, 22710, 109997, 4153, 4378, 156673, 118664, 177261, 5465, 31577, 4527, 76228, 256, 1002, 1181, 5526, 69307, 4764, ...

[ 0.1839599609375, 0.0291748046875, 0.238037109375, 0.0841064453125, 0.041595458984375, 0.23193359375, 0.1478271484375, 0.1683349609375, 0.1700439453125, 0.255615234375, 0.111328125, 0.219482421875, 0.098876953125, 0.0955810546875, 0.113525390625, 0.190185546875, 0.1402587890625, 0.2...

embed

54690534_c0

54690534

haskell

0

Title: Understanding (Traversable Product) Type Problem title: Understanding (Traversable Product) Type Tags: haskell Problem: Understanding (Traversable Product) Type Given the following from fp-course : data Product f g a = Product (f a) (g a) class Functor f where -- Pronounced, eff-map. (<$>) :: (a -> b) -> f a -> ...

Understanding (Traversable Product) Type Understanding (Traversable Product) Type haskell Understanding Traversable Product Type Functor Pronounced Applicative Course Traversable.hs:106:33 Occurs Expected Actual Understanding (Traversable Product) Type Given the following from fp-course : I attempted to define the Trav...

[ -0.0004100799560546875, 0.032958984375, -0.0196533203125, 0.0123291015625, -0.003997802734375, 0.00848388671875, -0.016357421875, 0.0022430419921875, 0.008056640625, -0.004547119140625, 0.0145263671875, -0.006317138671875, -0.00128936767578125, -0.0054931640625, -0.00640869140625, 0.00...

[ 9626, 144057, 28542, 7864, 2886, 73111, 60457, 1556, 142508, 4937, 28670, 18770, 19, 5659, 11048, 4935, 154162, 127, 54100, 31191, 48650, 60075, 13, 100582, 1238, 254, 100599, 81887, 61924, 110527, 706, 10, 9969, 34759, 18499, 28219, 759, 809...

[ 0.13232421875, 0.1495361328125, 0.1402587890625, 0.22802734375, 0.2288818359375, 0.257080078125, 0.23486328125, 0.1290283203125, 0.212890625, 0.169677734375, 0.10382080078125, 0.08837890625, 0.045166015625, 0.1224365234375, 0.15673828125, 0.1097412109375, 0.103271484375, 0.01863098...

embed

18534489_c0

18534489

haskell

0

Title: Can all constraints on data be represented as Algebraic Data Types? Problem title: Can all constraints on data be represented as Algebraic Data Types? Tags: haskell, algebraic-data-types Problem: Can all constraints on data be represented as Algebraic Data Types? Can all constraints on data and state be represen...

Can all constraints on data be represented as Algebraic Data Types? Can all constraints on data be represented as Algebraic Data Types? haskell algebraic-data-types Can Algebraic Data Types Can all constraints on data be represented as Algebraic Data Types? Can all constraints on data and state be represented as Algebr...

[ 0.0034332275390625, -0.005096435546875, -0.0079345703125, 0.0257568359375, 0.006622314453125, 0.003875732421875, -0.01544189453125, 0.0091552734375, -0.00701904296875, -0.00482177734375, -0.015869140625, -0.025146484375, 0.001220703125, 0.031494140625, -0.0042724609375, 0.02490234375, ...

[ 4171, 756, 158, 2816, 4288, 98, 2053, 33636, 297, 237, 884, 429, 2844, 1771, 11809, 60457, 1556, 142508, 144, 10135, 50986, 11341, 5161, 19048, 36510, 5426, 62, 41072, 3164, 7722, 142424, 117249, 110, 70820, 23, 25553, 6892, 11343, 7225, ...

[ 0.09130859375, 0.1434326171875, 0.1361083984375, 0.2257080078125, 0.18310546875, 0.1070556640625, 0.2012939453125, 0.213623046875, 0.0224761962890625, 0.039825439453125, 0.05615234375, 0.10986328125, 0.1658935546875, 0.06939697265625, 0.172119140625, 0.244140625, 0.09234619140625, ...

embed

40523355_c0

40523355

haskell

0

Title: How do I avoid referring to all state variables when updating only a few? Problem title: How do I avoid referring to all state variables when updating only a few? Tags: state-monad, haskell Problem: How do I avoid referring to all state variables when updating only a few? An idiom I use for composing a couple of...

How do I avoid referring to all state variables when updating only a few? How do I avoid referring to all state variables when updating only a few? state-monad haskell How State Bool IORef How do I avoid referring to all state variables when updating only a few? An idiom I use for composing a couple of procedures (with...

[ -0.0137939453125, 0.00970458984375, 0.00897216796875, 0.020751953125, -0.006500244140625, -0.006072998046875, -0.0242919921875, 0.002197265625, 0.0145263671875, 0.0142822265625, 0.002166748046875, 0.0211181640625, -0.00186920166015625, 0.01513671875, 0.0120849609375, 0.00244140625, -...

[ 11249, 71864, 15005, 2852, 47, 756, 11341, 77336, 7, 1257, 56464, 4734, 10846, 3796, 712, 1556, 142508, 22836, 2460, 929, 123435, 4240, 13373, 306, 4527, 9969, 232, 24941, 50491, 76228, 98323, 14012, 55993, 69405, 57823, 3917, 51, 33740, 47...

[ 0.058807373046875, 0.1962890625, 0.1661376953125, 0.049560546875, 0.051971435546875, 0.10577392578125, 0.18896484375, 0.26025390625, 0.06103515625, 0.14990234375, 0.1728515625, 0.095458984375, 0.1358642578125, 0.07977294921875, 0.1209716796875, 0.1129150390625, 0.2099609375, 0.1824...

embed

50844444_c1

50844444

haskell

1

b) -> a -> p n -> p (S n) mapFB cons f = \x ys -> cons (f x) ys {-# INLINE [0] mapFB #-} {-# NOINLINE [0] mapVect #-} {-# RULES "mapVect" [~1] forall f xs. mapVect f xs = buildVect (\nil cons -> foldVect nil (mapFB cons f) xs) #-} {-# INLINE [0] foldVect #-} -- base has this; I don't think it does anything without a "...

[ -0.01611328125, 0.0164794921875, 0.00872802734375, -0.01416015625, 0.0008697509765625, 0.0081787109375, -0.00762939453125, -0.0126953125, 0.013671875, -0.0133056640625, 0.0003833770751953125, -0.02001953125, 0.007568359375, 0.021484375, -0.01324462890625, -0.0128173828125, -0.0015716...

[ 876, 33079, 10, 915, 653, 294, 22288, 101865, 158, 7, 1238, 113, 1022, 5881, 57339, 9520, 8852, 856, 24762, 46845, 47138, 62346, 5584, 45367, 17324, 42822, 3647, 1556, 903, 5351, 14602, 107, 214, 79986, 177149, 567, 25553, 347, 68875, 604...

[ 0.1304931640625, 0.0227508544921875, 0.07733154296875, 0.07269287109375, 0.062744140625, 0.00848388671875, 0.16796875, 0.20849609375, 0.2298583984375, 0.046844482421875, 0.1112060546875, 0.05328369140625, 0.02801513671875, 0.084716796875, 0.2178955078125, 0.07232666015625, 0.02655029...

embed

70628303_c1

70628303

haskell

1

Const a) = a eval (Mul a b) = (eval a) `mul` (eval b) <-- this line makes the problem visible in ghci I get the following error *Main> :r [2 of 3] Compiling Lib ( /home/michael/git/brokensquanchy/src/Lib.hs, interpreted ) /home/michael/git/brokensquanchy/src/Lib.hs:45:18: error: • Occurs check: cannot construct the inf...

[ -0.01123046875, -0.0142822265625, 0.0224609375, 0.0234375, 0.01019287109375, 0.004852294921875, -0.0118408203125, -0.0123291015625, -0.0123291015625, -0.01519775390625, -0.013916015625, -0.005767822265625, 0.0198974609375, -0.004913330078125, -0.026123046875, -0.0216064453125, 0.0123...

[ 1657, 271, 10, 2203, 28, 1405, 50657, 876, 13, 15458, 13315, 2967, 75693, 31380, 318, 25632, 18499, 168793, 42, 138, 15612, 49725, 43278, 29552, 1436, 583, 15769, 180407, 1755, 13722, 19, 7668, 19437, 104820, 127, 29481, 15989, 24033, 768, ...

[ 0.14453125, 0.150390625, 0.1395263671875, 0.061279296875, 0.0814208984375, 0.258544921875, 0.137451171875, 0.1339111328125, 0.06939697265625, 0.1669921875, 0.0175018310546875, 0.1148681640625, 0.119384765625, 0.09222412109375, 0.1346435546875, 0.0377197265625, 0.1663818359375, 0.10...

embed

71207242_c0

71207242

haskell

0

Title: Why aren't composed self-recursive functions with same data structure (same dims) on in and out inlined together with other recursions? Problem title: Why aren't composed self-recursive functions with same data structure (same dims) on in and out inlined together with other recursions? Tags: compiler-o...

Why aren't composed self-recursive functions with same data structure (same dims) on in and out inlined together with other recursions? Why aren't composed self-recursive functions with same data structure (same dims) on in and out inlined together with other recursions? compiler-optimization ghc haskell opti...

[ -0.00811767578125, -0.005279541015625, 0.0030059814453125, 0.010986328125, -0.01953125, 0.00439453125, -0.0004100799560546875, -0.01263427734375, -0.00170135498046875, -0.0031280517578125, -0.004180908203125, -0.029296875, -0.00408935546875, 0.0181884765625, 0.01397705078125, -0.017089...

[ 44084, 125381, 3768, 18, 150350, 15970, 107, 48650, 5844, 32354, 678, 5701, 2053, 45646, 40175, 34355, 7, 98, 136, 1810, 23, 2256, 25842, 195625, 17514, 3789, 9969, 34759, 100433, 31380, 238, 1556, 142508, 87235, 22288, 2389, 1022, 425, 183...

[ 0.0938720703125, 0.03802490234375, 0.0291748046875, 0.08026123046875, 0.2080078125, 0.132080078125, 0.034576416015625, 0.1719970703125, 0.05084228515625, 0.1717529296875, 0.0279388427734375, 0.113525390625, 0.0692138671875, 0.1558837890625, 0.10174560546875, 0.16357421875, 0.08068847...

embed

45498859_c1

45498859

haskell

1

type: a -> a * In the first argument of `diff', namely `f' In the second argument of `(/)', namely `(diff f x)' In the second argument of `(-)', namely `(f x) / (diff f x)' * Relevant bindings include x :: a (bound at fsolve.hs:8:10) f :: a -> a (bound at fsolve.hs:8:8) newton :: (a -> a) -> a -> a (bound at fsolve.hs...

[ -0.0240478515625, 0.01611328125, 0.002838134765625, 0.0087890625, -0.0003223419189453125, 0.01953125, 0.00640869140625, -0.0130615234375, -0.0026702880859375, -0.0220947265625, 0.00225830078125, 0.002227783203125, 0.01068115234375, 0.01458740234375, 0.006256103515625, -0.0201416015625,...

[ 10644, 10, 33079, 661, 5117, 10750, 152462, 110987, 420, 360, 17932, 64, 1238, 1022, 9, 248, 133, 30624, 128239, 1984, 99091, 86918, 1019, 15110, 3525, 1507, 127, 138577, 4527, 93511, 1771, 12351, 126525, 92, 418, 18537, 19364, 64457, 5, ...

[ 0.2001953125, 0.1900634765625, 0.255615234375, 0.009307861328125, 0.086181640625, 0.213134765625, 0.245361328125, 0.037353515625, 0.1533203125, 0.018402099609375, 0.1241455078125, 0.141845703125, 0.134521484375, 0.111572265625, 0.0877685546875, 0.05426025390625, 0.0718994140625, 0....

embed

78112183_c0

78112183

haskell

0

Title: Factoring out common constants in pattern synonym code? Problem title: Factoring out common constants in pattern synonym code? Tags: pattern-synonyms, overloaded-strings, haskell Problem: Factoring out common constants in pattern synonym code? I had some code like this: newtype T = T Text pattern Alice = T "Alic...

Factoring out common constants in pattern synonym code? Factoring out common constants in pattern synonym code? pattern-synonyms overloaded-strings haskell Factoring Text Alice Factoring out common constants in pattern synonym code? I had some code like this: This is fine, but I was using "Alice" in other places. So I ...

[ 0.0164794921875, 0.0157470703125, -0.00860595703125, 0.03125, 0.00162506103515625, -0.0078125, -0.0048828125, -0.00201416015625, -0.00083160400390625, -0.0277099609375, -0.00023174285888671875, -0.003753662109375, 0.018310546875, 0.0050048828125, -0.006011962890625, 0.0093994140625, ...

[ 117969, 1810, 39210, 53697, 7, 103510, 164661, 18151, 23, 12654, 45757, 645, 63033, 91693, 1556, 142508, 214, 24129, 66083, 5885, 17368, 284, 13348, 31461, 1884, 88303, 1631, 6977, 33740, 77336, 2773, 20653, 14858, 26818, 384, 179459, 107003, ...

[ 0.230712890625, 0.1483154296875, 0.160400390625, 0.18994140625, 0.056915283203125, 0.2340087890625, 0.1947021484375, 0.1739501953125, 0.0135498046875, 0.05340576171875, 0.13671875, 0.0679931640625, 0.1419677734375, 0.1392822265625, 0.0751953125, 0.1842041015625, 0.00335693359375, 0...

embed

36206281_c0

36206281

haskell

0

Title: Difference between type constructor and return function of a monad (in Haskell) Problem title: Difference between type constructor and return function of a monad (in Haskell) Tags: haskell, monads Problem: Difference between type constructor and return function of a monad (in Haskell) I'm trying to figure out mo...

Difference between type constructor and return function of a monad (in Haskell) Difference between type constructor and return function of a monad (in Haskell) haskell monads Difference Haskell Just China Difference between type constructor and return function of a monad (in Haskell) I'm trying to figure out monads in ...

[ -0.002166748046875, 0.0087890625, -0.0003509521484375, 0.0218505859375, 0.0230712890625, 0.006988525390625, -0.007598876953125, 0.00457763671875, -0.00921630859375, -0.01275634765625, 0.0220947265625, -0.035888671875, -0.0024871826171875, 0.01068115234375, -0.003204345703125, -0.010986...

[ 803, 18234, 6620, 17721, 10644, 64549, 748, 136, 30646, 32354, 2667, 712, 20625, 142508, 10, 73, 1556, 7, 9563, 9098, 26366, 81415, 6495, 144057, 87039, 6468, 47959, 57143, 73342, 60212, 217064, 1295, 34475, 34292, 62822, 2053, 3638, 1884, ...

[ 0.050323486328125, 0.1627197265625, 0.04205322265625, 0.0625, 0.2529296875, 0.218994140625, 0.1773681640625, 0.02215576171875, 0.264404296875, 0.1767578125, 0.1483154296875, 0.193115234375, 0.106689453125, 0.22119140625, 0.0187225341796875, 0.0183258056640625, 0.07489013671875, 0.0...

embed

41306420_c0

41306420

haskell

0

Title: Point-free destructuring with GHC Problem title: Point-free destructuring with GHC Tags: union, pattern-matching, haskell, ghc Problem: Point-free destructuring with GHC I do not like to destructure sum typed values with pattern matching. It feels alien for me because of its pointed style. I rather write and use...

Point-free destructuring with GHC Point-free destructuring with GHC union pattern-matching haskell ghc Point-free GHC Either Processor MakeProcessor Left Right Result Fail Success Point-free destructuring with GHC I do not like to destructure sum typed values with pattern matching. It feels alien for me because of its ...

[ -0.00836181640625, 0.021728515625, 0.00750732421875, -0.01556396484375, -0.0103759765625, -0.0228271484375, -0.033935546875, -0.00335693359375, 0.0186767578125, -0.0196533203125, 0.00023937225341796875, -0.024169921875, 0.019775390625, -0.0081787109375, -0.0062255859375, 0.011047363281...

[ 41097, 32087, 8, 36716, 53089, 678, 527, 73265, 69941, 103510, 98753, 1556, 142508, 31380, 238, 4565, 9319, 170582, 26176, 26531, 636, 2480, 90911, 126684, 190355, 144053, 959, 1884, 137656, 10554, 10644, 142424, 14858, 214, 12319, 66961, 6275,...

[ 0.136474609375, 0.17578125, 0.16357421875, 0.1373291015625, 0.0650634765625, 0.043212890625, 0.0870361328125, 0.2071533203125, 0.0987548828125, 0.16259765625, 0.14892578125, 0.0924072265625, 0.2081298828125, 0.099365234375, 0.0709228515625, 0.0980224609375, 0.2210693359375, 0.15148...

embed

20548518_c0

20548518

haskell

0

Title: Parsing Printable Text File in Haskell Problem title: Parsing Printable Text File in Haskell Tags: parsing, text, haskell Problem: Parsing Printable Text File in Haskell I'm trying to figure out the "right" way to parse a particular text file in Haskell. In F#, I loop over each line, testing it against a regular...

Parsing Printable Text File in Haskell Parsing Printable Text File in Haskell parsing text haskell Parsing Printable Text File Haskell COMPANY NAME PROGRAM LISTING STATE PRODUCT ProductName DESCRIPTION REPORT DATE Blah DIVISION XYZ FAA3 AGENT PAGE TARGET X-DATE YEAR ENCODING SMITH JOHN ABC SIZE JANE ACME YELLOW DOE MIC...

[ -0.0185546875, -0.0169677734375, 0.00897216796875, 0.03369140625, -0.0038604736328125, 0.01556396484375, -0.0252685546875, -0.0003604888916015625, 0.011474609375, 0.01031494140625, -0.01513671875, 0.00146484375, -0.02392578125, -0.026611328125, 0.004119873046875, 0.01495361328125, 0....

[ 2392, 6953, 39754, 2886, 24129, 42724, 23, 20625, 142508, 366, 7986, 1556, 61898, 182512, 59677, 67616, 144792, 183575, 73111, 163612, 145269, 1566, 5419, 222562, 143907, 15491, 363, 24639, 436, 55734, 397, 9688, 95409, 232105, 47457, 10000, 82...

[ 0.1968994140625, 0.0560302734375, 0.1993408203125, 0.1474609375, 0.185791015625, 0.1998291015625, 0.041778564453125, 0.1607666015625, 0.274169921875, 0.1685791015625, 0.150634765625, 0.1326904296875, 0.095703125, 0.02191162109375, 0.10113525390625, 0.016998291015625, 0.02110290527343...

embed

44023915_c0

44023915

haskell

0

Title: Operation on newly created data (update an array) Problem title: Operation on newly created data (update an array) Tags: functional-programming, haskell Problem: Operation on newly created data (update an array) I've created the following data types. {- Data declaration predefined in Haskell -} data Maybe_ a = N...

Operation on newly created data (update an array) Operation on newly created data (update an array) functional-programming haskell Operation Data Haskell Maybe_ Nothing_ Just_ Show Array Array_ new_value Operation on newly created data (update an array) I've created the following data types. Now, I'd like to create an ...

[ -0.02685546875, 0.016845703125, 0.01397705078125, 0.0012359619140625, 0.00799560546875, 0.016845703125, -0.00799560546875, 0.02001953125, 0.0157470703125, 0.022705078125, 0.01116943359375, -0.01806640625, -0.00811767578125, -0.00921630859375, 0.01611328125, -0.0255126953125, 0.013427...

[ 102203, 98, 3525, 75935, 2053, 117008, 10298, 53, 123309, 28966, 1556, 142508, 11809, 20625, 83425, 182747, 9563, 17367, 69253, 27494, 25632, 52895, 1884, 28282, 28350, 32354, 34475, 63262, 454, 136, 34292, 70, 99, 11853, 138256, 3688, 28484, ...

[ 0.1868896484375, 0.06298828125, 0.093994140625, 0.1134033203125, 0.155029296875, 0.237060546875, 0.130615234375, 0.0831298828125, 0.126708984375, 0.06591796875, 0.108154296875, 0.231201171875, 0.087158203125, 0.12255859375, 0.1544189453125, 0.09912109375, 0.1182861328125, 0.1342773...

embed

30486428_c1

30486428

haskell

1

iling TestInformation ( TestInformation.hs, interpreted ) TestInformation.hs:36:18: Couldn't match type ‘Response body10’ with ‘IO (Response Data.ByteString.Lazy.Internal.ByteString)’ Expected type: (body10 -> Const Data.ByteString.Lazy.Internal.ByteString body10) -> IO (Response Data.ByteString.Lazy.Internal.ByteStrin...

[ -0.01361083984375, 0.01312255859375, 0.000020384788513183594, 0.004150390625, 0.0020904541015625, -0.0005340576171875, -0.011962890625, -0.0203857421875, -0.01116943359375, 0.01904296875, 0.0008087158203125, 0.02392578125, -0.01092529296875, -0.0018768310546875, -0.004425048828125, 0.0...

[ 17, 2069, 8647, 205169, 127, 29481, 7, 32944, 24033, 12, 191147, 18, 14858, 10644, 94399, 13, 14361, 963, 678, 17780, 11809, 75358, 71713, 2729, 3285, 44851, 60075, 37873, 1657, 50258, 33079, 100582, 92748, 5117, 10750, 5, 110987, 134719, 1...

[ 0.1927490234375, 0.26513671875, 0.168701171875, 0.2464599609375, 0.108154296875, 0.1593017578125, 0.021697998046875, 0.125, 0.1436767578125, 0.00299072265625, 0.1414794921875, 0.131591796875, 0.2105712890625, 0.209716796875, 0.1883544921875, 0.099853515625, 0.1900634765625, 0.23791...

embed

64160671_c0

64160671

haskell

0

Title: Reading dot files with graphviz package in haskell Problem title: Reading dot files with graphviz package in haskell Tags: graphviz, layout, haskell, dot Problem: Reading dot files with graphviz package in haskell For a program i have to reformat a dot file in Haskell to adjust the layout of its tree/content. I ...

Reading dot files with graphviz package in haskell Reading dot files with graphviz package in haskell graphviz layout haskell dot Reading Reading dot files with graphviz package in haskell For a program i have to reformat a dot file in Haskell to adjust the layout of its tree/content. I decided to use https://hackage.h...

[ 0.00970458984375, 0.017578125, -0.019775390625, -0.01336669921875, -0.004638671875, 0.00921630859375, -0.0211181640625, -0.01507568359375, -0.000896453857421875, -0.033447265625, 0.01513671875, -0.006622314453125, -0.0128173828125, 0.0037994384765625, -0.003936767578125, -0.00332641601...

[ 104951, 20633, 102158, 678, 41382, 22572, 98169, 1556, 142508, 23, 108802, 1528, 23491, 18, 11435, 20625, 126596, 53201, 69246, 4527, 139509, 10557, 29102, 56989, 5046, 1549, 102107, 29713, 137989, 37878, 11727, 6609, 169, 7693, 45767, 8781, 57...

[ 0.1861572265625, 0.234130859375, 0.1695556640625, 0.04425048828125, 0.175537109375, 0.2269287109375, 0.16845703125, 0.097900390625, 0.221435546875, 0.0175628662109375, 0.20751953125, 0.0802001953125, 0.1544189453125, 0.1087646484375, 0.1575927734375, 0.09649658203125, 0.176025390625,...

embed

10296185_c0

10296185

haskell

0

Title: Haskell : hide function in module (i.e. make function usable only by other functions in same module) Problem title: Haskell : hide function in module (i.e. make function usable only by other functions in same module) Tags: haskell, winghci, ghci, ghc Problem: Haskell : hide function in module (i.e. make function...

Haskell : hide function in module (i.e. make function usable only by other functions in same module) Haskell : hide function in module (i.e. make function usable only by other functions in same module) haskell winghci ghci ghc Haskell i.e NecessaryModule addNumber1 addNumber2 test2.hs Test2 Haskell : hide function in m...

[ 0.008056640625, -0.0101318359375, 0.0020904541015625, 0.0247802734375, -0.0010986328125, 0.01220703125, 0.007537841796875, -0.001953125, 0.0078125, 0.016357421875, -0.0113525390625, -0.0247802734375, -0.007537841796875, 0.000499725341796875, -0.0036468505859375, 0.0020904541015625, -...

[ 20625, 142508, 1274, 112, 32354, 23, 88996, 3249, 1821, 2886, 4734, 3789, 5701, 1556, 14775, 318, 161467, 7, 6635, 91616, 8782, 15190, 18444, 26278, 418, 304, 3034, 5442, 127, 8647, 11435, 70796, 15044, 19882, 43581, 70820, 3917, 1284, 959,...

[ 0.1231689453125, 0.23779296875, 0.1865234375, 0.17626953125, 0.2130126953125, 0.063720703125, 0.2044677734375, 0.02716064453125, 0.08868408203125, 0.046905517578125, 0.032684326171875, 0.061767578125, 0.054595947265625, 0.092529296875, 0.03887939453125, 0.0147705078125, 0.14575195312...

embed

37092580_c1

37092580

haskell

1

HIndex (x ': xs) Zero x where hIndex (x ::: xs) HZero = x instance HIndex xs i y => HIndex (x ': xs) (Succ i) y where hIndex (x ::: xs) (HSucc i) = hIndex xs i The Issue With that established I'll demonstrate the issue. Suppose I construct an HList containing a function that itself takes an HList and does something wi...

[ -0.00775146484375, 0.01104736328125, -0.00970458984375, -0.01214599609375, 0.0003185272216796875, -0.0162353515625, 0.01416015625, 0.0062255859375, 0.0133056640625, -0.0257568359375, -0.0225830078125, -0.0166015625, -0.0091552734375, 0.00543212890625, 0.01214599609375, -0.024658203125,...

[ 35848, 1067, 425, 242, 12, 1022, 7, 83947, 7440, 1096, 4153, 39659, 1984, 194718, 4036, 110527, 17, 113, 14168, 10060, 38131, 34, 223317, 170920, 106804, 31089, 121691, 87, 64549, 572, 154663, 70541, 32354, 450, 68034, 51776, 14602, 5117, 1...

[ 0.1619873046875, 0.1885986328125, 0.1773681640625, 0.023590087890625, 0.006561279296875, 0.1357421875, 0.08642578125, 0.2291259765625, 0.00201416015625, 0.1353759765625, 0.1427001953125, 0.2191162109375, 0.034149169921875, 0.0784912109375, 0.203125, 0.232666015625, 0.086669921875, ...

embed

37894290_c1

37894290

haskell

1

KStat s a) s’ which kind of makes sense, but then if I change KStat s a to KStat in the instance header I get this error: src/KindLang/Data/KStat.hs:27:10: Type synonym ‘KStat’ should have 2 arguments, but has been given none In the instance declaration for ‘MStat KStat s’ which seems to basically saying the exact oppo...

[ -0.00872802734375, 0.033935546875, -0.011474609375, -0.0262451171875, 0.0012664794921875, -0.003662109375, -0.002899169921875, -0.03125, 0.000804901123046875, -0.003997802734375, 0.0068359375, 0.002166748046875, -0.0048828125, -0.017333984375, -0.01348876953125, -0.0224609375, 0.0018...

[ 341, 135206, 91, 10, 16, 26, 8562, 30482, 10422, 1284, 15549, 47, 110527, 10336, 56, 903, 18499, 19437, 605, 7250, 2729, 449, 137989, 20113, 3935, 127, 27592, 15110, 60457, 164661, 5608, 765, 116, 10750, 1556, 2809, 34475, 351, 13, 21635,...

[ 0.1700439453125, 0.299072265625, 0.1575927734375, 0.14501953125, 0.0151824951171875, 0.08074951171875, 0.00714111328125, 0.025054931640625, 0.1102294921875, 0.07049560546875, 0.16259765625, 0.048492431640625, 0.22216796875, 0.1419677734375, 0.094482421875, 0.03948974609375, 0.2178955...

embed

16993831_c0

16993831

haskell

0

Title: Bug in while loop Problem title: Bug in while loop Tags: loops, haskell Problem: Bug in while loop I can't figure out what the bug is in the toy while loop I wrote below. It works for one input, but hangs for other inputs. Here is the code - the while loop takes a vector, a predicate on vector, and transformatio...

Bug in while loop Bug in while loop loops haskell Data.Vector.Unboxed Bug Vector Bool U.map U.fromList GHC Bug in while loop I can't figure out what the bug is in the toy while loop I wrote below. It works for one input, but hangs for other inputs. Here is the code - the while loop takes a vector, a predicate on vector...

[ 0.00555419921875, 0.021240234375, 0.004608154296875, 0.0146484375, 0.018310546875, 0.006103515625, -0.014892578125, -0.005096435546875, -0.00872802734375, -0.0245361328125, 0.00086212158203125, 0.016357421875, -0.012939453125, 0.0203857421875, 0.015380859375, -0.004974365234375, 0.00...

[ 57279, 23, 12960, 40956, 1556, 142508, 11809, 26455, 18770, 14256, 11728, 2609, 2460, 929, 345, 62346, 161063, 154663, 527, 73265, 831, 26366, 1810, 2367, 54608, 83, 72713, 35064, 43240, 100, 1632, 107730, 1284, 10756, 3789, 18151, 51776, 173...

[ 0.2222900390625, 0.08892822265625, 0.238037109375, 0.224853515625, 0.1209716796875, 0.2181396484375, 0.04266357421875, 0.1199951171875, 0.150390625, 0.0318603515625, 0.1470947265625, 0.159912109375, 0.0227813720703125, 0.1121826171875, 0.019805908203125, 0.0826416015625, 0.0747680664...

embed

70230144_c0

70230144

haskell

0

Title: Reachable nodes in a graph Problem title: Reachable nodes in a graph Tags: graph, haskell Problem: Reachable nodes in a graph I want to check from which nodes a node is reachable. So I want to give a graph and node and return a list of all nodes where I can reach the graph from. (I know there is Data.Graph, but ...

Reachable nodes in a graph Reachable nodes in a graph graph haskell Reachable Node node1 node2 node3 node4 node5 Reachable nodes in a graph I want to check from which nodes a node is reachable. So I want to give a graph and node and return a list of all nodes where I can reach the graph from. (I know there is Data.Grap...

[ -0.017822265625, 0.018798828125, 0.00384521484375, 0.04443359375, -0.0023651123046875, -0.01373291015625, -0.01190185546875, -0.0223388671875, 0.0167236328125, -0.0206298828125, -0.007049560546875, -0.03125, 0.007354736328125, 0.0120849609375, -0.0023040771484375, -0.006072998046875, ...

[ 853, 934, 2886, 110, 988, 23, 41382, 1556, 142508, 438, 112, 418, 304, 363, 617, 758, 3444, 47, 12765, 1295, 3129, 83, 58359, 8337, 136, 30646, 5303, 831, 11809, 37878, 11727, 28219, 4527, 45367, 25632, 23351, 214, 18811, 9351, 80581, 6...

[ 0.11083984375, 0.20458984375, 0.2069091796875, 0.188232421875, 0.1754150390625, 0.055145263671875, 0.2293701171875, 0.1273193359375, 0.20751953125, 0.1805419921875, 0.14453125, 0.0208587646484375, 0.007904052734375, 0.0261077880859375, 0.0654296875, 0.1143798828125, 0.0225830078125, ...

embed

57229411_c1

57229411

haskell

1

50) , Turn (RLit 90) , Forward (RLit 50) , Turn (RLit 90) , Forward (RLit 50) ] snd (deState (turbo stmt) initTurboMem) Here is the function in question that isn't taking previous statements into consideration turbo (Seq [x]) = turbo x turbo (Seq (x:xs)) = do state <- get let a0 = snd (deState (turbo x) state) state <...

[ 0.01373291015625, -0.01446533203125, -0.0115966796875, 0.004425048828125, 0.0115966796875, -0.006256103515625, -0.003997802734375, -0.007232666015625, 0.0096435546875, -0.002197265625, -0.0108642578125, 0.032470703125, -0.002166748046875, 0.0267333984375, -0.01080322265625, 0.017211914...

[ 836, 16, 4, 41961, 30121, 217, 2510, 1326, 19364, 91, 2208, 112, 135206, 987, 837, 6138, 39, 18, 23, 42671, 594, 195, 11853, 32354, 9655, 450, 56112, 35971, 96362, 63805, 177229, 94779, 4233, 864, 425, 1022, 11341, 2046, 2633, 10, 2389,...

[ 0.2197265625, 0.0748291015625, 0.0250396728515625, 0.214599609375, 0.049102783203125, 0.1478271484375, 0.2042236328125, 0.06304931640625, 0.188232421875, 0.006622314453125, 0.132080078125, 0.163818359375, 0.1676025390625, 0.094970703125, 0.1507568359375, 0.0192718505859375, 0.0512695...

embed

57516944_c1

57516944

haskell

1

22:18:21 GMT"),("Via","1.1 varnish"),("Connection","keep-alive"),("X-Served-By","cache-mxp19828-MXP"),("X-Cache","MISS"),("X-Cache-Hits","0"),("X-Timer","S1565907502.529821,VS0,VE176"),("Vary","Authorization,Accept-Encoding"),("Access-Control-Allow-Origin","*"),("X-Fastly-Request-ID","9f869169dd207bbd8bb8a8fd4b274acf6...

[ -0.01324462890625, 0.0179443359375, 0.0191650390625, -0.011962890625, 0.000453948974609375, 0.0016632080078125, -0.0166015625, -0.0036163330078125, 0.0096435546875, 0.01031494140625, 0.005126953125, -0.00823974609375, 0.007476806640625, 0.00433349609375, 0.0015869140625, 0.005340576171...

[ 1039, 24033, 25619, 99961, 36246, 92134, 285, 78183, 235603, 1830, 350, 4517, 24056, 1542, 63771, 75358, 408, 1430, 425, 254, 159027, 1019, 88939, 683, 46994, 53695, 841, 14481, 2389, 70059, 294, 155740, 116708, 48413, 122381, 3117, 47207, 24...

[ 0.04608154296875, 0.064697265625, 0.1160888671875, 0.1356201171875, 0.1986083984375, 0.1292724609375, 0.06549072265625, 0.0936279296875, 0.142822265625, 0.060150146484375, 0.0745849609375, 0.1116943359375, 0.18359375, 0.193359375, 0.1602783203125, 0.197021484375, 0.0843505859375, 0...

embed

40859405_c0

40859405

haskell

0

Title: In the meantime, how do I get executable coverage with stack? Problem title: In the meantime, how do I get executable coverage with stack? Tags: haskell, haskell-stack, code-coverage Problem: In the meantime, how do I get executable coverage with stack? My program consists of 4 executables, and basically zero li...

In the meantime, how do I get executable coverage with stack? In the meantime, how do I get executable coverage with stack? haskell haskell-stack code-coverage -optP.stack-work/dist/x86_64-linux/Cabal-1.24.0.0/build/autogen/cabal_macros.h x86_64-linux ghc-8.0.1 Cabal-1.24.0.0 i.stack-work optP.stack-work cabal_macros.h...

[ 0.0004024505615234375, 0.0026397705078125, -0.00051116943359375, 0.0098876953125, -0.00732421875, 0.0146484375, -0.0086669921875, -0.01446533203125, -0.0014495849609375, -0.020751953125, -0.0087890625, 0.0089111328125, 0.0045166015625, 0.004669189453125, 0.0106201171875, 0.029052734375...

[ 29459, 6032, 3642, 2046, 71924, 2886, 154271, 678, 177261, 1556, 142508, 590, 2594, 18151, 63127, 4588, 2146, 683, 18244, 46295, 15276, 13307, 2397, 6077, 20370, 3571, 5759, 20682, 99929, 177149, 8913, 1409, 408, 3666, 127, 17376, 102014, 304...

[ 0.086181640625, 0.0606689453125, 0.040679931640625, 0.0911865234375, 0.208984375, 0.1226806640625, 0.246826171875, 0.090087890625, 0.269775390625, 0.129638671875, 0.2401123046875, 0.1611328125, 0.1534423828125, 0.1431884765625, 0.194580078125, 0.099365234375, 0.03411865234375, 0.04...

embed

19455333_c0

19455333

haskell

0

Title: Termination checking in functional programs Problem title: Termination checking in functional programs Tags: denotational-semantics, haskell, agda Problem: Termination checking in functional programs Are there functional languages that can specify, in the typechecker, whether or not a certain computation is guar...

Termination checking in functional programs Termination checking in functional programs denotational-semantics haskell agda Termination Bool Lifted Termination checking in functional programs Are there functional languages that can specify, in the typechecker, whether or not a certain computation is guaranteed to termi...

[ 0.01275634765625, 0.01513671875, -0.00653076171875, -0.00262451171875, 0.0004215240478515625, -0.00860595703125, 0.0029754638671875, 0.0033416748046875, -0.01068115234375, -0.0267333984375, -0.01263427734375, -0.005706787109375, -0.00836181640625, 0.00171661376953125, 0.00872802734375, ...

[ 27366, 2320, 175199, 123309, 103391, 8, 58358, 43315, 5765, 109109, 1556, 142508, 1377, 85, 2460, 929, 166562, 297, 46876, 831, 40140, 10644, 78292, 56, 36766, 959, 24233, 181135, 1363, 83, 142027, 47, 121011, 13, 54, 20625, 12342, 756, 122...

[ 0.2366943359375, 0.095458984375, 0.231689453125, 0.2020263671875, 0.1741943359375, 0.0141754150390625, 0.0885009765625, 0.002197265625, 0.000244140625, 0.0287628173828125, 0.0994873046875, 0.25244140625, 0.095947265625, 0.14697265625, 0.1068115234375, 0.2008056640625, 0.237060546875,...

embed

48797597_c0

48797597

haskell

0

Title: Why strictness makes performance worse in Haskell Problem title: Why strictness makes performance worse in Haskell Tags: lazy-evaluation, haskell Problem: Why strictness makes performance worse in Haskell I played with strict evaluations, vectors and matrices and got a rather strange result. There is the followi...

Why strictness makes performance worse in Haskell Why strictness makes performance worse in Haskell lazy-evaluation haskell qualified Control.DeepSeq Why Haskell Test Data.Vector Data.Matrix M.Matrix M.nrows V.generate M.getCol V.sum V.unsafeIndex j-1 Main Why strictness makes performance worse in Haskell I played with...

[ 0.0057373046875, 0.0166015625, 0.015380859375, 0.00848388671875, 0.015869140625, -0.0103759765625, -0.006866455078125, -0.002044677734375, 0.00360107421875, -0.00885009765625, 0.00897216796875, -0.00396728515625, -0.00836181640625, 0.00732421875, -0.01513671875, 0.00811767578125, 0.0...

[ 44084, 81113, 7432, 30482, 23718, 124632, 20625, 142508, 21, 3285, 159258, 1556, 217225, 27131, 4517, 4233, 864, 8647, 11809, 26455, 18770, 87427, 15555, 310, 48281, 3794, 78457, 11832, 309, 115840, 39659, 1647, 5759, 23, 112730, 219836, 22834,...

[ 0.1021728515625, 0.255126953125, 0.146728515625, 0.105712890625, 0.174560546875, 0.177490234375, 0.15673828125, 0.26123046875, 0.042388916015625, 0.108642578125, 0.1318359375, 0.1204833984375, 0.098388671875, 0.080322265625, 0.036285400390625, 0.03509521484375, 0.043670654296875, 0...

embed

44644642_c0

44644642

haskell

0

Title: How to display overflow menu for ToolItems in a GTK Toolbar Problem title: How to display overflow menu for ToolItems in a GTK Toolbar Tags: gtk, haskell, gtk3, gtk2 Problem: How to display overflow menu for ToolItems in a GTK Toolbar A GTK Toolbar can display an overflow menu when the toolbar is not wide enough...

How to display overflow menu for ToolItems in a GTK Toolbar How to display overflow menu for ToolItems in a GTK Toolbar gtk haskell gtk3 gtk2 How ToolItems GTK Toolbar ComboBox ToolItem ToolButton gtk3 gtk2 How to display overflow menu for ToolItems in a GTK Toolbar A GTK Toolbar can display an overflow menu when the t...

[ 0.0022125244140625, 0.03564453125, -0.00433349609375, 0.00872802734375, 0.00799560546875, -0.000865936279296875, -0.0208740234375, -0.0084228515625, 0.006805419921875, 0.0130615234375, 0.0191650390625, -0.062255859375, 0.003509521484375, -0.0011444091796875, -0.006317138671875, -0.0058...

[ 11249, 44116, 645, 118664, 8026, 100, 92285, 568, 2982, 527, 29735, 1299, 23, 31472, 1556, 142508, 363, 304, 3288, 837, 72295, 82212, 55516, 959, 38134, 20174, 7639, 10941, 60213, 4488, 70541, 198, 137565, 27781, 18151, 106804, 31089, 20625, ...

[ 0.010162353515625, 0.1639404296875, 0.1331787109375, 0.258544921875, 0.2432861328125, 0.00665283203125, 0.1729736328125, 0.0309906005859375, 0.19287109375, 0.06170654296875, 0.220947265625, 0.17919921875, 0.00946044921875, 0.13818359375, 0.020538330078125, 0.18310546875, 0.076171875,...

embed

67147474_c0

67147474

haskell

0

Title: Haskell RegEx Matching on UTF8 file Problem title: Haskell RegEx Matching on UTF8 file Tags: regex, pcre, haskell, encoding Problem: Haskell RegEx Matching on UTF8 file I wrote this function module PdfParser (parseOptions) where import Text.Regex.PCRE import Data.List.Split parseOptions :: String -> [String] par...

Haskell RegEx Matching on UTF8 file Haskell RegEx Matching on UTF8 file regex pcre haskell encoding Text.Regex.PCRE Data.List.Split Test.Hspec Test.QuickCheck PdfParser Haskell RegEx Matching UTF8 OPTIONS INTERIEUR EQUIPEMENTS SERIE PdfParserSpec Spec List referential.txt Peinture Jantes Viva Stella RDIF21 Chargeur Rou...

[ -0.01336669921875, -0.0089111328125, 0.01361083984375, 0.01470947265625, -0.0086669921875, -0.009765625, 0.003143310546875, 0.018310546875, -0.015380859375, 0.01141357421875, -0.01416015625, -0.0081787109375, 0.007354736328125, -0.026611328125, 0.015869140625, 0.0035858154296875, 0.0...

[ 20625, 142508, 11678, 19279, 67407, 214, 98, 345, 30992, 1019, 11435, 6835, 3355, 36719, 107, 1556, 587, 24129, 54601, 12233, 11766, 154663, 4353, 8647, 841, 16711, 202567, 221998, 28636, 28023, 59692, 68019, 6755, 2189, 47107, 24990, 32036, ...

[ 0.151611328125, 0.250732421875, 0.1644287109375, 0.23388671875, 0.2021484375, 0.072021484375, 0.05377197265625, 0.03118896484375, 0.174072265625, 0.226318359375, 0.1666259765625, 0.1539306640625, 0.2161865234375, 0.04241943359375, 0.1651611328125, 0.14453125, 0.1202392578125, 0.122...

embed

24495135_c0

24495135

haskell

0

Title: Haskell (formidably long) palindrome check Problem title: Haskell (formidably long) palindrome check Tags: ghci, ghc, haskell, list, palindrome Problem: Haskell (formidably long) palindrome check I'm working my way up the infamous H-99 problems and I'm playing around problem #6 (find out whether a list is a pali...

Haskell (formidably long) palindrome check Haskell (formidably long) palindrome check ghci ghc haskell list palindrome Haskell x:xs Mon Jun Time Allocation Profiling Report Final h99 RTS COST CENTRE MODULE Main CAF GHC.Conc.Signal GHC.IO.Encoding GHC.IO.Encoding.Iconv GHC.IO.Handle.FD GHC.Show a..b Haskell (formidably ...

[ -0.00555419921875, 0.00543212890625, 0.00909423828125, -0.0079345703125, 0.000942230224609375, 0.0283203125, 0.013916015625, -0.0234375, -0.01806640625, -0.0135498046875, 0.0235595703125, -0.0194091796875, 0.01806640625, -0.01470947265625, -0.0003185272216796875, 0.00396728515625, 0....

[ 20625, 142508, 5037, 532, 78458, 4989, 17923, 19, 102851, 12765, 31380, 318, 238, 1556, 5303, 1022, 425, 7465, 13328, 19055, 884, 87632, 58848, 34798, 27188, 1096, 5046, 27389, 313, 34274, 89859, 98610, 12321, 166566, 527, 73265, 218723, 1778...

[ 0.134765625, 0.255859375, 0.047698974609375, 0.0911865234375, 0.1083984375, 0.1900634765625, 0.1588134765625, 0.06494140625, 0.1922607421875, 0.1920166015625, 0.06494140625, 0.0623779296875, 0.04681396484375, 0.110107421875, 0.2158203125, 0.1435546875, 0.084228515625, 0.03604125976...

embed

30569917_c1

30569917

haskell

1

iling SetupWrapper ( /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3/SetupWrapper.hs, /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3/dist/dist-sandbox-96c39190/setup/SetupWrapper.o ) [2 of 2] Compiling Main ( /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3/dist/dist-sandbox-96c39190/setup/setup.hs, /tmp/cairo-0.12.5.3-13890/cairo-0.12.5.3...

[ 0.00311279296875, 0.0146484375, 0.01373291015625, -0.000598907470703125, -0.020751953125, 0.01544189453125, -0.025634765625, -0.01446533203125, 0.00579833984375, 0.0301513671875, -0.040771484375, -0.01220703125, 0.004669189453125, -0.0301513671875, 0.007354736328125, 0.0172119140625, ...

[ 17, 2069, 19943, 2037, 1456, 219, 8079, 2676, 102241, 31, 102014, 48413, 363, 22820, 136442, 40061, 126, 127, 18, 46295, 43882, 11728, 11648, 9323, 66951, 3509, 304, 111, 116, 15612, 49725, 12321, 168793, 12779, 214, 527, 31472, 841, 7, 5...

[ 0.186279296875, 0.24267578125, 0.199462890625, 0.1783447265625, 0.02471923828125, 0.175048828125, 0.2247314453125, 0.1739501953125, 0.16455078125, 0.2188720703125, 0.080078125, 0.19189453125, 0.04541015625, 0.01885986328125, 0.174072265625, 0.018829345703125, 0.1689453125, 0.097229...

embed

59362437_c1

59362437

haskell

1

turned " ++ show (clientAge c) ++ ", have you checked out our latest " ++ intercalate ", " (clientInterestedIn c) ++ " products? Give us a visit!" server3 :: Server API server3 = position :<|> hello :<|> marketing where position :: Int -> Int -> Handler Position position x y = return (Position x y) hello :: Maybe Stri...

[ -0.007476806640625, 0.00555419921875, 0.017822265625, 0.0150146484375, -0.01019287109375, 0.0264892578125, 0.0014495849609375, -0.00555419921875, 0.00946044921875, 0.000812530517578125, -0.007598876953125, 0.0072021484375, 0.0198974609375, -0.000021696090698242188, -0.01007080078125, 0...

[ 69347, 37223, 7639, 222978, 284, 429, 501, 765, 12765, 2446, 42850, 1940, 62309, 67, 44851, 525, 297, 4153, 38742, 77878, 1821, 10, 19922, 10723, 363, 22687, 61687, 2203, 19069, 33600, 7481, 7440, 10639, 603, 99428, 113, 30646, 7192, 172, ...

[ 0.155029296875, 0.1510009765625, 0.1610107421875, 0.1888427734375, 0.046600341796875, 0.1304931640625, 0.027618408203125, 0.0208892822265625, 0.050872802734375, 0.030059814453125, 0.0401611328125, 0.041229248046875, 0.116943359375, 0.06121826171875, 0.047943115234375, 0.071533203125, ...

embed

11828654_c0

11828654

haskell

0

Title: Controlling parallel execution Problem title: Controlling parallel execution Tags: haskell, parallel-processing Problem: Controlling parallel execution Haskell provides a par combinator, which queues a "spark" for possible evaluation in parallel with the current thread. It also provides a pseq combinator, which ...

Controlling parallel execution Controlling parallel execution haskell parallel-processing Controlling Controlling parallel execution Haskell provides a par combinator, which queues a "spark" for possible evaluation in parallel with the current thread. It also provides a pseq combinator, which forces evaluation of pure ...

[ -0.0107421875, 0.031494140625, -0.0220947265625, -0.0052490234375, 0.005279541015625, -0.0020599365234375, 0.0003032684326171875, -0.032958984375, 0.011474609375, -0.02587890625, 0.0017547607421875, 0.0152587890625, 0.007537841796875, 0.0240478515625, -0.01190185546875, 0.0062561035156...

[ 27131, 2069, 95103, 71924, 1830, 1556, 142508, 63923, 20625, 87344, 366, 22321, 1290, 41, 21049, 7, 10237, 100, 7722, 219836, 678, 43581, 86997, 24828, 864, 84616, 34166, 18151, 74918, 29458, 12989, 959, 108975, 22691, 3917, 139392, 40368, 13...

[ 0.18505859375, 0.0894775390625, 0.258056640625, 0.186279296875, 0.00421142578125, 0.139892578125, 0.2802734375, 0.1319580078125, 0.1478271484375, 0.1092529296875, 0.166748046875, 0.19970703125, 0.132568359375, 0.1102294921875, 0.06829833984375, 0.072021484375, 0.18212890625, 0.0015...

embed

17591276_c0

17591276

haskell

0

Title: What programming languages have something like Haskell’s `newtype` Problem title: What programming languages have something like Haskell’s `newtype` Tags: functional-programming, haskell, newtype, programming-languages Problem: What programming languages have something like Haskell’s `newtype` The Haskell progra...

What programming languages have something like Haskell’s `newtype` What programming languages have something like Haskell’s `newtype` functional-programming haskell newtype programming-languages What Haskell Foo Bar What programming languages have something like Haskell’s `newtype` The Haskell programming language has ...

[ 0.01031494140625, 0.000598907470703125, 0.015869140625, 0.007720947265625, -0.006103515625, 0.0128173828125, -0.023681640625, 0.01263427734375, 0.007598876953125, -0.010498046875, -0.012939453125, -0.037841796875, -0.000682830810546875, -0.01055908203125, -0.0216064453125, 0.0029602050...

[ 4865, 56037, 449, 46876, 7, 765, 9844, 1884, 20625, 142508, 26, 54936, 50986, 123309, 28966, 1556, 3525, 196651, 9572, 31, 3253, 23755, 4263, 33022, 25267, 10644, 75935, 13882, 178851, 47, 1582, 100034, 142477, 17721, 6626, 234994, 64549, 528...

[ 0.05047607421875, 0.1553955078125, 0.07489013671875, 0.207763671875, 0.0205841064453125, 0.0843505859375, 0.110107421875, 0.15576171875, 0.1693115234375, 0.279296875, 0.007965087890625, 0.188232421875, 0.342529296875, 0.1361083984375, 0.131103515625, 0.114990234375, 0.1861572265625, ...

embed

39239577_c0

39239577

haskell

0

Title: Partial application of data constructor Problem title: Partial application of data constructor Tags: currying, haskell, partial-application Problem: Partial application of data constructor I don't understand why the following exercise "works" in Haskell Programming from First Principles : type Subject = String t...

Partial application of data constructor Partial application of data constructor currying haskell partial-application a Partial Subject Verb Object Sentence Show Julie Main Possible GHCi Partial application of data constructor I don't understand why the following exercise "works" in Haskell Programming from First Princi...

[ 0.0167236328125, 0.0186767578125, 0.000720977783203125, 0.0155029296875, 0.0142822265625, 0.00543212890625, 0.004730224609375, -0.006683349609375, 0.00994873046875, -0.0054931640625, 0.000324249267578125, -0.031494140625, -0.0017547607421875, 0.00994873046875, -0.00921630859375, -0.007...

[ 9148, 289, 38415, 2053, 64549, 748, 198555, 1556, 142508, 2878, 101687, 94341, 1446, 134549, 63999, 6620, 17367, 64672, 12321, 527, 73265, 14, 18, 28219, 15400, 25632, 81979, 18244, 20625, 27958, 1295, 23972, 79680, 1577, 228006, 903, 31380, ...

[ 0.146484375, 0.06317138671875, 0.1220703125, 0.0904541015625, 0.1558837890625, 0.05517578125, 0.08984375, 0.07611083984375, 0.2227783203125, 0.1370849609375, 0.1407470703125, 0.10540771484375, 0.1175537109375, 0.2139892578125, 0.1239013671875, 0.10888671875, 0.1522216796875, 0.1000...

embed

72191993_c0

72191993

haskell

0

Title: Haskell Recursion Function (guards required) Problem title: Haskell Recursion Function (guards required) Tags: haskell, palindrome, recursion Problem: Haskell Recursion Function (guards required) Can someone tell me what's wrong with my implementation of this Haskell palindrome checker? Note: Before calling this...

Haskell Recursion Function (guards required) Haskell Recursion Function (guards required) haskell palindrome recursion Haskell Recursion Char Bool jdoodle.hs:43:42 Couldn Haskell Recursion Function (guards required) Can someone tell me what's wrong with my implementation of this Haskell palindrome checker? Note: Before...

[ -0.0218505859375, 0.0164794921875, 0.00823974609375, 0.00897216796875, 0.0184326171875, 0.0201416015625, -0.006072998046875, -0.0260009765625, 0.006103515625, 0.00445556640625, 0.03759765625, -0.02783203125, -0.006195068359375, 0.003936767578125, 0.00738525390625, -0.00116729736328125,...

[ 20625, 142508, 165428, 42, 6889, 28670, 10763, 32116, 7, 56065, 1556, 17923, 19, 102851, 195625, 21656, 2460, 929, 1647, 55742, 133, 127, 33210, 33529, 191147, 14192, 44691, 208124, 903, 12765, 56, 117371, 159029, 107730, 79315, 70, 11030, 66...

[ 0.134521484375, 0.2529296875, 0.1396484375, 0.1507568359375, 0.10986328125, 0.14794921875, 0.09564208984375, 0.2193603515625, 0.07623291015625, 0.1756591796875, 0.100830078125, 0.100341796875, 0.06951904296875, 0.1898193359375, 0.18359375, 0.1119384765625, 0.03466796875, 0.14575195...

embed

41404647_c0

41404647

haskell

0

Title: How to implement search in file system in haskell? Problem title: How to implement search in file system in haskell? Tags: concurrency, haskell Problem: How to implement search in file system in haskell? I'm not exactly new to haskell, but haven't used it much in real world. So what I want to do is to find all g...

How to implement search in file system in haskell? How to implement search in file system in haskell? concurrency haskell Control.Concurrent.Async System.Directory System.FilePath System.IO How FilePath Bool Traversable FTree Node How to implement search in file system in haskell? I'm not exactly new to haskell, but ha...

[ -0.007232666015625, 0.012939453125, -0.00634765625, -0.00213623046875, -0.00567626953125, 0.009765625, 0.0076904296875, -0.01336669921875, 0, -0.044921875, 0.0003604888916015625, 0.00830078125, -0.003082275390625, 0.0181884765625, -0.0018768310546875, 0.00982666015625, 0.004180908203...

[ 11249, 47, 29479, 33938, 23, 11435, 5426, 1556, 142508, 108636, 982, 2408, 27131, 11935, 163812, 12654, 12353, 174350, 683, 10519, 17780, 42724, 2460, 929, 4937, 7864, 2886, 563, 62731, 13, 438, 112, 3525, 38246, 11814, 5045, 2773, 8999, 74...

[ 0.07159423828125, 0.0252685546875, 0.1915283203125, 0.2646484375, 0.14501953125, 0.1500244140625, 0.159912109375, 0.1517333984375, 0.25146484375, 0.1470947265625, 0.115966796875, 0.005859375, 0.11669921875, 0.017913818359375, 0.19873046875, 0.10498046875, 0.056365966796875, 0.07116...

embed

20228733_c0

20228733

haskell

0

Title: How exactly do kind lists work? Problem title: How exactly do kind lists work? Tags: data-kinds, haskell Problem: How exactly do kind lists work? I've been reading on vinyl recently, which uses weird "list of kinds" kinda types. After reading a bit on kinds and vinyl, I've gotten somewhat of an intuitive underst...

How exactly do kind lists work? How exactly do kind lists work? data-kinds haskell the How LANGUAGE DataKinds TypeOperators FlexibleInstances FlexibleContexts KindSignatures GADTs Main HCons HList HNil Show ISum Integral Integer Defined test.hs:10:6 test.hs:17:10 test.hs:19:10 test.hs:25:10 test.hs:29:10 How exactly do...

[ 0.0022125244140625, -0.006683349609375, 0.01068115234375, 0.0027313232421875, 0.0027008056640625, 0.0052490234375, -0.00201416015625, -0.014404296875, 0.0159912109375, -0.01708984375, -0.0106201171875, -0.05078125, 0.021240234375, 0.01043701171875, -0.0166015625, -0.006256103515625, ...

[ 11249, 66161, 54, 8562, 5303, 7, 4488, 2053, 68347, 1556, 142508, 3358, 98064, 11809, 605, 7250, 60457, 156823, 22230, 180842, 2661, 116071, 22829, 27435, 218723, 23749, 41072, 12321, 81118, 5245, 572, 154663, 79059, 379, 17367, 15744, 316, 2...

[ 0.0894775390625, 0.1944580078125, 0.05950927734375, 0.264404296875, 0.26220703125, 0.12939453125, 0.1693115234375, 0.1151123046875, 0.203857421875, 0.1187744140625, 0.20849609375, 0.0262451171875, 0.1124267578125, 0.0860595703125, 0.045501708984375, 0.2203369140625, 0.156005859375, ...

embed

3329049_c0

3329049

haskell

0

Title: SceneGraph traversal in Haskell Problem title: SceneGraph traversal in Haskell Tags: tree-traversal, scenegraph, haskell Problem: SceneGraph traversal in Haskell I want to implement a simple SceneGraph in Haskell using Data.Tree consisting of Transform and Shape nodes. In a SceneGraph the spatial transformation ...

SceneGraph traversal in Haskell SceneGraph traversal in Haskell tree-traversal scenegraph haskell SceneGraph Haskell Data.Tree Transform Shape Vector2 Double Circle Square SceneNode XFormNode ShapeNode Node Position2 SceneGraph traversal in Haskell I want to implement a simple SceneGraph in Haskell using Data.Tree cons...

[ -0.0146484375, 0.021728515625, -0.0096435546875, -0.000850677490234375, -0.003936767578125, 0.00811767578125, -0.029541015625, -0.0240478515625, -0.01043701171875, -0.02197265625, 0.0128173828125, 0.01080322265625, -0.0084228515625, 0.005401611328125, -0.0111083984375, 0.018310546875, ...

[ 178460, 37878, 11727, 37317, 289, 23, 20625, 142508, 53201, 1517, 814, 2317, 28302, 41382, 1556, 11809, 62731, 11062, 5037, 7224, 1081, 2609, 18770, 304, 107172, 163731, 68305, 5021, 1193, 102973, 438, 99428, 29479, 8781, 58055, 136, 110, 562...

[ 0.2181396484375, 0.251708984375, 0.197998046875, 0.27001953125, 0.08978271484375, 0.02606201171875, 0.139892578125, 0.2445068359375, 0.2230224609375, 0.039031982421875, 0.1593017578125, 0.091552734375, 0.2091064453125, 0.22607421875, 0.08441162109375, 0.10137939453125, 0.18212890625,...

embed

26316233_c0

26316233

haskell

0

Title: Why don't all types get expanded? Problem title: Why don't all types get expanded? Tags: haskell, type-level-computation Problem: Why don't all types get expanded? Suppose type family F (x :: Nat) (y :: Nat) :: (Nat, Nat) where F x y = '(x, y) then :t Proxy :: Proxy '[ (F 1 2) ] Proxy :: Proxy '[ (F 1 ...

Why don't all types get expanded? Why don't all types get expanded? haskell type-level-computation Why Nat Proxy ZipWith Couldn Expected Actual LANGUAGE DataKinds TypeOperators KindSignatures GADTs Rank2Types ScopedTypeVariables MultiParamTypeClasses FlexibleInstances TypeFamilies UndecidableInstances PolyKin...

[ 0.0167236328125, -0.01123046875, -0.01055908203125, -0.00439453125, -0.01202392578125, 0.01300048828125, -0.007293701171875, 0.007568359375, 0.0224609375, 0.01141357421875, -0.008544921875, -0.01153564453125, -0.0012359619140625, -0.004486083984375, -0.0152587890625, 0.0208740234375, ...

[ 44084, 2301, 3768, 18, 756, 52895, 71062, 297, 2046, 1556, 142508, 10644, 67919, 68875, 1250, 50878, 162150, 194583, 13, 100582, 98064, 7250, 60457, 156823, 27435, 218723, 41072, 134405, 196707, 182783, 140803, 180842, 24750, 116071, 63306, 12169...

[ 0.07183837890625, 0.0284423828125, 0.0091552734375, 0.0748291015625, 0.1162109375, 0.210693359375, 0.190185546875, 0.061553955078125, 0.02471923828125, 0.058258056640625, 0.1688232421875, 0.1749267578125, 0.096923828125, 0.0772705078125, 0.013702392578125, 0.1202392578125, 0.05627441...

embed

26469218_c0

26469218

haskell

0

Title: How do alternative uses of recursion influence the efficiency of Haskell list reverse? Problem title: How do alternative uses of recursion influence the efficiency of Haskell list reverse? Tags: haskell, recursion Problem: How do alternative uses of recursion influence the efficiency of Haskell list reverse? I a...

How do alternative uses of recursion influence the efficiency of Haskell list reverse? How do alternative uses of recursion influence the efficiency of Haskell list reverse? haskell recursion How Haskell x:xs x:reversed How do alternative uses of recursion influence the efficiency of Haskell list reverse? I am giving m...

[ -0.0257568359375, 0.0272216796875, 0.0242919921875, 0.01202392578125, -0.00041961669921875, 0.0120849609375, -0.0123291015625, 0.0045166015625, 0.01416015625, 0.0142822265625, 0.007171630859375, -0.007232666015625, 0.01251220703125, 0.013916015625, 0.0062255859375, 0.0137939453125, 0...

[ 11249, 30700, 4527, 195625, 1830, 79507, 227066, 20625, 142508, 5303, 39531, 184, 1556, 1022, 12, 425, 7, 107, 7864, 297, 68772, 35978, 210651, 56, 10078, 15649, 29806, 758, 51347, 73342, 15400, 17932, 83, 1286, 93766, 3501, 5117, 15044, 28...

[ 0.07037353515625, 0.1898193359375, 0.1488037109375, 0.235107421875, 0.13720703125, 0.1595458984375, 0.2015380859375, 0.119873046875, 0.2109375, 0.1746826171875, 0.2047119140625, 0.1251220703125, 0.100830078125, 0.11474609375, 0.05108642578125, 0.10479736328125, 0.05401611328125, 0....

embed

28146009_c0

28146009

haskell

0

Title: How to speed Haskell IO with buffering? Problem title: How to speed Haskell IO with buffering? Tags: performance, buffering, haskell, io Problem: How to speed Haskell IO with buffering? I read about IO buffering in the "Real World Haskell" (ch. 7, p. 189), and tried to test, how different buffering size affects ...

How to speed Haskell IO with buffering? How to speed Haskell IO with buffering? performance buffering haskell io System.IO Data.Time.Clock Data.Char How Haskell bigFile.txt ReadMode BlockBuffering Just Current processed.txt How to speed Haskell IO with buffering? I read about IO buffering in the "Real World Haskell" (c...

[ -0.0250244140625, -0.00567626953125, 0.018310546875, -0.00543212890625, -0.0026702880859375, 0.0030517578125, 0.000052928924560546875, -0.005950927734375, -0.006683349609375, 0.01226806640625, 0.0054931640625, -0.01953125, 0.0179443359375, -0.01318359375, -0.01416015625, -0.01080322265...

[ 11249, 47, 38352, 20625, 142508, 17780, 678, 123759, 4209, 23718, 1556, 22995, 12353, 11809, 70059, 21135, 84068, 6957, 174350, 124326, 4764, 9083, 80231, 7235, 18234, 9563, 114063, 9433, 297, 12301, 68996, 6661, 104736, 37842, 3034, 12921, 132...

[ 0.076904296875, 0.06787109375, 0.205810546875, 0.1424560546875, 0.25146484375, 0.2130126953125, 0.1024169921875, 0.206787109375, 0.1612548828125, 0.1591796875, 0.1201171875, 0.177490234375, 0.05804443359375, 0.00775146484375, 0.05517578125, 0.07366943359375, 0.053009033203125, 0.05...

embed

60977498_c0

60977498

haskell

0

Title: How to properly do nested routing in Obelisk? Problem title: How to properly do nested routing in Obelisk? Tags: haskell-snap-framework, haskell, reflex Problem: How to properly do nested routing in Obelisk? I have been searching for examples , however most examples do a RouteSomething -> PathSegment "firstpath"...

How to properly do nested routing in Obelisk? How to properly do nested routing in Obelisk? haskell-snap-framework haskell reflex How Obelisk RouteSomething PathSegment Cat.id FullRoute_Backend BackendRoute_Missing BackendRoute_API Identity Common.Route Obelisk.Route How to properly do nested routing in Obelisk? I have...

[ -0.00074005126953125, 0.006744384765625, -0.00106048583984375, -0.01165771484375, -0.0172119140625, -0.000751495361328125, 0.01397705078125, -0.01708984375, 0.019287109375, -0.033447265625, -0.003509521484375, -0.0213623046875, 0.0035552978515625, 0.032470703125, -0.0093994140625, 0.01...

[ 11249, 155965, 54, 8512, 71, 22629, 1916, 23, 180, 14473, 1042, 47, 1556, 142508, 10957, 160328, 71181, 106015, 64113, 108421, 2507, 18826, 532, 9312, 12724, 6743, 152470, 3611, 26828, 135261, 74220, 71257, 151301, 27781, 2684, 282, 13448, 12...

[ 0.085693359375, 0.1702880859375, 0.08282470703125, 0.24609375, 0.166748046875, 0.188232421875, 0.1195068359375, 0.09130859375, 0.1181640625, 0.2266845703125, 0.2105712890625, 0.010894775390625, 0.064208984375, 0.1920166015625, 0.1734619140625, 0.077392578125, 0.19677734375, 0.18078...

embed

24117788_c0

24117788

haskell

0

Title: Mixing Threepenny-Gui and StateT Problem title: Mixing Threepenny-Gui and StateT Tags: threepenny-gui, haskell, state-monad, monad-transformers Problem: Mixing Threepenny-Gui and StateT I have a question on the interaction of Threepenny-Gui with StateT. Consider this toy program that, every time the button is cl...

Mixing Threepenny-Gui and StateT Mixing Threepenny-Gui and StateT threepenny-gui haskell state-monad monad-transformers Control.Monad Control.Monad.State qualified Graphics.UI.Threepenny.Core Mixing Threepenny-Gui StateT Graphics.UI.Threepenny Window Ciao Element UI.button Click UI.ul UI.click UI.li Mixing Threepenny-G...

[ -0.02978515625, 0.00811767578125, 0.000804901123046875, -0.0079345703125, 0.0291748046875, 0.013427734375, 0.0022125244140625, -0.0062255859375, -0.0030059814453125, -0.07666015625, 0.0194091796875, -0.0069580078125, -0.020263671875, 0.0228271484375, 0, -0.005828857421875, 0.02612304...

[ 37286, 214, 129335, 2278, 299, 9, 22769, 14, 136, 22836, 618, 17262, 17086, 1556, 142508, 11341, 3796, 712, 2667, 215175, 1314, 27131, 46674, 135206, 217225, 189682, 33457, 107, 13, 50886, 176501, 107786, 48325, 111481, 8789, 21138, 202, 1232...

[ 0.2271728515625, 0.09515380859375, 0.205810546875, 0.1802978515625, 0.1995849609375, 0.04925537109375, 0.2137451171875, 0.153076171875, 0.0860595703125, 0.1763916015625, 0.212158203125, 0.163330078125, 0.2276611328125, 0.087646484375, 0.193115234375, 0.1343994140625, 0.08447265625, ...

embed

7135540_c0

7135540

haskell

0

Title: What is the name of this monad-like functional programming pattern? Problem title: What is the name of this monad-like functional programming pattern? Tags: monads, haskell, functional-programming, design-patterns Problem: What is the name of this monad-like functional programming pattern? I have occasionally en...

What is the name of this monad-like functional programming pattern? What is the name of this monad-like functional programming pattern? monads haskell functional-programming design-patterns What TyT TyF TyOr Marked Show What is the name of this monad-like functional programming pattern? I have occasionally encountered ...

[ 0.01080322265625, 0.0184326171875, -0.00665283203125, 0.0289306640625, 0.004425048828125, 0.00335693359375, -0.0115966796875, 0.0021514892578125, -0.000629425048828125, -0.01422119140625, 0.015380859375, -0.0228271484375, -0.017822265625, -0.00107574462890625, 0.000926971435546875, 0.0...

[ 4865, 9351, 111, 903, 2667, 712, 5062, 123309, 56037, 449, 103510, 83, 7, 1556, 142508, 28966, 4331, 4453, 22766, 8064, 618, 919, 19060, 7880, 297, 17367, 70, 9, 46505, 190647, 18151, 3332, 195, 13566, 10, 1284, 959, 13695, 74729, 10644, ...

[ 0.0236663818359375, 0.1243896484375, 0.056121826171875, 0.1273193359375, 0.1650390625, 0.2069091796875, 0.2138671875, 0.187255859375, 0.1612548828125, 0.07110595703125, 0.245849609375, 0.041107177734375, 0.05615234375, 0.0860595703125, 0.2158203125, 0.08984375, 0.0963134765625, 0.1...

embed

68607694_c0

68607694

haskell

0

Title: New functions are not detected by vscode Haskell extension Problem title: New functions are not detected by vscode Haskell extension Tags: visual-studio-code, haskell, haskell-language-server Problem: New functions are not detected by vscode Haskell extension I have the following Visual Studio Code extensions fo...

New functions are not detected by vscode Haskell extension New functions are not detected by vscode Haskell extension visual-studio-code haskell haskell-language-server Haskell Lib.hs Main.hs OPTIONS_GHC Wno-deferred-out-of-scope-variables New functions are not detected by vscode Haskell extension I have the following ...

[ 0.014404296875, 0.0155029296875, 0.01104736328125, 0.0169677734375, -0.007476806640625, -0.00092315673828125, -0.029052734375, 0.015869140625, -0.0087890625, 0.0064697265625, 0.000949859619140625, -0.031494140625, 0.00811767578125, 0.0146484375, 0.019775390625, 0.01397705078125, 0.00...

[ 2356, 32354, 7, 959, 96391, 297, 20209, 40899, 20625, 142508, 111938, 21176, 52629, 1556, 196651, 39642, 43278, 127, 12321, 28023, 41877, 441, 157, 112, 2875, 2822, 6056, 70820, 21690, 73372, 22968, 28864, 20600, 28282, 3525, 177261, 13452, 1...

[ 0.12744140625, 0.2069091796875, 0.00604248046875, 0.1231689453125, 0.229736328125, 0.0264434814453125, 0.1710205078125, 0.257080078125, 0.1190185546875, 0.22900390625, 0.168701171875, 0.1353759765625, 0.13427734375, 0.06939697265625, 0.048492431640625, 0.0635986328125, 0.130004882812...

embed

45681982_c0

45681982

haskell

0

Title: is it possible to make program aliases in `stack exec`? Problem title: is it possible to make program aliases in `stack exec`? Tags: haskell-stack, haskell Problem: is it possible to make program aliases in `stack exec`? I have a project that has many small executable targets. It takes quite a lot of time whenev...

is it possible to make program aliases in `stack exec`? is it possible to make program aliases in `stack exec`? haskell-stack haskell PATH is it possible to make program aliases in `stack exec`? I have a project that has many small executable targets. It takes quite a lot of time whenever the source code changes due to...

[ 0.003997802734375, -0.00543212890625, 0.007781982421875, 0.0390625, -0.00823974609375, 0.01483154296875, -0.0269775390625, 0.02197265625, -0.0103759765625, -0.00201416015625, -0.00421142578125, 0.01336669921875, -0.006195068359375, 0.0177001953125, 0.00634765625, 0.001129150390625, 0...

[ 83, 7722, 3249, 1528, 55109, 90, 23, 590, 2594, 1119, 3240, 1556, 142508, 436, 139909, 442, 13452, 5941, 19336, 71924, 2886, 30388, 5915, 31344, 18151, 65572, 2967, 33976, 11907, 98927, 13566, 1632, 11001, 28288, 10002, 123166, 175199, 9351, ...

[ 0.009765625, 0.172607421875, 0.12939453125, 0.215087890625, 0.25390625, 0.2003173828125, 0.058380126953125, 0.1495361328125, 0.1676025390625, 0.1368408203125, 0.236572265625, 0.0814208984375, 0.207275390625, 0.042694091796875, 0.1568603515625, 0.01495361328125, 0.084228515625, 0.02...

embed

51661192_c0

51661192

haskell

0

Title: How do you get getLine to accept unicode characters? Problem title: How do you get getLine to accept unicode characters? Tags: windows, unicode, haskell, encoding, console Problem: How do you get getLine to accept unicode characters? When running the following code do line <- getLine putStrLn line or, getLine >>...

How do you get getLine to accept unicode characters? How do you get getLine to accept unicode characters? windows unicode haskell encoding console How utf8 NIL ghci.exe PROGRAMS Haskell Platform GHC.IO.Encoding.getLocaleEncoding UTF-8 System.IO.hGetEncoding Just How do you get getLine to accept unicode characters? When...

[ -0.01531982421875, -0.002410888671875, 0.018798828125, 0.01513671875, 0.000827789306640625, 0.00124359130859375, 0.032958984375, -0.00933837890625, -0.0198974609375, -0.003021240234375, -0.01275634765625, -0.0108642578125, -0.0057373046875, -0.0162353515625, -0.0030670166015625, 0.0120...

[ 11249, 2046, 93232, 47, 26946, 60347, 112, 124850, 54825, 1556, 142508, 22, 587, 130250, 486, 420, 1019, 16444, 31380, 318, 46480, 59677, 20625, 70968, 527, 73265, 17780, 7768, 3794, 203758, 30992, 17376, 12353, 127, 724, 126, 51042, 25632, ...

[ 0.0283203125, 0.1649169921875, 0.283935546875, 0.085205078125, 0.226318359375, 0.2210693359375, 0.19580078125, 0.211181640625, 0.0958251953125, 0.0789794921875, 0.1748046875, 0.08251953125, 0.1749267578125, 0.131591796875, 0.05682373046875, 0.0784912109375, 0.1776123046875, 0.06585...

embed

19892288_c0

19892288

haskell

0

Title: HandsomeSoup: Getting basic example to work Problem title: HandsomeSoup: Getting basic example to work Tags: html-parsing, hxt, haskell Problem: HandsomeSoup: Getting basic example to work I am trying to get the basic example from http://egonschiele.github.io/HandsomeSoup/ to work: main = do doc <- fromUrl "http...

HandsomeSoup: Getting basic example to work HandsomeSoup: Getting basic example to work html-parsing hxt haskell Text.HandsomeSoup Text.XML.HXT.Core Control.Monad HandsomeSoup Getting www.google.com h3.r mapM_ Main Main.hs Main.hs:8:21 Couldn IOSLA XIOState XmlTree hxt-9.3.0.1:Data.Tree.NTree.TypeDefs.NTree hxt-9.3.0.1...

[ -0.0029754638671875, -0.005035400390625, -0.00177001953125, -0.0125732421875, -0.013671875, 0.024169921875, 0.003631591796875, -0.006988525390625, 0.00213623046875, -0.060791015625, -0.0224609375, -0.039794921875, -0.00787353515625, -0.00537109375, 0.0033111572265625, -0.0108642578125,...

[ 10639, 43452, 8912, 2037, 210732, 62822, 27781, 47, 4488, 12, 7693, 2500, 1096, 29062, 1556, 142508, 24129, 135679, 39456, 841, 70981, 27131, 46674, 712, 1426, 59875, 277, 363, 42, 22288, 594, 12321, 127, 1019, 25619, 191147, 62390, 8356, 1...

[ 0.1873779296875, 0.2225341796875, 0.1546630859375, 0.20556640625, 0.07403564453125, 0.1717529296875, 0.263671875, 0.049530029296875, 0.12890625, 0.006591796875, 0.125, 0.06768798828125, 0.04852294921875, 0.1446533203125, 0.11181640625, 0.2034912109375, 0.0914306640625, 0.1572265625...

embed

22580260_c0

22580260

haskell

0

Title: Interactive Process Communication in Haskell Problem title: Interactive Process Communication in Haskell Tags: haskell, ipc Problem: Interactive Process Communication in Haskell I am trying to write a Haskell program that executes an interactive program (also written in Haskell), sending and receiving lines of t...

Interactive Process Communication in Haskell Interactive Process Communication in Haskell haskell ipc Interactive Process Communication Haskell PlayerMain LineBuffering NoBuffering Interactive Process Communication in Haskell I am trying to write a Haskell program that executes an interactive program (also written in H...

[ -0.008056640625, 0.0013580322265625, 0.0079345703125, 0.01531982421875, -0.0152587890625, 0.014404296875, -0.007110595703125, -0.0004119873046875, 0.00072479248046875, -0.019287109375, -0.006500244140625, 0.01324462890625, -0.00165557861328125, 0.0177001953125, -0.0023040771484375, 0.0...

[ 5337, 71232, 123996, 87398, 23, 20625, 142508, 1556, 57095, 60560, 168793, 16777, 7235, 18234, 438, 31577, 33022, 1528, 71924, 212398, 59121, 135834, 136, 217063, 124519, 7986, 12301, 6138, 4153, 71, 79858, 5570, 35773, 77443, 1286, 96704, 1453...

[ 0.1395263671875, 0.1385498046875, 0.2030029296875, 0.2215576171875, 0.04876708984375, 0.155029296875, 0.2288818359375, 0.109375, 0.12353515625, 0.1318359375, 0.05657958984375, 0.1143798828125, 0.05645751953125, 0.1488037109375, 0.0904541015625, 0.03814697265625, 0.0816650390625, 0....

embed

41798769_c0

41798769

haskell

0

Title: Haskell GHC create executable not depending on GMP? Problem title: Haskell GHC create executable not depending on GMP? Tags: haskell Problem: Haskell GHC create executable not depending on GMP? I have a simple program that doesn't appear to use libgmp at all. -- Sample.hs main = putStrLn "hi" If I compile it usi...

Haskell GHC create executable not depending on GMP? Haskell GHC create executable not depending on GMP? haskell Haskell GHC GMP Sample.hs Sample linux-vdso.so.1 libgmp.so.10 lib64 libm.so.6 librt.so.1 libdl.so.2 libc.so.6 ld-linux-x86-64.so.2 libpthread.so.0 libgmp.so Integer Haskell GHC create executable not depending...

[ -0.0245361328125, -0.0006103515625, 0.0029754638671875, 0.01214599609375, -0.00031280517578125, 0.0224609375, -0.01361083984375, -0.000804901123046875, -0.007171630859375, -0.01177978515625, 0.00469970703125, -0.0184326171875, -0.0062255859375, 0.004364013671875, -0.0152587890625, 0.01...

[ 20625, 142508, 527, 73265, 28282, 71924, 2886, 959, 8, 96819, 98, 9088, 1556, 947, 33209, 127, 11508, 6077, 59805, 991, 418, 25474, 177, 2676, 963, 13307, 39, 910, 3198, 20469, 304, 2397, 15276, 39116, 2389, 44401, 8781, 1528, 22027, 18, ...

[ 0.1180419921875, 0.2200927734375, 0.09320068359375, 0.2059326171875, 0.135498046875, 0.19091796875, 0.16162109375, 0.1190185546875, 0.059906005859375, 0.1337890625, 0.0285186767578125, 0.218994140625, 0.08978271484375, 0.135986328125, 0.24560546875, 0.096435546875, 0.05517578125, 0...

embed

3015962_c0

3015962

haskell

0

Title: Zipping with padding in Haskell Problem title: Zipping with padding in Haskell Tags: functional-programming, haskell Problem: Zipping with padding in Haskell A couple of times I've found myself wanting a zip in Haskell that adds padding to the shorter list instead of truncating the longer one. This is easy enoug...

Zipping with padding in Haskell Zipping with padding in Haskell functional-programming haskell Zipping Haskell Monoid x:xs y:ys zipPad3 zip3 z:zs Zipping with padding in Haskell A couple of times I've found myself wanting a zip in Haskell that adds padding to the shorter list instead of truncating the longer one. This ...

[ -0.01080322265625, 0.00994873046875, 0.000705718994140625, 0.006683349609375, -0.01263427734375, 0.01611328125, -0.01007080078125, -0.0133056640625, 0.01397705078125, -0.0050048828125, -0.0142822265625, -0.021728515625, 0.01275634765625, 0.0135498046875, -0.002960205078125, 0.004516601...

[ 9315, 26783, 678, 249, 59725, 20625, 142508, 123309, 28966, 1556, 77879, 532, 4778, 68330, 113954, 363, 97, 24941, 3444, 23, 15190, 16610, 5303, 64457, 14617, 16336, 51713, 23468, 43240, 27875, 80854, 4527, 51515, 110608, 61924, 10644, 22027, ...

[ 0.1781005859375, 0.1348876953125, 0.067138671875, 0.1605224609375, 0.1788330078125, 0.1248779296875, 0.2249755859375, 0.0985107421875, 0.05810546875, 0.1053466796875, 0.1328125, 0.10479736328125, 0.0233917236328125, 0.2166748046875, 0.2174072265625, 0.1446533203125, 0.01025390625, ...

embed

40319710_c1

40319710

haskell

1

= let acc' = acc ++ this in if null next then go acc' else yield acc' >> go next breakAfterEOL :: ByteString -> (ByteString, ByteString) breakAfterEOL = uncurry (\x -> maybe (x, "") (first (snoc x)) . uncons) . break (== 10) $ stack ghc --package={classy-prelude-conduit,conduit-extra} -- -O2 example.hs -o example $ fo...

[ 0.000247955322265625, 0.0014801025390625, 0.0033416748046875, 0.0146484375, -0.012939453125, 0.013671875, 0.001556396484375, -0.007568359375, 0.0125732421875, -0.01239013671875, -0.017333984375, 0.0108642578125, 0.0093994140625, 0.00823974609375, 0.01544189453125, 0.01348876953125, -...

[ 2203, 2633, 50015, 25, 37223, 903, 23, 2174, 56574, 11737, 738, 37076, 11180, 19388, 36356, 46327, 647, 22323, 1984, 3311, 67, 71713, 214, 33079, 75358, 51, 64240, 425, 51139, 13448, 54387, 1022, 25553, 69112, 209, 177261, 31380, 238, 29102...

[ 0.06072998046875, 0.0933837890625, 0.12646484375, 0.0989990234375, 0.154541015625, 0.0635986328125, 0.04449462890625, 0.090576171875, 0.2462158203125, 0.17578125, 0.08880615234375, 0.0219879150390625, 0.1201171875, 0.1402587890625, 0.1771240234375, 0.185546875, 0.033203125, 0.22448...

embed

79527347_c0

79527347

haskell

0

Title: How to select all text inside an input element with Reflex DOM Problem title: How to select all text inside an input element with Reflex DOM Tags: frp, haskell, reflex-dom, reflex Problem: How to select all text inside an input element with Reflex DOM I have the following function to create an input element: mkI...

How to select all text inside an input element with Reflex DOM How to select all text inside an input element with Reflex DOM frp haskell reflex-dom reflex How Reflex DOM DomBuilder PostBuild T.Text InputElement EventResult DomBuilderSpace inputElementConfig_initialValue input._inputElement_hasFocus input.focus How to ...

[ -0.00738525390625, -0.0025634765625, -0.00665283203125, 0.0025787353515625, -0.01220703125, -0.0172119140625, 0.00012874603271484375, -0.00118255615234375, -0.0020599365234375, -0.0272216796875, 0.03759765625, 0.00128173828125, -0.0255126953125, 0.03466796875, -0.0067138671875, -0.0017...

[ 11249, 36849, 756, 7986, 46132, 107730, 12830, 678, 179043, 69285, 14119, 1556, 142508, 71181, 3815, 9343, 121137, 2795, 174379, 7077, 19929, 36943, 7, 7136, 141012, 83671, 50770, 73, 10557, 27591, 11680, 3584, 32354, 28282, 18158, 3934, 27289,...

[ 0.032684326171875, 0.21240234375, 0.1883544921875, 0.21728515625, 0.19189453125, 0.2281494140625, 0.1767578125, 0.037628173828125, 0.27197265625, 0.20263671875, 0.008209228515625, 0.0809326171875, 0.1651611328125, 0.2325439453125, 0.1175537109375, 0.1026611328125, 0.1160888671875, ...

embed

60265599_c0

60265599

haskell

0

Title: Make Postgresql.Simple query results available to rest of .hs file Problem title: Make Postgresql.Simple query results available to rest of .hs file Tags: haskell Problem: Make Postgresql.Simple query results available to rest of .hs file I have a sensor that puts values in a postgres table and im using postgres...

Make Postgresql.Simple query results available to rest of .hs file Make Postgresql.Simple query results available to rest of .hs file haskell lightbool Make Postgresql.Simple mapM_ query_ sensor1 Only Bool myHost.rds.amazonaws.com Make Postgresql.Simple query results available to rest of .hs file I have a sensor that p...

[ 0.0164794921875, 0.02001953125, -0.0045166015625, 0.0011138916015625, 0.00848388671875, -0.003631591796875, 0.007659912109375, -0.02978515625, 0.0067138671875, -0.0101318359375, -0.00469970703125, -0.0167236328125, -0.00872802734375, -0.0027618408203125, -0.010009765625, 0.024658203125...

[ 26176, 2795, 17562, 99247, 8859, 33209, 41, 1294, 50339, 19882, 10588, 127, 7, 11435, 5, 1556, 142508, 22729, 142484, 22288, 594, 43111, 418, 87293, 2460, 929, 759, 11193, 2887, 19725, 142424, 23180, 1305, 191560, 12301, 5201, 17780, 32354, ...

[ 0.0601806640625, 0.06280517578125, 0.1463623046875, 0.15625, 0.1336669921875, 0.21630859375, 0.110595703125, 0.06292724609375, 0.1817626953125, 0.125244140625, 0.1031494140625, 0.122314453125, 0.1146240234375, 0.10382080078125, 0.0143890380859375, 0.1104736328125, 0.2249755859375, ...

embed

61495045_c0

61495045

haskell

0

Title: How to have Haskell Data.Map module available for import with stack tool and environment? Problem title: How to have Haskell Data.Map module available for import with stack tool and environment? Tags: haskell, haskell-stack Problem: How to have Haskell Data.Map module available for import with stack tool and env...

How to have Haskell Data.Map module available for import with stack tool and environment? How to have Haskell Data.Map module available for import with stack tool and environment? haskell haskell-stack with the How Haskell Data.Map package.yaml SpaceAge Wall List Tests.hs space-age-1.2.0.6 stack.yaml lts-15.8 How to ha...

[ -0.006744384765625, 0.002655029296875, 0.002288818359375, -0.0074462890625, -0.0034637451171875, 0.00830078125, 0.0020904541015625, 0.005035400390625, -0.0054931640625, 0.006561279296875, 0.010498046875, -0.02978515625, 0.0054931640625, 0.0225830078125, -0.003204345703125, 0.0104370117...

[ 11249, 765, 20625, 142508, 11809, 5, 166179, 88996, 19882, 24927, 678, 177261, 55516, 65998, 136, 1556, 590, 2594, 98169, 14520, 141, 43045, 284, 429, 23706, 32036, 8647, 127, 32628, 4588, 48400, 122887, 933, 13386, 1019, 1884, 17368, 154107,...

[ 0.07586669921875, 0.05401611328125, 0.1478271484375, 0.238525390625, 0.18896484375, 0.0271148681640625, 0.25048828125, 0.2071533203125, 0.12841796875, 0.2177734375, 0.1134033203125, 0.2132568359375, 0.16357421875, 0.1513671875, 0.03485107421875, 0.11474609375, 0.1016845703125, 0.11...

embed

39932707_c1

39932707

haskell

1

$ BL.fromStrict bs -- should read BytesString and return Word32 transform :: (Monad m, MonadResource m) => Conduit BS.ByteString m Word32 transform = do mbs <- await case mbs of Just bs -> do case C.null bs of False -> do yield $ getWord32 bs leftover $ BS.drop 4 bs transform True -> return () Nothing -> return () mai...

[ -0.01446533203125, 0.0196533203125, 0.005096435546875, -0.01141357421875, 0.0166015625, 0.0146484375, 0.018798828125, 0.00177764892578125, 0.0166015625, -0.0247802734375, 0.01318359375, -0.00482177734375, 0.00604248046875, -0.0029296875, -0.001953125, 0.00885009765625, -0.00848388671...

[ 3650, 68170, 5, 161063, 62233, 18, 876, 7, 5608, 12301, 3311, 1636, 71713, 214, 30646, 22543, 6460, 27198, 46674, 712, 347, 60331, 71, 4332, 60427, 16, 1657, 112061, 84145, 75358, 67, 39369, 10, 634, 217, 7225, 9563, 313, 139550, 22225, ...

[ 0.015106201171875, 0.1485595703125, 0.0267181396484375, 0.186279296875, 0.191162109375, 0.1395263671875, 0.110107421875, 0.1474609375, 0.06903076171875, 0.165771484375, 0.10284423828125, 0.1087646484375, 0.1558837890625, 0.05499267578125, 0.1024169921875, 0.1866455078125, 0.278808593...

embed

74634387_c0

74634387

haskell

0

Title: How to check instance of fractional class for zero value in haskell? Problem title: How to check instance of fractional class for zero value in haskell? Tags: haskell Problem: How to check instance of fractional class for zero value in haskell? If i have a value which is restricted to be fractional, is there a w...

How to check instance of fractional class for zero value in haskell? How to check instance of fractional class for zero value in haskell? haskell the How safe_idv Fractional Maybe safe_div Result Err Could AST2.hs:11:1-48 Possible How to check instance of fractional class for zero value in haskell? If i have a value wh...

[ -0.0220947265625, -0.006866455078125, 0.01458740234375, -0.0159912109375, -0.01025390625, 0.01007080078125, 0.004547119140625, -0.02392578125, -0.0150146484375, 0.002899169921875, -0.02001953125, 0.01123046875, 0.00927734375, -0.022705078125, 0.0030670166015625, -0.0130615234375, 0.0...

[ 11249, 12765, 110527, 175921, 289, 18507, 100, 45234, 34292, 1556, 142508, 47, 111, 23, 70, 46002, 334, 7868, 10763, 83425, 30618, 126684, 1004, 191147, 48963, 5442, 19993, 19721, 9285, 115861, 173072, 186, 3917, 442, 8035, 62276, 29479, 9185...

[ 0.0343017578125, 0.2158203125, 0.2310791015625, 0.2347412109375, 0.119384765625, 0.21240234375, 0.0595703125, 0.208251953125, 0.1781005859375, 0.1297607421875, 0.2239990234375, 0.01922607421875, 0.04486083984375, 0.0367431640625, 0.01513671875, 0.158447265625, 0.11328125, 0.1679687...

embed

79307665_c1

79307665

haskell

1

if ptr > 0 then arr else 0 : arr) (if ptr > 0 then ptr - 1 else 0) code pairs (current + 1) '>' -> BrainfuckRec (if ptr == (length arr) - 1 then arr ++ [0] else arr) (ptr + 1) code pairs (current + 1) '[' -> BrainfuckRec arr ptr code pairs (fst (pairs !! (findIndex ((== current) . snd) pairs))) ']' -> BrainfuckRec arr ...

[ -0.0013275146484375, 0.002410888671875, 0.005828857421875, 0.0238037109375, 0.0164794921875, 0.021728515625, -0.005889892578125, -0.01080322265625, 0.0115966796875, -0.01385498046875, -0.0096435546875, -0.0028076171875, -0.022705078125, -0.003143310546875, -0.025390625, -0.029541015625...

[ 2174, 27037, 42, 977, 757, 7068, 187, 37076, 3190, 106, 18151, 80836, 163812, 997, 4879, 2740, 6163, 73, 93476, 4332, 238, 69112, 23986, 37223, 147352, 6328, 271, 109637, 6506, 111607, 39659, 43581, 2208, 3884, 84068, 147, 30646, 4711, 1077...

[ 0.05548095703125, 0.162841796875, 0.17919921875, 0.06170654296875, 0.153076171875, 0.001708984375, 0.1407470703125, 0.0697021484375, 0.020904541015625, 0.078857421875, 0.1834716796875, 0.2056884765625, 0.1737060546875, 0.0660400390625, 0.0716552734375, 0.0660400390625, 0.117309570312...

embed

30884995_c0

30884995

haskell

0

Title: Which language and lib is better suited for high-performant network devices polling server (SNMP)? Problem title: Which language and lib is better suited for high-performant network devices polling server (SNMP)? Tags: c, snmp, haskell, erlang, c%2B%2B Problem: Which language and lib is better suited for high-pe...

Which language and lib is better suited for high-performant network devices polling server (SNMP)? Which language and lib is better suited for high-performant network devices polling server (SNMP)? c snmp haskell erlang c%2B%2B Which SNMP Which language and lib is better suited for high-performant network devices polli...

[ -0.00075531005859375, 0.003814697265625, 0.0030059814453125, 0.029052734375, -0.005035400390625, -0.00677490234375, -0.01171875, 0.00176239013671875, -0.000396728515625, -0.0311279296875, 0.024169921875, 0.00592041015625, 0.021728515625, -0.00726318359375, 0.01019287109375, 0.010192871...

[ 46876, 136, 25474, 11522, 14947, 71, 11192, 1264, 5037, 33120, 128779, 160, 30319, 10723, 61533, 9088, 100, 501, 91, 19, 2676, 1556, 142508, 72, 3066, 130078, 101176, 20697, 97204, 29806, 4488, 67241, 50986, 59121, 98, 145581, 17368, 27512, ...

[ 0.2119140625, 0.0599365234375, 0.18896484375, 0.14501953125, 0.1611328125, 0.00567626953125, 0.09326171875, 0.029998779296875, 0.11376953125, 0.1080322265625, 0.1365966796875, 0.174072265625, 0.1878662109375, 0.176025390625, 0.119873046875, 0.255859375, 0.030120849609375, 0.0838623...

embed

57834521_c0

57834521

haskell

0

Title: Why do we need `startWatching` function from WalletApi? Problem title: Why do we need `startWatching` function from WalletApi? Tags: cardano, smartcontracts, plutus, haskell Problem: Why do we need `startWatching` function from WalletApi? In plutus playground in game example there is a function -- | The "startGa...

Why do we need `startWatching` function from WalletApi? Why do we need `startWatching` function from WalletApi? cardano smartcontracts plutus haskell WalletApi Why See Contract MonadWallet API Player Why do we need `startWatching` function from WalletApi? In plutus playground in game example there is a function I don't...

[ -0.016845703125, 0.015380859375, 0.0166015625, -0.005859375, 0.0157470703125, 0.01611328125, -0.0130615234375, -0.0076904296875, 0.0091552734375, -0.016357421875, 0.005828857421875, 0.0157470703125, -0.013916015625, 0.01611328125, 0.01141357421875, -0.0184326171875, 0.04248046875, ...

[ 44084, 54, 642, 3871, 17137, 156378, 214, 32354, 1295, 23706, 126, 284, 1434, 20596, 3922, 18775, 184103, 12266, 2143, 1556, 142508, 6872, 149957, 60331, 71, 198076, 61687, 60560, 11301, 64330, 6712, 27781, 2301, 18, 1884, 6183, 3917, 37067, ...

[ 0.1199951171875, 0.01806640625, 0.0143585205078125, 0.1463623046875, 0.2054443359375, 0.28955078125, 0.146728515625, 0.1912841796875, 0.0298614501953125, 0.1158447265625, 0.08624267578125, 0.136962890625, 0.20849609375, 0.0322265625, 0.1361083984375, 0.0721435546875, 0.1654052734375,...

embed

19383237_c1

19383237

haskell

1

3 -- from the xev data keysToAdd x = [ ((mod4Mask, xK_F4 ), kill) , ((0, xF86XK_Calculator ), spawn "mate-calculator") , ((0, xF86XK_WWW ), spawn "firefox") , ((0, xF86XK_HomePage ), spawn "caja") , ((0, xK_Print ), spawn "mate-screenshot") , ((mod4Mask, xK_z ), spawn "emacs") ] ++ [((m .|. homeMask, k), windows $ f i)...

[ -0.004119873046875, 0.037353515625, -0.0047607421875, -0.022216796875, 0.0038909912109375, -0.0115966796875, 0.00927734375, -0.018798828125, 0.0126953125, -0.0311279296875, 0.0238037109375, 0.0128173828125, -0.00372314453125, 0.000392913818359375, -0.015625, -0.0145263671875, -0.0270...

[ 138, 4210, 1295, 4449, 334, 2053, 22799, 7, 7763, 284, 4028, 1022, 2203, 13415, 617, 53049, 92, 605, 919, 67153, 2389, 15276, 1542, 94553, 16735, 1290, 5623, 7710, 15829, 6827, 95162, 73702, 147797, 55376, 147101, 408, 145, 112079, 86667, ...

[ 0.10369873046875, 0.04254150390625, 0.09429931640625, 0.141357421875, 0.260986328125, 0.1697998046875, 0.249267578125, 0.0814208984375, 0.1622314453125, 0.10247802734375, 0.2142333984375, 0.176025390625, 0.0072021484375, 0.1588134765625, 0.11279296875, 0.1453857421875, 0.095336914062...

embed

21386451_c0

21386451

haskell

0

Title: http-conduit TLSSettingsSimple and error EOF problems Problem title: http-conduit TLSSettingsSimple and error EOF problems Tags: haskell, http-conduit Problem: http-conduit TLSSettingsSimple and error EOF problems I'm still a haskell newbie but i'm attempting a simple http-conduit example" import Network.HTTP.Co...

http-conduit TLSSettingsSimple and error EOF problems http-conduit TLSSettingsSimple and error EOF problems haskell http-conduit Network.HTTP.Conduit qualified TLSSettingsSimple EOF Data.ByteString.Lazy var2 Nothing github.com var3 blah_request_goes_here Exception Error_EOF http-conduit TLSSettingsSimple and error EOF ...

[ -0.00183868408203125, 0.010498046875, -0.0035247802734375, -0.003173828125, 0.00102996826171875, 0.019287109375, -0.005706787109375, 0.000499725341796875, 0.011474609375, 0.0103759765625, 0.0181884765625, -0.017578125, 0.018798828125, -0.010986328125, 0.00640869140625, -0.0005645751953...

[ 1621, 2271, 112061, 20602, 294, 105548, 33209, 136, 18499, 241, 82341, 44402, 1556, 142508, 28997, 23658, 11935, 217225, 11809, 71713, 2729, 3285, 285, 304, 182747, 62270, 32102, 363, 9932, 75616, 35593, 63928, 212059, 647, 9014, 81887, 8781, ...

[ 0.1629638671875, 0.0892333984375, 0.22509765625, 0.145751953125, 0.06195068359375, 0.195068359375, 0.1356201171875, 0.0236358642578125, 0.1739501953125, 0.087646484375, 0.297607421875, 0.122314453125, 0.09088134765625, 0.2010498046875, 0.049224853515625, 0.0258636474609375, 0.0739746...

embed

65327650_c1

65327650

haskell

1

Extra files to be distributed with the package, such as examples or a -- README. extra-source-files: README.md, ChangeLog.md -- Constraint on the version of Cabal needed to build this package. cabal-version: >=1.10 executable lsql-csv -- .hs or .lhs file containing the Main module. main-is: Main.hs ghc-options: -O3 --...

[ 0.007720947265625, 0.0012359619140625, 0.01165771484375, 0.000720977783203125, 0.00518798828125, -0.000629425048828125, -0.0262451171875, -0.007049560546875, -0.003265380859375, 0.013427734375, -0.007659912109375, -0.054443359375, 0.010009765625, 0.0166015625, -0.007354736328125, -0.01...

[ 31501, 102158, 47, 15917, 3674, 678, 98169, 4, 27781, 7, 188300, 10611, 4173, 60427, 29822, 5, 54686, 87377, 113972, 1657, 2816, 4288, 70, 11389, 30438, 289, 44841, 45367, 903, 109524, 46354, 963, 71924, 96, 99247, 9, 4439, 334, 4210, 127...

[ 0.1888427734375, 0.247314453125, 0.021331787109375, 0.2291259765625, 0.0777587890625, 0.10302734375, 0.241943359375, 0.00311279296875, 0.1407470703125, 0.025146484375, 0.1395263671875, 0.1988525390625, 0.1658935546875, 0.157470703125, 0.1856689453125, 0.003875732421875, 0.12866210937...

embed

55779190_c1

55779190

haskell

1

sha256:f90d6ab73ad35c749e8547ca132e7ab5d32d2f8e7bb2e2ff6d597be26b58e061 - transformers-compat-0.5.1.4@sha256:1b4bfa8589afb1ca0e719129ab261bd90ef0cc3e6c0b9963f94970c082b61250 output from stack build : F:\Projects\Haskell\my-happstack>stack build Error: While constructing the build plan, the following exceptions were enc...

0.4.5.2 Some Set config.yaml Consider Recommended stack.yaml Win32-2.8.3.0 sha256:58fa6f52e8a0d455a74bb19445c177f2cc79a0975cae5fd96e2334bd38a516d4 transformers-compat-0.6.4 sha256:d298cd9d1bb7b05160229e244436bae825b53660865e3d5fd695ea0fafec1e6f Plan How to resolve dependency tree with different version ranges of same p...

[ -0.01708984375, 0.0004596710205078125, 0.0155029296875, 0.00004100799560546875, 0.00762939453125, -0.004974365234375, -0.013916015625, -0.005462646484375, 0.017822265625, 0.030517578125, 0.0174560546875, -0.0133056640625, 0.0306396484375, -0.00118255615234375, 0.01123046875, -0.0007438...

[ 121254, 158296, 31384, 19943, 153837, 14520, 141, 137399, 89002, 106133, 177261, 17686, 6460, 82295, 132265, 9638, 127892, 33593, 151210, 124618, 2485, 617, 27198, 1314, 4453, 122887, 17928, 5586, 103608, 42548, 27771, 53201, 678, 12921, 11389, 3...

[ 0.12548828125, 0.1375732421875, 0.065185546875, 0.1353759765625, 0.198486328125, 0.168701171875, 0.1722412109375, 0.072509765625, 0.042938232421875, 0.065185546875, 0.236328125, 0.00372314453125, 0.10369873046875, 0.1688232421875, 0.1375732421875, 0.0546875, 0.1585693359375, 0.0224...

embed

56672750_c0

56672750

haskell

0

Title: Partitioning a String into more pieces with separating char in Haskell Problem title: Partitioning a String into more pieces with separating char in Haskell Tags: haskell, list, function Problem: Partitioning a String into more pieces with separating char in Haskell I have the following homework: Define a functi...

Partitioning a String into more pieces with separating char in Haskell Partitioning a String into more pieces with separating char in Haskell haskell list function Partitioning Haskell Examples Char my_tail Partitioning a String into more pieces with separating char in Haskell I have the following homework: I have writ...

[ 0.0033111572265625, -0.00921630859375, -0.001983642578125, 0.0189208984375, -0.026123046875, 0.0201416015625, -0.005523681640625, -0.015625, 0.008056640625, -0.0186767578125, 0.00058746337890625, -0.0281982421875, -0.0115966796875, 0.0107421875, -0.011474609375, 0.00946044921875, 0.0...

[ 9148, 1363, 23351, 214, 3934, 1286, 126371, 678, 38310, 21441, 20625, 142508, 1556, 5303, 32354, 89536, 21656, 759, 46741, 5368, 18244, 59121, 25632, 14602, 959, 9969, 1340, 831, 1957, 15400, 46673, 1456, 979, 133, 15190, 756, 124850, 501, ...

[ 0.2054443359375, 0.1246337890625, 0.19775390625, 0.0770263671875, 0.1153564453125, 0.1260986328125, 0.179931640625, 0.023406982421875, 0.19873046875, 0.162353515625, 0.1121826171875, 0.21826171875, 0.09326171875, 0.15576171875, 0.156005859375, 0.06207275390625, 0.1182861328125, 0.1...

embed

36773098_c1

36773098

haskell

1

class above), but this has led to a bunch of fairly similar typeclasses that exist only to reify the type as singleton data. I thought maybe I could abstract those multiple typeclasses into a single type family, for example replacing SBool and Boolean above with: {-# LANGUAGE PolyKinds #-} {-# LANGUAGE ConstraintKinds...

[ -0.00469970703125, 0.00457763671875, 0.000514984130859375, -0.0255126953125, -0.01141357421875, -0.008544921875, -0.0147705078125, -0.007354736328125, 0.00113677978515625, 0.01190185546875, -0.00494384765625, -0.0164794921875, -0.01171875, -0.0101318359375, -0.010009765625, 0.000789642...

[ 18507, 36917, 1284, 1556, 147306, 180663, 21373, 10644, 67413, 32316, 4734, 456, 40383, 11001, 1507, 2053, 17569, 164789, 48716, 14449, 133266, 90944, 43386, 136, 73783, 34677, 3358, 98064, 75930, 63306, 605, 7250, 2816, 43609, 18, 1984, 472, ...

[ 0.1754150390625, 0.119384765625, 0.006378173828125, 0.00732421875, 0.064453125, 0.04461669921875, 0.1126708984375, 0.23046875, 0.232666015625, 0.0931396484375, 0.0162200927734375, 0.07269287109375, 0.154296875, 0.1490478515625, 0.1907958984375, 0.1270751953125, 0.02886962890625, 0....

embed

45134724_c0

45134724

haskell

0

Title: Haskell: find to 2 numbers from list that add up to target sum Problem title: Haskell: find to 2 numbers from list that add up to target sum Tags: haskell, dynamic Problem: Haskell: find to 2 numbers from list that add up to target sum My aim: given a list of numbers, find the indices of the first pair of number...

Haskell: find to 2 numbers from list that add up to target sum Haskell: find to 2 numbers from list that add up to target sum haskell dynamic list qualified Haskell Data.HashMap M.empty M.lookup Just Nothing M.insert Haskell: find to 2 numbers from list that add up to target sum My aim: given a list of numbers, find th...

[ -0.035400390625, -0.0007781982421875, 0.007598876953125, 0.00052642822265625, -0.021240234375, 0.0159912109375, -0.004058837890625, 0.006744384765625, 0.0169677734375, -0.0247802734375, 0.0213623046875, -0.010009765625, 0.015625, 0.02880859375, 0.01904296875, -0.01312255859375, 0.006...

[ 20625, 142508, 7413, 47, 116, 101935, 1295, 5303, 450, 15190, 1257, 30388, 10554, 1556, 84079, 217225, 11809, 6495, 1495, 166179, 276, 33548, 64747, 2037, 9563, 182747, 73, 33657, 464, 34475, 136044, 5117, 80836, 14012, 2967, 26484, 40899, 50...

[ 0.16064453125, 0.255126953125, 0.1605224609375, 0.1705322265625, 0.1845703125, 0.2132568359375, 0.1256103515625, 0.2010498046875, 0.022064208984375, 0.1646728515625, 0.15771484375, 0.2445068359375, 0.216552734375, 0.1513671875, 0.1568603515625, 0.182373046875, 0.0821533203125, 0.13...

embed

49310194_c0

49310194

haskell

0

Title: How can I query RDF data using Haskell? Problem title: How can I query RDF data using Haskell? Tags: haskell, rdf, xml Problem: How can I query RDF data using Haskell? I'm a Haskell beginner. I have RDF XML from Project Gutenberg that looks like this: <?xml version="1.0" encoding="utf-8"?> <rdf:RDF xml:base="htt...

How can I query RDF data using Haskell? How can I query RDF data using Haskell? haskell rdf xml Haskell Anne How RDF utf-8 rdf:RDF xml:base www.gutenberg.org xmlns:rdf www.w3.org xmlns:dcterms purl.org xmlns:cc web.resource.org xmlns:dcam xmlns:rdfs xmlns:pgterms cc:Work rdf:about rdfs:comment Archives Gutenberg:Feeds ...

[ -0.00153350830078125, 0.023681640625, 0.003204345703125, 0.006134033203125, 0.0213623046875, -0.01263427734375, -0.0203857421875, -0.0203857421875, -0.0169677734375, -0.0537109375, 0.02099609375, -0.052978515625, -0.017822265625, -0.0179443359375, 0.002838134765625, 0.02099609375, -0...

[ 11249, 831, 87, 41, 1294, 627, 38997, 2053, 17368, 20625, 142508, 32, 1556, 4216, 420, 131492, 14245, 486, 17376, 12, 40756, 919, 37382, 1234, 150242, 1478, 1779, 363, 71, 147617, 4432, 7398, 141, 10060, 60427, 9779, 17447, 177, 32166, 10...

[ 0.083251953125, 0.0994873046875, 0.052154541015625, 0.16650390625, 0.151611328125, 0.1541748046875, 0.30078125, 0.2147216796875, 0.0975341796875, 0.1610107421875, 0.270751953125, 0.01141357421875, 0.1357421875, 0.1512451171875, 0.2015380859375, 0.2373046875, 0.1578369140625, 0.0579...

embed

29546721_c0

29546721

haskell

0

Title: How to parse multiple lines with start and end tokens in Parsec Problem title: How to parse multiple lines with start and end tokens in Parsec Tags: parsec, haskell Problem: How to parse multiple lines with start and end tokens in Parsec I am new at Parsec . Will appreciate pointers for the problem here. Say, I ...

How to parse multiple lines with start and end tokens in Parsec How to parse multiple lines with start and end tokens in Parsec parsec haskell How Parsec How to parse multiple lines with start and end tokens in Parsec I am new at Parsec . Will appreciate pointers for the problem here. Say, I have a csv file with fixed ...

[ -0.01507568359375, 0.007598876953125, 0.01031494140625, 0.04443359375, -0.0133056640625, 0.0145263671875, 0.007568359375, -0.00225830078125, 0.000255584716796875, -0.006561279296875, -0.0103759765625, 0.010009765625, -0.0036468505859375, 0.02294921875, 0.006103515625, 0.006683349609375...

[ 11249, 366, 184, 48716, 124519, 678, 4034, 136, 3564, 47, 84694, 2392, 39797, 1556, 142508, 23, 20763, 334, 11435, 188347, 10336, 1314, 6953, 13315, 1884, 6713, 100, 1098, 86595, 2046, 756, 24189, 11737, 351, 33548, 139118, 35604, 107730, 4...

[ 0.048980712890625, 0.171630859375, 0.1136474609375, 0.232177734375, 0.2071533203125, 0.0755615234375, 0.146728515625, 0.1085205078125, 0.164306640625, 0.1038818359375, 0.2109375, 0.13720703125, 0.2435302734375, 0.0765380859375, 0.17724609375, 0.0280609130859375, 0.0289459228515625, ...

embed

20599106_c0

20599106

haskell

0

Title: Get content of Cursor from unnormalized xml Problem title: Get content of Cursor from unnormalized xml Tags: xml, haskell, conduit Problem: Get content of Cursor from unnormalized xml Suppose there is xml file: <span id="assignee-val"> <span class="user-hover" id="issue_summary_assignee_m" rel="m"> <span class="...

Get content of Cursor from unnormalized xml Get content of Cursor from unnormalized xml xml haskell conduit unnormalized Get Cursor issue_summary_assignee_m Value Control.Applicative Data.ByteString.Lazy Text.HTML.DOM Text.XML.Cursor Prelude.map Data.ByteString.Lazy.readFile Get content of Cursor from unnormalized xml ...

[ -0.01165771484375, 0.04052734375, -0.017822265625, 0.0032501220703125, 0.008544921875, 0.00811767578125, -0.01123046875, -0.01904296875, -0.0087890625, -0.0166015625, 0.018798828125, -0.004241943359375, -0.0238037109375, -0.01544189453125, 0.00125885009765625, -0.00799560546875, 0.00...

[ 20779, 10941, 111, 58148, 42, 1295, 51, 33176, 29367, 131492, 1556, 142508, 120565, 31089, 112197, 7, 40255, 13, 39, 190060, 27131, 39179, 11048, 11809, 2729, 3285, 24129, 127068, 127214, 1542, 39456, 474, 4970, 1914, 822, 62346, 39116, 17435...

[ 0.119140625, 0.2264404296875, 0.109375, 0.221435546875, 0.1982421875, 0.1259765625, 0.115966796875, 0.19287109375, 0.1427001953125, 0.2509765625, 0.12109375, 0.2191162109375, 0.191650390625, 0.1407470703125, 0.10400390625, 0.001617431640625, 0.0748291015625, 0.040191650390625, 0....

embed

43056426_c0

43056426

haskell

0

Title: Microservices - using strict types to enforce the API? Problem title: Microservices - using strict types to enforce the API? Tags: json, types, service, microservices, haskell Problem: Microservices - using strict types to enforce the API? I am writing two separate services. The output of the first service feeds...

Microservices - using strict types to enforce the API? Microservices - using strict types to enforce the API? json types service microservices haskell strict Microservices API Application Products Score Microservices - using strict types to enforce the API? I am writing two separate services. The output of the first se...

[ -0.0089111328125, 0.0218505859375, 0.000766754150390625, 0.01708984375, -0.000698089599609375, 0.002593994140625, -0.006317138671875, 0.006988525390625, -0.00244140625, 0.022705078125, 0.014404296875, 0.004974365234375, 0.0012359619140625, 0.007415771484375, 0.0025787353515625, 0.01708...

[ 37992, 22584, 7, 20, 17368, 81113, 52895, 22, 50930, 61687, 32, 47, 1647, 1681, 4516, 11948, 1556, 142508, 104921, 100815, 168071, 32562, 6626, 84797, 11374, 140992, 111, 70, 5117, 61590, 3934, 17932, 151117, 4527, 10, 99764, 35773, 1294, 1...

[ 0.212890625, 0.291259765625, 0.06396484375, 0.0340576171875, 0.1246337890625, 0.26904296875, 0.299560546875, 0.0987548828125, 0.1986083984375, 0.2274169921875, 0.0169677734375, 0.01226806640625, 0.10107421875, 0.1417236328125, 0.170166015625, 0.17626953125, 0.1051025390625, 0.21203...

embed

49211198_c0

49211198

haskell

0

Title: Why is my insertion sort slower than library merge sort on (almost) sorted data? Problem title: Why is my insertion sort slower than library merge sort on (almost) sorted data? Tags: sorting, performance, haskell Problem: Why is my insertion sort slower than library merge sort on (almost) sorted data? The defaul...

Why is my insertion sort slower than library merge sort on (almost) sorted data? Why is my insertion sort slower than library merge sort on (almost) sorted data? sorting performance haskell Why Data.List.sort Ord Mv.IOVector forM_ Mv.length Mv.read x-1 x-2 Sort y:ys Mv.write Why is my insertion sort slower than library...

[ -0.02685546875, 0.0045166015625, 0.012939453125, -0.022216796875, 0.00016498565673828125, 0.01312255859375, -0.0240478515625, -0.032470703125, -0.010498046875, -0.0140380859375, 0.005859375, 0.00897216796875, 0.017578125, -0.004974365234375, -0.0128173828125, -0.0244140625, -0.010375...

[ 44084, 759, 241860, 12096, 72803, 56, 35773, 1294, 42564, 840, 18, 17497, 2053, 98, 71, 214, 23718, 1556, 142508, 11809, 154663, 62351, 35379, 334, 17780, 26455, 18770, 23986, 39116, 1022, 5759, 5428, 53666, 113, 4778, 3501, 114977, 5, 2947...

[ 0.0936279296875, 0.131103515625, 0.21875, 0.245849609375, 0.1949462890625, 0.0894775390625, 0.1383056640625, 0.045867919921875, 0.199462890625, 0.136962890625, 0.04248046875, 0.1859130859375, 0.07763671875, 0.007781982421875, 0.035675048828125, 0.038848876953125, 0.1602783203125, 0...

embed

67626352_c0

67626352

haskell

0

Title: How to do a recursive main function in Haskell Problem title: How to do a recursive main function in Haskell Tags: haskell, recursion Problem: How to do a recursive main function in Haskell So I wanted to make a program that prints out a ASCII triangle. The program asks you the height that you want your triangle...

How to do a recursive main function in Haskell How to do a recursive main function in Haskell haskell recursion How Haskell level-1 Couldn Char How to do a recursive main function in Haskell So I wanted to make a program that prints out a ASCII triangle. The program asks you the height that you want your triangle to be...

[ -0.01446533203125, 0.00421142578125, 0.01190185546875, 0.01104736328125, 0.00003910064697265625, 0.0147705078125, -0.005157470703125, -0.00174713134765625, -0.0048828125, -0.0048828125, 0.019775390625, -0.03173828125, -0.004913330078125, 0.004638671875, -0.0033416748046875, 0.002258300...

[ 11249, 47, 54, 10, 195625, 5844, 5201, 32354, 23, 20625, 142508, 1556, 1830, 17366, 5759, 191147, 21656, 36663, 3249, 1528, 28412, 1810, 125429, 10001, 1927, 109217, 26458, 155955, 3444, 186, 24189, 14012, 3884, 83, 361, 123840, 25550, 15592,...

[ 0.06842041015625, 0.03118896484375, 0.123779296875, 0.045562744140625, 0.2347412109375, 0.18505859375, 0.190185546875, 0.216064453125, 0.071533203125, 0.15185546875, 0.2607421875, 0.1329345703125, 0.0615234375, 0.144775390625, 0.0965576171875, 0.0885009765625, 0.1461181640625, 0.06...

embed

32343301_c1

32343301

haskell

1

5440/UTFTConverter-0.1.0.0/src/Format/C.hs Installing src/Format/Converter.hs to dist/src/sdist.-15440/UTFTConverter-0.1.0.0/src/Format/Converter.hs Installing src/Format/Raw.hs to dist/src/sdist.-15440/UTFTConverter-0.1.0.0/src/Format/Raw.hs Installing src/Format/RGB565.hs to dist/src/sdist.-15440/UTFTConverter-0.1.0....

[ 0.00726318359375, 0.01220703125, 0.01300048828125, -0.0198974609375, -0.00537109375, -0.0216064453125, -0.0107421875, -0.006561279296875, -0.001983642578125, 0.03857421875, -0.0004329681396484375, -0.0283203125, 0.0031585693359375, 0.0030059814453125, -0.003692626953125, -0.00799560546...

[ 8983, 2839, 17632, 25217, 11935, 814, 720, 102014, 5, 99929, 64, 7, 19437, 102973, 257, 441, 127, 107951, 214, 47, 45, 271, 46295, 13386, 141929, 9, 91, 12248, 434, 8359, 162689, 1052, 168793, 109921, 111337, 6954, 6, 107615, 207771, 2037...

[ 0.1361083984375, 0.21630859375, 0.1339111328125, 0.1927490234375, 0.1077880859375, 0.2060546875, 0.1754150390625, 0.1473388671875, 0.012664794921875, 0.1590576171875, 0.010009765625, 0.03277587890625, 0.183837890625, 0.1971435546875, 0.010101318359375, 0.00518798828125, 0.14599609375...

embed

32907157_c0

32907157

haskell

0

Title: how to count the number of nested in tuples and how to union this list of tuples Problem title: how to count the number of nested in tuples and how to union this list of tuples Tags: haskell Problem: how to count the number of nested in tuples and how to union this list of tuples 1.how to count the number of nes...

how to count the number of nested in tuples and how to union this list of tuples how to count the number of nested in tuples and how to union this list of tuples haskell a Expr Possible rev2 x:xs flatten1 Ord MM1 Show Main oo.hs Compiling oo.hs:140:12 Couldn oo.hs:140:21 how to count the number of nested in tuples and ...

[ -0.004302978515625, 0.0145263671875, 0.00616455078125, 0.002593994140625, 0.0198974609375, 0.0201416015625, -0.0201416015625, -0.0234375, 0.0289306640625, -0.0093994140625, -0.00994873046875, -0.0108642578125, 0.03515625, 0.007293701171875, 0.00299072265625, -0.01214599609375, 0.0052...

[ 3642, 47, 54529, 14012, 111, 8512, 71, 23, 370, 99726, 136, 69941, 903, 5303, 1556, 142508, 60075, 42, 115861, 37868, 304, 1022, 425, 49878, 510, 35379, 41646, 17367, 12321, 806, 127, 15612, 49725, 43900, 20927, 191147, 25619, 47251, 18499,...

[ 0.0687255859375, 0.05078125, 0.1976318359375, 0.1085205078125, 0.03814697265625, 0.274169921875, 0.1544189453125, 0.10760498046875, 0.1636962890625, 0.2354736328125, 0.04290771484375, 0.2198486328125, 0.054534912109375, 0.1094970703125, 0.1173095703125, 0.1939697265625, 0.05804443359...

embed

21792441_c1

21792441

haskell

1

install wl-pprint-text-1.1.0.2 Failed to install xml-types-0.3.4 cabal: Error: some packages failed to install: attoparsec-conduit-1.0.1.2 depends on lifted-base-0.2.2.0 which failed to install. authenticate-1.3.2.6 depends on xml-types-0.3.4 which failed to install. blaze-builder-conduit-1.0.0 depends on lifted-base-...

[ 0.0047607421875, -0.0029296875, 0.00189208984375, -0.006256103515625, -0.0025787353515625, -0.010498046875, -0.005401611328125, -0.028564453125, 0.003265380859375, 0.0546875, -0.00396728515625, -0.0223388671875, 0.0016021728515625, -0.01025390625, -0.00116729736328125, -0.0063781738281...

[ 20600, 148, 141, 9, 254, 35662, 22829, 92134, 133684, 190355, 297, 47, 131492, 50986, 23320, 172508, 109524, 12, 212059, 3060, 98169, 165523, 243, 31, 2500, 39797, 2271, 112061, 102107, 48400, 56566, 60520, 37382, 73011, 3129, 195734, 81046, ...

[ 0.2132568359375, 0.0560302734375, 0.13134765625, 0.010894775390625, 0.0892333984375, 0.274169921875, 0.2325439453125, 0.133056640625, 0.213134765625, 0.190185546875, 0.126708984375, 0.0738525390625, 0.2451171875, 0.2244873046875, 0.08306884765625, 0.2371826171875, 0.2393798828125, ...

embed

31365904_c0

31365904

haskell

0

Title: Possible to generically remove function types from datatype, to allow deriveJSON? Problem title: Possible to generically remove function types from datatype, to allow deriveJSON? Tags: aeson, haskell, generic-programming Problem: Possible to generically remove function types from datatype, to allow deriveJSON? I...

Possible to generically remove function types from datatype, to allow deriveJSON? Possible to generically remove function types from datatype, to allow deriveJSON? aeson haskell generic-programming datatype Possible Foo ActionM Bar Maybe Possible to generically remove function types from datatype, to allow deriveJSON? ...

[ -0.007598876953125, 0.033935546875, -0.0033111572265625, 0.0093994140625, -0.00665283203125, -0.0079345703125, 0.0034332275390625, 0.00787353515625, 0.000736236572265625, -0.0164794921875, -0.007354736328125, 0.0150146484375, -0.022705078125, -0.006500244140625, 0.00183868408203125, 0....

[ 115861, 2661, 11212, 71407, 87388, 32354, 52895, 1295, 2053, 50986, 63769, 122, 5844, 1375, 58627, 10, 90, 191, 1556, 142508, 189534, 28966, 9572, 31, 57945, 594, 3253, 83425, 33636, 11341, 38415, 55720, 2667, 18403, 61972, 22, 40899, 2684, ...

[ 0.097412109375, 0.0230255126953125, 0.1649169921875, 0.03814697265625, 0.1978759765625, 0.190673828125, 0.252685546875, 0.0489501953125, 0.0931396484375, 0.237060546875, 0.091796875, 0.09735107421875, 0.131103515625, 0.12939453125, 0.2030029296875, 0.0191650390625, 0.0645751953125, ...

embed

56318633_c0

56318633

haskell

0

Title: Function that takes an array of chars and returns a concatenated string. Haskell Problem title: Function that takes an array of chars and returns a concatenated string. Haskell Tags: haskell, functional-programming Problem: Function that takes an array of chars and returns a concatenated string. Haskell Ugh... S...

Function that takes an array of chars and returns a concatenated string. Haskell Function that takes an array of chars and returns a concatenated string. Haskell haskell functional-programming System.Random Control.Monad Data.Array Data.List Haskell Array Char i-1 Function that takes an array of chars and returns a con...

[ -0.00238037109375, -0.0159912109375, 0.000021576881408691406, 0.004180908203125, 0.006011962890625, -0.0047607421875, 0.0115966796875, 0.00628662109375, 0.0078125, 0.00836181640625, -0.01434326171875, -0.02099609375, -0.008056640625, 0.003448486328125, -0.0130615234375, -0.011047363281...

[ 28670, 10763, 450, 51776, 10298, 53, 111, 21441, 7, 136, 30646, 158, 4460, 33, 79315, 20625, 142508, 1556, 123309, 28966, 12353, 126525, 3815, 27131, 46674, 712, 11809, 7092, 154663, 69253, 21656, 17, 5759, 9486, 63667, 9815, 678, 40858, 29...

[ 0.171630859375, 0.11083984375, 0.007568359375, 0.113525390625, 0.131103515625, 0.0782470703125, 0.00531005859375, 0.2025146484375, 0.03033447265625, 0.0258331298828125, 0.162109375, 0.09246826171875, 0.1251220703125, 0.0694580078125, 0.206787109375, 0.1212158203125, 0.232421875, 0....

embed

14114362_c0

14114362

haskell

0

Title: Yesod, howto generate type-safe link from JSON-data in Javascript / Julius Problem title: Yesod, howto generate type-safe link from JSON-data in Javascript / Julius Tags: yesod, haskell Problem: Yesod, howto generate type-safe link from JSON-data in Javascript / Julius I've a route /notes/#NoteId NoteR GET From ...

Yesod, howto generate type-safe link from JSON-data in Javascript / Julius Yesod, howto generate type-safe link from JSON-data in Javascript / Julius yesod haskell JSON-data Yesod Javascript Julius NoteId NoteR GET obj.id jQuery.getJSON NotesR obj.title window.onload Model.hs ToJSON Entity Note created_at updated_at Ye...

[ -0.009033203125, -0.002288818359375, 0.00157928466796875, -0.00885009765625, 0.004058837890625, -0.01312255859375, 0.007171630859375, 0.0169677734375, -0.01214599609375, -0.08837890625, -0.026611328125, -0.017578125, -0.0167236328125, -0.0167236328125, 0.0069580078125, -0.021484375, ...

[ 32635, 2199, 3642, 188, 139392, 10644, 9, 115840, 3126, 1295, 821, 58627, 10135, 23, 74181, 109112, 2422, 23722, 1556, 142508, 18622, 568, 71, 1052, 79794, 995, 170, 532, 231129, 3794, 1375, 5440, 76896, 191, 63033, 13293, 127, 717, 16511, ...

[ 0.1805419921875, 0.2454833984375, 0.050537109375, 0.05908203125, 0.1826171875, 0.22607421875, 0.0750732421875, 0.252197265625, 0.2279052734375, 0.1015625, 0.140380859375, 0.218017578125, 0.13134765625, 0.020599365234375, 0.23193359375, 0.259521484375, 0.10321044921875, 0.169921875,...

embed

41509628_c1

41509628

haskell

1

xs result = do n <- peek n xs <- peekArray n xs pokeArray result $ acumSum xs Code in C: (exactly the same of the mentioned blog post) Compiling: ghc -c SumRoots.hs ghc -c StartEnd.c ghc -shared -o SumRoots.dll SumRoots.o StartEnd.o Code in Mathematica: Needs["NETLink`"] hsStart = DefineDLLFunction["HsStart", "c:\\tem...

[ -0.007720947265625, 0.022705078125, -0.01080322265625, 0.00286865234375, -0.002227783203125, 0.01025390625, -0.010009765625, 0.01068115234375, 0.01708984375, -0.0498046875, 0.01025390625, 0.0177001953125, 0.013916015625, -0.0101318359375, -0.005340576171875, -0.01239013671875, 0.0275...

[ 1022, 7, 16750, 54, 653, 4426, 9, 280, 343, 7614, 7092, 160, 350, 3650, 9176, 294, 316, 28864, 23, 313, 12, 47013, 5701, 119056, 1415, 1305, 15612, 49725, 31380, 238, 36335, 12724, 30591, 127, 13794, 152378, 67886, 1181, 31, 123426, 888...

[ 0.1864013671875, 0.1773681640625, 0.25927734375, 0.08270263671875, 0.07623291015625, 0.08544921875, 0.030670166015625, 0.1531982421875, 0.1685791015625, 0.059844970703125, 0.1531982421875, 0.098876953125, 0.1324462890625, 0.000946044921875, 0.2362060546875, 0.114501953125, 0.25048828...

embed

47433796_c0

47433796

haskell

0

Title: How to apply single β-step at the root Problem title: How to apply single β-step at the root Tags: haskell, lambda Problem: How to apply single β-step at the root I got the following task: Let type Strat = Term -> [Term] be the type of reduction strategies. Implement the strategy root :: Strat which applies a si...

How to apply single β-step at the root How to apply single β-step at the root haskell lambda How Term App Abs Show How to apply single β-step at the root I got the following task: Now I know how the different strategies (applicative order reduction, normal order reduction, ...) work. My question now is, now: Every time...

[ -0.0015106201171875, 0.0255126953125, 0.008544921875, 0.0208740234375, 0.0186767578125, 0.0185546875, 0.0191650390625, -0.0113525390625, 0.00775146484375, -0.022216796875, 0.016357421875, -0.001953125, -0.00787353515625, 0.0081787109375, -0.002471923828125, -0.0137939453125, 0.006256...

[ 11249, 47, 59911, 11001, 9269, 9, 95528, 99, 70, 74855, 1556, 142508, 6492, 85, 2994, 39, 5659, 27174, 17367, 66211, 12921, 50531, 9007, 11048, 12989, 456, 77391, 3638, 4488, 87769, 1733, 13579, 2046, 15700, 44084, 5608, 30646, 5303, 69407,...

[ 0.07647705078125, 0.052734375, 0.1839599609375, 0.19873046875, 0.220947265625, 0.04425048828125, 0.2342529296875, 0.1221923828125, 0.019073486328125, 0.2476806640625, 0.1080322265625, 0.234375, 0.1378173828125, 0.07611083984375, 0.1080322265625, 0.0303955078125, 0.13720703125, 0.15...

embed

35510790_c0

35510790

haskell

0

Title: Haskell Terminology: Part of type signature following constraints Problem title: Haskell Terminology: Part of type signature following constraints Tags: haskell Problem: Haskell Terminology: Part of type signature following constraints Many type signatures in Haskell are of the following form: a :: (B) => C As I...

Haskell Terminology: Part of type signature following constraints Haskell Terminology: Part of type signature following constraints haskell Haskell Terminology Part Monad Haskell Terminology: Part of type signature following constraints Many type signatures in Haskell are of the following form: As I understand it, the ...

[ 0.0172119140625, -0.003173828125, 0.0157470703125, 0.0191650390625, -0.007293701171875, 0.011962890625, 0.0029449462890625, 0.00958251953125, -0.0101318359375, 0.013916015625, -0.0186767578125, -0.021728515625, -0.02685546875, 0.0047607421875, -0.008544921875, 0.006927490234375, -0.0...

[ 20625, 142508, 27366, 25443, 16995, 111, 10644, 138256, 25632, 158, 2816, 4288, 1556, 60331, 71, 52455, 3173, 28219, 13579, 50986, 15005, 64194, 64549, 10, 1984, 571, 313, 335, 13379, 35839, 2271, 6332, 47143, 820, 5570, 9351, 2831, 105866, ...

[ 0.114990234375, 0.237548828125, 0.10394287109375, 0.0810546875, 0.1326904296875, 0.048004150390625, 0.234130859375, 0.27587890625, 0.162353515625, 0.114501953125, 0.22314453125, 0.1593017578125, 0.084716796875, 0.166748046875, 0.1314697265625, 0.004119873046875, 0.1029052734375, 0....

embed

64128964_c1

64128964

haskell

1

mp mapped to integer-gmp-1.0.2.0 wired-in package base mapped to base-4.12.0.0 wired-in package rts mapped to rts-1.0 wired-in package template-haskell mapped to template-haskell-2.14.0.0 wired-in package ghc mapped to ghc-8.6.5 *** Chasing dependencies: Chasing modules from: *Test/CalcTests.hs !!! Chasing dependencies...

[ 0.0001735687255859375, -0.00799560546875, 0.0162353515625, -0.0045166015625, 0.011474609375, 0.005645751953125, -0.007720947265625, -0.033935546875, 0.0244140625, 0.01300048828125, -0.00921630859375, -0.018798828125, -0.00051116943359375, 0.0166015625, 0.0185546875, 0.01239013671875, ...

[ 9607, 291, 48398, 47, 892, 1505, 177, 2676, 102107, 73011, 1439, 297, 73, 98169, 3647, 11565, 15654, 99929, 1690, 933, 110934, 10557, 142508, 2592, 9, 31380, 238, 17376, 136473, 24428, 4841, 6953, 42548, 117538, 88996, 7, 1295, 111337, 64, ...

[ 0.2220458984375, 0.19482421875, 0.1429443359375, 0.1385498046875, 0.1611328125, 0.1201171875, 0.057861328125, 0.254150390625, 0.1563720703125, 0.202392578125, 0.161865234375, 0.088134765625, 0.17431640625, 0.21923828125, 0.2122802734375, 0.03448486328125, 0.093994140625, 0.12707519...

embed

22857766_c0

22857766

haskell

0

Title: Infinite list in haskell combined with fold* doesn't calculate Problem title: Infinite list in haskell combined with fold* doesn't calculate Tags: fold, dictionary, haskell, infinite Problem: Infinite list in haskell combined with fold* doesn't calculate Let's say I want to get a sorted infinite list o...

Infinite list in haskell combined with fold* doesn't calculate Infinite list in haskell combined with fold* doesn't calculate fold dictionary haskell infinite Infinite Ord x:xs y:ys Integer p:xs Infinite list in haskell combined with fold* doesn't calculate Let's say I want to get a sorted infinite list of al...

[ -0.0045166015625, -0.00003647804260253906, 0.01336669921875, -0.00469970703125, 0.003021240234375, -0.0007781982421875, 0.01409912109375, -0.0137939453125, 0.0196533203125, -0.01409912109375, 0.0108642578125, 0.00970458984375, 0.0211181640625, 0.0157470703125, -0.00775146484375, -0.003...

[ 134322, 13, 5303, 1556, 142508, 70163, 678, 42822, 1639, 22027, 3768, 18, 74481, 10763, 54241, 35379, 4778, 44401, 915, 425, 23, 3444, 2046, 17497, 71, 756, 20809, 62783, 1257, 54137, 653, 32354, 42564, 6626, 76199, 11389, 132887, 145111, 7...

[ 0.15673828125, 0.0418701171875, 0.1998291015625, 0.1102294921875, 0.220703125, 0.13330078125, 0.041473388671875, 0.180908203125, 0.1151123046875, 0.013275146484375, 0.1378173828125, 0.0711669921875, 0.18359375, 0.03839111328125, 0.1229248046875, 0.11962890625, 0.009490966796875, 0....

embed

25913481_c0

25913481

haskell

0

Title: Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 Problem title: Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 Tags: haskell, performance Problem: Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 Given is a text file (for piping) with many numbers divided by a space...

Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 Read numbers from stdin into a Data.Vector.Unboxed.Vector Int64 haskell performance stdin Control.Applicative Control.Arrow Data.Int Data.Maybe qualified Read Data.Vector.Unboxed.Vector Int64 Data.ByteString.Char8 Data.Vector.Unboxed B.getContents V.maximu...

[ -0.00762939453125, -0.0030975341796875, 0.004974365234375, 0.0037384033203125, -0.0093994140625, 0.0164794921875, 0.006744384765625, -0.0263671875, -0.0118408203125, -0.03857421875, -0.003143310546875, -0.007781982421875, 0.00970458984375, 0.00640869140625, 0.01171875, -0.0115356445312...

[ 4764, 101935, 1295, 6138, 3035, 3934, 10, 11809, 26455, 18770, 14256, 11728, 360, 18, 13307, 1556, 142508, 23718, 27131, 11048, 15555, 4153, 217225, 71713, 84068, 1019, 335, 3794, 25352, 310, 53950, 4353, 39116, 161063, 154663, 12613, 21693, ...

[ 0.198974609375, 0.201904296875, 0.107666015625, 0.184326171875, 0.176025390625, 0.1806640625, 0.044219970703125, 0.126953125, 0.205078125, 0.1527099609375, 0.095703125, 0.1790771484375, 0.061767578125, 0.091064453125, 0.2174072265625, 0.109130859375, 0.2044677734375, 0.141357421875...

embed

28660035_c1

28660035

haskell

1

TimeStep -> [Particle] -> [[Particle]] simulateParticlesPar ts = withStrategy (parList (parBuffer 250 particleStrategy)) . fmap (simulateParticle ts) -- Build a lazy infinite list of the particle's travel with each -- update being a TimeStep apart. simulateParticle :: TimeStep -> Particle -> [Particle] simulateParticl...

[ -0.025634765625, 0.0159912109375, -0.01544189453125, -0.01007080078125, 0.01153564453125, 0.00125885009765625, 0.0093994140625, -0.0284423828125, 0.0034332275390625, -0.026123046875, -0.02099609375, 0.032470703125, 0.0128173828125, 0.01458740234375, -0.006378173828125, -0.0026550292968...

[ 19055, 191644, 33079, 683, 26147, 86245, 40226, 67, 7, 28636, 61636, 2203, 678, 97315, 3432, 2500, 154663, 7235, 18234, 5316, 915, 5, 1238, 62346, 137003, 4210, 121137, 21, 3285, 54241, 5303, 26983, 12638, 28350, 8035, 34955, 1984, 347, 299...

[ 0.1693115234375, 0.2802734375, 0.041839599609375, 0.05438232421875, 0.2122802734375, 0.0191650390625, 0.28271484375, 0.1558837890625, 0.01837158203125, 0.1856689453125, 0.1568603515625, 0.032501220703125, 0.1082763671875, 0.152099609375, 0.1041259765625, 0.07586669921875, 0.140014648...

embed

46112354_c1

46112354

haskell

1

Control.Lens (makeLenses, use, (.=), ASetter) import Control.Monad.State.Class (MonadState) import Control.Monad.Trans.Class (lift) import Control.Monad.Trans.State.Lazy (StateT(StateT), execStateT) data GameObject = GameObject { _num :: Int } deriving (Show) data Game = Game { _objects :: [GameObject] } deriving (Sho...

[ -0.038818359375, 0.0079345703125, 0.004425048828125, -0.017333984375, 0.0166015625, -0.00994873046875, -0.0306396484375, -0.0172119140625, 0.00225830078125, -0.03125, -0.007781982421875, 0.035400390625, 0.01092529296875, -0.01239013671875, 0.018310546875, -0.0120849609375, 0.00121307...

[ 27131, 5, 866, 1755, 55898, 47754, 4527, 1369, 6483, 62593, 24927, 46674, 712, 135206, 140803, 62624, 104501, 2729, 3285, 618, 3240, 2053, 13547, 46471, 75161, 2606, 16406, 168660, 2203, 187694, 107576, 3249, 114977, 22288, 138, 2811, 151138, ...

[ 0.232666015625, 0.0196380615234375, 0.1824951171875, 0.1962890625, 0.0955810546875, 0.14697265625, 0.07427978515625, 0.0299072265625, 0.010345458984375, 0.2127685546875, 0.1661376953125, 0.06671142578125, 0.1124267578125, 0.152099609375, 0.182861328125, 0.0928955078125, 0.20458984375...

embed

69122738_c0

69122738

haskell

0

Title: How do I fix this error when installing GHC with ghcup? Problem title: How do I fix this error when installing GHC with ghcup? Tags: haskell, ghcup, ghc Problem: How do I fix this error when installing GHC with ghcup? I'm trying to install GHC with ghcup on an windows laptop running an Ubuntu subsystem. I keep g...

How do I fix this error when installing GHC with ghcup? How do I fix this error when installing GHC with ghcup? haskell ghcup ghc How GHC Info ghc-8.10.7-x86_64-fedora27-linux.tar.xz Unpacking ghcup-61d1fb5776edc19e Installing Win64 DLLs stage2 ghc-8.10.7 Couldn package.conf.d ghc.mk:985 install_packages Error Makefile...

[ 0.004974365234375, 0.00933837890625, 0.0238037109375, -0.005340576171875, 0.0045166015625, 0.00390625, -0.029541015625, -0.00946044921875, -0.00165557861328125, 0.015380859375, 0.014892578125, -0.01397705078125, 0.00185394287109375, 0.01177978515625, -0.00286865234375, 0.021484375, -...

[ 30022, 903, 18499, 20600, 214, 527, 73265, 678, 31380, 33874, 1556, 142508, 238, 14048, 17376, 10179, 50775, 15276, 13307, 2242, 11606, 3768, 2397, 6077, 867, 992, 29102, 11540, 11835, 2947, 107951, 17686, 23708, 36541, 304, 966, 191147, 9816...

[ 0.086181640625, 0.040069580078125, 0.1719970703125, 0.1661376953125, 0.038848876953125, 0.11279296875, 0.22802734375, 0.1483154296875, 0.146484375, 0.26025390625, 0.089111328125, 0.2125244140625, 0.11279296875, 0.0860595703125, 0.0848388671875, 0.17626953125, 0.014556884765625, 0.1...

embed