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
44077968_c0	44077968	haskell	0	Title: cabal - local dependency missing Problem title: cabal - local dependency missing Tags: haskell, cabal Problem: cabal - local dependency missing I am learning cabal. Fighting with a "dependencies are missing" error. I have 2 cabal packages : "base-ext-fana", "xml-fana". Both are sandboxed. base-ext-fana builds cl...	cabal - local dependency missing cabal - local dependency missing haskell cabal cabal - local dependency missing I am learning cabal. Fighting with a "dependencies are missing" error. I have 2 cabal packages : "base-ext-fana", "xml-fana". Both are sandboxed. base-ext-fana builds cleanly. xml-fana should depend on it. S...	[ 0.01336669921875, -0.000423431396484375, 0.0074462890625, 0.00262451171875, 0.002777099609375, 0.000728607177734375, -0.0240478515625, 0.003021240234375, -0.0003986358642578125, -0.0223388671875, 0.01513671875, -0.0291748046875, 0.0078125, 0.025146484375, 0.025634765625, -0.01165771484...	[ 109524, 4000, 42548, 27771, 132283, 1556, 142508, 52080, 106313, 105254, 13, 117538, 621, 18499, 116, 98169, 37382, 3355, 18, 37951, 131492, 19096, 11728, 3647, 45367, 46622, 56566, 15190, 60427, 5303, 408, 3571, 177149, 50605, 98, 222495, 9261...	[ 0.27099609375, 0.19677734375, 0.2421875, 0.13671875, 0.23291015625, 0.1202392578125, 0.21826171875, 0.10498046875, 0.0938720703125, 0.2225341796875, 0.1627197265625, 0.188232421875, 0.091064453125, 0.1982421875, 0.05810546875, 0.20947265625, 0.1817626953125, 0.1500244140625, 0.14...	embed
22603858_c1	22603858	haskell	1	abs x) signum (NodeId x) = NodeId (signum x) instance Enum NodeId where toEnum = NodeId . toEnum fromEnum (NodeId x) = fromEnum x ... newtype InstructionId = InstructionId Natural deriving (Show, Eq) instance Num InstructionId where fromInteger = InstructionId . toNatural (InstructionId x) + (InstructionId y) = Instruc...	abs x) signum (NodeId x) = NodeId (signum x) instance Enum NodeId where toEnum = NodeId . toEnum fromEnum (NodeId x) = fromEnum x ... newtype InstructionId = InstructionId Natural deriving (Show, Eq) instance Num InstructionId where fromInteger = InstructionId . toNatural (InstructionId x) + (InstructionId y) = Instruc...	[ -0.0101318359375, -0.024658203125, 0.008056640625, 0.0177001953125, 0.00885009765625, 0.023681640625, 0.0103759765625, 0.0023651123046875, 0.00836181640625, -0.00836181640625, -0.023193359375, -0.019287109375, -0.006744384765625, -0.003326416015625, -0.005401611328125, -0.01611328125, ...	[ 43719, 1022, 16, 1144, 2606, 15, 5021, 112, 568, 71, 2203, 438, 31304, 316, 110527, 357, 7440, 47, 647, 1295, 153, 3525, 50986, 72022, 10763, 24955, 16406, 6496, 168660, 864, 52782, 67, 149989, 36716, 997, 113, 2055, 7, 9876, 8335, 2886...	[ 0.2398681640625, 0.1844482421875, 0.02215576171875, 0.1800537109375, 0.268798828125, 0.01019287109375, 0.16748046875, 0.1571044921875, 0.151611328125, 0.131591796875, 0.1104736328125, 0.1339111328125, 0.122802734375, 0.2105712890625, 0.201171875, 0.1282958984375, 0.024505615234375, ...	embed
41816726_c0	41816726	haskell	0	Title: How to parse JSON of multi-type array using Aeson into a custom Haskell type? Problem title: How to parse JSON of multi-type array using Aeson into a custom Haskell type? Tags: haskell, aeson Problem: How to parse JSON of multi-type array using Aeson into a custom Haskell type? this is my first post on Stack Ove...	How to parse JSON of multi-type array using Aeson into a custom Haskell type? How to parse JSON of multi-type array using Aeson into a custom Haskell type? haskell aeson Aeson Data.Aeson Network.HTTP.Conduit How JSON Haskell TeamID LeagueID Season SeasonType Regular DateFrom DateTo TeamGameLog Team_ID Game_ID GAME_DATE...	[ -0.0101318359375, 0.0208740234375, -0.0157470703125, 0.0137939453125, -0.01556396484375, -0.0220947265625, -0.02099609375, -0.00238037109375, 0.00811767578125, 0.0179443359375, 0.0123291015625, 0.006134033203125, 0.005615234375, -0.017822265625, -0.0213623046875, 0.00830078125, 0.001...	[ 11249, 366, 184, 821, 58627, 6024, 50986, 10298, 53, 62, 90, 191, 3934, 114122, 20625, 142508, 10644, 17368, 1556, 10, 11809, 284, 28997, 112061, 11399, 7146, 19175, 85135, 196707, 47881, 113972, 13547, 69048, 56948, 123254, 10111, 95976, 241...	[ 0.022003173828125, 0.1524658203125, 0.0706787109375, 0.140380859375, 0.214599609375, 0.1478271484375, 0.21923828125, 0.137939453125, 0.03802490234375, 0.080810546875, 0.0972900390625, 0.1497802734375, 0.046478271484375, 0.1519775390625, 0.1190185546875, 0.2083740234375, 0.16296386718...	embed
4589644_c0	4589644	haskell	0	Title: Haskell: What's my indent error Problem title: Haskell: What's my indent error Tags: haskell, indentation Problem: Haskell: What's my indent error I'm getting what I think is an indent error with the following code 152 -- find the first one who can refute the scenario 153 let cs = map ($scenario) [ Sus...	Haskell: What's my indent error Haskell: What's my indent error haskell indentation Haskell What Suspect Room Weapon refuter:ss Game.hs:159:6 Haskell: What's my indent error I'm getting what I think is an indent error with the following code The error I'm getting is When I delete or comment out lines 159-167,...	[ -0.01031494140625, -0.01214599609375, 0.0018463134765625, 0.0166015625, -0.01220703125, 0.0166015625, -0.0302734375, -0.017578125, 0.0054931640625, -0.0228271484375, 0.013427734375, -0.000492095947265625, -0.006622314453125, 0.0096435546875, 0.00787353515625, 0.00701904296875, -0.006...	[ 20625, 142508, 4865, 3768, 7, 759, 18597, 18, 18499, 1556, 1832, 16711, 38484, 1401, 11, 5416, 121956, 720, 13547, 127, 146086, 910, 5351, 678, 25632, 18151, 20949, 154109, 707, 6868, 1810, 124519, 76119, 165066, 60899, 16065, 44691 ]	[ 0.1297607421875, 0.235595703125, 0.0885009765625, 0.0909423828125, 0.065185546875, 0.1123046875, 0.214599609375, 0.1658935546875, 0.21875, 0.10565185546875, 0.065673828125, 0.1776123046875, 0.1317138671875, 0.039642333984375, 0.06048583984375, 0.08160400390625, 0.051177978515625, 0...	embed
19744794_c1	19744794	haskell	1	FormMessage postRegR :: Handler Html postRegR = do result <- runInputPost $ Registration <$> ireq textField "text" liftIO $ saveRegistration result defaultLayout [whamlet\|<p>#{show result}\|] saveRegistration :: Registration -> IO () saveRegistration r = withFile "registrations.txt" AppendMode (\h -> hPutStrLn h $ "+" +...	FormMessage postRegR :: Handler Html postRegR = do result <- runInputPost $ Registration <$> ireq textField "text" liftIO $ saveRegistration result defaultLayout [whamlet\|<p>#{show result}\|] saveRegistration :: Registration -> IO () saveRegistration r = withFile "registrations.txt" AppendMode (\h -> hPutStrLn h $ "+" +...	[ -0.00089263916015625, 0.01495361328125, -0.006744384765625, -0.0128173828125, -0.00156402587890625, 0.0220947265625, -0.009765625, -0.0029144287109375, 0.009521484375, -0.060791015625, 0.00093841552734375, 0.00848388671875, -0.0034332275390625, -0.0169677734375, -0.00122833251953125, 0...	[ 15236, 594, 6011, 1305, 54601, 1052, 10639, 603, 18, 7237, 54, 16750, 11675, 49411, 19685, 864, 7986, 19388, 22829, 60520, 17780, 30098, 1419, 114977, 53, 6056, 3915, 1974, 31374, 1690, 678, 174350, 52201, 5256, 124326, 5659, 3611, 9083, 27...	[ 0.20751953125, 0.052581787109375, 0.12744140625, 0.132568359375, 0.2276611328125, 0.1785888671875, 0.16259765625, 0.1708984375, 0.051116943359375, 0.1258544921875, 0.02691650390625, 0.1240234375, 0.05474853515625, 0.05718994140625, 0.197265625, 0.0867919921875, 0.05462646484375, 0....	embed
43567005_c1	43567005	haskell	1	o/haskell-playground/app/FactorAnamorphism.hs:22:19: error: • No instance for (Data.Functor.Classes.Show1 ExprF) arising from a use of ‘show’ • In the second argument of ‘($)’, namely ‘show $ factor 10’ In the expression: putStrLn $ show $ factor 10 In an equation for ‘main’: main = putStrLn $ show $ factor 10 -- While...	o/haskell-playground/app/FactorAnamorphism.hs:22:19: error: • No instance for (Data.Functor.Classes.Show1 ExprF) arising from a use of ‘show’ • In the second argument of ‘($)’, namely ‘show $ factor 10’ In the expression: putStrLn $ show $ factor 10 In an equation for ‘main’: main = putStrLn $ show $ factor 10 -- While...	[ 0.00128173828125, -0.01361083984375, 0.0035400390625, 0.019775390625, 0.006500244140625, 0.0057373046875, -0.012939453125, -0.0107421875, -0.0123291015625, -0.003875732421875, -0.0181884765625, -0.0206298828125, 0.0147705078125, 0.0089111328125, -0.0034942626953125, -0.01470947265625, ...	[ 36, 10557, 142508, 20706, 64330, 9007, 135518, 1290, 73026, 178851, 8780, 127, 7, 24070, 23988, 18499, 438, 110527, 100, 137989, 97249, 18770, 140803, 168660, 418, 60075, 42, 919, 187, 72219, 4527, 31374, 17932, 10750, 4369, 3650, 31461, 209,...	[ 0.04833984375, 0.1192626953125, 0.281005859375, 0.0992431640625, 0.1802978515625, 0.0775146484375, 0.1715087890625, 0.0731201171875, 0.1044921875, 0.2330322265625, 0.13037109375, 0.10089111328125, 0.0290069580078125, 0.06695556640625, 0.1453857421875, 0.2078857421875, 0.11767578125, ...	embed
13449057_c0	13449057	haskell	0	Title: How to "vertically stack" Control.Frames? Problem title: How to "vertically stack" Control.Frames? Tags: conduit, haskell, haskell-pipes Problem: How to "vertically stack" Control.Frames? In the pipes package, the tutorial Control.Pipes.Tutorial [1] shows how to "vertically stack" pipe compon...	How to "vertically stack" Control.Frames? How to "vertically stack" Control.Frames? conduit haskell haskell-pipes How Control.Frames Control.Pipes.Tutorial source1 source2 bar8 How to "vertically stack" Control.Frames? In the pipes package, the tutorial Control.Pipes.Tutorial [1] shows how to "verti...	[ 0.032958984375, 0.02294921875, -0.00421142578125, 0.005889892578125, -0.0155029296875, -0.01239013671875, -0.010498046875, 0.00012111663818359375, -0.00057220458984375, -0.037109375, 0.006134033203125, -0.0174560546875, 0.022705078125, 0.000606536865234375, -0.006195068359375, 0.005371...	[ 11249, 47, 41502, 11549, 71407, 177261, 27131, 108386, 3716, 5, 120565, 1556, 142508, 1434, 13569, 29348, 15665, 77275, 31344, 304, 1909, 1019, 137158, 7, 98169, 57143, 45831, 3642, 82761, 17368, 70, 2667, 712, 6396, 39933, 2806, 1672, 20594,...	[ 0.09759521484375, 0.0540771484375, 0.00262451171875, 0.13525390625, 0.1536865234375, 0.275390625, 0.277099609375, 0.234375, 0.1729736328125, 0.019989013671875, 0.170654296875, 0.10052490234375, 0.21142578125, 0.138916015625, 0.1453857421875, 0.147705078125, 0.04241943359375, 0.0741...	embed
33865433_c0	33865433	haskell	0	Title: Weird buffering with prompt in haskell Problem title: Weird buffering with prompt in haskell Tags: haskell Problem: Weird buffering with prompt in haskell I was playing around in Haskell and noticed something weird. I've defined a simple prompt function below. -- file: test.hs main :: IO () main = putStrLn . ("H...	Weird buffering with prompt in haskell Weird buffering with prompt in haskell haskell Weird test.hs Hello Name Weird buffering with prompt in haskell I was playing around in Haskell and noticed something weird. I've defined a simple prompt function below. When I runhaskell this, it works as expected, printing the promp...	[ -0.00494384765625, -0.005157470703125, 0.004730224609375, 0.005279541015625, -0.015869140625, 0.0274658203125, 0.013671875, 0.0035247802734375, -0.0012969970703125, 0.01495361328125, -0.001373291015625, -0.02685546875, -0.0050048828125, -0.003753662109375, 0.0006103515625, -0.005706787...	[ 1401, 82249, 123759, 4209, 678, 105876, 1556, 142508, 23, 3034, 127, 35378, 15757, 75169, 20625, 156672, 179459, 61924, 8781, 32354, 35064, 11675, 10557, 903, 43240, 84751, 2448, 40485, 759, 107730, 28412, 3514, 1916, 14847, 9969, 1340, 8966, ...	[ 0.043426513671875, 0.15771484375, 0.213623046875, 0.147705078125, 0.0811767578125, 0.272705078125, 0.1387939453125, 0.252197265625, 0.002410888671875, 0.1630859375, 0.0880126953125, 0.1334228515625, 0.149169921875, 0.02996826171875, 0.126953125, 0.022430419921875, 0.179443359375, 0...	embed
38839217_c1	38839217	haskell	1	== -1 = let rl = (findLeftNode right) in (Node (findNode right) -- This is for the (Node r left rl ((treeHeight left) - (treeHeight rl))) -- "right right" case (findRightNode right) ((1 + (max (treeHeight left) (treeHeight rl))) - (treeHeight (findRightNode right))) ) \| bf == -2 && rbf == 1 = let rl = findLeftNode rig...	== -1 = let rl = (findLeftNode right) in (Node (findNode right) -- This is for the (Node r left rl ((treeHeight left) - (treeHeight rl))) -- "right right" case (findRightNode right) ((1 + (max (treeHeight left) (treeHeight rl))) - (treeHeight (findRightNode right))) ) \| bf == -2 && rbf == 1 = let rl = findLeftNode rig...	[ -0.003021240234375, -0.01031494140625, 0.002960205078125, -0.00762939453125, 0.01483154296875, 0.0179443359375, -0.0262451171875, -0.0213623046875, 0.0034942626953125, 0.005218505859375, 0.00194549560546875, -0.034912109375, 0.01361083984375, -0.01361083984375, 0.0029449462890625, -0.0...	[ 69112, 68940, 2203, 2633, 54123, 111607, 5267, 2480, 5021, 112, 7108, 23, 4210, 3293, 83, 100, 1690, 25737, 62600, 13025, 22553, 20, 54969, 7225, 997, 24084, 58745, 150598, 122297, 619, 1230, 106, 7413, 29161, 116, 1181, 28864, 26073, 31678...	[ 0.2418212890625, 0.2451171875, 0.095947265625, 0.1217041015625, 0.1710205078125, 0.1585693359375, 0.07305908203125, 0.1673583984375, 0.2017822265625, 0.15380859375, 0.176513671875, 0.1181640625, 0.03680419921875, 0.0202178955078125, 0.00689697265625, 0.082275390625, 0.1214599609375, ...	embed
52898190_c0	52898190	haskell	0	Title: Purely functional (persistent) ring buffer Problem title: Purely functional (persistent) ring buffer Tags: purely-functional, haskell, clojure, data-structures, ocaml Problem: Purely functional (persistent) ring buffer I would like to implement a ring buffer using purely functional data structure with the follow...	Purely functional (persistent) ring buffer Purely functional (persistent) ring buffer purely-functional haskell clojure data-structures ocaml Purely Purely functional (persistent) ring buffer I would like to implement a ring buffer using purely functional data structure with the following operations Efficient random ac...	[ -0.0034027099609375, 0.041259765625, -0.0169677734375, -0.005828857421875, -0.02392578125, 0.01220703125, 0.0016632080078125, -0.00154876708984375, -0.01446533203125, -0.0205078125, -0.0042724609375, 0.005584716796875, -0.0067138671875, 0.0048828125, 0.00494384765625, 0.000602722167968...	[ 118233, 538, 123309, 21777, 6892, 18, 15789, 373, 18234, 34166, 137175, 1556, 142508, 20450, 461, 107, 2053, 137656, 36, 9779, 141, 1884, 29479, 17368, 45646, 25632, 41018, 24500, 96759, 17203, 390, 63262, 29117, 47, 12912, 181139, 1295, 4420...	[ 0.1358642578125, 0.06488037109375, 0.2364501953125, 0.055145263671875, 0.1236572265625, 0.04736328125, 0.183349609375, 0.1390380859375, 0.2330322265625, 0.141357421875, 0.124267578125, 0.06951904296875, 0.1964111328125, 0.077880859375, 0.112548828125, 0.0897216796875, 0.0957641601562...	embed
48251049_c1	48251049	haskell	1	Succ1 x) -- Defined at Nat2.hs:22:3 • In the equations for closed type family ‘Succ1’ In the type family declaration for ‘Succ1’ \| 20 \| Succ1 'One = 'Bit0 'One \| ^^^^^^^^^^^^^^^^^^^^^^^ We think it's injective because, by inspection of Succ1 , One is never in its image, so the Bit0 (Succ1 x) case never returns Bit0 One...	Succ1 x) -- Defined at Nat2.hs:22:3 • In the equations for closed type family ‘Succ1’ In the type family declaration for ‘Succ1’ \| 20 \| Succ1 'One = 'Bit0 'One \| ^^^^^^^^^^^^^^^^^^^^^^^ We think it's injective because, by inspection of Succ1 , One is never in its image, so the Bit0 (Succ1 x) case never returns Bit0 One...	[ -0.00179290771484375, -0.0098876953125, 0.0031890869140625, 0.013427734375, 0.0031890869140625, 0.005035400390625, -0.0103759765625, -0.0074462890625, 0.01165771484375, 0.00897216796875, 0.001861572265625, 0.008056640625, 0.01141357421875, 0.0123291015625, 0.0301513671875, -0.003967285...	[ 1832, 10060, 418, 1022, 262, 5983, 68875, 5442, 127, 24070, 363, 13722, 155738, 10644, 14449, 14168, 21635, 387, 62068, 2203, 571, 217, 2389, 5351, 115049, 5844, 134071, 6561, 8306, 6863, 29569, 27774, 7225, 30646, 79612, 10750, 959, 68034, ...	[ 0.19091796875, 0.258056640625, 0.12841796875, 0.1246337890625, 0.01373291015625, 0.149169921875, 0.0765380859375, 0.0142059326171875, 0.01007080078125, 0.009033203125, 0.0200042724609375, 0.1737060546875, 0.1630859375, 0.194580078125, 0.1573486328125, 0.1649169921875, 0.1434326171875...	embed
68031616_c1	68031616	haskell	1	ConsSet_ x xs where ConsSet x xs \| not (elemS x xs) = ConsSet_ x xs elemS x NilSet_ = False elemS x (ConsSet_ y ys) \| x == y = True -- infers (Eq a) for elemS \| otherwise = elemS x ys GHC infers the constraint elemS :: Eq t => t -> NoCSet t -> Bool . But it doesn't infer a constraint for ConsSet that uses it. Rather, ...	ConsSet_ x xs where ConsSet x xs \| not (elemS x xs) = ConsSet_ x xs elemS x NilSet_ = False elemS x (ConsSet_ y ys) \| x == y = True -- infers (Eq a) for elemS \| otherwise = elemS x ys GHC infers the constraint elemS :: Eq t => t -> NoCSet t -> Bool . But it doesn't infer a constraint for ConsSet that uses it. Rather, ...	[ -0.0023040771484375, 0.033447265625, 0.004150390625, -0.0167236328125, 0.0076904296875, -0.00811767578125, -0.0089111328125, -0.0250244140625, 0.005340576171875, 0.00897216796875, -0.0033721923828125, -0.0030059814453125, 0.00121307373046875, 0.007354736328125, 0.005126953125, 0.020141...	[ 39215, 294, 126, 454, 1022, 7, 7440, 959, 27889, 195, 77175, 22225, 11935, 113, 69112, 87599, 53498, 864, 88, 527, 73265, 158, 2816, 4288, 808, 438, 19283, 2460, 929, 4527, 75161, 80934, 110527, 100, 10, 187, 72219, 30022, 15190, 107, 3...	[ 0.207763671875, 0.19775390625, 0.2052001953125, 0.01678466796875, 0.09326171875, 0.041168212890625, 0.003692626953125, 0.1025390625, 0.1705322265625, 0.1639404296875, 0.1005859375, 0.041748046875, 0.06646728515625, 0.04150390625, 0.00177001953125, 0.0567626953125, 0.1695556640625, ...	embed
31397655_c0	31397655	haskell	0	Title: Saving a Pulse Audio stream with Haskell bindings Problem title: Saving a Pulse Audio stream with Haskell bindings Tags: audio, pulseaudio, haskell, io Problem: Saving a Pulse Audio stream with Haskell bindings Using the pulse-simple package I have made the following code: main=do s<-simpleNew Nothing "example" ...	Saving a Pulse Audio stream with Haskell bindings Saving a Pulse Audio stream with Haskell bindings audio pulseaudio haskell io Saving Pulse Audio Haskell Nothing Record SampleSpec F32 LittleEndian Float Play Saving a Pulse Audio stream with Haskell bindings Using the pulse-simple package I have made the following code...	[ -0.003265380859375, 0.01031494140625, -0.0079345703125, 0.030517578125, 0.0032501220703125, 0.005767822265625, 0.0030517578125, -0.0152587890625, 0.00457763671875, -0.0206298828125, 0.00127410888671875, -0.03369140625, 0.017578125, 0.0101318359375, -0.00121307373046875, -0.021850585937...	[ 947, 6496, 10, 21694, 184, 32134, 75973, 678, 20625, 142508, 128239, 18215, 55111, 5670, 1556, 22995, 182747, 54877, 33209, 47107, 563, 6460, 59784, 7768, 27201, 38699, 257, 11356, 13, 191560, 98169, 25632, 18151, 43240, 115923, 209, 94131, 1...	[ 0.1474609375, 0.09619140625, 0.0118408203125, 0.2135009765625, 0.192138671875, 0.22705078125, 0.2091064453125, 0.0938720703125, 0.156494140625, 0.263671875, 0.2210693359375, 0.222900390625, 0.209716796875, 0.176513671875, 0.1414794921875, 0.172607421875, 0.1600341796875, 0.13903808...	embed
32445309_c0	32445309	haskell	0	Title: Why does my parallel traversal Haskell program leak memory? Problem title: Why does my parallel traversal Haskell program leak memory? Tags: space-leak, memory-leaks, haskell Problem: Why does my parallel traversal Haskell program leak memory? Consider the following Haskell program (I'm doing this mostly for lea...	Why does my parallel traversal Haskell program leak memory? Why does my parallel traversal Haskell program leak memory? space-leak memory-leaks haskell qualified System.Environment Control.Concurrent Control.Monad Why Haskell Control.Concurrent.MSem Sem Traverse Foldable Sem.new forM_ Sem.with Why does my parallel trav...	[ -0.016845703125, 0.02490234375, -0.0206298828125, -0.0113525390625, 0.00689697265625, 0.0206298828125, -0.01055908203125, -0.00921630859375, 0.002716064453125, -0.05517578125, 0.0145263671875, 0.0164794921875, 0.002960205078125, 0.0157470703125, 0.00927734375, 0.016357421875, 0.01831...	[ 44084, 14602, 95103, 37317, 289, 20625, 142508, 1528, 95, 344, 98323, 759, 32628, 133, 24251, 1556, 217225, 12353, 27131, 163812, 712, 11935, 195, 10232, 4937, 37676, 30077, 2886, 54936, 100, 454, 76228, 25632, 153161, 52080, 60042, 3229, 87,...	[ 0.1229248046875, 0.02911376953125, 0.201416015625, 0.1661376953125, 0.07342529296875, 0.1275634765625, 0.2359619140625, 0.144775390625, 0.17333984375, 0.2041015625, 0.194580078125, 0.008819580078125, 0.1453857421875, 0.1715087890625, 0.12451171875, 0.103515625, 0.112060546875, 0.06...	embed
25661781_c0	25661781	haskell	0	Title: Caching internals with a partially applied function Problem title: Caching internals with a partially applied function Tags: caching, closures, haskell, partial-application Problem: Caching internals with a partially applied function Imagine such a function: bar :: Foo -> A -> B -> C -> IO () That function perfo...	Caching internals with a partially applied function Caching internals with a partially applied function caching closures haskell partial-application Caching Foo IORef Caching internals with a partially applied function Imagine such a function: That function performs some IO stuff using a Foo and other values. The Foo v...	[ 0.010009765625, 0.007415771484375, 0.0035400390625, -0.005340576171875, 0.002838134765625, 0.0128173828125, -0.0081787109375, -0.0021514892578125, 0.0125732421875, -0.0196533203125, -0.0040283203125, 0.01556396484375, -0.00732421875, 0.0234375, 0.01300048828125, -0.0189208984375, -0....	[ 2041, 59207, 70796, 678, 2878, 25958, 190659, 32354, 377, 170224, 1556, 142508, 289, 101687, 9572, 31, 123435, 4240, 133196, 51339, 17780, 41884, 17368, 142424, 34292, 115081, 1909, 97351, 1829, 62, 1193, 756, 111719, 34166, 43257, 1884, 139392...	[ 0.1551513671875, 0.1497802734375, 0.2017822265625, 0.0133056640625, 0.1534423828125, 0.0518798828125, 0.1763916015625, 0.1676025390625, 0.1510009765625, 0.210205078125, 0.07025146484375, 0.2113037109375, 0.0279083251953125, 0.131591796875, 0.180419921875, 0.140869140625, 0.1097412109...	embed
50288939_c1	50288939	haskell	1	name; return Type; }; const TAG = Symbol("TAG"); const List = Type("List"); // data constructors const Cons = x => tx => List("Cons") (cases => cases.Cons(x) (tx)); const Nil = List("Nil") (cases => cases.Nil); // overload binary functions const overload2 = (name, dispatch) => { const pairs = new Map(); return { [`${n...	name; return Type; }; const TAG = Symbol("TAG"); const List = Type("List"); // data constructors const Cons = x => tx => List("Cons") (cases => cases.Cons(x) (tx)); const Nil = List("Nil") (cases => cases.Nil); // overload binary functions const overload2 = (name, dispatch) => { const pairs = new Map(); return { [`${n...	[ -0.0022125244140625, 0.0098876953125, 0.0023040771484375, -0.0032196044921875, 0.005096435546875, -0.001678466796875, 0.005035400390625, -0.00994873046875, 0.010986328125, -0.007476806640625, 0.01141357421875, 0.0089111328125, 0.01806640625, -0.003662109375, 0.006988525390625, 0.013427...	[ 9351, 74, 30646, 60457, 158, 271, 125933, 2203, 131899, 188226, 32036, 154663, 4666, 2053, 64549, 25251, 39215, 1022, 808, 425, 11935, 7, 58437, 50218, 18, 77175, 839, 379, 645, 63033, 2394, 6635, 32354, 304, 11627, 58580, 257, 80836, 3525,...	[ 0.1680908203125, 0.0207672119140625, 0.1695556640625, 0.2135009765625, 0.13720703125, 0.1468505859375, 0.21728515625, 0.04156494140625, 0.184326171875, 0.1907958984375, 0.1856689453125, 0.1422119140625, 0.05230712890625, 0.1505126953125, 0.1943359375, 0.13818359375, 0.2420654296875, ...	embed
76668781_c0	76668781	haskell	0	Title: Haskell foldr function in instance Foldable Problem title: Haskell foldr function in instance Foldable Tags: fold, haskell Problem: Haskell foldr function in instance Foldable data Tree a = Empty \| Tree a (Tree a) (Tree a) deriving (Show, Eq, Read) I have this data Tree in my programm and i need a foldr funtion ...	Haskell foldr function in instance Foldable Haskell foldr function in instance Foldable fold haskell Haskell Foldable Tree Empty Show Read Haskell foldr function in instance Foldable I have this data Tree in my programm and i need a foldr funtion in instance Foldable Tree where . The Function should go first through pi...	[ 0.006805419921875, -0.0086669921875, 0.00970458984375, -0.017333984375, -0.00445556640625, 0.03076171875, -0.0216064453125, -0.03076171875, -0.0198974609375, -0.01251220703125, -0.00139617919921875, -0.031494140625, -0.0004100799560546875, 0.007720947265625, 0.0012969970703125, -0.0052...	[ 20625, 142508, 18344, 7569, 32354, 110527, 30077, 71, 2886, 23, 42822, 1556, 101344, 31678, 939, 17367, 4764, 2053, 28966, 3871, 7477, 1363, 7440, 28670, 10763, 738, 5117, 8305, 80953, 18, 12830, 164917, 53201, 167785, 26366, 678, 7413, 70, ...	[ 0.10015869140625, 0.2303466796875, 0.150146484375, 0.22607421875, 0.160400390625, 0.21728515625, 0.126953125, 0.04644775390625, 0.1693115234375, 0.0213165283203125, 0.1746826171875, 0.07611083984375, 0.19287109375, 0.133056640625, 0.029266357421875, 0.099853515625, 0.1260986328125, ...	embed
67037663_c1	67037663	haskell	1	:: Todo -> String showList' (Todo s) = "[ ] " ++ s showList' (TodoList s ts) = "[ ] " ++ s ++ "<ul><li>" ++ intercalate "</li><li>" (map showList' ts) ++ "</li></ul>" which, fed like this putStrLn $ showList' $ TodoList "Main" [Todo "1.", TodoList "2." [Todo "2.1", Todo "2.2"], Todo "3."] generates this output [ ] Mai...	:: Todo -> String showList' (Todo s) = "[ ] " ++ s showList' (TodoList s ts) = "[ ] " ++ s ++ "<ul><li>" ++ intercalate "</li><li>" (map showList' ts) ++ "</li></ul>" which, fed like this putStrLn $ showList' $ TodoList "Main" [Todo "1.", TodoList "2." [Todo "2.1", Todo "2.2"], Todo "3."] generates this output [ ] Mai...	[ -0.0244140625, -0.0010833740234375, 0.00010204315185546875, 0.0233154296875, 0.0025634765625, 0.015625, -0.0023345947265625, -0.0224609375, 0.00848388671875, 0.0208740234375, -0.0020751953125, -0.0299072265625, -0.00070953369140625, 0.0213623046875, -0.01708984375, 0.002197265625, 0....	[ 1984, 26657, 23351, 214, 7639, 154663, 25, 7763, 246, 91, 37223, 61636, 1940, 62309, 67, 62346, 51158, 3884, 71713, 3650, 168793, 68107, 70147, 363, 139392, 140992, 12321, 34513, 41187, 1031, 85590, 19097, 2663, 9655, 79516, 11001, 13315, 347...	[ 0.0225677490234375, 0.256103515625, 0.16552734375, 0.07037353515625, 0.223876953125, 0.287353515625, 0.07037353515625, 0.125732421875, 0.208984375, 0.1138916015625, 0.0777587890625, 0.0665283203125, 0.00848388671875, 0.1158447265625, 0.03277587890625, 0.0662841796875, 0.1297607421875...	embed
12759481_c0	12759481	haskell	0	Title: Why is (a, a) not a functor? Problem title: Why is (a, a) not a functor? Tags: functor, haskell, type-systems, typeclass Problem: Why is (a, a) not a functor? Possible Duplicate: Making (a, a) a Functor I wrote the following implementation of quicksort: import Data.List (partition) quicksort [] = [] quicksort (x...	Why is (a, a) not a functor? Why is (a, a) not a functor? functor haskell type-systems typeclass Data.List Why x:xs Functor Kind Why is (a, a) not a functor? I wrote the following implementation of quicksort: Then I wanted to abbreviate the two recursive calls to quicksort by applying fmap to the list pair: But apparen...	[ -0.007080078125, 0.01214599609375, 0.0010528564453125, -0.00897216796875, 0.00118255615234375, 0.005126953125, -0.00872802734375, -0.031494140625, 0.015625, 0.0157470703125, -0.01251220703125, 0.0018463134765625, 0.00023651123046875, -0.0037384033203125, -0.010009765625, -0.01489257812...	[ 44084, 83, 11, 4, 10, 959, 7477, 18770, 1556, 142508, 10644, 16751, 67413, 11809, 154663, 1022, 12, 425, 7, 28670, 27435, 54397, 208124, 63773, 62351, 36663, 105160, 101426, 6626, 195625, 5844, 11782, 59911, 1238, 62346, 5303, 80836, 22691, ...	[ 0.123779296875, 0.09698486328125, 0.1292724609375, 0.12255859375, 0.16650390625, 0.189697265625, 0.1875, 0.19677734375, 0.0875244140625, 0.191650390625, 0.1556396484375, 0.0863037109375, 0.1102294921875, 0.03546142578125, 0.064208984375, 0.06268310546875, 0.01910400390625, 0.076354...	embed
16499136_c0	16499136	haskell	0	Title: How to tell what type the DynamicImage loaded by Codec.Picture is Problem title: How to tell what type the DynamicImage loaded by Codec.Picture is Tags: codec, types, haskell Problem: How to tell what type the DynamicImage loaded by Codec.Picture is I am trying to load a PNG using the JuicyPixels library and I a...	How to tell what type the DynamicImage loaded by Codec.Picture is How to tell what type the DynamicImage loaded by Codec.Picture is codec types haskell How DynamicImage Codec.Picture ImageY8 Image Pixel8 ImageYA8 PixelYA8 ImageRGB8 PixelRGB8 ImageRGBA8 PixelRGBA8 ImageYCbCr8 PixelYCbCr8 ImageRBA8 How to tell what type ...	[ 0.0224609375, -0.000782012939453125, 0.010498046875, 0.044677734375, -0.00011873245239257812, 0.01055908203125, -0.023193359375, 0.0103759765625, -0.00726318359375, -0.00023937225341796875, -0.00439453125, -0.024169921875, -0.005615234375, -0.0306396484375, -0.0037078857421875, 0.02648...	[ 11249, 14192, 2367, 10644, 73327, 21068, 216960, 72367, 28864, 238, 683, 1771, 6644, 83, 390, 18151, 52895, 1556, 142508, 22710, 1723, 1019, 111159, 14671, 8359, 48802, 8031, 8066, 3314, 2408, 29348, 52851, 35773, 26366, 1379, 538, 29569, 619...	[ 0.01373291015625, 0.1348876953125, 0.05157470703125, 0.1905517578125, 0.144775390625, 0.117431640625, 0.263916015625, 0.15673828125, 0.1507568359375, 0.09918212890625, 0.07080078125, 0.15966796875, 0.120849609375, 0.0745849609375, 0.010406494140625, 0.138671875, 0.1937255859375, 0....	embed
3750529_c0	3750529	haskell	0	Title: How much time have you invested in order to have a good grasp on Haskell? Problem title: How much time have you invested in order to have a good grasp on Haskell? Tags: haskell, functional-programming Problem: How much time have you invested in order to have a good grasp on Haskell? I know this question may soun...	How much time have you invested in order to have a good grasp on Haskell? How much time have you invested in order to have a good grasp on Haskell? haskell functional-programming How Haskell How much time have you invested in order to have a good grasp on Haskell? I know this question may sound silly, but I am learning...	[ 0.0022430419921875, 0.0164794921875, 0.015625, -0.0023345947265625, -0.0098876953125, 0.00457763671875, -0.02294921875, -0.0086669921875, 0.014892578125, -0.04248046875, 0.0079345703125, -0.034423828125, -0.0115966796875, 0.0098876953125, -0.027587890625, 0.0108642578125, 0.012817382...	[ 11249, 5045, 1733, 765, 398, 14145, 297, 12989, 4127, 27689, 254, 98, 20625, 142508, 1556, 123309, 28966, 47, 10, 12097, 52080, 19713, 31577, 100, 1672, 201, 13312, 122799, 12301, 147, 796, 7232, 7, 581, 17119, 50592, 78804, 27958, 96704, ...	[ 0.0684814453125, 0.1392822265625, 0.181884765625, 0.103759765625, 0.04266357421875, 0.184814453125, 0.072509765625, 0.057952880859375, 0.1044921875, 0.1611328125, 0.1220703125, 0.100830078125, 0.19384765625, 0.29833984375, 0.142578125, 0.15380859375, 0.061614990234375, 0.0791625976...	embed
52914495_c0	52914495	haskell	0	Title: How to instantiate Eq (or any class) for a type with different constructors Haskell Problem title: How to instantiate Eq (or any class) for a type with different constructors Haskell Tags: haskell Problem: How to instantiate Eq (or any class) for a type with different constructors Haskell I have a doubt about th...	How to instantiate Eq (or any class) for a type with different constructors Haskell How to instantiate Eq (or any class) for a type with different constructors Haskell haskell How Haskell Person Example Constructor1 Integer Constructor2 How to instantiate Eq (or any class) for a type with different constructors Haskell...	[ 0.0019378662109375, 0.01904296875, -0.0009002685546875, 0.0208740234375, 0.00201416015625, 0.00848388671875, -0.00762939453125, -0.00144195556640625, 0.002838134765625, -0.0000972747802734375, 0.00787353515625, -0.001129150390625, 0.0191650390625, 0.0235595703125, -0.02392578125, -0.00...	[ 11249, 47, 34648, 101426, 241, 864, 2499, 18507, 100, 10644, 678, 12921, 64549, 25251, 20625, 142508, 748, 1556, 15270, 89536, 8705, 82084, 18770, 418, 44401, 304, 765, 92814, 13580, 903, 3444, 831, 134598, 21771, 14, 27686, 69101, 3293, 39...	[ 0.081787109375, 0.06268310546875, 0.200439453125, 0.2098388671875, 0.1474609375, 0.253662109375, 0.05615234375, 0.173583984375, 0.065185546875, 0.201416015625, 0.1197509765625, 0.1959228515625, 0.162841796875, 0.10296630859375, 0.1243896484375, 0.177001953125, 0.01226806640625, 0.1...	embed
41791588_c0	41791588	haskell	0	Title: How does argument passing order affect lazy evaluation in Haskell? Problem title: How does argument passing order affect lazy evaluation in Haskell? Tags: recursion, haskell, lazy-evaluation Problem: How does argument passing order affect lazy evaluation in Haskell? I've been trying to understand lazy evaluation...	How does argument passing order affect lazy evaluation in Haskell? How does argument passing order affect lazy evaluation in Haskell? recursion haskell lazy-evaluation How Haskell fib2 Exception How does argument passing order affect lazy evaluation in Haskell? I've been trying to understand lazy evaluation in Haskell ...	[ 0.01416015625, 0.017822265625, -0.0034942626953125, -0.01385498046875, -0.006378173828125, 0.010986328125, 0.006134033203125, -0.011962890625, 0.00653076171875, -0.00009632110595703125, 0.027587890625, -0.0091552734375, -0.0004711151123046875, 0.004058837890625, 0.0283203125, 0.0006332...	[ 11249, 10750, 452, 6953, 12989, 52490, 21, 3285, 219836, 20625, 142508, 14602, 23, 195625, 1830, 1556, 159258, 809, 275, 304, 5443, 63928, 151575, 13, 3229, 765, 29479, 20990, 52544, 93766, 82249, 224833, 153941, 4488, 35839, 678, 12960, 6806...	[ 0.056427001953125, 0.2266845703125, 0.08013916015625, 0.0809326171875, 0.1917724609375, 0.1385498046875, 0.130126953125, 0.1962890625, 0.203125, 0.1182861328125, 0.259765625, 0.0158843994140625, 0.022705078125, 0.14404296875, 0.01922607421875, 0.103759765625, 0.16943359375, 0.08966...	embed
42248592_c1	42248592	haskell	1	s (322.4 μs .. 333.0 μs) 0.997 R² (0.996 R² .. 0.998 R²) mean 328.7 μs (324.1 μs .. 334.2 μs) std dev 16.95 μs (14.63 μs .. 22.02 μs) and forall : time 113.2 μs (111.2 μs .. 115.0 μs) 0.997 R² (0.996 R² .. 0.998 R²) mean 112.0 μs (110.0 μs .. 113.9 μs) std dev 6.333 μs (5.127 μs .. 7.896 μs) Performance measured using ...	s (322.4 μs .. 333.0 μs) 0.997 R² (0.996 R² .. 0.998 R²) mean 328.7 μs (324.1 μs .. 334.2 μs) std dev 16.95 μs (14.63 μs .. 22.02 μs) and forall : time 113.2 μs (111.2 μs .. 115.0 μs) 0.997 R² (0.996 R² .. 0.998 R²) mean 112.0 μs (110.0 μs .. 113.9 μs) std dev 6.333 μs (5.127 μs .. 7.896 μs) Performance measured using ...	[ -0.0059814453125, -0.0120849609375, 0.01068115234375, -0.0062255859375, -0.00116729736328125, 0.00238037109375, -0.002166748046875, -0.021484375, 0.01220703125, 0.00180816650390625, 0.0096435546875, -0.024169921875, 0.005096435546875, 0.010498046875, -0.0084228515625, -0.00466918945312...	[ 91, 6460, 116591, 15247, 1468, 3912, 132265, 7, 757, 183778, 627, 304, 185245, 158931, 10461, 29459, 2789, 210257, 120518, 117904, 6138, 71, 33245, 6849, 8821, 9550, 100, 5584, 1733, 534, 107033, 27252, 48400, 73011, 2289, 66000, 16, 94030, ...	[ 0.1536865234375, 0.1259765625, 0.1153564453125, 0.141845703125, 0.0287933349609375, 0.1044921875, 0.110107421875, 0.003936767578125, 0.02978515625, 0.1458740234375, 0.07293701171875, 0.216552734375, 0.086669921875, 0.0911865234375, 0.09332275390625, 0.1812744140625, 0.10205078125, ...	embed
29884768_c0	29884768	haskell	0	Title: Haskell: List append operation Problem title: Haskell: List append operation Tags: haskell, list Problem: Haskell: List append operation I'm looking at 99 problems solved in Haskell . I'm trying to understand few basics here. combinations :: Int -> [a] -> [[a]] combinations _ [] = [[]] combinations 0 _ = [[]] co...	Haskell: List append operation Haskell: List append operation haskell list a Haskell List x:xs x_start k-1 Num GHCi Haskell: List append operation I'm looking at 99 problems solved in Haskell . I'm trying to understand few basics here. consider, combinations 1 [3, 4] pattern matches with the combinations k (x:xs) . We ...	[ -0.0172119140625, 0.025146484375, 0.006011962890625, -0.0069580078125, 0.000545501708984375, 0.0184326171875, 0.002716064453125, 0.005340576171875, 0.01708984375, -0.000476837158203125, 0.0196533203125, -0.0252685546875, 0.017333984375, 0.00823974609375, -0.01171875, -0.002182006835937...	[ 20625, 142508, 32036, 114689, 71, 41018, 12, 1556, 5303, 1022, 425, 7, 454, 17137, 472, 5759, 52782, 527, 73265, 14, 16487, 10078, 44402, 86869, 28219, 10846, 62822, 16916, 162515, 106, 122101, 201, 103510, 14858, 678, 4034, 242122, 1221, 7...	[ 0.1334228515625, 0.2261962890625, 0.20361328125, 0.20263671875, 0.111083984375, 0.166259765625, 0.043212890625, 0.150634765625, 0.156494140625, 0.1405029296875, 0.0933837890625, 0.036712646484375, 0.06982421875, 0.20849609375, 0.1304931640625, 0.1431884765625, 0.1444091796875, 0.04...	embed
33181063_c1	33181063	haskell	1	:: (MonadPlus m) => Int -> SearchTree a -> (m a, [SearchTree a]) cutoff cu = go cu where plus ~(m0, l0) ~(m1, l1) = (mplus m0 m1, l0 ++ l1) zero = (mzero, []) go 0 x = (mzero, [x]) go _ Contradiction = zero go _ (Solution a) = (return a, []) go d (Search ps) = foldr plus zero $ map (go $ d-1) ps cutoffEval :: MonadPlu...	:: (MonadPlus m) => Int -> SearchTree a -> (m a, [SearchTree a]) cutoff cu = go cu where plus ~(m0, l0) ~(m1, l1) = (mplus m0 m1, l0 ++ l1) zero = (mzero, []) go 0 x = (mzero, [x]) go _ Contradiction = zero go _ (Solution a) = (return a, []) go d (Search ps) = foldr plus zero $ map (go $ d-1) ps cutoffEval :: MonadPlu...	[ 0.0096435546875, 0.02294921875, 0.0086669921875, 0.011474609375, 0.01336669921875, -0.00445556640625, -0.0030059814453125, -0.030029296875, 0.03125, -0.03173828125, 0.003082275390625, -0.018798828125, 0.0062255859375, 0.020263671875, 0.0086669921875, -0.010009765625, 0.00628662109375...	[ 1984, 46674, 712, 88225, 347, 360, 18, 33086, 62731, 13, 10, 39, 221175, 59226, 16713, 314, 2203, 738, 1001, 2389, 77495, 32108, 37223, 45234, 80510, 757, 45380, 428, 102588, 65395, 24014, 7569, 22288, 519, 104, 110218, 1405, 60331, 71, 6...	[ 0.03759765625, 0.10467529296875, 0.0811767578125, 0.2490234375, 0.128173828125, 0.03924560546875, 0.04180908203125, 0.17578125, 0.2314453125, 0.0733642578125, 0.110595703125, 0.047454833984375, 0.1630859375, 0.162109375, 0.23876953125, 0.2249755859375, 0.035430908203125, 0.07897949...	embed
31687381_c2	31687381	haskell	2	.Vector, Data.Vector.Generic.Base.basicLength, vec_a320, V_Node, Could, Data.Vector.Generic.Base.basicUnsafeFreeze, Control.Monad.Primitive.PrimMonad, Data.Vector.Generic.Base.Mutable, Control.Monad.Primitive.PrimState, debox_error.hs, Control.Monad.liftM, mvec_a31Y, MV_Node, Data.Vector.Generic.Base.basicUnsafeThaw, D...	.Vector, Data.Vector.Generic.Base.basicLength, vec_a320, V_Node, Could, Data.Vector.Generic.Base.basicUnsafeFreeze, Control.Monad.Primitive.PrimMonad, Data.Vector.Generic.Base.Mutable, Control.Monad.Primitive.PrimState, debox_error.hs, Control.Monad.liftM, mvec_a31Y, MV_Node, Data.Vector.Generic.Base.basicUnsafeThaw, D...	[ -0.023681640625, 0.02001953125, -0.007537841796875, 0.0152587890625, 0.0361328125, -0.00421142578125, -0.0179443359375, -0.0250244140625, 0.0177001953125, -0.006805419921875, -0.0086669921875, -0.01171875, 0.0032806396484375, 0.003814697265625, -0.023681640625, -0.00469970703125, 0.0...	[ 5, 26455, 18770, 4, 11809, 135932, 12259, 63473, 13, 402, 27744, 5267, 449, 927, 22834, 454, 11, 76531, 310, 5021, 112, 191147, 14256, 115840, 81437, 731, 27131, 46674, 712, 145111, 14, 4935, 10685, 22819, 135206, 8, 11728, 188800, 127, 7...	[ 0.171142578125, 0.265625, 0.303955078125, 0.0740966796875, 0.204833984375, 0.1854248046875, 0.150146484375, 0.1973876953125, 0.1497802734375, 0.1627197265625, 0.14013671875, 0.058685302734375, 0.155517578125, 0.04547119140625, 0.267578125, 0.044281005859375, 0.085205078125, 0.26171...	embed
3261844_c0	3261844	haskell	0	Title: Haskell - Use Just or no Just made difference, but I don't know why Problem title: Haskell - Use Just or no Just made difference, but I don't know why Tags: haskell, option-type, types Problem: Haskell - Use Just or no Just made difference, but I don't know why I've found such code in the book "Real Wo...	Haskell - Use Just or no Just made difference, but I don't know why Haskell - Use Just or no Just made difference, but I don't know why haskell option-type types Haskell Use Just Tree Node Empty Show Nothing Main Num Maybe Haskell - Use Just or no Just made difference, but I don't know why I've found such cod...	[ -0.01025390625, 0.01806640625, 0.0133056640625, -0.004302978515625, 0.01611328125, 0.01611328125, -0.0026702880859375, 0.00004673004150390625, 0.00183868408203125, -0.01007080078125, 0.00286865234375, -0.027587890625, 0.00885009765625, 0.002105712890625, 0.006378173828125, -0.015991210...	[ 20625, 142508, 36836, 9563, 707, 110, 7228, 60212, 3768, 3714, 15400, 1556, 35829, 50986, 52895, 101344, 438, 112, 31678, 939, 17367, 182747, 12321, 52782, 83425, 6044, 18151, 23, 12877, 68996, 6661, 16028, 4865, 12447, 2053, 64549, 748, 54, ...	[ 0.103271484375, 0.220458984375, 0.1253662109375, 0.224853515625, 0.07635498046875, 0.1474609375, 0.05389404296875, 0.197021484375, 0.0345458984375, 0.04498291015625, 0.05352783203125, 0.0858154296875, 0.1832275390625, 0.1295166015625, 0.1514892578125, 0.1668701171875, 0.098388671875,...	embed
26117165_c1	26117165	haskell	1	a sudden, my cabal test began to hang and fail with a timeout (I use wreq as client library to test REST services). It took me a couple of hours to pin down the actual error on the server side: tests: thread blocked indefinitely in an STM transaction . Suspecting the serialisation routine, it took me another couple of...	a sudden, my cabal test began to hang and fail with a timeout (I use wreq as client library to test REST services). It took me a couple of hours to pin down the actual error on the server side: tests: thread blocked indefinitely in an STM transaction . Suspecting the serialisation routine, it took me another couple of...	[ -0.010009765625, 0.01251220703125, 0.00396728515625, -0.0164794921875, 0.0177001953125, -0.0181884765625, 0.00136566162109375, 0.0027008056640625, 0.009765625, -0.03515625, 0.01544189453125, -0.002532958984375, -0.00022792816162109375, 0.0162353515625, -0.000301361083984375, 0.0078125,...	[ 109524, 3034, 10756, 35782, 1733, 6056, 107, 864, 23282, 35773, 21828, 11374, 21974, 8561, 18499, 10723, 5609, 109921, 86997, 46389, 297, 49919, 23, 10111, 124161, 16711, 35686, 15032, 124374, 30022, 167969, 102778, 14507, 28219, 56282, 38157, ...	[ 0.258544921875, 0.2137451171875, 0.188232421875, 0.154296875, 0.083740234375, 0.1317138671875, 0.16455078125, 0.108154296875, 0.06719970703125, 0.08538818359375, 0.1185302734375, 0.047119140625, 0.0305938720703125, 0.002288818359375, 0.165771484375, 0.07440185546875, 0.00662231445312...	embed
39058971_c1	39058971	haskell	1	a list of the files searched for. How can stack be loading these packages successfully, then be somehow unable to find them later? How can it have the nerve (jk) to ask me to put the dependencies in my .cabal file, when it has already obtained them from there to load them in the first place? Here is the dependency lis...	a list of the files searched for. How can stack be loading these packages successfully, then be somehow unable to find them later? How can it have the nerve (jk) to ask me to put the dependencies in my .cabal file, when it has already obtained them from there to load them in the first place? Here is the dependency lis...	[ 0.006439208984375, -0.01409912109375, 0.004852294921875, 0.01226806640625, -0.00555419921875, 0.01214599609375, -0.006134033203125, -0.01416015625, 0.0135498046875, 0.00775146484375, -0.00069427490234375, -0.0284423828125, 0.0016326904296875, 0.0172119140625, -0.000339508056640625, 0.0...	[ 10, 5303, 102158, 33938, 297, 100, 11249, 831, 177261, 186, 72367, 214, 6097, 98169, 65771, 4, 209303, 51, 2886, 47, 7413, 2856, 14432, 765, 70, 24030, 13, 49622, 26458, 163, 3884, 42548, 117538, 5, 408, 3571, 11435, 442, 21771, 113054, ...	[ 0.004913330078125, 0.234619140625, 0.21142578125, 0.178466796875, 0.117431640625, 0.1148681640625, 0.052978515625, 0.051513671875, 0.288818359375, 0.0189056396484375, 0.1492919921875, 0.0311279296875, 0.059051513671875, 0.2244873046875, 0.142822265625, 0.000640869140625, 0.0620422363...	embed
26480543_c0	26480543	haskell	0	Title: How to serialize/deserialize objects sent over the network in Haskell? Problem title: How to serialize/deserialize objects sent over the network in Haskell? Tags: haskell, sockets, serialization Problem: How to serialize/deserialize objects sent over the network in Haskell? I see that there are many ways to seri...	How to serialize/deserialize objects sent over the network in Haskell? How to serialize/deserialize objects sent over the network in Haskell? haskell sockets serialization How Haskell How to serialize/deserialize objects sent over the network in Haskell? I see that there are many ways to serialize/deserialize Haskell o...	[ 0.017822265625, 0.01263427734375, -0.011474609375, 0.015869140625, -0.00848388671875, -0.01544189453125, -0.031005859375, 0.01446533203125, -0.00927734375, -0.00836181640625, 0.01495361328125, -0.037353515625, 0.03857421875, 0.002105712890625, 0, -0.0027618408203125, 0.0068359375, ...	[ 11249, 47, 35686, 20650, 64, 988, 25435, 119066, 36746, 9325, 645, 33120, 23, 20625, 142508, 1556, 221, 27853, 47691, 7, 5941, 48322, 11809, 5, 294, 33079, 22, 40899, 8, 32354, 73, 10557, 1478, 19155, 205956, 821, 58627, 335, 38415, 16958...	[ 0.09576416015625, 0.045745849609375, 0.2421875, 0.1300048828125, 0.0811767578125, 0.189453125, 0.2203369140625, 0.12060546875, 0.2237548828125, 0.1339111328125, 0.115966796875, 0.1297607421875, 0.0736083984375, 0.1695556640625, 0.251953125, 0.1199951171875, 0.0557861328125, 0.13989...	embed
27866848_c0	27866848	haskell	0	Title: having some trouble with user input and output in haskell Problem title: having some trouble with user input and output in haskell Tags: io, haskell Problem: having some trouble with user input and output in haskell Hi there I am just starting out with haskell and I have hit a block at a simple question involvin...	having some trouble with user input and output in haskell having some trouble with user input and output in haskell io haskell GHCI Main Sorry What having some trouble with user input and output in haskell Hi there I am just starting out with haskell and I have hit a block at a simple question involving input and outpu...	[ -0.0159912109375, 0.0074462890625, -0.005523681640625, 0.01019287109375, 0.00701904296875, 0.038818359375, 0.0019683837890625, 0.01458740234375, -0.0032958984375, 0.0062255859375, 0.004150390625, -0.01409912109375, -0.02001953125, 0.0172119140625, -0.00860595703125, -0.004425048828125,...	[ 19441, 3060, 63134, 678, 38937, 107730, 136, 140992, 23, 1556, 142508, 22995, 41877, 17304, 12321, 90502, 4865, 72134, 1810, 5962, 46389, 8781, 9655, 31577, 26458, 48909, 7, 37170, 2367, 16750, 2806, 154107, 101935, 4669, 8934, 25842, 2174, 3...	[ 0.0791015625, 0.10064697265625, 0.1734619140625, 0.06689453125, 0.1727294921875, 0.2183837890625, 0.1185302734375, 0.2257080078125, 0.05615234375, 0.15380859375, 0.23974609375, 0.1553955078125, 0.0894775390625, 0.1387939453125, 0.0164794921875, 0.1090087890625, 0.0272674560546875, ...	embed
61882345_c0	61882345	haskell	0	Title: How does this Haskell Pandoc filter work? Problem title: How does this Haskell Pandoc filter work? Tags: haskell, pandoc Problem: How does this Haskell Pandoc filter work? I want to use Pandoc to merge multiple Markdown files. While doing so, I want each file's frontmatter or metadata to generate custom Markdown...	How does this Haskell Pandoc filter work? How does this Haskell Pandoc filter work? haskell pandoc pandocfilters Header toJSONFilter How Haskell Pandoc __name__ __main__ How does this Haskell Pandoc filter work? I want to use Pandoc to merge multiple Markdown files. While doing so, I want each file's frontmatter or met...	[ 0.001434326171875, 0.005645751953125, -0.0037384033203125, 0.00958251953125, -0.002288818359375, 0.00732421875, -0.027099609375, 0.000705718994140625, -0.00012159347534179688, -0.0233154296875, 0.01165771484375, -0.0167236328125, -0.0007476806640625, -0.0091552734375, 0.0037841796875, ...	[ 11249, 14602, 903, 20625, 142508, 4378, 29713, 46312, 4488, 1556, 2652, 120337, 44816, 56, 47, 1375, 58627, 919, 379, 720, 11627, 24931, 3444, 4527, 42564, 48716, 7880, 34695, 102158, 12638, 11435, 12912, 192, 3055, 707, 23550, 10135, 139392,...	[ 0.124755859375, 0.1036376953125, 0.1385498046875, 0.1787109375, 0.24951171875, 0.1732177734375, 0.2802734375, 0.260009765625, 0.163818359375, 0.142333984375, 0.1357421875, 0.2156982421875, 0.1380615234375, 0.04742431640625, 0.1812744140625, 0.10565185546875, 0.171142578125, 0.06335...	embed
18304725_c0	18304725	haskell	0	Title: Memoization of multi-parameter function in Haskell Problem title: Memoization of multi-parameter function in Haskell Tags: ghc, memoization, haskell Problem: Memoization of multi-parameter function in Haskell The following example of a function using memoization is presented on this page : memoized_fib :: Int ->...	Memoization of multi-parameter function in Haskell Memoization of multi-parameter function in Haskell ghc memoization haskell Memoization Haskell memoized_fib Integer n-2 n-1 mult_fib m_fib Memoization of multi-parameter function in Haskell The following example of a function using memoization is presented on this page...	[ 0.00138092041015625, 0.00189971923828125, 0.0133056640625, -0.0086669921875, -0.0025177001953125, 0.0177001953125, 0.0003719329833984375, -0.00009870529174804688, 0.023681640625, -0.00946044921875, 0.0096435546875, -0.02734375, -0.0026397705078125, 0.018310546875, 0.00168609619140625, ...	[ 17443, 31, 47691, 6024, 6276, 29089, 32354, 20625, 142508, 31380, 238, 163, 432, 1556, 29367, 1029, 275, 44401, 5428, 5759, 3869, 347, 27781, 17368, 36663, 20650, 5809, 28282, 144227, 26026, 297, 3698, 20990, 52544, 61924, 1238, 39, 19, 163...	[ 0.171630859375, 0.1683349609375, 0.190185546875, 0.2042236328125, 0.1259765625, 0.1600341796875, 0.2008056640625, 0.157958984375, 0.27490234375, 0.11328125, 0.0843505859375, 0.1656494140625, 0.2142333984375, 0.135986328125, 0.098876953125, 0.1280517578125, 0.09002685546875, 0.10864...	embed
40288168_c0	40288168	haskell	0	Title: Is there any way to restrain the ADT data so that only the valid data could be constructed? Problem title: Is there any way to restrain the ADT data so that only the valid data could be constructed? Tags: haskell, type-theory, functional-programming, algebraic-data-types Problem: Is there any way to restrain the...	Is there any way to restrain the ADT data so that only the valid data could be constructed? Is there any way to restrain the ADT data so that only the valid data could be constructed? haskell type-theory functional-programming algebraic-data-types ADT Pos Nat Neg Zero Succ Rational Is there any way to restrain the ADT ...	[ -0.03466796875, 0.004425048828125, -0.0033111572265625, 0.0213623046875, 0.005767822265625, -0.00201416015625, -0.0023956298828125, -0.004791259765625, -0.003387451171875, -0.01226806640625, 0.01141357421875, -0.0302734375, 0.0108642578125, 0.012451171875, 0.000591278076171875, -0.0041...	[ 2499, 3917, 10588, 50256, 62, 41072, 2053, 4734, 35604, 5809, 64549, 297, 1556, 142508, 10644, 2347, 123309, 28966, 429, 10135, 50986, 13498, 68875, 799, 177, 83947, 1832, 10060, 2552, 43315, 2071, 2685, 61924, 44401, 18151, 7722, 84751, 2967...	[ 0.04754638671875, 0.076171875, 0.1400146484375, 0.2210693359375, 0.124267578125, 0.2303466796875, 0.198486328125, 0.0850830078125, 0.2052001953125, 0.056671142578125, 0.153076171875, 0.033843994140625, 0.09722900390625, 0.2144775390625, 0.1043701171875, 0.03387451171875, 0.0744628906...	embed
52367608_c1	52367608	haskell	1	. ADDIT: to clarify @kabuhr's answer (thank you) contrary to what I think you're claiming in part of your question, for a plain data family, matching on a constructor does not perform any inference These types are tricky, so I expect I'd need explicit signatures to work with them. In that case the plain data family is ...	. ADDIT: to clarify @kabuhr's answer (thank you) contrary to what I think you're claiming in part of your question, for a plain data family, matching on a constructor does not perform any inference These types are tricky, so I expect I'd need explicit signatures to work with them. In that case the plain data family is ...	[ 0.026123046875, -0.005859375, -0.00148773193359375, 0.002655029296875, 0.02099609375, -0.01806640625, -0.015869140625, -0.01116943359375, -0.00089263916015625, 0.0048828125, -0.00299072265625, -0.0322265625, -0.01104736328125, 0.01177978515625, 0.003814697265625, 0.0028076171875, 0.0...	[ 17306, 63043, 111719, 2053, 14449, 14858, 214, 98, 64549, 748, 959, 51339, 2499, 53498, 6620, 52895, 88308, 53, 41206, 143726, 138256, 4488, 678, 28, 1544, 525, 38997, 92, 1022, 43240, 15490, 10, 2822, 10644, 98411, 360, 18, 10422, 110, 2...	[ 0.01220703125, 0.01373291015625, 0.1651611328125, 0.15771484375, 0.1240234375, 0.2410888671875, 0.07958984375, 0.1007080078125, 0.1932373046875, 0.122802734375, 0.04803466796875, 0.1097412109375, 0.00872802734375, 0.2205810546875, 0.074462890625, 0.1258544921875, 0.05059814453125, ...	embed
20585328_c0	20585328	haskell	0	Title: How to do stateful list operations in haskell Problem title: How to do stateful list operations in haskell Tags: haskell, iteration, list Problem: How to do stateful list operations in haskell I need an operation which iterates over a list and produces a new list, where the new list elements depend on all elemen...	How to do stateful list operations in haskell How to do stateful list operations in haskell haskell iteration list How How to do stateful list operations in haskell I need an operation which iterates over a list and produces a new list, where the new list elements depend on all elements previously seen. To do this I wo...	[ -0.012939453125, 0.00164031982421875, 0.0059814453125, -0.00335693359375, -0.018310546875, 0.009765625, -0.013916015625, 0.002288818359375, -0.0045166015625, -0.03466796875, 0.018798828125, -0.006134033203125, -0.00015544891357421875, 0.018310546875, -0.01165771484375, 0.00182342529296...	[ 11249, 54, 11341, 7844, 5303, 41018, 7, 23, 1556, 142508, 47, 17, 720, 2320, 3871, 8560, 645, 27489, 3525, 80854, 56566, 756, 198395, 51592, 1884, 27875, 183278, 1290, 61340, 1295, 370, 99726, 82761, 8705, 59437, 5983, 9232, 34292, 35299, ...	[ 0.059234619140625, 0.1058349609375, 0.2203369140625, 0.1903076171875, 0.23876953125, 0.2166748046875, 0.08917236328125, 0.07177734375, 0.1544189453125, 0.2423095703125, 0.046600341796875, 0.046417236328125, 0.210693359375, 0.02032470703125, 0.030914306640625, 0.203125, 0.0830078125, ...	embed
30448073_c0	30448073	haskell	0	Title: Kind Classification of Types Problem title: Kind Classification of Types Tags: functional-programming, haskell Problem: Kind Classification of Types In Benjamin Pierce's book on Types and Programming Languages he classifies the different kinds of types as follows: * the kind of proper types (like Bool and Bool -...	Kind Classification of Types Kind Classification of Types functional-programming haskell Kind Classification Types Bool Prelude Num Kind Classification of Types In Benjamin Pierce's book on Types and Programming Languages he classifies the different kinds of types as follows: * the kind of proper types (like Bool and B...	[ 0.025390625, 0.015869140625, 0.006866455078125, 0.00726318359375, -0.0018157958984375, 0.0047607421875, -0.02294921875, -0.005706787109375, -0.0019683837890625, 0.0035247802734375, -0.0135498046875, -0.052734375, 0, 0.00384521484375, -0.0172119140625, 0.0096435546875, 0.0245361328125...	[ 27435, 237777, 111, 60457, 123309, 28966, 1556, 142508, 2460, 929, 1914, 822, 52782, 74715, 47231, 329, 12877, 27958, 83658, 18507, 27430, 12921, 8562, 52895, 27798, 136, 10644, 39933, 32354, 47, 6626, 155937, 16916, 370, 8705, 10461, 41, 206...	[ 0.23583984375, 0.2249755859375, 0.041656494140625, 0.251220703125, 0.0916748046875, 0.093017578125, 0.11083984375, 0.2392578125, 0.0899658203125, 0.1541748046875, 0.0587158203125, 0.1224365234375, 0.1239013671875, 0.14013671875, 0.13623046875, 0.1448974609375, 0.076171875, 0.110595...	embed
30646251_c0	30646251	haskell	0	Title: error define a template haskell function Problem title: error define a template haskell function Tags: haskell, template-haskell Problem: error define a template haskell function I am beginning to learn Template haskell, so I want create a function that receive a String param that define the name to the function...	error define a template haskell function error define a template haskell function haskell template-haskell build_p5 Dec FunD Clause TupP VarP NormalB AppE VarE Couldn Expected DecsQ Actual build_p2 Monad error define a template haskell function I am beginning to learn Template haskell, so I want create a function that ...	[ 0.006195068359375, 0.008544921875, -0.006683349609375, 0.00927734375, 0.00469970703125, 0.0211181640625, -0.002044677734375, -0.0216064453125, 0.0059814453125, -0.032958984375, 0.01531982421875, -0.0308837890625, 0.01165771484375, -0.009521484375, 0.004608154296875, -0.0007514953613281...	[ 18499, 61924, 10, 110934, 1556, 142508, 32354, 10557, 45367, 254, 758, 25755, 28670, 397, 100700, 1371, 683, 3323, 28723, 571, 5659, 647, 191147, 60075, 13, 2737, 100582, 304, 60331, 71, 86595, 30698, 196631, 3444, 28282, 53299, 23351, 214, ...	[ 0.18701171875, 0.200439453125, 0.033905029296875, 0.28759765625, 0.1197509765625, 0.2208251953125, 0.192138671875, 0.094970703125, 0.143310546875, 0.04449462890625, 0.125244140625, 0.1373291015625, 0.05908203125, 0.07635498046875, 0.1116943359375, 0.049957275390625, 0.08642578125, ...	embed
31627704_c1	31627704	haskell	1	R3] --The edges of cubes totheu1 :: Cube -> Int -- Measures how far away the cube is from having the cross of the first layer solved. totheu1 c = sum $ map (\d -> if d then 0 else 1) [c (-2, 3, 0) == c (0, 3, 0), c (2, 3, 0) == c (0, 3, 0), c (0, 3, -2) == c (0, 3, 0), c (0, 3, 2) == c (0, 3, 0), c (0, 2, -3) == c (0, ...	R3] --The edges of cubes totheu1 :: Cube -> Int -- Measures how far away the cube is from having the cross of the first layer solved. totheu1 c = sum $ map (\d -> if d then 0 else 1) [c (-2, 3, 0) == c (0, 3, 0), c (2, 3, 0) == c (0, 3, 0), c (0, 3, -2) == c (0, 3, 0), c (0, 3, 2) == c (0, 3, 0), c (0, 2, -3) == c (0, ...	[ 0.00982666015625, 0.001495361328125, -0.002227783203125, 0.017822265625, 0.010986328125, -0.0059814453125, -0.0029296875, 0.00118255615234375, 0.01806640625, -0.0048828125, -0.01043701171875, 0.007049560546875, 0.015625, 0.004119873046875, -0.01397705078125, -0.0047607421875, -0.0128...	[ 627, 96386, 4210, 3957, 121303, 7, 111, 314, 7438, 1186, 95674, 418, 1984, 3003, 372, 33079, 360, 18, 1215, 162, 30891, 3642, 2060, 16065, 83, 1295, 19441, 41421, 5117, 135355, 86869, 71, 501, 2203, 10554, 3650, 22288, 2174, 104, 757, 3...	[ 0.1331787109375, 0.22705078125, 0.068603515625, 0.0416259765625, 0.251708984375, 0.109619140625, 0.06817626953125, 0.19140625, 0.2039794921875, 0.134521484375, 0.2587890625, 0.093505859375, 0.04730224609375, 0.176513671875, 0.18701171875, 0.03485107421875, 0.1021728515625, 0.174316...	embed
34497814_c0	34497814	haskell	0	Title: How to make aliases with yaml library in Haskell? Problem title: How to make aliases with yaml library in Haskell? Tags: yaml, haskell Problem: How to make aliases with yaml library in Haskell? I'm using YAML for configuration files and already have all required ToJSON/FromJSON instances for my data types. All g...	How to make aliases with yaml library in Haskell? How to make aliases with yaml library in Haskell? yaml haskell How Haskell security_level auth_password auth_protocol MD5 private_protocol None private_password securityAlias1 How to make aliases with yaml library in Haskell? I'm using YAML for configuration files and a...	[ -0.01043701171875, -0.000881195068359375, 0.0211181640625, 0.0081787109375, 0.0123291015625, 0.005126953125, -0.010498046875, 0.017578125, -0.017578125, 0.010986328125, -0.01214599609375, 0.01190185546875, 0.004364013671875, -0.0027008056640625, 0.0050048828125, 0.007781982421875, -0...	[ 11249, 3249, 55109, 90, 678, 151, 7237, 35773, 1294, 20625, 142508, 47, 23, 1556, 48031, 67919, 531, 927, 13409, 47416, 31, 25383, 758, 14375, 438, 55725, 162, 418, 17368, 3320, 39456, 180346, 102158, 21771, 56065, 717, 1375, 58627, 168407,...	[ 0.05865478515625, 0.1263427734375, 0.26171875, 0.1988525390625, 0.0780029296875, 0.1864013671875, 0.244873046875, 0.1707763671875, 0.04522705078125, 0.1495361328125, 0.236083984375, 0.012847900390625, 0.035858154296875, 0.12744140625, 0.1162109375, 0.1060791015625, 0.101806640625, ...	embed
23701448_c0	23701448	haskell	0	Title: How to read in an Int and use it in another function Problem title: How to read in an Int and use it in another function Tags: io, haskell, parsing Problem: How to read in an Int and use it in another function I am trying to read in an Int and then use the read value in a pure function, but it does not seem to w...	How to read in an Int and use it in another function How to read in an Int and use it in another function io haskell parsing How Please Couldn Failed How to read in an Int and use it in another function I am trying to read in an Int and then use the read value in a pure function, but it does not seem to work properly. ...	[ -0.0213623046875, 0.00726318359375, -0.004974365234375, -0.00347900390625, 0.0130615234375, 0.0191650390625, 0.000865936279296875, -0.0179443359375, -0.0050048828125, -0.052978515625, -0.0033111572265625, -0.0086669921875, -0.0267333984375, -0.0009613037109375, 0.01446533203125, 0.0006...	[ 11249, 47, 12301, 23, 142, 360, 18, 136, 4527, 15700, 32354, 22995, 1556, 142508, 366, 6953, 30607, 191147, 19, 190355, 297, 31577, 34292, 34166, 4488, 155965, 18151, 43240, 5885, 9969, 1340, 18499, 5201, 30646, 5608, 39116, 107730, 3403, 1...	[ 0.06182861328125, 0.008392333984375, 0.211669921875, 0.1741943359375, 0.05426025390625, 0.1751708984375, 0.1959228515625, 0.0784912109375, 0.1527099609375, 0.12353515625, 0.170654296875, 0.145263671875, 0.088134765625, 0.1788330078125, 0.084228515625, 0.00677490234375, 0.130615234375...	embed
37205511_c1	37205511	haskell	1	) args apply func argVals eval env badForm = throwError $ BadSpecialForm "Unrecognized special form" badForm eval env (List (Atom "define" : List (Atom var : params) : body)) = makeNormalFunc env params body >>= defineVar env var eval env (List (Atom "define" : DottedList (Atom var : params) varargs : body)) = makeVarA...	) args apply func argVals eval env badForm = throwError $ BadSpecialForm "Unrecognized special form" badForm eval env (List (Atom "define" : List (Atom var : params) : body)) = makeNormalFunc env params body >>= defineVar env var eval env (List (Atom "define" : DottedList (Atom var : params) varargs : body)) = makeVarA...	[ 0.00555419921875, 0.01287841796875, -0.004119873046875, -0.01324462890625, -0.000713348388671875, 0.0169677734375, 0.004364013671875, -0.0034942626953125, 0.012451171875, 0.0157470703125, 0.0034942626953125, -0.01806640625, -0.009521484375, -0.0022430419921875, -0.0086669921875, -0.005...	[ 1388, 79459, 7, 59911, 7477, 42272, 28, 1405, 22, 334, 6494, 102973, 104250, 18468, 31611, 3650, 12745, 216119, 14256, 107, 115558, 64807, 5361, 3173, 154663, 12078, 64552, 32036, 285, 121, 4432, 14361, 50645, 2749, 97249, 61924, 81827, 84929...	[ 0.0243072509765625, 0.234619140625, 0.0792236328125, 0.156494140625, 0.125244140625, 0.23388671875, 0.06805419921875, 0.25537109375, 0.1240234375, 0.2313232421875, 0.1868896484375, 0.255859375, 0.1546630859375, 0.0897216796875, 0.1298828125, 0.03668212890625, 0.1446533203125, 0.137...	embed
4008473_c0	4008473	haskell	0	Title: How to get make stats in constant memory Problem title: How to get make stats in constant memory Tags: lazy-evaluation, haskell, memory-management, random, statistics Problem: How to get make stats in constant memory I have a function, which creates some random numerical results. I know, that the result will be ...	How to get make stats in constant memory How to get make stats in constant memory lazy-evaluation haskell memory-management random statistics How a..b How to get make stats in constant memory I have a function, which creates some random numerical results. I know, that the result will be an integer in a (small, a - b ap...	[ 0.0068359375, -0.0201416015625, 0.00933837890625, -0.0230712890625, -0.0020599365234375, 0.01446533203125, 0.005950927734375, -0.0137939453125, 0.01202392578125, -0.0281982421875, -0.0216064453125, 0.01129150390625, 0.0167236328125, 0.027587890625, 0.0233154296875, -0.01953125, 0.000...	[ 11249, 2046, 3249, 63841, 23, 53697, 98323, 47, 21, 3285, 159258, 1556, 142508, 87140, 96759, 80835, 32354, 28282, 54744, 50339, 3714, 16750, 892, 1505, 69070, 876, 35707, 836, 37457, 3444, 71924, 805, 28568, 20028, 74481, 3642, 27983, 12638,...	[ 0.04510498046875, 0.121826171875, 0.2275390625, 0.257568359375, 0.103759765625, 0.225830078125, 0.2252197265625, 0.0042724609375, 0.018096923828125, 0.1015625, 0.0833740234375, 0.06134033203125, 0.177001953125, 0.0997314453125, 0.144287109375, 0.22607421875, 0.138427734375, 0.06817...	embed
3093133_c0	3093133	haskell	0	Title: How to provide explicit type declarations for functions when using GHCi? Problem title: How to provide explicit type declarations for functions when using GHCi? Tags: types, haskell, ghci, function-declaration Problem: How to provide explicit type declarations for functions when using GHCi? How to I define the e...	How to provide explicit type declarations for functions when using GHCi? How to provide explicit type declarations for functions when using GHCi? types haskell ghci function-declaration GHCi Data.List How Prelude How to provide explicit type declarations for functions when using GHCi? How to I define the equivalent of ...	[ -0.0008087158203125, 0.0111083984375, 0.013916015625, 0.010986328125, 0.0008087158203125, 0.00135040283203125, 0.0035858154296875, -0.016357421875, -0.000644683837890625, -0.0179443359375, -0.00323486328125, -0.02490234375, -0.005218505859375, 0.00439453125, -0.0028533935546875, 0.0108...	[ 11249, 22691, 143726, 10644, 21635, 5256, 100, 32354, 17368, 527, 73265, 14, 47, 52895, 1556, 142508, 31380, 318, 50718, 320, 11809, 154663, 822, 112, 61924, 183234, 30698, 53927, 7232, 46132, 177417, 26946, 80934, 73866, 5303, 25072, 237, 17...	[ 0.060211181640625, 0.133056640625, 0.20263671875, 0.243896484375, 0.20263671875, 0.078369140625, 0.035247802734375, 0.1876220703125, 0.0283203125, 0.0767822265625, 0.15185546875, 0.2130126953125, 0.001373291015625, 0.1654052734375, 0.1021728515625, 0.215576171875, 0.10638427734375, ...	embed
39293399_c0	39293399	haskell	0	Title: Haskell - Pass arbitrary function and argument list as arguments to another function Problem title: Haskell - Pass arbitrary function and argument list as arguments to another function Tags: function, variables, haskell, arguments Problem: Haskell - Pass arbitrary function and argument list as arguments to anoth...	Haskell - Pass arbitrary function and argument list as arguments to another function Haskell - Pass arbitrary function and argument list as arguments to another function function variables haskell arguments Haskell Pass haskell_stderr stderr_dup Data.List.foldl Nothing Haskell - Pass arbitrary function and argument lis...	[ 0.0107421875, -0.00153350830078125, -0.00335693359375, -0.01141357421875, -0.0057373046875, -0.0047607421875, 0.00182342529296875, -0.0198974609375, -0.003997802734375, 0.005828857421875, -0.017333984375, -0.01153564453125, 0.004638671875, 0.01312255859375, 0.01507568359375, -0.0072631...	[ 20625, 142508, 28872, 61799, 1294, 32354, 136, 10750, 5303, 237, 47, 15700, 77336, 1556, 271, 820, 42, 6138, 693, 254, 11809, 154663, 42822, 141, 182747, 20, 5201, 69236, 456, 80581, 11435, 16401, 25632, 18151, 58134, 15673, 4537, 27875, 24...	[ 0.1292724609375, 0.267822265625, 0.15625, 0.1627197265625, 0.076416015625, 0.1998291015625, 0.077392578125, 0.259765625, 0.1827392578125, 0.09228515625, 0.1109619140625, 0.1080322265625, 0.179443359375, 0.1217041015625, 0.0333251953125, 0.05621337890625, 0.15966796875, 0.1270751953...	embed
41007007_c0	41007007	haskell	0	Title: Most efficient wire format for GHCJS code over websockets Problem title: Most efficient wire format for GHCJS code over websockets Tags: haskell, serialization, websocket, ghcjs Problem: Most efficient wire format for GHCJS code over websockets I am working on a Haskell application, running in the browser compil...	Most efficient wire format for GHCJS code over websockets Most efficient wire format for GHCJS code over websockets haskell serialization websocket ghcjs Most GHCJS Read Show ByteStrings Blob GHC.Generics Most efficient wire format for GHCJS code over websockets I am working on a Haskell application, running in the bro...	[ 0.007293701171875, 0.016845703125, -0.01513671875, -0.0211181640625, -0.0032958984375, -0.004180908203125, -0.0079345703125, 0.0103759765625, -0.01708984375, -0.004302978515625, 0.0076904296875, -0.0498046875, -0.00180816650390625, 0.005889892578125, -0.0078125, 0.0218505859375, -0.0...	[ 17006, 93766, 1439, 13, 9384, 527, 73265, 64977, 18151, 645, 1467, 991, 27853, 1556, 142508, 35686, 47691, 31380, 238, 28175, 4764, 17367, 3311, 67, 71713, 5180, 54231, 275, 135932, 12259, 20697, 20625, 38415, 31842, 5974, 127219, 10723, 5912...	[ 0.09161376953125, 0.202392578125, 0.17529296875, 0.0775146484375, 0.2308349609375, 0.1156005859375, 0.2249755859375, 0.2313232421875, 0.1630859375, 0.076904296875, 0.126220703125, 0.1224365234375, 0.1187744140625, 0.0972900390625, 0.2003173828125, 0.1845703125, 0.07666015625, 0.084...	embed
28106953_c0	28106953	haskell	0	Title: What is the `Operator` word definition? Problem title: What is the `Operator` word definition? Tags: haskell Problem: What is the `Operator` word definition? I learn Haskell. What definition for the operator word in Haskell? I can't find clear definition. I think it is something like that (my own understanding):...	What is the `Operator` word definition? What is the `Operator` word definition? haskell What Operator What is the `Operator` word definition? I learn Haskell. What definition for the operator word in Haskell? I can't find clear definition. I think it is something like that (my own understanding): From Haskell 2010 the ...	[ 0.013916015625, -0.02685546875, 0.01495361328125, 0.017578125, 0.011962890625, 0.005462646484375, 0.00830078125, 0.01141357421875, 0.0064697265625, 0.01336669921875, 0.0002460479736328125, -0.0306396484375, 0.01446533203125, -0.0146484375, -0.01708984375, 0.0118408203125, 0.001342773...	[ 4865, 156823, 1290, 2565, 80934, 1556, 142508, 150922, 83, 30698, 20625, 39933, 23, 34735, 5351, 1884, 10002, 100094, 1532, 21115, 237, 238, 65183, 36846, 70541, 111, 9077, 7108, 27781, 903, 33153, 13538, 7077, 4966, 17932, 50960, 20117, 7 ]	[ 0.046844482421875, 0.2498779296875, 0.23291015625, 0.1544189453125, 0.185302734375, 0.11328125, 0.207763671875, 0.300537109375, 0.0205841064453125, 0.042144775390625, 0.1016845703125, 0.296142578125, 0.027130126953125, 0.04541015625, 0.00640869140625, 0.021697998046875, 0.00970458984...	embed
48510270_c0	48510270	haskell	0	Title: Immutability invariants in Haskell's GC, considering mutual recursion Problem title: Immutability invariants in Haskell's GC, considering mutual recursion Tags: garbage-collection, optimization, memory, haskell Problem: Immutability invariants in Haskell's GC, considering mutual recursion I was reading...	Immutability invariants in Haskell's GC, considering mutual recursion Immutability invariants in Haskell's GC, considering mutual recursion garbage-collection optimization memory haskell Immutability Haskell Immutability invariants in Haskell's GC, considering mutual recursion I was reading this article: http...	[ -0.0018310546875, 0.0244140625, 0.00396728515625, 0.0174560546875, -0.0123291015625, 0.0198974609375, -0.03076171875, -0.01251220703125, 0.00408935546875, -0.01611328125, 0.01806640625, 0.0011138916015625, 0.006561279296875, 0.01446533203125, 0.0203857421875, 0.00994873046875, -0.014...	[ 3370, 14311, 41159, 23, 162591, 20625, 142508, 3768, 69657, 179635, 199849, 195625, 3671, 402, 429, 196352, 87235, 98323, 1556, 1830, 16454, 5582, 13691, 10557, 41877, 441, 6696, 4514, 228555, 4785, 55681, 959, 28219, 2831, 5351, 2806, 29568, ...	[ 0.091796875, 0.226318359375, 0.13916015625, 0.12109375, 0.30908203125, 0.16748046875, 0.25732421875, 0.05743408203125, 0.206787109375, 0.139892578125, 0.225830078125, 0.226318359375, 0.052154541015625, 0.1376953125, 0.0213775634765625, 0.07733154296875, 0.1263427734375, 0.148925781...	embed
77727518_c0	77727518	haskell	0	Title: Apply a function with Monadic result instead of a function with a non-Monadic result Problem title: Apply a function with Monadic result instead of a function with a non-Monadic result Tags: haskell Problem: Apply a function with Monadic result instead of a function with a non-Monadic result I have a function (f...	Apply a function with Monadic result instead of a function with a non-Monadic result Apply a function with Monadic result instead of a function with a non-Monadic result haskell Apply Monadic Display Color Float Picture Apply a function with Monadic result instead of a function with a non-Monadic result I have a functi...	[ -0.013427734375, 0.00185394287109375, 0.01495361328125, 0.007598876953125, 0.0233154296875, 0.01190185546875, 0.002685546875, -0.00185394287109375, 0.0020599365234375, -0.0302734375, 0.01513671875, -0.02001953125, -0.01324462890625, 0.01483154296875, 0.0120849609375, -0.01116943359375,...	[ 5659, 538, 32354, 678, 60331, 18403, 16750, 64457, 111, 351, 46674, 11, 1556, 142508, 90045, 51193, 38699, 257, 158656, 10, 161063, 35773, 1294, 16, 26946, 7, 15700, 237, 142, 10750, 7477, 238, 1984, 15, 33079, 876, 1388, 347, 132, 5036, ...	[ 0.1878662109375, 0.1112060546875, 0.21826171875, 0.0943603515625, 0.197998046875, 0.171142578125, 0.184326171875, 0.154052734375, 0.0169677734375, 0.09423828125, 0.07281494140625, 0.052734375, 0.115966796875, 0.2359619140625, 0.146240234375, 0.1373291015625, 0.1754150390625, 0.0633...	embed
8505964_c0	8505964	haskell	0	Title: Getting error description from compiling regexp Problem title: Getting error description from compiling regexp Tags: regex, haskell Problem: Getting error description from compiling regexp I am trying to compile a regexp and get an error message that can be presented to the user. I tried this with Text.Regex.TDF...	Getting error description from compiling regexp Getting error description from compiling regexp regex haskell compiling Getting Prelude Text.Regex.TDFA Data.Maybe Data.Either.Utils Either Regex Exception Text.Regex.TDFA.String Failed Maybe Getting error description from compiling regexp I am trying to compile a regexp ...	[ 0.00079345703125, 0.0113525390625, -0.0078125, 0.0079345703125, 0.0166015625, 0.02294921875, -0.006195068359375, 0.007537841796875, 0.00396728515625, -0.00946044921875, 0.00469970703125, -0.0213623046875, 0.01171875, -0.001129150390625, 0.0016326904296875, 0.0108642578125, 0.00256347...	[ 210732, 18499, 76811, 1295, 9969, 49725, 6835, 83613, 3355, 1556, 142508, 1914, 822, 112, 24129, 54601, 100045, 14676, 11809, 82419, 372, 9319, 106742, 11678, 63928, 71713, 190355, 297, 83425, 31577, 1340, 26008, 8121, 5, 7192, 7, 4084, 68991...	[ 0.077880859375, 0.195068359375, 0.2403564453125, 0.062286376953125, 0.1395263671875, 0.1219482421875, 0.15283203125, 0.251220703125, 0.1837158203125, 0.061492919921875, 0.197998046875, 0.041839599609375, 0.1484375, 0.02288818359375, 0.1260986328125, 0.092529296875, 0.025787353515625,...	embed
54843477_c0	54843477	haskell	0	Title: How does OverloadedStrings language extension work? Problem title: How does OverloadedStrings language extension work? Tags: haskell Problem: How does OverloadedStrings language extension work? I am trying to understand the language extension OverloadedStrings from the page https://ocharles.org.uk/posts/2014-12-...	How does OverloadedStrings language extension work? How does OverloadedStrings language extension work? haskell How OverloadedStrings Data.String.IsString Prelude Data.String Foo IsString How does OverloadedStrings language extension work? I am trying to understand the language extension OverloadedStrings from the page...	[ 0.0162353515625, 0.007293701171875, -0.00775146484375, 0.033447265625, -0.00897216796875, 0.01092529296875, 0.02734375, -0.0069580078125, 0.004791259765625, -0.0152587890625, 0.0032501220703125, -0.05859375, 0.00016498565673828125, 0.007659912109375, -0.0224609375, -0.0198974609375, ...	[ 11249, 14602, 9578, 63033, 297, 71713, 5180, 46876, 111938, 4488, 1556, 142508, 11809, 214, 29598, 1914, 822, 112, 9572, 31, 2071, 28219, 9254, 1577, 5465, 91693, 7, 225081, 23351, 24209, 10644, 10, 44357, 76811, 79315, 15659, 16765, 5036, ...	[ 0.0687255859375, 0.06658935546875, 0.1793212890625, 0.2237548828125, 0.1204833984375, 0.2034912109375, 0.1805419921875, 0.1683349609375, 0.201171875, 0.1590576171875, 0.109375, 0.2049560546875, 0.1246337890625, 0.1094970703125, 0.117431640625, 0.07586669921875, 0.1407470703125, 0.0...	embed
41093747_c0	41093747	haskell	0	Title: Conversion between two stream types Problem title: Conversion between two stream types Tags: haskell, type-conversion, isomorphism Problem: Conversion between two stream types I have a question regarding converting between two datatypes in Haskell. Consider the following two datatypes data Stream a = Cons a (Str...	Conversion between two stream types Conversion between two stream types haskell type-conversion isomorphism Conversion Stream Cons Stream2 sToS2 s2ToS Conversion between two stream types I have a question regarding converting between two datatypes in Haskell. The first thing that I am having trouble with is the Stream ...	[ -0.01434326171875, 0.0198974609375, -0.01409912109375, -0.0081787109375, -0.0035552978515625, 0.006378173828125, -0.0299072265625, -0.002685546875, 0.015869140625, 0.01300048828125, 0.00897216796875, -0.013671875, 0.03173828125, 0.0196533203125, 0.0003070831298828125, 0.00396728515625,...	[ 1657, 46354, 17721, 6626, 75973, 52895, 1556, 142508, 10644, 2271, 13882, 178851, 115061, 39215, 304, 91, 7763, 294, 9655, 96760, 214, 2053, 50986, 20625, 19441, 63134, 1957, 10, 195625, 5844, 110, 3647, 7225, 32195, 209303, 54241, 105233, 64...	[ 0.07220458984375, 0.170166015625, 0.1356201171875, 0.1485595703125, 0.2332763671875, 0.223388671875, 0.12744140625, 0.250732421875, 0.192626953125, 0.055908203125, 0.0718994140625, 0.158447265625, 0.2186279296875, 0.119140625, 0.16259765625, 0.057464599609375, 0.1602783203125, 0.10...	embed
71548026_c0	71548026	haskell	0	Title: How can I fix my inserPair haskell code to work for all of the tests? Problem title: How can I fix my inserPair haskell code to work for all of the tests? Tags: haskell, key-value Problem: How can I fix my inserPair haskell code to work for all of the tests? Specify the function that inserts a new pair into a li...	How can I fix my inserPair haskell code to work for all of the tests? How can I fix my inserPair haskell code to work for all of the tests? haskell key-value How How can I fix my inserPair haskell code to work for all of the tests? Specify the function that inserts a new pair into a list of key-value pairs. If the key ...	[ -0.0120849609375, 0.001220703125, 0.0021820068359375, -0.014404296875, 0.001007080078125, 0.01025390625, -0.0341796875, -0.0291748046875, 0.003875732421875, 0.0145263671875, 0.025390625, -0.003631591796875, 0.0135498046875, -0.01470947265625, 0.00408935546875, 0.0026092529296875, -0....	[ 11249, 30022, 28046, 8335, 481, 1556, 142508, 18151, 4488, 100, 756, 109921, 831, 47, 111, 22799, 27494, 24990, 32354, 183540, 3525, 80836, 3934, 5303, 21771, 34292, 645, 5429, 114689, 3564, 959, 148, 174796, 7225, 787, 15549 ]	[ 0.027008056640625, 0.1807861328125, 0.1949462890625, 0.1639404296875, 0.1595458984375, 0.1453857421875, 0.22998046875, 0.18603515625, 0.10150146484375, 0.0780029296875, 0.0745849609375, 0.1805419921875, 0.013824462890625, 0.0207366943359375, 0.02294921875, 0.166015625, 0.141357421875...	embed
66941797_c0	66941797	haskell	0	Title: Pattern match failure : head [ ] , haskell Problem title: Pattern match failure : head [ ] , haskell Tags: haskell Problem: Pattern match failure : head [ ] , haskell I give as input a list like : s = [(1,5),(1,4),(3,4)] and i want to take every time the head of this list which will be with recuircive loop 1: (1...	Pattern match failure : head [ ] , haskell Pattern match failure : head [ ] , haskell haskell Pattern help_statistics total_points goal_for goal_against Pattern match failure : head [ ] , haskell I give as input a list like : s = [(1,5),(1,4),(3,4)] and i want to take every time the head of this list which will be with...	[ 0.0164794921875, 0.00982666015625, -0.0038299560546875, 0.0159912109375, -0.011474609375, 0.0016326904296875, -0.004119873046875, 0.004638671875, 0.01708984375, -0.00927734375, 0.024658203125, -0.01275634765625, 0.0079345703125, 0.00787353515625, 0.0267333984375, -0.0255126953125, 0....	[ 9876, 22766, 14858, 137578, 10336, 1556, 142508, 4358, 17346, 48242, 3622, 38496, 69236, 2472, 4729, 73, 87, 8337, 237, 107730, 5303, 1884, 91, 57626, 163324, 82449, 3444, 47, 5646, 11907, 1733, 111, 903, 186, 678, 43852, 481, 318, 272, 4...	[ 0.146240234375, 0.1387939453125, 0.189453125, 0.2174072265625, 0.197509765625, 0.1217041015625, 0.199951171875, 0.1383056640625, 0.060577392578125, 0.037322998046875, 0.1082763671875, 0.169189453125, 0.1451416015625, 0.0521240234375, 0.02130126953125, 0.091064453125, 0.00454711914062...	embed
27474810_c0	27474810	haskell	0	Title: All the subsets of size N which satisfy a condition in Haskell Problem title: All the subsets of size N which satisfy a condition in Haskell Tags: haskell, complexity-theory, optimization, algorithm Problem: All the subsets of size N which satisfy a condition in Haskell I would like to write a function, which ta...	All the subsets of size N which satisfy a condition in Haskell All the subsets of size N which satisfy a condition in Haskell haskell complexity-theory optimization algorithm All Haskell Integer x:xs k-1 All the subsets of size N which satisfy a condition in Haskell I would like to write a function, which takes a list ...	[ -0.01171875, 0.01031494140625, 0.005218505859375, -0.017578125, 0.006439208984375, 0.0038604736328125, 0.0032958984375, -0.01300048828125, -0.0003528594970703125, 0.0023651123046875, 0.00390625, -0.01123046875, 0.00372314453125, 0.00469970703125, -0.011474609375, 0.00665283203125, 0....	[ 3164, 1614, 3509, 7, 13267, 541, 3129, 40407, 53, 35431, 23, 20625, 142508, 1556, 27140, 2347, 87235, 234873, 44401, 1022, 425, 472, 5759, 1884, 33022, 10, 32354, 51776, 5303, 30646, 756, 7722, 3444, 765, 5691, 62539, 133063, 82449, 15490, ...	[ 0.08740234375, 0.2158203125, 0.250732421875, 0.032958984375, 0.1416015625, 0.1561279296875, 0.030364990234375, 0.1951904296875, 0.072265625, 0.2073974609375, 0.05865478515625, 0.1697998046875, 0.251953125, 0.1580810546875, 0.1202392578125, 0.000274658203125, 0.10601806640625, 0.072...	embed
74089915_c1	74089915	haskell	1	, Black), (35, Black) ] initialBoard = Data.Map.union startBoard emptyBoard Following this way of thinking about the board: However, when running this in the Prelude, I get: <interactive>:42:45: error: * Couldn't match type `Maybe a0' with `Player' Expected type: Data.Map.Internal.Map k Player Actual type: Data.Map.Int...	, Black), (35, Black) ] initialBoard = Data.Map.union startBoard emptyBoard Following this way of thinking about the board: However, when running this in the Prelude, I get: <interactive>:42:45: error: * Couldn't match type `Maybe a0' with `Player' Expected type: Data.Map.Internal.Map k Player Actual type: Data.Map.Int...	[ -0.006439208984375, 0.00762939453125, 0.0029754638671875, 0.003631591796875, -0.005157470703125, -0.00823974609375, 0.002044677734375, -0.0123291015625, 0.0140380859375, 0.00372314453125, 0.00836181640625, 0.03125, 0.013671875, 0.0234375, -0.020751953125, -0.023193359375, 0.012756347...	[ 10074, 5843, 61475, 12647, 5861, 2203, 11809, 166179, 87046, 4034, 201505, 47644, 45443, 51042, 903, 1914, 822, 112, 10433, 71232, 33529, 15989, 18499, 191147, 18, 14858, 10644, 82419, 372, 10, 2389, 678, 142581, 60075, 44851, 472, 60560, 100...	[ 0.1805419921875, 0.164306640625, 0.1815185546875, 0.194580078125, 0.220947265625, 0.0258636474609375, 0.1405029296875, 0.1832275390625, 0.1544189453125, 0.1378173828125, 0.228271484375, 0.08056640625, 0.222412109375, 0.09027099609375, 0.004425048828125, 0.1126708984375, 0.19641113281...	embed
46718726_c0	46718726	haskell	0	Title: Why is Int not promotable? Problem title: Why is Int not promotable? Tags: haskell, ghc Problem: Why is Int not promotable? I'd like to have points in two or three dimensions such that the two-dimensional points and the three-dimensional points can share code, but the compiler can tell them apart. Here's a first...	Why is Int not promotable? Why is Int not promotable? haskell ghc Why LANGUAGE DataKinds GADTs KindSignatures Dimension Point Why is Int not promotable? I'd like to have points in two or three dimensions such that the two-dimensional points and the three-dimensional points can share code, but the compiler can tell them...	[ 0.00799560546875, 0.01043701171875, -0.00127410888671875, 0.013671875, 0.00982666015625, 0.024658203125, -0.01055908203125, -0.0211181640625, 0.0035400390625, 0.01611328125, 0.00567626953125, -0.046875, -0.0142822265625, -0.01300048828125, -0.036865234375, 0.0014190673828125, 0.02612...	[ 44084, 83, 360, 18, 959, 8891, 22819, 1556, 142508, 31380, 238, 98064, 11809, 605, 7250, 23749, 41072, 27435, 218723, 11, 54889, 161202, 41097, 1884, 765, 26847, 6626, 17262, 158208, 157955, 831, 12008, 18151, 9969, 34759, 14192, 34955, 81887...	[ 0.120361328125, 0.05181884765625, 0.1634521484375, 0.2169189453125, 0.1614990234375, 0.2431640625, 0.204833984375, 0.0843505859375, 0.2269287109375, 0.06207275390625, 0.03924560546875, 0.0819091796875, 0.07550048828125, 0.0223236083984375, 0.160888671875, 0.0655517578125, 0.074096679...	embed
10224199_c0	10224199	haskell	0	Title: Word count program in Haskell Problem title: Word count program in Haskell Tags: haskell Problem: Word count program in Haskell I'm going over past exams studying for my upcoming exam, and after completing a couple of the questions I came across one that I couldn't solve. It wants a function that will take a Str...	Word count program in Haskell Word count program in Haskell haskell Word Haskell Char Word count program in Haskell I'm going over past exams studying for my upcoming exam, and after completing a couple of the questions I came across one that I couldn't solve. It wants a function that will take a String (or [Char]) and...	[ -0.004180908203125, 0.01336669921875, -0.0029296875, 0.035888671875, -0.006103515625, 0.01397705078125, -0.00390625, -0.00250244140625, -0.0086669921875, -0.0194091796875, 0.004180908203125, -0.0107421875, 0.00015163421630859375, 0.02001953125, -0.0072021484375, 0.0128173828125, 0.01...	[ 22543, 54529, 1528, 20625, 142508, 23, 1556, 21656, 11015, 42276, 277, 69427, 18, 86869, 86171, 32354, 5646, 23351, 214, 84068, 30646, 360, 14012, 175457, 34153, 621, 83, 164805, 170933, 70760, 51776, 73783, 34677, 96819, 2565, 29568, 98320, ...	[ 0.1998291015625, 0.2276611328125, 0.16064453125, 0.14794921875, 0.2039794921875, 0.02789306640625, 0.1395263671875, 0.1739501953125, 0.0120849609375, 0.0960693359375, 0.0142669677734375, 0.044342041015625, 0.087158203125, 0.10125732421875, 0.093017578125, 0.158935546875, 0.1665039062...	embed
24967745_c1	24967745	haskell	1	messages on every impossible case? In this particular example, I know there are better ways to handle this, for example by having the caller match on the pattern . So if you want here is another example that is a very simplified extract from a lexer I'm writing which you can run, too: import Data.Char (isNumber, isAlp...	messages on every impossible case? In this particular example, I know there are better ways to handle this, for example by having the caller match on the pattern . So if you want here is another example that is a very simplified extract from a lexer I'm writing which you can run, too: import Data.Char (isNumber, isAlp...	[ -0.009521484375, 0.000522613525390625, -0.004974365234375, 0.01519775390625, 0.0106201171875, -0.005462646484375, -0.0052490234375, -0.01129150390625, 0.0169677734375, -0.0076904296875, 0.00909423828125, -0.002166748046875, -0.005523681640625, 0.0108642578125, 0.0059814453125, -0.00555...	[ 89914, 98, 11907, 69201, 7225, 903, 17311, 27781, 3714, 11522, 48322, 47, 34831, 19441, 11782, 56, 14858, 70, 103510, 5, 3444, 4552, 112892, 125663, 95, 34058, 831, 11675, 24927, 11809, 84068, 164, 18444, 26278, 83, 6210, 14612, 27131, 4667...	[ 0.262939453125, 0.1102294921875, 0.1640625, 0.30419921875, 0.2161865234375, 0.1087646484375, 0.05853271484375, 0.177734375, 0.00958251953125, 0.0821533203125, 0.05078125, 0.1390380859375, 0.173095703125, 0.02972412109375, 0.2001953125, 0.10491943359375, 0.1260986328125, 0.012145996...	embed
37265378_c1	37265378	haskell	1	://github.com/yesodweb/yesod/wiki/Configuration#parsing-numeric-values-as-strings database: user: "_env:MYSQL_USER:root" password: "_env:MYSQL_PASSWORD:#123" host: "_env:MYSQL_HOST:localhost" port: "_env:MYSQL_PORT:3306" # See config/test-settings.yml for an override during tests database: "_env:MYSQL_DATABASE:mydataba...	://github.com/yesodweb/yesod/wiki/Configuration#parsing-numeric-values-as-strings database: user: "_env:MYSQL_USER:root" password: "_env:MYSQL_PASSWORD:#123" host: "_env:MYSQL_HOST:localhost" port: "_env:MYSQL_PORT:3306" # See config/test-settings.yml for an override during tests database: "_env:MYSQL_DATABASE:mydataba...	[ -0.01556396484375, 0.015869140625, -0.00518798828125, -0.0130615234375, 0.00579833984375, 0.0242919921875, -0.0167236328125, -0.041748046875, -0.0084228515625, 0.0029296875, -0.012939453125, -0.002593994140625, -0.00933837890625, -0.01153564453125, -0.017333984375, 0.0142822265625, -...	[ 15769, 32102, 1033, 23722, 14051, 13691, 11935, 59994, 2320, 2500, 6953, 2606, 56, 1771, 27494, 90, 162, 91693, 63399, 38937, 33, 334, 73543, 158897, 454, 1062, 50184, 148920, 58, 78506, 98185, 89023, 36639, 12, 48636, 27980, 841, 98908, 40...	[ 0.098388671875, 0.1771240234375, 0.139892578125, 0.2313232421875, 0.1588134765625, 0.06256103515625, 0.0174102783203125, 0.200439453125, 0.0189971923828125, 0.1600341796875, 0.1339111328125, 0.1123046875, 0.212646484375, 0.037322998046875, 0.169189453125, 0.034698486328125, 0.1489257...	embed
28867353_c1	28867353	haskell	1	(x / 4) then isPowerOf4 (truncate (x / 4)) else False /tmp/haskell11524-8-kke52v/PowerOfFour.hs:10:23: Could not deduce (Fractional n) arising from a use of `/' from the context (Integral n) bound by the type signature for isPowerOf4 :: Integral n => n -> Bool at /tmp/haskell11524-8-kke52v/PowerOfFour.hs:5:15-37 Possi...	(x / 4) then isPowerOf4 (truncate (x / 4)) else False /tmp/haskell11524-8-kke52v/PowerOfFour.hs:10:23: Could not deduce (Fractional n) arising from a use of `/' from the context (Integral n) bound by the type signature for isPowerOf4 :: Integral n => n -> Bool at /tmp/haskell11524-8-kke52v/PowerOfFour.hs:5:15-37 Possi...	[ -0.0185546875, -0.0081787109375, -0.002105712890625, -0.0008392333984375, -0.0078125, 0.00958251953125, -0.01385498046875, -0.0087890625, 0.004486083984375, 0.00567626953125, -0.016357421875, -0.009033203125, -0.000553131103515625, -0.00762939453125, 0.00946044921875, 0.0087890625, -...	[ 425, 248, 13956, 83, 105022, 132887, 617, 9774, 19, 33478, 37076, 22225, 2676, 10557, 142508, 103928, 2357, 17376, 5222, 12744, 334, 27591, 474, 127, 15110, 24864, 191147, 959, 8, 106357, 108386, 10763, 289, 653, 187, 72219, 1295, 4527, 64,...	[ 0.089111328125, 0.1800537109375, 0.2315673828125, 0.19091796875, 0.2249755859375, 0.2406005859375, 0.2200927734375, 0.0987548828125, 0.07281494140625, 0.1534423828125, 0.008056640625, 0.1070556640625, 0.116455078125, 0.0797119140625, 0.207763671875, 0.06195068359375, 0.109619140625, ...	embed
73911130_c0	73911130	haskell	0	Title: reserve algorithm is not behaving Problem title: reserve algorithm is not behaving Tags: haskell Problem: reserve algorithm is not behaving The output from running this code is not correct, I cannot wrap my head sadly, to know where the wrong is in my own code. I been staring at it for hours. Code: import System...	reserve algorithm is not behaving reserve algorithm is not behaving haskell System.IO /home/runner/University-Labs/.ghci x:xs GHCi www.haskell.org Loaded University-Labs Compiling Main Main.hs Ctrl reserve algorithm is not behaving The output from running this code is not correct, I cannot wrap my head sadly, to know w...	[ -0.021728515625, 0.0205078125, 0.00823974609375, 0.021240234375, -0.0157470703125, 0.0123291015625, 0.0283203125, -0.0068359375, -0.01263427734375, 0.01312255859375, -0.000010788440704345703, -0.0036468505859375, 0.0322265625, -0.0086669921875, -0.01025390625, 0.001373291015625, 0.00...	[ 76875, 234873, 83, 959, 186, 528, 6496, 1556, 142508, 12353, 17780, 29552, 142117, 65305, 2481, 97381, 9486, 318, 1022, 425, 527, 73265, 14, 10557, 1478, 2091, 712, 12535, 15612, 49725, 12321, 127, 7, 68847, 140992, 51042, 18151, 26785, 534...	[ 0.308349609375, 0.25830078125, 0.043060302734375, 0.1519775390625, 0.10174560546875, 0.17578125, 0.07763671875, 0.142578125, 0.2481689453125, 0.0985107421875, 0.185302734375, 0.06915283203125, 0.172607421875, 0.040283203125, 0.018218994140625, 0.1695556640625, 0.080322265625, 0.113...	embed
78335230_c0	78335230	haskell	0	Title: Implementing I/O Tasty-Hunit testing for Github autograder Problem title: Implementing I/O Tasty-Hunit testing for Github autograder Tags: haskell, io, tasty, testing Problem: Implementing I/O Tasty-Hunit testing for Github autograder I've been given the task to implement a test for an IO function for GitHub's a...	Implementing I/O Tasty-Hunit testing for Github autograder Implementing I/O Tasty-Hunit testing for Github autograder haskell io tasty testing Implementing Tasty-Hunit Github First Second Third test_countLetters ReadMode System.IO.hDuplicateTo Haskell Fun Count Implementing I/O Tasty-Hunit testing for Github autograder...	[ 0.00701904296875, 0.00653076171875, -0.0260009765625, 0.01708984375, -0.0019683837890625, 0.00494384765625, 0.019287109375, -0.01007080078125, -0.00238037109375, 0.00775146484375, -0.003814697265625, -0.0240478515625, 0.008056640625, 0.01507568359375, 0.0242919921875, 0.000553131103515...	[ 153941, 87, 64, 670, 9598, 939, 30513, 6773, 134234, 100, 527, 217, 32102, 1809, 132130, 1556, 142508, 22995, 308, 8946, 23972, 77648, 198387, 3034, 71013, 124480, 23962, 4764, 9083, 12353, 17780, 127, 17726, 52721, 7763, 20625, 28670, 108210...	[ 0.15966796875, 0.035888671875, 0.188232421875, 0.1363525390625, 0.2236328125, 0.1871337890625, 0.1103515625, 0.196533203125, 0.2149658203125, 0.0202789306640625, 0.058990478515625, 0.1260986328125, 0.2188720703125, 0.1600341796875, 0.2222900390625, 0.083984375, 0.19775390625, 0.164...	embed
25297157_c0	25297157	haskell	0	Title: Generalizing mapAndUnzip Problem title: Generalizing mapAndUnzip Tags: functor, haskell Problem: Generalizing mapAndUnzip I'm looking for an easy way to write the function mapAndUnzip :: (Functor f) => (a -> (b,c)) -> f a -> (f b, f c) I'm not entirely convinced that Functor is a strong enough constraint, but I'...	Generalizing mapAndUnzip Generalizing mapAndUnzip functor haskell Generalizing Functor Data.Vector.Unboxed.Vector Vector Array Unbox Generalizing mapAndUnzip I'm looking for an easy way to write the function I'm not entirely convinced that Functor is a strong enough constraint, but I'll use it for concreteness. I want ...	[ 0.00286865234375, 0.027587890625, -0.002532958984375, 0.009765625, -0.01129150390625, 0.0125732421875, -0.036865234375, -0.02587890625, 0.0091552734375, -0.021484375, -0.0283203125, -0.01361083984375, 0.0179443359375, 0.0224609375, -0.01422119140625, 0.0020599365234375, -0.0126953125...	[ 9082, 84382, 22288, 37839, 14256, 50836, 7477, 18770, 1556, 142508, 28670, 11809, 26455, 11728, 297, 2609, 69253, 992, 16487, 23468, 3917, 33022, 32354, 122991, 37515, 158, 2816, 4288, 4527, 122776, 3444, 19048, 59911, 3229, 1238, 10644, 10846,...	[ 0.1695556640625, 0.0941162109375, 0.1715087890625, 0.1549072265625, 0.08905029296875, 0.2210693359375, 0.11474609375, 0.180419921875, 0.13330078125, 0.2314453125, 0.1378173828125, 0.07257080078125, 0.148681640625, 0.1932373046875, 0.00531005859375, 0.179931640625, 0.05316162109375, ...	embed
53773487_c1	53773487	haskell	1	writeMarkdown def thing) case md' of Left _ -> print "Damn" Right md -> writeFile "my.md" (T.unpack md) -- https://www.gwern.net/haskell/goodreadsToMarkdown.hs colHeaders :: [Blocks] colHeaders = map singleton [ Plain [Str "Title"] , Plain [Str "Author"] ] testRow = map singleton [ Plain [Str "Col 1"] , Plain [Str "Col...	writeMarkdown def thing) case md' of Left _ -> print "Damn" Right md -> writeFile "my.md" (T.unpack md) -- https://www.gwern.net/haskell/goodreadsToMarkdown.hs colHeaders :: [Blocks] colHeaders = map singleton [ Plain [Str "Title"] , Plain [Str "Author"] ] testRow = map singleton [ Plain [Str "Col 1"] , Plain [Str "Col...	[ 0.00543212890625, -0.002960205078125, -0.01251220703125, 0.0208740234375, -0.007415771484375, -0.00390625, 0.01104736328125, -0.01385498046875, -0.0074462890625, -0.00665283203125, -0.004486083984375, -0.00098419189453125, 0.00860595703125, 0.01434326171875, -0.0032501220703125, -0.003...	[ 33022, 73484, 34695, 8, 420, 13580, 7225, 347, 71, 25, 111, 636, 2480, 33079, 28412, 397, 302, 19, 90911, 174350, 1176, 5, 54686, 618, 309, 29102, 6488, 10557, 142508, 70810, 39116, 7763, 127, 3365, 13025, 11, 14202, 166191, 22288, 11001,...	[ 0.23681640625, 0.2205810546875, 0.26953125, 0.1202392578125, 0.111328125, 0.22314453125, 0.1405029296875, 0.02435302734375, 0.1278076171875, 0.07666015625, 0.055908203125, 0.06671142578125, 0.1441650390625, 0.01715087890625, 0.1971435546875, 0.0587158203125, 0.1971435546875, 0.1413...	embed
26636328_c0	26636328	haskell	0	Title: Fusing traversals Problem title: Fusing traversals Tags: traversal, haskell-lens, haskell Problem: Fusing traversals The Traversable Paper gives an example on page 18-19 of fusing monoidal and monadic traversals which sounds really interesting but I'm confused by their LaTex. cciBody :: Char -> Count a wciBody :...	Fusing traversals Fusing traversals traversal haskell-lens haskell Fusing Char Count State Bool DotInASquare XInASquare Traversable Fusing traversals The Traversable Paper gives an example on page 18-19 of fusing monoidal and monadic traversals which sounds really interesting but I'm confused by their LaTex. With the a...	[ 0.00750732421875, 0.0016632080078125, -0.0019378662109375, 0.003631591796875, 0.00933837890625, 0.00408935546875, -0.00193023681640625, -0.033935546875, 0.00616455078125, -0.0218505859375, 0.01190185546875, 0.024658203125, -0.01348876953125, 0.00518798828125, -0.012939453125, -0.009460...	[ 7680, 6953, 37317, 16765, 289, 1556, 142508, 1977, 21656, 108210, 22836, 2460, 929, 84929, 4153, 94727, 39073, 19, 4937, 7864, 2886, 62323, 27781, 9191, 543, 8363, 57574, 214, 22460, 14, 2465, 136, 2667, 11, 18403, 102678, 49041, 55681, 239...	[ 0.1932373046875, 0.1175537109375, 0.225830078125, 0.1192626953125, 0.04376220703125, 0.10040283203125, 0.23388671875, 0.11962890625, 0.1400146484375, 0.1585693359375, 0.09283447265625, 0.015350341796875, 0.07958984375, 0.06787109375, 0.1484375, 0.130615234375, 0.09869384765625, 0.0...	embed
57872727_c0	57872727	haskell	0	Title: Trouble with creating join when making monad instance of an object Problem title: Trouble with creating join when making monad instance of an object Tags: haskell, monads Problem: Trouble with creating join when making monad instance of an object I currently have a newtype instance which I should translate into ...	Trouble with creating join when making monad instance of an object Trouble with creating join when making monad instance of an object haskell monads Trouble Thing Show Functor Trouble with creating join when making monad instance of an object I currently have a newtype instance which I should translate into a monad. I ...	[ -0.01300048828125, 0.00634765625, 0.010009765625, -0.01318359375, -0.00144195556640625, 0.0269775390625, -0.00836181640625, -0.01031494140625, 0.0322265625, -0.02880859375, 0.0029144287109375, -0.022216796875, -0.0024566650390625, -0.0059814453125, -0.017578125, -0.010009765625, 0.00...	[ 119671, 2661, 678, 105233, 33284, 3229, 20662, 2667, 712, 110527, 36746, 1556, 142508, 6003, 214, 17367, 28670, 18770, 82424, 3525, 50986, 3900, 19309, 63134, 13204, 68557, 47, 61924, 51776, 1632, 17366, 7565, 203251, 59911, 32354, 1884, 221, ...	[ 0.13671875, 0.08477783203125, 0.044952392578125, 0.1871337890625, 0.2479248046875, 0.0218658447265625, 0.0924072265625, 0.1436767578125, 0.1925048828125, 0.1927490234375, 0.1650390625, 0.1087646484375, 0.2080078125, 0.1353759765625, 0.1146240234375, 0.12451171875, 0.07745361328125, ...	embed
19267344_c0	19267344	haskell	0	Title: How to evaluate an Haskell expression immediately? Problem title: How to evaluate an Haskell expression immediately? Tags: haskell, strict, evaluation Problem: How to evaluate an Haskell expression immediately? When I use JS, I have two options to handle a function. var a = function() {}; var b = a; // b is the ...	How to evaluate an Haskell expression immediately? How to evaluate an Haskell expression immediately? haskell strict evaluation How Haskell Anonymous How to evaluate an Haskell expression immediately? When I use JS, I have two options to handle a function. AFAIK, Haskell is lazy by default, so I always get b by default...	[ -0.004119873046875, 0.00579833984375, 0.011962890625, 0.005035400390625, 0.0252685546875, 0.01446533203125, 0.031005859375, 0.004119873046875, 0.0001735687255859375, -0.0303955078125, 0.000682830810546875, 0.0031280517578125, -0.001190185546875, -0.01348876953125, -0.003143310546875, -...	[ 11249, 47, 151575, 13, 20625, 142508, 125195, 109312, 1556, 81113, 219836, 180585, 142, 4527, 64977, 6626, 50717, 34831, 32354, 21, 3285, 114977, 11343, 2046, 876, 2174, 3444, 501, 3642, 831, 54, 28641, 3884, 2565, 143726, 31380, 318, 16750, ...	[ 0.085693359375, 0.06719970703125, 0.2364501953125, 0.1324462890625, 0.1455078125, 0.271240234375, 0.25390625, 0.2381591796875, 0.1165771484375, 0.1968994140625, 0.2197265625, 0.08856201171875, 0.03302001953125, 0.013671875, 0.1767578125, 0.1263427734375, 0.1617431640625, 0.08984375...	embed
19794508_c0	19794508	haskell	0	Title: Is there a standard way to match 2 lists with a custom matching function in Haskell? Problem title: Is there a standard way to match 2 lists with a custom matching function in Haskell? Tags: haskell Problem: Is there a standard way to match 2 lists with a custom matching function in Haskell? I know that a standa...	Is there a standard way to match 2 lists with a custom matching function in Haskell? Is there a standard way to match 2 lists with a custom matching function in Haskell? haskell Haskell Bool _:_ x:xs y:ys Is there a standard way to match 2 lists with a custom matching function in Haskell? I know that a standard way wou...	[ -0.005767822265625, 0.0135498046875, -0.0037994384765625, -0.0177001953125, -0.0111083984375, 0.01251220703125, 0.0032958984375, -0.002471923828125, 0.01495361328125, 0.0014190673828125, 0.01153564453125, -0.00124359130859375, -0.0038909912109375, -0.024169921875, -0.001983642578125, -...	[ 2685, 5570, 3917, 47, 14858, 116, 5303, 7, 678, 114122, 214, 32354, 23, 20625, 142508, 1556, 2460, 929, 4778, 5361, 12830, 115081, 50782, 110, 6226, 16487, 133, 138256, 68330, 3871, 20187, 140909, 107730, 5351 ]	[ 0.012054443359375, 0.2044677734375, 0.10577392578125, 0.0303802490234375, 0.2464599609375, 0.1611328125, 0.228759765625, 0.054229736328125, 0.08087158203125, 0.211181640625, 0.1138916015625, 0.187255859375, 0.035430908203125, 0.1259765625, 0.231689453125, 0.0833740234375, 0.025390625...	embed
22394562_c0	22394562	haskell	0	Title: How do you reify/walk a record definition in Haskell Problem title: How do you reify/walk a record definition in Haskell Tags: template-haskell, generics, haskell Problem: How do you reify/walk a record definition in Haskell Given an record (not an instance of the record, the record definition itself) such as: d...	How do you reify/walk a record definition in Haskell How do you reify/walk a record definition in Haskell template-haskell generics haskell How Haskell Request Expand Shorten LinkEdit Maybe Bool user_ts How do you reify/walk a record definition in Haskell Given an record (not an instance of the record, the record defin...	[ -0.0257568359375, 0.016845703125, 0.01531982421875, 0.016357421875, 0.006072998046875, 0.00994873046875, -0.00836181640625, -0.012451171875, 0.00109100341796875, -0.0281982421875, -0.01318359375, -0.041748046875, 0.009033203125, -0.01531982421875, 0.0034027099609375, 0.0115966796875, ...	[ 11249, 456, 40383, 94449, 17164, 80934, 20625, 142508, 64, 110934, 10557, 189534, 1556, 75616, 60075, 2940, 82990, 33, 12779, 125270, 2460, 929, 38937, 933, 54, 10, 23, 110527, 3642, 139392, 18151, 17368, 3004, 1295, 28987, 127689, 196631, 64...	[ 0.029510498046875, 0.1318359375, 0.24072265625, 0.2249755859375, 0.260498046875, 0.2366943359375, 0.1263427734375, 0.2247314453125, 0.03424072265625, 0.20654296875, 0.07958984375, 0.1824951171875, 0.10711669921875, 0.1007080078125, 0.06243896484375, 0.0582275390625, 0.09442138671875,...	embed
45110216_c0	45110216	haskell	0	Title: Trouble with haskell IO Problem title: Trouble with haskell IO Tags: io, haskell Problem: Trouble with haskell IO I am having difficulty understanding exactly how haskell processes input and output. As an example, here I am trying to take command line arguments of a list of data files, and put the contents of th...	Trouble with haskell IO Trouble with haskell IO io haskell input Trouble Read Doubles Handle Double Send x:xs ReadMode Trouble with haskell IO I am having difficulty understanding exactly how haskell processes input and output. As an example, here I am trying to take command line arguments of a list of data files, and ...	[ 0.00970458984375, 0.00177764892578125, 0.002899169921875, -0.00946044921875, -0.016845703125, 0.0247802734375, 0.0152587890625, -0.026123046875, -0.00171661376953125, -0.01556396484375, 0.0185546875, -0.041015625, 0.005950927734375, 0.004364013671875, -0.00732421875, -0.006072998046875...	[ 119671, 2661, 678, 1556, 142508, 17780, 22995, 107730, 4764, 107172, 10639, 133, 24044, 1022, 12, 425, 9083, 34844, 100094, 66161, 3642, 9433, 90, 136, 140992, 27781, 31577, 5646, 75101, 13315, 10750, 5303, 2053, 102158, 3884, 10941, 41929, 7...	[ 0.1695556640625, 0.1512451171875, 0.1273193359375, 0.1666259765625, 0.2379150390625, 0.23291015625, 0.2232666015625, 0.1668701171875, 0.1751708984375, 0.19482421875, 0.13720703125, 0.00689697265625, 0.1024169921875, 0.057037353515625, 0.033233642578125, 0.083251953125, 0.150756835937...	embed
69671742_c0	69671742	haskell	0	Title: Haskell: Replace a subString in a String without Data.List package Problem title: Haskell: Replace a subString in a String without Data.List package Tags: list, string, text, haskell-stack, haskell Problem: Haskell: Replace a subString in a String without Data.List package I'm very new in Haskell and I want to k...	Haskell: Replace a subString in a String without Data.List package Haskell: Replace a subString in a String without Data.List package list string text haskell-stack haskell Haskell Replace Data.List main::IO c:cs Graph Graphic Haskell: Replace a subString in a String without Data.List package I'm very new in Haskell an...	[ -0.014404296875, 0.00537109375, -0.0074462890625, 0.025146484375, -0.01019287109375, 0.0135498046875, -0.00958251953125, 0.01123046875, -0.0029296875, 0.0264892578125, 0.0091552734375, -0.0167236328125, 0, -0.01318359375, 0.011474609375, 0.0091552734375, 0.03076171875, 0.0145874023...	[ 20625, 142508, 853, 23935, 1614, 71713, 214, 23, 23351, 15490, 11809, 154663, 98169, 5303, 79315, 7986, 1556, 590, 2594, 5201, 17780, 4439, 6524, 11727, 189682, 12, 3525, 3444, 3714, 3642, 831, 91995, 1653, 13, 30524, 2565, 390, 15700, 1815...	[ 0.12158203125, 0.2259521484375, 0.09747314453125, 0.174560546875, 0.1881103515625, 0.20751953125, 0.1309814453125, 0.06207275390625, 0.2186279296875, 0.1290283203125, 0.1240234375, 0.165283203125, 0.1539306640625, 0.1092529296875, 0.1702880859375, 0.1273193359375, 0.1082763671875, ...	embed
30426720_c0	30426720	haskell	0	Title: Defining an infinite sequence of Fibonacci numbers using list comprehension in Haskell Problem title: Defining an infinite sequence of Fibonacci numbers using list comprehension in Haskell Tags: list-comprehension, haskell, functional-programming, fibonacci Problem: Defining an infinite sequence of Fibonacci num...	Defining an infinite sequence of Fibonacci numbers using list comprehension in Haskell Defining an infinite sequence of Fibonacci numbers using list comprehension in Haskell list-comprehension haskell functional-programming fibonacci list Defining Fibonacci Haskell Integer Defining an infinite sequence of Fibonacci num...	[ 0.01171875, 0.004974365234375, -0.005889892578125, 0.007354736328125, -0.0036163330078125, 0.010009765625, 0.005462646484375, 0.005340576171875, -0.0016937255859375, -0.0279541015625, 0.002685546875, -0.0196533203125, 0.0247802734375, 0.018798828125, 0.0062255859375, 0.0286865234375, ...	[ 88606, 449, 54241, 13, 40, 944, 3956, 3698, 20990, 52544, 101935, 17368, 5303, 46683, 3220, 6889, 20625, 142508, 23, 277, 4692, 1556, 123309, 28966, 809, 44401, 2806, 54, 903, 81979, 59619, 122753, 5122, 4527, 35773, 32354, 46741, 1984, 683...	[ 0.1917724609375, 0.028900146484375, 0.19580078125, 0.0831298828125, 0.061309814453125, 0.1419677734375, 0.059539794921875, 0.155517578125, 0.179931640625, 0.2196044921875, 0.1710205078125, 0.054931640625, 0.20361328125, 0.164306640625, 0.1683349609375, 0.039031982421875, 0.1383056640...	embed
30636767_c1	30636767	haskell	1	Gen world) But, this code does not works. import qualified System.Random.MWC as MWC import Control.Monad import Control.Monad.Primitive import Control.Monad.ST data World s = World { randomGen :: MWC.Gen (PrimState (ST s))} initWorld :: ST s (World s) initWorld = do gen <- MWC.create return $ World gen something gen = ...	Gen world) But, this code does not works. import qualified System.Random.MWC as MWC import Control.Monad import Control.Monad.Primitive import Control.Monad.ST data World s = World { randomGen :: MWC.Gen (PrimState (ST s))} initWorld :: ST s (World s) initWorld = do gen <- MWC.create return $ World gen something gen = ...	[ -0.0250244140625, 0.005950927734375, -0.0074462890625, -0.0125732421875, 0.0213623046875, -0.004119873046875, 0.035400390625, -0.03955078125, -0.00457763671875, -0.053955078125, -0.004913330078125, 0.0341796875, -0.006927490234375, 0.0031890869140625, 0.01165771484375, -0.0004348754882...	[ 15937, 8999, 16, 4966, 903, 18151, 14602, 959, 43240, 24927, 217225, 12353, 126525, 3815, 594, 75590, 237, 46298, 441, 27131, 46674, 712, 5, 145111, 14, 4935, 8545, 2053, 6661, 91, 2203, 96759, 105376, 1984, 135206, 23, 217, 70646, 16992, ...	[ 0.24267578125, 0.217041015625, 0.05126953125, 0.05462646484375, 0.09442138671875, 0.2276611328125, 0.09228515625, 0.1573486328125, 0.171630859375, 0.1922607421875, 0.22412109375, 0.1199951171875, 0.1077880859375, 0.170166015625, 0.0254364013671875, 0.154052734375, 0.026641845703125, ...	embed
55775412_c1	55775412	haskell	1	#-} import Control.Monad ((>>=)) import Data.Vector.Unboxed (Unbox, Vector, freeze, (!)) import Data.Vector.Unboxed.Mutable (IOVector, new, write) import qualified Data.Vector.Unboxed.Mutable as VM unique' :: forall a . (Unbox a, Eq a) => [a] -> IO (Vector a, Vector Int) unique' vs = do let n = length vs idx <- VM.rep...	#-} import Control.Monad ((>>=)) import Data.Vector.Unboxed (Unbox, Vector, freeze, (!)) import Data.Vector.Unboxed.Mutable (IOVector, new, write) import qualified Data.Vector.Unboxed.Mutable as VM unique' :: forall a . (Unbox a, Eq a) => [a] -> IO (Vector a, Vector Int) unique' vs = do let n = length vs idx <- VM.rep...	[ -0.01300048828125, 0.031494140625, 0.0118408203125, -0.00823974609375, 0.0189208984375, -0.01544189453125, -0.00994873046875, -0.0037841796875, 0.007049560546875, -0.031982421875, -0.0198974609375, 0.02099609375, 0.025634765625, 0.024658203125, -0.0233154296875, 0.00016307830810546875,...	[ 468, 9, 8152, 24927, 27131, 5, 46674, 712, 60494, 30813, 1369, 16, 11809, 26455, 18770, 14256, 11728, 297, 4, 2609, 4092, 731, 72896, 10685, 22819, 17780, 3525, 33022, 217225, 237, 43084, 36998, 25, 1984, 100, 5584, 10, 6, 15, 241, 864,...	[ 0.060577392578125, 0.05908203125, 0.0089111328125, 0.25390625, 0.261474609375, 0.07373046875, 0.1563720703125, 0.180908203125, 0.03082275390625, 0.0478515625, 0.04541015625, 0.003265380859375, 0.1820068359375, 0.2293701171875, 0.2166748046875, 0.12451171875, 0.2406005859375, 0.0744...	embed
37397614_c0	37397614	haskell	0	Title: Haskell XMonad configuration using readProcess Problem title: Haskell XMonad configuration using readProcess Tags: haskell, xmonad Problem: Haskell XMonad configuration using readProcess I'm trying to configure XMonad without actually understand the Haskell syntax. I run a gnome session with xmonad on top. I wan...	Haskell XMonad configuration using readProcess Haskell XMonad configuration using readProcess haskell xmonad readProcess Haskell XMonad xK_g xmonad.hs:169:12 Couldn Haskell XMonad configuration using readProcess I'm trying to configure XMonad without actually understand the Haskell syntax. I run a gnome session with xm...	[ -0.0169677734375, 0.0169677734375, -0.013671875, 0.0069580078125, 0.01422119140625, 0.0166015625, 0.0020294189453125, -0.024658203125, -0.00119781494140625, -0.04833984375, 0.025146484375, -0.0047607421875, -0.0206298828125, -0.006439208984375, 0.01214599609375, -0.00872802734375, -0...	[ 20625, 142508, 1193, 46674, 712, 180346, 17368, 12301, 10752, 26531, 1556, 1022, 3796, 605, 177, 127, 141492, 20927, 191147, 222495, 28219, 6002, 86531, 11675, 64970, 56002, 678, 2663, 24234, 2811, 9, 254, 47, 129384, 91133, 2174, 16138, 959,...	[ 0.1337890625, 0.25244140625, 0.1209716796875, 0.21435546875, 0.185791015625, 0.2315673828125, 0.061767578125, 0.201171875, 0.1737060546875, 0.1787109375, 0.08056640625, 0.0689697265625, 0.140625, 0.011871337890625, 0.047332763671875, 0.0258636474609375, 0.0609130859375, 0.034820556...	embed
43372853_c1	43372853	haskell	1	to be able to count on it happening. I'm concerned that if I add enough specialized variants to this file or that if I call lookupSorted from another module, GHC might eventually lean in favor of a small generated executable rather than a fast one. My understanding is that the SPECIALIZE pragma does not help in the si...	to be able to count on it happening. I'm concerned that if I add enough specialized variants to this file or that if I call lookupSorted from another module, GHC might eventually lean in favor of a small generated executable rather than a fast one. My understanding is that the SPECIALIZE pragma does not help in the si...	[ 0.004241943359375, 0.0181884765625, 0.0218505859375, -0.031982421875, 0.00469970703125, 0.00823974609375, -0.0003032684326171875, -0.024169921875, 0.006439208984375, 0.0098876953125, -0.00014972686767578125, -0.01007080078125, -0.01470947265625, 0.004608154296875, 0.004669189453125, -0...	[ 19048, 47, 54529, 98, 442, 123087, 142837, 15190, 20174, 5361, 29367, 20117, 7, 903, 11435, 87, 11782, 6713, 2037, 158240, 3674, 88996, 527, 73265, 13648, 155605, 65342, 10862, 19336, 139392, 71924, 2886, 4271, 100094, 224343, 568, 19157, 588...	[ 0.03466796875, 0.03009033203125, 0.1590576171875, 0.085693359375, 0.049285888671875, 0.116943359375, 0.1082763671875, 0.0958251953125, 0.093994140625, 0.19775390625, 0.12353515625, 0.2406005859375, 0.00103759765625, 0.004791259765625, 0.17333984375, 0.002288818359375, 0.0315551757812...	embed
65726180_c0	65726180	haskell	0	Title: Acces foreign library from cabal2nix in andother derivation Problem title: Acces foreign library from cabal2nix in andother derivation Tags: ffi, haskell, nix Problem: Acces foreign library from cabal2nix in andother derivation I'm building Haskell foreign library using nix with cabal2nix. After build ./result/ ...	Acces foreign library from cabal2nix in andother derivation Acces foreign library from cabal2nix in andother derivation ffi haskell nix cabal2nix /engine/default.nix Acces libroman.so ghc-8.8.4 pkgs.haskellPackages.callCabal2nix default.nix pkgs.qt5.mkDerivation pkgs.qt5.qmake pkgs.qt5.qtbase b10shv9yqbgps47y0n8x7l7bq8...	[ 0.0205078125, -0.00909423828125, -0.0198974609375, -0.005035400390625, -0.00213623046875, 0.007171630859375, -0.00151824951171875, 0.01458740234375, 0.0022125244140625, -0.041748046875, -0.00048065185546875, -0.037353515625, 0.01287841796875, 0.021484375, -0.013916015625, -0.0286865234...	[ 29899, 90, 110613, 35773, 1294, 1295, 109524, 304, 93, 425, 23, 136, 126340, 30057, 24500, 1556, 142508, 300, 128897, 214810, 7750, 669, 991, 31380, 238, 17376, 163883, 8517, 10557, 205956, 85763, 3571, 114977, 47731, 3984, 37382, 3609, 7870,...	[ 0.14794921875, 0.053985595703125, 0.2052001953125, 0.22216796875, 0.1180419921875, 0.06927490234375, 0.2034912109375, 0.129638671875, 0.11865234375, 0.1295166015625, 0.036407470703125, 0.068603515625, 0.1656494140625, 0.1707763671875, 0.1102294921875, 0.08251953125, 0.17822265625, ...	embed
43692774_c0	43692774	haskell	0	Title: "PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 Problem title: "PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 Tags: audio, haskell, wav Problem: "PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 I am attempting to play a ....	"PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 "PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 audio haskell wav Data.WAVE HasCallStack PCM Data WAVE.hs:127:11 WAVE-0.1.3 myrecording.wav PlayWave PlayWav.hs CallStack WAVE-0.1.3-EDUsomPiULdBJaA1HF9vpg:...	[ -0.0159912109375, -0.0064697265625, -0.0035400390625, 0.01458740234375, 0.0228271484375, 0.02978515625, 0.00014972686767578125, -0.0311279296875, -0.00145721435546875, -0.04248046875, -0.004486083984375, -0.033203125, 0.01434326171875, -0.028076171875, -0.00927734375, -0.00680541992187...	[ 12233, 594, 4734, 100, 5036, 41502, 18499, 35839, 99, 137989, 1456, 65298, 127, 133249, 19993, 601, 23320, 81046, 18215, 1556, 142508, 259, 334, 11809, 20625, 441, 5584, 42378, 2594, 6107, 759, 32271, 634, 11356, 22489, 272, 3818, 26265, 17...	[ 0.177001953125, 0.23046875, 0.216796875, 0.210693359375, 0.283203125, 0.057159423828125, 0.2095947265625, 0.1168212890625, 0.0670166015625, 0.136962890625, 0.13623046875, 0.25146484375, 0.1253662109375, 0.2020263671875, 0.1942138671875, 0.136962890625, 0.1190185546875, 0.2186279296...	embed
4482987_c0	4482987	haskell	0	Title: How about Haskell's GC performance for soft realtime application like games? Problem title: How about Haskell's GC performance for soft realtime application like games? Tags: haskell, performance, real-time, soft-real-time, garbage-collection Problem: How about Haskell's GC performance for soft realtim...	How about Haskell's GC performance for soft realtime application like games? How about Haskell's GC performance for soft realtime application like games? haskell performance real-time soft-real-time garbage-collection How Haskell How about Haskell's GC performance for soft realtime application like games? Bec...	[ 0.00457763671875, 0.021484375, 0.0198974609375, -0.0162353515625, 0.00762939453125, -0.021240234375, -0.0250244140625, -0.00122833251953125, 0.0023651123046875, -0.0184326171875, 0.016357421875, 0.003997802734375, 0.00189208984375, 0.004058837890625, -0.00445556640625, 0.01123046875, ...	[ 11249, 1672, 20625, 142508, 3768, 69657, 23718, 100, 32977, 2773, 6032, 38415, 1884, 27528, 1556, 30544, 3671, 402, 429, 196352, 185171, 6712, 79986, 62775, 5608, 34831, 58696, 27140, 179635, 17368, 351, 46280, 46876, 44457, 23, 35311, 26499, ...	[ 0.0689697265625, 0.038909912109375, 0.1492919921875, 0.264892578125, 0.044586181640625, 0.2181396484375, 0.1920166015625, 0.03955078125, 0.1998291015625, 0.144775390625, 0.099853515625, 0.13720703125, 0.08270263671875, 0.1357421875, 0.1080322265625, 0.0936279296875, 0.033905029296875...	embed
78312887_c1	78312887	haskell	1	wrap the inside of the Maybe , which is a , but the whole Maybe a . If StateT had to resemble MaybeT (in this fact of using m to wrap the whole thing), it would have been like this newtype StateT' s m a = StateT' { runStateT' :: m (s -> (a,s)) } About this, some thoughts come to mind: What would have been wrong with i...	wrap the inside of the Maybe , which is a , but the whole Maybe a . If StateT had to resemble MaybeT (in this fact of using m to wrap the whole thing), it would have been like this newtype StateT' s m a = StateT' { runStateT' :: m (s -> (a,s)) } About this, some thoughts come to mind: What would have been wrong with i...	[ -0.0228271484375, 0.0031585693359375, 0.009521484375, -0.003448486328125, 0.00604248046875, -0.00604248046875, 0.000202178955078125, -0.01409912109375, 0.00897216796875, 0.002899169921875, 0.011474609375, 0.01141357421875, -0.01361083984375, 0.019287109375, -0.006866455078125, -0.00964...	[ 137565, 70, 46132, 111, 83425, 3129, 83, 10, 1284, 28271, 22836, 618, 1902, 102337, 40099, 17368, 347, 47, 13580, 2806, 765, 2809, 1884, 3525, 50986, 25, 11675, 135206, 33079, 11, 4, 7, 903, 38514, 7086, 4865, 44691, 678, 4263, 33720, 4...	[ 0.275146484375, 0.046661376953125, 0.208740234375, 0.028594970703125, 0.308349609375, 0.0240631103515625, 0.051361083984375, 0.15869140625, 0.1134033203125, 0.1732177734375, 0.2012939453125, 0.204833984375, 0.018890380859375, 0.10003662109375, 0.10345458984375, 0.062347412109375, 0.1...	embed
78976457_c0	78976457	haskell	0	Title: is something wrong with my compiler or my syntax inn Problem title: is something wrong with my compiler or my syntax inn Tags: haskell, parse-error Problem: is something wrong with my compiler or my syntax inn im new to haskell and when i tried some basic syntax it seems to not work the way it is supposed to wor...	is something wrong with my compiler or my syntax inn is something wrong with my compiler or my syntax inn haskell parse-error n-1 main.hs:5:9 main::IO Integer main.hs:4:12 Suggested Perhaps e.g is something wrong with my compiler or my syntax inn im new to haskell and when i tried some basic syntax it seems to not work...	[ -0.006195068359375, 0.01507568359375, 0.0026092529296875, 0.0028839111328125, -0.0245361328125, 0.01202392578125, -0.0025787353515625, -0.016357421875, -0.009765625, -0.0235595703125, -0.01031494140625, -0.0140380859375, -0.01507568359375, -0.013671875, 0.015380859375, -0.0039978027343...	[ 83, 9844, 44691, 678, 759, 9969, 34759, 707, 6002, 86531, 2083, 1556, 142508, 366, 184, 188800, 653, 5759, 5201, 127, 7, 758, 1126, 17780, 44401, 20927, 104235, 429, 181799, 177, 566, 3525, 37842, 62822, 37202, 959, 4488, 3917, 134598, 33...	[ 0.041534423828125, 0.110595703125, 0.1771240234375, 0.062744140625, 0.041748046875, 0.1556396484375, 0.1917724609375, 0.0291900634765625, 0.0931396484375, 0.168212890625, 0.2449951171875, 0.1593017578125, 0.2454833984375, 0.147705078125, 0.13916015625, 0.1690673828125, 0.089111328125...	embed
67581811_c0	67581811	haskell	0	Title: Unique elements from a list according to a subset of fields Problem title: Unique elements from a list according to a subset of fields Tags: duplicates, haskell, list, unique Problem: Unique elements from a list according to a subset of fields Given a record like data Foo = Foo { fooName :: Text, fooAge :: Int, ...	Unique elements from a list according to a subset of fields Unique elements from a list according to a subset of fields duplicates haskell list unique a Unique Foo Text London York Paris Madrid Los Angeles Berlin Unique elements from a list according to a subset of fields Given a record like With a list of such element...	[ -0.00063323974609375, 0.011474609375, 0.00604248046875, 0.00009870529174804688, -0.0047607421875, 0.006805419921875, 0.0048828125, 0.00653076171875, 0.0203857421875, -0.0159912109375, -0.0162353515625, 0.01708984375, 0.023681640625, -0.00020503997802734375, -0.025634765625, -0.01385498...	[ 11789, 944, 80854, 1295, 5303, 59499, 1614, 3509, 44457, 171763, 1636, 1556, 142508, 36998, 9572, 31, 24129, 9020, 5753, 7270, 8884, 3731, 31754, 10271, 17164, 1884, 6044, 2685, 10, 32354, 47, 87388, 4734, 3299, 170933, 397, 2037, 75358, 58...	[ 0.2396240234375, 0.16162109375, 0.241943359375, 0.110595703125, 0.20361328125, 0.12451171875, 0.1484375, 0.1483154296875, 0.2091064453125, 0.265380859375, 0.178466796875, 0.1304931640625, 0.2403564453125, 0.281494140625, 0.22265625, 0.162353515625, 0.1990966796875, 0.183837890625, ...	embed
69757249_c0	69757249	haskell	0	Title: Haskell stack test cabal file inro not found Problem title: Haskell stack test cabal file inro not found Tags: haskell, haskell-stack, ghci Problem: Haskell stack test cabal file inro not found I got this message after trying to run stack test. Now I don't know what to do Cabal file info not found for tasty-1.4....	Haskell stack test cabal file inro not found Haskell stack test cabal file inro not found haskell haskell-stack ghci file Haskell Cabal tasty-1.4.2 sha256:b124f1f5db8291e547254e3b52e94e091fb020b97421c6824fcb9df3a9d143a8 Selected s3.amazonaws.com hackage.fpcomplete.com Downloading Updating Updated Calculating Populating...	[ 0.012451171875, 0.00823974609375, 0.006561279296875, 0.0213623046875, -0.00592041015625, -0.004119873046875, -0.016357421875, 0.000244140625, -0.00927734375, 0.02685546875, 0.006591796875, -0.03564453125, -0.0074462890625, 0.01068115234375, 0.0235595703125, 0.01214599609375, 0.004028...	[ 20625, 142508, 177261, 3034, 109524, 11435, 23, 516, 959, 14037, 1556, 590, 2594, 31380, 318, 30438, 289, 308, 8946, 117904, 9638, 127892, 109589, 363, 85526, 4588, 131801, 4857, 28641, 212467, 157890, 1916, 11648, 190355, 12745, 202567, 11832,...	[ 0.146240234375, 0.2349853515625, 0.207763671875, 0.168701171875, 0.2318115234375, 0.1875, 0.1246337890625, 0.2276611328125, 0.0831298828125, 0.1241455078125, 0.119873046875, 0.10107421875, 0.05810546875, 0.113525390625, 0.130126953125, 0.1602783203125, 0.150634765625, 0.11511230468...	embed
59530041_c1	59530041	haskell	1	/ghci-script Prelude> :load Script.hs [1 of 1] Compiling Script ( Script.hs, interpreted ) Stacko.hs:7:1: error: Could not find module ‘Data.Set’ Perhaps you meant Data.Int (from base-4.11.1.0) Use -v to see a list of the files searched for. \| 7 \| import qualified Data.Set as Set (Set, fromList) \| ^^^^^^^^^^^^^^^^^^^^^...	/ghci-script Prelude> :load Script.hs [1 of 1] Compiling Script ( Script.hs, interpreted ) Stacko.hs:7:1: error: Could not find module ‘Data.Set’ Perhaps you meant Data.Int (from base-4.11.1.0) Use -v to see a list of the files searched for. \| 7 \| import qualified Data.Set as Set (Set, fromList) \| ^^^^^^^^^^^^^^^^^^^^^...	[ -0.00335693359375, -0.00006580352783203125, -0.004364013671875, 0.0225830078125, -0.00347900390625, 0.01141357421875, 0.0230712890625, -0.0023193359375, 0.00604248046875, -0.01318359375, -0.003997802734375, -0.016845703125, 0.00982666015625, -0.000858306884765625, -0.006866455078125, 0...	[ 9486, 318, 32032, 1914, 822, 112, 63033, 84654, 127, 7, 15612, 49725, 29481, 6512, 60635, 966, 19721, 18499, 191147, 959, 7413, 88996, 137989, 5, 294, 126, 181799, 11809, 4153, 18, 161063, 3647, 11565, 14556, 102107, 334, 5303, 102158, 3393...	[ 0.1268310546875, 0.166015625, 0.177734375, 0.07623291015625, 0.1505126953125, 0.103271484375, 0.148681640625, 0.217041015625, 0.1485595703125, 0.052459716796875, 0.1036376953125, 0.1031494140625, 0.131591796875, 0.1182861328125, 0.18701171875, 0.02716064453125, 0.075927734375, 0.14...	embed
11076461_c1	11076461	haskell	1	], Int, [Int], Int) gameRound :: GameState -> Int -> GameState gameRound (Deal, toDeal, toBurn, inPlay, tied, numPlayers, pWins, dWins) card \| toDeal > 0 = -- not enough card, deal a card (Deal, toDeal - 1, 0, card:inPlay, tied, numPlayers, pWins, dWins) \| toDeal == 0 = -- enough cards in play now -- here should detemi...	], Int, [Int], Int) gameRound :: GameState -> Int -> GameState gameRound (Deal, toDeal, toBurn, inPlay, tied, numPlayers, pWins, dWins) card \| toDeal > 0 = -- not enough card, deal a card (Deal, toDeal - 1, 0, card:inPlay, tied, numPlayers, pWins, dWins) \| toDeal == 0 = -- enough cards in play now -- here should detemi...	[ -0.023681640625, -0.004119873046875, 0.007781982421875, -0.01318359375, -0.0003376007080078125, -0.001617431640625, -0.0128173828125, -0.0198974609375, 0.0096435546875, 0.03564453125, 0.0029296875, 0.0576171875, -0.028076171875, 0.01141357421875, -0.0186767578125, -0.0084228515625, -...	[ 360, 18, 4153, 6712, 12724, 7030, 13547, 135206, 4657, 289, 47, 87336, 19, 23, 97054, 146543, 13269, 142581, 92049, 104, 20596, 757, 959, 20174, 35142, 106, 73, 126381, 11301, 5036, 8, 67, 2962, 2499, 21941, 23180, 4817, 11341, 117058, 15...	[ 0.056640625, 0.05841064453125, 0.0148468017578125, 0.0740966796875, 0.120849609375, 0.1231689453125, 0.1234130859375, 0.16748046875, 0.1783447265625, 0.138916015625, 0.1390380859375, 0.1566162109375, 0.041656494140625, 0.10626220703125, 0.1707763671875, 0.15087890625, 0.112548828125,...	embed
17114899_c0	17114899	haskell	0	Title: Inconsistent Eq and Ord instances? Problem title: Inconsistent Eq and Ord instances? Tags: haskell, typeclass Problem: Inconsistent Eq and Ord instances? I have a large Haskell program which is running dismayingly slow. Profiling and testing has revealed that a large fraction of the time is spend comparing equal...	Inconsistent Eq and Ord instances? Inconsistent Eq and Ord instances? haskell typeclass Inconsistent Ord BigThing Inconsistent Eq and Ord instances? I have a large Haskell program which is running dismayingly slow. Profiling and testing has revealed that a large fraction of the time is spend comparing equality and orde...	[ 0.0135498046875, -0.005218505859375, 0.01202392578125, 0.005615234375, 0.00067138671875, 0.0162353515625, -0.00531005859375, -0.02978515625, 0.0172119140625, 0.018310546875, 0.0107421875, 0.01141357421875, 0.0228271484375, -0.0052490234375, -0.0086669921875, -0.0074462890625, -0.0046...	[ 360, 25553, 6892, 241, 864, 136, 35379, 110527, 18, 1556, 142508, 10644, 67413, 14195, 20800, 214, 21334, 20625, 1528, 51042, 11354, 72803, 58848, 134234, 122273, 175921, 1733, 47445, 37397, 28, 161789, 12989, 2053, 50986, 4552, 5526, 83, 802...	[ 0.08575439453125, 0.172607421875, 0.2181396484375, 0.097900390625, 0.214111328125, 0.140869140625, 0.247314453125, 0.25537109375, 0.0220489501953125, 0.121337890625, 0.2135009765625, 0.107177734375, 0.141845703125, 0.1260986328125, 0.2191162109375, 0.1015625, 0.03466796875, 0.11474...	embed
25889388_c0	25889388	haskell	0	Title: How can I easily express that I don't care about a value of a particular data field? Problem title: How can I easily express that I don't care about a value of a particular data field? Tags: hspec, haskell Problem: How can I easily express that I don't care about a value of a particular data field? I w...	How can I easily express that I don't care about a value of a particular data field? How can I easily express that I don't care about a value of a particular data field? hspec haskell How Block Assignment LVar Number t.x LFieldRef StringLiteral How can I easily express that I don't care about a value of a par...	[ -0.0038909912109375, -0.001129150390625, -0.00005245208740234375, -0.0028839111328125, -0.002227783203125, 0.00092315673828125, 0.0299072265625, -0.015869140625, 0.01220703125, 0.025390625, 0.0125732421875, 0.00579833984375, 0.0032501220703125, -0.005645751953125, -0.005950927734375, 0...	[ 11249, 831, 72546, 36510, 450, 87, 2301, 3768, 18, 517, 1672, 34292, 17311, 2053, 44457, 111, 1096, 16711, 1556, 142508, 80231, 1301, 31304, 147, 103332, 425, 6159, 19388, 190015, 23351, 720, 32562, 109921, 366, 2189, 55300, 13648, 2965, 20...	[ 0.041290283203125, 0.027496337890625, 0.1783447265625, 0.19287109375, 0.05535888671875, 0.0859375, 0.108642578125, 0.029571533203125, 0.1519775390625, 0.2197265625, 0.111328125, 0.217041015625, 0.118408203125, 0.1263427734375, 0.214599609375, 0.045745849609375, 0.03363037109375, 0....	embed
37852078_c1	37852078	haskell	1	Names pid name I think I am doing something wrong when I call getPlaceNames and return the names. I am not even sure if I should use the 'do' statement in getPlaceNames. Error says Couldn't match expected type ‘[[Char]]’ with actual type ‘IO [String]’ In a stmt of a 'do' block: c <- runX $ doc >>> css "alternateNames" ...	Names pid name I think I am doing something wrong when I call getPlaceNames and return the names. I am not even sure if I should use the 'do' statement in getPlaceNames. Error says Couldn't match expected type ‘[[Char]]’ with actual type ‘IO [String]’ In a stmt of a 'do' block: c <- runX $ doc >>> css "alternateNames" ...	[ -0.00008344650268554688, 0.003509521484375, -0.000629425048828125, -0.0037689208984375, 0.00133514404296875, -0.000492095947265625, 0.0235595703125, -0.0245361328125, 0.0011444091796875, -0.0164794921875, 0.00099945068359375, -0.01373291015625, -0.01312255859375, -0.01409912109375, 0.003...	[ 15757, 7, 45226, 9351, 5351, 444, 20594, 9844, 44691, 11782, 2046, 683, 143, 329, 163612, 30646, 70, 123055, 9077, 4527, 246, 63805, 212059, 191147, 18, 14858, 84751, 10644, 84068, 8561, 17780, 71713, 214, 6138, 46389, 501, 11675, 1542, 365...	[ 0.1827392578125, 0.121337890625, 0.2354736328125, 0.1368408203125, 0.0908203125, 0.001617431640625, 0.0679931640625, 0.0280914306640625, 0.1678466796875, 0.09375, 0.151611328125, 0.0440673828125, 0.176513671875, 0.110107421875, 0.2452392578125, 0.166015625, 0.0148468017578125, 0.17...	embed
75600985_c0	75600985	haskell	0	Title: How can I use ghcid allow-eval with cabal Problem title: How can I use ghcid allow-eval with cabal Tags: cabal, ghcid, haskell-stack, haskell Problem: How can I use ghcid allow-eval with cabal I have a Stack based project and with the following: ghcid --command 'stack ghci' --allow-eval --clear --no-height-limit...	How can I use ghcid allow-eval with cabal How can I use ghcid allow-eval with cabal cabal ghcid haskell-stack haskell How ghcid.log unit_simple_single Variable SuiteRuntimeTest How can I use ghcid allow-eval with cabal I have a Stack based project and with the following: ghcid --command 'stack ghci' --allow-eval --clea...	[ 0.003936767578125, -0.00244140625, 0.00701904296875, 0.0081787109375, -0.004119873046875, -0.006683349609375, 0.0201416015625, 0.0211181640625, 0.007476806640625, -0.0262451171875, 0.005859375, -0.0179443359375, -0.01708984375, -0.0032196044921875, -0.004913330078125, -0.0145263671875,...	[ 11249, 831, 4527, 31380, 55964, 63769, 13, 1405, 678, 109524, 1556, 142508, 590, 2594, 4867, 25072, 191560, 6953, 84572, 2886, 74899, 163321, 6032, 111337, 6512, 35509, 13452, 12018, 318, 41566, 119488, 1106, 22553, 93343, 31, 71924, 159258, ...	[ 0.036346435546875, 0.0273590087890625, 0.1268310546875, 0.1402587890625, 0.244384765625, 0.23828125, 0.0980224609375, 0.2425537109375, 0.0997314453125, 0.25634765625, 0.082763671875, 0.188232421875, 0.0743408203125, 0.1243896484375, 0.1624755859375, 0.129150390625, 0.0924072265625, ...	embed
33107871_c0	33107871	haskell	0	Title: Implementing game states using reactive-banana Problem title: Implementing game states using reactive-banana Tags: haskell, reactive-banana, reactive-programming Problem: Implementing game states using reactive-banana In my breakout implementation there are two main behaviors that describe the game's main state:...	Implementing game states using reactive-banana Implementing game states using reactive-banana haskell reactive-banana reactive-programming reactive-banana Implementing Behavior Point Event Implementing game states using reactive-banana In my breakout implementation there are two main behaviors that describe the game's ...	[ 0.003631591796875, 0.004486083984375, 0.00177001953125, 0.0068359375, -0.0155029296875, 0.007568359375, -0.00604248046875, 0.00994873046875, 0.004669189453125, -0.021240234375, 0.013671875, -0.0218505859375, -0.0069580078125, 0.024658203125, -0.01611328125, 0.000059604644775390625, 0...	[ 153941, 6712, 117249, 17368, 456, 71232, 105281, 11, 1556, 142508, 28966, 98409, 41097, 36943, 36356, 6056, 208124, 6626, 5201, 123166, 98363, 11341, 149766, 29479, 1053, 2594, 192134, 1984, 808, 81604, 114419, 156673, 46312, 47353, 16446, 19069,...	[ 0.188720703125, 0.1527099609375, 0.1884765625, 0.0771484375, 0.111572265625, 0.22119140625, 0.1824951171875, 0.1689453125, 0.08935546875, 0.19677734375, 0.09368896484375, 0.131591796875, 0.09637451171875, 0.170166015625, 0.12353515625, 0.1649169921875, 0.1737060546875, 0.0797729492...	embed
28399634_c0	28399634	haskell	0	Title: Haskell Eclipse Linux and Buildwrapper Problem title: Haskell Eclipse Linux and Buildwrapper Tags: eclipse, haskell, linux Problem: Haskell Eclipse Linux and Buildwrapper I am kind of new Eclipse user, and Haskell too. I keep trying to understand what is wrong and what to do, as my Eclipse after I installed Hask...	Haskell Eclipse Linux and Buildwrapper Haskell Eclipse Linux and Buildwrapper eclipse haskell linux Haskell Eclipse Linux Buildwrapper Configuring Test1-0.1 Left dynamic-cabal.23 Cabal-1.22.0.0 setup_config Resolving Haskell Eclipse Linux and Buildwrapper I am kind of new Eclipse user, and Haskell too. I keep trying to...	[ 0.00086212158203125, 0.0191650390625, -0.0032196044921875, 0.00994873046875, -0.00101470947265625, -0.01116943359375, -0.0216064453125, -0.00555419921875, -0.0040283203125, 0.0145263671875, -0.0098876953125, -0.0194091796875, 0.000537872314453125, 0.027587890625, 0.01019287109375, -0.0...	[ 20625, 142508, 234962, 29908, 136, 121137, 5429, 11, 8079, 106371, 184, 1556, 11508, 59994, 8647, 20268, 102014, 636, 2480, 84079, 408, 3571, 3742, 30438, 289, 5759, 4015, 99929, 169581, 153837, 132944, 3525, 38937, 31577, 28219, 44691, 7103, ...	[ 0.1590576171875, 0.256591796875, 0.233642578125, 0.1728515625, 0.04681396484375, 0.1693115234375, 0.148193359375, 0.1468505859375, 0.1434326171875, 0.1444091796875, 0.012908935546875, 0.0941162109375, 0.054901123046875, 0.1453857421875, 0.159423828125, 0.013824462890625, 0.1069946289...	embed
41456869_c0	41456869	haskell	0	Title: How to make lenses for records with type-families Problem title: How to make lenses for records with type-families Tags: lenses, type-families, haskell-lens, haskell Problem: How to make lenses for records with type-families Here's what I've got, which is not compiling: {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE...	How to make lenses for records with type-families How to make lenses for records with type-families lenses type-families haskell-lens haskell Data.Text Data.Int Control.Lens How LANGUAGE TypeFamilies StandaloneDeriving FlexibleInstances TemplateHaskell MultiParamTypeClasses FunctionalDependencies Int64 Incoming Validat...	[ -0.005157470703125, -0.020263671875, -0.0050048828125, -0.00084686279296875, -0.000499725341796875, 0.012939453125, -0.0233154296875, -0.0106201171875, 0.00640869140625, -0.024658203125, 0.007080078125, -0.004730224609375, 0.0235595703125, 0.00127410888671875, -0.00119781494140625, -0....	[ 11249, 3249, 96, 47754, 100, 115923, 678, 10644, 69128, 47, 1556, 142508, 1977, 11809, 174379, 27131, 866, 1755, 98064, 60457, 919, 1191, 51684, 180842, 2661, 116071, 196631, 6495, 7, 19335, 55292, 196707, 140803, 26885, 13307, 277, 25447, 18...	[ 0.01806640625, 0.1229248046875, 0.1688232421875, 0.2142333984375, 0.07183837890625, 0.1961669921875, 0.1099853515625, 0.2088623046875, 0.1622314453125, 0.007232666015625, 0.109619140625, 0.192626953125, 0.1727294921875, 0.020660400390625, 0.106201171875, 0.1160888671875, 0.0981445312...	embed
5949871_c1	5949871	haskell	1	GC time 2.34s ( 2.61s elapsed) EXIT time 0.00s ( 0.00s elapsed) Total time 3.16s ( 3.45s elapsed) %GC time 74.1% (75.7% elapsed) Alloc rate 2,522,515,156 bytes per MUT second Generation 0: 338539 collections, 0 parallel, 1.24s, 1.31s elapsed Generation 1: 2 collections, 0 parallel, 0.00s, 0.00s elapsed INIT time 0.00s...	GC time 2.34s ( 2.61s elapsed) EXIT time 0.00s ( 0.00s elapsed) Total time 3.16s ( 3.45s elapsed) %GC time 74.1% (75.7% elapsed) Alloc rate 2,522,515,156 bytes per MUT second Generation 0: 338539 collections, 0 parallel, 1.24s, 1.31s elapsed Generation 1: 2 collections, 0 parallel, 0.00s, 0.00s elapsed INIT time 0.00s...	[ -0.02978515625, 0.0126953125, -0.000736236572265625, -0.0185546875, 0.005859375, -0.005706787109375, -0.02880859375, -0.0308837890625, -0.00040435791015625, -0.0242919921875, 0.01361083984375, 0.024169921875, 0.009521484375, 0.00335693359375, 0.00506591796875, -0.0145263671875, 0.002...	[ 69657, 1733, 787, 10289, 7, 11540, 127966, 29426, 6371, 37509, 71, 16, 33867, 1031, 2485, 4633, 15124, 13961, 15, 6873, 14427, 3164, 6652, 34515, 16290, 1837, 155740, 390, 1636, 276, 17632, 17932, 83479, 757, 6, 128222, 188758, 42486, 4, ...	[ 0.256103515625, 0.2357177734375, 0.0574951171875, 0.221435546875, 0.028472900390625, 0.1341552734375, 0.159423828125, 0.16015625, 0.1630859375, 0.1339111328125, 0.005615234375, 0.005401611328125, 0.1181640625, 0.0260009765625, 0.13427734375, 0.07708740234375, 0.06842041015625, 0.07...	embed
13479126_c0	13479126	haskell	0	Title: How do I stop Gloss requiring an increasing amount of memory? Problem title: How do I stop Gloss requiring an increasing amount of memory? Tags: graphics, haskell Problem: How do I stop Gloss requiring an increasing amount of memory? I'm using gloss to create am RTS game in Haskell, but I've noticed that even a ...	How do I stop Gloss requiring an increasing amount of memory? How do I stop Gloss requiring an increasing amount of memory? graphics haskell Graphics.Gloss Graphics.Gloss.Interface.IO.Game How Gloss Main InWindow How do I stop Gloss requiring an increasing amount of memory? I'm using gloss to create am RTS game in Hask...	[ -0.0206298828125, 0.0081787109375, 0.003692626953125, 0.00787353515625, 0.01483154296875, 0.000522613525390625, -0.0002269744873046875, 0.000518798828125, 0.0012359619140625, -0.0272216796875, 0.03173828125, -0.0111083984375, -0.00457763671875, 0.0021514892578125, 0.01483154296875, 0.0...	[ 11249, 54, 7279, 46173, 7, 186607, 118055, 41170, 98323, 87, 449, 48461, 1556, 142508, 189682, 724, 2400, 17780, 107576, 12321, 360, 92049, 24293, 17368, 207244, 47, 28282, 444, 27389, 294, 6712, 20625, 4552, 8781, 1528, 1221, 143414, 1286, ...	[ 0.0660400390625, 0.03350830078125, 0.22119140625, 0.25390625, 0.230224609375, 0.1529541015625, 0.1666259765625, 0.042724609375, 0.2205810546875, 0.00244140625, 0.0076904296875, 0.1417236328125, 0.11962890625, 0.231201171875, 0.1654052734375, 0.0295257568359375, 0.2086181640625, 0.0...	embed
34772844_c0	34772844	haskell	0	Title: How to handle IO return values properly in Haskell Problem title: How to handle IO return values properly in Haskell Tags: io, functional-programming, haskell Problem: How to handle IO return values properly in Haskell Hi i have a very noob question, lets say i want to create a game when you have to answer quest...	How to handle IO return values properly in Haskell How to handle IO return values properly in Haskell io functional-programming haskell How Haskell Question answer::String text::String Player name::String points::String Bool How to handle IO return values properly in Haskell Hi i have a very noob question, lets say i w...	[ -0.015380859375, 0.0023956298828125, 0.0115966796875, 0.003936767578125, 0.0020294189453125, 0.016845703125, -0.01397705078125, -0.022216796875, -0.01300048828125, -0.010009765625, 0.0218505859375, -0.0224609375, 0.00091552734375, 0.00445556640625, -0.0126953125, -0.003326416015625, ...	[ 11249, 47, 34831, 17780, 30646, 142424, 155965, 23, 20625, 142508, 22995, 123309, 28966, 1556, 68185, 35166, 71713, 214, 7986, 60560, 9351, 26847, 2460, 929, 4552, 110, 3522, 9655, 3444, 28282, 6712, 765, 17582, 54397, 903, 5036, 58585, 7251,...	[ 0.0911865234375, 0.037384033203125, 0.1834716796875, 0.2352294921875, 0.26416015625, 0.175048828125, 0.184326171875, 0.03131103515625, 0.1461181640625, 0.25146484375, 0.224609375, 0.1558837890625, 0.0980224609375, 0.129638671875, 0.1307373046875, 0.143798828125, 0.12890625, 0.08996...	embed
66825800_c1	66825800	haskell	1	5.5.1, containers-0.5.5.0, containers-0.5.4.0, containers-0.5.3.1, containers-0.5.3.0, containers-0.5.2.1, containers-0.5.2.0, containers-0.5.1.0, containers-0.5.0.0, containers-0.4.2.1, containers-0.4.2.0, containers-0.4.1.0, containers-0.4.0.0, containers-0.3.0.0, containers-0.2.0.1, containers-0.2.0.0, containers-0....	5.5.1, containers-0.5.5.0, containers-0.5.4.0, containers-0.5.3.1, containers-0.5.3.0, containers-0.5.2.1, containers-0.5.2.0, containers-0.5.1.0, containers-0.5.0.0, containers-0.4.2.1, containers-0.4.2.0, containers-0.4.1.0, containers-0.4.0.0, containers-0.3.0.0, containers-0.2.0.1, containers-0.2.0.0, containers-0....	[ -0.005615234375, 0.018798828125, 0.01043701171875, -0.007537841796875, -0.004669189453125, -0.01104736328125, -0.034912109375, -0.0123291015625, 0.00994873046875, 0.025390625, -0.0203857421875, -0.0284423828125, -0.0029754638671875, 0.0113525390625, 0.026611328125, 0.002227783203125, ...	[ 1892, 156627, 116419, 7, 93645, 187461, 151152, 97109, 132265, 68107, 73011, 102107, 99929, 121254, 170179, 102014, 38331, 206730, 2816, 1295, 38937, 30388, 144570, 6, 69112, 122887, 120518, 35782, 12620, 461, 44287, 79612, 5423, 2394, 6635, 16, ...	[ 0.0911865234375, 0.209716796875, 0.277099609375, 0.121337890625, 0.15185546875, 0.173095703125, 0.144775390625, 0.090576171875, 0.08544921875, 0.1168212890625, 0.07196044921875, 0.056610107421875, 0.0994873046875, 0.0474853515625, 0.006317138671875, 0.0269775390625, 0.0914306640625, ...	embed
50716754_c1	50716754	haskell	1	od :: MonadHandler m => m (HandlerSite m) It seems from these definitions that there should be a way for me to call getYesod from the AuthHandler monad but I can't figure out how. EDIT: I have updated yesod and its scaffolding to the latest version. I also modified validatePassword as follow: validatePassword u = do ap...	od :: MonadHandler m => m (HandlerSite m) It seems from these definitions that there should be a way for me to call getYesod from the AuthHandler monad but I can't figure out how. EDIT: I have updated yesod and its scaffolding to the latest version. I also modified validatePassword as follow: validatePassword u = do ap...	[ -0.03271484375, 0.0203857421875, 0.0028076171875, -0.00457763671875, -0.017822265625, -0.0010223388671875, -0.0108642578125, -0.0419921875, 0.00445556640625, -0.045166015625, 0.0079345703125, -0.000576019287109375, -0.00188446044921875, -0.003936767578125, -0.00970458984375, -0.0162353...	[ 229, 60331, 71, 135679, 603, 347, 44357, 294, 1486, 37202, 80934, 5608, 3917, 11782, 2046, 91480, 2199, 1295, 5655, 927, 2667, 712, 831, 26366, 3642, 150011, 2422, 23722, 2407, 42822, 11389, 73197, 44622, 67, 139117, 47416, 75, 54, 4027, ...	[ 0.1573486328125, 0.1966552734375, 0.15283203125, 0.24169921875, 0.215087890625, 0.142822265625, 0.08184814453125, 0.0809326171875, 0.1400146484375, 0.02197265625, 0.0887451171875, 0.022979736328125, 0.0782470703125, 0.140625, 0.1578369140625, 0.2183837890625, 0.299560546875, 0.0978...	embed
67298544_c0	67298544	haskell	0	Title: Haskell Converting or Dealing with Multiple Custom Data Types Problem title: Haskell Converting or Dealing with Multiple Custom Data Types Tags: haskell, ghci, types Problem: Haskell Converting or Dealing with Multiple Custom Data Types I am new to Haskell and am attempting to filter specific Custom Data types. ...	Haskell Converting or Dealing with Multiple Custom Data Types Haskell Converting or Dealing with Multiple Custom Data Types haskell ghci types Haskell Converting Dealing Multiple Custom Data Types Suit Hearts Rank Numeric Jack Card NormalCard Joker Bool Couldn Haskell Converting or Dealing with Multiple Custom Data Typ...	[ 0.00885009765625, 0.0020904541015625, -0.02099609375, 0.0026702880859375, -0.005157470703125, -0.004425048828125, -0.00958251953125, -0.006256103515625, 0.021240234375, 0.00860595703125, 0.0115966796875, -0.018310546875, 0.0031280517578125, 0.0004520416259765625, -0.0322265625, 0.00665...	[ 20625, 142508, 1657, 814, 90943, 678, 19335, 8705, 130664, 11809, 60457, 1556, 31380, 318, 52895, 1832, 60861, 134405, 93511, 21763, 23660, 28723, 156119, 145200, 2460, 929, 191147, 3525, 46312, 29458, 27958, 12877, 147756, 97595, 1507, 55681, ...	[ 0.1458740234375, 0.23779296875, 0.03302001953125, 0.1326904296875, 0.1185302734375, 0.0450439453125, 0.1053466796875, 0.0111083984375, 0.2291259765625, 0.1513671875, 0.19775390625, 0.1304931640625, 0.041595458984375, 0.08953857421875, 0.1763916015625, 0.131591796875, 0.15625, 0.195...	embed

44077968_c0

44077968

haskell

0

Title: cabal - local dependency missing Problem title: cabal - local dependency missing Tags: haskell, cabal Problem: cabal - local dependency missing I am learning cabal. Fighting with a "dependencies are missing" error. I have 2 cabal packages : "base-ext-fana", "xml-fana". Both are sandboxed. base-ext-fana builds cl...

cabal - local dependency missing cabal - local dependency missing haskell cabal cabal - local dependency missing I am learning cabal. Fighting with a "dependencies are missing" error. I have 2 cabal packages : "base-ext-fana", "xml-fana". Both are sandboxed. base-ext-fana builds cleanly. xml-fana should depend on it. S...

[ 0.01336669921875, -0.000423431396484375, 0.0074462890625, 0.00262451171875, 0.002777099609375, 0.000728607177734375, -0.0240478515625, 0.003021240234375, -0.0003986358642578125, -0.0223388671875, 0.01513671875, -0.0291748046875, 0.0078125, 0.025146484375, 0.025634765625, -0.01165771484...

[ 109524, 4000, 42548, 27771, 132283, 1556, 142508, 52080, 106313, 105254, 13, 117538, 621, 18499, 116, 98169, 37382, 3355, 18, 37951, 131492, 19096, 11728, 3647, 45367, 46622, 56566, 15190, 60427, 5303, 408, 3571, 177149, 50605, 98, 222495, 9261...

[ 0.27099609375, 0.19677734375, 0.2421875, 0.13671875, 0.23291015625, 0.1202392578125, 0.21826171875, 0.10498046875, 0.0938720703125, 0.2225341796875, 0.1627197265625, 0.188232421875, 0.091064453125, 0.1982421875, 0.05810546875, 0.20947265625, 0.1817626953125, 0.1500244140625, 0.14...

embed

22603858_c1

22603858

haskell

1

abs x) signum (NodeId x) = NodeId (signum x) instance Enum NodeId where toEnum = NodeId . toEnum fromEnum (NodeId x) = fromEnum x ... newtype InstructionId = InstructionId Natural deriving (Show, Eq) instance Num InstructionId where fromInteger = InstructionId . toNatural (InstructionId x) + (InstructionId y) = Instruc...

[ -0.0101318359375, -0.024658203125, 0.008056640625, 0.0177001953125, 0.00885009765625, 0.023681640625, 0.0103759765625, 0.0023651123046875, 0.00836181640625, -0.00836181640625, -0.023193359375, -0.019287109375, -0.006744384765625, -0.003326416015625, -0.005401611328125, -0.01611328125, ...

[ 43719, 1022, 16, 1144, 2606, 15, 5021, 112, 568, 71, 2203, 438, 31304, 316, 110527, 357, 7440, 47, 647, 1295, 153, 3525, 50986, 72022, 10763, 24955, 16406, 6496, 168660, 864, 52782, 67, 149989, 36716, 997, 113, 2055, 7, 9876, 8335, 2886...

[ 0.2398681640625, 0.1844482421875, 0.02215576171875, 0.1800537109375, 0.268798828125, 0.01019287109375, 0.16748046875, 0.1571044921875, 0.151611328125, 0.131591796875, 0.1104736328125, 0.1339111328125, 0.122802734375, 0.2105712890625, 0.201171875, 0.1282958984375, 0.024505615234375, ...

embed

41816726_c0

41816726

haskell

0

Title: How to parse JSON of multi-type array using Aeson into a custom Haskell type? Problem title: How to parse JSON of multi-type array using Aeson into a custom Haskell type? Tags: haskell, aeson Problem: How to parse JSON of multi-type array using Aeson into a custom Haskell type? this is my first post on Stack Ove...

How to parse JSON of multi-type array using Aeson into a custom Haskell type? How to parse JSON of multi-type array using Aeson into a custom Haskell type? haskell aeson Aeson Data.Aeson Network.HTTP.Conduit How JSON Haskell TeamID LeagueID Season SeasonType Regular DateFrom DateTo TeamGameLog Team_ID Game_ID GAME_DATE...

[ -0.0101318359375, 0.0208740234375, -0.0157470703125, 0.0137939453125, -0.01556396484375, -0.0220947265625, -0.02099609375, -0.00238037109375, 0.00811767578125, 0.0179443359375, 0.0123291015625, 0.006134033203125, 0.005615234375, -0.017822265625, -0.0213623046875, 0.00830078125, 0.001...

[ 11249, 366, 184, 821, 58627, 6024, 50986, 10298, 53, 62, 90, 191, 3934, 114122, 20625, 142508, 10644, 17368, 1556, 10, 11809, 284, 28997, 112061, 11399, 7146, 19175, 85135, 196707, 47881, 113972, 13547, 69048, 56948, 123254, 10111, 95976, 241...

[ 0.022003173828125, 0.1524658203125, 0.0706787109375, 0.140380859375, 0.214599609375, 0.1478271484375, 0.21923828125, 0.137939453125, 0.03802490234375, 0.080810546875, 0.0972900390625, 0.1497802734375, 0.046478271484375, 0.1519775390625, 0.1190185546875, 0.2083740234375, 0.16296386718...

embed

4589644_c0

4589644

haskell

0

Title: Haskell: What's my indent error Problem title: Haskell: What's my indent error Tags: haskell, indentation Problem: Haskell: What's my indent error I'm getting what I think is an indent error with the following code 152 -- find the first one who can refute the scenario 153 let cs = map ($scenario) [ Sus...

Haskell: What's my indent error Haskell: What's my indent error haskell indentation Haskell What Suspect Room Weapon refuter:ss Game.hs:159:6 Haskell: What's my indent error I'm getting what I think is an indent error with the following code The error I'm getting is When I delete or comment out lines 159-167,...

[ -0.01031494140625, -0.01214599609375, 0.0018463134765625, 0.0166015625, -0.01220703125, 0.0166015625, -0.0302734375, -0.017578125, 0.0054931640625, -0.0228271484375, 0.013427734375, -0.000492095947265625, -0.006622314453125, 0.0096435546875, 0.00787353515625, 0.00701904296875, -0.006...

[ 20625, 142508, 4865, 3768, 7, 759, 18597, 18, 18499, 1556, 1832, 16711, 38484, 1401, 11, 5416, 121956, 720, 13547, 127, 146086, 910, 5351, 678, 25632, 18151, 20949, 154109, 707, 6868, 1810, 124519, 76119, 165066, 60899, 16065, 44691 ]

[ 0.1297607421875, 0.235595703125, 0.0885009765625, 0.0909423828125, 0.065185546875, 0.1123046875, 0.214599609375, 0.1658935546875, 0.21875, 0.10565185546875, 0.065673828125, 0.1776123046875, 0.1317138671875, 0.039642333984375, 0.06048583984375, 0.08160400390625, 0.051177978515625, 0...

embed

19744794_c1

19744794

haskell

1

FormMessage postRegR :: Handler Html postRegR = do result <- runInputPost $ Registration <$> ireq textField "text" liftIO $ saveRegistration result defaultLayout [whamlet|<p>#{show result}|] saveRegistration :: Registration -> IO () saveRegistration r = withFile "registrations.txt" AppendMode (\h -> hPutStrLn h $ "+" +...

[ -0.00089263916015625, 0.01495361328125, -0.006744384765625, -0.0128173828125, -0.00156402587890625, 0.0220947265625, -0.009765625, -0.0029144287109375, 0.009521484375, -0.060791015625, 0.00093841552734375, 0.00848388671875, -0.0034332275390625, -0.0169677734375, -0.00122833251953125, 0...

[ 15236, 594, 6011, 1305, 54601, 1052, 10639, 603, 18, 7237, 54, 16750, 11675, 49411, 19685, 864, 7986, 19388, 22829, 60520, 17780, 30098, 1419, 114977, 53, 6056, 3915, 1974, 31374, 1690, 678, 174350, 52201, 5256, 124326, 5659, 3611, 9083, 27...

[ 0.20751953125, 0.052581787109375, 0.12744140625, 0.132568359375, 0.2276611328125, 0.1785888671875, 0.16259765625, 0.1708984375, 0.051116943359375, 0.1258544921875, 0.02691650390625, 0.1240234375, 0.05474853515625, 0.05718994140625, 0.197265625, 0.0867919921875, 0.05462646484375, 0....

embed

43567005_c1

43567005

haskell

1

o/haskell-playground/app/FactorAnamorphism.hs:22:19: error: • No instance for (Data.Functor.Classes.Show1 ExprF) arising from a use of ‘show’ • In the second argument of ‘($)’, namely ‘show $ factor 10’ In the expression: putStrLn $ show $ factor 10 In an equation for ‘main’: main = putStrLn $ show $ factor 10 -- While...

[ 0.00128173828125, -0.01361083984375, 0.0035400390625, 0.019775390625, 0.006500244140625, 0.0057373046875, -0.012939453125, -0.0107421875, -0.0123291015625, -0.003875732421875, -0.0181884765625, -0.0206298828125, 0.0147705078125, 0.0089111328125, -0.0034942626953125, -0.01470947265625, ...

[ 36, 10557, 142508, 20706, 64330, 9007, 135518, 1290, 73026, 178851, 8780, 127, 7, 24070, 23988, 18499, 438, 110527, 100, 137989, 97249, 18770, 140803, 168660, 418, 60075, 42, 919, 187, 72219, 4527, 31374, 17932, 10750, 4369, 3650, 31461, 209,...

[ 0.04833984375, 0.1192626953125, 0.281005859375, 0.0992431640625, 0.1802978515625, 0.0775146484375, 0.1715087890625, 0.0731201171875, 0.1044921875, 0.2330322265625, 0.13037109375, 0.10089111328125, 0.0290069580078125, 0.06695556640625, 0.1453857421875, 0.2078857421875, 0.11767578125, ...

embed

13449057_c0

13449057

haskell

0

Title: How to "vertically stack" Control.Frames? Problem title: How to "vertically stack" Control.Frames? Tags: conduit, haskell, haskell-pipes Problem: How to "vertically stack" Control.Frames? In the pipes package, the tutorial Control.Pipes.Tutorial [1] shows how to "vertically stack" pipe compon...

How to "vertically stack" Control.Frames? How to "vertically stack" Control.Frames? conduit haskell haskell-pipes How Control.Frames Control.Pipes.Tutorial source1 source2 bar8 How to "vertically stack" Control.Frames? In the pipes package, the tutorial Control.Pipes.Tutorial [1] shows how to "verti...

[ 0.032958984375, 0.02294921875, -0.00421142578125, 0.005889892578125, -0.0155029296875, -0.01239013671875, -0.010498046875, 0.00012111663818359375, -0.00057220458984375, -0.037109375, 0.006134033203125, -0.0174560546875, 0.022705078125, 0.000606536865234375, -0.006195068359375, 0.005371...

[ 11249, 47, 41502, 11549, 71407, 177261, 27131, 108386, 3716, 5, 120565, 1556, 142508, 1434, 13569, 29348, 15665, 77275, 31344, 304, 1909, 1019, 137158, 7, 98169, 57143, 45831, 3642, 82761, 17368, 70, 2667, 712, 6396, 39933, 2806, 1672, 20594,...

[ 0.09759521484375, 0.0540771484375, 0.00262451171875, 0.13525390625, 0.1536865234375, 0.275390625, 0.277099609375, 0.234375, 0.1729736328125, 0.019989013671875, 0.170654296875, 0.10052490234375, 0.21142578125, 0.138916015625, 0.1453857421875, 0.147705078125, 0.04241943359375, 0.0741...

embed

33865433_c0

33865433

haskell

0

Title: Weird buffering with prompt in haskell Problem title: Weird buffering with prompt in haskell Tags: haskell Problem: Weird buffering with prompt in haskell I was playing around in Haskell and noticed something weird. I've defined a simple prompt function below. -- file: test.hs main :: IO () main = putStrLn . ("H...

Weird buffering with prompt in haskell Weird buffering with prompt in haskell haskell Weird test.hs Hello Name Weird buffering with prompt in haskell I was playing around in Haskell and noticed something weird. I've defined a simple prompt function below. When I runhaskell this, it works as expected, printing the promp...

[ -0.00494384765625, -0.005157470703125, 0.004730224609375, 0.005279541015625, -0.015869140625, 0.0274658203125, 0.013671875, 0.0035247802734375, -0.0012969970703125, 0.01495361328125, -0.001373291015625, -0.02685546875, -0.0050048828125, -0.003753662109375, 0.0006103515625, -0.005706787...

[ 1401, 82249, 123759, 4209, 678, 105876, 1556, 142508, 23, 3034, 127, 35378, 15757, 75169, 20625, 156672, 179459, 61924, 8781, 32354, 35064, 11675, 10557, 903, 43240, 84751, 2448, 40485, 759, 107730, 28412, 3514, 1916, 14847, 9969, 1340, 8966, ...

[ 0.043426513671875, 0.15771484375, 0.213623046875, 0.147705078125, 0.0811767578125, 0.272705078125, 0.1387939453125, 0.252197265625, 0.002410888671875, 0.1630859375, 0.0880126953125, 0.1334228515625, 0.149169921875, 0.02996826171875, 0.126953125, 0.022430419921875, 0.179443359375, 0...

embed

38839217_c1

38839217

haskell

1

== -1 = let rl = (findLeftNode right) in (Node (findNode right) -- This is for the (Node r left rl ((treeHeight left) - (treeHeight rl))) -- "right right" case (findRightNode right) ((1 + (max (treeHeight left) (treeHeight rl))) - (treeHeight (findRightNode right))) ) | bf == -2 && rbf == 1 = let rl = findLeftNode rig...

[ -0.003021240234375, -0.01031494140625, 0.002960205078125, -0.00762939453125, 0.01483154296875, 0.0179443359375, -0.0262451171875, -0.0213623046875, 0.0034942626953125, 0.005218505859375, 0.00194549560546875, -0.034912109375, 0.01361083984375, -0.01361083984375, 0.0029449462890625, -0.0...

[ 69112, 68940, 2203, 2633, 54123, 111607, 5267, 2480, 5021, 112, 7108, 23, 4210, 3293, 83, 100, 1690, 25737, 62600, 13025, 22553, 20, 54969, 7225, 997, 24084, 58745, 150598, 122297, 619, 1230, 106, 7413, 29161, 116, 1181, 28864, 26073, 31678...

[ 0.2418212890625, 0.2451171875, 0.095947265625, 0.1217041015625, 0.1710205078125, 0.1585693359375, 0.07305908203125, 0.1673583984375, 0.2017822265625, 0.15380859375, 0.176513671875, 0.1181640625, 0.03680419921875, 0.0202178955078125, 0.00689697265625, 0.082275390625, 0.1214599609375, ...

embed

52898190_c0

52898190

haskell

0

Title: Purely functional (persistent) ring buffer Problem title: Purely functional (persistent) ring buffer Tags: purely-functional, haskell, clojure, data-structures, ocaml Problem: Purely functional (persistent) ring buffer I would like to implement a ring buffer using purely functional data structure with the follow...

Purely functional (persistent) ring buffer Purely functional (persistent) ring buffer purely-functional haskell clojure data-structures ocaml Purely Purely functional (persistent) ring buffer I would like to implement a ring buffer using purely functional data structure with the following operations Efficient random ac...

[ -0.0034027099609375, 0.041259765625, -0.0169677734375, -0.005828857421875, -0.02392578125, 0.01220703125, 0.0016632080078125, -0.00154876708984375, -0.01446533203125, -0.0205078125, -0.0042724609375, 0.005584716796875, -0.0067138671875, 0.0048828125, 0.00494384765625, 0.000602722167968...

[ 118233, 538, 123309, 21777, 6892, 18, 15789, 373, 18234, 34166, 137175, 1556, 142508, 20450, 461, 107, 2053, 137656, 36, 9779, 141, 1884, 29479, 17368, 45646, 25632, 41018, 24500, 96759, 17203, 390, 63262, 29117, 47, 12912, 181139, 1295, 4420...

[ 0.1358642578125, 0.06488037109375, 0.2364501953125, 0.055145263671875, 0.1236572265625, 0.04736328125, 0.183349609375, 0.1390380859375, 0.2330322265625, 0.141357421875, 0.124267578125, 0.06951904296875, 0.1964111328125, 0.077880859375, 0.112548828125, 0.0897216796875, 0.0957641601562...

embed

48251049_c1

48251049

haskell

1

Succ1 x) -- Defined at Nat2.hs:22:3 • In the equations for closed type family ‘Succ1’ In the type family declaration for ‘Succ1’ | 20 | Succ1 'One = 'Bit0 'One | ^^^^^^^^^^^^^^^^^^^^^^^ We think it's injective because, by inspection of Succ1 , One is never in its image, so the Bit0 (Succ1 x) case never returns Bit0 One...

[ -0.00179290771484375, -0.0098876953125, 0.0031890869140625, 0.013427734375, 0.0031890869140625, 0.005035400390625, -0.0103759765625, -0.0074462890625, 0.01165771484375, 0.00897216796875, 0.001861572265625, 0.008056640625, 0.01141357421875, 0.0123291015625, 0.0301513671875, -0.003967285...

[ 1832, 10060, 418, 1022, 262, 5983, 68875, 5442, 127, 24070, 363, 13722, 155738, 10644, 14449, 14168, 21635, 387, 62068, 2203, 571, 217, 2389, 5351, 115049, 5844, 134071, 6561, 8306, 6863, 29569, 27774, 7225, 30646, 79612, 10750, 959, 68034, ...

[ 0.19091796875, 0.258056640625, 0.12841796875, 0.1246337890625, 0.01373291015625, 0.149169921875, 0.0765380859375, 0.0142059326171875, 0.01007080078125, 0.009033203125, 0.0200042724609375, 0.1737060546875, 0.1630859375, 0.194580078125, 0.1573486328125, 0.1649169921875, 0.1434326171875...

embed

68031616_c1

68031616

haskell

1

ConsSet_ x xs where ConsSet x xs | not (elemS x xs) = ConsSet_ x xs elemS x NilSet_ = False elemS x (ConsSet_ y ys) | x == y = True -- infers (Eq a) for elemS | otherwise = elemS x ys GHC infers the constraint elemS :: Eq t => t -> NoCSet t -> Bool . But it doesn't infer a constraint for ConsSet that uses it. Rather, ...

[ -0.0023040771484375, 0.033447265625, 0.004150390625, -0.0167236328125, 0.0076904296875, -0.00811767578125, -0.0089111328125, -0.0250244140625, 0.005340576171875, 0.00897216796875, -0.0033721923828125, -0.0030059814453125, 0.00121307373046875, 0.007354736328125, 0.005126953125, 0.020141...

[ 39215, 294, 126, 454, 1022, 7, 7440, 959, 27889, 195, 77175, 22225, 11935, 113, 69112, 87599, 53498, 864, 88, 527, 73265, 158, 2816, 4288, 808, 438, 19283, 2460, 929, 4527, 75161, 80934, 110527, 100, 10, 187, 72219, 30022, 15190, 107, 3...

[ 0.207763671875, 0.19775390625, 0.2052001953125, 0.01678466796875, 0.09326171875, 0.041168212890625, 0.003692626953125, 0.1025390625, 0.1705322265625, 0.1639404296875, 0.1005859375, 0.041748046875, 0.06646728515625, 0.04150390625, 0.00177001953125, 0.0567626953125, 0.1695556640625, ...

embed

31397655_c0

31397655

haskell

0

Title: Saving a Pulse Audio stream with Haskell bindings Problem title: Saving a Pulse Audio stream with Haskell bindings Tags: audio, pulseaudio, haskell, io Problem: Saving a Pulse Audio stream with Haskell bindings Using the pulse-simple package I have made the following code: main=do s<-simpleNew Nothing "example" ...

Saving a Pulse Audio stream with Haskell bindings Saving a Pulse Audio stream with Haskell bindings audio pulseaudio haskell io Saving Pulse Audio Haskell Nothing Record SampleSpec F32 LittleEndian Float Play Saving a Pulse Audio stream with Haskell bindings Using the pulse-simple package I have made the following code...

[ -0.003265380859375, 0.01031494140625, -0.0079345703125, 0.030517578125, 0.0032501220703125, 0.005767822265625, 0.0030517578125, -0.0152587890625, 0.00457763671875, -0.0206298828125, 0.00127410888671875, -0.03369140625, 0.017578125, 0.0101318359375, -0.00121307373046875, -0.021850585937...

[ 947, 6496, 10, 21694, 184, 32134, 75973, 678, 20625, 142508, 128239, 18215, 55111, 5670, 1556, 22995, 182747, 54877, 33209, 47107, 563, 6460, 59784, 7768, 27201, 38699, 257, 11356, 13, 191560, 98169, 25632, 18151, 43240, 115923, 209, 94131, 1...

[ 0.1474609375, 0.09619140625, 0.0118408203125, 0.2135009765625, 0.192138671875, 0.22705078125, 0.2091064453125, 0.0938720703125, 0.156494140625, 0.263671875, 0.2210693359375, 0.222900390625, 0.209716796875, 0.176513671875, 0.1414794921875, 0.172607421875, 0.1600341796875, 0.13903808...

embed

32445309_c0

32445309

haskell

0

Title: Why does my parallel traversal Haskell program leak memory? Problem title: Why does my parallel traversal Haskell program leak memory? Tags: space-leak, memory-leaks, haskell Problem: Why does my parallel traversal Haskell program leak memory? Consider the following Haskell program (I'm doing this mostly for lea...

Why does my parallel traversal Haskell program leak memory? Why does my parallel traversal Haskell program leak memory? space-leak memory-leaks haskell qualified System.Environment Control.Concurrent Control.Monad Why Haskell Control.Concurrent.MSem Sem Traverse Foldable Sem.new forM_ Sem.with Why does my parallel trav...

[ -0.016845703125, 0.02490234375, -0.0206298828125, -0.0113525390625, 0.00689697265625, 0.0206298828125, -0.01055908203125, -0.00921630859375, 0.002716064453125, -0.05517578125, 0.0145263671875, 0.0164794921875, 0.002960205078125, 0.0157470703125, 0.00927734375, 0.016357421875, 0.01831...

[ 44084, 14602, 95103, 37317, 289, 20625, 142508, 1528, 95, 344, 98323, 759, 32628, 133, 24251, 1556, 217225, 12353, 27131, 163812, 712, 11935, 195, 10232, 4937, 37676, 30077, 2886, 54936, 100, 454, 76228, 25632, 153161, 52080, 60042, 3229, 87,...

[ 0.1229248046875, 0.02911376953125, 0.201416015625, 0.1661376953125, 0.07342529296875, 0.1275634765625, 0.2359619140625, 0.144775390625, 0.17333984375, 0.2041015625, 0.194580078125, 0.008819580078125, 0.1453857421875, 0.1715087890625, 0.12451171875, 0.103515625, 0.112060546875, 0.06...

embed

25661781_c0

25661781

haskell

0

Title: Caching internals with a partially applied function Problem title: Caching internals with a partially applied function Tags: caching, closures, haskell, partial-application Problem: Caching internals with a partially applied function Imagine such a function: bar :: Foo -> A -> B -> C -> IO () That function perfo...

Caching internals with a partially applied function Caching internals with a partially applied function caching closures haskell partial-application Caching Foo IORef Caching internals with a partially applied function Imagine such a function: That function performs some IO stuff using a Foo and other values. The Foo v...

[ 0.010009765625, 0.007415771484375, 0.0035400390625, -0.005340576171875, 0.002838134765625, 0.0128173828125, -0.0081787109375, -0.0021514892578125, 0.0125732421875, -0.0196533203125, -0.0040283203125, 0.01556396484375, -0.00732421875, 0.0234375, 0.01300048828125, -0.0189208984375, -0....

[ 2041, 59207, 70796, 678, 2878, 25958, 190659, 32354, 377, 170224, 1556, 142508, 289, 101687, 9572, 31, 123435, 4240, 133196, 51339, 17780, 41884, 17368, 142424, 34292, 115081, 1909, 97351, 1829, 62, 1193, 756, 111719, 34166, 43257, 1884, 139392...

[ 0.1551513671875, 0.1497802734375, 0.2017822265625, 0.0133056640625, 0.1534423828125, 0.0518798828125, 0.1763916015625, 0.1676025390625, 0.1510009765625, 0.210205078125, 0.07025146484375, 0.2113037109375, 0.0279083251953125, 0.131591796875, 0.180419921875, 0.140869140625, 0.1097412109...

embed

50288939_c1

50288939

haskell

1

name; return Type; }; const TAG = Symbol("TAG"); const List = Type("List"); // data constructors const Cons = x => tx => List("Cons") (cases => cases.Cons(x) (tx)); const Nil = List("Nil") (cases => cases.Nil); // overload binary functions const overload2 = (name, dispatch) => { const pairs = new Map(); return { [`${n...

[ -0.0022125244140625, 0.0098876953125, 0.0023040771484375, -0.0032196044921875, 0.005096435546875, -0.001678466796875, 0.005035400390625, -0.00994873046875, 0.010986328125, -0.007476806640625, 0.01141357421875, 0.0089111328125, 0.01806640625, -0.003662109375, 0.006988525390625, 0.013427...

[ 9351, 74, 30646, 60457, 158, 271, 125933, 2203, 131899, 188226, 32036, 154663, 4666, 2053, 64549, 25251, 39215, 1022, 808, 425, 11935, 7, 58437, 50218, 18, 77175, 839, 379, 645, 63033, 2394, 6635, 32354, 304, 11627, 58580, 257, 80836, 3525,...

[ 0.1680908203125, 0.0207672119140625, 0.1695556640625, 0.2135009765625, 0.13720703125, 0.1468505859375, 0.21728515625, 0.04156494140625, 0.184326171875, 0.1907958984375, 0.1856689453125, 0.1422119140625, 0.05230712890625, 0.1505126953125, 0.1943359375, 0.13818359375, 0.2420654296875, ...

embed

76668781_c0

76668781

haskell

0

Title: Haskell foldr function in instance Foldable Problem title: Haskell foldr function in instance Foldable Tags: fold, haskell Problem: Haskell foldr function in instance Foldable data Tree a = Empty | Tree a (Tree a) (Tree a) deriving (Show, Eq, Read) I have this data Tree in my programm and i need a foldr funtion ...

Haskell foldr function in instance Foldable Haskell foldr function in instance Foldable fold haskell Haskell Foldable Tree Empty Show Read Haskell foldr function in instance Foldable I have this data Tree in my programm and i need a foldr funtion in instance Foldable Tree where . The Function should go first through pi...

[ 0.006805419921875, -0.0086669921875, 0.00970458984375, -0.017333984375, -0.00445556640625, 0.03076171875, -0.0216064453125, -0.03076171875, -0.0198974609375, -0.01251220703125, -0.00139617919921875, -0.031494140625, -0.0004100799560546875, 0.007720947265625, 0.0012969970703125, -0.0052...

[ 20625, 142508, 18344, 7569, 32354, 110527, 30077, 71, 2886, 23, 42822, 1556, 101344, 31678, 939, 17367, 4764, 2053, 28966, 3871, 7477, 1363, 7440, 28670, 10763, 738, 5117, 8305, 80953, 18, 12830, 164917, 53201, 167785, 26366, 678, 7413, 70, ...

[ 0.10015869140625, 0.2303466796875, 0.150146484375, 0.22607421875, 0.160400390625, 0.21728515625, 0.126953125, 0.04644775390625, 0.1693115234375, 0.0213165283203125, 0.1746826171875, 0.07611083984375, 0.19287109375, 0.133056640625, 0.029266357421875, 0.099853515625, 0.1260986328125, ...

embed

67037663_c1

67037663

haskell

1

:: Todo -> String showList' (Todo s) = "[ ] " ++ s showList' (TodoList s ts) = "[ ] " ++ s ++ "<ul><li>" ++ intercalate "</li><li>" (map showList' ts) ++ "</li></ul>" which, fed like this putStrLn $ showList' $ TodoList "Main" [Todo "1.", TodoList "2." [Todo "2.1", Todo "2.2"], Todo "3."] generates this output [ ] Mai...

[ -0.0244140625, -0.0010833740234375, 0.00010204315185546875, 0.0233154296875, 0.0025634765625, 0.015625, -0.0023345947265625, -0.0224609375, 0.00848388671875, 0.0208740234375, -0.0020751953125, -0.0299072265625, -0.00070953369140625, 0.0213623046875, -0.01708984375, 0.002197265625, 0....

[ 1984, 26657, 23351, 214, 7639, 154663, 25, 7763, 246, 91, 37223, 61636, 1940, 62309, 67, 62346, 51158, 3884, 71713, 3650, 168793, 68107, 70147, 363, 139392, 140992, 12321, 34513, 41187, 1031, 85590, 19097, 2663, 9655, 79516, 11001, 13315, 347...

[ 0.0225677490234375, 0.256103515625, 0.16552734375, 0.07037353515625, 0.223876953125, 0.287353515625, 0.07037353515625, 0.125732421875, 0.208984375, 0.1138916015625, 0.0777587890625, 0.0665283203125, 0.00848388671875, 0.1158447265625, 0.03277587890625, 0.0662841796875, 0.1297607421875...

embed

12759481_c0

12759481

haskell

0

Title: Why is (a, a) not a functor? Problem title: Why is (a, a) not a functor? Tags: functor, haskell, type-systems, typeclass Problem: Why is (a, a) not a functor? Possible Duplicate: Making (a, a) a Functor I wrote the following implementation of quicksort: import Data.List (partition) quicksort [] = [] quicksort (x...

Why is (a, a) not a functor? Why is (a, a) not a functor? functor haskell type-systems typeclass Data.List Why x:xs Functor Kind Why is (a, a) not a functor? I wrote the following implementation of quicksort: Then I wanted to abbreviate the two recursive calls to quicksort by applying fmap to the list pair: But apparen...

[ -0.007080078125, 0.01214599609375, 0.0010528564453125, -0.00897216796875, 0.00118255615234375, 0.005126953125, -0.00872802734375, -0.031494140625, 0.015625, 0.0157470703125, -0.01251220703125, 0.0018463134765625, 0.00023651123046875, -0.0037384033203125, -0.010009765625, -0.01489257812...

[ 44084, 83, 11, 4, 10, 959, 7477, 18770, 1556, 142508, 10644, 16751, 67413, 11809, 154663, 1022, 12, 425, 7, 28670, 27435, 54397, 208124, 63773, 62351, 36663, 105160, 101426, 6626, 195625, 5844, 11782, 59911, 1238, 62346, 5303, 80836, 22691, ...

[ 0.123779296875, 0.09698486328125, 0.1292724609375, 0.12255859375, 0.16650390625, 0.189697265625, 0.1875, 0.19677734375, 0.0875244140625, 0.191650390625, 0.1556396484375, 0.0863037109375, 0.1102294921875, 0.03546142578125, 0.064208984375, 0.06268310546875, 0.01910400390625, 0.076354...

embed

16499136_c0

16499136

haskell

0

Title: How to tell what type the DynamicImage loaded by Codec.Picture is Problem title: How to tell what type the DynamicImage loaded by Codec.Picture is Tags: codec, types, haskell Problem: How to tell what type the DynamicImage loaded by Codec.Picture is I am trying to load a PNG using the JuicyPixels library and I a...

How to tell what type the DynamicImage loaded by Codec.Picture is How to tell what type the DynamicImage loaded by Codec.Picture is codec types haskell How DynamicImage Codec.Picture ImageY8 Image Pixel8 ImageYA8 PixelYA8 ImageRGB8 PixelRGB8 ImageRGBA8 PixelRGBA8 ImageYCbCr8 PixelYCbCr8 ImageRBA8 How to tell what type ...

[ 0.0224609375, -0.000782012939453125, 0.010498046875, 0.044677734375, -0.00011873245239257812, 0.01055908203125, -0.023193359375, 0.0103759765625, -0.00726318359375, -0.00023937225341796875, -0.00439453125, -0.024169921875, -0.005615234375, -0.0306396484375, -0.0037078857421875, 0.02648...

[ 11249, 14192, 2367, 10644, 73327, 21068, 216960, 72367, 28864, 238, 683, 1771, 6644, 83, 390, 18151, 52895, 1556, 142508, 22710, 1723, 1019, 111159, 14671, 8359, 48802, 8031, 8066, 3314, 2408, 29348, 52851, 35773, 26366, 1379, 538, 29569, 619...

[ 0.01373291015625, 0.1348876953125, 0.05157470703125, 0.1905517578125, 0.144775390625, 0.117431640625, 0.263916015625, 0.15673828125, 0.1507568359375, 0.09918212890625, 0.07080078125, 0.15966796875, 0.120849609375, 0.0745849609375, 0.010406494140625, 0.138671875, 0.1937255859375, 0....

embed

3750529_c0

3750529

haskell

0

Title: How much time have you invested in order to have a good grasp on Haskell? Problem title: How much time have you invested in order to have a good grasp on Haskell? Tags: haskell, functional-programming Problem: How much time have you invested in order to have a good grasp on Haskell? I know this question may soun...

How much time have you invested in order to have a good grasp on Haskell? How much time have you invested in order to have a good grasp on Haskell? haskell functional-programming How Haskell How much time have you invested in order to have a good grasp on Haskell? I know this question may sound silly, but I am learning...

[ 0.0022430419921875, 0.0164794921875, 0.015625, -0.0023345947265625, -0.0098876953125, 0.00457763671875, -0.02294921875, -0.0086669921875, 0.014892578125, -0.04248046875, 0.0079345703125, -0.034423828125, -0.0115966796875, 0.0098876953125, -0.027587890625, 0.0108642578125, 0.012817382...

[ 11249, 5045, 1733, 765, 398, 14145, 297, 12989, 4127, 27689, 254, 98, 20625, 142508, 1556, 123309, 28966, 47, 10, 12097, 52080, 19713, 31577, 100, 1672, 201, 13312, 122799, 12301, 147, 796, 7232, 7, 581, 17119, 50592, 78804, 27958, 96704, ...

[ 0.0684814453125, 0.1392822265625, 0.181884765625, 0.103759765625, 0.04266357421875, 0.184814453125, 0.072509765625, 0.057952880859375, 0.1044921875, 0.1611328125, 0.1220703125, 0.100830078125, 0.19384765625, 0.29833984375, 0.142578125, 0.15380859375, 0.061614990234375, 0.0791625976...

embed

52914495_c0

52914495

haskell

0

Title: How to instantiate Eq (or any class) for a type with different constructors Haskell Problem title: How to instantiate Eq (or any class) for a type with different constructors Haskell Tags: haskell Problem: How to instantiate Eq (or any class) for a type with different constructors Haskell I have a doubt about th...

How to instantiate Eq (or any class) for a type with different constructors Haskell How to instantiate Eq (or any class) for a type with different constructors Haskell haskell How Haskell Person Example Constructor1 Integer Constructor2 How to instantiate Eq (or any class) for a type with different constructors Haskell...

[ 0.0019378662109375, 0.01904296875, -0.0009002685546875, 0.0208740234375, 0.00201416015625, 0.00848388671875, -0.00762939453125, -0.00144195556640625, 0.002838134765625, -0.0000972747802734375, 0.00787353515625, -0.001129150390625, 0.0191650390625, 0.0235595703125, -0.02392578125, -0.00...

[ 11249, 47, 34648, 101426, 241, 864, 2499, 18507, 100, 10644, 678, 12921, 64549, 25251, 20625, 142508, 748, 1556, 15270, 89536, 8705, 82084, 18770, 418, 44401, 304, 765, 92814, 13580, 903, 3444, 831, 134598, 21771, 14, 27686, 69101, 3293, 39...

[ 0.081787109375, 0.06268310546875, 0.200439453125, 0.2098388671875, 0.1474609375, 0.253662109375, 0.05615234375, 0.173583984375, 0.065185546875, 0.201416015625, 0.1197509765625, 0.1959228515625, 0.162841796875, 0.10296630859375, 0.1243896484375, 0.177001953125, 0.01226806640625, 0.1...

embed

41791588_c0

41791588

haskell

0

Title: How does argument passing order affect lazy evaluation in Haskell? Problem title: How does argument passing order affect lazy evaluation in Haskell? Tags: recursion, haskell, lazy-evaluation Problem: How does argument passing order affect lazy evaluation in Haskell? I've been trying to understand lazy evaluation...

How does argument passing order affect lazy evaluation in Haskell? How does argument passing order affect lazy evaluation in Haskell? recursion haskell lazy-evaluation How Haskell fib2 Exception How does argument passing order affect lazy evaluation in Haskell? I've been trying to understand lazy evaluation in Haskell ...

[ 0.01416015625, 0.017822265625, -0.0034942626953125, -0.01385498046875, -0.006378173828125, 0.010986328125, 0.006134033203125, -0.011962890625, 0.00653076171875, -0.00009632110595703125, 0.027587890625, -0.0091552734375, -0.0004711151123046875, 0.004058837890625, 0.0283203125, 0.0006332...

[ 11249, 10750, 452, 6953, 12989, 52490, 21, 3285, 219836, 20625, 142508, 14602, 23, 195625, 1830, 1556, 159258, 809, 275, 304, 5443, 63928, 151575, 13, 3229, 765, 29479, 20990, 52544, 93766, 82249, 224833, 153941, 4488, 35839, 678, 12960, 6806...

[ 0.056427001953125, 0.2266845703125, 0.08013916015625, 0.0809326171875, 0.1917724609375, 0.1385498046875, 0.130126953125, 0.1962890625, 0.203125, 0.1182861328125, 0.259765625, 0.0158843994140625, 0.022705078125, 0.14404296875, 0.01922607421875, 0.103759765625, 0.16943359375, 0.08966...

embed

42248592_c1

42248592

haskell

1

s (322.4 μs .. 333.0 μs) 0.997 R² (0.996 R² .. 0.998 R²) mean 328.7 μs (324.1 μs .. 334.2 μs) std dev 16.95 μs (14.63 μs .. 22.02 μs) and forall : time 113.2 μs (111.2 μs .. 115.0 μs) 0.997 R² (0.996 R² .. 0.998 R²) mean 112.0 μs (110.0 μs .. 113.9 μs) std dev 6.333 μs (5.127 μs .. 7.896 μs) Performance measured using ...

[ -0.0059814453125, -0.0120849609375, 0.01068115234375, -0.0062255859375, -0.00116729736328125, 0.00238037109375, -0.002166748046875, -0.021484375, 0.01220703125, 0.00180816650390625, 0.0096435546875, -0.024169921875, 0.005096435546875, 0.010498046875, -0.0084228515625, -0.00466918945312...

[ 91, 6460, 116591, 15247, 1468, 3912, 132265, 7, 757, 183778, 627, 304, 185245, 158931, 10461, 29459, 2789, 210257, 120518, 117904, 6138, 71, 33245, 6849, 8821, 9550, 100, 5584, 1733, 534, 107033, 27252, 48400, 73011, 2289, 66000, 16, 94030, ...

[ 0.1536865234375, 0.1259765625, 0.1153564453125, 0.141845703125, 0.0287933349609375, 0.1044921875, 0.110107421875, 0.003936767578125, 0.02978515625, 0.1458740234375, 0.07293701171875, 0.216552734375, 0.086669921875, 0.0911865234375, 0.09332275390625, 0.1812744140625, 0.10205078125, ...

embed

29884768_c0

29884768

haskell

0

Title: Haskell: List append operation Problem title: Haskell: List append operation Tags: haskell, list Problem: Haskell: List append operation I'm looking at 99 problems solved in Haskell . I'm trying to understand few basics here. combinations :: Int -> [a] -> [[a]] combinations _ [] = [[]] combinations 0 _ = [[]] co...

Haskell: List append operation Haskell: List append operation haskell list a Haskell List x:xs x_start k-1 Num GHCi Haskell: List append operation I'm looking at 99 problems solved in Haskell . I'm trying to understand few basics here. consider, combinations 1 [3, 4] pattern matches with the combinations k (x:xs) . We ...

[ -0.0172119140625, 0.025146484375, 0.006011962890625, -0.0069580078125, 0.000545501708984375, 0.0184326171875, 0.002716064453125, 0.005340576171875, 0.01708984375, -0.000476837158203125, 0.0196533203125, -0.0252685546875, 0.017333984375, 0.00823974609375, -0.01171875, -0.002182006835937...

[ 20625, 142508, 32036, 114689, 71, 41018, 12, 1556, 5303, 1022, 425, 7, 454, 17137, 472, 5759, 52782, 527, 73265, 14, 16487, 10078, 44402, 86869, 28219, 10846, 62822, 16916, 162515, 106, 122101, 201, 103510, 14858, 678, 4034, 242122, 1221, 7...

[ 0.1334228515625, 0.2261962890625, 0.20361328125, 0.20263671875, 0.111083984375, 0.166259765625, 0.043212890625, 0.150634765625, 0.156494140625, 0.1405029296875, 0.0933837890625, 0.036712646484375, 0.06982421875, 0.20849609375, 0.1304931640625, 0.1431884765625, 0.1444091796875, 0.04...

embed

33181063_c1

33181063

haskell

1

:: (MonadPlus m) => Int -> SearchTree a -> (m a, [SearchTree a]) cutoff cu = go cu where plus ~(m0, l0) ~(m1, l1) = (mplus m0 m1, l0 ++ l1) zero = (mzero, []) go 0 x = (mzero, [x]) go _ Contradiction = zero go _ (Solution a) = (return a, []) go d (Search ps) = foldr plus zero $ map (go $ d-1) ps cutoffEval :: MonadPlu...

[ 0.0096435546875, 0.02294921875, 0.0086669921875, 0.011474609375, 0.01336669921875, -0.00445556640625, -0.0030059814453125, -0.030029296875, 0.03125, -0.03173828125, 0.003082275390625, -0.018798828125, 0.0062255859375, 0.020263671875, 0.0086669921875, -0.010009765625, 0.00628662109375...

[ 1984, 46674, 712, 88225, 347, 360, 18, 33086, 62731, 13, 10, 39, 221175, 59226, 16713, 314, 2203, 738, 1001, 2389, 77495, 32108, 37223, 45234, 80510, 757, 45380, 428, 102588, 65395, 24014, 7569, 22288, 519, 104, 110218, 1405, 60331, 71, 6...

[ 0.03759765625, 0.10467529296875, 0.0811767578125, 0.2490234375, 0.128173828125, 0.03924560546875, 0.04180908203125, 0.17578125, 0.2314453125, 0.0733642578125, 0.110595703125, 0.047454833984375, 0.1630859375, 0.162109375, 0.23876953125, 0.2249755859375, 0.035430908203125, 0.07897949...

embed

31687381_c2

31687381

haskell

2

.Vector, Data.Vector.Generic.Base.basicLength, vec_a320, V_Node, Could, Data.Vector.Generic.Base.basicUnsafeFreeze, Control.Monad.Primitive.PrimMonad, Data.Vector.Generic.Base.Mutable, Control.Monad.Primitive.PrimState, debox_error.hs, Control.Monad.liftM, mvec_a31Y, MV_Node, Data.Vector.Generic.Base.basicUnsafeThaw, D...

[ -0.023681640625, 0.02001953125, -0.007537841796875, 0.0152587890625, 0.0361328125, -0.00421142578125, -0.0179443359375, -0.0250244140625, 0.0177001953125, -0.006805419921875, -0.0086669921875, -0.01171875, 0.0032806396484375, 0.003814697265625, -0.023681640625, -0.00469970703125, 0.0...

[ 5, 26455, 18770, 4, 11809, 135932, 12259, 63473, 13, 402, 27744, 5267, 449, 927, 22834, 454, 11, 76531, 310, 5021, 112, 191147, 14256, 115840, 81437, 731, 27131, 46674, 712, 145111, 14, 4935, 10685, 22819, 135206, 8, 11728, 188800, 127, 7...

[ 0.171142578125, 0.265625, 0.303955078125, 0.0740966796875, 0.204833984375, 0.1854248046875, 0.150146484375, 0.1973876953125, 0.1497802734375, 0.1627197265625, 0.14013671875, 0.058685302734375, 0.155517578125, 0.04547119140625, 0.267578125, 0.044281005859375, 0.085205078125, 0.26171...

embed

3261844_c0

3261844

haskell

0

Title: Haskell - Use Just or no Just made difference, but I don't know why Problem title: Haskell - Use Just or no Just made difference, but I don't know why Tags: haskell, option-type, types Problem: Haskell - Use Just or no Just made difference, but I don't know why I've found such code in the book "Real Wo...

Haskell - Use Just or no Just made difference, but I don't know why Haskell - Use Just or no Just made difference, but I don't know why haskell option-type types Haskell Use Just Tree Node Empty Show Nothing Main Num Maybe Haskell - Use Just or no Just made difference, but I don't know why I've found such cod...

[ -0.01025390625, 0.01806640625, 0.0133056640625, -0.004302978515625, 0.01611328125, 0.01611328125, -0.0026702880859375, 0.00004673004150390625, 0.00183868408203125, -0.01007080078125, 0.00286865234375, -0.027587890625, 0.00885009765625, 0.002105712890625, 0.006378173828125, -0.015991210...

[ 20625, 142508, 36836, 9563, 707, 110, 7228, 60212, 3768, 3714, 15400, 1556, 35829, 50986, 52895, 101344, 438, 112, 31678, 939, 17367, 182747, 12321, 52782, 83425, 6044, 18151, 23, 12877, 68996, 6661, 16028, 4865, 12447, 2053, 64549, 748, 54, ...

[ 0.103271484375, 0.220458984375, 0.1253662109375, 0.224853515625, 0.07635498046875, 0.1474609375, 0.05389404296875, 0.197021484375, 0.0345458984375, 0.04498291015625, 0.05352783203125, 0.0858154296875, 0.1832275390625, 0.1295166015625, 0.1514892578125, 0.1668701171875, 0.098388671875,...

embed

26117165_c1

26117165

haskell

1

a sudden, my cabal test began to hang and fail with a timeout (I use wreq as client library to test REST services). It took me a couple of hours to pin down the actual error on the server side: tests: thread blocked indefinitely in an STM transaction . Suspecting the serialisation routine, it took me another couple of...

[ -0.010009765625, 0.01251220703125, 0.00396728515625, -0.0164794921875, 0.0177001953125, -0.0181884765625, 0.00136566162109375, 0.0027008056640625, 0.009765625, -0.03515625, 0.01544189453125, -0.002532958984375, -0.00022792816162109375, 0.0162353515625, -0.000301361083984375, 0.0078125,...

[ 109524, 3034, 10756, 35782, 1733, 6056, 107, 864, 23282, 35773, 21828, 11374, 21974, 8561, 18499, 10723, 5609, 109921, 86997, 46389, 297, 49919, 23, 10111, 124161, 16711, 35686, 15032, 124374, 30022, 167969, 102778, 14507, 28219, 56282, 38157, ...

[ 0.258544921875, 0.2137451171875, 0.188232421875, 0.154296875, 0.083740234375, 0.1317138671875, 0.16455078125, 0.108154296875, 0.06719970703125, 0.08538818359375, 0.1185302734375, 0.047119140625, 0.0305938720703125, 0.002288818359375, 0.165771484375, 0.07440185546875, 0.00662231445312...

embed

39058971_c1

39058971

haskell

1

a list of the files searched for. How can stack be loading these packages successfully, then be somehow unable to find them later? How can it have the nerve (jk) to ask me to put the dependencies in my .cabal file, when it has already obtained them from there to load them in the first place? Here is the dependency lis...

[ 0.006439208984375, -0.01409912109375, 0.004852294921875, 0.01226806640625, -0.00555419921875, 0.01214599609375, -0.006134033203125, -0.01416015625, 0.0135498046875, 0.00775146484375, -0.00069427490234375, -0.0284423828125, 0.0016326904296875, 0.0172119140625, -0.000339508056640625, 0.0...

[ 10, 5303, 102158, 33938, 297, 100, 11249, 831, 177261, 186, 72367, 214, 6097, 98169, 65771, 4, 209303, 51, 2886, 47, 7413, 2856, 14432, 765, 70, 24030, 13, 49622, 26458, 163, 3884, 42548, 117538, 5, 408, 3571, 11435, 442, 21771, 113054, ...

[ 0.004913330078125, 0.234619140625, 0.21142578125, 0.178466796875, 0.117431640625, 0.1148681640625, 0.052978515625, 0.051513671875, 0.288818359375, 0.0189056396484375, 0.1492919921875, 0.0311279296875, 0.059051513671875, 0.2244873046875, 0.142822265625, 0.000640869140625, 0.0620422363...

embed

26480543_c0

26480543

haskell

0

Title: How to serialize/deserialize objects sent over the network in Haskell? Problem title: How to serialize/deserialize objects sent over the network in Haskell? Tags: haskell, sockets, serialization Problem: How to serialize/deserialize objects sent over the network in Haskell? I see that there are many ways to seri...

How to serialize/deserialize objects sent over the network in Haskell? How to serialize/deserialize objects sent over the network in Haskell? haskell sockets serialization How Haskell How to serialize/deserialize objects sent over the network in Haskell? I see that there are many ways to serialize/deserialize Haskell o...

[ 0.017822265625, 0.01263427734375, -0.011474609375, 0.015869140625, -0.00848388671875, -0.01544189453125, -0.031005859375, 0.01446533203125, -0.00927734375, -0.00836181640625, 0.01495361328125, -0.037353515625, 0.03857421875, 0.002105712890625, 0, -0.0027618408203125, 0.0068359375, ...

[ 11249, 47, 35686, 20650, 64, 988, 25435, 119066, 36746, 9325, 645, 33120, 23, 20625, 142508, 1556, 221, 27853, 47691, 7, 5941, 48322, 11809, 5, 294, 33079, 22, 40899, 8, 32354, 73, 10557, 1478, 19155, 205956, 821, 58627, 335, 38415, 16958...

[ 0.09576416015625, 0.045745849609375, 0.2421875, 0.1300048828125, 0.0811767578125, 0.189453125, 0.2203369140625, 0.12060546875, 0.2237548828125, 0.1339111328125, 0.115966796875, 0.1297607421875, 0.0736083984375, 0.1695556640625, 0.251953125, 0.1199951171875, 0.0557861328125, 0.13989...

embed

27866848_c0

27866848

haskell

0

Title: having some trouble with user input and output in haskell Problem title: having some trouble with user input and output in haskell Tags: io, haskell Problem: having some trouble with user input and output in haskell Hi there I am just starting out with haskell and I have hit a block at a simple question involvin...

having some trouble with user input and output in haskell having some trouble with user input and output in haskell io haskell GHCI Main Sorry What having some trouble with user input and output in haskell Hi there I am just starting out with haskell and I have hit a block at a simple question involving input and outpu...

[ -0.0159912109375, 0.0074462890625, -0.005523681640625, 0.01019287109375, 0.00701904296875, 0.038818359375, 0.0019683837890625, 0.01458740234375, -0.0032958984375, 0.0062255859375, 0.004150390625, -0.01409912109375, -0.02001953125, 0.0172119140625, -0.00860595703125, -0.004425048828125,...

[ 19441, 3060, 63134, 678, 38937, 107730, 136, 140992, 23, 1556, 142508, 22995, 41877, 17304, 12321, 90502, 4865, 72134, 1810, 5962, 46389, 8781, 9655, 31577, 26458, 48909, 7, 37170, 2367, 16750, 2806, 154107, 101935, 4669, 8934, 25842, 2174, 3...

[ 0.0791015625, 0.10064697265625, 0.1734619140625, 0.06689453125, 0.1727294921875, 0.2183837890625, 0.1185302734375, 0.2257080078125, 0.05615234375, 0.15380859375, 0.23974609375, 0.1553955078125, 0.0894775390625, 0.1387939453125, 0.0164794921875, 0.1090087890625, 0.0272674560546875, ...

embed

61882345_c0

61882345

haskell

0

Title: How does this Haskell Pandoc filter work? Problem title: How does this Haskell Pandoc filter work? Tags: haskell, pandoc Problem: How does this Haskell Pandoc filter work? I want to use Pandoc to merge multiple Markdown files. While doing so, I want each file's frontmatter or metadata to generate custom Markdown...

How does this Haskell Pandoc filter work? How does this Haskell Pandoc filter work? haskell pandoc pandocfilters Header toJSONFilter How Haskell Pandoc __name__ __main__ How does this Haskell Pandoc filter work? I want to use Pandoc to merge multiple Markdown files. While doing so, I want each file's frontmatter or met...

[ 0.001434326171875, 0.005645751953125, -0.0037384033203125, 0.00958251953125, -0.002288818359375, 0.00732421875, -0.027099609375, 0.000705718994140625, -0.00012159347534179688, -0.0233154296875, 0.01165771484375, -0.0167236328125, -0.0007476806640625, -0.0091552734375, 0.0037841796875, ...

[ 11249, 14602, 903, 20625, 142508, 4378, 29713, 46312, 4488, 1556, 2652, 120337, 44816, 56, 47, 1375, 58627, 919, 379, 720, 11627, 24931, 3444, 4527, 42564, 48716, 7880, 34695, 102158, 12638, 11435, 12912, 192, 3055, 707, 23550, 10135, 139392,...

[ 0.124755859375, 0.1036376953125, 0.1385498046875, 0.1787109375, 0.24951171875, 0.1732177734375, 0.2802734375, 0.260009765625, 0.163818359375, 0.142333984375, 0.1357421875, 0.2156982421875, 0.1380615234375, 0.04742431640625, 0.1812744140625, 0.10565185546875, 0.171142578125, 0.06335...

embed

18304725_c0

18304725

haskell

0

Title: Memoization of multi-parameter function in Haskell Problem title: Memoization of multi-parameter function in Haskell Tags: ghc, memoization, haskell Problem: Memoization of multi-parameter function in Haskell The following example of a function using memoization is presented on this page : memoized_fib :: Int ->...

Memoization of multi-parameter function in Haskell Memoization of multi-parameter function in Haskell ghc memoization haskell Memoization Haskell memoized_fib Integer n-2 n-1 mult_fib m_fib Memoization of multi-parameter function in Haskell The following example of a function using memoization is presented on this page...

[ 0.00138092041015625, 0.00189971923828125, 0.0133056640625, -0.0086669921875, -0.0025177001953125, 0.0177001953125, 0.0003719329833984375, -0.00009870529174804688, 0.023681640625, -0.00946044921875, 0.0096435546875, -0.02734375, -0.0026397705078125, 0.018310546875, 0.00168609619140625, ...

[ 17443, 31, 47691, 6024, 6276, 29089, 32354, 20625, 142508, 31380, 238, 163, 432, 1556, 29367, 1029, 275, 44401, 5428, 5759, 3869, 347, 27781, 17368, 36663, 20650, 5809, 28282, 144227, 26026, 297, 3698, 20990, 52544, 61924, 1238, 39, 19, 163...

[ 0.171630859375, 0.1683349609375, 0.190185546875, 0.2042236328125, 0.1259765625, 0.1600341796875, 0.2008056640625, 0.157958984375, 0.27490234375, 0.11328125, 0.0843505859375, 0.1656494140625, 0.2142333984375, 0.135986328125, 0.098876953125, 0.1280517578125, 0.09002685546875, 0.10864...

embed

40288168_c0

40288168

haskell

0

Title: Is there any way to restrain the ADT data so that only the valid data could be constructed? Problem title: Is there any way to restrain the ADT data so that only the valid data could be constructed? Tags: haskell, type-theory, functional-programming, algebraic-data-types Problem: Is there any way to restrain the...

Is there any way to restrain the ADT data so that only the valid data could be constructed? Is there any way to restrain the ADT data so that only the valid data could be constructed? haskell type-theory functional-programming algebraic-data-types ADT Pos Nat Neg Zero Succ Rational Is there any way to restrain the ADT ...

[ -0.03466796875, 0.004425048828125, -0.0033111572265625, 0.0213623046875, 0.005767822265625, -0.00201416015625, -0.0023956298828125, -0.004791259765625, -0.003387451171875, -0.01226806640625, 0.01141357421875, -0.0302734375, 0.0108642578125, 0.012451171875, 0.000591278076171875, -0.0041...

[ 2499, 3917, 10588, 50256, 62, 41072, 2053, 4734, 35604, 5809, 64549, 297, 1556, 142508, 10644, 2347, 123309, 28966, 429, 10135, 50986, 13498, 68875, 799, 177, 83947, 1832, 10060, 2552, 43315, 2071, 2685, 61924, 44401, 18151, 7722, 84751, 2967...

[ 0.04754638671875, 0.076171875, 0.1400146484375, 0.2210693359375, 0.124267578125, 0.2303466796875, 0.198486328125, 0.0850830078125, 0.2052001953125, 0.056671142578125, 0.153076171875, 0.033843994140625, 0.09722900390625, 0.2144775390625, 0.1043701171875, 0.03387451171875, 0.0744628906...

embed

52367608_c1

52367608

haskell

1

. ADDIT: to clarify @kabuhr's answer (thank you) contrary to what I think you're claiming in part of your question, for a plain data family, matching on a constructor does not perform any inference These types are tricky, so I expect I'd need explicit signatures to work with them. In that case the plain data family is ...

[ 0.026123046875, -0.005859375, -0.00148773193359375, 0.002655029296875, 0.02099609375, -0.01806640625, -0.015869140625, -0.01116943359375, -0.00089263916015625, 0.0048828125, -0.00299072265625, -0.0322265625, -0.01104736328125, 0.01177978515625, 0.003814697265625, 0.0028076171875, 0.0...

[ 17306, 63043, 111719, 2053, 14449, 14858, 214, 98, 64549, 748, 959, 51339, 2499, 53498, 6620, 52895, 88308, 53, 41206, 143726, 138256, 4488, 678, 28, 1544, 525, 38997, 92, 1022, 43240, 15490, 10, 2822, 10644, 98411, 360, 18, 10422, 110, 2...

[ 0.01220703125, 0.01373291015625, 0.1651611328125, 0.15771484375, 0.1240234375, 0.2410888671875, 0.07958984375, 0.1007080078125, 0.1932373046875, 0.122802734375, 0.04803466796875, 0.1097412109375, 0.00872802734375, 0.2205810546875, 0.074462890625, 0.1258544921875, 0.05059814453125, ...

embed

20585328_c0

20585328

haskell

0

Title: How to do stateful list operations in haskell Problem title: How to do stateful list operations in haskell Tags: haskell, iteration, list Problem: How to do stateful list operations in haskell I need an operation which iterates over a list and produces a new list, where the new list elements depend on all elemen...

How to do stateful list operations in haskell How to do stateful list operations in haskell haskell iteration list How How to do stateful list operations in haskell I need an operation which iterates over a list and produces a new list, where the new list elements depend on all elements previously seen. To do this I wo...

[ -0.012939453125, 0.00164031982421875, 0.0059814453125, -0.00335693359375, -0.018310546875, 0.009765625, -0.013916015625, 0.002288818359375, -0.0045166015625, -0.03466796875, 0.018798828125, -0.006134033203125, -0.00015544891357421875, 0.018310546875, -0.01165771484375, 0.00182342529296...

[ 11249, 54, 11341, 7844, 5303, 41018, 7, 23, 1556, 142508, 47, 17, 720, 2320, 3871, 8560, 645, 27489, 3525, 80854, 56566, 756, 198395, 51592, 1884, 27875, 183278, 1290, 61340, 1295, 370, 99726, 82761, 8705, 59437, 5983, 9232, 34292, 35299, ...

[ 0.059234619140625, 0.1058349609375, 0.2203369140625, 0.1903076171875, 0.23876953125, 0.2166748046875, 0.08917236328125, 0.07177734375, 0.1544189453125, 0.2423095703125, 0.046600341796875, 0.046417236328125, 0.210693359375, 0.02032470703125, 0.030914306640625, 0.203125, 0.0830078125, ...

embed

30448073_c0

30448073

haskell

0

Title: Kind Classification of Types Problem title: Kind Classification of Types Tags: functional-programming, haskell Problem: Kind Classification of Types In Benjamin Pierce's book on Types and Programming Languages he classifies the different kinds of types as follows: * the kind of proper types (like Bool and Bool -...

Kind Classification of Types Kind Classification of Types functional-programming haskell Kind Classification Types Bool Prelude Num Kind Classification of Types In Benjamin Pierce's book on Types and Programming Languages he classifies the different kinds of types as follows: * the kind of proper types (like Bool and B...

[ 0.025390625, 0.015869140625, 0.006866455078125, 0.00726318359375, -0.0018157958984375, 0.0047607421875, -0.02294921875, -0.005706787109375, -0.0019683837890625, 0.0035247802734375, -0.0135498046875, -0.052734375, 0, 0.00384521484375, -0.0172119140625, 0.0096435546875, 0.0245361328125...

[ 27435, 237777, 111, 60457, 123309, 28966, 1556, 142508, 2460, 929, 1914, 822, 52782, 74715, 47231, 329, 12877, 27958, 83658, 18507, 27430, 12921, 8562, 52895, 27798, 136, 10644, 39933, 32354, 47, 6626, 155937, 16916, 370, 8705, 10461, 41, 206...

[ 0.23583984375, 0.2249755859375, 0.041656494140625, 0.251220703125, 0.0916748046875, 0.093017578125, 0.11083984375, 0.2392578125, 0.0899658203125, 0.1541748046875, 0.0587158203125, 0.1224365234375, 0.1239013671875, 0.14013671875, 0.13623046875, 0.1448974609375, 0.076171875, 0.110595...

embed

30646251_c0

30646251

haskell

0

Title: error define a template haskell function Problem title: error define a template haskell function Tags: haskell, template-haskell Problem: error define a template haskell function I am beginning to learn Template haskell, so I want create a function that receive a String param that define the name to the function...

error define a template haskell function error define a template haskell function haskell template-haskell build_p5 Dec FunD Clause TupP VarP NormalB AppE VarE Couldn Expected DecsQ Actual build_p2 Monad error define a template haskell function I am beginning to learn Template haskell, so I want create a function that ...

[ 0.006195068359375, 0.008544921875, -0.006683349609375, 0.00927734375, 0.00469970703125, 0.0211181640625, -0.002044677734375, -0.0216064453125, 0.0059814453125, -0.032958984375, 0.01531982421875, -0.0308837890625, 0.01165771484375, -0.009521484375, 0.004608154296875, -0.0007514953613281...

[ 18499, 61924, 10, 110934, 1556, 142508, 32354, 10557, 45367, 254, 758, 25755, 28670, 397, 100700, 1371, 683, 3323, 28723, 571, 5659, 647, 191147, 60075, 13, 2737, 100582, 304, 60331, 71, 86595, 30698, 196631, 3444, 28282, 53299, 23351, 214, ...

[ 0.18701171875, 0.200439453125, 0.033905029296875, 0.28759765625, 0.1197509765625, 0.2208251953125, 0.192138671875, 0.094970703125, 0.143310546875, 0.04449462890625, 0.125244140625, 0.1373291015625, 0.05908203125, 0.07635498046875, 0.1116943359375, 0.049957275390625, 0.08642578125, ...

embed

31627704_c1

31627704

haskell

1

R3] --The edges of cubes totheu1 :: Cube -> Int -- Measures how far away the cube is from having the cross of the first layer solved. totheu1 c = sum $ map (\d -> if d then 0 else 1) [c (-2, 3, 0) == c (0, 3, 0), c (2, 3, 0) == c (0, 3, 0), c (0, 3, -2) == c (0, 3, 0), c (0, 3, 2) == c (0, 3, 0), c (0, 2, -3) == c (0, ...

[ 0.00982666015625, 0.001495361328125, -0.002227783203125, 0.017822265625, 0.010986328125, -0.0059814453125, -0.0029296875, 0.00118255615234375, 0.01806640625, -0.0048828125, -0.01043701171875, 0.007049560546875, 0.015625, 0.004119873046875, -0.01397705078125, -0.0047607421875, -0.0128...

[ 627, 96386, 4210, 3957, 121303, 7, 111, 314, 7438, 1186, 95674, 418, 1984, 3003, 372, 33079, 360, 18, 1215, 162, 30891, 3642, 2060, 16065, 83, 1295, 19441, 41421, 5117, 135355, 86869, 71, 501, 2203, 10554, 3650, 22288, 2174, 104, 757, 3...

[ 0.1331787109375, 0.22705078125, 0.068603515625, 0.0416259765625, 0.251708984375, 0.109619140625, 0.06817626953125, 0.19140625, 0.2039794921875, 0.134521484375, 0.2587890625, 0.093505859375, 0.04730224609375, 0.176513671875, 0.18701171875, 0.03485107421875, 0.1021728515625, 0.174316...

embed

34497814_c0

34497814

haskell

0

Title: How to make aliases with yaml library in Haskell? Problem title: How to make aliases with yaml library in Haskell? Tags: yaml, haskell Problem: How to make aliases with yaml library in Haskell? I'm using YAML for configuration files and already have all required ToJSON/FromJSON instances for my data types. All g...

How to make aliases with yaml library in Haskell? How to make aliases with yaml library in Haskell? yaml haskell How Haskell security_level auth_password auth_protocol MD5 private_protocol None private_password securityAlias1 How to make aliases with yaml library in Haskell? I'm using YAML for configuration files and a...

[ -0.01043701171875, -0.000881195068359375, 0.0211181640625, 0.0081787109375, 0.0123291015625, 0.005126953125, -0.010498046875, 0.017578125, -0.017578125, 0.010986328125, -0.01214599609375, 0.01190185546875, 0.004364013671875, -0.0027008056640625, 0.0050048828125, 0.007781982421875, -0...

[ 11249, 3249, 55109, 90, 678, 151, 7237, 35773, 1294, 20625, 142508, 47, 23, 1556, 48031, 67919, 531, 927, 13409, 47416, 31, 25383, 758, 14375, 438, 55725, 162, 418, 17368, 3320, 39456, 180346, 102158, 21771, 56065, 717, 1375, 58627, 168407,...

[ 0.05865478515625, 0.1263427734375, 0.26171875, 0.1988525390625, 0.0780029296875, 0.1864013671875, 0.244873046875, 0.1707763671875, 0.04522705078125, 0.1495361328125, 0.236083984375, 0.012847900390625, 0.035858154296875, 0.12744140625, 0.1162109375, 0.1060791015625, 0.101806640625, ...

embed

23701448_c0

23701448

haskell

0

Title: How to read in an Int and use it in another function Problem title: How to read in an Int and use it in another function Tags: io, haskell, parsing Problem: How to read in an Int and use it in another function I am trying to read in an Int and then use the read value in a pure function, but it does not seem to w...

How to read in an Int and use it in another function How to read in an Int and use it in another function io haskell parsing How Please Couldn Failed How to read in an Int and use it in another function I am trying to read in an Int and then use the read value in a pure function, but it does not seem to work properly. ...

[ -0.0213623046875, 0.00726318359375, -0.004974365234375, -0.00347900390625, 0.0130615234375, 0.0191650390625, 0.000865936279296875, -0.0179443359375, -0.0050048828125, -0.052978515625, -0.0033111572265625, -0.0086669921875, -0.0267333984375, -0.0009613037109375, 0.01446533203125, 0.0006...

[ 11249, 47, 12301, 23, 142, 360, 18, 136, 4527, 15700, 32354, 22995, 1556, 142508, 366, 6953, 30607, 191147, 19, 190355, 297, 31577, 34292, 34166, 4488, 155965, 18151, 43240, 5885, 9969, 1340, 18499, 5201, 30646, 5608, 39116, 107730, 3403, 1...

[ 0.06182861328125, 0.008392333984375, 0.211669921875, 0.1741943359375, 0.05426025390625, 0.1751708984375, 0.1959228515625, 0.0784912109375, 0.1527099609375, 0.12353515625, 0.170654296875, 0.145263671875, 0.088134765625, 0.1788330078125, 0.084228515625, 0.00677490234375, 0.130615234375...

embed

37205511_c1

37205511

haskell

1

) args apply func argVals eval env badForm = throwError $ BadSpecialForm "Unrecognized special form" badForm eval env (List (Atom "define" : List (Atom var : params) : body)) = makeNormalFunc env params body >>= defineVar env var eval env (List (Atom "define" : DottedList (Atom var : params) varargs : body)) = makeVarA...

[ 0.00555419921875, 0.01287841796875, -0.004119873046875, -0.01324462890625, -0.000713348388671875, 0.0169677734375, 0.004364013671875, -0.0034942626953125, 0.012451171875, 0.0157470703125, 0.0034942626953125, -0.01806640625, -0.009521484375, -0.0022430419921875, -0.0086669921875, -0.005...

[ 1388, 79459, 7, 59911, 7477, 42272, 28, 1405, 22, 334, 6494, 102973, 104250, 18468, 31611, 3650, 12745, 216119, 14256, 107, 115558, 64807, 5361, 3173, 154663, 12078, 64552, 32036, 285, 121, 4432, 14361, 50645, 2749, 97249, 61924, 81827, 84929...

[ 0.0243072509765625, 0.234619140625, 0.0792236328125, 0.156494140625, 0.125244140625, 0.23388671875, 0.06805419921875, 0.25537109375, 0.1240234375, 0.2313232421875, 0.1868896484375, 0.255859375, 0.1546630859375, 0.0897216796875, 0.1298828125, 0.03668212890625, 0.1446533203125, 0.137...

embed

4008473_c0

4008473

haskell

0

Title: How to get make stats in constant memory Problem title: How to get make stats in constant memory Tags: lazy-evaluation, haskell, memory-management, random, statistics Problem: How to get make stats in constant memory I have a function, which creates some random numerical results. I know, that the result will be ...

How to get make stats in constant memory How to get make stats in constant memory lazy-evaluation haskell memory-management random statistics How a..b How to get make stats in constant memory I have a function, which creates some random numerical results. I know, that the result will be an integer in a (small, a - b ap...

[ 0.0068359375, -0.0201416015625, 0.00933837890625, -0.0230712890625, -0.0020599365234375, 0.01446533203125, 0.005950927734375, -0.0137939453125, 0.01202392578125, -0.0281982421875, -0.0216064453125, 0.01129150390625, 0.0167236328125, 0.027587890625, 0.0233154296875, -0.01953125, 0.000...

[ 11249, 2046, 3249, 63841, 23, 53697, 98323, 47, 21, 3285, 159258, 1556, 142508, 87140, 96759, 80835, 32354, 28282, 54744, 50339, 3714, 16750, 892, 1505, 69070, 876, 35707, 836, 37457, 3444, 71924, 805, 28568, 20028, 74481, 3642, 27983, 12638,...

[ 0.04510498046875, 0.121826171875, 0.2275390625, 0.257568359375, 0.103759765625, 0.225830078125, 0.2252197265625, 0.0042724609375, 0.018096923828125, 0.1015625, 0.0833740234375, 0.06134033203125, 0.177001953125, 0.0997314453125, 0.144287109375, 0.22607421875, 0.138427734375, 0.06817...

embed

3093133_c0

3093133

haskell

0

Title: How to provide explicit type declarations for functions when using GHCi? Problem title: How to provide explicit type declarations for functions when using GHCi? Tags: types, haskell, ghci, function-declaration Problem: How to provide explicit type declarations for functions when using GHCi? How to I define the e...

How to provide explicit type declarations for functions when using GHCi? How to provide explicit type declarations for functions when using GHCi? types haskell ghci function-declaration GHCi Data.List How Prelude How to provide explicit type declarations for functions when using GHCi? How to I define the equivalent of ...

[ -0.0008087158203125, 0.0111083984375, 0.013916015625, 0.010986328125, 0.0008087158203125, 0.00135040283203125, 0.0035858154296875, -0.016357421875, -0.000644683837890625, -0.0179443359375, -0.00323486328125, -0.02490234375, -0.005218505859375, 0.00439453125, -0.0028533935546875, 0.0108...

[ 11249, 22691, 143726, 10644, 21635, 5256, 100, 32354, 17368, 527, 73265, 14, 47, 52895, 1556, 142508, 31380, 318, 50718, 320, 11809, 154663, 822, 112, 61924, 183234, 30698, 53927, 7232, 46132, 177417, 26946, 80934, 73866, 5303, 25072, 237, 17...

[ 0.060211181640625, 0.133056640625, 0.20263671875, 0.243896484375, 0.20263671875, 0.078369140625, 0.035247802734375, 0.1876220703125, 0.0283203125, 0.0767822265625, 0.15185546875, 0.2130126953125, 0.001373291015625, 0.1654052734375, 0.1021728515625, 0.215576171875, 0.10638427734375, ...

embed

39293399_c0

39293399

haskell

0

Title: Haskell - Pass arbitrary function and argument list as arguments to another function Problem title: Haskell - Pass arbitrary function and argument list as arguments to another function Tags: function, variables, haskell, arguments Problem: Haskell - Pass arbitrary function and argument list as arguments to anoth...

Haskell - Pass arbitrary function and argument list as arguments to another function Haskell - Pass arbitrary function and argument list as arguments to another function function variables haskell arguments Haskell Pass haskell_stderr stderr_dup Data.List.foldl Nothing Haskell - Pass arbitrary function and argument lis...

[ 0.0107421875, -0.00153350830078125, -0.00335693359375, -0.01141357421875, -0.0057373046875, -0.0047607421875, 0.00182342529296875, -0.0198974609375, -0.003997802734375, 0.005828857421875, -0.017333984375, -0.01153564453125, 0.004638671875, 0.01312255859375, 0.01507568359375, -0.0072631...

[ 20625, 142508, 28872, 61799, 1294, 32354, 136, 10750, 5303, 237, 47, 15700, 77336, 1556, 271, 820, 42, 6138, 693, 254, 11809, 154663, 42822, 141, 182747, 20, 5201, 69236, 456, 80581, 11435, 16401, 25632, 18151, 58134, 15673, 4537, 27875, 24...

[ 0.1292724609375, 0.267822265625, 0.15625, 0.1627197265625, 0.076416015625, 0.1998291015625, 0.077392578125, 0.259765625, 0.1827392578125, 0.09228515625, 0.1109619140625, 0.1080322265625, 0.179443359375, 0.1217041015625, 0.0333251953125, 0.05621337890625, 0.15966796875, 0.1270751953...

embed

41007007_c0

41007007

haskell

0

Title: Most efficient wire format for GHCJS code over websockets Problem title: Most efficient wire format for GHCJS code over websockets Tags: haskell, serialization, websocket, ghcjs Problem: Most efficient wire format for GHCJS code over websockets I am working on a Haskell application, running in the browser compil...

Most efficient wire format for GHCJS code over websockets Most efficient wire format for GHCJS code over websockets haskell serialization websocket ghcjs Most GHCJS Read Show ByteStrings Blob GHC.Generics Most efficient wire format for GHCJS code over websockets I am working on a Haskell application, running in the bro...

[ 0.007293701171875, 0.016845703125, -0.01513671875, -0.0211181640625, -0.0032958984375, -0.004180908203125, -0.0079345703125, 0.0103759765625, -0.01708984375, -0.004302978515625, 0.0076904296875, -0.0498046875, -0.00180816650390625, 0.005889892578125, -0.0078125, 0.0218505859375, -0.0...

[ 17006, 93766, 1439, 13, 9384, 527, 73265, 64977, 18151, 645, 1467, 991, 27853, 1556, 142508, 35686, 47691, 31380, 238, 28175, 4764, 17367, 3311, 67, 71713, 5180, 54231, 275, 135932, 12259, 20697, 20625, 38415, 31842, 5974, 127219, 10723, 5912...

[ 0.09161376953125, 0.202392578125, 0.17529296875, 0.0775146484375, 0.2308349609375, 0.1156005859375, 0.2249755859375, 0.2313232421875, 0.1630859375, 0.076904296875, 0.126220703125, 0.1224365234375, 0.1187744140625, 0.0972900390625, 0.2003173828125, 0.1845703125, 0.07666015625, 0.084...

embed

28106953_c0

28106953

haskell

0

Title: What is the `Operator` word definition? Problem title: What is the `Operator` word definition? Tags: haskell Problem: What is the `Operator` word definition? I learn Haskell. What definition for the operator word in Haskell? I can't find clear definition. I think it is something like that (my own understanding):...

What is the `Operator` word definition? What is the `Operator` word definition? haskell What Operator What is the `Operator` word definition? I learn Haskell. What definition for the operator word in Haskell? I can't find clear definition. I think it is something like that (my own understanding): From Haskell 2010 the ...

[ 0.013916015625, -0.02685546875, 0.01495361328125, 0.017578125, 0.011962890625, 0.005462646484375, 0.00830078125, 0.01141357421875, 0.0064697265625, 0.01336669921875, 0.0002460479736328125, -0.0306396484375, 0.01446533203125, -0.0146484375, -0.01708984375, 0.0118408203125, 0.001342773...

[ 4865, 156823, 1290, 2565, 80934, 1556, 142508, 150922, 83, 30698, 20625, 39933, 23, 34735, 5351, 1884, 10002, 100094, 1532, 21115, 237, 238, 65183, 36846, 70541, 111, 9077, 7108, 27781, 903, 33153, 13538, 7077, 4966, 17932, 50960, 20117, 7 ]

[ 0.046844482421875, 0.2498779296875, 0.23291015625, 0.1544189453125, 0.185302734375, 0.11328125, 0.207763671875, 0.300537109375, 0.0205841064453125, 0.042144775390625, 0.1016845703125, 0.296142578125, 0.027130126953125, 0.04541015625, 0.00640869140625, 0.021697998046875, 0.00970458984...

embed

48510270_c0

48510270

haskell

0

Title: Immutability invariants in Haskell's GC, considering mutual recursion Problem title: Immutability invariants in Haskell's GC, considering mutual recursion Tags: garbage-collection, optimization, memory, haskell Problem: Immutability invariants in Haskell's GC, considering mutual recursion I was reading...

Immutability invariants in Haskell's GC, considering mutual recursion Immutability invariants in Haskell's GC, considering mutual recursion garbage-collection optimization memory haskell Immutability Haskell Immutability invariants in Haskell's GC, considering mutual recursion I was reading this article: http...

[ -0.0018310546875, 0.0244140625, 0.00396728515625, 0.0174560546875, -0.0123291015625, 0.0198974609375, -0.03076171875, -0.01251220703125, 0.00408935546875, -0.01611328125, 0.01806640625, 0.0011138916015625, 0.006561279296875, 0.01446533203125, 0.0203857421875, 0.00994873046875, -0.014...

[ 3370, 14311, 41159, 23, 162591, 20625, 142508, 3768, 69657, 179635, 199849, 195625, 3671, 402, 429, 196352, 87235, 98323, 1556, 1830, 16454, 5582, 13691, 10557, 41877, 441, 6696, 4514, 228555, 4785, 55681, 959, 28219, 2831, 5351, 2806, 29568, ...

[ 0.091796875, 0.226318359375, 0.13916015625, 0.12109375, 0.30908203125, 0.16748046875, 0.25732421875, 0.05743408203125, 0.206787109375, 0.139892578125, 0.225830078125, 0.226318359375, 0.052154541015625, 0.1376953125, 0.0213775634765625, 0.07733154296875, 0.1263427734375, 0.148925781...

embed

77727518_c0

77727518

haskell

0

Title: Apply a function with Monadic result instead of a function with a non-Monadic result Problem title: Apply a function with Monadic result instead of a function with a non-Monadic result Tags: haskell Problem: Apply a function with Monadic result instead of a function with a non-Monadic result I have a function (f...

Apply a function with Monadic result instead of a function with a non-Monadic result Apply a function with Monadic result instead of a function with a non-Monadic result haskell Apply Monadic Display Color Float Picture Apply a function with Monadic result instead of a function with a non-Monadic result I have a functi...

[ -0.013427734375, 0.00185394287109375, 0.01495361328125, 0.007598876953125, 0.0233154296875, 0.01190185546875, 0.002685546875, -0.00185394287109375, 0.0020599365234375, -0.0302734375, 0.01513671875, -0.02001953125, -0.01324462890625, 0.01483154296875, 0.0120849609375, -0.01116943359375,...

[ 5659, 538, 32354, 678, 60331, 18403, 16750, 64457, 111, 351, 46674, 11, 1556, 142508, 90045, 51193, 38699, 257, 158656, 10, 161063, 35773, 1294, 16, 26946, 7, 15700, 237, 142, 10750, 7477, 238, 1984, 15, 33079, 876, 1388, 347, 132, 5036, ...

[ 0.1878662109375, 0.1112060546875, 0.21826171875, 0.0943603515625, 0.197998046875, 0.171142578125, 0.184326171875, 0.154052734375, 0.0169677734375, 0.09423828125, 0.07281494140625, 0.052734375, 0.115966796875, 0.2359619140625, 0.146240234375, 0.1373291015625, 0.1754150390625, 0.0633...

embed

8505964_c0

8505964

haskell

0

Title: Getting error description from compiling regexp Problem title: Getting error description from compiling regexp Tags: regex, haskell Problem: Getting error description from compiling regexp I am trying to compile a regexp and get an error message that can be presented to the user. I tried this with Text.Regex.TDF...

Getting error description from compiling regexp Getting error description from compiling regexp regex haskell compiling Getting Prelude Text.Regex.TDFA Data.Maybe Data.Either.Utils Either Regex Exception Text.Regex.TDFA.String Failed Maybe Getting error description from compiling regexp I am trying to compile a regexp ...

[ 0.00079345703125, 0.0113525390625, -0.0078125, 0.0079345703125, 0.0166015625, 0.02294921875, -0.006195068359375, 0.007537841796875, 0.00396728515625, -0.00946044921875, 0.00469970703125, -0.0213623046875, 0.01171875, -0.001129150390625, 0.0016326904296875, 0.0108642578125, 0.00256347...

[ 210732, 18499, 76811, 1295, 9969, 49725, 6835, 83613, 3355, 1556, 142508, 1914, 822, 112, 24129, 54601, 100045, 14676, 11809, 82419, 372, 9319, 106742, 11678, 63928, 71713, 190355, 297, 83425, 31577, 1340, 26008, 8121, 5, 7192, 7, 4084, 68991...

[ 0.077880859375, 0.195068359375, 0.2403564453125, 0.062286376953125, 0.1395263671875, 0.1219482421875, 0.15283203125, 0.251220703125, 0.1837158203125, 0.061492919921875, 0.197998046875, 0.041839599609375, 0.1484375, 0.02288818359375, 0.1260986328125, 0.092529296875, 0.025787353515625,...

embed

54843477_c0

54843477

haskell

0

Title: How does OverloadedStrings language extension work? Problem title: How does OverloadedStrings language extension work? Tags: haskell Problem: How does OverloadedStrings language extension work? I am trying to understand the language extension OverloadedStrings from the page https://ocharles.org.uk/posts/2014-12-...

How does OverloadedStrings language extension work? How does OverloadedStrings language extension work? haskell How OverloadedStrings Data.String.IsString Prelude Data.String Foo IsString How does OverloadedStrings language extension work? I am trying to understand the language extension OverloadedStrings from the page...

[ 0.0162353515625, 0.007293701171875, -0.00775146484375, 0.033447265625, -0.00897216796875, 0.01092529296875, 0.02734375, -0.0069580078125, 0.004791259765625, -0.0152587890625, 0.0032501220703125, -0.05859375, 0.00016498565673828125, 0.007659912109375, -0.0224609375, -0.0198974609375, ...

[ 11249, 14602, 9578, 63033, 297, 71713, 5180, 46876, 111938, 4488, 1556, 142508, 11809, 214, 29598, 1914, 822, 112, 9572, 31, 2071, 28219, 9254, 1577, 5465, 91693, 7, 225081, 23351, 24209, 10644, 10, 44357, 76811, 79315, 15659, 16765, 5036, ...

[ 0.0687255859375, 0.06658935546875, 0.1793212890625, 0.2237548828125, 0.1204833984375, 0.2034912109375, 0.1805419921875, 0.1683349609375, 0.201171875, 0.1590576171875, 0.109375, 0.2049560546875, 0.1246337890625, 0.1094970703125, 0.117431640625, 0.07586669921875, 0.1407470703125, 0.0...

embed

41093747_c0

41093747

haskell

0

Title: Conversion between two stream types Problem title: Conversion between two stream types Tags: haskell, type-conversion, isomorphism Problem: Conversion between two stream types I have a question regarding converting between two datatypes in Haskell. Consider the following two datatypes data Stream a = Cons a (Str...

Conversion between two stream types Conversion between two stream types haskell type-conversion isomorphism Conversion Stream Cons Stream2 sToS2 s2ToS Conversion between two stream types I have a question regarding converting between two datatypes in Haskell. The first thing that I am having trouble with is the Stream ...

[ -0.01434326171875, 0.0198974609375, -0.01409912109375, -0.0081787109375, -0.0035552978515625, 0.006378173828125, -0.0299072265625, -0.002685546875, 0.015869140625, 0.01300048828125, 0.00897216796875, -0.013671875, 0.03173828125, 0.0196533203125, 0.0003070831298828125, 0.00396728515625,...

[ 1657, 46354, 17721, 6626, 75973, 52895, 1556, 142508, 10644, 2271, 13882, 178851, 115061, 39215, 304, 91, 7763, 294, 9655, 96760, 214, 2053, 50986, 20625, 19441, 63134, 1957, 10, 195625, 5844, 110, 3647, 7225, 32195, 209303, 54241, 105233, 64...

[ 0.07220458984375, 0.170166015625, 0.1356201171875, 0.1485595703125, 0.2332763671875, 0.223388671875, 0.12744140625, 0.250732421875, 0.192626953125, 0.055908203125, 0.0718994140625, 0.158447265625, 0.2186279296875, 0.119140625, 0.16259765625, 0.057464599609375, 0.1602783203125, 0.10...

embed

71548026_c0

71548026

haskell

0

Title: How can I fix my inserPair haskell code to work for all of the tests? Problem title: How can I fix my inserPair haskell code to work for all of the tests? Tags: haskell, key-value Problem: How can I fix my inserPair haskell code to work for all of the tests? Specify the function that inserts a new pair into a li...

How can I fix my inserPair haskell code to work for all of the tests? How can I fix my inserPair haskell code to work for all of the tests? haskell key-value How How can I fix my inserPair haskell code to work for all of the tests? Specify the function that inserts a new pair into a list of key-value pairs. If the key ...

[ -0.0120849609375, 0.001220703125, 0.0021820068359375, -0.014404296875, 0.001007080078125, 0.01025390625, -0.0341796875, -0.0291748046875, 0.003875732421875, 0.0145263671875, 0.025390625, -0.003631591796875, 0.0135498046875, -0.01470947265625, 0.00408935546875, 0.0026092529296875, -0....

[ 11249, 30022, 28046, 8335, 481, 1556, 142508, 18151, 4488, 100, 756, 109921, 831, 47, 111, 22799, 27494, 24990, 32354, 183540, 3525, 80836, 3934, 5303, 21771, 34292, 645, 5429, 114689, 3564, 959, 148, 174796, 7225, 787, 15549 ]

[ 0.027008056640625, 0.1807861328125, 0.1949462890625, 0.1639404296875, 0.1595458984375, 0.1453857421875, 0.22998046875, 0.18603515625, 0.10150146484375, 0.0780029296875, 0.0745849609375, 0.1805419921875, 0.013824462890625, 0.0207366943359375, 0.02294921875, 0.166015625, 0.141357421875...

embed

66941797_c0

66941797

haskell

0

Title: Pattern match failure : head [ ] , haskell Problem title: Pattern match failure : head [ ] , haskell Tags: haskell Problem: Pattern match failure : head [ ] , haskell I give as input a list like : s = [(1,5),(1,4),(3,4)] and i want to take every time the head of this list which will be with recuircive loop 1: (1...

Pattern match failure : head [ ] , haskell Pattern match failure : head [ ] , haskell haskell Pattern help_statistics total_points goal_for goal_against Pattern match failure : head [ ] , haskell I give as input a list like : s = [(1,5),(1,4),(3,4)] and i want to take every time the head of this list which will be with...

[ 0.0164794921875, 0.00982666015625, -0.0038299560546875, 0.0159912109375, -0.011474609375, 0.0016326904296875, -0.004119873046875, 0.004638671875, 0.01708984375, -0.00927734375, 0.024658203125, -0.01275634765625, 0.0079345703125, 0.00787353515625, 0.0267333984375, -0.0255126953125, 0....

[ 9876, 22766, 14858, 137578, 10336, 1556, 142508, 4358, 17346, 48242, 3622, 38496, 69236, 2472, 4729, 73, 87, 8337, 237, 107730, 5303, 1884, 91, 57626, 163324, 82449, 3444, 47, 5646, 11907, 1733, 111, 903, 186, 678, 43852, 481, 318, 272, 4...

[ 0.146240234375, 0.1387939453125, 0.189453125, 0.2174072265625, 0.197509765625, 0.1217041015625, 0.199951171875, 0.1383056640625, 0.060577392578125, 0.037322998046875, 0.1082763671875, 0.169189453125, 0.1451416015625, 0.0521240234375, 0.02130126953125, 0.091064453125, 0.00454711914062...

embed

27474810_c0

27474810

haskell

0

Title: All the subsets of size N which satisfy a condition in Haskell Problem title: All the subsets of size N which satisfy a condition in Haskell Tags: haskell, complexity-theory, optimization, algorithm Problem: All the subsets of size N which satisfy a condition in Haskell I would like to write a function, which ta...

All the subsets of size N which satisfy a condition in Haskell All the subsets of size N which satisfy a condition in Haskell haskell complexity-theory optimization algorithm All Haskell Integer x:xs k-1 All the subsets of size N which satisfy a condition in Haskell I would like to write a function, which takes a list ...

[ -0.01171875, 0.01031494140625, 0.005218505859375, -0.017578125, 0.006439208984375, 0.0038604736328125, 0.0032958984375, -0.01300048828125, -0.0003528594970703125, 0.0023651123046875, 0.00390625, -0.01123046875, 0.00372314453125, 0.00469970703125, -0.011474609375, 0.00665283203125, 0....

[ 3164, 1614, 3509, 7, 13267, 541, 3129, 40407, 53, 35431, 23, 20625, 142508, 1556, 27140, 2347, 87235, 234873, 44401, 1022, 425, 472, 5759, 1884, 33022, 10, 32354, 51776, 5303, 30646, 756, 7722, 3444, 765, 5691, 62539, 133063, 82449, 15490, ...

[ 0.08740234375, 0.2158203125, 0.250732421875, 0.032958984375, 0.1416015625, 0.1561279296875, 0.030364990234375, 0.1951904296875, 0.072265625, 0.2073974609375, 0.05865478515625, 0.1697998046875, 0.251953125, 0.1580810546875, 0.1202392578125, 0.000274658203125, 0.10601806640625, 0.072...

embed

74089915_c1

74089915

haskell

1

, Black), (35, Black) ] initialBoard = Data.Map.union startBoard emptyBoard Following this way of thinking about the board: However, when running this in the Prelude, I get: <interactive>:42:45: error: * Couldn't match type `Maybe a0' with `Player' Expected type: Data.Map.Internal.Map k Player Actual type: Data.Map.Int...

[ -0.006439208984375, 0.00762939453125, 0.0029754638671875, 0.003631591796875, -0.005157470703125, -0.00823974609375, 0.002044677734375, -0.0123291015625, 0.0140380859375, 0.00372314453125, 0.00836181640625, 0.03125, 0.013671875, 0.0234375, -0.020751953125, -0.023193359375, 0.012756347...

[ 10074, 5843, 61475, 12647, 5861, 2203, 11809, 166179, 87046, 4034, 201505, 47644, 45443, 51042, 903, 1914, 822, 112, 10433, 71232, 33529, 15989, 18499, 191147, 18, 14858, 10644, 82419, 372, 10, 2389, 678, 142581, 60075, 44851, 472, 60560, 100...

[ 0.1805419921875, 0.164306640625, 0.1815185546875, 0.194580078125, 0.220947265625, 0.0258636474609375, 0.1405029296875, 0.1832275390625, 0.1544189453125, 0.1378173828125, 0.228271484375, 0.08056640625, 0.222412109375, 0.09027099609375, 0.004425048828125, 0.1126708984375, 0.19641113281...

embed

46718726_c0

46718726

haskell

0

Title: Why is Int not promotable? Problem title: Why is Int not promotable? Tags: haskell, ghc Problem: Why is Int not promotable? I'd like to have points in two or three dimensions such that the two-dimensional points and the three-dimensional points can share code, but the compiler can tell them apart. Here's a first...

Why is Int not promotable? Why is Int not promotable? haskell ghc Why LANGUAGE DataKinds GADTs KindSignatures Dimension Point Why is Int not promotable? I'd like to have points in two or three dimensions such that the two-dimensional points and the three-dimensional points can share code, but the compiler can tell them...

[ 0.00799560546875, 0.01043701171875, -0.00127410888671875, 0.013671875, 0.00982666015625, 0.024658203125, -0.01055908203125, -0.0211181640625, 0.0035400390625, 0.01611328125, 0.00567626953125, -0.046875, -0.0142822265625, -0.01300048828125, -0.036865234375, 0.0014190673828125, 0.02612...

[ 44084, 83, 360, 18, 959, 8891, 22819, 1556, 142508, 31380, 238, 98064, 11809, 605, 7250, 23749, 41072, 27435, 218723, 11, 54889, 161202, 41097, 1884, 765, 26847, 6626, 17262, 158208, 157955, 831, 12008, 18151, 9969, 34759, 14192, 34955, 81887...

[ 0.120361328125, 0.05181884765625, 0.1634521484375, 0.2169189453125, 0.1614990234375, 0.2431640625, 0.204833984375, 0.0843505859375, 0.2269287109375, 0.06207275390625, 0.03924560546875, 0.0819091796875, 0.07550048828125, 0.0223236083984375, 0.160888671875, 0.0655517578125, 0.074096679...

embed

10224199_c0

10224199

haskell

0

Title: Word count program in Haskell Problem title: Word count program in Haskell Tags: haskell Problem: Word count program in Haskell I'm going over past exams studying for my upcoming exam, and after completing a couple of the questions I came across one that I couldn't solve. It wants a function that will take a Str...

Word count program in Haskell Word count program in Haskell haskell Word Haskell Char Word count program in Haskell I'm going over past exams studying for my upcoming exam, and after completing a couple of the questions I came across one that I couldn't solve. It wants a function that will take a String (or [Char]) and...

[ -0.004180908203125, 0.01336669921875, -0.0029296875, 0.035888671875, -0.006103515625, 0.01397705078125, -0.00390625, -0.00250244140625, -0.0086669921875, -0.0194091796875, 0.004180908203125, -0.0107421875, 0.00015163421630859375, 0.02001953125, -0.0072021484375, 0.0128173828125, 0.01...

[ 22543, 54529, 1528, 20625, 142508, 23, 1556, 21656, 11015, 42276, 277, 69427, 18, 86869, 86171, 32354, 5646, 23351, 214, 84068, 30646, 360, 14012, 175457, 34153, 621, 83, 164805, 170933, 70760, 51776, 73783, 34677, 96819, 2565, 29568, 98320, ...

[ 0.1998291015625, 0.2276611328125, 0.16064453125, 0.14794921875, 0.2039794921875, 0.02789306640625, 0.1395263671875, 0.1739501953125, 0.0120849609375, 0.0960693359375, 0.0142669677734375, 0.044342041015625, 0.087158203125, 0.10125732421875, 0.093017578125, 0.158935546875, 0.1665039062...

embed

24967745_c1

24967745

haskell

1

messages on every impossible case? In this particular example, I know there are better ways to handle this, for example by having the caller match on the pattern . So if you want here is another example that is a very simplified extract from a lexer I'm writing which you can run, too: import Data.Char (isNumber, isAlp...

[ -0.009521484375, 0.000522613525390625, -0.004974365234375, 0.01519775390625, 0.0106201171875, -0.005462646484375, -0.0052490234375, -0.01129150390625, 0.0169677734375, -0.0076904296875, 0.00909423828125, -0.002166748046875, -0.005523681640625, 0.0108642578125, 0.0059814453125, -0.00555...

[ 89914, 98, 11907, 69201, 7225, 903, 17311, 27781, 3714, 11522, 48322, 47, 34831, 19441, 11782, 56, 14858, 70, 103510, 5, 3444, 4552, 112892, 125663, 95, 34058, 831, 11675, 24927, 11809, 84068, 164, 18444, 26278, 83, 6210, 14612, 27131, 4667...

[ 0.262939453125, 0.1102294921875, 0.1640625, 0.30419921875, 0.2161865234375, 0.1087646484375, 0.05853271484375, 0.177734375, 0.00958251953125, 0.0821533203125, 0.05078125, 0.1390380859375, 0.173095703125, 0.02972412109375, 0.2001953125, 0.10491943359375, 0.1260986328125, 0.012145996...

embed

37265378_c1

37265378

haskell

1

://github.com/yesodweb/yesod/wiki/Configuration#parsing-numeric-values-as-strings database: user: "_env:MYSQL_USER:root" password: "_env:MYSQL_PASSWORD:#123" host: "_env:MYSQL_HOST:localhost" port: "_env:MYSQL_PORT:3306" # See config/test-settings.yml for an override during tests database: "_env:MYSQL_DATABASE:mydataba...

[ -0.01556396484375, 0.015869140625, -0.00518798828125, -0.0130615234375, 0.00579833984375, 0.0242919921875, -0.0167236328125, -0.041748046875, -0.0084228515625, 0.0029296875, -0.012939453125, -0.002593994140625, -0.00933837890625, -0.01153564453125, -0.017333984375, 0.0142822265625, -...

[ 15769, 32102, 1033, 23722, 14051, 13691, 11935, 59994, 2320, 2500, 6953, 2606, 56, 1771, 27494, 90, 162, 91693, 63399, 38937, 33, 334, 73543, 158897, 454, 1062, 50184, 148920, 58, 78506, 98185, 89023, 36639, 12, 48636, 27980, 841, 98908, 40...

[ 0.098388671875, 0.1771240234375, 0.139892578125, 0.2313232421875, 0.1588134765625, 0.06256103515625, 0.0174102783203125, 0.200439453125, 0.0189971923828125, 0.1600341796875, 0.1339111328125, 0.1123046875, 0.212646484375, 0.037322998046875, 0.169189453125, 0.034698486328125, 0.1489257...

embed

28867353_c1

28867353

haskell

1

(x / 4) then isPowerOf4 (truncate (x / 4)) else False /tmp/haskell11524-8-kke52v/PowerOfFour.hs:10:23: Could not deduce (Fractional n) arising from a use of `/' from the context (Integral n) bound by the type signature for isPowerOf4 :: Integral n => n -> Bool at /tmp/haskell11524-8-kke52v/PowerOfFour.hs:5:15-37 Possi...

[ -0.0185546875, -0.0081787109375, -0.002105712890625, -0.0008392333984375, -0.0078125, 0.00958251953125, -0.01385498046875, -0.0087890625, 0.004486083984375, 0.00567626953125, -0.016357421875, -0.009033203125, -0.000553131103515625, -0.00762939453125, 0.00946044921875, 0.0087890625, -...

[ 425, 248, 13956, 83, 105022, 132887, 617, 9774, 19, 33478, 37076, 22225, 2676, 10557, 142508, 103928, 2357, 17376, 5222, 12744, 334, 27591, 474, 127, 15110, 24864, 191147, 959, 8, 106357, 108386, 10763, 289, 653, 187, 72219, 1295, 4527, 64,...

[ 0.089111328125, 0.1800537109375, 0.2315673828125, 0.19091796875, 0.2249755859375, 0.2406005859375, 0.2200927734375, 0.0987548828125, 0.07281494140625, 0.1534423828125, 0.008056640625, 0.1070556640625, 0.116455078125, 0.0797119140625, 0.207763671875, 0.06195068359375, 0.109619140625, ...

embed

73911130_c0

73911130

haskell

0

Title: reserve algorithm is not behaving Problem title: reserve algorithm is not behaving Tags: haskell Problem: reserve algorithm is not behaving The output from running this code is not correct, I cannot wrap my head sadly, to know where the wrong is in my own code. I been staring at it for hours. Code: import System...

reserve algorithm is not behaving reserve algorithm is not behaving haskell System.IO /home/runner/University-Labs/.ghci x:xs GHCi www.haskell.org Loaded University-Labs Compiling Main Main.hs Ctrl reserve algorithm is not behaving The output from running this code is not correct, I cannot wrap my head sadly, to know w...

[ -0.021728515625, 0.0205078125, 0.00823974609375, 0.021240234375, -0.0157470703125, 0.0123291015625, 0.0283203125, -0.0068359375, -0.01263427734375, 0.01312255859375, -0.000010788440704345703, -0.0036468505859375, 0.0322265625, -0.0086669921875, -0.01025390625, 0.001373291015625, 0.00...

[ 76875, 234873, 83, 959, 186, 528, 6496, 1556, 142508, 12353, 17780, 29552, 142117, 65305, 2481, 97381, 9486, 318, 1022, 425, 527, 73265, 14, 10557, 1478, 2091, 712, 12535, 15612, 49725, 12321, 127, 7, 68847, 140992, 51042, 18151, 26785, 534...

[ 0.308349609375, 0.25830078125, 0.043060302734375, 0.1519775390625, 0.10174560546875, 0.17578125, 0.07763671875, 0.142578125, 0.2481689453125, 0.0985107421875, 0.185302734375, 0.06915283203125, 0.172607421875, 0.040283203125, 0.018218994140625, 0.1695556640625, 0.080322265625, 0.113...

embed

78335230_c0

78335230

haskell

0

Title: Implementing I/O Tasty-Hunit testing for Github autograder Problem title: Implementing I/O Tasty-Hunit testing for Github autograder Tags: haskell, io, tasty, testing Problem: Implementing I/O Tasty-Hunit testing for Github autograder I've been given the task to implement a test for an IO function for GitHub's a...

Implementing I/O Tasty-Hunit testing for Github autograder Implementing I/O Tasty-Hunit testing for Github autograder haskell io tasty testing Implementing Tasty-Hunit Github First Second Third test_countLetters ReadMode System.IO.hDuplicateTo Haskell Fun Count Implementing I/O Tasty-Hunit testing for Github autograder...

[ 0.00701904296875, 0.00653076171875, -0.0260009765625, 0.01708984375, -0.0019683837890625, 0.00494384765625, 0.019287109375, -0.01007080078125, -0.00238037109375, 0.00775146484375, -0.003814697265625, -0.0240478515625, 0.008056640625, 0.01507568359375, 0.0242919921875, 0.000553131103515...

[ 153941, 87, 64, 670, 9598, 939, 30513, 6773, 134234, 100, 527, 217, 32102, 1809, 132130, 1556, 142508, 22995, 308, 8946, 23972, 77648, 198387, 3034, 71013, 124480, 23962, 4764, 9083, 12353, 17780, 127, 17726, 52721, 7763, 20625, 28670, 108210...

[ 0.15966796875, 0.035888671875, 0.188232421875, 0.1363525390625, 0.2236328125, 0.1871337890625, 0.1103515625, 0.196533203125, 0.2149658203125, 0.0202789306640625, 0.058990478515625, 0.1260986328125, 0.2188720703125, 0.1600341796875, 0.2222900390625, 0.083984375, 0.19775390625, 0.164...

embed

25297157_c0

25297157

haskell

0

Title: Generalizing mapAndUnzip Problem title: Generalizing mapAndUnzip Tags: functor, haskell Problem: Generalizing mapAndUnzip I'm looking for an easy way to write the function mapAndUnzip :: (Functor f) => (a -> (b,c)) -> f a -> (f b, f c) I'm not entirely convinced that Functor is a strong enough constraint, but I'...

Generalizing mapAndUnzip Generalizing mapAndUnzip functor haskell Generalizing Functor Data.Vector.Unboxed.Vector Vector Array Unbox Generalizing mapAndUnzip I'm looking for an easy way to write the function I'm not entirely convinced that Functor is a strong enough constraint, but I'll use it for concreteness. I want ...

[ 0.00286865234375, 0.027587890625, -0.002532958984375, 0.009765625, -0.01129150390625, 0.0125732421875, -0.036865234375, -0.02587890625, 0.0091552734375, -0.021484375, -0.0283203125, -0.01361083984375, 0.0179443359375, 0.0224609375, -0.01422119140625, 0.0020599365234375, -0.0126953125...

[ 9082, 84382, 22288, 37839, 14256, 50836, 7477, 18770, 1556, 142508, 28670, 11809, 26455, 11728, 297, 2609, 69253, 992, 16487, 23468, 3917, 33022, 32354, 122991, 37515, 158, 2816, 4288, 4527, 122776, 3444, 19048, 59911, 3229, 1238, 10644, 10846,...

[ 0.1695556640625, 0.0941162109375, 0.1715087890625, 0.1549072265625, 0.08905029296875, 0.2210693359375, 0.11474609375, 0.180419921875, 0.13330078125, 0.2314453125, 0.1378173828125, 0.07257080078125, 0.148681640625, 0.1932373046875, 0.00531005859375, 0.179931640625, 0.05316162109375, ...

embed

53773487_c1

53773487

haskell

1

writeMarkdown def thing) case md' of Left _ -> print "Damn" Right md -> writeFile "my.md" (T.unpack md) -- https://www.gwern.net/haskell/goodreadsToMarkdown.hs colHeaders :: [Blocks] colHeaders = map singleton [ Plain [Str "Title"] , Plain [Str "Author"] ] testRow = map singleton [ Plain [Str "Col 1"] , Plain [Str "Col...

[ 0.00543212890625, -0.002960205078125, -0.01251220703125, 0.0208740234375, -0.007415771484375, -0.00390625, 0.01104736328125, -0.01385498046875, -0.0074462890625, -0.00665283203125, -0.004486083984375, -0.00098419189453125, 0.00860595703125, 0.01434326171875, -0.0032501220703125, -0.003...

[ 33022, 73484, 34695, 8, 420, 13580, 7225, 347, 71, 25, 111, 636, 2480, 33079, 28412, 397, 302, 19, 90911, 174350, 1176, 5, 54686, 618, 309, 29102, 6488, 10557, 142508, 70810, 39116, 7763, 127, 3365, 13025, 11, 14202, 166191, 22288, 11001,...

[ 0.23681640625, 0.2205810546875, 0.26953125, 0.1202392578125, 0.111328125, 0.22314453125, 0.1405029296875, 0.02435302734375, 0.1278076171875, 0.07666015625, 0.055908203125, 0.06671142578125, 0.1441650390625, 0.01715087890625, 0.1971435546875, 0.0587158203125, 0.1971435546875, 0.1413...

embed

26636328_c0

26636328

haskell

0

Title: Fusing traversals Problem title: Fusing traversals Tags: traversal, haskell-lens, haskell Problem: Fusing traversals The Traversable Paper gives an example on page 18-19 of fusing monoidal and monadic traversals which sounds really interesting but I'm confused by their LaTex. cciBody :: Char -> Count a wciBody :...

Fusing traversals Fusing traversals traversal haskell-lens haskell Fusing Char Count State Bool DotInASquare XInASquare Traversable Fusing traversals The Traversable Paper gives an example on page 18-19 of fusing monoidal and monadic traversals which sounds really interesting but I'm confused by their LaTex. With the a...

[ 0.00750732421875, 0.0016632080078125, -0.0019378662109375, 0.003631591796875, 0.00933837890625, 0.00408935546875, -0.00193023681640625, -0.033935546875, 0.00616455078125, -0.0218505859375, 0.01190185546875, 0.024658203125, -0.01348876953125, 0.00518798828125, -0.012939453125, -0.009460...

[ 7680, 6953, 37317, 16765, 289, 1556, 142508, 1977, 21656, 108210, 22836, 2460, 929, 84929, 4153, 94727, 39073, 19, 4937, 7864, 2886, 62323, 27781, 9191, 543, 8363, 57574, 214, 22460, 14, 2465, 136, 2667, 11, 18403, 102678, 49041, 55681, 239...

[ 0.1932373046875, 0.1175537109375, 0.225830078125, 0.1192626953125, 0.04376220703125, 0.10040283203125, 0.23388671875, 0.11962890625, 0.1400146484375, 0.1585693359375, 0.09283447265625, 0.015350341796875, 0.07958984375, 0.06787109375, 0.1484375, 0.130615234375, 0.09869384765625, 0.0...

embed

57872727_c0

57872727

haskell

0

Title: Trouble with creating join when making monad instance of an object Problem title: Trouble with creating join when making monad instance of an object Tags: haskell, monads Problem: Trouble with creating join when making monad instance of an object I currently have a newtype instance which I should translate into ...

Trouble with creating join when making monad instance of an object Trouble with creating join when making monad instance of an object haskell monads Trouble Thing Show Functor Trouble with creating join when making monad instance of an object I currently have a newtype instance which I should translate into a monad. I ...

[ -0.01300048828125, 0.00634765625, 0.010009765625, -0.01318359375, -0.00144195556640625, 0.0269775390625, -0.00836181640625, -0.01031494140625, 0.0322265625, -0.02880859375, 0.0029144287109375, -0.022216796875, -0.0024566650390625, -0.0059814453125, -0.017578125, -0.010009765625, 0.00...

[ 119671, 2661, 678, 105233, 33284, 3229, 20662, 2667, 712, 110527, 36746, 1556, 142508, 6003, 214, 17367, 28670, 18770, 82424, 3525, 50986, 3900, 19309, 63134, 13204, 68557, 47, 61924, 51776, 1632, 17366, 7565, 203251, 59911, 32354, 1884, 221, ...

[ 0.13671875, 0.08477783203125, 0.044952392578125, 0.1871337890625, 0.2479248046875, 0.0218658447265625, 0.0924072265625, 0.1436767578125, 0.1925048828125, 0.1927490234375, 0.1650390625, 0.1087646484375, 0.2080078125, 0.1353759765625, 0.1146240234375, 0.12451171875, 0.07745361328125, ...

embed

19267344_c0

19267344

haskell

0

Title: How to evaluate an Haskell expression immediately? Problem title: How to evaluate an Haskell expression immediately? Tags: haskell, strict, evaluation Problem: How to evaluate an Haskell expression immediately? When I use JS, I have two options to handle a function. var a = function() {}; var b = a; // b is the ...

How to evaluate an Haskell expression immediately? How to evaluate an Haskell expression immediately? haskell strict evaluation How Haskell Anonymous How to evaluate an Haskell expression immediately? When I use JS, I have two options to handle a function. AFAIK, Haskell is lazy by default, so I always get b by default...

[ -0.004119873046875, 0.00579833984375, 0.011962890625, 0.005035400390625, 0.0252685546875, 0.01446533203125, 0.031005859375, 0.004119873046875, 0.0001735687255859375, -0.0303955078125, 0.000682830810546875, 0.0031280517578125, -0.001190185546875, -0.01348876953125, -0.003143310546875, -...

[ 11249, 47, 151575, 13, 20625, 142508, 125195, 109312, 1556, 81113, 219836, 180585, 142, 4527, 64977, 6626, 50717, 34831, 32354, 21, 3285, 114977, 11343, 2046, 876, 2174, 3444, 501, 3642, 831, 54, 28641, 3884, 2565, 143726, 31380, 318, 16750, ...

[ 0.085693359375, 0.06719970703125, 0.2364501953125, 0.1324462890625, 0.1455078125, 0.271240234375, 0.25390625, 0.2381591796875, 0.1165771484375, 0.1968994140625, 0.2197265625, 0.08856201171875, 0.03302001953125, 0.013671875, 0.1767578125, 0.1263427734375, 0.1617431640625, 0.08984375...

embed

19794508_c0

19794508

haskell

0

Title: Is there a standard way to match 2 lists with a custom matching function in Haskell? Problem title: Is there a standard way to match 2 lists with a custom matching function in Haskell? Tags: haskell Problem: Is there a standard way to match 2 lists with a custom matching function in Haskell? I know that a standa...

Is there a standard way to match 2 lists with a custom matching function in Haskell? Is there a standard way to match 2 lists with a custom matching function in Haskell? haskell Haskell Bool _:_ x:xs y:ys Is there a standard way to match 2 lists with a custom matching function in Haskell? I know that a standard way wou...

[ -0.005767822265625, 0.0135498046875, -0.0037994384765625, -0.0177001953125, -0.0111083984375, 0.01251220703125, 0.0032958984375, -0.002471923828125, 0.01495361328125, 0.0014190673828125, 0.01153564453125, -0.00124359130859375, -0.0038909912109375, -0.024169921875, -0.001983642578125, -...

[ 2685, 5570, 3917, 47, 14858, 116, 5303, 7, 678, 114122, 214, 32354, 23, 20625, 142508, 1556, 2460, 929, 4778, 5361, 12830, 115081, 50782, 110, 6226, 16487, 133, 138256, 68330, 3871, 20187, 140909, 107730, 5351 ]

[ 0.012054443359375, 0.2044677734375, 0.10577392578125, 0.0303802490234375, 0.2464599609375, 0.1611328125, 0.228759765625, 0.054229736328125, 0.08087158203125, 0.211181640625, 0.1138916015625, 0.187255859375, 0.035430908203125, 0.1259765625, 0.231689453125, 0.0833740234375, 0.025390625...

embed

22394562_c0

22394562

haskell

0

Title: How do you reify/walk a record definition in Haskell Problem title: How do you reify/walk a record definition in Haskell Tags: template-haskell, generics, haskell Problem: How do you reify/walk a record definition in Haskell Given an record (not an instance of the record, the record definition itself) such as: d...

How do you reify/walk a record definition in Haskell How do you reify/walk a record definition in Haskell template-haskell generics haskell How Haskell Request Expand Shorten LinkEdit Maybe Bool user_ts How do you reify/walk a record definition in Haskell Given an record (not an instance of the record, the record defin...

[ -0.0257568359375, 0.016845703125, 0.01531982421875, 0.016357421875, 0.006072998046875, 0.00994873046875, -0.00836181640625, -0.012451171875, 0.00109100341796875, -0.0281982421875, -0.01318359375, -0.041748046875, 0.009033203125, -0.01531982421875, 0.0034027099609375, 0.0115966796875, ...

[ 11249, 456, 40383, 94449, 17164, 80934, 20625, 142508, 64, 110934, 10557, 189534, 1556, 75616, 60075, 2940, 82990, 33, 12779, 125270, 2460, 929, 38937, 933, 54, 10, 23, 110527, 3642, 139392, 18151, 17368, 3004, 1295, 28987, 127689, 196631, 64...

[ 0.029510498046875, 0.1318359375, 0.24072265625, 0.2249755859375, 0.260498046875, 0.2366943359375, 0.1263427734375, 0.2247314453125, 0.03424072265625, 0.20654296875, 0.07958984375, 0.1824951171875, 0.10711669921875, 0.1007080078125, 0.06243896484375, 0.0582275390625, 0.09442138671875,...

embed

45110216_c0

45110216

haskell

0

Title: Trouble with haskell IO Problem title: Trouble with haskell IO Tags: io, haskell Problem: Trouble with haskell IO I am having difficulty understanding exactly how haskell processes input and output. As an example, here I am trying to take command line arguments of a list of data files, and put the contents of th...

Trouble with haskell IO Trouble with haskell IO io haskell input Trouble Read Doubles Handle Double Send x:xs ReadMode Trouble with haskell IO I am having difficulty understanding exactly how haskell processes input and output. As an example, here I am trying to take command line arguments of a list of data files, and ...

[ 0.00970458984375, 0.00177764892578125, 0.002899169921875, -0.00946044921875, -0.016845703125, 0.0247802734375, 0.0152587890625, -0.026123046875, -0.00171661376953125, -0.01556396484375, 0.0185546875, -0.041015625, 0.005950927734375, 0.004364013671875, -0.00732421875, -0.006072998046875...

[ 119671, 2661, 678, 1556, 142508, 17780, 22995, 107730, 4764, 107172, 10639, 133, 24044, 1022, 12, 425, 9083, 34844, 100094, 66161, 3642, 9433, 90, 136, 140992, 27781, 31577, 5646, 75101, 13315, 10750, 5303, 2053, 102158, 3884, 10941, 41929, 7...

[ 0.1695556640625, 0.1512451171875, 0.1273193359375, 0.1666259765625, 0.2379150390625, 0.23291015625, 0.2232666015625, 0.1668701171875, 0.1751708984375, 0.19482421875, 0.13720703125, 0.00689697265625, 0.1024169921875, 0.057037353515625, 0.033233642578125, 0.083251953125, 0.150756835937...

embed

69671742_c0

69671742

haskell

0

Title: Haskell: Replace a subString in a String without Data.List package Problem title: Haskell: Replace a subString in a String without Data.List package Tags: list, string, text, haskell-stack, haskell Problem: Haskell: Replace a subString in a String without Data.List package I'm very new in Haskell and I want to k...

Haskell: Replace a subString in a String without Data.List package Haskell: Replace a subString in a String without Data.List package list string text haskell-stack haskell Haskell Replace Data.List main::IO c:cs Graph Graphic Haskell: Replace a subString in a String without Data.List package I'm very new in Haskell an...

[ -0.014404296875, 0.00537109375, -0.0074462890625, 0.025146484375, -0.01019287109375, 0.0135498046875, -0.00958251953125, 0.01123046875, -0.0029296875, 0.0264892578125, 0.0091552734375, -0.0167236328125, 0, -0.01318359375, 0.011474609375, 0.0091552734375, 0.03076171875, 0.0145874023...

[ 20625, 142508, 853, 23935, 1614, 71713, 214, 23, 23351, 15490, 11809, 154663, 98169, 5303, 79315, 7986, 1556, 590, 2594, 5201, 17780, 4439, 6524, 11727, 189682, 12, 3525, 3444, 3714, 3642, 831, 91995, 1653, 13, 30524, 2565, 390, 15700, 1815...

[ 0.12158203125, 0.2259521484375, 0.09747314453125, 0.174560546875, 0.1881103515625, 0.20751953125, 0.1309814453125, 0.06207275390625, 0.2186279296875, 0.1290283203125, 0.1240234375, 0.165283203125, 0.1539306640625, 0.1092529296875, 0.1702880859375, 0.1273193359375, 0.1082763671875, ...

embed

30426720_c0

30426720

haskell

0

Title: Defining an infinite sequence of Fibonacci numbers using list comprehension in Haskell Problem title: Defining an infinite sequence of Fibonacci numbers using list comprehension in Haskell Tags: list-comprehension, haskell, functional-programming, fibonacci Problem: Defining an infinite sequence of Fibonacci num...

Defining an infinite sequence of Fibonacci numbers using list comprehension in Haskell Defining an infinite sequence of Fibonacci numbers using list comprehension in Haskell list-comprehension haskell functional-programming fibonacci list Defining Fibonacci Haskell Integer Defining an infinite sequence of Fibonacci num...

[ 0.01171875, 0.004974365234375, -0.005889892578125, 0.007354736328125, -0.0036163330078125, 0.010009765625, 0.005462646484375, 0.005340576171875, -0.0016937255859375, -0.0279541015625, 0.002685546875, -0.0196533203125, 0.0247802734375, 0.018798828125, 0.0062255859375, 0.0286865234375, ...

[ 88606, 449, 54241, 13, 40, 944, 3956, 3698, 20990, 52544, 101935, 17368, 5303, 46683, 3220, 6889, 20625, 142508, 23, 277, 4692, 1556, 123309, 28966, 809, 44401, 2806, 54, 903, 81979, 59619, 122753, 5122, 4527, 35773, 32354, 46741, 1984, 683...

[ 0.1917724609375, 0.028900146484375, 0.19580078125, 0.0831298828125, 0.061309814453125, 0.1419677734375, 0.059539794921875, 0.155517578125, 0.179931640625, 0.2196044921875, 0.1710205078125, 0.054931640625, 0.20361328125, 0.164306640625, 0.1683349609375, 0.039031982421875, 0.1383056640...

embed

30636767_c1

30636767

haskell

1

Gen world) But, this code does not works. import qualified System.Random.MWC as MWC import Control.Monad import Control.Monad.Primitive import Control.Monad.ST data World s = World { randomGen :: MWC.Gen (PrimState (ST s))} initWorld :: ST s (World s) initWorld = do gen <- MWC.create return $ World gen something gen = ...

[ -0.0250244140625, 0.005950927734375, -0.0074462890625, -0.0125732421875, 0.0213623046875, -0.004119873046875, 0.035400390625, -0.03955078125, -0.00457763671875, -0.053955078125, -0.004913330078125, 0.0341796875, -0.006927490234375, 0.0031890869140625, 0.01165771484375, -0.0004348754882...

[ 15937, 8999, 16, 4966, 903, 18151, 14602, 959, 43240, 24927, 217225, 12353, 126525, 3815, 594, 75590, 237, 46298, 441, 27131, 46674, 712, 5, 145111, 14, 4935, 8545, 2053, 6661, 91, 2203, 96759, 105376, 1984, 135206, 23, 217, 70646, 16992, ...

[ 0.24267578125, 0.217041015625, 0.05126953125, 0.05462646484375, 0.09442138671875, 0.2276611328125, 0.09228515625, 0.1573486328125, 0.171630859375, 0.1922607421875, 0.22412109375, 0.1199951171875, 0.1077880859375, 0.170166015625, 0.0254364013671875, 0.154052734375, 0.026641845703125, ...

embed

55775412_c1

55775412

haskell

1

#-} import Control.Monad ((>>=)) import Data.Vector.Unboxed (Unbox, Vector, freeze, (!)) import Data.Vector.Unboxed.Mutable (IOVector, new, write) import qualified Data.Vector.Unboxed.Mutable as VM unique' :: forall a . (Unbox a, Eq a) => [a] -> IO (Vector a, Vector Int) unique' vs = do let n = length vs idx <- VM.rep...

[ -0.01300048828125, 0.031494140625, 0.0118408203125, -0.00823974609375, 0.0189208984375, -0.01544189453125, -0.00994873046875, -0.0037841796875, 0.007049560546875, -0.031982421875, -0.0198974609375, 0.02099609375, 0.025634765625, 0.024658203125, -0.0233154296875, 0.00016307830810546875,...

[ 468, 9, 8152, 24927, 27131, 5, 46674, 712, 60494, 30813, 1369, 16, 11809, 26455, 18770, 14256, 11728, 297, 4, 2609, 4092, 731, 72896, 10685, 22819, 17780, 3525, 33022, 217225, 237, 43084, 36998, 25, 1984, 100, 5584, 10, 6, 15, 241, 864,...

[ 0.060577392578125, 0.05908203125, 0.0089111328125, 0.25390625, 0.261474609375, 0.07373046875, 0.1563720703125, 0.180908203125, 0.03082275390625, 0.0478515625, 0.04541015625, 0.003265380859375, 0.1820068359375, 0.2293701171875, 0.2166748046875, 0.12451171875, 0.2406005859375, 0.0744...

embed

37397614_c0

37397614

haskell

0

Title: Haskell XMonad configuration using readProcess Problem title: Haskell XMonad configuration using readProcess Tags: haskell, xmonad Problem: Haskell XMonad configuration using readProcess I'm trying to configure XMonad without actually understand the Haskell syntax. I run a gnome session with xmonad on top. I wan...

Haskell XMonad configuration using readProcess Haskell XMonad configuration using readProcess haskell xmonad readProcess Haskell XMonad xK_g xmonad.hs:169:12 Couldn Haskell XMonad configuration using readProcess I'm trying to configure XMonad without actually understand the Haskell syntax. I run a gnome session with xm...

[ -0.0169677734375, 0.0169677734375, -0.013671875, 0.0069580078125, 0.01422119140625, 0.0166015625, 0.0020294189453125, -0.024658203125, -0.00119781494140625, -0.04833984375, 0.025146484375, -0.0047607421875, -0.0206298828125, -0.006439208984375, 0.01214599609375, -0.00872802734375, -0...

[ 20625, 142508, 1193, 46674, 712, 180346, 17368, 12301, 10752, 26531, 1556, 1022, 3796, 605, 177, 127, 141492, 20927, 191147, 222495, 28219, 6002, 86531, 11675, 64970, 56002, 678, 2663, 24234, 2811, 9, 254, 47, 129384, 91133, 2174, 16138, 959,...

[ 0.1337890625, 0.25244140625, 0.1209716796875, 0.21435546875, 0.185791015625, 0.2315673828125, 0.061767578125, 0.201171875, 0.1737060546875, 0.1787109375, 0.08056640625, 0.0689697265625, 0.140625, 0.011871337890625, 0.047332763671875, 0.0258636474609375, 0.0609130859375, 0.034820556...

embed

43372853_c1

43372853

haskell

1

to be able to count on it happening. I'm concerned that if I add enough specialized variants to this file or that if I call lookupSorted from another module, GHC might eventually lean in favor of a small generated executable rather than a fast one. My understanding is that the SPECIALIZE pragma does not help in the si...

[ 0.004241943359375, 0.0181884765625, 0.0218505859375, -0.031982421875, 0.00469970703125, 0.00823974609375, -0.0003032684326171875, -0.024169921875, 0.006439208984375, 0.0098876953125, -0.00014972686767578125, -0.01007080078125, -0.01470947265625, 0.004608154296875, 0.004669189453125, -0...

[ 19048, 47, 54529, 98, 442, 123087, 142837, 15190, 20174, 5361, 29367, 20117, 7, 903, 11435, 87, 11782, 6713, 2037, 158240, 3674, 88996, 527, 73265, 13648, 155605, 65342, 10862, 19336, 139392, 71924, 2886, 4271, 100094, 224343, 568, 19157, 588...

[ 0.03466796875, 0.03009033203125, 0.1590576171875, 0.085693359375, 0.049285888671875, 0.116943359375, 0.1082763671875, 0.0958251953125, 0.093994140625, 0.19775390625, 0.12353515625, 0.2406005859375, 0.00103759765625, 0.004791259765625, 0.17333984375, 0.002288818359375, 0.0315551757812...

embed

65726180_c0

65726180

haskell

0

Title: Acces foreign library from cabal2nix in andother derivation Problem title: Acces foreign library from cabal2nix in andother derivation Tags: ffi, haskell, nix Problem: Acces foreign library from cabal2nix in andother derivation I'm building Haskell foreign library using nix with cabal2nix. After build ./result/ ...

Acces foreign library from cabal2nix in andother derivation Acces foreign library from cabal2nix in andother derivation ffi haskell nix cabal2nix /engine/default.nix Acces libroman.so ghc-8.8.4 pkgs.haskellPackages.callCabal2nix default.nix pkgs.qt5.mkDerivation pkgs.qt5.qmake pkgs.qt5.qtbase b10shv9yqbgps47y0n8x7l7bq8...

[ 0.0205078125, -0.00909423828125, -0.0198974609375, -0.005035400390625, -0.00213623046875, 0.007171630859375, -0.00151824951171875, 0.01458740234375, 0.0022125244140625, -0.041748046875, -0.00048065185546875, -0.037353515625, 0.01287841796875, 0.021484375, -0.013916015625, -0.0286865234...

[ 29899, 90, 110613, 35773, 1294, 1295, 109524, 304, 93, 425, 23, 136, 126340, 30057, 24500, 1556, 142508, 300, 128897, 214810, 7750, 669, 991, 31380, 238, 17376, 163883, 8517, 10557, 205956, 85763, 3571, 114977, 47731, 3984, 37382, 3609, 7870,...

[ 0.14794921875, 0.053985595703125, 0.2052001953125, 0.22216796875, 0.1180419921875, 0.06927490234375, 0.2034912109375, 0.129638671875, 0.11865234375, 0.1295166015625, 0.036407470703125, 0.068603515625, 0.1656494140625, 0.1707763671875, 0.1102294921875, 0.08251953125, 0.17822265625, ...

embed

43692774_c0

43692774

haskell

0

Title: "PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 Problem title: "PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 Tags: audio, haskell, wav Problem: "PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 I am attempting to play a ....

"PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 "PCM only for now" error, called at ./Data/WAVE.hs:127:11 in WAVE-0.1.3 audio haskell wav Data.WAVE HasCallStack PCM Data WAVE.hs:127:11 WAVE-0.1.3 myrecording.wav PlayWave PlayWav.hs CallStack WAVE-0.1.3-EDUsomPiULdBJaA1HF9vpg:...

[ -0.0159912109375, -0.0064697265625, -0.0035400390625, 0.01458740234375, 0.0228271484375, 0.02978515625, 0.00014972686767578125, -0.0311279296875, -0.00145721435546875, -0.04248046875, -0.004486083984375, -0.033203125, 0.01434326171875, -0.028076171875, -0.00927734375, -0.00680541992187...

[ 12233, 594, 4734, 100, 5036, 41502, 18499, 35839, 99, 137989, 1456, 65298, 127, 133249, 19993, 601, 23320, 81046, 18215, 1556, 142508, 259, 334, 11809, 20625, 441, 5584, 42378, 2594, 6107, 759, 32271, 634, 11356, 22489, 272, 3818, 26265, 17...

[ 0.177001953125, 0.23046875, 0.216796875, 0.210693359375, 0.283203125, 0.057159423828125, 0.2095947265625, 0.1168212890625, 0.0670166015625, 0.136962890625, 0.13623046875, 0.25146484375, 0.1253662109375, 0.2020263671875, 0.1942138671875, 0.136962890625, 0.1190185546875, 0.2186279296...

embed

4482987_c0

4482987

haskell

0

Title: How about Haskell's GC performance for soft realtime application like games? Problem title: How about Haskell's GC performance for soft realtime application like games? Tags: haskell, performance, real-time, soft-real-time, garbage-collection Problem: How about Haskell's GC performance for soft realtim...

How about Haskell's GC performance for soft realtime application like games? How about Haskell's GC performance for soft realtime application like games? haskell performance real-time soft-real-time garbage-collection How Haskell How about Haskell's GC performance for soft realtime application like games? Bec...

[ 0.00457763671875, 0.021484375, 0.0198974609375, -0.0162353515625, 0.00762939453125, -0.021240234375, -0.0250244140625, -0.00122833251953125, 0.0023651123046875, -0.0184326171875, 0.016357421875, 0.003997802734375, 0.00189208984375, 0.004058837890625, -0.00445556640625, 0.01123046875, ...

[ 11249, 1672, 20625, 142508, 3768, 69657, 23718, 100, 32977, 2773, 6032, 38415, 1884, 27528, 1556, 30544, 3671, 402, 429, 196352, 185171, 6712, 79986, 62775, 5608, 34831, 58696, 27140, 179635, 17368, 351, 46280, 46876, 44457, 23, 35311, 26499, ...

[ 0.0689697265625, 0.038909912109375, 0.1492919921875, 0.264892578125, 0.044586181640625, 0.2181396484375, 0.1920166015625, 0.03955078125, 0.1998291015625, 0.144775390625, 0.099853515625, 0.13720703125, 0.08270263671875, 0.1357421875, 0.1080322265625, 0.0936279296875, 0.033905029296875...

embed

78312887_c1

78312887

haskell

1

wrap the inside of the Maybe , which is a , but the whole Maybe a . If StateT had to resemble MaybeT (in this fact of using m to wrap the whole thing), it would have been like this newtype StateT' s m a = StateT' { runStateT' :: m (s -> (a,s)) } About this, some thoughts come to mind: What would have been wrong with i...

[ -0.0228271484375, 0.0031585693359375, 0.009521484375, -0.003448486328125, 0.00604248046875, -0.00604248046875, 0.000202178955078125, -0.01409912109375, 0.00897216796875, 0.002899169921875, 0.011474609375, 0.01141357421875, -0.01361083984375, 0.019287109375, -0.006866455078125, -0.00964...

[ 137565, 70, 46132, 111, 83425, 3129, 83, 10, 1284, 28271, 22836, 618, 1902, 102337, 40099, 17368, 347, 47, 13580, 2806, 765, 2809, 1884, 3525, 50986, 25, 11675, 135206, 33079, 11, 4, 7, 903, 38514, 7086, 4865, 44691, 678, 4263, 33720, 4...

[ 0.275146484375, 0.046661376953125, 0.208740234375, 0.028594970703125, 0.308349609375, 0.0240631103515625, 0.051361083984375, 0.15869140625, 0.1134033203125, 0.1732177734375, 0.2012939453125, 0.204833984375, 0.018890380859375, 0.10003662109375, 0.10345458984375, 0.062347412109375, 0.1...

embed

78976457_c0

78976457

haskell

0

Title: is something wrong with my compiler or my syntax inn Problem title: is something wrong with my compiler or my syntax inn Tags: haskell, parse-error Problem: is something wrong with my compiler or my syntax inn im new to haskell and when i tried some basic syntax it seems to not work the way it is supposed to wor...

is something wrong with my compiler or my syntax inn is something wrong with my compiler or my syntax inn haskell parse-error n-1 main.hs:5:9 main::IO Integer main.hs:4:12 Suggested Perhaps e.g is something wrong with my compiler or my syntax inn im new to haskell and when i tried some basic syntax it seems to not work...

[ -0.006195068359375, 0.01507568359375, 0.0026092529296875, 0.0028839111328125, -0.0245361328125, 0.01202392578125, -0.0025787353515625, -0.016357421875, -0.009765625, -0.0235595703125, -0.01031494140625, -0.0140380859375, -0.01507568359375, -0.013671875, 0.015380859375, -0.0039978027343...

[ 83, 9844, 44691, 678, 759, 9969, 34759, 707, 6002, 86531, 2083, 1556, 142508, 366, 184, 188800, 653, 5759, 5201, 127, 7, 758, 1126, 17780, 44401, 20927, 104235, 429, 181799, 177, 566, 3525, 37842, 62822, 37202, 959, 4488, 3917, 134598, 33...

[ 0.041534423828125, 0.110595703125, 0.1771240234375, 0.062744140625, 0.041748046875, 0.1556396484375, 0.1917724609375, 0.0291900634765625, 0.0931396484375, 0.168212890625, 0.2449951171875, 0.1593017578125, 0.2454833984375, 0.147705078125, 0.13916015625, 0.1690673828125, 0.089111328125...

embed

67581811_c0

67581811

haskell

0

Title: Unique elements from a list according to a subset of fields Problem title: Unique elements from a list according to a subset of fields Tags: duplicates, haskell, list, unique Problem: Unique elements from a list according to a subset of fields Given a record like data Foo = Foo { fooName :: Text, fooAge :: Int, ...

Unique elements from a list according to a subset of fields Unique elements from a list according to a subset of fields duplicates haskell list unique a Unique Foo Text London York Paris Madrid Los Angeles Berlin Unique elements from a list according to a subset of fields Given a record like With a list of such element...

[ -0.00063323974609375, 0.011474609375, 0.00604248046875, 0.00009870529174804688, -0.0047607421875, 0.006805419921875, 0.0048828125, 0.00653076171875, 0.0203857421875, -0.0159912109375, -0.0162353515625, 0.01708984375, 0.023681640625, -0.00020503997802734375, -0.025634765625, -0.01385498...

[ 11789, 944, 80854, 1295, 5303, 59499, 1614, 3509, 44457, 171763, 1636, 1556, 142508, 36998, 9572, 31, 24129, 9020, 5753, 7270, 8884, 3731, 31754, 10271, 17164, 1884, 6044, 2685, 10, 32354, 47, 87388, 4734, 3299, 170933, 397, 2037, 75358, 58...

[ 0.2396240234375, 0.16162109375, 0.241943359375, 0.110595703125, 0.20361328125, 0.12451171875, 0.1484375, 0.1483154296875, 0.2091064453125, 0.265380859375, 0.178466796875, 0.1304931640625, 0.2403564453125, 0.281494140625, 0.22265625, 0.162353515625, 0.1990966796875, 0.183837890625, ...

embed

69757249_c0

69757249

haskell

0

Title: Haskell stack test cabal file inro not found Problem title: Haskell stack test cabal file inro not found Tags: haskell, haskell-stack, ghci Problem: Haskell stack test cabal file inro not found I got this message after trying to run stack test. Now I don't know what to do Cabal file info not found for tasty-1.4....

Haskell stack test cabal file inro not found Haskell stack test cabal file inro not found haskell haskell-stack ghci file Haskell Cabal tasty-1.4.2 sha256:b124f1f5db8291e547254e3b52e94e091fb020b97421c6824fcb9df3a9d143a8 Selected s3.amazonaws.com hackage.fpcomplete.com Downloading Updating Updated Calculating Populating...

[ 0.012451171875, 0.00823974609375, 0.006561279296875, 0.0213623046875, -0.00592041015625, -0.004119873046875, -0.016357421875, 0.000244140625, -0.00927734375, 0.02685546875, 0.006591796875, -0.03564453125, -0.0074462890625, 0.01068115234375, 0.0235595703125, 0.01214599609375, 0.004028...

[ 20625, 142508, 177261, 3034, 109524, 11435, 23, 516, 959, 14037, 1556, 590, 2594, 31380, 318, 30438, 289, 308, 8946, 117904, 9638, 127892, 109589, 363, 85526, 4588, 131801, 4857, 28641, 212467, 157890, 1916, 11648, 190355, 12745, 202567, 11832,...

[ 0.146240234375, 0.2349853515625, 0.207763671875, 0.168701171875, 0.2318115234375, 0.1875, 0.1246337890625, 0.2276611328125, 0.0831298828125, 0.1241455078125, 0.119873046875, 0.10107421875, 0.05810546875, 0.113525390625, 0.130126953125, 0.1602783203125, 0.150634765625, 0.11511230468...

embed

59530041_c1

59530041

haskell

1

/ghci-script Prelude> :load Script.hs [1 of 1] Compiling Script ( Script.hs, interpreted ) Stacko.hs:7:1: error: Could not find module ‘Data.Set’ Perhaps you meant Data.Int (from base-4.11.1.0) Use -v to see a list of the files searched for. | 7 | import qualified Data.Set as Set (Set, fromList) | ^^^^^^^^^^^^^^^^^^^^^...

[ -0.00335693359375, -0.00006580352783203125, -0.004364013671875, 0.0225830078125, -0.00347900390625, 0.01141357421875, 0.0230712890625, -0.0023193359375, 0.00604248046875, -0.01318359375, -0.003997802734375, -0.016845703125, 0.00982666015625, -0.000858306884765625, -0.006866455078125, 0...

[ 9486, 318, 32032, 1914, 822, 112, 63033, 84654, 127, 7, 15612, 49725, 29481, 6512, 60635, 966, 19721, 18499, 191147, 959, 7413, 88996, 137989, 5, 294, 126, 181799, 11809, 4153, 18, 161063, 3647, 11565, 14556, 102107, 334, 5303, 102158, 3393...

[ 0.1268310546875, 0.166015625, 0.177734375, 0.07623291015625, 0.1505126953125, 0.103271484375, 0.148681640625, 0.217041015625, 0.1485595703125, 0.052459716796875, 0.1036376953125, 0.1031494140625, 0.131591796875, 0.1182861328125, 0.18701171875, 0.02716064453125, 0.075927734375, 0.14...

embed

11076461_c1

11076461

haskell

1

], Int, [Int], Int) gameRound :: GameState -> Int -> GameState gameRound (Deal, toDeal, toBurn, inPlay, tied, numPlayers, pWins, dWins) card | toDeal > 0 = -- not enough card, deal a card (Deal, toDeal - 1, 0, card:inPlay, tied, numPlayers, pWins, dWins) | toDeal == 0 = -- enough cards in play now -- here should detemi...

[ -0.023681640625, -0.004119873046875, 0.007781982421875, -0.01318359375, -0.0003376007080078125, -0.001617431640625, -0.0128173828125, -0.0198974609375, 0.0096435546875, 0.03564453125, 0.0029296875, 0.0576171875, -0.028076171875, 0.01141357421875, -0.0186767578125, -0.0084228515625, -...

[ 360, 18, 4153, 6712, 12724, 7030, 13547, 135206, 4657, 289, 47, 87336, 19, 23, 97054, 146543, 13269, 142581, 92049, 104, 20596, 757, 959, 20174, 35142, 106, 73, 126381, 11301, 5036, 8, 67, 2962, 2499, 21941, 23180, 4817, 11341, 117058, 15...

[ 0.056640625, 0.05841064453125, 0.0148468017578125, 0.0740966796875, 0.120849609375, 0.1231689453125, 0.1234130859375, 0.16748046875, 0.1783447265625, 0.138916015625, 0.1390380859375, 0.1566162109375, 0.041656494140625, 0.10626220703125, 0.1707763671875, 0.15087890625, 0.112548828125,...

embed

17114899_c0

17114899

haskell

0

Title: Inconsistent Eq and Ord instances? Problem title: Inconsistent Eq and Ord instances? Tags: haskell, typeclass Problem: Inconsistent Eq and Ord instances? I have a large Haskell program which is running dismayingly slow. Profiling and testing has revealed that a large fraction of the time is spend comparing equal...

Inconsistent Eq and Ord instances? Inconsistent Eq and Ord instances? haskell typeclass Inconsistent Ord BigThing Inconsistent Eq and Ord instances? I have a large Haskell program which is running dismayingly slow. Profiling and testing has revealed that a large fraction of the time is spend comparing equality and orde...

[ 0.0135498046875, -0.005218505859375, 0.01202392578125, 0.005615234375, 0.00067138671875, 0.0162353515625, -0.00531005859375, -0.02978515625, 0.0172119140625, 0.018310546875, 0.0107421875, 0.01141357421875, 0.0228271484375, -0.0052490234375, -0.0086669921875, -0.0074462890625, -0.0046...

[ 360, 25553, 6892, 241, 864, 136, 35379, 110527, 18, 1556, 142508, 10644, 67413, 14195, 20800, 214, 21334, 20625, 1528, 51042, 11354, 72803, 58848, 134234, 122273, 175921, 1733, 47445, 37397, 28, 161789, 12989, 2053, 50986, 4552, 5526, 83, 802...

[ 0.08575439453125, 0.172607421875, 0.2181396484375, 0.097900390625, 0.214111328125, 0.140869140625, 0.247314453125, 0.25537109375, 0.0220489501953125, 0.121337890625, 0.2135009765625, 0.107177734375, 0.141845703125, 0.1260986328125, 0.2191162109375, 0.1015625, 0.03466796875, 0.11474...

embed

25889388_c0

25889388

haskell

0

Title: How can I easily express that I don't care about a value of a particular data field? Problem title: How can I easily express that I don't care about a value of a particular data field? Tags: hspec, haskell Problem: How can I easily express that I don't care about a value of a particular data field? I w...

How can I easily express that I don't care about a value of a particular data field? How can I easily express that I don't care about a value of a particular data field? hspec haskell How Block Assignment LVar Number t.x LFieldRef StringLiteral How can I easily express that I don't care about a value of a par...

[ -0.0038909912109375, -0.001129150390625, -0.00005245208740234375, -0.0028839111328125, -0.002227783203125, 0.00092315673828125, 0.0299072265625, -0.015869140625, 0.01220703125, 0.025390625, 0.0125732421875, 0.00579833984375, 0.0032501220703125, -0.005645751953125, -0.005950927734375, 0...

[ 11249, 831, 72546, 36510, 450, 87, 2301, 3768, 18, 517, 1672, 34292, 17311, 2053, 44457, 111, 1096, 16711, 1556, 142508, 80231, 1301, 31304, 147, 103332, 425, 6159, 19388, 190015, 23351, 720, 32562, 109921, 366, 2189, 55300, 13648, 2965, 20...

[ 0.041290283203125, 0.027496337890625, 0.1783447265625, 0.19287109375, 0.05535888671875, 0.0859375, 0.108642578125, 0.029571533203125, 0.1519775390625, 0.2197265625, 0.111328125, 0.217041015625, 0.118408203125, 0.1263427734375, 0.214599609375, 0.045745849609375, 0.03363037109375, 0....

embed

37852078_c1

37852078

haskell

1

Names pid name I think I am doing something wrong when I call getPlaceNames and return the names. I am not even sure if I should use the 'do' statement in getPlaceNames. Error says Couldn't match expected type ‘[[Char]]’ with actual type ‘IO [String]’ In a stmt of a 'do' block: c <- runX $ doc >>> css "alternateNames" ...

[ -0.00008344650268554688, 0.003509521484375, -0.000629425048828125, -0.0037689208984375, 0.00133514404296875, -0.000492095947265625, 0.0235595703125, -0.0245361328125, 0.0011444091796875, -0.0164794921875, 0.00099945068359375, -0.01373291015625, -0.01312255859375, -0.01409912109375, 0.003...

[ 15757, 7, 45226, 9351, 5351, 444, 20594, 9844, 44691, 11782, 2046, 683, 143, 329, 163612, 30646, 70, 123055, 9077, 4527, 246, 63805, 212059, 191147, 18, 14858, 84751, 10644, 84068, 8561, 17780, 71713, 214, 6138, 46389, 501, 11675, 1542, 365...

[ 0.1827392578125, 0.121337890625, 0.2354736328125, 0.1368408203125, 0.0908203125, 0.001617431640625, 0.0679931640625, 0.0280914306640625, 0.1678466796875, 0.09375, 0.151611328125, 0.0440673828125, 0.176513671875, 0.110107421875, 0.2452392578125, 0.166015625, 0.0148468017578125, 0.17...

embed

75600985_c0

75600985

haskell

0

Title: How can I use ghcid allow-eval with cabal Problem title: How can I use ghcid allow-eval with cabal Tags: cabal, ghcid, haskell-stack, haskell Problem: How can I use ghcid allow-eval with cabal I have a Stack based project and with the following: ghcid --command 'stack ghci' --allow-eval --clear --no-height-limit...

How can I use ghcid allow-eval with cabal How can I use ghcid allow-eval with cabal cabal ghcid haskell-stack haskell How ghcid.log unit_simple_single Variable SuiteRuntimeTest How can I use ghcid allow-eval with cabal I have a Stack based project and with the following: ghcid --command 'stack ghci' --allow-eval --clea...

[ 0.003936767578125, -0.00244140625, 0.00701904296875, 0.0081787109375, -0.004119873046875, -0.006683349609375, 0.0201416015625, 0.0211181640625, 0.007476806640625, -0.0262451171875, 0.005859375, -0.0179443359375, -0.01708984375, -0.0032196044921875, -0.004913330078125, -0.0145263671875,...

[ 11249, 831, 4527, 31380, 55964, 63769, 13, 1405, 678, 109524, 1556, 142508, 590, 2594, 4867, 25072, 191560, 6953, 84572, 2886, 74899, 163321, 6032, 111337, 6512, 35509, 13452, 12018, 318, 41566, 119488, 1106, 22553, 93343, 31, 71924, 159258, ...

[ 0.036346435546875, 0.0273590087890625, 0.1268310546875, 0.1402587890625, 0.244384765625, 0.23828125, 0.0980224609375, 0.2425537109375, 0.0997314453125, 0.25634765625, 0.082763671875, 0.188232421875, 0.0743408203125, 0.1243896484375, 0.1624755859375, 0.129150390625, 0.0924072265625, ...

embed

33107871_c0

33107871

haskell

0

Title: Implementing game states using reactive-banana Problem title: Implementing game states using reactive-banana Tags: haskell, reactive-banana, reactive-programming Problem: Implementing game states using reactive-banana In my breakout implementation there are two main behaviors that describe the game's main state:...

Implementing game states using reactive-banana Implementing game states using reactive-banana haskell reactive-banana reactive-programming reactive-banana Implementing Behavior Point Event Implementing game states using reactive-banana In my breakout implementation there are two main behaviors that describe the game's ...

[ 0.003631591796875, 0.004486083984375, 0.00177001953125, 0.0068359375, -0.0155029296875, 0.007568359375, -0.00604248046875, 0.00994873046875, 0.004669189453125, -0.021240234375, 0.013671875, -0.0218505859375, -0.0069580078125, 0.024658203125, -0.01611328125, 0.000059604644775390625, 0...

[ 153941, 6712, 117249, 17368, 456, 71232, 105281, 11, 1556, 142508, 28966, 98409, 41097, 36943, 36356, 6056, 208124, 6626, 5201, 123166, 98363, 11341, 149766, 29479, 1053, 2594, 192134, 1984, 808, 81604, 114419, 156673, 46312, 47353, 16446, 19069,...

[ 0.188720703125, 0.1527099609375, 0.1884765625, 0.0771484375, 0.111572265625, 0.22119140625, 0.1824951171875, 0.1689453125, 0.08935546875, 0.19677734375, 0.09368896484375, 0.131591796875, 0.09637451171875, 0.170166015625, 0.12353515625, 0.1649169921875, 0.1737060546875, 0.0797729492...

embed

28399634_c0

28399634

haskell

0

Title: Haskell Eclipse Linux and Buildwrapper Problem title: Haskell Eclipse Linux and Buildwrapper Tags: eclipse, haskell, linux Problem: Haskell Eclipse Linux and Buildwrapper I am kind of new Eclipse user, and Haskell too. I keep trying to understand what is wrong and what to do, as my Eclipse after I installed Hask...

Haskell Eclipse Linux and Buildwrapper Haskell Eclipse Linux and Buildwrapper eclipse haskell linux Haskell Eclipse Linux Buildwrapper Configuring Test1-0.1 Left dynamic-cabal.23 Cabal-1.22.0.0 setup_config Resolving Haskell Eclipse Linux and Buildwrapper I am kind of new Eclipse user, and Haskell too. I keep trying to...

[ 0.00086212158203125, 0.0191650390625, -0.0032196044921875, 0.00994873046875, -0.00101470947265625, -0.01116943359375, -0.0216064453125, -0.00555419921875, -0.0040283203125, 0.0145263671875, -0.0098876953125, -0.0194091796875, 0.000537872314453125, 0.027587890625, 0.01019287109375, -0.0...

[ 20625, 142508, 234962, 29908, 136, 121137, 5429, 11, 8079, 106371, 184, 1556, 11508, 59994, 8647, 20268, 102014, 636, 2480, 84079, 408, 3571, 3742, 30438, 289, 5759, 4015, 99929, 169581, 153837, 132944, 3525, 38937, 31577, 28219, 44691, 7103, ...

[ 0.1590576171875, 0.256591796875, 0.233642578125, 0.1728515625, 0.04681396484375, 0.1693115234375, 0.148193359375, 0.1468505859375, 0.1434326171875, 0.1444091796875, 0.012908935546875, 0.0941162109375, 0.054901123046875, 0.1453857421875, 0.159423828125, 0.013824462890625, 0.1069946289...

embed

41456869_c0

41456869

haskell

0

Title: How to make lenses for records with type-families Problem title: How to make lenses for records with type-families Tags: lenses, type-families, haskell-lens, haskell Problem: How to make lenses for records with type-families Here's what I've got, which is not compiling: {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE...

How to make lenses for records with type-families How to make lenses for records with type-families lenses type-families haskell-lens haskell Data.Text Data.Int Control.Lens How LANGUAGE TypeFamilies StandaloneDeriving FlexibleInstances TemplateHaskell MultiParamTypeClasses FunctionalDependencies Int64 Incoming Validat...

[ -0.005157470703125, -0.020263671875, -0.0050048828125, -0.00084686279296875, -0.000499725341796875, 0.012939453125, -0.0233154296875, -0.0106201171875, 0.00640869140625, -0.024658203125, 0.007080078125, -0.004730224609375, 0.0235595703125, 0.00127410888671875, -0.00119781494140625, -0....

[ 11249, 3249, 96, 47754, 100, 115923, 678, 10644, 69128, 47, 1556, 142508, 1977, 11809, 174379, 27131, 866, 1755, 98064, 60457, 919, 1191, 51684, 180842, 2661, 116071, 196631, 6495, 7, 19335, 55292, 196707, 140803, 26885, 13307, 277, 25447, 18...

[ 0.01806640625, 0.1229248046875, 0.1688232421875, 0.2142333984375, 0.07183837890625, 0.1961669921875, 0.1099853515625, 0.2088623046875, 0.1622314453125, 0.007232666015625, 0.109619140625, 0.192626953125, 0.1727294921875, 0.020660400390625, 0.106201171875, 0.1160888671875, 0.0981445312...

embed

5949871_c1

5949871

haskell

1

GC time 2.34s ( 2.61s elapsed) EXIT time 0.00s ( 0.00s elapsed) Total time 3.16s ( 3.45s elapsed) %GC time 74.1% (75.7% elapsed) Alloc rate 2,522,515,156 bytes per MUT second Generation 0: 338539 collections, 0 parallel, 1.24s, 1.31s elapsed Generation 1: 2 collections, 0 parallel, 0.00s, 0.00s elapsed INIT time 0.00s...

[ -0.02978515625, 0.0126953125, -0.000736236572265625, -0.0185546875, 0.005859375, -0.005706787109375, -0.02880859375, -0.0308837890625, -0.00040435791015625, -0.0242919921875, 0.01361083984375, 0.024169921875, 0.009521484375, 0.00335693359375, 0.00506591796875, -0.0145263671875, 0.002...

[ 69657, 1733, 787, 10289, 7, 11540, 127966, 29426, 6371, 37509, 71, 16, 33867, 1031, 2485, 4633, 15124, 13961, 15, 6873, 14427, 3164, 6652, 34515, 16290, 1837, 155740, 390, 1636, 276, 17632, 17932, 83479, 757, 6, 128222, 188758, 42486, 4, ...

[ 0.256103515625, 0.2357177734375, 0.0574951171875, 0.221435546875, 0.028472900390625, 0.1341552734375, 0.159423828125, 0.16015625, 0.1630859375, 0.1339111328125, 0.005615234375, 0.005401611328125, 0.1181640625, 0.0260009765625, 0.13427734375, 0.07708740234375, 0.06842041015625, 0.07...

embed

13479126_c0

13479126

haskell

0

Title: How do I stop Gloss requiring an increasing amount of memory? Problem title: How do I stop Gloss requiring an increasing amount of memory? Tags: graphics, haskell Problem: How do I stop Gloss requiring an increasing amount of memory? I'm using gloss to create am RTS game in Haskell, but I've noticed that even a ...

How do I stop Gloss requiring an increasing amount of memory? How do I stop Gloss requiring an increasing amount of memory? graphics haskell Graphics.Gloss Graphics.Gloss.Interface.IO.Game How Gloss Main InWindow How do I stop Gloss requiring an increasing amount of memory? I'm using gloss to create am RTS game in Hask...

[ -0.0206298828125, 0.0081787109375, 0.003692626953125, 0.00787353515625, 0.01483154296875, 0.000522613525390625, -0.0002269744873046875, 0.000518798828125, 0.0012359619140625, -0.0272216796875, 0.03173828125, -0.0111083984375, -0.00457763671875, 0.0021514892578125, 0.01483154296875, 0.0...

[ 11249, 54, 7279, 46173, 7, 186607, 118055, 41170, 98323, 87, 449, 48461, 1556, 142508, 189682, 724, 2400, 17780, 107576, 12321, 360, 92049, 24293, 17368, 207244, 47, 28282, 444, 27389, 294, 6712, 20625, 4552, 8781, 1528, 1221, 143414, 1286, ...

[ 0.0660400390625, 0.03350830078125, 0.22119140625, 0.25390625, 0.230224609375, 0.1529541015625, 0.1666259765625, 0.042724609375, 0.2205810546875, 0.00244140625, 0.0076904296875, 0.1417236328125, 0.11962890625, 0.231201171875, 0.1654052734375, 0.0295257568359375, 0.2086181640625, 0.0...

embed

34772844_c0

34772844

haskell

0

Title: How to handle IO return values properly in Haskell Problem title: How to handle IO return values properly in Haskell Tags: io, functional-programming, haskell Problem: How to handle IO return values properly in Haskell Hi i have a very noob question, lets say i want to create a game when you have to answer quest...

How to handle IO return values properly in Haskell How to handle IO return values properly in Haskell io functional-programming haskell How Haskell Question answer::String text::String Player name::String points::String Bool How to handle IO return values properly in Haskell Hi i have a very noob question, lets say i w...

[ -0.015380859375, 0.0023956298828125, 0.0115966796875, 0.003936767578125, 0.0020294189453125, 0.016845703125, -0.01397705078125, -0.022216796875, -0.01300048828125, -0.010009765625, 0.0218505859375, -0.0224609375, 0.00091552734375, 0.00445556640625, -0.0126953125, -0.003326416015625, ...

[ 11249, 47, 34831, 17780, 30646, 142424, 155965, 23, 20625, 142508, 22995, 123309, 28966, 1556, 68185, 35166, 71713, 214, 7986, 60560, 9351, 26847, 2460, 929, 4552, 110, 3522, 9655, 3444, 28282, 6712, 765, 17582, 54397, 903, 5036, 58585, 7251,...

[ 0.0911865234375, 0.037384033203125, 0.1834716796875, 0.2352294921875, 0.26416015625, 0.175048828125, 0.184326171875, 0.03131103515625, 0.1461181640625, 0.25146484375, 0.224609375, 0.1558837890625, 0.0980224609375, 0.129638671875, 0.1307373046875, 0.143798828125, 0.12890625, 0.08996...

embed

66825800_c1

66825800

haskell

1

5.5.1, containers-0.5.5.0, containers-0.5.4.0, containers-0.5.3.1, containers-0.5.3.0, containers-0.5.2.1, containers-0.5.2.0, containers-0.5.1.0, containers-0.5.0.0, containers-0.4.2.1, containers-0.4.2.0, containers-0.4.1.0, containers-0.4.0.0, containers-0.3.0.0, containers-0.2.0.1, containers-0.2.0.0, containers-0....

[ -0.005615234375, 0.018798828125, 0.01043701171875, -0.007537841796875, -0.004669189453125, -0.01104736328125, -0.034912109375, -0.0123291015625, 0.00994873046875, 0.025390625, -0.0203857421875, -0.0284423828125, -0.0029754638671875, 0.0113525390625, 0.026611328125, 0.002227783203125, ...

[ 1892, 156627, 116419, 7, 93645, 187461, 151152, 97109, 132265, 68107, 73011, 102107, 99929, 121254, 170179, 102014, 38331, 206730, 2816, 1295, 38937, 30388, 144570, 6, 69112, 122887, 120518, 35782, 12620, 461, 44287, 79612, 5423, 2394, 6635, 16, ...

[ 0.0911865234375, 0.209716796875, 0.277099609375, 0.121337890625, 0.15185546875, 0.173095703125, 0.144775390625, 0.090576171875, 0.08544921875, 0.1168212890625, 0.07196044921875, 0.056610107421875, 0.0994873046875, 0.0474853515625, 0.006317138671875, 0.0269775390625, 0.0914306640625, ...

embed

50716754_c1

50716754

haskell

1

od :: MonadHandler m => m (HandlerSite m) It seems from these definitions that there should be a way for me to call getYesod from the AuthHandler monad but I can't figure out how. EDIT: I have updated yesod and its scaffolding to the latest version. I also modified validatePassword as follow: validatePassword u = do ap...

[ -0.03271484375, 0.0203857421875, 0.0028076171875, -0.00457763671875, -0.017822265625, -0.0010223388671875, -0.0108642578125, -0.0419921875, 0.00445556640625, -0.045166015625, 0.0079345703125, -0.000576019287109375, -0.00188446044921875, -0.003936767578125, -0.00970458984375, -0.0162353...

[ 229, 60331, 71, 135679, 603, 347, 44357, 294, 1486, 37202, 80934, 5608, 3917, 11782, 2046, 91480, 2199, 1295, 5655, 927, 2667, 712, 831, 26366, 3642, 150011, 2422, 23722, 2407, 42822, 11389, 73197, 44622, 67, 139117, 47416, 75, 54, 4027, ...

[ 0.1573486328125, 0.1966552734375, 0.15283203125, 0.24169921875, 0.215087890625, 0.142822265625, 0.08184814453125, 0.0809326171875, 0.1400146484375, 0.02197265625, 0.0887451171875, 0.022979736328125, 0.0782470703125, 0.140625, 0.1578369140625, 0.2183837890625, 0.299560546875, 0.0978...

embed

67298544_c0

67298544

haskell

0

Title: Haskell Converting or Dealing with Multiple Custom Data Types Problem title: Haskell Converting or Dealing with Multiple Custom Data Types Tags: haskell, ghci, types Problem: Haskell Converting or Dealing with Multiple Custom Data Types I am new to Haskell and am attempting to filter specific Custom Data types. ...

Haskell Converting or Dealing with Multiple Custom Data Types Haskell Converting or Dealing with Multiple Custom Data Types haskell ghci types Haskell Converting Dealing Multiple Custom Data Types Suit Hearts Rank Numeric Jack Card NormalCard Joker Bool Couldn Haskell Converting or Dealing with Multiple Custom Data Typ...

[ 0.00885009765625, 0.0020904541015625, -0.02099609375, 0.0026702880859375, -0.005157470703125, -0.004425048828125, -0.00958251953125, -0.006256103515625, 0.021240234375, 0.00860595703125, 0.0115966796875, -0.018310546875, 0.0031280517578125, 0.0004520416259765625, -0.0322265625, 0.00665...

[ 20625, 142508, 1657, 814, 90943, 678, 19335, 8705, 130664, 11809, 60457, 1556, 31380, 318, 52895, 1832, 60861, 134405, 93511, 21763, 23660, 28723, 156119, 145200, 2460, 929, 191147, 3525, 46312, 29458, 27958, 12877, 147756, 97595, 1507, 55681, ...

[ 0.1458740234375, 0.23779296875, 0.03302001953125, 0.1326904296875, 0.1185302734375, 0.0450439453125, 0.1053466796875, 0.0111083984375, 0.2291259765625, 0.1513671875, 0.19775390625, 0.1304931640625, 0.041595458984375, 0.08953857421875, 0.1763916015625, 0.131591796875, 0.15625, 0.195...

embed