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
65440139_c0	65440139	haskell	0	Title: Efficient (O(n^2)) Sieve of Sundaram in Haskell Problem title: Efficient (O(n^2)) Sieve of Sundaram in Haskell Tags: haskell, sieve-algorithm, time-complexity, primes, optimization Problem: Efficient (O(n^2)) Sieve of Sundaram in Haskell There are many answers on SO explaining how to implement the Sieve of Sunda...	Efficient (O(n^2)) Sieve of Sundaram in Haskell Efficient (O(n^2)) Sieve of Sundaram in Haskell haskell sieve-algorithm time-complexity primes optimization Efficient Sieve Sundaram Haskell Integer i..n Efficient (O(n^2)) Sieve of Sundaram in Haskell There are many answers on SO explaining how to implement the Sieve of ...	[ -0.020263671875, 0.01141357421875, 0.01043701171875, 0.006744384765625, 0.01092529296875, 0.004791259765625, -0.010498046875, 0.00885009765625, -0.01324462890625, -0.02880859375, 0.01263427734375, 0.00396728515625, 0.0087890625, -0.0052490234375, -0.0211181640625, 0.01416015625, 0.00...	[ 241, 24500, 45964, 670, 8353, 10461, 727, 272, 111, 96155, 2198, 20625, 142508, 23, 1556, 78, 3134, 100628, 2783, 1733, 44974, 20809, 7, 87235, 44401, 19, 35166, 15969, 73342, 3642, 29479, 6183, 13, 51347, 51592, 4488, 55412, 1810, 101935, ...	[ 0.001312255859375, 0.1572265625, 0.12646484375, 0.17626953125, 0.0638427734375, 0.168701171875, 0.1812744140625, 0.21875, 0.1787109375, 0.149658203125, 0.2529296875, 0.1568603515625, 0.263671875, 0.059478759765625, 0.1253662109375, 0.133056640625, 0.227783203125, 0.05010986328125, ...	embed
35996441_c0	35996441	haskell	0	Title: Error with a quadrant giving function Problem title: Error with a quadrant giving function Tags: function, guard-statement, haskell Problem: Error with a quadrant giving function I tried to make a function to give the quadrant name when inputting the x and y coordinates. However, I am getting the error: "parse e...	Error with a quadrant giving function Error with a quadrant giving function function guard-statement haskell Error Quadrants Origin Quadrant_I Quadrant_II Quadrant_III Quadrant_IV X_Axis_Positive X_Axis_Negative Y_Axis_Positive Y_Axis_Negative Show Float Error with a quadrant giving function I tried to make a function ...	[ -0.00640869140625, 0.009521484375, 0.0002956390380859375, -0.013427734375, 0.0064697265625, -0.0152587890625, 0.0107421875, 0.0037994384765625, -0.0306396484375, 0.01708984375, 0.005828857421875, -0.01324462890625, -0.00147247314453125, -0.007354736328125, -0.003997802734375, -0.004608...	[ 212059, 678, 10, 68587, 660, 68772, 32354, 56050, 61340, 1556, 142508, 83227, 15212, 119862, 568, 10001, 33747, 15583, 1193, 33102, 172, 208, 4935, 990, 6433, 17367, 38699, 257, 37842, 8337, 9351, 107730, 1022, 136, 113, 176866, 18499, 2500, ...	[ 0.195556640625, 0.1673583984375, 0.0767822265625, 0.27587890625, 0.2003173828125, 0.1839599609375, 0.2125244140625, 0.209228515625, 0.1273193359375, 0.1290283203125, 0.218505859375, 0.19775390625, 0.189208984375, 0.1805419921875, 0.034576416015625, 0.056640625, 0.10107421875, 0.141...	embed
15927000_c0	15927000	haskell	0	Title: Haskell type definition, => etc Problem title: Haskell type definition, => etc Tags: haskell Problem: Haskell type definition, => etc I am learning Haskell using Learn You a Haskell. On page 54 is an implementation of take like so: take' :: (Num i, Ord i) => i -> [a] -> [a] take' n _ \| n <= 0 = [] take' _ ...	Haskell type definition, => etc Haskell type definition, => etc haskell Haskell Num Ord x:xs n-1 Haskell type definition, => etc I am learning Haskell using Learn You a Haskell. On page 54 is an implementation of take like so: I understand all the code apart from the first line. The :: part I understand as meanin...	[ 0.0027313232421875, -0.004638671875, 0.0196533203125, 0.00970458984375, -0.007476806640625, 0.02001953125, -0.00408935546875, 0.00121307373046875, 0.0045166015625, 0.00250244140625, 0.0113525390625, -0.04052734375, -0.00677490234375, -0.01263427734375, -0.0262451171875, -0.008117675781...	[ 20625, 142508, 10644, 80934, 2203, 5386, 3021, 1556, 52782, 35379, 1022, 12, 425, 7, 5759, 44357, 52080, 134031, 8983, 208124, 5646, 1884, 221, 28219, 18151, 1984, 2831, 91084, 903, 839, 316, 17, 4, 83, 370, 8705, 5117, 12830, 54744, 238,...	[ 0.1409912109375, 0.206787109375, 0.23046875, 0.1649169921875, 0.08160400390625, 0.035491943359375, 0.01055908203125, 0.1181640625, 0.1239013671875, 0.1597900390625, 0.059814453125, 0.004119873046875, 0.0333251953125, 0.013031005859375, 0.1195068359375, 0.04083251953125, 0.00228881835...	embed
43404290_c0	43404290	haskell	0	Title: A List of Recursive Data Structure as Function Input Problem title: A List of Recursive Data Structure as Function Input Tags: haskell, types Problem: A List of Recursive Data Structure as Function Input I defined a recursive data structure in Haskell: data NestedList a = Element a \| SubList [NestedList a] and t...	A List of Recursive Data Structure as Function Input A List of Recursive Data Structure as Function Input haskell types List Recursive Data Structure Input NestedList Element SubList Output x:xs A List of Recursive Data Structure as Function Input I defined a recursive data structure in Haskell: and then I want to defi...	[ -0.0220947265625, 0.0242919921875, 0.0113525390625, -0.0107421875, 0.0166015625, 0.02490234375, -0.0040283203125, -0.00061798095703125, 0.0006866455078125, -0.01220703125, -0.0027618408203125, -0.03564453125, 0.000469207763671875, 0.0211181640625, -0.005279541015625, -0.00335693359375,...	[ 32036, 853, 48650, 5844, 11809, 63667, 238, 6644, 237, 28670, 10763, 360, 1556, 142508, 52895, 28701, 71, 154663, 48325, 8273, 13538, 12, 425, 61924, 195625, 2053, 45646, 20625, 49878, 510, 32354, 5646, 5303, 30646, 16750, 27781, 80934, 959, ...	[ 0.1357421875, 0.08935546875, 0.1881103515625, 0.1475830078125, 0.1119384765625, 0.1650390625, 0.11181640625, 0.05029296875, 0.085205078125, 0.1383056640625, 0.044097900390625, 0.1217041015625, 0.107666015625, 0.2449951171875, 0.1571044921875, 0.1966552734375, 0.09130859375, 0.18859...	embed
64721704_c0	64721704	haskell	0	Title: Parameters in anonymous function Problem title: Parameters in anonymous function Tags: lambda, haskell, anonymous-function Problem: Parameters in anonymous function I've been practicing with anonymous functions and got the following: takeWhile' :: (a -> Bool) -> [a] -> [a] takeWhile' f xs = foldl (\x y z -> if (...	Parameters in anonymous function Parameters in anonymous function lambda haskell anonymous-function Parameters Bool Occurs Parameters in anonymous function I've been practicing with anonymous functions and got the following: which is basically a rewrite of the takeWhile function already in Haskell. For those who don't ...	[ 0.00101470947265625, 0.007354736328125, -0.0020904541015625, 0.0150146484375, 0.0030517578125, 0.01422119140625, 0.0067138671875, 0.01202392578125, 0.00616455078125, -0.0218505859375, 0.0115966796875, -0.01312255859375, -0.001617431640625, 0.00994873046875, 0.00457763671875, -0.0163574...	[ 1720, 29089, 52184, 10821, 32354, 23, 6492, 85, 1556, 142508, 137175, 2460, 929, 180, 238, 48650, 74082, 456, 434, 18781, 5646, 1456, 979, 133, 21771, 20625, 51776, 5303, 136, 30646, 11907, 12830, 40407, 98320, 26785, 138, 10750, 1022, 113,...	[ 0.10406494140625, 0.1708984375, 0.2174072265625, 0.146728515625, 0.1864013671875, 0.0151214599609375, 0.1326904296875, 0.0665283203125, 0.101806640625, 0.2486572265625, 0.16064453125, 0.06982421875, 0.1866455078125, 0.024322509765625, 0.03936767578125, 0.12646484375, 0.03765869140625...	embed
10790647_c0	10790647	haskell	0	Title: Shift reduce conflicts in happy grammar Problem title: Shift reduce conflicts in happy grammar Tags: yacc, haskell, grammar, happy Problem: Shift reduce conflicts in happy grammar Hello good programmers, I have built following grammar in happy (haskell): P : program C {Prog $2} E : int {Num $1} \| ident {Id $1} \|...	Shift reduce conflicts in happy grammar Shift reduce conflicts in happy grammar yacc haskell grammar happy Shift Prog Num BoolConst ReadInput Parens Add Sub Mult Div Assign Cond OutputComm While Declare Seq DSeq Shift reduce conflicts in happy grammar Hello good programmers, I have built following grammar in happy (has...	[ 0.000392913818359375, -0.012451171875, 0.0142822265625, 0.01190185546875, -0.00555419921875, -0.0152587890625, -0.036376953125, 0.00151824951171875, 0.00067138671875, -0.00677490234375, 0.017822265625, 0.00787353515625, -0.0093994140625, -0.0252685546875, 0.00701904296875, 0.0044555664...	[ 8294, 2480, 34390, 79612, 7, 17723, 122092, 147, 151, 10060, 1556, 142508, 1250, 52782, 929, 11935, 271, 4764, 2392, 1755, 29117, 8273, 81212, 53026, 31304, 1657, 71, 13538, 10770, 51404, 25755, 38103, 864, 77848, 88303, 25632, 10557, 40956, ...	[ 0.1851806640625, 0.1798095703125, 0.17919921875, 0.1859130859375, 0.04864501953125, 0.2401123046875, 0.149169921875, 0.1256103515625, 0.0662841796875, 0.07672119140625, 0.08837890625, 0.190673828125, 0.039642333984375, 0.074462890625, 0.05853271484375, 0.0394287109375, 0.008697509765...	embed
15005670_c0	15005670	haskell	0	Title: Why is there no implicit parallelism in Haskell? Problem title: Why is there no implicit parallelism in Haskell? Tags: parallel-processing, haskell, concurrency, compiler-optimization Problem: Why is there no implicit parallelism in Haskell? Haskell is functional and pure, so basically it has all the properties ...	Why is there no implicit parallelism in Haskell? Why is there no implicit parallelism in Haskell? parallel-processing haskell concurrency compiler-optimization a Why Haskell Just Why is there no implicit parallelism in Haskell? Haskell is functional and pure, so basically it has all the properties needed for a compiler...	[ -0.005157470703125, 0.0233154296875, 0.00005698204040527344, 0.01129150390625, -0.0032196044921875, 0.020263671875, 0.00147247314453125, -0.0177001953125, -0.01251220703125, -0.017333984375, -0.0054931640625, 0.002471923828125, -0.004791259765625, 0.0078125, 0.006103515625, 0.005035400...	[ 44084, 83, 2685, 110, 165164, 95103, 8780, 23, 20625, 142508, 63923, 1556, 108636, 982, 9969, 34759, 100433, 123309, 136, 34166, 183871, 44841, 19048, 36461, 133, 27781, 34702, 2227, 71924, 1830, 1774, 151552, 6044, 29479, 49938, 58827, 192, ...	[ 0.119873046875, 0.044586181640625, 0.07147216796875, 0.1160888671875, 0.25244140625, 0.2459716796875, 0.1656494140625, 0.0638427734375, 0.1470947265625, 0.25830078125, 0.03643798828125, 0.1259765625, 0.0849609375, 0.033843994140625, 0.1392822265625, 0.137451171875, 0.06787109375, 0...	embed
15235979_c0	15235979	haskell	0	Title: haskell print multiple variables by pattern Problem title: haskell print multiple variables by pattern Tags: haskell Problem: haskell print multiple variables by pattern I started writing answers to project euler problems in Haskell like so problem1 = ... problem2 = ... to display them all together I've been usi...	haskell print multiple variables by pattern haskell print multiple variables by pattern haskell ghci problem1 problem2 haskell print multiple variables by pattern I started writing answers to project euler problems in Haskell like so to display them all together I've been using something like this Is there a way to do ...	[ -0.00457763671875, 0.0023345947265625, -0.0177001953125, 0.031005859375, -0.01220703125, 0.0140380859375, -0.01092529296875, 0.00482177734375, 0.0242919921875, -0.021728515625, -0.0003566741943359375, -0.019287109375, 0.0120849609375, -0.006103515625, -0.0037078857421875, 0.00729370117...	[ 1556, 142508, 28412, 48716, 77336, 390, 103510, 31380, 318, 2967, 418, 304, 7, 32562, 35166, 13452, 1175, 603, 44402, 20625, 1884, 44116, 756, 25842, 17368, 3917, 54, 15490, 43658, 452, 1916, 13204, 111789, 347, 617, 63134, 21011, 3900, 193...	[ 0.1572265625, 0.22314453125, 0.2081298828125, 0.2152099609375, 0.24658203125, 0.135009765625, 0.264892578125, 0.07110595703125, 0.099609375, 0.1468505859375, 0.009765625, 0.003753662109375, 0.033416748046875, 0.0689697265625, 0.12353515625, 0.0941162109375, 0.074462890625, 0.165649...	embed
50852592_c0	50852592	haskell	0	Title: Looking for a function similar sequenceA Problem title: Looking for a function similar sequenceA Tags: applicative, haskell Problem: Looking for a function similar sequenceA Tying to learn more about applicatives. I have the following definitions: class Applicative' f where pack :: a -> f a unpack :: f a -> a in...	Looking for a function similar sequenceA Looking for a function similar sequenceA applicative haskell Looking Applicative Box Bag Basket pack1 pack2 Looking for a function similar sequenceA Tying to learn more about applicatives. I have the following definitions: What I am looking for is a way generalise this concept (...	[ 0.0284423828125, 0.016845703125, -0.008056640625, 0.03125, -0.000705718994140625, 0.00604248046875, 0.0150146484375, 0.02294921875, 0.017333984375, -0.0084228515625, 0.003936767578125, 0.006439208984375, -0.00518798828125, 0.030517578125, -0.005523681640625, 0.000484466552734375, 0.0...	[ 157268, 100, 32354, 21373, 40, 944, 3956, 284, 41816, 4935, 1556, 142508, 5659, 11048, 27271, 19413, 152327, 43824, 418, 304, 8064, 30698, 42991, 80934, 16487, 3917, 4537, 3075, 23755, 7722, 4527, 11782, 3060, 919, 19, 25632, 69307, 20625 ]	[ 0.14453125, 0.090087890625, 0.2144775390625, 0.2216796875, 0.0721435546875, 0.1297607421875, 0.07415771484375, 0.1527099609375, 0.1973876953125, 0.133544921875, 0.117431640625, 0.250244140625, 0.10504150390625, 0.156494140625, 0.134521484375, 0.171630859375, 0.196044921875, 0.19104...	embed
43944647_c1	43944647	haskell	1	0, 0] tW = transpose ws w = take 4 $ tail $ cycle $ last tW get wss x y = (wss !! y) !! x print' = print . w128 . concat . transpose where w128 = concatMap (f . (`showHex` "")) f w = (length w < 2) ? (' ':'0':w, ' ':w) grid _ [] = [] grid n xs = take n xs : grid n (drop n xs) nibs w = (shiftR (w .&. 0xF0) 4, w .&. 0x0F...	0, 0] tW = transpose ws w = take 4 $ tail $ cycle $ last tW get wss x y = (wss !! y) !! x print' = print . w128 . concat . transpose where w128 = concatMap (f . (`showHex` "")) f w = (length w < 2) ? (' ':'0':w, ' ':w) grid _ [] = [] grid n xs = take n xs : grid n (drop n xs) nibs w = (shiftR (w .&. 0xF0) 4, w .&. 0x0F...	[ -0.011962890625, 0.0157470703125, 0.0011444091796875, -0.0191650390625, -0.0299072265625, -0.0240478515625, 0.001007080078125, -0.01116943359375, 0.002166748046875, 0.0299072265625, 0.01171875, 0.05322265625, 0.0142822265625, 0.0040283203125, -0.0281982421875, 0.0038909912109375, 0.0...	[ 757, 808, 1456, 2203, 3900, 78381, 148, 7, 5646, 201, 3650, 46741, 105823, 4568, 2046, 1022, 113, 19725, 6506, 28412, 81764, 158, 4460, 166179, 420, 31374, 841, 3355, 1238, 23986, 4426, 4958, 2389, 434, 120067, 653, 138810, 300, 16145, 37...	[ 0.148193359375, 0.107666015625, 0.1983642578125, 0.03143310546875, 0.1824951171875, 0.2191162109375, 0.165283203125, 0.102783203125, 0.16650390625, 0.193115234375, 0.039642333984375, 0.2225341796875, 0.2347412109375, 0.12255859375, 0.062255859375, 0.05401611328125, 0.11865234375, 0...	embed
67419452_c0	67419452	haskell	0	Title: Haskell Esqueleto: perform join on list of values using "with" Problem title: Haskell Esqueleto: perform join on list of values using "with" Tags: haskell, esqueleto Problem: Haskell Esqueleto: perform join on list of values using "with" I am trying to do a join on a list of values known befo...	Haskell Esqueleto: perform join on list of values using "with" Haskell Esqueleto: perform join on list of values using "with" haskell esqueleto $ Haskell Esqueleto SkuId Double InnerJoin Table Price PriceSku PriceValue Haskell Esqueleto: perform join on list of values using "with" I am trying to do ...	[ -0.0081787109375, 0.01104736328125, 0.004730224609375, -0.0029296875, -0.00732421875, -0.00186920166015625, -0.0179443359375, 0.01171875, 0.01470947265625, -0.015869140625, 0.00347900390625, 0.0262451171875, 0.006378173828125, 0.0038909912109375, -0.009033203125, 0.01904296875, 0.015...	[ 20625, 142508, 1184, 37631, 31580, 51339, 33284, 98, 5303, 111, 142424, 17368, 76228, 1230, 1556, 66660, 133, 188, 3650, 46605, 568, 71, 107172, 137657, 16604, 112997, 48025, 319, 856, 31577, 54, 51529, 8108, 12336, 27781, 2046, 112034, 100, ...	[ 0.1033935546875, 0.209716796875, 0.0694580078125, 0.1488037109375, 0.1956787109375, 0.1923828125, 0.257080078125, 0.107666015625, 0.2086181640625, 0.010986328125, 0.2291259765625, 0.040496826171875, 0.280517578125, 0.0162353515625, 0.109375, 0.1309814453125, 0.134521484375, 0.15747...	embed
24712273_c1	24712273	haskell	1	the same input. The idea is to replace something like (map f xs, map g xs) with let ys = map (\ x -> (f x, g x)) xs in (map fst ys, map snd ys) If traversing ys is much cheaper than traversing xs (e.g. if xs is a file on the network) or if we can e.g. use producer-consumer fusion to later fuse the untagging with some ...	the same input. The idea is to replace something like (map f xs, map g xs) with let ys = map (\ x -> (f x, g x)) xs in (map fst ys, map snd ys) If traversing ys is much cheaper than traversing xs (e.g. if xs is a file on the network) or if we can e.g. use producer-consumer fusion to later fuse the untagging with some ...	[ 0.0206298828125, -0.0123291015625, 0.0174560546875, -0.018310546875, -0.004241943359375, -0.0072021484375, -0.0390625, -0.0198974609375, 0.006378173828125, 0.006195068359375, -0.01007080078125, -0.003997802734375, 0.024658203125, 0.0118408203125, -0.01708984375, -0.0169677734375, -0....	[ 70, 5701, 107730, 6528, 83, 47, 91995, 1884, 62346, 1238, 1022, 7, 22288, 706, 678, 2633, 113, 2203, 33079, 420, 23, 271, 37317, 5045, 64720, 56, 11435, 33120, 2174, 4527, 108558, 25553, 316, 119485, 57574, 13, 51, 102, 36659, 19916, 9,...	[ 0.07958984375, 0.1727294921875, 0.23193359375, 0.1356201171875, 0.043548583984375, 0.01629638671875, 0.1468505859375, 0.0245819091796875, 0.1497802734375, 0.044158935546875, 0.1444091796875, 0.0980224609375, 0.1710205078125, 0.05426025390625, 0.01153564453125, 0.1361083984375, 0.1546...	embed
19326208_c0	19326208	haskell	0	Title: Haskell Src Exts Parsing Multiple Statements Problem title: Haskell Src Exts Parsing Multiple Statements Tags: ghc, ghci, haskell-src-exts, haskell, parsing Problem: Haskell Src Exts Parsing Multiple Statements I would like to parse a list of Haskell statements. For instance, suppose I have the following code: l...	Haskell Src Exts Parsing Multiple Statements Haskell Src Exts Parsing Multiple Statements ghc ghci haskell-src-exts haskell parsing Haskell Src Exts Parsing Multiple Statements ParseResult Stmt ParseOk Haskell Src Exts Parsing Multiple Statements I would like to parse a list of Haskell statements. For instance, suppose...	[ 0.000827789306640625, 0.002716064453125, -0.018310546875, 0.015380859375, -0.0086669921875, 0.00518798828125, -0.00106048583984375, -0.0250244140625, 0.0064697265625, -0.0296630859375, -0.009765625, -0.03564453125, 0.0022430419921875, 0.001922607421875, -0.00146484375, 0.019287109375, ...	[ 20625, 142508, 159, 19437, 5443, 933, 2392, 19335, 8705, 22836, 6953, 31380, 238, 318, 1556, 3355, 366, 184, 7, 7136, 18, 73852, 9035, 1884, 5303, 63805, 18151, 32354, 37455, 39, 30646, 9384, 24124, 43240, 11001, 10644, 23351, 1974, 10, 2...	[ 0.138916015625, 0.2425537109375, 0.0259857177734375, 0.21142578125, 0.155029296875, 0.12060546875, 0.1649169921875, 0.17236328125, 0.1009521484375, 0.2193603515625, 0.003631591796875, 0.042816162109375, 0.007415771484375, 0.035888671875, 0.114501953125, 0.134765625, 0.17578125, 0.1...	embed
7208559_c0	7208559	haskell	0	Title: HXT: Surprising behavior when reading and writing HTML to String in pure code Problem title: HXT: Surprising behavior when reading and writing HTML to String in pure code Tags: haskell, hxt Problem: HXT: Surprising behavior when reading and writing HTML to String in pure code I want to read HTML from a String, p...	HXT: Surprising behavior when reading and writing HTML to String in pure code HXT: Surprising behavior when reading and writing HTML to String in pure code haskell hxt HXT Surprising HTML Bogus Some HXT: Surprising behavior when reading and writing HTML to String in pure code I want to read HTML from a String, process ...	[ -0.0003948211669921875, 0.0242919921875, -0.01336669921875, -0.004669189453125, -0.003753662109375, -0.0079345703125, 0.01483154296875, -0.0107421875, 0.00482177734375, 0.007720947265625, 0.006500244140625, 0.0081787109375, -0.033447265625, -0.00070953369140625, 0.0322265625, -0.015869...	[ 572, 70981, 8018, 22876, 214, 123166, 16454, 136, 32562, 19097, 47, 23351, 23, 34166, 18151, 1556, 142508, 1096, 29062, 114651, 7, 31384, 3444, 12301, 1295, 9433, 30646, 98816, 12937, 237, 10, 41018, 64209, 17780, 43257, 71924, 70, 1172, 15...	[ 0.1365966796875, 0.272705078125, 0.05523681640625, 0.10009765625, 0.107177734375, 0.133544921875, 0.144775390625, 0.02947998046875, 0.115234375, 0.261474609375, 0.09808349609375, 0.165283203125, 0.03472900390625, 0.1468505859375, 0.1614990234375, 0.1007080078125, 0.189697265625, 0....	embed
48066295_c2	48066295	haskell	2	-1.0.0.7-KGBP1BSKxH5GCm0LnZP04j Process exited with code: ExitFailure 1 Logs have been written to: /home/ian/.stack/global-project/.stack-work/logs/old-time-1.1.0.3.log [1 of 2] Compiling Main ( /tmp/stack23769/old-time-1.1.0.3/Setup.hs, /tmp/stack23769/old-time-1.1.0.3/.stack-work/dist/x86_64-linux-tinfo6-nopie/Cabal-...	-1.0.0.7-KGBP1BSKxH5GCm0LnZP04j Process exited with code: ExitFailure 1 Logs have been written to: /home/ian/.stack/global-project/.stack-work/logs/old-time-1.1.0.3.log [1 of 2] Compiling Main ( /tmp/stack23769/old-time-1.1.0.3/Setup.hs, /tmp/stack23769/old-time-1.1.0.3/.stack-work/dist/x86_64-linux-tinfo6-nopie/Cabal-...	[ -0.01116943359375, 0.01220703125, 0.015625, -0.01251220703125, -0.00089263916015625, -0.0013580322265625, -0.03173828125, -0.016357421875, -0.006591796875, 0.005889892578125, -0.021484375, -0.006988525390625, 0.0029144287109375, 0.0018463134765625, 0.002532958984375, 0.004638671875, ...	[ 20, 102107, 134926, 45214, 56861, 10762, 74800, 7709, 170, 123996, 82230, 297, 678, 18151, 5443, 217, 17647, 379, 3408, 106, 13146, 7, 59121, 47, 29552, 3378, 590, 2594, 156566, 95322, 18244, 4867, 18345, 6032, 92134, 170179, 116, 15612, 49...	[ 0.0009765625, 0.1517333984375, 0.2156982421875, 0.045135498046875, 0.1080322265625, 0.049560546875, 0.0450439453125, 0.0631103515625, 0.10723876953125, 0.2247314453125, 0.2484130859375, 0.10662841796875, 0.121337890625, 0.22900390625, 0.15625, 0.1492919921875, 0.1522216796875, 0.11...	embed
54618771_c1	54618771	haskell	1	<> fg green <> (text.pack.show) item in the function 'runMonitoringCommand', I want somehow to add 2 parameters to (displayCallResult currentStep), can we do that ? instead of repeating the "displayCallResult currentStep" like this : runMonitoringCommand :: forall stepType. MonitoringCommand -> Step stepType -> Client...	<> fg green <> (text.pack.show) item in the function 'runMonitoringCommand', I want somehow to add 2 parameters to (displayCallResult currentStep), can we do that ? instead of repeating the "displayCallResult currentStep" like this : runMonitoringCommand :: forall stepType. MonitoringCommand -> Step stepType -> Client...	[ -0.02099609375, -0.0003814697265625, -0.0023651123046875, 0.018310546875, 0.04150390625, 0.007293701171875, 0.0009765625, -0.0283203125, 0.0103759765625, 0.00994873046875, 0.0283203125, 0.006805419921875, -0.016357421875, 0.012939453125, -0.0140380859375, 0.0106201171875, -0.00927734...	[ 1238, 177, 50997, 22829, 29102, 31374, 35735, 32354, 16428, 46674, 26111, 214, 10770, 12018, 3444, 209303, 15190, 116, 171859, 47, 3827, 20706, 441, 5584, 4332, 7, 7136, 43581, 191644, 831, 642, 54, 64457, 119140, 11675, 29954, 196707, 49570,...	[ 0.008270263671875, 0.0113525390625, 0.1517333984375, 0.152099609375, 0.201904296875, 0.1209716796875, 0.196533203125, 0.13037109375, 0.166748046875, 0.149169921875, 0.214111328125, 0.10400390625, 0.1473388671875, 0.21826171875, 0.100341796875, 0.07275390625, 0.164306640625, 0.18298...	embed
73614548_c1	73614548	haskell	1	b \| ^ /var/tmp/demo/src/Lib.hs:23:17: error: • Couldn't match type ‘a0 -> a0’ with ‘Int’ Expected: Maybe Int Actual: Maybe (a0 -> a0) • In the second argument of ‘isJust'’, namely ‘c’ In a stmt of a 'do' block: isJust' "c" c In the expression: do let warn = tell . (: []) a = ... .... isJust' "a" a isJust' "b" b isJust...	b \| ^ /var/tmp/demo/src/Lib.hs:23:17: error: • Couldn't match type ‘a0 -> a0’ with ‘Int’ Expected: Maybe Int Actual: Maybe (a0 -> a0) • In the second argument of ‘isJust'’, namely ‘c’ In a stmt of a 'do' block: isJust' "c" c In the expression: do let warn = tell . (: []) a = ... .... isJust' "a" a isJust' "b" b isJust...	[ -0.011474609375, 0.00726318359375, -0.00177001953125, -0.006011962890625, 0.01458740234375, 0.021240234375, 0.00157928466796875, -0.00145721435546875, -0.0033416748046875, -0.00830078125, -0.009765625, -0.014892578125, 0.0023193359375, -0.01043701171875, 0.006103515625, -0.02392578125,...	[ 876, 1961, 2676, 80750, 19437, 104820, 127, 7, 24864, 22950, 18499, 191147, 18, 14858, 10644, 11, 2389, 33079, 10, 678, 4153, 60075, 13, 83425, 360, 100582, 77495, 17932, 10750, 164, 127794, 110987, 238, 6138, 39, 111, 246, 46389, 83, 501...	[ 0.05126953125, 0.054351806640625, 0.1326904296875, 0.2003173828125, 0.088134765625, 0.148193359375, 0.0821533203125, 0.03131103515625, 0.1021728515625, 0.1314697265625, 0.1563720703125, 0.1005859375, 0.087646484375, 0.19482421875, 0.2225341796875, 0.050048828125, 0.1148681640625, 0...	embed
46799237_c0	46799237	haskell	0	Title: How do I create a Storable instance for a recursive type? Problem title: How do I create a Storable instance for a recursive type? Tags: binding, ffi, storable, haskell, c Problem: How do I create a Storable instance for a recursive type? I have the following data type in a Haskell module and I would like to wri...	How do I create a Storable instance for a recursive type? How do I create a Storable instance for a recursive type? binding ffi storable haskell c How Storable MyType TypeDouble Double TypeLst TypeAdd How do I create a Storable instance for a recursive type? I have the following data type in a Haskell module and I woul...	[ -0.003662109375, 0.00141143798828125, -0.00119781494140625, 0.01312255859375, 0.0025787353515625, 0.0272216796875, 0.01336669921875, 0.00445556640625, 0.02294921875, -0.01007080078125, 0.000858306884765625, -0.034912109375, 0.003509521484375, -0.000457763671875, 0.00860595703125, 0.004...	[ 11249, 87, 28282, 23604, 2886, 110527, 100, 195625, 5844, 10644, 54, 10, 128239, 24500, 3082, 1556, 142508, 501, 2646, 196707, 60457, 34, 2661, 107172, 271, 4028, 25632, 2053, 20625, 88996, 1884, 33022, 23, 590, 329, 4527, 678, 313, 1829, ...	[ 0.075927734375, 0.005401611328125, 0.186767578125, 0.24951171875, 0.26123046875, 0.2978515625, 0.088134765625, 0.257080078125, 0.1829833984375, 0.236328125, 0.0244140625, 0.0550537109375, 0.1409912109375, 0.176513671875, 0.214111328125, 0.1260986328125, 0.2408447265625, 0.087951660...	embed
47367148_c0	47367148	haskell	0	Title: Haskell custom style instance show for Data type with list Problem title: Haskell custom style instance show for Data type with list Tags: haskell Problem: Haskell custom style instance show for Data type with list I'm trying to create a instance Show for my data type Family with the following structure: x y1 y2...	Haskell custom style instance show for Data type with list Haskell custom style instance show for Data type with list haskell Data.List Haskell Data Family Char Read Show Couldn Haskell custom style instance show for Data type with list I'm trying to create a instance Show for my data type Family with the following str...	[ -0.00433349609375, -0.01806640625, 0.0028076171875, 0.024658203125, -0.00921630859375, 0.00006198883056640625, 0.0216064453125, -0.00323486328125, 0.02099609375, 0.0167236328125, -0.010009765625, -0.0228271484375, 0.00970458984375, -0.01043701171875, -0.0140380859375, -0.00347900390625...	[ 20625, 142508, 114122, 20623, 110527, 7639, 100, 11809, 10644, 678, 5303, 1556, 154663, 59745, 21656, 4764, 17367, 191147, 19, 31577, 28282, 2053, 25632, 45646, 272, 1257, 903, 18499, 30022, 3871 ]	[ 0.1114501953125, 0.2056884765625, 0.165771484375, 0.2296142578125, 0.205322265625, 0.1865234375, 0.0400390625, 0.1373291015625, 0.1922607421875, 0.08349609375, 0.1944580078125, 0.09320068359375, 0.13037109375, 0.11279296875, 0.1854248046875, 0.1796875, 0.194580078125, 0.07611083984...	embed
47969861_c1	47969861	haskell	1	allCasesST 0 st 0 main = do putStrLn . show $ M.lookup 0 allCases return () The following are profiling results. 2,754,242,472 bytes allocated in the heap 2,095,063,056 bytes copied during GC 788,992,504 bytes maximum residency (23 sample(s)) 3,087,880 bytes maximum slop 815 MB total memory in use (0 MB lost due to fr...	allCasesST 0 st 0 main = do putStrLn . show $ M.lookup 0 allCases return () The following are profiling results. 2,754,242,472 bytes allocated in the heap 2,095,063,056 bytes copied during GC 788,992,504 bytes maximum residency (23 sample(s)) 3,087,880 bytes maximum slop 815 MB total memory in use (0 MB lost due to fr...	[ -0.005828857421875, -0.005615234375, -0.003143310546875, -0.01611328125, 0.0150146484375, -0.02001953125, 0.005340576171875, -0.004791259765625, 0.00592041015625, -0.044677734375, 0.0181884765625, 0.0147705078125, -0.0016326904296875, 0.0050048828125, 0.0296630859375, 0.00958251953125,...	[ 756, 20370, 5908, 8545, 757, 6138, 5201, 2203, 54, 3884, 71713, 866, 19, 6, 7639, 3650, 276, 64747, 2037, 30646, 16, 581, 25632, 621, 9468, 214, 50339, 5, 111877, 12338, 4, 2357, 304, 170544, 390, 1636, 144, 116292, 297, 23, 764, 2631...	[ 0.20654296875, 0.2305908203125, 0.1690673828125, 0.2191162109375, 0.109619140625, 0.085693359375, 0.1324462890625, 0.029693603515625, 0.036163330078125, 0.1553955078125, 0.11865234375, 0.0225982666015625, 0.047271728515625, 0.009429931640625, 0.120849609375, 0.0665283203125, 0.107543...	embed
69818263_c1	69818263	haskell	1	(runMigration migrateAll) pool pool runAction :: MoinadUnliftIO m => Db m a -> m a runAction action = runSqlPool action dbPool This one doesn't compile and I get the following error message: No instance for (Monad Pool) arising from a do statement In a stmt of a 'do' block: pool <- createSqlitPool dbFileName 5 Can som...	(runMigration migrateAll) pool pool runAction :: MoinadUnliftIO m => Db m a -> m a runAction action = runSqlPool action dbPool This one doesn't compile and I get the following error message: No instance for (Monad Pool) arising from a do statement In a stmt of a 'do' block: pool <- createSqlitPool dbFileName 5 Can som...	[ -0.00604248046875, 0.00634765625, -0.0191650390625, -0.0069580078125, -0.0027008056640625, 0.0162353515625, -0.006805419921875, -0.0283203125, 0.030517578125, -0.0269775390625, 0.01043701171875, -0.0093994140625, 0.00139617919921875, -0.008544921875, -0.0030517578125, 0.0137939453125, ...	[ 16428, 594, 872, 30494, 39666, 67, 43512, 19361, 11675, 284, 10763, 32129, 9169, 14256, 104501, 17780, 347, 275, 10, 22631, 99247, 7192, 929, 40041, 22027, 18, 9969, 1340, 25632, 18499, 26008, 438, 110527, 100, 46674, 712, 56718, 187, 72219...	[ 0.1246337890625, 0.05462646484375, 0.1405029296875, 0.060760498046875, 0.2071533203125, 0.157470703125, 0.148681640625, 0.211669921875, 0.117919921875, 0.1129150390625, 0.1453857421875, 0.11181640625, 0.1318359375, 0.050384521484375, 0.225830078125, 0.171875, 0.0970458984375, 0.017...	embed
70100714_c0	70100714	haskell	0	Title: How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? Problem title: How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? Tags: haskell Problem: How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? The following code type Bo...	How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? haskell the How LANGUAGE AllowAmbiguousTypes Board Position Char Could Game.hs:34:13-39 How to fix ambiguous type variables without enabling LANGUAGE Allo...	[ -0.000415802001953125, -0.00360107421875, -0.0027618408203125, 0.0126953125, 0.0203857421875, -0.0166015625, -0.004669189453125, 0.027587890625, 0.00347900390625, -0.006103515625, 0.00152587890625, -0.01171875, 0.01422119140625, 0.00127410888671875, -0.0113525390625, -0.0072021484375, ...	[ 11249, 30022, 920, 12282, 10821, 10644, 77336, 15490, 98064, 75930, 41566, 150567, 196707, 1556, 142508, 62554, 99428, 21656, 191147, 13547, 9323, 25632, 18151, 100, 19336, 6712, 20662, 76199, 18499, 31089, 4488, 154107, 8668, 22062, 4358 ]	[ 0.031005859375, 0.1705322265625, 0.1470947265625, 0.187744140625, 0.0562744140625, 0.1492919921875, 0.211669921875, 0.0885009765625, 0.1019287109375, 0.05706787109375, 0.0626220703125, 0.09771728515625, 0.1466064453125, 0.05157470703125, 0.1507568359375, 0.1353759765625, 0.1295166015...	embed
26370141_c0	26370141	haskell	0	Title: Type failure when using 'left' Lens from fclabels Problem title: Type failure when using 'left' Lens from fclabels Tags: haskell, lenses Problem: Type failure when using 'left' Lens from fclabels I've made a minimal example for testing out fclabels. Using a lens to retrieve a 'right' value fr...	Type failure when using 'left' Lens from fclabels Type failure when using 'left' Lens from fclabels haskell lenses fclabels Data.Label Data.Label.Base a Type Lens Label Right Will Label.hs:5:12 Control.Arrow.ArrowZero Data.Label.Point.Total Possible Failed Tested fclabels-2.0.2 Type failure when usi...	[ 0.00213623046875, -0.01043701171875, 0.0047607421875, -0.014404296875, -0.0205078125, -0.0113525390625, -0.003997802734375, -0.0067138671875, -0.00101470947265625, -0.0106201171875, 0.007781982421875, -0.01953125, -0.0010528564453125, -0.01336669921875, 0.0208740234375, -0.02197265625,...	[ 60457, 137578, 17368, 3768, 2480, 18226, 7, 1295, 140443, 152526, 1556, 142508, 96, 47754, 11809, 2729, 4063, 63473, 129214, 90911, 20255, 758, 20927, 27131, 7614, 15555, 1511, 4036, 147534, 115861, 190355, 8647, 133684, 133, 20187, 27781, 1342...	[ 0.1845703125, 0.2113037109375, 0.0718994140625, 0.02215576171875, 0.138427734375, 0.172607421875, 0.040374755859375, 0.06494140625, 0.10260009765625, 0.25830078125, 0.0855712890625, 0.1865234375, 0.0938720703125, 0.0814208984375, 0.043914794921875, 0.0147857666015625, 0.1778564453125...	embed
38905737_c0	38905737	haskell	0	Title: Why does function composition require parentheses? Problem title: Why does function composition require parentheses? Tags: haskell, function-composition, operator-precedence, syntax Problem: Why does function composition require parentheses? Let's say I want to compose Text.pack with Text.strip . :t (.) produces...	Why does function composition require parentheses? Why does function composition require parentheses? haskell function-composition operator-precedence syntax parentheses it Why Text.pack Text.strip Text strip.pack Couldn Relevant Possible Why does function composition require parentheses? Let's say I want to compose Te...	[ 0.01336669921875, -0.0047607421875, 0.01025390625, 0.042236328125, -0.0130615234375, 0.0164794921875, -0.0040283203125, -0.0009918212890625, -0.00823974609375, -0.0016326904296875, 0.01165771484375, 0.0013427734375, -0.0076904296875, -0.0012664794921875, 0.00921630859375, -0.0067443847...	[ 44084, 32354, 166577, 64209, 49129, 35412, 90, 1556, 142508, 277, 40322, 39933, 4692, 37534, 6002, 86531, 442, 24129, 29102, 59623, 43613, 191147, 133, 30624, 115861, 3444, 150350, 678, 18, 27489, 501, 174379, 23351, 161740, 100, 876, 13480, ...	[ 0.0911865234375, 0.1875, 0.2418212890625, 0.1434326171875, 0.16796875, 0.183349609375, 0.121337890625, 0.0933837890625, 0.2139892578125, 0.113525390625, 0.1160888671875, 0.12451171875, 0.02081298828125, 0.0777587890625, 0.03411865234375, 0.0576171875, 0.0745849609375, 0.18676757812...	embed
52475742_c0	52475742	haskell	0	Title: Why doesn't this simple composition work? Problem title: Why doesn't this simple composition work? Tags: monads, haskell, applicative Problem: Why doesn't this simple composition work? I was recently in need of putting head in between two monadic operations. Here's the SSCCE: module Main where f :: IO ...	Why doesn't this simple composition work? Why doesn't this simple composition work? monads haskell applicative Why Main Why doesn't this simple composition work? I was recently in need of putting head in between two monadic operations. Here's the SSCCE: This program is well-formed and compiles without warning...	[ -0.01708984375, 0.0023345947265625, -0.00341796875, 0.01251220703125, -0.005126953125, 0.0211181640625, 0.0011749267578125, 0.004241943359375, 0.000621795654296875, -0.0234375, 0.006072998046875, -0.01055908203125, 0, 0.031005859375, -0.005218505859375, -0.0262451171875, 0.0090942382...	[ 44084, 22027, 3768, 18, 903, 8781, 166577, 4488, 2667, 712, 7, 1556, 142508, 41816, 4935, 12321, 3871, 118620, 10336, 23, 17721, 6626, 11, 18403, 41018, 159, 14495, 10854, 1528, 5299, 5037, 9969, 1340, 15490, 1631, 4734, 1632, 11389, 111, ...	[ 0.1151123046875, 0.108154296875, 0.060028076171875, 0.1275634765625, 0.0963134765625, 0.1820068359375, 0.227783203125, 0.1580810546875, 0.1268310546875, 0.1478271484375, 0.074951171875, 0.1441650390625, 0.233642578125, 0.11474609375, 0.054473876953125, 0.0266265869140625, 0.040191650...	embed
42801417_c0	42801417	haskell	0	Title: Error parsing case expression Problem title: Error parsing case expression Tags: haskell Problem: Error parsing case expression I am getting this compile error: Files.hs:47:17: parse error on input ‘->’ Failed, modules loaded: none. In the following section of code: main :: IO () main = do args <- getArgs let f ...	Error parsing case expression Error parsing case expression haskell Error Files.hs:47:17 Failed Error parsing case expression I am getting this compile error: In the following section of code: While I understand the logic could use some tidying up, I do not see where I am going wrong with case syntax. I figure it might...	[ -0.00106048583984375, 0.003936767578125, -0.02734375, 0.004486083984375, -0.00396728515625, 0.02392578125, -0.005889892578125, -0.00194549560546875, 0.00384521484375, -0.01165771484375, -0.00168609619140625, 0.0074462890625, -0.0096435546875, -0.01495361328125, 0.0025482177734375, 0.00...	[ 212059, 366, 6953, 7225, 125195, 1556, 142508, 42724, 127, 33573, 22950, 190355, 20949, 903, 9969, 1340, 18499, 25632, 40059, 18151, 28219, 62775, 5809, 4527, 2936, 38543, 1257, 959, 1957, 7730, 44691, 6002, 86531, 26366, 13648, 179459, 182809,...	[ 0.178466796875, 0.1646728515625, 0.063232421875, 0.240966796875, 0.2197265625, 0.1083984375, 0.1904296875, 0.1207275390625, 0.05047607421875, 0.0877685546875, 0.12060546875, 0.13916015625, 0.0023193359375, 0.042022705078125, 0.1226806640625, 0.1480712890625, 0.1768798828125, 0.0419...	embed
47571696_c0	47571696	haskell	0	Title: how to use Special(reserved) characters in haskell? Problem title: how to use Special(reserved) characters in haskell? Tags: haskell, functional-programming Problem: how to use Special(reserved) characters in haskell? I am newbie to haskell.am trying to implement encryption for a given plain text to cipher.here ...	how to use Special(reserved) characters in haskell? how to use Special(reserved) characters in haskell? haskell functional-programming Special Char how to use Special(reserved) characters in haskell? I am newbie to haskell.am trying to implement encryption for a given plain text to cipher.here below is my sample code w...	[ 0.0016937255859375, -0.003936767578125, 0.0093994140625, -0.0235595703125, 0.000499725341796875, -0.0322265625, 0.0038909912109375, 0.002716064453125, -0.01129150390625, 0.03955078125, 0.0108642578125, -0.018798828125, 0.017333984375, 0.01556396484375, -0.0164794921875, 0.018798828125,...	[ 3642, 47, 4527, 25132, 2109, 56, 4126, 124850, 23, 1556, 142508, 123309, 28966, 21656, 132, 9014, 29479, 136791, 111719, 7986, 1059, 94266, 35064, 121413, 18151, 1608, 173247, 70541, 14012, 22, 678, 5361, 26582, 62816, 106, 91995, 41872, 7048...	[ 0.0849609375, 0.022064208984375, 0.148681640625, 0.220947265625, 0.08935546875, 0.1605224609375, 0.1297607421875, 0.226806640625, 0.08123779296875, 0.126953125, 0.216796875, 0.122802734375, 0.06787109375, 0.1522216796875, 0.008331298828125, 0.0599365234375, 0.0301513671875, 0.20068...	embed
24263721_c0	24263721	haskell	0	Title: Haskell, No instance for (Show ([String, Int)] -> Int Problem title: Haskell, No instance for (Show ([String, Int)] -> Int Tags: happy, haskell Problem: Haskell, No instance for (Show ([String, Int)] -> Int Trying to compile Haskell.Happy example here: http://www.haskell.org/happy/doc/html/sec-using.html#s...	Haskell, No instance for (Show ([String, Int)] -> Int Haskell, No instance for (Show ([String, Int)] -> Int happy haskell a Haskell Show Possible example.hs Haskell, No instance for (Show ([String, Int)] -> Int Trying to compile Haskell.Happy example here: http://www.haskell.org/happy/doc/html/sec-using.html#sec-...	[ -0.008056640625, 0.0036773681640625, 0.00081634521484375, -0.00311279296875, -0.0235595703125, 0.012451171875, 0.00823974609375, -0.0179443359375, 0.01220703125, -0.0048828125, -0.033203125, -0.01904296875, 0.00958251953125, -0.0002460479736328125, 0.009765625, -0.0174560546875, -0.0...	[ 20625, 142508, 438, 110527, 100, 168660, 71713, 214, 360, 18, 17723, 1556, 17367, 115861, 27781, 127, 40858, 9969, 1340, 184870, 10557, 157976, 7693, 39797, 223, 126340, 10135, 50986, 12663, 11435, 18499, 31577, 2831, 5974, 11675, 5885, 20594, ...	[ 0.1300048828125, 0.240966796875, 0.1385498046875, 0.2425537109375, 0.1365966796875, 0.1292724609375, 0.08642578125, 0.030548095703125, 0.07098388671875, 0.064453125, 0.2099609375, 0.100341796875, 0.1136474609375, 0.0251007080078125, 0.1846923828125, 0.086669921875, 0.01751708984375, ...	embed
49061589_c0	49061589	haskell	0	Title: GHCJS: How to use a JS library that is intended to be used with npm Problem title: GHCJS: How to use a JS library that is intended to be used with npm Tags: ghcjs, haskell, material-design, npm, reactjs Problem: GHCJS: How to use a JS library that is intended to be used with npm I'm using ghcjs-0.2.0.9006030_ghc...	GHCJS: How to use a JS library that is intended to be used with npm GHCJS: How to use a JS library that is intended to be used with npm ghcjs haskell material-design npm reactjs GHCJS How ghcjs-0.2.0.9006030_ghc-7.10.3 lts-6.30 index-dev.html GHCJS: How to use a JS library that is intended to be used with npm I'm using...	[ -0.0198974609375, 0.01092529296875, -0.00045013427734375, -0.005645751953125, 0.0034027099609375, 0.01544189453125, -0.01141357421875, 0.02001953125, 0.000060558319091796875, -0.0458984375, 0.01141357421875, -0.0595703125, -0.00141143798828125, -0.007598876953125, 0.002288818359375, 0....	[ 527, 73265, 64977, 11249, 4527, 35773, 1294, 450, 83, 179140, 186, 11814, 678, 25037, 39, 31380, 238, 28175, 1556, 142508, 4912, 34198, 131300, 133684, 5, 143161, 159343, 153808, 454, 9486, 16709, 10179, 363, 96, 933, 13545, 1197, 63262, 9,...	[ 0.1058349609375, 0.1844482421875, 0.2381591796875, 0.09637451171875, 0.1806640625, 0.2359619140625, 0.14599609375, 0.013031005859375, 0.00860595703125, 0.1815185546875, 0.0018310546875, 0.1436767578125, 0.1043701171875, 0.1644287109375, 0.16015625, 0.1246337890625, 0.092529296875, ...	embed
18685691_c0	18685691	haskell	0	Title: Haskell - List pattern matching on multiple parameters? (cannot construct the infinite type) Problem title: Haskell - List pattern matching on multiple parameters? (cannot construct the infinite type) Tags: list, pattern-matching, haskell Problem: Haskell - List pattern matching on multiple parameters? (cannot c...	Haskell - List pattern matching on multiple parameters? (cannot construct the infinite type) Haskell - List pattern matching on multiple parameters? (cannot construct the infinite type) list pattern-matching haskell Haskell List x:xs y:ys Occurs Haskell - List pattern matching on multiple parameters? (cannot construct ...	[ 0.0024566650390625, 0.00958251953125, -0.003875732421875, 0.006317138671875, -0.01068115234375, -0.000667572021484375, -0.000446319580078125, 0.00537109375, 0.0123291015625, -0.0004634857177734375, 0.035888671875, -0.033203125, 0.0081787109375, -0.006622314453125, 0.00390625, -0.001312...	[ 20625, 142508, 32036, 103510, 14858, 48716, 171859, 4398, 10869, 64549, 54241, 10644, 214, 5303, 98753, 1556, 1022, 425, 113, 4778, 180, 238, 48650, 98, 13, 63134, 17368, 61924, 50339, 12765, 53418, 808, 2389, 2203, 5646, 6626, 237, 32354, ...	[ 0.113037109375, 0.2344970703125, 0.18994140625, 0.2210693359375, 0.1929931640625, 0.15478515625, 0.1822509765625, 0.053466796875, 0.073486328125, 0.145751953125, 0.1351318359375, 0.171630859375, 0.049835205078125, 0.1846923828125, 0.156494140625, 0.0916748046875, 0.013824462890625, ...	embed
18691321_c0	18691321	haskell	0	Title: Printing a 2d array in haskell Problem title: Printing a 2d array in haskell Tags: ppm, arrays, printing, haskell Problem: Printing a 2d array in haskell I'm messing around with printing a random 2d array of Ints, in this simple image format (PPM) 0 1 0 0 1 1 0 0 1 0 0 1 1 0 0 0 1 1 1 0 0 0 0 1 0 Below is my cod...	Printing a 2d array in haskell Printing a 2d array in haskell ppm arrays printing haskell System.Random Data.Array.IArray Printing Array RandomGen make2dRange Printing a 2d array in haskell I'm messing around with printing a random 2d array of Ints, in this simple image format (PPM) Below is my code, which works, but s...	[ -0.0242919921875, -0.01470947265625, 0.00958251953125, 0.0208740234375, -0.0029449462890625, 0.0252685546875, 0.0084228515625, -0.0179443359375, -0.004180908203125, -0.0020599365234375, 0.0218505859375, 0.01202392578125, 0.010986328125, -0.00555419921875, -0.004669189453125, -0.0123291...	[ 39754, 214, 116, 71, 10298, 53, 23, 1556, 142508, 10, 32261, 39, 4778, 2448, 12353, 126525, 3815, 11809, 7614, 7092, 69253, 39643, 306, 105376, 3249, 304, 1052, 51459, 163, 38001, 10932, 1916, 96759, 360, 933, 8781, 29569, 9384, 17487, 59...	[ 0.196533203125, 0.012664794921875, 0.1375732421875, 0.1522216796875, 0.183349609375, 0.1595458984375, 0.03704833984375, 0.14794921875, 0.24755859375, 0.000335693359375, 0.1207275390625, 0.1392822265625, 0.032562255859375, 0.1607666015625, 0.0694580078125, 0.0284576416015625, 0.110961...	embed
2349922_c0	2349922	haskell	0	Title: Why does GHC infer type of `IO b` for an application of `hSetBuffering`? Problem title: Why does GHC infer type of `IO b` for an application of `hSetBuffering`? Tags: typeerror, haskell Problem: Why does GHC infer type of `IO b` for an application of `hSetBuffering`? I am trying to use hSetBuffering in a Haskell...	Why does GHC infer type of `IO b` for an application of `hSetBuffering`? Why does GHC infer type of `IO b` for an application of `hSetBuffering`? typeerror haskell IO Why GHC Ctlc NoBuffering ctlc.hs:8:10 Couldn Prelude Data.List Handle BufferMode Why does GHC infer type of `IO b` for an application of `hSetBuffering`?...	[ 0.00335693359375, -0.010498046875, 0.010009765625, 0.007171630859375, -0.01043701171875, 0.0189208984375, -0.01177978515625, -0.01385498046875, -0.01806640625, 0.02099609375, -0.003265380859375, -0.049560546875, 0, -0.0172119140625, -0.0034332275390625, -0.0159912109375, 0.0132446289...	[ 44084, 527, 73265, 53498, 10644, 17780, 876, 38415, 127, 294, 126, 7235, 18234, 214, 188800, 1556, 142508, 32838, 438, 1019, 15110, 191147, 19, 1914, 822, 11809, 154663, 10639, 133, 667, 9083, 1096, 20625, 1528, 305, 10179, 9790, 4552, 8781...	[ 0.0955810546875, 0.093505859375, 0.2152099609375, 0.20166015625, 0.17919921875, 0.185302734375, 0.191650390625, 0.1136474609375, 0.094482421875, 0.058837890625, 0.116943359375, 0.1129150390625, 0.131591796875, 0.039581298828125, 0.1790771484375, 0.07427978515625, 0.2054443359375, 0...	embed
67748174_c2	67748174	haskell	2	=/root/.stack/snapshots/x86_64-linux-tinfo6/08a30a38364a81e94295cf97609a35ddfc240f67779f06f0eb2ce22d8a89e805/8.10.4/doc/postgresql-libpq-0.9.4.3 --htmldir=/root/.stack/snapshots/x86_64-linux-tinfo6/08a30a38364a81e94295cf97609a35ddfc240f67779f06f0eb2ce22d8a89e805/8.10.4/doc/postgresql-libpq-0.9.4.3 --haddockdir=/root/.s...	=/root/.stack/snapshots/x86_64-linux-tinfo6/08a30a38364a81e94295cf97609a35ddfc240f67779f06f0eb2ce22d8a89e805/8.10.4/doc/postgresql-libpq-0.9.4.3 --htmldir=/root/.stack/snapshots/x86_64-linux-tinfo6/08a30a38364a81e94295cf97609a35ddfc240f67779f06f0eb2ce22d8a89e805/8.10.4/doc/postgresql-libpq-0.9.4.3 --haddockdir=/root/.s...	[ 0.0142822265625, 0.0152587890625, -0.00830078125, 0.0220947265625, 0.00095367431640625, -0.0033416748046875, -0.02587890625, -0.00823974609375, 0.00537109375, 0.006622314453125, 0.005706787109375, -0.041015625, 0.01055908203125, 0.00689697265625, -0.0267333984375, 0.005401611328125, ...	[ 2203, 64, 148920, 590, 2594, 10957, 72697, 15276, 13307, 2397, 6077, 7319, 910, 28974, 1197, 162982, 13556, 14889, 5843, 128205, 62635, 104656, 186035, 23538, 10179, 77212, 29713, 4594, 17562, 99247, 5612, 254, 864, 143161, 158406, 7693, 936, ...	[ 0.10791015625, 0.04071044921875, 0.1951904296875, 0.0994873046875, 0.1326904296875, 0.1182861328125, 0.18212890625, 0.197265625, 0.1727294921875, 0.09881591796875, 0.1317138671875, 0.1689453125, 0.082275390625, 0.1041259765625, 0.0784912109375, 0.065673828125, 0.0303802490234375, 0...	embed
54351314_c0	54351314	haskell	0	Title: How to Cache a Haskell Dependency to Speed Up Compilation Time? Problem title: How to Cache a Haskell Dependency to Speed Up Compilation Time? Tags: nix, haskell, haskell-stack Problem: How to Cache a Haskell Dependency to Speed Up Compilation Time? Problem: I'm working on a Haskell project that uses stack (+ ni...	How to Cache a Haskell Dependency to Speed Up Compilation Time? How to Cache a Haskell Dependency to Speed Up Compilation Time? nix haskell haskell-stack How Cache Haskell Dependency Speed Compilation Time stack.yaml godot-haskell-0.1.0.0 sha256:9d92ff27c7b6c6d2155286f04ba2c432f96460f448fd976654ef26a84f0e35a6 How to Ca...	[ 0.001007080078125, 0.0208740234375, 0.0142822265625, -0.0115966796875, -0.006988525390625, 0.00634765625, -0.0257568359375, -0.01043701171875, -0.0098876953125, -0.0322265625, -0.0166015625, -0.0220947265625, 0.016357421875, 0.022705078125, 0.00262451171875, 0.005859375, -0.018432617...	[ 11249, 47, 2041, 1430, 10, 20625, 142508, 262, 26885, 27771, 63349, 10091, 15612, 14, 57860, 19055, 300, 425, 1556, 590, 2594, 177261, 14520, 141, 2355, 818, 10557, 102014, 99929, 9638, 127892, 150230, 15649, 20697, 13452, 4527, 22183, 42548,...	[ 0.101806640625, 0.0638427734375, 0.216064453125, 0.234375, 0.05914306640625, 0.167724609375, 0.287353515625, 0.1199951171875, 0.197509765625, 0.120361328125, 0.16943359375, 0.1019287109375, 0.14208984375, 0.1094970703125, 0.023529052734375, 0.1246337890625, 0.1199951171875, 0.14880...	embed
56824404_c0	56824404	haskell	0	Title: Is there a way to generate a dhall schema from an haskell datatype? Problem title: Is there a way to generate a dhall schema from an haskell datatype? Tags: dhall, haskell Problem: Is there a way to generate a dhall schema from an haskell datatype? I'm trying to rewrite a BIG yaml configuration file used in Haks...	Is there a way to generate a dhall schema from an haskell datatype? Is there a way to generate a dhall schema from an haskell datatype? dhall haskell an Is there a way to generate a dhall schema from an haskell datatype? I'm trying to rewrite a BIG yaml configuration file used in Haksell applicationusing dhall. To do s...	[ 0.0084228515625, 0.0208740234375, 0.00213623046875, -0.006561279296875, -0.033935546875, 0.001983642578125, -0.01806640625, -0.00142669677734375, -0.0146484375, -0.0250244140625, -0.01519775390625, -0.004547119140625, 0.00408935546875, 0.0013885498046875, -0.005950927734375, 0.00138854...	[ 2071, 2685, 10, 3917, 139392, 104, 29907, 61903, 1295, 1556, 142508, 2053, 50986, 47, 142, 31577, 456, 434, 18781, 140836, 151, 7237, 180346, 11435, 11814, 23493, 93991, 38415, 1647, 1681, 188, 71, 144570, 97692, 45174, 10644, 3332, 34, 191...	[ 0.021697998046875, 0.02703857421875, 0.032135009765625, 0.1085205078125, 0.200439453125, 0.0994873046875, 0.257080078125, 0.259765625, 0.0914306640625, 0.1339111328125, 0.2386474609375, 0.10040283203125, 0.2279052734375, 0.00921630859375, 0.0174102783203125, 0.009429931640625, 0.0537...	embed
15708400_c1	15708400	haskell	1	0.14.2.0 projectroot/fay projectroot/fay-shared I also tried importing and re-exporting Model in SharedTypes.hs, but that produced the same error. Is there a way to do this? If not, why not? (I'm a relative noob in both Haskell and Yesod, so the answer to the "why not?" question would be really helpful.) EDIT: I just r...	0.14.2.0 projectroot/fay projectroot/fay-shared I also tried importing and re-exporting Model in SharedTypes.hs, but that produced the same error. Is there a way to do this? If not, why not? (I'm a relative noob in both Haskell and Yesod, so the answer to the "why not?" question would be really helpful.) EDIT: I just r...	[ -0.0029296875, 0.0267333984375, -0.01104736328125, -0.00537109375, -0.00872802734375, 0.01019287109375, 0.00323486328125, -0.00494384765625, -0.005767822265625, -0.05078125, 0.016357421875, -0.04052734375, -0.01080322265625, -0.000762939453125, -0.005950927734375, -0.0018463134765625, ...	[ 107754, 617, 73011, 13452, 148920, 1021, 53, 67886, 71, 37842, 24927, 214, 456, 180758, 13293, 23, 29790, 196707, 127, 5701, 18499, 3917, 15400, 3522, 20625, 142508, 32635, 2199, 3038, 959, 98893, 57309, 2581, 18, 34735, 31577, 3444, 19048, ...	[ 0.06256103515625, 0.1099853515625, 0.1258544921875, 0.08624267578125, 0.232421875, 0.16015625, 0.2308349609375, 0.176513671875, 0.0888671875, 0.0149383544921875, 0.1722412109375, 0.020904541015625, 0.076171875, 0.1702880859375, 0.237060546875, 0.001800537109375, 0.1793212890625, 0....	embed
22990312_c0	22990312	haskell	0	Title: Haskell MongoDB, can't fetch _id field Problem title: Haskell MongoDB, can't fetch _id field Tags: haskell, mongodb, yesod Problem: Haskell MongoDB, can't fetch _id field Messing about with Yesod and MongoDB. I'm using the MongoDB library directly, not using the Persistent library. I took this simple Y...	Haskell MongoDB, can't fetch _id field Haskell MongoDB, can't fetch _id field haskell mongodb yesod Haskell MongoDB _id Nothing file.txt Haskell MongoDB, can't fetch _id field Messing about with Yesod and MongoDB. I'm using the MongoDB library directly, not using the Persistent library. I took this simple Yes...	[ -0.00433349609375, -0.0038604736328125, 0.020751953125, 0.00433349609375, -0.01336669921875, 0.0299072265625, -0.0078125, -0.029052734375, -0.0036773681640625, -0.0291748046875, 0.040283203125, -0.00653076171875, -0.010986328125, -0.0238037109375, 0.020263671875, -0.006561279296875, ...	[ 20625, 142508, 7465, 519, 39463, 831, 3768, 18, 7647, 206, 101, 532, 44457, 1556, 2667, 7803, 275, 2422, 23722, 182747, 11435, 124326, 48205, 1672, 678, 32635, 2199, 136, 35773, 105237, 57309, 2581, 8781, 10723, 117176, 31577, 2046, 60525, ...	[ 0.10107421875, 0.2064208984375, 0.05999755859375, 0.155029296875, 0.2098388671875, 0.0731201171875, 0.034423828125, 0.06298828125, 0.169921875, 0.005615234375, 0.136962890625, 0.2232666015625, 0.219482421875, 0.0843505859375, 0.03643798828125, 0.04254150390625, 0.019989013671875, 0...	embed
9883791_c0	9883791	haskell	0	Title: Why is writeSTRef faster than if expression? Problem title: Why is writeSTRef faster than if expression? Tags: haskell Problem: Why is writeSTRef faster than if expression? writeSTRef twice for each iteration fib3 :: Int -> Integer fib3 n = runST $ do a <- newSTRef 1 b <- newSTRef 1 replicateM_ (n-1) $ do !a' <-...	Why is writeSTRef faster than if expression? Why is writeSTRef faster than if expression? haskell Why fib3 Integer replicateM_ n-1 fib4 Why is writeSTRef faster than if expression? writeSTRef twice for each iteration writeSTRef once for each iteration Benchmark, given n = 20000 : fib3 is a bit faster than fib4.	[ -0.019775390625, -0.00067901611328125, 0.00518798828125, -0.01226806640625, 0.008544921875, -0.018310546875, 0.003570556640625, -0.00665283203125, 0.002960205078125, 0.0179443359375, -0.008544921875, 0.034912109375, 0.00592041015625, 0.0198974609375, 0.027587890625, 0.01025390625, 0....	[ 44084, 83, 33022, 94539, 4240, 4271, 56, 3501, 2174, 125195, 1556, 142508, 809, 275, 363, 44401, 143126, 67, 594, 653, 5759, 617, 186351, 100, 12638, 17, 720, 24145, 3419, 206, 10015, 34475, 116, 28568, 10, 4785, 5 ]	[ 0.0982666015625, 0.039398193359375, 0.1781005859375, 0.1510009765625, 0.24365234375, 0.169189453125, 0.1419677734375, 0.045013427734375, 0.1876220703125, 0.2054443359375, 0.10345458984375, 0.2259521484375, 0.120361328125, 0.1243896484375, 0.1610107421875, 0.1644287109375, 0.189941406...	embed
29587201_c0	29587201	haskell	0	Title: Convert String to Int checking for overflow Problem title: Convert String to Int checking for overflow Tags: haskell, type-conversion Problem: Convert String to Int checking for overflow When I tried to convert a very long integer to Int , I was surprised that no error was thrown: Prelude> read "1234567890123456...	Convert String to Int checking for overflow Convert String to Int checking for overflow haskell type-conversion Convert Prelude Text.Read LANGUAGE ScopedTypeVariables Integral Bounded Maybe Integer Nothing Just Convert String to Int checking for overflow When I tried to convert a very long integer to Int , I was surpri...	[ -0.0262451171875, -0.01123046875, 0.0027008056640625, 0.0079345703125, -0.0062255859375, 0.0242919921875, 0.01068115234375, -0.033935546875, 0.0084228515625, 0.005584716796875, 0.0120849609375, -0.04150390625, -0.00836181640625, 0.00714111328125, 0.033447265625, -0.0169677734375, -0....	[ 1657, 11549, 23351, 214, 47, 360, 18, 175199, 100, 645, 118664, 1556, 142508, 10644, 2271, 46354, 1914, 822, 112, 24129, 31345, 98064, 182783, 196707, 81827, 204681, 335, 167457, 83425, 44401, 182747, 37842, 96760, 4552, 4989, 892, 1505, 1442...	[ 0.043426513671875, 0.160888671875, 0.199951171875, 0.114501953125, 0.1287841796875, 0.162353515625, 0.22314453125, 0.197265625, 0.054931640625, 0.12353515625, 0.263916015625, 0.10491943359375, 0.2193603515625, 0.1375732421875, 0.03997802734375, 0.1177978515625, 0.04388427734375, 0....	embed
54378041_c1	54378041	haskell	1	s. MonadReader (Env s) Comp where {} Full error message: Illegal instance declaration for ‘MonadReader (EvalEnv s) Evaluator’ The coverage condition fails in class ‘MonadReader’ for functional dependency: ‘m -> r’ Reason: lhs type ‘Evaluator’ does not determine rhs type ‘EvalEnv s’ Un-determined variable: s I understa...	s. MonadReader (Env s) Comp where {} Full error message: Illegal instance declaration for ‘MonadReader (EvalEnv s) Evaluator’ The coverage condition fails in class ‘MonadReader’ for functional dependency: ‘m -> r’ Reason: lhs type ‘Evaluator’ does not determine rhs type ‘EvalEnv s’ Un-determined variable: s I understa...	[ -0.02099609375, -0.000728607177734375, 0.01361083984375, -0.003997802734375, 0.0026397705078125, 0.007598876953125, 0.0279541015625, -0.02734375, -0.00836181640625, -0.021728515625, -0.00909423828125, 0.0303955078125, 0.01324462890625, 0.00250244140625, 0.0198974609375, -0.012329101562...	[ 91, 60331, 71, 31345, 56, 7768, 334, 15612, 7440, 9312, 18499, 26008, 891, 86966, 110527, 21635, 46674, 712, 1405, 151228, 1290, 154271, 35431, 35782, 18507, 123309, 42548, 27771, 39, 33079, 1690, 236267, 127, 10644, 647, 27494, 4597, 959, ...	[ 0.06707763671875, 0.169921875, 0.0986328125, 0.2376708984375, 0.1297607421875, 0.1275634765625, 0.1756591796875, 0.1988525390625, 0.0179901123046875, 0.0657958984375, 0.1485595703125, 0.036407470703125, 0.0699462890625, 0.1885986328125, 0.19873046875, 0.1365966796875, 0.1251220703125...	embed
57856241_c0	57856241	haskell	0	Title: Teletype IO getLine function Problem title: Teletype IO getLine function Tags: haskell, io Problem: Teletype IO getLine function I have this data type: data Teletype a = End a \| Get (Char -> Teletype a) \| Put Char (Teletype a) A value of this type can be used to describe programs that read and write characters a...	Teletype IO getLine function Teletype IO getLine function haskell io Teletype End Get Char Put Couldn Teletype IO getLine function I have this data type: A value of this type can be used to describe programs that read and write characters and return a final result of type a . Such a program can end immediately ( End )....	[ -0.004241943359375, -0.00616455078125, 0.0091552734375, 0.0142822265625, -0.007598876953125, -0.00347900390625, 0.033935546875, 0.007720947265625, -0.007232666015625, -0.01165771484375, 0.0093994140625, -0.01287841796875, -0.012939453125, 0.0045166015625, -0.00933837890625, 0.012695312...	[ 10142, 50986, 17780, 2046, 93232, 32354, 1556, 142508, 22995, 18878, 20779, 21656, 19577, 191147, 2053, 10644, 34292, 11814, 98363, 103391, 12301, 33022, 124850, 30646, 2704, 16750, 10, 62771, 1528, 831, 3564, 109312, 62816, 10588, 151552, 96819,...	[ 0.1492919921875, 0.25341796875, 0.2200927734375, 0.1551513671875, 0.28369140625, 0.1800537109375, 0.1016845703125, 0.1943359375, 0.17041015625, 0.16064453125, 0.1328125, 0.1641845703125, 0.1392822265625, 0.0888671875, 0.0791015625, 0.126953125, 0.1455078125, 0.053985595703125, 0....	embed
59614582_c0	59614582	haskell	0	Title: calculate function return type for a given input type Problem title: calculate function return type for a given input type Tags: haskell Problem: calculate function return type for a given input type In Haskell, I would like to calculate the return type for a given function given a parameter type. So for e.g. a ...	calculate function return type for a given input type calculate function return type for a given input type haskell Test.QuickCheck Data.Typeable Bool XScopedTypeVariables calculate function return type for a given input type In Haskell, I would like to calculate the return type for a given function given a parameter t...	[ 0.005126953125, -0.00191497802734375, -0.017578125, 0.00823974609375, -0.0001659393310546875, -0.00909423828125, -0.0003337860107421875, -0.0208740234375, 0.003204345703125, -0.0306396484375, -0.013916015625, -0.0322265625, -0.0230712890625, -0.005340576171875, 0.00994873046875, -0.015...	[ 74481, 67, 32354, 30646, 10644, 100, 34475, 107730, 1556, 142508, 8647, 96010, 202567, 11809, 196707, 2886, 2460, 929, 112720, 587, 20051, 81827, 14, 20625, 1884, 171859, 138256, 10, 33079, 136, 2046, 43240, 34648, 101426, 71924, 12319, 645, ...	[ 0.2181396484375, 0.05596923828125, 0.1790771484375, 0.28857421875, 0.234130859375, 0.0545654296875, 0.111328125, 0.1715087890625, 0.0963134765625, 0.2132568359375, 0.058990478515625, 0.00482177734375, 0.1270751953125, 0.0311279296875, 0.1510009765625, 0.10406494140625, 0.093139648437...	embed
26239232_c0	26239232	haskell	0	Title: Faulty base-case Haskell Problem title: Faulty base-case Haskell Tags: haskell, design-patterns Problem: Faulty base-case Haskell My functions: type Block = [Maybe Int] checkBlock' :: Block -> Block checkBlock' (r:rs) \| r == [] = [] \| isJust r == True = r:checkBlock' rs \| isNothing r == True = checkBlock' rs che...	Faulty base-case Haskell Faulty base-case Haskell haskell design-patterns Faulty Haskell Block Maybe r:rs r:checkBlock Sudoku.hs:104:12 Couldn Failed Faulty base-case Haskell My functions: I want to first function to inspect a list of Just Ints and Nothings, and return only the Just values. And the second function to r...	[ -0.0033416748046875, 0.00604248046875, 0.00081634521484375, -0.01446533203125, 0.008056640625, 0.00958251953125, -0.004058837890625, -0.006195068359375, 0.0118408203125, 0.0084228515625, 0.01458740234375, 0.0011444091796875, 0.0031890869140625, -0.00946044921875, -0.02099609375, 0.0048...	[ 3036, 202, 939, 3647, 58437, 20625, 142508, 1556, 4331, 4453, 22766, 80231, 83425, 1690, 4295, 78292, 166191, 15334, 38067, 66947, 20927, 191147, 190355, 297, 32354, 3444, 5117, 134071, 5303, 9563, 360, 933, 136, 182747, 30646, 4734, 142424, ...	[ 0.07867431640625, 0.113037109375, 0.1134033203125, 0.197021484375, 0.247314453125, 0.1400146484375, 0.233642578125, 0.1141357421875, 0.148193359375, 0.06036376953125, 0.052398681640625, 0.167724609375, 0.0347900390625, 0.146240234375, 0.11376953125, 0.1513671875, 0.1912841796875, 0...	embed
38405937_c1	38405937	haskell	1	Ident (Range) \|--HsCon \|--HsUnQual \|--HsIdent (BoundaryBelowAll) \|--HsParen \|--HsApp \|--HsCon \|--HsUnQual \|--HsIdent (BoundaryAbove) \|--HsVar \|--HsUnQual \|--HsIdent (n) So the issue here is that there is no location information on most of the nodes, so it sees the function definition ( HsMatch ) as a single line. In ca...	Ident (Range) \|--HsCon \|--HsUnQual \|--HsIdent (BoundaryBelowAll) \|--HsParen \|--HsApp \|--HsCon \|--HsUnQual \|--HsIdent (BoundaryAbove) \|--HsVar \|--HsUnQual \|--HsIdent (n) So the issue here is that there is no location information on most of the nodes, so it sees the function definition ( HsMatch ) as a single line. In ca...	[ -0.016845703125, 0.00860595703125, -0.0023651123046875, -0.0081787109375, 0.0054931640625, 0.0133056640625, -0.0107421875, -0.01507568359375, 0.00762939453125, -0.0087890625, -0.01019287109375, -0.0042724609375, 0.01300048828125, -0.020751953125, 0.00946044921875, 0.00579833984375, 0...	[ 71257, 1052, 51459, 841, 7, 11935, 14256, 178476, 568, 37379, 12647, 122385, 6766, 17336, 43512, 28636, 33, 39179, 24988, 8206, 81827, 31089, 110, 31913, 4677, 2684, 988, 40, 32354, 80934, 572, 79520, 206, 11001, 13315, 119488, 581, 33636, ...	[ 0.279296875, 0.1077880859375, 0.1722412109375, 0.1246337890625, 0.142333984375, 0.1954345703125, 0.07611083984375, 0.173828125, 0.1204833984375, 0.2213134765625, 0.002105712890625, 0.1500244140625, 0.02606201171875, 0.20068359375, 0.16455078125, 0.0731201171875, 0.09228515625, 0.13...	embed
28595221_c1	28595221	haskell	1	.Client.Dependency.Modular.PSQ ( Distribution\C lient\Dependency\Modular\PSQ.hs, dist\build\cabal\cabal-tmp\Distribution\Client\ Dependency\Modular\PSQ.o ) ... ... C:\Users\Alberto\AppData\Roaming\cabal\x86_64-windows-ghc-7.8.3\HTTP-4000.2.19/l ibHSHTTP-4000.2.19.a(TCP.o):fake:(.text+0x44d6): undefined reference to `sh...	.Client.Dependency.Modular.PSQ ( Distribution\C lient\Dependency\Modular\PSQ.hs, dist\build\cabal\cabal-tmp\Distribution\Client\ Dependency\Modular\PSQ.o ) ... ... C:\Users\Alberto\AppData\Roaming\cabal\x86_64-windows-ghc-7.8.3\HTTP-4000.2.19/l ibHSHTTP-4000.2.19.a(TCP.o):fake:(.text+0x44d6): undefined reference to `sh...	[ 0.0047607421875, 0.0155029296875, 0.0076904296875, -0.00787353515625, 0.009521484375, -0.00921630859375, -0.0216064453125, -0.0087890625, -0.007110595703125, -0.007049560546875, 0.013671875, -0.01080322265625, 0.00384521484375, -0.006378173828125, 0.00518798828125, -0.008056640625, -...	[ 150, 2517, 4657, 26885, 27771, 91616, 35975, 9059, 2737, 75571, 52739, 127, 45, 271, 177149, 408, 3571, 2676, 179236, 262, 31, 313, 1062, 6210, 66518, 39179, 137989, 12724, 302, 15276, 13307, 229792, 9486, 238, 176391, 18544, 83754, 133684, ...	[ 0.10125732421875, 0.07647705078125, 0.10003662109375, 0.2166748046875, 0.048858642578125, 0.1094970703125, 0.159423828125, 0.1531982421875, 0.2327880859375, 0.1810302734375, 0.0694580078125, 0.054473876953125, 0.00830078125, 0.06689453125, 0.1275634765625, 0.10888671875, 0.2416992187...	embed
41939715_c0	41939715	haskell	0	Title: Can I easily wrap attoparsec in transformer? Problem title: Can I easily wrap attoparsec in transformer? Tags: monad-transformers, attoparsec, parser-combinators, megaparsec, haskell Problem: Can I easily wrap attoparsec in transformer? I want to write code doing something like C preprocessing. So I looked for l...	Can I easily wrap attoparsec in transformer? Can I easily wrap attoparsec in transformer? monad-transformers attoparsec parser-combinators megaparsec haskell Can Parser StateT Can I easily wrap attoparsec in transformer? I want to write code doing something like C preprocessing. So I looked for libraries and got two ca...	[ -0.02685546875, 0.0159912109375, 0.00531005859375, 0.0189208984375, 0.0032501220703125, -0.00909423828125, -0.00194549560546875, -0.0272216796875, 0.0040283203125, -0.025634765625, 0.0191650390625, 0.0186767578125, 0.00860595703125, 0.01263427734375, 0.012451171875, -0.0172119140625, ...	[ 4171, 72546, 137565, 243, 31, 2500, 39797, 23, 27198, 56, 87, 2667, 712, 215175, 1314, 366, 2189, 19155, 22230, 31534, 1556, 142508, 2392, 22836, 618, 3444, 33022, 18151, 1884, 313, 479, 63923, 35773, 6626, 25469, 3871, 60213, 13416, 18499,...	[ 0.0906982421875, 0.1988525390625, 0.27001953125, 0.177978515625, 0.1807861328125, 0.1708984375, 0.2490234375, 0.103515625, 0.2255859375, 0.1661376953125, 0.017669677734375, 0.0977783203125, 0.150634765625, 0.20458984375, 0.04644775390625, 0.0728759765625, 0.1817626953125, 0.1010742...	embed
8935082_c0	8935082	haskell	0	Title: Compile multi .hs files of Haskell - Unix Problem title: Compile multi .hs files of Haskell - Unix Tags: ghci, unix, haskell, ghc Problem: Compile multi .hs files of Haskell - Unix I created some files from a project in Unix, they are a lot and if I want to execute it in another pc or folder I need to copy all f...	Compile multi .hs files of Haskell - Unix Compile multi .hs files of Haskell - Unix ghci unix haskell ghc Compile Haskell Unix main.hs ex1.hs ex2.lhs ex1.lhs LaTeX pic.jpg package.sty MAIN Failed Compile multi .hs files of Haskell - Unix I created some files from a project in Unix, they are a lot and if I want to execu...	[ -0.01470947265625, 0.00909423828125, -0.01348876953125, 0.01556396484375, -0.01055908203125, 0.0059814453125, 0.0042724609375, -0.001434326171875, -0.00982666015625, -0.018798828125, -0.01446533203125, -0.0091552734375, 0.0223388671875, 0.016357421875, -0.0218505859375, 0.0015716552734...	[ 15612, 1340, 6024, 5, 127, 7, 102158, 111, 20625, 142508, 992, 4084, 31380, 318, 51, 1556, 238, 5201, 1119, 418, 5442, 79366, 10476, 1542, 8834, 25687, 98169, 8946, 48026, 190355, 75935, 1295, 13452, 23, 5915, 71924, 15700, 36719, 78303, ...	[ 0.1417236328125, 0.1138916015625, 0.17333984375, 0.00335693359375, 0.147216796875, 0.0897216796875, 0.16845703125, 0.03363037109375, 0.1458740234375, 0.2578125, 0.0849609375, 0.1162109375, 0.110107421875, 0.0819091796875, 0.05169677734375, 0.1270751953125, 0.0633544921875, 0.075073...	embed
30408500_c0	30408500	haskell	0	Title: hGetLine from /dev/pty/N? Problem title: hGetLine from /dev/pty/N? Tags: terminal, pty, haskell, filehandle Problem: hGetLine from /dev/pty/N? I'm trying to read from a pseudoterminal. My eventual goal is to hook up input/output from the pseudoterminal to reactive-banana events, but right now I'm just trying to ...	hGetLine from /dev/pty/N? hGetLine from /dev/pty/N? terminal pty haskell filehandle /dev/pty/N System.Posix.Terminal System.Posix.IO hGetLine from /dev/pty/N? I'm trying to read from a pseudoterminal. My eventual goal is to hook up input/output from the pseudoterminal to reactive-banana events, but right now I'm just t...	[ -0.01239013671875, 0.02001953125, 0.0023193359375, -0.0004482269287109375, -0.002960205078125, -0.01043701171875, 0.03515625, -0.021240234375, -0.0098876953125, -0.0263671875, 0.0172119140625, -0.016357421875, -0.015380859375, 0.006256103515625, -0.019775390625, 0.0081787109375, 0.02...	[ 1096, 724, 126, 93232, 1295, 248, 18548, 254, 939, 839, 33949, 915, 1556, 142508, 11435, 79628, 12353, 7192, 4084, 35484, 1249, 7, 17780, 31577, 12301, 74189, 30524, 289, 57693, 69236, 150522, 107730, 6056, 71232, 105281, 11, 47353, 20625, ...	[ 0.1103515625, 0.138427734375, 0.163330078125, 0.255126953125, 0.113037109375, 0.044586181640625, 0.245849609375, 0.050933837890625, 0.1842041015625, 0.151611328125, 0.2105712890625, 0.04010009765625, 0.10272216796875, 0.2054443359375, 0.0723876953125, 0.1590576171875, 0.0606689453125...	embed
33053124_c1	33053124	haskell	1	version 4.7.0.1 found - SnapFull requires >=3.7.6 && <3.8 snap-loader-dynamic not found - SnapFull requires ==0.10.* snap-loader-static not found - SnapFull requires >=0.9 && <0.10 Checking against build plan lts-3.8 * Build plan did not match your requirements: base version 4.8.1.0 found - SnapFull requires >=4 && <4...	version 4.7.0.1 found - SnapFull requires >=3.7.6 && <3.8 snap-loader-dynamic not found - SnapFull requires ==0.10.* snap-loader-static not found - SnapFull requires >=0.9 && <0.10 Checking against build plan lts-3.8 * Build plan did not match your requirements: base version 4.8.1.0 found - SnapFull requires >=4 && <4...	[ -0.0283203125, 0.02392578125, 0.001434326171875, -0.0003204345703125, -0.033447265625, 0.00555419921875, -0.019287109375, -0.0059814453125, 0.0029449462890625, 0.04248046875, -0.0177001953125, -0.0252685546875, -0.0140380859375, -0.0224609375, 0.0096435546875, 0.01513671875, 0.014160...	[ 11389, 201, 53489, 102014, 14037, 121190, 121962, 144570, 977, 76067, 5, 180347, 135527, 76685, 63033, 56, 242554, 959, 145407, 10179, 201939, 143161, 963, 38679, 26548, 45367, 1774, 96, 933, 6, 121137, 6777, 14858, 96679, 3647, 52196, 102107, ...	[ 0.1669921875, 0.1273193359375, 0.165283203125, 0.2130126953125, 0.13330078125, 0.2462158203125, 0.297119140625, 0.2098388671875, 0.0246734619140625, 0.100830078125, 0.048736572265625, 0.1993408203125, 0.2264404296875, 0.227783203125, 0.207763671875, 0.0771484375, 0.195068359375, 0....	embed
56033182_c1	56033182	haskell	1	-N1 -p -RTS total time = 1.20 secs (1200 ticks @ 1000 us, 1 processor) total alloc = 1,936,132,144 bytes (excludes profiling overheads) COST CENTRE MODULE SRC %time %alloc forceEval Main par.hs:28:1-57 75.8 60.3 runMap Main par.hs:31:1-59 17.5 19.0 parmap' Main par.hs:(6,1)-(12,56) 3.2 14.9 parmap'.half1 Main par.hs:8...	-N1 -p -RTS total time = 1.20 secs (1200 ticks @ 1000 us, 1 processor) total alloc = 1,936,132,144 bytes (excludes profiling overheads) COST CENTRE MODULE SRC %time %alloc forceEval Main par.hs:28:1-57 75.8 60.3 runMap Main par.hs:31:1-59 17.5 19.0 parmap' Main par.hs:(6,1)-(12,56) 3.2 14.9 parmap'.half1 Main par.hs:8...	[ 0.0033416748046875, 0.011474609375, 0.01275634765625, -0.005828857421875, -0.004791259765625, 0.00787353515625, -0.00921630859375, -0.00811767578125, 0.01043701171875, -0.017333984375, -0.007110595703125, 0.00299072265625, 0.02685546875, -0.00122833251953125, -0.0050048828125, 0.002029...	[ 20, 839, 418, 254, 20503, 294, 3622, 1733, 2203, 615, 1549, 19216, 7, 96740, 1053, 22824, 1374, 4382, 1821, 106, 14543, 42, 16, 756, 6652, 108933, 8659, 136124, 131663, 390, 1636, 158928, 34, 988, 9468, 214, 645, 31251, 313, 34274, 8985...	[ 0.08172607421875, 0.1689453125, 0.1552734375, 0.1593017578125, 0.1741943359375, 0.1783447265625, 0.1693115234375, 0.24951171875, 0.042327880859375, 0.04095458984375, 0.161865234375, 0.2137451171875, 0.028961181640625, 0.1304931640625, 0.14013671875, 0.1126708984375, 0.041290283203125...	embed
24900932_c1	24900932	haskell	1	1.4.2 ... linking ... done. Loading package vector-0.10.11.0 ... linking ... done. Loading package mwc-random-0.13.1.2 ... linking ... done. Loading package monads-tf-0.1.0.2 ... linking ... done. Loading package filepath-1.3.0.2 ... linking ... done. Loading package byteable-0.1.1 ... linking ... done. Loading package...	1.4.2 ... linking ... done. Loading package vector-0.10.11.0 ... linking ... done. Loading package mwc-random-0.13.1.2 ... linking ... done. Loading package monads-tf-0.1.0.2 ... linking ... done. Loading package filepath-1.3.0.2 ... linking ... done. Loading package byteable-0.1.1 ... linking ... done. Loading package...	[ -0.01409912109375, -0.01141357421875, -0.01470947265625, 0.0059814453125, 0.013916015625, 0.00885009765625, 0.00860595703125, -0.0218505859375, -0.00185394287109375, -0.0244140625, -0.023681640625, -0.0303955078125, -0.0169677734375, -0.00689697265625, -0.00469970703125, -0.00787353515...	[ 615, 117904, 153, 3126, 214, 16940, 228006, 98169, 173, 18770, 23320, 10179, 418, 102107, 43879, 238, 46258, 2681, 48400, 2667, 712, 7, 420, 102014, 133684, 11435, 128405, 81046, 390, 67, 2886, 83783, 215637, 126234, 122336, 116419, 93645, 15...	[ 0.12890625, 0.26806640625, 0.07806396484375, 0.177734375, 0.1068115234375, 0.1297607421875, 0.2066650390625, 0.21728515625, 0.19384765625, 0.19384765625, 0.03857421875, 0.1490478515625, 0.036834716796875, 0.1103515625, 0.0921630859375, 0.093505859375, 0.163818359375, 0.105590820312...	embed
20893588_c0	20893588	haskell	0	Title: Starting Yesod without environment flag using mod_fastcgi Problem title: Starting Yesod without environment flag using mod_fastcgi Tags: yesod, haskell, fastcgi Problem: Starting Yesod without environment flag using mod_fastcgi To launch my Yesod application I need to provide an application environment argument ...	Starting Yesod without environment flag using mod_fastcgi Starting Yesod without environment flag using mod_fastcgi yesod haskell fastcgi mod_fastcgi Prelude Yesod.Default.Config Yesod.Default.Main Settings Application Network.Wai.Handler.FastCGI Starting Yesod Starting Yesod without environment flag using mod_fastcgi ...	[ -0.0177001953125, 0.0233154296875, -0.01031494140625, 0.000141143798828125, -0.01129150390625, 0.009033203125, -0.00848388671875, -0.0245361328125, -0.0162353515625, -0.007476806640625, 0.002685546875, 0.0027923583984375, -0.021484375, 0.0081787109375, -0.0004711151123046875, -0.033203...	[ 13794, 214, 32635, 2199, 15490, 65998, 49938, 17368, 2811, 39473, 238, 735, 2422, 23722, 1556, 142508, 4271, 1914, 822, 187423, 11, 83671, 168793, 105548, 104921, 22489, 135679, 919, 4438, 18027, 83184, 38415, 22691, 10750, 1176, 91480, 39179, ...	[ 0.1563720703125, 0.010101318359375, 0.1900634765625, 0.287841796875, 0.1124267578125, 0.2083740234375, 0.1607666015625, 0.1029052734375, 0.1553955078125, 0.130859375, 0.040618896484375, 0.201904296875, 0.111083984375, 0.1904296875, 0.0733642578125, 0.1607666015625, 0.1064453125, 0....	embed
7139263_c1	7139263	haskell	1	0-18deac99a132f04751d862b77aab136e -package-id deepseq-1.1.0.2-09b3aed0c4982bbc6569c668100876fa -O -Wall -XHaskell98 -XCPP Data.Attoparsec Data.Attoparsec.Char8 Data.Attoparsec.Combinator Data.Attoparsec.FastSet Data.Attoparsec.Lazy Data.Attoparsec.Number Data.Attoparsec.Zepto Data.Attoparsec.Internal Data.Attoparsec.I...	6e81708f93cae7d0 parsec-3.1.1-5671ee15550b9e1b29f6da36f7643854 text-0.11.0.6-7812e10747897216f9b707186c779855 transformers-0.2.2.0-a8a2dbba7d96131db605cf631ea0c8c4 zlib-0.5.3.1-5fbdf714525b76e0e601c2ffb25f2044 Cabal cabal install ... failing - osx - many unsatisfied packages Update: Running ghc-pkg check reported: and ...	[ 0.0128173828125, -0.00006198883056640625, 0.00933837890625, 0.0103759765625, 0.018798828125, 0.004791259765625, -0.0169677734375, -0.021484375, 0.0113525390625, 0.0238037109375, -0.01123046875, -0.037109375, 0.0012054443359375, 0.02880859375, 0.00095367431640625, -0.000820159912109375,...	[ 305, 13556, 188734, 11591, 366, 39797, 83783, 162082, 90393, 8659, 156204, 7986, 14556, 122887, 136462, 27198, 1314, 133684, 73011, 45391, 67466, 97, 5612, 93645, 12465, 30438, 289, 109524, 20600, 35782, 214, 362, 425, 5941, 2234, 50958, 1029, ...	[ 0.05572509765625, 0.011688232421875, 0.07000732421875, 0.06646728515625, 0.09521484375, 0.1761474609375, 0.1080322265625, 0.07763671875, 0.0170440673828125, 0.00628662109375, 0.0445556640625, 0.10565185546875, 0.022857666015625, 0.0155181884765625, 0.051055908203125, 0.21630859375, 0...	embed
45695566_c0	45695566	haskell	0	Title: How to convert Dynamic to Forall something Problem title: How to convert Dynamic to Forall something Tags: haskell Problem: How to convert Dynamic to Forall something I have a cache with Dynamic values. Some of them have the type Delayed a . Normally when I access the cache, I know the type a , so it's not a pro...	How to convert Dynamic to Forall something How to convert Dynamic to Forall something haskell How Dynamic Forall Delayed Maybe Delay MVar Bool Async How to convert Dynamic to Forall something I have a cache with Dynamic values. Some of them have the type Delayed a . Normally when I access the cache, I know the type a ,...	[ 0.0233154296875, -0.00885009765625, 0.0186767578125, -0.01336669921875, 0.00457763671875, -0.0113525390625, 0.0001373291015625, -0.0115966796875, 0.010009765625, -0.0284423828125, -0.00994873046875, -0.0096435546875, -0.00168609619140625, 0.0037689208984375, 0.002716064453125, -0.00741...	[ 11249, 96760, 73327, 21068, 47, 1326, 5584, 9844, 1556, 142508, 262, 5259, 297, 83425, 66160, 147, 2460, 929, 12654, 82365, 142424, 10644, 10, 17203, 3714, 1295, 29673, 37702, 11782, 32354, 3871, 23937, 5303, 55300, 53017, 17780, 3917, 2046, ...	[ 0.055389404296875, 0.193603515625, 0.1962890625, 0.2122802734375, 0.127197265625, 0.1400146484375, 0.2406005859375, 0.150390625, 0.0946044921875, 0.19580078125, 0.122314453125, 0.2247314453125, 0.125732421875, 0.2216796875, 0.04559326171875, 0.1334228515625, 0.030242919921875, 0.12...	embed
9675294_c0	9675294	haskell	0	Title: How can I tell cabal to specify a dependency for one of my program's dependencies? Problem title: How can I tell cabal to specify a dependency for one of my program's dependencies? Tags: cabal, constraints, haskell Problem: How can I tell cabal to specify a dependency for one of my program's dependenci...	How can I tell cabal to specify a dependency for one of my program's dependencies? How can I tell cabal to specify a dependency for one of my program's dependencies? cabal constraints haskell How Build-depends template-haskell-2.5.0.0 How can I tell cabal to specify a dependency for one of my program's depend...	[ 0.007659912109375, 0.0103759765625, 0.00994873046875, 0.006744384765625, 0.0047607421875, 0.006622314453125, -0.0203857421875, 0.0108642578125, 0.0118408203125, -0.01287841796875, 0.007659912109375, -0.037353515625, -0.0019989013671875, 0.00848388671875, 0.00189971923828125, 0.01007080...	[ 11249, 831, 14192, 109524, 47, 40140, 18929, 42548, 27771, 100, 1528, 3768, 117538, 759, 158, 2816, 4288, 1556, 142508, 121137, 105254, 110934, 10557, 48413, 99929, 1632, 30438, 289, 4527, 98169, 19437, 35273, 6626, 787, 966, 23742, 18, 45367...	[ 0.056488037109375, 0.05242919921875, 0.1695556640625, 0.26708984375, 0.03802490234375, 0.1781005859375, 0.09600830078125, 0.228271484375, 0.13525390625, 0.05047607421875, 0.1419677734375, 0.0253753662109375, 0.1243896484375, 0.030120849609375, 0.02850341796875, 0.1373291015625, 0.052...	embed
31435668_c1	31435668	haskell	1	types. For example, in GHCi: Main> let x = Zn 5 3 Main> x (3 mod 5) Main> let y = Zn 5 7 (2 mod 5) Main> let z = x + y *Main> z <interactive>:6:1: No instance for (Integral a0) arising from a use of ‘print’ The type variable ‘a0’ is ambiguous Note: there are several potential instances: instance Integral GHC.Int.I...	types. For example, in GHCi: Main> let x = Zn 5 3 Main> x (3 mod 5) Main> let y = Zn 5 7 (2 mod 5) Main> let z = x + y *Main> z <interactive>:6:1: No instance for (Integral a0) arising from a use of ‘print’ The type variable ‘a0’ is ambiguous Note: there are several potential instances: instance Integral GHC.Int.I...	[ -0.02978515625, 0.002777099609375, -0.000030994415283203125, 0.01300048828125, -0.0032958984375, -0.002044677734375, 0.0167236328125, -0.005096435546875, 0.00439453125, -0.02392578125, -0.01104736328125, -0.01129150390625, 0.010986328125, -0.00009632110595703125, 0.00445556640625, 0.01...	[ 52895, 527, 73265, 14, 168793, 2633, 1022, 567, 19, 190, 138, 6896, 2811, 21162, 113, 361, 97, 997, 10433, 71232, 910, 19721, 438, 110527, 67, 5739, 10, 77495, 187, 72219, 4527, 35662, 10644, 77336, 11, 2389, 920, 12282, 10821, 38516, 2...	[ 0.27294921875, 0.1021728515625, 0.205322265625, 0.1917724609375, 0.1256103515625, 0.101806640625, 0.0679931640625, 0.06732177734375, 0.06646728515625, 0.10028076171875, 0.0826416015625, 0.01690673828125, 0.1348876953125, 0.072998046875, 0.0623779296875, 0.0243682861328125, 0.08740234...	embed
33723097_c0	33723097	haskell	0	Title: Random numbers in haskell. And shuffling a list Problem title: Random numbers in haskell. And shuffling a list Tags: haskell, numbers, random Problem: Random numbers in haskell. And shuffling a list i am trying to write a function that when given a list would return a lsit in random order. this is how i thought ...	Random numbers in haskell. And shuffling a list Random numbers in haskell. And shuffling a list haskell numbers random Random Random numbers in haskell. And shuffling a list i am trying to write a function that when given a list would return a lsit in random order. this is how i thought of doing it(the list is of lengt...	[ -0.0206298828125, 0.01904296875, 0.0240478515625, -0.0103759765625, 0.0223388671875, 0.0184326171875, -0.0120849609375, -0.018310546875, 0.00787353515625, -0.0252685546875, 0.0072021484375, 0.00811767578125, -0.008544921875, 0.0225830078125, 0.0191650390625, -0.0152587890625, 0.00067...	[ 39643, 306, 101935, 23, 1556, 142508, 3493, 8633, 4902, 2069, 5303, 96759, 31577, 33022, 32354, 3229, 34475, 30646, 6084, 12989, 17569, 140909, 7221, 139392, 14012, 17721, 106, 5646, 12830, 195625, 11782, 5701, 8651, 5117, 171739, 184750, 8520,...	[ 0.1456298828125, 0.1009521484375, 0.1875, 0.04150390625, 0.115966796875, 0.212890625, 0.0161285400390625, 0.0985107421875, 0.15771484375, 0.031280517578125, 0.1544189453125, 0.176513671875, 0.0499267578125, 0.040069580078125, 0.12109375, 0.000885009765625, 0.040069580078125, 0.1145...	embed
1571278_c0	1571278	haskell	0	Title: How to make Haskell use another list depending on the previous answer in Haskell Problem title: How to make Haskell use another list depending on the previous answer in Haskell Tags: haskell, optimization Problem: How to make Haskell use another list depending on the previous answer in Haskell I am doing project...	How to make Haskell use another list depending on the previous answer in Haskell How to make Haskell use another list depending on the previous answer in Haskell haskell optimization How Haskell prob63 How to make Haskell use another list depending on the previous answer in Haskell I am doing project euler question 63 ...	[ -0.009521484375, 0.019775390625, 0.005218505859375, -0.0074462890625, 0.01123046875, 0.01446533203125, 0.004791259765625, 0.00604248046875, 0.0179443359375, -0.0238037109375, 0.022216796875, -0.00933837890625, 0.005218505859375, 0.01202392578125, 0.000629425048828125, 0.001846313476562...	[ 11249, 3249, 20625, 142508, 4527, 15700, 5303, 96819, 98, 96362, 35166, 1556, 87235, 43011, 15748, 8, 23, 13452, 1175, 603, 9655, 12069, 7413, 41170, 101935, 32316, 7440, 78662, 653, 140909, 113, 50339, 35431, 75939, 17721, 70270, 3853, 1257,...	[ 0.04327392578125, 0.0823974609375, 0.147705078125, 0.2403564453125, 0.1219482421875, 0.12109375, 0.1884765625, 0.140380859375, 0.041900634765625, 0.1090087890625, 0.1292724609375, 0.11669921875, 0.1248779296875, 0.1829833984375, 0.2293701171875, 0.002197265625, 0.002349853515625, 0...	embed
24856963_c0	24856963	haskell	0	Title: How does lifting (in a functional programming context) relate to category theory? Problem title: How does lifting (in a functional programming context) relate to category theory? Tags: category-theory, haskell Problem: How does lifting (in a functional programming context) relate to category theory? Looking at t...	How does lifting (in a functional programming context) relate to category theory? How does lifting (in a functional programming context) relate to category theory? category-theory haskell How How does lifting (in a functional programming context) relate to category theory? Looking at the Haskell documentation, lifting ...	[ 0.0142822265625, 0.00604248046875, -0.00008058547973632812, -0.004638671875, 0.0015869140625, -0.003448486328125, -0.00311279296875, -0.0301513671875, 0.00848388671875, -0.0269775390625, -0.0128173828125, -0.034912109375, -0.02001953125, 0.0135498046875, -0.013916015625, -0.00573730468...	[ 11249, 177691, 123309, 56037, 43701, 33444, 95487, 154453, 2347, 30675, 1556, 142508, 14602, 13, 47, 20625, 209806, 198343, 4537, 47691, 1238, 62346, 190358, 291, 26783, 32354, 1632, 10750, 8162, 5582, 12921, 13204, 104501, 178851, 8780, 36746, ...	[ 0.0258636474609375, 0.2890625, 0.1522216796875, 0.14111328125, 0.1641845703125, 0.15087890625, 0.2452392578125, 0.208740234375, 0.0999755859375, 0.0562744140625, 0.111328125, 0.206298828125, 0.0280303955078125, 0.0743408203125, 0.034423828125, 0.1163330078125, 0.05194091796875, 0.0...	embed
27273370_c1	27273370	haskell	1	) ) I want to store [TreadID,FibNo] into a List for all the threads as per their execution. Suppose T1 has executed Fib30, T2 Fib35, T3->32 and T4->40. And if the commit sequence of threads like T1,T3, T2 and T4 then I want to store T1-35,T3-32,t2-35,t4-40 in a list. Edit: As suggested by @MathematicalOrchid, I have mo...	) ) I want to store [TreadID,FibNo] into a List for all the threads as per their execution. Suppose T1 has executed Fib30, T2 Fib35, T3->32 and T4->40. And if the commit sequence of threads like T1,T3, T2 and T4 then I want to store T1-35,T3-32,t2-35,t4-40 in a list. Edit: As suggested by @MathematicalOrchid, I have mo...	[ -0.0004558563232421875, 0.0120849609375, -0.0045166015625, -0.001129150390625, 0.006072998046875, 0.00799560546875, -0.0042724609375, 0.02587890625, 0.0029449462890625, -0.0289306640625, 0.007293701171875, 0.01507568359375, 0.01422119140625, -0.0238037109375, 0.0186767578125, 0.0016632...	[ 3444, 4343, 39116, 7146, 6159, 275, 5021, 3934, 10, 32036, 100, 756, 86997, 7, 117, 71924, 384, 418, 1556, 297, 3698, 1197, 304, 5843, 363, 6460, 617, 2839, 375, 4007, 944, 618, 40176, 108760, 41734, 23, 5303, 140363, 206, 73197, 28350,...	[ 0.08343505859375, 0.2073974609375, 0.150390625, 0.1754150390625, 0.12060546875, 0.097412109375, 0.185302734375, 0.107666015625, 0.03912353515625, 0.198486328125, 0.013916015625, 0.0416259765625, 0.2305908203125, 0.01751708984375, 0.0389404296875, 0.1656494140625, 0.0858154296875, 0...	embed
19484770_c0	19484770	haskell	0	Title: State monad with Predicates Problem title: State monad with Predicates Tags: state-monad, haskell Problem: State monad with Predicates I'm attempting to create something that looks a lot like the State monad, but also carries a list of predicates and accompanying transition functions over the state. The basic st...	State monad with Predicates State monad with Predicates state-monad haskell State Predicates Foo State monad with Predicates I'm attempting to create something that looks a lot like the State monad, but also carries a list of predicates and accompanying transition functions over the state. The basic steps for computati...	[ -0.00665283203125, -0.0145263671875, 0.00112152099609375, 0.0002498626708984375, -0.004425048828125, 0.004486083984375, 0.00933837890625, -0.0024566650390625, 0.0040283203125, -0.0302734375, 0.02099609375, 0.0283203125, -0.032958984375, 0.008056640625, -0.01708984375, 0.00775146484375,...	[ 22836, 2667, 712, 678, 7145, 2063, 1636, 11341, 3796, 1556, 142508, 9572, 31, 81887, 28282, 9844, 33342, 5915, 1884, 2258, 5303, 1653, 146365, 149307, 32354, 645, 62822, 98441, 181135, 1363, 22, 25826, 28960, 61340, 19714, 808, 6396, 1369, ...	[ 0.1900634765625, 0.1573486328125, 0.17431640625, 0.1021728515625, 0.1788330078125, 0.2099609375, 0.05108642578125, 0.1805419921875, 0.105224609375, 0.1220703125, 0.20751953125, 0.17724609375, 0.1522216796875, 0.069580078125, 0.10302734375, 0.00555419921875, 0.109619140625, 0.032226...	embed
42299126_c0	42299126	haskell	0	Title: Can't make function more polymorphic Problem title: Can't make function more polymorphic Tags: types, haskell Problem: Can't make function more polymorphic I'm trying to define a function to return each of the nth roots of unity . This compiles, unity n = map (cis.(2).(pi).(/n)) [0..(n-1)] but its ty...	Can't make function more polymorphic Can't make function more polymorphic types haskell Can n-1 Enum Floating Complex Integral Can't make function more polymorphic I'm trying to define a function to return each of the nth roots of unity . This compiles, but its type defaults to unity :: (Enum a, Floating a) =...	[ -0.012939453125, -0.0016632080078125, 0.01251220703125, 0.0098876953125, 0.001678466796875, 0.00262451171875, 0.0140380859375, -0.0191650390625, -0.000843048095703125, -0.0220947265625, -0.00750732421875, -0.0286865234375, 0.0107421875, 0.00921630859375, -0.0211181640625, -0.0187988281...	[ 4171, 3768, 18, 3249, 32354, 1286, 35874, 178851, 52895, 1556, 142508, 653, 5759, 357, 316, 38699, 26518, 113197, 204681, 1771, 31577, 61924, 30646, 12638, 927, 74855, 51, 2481, 9969, 1340, 10644, 114977, 1984, 647, 2606, 10, 44357, 10770, ...	[ 0.0596923828125, 0.06585693359375, 0.11572265625, 0.1048583984375, 0.1583251953125, 0.1243896484375, 0.1851806640625, 0.1849365234375, 0.1524658203125, 0.1094970703125, 0.2335205078125, 0.113525390625, 0.1400146484375, 0.0823974609375, 0.1851806640625, 0.1605224609375, 0.127197265625...	embed
44778404_c1	44778404	haskell	1	.0.2-with-packages/bin/ghc ~/.xmonad/xmonad.hs [1 of 1] Compiling Main ( /home/martyn/.xmonad/xmonad.hs, /home/martyn/.xmonad/xmonad.o ) [flags changed] Linking /home/martyn/.xmonad/xmonad ... But even the version of xmonad in that dir cannot find the libs: $ /nix/store/7mkxsq7ydqcgnjbs59v1v47wfxpwrav5-ghc-8.0.2-with-p...	.0.2-with-packages/bin/ghc ~/.xmonad/xmonad.hs [1 of 1] Compiling Main ( /home/martyn/.xmonad/xmonad.hs, /home/martyn/.xmonad/xmonad.o ) [flags changed] Linking /home/martyn/.xmonad/xmonad ... But even the version of xmonad in that dir cannot find the libs: $ /nix/store/7mkxsq7ydqcgnjbs59v1v47wfxpwrav5-ghc-8.0.2-with-p...	[ -0.0203857421875, 0.01312255859375, -0.01318359375, 0.0108642578125, 0.00347900390625, 0.039306640625, -0.00933837890625, 0.0081787109375, -0.0185546875, -0.01806640625, -0.0166015625, -0.02587890625, -0.0012664794921875, -0.016845703125, 0.0089111328125, -0.0224609375, -0.0039672851...	[ 5, 133684, 76228, 29102, 7568, 9486, 238, 425, 3796, 712, 127, 7, 111, 106, 15612, 49725, 12321, 29552, 1727, 30797, 31, 190872, 98816, 12779, 214, 153, 3853, 11389, 1022, 23, 450, 5402, 53418, 7413, 70, 25474, 93, 45804, 19201, 12975, ...	[ 0.005584716796875, 0.25390625, 0.1026611328125, 0.1610107421875, 0.11181640625, 0.09619140625, 0.09857177734375, 0.07421875, 0.1788330078125, 0.1866455078125, 0.1256103515625, 0.0086669921875, 0.033599853515625, 0.03424072265625, 0.115478515625, 0.14306640625, 0.1226806640625, 0.11...	embed
47085877_c2	47085877	haskell	2	/ghcjs-0.2.1.9007019_ghc-8.0.1/src/.stack-work/dist/x86_64-linux/Cabal-1.24.0.0/setup/setup ... Configuring ghcjs-0.2.1.9007019... ghcjs-0.2.1.9007019: build (lib + exe) Preprocessing library ghcjs-0.2.1.9007019... /home/u/.stack/programs/x86_64-linux/ghcjs-0.2.1.9007019_ghc-8.0.1/src/src/Compiler/JMacro/Base.hs:1:55: ...	/ghcjs-0.2.1.9007019_ghc-8.0.1/src/.stack-work/dist/x86_64-linux/Cabal-1.24.0.0/setup/setup ... Configuring ghcjs-0.2.1.9007019... ghcjs-0.2.1.9007019: build (lib + exe) Preprocessing library ghcjs-0.2.1.9007019... /home/u/.stack/programs/x86_64-linux/ghcjs-0.2.1.9007019_ghc-8.0.1/src/src/Compiler/JMacro/Base.hs:1:55: ...	[ -0.01544189453125, -0.0047607421875, -0.00087738037109375, -0.019287109375, 0.0225830078125, 0.021240234375, -0.0296630859375, -0.00140380859375, 0.010986328125, 0.02197265625, -0.026611328125, -0.0228271484375, 0.01300048828125, 0.00994873046875, 0.007080078125, 0.0233154296875, -0....	[ 248, 9486, 238, 28175, 9, 133684, 22892, 20543, 5757, 2947, 17376, 5, 102014, 19437, 64, 590, 2594, 18244, 46295, 15276, 13307, 2397, 6077, 20370, 3571, 5759, 20682, 99929, 3509, 2037, 153, 1657, 59994, 214, 31380, 27, 12, 45367, 5612, 99...	[ 0.051300048828125, 0.140625, 0.155517578125, 0.268798828125, 0.06634521484375, 0.197998046875, 0.1168212890625, 0.1590576171875, 0.1448974609375, 0.1868896484375, 0.1727294921875, 0.0279083251953125, 0.2069091796875, 0.1063232421875, 0.02020263671875, 0.1302490234375, 0.12109375, 0...	embed
9936260_c0	9936260	haskell	0	Title: Custom ord and chr functions Problem title: Custom ord and chr functions Tags: encryption, haskell, cryptography Problem: Custom ord and chr functions I need to write "custom" ord and chr functions. I'm writing a little program to apply a Caesar cipher to a message. What is the fastest way to do this? The functi...	Custom ord and chr functions Custom ord and chr functions encryption haskell cryptography Custom caesarencipher::Int caesardecipher::Int Custom ord and chr functions I need to write "custom" ord and chr functions. I'm writing a little program to apply a Caesar cipher to a message. What is the fastest way to do this? Th...	[ -0.0089111328125, -0.006744384765625, 0.00933837890625, -0.01531982421875, -0.01043701171875, 0.0027923583984375, 0.00189971923828125, -0.01611328125, -0.0025787353515625, 0.000934600830078125, 0.0019989013671875, -0.00726318359375, -0.0126953125, 0.0213623046875, -0.02001953125, 0.010...	[ 130664, 8597, 136, 17656, 32354, 136791, 1556, 142508, 377, 90, 1744, 94266, 65858, 318, 3871, 33022, 11680, 5928, 32562, 10176, 1528, 59911, 64914, 1059, 26008, 4271, 525, 3917, 6651, 4734, 27117, 5646, 62816, 30646, 95307, 14012, 284, 5608,...	[ 0.214111328125, 0.2327880859375, 0.14794921875, 0.163330078125, 0.209716796875, 0.14599609375, 0.085693359375, 0.1629638671875, 0.02545166015625, 0.0443115234375, 0.05377197265625, 0.1898193359375, 0.08392333984375, 0.008544921875, 0.03399658203125, 0.0919189453125, 0.0982666015625, ...	embed
67549556_c1	67549556	haskell	1	) = Reduce pi u x Reduce pi u (pi (pi x y) z) = Reduce pi u (pi (Reduce pi u x) (pi (Reduce pi u y) (Reduce pi u z) ) ) Reduce pi u x = x Trying this out at the ghci repl, this seems to give me the correct "normalized" monoidal types: > let x :: Reduce (,) () (((), Int), String) = undefined > :t x x :: (Int, [Char]) Gr...	) = Reduce pi u x Reduce pi u (pi (pi x y) z) = Reduce pi u (pi (Reduce pi u x) (pi (Reduce pi u y) (Reduce pi u z) ) ) Reduce pi u x = x Trying this out at the ghci repl, this seems to give me the correct "normalized" monoidal types: > let x :: Reduce (,) () (((), Int), String) = undefined > :t x x :: (Int, [Char]) Gr...	[ -0.043212890625, -0.010498046875, 0.001983642578125, 0.037109375, -0.01007080078125, -0.006317138671875, -0.020263671875, -0.009765625, 0.020263671875, -0.00628662109375, -0.006927490234375, -0.0301513671875, 0.01318359375, -0.007537841796875, -0.003936767578125, -0.00946044921875, -...	[ 1388, 2203, 853, 106357, 2147, 75, 1022, 1434, 113, 97, 15, 4332, 31380, 318, 2424, 37202, 26785, 33176, 29367, 22460, 14, 2465, 52895, 2633, 128258, 360, 18, 23351, 214, 9232, 5983, 1984, 4153, 84068, 32774, 70, 6528, 456, 434, 18781, ...	[ 0.072998046875, 0.044677734375, 0.191162109375, 0.2607421875, 0.202392578125, 0.1964111328125, 0.136962890625, 0.1873779296875, 0.1168212890625, 0.1142578125, 0.00140380859375, 0.073974609375, 0.041015625, 0.043670654296875, 0.07257080078125, 0.006866455078125, 0.0999755859375, 0.1...	embed
68416397_c1	68416397	haskell	1	1s b2s where t' ((Pair a11 a12) : a1s) ((Pair a21 a22) : a2s) = Pair ((Pair a11 a21) :) ((Pair a12 a22) :) <*> t' a1s a2s t' [] [] = pure [] -- A runtime error here is ok; I have external guarantees that this won't happen. t' _ _ = error "Transposition requires the lists to be of equal length." Example: > let subject =...	1s b2s where t' ((Pair a11 a12) : a1s) ((Pair a21 a22) : a2s) = Pair ((Pair a11 a21) :) ((Pair a12 a22) :) <*> t' a1s a2s t' [] [] = pure [] -- A runtime error here is ok; I have external guarantees that this won't happen. t' _ _ = error "Transposition requires the lists to be of equal length." Example: > let subject =...	[ -0.023193359375, 0.0213623046875, -0.0030670166015625, 0.00811767578125, 0.0042724609375, 0.0021209716796875, -0.0289306640625, -0.03564453125, 0.00872802734375, -0.018798828125, 0.01055908203125, 0.025146484375, 0.0040283203125, -0.0004177093505859375, -0.0299072265625, -0.00982666015...	[ 106, 7, 876, 304, 7440, 808, 25, 8335, 481, 10, 1662, 55102, 418, 3117, 89647, 2203, 1342, 69072, 1530, 34166, 11675, 6032, 18499, 3688, 3664, 173591, 142027, 62624, 40322, 144570, 5303, 47, 186, 111, 105950, 140909, 89536, 2633, 28368, 2...	[ 0.1190185546875, 0.1142578125, 0.07464599609375, 0.1964111328125, 0.011688232421875, 0.1505126953125, 0.058929443359375, 0.1402587890625, 0.1865234375, 0.09228515625, 0.14208984375, 0.10186767578125, 0.09771728515625, 0.1197509765625, 0.112060546875, 0.038482666015625, 0.177001953125...	embed
58728301_c0	58728301	haskell	0	Title: Binary Search Tree Implementation in Haskell Problem title: Binary Search Tree Implementation in Haskell Tags: haskell, binary-tree Problem: Binary Search Tree Implementation in Haskell I am working on an assignment in Haskell and had a question about the implementation of a binary search tree that I was given. ...	Binary Search Tree Implementation in Haskell Binary Search Tree Implementation in Haskell haskell binary-tree Binary Search Tree Implementation Haskell EmptyTree Node Show Leaf Branch Binary Search Tree Implementation in Haskell I am working on an assignment in Haskell and had a question about the implementation of a b...	[ 0.031982421875, 0.0257568359375, 0.002197265625, -0.000850677490234375, 0.02392578125, 0.0216064453125, -0.025634765625, -0.033203125, -0.0037078857421875, -0.01141357421875, -0.01055908203125, -0.033203125, -0.0037384033203125, 0.01214599609375, -0.0130615234375, 0.0091552734375, 0....	[ 54092, 1294, 33086, 101344, 153941, 20625, 142508, 1556, 2394, 6635, 62600, 31678, 939, 62731, 438, 112, 17367, 636, 2407, 21110, 206, 20697, 95486, 208124, 33938, 53201, 34475, 12877, 25632, 80934, 10422, 40101, 201505, 12830, 70541, 34292, 66...	[ 0.21435546875, 0.1173095703125, 0.218017578125, 0.265625, 0.191650390625, 0.125, 0.2254638671875, 0.07452392578125, 0.1839599609375, 0.156982421875, 0.198486328125, 0.14453125, 0.08331298828125, 0.1746826171875, 0.1068115234375, 0.05975341796875, 0.10791015625, 0.040496826171875, ...	embed
17322586_c0	17322586	haskell	0	Title: Parallel tree search Problem title: Parallel tree search Tags: parallel-processing, haskell Problem: Parallel tree search Let's say I have a lazy Tree whose leaves are possible solutions to a problem data Tree a = Node [Tree a] \| Leaf (Maybe a) I need to find just one solution (or find out that there are none). ...	Parallel tree search Parallel tree search parallel-processing haskell Parallel Tree Node Leaf Maybe Parallel tree search Let's say I have a lazy Tree whose leaves are possible solutions to a problem I need to find just one solution (or find out that there are none). I have a P -core machine. From both time and memory e...	[ -0.0030670166015625, 0.0294189453125, -0.01104736328125, 0.007232666015625, 0.01007080078125, 0.01055908203125, 0.00567626953125, -0.038330078125, -0.0098876953125, -0.060546875, -0.0069580078125, 0.00732421875, 0.009521484375, 0.0111083984375, 0.00921630859375, 0.019775390625, 0.015...	[ 211485, 53201, 33938, 95103, 63923, 1556, 142508, 101344, 438, 112, 636, 2407, 83425, 765, 21, 3285, 31358, 7, 7722, 51347, 47, 2967, 3871, 7413, 1660, 1632, 29806, 436, 30854, 36279, 1733, 98323, 227066, 10422, 33233, 12921, 90356, 23, 139...	[ 0.2373046875, 0.2452392578125, 0.2236328125, 0.25244140625, 0.090087890625, 0.1224365234375, 0.243896484375, 0.2291259765625, 0.07696533203125, 0.03955078125, 0.059234619140625, 0.1319580078125, 0.013519287109375, 0.018096923828125, 0.0850830078125, 0.1561279296875, 0.18017578125, ...	embed
42847682_c0	42847682	haskell	0	Title: Why is this function being called every time I try to get its value? Problem title: Why is this function being called every time I try to get its value? Tags: pi, recursion, haskell Problem: Why is this function being called every time I try to get its value? I have this Haskell code that I wrote to calculate pi...	Why is this function being called every time I try to get its value? Why is this function being called every time I try to get its value? pi recursion haskell Why Main Why is this function being called every time I try to get its value? I have this Haskell code that I wrote to calculate pi using the series π/4 = 1 - 1/...	[ 0.0004520416259765625, -0.0052490234375, 0.005340576171875, -0.03271484375, -0.00592041015625, -0.0224609375, 0.0167236328125, -0.0157470703125, 0.007110595703125, -0.026123046875, -0.02294921875, -0.0177001953125, -0.0198974609375, -0.008056640625, 0.0257568359375, 0.01348876953125, ...	[ 44084, 83, 903, 32354, 8035, 35839, 11907, 1733, 87, 9790, 47, 2046, 6863, 34292, 2147, 195625, 1830, 1556, 142508, 12321, 20625, 18151, 54397, 74481, 67, 17368, 36549, 7823, 17357, 106, 62366, 997, 12147, 32359, 22364, 13028, 527, 73265, 1...	[ 0.15576171875, 0.08038330078125, 0.1204833984375, 0.2235107421875, 0.13330078125, 0.2188720703125, 0.2042236328125, 0.2127685546875, 0.059417724609375, 0.191650390625, 0.048553466796875, 0.136474609375, 0.059539794921875, 0.1905517578125, 0.271728515625, 0.25341796875, 0.154052734375...	embed
11592962_c0	11592962	haskell	0	Title: Yampa Particle Field Problem title: Yampa Particle Field Tags: yampa, haskell, particle-system Problem: Yampa Particle Field I want to have a particle field in Yampa. The single particle should just move in a straight line, but depending on an angle given. That angle and movement speed changes depending on the p...	Yampa Particle Field Yampa Particle Field yampa haskell particle-system Yampa Particle Field Float x-2 y-2 Yampa Particle Field I want to have a particle field in Yampa. The single particle should just move in a straight line, but depending on an angle given. That angle and movement speed changes depending on the playe...	[ -0.005706787109375, -0.0120849609375, 0.01275634765625, 0.0172119140625, 0.004180908203125, 0.012451171875, 0.00909423828125, -0.01263427734375, 0.0022735595703125, -0.008544921875, -0.009521484375, 0.0177001953125, -0.0018157958984375, -0.00147247314453125, 0.0035858154296875, -0.0207...	[ 2369, 15293, 436, 26147, 117657, 151, 1556, 142508, 915, 16751, 38699, 1022, 5428, 113, 87, 3444, 765, 10, 44457, 23, 11001, 5608, 1660, 25813, 80560, 13315, 1284, 96819, 55291, 34475, 9925, 136, 112664, 38352, 65572, 58585, 73342, 168698, ...	[ 0.2025146484375, 0.2978515625, 0.0867919921875, 0.2314453125, 0.209228515625, 0.1300048828125, 0.130126953125, 0.2135009765625, 0.12109375, 0.1507568359375, 0.1494140625, 0.06298828125, 0.1229248046875, 0.06787109375, 0.009307861328125, 0.118408203125, 0.0882568359375, 0.0969238281...	embed
23119583_c0	23119583	haskell	0	Title: Apply polymorphic function in a GHC plugin Problem title: Apply polymorphic function in a GHC plugin Tags: haskell, ghc Problem: Apply polymorphic function in a GHC plugin I would like to write a GHC plugin which "adds a hook" to each function. Say I want to apply a function addHook of type Ord a => (a -> b) -> ...	Apply polymorphic function in a GHC plugin Apply polymorphic function in a GHC plugin haskell ghc Apply GHC Ord RHS AddHook GHC.Types.Int GHC.Classes.$fOrdInt Apply polymorphic function in a GHC plugin I would like to write a GHC plugin which "adds a hook" to each function. Say I want to apply a function addHook of typ...	[ 0.00185394287109375, -0.01007080078125, 0.0322265625, -0.01129150390625, 0.0036163330078125, 0.0208740234375, 0.0002536773681640625, -0.00933837890625, 0.01080322265625, -0.04443359375, 0.030029296875, -0.03271484375, -0.01287841796875, 0.0166015625, 0.0137939453125, -0.0308837890625, ...	[ 5659, 538, 35874, 178851, 1771, 32354, 527, 73265, 69993, 23, 1556, 142508, 31380, 238, 35379, 68416, 294, 29117, 11193, 685, 196707, 4153, 18, 140803, 143045, 1884, 33022, 712, 6468, 10, 150522, 12638, 3444, 59911, 15190, 10644, 876, 7108, ...	[ 0.1502685546875, 0.02337646484375, 0.204345703125, 0.2266845703125, 0.089599609375, 0.187744140625, 0.09661865234375, 0.225341796875, 0.255859375, 0.02392578125, 0.10113525390625, 0.2017822265625, 0.086669921875, 0.07073974609375, 0.1524658203125, 0.106201171875, 0.085693359375, 0....	embed
40506692_c0	40506692	haskell	0	Title: Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? Problem title: Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? Tags: haskell, packet-capture, pcap, packets, packet-sniffers Problem: Parsing a PCAP file - Why does this packet header timestamp contains SO...	Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? haskell packet-capture pcap packets packet-sniffers Parsing PCAP Why SOH Start Header Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? ...	[ 0.0126953125, 0.016357421875, -0.0008697509765625, 0.0257568359375, -0.00372314453125, -0.01324462890625, -0.006561279296875, -0.0111083984375, -0.0029449462890625, 0.012451171875, 0.0164794921875, -0.01806640625, -0.0177001953125, 0.00830078125, -0.016357421875, 0.00191497802734375, ...	[ 2392, 6953, 436, 136629, 11435, 44084, 903, 43824, 10336, 56, 1733, 590, 2676, 70541, 159, 56585, 41872, 6746, 1556, 142508, 15644, 915, 93, 18234, 13794, 44816, 125663, 5117, 201, 390, 1636, 5608, 33636, 102134, 94131, 12989, 170894, 3311, ...	[ 0.135498046875, 0.01397705078125, 0.07244873046875, 0.26220703125, 0.1220703125, 0.12646484375, 0.0253448486328125, 0.1318359375, 0.1737060546875, 0.0765380859375, 0.0567626953125, 0.1007080078125, 0.0804443359375, 0.1025390625, 0.115966796875, 0.293212890625, 0.079345703125, 0.197...	embed
22515206_c0	22515206	haskell	0	Title: How can monads determine ordering if their information is lost upon normalization? Problem title: How can monads determine ordering if their information is lost upon normalization? Tags: monads, haskell Problem: How can monads determine ordering if their information is lost upon normalization? If I understood co...	How can monads determine ordering if their information is lost upon normalization? How can monads determine ordering if their information is lost upon normalization? monads haskell How What Welcome How can monads determine ordering if their information is lost upon normalization? If I understood correctly, a monad is j...	[ -0.01708984375, 0.00677490234375, 0.009033203125, 0.0208740234375, 0.0289306640625, 0.0284423828125, 0.004241943359375, -0.01287841796875, 0.0054931640625, -0.01300048828125, 0.007598876953125, -0.03173828125, -0.01123046875, -0.02001953125, -0.005126953125, -0.017822265625, 0.005401...	[ 11249, 831, 2667, 712, 7, 83324, 12989, 214, 2174, 4677, 83, 72856, 54799, 3638, 47691, 1556, 142508, 4865, 91334, 217064, 10, 1660, 208124, 68557, 6396, 1369, 136, 30646, 39933, 25632, 24233, 91736, 198343, 150350, 116, 32354, 12921, 52895, ...	[ 0.06793212890625, 0.0777587890625, 0.21435546875, 0.281982421875, 0.1185302734375, 0.1981201171875, 0.26318359375, 0.1453857421875, 0.10693359375, 0.1453857421875, 0.0994873046875, 0.1878662109375, 0.0980224609375, 0.197021484375, 0.153076171875, 0.10699462890625, 0.243408203125, 0...	embed
70052100_c2	70052100	haskell	2	-0.12.8... Failed to install classy-prelude-0.12.8 Build log ( /home/usr/.cabal/logs/classy-prelude-0.12.8.log ): cabal: Entering Code signals: vector-0.12.3.1, text-1.2.2.2, mono-traversable-1.0.9.0, hackage.haskell.org, ClassyPrelude.hs:229:1, Failed, Data.Textual.Encoding, Resolving, Configuring, classy-prelude-0.12...	-0.12.8... Failed to install classy-prelude-0.12.8 Build log ( /home/usr/.cabal/logs/classy-prelude-0.12.8.log ): cabal: Entering Code signals: vector-0.12.3.1, text-1.2.2.2, mono-traversable-1.0.9.0, hackage.haskell.org, ClassyPrelude.hs:229:1, Failed, Data.Textual.Encoding, Resolving, Configuring, classy-prelude-0.12...	[ 0.004547119140625, 0.01123046875, 0.021240234375, 0.006500244140625, -0.0030975341796875, -0.0120849609375, -0.007415771484375, -0.035888671875, -0.00732421875, 0.025634765625, -0.0142822265625, -0.01397705078125, -0.00885009765625, -0.0159912109375, 0.00396728515625, 0.01007080078125,...	[ 102014, 82295, 27, 190355, 297, 47, 20600, 18507, 53, 4692, 822, 112, 121137, 12684, 29552, 223, 408, 3571, 4867, 67413, 109524, 357, 33558, 28864, 26073, 173, 18770, 15654, 97109, 7986, 48400, 70147, 22460, 1517, 7864, 2886, 102107, 38331, ...	[ 0.1761474609375, 0.250244140625, 0.020477294921875, 0.235595703125, 0.07281494140625, 0.0257415771484375, 0.217529296875, 0.2149658203125, 0.1961669921875, 0.138427734375, 0.2047119140625, 0.14990234375, 0.168212890625, 0.1749267578125, 0.033233642578125, 0.001800537109375, 0.0786132...	embed
57996516_c0	57996516	haskell	0	Title: Using Servant, Selda, and SQLite together Problem title: Using Servant, Selda, and SQLite together Tags: servant, haskell Problem: Using Servant, Selda, and SQLite together I have been using Haskell for a year or so, and it is fantastic. I have recently started using Servant; and I would like to use an SQL-libra...	Using Servant, Selda, and SQLite together Using Servant, Selda, and SQLite together servant haskell Using Servant Selda SQLite Using Servant, Selda, and SQLite together I have been using Haskell for a year or so, and it is fantastic. I have recently started using Servant; and I would like to use an SQL-library such as ...	[ 0.005401611328125, 0.006256103515625, 0.004150390625, 0.02294921875, -0.0205078125, -0.004302978515625, -0.0208740234375, -0.010009765625, 0.0059814453125, -0.03369140625, 0.0169677734375, -0.0247802734375, 0.00439453125, 0.00830078125, -0.0205078125, 0.006561279296875, -0.0061950683...	[ 345, 5406, 30624, 11623, 85, 136, 80866, 1486, 25842, 187646, 1556, 142508, 17368, 20625, 6602, 4, 47823, 26859, 1884, 47, 4527, 9, 150, 2844, 1294, 6044, 26818, 10644, 115840, 83, 29568, 538, 190098, 70163, 71, 678, 540, 39, 27781, 32102...	[ 0.082275390625, 0.17529296875, 0.261474609375, 0.1962890625, 0.205322265625, 0.027679443359375, 0.1790771484375, 0.26220703125, 0.1593017578125, 0.2021484375, 0.0826416015625, 0.2099609375, 0.126708984375, 0.0721435546875, 0.0389404296875, 0.00164794921875, 0.08319091796875, 0.0052...	embed
58403682_c0	58403682	haskell	0	Title: What is the syntax for different recursions depending on two boolean guards? Problem title: What is the syntax for different recursions depending on two boolean guards? Tags: function, definition, guard-clause, syntax, haskell Problem: What is the syntax for different recursions depending on two boolean guards? ...	What is the syntax for different recursions depending on two boolean guards? What is the syntax for different recursions depending on two boolean guards? function definition guard-clause syntax haskell What Integer x:xs Perhaps What is the syntax for different recursions depending on two boolean guards? I'm very new to...	[ -0.02685546875, 0.0213623046875, -0.00531005859375, -0.00311279296875, 0.0026092529296875, 0.00799560546875, -0.0189208984375, 0.0022735595703125, 0.004180908203125, 0.017578125, 0.03271484375, -0.005859375, -0.028564453125, -0.007080078125, 0.016357421875, -0.0072021484375, -0.01684...	[ 6002, 86531, 12921, 195625, 17514, 96819, 6626, 337, 31, 34677, 56050, 7, 32354, 80934, 18347, 4032, 1556, 142508, 44401, 1022, 12, 425, 181799, 3525, 20625, 33022, 8781, 5646, 10298, 892, 26255, 237, 107730, 30646, 12996, 756, 80854, 83080, ...	[ 0.1512451171875, 0.2388916015625, 0.198974609375, 0.230712890625, 0.1412353515625, 0.12939453125, 0.1446533203125, 0.0408935546875, 0.10693359375, 0.1473388671875, 0.224365234375, 0.043731689453125, 0.1275634765625, 0.05120849609375, 0.07330322265625, 0.0576171875, 0.10540771484375, ...	embed
11571520_c0	11571520	haskell	0	Title: Reify a module into a record Problem title: Reify a module into a record Tags: template-haskell, module, haskell, ghc-api Problem: Reify a module into a record Suppose I have an arbitrary module module Foo where foo :: Moo -> Goo bar :: Car -> Far baz :: Can -> Haz where foo , bar , and baz are correctly impleme...	Reify a module into a record Reify a module into a record template-haskell module haskell ghc-api Foo qualified Reify Moo Goo Car Far Can Haz FooModule _Foo_ Foo.foo Foo.bar Foo.baz Reify a module into a record Suppose I have an arbitrary module where foo , bar , and baz are correctly implemented, etc. I'd like to reif...	[ -0.000743865966796875, -0.003326416015625, -0.0091552734375, 0.021484375, 0.00537109375, 0.03466796875, 0.01025390625, 0.000263214111328125, -0.006011962890625, -0.0286865234375, 0.000904083251953125, -0.017578125, -0.00421142578125, -0.0022430419921875, -0.0050048828125, -0.0045776367...	[ 853, 40383, 88996, 3934, 10, 17164, 110934, 10557, 142508, 1556, 31380, 238, 40897, 9572, 31, 217225, 62097, 131257, 3980, 7325, 4171, 57377, 91616, 8782, 27591, 3584, 1299, 40300, 61799, 5775, 1909, 16627, 26785, 29479, 1884, 456, 191082, 48...	[ 0.1512451171875, 0.25830078125, 0.2666015625, 0.140869140625, 0.056732177734375, 0.253173828125, 0.2115478515625, 0.0892333984375, 0.2305908203125, 0.121337890625, 0.09521484375, 0.05938720703125, 0.11376953125, 0.130615234375, 0.1136474609375, 0.1785888671875, 0.1346435546875, 0.1...	embed
16678440_c0	16678440	haskell	0	Title: Why do these folds stop at the head/tail? Problem title: Why do these folds stop at the head/tail? Tags: haskell, functional-programming, function, fold Problem: Why do these folds stop at the head/tail? I'm reading learnyouahaskell.com and currently investigating folds. In the book there are these examples: max...	Why do these folds stop at the head/tail? Why do these folds stop at the head/tail? haskell functional-programming function fold Why Ord foldr1 Num Bool foldl1 Why do these folds stop at the head/tail? I'm reading learnyouahaskell.com and currently investigating folds. In the book there are these examples: I understand...	[ 0.0037078857421875, 0.005096435546875, 0.0162353515625, 0.001007080078125, -0.01025390625, 0.039306640625, -0.004913330078125, 0.0033721923828125, 0.00750732421875, -0.011474609375, 0.032470703125, -0.0213623046875, -0.01080322265625, 0.0026397705078125, 0.0233154296875, -0.00328063964...	[ 44084, 6097, 42822, 7, 7279, 99, 10336, 64, 46741, 1556, 142508, 123309, 28966, 32354, 35379, 18344, 7569, 418, 52782, 2460, 929, 20469, 54, 70, 53927, 7232, 12877, 27781, 28219, 40494, 25, 136, 100094, 2394, 6635, 5608, 190659, 183278, 129...	[ 0.1387939453125, 0.08837890625, 0.24609375, 0.1199951171875, 0.1978759765625, 0.1160888671875, 0.2125244140625, 0.08197021484375, 0.25439453125, 0.1370849609375, 0.221923828125, 0.1260986328125, 0.0880126953125, 0.1358642578125, 0.1546630859375, 0.1156005859375, 0.10687255859375, 0...	embed
74560491_c1	74560491	haskell	1	CoPat pats ty' <- normSubst (val, var) ty pure (NormCoVal pats' ty') Relevant type signatures include: data Normal = ... \| NormCoVal (forall m. (MonadReader Environment m, MonadError String m, MonadState ProgState m) => [(CoPattern, m Normal)]) Normal substCoPat :: (MonadReader Environment m, MonadError String m, Monad...	CoPat pats ty' <- normSubst (val, var) ty pure (NormCoVal pats' ty') Relevant type signatures include: data Normal = ... \| NormCoVal (forall m. (MonadReader Environment m, MonadError String m, MonadState ProgState m) => [(CoPattern, m Normal)]) Normal substCoPat :: (MonadReader Environment m, MonadError String m, Monad...	[ -0.022216796875, 0.007781982421875, -0.0191650390625, 0.01446533203125, 0.02685546875, 0.01312255859375, -0.0240478515625, -0.0186767578125, -0.00017261505126953125, -0.01177978515625, -0.00012874603271484375, -0.004974365234375, 0.007293701171875, -0.009033203125, -0.0003108978271484375...	[ 1311, 683, 257, 24114, 2281, 25, 4426, 22599, 96472, 271, 1405, 285, 34166, 50645, 39, 10625, 42272, 133, 30624, 10644, 138256, 2053, 28723, 2203, 88859, 5584, 347, 46674, 712, 31345, 56, 686, 1900, 60331, 18468, 31611, 23351, 135206, 1250,...	[ 0.161865234375, 0.1937255859375, 0.221435546875, 0.23681640625, 0.0877685546875, 0.125, 0.0205078125, 0.1826171875, 0.1673583984375, 0.1405029296875, 0.154296875, 0.1429443359375, 0.1573486328125, 0.07623291015625, 0.0560302734375, 0.145263671875, 0.17138671875, 0.076416015625, 0...	embed
77441659_c0	77441659	haskell	0	Title: Haskell after install the conduit package Problem title: Haskell after install the conduit package Tags: haskell-stack, conduit, haskell, cabal Problem: Haskell after install the conduit package I`m new in the Haskell and do the task for my class. I install it in VSCode, downloaded the extension for it and every...	Haskell after install the conduit package Haskell after install the conduit package haskell-stack conduit haskell cabal Haskell ghc-9.4.7.exe ghc-9.4.7 hashable-1.4.3.0-1961fe79003fd705645c177b7f4aca0399a4d276 libHShashable-1.4.3.0-1961fe79003fd705645c177b7f4aca0399a4d276.a LowLevel.o Not x86_64 Unknown COFF GHC Please...	[ -0.0062255859375, -0.005859375, 0.01434326171875, 0.03466796875, 0.010009765625, 0.006927490234375, -0.0203857421875, 0.0145263671875, -0.010986328125, -0.00023937225341796875, -0.01129150390625, -0.0308837890625, 0.021484375, -0.01019287109375, 0.00433349609375, 0.00002241134643554687...	[ 20625, 142508, 7103, 20600, 120565, 98169, 1556, 590, 2594, 109524, 31380, 238, 15205, 29485, 966, 46480, 127, 2886, 91977, 132265, 160733, 11835, 25474, 38131, 126234, 144283, 11, 61187, 5267, 2601, 31, 11205, 15276, 13307, 69723, 125754, 527,...	[ 0.166015625, 0.26318359375, 0.1358642578125, 0.1934814453125, 0.27783203125, 0.1722412109375, 0.136474609375, 0.06982421875, 0.09808349609375, 0.1932373046875, 0.0784912109375, 0.06512451171875, 0.1253662109375, 0.1397705078125, 0.0457763671875, 0.0552978515625, 0.08123779296875, 0...	embed
61599227_c1	61599227	haskell	1	(inNestedState md)) Meanwhile I end up with limited but handy home made solution: class MonadRebase m n where rebase :: (m a) -> (n a) instance (MonadRebase m n) => MonadRebase (ReaderT r m) (ReaderT r n) where rebase t = ReaderT $ \r -> rebase (runReaderT t r) instance (MonadRebase m n) => MonadRebase (StateT s m) (S...	(inNestedState md)) Meanwhile I end up with limited but handy home made solution: class MonadRebase m n where rebase :: (m a) -> (n a) instance (MonadRebase m n) => MonadRebase (ReaderT r m) (ReaderT r n) where rebase t = ReaderT $ \r -> rebase (runReaderT t r) instance (MonadRebase m n) => MonadRebase (StateT s m) (S...	[ -0.020263671875, 0.0028839111328125, -0.00299072265625, 0.0000324249267578125, 0.025634765625, 0.00579833984375, -0.005462646484375, -0.0027313232421875, -0.0028533935546875, -0.0291748046875, 0.00823974609375, 0.00811767578125, 0.0086669921875, 0.0216064453125, 0.00537109375, -0.00265...	[ 73, 6433, 14437, 135206, 13, 347, 71, 16, 204610, 3564, 84046, 1284, 3535, 53, 5368, 7228, 29806, 18507, 60331, 4332, 37382, 653, 456, 39, 10, 19, 110527, 46674, 712, 31345, 808, 122636, 618, 3650, 16428, 22836, 10111, 17780, 34627, 2053,...	[ 0.1385498046875, 0.212158203125, 0.162109375, 0.1866455078125, 0.035491943359375, 0.0863037109375, 0.139892578125, 0.01171875, 0.00927734375, 0.007659912109375, 0.1361083984375, 0.0150299072265625, 0.07281494140625, 0.0040283203125, 0.05035400390625, 0.102294921875, 0.1309814453125, ...	embed
14118917_c0	14118917	haskell	0	Title: In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe Problem title: In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe Tags: windows, interrupt-handling, haskell Problem: In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe I tried to run the following ...	In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe windows interrupt-handling haskell System.Process Haskell Ctrl-C Windows cmd.exe Language OverloadedStrings CreateProcess RawCommand Nothing std_in CreatePipe std_out std_e...	[ 0.019287109375, 0.004302978515625, 0.00109100341796875, 0.01165771484375, -0.0206298828125, -0.0234375, -0.0042724609375, -0.02392578125, -0.000946044921875, -0.044677734375, -0.0152587890625, 0.01190185546875, -0.0140380859375, 0.0220947265625, 0.01318359375, 0.026123046875, 0.02392...	[ 20625, 142508, 40485, 18537, 10752, 26531, 46389, 214, 68847, 9, 441, 1379, 3773, 3768, 1827, 71, 46480, 54825, 206735, 54885, 1556, 12353, 83658, 9578, 63033, 71713, 151313, 109997, 10770, 12018, 182747, 6138, 73, 683, 48672, 6056, 20903, 64...	[ 0.131591796875, 0.25634765625, 0.2357177734375, 0.21484375, 0.1488037109375, 0.1842041015625, 0.19677734375, 0.023773193359375, 0.2181396484375, 0.039276123046875, 0.1451416015625, 0.1082763671875, 0.1690673828125, 0.057586669921875, 0.1461181640625, 0.076904296875, 0.1290283203125, ...	embed
53056242_c0	53056242	haskell	0	Title: haskell beginner strings Problem title: haskell beginner strings Tags: haskell Problem: haskell beginner strings I want to write a simple string function: input: aaabbbAAAcccc output: a3b3A3c4 All I have now it this code: compress :: String -> String compress x = if length x > 1 then do take 1 x ++ show ( length...	haskell beginner strings haskell beginner strings haskell a3b3A3c4 Main a9a8a7a6a5a4a3a2a1b7b6b5b4b3b2b x:xs haskell beginner strings I want to write a simple string function: All I have now it this code: This will obviously not work. Here is the output: I am taking 1 out of the x string applying filter to take out how...	[ -0.01470947265625, 0.020263671875, 0.00537109375, 0.0263671875, 0.01068115234375, 0.01239013671875, 0.03564453125, 0.0026702880859375, 0.0260009765625, -0.00933837890625, -0.007110595703125, -0.00726318359375, 0.0224609375, 0.035400390625, -0.0125732421875, -0.005889892578125, 0.0087...	[ 1556, 142508, 9842, 1679, 79315, 12321, 1126, 1022, 12, 425, 7, 3444, 33022, 8781, 32354, 3164, 5036, 903, 18151, 3293, 1221, 171259, 959, 4488, 140992, 35971, 106, 1810, 59911, 46312, 5646, 5941, 31251, 765, 11907, 21656, 2263, 159029, 195...	[ 0.12255859375, 0.1864013671875, 0.07916259765625, 0.07257080078125, 0.1920166015625, 0.0338134765625, 0.02374267578125, 0.1395263671875, 0.012298583984375, 0.09619140625, 0.04217529296875, 0.0447998046875, 0.11474609375, 0.1240234375, 0.171630859375, 0.00347900390625, 0.0169982910156...	embed
41514559_c0	41514559	haskell	0	Title: Can't load Graphics.Gloss in Haskell Problem title: Can't load Graphics.Gloss in Haskell Tags: haskell Problem: Can't load Graphics.Gloss in Haskell I wanted to play around with Pong.hs . I downloaded the .hs file, but when I opened it in Sublime Text (with the Haskell plugin) I was told that Graphics....	Can't load Graphics.Gloss in Haskell Can't load Graphics.Gloss in Haskell haskell Can Graphics.Gloss Haskell Graphics.Gloss.Interface.Pure.Game Gloss Pong.hs:22:1 Failed Use Pong.hs:23:1 Can't load Graphics.Gloss in Haskell I wanted to play around with Pong.hs . I downloaded the .hs file, but when I opened it...	[ -0.0172119140625, 0.0003662109375, 0.014892578125, 0.013916015625, -0.015869140625, 0.0181884765625, 0.000171661376953125, 0.00040435791015625, -0.002532958984375, 0.0120849609375, 0.01153564453125, -0.037353515625, 0.0068359375, -0.006317138671875, -0.0006256103515625, 0.0128173828125...	[ 4171, 3768, 18, 72367, 189682, 7, 5, 724, 2400, 23, 20625, 142508, 1556, 44851, 40404, 3408, 107576, 46173, 663, 449, 127, 24070, 19721, 190355, 36836, 24864, 11301, 10932, 7026, 11435, 142096, 8273, 150, 24129, 69993, 136, 683, 132283, 741...	[ 0.06170654296875, 0.045806884765625, 0.048248291015625, 0.1929931640625, 0.237060546875, 0.1627197265625, 0.03753662109375, 0.0751953125, 0.2138671875, 0.0850830078125, 0.1419677734375, 0.257568359375, 0.1168212890625, 0.0146026611328125, 0.0704345703125, 0.10394287109375, 0.06359863...	embed
46885123_c0	46885123	haskell	0	Title: How to use user defined data as param in haskell? Problem title: How to use user defined data as param in haskell? Tags: haskell Problem: How to use user defined data as param in haskell? I am new to haskell I have this program: loop height weight=do line<-getLine if line=="1" then do height<-getLine loop height...	How to use user defined data as param in haskell? How to use user defined data as param in haskell? haskell How height::String weight::String loop::A z.height z.weight How to use user defined data as param in haskell? I am new to haskell I have this program: It works fine,now I change it as this: this program is wrong ...	[ -0.007232666015625, -0.000705718994140625, -0.0181884765625, 0.02734375, -0.003814697265625, 0.00738525390625, -0.0032806396484375, 0.00872802734375, 0.02001953125, -0.0225830078125, 0.019775390625, -0.0322265625, 0.0172119140625, 0.0035247802734375, 0.01220703125, -0.01611328125, 0....	[ 11249, 47, 4527, 38937, 61924, 71, 2053, 237, 121, 39, 23, 1556, 142508, 155955, 71713, 214, 57888, 40956, 284, 97, 1106, 22553, 165598, 3525, 1528, 43240, 5885, 15549, 903, 83, 44691, 32354, 110, 95486, 2633, 5, 1369, 3714, 3642, 33022, ...	[ 0.089111328125, 0.017608642578125, 0.1558837890625, 0.172607421875, 0.2176513671875, 0.0823974609375, 0.177978515625, 0.10064697265625, 0.151611328125, 0.15576171875, 0.039306640625, 0.154541015625, 0.2352294921875, 0.22607421875, 0.1436767578125, 0.0250396728515625, 0.2332763671875,...	embed
8995622_c2	8995622	haskell	2	C /ImageI ] /Properties << /MC0 << /Metadata 502 0 R >> >> /XObject << /Fm0 451 0 R /Fm1 504 0 R /Fm2 513 0 R /Fm3 515 0 R /Fm4 517 0 R /Fm5 526 0 R /Fm6 528 0 R /Fm7 537 0 R /Fm8 539 0 R /Im0 540 0 R /Im1 541 0 R /Im2 452 0 R /Im3 542 0 R /Im4 543 0 R >> >> /Rotate 0 /StructParents 1 /TrimBox [ 0.000000 0.000000 612.0...	C /ImageI ] /Properties << /MC0 << /Metadata 502 0 R >> >> /XObject << /Fm0 451 0 R /Fm1 504 0 R /Fm2 513 0 R /Fm3 515 0 R /Fm4 517 0 R /Fm5 526 0 R /Fm6 528 0 R /Fm7 537 0 R /Fm8 539 0 R /Im0 540 0 R /Im1 541 0 R /Im2 452 0 R /Im3 542 0 R /Im4 543 0 R >> >> /Rotate 0 /StructParents 1 /TrimBox [ 0.000000 0.000000 612.0...	[ -0.0030670166015625, 0.004791259765625, 0.0062255859375, -0.0157470703125, -0.01531982421875, 0.03369140625, 0.015380859375, -0.0125732421875, 0.006683349609375, -0.0034027099609375, 0.01422119140625, 0.000873565673828125, 0.00567626953125, -0.01953125, 0.03173828125, 0.010498046875, ...	[ 313, 248, 216960, 568, 10752, 1264, 2449, 56473, 32557, 2389, 6696, 8656, 102, 836, 304, 757, 627, 61887, 275, 75161, 919, 39, 154602, 418, 617, 190, 2681, 363, 1837, 2489, 4046, 910, 3882, 966, 6, 179973, 1019, 188758, 61637, 117975, 8...	[ 0.1221923828125, 0.1109619140625, 0.2003173828125, 0.1904296875, 0.06982421875, 0.1627197265625, 0.09661865234375, 0.00567626953125, 0.04827880859375, 0.113037109375, 0.0972900390625, 0.0877685546875, 0.1204833984375, 0.1072998046875, 0.093017578125, 0.095947265625, 0.073486328125, ...	embed
59255056_c0	59255056	haskell	0	Title: function takes a list of 2-Tuples and a number Problem title: function takes a list of 2-Tuples and a number Tags: haskell Problem: function takes a list of 2-Tuples and a number So.. I am trying to build a program that takes a list of 2-tuples and a number and check if the number equal one of the elements of th...	function takes a list of 2-Tuples and a number function takes a list of 2-Tuples and a number haskell Tuples function takes a list of 2-Tuples and a number So.. I am trying to build a program that takes a list of 2-tuples and a number and check if the number equal one of the elements of the tuple, if it equal the first...	[ 0.00946044921875, 0.01318359375, -0.01220703125, 0.01116943359375, -0.006378173828125, 0.007232666015625, -0.0260009765625, 0.0022125244140625, 0.0150146484375, -0.0126953125, -0.0078125, -0.009521484375, -0.007659912109375, 0.02099609375, -0.0224609375, 0.0128173828125, 0.0148315429...	[ 32354, 51776, 5303, 111, 4720, 15665, 99726, 136, 10, 14012, 1556, 142508, 1371, 1061, 31577, 45367, 1528, 458, 12765, 2174, 105950, 1632, 80854, 370, 8705, 5117, 12830, 30646, 4568, 27781, 104116, 29557, 23817, 21320, 105801, 10461, 201, 758...	[ 0.1995849609375, 0.1658935546875, 0.153076171875, 0.030853271484375, 0.151611328125, 0.143310546875, 0.28076171875, 0.132080078125, 0.04730224609375, 0.17529296875, 0.1414794921875, 0.220458984375, 0.1658935546875, 0.0234375, 0.0675048828125, 0.08160400390625, 0.116455078125, 0.121...	embed
10724946_c0	10724946	haskell	0	Title: Does `par` create another thread? Problem title: Does `par` create another thread? Tags: multicore, multithreading, parallel-processing, haskell Problem: Does `par` create another thread? My understanding to par is that it will create a thread in another core to execution. But I failed proof this understanding w...	Does `par` create another thread? Does `par` create another thread? multicore multithreading parallel-processing haskell Control.Monad Control.Parallel Control.Concurrent System.IO.Unsafe Does n-1 a:xs test-par.hs RTS ThreadId Does `par` create another thread? My understanding to par is that it will create a thread in ...	[ 0.002471923828125, 0.004180908203125, -0.00811767578125, 0.0133056640625, 0.009765625, -0.0081787109375, 0.0126953125, -0.010009765625, 0.0012054443359375, -0.037353515625, 0.004119873046875, 0.011962890625, 0.000629425048828125, 0.006744384765625, 0.0068359375, -0.01287841796875, 0....	[ 101790, 2500, 28282, 15700, 86997, 6024, 30854, 3869, 65847, 95103, 63923, 1556, 142508, 27131, 1229, 163812, 17780, 115840, 653, 5759, 10, 425, 7, 3034, 127, 27389, 294, 136719, 568, 71, 100094, 366, 1221, 56458, 71924, 165523, 98869, 18151,...	[ 0.06884765625, 0.2320556640625, 0.17236328125, 0.136474609375, 0.2454833984375, 0.06707763671875, 0.1219482421875, 0.054962158203125, 0.1019287109375, 0.11376953125, 0.040802001953125, 0.07037353515625, 0.16845703125, 0.1170654296875, 0.0183868408203125, 0.099853515625, 0.0693359375,...	embed
34610054_c0	34610054	haskell	0	Title: Haskell how to construct object having dependent types Problem title: Haskell how to construct object having dependent types Tags: dependent-type, haskell Problem: Haskell how to construct object having dependent types I have used type family in the data 'D' to constraint the type of first item in it. Now I need...	Haskell how to construct object having dependent types Haskell how to construct object having dependent types dependent-type haskell Haskell Char Bool ResT intermediate_func Haskell how to construct object having dependent types I have used type family in the data 'D' to constraint the type of first item in it. Now I n...	[ 0.00933837890625, -0.020263671875, -0.0103759765625, 0.005157470703125, 0.01422119140625, -0.00469970703125, -0.02587890625, 0.0038604736328125, -0.0016326904296875, -0.017578125, 0.0005035400390625, -0.038818359375, 0.0281982421875, -0.003662109375, -0.00469970703125, -0.021728515625,...	[ 20625, 142508, 64549, 36746, 19441, 108750, 52895, 50986, 1556, 21656, 2460, 929, 9624, 618, 81814, 2182, 16498, 3642, 11814, 10644, 14449, 2053, 397, 158, 2816, 4288, 5117, 35735, 3871, 28282, 111, 335, 418, 304, 1295, 39210, 32354, 35064, ...	[ 0.1263427734375, 0.1929931640625, 0.19482421875, 0.1932373046875, 0.10614013671875, 0.215576171875, 0.2242431640625, 0.155029296875, 0.1292724609375, 0.106201171875, 0.0701904296875, 0.153564453125, 0.0997314453125, 0.1185302734375, 0.15185546875, 0.045501708984375, 0.092041015625, ...	embed
2302493_c0	2302493	haskell	0	Title: Stack overflow in OCaml and F# but not in Haskell Problem title: Stack overflow in OCaml and F# but not in Haskell Tags: lazy-evaluation, haskell, f%23, ocaml, stack-overflow Problem: Stack overflow in OCaml and F# but not in Haskell I've been comparing for fun different languages for speed in execution of the f...	Stack overflow in OCaml and F# but not in Haskell Stack overflow in OCaml and F# but not in Haskell lazy-evaluation haskell f%23 ocaml stack-overflow Stack OCaml Haskell n-1 List.fold_left float_of_int print_float Stack overflow in OCaml and F# but not in Haskell I've been comparing for fun different languages for spee...	[ -0.0014801025390625, 0.0093994140625, 0.0052490234375, -0.004547119140625, 0.01116943359375, -0.0181884765625, -0.0267333984375, -0.004058837890625, 0.00029754638671875, -0.0224609375, -0.0024261474609375, -0.0076904296875, 0.0042724609375, -0.0184326171875, 0.00482177734375, -0.004364...	[ 6512, 2594, 645, 118664, 180, 105272, 141, 136, 563, 4904, 1284, 959, 23, 20625, 142508, 21, 3285, 159258, 1556, 1238, 3742, 36, 9779, 177261, 5465, 5759, 32036, 42822, 133, 2480, 21917, 257, 4390, 4288, 28412, 52347, 37397, 7477, 12921, ...	[ 0.1552734375, 0.1334228515625, 0.1522216796875, 0.26123046875, 0.112060546875, 0.17333984375, 0.14501953125, 0.068359375, 0.103515625, 0.159423828125, 0.0218505859375, 0.1097412109375, 0.07000732421875, 0.11767578125, 0.1986083984375, 0.05401611328125, 0.1248779296875, 0.1550292968...	embed
45665335_c0	45665335	haskell	0	Title: Struggling with basic experiment printing to stdio Problem title: Struggling with basic experiment printing to stdio Tags: haskell Problem: Struggling with basic experiment printing to stdio Brand new to Haskell and failing to print the date in a simple program. What I'm trying to do: Get the current time from g...	Struggling with basic experiment printing to stdio Struggling with basic experiment printing to stdio haskell System.IO Data.Time.Clock Data.Time.Calendar Struggling Main Integer Date Struggling with basic experiment printing to stdio Brand new to Haskell and failing to print the date in a simple program. What I'm tryi...	[ -0.014892578125, -0.00775146484375, -0.001373291015625, 0.0216064453125, 0.0042724609375, 0.0189208984375, -0.007568359375, 0.0186767578125, -0.00046539306640625, -0.0107421875, -0.0159912109375, -0.0283203125, -0.013427734375, 0.017578125, -0.01031494140625, -0.000446319580078125, 0...	[ 63667, 9815, 2069, 678, 62822, 28007, 2448, 47, 6138, 5670, 1556, 142508, 12353, 17780, 11809, 70059, 21135, 33, 1506, 12321, 44401, 25512, 3525, 20625, 35782, 28412, 5622, 8781, 1528, 31577, 20779, 43581, 1733, 1295, 2046, 474, 15724, 26265,...	[ 0.1082763671875, 0.1038818359375, 0.0245513916015625, 0.0154571533203125, 0.1090087890625, 0.2186279296875, 0.15234375, 0.1123046875, 0.1541748046875, 0.219482421875, 0.1136474609375, 0.2210693359375, 0.07012939453125, 0.1832275390625, 0.09210205078125, 0.22509765625, 0.07421875, 0...	embed
69349244_c0	69349244	haskell	0	Title: How to split a list into two using even and odd positions? Problem title: How to split a list into two using even and odd positions? Tags: haskell Problem: How to split a list into two using even and odd positions? I am trying to split a list into even and odd based on their index/position in the list. For examp...	How to split a list into two using even and odd positions? How to split a list into two using even and odd positions? haskell even How x1:x2:xs Couldn How to split a list into two using even and odd positions? I am trying to split a list into even and odd based on their index/position in the list. For example for the l...	[ -0.0272216796875, 0.027099609375, -0.005462646484375, -0.00823974609375, -0.0186767578125, 0.031494140625, -0.005828857421875, 0.0142822265625, 0.00799560546875, -0.005218505859375, 0.03955078125, -0.001953125, 0.006591796875, 0.0008087158203125, 0.00665283203125, 0.01470947265625, 0...	[ 11249, 47, 65450, 10, 5303, 3934, 6626, 17368, 3853, 136, 70270, 19069, 1556, 142508, 1022, 82825, 425, 304, 12, 191147, 31577, 35509, 63262, 64, 40322, 27781, 155761, 910, 16750, 5608, 186, 2203, 189126, 50740, 3444, 4527, 51515, 18, 46683...	[ 0.11474609375, 0.058837890625, 0.2462158203125, 0.0594482421875, 0.2587890625, 0.17626953125, 0.213134765625, 0.09893798828125, 0.2098388671875, 0.142333984375, 0.2354736328125, 0.1898193359375, 0.1468505859375, 0.217529296875, 0.0518798828125, 0.0704345703125, 0.08245849609375, 0....	embed
10699532_c0	10699532	haskell	0	Title: Why is GHC complaining about non-exhaustive patterns? Problem title: Why is GHC complaining about non-exhaustive patterns? Tags: ghc, non-exhaustive-patterns, haskell Problem: Why is GHC complaining about non-exhaustive patterns? When I compile the following code with GHC (using the -Wall flag): module Main wher...	Why is GHC complaining about non-exhaustive patterns? Why is GHC complaining about non-exhaustive patterns? ghc non-exhaustive-patterns haskell Why GHC Wall Main Tree EmptyTree Node Show Ord test.hs Warning Pattern Patterns Why is GHC complaining about non-exhaustive patterns? When I compile the following code with GHC...	[ -0.0264892578125, -0.0067138671875, 0.018798828125, 0.0004405975341796875, -0.00019168853759765625, 0.0228271484375, -0.038818359375, -0.037841796875, -0.001708984375, -0.0093994140625, 0.01104736328125, -0.024658203125, 0.0052490234375, -0.01373291015625, 0.0167236328125, 0.0162353515...	[ 44084, 527, 73265, 186992, 351, 3355, 18391, 4935, 103510, 31380, 238, 4453, 22766, 1556, 142508, 23706, 12321, 101344, 31678, 939, 62731, 438, 112, 17367, 35379, 3034, 127, 5550, 592, 9876, 1672, 9969, 18151, 198076, 49938, 14858, 214, 18354...	[ 0.1136474609375, 0.08978271484375, 0.1962890625, 0.139404296875, 0.1707763671875, 0.05035400390625, 0.139404296875, 0.0908203125, 0.207275390625, 0.0970458984375, 0.08642578125, 0.1202392578125, 0.09912109375, 0.0772705078125, 0.1446533203125, 0.06951904296875, 0.0343017578125, 0.1...	embed
11942542_c0	11942542	haskell	0	Title: `interact` using Text instead of String Problem title: `interact` using Text instead of String Tags: haskell, lazy-io, text Problem: `interact` using Text instead of String I'd like to rewrite the interact function, but using Text instead of String . Is it possible to use Data.Text and/or Data.Text.Lazy to accom...	`interact` using Text instead of String `interact` using Text instead of String haskell lazy-io text Text Data.Text.Lazy qualified Data.Text LANGUAGE OverloadedStrings T.unlines T.lines `interact` using Text instead of String I'd like to rewrite the interact function, but using Text instead of String . Is it possible t...	[ -0.001861572265625, -0.0123291015625, 0.01348876953125, 0.0155029296875, -0.002960205078125, 0.0137939453125, 0.021484375, 0.0079345703125, -0.01165771484375, -0.0272216796875, -0.004058837890625, 0.002777099609375, -0.007293701171875, 0.007598876953125, 0.013916015625, 0.0208740234375...	[ 10433, 47013, 17368, 24129, 64457, 111, 23351, 214, 1556, 142508, 21, 3285, 846, 7986, 11809, 174379, 2729, 217225, 98064, 9578, 63033, 71713, 384, 309, 59801, 1884, 456, 434, 18781, 78974, 32354, 7722, 4527, 163846, 5701, 123166, 11675, 1528...	[ 0.2022705078125, 0.246826171875, 0.1287841796875, 0.274658203125, 0.168701171875, 0.0224761962890625, 0.1878662109375, 0.0970458984375, 0.10107421875, 0.194580078125, 0.076416015625, 0.1656494140625, 0.121337890625, 0.178955078125, 0.1239013671875, 0.260986328125, 0.1138916015625, ...	embed
75071892_c0	75071892	haskell	0	Title: Check Balance Delimiters Function Haskell Problem title: Check Balance Delimiters Function Haskell Tags: list, haskell, tuples, stack Problem: Check Balance Delimiters Function Haskell I want to write a function where you enter a list of delimiters tuples, and a string, And the function should check if the strin...	Check Balance Delimiters Function Haskell Check Balance Delimiters Function Haskell list haskell tuples stack Check Balance Delimiters Haskell Char Bool c:string elem1 Nothing Just _:string Check Balance Delimiters Function Haskell I want to write a function where you enter a list of delimiters tuples, and a string, An...	[ 0.0123291015625, 0.0159912109375, -0.0181884765625, -0.00177764892578125, 0.004486083984375, 0.02880859375, 0.0106201171875, 0.01092529296875, 0.00079345703125, 0.01531982421875, 0.015625, -0.0014190673828125, 0.00750732421875, -0.01104736328125, -0.007415771484375, 0.0011749267578125,...	[ 38679, 131176, 262, 93343, 1314, 28670, 20625, 142508, 5303, 1556, 370, 99726, 177261, 21656, 2460, 929, 91693, 88, 195, 418, 182747, 9563, 101, 3444, 33022, 32354, 30957, 8, 136, 79315, 5608, 12765, 2174, 40197, 59499, 642, 107730, 30646, ...	[ 0.2017822265625, 0.2822265625, 0.0888671875, 0.2425537109375, 0.1085205078125, 0.1168212890625, 0.126708984375, 0.2091064453125, 0.1119384765625, 0.1055908203125, 0.1044921875, 0.189208984375, 0.1343994140625, 0.10723876953125, 0.03753662109375, 0.0987548828125, 0.156494140625, 0.0...	embed
41748468_c0	41748468	haskell	0	Title: Haskell Stack Local Server Problem title: Haskell Stack Local Server Tags: stackage, haskell, haskell-stack Problem: Haskell Stack Local Server I am behind a firewall with strict rules about downloading software from the internet, so I would like to know if it is possible to download an entire stackage LTS snaps...	Haskell Stack Local Server Haskell Stack Local Server stackage haskell haskell-stack Haskell Stack Local Server Haskell Stack Local Server I am behind a firewall with strict rules about downloading software from the internet, so I would like to know if it is possible to download an entire stackage LTS snapshot in one g...	[ -0.001251220703125, 0.01385498046875, -0.00225830078125, 0.002044677734375, -0.01409912109375, -0.005218505859375, -0.01141357421875, 0.005645751953125, -0.00592041015625, -0.0301513671875, -0.0208740234375, -0.000370025634765625, 0.0234375, 0.0223388671875, 0.0223388671875, 0.01525878...	[ 20625, 142508, 6512, 2594, 24172, 22687, 177261, 4588, 1556, 590, 50155, 221521, 81113, 91736, 7026, 10975, 1295, 1820, 1884, 3714, 2174, 7722, 47, 64194, 339, 12763, 76685, 72697, 1632, 738, 21265, 4000, 10723, 6275, 55516, 7, 10957, 15005, ...	[ 0.1490478515625, 0.265380859375, 0.1954345703125, 0.1722412109375, 0.17724609375, 0.172119140625, 0.24560546875, 0.2225341796875, 0.1435546875, 0.159423828125, 0.122802734375, 0.196044921875, 0.06500244140625, 0.1082763671875, 0.2052001953125, 0.1400146484375, 0.030914306640625, 0....	embed
75458507_c1	75458507	haskell	1	I provide later in this post, why does evalSt e1 terminate, while evalSt e2 doesn't? I can't still understand what's the difference. Language's AST I tried to simplify my AST as much as possible, and this is the most minimal definition I could come up with: data Expr = Int Int \| Negate Expr \| Id String \| Obj (M.Map St...	I provide later in this post, why does evalSt e1 terminate, while evalSt e2 doesn't? I can't still understand what's the difference. Language's AST I tried to simplify my AST as much as possible, and this is the most minimal definition I could come up with: data Expr = Int Int \| Negate Expr \| Id String \| Obj (M.Map St...	[ 0.000553131103515625, -0.02001953125, -0.002349853515625, -0.003936767578125, 0.00787353515625, 0.006256103515625, 0.0057373046875, 0.004364013671875, 0.00194549560546875, -0.0020599365234375, -0.01055908203125, 0.0240478515625, 0.01544189453125, -0.005126953125, 0.01361083984375, 0.00...	[ 22691, 15400, 14602, 28, 1405, 37455, 418, 121011, 13, 12960, 304, 22027, 18, 831, 7464, 28219, 60212, 83658, 48963, 112892, 18929, 2684, 20187, 80934, 2053, 60075, 42, 2203, 360, 127149, 67, 24799, 23351, 214, 3545, 170, 594, 166179, 6496,...	[ 0.050506591796875, 0.116455078125, 0.0260009765625, 0.169677734375, 0.237548828125, 0.2158203125, 0.15283203125, 0.2281494140625, 0.1297607421875, 0.049560546875, 0.178955078125, 0.031005859375, 0.07769775390625, 0.003265380859375, 0.017974853515625, 0.1005859375, 0.140625, 0.17761...	embed
64597733_c0	64597733	haskell	0	Title: Haskell: Sum of last 2 integers in a string Problem title: Haskell: Sum of last 2 integers in a string Tags: string, integer, sum, recursion, haskell Problem: Haskell: Sum of last 2 integers in a string I am new to Haskell and I'm attempting a task in which the result should be the sum of the last two integers i...	Haskell: Sum of last 2 integers in a string Haskell: Sum of last 2 integers in a string string integer sum recursion haskell Haskell Sum Num xs:x Haskell: Sum of last 2 integers in a string I am new to Haskell and I'm attempting a task in which the result should be the sum of the last two integers in a string. I comple...	[ -0.011474609375, 0.0177001953125, 0.0045166015625, 0.0208740234375, -0.0301513671875, 0.040771484375, 0.000020503997802734375, -0.00180816650390625, 0.02880859375, -0.01239013671875, 0.01141357421875, -0.037109375, 0.004547119140625, -0.003753662109375, -0.0036468505859375, 0.005401611...	[ 20625, 142508, 12, 36335, 111, 4568, 116, 892, 26255, 23, 79315, 10, 1505, 10554, 195625, 1830, 1556, 52782, 1022, 7, 425, 3525, 47, 81887, 66211, 16750, 5608, 6626, 64557, 28219, 128512, 66044, 2831, 45258, 5844, 237875, 5117, 36361, 48398...	[ 0.1510009765625, 0.27294921875, 0.046722412109375, 0.2432861328125, 0.119873046875, 0.219970703125, 0.2021484375, 0.1480712890625, 0.1463623046875, 0.0841064453125, 0.22998046875, 0.0305328369140625, 0.053955078125, 0.2159423828125, 0.2021484375, 0.055328369140625, 0.1282958984375, ...	embed
14013538_c1	14013538	haskell	1	fitstate related function it required a MonadIO m constraint on it. Here's the code: https://gist.github.com/4364920 So I decided to create some classes to make this fit together a little better and to clean up the types a little. My goal is to be able to write something like this: myMainRoutineFunc :: (MonadInput t m...	fitstate related function it required a MonadIO m constraint on it. Here's the code: https://gist.github.com/4364920 So I decided to create some classes to make this fit together a little better and to clean up the types a little. My goal is to be able to write something like this: myMainRoutineFunc :: (MonadInput t m...	[ -0.0247802734375, 0.01251220703125, -0.011962890625, 0.00848388671875, 0.0079345703125, 0, 0.014404296875, -0.00543212890625, -0.01177978515625, -0.005157470703125, 0.0096435546875, -0.0135498046875, -0.00537109375, 0.00958251953125, -0.00714111328125, -0.0245361328125, 0.01428222656...	[ 11177, 61340, 62548, 32354, 56065, 60331, 71, 17780, 347, 158, 2816, 4288, 98, 18151, 32102, 28282, 61112, 25842, 11522, 46622, 52895, 69236, 19048, 33022, 1884, 903, 759, 168793, 12724, 34, 10325, 97249, 46674, 712, 4153, 7077, 808, 120962, ...	[ 0.2423095703125, 0.23388671875, 0.119384765625, 0.1763916015625, 0.105712890625, 0.1705322265625, 0.1181640625, 0.1815185546875, 0.121337890625, 0.076171875, 0.169189453125, 0.1307373046875, 0.0045166015625, 0.1044921875, 0.0460205078125, 0.0633544921875, 0.189453125, 0.06311035156...	embed

65440139_c0

65440139

haskell

0

Title: Efficient (O(n^2)) Sieve of Sundaram in Haskell Problem title: Efficient (O(n^2)) Sieve of Sundaram in Haskell Tags: haskell, sieve-algorithm, time-complexity, primes, optimization Problem: Efficient (O(n^2)) Sieve of Sundaram in Haskell There are many answers on SO explaining how to implement the Sieve of Sunda...

Efficient (O(n^2)) Sieve of Sundaram in Haskell Efficient (O(n^2)) Sieve of Sundaram in Haskell haskell sieve-algorithm time-complexity primes optimization Efficient Sieve Sundaram Haskell Integer i..n Efficient (O(n^2)) Sieve of Sundaram in Haskell There are many answers on SO explaining how to implement the Sieve of ...

[ -0.020263671875, 0.01141357421875, 0.01043701171875, 0.006744384765625, 0.01092529296875, 0.004791259765625, -0.010498046875, 0.00885009765625, -0.01324462890625, -0.02880859375, 0.01263427734375, 0.00396728515625, 0.0087890625, -0.0052490234375, -0.0211181640625, 0.01416015625, 0.00...

[ 241, 24500, 45964, 670, 8353, 10461, 727, 272, 111, 96155, 2198, 20625, 142508, 23, 1556, 78, 3134, 100628, 2783, 1733, 44974, 20809, 7, 87235, 44401, 19, 35166, 15969, 73342, 3642, 29479, 6183, 13, 51347, 51592, 4488, 55412, 1810, 101935, ...

[ 0.001312255859375, 0.1572265625, 0.12646484375, 0.17626953125, 0.0638427734375, 0.168701171875, 0.1812744140625, 0.21875, 0.1787109375, 0.149658203125, 0.2529296875, 0.1568603515625, 0.263671875, 0.059478759765625, 0.1253662109375, 0.133056640625, 0.227783203125, 0.05010986328125, ...

embed

35996441_c0

35996441

haskell

0

Title: Error with a quadrant giving function Problem title: Error with a quadrant giving function Tags: function, guard-statement, haskell Problem: Error with a quadrant giving function I tried to make a function to give the quadrant name when inputting the x and y coordinates. However, I am getting the error: "parse e...

Error with a quadrant giving function Error with a quadrant giving function function guard-statement haskell Error Quadrants Origin Quadrant_I Quadrant_II Quadrant_III Quadrant_IV X_Axis_Positive X_Axis_Negative Y_Axis_Positive Y_Axis_Negative Show Float Error with a quadrant giving function I tried to make a function ...

[ -0.00640869140625, 0.009521484375, 0.0002956390380859375, -0.013427734375, 0.0064697265625, -0.0152587890625, 0.0107421875, 0.0037994384765625, -0.0306396484375, 0.01708984375, 0.005828857421875, -0.01324462890625, -0.00147247314453125, -0.007354736328125, -0.003997802734375, -0.004608...

[ 212059, 678, 10, 68587, 660, 68772, 32354, 56050, 61340, 1556, 142508, 83227, 15212, 119862, 568, 10001, 33747, 15583, 1193, 33102, 172, 208, 4935, 990, 6433, 17367, 38699, 257, 37842, 8337, 9351, 107730, 1022, 136, 113, 176866, 18499, 2500, ...

[ 0.195556640625, 0.1673583984375, 0.0767822265625, 0.27587890625, 0.2003173828125, 0.1839599609375, 0.2125244140625, 0.209228515625, 0.1273193359375, 0.1290283203125, 0.218505859375, 0.19775390625, 0.189208984375, 0.1805419921875, 0.034576416015625, 0.056640625, 0.10107421875, 0.141...

embed

15927000_c0

15927000

haskell

0

Title: Haskell type definition, => etc Problem title: Haskell type definition, => etc Tags: haskell Problem: Haskell type definition, => etc I am learning Haskell using Learn You a Haskell. On page 54 is an implementation of take like so: take' :: (Num i, Ord i) => i -> [a] -> [a] take' n _ | n <= 0 = [] take' _ ...

Haskell type definition, => etc Haskell type definition, => etc haskell Haskell Num Ord x:xs n-1 Haskell type definition, => etc I am learning Haskell using Learn You a Haskell. On page 54 is an implementation of take like so: I understand all the code apart from the first line. The :: part I understand as meanin...

[ 0.0027313232421875, -0.004638671875, 0.0196533203125, 0.00970458984375, -0.007476806640625, 0.02001953125, -0.00408935546875, 0.00121307373046875, 0.0045166015625, 0.00250244140625, 0.0113525390625, -0.04052734375, -0.00677490234375, -0.01263427734375, -0.0262451171875, -0.008117675781...

[ 20625, 142508, 10644, 80934, 2203, 5386, 3021, 1556, 52782, 35379, 1022, 12, 425, 7, 5759, 44357, 52080, 134031, 8983, 208124, 5646, 1884, 221, 28219, 18151, 1984, 2831, 91084, 903, 839, 316, 17, 4, 83, 370, 8705, 5117, 12830, 54744, 238,...

[ 0.1409912109375, 0.206787109375, 0.23046875, 0.1649169921875, 0.08160400390625, 0.035491943359375, 0.01055908203125, 0.1181640625, 0.1239013671875, 0.1597900390625, 0.059814453125, 0.004119873046875, 0.0333251953125, 0.013031005859375, 0.1195068359375, 0.04083251953125, 0.00228881835...

embed

43404290_c0

43404290

haskell

0

Title: A List of Recursive Data Structure as Function Input Problem title: A List of Recursive Data Structure as Function Input Tags: haskell, types Problem: A List of Recursive Data Structure as Function Input I defined a recursive data structure in Haskell: data NestedList a = Element a | SubList [NestedList a] and t...

A List of Recursive Data Structure as Function Input A List of Recursive Data Structure as Function Input haskell types List Recursive Data Structure Input NestedList Element SubList Output x:xs A List of Recursive Data Structure as Function Input I defined a recursive data structure in Haskell: and then I want to defi...

[ -0.0220947265625, 0.0242919921875, 0.0113525390625, -0.0107421875, 0.0166015625, 0.02490234375, -0.0040283203125, -0.00061798095703125, 0.0006866455078125, -0.01220703125, -0.0027618408203125, -0.03564453125, 0.000469207763671875, 0.0211181640625, -0.005279541015625, -0.00335693359375,...

[ 32036, 853, 48650, 5844, 11809, 63667, 238, 6644, 237, 28670, 10763, 360, 1556, 142508, 52895, 28701, 71, 154663, 48325, 8273, 13538, 12, 425, 61924, 195625, 2053, 45646, 20625, 49878, 510, 32354, 5646, 5303, 30646, 16750, 27781, 80934, 959, ...

[ 0.1357421875, 0.08935546875, 0.1881103515625, 0.1475830078125, 0.1119384765625, 0.1650390625, 0.11181640625, 0.05029296875, 0.085205078125, 0.1383056640625, 0.044097900390625, 0.1217041015625, 0.107666015625, 0.2449951171875, 0.1571044921875, 0.1966552734375, 0.09130859375, 0.18859...

embed

64721704_c0

64721704

haskell

0

Title: Parameters in anonymous function Problem title: Parameters in anonymous function Tags: lambda, haskell, anonymous-function Problem: Parameters in anonymous function I've been practicing with anonymous functions and got the following: takeWhile' :: (a -> Bool) -> [a] -> [a] takeWhile' f xs = foldl (\x y z -> if (...

Parameters in anonymous function Parameters in anonymous function lambda haskell anonymous-function Parameters Bool Occurs Parameters in anonymous function I've been practicing with anonymous functions and got the following: which is basically a rewrite of the takeWhile function already in Haskell. For those who don't ...

[ 0.00101470947265625, 0.007354736328125, -0.0020904541015625, 0.0150146484375, 0.0030517578125, 0.01422119140625, 0.0067138671875, 0.01202392578125, 0.00616455078125, -0.0218505859375, 0.0115966796875, -0.01312255859375, -0.001617431640625, 0.00994873046875, 0.00457763671875, -0.0163574...

[ 1720, 29089, 52184, 10821, 32354, 23, 6492, 85, 1556, 142508, 137175, 2460, 929, 180, 238, 48650, 74082, 456, 434, 18781, 5646, 1456, 979, 133, 21771, 20625, 51776, 5303, 136, 30646, 11907, 12830, 40407, 98320, 26785, 138, 10750, 1022, 113,...

[ 0.10406494140625, 0.1708984375, 0.2174072265625, 0.146728515625, 0.1864013671875, 0.0151214599609375, 0.1326904296875, 0.0665283203125, 0.101806640625, 0.2486572265625, 0.16064453125, 0.06982421875, 0.1866455078125, 0.024322509765625, 0.03936767578125, 0.12646484375, 0.03765869140625...

embed

10790647_c0

10790647

haskell

0

Title: Shift reduce conflicts in happy grammar Problem title: Shift reduce conflicts in happy grammar Tags: yacc, haskell, grammar, happy Problem: Shift reduce conflicts in happy grammar Hello good programmers, I have built following grammar in happy (haskell): P : program C {Prog $2} E : int {Num $1} | ident {Id $1} |...

Shift reduce conflicts in happy grammar Shift reduce conflicts in happy grammar yacc haskell grammar happy Shift Prog Num BoolConst ReadInput Parens Add Sub Mult Div Assign Cond OutputComm While Declare Seq DSeq Shift reduce conflicts in happy grammar Hello good programmers, I have built following grammar in happy (has...

[ 0.000392913818359375, -0.012451171875, 0.0142822265625, 0.01190185546875, -0.00555419921875, -0.0152587890625, -0.036376953125, 0.00151824951171875, 0.00067138671875, -0.00677490234375, 0.017822265625, 0.00787353515625, -0.0093994140625, -0.0252685546875, 0.00701904296875, 0.0044555664...

[ 8294, 2480, 34390, 79612, 7, 17723, 122092, 147, 151, 10060, 1556, 142508, 1250, 52782, 929, 11935, 271, 4764, 2392, 1755, 29117, 8273, 81212, 53026, 31304, 1657, 71, 13538, 10770, 51404, 25755, 38103, 864, 77848, 88303, 25632, 10557, 40956, ...

[ 0.1851806640625, 0.1798095703125, 0.17919921875, 0.1859130859375, 0.04864501953125, 0.2401123046875, 0.149169921875, 0.1256103515625, 0.0662841796875, 0.07672119140625, 0.08837890625, 0.190673828125, 0.039642333984375, 0.074462890625, 0.05853271484375, 0.0394287109375, 0.008697509765...

embed

15005670_c0

15005670

haskell

0

Title: Why is there no implicit parallelism in Haskell? Problem title: Why is there no implicit parallelism in Haskell? Tags: parallel-processing, haskell, concurrency, compiler-optimization Problem: Why is there no implicit parallelism in Haskell? Haskell is functional and pure, so basically it has all the properties ...

Why is there no implicit parallelism in Haskell? Why is there no implicit parallelism in Haskell? parallel-processing haskell concurrency compiler-optimization a Why Haskell Just Why is there no implicit parallelism in Haskell? Haskell is functional and pure, so basically it has all the properties needed for a compiler...

[ -0.005157470703125, 0.0233154296875, 0.00005698204040527344, 0.01129150390625, -0.0032196044921875, 0.020263671875, 0.00147247314453125, -0.0177001953125, -0.01251220703125, -0.017333984375, -0.0054931640625, 0.002471923828125, -0.004791259765625, 0.0078125, 0.006103515625, 0.005035400...

[ 44084, 83, 2685, 110, 165164, 95103, 8780, 23, 20625, 142508, 63923, 1556, 108636, 982, 9969, 34759, 100433, 123309, 136, 34166, 183871, 44841, 19048, 36461, 133, 27781, 34702, 2227, 71924, 1830, 1774, 151552, 6044, 29479, 49938, 58827, 192, ...

[ 0.119873046875, 0.044586181640625, 0.07147216796875, 0.1160888671875, 0.25244140625, 0.2459716796875, 0.1656494140625, 0.0638427734375, 0.1470947265625, 0.25830078125, 0.03643798828125, 0.1259765625, 0.0849609375, 0.033843994140625, 0.1392822265625, 0.137451171875, 0.06787109375, 0...

embed

15235979_c0

15235979

haskell

0

Title: haskell print multiple variables by pattern Problem title: haskell print multiple variables by pattern Tags: haskell Problem: haskell print multiple variables by pattern I started writing answers to project euler problems in Haskell like so problem1 = ... problem2 = ... to display them all together I've been usi...

haskell print multiple variables by pattern haskell print multiple variables by pattern haskell ghci problem1 problem2 haskell print multiple variables by pattern I started writing answers to project euler problems in Haskell like so to display them all together I've been using something like this Is there a way to do ...

[ -0.00457763671875, 0.0023345947265625, -0.0177001953125, 0.031005859375, -0.01220703125, 0.0140380859375, -0.01092529296875, 0.00482177734375, 0.0242919921875, -0.021728515625, -0.0003566741943359375, -0.019287109375, 0.0120849609375, -0.006103515625, -0.0037078857421875, 0.00729370117...

[ 1556, 142508, 28412, 48716, 77336, 390, 103510, 31380, 318, 2967, 418, 304, 7, 32562, 35166, 13452, 1175, 603, 44402, 20625, 1884, 44116, 756, 25842, 17368, 3917, 54, 15490, 43658, 452, 1916, 13204, 111789, 347, 617, 63134, 21011, 3900, 193...

[ 0.1572265625, 0.22314453125, 0.2081298828125, 0.2152099609375, 0.24658203125, 0.135009765625, 0.264892578125, 0.07110595703125, 0.099609375, 0.1468505859375, 0.009765625, 0.003753662109375, 0.033416748046875, 0.0689697265625, 0.12353515625, 0.0941162109375, 0.074462890625, 0.165649...

embed

50852592_c0

50852592

haskell

0

Title: Looking for a function similar sequenceA Problem title: Looking for a function similar sequenceA Tags: applicative, haskell Problem: Looking for a function similar sequenceA Tying to learn more about applicatives. I have the following definitions: class Applicative' f where pack :: a -> f a unpack :: f a -> a in...

Looking for a function similar sequenceA Looking for a function similar sequenceA applicative haskell Looking Applicative Box Bag Basket pack1 pack2 Looking for a function similar sequenceA Tying to learn more about applicatives. I have the following definitions: What I am looking for is a way generalise this concept (...

[ 0.0284423828125, 0.016845703125, -0.008056640625, 0.03125, -0.000705718994140625, 0.00604248046875, 0.0150146484375, 0.02294921875, 0.017333984375, -0.0084228515625, 0.003936767578125, 0.006439208984375, -0.00518798828125, 0.030517578125, -0.005523681640625, 0.000484466552734375, 0.0...

[ 157268, 100, 32354, 21373, 40, 944, 3956, 284, 41816, 4935, 1556, 142508, 5659, 11048, 27271, 19413, 152327, 43824, 418, 304, 8064, 30698, 42991, 80934, 16487, 3917, 4537, 3075, 23755, 7722, 4527, 11782, 3060, 919, 19, 25632, 69307, 20625 ]

[ 0.14453125, 0.090087890625, 0.2144775390625, 0.2216796875, 0.0721435546875, 0.1297607421875, 0.07415771484375, 0.1527099609375, 0.1973876953125, 0.133544921875, 0.117431640625, 0.250244140625, 0.10504150390625, 0.156494140625, 0.134521484375, 0.171630859375, 0.196044921875, 0.19104...

embed

43944647_c1

43944647

haskell

1

0, 0] tW = transpose ws w = take 4 $ tail $ cycle $ last tW get wss x y = (wss !! y) !! x print' = print . w128 . concat . transpose where w128 = concatMap (f . (`showHex` "")) f w = (length w < 2) ? (' ':'0':w, ' ':w) grid _ [] = [] grid n xs = take n xs : grid n (drop n xs) nibs w = (shiftR (w .&. 0xF0) 4, w .&. 0x0F...

[ -0.011962890625, 0.0157470703125, 0.0011444091796875, -0.0191650390625, -0.0299072265625, -0.0240478515625, 0.001007080078125, -0.01116943359375, 0.002166748046875, 0.0299072265625, 0.01171875, 0.05322265625, 0.0142822265625, 0.0040283203125, -0.0281982421875, 0.0038909912109375, 0.0...

[ 757, 808, 1456, 2203, 3900, 78381, 148, 7, 5646, 201, 3650, 46741, 105823, 4568, 2046, 1022, 113, 19725, 6506, 28412, 81764, 158, 4460, 166179, 420, 31374, 841, 3355, 1238, 23986, 4426, 4958, 2389, 434, 120067, 653, 138810, 300, 16145, 37...

[ 0.148193359375, 0.107666015625, 0.1983642578125, 0.03143310546875, 0.1824951171875, 0.2191162109375, 0.165283203125, 0.102783203125, 0.16650390625, 0.193115234375, 0.039642333984375, 0.2225341796875, 0.2347412109375, 0.12255859375, 0.062255859375, 0.05401611328125, 0.11865234375, 0...

embed

67419452_c0

67419452

haskell

0

Title: Haskell Esqueleto: perform join on list of values using "with" Problem title: Haskell Esqueleto: perform join on list of values using "with" Tags: haskell, esqueleto Problem: Haskell Esqueleto: perform join on list of values using "with" I am trying to do a join on a list of values known befo...

Haskell Esqueleto: perform join on list of values using "with" Haskell Esqueleto: perform join on list of values using "with" haskell esqueleto $ Haskell Esqueleto SkuId Double InnerJoin Table Price PriceSku PriceValue Haskell Esqueleto: perform join on list of values using "with" I am trying to do ...

[ -0.0081787109375, 0.01104736328125, 0.004730224609375, -0.0029296875, -0.00732421875, -0.00186920166015625, -0.0179443359375, 0.01171875, 0.01470947265625, -0.015869140625, 0.00347900390625, 0.0262451171875, 0.006378173828125, 0.0038909912109375, -0.009033203125, 0.01904296875, 0.015...

[ 20625, 142508, 1184, 37631, 31580, 51339, 33284, 98, 5303, 111, 142424, 17368, 76228, 1230, 1556, 66660, 133, 188, 3650, 46605, 568, 71, 107172, 137657, 16604, 112997, 48025, 319, 856, 31577, 54, 51529, 8108, 12336, 27781, 2046, 112034, 100, ...

[ 0.1033935546875, 0.209716796875, 0.0694580078125, 0.1488037109375, 0.1956787109375, 0.1923828125, 0.257080078125, 0.107666015625, 0.2086181640625, 0.010986328125, 0.2291259765625, 0.040496826171875, 0.280517578125, 0.0162353515625, 0.109375, 0.1309814453125, 0.134521484375, 0.15747...

embed

24712273_c1

24712273

haskell

1

the same input. The idea is to replace something like (map f xs, map g xs) with let ys = map (\ x -> (f x, g x)) xs in (map fst ys, map snd ys) If traversing ys is much cheaper than traversing xs (e.g. if xs is a file on the network) or if we can e.g. use producer-consumer fusion to later fuse the untagging with some ...

[ 0.0206298828125, -0.0123291015625, 0.0174560546875, -0.018310546875, -0.004241943359375, -0.0072021484375, -0.0390625, -0.0198974609375, 0.006378173828125, 0.006195068359375, -0.01007080078125, -0.003997802734375, 0.024658203125, 0.0118408203125, -0.01708984375, -0.0169677734375, -0....

[ 70, 5701, 107730, 6528, 83, 47, 91995, 1884, 62346, 1238, 1022, 7, 22288, 706, 678, 2633, 113, 2203, 33079, 420, 23, 271, 37317, 5045, 64720, 56, 11435, 33120, 2174, 4527, 108558, 25553, 316, 119485, 57574, 13, 51, 102, 36659, 19916, 9,...

[ 0.07958984375, 0.1727294921875, 0.23193359375, 0.1356201171875, 0.043548583984375, 0.01629638671875, 0.1468505859375, 0.0245819091796875, 0.1497802734375, 0.044158935546875, 0.1444091796875, 0.0980224609375, 0.1710205078125, 0.05426025390625, 0.01153564453125, 0.1361083984375, 0.1546...

embed

19326208_c0

19326208

haskell

0

Title: Haskell Src Exts Parsing Multiple Statements Problem title: Haskell Src Exts Parsing Multiple Statements Tags: ghc, ghci, haskell-src-exts, haskell, parsing Problem: Haskell Src Exts Parsing Multiple Statements I would like to parse a list of Haskell statements. For instance, suppose I have the following code: l...

Haskell Src Exts Parsing Multiple Statements Haskell Src Exts Parsing Multiple Statements ghc ghci haskell-src-exts haskell parsing Haskell Src Exts Parsing Multiple Statements ParseResult Stmt ParseOk Haskell Src Exts Parsing Multiple Statements I would like to parse a list of Haskell statements. For instance, suppose...

[ 0.000827789306640625, 0.002716064453125, -0.018310546875, 0.015380859375, -0.0086669921875, 0.00518798828125, -0.00106048583984375, -0.0250244140625, 0.0064697265625, -0.0296630859375, -0.009765625, -0.03564453125, 0.0022430419921875, 0.001922607421875, -0.00146484375, 0.019287109375, ...

[ 20625, 142508, 159, 19437, 5443, 933, 2392, 19335, 8705, 22836, 6953, 31380, 238, 318, 1556, 3355, 366, 184, 7, 7136, 18, 73852, 9035, 1884, 5303, 63805, 18151, 32354, 37455, 39, 30646, 9384, 24124, 43240, 11001, 10644, 23351, 1974, 10, 2...

[ 0.138916015625, 0.2425537109375, 0.0259857177734375, 0.21142578125, 0.155029296875, 0.12060546875, 0.1649169921875, 0.17236328125, 0.1009521484375, 0.2193603515625, 0.003631591796875, 0.042816162109375, 0.007415771484375, 0.035888671875, 0.114501953125, 0.134765625, 0.17578125, 0.1...

embed

7208559_c0

7208559

haskell

0

Title: HXT: Surprising behavior when reading and writing HTML to String in pure code Problem title: HXT: Surprising behavior when reading and writing HTML to String in pure code Tags: haskell, hxt Problem: HXT: Surprising behavior when reading and writing HTML to String in pure code I want to read HTML from a String, p...

HXT: Surprising behavior when reading and writing HTML to String in pure code HXT: Surprising behavior when reading and writing HTML to String in pure code haskell hxt HXT Surprising HTML Bogus Some HXT: Surprising behavior when reading and writing HTML to String in pure code I want to read HTML from a String, process ...

[ -0.0003948211669921875, 0.0242919921875, -0.01336669921875, -0.004669189453125, -0.003753662109375, -0.0079345703125, 0.01483154296875, -0.0107421875, 0.00482177734375, 0.007720947265625, 0.006500244140625, 0.0081787109375, -0.033447265625, -0.00070953369140625, 0.0322265625, -0.015869...

[ 572, 70981, 8018, 22876, 214, 123166, 16454, 136, 32562, 19097, 47, 23351, 23, 34166, 18151, 1556, 142508, 1096, 29062, 114651, 7, 31384, 3444, 12301, 1295, 9433, 30646, 98816, 12937, 237, 10, 41018, 64209, 17780, 43257, 71924, 70, 1172, 15...

[ 0.1365966796875, 0.272705078125, 0.05523681640625, 0.10009765625, 0.107177734375, 0.133544921875, 0.144775390625, 0.02947998046875, 0.115234375, 0.261474609375, 0.09808349609375, 0.165283203125, 0.03472900390625, 0.1468505859375, 0.1614990234375, 0.1007080078125, 0.189697265625, 0....

embed

48066295_c2

48066295

haskell

2

-1.0.0.7-KGBP1BSKxH5GCm0LnZP04j Process exited with code: ExitFailure 1 Logs have been written to: /home/ian/.stack/global-project/.stack-work/logs/old-time-1.1.0.3.log [1 of 2] Compiling Main ( /tmp/stack23769/old-time-1.1.0.3/Setup.hs, /tmp/stack23769/old-time-1.1.0.3/.stack-work/dist/x86_64-linux-tinfo6-nopie/Cabal-...

[ -0.01116943359375, 0.01220703125, 0.015625, -0.01251220703125, -0.00089263916015625, -0.0013580322265625, -0.03173828125, -0.016357421875, -0.006591796875, 0.005889892578125, -0.021484375, -0.006988525390625, 0.0029144287109375, 0.0018463134765625, 0.002532958984375, 0.004638671875, ...

[ 20, 102107, 134926, 45214, 56861, 10762, 74800, 7709, 170, 123996, 82230, 297, 678, 18151, 5443, 217, 17647, 379, 3408, 106, 13146, 7, 59121, 47, 29552, 3378, 590, 2594, 156566, 95322, 18244, 4867, 18345, 6032, 92134, 170179, 116, 15612, 49...

[ 0.0009765625, 0.1517333984375, 0.2156982421875, 0.045135498046875, 0.1080322265625, 0.049560546875, 0.0450439453125, 0.0631103515625, 0.10723876953125, 0.2247314453125, 0.2484130859375, 0.10662841796875, 0.121337890625, 0.22900390625, 0.15625, 0.1492919921875, 0.1522216796875, 0.11...

embed

54618771_c1

54618771

haskell

1

<> fg green <> (text.pack.show) item in the function 'runMonitoringCommand', I want somehow to add 2 parameters to (displayCallResult currentStep), can we do that ? instead of repeating the "displayCallResult currentStep" like this : runMonitoringCommand :: forall stepType. MonitoringCommand -> Step stepType -> Client...

[ -0.02099609375, -0.0003814697265625, -0.0023651123046875, 0.018310546875, 0.04150390625, 0.007293701171875, 0.0009765625, -0.0283203125, 0.0103759765625, 0.00994873046875, 0.0283203125, 0.006805419921875, -0.016357421875, 0.012939453125, -0.0140380859375, 0.0106201171875, -0.00927734...

[ 1238, 177, 50997, 22829, 29102, 31374, 35735, 32354, 16428, 46674, 26111, 214, 10770, 12018, 3444, 209303, 15190, 116, 171859, 47, 3827, 20706, 441, 5584, 4332, 7, 7136, 43581, 191644, 831, 642, 54, 64457, 119140, 11675, 29954, 196707, 49570,...

[ 0.008270263671875, 0.0113525390625, 0.1517333984375, 0.152099609375, 0.201904296875, 0.1209716796875, 0.196533203125, 0.13037109375, 0.166748046875, 0.149169921875, 0.214111328125, 0.10400390625, 0.1473388671875, 0.21826171875, 0.100341796875, 0.07275390625, 0.164306640625, 0.18298...

embed

73614548_c1

73614548

haskell

1

b | ^ /var/tmp/demo/src/Lib.hs:23:17: error: • Couldn't match type ‘a0 -> a0’ with ‘Int’ Expected: Maybe Int Actual: Maybe (a0 -> a0) • In the second argument of ‘isJust'’, namely ‘c’ In a stmt of a 'do' block: isJust' "c" c In the expression: do let warn = tell . (: []) a = ... .... isJust' "a" a isJust' "b" b isJust...

[ -0.011474609375, 0.00726318359375, -0.00177001953125, -0.006011962890625, 0.01458740234375, 0.021240234375, 0.00157928466796875, -0.00145721435546875, -0.0033416748046875, -0.00830078125, -0.009765625, -0.014892578125, 0.0023193359375, -0.01043701171875, 0.006103515625, -0.02392578125,...

[ 876, 1961, 2676, 80750, 19437, 104820, 127, 7, 24864, 22950, 18499, 191147, 18, 14858, 10644, 11, 2389, 33079, 10, 678, 4153, 60075, 13, 83425, 360, 100582, 77495, 17932, 10750, 164, 127794, 110987, 238, 6138, 39, 111, 246, 46389, 83, 501...

[ 0.05126953125, 0.054351806640625, 0.1326904296875, 0.2003173828125, 0.088134765625, 0.148193359375, 0.0821533203125, 0.03131103515625, 0.1021728515625, 0.1314697265625, 0.1563720703125, 0.1005859375, 0.087646484375, 0.19482421875, 0.2225341796875, 0.050048828125, 0.1148681640625, 0...

embed

46799237_c0

46799237

haskell

0

Title: How do I create a Storable instance for a recursive type? Problem title: How do I create a Storable instance for a recursive type? Tags: binding, ffi, storable, haskell, c Problem: How do I create a Storable instance for a recursive type? I have the following data type in a Haskell module and I would like to wri...

How do I create a Storable instance for a recursive type? How do I create a Storable instance for a recursive type? binding ffi storable haskell c How Storable MyType TypeDouble Double TypeLst TypeAdd How do I create a Storable instance for a recursive type? I have the following data type in a Haskell module and I woul...

[ -0.003662109375, 0.00141143798828125, -0.00119781494140625, 0.01312255859375, 0.0025787353515625, 0.0272216796875, 0.01336669921875, 0.00445556640625, 0.02294921875, -0.01007080078125, 0.000858306884765625, -0.034912109375, 0.003509521484375, -0.000457763671875, 0.00860595703125, 0.004...

[ 11249, 87, 28282, 23604, 2886, 110527, 100, 195625, 5844, 10644, 54, 10, 128239, 24500, 3082, 1556, 142508, 501, 2646, 196707, 60457, 34, 2661, 107172, 271, 4028, 25632, 2053, 20625, 88996, 1884, 33022, 23, 590, 329, 4527, 678, 313, 1829, ...

[ 0.075927734375, 0.005401611328125, 0.186767578125, 0.24951171875, 0.26123046875, 0.2978515625, 0.088134765625, 0.257080078125, 0.1829833984375, 0.236328125, 0.0244140625, 0.0550537109375, 0.1409912109375, 0.176513671875, 0.214111328125, 0.1260986328125, 0.2408447265625, 0.087951660...

embed

47367148_c0

47367148

haskell

0

Title: Haskell custom style instance show for Data type with list Problem title: Haskell custom style instance show for Data type with list Tags: haskell Problem: Haskell custom style instance show for Data type with list I'm trying to create a instance Show for my data type Family with the following structure: x y1 y2...

Haskell custom style instance show for Data type with list Haskell custom style instance show for Data type with list haskell Data.List Haskell Data Family Char Read Show Couldn Haskell custom style instance show for Data type with list I'm trying to create a instance Show for my data type Family with the following str...

[ -0.00433349609375, -0.01806640625, 0.0028076171875, 0.024658203125, -0.00921630859375, 0.00006198883056640625, 0.0216064453125, -0.00323486328125, 0.02099609375, 0.0167236328125, -0.010009765625, -0.0228271484375, 0.00970458984375, -0.01043701171875, -0.0140380859375, -0.00347900390625...

[ 20625, 142508, 114122, 20623, 110527, 7639, 100, 11809, 10644, 678, 5303, 1556, 154663, 59745, 21656, 4764, 17367, 191147, 19, 31577, 28282, 2053, 25632, 45646, 272, 1257, 903, 18499, 30022, 3871 ]

[ 0.1114501953125, 0.2056884765625, 0.165771484375, 0.2296142578125, 0.205322265625, 0.1865234375, 0.0400390625, 0.1373291015625, 0.1922607421875, 0.08349609375, 0.1944580078125, 0.09320068359375, 0.13037109375, 0.11279296875, 0.1854248046875, 0.1796875, 0.194580078125, 0.07611083984...

embed

47969861_c1

47969861

haskell

1

allCasesST 0 st 0 main = do putStrLn . show $ M.lookup 0 allCases return () The following are profiling results. 2,754,242,472 bytes allocated in the heap 2,095,063,056 bytes copied during GC 788,992,504 bytes maximum residency (23 sample(s)) 3,087,880 bytes maximum slop 815 MB total memory in use (0 MB lost due to fr...

[ -0.005828857421875, -0.005615234375, -0.003143310546875, -0.01611328125, 0.0150146484375, -0.02001953125, 0.005340576171875, -0.004791259765625, 0.00592041015625, -0.044677734375, 0.0181884765625, 0.0147705078125, -0.0016326904296875, 0.0050048828125, 0.0296630859375, 0.00958251953125,...

[ 756, 20370, 5908, 8545, 757, 6138, 5201, 2203, 54, 3884, 71713, 866, 19, 6, 7639, 3650, 276, 64747, 2037, 30646, 16, 581, 25632, 621, 9468, 214, 50339, 5, 111877, 12338, 4, 2357, 304, 170544, 390, 1636, 144, 116292, 297, 23, 764, 2631...

[ 0.20654296875, 0.2305908203125, 0.1690673828125, 0.2191162109375, 0.109619140625, 0.085693359375, 0.1324462890625, 0.029693603515625, 0.036163330078125, 0.1553955078125, 0.11865234375, 0.0225982666015625, 0.047271728515625, 0.009429931640625, 0.120849609375, 0.0665283203125, 0.107543...

embed

69818263_c1

69818263

haskell

1

(runMigration migrateAll) pool pool runAction :: MoinadUnliftIO m => Db m a -> m a runAction action = runSqlPool action dbPool This one doesn't compile and I get the following error message: No instance for (Monad Pool) arising from a do statement In a stmt of a 'do' block: pool <- createSqlitPool dbFileName 5 Can som...

[ -0.00604248046875, 0.00634765625, -0.0191650390625, -0.0069580078125, -0.0027008056640625, 0.0162353515625, -0.006805419921875, -0.0283203125, 0.030517578125, -0.0269775390625, 0.01043701171875, -0.0093994140625, 0.00139617919921875, -0.008544921875, -0.0030517578125, 0.0137939453125, ...

[ 16428, 594, 872, 30494, 39666, 67, 43512, 19361, 11675, 284, 10763, 32129, 9169, 14256, 104501, 17780, 347, 275, 10, 22631, 99247, 7192, 929, 40041, 22027, 18, 9969, 1340, 25632, 18499, 26008, 438, 110527, 100, 46674, 712, 56718, 187, 72219...

[ 0.1246337890625, 0.05462646484375, 0.1405029296875, 0.060760498046875, 0.2071533203125, 0.157470703125, 0.148681640625, 0.211669921875, 0.117919921875, 0.1129150390625, 0.1453857421875, 0.11181640625, 0.1318359375, 0.050384521484375, 0.225830078125, 0.171875, 0.0970458984375, 0.017...

embed

70100714_c0

70100714

haskell

0

Title: How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? Problem title: How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? Tags: haskell Problem: How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? The following code type Bo...

How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? How to fix ambiguous type variables without enabling LANGUAGE AllowAmbiguousTypes? haskell the How LANGUAGE AllowAmbiguousTypes Board Position Char Could Game.hs:34:13-39 How to fix ambiguous type variables without enabling LANGUAGE Allo...

[ -0.000415802001953125, -0.00360107421875, -0.0027618408203125, 0.0126953125, 0.0203857421875, -0.0166015625, -0.004669189453125, 0.027587890625, 0.00347900390625, -0.006103515625, 0.00152587890625, -0.01171875, 0.01422119140625, 0.00127410888671875, -0.0113525390625, -0.0072021484375, ...

[ 11249, 30022, 920, 12282, 10821, 10644, 77336, 15490, 98064, 75930, 41566, 150567, 196707, 1556, 142508, 62554, 99428, 21656, 191147, 13547, 9323, 25632, 18151, 100, 19336, 6712, 20662, 76199, 18499, 31089, 4488, 154107, 8668, 22062, 4358 ]

[ 0.031005859375, 0.1705322265625, 0.1470947265625, 0.187744140625, 0.0562744140625, 0.1492919921875, 0.211669921875, 0.0885009765625, 0.1019287109375, 0.05706787109375, 0.0626220703125, 0.09771728515625, 0.1466064453125, 0.05157470703125, 0.1507568359375, 0.1353759765625, 0.1295166015...

embed

26370141_c0

26370141

haskell

0

Title: Type failure when using 'left' Lens from fclabels Problem title: Type failure when using 'left' Lens from fclabels Tags: haskell, lenses Problem: Type failure when using 'left' Lens from fclabels I've made a minimal example for testing out fclabels. Using a lens to retrieve a 'right' value fr...

Type failure when using 'left' Lens from fclabels Type failure when using 'left' Lens from fclabels haskell lenses fclabels Data.Label Data.Label.Base a Type Lens Label Right Will Label.hs:5:12 Control.Arrow.ArrowZero Data.Label.Point.Total Possible Failed Tested fclabels-2.0.2 Type failure when usi...

[ 0.00213623046875, -0.01043701171875, 0.0047607421875, -0.014404296875, -0.0205078125, -0.0113525390625, -0.003997802734375, -0.0067138671875, -0.00101470947265625, -0.0106201171875, 0.007781982421875, -0.01953125, -0.0010528564453125, -0.01336669921875, 0.0208740234375, -0.02197265625,...

[ 60457, 137578, 17368, 3768, 2480, 18226, 7, 1295, 140443, 152526, 1556, 142508, 96, 47754, 11809, 2729, 4063, 63473, 129214, 90911, 20255, 758, 20927, 27131, 7614, 15555, 1511, 4036, 147534, 115861, 190355, 8647, 133684, 133, 20187, 27781, 1342...

[ 0.1845703125, 0.2113037109375, 0.0718994140625, 0.02215576171875, 0.138427734375, 0.172607421875, 0.040374755859375, 0.06494140625, 0.10260009765625, 0.25830078125, 0.0855712890625, 0.1865234375, 0.0938720703125, 0.0814208984375, 0.043914794921875, 0.0147857666015625, 0.1778564453125...

embed

38905737_c0

38905737

haskell

0

Title: Why does function composition require parentheses? Problem title: Why does function composition require parentheses? Tags: haskell, function-composition, operator-precedence, syntax Problem: Why does function composition require parentheses? Let's say I want to compose Text.pack with Text.strip . :t (.) produces...

Why does function composition require parentheses? Why does function composition require parentheses? haskell function-composition operator-precedence syntax parentheses it Why Text.pack Text.strip Text strip.pack Couldn Relevant Possible Why does function composition require parentheses? Let's say I want to compose Te...

[ 0.01336669921875, -0.0047607421875, 0.01025390625, 0.042236328125, -0.0130615234375, 0.0164794921875, -0.0040283203125, -0.0009918212890625, -0.00823974609375, -0.0016326904296875, 0.01165771484375, 0.0013427734375, -0.0076904296875, -0.0012664794921875, 0.00921630859375, -0.0067443847...

[ 44084, 32354, 166577, 64209, 49129, 35412, 90, 1556, 142508, 277, 40322, 39933, 4692, 37534, 6002, 86531, 442, 24129, 29102, 59623, 43613, 191147, 133, 30624, 115861, 3444, 150350, 678, 18, 27489, 501, 174379, 23351, 161740, 100, 876, 13480, ...

[ 0.0911865234375, 0.1875, 0.2418212890625, 0.1434326171875, 0.16796875, 0.183349609375, 0.121337890625, 0.0933837890625, 0.2139892578125, 0.113525390625, 0.1160888671875, 0.12451171875, 0.02081298828125, 0.0777587890625, 0.03411865234375, 0.0576171875, 0.0745849609375, 0.18676757812...

embed

52475742_c0

52475742

haskell

0

Title: Why doesn't this simple composition work? Problem title: Why doesn't this simple composition work? Tags: monads, haskell, applicative Problem: Why doesn't this simple composition work? I was recently in need of putting head in between two monadic operations. Here's the SSCCE: module Main where f :: IO ...

Why doesn't this simple composition work? Why doesn't this simple composition work? monads haskell applicative Why Main Why doesn't this simple composition work? I was recently in need of putting head in between two monadic operations. Here's the SSCCE: This program is well-formed and compiles without warning...

[ -0.01708984375, 0.0023345947265625, -0.00341796875, 0.01251220703125, -0.005126953125, 0.0211181640625, 0.0011749267578125, 0.004241943359375, 0.000621795654296875, -0.0234375, 0.006072998046875, -0.01055908203125, 0, 0.031005859375, -0.005218505859375, -0.0262451171875, 0.0090942382...

[ 44084, 22027, 3768, 18, 903, 8781, 166577, 4488, 2667, 712, 7, 1556, 142508, 41816, 4935, 12321, 3871, 118620, 10336, 23, 17721, 6626, 11, 18403, 41018, 159, 14495, 10854, 1528, 5299, 5037, 9969, 1340, 15490, 1631, 4734, 1632, 11389, 111, ...

[ 0.1151123046875, 0.108154296875, 0.060028076171875, 0.1275634765625, 0.0963134765625, 0.1820068359375, 0.227783203125, 0.1580810546875, 0.1268310546875, 0.1478271484375, 0.074951171875, 0.1441650390625, 0.233642578125, 0.11474609375, 0.054473876953125, 0.0266265869140625, 0.040191650...

embed

42801417_c0

42801417

haskell

0

Title: Error parsing case expression Problem title: Error parsing case expression Tags: haskell Problem: Error parsing case expression I am getting this compile error: Files.hs:47:17: parse error on input ‘->’ Failed, modules loaded: none. In the following section of code: main :: IO () main = do args <- getArgs let f ...

Error parsing case expression Error parsing case expression haskell Error Files.hs:47:17 Failed Error parsing case expression I am getting this compile error: In the following section of code: While I understand the logic could use some tidying up, I do not see where I am going wrong with case syntax. I figure it might...

[ -0.00106048583984375, 0.003936767578125, -0.02734375, 0.004486083984375, -0.00396728515625, 0.02392578125, -0.005889892578125, -0.00194549560546875, 0.00384521484375, -0.01165771484375, -0.00168609619140625, 0.0074462890625, -0.0096435546875, -0.01495361328125, 0.0025482177734375, 0.00...

[ 212059, 366, 6953, 7225, 125195, 1556, 142508, 42724, 127, 33573, 22950, 190355, 20949, 903, 9969, 1340, 18499, 25632, 40059, 18151, 28219, 62775, 5809, 4527, 2936, 38543, 1257, 959, 1957, 7730, 44691, 6002, 86531, 26366, 13648, 179459, 182809,...

[ 0.178466796875, 0.1646728515625, 0.063232421875, 0.240966796875, 0.2197265625, 0.1083984375, 0.1904296875, 0.1207275390625, 0.05047607421875, 0.0877685546875, 0.12060546875, 0.13916015625, 0.0023193359375, 0.042022705078125, 0.1226806640625, 0.1480712890625, 0.1768798828125, 0.0419...

embed

47571696_c0

47571696

haskell

0

Title: how to use Special(reserved) characters in haskell? Problem title: how to use Special(reserved) characters in haskell? Tags: haskell, functional-programming Problem: how to use Special(reserved) characters in haskell? I am newbie to haskell.am trying to implement encryption for a given plain text to cipher.here ...

how to use Special(reserved) characters in haskell? how to use Special(reserved) characters in haskell? haskell functional-programming Special Char how to use Special(reserved) characters in haskell? I am newbie to haskell.am trying to implement encryption for a given plain text to cipher.here below is my sample code w...

[ 0.0016937255859375, -0.003936767578125, 0.0093994140625, -0.0235595703125, 0.000499725341796875, -0.0322265625, 0.0038909912109375, 0.002716064453125, -0.01129150390625, 0.03955078125, 0.0108642578125, -0.018798828125, 0.017333984375, 0.01556396484375, -0.0164794921875, 0.018798828125,...

[ 3642, 47, 4527, 25132, 2109, 56, 4126, 124850, 23, 1556, 142508, 123309, 28966, 21656, 132, 9014, 29479, 136791, 111719, 7986, 1059, 94266, 35064, 121413, 18151, 1608, 173247, 70541, 14012, 22, 678, 5361, 26582, 62816, 106, 91995, 41872, 7048...

[ 0.0849609375, 0.022064208984375, 0.148681640625, 0.220947265625, 0.08935546875, 0.1605224609375, 0.1297607421875, 0.226806640625, 0.08123779296875, 0.126953125, 0.216796875, 0.122802734375, 0.06787109375, 0.1522216796875, 0.008331298828125, 0.0599365234375, 0.0301513671875, 0.20068...

embed

24263721_c0

24263721

haskell

0

Title: Haskell, No instance for (Show ([String, Int)] -> Int Problem title: Haskell, No instance for (Show ([String, Int)] -> Int Tags: happy, haskell Problem: Haskell, No instance for (Show ([String, Int)] -> Int Trying to compile Haskell.Happy example here: http://www.haskell.org/happy/doc/html/sec-using.html#s...

Haskell, No instance for (Show ([String, Int)] -> Int Haskell, No instance for (Show ([String, Int)] -> Int happy haskell a Haskell Show Possible example.hs Haskell, No instance for (Show ([String, Int)] -> Int Trying to compile Haskell.Happy example here: http://www.haskell.org/happy/doc/html/sec-using.html#sec-...

[ -0.008056640625, 0.0036773681640625, 0.00081634521484375, -0.00311279296875, -0.0235595703125, 0.012451171875, 0.00823974609375, -0.0179443359375, 0.01220703125, -0.0048828125, -0.033203125, -0.01904296875, 0.00958251953125, -0.0002460479736328125, 0.009765625, -0.0174560546875, -0.0...

[ 20625, 142508, 438, 110527, 100, 168660, 71713, 214, 360, 18, 17723, 1556, 17367, 115861, 27781, 127, 40858, 9969, 1340, 184870, 10557, 157976, 7693, 39797, 223, 126340, 10135, 50986, 12663, 11435, 18499, 31577, 2831, 5974, 11675, 5885, 20594, ...

[ 0.1300048828125, 0.240966796875, 0.1385498046875, 0.2425537109375, 0.1365966796875, 0.1292724609375, 0.08642578125, 0.030548095703125, 0.07098388671875, 0.064453125, 0.2099609375, 0.100341796875, 0.1136474609375, 0.0251007080078125, 0.1846923828125, 0.086669921875, 0.01751708984375, ...

embed

49061589_c0

49061589

haskell

0

Title: GHCJS: How to use a JS library that is intended to be used with npm Problem title: GHCJS: How to use a JS library that is intended to be used with npm Tags: ghcjs, haskell, material-design, npm, reactjs Problem: GHCJS: How to use a JS library that is intended to be used with npm I'm using ghcjs-0.2.0.9006030_ghc...

GHCJS: How to use a JS library that is intended to be used with npm GHCJS: How to use a JS library that is intended to be used with npm ghcjs haskell material-design npm reactjs GHCJS How ghcjs-0.2.0.9006030_ghc-7.10.3 lts-6.30 index-dev.html GHCJS: How to use a JS library that is intended to be used with npm I'm using...

[ -0.0198974609375, 0.01092529296875, -0.00045013427734375, -0.005645751953125, 0.0034027099609375, 0.01544189453125, -0.01141357421875, 0.02001953125, 0.000060558319091796875, -0.0458984375, 0.01141357421875, -0.0595703125, -0.00141143798828125, -0.007598876953125, 0.002288818359375, 0....

[ 527, 73265, 64977, 11249, 4527, 35773, 1294, 450, 83, 179140, 186, 11814, 678, 25037, 39, 31380, 238, 28175, 1556, 142508, 4912, 34198, 131300, 133684, 5, 143161, 159343, 153808, 454, 9486, 16709, 10179, 363, 96, 933, 13545, 1197, 63262, 9,...

[ 0.1058349609375, 0.1844482421875, 0.2381591796875, 0.09637451171875, 0.1806640625, 0.2359619140625, 0.14599609375, 0.013031005859375, 0.00860595703125, 0.1815185546875, 0.0018310546875, 0.1436767578125, 0.1043701171875, 0.1644287109375, 0.16015625, 0.1246337890625, 0.092529296875, ...

embed

18685691_c0

18685691

haskell

0

Title: Haskell - List pattern matching on multiple parameters? (cannot construct the infinite type) Problem title: Haskell - List pattern matching on multiple parameters? (cannot construct the infinite type) Tags: list, pattern-matching, haskell Problem: Haskell - List pattern matching on multiple parameters? (cannot c...

Haskell - List pattern matching on multiple parameters? (cannot construct the infinite type) Haskell - List pattern matching on multiple parameters? (cannot construct the infinite type) list pattern-matching haskell Haskell List x:xs y:ys Occurs Haskell - List pattern matching on multiple parameters? (cannot construct ...

[ 0.0024566650390625, 0.00958251953125, -0.003875732421875, 0.006317138671875, -0.01068115234375, -0.000667572021484375, -0.000446319580078125, 0.00537109375, 0.0123291015625, -0.0004634857177734375, 0.035888671875, -0.033203125, 0.0081787109375, -0.006622314453125, 0.00390625, -0.001312...

[ 20625, 142508, 32036, 103510, 14858, 48716, 171859, 4398, 10869, 64549, 54241, 10644, 214, 5303, 98753, 1556, 1022, 425, 113, 4778, 180, 238, 48650, 98, 13, 63134, 17368, 61924, 50339, 12765, 53418, 808, 2389, 2203, 5646, 6626, 237, 32354, ...

[ 0.113037109375, 0.2344970703125, 0.18994140625, 0.2210693359375, 0.1929931640625, 0.15478515625, 0.1822509765625, 0.053466796875, 0.073486328125, 0.145751953125, 0.1351318359375, 0.171630859375, 0.049835205078125, 0.1846923828125, 0.156494140625, 0.0916748046875, 0.013824462890625, ...

embed

18691321_c0

18691321

haskell

0

Title: Printing a 2d array in haskell Problem title: Printing a 2d array in haskell Tags: ppm, arrays, printing, haskell Problem: Printing a 2d array in haskell I'm messing around with printing a random 2d array of Ints, in this simple image format (PPM) 0 1 0 0 1 1 0 0 1 0 0 1 1 0 0 0 1 1 1 0 0 0 0 1 0 Below is my cod...

Printing a 2d array in haskell Printing a 2d array in haskell ppm arrays printing haskell System.Random Data.Array.IArray Printing Array RandomGen make2dRange Printing a 2d array in haskell I'm messing around with printing a random 2d array of Ints, in this simple image format (PPM) Below is my code, which works, but s...

[ -0.0242919921875, -0.01470947265625, 0.00958251953125, 0.0208740234375, -0.0029449462890625, 0.0252685546875, 0.0084228515625, -0.0179443359375, -0.004180908203125, -0.0020599365234375, 0.0218505859375, 0.01202392578125, 0.010986328125, -0.00555419921875, -0.004669189453125, -0.0123291...

[ 39754, 214, 116, 71, 10298, 53, 23, 1556, 142508, 10, 32261, 39, 4778, 2448, 12353, 126525, 3815, 11809, 7614, 7092, 69253, 39643, 306, 105376, 3249, 304, 1052, 51459, 163, 38001, 10932, 1916, 96759, 360, 933, 8781, 29569, 9384, 17487, 59...

[ 0.196533203125, 0.012664794921875, 0.1375732421875, 0.1522216796875, 0.183349609375, 0.1595458984375, 0.03704833984375, 0.14794921875, 0.24755859375, 0.000335693359375, 0.1207275390625, 0.1392822265625, 0.032562255859375, 0.1607666015625, 0.0694580078125, 0.0284576416015625, 0.110961...

embed

2349922_c0

2349922

haskell

0

Title: Why does GHC infer type of `IO b` for an application of `hSetBuffering`? Problem title: Why does GHC infer type of `IO b` for an application of `hSetBuffering`? Tags: typeerror, haskell Problem: Why does GHC infer type of `IO b` for an application of `hSetBuffering`? I am trying to use hSetBuffering in a Haskell...

Why does GHC infer type of `IO b` for an application of `hSetBuffering`? Why does GHC infer type of `IO b` for an application of `hSetBuffering`? typeerror haskell IO Why GHC Ctlc NoBuffering ctlc.hs:8:10 Couldn Prelude Data.List Handle BufferMode Why does GHC infer type of `IO b` for an application of `hSetBuffering`?...

[ 0.00335693359375, -0.010498046875, 0.010009765625, 0.007171630859375, -0.01043701171875, 0.0189208984375, -0.01177978515625, -0.01385498046875, -0.01806640625, 0.02099609375, -0.003265380859375, -0.049560546875, 0, -0.0172119140625, -0.0034332275390625, -0.0159912109375, 0.0132446289...

[ 44084, 527, 73265, 53498, 10644, 17780, 876, 38415, 127, 294, 126, 7235, 18234, 214, 188800, 1556, 142508, 32838, 438, 1019, 15110, 191147, 19, 1914, 822, 11809, 154663, 10639, 133, 667, 9083, 1096, 20625, 1528, 305, 10179, 9790, 4552, 8781...

[ 0.0955810546875, 0.093505859375, 0.2152099609375, 0.20166015625, 0.17919921875, 0.185302734375, 0.191650390625, 0.1136474609375, 0.094482421875, 0.058837890625, 0.116943359375, 0.1129150390625, 0.131591796875, 0.039581298828125, 0.1790771484375, 0.07427978515625, 0.2054443359375, 0...

embed

67748174_c2

67748174

haskell

2

=/root/.stack/snapshots/x86_64-linux-tinfo6/08a30a38364a81e94295cf97609a35ddfc240f67779f06f0eb2ce22d8a89e805/8.10.4/doc/postgresql-libpq-0.9.4.3 --htmldir=/root/.stack/snapshots/x86_64-linux-tinfo6/08a30a38364a81e94295cf97609a35ddfc240f67779f06f0eb2ce22d8a89e805/8.10.4/doc/postgresql-libpq-0.9.4.3 --haddockdir=/root/.s...

[ 0.0142822265625, 0.0152587890625, -0.00830078125, 0.0220947265625, 0.00095367431640625, -0.0033416748046875, -0.02587890625, -0.00823974609375, 0.00537109375, 0.006622314453125, 0.005706787109375, -0.041015625, 0.01055908203125, 0.00689697265625, -0.0267333984375, 0.005401611328125, ...

[ 2203, 64, 148920, 590, 2594, 10957, 72697, 15276, 13307, 2397, 6077, 7319, 910, 28974, 1197, 162982, 13556, 14889, 5843, 128205, 62635, 104656, 186035, 23538, 10179, 77212, 29713, 4594, 17562, 99247, 5612, 254, 864, 143161, 158406, 7693, 936, ...

[ 0.10791015625, 0.04071044921875, 0.1951904296875, 0.0994873046875, 0.1326904296875, 0.1182861328125, 0.18212890625, 0.197265625, 0.1727294921875, 0.09881591796875, 0.1317138671875, 0.1689453125, 0.082275390625, 0.1041259765625, 0.0784912109375, 0.065673828125, 0.0303802490234375, 0...

embed

54351314_c0

54351314

haskell

0

Title: How to Cache a Haskell Dependency to Speed Up Compilation Time? Problem title: How to Cache a Haskell Dependency to Speed Up Compilation Time? Tags: nix, haskell, haskell-stack Problem: How to Cache a Haskell Dependency to Speed Up Compilation Time? Problem: I'm working on a Haskell project that uses stack (+ ni...

How to Cache a Haskell Dependency to Speed Up Compilation Time? How to Cache a Haskell Dependency to Speed Up Compilation Time? nix haskell haskell-stack How Cache Haskell Dependency Speed Compilation Time stack.yaml godot-haskell-0.1.0.0 sha256:9d92ff27c7b6c6d2155286f04ba2c432f96460f448fd976654ef26a84f0e35a6 How to Ca...

[ 0.001007080078125, 0.0208740234375, 0.0142822265625, -0.0115966796875, -0.006988525390625, 0.00634765625, -0.0257568359375, -0.01043701171875, -0.0098876953125, -0.0322265625, -0.0166015625, -0.0220947265625, 0.016357421875, 0.022705078125, 0.00262451171875, 0.005859375, -0.018432617...

[ 11249, 47, 2041, 1430, 10, 20625, 142508, 262, 26885, 27771, 63349, 10091, 15612, 14, 57860, 19055, 300, 425, 1556, 590, 2594, 177261, 14520, 141, 2355, 818, 10557, 102014, 99929, 9638, 127892, 150230, 15649, 20697, 13452, 4527, 22183, 42548,...

[ 0.101806640625, 0.0638427734375, 0.216064453125, 0.234375, 0.05914306640625, 0.167724609375, 0.287353515625, 0.1199951171875, 0.197509765625, 0.120361328125, 0.16943359375, 0.1019287109375, 0.14208984375, 0.1094970703125, 0.023529052734375, 0.1246337890625, 0.1199951171875, 0.14880...

embed

56824404_c0

56824404

haskell

0

Title: Is there a way to generate a dhall schema from an haskell datatype? Problem title: Is there a way to generate a dhall schema from an haskell datatype? Tags: dhall, haskell Problem: Is there a way to generate a dhall schema from an haskell datatype? I'm trying to rewrite a BIG yaml configuration file used in Haks...

Is there a way to generate a dhall schema from an haskell datatype? Is there a way to generate a dhall schema from an haskell datatype? dhall haskell an Is there a way to generate a dhall schema from an haskell datatype? I'm trying to rewrite a BIG yaml configuration file used in Haksell applicationusing dhall. To do s...

[ 0.0084228515625, 0.0208740234375, 0.00213623046875, -0.006561279296875, -0.033935546875, 0.001983642578125, -0.01806640625, -0.00142669677734375, -0.0146484375, -0.0250244140625, -0.01519775390625, -0.004547119140625, 0.00408935546875, 0.0013885498046875, -0.005950927734375, 0.00138854...

[ 2071, 2685, 10, 3917, 139392, 104, 29907, 61903, 1295, 1556, 142508, 2053, 50986, 47, 142, 31577, 456, 434, 18781, 140836, 151, 7237, 180346, 11435, 11814, 23493, 93991, 38415, 1647, 1681, 188, 71, 144570, 97692, 45174, 10644, 3332, 34, 191...

[ 0.021697998046875, 0.02703857421875, 0.032135009765625, 0.1085205078125, 0.200439453125, 0.0994873046875, 0.257080078125, 0.259765625, 0.0914306640625, 0.1339111328125, 0.2386474609375, 0.10040283203125, 0.2279052734375, 0.00921630859375, 0.0174102783203125, 0.009429931640625, 0.0537...

embed

15708400_c1

15708400

haskell

1

0.14.2.0 projectroot/fay projectroot/fay-shared I also tried importing and re-exporting Model in SharedTypes.hs, but that produced the same error. Is there a way to do this? If not, why not? (I'm a relative noob in both Haskell and Yesod, so the answer to the "why not?" question would be really helpful.) EDIT: I just r...

[ -0.0029296875, 0.0267333984375, -0.01104736328125, -0.00537109375, -0.00872802734375, 0.01019287109375, 0.00323486328125, -0.00494384765625, -0.005767822265625, -0.05078125, 0.016357421875, -0.04052734375, -0.01080322265625, -0.000762939453125, -0.005950927734375, -0.0018463134765625, ...

[ 107754, 617, 73011, 13452, 148920, 1021, 53, 67886, 71, 37842, 24927, 214, 456, 180758, 13293, 23, 29790, 196707, 127, 5701, 18499, 3917, 15400, 3522, 20625, 142508, 32635, 2199, 3038, 959, 98893, 57309, 2581, 18, 34735, 31577, 3444, 19048, ...

[ 0.06256103515625, 0.1099853515625, 0.1258544921875, 0.08624267578125, 0.232421875, 0.16015625, 0.2308349609375, 0.176513671875, 0.0888671875, 0.0149383544921875, 0.1722412109375, 0.020904541015625, 0.076171875, 0.1702880859375, 0.237060546875, 0.001800537109375, 0.1793212890625, 0....

embed

22990312_c0

22990312

haskell

0

Title: Haskell MongoDB, can't fetch _id field Problem title: Haskell MongoDB, can't fetch _id field Tags: haskell, mongodb, yesod Problem: Haskell MongoDB, can't fetch _id field Messing about with Yesod and MongoDB. I'm using the MongoDB library directly, not using the Persistent library. I took this simple Y...

Haskell MongoDB, can't fetch _id field Haskell MongoDB, can't fetch _id field haskell mongodb yesod Haskell MongoDB _id Nothing file.txt Haskell MongoDB, can't fetch _id field Messing about with Yesod and MongoDB. I'm using the MongoDB library directly, not using the Persistent library. I took this simple Yes...

[ -0.00433349609375, -0.0038604736328125, 0.020751953125, 0.00433349609375, -0.01336669921875, 0.0299072265625, -0.0078125, -0.029052734375, -0.0036773681640625, -0.0291748046875, 0.040283203125, -0.00653076171875, -0.010986328125, -0.0238037109375, 0.020263671875, -0.006561279296875, ...

[ 20625, 142508, 7465, 519, 39463, 831, 3768, 18, 7647, 206, 101, 532, 44457, 1556, 2667, 7803, 275, 2422, 23722, 182747, 11435, 124326, 48205, 1672, 678, 32635, 2199, 136, 35773, 105237, 57309, 2581, 8781, 10723, 117176, 31577, 2046, 60525, ...

[ 0.10107421875, 0.2064208984375, 0.05999755859375, 0.155029296875, 0.2098388671875, 0.0731201171875, 0.034423828125, 0.06298828125, 0.169921875, 0.005615234375, 0.136962890625, 0.2232666015625, 0.219482421875, 0.0843505859375, 0.03643798828125, 0.04254150390625, 0.019989013671875, 0...

embed

9883791_c0

9883791

haskell

0

Title: Why is writeSTRef faster than if expression? Problem title: Why is writeSTRef faster than if expression? Tags: haskell Problem: Why is writeSTRef faster than if expression? writeSTRef twice for each iteration fib3 :: Int -> Integer fib3 n = runST $ do a <- newSTRef 1 b <- newSTRef 1 replicateM_ (n-1) $ do !a' <-...

Why is writeSTRef faster than if expression? Why is writeSTRef faster than if expression? haskell Why fib3 Integer replicateM_ n-1 fib4 Why is writeSTRef faster than if expression? writeSTRef twice for each iteration writeSTRef once for each iteration Benchmark, given n = 20000 : fib3 is a bit faster than fib4.

[ -0.019775390625, -0.00067901611328125, 0.00518798828125, -0.01226806640625, 0.008544921875, -0.018310546875, 0.003570556640625, -0.00665283203125, 0.002960205078125, 0.0179443359375, -0.008544921875, 0.034912109375, 0.00592041015625, 0.0198974609375, 0.027587890625, 0.01025390625, 0....

[ 44084, 83, 33022, 94539, 4240, 4271, 56, 3501, 2174, 125195, 1556, 142508, 809, 275, 363, 44401, 143126, 67, 594, 653, 5759, 617, 186351, 100, 12638, 17, 720, 24145, 3419, 206, 10015, 34475, 116, 28568, 10, 4785, 5 ]

[ 0.0982666015625, 0.039398193359375, 0.1781005859375, 0.1510009765625, 0.24365234375, 0.169189453125, 0.1419677734375, 0.045013427734375, 0.1876220703125, 0.2054443359375, 0.10345458984375, 0.2259521484375, 0.120361328125, 0.1243896484375, 0.1610107421875, 0.1644287109375, 0.189941406...

embed

29587201_c0

29587201

haskell

0

Title: Convert String to Int checking for overflow Problem title: Convert String to Int checking for overflow Tags: haskell, type-conversion Problem: Convert String to Int checking for overflow When I tried to convert a very long integer to Int , I was surprised that no error was thrown: Prelude> read "1234567890123456...

Convert String to Int checking for overflow Convert String to Int checking for overflow haskell type-conversion Convert Prelude Text.Read LANGUAGE ScopedTypeVariables Integral Bounded Maybe Integer Nothing Just Convert String to Int checking for overflow When I tried to convert a very long integer to Int , I was surpri...

[ -0.0262451171875, -0.01123046875, 0.0027008056640625, 0.0079345703125, -0.0062255859375, 0.0242919921875, 0.01068115234375, -0.033935546875, 0.0084228515625, 0.005584716796875, 0.0120849609375, -0.04150390625, -0.00836181640625, 0.00714111328125, 0.033447265625, -0.0169677734375, -0....

[ 1657, 11549, 23351, 214, 47, 360, 18, 175199, 100, 645, 118664, 1556, 142508, 10644, 2271, 46354, 1914, 822, 112, 24129, 31345, 98064, 182783, 196707, 81827, 204681, 335, 167457, 83425, 44401, 182747, 37842, 96760, 4552, 4989, 892, 1505, 1442...

[ 0.043426513671875, 0.160888671875, 0.199951171875, 0.114501953125, 0.1287841796875, 0.162353515625, 0.22314453125, 0.197265625, 0.054931640625, 0.12353515625, 0.263916015625, 0.10491943359375, 0.2193603515625, 0.1375732421875, 0.03997802734375, 0.1177978515625, 0.04388427734375, 0....

embed

54378041_c1

54378041

haskell

1

s. MonadReader (Env s) Comp where {} Full error message: Illegal instance declaration for ‘MonadReader (EvalEnv s) Evaluator’ The coverage condition fails in class ‘MonadReader’ for functional dependency: ‘m -> r’ Reason: lhs type ‘Evaluator’ does not determine rhs type ‘EvalEnv s’ Un-determined variable: s I understa...

[ -0.02099609375, -0.000728607177734375, 0.01361083984375, -0.003997802734375, 0.0026397705078125, 0.007598876953125, 0.0279541015625, -0.02734375, -0.00836181640625, -0.021728515625, -0.00909423828125, 0.0303955078125, 0.01324462890625, 0.00250244140625, 0.0198974609375, -0.012329101562...

[ 91, 60331, 71, 31345, 56, 7768, 334, 15612, 7440, 9312, 18499, 26008, 891, 86966, 110527, 21635, 46674, 712, 1405, 151228, 1290, 154271, 35431, 35782, 18507, 123309, 42548, 27771, 39, 33079, 1690, 236267, 127, 10644, 647, 27494, 4597, 959, ...

[ 0.06707763671875, 0.169921875, 0.0986328125, 0.2376708984375, 0.1297607421875, 0.1275634765625, 0.1756591796875, 0.1988525390625, 0.0179901123046875, 0.0657958984375, 0.1485595703125, 0.036407470703125, 0.0699462890625, 0.1885986328125, 0.19873046875, 0.1365966796875, 0.1251220703125...

embed

57856241_c0

57856241

haskell

0

Title: Teletype IO getLine function Problem title: Teletype IO getLine function Tags: haskell, io Problem: Teletype IO getLine function I have this data type: data Teletype a = End a | Get (Char -> Teletype a) | Put Char (Teletype a) A value of this type can be used to describe programs that read and write characters a...

Teletype IO getLine function Teletype IO getLine function haskell io Teletype End Get Char Put Couldn Teletype IO getLine function I have this data type: A value of this type can be used to describe programs that read and write characters and return a final result of type a . Such a program can end immediately ( End )....

[ -0.004241943359375, -0.00616455078125, 0.0091552734375, 0.0142822265625, -0.007598876953125, -0.00347900390625, 0.033935546875, 0.007720947265625, -0.007232666015625, -0.01165771484375, 0.0093994140625, -0.01287841796875, -0.012939453125, 0.0045166015625, -0.00933837890625, 0.012695312...

[ 10142, 50986, 17780, 2046, 93232, 32354, 1556, 142508, 22995, 18878, 20779, 21656, 19577, 191147, 2053, 10644, 34292, 11814, 98363, 103391, 12301, 33022, 124850, 30646, 2704, 16750, 10, 62771, 1528, 831, 3564, 109312, 62816, 10588, 151552, 96819,...

[ 0.1492919921875, 0.25341796875, 0.2200927734375, 0.1551513671875, 0.28369140625, 0.1800537109375, 0.1016845703125, 0.1943359375, 0.17041015625, 0.16064453125, 0.1328125, 0.1641845703125, 0.1392822265625, 0.0888671875, 0.0791015625, 0.126953125, 0.1455078125, 0.053985595703125, 0....

embed

59614582_c0

59614582

haskell

0

Title: calculate function return type for a given input type Problem title: calculate function return type for a given input type Tags: haskell Problem: calculate function return type for a given input type In Haskell, I would like to calculate the return type for a given function given a parameter type. So for e.g. a ...

calculate function return type for a given input type calculate function return type for a given input type haskell Test.QuickCheck Data.Typeable Bool XScopedTypeVariables calculate function return type for a given input type In Haskell, I would like to calculate the return type for a given function given a parameter t...

[ 0.005126953125, -0.00191497802734375, -0.017578125, 0.00823974609375, -0.0001659393310546875, -0.00909423828125, -0.0003337860107421875, -0.0208740234375, 0.003204345703125, -0.0306396484375, -0.013916015625, -0.0322265625, -0.0230712890625, -0.005340576171875, 0.00994873046875, -0.015...

[ 74481, 67, 32354, 30646, 10644, 100, 34475, 107730, 1556, 142508, 8647, 96010, 202567, 11809, 196707, 2886, 2460, 929, 112720, 587, 20051, 81827, 14, 20625, 1884, 171859, 138256, 10, 33079, 136, 2046, 43240, 34648, 101426, 71924, 12319, 645, ...

[ 0.2181396484375, 0.05596923828125, 0.1790771484375, 0.28857421875, 0.234130859375, 0.0545654296875, 0.111328125, 0.1715087890625, 0.0963134765625, 0.2132568359375, 0.058990478515625, 0.00482177734375, 0.1270751953125, 0.0311279296875, 0.1510009765625, 0.10406494140625, 0.093139648437...

embed

26239232_c0

26239232

haskell

0

Title: Faulty base-case Haskell Problem title: Faulty base-case Haskell Tags: haskell, design-patterns Problem: Faulty base-case Haskell My functions: type Block = [Maybe Int] checkBlock' :: Block -> Block checkBlock' (r:rs) | r == [] = [] | isJust r == True = r:checkBlock' rs | isNothing r == True = checkBlock' rs che...

Faulty base-case Haskell Faulty base-case Haskell haskell design-patterns Faulty Haskell Block Maybe r:rs r:checkBlock Sudoku.hs:104:12 Couldn Failed Faulty base-case Haskell My functions: I want to first function to inspect a list of Just Ints and Nothings, and return only the Just values. And the second function to r...

[ -0.0033416748046875, 0.00604248046875, 0.00081634521484375, -0.01446533203125, 0.008056640625, 0.00958251953125, -0.004058837890625, -0.006195068359375, 0.0118408203125, 0.0084228515625, 0.01458740234375, 0.0011444091796875, 0.0031890869140625, -0.00946044921875, -0.02099609375, 0.0048...

[ 3036, 202, 939, 3647, 58437, 20625, 142508, 1556, 4331, 4453, 22766, 80231, 83425, 1690, 4295, 78292, 166191, 15334, 38067, 66947, 20927, 191147, 190355, 297, 32354, 3444, 5117, 134071, 5303, 9563, 360, 933, 136, 182747, 30646, 4734, 142424, ...

[ 0.07867431640625, 0.113037109375, 0.1134033203125, 0.197021484375, 0.247314453125, 0.1400146484375, 0.233642578125, 0.1141357421875, 0.148193359375, 0.06036376953125, 0.052398681640625, 0.167724609375, 0.0347900390625, 0.146240234375, 0.11376953125, 0.1513671875, 0.1912841796875, 0...

embed

38405937_c1

38405937

haskell

1

[ -0.016845703125, 0.00860595703125, -0.0023651123046875, -0.0081787109375, 0.0054931640625, 0.0133056640625, -0.0107421875, -0.01507568359375, 0.00762939453125, -0.0087890625, -0.01019287109375, -0.0042724609375, 0.01300048828125, -0.020751953125, 0.00946044921875, 0.00579833984375, 0...

[ 71257, 1052, 51459, 841, 7, 11935, 14256, 178476, 568, 37379, 12647, 122385, 6766, 17336, 43512, 28636, 33, 39179, 24988, 8206, 81827, 31089, 110, 31913, 4677, 2684, 988, 40, 32354, 80934, 572, 79520, 206, 11001, 13315, 119488, 581, 33636, ...

[ 0.279296875, 0.1077880859375, 0.1722412109375, 0.1246337890625, 0.142333984375, 0.1954345703125, 0.07611083984375, 0.173828125, 0.1204833984375, 0.2213134765625, 0.002105712890625, 0.1500244140625, 0.02606201171875, 0.20068359375, 0.16455078125, 0.0731201171875, 0.09228515625, 0.13...

embed

28595221_c1

28595221

haskell

1

.Client.Dependency.Modular.PSQ ( Distribution\C lient\Dependency\Modular\PSQ.hs, dist\build\cabal\cabal-tmp\Distribution\Client\ Dependency\Modular\PSQ.o ) ... ... C:\Users\Alberto\AppData\Roaming\cabal\x86_64-windows-ghc-7.8.3\HTTP-4000.2.19/l ibHSHTTP-4000.2.19.a(TCP.o):fake:(.text+0x44d6): undefined reference to `sh...

[ 0.0047607421875, 0.0155029296875, 0.0076904296875, -0.00787353515625, 0.009521484375, -0.00921630859375, -0.0216064453125, -0.0087890625, -0.007110595703125, -0.007049560546875, 0.013671875, -0.01080322265625, 0.00384521484375, -0.006378173828125, 0.00518798828125, -0.008056640625, -...

[ 150, 2517, 4657, 26885, 27771, 91616, 35975, 9059, 2737, 75571, 52739, 127, 45, 271, 177149, 408, 3571, 2676, 179236, 262, 31, 313, 1062, 6210, 66518, 39179, 137989, 12724, 302, 15276, 13307, 229792, 9486, 238, 176391, 18544, 83754, 133684, ...

[ 0.10125732421875, 0.07647705078125, 0.10003662109375, 0.2166748046875, 0.048858642578125, 0.1094970703125, 0.159423828125, 0.1531982421875, 0.2327880859375, 0.1810302734375, 0.0694580078125, 0.054473876953125, 0.00830078125, 0.06689453125, 0.1275634765625, 0.10888671875, 0.2416992187...

embed

41939715_c0

41939715

haskell

0

Title: Can I easily wrap attoparsec in transformer? Problem title: Can I easily wrap attoparsec in transformer? Tags: monad-transformers, attoparsec, parser-combinators, megaparsec, haskell Problem: Can I easily wrap attoparsec in transformer? I want to write code doing something like C preprocessing. So I looked for l...

Can I easily wrap attoparsec in transformer? Can I easily wrap attoparsec in transformer? monad-transformers attoparsec parser-combinators megaparsec haskell Can Parser StateT Can I easily wrap attoparsec in transformer? I want to write code doing something like C preprocessing. So I looked for libraries and got two ca...

[ -0.02685546875, 0.0159912109375, 0.00531005859375, 0.0189208984375, 0.0032501220703125, -0.00909423828125, -0.00194549560546875, -0.0272216796875, 0.0040283203125, -0.025634765625, 0.0191650390625, 0.0186767578125, 0.00860595703125, 0.01263427734375, 0.012451171875, -0.0172119140625, ...

[ 4171, 72546, 137565, 243, 31, 2500, 39797, 23, 27198, 56, 87, 2667, 712, 215175, 1314, 366, 2189, 19155, 22230, 31534, 1556, 142508, 2392, 22836, 618, 3444, 33022, 18151, 1884, 313, 479, 63923, 35773, 6626, 25469, 3871, 60213, 13416, 18499,...

[ 0.0906982421875, 0.1988525390625, 0.27001953125, 0.177978515625, 0.1807861328125, 0.1708984375, 0.2490234375, 0.103515625, 0.2255859375, 0.1661376953125, 0.017669677734375, 0.0977783203125, 0.150634765625, 0.20458984375, 0.04644775390625, 0.0728759765625, 0.1817626953125, 0.1010742...

embed

8935082_c0

8935082

haskell

0

Title: Compile multi .hs files of Haskell - Unix Problem title: Compile multi .hs files of Haskell - Unix Tags: ghci, unix, haskell, ghc Problem: Compile multi .hs files of Haskell - Unix I created some files from a project in Unix, they are a lot and if I want to execute it in another pc or folder I need to copy all f...

Compile multi .hs files of Haskell - Unix Compile multi .hs files of Haskell - Unix ghci unix haskell ghc Compile Haskell Unix main.hs ex1.hs ex2.lhs ex1.lhs LaTeX pic.jpg package.sty MAIN Failed Compile multi .hs files of Haskell - Unix I created some files from a project in Unix, they are a lot and if I want to execu...

[ -0.01470947265625, 0.00909423828125, -0.01348876953125, 0.01556396484375, -0.01055908203125, 0.0059814453125, 0.0042724609375, -0.001434326171875, -0.00982666015625, -0.018798828125, -0.01446533203125, -0.0091552734375, 0.0223388671875, 0.016357421875, -0.0218505859375, 0.0015716552734...

[ 15612, 1340, 6024, 5, 127, 7, 102158, 111, 20625, 142508, 992, 4084, 31380, 318, 51, 1556, 238, 5201, 1119, 418, 5442, 79366, 10476, 1542, 8834, 25687, 98169, 8946, 48026, 190355, 75935, 1295, 13452, 23, 5915, 71924, 15700, 36719, 78303, ...

[ 0.1417236328125, 0.1138916015625, 0.17333984375, 0.00335693359375, 0.147216796875, 0.0897216796875, 0.16845703125, 0.03363037109375, 0.1458740234375, 0.2578125, 0.0849609375, 0.1162109375, 0.110107421875, 0.0819091796875, 0.05169677734375, 0.1270751953125, 0.0633544921875, 0.075073...

embed

30408500_c0

30408500

haskell

0

Title: hGetLine from /dev/pty/N? Problem title: hGetLine from /dev/pty/N? Tags: terminal, pty, haskell, filehandle Problem: hGetLine from /dev/pty/N? I'm trying to read from a pseudoterminal. My eventual goal is to hook up input/output from the pseudoterminal to reactive-banana events, but right now I'm just trying to ...

hGetLine from /dev/pty/N? hGetLine from /dev/pty/N? terminal pty haskell filehandle /dev/pty/N System.Posix.Terminal System.Posix.IO hGetLine from /dev/pty/N? I'm trying to read from a pseudoterminal. My eventual goal is to hook up input/output from the pseudoterminal to reactive-banana events, but right now I'm just t...

[ -0.01239013671875, 0.02001953125, 0.0023193359375, -0.0004482269287109375, -0.002960205078125, -0.01043701171875, 0.03515625, -0.021240234375, -0.0098876953125, -0.0263671875, 0.0172119140625, -0.016357421875, -0.015380859375, 0.006256103515625, -0.019775390625, 0.0081787109375, 0.02...

[ 1096, 724, 126, 93232, 1295, 248, 18548, 254, 939, 839, 33949, 915, 1556, 142508, 11435, 79628, 12353, 7192, 4084, 35484, 1249, 7, 17780, 31577, 12301, 74189, 30524, 289, 57693, 69236, 150522, 107730, 6056, 71232, 105281, 11, 47353, 20625, ...

[ 0.1103515625, 0.138427734375, 0.163330078125, 0.255126953125, 0.113037109375, 0.044586181640625, 0.245849609375, 0.050933837890625, 0.1842041015625, 0.151611328125, 0.2105712890625, 0.04010009765625, 0.10272216796875, 0.2054443359375, 0.0723876953125, 0.1590576171875, 0.0606689453125...

embed

33053124_c1

33053124

haskell

1

version 4.7.0.1 found - SnapFull requires >=3.7.6 && <3.8 snap-loader-dynamic not found - SnapFull requires ==0.10.* snap-loader-static not found - SnapFull requires >=0.9 && <0.10 Checking against build plan lts-3.8 * Build plan did not match your requirements: base version 4.8.1.0 found - SnapFull requires >=4 && <4...

[ -0.0283203125, 0.02392578125, 0.001434326171875, -0.0003204345703125, -0.033447265625, 0.00555419921875, -0.019287109375, -0.0059814453125, 0.0029449462890625, 0.04248046875, -0.0177001953125, -0.0252685546875, -0.0140380859375, -0.0224609375, 0.0096435546875, 0.01513671875, 0.014160...

[ 11389, 201, 53489, 102014, 14037, 121190, 121962, 144570, 977, 76067, 5, 180347, 135527, 76685, 63033, 56, 242554, 959, 145407, 10179, 201939, 143161, 963, 38679, 26548, 45367, 1774, 96, 933, 6, 121137, 6777, 14858, 96679, 3647, 52196, 102107, ...

[ 0.1669921875, 0.1273193359375, 0.165283203125, 0.2130126953125, 0.13330078125, 0.2462158203125, 0.297119140625, 0.2098388671875, 0.0246734619140625, 0.100830078125, 0.048736572265625, 0.1993408203125, 0.2264404296875, 0.227783203125, 0.207763671875, 0.0771484375, 0.195068359375, 0....

embed

56033182_c1

56033182

haskell

1

-N1 -p -RTS total time = 1.20 secs (1200 ticks @ 1000 us, 1 processor) total alloc = 1,936,132,144 bytes (excludes profiling overheads) COST CENTRE MODULE SRC %time %alloc forceEval Main par.hs:28:1-57 75.8 60.3 runMap Main par.hs:31:1-59 17.5 19.0 parmap' Main par.hs:(6,1)-(12,56) 3.2 14.9 parmap'.half1 Main par.hs:8...

[ 0.0033416748046875, 0.011474609375, 0.01275634765625, -0.005828857421875, -0.004791259765625, 0.00787353515625, -0.00921630859375, -0.00811767578125, 0.01043701171875, -0.017333984375, -0.007110595703125, 0.00299072265625, 0.02685546875, -0.00122833251953125, -0.0050048828125, 0.002029...

[ 20, 839, 418, 254, 20503, 294, 3622, 1733, 2203, 615, 1549, 19216, 7, 96740, 1053, 22824, 1374, 4382, 1821, 106, 14543, 42, 16, 756, 6652, 108933, 8659, 136124, 131663, 390, 1636, 158928, 34, 988, 9468, 214, 645, 31251, 313, 34274, 8985...

[ 0.08172607421875, 0.1689453125, 0.1552734375, 0.1593017578125, 0.1741943359375, 0.1783447265625, 0.1693115234375, 0.24951171875, 0.042327880859375, 0.04095458984375, 0.161865234375, 0.2137451171875, 0.028961181640625, 0.1304931640625, 0.14013671875, 0.1126708984375, 0.041290283203125...

embed

24900932_c1

24900932

haskell

1

1.4.2 ... linking ... done. Loading package vector-0.10.11.0 ... linking ... done. Loading package mwc-random-0.13.1.2 ... linking ... done. Loading package monads-tf-0.1.0.2 ... linking ... done. Loading package filepath-1.3.0.2 ... linking ... done. Loading package byteable-0.1.1 ... linking ... done. Loading package...

[ -0.01409912109375, -0.01141357421875, -0.01470947265625, 0.0059814453125, 0.013916015625, 0.00885009765625, 0.00860595703125, -0.0218505859375, -0.00185394287109375, -0.0244140625, -0.023681640625, -0.0303955078125, -0.0169677734375, -0.00689697265625, -0.00469970703125, -0.00787353515...

[ 615, 117904, 153, 3126, 214, 16940, 228006, 98169, 173, 18770, 23320, 10179, 418, 102107, 43879, 238, 46258, 2681, 48400, 2667, 712, 7, 420, 102014, 133684, 11435, 128405, 81046, 390, 67, 2886, 83783, 215637, 126234, 122336, 116419, 93645, 15...

[ 0.12890625, 0.26806640625, 0.07806396484375, 0.177734375, 0.1068115234375, 0.1297607421875, 0.2066650390625, 0.21728515625, 0.19384765625, 0.19384765625, 0.03857421875, 0.1490478515625, 0.036834716796875, 0.1103515625, 0.0921630859375, 0.093505859375, 0.163818359375, 0.105590820312...

embed

20893588_c0

20893588

haskell

0

Title: Starting Yesod without environment flag using mod_fastcgi Problem title: Starting Yesod without environment flag using mod_fastcgi Tags: yesod, haskell, fastcgi Problem: Starting Yesod without environment flag using mod_fastcgi To launch my Yesod application I need to provide an application environment argument ...

Starting Yesod without environment flag using mod_fastcgi Starting Yesod without environment flag using mod_fastcgi yesod haskell fastcgi mod_fastcgi Prelude Yesod.Default.Config Yesod.Default.Main Settings Application Network.Wai.Handler.FastCGI Starting Yesod Starting Yesod without environment flag using mod_fastcgi ...

[ -0.0177001953125, 0.0233154296875, -0.01031494140625, 0.000141143798828125, -0.01129150390625, 0.009033203125, -0.00848388671875, -0.0245361328125, -0.0162353515625, -0.007476806640625, 0.002685546875, 0.0027923583984375, -0.021484375, 0.0081787109375, -0.0004711151123046875, -0.033203...

[ 13794, 214, 32635, 2199, 15490, 65998, 49938, 17368, 2811, 39473, 238, 735, 2422, 23722, 1556, 142508, 4271, 1914, 822, 187423, 11, 83671, 168793, 105548, 104921, 22489, 135679, 919, 4438, 18027, 83184, 38415, 22691, 10750, 1176, 91480, 39179, ...

[ 0.1563720703125, 0.010101318359375, 0.1900634765625, 0.287841796875, 0.1124267578125, 0.2083740234375, 0.1607666015625, 0.1029052734375, 0.1553955078125, 0.130859375, 0.040618896484375, 0.201904296875, 0.111083984375, 0.1904296875, 0.0733642578125, 0.1607666015625, 0.1064453125, 0....

embed

7139263_c1

7139263

haskell

1

0-18deac99a132f04751d862b77aab136e -package-id deepseq-1.1.0.2-09b3aed0c4982bbc6569c668100876fa -O -Wall -XHaskell98 -XCPP Data.Attoparsec Data.Attoparsec.Char8 Data.Attoparsec.Combinator Data.Attoparsec.FastSet Data.Attoparsec.Lazy Data.Attoparsec.Number Data.Attoparsec.Zepto Data.Attoparsec.Internal Data.Attoparsec.I...

6e81708f93cae7d0 parsec-3.1.1-5671ee15550b9e1b29f6da36f7643854 text-0.11.0.6-7812e10747897216f9b707186c779855 transformers-0.2.2.0-a8a2dbba7d96131db605cf631ea0c8c4 zlib-0.5.3.1-5fbdf714525b76e0e601c2ffb25f2044 Cabal cabal install ... failing - osx - many unsatisfied packages Update: Running ghc-pkg check reported: and ...

[ 0.0128173828125, -0.00006198883056640625, 0.00933837890625, 0.0103759765625, 0.018798828125, 0.004791259765625, -0.0169677734375, -0.021484375, 0.0113525390625, 0.0238037109375, -0.01123046875, -0.037109375, 0.0012054443359375, 0.02880859375, 0.00095367431640625, -0.000820159912109375,...

[ 305, 13556, 188734, 11591, 366, 39797, 83783, 162082, 90393, 8659, 156204, 7986, 14556, 122887, 136462, 27198, 1314, 133684, 73011, 45391, 67466, 97, 5612, 93645, 12465, 30438, 289, 109524, 20600, 35782, 214, 362, 425, 5941, 2234, 50958, 1029, ...

[ 0.05572509765625, 0.011688232421875, 0.07000732421875, 0.06646728515625, 0.09521484375, 0.1761474609375, 0.1080322265625, 0.07763671875, 0.0170440673828125, 0.00628662109375, 0.0445556640625, 0.10565185546875, 0.022857666015625, 0.0155181884765625, 0.051055908203125, 0.21630859375, 0...

embed

45695566_c0

45695566

haskell

0

Title: How to convert Dynamic to Forall something Problem title: How to convert Dynamic to Forall something Tags: haskell Problem: How to convert Dynamic to Forall something I have a cache with Dynamic values. Some of them have the type Delayed a . Normally when I access the cache, I know the type a , so it's not a pro...

How to convert Dynamic to Forall something How to convert Dynamic to Forall something haskell How Dynamic Forall Delayed Maybe Delay MVar Bool Async How to convert Dynamic to Forall something I have a cache with Dynamic values. Some of them have the type Delayed a . Normally when I access the cache, I know the type a ,...

[ 0.0233154296875, -0.00885009765625, 0.0186767578125, -0.01336669921875, 0.00457763671875, -0.0113525390625, 0.0001373291015625, -0.0115966796875, 0.010009765625, -0.0284423828125, -0.00994873046875, -0.0096435546875, -0.00168609619140625, 0.0037689208984375, 0.002716064453125, -0.00741...

[ 11249, 96760, 73327, 21068, 47, 1326, 5584, 9844, 1556, 142508, 262, 5259, 297, 83425, 66160, 147, 2460, 929, 12654, 82365, 142424, 10644, 10, 17203, 3714, 1295, 29673, 37702, 11782, 32354, 3871, 23937, 5303, 55300, 53017, 17780, 3917, 2046, ...

[ 0.055389404296875, 0.193603515625, 0.1962890625, 0.2122802734375, 0.127197265625, 0.1400146484375, 0.2406005859375, 0.150390625, 0.0946044921875, 0.19580078125, 0.122314453125, 0.2247314453125, 0.125732421875, 0.2216796875, 0.04559326171875, 0.1334228515625, 0.030242919921875, 0.12...

embed

9675294_c0

9675294

haskell

0

Title: How can I tell cabal to specify a dependency for one of my program's dependencies? Problem title: How can I tell cabal to specify a dependency for one of my program's dependencies? Tags: cabal, constraints, haskell Problem: How can I tell cabal to specify a dependency for one of my program's dependenci...

How can I tell cabal to specify a dependency for one of my program's dependencies? How can I tell cabal to specify a dependency for one of my program's dependencies? cabal constraints haskell How Build-depends template-haskell-2.5.0.0 How can I tell cabal to specify a dependency for one of my program's depend...

[ 0.007659912109375, 0.0103759765625, 0.00994873046875, 0.006744384765625, 0.0047607421875, 0.006622314453125, -0.0203857421875, 0.0108642578125, 0.0118408203125, -0.01287841796875, 0.007659912109375, -0.037353515625, -0.0019989013671875, 0.00848388671875, 0.00189971923828125, 0.01007080...

[ 11249, 831, 14192, 109524, 47, 40140, 18929, 42548, 27771, 100, 1528, 3768, 117538, 759, 158, 2816, 4288, 1556, 142508, 121137, 105254, 110934, 10557, 48413, 99929, 1632, 30438, 289, 4527, 98169, 19437, 35273, 6626, 787, 966, 23742, 18, 45367...

[ 0.056488037109375, 0.05242919921875, 0.1695556640625, 0.26708984375, 0.03802490234375, 0.1781005859375, 0.09600830078125, 0.228271484375, 0.13525390625, 0.05047607421875, 0.1419677734375, 0.0253753662109375, 0.1243896484375, 0.030120849609375, 0.02850341796875, 0.1373291015625, 0.052...

embed

31435668_c1

31435668

haskell

1

types. For example, in GHCi: *Main> let x = Zn 5 3 *Main> x (3 mod 5) *Main> let y = Zn 5 7 (2 mod 5) *Main> let z = x + y *Main> z <interactive>:6:1: No instance for (Integral a0) arising from a use of ‘print’ The type variable ‘a0’ is ambiguous Note: there are several potential instances: instance Integral GHC.Int.I...

[ -0.02978515625, 0.002777099609375, -0.000030994415283203125, 0.01300048828125, -0.0032958984375, -0.002044677734375, 0.0167236328125, -0.005096435546875, 0.00439453125, -0.02392578125, -0.01104736328125, -0.01129150390625, 0.010986328125, -0.00009632110595703125, 0.00445556640625, 0.01...

[ 52895, 527, 73265, 14, 168793, 2633, 1022, 567, 19, 190, 138, 6896, 2811, 21162, 113, 361, 97, 997, 10433, 71232, 910, 19721, 438, 110527, 67, 5739, 10, 77495, 187, 72219, 4527, 35662, 10644, 77336, 11, 2389, 920, 12282, 10821, 38516, 2...

[ 0.27294921875, 0.1021728515625, 0.205322265625, 0.1917724609375, 0.1256103515625, 0.101806640625, 0.0679931640625, 0.06732177734375, 0.06646728515625, 0.10028076171875, 0.0826416015625, 0.01690673828125, 0.1348876953125, 0.072998046875, 0.0623779296875, 0.0243682861328125, 0.08740234...

embed

33723097_c0

33723097

haskell

0

Title: Random numbers in haskell. And shuffling a list Problem title: Random numbers in haskell. And shuffling a list Tags: haskell, numbers, random Problem: Random numbers in haskell. And shuffling a list i am trying to write a function that when given a list would return a lsit in random order. this is how i thought ...

Random numbers in haskell. And shuffling a list Random numbers in haskell. And shuffling a list haskell numbers random Random Random numbers in haskell. And shuffling a list i am trying to write a function that when given a list would return a lsit in random order. this is how i thought of doing it(the list is of lengt...

[ -0.0206298828125, 0.01904296875, 0.0240478515625, -0.0103759765625, 0.0223388671875, 0.0184326171875, -0.0120849609375, -0.018310546875, 0.00787353515625, -0.0252685546875, 0.0072021484375, 0.00811767578125, -0.008544921875, 0.0225830078125, 0.0191650390625, -0.0152587890625, 0.00067...

[ 39643, 306, 101935, 23, 1556, 142508, 3493, 8633, 4902, 2069, 5303, 96759, 31577, 33022, 32354, 3229, 34475, 30646, 6084, 12989, 17569, 140909, 7221, 139392, 14012, 17721, 106, 5646, 12830, 195625, 11782, 5701, 8651, 5117, 171739, 184750, 8520,...

[ 0.1456298828125, 0.1009521484375, 0.1875, 0.04150390625, 0.115966796875, 0.212890625, 0.0161285400390625, 0.0985107421875, 0.15771484375, 0.031280517578125, 0.1544189453125, 0.176513671875, 0.0499267578125, 0.040069580078125, 0.12109375, 0.000885009765625, 0.040069580078125, 0.1145...

embed

1571278_c0

1571278

haskell

0

Title: How to make Haskell use another list depending on the previous answer in Haskell Problem title: How to make Haskell use another list depending on the previous answer in Haskell Tags: haskell, optimization Problem: How to make Haskell use another list depending on the previous answer in Haskell I am doing project...

How to make Haskell use another list depending on the previous answer in Haskell How to make Haskell use another list depending on the previous answer in Haskell haskell optimization How Haskell prob63 How to make Haskell use another list depending on the previous answer in Haskell I am doing project euler question 63 ...

[ -0.009521484375, 0.019775390625, 0.005218505859375, -0.0074462890625, 0.01123046875, 0.01446533203125, 0.004791259765625, 0.00604248046875, 0.0179443359375, -0.0238037109375, 0.022216796875, -0.00933837890625, 0.005218505859375, 0.01202392578125, 0.000629425048828125, 0.001846313476562...

[ 11249, 3249, 20625, 142508, 4527, 15700, 5303, 96819, 98, 96362, 35166, 1556, 87235, 43011, 15748, 8, 23, 13452, 1175, 603, 9655, 12069, 7413, 41170, 101935, 32316, 7440, 78662, 653, 140909, 113, 50339, 35431, 75939, 17721, 70270, 3853, 1257,...

[ 0.04327392578125, 0.0823974609375, 0.147705078125, 0.2403564453125, 0.1219482421875, 0.12109375, 0.1884765625, 0.140380859375, 0.041900634765625, 0.1090087890625, 0.1292724609375, 0.11669921875, 0.1248779296875, 0.1829833984375, 0.2293701171875, 0.002197265625, 0.002349853515625, 0...

embed

24856963_c0

24856963

haskell

0

Title: How does lifting (in a functional programming context) relate to category theory? Problem title: How does lifting (in a functional programming context) relate to category theory? Tags: category-theory, haskell Problem: How does lifting (in a functional programming context) relate to category theory? Looking at t...

How does lifting (in a functional programming context) relate to category theory? How does lifting (in a functional programming context) relate to category theory? category-theory haskell How How does lifting (in a functional programming context) relate to category theory? Looking at the Haskell documentation, lifting ...

[ 0.0142822265625, 0.00604248046875, -0.00008058547973632812, -0.004638671875, 0.0015869140625, -0.003448486328125, -0.00311279296875, -0.0301513671875, 0.00848388671875, -0.0269775390625, -0.0128173828125, -0.034912109375, -0.02001953125, 0.0135498046875, -0.013916015625, -0.00573730468...

[ 11249, 177691, 123309, 56037, 43701, 33444, 95487, 154453, 2347, 30675, 1556, 142508, 14602, 13, 47, 20625, 209806, 198343, 4537, 47691, 1238, 62346, 190358, 291, 26783, 32354, 1632, 10750, 8162, 5582, 12921, 13204, 104501, 178851, 8780, 36746, ...

[ 0.0258636474609375, 0.2890625, 0.1522216796875, 0.14111328125, 0.1641845703125, 0.15087890625, 0.2452392578125, 0.208740234375, 0.0999755859375, 0.0562744140625, 0.111328125, 0.206298828125, 0.0280303955078125, 0.0743408203125, 0.034423828125, 0.1163330078125, 0.05194091796875, 0.0...

embed

27273370_c1

27273370

haskell

1

) ) I want to store [TreadID,FibNo] into a List for all the threads as per their execution. Suppose T1 has executed Fib30, T2 Fib35, T3->32 and T4->40. And if the commit sequence of threads like T1,T3, T2 and T4 then I want to store T1-35,T3-32,t2-35,t4-40 in a list. Edit: As suggested by @MathematicalOrchid, I have mo...

[ -0.0004558563232421875, 0.0120849609375, -0.0045166015625, -0.001129150390625, 0.006072998046875, 0.00799560546875, -0.0042724609375, 0.02587890625, 0.0029449462890625, -0.0289306640625, 0.007293701171875, 0.01507568359375, 0.01422119140625, -0.0238037109375, 0.0186767578125, 0.0016632...

[ 3444, 4343, 39116, 7146, 6159, 275, 5021, 3934, 10, 32036, 100, 756, 86997, 7, 117, 71924, 384, 418, 1556, 297, 3698, 1197, 304, 5843, 363, 6460, 617, 2839, 375, 4007, 944, 618, 40176, 108760, 41734, 23, 5303, 140363, 206, 73197, 28350,...

[ 0.08343505859375, 0.2073974609375, 0.150390625, 0.1754150390625, 0.12060546875, 0.097412109375, 0.185302734375, 0.107666015625, 0.03912353515625, 0.198486328125, 0.013916015625, 0.0416259765625, 0.2305908203125, 0.01751708984375, 0.0389404296875, 0.1656494140625, 0.0858154296875, 0...

embed

19484770_c0

19484770

haskell

0

Title: State monad with Predicates Problem title: State monad with Predicates Tags: state-monad, haskell Problem: State monad with Predicates I'm attempting to create something that looks a lot like the State monad, but also carries a list of predicates and accompanying transition functions over the state. The basic st...

State monad with Predicates State monad with Predicates state-monad haskell State Predicates Foo State monad with Predicates I'm attempting to create something that looks a lot like the State monad, but also carries a list of predicates and accompanying transition functions over the state. The basic steps for computati...

[ -0.00665283203125, -0.0145263671875, 0.00112152099609375, 0.0002498626708984375, -0.004425048828125, 0.004486083984375, 0.00933837890625, -0.0024566650390625, 0.0040283203125, -0.0302734375, 0.02099609375, 0.0283203125, -0.032958984375, 0.008056640625, -0.01708984375, 0.00775146484375,...

[ 22836, 2667, 712, 678, 7145, 2063, 1636, 11341, 3796, 1556, 142508, 9572, 31, 81887, 28282, 9844, 33342, 5915, 1884, 2258, 5303, 1653, 146365, 149307, 32354, 645, 62822, 98441, 181135, 1363, 22, 25826, 28960, 61340, 19714, 808, 6396, 1369, ...

[ 0.1900634765625, 0.1573486328125, 0.17431640625, 0.1021728515625, 0.1788330078125, 0.2099609375, 0.05108642578125, 0.1805419921875, 0.105224609375, 0.1220703125, 0.20751953125, 0.17724609375, 0.1522216796875, 0.069580078125, 0.10302734375, 0.00555419921875, 0.109619140625, 0.032226...

embed

42299126_c0

42299126

haskell

0

Title: Can't make function more polymorphic Problem title: Can't make function more polymorphic Tags: types, haskell Problem: Can't make function more polymorphic I'm trying to define a function to return each of the nth roots of unity . This compiles, unity n = map (cis.(*2).(*pi).(/n)) [0..(n-1)] but its ty...

Can't make function more polymorphic Can't make function more polymorphic types haskell Can n-1 Enum Floating Complex Integral Can't make function more polymorphic I'm trying to define a function to return each of the nth roots of unity . This compiles, but its type defaults to unity :: (Enum a, Floating a) =...

[ -0.012939453125, -0.0016632080078125, 0.01251220703125, 0.0098876953125, 0.001678466796875, 0.00262451171875, 0.0140380859375, -0.0191650390625, -0.000843048095703125, -0.0220947265625, -0.00750732421875, -0.0286865234375, 0.0107421875, 0.00921630859375, -0.0211181640625, -0.0187988281...

[ 4171, 3768, 18, 3249, 32354, 1286, 35874, 178851, 52895, 1556, 142508, 653, 5759, 357, 316, 38699, 26518, 113197, 204681, 1771, 31577, 61924, 30646, 12638, 927, 74855, 51, 2481, 9969, 1340, 10644, 114977, 1984, 647, 2606, 10, 44357, 10770, ...

[ 0.0596923828125, 0.06585693359375, 0.11572265625, 0.1048583984375, 0.1583251953125, 0.1243896484375, 0.1851806640625, 0.1849365234375, 0.1524658203125, 0.1094970703125, 0.2335205078125, 0.113525390625, 0.1400146484375, 0.0823974609375, 0.1851806640625, 0.1605224609375, 0.127197265625...

embed

44778404_c1

44778404

haskell

1

.0.2-with-packages/bin/ghc ~/.xmonad/xmonad.hs [1 of 1] Compiling Main ( /home/martyn/.xmonad/xmonad.hs, /home/martyn/.xmonad/xmonad.o ) [flags changed] Linking /home/martyn/.xmonad/xmonad ... But even the version of xmonad in that dir cannot find the libs: $ /nix/store/7mkxsq7ydqcgnjbs59v1v47wfxpwrav5-ghc-8.0.2-with-p...

[ -0.0203857421875, 0.01312255859375, -0.01318359375, 0.0108642578125, 0.00347900390625, 0.039306640625, -0.00933837890625, 0.0081787109375, -0.0185546875, -0.01806640625, -0.0166015625, -0.02587890625, -0.0012664794921875, -0.016845703125, 0.0089111328125, -0.0224609375, -0.0039672851...

[ 5, 133684, 76228, 29102, 7568, 9486, 238, 425, 3796, 712, 127, 7, 111, 106, 15612, 49725, 12321, 29552, 1727, 30797, 31, 190872, 98816, 12779, 214, 153, 3853, 11389, 1022, 23, 450, 5402, 53418, 7413, 70, 25474, 93, 45804, 19201, 12975, ...

[ 0.005584716796875, 0.25390625, 0.1026611328125, 0.1610107421875, 0.11181640625, 0.09619140625, 0.09857177734375, 0.07421875, 0.1788330078125, 0.1866455078125, 0.1256103515625, 0.0086669921875, 0.033599853515625, 0.03424072265625, 0.115478515625, 0.14306640625, 0.1226806640625, 0.11...

embed

47085877_c2

47085877

haskell

2

/ghcjs-0.2.1.9007019_ghc-8.0.1/src/.stack-work/dist/x86_64-linux/Cabal-1.24.0.0/setup/setup ... Configuring ghcjs-0.2.1.9007019... ghcjs-0.2.1.9007019: build (lib + exe) Preprocessing library ghcjs-0.2.1.9007019... /home/u/.stack/programs/x86_64-linux/ghcjs-0.2.1.9007019_ghc-8.0.1/src/src/Compiler/JMacro/Base.hs:1:55: ...

[ -0.01544189453125, -0.0047607421875, -0.00087738037109375, -0.019287109375, 0.0225830078125, 0.021240234375, -0.0296630859375, -0.00140380859375, 0.010986328125, 0.02197265625, -0.026611328125, -0.0228271484375, 0.01300048828125, 0.00994873046875, 0.007080078125, 0.0233154296875, -0....

[ 248, 9486, 238, 28175, 9, 133684, 22892, 20543, 5757, 2947, 17376, 5, 102014, 19437, 64, 590, 2594, 18244, 46295, 15276, 13307, 2397, 6077, 20370, 3571, 5759, 20682, 99929, 3509, 2037, 153, 1657, 59994, 214, 31380, 27, 12, 45367, 5612, 99...

[ 0.051300048828125, 0.140625, 0.155517578125, 0.268798828125, 0.06634521484375, 0.197998046875, 0.1168212890625, 0.1590576171875, 0.1448974609375, 0.1868896484375, 0.1727294921875, 0.0279083251953125, 0.2069091796875, 0.1063232421875, 0.02020263671875, 0.1302490234375, 0.12109375, 0...

embed

9936260_c0

9936260

haskell

0

Title: Custom ord and chr functions Problem title: Custom ord and chr functions Tags: encryption, haskell, cryptography Problem: Custom ord and chr functions I need to write "custom" ord and chr functions. I'm writing a little program to apply a Caesar cipher to a message. What is the fastest way to do this? The functi...

Custom ord and chr functions Custom ord and chr functions encryption haskell cryptography Custom caesarencipher::Int caesardecipher::Int Custom ord and chr functions I need to write "custom" ord and chr functions. I'm writing a little program to apply a Caesar cipher to a message. What is the fastest way to do this? Th...

[ -0.0089111328125, -0.006744384765625, 0.00933837890625, -0.01531982421875, -0.01043701171875, 0.0027923583984375, 0.00189971923828125, -0.01611328125, -0.0025787353515625, 0.000934600830078125, 0.0019989013671875, -0.00726318359375, -0.0126953125, 0.0213623046875, -0.02001953125, 0.010...

[ 130664, 8597, 136, 17656, 32354, 136791, 1556, 142508, 377, 90, 1744, 94266, 65858, 318, 3871, 33022, 11680, 5928, 32562, 10176, 1528, 59911, 64914, 1059, 26008, 4271, 525, 3917, 6651, 4734, 27117, 5646, 62816, 30646, 95307, 14012, 284, 5608,...

[ 0.214111328125, 0.2327880859375, 0.14794921875, 0.163330078125, 0.209716796875, 0.14599609375, 0.085693359375, 0.1629638671875, 0.02545166015625, 0.0443115234375, 0.05377197265625, 0.1898193359375, 0.08392333984375, 0.008544921875, 0.03399658203125, 0.0919189453125, 0.0982666015625, ...

embed

67549556_c1

67549556

haskell

1

) = Reduce pi u x Reduce pi u (pi (pi x y) z) = Reduce pi u (pi (Reduce pi u x) (pi (Reduce pi u y) (Reduce pi u z) ) ) Reduce pi u x = x Trying this out at the ghci repl, this seems to give me the correct "normalized" monoidal types: > let x :: Reduce (,) () (((), Int), String) = undefined > :t x x :: (Int, [Char]) Gr...

[ -0.043212890625, -0.010498046875, 0.001983642578125, 0.037109375, -0.01007080078125, -0.006317138671875, -0.020263671875, -0.009765625, 0.020263671875, -0.00628662109375, -0.006927490234375, -0.0301513671875, 0.01318359375, -0.007537841796875, -0.003936767578125, -0.00946044921875, -...

[ 1388, 2203, 853, 106357, 2147, 75, 1022, 1434, 113, 97, 15, 4332, 31380, 318, 2424, 37202, 26785, 33176, 29367, 22460, 14, 2465, 52895, 2633, 128258, 360, 18, 23351, 214, 9232, 5983, 1984, 4153, 84068, 32774, 70, 6528, 456, 434, 18781, ...

[ 0.072998046875, 0.044677734375, 0.191162109375, 0.2607421875, 0.202392578125, 0.1964111328125, 0.136962890625, 0.1873779296875, 0.1168212890625, 0.1142578125, 0.00140380859375, 0.073974609375, 0.041015625, 0.043670654296875, 0.07257080078125, 0.006866455078125, 0.0999755859375, 0.1...

embed

68416397_c1

68416397

haskell

1

1s b2s where t' ((Pair a11 a12) : a1s) ((Pair a21 a22) : a2s) = Pair ((Pair a11 a21) :) ((Pair a12 a22) :) <*> t' a1s a2s t' [] [] = pure [] -- A runtime error here is ok; I have external guarantees that this won't happen. t' _ _ = error "Transposition requires the lists to be of equal length." Example: > let subject =...

[ -0.023193359375, 0.0213623046875, -0.0030670166015625, 0.00811767578125, 0.0042724609375, 0.0021209716796875, -0.0289306640625, -0.03564453125, 0.00872802734375, -0.018798828125, 0.01055908203125, 0.025146484375, 0.0040283203125, -0.0004177093505859375, -0.0299072265625, -0.00982666015...

[ 106, 7, 876, 304, 7440, 808, 25, 8335, 481, 10, 1662, 55102, 418, 3117, 89647, 2203, 1342, 69072, 1530, 34166, 11675, 6032, 18499, 3688, 3664, 173591, 142027, 62624, 40322, 144570, 5303, 47, 186, 111, 105950, 140909, 89536, 2633, 28368, 2...

[ 0.1190185546875, 0.1142578125, 0.07464599609375, 0.1964111328125, 0.011688232421875, 0.1505126953125, 0.058929443359375, 0.1402587890625, 0.1865234375, 0.09228515625, 0.14208984375, 0.10186767578125, 0.09771728515625, 0.1197509765625, 0.112060546875, 0.038482666015625, 0.177001953125...

embed

58728301_c0

58728301

haskell

0

Title: Binary Search Tree Implementation in Haskell Problem title: Binary Search Tree Implementation in Haskell Tags: haskell, binary-tree Problem: Binary Search Tree Implementation in Haskell I am working on an assignment in Haskell and had a question about the implementation of a binary search tree that I was given. ...

Binary Search Tree Implementation in Haskell Binary Search Tree Implementation in Haskell haskell binary-tree Binary Search Tree Implementation Haskell EmptyTree Node Show Leaf Branch Binary Search Tree Implementation in Haskell I am working on an assignment in Haskell and had a question about the implementation of a b...

[ 0.031982421875, 0.0257568359375, 0.002197265625, -0.000850677490234375, 0.02392578125, 0.0216064453125, -0.025634765625, -0.033203125, -0.0037078857421875, -0.01141357421875, -0.01055908203125, -0.033203125, -0.0037384033203125, 0.01214599609375, -0.0130615234375, 0.0091552734375, 0....

[ 54092, 1294, 33086, 101344, 153941, 20625, 142508, 1556, 2394, 6635, 62600, 31678, 939, 62731, 438, 112, 17367, 636, 2407, 21110, 206, 20697, 95486, 208124, 33938, 53201, 34475, 12877, 25632, 80934, 10422, 40101, 201505, 12830, 70541, 34292, 66...

[ 0.21435546875, 0.1173095703125, 0.218017578125, 0.265625, 0.191650390625, 0.125, 0.2254638671875, 0.07452392578125, 0.1839599609375, 0.156982421875, 0.198486328125, 0.14453125, 0.08331298828125, 0.1746826171875, 0.1068115234375, 0.05975341796875, 0.10791015625, 0.040496826171875, ...

embed

17322586_c0

17322586

haskell

0

Title: Parallel tree search Problem title: Parallel tree search Tags: parallel-processing, haskell Problem: Parallel tree search Let's say I have a lazy Tree whose leaves are possible solutions to a problem data Tree a = Node [Tree a] | Leaf (Maybe a) I need to find just one solution (or find out that there are none). ...

Parallel tree search Parallel tree search parallel-processing haskell Parallel Tree Node Leaf Maybe Parallel tree search Let's say I have a lazy Tree whose leaves are possible solutions to a problem I need to find just one solution (or find out that there are none). I have a P -core machine. From both time and memory e...

[ -0.0030670166015625, 0.0294189453125, -0.01104736328125, 0.007232666015625, 0.01007080078125, 0.01055908203125, 0.00567626953125, -0.038330078125, -0.0098876953125, -0.060546875, -0.0069580078125, 0.00732421875, 0.009521484375, 0.0111083984375, 0.00921630859375, 0.019775390625, 0.015...

[ 211485, 53201, 33938, 95103, 63923, 1556, 142508, 101344, 438, 112, 636, 2407, 83425, 765, 21, 3285, 31358, 7, 7722, 51347, 47, 2967, 3871, 7413, 1660, 1632, 29806, 436, 30854, 36279, 1733, 98323, 227066, 10422, 33233, 12921, 90356, 23, 139...

[ 0.2373046875, 0.2452392578125, 0.2236328125, 0.25244140625, 0.090087890625, 0.1224365234375, 0.243896484375, 0.2291259765625, 0.07696533203125, 0.03955078125, 0.059234619140625, 0.1319580078125, 0.013519287109375, 0.018096923828125, 0.0850830078125, 0.1561279296875, 0.18017578125, ...

embed

42847682_c0

42847682

haskell

0

Title: Why is this function being called every time I try to get its value? Problem title: Why is this function being called every time I try to get its value? Tags: pi, recursion, haskell Problem: Why is this function being called every time I try to get its value? I have this Haskell code that I wrote to calculate pi...

Why is this function being called every time I try to get its value? Why is this function being called every time I try to get its value? pi recursion haskell Why Main Why is this function being called every time I try to get its value? I have this Haskell code that I wrote to calculate pi using the series π/4 = 1 - 1/...

[ 0.0004520416259765625, -0.0052490234375, 0.005340576171875, -0.03271484375, -0.00592041015625, -0.0224609375, 0.0167236328125, -0.0157470703125, 0.007110595703125, -0.026123046875, -0.02294921875, -0.0177001953125, -0.0198974609375, -0.008056640625, 0.0257568359375, 0.01348876953125, ...

[ 44084, 83, 903, 32354, 8035, 35839, 11907, 1733, 87, 9790, 47, 2046, 6863, 34292, 2147, 195625, 1830, 1556, 142508, 12321, 20625, 18151, 54397, 74481, 67, 17368, 36549, 7823, 17357, 106, 62366, 997, 12147, 32359, 22364, 13028, 527, 73265, 1...

[ 0.15576171875, 0.08038330078125, 0.1204833984375, 0.2235107421875, 0.13330078125, 0.2188720703125, 0.2042236328125, 0.2127685546875, 0.059417724609375, 0.191650390625, 0.048553466796875, 0.136474609375, 0.059539794921875, 0.1905517578125, 0.271728515625, 0.25341796875, 0.154052734375...

embed

11592962_c0

11592962

haskell

0

Title: Yampa Particle Field Problem title: Yampa Particle Field Tags: yampa, haskell, particle-system Problem: Yampa Particle Field I want to have a particle field in Yampa. The single particle should just move in a straight line, but depending on an angle given. That angle and movement speed changes depending on the p...

Yampa Particle Field Yampa Particle Field yampa haskell particle-system Yampa Particle Field Float x-2 y-2 Yampa Particle Field I want to have a particle field in Yampa. The single particle should just move in a straight line, but depending on an angle given. That angle and movement speed changes depending on the playe...

[ -0.005706787109375, -0.0120849609375, 0.01275634765625, 0.0172119140625, 0.004180908203125, 0.012451171875, 0.00909423828125, -0.01263427734375, 0.0022735595703125, -0.008544921875, -0.009521484375, 0.0177001953125, -0.0018157958984375, -0.00147247314453125, 0.0035858154296875, -0.0207...

[ 2369, 15293, 436, 26147, 117657, 151, 1556, 142508, 915, 16751, 38699, 1022, 5428, 113, 87, 3444, 765, 10, 44457, 23, 11001, 5608, 1660, 25813, 80560, 13315, 1284, 96819, 55291, 34475, 9925, 136, 112664, 38352, 65572, 58585, 73342, 168698, ...

[ 0.2025146484375, 0.2978515625, 0.0867919921875, 0.2314453125, 0.209228515625, 0.1300048828125, 0.130126953125, 0.2135009765625, 0.12109375, 0.1507568359375, 0.1494140625, 0.06298828125, 0.1229248046875, 0.06787109375, 0.009307861328125, 0.118408203125, 0.0882568359375, 0.0969238281...

embed

23119583_c0

23119583

haskell

0

Title: Apply polymorphic function in a GHC plugin Problem title: Apply polymorphic function in a GHC plugin Tags: haskell, ghc Problem: Apply polymorphic function in a GHC plugin I would like to write a GHC plugin which "adds a hook" to each function. Say I want to apply a function addHook of type Ord a => (a -> b) -> ...

Apply polymorphic function in a GHC plugin Apply polymorphic function in a GHC plugin haskell ghc Apply GHC Ord RHS AddHook GHC.Types.Int GHC.Classes.$fOrdInt Apply polymorphic function in a GHC plugin I would like to write a GHC plugin which "adds a hook" to each function. Say I want to apply a function addHook of typ...

[ 0.00185394287109375, -0.01007080078125, 0.0322265625, -0.01129150390625, 0.0036163330078125, 0.0208740234375, 0.0002536773681640625, -0.00933837890625, 0.01080322265625, -0.04443359375, 0.030029296875, -0.03271484375, -0.01287841796875, 0.0166015625, 0.0137939453125, -0.0308837890625, ...

[ 5659, 538, 35874, 178851, 1771, 32354, 527, 73265, 69993, 23, 1556, 142508, 31380, 238, 35379, 68416, 294, 29117, 11193, 685, 196707, 4153, 18, 140803, 143045, 1884, 33022, 712, 6468, 10, 150522, 12638, 3444, 59911, 15190, 10644, 876, 7108, ...

[ 0.1502685546875, 0.02337646484375, 0.204345703125, 0.2266845703125, 0.089599609375, 0.187744140625, 0.09661865234375, 0.225341796875, 0.255859375, 0.02392578125, 0.10113525390625, 0.2017822265625, 0.086669921875, 0.07073974609375, 0.1524658203125, 0.106201171875, 0.085693359375, 0....

embed

40506692_c0

40506692

haskell

0

Title: Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? Problem title: Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? Tags: haskell, packet-capture, pcap, packets, packet-sniffers Problem: Parsing a PCAP file - Why does this packet header timestamp contains SO...

Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? haskell packet-capture pcap packets packet-sniffers Parsing PCAP Why SOH Start Header Parsing a PCAP file - Why does this packet header timestamp contains SOH \01? ...

[ 0.0126953125, 0.016357421875, -0.0008697509765625, 0.0257568359375, -0.00372314453125, -0.01324462890625, -0.006561279296875, -0.0111083984375, -0.0029449462890625, 0.012451171875, 0.0164794921875, -0.01806640625, -0.0177001953125, 0.00830078125, -0.016357421875, 0.00191497802734375, ...

[ 2392, 6953, 436, 136629, 11435, 44084, 903, 43824, 10336, 56, 1733, 590, 2676, 70541, 159, 56585, 41872, 6746, 1556, 142508, 15644, 915, 93, 18234, 13794, 44816, 125663, 5117, 201, 390, 1636, 5608, 33636, 102134, 94131, 12989, 170894, 3311, ...

[ 0.135498046875, 0.01397705078125, 0.07244873046875, 0.26220703125, 0.1220703125, 0.12646484375, 0.0253448486328125, 0.1318359375, 0.1737060546875, 0.0765380859375, 0.0567626953125, 0.1007080078125, 0.0804443359375, 0.1025390625, 0.115966796875, 0.293212890625, 0.079345703125, 0.197...

embed

22515206_c0

22515206

haskell

0

Title: How can monads determine ordering if their information is lost upon normalization? Problem title: How can monads determine ordering if their information is lost upon normalization? Tags: monads, haskell Problem: How can monads determine ordering if their information is lost upon normalization? If I understood co...

How can monads determine ordering if their information is lost upon normalization? How can monads determine ordering if their information is lost upon normalization? monads haskell How What Welcome How can monads determine ordering if their information is lost upon normalization? If I understood correctly, a monad is j...

[ -0.01708984375, 0.00677490234375, 0.009033203125, 0.0208740234375, 0.0289306640625, 0.0284423828125, 0.004241943359375, -0.01287841796875, 0.0054931640625, -0.01300048828125, 0.007598876953125, -0.03173828125, -0.01123046875, -0.02001953125, -0.005126953125, -0.017822265625, 0.005401...

[ 11249, 831, 2667, 712, 7, 83324, 12989, 214, 2174, 4677, 83, 72856, 54799, 3638, 47691, 1556, 142508, 4865, 91334, 217064, 10, 1660, 208124, 68557, 6396, 1369, 136, 30646, 39933, 25632, 24233, 91736, 198343, 150350, 116, 32354, 12921, 52895, ...

[ 0.06793212890625, 0.0777587890625, 0.21435546875, 0.281982421875, 0.1185302734375, 0.1981201171875, 0.26318359375, 0.1453857421875, 0.10693359375, 0.1453857421875, 0.0994873046875, 0.1878662109375, 0.0980224609375, 0.197021484375, 0.153076171875, 0.10699462890625, 0.243408203125, 0...

embed

70052100_c2

70052100

haskell

2

-0.12.8... Failed to install classy-prelude-0.12.8 Build log ( /home/usr/.cabal/logs/classy-prelude-0.12.8.log ): cabal: Entering Code signals: vector-0.12.3.1, text-1.2.2.2, mono-traversable-1.0.9.0, hackage.haskell.org, ClassyPrelude.hs:229:1, Failed, Data.Textual.Encoding, Resolving, Configuring, classy-prelude-0.12...

[ 0.004547119140625, 0.01123046875, 0.021240234375, 0.006500244140625, -0.0030975341796875, -0.0120849609375, -0.007415771484375, -0.035888671875, -0.00732421875, 0.025634765625, -0.0142822265625, -0.01397705078125, -0.00885009765625, -0.0159912109375, 0.00396728515625, 0.01007080078125,...

[ 102014, 82295, 27, 190355, 297, 47, 20600, 18507, 53, 4692, 822, 112, 121137, 12684, 29552, 223, 408, 3571, 4867, 67413, 109524, 357, 33558, 28864, 26073, 173, 18770, 15654, 97109, 7986, 48400, 70147, 22460, 1517, 7864, 2886, 102107, 38331, ...

[ 0.1761474609375, 0.250244140625, 0.020477294921875, 0.235595703125, 0.07281494140625, 0.0257415771484375, 0.217529296875, 0.2149658203125, 0.1961669921875, 0.138427734375, 0.2047119140625, 0.14990234375, 0.168212890625, 0.1749267578125, 0.033233642578125, 0.001800537109375, 0.0786132...

embed

57996516_c0

57996516

haskell

0

Title: Using Servant, Selda, and SQLite together Problem title: Using Servant, Selda, and SQLite together Tags: servant, haskell Problem: Using Servant, Selda, and SQLite together I have been using Haskell for a year or so, and it is fantastic. I have recently started using Servant; and I would like to use an SQL-libra...

Using Servant, Selda, and SQLite together Using Servant, Selda, and SQLite together servant haskell Using Servant Selda SQLite Using Servant, Selda, and SQLite together I have been using Haskell for a year or so, and it is fantastic. I have recently started using Servant; and I would like to use an SQL-library such as ...

[ 0.005401611328125, 0.006256103515625, 0.004150390625, 0.02294921875, -0.0205078125, -0.004302978515625, -0.0208740234375, -0.010009765625, 0.0059814453125, -0.03369140625, 0.0169677734375, -0.0247802734375, 0.00439453125, 0.00830078125, -0.0205078125, 0.006561279296875, -0.0061950683...

[ 345, 5406, 30624, 11623, 85, 136, 80866, 1486, 25842, 187646, 1556, 142508, 17368, 20625, 6602, 4, 47823, 26859, 1884, 47, 4527, 9, 150, 2844, 1294, 6044, 26818, 10644, 115840, 83, 29568, 538, 190098, 70163, 71, 678, 540, 39, 27781, 32102...

[ 0.082275390625, 0.17529296875, 0.261474609375, 0.1962890625, 0.205322265625, 0.027679443359375, 0.1790771484375, 0.26220703125, 0.1593017578125, 0.2021484375, 0.0826416015625, 0.2099609375, 0.126708984375, 0.0721435546875, 0.0389404296875, 0.00164794921875, 0.08319091796875, 0.0052...

embed

58403682_c0

58403682

haskell

0

Title: What is the syntax for different recursions depending on two boolean guards? Problem title: What is the syntax for different recursions depending on two boolean guards? Tags: function, definition, guard-clause, syntax, haskell Problem: What is the syntax for different recursions depending on two boolean guards? ...

What is the syntax for different recursions depending on two boolean guards? What is the syntax for different recursions depending on two boolean guards? function definition guard-clause syntax haskell What Integer x:xs Perhaps What is the syntax for different recursions depending on two boolean guards? I'm very new to...

[ -0.02685546875, 0.0213623046875, -0.00531005859375, -0.00311279296875, 0.0026092529296875, 0.00799560546875, -0.0189208984375, 0.0022735595703125, 0.004180908203125, 0.017578125, 0.03271484375, -0.005859375, -0.028564453125, -0.007080078125, 0.016357421875, -0.0072021484375, -0.01684...

[ 6002, 86531, 12921, 195625, 17514, 96819, 6626, 337, 31, 34677, 56050, 7, 32354, 80934, 18347, 4032, 1556, 142508, 44401, 1022, 12, 425, 181799, 3525, 20625, 33022, 8781, 5646, 10298, 892, 26255, 237, 107730, 30646, 12996, 756, 80854, 83080, ...

[ 0.1512451171875, 0.2388916015625, 0.198974609375, 0.230712890625, 0.1412353515625, 0.12939453125, 0.1446533203125, 0.0408935546875, 0.10693359375, 0.1473388671875, 0.224365234375, 0.043731689453125, 0.1275634765625, 0.05120849609375, 0.07330322265625, 0.0576171875, 0.10540771484375, ...

embed

11571520_c0

11571520

haskell

0

Title: Reify a module into a record Problem title: Reify a module into a record Tags: template-haskell, module, haskell, ghc-api Problem: Reify a module into a record Suppose I have an arbitrary module module Foo where foo :: Moo -> Goo bar :: Car -> Far baz :: Can -> Haz where foo , bar , and baz are correctly impleme...

Reify a module into a record Reify a module into a record template-haskell module haskell ghc-api Foo qualified Reify Moo Goo Car Far Can Haz FooModule _Foo_ Foo.foo Foo.bar Foo.baz Reify a module into a record Suppose I have an arbitrary module where foo , bar , and baz are correctly implemented, etc. I'd like to reif...

[ -0.000743865966796875, -0.003326416015625, -0.0091552734375, 0.021484375, 0.00537109375, 0.03466796875, 0.01025390625, 0.000263214111328125, -0.006011962890625, -0.0286865234375, 0.000904083251953125, -0.017578125, -0.00421142578125, -0.0022430419921875, -0.0050048828125, -0.0045776367...

[ 853, 40383, 88996, 3934, 10, 17164, 110934, 10557, 142508, 1556, 31380, 238, 40897, 9572, 31, 217225, 62097, 131257, 3980, 7325, 4171, 57377, 91616, 8782, 27591, 3584, 1299, 40300, 61799, 5775, 1909, 16627, 26785, 29479, 1884, 456, 191082, 48...

[ 0.1512451171875, 0.25830078125, 0.2666015625, 0.140869140625, 0.056732177734375, 0.253173828125, 0.2115478515625, 0.0892333984375, 0.2305908203125, 0.121337890625, 0.09521484375, 0.05938720703125, 0.11376953125, 0.130615234375, 0.1136474609375, 0.1785888671875, 0.1346435546875, 0.1...

embed

16678440_c0

16678440

haskell

0

Title: Why do these folds stop at the head/tail? Problem title: Why do these folds stop at the head/tail? Tags: haskell, functional-programming, function, fold Problem: Why do these folds stop at the head/tail? I'm reading learnyouahaskell.com and currently investigating folds. In the book there are these examples: max...

Why do these folds stop at the head/tail? Why do these folds stop at the head/tail? haskell functional-programming function fold Why Ord foldr1 Num Bool foldl1 Why do these folds stop at the head/tail? I'm reading learnyouahaskell.com and currently investigating folds. In the book there are these examples: I understand...

[ 0.0037078857421875, 0.005096435546875, 0.0162353515625, 0.001007080078125, -0.01025390625, 0.039306640625, -0.004913330078125, 0.0033721923828125, 0.00750732421875, -0.011474609375, 0.032470703125, -0.0213623046875, -0.01080322265625, 0.0026397705078125, 0.0233154296875, -0.00328063964...

[ 44084, 6097, 42822, 7, 7279, 99, 10336, 64, 46741, 1556, 142508, 123309, 28966, 32354, 35379, 18344, 7569, 418, 52782, 2460, 929, 20469, 54, 70, 53927, 7232, 12877, 27781, 28219, 40494, 25, 136, 100094, 2394, 6635, 5608, 190659, 183278, 129...

[ 0.1387939453125, 0.08837890625, 0.24609375, 0.1199951171875, 0.1978759765625, 0.1160888671875, 0.2125244140625, 0.08197021484375, 0.25439453125, 0.1370849609375, 0.221923828125, 0.1260986328125, 0.0880126953125, 0.1358642578125, 0.1546630859375, 0.1156005859375, 0.10687255859375, 0...

embed

74560491_c1

74560491

haskell

1

CoPat pats ty' <- normSubst (val, var) ty pure (NormCoVal pats' ty') Relevant type signatures include: data Normal = ... | NormCoVal (forall m. (MonadReader Environment m, MonadError String m, MonadState ProgState m) => [(CoPattern, m Normal)]) Normal substCoPat :: (MonadReader Environment m, MonadError String m, Monad...

[ -0.022216796875, 0.007781982421875, -0.0191650390625, 0.01446533203125, 0.02685546875, 0.01312255859375, -0.0240478515625, -0.0186767578125, -0.00017261505126953125, -0.01177978515625, -0.00012874603271484375, -0.004974365234375, 0.007293701171875, -0.009033203125, -0.0003108978271484375...

[ 1311, 683, 257, 24114, 2281, 25, 4426, 22599, 96472, 271, 1405, 285, 34166, 50645, 39, 10625, 42272, 133, 30624, 10644, 138256, 2053, 28723, 2203, 88859, 5584, 347, 46674, 712, 31345, 56, 686, 1900, 60331, 18468, 31611, 23351, 135206, 1250,...

[ 0.161865234375, 0.1937255859375, 0.221435546875, 0.23681640625, 0.0877685546875, 0.125, 0.0205078125, 0.1826171875, 0.1673583984375, 0.1405029296875, 0.154296875, 0.1429443359375, 0.1573486328125, 0.07623291015625, 0.0560302734375, 0.145263671875, 0.17138671875, 0.076416015625, 0...

embed

77441659_c0

77441659

haskell

0

Title: Haskell after install the conduit package Problem title: Haskell after install the conduit package Tags: haskell-stack, conduit, haskell, cabal Problem: Haskell after install the conduit package I`m new in the Haskell and do the task for my class. I install it in VSCode, downloaded the extension for it and every...

Haskell after install the conduit package Haskell after install the conduit package haskell-stack conduit haskell cabal Haskell ghc-9.4.7.exe ghc-9.4.7 hashable-1.4.3.0-1961fe79003fd705645c177b7f4aca0399a4d276 libHShashable-1.4.3.0-1961fe79003fd705645c177b7f4aca0399a4d276.a LowLevel.o Not x86_64 Unknown COFF GHC Please...

[ -0.0062255859375, -0.005859375, 0.01434326171875, 0.03466796875, 0.010009765625, 0.006927490234375, -0.0203857421875, 0.0145263671875, -0.010986328125, -0.00023937225341796875, -0.01129150390625, -0.0308837890625, 0.021484375, -0.01019287109375, 0.00433349609375, 0.00002241134643554687...

[ 20625, 142508, 7103, 20600, 120565, 98169, 1556, 590, 2594, 109524, 31380, 238, 15205, 29485, 966, 46480, 127, 2886, 91977, 132265, 160733, 11835, 25474, 38131, 126234, 144283, 11, 61187, 5267, 2601, 31, 11205, 15276, 13307, 69723, 125754, 527,...

[ 0.166015625, 0.26318359375, 0.1358642578125, 0.1934814453125, 0.27783203125, 0.1722412109375, 0.136474609375, 0.06982421875, 0.09808349609375, 0.1932373046875, 0.0784912109375, 0.06512451171875, 0.1253662109375, 0.1397705078125, 0.0457763671875, 0.0552978515625, 0.08123779296875, 0...

embed

61599227_c1

61599227

haskell

1

(inNestedState md)) Meanwhile I end up with limited but handy home made solution: class MonadRebase m n where rebase :: (m a) -> (n a) instance (MonadRebase m n) => MonadRebase (ReaderT r m) (ReaderT r n) where rebase t = ReaderT $ \r -> rebase (runReaderT t r) instance (MonadRebase m n) => MonadRebase (StateT s m) (S...

[ -0.020263671875, 0.0028839111328125, -0.00299072265625, 0.0000324249267578125, 0.025634765625, 0.00579833984375, -0.005462646484375, -0.0027313232421875, -0.0028533935546875, -0.0291748046875, 0.00823974609375, 0.00811767578125, 0.0086669921875, 0.0216064453125, 0.00537109375, -0.00265...

[ 73, 6433, 14437, 135206, 13, 347, 71, 16, 204610, 3564, 84046, 1284, 3535, 53, 5368, 7228, 29806, 18507, 60331, 4332, 37382, 653, 456, 39, 10, 19, 110527, 46674, 712, 31345, 808, 122636, 618, 3650, 16428, 22836, 10111, 17780, 34627, 2053,...

[ 0.1385498046875, 0.212158203125, 0.162109375, 0.1866455078125, 0.035491943359375, 0.0863037109375, 0.139892578125, 0.01171875, 0.00927734375, 0.007659912109375, 0.1361083984375, 0.0150299072265625, 0.07281494140625, 0.0040283203125, 0.05035400390625, 0.102294921875, 0.1309814453125, ...

embed

14118917_c0

14118917

haskell

0

Title: In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe Problem title: In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe Tags: windows, interrupt-handling, haskell Problem: In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe I tried to run the following ...

In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe In Haskell, waitForProcess is blocking Ctrl-C under Windows' cmd.exe windows interrupt-handling haskell System.Process Haskell Ctrl-C Windows cmd.exe Language OverloadedStrings CreateProcess RawCommand Nothing std_in CreatePipe std_out std_e...

[ 0.019287109375, 0.004302978515625, 0.00109100341796875, 0.01165771484375, -0.0206298828125, -0.0234375, -0.0042724609375, -0.02392578125, -0.000946044921875, -0.044677734375, -0.0152587890625, 0.01190185546875, -0.0140380859375, 0.0220947265625, 0.01318359375, 0.026123046875, 0.02392...

[ 20625, 142508, 40485, 18537, 10752, 26531, 46389, 214, 68847, 9, 441, 1379, 3773, 3768, 1827, 71, 46480, 54825, 206735, 54885, 1556, 12353, 83658, 9578, 63033, 71713, 151313, 109997, 10770, 12018, 182747, 6138, 73, 683, 48672, 6056, 20903, 64...

[ 0.131591796875, 0.25634765625, 0.2357177734375, 0.21484375, 0.1488037109375, 0.1842041015625, 0.19677734375, 0.023773193359375, 0.2181396484375, 0.039276123046875, 0.1451416015625, 0.1082763671875, 0.1690673828125, 0.057586669921875, 0.1461181640625, 0.076904296875, 0.1290283203125, ...

embed

53056242_c0

53056242

haskell

0

Title: haskell beginner strings Problem title: haskell beginner strings Tags: haskell Problem: haskell beginner strings I want to write a simple string function: input: aaabbbAAAcccc output: a3b3A3c4 All I have now it this code: compress :: String -> String compress x = if length x > 1 then do take 1 x ++ show ( length...

haskell beginner strings haskell beginner strings haskell a3b3A3c4 Main a9a8a7a6a5a4a3a2a1b7b6b5b4b3b2b x:xs haskell beginner strings I want to write a simple string function: All I have now it this code: This will obviously not work. Here is the output: I am taking 1 out of the x string applying filter to take out how...

[ -0.01470947265625, 0.020263671875, 0.00537109375, 0.0263671875, 0.01068115234375, 0.01239013671875, 0.03564453125, 0.0026702880859375, 0.0260009765625, -0.00933837890625, -0.007110595703125, -0.00726318359375, 0.0224609375, 0.035400390625, -0.0125732421875, -0.005889892578125, 0.0087...

[ 1556, 142508, 9842, 1679, 79315, 12321, 1126, 1022, 12, 425, 7, 3444, 33022, 8781, 32354, 3164, 5036, 903, 18151, 3293, 1221, 171259, 959, 4488, 140992, 35971, 106, 1810, 59911, 46312, 5646, 5941, 31251, 765, 11907, 21656, 2263, 159029, 195...

[ 0.12255859375, 0.1864013671875, 0.07916259765625, 0.07257080078125, 0.1920166015625, 0.0338134765625, 0.02374267578125, 0.1395263671875, 0.012298583984375, 0.09619140625, 0.04217529296875, 0.0447998046875, 0.11474609375, 0.1240234375, 0.171630859375, 0.00347900390625, 0.0169982910156...

embed

41514559_c0

41514559

haskell

0

Title: Can't load Graphics.Gloss in Haskell Problem title: Can't load Graphics.Gloss in Haskell Tags: haskell Problem: Can't load Graphics.Gloss in Haskell I wanted to play around with Pong.hs . I downloaded the .hs file, but when I opened it in Sublime Text (with the Haskell plugin) I was told that Graphics....

Can't load Graphics.Gloss in Haskell Can't load Graphics.Gloss in Haskell haskell Can Graphics.Gloss Haskell Graphics.Gloss.Interface.Pure.Game Gloss Pong.hs:22:1 Failed Use Pong.hs:23:1 Can't load Graphics.Gloss in Haskell I wanted to play around with Pong.hs . I downloaded the .hs file, but when I opened it...

[ -0.0172119140625, 0.0003662109375, 0.014892578125, 0.013916015625, -0.015869140625, 0.0181884765625, 0.000171661376953125, 0.00040435791015625, -0.002532958984375, 0.0120849609375, 0.01153564453125, -0.037353515625, 0.0068359375, -0.006317138671875, -0.0006256103515625, 0.0128173828125...

[ 4171, 3768, 18, 72367, 189682, 7, 5, 724, 2400, 23, 20625, 142508, 1556, 44851, 40404, 3408, 107576, 46173, 663, 449, 127, 24070, 19721, 190355, 36836, 24864, 11301, 10932, 7026, 11435, 142096, 8273, 150, 24129, 69993, 136, 683, 132283, 741...

[ 0.06170654296875, 0.045806884765625, 0.048248291015625, 0.1929931640625, 0.237060546875, 0.1627197265625, 0.03753662109375, 0.0751953125, 0.2138671875, 0.0850830078125, 0.1419677734375, 0.257568359375, 0.1168212890625, 0.0146026611328125, 0.0704345703125, 0.10394287109375, 0.06359863...

embed

46885123_c0

46885123

haskell

0

Title: How to use user defined data as param in haskell? Problem title: How to use user defined data as param in haskell? Tags: haskell Problem: How to use user defined data as param in haskell? I am new to haskell I have this program: loop height weight=do line<-getLine if line=="1" then do height<-getLine loop height...

How to use user defined data as param in haskell? How to use user defined data as param in haskell? haskell How height::String weight::String loop::A z.height z.weight How to use user defined data as param in haskell? I am new to haskell I have this program: It works fine,now I change it as this: this program is wrong ...

[ -0.007232666015625, -0.000705718994140625, -0.0181884765625, 0.02734375, -0.003814697265625, 0.00738525390625, -0.0032806396484375, 0.00872802734375, 0.02001953125, -0.0225830078125, 0.019775390625, -0.0322265625, 0.0172119140625, 0.0035247802734375, 0.01220703125, -0.01611328125, 0....

[ 11249, 47, 4527, 38937, 61924, 71, 2053, 237, 121, 39, 23, 1556, 142508, 155955, 71713, 214, 57888, 40956, 284, 97, 1106, 22553, 165598, 3525, 1528, 43240, 5885, 15549, 903, 83, 44691, 32354, 110, 95486, 2633, 5, 1369, 3714, 3642, 33022, ...

[ 0.089111328125, 0.017608642578125, 0.1558837890625, 0.172607421875, 0.2176513671875, 0.0823974609375, 0.177978515625, 0.10064697265625, 0.151611328125, 0.15576171875, 0.039306640625, 0.154541015625, 0.2352294921875, 0.22607421875, 0.1436767578125, 0.0250396728515625, 0.2332763671875,...

embed

8995622_c2

8995622

haskell

2

C /ImageI ] /Properties << /MC0 << /Metadata 502 0 R >> >> /XObject << /Fm0 451 0 R /Fm1 504 0 R /Fm2 513 0 R /Fm3 515 0 R /Fm4 517 0 R /Fm5 526 0 R /Fm6 528 0 R /Fm7 537 0 R /Fm8 539 0 R /Im0 540 0 R /Im1 541 0 R /Im2 452 0 R /Im3 542 0 R /Im4 543 0 R >> >> /Rotate 0 /StructParents 1 /TrimBox [ 0.000000 0.000000 612.0...

[ -0.0030670166015625, 0.004791259765625, 0.0062255859375, -0.0157470703125, -0.01531982421875, 0.03369140625, 0.015380859375, -0.0125732421875, 0.006683349609375, -0.0034027099609375, 0.01422119140625, 0.000873565673828125, 0.00567626953125, -0.01953125, 0.03173828125, 0.010498046875, ...

[ 313, 248, 216960, 568, 10752, 1264, 2449, 56473, 32557, 2389, 6696, 8656, 102, 836, 304, 757, 627, 61887, 275, 75161, 919, 39, 154602, 418, 617, 190, 2681, 363, 1837, 2489, 4046, 910, 3882, 966, 6, 179973, 1019, 188758, 61637, 117975, 8...

[ 0.1221923828125, 0.1109619140625, 0.2003173828125, 0.1904296875, 0.06982421875, 0.1627197265625, 0.09661865234375, 0.00567626953125, 0.04827880859375, 0.113037109375, 0.0972900390625, 0.0877685546875, 0.1204833984375, 0.1072998046875, 0.093017578125, 0.095947265625, 0.073486328125, ...

embed

59255056_c0

59255056

haskell

0

Title: function takes a list of 2-Tuples and a number Problem title: function takes a list of 2-Tuples and a number Tags: haskell Problem: function takes a list of 2-Tuples and a number So.. I am trying to build a program that takes a list of 2-tuples and a number and check if the number equal one of the elements of th...

function takes a list of 2-Tuples and a number function takes a list of 2-Tuples and a number haskell Tuples function takes a list of 2-Tuples and a number So.. I am trying to build a program that takes a list of 2-tuples and a number and check if the number equal one of the elements of the tuple, if it equal the first...

[ 0.00946044921875, 0.01318359375, -0.01220703125, 0.01116943359375, -0.006378173828125, 0.007232666015625, -0.0260009765625, 0.0022125244140625, 0.0150146484375, -0.0126953125, -0.0078125, -0.009521484375, -0.007659912109375, 0.02099609375, -0.0224609375, 0.0128173828125, 0.0148315429...

[ 32354, 51776, 5303, 111, 4720, 15665, 99726, 136, 10, 14012, 1556, 142508, 1371, 1061, 31577, 45367, 1528, 458, 12765, 2174, 105950, 1632, 80854, 370, 8705, 5117, 12830, 30646, 4568, 27781, 104116, 29557, 23817, 21320, 105801, 10461, 201, 758...

[ 0.1995849609375, 0.1658935546875, 0.153076171875, 0.030853271484375, 0.151611328125, 0.143310546875, 0.28076171875, 0.132080078125, 0.04730224609375, 0.17529296875, 0.1414794921875, 0.220458984375, 0.1658935546875, 0.0234375, 0.0675048828125, 0.08160400390625, 0.116455078125, 0.121...

embed

10724946_c0

10724946

haskell

0

Title: Does `par` create another thread? Problem title: Does `par` create another thread? Tags: multicore, multithreading, parallel-processing, haskell Problem: Does `par` create another thread? My understanding to par is that it will create a thread in another core to execution. But I failed proof this understanding w...

Does `par` create another thread? Does `par` create another thread? multicore multithreading parallel-processing haskell Control.Monad Control.Parallel Control.Concurrent System.IO.Unsafe Does n-1 a:xs test-par.hs RTS ThreadId Does `par` create another thread? My understanding to par is that it will create a thread in ...

[ 0.002471923828125, 0.004180908203125, -0.00811767578125, 0.0133056640625, 0.009765625, -0.0081787109375, 0.0126953125, -0.010009765625, 0.0012054443359375, -0.037353515625, 0.004119873046875, 0.011962890625, 0.000629425048828125, 0.006744384765625, 0.0068359375, -0.01287841796875, 0....

[ 101790, 2500, 28282, 15700, 86997, 6024, 30854, 3869, 65847, 95103, 63923, 1556, 142508, 27131, 1229, 163812, 17780, 115840, 653, 5759, 10, 425, 7, 3034, 127, 27389, 294, 136719, 568, 71, 100094, 366, 1221, 56458, 71924, 165523, 98869, 18151,...

[ 0.06884765625, 0.2320556640625, 0.17236328125, 0.136474609375, 0.2454833984375, 0.06707763671875, 0.1219482421875, 0.054962158203125, 0.1019287109375, 0.11376953125, 0.040802001953125, 0.07037353515625, 0.16845703125, 0.1170654296875, 0.0183868408203125, 0.099853515625, 0.0693359375,...

embed

34610054_c0

34610054

haskell

0

Title: Haskell how to construct object having dependent types Problem title: Haskell how to construct object having dependent types Tags: dependent-type, haskell Problem: Haskell how to construct object having dependent types I have used type family in the data 'D' to constraint the type of first item in it. Now I need...

Haskell how to construct object having dependent types Haskell how to construct object having dependent types dependent-type haskell Haskell Char Bool ResT intermediate_func Haskell how to construct object having dependent types I have used type family in the data 'D' to constraint the type of first item in it. Now I n...

[ 0.00933837890625, -0.020263671875, -0.0103759765625, 0.005157470703125, 0.01422119140625, -0.00469970703125, -0.02587890625, 0.0038604736328125, -0.0016326904296875, -0.017578125, 0.0005035400390625, -0.038818359375, 0.0281982421875, -0.003662109375, -0.00469970703125, -0.021728515625,...

[ 20625, 142508, 64549, 36746, 19441, 108750, 52895, 50986, 1556, 21656, 2460, 929, 9624, 618, 81814, 2182, 16498, 3642, 11814, 10644, 14449, 2053, 397, 158, 2816, 4288, 5117, 35735, 3871, 28282, 111, 335, 418, 304, 1295, 39210, 32354, 35064, ...

[ 0.1263427734375, 0.1929931640625, 0.19482421875, 0.1932373046875, 0.10614013671875, 0.215576171875, 0.2242431640625, 0.155029296875, 0.1292724609375, 0.106201171875, 0.0701904296875, 0.153564453125, 0.0997314453125, 0.1185302734375, 0.15185546875, 0.045501708984375, 0.092041015625, ...

embed

2302493_c0

2302493

haskell

0

Title: Stack overflow in OCaml and F# but not in Haskell Problem title: Stack overflow in OCaml and F# but not in Haskell Tags: lazy-evaluation, haskell, f%23, ocaml, stack-overflow Problem: Stack overflow in OCaml and F# but not in Haskell I've been comparing for fun different languages for speed in execution of the f...

Stack overflow in OCaml and F# but not in Haskell Stack overflow in OCaml and F# but not in Haskell lazy-evaluation haskell f%23 ocaml stack-overflow Stack OCaml Haskell n-1 List.fold_left float_of_int print_float Stack overflow in OCaml and F# but not in Haskell I've been comparing for fun different languages for spee...

[ -0.0014801025390625, 0.0093994140625, 0.0052490234375, -0.004547119140625, 0.01116943359375, -0.0181884765625, -0.0267333984375, -0.004058837890625, 0.00029754638671875, -0.0224609375, -0.0024261474609375, -0.0076904296875, 0.0042724609375, -0.0184326171875, 0.00482177734375, -0.004364...

[ 6512, 2594, 645, 118664, 180, 105272, 141, 136, 563, 4904, 1284, 959, 23, 20625, 142508, 21, 3285, 159258, 1556, 1238, 3742, 36, 9779, 177261, 5465, 5759, 32036, 42822, 133, 2480, 21917, 257, 4390, 4288, 28412, 52347, 37397, 7477, 12921, ...

[ 0.1552734375, 0.1334228515625, 0.1522216796875, 0.26123046875, 0.112060546875, 0.17333984375, 0.14501953125, 0.068359375, 0.103515625, 0.159423828125, 0.0218505859375, 0.1097412109375, 0.07000732421875, 0.11767578125, 0.1986083984375, 0.05401611328125, 0.1248779296875, 0.1550292968...

embed

45665335_c0

45665335

haskell

0

Title: Struggling with basic experiment printing to stdio Problem title: Struggling with basic experiment printing to stdio Tags: haskell Problem: Struggling with basic experiment printing to stdio Brand new to Haskell and failing to print the date in a simple program. What I'm trying to do: Get the current time from g...

Struggling with basic experiment printing to stdio Struggling with basic experiment printing to stdio haskell System.IO Data.Time.Clock Data.Time.Calendar Struggling Main Integer Date Struggling with basic experiment printing to stdio Brand new to Haskell and failing to print the date in a simple program. What I'm tryi...

[ -0.014892578125, -0.00775146484375, -0.001373291015625, 0.0216064453125, 0.0042724609375, 0.0189208984375, -0.007568359375, 0.0186767578125, -0.00046539306640625, -0.0107421875, -0.0159912109375, -0.0283203125, -0.013427734375, 0.017578125, -0.01031494140625, -0.000446319580078125, 0...

[ 63667, 9815, 2069, 678, 62822, 28007, 2448, 47, 6138, 5670, 1556, 142508, 12353, 17780, 11809, 70059, 21135, 33, 1506, 12321, 44401, 25512, 3525, 20625, 35782, 28412, 5622, 8781, 1528, 31577, 20779, 43581, 1733, 1295, 2046, 474, 15724, 26265,...

[ 0.1082763671875, 0.1038818359375, 0.0245513916015625, 0.0154571533203125, 0.1090087890625, 0.2186279296875, 0.15234375, 0.1123046875, 0.1541748046875, 0.219482421875, 0.1136474609375, 0.2210693359375, 0.07012939453125, 0.1832275390625, 0.09210205078125, 0.22509765625, 0.07421875, 0...

embed

69349244_c0

69349244

haskell

0

Title: How to split a list into two using even and odd positions? Problem title: How to split a list into two using even and odd positions? Tags: haskell Problem: How to split a list into two using even and odd positions? I am trying to split a list into even and odd based on their index/position in the list. For examp...

How to split a list into two using even and odd positions? How to split a list into two using even and odd positions? haskell even How x1:x2:xs Couldn How to split a list into two using even and odd positions? I am trying to split a list into even and odd based on their index/position in the list. For example for the l...

[ -0.0272216796875, 0.027099609375, -0.005462646484375, -0.00823974609375, -0.0186767578125, 0.031494140625, -0.005828857421875, 0.0142822265625, 0.00799560546875, -0.005218505859375, 0.03955078125, -0.001953125, 0.006591796875, 0.0008087158203125, 0.00665283203125, 0.01470947265625, 0...

[ 11249, 47, 65450, 10, 5303, 3934, 6626, 17368, 3853, 136, 70270, 19069, 1556, 142508, 1022, 82825, 425, 304, 12, 191147, 31577, 35509, 63262, 64, 40322, 27781, 155761, 910, 16750, 5608, 186, 2203, 189126, 50740, 3444, 4527, 51515, 18, 46683...

[ 0.11474609375, 0.058837890625, 0.2462158203125, 0.0594482421875, 0.2587890625, 0.17626953125, 0.213134765625, 0.09893798828125, 0.2098388671875, 0.142333984375, 0.2354736328125, 0.1898193359375, 0.1468505859375, 0.217529296875, 0.0518798828125, 0.0704345703125, 0.08245849609375, 0....

embed

10699532_c0

10699532

haskell

0

Title: Why is GHC complaining about non-exhaustive patterns? Problem title: Why is GHC complaining about non-exhaustive patterns? Tags: ghc, non-exhaustive-patterns, haskell Problem: Why is GHC complaining about non-exhaustive patterns? When I compile the following code with GHC (using the -Wall flag): module Main wher...

Why is GHC complaining about non-exhaustive patterns? Why is GHC complaining about non-exhaustive patterns? ghc non-exhaustive-patterns haskell Why GHC Wall Main Tree EmptyTree Node Show Ord test.hs Warning Pattern Patterns Why is GHC complaining about non-exhaustive patterns? When I compile the following code with GHC...

[ -0.0264892578125, -0.0067138671875, 0.018798828125, 0.0004405975341796875, -0.00019168853759765625, 0.0228271484375, -0.038818359375, -0.037841796875, -0.001708984375, -0.0093994140625, 0.01104736328125, -0.024658203125, 0.0052490234375, -0.01373291015625, 0.0167236328125, 0.0162353515...

[ 44084, 527, 73265, 186992, 351, 3355, 18391, 4935, 103510, 31380, 238, 4453, 22766, 1556, 142508, 23706, 12321, 101344, 31678, 939, 62731, 438, 112, 17367, 35379, 3034, 127, 5550, 592, 9876, 1672, 9969, 18151, 198076, 49938, 14858, 214, 18354...

[ 0.1136474609375, 0.08978271484375, 0.1962890625, 0.139404296875, 0.1707763671875, 0.05035400390625, 0.139404296875, 0.0908203125, 0.207275390625, 0.0970458984375, 0.08642578125, 0.1202392578125, 0.09912109375, 0.0772705078125, 0.1446533203125, 0.06951904296875, 0.0343017578125, 0.1...

embed

11942542_c0

11942542

haskell

0

Title: `interact` using Text instead of String Problem title: `interact` using Text instead of String Tags: haskell, lazy-io, text Problem: `interact` using Text instead of String I'd like to rewrite the interact function, but using Text instead of String . Is it possible to use Data.Text and/or Data.Text.Lazy to accom...

`interact` using Text instead of String `interact` using Text instead of String haskell lazy-io text Text Data.Text.Lazy qualified Data.Text LANGUAGE OverloadedStrings T.unlines T.lines `interact` using Text instead of String I'd like to rewrite the interact function, but using Text instead of String . Is it possible t...

[ -0.001861572265625, -0.0123291015625, 0.01348876953125, 0.0155029296875, -0.002960205078125, 0.0137939453125, 0.021484375, 0.0079345703125, -0.01165771484375, -0.0272216796875, -0.004058837890625, 0.002777099609375, -0.007293701171875, 0.007598876953125, 0.013916015625, 0.0208740234375...

[ 10433, 47013, 17368, 24129, 64457, 111, 23351, 214, 1556, 142508, 21, 3285, 846, 7986, 11809, 174379, 2729, 217225, 98064, 9578, 63033, 71713, 384, 309, 59801, 1884, 456, 434, 18781, 78974, 32354, 7722, 4527, 163846, 5701, 123166, 11675, 1528...

[ 0.2022705078125, 0.246826171875, 0.1287841796875, 0.274658203125, 0.168701171875, 0.0224761962890625, 0.1878662109375, 0.0970458984375, 0.10107421875, 0.194580078125, 0.076416015625, 0.1656494140625, 0.121337890625, 0.178955078125, 0.1239013671875, 0.260986328125, 0.1138916015625, ...

embed

75071892_c0

75071892

haskell

0

Title: Check Balance Delimiters Function Haskell Problem title: Check Balance Delimiters Function Haskell Tags: list, haskell, tuples, stack Problem: Check Balance Delimiters Function Haskell I want to write a function where you enter a list of delimiters tuples, and a string, And the function should check if the strin...

Check Balance Delimiters Function Haskell Check Balance Delimiters Function Haskell list haskell tuples stack Check Balance Delimiters Haskell Char Bool c:string elem1 Nothing Just _:string Check Balance Delimiters Function Haskell I want to write a function where you enter a list of delimiters tuples, and a string, An...

[ 0.0123291015625, 0.0159912109375, -0.0181884765625, -0.00177764892578125, 0.004486083984375, 0.02880859375, 0.0106201171875, 0.01092529296875, 0.00079345703125, 0.01531982421875, 0.015625, -0.0014190673828125, 0.00750732421875, -0.01104736328125, -0.007415771484375, 0.0011749267578125,...

[ 38679, 131176, 262, 93343, 1314, 28670, 20625, 142508, 5303, 1556, 370, 99726, 177261, 21656, 2460, 929, 91693, 88, 195, 418, 182747, 9563, 101, 3444, 33022, 32354, 30957, 8, 136, 79315, 5608, 12765, 2174, 40197, 59499, 642, 107730, 30646, ...

[ 0.2017822265625, 0.2822265625, 0.0888671875, 0.2425537109375, 0.1085205078125, 0.1168212890625, 0.126708984375, 0.2091064453125, 0.1119384765625, 0.1055908203125, 0.1044921875, 0.189208984375, 0.1343994140625, 0.10723876953125, 0.03753662109375, 0.0987548828125, 0.156494140625, 0.0...

embed

41748468_c0

41748468

haskell

0

Title: Haskell Stack Local Server Problem title: Haskell Stack Local Server Tags: stackage, haskell, haskell-stack Problem: Haskell Stack Local Server I am behind a firewall with strict rules about downloading software from the internet, so I would like to know if it is possible to download an entire stackage LTS snaps...

Haskell Stack Local Server Haskell Stack Local Server stackage haskell haskell-stack Haskell Stack Local Server Haskell Stack Local Server I am behind a firewall with strict rules about downloading software from the internet, so I would like to know if it is possible to download an entire stackage LTS snapshot in one g...

[ -0.001251220703125, 0.01385498046875, -0.00225830078125, 0.002044677734375, -0.01409912109375, -0.005218505859375, -0.01141357421875, 0.005645751953125, -0.00592041015625, -0.0301513671875, -0.0208740234375, -0.000370025634765625, 0.0234375, 0.0223388671875, 0.0223388671875, 0.01525878...

[ 20625, 142508, 6512, 2594, 24172, 22687, 177261, 4588, 1556, 590, 50155, 221521, 81113, 91736, 7026, 10975, 1295, 1820, 1884, 3714, 2174, 7722, 47, 64194, 339, 12763, 76685, 72697, 1632, 738, 21265, 4000, 10723, 6275, 55516, 7, 10957, 15005, ...

[ 0.1490478515625, 0.265380859375, 0.1954345703125, 0.1722412109375, 0.17724609375, 0.172119140625, 0.24560546875, 0.2225341796875, 0.1435546875, 0.159423828125, 0.122802734375, 0.196044921875, 0.06500244140625, 0.1082763671875, 0.2052001953125, 0.1400146484375, 0.030914306640625, 0....

embed

75458507_c1

75458507

haskell

1

I provide later in this post, why does evalSt e1 terminate, while evalSt e2 doesn't? I can't still understand what's the difference. Language's AST I tried to simplify my AST as much as possible, and this is the most minimal definition I could come up with: data Expr = Int Int | Negate Expr | Id String | Obj (M.Map St...

[ 0.000553131103515625, -0.02001953125, -0.002349853515625, -0.003936767578125, 0.00787353515625, 0.006256103515625, 0.0057373046875, 0.004364013671875, 0.00194549560546875, -0.0020599365234375, -0.01055908203125, 0.0240478515625, 0.01544189453125, -0.005126953125, 0.01361083984375, 0.00...

[ 22691, 15400, 14602, 28, 1405, 37455, 418, 121011, 13, 12960, 304, 22027, 18, 831, 7464, 28219, 60212, 83658, 48963, 112892, 18929, 2684, 20187, 80934, 2053, 60075, 42, 2203, 360, 127149, 67, 24799, 23351, 214, 3545, 170, 594, 166179, 6496,...

[ 0.050506591796875, 0.116455078125, 0.0260009765625, 0.169677734375, 0.237548828125, 0.2158203125, 0.15283203125, 0.2281494140625, 0.1297607421875, 0.049560546875, 0.178955078125, 0.031005859375, 0.07769775390625, 0.003265380859375, 0.017974853515625, 0.1005859375, 0.140625, 0.17761...

embed

64597733_c0

64597733

haskell

0

Title: Haskell: Sum of last 2 integers in a string Problem title: Haskell: Sum of last 2 integers in a string Tags: string, integer, sum, recursion, haskell Problem: Haskell: Sum of last 2 integers in a string I am new to Haskell and I'm attempting a task in which the result should be the sum of the last two integers i...

Haskell: Sum of last 2 integers in a string Haskell: Sum of last 2 integers in a string string integer sum recursion haskell Haskell Sum Num xs:x Haskell: Sum of last 2 integers in a string I am new to Haskell and I'm attempting a task in which the result should be the sum of the last two integers in a string. I comple...

[ -0.011474609375, 0.0177001953125, 0.0045166015625, 0.0208740234375, -0.0301513671875, 0.040771484375, 0.000020503997802734375, -0.00180816650390625, 0.02880859375, -0.01239013671875, 0.01141357421875, -0.037109375, 0.004547119140625, -0.003753662109375, -0.0036468505859375, 0.005401611...

[ 20625, 142508, 12, 36335, 111, 4568, 116, 892, 26255, 23, 79315, 10, 1505, 10554, 195625, 1830, 1556, 52782, 1022, 7, 425, 3525, 47, 81887, 66211, 16750, 5608, 6626, 64557, 28219, 128512, 66044, 2831, 45258, 5844, 237875, 5117, 36361, 48398...

[ 0.1510009765625, 0.27294921875, 0.046722412109375, 0.2432861328125, 0.119873046875, 0.219970703125, 0.2021484375, 0.1480712890625, 0.1463623046875, 0.0841064453125, 0.22998046875, 0.0305328369140625, 0.053955078125, 0.2159423828125, 0.2021484375, 0.055328369140625, 0.1282958984375, ...

embed

14013538_c1

14013538

haskell

1

fitstate related function it required a MonadIO m constraint on it. Here's the code: https://gist.github.com/4364920 So I decided to create some classes to make this fit together a little better and to clean up the types a little. My goal is to be able to write something like this: myMainRoutineFunc :: (MonadInput t m...

[ -0.0247802734375, 0.01251220703125, -0.011962890625, 0.00848388671875, 0.0079345703125, 0, 0.014404296875, -0.00543212890625, -0.01177978515625, -0.005157470703125, 0.0096435546875, -0.0135498046875, -0.00537109375, 0.00958251953125, -0.00714111328125, -0.0245361328125, 0.01428222656...

[ 11177, 61340, 62548, 32354, 56065, 60331, 71, 17780, 347, 158, 2816, 4288, 98, 18151, 32102, 28282, 61112, 25842, 11522, 46622, 52895, 69236, 19048, 33022, 1884, 903, 759, 168793, 12724, 34, 10325, 97249, 46674, 712, 4153, 7077, 808, 120962, ...

[ 0.2423095703125, 0.23388671875, 0.119384765625, 0.1763916015625, 0.105712890625, 0.1705322265625, 0.1181640625, 0.1815185546875, 0.121337890625, 0.076171875, 0.169189453125, 0.1307373046875, 0.0045166015625, 0.1044921875, 0.0460205078125, 0.0633544921875, 0.189453125, 0.06311035156...

embed