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
39069770_c0	39069770	haskell	0	Title: How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack project? Problem title: How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack project? Tags: haskell, haskell-stack Problem: How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack proje...	How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack project? How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack project? haskell haskell-stack How Lib.hs Main.hs LICENSE helloworld.cabal Setup.hs stack.yaml Spec.hs How am I meant to split code between src/Lib.hs an...	[ 0.005706787109375, 0.0128173828125, -0.005859375, 0.009521484375, -0.01708984375, 0.0038909912109375, 0.0098876953125, 0.01171875, 0.01300048828125, 0.0040283203125, -0.002288818359375, -0.0279541015625, 0.00897216796875, 0.026611328125, -0.002166748046875, 0.00323486328125, -0.00127...	[ 11249, 131148, 47, 65450, 18151, 17721, 91, 19437, 64, 104820, 127, 136, 4027, 168793, 3525, 177261, 13452, 1556, 142508, 590, 2594, 43278, 5, 12321, 107615, 207771, 33600, 31, 32554, 408, 3571, 19943, 2037, 14520, 141, 24990, 444, 23, 2563...	[ 0.0726318359375, 0.1348876953125, 0.010345458984375, 0.23486328125, 0.23095703125, 0.1123046875, 0.02850341796875, 0.1910400390625, 0.060791015625, 0.2052001953125, 0.18017578125, 0.0753173828125, 0.1907958984375, 0.1964111328125, 0.1126708984375, 0.2003173828125, 0.1414794921875, ...	embed
40265999_c0	40265999	haskell	0	Title: Applicative and Monad instances for a function type? Problem title: Applicative and Monad instances for a function type? Tags: monads, haskell, instances Problem: Applicative and Monad instances for a function type? I have a data type that resembles Blah below but because of a quirk with the type I cannot automa...	Applicative and Monad instances for a function type? Applicative and Monad instances for a function type? monads haskell instances Applicative Monad Blah Functor Applicative and Monad instances for a function type? I have a data type that resembles Blah below but because of a quirk with the type I cannot automatically ...	[ 0.00860595703125, 0.01251220703125, 0.010986328125, 0.0024566650390625, -0.0005950927734375, 0.0164794921875, 0.01324462890625, 0.002166748046875, 0.0172119140625, -0.0037384033203125, -0.02099609375, -0.0106201171875, -0.007415771484375, 0.0068359375, -0.0086669921875, -0.016235351562...	[ 5659, 11048, 4935, 136, 60331, 71, 110527, 7, 100, 32354, 10644, 2667, 712, 1556, 142508, 335, 1566, 28670, 18770, 2053, 3332, 195, 35064, 569, 53418, 191082, 122, 5844, 23009, 46517, 103607, 10, 26366, 70, 171763, 15700, 3525, 50986, 13756...	[ 0.15087890625, 0.1934814453125, 0.19091796875, 0.1182861328125, 0.231689453125, 0.18603515625, 0.3037109375, 0.048492431640625, 0.06640625, 0.1781005859375, 0.2086181640625, 0.1580810546875, 0.2115478515625, 0.1136474609375, 0.21826171875, 0.06884765625, 0.23779296875, 0.1248779296...	embed
59507652_c1	59507652	haskell	1	=> MyTrans m a -> (a -> m b) -> MyTrans m b x >>=!? f = x >>= (lift . f) Of course a general colift :: (MonadTrans t, Monad m) => t m a -> m a makes absolutely zero sense, because surely the transformer is doing something that we cannot just throw away like that in all cases. But just like (>>=) introduces contravaria...	=> MyTrans m a -> (a -> m b) -> MyTrans m b x >>=!? f = x >>= (lift . f) Of course a general colift :: (MonadTrans t, Monad m) => t m a -> m a makes absolutely zero sense, because surely the transformer is doing something that we cannot just throw away like that in all cases. But just like (>>=) introduces contravaria...	[ -0.004974365234375, 0.0038604736328125, 0.01025390625, -0.01318359375, 0.0181884765625, -0.0267333984375, 0.01214599609375, -0.024658203125, 0.0262451171875, -0.00885009765625, 0.01190185546875, 0.0185546875, 0.010009765625, 0.0145263671875, -0.0029296875, -0.01031494140625, 0.003875...	[ 44357, 2646, 62624, 347, 10, 33079, 11, 876, 16, 1022, 6396, 1369, 38, 1238, 2203, 104501, 15411, 4537, 552, 1984, 46674, 712, 808, 60331, 71, 30482, 115839, 45234, 10422, 6637, 9077, 538, 70, 27198, 56, 20594, 9844, 450, 642, 53418, 16...	[ 0.06097412109375, 0.2100830078125, 0.287109375, 0.1824951171875, 0.23583984375, 0.130615234375, 0.099365234375, 0.162353515625, 0.0204620361328125, 0.1075439453125, 0.1439208984375, 0.23681640625, 0.118408203125, 0.10546875, 0.0230865478515625, 0.290283203125, 0.0306396484375, 0.14...	embed
27344929_c0	27344929	haskell	0	Title: Haskell Tree - Show instance Problem title: Haskell Tree - Show instance Tags: haskell, ghci, functional-programming, function Problem: Haskell Tree - Show instance I am learning haskell and i want to print all nodes in tree (depends on height on tree, where height = 0 => leafs). And i thinking, that I create a ...	Haskell Tree - Show instance Haskell Tree - Show instance haskell ghci functional-programming function a Haskell Tree Show Empty Node tree4 tree5 heightTree::Tree Integer treeLev::Tree a-1 Main Possible GHCi Haskell Tree - Show instance I am learning haskell and i want to print all nodes in tree (depends on height on t...	[ -0.007110595703125, -0.0181884765625, 0.003570556640625, -0.00830078125, 0.017822265625, 0.01373291015625, -0.0142822265625, -0.01348876953125, 0.00183868408203125, -0.0078125, -0.01495361328125, -0.03759765625, 0.01104736328125, 0.009521484375, 0.0118408203125, -0.00994873046875, 0....	[ 20625, 142508, 101344, 17367, 110527, 1556, 31380, 318, 123309, 28966, 32354, 31678, 939, 438, 112, 53201, 617, 758, 155955, 62731, 44401, 5267, 334, 10, 5759, 12321, 115861, 527, 73265, 14, 52080, 3444, 28412, 756, 110, 988, 23, 105254, 75...	[ 0.1343994140625, 0.2327880859375, 0.257568359375, 0.236572265625, 0.251708984375, 0.1368408203125, 0.09918212890625, 0.1202392578125, 0.1552734375, 0.108154296875, 0.185302734375, 0.1585693359375, 0.09820556640625, 0.125, 0.0482177734375, 0.2059326171875, 0.09033203125, 0.063354492...	embed
75751903_c1	75751903	haskell	1	? I think the function accum is the one that needs to be changed. My code is: import qualified Data.ByteString.Lazy.Char8 as BLC import qualified Data.Vector.Unboxed as U import Data.Vector.Unboxed ((!)) import Data.Maybe (fromJust) import Data.List (foldl') primesSq :: Int -> [BLC.ByteString] -> [Int] primesSq lim [] ...	? I think the function accum is the one that needs to be changed. My code is: import qualified Data.ByteString.Lazy.Char8 as BLC import qualified Data.Vector.Unboxed as U import Data.Vector.Unboxed ((!)) import Data.Maybe (fromJust) import Data.List (foldl') primesSq :: Int -> [BLC.ByteString] -> [Int] primesSq lim [] ...	[ -0.012939453125, 0.0106201171875, 0.0166015625, 0.0159912109375, -0.0022735595703125, 0.0260009765625, -0.0145263671875, -0.0106201171875, 0.0081787109375, -0.022216796875, 0.029541015625, 0.0250244140625, 0.00909423828125, -0.009765625, -0.005584716796875, 0.006103515625, -0.0094604...	[ 705, 87, 5351, 32354, 61689, 39, 83, 70, 1632, 450, 27117, 47, 186, 98816, 5, 2646, 18151, 24927, 217225, 11809, 75358, 67, 71713, 214, 2729, 3285, 84068, 1019, 237, 335, 26943, 26455, 18770, 14256, 11728, 297, 345, 151399, 82419, 161063,...	[ 0.0478515625, 0.00726318359375, 0.1246337890625, 0.220458984375, 0.208251953125, 0.2330322265625, 0.08721923828125, 0.024383544921875, 0.06695556640625, 0.072265625, 0.200927734375, 0.09490966796875, 0.09796142578125, 0.24755859375, 0.020538330078125, 0.0819091796875, 0.2469482421875...	embed
31641464_c1	31641464	haskell	1	0 overflowed, 0 dud, 0 GC'd, 0 fizzled) . I believe the much greater memory use is because parListChunk forces the spine of the list. Then I tried to write my own strategy that lazily divided the list into chunks and then passed the chunks to parBuffer and concatenated the results. concat $ withStrategy (parBuffer 40 r...	0 overflowed, 0 dud, 0 GC'd, 0 fizzled) . I believe the much greater memory use is because parListChunk forces the spine of the list. Then I tried to write my own strategy that lazily divided the list into chunks and then passed the chunks to parBuffer and concatenated the results. concat $ withStrategy (parBuffer 40 r...	[ -0.005950927734375, 0.0098876953125, -0.01422119140625, 0.0002498626708984375, -0.00457763671875, 0.005096435546875, -0.005950927734375, -0.01129150390625, 0.015869140625, -0.009521484375, -0.0064697265625, 0.007171630859375, 0.033935546875, 0.0096435546875, 0.003265380859375, -0.01361...	[ 757, 645, 118664, 297, 115, 71, 69657, 17148, 169, 6259, 18822, 5045, 117396, 98323, 4527, 366, 154663, 15982, 3678, 84616, 25927, 5303, 37842, 33022, 10002, 113857, 21, 708, 101637, 3934, 7839, 7235, 18234, 158, 4460, 50339, 3650, 678, 973...	[ 0.09515380859375, 0.13232421875, 0.253173828125, 0.06341552734375, 0.08740234375, 0.000579833984375, 0.0207366943359375, 0.04266357421875, 0.0154876708984375, 0.0202789306640625, 0.03997802734375, 0.100341796875, 0.1334228515625, 0.2108154296875, 0.1746826171875, 0.1614990234375, 0.1...	embed
12571205_c0	12571205	haskell	0	Title: How to build and use a bootstrap executable in a Cabal package Problem title: How to build and use a bootstrap executable in a Cabal package Tags: cabal, haskell Problem: How to build and use a bootstrap executable in a Cabal package I would like to Cabalize a Haskell project in order to upload it to Hackage. It...	How to build and use a bootstrap executable in a Cabal package How to build and use a bootstrap executable in a Cabal package cabal haskell How Cabal How to build and use a bootstrap executable in a Cabal package I would like to Cabalize a Haskell project in order to upload it to Hackage. It consists of one standard .h...	[ 0.01019287109375, 0.00043487548828125, 0.0091552734375, -0.01171875, -0.0078125, 0.0029296875, 0.0133056640625, 0.004608154296875, -0.00142669677734375, 0.00130462646484375, 0.0074462890625, -0.0130615234375, -0.00885009765625, 0.00811767578125, -0.000591278076171875, 0.015380859375, ...	[ 11249, 45367, 136, 4527, 49935, 7, 107617, 71924, 2886, 30438, 289, 98169, 23, 109524, 1556, 142508, 1884, 11, 119066, 20625, 13452, 70622, 52922, 4588, 58055, 1632, 5570, 127, 11435, 136659, 351, 66589, 79366, 102158, 9433, 36049, 114122, 80...	[ 0.0802001953125, 0.1988525390625, 0.0799560546875, 0.1580810546875, 0.1678466796875, 0.0650634765625, 0.26513671875, 0.19775390625, 0.1746826171875, 0.198486328125, 0.174560546875, 0.1903076171875, 0.04144287109375, 0.2281494140625, 0.1307373046875, 0.2369384765625, 0.028594970703125...	embed
35500358_c0	35500358	haskell	0	Title: Haskell: dealing with ambiguous imports Problem title: Haskell: dealing with ambiguous imports Tags: haskell, import Problem: Haskell: dealing with ambiguous imports I'm getting ambiguity warnings, sometimes errors, all the time. This is just a clear cut example. I'm using doctest: $ stack exec doctest -- src/Ma...	Haskell: dealing with ambiguous imports Haskell: dealing with ambiguous imports haskell import Turtle Prelude System.IO Text.Regex.TDFA Haskell Main.hs Ambiguous Turtle.stdout Main.hs:6:1-13 Turtle.Prelude System.IO.stdout GHC.IO.Handle.FD Examples Tried Errors Failures FilePath Haskell: dealing with ambiguous imports ...	[ -0.0101318359375, -0.0016326904296875, 0.00677490234375, 0.0228271484375, -0.0028533935546875, -0.019775390625, 0.0169677734375, 0.006011962890625, -0.0019378662109375, 0.0145263671875, -0.004974365234375, -0.0166015625, 0.006072998046875, 0.01513671875, 0.0047607421875, 0.011962890625...	[ 20625, 142508, 184017, 678, 920, 12282, 10821, 24927, 1556, 4252, 17991, 1914, 822, 112, 12353, 17780, 24129, 54601, 3355, 14676, 12321, 127, 10250, 1003, 910, 19721, 22820, 19273, 73265, 135679, 98553, 89536, 4699, 212059, 190355, 42724, 683, ...	[ 0.1256103515625, 0.221923828125, 0.1224365234375, 0.0794677734375, 0.1805419921875, 0.2318115234375, 0.10589599609375, 0.243408203125, 0.09515380859375, 0.1151123046875, 0.167236328125, 0.057708740234375, 0.1268310546875, 0.055633544921875, 0.10028076171875, 0.10748291015625, 0.08508...	embed
24530156_c0	24530156	haskell	0	Title: Memoising a function over Unboxed Vectors causes it to hang Problem title: Memoising a function over Unboxed Vectors causes it to hang Tags: haskell Problem: Memoising a function over Unboxed Vectors causes it to hang I'm playing with Vectors and Unboxed Vectors, with a fairly simple program. I'm enumerating all...	Memoising a function over Unboxed Vectors causes it to hang Memoising a function over Unboxed Vectors causes it to hang haskell Data.Vector.Unboxed Memoising Unboxed Vectors Data.Vector UV.Vector Bool UV.map n2r n2q n3r n3q n5r n5q Memoising a function over Unboxed Vectors causes it to hang I'm playing with Vectors and...	[ -0.00946044921875, -0.0025482177734375, 0.0152587890625, -0.01531982421875, 0.0031890869140625, -0.0179443359375, 0.01336669921875, -0.00958251953125, 0.006134033203125, -0.0162353515625, 0.0118408203125, -0.00885009765625, 0.036376953125, 0.0093994140625, 0.01416015625, -0.00842285156...	[ 17443, 31, 72219, 32354, 645, 992, 11728, 297, 52884, 22230, 113660, 47, 10756, 1556, 142508, 11809, 26455, 18770, 14256, 31812, 2460, 929, 62346, 864, 758, 75169, 8781, 1528, 189085, 1916, 756, 892, 26255, 4734, 120103, 79359, 619, 1892, 1...	[ 0.1627197265625, 0.1197509765625, 0.101318359375, 0.192138671875, 0.1318359375, 0.10540771484375, 0.2012939453125, 0.0496826171875, 0.2005615234375, 0.1685791015625, 0.0777587890625, 0.06585693359375, 0.2431640625, 0.127197265625, 0.2457275390625, 0.1031494140625, 0.171875, 0.16687...	embed
29191484_c0	29191484	haskell	0	Title: Breakpoints in the argument-passing scheme of OCaml Problem title: Breakpoints in the argument-passing scheme of OCaml Tags: ocaml-core, haskell, ocaml Problem: Breakpoints in the argument-passing scheme of OCaml Today, I was going through the source code of Jane Street 's Core_kernel module and I came across th...	Breakpoints in the argument-passing scheme of OCaml Breakpoints in the argument-passing scheme of OCaml ocaml-core haskell ocaml Breakpoints OCaml Core_kernel Breakpoints in the argument-passing scheme of OCaml Today, I was going through the source code of Jane Street 's Core_kernel module and I came across the compose...	[ 0.0101318359375, 0.00860595703125, 0.000926971435546875, 0.0185546875, -0.00823974609375, 0.0040283203125, -0.0159912109375, -0.00830078125, -0.0137939453125, -0.01519775390625, 0.00567626953125, -0.0037384033203125, -0.008056640625, 0.01446533203125, 0.01483154296875, -0.0103149414062...	[ 131904, 38496, 10750, 13409, 150370, 180, 105272, 141, 36, 9779, 30854, 1556, 142508, 31365, 72083, 31344, 18151, 48511, 15130, 88996, 36880, 150350, 32354, 2806, 765, 61924, 237, 31635, 8337, 13204, 3917, 6777, 83, 51776, 1238, 136, 706, 306...	[ 0.2000732421875, 0.238037109375, 0.22216796875, 0.1341552734375, 0.1640625, 0.0904541015625, 0.1787109375, 0.1500244140625, 0.047576904296875, 0.11767578125, 0.095703125, 0.0726318359375, 0.207763671875, 0.1236572265625, 0.134033203125, 0.05902099609375, 0.0268402099609375, 0.15576...	embed
11313588_c0	11313588	haskell	0	Title: Maybe monad bind function precedence Problem title: Maybe monad bind function precedence Tags: monads, haskell, option-type Problem: Maybe monad bind function precedence In this tutorial I've found the following snippet: deposit :: (Num a) => a -> a -> Maybe a deposit value account = Just (account + value) withd...	Maybe monad bind function precedence Maybe monad bind function precedence monads haskell option-type Maybe Num Just Ord Nothing Bool Maybe monad bind function precedence In this tutorial I've found the following snippet: I can't figure out how the >>= function is supposed to work. At first it takes a Maybe a value as i...	[ -0.0118408203125, -0.005706787109375, 0.01470947265625, 0.013427734375, 0.01708984375, 0.03076171875, 0.0091552734375, -0.0069580078125, 0.0137939453125, -0.0096435546875, 0.0062255859375, -0.00168609619140625, -0.0123291015625, -0.004669189453125, 0.0172119140625, -0.00050735473632812...	[ 83425, 2667, 712, 68557, 32354, 107671, 6620, 1556, 142508, 35829, 50986, 52782, 9563, 35379, 182747, 2460, 929, 57143, 831, 26366, 3642, 70, 6396, 1369, 83, 134598, 4488, 5117, 51776, 34292, 237, 171859, 40370, 805, 15426, 19364, 37202, 5646...	[ 0.30126953125, 0.153564453125, 0.172119140625, 0.24365234375, 0.21533203125, 0.1915283203125, 0.116943359375, 0.115234375, 0.238525390625, 0.1995849609375, 0.091552734375, 0.1654052734375, 0.0894775390625, 0.169677734375, 0.1531982421875, 0.0830078125, 0.1324462890625, 0.0948486328...	embed
11597246_c0	11597246	haskell	0	Title: Which KeyBoard / KeyBoard Layout will be most suitable for haskell programming? Does haskell has all Math Symbols as functions? Problem title: Which KeyBoard / KeyBoard Layout will be most suitable for haskell programming? Does haskell has all Math Symbols as functions? Tags: unicode, symbols, keyboard, haskell,...	Which KeyBoard / KeyBoard Layout will be most suitable for haskell programming? Does haskell has all Math Symbols as functions? Which KeyBoard / KeyBoard Layout will be most suitable for haskell programming? Does haskell has all Math Symbols as functions? unicode symbols keyboard haskell emacs Which KeyBoard Layout Doe...	[ 0.003997802734375, 0.006805419921875, -0.001678466796875, -0.0216064453125, -0.0029754638671875, -0.01361083984375, 0.0048828125, 0.017333984375, 0.00421142578125, 0.0093994140625, 0.00848388671875, -0.04052734375, 0.0242919921875, -0.01953125, -0.0152587890625, 0.00506591796875, -0....	[ 130078, 26824, 12647, 5861, 248, 211032, 2684, 202319, 1556, 142508, 56037, 101790, 756, 78804, 131899, 32354, 60347, 112, 26582, 149186, 352, 2263, 100, 89931, 9842, 16454, 57143, 27781, 121413, 18151, 21656, 23962, 39210, 66211, 11417, 10644, ...	[ 0.03955078125, 0.111083984375, 0.1617431640625, 0.1282958984375, 0.005828857421875, 0.2042236328125, 0.10498046875, 0.158447265625, 0.1141357421875, 0.22705078125, 0.105712890625, 0.0572509765625, 0.0848388671875, 0.1929931640625, 0.2158203125, 0.1563720703125, 0.107421875, 0.11022...	embed
12129300_c0	12129300	haskell	0	Title: How to navigate up inside a HUET Zipper Problem title: How to navigate up inside a HUET Zipper Tags: functional-programming, zipper, scala, ocaml, haskell Problem: How to navigate up inside a HUET Zipper I'm reading Huet Zipper , I cannot understand the go_up method: let go_up (Loc(t,p)) = match p with Top -> fa...	How to navigate up inside a HUET Zipper How to navigate up inside a HUET Zipper functional-programming zipper scala ocaml haskell How HUET Zipper go_up Loc Top Node Section t::right Location Path Context How to navigate up inside a HUET Zipper I'm reading Huet Zipper , I cannot understand the go_up method: The full sou...	[ -0.0020294189453125, 0.0341796875, 0.002960205078125, 0.0021209716796875, -0.01953125, 0.00102996826171875, -0.0011138916015625, -0.01092529296875, 0.004302978515625, -0.05712890625, -0.01300048828125, -0.0004329681396484375, 0.00921630859375, 0.007080078125, 0.00848388671875, -0.01708...	[ 11249, 56136, 67, 1257, 46132, 22438, 23385, 9315, 8079, 47, 10, 123309, 28966, 3546, 146232, 36, 9779, 141, 1556, 142508, 738, 454, 2037, 88784, 4792, 438, 112, 140978, 54969, 90788, 108421, 1657, 22829, 16454, 7674, 126, 53418, 28219, 553...	[ 0.0648193359375, 0.2384033203125, 0.110595703125, 0.193115234375, 0.21533203125, 0.176025390625, 0.205322265625, 0.1900634765625, 0.240478515625, 0.003326416015625, 0.022247314453125, 0.1502685546875, 0.10211181640625, 0.1572265625, 0.1448974609375, 0.005523681640625, 0.0684204101562...	embed
23967523_c0	23967523	haskell	0	Title: Outer Joins with Esqueleto Problem title: Outer Joins with Esqueleto Tags: haskell, esqueleto Problem: Outer Joins with Esqueleto I am a bit confused about how outer joins work with esqueleto. I have created the following query (simplified): select $ from $ \(rep `LeftOuterJoin` event) -> do on (rep ^. RepAtomId...	Outer Joins with Esqueleto Outer Joins with Esqueleto haskell esqueleto $ Outer Joins Esqueleto LeftOuterJoin RepAtomId EventAtomId where_ EventSeconds Just Outer Joins with Esqueleto I am a bit confused about how outer joins work with esqueleto. I have created the following query (simplified): As far as I know, on the...	[ 0.01171875, 0.00927734375, 0.0086669921875, 0.005859375, -0.000751495361328125, -0.00390625, -0.00518798828125, 0.00006532669067382812, -0.00170135498046875, -0.017333984375, -0.023193359375, 0.009033203125, -0.01422119140625, 0.006011962890625, -0.005401611328125, 0.00075531005859375,...	[ 13538, 56, 113053, 7, 678, 1184, 37631, 31580, 1556, 142508, 66660, 133, 188, 3650, 636, 2480, 79858, 16604, 33742, 12078, 36943, 71, 4233, 2271, 4785, 55681, 1810, 33284, 4488, 75935, 25632, 41, 1294, 116120, 80866, 8752, 33938, 100, 10958...	[ 0.1978759765625, 0.2109375, 0.26171875, 0.0941162109375, 0.109619140625, 0.057281494140625, 0.168701171875, 0.1978759765625, 0.07958984375, 0.2186279296875, 0.14208984375, 0.1632080078125, 0.1888427734375, 0.07080078125, 0.002685546875, 0.0836181640625, 0.16064453125, 0.14819335937...	embed
41187976_c1	41187976	haskell	1	:: Double, charge :: Double, velocity :: Velocity} deriving (Eq, Show, Read) --utils toScalar :: Vector -> Double toScalar (x, y, z) = sqrt (x ^^ 2 + y ^^ 2 + z ^^ 2) toUnit :: Vector -> Vector toUnit (x, y, z) = (x / scalar, y / scalar, z / scalar) where scalar = toScalar (x, y, z) add :: Vector -> Vector -> Vector a...	:: Double, charge :: Double, velocity :: Velocity} deriving (Eq, Show, Read) --utils toScalar :: Vector -> Double toScalar (x, y, z) = sqrt (x ^^ 2 + y ^^ 2 + z ^^ 2) toUnit :: Vector -> Vector toUnit (x, y, z) = (x / scalar, y / scalar, z / scalar) where scalar = toScalar (x, y, z) add :: Vector -> Vector -> Vector a...	[ -0.005645751953125, 0.0179443359375, -0.005767822265625, -0.009521484375, 0.01055908203125, -0.01422119140625, -0.01806640625, -0.0172119140625, 0.01556396484375, -0.01220703125, 0.0034637451171875, -0.01123046875, 0.000492095947265625, -0.0262451171875, -0.027587890625, -0.00230407714...	[ 1984, 107172, 4, 25534, 191060, 939, 139993, 60089, 8152, 16406, 6496, 864, 17367, 4764, 4210, 1003, 7870, 47, 294, 408, 320, 2609, 18770, 33079, 425, 113, 97, 2203, 3198, 16377, 116, 997, 4958, 85600, 248, 146232, 42, 15190, 10461, 3869,...	[ 0.1226806640625, 0.239990234375, 0.0755615234375, 0.258056640625, 0.2266845703125, 0.1239013671875, 0.2060546875, 0.1280517578125, 0.04876708984375, 0.188232421875, 0.193115234375, 0.149169921875, 0.1839599609375, 0.1993408203125, 0.0755615234375, 0.16015625, 0.1630859375, 0.229125...	embed
27247348_c1	27247348	haskell	1	skipSpace <* string "endfacet" vertexPoint = coordinates "vertex" Point {-# INLINE facet #-} rawFacets :: Fractional a => Parser [RawFacet a] rawFacets = beginSolid > many' facet < endSolid where solidName = option "default" (skipWhile isHorizontalSpace *> fmap T.pack (many1 $ satisfy isAlphaNum) ) beginSolid = skip...	skipSpace <* string "endfacet" vertexPoint = coordinates "vertex" Point {-# INLINE facet #-} rawFacets :: Fractional a => Parser [RawFacet a] rawFacets = beginSolid > many' facet < endSolid where solidName = option "default" (skipWhile isHorizontalSpace *> fmap T.pack (many1 $ satisfy isAlphaNum) ) beginSolid = skip...	[ 0.021728515625, -0.0196533203125, -0.01300048828125, 0.0263671875, 0.0108642578125, -0.00193023681640625, 0.01141357421875, -0.0177001953125, -0.005889892578125, -0.021240234375, 0.01055908203125, -0.01409912109375, -0.015380859375, -0.005126953125, -0.0101318359375, 0.0111083984375, ...	[ 21658, 141012, 79315, 3611, 40404, 18, 493, 24371, 147534, 176866, 814, 41097, 5881, 57339, 2577, 49649, 135518, 7831, 7868, 10763, 289, 10, 2392, 2189, 12248, 434, 126, 9842, 102588, 532, 5941, 3564, 18652, 163612, 35829, 214810, 44024, 83, ...	[ 0.227294921875, 0.255615234375, 0.215087890625, 0.0897216796875, 0.17333984375, 0.0496826171875, 0.0777587890625, 0.1138916015625, 0.1427001953125, 0.1317138671875, 0.03466796875, 0.12353515625, 0.02777099609375, 0.13525390625, 0.1761474609375, 0.169921875, 0.194091796875, 0.146362...	embed
56859326_c0	56859326	haskell	0	Title: Haskell function signature confusion Problem title: Haskell function signature confusion Tags: haskell Problem: Haskell function signature confusion I'm trying to learn Haskell, but I'm stumped on something. So far, I've come to understand that functions signatures conform to this convention: <name> :: <type con...	Haskell function signature confusion Haskell function signature confusion haskell Haskell Returns add2 adds2 Hello RandomGen Gene Rand Haskell function signature confusion I'm trying to learn Haskell, but I'm stumped on something. So far, I've come to understand that functions signatures conform to this convention: So,...	[ 0.0174560546875, -0.001617431640625, -0.0166015625, 0.006561279296875, -0.00109100341796875, 0.0152587890625, -0.004119873046875, -0.00701904296875, 0.009521484375, -0.014404296875, 0.003936767578125, -0.0400390625, -0.00982666015625, 0.0001392364501953125, -0.003662109375, 0.003585815...	[ 20625, 142508, 32354, 138256, 169463, 1556, 173340, 15190, 304, 35378, 39643, 306, 105376, 46980, 30698, 48708, 20051, 28219, 7, 19911, 47, 101805, 27781, 100094, 9351, 83, 29968, 10644, 158, 2816, 706, 8110, 51776, 237, 107730, 6626, 142424, ...	[ 0.1390380859375, 0.2232666015625, 0.21728515625, 0.2275390625, 0.1973876953125, 0.10528564453125, 0.2403564453125, 0.1556396484375, 0.135498046875, 0.050323486328125, 0.1365966796875, 0.086181640625, 0.1544189453125, 0.1943359375, 0.016693115234375, 0.05694580078125, 0.0577392578125,...	embed
49796017_c1	49796017	haskell	1	= (f)(x+1); } return out; } double sumpointer(double* pptr){ double x=0; for(unsigned i=0; i<2; i++){ for(unsigned j=0; j<2; j++){ x += pptr[i][j]; } } return x; } main module of the library, Lib.hs {-# LANGUAGE ForeignFunctionInterface #-} module Lib where import Foreign.C.Types import Foreign.Ptr (Ptr, FunPtr, fre...	= (f)(x+1); } return out; } double sumpointer(double* pptr){ double x=0; for(unsigned i=0; i<2; i++){ for(unsigned j=0; j<2; j++){ x += pptr[i][j]; } } return x; } main module of the library, Lib.hs {-# LANGUAGE ForeignFunctionInterface #-} module Lib where import Foreign.C.Types import Foreign.Ptr (Ptr, FunPtr, fre...	[ 0.0306396484375, 0.01611328125, -0.00579833984375, -0.00823974609375, 0.002044677734375, -0.005706787109375, -0.00860595703125, -0.002655029296875, 0.0101318359375, -0.0272216796875, -0.00933837890625, -0.00970458984375, -0.00592041015625, -0.008544921875, -0.009521484375, -0.016967773...	[ 2203, 75402, 420, 51421, 425, 21748, 30646, 1810, 41929, 10554, 38496, 56, 21555, 2661, 25442, 32261, 4448, 1022, 145407, 100, 31304, 17, 304, 37223, 1647, 997, 14, 170, 74, 5201, 88996, 35773, 43278, 5, 127, 7, 3358, 98064, 75930, 184293...	[ 0.135498046875, 0.0238494873046875, 0.1380615234375, 0.06219482421875, 0.06634521484375, 0.190673828125, 0.1876220703125, 0.11083984375, 0.177001953125, 0.1661376953125, 0.2705078125, 0.1180419921875, 0.09051513671875, 0.132080078125, 0.0243988037109375, 0.09417724609375, 0.203002929...	embed
51347227_c1	51347227	haskell	1	Wreq\Internal\Lens.hs, dist\build\Network\Wreq\Internal\Lens.o ) ghc.exe: unable to load package `network-2.7.0.2' ghc.exe: \| C:\Users\Roman\AppData\Roaming\cabal\x86_64-windows-ghc-8.4.3\network-2.7.0.2-HRKpEmrZF0Z7oBCs9x5PCR\HSnetwork-2.7.0.2-HRKpEmrZF0Z7oBCs9x5PCR.o: unknown symbol `acceptNewSock' cabal: Leaving dir...	Wreq\Internal\Lens.hs, dist\build\Network\Wreq\Internal\Lens.o ) ghc.exe: unable to load package `network-2.7.0.2' ghc.exe: \| C:\Users\Roman\AppData\Roaming\cabal\x86_64-windows-ghc-8.4.3\network-2.7.0.2-HRKpEmrZF0Z7oBCs9x5PCR\HSnetwork-2.7.0.2-HRKpEmrZF0Z7oBCs9x5PCR.o: unknown symbol `acceptNewSock' cabal: Leaving dir...	[ -0.003875732421875, 0.01068115234375, 0.00506591796875, -0.00958251953125, -0.003448486328125, 0.006683349609375, -0.02099609375, -0.001983642578125, -0.0128173828125, -0.00494384765625, 0.007659912109375, -0.0054931640625, -0.000324249267578125, -0.018798828125, 0.0118408203125, 0.003...	[ 601, 107, 864, 44851, 6236, 866, 1755, 127, 7, 45, 271, 177149, 24447, 18244, 1456, 31, 31380, 238, 46480, 51, 2886, 72367, 98169, 1179, 5428, 53489, 133684, 1062, 158271, 39179, 137989, 12724, 302, 408, 3571, 15276, 13307, 229792, 9486, ...	[ 0.081298828125, 0.26123046875, 0.1820068359375, 0.12451171875, 0.151611328125, 0.14794921875, 0.19580078125, 0.1044921875, 0.029754638671875, 0.01513671875, 0.04302978515625, 0.156494140625, 0.045135498046875, 0.1416015625, 0.083251953125, 0.1458740234375, 0.173095703125, 0.1424560...	embed
47149996_c0	47149996	haskell	0	Title: ghc.exe: internal error: mkPath failed converting char* to wchar_t* Problem title: ghc.exe: internal error: mkPath failed converting char* to wchar_t* Tags: windows-10, ghc, haskell Problem: ghc.exe: internal error: mkPath failed converting char* to wchar_t* today I followed the Haskel Platform website download ...	ghc.exe: internal error: mkPath failed converting char* to wchar_t* ghc.exe: internal error: mkPath failed converting char* to wchar_t* windows-10 ghc haskell ghc.exe wchar_t GHCi www.haskell.org GHC x86_64_unknown_mingw32 Please Runtime windows-10 ghc.exe: internal error: mkPath failed converting char* to wchar_t* tod...	[ 0.0238037109375, 0.01397705078125, -0.00830078125, 0.00070953369140625, -0.0037384033203125, 0.01025390625, -0.014892578125, -0.028076171875, -0.0291748046875, 0.0012664794921875, -0.002838134765625, -0.02197265625, 0.009033203125, 0.0098876953125, 0.00836181640625, 0.002960205078125, ...	[ 31380, 238, 46480, 70796, 18499, 19201, 683, 10519, 165523, 96760, 21441, 1639, 47, 148, 9254, 454, 18, 54825, 9193, 1556, 142508, 527, 73265, 14, 10557, 1478, 15276, 13307, 69723, 14578, 434, 6460, 28398, 18925, 134629, 20625, 2590, 70968, ...	[ 0.1719970703125, 0.158935546875, 0.17822265625, 0.1939697265625, 0.130126953125, 0.134765625, 0.1451416015625, 0.1990966796875, 0.17236328125, 0.127685546875, 0.18115234375, 0.150146484375, 0.0540771484375, 0.1199951171875, 0.1685791015625, 0.02093505859375, 0.1168212890625, 0.0818...	embed
31261905_c0	31261905	haskell	0	Title: Alternative IO error for <\|> Problem title: Alternative IO error for <\|> Tags: io-monad, haskell, alternative-functor Problem: Alternative IO error for <\|> I am using the operator <\|> for: import qualified Data.ByteString.Lazy as B import Network.HTTP.Conduit (simpleHttp) import Data.Aeson import Dat...	Alternative IO error for <\|> Alternative IO error for <\|> io-monad haskell alternative-functor qualified Network.HTTP.Conduit Data.Aeson Data.Maybe a Alternative Data.ByteString.Lazy FooBar Text Show Generic FromJSON ToJSON B.readFile Alternative IO error for <\|> I am using the operator <\|> for: But when I ...	[ 0.00457763671875, 0.01324462890625, 0.00022125244140625, 0.01214599609375, 0.000621795654296875, 0.00164031982421875, -0.0269775390625, 0.0021514892578125, -0.01165771484375, -0.013671875, 0.004425048828125, -0.011962890625, 0.03076171875, -0.0020599365234375, 0.0123291015625, -0.02319...	[ 103905, 17780, 18499, 100, 1277, 5386, 22995, 3796, 712, 1556, 142508, 30700, 16498, 18770, 217225, 28997, 23658, 112061, 11809, 90, 191, 82419, 71713, 2729, 3285, 9572, 31, 25267, 24129, 17367, 88342, 1771, 28090, 1375, 58627, 717, 335, 3911...	[ 0.2392578125, 0.2413330078125, 0.21044921875, 0.08758544921875, 0.001068115234375, 0.0245819091796875, 0.2249755859375, 0.0662841796875, 0.10736083984375, 0.1087646484375, 0.2125244140625, 0.20263671875, 0.08074951171875, 0.10406494140625, 0.12646484375, 0.08544921875, 0.027175903320...	embed
18723381_c0	18723381	haskell	0	Title: Rounding to specific number of digits in Haskell Problem title: Rounding to specific number of digits in Haskell Tags: math, haskell Problem: Rounding to specific number of digits in Haskell I am trying to make a function to round a floating point number to a defined length of digits. What I have come up with so...	Rounding to specific number of digits in Haskell Rounding to specific number of digits in Haskell math haskell Numeric Rounding Haskell Integral Rounding to specific number of digits in Haskell I am trying to make a function to round a floating point number to a defined length of digits. What I have come up with so far...	[ -0.01123046875, 0.0015869140625, -0.0019378662109375, -0.002655029296875, -0.006622314453125, -0.00122833251953125, -0.00604248046875, 0.00836181640625, 0.0050048828125, -0.01483154296875, -0.0174560546875, 0.00093841552734375, -0.00885009765625, 0.0115966796875, 0.00872802734375, -0.0...	[ 162856, 214, 47, 29458, 14012, 111, 153939, 7, 23, 20625, 142508, 48909, 1556, 93511, 204681, 31577, 3249, 32354, 68807, 21917, 26518, 6275, 61924, 71, 140909, 1257, 2060, 903, 17368, 1466, 83324, 70, 8108, 96117, 15572, 20650, 107730, 34292,...	[ 0.23388671875, 0.103271484375, 0.1558837890625, 0.2208251953125, 0.182373046875, 0.0250701904296875, 0.2181396484375, 0.13427734375, 0.04766845703125, 0.1700439453125, 0.268310546875, 0.09716796875, 0.1414794921875, 0.09100341796875, 0.167236328125, 0.056610107421875, 0.00830078125, ...	embed
76486142_c0	76486142	haskell	0	Title: How to efficiently enumerate binary black-white trees, while accounting for symmetry? Problem title: How to efficiently enumerate binary black-white trees, while accounting for symmetry? Tags: haskell, algorithm, enumeration Problem: How to efficiently enumerate binary black-white trees, while accounting for sym...	How to efficiently enumerate binary black-white trees, while accounting for symmetry? How to efficiently enumerate binary black-white trees, while accounting for symmetry? haskell algorithm enumeration How Black White Leaf Nat How to efficiently enumerate binary black-white trees, while accounting for symmetry? Conside...	[ 0.011962890625, -0.00116729736328125, -0.004730224609375, -0.005584716796875, 0.0272216796875, -0.006103515625, -0.0157470703125, -0.007568359375, 0.0016326904296875, -0.01318359375, -0.027099609375, 0.01239013671875, 0.031494140625, 0.01458740234375, -0.0059814453125, -0.005615234375,...	[ 11249, 93766, 189085, 67, 2394, 6635, 22556, 9, 148477, 1360, 90, 15426, 954, 3019, 15123, 538, 1556, 142508, 234873, 10074, 22392, 636, 2407, 68875, 12960, 10644, 25632, 224743, 41911, 173473, 757, 4879, 8439, 136, 97732, 4958, 183234, 60892...	[ 0.067626953125, 0.186279296875, 0.24169921875, 0.09100341796875, 0.1734619140625, 0.0787353515625, 0.1634521484375, 0.05780029296875, 0.201171875, 0.206787109375, 0.0926513671875, 0.13818359375, 0.08074951171875, 0.1790771484375, 0.10076904296875, 0.009552001953125, 0.083740234375, ...	embed
69374974_c0	69374974	haskell	0	Title: transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2.* Problem title: transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2.* Tags: haskell, haskell-stack, cabal Problem: transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2...	transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2.* transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2.* haskell haskell-stack cabal stack transformers-0.5.6.2 QuickCheck quickcheck-instances-0.3.25.2 sha256:083b84b91fccb3bbf22cd906f5bc731c8e6ee96...	[ -0.00113677978515625, 0.003997802734375, 0.0162353515625, -0.01434326171875, 0.02001953125, -0.013916015625, -0.01068115234375, 0.000041484832763671875, 0.01708984375, 0.0341796875, 0.0145263671875, 0.006866455078125, 0.017578125, -0.0027008056640625, 0.01806640625, -0.005279541015625,...	[ 27198, 1314, 93645, 5, 178121, 1295, 177261, 180346, 14602, 959, 14858, 5386, 170179, 25133, 69112, 133684, 1639, 9, 1556, 142508, 590, 2594, 109524, 89038, 202567, 63773, 78292, 116071, 23320, 107033, 158296, 9638, 127892, 127, 2886, 81046, 13...	[ 0.2568359375, 0.197509765625, 0.2078857421875, 0.007781982421875, 0.246826171875, 0.08123779296875, 0.1988525390625, 0.238525390625, 0.03204345703125, 0.141357421875, 0.2213134765625, 0.0404052734375, 0.19580078125, 0.0208282470703125, 0.06146240234375, 0.1829833984375, 0.01579284667...	embed
57127726_c0	57127726	haskell	0	Title: How to make code look elegant in Haskell? Problem title: How to make code look elegant in Haskell? Tags: haskell Problem: How to make code look elegant in Haskell? I am new to Haskell, I have read blogs on how Haskell code is very elegant. The way I am writing Haskell code, it does not look elegant at all. Some ...	How to make code look elegant in Haskell? How to make code look elegant in Haskell? haskell How Haskell Right Left Log Error URI.mkPathPiece T.pack Just Data.List.NonEmpty.fromList How to make code look elegant in Haskell? I am new to Haskell, I have read blogs on how Haskell code is very elegant. The way I am writing ...	[ -0.01318359375, -0.0010528564453125, 0.017333984375, -0.0047607421875, 0.00116729736328125, 0.0234375, -0.00927734375, -0.024169921875, 0.00677490234375, -0.0189208984375, 0.01116943359375, -0.025146484375, 0.004180908203125, -0.004852294921875, -0.00567626953125, -0.002716064453125, ...	[ 11249, 3249, 18151, 6713, 27650, 23, 20625, 142508, 47, 1556, 90911, 636, 2480, 13146, 212059, 46492, 19201, 683, 10519, 111242, 384, 29102, 9563, 11809, 154663, 59881, 134332, 939, 161063, 3525, 50684, 4552, 3917, 32562, 959, 756, 58555, 344...	[ 0.0921630859375, 0.10107421875, 0.267333984375, 0.207763671875, 0.285400390625, 0.07861328125, 0.1610107421875, 0.273681640625, 0.029083251953125, 0.13427734375, 0.142822265625, 0.06427001953125, 0.1370849609375, 0.16259765625, 0.1790771484375, 0.1337890625, 0.06817626953125, 0.058...	embed
36398709_c0	36398709	haskell	0	Title: zipWith for trees in Haskell Problem title: zipWith for trees in Haskell Tags: haskell, binary-tree Problem: zipWith for trees in Haskell I am learning Haskell using The Haskell School of Expression: Learning Functional Programming through Multimedia and I am unsure how to go about solving this exercise. Using t...	zipWith for trees in Haskell zipWith for trees in Haskell haskell binary-tree Haskell Tree Node Leaf Problems x:xs y:ys zipWith for trees in Haskell I am learning Haskell using The Haskell School of Expression: Learning Functional Programming through Multimedia and I am unsure how to go about solving this exercise. For...	[ 0.01324462890625, 0.01129150390625, -0.01123046875, -0.00433349609375, 0.01019287109375, 0.008056640625, -0.029541015625, -0.027099609375, -0.000888824462890625, -0.03271484375, -0.01397705078125, -0.0024261474609375, -0.005096435546875, 0.0145263671875, 0.00933837890625, 0.01232910156...	[ 68330, 194583, 100, 1360, 90, 20625, 142508, 23, 1556, 2394, 6635, 62600, 101344, 438, 112, 2407, 15649, 425, 113, 4778, 52080, 19188, 25129, 114344, 28670, 27958, 188516, 51646, 3115, 81979, 1018, 71216, 39908, 123309, 27650, 80934 ]	[ 0.2437744140625, 0.288818359375, 0.0687255859375, 0.1873779296875, 0.05438232421875, 0.135009765625, 0.1700439453125, 0.0059814453125, 0.1109619140625, 0.1119384765625, 0.01141357421875, 0.1572265625, 0.1417236328125, 0.06640625, 0.03375244140625, 0.0789794921875, 0.146484375, 0.01...	embed
23543936_c1	23543936	haskell	1	); std::cout << "Test application" << std::endl; std::cin.get(); hs_exit(); return 0; } After compilation, this code works very well. If I build same Haskell code (grep.hs) with using Cabal build system: name: grep version: 1.0 synopsis: example shared library for C use build-type: Simple cabal-version: >=1.10 library ...	); std::cout << "Test application" << std::endl; std::cin.get(); hs_exit(); return 0; } After compilation, this code works very well. If I build same Haskell code (grep.hs) with using Cabal build system: name: grep version: 1.0 synopsis: example shared library for C use build-type: Simple cabal-version: >=1.10 library ...	[ 0.00167083740234375, -0.0019683837890625, -0.004302978515625, 0.00909423828125, -0.010009765625, 0.0021820068359375, -0.01123046875, 0.0084228515625, 0.00439453125, -0.0091552734375, 0.004852294921875, -0.01019287109375, 0.00131988525390625, 0.0093994140625, 0.0101318359375, 0.00933837...	[ 3142, 6138, 71, 12600, 18, 111337, 38415, 3611, 141, 6333, 3794, 1096, 7, 13, 23399, 757, 98352, 903, 18151, 43240, 4552, 5299, 45367, 5701, 20625, 142508, 7134, 254, 127, 30438, 289, 5426, 3514, 11389, 53855, 27781, 99764, 35773, 313, 50...	[ 0.018218994140625, 0.1558837890625, 0.0897216796875, 0.11279296875, 0.0989990234375, 0.2225341796875, 0.16748046875, 0.04376220703125, 0.0275726318359375, 0.05712890625, 0.0557861328125, 0.0760498046875, 0.049407958984375, 0.044708251953125, 0.174560546875, 0.054656982421875, 0.10742...	embed
26508740_c0	26508740	haskell	0	Title: Removing n number of elements from a list Problem title: Removing n number of elements from a list Tags: haskell Problem: Removing n number of elements from a list One of my modules this year is Haskell programming. I'm having trouble expressing complexity in such a simple manner, especially coming from other la...	Removing n number of elements from a list Removing n number of elements from a list haskell a Removing x-1 Removing n number of elements from a list One of my modules this year is Haskell programming. I'm having trouble expressing complexity in such a simple manner, especially coming from other languages such as C#. Pa...	[ -0.00518798828125, 0.0179443359375, -0.00171661376953125, 0.0093994140625, -0.006805419921875, 0.016845703125, 0.005126953125, -0.0059814453125, 0.0152587890625, -0.0032958984375, 0.0174560546875, -0.038330078125, 0.0042724609375, 0.0101318359375, -0.0019073486328125, 0.00811767578125,...	[ 853, 432, 653, 14012, 80854, 1295, 5303, 1556, 142508, 6496, 1022, 5759, 88996, 903, 6602, 20625, 56037, 63134, 36510, 27140, 6044, 8781, 144996, 46876, 4904, 16031, 29479, 36069, 25, 32354, 87388, 26, 1984, 360, 18, 33079, 7, 30646, 5117, ...	[ 0.010284423828125, 0.1220703125, 0.1705322265625, 0.15185546875, 0.1859130859375, 0.1024169921875, 0.1927490234375, 0.1153564453125, 0.1795654296875, 0.036041259765625, 0.112548828125, 0.1488037109375, 0.06787109375, 0.04046630859375, 0.06842041015625, 0.093017578125, 0.0534973144531...	embed
21895826_c0	21895826	haskell	0	Title: Passing scoped state in runST function Problem title: Passing scoped state in runST function Tags: haskell Problem: Passing scoped state in runST function I have a test function like below which uses runST to internally mutate state. I defined another function go within it which returns Int wrapped in ST as resu...	Passing scoped state in runST function Passing scoped state in runST function haskell Data.Word Data.Vector.Unboxed Control.Monad.ST Control.Monad.Primitive System.Random.MWC Passing LANGUAGE ScopedTypeVariables Main Word32 mapM_ PrimState U.singleton U.Vector Gen Couldn A.hs:12:16 A.hs:10:10 Expected Actual Passing sc...	[ 0.006072998046875, 0.01031494140625, -0.0179443359375, -0.0177001953125, 0.0001583099365234375, -0.01806640625, 0.01141357421875, -0.016845703125, -0.0027313232421875, -0.0155029296875, -0.0027618408203125, 0.0169677734375, -0.00946044921875, 0.015380859375, 0.0181884765625, 0.00674438...	[ 28872, 44679, 297, 11341, 23, 11675, 8545, 32354, 214, 1556, 142508, 11809, 164805, 26455, 18770, 11728, 27131, 46674, 712, 145111, 12353, 3815, 75590, 98064, 182783, 196707, 81827, 14, 12321, 22543, 6460, 22288, 44506, 135206, 345, 6953, 1507,...	[ 0.144287109375, 0.2279052734375, 0.1412353515625, 0.1866455078125, 0.0692138671875, 0.1358642578125, 0.234130859375, 0.1842041015625, 0.02239990234375, 0.1119384765625, 0.2432861328125, 0.03326416015625, 0.0667724609375, 0.0926513671875, 0.07293701171875, 0.1258544921875, 0.126464843...	embed
70525489_c0	70525489	haskell	0	Title: How can I generate every possible solution of a varied size grid which has n points Problem title: How can I generate every possible solution of a varied size grid which has n points Tags: haskell Problem: How can I generate every possible solution of a varied size grid which has n points To give overall context...	How can I generate every possible solution of a varied size grid which has n points How can I generate every possible solution of a varied size grid which has n points haskell How How can I generate every possible solution of a varied size grid which has n points To give overall context, I have a 2d grid of size N (the...	[ 0.0032958984375, 0.00543212890625, -0.0130615234375, -0.01251220703125, -0.01708984375, -0.000339508056640625, -0.0152587890625, -0.0174560546875, 0.004974365234375, -0.033203125, 0.0017242431640625, -0.01361083984375, 0.000164031982421875, -0.010986328125, -0.0205078125, 0.00772094726...	[ 11249, 831, 87, 139392, 11907, 7722, 29806, 10861, 297, 13267, 120067, 1556, 653, 26847, 111, 142508, 128512, 43701, 116, 71, 541, 51529, 285, 11343, 108047, 1022, 33102, 113, 276, 31577, 7413, 41170, 31913, 959, 3444, 8560, 8305, 12989, 41...	[ 0.08111572265625, 0.084716796875, 0.049774169921875, 0.2244873046875, 0.206787109375, 0.207275390625, 0.2174072265625, 0.173828125, 0.0780029296875, 0.1297607421875, 0.267822265625, 0.15380859375, 0.1453857421875, 0.177001953125, 0.00775146484375, 0.236572265625, 0.011383056640625, ...	embed
30555469_c2	30555469	haskell	2	fPtru6/HSbinary-0.7.3.0-EKE3c9Lmxb3DQpU0fPtru6.o \ /c/ghc/ghc-7.10.1/lib/array_FaHmcBFfuRM8kmZLEY8D5S/HSarray-0.5.1.0-FaHmcBFfuRM8kmZLEY8D5S.o \ .cabal-sandbox/i386-windows-ghc-7.10.1/split_EzXNp9Mcx6zDnUvRChe0Sw/HSsplit-0.2.2-EcQml2WFBePDKSCjwazauo.o This dll library is later used to link program with it (qt project) ...	making haskell dll libraries out of box. According to https://downloads.haskell.org/~ghc/7.0.3/docs/html/users_guide/win32-dlls.html I have compiled such a library to dll (compilation works). This dll library is later used to link program with it (qt project) qt compilation also succeeds, but when I try to run the pro...	[ 0.00106048583984375, -0.00537109375, 0.002105712890625, -0.009765625, -0.0220947265625, 0.004150390625, -0.007415771484375, 0.0062255859375, -0.00579833984375, -0.01080322265625, 0.00160980224609375, -0.024169921875, 0.0201416015625, -0.0068359375, 0.022705078125, -0.0026397705078125, ...	[ 20662, 1556, 142508, 81717, 35773, 10484, 1810, 111, 16530, 61754, 10557, 9486, 238, 129884, 29713, 7693, 64527, 9494, 6460, 71, 42458, 375, 5974, 6044, 1294, 47, 43240, 14432, 11814, 3126, 1528, 678, 864, 18, 13452, 8096, 98352, 214493, 97...	[ 0.111572265625, 0.1790771484375, 0.2578125, 0.2332763671875, 0.251708984375, 0.1239013671875, 0.087890625, 0.0809326171875, 0.167724609375, 0.0709228515625, 0.1304931640625, 0.06451416015625, 0.0816650390625, 0.041748046875, 0.00299072265625, 0.0809326171875, 0.046630859375, 0.0124...	embed
62047071_c0	62047071	haskell	0	Title: Why my output is "()" and how can i fix it? Problem title: Why my output is "()" and how can i fix it? Tags: file, haskell, output Problem: Why my output is "()" and how can i fix it? I do work with text rotate from a txt file, I'm stuck on the simplest thing - output back to the same file. A...	Why my output is "()" and how can i fix it? Why my output is "()" and how can i fix it? file haskell output System.IO Why main2 Char Double output.txt input.txt mapM_ x-5 y-1 Why my output is "()" and how can i fix it? I do work with text rotate from a txt file, I'm stuck on the simplest thing - out...	[ 0.00909423828125, -0.01348876953125, 0.01165771484375, 0.00020313262939453125, -0.00994873046875, 0.017333984375, 0.01043701171875, 0.004150390625, 0.00049591064453125, 0.0263671875, -0.0013275146484375, 0.0084228515625, -0.004730224609375, -0.0179443359375, 0.003692626953125, 0.005523...	[ 44084, 759, 140992, 83, 41502, 74, 132, 1230, 136, 3642, 831, 17, 30022, 442, 619, 11435, 1556, 142508, 12353, 17780, 5201, 304, 21656, 107172, 124326, 107730, 22288, 594, 1022, 10342, 113, 5759, 16, 4488, 678, 7986, 47014, 67, 1295, 1799...	[ 0.13671875, 0.07794189453125, 0.302978515625, 0.0975341796875, 0.1336669921875, 0.00579833984375, 0.1925048828125, 0.0173797607421875, 0.0216827392578125, 0.044036865234375, 0.0452880859375, 0.0281524658203125, 0.1689453125, 0.057830810546875, 0.0084228515625, 0.148193359375, 0.16284...	embed
41205566_c0	41205566	haskell	0	Title: Haskell: How do you figure out the definition of <> from a Monad definition? Problem title: Haskell: How do you figure out the definition of <> from a Monad definition? Tags: haskell, parsing, applicative Problem: Haskell: How do you figure out the definition of <*> from a Monad definition? I have ...	Haskell: How do you figure out the definition of <> from a Monad definition? Haskell: How do you figure out the definition of <> from a Monad definition? haskell parsing applicative a Haskell How Monad Parser Haskell: How do you figure out the definition of <*> from a Monad definition? I have a parser obj...	[ 0.0084228515625, 0.030517578125, 0.004058837890625, 0.0306396484375, 0.003936767578125, 0.0235595703125, -0.007293701171875, -0.0108642578125, 0.0027618408203125, -0.0233154296875, 0.0201416015625, -0.025390625, -0.0145263671875, -0.003875732421875, 0.000598907470703125, -0.00897216796...	[ 20625, 142508, 11249, 26366, 1810, 80934, 111, 1277, 1639, 1230, 5386, 1295, 60331, 71, 619, 74, 1556, 366, 6953, 41816, 4935, 2392, 2189, 4426, 2740, 36746, 61924, 32354, 27489, 110527, 63769, 68557, 48716, 7, 1314, 3934, 1632, 17368, 7520...	[ 0.1097412109375, 0.2393798828125, 0.0452880859375, 0.1387939453125, 0.0906982421875, 0.228271484375, 0.051788330078125, 0.08355712890625, 0.1895751953125, 0.0406494140625, 0.144775390625, 0.0831298828125, 0.1988525390625, 0.169921875, 0.011322021484375, 0.041961669921875, 0.071960449...	embed
28603585_c0	28603585	haskell	0	Title: haskell state monad in function and argument Problem title: haskell state monad in function and argument Tags: state-monad, haskell Problem: haskell state monad in function and argument I have a question regarding the usage of the state monad if a function and its argument, that is also a function, both change t...	haskell state monad in function and argument haskell state monad in function and argument state-monad haskell Control.Monad.State Main test1 test2 MyState MyStateMonadT StateT Foo Bar haskell state monad in function and argument I have a question regarding the usage of the state monad if a function and its argument, th...	[ -0.007293701171875, -0.0032196044921875, -0.01251220703125, 0.0169677734375, 0.00946044921875, 0.01123046875, -0.00433349609375, 0.0023193359375, -0.012451171875, -0.00055694580078125, 0.01300048828125, 0.01513671875, -0.0152587890625, 0.03369140625, -0.0009765625, -0.0234375, -0.003...	[ 1556, 142508, 11341, 2667, 712, 23, 32354, 136, 10750, 3796, 27131, 46674, 135206, 12321, 3034, 2646, 618, 22836, 9572, 31, 3253, 9655, 127689, 2174, 6863, 15044, 15549, 16610, 5775, 65572, 1909, 3444, 11782, 75447, 5423, 47, 1299, 4734, 35...	[ 0.11376953125, 0.2149658203125, 0.197265625, 0.1390380859375, 0.221923828125, 0.045562744140625, 0.1982421875, 0.08935546875, 0.23095703125, 0.116455078125, 0.12841796875, 0.078125, 0.1318359375, 0.013458251953125, 0.1204833984375, 0.04547119140625, 0.0845947265625, 0.12890625, 0...	embed
76720149_c0	76720149	haskell	0	Title: ghci not creating new lines (outputs are on the same line too) Problem title: ghci not creating new lines (outputs are on the same line too) Tags: ghci, haskell Problem: ghci not creating new lines (outputs are on the same line too) I have just got Haskell installed using GHCup in WSL2 (Ubuntu). However, there i...	ghci not creating new lines (outputs are on the same line too) ghci not creating new lines (outputs are on the same line too) ghci haskell GHCi www.haskell.org ghci not creating new lines (outputs are on the same line too) I have just got Haskell installed using GHCup in WSL2 (Ubuntu). However, there is a problem with ...	[ -0.0089111328125, 0.0028228759765625, 0.0023651123046875, 0.00970458984375, -0.017822265625, 0.0111083984375, 0.01416015625, 0.0031585693359375, -0.00732421875, -0.00714111328125, -0.0174560546875, -0.036865234375, -0.0033111572265625, -0.003814697265625, -0.01422119140625, 0.011169433...	[ 31380, 318, 959, 105233, 3525, 124519, 6056, 7077, 621, 98, 5701, 13315, 5792, 1556, 142508, 527, 73265, 14, 10557, 1478, 20625, 20600, 2037, 601, 30508, 304, 79249, 34, 2967, 29481, 56, 4034, 24234, 30957, 18, 28282, 28412, 130250, 183114,...	[ 0.16455078125, 0.2122802734375, 0.08819580078125, 0.1981201171875, 0.1290283203125, 0.1944580078125, 0.1190185546875, 0.140380859375, 0.023712158203125, 0.0657958984375, 0.119384765625, 0.1571044921875, 0.05145263671875, 0.1163330078125, 0.2174072265625, 0.0941162109375, 0.1096191406...	embed
59108015_c0	59108015	haskell	0	Title: Haskell - Translate a list to a recursive data structure Problem title: Haskell - Translate a list to a recursive data structure Tags: haskell, tree, recursion, binary-tree Problem: Haskell - Translate a list to a recursive data structure I found this problem in a Haskell textbook. Given a recursive data structu...	Haskell - Translate a list to a recursive data structure Haskell - Translate a list to a recursive data structure haskell tree recursion binary-tree Haskell Translate Foo Haskell - Translate a list to a recursive data structure I found this problem in a Haskell textbook. Given a recursive data structure: create a funct...	[ 0.0155029296875, 0.0001201629638671875, -0.00775146484375, 0.021728515625, 0.0274658203125, 0.007080078125, -0.02001953125, -0.0036163330078125, 0.0096435546875, -0.0147705078125, -0.00160980224609375, -0.031494140625, -0.0021514892578125, 0.01806640625, 0.00225830078125, -0.0257568359...	[ 20625, 142508, 11062, 19309, 5303, 47, 10, 195625, 5844, 2053, 45646, 1556, 53201, 2394, 6635, 62600, 9572, 31, 14037, 2967, 7986, 14137, 28282, 32354, 51776, 136, 4027, 25720, 30646, 3525, 9007, 538, 214, 26950, 151552, 27781, 61924, 335, ...	[ 0.150146484375, 0.253173828125, 0.1533203125, 0.1822509765625, 0.20068359375, 0.1092529296875, 0.033660888671875, 0.245849609375, 0.1485595703125, 0.1011962890625, 0.2332763671875, 0.138671875, 0.1573486328125, 0.1129150390625, 0.0254669189453125, 0.1304931640625, 0.15771484375, 0....	embed
45385105_c0	45385105	haskell	0	Title: "Insert disk into Drive D" blocks Haskell from starting Problem title: "Insert disk into Drive D" blocks Haskell from starting Tags: haskell Problem: "Insert disk into Drive D" blocks Haskell from starting This question is an outgrowth of another question . In that question I asked for advice...	"Insert disk into Drive D" blocks Haskell from starting "Insert disk into Drive D" blocks Haskell from starting haskell starting Insert Drive Haskell Heap "Insert disk into Drive D" blocks Haskell from starting This question is an outgrowth of another question . In that question I asked for advice f...	[ -0.0050048828125, 0.00738525390625, -0.00933837890625, 0.00135040283203125, -0.00299072265625, 0.013916015625, -0.00799560546875, -0.03173828125, 0.0031280517578125, -0.0230712890625, 0.0108642578125, -0.01251220703125, 0.01104736328125, 0.01025390625, 0.0079345703125, 0.016845703125, ...	[ 4153, 33657, 28338, 3934, 50161, 391, 46389, 20625, 142508, 1295, 72134, 1556, 1529, 2631, 67660, 24927, 11809, 13025, 20600, 20819, 13028, 3773, 18499, 16530, 160, 110, 23, 183540, 17262, 77679, 11137, 24812, 40858, 110196, 79786, 67153, 527, ...	[ 0.0496826171875, 0.1693115234375, 0.1295166015625, 0.1158447265625, 0.1451416015625, 0.19140625, 0.1934814453125, 0.1527099609375, 0.2666015625, 0.0170745849609375, 0.093017578125, 0.1317138671875, 0.17724609375, 0.1737060546875, 0.027191162109375, 0.1846923828125, 0.0916748046875, ...	embed
58347892_c1	58347892	haskell	1	centroid’: centroid cenpoint = (Pt average (pointsX cenpoint) average (pointsY cenpoint)) \| 35 \| centroid cenpoint = (Pt average(pointsX cenpoint) average(pointsY cenpoint)) \| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Project1.hs:35:25: error: • Couldn't match expected type ‘Double’ with actual type ‘[Doub...	centroid’: centroid cenpoint = (Pt average (pointsX cenpoint) average (pointsY cenpoint)) \| 35 \| centroid cenpoint = (Pt average(pointsX cenpoint) average(pointsY cenpoint)) \| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Project1.hs:35:25: error: • Couldn't match expected type ‘Double’ with actual type ‘[Doub...	[ 0.0034637451171875, -0.017333984375, 0.004852294921875, 0.00762939453125, 0.01080322265625, 0.00872802734375, 0.008056640625, -0.0087890625, -0.01220703125, -0.00213623046875, -0.01123046875, -0.0240478515625, 0.005889892578125, -0.0179443359375, -0.0164794921875, 0.00811767578125, 0...	[ 5863, 532, 26, 12, 11662, 38496, 2203, 683, 18, 83080, 7, 1542, 1723, 58745, 2273, 6, 16377, 27331, 418, 127, 27144, 21224, 18499, 768, 191147, 14858, 84751, 10644, 8331, 34, 2661, 8561, 107172, 1250, 275, 22304, 8216, 29838, 190659, 47, ...	[ 0.26123046875, 0.278564453125, 0.087646484375, 0.0445556640625, 0.251953125, 0.259521484375, 0.127197265625, 0.135498046875, 0.1834716796875, 0.27587890625, 0.025726318359375, 0.1153564453125, 0.150634765625, 0.039215087890625, 0.2259521484375, 0.029815673828125, 0.042449951171875, ...	embed
15641584_c0	15641584	haskell	0	Title: Haskell IO: convert IO String to "Other type" Problem title: Haskell IO: convert IO String to "Other type" Tags: binary-search-tree, haskell Problem: Haskell IO: convert IO String to "Other type" I have a Haskell program which takes a file as an input and convert it into a binary search tree....	Haskell IO: convert IO String to "Other type" Haskell IO: convert IO String to "Other type" binary-search-tree haskell System.IO Haskell Other Tree EmptyBST Node Show Read Ord tree.txt Couldn Haskell IO: convert IO String to "Other type" I have a Haskell program which takes a file as an input and co...	[ -0.000782012939453125, -0.00762939453125, -0.0103759765625, -0.01446533203125, 0.0084228515625, 0.025146484375, -0.0220947265625, -0.008544921875, -0.0027008056640625, -0.043212890625, -0.00885009765625, -0.0380859375, 0.009521484375, 0.000873565673828125, 0.01080322265625, -0.00561523...	[ 20625, 142508, 17780, 96760, 23351, 214, 47, 670, 9319, 10644, 12, 2394, 6635, 86250, 62600, 1556, 12353, 64511, 101344, 31678, 939, 8545, 438, 112, 17367, 4764, 35379, 53201, 124326, 191147, 1528, 51776, 11435, 107730, 3934, 33938, 11675, 75...	[ 0.1207275390625, 0.211181640625, 0.22802734375, 0.1800537109375, 0.193359375, 0.075927734375, 0.06640625, 0.113037109375, 0.14794921875, 0.1962890625, 0.026214599609375, 0.1241455078125, 0.06365966796875, 0.1156005859375, 0.1500244140625, 0.09600830078125, 0.053741455078125, 0.1937...	embed
41354231_c0	41354231	haskell	0	Title: How can I set up Haskell's GHCI to interactively evaluate functions to their signature (type) instead of getting errors? Problem title: How can I set up Haskell's GHCI to interactively evaluate functions to their signature (type) instead of getting errors? Tags: ghci, ghc, types, haskell Problem: How c...	How can I set up Haskell's GHCI to interactively evaluate functions to their signature (type) instead of getting errors? How can I set up Haskell's GHCI to interactively evaluate functions to their signature (type) instead of getting errors? ghci ghc types haskell a How Haskell GHCI Prelude Num Show How can I...	[ 0.003997802734375, 0.0016632080078125, 0.012451171875, 0.0125732421875, -0.00093841552734375, -0.0030059814453125, -0.0035552978515625, -0.00396728515625, -0.0052490234375, -0.014404296875, -0.00811767578125, -0.039794921875, 0.002166748046875, -0.0074462890625, 0.00274658203125, 0.015...	[ 11249, 831, 5423, 1257, 20625, 142508, 3768, 41877, 17304, 212398, 151575, 32354, 47, 138256, 50986, 64457, 20949, 18499, 31380, 318, 238, 52895, 1556, 10, 1914, 822, 112, 52782, 17367, 1957, 183114, 442, 678, 152, 18, 11417, 11907, 1733, 5...	[ 0.03240966796875, 0.046661376953125, 0.1221923828125, 0.0836181640625, 0.1357421875, 0.255615234375, 0.043121337890625, 0.17041015625, 0.2255859375, 0.172119140625, 0.15625, 0.184326171875, 0.05908203125, 0.2274169921875, 0.181640625, 0.0994873046875, 0.0450439453125, 0.17102050781...	embed
5131182_c2	5131182	haskell	2	1000) libdl.so.2 => /lib/libdl.so.2 (0x00007f5000e5d000) libc.so.6 => /lib/libc.so.6 (0x00007f5000afc000) libpthread.so.0 => /lib/libpthread.so.0 (0x00007f50008df000) /lib/ld-linux-x86-64.so.2 (0x00007f5001759000) If I try to compile it with(without '-dynamic'): $ ghc --make -shared -fPIC foo.hs -o libfoo.so Linking li...	1000) libdl.so.2 => /lib/libdl.so.2 (0x00007f5000e5d000) libc.so.6 => /lib/libc.so.6 (0x00007f5000afc000) libpthread.so.0 => /lib/libpthread.so.0 (0x00007f50008df000) /lib/ld-linux-x86-64.so.2 (0x00007f5001759000) If I try to compile it with(without '-dynamic'): $ ghc --make -shared -fPIC foo.hs -o libfoo.so Linking li...	[ 0.0037689208984375, -0.01458740234375, 0.01165771484375, -0.007171630859375, 0.0069580078125, 0.00341796875, -0.037109375, 0.0157470703125, -0.025634765625, -0.037109375, -0.017578125, -0.0196533203125, -0.00616455078125, 0.00518798828125, -0.0123291015625, -0.0186767578125, 0.025390...	[ 4382, 25474, 20469, 991, 304, 44357, 248, 5612, 28568, 420, 29213, 9508, 238, 910, 254, 39116, 2389, 7344, 2397, 6077, 15276, 13307, 9790, 9969, 1340, 442, 678, 6056, 242554, 3650, 31380, 55898, 67886, 126091, 5775, 31, 127, 3584, 12779, ...	[ 0.212890625, 0.169677734375, 0.22705078125, 0.18017578125, 0.1873779296875, 0.014007568359375, 0.00927734375, 0.14306640625, 0.02752685546875, 0.0694580078125, 0.0958251953125, 0.050506591796875, 0.1513671875, 0.162353515625, 0.0251922607421875, 0.142822265625, 0.076904296875, 0.16...	embed
70307110_c0	70307110	haskell	0	Title: Cannot represent equality constraint as a custom constraint Problem title: Cannot represent equality constraint as a custom constraint Tags: haskell, typeclass, yesod Problem: Cannot represent equality constraint as a custom constraint I have a function type declaration f :: MonadHandler m => SqlPersistT m () Wh...	Cannot represent equality constraint as a custom constraint Cannot represent equality constraint as a custom constraint haskell typeclass yesod Cannot MonadHandler SqlPersistT MonadHandlerDB Couldn ReaderT backend0 SqlBackend Cannot represent equality constraint as a custom constraint I have a function type declaration...	[ 0.00732421875, 0.0091552734375, -0.00933837890625, 0.01153564453125, -0.010986328125, -0.00836181640625, -0.024169921875, -0.019287109375, 0.002166748046875, -0.02490234375, -0.01153564453125, -0.01251220703125, -0.000797271728515625, -0.004608154296875, -0.003143310546875, -0.00004076...	[ 4171, 10869, 33636, 28, 161789, 158, 2816, 4288, 237, 114122, 1556, 142508, 10644, 67413, 2422, 23722, 60331, 71, 135679, 603, 99247, 15277, 57702, 618, 39463, 191147, 122636, 4420, 3611, 2389, 152470, 32354, 21635, 96760, 61924, 53418, 9969, ...	[ 0.035858154296875, 0.1246337890625, 0.2149658203125, 0.0531005859375, 0.241455078125, 0.09228515625, 0.2017822265625, 0.12109375, 0.054046630859375, 0.18408203125, 0.099853515625, 0.1824951171875, 0.14501953125, 0.1624755859375, 0.1331787109375, 0.2109375, 0.1295166015625, 0.069702...	embed
73765638_c0	73765638	haskell	0	Title: Empty list in Haskell is not running in function even though I have a base case checking for empty lists Problem title: Empty list in Haskell is not running in function even though I have a base case checking for empty lists Tags: empty-list, haskell, quicksort Problem: Empty list in Haskell is not running in fu...	Empty list in Haskell is not running in function even though I have a base case checking for empty lists Empty list in Haskell is not running in function even though I have a base case checking for empty lists empty-list haskell quicksort a being Prelude Empty Haskell Ord x:xs list1 list2 list3 Main.hs:29:11 Ambiguous ...	[ -0.000339508056640625, 0.00482177734375, 0.005859375, -0.006256103515625, -0.0024566650390625, 0.016357421875, -0.01312255859375, -0.02734375, 0.003021240234375, 0.034423828125, 0.00958251953125, -0.0013885498046875, -0.00109100341796875, -0.003692626953125, 0.0079345703125, 0.01037597...	[ 31678, 939, 5303, 20625, 142508, 959, 51042, 23, 32354, 3853, 21208, 3647, 7225, 175199, 201505, 6562, 1556, 63773, 62351, 8035, 1914, 822, 35379, 363, 12321, 5, 29223, 19993, 10250, 12282, 1250, 275, 2886, 32255, 81206, 214, 5983, 527, 732...	[ 0.1903076171875, 0.158935546875, 0.2340087890625, 0.117431640625, 0.22216796875, 0.12744140625, 0.1275634765625, 0.047698974609375, 0.144775390625, 0.00543212890625, 0.003570556640625, 0.1710205078125, 0.1502685546875, 0.19580078125, 0.2000732421875, 0.1685791015625, 0.08349609375, ...	embed
9138760_c0	9138760	haskell	0	Title: I'm confused about what's recursive, tail recursive, primitive recursive and what's not Problem title: I'm confused about what's recursive, tail recursive, primitive recursive and what's not Tags: functional-programming, haskell, recursion, tail-recursion Problem: I'm confused about...	I'm confused about what's recursive, tail recursive, primitive recursive and what's not I'm confused about what's recursive, tail recursive, primitive recursive and what's not functional-programming haskell recursion tail-recursion System.Random MyProgram Guess num1 Too Congratulations You...	[ -0.01904296875, 0.003875732421875, 0.0037078857421875, 0.006256103515625, 0.0264892578125, 0.03759765625, -0.01806640625, -0.0203857421875, -0.0172119140625, -0.00555419921875, 0.001434326171875, -0.02294921875, -0.0181884765625, 0.0101318359375, 0.0198974609375, 0.01422119140625, 0....	[ 3768, 55681, 5281, 2367, 195625, 5844, 46741, 128489, 13, 959, 123309, 28966, 1556, 142508, 1830, 107, 48650, 12353, 126525, 3815, 2646, 148968, 96274, 7, 13269, 418, 56374, 71867, 72403, 136, 59121, 8781, 57767, 70, 14012, 1528, 3871, 3714, ...	[ 0.046722412109375, 0.1234130859375, 0.0684814453125, 0.03326416015625, 0.25390625, 0.1785888671875, 0.257568359375, 0.22265625, 0.127685546875, 0.1761474609375, 0.175537109375, 0.1107177734375, 0.130126953125, 0.20166015625, 0.1107177734375, 0.0845947265625, 0.1649169921875, 0.1247...	embed
58639719_c1	58639719	haskell	1	"@" t of 0 -> Left (InvalidEmailAddress t "Must contain @ symbol") 1 -> Right (ValidEmailAddress t) _ -> Left (InvalidEmailAddress t "Contains more than one @ symbol") instance PersistFieldSql EmailAddress where sqlType _ = SqlString instance PersistField EmailAddress where fromPersistValue = decodePersistTextValue pa...	"@" t of 0 -> Left (InvalidEmailAddress t "Must contain @ symbol") 1 -> Right (ValidEmailAddress t) _ -> Left (InvalidEmailAddress t "Contains more than one @ symbol") instance PersistFieldSql EmailAddress where sqlType _ = SqlString instance PersistField EmailAddress where fromPersistValue = decodePersistTextValue pa...	[ 0.021240234375, 0.02099609375, -0.0024871826171875, 0.00872802734375, -0.00167083740234375, 0.023681640625, -0.02880859375, -0.0079345703125, -0.0028839111328125, -0.01226806640625, 0.01495361328125, 0.000682830810546875, 0.004913330078125, 0.01055908203125, -0.005340576171875, 0.00921...	[ 981, 808, 111, 757, 33079, 636, 2480, 4153, 7013, 161994, 161007, 55668, 18, 70541, 1374, 26582, 106, 90911, 42272, 11935, 25500, 1286, 3501, 1632, 110527, 57309, 271, 6159, 19388, 99247, 14886, 196707, 159, 71713, 1295, 15277, 57702, 856, ...	[ 0.2149658203125, 0.0989990234375, 0.0887451171875, 0.145263671875, 0.053558349609375, 0.026458740234375, 0.1014404296875, 0.03466796875, 0.1612548828125, 0.116455078125, 0.15625, 0.123779296875, 0.0755615234375, 0.2088623046875, 0.234130859375, 0.2470703125, 0.05487060546875, 0.117...	embed
17055761_c0	17055761	haskell	0	Title: How to use Pandoc's writeHtmlString when using IO String for template Problem title: How to use Pandoc's writeHtmlString when using IO String for template Tags: haskell, pandoc Problem: How to use Pandoc's writeHtmlString when using IO String for template I am reading the template file when converting ...	How to use Pandoc's writeHtmlString when using IO String for template How to use Pandoc's writeHtmlString when using IO String for template haskell pandoc IO How Pandoc File Path template.html WriterOptions FilePath Couldn How to use Pandoc's writeHtmlString when using IO String for template I am reading the ...	[ -0.0040283203125, 0.00787353515625, 0.0008087158203125, -0.00007915496826171875, -0.01031494140625, -0.005828857421875, -0.00848388671875, -0.0036773681640625, 0.01019287109375, -0.015869140625, 0.0038299560546875, -0.034423828125, 0.01092529296875, -0.0096435546875, 0.021240234375, -0...	[ 11249, 4527, 4378, 29713, 3768, 33022, 841, 18, 7237, 71713, 214, 3229, 17368, 17780, 23351, 100, 110934, 7, 1556, 142508, 2652, 42724, 108421, 7693, 2783, 39029, 683, 10519, 191147, 16454, 11435, 96760, 16188, 34695, 102158, 31577, 11301, 26...	[ 0.05499267578125, 0.1162109375, 0.1326904296875, 0.2193603515625, 0.0863037109375, 0.2066650390625, 0.0963134765625, 0.1309814453125, 0.1834716796875, 0.2164306640625, 0.09844970703125, 0.015533447265625, 0.05712890625, 0.206787109375, 0.1937255859375, 0.07171630859375, 0.25024414062...	embed
23008805_c0	23008805	haskell	0	Title: How to set cabal extra dirs for all packages in a sandbox Problem title: How to set cabal extra dirs for all packages in a sandbox Tags: haskell, cabal, cabal-install Problem: How to set cabal extra dirs for all packages in a sandbox I'm currently working on a Haskell project that uses lots of native code. This ...	How to set cabal extra dirs for all packages in a sandbox How to set cabal extra dirs for all packages in a sandbox haskell cabal cabal-install How How to set cabal extra dirs for all packages in a sandbox I'm currently working on a Haskell project that uses lots of native code. This means that include files and librar...	[ 0.0052490234375, -0.002532958984375, 0.0174560546875, 0.009033203125, -0.01708984375, -0.01300048828125, -0.01373291015625, 0.045654296875, -0.00051116943359375, -0.01263427734375, -0.0103759765625, -0.0203857421875, 0.01031494140625, 0.0048828125, -0.00628662109375, -0.00408935546875,...	[ 11249, 5423, 109524, 4173, 5402, 7, 100, 756, 98169, 19096, 11728, 23, 1556, 142508, 80383, 20697, 20625, 13452, 4527, 71358, 24, 4935, 18151, 26698, 102158, 35773, 81522, 4210, 112779, 5612, 936, 217028, 75101, 2256, 49938, 60213, 71864, 796...	[ 0.036163330078125, 0.1610107421875, 0.25927734375, 0.197509765625, 0.2144775390625, 0.1209716796875, 0.07293701171875, 0.1297607421875, 0.2215576171875, 0.1448974609375, 0.1903076171875, 0.0450439453125, 0.0806884765625, 0.1903076171875, 0.13525390625, 0.0179443359375, 0.071350097656...	embed
52799484_c0	52799484	haskell	0	Title: Haskell ghci cannot load file Problem title: Haskell ghci cannot load file Tags: haskell, ghci Problem: Haskell ghci cannot load file I am new to Haskell and trying to play around with it. Therefore I want to define some functions in a file and then load them in ghci . I have a file called tryout.hl which I want...	Haskell ghci cannot load file Haskell ghci cannot load file haskell ghci Haskell tryout.hl Oct Num Ord x:xs n-1 GHCi www.haskell.org Prelude Haskell ghci cannot load file I am new to Haskell and trying to play around with it. Therefore I want to define some functions in a file and then load them in ghci . I have a file...	[ 0.01470947265625, -0.00811767578125, 0.01068115234375, 0.015869140625, -0.00634765625, 0.002197265625, -0.00823974609375, 0.006622314453125, -0.0062255859375, -0.0194091796875, -0.0145263671875, -0.044921875, -0.014404296875, -0.00128936767578125, -0.0028228759765625, -0.0059814453125,...	[ 20625, 142508, 31380, 318, 53418, 72367, 11435, 1556, 9790, 6056, 8266, 33649, 52782, 35379, 1022, 425, 5759, 527, 73265, 14, 10557, 1478, 1914, 822, 112, 3525, 31577, 11301, 3444, 61924, 32354, 10, 141, 63033, 15044, 75101, 30388, 15123, 9...	[ 0.1390380859375, 0.2239990234375, 0.177734375, 0.2401123046875, 0.19970703125, 0.2225341796875, 0.1912841796875, 0.1331787109375, 0.16259765625, 0.1981201171875, 0.1751708984375, 0.1212158203125, 0.073974609375, 0.0933837890625, 0.016448974609375, 0.029876708984375, 0.0723876953125, ...	embed
65183913_c0	65183913	haskell	0	Title: Printing out a rose tree...? Problem title: Printing out a rose tree...? Tags: string, show, tree, haskell Problem: Printing out a rose tree...? I am currently learning Haskell in one of my online classes at the university. I now have to write a program that can work with a rose tree. Right now it looks like thi...	Printing out a rose tree...? Printing out a rose tree...? string show tree haskell Printing Rose testTree1 Pretty Test Printing out a rose tree...? I am currently learning Haskell in one of my online classes at the university. I now have to write a program that can work with a rose tree. Right now it looks like this: O...	[ -0.01025390625, -0.00018596649169921875, -0.0031890869140625, 0.005889892578125, 0.015380859375, 0.004669189453125, -0.01263427734375, -0.00933837890625, 0.0022430419921875, 0.007354736328125, 0.0069580078125, -0.031982421875, 0.006072998046875, 0.003662109375, -0.016845703125, -0.0087...	[ 39754, 1810, 10, 49175, 53201, 27, 214, 79315, 7639, 1556, 142508, 24009, 3034, 62731, 13, 418, 197570, 8647, 52080, 20625, 1118, 61112, 152363, 33022, 1528, 4488, 678, 33342, 159029, 3884, 71713, 866, 19, 56359, 939, 6954, 17727, 16750, 67...	[ 0.1871337890625, 0.124267578125, 0.011199951171875, 0.2022705078125, 0.23095703125, 0.009735107421875, 0.068115234375, 0.181884765625, 0.1358642578125, 0.1016845703125, 0.218505859375, 0.204833984375, 0.1395263671875, 0.2158203125, 0.004058837890625, 0.0538330078125, 0.1834716796875,...	embed
33324827_c0	33324827	haskell	0	Title: Yesod hamlet loop broken down by categories Problem title: Yesod hamlet loop broken down by categories Tags: haskell, hamlet, yesod Problem: Yesod hamlet loop broken down by categories I am trying to loop through a list of products in hamlet each product has a category. I would like to break down the output to g...	Yesod hamlet loop broken down by categories Yesod hamlet loop broken down by categories haskell hamlet yesod Yesod col-md-12 Product Category ProductName LimitTo Entity Just Yesod hamlet loop broken down by categories I am trying to loop through a list of products in hamlet each product has a category. I would like to ...	[ 0.011962890625, -0.005645751953125, -0.004180908203125, 0.004638671875, -0.0111083984375, 0.01055908203125, -0.01324462890625, -0.00518798828125, -0.004364013671875, -0.03515625, -0.003997802734375, -0.01080322265625, -0.0162353515625, -0.0093994140625, 0.000904083251953125, -0.0115356...	[ 32635, 2199, 2057, 1974, 40956, 148431, 7565, 390, 39283, 1556, 142508, 2422, 23722, 3365, 54686, 9955, 73111, 49057, 163612, 125177, 7763, 16511, 9563, 31577, 8305, 5303, 38742, 12638, 12996, 95487, 1884, 36356, 140992, 21115, 35064, 10336, 21...	[ 0.1593017578125, 0.2413330078125, 0.1610107421875, 0.213134765625, 0.1820068359375, 0.0943603515625, 0.1307373046875, 0.033203125, 0.2144775390625, 0.1014404296875, 0.20166015625, 0.1160888671875, 0.2095947265625, 0.0853271484375, 0.05352783203125, 0.130615234375, 0.124755859375, 0...	embed
37734954_c0	37734954	haskell	0	Title: Print function that returns int Problem title: Print function that returns int Tags: haskell Problem: Print function that returns int In Haskell, I am trying to print a method which returns an Int . For now, mySum is just a stub because I'm trying to figure out how to print it. I looked up how to do this and I s...	Print function that returns int Print function that returns int haskell main Print Couldn Integer Relevant weirdFold.hs:10:1 Char Expected Actual Probable Print function that returns int In Haskell, I am trying to print a method which returns an Int . For now, mySum is just a stub because I'm trying to figure out how t...	[ -0.031494140625, -0.01080322265625, 0.01409912109375, 0.0140380859375, -0.01055908203125, 0.03173828125, -0.00830078125, -0.004364013671875, 0.0032196044921875, -0.003997802734375, -0.0142822265625, -0.0274658203125, 0.0009765625, 0.0181884765625, 0.01318359375, 0.0054931640625, -0.0...	[ 39754, 32354, 450, 30646, 7, 23, 18, 1556, 142508, 5201, 191147, 19, 44401, 133, 179459, 18345, 127, 15110, 19721, 21656, 60075, 13, 100582, 1250, 275, 2886, 20625, 31577, 28412, 55300, 360, 759, 294, 316, 136057, 26366, 3884, 71713, 831, ...	[ 0.2257080078125, 0.198486328125, 0.0665283203125, 0.1915283203125, 0.0567626953125, 0.1397705078125, 0.147216796875, 0.128662109375, 0.2056884765625, 0.090576171875, 0.115966796875, 0.052734375, 0.154541015625, 0.0782470703125, 0.1685791015625, 0.154052734375, 0.0706787109375, 0.08...	embed
32129818_c0	32129818	haskell	0	Title: Miranda To Haskell - What is the improved version? Problem title: Miranda To Haskell - What is the improved version? Tags: haskell Problem: Miranda To Haskell - What is the improved version? I'm working out the code from this paper. It's bugging me that my translation is more verbose. It occurs to me I'm missing...	Miranda To Haskell - What is the improved version? Miranda To Haskell - What is the improved version? haskell Miranda Haskell What Leaf Internal QTree Miranda To Haskell - What is the improved version? I'm working out the code from this paper. It's bugging me that my translation is more verbose. It occurs to me I'm mis...	[ 0.0113525390625, 0.00897216796875, 0.0201416015625, 0.0068359375, 0.0194091796875, -0.00193023681640625, -0.0198974609375, -0.0361328125, 0.00604248046875, 0.0008697509765625, 0.00390625, 0.00982666015625, 0.004730224609375, 0.0052490234375, 0.0087890625, 0.00127410888671875, -0.0079...	[ 140988, 717, 20625, 142508, 4865, 83, 52295, 71, 11389, 1556, 636, 2407, 106745, 141, 2396, 62731, 70, 20697, 18151, 15122, 153648, 1286, 57823, 184, 132283, 162520, 6333, 7311, 11853, 438, 24494, 339, 38131, 111, 42564, 141621, 7225, 756, ...	[ 0.30029296875, 0.1771240234375, 0.1500244140625, 0.267333984375, 0.050750732421875, 0.027374267578125, 0.1744384765625, 0.0927734375, 0.171875, 0.1263427734375, 0.0845947265625, 0.17724609375, 0.1751708984375, 0.035797119140625, 0.0906982421875, 0.2237548828125, 0.006134033203125, ...	embed
10767736_c1	10767736	haskell	1	VU.Vector Int -> [[Bool]] -> m [Int] solveLP vmax0 elems = go vmax0 elemTrueIxs where -- could be fed to 'sequence' elemTrueIxs = [ [ ei \| (ei,True) <- zip [0::Int ..] row ] \| row <- elems ] go vmax [] = return [] go vmax (m:ms) = do ei <- mlist m let vmax' = vmax VU.// [(ei, maxcnt-1)] -- this operation is expensive ...	VU.Vector Int -> [[Bool]] -> m [Int] solveLP vmax0 elems = go vmax0 elemTrueIxs where -- could be fed to 'sequence' elemTrueIxs = [ [ ei \| (ei,True) <- zip [0::Int ..] row ] \| row <- elems ] go vmax [] = return [] go vmax (m:ms) = do ei <- mlist m let vmax' = vmax VU.// [(ei, maxcnt-1)] -- this operation is expensive ...	[ -0.0152587890625, 0.02294921875, 0.0069580078125, 0.0098876953125, -0.003326416015625, 0.0205078125, 0.0020904541015625, 0.00146484375, 0.017333984375, -0.0269775390625, -0.0025634765625, 0.021728515625, 0.00457763671875, 0.021240234375, -0.015869140625, 0.0181884765625, -0.003067016...	[ 120403, 5, 26455, 18770, 360, 18, 33079, 12647, 929, 347, 4153, 86869, 37352, 81, 24084, 2389, 88, 195, 2203, 738, 882, 13, 568, 425, 4210, 5809, 186, 51158, 47, 184, 944, 3956, 475, 1399, 68330, 1468, 15555, 58745, 30646, 39, 12, 443...	[ 0.259765625, 0.033294677734375, 0.1982421875, 0.13720703125, 0.0972900390625, 0.116943359375, 0.0226287841796875, 0.08270263671875, 0.158203125, 0.148193359375, 0.050811767578125, 0.1827392578125, 0.202880859375, 0.1514892578125, 0.1982421875, 0.177490234375, 0.039337158203125, 0.1...	embed
13146128_c0	13146128	haskell	0	Title: Simple Generators Problem title: Simple Generators Tags: ocaml, f%23, loops, yield, haskell Problem: Simple Generators This code comes from a paper called "Lazy v. Yield" . Its about a way to decouple producers and consumer of streams of data. I understand the Haskell portion of the code but the O'Caml/F# eludes...	Simple Generators Simple Generators ocaml f%23 loops yield haskell Simple Generators SimpleGenerators yield_handler Simple Generators This code comes from a paper called "Lazy v. Yield" . Its about a way to decouple producers and consumer of streams of data. I understand the Haskell portion of the code but the O'Caml/F...	[ 0.00347900390625, 0.01385498046875, 0.004974365234375, 0.000020623207092285156, 0.004608154296875, -0.01153564453125, -0.0037994384765625, -0.0167236328125, 0.00136566162109375, -0.040283203125, -0.0107421875, 0.0162353515625, -0.00872802734375, -0.01153564453125, 0.02392578125, -0.025...	[ 60552, 222518, 36, 9779, 141, 1238, 3949, 3742, 40956, 11180, 19388, 1556, 142508, 135932, 219, 22230, 74258, 18151, 32497, 15122, 2729, 3285, 81, 42341, 3917, 8, 12600, 8705, 108558, 136, 107222, 75973, 2053, 28219, 20625, 126826, 180, 25, ...	[ 0.2200927734375, 0.266845703125, 0.06707763671875, 0.1185302734375, 0.1458740234375, 0.0521240234375, 0.07763671875, 0.1497802734375, 0.151123046875, 0.1337890625, 0.2001953125, 0.119140625, 0.22998046875, 0.1375732421875, 0.1156005859375, 0.109375, 0.224609375, 0.157958984375, 0...	embed
15385041_c0	15385041	haskell	0	Title: How to use Data.MessagePack in Haskell Problem title: How to use Data.MessagePack in Haskell Tags: messagepack, serialization, python, haskell Problem: How to use Data.MessagePack in Haskell MessagePack is a binary serialization format, which apparently can be used from both Haskell and Python, languages that I ...	How to use Data.MessagePack in Haskell How to use Data.MessagePack in Haskell messagepack serialization python haskell How Data.MessagePack Haskell Citation Document Reference ByteString How to use Data.MessagePack in Haskell MessagePack is a binary serialization format, which apparently can be used from both Haskell a...	[ 0.0150146484375, 0.01214599609375, -0.00921630859375, 0.01080322265625, -0.0084228515625, 0.01513671875, -0.00058746337890625, -0.00299072265625, -0.01068115234375, -0.0361328125, 0.005889892578125, -0.03271484375, 0.0147705078125, 0.0264892578125, -0.01483154296875, 0.00518798828125, ...	[ 11249, 4527, 11809, 5, 594, 6011, 429, 205956, 23, 20625, 142508, 26008, 29102, 35686, 17198, 50828, 1556, 2079, 43101, 215996, 3311, 67, 71713, 48205, 4588, 2394, 6635, 47691, 9384, 11814, 1295, 136, 145581, 46876, 17664, 13452, 5665, 45646,...	[ 0.046905517578125, 0.1507568359375, 0.16162109375, 0.05816650390625, 0.0484619140625, 0.1343994140625, 0.12109375, 0.279296875, 0.0286712646484375, 0.1568603515625, 0.2152099609375, 0.13916015625, 0.2186279296875, 0.184814453125, 0.0222320556640625, 0.0904541015625, 0.09942626953125,...	embed
18028220_c0	18028220	haskell	0	Title: Haskell Parser Combinators Problem title: Haskell Parser Combinators Tags: haskell, attoparsec, parsing, parser-combinators, parsec Problem: Haskell Parser Combinators I was reading a lot about Haskell Parser Combinators and found a lot of topics like: Parsec vs Yacc/Bison/Antlr: Why and when to use Parsec? Whic...	Haskell Parser Combinators Haskell Parser Combinators haskell attoparsec parsing parser-combinators parsec Haskell Parser Combinators Generators Combinator Haskell Parser Combinators I was reading a lot about Haskell Parser Combinators and found a lot of topics like: Parsec vs Yacc/Bison/Antlr: Why and when to use Pars...	[ -0.024169921875, 0.00933837890625, 0.00872802734375, 0.024169921875, 0.006927490234375, 0.0218505859375, -0.00286865234375, -0.017822265625, -0.0096435546875, 0.003265380859375, -0.0087890625, -0.0228271484375, 0.0230712890625, 0.0033416748046875, -0.0029754638671875, -0.00251770019531...	[ 20625, 142508, 2392, 2189, 106935, 76, 22230, 1556, 243, 31, 2500, 39797, 366, 6953, 277, 19155, 222518, 19, 4597, 16454, 5915, 28451, 20209, 2369, 10060, 571, 40514, 78931, 44084, 3229, 4527, 55556, 2684, 208331, 15400, 707, 17723, 76228, ...	[ 0.1683349609375, 0.28466796875, 0.20654296875, 0.2239990234375, 0.231201171875, 0.1689453125, 0.193115234375, 0.14453125, 0.12451171875, 0.1328125, 0.1556396484375, 0.24755859375, 0.2071533203125, 0.113037109375, 0.0687255859375, 0.17626953125, 0.2322998046875, 0.170654296875, 0....	embed
38812627_c1	38812627	haskell	1	boringCmp p x y = return (p x y) -- Arbitrary ordering in a non-deterministic context cmp :: MonadPlus m => Comparison a m cmp _ _ = return True <\|> return False -- Ordering lifted into a non-deterministic context liftCmp :: MonadPlus m => (a -> a -> Bool) -> Comparison a m liftCmp p x y = let b = p x y in return b <\|...	boringCmp p x y = return (p x y) -- Arbitrary ordering in a non-deterministic context cmp :: MonadPlus m => Comparison a m cmp _ _ = return True <\|> return False -- Ordering lifted into a non-deterministic context liftCmp :: MonadPlus m => (a -> a -> Bool) -> Comparison a m liftCmp p x y = let b = p x y in return b <\|...	[ -0.031494140625, 0.032470703125, 0.02783203125, -0.0034942626953125, 0.0106201171875, 0.014892578125, -0.003875732421875, -0.0255126953125, 0.003387451171875, -0.005584716796875, 0.005157470703125, 0.0198974609375, 0.0177001953125, 0.0019989013671875, -0.00144195556640625, 0.0004386901...	[ 3017, 214, 441, 2676, 915, 1022, 113, 2203, 30646, 254, 4210, 242522, 1294, 12989, 23, 351, 112, 30524, 48242, 43701, 1827, 1984, 60331, 71, 88225, 347, 44357, 113307, 40514, 10, 101, 87599, 22225, 184, 81206, 60520, 297, 3934, 33079, 246...	[ 0.2607421875, 0.2122802734375, 0.05340576171875, 0.267822265625, 0.1048583984375, 0.1416015625, 0.2080078125, 0.102783203125, 0.25244140625, 0.1884765625, 0.0675048828125, 0.244384765625, 0.1385498046875, 0.253173828125, 0.0310821533203125, 0.154296875, 0.09429931640625, 0.18676757...	embed
2767295_c0	2767295	haskell	0	Title: For reliable code, NModel, Spec Explorer, F# or other? Problem title: For reliable code, NModel, Spec Explorer, F# or other? Tags: asml, code-contracts, haskell, nmodel, specifications Problem: For reliable code, NModel, Spec Explorer, F# or other? I've got a business app in C#, with unit tests. Can I increase t...	For reliable code, NModel, Spec Explorer, F# or other? For reliable code, NModel, Spec Explorer, F# or other? asml code-contracts haskell nmodel specifications NModel Spec Explorer For reliable code, NModel, Spec Explorer, F# or other? I've got a business app in C#, with unit tests. Can I increase the reliability and c...	[ 0.007659912109375, 0.01300048828125, 0.005950927734375, 0.0035552978515625, -0.0023193359375, -0.00836181640625, 0.0034942626953125, 0.0087890625, 0.0057373046875, -0.015869140625, -0.02587890625, -0.01177978515625, -0.00897216796875, 0.005157470703125, 0.0224609375, 0.013671875, 0.0...	[ 1326, 215543, 18151, 541, 140290, 24990, 56489, 563, 4904, 3789, 32, 707, 237, 7237, 184103, 7, 1556, 142508, 653, 51734, 71679, 5256, 87, 4163, 8063, 4027, 23, 313, 678, 25072, 109921, 4171, 51312, 28702, 41159, 59226, 7565, 134234, 1733, ...	[ 0.111572265625, 0.245361328125, 0.239990234375, 0.1639404296875, 0.294189453125, 0.2088623046875, 0.271484375, 0.099365234375, 0.1812744140625, 0.0667724609375, 0.00958251953125, 0.06793212890625, 0.04833984375, 0.1724853515625, 0.1812744140625, 0.002044677734375, 0.09014892578125, ...	embed
44332590_c1	44332590	haskell	1	(Eq, Read, Show) instance Excludes [ExcludeProp] where excludes qs _wset mst _wrs = flip filterM (integrate' mst) $ \w -> fmap (getAny . mconcat) . sequenceA . map (fmap Any . flip runQuery w . toQuery) $ qs toQuery :: ExcludeProp -> Query Bool toQuery (ExcludeClassName s) = className =? s which can be used in the lay...	(Eq, Read, Show) instance Excludes [ExcludeProp] where excludes qs _wset mst _wrs = flip filterM (integrate' mst) $ \w -> fmap (getAny . mconcat) . sequenceA . map (fmap Any . flip runQuery w . toQuery) $ qs toQuery :: ExcludeProp -> Query Bool toQuery (ExcludeClassName s) = className =? s which can be used in the lay...	[ 0.01025390625, 0.0059814453125, -0.006591796875, -0.00360107421875, 0.00628662109375, -0.0034332275390625, 0.00347900390625, -0.02587890625, 0.016357421875, -0.0067138671875, -0.005950927734375, 0.0277099609375, 0.02392578125, -0.00021076202392578125, -0.024658203125, 0.01458740234375,...	[ 864, 4764, 17367, 110527, 110823, 822, 988, 19279, 29786, 112, 10752, 254, 39041, 8096, 434, 3509, 271, 5429, 7, 147505, 46312, 594, 100743, 62346, 299, 4460, 22288, 28541, 41732, 47, 58836, 2460, 929, 1294, 140803, 163612, 91, 18507, 11814...	[ 0.1319580078125, 0.1741943359375, 0.1641845703125, 0.207275390625, 0.1375732421875, 0.2047119140625, 0.1282958984375, 0.051727294921875, 0.169677734375, 0.108642578125, 0.155517578125, 0.1048583984375, 0.182861328125, 0.080322265625, 0.046478271484375, 0.169677734375, 0.0579223632812...	embed
48313442_c1	48313442	haskell	1	specified by relative directory name packages: - . - ./compdata - ./comptrans - ./compstrat - location: git: git@github.com:jkoppel/language-java.git commit: 68e71843294b233c36b3cbe52d9b1e35a5898997 extra-dep: true - location: git: git@github.com:dvekeman/language-c.git commit: caf4888d6c32d97f57d5107db3369e90b5d2649e...	specified by relative directory name packages: - . - ./compdata - ./comptrans - ./compstrat - location: git: git@github.com:jkoppel/language-java.git commit: 68e71843294b233c36b3cbe52d9b1e35a5898997 extra-dep: true - location: git: git@github.com:dvekeman/language-c.git commit: caf4888d6c32d97f57d5107db3369e90b5d2649e...	[ -0.019775390625, -0.00201416015625, 0.02587890625, 0.01708984375, 0.01007080078125, 0.0220947265625, -0.007049560546875, 0.00860595703125, 0.00555419921875, 0.022216796875, -0.0206298828125, -0.0079345703125, -0.005096435546875, 0.01708984375, -0.0172119140625, 0.0106201171875, -0.00...	[ 58735, 297, 390, 35845, 14364, 53, 9351, 98169, 12, 64, 58875, 10135, 30145, 2816, 18, 31913, 62270, 15769, 32102, 170, 265, 36737, 196651, 24071, 375, 4007, 12045, 4173, 112, 254, 29568, 15116, 62368, 238, 377, 420, 33554, 6493, 50828, 4...	[ 0.25830078125, 0.08233642578125, 0.091796875, 0.29736328125, 0.17431640625, 0.0946044921875, 0.1573486328125, 0.299072265625, 0.00537109375, 0.0245361328125, 0.167724609375, 0.2249755859375, 0.2247314453125, 0.1715087890625, 0.13232421875, 0.15966796875, 0.20361328125, 0.2418212890...	embed
7717691_c0	7717691	haskell	0	Title: Why is the minimalist, example Haskell quicksort not a "true" quicksort? Problem title: Why is the minimalist, example Haskell quicksort not a "true" quicksort? Tags: sorting, quicksort, haskell Problem: Why is the minimalist, example Haskell quicksort not a "true" quicksort? Haskell's websit...	Why is the minimalist, example Haskell quicksort not a "true" quicksort? Why is the minimalist, example Haskell quicksort not a "true" quicksort? sorting quicksort haskell Why Haskell p:xs n-1 h-1 l-1 Why is the minimalist, example Haskell quicksort not a "true" quicksort? Haskell's website introduc...	[ 0.0118408203125, 0.0206298828125, 0.0341796875, -0.031494140625, -0.01214599609375, 0.000759124755859375, 0.0022430419921875, -0.0181884765625, 0.0022430419921875, 0.021240234375, 0.01251220703125, 0.00958251953125, -0.0257568359375, -0.0235595703125, -0.000331878662109375, 0.003128051...	[ 44084, 163504, 27781, 20625, 142508, 63773, 62351, 959, 9774, 13, 83, 12096, 214, 1556, 915, 12, 425, 653, 5759, 1096, 96, 4165, 65508, 4552, 225530, 8967, 2256, 32354, 35064, 26698, 882, 23, 313, 3126, 11389, 8951, 9191, 66747, 44891, 56...	[ 0.12060546875, 0.2354736328125, 0.154052734375, 0.1341552734375, 0.2705078125, 0.185546875, 0.279296875, 0.1116943359375, 0.158447265625, 0.03265380859375, 0.0255279541015625, 0.191650390625, 0.030609130859375, 0.0982666015625, 0.08154296875, 0.029937744140625, 0.080810546875, 0.03...	embed
57772488_c0	57772488	haskell	0	Title: How does function composition (.) work from within? Problem title: How does function composition (.) work from within? Tags: syntax, function-composition, lambda, haskell Problem: How does function composition (.) work from within? I am studying Haskell. Currently, I am studying function composition. I understan...	How does function composition (.) work from within? How does function composition (.) work from within? syntax function-composition lambda haskell within How How does function composition (.) work from within? I am studying Haskell. Currently, I am studying function composition. I understand (at least on a basic level)...	[ -0.00396728515625, 0.02587890625, 0.00194549560546875, 0.0079345703125, -0.015869140625, 0.00933837890625, -0.006988525390625, 0.0024261474609375, -0.007293701171875, -0.0213623046875, -0.00811767578125, 0.00144195556640625, -0.0172119140625, -0.0036773681640625, -0.00124359130859375, ...	[ 11249, 14602, 32354, 166577, 5, 4488, 1295, 28032, 6002, 86531, 277, 40322, 21, 6492, 85, 1556, 142508, 35187, 20625, 28219, 17366, 3642, 831, 11814, 6626, 959, 33342, 28960, 10644, 21635, 1363, 275, 33079, 501, 876, 85590, 26950, 1238, 517...	[ 0.0986328125, 0.0975341796875, 0.2462158203125, 0.274658203125, 0.136474609375, 0.16064453125, 0.1473388671875, 0.219482421875, 0.0919189453125, 0.134033203125, 0.156005859375, 0.14990234375, 0.061187744140625, 0.18603515625, 0.1578369140625, 0.1387939453125, 0.235595703125, 0.0065...	embed
38521481_c0	38521481	haskell	0	Title: Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? Problem title: Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? Tags: haskell, casting, dynamic Problem: Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full...	Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? haskell casting dynamic Haskell Dynamic TypeRep Show Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? If ...	[ 0.011962890625, -0.004730224609375, 0.018310546875, 0.0303955078125, -0.00079345703125, 0.00738525390625, -0.00927734375, -0.006744384765625, -0.00146484375, -0.0164794921875, -0.033935546875, -0.044189453125, -0.016845703125, 0.00433349609375, -0.0086669921875, -0.00165557861328125, ...	[ 20625, 142508, 73327, 21068, 196707, 4332, 254, 125663, 110527, 10644, 67413, 15490, 141956, 4393, 1556, 176050, 84079, 60457, 17367, 70541, 7413, 95307, 51529, 11782, 32354, 3714, 60213, 69201, 29479, 3917, 110934, 11675, 8305, 139392, 5303, 756...	[ 0.093505859375, 0.2103271484375, 0.12451171875, 0.114013671875, 0.157470703125, 0.172119140625, 0.156005859375, 0.1761474609375, 0.173828125, 0.1939697265625, 0.2149658203125, 0.09674072265625, 0.124267578125, 0.093017578125, 0.09033203125, 0.1396484375, 0.1673583984375, 0.20324707...	embed
3969413_c0	3969413	haskell	0	Title: How to use fromInteger with no implicit prelude in Haskell? Problem title: How to use fromInteger with no implicit prelude in Haskell? Tags: haskell, ghc Problem: How to use fromInteger with no implicit prelude in Haskell? The following program yields an error in ghci: {-# LANGUAGE NoImplicitPrelude #-} import P...	How to use fromInteger with no implicit prelude in Haskell? How to use fromInteger with no implicit prelude in Haskell? haskell ghc Prelude qualified How Haskell LANGUAGE NoImplicitPrelude Integer Bool Discrete Monoid fromInteger.hs:17:16 Possible Prelude.undefined How to use fromInteger with no implicit prelude in Has...	[ -0.02490234375, -0.004302978515625, -0.002777099609375, 0.012939453125, -0.0057373046875, 0.0294189453125, 0.0294189453125, -0.0074462890625, -0.0037078857421875, -0.050048828125, -0.0115966796875, -0.005126953125, -0.0159912109375, 0.00193023681640625, 0.00592041015625, -0.02453613281...	[ 11249, 4527, 1295, 4153, 67, 1505, 110, 165164, 479, 822, 112, 20625, 142508, 678, 1556, 31380, 238, 1914, 217225, 98064, 438, 128878, 60923, 19273, 44401, 2460, 929, 53092, 38417, 77879, 532, 22354, 115861, 5983, 23, 1528, 18499, 318, 3002...	[ 0.0243682861328125, 0.1114501953125, 0.22705078125, 0.07257080078125, 0.164794921875, 0.1722412109375, 0.104248046875, 0.2158203125, 0.06878662109375, 0.1785888671875, 0.1146240234375, 0.121826171875, 0.22119140625, 0.01080322265625, 0.09063720703125, 0.071533203125, 0.0406494140625,...	embed
28563342_c1	28563342	haskell	1	) Examples with conversion and immediate freeing allocating in Haskell: fdRead (here allocaBytes must care for the freeing): -- ----------------------------------------------------------------------------- -- fd{Read,Write} -- \| Read data from an 'Fd' and convert it to a 'String' using the locale encoding. -- Throws an...	) Examples with conversion and immediate freeing allocating in Haskell: fdRead (here allocaBytes must care for the freeing): -- ----------------------------------------------------------------------------- -- fd{Read,Write} -- \| Read data from an 'Fd' and convert it to a 'String' using the locale encoding. -- Throws an...	[ 0.016845703125, 0.0003814697265625, 0.000507354736328125, -0.02294921875, 0.00543212890625, 0.024658203125, 0.009765625, -0.01361083984375, 0.0084228515625, 0.01239013671875, 0.02783203125, -0.0322265625, 0.00665283203125, 0.00933837890625, 0.0029296875, -0.0234375, 0.00262451171875,...	[ 1388, 89536, 99726, 678, 142477, 136, 168894, 4092, 214, 144, 116292, 23, 20625, 142508, 1238, 71, 31345, 35593, 24286, 408, 75358, 1636, 8110, 517, 4, 1456, 18781, 58745, 4764, 2053, 1295, 919, 96760, 47, 10, 71713, 17368, 29096, 22, 587...	[ 0.01361083984375, 0.1798095703125, 0.1229248046875, 0.050445556640625, 0.2122802734375, 0.0640869140625, 0.2078857421875, 0.19189453125, 0.1121826171875, 0.13671875, 0.2176513671875, 0.043792724609375, 0.18017578125, 0.300048828125, 0.125, 0.1737060546875, 0.29541015625, 0.00201416...	embed
20127170_c0	20127170	haskell	0	Title: Haskell do while loop Problem title: Haskell do while loop Tags: haskell, while-loop Problem: Haskell do while loop im new to Haskell and dont understand how haskell handles recursion. Ive been working on this for months and just cant figure it out. My project is due in a few days, so im asking for any help or a...	Haskell do while loop Haskell do while loop haskell while-loop Haskell Haskell do while loop im new to Haskell and dont understand how haskell handles recursion. Ive been working on this for months and just cant figure it out. My project is due in a few days, so im asking for any help or advice! My project description ...	[ -0.01202392578125, 0.00188446044921875, 0.01336669921875, 0.00250244140625, 0.011962890625, 0.0240478515625, 0.003448486328125, -0.0118408203125, 0.01141357421875, -0.0302734375, 0.000698089599609375, -0.0157470703125, -0.02685546875, 0.013427734375, 0.01611328125, 0.01287841796875, ...	[ 20625, 142508, 54, 12960, 40956, 1556, 28354, 566, 3525, 13319, 28219, 3642, 34831, 7, 195625, 1830, 20697, 21775, 45767, 26366, 1810, 13452, 4743, 10846, 13312, 113292, 4358, 67660, 76811, 765, 361, 135421, 8080, 678, 17262, 1234, 379, 939, ...	[ 0.125, 0.204833984375, 0.0986328125, 0.2386474609375, 0.2244873046875, 0.1580810546875, 0.2066650390625, 0.07373046875, 0.022003173828125, 0.06561279296875, 0.0914306640625, 0.0219879150390625, 0.12353515625, 0.024749755859375, 0.2156982421875, 0.125732421875, 0.0538330078125, 0.05...	embed
2363264_c1	2363264	haskell	1	a' = Ambulance "ABC" s [c] AmbSys> let s'' = Station "London" [a'] AmbSys> let system_state = SystemState [s''] [a'] [c] *AmbSys> system_state SystemState [Station {stName = "London", stAmbulances = [Ambulance {amCallSign = "ABC", amStation = Station {stName = "London", stAmbulances = []}, amCrew = [Crew {crName = "...	a' = Ambulance "ABC" s [c] AmbSys> let s'' = Station "London" [a'] AmbSys> let system_state = SystemState [s''] [a'] [c] *AmbSys> system_state SystemState [Station {stName = "London", stAmbulances = [Ambulance {amCallSign = "ABC", amStation = Station {stName = "London", stAmbulances = []}, amCrew = [Crew {crName = "...	[ 0.00439453125, 0.01031494140625, -0.00653076171875, 0.0257568359375, 0.023193359375, 0.00750732421875, -0.00787353515625, -0.00494384765625, 0.01318359375, -0.006439208984375, 0.0023651123046875, 0.017333984375, 0.0107421875, -0.0064697265625, -0.008544921875, -0.01544189453125, 0.00...	[ 10, 25, 2203, 10250, 202, 7154, 186944, 91, 238, 661, 150567, 65183, 2633, 4765, 38488, 231454, 2740, 5426, 61340, 12353, 135206, 7, 11, 22062, 271, 6138, 302, 5584, 218723, 444, 63784, 23150, 98385, 37700, 8374, 20320, 17726, 939, 22225, ...	[ 0.1090087890625, 0.120361328125, 0.1007080078125, 0.17138671875, 0.2149658203125, 0.172607421875, 0.1656494140625, 0.1341552734375, 0.042724609375, 0.0042724609375, 0.1837158203125, 0.1400146484375, 0.08074951171875, 0.1431884765625, 0.1932373046875, 0.1883544921875, 0.00375366210937...	embed
23821105_c0	23821105	haskell	0	Title: what's the meaning of "you do computations in Haskell by declaring what something is instead of declaring how you get it"? Problem title: what's the meaning of "you do computations in Haskell by declaring what something is instead of declaring how you get it"? Tags: haskell Problem:...	what's the meaning of "you do computations in Haskell by declaring what something is instead of declaring how you get it"? what's the meaning of "you do computations in Haskell by declaring what something is instead of declaring how you get it"? haskell Haskell Num x:xs what's the meaning ...	[ 0.002655029296875, 0.025390625, 0.00872802734375, 0.00830078125, -0.0023956298828125, 0.01513671875, 0.0078125, -0.00164794921875, 0.031494140625, -0.02880859375, 0.007232666015625, -0.0289306640625, 0.001556396484375, 0.00104522705078125, -0.0096435546875, 0.0142822265625, 0.0172119...	[ 2367, 3768, 91084, 53927, 54, 181135, 5256, 23, 20625, 142508, 390, 8, 18347, 2852, 9844, 83, 64457, 111, 3642, 2046, 442, 1556, 52782, 1022, 12, 425, 123309, 56037, 46876, 55076, 16454, 30698, 398, 76811, 119598, 9077, 28219, 66161, 3444, ...	[ 0.1385498046875, 0.0960693359375, 0.196044921875, 0.07794189453125, 0.1053466796875, 0.2115478515625, 0.122314453125, 0.05975341796875, 0.159912109375, 0.2578125, 0.0557861328125, 0.1019287109375, 0.1583251953125, 0.06890869140625, 0.1416015625, 0.1156005859375, 0.14453125, 0.00695...	embed
39399162_c0	39399162	haskell	0	Title: Building a simple DSL in Haskell with C++ interop Problem title: Building a simple DSL in Haskell with C++ interop Tags: soft-real-time, dsl, c%2B%2B, haskell, testing Problem: Building a simple DSL in Haskell with C++ interop I'm designing a simple interpreted language for testing real-time embedded systems. Th...	Building a simple DSL in Haskell with C++ interop Building a simple DSL in Haskell with C++ interop soft-real-time dsl c%2B%2B haskell testing Building DSL Haskell Building a simple DSL in Haskell with C++ interop I'm designing a simple interpreted language for testing real-time embedded systems. The control flow is se...	[ 0.0186767578125, 0.007293701171875, -0.000881195068359375, 0.01043701171875, 0.00677490234375, -0.00191497802734375, -0.00799560546875, 0.00830078125, -0.0130615234375, -0.03466796875, -0.004150390625, -0.03369140625, -0.017578125, 0.01531982421875, 0.00147247314453125, 0.0230712890625...	[ 104919, 8781, 114479, 23, 20625, 142508, 678, 313, 37223, 1940, 2146, 32977, 30544, 6032, 104, 24861, 1556, 134234, 4331, 29481, 46876, 2773, 55720, 69819, 76519, 6226, 86608, 141591, 173072, 22691, 37515, 201939, 142027, 26499, 1221, 997, 4989...	[ 0.148681640625, 0.18310546875, 0.221435546875, 0.046295166015625, 0.160888671875, 0.25390625, 0.03997802734375, 0.016021728515625, 0.255126953125, 0.138427734375, 0.2098388671875, 0.186279296875, 0.1217041015625, 0.10174560546875, 0.01416015625, 0.1600341796875, 0.116943359375, 0.2...	embed
40879983_c0	40879983	haskell	0	Title: What sort of iterations does GHC do while compiling patterns? Problem title: What sort of iterations does GHC do while compiling patterns? Tags: haskell, ghc, pattern-matching Problem: What sort of iterations does GHC do while compiling patterns? I just wrote a function for making a move in Tic-Tac-Toe. I wanted...	What sort of iterations does GHC do while compiling patterns? What sort of iterations does GHC do while compiling patterns? haskell ghc pattern-matching What GHC m12 m13 m21 m22 m23 m31 m32 m33 Mark Show Pattern mov1 Use What sort of iterations does GHC do while compiling patterns? I just wrote a function for making a ...	[ 0.00445556640625, -0.003082275390625, 0.018798828125, 0.004608154296875, 0.007781982421875, 0.0010986328125, -0.02490234375, -0.00390625, 0.010498046875, -0.0069580078125, -0.005126953125, -0.0220947265625, 0.017333984375, -0.011962890625, 0.006011962890625, 0.00640869140625, 0.00393...	[ 12096, 17, 720, 21094, 527, 73265, 54, 12960, 9969, 49725, 103510, 1556, 142508, 31380, 238, 98753, 214, 4865, 1530, 2681, 3117, 3742, 5016, 6460, 9185, 7880, 17367, 9876, 22766, 30464, 418, 36836, 54397, 32354, 25813, 133552, 618, 2263, 77...	[ 0.1026611328125, 0.0697021484375, 0.2279052734375, 0.1380615234375, 0.0989990234375, 0.2218017578125, 0.041656494140625, 0.05816650390625, 0.11181640625, 0.09033203125, 0.217529296875, 0.10125732421875, 0.20703125, 0.1226806640625, 0.106689453125, 0.17236328125, 0.025299072265625, ...	embed
74536026_c0	74536026	haskell	0	Title: Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" Problem title: Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" Tags: haskell Problem: Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" I am trying to work through Write Yourself a Scheme in 48 Hours...	Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" haskell System.Environment Text.ParserCombinators.Parsec Problem Chapter Write Yourself Scheme Hours Main Parser Char Left Right Found simpleparser1.hs Compiling simplepars...	[ -0.00579833984375, 0.0079345703125, -0.0189208984375, 0.034912109375, -0.01361083984375, 0.0205078125, 0.00107574462890625, -0.01409912109375, -0.007293701171875, -0.0125732421875, 0.01123046875, -0.0294189453125, 0.004302978515625, -0.010986328125, 0.000904083251953125, 0.0048828125, ...	[ 15649, 678, 117615, 116, 1456, 18781, 14804, 39379, 10, 34702, 282, 23, 4572, 133250, 1556, 142508, 12353, 1900, 24129, 28636, 2189, 19155, 39797, 601, 12321, 2392, 21656, 2480, 90911, 215624, 8781, 2500, 127, 15612, 31, 12221, 184, 4488, 2...	[ 0.1368408203125, 0.048828125, 0.137939453125, 0.1885986328125, 0.026824951171875, 0.1429443359375, 0.077392578125, 0.12939453125, 0.058624267578125, 0.189453125, 0.1640625, 0.0550537109375, 0.217529296875, 0.2108154296875, 0.0955810546875, 0.213623046875, 0.0888671875, 0.0239562988...	embed
77937737_c1	77937737	haskell	1	\"}" :: Maybe Value) where foo = decode . E.encodeUtf8 . T.pack fails to compile, with error • Couldn't match type ‘bytestring-0.11.5.3:Data.ByteString.Internal.Type.ByteString’ with ‘Data.ByteString.Lazy.Internal.ByteString’ Expected: Data.Text.Internal.Text -> Data.ByteString.Lazy.Internal.ByteString Actual: Data.Tex...	\"}" :: Maybe Value) where foo = decode . E.encodeUtf8 . T.pack fails to compile, with error • Couldn't match type ‘bytestring-0.11.5.3:Data.ByteString.Internal.Type.ByteString’ with ‘Data.ByteString.Lazy.Internal.ByteString’ Expected: Data.Text.Internal.Text -> Data.ByteString.Lazy.Internal.ByteString Actual: Data.Tex...	[ 0.00970458984375, -0.0184326171875, 0.005523681640625, 0.01214599609375, -0.0142822265625, -0.007354736328125, 0.003692626953125, 0.0062255859375, -0.01080322265625, 0.029296875, -0.0029144287109375, 0.016357421875, 0.0137939453125, 0.0021209716796875, -0.00162506103515625, -0.01458740...	[ 6, 41872, 58, 8152, 1984, 83425, 190060, 16, 7440, 5775, 31, 8, 40899, 241, 33, 106742, 420, 1019, 384, 29102, 35782, 7, 47, 9969, 1340, 678, 18499, 768, 191147, 18, 14858, 10644, 61028, 91693, 102014, 42876, 363, 137989, 75358, 71713, ...	[ 0.0048828125, 0.1533203125, 0.128173828125, 0.1553955078125, 0.1435546875, 0.31005859375, 0.29296875, 0.005584716796875, 0.03472900390625, 0.147705078125, 0.144287109375, 0.1712646484375, 0.253662109375, 0.10516357421875, 0.048492431640625, 0.029266357421875, 0.079345703125, 0.1677...	embed
20806157_c1	20806157	haskell	1	) "1 2" I have checked the code of gshow that does something similar to what I need, but I can't figure out how it works. If I try to import its code into GHCI I get an error: > let gshows = (\t -> showChar '(' . (showString . showConstr . toConstr $ t) . (foldr (.) id . gmapQ ((showChar ' ' .) . gshows) $ t) . showCha...	) "1 2" I have checked the code of gshow that does something similar to what I need, but I can't figure out how it works. If I try to import its code into GHCI I get an error: > let gshows = (\t -> showChar '(' . (showString . showConstr . toConstr $ t) . (foldr (.) id . gmapQ ((showChar ' ' .) . gshows) $ t) . showCha...	[ -0.000202178955078125, 0.00160980224609375, 0.00168609619140625, 0.0169677734375, 0.006927490234375, 0.023193359375, 0.003326416015625, -0.0224609375, 0.01483154296875, -0.0072021484375, -0.01324462890625, -0.0184326171875, 0.00167083740234375, 0.01025390625, -0.01019287109375, 0.01318...	[ 1388, 418, 116, 12765, 18151, 706, 31374, 14602, 21373, 3871, 831, 18, 26366, 3642, 442, 43240, 24927, 3934, 41877, 17304, 18499, 2633, 7639, 84068, 71713, 9297, 47, 3650, 808, 42822, 3447, 62346, 2737, 3355, 23351, 17367, 294, 10433, 71232...	[ 0.006591796875, 0.02764892578125, 0.1407470703125, 0.078369140625, 0.1806640625, 0.100830078125, 0.277587890625, 0.02740478515625, 0.0946044921875, 0.120361328125, 0.031494140625, 0.04644775390625, 0.06903076171875, 0.0543212890625, 0.03436279296875, 0.1348876953125, 0.1917724609375,...	embed
74313610_c1	74313610	haskell	1	:: Patient janeESmith = Patient (NameWithMiddle "Jane" "Elizabeth" "Smith") Female 28 62 140 (BloodType AB Pos) getName :: Patient -> Name getName (Patient n _ _ _ _ _) = n getAge :: Patient -> Int getAge (Patient _ _ a _ _ _) = a getBloodType :: Patient -> BloodType getBloodType (Patient _ _ _ _ _ bt) = bt main = do ...	:: Patient janeESmith = Patient (NameWithMiddle "Jane" "Elizabeth" "Smith") Female 28 62 140 (BloodType AB Pos) getName :: Patient -> Name getName (Patient n _ _ _ _ _) = n getAge :: Patient -> Int getAge (Patient _ _ a _ _ _) = a getBloodType :: Patient -> BloodType getBloodType (Patient _ _ _ _ _ bt) = bt main = do ...	[ 0.004913330078125, 0.0167236328125, 0.01904296875, 0.0203857421875, -0.0157470703125, 0.020263671875, -0.0172119140625, -0.006103515625, -0.01202392578125, -0.008056640625, 0.0030517578125, 0.005157470703125, 0.021484375, -0.01226806640625, -0.010498046875, -0.0380859375, 0.009643554...	[ 1984, 135004, 47363, 6706, 266, 927, 2203, 163612, 194583, 594, 532, 19298, 6979, 86, 647, 39998, 86077, 213342, 1372, 10031, 12664, 571, 91841, 196707, 11321, 13498, 2046, 33079, 15757, 8335, 118, 2517, 653, 284, 429, 105591, 18, 876, 5201...	[ 0.08331298828125, 0.2646484375, 0.2071533203125, 0.0643310546875, 0.1895751953125, 0.1732177734375, 0.0277557373046875, 0.208251953125, 0.1285400390625, 0.005828857421875, 0.08636474609375, 0.1026611328125, 0.1534423828125, 0.1468505859375, 0.00628662109375, 0.06805419921875, 0.14807...	embed
69479166_c1	69479166	haskell	1	k \| k <- [1 .. x], x `mod` k == 0]) == y]' In the expression: [(sum [k \| k <- [1 .. x], x `mod` k == 0]) == y] && [(sum [i \| i <- [1 .. y], y `mod` i == 0]) == x] In an equation for `areAmicableNumbers': areAmicableNumbers x y = [(sum [k \| k <- [1 .. x], x `mod` k == 0]) == y] && [(sum [i \| i <- [1 .. y], y `mod` i == ...	k \| k <- [1 .. x], x `mod` k == 0]) == y]' In the expression: [(sum [k \| k <- [1 .. x], x `mod` k == 0]) == y] && [(sum [i \| i <- [1 .. y], y `mod` i == 0]) == x] In an equation for `areAmicableNumbers': areAmicableNumbers x y = [(sum [k \| k <- [1 .. x], x `mod` k == 0]) == y] && [(sum [i \| i <- [1 .. y], y `mod` i == ...	[ -0.0286865234375, -0.006072998046875, 0.003082275390625, 0.00811767578125, 0.01495361328125, 0.018310546875, -0.01025390625, 0.01080322265625, 0.0137939453125, 0.0390625, 0.012939453125, -0.00153350830078125, 0.0022735595703125, 0.002288818359375, -0.001922607421875, 0.00628662109375, ...	[ 472, 58745, 4426, 9, 68252, 1468, 1022, 13415, 69112, 757, 113, 25, 360, 125195, 11832, 92, 619, 1230, 17, 28, 5490, 1046, 284, 16409, 2661, 18444, 26278, 7, 621, 2203, 1105, 145407, 53, 16377, 2005, 18244, 418, 127, 24864, 6873, 18499,...	[ 0.230712890625, 0.1072998046875, 0.172607421875, 0.2113037109375, 0.1268310546875, 0.076416015625, 0.1304931640625, 0.2227783203125, 0.17626953125, 0.1812744140625, 0.1866455078125, 0.0240478515625, 0.06512451171875, 0.270751953125, 0.28271484375, 0.219482421875, 0.1080322265625, 0...	embed
11657735_c0	11657735	haskell	0	Title: Discrepency in the monad bind and unit function? Problem title: Discrepency in the monad bind and unit function? Tags: haskell, monads Problem: Discrepency in the monad bind and unit function? Problem I am just going through the You Could Have Invented Monads! tutorial, and in the section entitled A Container: M...	Discrepency in the monad bind and unit function? Discrepency in the monad bind and unit function? haskell monads Discrepency Complex Float Double Discrepency in the monad bind and unit function? Problem I am just going through the You Could Have Invented Monads! tutorial, and in the section entitled A Container: Multiv...	[ -0.01153564453125, 0.035400390625, -0.0038909912109375, 0.0147705078125, 0.006500244140625, 0.00007915496826171875, 0.005126953125, -0.00579833984375, -0.00099945068359375, -0.00274658203125, 0.00173187255859375, -0.017578125, 0.01123046875, -0.0047607421875, -0.00421142578125, -0.0166...	[ 53092, 107, 2278, 2408, 23, 2667, 712, 68557, 136, 25072, 32354, 1556, 142508, 113197, 38699, 257, 107172, 15649, 191147, 31901, 16274, 60331, 6468, 57143, 34749, 20037, 19335, 27494, 28670, 10763, 52895, 27140, 108047, 314, 372, 74855, 16666, ...	[ 0.111328125, 0.153076171875, 0.169921875, 0.07623291015625, 0.05438232421875, 0.142333984375, 0.1968994140625, 0.267822265625, 0.1104736328125, 0.220703125, 0.18896484375, 0.0933837890625, 0.224853515625, 0.139404296875, 0.1483154296875, 0.0389404296875, 0.159423828125, 0.066284179...	embed
15082615_c1	15082615	haskell	1	.status let a = unwords (foldr1 (++) (parseMPD x)) rawSystem "notify-send" ["MPD Volume", a] compiles correctly, using the same code in XMonad config int2str :: (Show a, Num a, Ord a) => a -> String int2str x = if x < 10 then '0':sx else sx where sx = show x parseMPD :: MPD.Response MPD.Status -> [[String]] parseMPD (L...	.status let a = unwords (foldr1 (++) (parseMPD x)) rawSystem "notify-send" ["MPD Volume", a] compiles correctly, using the same code in XMonad config int2str :: (Show a, Num a, Ord a) => a -> String int2str x = if x < 10 then '0':sx else sx where sx = show x parseMPD :: MPD.Response MPD.Status -> [[String]] parseMPD (L...	[ -0.0361328125, 0.0157470703125, -0.031982421875, 0.0478515625, -0.01141357421875, 0.040771484375, 0.004058837890625, -0.002777099609375, -0.0079345703125, 0.00360107421875, -0.006805419921875, 0.00457763671875, 0.013427734375, 0.0108642578125, -0.024169921875, 0.01226806640625, -0.02...	[ 5, 45215, 2633, 10, 2203, 51, 47416, 42822, 42, 37223, 2500, 184, 9088, 397, 1022, 49649, 84293, 10869, 40383, 39285, 98872, 9969, 1340, 26785, 17368, 5701, 18151, 1193, 46674, 712, 153837, 23, 18, 304, 9297, 168660, 52782, 35379, 23351, ...	[ 0.1016845703125, 0.25927734375, 0.119873046875, 0.1146240234375, 0.0538330078125, 0.0887451171875, 0.19189453125, 0.0736083984375, 0.0262298583984375, 0.1136474609375, 0.08984375, 0.0316162109375, 0.1221923828125, 0.1578369140625, 0.09552001953125, 0.232421875, 0.156005859375, 0.15...	embed
23766188_c0	23766188	haskell	0	Title: Finding a linear path in a traversable structure Problem title: Finding a linear path in a traversable structure Tags: traversal, haskell, tree Problem: Finding a linear path in a traversable structure Given a list of steps: >>> let path = ["item1", "item2", "item3", "item4", "item5"] And a labeled Tree : >>> im...	Finding a linear path in a traversable structure Finding a linear path in a traversable structure traversal haskell tree Data.Tree Finding item1 item2 item3 item4 item5 Tree Node Foldable Finding a linear path in a traversable structure Given a list of steps: And a labeled Tree : I'd like a function that goes through t...	[ 0.01043701171875, 0.0033416748046875, -0.0036163330078125, 0.00007581710815429688, 0.01104736328125, -0.004669189453125, -0.0169677734375, -0.01129150390625, 0.010498046875, -0.06298828125, -0.004638671875, 0.000583648681640625, -0.01470947265625, 0.0272216796875, 0.005279541015625, 0....	[ 26040, 192617, 60875, 23, 37317, 2886, 45646, 289, 1556, 142508, 53201, 11809, 62731, 35735, 363, 617, 758, 101344, 438, 30077, 71, 5303, 98441, 67967, 297, 1884, 32354, 8305, 14858, 214, 24189, 831, 53333, 1286, 123867, 2288, 3934, 217, 19...	[ 0.1318359375, 0.20947265625, 0.234375, 0.0391845703125, 0.1693115234375, 0.14404296875, 0.17529296875, 0.07568359375, 0.09765625, 0.19970703125, 0.1800537109375, 0.0556640625, 0.1456298828125, 0.134765625, 0.022857666015625, 0.0780029296875, 0.07861328125, 0.24365234375, 0.043792...	embed
49215242_c0	49215242	haskell	0	Title: How to make GHC generate dynamically linked binaries by default? Problem title: How to make GHC generate dynamically linked binaries by default? Tags: haskell, cabal Problem: How to make GHC generate dynamically linked binaries by default? Is it possible to change cabal or GHC settings so that cabal install gene...	How to make GHC generate dynamically linked binaries by default? How to make GHC generate dynamically linked binaries by default? haskell cabal How GHC some_package How to make GHC generate dynamically linked binaries by default? Is it possible to change cabal or GHC settings so that cabal install generates dynamic bin...	[ 0.01336669921875, 0.01123046875, 0.0235595703125, 0.0007476806640625, 0.00689697265625, -0.00677490234375, -0.021484375, 0.0093994140625, 0.004486083984375, -0.0137939453125, -0.02392578125, -0.0400390625, -0.0166015625, -0.000675201416015625, -0.00885009765625, 0.024658203125, 0.018...	[ 11249, 3249, 527, 73265, 139392, 84079, 3126, 297, 23035, 10484, 390, 114977, 1556, 142508, 109524, 29102, 7722, 15549, 53550, 20600, 136, 35773, 17368, 3217, 70147, 1747, 3794, 116890, 23175, 112072, 15490, 20625, 70968, 177261, 44084, 831, 18...	[ 0.0821533203125, 0.1019287109375, 0.131103515625, 0.254150390625, 0.221923828125, 0.23388671875, 0.1929931640625, 0.0216217041015625, 0.218017578125, 0.1356201171875, 0.056671142578125, 0.2442626953125, 0.104736328125, 0.2017822265625, 0.262939453125, 0.1192626953125, 0.098876953125,...	embed
8780183_c0	8780183	haskell	0	Title: Handling events in Haskell Problem title: Handling events in Haskell Tags: ghc, haskell, event-handling, typeclass Problem: Handling events in Haskell I would like to implement the following scenario in Haskell. I have an enumerable set of 'events' defined like this: data MyEvent = Event1 \| Event2 \| Event3 I wan...	Handling events in Haskell Handling events in Haskell ghc haskell event-handling typeclass Handling Haskell MyEvent Event1 Event2 Event3 Handler Event Handling events in Haskell I would like to implement the following scenario in Haskell. I have an enumerable set of 'events' defined like this: I want to define handlers...	[ 0.0048828125, 0.0126953125, 0.0033721923828125, 0.014892578125, -0.0005645751953125, -0.006378173828125, 0.00323486328125, -0.01171875, 0.0032501220703125, -0.05810546875, -0.00775146484375, -0.004547119140625, -0.0166015625, 0.0140380859375, -0.0028076171875, -0.005889892578125, 0.0...	[ 193237, 47353, 23, 20625, 142508, 31380, 238, 1556, 19732, 54885, 10644, 67413, 2646, 192134, 36943, 418, 304, 363, 10639, 603, 2806, 1884, 29479, 25632, 106117, 765, 189085, 2661, 5423, 90141, 61924, 903, 3444, 35863, 7, 100, 6097, 11814, ...	[ 0.241943359375, 0.255126953125, 0.08343505859375, 0.1561279296875, 0.223876953125, 0.07720947265625, 0.06243896484375, 0.1219482421875, 0.1497802734375, 0.2186279296875, 0.2222900390625, 0.1922607421875, 0.099853515625, 0.218505859375, 0.21728515625, 0.025482177734375, 0.027374267578...	embed
31723658_c0	31723658	haskell	0	Title: What do I need to do if I want to install a new version of GHC? Problem title: What do I need to do if I want to install a new version of GHC? Tags: haskell, ghc Problem: What do I need to do if I want to install a new version of GHC? Currently, I am using GHC 7.10.1 on my ubuntu 14.04 system, just now I got not...	What do I need to do if I want to install a new version of GHC? What do I need to do if I want to install a new version of GHC? haskell ghc What GHC x86_64-linux-ghc-7.10.1 x86_64-linux-7.10.1 What do I need to do if I want to install a new version of GHC? Currently, I am using GHC 7.10.1 on my ubuntu 14.04 system, jus...	[ -0.0019378662109375, -0.00151824951171875, 0.029052734375, 0.0186767578125, -0.0062255859375, 0.005584716796875, -0.0224609375, 0.007354736328125, -0.013427734375, 0.0206298828125, 0.006866455078125, -0.034912109375, -0.017333984375, -0.00860595703125, 0.00787353515625, 0.0050659179687...	[ 4865, 3871, 54, 2174, 3444, 47, 20600, 10, 3525, 11389, 111, 527, 73265, 1556, 142508, 31380, 238, 1022, 15276, 13307, 2397, 6077, 9486, 16709, 10179, 418, 17368, 115384, 102014, 198996, 6370, 7709, 5426, 156672, 5303, 70541, 5915, 54608, 7...	[ 0.063720703125, 0.1080322265625, 0.0733642578125, 0.05657958984375, 0.079345703125, 0.060882568359375, 0.2091064453125, 0.03228759765625, 0.173828125, 0.18310546875, 0.119873046875, 0.1644287109375, 0.2783203125, 0.1624755859375, 0.279052734375, 0.175537109375, 0.1446533203125, 0.0...	embed
60331244_c0	60331244	haskell	0	Title: Using hsc2hs with HPack and Stack Problem title: Using hsc2hs with HPack and Stack Tags: preprocessor, hpack, hsc2hs, haskell-stack, haskell Problem: Using hsc2hs with HPack and Stack I'd like to use hsc2hs via Stack and HPack. The problem is, since HPack doesn't allow me to list the .hsc file as a source file, ...	Using hsc2hs with HPack and Stack Using hsc2hs with HPack and Stack preprocessor hpack hsc2hs haskell-stack haskell Using hsc2hs HPack Stack package.yaml sim-ffi.hs Bounce.h Bounce.c sim-ffi.hsc Cabal-simple_mPHDZzAJ_2.4.0.1_ghc-8.6.5 Using hsc2hs with HPack and Stack I'd like to use hsc2hs via Stack and HPack. The pro...	[ -0.0035400390625, 0.02294921875, -0.01202392578125, 0.0167236328125, -0.006591796875, 0.0034637451171875, -0.004669189453125, 0.01007080078125, -0.0157470703125, -0.02099609375, 0.025634765625, -0.015869140625, -0.0004138946533203125, -0.003265380859375, 0.0032806396484375, 0.036132812...	[ 345, 1096, 10382, 304, 127, 7, 678, 572, 205956, 6512, 2594, 479, 63923, 29102, 1556, 142508, 590, 98169, 14520, 141, 10777, 24500, 85018, 30438, 289, 191560, 54259, 25582, 116591, 102014, 17376, 136473, 136, 1884, 4527, 1829, 2967, 63769, ...	[ 0.07464599609375, 0.1170654296875, 0.1451416015625, 0.11669921875, 0.169921875, 0.084228515625, 0.06390380859375, 0.12451171875, 0.236083984375, 0.1005859375, 0.0889892578125, 0.05126953125, 0.034027099609375, 0.1829833984375, 0.095703125, 0.145751953125, 0.05938720703125, 0.146240...	embed
64417268_c1	64417268	haskell	1	0,1)) tree) newStdGen where mapRandom f (Leaf a) = Leaf <$> state f mapRandom f (Unary t1) = Unary <$> mapRandom f t1 mapRandom f (Binary t1 t2) = Binary <$> mapRandom f t1 <> mapRandom f t2 mapRandom f (Ternary t1 t2 t3) = Ternary <$> mapRandom f t1 <> mapRandom f t2 <*> mapRandom f t3 however the compiler gave me t...	0,1)) tree) newStdGen where mapRandom f (Leaf a) = Leaf <$> state f mapRandom f (Unary t1) = Unary <$> mapRandom f t1 mapRandom f (Binary t1 t2) = Binary <$> mapRandom f t1 <> mapRandom f t2 mapRandom f (Ternary t1 t2 t3) = Ternary <$> mapRandom f t1 <> mapRandom f t2 <*> mapRandom f t3 however the compiler gave me t...	[ -0.01025390625, 0.0123291015625, -0.0108642578125, -0.01904296875, -0.01220703125, 0.0189208984375, -0.0023651123046875, -0.0230712890625, -0.0225830078125, -0.052001953125, -0.01312255859375, 0.0086669921875, 0.0020599365234375, 0.02099609375, 0.018798828125, -0.01446533203125, -0.0...	[ 72966, 53201, 3525, 37455, 71, 105376, 22288, 126525, 3815, 1238, 5267, 2407, 10, 636, 11341, 14256, 6635, 808, 17727, 4228, 1294, 54092, 35484, 2994, 76, 363, 9969, 34759, 127, 28565, 31982, 18499, 438, 110527, 17780, 2907, 187, 72219, 452...	[ 0.1650390625, 0.2147216796875, 0.142822265625, 0.1356201171875, 0.0966796875, 0.199951171875, 0.1474609375, 0.1468505859375, 0.1571044921875, 0.087646484375, 0.0212860107421875, 0.1339111328125, 0.093017578125, 0.033538818359375, 0.1063232421875, 0.0509033203125, 0.0400390625, 0.00...	embed
37649093_c0	37649093	haskell	0	Title: stack.yaml not created by stack new on Win7 Problem title: stack.yaml not created by stack new on Win7 Tags: haskell Problem: stack.yaml not created by stack new on Win7 I ran "stack new bahugs franklinchen" on a command prompt window under Win7; stack version is 1.1.2. It did not create a stack.yaml file, and g...	stack.yaml not created by stack new on Win7 stack.yaml not created by stack new on Win7 haskell stack.yaml Win7 msys64 Exec Downloaded lts-6.1 Populated Updating Hackage github.com Counting Resolving Fetched stack.yaml not created by stack new on Win7 I ran "stack new bahugs franklinchen" on a command prompt window und...	[ 0.0019989013671875, 0.0252685546875, 0.007781982421875, 0.01416015625, -0.02197265625, 0.01141357421875, -0.0081787109375, -0.0216064453125, -0.0281982421875, 0.034912109375, -0.0027618408203125, -0.0179443359375, 0.003631591796875, -0.020263671875, -0.00390625, 0.0166015625, 0.00402...	[ 177261, 5, 14520, 141, 959, 75935, 3525, 17686, 966, 98, 1556, 142508, 94924, 13307, 3240, 4857, 933, 173245, 157890, 10091, 56464, 52922, 62270, 32102, 1311, 128396, 132944, 92962, 13028, 590, 2594, 164092, 9405, 88490, 2397, 4834, 75101, 10...	[ 0.260986328125, 0.039520263671875, 0.2103271484375, 0.2384033203125, 0.1116943359375, 0.14404296875, 0.18603515625, 0.1015625, 0.1705322265625, 0.03314208984375, 0.09552001953125, 0.2490234375, 0.095458984375, 0.120849609375, 0.00604248046875, 0.038330078125, 0.043792724609375, 0.1...	embed
40407322_c0	40407322	haskell	0	Title: Haskell - Tuples and Lists as built-in types: how are they actually declared? Problem title: Haskell - Tuples and Lists as built-in types: how are they actually declared? Tags: haskell, typing, tuples, list Problem: Haskell - Tuples and Lists as built-in types: how are they actually declared? In chapter 2 of "A ...	Haskell - Tuples and Lists as built-in types: how are they actually declared? Haskell - Tuples and Lists as built-in types: how are they actually declared? haskell typing tuples list Haskell Tuples Lists Haskell - Tuples and Lists as built-in types: how are they actually declared? In chapter 2 of "A gentle introduction...	[ 0.0103759765625, 0.01275634765625, 0.00616455078125, 0.00445556640625, -0.0087890625, 0.01312255859375, -0.02099609375, -0.0155029296875, 0.014404296875, 0.000476837158203125, 0.01104736328125, -0.036865234375, -0.012939453125, 0.01153564453125, 0.0140380859375, 0.01092529296875, 0.0...	[ 20625, 142508, 1371, 99726, 136, 32036, 237, 88303, 73, 52895, 3642, 20653, 159978, 71, 1556, 11417, 370, 5303, 116, 21507, 39864, 38937, 112, 5983, 189050, 5361, 6002, 86531, 110, 12921, 61924, 8705, 1884, 25632, 53418, 2806, 64209, 54241, ...	[ 0.114990234375, 0.212158203125, 0.1134033203125, 0.2340087890625, 0.09234619140625, 0.1790771484375, 0.0183258056640625, 0.1446533203125, 0.10455322265625, 0.2286376953125, 0.09332275390625, 0.1148681640625, 0.1839599609375, 0.0755615234375, 0.08905029296875, 0.124267578125, 0.121948...	embed
21984769_c0	21984769	haskell	0	Title: Can you formulate the insertion sort as a monoid in Clojure? Problem title: Can you formulate the insertion sort as a monoid in Clojure? Tags: clojure, haskell, insertion-sort, monoids, sorting Problem: Can you formulate the insertion sort as a monoid in Clojure? This is the code for an insertion sort in Clojure...	Can you formulate the insertion sort as a monoid in Clojure? Can you formulate the insertion sort as a monoid in Clojure? clojure haskell insertion-sort monoids sorting Can Clojure Usage Returns Ord Monoid Can you formulate the insertion sort as a monoid in Clojure? This is the code for an insertion sort in Clojure: Th...	[ -0.033935546875, 0.00469970703125, 0.0123291015625, 0.00640869140625, 0.007781982421875, 0.01214599609375, -0.00054931640625, -0.0308837890625, 0.0101318359375, -0.0322265625, -0.0093994140625, 0.01080322265625, -0.0238037109375, -0.0277099609375, -0.005157470703125, -0.003097534179687...	[ 4171, 26168, 67, 241860, 12096, 237, 22460, 532, 51053, 461, 107, 20450, 1556, 142508, 62351, 30185, 70166, 173340, 35379, 77879, 70, 10, 23, 18151, 20625, 33022 ]	[ 0.0819091796875, 0.1949462890625, 0.024993896484375, 0.221923828125, 0.2496337890625, 0.06402587890625, 0.1796875, 0.18310546875, 0.1346435546875, 0.1746826171875, 0.16796875, 0.07958984375, 0.0198822021484375, 0.2109375, 0.197021484375, 0.1146240234375, 0.0772705078125, 0.12048339...	embed
74645202_c0	74645202	haskell	0	Title: Type pattern-matching instead of constructor pattern-matching? Problem title: Type pattern-matching instead of constructor pattern-matching? Tags: haskell Problem: Type pattern-matching instead of constructor pattern-matching? For my uni homework we have to make a PvZ like simple game in Haskell. I have a Plant ...	Type pattern-matching instead of constructor pattern-matching? Type pattern-matching instead of constructor pattern-matching? haskell Type Plant Peashooter Sunflower Walnut CherryBomb Show Ord Bool Type pattern-matching instead of constructor pattern-matching? For my uni homework we have to make a PvZ like simple game ...	[ -0.03662109375, 0.0211181640625, 0.00072479248046875, 0.006866455078125, 0.0185546875, -0.00176239013671875, -0.03125, 0.012939453125, -0.004974365234375, -0.01336669921875, 0.01025390625, 0.0164794921875, 0.00701904296875, -0.013427734375, -0.0186767578125, -0.00433349609375, 0.0074...	[ 60457, 103510, 9, 98753, 214, 64457, 64549, 748, 1556, 142508, 75628, 92931, 105727, 56, 7550, 132641, 25365, 3609, 187243, 12647, 6492, 17367, 35379, 2460, 929, 1326, 759, 19844, 5368, 18244, 436, 334, 1511, 1884, 8781, 6712, 23, 20625, 10...	[ 0.25146484375, 0.2333984375, 0.0450439453125, 0.2509765625, 0.12060546875, 0.123046875, 0.13525390625, 0.08966064453125, 0.131103515625, 0.2445068359375, 0.1964111328125, 0.09197998046875, 0.1728515625, 0.0870361328125, 0.017913818359375, 0.18408203125, 0.0163726806640625, 0.103698...	embed
45301387_c0	45301387	haskell	0	Title: confused about composite function in haskell Problem title: confused about composite function in haskell Tags: haskell Problem: confused about composite function in haskell let f = show.sum.map read.words f "1 2" It work. show.sum.map read.words "1 2" I get errors: <interactive>:19:19: Couldn't match expected ty...	confused about composite function in haskell confused about composite function in haskell haskell it show.sum.map read.words Couldn Relevant Possible Prelude Num Show Foldable confused about composite function in haskell It work. I get errors: I want to know why? (show.sum.map read.words) "1 2" can also work.	[ -0.01611328125, -0.0277099609375, 0.00494384765625, 0.0439453125, -0.0003261566162109375, 0.02685546875, 0.0038299560546875, -0.00372314453125, 0.004302978515625, -0.004913330078125, -0.0306396484375, -0.00933837890625, 0.01165771484375, 0.01031494140625, -0.0157470703125, -0.023193359...	[ 55681, 5281, 1672, 375, 77087, 32354, 1556, 142508, 13, 23, 7639, 11832, 62346, 12301, 47416, 191147, 19, 133, 30624, 115861, 2661, 1914, 822, 112, 52782, 17367, 30077, 71, 2886, 1650, 4488, 18499, 3444, 3714, 15400, 31374, 418, 116, 831 ]	[ 0.142333984375, 0.1011962890625, 0.03302001953125, 0.0933837890625, 0.2425537109375, 0.15869140625, 0.1468505859375, 0.2410888671875, 0.052001953125, 0.03155517578125, 0.1357421875, 0.193603515625, 0.1741943359375, 0.1741943359375, 0.1553955078125, 0.099609375, 0.013763427734375, 0...	embed
79313304_c1	79313304	haskell	1	Int) } deriving Eq instance FakeIO (State MockTerminal) where setCursorPosition y x = modify' $ \m -> MockTerminal { pos = (y, x) } main :: IO () main = do result <- quickCheckResult tCenter unless (isSuccess result) exitFailure 2 directories, 8 files of which: -- src/Main.hs module Main where import Loop main :: IO (...	Int) } deriving Eq instance FakeIO (State MockTerminal) where setCursorPosition y x = modify' $ \m -> MockTerminal { pos = (y, x) } main :: IO () main = do result <- quickCheckResult tCenter unless (isSuccess result) exitFailure 2 directories, 8 files of which: -- src/Main.hs module Main where import Loop main :: IO (...	[ -0.0126953125, 0.01361083984375, 0.007080078125, 0.0067138671875, 0.0174560546875, -0.0016632080078125, -0.0037689208984375, -0.0091552734375, 0, 0.0361328125, 0.022705078125, 0.04443359375, -0.0042724609375, 0.004608154296875, -0.0159912109375, 0.00738525390625, 0.00860595703125, ...	[ 360, 18, 51912, 6496, 864, 110527, 3036, 350, 17780, 135206, 2501, 2594, 35484, 1249, 289, 5423, 474, 4970, 7192, 172, 113, 1022, 2811, 40383, 3650, 39, 3864, 5201, 54, 16750, 63773, 202567, 7, 7136, 808, 174426, 117934, 26531, 82230, 176...	[ 0.0633544921875, 0.091064453125, 0.000946044921875, 0.10638427734375, 0.1695556640625, 0.2205810546875, 0.1590576171875, 0.123291015625, 0.2115478515625, 0.098388671875, 0.164306640625, 0.124755859375, 0.1572265625, 0.18359375, 0.1180419921875, 0.1214599609375, 0.093505859375, 0.11...	embed
56243730_c0	56243730	haskell	0	Title: How to evaluate this generic abstract syntax tree in Haskell? Problem title: How to evaluate this generic abstract syntax tree in Haskell? Tags: gadt, abstract-syntax-tree, tree, functional-programming, haskell Problem: How to evaluate this generic abstract syntax tree in Haskell? I've been interested in seeing ...	How to evaluate this generic abstract syntax tree in Haskell? How to evaluate this generic abstract syntax tree in Haskell? gadt abstract-syntax-tree tree functional-programming haskell op right How Haskell Instead Tree Number Word Operation Leaf LANGUAGE GADTs fivePlus2 Couldn Expected Actual Relevant How to evaluate ...	[ -0.005889892578125, 0.0086669921875, 0.003021240234375, -0.01055908203125, 0.030029296875, -0.0096435546875, -0.0004062652587890625, -0.017578125, -0.004547119140625, -0.038330078125, 0.0021820068359375, -0.02734375, 0.0010528564453125, -0.0025787353515625, -0.01116943359375, 0.0039062...	[ 11249, 151575, 13, 903, 189534, 164789, 6002, 86531, 53201, 20625, 142508, 23, 914, 13384, 12654, 62600, 123309, 28966, 1556, 233, 7108, 175399, 101344, 103332, 22543, 102203, 2407, 98064, 23749, 41072, 43606, 88225, 304, 191147, 60075, 100582, ...	[ 0.05535888671875, 0.1939697265625, 0.04693603515625, 0.06591796875, 0.2042236328125, 0.2220458984375, 0.1273193359375, 0.1656494140625, 0.253173828125, 0.1092529296875, 0.2205810546875, 0.03125, 0.076416015625, 0.1580810546875, 0.101318359375, 0.1895751953125, 0.095458984375, 0.063...	embed
62679154_c1	62679154	haskell	1	:7:46: error: • Couldn't match type ‘[Char]’ with ‘Data.Text.Internal.Text’ Expected type: Data.Text.Internal.Text Actual type: String • In the second argument of ‘RawBlock’, namely ‘pagebreakXml’ In the expression: RawBlock (Format "openxml") pagebreakXml In an equation for ‘pagebreakBlock’: pagebreakBlock = RawBlock ...	:7:46: error: • Couldn't match type ‘[Char]’ with ‘Data.Text.Internal.Text’ Expected type: Data.Text.Internal.Text Actual type: String • In the second argument of ‘RawBlock’, namely ‘pagebreakXml’ In the expression: RawBlock (Format "openxml") pagebreakXml In an equation for ‘pagebreakBlock’: pagebreakBlock = RawBlock ...	[ 0.0047607421875, 0.007171630859375, 0.01251220703125, 0.020263671875, 0.003021240234375, 0.017822265625, 0.0012359619140625, -0.0186767578125, 0.002593994140625, 0.00982666015625, 0.0284423828125, -0.0211181640625, 0.007293701171875, -0.039794921875, -0.000885009765625, 0.0101928710937...	[ 966, 32909, 18499, 768, 191147, 18, 14858, 10644, 1065, 84068, 678, 137989, 174379, 44851, 6236, 60075, 13, 11809, 100582, 23351, 214, 17932, 10750, 12248, 434, 166191, 22469, 70751, 1542, 7237, 125195, 109997, 102973, 59636, 131492, 9191, 5490...	[ 0.018341064453125, 0.22119140625, 0.1927490234375, 0.0253753662109375, 0.233642578125, 0.09228515625, 0.232177734375, 0.2113037109375, 0.0201568603515625, 0.2509765625, 0.088623046875, 0.16015625, 0.238037109375, 0.12890625, 0.115966796875, 0.157958984375, 0.13134765625, 0.13073730...	embed
16359971_c0	16359971	haskell	0	Title: Haskell - Types, Enums, and Functions Problem title: Haskell - Types, Enums, and Functions Tags: function, enums, types, haskell Problem: Haskell - Types, Enums, and Functions Good morning everyone, Here's what I'm working on today, and the issue I'm running in to: --A data Row = A \| B \| C \| D \| E \| F \| G \| H \| ...	Haskell - Types, Enums, and Functions Haskell - Types, Enums, and Functions function enums types haskell Haskell Types Enums Functions Row Enum Ord Show Bounded Read Column One Two Three Four Five Six Seven Eight Nine Ten Address Haskell - Types, Enums, and Functions Good morning everyone, Here's what I'm working on to...	[ 0.01055908203125, -0.007171630859375, 0.006195068359375, 0.015625, -0.01373291015625, 0.0012969970703125, -0.0107421875, 0.0032806396484375, -0.00537109375, -0.0021514892578125, 0.0096435546875, -0.00872802734375, -0.00701904296875, 0.0185546875, -0.037353515625, -0.0027313232421875, ...	[ 20625, 142508, 60457, 357, 10321, 28670, 32354, 22, 52895, 1556, 96190, 316, 35379, 17367, 335, 167457, 4764, 233987, 6561, 32964, 129335, 65056, 156615, 84247, 132556, 22553, 1520, 5531, 49990, 136, 42141, 30309, 20697, 18925, 31089, 51042, 10...	[ 0.139404296875, 0.2490234375, 0.177001953125, 0.1346435546875, 0.23779296875, 0.10986328125, 0.133544921875, 0.111328125, 0.18505859375, 0.15283203125, 0.2161865234375, 0.2032470703125, 0.152099609375, 0.09759521484375, 0.03369140625, 0.1470947265625, 0.1441650390625, 0.20568847656...	embed
77034184_c0	77034184	haskell	0	Title: Filter between two lists Haskell Problem title: Filter between two lists Haskell Tags: functional-programming, haskell Problem: Filter between two lists Haskell I am working in an exercise where the only solution I could think of is by using a list to filter another one. The exercise is the following: Using comp...	Filter between two lists Haskell Filter between two lists Haskell functional-programming haskell Filter Haskell Double sum.concat Filter between two lists Haskell I am working in an exercise where the only solution I could think of is by using a list to filter another one. The exercise is the following: I found a solut...	[ -0.000148773193359375, -0.0010528564453125, -0.005523681640625, 0.0037994384765625, -0.00830078125, 0.0181884765625, 0.006988525390625, 0.003692626953125, 0.01953125, 0.007476806640625, -0.0166015625, 0.0067138671875, -0.0101318359375, -0.00347900390625, -0.004364013671875, -0.00132751...	[ 128896, 17721, 6626, 5303, 20625, 142508, 123309, 28966, 1556, 107172, 10554, 2271, 4460, 20697, 81979, 4734, 29806, 5351, 17368, 47, 46312, 15700, 1632, 25632, 14037, 15490, 166577, 22288 ]	[ 0.2646484375, 0.172119140625, 0.115478515625, 0.2275390625, 0.1068115234375, 0.215087890625, 0.09869384765625, 0.070068359375, 0.10040283203125, 0.084228515625, 0.1690673828125, 0.048736572265625, 0.170654296875, 0.04669189453125, 0.0888671875, 0.03338623046875, 0.1287841796875, 0....	embed
68488715_c0	68488715	haskell	0	Title: Attoparsec: matching any of strings with common prefix Problem title: Attoparsec: matching any of strings with common prefix Tags: attoparsec, haskell Problem: Attoparsec: matching any of strings with common prefix I am trying to parse a limited set of valid strings which have a common prefix with attoparsec. Ho...	Attoparsec: matching any of strings with common prefix Attoparsec: matching any of strings with common prefix attoparsec haskell Control.Applicative qualified Attoparsec Partial Done LANGUAGE OverloadedStrings Data.Attoparsec.Text Thing Foobar Foobaz Foobarz thingParser1 PT.string thingParser2 PT.parse PT.Partial PT.Do...	[ -0.000820159912109375, -0.00494384765625, -0.01397705078125, 0.0015411376953125, -0.0169677734375, 0.000576019287109375, 0.0098876953125, -0.01373291015625, 0.01123046875, -0.01324462890625, 0.006805419921875, 0.01483154296875, 0.030029296875, 0.01031494140625, -0.0038604736328125, 0.0...	[ 9208, 31, 2500, 39797, 12, 14858, 214, 2499, 111, 79315, 678, 39210, 183114, 243, 1556, 142508, 27131, 11048, 217225, 9148, 289, 984, 86, 98064, 9578, 63033, 71713, 11809, 284, 10628, 174379, 6003, 9572, 1299, 40300, 16159, 14335, 13580, 28...	[ 0.1802978515625, 0.137451171875, 0.1864013671875, 0.25390625, 0.007476806640625, 0.2005615234375, 0.068603515625, 0.1043701171875, 0.105712890625, 0.2216796875, 0.111083984375, 0.1839599609375, 0.257080078125, 0.1600341796875, 0.0867919921875, 0.228515625, 0.1956787109375, 0.034729...	embed
23154774_c0	23154774	haskell	0	Title: Installation of missing C libraries when installing HDBC-Sqlite3 Problem title: Installation of missing C libraries when installing HDBC-Sqlite3 Tags: sqlite, haskell Problem: Installation of missing C libraries when installing HDBC-Sqlite3 I am trying to set up my PC running windows XP to run the Haskell Platfo...	Installation of missing C libraries when installing HDBC-Sqlite3 Installation of missing C libraries when installing HDBC-Sqlite3 sqlite haskell Installation HDBC-Sqlite3 Installation of missing C libraries when installing HDBC-Sqlite3 I am trying to set up my PC running windows XP to run the Haskell Platform and the S...	[ 0.0224609375, 0.01446533203125, -0.002288818359375, 0.0155029296875, -0.00665283203125, 0.0133056640625, 0.0004062652587890625, -0.0128173828125, -0.00148773193359375, 0.0133056640625, 0.002532958984375, -0.068359375, 0.0001506805419921875, 0.004180908203125, -0.01043701171875, -0.0114...	[ 145323, 132283, 313, 35773, 10484, 20600, 4732, 24318, 95255, 67, 363, 1556, 142508, 294, 31577, 5423, 6107, 54825, 45005, 20625, 70968, 80866, 1486, 63399, 116, 78301, 165867, 52922, 7026, 13651, 31913, 13909, 148968, 42724, 6495, 7, 7735, 9...	[ 0.11962890625, 0.1710205078125, 0.1552734375, 0.218505859375, 0.1053466796875, 0.1728515625, 0.14013671875, 0.21923828125, 0.2158203125, 0.1732177734375, 0.16943359375, 0.0826416015625, 0.1954345703125, 0.010894775390625, 0.0146484375, 0.00457763671875, 0.1016845703125, 0.042785644...	embed
64207239_c0	64207239	haskell	0	Title: Generate a list representing a doorbell system Problem title: Generate a list representing a doorbell system Tags: list, haskell, tuples Problem: Generate a list representing a doorbell system I'm trying to generate a list from two Int s and another list of tuples to represent a doorbell system for an apartment ...	Generate a list representing a doorbell system Generate a list representing a doorbell system list haskell tuples Generate Rgt Lft Cent Char Generate a list representing a doorbell system I'm trying to generate a list from two Int s and another list of tuples to represent a doorbell system for an apartment building. Th...	[ -0.01611328125, 0.0125732421875, -0.006439208984375, 0.005706787109375, 0.0013275146484375, 0.0245361328125, -0.019775390625, -0.0022735595703125, -0.01019287109375, 0.0034027099609375, 0.00579833984375, 0.001068115234375, 0.0111083984375, 0.002777099609375, -0.033447265625, -0.0113525...	[ 155370, 67, 5303, 33636, 1911, 70926, 5426, 214, 1556, 142508, 370, 99726, 627, 5386, 2480, 81366, 21656, 31577, 139392, 1295, 6626, 360, 18, 91, 127451, 33976, 5117, 14012, 74912, 17932, 246, 19, 32316, 1177, 88203, 113068, 100, 27781, 209...	[ 0.20263671875, 0.03692626953125, 0.2296142578125, 0.2216796875, 0.1009521484375, 0.259521484375, 0.1717529296875, 0.0227508544921875, 0.1026611328125, 0.197509765625, 0.091064453125, 0.203369140625, 0.013092041015625, 0.1549072265625, 0.1536865234375, 0.17724609375, 0.1253662109375, ...	embed
52955380_c0	52955380	haskell	0	Title: How can I use annotations to customize HLint and mark my Haskell package as Safe? Problem title: How can I use annotations to customize HLint and mark my Haskell package as Safe? Tags: haskell Problem: How can I use annotations to customize HLint and mark my Haskell package as Safe? In my package I have several ...	How can I use annotations to customize HLint and mark my Haskell package as Safe? How can I use annotations to customize HLint and mark my Haskell package as Safe? haskell How HLint Haskell Safe ANN Use Redundant LANGUAGE Annotations See ghc.haskell.org How can I use annotations to customize HLint and mark my Haskell p...	[ 0.00872802734375, 0.00067901611328125, 0.0218505859375, 0.004180908203125, -0.01348876953125, 0.0159912109375, -0.00567626953125, 0.000324249267578125, -0.002349853515625, 0.00014400482177734375, 0.0234375, -0.01434326171875, 0.01007080078125, 0.00933837890625, 0, 0.01123046875, -0.0...	[ 11249, 831, 4527, 8668, 22062, 178036, 48599, 4288, 16188, 20625, 142508, 98169, 237, 115527, 1556, 24455, 36836, 6096, 35405, 3358, 98064, 48143, 31380, 10557, 40368, 75084, 9790, 678, 184750, 45367, 3034, 15490, 18499, 30700, 13, 96243, 11486...	[ 0.0352783203125, 0.034454345703125, 0.07611083984375, 0.1810302734375, 0.178466796875, 0.186767578125, 0.1422119140625, 0.2366943359375, 0.124267578125, 0.1448974609375, 0.221923828125, 0.1732177734375, 0.037841796875, 0.205322265625, 0.103515625, 0.088134765625, 0.0264739990234375, ...	embed
28278378_c0	28278378	haskell	0	Title: Implement two or more instances simultaneously in haskell Problem title: Implement two or more instances simultaneously in haskell Tags: haskell Problem: Implement two or more instances simultaneously in haskell I have defined following class in Haskell: class SearchList searchEntity where searchList :: [Artifac...	Implement two or more instances simultaneously in haskell Implement two or more instances simultaneously in haskell haskell Implement SearchList ArtifactTree Artifact Version x:xs Implement two or more instances simultaneously in haskell I have defined following class in Haskell: I have two equal implementations of thi...	[ -0.0032958984375, 0.00146484375, 0.011474609375, 0.00482177734375, -0.0240478515625, 0.0135498046875, -0.00408935546875, 0.001007080078125, 0.0159912109375, -0.01708984375, -0.0033721923828125, -0.00101470947265625, 0.0216064453125, -0.00005698204040527344, -0.0106201171875, 0.00334167...	[ 153941, 6626, 707, 1286, 110527, 7, 134477, 13, 79850, 1556, 142508, 23, 33086, 154663, 38420, 114700, 62731, 40647, 1022, 12, 425, 61924, 25632, 18507, 20625, 765, 105950, 208124, 903, 12921, 77630, 3917, 70163, 3934, 1632, 71864, 18151, 115...	[ 0.237548828125, 0.163330078125, 0.0914306640625, 0.1390380859375, 0.25927734375, 0.061981201171875, 0.196044921875, 0.053985595703125, 0.058074951171875, 0.1697998046875, 0.2476806640625, 0.028106689453125, 0.144287109375, 0.139404296875, 0.1207275390625, 0.200439453125, 0.1591796875...	embed
31947777_c0	31947777	haskell	0	Title: Why GHC avoids tacit programming? Problem title: Why GHC avoids tacit programming? Tags: tacit-programming, haskell Problem: Why GHC avoids tacit programming? I was looking at GHC.Unicode library source and realized that almost all the Haskell internal libraries avoid tacit programming (aka point-free style) mos...	Why GHC avoids tacit programming? Why GHC avoids tacit programming? tacit-programming haskell Why GHC GHC.Unicode isLatin1 Char Bool Why GHC avoids tacit programming? I was looking at GHC.Unicode library source and realized that almost all the Haskell internal libraries avoid tacit programming (aka point-free style) mo...	[ 0.00103759765625, -0.003265380859375, 0.0238037109375, 0.007080078125, -0.004608154296875, 0.005218505859375, 0.0147705078125, -0.00665283203125, -0.01416015625, -0.00115203857421875, 0.0040283203125, -0.026611328125, 0.0072021484375, -0.00390625, -0.0235595703125, -0.006072998046875, ...	[ 44084, 527, 73265, 71864, 308, 12645, 56037, 449, 7, 28966, 214, 1556, 142508, 85600, 40899, 83, 2729, 2311, 418, 21656, 2460, 929, 35773, 20625, 70796, 10484, 6275, 32087, 20623, 2684, 1733, 60552, 32354, 831, 72546, 117176, 126684, 50218, ...	[ 0.07208251953125, 0.108154296875, 0.2138671875, 0.16015625, 0.1468505859375, 0.2166748046875, 0.1842041015625, 0.05377197265625, 0.0196380615234375, 0.149169921875, 0.032684326171875, 0.1180419921875, 0.263916015625, 0.1046142578125, 0.197998046875, 0.037933349609375, 0.1087646484375...	embed
62583161_c0	62583161	haskell	0	Title: Is it possible to return different http codes with Servant? Problem title: Is it possible to return different http codes with Servant? Tags: haskell, servant Problem: Is it possible to return different http codes with Servant? I want to write API endpoint that would return different http code depending on incomi...	Is it possible to return different http codes with Servant? Is it possible to return different http codes with Servant? haskell servant Servant start_response check_foo Created UserAPI Verb GET JSON Server Is it possible to return different http codes with Servant? I want to write API endpoint that would return differe...	[ -0.013916015625, 0.00164031982421875, 0.0152587890625, 0.006439208984375, 0.00262451171875, -0.006591796875, -0.0084228515625, 0.00518798828125, -0.00177001953125, 0.006378173828125, 0.0079345703125, 0.01190185546875, -0.0135498046875, 0.0220947265625, -0.0027008056640625, 0.0003471374...	[ 2071, 7722, 30646, 12921, 1621, 18151, 7, 678, 5406, 30624, 1556, 142508, 187646, 4034, 134719, 12765, 3584, 31, 151313, 53400, 74220, 1446, 79794, 821, 58627, 22687, 442, 47, 3444, 33022, 61687, 3564, 38496, 2806, 96819, 277, 171859, 11341, ...	[ 0.01025390625, 0.1820068359375, 0.227783203125, 0.2275390625, 0.2095947265625, 0.222412109375, 0.011566162109375, 0.10528564453125, 0.1925048828125, 0.2412109375, 0.1107177734375, 0.1846923828125, 0.251220703125, 0.0906982421875, 0.1444091796875, 0.10382080078125, 0.0819091796875, ...	embed

39069770_c0

39069770

haskell

0

Title: How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack project? Problem title: How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack project? Tags: haskell, haskell-stack Problem: How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack proje...

How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack project? How am I meant to split code between src/Lib.hs and app/Main.hs in a new stack project? haskell haskell-stack How Lib.hs Main.hs LICENSE helloworld.cabal Setup.hs stack.yaml Spec.hs How am I meant to split code between src/Lib.hs an...

[ 0.005706787109375, 0.0128173828125, -0.005859375, 0.009521484375, -0.01708984375, 0.0038909912109375, 0.0098876953125, 0.01171875, 0.01300048828125, 0.0040283203125, -0.002288818359375, -0.0279541015625, 0.00897216796875, 0.026611328125, -0.002166748046875, 0.00323486328125, -0.00127...

[ 11249, 131148, 47, 65450, 18151, 17721, 91, 19437, 64, 104820, 127, 136, 4027, 168793, 3525, 177261, 13452, 1556, 142508, 590, 2594, 43278, 5, 12321, 107615, 207771, 33600, 31, 32554, 408, 3571, 19943, 2037, 14520, 141, 24990, 444, 23, 2563...

[ 0.0726318359375, 0.1348876953125, 0.010345458984375, 0.23486328125, 0.23095703125, 0.1123046875, 0.02850341796875, 0.1910400390625, 0.060791015625, 0.2052001953125, 0.18017578125, 0.0753173828125, 0.1907958984375, 0.1964111328125, 0.1126708984375, 0.2003173828125, 0.1414794921875, ...

embed

40265999_c0

40265999

haskell

0

Title: Applicative and Monad instances for a function type? Problem title: Applicative and Monad instances for a function type? Tags: monads, haskell, instances Problem: Applicative and Monad instances for a function type? I have a data type that resembles Blah below but because of a quirk with the type I cannot automa...

Applicative and Monad instances for a function type? Applicative and Monad instances for a function type? monads haskell instances Applicative Monad Blah Functor Applicative and Monad instances for a function type? I have a data type that resembles Blah below but because of a quirk with the type I cannot automatically ...

[ 0.00860595703125, 0.01251220703125, 0.010986328125, 0.0024566650390625, -0.0005950927734375, 0.0164794921875, 0.01324462890625, 0.002166748046875, 0.0172119140625, -0.0037384033203125, -0.02099609375, -0.0106201171875, -0.007415771484375, 0.0068359375, -0.0086669921875, -0.016235351562...

[ 5659, 11048, 4935, 136, 60331, 71, 110527, 7, 100, 32354, 10644, 2667, 712, 1556, 142508, 335, 1566, 28670, 18770, 2053, 3332, 195, 35064, 569, 53418, 191082, 122, 5844, 23009, 46517, 103607, 10, 26366, 70, 171763, 15700, 3525, 50986, 13756...

[ 0.15087890625, 0.1934814453125, 0.19091796875, 0.1182861328125, 0.231689453125, 0.18603515625, 0.3037109375, 0.048492431640625, 0.06640625, 0.1781005859375, 0.2086181640625, 0.1580810546875, 0.2115478515625, 0.1136474609375, 0.21826171875, 0.06884765625, 0.23779296875, 0.1248779296...

embed

59507652_c1

59507652

haskell

1

=> MyTrans m a -> (a -> m b) -> MyTrans m b x >>=!? f = x >>= (lift . f) Of course a general colift :: (MonadTrans t, Monad m) => t m a -> m a makes absolutely zero sense, because surely the transformer is doing something that we cannot just throw away like that in all cases. But just like (>>=) introduces contravaria...

[ -0.004974365234375, 0.0038604736328125, 0.01025390625, -0.01318359375, 0.0181884765625, -0.0267333984375, 0.01214599609375, -0.024658203125, 0.0262451171875, -0.00885009765625, 0.01190185546875, 0.0185546875, 0.010009765625, 0.0145263671875, -0.0029296875, -0.01031494140625, 0.003875...

[ 44357, 2646, 62624, 347, 10, 33079, 11, 876, 16, 1022, 6396, 1369, 38, 1238, 2203, 104501, 15411, 4537, 552, 1984, 46674, 712, 808, 60331, 71, 30482, 115839, 45234, 10422, 6637, 9077, 538, 70, 27198, 56, 20594, 9844, 450, 642, 53418, 16...

[ 0.06097412109375, 0.2100830078125, 0.287109375, 0.1824951171875, 0.23583984375, 0.130615234375, 0.099365234375, 0.162353515625, 0.0204620361328125, 0.1075439453125, 0.1439208984375, 0.23681640625, 0.118408203125, 0.10546875, 0.0230865478515625, 0.290283203125, 0.0306396484375, 0.14...

embed

27344929_c0

27344929

haskell

0

Title: Haskell Tree - Show instance Problem title: Haskell Tree - Show instance Tags: haskell, ghci, functional-programming, function Problem: Haskell Tree - Show instance I am learning haskell and i want to print all nodes in tree (depends on height on tree, where height = 0 => leafs). And i thinking, that I create a ...

Haskell Tree - Show instance Haskell Tree - Show instance haskell ghci functional-programming function a Haskell Tree Show Empty Node tree4 tree5 heightTree::Tree Integer treeLev::Tree a-1 Main Possible GHCi Haskell Tree - Show instance I am learning haskell and i want to print all nodes in tree (depends on height on t...

[ -0.007110595703125, -0.0181884765625, 0.003570556640625, -0.00830078125, 0.017822265625, 0.01373291015625, -0.0142822265625, -0.01348876953125, 0.00183868408203125, -0.0078125, -0.01495361328125, -0.03759765625, 0.01104736328125, 0.009521484375, 0.0118408203125, -0.00994873046875, 0....

[ 20625, 142508, 101344, 17367, 110527, 1556, 31380, 318, 123309, 28966, 32354, 31678, 939, 438, 112, 53201, 617, 758, 155955, 62731, 44401, 5267, 334, 10, 5759, 12321, 115861, 527, 73265, 14, 52080, 3444, 28412, 756, 110, 988, 23, 105254, 75...

[ 0.1343994140625, 0.2327880859375, 0.257568359375, 0.236572265625, 0.251708984375, 0.1368408203125, 0.09918212890625, 0.1202392578125, 0.1552734375, 0.108154296875, 0.185302734375, 0.1585693359375, 0.09820556640625, 0.125, 0.0482177734375, 0.2059326171875, 0.09033203125, 0.063354492...

embed

75751903_c1

75751903

haskell

1

? I think the function accum is the one that needs to be changed. My code is: import qualified Data.ByteString.Lazy.Char8 as BLC import qualified Data.Vector.Unboxed as U import Data.Vector.Unboxed ((!)) import Data.Maybe (fromJust) import Data.List (foldl') primesSq :: Int -> [BLC.ByteString] -> [Int] primesSq lim [] ...

[ -0.012939453125, 0.0106201171875, 0.0166015625, 0.0159912109375, -0.0022735595703125, 0.0260009765625, -0.0145263671875, -0.0106201171875, 0.0081787109375, -0.022216796875, 0.029541015625, 0.0250244140625, 0.00909423828125, -0.009765625, -0.005584716796875, 0.006103515625, -0.0094604...

[ 705, 87, 5351, 32354, 61689, 39, 83, 70, 1632, 450, 27117, 47, 186, 98816, 5, 2646, 18151, 24927, 217225, 11809, 75358, 67, 71713, 214, 2729, 3285, 84068, 1019, 237, 335, 26943, 26455, 18770, 14256, 11728, 297, 345, 151399, 82419, 161063,...

[ 0.0478515625, 0.00726318359375, 0.1246337890625, 0.220458984375, 0.208251953125, 0.2330322265625, 0.08721923828125, 0.024383544921875, 0.06695556640625, 0.072265625, 0.200927734375, 0.09490966796875, 0.09796142578125, 0.24755859375, 0.020538330078125, 0.0819091796875, 0.2469482421875...

embed

31641464_c1

31641464

haskell

1

0 overflowed, 0 dud, 0 GC'd, 0 fizzled) . I believe the much greater memory use is because parListChunk forces the spine of the list. Then I tried to write my own strategy that lazily divided the list into chunks and then passed the chunks to parBuffer and concatenated the results. concat $ withStrategy (parBuffer 40 r...

[ -0.005950927734375, 0.0098876953125, -0.01422119140625, 0.0002498626708984375, -0.00457763671875, 0.005096435546875, -0.005950927734375, -0.01129150390625, 0.015869140625, -0.009521484375, -0.0064697265625, 0.007171630859375, 0.033935546875, 0.0096435546875, 0.003265380859375, -0.01361...

[ 757, 645, 118664, 297, 115, 71, 69657, 17148, 169, 6259, 18822, 5045, 117396, 98323, 4527, 366, 154663, 15982, 3678, 84616, 25927, 5303, 37842, 33022, 10002, 113857, 21, 708, 101637, 3934, 7839, 7235, 18234, 158, 4460, 50339, 3650, 678, 973...

[ 0.09515380859375, 0.13232421875, 0.253173828125, 0.06341552734375, 0.08740234375, 0.000579833984375, 0.0207366943359375, 0.04266357421875, 0.0154876708984375, 0.0202789306640625, 0.03997802734375, 0.100341796875, 0.1334228515625, 0.2108154296875, 0.1746826171875, 0.1614990234375, 0.1...

embed

12571205_c0

12571205

haskell

0

Title: How to build and use a bootstrap executable in a Cabal package Problem title: How to build and use a bootstrap executable in a Cabal package Tags: cabal, haskell Problem: How to build and use a bootstrap executable in a Cabal package I would like to Cabalize a Haskell project in order to upload it to Hackage. It...

How to build and use a bootstrap executable in a Cabal package How to build and use a bootstrap executable in a Cabal package cabal haskell How Cabal How to build and use a bootstrap executable in a Cabal package I would like to Cabalize a Haskell project in order to upload it to Hackage. It consists of one standard .h...

[ 0.01019287109375, 0.00043487548828125, 0.0091552734375, -0.01171875, -0.0078125, 0.0029296875, 0.0133056640625, 0.004608154296875, -0.00142669677734375, 0.00130462646484375, 0.0074462890625, -0.0130615234375, -0.00885009765625, 0.00811767578125, -0.000591278076171875, 0.015380859375, ...

[ 11249, 45367, 136, 4527, 49935, 7, 107617, 71924, 2886, 30438, 289, 98169, 23, 109524, 1556, 142508, 1884, 11, 119066, 20625, 13452, 70622, 52922, 4588, 58055, 1632, 5570, 127, 11435, 136659, 351, 66589, 79366, 102158, 9433, 36049, 114122, 80...

[ 0.0802001953125, 0.1988525390625, 0.0799560546875, 0.1580810546875, 0.1678466796875, 0.0650634765625, 0.26513671875, 0.19775390625, 0.1746826171875, 0.198486328125, 0.174560546875, 0.1903076171875, 0.04144287109375, 0.2281494140625, 0.1307373046875, 0.2369384765625, 0.028594970703125...

embed

35500358_c0

35500358

haskell

0

Title: Haskell: dealing with ambiguous imports Problem title: Haskell: dealing with ambiguous imports Tags: haskell, import Problem: Haskell: dealing with ambiguous imports I'm getting ambiguity warnings, sometimes errors, all the time. This is just a clear cut example. I'm using doctest: $ stack exec doctest -- src/Ma...

Haskell: dealing with ambiguous imports Haskell: dealing with ambiguous imports haskell import Turtle Prelude System.IO Text.Regex.TDFA Haskell Main.hs Ambiguous Turtle.stdout Main.hs:6:1-13 Turtle.Prelude System.IO.stdout GHC.IO.Handle.FD Examples Tried Errors Failures FilePath Haskell: dealing with ambiguous imports ...

[ -0.0101318359375, -0.0016326904296875, 0.00677490234375, 0.0228271484375, -0.0028533935546875, -0.019775390625, 0.0169677734375, 0.006011962890625, -0.0019378662109375, 0.0145263671875, -0.004974365234375, -0.0166015625, 0.006072998046875, 0.01513671875, 0.0047607421875, 0.011962890625...

[ 20625, 142508, 184017, 678, 920, 12282, 10821, 24927, 1556, 4252, 17991, 1914, 822, 112, 12353, 17780, 24129, 54601, 3355, 14676, 12321, 127, 10250, 1003, 910, 19721, 22820, 19273, 73265, 135679, 98553, 89536, 4699, 212059, 190355, 42724, 683, ...

[ 0.1256103515625, 0.221923828125, 0.1224365234375, 0.0794677734375, 0.1805419921875, 0.2318115234375, 0.10589599609375, 0.243408203125, 0.09515380859375, 0.1151123046875, 0.167236328125, 0.057708740234375, 0.1268310546875, 0.055633544921875, 0.10028076171875, 0.10748291015625, 0.08508...

embed

24530156_c0

24530156

haskell

0

Title: Memoising a function over Unboxed Vectors causes it to hang Problem title: Memoising a function over Unboxed Vectors causes it to hang Tags: haskell Problem: Memoising a function over Unboxed Vectors causes it to hang I'm playing with Vectors and Unboxed Vectors, with a fairly simple program. I'm enumerating all...

Memoising a function over Unboxed Vectors causes it to hang Memoising a function over Unboxed Vectors causes it to hang haskell Data.Vector.Unboxed Memoising Unboxed Vectors Data.Vector UV.Vector Bool UV.map n2r n2q n3r n3q n5r n5q Memoising a function over Unboxed Vectors causes it to hang I'm playing with Vectors and...

[ -0.00946044921875, -0.0025482177734375, 0.0152587890625, -0.01531982421875, 0.0031890869140625, -0.0179443359375, 0.01336669921875, -0.00958251953125, 0.006134033203125, -0.0162353515625, 0.0118408203125, -0.00885009765625, 0.036376953125, 0.0093994140625, 0.01416015625, -0.00842285156...

[ 17443, 31, 72219, 32354, 645, 992, 11728, 297, 52884, 22230, 113660, 47, 10756, 1556, 142508, 11809, 26455, 18770, 14256, 31812, 2460, 929, 62346, 864, 758, 75169, 8781, 1528, 189085, 1916, 756, 892, 26255, 4734, 120103, 79359, 619, 1892, 1...

[ 0.1627197265625, 0.1197509765625, 0.101318359375, 0.192138671875, 0.1318359375, 0.10540771484375, 0.2012939453125, 0.0496826171875, 0.2005615234375, 0.1685791015625, 0.0777587890625, 0.06585693359375, 0.2431640625, 0.127197265625, 0.2457275390625, 0.1031494140625, 0.171875, 0.16687...

embed

29191484_c0

29191484

haskell

0

Title: Breakpoints in the argument-passing scheme of OCaml Problem title: Breakpoints in the argument-passing scheme of OCaml Tags: ocaml-core, haskell, ocaml Problem: Breakpoints in the argument-passing scheme of OCaml Today, I was going through the source code of Jane Street 's Core_kernel module and I came across th...

Breakpoints in the argument-passing scheme of OCaml Breakpoints in the argument-passing scheme of OCaml ocaml-core haskell ocaml Breakpoints OCaml Core_kernel Breakpoints in the argument-passing scheme of OCaml Today, I was going through the source code of Jane Street 's Core_kernel module and I came across the compose...

[ 0.0101318359375, 0.00860595703125, 0.000926971435546875, 0.0185546875, -0.00823974609375, 0.0040283203125, -0.0159912109375, -0.00830078125, -0.0137939453125, -0.01519775390625, 0.00567626953125, -0.0037384033203125, -0.008056640625, 0.01446533203125, 0.01483154296875, -0.0103149414062...

[ 131904, 38496, 10750, 13409, 150370, 180, 105272, 141, 36, 9779, 30854, 1556, 142508, 31365, 72083, 31344, 18151, 48511, 15130, 88996, 36880, 150350, 32354, 2806, 765, 61924, 237, 31635, 8337, 13204, 3917, 6777, 83, 51776, 1238, 136, 706, 306...

[ 0.2000732421875, 0.238037109375, 0.22216796875, 0.1341552734375, 0.1640625, 0.0904541015625, 0.1787109375, 0.1500244140625, 0.047576904296875, 0.11767578125, 0.095703125, 0.0726318359375, 0.207763671875, 0.1236572265625, 0.134033203125, 0.05902099609375, 0.0268402099609375, 0.15576...

embed

11313588_c0

11313588

haskell

0

Title: Maybe monad bind function precedence Problem title: Maybe monad bind function precedence Tags: monads, haskell, option-type Problem: Maybe monad bind function precedence In this tutorial I've found the following snippet: deposit :: (Num a) => a -> a -> Maybe a deposit value account = Just (account + value) withd...

Maybe monad bind function precedence Maybe monad bind function precedence monads haskell option-type Maybe Num Just Ord Nothing Bool Maybe monad bind function precedence In this tutorial I've found the following snippet: I can't figure out how the >>= function is supposed to work. At first it takes a Maybe a value as i...

[ -0.0118408203125, -0.005706787109375, 0.01470947265625, 0.013427734375, 0.01708984375, 0.03076171875, 0.0091552734375, -0.0069580078125, 0.0137939453125, -0.0096435546875, 0.0062255859375, -0.00168609619140625, -0.0123291015625, -0.004669189453125, 0.0172119140625, -0.00050735473632812...

[ 83425, 2667, 712, 68557, 32354, 107671, 6620, 1556, 142508, 35829, 50986, 52782, 9563, 35379, 182747, 2460, 929, 57143, 831, 26366, 3642, 70, 6396, 1369, 83, 134598, 4488, 5117, 51776, 34292, 237, 171859, 40370, 805, 15426, 19364, 37202, 5646...

[ 0.30126953125, 0.153564453125, 0.172119140625, 0.24365234375, 0.21533203125, 0.1915283203125, 0.116943359375, 0.115234375, 0.238525390625, 0.1995849609375, 0.091552734375, 0.1654052734375, 0.0894775390625, 0.169677734375, 0.1531982421875, 0.0830078125, 0.1324462890625, 0.0948486328...

embed

11597246_c0

11597246

haskell

0

Title: Which KeyBoard / KeyBoard Layout will be most suitable for haskell programming? Does haskell has all Math Symbols as functions? Problem title: Which KeyBoard / KeyBoard Layout will be most suitable for haskell programming? Does haskell has all Math Symbols as functions? Tags: unicode, symbols, keyboard, haskell,...

Which KeyBoard / KeyBoard Layout will be most suitable for haskell programming? Does haskell has all Math Symbols as functions? Which KeyBoard / KeyBoard Layout will be most suitable for haskell programming? Does haskell has all Math Symbols as functions? unicode symbols keyboard haskell emacs Which KeyBoard Layout Doe...

[ 0.003997802734375, 0.006805419921875, -0.001678466796875, -0.0216064453125, -0.0029754638671875, -0.01361083984375, 0.0048828125, 0.017333984375, 0.00421142578125, 0.0093994140625, 0.00848388671875, -0.04052734375, 0.0242919921875, -0.01953125, -0.0152587890625, 0.00506591796875, -0....

[ 130078, 26824, 12647, 5861, 248, 211032, 2684, 202319, 1556, 142508, 56037, 101790, 756, 78804, 131899, 32354, 60347, 112, 26582, 149186, 352, 2263, 100, 89931, 9842, 16454, 57143, 27781, 121413, 18151, 21656, 23962, 39210, 66211, 11417, 10644, ...

[ 0.03955078125, 0.111083984375, 0.1617431640625, 0.1282958984375, 0.005828857421875, 0.2042236328125, 0.10498046875, 0.158447265625, 0.1141357421875, 0.22705078125, 0.105712890625, 0.0572509765625, 0.0848388671875, 0.1929931640625, 0.2158203125, 0.1563720703125, 0.107421875, 0.11022...

embed

12129300_c0

12129300

haskell

0

Title: How to navigate up inside a HUET Zipper Problem title: How to navigate up inside a HUET Zipper Tags: functional-programming, zipper, scala, ocaml, haskell Problem: How to navigate up inside a HUET Zipper I'm reading Huet Zipper , I cannot understand the go_up method: let go_up (Loc(t,p)) = match p with Top -> fa...

How to navigate up inside a HUET Zipper How to navigate up inside a HUET Zipper functional-programming zipper scala ocaml haskell How HUET Zipper go_up Loc Top Node Section t::right Location Path Context How to navigate up inside a HUET Zipper I'm reading Huet Zipper , I cannot understand the go_up method: The full sou...

[ -0.0020294189453125, 0.0341796875, 0.002960205078125, 0.0021209716796875, -0.01953125, 0.00102996826171875, -0.0011138916015625, -0.01092529296875, 0.004302978515625, -0.05712890625, -0.01300048828125, -0.0004329681396484375, 0.00921630859375, 0.007080078125, 0.00848388671875, -0.01708...

[ 11249, 56136, 67, 1257, 46132, 22438, 23385, 9315, 8079, 47, 10, 123309, 28966, 3546, 146232, 36, 9779, 141, 1556, 142508, 738, 454, 2037, 88784, 4792, 438, 112, 140978, 54969, 90788, 108421, 1657, 22829, 16454, 7674, 126, 53418, 28219, 553...

[ 0.0648193359375, 0.2384033203125, 0.110595703125, 0.193115234375, 0.21533203125, 0.176025390625, 0.205322265625, 0.1900634765625, 0.240478515625, 0.003326416015625, 0.022247314453125, 0.1502685546875, 0.10211181640625, 0.1572265625, 0.1448974609375, 0.005523681640625, 0.0684204101562...

embed

23967523_c0

23967523

haskell

0

Title: Outer Joins with Esqueleto Problem title: Outer Joins with Esqueleto Tags: haskell, esqueleto Problem: Outer Joins with Esqueleto I am a bit confused about how outer joins work with esqueleto. I have created the following query (simplified): select $ from $ \(rep `LeftOuterJoin` event) -> do on (rep ^. RepAtomId...

Outer Joins with Esqueleto Outer Joins with Esqueleto haskell esqueleto $ Outer Joins Esqueleto LeftOuterJoin RepAtomId EventAtomId where_ EventSeconds Just Outer Joins with Esqueleto I am a bit confused about how outer joins work with esqueleto. I have created the following query (simplified): As far as I know, on the...

[ 0.01171875, 0.00927734375, 0.0086669921875, 0.005859375, -0.000751495361328125, -0.00390625, -0.00518798828125, 0.00006532669067382812, -0.00170135498046875, -0.017333984375, -0.023193359375, 0.009033203125, -0.01422119140625, 0.006011962890625, -0.005401611328125, 0.00075531005859375,...

[ 13538, 56, 113053, 7, 678, 1184, 37631, 31580, 1556, 142508, 66660, 133, 188, 3650, 636, 2480, 79858, 16604, 33742, 12078, 36943, 71, 4233, 2271, 4785, 55681, 1810, 33284, 4488, 75935, 25632, 41, 1294, 116120, 80866, 8752, 33938, 100, 10958...

[ 0.1978759765625, 0.2109375, 0.26171875, 0.0941162109375, 0.109619140625, 0.057281494140625, 0.168701171875, 0.1978759765625, 0.07958984375, 0.2186279296875, 0.14208984375, 0.1632080078125, 0.1888427734375, 0.07080078125, 0.002685546875, 0.0836181640625, 0.16064453125, 0.14819335937...

embed

41187976_c1

41187976

haskell

1

:: Double, charge :: Double, velocity :: Velocity} deriving (Eq, Show, Read) --utils toScalar :: Vector -> Double toScalar (x, y, z) = sqrt (x ^^ 2 + y ^^ 2 + z ^^ 2) toUnit :: Vector -> Vector toUnit (x, y, z) = (x / scalar, y / scalar, z / scalar) where scalar = toScalar (x, y, z) add :: Vector -> Vector -> Vector a...

[ -0.005645751953125, 0.0179443359375, -0.005767822265625, -0.009521484375, 0.01055908203125, -0.01422119140625, -0.01806640625, -0.0172119140625, 0.01556396484375, -0.01220703125, 0.0034637451171875, -0.01123046875, 0.000492095947265625, -0.0262451171875, -0.027587890625, -0.00230407714...

[ 1984, 107172, 4, 25534, 191060, 939, 139993, 60089, 8152, 16406, 6496, 864, 17367, 4764, 4210, 1003, 7870, 47, 294, 408, 320, 2609, 18770, 33079, 425, 113, 97, 2203, 3198, 16377, 116, 997, 4958, 85600, 248, 146232, 42, 15190, 10461, 3869,...

[ 0.1226806640625, 0.239990234375, 0.0755615234375, 0.258056640625, 0.2266845703125, 0.1239013671875, 0.2060546875, 0.1280517578125, 0.04876708984375, 0.188232421875, 0.193115234375, 0.149169921875, 0.1839599609375, 0.1993408203125, 0.0755615234375, 0.16015625, 0.1630859375, 0.229125...

embed

27247348_c1

27247348

haskell

1

skipSpace <* string "endfacet" vertexPoint = coordinates "vertex" Point {-# INLINE facet #-} rawFacets :: Fractional a => Parser [RawFacet a] rawFacets = beginSolid *> many' facet <* endSolid where solidName = option "default" (skipWhile isHorizontalSpace *> fmap T.pack (many1 $ satisfy isAlphaNum) ) beginSolid = skip...

[ 0.021728515625, -0.0196533203125, -0.01300048828125, 0.0263671875, 0.0108642578125, -0.00193023681640625, 0.01141357421875, -0.0177001953125, -0.005889892578125, -0.021240234375, 0.01055908203125, -0.01409912109375, -0.015380859375, -0.005126953125, -0.0101318359375, 0.0111083984375, ...

[ 21658, 141012, 79315, 3611, 40404, 18, 493, 24371, 147534, 176866, 814, 41097, 5881, 57339, 2577, 49649, 135518, 7831, 7868, 10763, 289, 10, 2392, 2189, 12248, 434, 126, 9842, 102588, 532, 5941, 3564, 18652, 163612, 35829, 214810, 44024, 83, ...

[ 0.227294921875, 0.255615234375, 0.215087890625, 0.0897216796875, 0.17333984375, 0.0496826171875, 0.0777587890625, 0.1138916015625, 0.1427001953125, 0.1317138671875, 0.03466796875, 0.12353515625, 0.02777099609375, 0.13525390625, 0.1761474609375, 0.169921875, 0.194091796875, 0.146362...

embed

56859326_c0

56859326

haskell

0

Title: Haskell function signature confusion Problem title: Haskell function signature confusion Tags: haskell Problem: Haskell function signature confusion I'm trying to learn Haskell, but I'm stumped on something. So far, I've come to understand that functions signatures conform to this convention: <name> :: <type con...

Haskell function signature confusion Haskell function signature confusion haskell Haskell Returns add2 adds2 Hello RandomGen Gene Rand Haskell function signature confusion I'm trying to learn Haskell, but I'm stumped on something. So far, I've come to understand that functions signatures conform to this convention: So,...

[ 0.0174560546875, -0.001617431640625, -0.0166015625, 0.006561279296875, -0.00109100341796875, 0.0152587890625, -0.004119873046875, -0.00701904296875, 0.009521484375, -0.014404296875, 0.003936767578125, -0.0400390625, -0.00982666015625, 0.0001392364501953125, -0.003662109375, 0.003585815...

[ 20625, 142508, 32354, 138256, 169463, 1556, 173340, 15190, 304, 35378, 39643, 306, 105376, 46980, 30698, 48708, 20051, 28219, 7, 19911, 47, 101805, 27781, 100094, 9351, 83, 29968, 10644, 158, 2816, 706, 8110, 51776, 237, 107730, 6626, 142424, ...

[ 0.1390380859375, 0.2232666015625, 0.21728515625, 0.2275390625, 0.1973876953125, 0.10528564453125, 0.2403564453125, 0.1556396484375, 0.135498046875, 0.050323486328125, 0.1365966796875, 0.086181640625, 0.1544189453125, 0.1943359375, 0.016693115234375, 0.05694580078125, 0.0577392578125,...

embed

49796017_c1

49796017

haskell

1

= (*f)(x+1); } return out; } double sumpointer(double** pptr){ double x=0; for(unsigned i=0; i<2; i++){ for(unsigned j=0; j<2; j++){ x += pptr[i][j]; } } return x; } main module of the library, Lib.hs {-# LANGUAGE ForeignFunctionInterface #-} module Lib where import Foreign.C.Types import Foreign.Ptr (Ptr, FunPtr, fre...

[ 0.0306396484375, 0.01611328125, -0.00579833984375, -0.00823974609375, 0.002044677734375, -0.005706787109375, -0.00860595703125, -0.002655029296875, 0.0101318359375, -0.0272216796875, -0.00933837890625, -0.00970458984375, -0.00592041015625, -0.008544921875, -0.009521484375, -0.016967773...

[ 2203, 75402, 420, 51421, 425, 21748, 30646, 1810, 41929, 10554, 38496, 56, 21555, 2661, 25442, 32261, 4448, 1022, 145407, 100, 31304, 17, 304, 37223, 1647, 997, 14, 170, 74, 5201, 88996, 35773, 43278, 5, 127, 7, 3358, 98064, 75930, 184293...

[ 0.135498046875, 0.0238494873046875, 0.1380615234375, 0.06219482421875, 0.06634521484375, 0.190673828125, 0.1876220703125, 0.11083984375, 0.177001953125, 0.1661376953125, 0.2705078125, 0.1180419921875, 0.09051513671875, 0.132080078125, 0.0243988037109375, 0.09417724609375, 0.203002929...

embed

51347227_c1

51347227

haskell

1

Wreq\Internal\Lens.hs, dist\build\Network\Wreq\Internal\Lens.o ) ghc.exe: unable to load package `network-2.7.0.2' ghc.exe: | C:\Users\Roman\AppData\Roaming\cabal\x86_64-windows-ghc-8.4.3\network-2.7.0.2-HRKpEmrZF0Z7oBCs9x5PCR\HSnetwork-2.7.0.2-HRKpEmrZF0Z7oBCs9x5PCR.o: unknown symbol `acceptNewSock' cabal: Leaving dir...

[ -0.003875732421875, 0.01068115234375, 0.00506591796875, -0.00958251953125, -0.003448486328125, 0.006683349609375, -0.02099609375, -0.001983642578125, -0.0128173828125, -0.00494384765625, 0.007659912109375, -0.0054931640625, -0.000324249267578125, -0.018798828125, 0.0118408203125, 0.003...

[ 601, 107, 864, 44851, 6236, 866, 1755, 127, 7, 45, 271, 177149, 24447, 18244, 1456, 31, 31380, 238, 46480, 51, 2886, 72367, 98169, 1179, 5428, 53489, 133684, 1062, 158271, 39179, 137989, 12724, 302, 408, 3571, 15276, 13307, 229792, 9486, ...

[ 0.081298828125, 0.26123046875, 0.1820068359375, 0.12451171875, 0.151611328125, 0.14794921875, 0.19580078125, 0.1044921875, 0.029754638671875, 0.01513671875, 0.04302978515625, 0.156494140625, 0.045135498046875, 0.1416015625, 0.083251953125, 0.1458740234375, 0.173095703125, 0.1424560...

embed

47149996_c0

47149996

haskell

0

Title: ghc.exe: internal error: mkPath failed converting char* to wchar_t* Problem title: ghc.exe: internal error: mkPath failed converting char* to wchar_t* Tags: windows-10, ghc, haskell Problem: ghc.exe: internal error: mkPath failed converting char* to wchar_t* today I followed the Haskel Platform website download ...

ghc.exe: internal error: mkPath failed converting char* to wchar_t* ghc.exe: internal error: mkPath failed converting char* to wchar_t* windows-10 ghc haskell ghc.exe wchar_t GHCi www.haskell.org GHC x86_64_unknown_mingw32 Please Runtime windows-10 ghc.exe: internal error: mkPath failed converting char* to wchar_t* tod...

[ 0.0238037109375, 0.01397705078125, -0.00830078125, 0.00070953369140625, -0.0037384033203125, 0.01025390625, -0.014892578125, -0.028076171875, -0.0291748046875, 0.0012664794921875, -0.002838134765625, -0.02197265625, 0.009033203125, 0.0098876953125, 0.00836181640625, 0.002960205078125, ...

[ 31380, 238, 46480, 70796, 18499, 19201, 683, 10519, 165523, 96760, 21441, 1639, 47, 148, 9254, 454, 18, 54825, 9193, 1556, 142508, 527, 73265, 14, 10557, 1478, 15276, 13307, 69723, 14578, 434, 6460, 28398, 18925, 134629, 20625, 2590, 70968, ...

[ 0.1719970703125, 0.158935546875, 0.17822265625, 0.1939697265625, 0.130126953125, 0.134765625, 0.1451416015625, 0.1990966796875, 0.17236328125, 0.127685546875, 0.18115234375, 0.150146484375, 0.0540771484375, 0.1199951171875, 0.1685791015625, 0.02093505859375, 0.1168212890625, 0.0818...

embed

31261905_c0

31261905

haskell

0

Title: Alternative IO error for <|> Problem title: Alternative IO error for <|> Tags: io-monad, haskell, alternative-functor Problem: Alternative IO error for <|> I am using the operator <|> for: import qualified Data.ByteString.Lazy as B import Network.HTTP.Conduit (simpleHttp) import Data.Aeson import Dat...

Alternative IO error for <|> Alternative IO error for <|> io-monad haskell alternative-functor qualified Network.HTTP.Conduit Data.Aeson Data.Maybe a Alternative Data.ByteString.Lazy FooBar Text Show Generic FromJSON ToJSON B.readFile Alternative IO error for <|> I am using the operator <|> for: But when I ...

[ 0.00457763671875, 0.01324462890625, 0.00022125244140625, 0.01214599609375, 0.000621795654296875, 0.00164031982421875, -0.0269775390625, 0.0021514892578125, -0.01165771484375, -0.013671875, 0.004425048828125, -0.011962890625, 0.03076171875, -0.0020599365234375, 0.0123291015625, -0.02319...

[ 103905, 17780, 18499, 100, 1277, 5386, 22995, 3796, 712, 1556, 142508, 30700, 16498, 18770, 217225, 28997, 23658, 112061, 11809, 90, 191, 82419, 71713, 2729, 3285, 9572, 31, 25267, 24129, 17367, 88342, 1771, 28090, 1375, 58627, 717, 335, 3911...

[ 0.2392578125, 0.2413330078125, 0.21044921875, 0.08758544921875, 0.001068115234375, 0.0245819091796875, 0.2249755859375, 0.0662841796875, 0.10736083984375, 0.1087646484375, 0.2125244140625, 0.20263671875, 0.08074951171875, 0.10406494140625, 0.12646484375, 0.08544921875, 0.027175903320...

embed

18723381_c0

18723381

haskell

0

Title: Rounding to specific number of digits in Haskell Problem title: Rounding to specific number of digits in Haskell Tags: math, haskell Problem: Rounding to specific number of digits in Haskell I am trying to make a function to round a floating point number to a defined length of digits. What I have come up with so...

Rounding to specific number of digits in Haskell Rounding to specific number of digits in Haskell math haskell Numeric Rounding Haskell Integral Rounding to specific number of digits in Haskell I am trying to make a function to round a floating point number to a defined length of digits. What I have come up with so far...

[ -0.01123046875, 0.0015869140625, -0.0019378662109375, -0.002655029296875, -0.006622314453125, -0.00122833251953125, -0.00604248046875, 0.00836181640625, 0.0050048828125, -0.01483154296875, -0.0174560546875, 0.00093841552734375, -0.00885009765625, 0.0115966796875, 0.00872802734375, -0.0...

[ 162856, 214, 47, 29458, 14012, 111, 153939, 7, 23, 20625, 142508, 48909, 1556, 93511, 204681, 31577, 3249, 32354, 68807, 21917, 26518, 6275, 61924, 71, 140909, 1257, 2060, 903, 17368, 1466, 83324, 70, 8108, 96117, 15572, 20650, 107730, 34292,...

[ 0.23388671875, 0.103271484375, 0.1558837890625, 0.2208251953125, 0.182373046875, 0.0250701904296875, 0.2181396484375, 0.13427734375, 0.04766845703125, 0.1700439453125, 0.268310546875, 0.09716796875, 0.1414794921875, 0.09100341796875, 0.167236328125, 0.056610107421875, 0.00830078125, ...

embed

76486142_c0

76486142

haskell

0

Title: How to efficiently enumerate binary black-white trees, while accounting for symmetry? Problem title: How to efficiently enumerate binary black-white trees, while accounting for symmetry? Tags: haskell, algorithm, enumeration Problem: How to efficiently enumerate binary black-white trees, while accounting for sym...

How to efficiently enumerate binary black-white trees, while accounting for symmetry? How to efficiently enumerate binary black-white trees, while accounting for symmetry? haskell algorithm enumeration How Black White Leaf Nat How to efficiently enumerate binary black-white trees, while accounting for symmetry? Conside...

[ 0.011962890625, -0.00116729736328125, -0.004730224609375, -0.005584716796875, 0.0272216796875, -0.006103515625, -0.0157470703125, -0.007568359375, 0.0016326904296875, -0.01318359375, -0.027099609375, 0.01239013671875, 0.031494140625, 0.01458740234375, -0.0059814453125, -0.005615234375,...

[ 11249, 93766, 189085, 67, 2394, 6635, 22556, 9, 148477, 1360, 90, 15426, 954, 3019, 15123, 538, 1556, 142508, 234873, 10074, 22392, 636, 2407, 68875, 12960, 10644, 25632, 224743, 41911, 173473, 757, 4879, 8439, 136, 97732, 4958, 183234, 60892...

[ 0.067626953125, 0.186279296875, 0.24169921875, 0.09100341796875, 0.1734619140625, 0.0787353515625, 0.1634521484375, 0.05780029296875, 0.201171875, 0.206787109375, 0.0926513671875, 0.13818359375, 0.08074951171875, 0.1790771484375, 0.10076904296875, 0.009552001953125, 0.083740234375, ...

embed

69374974_c0

69374974

haskell

0

Title: transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2.* Problem title: transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2.* Tags: haskell, haskell-stack, cabal Problem: transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2...

transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2.* transformers-0.5.6.2 from stack configuration does not match >=0.3 && ==0.2.* haskell haskell-stack cabal stack transformers-0.5.6.2 QuickCheck quickcheck-instances-0.3.25.2 sha256:083b84b91fccb3bbf22cd906f5bc731c8e6ee96...

[ -0.00113677978515625, 0.003997802734375, 0.0162353515625, -0.01434326171875, 0.02001953125, -0.013916015625, -0.01068115234375, 0.000041484832763671875, 0.01708984375, 0.0341796875, 0.0145263671875, 0.006866455078125, 0.017578125, -0.0027008056640625, 0.01806640625, -0.005279541015625,...

[ 27198, 1314, 93645, 5, 178121, 1295, 177261, 180346, 14602, 959, 14858, 5386, 170179, 25133, 69112, 133684, 1639, 9, 1556, 142508, 590, 2594, 109524, 89038, 202567, 63773, 78292, 116071, 23320, 107033, 158296, 9638, 127892, 127, 2886, 81046, 13...

[ 0.2568359375, 0.197509765625, 0.2078857421875, 0.007781982421875, 0.246826171875, 0.08123779296875, 0.1988525390625, 0.238525390625, 0.03204345703125, 0.141357421875, 0.2213134765625, 0.0404052734375, 0.19580078125, 0.0208282470703125, 0.06146240234375, 0.1829833984375, 0.01579284667...

embed

57127726_c0

57127726

haskell

0

Title: How to make code look elegant in Haskell? Problem title: How to make code look elegant in Haskell? Tags: haskell Problem: How to make code look elegant in Haskell? I am new to Haskell, I have read blogs on how Haskell code is very elegant. The way I am writing Haskell code, it does not look elegant at all. Some ...

How to make code look elegant in Haskell? How to make code look elegant in Haskell? haskell How Haskell Right Left Log Error URI.mkPathPiece T.pack Just Data.List.NonEmpty.fromList How to make code look elegant in Haskell? I am new to Haskell, I have read blogs on how Haskell code is very elegant. The way I am writing ...

[ -0.01318359375, -0.0010528564453125, 0.017333984375, -0.0047607421875, 0.00116729736328125, 0.0234375, -0.00927734375, -0.024169921875, 0.00677490234375, -0.0189208984375, 0.01116943359375, -0.025146484375, 0.004180908203125, -0.004852294921875, -0.00567626953125, -0.002716064453125, ...

[ 11249, 3249, 18151, 6713, 27650, 23, 20625, 142508, 47, 1556, 90911, 636, 2480, 13146, 212059, 46492, 19201, 683, 10519, 111242, 384, 29102, 9563, 11809, 154663, 59881, 134332, 939, 161063, 3525, 50684, 4552, 3917, 32562, 959, 756, 58555, 344...

[ 0.0921630859375, 0.10107421875, 0.267333984375, 0.207763671875, 0.285400390625, 0.07861328125, 0.1610107421875, 0.273681640625, 0.029083251953125, 0.13427734375, 0.142822265625, 0.06427001953125, 0.1370849609375, 0.16259765625, 0.1790771484375, 0.1337890625, 0.06817626953125, 0.058...

embed

36398709_c0

36398709

haskell

0

Title: zipWith for trees in Haskell Problem title: zipWith for trees in Haskell Tags: haskell, binary-tree Problem: zipWith for trees in Haskell I am learning Haskell using The Haskell School of Expression: Learning Functional Programming through Multimedia and I am unsure how to go about solving this exercise. Using t...

zipWith for trees in Haskell zipWith for trees in Haskell haskell binary-tree Haskell Tree Node Leaf Problems x:xs y:ys zipWith for trees in Haskell I am learning Haskell using The Haskell School of Expression: Learning Functional Programming through Multimedia and I am unsure how to go about solving this exercise. For...

[ 0.01324462890625, 0.01129150390625, -0.01123046875, -0.00433349609375, 0.01019287109375, 0.008056640625, -0.029541015625, -0.027099609375, -0.000888824462890625, -0.03271484375, -0.01397705078125, -0.0024261474609375, -0.005096435546875, 0.0145263671875, 0.00933837890625, 0.01232910156...

[ 68330, 194583, 100, 1360, 90, 20625, 142508, 23, 1556, 2394, 6635, 62600, 101344, 438, 112, 2407, 15649, 425, 113, 4778, 52080, 19188, 25129, 114344, 28670, 27958, 188516, 51646, 3115, 81979, 1018, 71216, 39908, 123309, 27650, 80934 ]

[ 0.2437744140625, 0.288818359375, 0.0687255859375, 0.1873779296875, 0.05438232421875, 0.135009765625, 0.1700439453125, 0.0059814453125, 0.1109619140625, 0.1119384765625, 0.01141357421875, 0.1572265625, 0.1417236328125, 0.06640625, 0.03375244140625, 0.0789794921875, 0.146484375, 0.01...

embed

23543936_c1

23543936

haskell

1

); std::cout << "Test application" << std::endl; std::cin.get(); hs_exit(); return 0; } After compilation, this code works very well. If I build same Haskell code (grep.hs) with using Cabal build system: name: grep version: 1.0 synopsis: example shared library for C use build-type: Simple cabal-version: >=1.10 library ...

[ 0.00167083740234375, -0.0019683837890625, -0.004302978515625, 0.00909423828125, -0.010009765625, 0.0021820068359375, -0.01123046875, 0.0084228515625, 0.00439453125, -0.0091552734375, 0.004852294921875, -0.01019287109375, 0.00131988525390625, 0.0093994140625, 0.0101318359375, 0.00933837...

[ 3142, 6138, 71, 12600, 18, 111337, 38415, 3611, 141, 6333, 3794, 1096, 7, 13, 23399, 757, 98352, 903, 18151, 43240, 4552, 5299, 45367, 5701, 20625, 142508, 7134, 254, 127, 30438, 289, 5426, 3514, 11389, 53855, 27781, 99764, 35773, 313, 50...

[ 0.018218994140625, 0.1558837890625, 0.0897216796875, 0.11279296875, 0.0989990234375, 0.2225341796875, 0.16748046875, 0.04376220703125, 0.0275726318359375, 0.05712890625, 0.0557861328125, 0.0760498046875, 0.049407958984375, 0.044708251953125, 0.174560546875, 0.054656982421875, 0.10742...

embed

26508740_c0

26508740

haskell

0

Title: Removing n number of elements from a list Problem title: Removing n number of elements from a list Tags: haskell Problem: Removing n number of elements from a list One of my modules this year is Haskell programming. I'm having trouble expressing complexity in such a simple manner, especially coming from other la...

Removing n number of elements from a list Removing n number of elements from a list haskell a Removing x-1 Removing n number of elements from a list One of my modules this year is Haskell programming. I'm having trouble expressing complexity in such a simple manner, especially coming from other languages such as C#. Pa...

[ -0.00518798828125, 0.0179443359375, -0.00171661376953125, 0.0093994140625, -0.006805419921875, 0.016845703125, 0.005126953125, -0.0059814453125, 0.0152587890625, -0.0032958984375, 0.0174560546875, -0.038330078125, 0.0042724609375, 0.0101318359375, -0.0019073486328125, 0.00811767578125,...

[ 853, 432, 653, 14012, 80854, 1295, 5303, 1556, 142508, 6496, 1022, 5759, 88996, 903, 6602, 20625, 56037, 63134, 36510, 27140, 6044, 8781, 144996, 46876, 4904, 16031, 29479, 36069, 25, 32354, 87388, 26, 1984, 360, 18, 33079, 7, 30646, 5117, ...

[ 0.010284423828125, 0.1220703125, 0.1705322265625, 0.15185546875, 0.1859130859375, 0.1024169921875, 0.1927490234375, 0.1153564453125, 0.1795654296875, 0.036041259765625, 0.112548828125, 0.1488037109375, 0.06787109375, 0.04046630859375, 0.06842041015625, 0.093017578125, 0.0534973144531...

embed

21895826_c0

21895826

haskell

0

Title: Passing scoped state in runST function Problem title: Passing scoped state in runST function Tags: haskell Problem: Passing scoped state in runST function I have a test function like below which uses runST to internally mutate state. I defined another function go within it which returns Int wrapped in ST as resu...

Passing scoped state in runST function Passing scoped state in runST function haskell Data.Word Data.Vector.Unboxed Control.Monad.ST Control.Monad.Primitive System.Random.MWC Passing LANGUAGE ScopedTypeVariables Main Word32 mapM_ PrimState U.singleton U.Vector Gen Couldn A.hs:12:16 A.hs:10:10 Expected Actual Passing sc...

[ 0.006072998046875, 0.01031494140625, -0.0179443359375, -0.0177001953125, 0.0001583099365234375, -0.01806640625, 0.01141357421875, -0.016845703125, -0.0027313232421875, -0.0155029296875, -0.0027618408203125, 0.0169677734375, -0.00946044921875, 0.015380859375, 0.0181884765625, 0.00674438...

[ 28872, 44679, 297, 11341, 23, 11675, 8545, 32354, 214, 1556, 142508, 11809, 164805, 26455, 18770, 11728, 27131, 46674, 712, 145111, 12353, 3815, 75590, 98064, 182783, 196707, 81827, 14, 12321, 22543, 6460, 22288, 44506, 135206, 345, 6953, 1507,...

[ 0.144287109375, 0.2279052734375, 0.1412353515625, 0.1866455078125, 0.0692138671875, 0.1358642578125, 0.234130859375, 0.1842041015625, 0.02239990234375, 0.1119384765625, 0.2432861328125, 0.03326416015625, 0.0667724609375, 0.0926513671875, 0.07293701171875, 0.1258544921875, 0.126464843...

embed

70525489_c0

70525489

haskell

0

Title: How can I generate every possible solution of a varied size grid which has n points Problem title: How can I generate every possible solution of a varied size grid which has n points Tags: haskell Problem: How can I generate every possible solution of a varied size grid which has n points To give overall context...

How can I generate every possible solution of a varied size grid which has n points How can I generate every possible solution of a varied size grid which has n points haskell How How can I generate every possible solution of a varied size grid which has n points To give overall context, I have a 2d grid of size N (the...

[ 0.0032958984375, 0.00543212890625, -0.0130615234375, -0.01251220703125, -0.01708984375, -0.000339508056640625, -0.0152587890625, -0.0174560546875, 0.004974365234375, -0.033203125, 0.0017242431640625, -0.01361083984375, 0.000164031982421875, -0.010986328125, -0.0205078125, 0.00772094726...

[ 11249, 831, 87, 139392, 11907, 7722, 29806, 10861, 297, 13267, 120067, 1556, 653, 26847, 111, 142508, 128512, 43701, 116, 71, 541, 51529, 285, 11343, 108047, 1022, 33102, 113, 276, 31577, 7413, 41170, 31913, 959, 3444, 8560, 8305, 12989, 41...

[ 0.08111572265625, 0.084716796875, 0.049774169921875, 0.2244873046875, 0.206787109375, 0.207275390625, 0.2174072265625, 0.173828125, 0.0780029296875, 0.1297607421875, 0.267822265625, 0.15380859375, 0.1453857421875, 0.177001953125, 0.00775146484375, 0.236572265625, 0.011383056640625, ...

embed

30555469_c2

30555469

haskell

2

fPtru6/HSbinary-0.7.3.0-EKE3c9Lmxb3DQpU0fPtru6.o \ /c/ghc/ghc-7.10.1/lib/array_FaHmcBFfuRM8kmZLEY8D5S/HSarray-0.5.1.0-FaHmcBFfuRM8kmZLEY8D5S.o \ .cabal-sandbox/i386-windows-ghc-7.10.1/split_EzXNp9Mcx6zDnUvRChe0Sw/HSsplit-0.2.2-EcQml2WFBePDKSCjwazauo.o This dll library is later used to link program with it (qt project) ...

making haskell dll libraries out of box. According to https://downloads.haskell.org/~ghc/7.0.3/docs/html/users_guide/win32-dlls.html I have compiled such a library to dll (compilation works). This dll library is later used to link program with it (qt project) qt compilation also succeeds, but when I try to run the pro...

[ 0.00106048583984375, -0.00537109375, 0.002105712890625, -0.009765625, -0.0220947265625, 0.004150390625, -0.007415771484375, 0.0062255859375, -0.00579833984375, -0.01080322265625, 0.00160980224609375, -0.024169921875, 0.0201416015625, -0.0068359375, 0.022705078125, -0.0026397705078125, ...

[ 20662, 1556, 142508, 81717, 35773, 10484, 1810, 111, 16530, 61754, 10557, 9486, 238, 129884, 29713, 7693, 64527, 9494, 6460, 71, 42458, 375, 5974, 6044, 1294, 47, 43240, 14432, 11814, 3126, 1528, 678, 864, 18, 13452, 8096, 98352, 214493, 97...

[ 0.111572265625, 0.1790771484375, 0.2578125, 0.2332763671875, 0.251708984375, 0.1239013671875, 0.087890625, 0.0809326171875, 0.167724609375, 0.0709228515625, 0.1304931640625, 0.06451416015625, 0.0816650390625, 0.041748046875, 0.00299072265625, 0.0809326171875, 0.046630859375, 0.0124...

embed

62047071_c0

62047071

haskell

0

Title: Why my output is "()" and how can i fix it? Problem title: Why my output is "()" and how can i fix it? Tags: file, haskell, output Problem: Why my output is "()" and how can i fix it? I do work with text rotate from a txt file, I'm stuck on the simplest thing - output back to the same file. A...

Why my output is "()" and how can i fix it? Why my output is "()" and how can i fix it? file haskell output System.IO Why main2 Char Double output.txt input.txt mapM_ x-5 y-1 Why my output is "()" and how can i fix it? I do work with text rotate from a txt file, I'm stuck on the simplest thing - out...

[ 0.00909423828125, -0.01348876953125, 0.01165771484375, 0.00020313262939453125, -0.00994873046875, 0.017333984375, 0.01043701171875, 0.004150390625, 0.00049591064453125, 0.0263671875, -0.0013275146484375, 0.0084228515625, -0.004730224609375, -0.0179443359375, 0.003692626953125, 0.005523...

[ 44084, 759, 140992, 83, 41502, 74, 132, 1230, 136, 3642, 831, 17, 30022, 442, 619, 11435, 1556, 142508, 12353, 17780, 5201, 304, 21656, 107172, 124326, 107730, 22288, 594, 1022, 10342, 113, 5759, 16, 4488, 678, 7986, 47014, 67, 1295, 1799...

[ 0.13671875, 0.07794189453125, 0.302978515625, 0.0975341796875, 0.1336669921875, 0.00579833984375, 0.1925048828125, 0.0173797607421875, 0.0216827392578125, 0.044036865234375, 0.0452880859375, 0.0281524658203125, 0.1689453125, 0.057830810546875, 0.0084228515625, 0.148193359375, 0.16284...

embed

41205566_c0

41205566

haskell

0

Title: Haskell: How do you figure out the definition of <*> from a Monad definition? Problem title: Haskell: How do you figure out the definition of <*> from a Monad definition? Tags: haskell, parsing, applicative Problem: Haskell: How do you figure out the definition of <*> from a Monad definition? I have ...

Haskell: How do you figure out the definition of <*> from a Monad definition? Haskell: How do you figure out the definition of <*> from a Monad definition? haskell parsing applicative a Haskell How Monad Parser Haskell: How do you figure out the definition of <*> from a Monad definition? I have a parser obj...

[ 0.0084228515625, 0.030517578125, 0.004058837890625, 0.0306396484375, 0.003936767578125, 0.0235595703125, -0.007293701171875, -0.0108642578125, 0.0027618408203125, -0.0233154296875, 0.0201416015625, -0.025390625, -0.0145263671875, -0.003875732421875, 0.000598907470703125, -0.00897216796...

[ 20625, 142508, 11249, 26366, 1810, 80934, 111, 1277, 1639, 1230, 5386, 1295, 60331, 71, 619, 74, 1556, 366, 6953, 41816, 4935, 2392, 2189, 4426, 2740, 36746, 61924, 32354, 27489, 110527, 63769, 68557, 48716, 7, 1314, 3934, 1632, 17368, 7520...

[ 0.1097412109375, 0.2393798828125, 0.0452880859375, 0.1387939453125, 0.0906982421875, 0.228271484375, 0.051788330078125, 0.08355712890625, 0.1895751953125, 0.0406494140625, 0.144775390625, 0.0831298828125, 0.1988525390625, 0.169921875, 0.011322021484375, 0.041961669921875, 0.071960449...

embed

28603585_c0

28603585

haskell

0

Title: haskell state monad in function and argument Problem title: haskell state monad in function and argument Tags: state-monad, haskell Problem: haskell state monad in function and argument I have a question regarding the usage of the state monad if a function and its argument, that is also a function, both change t...

haskell state monad in function and argument haskell state monad in function and argument state-monad haskell Control.Monad.State Main test1 test2 MyState MyStateMonadT StateT Foo Bar haskell state monad in function and argument I have a question regarding the usage of the state monad if a function and its argument, th...

[ -0.007293701171875, -0.0032196044921875, -0.01251220703125, 0.0169677734375, 0.00946044921875, 0.01123046875, -0.00433349609375, 0.0023193359375, -0.012451171875, -0.00055694580078125, 0.01300048828125, 0.01513671875, -0.0152587890625, 0.03369140625, -0.0009765625, -0.0234375, -0.003...

[ 1556, 142508, 11341, 2667, 712, 23, 32354, 136, 10750, 3796, 27131, 46674, 135206, 12321, 3034, 2646, 618, 22836, 9572, 31, 3253, 9655, 127689, 2174, 6863, 15044, 15549, 16610, 5775, 65572, 1909, 3444, 11782, 75447, 5423, 47, 1299, 4734, 35...

[ 0.11376953125, 0.2149658203125, 0.197265625, 0.1390380859375, 0.221923828125, 0.045562744140625, 0.1982421875, 0.08935546875, 0.23095703125, 0.116455078125, 0.12841796875, 0.078125, 0.1318359375, 0.013458251953125, 0.1204833984375, 0.04547119140625, 0.0845947265625, 0.12890625, 0...

embed

76720149_c0

76720149

haskell

0

Title: ghci not creating new lines (outputs are on the same line too) Problem title: ghci not creating new lines (outputs are on the same line too) Tags: ghci, haskell Problem: ghci not creating new lines (outputs are on the same line too) I have just got Haskell installed using GHCup in WSL2 (Ubuntu). However, there i...

ghci not creating new lines (outputs are on the same line too) ghci not creating new lines (outputs are on the same line too) ghci haskell GHCi www.haskell.org ghci not creating new lines (outputs are on the same line too) I have just got Haskell installed using GHCup in WSL2 (Ubuntu). However, there is a problem with ...

[ -0.0089111328125, 0.0028228759765625, 0.0023651123046875, 0.00970458984375, -0.017822265625, 0.0111083984375, 0.01416015625, 0.0031585693359375, -0.00732421875, -0.00714111328125, -0.0174560546875, -0.036865234375, -0.0033111572265625, -0.003814697265625, -0.01422119140625, 0.011169433...

[ 31380, 318, 959, 105233, 3525, 124519, 6056, 7077, 621, 98, 5701, 13315, 5792, 1556, 142508, 527, 73265, 14, 10557, 1478, 20625, 20600, 2037, 601, 30508, 304, 79249, 34, 2967, 29481, 56, 4034, 24234, 30957, 18, 28282, 28412, 130250, 183114,...

[ 0.16455078125, 0.2122802734375, 0.08819580078125, 0.1981201171875, 0.1290283203125, 0.1944580078125, 0.1190185546875, 0.140380859375, 0.023712158203125, 0.0657958984375, 0.119384765625, 0.1571044921875, 0.05145263671875, 0.1163330078125, 0.2174072265625, 0.0941162109375, 0.1096191406...

embed

59108015_c0

59108015

haskell

0

Title: Haskell - Translate a list to a recursive data structure Problem title: Haskell - Translate a list to a recursive data structure Tags: haskell, tree, recursion, binary-tree Problem: Haskell - Translate a list to a recursive data structure I found this problem in a Haskell textbook. Given a recursive data structu...

Haskell - Translate a list to a recursive data structure Haskell - Translate a list to a recursive data structure haskell tree recursion binary-tree Haskell Translate Foo Haskell - Translate a list to a recursive data structure I found this problem in a Haskell textbook. Given a recursive data structure: create a funct...

[ 0.0155029296875, 0.0001201629638671875, -0.00775146484375, 0.021728515625, 0.0274658203125, 0.007080078125, -0.02001953125, -0.0036163330078125, 0.0096435546875, -0.0147705078125, -0.00160980224609375, -0.031494140625, -0.0021514892578125, 0.01806640625, 0.00225830078125, -0.0257568359...

[ 20625, 142508, 11062, 19309, 5303, 47, 10, 195625, 5844, 2053, 45646, 1556, 53201, 2394, 6635, 62600, 9572, 31, 14037, 2967, 7986, 14137, 28282, 32354, 51776, 136, 4027, 25720, 30646, 3525, 9007, 538, 214, 26950, 151552, 27781, 61924, 335, ...

[ 0.150146484375, 0.253173828125, 0.1533203125, 0.1822509765625, 0.20068359375, 0.1092529296875, 0.033660888671875, 0.245849609375, 0.1485595703125, 0.1011962890625, 0.2332763671875, 0.138671875, 0.1573486328125, 0.1129150390625, 0.0254669189453125, 0.1304931640625, 0.15771484375, 0....

embed

45385105_c0

45385105

haskell

0

Title: "Insert disk into Drive D" blocks Haskell from starting Problem title: "Insert disk into Drive D" blocks Haskell from starting Tags: haskell Problem: "Insert disk into Drive D" blocks Haskell from starting This question is an outgrowth of another question . In that question I asked for advice...

"Insert disk into Drive D" blocks Haskell from starting "Insert disk into Drive D" blocks Haskell from starting haskell starting Insert Drive Haskell Heap "Insert disk into Drive D" blocks Haskell from starting This question is an outgrowth of another question . In that question I asked for advice f...

[ -0.0050048828125, 0.00738525390625, -0.00933837890625, 0.00135040283203125, -0.00299072265625, 0.013916015625, -0.00799560546875, -0.03173828125, 0.0031280517578125, -0.0230712890625, 0.0108642578125, -0.01251220703125, 0.01104736328125, 0.01025390625, 0.0079345703125, 0.016845703125, ...

[ 4153, 33657, 28338, 3934, 50161, 391, 46389, 20625, 142508, 1295, 72134, 1556, 1529, 2631, 67660, 24927, 11809, 13025, 20600, 20819, 13028, 3773, 18499, 16530, 160, 110, 23, 183540, 17262, 77679, 11137, 24812, 40858, 110196, 79786, 67153, 527, ...

[ 0.0496826171875, 0.1693115234375, 0.1295166015625, 0.1158447265625, 0.1451416015625, 0.19140625, 0.1934814453125, 0.1527099609375, 0.2666015625, 0.0170745849609375, 0.093017578125, 0.1317138671875, 0.17724609375, 0.1737060546875, 0.027191162109375, 0.1846923828125, 0.0916748046875, ...

embed

58347892_c1

58347892

haskell

1

centroid’: centroid cenpoint = (Pt average (pointsX cenpoint) average (pointsY cenpoint)) | 35 | centroid cenpoint = (Pt average(pointsX cenpoint) average(pointsY cenpoint)) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Project1.hs:35:25: error: • Couldn't match expected type ‘Double’ with actual type ‘[Doub...

[ 0.0034637451171875, -0.017333984375, 0.004852294921875, 0.00762939453125, 0.01080322265625, 0.00872802734375, 0.008056640625, -0.0087890625, -0.01220703125, -0.00213623046875, -0.01123046875, -0.0240478515625, 0.005889892578125, -0.0179443359375, -0.0164794921875, 0.00811767578125, 0...

[ 5863, 532, 26, 12, 11662, 38496, 2203, 683, 18, 83080, 7, 1542, 1723, 58745, 2273, 6, 16377, 27331, 418, 127, 27144, 21224, 18499, 768, 191147, 14858, 84751, 10644, 8331, 34, 2661, 8561, 107172, 1250, 275, 22304, 8216, 29838, 190659, 47, ...

[ 0.26123046875, 0.278564453125, 0.087646484375, 0.0445556640625, 0.251953125, 0.259521484375, 0.127197265625, 0.135498046875, 0.1834716796875, 0.27587890625, 0.025726318359375, 0.1153564453125, 0.150634765625, 0.039215087890625, 0.2259521484375, 0.029815673828125, 0.042449951171875, ...

embed

15641584_c0

15641584

haskell

0

Title: Haskell IO: convert IO String to "Other type" Problem title: Haskell IO: convert IO String to "Other type" Tags: binary-search-tree, haskell Problem: Haskell IO: convert IO String to "Other type" I have a Haskell program which takes a file as an input and convert it into a binary search tree....

Haskell IO: convert IO String to "Other type" Haskell IO: convert IO String to "Other type" binary-search-tree haskell System.IO Haskell Other Tree EmptyBST Node Show Read Ord tree.txt Couldn Haskell IO: convert IO String to "Other type" I have a Haskell program which takes a file as an input and co...

[ -0.000782012939453125, -0.00762939453125, -0.0103759765625, -0.01446533203125, 0.0084228515625, 0.025146484375, -0.0220947265625, -0.008544921875, -0.0027008056640625, -0.043212890625, -0.00885009765625, -0.0380859375, 0.009521484375, 0.000873565673828125, 0.01080322265625, -0.00561523...

[ 20625, 142508, 17780, 96760, 23351, 214, 47, 670, 9319, 10644, 12, 2394, 6635, 86250, 62600, 1556, 12353, 64511, 101344, 31678, 939, 8545, 438, 112, 17367, 4764, 35379, 53201, 124326, 191147, 1528, 51776, 11435, 107730, 3934, 33938, 11675, 75...

[ 0.1207275390625, 0.211181640625, 0.22802734375, 0.1800537109375, 0.193359375, 0.075927734375, 0.06640625, 0.113037109375, 0.14794921875, 0.1962890625, 0.026214599609375, 0.1241455078125, 0.06365966796875, 0.1156005859375, 0.1500244140625, 0.09600830078125, 0.053741455078125, 0.1937...

embed

41354231_c0

41354231

haskell

0

Title: How can I set up Haskell's GHCI to interactively evaluate functions to their signature (type) instead of getting errors? Problem title: How can I set up Haskell's GHCI to interactively evaluate functions to their signature (type) instead of getting errors? Tags: ghci, ghc, types, haskell Problem: How c...

How can I set up Haskell's GHCI to interactively evaluate functions to their signature (type) instead of getting errors? How can I set up Haskell's GHCI to interactively evaluate functions to their signature (type) instead of getting errors? ghci ghc types haskell a How Haskell GHCI Prelude Num Show How can I...

[ 0.003997802734375, 0.0016632080078125, 0.012451171875, 0.0125732421875, -0.00093841552734375, -0.0030059814453125, -0.0035552978515625, -0.00396728515625, -0.0052490234375, -0.014404296875, -0.00811767578125, -0.039794921875, 0.002166748046875, -0.0074462890625, 0.00274658203125, 0.015...

[ 11249, 831, 5423, 1257, 20625, 142508, 3768, 41877, 17304, 212398, 151575, 32354, 47, 138256, 50986, 64457, 20949, 18499, 31380, 318, 238, 52895, 1556, 10, 1914, 822, 112, 52782, 17367, 1957, 183114, 442, 678, 152, 18, 11417, 11907, 1733, 5...

[ 0.03240966796875, 0.046661376953125, 0.1221923828125, 0.0836181640625, 0.1357421875, 0.255615234375, 0.043121337890625, 0.17041015625, 0.2255859375, 0.172119140625, 0.15625, 0.184326171875, 0.05908203125, 0.2274169921875, 0.181640625, 0.0994873046875, 0.0450439453125, 0.17102050781...

embed

5131182_c2

5131182

haskell

2

1000) libdl.so.2 => /lib/libdl.so.2 (0x00007f5000e5d000) libc.so.6 => /lib/libc.so.6 (0x00007f5000afc000) libpthread.so.0 => /lib/libpthread.so.0 (0x00007f50008df000) /lib/ld-linux-x86-64.so.2 (0x00007f5001759000) If I try to compile it with(without '-dynamic'): $ ghc --make -shared -fPIC foo.hs -o libfoo.so Linking li...

[ 0.0037689208984375, -0.01458740234375, 0.01165771484375, -0.007171630859375, 0.0069580078125, 0.00341796875, -0.037109375, 0.0157470703125, -0.025634765625, -0.037109375, -0.017578125, -0.0196533203125, -0.00616455078125, 0.00518798828125, -0.0123291015625, -0.0186767578125, 0.025390...

[ 4382, 25474, 20469, 991, 304, 44357, 248, 5612, 28568, 420, 29213, 9508, 238, 910, 254, 39116, 2389, 7344, 2397, 6077, 15276, 13307, 9790, 9969, 1340, 442, 678, 6056, 242554, 3650, 31380, 55898, 67886, 126091, 5775, 31, 127, 3584, 12779, ...

[ 0.212890625, 0.169677734375, 0.22705078125, 0.18017578125, 0.1873779296875, 0.014007568359375, 0.00927734375, 0.14306640625, 0.02752685546875, 0.0694580078125, 0.0958251953125, 0.050506591796875, 0.1513671875, 0.162353515625, 0.0251922607421875, 0.142822265625, 0.076904296875, 0.16...

embed

70307110_c0

70307110

haskell

0

Title: Cannot represent equality constraint as a custom constraint Problem title: Cannot represent equality constraint as a custom constraint Tags: haskell, typeclass, yesod Problem: Cannot represent equality constraint as a custom constraint I have a function type declaration f :: MonadHandler m => SqlPersistT m () Wh...

Cannot represent equality constraint as a custom constraint Cannot represent equality constraint as a custom constraint haskell typeclass yesod Cannot MonadHandler SqlPersistT MonadHandlerDB Couldn ReaderT backend0 SqlBackend Cannot represent equality constraint as a custom constraint I have a function type declaration...

[ 0.00732421875, 0.0091552734375, -0.00933837890625, 0.01153564453125, -0.010986328125, -0.00836181640625, -0.024169921875, -0.019287109375, 0.002166748046875, -0.02490234375, -0.01153564453125, -0.01251220703125, -0.000797271728515625, -0.004608154296875, -0.003143310546875, -0.00004076...

[ 4171, 10869, 33636, 28, 161789, 158, 2816, 4288, 237, 114122, 1556, 142508, 10644, 67413, 2422, 23722, 60331, 71, 135679, 603, 99247, 15277, 57702, 618, 39463, 191147, 122636, 4420, 3611, 2389, 152470, 32354, 21635, 96760, 61924, 53418, 9969, ...

[ 0.035858154296875, 0.1246337890625, 0.2149658203125, 0.0531005859375, 0.241455078125, 0.09228515625, 0.2017822265625, 0.12109375, 0.054046630859375, 0.18408203125, 0.099853515625, 0.1824951171875, 0.14501953125, 0.1624755859375, 0.1331787109375, 0.2109375, 0.1295166015625, 0.069702...

embed

73765638_c0

73765638

haskell

0

Title: Empty list in Haskell is not running in function even though I have a base case checking for empty lists Problem title: Empty list in Haskell is not running in function even though I have a base case checking for empty lists Tags: empty-list, haskell, quicksort Problem: Empty list in Haskell is not running in fu...

Empty list in Haskell is not running in function even though I have a base case checking for empty lists Empty list in Haskell is not running in function even though I have a base case checking for empty lists empty-list haskell quicksort a being Prelude Empty Haskell Ord x:xs list1 list2 list3 Main.hs:29:11 Ambiguous ...

[ -0.000339508056640625, 0.00482177734375, 0.005859375, -0.006256103515625, -0.0024566650390625, 0.016357421875, -0.01312255859375, -0.02734375, 0.003021240234375, 0.034423828125, 0.00958251953125, -0.0013885498046875, -0.00109100341796875, -0.003692626953125, 0.0079345703125, 0.01037597...

[ 31678, 939, 5303, 20625, 142508, 959, 51042, 23, 32354, 3853, 21208, 3647, 7225, 175199, 201505, 6562, 1556, 63773, 62351, 8035, 1914, 822, 35379, 363, 12321, 5, 29223, 19993, 10250, 12282, 1250, 275, 2886, 32255, 81206, 214, 5983, 527, 732...

[ 0.1903076171875, 0.158935546875, 0.2340087890625, 0.117431640625, 0.22216796875, 0.12744140625, 0.1275634765625, 0.047698974609375, 0.144775390625, 0.00543212890625, 0.003570556640625, 0.1710205078125, 0.1502685546875, 0.19580078125, 0.2000732421875, 0.1685791015625, 0.08349609375, ...

embed

9138760_c0

9138760

haskell

0

Title: I'm confused about what's recursive, tail recursive, primitive recursive and what's not Problem title: I'm confused about what's recursive, tail recursive, primitive recursive and what's not Tags: functional-programming, haskell, recursion, tail-recursion Problem: I'm confused about...

I'm confused about what's recursive, tail recursive, primitive recursive and what's not I'm confused about what's recursive, tail recursive, primitive recursive and what's not functional-programming haskell recursion tail-recursion System.Random MyProgram Guess num1 Too Congratulations You...

[ -0.01904296875, 0.003875732421875, 0.0037078857421875, 0.006256103515625, 0.0264892578125, 0.03759765625, -0.01806640625, -0.0203857421875, -0.0172119140625, -0.00555419921875, 0.001434326171875, -0.02294921875, -0.0181884765625, 0.0101318359375, 0.0198974609375, 0.01422119140625, 0....

[ 3768, 55681, 5281, 2367, 195625, 5844, 46741, 128489, 13, 959, 123309, 28966, 1556, 142508, 1830, 107, 48650, 12353, 126525, 3815, 2646, 148968, 96274, 7, 13269, 418, 56374, 71867, 72403, 136, 59121, 8781, 57767, 70, 14012, 1528, 3871, 3714, ...

[ 0.046722412109375, 0.1234130859375, 0.0684814453125, 0.03326416015625, 0.25390625, 0.1785888671875, 0.257568359375, 0.22265625, 0.127685546875, 0.1761474609375, 0.175537109375, 0.1107177734375, 0.130126953125, 0.20166015625, 0.1107177734375, 0.0845947265625, 0.1649169921875, 0.1247...

embed

58639719_c1

58639719

haskell

1

"@" t of 0 -> Left (InvalidEmailAddress t "Must contain @ symbol") 1 -> Right (ValidEmailAddress t) _ -> Left (InvalidEmailAddress t "Contains more than one @ symbol") instance PersistFieldSql EmailAddress where sqlType _ = SqlString instance PersistField EmailAddress where fromPersistValue = decodePersistTextValue pa...

[ 0.021240234375, 0.02099609375, -0.0024871826171875, 0.00872802734375, -0.00167083740234375, 0.023681640625, -0.02880859375, -0.0079345703125, -0.0028839111328125, -0.01226806640625, 0.01495361328125, 0.000682830810546875, 0.004913330078125, 0.01055908203125, -0.005340576171875, 0.00921...

[ 981, 808, 111, 757, 33079, 636, 2480, 4153, 7013, 161994, 161007, 55668, 18, 70541, 1374, 26582, 106, 90911, 42272, 11935, 25500, 1286, 3501, 1632, 110527, 57309, 271, 6159, 19388, 99247, 14886, 196707, 159, 71713, 1295, 15277, 57702, 856, ...

[ 0.2149658203125, 0.0989990234375, 0.0887451171875, 0.145263671875, 0.053558349609375, 0.026458740234375, 0.1014404296875, 0.03466796875, 0.1612548828125, 0.116455078125, 0.15625, 0.123779296875, 0.0755615234375, 0.2088623046875, 0.234130859375, 0.2470703125, 0.05487060546875, 0.117...

embed

17055761_c0

17055761

haskell

0

Title: How to use Pandoc's writeHtmlString when using IO String for template Problem title: How to use Pandoc's writeHtmlString when using IO String for template Tags: haskell, pandoc Problem: How to use Pandoc's writeHtmlString when using IO String for template I am reading the template file when converting ...

How to use Pandoc's writeHtmlString when using IO String for template How to use Pandoc's writeHtmlString when using IO String for template haskell pandoc IO How Pandoc File Path template.html WriterOptions FilePath Couldn How to use Pandoc's writeHtmlString when using IO String for template I am reading the ...

[ -0.0040283203125, 0.00787353515625, 0.0008087158203125, -0.00007915496826171875, -0.01031494140625, -0.005828857421875, -0.00848388671875, -0.0036773681640625, 0.01019287109375, -0.015869140625, 0.0038299560546875, -0.034423828125, 0.01092529296875, -0.0096435546875, 0.021240234375, -0...

[ 11249, 4527, 4378, 29713, 3768, 33022, 841, 18, 7237, 71713, 214, 3229, 17368, 17780, 23351, 100, 110934, 7, 1556, 142508, 2652, 42724, 108421, 7693, 2783, 39029, 683, 10519, 191147, 16454, 11435, 96760, 16188, 34695, 102158, 31577, 11301, 26...

[ 0.05499267578125, 0.1162109375, 0.1326904296875, 0.2193603515625, 0.0863037109375, 0.2066650390625, 0.0963134765625, 0.1309814453125, 0.1834716796875, 0.2164306640625, 0.09844970703125, 0.015533447265625, 0.05712890625, 0.206787109375, 0.1937255859375, 0.07171630859375, 0.25024414062...

embed

23008805_c0

23008805

haskell

0

Title: How to set cabal extra dirs for all packages in a sandbox Problem title: How to set cabal extra dirs for all packages in a sandbox Tags: haskell, cabal, cabal-install Problem: How to set cabal extra dirs for all packages in a sandbox I'm currently working on a Haskell project that uses lots of native code. This ...

How to set cabal extra dirs for all packages in a sandbox How to set cabal extra dirs for all packages in a sandbox haskell cabal cabal-install How How to set cabal extra dirs for all packages in a sandbox I'm currently working on a Haskell project that uses lots of native code. This means that include files and librar...

[ 0.0052490234375, -0.002532958984375, 0.0174560546875, 0.009033203125, -0.01708984375, -0.01300048828125, -0.01373291015625, 0.045654296875, -0.00051116943359375, -0.01263427734375, -0.0103759765625, -0.0203857421875, 0.01031494140625, 0.0048828125, -0.00628662109375, -0.00408935546875,...

[ 11249, 5423, 109524, 4173, 5402, 7, 100, 756, 98169, 19096, 11728, 23, 1556, 142508, 80383, 20697, 20625, 13452, 4527, 71358, 24, 4935, 18151, 26698, 102158, 35773, 81522, 4210, 112779, 5612, 936, 217028, 75101, 2256, 49938, 60213, 71864, 796...

[ 0.036163330078125, 0.1610107421875, 0.25927734375, 0.197509765625, 0.2144775390625, 0.1209716796875, 0.07293701171875, 0.1297607421875, 0.2215576171875, 0.1448974609375, 0.1903076171875, 0.0450439453125, 0.0806884765625, 0.1903076171875, 0.13525390625, 0.0179443359375, 0.071350097656...

embed

52799484_c0

52799484

haskell

0

Title: Haskell ghci cannot load file Problem title: Haskell ghci cannot load file Tags: haskell, ghci Problem: Haskell ghci cannot load file I am new to Haskell and trying to play around with it. Therefore I want to define some functions in a file and then load them in ghci . I have a file called tryout.hl which I want...

Haskell ghci cannot load file Haskell ghci cannot load file haskell ghci Haskell tryout.hl Oct Num Ord x:xs n-1 GHCi www.haskell.org Prelude Haskell ghci cannot load file I am new to Haskell and trying to play around with it. Therefore I want to define some functions in a file and then load them in ghci . I have a file...

[ 0.01470947265625, -0.00811767578125, 0.01068115234375, 0.015869140625, -0.00634765625, 0.002197265625, -0.00823974609375, 0.006622314453125, -0.0062255859375, -0.0194091796875, -0.0145263671875, -0.044921875, -0.014404296875, -0.00128936767578125, -0.0028228759765625, -0.0059814453125,...

[ 20625, 142508, 31380, 318, 53418, 72367, 11435, 1556, 9790, 6056, 8266, 33649, 52782, 35379, 1022, 425, 5759, 527, 73265, 14, 10557, 1478, 1914, 822, 112, 3525, 31577, 11301, 3444, 61924, 32354, 10, 141, 63033, 15044, 75101, 30388, 15123, 9...

[ 0.1390380859375, 0.2239990234375, 0.177734375, 0.2401123046875, 0.19970703125, 0.2225341796875, 0.1912841796875, 0.1331787109375, 0.16259765625, 0.1981201171875, 0.1751708984375, 0.1212158203125, 0.073974609375, 0.0933837890625, 0.016448974609375, 0.029876708984375, 0.0723876953125, ...

embed

65183913_c0

65183913

haskell

0

Title: Printing out a rose tree...? Problem title: Printing out a rose tree...? Tags: string, show, tree, haskell Problem: Printing out a rose tree...? I am currently learning Haskell in one of my online classes at the university. I now have to write a program that can work with a rose tree. Right now it looks like thi...

Printing out a rose tree...? Printing out a rose tree...? string show tree haskell Printing Rose testTree1 Pretty Test Printing out a rose tree...? I am currently learning Haskell in one of my online classes at the university. I now have to write a program that can work with a rose tree. Right now it looks like this: O...

[ -0.01025390625, -0.00018596649169921875, -0.0031890869140625, 0.005889892578125, 0.015380859375, 0.004669189453125, -0.01263427734375, -0.00933837890625, 0.0022430419921875, 0.007354736328125, 0.0069580078125, -0.031982421875, 0.006072998046875, 0.003662109375, -0.016845703125, -0.0087...

[ 39754, 1810, 10, 49175, 53201, 27, 214, 79315, 7639, 1556, 142508, 24009, 3034, 62731, 13, 418, 197570, 8647, 52080, 20625, 1118, 61112, 152363, 33022, 1528, 4488, 678, 33342, 159029, 3884, 71713, 866, 19, 56359, 939, 6954, 17727, 16750, 67...

[ 0.1871337890625, 0.124267578125, 0.011199951171875, 0.2022705078125, 0.23095703125, 0.009735107421875, 0.068115234375, 0.181884765625, 0.1358642578125, 0.1016845703125, 0.218505859375, 0.204833984375, 0.1395263671875, 0.2158203125, 0.004058837890625, 0.0538330078125, 0.1834716796875,...

embed

33324827_c0

33324827

haskell

0

Title: Yesod hamlet loop broken down by categories Problem title: Yesod hamlet loop broken down by categories Tags: haskell, hamlet, yesod Problem: Yesod hamlet loop broken down by categories I am trying to loop through a list of products in hamlet each product has a category. I would like to break down the output to g...

Yesod hamlet loop broken down by categories Yesod hamlet loop broken down by categories haskell hamlet yesod Yesod col-md-12 Product Category ProductName LimitTo Entity Just Yesod hamlet loop broken down by categories I am trying to loop through a list of products in hamlet each product has a category. I would like to ...

[ 0.011962890625, -0.005645751953125, -0.004180908203125, 0.004638671875, -0.0111083984375, 0.01055908203125, -0.01324462890625, -0.00518798828125, -0.004364013671875, -0.03515625, -0.003997802734375, -0.01080322265625, -0.0162353515625, -0.0093994140625, 0.000904083251953125, -0.0115356...

[ 32635, 2199, 2057, 1974, 40956, 148431, 7565, 390, 39283, 1556, 142508, 2422, 23722, 3365, 54686, 9955, 73111, 49057, 163612, 125177, 7763, 16511, 9563, 31577, 8305, 5303, 38742, 12638, 12996, 95487, 1884, 36356, 140992, 21115, 35064, 10336, 21...

[ 0.1593017578125, 0.2413330078125, 0.1610107421875, 0.213134765625, 0.1820068359375, 0.0943603515625, 0.1307373046875, 0.033203125, 0.2144775390625, 0.1014404296875, 0.20166015625, 0.1160888671875, 0.2095947265625, 0.0853271484375, 0.05352783203125, 0.130615234375, 0.124755859375, 0...

embed

37734954_c0

37734954

haskell

0

Title: Print function that returns int Problem title: Print function that returns int Tags: haskell Problem: Print function that returns int In Haskell, I am trying to print a method which returns an Int . For now, mySum is just a stub because I'm trying to figure out how to print it. I looked up how to do this and I s...

Print function that returns int Print function that returns int haskell main Print Couldn Integer Relevant weirdFold.hs:10:1 Char Expected Actual Probable Print function that returns int In Haskell, I am trying to print a method which returns an Int . For now, mySum is just a stub because I'm trying to figure out how t...

[ -0.031494140625, -0.01080322265625, 0.01409912109375, 0.0140380859375, -0.01055908203125, 0.03173828125, -0.00830078125, -0.004364013671875, 0.0032196044921875, -0.003997802734375, -0.0142822265625, -0.0274658203125, 0.0009765625, 0.0181884765625, 0.01318359375, 0.0054931640625, -0.0...

[ 39754, 32354, 450, 30646, 7, 23, 18, 1556, 142508, 5201, 191147, 19, 44401, 133, 179459, 18345, 127, 15110, 19721, 21656, 60075, 13, 100582, 1250, 275, 2886, 20625, 31577, 28412, 55300, 360, 759, 294, 316, 136057, 26366, 3884, 71713, 831, ...

[ 0.2257080078125, 0.198486328125, 0.0665283203125, 0.1915283203125, 0.0567626953125, 0.1397705078125, 0.147216796875, 0.128662109375, 0.2056884765625, 0.090576171875, 0.115966796875, 0.052734375, 0.154541015625, 0.0782470703125, 0.1685791015625, 0.154052734375, 0.0706787109375, 0.08...

embed

32129818_c0

32129818

haskell

0

Title: Miranda To Haskell - What is the improved version? Problem title: Miranda To Haskell - What is the improved version? Tags: haskell Problem: Miranda To Haskell - What is the improved version? I'm working out the code from this paper. It's bugging me that my translation is more verbose. It occurs to me I'm missing...

Miranda To Haskell - What is the improved version? Miranda To Haskell - What is the improved version? haskell Miranda Haskell What Leaf Internal QTree Miranda To Haskell - What is the improved version? I'm working out the code from this paper. It's bugging me that my translation is more verbose. It occurs to me I'm mis...

[ 0.0113525390625, 0.00897216796875, 0.0201416015625, 0.0068359375, 0.0194091796875, -0.00193023681640625, -0.0198974609375, -0.0361328125, 0.00604248046875, 0.0008697509765625, 0.00390625, 0.00982666015625, 0.004730224609375, 0.0052490234375, 0.0087890625, 0.00127410888671875, -0.0079...

[ 140988, 717, 20625, 142508, 4865, 83, 52295, 71, 11389, 1556, 636, 2407, 106745, 141, 2396, 62731, 70, 20697, 18151, 15122, 153648, 1286, 57823, 184, 132283, 162520, 6333, 7311, 11853, 438, 24494, 339, 38131, 111, 42564, 141621, 7225, 756, ...

[ 0.30029296875, 0.1771240234375, 0.1500244140625, 0.267333984375, 0.050750732421875, 0.027374267578125, 0.1744384765625, 0.0927734375, 0.171875, 0.1263427734375, 0.0845947265625, 0.17724609375, 0.1751708984375, 0.035797119140625, 0.0906982421875, 0.2237548828125, 0.006134033203125, ...

embed

10767736_c1

10767736

haskell

1

VU.Vector Int -> [[Bool]] -> m [Int] solveLP vmax0 elems = go vmax0 elemTrueIxs where -- could be fed to 'sequence' elemTrueIxs = [ [ ei | (ei,True) <- zip [0::Int ..] row ] | row <- elems ] go vmax [] = return [] go vmax (m:ms) = do ei <- mlist m let vmax' = vmax VU.// [(ei, maxcnt-1)] -- this operation is expensive ...

[ -0.0152587890625, 0.02294921875, 0.0069580078125, 0.0098876953125, -0.003326416015625, 0.0205078125, 0.0020904541015625, 0.00146484375, 0.017333984375, -0.0269775390625, -0.0025634765625, 0.021728515625, 0.00457763671875, 0.021240234375, -0.015869140625, 0.0181884765625, -0.003067016...

[ 120403, 5, 26455, 18770, 360, 18, 33079, 12647, 929, 347, 4153, 86869, 37352, 81, 24084, 2389, 88, 195, 2203, 738, 882, 13, 568, 425, 4210, 5809, 186, 51158, 47, 184, 944, 3956, 475, 1399, 68330, 1468, 15555, 58745, 30646, 39, 12, 443...

[ 0.259765625, 0.033294677734375, 0.1982421875, 0.13720703125, 0.0972900390625, 0.116943359375, 0.0226287841796875, 0.08270263671875, 0.158203125, 0.148193359375, 0.050811767578125, 0.1827392578125, 0.202880859375, 0.1514892578125, 0.1982421875, 0.177490234375, 0.039337158203125, 0.1...

embed

13146128_c0

13146128

haskell

0

Title: Simple Generators Problem title: Simple Generators Tags: ocaml, f%23, loops, yield, haskell Problem: Simple Generators This code comes from a paper called "Lazy v. Yield" . Its about a way to decouple producers and consumer of streams of data. I understand the Haskell portion of the code but the O'Caml/F# eludes...

Simple Generators Simple Generators ocaml f%23 loops yield haskell Simple Generators SimpleGenerators yield_handler Simple Generators This code comes from a paper called "Lazy v. Yield" . Its about a way to decouple producers and consumer of streams of data. I understand the Haskell portion of the code but the O'Caml/F...

[ 0.00347900390625, 0.01385498046875, 0.004974365234375, 0.000020623207092285156, 0.004608154296875, -0.01153564453125, -0.0037994384765625, -0.0167236328125, 0.00136566162109375, -0.040283203125, -0.0107421875, 0.0162353515625, -0.00872802734375, -0.01153564453125, 0.02392578125, -0.025...

[ 60552, 222518, 36, 9779, 141, 1238, 3949, 3742, 40956, 11180, 19388, 1556, 142508, 135932, 219, 22230, 74258, 18151, 32497, 15122, 2729, 3285, 81, 42341, 3917, 8, 12600, 8705, 108558, 136, 107222, 75973, 2053, 28219, 20625, 126826, 180, 25, ...

[ 0.2200927734375, 0.266845703125, 0.06707763671875, 0.1185302734375, 0.1458740234375, 0.0521240234375, 0.07763671875, 0.1497802734375, 0.151123046875, 0.1337890625, 0.2001953125, 0.119140625, 0.22998046875, 0.1375732421875, 0.1156005859375, 0.109375, 0.224609375, 0.157958984375, 0...

embed

15385041_c0

15385041

haskell

0

Title: How to use Data.MessagePack in Haskell Problem title: How to use Data.MessagePack in Haskell Tags: messagepack, serialization, python, haskell Problem: How to use Data.MessagePack in Haskell MessagePack is a binary serialization format, which apparently can be used from both Haskell and Python, languages that I ...

How to use Data.MessagePack in Haskell How to use Data.MessagePack in Haskell messagepack serialization python haskell How Data.MessagePack Haskell Citation Document Reference ByteString How to use Data.MessagePack in Haskell MessagePack is a binary serialization format, which apparently can be used from both Haskell a...

[ 0.0150146484375, 0.01214599609375, -0.00921630859375, 0.01080322265625, -0.0084228515625, 0.01513671875, -0.00058746337890625, -0.00299072265625, -0.01068115234375, -0.0361328125, 0.005889892578125, -0.03271484375, 0.0147705078125, 0.0264892578125, -0.01483154296875, 0.00518798828125, ...

[ 11249, 4527, 11809, 5, 594, 6011, 429, 205956, 23, 20625, 142508, 26008, 29102, 35686, 17198, 50828, 1556, 2079, 43101, 215996, 3311, 67, 71713, 48205, 4588, 2394, 6635, 47691, 9384, 11814, 1295, 136, 145581, 46876, 17664, 13452, 5665, 45646,...

[ 0.046905517578125, 0.1507568359375, 0.16162109375, 0.05816650390625, 0.0484619140625, 0.1343994140625, 0.12109375, 0.279296875, 0.0286712646484375, 0.1568603515625, 0.2152099609375, 0.13916015625, 0.2186279296875, 0.184814453125, 0.0222320556640625, 0.0904541015625, 0.09942626953125,...

embed

18028220_c0

18028220

haskell

0

Title: Haskell Parser Combinators Problem title: Haskell Parser Combinators Tags: haskell, attoparsec, parsing, parser-combinators, parsec Problem: Haskell Parser Combinators I was reading a lot about Haskell Parser Combinators and found a lot of topics like: Parsec vs Yacc/Bison/Antlr: Why and when to use Parsec? Whic...

Haskell Parser Combinators Haskell Parser Combinators haskell attoparsec parsing parser-combinators parsec Haskell Parser Combinators Generators Combinator Haskell Parser Combinators I was reading a lot about Haskell Parser Combinators and found a lot of topics like: Parsec vs Yacc/Bison/Antlr: Why and when to use Pars...

[ -0.024169921875, 0.00933837890625, 0.00872802734375, 0.024169921875, 0.006927490234375, 0.0218505859375, -0.00286865234375, -0.017822265625, -0.0096435546875, 0.003265380859375, -0.0087890625, -0.0228271484375, 0.0230712890625, 0.0033416748046875, -0.0029754638671875, -0.00251770019531...

[ 20625, 142508, 2392, 2189, 106935, 76, 22230, 1556, 243, 31, 2500, 39797, 366, 6953, 277, 19155, 222518, 19, 4597, 16454, 5915, 28451, 20209, 2369, 10060, 571, 40514, 78931, 44084, 3229, 4527, 55556, 2684, 208331, 15400, 707, 17723, 76228, ...

[ 0.1683349609375, 0.28466796875, 0.20654296875, 0.2239990234375, 0.231201171875, 0.1689453125, 0.193115234375, 0.14453125, 0.12451171875, 0.1328125, 0.1556396484375, 0.24755859375, 0.2071533203125, 0.113037109375, 0.0687255859375, 0.17626953125, 0.2322998046875, 0.170654296875, 0....

embed

38812627_c1

38812627

haskell

1

boringCmp p x y = return (p x y) -- Arbitrary ordering in a non-deterministic context cmp :: MonadPlus m => Comparison a m cmp _ _ = return True <|> return False -- Ordering lifted into a non-deterministic context liftCmp :: MonadPlus m => (a -> a -> Bool) -> Comparison a m liftCmp p x y = let b = p x y in return b <|...

[ -0.031494140625, 0.032470703125, 0.02783203125, -0.0034942626953125, 0.0106201171875, 0.014892578125, -0.003875732421875, -0.0255126953125, 0.003387451171875, -0.005584716796875, 0.005157470703125, 0.0198974609375, 0.0177001953125, 0.0019989013671875, -0.00144195556640625, 0.0004386901...

[ 3017, 214, 441, 2676, 915, 1022, 113, 2203, 30646, 254, 4210, 242522, 1294, 12989, 23, 351, 112, 30524, 48242, 43701, 1827, 1984, 60331, 71, 88225, 347, 44357, 113307, 40514, 10, 101, 87599, 22225, 184, 81206, 60520, 297, 3934, 33079, 246...

[ 0.2607421875, 0.2122802734375, 0.05340576171875, 0.267822265625, 0.1048583984375, 0.1416015625, 0.2080078125, 0.102783203125, 0.25244140625, 0.1884765625, 0.0675048828125, 0.244384765625, 0.1385498046875, 0.253173828125, 0.0310821533203125, 0.154296875, 0.09429931640625, 0.18676757...

embed

2767295_c0

2767295

haskell

0

Title: For reliable code, NModel, Spec Explorer, F# or other? Problem title: For reliable code, NModel, Spec Explorer, F# or other? Tags: asml, code-contracts, haskell, nmodel, specifications Problem: For reliable code, NModel, Spec Explorer, F# or other? I've got a business app in C#, with unit tests. Can I increase t...

For reliable code, NModel, Spec Explorer, F# or other? For reliable code, NModel, Spec Explorer, F# or other? asml code-contracts haskell nmodel specifications NModel Spec Explorer For reliable code, NModel, Spec Explorer, F# or other? I've got a business app in C#, with unit tests. Can I increase the reliability and c...

[ 0.007659912109375, 0.01300048828125, 0.005950927734375, 0.0035552978515625, -0.0023193359375, -0.00836181640625, 0.0034942626953125, 0.0087890625, 0.0057373046875, -0.015869140625, -0.02587890625, -0.01177978515625, -0.00897216796875, 0.005157470703125, 0.0224609375, 0.013671875, 0.0...

[ 1326, 215543, 18151, 541, 140290, 24990, 56489, 563, 4904, 3789, 32, 707, 237, 7237, 184103, 7, 1556, 142508, 653, 51734, 71679, 5256, 87, 4163, 8063, 4027, 23, 313, 678, 25072, 109921, 4171, 51312, 28702, 41159, 59226, 7565, 134234, 1733, ...

[ 0.111572265625, 0.245361328125, 0.239990234375, 0.1639404296875, 0.294189453125, 0.2088623046875, 0.271484375, 0.099365234375, 0.1812744140625, 0.0667724609375, 0.00958251953125, 0.06793212890625, 0.04833984375, 0.1724853515625, 0.1812744140625, 0.002044677734375, 0.09014892578125, ...

embed

44332590_c1

44332590

haskell

1

(Eq, Read, Show) instance Excludes [ExcludeProp] where excludes qs _wset mst _wrs = flip filterM (integrate' mst) $ \w -> fmap (getAny . mconcat) . sequenceA . map (fmap Any . flip runQuery w . toQuery) $ qs toQuery :: ExcludeProp -> Query Bool toQuery (ExcludeClassName s) = className =? s which can be used in the lay...

[ 0.01025390625, 0.0059814453125, -0.006591796875, -0.00360107421875, 0.00628662109375, -0.0034332275390625, 0.00347900390625, -0.02587890625, 0.016357421875, -0.0067138671875, -0.005950927734375, 0.0277099609375, 0.02392578125, -0.00021076202392578125, -0.024658203125, 0.01458740234375,...

[ 864, 4764, 17367, 110527, 110823, 822, 988, 19279, 29786, 112, 10752, 254, 39041, 8096, 434, 3509, 271, 5429, 7, 147505, 46312, 594, 100743, 62346, 299, 4460, 22288, 28541, 41732, 47, 58836, 2460, 929, 1294, 140803, 163612, 91, 18507, 11814...

[ 0.1319580078125, 0.1741943359375, 0.1641845703125, 0.207275390625, 0.1375732421875, 0.2047119140625, 0.1282958984375, 0.051727294921875, 0.169677734375, 0.108642578125, 0.155517578125, 0.1048583984375, 0.182861328125, 0.080322265625, 0.046478271484375, 0.169677734375, 0.0579223632812...

embed

48313442_c1

48313442

haskell

1

specified by relative directory name packages: - . - ./compdata - ./comptrans - ./compstrat - location: git: git@github.com:jkoppel/language-java.git commit: 68e71843294b233c36b3cbe52d9b1e35a5898997 extra-dep: true - location: git: git@github.com:dvekeman/language-c.git commit: caf4888d6c32d97f57d5107db3369e90b5d2649e...

[ -0.019775390625, -0.00201416015625, 0.02587890625, 0.01708984375, 0.01007080078125, 0.0220947265625, -0.007049560546875, 0.00860595703125, 0.00555419921875, 0.022216796875, -0.0206298828125, -0.0079345703125, -0.005096435546875, 0.01708984375, -0.0172119140625, 0.0106201171875, -0.00...

[ 58735, 297, 390, 35845, 14364, 53, 9351, 98169, 12, 64, 58875, 10135, 30145, 2816, 18, 31913, 62270, 15769, 32102, 170, 265, 36737, 196651, 24071, 375, 4007, 12045, 4173, 112, 254, 29568, 15116, 62368, 238, 377, 420, 33554, 6493, 50828, 4...

[ 0.25830078125, 0.08233642578125, 0.091796875, 0.29736328125, 0.17431640625, 0.0946044921875, 0.1573486328125, 0.299072265625, 0.00537109375, 0.0245361328125, 0.167724609375, 0.2249755859375, 0.2247314453125, 0.1715087890625, 0.13232421875, 0.15966796875, 0.20361328125, 0.2418212890...

embed

7717691_c0

7717691

haskell

0

Title: Why is the minimalist, example Haskell quicksort not a "true" quicksort? Problem title: Why is the minimalist, example Haskell quicksort not a "true" quicksort? Tags: sorting, quicksort, haskell Problem: Why is the minimalist, example Haskell quicksort not a "true" quicksort? Haskell's websit...

Why is the minimalist, example Haskell quicksort not a "true" quicksort? Why is the minimalist, example Haskell quicksort not a "true" quicksort? sorting quicksort haskell Why Haskell p:xs n-1 h-1 l-1 Why is the minimalist, example Haskell quicksort not a "true" quicksort? Haskell's website introduc...

[ 0.0118408203125, 0.0206298828125, 0.0341796875, -0.031494140625, -0.01214599609375, 0.000759124755859375, 0.0022430419921875, -0.0181884765625, 0.0022430419921875, 0.021240234375, 0.01251220703125, 0.00958251953125, -0.0257568359375, -0.0235595703125, -0.000331878662109375, 0.003128051...

[ 44084, 163504, 27781, 20625, 142508, 63773, 62351, 959, 9774, 13, 83, 12096, 214, 1556, 915, 12, 425, 653, 5759, 1096, 96, 4165, 65508, 4552, 225530, 8967, 2256, 32354, 35064, 26698, 882, 23, 313, 3126, 11389, 8951, 9191, 66747, 44891, 56...

[ 0.12060546875, 0.2354736328125, 0.154052734375, 0.1341552734375, 0.2705078125, 0.185546875, 0.279296875, 0.1116943359375, 0.158447265625, 0.03265380859375, 0.0255279541015625, 0.191650390625, 0.030609130859375, 0.0982666015625, 0.08154296875, 0.029937744140625, 0.080810546875, 0.03...

embed

57772488_c0

57772488

haskell

0

Title: How does function composition (.) work from within? Problem title: How does function composition (.) work from within? Tags: syntax, function-composition, lambda, haskell Problem: How does function composition (.) work from within? I am studying Haskell. Currently, I am studying function composition. I understan...

How does function composition (.) work from within? How does function composition (.) work from within? syntax function-composition lambda haskell within How How does function composition (.) work from within? I am studying Haskell. Currently, I am studying function composition. I understand (at least on a basic level)...

[ -0.00396728515625, 0.02587890625, 0.00194549560546875, 0.0079345703125, -0.015869140625, 0.00933837890625, -0.006988525390625, 0.0024261474609375, -0.007293701171875, -0.0213623046875, -0.00811767578125, 0.00144195556640625, -0.0172119140625, -0.0036773681640625, -0.00124359130859375, ...

[ 11249, 14602, 32354, 166577, 5, 4488, 1295, 28032, 6002, 86531, 277, 40322, 21, 6492, 85, 1556, 142508, 35187, 20625, 28219, 17366, 3642, 831, 11814, 6626, 959, 33342, 28960, 10644, 21635, 1363, 275, 33079, 501, 876, 85590, 26950, 1238, 517...

[ 0.0986328125, 0.0975341796875, 0.2462158203125, 0.274658203125, 0.136474609375, 0.16064453125, 0.1473388671875, 0.219482421875, 0.0919189453125, 0.134033203125, 0.156005859375, 0.14990234375, 0.061187744140625, 0.18603515625, 0.1578369140625, 0.1387939453125, 0.235595703125, 0.0065...

embed

38521481_c0

38521481

haskell

0

Title: Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? Problem title: Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? Tags: haskell, casting, dynamic Problem: Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full...

Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? haskell casting dynamic Haskell Dynamic TypeRep Show Haskell Dynamic/TypeRep: extract instance of a typeclass without knowing the full type? If ...

[ 0.011962890625, -0.004730224609375, 0.018310546875, 0.0303955078125, -0.00079345703125, 0.00738525390625, -0.00927734375, -0.006744384765625, -0.00146484375, -0.0164794921875, -0.033935546875, -0.044189453125, -0.016845703125, 0.00433349609375, -0.0086669921875, -0.00165557861328125, ...

[ 20625, 142508, 73327, 21068, 196707, 4332, 254, 125663, 110527, 10644, 67413, 15490, 141956, 4393, 1556, 176050, 84079, 60457, 17367, 70541, 7413, 95307, 51529, 11782, 32354, 3714, 60213, 69201, 29479, 3917, 110934, 11675, 8305, 139392, 5303, 756...

[ 0.093505859375, 0.2103271484375, 0.12451171875, 0.114013671875, 0.157470703125, 0.172119140625, 0.156005859375, 0.1761474609375, 0.173828125, 0.1939697265625, 0.2149658203125, 0.09674072265625, 0.124267578125, 0.093017578125, 0.09033203125, 0.1396484375, 0.1673583984375, 0.20324707...

embed

3969413_c0

3969413

haskell

0

Title: How to use fromInteger with no implicit prelude in Haskell? Problem title: How to use fromInteger with no implicit prelude in Haskell? Tags: haskell, ghc Problem: How to use fromInteger with no implicit prelude in Haskell? The following program yields an error in ghci: {-# LANGUAGE NoImplicitPrelude #-} import P...

How to use fromInteger with no implicit prelude in Haskell? How to use fromInteger with no implicit prelude in Haskell? haskell ghc Prelude qualified How Haskell LANGUAGE NoImplicitPrelude Integer Bool Discrete Monoid fromInteger.hs:17:16 Possible Prelude.undefined How to use fromInteger with no implicit prelude in Has...

[ -0.02490234375, -0.004302978515625, -0.002777099609375, 0.012939453125, -0.0057373046875, 0.0294189453125, 0.0294189453125, -0.0074462890625, -0.0037078857421875, -0.050048828125, -0.0115966796875, -0.005126953125, -0.0159912109375, 0.00193023681640625, 0.00592041015625, -0.02453613281...

[ 11249, 4527, 1295, 4153, 67, 1505, 110, 165164, 479, 822, 112, 20625, 142508, 678, 1556, 31380, 238, 1914, 217225, 98064, 438, 128878, 60923, 19273, 44401, 2460, 929, 53092, 38417, 77879, 532, 22354, 115861, 5983, 23, 1528, 18499, 318, 3002...

[ 0.0243682861328125, 0.1114501953125, 0.22705078125, 0.07257080078125, 0.164794921875, 0.1722412109375, 0.104248046875, 0.2158203125, 0.06878662109375, 0.1785888671875, 0.1146240234375, 0.121826171875, 0.22119140625, 0.01080322265625, 0.09063720703125, 0.071533203125, 0.0406494140625,...

embed

28563342_c1

28563342

haskell

1

) Examples with conversion and immediate freeing allocating in Haskell: fdRead (here allocaBytes must care for the freeing): -- ----------------------------------------------------------------------------- -- fd{Read,Write} -- | Read data from an 'Fd' and convert it to a 'String' using the locale encoding. -- Throws an...

[ 0.016845703125, 0.0003814697265625, 0.000507354736328125, -0.02294921875, 0.00543212890625, 0.024658203125, 0.009765625, -0.01361083984375, 0.0084228515625, 0.01239013671875, 0.02783203125, -0.0322265625, 0.00665283203125, 0.00933837890625, 0.0029296875, -0.0234375, 0.00262451171875,...

[ 1388, 89536, 99726, 678, 142477, 136, 168894, 4092, 214, 144, 116292, 23, 20625, 142508, 1238, 71, 31345, 35593, 24286, 408, 75358, 1636, 8110, 517, 4, 1456, 18781, 58745, 4764, 2053, 1295, 919, 96760, 47, 10, 71713, 17368, 29096, 22, 587...

[ 0.01361083984375, 0.1798095703125, 0.1229248046875, 0.050445556640625, 0.2122802734375, 0.0640869140625, 0.2078857421875, 0.19189453125, 0.1121826171875, 0.13671875, 0.2176513671875, 0.043792724609375, 0.18017578125, 0.300048828125, 0.125, 0.1737060546875, 0.29541015625, 0.00201416...

embed

20127170_c0

20127170

haskell

0

Title: Haskell do while loop Problem title: Haskell do while loop Tags: haskell, while-loop Problem: Haskell do while loop im new to Haskell and dont understand how haskell handles recursion. Ive been working on this for months and just cant figure it out. My project is due in a few days, so im asking for any help or a...

Haskell do while loop Haskell do while loop haskell while-loop Haskell Haskell do while loop im new to Haskell and dont understand how haskell handles recursion. Ive been working on this for months and just cant figure it out. My project is due in a few days, so im asking for any help or advice! My project description ...

[ -0.01202392578125, 0.00188446044921875, 0.01336669921875, 0.00250244140625, 0.011962890625, 0.0240478515625, 0.003448486328125, -0.0118408203125, 0.01141357421875, -0.0302734375, 0.000698089599609375, -0.0157470703125, -0.02685546875, 0.013427734375, 0.01611328125, 0.01287841796875, ...

[ 20625, 142508, 54, 12960, 40956, 1556, 28354, 566, 3525, 13319, 28219, 3642, 34831, 7, 195625, 1830, 20697, 21775, 45767, 26366, 1810, 13452, 4743, 10846, 13312, 113292, 4358, 67660, 76811, 765, 361, 135421, 8080, 678, 17262, 1234, 379, 939, ...

[ 0.125, 0.204833984375, 0.0986328125, 0.2386474609375, 0.2244873046875, 0.1580810546875, 0.2066650390625, 0.07373046875, 0.022003173828125, 0.06561279296875, 0.0914306640625, 0.0219879150390625, 0.12353515625, 0.024749755859375, 0.2156982421875, 0.125732421875, 0.0538330078125, 0.05...

embed

2363264_c1

2363264

haskell

1

a' = Ambulance "ABC" s [c] *AmbSys> let s'' = Station "London" [a'] *AmbSys> let system_state = SystemState [s''] [a'] [c] *AmbSys> system_state SystemState [Station {stName = "London", stAmbulances = [Ambulance {amCallSign = "ABC", amStation = Station {stName = "London", stAmbulances = []}, amCrew = [Crew {crName = "...

[ 0.00439453125, 0.01031494140625, -0.00653076171875, 0.0257568359375, 0.023193359375, 0.00750732421875, -0.00787353515625, -0.00494384765625, 0.01318359375, -0.006439208984375, 0.0023651123046875, 0.017333984375, 0.0107421875, -0.0064697265625, -0.008544921875, -0.01544189453125, 0.00...

[ 10, 25, 2203, 10250, 202, 7154, 186944, 91, 238, 661, 150567, 65183, 2633, 4765, 38488, 231454, 2740, 5426, 61340, 12353, 135206, 7, 11, 22062, 271, 6138, 302, 5584, 218723, 444, 63784, 23150, 98385, 37700, 8374, 20320, 17726, 939, 22225, ...

[ 0.1090087890625, 0.120361328125, 0.1007080078125, 0.17138671875, 0.2149658203125, 0.172607421875, 0.1656494140625, 0.1341552734375, 0.042724609375, 0.0042724609375, 0.1837158203125, 0.1400146484375, 0.08074951171875, 0.1431884765625, 0.1932373046875, 0.1883544921875, 0.00375366210937...

embed

23821105_c0

23821105

haskell

0

Title: what's the meaning of "you do computations in Haskell by declaring what something is instead of declaring how you get it"? Problem title: what's the meaning of "you do computations in Haskell by declaring what something is instead of declaring how you get it"? Tags: haskell Problem:...

what's the meaning of "you do computations in Haskell by declaring what something is instead of declaring how you get it"? what's the meaning of "you do computations in Haskell by declaring what something is instead of declaring how you get it"? haskell Haskell Num x:xs what's the meaning ...

[ 0.002655029296875, 0.025390625, 0.00872802734375, 0.00830078125, -0.0023956298828125, 0.01513671875, 0.0078125, -0.00164794921875, 0.031494140625, -0.02880859375, 0.007232666015625, -0.0289306640625, 0.001556396484375, 0.00104522705078125, -0.0096435546875, 0.0142822265625, 0.0172119...

[ 2367, 3768, 91084, 53927, 54, 181135, 5256, 23, 20625, 142508, 390, 8, 18347, 2852, 9844, 83, 64457, 111, 3642, 2046, 442, 1556, 52782, 1022, 12, 425, 123309, 56037, 46876, 55076, 16454, 30698, 398, 76811, 119598, 9077, 28219, 66161, 3444, ...

[ 0.1385498046875, 0.0960693359375, 0.196044921875, 0.07794189453125, 0.1053466796875, 0.2115478515625, 0.122314453125, 0.05975341796875, 0.159912109375, 0.2578125, 0.0557861328125, 0.1019287109375, 0.1583251953125, 0.06890869140625, 0.1416015625, 0.1156005859375, 0.14453125, 0.00695...

embed

39399162_c0

39399162

haskell

0

Title: Building a simple DSL in Haskell with C++ interop Problem title: Building a simple DSL in Haskell with C++ interop Tags: soft-real-time, dsl, c%2B%2B, haskell, testing Problem: Building a simple DSL in Haskell with C++ interop I'm designing a simple interpreted language for testing real-time embedded systems. Th...

Building a simple DSL in Haskell with C++ interop Building a simple DSL in Haskell with C++ interop soft-real-time dsl c%2B%2B haskell testing Building DSL Haskell Building a simple DSL in Haskell with C++ interop I'm designing a simple interpreted language for testing real-time embedded systems. The control flow is se...

[ 0.0186767578125, 0.007293701171875, -0.000881195068359375, 0.01043701171875, 0.00677490234375, -0.00191497802734375, -0.00799560546875, 0.00830078125, -0.0130615234375, -0.03466796875, -0.004150390625, -0.03369140625, -0.017578125, 0.01531982421875, 0.00147247314453125, 0.0230712890625...

[ 104919, 8781, 114479, 23, 20625, 142508, 678, 313, 37223, 1940, 2146, 32977, 30544, 6032, 104, 24861, 1556, 134234, 4331, 29481, 46876, 2773, 55720, 69819, 76519, 6226, 86608, 141591, 173072, 22691, 37515, 201939, 142027, 26499, 1221, 997, 4989...

[ 0.148681640625, 0.18310546875, 0.221435546875, 0.046295166015625, 0.160888671875, 0.25390625, 0.03997802734375, 0.016021728515625, 0.255126953125, 0.138427734375, 0.2098388671875, 0.186279296875, 0.1217041015625, 0.10174560546875, 0.01416015625, 0.1600341796875, 0.116943359375, 0.2...

embed

40879983_c0

40879983

haskell

0

Title: What sort of iterations does GHC do while compiling patterns? Problem title: What sort of iterations does GHC do while compiling patterns? Tags: haskell, ghc, pattern-matching Problem: What sort of iterations does GHC do while compiling patterns? I just wrote a function for making a move in Tic-Tac-Toe. I wanted...

What sort of iterations does GHC do while compiling patterns? What sort of iterations does GHC do while compiling patterns? haskell ghc pattern-matching What GHC m12 m13 m21 m22 m23 m31 m32 m33 Mark Show Pattern mov1 Use What sort of iterations does GHC do while compiling patterns? I just wrote a function for making a ...

[ 0.00445556640625, -0.003082275390625, 0.018798828125, 0.004608154296875, 0.007781982421875, 0.0010986328125, -0.02490234375, -0.00390625, 0.010498046875, -0.0069580078125, -0.005126953125, -0.0220947265625, 0.017333984375, -0.011962890625, 0.006011962890625, 0.00640869140625, 0.00393...

[ 12096, 17, 720, 21094, 527, 73265, 54, 12960, 9969, 49725, 103510, 1556, 142508, 31380, 238, 98753, 214, 4865, 1530, 2681, 3117, 3742, 5016, 6460, 9185, 7880, 17367, 9876, 22766, 30464, 418, 36836, 54397, 32354, 25813, 133552, 618, 2263, 77...

[ 0.1026611328125, 0.0697021484375, 0.2279052734375, 0.1380615234375, 0.0989990234375, 0.2218017578125, 0.041656494140625, 0.05816650390625, 0.11181640625, 0.09033203125, 0.217529296875, 0.10125732421875, 0.20703125, 0.1226806640625, 0.106689453125, 0.17236328125, 0.025299072265625, ...

embed

74536026_c0

74536026

haskell

0

Title: Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" Problem title: Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" Tags: haskell Problem: Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" I am trying to work through Write Yourself a Scheme in 48 Hours...

Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" Problem with Chapter 2 of "Write Yourself a Scheme in 48 Hours" haskell System.Environment Text.ParserCombinators.Parsec Problem Chapter Write Yourself Scheme Hours Main Parser Char Left Right Found simpleparser1.hs Compiling simplepars...

[ -0.00579833984375, 0.0079345703125, -0.0189208984375, 0.034912109375, -0.01361083984375, 0.0205078125, 0.00107574462890625, -0.01409912109375, -0.007293701171875, -0.0125732421875, 0.01123046875, -0.0294189453125, 0.004302978515625, -0.010986328125, 0.000904083251953125, 0.0048828125, ...

[ 15649, 678, 117615, 116, 1456, 18781, 14804, 39379, 10, 34702, 282, 23, 4572, 133250, 1556, 142508, 12353, 1900, 24129, 28636, 2189, 19155, 39797, 601, 12321, 2392, 21656, 2480, 90911, 215624, 8781, 2500, 127, 15612, 31, 12221, 184, 4488, 2...

[ 0.1368408203125, 0.048828125, 0.137939453125, 0.1885986328125, 0.026824951171875, 0.1429443359375, 0.077392578125, 0.12939453125, 0.058624267578125, 0.189453125, 0.1640625, 0.0550537109375, 0.217529296875, 0.2108154296875, 0.0955810546875, 0.213623046875, 0.0888671875, 0.0239562988...

embed

77937737_c1

77937737

haskell

1

\"}" :: Maybe Value) where foo = decode . E.encodeUtf8 . T.pack fails to compile, with error • Couldn't match type ‘bytestring-0.11.5.3:Data.ByteString.Internal.Type.ByteString’ with ‘Data.ByteString.Lazy.Internal.ByteString’ Expected: Data.Text.Internal.Text -> Data.ByteString.Lazy.Internal.ByteString Actual: Data.Tex...

[ 0.00970458984375, -0.0184326171875, 0.005523681640625, 0.01214599609375, -0.0142822265625, -0.007354736328125, 0.003692626953125, 0.0062255859375, -0.01080322265625, 0.029296875, -0.0029144287109375, 0.016357421875, 0.0137939453125, 0.0021209716796875, -0.00162506103515625, -0.01458740...

[ 6, 41872, 58, 8152, 1984, 83425, 190060, 16, 7440, 5775, 31, 8, 40899, 241, 33, 106742, 420, 1019, 384, 29102, 35782, 7, 47, 9969, 1340, 678, 18499, 768, 191147, 18, 14858, 10644, 61028, 91693, 102014, 42876, 363, 137989, 75358, 71713, ...

[ 0.0048828125, 0.1533203125, 0.128173828125, 0.1553955078125, 0.1435546875, 0.31005859375, 0.29296875, 0.005584716796875, 0.03472900390625, 0.147705078125, 0.144287109375, 0.1712646484375, 0.253662109375, 0.10516357421875, 0.048492431640625, 0.029266357421875, 0.079345703125, 0.1677...

embed

20806157_c1

20806157

haskell

1

) "1 2" I have checked the code of gshow that does something similar to what I need, but I can't figure out how it works. If I try to import its code into GHCI I get an error: > let gshows = (\t -> showChar '(' . (showString . showConstr . toConstr $ t) . (foldr (.) id . gmapQ ((showChar ' ' .) . gshows) $ t) . showCha...

[ -0.000202178955078125, 0.00160980224609375, 0.00168609619140625, 0.0169677734375, 0.006927490234375, 0.023193359375, 0.003326416015625, -0.0224609375, 0.01483154296875, -0.0072021484375, -0.01324462890625, -0.0184326171875, 0.00167083740234375, 0.01025390625, -0.01019287109375, 0.01318...

[ 1388, 418, 116, 12765, 18151, 706, 31374, 14602, 21373, 3871, 831, 18, 26366, 3642, 442, 43240, 24927, 3934, 41877, 17304, 18499, 2633, 7639, 84068, 71713, 9297, 47, 3650, 808, 42822, 3447, 62346, 2737, 3355, 23351, 17367, 294, 10433, 71232...

[ 0.006591796875, 0.02764892578125, 0.1407470703125, 0.078369140625, 0.1806640625, 0.100830078125, 0.277587890625, 0.02740478515625, 0.0946044921875, 0.120361328125, 0.031494140625, 0.04644775390625, 0.06903076171875, 0.0543212890625, 0.03436279296875, 0.1348876953125, 0.1917724609375,...

embed

74313610_c1

74313610

haskell

1

:: Patient janeESmith = Patient (NameWithMiddle "Jane" "Elizabeth" "Smith") Female 28 62 140 (BloodType AB Pos) getName :: Patient -> Name getName (Patient n _ _ _ _ _) = n getAge :: Patient -> Int getAge (Patient _ _ a _ _ _) = a getBloodType :: Patient -> BloodType getBloodType (Patient _ _ _ _ _ bt) = bt main = do ...

[ 0.004913330078125, 0.0167236328125, 0.01904296875, 0.0203857421875, -0.0157470703125, 0.020263671875, -0.0172119140625, -0.006103515625, -0.01202392578125, -0.008056640625, 0.0030517578125, 0.005157470703125, 0.021484375, -0.01226806640625, -0.010498046875, -0.0380859375, 0.009643554...

[ 1984, 135004, 47363, 6706, 266, 927, 2203, 163612, 194583, 594, 532, 19298, 6979, 86, 647, 39998, 86077, 213342, 1372, 10031, 12664, 571, 91841, 196707, 11321, 13498, 2046, 33079, 15757, 8335, 118, 2517, 653, 284, 429, 105591, 18, 876, 5201...

[ 0.08331298828125, 0.2646484375, 0.2071533203125, 0.0643310546875, 0.1895751953125, 0.1732177734375, 0.0277557373046875, 0.208251953125, 0.1285400390625, 0.005828857421875, 0.08636474609375, 0.1026611328125, 0.1534423828125, 0.1468505859375, 0.00628662109375, 0.06805419921875, 0.14807...

embed

69479166_c1

69479166

haskell

1

k | k <- [1 .. x], x `mod` k == 0]) == y]' In the expression: [(sum [k | k <- [1 .. x], x `mod` k == 0]) == y] && [(sum [i | i <- [1 .. y], y `mod` i == 0]) == x] In an equation for `areAmicableNumbers': areAmicableNumbers x y = [(sum [k | k <- [1 .. x], x `mod` k == 0]) == y] && [(sum [i | i <- [1 .. y], y `mod` i == ...

[ -0.0286865234375, -0.006072998046875, 0.003082275390625, 0.00811767578125, 0.01495361328125, 0.018310546875, -0.01025390625, 0.01080322265625, 0.0137939453125, 0.0390625, 0.012939453125, -0.00153350830078125, 0.0022735595703125, 0.002288818359375, -0.001922607421875, 0.00628662109375, ...

[ 472, 58745, 4426, 9, 68252, 1468, 1022, 13415, 69112, 757, 113, 25, 360, 125195, 11832, 92, 619, 1230, 17, 28, 5490, 1046, 284, 16409, 2661, 18444, 26278, 7, 621, 2203, 1105, 145407, 53, 16377, 2005, 18244, 418, 127, 24864, 6873, 18499,...

[ 0.230712890625, 0.1072998046875, 0.172607421875, 0.2113037109375, 0.1268310546875, 0.076416015625, 0.1304931640625, 0.2227783203125, 0.17626953125, 0.1812744140625, 0.1866455078125, 0.0240478515625, 0.06512451171875, 0.270751953125, 0.28271484375, 0.219482421875, 0.1080322265625, 0...

embed

11657735_c0

11657735

haskell

0

Title: Discrepency in the monad bind and unit function? Problem title: Discrepency in the monad bind and unit function? Tags: haskell, monads Problem: Discrepency in the monad bind and unit function? Problem I am just going through the You Could Have Invented Monads! tutorial, and in the section entitled A Container: M...

Discrepency in the monad bind and unit function? Discrepency in the monad bind and unit function? haskell monads Discrepency Complex Float Double Discrepency in the monad bind and unit function? Problem I am just going through the You Could Have Invented Monads! tutorial, and in the section entitled A Container: Multiv...

[ -0.01153564453125, 0.035400390625, -0.0038909912109375, 0.0147705078125, 0.006500244140625, 0.00007915496826171875, 0.005126953125, -0.00579833984375, -0.00099945068359375, -0.00274658203125, 0.00173187255859375, -0.017578125, 0.01123046875, -0.0047607421875, -0.00421142578125, -0.0166...

[ 53092, 107, 2278, 2408, 23, 2667, 712, 68557, 136, 25072, 32354, 1556, 142508, 113197, 38699, 257, 107172, 15649, 191147, 31901, 16274, 60331, 6468, 57143, 34749, 20037, 19335, 27494, 28670, 10763, 52895, 27140, 108047, 314, 372, 74855, 16666, ...

[ 0.111328125, 0.153076171875, 0.169921875, 0.07623291015625, 0.05438232421875, 0.142333984375, 0.1968994140625, 0.267822265625, 0.1104736328125, 0.220703125, 0.18896484375, 0.0933837890625, 0.224853515625, 0.139404296875, 0.1483154296875, 0.0389404296875, 0.159423828125, 0.066284179...

embed

15082615_c1

15082615

haskell

1

.status let a = unwords (foldr1 (++) (parseMPD x)) rawSystem "notify-send" ["MPD Volume", a] compiles correctly, using the same code in XMonad config int2str :: (Show a, Num a, Ord a) => a -> String int2str x = if x < 10 then '0':sx else sx where sx = show x parseMPD :: MPD.Response MPD.Status -> [[String]] parseMPD (L...

[ -0.0361328125, 0.0157470703125, -0.031982421875, 0.0478515625, -0.01141357421875, 0.040771484375, 0.004058837890625, -0.002777099609375, -0.0079345703125, 0.00360107421875, -0.006805419921875, 0.00457763671875, 0.013427734375, 0.0108642578125, -0.024169921875, 0.01226806640625, -0.02...

[ 5, 45215, 2633, 10, 2203, 51, 47416, 42822, 42, 37223, 2500, 184, 9088, 397, 1022, 49649, 84293, 10869, 40383, 39285, 98872, 9969, 1340, 26785, 17368, 5701, 18151, 1193, 46674, 712, 153837, 23, 18, 304, 9297, 168660, 52782, 35379, 23351, ...

[ 0.1016845703125, 0.25927734375, 0.119873046875, 0.1146240234375, 0.0538330078125, 0.0887451171875, 0.19189453125, 0.0736083984375, 0.0262298583984375, 0.1136474609375, 0.08984375, 0.0316162109375, 0.1221923828125, 0.1578369140625, 0.09552001953125, 0.232421875, 0.156005859375, 0.15...

embed

23766188_c0

23766188

haskell

0

Title: Finding a linear path in a traversable structure Problem title: Finding a linear path in a traversable structure Tags: traversal, haskell, tree Problem: Finding a linear path in a traversable structure Given a list of steps: >>> let path = ["item1", "item2", "item3", "item4", "item5"] And a labeled Tree : >>> im...

Finding a linear path in a traversable structure Finding a linear path in a traversable structure traversal haskell tree Data.Tree Finding item1 item2 item3 item4 item5 Tree Node Foldable Finding a linear path in a traversable structure Given a list of steps: And a labeled Tree : I'd like a function that goes through t...

[ 0.01043701171875, 0.0033416748046875, -0.0036163330078125, 0.00007581710815429688, 0.01104736328125, -0.004669189453125, -0.0169677734375, -0.01129150390625, 0.010498046875, -0.06298828125, -0.004638671875, 0.000583648681640625, -0.01470947265625, 0.0272216796875, 0.005279541015625, 0....

[ 26040, 192617, 60875, 23, 37317, 2886, 45646, 289, 1556, 142508, 53201, 11809, 62731, 35735, 363, 617, 758, 101344, 438, 30077, 71, 5303, 98441, 67967, 297, 1884, 32354, 8305, 14858, 214, 24189, 831, 53333, 1286, 123867, 2288, 3934, 217, 19...

[ 0.1318359375, 0.20947265625, 0.234375, 0.0391845703125, 0.1693115234375, 0.14404296875, 0.17529296875, 0.07568359375, 0.09765625, 0.19970703125, 0.1800537109375, 0.0556640625, 0.1456298828125, 0.134765625, 0.022857666015625, 0.0780029296875, 0.07861328125, 0.24365234375, 0.043792...

embed

49215242_c0

49215242

haskell

0

Title: How to make GHC generate dynamically linked binaries by default? Problem title: How to make GHC generate dynamically linked binaries by default? Tags: haskell, cabal Problem: How to make GHC generate dynamically linked binaries by default? Is it possible to change cabal or GHC settings so that cabal install gene...

How to make GHC generate dynamically linked binaries by default? How to make GHC generate dynamically linked binaries by default? haskell cabal How GHC some_package How to make GHC generate dynamically linked binaries by default? Is it possible to change cabal or GHC settings so that cabal install generates dynamic bin...

[ 0.01336669921875, 0.01123046875, 0.0235595703125, 0.0007476806640625, 0.00689697265625, -0.00677490234375, -0.021484375, 0.0093994140625, 0.004486083984375, -0.0137939453125, -0.02392578125, -0.0400390625, -0.0166015625, -0.000675201416015625, -0.00885009765625, 0.024658203125, 0.018...

[ 11249, 3249, 527, 73265, 139392, 84079, 3126, 297, 23035, 10484, 390, 114977, 1556, 142508, 109524, 29102, 7722, 15549, 53550, 20600, 136, 35773, 17368, 3217, 70147, 1747, 3794, 116890, 23175, 112072, 15490, 20625, 70968, 177261, 44084, 831, 18...

[ 0.0821533203125, 0.1019287109375, 0.131103515625, 0.254150390625, 0.221923828125, 0.23388671875, 0.1929931640625, 0.0216217041015625, 0.218017578125, 0.1356201171875, 0.056671142578125, 0.2442626953125, 0.104736328125, 0.2017822265625, 0.262939453125, 0.1192626953125, 0.098876953125,...

embed

8780183_c0

8780183

haskell

0

Title: Handling events in Haskell Problem title: Handling events in Haskell Tags: ghc, haskell, event-handling, typeclass Problem: Handling events in Haskell I would like to implement the following scenario in Haskell. I have an enumerable set of 'events' defined like this: data MyEvent = Event1 | Event2 | Event3 I wan...

Handling events in Haskell Handling events in Haskell ghc haskell event-handling typeclass Handling Haskell MyEvent Event1 Event2 Event3 Handler Event Handling events in Haskell I would like to implement the following scenario in Haskell. I have an enumerable set of 'events' defined like this: I want to define handlers...

[ 0.0048828125, 0.0126953125, 0.0033721923828125, 0.014892578125, -0.0005645751953125, -0.006378173828125, 0.00323486328125, -0.01171875, 0.0032501220703125, -0.05810546875, -0.00775146484375, -0.004547119140625, -0.0166015625, 0.0140380859375, -0.0028076171875, -0.005889892578125, 0.0...

[ 193237, 47353, 23, 20625, 142508, 31380, 238, 1556, 19732, 54885, 10644, 67413, 2646, 192134, 36943, 418, 304, 363, 10639, 603, 2806, 1884, 29479, 25632, 106117, 765, 189085, 2661, 5423, 90141, 61924, 903, 3444, 35863, 7, 100, 6097, 11814, ...

[ 0.241943359375, 0.255126953125, 0.08343505859375, 0.1561279296875, 0.223876953125, 0.07720947265625, 0.06243896484375, 0.1219482421875, 0.1497802734375, 0.2186279296875, 0.2222900390625, 0.1922607421875, 0.099853515625, 0.218505859375, 0.21728515625, 0.025482177734375, 0.027374267578...

embed

31723658_c0

31723658

haskell

0

Title: What do I need to do if I want to install a new version of GHC? Problem title: What do I need to do if I want to install a new version of GHC? Tags: haskell, ghc Problem: What do I need to do if I want to install a new version of GHC? Currently, I am using GHC 7.10.1 on my ubuntu 14.04 system, just now I got not...

What do I need to do if I want to install a new version of GHC? What do I need to do if I want to install a new version of GHC? haskell ghc What GHC x86_64-linux-ghc-7.10.1 x86_64-linux-7.10.1 What do I need to do if I want to install a new version of GHC? Currently, I am using GHC 7.10.1 on my ubuntu 14.04 system, jus...

[ -0.0019378662109375, -0.00151824951171875, 0.029052734375, 0.0186767578125, -0.0062255859375, 0.005584716796875, -0.0224609375, 0.007354736328125, -0.013427734375, 0.0206298828125, 0.006866455078125, -0.034912109375, -0.017333984375, -0.00860595703125, 0.00787353515625, 0.0050659179687...

[ 4865, 3871, 54, 2174, 3444, 47, 20600, 10, 3525, 11389, 111, 527, 73265, 1556, 142508, 31380, 238, 1022, 15276, 13307, 2397, 6077, 9486, 16709, 10179, 418, 17368, 115384, 102014, 198996, 6370, 7709, 5426, 156672, 5303, 70541, 5915, 54608, 7...

[ 0.063720703125, 0.1080322265625, 0.0733642578125, 0.05657958984375, 0.079345703125, 0.060882568359375, 0.2091064453125, 0.03228759765625, 0.173828125, 0.18310546875, 0.119873046875, 0.1644287109375, 0.2783203125, 0.1624755859375, 0.279052734375, 0.175537109375, 0.1446533203125, 0.0...

embed

60331244_c0

60331244

haskell

0

Title: Using hsc2hs with HPack and Stack Problem title: Using hsc2hs with HPack and Stack Tags: preprocessor, hpack, hsc2hs, haskell-stack, haskell Problem: Using hsc2hs with HPack and Stack I'd like to use hsc2hs via Stack and HPack. The problem is, since HPack doesn't allow me to list the .hsc file as a source file, ...

Using hsc2hs with HPack and Stack Using hsc2hs with HPack and Stack preprocessor hpack hsc2hs haskell-stack haskell Using hsc2hs HPack Stack package.yaml sim-ffi.hs Bounce.h Bounce.c sim-ffi.hsc Cabal-simple_mPHDZzAJ_2.4.0.1_ghc-8.6.5 Using hsc2hs with HPack and Stack I'd like to use hsc2hs via Stack and HPack. The pro...

[ -0.0035400390625, 0.02294921875, -0.01202392578125, 0.0167236328125, -0.006591796875, 0.0034637451171875, -0.004669189453125, 0.01007080078125, -0.0157470703125, -0.02099609375, 0.025634765625, -0.015869140625, -0.0004138946533203125, -0.003265380859375, 0.0032806396484375, 0.036132812...

[ 345, 1096, 10382, 304, 127, 7, 678, 572, 205956, 6512, 2594, 479, 63923, 29102, 1556, 142508, 590, 98169, 14520, 141, 10777, 24500, 85018, 30438, 289, 191560, 54259, 25582, 116591, 102014, 17376, 136473, 136, 1884, 4527, 1829, 2967, 63769, ...

[ 0.07464599609375, 0.1170654296875, 0.1451416015625, 0.11669921875, 0.169921875, 0.084228515625, 0.06390380859375, 0.12451171875, 0.236083984375, 0.1005859375, 0.0889892578125, 0.05126953125, 0.034027099609375, 0.1829833984375, 0.095703125, 0.145751953125, 0.05938720703125, 0.146240...

embed

64417268_c1

64417268

haskell

1

0,1)) tree) newStdGen where mapRandom f (Leaf a) = Leaf <$> state f mapRandom f (Unary t1) = Unary <$> mapRandom f t1 mapRandom f (Binary t1 t2) = Binary <$> mapRandom f t1 <*> mapRandom f t2 mapRandom f (Ternary t1 t2 t3) = Ternary <$> mapRandom f t1 <*> mapRandom f t2 <*> mapRandom f t3 however the compiler gave me t...

[ -0.01025390625, 0.0123291015625, -0.0108642578125, -0.01904296875, -0.01220703125, 0.0189208984375, -0.0023651123046875, -0.0230712890625, -0.0225830078125, -0.052001953125, -0.01312255859375, 0.0086669921875, 0.0020599365234375, 0.02099609375, 0.018798828125, -0.01446533203125, -0.0...

[ 72966, 53201, 3525, 37455, 71, 105376, 22288, 126525, 3815, 1238, 5267, 2407, 10, 636, 11341, 14256, 6635, 808, 17727, 4228, 1294, 54092, 35484, 2994, 76, 363, 9969, 34759, 127, 28565, 31982, 18499, 438, 110527, 17780, 2907, 187, 72219, 452...

[ 0.1650390625, 0.2147216796875, 0.142822265625, 0.1356201171875, 0.0966796875, 0.199951171875, 0.1474609375, 0.1468505859375, 0.1571044921875, 0.087646484375, 0.0212860107421875, 0.1339111328125, 0.093017578125, 0.033538818359375, 0.1063232421875, 0.0509033203125, 0.0400390625, 0.00...

embed

37649093_c0

37649093

haskell

0

Title: stack.yaml not created by stack new on Win7 Problem title: stack.yaml not created by stack new on Win7 Tags: haskell Problem: stack.yaml not created by stack new on Win7 I ran "stack new bahugs franklinchen" on a command prompt window under Win7; stack version is 1.1.2. It did not create a stack.yaml file, and g...

stack.yaml not created by stack new on Win7 stack.yaml not created by stack new on Win7 haskell stack.yaml Win7 msys64 Exec Downloaded lts-6.1 Populated Updating Hackage github.com Counting Resolving Fetched stack.yaml not created by stack new on Win7 I ran "stack new bahugs franklinchen" on a command prompt window und...

[ 0.0019989013671875, 0.0252685546875, 0.007781982421875, 0.01416015625, -0.02197265625, 0.01141357421875, -0.0081787109375, -0.0216064453125, -0.0281982421875, 0.034912109375, -0.0027618408203125, -0.0179443359375, 0.003631591796875, -0.020263671875, -0.00390625, 0.0166015625, 0.00402...

[ 177261, 5, 14520, 141, 959, 75935, 3525, 17686, 966, 98, 1556, 142508, 94924, 13307, 3240, 4857, 933, 173245, 157890, 10091, 56464, 52922, 62270, 32102, 1311, 128396, 132944, 92962, 13028, 590, 2594, 164092, 9405, 88490, 2397, 4834, 75101, 10...

[ 0.260986328125, 0.039520263671875, 0.2103271484375, 0.2384033203125, 0.1116943359375, 0.14404296875, 0.18603515625, 0.1015625, 0.1705322265625, 0.03314208984375, 0.09552001953125, 0.2490234375, 0.095458984375, 0.120849609375, 0.00604248046875, 0.038330078125, 0.043792724609375, 0.1...

embed

40407322_c0

40407322

haskell

0

Title: Haskell - Tuples and Lists as built-in types: how are they actually declared? Problem title: Haskell - Tuples and Lists as built-in types: how are they actually declared? Tags: haskell, typing, tuples, list Problem: Haskell - Tuples and Lists as built-in types: how are they actually declared? In chapter 2 of "A ...

Haskell - Tuples and Lists as built-in types: how are they actually declared? Haskell - Tuples and Lists as built-in types: how are they actually declared? haskell typing tuples list Haskell Tuples Lists Haskell - Tuples and Lists as built-in types: how are they actually declared? In chapter 2 of "A gentle introduction...

[ 0.0103759765625, 0.01275634765625, 0.00616455078125, 0.00445556640625, -0.0087890625, 0.01312255859375, -0.02099609375, -0.0155029296875, 0.014404296875, 0.000476837158203125, 0.01104736328125, -0.036865234375, -0.012939453125, 0.01153564453125, 0.0140380859375, 0.01092529296875, 0.0...

[ 20625, 142508, 1371, 99726, 136, 32036, 237, 88303, 73, 52895, 3642, 20653, 159978, 71, 1556, 11417, 370, 5303, 116, 21507, 39864, 38937, 112, 5983, 189050, 5361, 6002, 86531, 110, 12921, 61924, 8705, 1884, 25632, 53418, 2806, 64209, 54241, ...

[ 0.114990234375, 0.212158203125, 0.1134033203125, 0.2340087890625, 0.09234619140625, 0.1790771484375, 0.0183258056640625, 0.1446533203125, 0.10455322265625, 0.2286376953125, 0.09332275390625, 0.1148681640625, 0.1839599609375, 0.0755615234375, 0.08905029296875, 0.124267578125, 0.121948...

embed

21984769_c0

21984769

haskell

0

Title: Can you formulate the insertion sort as a monoid in Clojure? Problem title: Can you formulate the insertion sort as a monoid in Clojure? Tags: clojure, haskell, insertion-sort, monoids, sorting Problem: Can you formulate the insertion sort as a monoid in Clojure? This is the code for an insertion sort in Clojure...

Can you formulate the insertion sort as a monoid in Clojure? Can you formulate the insertion sort as a monoid in Clojure? clojure haskell insertion-sort monoids sorting Can Clojure Usage Returns Ord Monoid Can you formulate the insertion sort as a monoid in Clojure? This is the code for an insertion sort in Clojure: Th...

[ -0.033935546875, 0.00469970703125, 0.0123291015625, 0.00640869140625, 0.007781982421875, 0.01214599609375, -0.00054931640625, -0.0308837890625, 0.0101318359375, -0.0322265625, -0.0093994140625, 0.01080322265625, -0.0238037109375, -0.0277099609375, -0.005157470703125, -0.003097534179687...

[ 4171, 26168, 67, 241860, 12096, 237, 22460, 532, 51053, 461, 107, 20450, 1556, 142508, 62351, 30185, 70166, 173340, 35379, 77879, 70, 10, 23, 18151, 20625, 33022 ]

[ 0.0819091796875, 0.1949462890625, 0.024993896484375, 0.221923828125, 0.2496337890625, 0.06402587890625, 0.1796875, 0.18310546875, 0.1346435546875, 0.1746826171875, 0.16796875, 0.07958984375, 0.0198822021484375, 0.2109375, 0.197021484375, 0.1146240234375, 0.0772705078125, 0.12048339...

embed

74645202_c0

74645202

haskell

0

Title: Type pattern-matching instead of constructor pattern-matching? Problem title: Type pattern-matching instead of constructor pattern-matching? Tags: haskell Problem: Type pattern-matching instead of constructor pattern-matching? For my uni homework we have to make a PvZ like simple game in Haskell. I have a Plant ...

Type pattern-matching instead of constructor pattern-matching? Type pattern-matching instead of constructor pattern-matching? haskell Type Plant Peashooter Sunflower Walnut CherryBomb Show Ord Bool Type pattern-matching instead of constructor pattern-matching? For my uni homework we have to make a PvZ like simple game ...

[ -0.03662109375, 0.0211181640625, 0.00072479248046875, 0.006866455078125, 0.0185546875, -0.00176239013671875, -0.03125, 0.012939453125, -0.004974365234375, -0.01336669921875, 0.01025390625, 0.0164794921875, 0.00701904296875, -0.013427734375, -0.0186767578125, -0.00433349609375, 0.0074...

[ 60457, 103510, 9, 98753, 214, 64457, 64549, 748, 1556, 142508, 75628, 92931, 105727, 56, 7550, 132641, 25365, 3609, 187243, 12647, 6492, 17367, 35379, 2460, 929, 1326, 759, 19844, 5368, 18244, 436, 334, 1511, 1884, 8781, 6712, 23, 20625, 10...

[ 0.25146484375, 0.2333984375, 0.0450439453125, 0.2509765625, 0.12060546875, 0.123046875, 0.13525390625, 0.08966064453125, 0.131103515625, 0.2445068359375, 0.1964111328125, 0.09197998046875, 0.1728515625, 0.0870361328125, 0.017913818359375, 0.18408203125, 0.0163726806640625, 0.103698...

embed

45301387_c0

45301387

haskell

0

Title: confused about composite function in haskell Problem title: confused about composite function in haskell Tags: haskell Problem: confused about composite function in haskell let f = show.sum.map read.words f "1 2" It work. show.sum.map read.words "1 2" I get errors: <interactive>:19:19: Couldn't match expected ty...

confused about composite function in haskell confused about composite function in haskell haskell it show.sum.map read.words Couldn Relevant Possible Prelude Num Show Foldable confused about composite function in haskell It work. I get errors: I want to know why? (show.sum.map read.words) "1 2" can also work.

[ -0.01611328125, -0.0277099609375, 0.00494384765625, 0.0439453125, -0.0003261566162109375, 0.02685546875, 0.0038299560546875, -0.00372314453125, 0.004302978515625, -0.004913330078125, -0.0306396484375, -0.00933837890625, 0.01165771484375, 0.01031494140625, -0.0157470703125, -0.023193359...

[ 55681, 5281, 1672, 375, 77087, 32354, 1556, 142508, 13, 23, 7639, 11832, 62346, 12301, 47416, 191147, 19, 133, 30624, 115861, 2661, 1914, 822, 112, 52782, 17367, 30077, 71, 2886, 1650, 4488, 18499, 3444, 3714, 15400, 31374, 418, 116, 831 ]

[ 0.142333984375, 0.1011962890625, 0.03302001953125, 0.0933837890625, 0.2425537109375, 0.15869140625, 0.1468505859375, 0.2410888671875, 0.052001953125, 0.03155517578125, 0.1357421875, 0.193603515625, 0.1741943359375, 0.1741943359375, 0.1553955078125, 0.099609375, 0.013763427734375, 0...

embed

79313304_c1

79313304

haskell

1

Int) } deriving Eq instance FakeIO (State MockTerminal) where setCursorPosition y x = modify' $ \m -> MockTerminal { pos = (y, x) } main :: IO () main = do result <- quickCheckResult tCenter unless (isSuccess result) exitFailure 2 directories, 8 files of which: -- src/Main.hs module Main where import Loop main :: IO (...

[ -0.0126953125, 0.01361083984375, 0.007080078125, 0.0067138671875, 0.0174560546875, -0.0016632080078125, -0.0037689208984375, -0.0091552734375, 0, 0.0361328125, 0.022705078125, 0.04443359375, -0.0042724609375, 0.004608154296875, -0.0159912109375, 0.00738525390625, 0.00860595703125, ...

[ 360, 18, 51912, 6496, 864, 110527, 3036, 350, 17780, 135206, 2501, 2594, 35484, 1249, 289, 5423, 474, 4970, 7192, 172, 113, 1022, 2811, 40383, 3650, 39, 3864, 5201, 54, 16750, 63773, 202567, 7, 7136, 808, 174426, 117934, 26531, 82230, 176...

[ 0.0633544921875, 0.091064453125, 0.000946044921875, 0.10638427734375, 0.1695556640625, 0.2205810546875, 0.1590576171875, 0.123291015625, 0.2115478515625, 0.098388671875, 0.164306640625, 0.124755859375, 0.1572265625, 0.18359375, 0.1180419921875, 0.1214599609375, 0.093505859375, 0.11...

embed

56243730_c0

56243730

haskell

0

Title: How to evaluate this generic abstract syntax tree in Haskell? Problem title: How to evaluate this generic abstract syntax tree in Haskell? Tags: gadt, abstract-syntax-tree, tree, functional-programming, haskell Problem: How to evaluate this generic abstract syntax tree in Haskell? I've been interested in seeing ...

How to evaluate this generic abstract syntax tree in Haskell? How to evaluate this generic abstract syntax tree in Haskell? gadt abstract-syntax-tree tree functional-programming haskell op right How Haskell Instead Tree Number Word Operation Leaf LANGUAGE GADTs fivePlus2 Couldn Expected Actual Relevant How to evaluate ...

[ -0.005889892578125, 0.0086669921875, 0.003021240234375, -0.01055908203125, 0.030029296875, -0.0096435546875, -0.0004062652587890625, -0.017578125, -0.004547119140625, -0.038330078125, 0.0021820068359375, -0.02734375, 0.0010528564453125, -0.0025787353515625, -0.01116943359375, 0.0039062...

[ 11249, 151575, 13, 903, 189534, 164789, 6002, 86531, 53201, 20625, 142508, 23, 914, 13384, 12654, 62600, 123309, 28966, 1556, 233, 7108, 175399, 101344, 103332, 22543, 102203, 2407, 98064, 23749, 41072, 43606, 88225, 304, 191147, 60075, 100582, ...

[ 0.05535888671875, 0.1939697265625, 0.04693603515625, 0.06591796875, 0.2042236328125, 0.2220458984375, 0.1273193359375, 0.1656494140625, 0.253173828125, 0.1092529296875, 0.2205810546875, 0.03125, 0.076416015625, 0.1580810546875, 0.101318359375, 0.1895751953125, 0.095458984375, 0.063...

embed

62679154_c1

62679154

haskell

1

:7:46: error: • Couldn't match type ‘[Char]’ with ‘Data.Text.Internal.Text’ Expected type: Data.Text.Internal.Text Actual type: String • In the second argument of ‘RawBlock’, namely ‘pagebreakXml’ In the expression: RawBlock (Format "openxml") pagebreakXml In an equation for ‘pagebreakBlock’: pagebreakBlock = RawBlock ...

[ 0.0047607421875, 0.007171630859375, 0.01251220703125, 0.020263671875, 0.003021240234375, 0.017822265625, 0.0012359619140625, -0.0186767578125, 0.002593994140625, 0.00982666015625, 0.0284423828125, -0.0211181640625, 0.007293701171875, -0.039794921875, -0.000885009765625, 0.0101928710937...

[ 966, 32909, 18499, 768, 191147, 18, 14858, 10644, 1065, 84068, 678, 137989, 174379, 44851, 6236, 60075, 13, 11809, 100582, 23351, 214, 17932, 10750, 12248, 434, 166191, 22469, 70751, 1542, 7237, 125195, 109997, 102973, 59636, 131492, 9191, 5490...

[ 0.018341064453125, 0.22119140625, 0.1927490234375, 0.0253753662109375, 0.233642578125, 0.09228515625, 0.232177734375, 0.2113037109375, 0.0201568603515625, 0.2509765625, 0.088623046875, 0.16015625, 0.238037109375, 0.12890625, 0.115966796875, 0.157958984375, 0.13134765625, 0.13073730...

embed

16359971_c0

16359971

haskell

0

Title: Haskell - Types, Enums, and Functions Problem title: Haskell - Types, Enums, and Functions Tags: function, enums, types, haskell Problem: Haskell - Types, Enums, and Functions Good morning everyone, Here's what I'm working on today, and the issue I'm running in to: --A data Row = A | B | C | D | E | F | G | H | ...

Haskell - Types, Enums, and Functions Haskell - Types, Enums, and Functions function enums types haskell Haskell Types Enums Functions Row Enum Ord Show Bounded Read Column One Two Three Four Five Six Seven Eight Nine Ten Address Haskell - Types, Enums, and Functions Good morning everyone, Here's what I'm working on to...

[ 0.01055908203125, -0.007171630859375, 0.006195068359375, 0.015625, -0.01373291015625, 0.0012969970703125, -0.0107421875, 0.0032806396484375, -0.00537109375, -0.0021514892578125, 0.0096435546875, -0.00872802734375, -0.00701904296875, 0.0185546875, -0.037353515625, -0.0027313232421875, ...

[ 20625, 142508, 60457, 357, 10321, 28670, 32354, 22, 52895, 1556, 96190, 316, 35379, 17367, 335, 167457, 4764, 233987, 6561, 32964, 129335, 65056, 156615, 84247, 132556, 22553, 1520, 5531, 49990, 136, 42141, 30309, 20697, 18925, 31089, 51042, 10...

[ 0.139404296875, 0.2490234375, 0.177001953125, 0.1346435546875, 0.23779296875, 0.10986328125, 0.133544921875, 0.111328125, 0.18505859375, 0.15283203125, 0.2161865234375, 0.2032470703125, 0.152099609375, 0.09759521484375, 0.03369140625, 0.1470947265625, 0.1441650390625, 0.20568847656...

embed

77034184_c0

77034184

haskell

0

Title: Filter between two lists Haskell Problem title: Filter between two lists Haskell Tags: functional-programming, haskell Problem: Filter between two lists Haskell I am working in an exercise where the only solution I could think of is by using a list to filter another one. The exercise is the following: Using comp...

Filter between two lists Haskell Filter between two lists Haskell functional-programming haskell Filter Haskell Double sum.concat Filter between two lists Haskell I am working in an exercise where the only solution I could think of is by using a list to filter another one. The exercise is the following: I found a solut...

[ -0.000148773193359375, -0.0010528564453125, -0.005523681640625, 0.0037994384765625, -0.00830078125, 0.0181884765625, 0.006988525390625, 0.003692626953125, 0.01953125, 0.007476806640625, -0.0166015625, 0.0067138671875, -0.0101318359375, -0.00347900390625, -0.004364013671875, -0.00132751...

[ 128896, 17721, 6626, 5303, 20625, 142508, 123309, 28966, 1556, 107172, 10554, 2271, 4460, 20697, 81979, 4734, 29806, 5351, 17368, 47, 46312, 15700, 1632, 25632, 14037, 15490, 166577, 22288 ]

[ 0.2646484375, 0.172119140625, 0.115478515625, 0.2275390625, 0.1068115234375, 0.215087890625, 0.09869384765625, 0.070068359375, 0.10040283203125, 0.084228515625, 0.1690673828125, 0.048736572265625, 0.170654296875, 0.04669189453125, 0.0888671875, 0.03338623046875, 0.1287841796875, 0....

embed

68488715_c0

68488715

haskell

0

Title: Attoparsec: matching any of strings with common prefix Problem title: Attoparsec: matching any of strings with common prefix Tags: attoparsec, haskell Problem: Attoparsec: matching any of strings with common prefix I am trying to parse a limited set of valid strings which have a common prefix with attoparsec. Ho...

Attoparsec: matching any of strings with common prefix Attoparsec: matching any of strings with common prefix attoparsec haskell Control.Applicative qualified Attoparsec Partial Done LANGUAGE OverloadedStrings Data.Attoparsec.Text Thing Foobar Foobaz Foobarz thingParser1 PT.string thingParser2 PT.parse PT.Partial PT.Do...

[ -0.000820159912109375, -0.00494384765625, -0.01397705078125, 0.0015411376953125, -0.0169677734375, 0.000576019287109375, 0.0098876953125, -0.01373291015625, 0.01123046875, -0.01324462890625, 0.006805419921875, 0.01483154296875, 0.030029296875, 0.01031494140625, -0.0038604736328125, 0.0...

[ 9208, 31, 2500, 39797, 12, 14858, 214, 2499, 111, 79315, 678, 39210, 183114, 243, 1556, 142508, 27131, 11048, 217225, 9148, 289, 984, 86, 98064, 9578, 63033, 71713, 11809, 284, 10628, 174379, 6003, 9572, 1299, 40300, 16159, 14335, 13580, 28...

[ 0.1802978515625, 0.137451171875, 0.1864013671875, 0.25390625, 0.007476806640625, 0.2005615234375, 0.068603515625, 0.1043701171875, 0.105712890625, 0.2216796875, 0.111083984375, 0.1839599609375, 0.257080078125, 0.1600341796875, 0.0867919921875, 0.228515625, 0.1956787109375, 0.034729...

embed

23154774_c0

23154774

haskell

0

Title: Installation of missing C libraries when installing HDBC-Sqlite3 Problem title: Installation of missing C libraries when installing HDBC-Sqlite3 Tags: sqlite, haskell Problem: Installation of missing C libraries when installing HDBC-Sqlite3 I am trying to set up my PC running windows XP to run the Haskell Platfo...

Installation of missing C libraries when installing HDBC-Sqlite3 Installation of missing C libraries when installing HDBC-Sqlite3 sqlite haskell Installation HDBC-Sqlite3 Installation of missing C libraries when installing HDBC-Sqlite3 I am trying to set up my PC running windows XP to run the Haskell Platform and the S...

[ 0.0224609375, 0.01446533203125, -0.002288818359375, 0.0155029296875, -0.00665283203125, 0.0133056640625, 0.0004062652587890625, -0.0128173828125, -0.00148773193359375, 0.0133056640625, 0.002532958984375, -0.068359375, 0.0001506805419921875, 0.004180908203125, -0.01043701171875, -0.0114...

[ 145323, 132283, 313, 35773, 10484, 20600, 4732, 24318, 95255, 67, 363, 1556, 142508, 294, 31577, 5423, 6107, 54825, 45005, 20625, 70968, 80866, 1486, 63399, 116, 78301, 165867, 52922, 7026, 13651, 31913, 13909, 148968, 42724, 6495, 7, 7735, 9...

[ 0.11962890625, 0.1710205078125, 0.1552734375, 0.218505859375, 0.1053466796875, 0.1728515625, 0.14013671875, 0.21923828125, 0.2158203125, 0.1732177734375, 0.16943359375, 0.0826416015625, 0.1954345703125, 0.010894775390625, 0.0146484375, 0.00457763671875, 0.1016845703125, 0.042785644...

embed

64207239_c0

64207239

haskell

0

Title: Generate a list representing a doorbell system Problem title: Generate a list representing a doorbell system Tags: list, haskell, tuples Problem: Generate a list representing a doorbell system I'm trying to generate a list from two Int s and another list of tuples to represent a doorbell system for an apartment ...

Generate a list representing a doorbell system Generate a list representing a doorbell system list haskell tuples Generate Rgt Lft Cent Char Generate a list representing a doorbell system I'm trying to generate a list from two Int s and another list of tuples to represent a doorbell system for an apartment building. Th...

[ -0.01611328125, 0.0125732421875, -0.006439208984375, 0.005706787109375, 0.0013275146484375, 0.0245361328125, -0.019775390625, -0.0022735595703125, -0.01019287109375, 0.0034027099609375, 0.00579833984375, 0.001068115234375, 0.0111083984375, 0.002777099609375, -0.033447265625, -0.0113525...

[ 155370, 67, 5303, 33636, 1911, 70926, 5426, 214, 1556, 142508, 370, 99726, 627, 5386, 2480, 81366, 21656, 31577, 139392, 1295, 6626, 360, 18, 91, 127451, 33976, 5117, 14012, 74912, 17932, 246, 19, 32316, 1177, 88203, 113068, 100, 27781, 209...

[ 0.20263671875, 0.03692626953125, 0.2296142578125, 0.2216796875, 0.1009521484375, 0.259521484375, 0.1717529296875, 0.0227508544921875, 0.1026611328125, 0.197509765625, 0.091064453125, 0.203369140625, 0.013092041015625, 0.1549072265625, 0.1536865234375, 0.17724609375, 0.1253662109375, ...

embed

52955380_c0

52955380

haskell

0

Title: How can I use annotations to customize HLint and mark my Haskell package as Safe? Problem title: How can I use annotations to customize HLint and mark my Haskell package as Safe? Tags: haskell Problem: How can I use annotations to customize HLint and mark my Haskell package as Safe? In my package I have several ...

How can I use annotations to customize HLint and mark my Haskell package as Safe? How can I use annotations to customize HLint and mark my Haskell package as Safe? haskell How HLint Haskell Safe ANN Use Redundant LANGUAGE Annotations See ghc.haskell.org How can I use annotations to customize HLint and mark my Haskell p...

[ 0.00872802734375, 0.00067901611328125, 0.0218505859375, 0.004180908203125, -0.01348876953125, 0.0159912109375, -0.00567626953125, 0.000324249267578125, -0.002349853515625, 0.00014400482177734375, 0.0234375, -0.01434326171875, 0.01007080078125, 0.00933837890625, 0, 0.01123046875, -0.0...

[ 11249, 831, 4527, 8668, 22062, 178036, 48599, 4288, 16188, 20625, 142508, 98169, 237, 115527, 1556, 24455, 36836, 6096, 35405, 3358, 98064, 48143, 31380, 10557, 40368, 75084, 9790, 678, 184750, 45367, 3034, 15490, 18499, 30700, 13, 96243, 11486...

[ 0.0352783203125, 0.034454345703125, 0.07611083984375, 0.1810302734375, 0.178466796875, 0.186767578125, 0.1422119140625, 0.2366943359375, 0.124267578125, 0.1448974609375, 0.221923828125, 0.1732177734375, 0.037841796875, 0.205322265625, 0.103515625, 0.088134765625, 0.0264739990234375, ...

embed

28278378_c0

28278378

haskell

0

Title: Implement two or more instances simultaneously in haskell Problem title: Implement two or more instances simultaneously in haskell Tags: haskell Problem: Implement two or more instances simultaneously in haskell I have defined following class in Haskell: class SearchList searchEntity where searchList :: [Artifac...

Implement two or more instances simultaneously in haskell Implement two or more instances simultaneously in haskell haskell Implement SearchList ArtifactTree Artifact Version x:xs Implement two or more instances simultaneously in haskell I have defined following class in Haskell: I have two equal implementations of thi...

[ -0.0032958984375, 0.00146484375, 0.011474609375, 0.00482177734375, -0.0240478515625, 0.0135498046875, -0.00408935546875, 0.001007080078125, 0.0159912109375, -0.01708984375, -0.0033721923828125, -0.00101470947265625, 0.0216064453125, -0.00005698204040527344, -0.0106201171875, 0.00334167...

[ 153941, 6626, 707, 1286, 110527, 7, 134477, 13, 79850, 1556, 142508, 23, 33086, 154663, 38420, 114700, 62731, 40647, 1022, 12, 425, 61924, 25632, 18507, 20625, 765, 105950, 208124, 903, 12921, 77630, 3917, 70163, 3934, 1632, 71864, 18151, 115...

[ 0.237548828125, 0.163330078125, 0.0914306640625, 0.1390380859375, 0.25927734375, 0.061981201171875, 0.196044921875, 0.053985595703125, 0.058074951171875, 0.1697998046875, 0.2476806640625, 0.028106689453125, 0.144287109375, 0.139404296875, 0.1207275390625, 0.200439453125, 0.1591796875...

embed

31947777_c0

31947777

haskell

0

Title: Why GHC avoids tacit programming? Problem title: Why GHC avoids tacit programming? Tags: tacit-programming, haskell Problem: Why GHC avoids tacit programming? I was looking at GHC.Unicode library source and realized that almost all the Haskell internal libraries avoid tacit programming (aka point-free style) mos...

Why GHC avoids tacit programming? Why GHC avoids tacit programming? tacit-programming haskell Why GHC GHC.Unicode isLatin1 Char Bool Why GHC avoids tacit programming? I was looking at GHC.Unicode library source and realized that almost all the Haskell internal libraries avoid tacit programming (aka point-free style) mo...

[ 0.00103759765625, -0.003265380859375, 0.0238037109375, 0.007080078125, -0.004608154296875, 0.005218505859375, 0.0147705078125, -0.00665283203125, -0.01416015625, -0.00115203857421875, 0.0040283203125, -0.026611328125, 0.0072021484375, -0.00390625, -0.0235595703125, -0.006072998046875, ...

[ 44084, 527, 73265, 71864, 308, 12645, 56037, 449, 7, 28966, 214, 1556, 142508, 85600, 40899, 83, 2729, 2311, 418, 21656, 2460, 929, 35773, 20625, 70796, 10484, 6275, 32087, 20623, 2684, 1733, 60552, 32354, 831, 72546, 117176, 126684, 50218, ...

[ 0.07208251953125, 0.108154296875, 0.2138671875, 0.16015625, 0.1468505859375, 0.2166748046875, 0.1842041015625, 0.05377197265625, 0.0196380615234375, 0.149169921875, 0.032684326171875, 0.1180419921875, 0.263916015625, 0.1046142578125, 0.197998046875, 0.037933349609375, 0.1087646484375...

embed

62583161_c0

62583161

haskell

0

Title: Is it possible to return different http codes with Servant? Problem title: Is it possible to return different http codes with Servant? Tags: haskell, servant Problem: Is it possible to return different http codes with Servant? I want to write API endpoint that would return different http code depending on incomi...

Is it possible to return different http codes with Servant? Is it possible to return different http codes with Servant? haskell servant Servant start_response check_foo Created UserAPI Verb GET JSON Server Is it possible to return different http codes with Servant? I want to write API endpoint that would return differe...

[ -0.013916015625, 0.00164031982421875, 0.0152587890625, 0.006439208984375, 0.00262451171875, -0.006591796875, -0.0084228515625, 0.00518798828125, -0.00177001953125, 0.006378173828125, 0.0079345703125, 0.01190185546875, -0.0135498046875, 0.0220947265625, -0.0027008056640625, 0.0003471374...

[ 2071, 7722, 30646, 12921, 1621, 18151, 7, 678, 5406, 30624, 1556, 142508, 187646, 4034, 134719, 12765, 3584, 31, 151313, 53400, 74220, 1446, 79794, 821, 58627, 22687, 442, 47, 3444, 33022, 61687, 3564, 38496, 2806, 96819, 277, 171859, 11341, ...

[ 0.01025390625, 0.1820068359375, 0.227783203125, 0.2275390625, 0.2095947265625, 0.222412109375, 0.011566162109375, 0.10528564453125, 0.1925048828125, 0.2412109375, 0.1107177734375, 0.1846923828125, 0.251220703125, 0.0906982421875, 0.1444091796875, 0.10382080078125, 0.0819091796875, ...

embed