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
56419201_c1	56419201	haskell	1	"items" <> recentlyPlayed .: "next" instance FromJSON Tracks where parseJSON = withArray "items" $ \items -> Tracks <$> mapM parseJSON (V.toList items) instance FromJSON Artist where parseJSON = withObject "artists" $ \artists -> Artist <$> artists .: "id" <> artists .: "href" <*> artists .: "name" marshallRecentlyP...	"items" <> recentlyPlayed .: "next" instance FromJSON Tracks where parseJSON = withArray "items" $ \items -> Tracks <$> mapM parseJSON (V.toList items) instance FromJSON Artist where parseJSON = withObject "artists" $ \artists -> Artist <$> artists .: "id" <> artists .: "href" <*> artists .: "name" marshallRecentlyP...	[ -0.0262451171875, 0.01263427734375, -0.0115966796875, -0.005645751953125, 0.00179290771484375, 0.02099609375, -0.007232666015625, -0.0166015625, -0.01416015625, -0.0245361328125, 0.01324462890625, -0.0181884765625, -0.004302978515625, -0.006805419921875, -0.0166015625, 0.0172119140625,...	[ 1486, 4432, 1639, 78684, 97054, 297, 5, 12, 86, 29062, 110527, 28090, 1375, 58627, 69182, 366, 184, 678, 7614, 7092, 58, 3650, 6, 7, 4369, 2740, 22288, 594, 856, 188, 154663, 55769, 69891, 2203, 75161, 3960, 64370, 4426, 22104, 44, 532,...	[ 0.1708984375, 0.1416015625, 0.005096435546875, 0.2325439453125, 0.2335205078125, 0.1165771484375, 0.0164642333984375, 0.008056640625, 0.044097900390625, 0.12939453125, 0.181396484375, 0.1712646484375, 0.1241455078125, 0.199462890625, 0.220458984375, 0.1373291015625, 0.06268310546875,...	embed
5223498_c1	5223498	haskell	1	it should be Unboxed (immutable) [edit] never mind this Lazy Unbounded O(1) time to construct O(1) time complexity for looking up a given entry, (more realistically, at worst O(log n) , where n is i*j for looking up the entry at row i, column j) Bonus points if you can explain why/how your solution satisfies these ide...	it should be Unboxed (immutable) [edit] never mind this Lazy Unbounded O(1) time to construct O(1) time complexity for looking up a given entry, (more realistically, at worst O(log n) , where n is i*j for looking up the entry at row i, column j) Bonus points if you can explain why/how your solution satisfies these ide...	[ 0.0026092529296875, 0.025634765625, 0.00823974609375, -0.0016632080078125, -0.010009765625, 0.0026702880859375, 0.01385498046875, 0.01300048828125, 0.0169677734375, 0.01104736328125, 0.01416015625, -0.00022792816162109375, -0.00848388671875, 0.0218505859375, 0.00095367431640625, 0.0317...	[ 442, 5608, 186, 992, 11728, 297, 561, 22819, 45082, 7086, 239, 3285, 99091, 180, 27750, 1733, 64549, 27140, 16487, 1257, 34475, 42805, 61207, 130481, 4867, 170, 15555, 17, 3365, 316, 1647, 38663, 26847, 73342, 15400, 29806, 40407, 6397, 939...	[ 0.0565185546875, 0.12060546875, 0.048248291015625, 0.0941162109375, 0.23193359375, 0.0911865234375, 0.1287841796875, 0.1376953125, 0.0197601318359375, 0.05194091796875, 0.03411865234375, 0.1236572265625, 0.188232421875, 0.11376953125, 0.062744140625, 0.11474609375, 0.1307373046875, ...	embed
71036903_c0	71036903	haskell	0	Title: How to check if next element in a list is greater than the previous in Haskell? Problem title: How to check if next element in a list is greater than the previous in Haskell? Tags: haskell, list, functional-programming Problem: How to check if next element in a list is greater than the previous in Haskell? (I am...	How to check if next element in a list is greater than the previous in Haskell? How to check if next element in a list is greater than the previous in Haskell? haskell list functional-programming How Haskell How to check if next element in a list is greater than the previous in Haskell? (I am currently doing an online ...	[ -0.0024566650390625, 0.0235595703125, 0.005279541015625, 0.00799560546875, -0.007537841796875, 0.013671875, 0.010986328125, -0.005279541015625, 0.01483154296875, 0.0023651123046875, 0.007232666015625, 0.01287841796875, -0.006805419921875, -0.00433349609375, -0.01470947265625, 0.0073547...	[ 11249, 47, 12765, 2174, 11737, 12830, 23, 5303, 83, 117396, 3501, 96362, 20625, 142508, 1556, 123309, 28966, 1118, 15411, 81979, 172337, 63134, 137565, 10336, 222530, 46876, 40956, 206597, 33022, 32354, 29598, 91127, 46429, 1984, 18, 33079, 415...	[ 0.05096435546875, 0.04425048828125, 0.2275390625, 0.1121826171875, 0.2109375, 0.1956787109375, 0.0679931640625, 0.206298828125, 0.10516357421875, 0.2484130859375, 0.148193359375, 0.1396484375, 0.1263427734375, 0.2178955078125, 0.0791015625, 0.0775146484375, 0.002166748046875, 0.027...	embed
58276032_c0	58276032	haskell	0	Title: Trying to understand types in haskell library fused-effects Problem title: Trying to understand types in haskell library fused-effects Tags: compiler-errors, haskell Problem: Trying to understand types in haskell library fused-effects I am trying to understand hmap. module Main where import Control.Effect.Fresh ...	Trying to understand types in haskell library fused-effects Trying to understand types in haskell library fused-effects compiler-errors haskell Control.Effect.Fresh Control.Effect.Carrier Trying Main Fresh Maybe Just Couldn Main.hs:16:5-10 Expected Actual Functor Trying to understand types in haskell library fused-effe...	[ 0.00341796875, 0.005035400390625, 0.00830078125, 0.0166015625, -0.0140380859375, 0.01092529296875, 0.00396728515625, 0.006103515625, 0.00897216796875, -0.0111083984375, -0.00775146484375, -0.0361328125, 0.004180908203125, 0.000949859619140625, -0.01116943359375, -0.0208740234375, -0....	[ 40858, 28219, 52895, 1556, 142508, 35773, 57574, 297, 171760, 9969, 34759, 188800, 27131, 120482, 17928, 105027, 21851, 25388, 12321, 133540, 83425, 9563, 191147, 127, 22354, 758, 9193, 60075, 13, 100582, 28670, 18770, 31577, 1096, 62346, 31380, ...	[ 0.060302734375, 0.1102294921875, 0.2144775390625, 0.138427734375, 0.2017822265625, 0.1220703125, 0.177978515625, 0.1143798828125, 0.235595703125, 0.1002197265625, 0.09735107421875, 0.16455078125, 0.1402587890625, 0.0931396484375, 0.147216796875, 0.12841796875, 0.039337158203125, 0....	embed
37219566_c0	37219566	haskell	0	Title: Type-Level Peano Numbers and UndecidableInstances Problem title: Type-Level Peano Numbers and UndecidableInstances Tags: type-level-computation, haskell Problem: Type-Level Peano Numbers and UndecidableInstances Following this tutorial , I have the following code: {-# LANGUAGE DataKinds, TypeFamilies #-} data Na...	Type-Level Peano Numbers and UndecidableInstances Type-Level Peano Numbers and UndecidableInstances type-level-computation haskell Type-Level Peano Numbers UndecidableInstances LANGUAGE DataKinds TypeFamilies Nat Plus Mul Nested Use Type-Level Peano Numbers and UndecidableInstances Following this tutorial , I have the ...	[ -0.010498046875, 0.01336669921875, 0.004241943359375, 0.005096435546875, 0.001495361328125, 0.006927490234375, 0.0029754638671875, -0.009033203125, 0.001373291015625, -0.0174560546875, 0.00335693359375, -0.03125, 0.02587890625, 0.0255126953125, 0.00537109375, 0.004119873046875, 0.024...	[ 60457, 5267, 2601, 1460, 3922, 103332, 136, 79912, 24750, 2661, 116071, 10644, 67919, 7077, 1556, 142508, 98064, 11809, 605, 7250, 919, 1191, 68875, 8183, 21442, 28701, 36836, 57143, 25632, 18151, 1061, 2060, 221, 4127, 3714, 7, 1809, 82641, ...	[ 0.254150390625, 0.1207275390625, 0.176025390625, 0.1466064453125, 0.2166748046875, 0.1644287109375, 0.0267333984375, 0.10260009765625, 0.2457275390625, 0.252197265625, 0.14306640625, 0.2061767578125, 0.25537109375, 0.0526123046875, 0.07073974609375, 0.196533203125, 0.0709228515625, ...	embed
20190722_c0	20190722	haskell	0	Title: Using lenses to operate on inner monad in StateT Problem title: Using lenses to operate on inner monad in StateT Tags: haskell, haskell-lens Problem: Using lenses to operate on inner monad in StateT Pleease see the use of liftIO in the function increment below. I have a hunch that there's a better way to handle ...	Using lenses to operate on inner monad in StateT Using lenses to operate on inner monad in StateT haskell haskell-lens Control.Lens Control.Monad.IO.Class Control.Monad.State Using StateT LANGUAGE TemplateHaskell PersistentCounter _cValue _cFilename FilePath Show zoom2 Invoke Monad Using lenses to operate on inner mona...	[ -0.02587890625, 0.01007080078125, -0.0191650390625, 0.023193359375, 0.0137939453125, 0.014404296875, -0.000682830810546875, -0.0123291015625, -0.0274658203125, -0.0277099609375, 0.0115966796875, 0.032958984375, -0.0054931640625, 0.01446533203125, 0.0269775390625, -0.0023956298828125, ...	[ 345, 96, 47754, 160404, 98, 75414, 2667, 712, 22836, 618, 47, 1556, 142508, 1977, 27131, 866, 1755, 46674, 17780, 140803, 135206, 98064, 196631, 6495, 7, 57309, 2581, 108210, 856, 174350, 42724, 683, 10519, 17367, 111245, 304, 23253, 60331, ...	[ 0.0655517578125, 0.167236328125, 0.2117919921875, 0.17724609375, 0.08349609375, 0.2015380859375, 0.136962890625, 0.1724853515625, 0.1685791015625, 0.1865234375, 0.002471923828125, 0.1085205078125, 0.216064453125, 0.15283203125, 0.1378173828125, 0.0643310546875, 0.13427734375, 0.048...	embed
23846844_c0	23846844	haskell	0	Title: Determine the effect of a function by its type Problem title: Determine the effect of a function by its type Tags: type-theory, hindley-milner, haskell Problem: Determine the effect of a function by its type One of the interesting properties of Haskell's type system (*) is that sometimes you can tell exactly wha...	Determine the effect of a function by its type Determine the effect of a function by its type type-theory hindley-milner haskell Determine Num Determine the effect of a function by its type One of the interesting properties of Haskell's type system (*) is that sometimes you can tell exactly what the function does based...	[ 0.01226806640625, -0.00738525390625, -0.0057373046875, 0.0242919921875, 0.003692626953125, 0.01409912109375, -0.006805419921875, 0.0162353515625, -0.000518798828125, -0.0040283203125, -0.0213623046875, -0.023193359375, -0.02001953125, 0.000051021575927734375, 0.004058837890625, 0.00540...	[ 262, 30524, 21543, 32354, 390, 6863, 10644, 2347, 34866, 4293, 12397, 1679, 1556, 142508, 52782, 49041, 183871, 20625, 5426, 68018, 831, 14192, 66161, 2367, 14602, 35509, 4734, 138256, 115840, 17780, 43334, 49846, 678, 10, 33079, 8110, 182324, ...	[ 0.0863037109375, 0.1937255859375, 0.25439453125, 0.212158203125, 0.113037109375, 0.0789794921875, 0.2646484375, 0.043487548828125, 0.0684814453125, 0.1531982421875, 0.0748291015625, 0.1085205078125, 0.1103515625, 0.2529296875, 0.1845703125, 0.0982666015625, 0.087890625, 0.120117187...	embed
38050674_c1	38050674	haskell	1	_ps1 c iout = do --out <- liftIO iout let out_count = c 0 let prompt = (getPrompt out_count iout) :: IO String outputStrLn $ liftIO prompt outputStrLn "" getPrompt :: IO Int -> IO String -> IO String getPrompt ion iout = do n <- ion out <- iout return $ "Out[" ++ (show n) ++ "]: " ++ out handle_cmd :: String -> IO Stri...	_ps1 c iout = do --out <- liftIO iout let out_count = c 0 let prompt = (getPrompt out_count iout) :: IO String outputStrLn $ liftIO prompt outputStrLn "" getPrompt :: IO Int -> IO String -> IO String getPrompt ion iout = do n <- ion out <- iout return $ "Out[" ++ (show n) ++ "]: " ++ out handle_cmd :: String -> IO Stri...	[ -0.0157470703125, -0.0108642578125, -0.02001953125, 0.029052734375, 0.01007080078125, 0.01446533203125, 0.0252685546875, 0.00811767578125, 0.0147705078125, -0.045654296875, -0.0179443359375, -0.0034027099609375, 0.008056640625, 0.0052490234375, -0.01153564453125, 0.017822265625, -0.0...	[ 101, 6423, 418, 501, 17, 6056, 2203, 54, 4210, 9, 60520, 17780, 2633, 1810, 71013, 757, 105876, 3794, 10752, 2676, 1984, 23351, 214, 140992, 71713, 3650, 2046, 360, 18, 45339, 653, 30646, 79858, 37223, 31374, 34831, 3931, 71, 13315, 2174,...	[ 0.0751953125, 0.20458984375, 0.171630859375, 0.090087890625, 0.1357421875, 0.2685546875, 0.04931640625, 0.114013671875, 0.0738525390625, 0.00738525390625, 0.2449951171875, 0.2384033203125, 0.1898193359375, 0.2303466796875, 0.1968994140625, 0.091064453125, 0.245849609375, 0.09930419...	embed
20713027_c0	20713027	haskell	0	Title: Data.Text vs. Rope Problem title: Data.Text vs. Rope Tags: haskell Problem: Data.Text vs. Rope I've been looking into ropes as an alternative to Data.Text, and I like what I see so much that I am now forced to ask this question.... Is there any case where Data.Text would be the better choice? Here are the points...	Data.Text vs. Rope Data.Text vs. Rope haskell Data.Text Rope Data.Text vs. Rope I've been looking into ropes as an alternative to Data.Text, and I like what I see so much that I am now forced to ask this question.... Is there any case where Data.Text would be the better choice? Here are the points that lead me to this ...	[ 0.0191650390625, -0.0031280517578125, 0.0040283203125, 0.022216796875, -0.0096435546875, -0.003204345703125, 0.0111083984375, -0.00885009765625, 0.006744384765625, -0.003814697265625, 0.006103515625, -0.012939453125, 0.006744384765625, -0.00445556640625, -0.00058746337890625, 0.0033721...	[ 11809, 5, 174379, 20209, 2777, 1081, 1556, 142508, 16487, 87850, 90, 30700, 4, 1884, 87, 1957, 5045, 7225, 2806, 186, 70, 11522, 44126, 15390, 444, 98, 111, 11001, 95, 2407, 110, 112, 131803, 70796, 538, 83, 289, 840, 18, 16, 5701, 13...	[ 0.222412109375, 0.08758544921875, 0.324462890625, 0.1712646484375, 0.202392578125, 0.205322265625, 0.1336669921875, 0.239501953125, 0.00347900390625, 0.2213134765625, 0.18310546875, 0.13916015625, 0.00567626953125, 0.11181640625, 0.005584716796875, 0.035614013671875, 0.00808715820312...	embed
44317409_c0	44317409	haskell	0	Title: Throwing away element in index,element tuples Problem title: Throwing away element in index,element tuples Tags: list-comprehension, list, enumerate, haskell Problem: Throwing away element in index,element tuples New to Haskell, and trying to construct an [[(Int, Int)]] where each element is its corresponding gr...	Throwing away element in index,element tuples Throwing away element in index,element tuples list-comprehension list enumerate haskell Throwing board-1 Throwing away element in index,element tuples New to Haskell, and trying to construct an [[(Int, Int)]] where each element is its corresponding grid position, constructe...	[ -0.0260009765625, 0.012451171875, -0.01373291015625, -0.00823974609375, -0.02099609375, -0.004180908203125, 0.006622314453125, 0.01025390625, -0.007415771484375, -0.003814697265625, 0.01019287109375, -0.00689697265625, 0.0012359619140625, -0.00174713134765625, -0.023681640625, -0.01354...	[ 6003, 15555, 16065, 12830, 63262, 62766, 370, 99726, 23, 5303, 4692, 3220, 189085, 67, 1556, 142508, 45443, 5759, 20625, 31577, 64549, 4153, 18, 360, 12638, 42518, 120067, 19069, 11, 108047, 5609, 140909, 138, 2806, 28282, 22288, 62346, 32354...	[ 0.027740478515625, 0.1368408203125, 0.1851806640625, 0.182861328125, 0.1727294921875, 0.154052734375, 0.09698486328125, 0.179931640625, 0.0498046875, 0.0736083984375, 0.0157928466796875, 0.0197601318359375, 0.152099609375, 0.087158203125, 0.1015625, 0.229736328125, 0.1497802734375, ...	embed
59849397_c0	59849397	haskell	0	Title: Spawning a new shell process as a member of another ProcessGroup (Haskell) Problem title: Spawning a new shell process as a member of another ProcessGroup (Haskell) Tags: haskell Problem: Spawning a new shell process as a member of another ProcessGroup (Haskell) Problem. I am trying spawn a new shell process, an...	Spawning a new shell process as a member of another ProcessGroup (Haskell) Spawning a new shell process as a member of another ProcessGroup (Haskell) haskell System.Process Data.Int Spawning ProcessGroup Haskell ProcessGroupID FilePath Maybe ProcessID CPid Int32 Nothing Operation Spawning a new shell process as a membe...	[ 0.007110595703125, 0.0235595703125, -0.0322265625, 0.0162353515625, -0.00408935546875, -0.00007963180541992188, -0.00933837890625, -0.0120849609375, -0.00101470947265625, -0.01397705078125, 0.01483154296875, 0.0216064453125, -0.0106201171875, 0.0257568359375, -0.0230712890625, 0.021362...	[ 10959, 434, 592, 3525, 128019, 9433, 237, 32786, 15700, 123996, 205072, 6495, 7, 142508, 1556, 12353, 10752, 26531, 11809, 4153, 18, 20625, 7146, 42724, 10519, 83425, 532, 6460, 182747, 102203, 15649, 31577, 5623, 7710, 100, 144573, 21115, 21...	[ 0.192626953125, 0.1531982421875, 0.04766845703125, 0.13671875, 0.1953125, 0.199462890625, 0.057342529296875, 0.1361083984375, 0.117919921875, 0.11181640625, 0.192138671875, 0.0833740234375, 0.0628662109375, 0.242431640625, 0.09759521484375, 0.0810546875, 0.056243896484375, 0.127075...	embed
24979448_c0	24979448	haskell	0	Title: Memory exploding upon writing a lazy bytestring to file in ghci Problem title: Memory exploding upon writing a lazy bytestring to file in ghci Tags: memory-leaks, ghci, lazy-loading, lazy-evaluation, haskell Problem: Memory exploding upon writing a lazy bytestring to file in ghci The following program does not e...	Memory exploding upon writing a lazy bytestring to file in ghci Memory exploding upon writing a lazy bytestring to file in ghci memory-leaks ghci lazy-loading lazy-evaluation haskell Data.Int qualified Memory Explode.hs Does Explodes Main Data.ByteString.Lazy Data.ByteString.Lazy.Char8 BLC Int64 BL.ByteString BL.take B...	[ 0.0133056640625, 0.0048828125, -0.0167236328125, 0.0174560546875, -0.008056640625, 0.005859375, 0.003997802734375, -0.0023345947265625, 0.0201416015625, 0.003631591796875, 0.0020904541015625, 0.00130462646484375, 0.01458740234375, 0.0164794921875, 0.01422119140625, 0.028076171875, 0....	[ 172681, 24649, 6238, 54799, 32562, 21, 3285, 390, 67, 91693, 47, 11435, 31380, 318, 23, 98323, 133, 24251, 63033, 159258, 1556, 142508, 11809, 4153, 18, 217225, 98873, 112, 127, 7, 101790, 988, 12321, 75358, 71713, 2729, 84068, 1019, 26943,...	[ 0.216796875, 0.24560546875, 0.0897216796875, 0.07373046875, 0.175537109375, 0.1138916015625, 0.1650390625, 0.0703125, 0.088623046875, 0.1859130859375, 0.0228118896484375, 0.14697265625, 0.117919921875, 0.164306640625, 0.08697509765625, 0.150634765625, 0.115966796875, 0.010955810546...	embed
56641366_c0	56641366	haskell	0	Title: Why provide the `HasCallStack` mechanism since we already have `ghc -prof -fprof-auto-top` in GHC? Problem title: Why provide the `HasCallStack` mechanism since we already have `ghc -prof -fprof-auto-top` in GHC? Tags: callstack, haskell, ghc Problem: Why provide the `HasCallStack` mechanism since we already hav...	Why provide the `HasCallStack` mechanism since we already have `ghc -prof -fprof-auto-top` in GHC? Why provide the `HasCallStack` mechanism since we already have `ghc -prof -fprof-auto-top` in GHC? callstack haskell ghc GHC.Stack base the HasCallStack -prof Why GHC call-stack-cut-off.hs CallStack call-stack-cut-off.hs:...	[ 0.00885009765625, 0.0169677734375, 0.0040283203125, 0.00634765625, -0.000667572021484375, -0.00787353515625, -0.01239013671875, -0.018310546875, 0.00016880035400390625, -0.028076171875, 0.0042724609375, -0.0013580322265625, 0.00115966796875, 0.01220703125, 0.01806640625, -0.01843261718...	[ 44084, 22691, 6495, 7, 441, 5584, 42378, 2594, 191619, 21771, 9486, 238, 20, 3454, 420, 8913, 13784, 527, 73265, 765, 11782, 590, 1556, 142508, 31380, 3647, 20625, 19774, 16713, 127, 26265, 758, 29223, 5201, 168793, 1126, 15110, 19777, 6048...	[ 0.114013671875, 0.1104736328125, 0.145263671875, 0.0748291015625, 0.14404296875, 0.1708984375, 0.2322998046875, 0.179443359375, 0.1953125, 0.09765625, 0.077392578125, 0.0927734375, 0.00933837890625, 0.1072998046875, 0.12353515625, 0.11962890625, 0.1597900390625, 0.1114501953125, ...	embed
33774433_c0	33774433	haskell	0	Title: Sequential circuit with feedack loop in Haskell Problem title: Sequential circuit with feedack loop in Haskell Tags: loops, feedback, sequential, circuit, haskell Problem: Sequential circuit with feedack loop in Haskell I would like to represent a circuit with the following behaviour in Haskell: The circuit has ...	Sequential circuit with feedack loop in Haskell Sequential circuit with feedack loop in Haskell loops feedback sequential circuit haskell Sequential Haskell Signal Input Output State Switch Bool i:is True:bs False:bs Sequential circuit with feedack loop in Haskell I would like to represent a circuit with the following ...	[ 0.006378173828125, 0.0179443359375, -0.0130615234375, 0.01324462890625, 0.004364013671875, -0.0093994140625, 0.00604248046875, 0.005279541015625, 0.0034942626953125, -0.0284423828125, 0.01055908203125, -0.018310546875, -0.0213623046875, 0.03466796875, 0.0022125244140625, -0.00964355468...	[ 503, 5490, 80973, 61404, 678, 61590, 11, 2594, 40956, 20625, 142508, 58269, 243228, 1556, 144000, 360, 13538, 22836, 106101, 2460, 929, 164, 87599, 16145, 22225, 23, 1884, 33636, 25632, 224833, 6626, 107730, 2053, 101089, 1632, 140992, 14847, ...	[ 0.04278564453125, 0.1285400390625, 0.08538818359375, 0.2088623046875, 0.032470703125, 0.1568603515625, 0.1143798828125, 0.17333984375, 0.20703125, 0.145263671875, 0.2481689453125, 0.24365234375, 0.1868896484375, 0.118408203125, 0.150634765625, 0.06353759765625, 0.08984375, 0.139282...	embed
36979508_c0	36979508	haskell	0	Title: Haskell Function not loading Problem title: Haskell Function not loading Tags: haskell Problem: Haskell Function not loading I have started haskell two day ago using learn you a haskell, but struck in the second chapter. I saved a function as baby.hs (no .txt , I checked in info) and according to the book, the f...	Haskell Function not loading Haskell Function not loading haskell Haskell baby.hs Compiling Main baby.hs:1:7 Failed Mayanks-MBP:Documents rtf1 ansicpg1252 cocoartf1404 cocoasubrtf460 fcharset0 Helvetica red255 green255 blue255 paperw11900 paperh16840 margl1440 margr1440 vieww10800 viewh8400 viewkind0 tx566 tx1133 tx170...	[ 0.00872802734375, 0.01019287109375, 0.00144195556640625, -0.00799560546875, 0.00665283203125, 0.02587890625, -0.006866455078125, 0.0026092529296875, -0.0036163330078125, -0.0302734375, -0.015625, -0.01953125, -0.00112152099609375, -0.037109375, 0.02197265625, -0.004791259765625, -0.0...	[ 20625, 142508, 28670, 959, 72367, 214, 1556, 15546, 127, 15612, 12321, 7, 966, 190355, 4347, 66, 1224, 12689, 683, 239469, 420, 68992, 7709, 158332, 10440, 7636, 4842, 135455, 50997, 57571, 15122, 45076, 21455, 68347, 2831, 22553, 144810, 235...	[ 0.1553955078125, 0.26708984375, 0.1832275390625, 0.1651611328125, 0.2227783203125, 0.07080078125, 0.154296875, 0.2177734375, 0.1297607421875, 0.04083251953125, 0.0477294921875, 0.080078125, 0.01690673828125, 0.117431640625, 0.0916748046875, 0.00653076171875, 0.030609130859375, 0.00...	embed
50013110_c0	50013110	haskell	0	Title: how to avoid messy codes when outputting Chinese characters Problem title: how to avoid messy codes when outputting Chinese characters Tags: encode, haskell, string, windows Problem: how to avoid messy codes when outputting Chinese characters I've found a strange problem about writing Chinese characters into a f...	how to avoid messy codes when outputting Chinese characters how to avoid messy codes when outputting Chinese characters encode haskell string windows Chinese r.txt how to avoid messy codes when outputting Chinese characters I've found a strange problem about writing Chinese characters into a file by writeFile . Then th...	[ 0.024658203125, 0.000476837158203125, 0.005889892578125, -0.002044677734375, -0.006988525390625, -0.006439208984375, 0.006805419921875, 0.0022430419921875, -0.00107574462890625, 0.03369140625, -0.00518798828125, -0.017822265625, 0.0294189453125, 0.0126953125, -0.01141357421875, -0.0013...	[ 3642, 71864, 163, 46048, 18151, 140992, 76438, 124850, 22, 40899, 1556, 142508, 79315, 54825, 1690, 124326, 1916, 114453, 2967, 32562, 3934, 11435, 33022, 174350, 44116, 3638, 36917, 31255, 25842, 42, 11196, 3074, 15400, 44084, 155148, 8779, 94...	[ 0.0287017822265625, 0.1866455078125, 0.180419921875, 0.197998046875, 0.1907958984375, 0.1544189453125, 0.1859130859375, 0.1553955078125, 0.033477783203125, 0.0963134765625, 0.06982421875, 0.1617431640625, 0.07110595703125, 0.088623046875, 0.06866455078125, 0.15771484375, 0.0047607421...	embed
43155806_c0	43155806	haskell	0	Title: Mutable modifications of a Vector using ST Problem title: Mutable modifications of a Vector using ST Tags: haskell Problem: Mutable modifications of a Vector using ST I have been going through a School of Haskell tutorial on "modify and the ST monad". The question asks to come up with the code for modify which h...	Mutable modifications of a Vector using ST Mutable modifications of a Vector using ST haskell ST Control.Monad.ST Data.STRef qualified Mutable Vector Unbox MVector LANGUAGE RankNTypes Chp28v8 Data.Vector.Unboxed V.Unbox V.Vector V.unsafeThaw V.unsafeFreeze Mutable modifications of a Vector using ST I have been going th...	[ -0.025634765625, 0.020751953125, -0.004119873046875, -0.00396728515625, 0.01544189453125, -0.0225830078125, -0.0140380859375, -0.0189208984375, -0.0045166015625, -0.01470947265625, -0.01025390625, 0.01129150390625, 0.0028533935546875, -0.00112152099609375, -0.00921630859375, 0.01336669...	[ 2758, 22819, 129344, 2609, 18770, 17368, 16992, 1556, 142508, 27131, 46674, 712, 8545, 11809, 4240, 217225, 992, 11728, 66160, 13, 98064, 134405, 196707, 3882, 334, 1019, 26455, 14256, 310, 309, 115840, 78122, 434, 81437, 731, 19188, 111, 206...	[ 0.190185546875, 0.180908203125, 0.232666015625, 0.220703125, 0.2205810546875, 0.0701904296875, 0.2120361328125, 0.1246337890625, 0.233154296875, 0.1446533203125, 0.054534912109375, 0.104248046875, 0.2032470703125, 0.04913330078125, 0.1224365234375, 0.123291015625, 0.1163330078125, ...	embed
61992892_c0	61992892	haskell	0	Title: Haskell: what are the implications of combining parameters into tuples, rather than using distinct parameters? Problem title: Haskell: what are the implications of combining parameters into tuples, rather than using distinct parameters? Tags: interface, haskell, parameters, functional-programming, tuples Problem...	Haskell: what are the implications of combining parameters into tuples, rather than using distinct parameters? Haskell: what are the implications of combining parameters into tuples, rather than using distinct parameters? interface haskell parameters functional-programming tuples distinct Haskell Float Vector Haskell: ...	[ -0.005218505859375, 0.002288818359375, -0.0167236328125, 0.01171875, 0.0101318359375, -0.0103759765625, -0.00640869140625, -0.0169677734375, 0.0091552734375, -0.0205078125, 0.0004730224609375, -0.0184326171875, -0.00933837890625, 0.0087890625, -0.0274658203125, 0.0012054443359375, 0....	[ 20625, 142508, 17914, 5256, 375, 964, 171859, 3934, 370, 99726, 43257, 17368, 117781, 3501, 101758, 1556, 123309, 28966, 38699, 2609, 18770, 2367, 9842, 1679, 193844, 2965, 41361, 112199, 96679, 11522, 30699, 62548, 32354, 10750, 13695, 1141, 2...	[ 0.1334228515625, 0.246826171875, 0.186279296875, 0.0982666015625, 0.0985107421875, 0.1729736328125, 0.235107421875, 0.08642578125, 0.1494140625, 0.22900390625, 0.0298919677734375, 0.0987548828125, 0.1605224609375, 0.032135009765625, 0.11572265625, 0.1065673828125, 0.09033203125, 0....	embed
10934788_c0	10934788	haskell	0	Title: Haskell code with Gloss lib doesn't compile Problem title: Haskell code with Gloss lib doesn't compile Tags: gloss, haskell, compiler-errors Problem: Haskell code with Gloss lib doesn't compile I switched from C++ to Haskell and use Gloss to make games. I wrote this valid code in a main.hs: import Grap...	Haskell code with Gloss lib doesn't compile Haskell code with Gloss lib doesn't compile gloss haskell compiler-errors Graphics.Gloss.Interface.Pure.Game Graphics.Gloss Haskell Gloss EventKey Char Down RectangleWire InWindow GameEvent Circle main.hs Compiling Main main.o main.hs:3:43 Not Display Translate Scal...	[ -0.018798828125, 0.0011138916015625, 0.0174560546875, 0.01318359375, -0.00640869140625, 0.013916015625, 0.0020599365234375, -0.0223388671875, -0.01263427734375, -0.00004792213439941406, 0.003997802734375, -0.03466796875, 0.0235595703125, 0.0081787109375, -0.006195068359375, -0.00933837...	[ 20625, 142508, 18151, 678, 46173, 7, 25474, 22027, 3768, 18, 9969, 1340, 207244, 1556, 34759, 188800, 189682, 2400, 107576, 36943, 162429, 21656, 49472, 57124, 13547, 192134, 163731, 5201, 127, 15612, 12321, 31, 33210, 11205, 90045, 11062, 1930...	[ 0.120849609375, 0.2066650390625, 0.160888671875, 0.050689697265625, 0.1915283203125, 0.1497802734375, 0.1500244140625, 0.00006103515625, 0.010406494140625, 0.045318603515625, 0.140869140625, 0.1348876953125, 0.214599609375, 0.07806396484375, 0.0201873779296875, 0.0909423828125, 0.097...	embed
21939241_c0	21939241	haskell	0	Title: Parsec fails to parse if characters follow my string Problem title: Parsec fails to parse if characters follow my string Tags: parsec, haskell Problem: Parsec fails to parse if characters follow my string I am trying to write something to parse my Django template, however my parser fails if anything follows an {...	Parsec fails to parse if characters follow my string Parsec fails to parse if characters follow my string parsec haskell Control.Monad Text.ParserCombinators.Parsec Parsec Piece StaticPiece BlockPiece VarPiece Show many1 Blah some_var other_var inner_body Hello Right Left Parsec fails to parse if characters follow my s...	[ -0.010986328125, 0.011474609375, 0.01263427734375, 0.0159912109375, -0.0242919921875, 0.037353515625, 0.00130462646484375, -0.02490234375, 0.0111083984375, -0.0230712890625, -0.0177001953125, 0.0023956298828125, 0.023681640625, -0.021240234375, -0.0096435546875, 0.005340576171875, 0....	[ 2392, 39797, 35782, 366, 184, 2174, 124850, 28960, 759, 79315, 1556, 142508, 27131, 46674, 712, 24129, 28636, 2189, 19155, 10374, 71465, 111242, 80231, 3323, 17367, 5941, 418, 1566, 1961, 75414, 37873, 35378, 90911, 636, 2480, 31577, 33022, 3...	[ 0.1409912109375, 0.2354736328125, 0.18505859375, 0.14794921875, 0.0975341796875, 0.1187744140625, 0.2064208984375, 0.21435546875, 0.06884765625, 0.2288818359375, 0.0518798828125, 0.1829833984375, 0.1453857421875, 0.0266876220703125, 0.0701904296875, 0.10418701171875, 0.11474609375, ...	embed
70326020_c0	70326020	haskell	0	Title: Haskell: Return the item of a list which absolute difference to its predecessor is equal or smaller than a certain value Problem title: Haskell: Return the item of a list which absolute difference to its predecessor is equal or smaller than a certain value Tags: functional-programming, haskell Problem: Haskell: ...	Haskell: Return the item of a list which absolute difference to its predecessor is equal or smaller than a certain value Haskell: Return the item of a list which absolute difference to its predecessor is equal or smaller than a certain value functional-programming haskell Haskell Rational Haskell: Return the item of a ...	[ -0.0103759765625, -0.007293701171875, 0.01123046875, 0.0086669921875, 0.00116729736328125, 0.02685546875, 0.0028839111328125, 0.0026702880859375, 0.031005859375, 0.01312255859375, 0.0115966796875, 0.034912109375, -0.013916015625, 0.01458740234375, 0.00799560546875, 0.0224609375, 0.02...	[ 20625, 142508, 173340, 35735, 5303, 3129, 89931, 60212, 47, 1653, 26531, 105950, 164917, 3501, 24233, 34292, 12, 111, 748, 123309, 28966, 1556, 2552, 43315, 41591, 116, 34635, 79875, 41491, 100920, 615, 5843, 12424, 17721, 12830, 13, 24209, 1...	[ 0.1519775390625, 0.277099609375, 0.2135009765625, 0.1734619140625, 0.1954345703125, 0.03936767578125, 0.1767578125, 0.2705078125, 0.032806396484375, 0.0631103515625, 0.127685546875, 0.147216796875, 0.177001953125, 0.0562744140625, 0.0279998779296875, 0.20458984375, 0.02532958984375, ...	embed
39067546_c0	39067546	haskell	0	Title: Bind type variables in a GHCI session Problem title: Bind type variables in a GHCI session Tags: haskell, ghci Problem: Bind type variables in a GHCI session Let's take fmap . const as a simple example where I try to understand what it does: fmap :: Functor f => (a -> b) -> f a -> f b const :: a -> b -> a The fi...	Bind type variables in a GHCI session Bind type variables in a GHCI session haskell ghci Bind GHCI Functor Bind type variables in a GHCI session Let's take fmap . const as a simple example where I try to understand what it does: The fist thing I notice is that a , b are ambiguous when I try to understand fmap . const ....	[ -0.004364013671875, -0.00592041015625, -0.0201416015625, 0.0186767578125, 0.00372314453125, -0.00579833984375, -0.0162353515625, 0.01519775390625, 0.0037384033203125, -0.014892578125, -0.00726318359375, -0.040283203125, -0.005157470703125, 0.024658203125, -0.0103759765625, 0.0181884765...	[ 16666, 71, 10644, 77336, 41877, 17304, 56002, 1556, 142508, 31380, 318, 28670, 18770, 1238, 62346, 5, 158, 271, 27781, 28219, 14602, 60322, 10, 4, 876, 920, 12282, 4527, 6626, 707, 1286, 62548, 138256, 25842, 68557, 706, 2203, 34390, 122554...	[ 0.1822509765625, 0.0548095703125, 0.1903076171875, 0.2193603515625, 0.146484375, 0.192626953125, 0.18896484375, 0.0809326171875, 0.183837890625, 0.0909423828125, 0.1317138671875, 0.040008544921875, 0.017059326171875, 0.09130859375, 0.2164306640625, 0.01361083984375, 0.1412353515625, ...	embed
31298466_c0	31298466	haskell	0	Title: Populating a list of tuples in a semantic way Problem title: Populating a list of tuples in a semantic way Tags: haskell, list-comprehension Problem: Populating a list of tuples in a semantic way I'm working on a piece of code where I have to process lists of tuples where both the order and names of the "keys" (...	Populating a list of tuples in a semantic way Populating a list of tuples in a semantic way haskell list-comprehension Populating Just Nothing Maybe Populating a list of tuples in a semantic way I'm working on a piece of code where I have to process lists of tuples where both the order and names of the "keys" ( fst s o...	[ -0.0045166015625, 0.00439453125, 0.0147705078125, 0.005584716796875, -0.0027923583984375, 0.00872802734375, -0.016357421875, -0.0033416748046875, 0.009521484375, 0.0224609375, 0.0159912109375, -0.0016326904296875, 0.011962890625, 0.011474609375, -0.0087890625, -0.004425048828125, -0....	[ 157890, 1916, 5303, 370, 99726, 484, 109109, 3917, 1556, 142508, 4692, 3220, 9563, 182747, 83425, 20697, 18151, 9433, 12989, 19770, 91, 14858, 110934, 29479, 193857, 217784, 44622, 12663, 35604, 35509, 107730, 27781, 22799, 13817, 32554, 100231, ...	[ 0.18798828125, 0.0176239013671875, 0.19091796875, 0.120849609375, 0.218994140625, 0.1854248046875, 0.149658203125, 0.04510498046875, 0.0987548828125, 0.1845703125, 0.08929443359375, 0.1165771484375, 0.084228515625, 0.15771484375, 0.1695556640625, 0.03558349609375, 0.047271728515625, ...	embed
77128045_c1	77128045	haskell	1	:: FunPtr (Double -> Double) -> Double -> Double -> Double -> Int -> Ptr Double -> Ptr Int -> IO Double -- \| Numerical integration. integration :: (Double -> Double) -- ^ integrand -> Double -- ^ lower bound -> Double -- ^ upper bound -> Double -- ^ desired relative error -> Int -- ^ number of subdivisions -> IO Integ...	:: FunPtr (Double -> Double) -> Double -> Double -> Double -> Int -> Ptr Double -> Ptr Int -> IO Double -- \| Numerical integration. integration :: (Double -> Double) -- ^ integrand -> Double -- ^ lower bound -> Double -- ^ upper bound -> Double -- ^ desired relative error -> Int -- ^ number of subdivisions -> IO Integ...	[ -0.0252685546875, -0.00104522705078125, 0.008056640625, -0.027099609375, 0.0201416015625, 0.0026092529296875, -0.01055908203125, -0.0179443359375, -0.005462646484375, -0.0038604736328125, -0.00823974609375, -0.0004024505615234375, -0.0208740234375, 0.000972747802734375, 0.01336669921875,...	[ 1984, 28670, 683, 4448, 15, 8331, 34, 2661, 33079, 107172, 360, 18, 436, 17780, 4210, 58745, 93511, 21533, 157353, 5, 13331, 9114, 2940, 92319, 99091, 1407, 104851, 35845, 18499, 14012, 1614, 428, 25826, 204681, 4332, 7, 7136, 34292, 25902,...	[ 0.121826171875, 0.2169189453125, 0.1673583984375, 0.287353515625, 0.0057373046875, 0.07171630859375, 0.1116943359375, 0.158935546875, 0.07318115234375, 0.2392578125, 0.10675048828125, 0.12890625, 0.146240234375, 0.197265625, 0.0247344970703125, 0.03424072265625, 0.1341552734375, 0....	embed
1365034_c0	1365034	haskell	0	Title: Haskell function pattern-matching issues Problem title: Haskell function pattern-matching issues Tags: haskell Problem: Haskell function pattern-matching issues I'm doing some homework and while I have some experience with SML, Haskell has some oddities. Consider this simple function: type Pos = (Int, Int) data ...	Haskell function pattern-matching issues Haskell function pattern-matching issues haskell Haskell Pos Move North South East West y-1 x-1 m:ms Main Couldn Haskell function pattern-matching issues I'm doing some homework and while I have some experience with SML, Haskell has some oddities. Consider this simple function: ...	[ -0.00872802734375, 0.02001953125, 0.01007080078125, -0.0067138671875, -0.0064697265625, 0.003204345703125, -0.02099609375, 0, 0.01611328125, -0.007720947265625, 0.01531982421875, -0.00274658203125, 0.00016689300537109375, -0.02490234375, -0.0018157958984375, -0.00628662109375, -0.003...	[ 20625, 142508, 32354, 103510, 98753, 214, 37348, 1556, 13498, 135828, 23924, 25134, 24453, 10542, 113, 5759, 1022, 347, 4432, 191147, 18244, 159, 39456, 81960, 8781, 3293, 18151, 43240, 2174, 202317, 1810, 425, 4, 53, 370, 8705, 13319, 4527, ...	[ 0.1468505859375, 0.2467041015625, 0.17333984375, 0.2216796875, 0.22509765625, 0.035675048828125, 0.1712646484375, 0.1312255859375, 0.2181396484375, 0.1585693359375, 0.1058349609375, 0.0987548828125, 0.0980224609375, 0.10614013671875, 0.0689697265625, 0.1033935546875, 0.04342651367187...	embed
27060805_c1	27060805	haskell	1	], morphisms :: [m], -- Each morphism has a domain and a codomain which are objects: domain :: m -> o, codomain :: m -> o, -- Given two morphisms f and g such that codomain f = domain g, -- the composition of f and g, written (g f), is defined: compose :: m -> m -> Maybe m, -- For every object X there is an identity mo...	], morphisms :: [m], -- Each morphism has a domain and a codomain which are objects: domain :: m -> o, codomain :: m -> o, -- Given two morphisms f and g such that codomain f = domain g, -- the composition of f and g, written (g f), is defined: compose :: m -> m -> Maybe m, -- For every object X there is an identity mo...	[ 0.012451171875, 0.002197265625, -0.0022430419921875, 0.0198974609375, 0.017578125, 0.0169677734375, 0.009765625, -0.014404296875, 0.017822265625, 0.01092529296875, -0.024658203125, -0.040771484375, 0.002777099609375, 0.0028228759765625, -0.020751953125, 0.00732421875, 0.0059814453125...	[ 10114, 4, 178851, 8780, 7, 1984, 39, 4210, 98423, 1556, 10, 77758, 136, 552, 56206, 73, 621, 36746, 347, 33079, 36, 6626, 1238, 706, 166577, 111, 59121, 177, 61924, 150350, 83425, 1326, 11907, 1193, 182324, 3447, 1542, 38679, 2174, 76775,...	[ 0.042205810546875, 0.0172271728515625, 0.244873046875, 0.1756591796875, 0.035888671875, 0.048492431640625, 0.128173828125, 0.03973388671875, 0.149169921875, 0.0792236328125, 0.0673828125, 0.2138671875, 0.13671875, 0.1397705078125, 0.2186279296875, 0.115966796875, 0.040313720703125, ...	embed
76039680_c1	76039680	haskell	1	: Test.hs 2023-04-17T21:50:14.357932Z \| Warning \| No [cradle](https://github.com/mpickering/hie-bios#hie-bios) found for Test.hs. Proceeding with [implicit cradle](https://hackage.haskell.org/package/implicit-hie). You should ignore this message, unless you see a 'Multi Cradle: No prefixes matched' error. [Info - 10:50...	: Test.hs 2023-04-17T21:50:14.357932Z \| Warning \| No [cradle](https://github.com/mpickering/hie-bios#hie-bios) found for Test.hs. Proceeding with [implicit cradle](https://hackage.haskell.org/package/implicit-hie). You should ignore this message, unless you see a 'Multi Cradle: No prefixes matched' error. [Info - 10:50...	[ -0.0224609375, 0.01611328125, 0.0091552734375, 0.0164794921875, -0.00994873046875, 0.00933837890625, -0.0250244140625, 0.0159912109375, -0.0159912109375, 0.0028839111328125, 0.01104736328125, -0.0174560546875, -0.018310546875, 0.0009613037109375, 0.0037994384765625, 0.0146484375, -0....	[ 8647, 5, 127, 7, 140429, 40866, 115021, 5550, 592, 438, 378, 15182, 19298, 15769, 32102, 11368, 11050, 214, 979, 13, 100473, 14037, 84607, 678, 64357, 60923, 5589, 133, 139509, 10557, 142508, 1478, 29102, 124962, 26008, 50657, 118, 34734, 1...	[ 0.23291015625, 0.04547119140625, 0.16259765625, 0.14453125, 0.0870361328125, 0.041107177734375, 0.000823974609375, 0.10693359375, 0.06463623046875, 0.1500244140625, 0.0084228515625, 0.165283203125, 0.1951904296875, 0.079345703125, 0.1448974609375, 0.06011962890625, 0.1138916015625, ...	embed
41889738_c0	41889738	haskell	0	Title: Retaining list-ness operations for a data type Problem title: Retaining list-ness operations for a data type Tags: haskell, algebraic-data-types Problem: Retaining list-ness operations for a data type I want to be able to define a custom data type as opposed to using a type alias to ensure that proper values are...	Retaining list-ness operations for a data type Retaining list-ness operations for a data type haskell algebraic-data-types Data.Ord Data.List Retaining Example Down DictEntry Integer Show Ord word1 freq1 word2 freq2 Dictionary Retaining list-ness operations for a data type I want to be able to define a custom data type...	[ 0.0042724609375, 0.0244140625, 0.003143310546875, -0.0128173828125, -0.002410888671875, -0.00025177001953125, -0.007659912109375, -0.0166015625, 0.00750732421875, -0.01202392578125, -0.00408935546875, -0.004119873046875, 0.00157928466796875, 0.01312255859375, -0.0201416015625, 0.005584...	[ 853, 102, 14653, 5303, 9, 7432, 41018, 100, 2053, 10644, 1556, 142508, 429, 2844, 10135, 50986, 11809, 143045, 154663, 89536, 49472, 60897, 7768, 44401, 17367, 35379, 2565, 12478, 304, 147638, 3444, 61924, 114122, 55109, 63284, 27798, 142424, ...	[ 0.1163330078125, 0.177001953125, 0.059112548828125, 0.2081298828125, 0.1173095703125, 0.14404296875, 0.1827392578125, 0.024810791015625, 0.126220703125, 0.2257080078125, 0.10736083984375, 0.20654296875, 0.014617919921875, 0.007598876953125, 0.072509765625, 0.19140625, 0.0883178710937...	embed
78693173_c0	78693173	haskell	0	Title: For function definition, what is the difference between using partial application, a lamba expression or put the arguments next to the name? Problem title: For function definition, what is the difference between using partial application, a lamba expression or put the arguments next to the name? Tags: function-d...	For function definition, what is the difference between using partial application, a lamba expression or put the arguments next to the name? For function definition, what is the difference between using partial application, a lamba expression or put the arguments next to the name? function-definition haskell partial-ap...	[ 0.00396728515625, -0.0027313232421875, 0.011962890625, -0.0008697509765625, -0.0167236328125, 0.005950927734375, 0.01226806640625, -0.01806640625, 0.0026397705078125, -0.005523681640625, -0.006744384765625, -0.0245361328125, 0.00250244140625, -0.005645751953125, 0.003204345703125, -0.0...	[ 32354, 80934, 60212, 17721, 17368, 2878, 289, 38415, 105277, 125195, 3884, 10750, 7, 11737, 47, 9351, 49919, 1556, 142508, 101687, 21, 6492, 85, 1405, 17262, 6002, 102, 31195, 4537, 14602, 5701, 50218, 129927, 25632, 18151, 43240, 5885, 26785...	[ 0.1932373046875, 0.1732177734375, 0.164794921875, 0.035797119140625, 0.050201416015625, 0.1864013671875, 0.0914306640625, 0.201171875, 0.20703125, 0.19775390625, 0.07196044921875, 0.215576171875, 0.03253173828125, 0.10638427734375, 0.0869140625, 0.1070556640625, 0.131103515625, 0.0...	embed
28334189_c0	28334189	haskell	0	Title: Haskell. update a single Vector element in O(1) Problem title: Haskell. update a single Vector element in O(1) Tags: vector, haskell Problem: Haskell. update a single Vector element in O(1) I want to write a function that updates a single vector element in O(1): Vector Integer -> Int -> Integer -> Vector Integer...	Haskell. update a single Vector element in O(1) Haskell. update a single Vector element in O(1) vector haskell Haskell Vector Integer Data.Vector.Generic.fromList Data.Vector.modify Data.Vector.Mutable.write Data.Vector.Mutable.unsafeWrite DVM.write Couldn Expected DV.Vector Actual Data.Vector Data.Vector.Mutable Haske...	[ -0.03857421875, 0.03369140625, -0.0130615234375, -0.01055908203125, 0.0142822265625, -0.0001850128173828125, -0.0240478515625, -0.01275634765625, 0.0091552734375, -0.005889892578125, -0.010009765625, 0.007354736328125, 0.006072998046875, 0.0003795623779296875, -0.006439208984375, 0.008...	[ 20625, 142508, 28350, 11001, 2609, 18770, 12830, 180, 27750, 173, 1556, 44401, 11809, 26455, 135932, 12259, 161063, 154663, 13415, 40383, 10685, 22819, 18781, 309, 115840, 391, 47599, 434, 191147, 60075, 107199, 6, 100582, 3444, 33022, 32354, 1...	[ 0.1470947265625, 0.2467041015625, 0.189453125, 0.17333984375, 0.210693359375, 0.185302734375, 0.1846923828125, 0.1895751953125, 0.1455078125, 0.2030029296875, 0.123046875, 0.10333251953125, 0.1253662109375, 0.1676025390625, 0.087646484375, 0.08544921875, 0.08978271484375, 0.0803222...	embed
34477552_c0	34477552	haskell	0	Title: Tree merge algorithm in Haskell Problem title: Tree merge algorithm in Haskell Tags: tree, algorithm, haskell Problem: Tree merge algorithm in Haskell I need a function which takes two trees, checks to see if there are any common branches coming off the trunk, and merges the trees into a single tree if possible....	Tree merge algorithm in Haskell Tree merge algorithm in Haskell tree algorithm haskell Data.Tree Tree Haskell test1 test2 Either Bool Node Right Left Tree merge algorithm in Haskell I need a function which takes two trees, checks to see if there are any common branches coming off the trunk, and merges the trees into a ...	[ 0.00040435791015625, 0.022705078125, 0.0022735595703125, -0.0037841796875, 0.0152587890625, 0.006011962890625, -0.04296875, -0.01080322265625, 0.00098419189453125, -0.00384521484375, 0.00093841552734375, 0.00830078125, 0.00732421875, 0.005279541015625, 0.02392578125, -0.00860595703125,...	[ 101344, 42564, 234873, 20625, 142508, 53201, 1556, 11809, 62731, 3034, 418, 304, 9319, 2460, 929, 438, 112, 90911, 636, 2480, 23, 3871, 32354, 51776, 6626, 1360, 12765, 1957, 2174, 39210, 90356, 38162, 5773, 195550, 3934, 11001, 7722, 988, ...	[ 0.255126953125, 0.283203125, 0.2083740234375, 0.12353515625, 0.218994140625, 0.211669921875, 0.1112060546875, 0.03857421875, 0.1739501953125, 0.1358642578125, 0.014373779296875, 0.050689697265625, 0.03363037109375, 0.0199737548828125, 0.110595703125, 0.1065673828125, 0.04489135742187...	embed
71167160_c0	71167160	haskell	0	Title: How to install an library in Haskell? Problem title: How to install an library in Haskell? Tags: haskell Problem: How to install an library in Haskell? I try to use Control.Monad.Extra.andM import Control.Monad.Extra (andM) but has an error: Could not find module ‘Control.Monad.Extra’ Perhaps you meant Control.M...	How to install an library in Haskell? How to install an library in Haskell? haskell Control.Monad.Error Control.Monad.Extra How Haskell Could Perhaps Control.Monad.Catch exceptions-0.10.4 mtl-2.2.2 Control.Monad.Except PACKAGE How to install an library in Haskell? I try to use Control.Monad.Extra.andM but has an error:...	[ -0.01708984375, 0.006317138671875, 0.0019989013671875, 0.0234375, 0.004150390625, 0.0029296875, -0.002044677734375, -0.006561279296875, 0.00128173828125, 0.004608154296875, -0.0047607421875, -0.06640625, 0.008544921875, 0.004425048828125, 0.00125885009765625, -0.00823974609375, -0.00...	[ 11249, 47, 20600, 35773, 1294, 23, 20625, 142508, 142, 1556, 27131, 46674, 712, 18468, 31611, 19279, 1517, 191147, 181799, 76775, 131527, 102014, 121254, 141, 70147, 19462, 11107, 20572, 9790, 4527, 2940, 594, 18499, 3293, 959, 3249, 10422, 4...	[ 0.048858642578125, 0.037384033203125, 0.211669921875, 0.2220458984375, 0.171142578125, 0.09185791015625, 0.1553955078125, 0.258544921875, 0.0421142578125, 0.125, 0.224609375, 0.123779296875, 0.171630859375, 0.0650634765625, 0.036102294921875, 0.10369873046875, 0.162353515625, 0.027...	embed
33764456_c0	33764456	haskell	0	Title: Why is Haskell unable to resolve the number of arguments automatically? Problem title: Why is Haskell unable to resolve the number of arguments automatically? Tags: haskell Problem: Why is Haskell unable to resolve the number of arguments automatically? I'm new to Haskell and I got confused by the following beha...	Why is Haskell unable to resolve the number of arguments automatically? Why is Haskell unable to resolve the number of arguments automatically? haskell Why Haskell Show Empty Equations Why is Haskell unable to resolve the number of arguments automatically? I'm new to Haskell and I got confused by the following behavior...	[ -0.01165771484375, -0.00421142578125, 0.002410888671875, 0.00103759765625, -0.0037841796875, 0.01318359375, -0.0015869140625, -0.006683349609375, 0.04345703125, -0.00299072265625, 0.00016689300537109375, -0.039794921875, 0.005950927734375, 0.039794921875, 0.0137939453125, -0.0131835937...	[ 44084, 20625, 142508, 51, 2886, 103608, 14012, 10750, 7, 191082, 1556, 17367, 31678, 939, 13722, 83, 47, 3525, 55681, 123166, 32354, 35142, 194583, 23389, 33342, 903, 3164, 4127, 20697, 84751, 5303, 7639, 19736, 33478, 11001, 79315, 28219, 26...	[ 0.0721435546875, 0.1361083984375, 0.2437744140625, 0.07147216796875, 0.13330078125, 0.180908203125, 0.095458984375, 0.252197265625, 0.051177978515625, 0.1929931640625, 0.109619140625, 0.05792236328125, 0.1513671875, 0.07177734375, 0.1392822265625, 0.009613037109375, 0.00384521484375,...	embed
51142250_c0	51142250	haskell	0	Title: Cassava parsing error in haskell Problem title: Cassava parsing error in haskell Tags: parsing, haskell, csv Problem: Cassava parsing error in haskell Im trying to convert a csv into a vector using cassava. The csv Im trying to convert is the fischer iris data set, used for machine learning. It consists of four ...	Cassava parsing error in haskell Cassava parsing error in haskell parsing haskell csv Data.Csv qualified Cassava LANGUAGE OverloadedStrings Main Data.ByteString.Lazy Data.Vector Iris sepal_length Double sepal_width petal_length petal_width iris_type Show Read FromNamedRecord BS.readFile Left Apply Right V.forM_ Iris-se...	[ -0.0103759765625, 0.0184326171875, -0.0130615234375, 0.0247802734375, 0.00897216796875, 0.0111083984375, -0.01312255859375, -0.00787353515625, -0.0167236328125, -0.0235595703125, -0.00811767578125, -0.02490234375, 0.006134033203125, -0.0036773681640625, -0.00677490234375, -0.0147705078...	[ 103978, 5528, 366, 6953, 18499, 23, 1556, 142508, 20763, 334, 11809, 67756, 217225, 3358, 98064, 9578, 63033, 297, 71713, 12321, 2729, 3285, 26455, 18770, 122816, 40, 5007, 23986, 107172, 146984, 280, 1803, 97153, 50986, 17367, 4764, 32271, 8...	[ 0.16650390625, 0.281005859375, 0.1795654296875, 0.036956787109375, 0.18212890625, 0.0030517578125, 0.1221923828125, 0.234619140625, 0.0709228515625, 0.2080078125, 0.0869140625, 0.1920166015625, 0.1666259765625, 0.01263427734375, 0.103515625, 0.083984375, 0.15625, 0.008697509765625,...	embed
44494694_c0	44494694	haskell	0	Title: Represent of a collection of binary data Problem title: Represent of a collection of binary data Tags: haskell, optimization, performance, memory Problem: Represent of a collection of binary data I'm working with signals in which the samples consist of Float s. Some of the algorithms I've written only require to...	Represent of a collection of binary data Represent of a collection of binary data haskell optimization performance memory Represent Float Vector Boolean Bit Array Represent of a collection of binary data I'm working with signals in which the samples consist of Float s. Some of the algorithms I've written only require t...	[ 0.017333984375, 0.030517578125, -0.0167236328125, 0.024658203125, -0.0225830078125, 0.0087890625, -0.0157470703125, 0.00311279296875, 0.005096435546875, 0.012451171875, -0.0166015625, -0.0211181640625, 0.006988525390625, 0.0216064453125, -0.01007080078125, 0.01409912109375, 0.0063476...	[ 853, 55247, 111, 42486, 2394, 6635, 2053, 1556, 142508, 87235, 23718, 98323, 38699, 257, 2609, 18770, 73783, 34677, 27774, 69253, 53, 20697, 26073, 121413, 58055, 91, 234873, 59121, 4734, 64209, 3714, 3229, 41421, 1022, 33102, 24491, 34292, 4...	[ 0.0982666015625, 0.2578125, 0.0814208984375, 0.184814453125, 0.1676025390625, 0.13427734375, 0.1771240234375, 0.10302734375, 0.2186279296875, 0.160400390625, 0.1278076171875, 0.1395263671875, 0.190185546875, 0.108642578125, 0.2060546875, 0.2232666015625, 0.1422119140625, 0.23669433...	embed
6028424_c0	6028424	haskell	0	Title: Defining Eq instance for Haskell GADTs Problem title: Defining Eq instance for Haskell GADTs Tags: haskell, gadt Problem: Defining Eq instance for Haskell GADTs I have a GADT that's a lot like this: data In a where M :: MVar a -> In a T :: TVar a -> In a F :: (a -> b) -> In a -> In b It wraps various input primi...	Defining Eq instance for Haskell GADTs Defining Eq instance for Haskell GADTs haskell gadt Defining Haskell GADTs MVar TVar Functor Defining Eq instance for Haskell GADTs I have a GADT that's a lot like this: It wraps various input primitives, but the last constructor also allows for a Functor instance: The point of th...	[ -0.003509521484375, 0.01708984375, 0.0008697509765625, 0.002288818359375, 0.0196533203125, -0.006011962890625, -0.015380859375, -0.015380859375, 0.004119873046875, -0.01287841796875, 0.00811767578125, -0.02490234375, 0.00677490234375, 0.00726318359375, -0.00994873046875, 0.019653320312...	[ 88606, 241, 864, 110527, 20625, 142508, 23749, 41072, 1556, 914, 13384, 66160, 147, 1910, 28670, 18770, 1884, 137565, 67842, 107730, 128489, 4568, 64549, 748, 114864, 6275, 10644, 8060, 61924, 162520, 2967, 50960, 7225, 35782, 1022, 136, 113, ...	[ 0.1654052734375, 0.09442138671875, 0.2548828125, 0.28759765625, 0.126220703125, 0.213134765625, 0.115478515625, 0.162109375, 0.11376953125, 0.078369140625, 0.0926513671875, 0.02801513671875, 0.1165771484375, 0.0643310546875, 0.10113525390625, 0.1246337890625, 0.005859375, 0.1065673...	embed
62601435_c0	62601435	haskell	0	Title: Is there a Lens/Optic that can use to dig deeply into multidimensional maps? Problem title: Is there a Lens/Optic that can use to dig deeply into multidimensional maps? Tags: lenses, haskell Problem: Is there a Lens/Optic that can use to dig deeply into multidimensional maps? I've had a bit of difficulty using L...	Is there a Lens/Optic that can use to dig deeply into multidimensional maps? Is there a Lens/Optic that can use to dig deeply into multidimensional maps? lenses haskell Lens Optic Map Is there a Lens/Optic that can use to dig deeply into multidimensional maps? I've had a bit of difficulty using Lenses with Maps. I have...	[ -0.002044677734375, -0.00054931640625, -0.0081787109375, -0.0010223388671875, -0.01458740234375, -0.007232666015625, 0.0087890625, -0.02685546875, -0.00885009765625, -0.0223388671875, 0.01611328125, 0.0186767578125, 0.00086212158203125, 0.013427734375, 0.007720947265625, -0.00463867187...	[ 2071, 2685, 10, 18226, 7, 64, 670, 112569, 450, 831, 4527, 1466, 53894, 538, 3934, 6024, 157955, 22288, 47, 96, 47754, 1556, 142508, 180, 42719, 4785, 34844, 17368, 339, 678, 103033, 6713, 1884, 903, 23351, 214, 166179, 360, 18, 10298, ...	[ 0.03863525390625, 0.09210205078125, 0.0833740234375, 0.1907958984375, 0.118896484375, 0.0675048828125, 0.12939453125, 0.22412109375, 0.052490234375, 0.09063720703125, 0.135009765625, 0.2174072265625, 0.1832275390625, 0.0638427734375, 0.1546630859375, 0.145751953125, 0.1878662109375, ...	embed
3851042_c0	3851042	haskell	0	Title: Pattern Matching a Haskell list of variable size Problem title: Pattern Matching a Haskell list of variable size Tags: haskell, pattern-matching Problem: Pattern Matching a Haskell list of variable size EDIT : I shouldn't be coding when this tired. I was compiling a different copy of the program than I was runni...	Pattern Matching a Haskell list of variable size Pattern Matching a Haskell list of variable size haskell pattern-matching Pattern Matching Haskell server:nick:channel IRC.startIRC server:port:nick:channel Incorrect irc.freenode.net core.hs:9:4-32 Pattern Matching a Haskell list of variable size EDIT : I shouldn't be c...	[ -0.0107421875, 0.017822265625, -0.009765625, 0.0181884765625, -0.00946044921875, 0.01397705078125, -0.021484375, 0.01287841796875, 0.00946044921875, 0.0029296875, 0.04150390625, -0.0400390625, -0.0067138671875, -0.002166748046875, 0.0026702880859375, -0.005279541015625, 0.03295898437...	[ 9876, 22766, 67407, 214, 20625, 142508, 5303, 77336, 13267, 1556, 103510, 98753, 10723, 67127, 17032, 87, 25740, 17137, 14688, 441, 6982, 32399, 193, 238, 32087, 157, 112, 1179, 56458, 127, 1126, 617, 108760, 552, 168661, 9969, 12921, 43658, ...	[ 0.195556640625, 0.1806640625, 0.2578125, 0.0261383056640625, 0.1617431640625, 0.2486572265625, 0.1883544921875, 0.2384033203125, 0.1512451171875, 0.12255859375, 0.2437744140625, 0.2294921875, 0.1104736328125, 0.151611328125, 0.1021728515625, 0.0177459716796875, 0.1312255859375, 0.0...	embed
29444043_c1	29444043	haskell	1	has found a solution using ancient versions with very loose constraints. What I'd like to do is find out which of the packages I'm installing are causing this. Usually I can see something like "oh, those are a bunch of graphics packages, it's probably xmonad or taffybar that's the reason", and I go check the latest ve...	has found a solution using ancient versions with very loose constraints. What I'd like to do is find out which of the packages I'm installing are causing this. Usually I can see something like "oh, those are a bunch of graphics packages, it's probably xmonad or taffybar that's the reason", and I go check the latest ve...	[ -0.00714111328125, 0.0115966796875, 0.01904296875, 0.018310546875, -0.0004215240478515625, 0.0306396484375, -0.0205078125, -0.00958251953125, -0.0018157958984375, 0.02294921875, 0.00640869140625, -0.052734375, 0.00174713134765625, 0.005828857421875, -0.0167236328125, 0.00830078125, -...	[ 1556, 14037, 10, 29806, 17368, 45964, 11389, 4552, 5078, 184, 158, 2816, 4288, 25, 1884, 7413, 1810, 98169, 7, 87, 39, 20600, 214, 621, 216806, 903, 62544, 1957, 10597, 4, 8382, 147306, 48461, 31895, 1022, 3796, 712, 308, 76195, 1299, 3...	[ 0.032501220703125, 0.039337158203125, 0.038055419921875, 0.1407470703125, 0.04541015625, 0.08251953125, 0.1746826171875, 0.045867919921875, 0.1136474609375, 0.12158203125, 0.0509033203125, 0.14404296875, 0.107421875, 0.03564453125, 0.03973388671875, 0.0694580078125, 0.113525390625, ...	embed
72922945_c0	72922945	haskell	0	Title: All possible binary trees storing a value Problem title: All possible binary trees storing a value Tags: functional-programming, monads, haskell Problem: All possible binary trees storing a value I want to write a function, allTrees , to generate a list of all possible binary trees that store the number of leave...	All possible binary trees storing a value All possible binary trees storing a value functional-programming monads haskell All BTree Ord Show SpecTree Integer size1 sub1 size2 sub2 All possible binary trees storing a value I want to write a function, allTrees , to generate a list of all possible binary trees that store ...	[ 0.0257568359375, 0.00848388671875, -0.0169677734375, -0.015625, 0.016845703125, 0.015380859375, -0.033203125, -0.02587890625, 0.015625, -0.04296875, -0.01318359375, -0.00125885009765625, 0.00799560546875, 0.01611328125, 0.01483154296875, 0.0272216796875, 0.019287109375, -0.00360107...	[ 3164, 7722, 2394, 6635, 1360, 90, 3082, 214, 34292, 123309, 28966, 2667, 712, 1556, 142508, 107, 13, 35379, 17367, 24990, 62731, 44401, 13267, 1614, 3444, 33022, 10, 32354, 756, 139392, 5303, 4343, 14012, 31358, 12638, 53201, 2053, 52895, 8...	[ 0.1085205078125, 0.1739501953125, 0.1510009765625, 0.080078125, 0.2227783203125, 0.128662109375, 0.16357421875, 0.040374755859375, 0.16796875, 0.1229248046875, 0.0965576171875, 0.05670166015625, 0.0802001953125, 0.08758544921875, 0.191162109375, 0.15576171875, 0.031982421875, 0.169...	embed
30584526_c1	30584526	haskell	1	putStrLn "X ranges from: " from <- getLine putStrLn "To: " to <- getLine putStrLn "In steps of (Only whole numbers are accepted):" step <- getLine putStrLn "Please have some patience..." let range = [read from,(read from + read step)..read to] :: [Int] let searches = map (replaceX search) range let res = map getResult...	putStrLn "X ranges from: " from <- getLine putStrLn "To: " to <- getLine putStrLn "In steps of (Only whole numbers are accepted):" step <- getLine putStrLn "Please have some patience..." let range = [read from,(read from + read step)..read to] :: [Int] let searches = map (replaceX search) range let res = map getResult...	[ -0.013671875, 0.00848388671875, 0.00148773193359375, -0.00439453125, 0.0023040771484375, 0.0260009765625, 0.02197265625, -0.030517578125, 0.01422119140625, -0.0191650390625, -0.001739501953125, -0.01373291015625, -0.0025787353515625, 0.0108642578125, 0.01336669921875, 0.002639770507812...	[ 3884, 71713, 866, 19, 44, 1542, 37457, 7, 1295, 12, 2046, 93232, 7763, 47, 4153, 98441, 111, 20320, 28271, 101935, 68186, 29954, 238159, 765, 3060, 201010, 2633, 39116, 997, 12301, 33938, 22288, 107, 23935, 3332, 7136, 108210, 23577, 154663...	[ 0.2626953125, 0.272705078125, 0.1441650390625, 0.1385498046875, 0.016845703125, 0.156982421875, 0.25048828125, 0.138427734375, 0.1524658203125, 0.010101318359375, 0.1240234375, 0.2012939453125, 0.1654052734375, 0.06964111328125, 0.037139892578125, 0.16357421875, 0.004180908203125, ...	embed
58589415_c0	58589415	haskell	0	Title: stack exec failed when using http-client/http-client-tls in pure nix Problem title: stack exec failed when using http-client/http-client-tls in pure nix Tags: nix, haskell-stack, haskell Problem: stack exec failed when using http-client/http-client-tls in pure nix I'm using nix , stack and http-client-tls to GET...	stack exec failed when using http-client/http-client-tls in pure nix stack exec failed when using http-client/http-client-tls in pure nix nix haskell-stack haskell http-client/http-client-tls qualified Network.HTTP.Client Network.HTTP.Client.TLS LANGUAGE OverloadedStrings Main Data.ByteString.Lazy www.google.com.tw Res...	[ -0.015380859375, 0.00732421875, 0.0194091796875, 0.018798828125, -0.0029296875, -0.005218505859375, -0.004486083984375, -0.003936767578125, -0.01171875, -0.00958251953125, 0.022216796875, 0.00970458984375, 0.0038909912109375, 0.00052642822265625, 0.01080322265625, 0.0029144287109375, ...	[ 177261, 1119, 3240, 165523, 17368, 1621, 222978, 5475, 18, 8080, 34166, 300, 425, 1556, 142508, 590, 2594, 217225, 28997, 18544, 23658, 150, 41445, 98064, 9578, 63033, 297, 71713, 12321, 11809, 75358, 2729, 3285, 59875, 32290, 92748, 335, 933...	[ 0.249755859375, 0.107666015625, 0.2093505859375, 0.1688232421875, 0.054168701171875, 0.1409912109375, 0.1959228515625, 0.137451171875, 0.059051513671875, 0.139892578125, 0.1845703125, 0.09552001953125, 0.1295166015625, 0.050262451171875, 0.2158203125, 0.06988525390625, 0.084106445312...	embed
12067084_c1	12067084	haskell	1	sect t1 t2 subtract ∷ Tree → Tree → Tree subtract t1 t2 = Binary Subtract t1 t2 data Primitive = Sphere { radius ∷ Double } \| Block { size ∷ Vec3 } \| Cone { radius ∷ Double , height ∷ Double } deriving (Show) data UnaryOp = Transform Proj4 deriving (Show) data BinaryOp = Union \| Intersect \| Subtract deriving (Show) dat...	sect t1 t2 subtract ∷ Tree → Tree → Tree subtract t1 t2 = Binary Subtract t1 t2 data Primitive = Sphere { radius ∷ Double } \| Block { size ∷ Vec3 } \| Cone { radius ∷ Double , height ∷ Double } deriving (Show) data UnaryOp = Transform Proj4 deriving (Show) data BinaryOp = Union \| Intersect \| Subtract deriving (Show) dat...	[ 0.01416015625, 0.01220703125, 0.00799560546875, 0.0146484375, 0.0216064453125, -0.001922607421875, -0.032470703125, 0.000370025634765625, -0.00168609619140625, -0.0164794921875, -0.02685546875, 0.013427734375, 0.005859375, -0.00009679794311523438, -0.01226806640625, 0.0247802734375, ...	[ 19216, 18, 808, 418, 304, 1614, 39989, 247341, 101344, 2863, 2203, 54092, 1294, 8273, 2053, 44506, 14, 4935, 8019, 35593, 4567, 107172, 80231, 13267, 52884, 363, 1657, 13, 155955, 16406, 168660, 4228, 39029, 11062, 5037, 1250, 170, 617, 325...	[ 0.2037353515625, 0.136474609375, 0.1275634765625, 0.125732421875, 0.1783447265625, 0.1436767578125, 0.199462890625, 0.117431640625, 0.226318359375, 0.036590576171875, 0.0740966796875, 0.197509765625, 0.0875244140625, 0.128662109375, 0.2022705078125, 0.1544189453125, 0.062255859375, ...	embed
27726555_c0	27726555	haskell	0	Title: Deriving Typeable for Text.PrettyPrint.Doc Problem title: Deriving Typeable for Text.PrettyPrint.Doc Tags: ghc-generics, ghc, haskell, scrap-your-boilerplate Problem: Deriving Typeable for Text.PrettyPrint.Doc I have an AST type that I want to derive as Typeable, so that I can do Scrap-your-boilerplate generic t...	Deriving Typeable for Text.PrettyPrint.Doc Deriving Typeable for Text.PrettyPrint.Doc ghc-generics ghc haskell scrap-your-boilerplate Deriving Typeable Text.PrettyPrint.Doc Doc Data P.Doc Can Deriving Typeable for Text.PrettyPrint.Doc I have an AST type that I want to derive as Typeable, so that I can do Scrap-your-boi...	[ 0.011474609375, 0.00007963180541992188, -0.0027923583984375, 0.00897216796875, 0.0010223388671875, 0.011962890625, 0.0059814453125, -0.00157928466796875, -0.0096435546875, -0.034912109375, -0.0032196044921875, -0.0155029296875, 0.0140380859375, -0.0107421875, 0, -0.000217437744140625, ...	[ 1310, 14, 6496, 60457, 2886, 100, 24129, 19273, 15145, 112079, 18, 8331, 238, 31380, 79446, 1556, 142508, 120948, 154176, 837, 34759, 92558, 29048, 11809, 436, 4171, 48963, 10644, 122, 5844, 237, 219536, 189534, 37317, 53201, 8668, 89914, 357...	[ 0.143798828125, 0.0869140625, 0.07855224609375, 0.274658203125, 0.25732421875, 0.07666015625, 0.1876220703125, 0.1212158203125, 0.14697265625, 0.1395263671875, 0.062744140625, 0.117919921875, 0.03692626953125, 0.0625, 0.117431640625, 0.065185546875, 0.173095703125, 0.1649169921875,...	embed
75872651_c0	75872651	haskell	0	Title: How to do mapMaybe using lenses Problem title: How to do mapMaybe using lenses Tags: haskell, aeson, lenses, fold, haskell-lens Problem: How to do mapMaybe using lenses I am using wreq on the github api to get a list of files in a repository. I include this for completeness sake. This isn't about doing the web r...	How to do mapMaybe using lenses How to do mapMaybe using lenses haskell aeson lenses fold haskell-lens InvalidUrlException lenses How Accept vnd.github.raw X-GitHub-Api-Version api.github.com Text.unpack Left HttpExceptionRequest Error Text.pack Url Right eb21b416a406ebae963116911afd3cd0994132ce a47bd530c4b8677af24b291...	[ -0.0189208984375, 0.0025482177734375, 0.00093841552734375, -0.0216064453125, -0.015625, 0.017578125, 0.00274658203125, -0.0174560546875, -0.00537109375, -0.0263671875, -0.000827789306640625, 0.023193359375, -0.0048828125, -0.007598876953125, 0.0181884765625, -0.00156402587890625, -0....	[ 11249, 54, 22288, 82419, 372, 17368, 96, 47754, 1556, 142508, 10, 90, 191, 42822, 1977, 7013, 48743, 63928, 111383, 81, 2208, 15769, 32102, 81456, 1193, 217, 140505, 1434, 178390, 31470, 24129, 309, 29102, 3062, 212059, 4143, 90911, 201939, ...	[ 0.040191650390625, 0.09967041015625, 0.2193603515625, 0.1907958984375, 0.2010498046875, 0.1329345703125, 0.1827392578125, 0.216796875, 0.1134033203125, 0.218017578125, 0.0384521484375, 0.068115234375, 0.1439208984375, 0.146240234375, 0.1627197265625, 0.08740234375, 0.06524658203125, ...	embed
77603190_c0	77603190	haskell	0	Title: Haskell and Parsec: Parsing two separated lists of numbers Problem title: Haskell and Parsec: Parsing two separated lists of numbers Tags: parsing, haskell, parsec Problem: Haskell and Parsec: Parsing two separated lists of numbers I've been experimenting with Parsec for the first time in my life and I found a t...	Haskell and Parsec: Parsing two separated lists of numbers Haskell and Parsec: Parsing two separated lists of numbers parsing haskell parsec Haskell Parsec Parsing Data Show Parser Parsec.string Parsec.spaces many1 Parsec.digit Parsec.char Parsec.space sepBy1 Haskell and Parsec: Parsing two separated lists of numbers I...	[ -0.005218505859375, 0.0166015625, -0.01373291015625, 0.051025390625, -0.010986328125, 0.029052734375, 0.006134033203125, -0.0098876953125, 0.00860595703125, -0.0022735595703125, 0.0137939453125, -0.0016326904296875, 0.01287841796875, 0.019775390625, -0.0167236328125, -0.017578125, 0....	[ 20625, 142508, 136, 2392, 39797, 6953, 6626, 84797, 71, 5303, 101935, 366, 1556, 11809, 17367, 2189, 91693, 65421, 5941, 418, 4803, 9254, 25040, 75358, 28007, 678, 5117, 6897, 66211, 212615, 34844, 3444, 184, 390, 58745, 62816, 27781, 13806, ...	[ 0.1549072265625, 0.25927734375, 0.1187744140625, 0.1943359375, 0.285888671875, 0.091796875, 0.145263671875, 0.18408203125, 0.016326904296875, 0.199951171875, 0.17822265625, 0.1783447265625, 0.1309814453125, 0.1292724609375, 0.129638671875, 0.1265869140625, 0.093505859375, 0.1856689...	embed
66949565_c1	66949565	haskell	1	legacy fallback) Building vector-0.11.0.0 (lib) Building zlib-0.5.4.2 (lib) Building Win32-2.3.0.0 (all, legacy fallback) Building haskell-src-exts-1.14.0.1 (all, legacy fallback) Failed to build Win32-2.3.0.0. Build log ( C:\Users\nicod\AppData\Roaming\cabal\logs\ghc-7.0.1\Win32-2.3.0.0-bc0070ef9ddaa5b276f777956fac43...	legacy fallback) Building vector-0.11.0.0 (lib) Building zlib-0.5.4.2 (lib) Building Win32-2.3.0.0 (all, legacy fallback) Building haskell-src-exts-1.14.0.1 (all, legacy fallback) Failed to build Win32-2.3.0.0. Build log ( C:\Users\nicod\AppData\Roaming\cabal\logs\ghc-7.0.1\Win32-2.3.0.0-bc0070ef9ddaa5b276f777956fac43...	[ -0.0172119140625, 0.01202392578125, 0.004364013671875, 0.002197265625, 0.004150390625, 0.00494384765625, -0.01495361328125, -0.0257568359375, -0.01507568359375, 0.005401611328125, 0.01416015625, -0.0155029296875, 0.032470703125, -0.01104736328125, -0.0033416748046875, -0.0030517578125,...	[ 3257, 2408, 6817, 12620, 104919, 173, 18770, 23320, 14556, 99929, 5612, 97, 93645, 5, 117904, 15, 17686, 6460, 120883, 5584, 1556, 142508, 19437, 3355, 933, 5759, 2592, 102014, 190355, 297, 47, 45367, 9, 121137, 12684, 313, 1062, 12150, 391...	[ 0.179443359375, 0.1177978515625, 0.1627197265625, 0.203369140625, 0.2454833984375, 0.1861572265625, 0.1939697265625, 0.049224853515625, 0.142578125, 0.2276611328125, 0.2215576171875, 0.0626220703125, 0.12646484375, 0.0266265869140625, 0.134033203125, 0.005706787109375, 0.106567382812...	embed
59164992_c0	59164992	haskell	0	Title: Could not find module in runhaskell-script Problem title: Could not find module in runhaskell-script Tags: haskell-stack, cabal, haskell Problem: Could not find module in runhaskell-script I code haskell of poor quality in december each year. This year my environment is broken for some reason. When I try to run ...	Could not find module in runhaskell-script Could not find module in runhaskell-script haskell-stack cabal haskell Could myCode.hs Data.List.Split Use Maybe Haskell Setup Configuring split-0.2.3.3 Encountered Could not find module in runhaskell-script I code haskell of poor quality in december each year. This year my en...	[ -0.0196533203125, 0.00579833984375, -0.01275634765625, 0.0185546875, -0.00787353515625, 0.0162353515625, 0.0113525390625, -0.0081787109375, -0.0107421875, -0.02099609375, -0.0107421875, -0.01397705078125, 0.002960205078125, 0.0174560546875, -0.002166748046875, 0.01092529296875, -0.00...	[ 191147, 959, 7413, 88996, 23, 11675, 10557, 142508, 32032, 1556, 590, 2594, 109524, 759, 114211, 127, 11809, 154663, 31923, 4353, 36836, 83425, 20625, 19943, 2037, 59994, 65450, 133684, 134693, 71013, 9, 18151, 70425, 31897, 13104, 12638, 6602,...	[ 0.06341552734375, 0.119384765625, 0.1876220703125, 0.265869140625, 0.0433349609375, 0.1146240234375, 0.124755859375, 0.212646484375, 0.2005615234375, 0.11669921875, 0.0209503173828125, 0.052734375, 0.19775390625, 0.09912109375, 0.181640625, 0.07452392578125, 0.0792236328125, 0.0740...	embed
1746743_c0	1746743	haskell	0	Title: Extending an existing type in OCaml Problem title: Extending an existing type in OCaml Tags: type-systems, functional-programming, ocaml, haskell, types Problem: Extending an existing type in OCaml I've been doing some OCaml programming lately to learn the language and to get more acquainted with functional prog...	Extending an existing type in OCaml Extending an existing type in OCaml type-systems functional-programming ocaml haskell types Extending OCaml Xor Not Nop Extending an existing type in OCaml I've been doing some OCaml programming lately to learn the language and to get more acquainted with functional programming. Rece...	[ -0.000152587890625, 0.023681640625, 0.006591796875, 0.0380859375, -0.00518798828125, 0.0074462890625, -0.0272216796875, 0.0093994140625, -0.0142822265625, -0.03515625, 0.00823974609375, 0.00015544891357421875, 0.0086669921875, -0.01043701171875, -0.009521484375, -0.01116943359375, 0....	[ 5443, 67, 33770, 144573, 10644, 180, 105272, 141, 23, 16751, 123309, 28966, 36, 9779, 1556, 142508, 52895, 1193, 748, 11205, 438, 254, 56037, 37838, 30698, 46876, 5351, 1884, 19048, 65042, 88303, 10002, 3444, 15190, 20117, 47, 4734, 3525, 3...	[ 0.1165771484375, 0.169921875, 0.03692626953125, 0.220703125, 0.2423095703125, 0.095947265625, 0.1781005859375, 0.137451171875, 0.04278564453125, 0.069091796875, 0.140380859375, 0.0718994140625, 0.0235137939453125, 0.1087646484375, 0.05450439453125, 0.2205810546875, 0.187744140625, ...	embed
37936081_c0	37936081	haskell	0	Title: What is required to extend an Untyped Lambda calculus implementation to cover the Simply Typed Lambda Calculus? Problem title: What is required to extend an Untyped Lambda calculus implementation to cover the Simply Typed Lambda Calculus? Tags: lambda-calculus, scheme, system-f, haskell Problem: What is required...	What is required to extend an Untyped Lambda calculus implementation to cover the Simply Typed Lambda Calculus? What is required to extend an Untyped Lambda calculus implementation to cover the Simply Typed Lambda Calculus? lambda-calculus scheme system-f haskell What Untyped Lambda Simply Typed Calculus What is requir...	[ 0.0106201171875, 0.01153564453125, 0.0238037109375, 0.00732421875, 0.004425048828125, -0.0244140625, 0.003997802734375, 0.006317138671875, -0.006500244140625, -0.0308837890625, -0.007049560546875, -0.0517578125, -0.02490234375, 0.0020599365234375, 0.0064697265625, 0.00885009765625, -...	[ 4865, 56065, 65042, 992, 50986, 71, 122930, 85, 44805, 223, 208124, 29256, 55331, 538, 60457, 212467, 21, 6492, 6827, 94739, 150370, 5426, 420, 1556, 142508, 39162, 22553, 29479, 29481, 56, 23, 361, 124519, 34702, 282, 56458, 20625, 5337, 1...	[ 0.05377197265625, 0.1739501953125, 0.1890869140625, 0.1190185546875, 0.2286376953125, 0.04315185546875, 0.1739501953125, 0.1336669921875, 0.1922607421875, 0.07476806640625, 0.1468505859375, 0.112060546875, 0.1416015625, 0.055511474609375, 0.2239990234375, 0.2020263671875, 0.015518188...	embed
22105637_c0	22105637	haskell	0	Title: How to make "liftM2 (+) (T 1) (T 2)" working to produce "T 3" for "newtype T = T Int" Problem title: How to make "liftM2 (+) (T 1) (T 2)" working to produce "T 3" for "newtype T = T Int" Tags: applicative, monads, haskell Problem: How to make "liftM2 (+...	How to make "liftM2 (+) (T 1) (T 2)" working to produce "T 3" for "newtype T = T Int" How to make "liftM2 (+) (T 1) (T 2)" working to produce "T 3" for "newtype T = T Int" applicative monads haskell How liftM2 Monad myLiftT2 How to make "liftM2 (+) (T 1) (T 2)...	[ -0.027587890625, 0.0030364990234375, 0.00531005859375, 0.0216064453125, 0.00689697265625, 0.00616455078125, -0.006805419921875, -0.006072998046875, 0.017822265625, -0.031982421875, 0.02490234375, -0.01446533203125, 0.005096435546875, 0.0137939453125, -0.0003376007080078125, -0.01745605...	[ 11249, 3249, 104501, 594, 304, 22183, 618, 4879, 4958, 20697, 27489, 138, 50986, 384, 360, 18, 54936, 41816, 4935, 2667, 712, 1556, 142508, 60520, 60331, 71, 759, 9506, 2480, 10644, 61924, 35064, 3444, 137565, 892, 1505, 23, 41018, 142424, ...	[ 0.034698486328125, 0.07440185546875, 0.2088623046875, 0.1593017578125, 0.181396484375, 0.16015625, 0.1363525390625, 0.09130859375, 0.10760498046875, 0.0885009765625, 0.1192626953125, 0.1568603515625, 0.1732177734375, 0.1556396484375, 0.053955078125, 0.072021484375, 0.000579833984375,...	embed
43049205_c0	43049205	haskell	0	Title: How can I read a file and convert the content in [[Char]],? - IO String to String Problem title: How can I read a file and convert the content in [[Char]],? - IO String to String Tags: list, haskell Problem: How can I read a file and convert the content in [[Char]],? - IO String to String I have a file like this...	How can I read a file and convert the content in [[Char]],? - IO String to String How can I read a file and convert the content in [[Char]],? - IO String to String list haskell How Char file.txt Couldn Expected Actual How can I read a file and convert the content in [[Char]],? - IO String to String I have a file like t...	[ -0.013916015625, -0.01544189453125, -0.003936767578125, 0.0211181640625, -0.00689697265625, 0.0245361328125, 0.0015106201171875, -0.0054931640625, -0.005462646484375, -0.00112152099609375, -0.002410888671875, -0.03271484375, -0.010498046875, 0.018310546875, 0.0023040771484375, -0.00762...	[ 11249, 831, 12301, 11435, 136, 96760, 10941, 23, 84068, 86245, 17780, 23351, 214, 47, 87, 10, 5303, 1556, 142508, 21656, 124326, 191147, 19, 60075, 13, 89829, 100582, 1884, 3871, 64549, 34479, 97259, 123276, 135401, 37842, 217063, 26008, 2821...	[ 0.0687255859375, 0.09320068359375, 0.2327880859375, 0.2020263671875, 0.06884765625, 0.1710205078125, 0.2042236328125, 0.1412353515625, 0.263916015625, 0.030242919921875, 0.1966552734375, 0.1859130859375, 0.12646484375, 0.1363525390625, 0.0241546630859375, 0.0253448486328125, 0.177734...	embed
48412023_c0	48412023	haskell	0	Title: Regarding (When Executed) in Haskell IO Monad Problem title: Regarding (When Executed) in Haskell IO Monad Tags: haskell, io, function Problem: Regarding (When Executed) in Haskell IO Monad I have no problem with the IO Monad. But I want to understand the followings: In All/almost Haskell tutorials/ text books t...	Regarding (When Executed) in Haskell IO Monad Regarding (When Executed) in Haskell IO Monad haskell io function Regarding When Executed Haskell Monad Regarding (When Executed) in Haskell IO Monad I have no problem with the IO Monad. But I want to understand the followings: In All/almost Haskell tutorials/ text books th...	[ 0.003814697265625, 0.0108642578125, 0.015869140625, 0.0177001953125, 0.0157470703125, 0.017333984375, 0.00167083740234375, -0.00946044921875, -0.002899169921875, -0.01116943359375, 0.020263671875, -0.0281982421875, -0.0267333984375, -0.00115966796875, 0.00145721435546875, 0.00390625, ...	[ 180358, 214, 186048, 211603, 297, 23, 20625, 142508, 17780, 60331, 71, 1556, 22995, 32354, 14847, 110, 2967, 4966, 3444, 28219, 25632, 3164, 840, 57143, 7986, 42840, 13695, 54433, 2046, 84068, 83, 959, 10, 34166, 6637, 831, 12921, 16750, 96...	[ 0.1650390625, 0.16015625, 0.2132568359375, 0.281005859375, 0.1358642578125, 0.08306884765625, 0.152587890625, 0.253173828125, 0.280029296875, 0.1925048828125, 0.13330078125, 0.1292724609375, 0.26953125, 0.218017578125, 0.2095947265625, 0.03125, 0.0614013671875, 0.0160064697265625, ...	embed
59494015_c0	59494015	haskell	0	Title: How to declare that the composition of two types is a monad Problem title: How to declare that the composition of two types is a monad Tags: haskell Problem: How to declare that the composition of two types is a monad I have function: step :: forall m . (MonadState IntCodeState m) => m (Maybe ()) When I use do n...	How to declare that the composition of two types is a monad How to declare that the composition of two types is a monad haskell How MonadState IntCodeState Maybe StateT How to declare that the composition of two types is a monad I have function: When I use do notation in the body of the function, it uses m as the monad...	[ -0.027099609375, -0.00159454345703125, 0.01348876953125, 0.029541015625, -0.01025390625, 0.0146484375, -0.00579833984375, -0.006805419921875, 0.01092529296875, -0.01397705078125, 0.0030670166015625, 0.00677490234375, -0.00927734375, 0.0172119140625, -0.0101318359375, 0.0001745223999023...	[ 11249, 47, 159978, 450, 166577, 6626, 52895, 83, 10, 2667, 712, 70, 1556, 142508, 60331, 71, 135206, 360, 18, 114211, 83425, 22836, 618, 32354, 4527, 54, 110, 22062, 14361, 347, 237, 41206, 20653, 3444, 17368, 28219, 36510, 20625, 161549, ...	[ 0.08380126953125, 0.0168304443359375, 0.2391357421875, 0.0535888671875, 0.256103515625, 0.1710205078125, 0.25048828125, 0.1134033203125, 0.111083984375, 0.165771484375, 0.2178955078125, 0.005035400390625, 0.0968017578125, 0.232666015625, 0.1412353515625, 0.08258056640625, 0.129638671...	embed
17051790_c0	17051790	haskell	0	Title: Debugging "too few bytes" error in GHCI Problem title: Debugging "too few bytes" error in GHCI Tags: haskell Problem: Debugging "too few bytes" error in GHCI I'm running a bunch of Get monads with runGetState at various points in my code. They run on a lazy ByteString returned by readFile . T...	Debugging "too few bytes" error in GHCI Debugging "too few bytes" error in GHCI haskell Debugging GHCI Get ByteString Failed Debugging "too few bytes" error in GHCI I'm running a bunch of Get monads with runGetState at various points in my code. They run on a lazy ByteString returned by readFile . T...	[ 0.0098876953125, 0.0091552734375, 0.0002422332763671875, -0.00011348724365234375, -0.006378173828125, 0.004150390625, 0.004364013671875, -0.00030517578125, -0.0108642578125, -0.0018768310546875, 0.026123046875, -0.0123291015625, -0.019287109375, -0.006256103515625, 0.00653076171875, 0....	[ 262, 978, 36659, 24838, 10846, 390, 1636, 18499, 41877, 17304, 1556, 142508, 20779, 3311, 67, 71713, 190355, 23, 51042, 147306, 2667, 712, 678, 11675, 724, 126, 135206, 26847, 18151, 21, 3285, 214, 176377, 12301, 174350, 5201, 32354, 11782, ...	[ 0.0814208984375, 0.1732177734375, 0.037261962890625, 0.14990234375, 0.2132568359375, 0.1549072265625, 0.151123046875, 0.1611328125, 0.1400146484375, 0.2098388671875, 0.06585693359375, 0.187255859375, 0.1116943359375, 0.09326171875, 0.109130859375, 0.10736083984375, 0.1160888671875, ...	embed
60681850_c1	60681850	haskell	1	make -shared -dynamic-too -fPIC -package-name adventlib System/IO/Advent.hs System/IO/Test.hs -o libHSadventlib.a -dyno libHSadventlib-ghc8.6.5.so Then it seems to fail linking the static library (I guess it is trying to link it as dynamic but using static objects): cd src; ghc --make -shared -dynamic-too -fPIC -packag...	trying to compile a haskell package without using cabal Given a correct .conf file, this seems to work The last two lines test that I can compile an executable binary and link the library both statically and dynamically. Reading the docs it seems that it should be possible to use -dynamic-too to combine the first two ...	[ -0.004669189453125, 0.00131988525390625, 0.01220703125, -0.00433349609375, -0.0203857421875, -0.01202392578125, -0.033203125, 0.00421142578125, -0.0115966796875, 0.007476806640625, -0.004119873046875, -0.0201416015625, 0.003997802734375, 0.0087890625, 0.004302978515625, -0.001029968261...	[ 31577, 9969, 1340, 1556, 142508, 98169, 15490, 17368, 109524, 26785, 70547, 11435, 37202, 4488, 4568, 124519, 3034, 71924, 2886, 2394, 6635, 3126, 35773, 1294, 13254, 84079, 7722, 4527, 20, 242554, 24838, 70163, 5117, 6626, 11001, 31380, 238, ...	[ 0.02471923828125, 0.1234130859375, 0.1279296875, 0.1202392578125, 0.21240234375, 0.15478515625, 0.0421142578125, 0.012969970703125, 0.182373046875, 0.022979736328125, 0.1727294921875, 0.1534423828125, 0.001739501953125, 0.0491943359375, 0.03662109375, 0.113037109375, 0.0543212890625,...	embed
60784681_c0	60784681	haskell	0	Title: How to extract a single value from a JSON object with a single "key-value"? Problem title: How to extract a single value from a JSON object with a single "key-value"? Tags: json, haskell Problem: How to extract a single value from a JSON object with a single "key-value"? An Http server return...	How to extract a single value from a JSON object with a single "key-value"? How to extract a single value from a JSON object with a single "key-value"? json haskell MyError a qualified How JSON some_value Data.ByteString Data.Text Data.Aeson Aeson func1 Either BS.ByteString Aeson.decode Just Aeson.O...	[ -0.0018768310546875, -0.0017852783203125, -0.00689697265625, -0.003143310546875, 0.00146484375, -0.00189208984375, -0.013671875, 0.00604248046875, -0.0011749267578125, -0.00933837890625, 0.007354736328125, 0.0036163330078125, 0.0004024505615234375, -0.007049560546875, 0.0098876953125, ...	[ 11249, 47, 125663, 11001, 34292, 1295, 821, 58627, 36746, 678, 19770, 9, 27494, 13, 1647, 1681, 1556, 142508, 2646, 18468, 31611, 217225, 3060, 11809, 75358, 67, 71713, 174379, 90, 191, 62, 7477, 418, 9319, 84145, 112, 40899, 9563, 75161, ...	[ 0.06121826171875, 0.00177001953125, 0.211669921875, 0.2288818359375, 0.2154541015625, 0.0902099609375, 0.1512451171875, 0.228515625, 0.1842041015625, 0.06207275390625, 0.1749267578125, 0.03411865234375, 0.212158203125, 0.0228118896484375, 0.08795166015625, 0.16650390625, 0.0705566406...	embed
18251054_c0	18251054	haskell	0	Title: Using Netwire to spawn lists from a value Problem title: Using Netwire to spawn lists from a value Tags: haskell, netwire Problem: Using Netwire to spawn lists from a value I think I'm fundamentally misunderstanding how to attack this type of problem with Netwire: I have the following test-case: I'd like to take...	Using Netwire to spawn lists from a value Using Netwire to spawn lists from a value haskell netwire a Control.Wire Using Netwire Wire Left Right Using Netwire to spawn lists from a value I think I'm fundamentally misunderstanding how to attack this type of problem with Netwire: I have the following test-case: I'd like ...	[ -0.0115966796875, 0.00421142578125, -0.01055908203125, 0.023681640625, -0.0269775390625, 0.00872802734375, 0.02001953125, -0.0306396484375, 0.0037384033203125, -0.03125, -0.00136566162109375, -0.005645751953125, 0.000896453857421875, 0.0166015625, 0.00193023681640625, -0.00518798828125...	[ 345, 10086, 17084, 13, 5623, 7710, 5303, 7, 1295, 34292, 1556, 142508, 2043, 27131, 57124, 3336, 90911, 5351, 20531, 1239, 24658, 52875, 2967, 3034, 58437, 1884, 5646, 79315, 65450, 3934, 124519, 28412, 12638, 13315, 82230, 126371, 132283, 17...	[ 0.05706787109375, 0.1339111328125, 0.2401123046875, 0.1370849609375, 0.15478515625, 0.1463623046875, 0.217041015625, 0.04412841796875, 0.1138916015625, 0.2159423828125, 0.1024169921875, 0.2060546875, 0.09326171875, 0.1834716796875, 0.154052734375, 0.159423828125, 0.042877197265625, ...	embed
31636962_c0	31636962	haskell	0	Title: How to use Int with the optparse-applicative inside a data constructor? Problem title: How to use Int with the optparse-applicative inside a data constructor? Tags: haskell Problem: How to use Int with the optparse-applicative inside a data constructor? I would like to use the optparse-applicative package to add...	How to use Int with the optparse-applicative inside a data constructor? How to use Int with the optparse-applicative inside a data constructor? haskell Options.Applicative Control.Monad.Trans.Reader How Configuration Main Parser ARG1 ARG2 How to use Int with the optparse-applicative inside a data constructor? I would l...	[ 0.00119781494140625, 0.01239013671875, -0.0003509521484375, 0.021240234375, 0.01141357421875, 0.01025390625, 0.0130615234375, -0.025146484375, 0.00927734375, -0.0152587890625, -0.01220703125, -0.01708984375, 0.01312255859375, 0.0206298828125, -0.0025787353515625, -0.007659912109375, ...	[ 11249, 47, 4527, 360, 18, 678, 43922, 2500, 184, 9007, 11048, 4935, 46132, 2053, 64549, 748, 1556, 142508, 152448, 39179, 27131, 46674, 712, 62624, 31345, 59994, 12321, 2392, 2189, 48802, 418, 304, 1884, 98169, 15190, 75101, 13315, 10750, 1...	[ 0.07562255859375, 0.010650634765625, 0.1361083984375, 0.1802978515625, 0.231689453125, 0.1519775390625, 0.1986083984375, 0.1787109375, 0.1461181640625, 0.092529296875, 0.1336669921875, 0.1041259765625, 0.15234375, 0.1187744140625, 0.1986083984375, 0.13671875, 0.087646484375, 0.2072...	embed
32682317_c0	32682317	haskell	0	Title: GStreamer plugin usage in Haskell Problem title: GStreamer plugin usage in Haskell Tags: haskell, gstreamer, plugins, opengl Problem: GStreamer plugin usage in Haskell I'm trying to get the image from a webcam with GStreamer and load it to an OpenGL texture. I'm using the gstreamer haskell library. I managed to ...	GStreamer plugin usage in Haskell GStreamer plugin usage in Haskell haskell gstreamer plugins opengl qualified GStreamer Haskell v4l2src gst_app_sink_pull_sample Media.Streaming.GStreamer GS.init GS.pluginLoadByName GS.registryLookupFeature GS.defaultRegistry Element GS.elementFactoryMake Just GStreamer plugin usage in...	[ 0.0015869140625, 0.0263671875, -0.0205078125, -0.0026702880859375, 0.00897216796875, 0.026123046875, 0.008544921875, -0.0262451171875, -0.01312255859375, -0.04638671875, 0.000046253204345703125, -0.033935546875, -0.0036468505859375, 0.0017547607421875, -0.0213623046875, 0.0087890625, ...	[ 527, 115061, 56, 69993, 127689, 20625, 142508, 1556, 706, 86429, 9803, 11016, 217225, 617, 141, 304, 19437, 57348, 9007, 7, 14068, 6645, 433, 33209, 4794, 724, 74356, 217, 145301, 15363, 49005, 214810, 54601, 48325, 62766, 135518, 29569, 2191...	[ 0.150634765625, 0.26025390625, 0.187255859375, 0.257080078125, 0.1156005859375, 0.13916015625, 0.23193359375, 0.1077880859375, 0.0616455078125, 0.23046875, 0.050750732421875, 0.11865234375, 0.1221923828125, 0.06378173828125, 0.03741455078125, 0.0540771484375, 0.125244140625, 0.1831...	embed
32894595_c0	32894595	haskell	0	Title: Why does feeding init to last not work in Haskell? Problem title: Why does feeding init to last not work in Haskell? Tags: haskell, function-composition, list Problem: Why does feeding init to last not work in Haskell? So I'm writing a line to get the second to last element of a list. Initially my code was mySLa...	Why does feeding init to last not work in Haskell? Why does feeding init to last not work in Haskell? haskell function-composition list it Why Haskell last.take last.init Couldn Integer Relevant Possible Why does feeding init to last not work in Haskell? So I'm writing a line to get the second to last element of a list...	[ -0.01409912109375, 0.0081787109375, 0.01318359375, 0.019287109375, -0.003173828125, 0.0177001953125, 0.00531005859375, -0.01055908203125, 0.005401611328125, -0.0262451171875, 0.01068115234375, 0.001129150390625, 0.007080078125, 0.0185546875, -0.0025787353515625, -0.0186767578125, 0.0...	[ 44084, 61590, 214, 23, 217, 47, 4568, 959, 4488, 20625, 142508, 1556, 32354, 277, 40322, 5303, 442, 78219, 73, 191147, 19, 44401, 133, 30624, 115861, 14602, 32562, 13315, 2046, 17932, 12830, 18151, 130078, 79786, 1257, 24189, 5120, 759, 564...	[ 0.1107177734375, 0.2064208984375, 0.1121826171875, 0.1143798828125, 0.1746826171875, 0.131103515625, 0.2110595703125, 0.1195068359375, 0.1500244140625, 0.1416015625, 0.215576171875, 0.1058349609375, 0.1593017578125, 0.019622802734375, 0.07098388671875, 0.1220703125, 0.02130126953125,...	embed
34966840_c0	34966840	haskell	0	Title: Polymorphic max heap in Haskell Problem title: Polymorphic max heap in Haskell Tags: haskell, heap Problem: Polymorphic max heap in Haskell The following example is my attempt at solving "take N most frequent words" in Haskell . I'd like to make heap function to work for both String and Text . It works for any o...	Polymorphic max heap in Haskell Polymorphic max heap in Haskell haskell heap Data.MultiSet Data.String Data.Tuple Data.Text qualified Polymorphic Haskell Text Couldn H.Heap H.FstMaxPolicy Occur LANGUAGE OverloadedStrings ExplicitForAll Main Data.Heap H.take H.insert H.empty T.swap M.insert M.empty IsString Polymorphic ...	[ 0.004425048828125, -0.003509521484375, -0.01336669921875, 0.0025482177734375, 0.00531005859375, 0.01513671875, 0.01531982421875, -0.0196533203125, 0.01385498046875, -0.03759765625, 0.00830078125, -0.026123046875, 0.02783203125, 0.013916015625, -0.0012969970703125, -0.0341796875, -0.0...	[ 63306, 178851, 18389, 764, 2631, 20625, 142508, 1556, 11809, 50657, 118, 294, 126, 71713, 8705, 174379, 217225, 24129, 191147, 572, 13025, 271, 71346, 106144, 16820, 98064, 9578, 63033, 60923, 43512, 12321, 78219, 33657, 33548, 634, 254, 2071, ...	[ 0.1710205078125, 0.1962890625, 0.20849609375, 0.192626953125, 0.177734375, 0.1510009765625, 0.2413330078125, 0.1337890625, 0.068603515625, 0.036041259765625, 0.00506591796875, 0.0274810791015625, 0.019866943359375, 0.0980224609375, 0.006927490234375, 0.096435546875, 0.0924072265625, ...	embed
36066033_c1	36066033	haskell	1	'algorithm' exampleInt :: MyMonad Int exampleInt = example -- assuming for example type A = () type B = Identity type C = () In the above code I am stuck at: test.hs:23:25: Illegal instance declaration for ‘ConfM d (MyStateT d m)’ (All instance types must be of the form (T a1 ... an) where a1 ... an are *distinct type...	'algorithm' exampleInt :: MyMonad Int exampleInt = example -- assuming for example type A = () type B = Identity type C = () In the above code I am stuck at: test.hs:23:25: Illegal instance declaration for ‘ConfM d (MyStateT d m)’ (All instance types must be of the form (T a1 ... an) where a1 ... an are *distinct type...	[ -0.037841796875, -0.00982666015625, 0.0162353515625, 0.01446533203125, 0.0024871826171875, 0.01806640625, -0.0012969970703125, -0.015625, 0.00537109375, -0.0167236328125, 0.0034332275390625, 0.0031280517578125, -0.005889892578125, 0.0027618408203125, -0.0155029296875, -0.0216064453125,...	[ 100628, 2783, 18337, 27781, 4153, 18, 2646, 46674, 712, 360, 66596, 10644, 62, 335, 71257, 2481, 313, 36917, 18151, 444, 179933, 99, 3034, 127, 24864, 21224, 891, 86966, 110527, 21635, 11935, 420, 594, 104, 31852, 135206, 618, 347, 43512, ...	[ 0.086669921875, 0.10791015625, 0.1025390625, 0.259521484375, 0.130615234375, 0.152587890625, 0.1201171875, 0.1197509765625, 0.147705078125, 0.09466552734375, 0.07244873046875, 0.1429443359375, 0.0380859375, 0.053375244140625, 0.168212890625, 0.05975341796875, 0.042755126953125, 0.0...	embed
46455462_c0	46455462	haskell	0	Title: GHCI infinite loop in Binary Search Tree Problem title: GHCI infinite loop in Binary Search Tree Tags: ghci, haskell Problem: GHCI infinite loop in Binary Search Tree I have this implementation of a Binary Search Tree in Haskell data BST = Nil \| Node (BST) Int (BST) deriving Show emptyTree :: BST emptyTree = Nil...	GHCI infinite loop in Binary Search Tree GHCI infinite loop in Binary Search Tree ghci haskell GHCI Binary Search Tree BST Nil Node Show Bool Empty insert_r GHCI infinite loop in Binary Search Tree I have this implementation of a Binary Search Tree in Haskell I'm trying to test it inserting some values into the tree. T...	[ 0.0185546875, -0.000385284423828125, 0.01953125, -0.0086669921875, 0.0244140625, 0.0087890625, -0.0014190673828125, -0.0137939453125, -0.0002918243408203125, -0.0361328125, 0.0223388671875, -0.006134033203125, 0.0035552978515625, 0.0091552734375, 0.02587890625, 0.0240478515625, 0.018...	[ 41877, 17304, 54241, 13, 40956, 54092, 1294, 33086, 101344, 31380, 318, 1556, 142508, 335, 8545, 77175, 438, 112, 17367, 2460, 929, 31678, 183540, 42, 208124, 20625, 31577, 3034, 142424, 53201, 121413, 134234, 944, 9790, 11675, 527, 73265, 14...	[ 0.1510009765625, 0.161865234375, 0.1614990234375, 0.05401611328125, 0.1983642578125, 0.173583984375, 0.0843505859375, 0.1795654296875, 0.221435546875, 0.0859375, 0.09814453125, 0.07763671875, 0.220947265625, 0.0207061767578125, 0.158203125, 0.1739501953125, 0.1070556640625, 0.08691...	embed
33185222_c0	33185222	haskell	0	Title: Make a type be either one type or another Problem title: Make a type be either one type or another Tags: haskell Problem: Make a type be either one type or another I'm a beginner in Haskell playing around with parsing and building an AST. I wonder how one would go about defining types like the following: A Value...	Make a type be either one type or another Make a type be either one type or another haskell Make Value Identifier Literal Lit Assignment Asgn How ValueId ValueLit Make a type be either one type or another I'm a beginner in Haskell playing around with parsing and building an AST. I wonder how one would go about defining...	[ 0.00384521484375, -0.003387451171875, -0.006622314453125, 0.0216064453125, -0.015625, 0.0042724609375, -0.030029296875, -0.001373291015625, 0.017578125, -0.01104736328125, 0.00003981590270996094, -0.01043701171875, -0.0023651123046875, -0.01458740234375, -0.01092529296875, 0.0223388671...	[ 26176, 10644, 186, 40101, 1632, 707, 15700, 10, 1556, 142508, 190060, 189543, 56, 135940, 141, 27668, 1301, 31304, 177, 11249, 568, 71, 866, 217, 9842, 1679, 20625, 75169, 10932, 366, 33976, 48963, 32195, 13204, 449, 52895, 1884, 25632, 62,...	[ 0.11279296875, 0.2919921875, 0.10748291015625, 0.1065673828125, 0.133056640625, 0.04400634765625, 0.103759765625, 0.03839111328125, 0.134033203125, 0.2420654296875, 0.291259765625, 0.212158203125, 0.1307373046875, 0.1865234375, 0.113525390625, 0.171875, 0.037506103515625, 0.1995849...	embed
59620798_c0	59620798	haskell	0	Title: How are Generalized Authentication Combinators Documented with swagger2 and servant Problem title: How are Generalized Authentication Combinators Documented with swagger2 and servant Tags: haskell, servant, swagger Problem: How are Generalized Authentication Combinators Documented with swagger2 and servant I hav...	How are Generalized Authentication Combinators Documented with swagger2 and servant How are Generalized Authentication Combinators Documented with swagger2 and servant haskell servant swagger How Generalized Authentication Combinators Documented swagger2 AuthUser auth_user_id Int64 auth_user_email Text Show Generic Aut...	[ -0.0250244140625, 0.00994873046875, -0.006866455078125, -0.02978515625, -0.01416015625, 0.01806640625, -0.0098876953125, -0.01446533203125, -0.002166748046875, 0.0023193359375, 0.01416015625, 0.0003986358642578125, 0.0125732421875, -0.002777099609375, -0.00616455078125, -0.002014160156...	[ 11249, 9082, 29367, 52236, 63250, 120639, 106935, 76, 22230, 43101, 297, 678, 68062, 21407, 304, 136, 187646, 621, 1556, 142508, 5655, 927, 1062, 531, 65918, 13307, 25501, 24129, 17367, 88342, 193348, 137989, 127942, 146968, 618, 20625, 294, ...	[ 0.07861328125, 0.1656494140625, 0.1466064453125, 0.1453857421875, 0.1702880859375, 0.055145263671875, 0.201416015625, 0.136474609375, 0.111328125, 0.2220458984375, 0.03948974609375, 0.1241455078125, 0.197265625, 0.226318359375, 0.1861572265625, 0.08453369140625, 0.263671875, 0.0304...	embed
17741624_c1	17741624	haskell	1	. MArray (STUArray s) a (S.ST s)) => HasSTU a type AC a = (HasSTU a) => forall s. a -> S.ST s (STUArray s Int a) type AU a = (HasSTU a) => forall s. STUArray s Int a -> S.ST s () type TX a = (HasSTU a) => a -> a -- or without the context data ArrayGen a = AG (AC a) (AU a) (TX a) Then this fails: instance (HasSTU a) => ...	. MArray (STUArray s) a (S.ST s)) => HasSTU a type AC a = (HasSTU a) => forall s. a -> S.ST s (STUArray s Int a) type AU a = (HasSTU a) => forall s. STUArray s Int a -> S.ST s () type TX a = (HasSTU a) => a -> a -- or without the context data ArrayGen a = AG (AC a) (AU a) (TX a) Then this fails: instance (HasSTU a) => ...	[ -0.021484375, 0.0146484375, 0.01263427734375, -0.01202392578125, 0.00518798828125, -0.0296630859375, 0.012451171875, -0.0196533203125, 0.010009765625, -0.020751953125, -0.00897216796875, 0.0303955078125, 0.00946044921875, -0.005157470703125, 0.0038909912109375, -0.00921630859375, -0....	[ 5, 9267, 42, 7092, 94432, 7614, 91, 10, 294, 8545, 20625, 10644, 12944, 6495, 100, 5584, 159, 360, 57488, 134929, 54047, 15490, 43701, 2053, 69253, 105376, 24639, 15012, 20000, 35782, 110527, 7, 222518, 29038, 23613, 62346, 339, 16428, 187,...	[ 0.01220703125, 0.0208892822265625, 0.050994873046875, 0.276611328125, 0.24560546875, 0.06439208984375, 0.12890625, 0.1966552734375, 0.0733642578125, 0.163818359375, 0.124755859375, 0.11865234375, 0.1212158203125, 0.1097412109375, 0.03680419921875, 0.1151123046875, 0.03533935546875, ...	embed
40795502_c0	40795502	haskell	0	Title: I/O Monad and ByteString to Char conversion? Problem title: I/O Monad and ByteString to Char conversion? Tags: haskell, io, monads Problem: I/O Monad and ByteString to Char conversion? I'm testing some HTTP requests in haskell and have the below methods: import qualified Data.ByteString.Lazy as LAZ import Langua...	I/O Monad and ByteString to Char conversion? I/O Monad and ByteString to Char conversion? haskell io monads qualified Language.Haskell.TH.Ppr System.IO Data.Word Monad ByteString Char Data.ByteString.Lazy LAZ Word8 LAZ.ByteString www.url.com LAZ.unpack I/O Monad and ByteString to Char conversion? I'm testing some HTTP ...	[ 0.01019287109375, 0.022216796875, 0.01025390625, 0.00109100341796875, 0.0007476806640625, 0.021728515625, -0.00537109375, -0.0279541015625, -0.0069580078125, -0.0052490234375, 0.017822265625, -0.040283203125, -0.0157470703125, 0.0130615234375, -0.0224609375, 0.00433349609375, 0.00515...	[ 87, 64, 670, 60331, 71, 136, 3311, 67, 71713, 214, 47, 21656, 142477, 32, 1556, 142508, 22995, 2667, 712, 7, 217225, 83658, 6495, 23415, 10287, 12353, 17780, 11809, 164805, 75358, 2729, 3285, 339, 17200, 22543, 1019, 25002, 277, 309, 2910...	[ 0.066162109375, 0.194580078125, 0.161865234375, 0.1971435546875, 0.1700439453125, 0.11083984375, 0.11083984375, 0.162109375, 0.2254638671875, 0.1331787109375, 0.123779296875, 0.2291259765625, 0.1993408203125, 0.00823974609375, 0.1136474609375, 0.2491455078125, 0.1971435546875, 0.13...	embed
71010972_c0	71010972	haskell	0	Title: How does Haskell pick a type for an ambiguous expression Problem title: How does Haskell pick a type for an ambiguous expression Tags: types, type-inference, haskell Problem: How does Haskell pick a type for an ambiguous expression If an expression can be typed in several ways, how does Haskell pick which one to...	How does Haskell pick a type for an ambiguous expression How does Haskell pick a type for an ambiguous expression types type-inference haskell Data.Ratio How Haskell GHCi www.haskell.org Prelude Ratio RealFrac Read Double Float Integer How does Haskell pick a type for an ambiguous expression If an expression can be typ...	[ -0.002532958984375, -0.0203857421875, 0.00286865234375, 0.0078125, 0.0133056640625, -0.008056640625, -0.0011138916015625, 0.0089111328125, 0.011474609375, 0.0147705078125, 0.0014190673828125, -0.0198974609375, 0.004547119140625, -0.0225830078125, 0.0191650390625, 0.007354736328125, 0...	[ 11249, 14602, 20625, 142508, 39580, 10644, 100, 920, 12282, 10821, 125195, 52895, 69988, 1556, 11809, 1052, 28645, 14, 10557, 1914, 822, 2552, 5565, 5120, 919, 20251, 4764, 107172, 38699, 44401, 831, 40368, 48322, 3642, 4527, 48120, 27781, 11...	[ 0.0914306640625, 0.008544921875, 0.139892578125, 0.265380859375, 0.1810302734375, 0.2431640625, 0.0435791015625, 0.1298828125, 0.1923828125, 0.0673828125, 0.227294921875, 0.18603515625, 0.1282958984375, 0.09765625, 0.043121337890625, 0.0543212890625, 0.1019287109375, 0.029907226562...	embed
67067754_c1	67067754	haskell	1	The name WhileT is after C's while . It can be easily seen that WhileT Identity is a monad. But what about other choices of m ? In particular, judging by some experiments, WhileT Maybe seems to be equivalent to ZipList . But it is already known that there is no instance Monad ZipList . Does this mean WhileT isn't real...	The name WhileT is after C's while . It can be easily seen that WhileT Identity is a monad. But what about other choices of m ? In particular, judging by some experiments, WhileT Maybe seems to be equivalent to ZipList . But it is already known that there is no instance Monad ZipList . Does this mean WhileT isn't real...	[ -0.0096435546875, 0.01043701171875, 0.0235595703125, 0.022216796875, 0.0235595703125, -0.00909423828125, -0.0086669921875, -0.020751953125, 0.0064697265625, -0.00885009765625, -0.006927490234375, 0.0233154296875, -0.0299072265625, 0.008056640625, 0.00095367431640625, -0.003860473632812...	[ 9351, 51404, 618, 83, 7103, 313, 25, 7, 12960, 6, 831, 186, 72546, 51592, 71257, 2481, 10, 2667, 712, 3789, 44126, 111, 347, 360, 4, 9966, 390, 28007, 83425, 37202, 47, 183234, 162150, 154663, 442, 21771, 51529, 110, 110527, 60331, 71, ...	[ 0.1119384765625, 0.28369140625, 0.274658203125, 0.055023193359375, 0.140625, 0.10760498046875, 0.026092529296875, 0.0251922607421875, 0.282470703125, 0.00970458984375, 0.0140228271484375, 0.009918212890625, 0.08563232421875, 0.04437255859375, 0.228759765625, 0.1497802734375, 0.042633...	embed
67408728_c0	67408728	haskell	0	Title: How does polymorphic recursion relate to infinite type errors? Problem title: How does polymorphic recursion relate to infinite type errors? Tags: haskell Problem: How does polymorphic recursion relate to infinite type errors? Context: I ran into a problem and got help here , however I realized I don't understan...	How does polymorphic recursion relate to infinite type errors? How does polymorphic recursion relate to infinite type errors? haskell How Param CmdParams arg:args Occurs How does polymorphic recursion relate to infinite type errors? Context: I ran into a problem and got help here , however I realized I don't understand...	[ -0.00640869140625, -0.00994873046875, 0.002685546875, 0.01287841796875, -0.0015411376953125, 0.0191650390625, 0.00186920166015625, -0.0106201171875, 0.00064849853515625, -0.028076171875, 0.0172119140625, -0.04296875, -0.005462646484375, 0.007080078125, 0.00848388671875, -0.016479492187...	[ 11249, 35874, 178851, 1771, 195625, 1830, 33444, 13, 54241, 10644, 18499, 7, 1556, 142508, 1720, 39, 54686, 28636, 8256, 79459, 61477, 48650, 14602, 47, 13028, 3934, 2967, 4358, 185171, 28219, 29806, 166117, 135179, 17569, 18344, 7569, 83, 13...	[ 0.057159423828125, 0.199462890625, 0.20703125, 0.06640625, 0.21923828125, 0.1015625, 0.1214599609375, 0.085693359375, 0.1400146484375, 0.1851806640625, 0.2247314453125, 0.062103271484375, 0.104248046875, 0.2047119140625, 0.08154296875, 0.038055419921875, 0.1405029296875, 0.08587646...	embed
29684482_c0	29684482	haskell	0	Title: Can I coerce an existentially quantified argument in a type constructor? Problem title: Can I coerce an existentially quantified argument in a type constructor? Tags: types, existential-type, gadt, haskell Problem: Can I coerce an existentially quantified argument in a type constructor? I have a data type whose ...	Can I coerce an existentially quantified argument in a type constructor? Can I coerce an existentially quantified argument in a type constructor? types existential-type gadt haskell Can LogEvent ToJSON Date Category LogLevel ThreadId Result Foo Can I coerce an existentially quantified argument in a type constructor? I ...	[ -0.005706787109375, 0.02294921875, -0.005218505859375, -0.000385284423828125, 0.0038909912109375, -0.01177978515625, -0.0027618408203125, 0.0283203125, 0.00640869140625, -0.03173828125, 0.012939453125, -0.004119873046875, -0.01458740234375, 0.0023040771484375, -0.023681640625, -0.02368...	[ 4171, 552, 56, 329, 99707, 14, 25958, 55230, 47314, 10750, 10644, 64549, 748, 87, 23, 52895, 15403, 50986, 914, 13384, 1556, 142508, 13146, 192134, 717, 1375, 58627, 25512, 49057, 5267, 2601, 136719, 568, 71, 126684, 9572, 31, 2053, 6953, ...	[ 0.0947265625, 0.120361328125, 0.1907958984375, 0.1162109375, 0.1795654296875, 0.047119140625, 0.066650390625, 0.164794921875, 0.111328125, 0.2349853515625, 0.2276611328125, 0.1788330078125, 0.1268310546875, 0.0216064453125, 0.016510009765625, 0.1590576171875, 0.094482421875, 0.1529...	embed
59124802_c1	59124802	haskell	1	overlooked something obvious - however can you help point it out? For completeness: on OS X, 10.15.1 stack --version : Version 1.9.3, Git revision 40cf7b37526b86d1676da82167ea8758a854953b (6211 commits) x86_64 hpack-0.31.1 stack ghc -- --version : The Glorious Glasgow Haskell Compilation System, version 8.6.5 stack pa...	overlooked something obvious - however can you help point it out? For completeness: on OS X, 10.15.1 stack --version : Version 1.9.3, Git revision 40cf7b37526b86d1676da82167ea8758a854953b (6211 commits) x86_64 hpack-0.31.1 stack ghc -- --version : The Glorious Glasgow Haskell Compilation System, version 8.6.5 stack pa...	[ -0.005889892578125, 0.004486083984375, -0.0228271484375, 0.006134033203125, -0.020751953125, 0.0103759765625, -0.0145263671875, -0.003021240234375, -0.015380859375, 0.00811767578125, -0.00012874603271484375, -0.011474609375, -0.01141357421875, 0.001129150390625, 0.003021240234375, -0.0...	[ 645, 64747, 9844, 162520, 49903, 4358, 6275, 1810, 28484, 98, 11787, 1193, 147546, 156627, 177261, 46354, 40647, 99420, 363, 527, 217, 111666, 1112, 275, 85433, 4046, 15276, 11835, 85, 165066, 13, 11, 10057, 156204, 10837, 1662, 375, 4007, ...	[ 0.058349609375, 0.1571044921875, 0.0181732177734375, 0.194580078125, 0.041015625, 0.093017578125, 0.08709716796875, 0.0316162109375, 0.09417724609375, 0.09674072265625, 0.184814453125, 0.1639404296875, 0.1744384765625, 0.268798828125, 0.193359375, 0.130615234375, 0.1590576171875, 0...	embed
17562486_c0	17562486	haskell	0	Title: Extensible errors Problem title: Extensible errors Tags: error-handling, haskell Problem: Extensible errors Describe a problem in several words. Guess I have an algorithms to check something, and depending on algorithm it can fail with slightly different errors, for example: data Error1 = Error1 data Error2 = Er...	Extensible errors Extensible errors error-handling haskell testError Extensible Error1 Error2 Error3 Algorithm CanFailWith Something Maybe FirstAlgorithm Either SecondAlgorithm Left Right Error Extensible errors Describe a problem in several words. Guess I have an algorithms to check something, and depending on algorit...	[ 0.00396728515625, -0.006134033203125, 0.0034332275390625, 0.0062255859375, 0.013916015625, -0.000553131103515625, -0.02734375, -0.00860595703125, -0.000370025634765625, -0.02001953125, -0.002410888671875, -0.00860595703125, 0.0169677734375, 0.0169677734375, -0.00154876708984375, 0.0157...	[ 5443, 510, 55356, 18499, 54885, 1556, 142508, 3034, 18468, 212059, 304, 363, 109847, 2783, 4171, 17647, 379, 194583, 200905, 83425, 23972, 6504, 8962, 9319, 77648, 2480, 90911, 7, 34601, 2967, 40368, 34153, 96274, 765, 234873, 12765, 96819, 8...	[ 0.1239013671875, 0.2276611328125, 0.2235107421875, 0.2440185546875, 0.1279296875, 0.1129150390625, 0.205322265625, 0.121826171875, 0.1123046875, 0.1942138671875, 0.01593017578125, 0.121337890625, 0.09259033203125, 0.10003662109375, 0.05810546875, 0.115478515625, 0.0833740234375, 0....	embed
49903372_c1	49903372	haskell	1	(y :: k) (b :: Bool) \| x y -> b data family HList (l::[*]) data instance HList '[] = HNil data instance HList (x ': xs) = x `HCons` HList xs deriving instance Eq (HList '[]) deriving instance (Eq x, Eq (HList xs)) => Eq (HList (x ': xs)) deriving instance Ord (HList '[]) deriving instance (Ord x, Ord (HList xs)) => Or...	(y :: k) (b :: Bool) \| x y -> b data family HList (l::[*]) data instance HList '[] = HNil data instance HList (x ': xs) = x `HCons` HList xs deriving instance Eq (HList '[]) deriving instance (Eq x, Eq (HList xs)) => Eq (HList (x ': xs)) deriving instance Ord (HList '[]) deriving instance (Ord x, Ord (HList xs)) => Or...	[ 0.003387451171875, 0.00104522705078125, 0.00457763671875, -0.003753662109375, -0.004913330078125, 0.01043701171875, -0.03076171875, 0.00201416015625, 0.023193359375, 0.0101318359375, -0.0135498046875, -0.0255126953125, 0.009765625, 0.021728515625, -0.023193359375, -0.0185546875, 0.02...	[ 15, 53, 1984, 472, 275, 2460, 929, 58745, 1022, 113, 33079, 876, 2053, 14449, 572, 154663, 141, 12, 1639, 110527, 242, 1065, 2203, 79059, 379, 425, 73265, 5245, 7, 16406, 864, 48599, 1419, 35379, 6496, 143045, 167457, 335, 18507, 27544, ...	[ 0.039306640625, 0.1422119140625, 0.1524658203125, 0.13525390625, 0.1151123046875, 0.118896484375, 0.204833984375, 0.0611572265625, 0.1197509765625, 0.1585693359375, 0.1358642578125, 0.149658203125, 0.1661376953125, 0.170654296875, 0.1849365234375, 0.274658203125, 0.0693359375, 0.01...	embed
36971976_c0	36971976	haskell	0	Title: What's the best way to represent a short bit string? Problem title: What's the best way to represent a short bit string? Tags: dictionary, haskell-lens, haskell, bit-manipulation Problem: What's the best way to represent a short bit string? I want to represent a string of up to around 120 bits, and spe...	What's the best way to represent a short bit string? What's the best way to represent a short bit string? dictionary haskell-lens haskell bit-manipulation What Word128 Data.Map What's the best way to represent a short bit string? I want to represent a string of up to around 120 bits, and speed is critical. I ...	[ -0.006622314453125, 0.005584716796875, -0.0115966796875, 0.0096435546875, -0.00640869140625, -0.00014019012451171875, 0.00323486328125, -0.01531982421875, -0.00022411346435546875, -0.00604248046875, 0.005859375, 0.0062255859375, -0.006744384765625, 0.0157470703125, 0.0146484375, 0.0169...	[ 3768, 2965, 3917, 47, 33636, 16610, 4785, 79315, 45, 10763, 1556, 142508, 1977, 7, 9051, 254, 72403, 22543, 81764, 11809, 166179, 70, 10, 3444, 1257, 10932, 5390, 38352, 130306, 3871, 45367, 91693, 119140, 91, 54387, 41018, 18588, 51, 25553...	[ 0.088623046875, 0.212158203125, 0.128173828125, 0.0704345703125, 0.290283203125, 0.268310546875, 0.208984375, 0.250732421875, 0.0059814453125, 0.038909912109375, 0.0863037109375, 0.2166748046875, 0.126708984375, 0.0704345703125, 0.0227508544921875, 0.06048583984375, 0.004180908203125...	embed
25821435_c0	25821435	haskell	0	Title: Reading and closing files in Haskell Problem title: Reading and closing files in Haskell Tags: xml, file-io, haskell Problem: Reading and closing files in Haskell I am a beginner in Haskell and currently I am trying to parse a list of xml files. To parse an xml file from a given filename I am using the following...	Reading and closing files in Haskell Reading and closing files in Haskell xml file-io haskell Reading Haskell News get_val TagClose TagOpen Bool Too Reading and closing files in Haskell I am a beginner in Haskell and currently I am trying to parse a list of xml files. To parse an xml file from a given filename I am usi...	[ 0.01318359375, 0.0186767578125, 0.0086669921875, -0.0081787109375, 0.01129150390625, 0.006927490234375, -0.000492095947265625, -0.029541015625, -0.00732421875, -0.0167236328125, 0.0078125, -0.01226806640625, -0.006439208984375, -0.00830078125, 0.03173828125, -0.007354736328125, -0.00...	[ 104951, 136, 20450, 102158, 20625, 142508, 6953, 131492, 11435, 846, 1556, 1833, 1405, 4837, 59453, 103264, 2460, 929, 56374, 9842, 1679, 31577, 366, 184, 5303, 11627, 17368, 25632, 32354, 50339, 9803, 174350, 177953, 146353, 7763, 31, 5941, ...	[ 0.1925048828125, 0.060546875, 0.174560546875, 0.1763916015625, 0.141357421875, 0.2237548828125, 0.03204345703125, 0.1884765625, 0.12841796875, 0.130859375, 0.1295166015625, 0.09765625, 0.125, 0.07427978515625, 0.1597900390625, 0.1832275390625, 0.0653076171875, 0.1312255859375, 0....	embed
69563309_c0	69563309	haskell	0	Title: Haskell add a UTCTime to a custom data attribute Problem title: Haskell add a UTCTime to a custom data attribute Tags: haskell Problem: Haskell add a UTCTime to a custom data attribute I need a help on how I can use a do block (to perform IO) in the follow function. Bassicaly I have a Entry like: data Entry = En...	Haskell add a UTCTime to a custom data attribute Haskell add a UTCTime to a custom data attribute haskell Haskell UTCTime Entry Maybe T.Text Generic Show Ord TuidoState BE.getEditContents _theEdit Just Test _entries BL.listInsert Haskell add a UTCTime to a custom data attribute I need a help on how I can use a do block...	[ -0.00732421875, 0.01025390625, 0.013916015625, -0.031982421875, 0.0087890625, -0.0172119140625, -0.01055908203125, 0.00787353515625, 0.0184326171875, -0.06640625, 0.028076171875, -0.017333984375, 0.01080322265625, 0.0181884765625, 0.0159912109375, -0.0068359375, 0.007659912109375, ...	[ 20625, 142508, 15190, 10, 99577, 70059, 47, 114122, 2053, 150380, 1556, 357, 15123, 83425, 384, 174379, 88342, 17367, 35379, 1371, 3911, 135206, 9622, 3794, 125270, 25352, 2347, 8647, 2517, 68170, 6562, 33657, 13, 3871, 4358, 3642, 831, 4527,...	[ 0.1226806640625, 0.2242431640625, 0.1197509765625, 0.048675537109375, 0.210205078125, 0.277587890625, 0.04119873046875, 0.20068359375, 0.146240234375, 0.205322265625, 0.1092529296875, 0.0819091796875, 0.16259765625, 0.0265960693359375, 0.043701171875, 0.1142578125, 0.0909423828125, ...	embed
1783668_c0	1783668	haskell	0	Title: How to recursively compare the digits in a number in Haskell Problem title: How to recursively compare the digits in a number in Haskell Tags: recursion, haskell Problem: How to recursively compare the digits in a number in Haskell I am doing problem 112 on Project Euler and came up with the following to test th...	How to recursively compare the digits in a number in Haskell How to recursively compare the digits in a number in Haskell recursion haskell How Haskell x:y:xs y:xs How to recursively compare the digits in a number in Haskell I am doing problem 112 on Project Euler and came up with the following to test the example case...	[ -0.0296630859375, -0.003936767578125, 0.0106201171875, 0.00970458984375, 0.00140380859375, 0.02099609375, 0.0166015625, -0.0179443359375, 0.01513671875, 0.01904296875, 0.00183868408203125, -0.001190185546875, 0.005523681640625, -0.0016632080078125, 0.00531005859375, -0.009033203125, ...	[ 11249, 47, 195625, 5844, 538, 69101, 153939, 7, 23, 14012, 20625, 142508, 1830, 1556, 1022, 12, 53, 425, 113, 70, 2967, 25837, 27331, 5177, 603, 3034, 27781, 7225, 15549, 757, 5, 5046, 2773, 35166, 3714, 3642, 54, 61924, 32354, 83, 4153...	[ 0.06829833984375, 0.02923583984375, 0.2457275390625, 0.1951904296875, 0.05126953125, 0.2568359375, 0.2301025390625, 0.095947265625, 0.08807373046875, 0.1888427734375, 0.1685791015625, 0.250732421875, 0.07635498046875, 0.1556396484375, 0.060272216796875, 0.05743408203125, 0.0729370117...	embed
23948188_c1	23948188	haskell	1	3 3),(3,LitF 1)] in 1 So now I'm interested in interpreting an abstract syntax graph rather than an abstract syntax tree . A naive evalGraph function eliminates sharing by interpreting it as if it were a tree: evalGraph (Graph env r) = go r where go j = case lookup j env of Just (AddF a b) -> go a + go b Just (LitF d) ...	3 3),(3,LitF 1)] in 1 So now I'm interested in interpreting an abstract syntax graph rather than an abstract syntax tree . A naive evalGraph function eliminates sharing by interpreting it as if it were a tree: evalGraph (Graph env r) = go r where go j = case lookup j env of Just (AddF a b) -> go a + go b Just (LitF d) ...	[ -0.031005859375, 0.0103759765625, -0.003326416015625, 0.00390625, -0.006927490234375, -0.001861572265625, -0.0013580322265625, 0.007537841796875, 0.02490234375, -0.01287841796875, -0.0037384033203125, 0.0023040771484375, 0.0108642578125, 0.0179443359375, 0.00665283203125, 0.02648925781...	[ 138, 8439, 86827, 217, 919, 23, 106, 60892, 29481, 214, 164789, 6002, 86531, 41382, 43257, 53201, 24, 5844, 28, 1405, 37878, 11727, 32354, 27169, 1636, 53371, 237, 2174, 3542, 22, 334, 1690, 738, 1647, 7225, 6713, 9563, 4028, 997, 104, ...	[ 0.05364990234375, 0.0755615234375, 0.04974365234375, 0.0151824951171875, 0.1131591796875, 0.04705810546875, 0.03997802734375, 0.0831298828125, 0.1978759765625, 0.0190277099609375, 0.22509765625, 0.0938720703125, 0.1529541015625, 0.2476806640625, 0.0241241455078125, 0.197509765625, 0....	embed
39033380_c0	39033380	haskell	0	Title: Using Char does not compile without FlexibleContexts Problem title: Using Char does not compile without FlexibleContexts Tags: haskell Problem: Using Char does not compile without FlexibleContexts sierpinski :: Int -> Array (Int,Int) Char sierpinski l = runSTArray $ do arr <- newArray ((1,1),(63,32)) '_' let dra...	Using Char does not compile without FlexibleContexts Using Char does not compile without FlexibleContexts haskell Using Char FlexibleContexts Array forM_ len..len Non MArray Use h-1 n-1 Using Char does not compile without FlexibleContexts However changing array type from Char to Int is okay Can someone clarify why is t...	[ -0.01904296875, -0.0001735687255859375, -0.0001087188720703125, -0.00439453125, -0.01092529296875, 0.00008726119995117188, -0.0025634765625, 0.000858306884765625, -0.00141143798828125, -0.0004100799560546875, -0.0032501220703125, -0.034423828125, 0.00640869140625, -0.00543212890625, -0.0...	[ 345, 6953, 21656, 959, 9969, 1340, 15490, 180842, 2661, 11935, 22829, 1556, 142508, 69253, 100, 3098, 1977, 3775, 7092, 36836, 1096, 5759, 14602, 151134, 10298, 53, 10644, 1295, 47, 360, 18, 68403, 17306, 15400, 123087 ]	[ 0.066162109375, 0.0074462890625, 0.2069091796875, 0.078857421875, 0.1431884765625, 0.1610107421875, 0.094970703125, 0.2061767578125, 0.1451416015625, 0.0634765625, 0.1923828125, 0.121826171875, 0.2034912109375, 0.1060791015625, 0.04278564453125, 0.0986328125, 0.0921630859375, 0.070...	embed
49776924_c1	49776924	haskell	1	). Applicative m => (Element X -> m (Element X)) -> X -> m X’ NB: We cannot know what roles the parameters to ‘m’ have; we must assume that the role is nominal • When deriving the instance for (MonoTraversable X) \| 13 \| deriving newtype (MonoFunctor, MonoFoldable, MonoTraversable, Monoid, GrowingAppend, SemiSequence, M...	). Applicative m => (Element X -> m (Element X)) -> X -> m X’ NB: We cannot know what roles the parameters to ‘m’ have; we must assume that the role is nominal • When deriving the instance for (MonoTraversable X) \| 13 \| deriving newtype (MonoFunctor, MonoFoldable, MonoTraversable, Monoid, GrowingAppend, SemiSequence, M...	[ -0.0164794921875, 0.01513671875, 0.0029754638671875, 0.004791259765625, 0.007537841796875, 0.0081787109375, 0.0016326904296875, -0.0096435546875, 0.0031280517578125, -0.0001735687255859375, 0.0050048828125, -0.005218505859375, -0.01007080078125, 0.004302978515625, 0.00193023681640625, ...	[ 194, 5659, 11048, 4935, 347, 44357, 647, 19929, 1193, 33079, 26, 63813, 53418, 3714, 31486, 171859, 47, 39, 765, 8110, 41591, 109650, 14847, 16406, 6496, 110527, 46674, 31, 28542, 7864, 2886, 702, 3525, 50986, 97249, 18770, 77879, 919, 1834...	[ 0.1207275390625, 0.1590576171875, 0.2103271484375, 0.174560546875, 0.1778564453125, 0.0946044921875, 0.038665771484375, 0.171875, 0.179931640625, 0.1309814453125, 0.0115966796875, 0.0290985107421875, 0.0943603515625, 0.042083740234375, 0.15234375, 0.198486328125, 0.054840087890625, ...	embed
3323823_c0	3323823	haskell	0	Title: Equivalent expressions produce different results in a function? Problem title: Equivalent expressions produce different results in a function? Tags: haskell, integration Problem: Equivalent expressions produce different results in a function? I have a function (exercise 10.11 in Thompson's The Craft of Functiona...	Equivalent expressions produce different results in a function? Equivalent expressions produce different results in a function? haskell integration Data.Ratio Equivalent Rational d..b Double Equivalent expressions produce different results in a function? I have a function (exercise 10.11 in Thompson's The Craft of Func...	[ -0.002227783203125, -0.0189208984375, 0.018310546875, 0.017333984375, -0.00003981590270996094, 0.01544189453125, 0.0079345703125, -0.0184326171875, 0.0029754638671875, 0.0191650390625, -0.01611328125, 0.0291748046875, 0.00133514404296875, -0.0011138916015625, 0.0068359375, -0.002960205...	[ 145666, 85540, 125195, 7, 27489, 12921, 50339, 23, 32354, 1556, 142508, 157353, 11809, 1052, 28645, 2552, 43315, 104, 275, 107172, 46480, 15019, 4068, 1662, 170028, 34734, 2480, 28670, 10763, 27958, 7077, 35707, 53950, 34292, 71496, 28970, 645,...	[ 0.1380615234375, 0.2381591796875, 0.269287109375, 0.04486083984375, 0.1544189453125, 0.1722412109375, 0.160400390625, 0.007537841796875, 0.1702880859375, 0.1121826171875, 0.1961669921875, 0.191162109375, 0.065673828125, 0.068603515625, 0.1387939453125, 0.1065673828125, 0.081176757812...	embed
49773874_c0	49773874	haskell	0	Title: Making a wrapper over a generic Rep Problem title: Making a wrapper over a generic Rep Tags: haskell Problem: Making a wrapper over a generic Rep I have a Rep A for some type that I modify using some forall x. Rep A x -> F (Rep A) x function where F is a type family. Let's say this wraps all the fields in a Mayb...	Making a wrapper over a generic Rep Making a wrapper over a generic Rep haskell to Making Rep Maybe RepWrapper Generic Making a wrapper over a generic Rep I have a Rep A for some type that I modify using some forall x. Rep A x -> F (Rep A) x function where F is a type family. Let's say this wraps all the fields in a Ma...	[ -0.003631591796875, 0.00098419189453125, -0.00787353515625, -0.020263671875, -0.0191650390625, 0.009765625, -0.00970458984375, 0.005706787109375, 0.00836181640625, -0.01123046875, -0.01446533203125, 0.003173828125, 0.00897216796875, 0.0164794921875, 0.006622314453125, -0.00933837890625...	[ 13676, 137565, 1264, 645, 189534, 33742, 1556, 142508, 83425, 219, 8079, 88342, 62, 10644, 2811, 40383, 17368, 100, 5584, 1022, 33079, 563, 4332, 254, 32354, 14449, 756, 44457, 3444, 35686, 20650, 47, 821, 58627, 10, 90, 191, 87344, 52895, ...	[ 0.09234619140625, 0.2230224609375, 0.2042236328125, 0.1097412109375, 0.2332763671875, 0.216064453125, 0.12060546875, 0.209716796875, 0.2445068359375, 0.1617431640625, 0.1785888671875, 0.1732177734375, 0.10089111328125, 0.184814453125, 0.09088134765625, 0.06201171875, 0.01742553710937...	embed
51658023_c0	51658023	haskell	0	Title: How is it possible to get `Non-exhaustive patterns` exception when using `otherwise` Problem title: How is it possible to get `Non-exhaustive patterns` exception when using `otherwise` Tags: haskell, non-exhaustive-patterns Problem: How is it possible to get `Non-exhaustive patterns` exception when using `otherw...	How is it possible to get `Non-exhaustive patterns` exception when using `otherwise` How is it possible to get `Non-exhaustive patterns` exception when using `otherwise` haskell non-exhaustive-patterns How Non-exhaustive p_1 p_k Integer x:xs y:ys Bool k..n How is it possible to get `Non-exhaustive patterns` exception w...	[ -0.0213623046875, 0.0311279296875, 0.0036468505859375, -0.002471923828125, 0.0087890625, -0.00994873046875, 0.01312255859375, -0.00933837890625, 0.0113525390625, -0.0194091796875, 0.0166015625, 0.011962890625, 0.0208740234375, -0.0032196044921875, 0.00921630859375, 0.00494384765625, ...	[ 7722, 59881, 3355, 18391, 4935, 103510, 131527, 17368, 126340, 90825, 2046, 7, 1556, 142508, 351, 4453, 22766, 3775, 915, 115187, 92, 44401, 1022, 425, 113, 4778, 2460, 929, 23534, 101935, 3173, 997, 106, 959, 756, 20809, 18151, 80934, 3235...	[ 0.08367919921875, 0.146484375, 0.0289459228515625, 0.1383056640625, 0.050689697265625, 0.2109375, 0.2017822265625, 0.04095458984375, 0.15771484375, 0.23828125, 0.0281982421875, 0.0098876953125, 0.0936279296875, 0.1937255859375, 0.1328125, 0.10009765625, 0.120849609375, 0.1340332031...	embed
22138928_c0	22138928	haskell	0	Title: why are the state and reader monads functions while the writer monad is a tuple? Problem title: why are the state and reader monads functions while the writer monad is a tuple? Tags: functor, state, monads, haskell Problem: why are the state and reader monads functions while the writer monad is a tuple? I'm a Ha...	why are the state and reader monads functions while the writer monad is a tuple? why are the state and reader monads functions while the writer monad is a tuple? functor state monads haskell MonadPlus why are the state and reader monads functions while the writer monad is a tuple? I'm a Haskell newbie, and I think I un...	[ -0.00775146484375, 0.0216064453125, -0.0118408203125, 0.00787353515625, -0.00054168701171875, -0.010009765625, -0.015380859375, -0.01220703125, -0.006561279296875, -0.00616455078125, 0.01190185546875, -0.00018978118896484375, -0.0205078125, 0.00421142578125, -0.00396728515625, -0.01928...	[ 15400, 11341, 136, 155255, 2667, 712, 7, 32354, 12960, 70035, 370, 8705, 7477, 18770, 1556, 142508, 60331, 71, 88225, 20625, 9014, 28219, 135969, 5303, 1836, 61924, 3917, 765, 47, 36442, 58868, 47644, 16454, 707, 3871, 41872, 33079, 11, 205...	[ 0.11474609375, 0.1644287109375, 0.0809326171875, 0.230224609375, 0.1263427734375, 0.20458984375, 0.05743408203125, 0.2052001953125, 0.053497314453125, 0.205322265625, 0.09783935546875, 0.1942138671875, 0.0809326171875, 0.0819091796875, 0.0733642578125, 0.2237548828125, 0.121826171875...	embed
32437317_c0	32437317	haskell	0	Title: cabal + proxy: downloading packages from hackage Problem title: cabal + proxy: downloading packages from hackage Tags: windows, cabal, haskell Problem: cabal + proxy: downloading packages from hackage I'm using Haskell Platform 7.10.2-a (64-bit) on Windows: >cabal -V cabal-install version 1.22.6.0 using version ...	cabal + proxy: downloading packages from hackage cabal + proxy: downloading packages from hackage windows cabal haskell hackage version hackage.haskell.org Cabal http_proxy user:passwd acme.com:port Downloading Skipping Local Warning Run There You cabal + proxy: downloading packages from hackage I'm using Haskell Platf...	[ 0.00323486328125, 0.0230712890625, 0.0164794921875, -0.015869140625, -0.003204345703125, -0.004119873046875, -0.010009765625, 0.0262451171875, 0.0057373046875, 0.007232666015625, -0.00836181640625, -0.017822265625, -0.01904296875, -0.0159912109375, -0.01007080078125, 0.0004367828369140...	[ 109524, 997, 502, 50878, 12, 7026, 214, 98169, 1295, 85526, 4588, 54825, 1556, 142508, 11389, 10557, 1478, 30438, 289, 1621, 64101, 53, 38937, 13409, 37281, 1030, 282, 6982, 4857, 20491, 26783, 24172, 5550, 28398, 8622, 2583, 17368, 20625, ...	[ 0.278564453125, 0.1802978515625, 0.1661376953125, 0.29248046875, 0.009307861328125, 0.14111328125, 0.04718017578125, 0.1885986328125, 0.1181640625, 0.2091064453125, 0.150146484375, 0.102294921875, 0.13037109375, 0.2469482421875, 0.0950927734375, 0.1090087890625, 0.022003173828125, ...	embed
14601939_c1	14601939	haskell	1	1.1.0.1: using process-1.1.0.1 Dependency shakespeare ==1.0.3: using shakespeare-1.0.3 Dependency template-haskell ==2.8.0.0: using template-haskell-2.8.0.0 Dependency text ==0.11.2.3: using text-0.11.2.3 Dependency transformers ==0.2.2.0: using transformers-0.2.2.0 Using Cabal-1.16.0.3 compiled by ghc-7.0 Using compil...	2.1-59c8844d535e4a3bdd1569d60336e3b7 directory-1.1.0.2-ef4eca075618605e644c6184b111f96f filepath-1.3.0.0-954c43b4f109cbd4121f1231c14d5cff haskell-src-exts-1.13.5-3e91c3c2a4a723d046d79dc6b2b3a8bd pretty-1.1.1.0-867dcdeb02592f3d2a707618561c7b86 process-1.1.0.1-bd6d91995b2ae2680669549cb63f15b4 syb-0.3.7-a269c050536d4890f3...	[ -0.00897216796875, -0.01007080078125, 0.01324462890625, -0.00135040283203125, 0.02197265625, -0.00567626953125, -0.01806640625, -0.0096435546875, -0.00164031982421875, 0.02197265625, -0.004425048828125, -0.00714111328125, -0.0113525390625, 0.000530242919921875, 0.0086669921875, 0.01855...	[ 34513, 12975, 182332, 14364, 92134, 133684, 11435, 128405, 81046, 99929, 1556, 142508, 19437, 3355, 933, 72516, 28875, 102107, 9433, 102014, 110934, 10557, 82295, 27198, 1314, 92558, 154189, 162, 16665, 109524, 20600, 35782, 174450, 9217, 1046, 4...	[ 0.1103515625, 0.071533203125, 0.006500244140625, 0.09033203125, 0.061767578125, 0.1248779296875, 0.0491943359375, 0.09716796875, 0.0258331298828125, 0.04315185546875, 0.13916015625, 0.27001953125, 0.1317138671875, 0.041778564453125, 0.05035400390625, 0.098876953125, 0.17626953125, ...	embed
17503131_c1	17503131	haskell	1	unify these 2 cases? Did I overlook some tricks, or is this just a limitation for now? Are there other things that can be simplified? {-# LANGUAGE DataKinds #-} {-# LANGUAGE ExistentialQuantification #-} {-# LANGUAGE GADTs #-} {-# LANGUAGE PolyKinds #-} {-# LANGUAGE Rank2Types #-} {-# LANGUAGE StandaloneDeriving #-} {...	unify these 2 cases? Did I overlook some tricks, or is this just a limitation for now? Are there other things that can be simplified? {-# LANGUAGE DataKinds #-} {-# LANGUAGE ExistentialQuantification #-} {-# LANGUAGE GADTs #-} {-# LANGUAGE PolyKinds #-} {-# LANGUAGE Rank2Types #-} {-# LANGUAGE StandaloneDeriving #-} {...	[ 0.002471923828125, -0.01190185546875, 0.00946044921875, -0.000720977783203125, 0.01123046875, -0.0020294189453125, -0.0101318359375, -0.01220703125, 0.02099609375, -0.0174560546875, -0.00897216796875, -0.031005859375, -0.0026702880859375, -0.0020599365234375, -0.000640869140625, -0.021...	[ 51, 40383, 6097, 116, 50218, 645, 64747, 88308, 205969, 5036, 112892, 1029, 297, 3358, 98064, 75930, 11809, 605, 7250, 122688, 173495, 18, 41274, 23749, 41072, 63306, 134405, 304, 196707, 32487, 51684, 47731, 60457, 1191, 156823, 79912, 24750, ...	[ 0.1856689453125, 0.1558837890625, 0.0606689453125, 0.124267578125, 0.1820068359375, 0.015350341796875, 0.0787353515625, 0.138671875, 0.1636962890625, 0.012847900390625, 0.1446533203125, 0.0936279296875, 0.014434814453125, 0.04345703125, 0.16162109375, 0.10394287109375, 0.080932617187...	embed
8909997_c0	8909997	haskell	0	Title: Haskell: repeat a function a large number of times without stackoverflow Problem title: Haskell: repeat a function a large number of times without stackoverflow Tags: stack-overflow, haskell Problem: Haskell: repeat a function a large number of times without stackoverflow As a newbie to Haskell I am trying to it...	Haskell: repeat a function a large number of times without stackoverflow Haskell: repeat a function a large number of times without stackoverflow stack-overflow haskell Haskell Double n-1 Stack Use RTS Ksize Haskell: repeat a function a large number of times without stackoverflow As a newbie to Haskell I am trying to i...	[ -0.005859375, 0.005340576171875, 0.013427734375, -0.004547119140625, 0.001953125, -0.000675201416015625, -0.0101318359375, -0.0107421875, -0.00154876708984375, -0.0263671875, 0.01470947265625, -0.00238037109375, 0.00150299072265625, -0.0159912109375, 0.03564453125, 0.00982666015625, ...	[ 20625, 142508, 119140, 32354, 21334, 14012, 20028, 15490, 177261, 5465, 118664, 1556, 107172, 5759, 6512, 2594, 36836, 27389, 294, 341, 62539, 3525, 9014, 47, 31577, 17, 8560, 150535, 22288, 222530, 46876, 2806, 8781, 40956, 3564, 1257, 678, ...	[ 0.14404296875, 0.246826171875, 0.30078125, 0.205078125, 0.1094970703125, 0.1273193359375, 0.2120361328125, 0.13916015625, 0.1824951171875, 0.125244140625, 0.25390625, 0.078125, 0.06317138671875, 0.0977783203125, 0.112548828125, 0.07122802734375, 0.06683349609375, 0.107666015625, ...	embed
12292934_c1	12292934	haskell	1	2),(2,3,4),(3,4,3),(4,0,2)] -- Networking and command functions prepareSocket :: PortNumber -> IO Socket prepareSocket port = do sock' <- socket AF_INET Stream defaultProtocol let socketAddress = SockAddrInet port 0000 bindSocket sock' socketAddress listen sock' 1 putStrLn $ "Listening on " ++ (show port) return sock' ...	2),(2,3,4),(3,4,3),(4,0,2)] -- Networking and command functions prepareSocket :: PortNumber -> IO Socket prepareSocket port = do sock' <- socket AF_INET Stream defaultProtocol let socketAddress = SockAddrInet port 0000 bindSocket sock' socketAddress listen sock' 1 putStrLn $ "Listening on " ++ (show port) return sock' ...	[ -0.01123046875, 0.01336669921875, -0.005859375, 0.0107421875, 0.015625, 0.01708984375, -0.003692626953125, -0.0244140625, 0.01470947265625, -0.03466796875, 0.0034942626953125, 0.00579833984375, -0.005096435546875, -0.00750732421875, -0.0306396484375, 0.002410888671875, 0.003265380859...	[ 4958, 4, 54753, 82449, 247, 21320, 105801, 2389, 10461, 4210, 28997, 214, 136, 75101, 32354, 7, 114606, 8912, 27853, 1984, 13791, 18444, 26278, 33079, 17780, 1061, 11469, 54, 221, 2594, 25, 28211, 17777, 115061, 114977, 188, 8447, 2633, 161...	[ 0.169189453125, 0.034912109375, 0.03948974609375, 0.17138671875, 0.03021240234375, 0.1070556640625, 0.1175537109375, 0.093505859375, 0.06744384765625, 0.0994873046875, 0.1951904296875, 0.1170654296875, 0.1287841796875, 0.2626953125, 0.2012939453125, 0.001922607421875, 0.2342529296875...	embed
4115005_c0	4115005	haskell	0	Title: Cabal usage (Haskell) Problem title: Cabal usage (Haskell) Tags: installation, hackage, haskell, dependencies, cabal Problem: Cabal usage (Haskell) Cabal has dependency problems constantly . It's really tiring. So far I have tried to get many things working, here's my trying to install snap: $ sudo cabal install...	Cabal usage (Haskell) Cabal usage (Haskell) installation hackage haskell dependencies cabal Cabal Haskell Resolving ListLike-1.1.0 mtl-1.1.0.0 mtl-1.1.0.1 mtl-1.1.0.2 mtl-1.1.1.0 However mtl-2.0.0.0 monads-fd-0.1.0.3 PATH bin:$PATH Cabal usage (Haskell) Cabal has dependency problems constantly . It's really tiring. So ...	[ 0.004241943359375, 0.006500244140625, 0.0166015625, -0.00518798828125, 0.00084686279296875, -0.0186767578125, -0.0247802734375, 0.0107421875, 0, -0.0002040863037109375, -0.0079345703125, -0.037109375, -0.01007080078125, 0.004486083984375, 0.001312255859375, -0.005767822265625, 0.0072...	[ 30438, 289, 127689, 6495, 7, 142508, 59720, 85526, 4588, 1556, 42548, 109524, 20625, 132944, 32036, 156607, 5759, 102107, 18, 141, 92134, 99929, 102014, 133684, 33306, 347, 73011, 2667, 712, 420, 71, 170179, 436, 139909, 2394, 4369, 65135, 84...	[ 0.225830078125, 0.236083984375, 0.17236328125, 0.1427001953125, 0.09222412109375, 0.264404296875, 0.121826171875, 0.19287109375, 0.0149078369140625, 0.1494140625, 0.2291259765625, 0.322509765625, 0.172119140625, 0.1597900390625, 0.1766357421875, 0.270263671875, 0.00927734375, 0.113...	embed
66341939_c0	66341939	haskell	0	Title: Comparing the length of 2 lists in Haskell Problem title: Comparing the length of 2 lists in Haskell Tags: haskell, compare Problem: Comparing the length of 2 lists in Haskell im new to Haskell and currently making a few activities to test myself. The main reason i created this post is because im stuck in a situ...	Comparing the length of 2 lists in Haskell Comparing the length of 2 lists in Haskell haskell compare qualified Comparing Haskell Set.fromList Data.Set Set main::IO Comparing the length of 2 lists in Haskell im new to Haskell and currently making a few activities to test myself. The main reason i created this post is b...	[ -0.0101318359375, 0.01611328125, -0.00927734375, 0.0152587890625, 0.0006561279296875, -0.006439208984375, 0.015625, 0.01165771484375, 0.0135498046875, -0.0235595703125, -0.007171630859375, -0.001953125, 0.0267333984375, 0.00830078125, -0.003509521484375, -0.0107421875, 0.012084960937...	[ 113307, 140909, 116, 5303, 20625, 142508, 1556, 69101, 217225, 19943, 161063, 154663, 11809, 294, 126, 5201, 17780, 566, 3525, 69924, 3034, 35978, 179933, 16648, 7722, 86869, 3917, 81979, 26458, 54529, 3642, 5941, 119140, 892, 26255, 23, 195625...	[ 0.193359375, 0.17138671875, 0.142333984375, 0.2276611328125, 0.1436767578125, 0.1854248046875, 0.1329345703125, 0.181396484375, 0.1842041015625, 0.160888671875, 0.1416015625, 0.1845703125, 0.06640625, 0.049591064453125, 0.075439453125, 0.054351806640625, 0.1429443359375, 0.03976440...	embed
25102588_c0	25102588	haskell	0	Title: Lift a function and its argument to a different monadic context Problem title: Lift a function and its argument to a different monadic context Tags: monads, haskell Problem: Lift a function and its argument to a different monadic context I am not sure how to formulate this question scientifically exact, so I am ...	Lift a function and its argument to a different monadic context Lift a function and its argument to a different monadic context monads haskell Lift StateT Ptr MyState Storable Lift a function and its argument to a different monadic context I am not sure how to formulate this question scientifically exact, so I am just ...	[ -0.0048828125, 0.01336669921875, -0.002777099609375, 0.0167236328125, -0.0021820068359375, -0.0157470703125, -0.0185546875, -0.0181884765625, -0.0027313232421875, -0.0272216796875, 0.041748046875, 0.00136566162109375, 0.0033416748046875, 0.020751953125, 0.00482177734375, -0.01300048828...	[ 166562, 10, 32354, 10750, 47, 12921, 2667, 11, 18403, 43701, 136, 712, 1556, 142508, 22836, 618, 4448, 2646, 135206, 23604, 2886, 57456, 7639, 27781, 17368, 11341, 23, 27198, 56, 9626, 538, 17780, 187040, 41018, 3871, 4527, 24286, 408, 831,...	[ 0.271728515625, 0.0987548828125, 0.192626953125, 0.2259521484375, 0.07110595703125, 0.1031494140625, 0.0992431640625, 0.06298828125, 0.056182861328125, 0.180419921875, 0.005096435546875, 0.140625, 0.0972900390625, 0.21435546875, 0.1505126953125, 0.149169921875, 0.1075439453125, 0.0...	embed
69260338_c0	69260338	haskell	0	Title: Not in scope: type constructor or class ‘∼’ Problem title: Not in scope: type constructor or class ‘∼’ Tags: gadt, haskell, type-families Problem: Not in scope: type constructor or class ‘∼’ I'm trying to compile a code snippet from Maguire's Thinking with Types : {-# LANGUAGE TypeOperators #-} data Expr_ a = (a...	Not in scope: type constructor or class ‘∼’ Not in scope: type constructor or class ‘∼’ gadt haskell type-families Not LANGUAGE TypeOperators Expr_ LitInt_ Bool LitBool_ Add_ Not_ If_ TypeEquality.hs Compiling Main TypeEquality.hs:4:10 TypeEquality.hs:5:10 TypeEquality.hs:6:10 TypeEquality.hs:7:10 Failed Not in scope: ...	[ 0.0004749298095703125, 0.00025177001953125, -0.00186920166015625, 0.01104736328125, 0.001190185546875, -0.0019073486328125, -0.007598876953125, 0.002777099609375, -0.02001953125, -0.01409912109375, -0.005828857421875, -0.00738525390625, 0.0164794921875, -0.01544189453125, 0.019775390625,...	[ 11205, 23, 70820, 10644, 64549, 748, 707, 18507, 166406, 914, 13384, 1556, 142508, 69128, 98064, 60457, 156823, 22230, 27668, 4153, 929, 12647, 29117, 4263, 161789, 127, 15612, 12321, 647, 617, 15110, 758, 190355, 9969, 1340, 18151, 93, 58134...	[ 0.1802978515625, 0.139404296875, 0.180908203125, 0.2236328125, 0.178955078125, 0.117919921875, 0.05279541015625, 0.1754150390625, 0.15576171875, 0.053436279296875, 0.1195068359375, 0.1163330078125, 0.206298828125, 0.0845947265625, 0.06414794921875, 0.2088623046875, 0.1173095703125, ...	embed
11128759_c0	11128759	haskell	0	Title: Beautiful and terrible Haskell Problem title: Beautiful and terrible Haskell Tags: functional-programming, haskell Problem: Beautiful and terrible Haskell Haskell is beautiful. That's a fact. It's concise, fast etc. Many of you will admit that writing in it is a great pleasure. On the other hand I think that its...	Beautiful and terrible Haskell Beautiful and terrible Haskell functional-programming haskell Beautiful Haskell Map Map.toList Map.fromListWith Map.filterWithKey Map.unions List.map Map.elems Beautiful and terrible Haskell Haskell is beautiful. That's a fact. It's concise, fast etc. Many of you will admit that writing i...	[ 0.0025482177734375, 0.01202392578125, 0.00933837890625, -0.01068115234375, 0.002716064453125, -0.01348876953125, 0.008544921875, -0.0218505859375, 0.01129150390625, -0.03271484375, -0.01220703125, 0.0029754638671875, 0.00616455078125, 0.0198974609375, -0.00799560546875, -0.002075195312...	[ 168941, 136, 94176, 20625, 142508, 123309, 28966, 1556, 42719, 188, 154663, 161063, 194583, 120337, 162429, 87046, 32036, 62346, 27889, 83, 34923, 15824, 1650, 158, 318, 4271, 3021, 52455, 36456, 32562, 23, 442, 6782, 147643, 5351, 6863, 7432, ...	[ 0.267578125, 0.1397705078125, 0.27392578125, 0.1978759765625, 0.322021484375, 0.1217041015625, 0.1201171875, 0.18408203125, 0.181396484375, 0.0889892578125, 0.1558837890625, 0.0872802734375, 0.115478515625, 0.15234375, 0.1107177734375, 0.110595703125, 0.1268310546875, 0.1396484375,...	embed
50092681_c0	50092681	haskell	0	Title: In Haskell, is it correct measuring performance using a timestamp obtained at the beginning and in the end of a function execution? Problem title: In Haskell, is it correct measuring performance using a timestamp obtained at the beginning and in the end of a function execution? Tags: performance, haskell Problem...	In Haskell, is it correct measuring performance using a timestamp obtained at the beginning and in the end of a function execution? In Haskell, is it correct measuring performance using a timestamp obtained at the beginning and in the end of a function execution? performance haskell a Data.Time.Clock Haskell UTCTime In...	[ -0.013427734375, 0.015380859375, 0.0147705078125, -0.00994873046875, 0.0081787109375, -0.021484375, -0.02197265625, 0.001190185546875, 0.0021820068359375, -0.0673828125, 0.0185546875, 0.002716064453125, 0.0059814453125, -0.000020384788513183594, 0.0006256103515625, -0.00174713134765625...	[ 20625, 142508, 26785, 163, 162, 23718, 17368, 1733, 590, 2676, 113054, 86595, 136, 3564, 32354, 71924, 53089, 1556, 11809, 70059, 21135, 99577, 360, 72350, 133244, 20028, 2537, 6423, 2046, 474, 15724, 30646, 21, 3285, 7432, 52490, 3444, 30098...	[ 0.1240234375, 0.2476806640625, 0.1787109375, 0.13427734375, 0.183837890625, 0.2239990234375, 0.05377197265625, 0.1116943359375, 0.1719970703125, 0.176025390625, 0.0635986328125, 0.1236572265625, 0.055206298828125, 0.1148681640625, 0.14599609375, 0.100830078125, 0.05828857421875, 0....	embed
29454528_c0	29454528	haskell	0	Title: What does GADT offer that cannot be done with OOP and generics? Problem title: What does GADT offer that cannot be done with OOP and generics? Tags: type-theory, ocaml, gadt, generics, haskell Problem: What does GADT offer that cannot be done with OOP and generics? Are GADTs in functional languages equivalent to...	What does GADT offer that cannot be done with OOP and generics? What does GADT offer that cannot be done with OOP and generics? type-theory ocaml gadt generics haskell What GADT OOP Expr Suc IsZero Bool Integer Override prev.eval What does GADT offer that cannot be done with OOP and generics? Are GADTs in functional la...	[ -0.0031585693359375, 0.0052490234375, 0.01226806640625, -0.00555419921875, 0.024169921875, -0.01055908203125, -0.00180816650390625, -0.002655029296875, 0.004119873046875, -0.0361328125, -0.0196533203125, -0.0322265625, -0.01397705078125, -0.013671875, -0.00469970703125, -0.004638671875...	[ 4865, 23749, 41072, 18645, 53418, 16940, 678, 180, 20880, 189534, 7, 10644, 2347, 30675, 36, 9779, 141, 914, 13384, 1556, 142508, 60075, 42, 103544, 2071, 1511, 4036, 2460, 929, 44401, 9578, 416, 28468, 1405, 136, 123309, 46876, 183234, 891...	[ 0.020263671875, 0.1636962890625, 0.251953125, 0.1092529296875, 0.1165771484375, 0.05621337890625, 0.04119873046875, 0.07177734375, 0.21826171875, 0.216796875, 0.037109375, 0.1519775390625, 0.095947265625, 0.026702880859375, 0.044586181640625, 0.0587158203125, 0.0631103515625, 0.125...	embed
49050900_c0	49050900	haskell	0	Title: How to optimize the speed of a numerical library in Haskell Problem title: How to optimize the speed of a numerical library in Haskell Tags: performance, optimization, haskell Problem: How to optimize the speed of a numerical library in Haskell I have released a small numerical library for solving delay differen...	How to optimize the speed of a numerical library in Haskell How to optimize the speed of a numerical library in Haskell performance optimization haskell How Haskell State _state V.Vector Double UNPACK How to optimize the speed of a numerical library in Haskell I have released a small numerical library for solving delay...	[ -0.010498046875, 0.00811767578125, -0.00156402587890625, 0.01416015625, -0.01348876953125, 0.005126953125, -0.01513671875, -0.020263671875, 0.0019989013671875, -0.01470947265625, -0.01324462890625, -0.028076171875, -0.00022220611572265625, 0.00982666015625, -0.0206298828125, -0.0074768...	[ 11249, 15572, 20650, 38352, 54744, 6827, 35773, 1294, 20625, 142508, 23, 23718, 87235, 1556, 22836, 101, 61340, 310, 26455, 18770, 107172, 8274, 98701, 605, 121447, 19336, 3115, 8, 5259, 99710, 13722, 32102, 47327, 112, 38170, 19915, 5201, 12...	[ 0.04168701171875, 0.1849365234375, 0.054412841796875, 0.2105712890625, 0.177978515625, 0.0655517578125, 0.234130859375, 0.1475830078125, 0.161376953125, 0.251708984375, 0.0062255859375, 0.1339111328125, 0.1796875, 0.1341552734375, 0.146240234375, 0.001861572265625, 0.1331787109375, ...	embed
13546872_c0	13546872	haskell	0	Title: Primitive Recursive functions Problem title: Primitive Recursive functions Tags: recursion, haskell Problem: Primitive Recursive functions I'm trying to define some basic Primitive Recursive functions in Haskell. Why is my times function recursing one too many times (ie eval times[x,y] is resulting in (x+1)*y )?...	Primitive Recursive functions Primitive Recursive functions recursion haskell Prelude Primitive Recursive Show Integer x:xs x-1 x:_ _:xs n-1 Primitive Recursive functions I'm trying to define some basic Primitive Recursive functions in Haskell. Why is my times function recursing one too many times (ie eval times[x,y] i...	[ -0.024169921875, 0.0267333984375, 0.021484375, 0.01019287109375, 0.0198974609375, 0.0191650390625, 0.003753662109375, -0.0164794921875, 0.0089111328125, -0.0361328125, -0.00469970703125, -0.01953125, -0.01190185546875, 0.013671875, -0.007568359375, 0.01007080078125, 0.00811767578125,...	[ 44506, 14, 4935, 853, 48650, 5844, 32354, 195625, 1830, 1556, 142508, 1914, 822, 17367, 44401, 1022, 425, 7, 5759, 61924, 62822, 20625, 44084, 83, 20028, 214, 1632, 5792, 5941, 1405, 53, 16750, 21748, 1639, 2967, 70425, 100094, 3288, 40322,...	[ 0.1549072265625, 0.0732421875, 0.1119384765625, 0.0860595703125, 0.201904296875, 0.092041015625, 0.161376953125, 0.243408203125, 0.0057373046875, 0.1180419921875, 0.23681640625, 0.0704345703125, 0.153076171875, 0.0986328125, 0.1336669921875, 0.03125, 0.055877685546875, 0.0134582519...	embed

56419201_c1

56419201

haskell

1

"items" <*> recentlyPlayed .: "next" instance FromJSON Tracks where parseJSON = withArray "items" $ \items -> Tracks <$> mapM parseJSON (V.toList items) instance FromJSON Artist where parseJSON = withObject "artists" $ \artists -> Artist <$> artists .: "id" <*> artists .: "href" <*> artists .: "name" marshallRecentlyP...

[ -0.0262451171875, 0.01263427734375, -0.0115966796875, -0.005645751953125, 0.00179290771484375, 0.02099609375, -0.007232666015625, -0.0166015625, -0.01416015625, -0.0245361328125, 0.01324462890625, -0.0181884765625, -0.004302978515625, -0.006805419921875, -0.0166015625, 0.0172119140625,...

[ 1486, 4432, 1639, 78684, 97054, 297, 5, 12, 86, 29062, 110527, 28090, 1375, 58627, 69182, 366, 184, 678, 7614, 7092, 58, 3650, 6, 7, 4369, 2740, 22288, 594, 856, 188, 154663, 55769, 69891, 2203, 75161, 3960, 64370, 4426, 22104, 44, 532,...

[ 0.1708984375, 0.1416015625, 0.005096435546875, 0.2325439453125, 0.2335205078125, 0.1165771484375, 0.0164642333984375, 0.008056640625, 0.044097900390625, 0.12939453125, 0.181396484375, 0.1712646484375, 0.1241455078125, 0.199462890625, 0.220458984375, 0.1373291015625, 0.06268310546875,...

embed

5223498_c1

5223498

haskell

1

it should be Unboxed (immutable) [edit] never mind this Lazy Unbounded O(1) time to construct O(1) time complexity for looking up a given entry, (more realistically, at worst O(log n) , where n is i*j for looking up the entry at row i, column j) Bonus points if you can explain why/how your solution satisfies these ide...

[ 0.0026092529296875, 0.025634765625, 0.00823974609375, -0.0016632080078125, -0.010009765625, 0.0026702880859375, 0.01385498046875, 0.01300048828125, 0.0169677734375, 0.01104736328125, 0.01416015625, -0.00022792816162109375, -0.00848388671875, 0.0218505859375, 0.00095367431640625, 0.0317...

[ 442, 5608, 186, 992, 11728, 297, 561, 22819, 45082, 7086, 239, 3285, 99091, 180, 27750, 1733, 64549, 27140, 16487, 1257, 34475, 42805, 61207, 130481, 4867, 170, 15555, 17, 3365, 316, 1647, 38663, 26847, 73342, 15400, 29806, 40407, 6397, 939...

[ 0.0565185546875, 0.12060546875, 0.048248291015625, 0.0941162109375, 0.23193359375, 0.0911865234375, 0.1287841796875, 0.1376953125, 0.0197601318359375, 0.05194091796875, 0.03411865234375, 0.1236572265625, 0.188232421875, 0.11376953125, 0.062744140625, 0.11474609375, 0.1307373046875, ...

embed

71036903_c0

71036903

haskell

0

Title: How to check if next element in a list is greater than the previous in Haskell? Problem title: How to check if next element in a list is greater than the previous in Haskell? Tags: haskell, list, functional-programming Problem: How to check if next element in a list is greater than the previous in Haskell? (I am...

How to check if next element in a list is greater than the previous in Haskell? How to check if next element in a list is greater than the previous in Haskell? haskell list functional-programming How Haskell How to check if next element in a list is greater than the previous in Haskell? (I am currently doing an online ...

[ -0.0024566650390625, 0.0235595703125, 0.005279541015625, 0.00799560546875, -0.007537841796875, 0.013671875, 0.010986328125, -0.005279541015625, 0.01483154296875, 0.0023651123046875, 0.007232666015625, 0.01287841796875, -0.006805419921875, -0.00433349609375, -0.01470947265625, 0.0073547...

[ 11249, 47, 12765, 2174, 11737, 12830, 23, 5303, 83, 117396, 3501, 96362, 20625, 142508, 1556, 123309, 28966, 1118, 15411, 81979, 172337, 63134, 137565, 10336, 222530, 46876, 40956, 206597, 33022, 32354, 29598, 91127, 46429, 1984, 18, 33079, 415...

[ 0.05096435546875, 0.04425048828125, 0.2275390625, 0.1121826171875, 0.2109375, 0.1956787109375, 0.0679931640625, 0.206298828125, 0.10516357421875, 0.2484130859375, 0.148193359375, 0.1396484375, 0.1263427734375, 0.2178955078125, 0.0791015625, 0.0775146484375, 0.002166748046875, 0.027...

embed

58276032_c0

58276032

haskell

0

Title: Trying to understand types in haskell library fused-effects Problem title: Trying to understand types in haskell library fused-effects Tags: compiler-errors, haskell Problem: Trying to understand types in haskell library fused-effects I am trying to understand hmap. module Main where import Control.Effect.Fresh ...

Trying to understand types in haskell library fused-effects Trying to understand types in haskell library fused-effects compiler-errors haskell Control.Effect.Fresh Control.Effect.Carrier Trying Main Fresh Maybe Just Couldn Main.hs:16:5-10 Expected Actual Functor Trying to understand types in haskell library fused-effe...

[ 0.00341796875, 0.005035400390625, 0.00830078125, 0.0166015625, -0.0140380859375, 0.01092529296875, 0.00396728515625, 0.006103515625, 0.00897216796875, -0.0111083984375, -0.00775146484375, -0.0361328125, 0.004180908203125, 0.000949859619140625, -0.01116943359375, -0.0208740234375, -0....

[ 40858, 28219, 52895, 1556, 142508, 35773, 57574, 297, 171760, 9969, 34759, 188800, 27131, 120482, 17928, 105027, 21851, 25388, 12321, 133540, 83425, 9563, 191147, 127, 22354, 758, 9193, 60075, 13, 100582, 28670, 18770, 31577, 1096, 62346, 31380, ...

[ 0.060302734375, 0.1102294921875, 0.2144775390625, 0.138427734375, 0.2017822265625, 0.1220703125, 0.177978515625, 0.1143798828125, 0.235595703125, 0.1002197265625, 0.09735107421875, 0.16455078125, 0.1402587890625, 0.0931396484375, 0.147216796875, 0.12841796875, 0.039337158203125, 0....

embed

37219566_c0

37219566

haskell

0

Title: Type-Level Peano Numbers and UndecidableInstances Problem title: Type-Level Peano Numbers and UndecidableInstances Tags: type-level-computation, haskell Problem: Type-Level Peano Numbers and UndecidableInstances Following this tutorial , I have the following code: {-# LANGUAGE DataKinds, TypeFamilies #-} data Na...

Type-Level Peano Numbers and UndecidableInstances Type-Level Peano Numbers and UndecidableInstances type-level-computation haskell Type-Level Peano Numbers UndecidableInstances LANGUAGE DataKinds TypeFamilies Nat Plus Mul Nested Use Type-Level Peano Numbers and UndecidableInstances Following this tutorial , I have the ...

[ -0.010498046875, 0.01336669921875, 0.004241943359375, 0.005096435546875, 0.001495361328125, 0.006927490234375, 0.0029754638671875, -0.009033203125, 0.001373291015625, -0.0174560546875, 0.00335693359375, -0.03125, 0.02587890625, 0.0255126953125, 0.00537109375, 0.004119873046875, 0.024...

[ 60457, 5267, 2601, 1460, 3922, 103332, 136, 79912, 24750, 2661, 116071, 10644, 67919, 7077, 1556, 142508, 98064, 11809, 605, 7250, 919, 1191, 68875, 8183, 21442, 28701, 36836, 57143, 25632, 18151, 1061, 2060, 221, 4127, 3714, 7, 1809, 82641, ...

[ 0.254150390625, 0.1207275390625, 0.176025390625, 0.1466064453125, 0.2166748046875, 0.1644287109375, 0.0267333984375, 0.10260009765625, 0.2457275390625, 0.252197265625, 0.14306640625, 0.2061767578125, 0.25537109375, 0.0526123046875, 0.07073974609375, 0.196533203125, 0.0709228515625, ...

embed

20190722_c0

20190722

haskell

0

Title: Using lenses to operate on inner monad in StateT Problem title: Using lenses to operate on inner monad in StateT Tags: haskell, haskell-lens Problem: Using lenses to operate on inner monad in StateT Pleease see the use of liftIO in the function increment below. I have a hunch that there's a better way to handle ...

Using lenses to operate on inner monad in StateT Using lenses to operate on inner monad in StateT haskell haskell-lens Control.Lens Control.Monad.IO.Class Control.Monad.State Using StateT LANGUAGE TemplateHaskell PersistentCounter _cValue _cFilename FilePath Show zoom2 Invoke Monad Using lenses to operate on inner mona...

[ -0.02587890625, 0.01007080078125, -0.0191650390625, 0.023193359375, 0.0137939453125, 0.014404296875, -0.000682830810546875, -0.0123291015625, -0.0274658203125, -0.0277099609375, 0.0115966796875, 0.032958984375, -0.0054931640625, 0.01446533203125, 0.0269775390625, -0.0023956298828125, ...

[ 345, 96, 47754, 160404, 98, 75414, 2667, 712, 22836, 618, 47, 1556, 142508, 1977, 27131, 866, 1755, 46674, 17780, 140803, 135206, 98064, 196631, 6495, 7, 57309, 2581, 108210, 856, 174350, 42724, 683, 10519, 17367, 111245, 304, 23253, 60331, ...

[ 0.0655517578125, 0.167236328125, 0.2117919921875, 0.17724609375, 0.08349609375, 0.2015380859375, 0.136962890625, 0.1724853515625, 0.1685791015625, 0.1865234375, 0.002471923828125, 0.1085205078125, 0.216064453125, 0.15283203125, 0.1378173828125, 0.0643310546875, 0.13427734375, 0.048...

embed

23846844_c0

23846844

haskell

0

Title: Determine the effect of a function by its type Problem title: Determine the effect of a function by its type Tags: type-theory, hindley-milner, haskell Problem: Determine the effect of a function by its type One of the interesting properties of Haskell's type system (*) is that sometimes you can tell exactly wha...

Determine the effect of a function by its type Determine the effect of a function by its type type-theory hindley-milner haskell Determine Num Determine the effect of a function by its type One of the interesting properties of Haskell's type system (*) is that sometimes you can tell exactly what the function does based...

[ 0.01226806640625, -0.00738525390625, -0.0057373046875, 0.0242919921875, 0.003692626953125, 0.01409912109375, -0.006805419921875, 0.0162353515625, -0.000518798828125, -0.0040283203125, -0.0213623046875, -0.023193359375, -0.02001953125, 0.000051021575927734375, 0.004058837890625, 0.00540...

[ 262, 30524, 21543, 32354, 390, 6863, 10644, 2347, 34866, 4293, 12397, 1679, 1556, 142508, 52782, 49041, 183871, 20625, 5426, 68018, 831, 14192, 66161, 2367, 14602, 35509, 4734, 138256, 115840, 17780, 43334, 49846, 678, 10, 33079, 8110, 182324, ...

[ 0.0863037109375, 0.1937255859375, 0.25439453125, 0.212158203125, 0.113037109375, 0.0789794921875, 0.2646484375, 0.043487548828125, 0.0684814453125, 0.1531982421875, 0.0748291015625, 0.1085205078125, 0.1103515625, 0.2529296875, 0.1845703125, 0.0982666015625, 0.087890625, 0.120117187...

embed

38050674_c1

38050674

haskell

1

_ps1 c iout = do --out <- liftIO iout let out_count = c 0 let prompt = (getPrompt out_count iout) :: IO String outputStrLn $ liftIO prompt outputStrLn "" getPrompt :: IO Int -> IO String -> IO String getPrompt ion iout = do n <- ion out <- iout return $ "Out[" ++ (show n) ++ "]: " ++ out handle_cmd :: String -> IO Stri...

[ -0.0157470703125, -0.0108642578125, -0.02001953125, 0.029052734375, 0.01007080078125, 0.01446533203125, 0.0252685546875, 0.00811767578125, 0.0147705078125, -0.045654296875, -0.0179443359375, -0.0034027099609375, 0.008056640625, 0.0052490234375, -0.01153564453125, 0.017822265625, -0.0...

[ 101, 6423, 418, 501, 17, 6056, 2203, 54, 4210, 9, 60520, 17780, 2633, 1810, 71013, 757, 105876, 3794, 10752, 2676, 1984, 23351, 214, 140992, 71713, 3650, 2046, 360, 18, 45339, 653, 30646, 79858, 37223, 31374, 34831, 3931, 71, 13315, 2174,...

[ 0.0751953125, 0.20458984375, 0.171630859375, 0.090087890625, 0.1357421875, 0.2685546875, 0.04931640625, 0.114013671875, 0.0738525390625, 0.00738525390625, 0.2449951171875, 0.2384033203125, 0.1898193359375, 0.2303466796875, 0.1968994140625, 0.091064453125, 0.245849609375, 0.09930419...

embed

20713027_c0

20713027

haskell

0

Title: Data.Text vs. Rope Problem title: Data.Text vs. Rope Tags: haskell Problem: Data.Text vs. Rope I've been looking into ropes as an alternative to Data.Text, and I like what I see so much that I am now forced to ask this question.... Is there any case where Data.Text would be the better choice? Here are the points...

Data.Text vs. Rope Data.Text vs. Rope haskell Data.Text Rope Data.Text vs. Rope I've been looking into ropes as an alternative to Data.Text, and I like what I see so much that I am now forced to ask this question.... Is there any case where Data.Text would be the better choice? Here are the points that lead me to this ...

[ 0.0191650390625, -0.0031280517578125, 0.0040283203125, 0.022216796875, -0.0096435546875, -0.003204345703125, 0.0111083984375, -0.00885009765625, 0.006744384765625, -0.003814697265625, 0.006103515625, -0.012939453125, 0.006744384765625, -0.00445556640625, -0.00058746337890625, 0.0033721...

[ 11809, 5, 174379, 20209, 2777, 1081, 1556, 142508, 16487, 87850, 90, 30700, 4, 1884, 87, 1957, 5045, 7225, 2806, 186, 70, 11522, 44126, 15390, 444, 98, 111, 11001, 95, 2407, 110, 112, 131803, 70796, 538, 83, 289, 840, 18, 16, 5701, 13...

[ 0.222412109375, 0.08758544921875, 0.324462890625, 0.1712646484375, 0.202392578125, 0.205322265625, 0.1336669921875, 0.239501953125, 0.00347900390625, 0.2213134765625, 0.18310546875, 0.13916015625, 0.00567626953125, 0.11181640625, 0.005584716796875, 0.035614013671875, 0.00808715820312...

embed

44317409_c0

44317409

haskell

0

Title: Throwing away element in index,element tuples Problem title: Throwing away element in index,element tuples Tags: list-comprehension, list, enumerate, haskell Problem: Throwing away element in index,element tuples New to Haskell, and trying to construct an [[(Int, Int)]] where each element is its corresponding gr...

Throwing away element in index,element tuples Throwing away element in index,element tuples list-comprehension list enumerate haskell Throwing board-1 Throwing away element in index,element tuples New to Haskell, and trying to construct an [[(Int, Int)]] where each element is its corresponding grid position, constructe...

[ -0.0260009765625, 0.012451171875, -0.01373291015625, -0.00823974609375, -0.02099609375, -0.004180908203125, 0.006622314453125, 0.01025390625, -0.007415771484375, -0.003814697265625, 0.01019287109375, -0.00689697265625, 0.0012359619140625, -0.00174713134765625, -0.023681640625, -0.01354...

[ 6003, 15555, 16065, 12830, 63262, 62766, 370, 99726, 23, 5303, 4692, 3220, 189085, 67, 1556, 142508, 45443, 5759, 20625, 31577, 64549, 4153, 18, 360, 12638, 42518, 120067, 19069, 11, 108047, 5609, 140909, 138, 2806, 28282, 22288, 62346, 32354...

[ 0.027740478515625, 0.1368408203125, 0.1851806640625, 0.182861328125, 0.1727294921875, 0.154052734375, 0.09698486328125, 0.179931640625, 0.0498046875, 0.0736083984375, 0.0157928466796875, 0.0197601318359375, 0.152099609375, 0.087158203125, 0.1015625, 0.229736328125, 0.1497802734375, ...

embed

59849397_c0

59849397

haskell

0

Title: Spawning a new shell process as a member of another ProcessGroup (Haskell) Problem title: Spawning a new shell process as a member of another ProcessGroup (Haskell) Tags: haskell Problem: Spawning a new shell process as a member of another ProcessGroup (Haskell) Problem. I am trying spawn a new shell process, an...

Spawning a new shell process as a member of another ProcessGroup (Haskell) Spawning a new shell process as a member of another ProcessGroup (Haskell) haskell System.Process Data.Int Spawning ProcessGroup Haskell ProcessGroupID FilePath Maybe ProcessID CPid Int32 Nothing Operation Spawning a new shell process as a membe...

[ 0.007110595703125, 0.0235595703125, -0.0322265625, 0.0162353515625, -0.00408935546875, -0.00007963180541992188, -0.00933837890625, -0.0120849609375, -0.00101470947265625, -0.01397705078125, 0.01483154296875, 0.0216064453125, -0.0106201171875, 0.0257568359375, -0.0230712890625, 0.021362...

[ 10959, 434, 592, 3525, 128019, 9433, 237, 32786, 15700, 123996, 205072, 6495, 7, 142508, 1556, 12353, 10752, 26531, 11809, 4153, 18, 20625, 7146, 42724, 10519, 83425, 532, 6460, 182747, 102203, 15649, 31577, 5623, 7710, 100, 144573, 21115, 21...

[ 0.192626953125, 0.1531982421875, 0.04766845703125, 0.13671875, 0.1953125, 0.199462890625, 0.057342529296875, 0.1361083984375, 0.117919921875, 0.11181640625, 0.192138671875, 0.0833740234375, 0.0628662109375, 0.242431640625, 0.09759521484375, 0.0810546875, 0.056243896484375, 0.127075...

embed

24979448_c0

24979448

haskell

0

Title: Memory exploding upon writing a lazy bytestring to file in ghci Problem title: Memory exploding upon writing a lazy bytestring to file in ghci Tags: memory-leaks, ghci, lazy-loading, lazy-evaluation, haskell Problem: Memory exploding upon writing a lazy bytestring to file in ghci The following program does not e...

Memory exploding upon writing a lazy bytestring to file in ghci Memory exploding upon writing a lazy bytestring to file in ghci memory-leaks ghci lazy-loading lazy-evaluation haskell Data.Int qualified Memory Explode.hs Does Explodes Main Data.ByteString.Lazy Data.ByteString.Lazy.Char8 BLC Int64 BL.ByteString BL.take B...

[ 0.0133056640625, 0.0048828125, -0.0167236328125, 0.0174560546875, -0.008056640625, 0.005859375, 0.003997802734375, -0.0023345947265625, 0.0201416015625, 0.003631591796875, 0.0020904541015625, 0.00130462646484375, 0.01458740234375, 0.0164794921875, 0.01422119140625, 0.028076171875, 0....

[ 172681, 24649, 6238, 54799, 32562, 21, 3285, 390, 67, 91693, 47, 11435, 31380, 318, 23, 98323, 133, 24251, 63033, 159258, 1556, 142508, 11809, 4153, 18, 217225, 98873, 112, 127, 7, 101790, 988, 12321, 75358, 71713, 2729, 84068, 1019, 26943,...

[ 0.216796875, 0.24560546875, 0.0897216796875, 0.07373046875, 0.175537109375, 0.1138916015625, 0.1650390625, 0.0703125, 0.088623046875, 0.1859130859375, 0.0228118896484375, 0.14697265625, 0.117919921875, 0.164306640625, 0.08697509765625, 0.150634765625, 0.115966796875, 0.010955810546...

embed

56641366_c0

56641366

haskell

0

Title: Why provide the `HasCallStack` mechanism since we already have `ghc -prof -fprof-auto-top` in GHC? Problem title: Why provide the `HasCallStack` mechanism since we already have `ghc -prof -fprof-auto-top` in GHC? Tags: callstack, haskell, ghc Problem: Why provide the `HasCallStack` mechanism since we already hav...

Why provide the `HasCallStack` mechanism since we already have `ghc -prof -fprof-auto-top` in GHC? Why provide the `HasCallStack` mechanism since we already have `ghc -prof -fprof-auto-top` in GHC? callstack haskell ghc GHC.Stack base the HasCallStack -prof Why GHC call-stack-cut-off.hs CallStack call-stack-cut-off.hs:...

[ 0.00885009765625, 0.0169677734375, 0.0040283203125, 0.00634765625, -0.000667572021484375, -0.00787353515625, -0.01239013671875, -0.018310546875, 0.00016880035400390625, -0.028076171875, 0.0042724609375, -0.0013580322265625, 0.00115966796875, 0.01220703125, 0.01806640625, -0.01843261718...

[ 44084, 22691, 6495, 7, 441, 5584, 42378, 2594, 191619, 21771, 9486, 238, 20, 3454, 420, 8913, 13784, 527, 73265, 765, 11782, 590, 1556, 142508, 31380, 3647, 20625, 19774, 16713, 127, 26265, 758, 29223, 5201, 168793, 1126, 15110, 19777, 6048...

[ 0.114013671875, 0.1104736328125, 0.145263671875, 0.0748291015625, 0.14404296875, 0.1708984375, 0.2322998046875, 0.179443359375, 0.1953125, 0.09765625, 0.077392578125, 0.0927734375, 0.00933837890625, 0.1072998046875, 0.12353515625, 0.11962890625, 0.1597900390625, 0.1114501953125, ...

embed

33774433_c0

33774433

haskell

0

Title: Sequential circuit with feedack loop in Haskell Problem title: Sequential circuit with feedack loop in Haskell Tags: loops, feedback, sequential, circuit, haskell Problem: Sequential circuit with feedack loop in Haskell I would like to represent a circuit with the following behaviour in Haskell: The circuit has ...

Sequential circuit with feedack loop in Haskell Sequential circuit with feedack loop in Haskell loops feedback sequential circuit haskell Sequential Haskell Signal Input Output State Switch Bool i:is True:bs False:bs Sequential circuit with feedack loop in Haskell I would like to represent a circuit with the following ...

[ 0.006378173828125, 0.0179443359375, -0.0130615234375, 0.01324462890625, 0.004364013671875, -0.0093994140625, 0.00604248046875, 0.005279541015625, 0.0034942626953125, -0.0284423828125, 0.01055908203125, -0.018310546875, -0.0213623046875, 0.03466796875, 0.0022125244140625, -0.00964355468...

[ 503, 5490, 80973, 61404, 678, 61590, 11, 2594, 40956, 20625, 142508, 58269, 243228, 1556, 144000, 360, 13538, 22836, 106101, 2460, 929, 164, 87599, 16145, 22225, 23, 1884, 33636, 25632, 224833, 6626, 107730, 2053, 101089, 1632, 140992, 14847, ...

[ 0.04278564453125, 0.1285400390625, 0.08538818359375, 0.2088623046875, 0.032470703125, 0.1568603515625, 0.1143798828125, 0.17333984375, 0.20703125, 0.145263671875, 0.2481689453125, 0.24365234375, 0.1868896484375, 0.118408203125, 0.150634765625, 0.06353759765625, 0.08984375, 0.139282...

embed

36979508_c0

36979508

haskell

0

Title: Haskell Function not loading Problem title: Haskell Function not loading Tags: haskell Problem: Haskell Function not loading I have started haskell two day ago using learn you a haskell, but struck in the second chapter. I saved a function as baby.hs (no .txt , I checked in info) and according to the book, the f...

Haskell Function not loading Haskell Function not loading haskell Haskell baby.hs Compiling Main baby.hs:1:7 Failed Mayanks-MBP:Documents rtf1 ansicpg1252 cocoartf1404 cocoasubrtf460 fcharset0 Helvetica red255 green255 blue255 paperw11900 paperh16840 margl1440 margr1440 vieww10800 viewh8400 viewkind0 tx566 tx1133 tx170...

[ 0.00872802734375, 0.01019287109375, 0.00144195556640625, -0.00799560546875, 0.00665283203125, 0.02587890625, -0.006866455078125, 0.0026092529296875, -0.0036163330078125, -0.0302734375, -0.015625, -0.01953125, -0.00112152099609375, -0.037109375, 0.02197265625, -0.004791259765625, -0.0...

[ 20625, 142508, 28670, 959, 72367, 214, 1556, 15546, 127, 15612, 12321, 7, 966, 190355, 4347, 66, 1224, 12689, 683, 239469, 420, 68992, 7709, 158332, 10440, 7636, 4842, 135455, 50997, 57571, 15122, 45076, 21455, 68347, 2831, 22553, 144810, 235...

[ 0.1553955078125, 0.26708984375, 0.1832275390625, 0.1651611328125, 0.2227783203125, 0.07080078125, 0.154296875, 0.2177734375, 0.1297607421875, 0.04083251953125, 0.0477294921875, 0.080078125, 0.01690673828125, 0.117431640625, 0.0916748046875, 0.00653076171875, 0.030609130859375, 0.00...

embed

50013110_c0

50013110

haskell

0

Title: how to avoid messy codes when outputting Chinese characters Problem title: how to avoid messy codes when outputting Chinese characters Tags: encode, haskell, string, windows Problem: how to avoid messy codes when outputting Chinese characters I've found a strange problem about writing Chinese characters into a f...

how to avoid messy codes when outputting Chinese characters how to avoid messy codes when outputting Chinese characters encode haskell string windows Chinese r.txt how to avoid messy codes when outputting Chinese characters I've found a strange problem about writing Chinese characters into a file by writeFile . Then th...

[ 0.024658203125, 0.000476837158203125, 0.005889892578125, -0.002044677734375, -0.006988525390625, -0.006439208984375, 0.006805419921875, 0.0022430419921875, -0.00107574462890625, 0.03369140625, -0.00518798828125, -0.017822265625, 0.0294189453125, 0.0126953125, -0.01141357421875, -0.0013...

[ 3642, 71864, 163, 46048, 18151, 140992, 76438, 124850, 22, 40899, 1556, 142508, 79315, 54825, 1690, 124326, 1916, 114453, 2967, 32562, 3934, 11435, 33022, 174350, 44116, 3638, 36917, 31255, 25842, 42, 11196, 3074, 15400, 44084, 155148, 8779, 94...

[ 0.0287017822265625, 0.1866455078125, 0.180419921875, 0.197998046875, 0.1907958984375, 0.1544189453125, 0.1859130859375, 0.1553955078125, 0.033477783203125, 0.0963134765625, 0.06982421875, 0.1617431640625, 0.07110595703125, 0.088623046875, 0.06866455078125, 0.15771484375, 0.0047607421...

embed

43155806_c0

43155806

haskell

0

Title: Mutable modifications of a Vector using ST Problem title: Mutable modifications of a Vector using ST Tags: haskell Problem: Mutable modifications of a Vector using ST I have been going through a School of Haskell tutorial on "modify and the ST monad". The question asks to come up with the code for modify which h...

Mutable modifications of a Vector using ST Mutable modifications of a Vector using ST haskell ST Control.Monad.ST Data.STRef qualified Mutable Vector Unbox MVector LANGUAGE RankNTypes Chp28v8 Data.Vector.Unboxed V.Unbox V.Vector V.unsafeThaw V.unsafeFreeze Mutable modifications of a Vector using ST I have been going th...

[ -0.025634765625, 0.020751953125, -0.004119873046875, -0.00396728515625, 0.01544189453125, -0.0225830078125, -0.0140380859375, -0.0189208984375, -0.0045166015625, -0.01470947265625, -0.01025390625, 0.01129150390625, 0.0028533935546875, -0.00112152099609375, -0.00921630859375, 0.01336669...

[ 2758, 22819, 129344, 2609, 18770, 17368, 16992, 1556, 142508, 27131, 46674, 712, 8545, 11809, 4240, 217225, 992, 11728, 66160, 13, 98064, 134405, 196707, 3882, 334, 1019, 26455, 14256, 310, 309, 115840, 78122, 434, 81437, 731, 19188, 111, 206...

[ 0.190185546875, 0.180908203125, 0.232666015625, 0.220703125, 0.2205810546875, 0.0701904296875, 0.2120361328125, 0.1246337890625, 0.233154296875, 0.1446533203125, 0.054534912109375, 0.104248046875, 0.2032470703125, 0.04913330078125, 0.1224365234375, 0.123291015625, 0.1163330078125, ...

embed

61992892_c0

61992892

haskell

0

Title: Haskell: what are the implications of combining parameters into tuples, rather than using distinct parameters? Problem title: Haskell: what are the implications of combining parameters into tuples, rather than using distinct parameters? Tags: interface, haskell, parameters, functional-programming, tuples Problem...

Haskell: what are the implications of combining parameters into tuples, rather than using distinct parameters? Haskell: what are the implications of combining parameters into tuples, rather than using distinct parameters? interface haskell parameters functional-programming tuples distinct Haskell Float Vector Haskell: ...

[ -0.005218505859375, 0.002288818359375, -0.0167236328125, 0.01171875, 0.0101318359375, -0.0103759765625, -0.00640869140625, -0.0169677734375, 0.0091552734375, -0.0205078125, 0.0004730224609375, -0.0184326171875, -0.00933837890625, 0.0087890625, -0.0274658203125, 0.0012054443359375, 0....

[ 20625, 142508, 17914, 5256, 375, 964, 171859, 3934, 370, 99726, 43257, 17368, 117781, 3501, 101758, 1556, 123309, 28966, 38699, 2609, 18770, 2367, 9842, 1679, 193844, 2965, 41361, 112199, 96679, 11522, 30699, 62548, 32354, 10750, 13695, 1141, 2...

[ 0.1334228515625, 0.246826171875, 0.186279296875, 0.0982666015625, 0.0985107421875, 0.1729736328125, 0.235107421875, 0.08642578125, 0.1494140625, 0.22900390625, 0.0298919677734375, 0.0987548828125, 0.1605224609375, 0.032135009765625, 0.11572265625, 0.1065673828125, 0.09033203125, 0....

embed

10934788_c0

10934788

haskell

0

Title: Haskell code with Gloss lib doesn't compile Problem title: Haskell code with Gloss lib doesn't compile Tags: gloss, haskell, compiler-errors Problem: Haskell code with Gloss lib doesn't compile I switched from C++ to Haskell and use Gloss to make games. I wrote this valid code in a main.hs: import Grap...

Haskell code with Gloss lib doesn't compile Haskell code with Gloss lib doesn't compile gloss haskell compiler-errors Graphics.Gloss.Interface.Pure.Game Graphics.Gloss Haskell Gloss EventKey Char Down RectangleWire InWindow GameEvent Circle main.hs Compiling Main main.o main.hs:3:43 Not Display Translate Scal...

[ -0.018798828125, 0.0011138916015625, 0.0174560546875, 0.01318359375, -0.00640869140625, 0.013916015625, 0.0020599365234375, -0.0223388671875, -0.01263427734375, -0.00004792213439941406, 0.003997802734375, -0.03466796875, 0.0235595703125, 0.0081787109375, -0.006195068359375, -0.00933837...

[ 20625, 142508, 18151, 678, 46173, 7, 25474, 22027, 3768, 18, 9969, 1340, 207244, 1556, 34759, 188800, 189682, 2400, 107576, 36943, 162429, 21656, 49472, 57124, 13547, 192134, 163731, 5201, 127, 15612, 12321, 31, 33210, 11205, 90045, 11062, 1930...

[ 0.120849609375, 0.2066650390625, 0.160888671875, 0.050689697265625, 0.1915283203125, 0.1497802734375, 0.1500244140625, 0.00006103515625, 0.010406494140625, 0.045318603515625, 0.140869140625, 0.1348876953125, 0.214599609375, 0.07806396484375, 0.0201873779296875, 0.0909423828125, 0.097...

embed

21939241_c0

21939241

haskell

0

Title: Parsec fails to parse if characters follow my string Problem title: Parsec fails to parse if characters follow my string Tags: parsec, haskell Problem: Parsec fails to parse if characters follow my string I am trying to write something to parse my Django template, however my parser fails if anything follows an {...

Parsec fails to parse if characters follow my string Parsec fails to parse if characters follow my string parsec haskell Control.Monad Text.ParserCombinators.Parsec Parsec Piece StaticPiece BlockPiece VarPiece Show many1 Blah some_var other_var inner_body Hello Right Left Parsec fails to parse if characters follow my s...

[ -0.010986328125, 0.011474609375, 0.01263427734375, 0.0159912109375, -0.0242919921875, 0.037353515625, 0.00130462646484375, -0.02490234375, 0.0111083984375, -0.0230712890625, -0.0177001953125, 0.0023956298828125, 0.023681640625, -0.021240234375, -0.0096435546875, 0.005340576171875, 0....

[ 2392, 39797, 35782, 366, 184, 2174, 124850, 28960, 759, 79315, 1556, 142508, 27131, 46674, 712, 24129, 28636, 2189, 19155, 10374, 71465, 111242, 80231, 3323, 17367, 5941, 418, 1566, 1961, 75414, 37873, 35378, 90911, 636, 2480, 31577, 33022, 3...

[ 0.1409912109375, 0.2354736328125, 0.18505859375, 0.14794921875, 0.0975341796875, 0.1187744140625, 0.2064208984375, 0.21435546875, 0.06884765625, 0.2288818359375, 0.0518798828125, 0.1829833984375, 0.1453857421875, 0.0266876220703125, 0.0701904296875, 0.10418701171875, 0.11474609375, ...

embed

70326020_c0

70326020

haskell

0

Title: Haskell: Return the item of a list which absolute difference to its predecessor is equal or smaller than a certain value Problem title: Haskell: Return the item of a list which absolute difference to its predecessor is equal or smaller than a certain value Tags: functional-programming, haskell Problem: Haskell: ...

Haskell: Return the item of a list which absolute difference to its predecessor is equal or smaller than a certain value Haskell: Return the item of a list which absolute difference to its predecessor is equal or smaller than a certain value functional-programming haskell Haskell Rational Haskell: Return the item of a ...

[ -0.0103759765625, -0.007293701171875, 0.01123046875, 0.0086669921875, 0.00116729736328125, 0.02685546875, 0.0028839111328125, 0.0026702880859375, 0.031005859375, 0.01312255859375, 0.0115966796875, 0.034912109375, -0.013916015625, 0.01458740234375, 0.00799560546875, 0.0224609375, 0.02...

[ 20625, 142508, 173340, 35735, 5303, 3129, 89931, 60212, 47, 1653, 26531, 105950, 164917, 3501, 24233, 34292, 12, 111, 748, 123309, 28966, 1556, 2552, 43315, 41591, 116, 34635, 79875, 41491, 100920, 615, 5843, 12424, 17721, 12830, 13, 24209, 1...

[ 0.1519775390625, 0.277099609375, 0.2135009765625, 0.1734619140625, 0.1954345703125, 0.03936767578125, 0.1767578125, 0.2705078125, 0.032806396484375, 0.0631103515625, 0.127685546875, 0.147216796875, 0.177001953125, 0.0562744140625, 0.0279998779296875, 0.20458984375, 0.02532958984375, ...

embed

39067546_c0

39067546

haskell

0

Title: Bind type variables in a GHCI session Problem title: Bind type variables in a GHCI session Tags: haskell, ghci Problem: Bind type variables in a GHCI session Let's take fmap . const as a simple example where I try to understand what it does: fmap :: Functor f => (a -> b) -> f a -> f b const :: a -> b -> a The fi...

Bind type variables in a GHCI session Bind type variables in a GHCI session haskell ghci Bind GHCI Functor Bind type variables in a GHCI session Let's take fmap . const as a simple example where I try to understand what it does: The fist thing I notice is that a , b are ambiguous when I try to understand fmap . const ....

[ -0.004364013671875, -0.00592041015625, -0.0201416015625, 0.0186767578125, 0.00372314453125, -0.00579833984375, -0.0162353515625, 0.01519775390625, 0.0037384033203125, -0.014892578125, -0.00726318359375, -0.040283203125, -0.005157470703125, 0.024658203125, -0.0103759765625, 0.0181884765...

[ 16666, 71, 10644, 77336, 41877, 17304, 56002, 1556, 142508, 31380, 318, 28670, 18770, 1238, 62346, 5, 158, 271, 27781, 28219, 14602, 60322, 10, 4, 876, 920, 12282, 4527, 6626, 707, 1286, 62548, 138256, 25842, 68557, 706, 2203, 34390, 122554...

[ 0.1822509765625, 0.0548095703125, 0.1903076171875, 0.2193603515625, 0.146484375, 0.192626953125, 0.18896484375, 0.0809326171875, 0.183837890625, 0.0909423828125, 0.1317138671875, 0.040008544921875, 0.017059326171875, 0.09130859375, 0.2164306640625, 0.01361083984375, 0.1412353515625, ...

embed

31298466_c0

31298466

haskell

0

Title: Populating a list of tuples in a semantic way Problem title: Populating a list of tuples in a semantic way Tags: haskell, list-comprehension Problem: Populating a list of tuples in a semantic way I'm working on a piece of code where I have to process lists of tuples where both the order and names of the "keys" (...

Populating a list of tuples in a semantic way Populating a list of tuples in a semantic way haskell list-comprehension Populating Just Nothing Maybe Populating a list of tuples in a semantic way I'm working on a piece of code where I have to process lists of tuples where both the order and names of the "keys" ( fst s o...

[ -0.0045166015625, 0.00439453125, 0.0147705078125, 0.005584716796875, -0.0027923583984375, 0.00872802734375, -0.016357421875, -0.0033416748046875, 0.009521484375, 0.0224609375, 0.0159912109375, -0.0016326904296875, 0.011962890625, 0.011474609375, -0.0087890625, -0.004425048828125, -0....

[ 157890, 1916, 5303, 370, 99726, 484, 109109, 3917, 1556, 142508, 4692, 3220, 9563, 182747, 83425, 20697, 18151, 9433, 12989, 19770, 91, 14858, 110934, 29479, 193857, 217784, 44622, 12663, 35604, 35509, 107730, 27781, 22799, 13817, 32554, 100231, ...

[ 0.18798828125, 0.0176239013671875, 0.19091796875, 0.120849609375, 0.218994140625, 0.1854248046875, 0.149658203125, 0.04510498046875, 0.0987548828125, 0.1845703125, 0.08929443359375, 0.1165771484375, 0.084228515625, 0.15771484375, 0.1695556640625, 0.03558349609375, 0.047271728515625, ...

embed

77128045_c1

77128045

haskell

1

:: FunPtr (Double -> Double) -> Double -> Double -> Double -> Int -> Ptr Double -> Ptr Int -> IO Double -- | Numerical integration. integration :: (Double -> Double) -- ^ integrand -> Double -- ^ lower bound -> Double -- ^ upper bound -> Double -- ^ desired relative error -> Int -- ^ number of subdivisions -> IO Integ...

[ -0.0252685546875, -0.00104522705078125, 0.008056640625, -0.027099609375, 0.0201416015625, 0.0026092529296875, -0.01055908203125, -0.0179443359375, -0.005462646484375, -0.0038604736328125, -0.00823974609375, -0.0004024505615234375, -0.0208740234375, 0.000972747802734375, 0.01336669921875,...

[ 1984, 28670, 683, 4448, 15, 8331, 34, 2661, 33079, 107172, 360, 18, 436, 17780, 4210, 58745, 93511, 21533, 157353, 5, 13331, 9114, 2940, 92319, 99091, 1407, 104851, 35845, 18499, 14012, 1614, 428, 25826, 204681, 4332, 7, 7136, 34292, 25902,...

[ 0.121826171875, 0.2169189453125, 0.1673583984375, 0.287353515625, 0.0057373046875, 0.07171630859375, 0.1116943359375, 0.158935546875, 0.07318115234375, 0.2392578125, 0.10675048828125, 0.12890625, 0.146240234375, 0.197265625, 0.0247344970703125, 0.03424072265625, 0.1341552734375, 0....

embed

1365034_c0

1365034

haskell

0

Title: Haskell function pattern-matching issues Problem title: Haskell function pattern-matching issues Tags: haskell Problem: Haskell function pattern-matching issues I'm doing some homework and while I have some experience with SML, Haskell has some oddities. Consider this simple function: type Pos = (Int, Int) data ...

Haskell function pattern-matching issues Haskell function pattern-matching issues haskell Haskell Pos Move North South East West y-1 x-1 m:ms Main Couldn Haskell function pattern-matching issues I'm doing some homework and while I have some experience with SML, Haskell has some oddities. Consider this simple function: ...

[ -0.00872802734375, 0.02001953125, 0.01007080078125, -0.0067138671875, -0.0064697265625, 0.003204345703125, -0.02099609375, 0, 0.01611328125, -0.007720947265625, 0.01531982421875, -0.00274658203125, 0.00016689300537109375, -0.02490234375, -0.0018157958984375, -0.00628662109375, -0.003...

[ 20625, 142508, 32354, 103510, 98753, 214, 37348, 1556, 13498, 135828, 23924, 25134, 24453, 10542, 113, 5759, 1022, 347, 4432, 191147, 18244, 159, 39456, 81960, 8781, 3293, 18151, 43240, 2174, 202317, 1810, 425, 4, 53, 370, 8705, 13319, 4527, ...

[ 0.1468505859375, 0.2467041015625, 0.17333984375, 0.2216796875, 0.22509765625, 0.035675048828125, 0.1712646484375, 0.1312255859375, 0.2181396484375, 0.1585693359375, 0.1058349609375, 0.0987548828125, 0.0980224609375, 0.10614013671875, 0.0689697265625, 0.1033935546875, 0.04342651367187...

embed

27060805_c1

27060805

haskell

1

], morphisms :: [m], -- Each morphism has a domain and a codomain which are objects: domain :: m -> o, codomain :: m -> o, -- Given two morphisms f and g such that codomain f = domain g, -- the composition of f and g, written (g f), is defined: compose :: m -> m -> Maybe m, -- For every object X there is an identity mo...

[ 0.012451171875, 0.002197265625, -0.0022430419921875, 0.0198974609375, 0.017578125, 0.0169677734375, 0.009765625, -0.014404296875, 0.017822265625, 0.01092529296875, -0.024658203125, -0.040771484375, 0.002777099609375, 0.0028228759765625, -0.020751953125, 0.00732421875, 0.0059814453125...

[ 10114, 4, 178851, 8780, 7, 1984, 39, 4210, 98423, 1556, 10, 77758, 136, 552, 56206, 73, 621, 36746, 347, 33079, 36, 6626, 1238, 706, 166577, 111, 59121, 177, 61924, 150350, 83425, 1326, 11907, 1193, 182324, 3447, 1542, 38679, 2174, 76775,...

[ 0.042205810546875, 0.0172271728515625, 0.244873046875, 0.1756591796875, 0.035888671875, 0.048492431640625, 0.128173828125, 0.03973388671875, 0.149169921875, 0.0792236328125, 0.0673828125, 0.2138671875, 0.13671875, 0.1397705078125, 0.2186279296875, 0.115966796875, 0.040313720703125, ...

embed

76039680_c1

76039680

haskell

1

: Test.hs 2023-04-17T21:50:14.357932Z | Warning | No [cradle](https://github.com/mpickering/hie-bios#hie-bios) found for Test.hs. Proceeding with [implicit cradle](https://hackage.haskell.org/package/implicit-hie). You should ignore this message, unless you see a 'Multi Cradle: No prefixes matched' error. [Info - 10:50...

[ -0.0224609375, 0.01611328125, 0.0091552734375, 0.0164794921875, -0.00994873046875, 0.00933837890625, -0.0250244140625, 0.0159912109375, -0.0159912109375, 0.0028839111328125, 0.01104736328125, -0.0174560546875, -0.018310546875, 0.0009613037109375, 0.0037994384765625, 0.0146484375, -0....

[ 8647, 5, 127, 7, 140429, 40866, 115021, 5550, 592, 438, 378, 15182, 19298, 15769, 32102, 11368, 11050, 214, 979, 13, 100473, 14037, 84607, 678, 64357, 60923, 5589, 133, 139509, 10557, 142508, 1478, 29102, 124962, 26008, 50657, 118, 34734, 1...

[ 0.23291015625, 0.04547119140625, 0.16259765625, 0.14453125, 0.0870361328125, 0.041107177734375, 0.000823974609375, 0.10693359375, 0.06463623046875, 0.1500244140625, 0.0084228515625, 0.165283203125, 0.1951904296875, 0.079345703125, 0.1448974609375, 0.06011962890625, 0.1138916015625, ...

embed

41889738_c0

41889738

haskell

0

Title: Retaining list-ness operations for a data type Problem title: Retaining list-ness operations for a data type Tags: haskell, algebraic-data-types Problem: Retaining list-ness operations for a data type I want to be able to define a custom data type as opposed to using a type alias to ensure that proper values are...

Retaining list-ness operations for a data type Retaining list-ness operations for a data type haskell algebraic-data-types Data.Ord Data.List Retaining Example Down DictEntry Integer Show Ord word1 freq1 word2 freq2 Dictionary Retaining list-ness operations for a data type I want to be able to define a custom data type...

[ 0.0042724609375, 0.0244140625, 0.003143310546875, -0.0128173828125, -0.002410888671875, -0.00025177001953125, -0.007659912109375, -0.0166015625, 0.00750732421875, -0.01202392578125, -0.00408935546875, -0.004119873046875, 0.00157928466796875, 0.01312255859375, -0.0201416015625, 0.005584...

[ 853, 102, 14653, 5303, 9, 7432, 41018, 100, 2053, 10644, 1556, 142508, 429, 2844, 10135, 50986, 11809, 143045, 154663, 89536, 49472, 60897, 7768, 44401, 17367, 35379, 2565, 12478, 304, 147638, 3444, 61924, 114122, 55109, 63284, 27798, 142424, ...

[ 0.1163330078125, 0.177001953125, 0.059112548828125, 0.2081298828125, 0.1173095703125, 0.14404296875, 0.1827392578125, 0.024810791015625, 0.126220703125, 0.2257080078125, 0.10736083984375, 0.20654296875, 0.014617919921875, 0.007598876953125, 0.072509765625, 0.19140625, 0.0883178710937...

embed

78693173_c0

78693173

haskell

0

Title: For function definition, what is the difference between using partial application, a lamba expression or put the arguments next to the name? Problem title: For function definition, what is the difference between using partial application, a lamba expression or put the arguments next to the name? Tags: function-d...

For function definition, what is the difference between using partial application, a lamba expression or put the arguments next to the name? For function definition, what is the difference between using partial application, a lamba expression or put the arguments next to the name? function-definition haskell partial-ap...

[ 0.00396728515625, -0.0027313232421875, 0.011962890625, -0.0008697509765625, -0.0167236328125, 0.005950927734375, 0.01226806640625, -0.01806640625, 0.0026397705078125, -0.005523681640625, -0.006744384765625, -0.0245361328125, 0.00250244140625, -0.005645751953125, 0.003204345703125, -0.0...

[ 32354, 80934, 60212, 17721, 17368, 2878, 289, 38415, 105277, 125195, 3884, 10750, 7, 11737, 47, 9351, 49919, 1556, 142508, 101687, 21, 6492, 85, 1405, 17262, 6002, 102, 31195, 4537, 14602, 5701, 50218, 129927, 25632, 18151, 43240, 5885, 26785...

[ 0.1932373046875, 0.1732177734375, 0.164794921875, 0.035797119140625, 0.050201416015625, 0.1864013671875, 0.0914306640625, 0.201171875, 0.20703125, 0.19775390625, 0.07196044921875, 0.215576171875, 0.03253173828125, 0.10638427734375, 0.0869140625, 0.1070556640625, 0.131103515625, 0.0...

embed

28334189_c0

28334189

haskell

0

Title: Haskell. update a single Vector element in O(1) Problem title: Haskell. update a single Vector element in O(1) Tags: vector, haskell Problem: Haskell. update a single Vector element in O(1) I want to write a function that updates a single vector element in O(1): Vector Integer -> Int -> Integer -> Vector Integer...

Haskell. update a single Vector element in O(1) Haskell. update a single Vector element in O(1) vector haskell Haskell Vector Integer Data.Vector.Generic.fromList Data.Vector.modify Data.Vector.Mutable.write Data.Vector.Mutable.unsafeWrite DVM.write Couldn Expected DV.Vector Actual Data.Vector Data.Vector.Mutable Haske...

[ -0.03857421875, 0.03369140625, -0.0130615234375, -0.01055908203125, 0.0142822265625, -0.0001850128173828125, -0.0240478515625, -0.01275634765625, 0.0091552734375, -0.005889892578125, -0.010009765625, 0.007354736328125, 0.006072998046875, 0.0003795623779296875, -0.006439208984375, 0.008...

[ 20625, 142508, 28350, 11001, 2609, 18770, 12830, 180, 27750, 173, 1556, 44401, 11809, 26455, 135932, 12259, 161063, 154663, 13415, 40383, 10685, 22819, 18781, 309, 115840, 391, 47599, 434, 191147, 60075, 107199, 6, 100582, 3444, 33022, 32354, 1...

[ 0.1470947265625, 0.2467041015625, 0.189453125, 0.17333984375, 0.210693359375, 0.185302734375, 0.1846923828125, 0.1895751953125, 0.1455078125, 0.2030029296875, 0.123046875, 0.10333251953125, 0.1253662109375, 0.1676025390625, 0.087646484375, 0.08544921875, 0.08978271484375, 0.0803222...

embed

34477552_c0

34477552

haskell

0

Title: Tree merge algorithm in Haskell Problem title: Tree merge algorithm in Haskell Tags: tree, algorithm, haskell Problem: Tree merge algorithm in Haskell I need a function which takes two trees, checks to see if there are any common branches coming off the trunk, and merges the trees into a single tree if possible....

Tree merge algorithm in Haskell Tree merge algorithm in Haskell tree algorithm haskell Data.Tree Tree Haskell test1 test2 Either Bool Node Right Left Tree merge algorithm in Haskell I need a function which takes two trees, checks to see if there are any common branches coming off the trunk, and merges the trees into a ...

[ 0.00040435791015625, 0.022705078125, 0.0022735595703125, -0.0037841796875, 0.0152587890625, 0.006011962890625, -0.04296875, -0.01080322265625, 0.00098419189453125, -0.00384521484375, 0.00093841552734375, 0.00830078125, 0.00732421875, 0.005279541015625, 0.02392578125, -0.00860595703125,...

[ 101344, 42564, 234873, 20625, 142508, 53201, 1556, 11809, 62731, 3034, 418, 304, 9319, 2460, 929, 438, 112, 90911, 636, 2480, 23, 3871, 32354, 51776, 6626, 1360, 12765, 1957, 2174, 39210, 90356, 38162, 5773, 195550, 3934, 11001, 7722, 988, ...

[ 0.255126953125, 0.283203125, 0.2083740234375, 0.12353515625, 0.218994140625, 0.211669921875, 0.1112060546875, 0.03857421875, 0.1739501953125, 0.1358642578125, 0.014373779296875, 0.050689697265625, 0.03363037109375, 0.0199737548828125, 0.110595703125, 0.1065673828125, 0.04489135742187...

embed

71167160_c0

71167160

haskell

0

Title: How to install an library in Haskell? Problem title: How to install an library in Haskell? Tags: haskell Problem: How to install an library in Haskell? I try to use Control.Monad.Extra.andM import Control.Monad.Extra (andM) but has an error: Could not find module ‘Control.Monad.Extra’ Perhaps you meant Control.M...

How to install an library in Haskell? How to install an library in Haskell? haskell Control.Monad.Error Control.Monad.Extra How Haskell Could Perhaps Control.Monad.Catch exceptions-0.10.4 mtl-2.2.2 Control.Monad.Except PACKAGE How to install an library in Haskell? I try to use Control.Monad.Extra.andM but has an error:...

[ -0.01708984375, 0.006317138671875, 0.0019989013671875, 0.0234375, 0.004150390625, 0.0029296875, -0.002044677734375, -0.006561279296875, 0.00128173828125, 0.004608154296875, -0.0047607421875, -0.06640625, 0.008544921875, 0.004425048828125, 0.00125885009765625, -0.00823974609375, -0.00...

[ 11249, 47, 20600, 35773, 1294, 23, 20625, 142508, 142, 1556, 27131, 46674, 712, 18468, 31611, 19279, 1517, 191147, 181799, 76775, 131527, 102014, 121254, 141, 70147, 19462, 11107, 20572, 9790, 4527, 2940, 594, 18499, 3293, 959, 3249, 10422, 4...

[ 0.048858642578125, 0.037384033203125, 0.211669921875, 0.2220458984375, 0.171142578125, 0.09185791015625, 0.1553955078125, 0.258544921875, 0.0421142578125, 0.125, 0.224609375, 0.123779296875, 0.171630859375, 0.0650634765625, 0.036102294921875, 0.10369873046875, 0.162353515625, 0.027...

embed

33764456_c0

33764456

haskell

0

Title: Why is Haskell unable to resolve the number of arguments automatically? Problem title: Why is Haskell unable to resolve the number of arguments automatically? Tags: haskell Problem: Why is Haskell unable to resolve the number of arguments automatically? I'm new to Haskell and I got confused by the following beha...

Why is Haskell unable to resolve the number of arguments automatically? Why is Haskell unable to resolve the number of arguments automatically? haskell Why Haskell Show Empty Equations Why is Haskell unable to resolve the number of arguments automatically? I'm new to Haskell and I got confused by the following behavior...

[ -0.01165771484375, -0.00421142578125, 0.002410888671875, 0.00103759765625, -0.0037841796875, 0.01318359375, -0.0015869140625, -0.006683349609375, 0.04345703125, -0.00299072265625, 0.00016689300537109375, -0.039794921875, 0.005950927734375, 0.039794921875, 0.0137939453125, -0.0131835937...

[ 44084, 20625, 142508, 51, 2886, 103608, 14012, 10750, 7, 191082, 1556, 17367, 31678, 939, 13722, 83, 47, 3525, 55681, 123166, 32354, 35142, 194583, 23389, 33342, 903, 3164, 4127, 20697, 84751, 5303, 7639, 19736, 33478, 11001, 79315, 28219, 26...

[ 0.0721435546875, 0.1361083984375, 0.2437744140625, 0.07147216796875, 0.13330078125, 0.180908203125, 0.095458984375, 0.252197265625, 0.051177978515625, 0.1929931640625, 0.109619140625, 0.05792236328125, 0.1513671875, 0.07177734375, 0.1392822265625, 0.009613037109375, 0.00384521484375,...

embed

51142250_c0

51142250

haskell

0

Title: Cassava parsing error in haskell Problem title: Cassava parsing error in haskell Tags: parsing, haskell, csv Problem: Cassava parsing error in haskell Im trying to convert a csv into a vector using cassava. The csv Im trying to convert is the fischer iris data set, used for machine learning. It consists of four ...

Cassava parsing error in haskell Cassava parsing error in haskell parsing haskell csv Data.Csv qualified Cassava LANGUAGE OverloadedStrings Main Data.ByteString.Lazy Data.Vector Iris sepal_length Double sepal_width petal_length petal_width iris_type Show Read FromNamedRecord BS.readFile Left Apply Right V.forM_ Iris-se...

[ -0.0103759765625, 0.0184326171875, -0.0130615234375, 0.0247802734375, 0.00897216796875, 0.0111083984375, -0.01312255859375, -0.00787353515625, -0.0167236328125, -0.0235595703125, -0.00811767578125, -0.02490234375, 0.006134033203125, -0.0036773681640625, -0.00677490234375, -0.0147705078...

[ 103978, 5528, 366, 6953, 18499, 23, 1556, 142508, 20763, 334, 11809, 67756, 217225, 3358, 98064, 9578, 63033, 297, 71713, 12321, 2729, 3285, 26455, 18770, 122816, 40, 5007, 23986, 107172, 146984, 280, 1803, 97153, 50986, 17367, 4764, 32271, 8...

[ 0.16650390625, 0.281005859375, 0.1795654296875, 0.036956787109375, 0.18212890625, 0.0030517578125, 0.1221923828125, 0.234619140625, 0.0709228515625, 0.2080078125, 0.0869140625, 0.1920166015625, 0.1666259765625, 0.01263427734375, 0.103515625, 0.083984375, 0.15625, 0.008697509765625,...

embed

44494694_c0

44494694

haskell

0

Title: Represent of a collection of binary data Problem title: Represent of a collection of binary data Tags: haskell, optimization, performance, memory Problem: Represent of a collection of binary data I'm working with signals in which the samples consist of Float s. Some of the algorithms I've written only require to...

Represent of a collection of binary data Represent of a collection of binary data haskell optimization performance memory Represent Float Vector Boolean Bit Array Represent of a collection of binary data I'm working with signals in which the samples consist of Float s. Some of the algorithms I've written only require t...

[ 0.017333984375, 0.030517578125, -0.0167236328125, 0.024658203125, -0.0225830078125, 0.0087890625, -0.0157470703125, 0.00311279296875, 0.005096435546875, 0.012451171875, -0.0166015625, -0.0211181640625, 0.006988525390625, 0.0216064453125, -0.01007080078125, 0.01409912109375, 0.0063476...

[ 853, 55247, 111, 42486, 2394, 6635, 2053, 1556, 142508, 87235, 23718, 98323, 38699, 257, 2609, 18770, 73783, 34677, 27774, 69253, 53, 20697, 26073, 121413, 58055, 91, 234873, 59121, 4734, 64209, 3714, 3229, 41421, 1022, 33102, 24491, 34292, 4...

[ 0.0982666015625, 0.2578125, 0.0814208984375, 0.184814453125, 0.1676025390625, 0.13427734375, 0.1771240234375, 0.10302734375, 0.2186279296875, 0.160400390625, 0.1278076171875, 0.1395263671875, 0.190185546875, 0.108642578125, 0.2060546875, 0.2232666015625, 0.1422119140625, 0.23669433...

embed

6028424_c0

6028424

haskell

0

Title: Defining Eq instance for Haskell GADTs Problem title: Defining Eq instance for Haskell GADTs Tags: haskell, gadt Problem: Defining Eq instance for Haskell GADTs I have a GADT that's a lot like this: data In a where M :: MVar a -> In a T :: TVar a -> In a F :: (a -> b) -> In a -> In b It wraps various input primi...

Defining Eq instance for Haskell GADTs Defining Eq instance for Haskell GADTs haskell gadt Defining Haskell GADTs MVar TVar Functor Defining Eq instance for Haskell GADTs I have a GADT that's a lot like this: It wraps various input primitives, but the last constructor also allows for a Functor instance: The point of th...

[ -0.003509521484375, 0.01708984375, 0.0008697509765625, 0.002288818359375, 0.0196533203125, -0.006011962890625, -0.015380859375, -0.015380859375, 0.004119873046875, -0.01287841796875, 0.00811767578125, -0.02490234375, 0.00677490234375, 0.00726318359375, -0.00994873046875, 0.019653320312...

[ 88606, 241, 864, 110527, 20625, 142508, 23749, 41072, 1556, 914, 13384, 66160, 147, 1910, 28670, 18770, 1884, 137565, 67842, 107730, 128489, 4568, 64549, 748, 114864, 6275, 10644, 8060, 61924, 162520, 2967, 50960, 7225, 35782, 1022, 136, 113, ...

[ 0.1654052734375, 0.09442138671875, 0.2548828125, 0.28759765625, 0.126220703125, 0.213134765625, 0.115478515625, 0.162109375, 0.11376953125, 0.078369140625, 0.0926513671875, 0.02801513671875, 0.1165771484375, 0.0643310546875, 0.10113525390625, 0.1246337890625, 0.005859375, 0.1065673...

embed

62601435_c0

62601435

haskell

0

Title: Is there a Lens/Optic that can use to dig deeply into multidimensional maps? Problem title: Is there a Lens/Optic that can use to dig deeply into multidimensional maps? Tags: lenses, haskell Problem: Is there a Lens/Optic that can use to dig deeply into multidimensional maps? I've had a bit of difficulty using L...

Is there a Lens/Optic that can use to dig deeply into multidimensional maps? Is there a Lens/Optic that can use to dig deeply into multidimensional maps? lenses haskell Lens Optic Map Is there a Lens/Optic that can use to dig deeply into multidimensional maps? I've had a bit of difficulty using Lenses with Maps. I have...

[ -0.002044677734375, -0.00054931640625, -0.0081787109375, -0.0010223388671875, -0.01458740234375, -0.007232666015625, 0.0087890625, -0.02685546875, -0.00885009765625, -0.0223388671875, 0.01611328125, 0.0186767578125, 0.00086212158203125, 0.013427734375, 0.007720947265625, -0.00463867187...

[ 2071, 2685, 10, 18226, 7, 64, 670, 112569, 450, 831, 4527, 1466, 53894, 538, 3934, 6024, 157955, 22288, 47, 96, 47754, 1556, 142508, 180, 42719, 4785, 34844, 17368, 339, 678, 103033, 6713, 1884, 903, 23351, 214, 166179, 360, 18, 10298, ...

[ 0.03863525390625, 0.09210205078125, 0.0833740234375, 0.1907958984375, 0.118896484375, 0.0675048828125, 0.12939453125, 0.22412109375, 0.052490234375, 0.09063720703125, 0.135009765625, 0.2174072265625, 0.1832275390625, 0.0638427734375, 0.1546630859375, 0.145751953125, 0.1878662109375, ...

embed

3851042_c0

3851042

haskell

0

Title: Pattern Matching a Haskell list of variable size Problem title: Pattern Matching a Haskell list of variable size Tags: haskell, pattern-matching Problem: Pattern Matching a Haskell list of variable size EDIT : I shouldn't be coding when this tired. I was compiling a different copy of the program than I was runni...

Pattern Matching a Haskell list of variable size Pattern Matching a Haskell list of variable size haskell pattern-matching Pattern Matching Haskell server:nick:channel IRC.startIRC server:port:nick:channel Incorrect irc.freenode.net core.hs:9:4-32 Pattern Matching a Haskell list of variable size EDIT : I shouldn't be c...

[ -0.0107421875, 0.017822265625, -0.009765625, 0.0181884765625, -0.00946044921875, 0.01397705078125, -0.021484375, 0.01287841796875, 0.00946044921875, 0.0029296875, 0.04150390625, -0.0400390625, -0.0067138671875, -0.002166748046875, 0.0026702880859375, -0.005279541015625, 0.03295898437...

[ 9876, 22766, 67407, 214, 20625, 142508, 5303, 77336, 13267, 1556, 103510, 98753, 10723, 67127, 17032, 87, 25740, 17137, 14688, 441, 6982, 32399, 193, 238, 32087, 157, 112, 1179, 56458, 127, 1126, 617, 108760, 552, 168661, 9969, 12921, 43658, ...

[ 0.195556640625, 0.1806640625, 0.2578125, 0.0261383056640625, 0.1617431640625, 0.2486572265625, 0.1883544921875, 0.2384033203125, 0.1512451171875, 0.12255859375, 0.2437744140625, 0.2294921875, 0.1104736328125, 0.151611328125, 0.1021728515625, 0.0177459716796875, 0.1312255859375, 0.0...

embed

29444043_c1

29444043

haskell

1

has found a solution using ancient versions with very loose constraints. What I'd like to do is find out which of the packages I'm installing are causing this. Usually I can see something like "oh, those are a bunch of graphics packages, it's probably xmonad or taffybar that's the reason", and I go check the latest ve...

[ -0.00714111328125, 0.0115966796875, 0.01904296875, 0.018310546875, -0.0004215240478515625, 0.0306396484375, -0.0205078125, -0.00958251953125, -0.0018157958984375, 0.02294921875, 0.00640869140625, -0.052734375, 0.00174713134765625, 0.005828857421875, -0.0167236328125, 0.00830078125, -...

[ 1556, 14037, 10, 29806, 17368, 45964, 11389, 4552, 5078, 184, 158, 2816, 4288, 25, 1884, 7413, 1810, 98169, 7, 87, 39, 20600, 214, 621, 216806, 903, 62544, 1957, 10597, 4, 8382, 147306, 48461, 31895, 1022, 3796, 712, 308, 76195, 1299, 3...

[ 0.032501220703125, 0.039337158203125, 0.038055419921875, 0.1407470703125, 0.04541015625, 0.08251953125, 0.1746826171875, 0.045867919921875, 0.1136474609375, 0.12158203125, 0.0509033203125, 0.14404296875, 0.107421875, 0.03564453125, 0.03973388671875, 0.0694580078125, 0.113525390625, ...

embed

72922945_c0

72922945

haskell

0

Title: All possible binary trees storing a value Problem title: All possible binary trees storing a value Tags: functional-programming, monads, haskell Problem: All possible binary trees storing a value I want to write a function, allTrees , to generate a list of all possible binary trees that store the number of leave...

All possible binary trees storing a value All possible binary trees storing a value functional-programming monads haskell All BTree Ord Show SpecTree Integer size1 sub1 size2 sub2 All possible binary trees storing a value I want to write a function, allTrees , to generate a list of all possible binary trees that store ...

[ 0.0257568359375, 0.00848388671875, -0.0169677734375, -0.015625, 0.016845703125, 0.015380859375, -0.033203125, -0.02587890625, 0.015625, -0.04296875, -0.01318359375, -0.00125885009765625, 0.00799560546875, 0.01611328125, 0.01483154296875, 0.0272216796875, 0.019287109375, -0.00360107...

[ 3164, 7722, 2394, 6635, 1360, 90, 3082, 214, 34292, 123309, 28966, 2667, 712, 1556, 142508, 107, 13, 35379, 17367, 24990, 62731, 44401, 13267, 1614, 3444, 33022, 10, 32354, 756, 139392, 5303, 4343, 14012, 31358, 12638, 53201, 2053, 52895, 8...

[ 0.1085205078125, 0.1739501953125, 0.1510009765625, 0.080078125, 0.2227783203125, 0.128662109375, 0.16357421875, 0.040374755859375, 0.16796875, 0.1229248046875, 0.0965576171875, 0.05670166015625, 0.0802001953125, 0.08758544921875, 0.191162109375, 0.15576171875, 0.031982421875, 0.169...

embed

30584526_c1

30584526

haskell

1

putStrLn "X ranges from: " from <- getLine putStrLn "To: " to <- getLine putStrLn "In steps of (Only whole numbers are accepted):" step <- getLine putStrLn "Please have some patience..." let range = [read from,(read from + read step)..read to] :: [Int] let searches = map (replaceX search) range let res = map getResult...

[ -0.013671875, 0.00848388671875, 0.00148773193359375, -0.00439453125, 0.0023040771484375, 0.0260009765625, 0.02197265625, -0.030517578125, 0.01422119140625, -0.0191650390625, -0.001739501953125, -0.01373291015625, -0.0025787353515625, 0.0108642578125, 0.01336669921875, 0.002639770507812...

[ 3884, 71713, 866, 19, 44, 1542, 37457, 7, 1295, 12, 2046, 93232, 7763, 47, 4153, 98441, 111, 20320, 28271, 101935, 68186, 29954, 238159, 765, 3060, 201010, 2633, 39116, 997, 12301, 33938, 22288, 107, 23935, 3332, 7136, 108210, 23577, 154663...

[ 0.2626953125, 0.272705078125, 0.1441650390625, 0.1385498046875, 0.016845703125, 0.156982421875, 0.25048828125, 0.138427734375, 0.1524658203125, 0.010101318359375, 0.1240234375, 0.2012939453125, 0.1654052734375, 0.06964111328125, 0.037139892578125, 0.16357421875, 0.004180908203125, ...

embed

58589415_c0

58589415

haskell

0

Title: stack exec failed when using http-client/http-client-tls in pure nix Problem title: stack exec failed when using http-client/http-client-tls in pure nix Tags: nix, haskell-stack, haskell Problem: stack exec failed when using http-client/http-client-tls in pure nix I'm using nix , stack and http-client-tls to GET...

stack exec failed when using http-client/http-client-tls in pure nix stack exec failed when using http-client/http-client-tls in pure nix nix haskell-stack haskell http-client/http-client-tls qualified Network.HTTP.Client Network.HTTP.Client.TLS LANGUAGE OverloadedStrings Main Data.ByteString.Lazy www.google.com.tw Res...

[ -0.015380859375, 0.00732421875, 0.0194091796875, 0.018798828125, -0.0029296875, -0.005218505859375, -0.004486083984375, -0.003936767578125, -0.01171875, -0.00958251953125, 0.022216796875, 0.00970458984375, 0.0038909912109375, 0.00052642822265625, 0.01080322265625, 0.0029144287109375, ...

[ 177261, 1119, 3240, 165523, 17368, 1621, 222978, 5475, 18, 8080, 34166, 300, 425, 1556, 142508, 590, 2594, 217225, 28997, 18544, 23658, 150, 41445, 98064, 9578, 63033, 297, 71713, 12321, 11809, 75358, 2729, 3285, 59875, 32290, 92748, 335, 933...

[ 0.249755859375, 0.107666015625, 0.2093505859375, 0.1688232421875, 0.054168701171875, 0.1409912109375, 0.1959228515625, 0.137451171875, 0.059051513671875, 0.139892578125, 0.1845703125, 0.09552001953125, 0.1295166015625, 0.050262451171875, 0.2158203125, 0.06988525390625, 0.084106445312...

embed

12067084_c1

12067084

haskell

1

sect t1 t2 subtract ∷ Tree → Tree → Tree subtract t1 t2 = Binary Subtract t1 t2 data Primitive = Sphere { radius ∷ Double } | Block { size ∷ Vec3 } | Cone { radius ∷ Double , height ∷ Double } deriving (Show) data UnaryOp = Transform Proj4 deriving (Show) data BinaryOp = Union | Intersect | Subtract deriving (Show) dat...

[ 0.01416015625, 0.01220703125, 0.00799560546875, 0.0146484375, 0.0216064453125, -0.001922607421875, -0.032470703125, 0.000370025634765625, -0.00168609619140625, -0.0164794921875, -0.02685546875, 0.013427734375, 0.005859375, -0.00009679794311523438, -0.01226806640625, 0.0247802734375, ...

[ 19216, 18, 808, 418, 304, 1614, 39989, 247341, 101344, 2863, 2203, 54092, 1294, 8273, 2053, 44506, 14, 4935, 8019, 35593, 4567, 107172, 80231, 13267, 52884, 363, 1657, 13, 155955, 16406, 168660, 4228, 39029, 11062, 5037, 1250, 170, 617, 325...

[ 0.2037353515625, 0.136474609375, 0.1275634765625, 0.125732421875, 0.1783447265625, 0.1436767578125, 0.199462890625, 0.117431640625, 0.226318359375, 0.036590576171875, 0.0740966796875, 0.197509765625, 0.0875244140625, 0.128662109375, 0.2022705078125, 0.1544189453125, 0.062255859375, ...

embed

27726555_c0

27726555

haskell

0

Title: Deriving Typeable for Text.PrettyPrint.Doc Problem title: Deriving Typeable for Text.PrettyPrint.Doc Tags: ghc-generics, ghc, haskell, scrap-your-boilerplate Problem: Deriving Typeable for Text.PrettyPrint.Doc I have an AST type that I want to derive as Typeable, so that I can do Scrap-your-boilerplate generic t...

Deriving Typeable for Text.PrettyPrint.Doc Deriving Typeable for Text.PrettyPrint.Doc ghc-generics ghc haskell scrap-your-boilerplate Deriving Typeable Text.PrettyPrint.Doc Doc Data P.Doc Can Deriving Typeable for Text.PrettyPrint.Doc I have an AST type that I want to derive as Typeable, so that I can do Scrap-your-boi...

[ 0.011474609375, 0.00007963180541992188, -0.0027923583984375, 0.00897216796875, 0.0010223388671875, 0.011962890625, 0.0059814453125, -0.00157928466796875, -0.0096435546875, -0.034912109375, -0.0032196044921875, -0.0155029296875, 0.0140380859375, -0.0107421875, 0, -0.000217437744140625, ...

[ 1310, 14, 6496, 60457, 2886, 100, 24129, 19273, 15145, 112079, 18, 8331, 238, 31380, 79446, 1556, 142508, 120948, 154176, 837, 34759, 92558, 29048, 11809, 436, 4171, 48963, 10644, 122, 5844, 237, 219536, 189534, 37317, 53201, 8668, 89914, 357...

[ 0.143798828125, 0.0869140625, 0.07855224609375, 0.274658203125, 0.25732421875, 0.07666015625, 0.1876220703125, 0.1212158203125, 0.14697265625, 0.1395263671875, 0.062744140625, 0.117919921875, 0.03692626953125, 0.0625, 0.117431640625, 0.065185546875, 0.173095703125, 0.1649169921875,...

embed

75872651_c0

75872651

haskell

0

Title: How to do mapMaybe using lenses Problem title: How to do mapMaybe using lenses Tags: haskell, aeson, lenses, fold, haskell-lens Problem: How to do mapMaybe using lenses I am using wreq on the github api to get a list of files in a repository. I include this for completeness sake. This isn't about doing the web r...

How to do mapMaybe using lenses How to do mapMaybe using lenses haskell aeson lenses fold haskell-lens InvalidUrlException lenses How Accept vnd.github.raw X-GitHub-Api-Version api.github.com Text.unpack Left HttpExceptionRequest Error Text.pack Url Right eb21b416a406ebae963116911afd3cd0994132ce a47bd530c4b8677af24b291...

[ -0.0189208984375, 0.0025482177734375, 0.00093841552734375, -0.0216064453125, -0.015625, 0.017578125, 0.00274658203125, -0.0174560546875, -0.00537109375, -0.0263671875, -0.000827789306640625, 0.023193359375, -0.0048828125, -0.007598876953125, 0.0181884765625, -0.00156402587890625, -0....

[ 11249, 54, 22288, 82419, 372, 17368, 96, 47754, 1556, 142508, 10, 90, 191, 42822, 1977, 7013, 48743, 63928, 111383, 81, 2208, 15769, 32102, 81456, 1193, 217, 140505, 1434, 178390, 31470, 24129, 309, 29102, 3062, 212059, 4143, 90911, 201939, ...

[ 0.040191650390625, 0.09967041015625, 0.2193603515625, 0.1907958984375, 0.2010498046875, 0.1329345703125, 0.1827392578125, 0.216796875, 0.1134033203125, 0.218017578125, 0.0384521484375, 0.068115234375, 0.1439208984375, 0.146240234375, 0.1627197265625, 0.08740234375, 0.06524658203125, ...

embed

77603190_c0

77603190

haskell

0

Title: Haskell and Parsec: Parsing two separated lists of numbers Problem title: Haskell and Parsec: Parsing two separated lists of numbers Tags: parsing, haskell, parsec Problem: Haskell and Parsec: Parsing two separated lists of numbers I've been experimenting with Parsec for the first time in my life and I found a t...

Haskell and Parsec: Parsing two separated lists of numbers Haskell and Parsec: Parsing two separated lists of numbers parsing haskell parsec Haskell Parsec Parsing Data Show Parser Parsec.string Parsec.spaces many1 Parsec.digit Parsec.char Parsec.space sepBy1 Haskell and Parsec: Parsing two separated lists of numbers I...

[ -0.005218505859375, 0.0166015625, -0.01373291015625, 0.051025390625, -0.010986328125, 0.029052734375, 0.006134033203125, -0.0098876953125, 0.00860595703125, -0.0022735595703125, 0.0137939453125, -0.0016326904296875, 0.01287841796875, 0.019775390625, -0.0167236328125, -0.017578125, 0....

[ 20625, 142508, 136, 2392, 39797, 6953, 6626, 84797, 71, 5303, 101935, 366, 1556, 11809, 17367, 2189, 91693, 65421, 5941, 418, 4803, 9254, 25040, 75358, 28007, 678, 5117, 6897, 66211, 212615, 34844, 3444, 184, 390, 58745, 62816, 27781, 13806, ...

[ 0.1549072265625, 0.25927734375, 0.1187744140625, 0.1943359375, 0.285888671875, 0.091796875, 0.145263671875, 0.18408203125, 0.016326904296875, 0.199951171875, 0.17822265625, 0.1783447265625, 0.1309814453125, 0.1292724609375, 0.129638671875, 0.1265869140625, 0.093505859375, 0.1856689...

embed

66949565_c1

66949565

haskell

1

legacy fallback) Building vector-0.11.0.0 (lib) Building zlib-0.5.4.2 (lib) Building Win32-2.3.0.0 (all, legacy fallback) Building haskell-src-exts-1.14.0.1 (all, legacy fallback) Failed to build Win32-2.3.0.0. Build log ( C:\Users\nicod\AppData\Roaming\cabal\logs\ghc-7.0.1\Win32-2.3.0.0-bc0070ef9ddaa5b276f777956fac43...

[ -0.0172119140625, 0.01202392578125, 0.004364013671875, 0.002197265625, 0.004150390625, 0.00494384765625, -0.01495361328125, -0.0257568359375, -0.01507568359375, 0.005401611328125, 0.01416015625, -0.0155029296875, 0.032470703125, -0.01104736328125, -0.0033416748046875, -0.0030517578125,...

[ 3257, 2408, 6817, 12620, 104919, 173, 18770, 23320, 14556, 99929, 5612, 97, 93645, 5, 117904, 15, 17686, 6460, 120883, 5584, 1556, 142508, 19437, 3355, 933, 5759, 2592, 102014, 190355, 297, 47, 45367, 9, 121137, 12684, 313, 1062, 12150, 391...

[ 0.179443359375, 0.1177978515625, 0.1627197265625, 0.203369140625, 0.2454833984375, 0.1861572265625, 0.1939697265625, 0.049224853515625, 0.142578125, 0.2276611328125, 0.2215576171875, 0.0626220703125, 0.12646484375, 0.0266265869140625, 0.134033203125, 0.005706787109375, 0.106567382812...

embed

59164992_c0

59164992

haskell

0

Title: Could not find module in runhaskell-script Problem title: Could not find module in runhaskell-script Tags: haskell-stack, cabal, haskell Problem: Could not find module in runhaskell-script I code haskell of poor quality in december each year. This year my environment is broken for some reason. When I try to run ...

Could not find module in runhaskell-script Could not find module in runhaskell-script haskell-stack cabal haskell Could myCode.hs Data.List.Split Use Maybe Haskell Setup Configuring split-0.2.3.3 Encountered Could not find module in runhaskell-script I code haskell of poor quality in december each year. This year my en...

[ -0.0196533203125, 0.00579833984375, -0.01275634765625, 0.0185546875, -0.00787353515625, 0.0162353515625, 0.0113525390625, -0.0081787109375, -0.0107421875, -0.02099609375, -0.0107421875, -0.01397705078125, 0.002960205078125, 0.0174560546875, -0.002166748046875, 0.01092529296875, -0.00...

[ 191147, 959, 7413, 88996, 23, 11675, 10557, 142508, 32032, 1556, 590, 2594, 109524, 759, 114211, 127, 11809, 154663, 31923, 4353, 36836, 83425, 20625, 19943, 2037, 59994, 65450, 133684, 134693, 71013, 9, 18151, 70425, 31897, 13104, 12638, 6602,...

[ 0.06341552734375, 0.119384765625, 0.1876220703125, 0.265869140625, 0.0433349609375, 0.1146240234375, 0.124755859375, 0.212646484375, 0.2005615234375, 0.11669921875, 0.0209503173828125, 0.052734375, 0.19775390625, 0.09912109375, 0.181640625, 0.07452392578125, 0.0792236328125, 0.0740...

embed

1746743_c0

1746743

haskell

0

Title: Extending an existing type in OCaml Problem title: Extending an existing type in OCaml Tags: type-systems, functional-programming, ocaml, haskell, types Problem: Extending an existing type in OCaml I've been doing some OCaml programming lately to learn the language and to get more acquainted with functional prog...

Extending an existing type in OCaml Extending an existing type in OCaml type-systems functional-programming ocaml haskell types Extending OCaml Xor Not Nop Extending an existing type in OCaml I've been doing some OCaml programming lately to learn the language and to get more acquainted with functional programming. Rece...

[ -0.000152587890625, 0.023681640625, 0.006591796875, 0.0380859375, -0.00518798828125, 0.0074462890625, -0.0272216796875, 0.0093994140625, -0.0142822265625, -0.03515625, 0.00823974609375, 0.00015544891357421875, 0.0086669921875, -0.01043701171875, -0.009521484375, -0.01116943359375, 0....

[ 5443, 67, 33770, 144573, 10644, 180, 105272, 141, 23, 16751, 123309, 28966, 36, 9779, 1556, 142508, 52895, 1193, 748, 11205, 438, 254, 56037, 37838, 30698, 46876, 5351, 1884, 19048, 65042, 88303, 10002, 3444, 15190, 20117, 47, 4734, 3525, 3...

[ 0.1165771484375, 0.169921875, 0.03692626953125, 0.220703125, 0.2423095703125, 0.095947265625, 0.1781005859375, 0.137451171875, 0.04278564453125, 0.069091796875, 0.140380859375, 0.0718994140625, 0.0235137939453125, 0.1087646484375, 0.05450439453125, 0.2205810546875, 0.187744140625, ...

embed

37936081_c0

37936081

haskell

0

Title: What is required to extend an Untyped Lambda calculus implementation to cover the Simply Typed Lambda Calculus? Problem title: What is required to extend an Untyped Lambda calculus implementation to cover the Simply Typed Lambda Calculus? Tags: lambda-calculus, scheme, system-f, haskell Problem: What is required...

What is required to extend an Untyped Lambda calculus implementation to cover the Simply Typed Lambda Calculus? What is required to extend an Untyped Lambda calculus implementation to cover the Simply Typed Lambda Calculus? lambda-calculus scheme system-f haskell What Untyped Lambda Simply Typed Calculus What is requir...

[ 0.0106201171875, 0.01153564453125, 0.0238037109375, 0.00732421875, 0.004425048828125, -0.0244140625, 0.003997802734375, 0.006317138671875, -0.006500244140625, -0.0308837890625, -0.007049560546875, -0.0517578125, -0.02490234375, 0.0020599365234375, 0.0064697265625, 0.00885009765625, -...

[ 4865, 56065, 65042, 992, 50986, 71, 122930, 85, 44805, 223, 208124, 29256, 55331, 538, 60457, 212467, 21, 6492, 6827, 94739, 150370, 5426, 420, 1556, 142508, 39162, 22553, 29479, 29481, 56, 23, 361, 124519, 34702, 282, 56458, 20625, 5337, 1...

[ 0.05377197265625, 0.1739501953125, 0.1890869140625, 0.1190185546875, 0.2286376953125, 0.04315185546875, 0.1739501953125, 0.1336669921875, 0.1922607421875, 0.07476806640625, 0.1468505859375, 0.112060546875, 0.1416015625, 0.055511474609375, 0.2239990234375, 0.2020263671875, 0.015518188...

embed

22105637_c0

22105637

haskell

0

Title: How to make "liftM2 (+) (T 1) (T 2)" working to produce "T 3" for "newtype T = T Int" Problem title: How to make "liftM2 (+) (T 1) (T 2)" working to produce "T 3" for "newtype T = T Int" Tags: applicative, monads, haskell Problem: How to make "liftM2 (+...

How to make "liftM2 (+) (T 1) (T 2)" working to produce "T 3" for "newtype T = T Int" How to make "liftM2 (+) (T 1) (T 2)" working to produce "T 3" for "newtype T = T Int" applicative monads haskell How liftM2 Monad myLiftT2 How to make "liftM2 (+) (T 1) (T 2)...

[ -0.027587890625, 0.0030364990234375, 0.00531005859375, 0.0216064453125, 0.00689697265625, 0.00616455078125, -0.006805419921875, -0.006072998046875, 0.017822265625, -0.031982421875, 0.02490234375, -0.01446533203125, 0.005096435546875, 0.0137939453125, -0.0003376007080078125, -0.01745605...

[ 11249, 3249, 104501, 594, 304, 22183, 618, 4879, 4958, 20697, 27489, 138, 50986, 384, 360, 18, 54936, 41816, 4935, 2667, 712, 1556, 142508, 60520, 60331, 71, 759, 9506, 2480, 10644, 61924, 35064, 3444, 137565, 892, 1505, 23, 41018, 142424, ...

[ 0.034698486328125, 0.07440185546875, 0.2088623046875, 0.1593017578125, 0.181396484375, 0.16015625, 0.1363525390625, 0.09130859375, 0.10760498046875, 0.0885009765625, 0.1192626953125, 0.1568603515625, 0.1732177734375, 0.1556396484375, 0.053955078125, 0.072021484375, 0.000579833984375,...

embed

43049205_c0

43049205

haskell

0

Title: How can I read a file and convert the content in [[Char]],? - IO String to String Problem title: How can I read a file and convert the content in [[Char]],? - IO String to String Tags: list, haskell Problem: How can I read a file and convert the content in [[Char]],? - IO String to String I have a file like this...

How can I read a file and convert the content in [[Char]],? - IO String to String How can I read a file and convert the content in [[Char]],? - IO String to String list haskell How Char file.txt Couldn Expected Actual How can I read a file and convert the content in [[Char]],? - IO String to String I have a file like t...

[ -0.013916015625, -0.01544189453125, -0.003936767578125, 0.0211181640625, -0.00689697265625, 0.0245361328125, 0.0015106201171875, -0.0054931640625, -0.005462646484375, -0.00112152099609375, -0.002410888671875, -0.03271484375, -0.010498046875, 0.018310546875, 0.0023040771484375, -0.00762...

[ 11249, 831, 12301, 11435, 136, 96760, 10941, 23, 84068, 86245, 17780, 23351, 214, 47, 87, 10, 5303, 1556, 142508, 21656, 124326, 191147, 19, 60075, 13, 89829, 100582, 1884, 3871, 64549, 34479, 97259, 123276, 135401, 37842, 217063, 26008, 2821...

[ 0.0687255859375, 0.09320068359375, 0.2327880859375, 0.2020263671875, 0.06884765625, 0.1710205078125, 0.2042236328125, 0.1412353515625, 0.263916015625, 0.030242919921875, 0.1966552734375, 0.1859130859375, 0.12646484375, 0.1363525390625, 0.0241546630859375, 0.0253448486328125, 0.177734...

embed

48412023_c0

48412023

haskell

0

Title: Regarding (When Executed) in Haskell IO Monad Problem title: Regarding (When Executed) in Haskell IO Monad Tags: haskell, io, function Problem: Regarding (When Executed) in Haskell IO Monad I have no problem with the IO Monad. But I want to understand the followings: In All/almost Haskell tutorials/ text books t...

Regarding (When Executed) in Haskell IO Monad Regarding (When Executed) in Haskell IO Monad haskell io function Regarding When Executed Haskell Monad Regarding (When Executed) in Haskell IO Monad I have no problem with the IO Monad. But I want to understand the followings: In All/almost Haskell tutorials/ text books th...

[ 0.003814697265625, 0.0108642578125, 0.015869140625, 0.0177001953125, 0.0157470703125, 0.017333984375, 0.00167083740234375, -0.00946044921875, -0.002899169921875, -0.01116943359375, 0.020263671875, -0.0281982421875, -0.0267333984375, -0.00115966796875, 0.00145721435546875, 0.00390625, ...

[ 180358, 214, 186048, 211603, 297, 23, 20625, 142508, 17780, 60331, 71, 1556, 22995, 32354, 14847, 110, 2967, 4966, 3444, 28219, 25632, 3164, 840, 57143, 7986, 42840, 13695, 54433, 2046, 84068, 83, 959, 10, 34166, 6637, 831, 12921, 16750, 96...

[ 0.1650390625, 0.16015625, 0.2132568359375, 0.281005859375, 0.1358642578125, 0.08306884765625, 0.152587890625, 0.253173828125, 0.280029296875, 0.1925048828125, 0.13330078125, 0.1292724609375, 0.26953125, 0.218017578125, 0.2095947265625, 0.03125, 0.0614013671875, 0.0160064697265625, ...

embed

59494015_c0

59494015

haskell

0

Title: How to declare that the composition of two types is a monad Problem title: How to declare that the composition of two types is a monad Tags: haskell Problem: How to declare that the composition of two types is a monad I have function: step :: forall m . (MonadState IntCodeState m) => m (Maybe ()) When I use do n...

How to declare that the composition of two types is a monad How to declare that the composition of two types is a monad haskell How MonadState IntCodeState Maybe StateT How to declare that the composition of two types is a monad I have function: When I use do notation in the body of the function, it uses m as the monad...

[ -0.027099609375, -0.00159454345703125, 0.01348876953125, 0.029541015625, -0.01025390625, 0.0146484375, -0.00579833984375, -0.006805419921875, 0.01092529296875, -0.01397705078125, 0.0030670166015625, 0.00677490234375, -0.00927734375, 0.0172119140625, -0.0101318359375, 0.0001745223999023...

[ 11249, 47, 159978, 450, 166577, 6626, 52895, 83, 10, 2667, 712, 70, 1556, 142508, 60331, 71, 135206, 360, 18, 114211, 83425, 22836, 618, 32354, 4527, 54, 110, 22062, 14361, 347, 237, 41206, 20653, 3444, 17368, 28219, 36510, 20625, 161549, ...

[ 0.08380126953125, 0.0168304443359375, 0.2391357421875, 0.0535888671875, 0.256103515625, 0.1710205078125, 0.25048828125, 0.1134033203125, 0.111083984375, 0.165771484375, 0.2178955078125, 0.005035400390625, 0.0968017578125, 0.232666015625, 0.1412353515625, 0.08258056640625, 0.129638671...

embed

17051790_c0

17051790

haskell

0

Title: Debugging "too few bytes" error in GHCI Problem title: Debugging "too few bytes" error in GHCI Tags: haskell Problem: Debugging "too few bytes" error in GHCI I'm running a bunch of Get monads with runGetState at various points in my code. They run on a lazy ByteString returned by readFile . T...

Debugging "too few bytes" error in GHCI Debugging "too few bytes" error in GHCI haskell Debugging GHCI Get ByteString Failed Debugging "too few bytes" error in GHCI I'm running a bunch of Get monads with runGetState at various points in my code. They run on a lazy ByteString returned by readFile . T...

[ 0.0098876953125, 0.0091552734375, 0.0002422332763671875, -0.00011348724365234375, -0.006378173828125, 0.004150390625, 0.004364013671875, -0.00030517578125, -0.0108642578125, -0.0018768310546875, 0.026123046875, -0.0123291015625, -0.019287109375, -0.006256103515625, 0.00653076171875, 0....

[ 262, 978, 36659, 24838, 10846, 390, 1636, 18499, 41877, 17304, 1556, 142508, 20779, 3311, 67, 71713, 190355, 23, 51042, 147306, 2667, 712, 678, 11675, 724, 126, 135206, 26847, 18151, 21, 3285, 214, 176377, 12301, 174350, 5201, 32354, 11782, ...

[ 0.0814208984375, 0.1732177734375, 0.037261962890625, 0.14990234375, 0.2132568359375, 0.1549072265625, 0.151123046875, 0.1611328125, 0.1400146484375, 0.2098388671875, 0.06585693359375, 0.187255859375, 0.1116943359375, 0.09326171875, 0.109130859375, 0.10736083984375, 0.1160888671875, ...

embed

60681850_c1

60681850

haskell

1

make -shared -dynamic-too -fPIC -package-name adventlib System/IO/Advent.hs System/IO/Test.hs -o libHSadventlib.a -dyno libHSadventlib-ghc8.6.5.so Then it seems to fail linking the static library (I guess it is trying to link it as dynamic but using static objects): cd src; ghc --make -shared -dynamic-too -fPIC -packag...

trying to compile a haskell package without using cabal Given a correct .conf file, this seems to work The last two lines test that I can compile an executable binary and link the library both statically and dynamically. Reading the docs it seems that it should be possible to use -dynamic-too to combine the first two ...

[ -0.004669189453125, 0.00131988525390625, 0.01220703125, -0.00433349609375, -0.0203857421875, -0.01202392578125, -0.033203125, 0.00421142578125, -0.0115966796875, 0.007476806640625, -0.004119873046875, -0.0201416015625, 0.003997802734375, 0.0087890625, 0.004302978515625, -0.001029968261...

[ 31577, 9969, 1340, 1556, 142508, 98169, 15490, 17368, 109524, 26785, 70547, 11435, 37202, 4488, 4568, 124519, 3034, 71924, 2886, 2394, 6635, 3126, 35773, 1294, 13254, 84079, 7722, 4527, 20, 242554, 24838, 70163, 5117, 6626, 11001, 31380, 238, ...

[ 0.02471923828125, 0.1234130859375, 0.1279296875, 0.1202392578125, 0.21240234375, 0.15478515625, 0.0421142578125, 0.012969970703125, 0.182373046875, 0.022979736328125, 0.1727294921875, 0.1534423828125, 0.001739501953125, 0.0491943359375, 0.03662109375, 0.113037109375, 0.0543212890625,...

embed

60784681_c0

60784681

haskell

0

Title: How to extract a single value from a JSON object with a single "key-value"? Problem title: How to extract a single value from a JSON object with a single "key-value"? Tags: json, haskell Problem: How to extract a single value from a JSON object with a single "key-value"? An Http server return...

How to extract a single value from a JSON object with a single "key-value"? How to extract a single value from a JSON object with a single "key-value"? json haskell MyError a qualified How JSON some_value Data.ByteString Data.Text Data.Aeson Aeson func1 Either BS.ByteString Aeson.decode Just Aeson.O...

[ -0.0018768310546875, -0.0017852783203125, -0.00689697265625, -0.003143310546875, 0.00146484375, -0.00189208984375, -0.013671875, 0.00604248046875, -0.0011749267578125, -0.00933837890625, 0.007354736328125, 0.0036163330078125, 0.0004024505615234375, -0.007049560546875, 0.0098876953125, ...

[ 11249, 47, 125663, 11001, 34292, 1295, 821, 58627, 36746, 678, 19770, 9, 27494, 13, 1647, 1681, 1556, 142508, 2646, 18468, 31611, 217225, 3060, 11809, 75358, 67, 71713, 174379, 90, 191, 62, 7477, 418, 9319, 84145, 112, 40899, 9563, 75161, ...

[ 0.06121826171875, 0.00177001953125, 0.211669921875, 0.2288818359375, 0.2154541015625, 0.0902099609375, 0.1512451171875, 0.228515625, 0.1842041015625, 0.06207275390625, 0.1749267578125, 0.03411865234375, 0.212158203125, 0.0228118896484375, 0.08795166015625, 0.16650390625, 0.0705566406...

embed

18251054_c0

18251054

haskell

0

Title: Using Netwire to spawn lists from a value Problem title: Using Netwire to spawn lists from a value Tags: haskell, netwire Problem: Using Netwire to spawn lists from a value I think I'm fundamentally misunderstanding how to attack this type of problem with Netwire: I have the following test-case: I'd like to take...

Using Netwire to spawn lists from a value Using Netwire to spawn lists from a value haskell netwire a Control.Wire Using Netwire Wire Left Right Using Netwire to spawn lists from a value I think I'm fundamentally misunderstanding how to attack this type of problem with Netwire: I have the following test-case: I'd like ...

[ -0.0115966796875, 0.00421142578125, -0.01055908203125, 0.023681640625, -0.0269775390625, 0.00872802734375, 0.02001953125, -0.0306396484375, 0.0037384033203125, -0.03125, -0.00136566162109375, -0.005645751953125, 0.000896453857421875, 0.0166015625, 0.00193023681640625, -0.00518798828125...

[ 345, 10086, 17084, 13, 5623, 7710, 5303, 7, 1295, 34292, 1556, 142508, 2043, 27131, 57124, 3336, 90911, 5351, 20531, 1239, 24658, 52875, 2967, 3034, 58437, 1884, 5646, 79315, 65450, 3934, 124519, 28412, 12638, 13315, 82230, 126371, 132283, 17...

[ 0.05706787109375, 0.1339111328125, 0.2401123046875, 0.1370849609375, 0.15478515625, 0.1463623046875, 0.217041015625, 0.04412841796875, 0.1138916015625, 0.2159423828125, 0.1024169921875, 0.2060546875, 0.09326171875, 0.1834716796875, 0.154052734375, 0.159423828125, 0.042877197265625, ...

embed

31636962_c0

31636962

haskell

0

Title: How to use Int with the optparse-applicative inside a data constructor? Problem title: How to use Int with the optparse-applicative inside a data constructor? Tags: haskell Problem: How to use Int with the optparse-applicative inside a data constructor? I would like to use the optparse-applicative package to add...

How to use Int with the optparse-applicative inside a data constructor? How to use Int with the optparse-applicative inside a data constructor? haskell Options.Applicative Control.Monad.Trans.Reader How Configuration Main Parser ARG1 ARG2 How to use Int with the optparse-applicative inside a data constructor? I would l...

[ 0.00119781494140625, 0.01239013671875, -0.0003509521484375, 0.021240234375, 0.01141357421875, 0.01025390625, 0.0130615234375, -0.025146484375, 0.00927734375, -0.0152587890625, -0.01220703125, -0.01708984375, 0.01312255859375, 0.0206298828125, -0.0025787353515625, -0.007659912109375, ...

[ 11249, 47, 4527, 360, 18, 678, 43922, 2500, 184, 9007, 11048, 4935, 46132, 2053, 64549, 748, 1556, 142508, 152448, 39179, 27131, 46674, 712, 62624, 31345, 59994, 12321, 2392, 2189, 48802, 418, 304, 1884, 98169, 15190, 75101, 13315, 10750, 1...

[ 0.07562255859375, 0.010650634765625, 0.1361083984375, 0.1802978515625, 0.231689453125, 0.1519775390625, 0.1986083984375, 0.1787109375, 0.1461181640625, 0.092529296875, 0.1336669921875, 0.1041259765625, 0.15234375, 0.1187744140625, 0.1986083984375, 0.13671875, 0.087646484375, 0.2072...

embed

32682317_c0

32682317

haskell

0

Title: GStreamer plugin usage in Haskell Problem title: GStreamer plugin usage in Haskell Tags: haskell, gstreamer, plugins, opengl Problem: GStreamer plugin usage in Haskell I'm trying to get the image from a webcam with GStreamer and load it to an OpenGL texture. I'm using the gstreamer haskell library. I managed to ...

GStreamer plugin usage in Haskell GStreamer plugin usage in Haskell haskell gstreamer plugins opengl qualified GStreamer Haskell v4l2src gst_app_sink_pull_sample Media.Streaming.GStreamer GS.init GS.pluginLoadByName GS.registryLookupFeature GS.defaultRegistry Element GS.elementFactoryMake Just GStreamer plugin usage in...

[ 0.0015869140625, 0.0263671875, -0.0205078125, -0.0026702880859375, 0.00897216796875, 0.026123046875, 0.008544921875, -0.0262451171875, -0.01312255859375, -0.04638671875, 0.000046253204345703125, -0.033935546875, -0.0036468505859375, 0.0017547607421875, -0.0213623046875, 0.0087890625, ...

[ 527, 115061, 56, 69993, 127689, 20625, 142508, 1556, 706, 86429, 9803, 11016, 217225, 617, 141, 304, 19437, 57348, 9007, 7, 14068, 6645, 433, 33209, 4794, 724, 74356, 217, 145301, 15363, 49005, 214810, 54601, 48325, 62766, 135518, 29569, 2191...

[ 0.150634765625, 0.26025390625, 0.187255859375, 0.257080078125, 0.1156005859375, 0.13916015625, 0.23193359375, 0.1077880859375, 0.0616455078125, 0.23046875, 0.050750732421875, 0.11865234375, 0.1221923828125, 0.06378173828125, 0.03741455078125, 0.0540771484375, 0.125244140625, 0.1831...

embed

32894595_c0

32894595

haskell

0

Title: Why does feeding init to last not work in Haskell? Problem title: Why does feeding init to last not work in Haskell? Tags: haskell, function-composition, list Problem: Why does feeding init to last not work in Haskell? So I'm writing a line to get the second to last element of a list. Initially my code was mySLa...

Why does feeding init to last not work in Haskell? Why does feeding init to last not work in Haskell? haskell function-composition list it Why Haskell last.take last.init Couldn Integer Relevant Possible Why does feeding init to last not work in Haskell? So I'm writing a line to get the second to last element of a list...

[ -0.01409912109375, 0.0081787109375, 0.01318359375, 0.019287109375, -0.003173828125, 0.0177001953125, 0.00531005859375, -0.01055908203125, 0.005401611328125, -0.0262451171875, 0.01068115234375, 0.001129150390625, 0.007080078125, 0.0185546875, -0.0025787353515625, -0.0186767578125, 0.0...

[ 44084, 61590, 214, 23, 217, 47, 4568, 959, 4488, 20625, 142508, 1556, 32354, 277, 40322, 5303, 442, 78219, 73, 191147, 19, 44401, 133, 30624, 115861, 14602, 32562, 13315, 2046, 17932, 12830, 18151, 130078, 79786, 1257, 24189, 5120, 759, 564...

[ 0.1107177734375, 0.2064208984375, 0.1121826171875, 0.1143798828125, 0.1746826171875, 0.131103515625, 0.2110595703125, 0.1195068359375, 0.1500244140625, 0.1416015625, 0.215576171875, 0.1058349609375, 0.1593017578125, 0.019622802734375, 0.07098388671875, 0.1220703125, 0.02130126953125,...

embed

34966840_c0

34966840

haskell

0

Title: Polymorphic max heap in Haskell Problem title: Polymorphic max heap in Haskell Tags: haskell, heap Problem: Polymorphic max heap in Haskell The following example is my attempt at solving "take N most frequent words" in Haskell . I'd like to make heap function to work for both String and Text . It works for any o...

Polymorphic max heap in Haskell Polymorphic max heap in Haskell haskell heap Data.MultiSet Data.String Data.Tuple Data.Text qualified Polymorphic Haskell Text Couldn H.Heap H.FstMaxPolicy Occur LANGUAGE OverloadedStrings ExplicitForAll Main Data.Heap H.take H.insert H.empty T.swap M.insert M.empty IsString Polymorphic ...

[ 0.004425048828125, -0.003509521484375, -0.01336669921875, 0.0025482177734375, 0.00531005859375, 0.01513671875, 0.01531982421875, -0.0196533203125, 0.01385498046875, -0.03759765625, 0.00830078125, -0.026123046875, 0.02783203125, 0.013916015625, -0.0012969970703125, -0.0341796875, -0.0...

[ 63306, 178851, 18389, 764, 2631, 20625, 142508, 1556, 11809, 50657, 118, 294, 126, 71713, 8705, 174379, 217225, 24129, 191147, 572, 13025, 271, 71346, 106144, 16820, 98064, 9578, 63033, 60923, 43512, 12321, 78219, 33657, 33548, 634, 254, 2071, ...

[ 0.1710205078125, 0.1962890625, 0.20849609375, 0.192626953125, 0.177734375, 0.1510009765625, 0.2413330078125, 0.1337890625, 0.068603515625, 0.036041259765625, 0.00506591796875, 0.0274810791015625, 0.019866943359375, 0.0980224609375, 0.006927490234375, 0.096435546875, 0.0924072265625, ...

embed

36066033_c1

36066033

haskell

1

'algorithm' exampleInt :: MyMonad Int exampleInt = example -- assuming for example type A = () type B = Identity type C = () In the above code I am stuck at: test.hs:23:25: Illegal instance declaration for ‘ConfM d (MyStateT d m)’ (All instance types must be of the form (T a1 ... an) where a1 ... an are *distinct type...

[ -0.037841796875, -0.00982666015625, 0.0162353515625, 0.01446533203125, 0.0024871826171875, 0.01806640625, -0.0012969970703125, -0.015625, 0.00537109375, -0.0167236328125, 0.0034332275390625, 0.0031280517578125, -0.005889892578125, 0.0027618408203125, -0.0155029296875, -0.0216064453125,...

[ 100628, 2783, 18337, 27781, 4153, 18, 2646, 46674, 712, 360, 66596, 10644, 62, 335, 71257, 2481, 313, 36917, 18151, 444, 179933, 99, 3034, 127, 24864, 21224, 891, 86966, 110527, 21635, 11935, 420, 594, 104, 31852, 135206, 618, 347, 43512, ...

[ 0.086669921875, 0.10791015625, 0.1025390625, 0.259521484375, 0.130615234375, 0.152587890625, 0.1201171875, 0.1197509765625, 0.147705078125, 0.09466552734375, 0.07244873046875, 0.1429443359375, 0.0380859375, 0.053375244140625, 0.168212890625, 0.05975341796875, 0.042755126953125, 0.0...

embed

46455462_c0

46455462

haskell

0

Title: GHCI infinite loop in Binary Search Tree Problem title: GHCI infinite loop in Binary Search Tree Tags: ghci, haskell Problem: GHCI infinite loop in Binary Search Tree I have this implementation of a Binary Search Tree in Haskell data BST = Nil | Node (BST) Int (BST) deriving Show emptyTree :: BST emptyTree = Nil...

GHCI infinite loop in Binary Search Tree GHCI infinite loop in Binary Search Tree ghci haskell GHCI Binary Search Tree BST Nil Node Show Bool Empty insert_r GHCI infinite loop in Binary Search Tree I have this implementation of a Binary Search Tree in Haskell I'm trying to test it inserting some values into the tree. T...

[ 0.0185546875, -0.000385284423828125, 0.01953125, -0.0086669921875, 0.0244140625, 0.0087890625, -0.0014190673828125, -0.0137939453125, -0.0002918243408203125, -0.0361328125, 0.0223388671875, -0.006134033203125, 0.0035552978515625, 0.0091552734375, 0.02587890625, 0.0240478515625, 0.018...

[ 41877, 17304, 54241, 13, 40956, 54092, 1294, 33086, 101344, 31380, 318, 1556, 142508, 335, 8545, 77175, 438, 112, 17367, 2460, 929, 31678, 183540, 42, 208124, 20625, 31577, 3034, 142424, 53201, 121413, 134234, 944, 9790, 11675, 527, 73265, 14...

[ 0.1510009765625, 0.161865234375, 0.1614990234375, 0.05401611328125, 0.1983642578125, 0.173583984375, 0.0843505859375, 0.1795654296875, 0.221435546875, 0.0859375, 0.09814453125, 0.07763671875, 0.220947265625, 0.0207061767578125, 0.158203125, 0.1739501953125, 0.1070556640625, 0.08691...

embed

33185222_c0

33185222

haskell

0

Title: Make a type be either one type or another Problem title: Make a type be either one type or another Tags: haskell Problem: Make a type be either one type or another I'm a beginner in Haskell playing around with parsing and building an AST. I wonder how one would go about defining types like the following: A Value...

Make a type be either one type or another Make a type be either one type or another haskell Make Value Identifier Literal Lit Assignment Asgn How ValueId ValueLit Make a type be either one type or another I'm a beginner in Haskell playing around with parsing and building an AST. I wonder how one would go about defining...

[ 0.00384521484375, -0.003387451171875, -0.006622314453125, 0.0216064453125, -0.015625, 0.0042724609375, -0.030029296875, -0.001373291015625, 0.017578125, -0.01104736328125, 0.00003981590270996094, -0.01043701171875, -0.0023651123046875, -0.01458740234375, -0.01092529296875, 0.0223388671...

[ 26176, 10644, 186, 40101, 1632, 707, 15700, 10, 1556, 142508, 190060, 189543, 56, 135940, 141, 27668, 1301, 31304, 177, 11249, 568, 71, 866, 217, 9842, 1679, 20625, 75169, 10932, 366, 33976, 48963, 32195, 13204, 449, 52895, 1884, 25632, 62,...

[ 0.11279296875, 0.2919921875, 0.10748291015625, 0.1065673828125, 0.133056640625, 0.04400634765625, 0.103759765625, 0.03839111328125, 0.134033203125, 0.2420654296875, 0.291259765625, 0.212158203125, 0.1307373046875, 0.1865234375, 0.113525390625, 0.171875, 0.037506103515625, 0.1995849...

embed

59620798_c0

59620798

haskell

0

Title: How are Generalized Authentication Combinators Documented with swagger2 and servant Problem title: How are Generalized Authentication Combinators Documented with swagger2 and servant Tags: haskell, servant, swagger Problem: How are Generalized Authentication Combinators Documented with swagger2 and servant I hav...

How are Generalized Authentication Combinators Documented with swagger2 and servant How are Generalized Authentication Combinators Documented with swagger2 and servant haskell servant swagger How Generalized Authentication Combinators Documented swagger2 AuthUser auth_user_id Int64 auth_user_email Text Show Generic Aut...

[ -0.0250244140625, 0.00994873046875, -0.006866455078125, -0.02978515625, -0.01416015625, 0.01806640625, -0.0098876953125, -0.01446533203125, -0.002166748046875, 0.0023193359375, 0.01416015625, 0.0003986358642578125, 0.0125732421875, -0.002777099609375, -0.00616455078125, -0.002014160156...

[ 11249, 9082, 29367, 52236, 63250, 120639, 106935, 76, 22230, 43101, 297, 678, 68062, 21407, 304, 136, 187646, 621, 1556, 142508, 5655, 927, 1062, 531, 65918, 13307, 25501, 24129, 17367, 88342, 193348, 137989, 127942, 146968, 618, 20625, 294, ...

[ 0.07861328125, 0.1656494140625, 0.1466064453125, 0.1453857421875, 0.1702880859375, 0.055145263671875, 0.201416015625, 0.136474609375, 0.111328125, 0.2220458984375, 0.03948974609375, 0.1241455078125, 0.197265625, 0.226318359375, 0.1861572265625, 0.08453369140625, 0.263671875, 0.0304...

embed

17741624_c1

17741624

haskell

1

. MArray (STUArray s) a (S.ST s)) => HasSTU a type AC a = (HasSTU a) => forall s. a -> S.ST s (STUArray s Int a) type AU a = (HasSTU a) => forall s. STUArray s Int a -> S.ST s () type TX a = (HasSTU a) => a -> a -- or without the context data ArrayGen a = AG (AC a) (AU a) (TX a) Then this fails: instance (HasSTU a) => ...

[ -0.021484375, 0.0146484375, 0.01263427734375, -0.01202392578125, 0.00518798828125, -0.0296630859375, 0.012451171875, -0.0196533203125, 0.010009765625, -0.020751953125, -0.00897216796875, 0.0303955078125, 0.00946044921875, -0.005157470703125, 0.0038909912109375, -0.00921630859375, -0....

[ 5, 9267, 42, 7092, 94432, 7614, 91, 10, 294, 8545, 20625, 10644, 12944, 6495, 100, 5584, 159, 360, 57488, 134929, 54047, 15490, 43701, 2053, 69253, 105376, 24639, 15012, 20000, 35782, 110527, 7, 222518, 29038, 23613, 62346, 339, 16428, 187,...

[ 0.01220703125, 0.0208892822265625, 0.050994873046875, 0.276611328125, 0.24560546875, 0.06439208984375, 0.12890625, 0.1966552734375, 0.0733642578125, 0.163818359375, 0.124755859375, 0.11865234375, 0.1212158203125, 0.1097412109375, 0.03680419921875, 0.1151123046875, 0.03533935546875, ...

embed

40795502_c0

40795502

haskell

0

Title: I/O Monad and ByteString to Char conversion? Problem title: I/O Monad and ByteString to Char conversion? Tags: haskell, io, monads Problem: I/O Monad and ByteString to Char conversion? I'm testing some HTTP requests in haskell and have the below methods: import qualified Data.ByteString.Lazy as LAZ import Langua...

I/O Monad and ByteString to Char conversion? I/O Monad and ByteString to Char conversion? haskell io monads qualified Language.Haskell.TH.Ppr System.IO Data.Word Monad ByteString Char Data.ByteString.Lazy LAZ Word8 LAZ.ByteString www.url.com LAZ.unpack I/O Monad and ByteString to Char conversion? I'm testing some HTTP ...

[ 0.01019287109375, 0.022216796875, 0.01025390625, 0.00109100341796875, 0.0007476806640625, 0.021728515625, -0.00537109375, -0.0279541015625, -0.0069580078125, -0.0052490234375, 0.017822265625, -0.040283203125, -0.0157470703125, 0.0130615234375, -0.0224609375, 0.00433349609375, 0.00515...

[ 87, 64, 670, 60331, 71, 136, 3311, 67, 71713, 214, 47, 21656, 142477, 32, 1556, 142508, 22995, 2667, 712, 7, 217225, 83658, 6495, 23415, 10287, 12353, 17780, 11809, 164805, 75358, 2729, 3285, 339, 17200, 22543, 1019, 25002, 277, 309, 2910...

[ 0.066162109375, 0.194580078125, 0.161865234375, 0.1971435546875, 0.1700439453125, 0.11083984375, 0.11083984375, 0.162109375, 0.2254638671875, 0.1331787109375, 0.123779296875, 0.2291259765625, 0.1993408203125, 0.00823974609375, 0.1136474609375, 0.2491455078125, 0.1971435546875, 0.13...

embed

71010972_c0

71010972

haskell

0

Title: How does Haskell pick a type for an ambiguous expression Problem title: How does Haskell pick a type for an ambiguous expression Tags: types, type-inference, haskell Problem: How does Haskell pick a type for an ambiguous expression If an expression can be typed in several ways, how does Haskell pick which one to...

How does Haskell pick a type for an ambiguous expression How does Haskell pick a type for an ambiguous expression types type-inference haskell Data.Ratio How Haskell GHCi www.haskell.org Prelude Ratio RealFrac Read Double Float Integer How does Haskell pick a type for an ambiguous expression If an expression can be typ...

[ -0.002532958984375, -0.0203857421875, 0.00286865234375, 0.0078125, 0.0133056640625, -0.008056640625, -0.0011138916015625, 0.0089111328125, 0.011474609375, 0.0147705078125, 0.0014190673828125, -0.0198974609375, 0.004547119140625, -0.0225830078125, 0.0191650390625, 0.007354736328125, 0...

[ 11249, 14602, 20625, 142508, 39580, 10644, 100, 920, 12282, 10821, 125195, 52895, 69988, 1556, 11809, 1052, 28645, 14, 10557, 1914, 822, 2552, 5565, 5120, 919, 20251, 4764, 107172, 38699, 44401, 831, 40368, 48322, 3642, 4527, 48120, 27781, 11...

[ 0.0914306640625, 0.008544921875, 0.139892578125, 0.265380859375, 0.1810302734375, 0.2431640625, 0.0435791015625, 0.1298828125, 0.1923828125, 0.0673828125, 0.227294921875, 0.18603515625, 0.1282958984375, 0.09765625, 0.043121337890625, 0.0543212890625, 0.1019287109375, 0.029907226562...

embed

67067754_c1

67067754

haskell

1

The name WhileT is after C's while . It can be easily seen that WhileT Identity is a monad. But what about other choices of m ? In particular, judging by some experiments, WhileT Maybe seems to be equivalent to ZipList . But it is already known that there is no instance Monad ZipList . Does this mean WhileT isn't real...

[ -0.0096435546875, 0.01043701171875, 0.0235595703125, 0.022216796875, 0.0235595703125, -0.00909423828125, -0.0086669921875, -0.020751953125, 0.0064697265625, -0.00885009765625, -0.006927490234375, 0.0233154296875, -0.0299072265625, 0.008056640625, 0.00095367431640625, -0.003860473632812...

[ 9351, 51404, 618, 83, 7103, 313, 25, 7, 12960, 6, 831, 186, 72546, 51592, 71257, 2481, 10, 2667, 712, 3789, 44126, 111, 347, 360, 4, 9966, 390, 28007, 83425, 37202, 47, 183234, 162150, 154663, 442, 21771, 51529, 110, 110527, 60331, 71, ...

[ 0.1119384765625, 0.28369140625, 0.274658203125, 0.055023193359375, 0.140625, 0.10760498046875, 0.026092529296875, 0.0251922607421875, 0.282470703125, 0.00970458984375, 0.0140228271484375, 0.009918212890625, 0.08563232421875, 0.04437255859375, 0.228759765625, 0.1497802734375, 0.042633...

embed

67408728_c0

67408728

haskell

0

Title: How does polymorphic recursion relate to infinite type errors? Problem title: How does polymorphic recursion relate to infinite type errors? Tags: haskell Problem: How does polymorphic recursion relate to infinite type errors? Context: I ran into a problem and got help here , however I realized I don't understan...

How does polymorphic recursion relate to infinite type errors? How does polymorphic recursion relate to infinite type errors? haskell How Param CmdParams arg:args Occurs How does polymorphic recursion relate to infinite type errors? Context: I ran into a problem and got help here , however I realized I don't understand...

[ -0.00640869140625, -0.00994873046875, 0.002685546875, 0.01287841796875, -0.0015411376953125, 0.0191650390625, 0.00186920166015625, -0.0106201171875, 0.00064849853515625, -0.028076171875, 0.0172119140625, -0.04296875, -0.005462646484375, 0.007080078125, 0.00848388671875, -0.016479492187...

[ 11249, 35874, 178851, 1771, 195625, 1830, 33444, 13, 54241, 10644, 18499, 7, 1556, 142508, 1720, 39, 54686, 28636, 8256, 79459, 61477, 48650, 14602, 47, 13028, 3934, 2967, 4358, 185171, 28219, 29806, 166117, 135179, 17569, 18344, 7569, 83, 13...

[ 0.057159423828125, 0.199462890625, 0.20703125, 0.06640625, 0.21923828125, 0.1015625, 0.1214599609375, 0.085693359375, 0.1400146484375, 0.1851806640625, 0.2247314453125, 0.062103271484375, 0.104248046875, 0.2047119140625, 0.08154296875, 0.038055419921875, 0.1405029296875, 0.08587646...

embed

29684482_c0

29684482

haskell

0

Title: Can I coerce an existentially quantified argument in a type constructor? Problem title: Can I coerce an existentially quantified argument in a type constructor? Tags: types, existential-type, gadt, haskell Problem: Can I coerce an existentially quantified argument in a type constructor? I have a data type whose ...

Can I coerce an existentially quantified argument in a type constructor? Can I coerce an existentially quantified argument in a type constructor? types existential-type gadt haskell Can LogEvent ToJSON Date Category LogLevel ThreadId Result Foo Can I coerce an existentially quantified argument in a type constructor? I ...

[ -0.005706787109375, 0.02294921875, -0.005218505859375, -0.000385284423828125, 0.0038909912109375, -0.01177978515625, -0.0027618408203125, 0.0283203125, 0.00640869140625, -0.03173828125, 0.012939453125, -0.004119873046875, -0.01458740234375, 0.0023040771484375, -0.023681640625, -0.02368...

[ 4171, 552, 56, 329, 99707, 14, 25958, 55230, 47314, 10750, 10644, 64549, 748, 87, 23, 52895, 15403, 50986, 914, 13384, 1556, 142508, 13146, 192134, 717, 1375, 58627, 25512, 49057, 5267, 2601, 136719, 568, 71, 126684, 9572, 31, 2053, 6953, ...

[ 0.0947265625, 0.120361328125, 0.1907958984375, 0.1162109375, 0.1795654296875, 0.047119140625, 0.066650390625, 0.164794921875, 0.111328125, 0.2349853515625, 0.2276611328125, 0.1788330078125, 0.1268310546875, 0.0216064453125, 0.016510009765625, 0.1590576171875, 0.094482421875, 0.1529...

embed

59124802_c1

59124802

haskell

1

overlooked something obvious - however can you help point it out? For completeness: on OS X, 10.15.1 stack --version : Version 1.9.3, Git revision 40cf7b37526b86d1676da82167ea8758a854953b (6211 commits) x86_64 hpack-0.31.1 stack ghc -- --version : The Glorious Glasgow Haskell Compilation System, version 8.6.5 stack pa...

[ -0.005889892578125, 0.004486083984375, -0.0228271484375, 0.006134033203125, -0.020751953125, 0.0103759765625, -0.0145263671875, -0.003021240234375, -0.015380859375, 0.00811767578125, -0.00012874603271484375, -0.011474609375, -0.01141357421875, 0.001129150390625, 0.003021240234375, -0.0...

[ 645, 64747, 9844, 162520, 49903, 4358, 6275, 1810, 28484, 98, 11787, 1193, 147546, 156627, 177261, 46354, 40647, 99420, 363, 527, 217, 111666, 1112, 275, 85433, 4046, 15276, 11835, 85, 165066, 13, 11, 10057, 156204, 10837, 1662, 375, 4007, ...

[ 0.058349609375, 0.1571044921875, 0.0181732177734375, 0.194580078125, 0.041015625, 0.093017578125, 0.08709716796875, 0.0316162109375, 0.09417724609375, 0.09674072265625, 0.184814453125, 0.1639404296875, 0.1744384765625, 0.268798828125, 0.193359375, 0.130615234375, 0.1590576171875, 0...

embed

17562486_c0

17562486

haskell

0

Title: Extensible errors Problem title: Extensible errors Tags: error-handling, haskell Problem: Extensible errors Describe a problem in several words. Guess I have an algorithms to check something, and depending on algorithm it can fail with slightly different errors, for example: data Error1 = Error1 data Error2 = Er...

Extensible errors Extensible errors error-handling haskell testError Extensible Error1 Error2 Error3 Algorithm CanFailWith Something Maybe FirstAlgorithm Either SecondAlgorithm Left Right Error Extensible errors Describe a problem in several words. Guess I have an algorithms to check something, and depending on algorit...

[ 0.00396728515625, -0.006134033203125, 0.0034332275390625, 0.0062255859375, 0.013916015625, -0.000553131103515625, -0.02734375, -0.00860595703125, -0.000370025634765625, -0.02001953125, -0.002410888671875, -0.00860595703125, 0.0169677734375, 0.0169677734375, -0.00154876708984375, 0.0157...

[ 5443, 510, 55356, 18499, 54885, 1556, 142508, 3034, 18468, 212059, 304, 363, 109847, 2783, 4171, 17647, 379, 194583, 200905, 83425, 23972, 6504, 8962, 9319, 77648, 2480, 90911, 7, 34601, 2967, 40368, 34153, 96274, 765, 234873, 12765, 96819, 8...

[ 0.1239013671875, 0.2276611328125, 0.2235107421875, 0.2440185546875, 0.1279296875, 0.1129150390625, 0.205322265625, 0.121826171875, 0.1123046875, 0.1942138671875, 0.01593017578125, 0.121337890625, 0.09259033203125, 0.10003662109375, 0.05810546875, 0.115478515625, 0.0833740234375, 0....

embed

49903372_c1

49903372

haskell

1

(y :: k) (b :: Bool) | x y -> b data family HList (l::[*]) data instance HList '[] = HNil data instance HList (x ': xs) = x `HCons` HList xs deriving instance Eq (HList '[]) deriving instance (Eq x, Eq (HList xs)) => Eq (HList (x ': xs)) deriving instance Ord (HList '[]) deriving instance (Ord x, Ord (HList xs)) => Or...

[ 0.003387451171875, 0.00104522705078125, 0.00457763671875, -0.003753662109375, -0.004913330078125, 0.01043701171875, -0.03076171875, 0.00201416015625, 0.023193359375, 0.0101318359375, -0.0135498046875, -0.0255126953125, 0.009765625, 0.021728515625, -0.023193359375, -0.0185546875, 0.02...

[ 15, 53, 1984, 472, 275, 2460, 929, 58745, 1022, 113, 33079, 876, 2053, 14449, 572, 154663, 141, 12, 1639, 110527, 242, 1065, 2203, 79059, 379, 425, 73265, 5245, 7, 16406, 864, 48599, 1419, 35379, 6496, 143045, 167457, 335, 18507, 27544, ...

[ 0.039306640625, 0.1422119140625, 0.1524658203125, 0.13525390625, 0.1151123046875, 0.118896484375, 0.204833984375, 0.0611572265625, 0.1197509765625, 0.1585693359375, 0.1358642578125, 0.149658203125, 0.1661376953125, 0.170654296875, 0.1849365234375, 0.274658203125, 0.0693359375, 0.01...

embed

36971976_c0

36971976

haskell

0

Title: What's the best way to represent a short bit string? Problem title: What's the best way to represent a short bit string? Tags: dictionary, haskell-lens, haskell, bit-manipulation Problem: What's the best way to represent a short bit string? I want to represent a string of up to around 120 bits, and spe...

What's the best way to represent a short bit string? What's the best way to represent a short bit string? dictionary haskell-lens haskell bit-manipulation What Word128 Data.Map What's the best way to represent a short bit string? I want to represent a string of up to around 120 bits, and speed is critical. I ...

[ -0.006622314453125, 0.005584716796875, -0.0115966796875, 0.0096435546875, -0.00640869140625, -0.00014019012451171875, 0.00323486328125, -0.01531982421875, -0.00022411346435546875, -0.00604248046875, 0.005859375, 0.0062255859375, -0.006744384765625, 0.0157470703125, 0.0146484375, 0.0169...

[ 3768, 2965, 3917, 47, 33636, 16610, 4785, 79315, 45, 10763, 1556, 142508, 1977, 7, 9051, 254, 72403, 22543, 81764, 11809, 166179, 70, 10, 3444, 1257, 10932, 5390, 38352, 130306, 3871, 45367, 91693, 119140, 91, 54387, 41018, 18588, 51, 25553...

[ 0.088623046875, 0.212158203125, 0.128173828125, 0.0704345703125, 0.290283203125, 0.268310546875, 0.208984375, 0.250732421875, 0.0059814453125, 0.038909912109375, 0.0863037109375, 0.2166748046875, 0.126708984375, 0.0704345703125, 0.0227508544921875, 0.06048583984375, 0.004180908203125...

embed

25821435_c0

25821435

haskell

0

Title: Reading and closing files in Haskell Problem title: Reading and closing files in Haskell Tags: xml, file-io, haskell Problem: Reading and closing files in Haskell I am a beginner in Haskell and currently I am trying to parse a list of xml files. To parse an xml file from a given filename I am using the following...

Reading and closing files in Haskell Reading and closing files in Haskell xml file-io haskell Reading Haskell News get_val TagClose TagOpen Bool Too Reading and closing files in Haskell I am a beginner in Haskell and currently I am trying to parse a list of xml files. To parse an xml file from a given filename I am usi...

[ 0.01318359375, 0.0186767578125, 0.0086669921875, -0.0081787109375, 0.01129150390625, 0.006927490234375, -0.000492095947265625, -0.029541015625, -0.00732421875, -0.0167236328125, 0.0078125, -0.01226806640625, -0.006439208984375, -0.00830078125, 0.03173828125, -0.007354736328125, -0.00...

[ 104951, 136, 20450, 102158, 20625, 142508, 6953, 131492, 11435, 846, 1556, 1833, 1405, 4837, 59453, 103264, 2460, 929, 56374, 9842, 1679, 31577, 366, 184, 5303, 11627, 17368, 25632, 32354, 50339, 9803, 174350, 177953, 146353, 7763, 31, 5941, ...

[ 0.1925048828125, 0.060546875, 0.174560546875, 0.1763916015625, 0.141357421875, 0.2237548828125, 0.03204345703125, 0.1884765625, 0.12841796875, 0.130859375, 0.1295166015625, 0.09765625, 0.125, 0.07427978515625, 0.1597900390625, 0.1832275390625, 0.0653076171875, 0.1312255859375, 0....

embed

69563309_c0

69563309

haskell

0

Title: Haskell add a UTCTime to a custom data attribute Problem title: Haskell add a UTCTime to a custom data attribute Tags: haskell Problem: Haskell add a UTCTime to a custom data attribute I need a help on how I can use a do block (to perform IO) in the follow function. Bassicaly I have a Entry like: data Entry = En...

Haskell add a UTCTime to a custom data attribute Haskell add a UTCTime to a custom data attribute haskell Haskell UTCTime Entry Maybe T.Text Generic Show Ord TuidoState BE.getEditContents _theEdit Just Test _entries BL.listInsert Haskell add a UTCTime to a custom data attribute I need a help on how I can use a do block...

[ -0.00732421875, 0.01025390625, 0.013916015625, -0.031982421875, 0.0087890625, -0.0172119140625, -0.01055908203125, 0.00787353515625, 0.0184326171875, -0.06640625, 0.028076171875, -0.017333984375, 0.01080322265625, 0.0181884765625, 0.0159912109375, -0.0068359375, 0.007659912109375, ...

[ 20625, 142508, 15190, 10, 99577, 70059, 47, 114122, 2053, 150380, 1556, 357, 15123, 83425, 384, 174379, 88342, 17367, 35379, 1371, 3911, 135206, 9622, 3794, 125270, 25352, 2347, 8647, 2517, 68170, 6562, 33657, 13, 3871, 4358, 3642, 831, 4527,...

[ 0.1226806640625, 0.2242431640625, 0.1197509765625, 0.048675537109375, 0.210205078125, 0.277587890625, 0.04119873046875, 0.20068359375, 0.146240234375, 0.205322265625, 0.1092529296875, 0.0819091796875, 0.16259765625, 0.0265960693359375, 0.043701171875, 0.1142578125, 0.0909423828125, ...

embed

1783668_c0

1783668

haskell

0

Title: How to recursively compare the digits in a number in Haskell Problem title: How to recursively compare the digits in a number in Haskell Tags: recursion, haskell Problem: How to recursively compare the digits in a number in Haskell I am doing problem 112 on Project Euler and came up with the following to test th...

How to recursively compare the digits in a number in Haskell How to recursively compare the digits in a number in Haskell recursion haskell How Haskell x:y:xs y:xs How to recursively compare the digits in a number in Haskell I am doing problem 112 on Project Euler and came up with the following to test the example case...

[ -0.0296630859375, -0.003936767578125, 0.0106201171875, 0.00970458984375, 0.00140380859375, 0.02099609375, 0.0166015625, -0.0179443359375, 0.01513671875, 0.01904296875, 0.00183868408203125, -0.001190185546875, 0.005523681640625, -0.0016632080078125, 0.00531005859375, -0.009033203125, ...

[ 11249, 47, 195625, 5844, 538, 69101, 153939, 7, 23, 14012, 20625, 142508, 1830, 1556, 1022, 12, 53, 425, 113, 70, 2967, 25837, 27331, 5177, 603, 3034, 27781, 7225, 15549, 757, 5, 5046, 2773, 35166, 3714, 3642, 54, 61924, 32354, 83, 4153...

[ 0.06829833984375, 0.02923583984375, 0.2457275390625, 0.1951904296875, 0.05126953125, 0.2568359375, 0.2301025390625, 0.095947265625, 0.08807373046875, 0.1888427734375, 0.1685791015625, 0.250732421875, 0.07635498046875, 0.1556396484375, 0.060272216796875, 0.05743408203125, 0.0729370117...

embed

23948188_c1

23948188

haskell

1

3 3),(3,LitF 1)] in 1 So now I'm interested in interpreting an abstract syntax graph rather than an abstract syntax tree . A naive evalGraph function eliminates sharing by interpreting it as if it were a tree: evalGraph (Graph env r) = go r where go j = case lookup j env of Just (AddF a b) -> go a + go b Just (LitF d) ...

[ -0.031005859375, 0.0103759765625, -0.003326416015625, 0.00390625, -0.006927490234375, -0.001861572265625, -0.0013580322265625, 0.007537841796875, 0.02490234375, -0.01287841796875, -0.0037384033203125, 0.0023040771484375, 0.0108642578125, 0.0179443359375, 0.00665283203125, 0.02648925781...

[ 138, 8439, 86827, 217, 919, 23, 106, 60892, 29481, 214, 164789, 6002, 86531, 41382, 43257, 53201, 24, 5844, 28, 1405, 37878, 11727, 32354, 27169, 1636, 53371, 237, 2174, 3542, 22, 334, 1690, 738, 1647, 7225, 6713, 9563, 4028, 997, 104, ...

[ 0.05364990234375, 0.0755615234375, 0.04974365234375, 0.0151824951171875, 0.1131591796875, 0.04705810546875, 0.03997802734375, 0.0831298828125, 0.1978759765625, 0.0190277099609375, 0.22509765625, 0.0938720703125, 0.1529541015625, 0.2476806640625, 0.0241241455078125, 0.197509765625, 0....

embed

39033380_c0

39033380

haskell

0

Title: Using Char does not compile without FlexibleContexts Problem title: Using Char does not compile without FlexibleContexts Tags: haskell Problem: Using Char does not compile without FlexibleContexts sierpinski :: Int -> Array (Int,Int) Char sierpinski l = runSTArray $ do arr <- newArray ((1,1),(63,32)) '_' let dra...

Using Char does not compile without FlexibleContexts Using Char does not compile without FlexibleContexts haskell Using Char FlexibleContexts Array forM_ len..len Non MArray Use h-1 n-1 Using Char does not compile without FlexibleContexts However changing array type from Char to Int is okay Can someone clarify why is t...

[ -0.01904296875, -0.0001735687255859375, -0.0001087188720703125, -0.00439453125, -0.01092529296875, 0.00008726119995117188, -0.0025634765625, 0.000858306884765625, -0.00141143798828125, -0.0004100799560546875, -0.0032501220703125, -0.034423828125, 0.00640869140625, -0.00543212890625, -0.0...

[ 345, 6953, 21656, 959, 9969, 1340, 15490, 180842, 2661, 11935, 22829, 1556, 142508, 69253, 100, 3098, 1977, 3775, 7092, 36836, 1096, 5759, 14602, 151134, 10298, 53, 10644, 1295, 47, 360, 18, 68403, 17306, 15400, 123087 ]

[ 0.066162109375, 0.0074462890625, 0.2069091796875, 0.078857421875, 0.1431884765625, 0.1610107421875, 0.094970703125, 0.2061767578125, 0.1451416015625, 0.0634765625, 0.1923828125, 0.121826171875, 0.2034912109375, 0.1060791015625, 0.04278564453125, 0.0986328125, 0.0921630859375, 0.070...

embed

49776924_c1

49776924

haskell

1

). Applicative m => (Element X -> m (Element X)) -> X -> m X’ NB: We cannot know what roles the parameters to ‘m’ have; we must assume that the role is nominal • When deriving the instance for (MonoTraversable X) | 13 | deriving newtype (MonoFunctor, MonoFoldable, MonoTraversable, Monoid, GrowingAppend, SemiSequence, M...

[ -0.0164794921875, 0.01513671875, 0.0029754638671875, 0.004791259765625, 0.007537841796875, 0.0081787109375, 0.0016326904296875, -0.0096435546875, 0.0031280517578125, -0.0001735687255859375, 0.0050048828125, -0.005218505859375, -0.01007080078125, 0.004302978515625, 0.00193023681640625, ...

[ 194, 5659, 11048, 4935, 347, 44357, 647, 19929, 1193, 33079, 26, 63813, 53418, 3714, 31486, 171859, 47, 39, 765, 8110, 41591, 109650, 14847, 16406, 6496, 110527, 46674, 31, 28542, 7864, 2886, 702, 3525, 50986, 97249, 18770, 77879, 919, 1834...

[ 0.1207275390625, 0.1590576171875, 0.2103271484375, 0.174560546875, 0.1778564453125, 0.0946044921875, 0.038665771484375, 0.171875, 0.179931640625, 0.1309814453125, 0.0115966796875, 0.0290985107421875, 0.0943603515625, 0.042083740234375, 0.15234375, 0.198486328125, 0.054840087890625, ...

embed

3323823_c0

3323823

haskell

0

Title: Equivalent expressions produce different results in a function? Problem title: Equivalent expressions produce different results in a function? Tags: haskell, integration Problem: Equivalent expressions produce different results in a function? I have a function (exercise 10.11 in Thompson's The Craft of Functiona...

Equivalent expressions produce different results in a function? Equivalent expressions produce different results in a function? haskell integration Data.Ratio Equivalent Rational d..b Double Equivalent expressions produce different results in a function? I have a function (exercise 10.11 in Thompson's The Craft of Func...

[ -0.002227783203125, -0.0189208984375, 0.018310546875, 0.017333984375, -0.00003981590270996094, 0.01544189453125, 0.0079345703125, -0.0184326171875, 0.0029754638671875, 0.0191650390625, -0.01611328125, 0.0291748046875, 0.00133514404296875, -0.0011138916015625, 0.0068359375, -0.002960205...

[ 145666, 85540, 125195, 7, 27489, 12921, 50339, 23, 32354, 1556, 142508, 157353, 11809, 1052, 28645, 2552, 43315, 104, 275, 107172, 46480, 15019, 4068, 1662, 170028, 34734, 2480, 28670, 10763, 27958, 7077, 35707, 53950, 34292, 71496, 28970, 645,...

[ 0.1380615234375, 0.2381591796875, 0.269287109375, 0.04486083984375, 0.1544189453125, 0.1722412109375, 0.160400390625, 0.007537841796875, 0.1702880859375, 0.1121826171875, 0.1961669921875, 0.191162109375, 0.065673828125, 0.068603515625, 0.1387939453125, 0.1065673828125, 0.081176757812...

embed

49773874_c0

49773874

haskell

0

Title: Making a wrapper over a generic Rep Problem title: Making a wrapper over a generic Rep Tags: haskell Problem: Making a wrapper over a generic Rep I have a Rep A for some type that I modify using some forall x. Rep A x -> F (Rep A) x function where F is a type family. Let's say this wraps all the fields in a Mayb...

Making a wrapper over a generic Rep Making a wrapper over a generic Rep haskell to Making Rep Maybe RepWrapper Generic Making a wrapper over a generic Rep I have a Rep A for some type that I modify using some forall x. Rep A x -> F (Rep A) x function where F is a type family. Let's say this wraps all the fields in a Ma...

[ -0.003631591796875, 0.00098419189453125, -0.00787353515625, -0.020263671875, -0.0191650390625, 0.009765625, -0.00970458984375, 0.005706787109375, 0.00836181640625, -0.01123046875, -0.01446533203125, 0.003173828125, 0.00897216796875, 0.0164794921875, 0.006622314453125, -0.00933837890625...

[ 13676, 137565, 1264, 645, 189534, 33742, 1556, 142508, 83425, 219, 8079, 88342, 62, 10644, 2811, 40383, 17368, 100, 5584, 1022, 33079, 563, 4332, 254, 32354, 14449, 756, 44457, 3444, 35686, 20650, 47, 821, 58627, 10, 90, 191, 87344, 52895, ...

[ 0.09234619140625, 0.2230224609375, 0.2042236328125, 0.1097412109375, 0.2332763671875, 0.216064453125, 0.12060546875, 0.209716796875, 0.2445068359375, 0.1617431640625, 0.1785888671875, 0.1732177734375, 0.10089111328125, 0.184814453125, 0.09088134765625, 0.06201171875, 0.01742553710937...

embed

51658023_c0

51658023

haskell

0

Title: How is it possible to get `Non-exhaustive patterns` exception when using `otherwise` Problem title: How is it possible to get `Non-exhaustive patterns` exception when using `otherwise` Tags: haskell, non-exhaustive-patterns Problem: How is it possible to get `Non-exhaustive patterns` exception when using `otherw...

How is it possible to get `Non-exhaustive patterns` exception when using `otherwise` How is it possible to get `Non-exhaustive patterns` exception when using `otherwise` haskell non-exhaustive-patterns How Non-exhaustive p_1 p_k Integer x:xs y:ys Bool k..n How is it possible to get `Non-exhaustive patterns` exception w...

[ -0.0213623046875, 0.0311279296875, 0.0036468505859375, -0.002471923828125, 0.0087890625, -0.00994873046875, 0.01312255859375, -0.00933837890625, 0.0113525390625, -0.0194091796875, 0.0166015625, 0.011962890625, 0.0208740234375, -0.0032196044921875, 0.00921630859375, 0.00494384765625, ...

[ 7722, 59881, 3355, 18391, 4935, 103510, 131527, 17368, 126340, 90825, 2046, 7, 1556, 142508, 351, 4453, 22766, 3775, 915, 115187, 92, 44401, 1022, 425, 113, 4778, 2460, 929, 23534, 101935, 3173, 997, 106, 959, 756, 20809, 18151, 80934, 3235...

[ 0.08367919921875, 0.146484375, 0.0289459228515625, 0.1383056640625, 0.050689697265625, 0.2109375, 0.2017822265625, 0.04095458984375, 0.15771484375, 0.23828125, 0.0281982421875, 0.0098876953125, 0.0936279296875, 0.1937255859375, 0.1328125, 0.10009765625, 0.120849609375, 0.1340332031...

embed

22138928_c0

22138928

haskell

0

Title: why are the state and reader monads functions while the writer monad is a tuple? Problem title: why are the state and reader monads functions while the writer monad is a tuple? Tags: functor, state, monads, haskell Problem: why are the state and reader monads functions while the writer monad is a tuple? I'm a Ha...

why are the state and reader monads functions while the writer monad is a tuple? why are the state and reader monads functions while the writer monad is a tuple? functor state monads haskell MonadPlus why are the state and reader monads functions while the writer monad is a tuple? I'm a Haskell newbie, and I think I un...

[ -0.00775146484375, 0.0216064453125, -0.0118408203125, 0.00787353515625, -0.00054168701171875, -0.010009765625, -0.015380859375, -0.01220703125, -0.006561279296875, -0.00616455078125, 0.01190185546875, -0.00018978118896484375, -0.0205078125, 0.00421142578125, -0.00396728515625, -0.01928...

[ 15400, 11341, 136, 155255, 2667, 712, 7, 32354, 12960, 70035, 370, 8705, 7477, 18770, 1556, 142508, 60331, 71, 88225, 20625, 9014, 28219, 135969, 5303, 1836, 61924, 3917, 765, 47, 36442, 58868, 47644, 16454, 707, 3871, 41872, 33079, 11, 205...

[ 0.11474609375, 0.1644287109375, 0.0809326171875, 0.230224609375, 0.1263427734375, 0.20458984375, 0.05743408203125, 0.2052001953125, 0.053497314453125, 0.205322265625, 0.09783935546875, 0.1942138671875, 0.0809326171875, 0.0819091796875, 0.0733642578125, 0.2237548828125, 0.121826171875...

embed

32437317_c0

32437317

haskell

0

Title: cabal + proxy: downloading packages from hackage Problem title: cabal + proxy: downloading packages from hackage Tags: windows, cabal, haskell Problem: cabal + proxy: downloading packages from hackage I'm using Haskell Platform 7.10.2-a (64-bit) on Windows: >cabal -V cabal-install version 1.22.6.0 using version ...

cabal + proxy: downloading packages from hackage cabal + proxy: downloading packages from hackage windows cabal haskell hackage version hackage.haskell.org Cabal http_proxy user:passwd acme.com:port Downloading Skipping Local Warning Run There You cabal + proxy: downloading packages from hackage I'm using Haskell Platf...

[ 0.00323486328125, 0.0230712890625, 0.0164794921875, -0.015869140625, -0.003204345703125, -0.004119873046875, -0.010009765625, 0.0262451171875, 0.0057373046875, 0.007232666015625, -0.00836181640625, -0.017822265625, -0.01904296875, -0.0159912109375, -0.01007080078125, 0.0004367828369140...

[ 109524, 997, 502, 50878, 12, 7026, 214, 98169, 1295, 85526, 4588, 54825, 1556, 142508, 11389, 10557, 1478, 30438, 289, 1621, 64101, 53, 38937, 13409, 37281, 1030, 282, 6982, 4857, 20491, 26783, 24172, 5550, 28398, 8622, 2583, 17368, 20625, ...

[ 0.278564453125, 0.1802978515625, 0.1661376953125, 0.29248046875, 0.009307861328125, 0.14111328125, 0.04718017578125, 0.1885986328125, 0.1181640625, 0.2091064453125, 0.150146484375, 0.102294921875, 0.13037109375, 0.2469482421875, 0.0950927734375, 0.1090087890625, 0.022003173828125, ...

embed

14601939_c1

14601939

haskell

1

1.1.0.1: using process-1.1.0.1 Dependency shakespeare ==1.0.3: using shakespeare-1.0.3 Dependency template-haskell ==2.8.0.0: using template-haskell-2.8.0.0 Dependency text ==0.11.2.3: using text-0.11.2.3 Dependency transformers ==0.2.2.0: using transformers-0.2.2.0 Using Cabal-1.16.0.3 compiled by ghc-7.0 Using compil...

2.1-59c8844d535e4a3bdd1569d60336e3b7 directory-1.1.0.2-ef4eca075618605e644c6184b111f96f filepath-1.3.0.0-954c43b4f109cbd4121f1231c14d5cff haskell-src-exts-1.13.5-3e91c3c2a4a723d046d79dc6b2b3a8bd pretty-1.1.1.0-867dcdeb02592f3d2a707618561c7b86 process-1.1.0.1-bd6d91995b2ae2680669549cb63f15b4 syb-0.3.7-a269c050536d4890f3...

[ -0.00897216796875, -0.01007080078125, 0.01324462890625, -0.00135040283203125, 0.02197265625, -0.00567626953125, -0.01806640625, -0.0096435546875, -0.00164031982421875, 0.02197265625, -0.004425048828125, -0.00714111328125, -0.0113525390625, 0.000530242919921875, 0.0086669921875, 0.01855...

[ 34513, 12975, 182332, 14364, 92134, 133684, 11435, 128405, 81046, 99929, 1556, 142508, 19437, 3355, 933, 72516, 28875, 102107, 9433, 102014, 110934, 10557, 82295, 27198, 1314, 92558, 154189, 162, 16665, 109524, 20600, 35782, 174450, 9217, 1046, 4...

[ 0.1103515625, 0.071533203125, 0.006500244140625, 0.09033203125, 0.061767578125, 0.1248779296875, 0.0491943359375, 0.09716796875, 0.0258331298828125, 0.04315185546875, 0.13916015625, 0.27001953125, 0.1317138671875, 0.041778564453125, 0.05035400390625, 0.098876953125, 0.17626953125, ...

embed

17503131_c1

17503131

haskell

1

unify these 2 cases? Did I overlook some tricks, or is this just a limitation for now? Are there other things that can be simplified? {-# LANGUAGE DataKinds #-} {-# LANGUAGE ExistentialQuantification #-} {-# LANGUAGE GADTs #-} {-# LANGUAGE PolyKinds #-} {-# LANGUAGE Rank2Types #-} {-# LANGUAGE StandaloneDeriving #-} {...

[ 0.002471923828125, -0.01190185546875, 0.00946044921875, -0.000720977783203125, 0.01123046875, -0.0020294189453125, -0.0101318359375, -0.01220703125, 0.02099609375, -0.0174560546875, -0.00897216796875, -0.031005859375, -0.0026702880859375, -0.0020599365234375, -0.000640869140625, -0.021...

[ 51, 40383, 6097, 116, 50218, 645, 64747, 88308, 205969, 5036, 112892, 1029, 297, 3358, 98064, 75930, 11809, 605, 7250, 122688, 173495, 18, 41274, 23749, 41072, 63306, 134405, 304, 196707, 32487, 51684, 47731, 60457, 1191, 156823, 79912, 24750, ...

[ 0.1856689453125, 0.1558837890625, 0.0606689453125, 0.124267578125, 0.1820068359375, 0.015350341796875, 0.0787353515625, 0.138671875, 0.1636962890625, 0.012847900390625, 0.1446533203125, 0.0936279296875, 0.014434814453125, 0.04345703125, 0.16162109375, 0.10394287109375, 0.080932617187...

embed

8909997_c0

8909997

haskell

0

Title: Haskell: repeat a function a large number of times without stackoverflow Problem title: Haskell: repeat a function a large number of times without stackoverflow Tags: stack-overflow, haskell Problem: Haskell: repeat a function a large number of times without stackoverflow As a newbie to Haskell I am trying to it...

Haskell: repeat a function a large number of times without stackoverflow Haskell: repeat a function a large number of times without stackoverflow stack-overflow haskell Haskell Double n-1 Stack Use RTS Ksize Haskell: repeat a function a large number of times without stackoverflow As a newbie to Haskell I am trying to i...

[ -0.005859375, 0.005340576171875, 0.013427734375, -0.004547119140625, 0.001953125, -0.000675201416015625, -0.0101318359375, -0.0107421875, -0.00154876708984375, -0.0263671875, 0.01470947265625, -0.00238037109375, 0.00150299072265625, -0.0159912109375, 0.03564453125, 0.00982666015625, ...

[ 20625, 142508, 119140, 32354, 21334, 14012, 20028, 15490, 177261, 5465, 118664, 1556, 107172, 5759, 6512, 2594, 36836, 27389, 294, 341, 62539, 3525, 9014, 47, 31577, 17, 8560, 150535, 22288, 222530, 46876, 2806, 8781, 40956, 3564, 1257, 678, ...

[ 0.14404296875, 0.246826171875, 0.30078125, 0.205078125, 0.1094970703125, 0.1273193359375, 0.2120361328125, 0.13916015625, 0.1824951171875, 0.125244140625, 0.25390625, 0.078125, 0.06317138671875, 0.0977783203125, 0.112548828125, 0.07122802734375, 0.06683349609375, 0.107666015625, ...

embed

12292934_c1

12292934

haskell

1

2),(2,3,4),(3,4,3),(4,0,2)] -- Networking and command functions prepareSocket :: PortNumber -> IO Socket prepareSocket port = do sock' <- socket AF_INET Stream defaultProtocol let socketAddress = SockAddrInet port 0000 bindSocket sock' socketAddress listen sock' 1 putStrLn $ "Listening on " ++ (show port) return sock' ...

[ -0.01123046875, 0.01336669921875, -0.005859375, 0.0107421875, 0.015625, 0.01708984375, -0.003692626953125, -0.0244140625, 0.01470947265625, -0.03466796875, 0.0034942626953125, 0.00579833984375, -0.005096435546875, -0.00750732421875, -0.0306396484375, 0.002410888671875, 0.003265380859...

[ 4958, 4, 54753, 82449, 247, 21320, 105801, 2389, 10461, 4210, 28997, 214, 136, 75101, 32354, 7, 114606, 8912, 27853, 1984, 13791, 18444, 26278, 33079, 17780, 1061, 11469, 54, 221, 2594, 25, 28211, 17777, 115061, 114977, 188, 8447, 2633, 161...

[ 0.169189453125, 0.034912109375, 0.03948974609375, 0.17138671875, 0.03021240234375, 0.1070556640625, 0.1175537109375, 0.093505859375, 0.06744384765625, 0.0994873046875, 0.1951904296875, 0.1170654296875, 0.1287841796875, 0.2626953125, 0.2012939453125, 0.001922607421875, 0.2342529296875...

embed

4115005_c0

4115005

haskell

0

Title: Cabal usage (Haskell) Problem title: Cabal usage (Haskell) Tags: installation, hackage, haskell, dependencies, cabal Problem: Cabal usage (Haskell) Cabal has dependency problems constantly . It's really tiring. So far I have tried to get many things working, here's my trying to install snap: $ sudo cabal install...

Cabal usage (Haskell) Cabal usage (Haskell) installation hackage haskell dependencies cabal Cabal Haskell Resolving ListLike-1.1.0 mtl-1.1.0.0 mtl-1.1.0.1 mtl-1.1.0.2 mtl-1.1.1.0 However mtl-2.0.0.0 monads-fd-0.1.0.3 PATH bin:$PATH Cabal usage (Haskell) Cabal has dependency problems constantly . It's really tiring. So ...

[ 0.004241943359375, 0.006500244140625, 0.0166015625, -0.00518798828125, 0.00084686279296875, -0.0186767578125, -0.0247802734375, 0.0107421875, 0, -0.0002040863037109375, -0.0079345703125, -0.037109375, -0.01007080078125, 0.004486083984375, 0.001312255859375, -0.005767822265625, 0.0072...

[ 30438, 289, 127689, 6495, 7, 142508, 59720, 85526, 4588, 1556, 42548, 109524, 20625, 132944, 32036, 156607, 5759, 102107, 18, 141, 92134, 99929, 102014, 133684, 33306, 347, 73011, 2667, 712, 420, 71, 170179, 436, 139909, 2394, 4369, 65135, 84...

[ 0.225830078125, 0.236083984375, 0.17236328125, 0.1427001953125, 0.09222412109375, 0.264404296875, 0.121826171875, 0.19287109375, 0.0149078369140625, 0.1494140625, 0.2291259765625, 0.322509765625, 0.172119140625, 0.1597900390625, 0.1766357421875, 0.270263671875, 0.00927734375, 0.113...

embed

66341939_c0

66341939

haskell

0

Title: Comparing the length of 2 lists in Haskell Problem title: Comparing the length of 2 lists in Haskell Tags: haskell, compare Problem: Comparing the length of 2 lists in Haskell im new to Haskell and currently making a few activities to test myself. The main reason i created this post is because im stuck in a situ...

Comparing the length of 2 lists in Haskell Comparing the length of 2 lists in Haskell haskell compare qualified Comparing Haskell Set.fromList Data.Set Set main::IO Comparing the length of 2 lists in Haskell im new to Haskell and currently making a few activities to test myself. The main reason i created this post is b...

[ -0.0101318359375, 0.01611328125, -0.00927734375, 0.0152587890625, 0.0006561279296875, -0.006439208984375, 0.015625, 0.01165771484375, 0.0135498046875, -0.0235595703125, -0.007171630859375, -0.001953125, 0.0267333984375, 0.00830078125, -0.003509521484375, -0.0107421875, 0.012084960937...

[ 113307, 140909, 116, 5303, 20625, 142508, 1556, 69101, 217225, 19943, 161063, 154663, 11809, 294, 126, 5201, 17780, 566, 3525, 69924, 3034, 35978, 179933, 16648, 7722, 86869, 3917, 81979, 26458, 54529, 3642, 5941, 119140, 892, 26255, 23, 195625...

[ 0.193359375, 0.17138671875, 0.142333984375, 0.2276611328125, 0.1436767578125, 0.1854248046875, 0.1329345703125, 0.181396484375, 0.1842041015625, 0.160888671875, 0.1416015625, 0.1845703125, 0.06640625, 0.049591064453125, 0.075439453125, 0.054351806640625, 0.1429443359375, 0.03976440...

embed

25102588_c0

25102588

haskell

0

Title: Lift a function and its argument to a different monadic context Problem title: Lift a function and its argument to a different monadic context Tags: monads, haskell Problem: Lift a function and its argument to a different monadic context I am not sure how to formulate this question scientifically exact, so I am ...

Lift a function and its argument to a different monadic context Lift a function and its argument to a different monadic context monads haskell Lift StateT Ptr MyState Storable Lift a function and its argument to a different monadic context I am not sure how to formulate this question scientifically exact, so I am just ...

[ -0.0048828125, 0.01336669921875, -0.002777099609375, 0.0167236328125, -0.0021820068359375, -0.0157470703125, -0.0185546875, -0.0181884765625, -0.0027313232421875, -0.0272216796875, 0.041748046875, 0.00136566162109375, 0.0033416748046875, 0.020751953125, 0.00482177734375, -0.01300048828...

[ 166562, 10, 32354, 10750, 47, 12921, 2667, 11, 18403, 43701, 136, 712, 1556, 142508, 22836, 618, 4448, 2646, 135206, 23604, 2886, 57456, 7639, 27781, 17368, 11341, 23, 27198, 56, 9626, 538, 17780, 187040, 41018, 3871, 4527, 24286, 408, 831,...

[ 0.271728515625, 0.0987548828125, 0.192626953125, 0.2259521484375, 0.07110595703125, 0.1031494140625, 0.0992431640625, 0.06298828125, 0.056182861328125, 0.180419921875, 0.005096435546875, 0.140625, 0.0972900390625, 0.21435546875, 0.1505126953125, 0.149169921875, 0.1075439453125, 0.0...

embed

69260338_c0

69260338

haskell

0

Title: Not in scope: type constructor or class ‘∼’ Problem title: Not in scope: type constructor or class ‘∼’ Tags: gadt, haskell, type-families Problem: Not in scope: type constructor or class ‘∼’ I'm trying to compile a code snippet from Maguire's Thinking with Types : {-# LANGUAGE TypeOperators #-} data Expr_ a = (a...

Not in scope: type constructor or class ‘∼’ Not in scope: type constructor or class ‘∼’ gadt haskell type-families Not LANGUAGE TypeOperators Expr_ LitInt_ Bool LitBool_ Add_ Not_ If_ TypeEquality.hs Compiling Main TypeEquality.hs:4:10 TypeEquality.hs:5:10 TypeEquality.hs:6:10 TypeEquality.hs:7:10 Failed Not in scope: ...

[ 0.0004749298095703125, 0.00025177001953125, -0.00186920166015625, 0.01104736328125, 0.001190185546875, -0.0019073486328125, -0.007598876953125, 0.002777099609375, -0.02001953125, -0.01409912109375, -0.005828857421875, -0.00738525390625, 0.0164794921875, -0.01544189453125, 0.019775390625,...

[ 11205, 23, 70820, 10644, 64549, 748, 707, 18507, 166406, 914, 13384, 1556, 142508, 69128, 98064, 60457, 156823, 22230, 27668, 4153, 929, 12647, 29117, 4263, 161789, 127, 15612, 12321, 647, 617, 15110, 758, 190355, 9969, 1340, 18151, 93, 58134...

[ 0.1802978515625, 0.139404296875, 0.180908203125, 0.2236328125, 0.178955078125, 0.117919921875, 0.05279541015625, 0.1754150390625, 0.15576171875, 0.053436279296875, 0.1195068359375, 0.1163330078125, 0.206298828125, 0.0845947265625, 0.06414794921875, 0.2088623046875, 0.1173095703125, ...

embed

11128759_c0

11128759

haskell

0

Title: Beautiful and terrible Haskell Problem title: Beautiful and terrible Haskell Tags: functional-programming, haskell Problem: Beautiful and terrible Haskell Haskell is beautiful. That's a fact. It's concise, fast etc. Many of you will admit that writing in it is a great pleasure. On the other hand I think that its...

Beautiful and terrible Haskell Beautiful and terrible Haskell functional-programming haskell Beautiful Haskell Map Map.toList Map.fromListWith Map.filterWithKey Map.unions List.map Map.elems Beautiful and terrible Haskell Haskell is beautiful. That's a fact. It's concise, fast etc. Many of you will admit that writing i...

[ 0.0025482177734375, 0.01202392578125, 0.00933837890625, -0.01068115234375, 0.002716064453125, -0.01348876953125, 0.008544921875, -0.0218505859375, 0.01129150390625, -0.03271484375, -0.01220703125, 0.0029754638671875, 0.00616455078125, 0.0198974609375, -0.00799560546875, -0.002075195312...

[ 168941, 136, 94176, 20625, 142508, 123309, 28966, 1556, 42719, 188, 154663, 161063, 194583, 120337, 162429, 87046, 32036, 62346, 27889, 83, 34923, 15824, 1650, 158, 318, 4271, 3021, 52455, 36456, 32562, 23, 442, 6782, 147643, 5351, 6863, 7432, ...

[ 0.267578125, 0.1397705078125, 0.27392578125, 0.1978759765625, 0.322021484375, 0.1217041015625, 0.1201171875, 0.18408203125, 0.181396484375, 0.0889892578125, 0.1558837890625, 0.0872802734375, 0.115478515625, 0.15234375, 0.1107177734375, 0.110595703125, 0.1268310546875, 0.1396484375,...

embed

50092681_c0

50092681

haskell

0

Title: In Haskell, is it correct measuring performance using a timestamp obtained at the beginning and in the end of a function execution? Problem title: In Haskell, is it correct measuring performance using a timestamp obtained at the beginning and in the end of a function execution? Tags: performance, haskell Problem...

In Haskell, is it correct measuring performance using a timestamp obtained at the beginning and in the end of a function execution? In Haskell, is it correct measuring performance using a timestamp obtained at the beginning and in the end of a function execution? performance haskell a Data.Time.Clock Haskell UTCTime In...

[ -0.013427734375, 0.015380859375, 0.0147705078125, -0.00994873046875, 0.0081787109375, -0.021484375, -0.02197265625, 0.001190185546875, 0.0021820068359375, -0.0673828125, 0.0185546875, 0.002716064453125, 0.0059814453125, -0.000020384788513183594, 0.0006256103515625, -0.00174713134765625...

[ 20625, 142508, 26785, 163, 162, 23718, 17368, 1733, 590, 2676, 113054, 86595, 136, 3564, 32354, 71924, 53089, 1556, 11809, 70059, 21135, 99577, 360, 72350, 133244, 20028, 2537, 6423, 2046, 474, 15724, 30646, 21, 3285, 7432, 52490, 3444, 30098...

[ 0.1240234375, 0.2476806640625, 0.1787109375, 0.13427734375, 0.183837890625, 0.2239990234375, 0.05377197265625, 0.1116943359375, 0.1719970703125, 0.176025390625, 0.0635986328125, 0.1236572265625, 0.055206298828125, 0.1148681640625, 0.14599609375, 0.100830078125, 0.05828857421875, 0....

embed

29454528_c0

29454528

haskell

0

Title: What does GADT offer that cannot be done with OOP and generics? Problem title: What does GADT offer that cannot be done with OOP and generics? Tags: type-theory, ocaml, gadt, generics, haskell Problem: What does GADT offer that cannot be done with OOP and generics? Are GADTs in functional languages equivalent to...

What does GADT offer that cannot be done with OOP and generics? What does GADT offer that cannot be done with OOP and generics? type-theory ocaml gadt generics haskell What GADT OOP Expr Suc IsZero Bool Integer Override prev.eval What does GADT offer that cannot be done with OOP and generics? Are GADTs in functional la...

[ -0.0031585693359375, 0.0052490234375, 0.01226806640625, -0.00555419921875, 0.024169921875, -0.01055908203125, -0.00180816650390625, -0.002655029296875, 0.004119873046875, -0.0361328125, -0.0196533203125, -0.0322265625, -0.01397705078125, -0.013671875, -0.00469970703125, -0.004638671875...

[ 4865, 23749, 41072, 18645, 53418, 16940, 678, 180, 20880, 189534, 7, 10644, 2347, 30675, 36, 9779, 141, 914, 13384, 1556, 142508, 60075, 42, 103544, 2071, 1511, 4036, 2460, 929, 44401, 9578, 416, 28468, 1405, 136, 123309, 46876, 183234, 891...

[ 0.020263671875, 0.1636962890625, 0.251953125, 0.1092529296875, 0.1165771484375, 0.05621337890625, 0.04119873046875, 0.07177734375, 0.21826171875, 0.216796875, 0.037109375, 0.1519775390625, 0.095947265625, 0.026702880859375, 0.044586181640625, 0.0587158203125, 0.0631103515625, 0.125...

embed

49050900_c0

49050900

haskell

0

Title: How to optimize the speed of a numerical library in Haskell Problem title: How to optimize the speed of a numerical library in Haskell Tags: performance, optimization, haskell Problem: How to optimize the speed of a numerical library in Haskell I have released a small numerical library for solving delay differen...

How to optimize the speed of a numerical library in Haskell How to optimize the speed of a numerical library in Haskell performance optimization haskell How Haskell State _state V.Vector Double UNPACK How to optimize the speed of a numerical library in Haskell I have released a small numerical library for solving delay...

[ -0.010498046875, 0.00811767578125, -0.00156402587890625, 0.01416015625, -0.01348876953125, 0.005126953125, -0.01513671875, -0.020263671875, 0.0019989013671875, -0.01470947265625, -0.01324462890625, -0.028076171875, -0.00022220611572265625, 0.00982666015625, -0.0206298828125, -0.0074768...

[ 11249, 15572, 20650, 38352, 54744, 6827, 35773, 1294, 20625, 142508, 23, 23718, 87235, 1556, 22836, 101, 61340, 310, 26455, 18770, 107172, 8274, 98701, 605, 121447, 19336, 3115, 8, 5259, 99710, 13722, 32102, 47327, 112, 38170, 19915, 5201, 12...

[ 0.04168701171875, 0.1849365234375, 0.054412841796875, 0.2105712890625, 0.177978515625, 0.0655517578125, 0.234130859375, 0.1475830078125, 0.161376953125, 0.251708984375, 0.0062255859375, 0.1339111328125, 0.1796875, 0.1341552734375, 0.146240234375, 0.001861572265625, 0.1331787109375, ...

embed

13546872_c0

13546872

haskell

0

Title: Primitive Recursive functions Problem title: Primitive Recursive functions Tags: recursion, haskell Problem: Primitive Recursive functions I'm trying to define some basic Primitive Recursive functions in Haskell. Why is my times function recursing one too many times (ie eval times[x,y] is resulting in (x+1)*y )?...

Primitive Recursive functions Primitive Recursive functions recursion haskell Prelude Primitive Recursive Show Integer x:xs x-1 x:_ _:xs n-1 Primitive Recursive functions I'm trying to define some basic Primitive Recursive functions in Haskell. Why is my times function recursing one too many times (ie eval times[x,y] i...

[ -0.024169921875, 0.0267333984375, 0.021484375, 0.01019287109375, 0.0198974609375, 0.0191650390625, 0.003753662109375, -0.0164794921875, 0.0089111328125, -0.0361328125, -0.00469970703125, -0.01953125, -0.01190185546875, 0.013671875, -0.007568359375, 0.01007080078125, 0.00811767578125,...

[ 44506, 14, 4935, 853, 48650, 5844, 32354, 195625, 1830, 1556, 142508, 1914, 822, 17367, 44401, 1022, 425, 7, 5759, 61924, 62822, 20625, 44084, 83, 20028, 214, 1632, 5792, 5941, 1405, 53, 16750, 21748, 1639, 2967, 70425, 100094, 3288, 40322,...

[ 0.1549072265625, 0.0732421875, 0.1119384765625, 0.0860595703125, 0.201904296875, 0.092041015625, 0.161376953125, 0.243408203125, 0.0057373046875, 0.1180419921875, 0.23681640625, 0.0704345703125, 0.153076171875, 0.0986328125, 0.1336669921875, 0.03125, 0.055877685546875, 0.0134582519...

embed