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
36781050_c0	36781050	haskell	0	Title: difference between two monads: ErrorT e Identity v and Either e v Problem title: difference between two monads: ErrorT e Identity v and Either e v Tags: monads, haskell Problem: difference between two monads: ErrorT e Identity v and Either e v Can someone explain difference between ErrorT String Identity Integer...	difference between two monads: ErrorT e Identity v and Either e v difference between two monads: ErrorT e Identity v and Either e v monads haskell ErrorT Identity Either Integer difference between two monads: ErrorT e Identity v and Either e v Can someone explain difference between and Either String Integer ?	[ -0.0098876953125, 0.00506591796875, -0.00909423828125, 0.0155029296875, 0.021240234375, 0.0115966796875, -0.01171875, -0.0096435546875, -0.003814697265625, 0.01104736328125, 0.020751953125, -0.0174560546875, 0.018798828125, -0.00186920166015625, -0.004241943359375, -0.0030364990234375,...	[ 60212, 17721, 6626, 2667, 712, 7, 212059, 618, 28, 71257, 2481, 81, 136, 4565, 9319, 1556, 142508, 44401, 4171, 22008, 73342, 23351, 214 ]	[ 0.203125, 0.1363525390625, 0.103759765625, 0.119140625, 0.1820068359375, 0.009429931640625, 0.2041015625, 0.2060546875, 0.154052734375, 0.1798095703125, 0.1407470703125, 0.2451171875, 0.067626953125, 0.10205078125, 0.2191162109375, 0.07196044921875, 0.1884765625, 0.205078125, 0.0...	embed
52504234_c0	52504234	haskell	0	Title: How to merge two elements within a tuple in Haskell Problem title: How to merge two elements within a tuple in Haskell Tags: haskell Problem: How to merge two elements within a tuple in Haskell I'm new to Haskell, and was trying to merge strings within a tuple into one element. For example, if my input was ("Hel...	How to merge two elements within a tuple in Haskell How to merge two elements within a tuple in Haskell haskell How Haskell How to merge two elements within a tuple in Haskell I'm new to Haskell, and was trying to merge strings within a tuple into one element. For example, if my input was ("Hello","world",1), it would ...	[ 0.01434326171875, 0.0137939453125, -0.01171875, 0.034912109375, 0.005828857421875, 0.02099609375, -0.0213623046875, -0.0169677734375, 0.020751953125, 0.0072021484375, -0.005889892578125, -0.0101318359375, -0.00140380859375, 0.0242919921875, -0.01055908203125, 0.000030994415283203125, ...	[ 11249, 47, 42564, 6626, 80854, 28032, 370, 8705, 20625, 142508, 10, 23, 1556, 3525, 31577, 79315, 3934, 1632, 12830, 107730, 841, 13817, 32554, 17727, 140992, 8999 ]	[ 0.0751953125, 0.0321044921875, 0.251953125, 0.1658935546875, 0.214599609375, 0.1883544921875, 0.156494140625, 0.2568359375, 0.150390625, 0.2276611328125, 0.0380859375, 0.04608154296875, 0.1285400390625, 0.03631591796875, 0.039215087890625, 0.18017578125, 0.0684814453125, 0.08386230...	embed
19182990_c0	19182990	haskell	0	Title: What does `squares xs = [xx\|x<-xs]` means in Haskell? Problem title: What does `squares xs = [xx\|x<-xs]` means in Haskell? Tags: haskell, functional-programming Problem: What does `squares xs = [xx\|x<-xs]` means in Haskell? What does squares xs = [xx\|x<-xs] means. Like i understand [x*x\|x<-[1,2,3]] . T...	What does `squares xs = [xx\|x<-xs]` means in Haskell? What does `squares xs = [xx\|x<-xs]` means in Haskell? haskell functional-programming What Haskell What does `squares xs = [xx\|x<-xs]` means in Haskell? What does squares xs = [xx\|x<-xs] means. Like i understand [x*x\|x<-[1,2,3]] . To be precise, Where does ...	[ 0.01904296875, 0.0286865234375, 0.0128173828125, -0.02734375, 0.00811767578125, -0.00885009765625, -0.0034942626953125, 0.005279541015625, 0.01348876953125, 0.0101318359375, 0.0072021484375, -0.01141357421875, 0.004791259765625, -0.00982666015625, -0.0223388671875, -0.008544921875, 0...	[ 4865, 108047, 7, 1022, 2203, 425, 1639, 58745, 1230, 1277, 9, 26950, 20625, 142508, 1556, 123309, 28966, 9473, 378, 16093, 23, 28219, 133063, 96386, 134995, 78662, 91, 1380, 1295 ]	[ 0.0175933837890625, 0.2208251953125, 0.1419677734375, 0.18701171875, 0.1099853515625, 0.1387939453125, 0.1256103515625, 0.0609130859375, 0.05487060546875, 0.0355224609375, 0.0911865234375, 0.1116943359375, 0.10516357421875, 0.19580078125, 0.055877685546875, 0.0731201171875, 0.0593566...	embed
19424107_c0	19424107	haskell	0	Title: Trying to get the initials of 2 string in haskell Problem title: Trying to get the initials of 2 string in haskell Tags: haskell Problem: Trying to get the initials of 2 string in haskell initt [f:_] [l:_] = f ++ " " ++ l And then i call initt "First" "Last" I get an error, saying Couldn't match type 'Char' with...	Trying to get the initials of 2 string in haskell Trying to get the initials of 2 string in haskell haskell Trying f:_ l:_ First Last Trying to get the initials of 2 string in haskell And then i call I get an error, saying Couldn't match type 'Char' with '[Char]' I really don't get it.	[ 0.01239013671875, -0.0164794921875, -0.0002651214599609375, 0.006744384765625, -0.01171875, 0.0048828125, 0.00860595703125, -0.00726318359375, -0.00592041015625, -0.0234375, 0.022705078125, -0.0030364990234375, 0.00909423828125, 0.02001953125, -0.024169921875, -0.005523681640625, 0.0...	[ 40858, 2046, 61475, 7, 116, 79315, 1556, 142508, 23, 1238, 12, 454, 96, 23972, 21672, 70, 11782, 18499, 191147, 18, 14858, 10644, 84068, 678, 1065, 6183 ]	[ 0.0635986328125, 0.0638427734375, 0.1851806640625, 0.0635986328125, 0.13671875, 0.2008056640625, 0.1409912109375, 0.2020263671875, 0.00921630859375, 0.10693359375, 0.0911865234375, 0.060150146484375, 0.1090087890625, 0.103515625, 0.1358642578125, 0.0196990966796875, 0.113525390625, ...	embed
71000901_c0	71000901	haskell	0	Title: Block scope in Haskell? Problem title: Block scope in Haskell? Tags: haskell Problem: Block scope in Haskell? I've found block scope { and } in JavaSciprt after ES6 is useful in development, and frequently use for testing small code blocks including the same variable names in different versions side by side. How...	Block scope in Haskell? Block scope in Haskell? haskell Block Haskell Block scope in Haskell? I've found block scope { and } in JavaSciprt after ES6 is useful in development, and frequently use for testing small code blocks including the same variable names in different versions side by side. How do you do in Haskell? ...	[ 0.00116729736328125, 0.0181884765625, 0.0027313232421875, 0.00182342529296875, 0.015380859375, -0.0004062652587890625, 0.0089111328125, 0.0087890625, 0.01043701171875, 0.006439208984375, -0.004364013671875, 0.007232666015625, 0.012451171875, -0.0033416748046875, -0.000568389892578125, ...	[ 80231, 70820, 23, 20625, 142508, 32, 1556, 46389, 136, 41925, 25258, 3198, 7103, 9764, 910, 80234, 34754, 195409, 4527, 100, 134234, 19336, 18151, 5701, 77336, 123055, 12921, 11389, 5609, 54, 2965, 49086 ]	[ 0.251953125, 0.27685546875, 0.080078125, 0.158447265625, 0.243408203125, 0.0506591796875, 0.1307373046875, 0.2279052734375, 0.19384765625, 0.12890625, 0.0888671875, 0.160888671875, 0.06842041015625, 0.064453125, 0.10687255859375, 0.1502685546875, 0.10247802734375, 0.061981201171875...	embed
46909589_c0	46909589	haskell	0	Title: What is the equivalent of iterate function in haskell in c#? Problem title: What is the equivalent of iterate function in haskell in c#? Tags: haskell, c%23 Problem: What is the equivalent of iterate function in haskell in c#? We have iterate function in haskell Prelude iterate :: (a -> a) -> a -> [a] iterate f ...	What is the equivalent of iterate function in haskell in c#? What is the equivalent of iterate function in haskell in c#? haskell c%23 What What is the equivalent of iterate function in haskell in c#? We have iterate function in haskell Prelude What is the equivalent in C#?	[ 0.0006256103515625, 0.00592041015625, 0.0164794921875, -0.0022735595703125, -0.001800537109375, 0.0050048828125, 0.0078125, 0.006622314453125, 0.003997802734375, -0.044189453125, -0.0118408203125, -0.017333984375, -0.0033111572265625, -0.007232666015625, -0.0054931640625, 0.021484375, ...	[ 83, 183234, 17, 8560, 67, 32354, 23, 1556, 142508, 501, 4904, 4865, 111, 3949, 3742, 765, 1914, 822, 112, 70, 313 ]	[ 0.0289764404296875, 0.1888427734375, 0.08587646484375, 0.28564453125, 0.18701171875, 0.18798828125, 0.04473876953125, 0.1405029296875, 0.2275390625, 0.04754638671875, 0.179931640625, 0.03485107421875, 0.011688232421875, 0.045379638671875, 0.1298828125, 0.051788330078125, 0.0601501464...	embed
32692819_c1	32692819	haskell	1	(List(9,1,5,2,10,3) filterM keepSmall) ^ and Error:(182, 40) type mismatch; found : Int => scalaz.WriterT[scalaz.Scalaz.Id,Vector[String],Boolean] required: Int => M[Boolean] println(List(9,1,5,2,10,3) filterM keepSmall) ^ Code signals: Scalaz, Writer, Monad, Bool, Keeping, WriterT, Vector, Boolean, x.shows, List, Erro...	(List(9,1,5,2,10,3) filterM keepSmall) ^ and Error:(182, 40) type mismatch; found : Int => scalaz.WriterT[scalaz.Scalaz.Id,Vector[String],Boolean] required: Int => M[Boolean] println(List(9,1,5,2,10,3) filterM keepSmall) ^ Code signals: Scalaz, Writer, Monad, Bool, Keeping, WriterT, Vector, Boolean, x.shows, List, Erro...	[ -0.0157470703125, 0.02294921875, -0.0164794921875, -0.015869140625, 0.00909423828125, -0.007598876953125, -0.003204345703125, -0.0130615234375, 0.0028839111328125, 0.01385498046875, -0.011962890625, 0.006195068359375, -0.00341796875, -0.0029296875, -0.003387451171875, -0.00686645507812...	[ 154663, 1126, 57626, 304, 963, 21320, 46312, 594, 13695, 294, 69070, 212059, 117768, 1112, 10644, 1239, 98753, 14037, 360, 18, 146232, 169, 1456, 2783, 56, 618, 16275, 60660, 62309, 71, 26455, 18770, 71713, 31, 34677, 56065, 276, 12647, 284...	[ 0.2060546875, 0.140869140625, 0.1944580078125, 0.147705078125, 0.123779296875, 0.1552734375, 0.213623046875, 0.1278076171875, 0.1922607421875, 0.00726318359375, 0.2113037109375, 0.2183837890625, 0.1065673828125, 0.1900634765625, 0.201171875, 0.13525390625, 0.30029296875, 0.08508300...	embed
36701841_c0	36701841	haskell	0	Title: Matrix Identity in haskell without list Problem title: Matrix Identity in haskell without list Tags: haskell Problem: Matrix Identity in haskell without list I want to make an Identity matrix without list syntax or list functions for eg something with tuple (x,x) ...and i want to print it like *> showMatrix (mat...	Matrix Identity in haskell without list Matrix Identity in haskell without list haskell Matrix Identity Matrix Identity in haskell without list I want to make an Identity matrix without list syntax or list functions for eg something with tuple (x,x) ...and i want to print it like	[ -0.00872802734375, 0.0169677734375, 0.012939453125, 0.0223388671875, 0.02001953125, 0.015869140625, 0.0026397705078125, 0.0118408203125, 0.0079345703125, -0.004974365234375, -0.001861572265625, -0.0017242431640625, -0.0191650390625, 0.00390625, -0.0263671875, 0.0030975341796875, 0.02...	[ 194234, 71257, 2481, 23, 1556, 142508, 15490, 5303, 3444, 3249, 50944, 425, 6002, 86531, 32354, 30046, 9844, 678, 370, 8705, 28412, 442, 1884 ]	[ 0.254150390625, 0.2490234375, 0.16796875, 0.067138671875, 0.179443359375, 0.2484130859375, 0.1964111328125, 0.2149658203125, 0.1134033203125, 0.08160400390625, 0.2235107421875, 0.1539306640625, 0.088623046875, 0.1533203125, 0.12548828125, 0.00616455078125, 0.0191650390625, 0.043731...	embed
24198008_c0	24198008	haskell	0	Title: Automatic parentheses in `Show` instances Problem title: Automatic parentheses in `Show` instances Tags: haskell Problem: Automatic parentheses in `Show` instances ghci> show (Left 3) "Left 3" ghci> show (Just 0) "Just 0" ghci> show (Just (Left 3)) "Just (Left 3)" How does Haskell automatically put parentheses a...	Automatic parentheses in `Show` instances Automatic parentheses in `Show` instances haskell Automatic Show Left Just Automatic parentheses in `Show` instances How does Haskell automatically put parentheses around nested constructor arguments?	[ 0.00439453125, -0.00145721435546875, 0.01446533203125, 0.02294921875, 0.00112152099609375, 0.0286865234375, 0.00421142578125, 0.002227783203125, 0.0029296875, 0.00101470947265625, -0.00604248046875, -0.033447265625, 0.0020751953125, 0.03271484375, 0.00384521484375, -0.01385498046875, ...	[ 51719, 1771, 49129, 35412, 90, 168660, 110527, 1556, 142508, 17367, 636, 2480, 9563, 11249, 20625, 191082, 3884, 10932, 8512, 71, 64549, 748, 10750 ]	[ 0.2191162109375, 0.053314208984375, 0.1768798828125, 0.2098388671875, 0.1107177734375, 0.2396240234375, 0.1954345703125, 0.1243896484375, 0.2457275390625, 0.208740234375, 0.06402587890625, 0.1502685546875, 0.046630859375, 0.01268768310546875, 0.123046875, 0.185546875, 0.0433654785156...	embed
39426989_c0	39426989	haskell	0	Title: Haskell type error "Couldn't match type `Char' with `t0 [Char]'" Problem title: Haskell type error "Couldn't match type `Char' with `t0 [Char]'" Tags: haskell Problem: Haskell type error "Couldn't match type `Char' with `t0 [Char]'" Code signals: Haskell, Couldn,...	Haskell type error "Couldn't match type `Char' with `t0 [Char]'" Haskell type error "Couldn't match type `Char' with `t0 [Char]'" haskell Haskell Couldn Char Expected Actual ACGT SekvensTyp Dna ARNDCEQGHILKMFPSTWYV Protein Haskell type error "Couldn't match type `Char' ...	[ 0.01531982421875, 0.0244140625, 0.0030059814453125, 0.01336669921875, -0.00011205673217773438, -0.01611328125, -0.0125732421875, -0.0103759765625, -0.00738525390625, 0.021728515625, -0.007354736328125, -0.0098876953125, 0.01202392578125, 0.0101318359375, -0.009033203125, -0.00122070312...	[ 20625, 142508, 10644, 18499, 10625, 52366, 19, 3768, 18, 14858, 84068, 678, 2389, 1556, 191147, 21656, 60075, 13, 100582, 12944, 37315, 29855, 1353, 30400, 76, 13685, 10854, 724, 156235, 47848, 51006, 102815, 856, 129228, 31577, 28282, 104, 2...	[ 0.1571044921875, 0.26123046875, 0.209228515625, 0.1947021484375, 0.043121337890625, 0.1302490234375, 0.04107666015625, 0.16357421875, 0.104736328125, 0.2222900390625, 0.2430419921875, 0.1383056640625, 0.181640625, 0.1380615234375, 0.117431640625, 0.2027587890625, 0.1424560546875, 0...	embed
41322661_c0	41322661	haskell	0	Title: why we use word "just" in "Maybe a" Problem title: why we use word "just" in "Maybe a" Tags: haskell Problem: why we use word "just" in "Maybe a" why in definition of Maybe is : data Maybe a = Nothing \| Just a Why definition isn't like this: data Maybe a = Nothing \| a Why ...	why we use word "just" in "Maybe a" why we use word "just" in "Maybe a" haskell Maybe Nothing Just why we use word "just" in "Maybe a" why in definition of Maybe is : Why definition isn't like this: Why we use Just, isn't be simple wihout this ?	[ 0.005126953125, 0.0021514892578125, 0.0238037109375, 0.00238037109375, 0.0120849609375, 0.0225830078125, 0.01092529296875, 0.01422119140625, 0.01324462890625, -0.01031494140625, -0.002410888671875, -0.01275634765625, -0.0185546875, 0.004852294921875, 0.00225830078125, -0.00564575195312...	[ 15400, 642, 4527, 2565, 20314, 41502, 82419, 372, 10, 23, 1556, 142508, 83425, 182747, 9563, 80934, 83, 44084, 56112, 18, 1884, 903, 186, 8781, 80060 ]	[ 0.15625, 0.05316162109375, 0.1292724609375, 0.138427734375, 0.2454833984375, 0.047454833984375, 0.129638671875, 0.156494140625, 0.1513671875, 0.0401611328125, 0.096435546875, 0.2056884765625, 0.262451171875, 0.162353515625, 0.1805419921875, 0.1375732421875, 0.05047607421875, 0.1378...	embed
13534676_c0	13534676	haskell	0	Title: Is it possible to implement filter using foldl instead of foldr? Problem title: Is it possible to implement filter using foldl instead of foldr? Tags: functional-programming, haskell Problem: Is it possible to implement filter using foldl instead of foldr? Is it possible to implement filter using foldl instead o...	Is it possible to implement filter using foldl instead of foldr? Is it possible to implement filter using foldl instead of foldr? functional-programming haskell foldl Is it possible to implement filter using foldl instead of foldr? Is it possible to implement filter using foldl instead of foldr? If so, please explain y...	[ -0.0004405975341796875, 0.0079345703125, -0.002349853515625, -0.00946044921875, -0.0159912109375, 0.0091552734375, -0.00176239013671875, 0.006622314453125, -0.0113525390625, -0.0174560546875, -0.0010986328125, -0.007598876953125, -0.0024566650390625, -0.00122833251953125, 0.0031585693359...	[ 2071, 442, 7722, 29479, 46312, 17368, 18344, 20469, 64457, 7569, 123309, 28966, 1556, 142508, 47, 73342, 208124, 21507 ]	[ 0.046722412109375, 0.04644775390625, 0.1683349609375, 0.1846923828125, 0.2479248046875, 0.07952880859375, 0.2022705078125, 0.25244140625, 0.127197265625, 0.20654296875, 0.1163330078125, 0.0919189453125, 0.09552001953125, 0.2093505859375, 0.004302978515625, 0.04620361328125, 0.1447753...	embed
34848154_c0	34848154	haskell	0	Title: What kinds of runtime errors can Haskell have? Problem title: What kinds of runtime errors can Haskell have? Tags: runtime-error, haskell Problem: What kinds of runtime errors can Haskell have? I've read that Haskell can actually have runtime errors, despite being statically typed and functional. But, no one say...	What kinds of runtime errors can Haskell have? What kinds of runtime errors can Haskell have? runtime-error haskell What Haskell What kinds of runtime errors can Haskell have? I've read that Haskell can actually have runtime errors, despite being statically typed and functional. But, no one says what runtime errors tho...	[ 0.003204345703125, 0.00567626953125, 0.015380859375, -0.00311279296875, 0.005401611328125, 0.0262451171875, -0.020751953125, 0.000316619873046875, -0.00701904296875, -0.01300048828125, -0.00946044921875, -0.0341796875, 0.01190185546875, -0.00213623046875, 0.0037078857421875, 0.00363159...	[ 8562, 11675, 6032, 18499, 7, 831, 20625, 142508, 765, 188800, 1556, 4865, 111, 20653, 61518, 8035, 13254, 10644, 123309, 17378, 2367, 8382, 13648, 186, 3714 ]	[ 0.1326904296875, 0.125732421875, 0.1669921875, 0.20947265625, 0.0858154296875, 0.08740234375, 0.158447265625, 0.26123046875, 0.08905029296875, 0.1829833984375, 0.1390380859375, 0.052337646484375, 0.055633544921875, 0.0308990478515625, 0.047271728515625, 0.0210723876953125, 0.10241699...	embed
2784271_c0	2784271	haskell	0	Title: Haskell: Converting Int to String Problem title: Haskell: Converting Int to String Tags: casting, string, haskell, int Problem: Haskell: Converting Int to String I know you can convert a String to an number with read : Prelude> read "3" :: Int 3 Prelude> read "3" :: Double 3.0 But how do you grab the String repr...	Haskell: Converting Int to String Haskell: Converting Int to String casting string haskell int Haskell Converting Prelude Double Haskell: Converting Int to String I know you can convert a String to an number with read : But how do you grab the String representation of an Int value?	[ 0.0033111572265625, -0.016357421875, 0.01251220703125, 0.01031494140625, -0.0050048828125, 0.03173828125, 0.0002727508544921875, -0.0234375, -0.002899169921875, 0.01361083984375, -0.00885009765625, -0.0390625, -0.021240234375, 0.023681640625, -0.004486083984375, -0.0018157958984375, ...	[ 20625, 142508, 814, 1916, 360, 18, 47, 23351, 214, 12, 176050, 79315, 1556, 23, 1914, 822, 107172, 1657, 3714, 831, 96760, 142, 14012, 678, 12301, 3642, 54, 398, 59102, 18811, 1363, 111, 34292 ]	[ 0.1153564453125, 0.2193603515625, 0.1070556640625, 0.0650634765625, 0.1246337890625, 0.1695556640625, 0.1121826171875, 0.21337890625, 0.1522216796875, 0.0181884765625, 0.14990234375, 0.211669921875, 0.1119384765625, 0.1044921875, 0.033599853515625, 0.1138916015625, 0.07354736328125, ...	embed
66957936_c0	66957936	haskell	0	Title: Remove elements of an array in haskell Problem title: Remove elements of an array in haskell Tags: haskell Problem: Remove elements of an array in haskell I'm trying to remove the items of an array that coincide in both using map or filter, for example: rmElements :: [Integer] -> [Integer] -> [Integer] and by pa...	Remove elements of an array in haskell Remove elements of an array in haskell haskell Remove Integer Remove elements of an array in haskell I'm trying to remove the items of an array that coincide in both using map or filter, for example: and by passing get [3,4] Thanks	[ -0.01129150390625, 0.0208740234375, -0.00396728515625, 0.01239013671875, -0.0107421875, 0.00787353515625, -0.005340576171875, -0.000354766845703125, -0.001251220703125, -0.0027923583984375, 0.00653076171875, 0.0004215240478515625, -0.000518798828125, -0.00157928466796875, -0.018676757812...	[ 181139, 80854, 111, 10298, 53, 23, 1556, 142508, 44401, 31577, 87388, 55769, 60754, 13, 15044, 17368, 22288, 46312, 27781, 390, 452, 6953, 2046, 82449, 22362 ]	[ 0.1829833984375, 0.1881103515625, 0.106201171875, 0.1976318359375, 0.142333984375, 0.04876708984375, 0.166748046875, 0.240966796875, 0.21435546875, 0.060577392578125, 0.1756591796875, 0.138671875, 0.160888671875, 0.07171630859375, 0.0360107421875, 0.0122528076171875, 0.1065673828125,...	embed
14707720_c0	14707720	haskell	0	Title: Haskell: Why is ((.).(.)) f g equal to f . g x? Problem title: Haskell: Why is ((.).(.)) f g equal to f . g x? Tags: haskell, combinators, pointfree, types, function-composition Problem: Haskell: Why is ((.).(.)) f g equal to f . g x? Could you please explain the meaning of the expression ((.).(.))? As far as I ...	Haskell: Why is ((.).(.)) f g equal to f . g x? Haskell: Why is ((.).(.)) f g equal to f . g x? haskell combinators pointfree types function-composition Haskell Why Haskell: Why is ((.).(.)) f g equal to f . g x? Could you please explain the meaning of the expression ((.).(.))? As far as I know (.) has the type (b -> c...	[ -0.00885009765625, 0.006591796875, -0.0022735595703125, 0.01806640625, 0.0023651123046875, -0.00897216796875, 0.0103759765625, 0.00909423828125, 0.0111083984375, 0.000225067138671875, -0.0125732421875, 0.004058837890625, 0.0025634765625, 0.0020751953125, -0.0196533203125, -0.0090942382...	[ 20625, 142508, 12, 44084, 83, 60494, 5, 194, 1238, 706, 105950, 47, 1022, 132, 1556, 22321, 22230, 6275, 32087, 52895, 32354, 277, 191147, 22936, 73342, 70, 91084, 125195, 2060, 3714, 10644, 275, 33079, 501, 876 ]	[ 0.168701171875, 0.2705078125, 0.0217132568359375, 0.1907958984375, 0.08392333984375, 0.1788330078125, 0.13037109375, 0.08770751953125, 0.181884765625, 0.22119140625, 0.1876220703125, 0.07476806640625, 0.156005859375, 0.04901123046875, 0.1229248046875, 0.1629638671875, 0.0525512695312...	embed
39210584_c0	39210584	haskell	0	Title: How to define the type profile for this function? Problem title: How to define the type profile for this function? Tags: functional-programming, haskell, ml Problem: How to define the type profile for this function? I have to define the type profile of this function: twice f x = f (f x); The result should be the...	How to define the type profile for this function? How to define the type profile for this function? functional-programming haskell ml How How to define the type profile for this function? I have to define the type profile of this function: The result should be the following, but I don't really get why.	[ 0.01531982421875, -0.004791259765625, 0.0026397705078125, 0.010009765625, -0.00701904296875, 0.01507568359375, -0.00823974609375, -0.0004367828369140625, -0.0084228515625, -0.031982421875, 0.0029754638671875, -0.01287841796875, -0.00750732421875, 0.01708984375, -0.0006103515625, 0.0139...	[ 11249, 47, 61924, 70, 10644, 60641, 100, 903, 32354, 123309, 28966, 1556, 142508, 7115, 87, 765, 16750, 5608, 25632, 2301, 18, 6183, 2046, 15400 ]	[ 0.08270263671875, 0.0645751953125, 0.180419921875, 0.055328369140625, 0.2430419921875, 0.264404296875, 0.0576171875, 0.08404541015625, 0.18115234375, 0.122314453125, 0.0849609375, 0.0943603515625, 0.1820068359375, 0.09490966796875, 0.001735687255859375, 0.017486572265625, 0.067626953...	embed
3945581_c0	3945581	haskell	0	Title: implement unix pipes in haskell Problem title: implement unix pipes in haskell Tags: unix, pipe, haskell Problem: implement unix pipes in haskell I'm writing a mini shell and although I've got most of it planned out, one thing I'm not sure how to do is implement piping the output of one program as the input of a...	implement unix pipes in haskell implement unix pipes in haskell unix pipe haskell implement unix pipes in haskell I'm writing a mini shell and although I've got most of it planned out, one thing I'm not sure how to do is implement piping the output of one program as the input of another. Is there a sample or something ...	[ 0.00799560546875, 0.009033203125, 0.001007080078125, 0.01348876953125, -0.00958251953125, 0.0159912109375, -0.0169677734375, -0.034912109375, -0.0059814453125, -0.03125, 0.0023956298828125, 0.0233154296875, 0.0177001953125, 0.003997802734375, -0.01708984375, 0.006622314453125, 0.0039...	[ 29479, 51, 4084, 137158, 7, 23, 1556, 142508, 32562, 7665, 128019, 2684, 203251, 1810, 959, 9077, 3642, 54, 2147, 10366, 140992, 1632, 1528, 237, 107730, 111, 15700, 121413, 6275, 48225 ]	[ 0.2156982421875, 0.1195068359375, 0.1397705078125, 0.2435302734375, 0.1412353515625, 0.0714111328125, 0.142822265625, 0.2308349609375, 0.0819091796875, 0.1356201171875, 0.1689453125, 0.005828857421875, 0.0733642578125, 0.0052490234375, 0.0260162353515625, 0.0731201171875, 0.017044067...	embed
54156236_c3	54156236	haskell	3	67fe8a4099016b98e.log, Configuring, hourglass-0.2.12-b4e44e80db4dcca3718451012cc7a7ae0dbecf4c2012a6e72d47ff05ce4a80c4, data-default-instances-old-locale-0.0.1-68d07651afec351ca1382acf43ff1403a204de89c766785ea29b5eb125d7ba75, old-locale-1.0.0.7-876e14e8597a236e2a6f9fc9ced1be9ed8de77ad3379ae7cf45fd794315103c0, old-time-1...	67fe8a4099016b98e.log, Configuring, hourglass-0.2.12-b4e44e80db4dcca3718451012cc7a7ae0dbecf4c2012a6e72d47ff05ce4a80c4, data-default-instances-old-locale-0.0.1-68d07651afec351ca1382acf43ff1403a204de89c766785ea29b5eb125d7ba75, old-locale-1.0.0.7-876e14e8597a236e2a6f9fc9ced1be9ed8de77ad3379ae7cf45fd794315103c0, old-time-1...	[ -0.00335693359375, 0.006103515625, 0.007537841796875, 0.00341796875, 0.0198974609375, -0.0036163330078125, -0.01263427734375, -0.000782012939453125, 0.006805419921875, 0.0157470703125, -0.0235595703125, -0.0052490234375, 0.018798828125, -0.00836181640625, 0, -0.00848388671875, -0.010...	[ 12661, 2242, 1019, 11, 2839, 61158, 2485, 275, 16665, 13, 5, 4867, 4, 1657, 59994, 214, 56816, 134974, 9, 133684, 1530, 12465, 4836, 48073, 11210, 10945, 1819, 33970, 238, 10693, 13330, 8194, 2053, 214810, 73, 116071, 18345, 98908, 99929, ...	[ 0.1944580078125, 0.1112060546875, 0.031219482421875, 0.0213775634765625, 0.0960693359375, 0.1329345703125, 0.1549072265625, 0.01824951171875, 0.1531982421875, 0.04974365234375, 0.0706787109375, 0.240234375, 0.03521728515625, 0.106201171875, 0.2371826171875, 0.1051025390625, 0.2332763...	embed
19309052_c0	19309052	haskell	0	Title: Custom 404 in Snap Web Framework Problem title: Custom 404 in Snap Web Framework Tags: haskell-snap-framework, haskell Problem: Custom 404 in Snap Web Framework I am building a website with Snap. How do I specify a custom 404 handler to capture all routes that don't exist? I would like to redefine the default: N...	Custom 404 in Snap Web Framework Custom 404 in Snap Web Framework haskell-snap-framework haskell Custom Snap Web Framework Custom 404 in Snap Web Framework I am building a website with Snap. How do I specify a custom 404 handler to capture all routes that don't exist? I would like to redefine the default: Thanks	[ -0.012451171875, 0.0274658203125, -0.001983642578125, 0.003021240234375, -0.03466796875, -0.00035858154296875, -0.00897216796875, -0.00970458984375, 0.004150390625, -0.0108642578125, -0.0311279296875, -0.034912109375, -0.0260009765625, -0.0185546875, 0.000606536865234375, 0.01574707031...	[ 130664, 1112, 617, 23, 121190, 4002, 202220, 1556, 142508, 10957, 160328, 18244, 33976, 4165, 678, 11249, 40140, 18929, 114122, 35863, 141621, 756, 36439, 450, 2301, 18, 32316, 1884, 15265, 64552, 114977, 22362 ]	[ 0.2005615234375, 0.21240234375, 0.2384033203125, 0.06378173828125, 0.2406005859375, 0.138427734375, 0.249755859375, 0.0950927734375, 0.158935546875, 0.190673828125, 0.08953857421875, 0.0173797607421875, 0.07574462890625, 0.11004638671875, 0.01363372802734375, 0.0198516845703125, 0.10...	embed
33059378_c0	33059378	haskell	0	Title: Why does `traceId` return the message string itself? Problem title: Why does `traceId` return the message string itself? Tags: debugging, haskell Problem: Why does `traceId` return the message string itself? I found it really weird that traceId returns the message string itself. Why would anyone want to do that?...	Why does `traceId` return the message string itself? Why does `traceId` return the message string itself? debugging haskell Why Why does `traceId` return the message string itself? I found it really weird that traceId returns the message string itself. Why would anyone want to do that? Is there a common scenario where ...	[ 0.01043701171875, -0.000339508056640625, -0.01068115234375, 0.01312255859375, 0.0076904296875, 0.002655029296875, 0.0019989013671875, -0.0027923583984375, 0.005645751953125, -0.01806640625, 0.0230712890625, -0.00567626953125, -0.021728515625, -0.0027618408203125, 0.00762939453125, 0.02...	[ 44084, 14602, 39989, 13, 568, 71, 30646, 26008, 79315, 68034, 8, 978, 1556, 142508, 179459, 144851, 7, 106117 ]	[ 0.0938720703125, 0.0189361572265625, 0.19091796875, 0.1094970703125, 0.152587890625, 0.1785888671875, 0.16748046875, 0.1187744140625, 0.1829833984375, 0.1468505859375, 0.03424072265625, 0.0791015625, 0.057586669921875, 0.160400390625, 0.0906982421875, 0.206787109375, 0.00341796875, ...	embed
17384905_c0	17384905	haskell	0	Title: Trace of call stack in haskell with variables Problem title: Trace of call stack in haskell with variables Tags: callstack, debugging, haskell, stack-trace Problem: Trace of call stack in haskell with variables Is there anyway to trace haskell execution step by step? I mean i wanna see every call of function wit...	Trace of call stack in haskell with variables Trace of call stack in haskell with variables callstack debugging haskell stack-trace Trace Trace of call stack in haskell with variables Is there anyway to trace haskell execution step by step? I mean i wanna see every call of function with variable values. Something smila...	[ 0.01080322265625, 0.0101318359375, -0.01239013671875, 0.00927734375, 0.0189208984375, -0.00433349609375, -0.01055908203125, 0.0030975341796875, 0.0027923583984375, -0.04345703125, -0.0062255859375, -0.0062255859375, 0.0028533935546875, 0.01116943359375, 0.0220947265625, 0.010986328125,...	[ 4937, 329, 111, 11782, 177261, 23, 1556, 142508, 678, 77336, 590, 2594, 8, 978, 39989, 2685, 109954, 47, 144851, 71924, 1830, 29954, 390, 6165, 76, 1957, 11907, 32354, 142424, 61567, 147, 502, 4867, 17086, 13 ]	[ 0.1866455078125, 0.1409912109375, 0.131103515625, 0.1630859375, 0.186767578125, 0.02886962890625, 0.126953125, 0.2412109375, 0.084228515625, 0.218017578125, 0.1163330078125, 0.06951904296875, 0.05718994140625, 0.0780029296875, 0.178466796875, 0.0155792236328125, 0.09423828125, 0.04...	embed
20180764_c0	20180764	haskell	0	Title: How can I get Ptr of a ByteString? Problem title: How can I get Ptr of a ByteString? Tags: haskell, bytestring Problem: How can I get Ptr of a ByteString? Is there a way to extract underlying direct pointer to memory off the ByteString object? My current approach is incorrect, compiler says. getPtr :: ByteString...	How can I get Ptr of a ByteString? How can I get Ptr of a ByteString? haskell bytestring How Ptr ByteString Word8 How can I get Ptr of a ByteString? Is there a way to extract underlying direct pointer to memory off the ByteString object? My current approach is incorrect, compiler says.	[ 0.003692626953125, 0.024658203125, 0.00445556640625, 0.00015735626220703125, -0.01171875, 0.0093994140625, -0.01141357421875, -0.010009765625, -0.00750732421875, -0.0242919921875, 0.024658203125, -0.0031585693359375, -0.00823974609375, 0.01312255859375, -0.0203857421875, 0.015563964843...	[ 11249, 831, 87, 2046, 436, 4448, 111, 3311, 67, 71713, 214, 1556, 142508, 390, 91693, 22543, 1019, 3917, 125663, 1379, 538, 8951, 6275, 56, 47, 98323, 5773, 36746, 43581, 51515, 214552, 9969, 34759, 17378 ]	[ 0.06396484375, 0.0963134765625, 0.04376220703125, 0.10498046875, 0.10791015625, 0.2481689453125, 0.1219482421875, 0.10382080078125, 0.1573486328125, 0.1878662109375, 0.0914306640625, 0.0916748046875, 0.188232421875, 0.082275390625, 0.185302734375, 0.1302490234375, 0.172119140625, 0...	embed
48720747_c2	48720747	haskell	2	V.unsafeIndex cols (j-1) b = wsum (V.unsafeIndex a' (i-1)) (V.unsafeIndex bt' (j-1)) in a + b wsum r c = foldl (wsumHelper r c) 0 [0,2..p-1] Code signals: Control.Exception, qualified, Control.DeepSeq, System.Clock, System.Mem, Data.Time, Performance, Haskell, Main, Data.Vector, Data.Matrix, M.Matrix, M.nrows, M.ncols...	V.unsafeIndex cols (j-1) b = wsum (V.unsafeIndex a' (i-1)) (V.unsafeIndex bt' (j-1)) in a + b wsum r c = foldl (wsumHelper r c) 0 [0,2..p-1] Code signals: Control.Exception, qualified, Control.DeepSeq, System.Clock, System.Mem, Data.Time, Performance, Haskell, Main, Data.Vector, Data.Matrix, M.Matrix, M.nrows, M.ncols...	[ -0.016357421875, 0.023193359375, 0.0064697265625, -0.0025177001953125, -0.0155029296875, -0.01324462890625, -0.010986328125, -0.015869140625, 0.01214599609375, -0.0186767578125, 0.00189971923828125, 0.01031494140625, -0.00555419921875, -0.017333984375, -0.0400390625, -0.0128173828125, ...	[ 310, 5, 309, 115840, 4153, 39659, 3365, 7, 170, 110218, 876, 2203, 148, 11832, 856, 10, 25, 14, 18, 16, 997, 1690, 501, 18344, 20469, 434, 60785, 1264, 757, 5442, 76172, 28864, 26073, 12, 27131, 63928, 217225, 4657, 4517, 4233, 864, 1...	[ 0.2265625, 0.04534912109375, 0.132568359375, 0.2451171875, 0.123046875, 0.233154296875, 0.1654052734375, 0.112548828125, 0.1549072265625, 0.15478515625, 0.123779296875, 0.056060791015625, 0.1348876953125, 0.2362060546875, 0.1849365234375, 0.04486083984375, 0.0784912109375, 0.053497...	embed
68002815_c2	68002815	haskell	2	moreThan 2 [1,2,3,3,4,2,3,5,1,2] ) \| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ zadanie.hs:23:27: error: • No instance for (Num Code signals: Prelude, Data.List, a, being, the, Problem, x:xs, moreThan2, x:delete, zadanie.hs:23:8, Ambiguous, Show, Probable, These, Ordering, Defined, GHC.Show, Integer, Maybe, zadanie.hs:23:15, GH...	moreThan 2 [1,2,3,3,4,2,3,5,1,2] ) \| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ zadanie.hs:23:27: error: • No instance for (Num Code signals: Prelude, Data.List, a, being, the, Problem, x:xs, moreThan2, x:delete, zadanie.hs:23:8, Ambiguous, Show, Probable, These, Ordering, Defined, GHC.Show, Integer, Maybe, zadanie.hs:23:15, GH...	[ -0.0027618408203125, 0.01043701171875, -0.00701904296875, -0.00086212158203125, -0.005950927734375, 0.0185546875, 0.00396728515625, 0.005340576171875, 0.015625, -0.00750732421875, -0.003936767578125, -0.0322265625, 0.020263671875, -0.00616455078125, 0.002349853515625, -0.0185546875, ...	[ 1286, 618, 1121, 116, 68252, 4, 155761, 82449, 304, 92714, 133063, 58745, 16377, 15729, 115296, 127, 7, 24864, 27592, 18499, 768, 438, 110527, 100, 839, 316, 28864, 26073, 1914, 822, 112, 11809, 154663, 10, 8035, 70, 15649, 1022, 425, 852...	[ 0.2376708984375, 0.1107177734375, 0.237060546875, 0.2132568359375, 0.054931640625, 0.048614501953125, 0.1719970703125, 0.2020263671875, 0.1544189453125, 0.209716796875, 0.1561279296875, 0.00921630859375, 0.035980224609375, 0.0153656005859375, 0.2470703125, 0.0880126953125, 0.05236816...	embed
54318114_c0	54318114	haskell	0	Title: lazy evaluation in infinte list Problem title: lazy evaluation in infinte list Tags: haskell, infinite, list Problem: lazy evaluation in infinte list Hi I have the following code: let f n (xs) = if n < 0 then f (n-1) (n:xs) else xs f (-3) [] !! 1 and I expect it to print -4 But it does not print anything and kee...	lazy evaluation in infinte list lazy evaluation in infinte list haskell infinite list n-1 n:xs lazy evaluation in infinte list Hi I have the following code: and I expect it to print -4 But it does not print anything and keeps calculation in background. What is wrong with my code?	[ -0.0135498046875, 0.0010528564453125, -0.0030364990234375, -0.0064697265625, -0.005889892578125, -0.00347900390625, 0.0299072265625, 0.0093994140625, 0.0184326171875, -0.01171875, 0.01239013671875, -0.00848388671875, 0.0174560546875, 0.00958251953125, 0.0028533935546875, 0.011779785156...	[ 21, 3285, 219836, 34128, 6191, 5303, 1556, 142508, 54241, 13, 5759, 653, 425, 7, 23, 2673, 25632, 18151, 41206, 28412, 20, 617, 4966, 14602, 959, 23937, 13695, 74481, 76615, 44691 ]	[ 0.1322021484375, 0.21142578125, 0.2125244140625, 0.0714111328125, 0.1358642578125, 0.17626953125, 0.10345458984375, 0.16552734375, 0.1278076171875, 0.0167999267578125, 0.1337890625, 0.0160675048828125, 0.065185546875, 0.0262451171875, 0.015869140625, 0.0013723373413085938, 0.04745483...	embed
10837238_c0	10837238	haskell	0	Title: Command ls or dir in ghci Problem title: Command ls or dir in ghci Tags: haskell, ghci Problem: Command ls or dir in ghci I'm new to Haskell. I'm using ghci . I know I can move through directory with the command :cd <dir> . But I cannot find the command to list the files in a directory (something like Unix ls or...	Command ls or dir in ghci Command ls or dir in ghci haskell ghci Command Command ls or dir in ghci I'm new to Haskell. I'm using ghci . I know I can move through directory with the command :cd <dir> . But I cannot find the command to list the files in a directory (something like Unix ls or Microsoft dir ). Is it possib...	[ -0.007049560546875, 0.001495361328125, 0.0106201171875, 0.0140380859375, -0.009521484375, 0.02490234375, 0.01287841796875, 0.00909423828125, 0.00494384765625, -0.0194091796875, -0.01092529296875, -0.028076171875, 0.0162353515625, 0.00836181640625, -0.0167236328125, 0.00921630859375, ...	[ 123573, 96, 7, 707, 5402, 23, 31380, 318, 1556, 142508, 3525, 20625, 17368, 3714, 831, 25813, 8305, 14364, 53, 678, 75101, 71574, 936, 53418, 7413, 47, 5303, 102158, 992, 4084, 7244, 7722, 54, 41877, 17304 ]	[ 0.21484375, 0.158935546875, 0.21630859375, 0.1441650390625, 0.2357177734375, 0.0877685546875, 0.157958984375, 0.1783447265625, 0.1180419921875, 0.218994140625, 0.03204345703125, 0.10791015625, 0.0192108154296875, 0.039886474609375, 0.04583740234375, 0.14794921875, 0.119384765625, 0...	embed
2464406_c0	2464406	haskell	0	Title: Point-free in Haskell Problem title: Point-free in Haskell Tags: pointfree, haskell, coding-style Problem: Point-free in Haskell I have this code that I want to make point-free; (\k t -> chr $ a + flip mod 26 (ord k + ord t -2*a)) How do I do that? Also are there some general rules for point free style other tha...	Point-free in Haskell Point-free in Haskell pointfree haskell coding-style Point-free Haskell Point-free in Haskell I have this code that I want to make point-free; (\k t -> chr $ a + flip mod 26 (ord k + ord t -2*a)) How do I do that? Also are there some general rules for point free style other than "think about this ...	[ 0.0169677734375, 0.004638671875, 0.0091552734375, -0.001739501953125, 0.007080078125, 0.00213623046875, 0.0021820068359375, -0.0206298828125, 0.004119873046875, -0.0267333984375, -0.000560760498046875, -0.031494140625, 0.00933837890625, 0.037109375, -0.0390625, -0.00421142578125, 0.0...	[ 41097, 9, 32087, 23, 20625, 142508, 6275, 1556, 552, 6238, 40946, 765, 903, 18151, 3444, 3249, 41872, 92, 808, 33079, 17656, 3650, 10, 997, 147505, 2811, 1381, 6651, 472, 8597, 122297, 1639, 11, 11249, 54, 4537, 91736, 4092, 20623, 201950...	[ 0.1951904296875, 0.07025146484375, 0.20703125, 0.07513427734375, 0.146484375, 0.242919921875, 0.1815185546875, 0.126708984375, 0.09423828125, 0.07958984375, 0.184326171875, 0.00604248046875, 0.036895751953125, 0.1611328125, 0.0645751953125, 0.06976318359375, 0.016632080078125, 0.04...	embed
52508886_c0	52508886	haskell	0	Title: Haskell: Is there any object that is of every type, like `null` in Java? Problem title: Haskell: Is there any object that is of every type, like `null` in Java? Tags: haskell Problem: Haskell: Is there any object that is of every type, like `null` in Java? In Java, with a little exception, null is of every type....	Haskell: Is there any object that is of every type, like `null` in Java? Haskell: Is there any object that is of every type, like `null` in Java? haskell Haskell Java Haskell: Is there any object that is of every type, like `null` in Java? In Java, with a little exception, null is of every type. Is there a correspondin...	[ 0.012451171875, 0.00885009765625, 0.0145263671875, 0.0078125, -0.000362396240234375, 0.0078125, 0.00180816650390625, -0.0159912109375, -0.0081787109375, -0.005706787109375, -0.0057373046875, -0.050048828125, 0.01055908203125, -0.003173828125, -0.0081787109375, 0.0002899169921875, 0.0...	[ 20625, 142508, 2071, 2685, 2499, 36746, 83, 111, 11907, 10644, 1884, 139550, 23, 41925, 450, 1556, 12, 360, 10176, 131527, 56574, 42518 ]	[ 0.129638671875, 0.2509765625, 0.0389404296875, 0.059722900390625, 0.080322265625, 0.206298828125, 0.073974609375, 0.0826416015625, 0.1348876953125, 0.177734375, 0.0946044921875, 0.2568359375, 0.0960693359375, 0.2318115234375, 0.0180511474609375, 0.0992431640625, 0.017730712890625, ...	embed
44358134_c0	44358134	haskell	0	Title: Map-ing over ConduitM? Problem title: Map-ing over ConduitM? Tags: haskell Problem: Map-ing over ConduitM? How can I implement the following in Conduit ? Given a conduit whose input is of type a and output is of type b , output a new conduit that returns a type of c , i.e. rather than b . g :: Monad m => Conduit...	Map-ing over ConduitM? Map-ing over ConduitM? haskell Map-ing ConduitM Monad Map-ing over ConduitM? How can I implement the following in Conduit ? Given a conduit whose input is of type a and output is of type b , output a new conduit that returns a type of c , i.e. rather than b . g :: Monad m => ConduitM a b m () -> ...	[ -0.01055908203125, 0.0089111328125, 0.0126953125, 0.0257568359375, 0.01226806640625, 0.017822265625, 0.000720977783203125, 0.0037384033203125, 0.000054836273193359375, 0.00119781494140625, -0.0184326171875, -0.016845703125, -0.004302978515625, 0.0159912109375, -0.00029754638671875, -0....	[ 42719, 9, 214, 645, 1657, 112061, 594, 32, 1556, 142508, 60331, 71, 11249, 831, 29479, 25632, 23, 77878, 120565, 107730, 83, 111, 10644, 10, 140992, 876, 3525, 30646, 501, 43257, 706, 347, 44357, 33079 ]	[ 0.2459716796875, 0.10113525390625, 0.120849609375, 0.138671875, 0.1207275390625, 0.2198486328125, 0.2119140625, 0.0108642578125, 0.122314453125, 0.2266845703125, 0.17041015625, 0.0950927734375, 0.022674560546875, 0.01776123046875, 0.1636962890625, 0.0498046875, 0.043060302734375, 0...	embed
6009031_c0	6009031	haskell	0	Title: Difference between hsc2hs and c2hs? Problem title: Difference between hsc2hs and c2hs? Tags: ffi, hsc2hs, c2hs, haskell Problem: Difference between hsc2hs and c2hs? What is the difference between hsc2hs and c2hs? I know what hsc2hs is a preprocessor but what does it exactly do? And c2hs can make Haskell modules ...	Difference between hsc2hs and c2hs? Difference between hsc2hs and c2hs? ffi hsc2hs c2hs haskell Difference hsc2hs c2hs Difference between hsc2hs and c2hs? What is the difference between hsc2hs and c2hs? I know what hsc2hs is a preprocessor but what does it exactly do? And c2hs can make Haskell modules from C-code, but ...	[ 0.0142822265625, 0.006622314453125, -0.0093994140625, 0.0164794921875, 0.0091552734375, 0.014892578125, 0.01116943359375, 0.00848388671875, -0.00150299072265625, -0.00244140625, 0.006561279296875, -0.0281982421875, 0.0033111572265625, 0.023193359375, -0.01031494140625, 0.00213623046875...	[ 803, 18234, 6620, 17721, 1096, 10382, 304, 127, 7, 136, 501, 24500, 1556, 142508, 70, 60212, 479, 63923, 748, 2367, 14602, 66161, 54, 831, 3249, 20625, 88996, 1295, 313, 40899, 3871 ]	[ 0.0474853515625, 0.147216796875, 0.0439453125, 0.0703125, 0.10369873046875, 0.1510009765625, 0.1646728515625, 0.197021484375, 0.114501953125, 0.042083740234375, 0.06781005859375, 0.1082763671875, 0.1004638671875, 0.20556640625, 0.00823974609375, 0.149169921875, 0.120361328125, 0.10...	embed
23441495_c0	23441495	haskell	0	Title: Haskell syntax error? Problem title: Haskell syntax error? Tags: haskell Problem: Haskell syntax error? I cant compile this part of code: game a = let gameBoard ++ a black = test a colors white = (test2 a colors) - black createScore black white in merge gameBoard score geting: Syntax error in declaration (unexpe...	Haskell syntax error? Haskell syntax error? haskell Haskell test2 Haskell syntax error? I cant compile this part of code: geting: Syntax error in declaration (unexpected `}', possibly due to bad layout) Thanks for help.	[ -0.00872802734375, 0.01080322265625, -0.0224609375, 0.00323486328125, 0.0108642578125, -0.004852294921875, -0.031982421875, 0.01116943359375, 0.0172119140625, 0.01116943359375, -0.004486083984375, 0.024169921875, 0.0002880096435546875, -0.01416015625, 0.0147705078125, -0.0140380859375,...	[ 20625, 142508, 6002, 86531, 18499, 32, 1556, 3034, 304, 45767, 9969, 1340, 903, 2831, 18151, 2046, 214, 19010, 23, 21635, 309, 83613, 9473, 8152, 144681, 4743, 6494, 108802, 4358 ]	[ 0.1282958984375, 0.2291259765625, 0.170654296875, 0.218017578125, 0.1915283203125, 0.03375244140625, 0.1065673828125, 0.11688232421875, 0.09405517578125, 0.11309814453125, 0.0909423828125, 0.0853271484375, 0.03631591796875, 0.07586669921875, 0.00766754150390625, 0.05780029296875, 0.0...	embed
64841584_c0	64841584	haskell	0	Title: How do i write this function in Haskell Problem title: How do i write this function in Haskell Tags: haskell, csv Problem: How do i write this function in Haskell I am required to do a haskell project which takes a csv and calculate the average for each day from it. Below is the code I have done so far main :: I...	How do i write this function in Haskell How do i write this function in Haskell haskell csv How Haskell Char dataexport.csv K.splitOneOf How do i write this function in Haskell	[ 0.0031280517578125, -0.00885009765625, 0.0002117156982421875, 0.02880859375, -0.00007581710815429688, 0.0211181640625, 0.01226806640625, -0.00677490234375, 0.0027923583984375, -0.007476806640625, -0.01458740234375, -0.030517578125, -0.000675201416015625, 0.007293701171875, -0.0146484375,...	[ 11249, 33022, 903, 32354, 20625, 142508, 54, 17, 23, 1556, 20763, 334, 21656, 2053, 180758, 4439, 341, 7008, 4353, 62068, 132887 ]	[ 0.03131103515625, 0.191650390625, 0.10107421875, 0.2236328125, 0.134765625, 0.234130859375, 0.0197906494140625, 0.04388427734375, 0.0152435302734375, 0.10479736328125, 0.068603515625, 0.2056884765625, 0.1876220703125, 0.0960693359375, 0.255859375, 0.072265625, 0.117431640625, 0.026...	embed
27091581_c0	27091581	haskell	0	Title: Restrictions on Types of `a -> b` Function Problem title: Restrictions on Types of `a -> b` Function Tags: haskell Problem: Restrictions on Types of `a -> b` Function Let's say I have part of a function's signature: f :: (a -> b) -> ... Is there any restriction (such as their kinds ) on the types of a and ...	Restrictions on Types of `a -> b` Function Restrictions on Types of `a -> b` Function haskell Restrictions Types Restrictions on Types of `a -> b` Function Let's say I have part of a function's signature: f :: (a -> b) -> ... Is there any restriction (such as their kinds ) on the types of a and b ? a can't be a f...	[ 0.003448486328125, 0.011474609375, -0.005615234375, 0.01483154296875, -0.00506591796875, 0.0031890869140625, -0.0036163330078125, -0.0054931640625, 0.0115966796875, 0.003265380859375, -0.0230712890625, -0.037841796875, 0.0093994140625, -0.00482177734375, -0.01031494140625, -0.005737304...	[ 853, 144225, 17514, 98, 60457, 7, 111, 9473, 11, 20, 1230, 5386, 876, 28670, 10763, 1556, 142508, 33079, 5154, 87, 765, 2831, 32354, 138256, 1238, 1984, 16, 153, 2071, 2685, 2499, 185190, 2363, 8562, 52895, 10, 136, 831, 18, 186, 238, ...	[ 0.107666015625, 0.2164306640625, 0.097900390625, 0.1109619140625, 0.2010498046875, 0.0318603515625, 0.06878662109375, 0.0147705078125, 0.131103515625, 0.07666015625, 0.09393310546875, 0.1307373046875, 0.186767578125, 0.1734619140625, 0.07354736328125, 0.146728515625, 0.2298583984375,...	embed
8484284_c1	8484284	haskell	1	bad on my code, I’ve only been studying Haskell only for 5 weeks) foo n p newtuple = fooAux newtuple fob where fooAux _ [] = [] fooAux m ((_):ds) = m:ds fob n p = ((aux2 xxs)!!n)!!p where aux2 [] = [] aux2 ((_,_,c):xs) = c:aux2 xs Finally I will put all back together, using splitAt . Is my approach to the problem corr...	bad on my code, I’ve only been studying Haskell only for 5 weeks) foo n p newtuple = fooAux newtuple fob where fooAux _ [] = [] fooAux m ((_):ds) = m:ds fob n p = ((aux2 xxs)!!n)!!p where aux2 [] = [] aux2 ((_,_,c):xs) = c:aux2 xs Finally I will put all back together, using splitAt . Is my approach to the problem corr...	[ -0.0021820068359375, -0.00008249282836914062, -0.01251220703125, 0.002716064453125, -0.006866455078125, 0.033935546875, -0.007110595703125, 0.0037689208984375, 0.03076171875, -0.0400390625, 0.02001953125, -0.0096435546875, 0.01470947265625, 0.00634765625, -0.0128173828125, -0.009216308...	[ 6494, 98, 759, 18151, 272, 4734, 2809, 35187, 20625, 142508, 100, 190, 40859, 5775, 31, 653, 915, 3525, 458, 8705, 2203, 284, 6077, 275, 347, 6468, 12, 10442, 304, 113664, 7, 1146, 19, 254, 2970, 238, 425, 501, 1022, 201106, 1221, 388...	[ 0.19677734375, 0.058349609375, 0.030670166015625, 0.191650390625, 0.005126953125, 0.074462890625, 0.0399169921875, 0.07958984375, 0.1627197265625, 0.2666015625, 0.0189208984375, 0.0640869140625, 0.098388671875, 0.152587890625, 0.0877685546875, 0.060821533203125, 0.1490478515625, 0....	embed
22765631_c0	22765631	haskell	0	Title: runhaskell setup configure [ installing] Problem title: runhaskell setup configure [ installing] Tags: runhaskell, haskell Problem: runhaskell setup configure [ installing] When I try to configure the Cabal-1.18.1.3 package I get the error: Configuring Cabal-1.18.1.3... Setup: does not exist My system is Windows...	runhaskell setup configure [ installing] runhaskell setup configure [ installing] runhaskell haskell runhaskell setup configure [ installing] When I try to configure the Cabal-1.18.1.3 package I get the error: Configuring Cabal-1.18.1.3... Setup: does not exist My system is Windows 8 Pro x64, 2GB RAM, 1.7GHz dual core....	[ 0.00543212890625, 0.0084228515625, 0.010498046875, 0.0037841796875, -0.01251220703125, 0.0024566650390625, -0.00457763671875, -0.0048828125, 0.0322265625, 0.0166015625, -0.030029296875, -0.007476806640625, -0.000072479248046875, -0.0157470703125, 0.01300048828125, 0.00213623046875, 0...	[ 11675, 10557, 142508, 169581, 222495, 20600, 1556, 9790, 70, 30438, 289, 5759, 1819, 81046, 98169, 18499, 1657, 59994, 214, 5, 19943, 2037, 14602, 959, 32316, 5426, 3773, 382, 1250, 13307, 26959, 100920, 147748, 87758, 56458, 37842, 32562, 23...	[ 0.130615234375, 0.16162109375, 0.252197265625, 0.230712890625, 0.2381591796875, 0.1063232421875, 0.1605224609375, 0.074462890625, 0.0076904296875, 0.18212890625, 0.1976318359375, 0.08203125, 0.1732177734375, 0.1993408203125, 0.1768798828125, 0.16748046875, 0.07525634765625, 0.21057...	embed
27240142_c0	27240142	haskell	0	Title: How can I get the indexes of elements in a Haskell list Problem title: How can I get the indexes of elements in a Haskell list Tags: haskell Problem: How can I get the indexes of elements in a Haskell list Is there any function in Haskell that returns the indexs of elements like elemIndex in a list. For example ...	How can I get the indexes of elements in a Haskell list How can I get the indexes of elements in a Haskell list haskell How Haskell How can I get the indexes of elements in a Haskell list Is there any function in Haskell that returns the indexs of elements like elemIndex in a list. For example for the list [1,2,3,4,2,3...	[ -0.00177764892578125, 0.01190185546875, 0.00148773193359375, 0.00103759765625, -0.008544921875, 0.01312255859375, -0.006378173828125, -0.006072998046875, 0.003387451171875, -0.02734375, -0.0034332275390625, -0.0262451171875, -0.00537109375, 0.0262451171875, -0.00677490234375, -0.010498...	[ 11249, 831, 87, 2046, 70, 63262, 90, 111, 80854, 23, 20625, 142508, 5303, 10, 1556, 2685, 2499, 32354, 30646, 7, 1884, 88, 195, 4153, 39659, 27781, 133063, 82449, 155761, 16487, 100, 116, 163324 ]	[ 0.05767822265625, 0.0792236328125, 0.040374755859375, 0.133056640625, 0.076171875, 0.233642578125, 0.168212890625, 0.07562255859375, 0.204833984375, 0.0623779296875, 0.1407470703125, 0.2261962890625, 0.1708984375, 0.008056640625, 0.1234130859375, 0.013214111328125, 0.0341796875, 0....	embed
30954365_c1	30954365	haskell	1	not sure whether it's the fact that the specific container OS is Ubuntu or not. I'd love to hear suggestions on the matter. Thanks! Code signals: EXPOSE, Docker, Yesod, Linking, Failure, haskell:7.8, RUN, libpq5, ADD, WORKDIR, CMD, x86_64-linux-ghc-7.8.4, cryptonite-0.3, libHScryptonite-0.3.a, generic.o, cipher-aes-0....	not sure whether it's the fact that the specific container OS is Ubuntu or not. I'd love to hear suggestions on the matter. Thanks! Code signals: EXPOSE, Docker, Yesod, Linking, Failure, haskell:7.8, RUN, libpq5, ADD, WORKDIR, CMD, x86_64-linux-ghc-7.8.4, cryptonite-0.3, libHScryptonite-0.3.a, generic.o, cipher-aes-0....	[ -0.0079345703125, 0.01214599609375, -0.0023040771484375, 0.0079345703125, -0.029541015625, 0.0013885498046875, 0.0035858154296875, -0.0191650390625, 0.021728515625, 0.016845703125, 0.01019287109375, -0.0224609375, 0.02783203125, 0.022216796875, -0.020263671875, -0.0203857421875, 0.01...	[ 959, 9077, 7, 15824, 70, 29458, 116419, 11787, 83, 116890, 5161, 36802, 157666, 26866, 22362, 38, 28864, 26073, 12, 104165, 7285, 647, 984, 11050, 32635, 2199, 12779, 214, 190355, 3408, 1556, 142508, 176391, 130747, 25474, 864, 758, 24057, ...	[ 0.0732421875, 0.06866455078125, 0.07958984375, 0.0379638671875, 0.00335693359375, 0.09735107421875, 0.31298828125, 0.21240234375, 0.126220703125, 0.287841796875, 0.1142578125, 0.0745849609375, 0.0777587890625, 0.0143890380859375, 0.0168914794921875, 0.031768798828125, 0.2225341796875...	embed
60405858_c0	60405858	haskell	0	Title: How to filter a list of lists using a list in haskell Problem title: How to filter a list of lists using a list in haskell Tags: list, haskell Problem: How to filter a list of lists using a list in haskell I have this list of lists a = [["a","b","c"],["d","e","f"]] b = ["a","b"] I want to filter a using b so the...	How to filter a list of lists using a list in haskell How to filter a list of lists using a list in haskell list haskell a How How to filter a list of lists using a list in haskell I have this list of lists I want to filter a using b so the output should be ["a","b","c"] all elements in b should be in a	[ -0.0096435546875, 0.023193359375, -0.002197265625, 0.01361083984375, -0.01507568359375, 0.001922607421875, 0.00579833984375, 0.000209808349609375, 0.0004177093505859375, 0.004547119140625, -0.006317138671875, -0.0027008056640625, 0.0024566650390625, 0.0150146484375, -0.043701171875, -0...	[ 11249, 46312, 5303, 111, 7, 17368, 10, 23, 1556, 142508, 47, 3444, 876, 140992, 5608, 11, 275, 238, 756, 80854, 186 ]	[ 0.04986572265625, 0.24267578125, 0.22900390625, 0.06927490234375, 0.0863037109375, 0.1024169921875, 0.0723876953125, 0.06988525390625, 0.1485595703125, 0.21240234375, 0.009124755859375, 0.0251312255859375, 0.05938720703125, 0.1304931640625, 0.04913330078125, 0.0214385986328125, 0.055...	embed
22740391_c0	22740391	haskell	0	Title: any mature library in Haskell for network packets handling? Problem title: any mature library in Haskell for network packets handling? Tags: haskell, scapy, network-programming Problem: any mature library in Haskell for network packets handling? any mature library in Haskell for network packets handling? in pyth...	any mature library in Haskell for network packets handling? any mature library in Haskell for network packets handling? haskell scapy network-programming Haskell any mature library in Haskell for network packets handling? any mature library in Haskell for network packets handling? in python we have scapy, any similar t...	[ 0.00823974609375, 0.012939453125, 0.00154876708984375, 0.02490234375, -0.0030059814453125, 0.03271484375, -0.00098419189453125, -0.00173187255859375, -0.00119781494140625, -0.017333984375, 0.028076171875, -0.04248046875, 0.01226806640625, 0.0020751953125, -0.00701904296875, -0.00634765...	[ 2499, 90638, 35773, 1294, 23, 20625, 142508, 100, 33120, 43824, 7831, 45064, 1556, 91, 15644, 53, 28966, 17198, 50828, 765, 21373, 13580, 8999 ]	[ 0.05511474609375, 0.2073974609375, 0.2283935546875, 0.1602783203125, 0.05755615234375, 0.150634765625, 0.267822265625, 0.076416015625, 0.1494140625, 0.143310546875, 0.114013671875, 0.1513671875, 0.1180419921875, 0.033355712890625, 0.1842041015625, 0.1734619140625, 0.0810546875, 0.0...	embed
23325894_c0	23325894	haskell	0	Title: How to get cursor position in TextView in gtk2hs? Problem title: How to get cursor position in TextView in gtk2hs? Tags: haskell, gtk2hs Problem: How to get cursor position in TextView in gtk2hs? I have a TextView with assigned non-empty TextBuffer . How to get current cursor position in TextView ? Or how to get...	How to get cursor position in TextView in gtk2hs? How to get cursor position in TextView in gtk2hs? haskell gtk2hs How TextView gtk2hs TextBuffer TextIter How to get cursor position in TextView in gtk2hs? I have a TextView with assigned non-empty TextBuffer . How to get current cursor position in TextView ? Or how to g...	[ -0.00946044921875, 0.0035858154296875, 0.00970458984375, 0.00958251953125, -0.00177001953125, -0.008544921875, 0.0244140625, 0.00848388671875, -0.00439453125, -0.029052734375, 0.02197265625, -0.051025390625, -0.002838134765625, -0.01019287109375, -0.0211181640625, 0.00787353515625, -...	[ 11249, 47, 2046, 13810, 42, 19069, 23, 24129, 100474, 31472, 304, 127, 7, 706, 1556, 142508, 7235, 18234, 568, 720, 95486, 351, 33548, 43581, 98 ]	[ 0.049560546875, 0.054962158203125, 0.103759765625, 0.190185546875, 0.151611328125, 0.19580078125, 0.05133056640625, 0.1663818359375, 0.295654296875, 0.145751953125, 0.1021728515625, 0.1331787109375, 0.04766845703125, 0.01397705078125, 0.06707763671875, 0.147216796875, 0.0665283203125...	embed
36822883_c0	36822883	haskell	0	Title: undefined value in haskell Problem title: undefined value in haskell Tags: haskell, undefined Problem: undefined value in haskell Why I can't use value undefined in haskell ? I mean that in case: >let t = undefinded >if t == undefined then "undefined" else "not undefined" It throws *** Exception: Prelude.undefin...	undefined value in haskell undefined value in haskell haskell undefined Exception Prelude.undefined undefined value in haskell Why I can't use value undefined in haskell ? I mean that in case: It throws *** Exception: Prelude.undefined Can't I use undefined value in such way ?	[ -0.0023040771484375, 0.01239013671875, 0.024169921875, -0.008544921875, 0.019775390625, -0.006500244140625, 0.005950927734375, 0.004852294921875, -0.0135498046875, -0.022705078125, -0.0107421875, 0.00531005859375, 0.0162353515625, 0.007659912109375, 0.007659912109375, 0.0146484375, 0...	[ 9232, 5983, 297, 34292, 23, 1556, 142508, 5443, 63928, 1914, 822, 112, 59437, 44084, 831, 18, 4527, 7225, 104250, 24428, 4171, 6044, 3917 ]	[ 0.1507568359375, 0.1998291015625, 0.1190185546875, 0.2183837890625, 0.049072265625, 0.1522216796875, 0.2379150390625, 0.0382080078125, 0.14404296875, 0.080322265625, 0.1531982421875, 0.128662109375, 0.1082763671875, 0.03167724609375, 0.0797119140625, 0.07891845703125, 0.1378173828125...	embed
27748744_c0	27748744	haskell	0	Title: How to apply a function to a value inside a constructor in haskell? Problem title: How to apply a function to a value inside a constructor in haskell? Tags: haskell Problem: How to apply a function to a value inside a constructor in haskell? Code signals: f, How, MuOp, Name, QName, QOp, Exp, Decl, Literal, Guard...	How to apply a function to a value inside a constructor in haskell? How to apply a function to a value inside a constructor in haskell? haskell f How MuOp Name QName QOp Exp Decl Literal GuardedRhs Bool Couldn Test MuCheck MuOp.hs:28:10 Relevant MuOp.hs:29:7 MuOp.hs:29:1 How to apply a function to a value inside a cons...	[ 0.0020294189453125, -0.0250244140625, -0.00138092041015625, 0.0166015625, 0.0108642578125, -0.0006256103515625, -0.00714111328125, 0.00927734375, 0.00787353515625, -0.029052734375, 0.010498046875, 0.005096435546875, 0.0164794921875, -0.0035858154296875, 0.0111083984375, -0.013732910156...	[ 11249, 47, 59911, 32354, 34292, 46132, 64549, 748, 23, 1556, 142508, 10, 1238, 2758, 39029, 15757, 2396, 163612, 60075, 25755, 141, 135940, 135440, 297, 2460, 929, 191147, 8647, 202567, 28270, 15110, 133, 30624, 29223, 127, 19721, 759, 61924,...	[ 0.0755615234375, 0.1771240234375, 0.2418212890625, 0.2403564453125, 0.193603515625, 0.2041015625, 0.193359375, 0.187744140625, 0.04119873046875, 0.16015625, 0.2479248046875, 0.055328369140625, 0.0770263671875, 0.1212158203125, 0.16357421875, 0.01605224609375, 0.046722412109375, 0.1...	embed
49357344_c0	49357344	haskell	0	Title: Haskell String list to Int list Problem title: Haskell String list to Int list Tags: haskell Problem: Haskell String list to Int list I have a list of strings and I want to read the strings one by one and convert it into a list of ints, is there a way to convert each character into a new list? ["123","346","789"...	Haskell String list to Int list Haskell String list to Int list haskell Haskell Haskell String list to Int list I have a list of strings and I want to read the strings one by one and convert it into a list of ints, is there a way to convert each character into a new list?	[ -0.016845703125, -0.0032806396484375, 0.001556396484375, 0.011962890625, -0.020263671875, 0.0302734375, 0.0072021484375, -0.0152587890625, 0.005828857421875, 0.0177001953125, 0.000133514404296875, -0.03515625, -0.000823974609375, 0.02734375, -0.015380859375, -0.0181884765625, 0.01483...	[ 20625, 142508, 23351, 214, 5303, 47, 360, 18, 1556, 765, 79315, 3444, 12301, 1632, 390, 96760, 3934, 23, 933, 3917, 12638, 62816, 3525 ]	[ 0.1231689453125, 0.21484375, 0.2022705078125, 0.10748291015625, 0.2490234375, 0.08941650390625, 0.153076171875, 0.2042236328125, 0.11578369140625, 0.0050811767578125, 0.192138671875, 0.048370361328125, 0.1556396484375, 0.049835205078125, 0.01381683349609375, 0.1514892578125, 0.039855...	embed
30244831_c0	30244831	haskell	0	Title: Haskell – SPOJ – Code 'TEST' Problem title: Haskell – SPOJ – Code 'TEST' Tags: haskell Problem: Haskell – SPOJ – Code 'TEST' I am trying to solve the first SPOJ-problem in Haskell, but always end up having a parse error on input if . Is this a common problem? main = do input <- getLine if inp...	Haskell – SPOJ – Code 'TEST' Haskell – SPOJ – Code 'TEST' haskell Haskell SPOJ TEST Haskell – SPOJ – Code 'TEST' I am trying to solve the first SPOJ-problem in Haskell, but always end up having a parse error on input if . Is this a common problem?	[ -0.025634765625, 0.0157470703125, -0.003662109375, 0.0029449462890625, 0.0098876953125, 0.00174713134765625, 0.01611328125, -0.0017852783203125, -0.0025634765625, -0.033935546875, 0.00022792816162109375, -0.0032958984375, -0.0296630859375, 0.0162353515625, 0.0020751953125, 0.0297851562...	[ 20625, 142508, 140195, 1375, 28864, 3768, 618, 21828, 1556, 384, 46, 31577, 86869, 70, 5117, 38953, 1284, 11343, 3564, 1257, 19441, 366, 184, 18499, 98, 107730, 2174, 2071, 903, 39210, 2967 ]	[ 0.155029296875, 0.24951171875, 0.2069091796875, 0.2275390625, 0.182861328125, 0.09918212890625, 0.1885986328125, 0.230224609375, 0.1053466796875, 0.1776123046875, 0.001678466796875, 0.07196044921875, 0.108154296875, 0.00830078125, 0.0849609375, 0.1549072265625, 0.00732421875, 0.119...	embed
78565791_c1	78565791	haskell	1	>> ~/.vimrc WORKDIR /codegen COPY dhscanner.cabal dhscanner.cabal RUN cabal build --only-dependencies COPY dhscanner.ast dhscanner.ast COPY dhscanner.bitcode dhscanner.bitcode COPY src src RUN cabal build CMD ["cabal", "run"] Code signals: REPOSITORY, TAG, IMAGE, CREATED, SIZE, b29ba20efc6f, c63e806cc26b, b05d4d3d9cfa...	>> ~/.vimrc WORKDIR /codegen COPY dhscanner.cabal dhscanner.cabal RUN cabal build --only-dependencies COPY dhscanner.ast dhscanner.ast COPY dhscanner.bitcode dhscanner.bitcode COPY src src RUN cabal build CMD ["cabal", "run"] Code signals: REPOSITORY, TAG, IMAGE, CREATED, SIZE, b29ba20efc6f, c63e806cc26b, b05d4d3d9cfa...	[ 0.00146484375, -0.0028839111328125, 0.004852294921875, 0.04638671875, 0.0108642578125, 0.021728515625, -0.0322265625, -0.004486083984375, -0.0126953125, -0.000682830810546875, 0.02783203125, -0.0079345703125, -0.00112152099609375, 0.015380859375, -0.0213623046875, -0.0106201171875, 0...	[ 6396, 6780, 64, 5, 29671, 19437, 231355, 123237, 248, 40899, 1409, 153003, 1723, 11450, 16275, 13857, 408, 3571, 130747, 109524, 45367, 191, 538, 105254, 13, 117538, 4438, 3137, 313, 44644, 16428, 58, 28864, 26073, 7, 12, 6, 165547, 84658, ...	[ 0.04541015625, 0.017120361328125, 0.040008544921875, 0.0216064453125, 0.15966796875, 0.2275390625, 0.19189453125, 0.2430419921875, 0.002288818359375, 0.19482421875, 0.2440185546875, 0.16015625, 0.1546630859375, 0.1112060546875, 0.1964111328125, 0.2181396484375, 0.125732421875, 0.26...	embed
19405778_c0	19405778	haskell	0	Title: How to add two lists in haskell? Problem title: How to add two lists in haskell? Tags: haskell Problem: How to add two lists in haskell? how can I add for example [1,2,3] to [5,4,6] to return [6,6,8] This is what I have so far: func1 :: [Int]->[Int]->[Int] func1 x y = [a+b\|a<-x,b<-y] Should I try and remove the ...	How to add two lists in haskell? How to add two lists in haskell? haskell How func1 How to add two lists in haskell? how can I add for example [1,2,3] to [5,4,6] to return [6,6,8] This is what I have so far: Should I try and remove the elements that I don't want or is there a simpler way to do this?	[ -0.004241943359375, 0.01385498046875, 0.006317138671875, 0.01080322265625, -0.01251220703125, 0.0238037109375, -0.004058837890625, 0.004638671875, 0.01361083984375, -0.023193359375, 0.0224609375, -0.0135498046875, -0.000698089599609375, 0.0250244140625, 0.004638671875, -0.029052734375,...	[ 11249, 47, 15190, 6626, 5303, 7, 23, 1556, 142508, 7477, 418, 3642, 831, 27781, 68252, 155761, 758, 128191, 30646, 910, 151664, 2060, 9790, 87388, 80854, 2301, 18, 3444, 8781 ]	[ 0.09259033203125, 0.08380126953125, 0.182861328125, 0.19140625, 0.2470703125, 0.09930419921875, 0.0732421875, 0.16845703125, 0.2364501953125, 0.078125, 0.0259552001953125, 0.04107666015625, 0.0181121826171875, 0.0394287109375, 0.005126953125, 0.1839599609375, 0.07513427734375, 0.19...	embed
74540407_c0	74540407	haskell	0	Title: Getting a match type error while trying to find the sum of a number using the numbers in the number Problem title: Getting a match type error while trying to find the sum of a number using the numbers in the number Tags: haskell Problem: Getting a match type error while trying to find the sum of a number using t...	Getting a match type error while trying to find the sum of a number using the numbers in the number Getting a match type error while trying to find the sum of a number using the numbers in the number haskell the Getting Bool Couldn Char Expected Actual Getting a match type error while trying to find the sum of a number...	[ -0.0218505859375, 0.00689697265625, 0.00701904296875, 0.01458740234375, -0.0036468505859375, -0.0008544921875, -0.0213623046875, 0.00830078125, 0.0213623046875, 0.00118255615234375, 0.00946044921875, -0.032470703125, 0.0098876953125, 0.006927490234375, 0.01068115234375, -0.005126953125...	[ 210732, 14858, 10644, 18499, 12960, 31577, 7413, 10554, 14012, 17368, 101935, 23, 1556, 142508, 2460, 929, 191147, 19, 21656, 60075, 13, 100582, 13695, 20949, 98816, 6002, 86531, 45767, 26366, 86869, 40899, 4205, 11222, 152999, 1517, 73, 10557,...	[ 0.1376953125, 0.24072265625, 0.2308349609375, 0.205078125, 0.0625, 0.08489990234375, 0.058441162109375, 0.1678466796875, 0.1077880859375, 0.10150146484375, 0.1341552734375, 0.0675048828125, 0.1302490234375, 0.22900390625, 0.07861328125, 0.15966796875, 0.1466064453125, 0.09173583984...	embed
67461458_c1	67461458	haskell	1	one. addAllPops :: [City] -> [Int] -> [City] addAllPops [(w, ((x,y), z))] pops = [map uncurry addPop (zip pops z)] addPop :: City -> Int -> City addPop (w, ((x,y), z)) p = (w, ((x,y), p:z)) I've been stuck on this for an embarassingly long amount of time, any and all assistance is greatly appreciated :) Code signals: ...	one. addAllPops :: [City] -> [Int] -> [City] addAllPops [(w, ((x,y), z))] pops = [map uncurry addPop (zip pops z)] addPop :: City -> Int -> City addPop (w, ((x,y), z)) p = (w, ((x,y), p:z)) I've been stuck on this for an embarassingly long amount of time, any and all assistance is greatly appreciated :) Code signals: ...	[ 0.007171630859375, -0.004302978515625, -0.0004863739013671875, 0.0179443359375, -0.03662109375, 0.003997802734375, 0.0072021484375, -0.023681640625, 0.015869140625, -0.01324462890625, 0.03271484375, 0.007781982421875, 0.0179443359375, -0.0019989013671875, -0.0166015625, -0.02001953125,...	[ 1632, 15190, 43512, 127642, 7, 1984, 115411, 33079, 4153, 18, 434, 425, 53, 97, 7426, 2203, 62346, 64240, 50836, 6406, 360, 915, 12, 169, 2809, 179933, 98, 903, 82849, 38001, 4989, 756, 127557, 77947, 1094, 28864, 26073, 11249, 20625, 142...	[ 0.1402587890625, 0.1920166015625, 0.1671142578125, 0.265380859375, 0.1573486328125, 0.00494384765625, 0.1466064453125, 0.0151519775390625, 0.03070068359375, 0.0789794921875, 0.107177734375, 0.00079345703125, 0.051422119140625, 0.1068115234375, 0.22412109375, 0.042999267578125, 0.1208...	embed
18678944_c0	18678944	haskell	0	Title: Hello World for OpenGL+GLUT in Haskell not working on OSX Lion Problem title: Hello World for OpenGL+GLUT in Haskell not working on OSX Lion Tags: opengl, macos, haskell, glut Problem: Hello World for OpenGL+GLUT in Haskell not working on OSX Lion Code signals: Graphics.Rendering.OpenGL, Graphics.UI.GLUT, Hello,...	Hello World for OpenGL+GLUT in Haskell not working on OSX Lion Hello World for OpenGL+GLUT in Haskell not working on OSX Lion opengl macos haskell glut Graphics.Rendering.OpenGL Graphics.UI.GLUT Hello World OpenGL GLUT Haskell OSX Lion HelloWorld.hs HelloWorld Warning Fatal Error Hello World for OpenGL+GLUT in Haskell ...	[ -0.005035400390625, 0.0150146484375, -0.007415771484375, -0.0169677734375, 0.00131988525390625, -0.00023174285888671875, 0.0079345703125, -0.025634765625, -0.0181884765625, 0.0126953125, -0.014892578125, -0.055908203125, 0.003509521484375, -0.01129150390625, 0.005615234375, 0.001388549...	[ 35378, 6661, 100, 13527, 78703, 1328, 724, 143662, 23, 20625, 142508, 959, 20697, 98, 11787, 1542, 82209, 9803, 11016, 291, 7840, 1556, 167994, 189682, 33, 111747, 103264, 33457, 527, 70646, 127, 5550, 3036, 1803, 212059, 25632, 1528, 5974, ...	[ 0.2083740234375, 0.2144775390625, 0.057098388671875, 0.1453857421875, 0.2265625, 0.16162109375, 0.114990234375, 0.26953125, 0.0413818359375, 0.156982421875, 0.25830078125, 0.080322265625, 0.15625, 0.064208984375, 0.1385498046875, 0.087646484375, 0.2254638671875, 0.0972900390625, ...	embed
20523494_c0	20523494	haskell	0	Title: What does this function produce Problem title: What does this function produce Tags: haskell Problem: What does this function produce What is the type and the value of the expression: do [1,2,3]; "lambda" I tested it and found out that it just print lambda 3 times. But i don't understand why it does that. how ca...	What does this function produce What does this function produce haskell What What does this function produce What is the type and the value of the expression: I tested it and found out that it just print lambda 3 times. But i don't understand why it does that. how can i rewrite it using bind. It feels like it is necess...	[ -0.01483154296875, 0.0004749298095703125, -0.01373291015625, 0.0028839111328125, -0.0142822265625, 0.02099609375, 0.004791259765625, 0.015380859375, 0.000171661376953125, -0.0184326171875, -0.0157470703125, -0.04150390625, -0.00726318359375, 0.006866455078125, -0.018798828125, 0.018310...	[ 4865, 14602, 903, 32354, 27489, 1556, 142508, 10644, 136, 34292, 125195, 3034, 442, 1660, 28412, 21, 6492, 85, 138, 20028, 2301, 18, 28219, 15400, 456, 434, 18781, 17368, 68557, 12319, 63559 ]	[ 0.0914306640625, 0.14697265625, 0.1568603515625, 0.2474365234375, 0.244140625, 0.17626953125, 0.279052734375, 0.1781005859375, 0.00531005859375, 0.1337890625, 0.2335205078125, 0.1177978515625, 0.001953125, 0.06878662109375, 0.1932373046875, 0.086181640625, 0.2056884765625, 0.164794...	embed
15183324_c0	15183324	haskell	0	Title: What is the difference between pure and impure in haskell? Problem title: What is the difference between pure and impure in haskell? Tags: haskell, functional-programming Problem: What is the difference between pure and impure in haskell? What is the difference between pure and impure in haskell? When doing IO i...	What is the difference between pure and impure in haskell? What is the difference between pure and impure in haskell? haskell functional-programming What What is the difference between pure and impure in haskell? What is the difference between pure and impure in haskell? When doing IO in haskell, what does it mean to k...	[ -0.00183868408203125, 0.0074462890625, 0.0157470703125, 0.001678466796875, -0.008056640625, 0.0263671875, -0.0137939453125, -0.01019287109375, 0.005126953125, 0.025390625, 0.00445556640625, -0.034423828125, -0.00909423828125, 0.0225830078125, -0.00537109375, 0.027587890625, 0.0224609...	[ 60212, 17721, 34166, 136, 21980, 3408, 23, 1556, 142508, 123309, 28966, 4865, 83, 70, 17780, 29459, 13695, 55769, 84797 ]	[ 0.193603515625, 0.10211181640625, 0.2430419921875, 0.1224365234375, 0.1905517578125, 0.2222900390625, 0.0792236328125, 0.16552734375, 0.255859375, 0.1251220703125, 0.07244873046875, 0.011077880859375, 0.019775390625, 0.05731201171875, 0.1558837890625, 0.026092529296875, 0.07794189453...	embed
75525817_c0	75525817	haskell	0	Title: trying to find n in a list without using elem Problem title: trying to find n in a list without using elem Tags: haskell Problem: trying to find n in a list without using elem I am trying to find n in a list of integers, out should be true if n is present without using the elem function. present:: Integer -> [In...	trying to find n in a list without using elem trying to find n in a list without using elem haskell elem Integer Bool trying to find n in a list without using elem I am trying to find n in a list of integers, out should be true if n is present without using the elem function.	[ -0.0118408203125, -0.0024261474609375, 0.0162353515625, -0.0233154296875, -0.00055694580078125, 0.023681640625, 0.0113525390625, -0.01544189453125, -0.017333984375, -0.02685546875, 0.0155029296875, -0.0189208984375, -0.01495361328125, 0.002227783203125, -0.006500244140625, -0.011291503...	[ 31577, 7413, 653, 23, 5303, 15490, 17368, 88, 195, 47, 10, 1556, 142508, 44401, 2460, 929, 892, 26255, 1810, 5608, 29568, 2174, 13379, 32354 ]	[ 0.11334228515625, 0.1341552734375, 0.17626953125, 0.12188720703125, 0.21044921875, 0.12066650390625, 0.08172607421875, 0.09954833984375, 0.19189453125, 0.00791168212890625, 0.0261383056640625, 0.09698486328125, 0.18408203125, 0.15771484375, 0.08221435546875, 0.18896484375, 0.13220214...	embed
60614612_c0	60614612	haskell	0	Title: How to translate a list comprehension to a version using concatMap? Problem title: How to translate a list comprehension to a version using concatMap? Tags: haskell Problem: How to translate a list comprehension to a version using concatMap? How can I translate a list comprehension to a version that uses concatM...	How to translate a list comprehension to a version using concatMap? How to translate a list comprehension to a version using concatMap? haskell concatMap How How to translate a list comprehension to a version using concatMap? How can I translate a list comprehension to a version that uses concatMap instead?	[ -0.0064697265625, -0.004852294921875, 0.011962890625, -0.01275634765625, 0.00506591796875, 0.0036163330078125, -0.0164794921875, 0.0004673004150390625, 0.0013275146484375, -0.025146484375, -0.0184326171875, 0.0024566650390625, 0.017333984375, -0.005859375, -0.0257568359375, -0.00064468...	[ 11249, 3900, 19309, 5303, 46683, 3220, 6889, 47, 11389, 158, 4460, 166179, 17368, 1556, 142508, 4527 ]	[ 0.039764404296875, 0.12451171875, 0.1517333984375, 0.1494140625, 0.1270751953125, 0.1297607421875, 0.035552978515625, 0.065185546875, 0.147216796875, 0.11376953125, 0.19921875, 0.187255859375, 0.004547119140625, 0.0692138671875, 0.1688232421875, 0.012481689453125 ]	embed
34707983_c0	34707983	haskell	0	Title: Meaning of single colon in Haskell :t Problem title: Meaning of single colon in Haskell :t Tags: haskell Problem: Meaning of single colon in Haskell :t As far as I've been able to gather, the single colon in Haskell is used in list comprehension. Why then does it show up in the :t command? Also in the :quit comm...	Meaning of single colon in Haskell :t Meaning of single colon in Haskell :t haskell Meaning Haskell Meaning of single colon in Haskell :t As far as I've been able to gather, the single colon in Haskell is used in list comprehension. Why then does it show up in the :t command? Also in the :quit command? There isn't any ...	[ 0.01806640625, -0.005706787109375, 0.0000762939453125, 0.0263671875, -0.0004673004150390625, -0.00067901611328125, 0.00131988525390625, 0.0101318359375, 0.0023040771484375, -0.01416015625, 0.01019287109375, -0.041015625, 0.015625, 0.004302978515625, -0.038330078125, -0.00714111328125, ...	[ 1215, 11, 11001, 46512, 20625, 142508, 18, 23, 1556, 11814, 5303, 46683, 3220, 6889, 44084, 7639, 1257, 152, 75101, 3181 ]	[ 0.0716552734375, 0.0782470703125, 0.1912841796875, 0.25048828125, 0.1260986328125, 0.2216796875, 0.15185546875, 0.01251220703125, 0.115478515625, 0.10498046875, 0.143798828125, 0.09576416015625, 0.10400390625, 0.005645751953125, 0.008026123046875, 0.057647705078125, 0.018600463867187...	embed
17241320_c0	17241320	haskell	0	Title: Haskell more complex predicate Problem title: Haskell more complex predicate Tags: haskell Problem: Haskell more complex predicate I'm learning Haskell, and I'm wondering how to have a predicate that's a bit more complex. For example, I can do this: any ( >= 5 ) my_list But I can't find a way how to do something...	Haskell more complex predicate Haskell more complex predicate haskell Haskell my_list Haskell more complex predicate I'm learning Haskell, and I'm wondering how to have a predicate that's a bit more complex. For example, I can do this: But I can't find a way how to do something like this: How could I do this?	[ -0.01080322265625, 0.0181884765625, 0.01092529296875, -0.001617431640625, 0.0125732421875, 0.04052734375, 0.0167236328125, 0.002960205078125, 0.0225830078125, -0.04345703125, 0.0235595703125, -0.0361328125, 0.033447265625, 0.01190185546875, -0.012451171875, -0.0018310546875, -0.00915...	[ 20625, 142508, 1286, 27140, 1653, 2063, 1556, 759, 6562, 67, 52080, 149016, 3642, 47, 765, 10, 450, 4785, 27781, 831, 54, 903, 4966, 18, 7413, 3917, 9844, 1884, 11249, 5809 ]	[ 0.1424560546875, 0.207763671875, 0.1409912109375, 0.2264404296875, 0.18115234375, 0.2255859375, 0.150634765625, 0.12255859375, 0.2027587890625, 0.1324462890625, 0.0634765625, 0.05218505859375, 0.04583740234375, 0.010589599609375, 0.101318359375, 0.0144805908203125, 0.0214996337890625...	embed
27177667_c0	27177667	haskell	0	Title: Haskell split user input Problem title: Haskell split user input Tags: haskell Problem: Haskell split user input I want to take first three elements from user input in Haskell, but I got error message. Thank you for the help getCmd cmd = do putStrLn take 3 cmd main = do putStrLn "please type something" name <- g...	Haskell split user input Haskell split user input haskell Haskell QUIT Haskell split user input I want to take first three elements from user input in Haskell, but I got error message. Thank you for the help	[ -0.017822265625, 0.004974365234375, -0.00112152099609375, 0.0211181640625, -0.0111083984375, 0.017822265625, 0.002593994140625, 0.00015735626220703125, 0.01409912109375, -0.0264892578125, -0.002349853515625, -0.01129150390625, -0.00408935546875, -0.0081787109375, -0.008544921875, 0.002...	[ 20625, 142508, 65450, 38937, 107730, 1556, 142363, 618, 3444, 5646, 5117, 17262, 80854, 1295, 18499, 26008, 4358 ]	[ 0.1572265625, 0.259765625, 0.239013671875, 0.1788330078125, 0.23486328125, 0.131591796875, 0.16064453125, 0.1357421875, 0.0758056640625, 0.1258544921875, 0.1226806640625, 0.1617431640625, 0.187255859375, 0.09466552734375, 0.1591796875, 0.09326171875, 0.0333251953125 ]	embed
6964392_c2	6964392	haskell	2	, Python, Erlang, Haskell, euler12.bin, euler12.c, euler12.py, Downloads, pypy-c-jit-43780-b590cf6de419-linux64, euler12.erl, euler12, R13B03, erts-5.7.4, smp:4:4, rq:4, async-threads:0, kernel-poll:false, Eshell, V5.7.4, euler12.hs, euler12.hsx, Compiling, Main, euler12.o, Linking, MAXINT, stdio.h, math.h, python3.2, ...	, Python, Erlang, Haskell, euler12.bin, euler12.c, euler12.py, Downloads, pypy-c-jit-43780-b590cf6de419-linux64, euler12.erl, euler12, R13B03, erts-5.7.4, smp:4:4, rq:4, async-threads:0, kernel-poll:false, Eshell, V5.7.4, euler12.hs, euler12.hsx, Compiling, Main, euler12.o, Linking, MAXINT, stdio.h, math.h, python3.2, ...	[ -0.00970458984375, 0.0115966796875, 0.00823974609375, 0.0294189453125, 0.01165771484375, 0.00396728515625, -0.009765625, -0.0185546875, 0.00023651123046875, -0.00738525390625, 0.006622314453125, -0.03271484375, -0.00518798828125, -0.02197265625, 0.007354736328125, -0.00335693359375, ...	[ 6, 4, 145581, 1004, 3066, 20625, 142508, 1175, 603, 1530, 5, 7568, 238, 6493, 4857, 17198, 29676, 152719, 4836, 9, 116708, 112, 2947, 2397, 6077, 13307, 56, 141, 627, 2681, 571, 9513, 72, 933, 160355, 617, 2676, 12, 864, 12654, 39116, ...	[ 0.05078125, 0.111572265625, 0.318115234375, 0.17431640625, 0.32568359375, 0.169677734375, 0.317626953125, 0.1614990234375, 0.2474365234375, 0.227294921875, 0.0986328125, 0.2144775390625, 0.07568359375, 0.2432861328125, 0.2249755859375, 0.1114501953125, 0.18408203125, 0.095092773437...	embed
23863857_c0	23863857	haskell	0	Title: Convert myType to Int Problem title: Convert myType to Int Tags: casting, converters, haskell Problem: Convert myType to Int I have my type, which defined here: data Nat = Zero \| Succ Nat deriving Show I want to defined function, that convert Nat to Int. Help please all my attempts are like this: toInt :: Nat ->...	Convert myType to Int Convert myType to Int casting converters haskell Convert Nat Zero Succ Show Convert myType to Int I have my type, which defined here: data Nat = Zero \| Succ Nat deriving Show I want to defined function, that convert Nat to Int. Help please all my attempts are like this: and give not result	[ -0.0181884765625, -0.0037689208984375, 0.01116943359375, 0.01287841796875, -0.00933837890625, 0.01239013671875, 0.007415771484375, 0.0010528564453125, -0.005767822265625, -0.0277099609375, 0.00811767578125, -0.027099609375, -0.01104736328125, 0.0284423828125, 0.008544921875, -0.0000284...	[ 1657, 11549, 759, 196707, 47, 360, 18, 176050, 172127, 1556, 142508, 68875, 83947, 1832, 10060, 17367, 10644, 61924, 3688, 2053, 6, 16406, 6496, 3444, 32354, 96760, 39527, 22936, 81887, 1884, 959, 16750 ]	[ 0.04620361328125, 0.1573486328125, 0.197265625, 0.325927734375, 0.1202392578125, 0.1640625, 0.2049560546875, 0.1458740234375, 0.1927490234375, 0.0982666015625, 0.1956787109375, 0.2294921875, 0.1727294921875, 0.1295166015625, 0.144775390625, 0.1710205078125, 0.2440185546875, 0.13000...	embed
24004265_c0	24004265	haskell	0	Title: IO which is executed out of order Problem title: IO which is executed out of order Tags: haskell Problem: IO which is executed out of order I created simple program. Take some input and repeat it but...IO is executed out of order. What can I do with it? main = putStr "Plese write some characters: " >> getLine >>...	IO which is executed out of order IO which is executed out of order haskell Plese You Bye IO which is executed out of order I created simple program. Take some input and repeat it but...IO is executed out of order. What can I do with it?	[ -0.001922607421875, 0.003082275390625, -0.01055908203125, 0.012451171875, 0.0069580078125, 0.0150146484375, 0.0111083984375, -0.000186920166015625, 0.007049560546875, 0.003997802734375, 0.00592041015625, -0.0152587890625, -0.00116729736328125, 0.0057373046875, 0.00836181640625, 0.00787...	[ 17780, 3129, 83, 71924, 297, 1810, 111, 12989, 1556, 142508, 19434, 184, 2583, 3311, 13, 87, 75935, 8781, 1528, 46673, 3060, 107730, 119140, 442, 1284, 27, 4865, 831, 54, 678 ]	[ 0.27978515625, 0.1099853515625, 0.1142578125, 0.2020263671875, 0.10284423828125, 0.187255859375, 0.2017822265625, 0.2244873046875, 0.1448974609375, 0.2330322265625, 0.1778564453125, 0.1407470703125, 0.154541015625, 0.137939453125, 0.076416015625, 0.0513916015625, 0.10662841796875, ...	embed
55295816_c0	55295816	haskell	0	Title: Haskell why using @ (as) Problem title: Haskell why using @ (as) Tags: pattern-matching, haskell Problem: Haskell why using @ (as) Came across this example: buildEntry ws@(w:_) = (w, length ws) What's the advantage of using ws@(w:_) instead of: buildEntry' (w:ws) = (w, length (w:ws)) Since I am only a beginner, ...	Haskell why using @ (as) Haskell why using @ (as) pattern-matching haskell @ Haskell w:_ w:ws Haskell why using @ (as) Came across this example: What's the advantage of using ws@(w:_) instead of: Since I am only a beginner, I think readability of the second example is also better.	[ -0.020751953125, 0.0159912109375, -0.005584716796875, -0.0174560546875, -0.004791259765625, -0.002349853515625, -0.0057373046875, 0.004425048828125, 0.0213623046875, -0.0211181640625, 0.03173828125, -0.0023956298828125, 0.02099609375, 0.0113525390625, 0.001861572265625, 0.0055541992187...	[ 20625, 142508, 15400, 17368, 1374, 162, 103510, 98753, 214, 1556, 148, 12, 19725, 27781, 92940, 7, 981, 434, 454, 64457, 9842, 1679, 5351, 12301, 41159, 17932, 11522 ]	[ 0.154541015625, 0.221923828125, 0.13427734375, 0.1192626953125, 0.18359375, 0.1812744140625, 0.1551513671875, 0.1690673828125, 0.001617431640625, 0.160888671875, 0.09747314453125, 0.08551025390625, 0.11572265625, 0.1004638671875, 0.1417236328125, 0.06884765625, 0.1463623046875, 0.1...	embed
12876384_c0	12876384	haskell	0	Title: Grouping a list into lists of n elements in Haskell Problem title: Grouping a list into lists of n elements in Haskell Tags: haskell, list Problem: Grouping a list into lists of n elements in Haskell Is there an operation on lists in library that makes groups of n elements? For example: n=3 groupInto 3 [1,2,3,4,...	Grouping a list into lists of n elements in Haskell Grouping a list into lists of n elements in Haskell haskell list Grouping Haskell Grouping a list into lists of n elements in Haskell Is there an operation on lists in library that makes groups of n elements? For example: n=3 If not, how do I do it?	[ -0.007568359375, 0.006195068359375, 0.0167236328125, -0.011962890625, -0.01007080078125, 0.0223388671875, -0.01153564453125, -0.020263671875, 0.0155029296875, 0.002410888671875, -0.006622314453125, -0.03173828125, 0.00860595703125, -0.003875732421875, -0.024169921875, 0.004058837890625...	[ 10760, 214, 5303, 3934, 7, 111, 653, 80854, 20625, 142508, 23, 1556, 2071, 2685, 142, 41018, 98, 35773, 1294, 450, 30482, 94407, 27781, 76067, 959, 3642, 54 ]	[ 0.2496337890625, 0.0335693359375, 0.2176513671875, 0.1689453125, 0.09381103515625, 0.109375, 0.21044921875, 0.220947265625, 0.1480712890625, 0.2269287109375, 0.0418701171875, 0.1363525390625, 0.010162353515625, 0.048614501953125, 0.04608154296875, 0.18359375, 0.071044921875, 0.1606...	embed
2469139_c0	2469139	haskell	0	Title: Equivalent of python eval in Haskell Problem title: Equivalent of python eval in Haskell Tags: python, haskell, eval, metaprogramming Problem: Equivalent of python eval in Haskell There is function in python called eval that takes string input and evaluates it. >>> x = 1 >>> print eval('x+1') 2 >>> print eval('1...	Equivalent of python eval in Haskell Equivalent of python eval in Haskell python haskell eval metaprogramming Equivalent Haskell Equivalent of python eval in Haskell There is function in python called eval that takes string input and evaluates it. What is Haskell equivalent of eval function?	[ -0.0023345947265625, 0.0135498046875, 0.00775146484375, 0.0191650390625, 0.007049560546875, 0.00531005859375, 0.0186767578125, -0.0142822265625, -0.000225067138671875, -0.04443359375, -0.005584716796875, -0.01446533203125, 0.018310546875, 0.00092315673828125, -0.0081787109375, -0.00457...	[ 145666, 85540, 17198, 50828, 28, 1405, 23, 20625, 142508, 111, 1556, 23550, 28966, 32354, 35839, 51776, 79315, 107730, 136, 151575, 442, 4865, 83, 183234 ]	[ 0.096923828125, 0.1805419921875, 0.1097412109375, 0.1527099609375, 0.1297607421875, 0.281005859375, 0.04046630859375, 0.1444091796875, 0.2449951171875, 0.0513916015625, 0.1326904296875, 0.126220703125, 0.12255859375, 0.17529296875, 0.039764404296875, 0.130859375, 0.1884765625, 0.17...	embed
11015395_c0	11015395	haskell	0	Title: Find out what flags we are building with in Setup.hs Problem title: Find out what flags we are building with in Setup.hs Tags: cabal, haskell Problem: Find out what flags we are building with in Setup.hs I need to find out what flags (the type found in cabal files) are being built with in Setup.hs. I think I'm l...	Find out what flags we are building with in Setup.hs Find out what flags we are building with in Setup.hs cabal haskell Find Setup.hs Find out what flags we are building with in Setup.hs I need to find out what flags (the type found in cabal files) are being built with in Setup.hs. I think I'm looking for something wit...	[ 0.00714111328125, -0.01068115234375, 0.01300048828125, 0.003570556640625, -0.006103515625, 0.005828857421875, -0.0264892578125, 0.009765625, 0.000514984130859375, 0.01287841796875, -0.01287841796875, -0.049560546875, 0.001983642578125, -0.00909423828125, -0.000560760498046875, 0.040527...	[ 26040, 1810, 2367, 49938, 7, 642, 621, 33976, 678, 19943, 2037, 127, 109524, 1556, 142508, 23, 3871, 7413, 10644, 14037, 102158, 8035, 88303, 16487, 125726, 19659, 31304, 674, 2046 ]	[ 0.09881591796875, 0.0633544921875, 0.05816650390625, 0.251953125, 0.12646484375, 0.039947509765625, 0.0251312255859375, 0.1279296875, 0.1220703125, 0.17919921875, 0.1553955078125, 0.1168212890625, 0.2210693359375, 0.1036376953125, 0.1708984375, 0.03216552734375, 0.044403076171875, ...	embed
35381853_c1	35381853	haskell	1	n -> do { str <- rstr n; text ("boo:" <> str <> "!") }’ In a stmt of a 'do' block: get ("data" <//> var) $ \ n -> do { str <- rstr n; text ("boo:" <> str <> "!") } How can I use my IO -driven random string function inside the Spock get request handler? Code signals: System.Random, Data.Monoid, Data.Text, Lib, Web.Spoc...	n -> do { str <- rstr n; text ("boo:" <> str <> "!") }’ In a stmt of a 'do' block: get ("data" <//> var) $ \ n -> do { str <- rstr n; text ("boo:" <> str <> "!") } How can I use my IO -driven random string function inside the Spock get request handler? Code signals: System.Random, Data.Monoid, Data.Text, Lib, Web.Spoc...	[ -0.017578125, -0.00750732421875, -0.004486083984375, -0.0045166015625, 0.00016498565673828125, 0.02587890625, 0.0225830078125, -0.0260009765625, 0.01177978515625, -0.056640625, 0.0201416015625, -0.00970458984375, -0.0205078125, -0.00799560546875, 0.0003204345703125, 0.01043701171875, ...	[ 653, 33079, 54, 7704, 9, 1690, 9297, 74, 7986, 54487, 12, 3890, 26, 360, 6138, 39, 18, 111, 246, 46389, 2046, 10135, 20767, 285, 3650, 11249, 831, 87, 4527, 759, 17780, 33926, 96759, 79315, 32354, 46132, 23172, 2594, 50336, 35863, 28864...	[ 0.10205078125, 0.1351318359375, 0.1453857421875, 0.201904296875, 0.0299072265625, 0.006072998046875, 0.162353515625, 0.01361083984375, 0.1473388671875, 0.168212890625, 0.0860595703125, 0.1436767578125, 0.01177978515625, 0.041015625, 0.1082763671875, 0.070556640625, 0.1375732421875, ...	embed
25028248_c0	25028248	haskell	0	Title: Creating a `newtype Maybe a` Problem title: Creating a `newtype Maybe a` Tags: haskell, newtype Problem: Creating a `newtype Maybe a` I created a newtype for Maybe Int : Prelude> newtype MaybeTuple = MaybeTuple { getMaybe :: Maybe Int} Prelude> let m = MaybeTuple (Just 5) Prelude> getMaybe m Just 5 But how can I...	Creating a `newtype Maybe a` Creating a `newtype Maybe a` haskell newtype Creating Maybe Prelude MaybeTuple Just Creating a `newtype Maybe a` I created a newtype for Maybe Int : But how can I create a generic newtype of Maybe a ?	[ -0.005828857421875, 0.00543212890625, 0.0218505859375, 0.0157470703125, 0.013427734375, 0.0172119140625, 0.00994873046875, -0.003631591796875, 0.005767822265625, -0.0130615234375, -0.00909423828125, 0.0032196044921875, -0.004180908203125, 0.00494384765625, -0.003997802734375, -0.012573...	[ 56781, 1916, 54936, 50986, 83425, 10, 1556, 142508, 3525, 1914, 822, 112, 15665, 8705, 9563, 75935, 360, 18, 3642, 831, 28282, 189534, 111 ]	[ 0.1357421875, 0.06085205078125, 0.1260986328125, 0.305908203125, 0.2269287109375, 0.183349609375, 0.0938720703125, 0.19580078125, 0.150146484375, 0.031829833984375, 0.1328125, 0.0211944580078125, 0.04779052734375, 0.12109375, 0.0152130126953125, 0.11932373046875, 0.06512451171875, ...	embed
50766321_c0	50766321	haskell	0	Title: Writing a function to construct a list of descending natural numbers in Haskell Problem title: Writing a function to construct a list of descending natural numbers in Haskell Tags: haskell Problem: Writing a function to construct a list of descending natural numbers in Haskell Code signals: Writing, Haskell, fib...	Writing a function to construct a list of descending natural numbers in Haskell Writing a function to construct a list of descending natural numbers in Haskell haskell Writing Haskell fibonacci.hs:9:22 Couldn Expected Actual n:fibList prev_term twice_prev_term prior_fib_list Writing a function to construct a list of de...	[ 0.0184326171875, 0.01470947265625, -0.0177001953125, 0.018798828125, -0.00830078125, 0.0014801025390625, -0.00885009765625, 0.0146484375, 0.0252685546875, -0.0062255859375, 0.017578125, -0.035888671875, 0.0234375, 0.0155029296875, 0.005859375, 0.01458740234375, 0.029541015625, 0.00...	[ 213185, 32354, 64549, 5303, 60887, 214, 6083, 101935, 20625, 142508, 47, 1556, 809, 20990, 52544, 127, 1126, 24070, 191147, 60075, 13, 89829, 100582, 653, 1029, 275, 154663, 28468, 32166, 186351, 4692, 334, 41928, 6562, 23, 28007, 31577, 720,...	[ 0.1705322265625, 0.198486328125, 0.2059326171875, 0.190185546875, 0.2186279296875, 0.1005859375, 0.190185546875, 0.1668701171875, 0.159912109375, 0.263671875, 0.0130615234375, 0.1390380859375, 0.09832763671875, 0.150390625, 0.150390625, 0.05462646484375, 0.1177978515625, 0.12023925...	embed
36558397_c0	36558397	haskell	0	Title: Cabal testsuite - How can I pass a flag? Problem title: Cabal testsuite - How can I pass a flag? Tags: haskell, htf, cabal Problem: Cabal testsuite - How can I pass a flag? I use cabal with test-suites. The processor I use (HTF) allows flags (e.g. --quiet ). How can I add such flags in the cabal file in order to...	Cabal testsuite - How can I pass a flag? Cabal testsuite - How can I pass a flag? haskell htf cabal Cabal How Cabal testsuite - How can I pass a flag? I use cabal with test-suites. The processor I use (HTF) allows flags (e.g. --quiet ). How can I add such flags in the cabal file in order to be passed automatically to t...	[ 0.012939453125, 0.0033416748046875, 0.004608154296875, -0.01177978515625, -0.0177001953125, -0.0303955078125, 0.0013427734375, 0.0098876953125, -0.0086669921875, 0.0014801025390625, -0.001312255859375, -0.0135498046875, -0.029052734375, 0.01904296875, -0.017333984375, 0.006256103515625...	[ 30438, 289, 3034, 68879, 13, 11249, 831, 87, 27875, 10, 49938, 1556, 142508, 9703, 420, 109524, 4527, 678, 14543, 42, 18544, 919, 114864, 4210, 3181, 126, 15190, 6044, 11435, 115081, 191082, 14947, 1528, 71924 ]	[ 0.1689453125, 0.1708984375, 0.1959228515625, 0.2091064453125, 0.1156005859375, 0.094970703125, 0.07666015625, 0.054443359375, 0.1815185546875, 0.06494140625, 0.273193359375, 0.0869140625, 0.1756591796875, 0.06195068359375, 0.11083984375, 0.242431640625, 0.039794921875, 0.0225677490...	embed
18084265_c0	18084265	haskell	0	Title: Cabal - Expose all modules while building library Problem title: Cabal - Expose all modules while building library Tags: cabal, haskell Problem: Cabal - Expose all modules while building library Is it possible to tell Cabal to expose all modules while building a library? Right now I have to provide very long lis...	Cabal - Expose all modules while building library Cabal - Expose all modules while building library cabal haskell Cabal Expose Cabal - Expose all modules while building library Is it possible to tell Cabal to expose all modules while building a library? Right now I have to provide very long list of modules in the expos...	[ 0.014404296875, -0.004425048828125, -0.006622314453125, 0.024658203125, 0.0062255859375, 0.0084228515625, -0.01611328125, 0.01080322265625, 0.0130615234375, 0.01019287109375, 0.002044677734375, -0.040771484375, 0.03076171875, 0.00897216796875, -0.01470947265625, -0.0128173828125, 0.0...	[ 30438, 289, 45434, 184, 756, 88996, 7, 12960, 33976, 35773, 1294, 109524, 1556, 142508, 442, 7722, 47, 14192, 172554, 22691, 4552, 4989, 5303, 71, 83279, 59994, 11435 ]	[ 0.1859130859375, 0.1915283203125, 0.160400390625, 0.086669921875, 0.139892578125, 0.23779296875, 0.035919189453125, 0.0804443359375, 0.155517578125, 0.177734375, 0.1138916015625, 0.2117919921875, 0.061370849609375, 0.1700439453125, 0.00543212890625, 0.10546875, 0.0391845703125, 0.1...	embed
23172689_c0	23172689	haskell	0	Title: Haskell IO error handling during IO operation Problem title: Haskell IO error handling during IO operation Tags: io, error-handling, haskell Problem: Haskell IO error handling during IO operation Code signals: isPermissionError, isDoesNotExistError, Control.Exception, NoMethodError, a, Haskell, System.Directory,...	Haskell IO error handling during IO operation Haskell IO error handling during IO operation io error-handling haskell isPermissionError isDoesNotExistError Control.Exception NoMethodError a Haskell System.Directory Left Right Exception Note NestedAtomically Defined Control.Exception.Base NonTermination Haskell IO error...	[ -0.0086669921875, 0.0189208984375, 0.0125732421875, -0.011474609375, 0.004974365234375, 0.00946044921875, -0.017333984375, -0.01361083984375, -0.0020599365234375, -0.00836181640625, 0.01123046875, -0.049072265625, 0.014404296875, 0.01019287109375, 0.00124359130859375, 0.0081787109375, ...	[ 20625, 142508, 17780, 18499, 45064, 20271, 41018, 22995, 54885, 1556, 83, 15277, 21150, 18468, 31611, 8331, 90, 122116, 19279, 1419, 27131, 63928, 438, 78572, 7352, 12353, 184911, 30675, 2480, 90911, 5443, 18622, 28701, 12078, 262, 5983, 63473,...	[ 0.1580810546875, 0.2447509765625, 0.2476806640625, 0.253662109375, 0.179931640625, 0.12841796875, 0.151123046875, 0.2430419921875, 0.161865234375, 0.146728515625, 0.149169921875, 0.2149658203125, 0.187744140625, 0.120361328125, 0.1177978515625, 0.0704345703125, 0.082275390625, 0.15...	embed
74681958_c0	74681958	haskell	0	Title: Monads in Haskell Problem title: Monads in Haskell Tags: haskell, monads Problem: Monads in Haskell I'm new to Monads and was trying to write an add function and I'm unsure why this doesn't work. When using monads, is there a specific way you need to return a value? monadd :: (Monad m, Num b) => m b -> m b -> m ...	Monads in Haskell Monads in Haskell haskell monads Monads Haskell Monad Num Monads in Haskell I'm new to Monads and was trying to write an add function and I'm unsure why this doesn't work. When using monads, is there a specific way you need to return a value?	[ -0.0179443359375, 0.00836181640625, 0.007354736328125, 0.005340576171875, 0.01348876953125, 0.0230712890625, -0.00180816650390625, -0.0084228515625, 0.00982666015625, -0.046630859375, 0.0184326171875, -0.02734375, 0.00147247314453125, 0.001373291015625, 0.0172119140625, -0.024536132812...	[ 60331, 6468, 23, 20625, 142508, 1556, 2667, 712, 71, 52782, 3525, 31577, 33022, 15190, 32354, 51646, 15400, 22027, 18, 4488, 17368, 7, 29458, 3917, 3871, 30646, 34292 ]	[ 0.230712890625, 0.1781005859375, 0.0386962890625, 0.1343994140625, 0.241455078125, 0.09869384765625, 0.1495361328125, 0.1888427734375, 0.0963134765625, 0.180419921875, 0.041290283203125, 0.036712646484375, 0.07684326171875, 0.1612548828125, 0.17236328125, 0.03271484375, 0.05136108398...	embed
56482798_c2	56482798	haskell	2	MultiParamTypeClasses, StandaloneDeriving, TypeApplications, Control.Category.Hask, Hask, Data.Foldable, Ord, RMS, RelationMS, IdRMS, Map, Set, Show, Category, Object, mp2, mp1, M.null, M.empty, M.foldrWithKey, M.insert, S.foldr, acc2, M.lookup, Nothing, Just, S.union, S.empty, Semigroup, M.insertWith, Monoid, Functor...	MultiParamTypeClasses, StandaloneDeriving, TypeApplications, Control.Category.Hask, Hask, Data.Foldable, Ord, RMS, RelationMS, IdRMS, Map, Set, Show, Category, Object, mp2, mp1, M.null, M.empty, M.foldrWithKey, M.insert, S.foldr, acc2, M.lookup, Nothing, Just, S.union, S.empty, Semigroup, M.insertWith, Monoid, Functor...	[ -0.0264892578125, -0.003265380859375, -0.01361083984375, -0.01324462890625, 0.010498046875, 0.007232666015625, -0.004974365234375, -0.0272216796875, 0.0185546875, -0.029296875, -0.01226806640625, 0.005584716796875, 0.0021820068359375, 0.02197265625, -0.0113525390625, -0.01263427734375,...	[ 19335, 55292, 39, 196707, 140803, 90, 4, 32487, 51684, 47731, 14, 6496, 60457, 47677, 182867, 27131, 76775, 3081, 6495, 1042, 1391, 11809, 5, 919, 18345, 2886, 35379, 12174, 294, 116822, 13439, 24799, 25656, 42719, 19943, 17367, 49057, 134549...	[ 0.1800537109375, 0.1820068359375, 0.0789794921875, 0.231201171875, 0.238525390625, 0.053558349609375, 0.045562744140625, 0.1143798828125, 0.1658935546875, 0.1304931640625, 0.048858642578125, 0.0953369140625, 0.2403564453125, 0.1651611328125, 0.2041015625, 0.24658203125, 0.1201171875,...	embed
20051169_c0	20051169	haskell	0	Title: Removing file in haskell Problem title: Removing file in haskell Tags: windows, haskell Problem: Removing file in haskell I am trying to delete a text file in haskell while working in winhugs with help of removeFile function.But it is giving an error that Program error: price.txt: Directory.removeFile: permissio...	Removing file in haskell Removing file in haskell windows haskell Removing Program price.txt Directory.removeFile Removing file in haskell I am trying to delete a text file in haskell while working in winhugs with help of removeFile function.But it is giving an error that What can be the reason?	[ 0.0247802734375, 0.01055908203125, 0.013671875, 0.0107421875, -0.00110626220703125, -0.00714111328125, -0.0137939453125, 0.003692626953125, -0.0096435546875, -0.0115966796875, -0.00311279296875, -0.00180816650390625, 0.00482177734375, -0.007293701171875, 0.00384521484375, -0.0020904541...	[ 853, 432, 6496, 11435, 23, 1556, 142508, 54825, 7663, 27167, 124326, 31068, 26973, 272, 174350, 31577, 154109, 7986, 20697, 19916, 85030, 7, 87388, 32354, 68772, 18499, 831, 31635 ]	[ 0.007045745849609375, 0.12005615234375, 0.061279296875, 0.1580810546875, 0.06475830078125, 0.1387939453125, 0.2269287109375, 0.09710693359375, 0.1083984375, 0.1900634765625, 0.168212890625, 0.07135009765625, 0.06597900390625, 0.09130859375, 0.1982421875, 0.055389404296875, 0.17346191...	embed
72721698_c0	72721698	haskell	0	Title: Haskell warning Problem title: Haskell warning Tags: haskell, warnings Problem: Haskell warning I have written the code (I'm new to haskell, very new) and can't solve the warning. problem: funk :: Num a => a -> a funk a = a + 10 main :: IO() main = print (funk 10 ) Warning: Warnings: 1 Code signals: a, Haskell, ...	Haskell warning Haskell warning haskell warnings a Haskell Num Warnings Desktop qqq.hs Warning Defaulting Integer Show qqq.hs:4:8-23 qqq.hs:4:15-21 Haskell warning I have written the code (I'm new to haskell, very new) and can't solve the warning. problem: Warning:	[ -0.01348876953125, -0.01116943359375, 0.0021514892578125, 0.004852294921875, -0.0048828125, 0.01312255859375, -0.030517578125, -0.028076171875, 0.002960205078125, -0.0098876953125, -0.0322265625, -0.03076171875, -0.007080078125, 0.003082275390625, -0.00408935546875, -0.01416015625, 0...	[ 20625, 142508, 1631, 592, 1556, 6977, 10, 52782, 5550, 141423, 8096, 38656, 127, 262, 1021, 202, 1916, 44401, 17367, 617, 1019, 37620, 12221, 24589, 87, 765, 59121, 18151, 39, 3525, 47, 4552, 831, 18, 86869, 2967, 12 ]	[ 0.1605224609375, 0.25732421875, 0.1998291015625, 0.1541748046875, 0.16455078125, 0.0733642578125, 0.0267181396484375, 0.162353515625, 0.208251953125, 0.212890625, 0.073974609375, 0.173095703125, 0.089599609375, 0.1492919921875, 0.1859130859375, 0.123779296875, 0.0655517578125, 0.20...	embed
19843589_c0	19843589	haskell	0	Title: Binary map in Haskell Problem title: Binary map in Haskell Tags: haskell Problem: Binary map in Haskell Is there a two-operand equivalent to map built into Haskell with a type signature of: map2 :: (a -> b -> c) -> [a] -> [b] -> [c] The following equivalence should hold: map2 operator as bs === [operator a b \| (...	Binary map in Haskell Binary map in Haskell haskell Binary Haskell map2 Binary map in Haskell Is there a two-operand equivalent to map built into Haskell with a type signature of: The following equivalence should hold: Example:	[ 0.00830078125, 0.003143310546875, 0.0087890625, 0.00775146484375, 0.00390625, 0.031494140625, -0.01953125, 0.000682830810546875, 0.023193359375, 0.000759124755859375, 0.001983642578125, -0.017333984375, 0.0191650390625, 0.011474609375, -0.00153350830078125, 0.0027008056640625, -0.022...	[ 54092, 1294, 22288, 23, 20625, 142508, 1556, 304, 2071, 2685, 10, 6626, 21473, 2208, 183234, 88303, 3934, 678, 10644, 138256, 111, 25632, 224743, 3956, 5608, 16401, 89536, 8705 ]	[ 0.183837890625, 0.0821533203125, 0.2149658203125, 0.061798095703125, 0.137451171875, 0.24169921875, 0.10858154296875, 0.08685302734375, 0.019317626953125, 0.055877685546875, 0.0290374755859375, 0.16455078125, 0.1597900390625, 0.138671875, 0.187744140625, 0.11962890625, 0.099365234375...	embed
47076850_c0	47076850	haskell	0	Title: Haskell, create "multi-type" list Problem title: Haskell, create "multi-type" list Tags: haskell, types Problem: Haskell, create "multi-type" list Is there a way to make haskell type this expression? ls = [4, 3.2, True, "home"] It's a challenge a friend gived to me, but no ideas come around, ...	Haskell, create "multi-type" list Haskell, create "multi-type" list haskell types Haskell Haskell, create "multi-type" list Is there a way to make haskell type this expression? It's a challenge a friend gived to me, but no ideas come around, also didn't tell me if that is possible, so maybe I'm wast...	[ -0.005462646484375, 0.01171875, 0.010009765625, 0.00119781494140625, 0.005340576171875, 0.0079345703125, -0.01348876953125, -0.0002536773681640625, 0.00098419189453125, -0.0133056640625, -0.006134033203125, -0.05078125, 0.0216064453125, -0.001190185546875, -0.0296630859375, 0.015258789...	[ 20625, 142508, 28282, 144227, 50986, 5303, 1556, 52895, 9, 2071, 2685, 10, 3917, 47, 3249, 10644, 903, 125195, 66801, 34391, 8337, 110, 25647, 10932, 7722, 51139, 509, 1916, 33757, 1733 ]	[ 0.1356201171875, 0.222900390625, 0.11669921875, 0.2137451171875, 0.276123046875, 0.218017578125, 0.123291015625, 0.19482421875, 0.031829833984375, 0.008087158203125, 0.047393798828125, 0.05126953125, 0.1036376953125, 0.055999755859375, 0.090087890625, 0.253173828125, 0.11083984375, ...	embed
36181493_c2	36181493	haskell	2	Entero, AritVar, Avar, BoolVar, Bvar, Aexpr, Sum, Mult, Rest, Bexpr, Verdadero, Falso, Iguales, Distintos, MayorOigual, MenorOigual, Mayor, Menor, Entonces, Sii, Stm, AssA, AssB, Skip, Comp, Mientras, Repetir, Otros, Enteros, Monoid, Data.Set, TEMA, Comparando, Num, Aexp, Bexp, Los, Haskell, Faltan, State, Astate, Def...	Entero, AritVar, Avar, BoolVar, Bvar, Aexpr, Sum, Mult, Rest, Bexpr, Verdadero, Falso, Iguales, Distintos, MayorOigual, MenorOigual, Mayor, Menor, Entonces, Sii, Stm, AssA, AssB, Skip, Comp, Mientras, Repetir, Otros, Enteros, Monoid, Data.Set, TEMA, Comparando, Num, Aexp, Bexp, Los, Haskell, Faltan, State, Astate, Def...	[ -0.0006103515625, -0.005889892578125, 0.00799560546875, 0.0198974609375, 0.02197265625, 0.0172119140625, -0.01483154296875, 0.0054931640625, 0.00162506103515625, 0.039306640625, -0.0025634765625, 0.016357421875, 0.00946044921875, -0.00299072265625, -0.0019378662109375, 0.0169677734375,...	[ 60816, 31, 4, 62, 2783, 81827, 1961, 2460, 929, 335, 83613, 42, 36335, 81212, 49756, 1446, 16018, 516, 22225, 991, 141096, 90, 803, 12729, 1952, 104610, 670, 108352, 1111, 748, 189681, 602, 14, 2907, 39, 1301, 284, 571, 91958, 15612, 15...	[ 0.25732421875, 0.252685546875, 0.1458740234375, 0.0877685546875, 0.1724853515625, 0.296630859375, 0.246337890625, 0.036895751953125, 0.117919921875, 0.019439697265625, 0.2081298828125, 0.167724609375, 0.224853515625, 0.2135009765625, 0.195068359375, 0.1290283203125, 0.1693115234375, ...	embed
9371530_c0	9371530	haskell	0	Title: Tree Fold operation? Problem title: Tree Fold operation? Tags: fold, haskell, tree Problem: Tree Fold operation? I am taking a class in Haskell, and we need to define the fold operation for a tree defined by: data Tree a = Lf a \| Br (Tree a) (Tree a) I can not seem to find any information on the "tfold" operatio...	Tree Fold operation? Tree Fold operation? fold haskell tree Tree Fold Tree Fold operation? I am taking a class in Haskell, and we need to define the fold operation for a tree defined by: I can not seem to find any information on the "tfold" operation or really what it supposed to do. Any help would be greatly appreciat...	[ 0.01806640625, 0.0084228515625, 0.000035762786865234375, -0.031494140625, 0.0157470703125, 0.0015869140625, -0.025146484375, -0.0137939453125, -0.0096435546875, -0.02880859375, 0.000423431396484375, -0.042236328125, 0.005035400390625, 0.024658203125, -0.00164794921875, -0.0008163452148...	[ 101344, 30077, 71, 41018, 32, 42822, 1556, 142508, 53201, 35971, 18507, 23, 20625, 3871, 61924, 70, 6, 100, 390, 4677, 18, 58, 6183, 2367, 134598, 54, 4358, 77947 ]	[ 0.2286376953125, 0.2132568359375, 0.1474609375, 0.2052001953125, 0.032501220703125, 0.25439453125, 0.1090087890625, 0.2100830078125, 0.21435546875, 0.00433349609375, 0.08160400390625, 0.008087158203125, 0.09674072265625, 0.00982666015625, 0.1204833984375, 0.03875732421875, 0.00842285...	embed
33457356_c0	33457356	haskell	0	Title: In haskell. how to solve splitList into a tuple Problem title: In haskell. how to solve splitList into a tuple Tags: haskell, tuples Problem: In haskell. how to solve splitList into a tuple splitList n xs : splits a list xs in to a tuple of two lists based on the provided index n . Examples: splitList 3 [1..5] ⇒...	In haskell. how to solve splitList into a tuple In haskell. how to solve splitList into a tuple haskell tuples In haskell. how to solve splitList into a tuple splitList n xs : splits a list xs in to a tuple of two lists based on the provided index n . Examples: How do I solve it ?	[ 0.000148773193359375, -0.006317138671875, -0.004119873046875, 0.00139617919921875, -0.0255126953125, 0.009765625, 0.002899169921875, -0.00018787384033203125, 0.01483154296875, -0.00286865234375, 0.014892578125, -0.0267333984375, -0.01214599609375, 0.03759765625, -0.003204345703125, 0.0...	[ 1556, 142508, 3642, 86869, 65450, 154663, 3934, 10, 370, 8705, 360, 99726, 47, 653, 1022, 7, 5303, 23, 111, 6626, 35509, 62952, 63262, 89536, 11249, 442 ]	[ 0.1390380859375, 0.1717529296875, 0.048675537109375, 0.1934814453125, 0.2332763671875, 0.23388671875, 0.10498046875, 0.04669189453125, 0.1373291015625, 0.2103271484375, 0.03857421875, 0.175048828125, 0.095947265625, 0.0450439453125, 0.1112060546875, 0.0823974609375, 0.165283203125, ...	embed
14242977_c0	14242977	haskell	0	Title: What exactly does cabal install --avoid-reinstalls do? Problem title: What exactly does cabal install --avoid-reinstalls do? Tags: cabal, cabal-install, haskell Problem: What exactly does cabal install --avoid-reinstalls do? I've found --avoid-reinstalls makes packages build where otherwise cabal fails. What exa...	What exactly does cabal install --avoid-reinstalls do? What exactly does cabal install --avoid-reinstalls do? cabal cabal-install haskell What What exactly does cabal install --avoid-reinstalls do? I've found --avoid-reinstalls makes packages build where otherwise cabal fails. What exactly is it doing? Doesn't cabal al...	[ 0.006317138671875, -0.01080322265625, 0.0274658203125, 0.015869140625, -0.0260009765625, 0.0108642578125, -0.00445556640625, 0.0115966796875, 0.0021514892578125, 0.0390625, 0.01483154296875, -0.01324462890625, -0.0123291015625, 0.0162353515625, -0.017822265625, 0.00933837890625, 0.00...	[ 4865, 66161, 14602, 109524, 20600, 4210, 14426, 532, 107, 80383, 7, 54, 9, 1556, 142508, 30482, 98169, 45367, 120262, 35782, 83, 442, 20594, 21771, 9790, 71864, 456 ]	[ 0.05908203125, 0.0908203125, 0.052764892578125, 0.2470703125, 0.1942138671875, 0.0684814453125, 0.1666259765625, 0.15478515625, 0.1298828125, 0.21923828125, 0.07489013671875, 0.08172607421875, 0.003662109375, 0.1290283203125, 0.218017578125, 0.0650634765625, 0.153564453125, 0.09802...	embed
50177982_c1	50177982	haskell	1	then [] else [y] addi' :: ([a],[a]) -> [a] addi' ([],[]) = [] addi' (x,z) = x++z quicksort :: [Int] -> [Int] quicksort [] = [] quicksort (x:xs) \| (l1 /= [] ) && (l2 /= []) = addi'(quicksort l1', quicksort l2') \| l1 == [] = addi' (l1, quicksort l2) \| l2 == [] = addi' (l1,l2) where (l1,l2) = splitBy' x (x:xs) (l1',l2') ...	then [] else [y] addi' :: ([a],[a]) -> [a] addi' ([],[]) = [] addi' (x,z) = x++z quicksort :: [Int] -> [Int] quicksort [] = [] quicksort (x:xs) \| (l1 /= [] ) && (l2 /= []) = addi'(quicksort l1', quicksort l2') \| l1 == [] = addi' (l1, quicksort l2) \| l2 == [] = addi' (l1,l2) where (l1,l2) = splitBy' x (x:xs) (l1',l2') ...	[ -0.016845703125, 0.01458740234375, 0.000370025634765625, -0.011962890625, -0.0277099609375, 0.0250244140625, -0.010498046875, 0.006500244140625, -0.00173187255859375, 0.0126953125, 0.01953125, -0.00457763671875, -0.01220703125, -0.012451171875, 0.010009765625, -0.006561279296875, 0.0...	[ 7068, 378, 37076, 53, 268, 10, 12071, 25, 1984, 11, 4, 33079, 2203, 425, 169, 1022, 37223, 63773, 62351, 4153, 18, 12, 58745, 141, 418, 1230, 304, 3181, 2594, 96, 6, 69112, 10461, 65450, 75358, 4353, 110218, 21748, 28864, 26073, 7, 89...	[ 0.121337890625, 0.007354736328125, 0.1888427734375, 0.1527099609375, 0.00018310546875, 0.0831298828125, 0.25048828125, 0.1676025390625, 0.0787353515625, 0.07666015625, 0.007843017578125, 0.046295166015625, 0.04388427734375, 0.07171630859375, 0.1136474609375, 0.05548095703125, 0.16467...	embed
20527814_c0	20527814	haskell	0	Title: How do I transform a function defined with pattern matching into an equivalent lambda? Problem title: How do I transform a function defined with pattern matching into an equivalent lambda? Tags: haskell Problem: How do I transform a function defined with pattern matching into an equivalent lambda? How do I write...	How do I transform a function defined with pattern matching into an equivalent lambda? How do I transform a function defined with pattern matching into an equivalent lambda? haskell How x-1 How do I transform a function defined with pattern matching into an equivalent lambda? How do I write as a lambda in Haskell? Than...	[ -0.0145263671875, 0.01068115234375, -0.0035858154296875, -0.0028228759765625, 0.01263427734375, -0.006103515625, 0.016845703125, 0.0242919921875, 0.011474609375, -0.018798828125, 0.01495361328125, -0.0216064453125, -0.0040283203125, -0.0106201171875, 0.026123046875, -0.0074462890625, ...	[ 11249, 54, 87, 27198, 32354, 61924, 678, 103510, 14858, 214, 3934, 183234, 21, 6492, 85, 1556, 142508, 1022, 5759, 33022, 237, 10, 23, 20625, 130534 ]	[ 0.08465576171875, 0.04461669921875, 0.049835205078125, 0.204345703125, 0.1806640625, 0.126220703125, 0.05145263671875, 0.2281494140625, 0.19287109375, 0.1004638671875, 0.0750732421875, 0.14111328125, 0.0906982421875, 0.2071533203125, 0.1898193359375, 0.09130859375, 0.250244140625, ...	embed
74510905_c0	74510905	haskell	0	Title: Eq Ord Classes Haskell Data Problem title: Eq Ord Classes Haskell Data Tags: haskell Problem: Eq Ord Classes Haskell Data Now I have another problem: Another subtask tells me to derive a data type from the classes. I don't know how to compare it. Do you have an idea and could you explain it to me so that I can u...	Eq Ord Classes Haskell Data Eq Ord Classes Haskell Data haskell Ord Classes Haskell Data Eq Ord Classes Haskell Data Now I have another problem: Another subtask tells me to derive a data type from the classes. I don't know how to compare it. Do you have an idea and could you explain it to me so that I can understand? `...	[ 0.0194091796875, 0.0179443359375, -0.0010223388671875, 0.0042724609375, 0.0146484375, 0.0179443359375, 0.01153564453125, -0.0017242431640625, 0.00057220458984375, 0.012939453125, -0.0115966796875, -0.0233154296875, 0.0211181640625, 0.01226806640625, -0.04736328125, -0.01141357421875, ...	[ 241, 864, 35379, 35014, 20625, 142508, 11809, 1556, 15700, 2967, 116267, 1614, 1073, 92, 14192, 122, 5844, 2053, 10644, 1295, 70, 61112, 3714, 3642, 69101, 442, 6528, 73342, 28219, 110527, 7440 ]	[ 0.0555419921875, 0.211181640625, 0.239501953125, 0.223876953125, 0.1282958984375, 0.224365234375, 0.158447265625, 0.1131591796875, 0.00054931640625, 0.066650390625, 0.007537841796875, 0.06585693359375, 0.119140625, 0.029449462890625, 0.03179931640625, 0.09033203125, 0.077880859375, ...	embed
9454793_c0	9454793	haskell	0	Title: Haskell offline documentation? Problem title: Haskell offline documentation? Tags: haskell, offline-mode Problem: Haskell offline documentation? What are the possibilities, if any, for getting offline docs for Haskell core libraries (and maybe more)? Sometimes I take my laptop to the coffee-shop where there is n...	Haskell offline documentation? Haskell offline documentation? haskell offline-mode Haskell Haskell offline documentation? What are the possibilities, if any, for getting offline docs for Haskell core libraries (and maybe more)? Sometimes I take my laptop to the coffee-shop where there is no wifi, and it would be nice h...	[ 0.01446533203125, 0.008544921875, 0.017822265625, -0.00244140625, -0.010009765625, 0.00640869140625, -0.0038604736328125, -0.00543212890625, -0.003448486328125, 0.004791259765625, 0.00482177734375, -0.0203857421875, 0.006866455078125, 0.0115966796875, 0.00933837890625, -0.0035247802734...	[ 20625, 142508, 96083, 209806, 32, 1556, 61170, 97370, 2449, 2499, 20949, 54, 4439, 56458, 35773, 10484, 160193, 5646, 26367, 47, 79497, 10534, 110, 68673, 2806, 26267, 19441, 9844, 152488, 133, 1284, 4527 ]	[ 0.15380859375, 0.23681640625, 0.275146484375, 0.240966796875, 0.049652099609375, 0.146484375, 0.148193359375, 0.1085205078125, 0.050567626953125, 0.001678466796875, 0.0804443359375, 0.132080078125, 0.1470947265625, 0.1163330078125, 0.1357421875, 0.031707763671875, 0.04412841796875, ...	embed
6400568_c0	6400568	haskell	0	Title: Exponentiation in Haskell Problem title: Exponentiation in Haskell Tags: haskell, exponent, exponentiation Problem: Exponentiation in Haskell Can someone tell me why the Haskell Prelude defines two separate functions for exponentiation (i.e. ^ and ** )? I thought the type system was supposed to eliminate this ki...	Exponentiation in Haskell Exponentiation in Haskell haskell exponent exponentiation Exponentiation Haskell Prelude Exponentiation in Haskell Can someone tell me why the Haskell Prelude defines two separate functions for exponentiation (i.e. ^ and ** )? I thought the type system was supposed to eliminate this kind of du...	[ 0.0191650390625, -0.0115966796875, -0.004547119140625, 0.01416015625, 0.006256103515625, 0.00054168701171875, -0.0108642578125, -0.00836181640625, -0.000568389892578125, -0.006744384765625, -0.0167236328125, -0.00421142578125, -0.00921630859375, -0.00469970703125, -0.007354736328125, -...	[ 5443, 54137, 14, 2320, 23, 20625, 142508, 1556, 1119, 78643, 21616, 1914, 822, 14192, 15400, 112, 61924, 6626, 84797, 32354, 100, 13331, 136, 16459, 17569, 10644, 5426, 134598, 27169, 903, 8562, 115, 182867 ]	[ 0.08831787109375, 0.2314453125, 0.1331787109375, 0.06280517578125, 0.053314208984375, 0.1400146484375, 0.2393798828125, 0.1287841796875, 0.0880126953125, 0.1973876953125, 0.188232421875, 0.0936279296875, 0.1552734375, 0.052490234375, 0.09222412109375, 0.09814453125, 0.1552734375, 0...	embed
34538754_c0	34538754	haskell	0	Title: Proving Composition Applicative law for ((->) r) type Problem title: Proving Composition Applicative law for ((->) r) type Tags: haskell Problem: Proving Composition Applicative law for ((->) r) type \x -> ((u x) . (v x)) (w x) -- (B) I don't think (A) & (B) are equivalent, so where did I make a mistake? I...	Proving Composition Applicative law for ((->) r) type Proving Composition Applicative law for ((->) r) type haskell Proving Composition Applicative Expanding Proving Composition Applicative law for ((->) r) type The Composition Applicative Law is as follows: Here's my attempt at proving the Composition law for th...	[ -0.00933837890625, 0.0140380859375, 0.004730224609375, 0.048583984375, -0.0045166015625, 0.006103515625, 0.0029449462890625, 0.010986328125, 0.018798828125, -0.002838134765625, -0.016357421875, 0.004730224609375, 0.034912109375, 0.0196533203125, -0.0196533203125, -0.009521484375, 0.0...	[ 1250, 6496, 3288, 40322, 5659, 11048, 4935, 27165, 100, 60494, 9, 1230, 5386, 1690, 10644, 1556, 142508, 60075, 11, 103607, 36293, 28960, 81887, 502, 68416, 294, 12, 339, 38131, 5351, 284, 619, 571, 183234, 3249, 121742, 77947, 4358 ]	[ 0.10736083984375, 0.055267333984375, 0.1551513671875, 0.2161865234375, 0.121337890625, 0.1385498046875, 0.0648193359375, 0.16357421875, 0.016510009765625, 0.049774169921875, 0.037933349609375, 0.06036376953125, 0.07415771484375, 0.0960693359375, 0.14013671875, 0.12451171875, 0.215820...	embed
36382793_c0	36382793	haskell	0	Title: Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Problem title: Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Tags: haskell Problem: Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Can some body explain me the difference between hGetBuf and...	Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking haskell Haskell Difference Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Can some body explain me the difference between hGetBuf and hGetBufSome. When...	[ 0.01519775390625, 0.0084228515625, 0.032958984375, -0.007293701171875, 0.0027313232421875, 0.01544189453125, 0.00335693359375, -0.003936767578125, 0.00994873046875, 0.028076171875, 0.00860595703125, -0.0380859375, 0.01226806640625, -0.0030975341796875, 0.007293701171875, 0.004272460937...	[ 20625, 142508, 803, 18234, 6620, 17721, 1096, 724, 126, 7235, 420, 8912, 282, 136, 59881, 166191, 214, 1556, 14361, 73342, 163, 60212, 14847, 4527 ]	[ 0.11181640625, 0.235595703125, 0.045440673828125, 0.13232421875, 0.0880126953125, 0.0770263671875, 0.087646484375, 0.1004638671875, 0.1168212890625, 0.177734375, 0.1741943359375, 0.1143798828125, 0.115234375, 0.05615234375, 0.1016845703125, 0.115966796875, 0.0888671875, 0.078002929...	embed
28524471_c0	28524471	haskell	0	Title: Haskell: get rid of parentheses in liftM2 Problem title: Haskell: get rid of parentheses in liftM2 Tags: haskell Problem: Haskell: get rid of parentheses in liftM2 How to remove the parentheses marked with ^ , without introducing new names? (better if it can be splitted into multiple lines) liftM2 (+) (somefunc ...	Haskell: get rid of parentheses in liftM2 Haskell: get rid of parentheses in liftM2 haskell Haskell liftM2 arg1 arg2 arg3 Haskell: get rid of parentheses in liftM2 How to remove the parentheses marked with ^ , without introducing new names? (better if it can be splitted into multiple lines)	[ -0.00194549560546875, 0.00897216796875, -0.00927734375, 0.036376953125, 0.0274658203125, 0.01275634765625, -0.01226806640625, 0.0111083984375, 0.0145263671875, -0.00958251953125, 0.010009765625, -0.002777099609375, -0.01495361328125, -0.00250244140625, -0.00063323974609375, -0.01519775...	[ 20625, 142508, 31351, 49129, 35412, 90, 60520, 594, 304, 1556, 79459, 363, 11249, 87388, 94419, 678, 13331, 15490, 39864, 123055, 3055, 65450, 3934, 48716, 124519 ]	[ 0.10009765625, 0.2158203125, 0.1256103515625, 0.182373046875, 0.21435546875, 0.1173095703125, 0.1927490234375, 0.12939453125, 0.177490234375, 0.102783203125, 0.0843505859375, 0.0675048828125, 0.0161285400390625, 0.1728515625, 0.15625, 0.0285797119140625, 0.1756591796875, 0.04641723...	embed
32468799_c0	32468799	haskell	0	Title: Need help understanding what this Haskell function does Problem title: Need help understanding what this Haskell function does Tags: functional-programming, haskell Problem: Need help understanding what this Haskell function does Not sure exactly what this does, or what to enter into the function to find a patte...	Need help understanding what this Haskell function does Need help understanding what this Haskell function does functional-programming haskell Need Haskell x:xs Need help understanding what this Haskell function does Not sure exactly what this does, or what to enter into the function to find a pattern in the outputs	[ 0.01513671875, 0.003509521484375, -0.0103759765625, 0.0029144287109375, 0.0017547607421875, 0.0269775390625, 0.0004253387451171875, 0.0064697265625, 0.0203857421875, -0.00156402587890625, 0.019287109375, -0.0184326171875, 0.003509521484375, 0.01422119140625, 0.013671875, -0.00265502929...	[ 52889, 4358, 100094, 2367, 903, 20625, 142508, 32354, 14602, 123309, 28966, 1556, 1022, 12, 425, 7, 11205, 9077, 66161, 30957, 7413, 10, 103510, 23, 140992 ]	[ 0.10577392578125, 0.1051025390625, 0.135009765625, 0.0770263671875, 0.12493896484375, 0.1314697265625, 0.216552734375, 0.2044677734375, 0.1229248046875, 0.1356201171875, 0.08544921875, 0.1234130859375, 0.0902099609375, 0.084716796875, 0.127197265625, 0.0787353515625, 0.00609588623046...	embed
36351560_c0	36351560	haskell	0	Title: Haskell divide Double by Int Problem title: Haskell divide Double by Int Tags: haskell Problem: Haskell divide Double by Int I have the following piece of code, the problem is that I try to divide a Double by an Int factorial :: Int -> Int factorial 0 = 1 factorial e = e * (factorial e-1) sumX :: Double -> Int -...	Haskell divide Double by Int Haskell divide Double by Int haskell Haskell Double e-1 Haskell divide Double by Int I have the following piece of code, the problem is that I try to divide a Double by an Int How can I get it to work?	[ -0.001800537109375, 0.00830078125, 0.02001953125, -0.008544921875, -0.01031494140625, 0.0016937255859375, -0.0031585693359375, 0.002532958984375, 0.01214599609375, -0.016845703125, 0.008544921875, -0.00457763671875, 0.00408935546875, -0.0205078125, -0.00518798828125, 0.02685546875, -...	[ 20625, 142508, 101637, 107172, 390, 360, 18, 1556, 28, 5759, 765, 25632, 63847, 18151, 2967, 9790, 142, 11249, 831, 2046, 442, 47, 4488 ]	[ 0.1553955078125, 0.2191162109375, 0.211669921875, 0.22802734375, 0.1434326171875, 0.1710205078125, 0.186279296875, 0.1495361328125, 0.11749267578125, 0.1453857421875, 0.01055908203125, 0.07452392578125, 0.06695556640625, 0.12451171875, 0.13330078125, 0.12744140625, 0.0230255126953125...	embed
15693505_c0	15693505	haskell	0	Title: reaching elements of tuple by index number in Haskell Problem title: reaching elements of tuple by index number in Haskell Tags: tuples, haskell Problem: reaching elements of tuple by index number in Haskell how to reach elements of tuple by giving the index number ? Or is there any other similar way to do it? F...	reaching elements of tuple by index number in Haskell reaching elements of tuple by index number in Haskell tuples haskell Haskell reaching elements of tuple by index number in Haskell how to reach elements of tuple by giving the index number ? Or is there any other similar way to do it? For example i have a tuple with...	[ 0.01239013671875, 0.01361083984375, 0.01611328125, 0.010009765625, 0.0003032684326171875, -0.007415771484375, -0.0108642578125, -0.008056640625, 0.01446533203125, -0.029296875, 0.0045166015625, -0.032470703125, -0.028076171875, 0.018798828125, 0.0086669921875, 0.000591278076171875, 0...	[ 58359, 214, 80854, 111, 370, 8705, 390, 63262, 14012, 23, 20625, 142508, 99726, 1556, 3642, 47, 68772, 21373, 3917, 54, 442, 17, 678, 136659, 12830, 3444, 305, 927 ]	[ 0.2470703125, 0.060699462890625, 0.208984375, 0.05853271484375, 0.144775390625, 0.2332763671875, 0.07025146484375, 0.196533203125, 0.1783447265625, 0.05389404296875, 0.151123046875, 0.2412109375, 0.1923828125, 0.1251220703125, 0.077392578125, 0.051788330078125, 0.08563232421875, 0....	embed
26025392_c0	26025392	haskell	0	Title: How to check cabal flags in a sandbox Problem title: How to check cabal flags in a sandbox Tags: cabal, haskell Problem: How to check cabal flags in a sandbox I can do cabal install --enable-executable-profiling . cabal is supposed to remember the flag cabal.config file. However, I'm using a sandbox and I can't ...	How to check cabal flags in a sandbox How to check cabal flags in a sandbox cabal haskell How cabal.config How to check cabal flags in a sandbox I can do cabal install --enable-executable-profiling . cabal is supposed to remember the flag cabal.config file. However, I'm using a sandbox and I can't find any config file....	[ 0.002410888671875, -0.0130615234375, 0.01226806640625, 0.018798828125, -0.006683349609375, -0.0033721923828125, 0.004364013671875, 0.017333984375, 0.0068359375, 0.0244140625, -0.00003528594970703125, -0.01263427734375, -0.009033203125, -0.01904296875, 0.01019287109375, 0.0157470703125,...	[ 11249, 12765, 109524, 49938, 7, 23, 19096, 11728, 47, 10, 1556, 142508, 153837, 20600, 2886, 46480, 1010, 22819, 58395, 214, 134598, 37629, 11435, 17368, 831, 18, 7413, 765, 2809, 34704, 3674 ]	[ 0.0252685546875, 0.197509765625, 0.25537109375, 0.2369384765625, 0.113037109375, 0.07611083984375, 0.1453857421875, 0.2225341796875, 0.0185546875, 0.0248870849609375, 0.089599609375, 0.1756591796875, 0.196533203125, 0.0806884765625, 0.07110595703125, 0.0201416015625, 0.08740234375, ...	embed
45338043_c0	45338043	haskell	0	Title: Concatenate two integers in haskell Problem title: Concatenate two integers in haskell Tags: haskell Problem: Concatenate two integers in haskell Hey guys I am having a problem with my code. The code below supposed to remove the first 2 in the list and then concatenate them.So the result answer would be 1,2. fir...	Concatenate two integers in haskell Concatenate two integers in haskell haskell Concatenate Concatenate two integers in haskell Hey guys I am having a problem with my code. The code below supposed to remove the first 2 in the list and then concatenate them.So the result answer would be 1,2.	[ -0.0020599365234375, -0.01263427734375, -0.006805419921875, 0.0260009765625, 0.0052490234375, 0.044189453125, -0.008056640625, 0.0137939453125, 0.0157470703125, -0.01544189453125, -0.0118408203125, -0.023681640625, 0.01495361328125, 0.0167236328125, 0.01123046875, -0.02685546875, 0.0...	[ 1657, 33478, 76, 67, 6626, 892, 26255, 23, 1556, 142508, 28240, 51484, 2967, 18151, 35064, 134598, 87388, 5117, 116, 5303, 158, 2856, 16750, 35166, 2806, 186, 25568 ]	[ 0.09881591796875, 0.2044677734375, 0.1480712890625, 0.07861328125, 0.1485595703125, 0.15576171875, 0.127685546875, 0.07464599609375, 0.16796875, 0.23779296875, 0.0177459716796875, 0.0287017822265625, 0.05938720703125, 0.0941162109375, 0.075439453125, 0.06005859375, 0.1573486328125, ...	embed
8820604_c0	8820604	haskell	0	Title: Haskell Plugin for XCode 4 under OS X Lion Problem title: Haskell Plugin for XCode 4 under OS X Lion Tags: plugins, xcode, osx-lion, macos, haskell Problem: Haskell Plugin for XCode 4 under OS X Lion Is there an alternative to http://www.hoovy.org/HaskellXcodePlugin/ i can use for XCode 4 whilst using Mac OS X L...	Haskell Plugin for XCode 4 under OS X Lion Haskell Plugin for XCode 4 under OS X Lion plugins xcode osx-lion macos haskell Haskell Plugin XCode Lion Haskell Plugin for XCode 4 under OS X Lion Is there an alternative to http://www.hoovy.org/HaskellXcodePlugin/ i can use for XCode 4 whilst using Mac OS X Lion ? Or if it ...	[ -0.005767822265625, 0.039794921875, -0.004364013671875, -0.00445556640625, -0.0115966796875, 0.005828857421875, -0.007476806640625, -0.006317138671875, -0.0098876953125, -0.0201416015625, -0.0245361328125, -0.025634765625, 0.004913330078125, -0.0135498046875, 0.0179443359375, -0.008117...	[ 20625, 142508, 187364, 100, 1193, 114211, 201, 1379, 11787, 82209, 69993, 1022, 40899, 362, 45486, 7840, 1556, 2685, 30700, 497, 67983, 1478, 6495, 7, 1542, 683, 35159, 73, 17, 831, 4527, 217982, 17368, 4727, 43240, 45367 ]	[ 0.17431640625, 0.255615234375, 0.25732421875, 0.02667236328125, 0.07342529296875, 0.25048828125, 0.197509765625, 0.136962890625, 0.0997314453125, 0.19677734375, 0.2115478515625, 0.000030517578125, 0.2200927734375, 0.048919677734375, 0.134765625, 0.05316162109375, 0.139892578125, 0....	embed
36918873_c0	36918873	haskell	0	Title: Can I have plus or minus when doing cases? Problem title: Can I have plus or minus when doing cases? Tags: haskell Problem: Can I have plus or minus when doing cases? Could I put a case to be within a certain range or another number? say ... case x of +/- 3 -> yes ... Would that be something Haskell should under...	Can I have plus or minus when doing cases? Can I have plus or minus when doing cases? haskell Can Can I have plus or minus when doing cases? Could I put a case to be within a certain range or another number? say ... ... Would that be something Haskell should understand? Update: In short, would i be able to match to an ...	[ -0.0255126953125, 0.00640869140625, 0.01031494140625, 0.00347900390625, -0.00860595703125, -0.00811767578125, 0.000576019287109375, 0.01611328125, 0.01025390625, -0.00994873046875, 0.00188446044921875, -0.0036468505859375, 0.0052490234375, 0.005706787109375, -0.0023193359375, -0.003128...	[ 4171, 87, 765, 1001, 707, 26948, 3229, 20594, 50218, 1556, 142508, 191147, 3884, 7225, 47, 186, 28032, 24233, 37457, 15700, 14012, 20625, 5608, 28219, 16610, 2806, 17, 19048, 14858, 51514, 43257 ]	[ 0.107177734375, 0.0701904296875, 0.13232421875, 0.2298583984375, 0.1448974609375, 0.289306640625, 0.06365966796875, 0.10333251953125, 0.2373046875, 0.1414794921875, 0.245849609375, 0.0718994140625, 0.087890625, 0.1988525390625, 0.053619384765625, 0.011016845703125, 0.1123046875, 0....	embed
22748546_c0	22748546	haskell	0	Title: How to add spaces to string in Haskell Problem title: How to add spaces to string in Haskell Tags: haskell Problem: How to add spaces to string in Haskell I have a string "AB0123456789" and the output I would like to have is: "AB01 2345 6789" ... I want to add a space after every fourth character. How can I do t...	How to add spaces to string in Haskell How to add spaces to string in Haskell haskell How Haskell AB0123456789 AB01 Main How to add spaces to string in Haskell I have a string "AB0123456789" and the output I would like to have is: "AB01 2345 6789" ... I want to add a space after every fourth character. How can I do thi...	[ -0.015869140625, 0.005157470703125, -0.01312255859375, 0.0123291015625, -0.0291748046875, 0.0225830078125, 0.008544921875, -0.0206298828125, 0.0007476806640625, -0.007476806640625, 0.03564453125, -0.0213623046875, -0.0257568359375, 0.00750732421875, -0.01025390625, -0.00176239013671875...	[ 11249, 47, 15190, 32628, 7, 79315, 23, 20625, 142508, 1556, 11321, 6746, 3742, 121317, 153781, 12321, 765, 11040, 140992, 2806, 1884, 1105, 4633, 305, 3444, 10, 7103, 11907, 22759, 927, 62816, 831, 54, 903 ]	[ 0.06982421875, 0.10699462890625, 0.1455078125, 0.289306640625, 0.160400390625, 0.254638671875, 0.0789794921875, 0.166259765625, 0.2481689453125, 0.143310546875, 0.1126708984375, 0.126708984375, 0.08349609375, 0.1204833984375, 0.1639404296875, 0.04803466796875, 0.032196044921875, 0....	embed
24700762_c0	24700762	haskell	0	Title: Or-patterns in Haskell Problem title: Or-patterns in Haskell Tags: haskell, ocaml Problem: Or-patterns in Haskell In OCaml, I was used to writing code which looked like: let combine o1 o2 = match o1, o2 with \| Valid, Invalid \| Invalid, Valid -> Invalid \| _ -> ... I didn't find a way to write or-patterns in Haske...	Or-patterns in Haskell Or-patterns in Haskell haskell ocaml Or-patterns Haskell Valid Invalid Or-patterns in Haskell In OCaml, I was used to writing code which looked like: I didn't find a way to write or-patterns in Haskell and I really miss it. Does anyone have a solution?	[ -0.01483154296875, 0.006744384765625, 0.0030364990234375, 0.01043701171875, -0.0159912109375, 0.007568359375, -0.047607421875, -0.006317138671875, 0.0028076171875, 0.00836181640625, 0.002197265625, -0.006011962890625, 0.0277099609375, 0.008544921875, -0.0147705078125, -0.0107421875, ...	[ 3347, 9, 4453, 22766, 7, 23, 20625, 142508, 1556, 36, 9779, 141, 25447, 71, 360, 7013, 180, 105272, 509, 11814, 32562, 18151, 54811, 1884, 15935, 18, 7413, 10, 3917, 47, 33022, 707, 87, 6183, 18025, 442, 35672, 765, 29806 ]	[ 0.2337646484375, 0.0657958984375, 0.2034912109375, 0.2088623046875, 0.03057861328125, 0.0660400390625, 0.120849609375, 0.23291015625, 0.101806640625, 0.0596923828125, 0.104248046875, 0.1422119140625, 0.10693359375, 0.0111083984375, 0.0389404296875, 0.1380615234375, 0.0904541015625, ...	embed
28666113_c0	28666113	haskell	0	Title: Goto Definition in Emacs - Haskell mode Problem title: Goto Definition in Emacs - Haskell mode Tags: haskell, emacs Problem: Goto Definition in Emacs - Haskell mode I installed Haskell Mode through Melpa package-install . However, M - . ( goto-definition) still uses emacs' inbuilt findTags function. Doesn't hask...	Goto Definition in Emacs - Haskell mode Goto Definition in Emacs - Haskell mode haskell emacs Goto Definition Emacs Haskell Mode Goto Definition in Emacs - Haskell mode I installed Haskell Mode through Melpa package-install . However, M - . ( goto-definition) still uses emacs' inbuilt findTags function. Doesn't haskell...	[ 0.0091552734375, 0.0166015625, 0.022705078125, -0.018310546875, 0.01141357421875, 0.0162353515625, -0.01531982421875, -0.016357421875, 0.0010833740234375, -0.031982421875, 0.01708984375, -0.0303955078125, -0.022216796875, -0.0177001953125, -0.0120849609375, -0.00146484375, 0.00424194...	[ 2016, 188, 155455, 85269, 4439, 20625, 142508, 13736, 23, 1556, 352, 2263, 36024, 20600, 13892, 763, 98169, 80383, 276, 20, 5, 4163, 31, 49919, 7464, 4527, 978, 24908, 7413, 66448, 32354, 903, 80934, 60213 ]	[ 0.1917724609375, 0.265625, 0.1876220703125, 0.1497802734375, 0.1756591796875, 0.11083984375, 0.217041015625, 0.14892578125, 0.039093017578125, 0.1160888671875, 0.0738525390625, 0.146728515625, 0.1552734375, 0.06707763671875, 0.06451416015625, 0.1253662109375, 0.0711669921875, 0.046...	embed
4161111_c0	4161111	haskell	0	Title: Haskell function to parse a string and return any urls found Problem title: Haskell function to parse a string and return any urls found Tags: haskell, parsing Problem: Haskell function to parse a string and return any urls found What I've been looking for is the function in the title. I could write something in...	Haskell function to parse a string and return any urls found Haskell function to parse a string and return any urls found haskell parsing Haskell Haskell function to parse a string and return any urls found What I've been looking for is the function in the title. I could write something in parsec, but before I do, anyo...	[ -0.005615234375, 0.0037384033203125, 0.00148773193359375, 0.0322265625, 0.000518798828125, 0.0186767578125, -0.0029296875, -0.025390625, 0.00049591064453125, -0.0439453125, -0.00946044921875, -0.04931640625, 0.00238037109375, -0.01055908203125, 0.001617431640625, 0.015625, -0.0046997...	[ 20625, 142508, 32354, 47, 366, 184, 79315, 136, 30646, 2499, 25002, 14037, 1556, 6953, 16487, 100, 23, 44759, 5809, 33022, 39797, 35672, 3714, 1884, 903, 4358 ]	[ 0.11572265625, 0.2362060546875, 0.21484375, 0.056854248046875, 0.17041015625, 0.133056640625, 0.226806640625, 0.06365966796875, 0.16064453125, 0.10205078125, 0.183349609375, 0.1395263671875, 0.1171875, 0.09088134765625, 0.05718994140625, 0.0511474609375, 0.0229339599609375, 0.17333...	embed
46265118_c0	46265118	haskell	0	Title: How to parse to custom type in Haskell Problem title: How to parse to custom type in Haskell Tags: parsing, haskell, string, types Problem: How to parse to custom type in Haskell I'm new to haskell and have no idea how to parse. I have created a new type type Field = String Now I want parse [String] to [Field], ...	How to parse to custom type in Haskell How to parse to custom type in Haskell parsing haskell string types How Haskell Field How to parse to custom type in Haskell I'm new to haskell and have no idea how to parse. I have created a new type Now I want parse [String] to [Field], how could I do this? I already have this:	[ -0.01025390625, -0.0101318359375, -0.0123291015625, 0.03515625, -0.0069580078125, 0.02197265625, 0.0086669921875, -0.00872802734375, 0.00592041015625, 0.005401611328125, 0.0006866455078125, -0.020263671875, 0.006866455078125, -0.0029296875, -0.02783203125, -0.0235595703125, 0.0019378...	[ 11249, 47, 366, 184, 114122, 10644, 23, 20625, 142508, 6953, 1556, 79315, 52895, 117657, 3525, 110, 6528, 3642, 75935, 14240, 3444, 71713, 214, 6159, 19388, 5809, 903, 21771, 765 ]	[ 0.07049560546875, 0.1431884765625, 0.157958984375, 0.135498046875, 0.2279052734375, 0.242919921875, 0.0689697265625, 0.1351318359375, 0.219482421875, 0.05792236328125, 0.1297607421875, 0.1668701171875, 0.191162109375, 0.1734619140625, 0.02789306640625, 0.007354736328125, 0.0438537597...	embed

36781050_c0

36781050

haskell

0

Title: difference between two monads: ErrorT e Identity v and Either e v Problem title: difference between two monads: ErrorT e Identity v and Either e v Tags: monads, haskell Problem: difference between two monads: ErrorT e Identity v and Either e v Can someone explain difference between ErrorT String Identity Integer...

difference between two monads: ErrorT e Identity v and Either e v difference between two monads: ErrorT e Identity v and Either e v monads haskell ErrorT Identity Either Integer difference between two monads: ErrorT e Identity v and Either e v Can someone explain difference between and Either String Integer ?

[ -0.0098876953125, 0.00506591796875, -0.00909423828125, 0.0155029296875, 0.021240234375, 0.0115966796875, -0.01171875, -0.0096435546875, -0.003814697265625, 0.01104736328125, 0.020751953125, -0.0174560546875, 0.018798828125, -0.00186920166015625, -0.004241943359375, -0.0030364990234375,...

[ 60212, 17721, 6626, 2667, 712, 7, 212059, 618, 28, 71257, 2481, 81, 136, 4565, 9319, 1556, 142508, 44401, 4171, 22008, 73342, 23351, 214 ]

[ 0.203125, 0.1363525390625, 0.103759765625, 0.119140625, 0.1820068359375, 0.009429931640625, 0.2041015625, 0.2060546875, 0.154052734375, 0.1798095703125, 0.1407470703125, 0.2451171875, 0.067626953125, 0.10205078125, 0.2191162109375, 0.07196044921875, 0.1884765625, 0.205078125, 0.0...

embed

52504234_c0

52504234

haskell

0

Title: How to merge two elements within a tuple in Haskell Problem title: How to merge two elements within a tuple in Haskell Tags: haskell Problem: How to merge two elements within a tuple in Haskell I'm new to Haskell, and was trying to merge strings within a tuple into one element. For example, if my input was ("Hel...

How to merge two elements within a tuple in Haskell How to merge two elements within a tuple in Haskell haskell How Haskell How to merge two elements within a tuple in Haskell I'm new to Haskell, and was trying to merge strings within a tuple into one element. For example, if my input was ("Hello","world",1), it would ...

[ 0.01434326171875, 0.0137939453125, -0.01171875, 0.034912109375, 0.005828857421875, 0.02099609375, -0.0213623046875, -0.0169677734375, 0.020751953125, 0.0072021484375, -0.005889892578125, -0.0101318359375, -0.00140380859375, 0.0242919921875, -0.01055908203125, 0.000030994415283203125, ...

[ 11249, 47, 42564, 6626, 80854, 28032, 370, 8705, 20625, 142508, 10, 23, 1556, 3525, 31577, 79315, 3934, 1632, 12830, 107730, 841, 13817, 32554, 17727, 140992, 8999 ]

[ 0.0751953125, 0.0321044921875, 0.251953125, 0.1658935546875, 0.214599609375, 0.1883544921875, 0.156494140625, 0.2568359375, 0.150390625, 0.2276611328125, 0.0380859375, 0.04608154296875, 0.1285400390625, 0.03631591796875, 0.039215087890625, 0.18017578125, 0.0684814453125, 0.08386230...

embed

19182990_c0

19182990

haskell

0

Title: What does `squares xs = [x*x|x<-xs]` means in Haskell? Problem title: What does `squares xs = [x*x|x<-xs]` means in Haskell? Tags: haskell, functional-programming Problem: What does `squares xs = [x*x|x<-xs]` means in Haskell? What does squares xs = [x*x|x<-xs] means. Like i understand [x*x|x<-[1,2,3]] . T...

What does `squares xs = [x*x|x<-xs]` means in Haskell? What does `squares xs = [x*x|x<-xs]` means in Haskell? haskell functional-programming What Haskell What does `squares xs = [x*x|x<-xs]` means in Haskell? What does squares xs = [x*x|x<-xs] means. Like i understand [x*x|x<-[1,2,3]] . To be precise, Where does ...

[ 0.01904296875, 0.0286865234375, 0.0128173828125, -0.02734375, 0.00811767578125, -0.00885009765625, -0.0034942626953125, 0.005279541015625, 0.01348876953125, 0.0101318359375, 0.0072021484375, -0.01141357421875, 0.004791259765625, -0.00982666015625, -0.0223388671875, -0.008544921875, 0...

[ 4865, 108047, 7, 1022, 2203, 425, 1639, 58745, 1230, 1277, 9, 26950, 20625, 142508, 1556, 123309, 28966, 9473, 378, 16093, 23, 28219, 133063, 96386, 134995, 78662, 91, 1380, 1295 ]

[ 0.0175933837890625, 0.2208251953125, 0.1419677734375, 0.18701171875, 0.1099853515625, 0.1387939453125, 0.1256103515625, 0.0609130859375, 0.05487060546875, 0.0355224609375, 0.0911865234375, 0.1116943359375, 0.10516357421875, 0.19580078125, 0.055877685546875, 0.0731201171875, 0.0593566...

embed

19424107_c0

19424107

haskell

0

Title: Trying to get the initials of 2 string in haskell Problem title: Trying to get the initials of 2 string in haskell Tags: haskell Problem: Trying to get the initials of 2 string in haskell initt [f:_] [l:_] = f ++ " " ++ l And then i call initt "First" "Last" I get an error, saying Couldn't match type 'Char' with...

Trying to get the initials of 2 string in haskell Trying to get the initials of 2 string in haskell haskell Trying f:_ l:_ First Last Trying to get the initials of 2 string in haskell And then i call I get an error, saying Couldn't match type 'Char' with '[Char]' I really don't get it.

[ 0.01239013671875, -0.0164794921875, -0.0002651214599609375, 0.006744384765625, -0.01171875, 0.0048828125, 0.00860595703125, -0.00726318359375, -0.00592041015625, -0.0234375, 0.022705078125, -0.0030364990234375, 0.00909423828125, 0.02001953125, -0.024169921875, -0.005523681640625, 0.0...

[ 40858, 2046, 61475, 7, 116, 79315, 1556, 142508, 23, 1238, 12, 454, 96, 23972, 21672, 70, 11782, 18499, 191147, 18, 14858, 10644, 84068, 678, 1065, 6183 ]

[ 0.0635986328125, 0.0638427734375, 0.1851806640625, 0.0635986328125, 0.13671875, 0.2008056640625, 0.1409912109375, 0.2020263671875, 0.00921630859375, 0.10693359375, 0.0911865234375, 0.060150146484375, 0.1090087890625, 0.103515625, 0.1358642578125, 0.0196990966796875, 0.113525390625, ...

embed

71000901_c0

71000901

haskell

0

Title: Block scope in Haskell? Problem title: Block scope in Haskell? Tags: haskell Problem: Block scope in Haskell? I've found block scope { and } in JavaSciprt after ES6 is useful in development, and frequently use for testing small code blocks including the same variable names in different versions side by side. How...

Block scope in Haskell? Block scope in Haskell? haskell Block Haskell Block scope in Haskell? I've found block scope { and } in JavaSciprt after ES6 is useful in development, and frequently use for testing small code blocks including the same variable names in different versions side by side. How do you do in Haskell? ...

[ 0.00116729736328125, 0.0181884765625, 0.0027313232421875, 0.00182342529296875, 0.015380859375, -0.0004062652587890625, 0.0089111328125, 0.0087890625, 0.01043701171875, 0.006439208984375, -0.004364013671875, 0.007232666015625, 0.012451171875, -0.0033416748046875, -0.000568389892578125, ...

[ 80231, 70820, 23, 20625, 142508, 32, 1556, 46389, 136, 41925, 25258, 3198, 7103, 9764, 910, 80234, 34754, 195409, 4527, 100, 134234, 19336, 18151, 5701, 77336, 123055, 12921, 11389, 5609, 54, 2965, 49086 ]

[ 0.251953125, 0.27685546875, 0.080078125, 0.158447265625, 0.243408203125, 0.0506591796875, 0.1307373046875, 0.2279052734375, 0.19384765625, 0.12890625, 0.0888671875, 0.160888671875, 0.06842041015625, 0.064453125, 0.10687255859375, 0.1502685546875, 0.10247802734375, 0.061981201171875...

embed

46909589_c0

46909589

haskell

0

Title: What is the equivalent of iterate function in haskell in c#? Problem title: What is the equivalent of iterate function in haskell in c#? Tags: haskell, c%23 Problem: What is the equivalent of iterate function in haskell in c#? We have iterate function in haskell Prelude iterate :: (a -> a) -> a -> [a] iterate f ...

What is the equivalent of iterate function in haskell in c#? What is the equivalent of iterate function in haskell in c#? haskell c%23 What What is the equivalent of iterate function in haskell in c#? We have iterate function in haskell Prelude What is the equivalent in C#?

[ 0.0006256103515625, 0.00592041015625, 0.0164794921875, -0.0022735595703125, -0.001800537109375, 0.0050048828125, 0.0078125, 0.006622314453125, 0.003997802734375, -0.044189453125, -0.0118408203125, -0.017333984375, -0.0033111572265625, -0.007232666015625, -0.0054931640625, 0.021484375, ...

[ 83, 183234, 17, 8560, 67, 32354, 23, 1556, 142508, 501, 4904, 4865, 111, 3949, 3742, 765, 1914, 822, 112, 70, 313 ]

[ 0.0289764404296875, 0.1888427734375, 0.08587646484375, 0.28564453125, 0.18701171875, 0.18798828125, 0.04473876953125, 0.1405029296875, 0.2275390625, 0.04754638671875, 0.179931640625, 0.03485107421875, 0.011688232421875, 0.045379638671875, 0.1298828125, 0.051788330078125, 0.0601501464...

embed

32692819_c1

32692819

haskell

1

(List(9,1,5,2,10,3) filterM keepSmall) ^ and Error:(182, 40) type mismatch; found : Int => scalaz.WriterT[scalaz.Scalaz.Id,Vector[String],Boolean] required: Int => M[Boolean] println(List(9,1,5,2,10,3) filterM keepSmall) ^ Code signals: Scalaz, Writer, Monad, Bool, Keeping, WriterT, Vector, Boolean, x.shows, List, Erro...

[ -0.0157470703125, 0.02294921875, -0.0164794921875, -0.015869140625, 0.00909423828125, -0.007598876953125, -0.003204345703125, -0.0130615234375, 0.0028839111328125, 0.01385498046875, -0.011962890625, 0.006195068359375, -0.00341796875, -0.0029296875, -0.003387451171875, -0.00686645507812...

[ 154663, 1126, 57626, 304, 963, 21320, 46312, 594, 13695, 294, 69070, 212059, 117768, 1112, 10644, 1239, 98753, 14037, 360, 18, 146232, 169, 1456, 2783, 56, 618, 16275, 60660, 62309, 71, 26455, 18770, 71713, 31, 34677, 56065, 276, 12647, 284...

[ 0.2060546875, 0.140869140625, 0.1944580078125, 0.147705078125, 0.123779296875, 0.1552734375, 0.213623046875, 0.1278076171875, 0.1922607421875, 0.00726318359375, 0.2113037109375, 0.2183837890625, 0.1065673828125, 0.1900634765625, 0.201171875, 0.13525390625, 0.30029296875, 0.08508300...

embed

36701841_c0

36701841

haskell

0

Title: Matrix Identity in haskell without list Problem title: Matrix Identity in haskell without list Tags: haskell Problem: Matrix Identity in haskell without list I want to make an Identity matrix without list syntax or list functions for eg something with tuple (x,x) ...and i want to print it like *> showMatrix (mat...

Matrix Identity in haskell without list Matrix Identity in haskell without list haskell Matrix Identity Matrix Identity in haskell without list I want to make an Identity matrix without list syntax or list functions for eg something with tuple (x,x) ...and i want to print it like

[ -0.00872802734375, 0.0169677734375, 0.012939453125, 0.0223388671875, 0.02001953125, 0.015869140625, 0.0026397705078125, 0.0118408203125, 0.0079345703125, -0.004974365234375, -0.001861572265625, -0.0017242431640625, -0.0191650390625, 0.00390625, -0.0263671875, 0.0030975341796875, 0.02...

[ 194234, 71257, 2481, 23, 1556, 142508, 15490, 5303, 3444, 3249, 50944, 425, 6002, 86531, 32354, 30046, 9844, 678, 370, 8705, 28412, 442, 1884 ]

[ 0.254150390625, 0.2490234375, 0.16796875, 0.067138671875, 0.179443359375, 0.2484130859375, 0.1964111328125, 0.2149658203125, 0.1134033203125, 0.08160400390625, 0.2235107421875, 0.1539306640625, 0.088623046875, 0.1533203125, 0.12548828125, 0.00616455078125, 0.0191650390625, 0.043731...

embed

24198008_c0

24198008

haskell

0

Title: Automatic parentheses in `Show` instances Problem title: Automatic parentheses in `Show` instances Tags: haskell Problem: Automatic parentheses in `Show` instances ghci> show (Left 3) "Left 3" ghci> show (Just 0) "Just 0" ghci> show (Just (Left 3)) "Just (Left 3)" How does Haskell automatically put parentheses a...

Automatic parentheses in `Show` instances Automatic parentheses in `Show` instances haskell Automatic Show Left Just Automatic parentheses in `Show` instances How does Haskell automatically put parentheses around nested constructor arguments?

[ 0.00439453125, -0.00145721435546875, 0.01446533203125, 0.02294921875, 0.00112152099609375, 0.0286865234375, 0.00421142578125, 0.002227783203125, 0.0029296875, 0.00101470947265625, -0.00604248046875, -0.033447265625, 0.0020751953125, 0.03271484375, 0.00384521484375, -0.01385498046875, ...

[ 51719, 1771, 49129, 35412, 90, 168660, 110527, 1556, 142508, 17367, 636, 2480, 9563, 11249, 20625, 191082, 3884, 10932, 8512, 71, 64549, 748, 10750 ]

[ 0.2191162109375, 0.053314208984375, 0.1768798828125, 0.2098388671875, 0.1107177734375, 0.2396240234375, 0.1954345703125, 0.1243896484375, 0.2457275390625, 0.208740234375, 0.06402587890625, 0.1502685546875, 0.046630859375, 0.01268768310546875, 0.123046875, 0.185546875, 0.0433654785156...

embed

39426989_c0

39426989

haskell

0

Title: Haskell type error "Couldn't match type `Char' with `t0 [Char]'" Problem title: Haskell type error "Couldn't match type `Char' with `t0 [Char]'" Tags: haskell Problem: Haskell type error "Couldn't match type `Char' with `t0 [Char]'" Code signals: Haskell, Couldn,...

Haskell type error "Couldn't match type `Char' with `t0 [Char]'" Haskell type error "Couldn't match type `Char' with `t0 [Char]'" haskell Haskell Couldn Char Expected Actual ACGT SekvensTyp Dna ARNDCEQGHILKMFPSTWYV Protein Haskell type error "Couldn't match type `Char' ...

[ 0.01531982421875, 0.0244140625, 0.0030059814453125, 0.01336669921875, -0.00011205673217773438, -0.01611328125, -0.0125732421875, -0.0103759765625, -0.00738525390625, 0.021728515625, -0.007354736328125, -0.0098876953125, 0.01202392578125, 0.0101318359375, -0.009033203125, -0.00122070312...

[ 20625, 142508, 10644, 18499, 10625, 52366, 19, 3768, 18, 14858, 84068, 678, 2389, 1556, 191147, 21656, 60075, 13, 100582, 12944, 37315, 29855, 1353, 30400, 76, 13685, 10854, 724, 156235, 47848, 51006, 102815, 856, 129228, 31577, 28282, 104, 2...

[ 0.1571044921875, 0.26123046875, 0.209228515625, 0.1947021484375, 0.043121337890625, 0.1302490234375, 0.04107666015625, 0.16357421875, 0.104736328125, 0.2222900390625, 0.2430419921875, 0.1383056640625, 0.181640625, 0.1380615234375, 0.117431640625, 0.2027587890625, 0.1424560546875, 0...

embed

41322661_c0

41322661

haskell

0

Title: why we use word "just" in "Maybe a" Problem title: why we use word "just" in "Maybe a" Tags: haskell Problem: why we use word "just" in "Maybe a" why in definition of Maybe is : data Maybe a = Nothing | Just a Why definition isn't like this: data Maybe a = Nothing | a Why ...

why we use word "just" in "Maybe a" why we use word "just" in "Maybe a" haskell Maybe Nothing Just why we use word "just" in "Maybe a" why in definition of Maybe is : Why definition isn't like this: Why we use Just, isn't be simple wihout this ?

[ 0.005126953125, 0.0021514892578125, 0.0238037109375, 0.00238037109375, 0.0120849609375, 0.0225830078125, 0.01092529296875, 0.01422119140625, 0.01324462890625, -0.01031494140625, -0.002410888671875, -0.01275634765625, -0.0185546875, 0.004852294921875, 0.00225830078125, -0.00564575195312...

[ 15400, 642, 4527, 2565, 20314, 41502, 82419, 372, 10, 23, 1556, 142508, 83425, 182747, 9563, 80934, 83, 44084, 56112, 18, 1884, 903, 186, 8781, 80060 ]

[ 0.15625, 0.05316162109375, 0.1292724609375, 0.138427734375, 0.2454833984375, 0.047454833984375, 0.129638671875, 0.156494140625, 0.1513671875, 0.0401611328125, 0.096435546875, 0.2056884765625, 0.262451171875, 0.162353515625, 0.1805419921875, 0.1375732421875, 0.05047607421875, 0.1378...

embed

13534676_c0

13534676

haskell

0

Title: Is it possible to implement filter using foldl instead of foldr? Problem title: Is it possible to implement filter using foldl instead of foldr? Tags: functional-programming, haskell Problem: Is it possible to implement filter using foldl instead of foldr? Is it possible to implement filter using foldl instead o...

Is it possible to implement filter using foldl instead of foldr? Is it possible to implement filter using foldl instead of foldr? functional-programming haskell foldl Is it possible to implement filter using foldl instead of foldr? Is it possible to implement filter using foldl instead of foldr? If so, please explain y...

[ -0.0004405975341796875, 0.0079345703125, -0.002349853515625, -0.00946044921875, -0.0159912109375, 0.0091552734375, -0.00176239013671875, 0.006622314453125, -0.0113525390625, -0.0174560546875, -0.0010986328125, -0.007598876953125, -0.0024566650390625, -0.00122833251953125, 0.0031585693359...

[ 2071, 442, 7722, 29479, 46312, 17368, 18344, 20469, 64457, 7569, 123309, 28966, 1556, 142508, 47, 73342, 208124, 21507 ]

[ 0.046722412109375, 0.04644775390625, 0.1683349609375, 0.1846923828125, 0.2479248046875, 0.07952880859375, 0.2022705078125, 0.25244140625, 0.127197265625, 0.20654296875, 0.1163330078125, 0.0919189453125, 0.09552001953125, 0.2093505859375, 0.004302978515625, 0.04620361328125, 0.1447753...

embed

34848154_c0

34848154

haskell

0

Title: What kinds of runtime errors can Haskell have? Problem title: What kinds of runtime errors can Haskell have? Tags: runtime-error, haskell Problem: What kinds of runtime errors can Haskell have? I've read that Haskell can actually have runtime errors, despite being statically typed and functional. But, no one say...

What kinds of runtime errors can Haskell have? What kinds of runtime errors can Haskell have? runtime-error haskell What Haskell What kinds of runtime errors can Haskell have? I've read that Haskell can actually have runtime errors, despite being statically typed and functional. But, no one says what runtime errors tho...

[ 0.003204345703125, 0.00567626953125, 0.015380859375, -0.00311279296875, 0.005401611328125, 0.0262451171875, -0.020751953125, 0.000316619873046875, -0.00701904296875, -0.01300048828125, -0.00946044921875, -0.0341796875, 0.01190185546875, -0.00213623046875, 0.0037078857421875, 0.00363159...

[ 8562, 11675, 6032, 18499, 7, 831, 20625, 142508, 765, 188800, 1556, 4865, 111, 20653, 61518, 8035, 13254, 10644, 123309, 17378, 2367, 8382, 13648, 186, 3714 ]

[ 0.1326904296875, 0.125732421875, 0.1669921875, 0.20947265625, 0.0858154296875, 0.08740234375, 0.158447265625, 0.26123046875, 0.08905029296875, 0.1829833984375, 0.1390380859375, 0.052337646484375, 0.055633544921875, 0.0308990478515625, 0.047271728515625, 0.0210723876953125, 0.10241699...

embed

2784271_c0

2784271

haskell

0

Title: Haskell: Converting Int to String Problem title: Haskell: Converting Int to String Tags: casting, string, haskell, int Problem: Haskell: Converting Int to String I know you can convert a String to an number with read : Prelude> read "3" :: Int 3 Prelude> read "3" :: Double 3.0 But how do you grab the String repr...

Haskell: Converting Int to String Haskell: Converting Int to String casting string haskell int Haskell Converting Prelude Double Haskell: Converting Int to String I know you can convert a String to an number with read : But how do you grab the String representation of an Int value?

[ 0.0033111572265625, -0.016357421875, 0.01251220703125, 0.01031494140625, -0.0050048828125, 0.03173828125, 0.0002727508544921875, -0.0234375, -0.002899169921875, 0.01361083984375, -0.00885009765625, -0.0390625, -0.021240234375, 0.023681640625, -0.004486083984375, -0.0018157958984375, ...

[ 20625, 142508, 814, 1916, 360, 18, 47, 23351, 214, 12, 176050, 79315, 1556, 23, 1914, 822, 107172, 1657, 3714, 831, 96760, 142, 14012, 678, 12301, 3642, 54, 398, 59102, 18811, 1363, 111, 34292 ]

[ 0.1153564453125, 0.2193603515625, 0.1070556640625, 0.0650634765625, 0.1246337890625, 0.1695556640625, 0.1121826171875, 0.21337890625, 0.1522216796875, 0.0181884765625, 0.14990234375, 0.211669921875, 0.1119384765625, 0.1044921875, 0.033599853515625, 0.1138916015625, 0.07354736328125, ...

embed

66957936_c0

66957936

haskell

0

Title: Remove elements of an array in haskell Problem title: Remove elements of an array in haskell Tags: haskell Problem: Remove elements of an array in haskell I'm trying to remove the items of an array that coincide in both using map or filter, for example: rmElements :: [Integer] -> [Integer] -> [Integer] and by pa...

Remove elements of an array in haskell Remove elements of an array in haskell haskell Remove Integer Remove elements of an array in haskell I'm trying to remove the items of an array that coincide in both using map or filter, for example: and by passing get [3,4] Thanks

[ -0.01129150390625, 0.0208740234375, -0.00396728515625, 0.01239013671875, -0.0107421875, 0.00787353515625, -0.005340576171875, -0.000354766845703125, -0.001251220703125, -0.0027923583984375, 0.00653076171875, 0.0004215240478515625, -0.000518798828125, -0.00157928466796875, -0.018676757812...

[ 181139, 80854, 111, 10298, 53, 23, 1556, 142508, 44401, 31577, 87388, 55769, 60754, 13, 15044, 17368, 22288, 46312, 27781, 390, 452, 6953, 2046, 82449, 22362 ]

[ 0.1829833984375, 0.1881103515625, 0.106201171875, 0.1976318359375, 0.142333984375, 0.04876708984375, 0.166748046875, 0.240966796875, 0.21435546875, 0.060577392578125, 0.1756591796875, 0.138671875, 0.160888671875, 0.07171630859375, 0.0360107421875, 0.0122528076171875, 0.1065673828125,...

embed

14707720_c0

14707720

haskell

0

Title: Haskell: Why is ((.).(.)) f g equal to f . g x? Problem title: Haskell: Why is ((.).(.)) f g equal to f . g x? Tags: haskell, combinators, pointfree, types, function-composition Problem: Haskell: Why is ((.).(.)) f g equal to f . g x? Could you please explain the meaning of the expression ((.).(.))? As far as I ...

Haskell: Why is ((.).(.)) f g equal to f . g x? Haskell: Why is ((.).(.)) f g equal to f . g x? haskell combinators pointfree types function-composition Haskell Why Haskell: Why is ((.).(.)) f g equal to f . g x? Could you please explain the meaning of the expression ((.).(.))? As far as I know (.) has the type (b -> c...

[ -0.00885009765625, 0.006591796875, -0.0022735595703125, 0.01806640625, 0.0023651123046875, -0.00897216796875, 0.0103759765625, 0.00909423828125, 0.0111083984375, 0.000225067138671875, -0.0125732421875, 0.004058837890625, 0.0025634765625, 0.0020751953125, -0.0196533203125, -0.0090942382...

[ 20625, 142508, 12, 44084, 83, 60494, 5, 194, 1238, 706, 105950, 47, 1022, 132, 1556, 22321, 22230, 6275, 32087, 52895, 32354, 277, 191147, 22936, 73342, 70, 91084, 125195, 2060, 3714, 10644, 275, 33079, 501, 876 ]

[ 0.168701171875, 0.2705078125, 0.0217132568359375, 0.1907958984375, 0.08392333984375, 0.1788330078125, 0.13037109375, 0.08770751953125, 0.181884765625, 0.22119140625, 0.1876220703125, 0.07476806640625, 0.156005859375, 0.04901123046875, 0.1229248046875, 0.1629638671875, 0.0525512695312...

embed

39210584_c0

39210584

haskell

0

Title: How to define the type profile for this function? Problem title: How to define the type profile for this function? Tags: functional-programming, haskell, ml Problem: How to define the type profile for this function? I have to define the type profile of this function: twice f x = f (f x); The result should be the...

How to define the type profile for this function? How to define the type profile for this function? functional-programming haskell ml How How to define the type profile for this function? I have to define the type profile of this function: The result should be the following, but I don't really get why.

[ 0.01531982421875, -0.004791259765625, 0.0026397705078125, 0.010009765625, -0.00701904296875, 0.01507568359375, -0.00823974609375, -0.0004367828369140625, -0.0084228515625, -0.031982421875, 0.0029754638671875, -0.01287841796875, -0.00750732421875, 0.01708984375, -0.0006103515625, 0.0139...

[ 11249, 47, 61924, 70, 10644, 60641, 100, 903, 32354, 123309, 28966, 1556, 142508, 7115, 87, 765, 16750, 5608, 25632, 2301, 18, 6183, 2046, 15400 ]

[ 0.08270263671875, 0.0645751953125, 0.180419921875, 0.055328369140625, 0.2430419921875, 0.264404296875, 0.0576171875, 0.08404541015625, 0.18115234375, 0.122314453125, 0.0849609375, 0.0943603515625, 0.1820068359375, 0.09490966796875, 0.001735687255859375, 0.017486572265625, 0.067626953...

embed

3945581_c0

3945581

haskell

0

Title: implement unix pipes in haskell Problem title: implement unix pipes in haskell Tags: unix, pipe, haskell Problem: implement unix pipes in haskell I'm writing a mini shell and although I've got most of it planned out, one thing I'm not sure how to do is implement piping the output of one program as the input of a...

implement unix pipes in haskell implement unix pipes in haskell unix pipe haskell implement unix pipes in haskell I'm writing a mini shell and although I've got most of it planned out, one thing I'm not sure how to do is implement piping the output of one program as the input of another. Is there a sample or something ...

[ 0.00799560546875, 0.009033203125, 0.001007080078125, 0.01348876953125, -0.00958251953125, 0.0159912109375, -0.0169677734375, -0.034912109375, -0.0059814453125, -0.03125, 0.0023956298828125, 0.0233154296875, 0.0177001953125, 0.003997802734375, -0.01708984375, 0.006622314453125, 0.0039...

[ 29479, 51, 4084, 137158, 7, 23, 1556, 142508, 32562, 7665, 128019, 2684, 203251, 1810, 959, 9077, 3642, 54, 2147, 10366, 140992, 1632, 1528, 237, 107730, 111, 15700, 121413, 6275, 48225 ]

[ 0.2156982421875, 0.1195068359375, 0.1397705078125, 0.2435302734375, 0.1412353515625, 0.0714111328125, 0.142822265625, 0.2308349609375, 0.0819091796875, 0.1356201171875, 0.1689453125, 0.005828857421875, 0.0733642578125, 0.0052490234375, 0.0260162353515625, 0.0731201171875, 0.017044067...

embed

54156236_c3

54156236

haskell

3

67fe8a4099016b98e.log, Configuring, hourglass-0.2.12-b4e44e80db4dcca3718451012cc7a7ae0dbecf4c2012a6e72d47ff05ce4a80c4, data-default-instances-old-locale-0.0.1-68d07651afec351ca1382acf43ff1403a204de89c766785ea29b5eb125d7ba75, old-locale-1.0.0.7-876e14e8597a236e2a6f9fc9ced1be9ed8de77ad3379ae7cf45fd794315103c0, old-time-1...

[ -0.00335693359375, 0.006103515625, 0.007537841796875, 0.00341796875, 0.0198974609375, -0.0036163330078125, -0.01263427734375, -0.000782012939453125, 0.006805419921875, 0.0157470703125, -0.0235595703125, -0.0052490234375, 0.018798828125, -0.00836181640625, 0, -0.00848388671875, -0.010...

[ 12661, 2242, 1019, 11, 2839, 61158, 2485, 275, 16665, 13, 5, 4867, 4, 1657, 59994, 214, 56816, 134974, 9, 133684, 1530, 12465, 4836, 48073, 11210, 10945, 1819, 33970, 238, 10693, 13330, 8194, 2053, 214810, 73, 116071, 18345, 98908, 99929, ...

[ 0.1944580078125, 0.1112060546875, 0.031219482421875, 0.0213775634765625, 0.0960693359375, 0.1329345703125, 0.1549072265625, 0.01824951171875, 0.1531982421875, 0.04974365234375, 0.0706787109375, 0.240234375, 0.03521728515625, 0.106201171875, 0.2371826171875, 0.1051025390625, 0.2332763...

embed

19309052_c0

19309052

haskell

0

Title: Custom 404 in Snap Web Framework Problem title: Custom 404 in Snap Web Framework Tags: haskell-snap-framework, haskell Problem: Custom 404 in Snap Web Framework I am building a website with Snap. How do I specify a custom 404 handler to capture all routes that don't exist? I would like to redefine the default: N...

Custom 404 in Snap Web Framework Custom 404 in Snap Web Framework haskell-snap-framework haskell Custom Snap Web Framework Custom 404 in Snap Web Framework I am building a website with Snap. How do I specify a custom 404 handler to capture all routes that don't exist? I would like to redefine the default: Thanks

[ -0.012451171875, 0.0274658203125, -0.001983642578125, 0.003021240234375, -0.03466796875, -0.00035858154296875, -0.00897216796875, -0.00970458984375, 0.004150390625, -0.0108642578125, -0.0311279296875, -0.034912109375, -0.0260009765625, -0.0185546875, 0.000606536865234375, 0.01574707031...

[ 130664, 1112, 617, 23, 121190, 4002, 202220, 1556, 142508, 10957, 160328, 18244, 33976, 4165, 678, 11249, 40140, 18929, 114122, 35863, 141621, 756, 36439, 450, 2301, 18, 32316, 1884, 15265, 64552, 114977, 22362 ]

[ 0.2005615234375, 0.21240234375, 0.2384033203125, 0.06378173828125, 0.2406005859375, 0.138427734375, 0.249755859375, 0.0950927734375, 0.158935546875, 0.190673828125, 0.08953857421875, 0.0173797607421875, 0.07574462890625, 0.11004638671875, 0.01363372802734375, 0.0198516845703125, 0.10...

embed

33059378_c0

33059378

haskell

0

Title: Why does `traceId` return the message string itself? Problem title: Why does `traceId` return the message string itself? Tags: debugging, haskell Problem: Why does `traceId` return the message string itself? I found it really weird that traceId returns the message string itself. Why would anyone want to do that?...

Why does `traceId` return the message string itself? Why does `traceId` return the message string itself? debugging haskell Why Why does `traceId` return the message string itself? I found it really weird that traceId returns the message string itself. Why would anyone want to do that? Is there a common scenario where ...

[ 0.01043701171875, -0.000339508056640625, -0.01068115234375, 0.01312255859375, 0.0076904296875, 0.002655029296875, 0.0019989013671875, -0.0027923583984375, 0.005645751953125, -0.01806640625, 0.0230712890625, -0.00567626953125, -0.021728515625, -0.0027618408203125, 0.00762939453125, 0.02...

[ 44084, 14602, 39989, 13, 568, 71, 30646, 26008, 79315, 68034, 8, 978, 1556, 142508, 179459, 144851, 7, 106117 ]

[ 0.0938720703125, 0.0189361572265625, 0.19091796875, 0.1094970703125, 0.152587890625, 0.1785888671875, 0.16748046875, 0.1187744140625, 0.1829833984375, 0.1468505859375, 0.03424072265625, 0.0791015625, 0.057586669921875, 0.160400390625, 0.0906982421875, 0.206787109375, 0.00341796875, ...

embed

17384905_c0

17384905

haskell

0

Title: Trace of call stack in haskell with variables Problem title: Trace of call stack in haskell with variables Tags: callstack, debugging, haskell, stack-trace Problem: Trace of call stack in haskell with variables Is there anyway to trace haskell execution step by step? I mean i wanna see every call of function wit...

Trace of call stack in haskell with variables Trace of call stack in haskell with variables callstack debugging haskell stack-trace Trace Trace of call stack in haskell with variables Is there anyway to trace haskell execution step by step? I mean i wanna see every call of function with variable values. Something smila...

[ 0.01080322265625, 0.0101318359375, -0.01239013671875, 0.00927734375, 0.0189208984375, -0.00433349609375, -0.01055908203125, 0.0030975341796875, 0.0027923583984375, -0.04345703125, -0.0062255859375, -0.0062255859375, 0.0028533935546875, 0.01116943359375, 0.0220947265625, 0.010986328125,...

[ 4937, 329, 111, 11782, 177261, 23, 1556, 142508, 678, 77336, 590, 2594, 8, 978, 39989, 2685, 109954, 47, 144851, 71924, 1830, 29954, 390, 6165, 76, 1957, 11907, 32354, 142424, 61567, 147, 502, 4867, 17086, 13 ]

[ 0.1866455078125, 0.1409912109375, 0.131103515625, 0.1630859375, 0.186767578125, 0.02886962890625, 0.126953125, 0.2412109375, 0.084228515625, 0.218017578125, 0.1163330078125, 0.06951904296875, 0.05718994140625, 0.0780029296875, 0.178466796875, 0.0155792236328125, 0.09423828125, 0.04...

embed

20180764_c0

20180764

haskell

0

Title: How can I get Ptr of a ByteString? Problem title: How can I get Ptr of a ByteString? Tags: haskell, bytestring Problem: How can I get Ptr of a ByteString? Is there a way to extract underlying direct pointer to memory off the ByteString object? My current approach is incorrect, compiler says. getPtr :: ByteString...

How can I get Ptr of a ByteString? How can I get Ptr of a ByteString? haskell bytestring How Ptr ByteString Word8 How can I get Ptr of a ByteString? Is there a way to extract underlying direct pointer to memory off the ByteString object? My current approach is incorrect, compiler says.

[ 0.003692626953125, 0.024658203125, 0.00445556640625, 0.00015735626220703125, -0.01171875, 0.0093994140625, -0.01141357421875, -0.010009765625, -0.00750732421875, -0.0242919921875, 0.024658203125, -0.0031585693359375, -0.00823974609375, 0.01312255859375, -0.0203857421875, 0.015563964843...

[ 11249, 831, 87, 2046, 436, 4448, 111, 3311, 67, 71713, 214, 1556, 142508, 390, 91693, 22543, 1019, 3917, 125663, 1379, 538, 8951, 6275, 56, 47, 98323, 5773, 36746, 43581, 51515, 214552, 9969, 34759, 17378 ]

[ 0.06396484375, 0.0963134765625, 0.04376220703125, 0.10498046875, 0.10791015625, 0.2481689453125, 0.1219482421875, 0.10382080078125, 0.1573486328125, 0.1878662109375, 0.0914306640625, 0.0916748046875, 0.188232421875, 0.082275390625, 0.185302734375, 0.1302490234375, 0.172119140625, 0...

embed

48720747_c2

48720747

haskell

2

V.unsafeIndex cols (j-1) b = wsum (V.unsafeIndex a' (i-1)) (V.unsafeIndex bt' (j-1)) in a + b wsum r c = foldl (wsumHelper r c) 0 [0,2..p-1] Code signals: Control.Exception, qualified, Control.DeepSeq, System.Clock, System.Mem, Data.Time, Performance, Haskell, Main, Data.Vector, Data.Matrix, M.Matrix, M.nrows, M.ncols...

[ -0.016357421875, 0.023193359375, 0.0064697265625, -0.0025177001953125, -0.0155029296875, -0.01324462890625, -0.010986328125, -0.015869140625, 0.01214599609375, -0.0186767578125, 0.00189971923828125, 0.01031494140625, -0.00555419921875, -0.017333984375, -0.0400390625, -0.0128173828125, ...

[ 310, 5, 309, 115840, 4153, 39659, 3365, 7, 170, 110218, 876, 2203, 148, 11832, 856, 10, 25, 14, 18, 16, 997, 1690, 501, 18344, 20469, 434, 60785, 1264, 757, 5442, 76172, 28864, 26073, 12, 27131, 63928, 217225, 4657, 4517, 4233, 864, 1...

[ 0.2265625, 0.04534912109375, 0.132568359375, 0.2451171875, 0.123046875, 0.233154296875, 0.1654052734375, 0.112548828125, 0.1549072265625, 0.15478515625, 0.123779296875, 0.056060791015625, 0.1348876953125, 0.2362060546875, 0.1849365234375, 0.04486083984375, 0.0784912109375, 0.053497...

embed

68002815_c2

68002815

haskell

2

moreThan 2 [1,2,3,3,4,2,3,5,1,2] ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ zadanie.hs:23:27: error: • No instance for (Num Code signals: Prelude, Data.List, a, being, the, Problem, x:xs, moreThan2, x:delete, zadanie.hs:23:8, Ambiguous, Show, Probable, These, Ordering, Defined, GHC.Show, Integer, Maybe, zadanie.hs:23:15, GH...

[ -0.0027618408203125, 0.01043701171875, -0.00701904296875, -0.00086212158203125, -0.005950927734375, 0.0185546875, 0.00396728515625, 0.005340576171875, 0.015625, -0.00750732421875, -0.003936767578125, -0.0322265625, 0.020263671875, -0.00616455078125, 0.002349853515625, -0.0185546875, ...

[ 1286, 618, 1121, 116, 68252, 4, 155761, 82449, 304, 92714, 133063, 58745, 16377, 15729, 115296, 127, 7, 24864, 27592, 18499, 768, 438, 110527, 100, 839, 316, 28864, 26073, 1914, 822, 112, 11809, 154663, 10, 8035, 70, 15649, 1022, 425, 852...

[ 0.2376708984375, 0.1107177734375, 0.237060546875, 0.2132568359375, 0.054931640625, 0.048614501953125, 0.1719970703125, 0.2020263671875, 0.1544189453125, 0.209716796875, 0.1561279296875, 0.00921630859375, 0.035980224609375, 0.0153656005859375, 0.2470703125, 0.0880126953125, 0.05236816...

embed

54318114_c0

54318114

haskell

0

Title: lazy evaluation in infinte list Problem title: lazy evaluation in infinte list Tags: haskell, infinite, list Problem: lazy evaluation in infinte list Hi I have the following code: let f n (xs) = if n < 0 then f (n-1) (n:xs) else xs f (-3) [] !! 1 and I expect it to print -4 But it does not print anything and kee...

lazy evaluation in infinte list lazy evaluation in infinte list haskell infinite list n-1 n:xs lazy evaluation in infinte list Hi I have the following code: and I expect it to print -4 But it does not print anything and keeps calculation in background. What is wrong with my code?

[ -0.0135498046875, 0.0010528564453125, -0.0030364990234375, -0.0064697265625, -0.005889892578125, -0.00347900390625, 0.0299072265625, 0.0093994140625, 0.0184326171875, -0.01171875, 0.01239013671875, -0.00848388671875, 0.0174560546875, 0.00958251953125, 0.0028533935546875, 0.011779785156...

[ 21, 3285, 219836, 34128, 6191, 5303, 1556, 142508, 54241, 13, 5759, 653, 425, 7, 23, 2673, 25632, 18151, 41206, 28412, 20, 617, 4966, 14602, 959, 23937, 13695, 74481, 76615, 44691 ]

[ 0.1322021484375, 0.21142578125, 0.2125244140625, 0.0714111328125, 0.1358642578125, 0.17626953125, 0.10345458984375, 0.16552734375, 0.1278076171875, 0.0167999267578125, 0.1337890625, 0.0160675048828125, 0.065185546875, 0.0262451171875, 0.015869140625, 0.0013723373413085938, 0.04745483...

embed

10837238_c0

10837238

haskell

0

Title: Command ls or dir in ghci Problem title: Command ls or dir in ghci Tags: haskell, ghci Problem: Command ls or dir in ghci I'm new to Haskell. I'm using ghci . I know I can move through directory with the command :cd <dir> . But I cannot find the command to list the files in a directory (something like Unix ls or...

Command ls or dir in ghci Command ls or dir in ghci haskell ghci Command Command ls or dir in ghci I'm new to Haskell. I'm using ghci . I know I can move through directory with the command :cd <dir> . But I cannot find the command to list the files in a directory (something like Unix ls or Microsoft dir ). Is it possib...

[ -0.007049560546875, 0.001495361328125, 0.0106201171875, 0.0140380859375, -0.009521484375, 0.02490234375, 0.01287841796875, 0.00909423828125, 0.00494384765625, -0.0194091796875, -0.01092529296875, -0.028076171875, 0.0162353515625, 0.00836181640625, -0.0167236328125, 0.00921630859375, ...

[ 123573, 96, 7, 707, 5402, 23, 31380, 318, 1556, 142508, 3525, 20625, 17368, 3714, 831, 25813, 8305, 14364, 53, 678, 75101, 71574, 936, 53418, 7413, 47, 5303, 102158, 992, 4084, 7244, 7722, 54, 41877, 17304 ]

[ 0.21484375, 0.158935546875, 0.21630859375, 0.1441650390625, 0.2357177734375, 0.0877685546875, 0.157958984375, 0.1783447265625, 0.1180419921875, 0.218994140625, 0.03204345703125, 0.10791015625, 0.0192108154296875, 0.039886474609375, 0.04583740234375, 0.14794921875, 0.119384765625, 0...

embed

2464406_c0

2464406

haskell

0

Title: Point-free in Haskell Problem title: Point-free in Haskell Tags: pointfree, haskell, coding-style Problem: Point-free in Haskell I have this code that I want to make point-free; (\k t -> chr $ a + flip mod 26 (ord k + ord t -2*a)) How do I do that? Also are there some general rules for point free style other tha...

Point-free in Haskell Point-free in Haskell pointfree haskell coding-style Point-free Haskell Point-free in Haskell I have this code that I want to make point-free; (\k t -> chr $ a + flip mod 26 (ord k + ord t -2*a)) How do I do that? Also are there some general rules for point free style other than "think about this ...

[ 0.0169677734375, 0.004638671875, 0.0091552734375, -0.001739501953125, 0.007080078125, 0.00213623046875, 0.0021820068359375, -0.0206298828125, 0.004119873046875, -0.0267333984375, -0.000560760498046875, -0.031494140625, 0.00933837890625, 0.037109375, -0.0390625, -0.00421142578125, 0.0...

[ 41097, 9, 32087, 23, 20625, 142508, 6275, 1556, 552, 6238, 40946, 765, 903, 18151, 3444, 3249, 41872, 92, 808, 33079, 17656, 3650, 10, 997, 147505, 2811, 1381, 6651, 472, 8597, 122297, 1639, 11, 11249, 54, 4537, 91736, 4092, 20623, 201950...

[ 0.1951904296875, 0.07025146484375, 0.20703125, 0.07513427734375, 0.146484375, 0.242919921875, 0.1815185546875, 0.126708984375, 0.09423828125, 0.07958984375, 0.184326171875, 0.00604248046875, 0.036895751953125, 0.1611328125, 0.0645751953125, 0.06976318359375, 0.016632080078125, 0.04...

embed

52508886_c0

52508886

haskell

0

Title: Haskell: Is there any object that is of every type, like `null` in Java? Problem title: Haskell: Is there any object that is of every type, like `null` in Java? Tags: haskell Problem: Haskell: Is there any object that is of every type, like `null` in Java? In Java, with a little exception, null is of every type....

Haskell: Is there any object that is of every type, like `null` in Java? Haskell: Is there any object that is of every type, like `null` in Java? haskell Haskell Java Haskell: Is there any object that is of every type, like `null` in Java? In Java, with a little exception, null is of every type. Is there a correspondin...

[ 0.012451171875, 0.00885009765625, 0.0145263671875, 0.0078125, -0.000362396240234375, 0.0078125, 0.00180816650390625, -0.0159912109375, -0.0081787109375, -0.005706787109375, -0.0057373046875, -0.050048828125, 0.01055908203125, -0.003173828125, -0.0081787109375, 0.0002899169921875, 0.0...

[ 20625, 142508, 2071, 2685, 2499, 36746, 83, 111, 11907, 10644, 1884, 139550, 23, 41925, 450, 1556, 12, 360, 10176, 131527, 56574, 42518 ]

[ 0.129638671875, 0.2509765625, 0.0389404296875, 0.059722900390625, 0.080322265625, 0.206298828125, 0.073974609375, 0.0826416015625, 0.1348876953125, 0.177734375, 0.0946044921875, 0.2568359375, 0.0960693359375, 0.2318115234375, 0.0180511474609375, 0.0992431640625, 0.017730712890625, ...

embed

44358134_c0

44358134

haskell

0

Title: Map-ing over ConduitM? Problem title: Map-ing over ConduitM? Tags: haskell Problem: Map-ing over ConduitM? How can I implement the following in Conduit ? Given a conduit whose input is of type a and output is of type b , output a new conduit that returns a type of c , i.e. rather than b . g :: Monad m => Conduit...

Map-ing over ConduitM? Map-ing over ConduitM? haskell Map-ing ConduitM Monad Map-ing over ConduitM? How can I implement the following in Conduit ? Given a conduit whose input is of type a and output is of type b , output a new conduit that returns a type of c , i.e. rather than b . g :: Monad m => ConduitM a b m () -> ...

[ -0.01055908203125, 0.0089111328125, 0.0126953125, 0.0257568359375, 0.01226806640625, 0.017822265625, 0.000720977783203125, 0.0037384033203125, 0.000054836273193359375, 0.00119781494140625, -0.0184326171875, -0.016845703125, -0.004302978515625, 0.0159912109375, -0.00029754638671875, -0....

[ 42719, 9, 214, 645, 1657, 112061, 594, 32, 1556, 142508, 60331, 71, 11249, 831, 29479, 25632, 23, 77878, 120565, 107730, 83, 111, 10644, 10, 140992, 876, 3525, 30646, 501, 43257, 706, 347, 44357, 33079 ]

[ 0.2459716796875, 0.10113525390625, 0.120849609375, 0.138671875, 0.1207275390625, 0.2198486328125, 0.2119140625, 0.0108642578125, 0.122314453125, 0.2266845703125, 0.17041015625, 0.0950927734375, 0.022674560546875, 0.01776123046875, 0.1636962890625, 0.0498046875, 0.043060302734375, 0...

embed

6009031_c0

6009031

haskell

0

Title: Difference between hsc2hs and c2hs? Problem title: Difference between hsc2hs and c2hs? Tags: ffi, hsc2hs, c2hs, haskell Problem: Difference between hsc2hs and c2hs? What is the difference between hsc2hs and c2hs? I know what hsc2hs is a preprocessor but what does it exactly do? And c2hs can make Haskell modules ...

Difference between hsc2hs and c2hs? Difference between hsc2hs and c2hs? ffi hsc2hs c2hs haskell Difference hsc2hs c2hs Difference between hsc2hs and c2hs? What is the difference between hsc2hs and c2hs? I know what hsc2hs is a preprocessor but what does it exactly do? And c2hs can make Haskell modules from C-code, but ...

[ 0.0142822265625, 0.006622314453125, -0.0093994140625, 0.0164794921875, 0.0091552734375, 0.014892578125, 0.01116943359375, 0.00848388671875, -0.00150299072265625, -0.00244140625, 0.006561279296875, -0.0281982421875, 0.0033111572265625, 0.023193359375, -0.01031494140625, 0.00213623046875...

[ 803, 18234, 6620, 17721, 1096, 10382, 304, 127, 7, 136, 501, 24500, 1556, 142508, 70, 60212, 479, 63923, 748, 2367, 14602, 66161, 54, 831, 3249, 20625, 88996, 1295, 313, 40899, 3871 ]

[ 0.0474853515625, 0.147216796875, 0.0439453125, 0.0703125, 0.10369873046875, 0.1510009765625, 0.1646728515625, 0.197021484375, 0.114501953125, 0.042083740234375, 0.06781005859375, 0.1082763671875, 0.1004638671875, 0.20556640625, 0.00823974609375, 0.149169921875, 0.120361328125, 0.10...

embed

23441495_c0

23441495

haskell

0

Title: Haskell syntax error? Problem title: Haskell syntax error? Tags: haskell Problem: Haskell syntax error? I cant compile this part of code: game a = let gameBoard ++ a black = test a colors white = (test2 a colors) - black createScore black white in merge gameBoard score geting: Syntax error in declaration (unexpe...

Haskell syntax error? Haskell syntax error? haskell Haskell test2 Haskell syntax error? I cant compile this part of code: geting: Syntax error in declaration (unexpected `}', possibly due to bad layout) Thanks for help.

[ -0.00872802734375, 0.01080322265625, -0.0224609375, 0.00323486328125, 0.0108642578125, -0.004852294921875, -0.031982421875, 0.01116943359375, 0.0172119140625, 0.01116943359375, -0.004486083984375, 0.024169921875, 0.0002880096435546875, -0.01416015625, 0.0147705078125, -0.0140380859375,...

[ 20625, 142508, 6002, 86531, 18499, 32, 1556, 3034, 304, 45767, 9969, 1340, 903, 2831, 18151, 2046, 214, 19010, 23, 21635, 309, 83613, 9473, 8152, 144681, 4743, 6494, 108802, 4358 ]

[ 0.1282958984375, 0.2291259765625, 0.170654296875, 0.218017578125, 0.1915283203125, 0.03375244140625, 0.1065673828125, 0.11688232421875, 0.09405517578125, 0.11309814453125, 0.0909423828125, 0.0853271484375, 0.03631591796875, 0.07586669921875, 0.00766754150390625, 0.05780029296875, 0.0...

embed

64841584_c0

64841584

haskell

0

Title: How do i write this function in Haskell Problem title: How do i write this function in Haskell Tags: haskell, csv Problem: How do i write this function in Haskell I am required to do a haskell project which takes a csv and calculate the average for each day from it. Below is the code I have done so far main :: I...

How do i write this function in Haskell How do i write this function in Haskell haskell csv How Haskell Char dataexport.csv K.splitOneOf How do i write this function in Haskell

[ 0.0031280517578125, -0.00885009765625, 0.0002117156982421875, 0.02880859375, -0.00007581710815429688, 0.0211181640625, 0.01226806640625, -0.00677490234375, 0.0027923583984375, -0.007476806640625, -0.01458740234375, -0.030517578125, -0.000675201416015625, 0.007293701171875, -0.0146484375,...

[ 11249, 33022, 903, 32354, 20625, 142508, 54, 17, 23, 1556, 20763, 334, 21656, 2053, 180758, 4439, 341, 7008, 4353, 62068, 132887 ]

[ 0.03131103515625, 0.191650390625, 0.10107421875, 0.2236328125, 0.134765625, 0.234130859375, 0.0197906494140625, 0.04388427734375, 0.0152435302734375, 0.10479736328125, 0.068603515625, 0.2056884765625, 0.1876220703125, 0.0960693359375, 0.255859375, 0.072265625, 0.117431640625, 0.026...

embed

27091581_c0

27091581

haskell

0

Title: Restrictions on Types of `a -> b` Function Problem title: Restrictions on Types of `a -> b` Function Tags: haskell Problem: Restrictions on Types of `a -> b` Function Let's say I have part of a function's signature: f :: (a -> b) -> ... Is there any restriction (such as their kinds ) on the types of a and ...

Restrictions on Types of `a -> b` Function Restrictions on Types of `a -> b` Function haskell Restrictions Types Restrictions on Types of `a -> b` Function Let's say I have part of a function's signature: f :: (a -> b) -> ... Is there any restriction (such as their kinds ) on the types of a and b ? a can't be a f...

[ 0.003448486328125, 0.011474609375, -0.005615234375, 0.01483154296875, -0.00506591796875, 0.0031890869140625, -0.0036163330078125, -0.0054931640625, 0.0115966796875, 0.003265380859375, -0.0230712890625, -0.037841796875, 0.0093994140625, -0.00482177734375, -0.01031494140625, -0.005737304...

[ 853, 144225, 17514, 98, 60457, 7, 111, 9473, 11, 20, 1230, 5386, 876, 28670, 10763, 1556, 142508, 33079, 5154, 87, 765, 2831, 32354, 138256, 1238, 1984, 16, 153, 2071, 2685, 2499, 185190, 2363, 8562, 52895, 10, 136, 831, 18, 186, 238, ...

[ 0.107666015625, 0.2164306640625, 0.097900390625, 0.1109619140625, 0.2010498046875, 0.0318603515625, 0.06878662109375, 0.0147705078125, 0.131103515625, 0.07666015625, 0.09393310546875, 0.1307373046875, 0.186767578125, 0.1734619140625, 0.07354736328125, 0.146728515625, 0.2298583984375,...

embed

8484284_c1

8484284

haskell

1

bad on my code, I’ve only been studying Haskell only for 5 weeks) foo n p newtuple = fooAux newtuple fob where fooAux _ [] = [] fooAux m ((_):ds) = m:ds fob n p = ((aux2 xxs)!!n)!!p where aux2 [] = [] aux2 ((_,_,c):xs) = c:aux2 xs Finally I will put all back together, using splitAt . Is my approach to the problem corr...

[ -0.0021820068359375, -0.00008249282836914062, -0.01251220703125, 0.002716064453125, -0.006866455078125, 0.033935546875, -0.007110595703125, 0.0037689208984375, 0.03076171875, -0.0400390625, 0.02001953125, -0.0096435546875, 0.01470947265625, 0.00634765625, -0.0128173828125, -0.009216308...

[ 6494, 98, 759, 18151, 272, 4734, 2809, 35187, 20625, 142508, 100, 190, 40859, 5775, 31, 653, 915, 3525, 458, 8705, 2203, 284, 6077, 275, 347, 6468, 12, 10442, 304, 113664, 7, 1146, 19, 254, 2970, 238, 425, 501, 1022, 201106, 1221, 388...

[ 0.19677734375, 0.058349609375, 0.030670166015625, 0.191650390625, 0.005126953125, 0.074462890625, 0.0399169921875, 0.07958984375, 0.1627197265625, 0.2666015625, 0.0189208984375, 0.0640869140625, 0.098388671875, 0.152587890625, 0.0877685546875, 0.060821533203125, 0.1490478515625, 0....

embed

22765631_c0

22765631

haskell

0

Title: runhaskell setup configure [ installing] Problem title: runhaskell setup configure [ installing] Tags: runhaskell, haskell Problem: runhaskell setup configure [ installing] When I try to configure the Cabal-1.18.1.3 package I get the error: Configuring Cabal-1.18.1.3... Setup: does not exist My system is Windows...

runhaskell setup configure [ installing] runhaskell setup configure [ installing] runhaskell haskell runhaskell setup configure [ installing] When I try to configure the Cabal-1.18.1.3 package I get the error: Configuring Cabal-1.18.1.3... Setup: does not exist My system is Windows 8 Pro x64, 2GB RAM, 1.7GHz dual core....

[ 0.00543212890625, 0.0084228515625, 0.010498046875, 0.0037841796875, -0.01251220703125, 0.0024566650390625, -0.00457763671875, -0.0048828125, 0.0322265625, 0.0166015625, -0.030029296875, -0.007476806640625, -0.000072479248046875, -0.0157470703125, 0.01300048828125, 0.00213623046875, 0...

[ 11675, 10557, 142508, 169581, 222495, 20600, 1556, 9790, 70, 30438, 289, 5759, 1819, 81046, 98169, 18499, 1657, 59994, 214, 5, 19943, 2037, 14602, 959, 32316, 5426, 3773, 382, 1250, 13307, 26959, 100920, 147748, 87758, 56458, 37842, 32562, 23...

[ 0.130615234375, 0.16162109375, 0.252197265625, 0.230712890625, 0.2381591796875, 0.1063232421875, 0.1605224609375, 0.074462890625, 0.0076904296875, 0.18212890625, 0.1976318359375, 0.08203125, 0.1732177734375, 0.1993408203125, 0.1768798828125, 0.16748046875, 0.07525634765625, 0.21057...

embed

27240142_c0

27240142

haskell

0

Title: How can I get the indexes of elements in a Haskell list Problem title: How can I get the indexes of elements in a Haskell list Tags: haskell Problem: How can I get the indexes of elements in a Haskell list Is there any function in Haskell that returns the indexs of elements like elemIndex in a list. For example ...

How can I get the indexes of elements in a Haskell list How can I get the indexes of elements in a Haskell list haskell How Haskell How can I get the indexes of elements in a Haskell list Is there any function in Haskell that returns the indexs of elements like elemIndex in a list. For example for the list [1,2,3,4,2,3...

[ -0.00177764892578125, 0.01190185546875, 0.00148773193359375, 0.00103759765625, -0.008544921875, 0.01312255859375, -0.006378173828125, -0.006072998046875, 0.003387451171875, -0.02734375, -0.0034332275390625, -0.0262451171875, -0.00537109375, 0.0262451171875, -0.00677490234375, -0.010498...

[ 11249, 831, 87, 2046, 70, 63262, 90, 111, 80854, 23, 20625, 142508, 5303, 10, 1556, 2685, 2499, 32354, 30646, 7, 1884, 88, 195, 4153, 39659, 27781, 133063, 82449, 155761, 16487, 100, 116, 163324 ]

[ 0.05767822265625, 0.0792236328125, 0.040374755859375, 0.133056640625, 0.076171875, 0.233642578125, 0.168212890625, 0.07562255859375, 0.204833984375, 0.0623779296875, 0.1407470703125, 0.2261962890625, 0.1708984375, 0.008056640625, 0.1234130859375, 0.013214111328125, 0.0341796875, 0....

embed

30954365_c1

30954365

haskell

1

not sure whether it's the fact that the specific container OS is Ubuntu or not. I'd love to hear suggestions on the matter. Thanks! Code signals: EXPOSE, Docker, Yesod, Linking, Failure, haskell:7.8, RUN, libpq5, ADD, WORKDIR, CMD, x86_64-linux-ghc-7.8.4, cryptonite-0.3, libHScryptonite-0.3.a, generic.o, cipher-aes-0....

[ -0.0079345703125, 0.01214599609375, -0.0023040771484375, 0.0079345703125, -0.029541015625, 0.0013885498046875, 0.0035858154296875, -0.0191650390625, 0.021728515625, 0.016845703125, 0.01019287109375, -0.0224609375, 0.02783203125, 0.022216796875, -0.020263671875, -0.0203857421875, 0.01...

[ 959, 9077, 7, 15824, 70, 29458, 116419, 11787, 83, 116890, 5161, 36802, 157666, 26866, 22362, 38, 28864, 26073, 12, 104165, 7285, 647, 984, 11050, 32635, 2199, 12779, 214, 190355, 3408, 1556, 142508, 176391, 130747, 25474, 864, 758, 24057, ...

[ 0.0732421875, 0.06866455078125, 0.07958984375, 0.0379638671875, 0.00335693359375, 0.09735107421875, 0.31298828125, 0.21240234375, 0.126220703125, 0.287841796875, 0.1142578125, 0.0745849609375, 0.0777587890625, 0.0143890380859375, 0.0168914794921875, 0.031768798828125, 0.2225341796875...

embed

60405858_c0

60405858

haskell

0

Title: How to filter a list of lists using a list in haskell Problem title: How to filter a list of lists using a list in haskell Tags: list, haskell Problem: How to filter a list of lists using a list in haskell I have this list of lists a = [["a","b","c"],["d","e","f"]] b = ["a","b"] I want to filter a using b so the...

How to filter a list of lists using a list in haskell How to filter a list of lists using a list in haskell list haskell a How How to filter a list of lists using a list in haskell I have this list of lists I want to filter a using b so the output should be ["a","b","c"] all elements in b should be in a

[ -0.0096435546875, 0.023193359375, -0.002197265625, 0.01361083984375, -0.01507568359375, 0.001922607421875, 0.00579833984375, 0.000209808349609375, 0.0004177093505859375, 0.004547119140625, -0.006317138671875, -0.0027008056640625, 0.0024566650390625, 0.0150146484375, -0.043701171875, -0...

[ 11249, 46312, 5303, 111, 7, 17368, 10, 23, 1556, 142508, 47, 3444, 876, 140992, 5608, 11, 275, 238, 756, 80854, 186 ]

[ 0.04986572265625, 0.24267578125, 0.22900390625, 0.06927490234375, 0.0863037109375, 0.1024169921875, 0.0723876953125, 0.06988525390625, 0.1485595703125, 0.21240234375, 0.009124755859375, 0.0251312255859375, 0.05938720703125, 0.1304931640625, 0.04913330078125, 0.0214385986328125, 0.055...

embed

22740391_c0

22740391

haskell

0

Title: any mature library in Haskell for network packets handling? Problem title: any mature library in Haskell for network packets handling? Tags: haskell, scapy, network-programming Problem: any mature library in Haskell for network packets handling? any mature library in Haskell for network packets handling? in pyth...

any mature library in Haskell for network packets handling? any mature library in Haskell for network packets handling? haskell scapy network-programming Haskell any mature library in Haskell for network packets handling? any mature library in Haskell for network packets handling? in python we have scapy, any similar t...

[ 0.00823974609375, 0.012939453125, 0.00154876708984375, 0.02490234375, -0.0030059814453125, 0.03271484375, -0.00098419189453125, -0.00173187255859375, -0.00119781494140625, -0.017333984375, 0.028076171875, -0.04248046875, 0.01226806640625, 0.0020751953125, -0.00701904296875, -0.00634765...

[ 2499, 90638, 35773, 1294, 23, 20625, 142508, 100, 33120, 43824, 7831, 45064, 1556, 91, 15644, 53, 28966, 17198, 50828, 765, 21373, 13580, 8999 ]

[ 0.05511474609375, 0.2073974609375, 0.2283935546875, 0.1602783203125, 0.05755615234375, 0.150634765625, 0.267822265625, 0.076416015625, 0.1494140625, 0.143310546875, 0.114013671875, 0.1513671875, 0.1180419921875, 0.033355712890625, 0.1842041015625, 0.1734619140625, 0.0810546875, 0.0...

embed

23325894_c0

23325894

haskell

0

Title: How to get cursor position in TextView in gtk2hs? Problem title: How to get cursor position in TextView in gtk2hs? Tags: haskell, gtk2hs Problem: How to get cursor position in TextView in gtk2hs? I have a TextView with assigned non-empty TextBuffer . How to get current cursor position in TextView ? Or how to get...

How to get cursor position in TextView in gtk2hs? How to get cursor position in TextView in gtk2hs? haskell gtk2hs How TextView gtk2hs TextBuffer TextIter How to get cursor position in TextView in gtk2hs? I have a TextView with assigned non-empty TextBuffer . How to get current cursor position in TextView ? Or how to g...

[ -0.00946044921875, 0.0035858154296875, 0.00970458984375, 0.00958251953125, -0.00177001953125, -0.008544921875, 0.0244140625, 0.00848388671875, -0.00439453125, -0.029052734375, 0.02197265625, -0.051025390625, -0.002838134765625, -0.01019287109375, -0.0211181640625, 0.00787353515625, -...

[ 11249, 47, 2046, 13810, 42, 19069, 23, 24129, 100474, 31472, 304, 127, 7, 706, 1556, 142508, 7235, 18234, 568, 720, 95486, 351, 33548, 43581, 98 ]

[ 0.049560546875, 0.054962158203125, 0.103759765625, 0.190185546875, 0.151611328125, 0.19580078125, 0.05133056640625, 0.1663818359375, 0.295654296875, 0.145751953125, 0.1021728515625, 0.1331787109375, 0.04766845703125, 0.01397705078125, 0.06707763671875, 0.147216796875, 0.0665283203125...

embed

36822883_c0

36822883

haskell

0

Title: undefined value in haskell Problem title: undefined value in haskell Tags: haskell, undefined Problem: undefined value in haskell Why I can't use value undefined in haskell ? I mean that in case: >let t = undefinded >if t == undefined then "undefined" else "not undefined" It throws *** Exception: Prelude.undefin...

undefined value in haskell undefined value in haskell haskell undefined Exception Prelude.undefined undefined value in haskell Why I can't use value undefined in haskell ? I mean that in case: It throws *** Exception: Prelude.undefined Can't I use undefined value in such way ?

[ -0.0023040771484375, 0.01239013671875, 0.024169921875, -0.008544921875, 0.019775390625, -0.006500244140625, 0.005950927734375, 0.004852294921875, -0.0135498046875, -0.022705078125, -0.0107421875, 0.00531005859375, 0.0162353515625, 0.007659912109375, 0.007659912109375, 0.0146484375, 0...

[ 9232, 5983, 297, 34292, 23, 1556, 142508, 5443, 63928, 1914, 822, 112, 59437, 44084, 831, 18, 4527, 7225, 104250, 24428, 4171, 6044, 3917 ]

[ 0.1507568359375, 0.1998291015625, 0.1190185546875, 0.2183837890625, 0.049072265625, 0.1522216796875, 0.2379150390625, 0.0382080078125, 0.14404296875, 0.080322265625, 0.1531982421875, 0.128662109375, 0.1082763671875, 0.03167724609375, 0.0797119140625, 0.07891845703125, 0.1378173828125...

embed

27748744_c0

27748744

haskell

0

Title: How to apply a function to a value inside a constructor in haskell? Problem title: How to apply a function to a value inside a constructor in haskell? Tags: haskell Problem: How to apply a function to a value inside a constructor in haskell? Code signals: f, How, MuOp, Name, QName, QOp, Exp, Decl, Literal, Guard...

How to apply a function to a value inside a constructor in haskell? How to apply a function to a value inside a constructor in haskell? haskell f How MuOp Name QName QOp Exp Decl Literal GuardedRhs Bool Couldn Test MuCheck MuOp.hs:28:10 Relevant MuOp.hs:29:7 MuOp.hs:29:1 How to apply a function to a value inside a cons...

[ 0.0020294189453125, -0.0250244140625, -0.00138092041015625, 0.0166015625, 0.0108642578125, -0.0006256103515625, -0.00714111328125, 0.00927734375, 0.00787353515625, -0.029052734375, 0.010498046875, 0.005096435546875, 0.0164794921875, -0.0035858154296875, 0.0111083984375, -0.013732910156...

[ 11249, 47, 59911, 32354, 34292, 46132, 64549, 748, 23, 1556, 142508, 10, 1238, 2758, 39029, 15757, 2396, 163612, 60075, 25755, 141, 135940, 135440, 297, 2460, 929, 191147, 8647, 202567, 28270, 15110, 133, 30624, 29223, 127, 19721, 759, 61924,...

[ 0.0755615234375, 0.1771240234375, 0.2418212890625, 0.2403564453125, 0.193603515625, 0.2041015625, 0.193359375, 0.187744140625, 0.04119873046875, 0.16015625, 0.2479248046875, 0.055328369140625, 0.0770263671875, 0.1212158203125, 0.16357421875, 0.01605224609375, 0.046722412109375, 0.1...

embed

49357344_c0

49357344

haskell

0

Title: Haskell String list to Int list Problem title: Haskell String list to Int list Tags: haskell Problem: Haskell String list to Int list I have a list of strings and I want to read the strings one by one and convert it into a list of ints, is there a way to convert each character into a new list? ["123","346","789"...

Haskell String list to Int list Haskell String list to Int list haskell Haskell Haskell String list to Int list I have a list of strings and I want to read the strings one by one and convert it into a list of ints, is there a way to convert each character into a new list?

[ -0.016845703125, -0.0032806396484375, 0.001556396484375, 0.011962890625, -0.020263671875, 0.0302734375, 0.0072021484375, -0.0152587890625, 0.005828857421875, 0.0177001953125, 0.000133514404296875, -0.03515625, -0.000823974609375, 0.02734375, -0.015380859375, -0.0181884765625, 0.01483...

[ 20625, 142508, 23351, 214, 5303, 47, 360, 18, 1556, 765, 79315, 3444, 12301, 1632, 390, 96760, 3934, 23, 933, 3917, 12638, 62816, 3525 ]

[ 0.1231689453125, 0.21484375, 0.2022705078125, 0.10748291015625, 0.2490234375, 0.08941650390625, 0.153076171875, 0.2042236328125, 0.11578369140625, 0.0050811767578125, 0.192138671875, 0.048370361328125, 0.1556396484375, 0.049835205078125, 0.01381683349609375, 0.1514892578125, 0.039855...

embed

30244831_c0

30244831

haskell

0

Title: Haskell – SPOJ – Code 'TEST' Problem title: Haskell – SPOJ – Code 'TEST' Tags: haskell Problem: Haskell – SPOJ – Code 'TEST' I am trying to solve the first SPOJ-problem in Haskell, but always end up having a parse error on input if . Is this a common problem? main = do input <- getLine if inp...

Haskell – SPOJ – Code 'TEST' Haskell – SPOJ – Code 'TEST' haskell Haskell SPOJ TEST Haskell – SPOJ – Code 'TEST' I am trying to solve the first SPOJ-problem in Haskell, but always end up having a parse error on input if . Is this a common problem?

[ -0.025634765625, 0.0157470703125, -0.003662109375, 0.0029449462890625, 0.0098876953125, 0.00174713134765625, 0.01611328125, -0.0017852783203125, -0.0025634765625, -0.033935546875, 0.00022792816162109375, -0.0032958984375, -0.0296630859375, 0.0162353515625, 0.0020751953125, 0.0297851562...

[ 20625, 142508, 140195, 1375, 28864, 3768, 618, 21828, 1556, 384, 46, 31577, 86869, 70, 5117, 38953, 1284, 11343, 3564, 1257, 19441, 366, 184, 18499, 98, 107730, 2174, 2071, 903, 39210, 2967 ]

[ 0.155029296875, 0.24951171875, 0.2069091796875, 0.2275390625, 0.182861328125, 0.09918212890625, 0.1885986328125, 0.230224609375, 0.1053466796875, 0.1776123046875, 0.001678466796875, 0.07196044921875, 0.108154296875, 0.00830078125, 0.0849609375, 0.1549072265625, 0.00732421875, 0.119...

embed

78565791_c1

78565791

haskell

1

>> ~/.vimrc WORKDIR /codegen COPY dhscanner.cabal dhscanner.cabal RUN cabal build --only-dependencies COPY dhscanner.ast dhscanner.ast COPY dhscanner.bitcode dhscanner.bitcode COPY src src RUN cabal build CMD ["cabal", "run"] Code signals: REPOSITORY, TAG, IMAGE, CREATED, SIZE, b29ba20efc6f, c63e806cc26b, b05d4d3d9cfa...

[ 0.00146484375, -0.0028839111328125, 0.004852294921875, 0.04638671875, 0.0108642578125, 0.021728515625, -0.0322265625, -0.004486083984375, -0.0126953125, -0.000682830810546875, 0.02783203125, -0.0079345703125, -0.00112152099609375, 0.015380859375, -0.0213623046875, -0.0106201171875, 0...

[ 6396, 6780, 64, 5, 29671, 19437, 231355, 123237, 248, 40899, 1409, 153003, 1723, 11450, 16275, 13857, 408, 3571, 130747, 109524, 45367, 191, 538, 105254, 13, 117538, 4438, 3137, 313, 44644, 16428, 58, 28864, 26073, 7, 12, 6, 165547, 84658, ...

[ 0.04541015625, 0.017120361328125, 0.040008544921875, 0.0216064453125, 0.15966796875, 0.2275390625, 0.19189453125, 0.2430419921875, 0.002288818359375, 0.19482421875, 0.2440185546875, 0.16015625, 0.1546630859375, 0.1112060546875, 0.1964111328125, 0.2181396484375, 0.125732421875, 0.26...

embed

19405778_c0

19405778

haskell

0

Title: How to add two lists in haskell? Problem title: How to add two lists in haskell? Tags: haskell Problem: How to add two lists in haskell? how can I add for example [1,2,3] to [5,4,6] to return [6,6,8] This is what I have so far: func1 :: [Int]->[Int]->[Int] func1 x y = [a+b|a<-x,b<-y] Should I try and remove the ...

How to add two lists in haskell? How to add two lists in haskell? haskell How func1 How to add two lists in haskell? how can I add for example [1,2,3] to [5,4,6] to return [6,6,8] This is what I have so far: Should I try and remove the elements that I don't want or is there a simpler way to do this?

[ -0.004241943359375, 0.01385498046875, 0.006317138671875, 0.01080322265625, -0.01251220703125, 0.0238037109375, -0.004058837890625, 0.004638671875, 0.01361083984375, -0.023193359375, 0.0224609375, -0.0135498046875, -0.000698089599609375, 0.0250244140625, 0.004638671875, -0.029052734375,...

[ 11249, 47, 15190, 6626, 5303, 7, 23, 1556, 142508, 7477, 418, 3642, 831, 27781, 68252, 155761, 758, 128191, 30646, 910, 151664, 2060, 9790, 87388, 80854, 2301, 18, 3444, 8781 ]

[ 0.09259033203125, 0.08380126953125, 0.182861328125, 0.19140625, 0.2470703125, 0.09930419921875, 0.0732421875, 0.16845703125, 0.2364501953125, 0.078125, 0.0259552001953125, 0.04107666015625, 0.0181121826171875, 0.0394287109375, 0.005126953125, 0.1839599609375, 0.07513427734375, 0.19...

embed

74540407_c0

74540407

haskell

0

Title: Getting a match type error while trying to find the sum of a number using the numbers in the number Problem title: Getting a match type error while trying to find the sum of a number using the numbers in the number Tags: haskell Problem: Getting a match type error while trying to find the sum of a number using t...

Getting a match type error while trying to find the sum of a number using the numbers in the number Getting a match type error while trying to find the sum of a number using the numbers in the number haskell the Getting Bool Couldn Char Expected Actual Getting a match type error while trying to find the sum of a number...

[ -0.0218505859375, 0.00689697265625, 0.00701904296875, 0.01458740234375, -0.0036468505859375, -0.0008544921875, -0.0213623046875, 0.00830078125, 0.0213623046875, 0.00118255615234375, 0.00946044921875, -0.032470703125, 0.0098876953125, 0.006927490234375, 0.01068115234375, -0.005126953125...

[ 210732, 14858, 10644, 18499, 12960, 31577, 7413, 10554, 14012, 17368, 101935, 23, 1556, 142508, 2460, 929, 191147, 19, 21656, 60075, 13, 100582, 13695, 20949, 98816, 6002, 86531, 45767, 26366, 86869, 40899, 4205, 11222, 152999, 1517, 73, 10557,...

[ 0.1376953125, 0.24072265625, 0.2308349609375, 0.205078125, 0.0625, 0.08489990234375, 0.058441162109375, 0.1678466796875, 0.1077880859375, 0.10150146484375, 0.1341552734375, 0.0675048828125, 0.1302490234375, 0.22900390625, 0.07861328125, 0.15966796875, 0.1466064453125, 0.09173583984...

embed

67461458_c1

67461458

haskell

1

one. addAllPops :: [City] -> [Int] -> [City] addAllPops [(w, ((x,y), z))] pops = [map uncurry addPop (zip pops z)] addPop :: City -> Int -> City addPop (w, ((x,y), z)) p = (w, ((x,y), p:z)) I've been stuck on this for an embarassingly long amount of time, any and all assistance is greatly appreciated :) Code signals: ...

[ 0.007171630859375, -0.004302978515625, -0.0004863739013671875, 0.0179443359375, -0.03662109375, 0.003997802734375, 0.0072021484375, -0.023681640625, 0.015869140625, -0.01324462890625, 0.03271484375, 0.007781982421875, 0.0179443359375, -0.0019989013671875, -0.0166015625, -0.02001953125,...

[ 1632, 15190, 43512, 127642, 7, 1984, 115411, 33079, 4153, 18, 434, 425, 53, 97, 7426, 2203, 62346, 64240, 50836, 6406, 360, 915, 12, 169, 2809, 179933, 98, 903, 82849, 38001, 4989, 756, 127557, 77947, 1094, 28864, 26073, 11249, 20625, 142...

[ 0.1402587890625, 0.1920166015625, 0.1671142578125, 0.265380859375, 0.1573486328125, 0.00494384765625, 0.1466064453125, 0.0151519775390625, 0.03070068359375, 0.0789794921875, 0.107177734375, 0.00079345703125, 0.051422119140625, 0.1068115234375, 0.22412109375, 0.042999267578125, 0.1208...

embed

18678944_c0

18678944

haskell

0

Title: Hello World for OpenGL+GLUT in Haskell not working on OSX Lion Problem title: Hello World for OpenGL+GLUT in Haskell not working on OSX Lion Tags: opengl, macos, haskell, glut Problem: Hello World for OpenGL+GLUT in Haskell not working on OSX Lion Code signals: Graphics.Rendering.OpenGL, Graphics.UI.GLUT, Hello,...

Hello World for OpenGL+GLUT in Haskell not working on OSX Lion Hello World for OpenGL+GLUT in Haskell not working on OSX Lion opengl macos haskell glut Graphics.Rendering.OpenGL Graphics.UI.GLUT Hello World OpenGL GLUT Haskell OSX Lion HelloWorld.hs HelloWorld Warning Fatal Error Hello World for OpenGL+GLUT in Haskell ...

[ -0.005035400390625, 0.0150146484375, -0.007415771484375, -0.0169677734375, 0.00131988525390625, -0.00023174285888671875, 0.0079345703125, -0.025634765625, -0.0181884765625, 0.0126953125, -0.014892578125, -0.055908203125, 0.003509521484375, -0.01129150390625, 0.005615234375, 0.001388549...

[ 35378, 6661, 100, 13527, 78703, 1328, 724, 143662, 23, 20625, 142508, 959, 20697, 98, 11787, 1542, 82209, 9803, 11016, 291, 7840, 1556, 167994, 189682, 33, 111747, 103264, 33457, 527, 70646, 127, 5550, 3036, 1803, 212059, 25632, 1528, 5974, ...

[ 0.2083740234375, 0.2144775390625, 0.057098388671875, 0.1453857421875, 0.2265625, 0.16162109375, 0.114990234375, 0.26953125, 0.0413818359375, 0.156982421875, 0.25830078125, 0.080322265625, 0.15625, 0.064208984375, 0.1385498046875, 0.087646484375, 0.2254638671875, 0.0972900390625, ...

embed

20523494_c0

20523494

haskell

0

Title: What does this function produce Problem title: What does this function produce Tags: haskell Problem: What does this function produce What is the type and the value of the expression: do [1,2,3]; "lambda" I tested it and found out that it just print lambda 3 times. But i don't understand why it does that. how ca...

What does this function produce What does this function produce haskell What What does this function produce What is the type and the value of the expression: I tested it and found out that it just print lambda 3 times. But i don't understand why it does that. how can i rewrite it using bind. It feels like it is necess...

[ -0.01483154296875, 0.0004749298095703125, -0.01373291015625, 0.0028839111328125, -0.0142822265625, 0.02099609375, 0.004791259765625, 0.015380859375, 0.000171661376953125, -0.0184326171875, -0.0157470703125, -0.04150390625, -0.00726318359375, 0.006866455078125, -0.018798828125, 0.018310...

[ 4865, 14602, 903, 32354, 27489, 1556, 142508, 10644, 136, 34292, 125195, 3034, 442, 1660, 28412, 21, 6492, 85, 138, 20028, 2301, 18, 28219, 15400, 456, 434, 18781, 17368, 68557, 12319, 63559 ]

[ 0.0914306640625, 0.14697265625, 0.1568603515625, 0.2474365234375, 0.244140625, 0.17626953125, 0.279052734375, 0.1781005859375, 0.00531005859375, 0.1337890625, 0.2335205078125, 0.1177978515625, 0.001953125, 0.06878662109375, 0.1932373046875, 0.086181640625, 0.2056884765625, 0.164794...

embed

15183324_c0

15183324

haskell

0

Title: What is the difference between pure and impure in haskell? Problem title: What is the difference between pure and impure in haskell? Tags: haskell, functional-programming Problem: What is the difference between pure and impure in haskell? What is the difference between pure and impure in haskell? When doing IO i...

What is the difference between pure and impure in haskell? What is the difference between pure and impure in haskell? haskell functional-programming What What is the difference between pure and impure in haskell? What is the difference between pure and impure in haskell? When doing IO in haskell, what does it mean to k...

[ -0.00183868408203125, 0.0074462890625, 0.0157470703125, 0.001678466796875, -0.008056640625, 0.0263671875, -0.0137939453125, -0.01019287109375, 0.005126953125, 0.025390625, 0.00445556640625, -0.034423828125, -0.00909423828125, 0.0225830078125, -0.00537109375, 0.027587890625, 0.0224609...

[ 60212, 17721, 34166, 136, 21980, 3408, 23, 1556, 142508, 123309, 28966, 4865, 83, 70, 17780, 29459, 13695, 55769, 84797 ]

[ 0.193603515625, 0.10211181640625, 0.2430419921875, 0.1224365234375, 0.1905517578125, 0.2222900390625, 0.0792236328125, 0.16552734375, 0.255859375, 0.1251220703125, 0.07244873046875, 0.011077880859375, 0.019775390625, 0.05731201171875, 0.1558837890625, 0.026092529296875, 0.07794189453...

embed

75525817_c0

75525817

haskell

0

Title: trying to find n in a list without using elem Problem title: trying to find n in a list without using elem Tags: haskell Problem: trying to find n in a list without using elem I am trying to find n in a list of integers, out should be true if n is present without using the elem function. present:: Integer -> [In...

trying to find n in a list without using elem trying to find n in a list without using elem haskell elem Integer Bool trying to find n in a list without using elem I am trying to find n in a list of integers, out should be true if n is present without using the elem function.

[ -0.0118408203125, -0.0024261474609375, 0.0162353515625, -0.0233154296875, -0.00055694580078125, 0.023681640625, 0.0113525390625, -0.01544189453125, -0.017333984375, -0.02685546875, 0.0155029296875, -0.0189208984375, -0.01495361328125, 0.002227783203125, -0.006500244140625, -0.011291503...

[ 31577, 7413, 653, 23, 5303, 15490, 17368, 88, 195, 47, 10, 1556, 142508, 44401, 2460, 929, 892, 26255, 1810, 5608, 29568, 2174, 13379, 32354 ]

[ 0.11334228515625, 0.1341552734375, 0.17626953125, 0.12188720703125, 0.21044921875, 0.12066650390625, 0.08172607421875, 0.09954833984375, 0.19189453125, 0.00791168212890625, 0.0261383056640625, 0.09698486328125, 0.18408203125, 0.15771484375, 0.08221435546875, 0.18896484375, 0.13220214...

embed

60614612_c0

60614612

haskell

0

Title: How to translate a list comprehension to a version using concatMap? Problem title: How to translate a list comprehension to a version using concatMap? Tags: haskell Problem: How to translate a list comprehension to a version using concatMap? How can I translate a list comprehension to a version that uses concatM...

How to translate a list comprehension to a version using concatMap? How to translate a list comprehension to a version using concatMap? haskell concatMap How How to translate a list comprehension to a version using concatMap? How can I translate a list comprehension to a version that uses concatMap instead?

[ -0.0064697265625, -0.004852294921875, 0.011962890625, -0.01275634765625, 0.00506591796875, 0.0036163330078125, -0.0164794921875, 0.0004673004150390625, 0.0013275146484375, -0.025146484375, -0.0184326171875, 0.0024566650390625, 0.017333984375, -0.005859375, -0.0257568359375, -0.00064468...

[ 11249, 3900, 19309, 5303, 46683, 3220, 6889, 47, 11389, 158, 4460, 166179, 17368, 1556, 142508, 4527 ]

[ 0.039764404296875, 0.12451171875, 0.1517333984375, 0.1494140625, 0.1270751953125, 0.1297607421875, 0.035552978515625, 0.065185546875, 0.147216796875, 0.11376953125, 0.19921875, 0.187255859375, 0.004547119140625, 0.0692138671875, 0.1688232421875, 0.012481689453125 ]

embed

34707983_c0

34707983

haskell

0

Title: Meaning of single colon in Haskell :t Problem title: Meaning of single colon in Haskell :t Tags: haskell Problem: Meaning of single colon in Haskell :t As far as I've been able to gather, the single colon in Haskell is used in list comprehension. Why then does it show up in the :t command? Also in the :quit comm...

Meaning of single colon in Haskell :t Meaning of single colon in Haskell :t haskell Meaning Haskell Meaning of single colon in Haskell :t As far as I've been able to gather, the single colon in Haskell is used in list comprehension. Why then does it show up in the :t command? Also in the :quit command? There isn't any ...

[ 0.01806640625, -0.005706787109375, 0.0000762939453125, 0.0263671875, -0.0004673004150390625, -0.00067901611328125, 0.00131988525390625, 0.0101318359375, 0.0023040771484375, -0.01416015625, 0.01019287109375, -0.041015625, 0.015625, 0.004302978515625, -0.038330078125, -0.00714111328125, ...

[ 1215, 11, 11001, 46512, 20625, 142508, 18, 23, 1556, 11814, 5303, 46683, 3220, 6889, 44084, 7639, 1257, 152, 75101, 3181 ]

[ 0.0716552734375, 0.0782470703125, 0.1912841796875, 0.25048828125, 0.1260986328125, 0.2216796875, 0.15185546875, 0.01251220703125, 0.115478515625, 0.10498046875, 0.143798828125, 0.09576416015625, 0.10400390625, 0.005645751953125, 0.008026123046875, 0.057647705078125, 0.018600463867187...

embed

17241320_c0

17241320

haskell

0

Title: Haskell more complex predicate Problem title: Haskell more complex predicate Tags: haskell Problem: Haskell more complex predicate I'm learning Haskell, and I'm wondering how to have a predicate that's a bit more complex. For example, I can do this: any ( >= 5 ) my_list But I can't find a way how to do something...

Haskell more complex predicate Haskell more complex predicate haskell Haskell my_list Haskell more complex predicate I'm learning Haskell, and I'm wondering how to have a predicate that's a bit more complex. For example, I can do this: But I can't find a way how to do something like this: How could I do this?

[ -0.01080322265625, 0.0181884765625, 0.01092529296875, -0.001617431640625, 0.0125732421875, 0.04052734375, 0.0167236328125, 0.002960205078125, 0.0225830078125, -0.04345703125, 0.0235595703125, -0.0361328125, 0.033447265625, 0.01190185546875, -0.012451171875, -0.0018310546875, -0.00915...

[ 20625, 142508, 1286, 27140, 1653, 2063, 1556, 759, 6562, 67, 52080, 149016, 3642, 47, 765, 10, 450, 4785, 27781, 831, 54, 903, 4966, 18, 7413, 3917, 9844, 1884, 11249, 5809 ]

[ 0.1424560546875, 0.207763671875, 0.1409912109375, 0.2264404296875, 0.18115234375, 0.2255859375, 0.150634765625, 0.12255859375, 0.2027587890625, 0.1324462890625, 0.0634765625, 0.05218505859375, 0.04583740234375, 0.010589599609375, 0.101318359375, 0.0144805908203125, 0.0214996337890625...

embed

27177667_c0

27177667

haskell

0

Title: Haskell split user input Problem title: Haskell split user input Tags: haskell Problem: Haskell split user input I want to take first three elements from user input in Haskell, but I got error message. Thank you for the help getCmd cmd = do putStrLn take 3 cmd main = do putStrLn "please type something" name <- g...

Haskell split user input Haskell split user input haskell Haskell QUIT Haskell split user input I want to take first three elements from user input in Haskell, but I got error message. Thank you for the help

[ -0.017822265625, 0.004974365234375, -0.00112152099609375, 0.0211181640625, -0.0111083984375, 0.017822265625, 0.002593994140625, 0.00015735626220703125, 0.01409912109375, -0.0264892578125, -0.002349853515625, -0.01129150390625, -0.00408935546875, -0.0081787109375, -0.008544921875, 0.002...

[ 20625, 142508, 65450, 38937, 107730, 1556, 142363, 618, 3444, 5646, 5117, 17262, 80854, 1295, 18499, 26008, 4358 ]

[ 0.1572265625, 0.259765625, 0.239013671875, 0.1788330078125, 0.23486328125, 0.131591796875, 0.16064453125, 0.1357421875, 0.0758056640625, 0.1258544921875, 0.1226806640625, 0.1617431640625, 0.187255859375, 0.09466552734375, 0.1591796875, 0.09326171875, 0.0333251953125 ]

embed

6964392_c2

6964392

haskell

2

, Python, Erlang, Haskell, euler12.bin, euler12.c, euler12.py, Downloads, pypy-c-jit-43780-b590cf6de419-linux64, euler12.erl, euler12, R13B03, erts-5.7.4, smp:4:4, rq:4, async-threads:0, kernel-poll:false, Eshell, V5.7.4, euler12.hs, euler12.hsx, Compiling, Main, euler12.o, Linking, MAXINT, stdio.h, math.h, python3.2, ...

[ -0.00970458984375, 0.0115966796875, 0.00823974609375, 0.0294189453125, 0.01165771484375, 0.00396728515625, -0.009765625, -0.0185546875, 0.00023651123046875, -0.00738525390625, 0.006622314453125, -0.03271484375, -0.00518798828125, -0.02197265625, 0.007354736328125, -0.00335693359375, ...

[ 6, 4, 145581, 1004, 3066, 20625, 142508, 1175, 603, 1530, 5, 7568, 238, 6493, 4857, 17198, 29676, 152719, 4836, 9, 116708, 112, 2947, 2397, 6077, 13307, 56, 141, 627, 2681, 571, 9513, 72, 933, 160355, 617, 2676, 12, 864, 12654, 39116, ...

[ 0.05078125, 0.111572265625, 0.318115234375, 0.17431640625, 0.32568359375, 0.169677734375, 0.317626953125, 0.1614990234375, 0.2474365234375, 0.227294921875, 0.0986328125, 0.2144775390625, 0.07568359375, 0.2432861328125, 0.2249755859375, 0.1114501953125, 0.18408203125, 0.095092773437...

embed

23863857_c0

23863857

haskell

0

Title: Convert myType to Int Problem title: Convert myType to Int Tags: casting, converters, haskell Problem: Convert myType to Int I have my type, which defined here: data Nat = Zero | Succ Nat deriving Show I want to defined function, that convert Nat to Int. Help please all my attempts are like this: toInt :: Nat ->...

Convert myType to Int Convert myType to Int casting converters haskell Convert Nat Zero Succ Show Convert myType to Int I have my type, which defined here: data Nat = Zero | Succ Nat deriving Show I want to defined function, that convert Nat to Int. Help please all my attempts are like this: and give not result

[ -0.0181884765625, -0.0037689208984375, 0.01116943359375, 0.01287841796875, -0.00933837890625, 0.01239013671875, 0.007415771484375, 0.0010528564453125, -0.005767822265625, -0.0277099609375, 0.00811767578125, -0.027099609375, -0.01104736328125, 0.0284423828125, 0.008544921875, -0.0000284...

[ 1657, 11549, 759, 196707, 47, 360, 18, 176050, 172127, 1556, 142508, 68875, 83947, 1832, 10060, 17367, 10644, 61924, 3688, 2053, 6, 16406, 6496, 3444, 32354, 96760, 39527, 22936, 81887, 1884, 959, 16750 ]

[ 0.04620361328125, 0.1573486328125, 0.197265625, 0.325927734375, 0.1202392578125, 0.1640625, 0.2049560546875, 0.1458740234375, 0.1927490234375, 0.0982666015625, 0.1956787109375, 0.2294921875, 0.1727294921875, 0.1295166015625, 0.144775390625, 0.1710205078125, 0.2440185546875, 0.13000...

embed

24004265_c0

24004265

haskell

0

Title: IO which is executed out of order Problem title: IO which is executed out of order Tags: haskell Problem: IO which is executed out of order I created simple program. Take some input and repeat it but...IO is executed out of order. What can I do with it? main = putStr "Plese write some characters: " >> getLine >>...

IO which is executed out of order IO which is executed out of order haskell Plese You Bye IO which is executed out of order I created simple program. Take some input and repeat it but...IO is executed out of order. What can I do with it?

[ -0.001922607421875, 0.003082275390625, -0.01055908203125, 0.012451171875, 0.0069580078125, 0.0150146484375, 0.0111083984375, -0.000186920166015625, 0.007049560546875, 0.003997802734375, 0.00592041015625, -0.0152587890625, -0.00116729736328125, 0.0057373046875, 0.00836181640625, 0.00787...

[ 17780, 3129, 83, 71924, 297, 1810, 111, 12989, 1556, 142508, 19434, 184, 2583, 3311, 13, 87, 75935, 8781, 1528, 46673, 3060, 107730, 119140, 442, 1284, 27, 4865, 831, 54, 678 ]

[ 0.27978515625, 0.1099853515625, 0.1142578125, 0.2020263671875, 0.10284423828125, 0.187255859375, 0.2017822265625, 0.2244873046875, 0.1448974609375, 0.2330322265625, 0.1778564453125, 0.1407470703125, 0.154541015625, 0.137939453125, 0.076416015625, 0.0513916015625, 0.10662841796875, ...

embed

55295816_c0

55295816

haskell

0

Title: Haskell why using @ (as) Problem title: Haskell why using @ (as) Tags: pattern-matching, haskell Problem: Haskell why using @ (as) Came across this example: buildEntry ws@(w:_) = (w, length ws) What's the advantage of using ws@(w:_) instead of: buildEntry' (w:ws) = (w, length (w:ws)) Since I am only a beginner, ...

Haskell why using @ (as) Haskell why using @ (as) pattern-matching haskell @ Haskell w:_ w:ws Haskell why using @ (as) Came across this example: What's the advantage of using ws@(w:_) instead of: Since I am only a beginner, I think readability of the second example is also better.

[ -0.020751953125, 0.0159912109375, -0.005584716796875, -0.0174560546875, -0.004791259765625, -0.002349853515625, -0.0057373046875, 0.004425048828125, 0.0213623046875, -0.0211181640625, 0.03173828125, -0.0023956298828125, 0.02099609375, 0.0113525390625, 0.001861572265625, 0.0055541992187...

[ 20625, 142508, 15400, 17368, 1374, 162, 103510, 98753, 214, 1556, 148, 12, 19725, 27781, 92940, 7, 981, 434, 454, 64457, 9842, 1679, 5351, 12301, 41159, 17932, 11522 ]

[ 0.154541015625, 0.221923828125, 0.13427734375, 0.1192626953125, 0.18359375, 0.1812744140625, 0.1551513671875, 0.1690673828125, 0.001617431640625, 0.160888671875, 0.09747314453125, 0.08551025390625, 0.11572265625, 0.1004638671875, 0.1417236328125, 0.06884765625, 0.1463623046875, 0.1...

embed

12876384_c0

12876384

haskell

0

Title: Grouping a list into lists of n elements in Haskell Problem title: Grouping a list into lists of n elements in Haskell Tags: haskell, list Problem: Grouping a list into lists of n elements in Haskell Is there an operation on lists in library that makes groups of n elements? For example: n=3 groupInto 3 [1,2,3,4,...

Grouping a list into lists of n elements in Haskell Grouping a list into lists of n elements in Haskell haskell list Grouping Haskell Grouping a list into lists of n elements in Haskell Is there an operation on lists in library that makes groups of n elements? For example: n=3 If not, how do I do it?

[ -0.007568359375, 0.006195068359375, 0.0167236328125, -0.011962890625, -0.01007080078125, 0.0223388671875, -0.01153564453125, -0.020263671875, 0.0155029296875, 0.002410888671875, -0.006622314453125, -0.03173828125, 0.00860595703125, -0.003875732421875, -0.024169921875, 0.004058837890625...

[ 10760, 214, 5303, 3934, 7, 111, 653, 80854, 20625, 142508, 23, 1556, 2071, 2685, 142, 41018, 98, 35773, 1294, 450, 30482, 94407, 27781, 76067, 959, 3642, 54 ]

[ 0.2496337890625, 0.0335693359375, 0.2176513671875, 0.1689453125, 0.09381103515625, 0.109375, 0.21044921875, 0.220947265625, 0.1480712890625, 0.2269287109375, 0.0418701171875, 0.1363525390625, 0.010162353515625, 0.048614501953125, 0.04608154296875, 0.18359375, 0.071044921875, 0.1606...

embed

2469139_c0

2469139

haskell

0

Title: Equivalent of python eval in Haskell Problem title: Equivalent of python eval in Haskell Tags: python, haskell, eval, metaprogramming Problem: Equivalent of python eval in Haskell There is function in python called eval that takes string input and evaluates it. >>> x = 1 >>> print eval('x+1') 2 >>> print eval('1...

Equivalent of python eval in Haskell Equivalent of python eval in Haskell python haskell eval metaprogramming Equivalent Haskell Equivalent of python eval in Haskell There is function in python called eval that takes string input and evaluates it. What is Haskell equivalent of eval function?

[ -0.0023345947265625, 0.0135498046875, 0.00775146484375, 0.0191650390625, 0.007049560546875, 0.00531005859375, 0.0186767578125, -0.0142822265625, -0.000225067138671875, -0.04443359375, -0.005584716796875, -0.01446533203125, 0.018310546875, 0.00092315673828125, -0.0081787109375, -0.00457...

[ 145666, 85540, 17198, 50828, 28, 1405, 23, 20625, 142508, 111, 1556, 23550, 28966, 32354, 35839, 51776, 79315, 107730, 136, 151575, 442, 4865, 83, 183234 ]

[ 0.096923828125, 0.1805419921875, 0.1097412109375, 0.1527099609375, 0.1297607421875, 0.281005859375, 0.04046630859375, 0.1444091796875, 0.2449951171875, 0.0513916015625, 0.1326904296875, 0.126220703125, 0.12255859375, 0.17529296875, 0.039764404296875, 0.130859375, 0.1884765625, 0.17...

embed

11015395_c0

11015395

haskell

0

Title: Find out what flags we are building with in Setup.hs Problem title: Find out what flags we are building with in Setup.hs Tags: cabal, haskell Problem: Find out what flags we are building with in Setup.hs I need to find out what flags (the type found in cabal files) are being built with in Setup.hs. I think I'm l...

Find out what flags we are building with in Setup.hs Find out what flags we are building with in Setup.hs cabal haskell Find Setup.hs Find out what flags we are building with in Setup.hs I need to find out what flags (the type found in cabal files) are being built with in Setup.hs. I think I'm looking for something wit...

[ 0.00714111328125, -0.01068115234375, 0.01300048828125, 0.003570556640625, -0.006103515625, 0.005828857421875, -0.0264892578125, 0.009765625, 0.000514984130859375, 0.01287841796875, -0.01287841796875, -0.049560546875, 0.001983642578125, -0.00909423828125, -0.000560760498046875, 0.040527...

[ 26040, 1810, 2367, 49938, 7, 642, 621, 33976, 678, 19943, 2037, 127, 109524, 1556, 142508, 23, 3871, 7413, 10644, 14037, 102158, 8035, 88303, 16487, 125726, 19659, 31304, 674, 2046 ]

[ 0.09881591796875, 0.0633544921875, 0.05816650390625, 0.251953125, 0.12646484375, 0.039947509765625, 0.0251312255859375, 0.1279296875, 0.1220703125, 0.17919921875, 0.1553955078125, 0.1168212890625, 0.2210693359375, 0.1036376953125, 0.1708984375, 0.03216552734375, 0.044403076171875, ...

embed

35381853_c1

35381853

haskell

1

n -> do { str <- rstr n; text ("boo:" <> str <> "!") }’ In a stmt of a 'do' block: get ("data" <//> var) $ \ n -> do { str <- rstr n; text ("boo:" <> str <> "!") } How can I use my IO -driven random string function inside the Spock get request handler? Code signals: System.Random, Data.Monoid, Data.Text, Lib, Web.Spoc...

[ -0.017578125, -0.00750732421875, -0.004486083984375, -0.0045166015625, 0.00016498565673828125, 0.02587890625, 0.0225830078125, -0.0260009765625, 0.01177978515625, -0.056640625, 0.0201416015625, -0.00970458984375, -0.0205078125, -0.00799560546875, 0.0003204345703125, 0.01043701171875, ...

[ 653, 33079, 54, 7704, 9, 1690, 9297, 74, 7986, 54487, 12, 3890, 26, 360, 6138, 39, 18, 111, 246, 46389, 2046, 10135, 20767, 285, 3650, 11249, 831, 87, 4527, 759, 17780, 33926, 96759, 79315, 32354, 46132, 23172, 2594, 50336, 35863, 28864...

[ 0.10205078125, 0.1351318359375, 0.1453857421875, 0.201904296875, 0.0299072265625, 0.006072998046875, 0.162353515625, 0.01361083984375, 0.1473388671875, 0.168212890625, 0.0860595703125, 0.1436767578125, 0.01177978515625, 0.041015625, 0.1082763671875, 0.070556640625, 0.1375732421875, ...

embed

25028248_c0

25028248

haskell

0

Title: Creating a `newtype Maybe a` Problem title: Creating a `newtype Maybe a` Tags: haskell, newtype Problem: Creating a `newtype Maybe a` I created a newtype for Maybe Int : Prelude> newtype MaybeTuple = MaybeTuple { getMaybe :: Maybe Int} Prelude> let m = MaybeTuple (Just 5) Prelude> getMaybe m Just 5 But how can I...

Creating a `newtype Maybe a` Creating a `newtype Maybe a` haskell newtype Creating Maybe Prelude MaybeTuple Just Creating a `newtype Maybe a` I created a newtype for Maybe Int : But how can I create a generic newtype of Maybe a ?

[ -0.005828857421875, 0.00543212890625, 0.0218505859375, 0.0157470703125, 0.013427734375, 0.0172119140625, 0.00994873046875, -0.003631591796875, 0.005767822265625, -0.0130615234375, -0.00909423828125, 0.0032196044921875, -0.004180908203125, 0.00494384765625, -0.003997802734375, -0.012573...

[ 56781, 1916, 54936, 50986, 83425, 10, 1556, 142508, 3525, 1914, 822, 112, 15665, 8705, 9563, 75935, 360, 18, 3642, 831, 28282, 189534, 111 ]

[ 0.1357421875, 0.06085205078125, 0.1260986328125, 0.305908203125, 0.2269287109375, 0.183349609375, 0.0938720703125, 0.19580078125, 0.150146484375, 0.031829833984375, 0.1328125, 0.0211944580078125, 0.04779052734375, 0.12109375, 0.0152130126953125, 0.11932373046875, 0.06512451171875, ...

embed

50766321_c0

50766321

haskell

0

Title: Writing a function to construct a list of descending natural numbers in Haskell Problem title: Writing a function to construct a list of descending natural numbers in Haskell Tags: haskell Problem: Writing a function to construct a list of descending natural numbers in Haskell Code signals: Writing, Haskell, fib...

Writing a function to construct a list of descending natural numbers in Haskell Writing a function to construct a list of descending natural numbers in Haskell haskell Writing Haskell fibonacci.hs:9:22 Couldn Expected Actual n:fibList prev_term twice_prev_term prior_fib_list Writing a function to construct a list of de...

[ 0.0184326171875, 0.01470947265625, -0.0177001953125, 0.018798828125, -0.00830078125, 0.0014801025390625, -0.00885009765625, 0.0146484375, 0.0252685546875, -0.0062255859375, 0.017578125, -0.035888671875, 0.0234375, 0.0155029296875, 0.005859375, 0.01458740234375, 0.029541015625, 0.00...

[ 213185, 32354, 64549, 5303, 60887, 214, 6083, 101935, 20625, 142508, 47, 1556, 809, 20990, 52544, 127, 1126, 24070, 191147, 60075, 13, 89829, 100582, 653, 1029, 275, 154663, 28468, 32166, 186351, 4692, 334, 41928, 6562, 23, 28007, 31577, 720,...

[ 0.1705322265625, 0.198486328125, 0.2059326171875, 0.190185546875, 0.2186279296875, 0.1005859375, 0.190185546875, 0.1668701171875, 0.159912109375, 0.263671875, 0.0130615234375, 0.1390380859375, 0.09832763671875, 0.150390625, 0.150390625, 0.05462646484375, 0.1177978515625, 0.12023925...

embed

36558397_c0

36558397

haskell

0

Title: Cabal testsuite - How can I pass a flag? Problem title: Cabal testsuite - How can I pass a flag? Tags: haskell, htf, cabal Problem: Cabal testsuite - How can I pass a flag? I use cabal with test-suites. The processor I use (HTF) allows flags (e.g. --quiet ). How can I add such flags in the cabal file in order to...

Cabal testsuite - How can I pass a flag? Cabal testsuite - How can I pass a flag? haskell htf cabal Cabal How Cabal testsuite - How can I pass a flag? I use cabal with test-suites. The processor I use (HTF) allows flags (e.g. --quiet ). How can I add such flags in the cabal file in order to be passed automatically to t...

[ 0.012939453125, 0.0033416748046875, 0.004608154296875, -0.01177978515625, -0.0177001953125, -0.0303955078125, 0.0013427734375, 0.0098876953125, -0.0086669921875, 0.0014801025390625, -0.001312255859375, -0.0135498046875, -0.029052734375, 0.01904296875, -0.017333984375, 0.006256103515625...

[ 30438, 289, 3034, 68879, 13, 11249, 831, 87, 27875, 10, 49938, 1556, 142508, 9703, 420, 109524, 4527, 678, 14543, 42, 18544, 919, 114864, 4210, 3181, 126, 15190, 6044, 11435, 115081, 191082, 14947, 1528, 71924 ]

[ 0.1689453125, 0.1708984375, 0.1959228515625, 0.2091064453125, 0.1156005859375, 0.094970703125, 0.07666015625, 0.054443359375, 0.1815185546875, 0.06494140625, 0.273193359375, 0.0869140625, 0.1756591796875, 0.06195068359375, 0.11083984375, 0.242431640625, 0.039794921875, 0.0225677490...

embed

18084265_c0

18084265

haskell

0

Title: Cabal - Expose all modules while building library Problem title: Cabal - Expose all modules while building library Tags: cabal, haskell Problem: Cabal - Expose all modules while building library Is it possible to tell Cabal to expose all modules while building a library? Right now I have to provide very long lis...

Cabal - Expose all modules while building library Cabal - Expose all modules while building library cabal haskell Cabal Expose Cabal - Expose all modules while building library Is it possible to tell Cabal to expose all modules while building a library? Right now I have to provide very long list of modules in the expos...

[ 0.014404296875, -0.004425048828125, -0.006622314453125, 0.024658203125, 0.0062255859375, 0.0084228515625, -0.01611328125, 0.01080322265625, 0.0130615234375, 0.01019287109375, 0.002044677734375, -0.040771484375, 0.03076171875, 0.00897216796875, -0.01470947265625, -0.0128173828125, 0.0...

[ 30438, 289, 45434, 184, 756, 88996, 7, 12960, 33976, 35773, 1294, 109524, 1556, 142508, 442, 7722, 47, 14192, 172554, 22691, 4552, 4989, 5303, 71, 83279, 59994, 11435 ]

[ 0.1859130859375, 0.1915283203125, 0.160400390625, 0.086669921875, 0.139892578125, 0.23779296875, 0.035919189453125, 0.0804443359375, 0.155517578125, 0.177734375, 0.1138916015625, 0.2117919921875, 0.061370849609375, 0.1700439453125, 0.00543212890625, 0.10546875, 0.0391845703125, 0.1...

embed

23172689_c0

23172689

haskell

0

Title: Haskell IO error handling during IO operation Problem title: Haskell IO error handling during IO operation Tags: io, error-handling, haskell Problem: Haskell IO error handling during IO operation Code signals: isPermissionError, isDoesNotExistError, Control.Exception, NoMethodError, a, Haskell, System.Directory,...

Haskell IO error handling during IO operation Haskell IO error handling during IO operation io error-handling haskell isPermissionError isDoesNotExistError Control.Exception NoMethodError a Haskell System.Directory Left Right Exception Note NestedAtomically Defined Control.Exception.Base NonTermination Haskell IO error...

[ -0.0086669921875, 0.0189208984375, 0.0125732421875, -0.011474609375, 0.004974365234375, 0.00946044921875, -0.017333984375, -0.01361083984375, -0.0020599365234375, -0.00836181640625, 0.01123046875, -0.049072265625, 0.014404296875, 0.01019287109375, 0.00124359130859375, 0.0081787109375, ...

[ 20625, 142508, 17780, 18499, 45064, 20271, 41018, 22995, 54885, 1556, 83, 15277, 21150, 18468, 31611, 8331, 90, 122116, 19279, 1419, 27131, 63928, 438, 78572, 7352, 12353, 184911, 30675, 2480, 90911, 5443, 18622, 28701, 12078, 262, 5983, 63473,...

[ 0.1580810546875, 0.2447509765625, 0.2476806640625, 0.253662109375, 0.179931640625, 0.12841796875, 0.151123046875, 0.2430419921875, 0.161865234375, 0.146728515625, 0.149169921875, 0.2149658203125, 0.187744140625, 0.120361328125, 0.1177978515625, 0.0704345703125, 0.082275390625, 0.15...

embed

74681958_c0

74681958

haskell

0

Title: Monads in Haskell Problem title: Monads in Haskell Tags: haskell, monads Problem: Monads in Haskell I'm new to Monads and was trying to write an add function and I'm unsure why this doesn't work. When using monads, is there a specific way you need to return a value? monadd :: (Monad m, Num b) => m b -> m b -> m ...

Monads in Haskell Monads in Haskell haskell monads Monads Haskell Monad Num Monads in Haskell I'm new to Monads and was trying to write an add function and I'm unsure why this doesn't work. When using monads, is there a specific way you need to return a value?

[ -0.0179443359375, 0.00836181640625, 0.007354736328125, 0.005340576171875, 0.01348876953125, 0.0230712890625, -0.00180816650390625, -0.0084228515625, 0.00982666015625, -0.046630859375, 0.0184326171875, -0.02734375, 0.00147247314453125, 0.001373291015625, 0.0172119140625, -0.024536132812...

[ 60331, 6468, 23, 20625, 142508, 1556, 2667, 712, 71, 52782, 3525, 31577, 33022, 15190, 32354, 51646, 15400, 22027, 18, 4488, 17368, 7, 29458, 3917, 3871, 30646, 34292 ]

[ 0.230712890625, 0.1781005859375, 0.0386962890625, 0.1343994140625, 0.241455078125, 0.09869384765625, 0.1495361328125, 0.1888427734375, 0.0963134765625, 0.180419921875, 0.041290283203125, 0.036712646484375, 0.07684326171875, 0.1612548828125, 0.17236328125, 0.03271484375, 0.05136108398...

embed

56482798_c2

56482798

haskell

2

MultiParamTypeClasses, StandaloneDeriving, TypeApplications, Control.Category.Hask, Hask, Data.Foldable, Ord, RMS, RelationMS, IdRMS, Map, Set, Show, Category, Object, mp2, mp1, M.null, M.empty, M.foldrWithKey, M.insert, S.foldr, acc2, M.lookup, Nothing, Just, S.union, S.empty, Semigroup, M.insertWith, Monoid, Functor...

[ -0.0264892578125, -0.003265380859375, -0.01361083984375, -0.01324462890625, 0.010498046875, 0.007232666015625, -0.004974365234375, -0.0272216796875, 0.0185546875, -0.029296875, -0.01226806640625, 0.005584716796875, 0.0021820068359375, 0.02197265625, -0.0113525390625, -0.01263427734375,...

[ 19335, 55292, 39, 196707, 140803, 90, 4, 32487, 51684, 47731, 14, 6496, 60457, 47677, 182867, 27131, 76775, 3081, 6495, 1042, 1391, 11809, 5, 919, 18345, 2886, 35379, 12174, 294, 116822, 13439, 24799, 25656, 42719, 19943, 17367, 49057, 134549...

[ 0.1800537109375, 0.1820068359375, 0.0789794921875, 0.231201171875, 0.238525390625, 0.053558349609375, 0.045562744140625, 0.1143798828125, 0.1658935546875, 0.1304931640625, 0.048858642578125, 0.0953369140625, 0.2403564453125, 0.1651611328125, 0.2041015625, 0.24658203125, 0.1201171875,...

embed

20051169_c0

20051169

haskell

0

Title: Removing file in haskell Problem title: Removing file in haskell Tags: windows, haskell Problem: Removing file in haskell I am trying to delete a text file in haskell while working in winhugs with help of removeFile function.But it is giving an error that Program error: price.txt: Directory.removeFile: permissio...

Removing file in haskell Removing file in haskell windows haskell Removing Program price.txt Directory.removeFile Removing file in haskell I am trying to delete a text file in haskell while working in winhugs with help of removeFile function.But it is giving an error that What can be the reason?

[ 0.0247802734375, 0.01055908203125, 0.013671875, 0.0107421875, -0.00110626220703125, -0.00714111328125, -0.0137939453125, 0.003692626953125, -0.0096435546875, -0.0115966796875, -0.00311279296875, -0.00180816650390625, 0.00482177734375, -0.007293701171875, 0.00384521484375, -0.0020904541...

[ 853, 432, 6496, 11435, 23, 1556, 142508, 54825, 7663, 27167, 124326, 31068, 26973, 272, 174350, 31577, 154109, 7986, 20697, 19916, 85030, 7, 87388, 32354, 68772, 18499, 831, 31635 ]

[ 0.007045745849609375, 0.12005615234375, 0.061279296875, 0.1580810546875, 0.06475830078125, 0.1387939453125, 0.2269287109375, 0.09710693359375, 0.1083984375, 0.1900634765625, 0.168212890625, 0.07135009765625, 0.06597900390625, 0.09130859375, 0.1982421875, 0.055389404296875, 0.17346191...

embed

72721698_c0

72721698

haskell

0

Title: Haskell warning Problem title: Haskell warning Tags: haskell, warnings Problem: Haskell warning I have written the code (I'm new to haskell, very new) and can't solve the warning. problem: funk :: Num a => a -> a funk a = a + 10 main :: IO() main = print (funk 10 ) Warning: Warnings: 1 Code signals: a, Haskell, ...

Haskell warning Haskell warning haskell warnings a Haskell Num Warnings Desktop qqq.hs Warning Defaulting Integer Show qqq.hs:4:8-23 qqq.hs:4:15-21 Haskell warning I have written the code (I'm new to haskell, very new) and can't solve the warning. problem: Warning:

[ -0.01348876953125, -0.01116943359375, 0.0021514892578125, 0.004852294921875, -0.0048828125, 0.01312255859375, -0.030517578125, -0.028076171875, 0.002960205078125, -0.0098876953125, -0.0322265625, -0.03076171875, -0.007080078125, 0.003082275390625, -0.00408935546875, -0.01416015625, 0...

[ 20625, 142508, 1631, 592, 1556, 6977, 10, 52782, 5550, 141423, 8096, 38656, 127, 262, 1021, 202, 1916, 44401, 17367, 617, 1019, 37620, 12221, 24589, 87, 765, 59121, 18151, 39, 3525, 47, 4552, 831, 18, 86869, 2967, 12 ]

[ 0.1605224609375, 0.25732421875, 0.1998291015625, 0.1541748046875, 0.16455078125, 0.0733642578125, 0.0267181396484375, 0.162353515625, 0.208251953125, 0.212890625, 0.073974609375, 0.173095703125, 0.089599609375, 0.1492919921875, 0.1859130859375, 0.123779296875, 0.0655517578125, 0.20...

embed

19843589_c0

19843589

haskell

0

Title: Binary map in Haskell Problem title: Binary map in Haskell Tags: haskell Problem: Binary map in Haskell Is there a two-operand equivalent to map built into Haskell with a type signature of: map2 :: (a -> b -> c) -> [a] -> [b] -> [c] The following equivalence should hold: map2 operator as bs === [operator a b | (...

Binary map in Haskell Binary map in Haskell haskell Binary Haskell map2 Binary map in Haskell Is there a two-operand equivalent to map built into Haskell with a type signature of: The following equivalence should hold: Example:

[ 0.00830078125, 0.003143310546875, 0.0087890625, 0.00775146484375, 0.00390625, 0.031494140625, -0.01953125, 0.000682830810546875, 0.023193359375, 0.000759124755859375, 0.001983642578125, -0.017333984375, 0.0191650390625, 0.011474609375, -0.00153350830078125, 0.0027008056640625, -0.022...

[ 54092, 1294, 22288, 23, 20625, 142508, 1556, 304, 2071, 2685, 10, 6626, 21473, 2208, 183234, 88303, 3934, 678, 10644, 138256, 111, 25632, 224743, 3956, 5608, 16401, 89536, 8705 ]

[ 0.183837890625, 0.0821533203125, 0.2149658203125, 0.061798095703125, 0.137451171875, 0.24169921875, 0.10858154296875, 0.08685302734375, 0.019317626953125, 0.055877685546875, 0.0290374755859375, 0.16455078125, 0.1597900390625, 0.138671875, 0.187744140625, 0.11962890625, 0.099365234375...

embed

47076850_c0

47076850

haskell

0

Title: Haskell, create "multi-type" list Problem title: Haskell, create "multi-type" list Tags: haskell, types Problem: Haskell, create "multi-type" list Is there a way to make haskell type this expression? ls = [4, 3.2, True, "home"] It's a challenge a friend gived to me, but no ideas come around, ...

Haskell, create "multi-type" list Haskell, create "multi-type" list haskell types Haskell Haskell, create "multi-type" list Is there a way to make haskell type this expression? It's a challenge a friend gived to me, but no ideas come around, also didn't tell me if that is possible, so maybe I'm wast...

[ -0.005462646484375, 0.01171875, 0.010009765625, 0.00119781494140625, 0.005340576171875, 0.0079345703125, -0.01348876953125, -0.0002536773681640625, 0.00098419189453125, -0.0133056640625, -0.006134033203125, -0.05078125, 0.0216064453125, -0.001190185546875, -0.0296630859375, 0.015258789...

[ 20625, 142508, 28282, 144227, 50986, 5303, 1556, 52895, 9, 2071, 2685, 10, 3917, 47, 3249, 10644, 903, 125195, 66801, 34391, 8337, 110, 25647, 10932, 7722, 51139, 509, 1916, 33757, 1733 ]

[ 0.1356201171875, 0.222900390625, 0.11669921875, 0.2137451171875, 0.276123046875, 0.218017578125, 0.123291015625, 0.19482421875, 0.031829833984375, 0.008087158203125, 0.047393798828125, 0.05126953125, 0.1036376953125, 0.055999755859375, 0.090087890625, 0.253173828125, 0.11083984375, ...

embed

36181493_c2

36181493

haskell

2

Entero, AritVar, Avar, BoolVar, Bvar, Aexpr, Sum, Mult, Rest, Bexpr, Verdadero, Falso, Iguales, Distintos, MayorOigual, MenorOigual, Mayor, Menor, Entonces, Sii, Stm, AssA, AssB, Skip, Comp, Mientras, Repetir, Otros, Enteros, Monoid, Data.Set, TEMA, Comparando, Num, Aexp, Bexp, Los, Haskell, Faltan, State, Astate, Def...

[ -0.0006103515625, -0.005889892578125, 0.00799560546875, 0.0198974609375, 0.02197265625, 0.0172119140625, -0.01483154296875, 0.0054931640625, 0.00162506103515625, 0.039306640625, -0.0025634765625, 0.016357421875, 0.00946044921875, -0.00299072265625, -0.0019378662109375, 0.0169677734375,...

[ 60816, 31, 4, 62, 2783, 81827, 1961, 2460, 929, 335, 83613, 42, 36335, 81212, 49756, 1446, 16018, 516, 22225, 991, 141096, 90, 803, 12729, 1952, 104610, 670, 108352, 1111, 748, 189681, 602, 14, 2907, 39, 1301, 284, 571, 91958, 15612, 15...

[ 0.25732421875, 0.252685546875, 0.1458740234375, 0.0877685546875, 0.1724853515625, 0.296630859375, 0.246337890625, 0.036895751953125, 0.117919921875, 0.019439697265625, 0.2081298828125, 0.167724609375, 0.224853515625, 0.2135009765625, 0.195068359375, 0.1290283203125, 0.1693115234375, ...

embed

9371530_c0

9371530

haskell

0

Title: Tree Fold operation? Problem title: Tree Fold operation? Tags: fold, haskell, tree Problem: Tree Fold operation? I am taking a class in Haskell, and we need to define the fold operation for a tree defined by: data Tree a = Lf a | Br (Tree a) (Tree a) I can not seem to find any information on the "tfold" operatio...

Tree Fold operation? Tree Fold operation? fold haskell tree Tree Fold Tree Fold operation? I am taking a class in Haskell, and we need to define the fold operation for a tree defined by: I can not seem to find any information on the "tfold" operation or really what it supposed to do. Any help would be greatly appreciat...

[ 0.01806640625, 0.0084228515625, 0.000035762786865234375, -0.031494140625, 0.0157470703125, 0.0015869140625, -0.025146484375, -0.0137939453125, -0.0096435546875, -0.02880859375, 0.000423431396484375, -0.042236328125, 0.005035400390625, 0.024658203125, -0.00164794921875, -0.0008163452148...

[ 101344, 30077, 71, 41018, 32, 42822, 1556, 142508, 53201, 35971, 18507, 23, 20625, 3871, 61924, 70, 6, 100, 390, 4677, 18, 58, 6183, 2367, 134598, 54, 4358, 77947 ]

[ 0.2286376953125, 0.2132568359375, 0.1474609375, 0.2052001953125, 0.032501220703125, 0.25439453125, 0.1090087890625, 0.2100830078125, 0.21435546875, 0.00433349609375, 0.08160400390625, 0.008087158203125, 0.09674072265625, 0.00982666015625, 0.1204833984375, 0.03875732421875, 0.00842285...

embed

33457356_c0

33457356

haskell

0

Title: In haskell. how to solve splitList into a tuple Problem title: In haskell. how to solve splitList into a tuple Tags: haskell, tuples Problem: In haskell. how to solve splitList into a tuple splitList n xs : splits a list xs in to a tuple of two lists based on the provided index n . Examples: splitList 3 [1..5] ⇒...

In haskell. how to solve splitList into a tuple In haskell. how to solve splitList into a tuple haskell tuples In haskell. how to solve splitList into a tuple splitList n xs : splits a list xs in to a tuple of two lists based on the provided index n . Examples: How do I solve it ?

[ 0.000148773193359375, -0.006317138671875, -0.004119873046875, 0.00139617919921875, -0.0255126953125, 0.009765625, 0.002899169921875, -0.00018787384033203125, 0.01483154296875, -0.00286865234375, 0.014892578125, -0.0267333984375, -0.01214599609375, 0.03759765625, -0.003204345703125, 0.0...

[ 1556, 142508, 3642, 86869, 65450, 154663, 3934, 10, 370, 8705, 360, 99726, 47, 653, 1022, 7, 5303, 23, 111, 6626, 35509, 62952, 63262, 89536, 11249, 442 ]

[ 0.1390380859375, 0.1717529296875, 0.048675537109375, 0.1934814453125, 0.2332763671875, 0.23388671875, 0.10498046875, 0.04669189453125, 0.1373291015625, 0.2103271484375, 0.03857421875, 0.175048828125, 0.095947265625, 0.0450439453125, 0.1112060546875, 0.0823974609375, 0.165283203125, ...

embed

14242977_c0

14242977

haskell

0

Title: What exactly does cabal install --avoid-reinstalls do? Problem title: What exactly does cabal install --avoid-reinstalls do? Tags: cabal, cabal-install, haskell Problem: What exactly does cabal install --avoid-reinstalls do? I've found --avoid-reinstalls makes packages build where otherwise cabal fails. What exa...

What exactly does cabal install --avoid-reinstalls do? What exactly does cabal install --avoid-reinstalls do? cabal cabal-install haskell What What exactly does cabal install --avoid-reinstalls do? I've found --avoid-reinstalls makes packages build where otherwise cabal fails. What exactly is it doing? Doesn't cabal al...

[ 0.006317138671875, -0.01080322265625, 0.0274658203125, 0.015869140625, -0.0260009765625, 0.0108642578125, -0.00445556640625, 0.0115966796875, 0.0021514892578125, 0.0390625, 0.01483154296875, -0.01324462890625, -0.0123291015625, 0.0162353515625, -0.017822265625, 0.00933837890625, 0.00...

[ 4865, 66161, 14602, 109524, 20600, 4210, 14426, 532, 107, 80383, 7, 54, 9, 1556, 142508, 30482, 98169, 45367, 120262, 35782, 83, 442, 20594, 21771, 9790, 71864, 456 ]

[ 0.05908203125, 0.0908203125, 0.052764892578125, 0.2470703125, 0.1942138671875, 0.0684814453125, 0.1666259765625, 0.15478515625, 0.1298828125, 0.21923828125, 0.07489013671875, 0.08172607421875, 0.003662109375, 0.1290283203125, 0.218017578125, 0.0650634765625, 0.153564453125, 0.09802...

embed

50177982_c1

50177982

haskell

1

then [] else [y] addi' :: ([a],[a]) -> [a] addi' ([],[]) = [] addi' (x,z) = x++z quicksort :: [Int] -> [Int] quicksort [] = [] quicksort (x:xs) | (l1 /= [] ) && (l2 /= []) = addi'(quicksort l1', quicksort l2') | l1 == [] = addi' (l1, quicksort l2) | l2 == [] = addi' (l1,l2) where (l1,l2) = splitBy' x (x:xs) (l1',l2') ...

[ -0.016845703125, 0.01458740234375, 0.000370025634765625, -0.011962890625, -0.0277099609375, 0.0250244140625, -0.010498046875, 0.006500244140625, -0.00173187255859375, 0.0126953125, 0.01953125, -0.00457763671875, -0.01220703125, -0.012451171875, 0.010009765625, -0.006561279296875, 0.0...

[ 7068, 378, 37076, 53, 268, 10, 12071, 25, 1984, 11, 4, 33079, 2203, 425, 169, 1022, 37223, 63773, 62351, 4153, 18, 12, 58745, 141, 418, 1230, 304, 3181, 2594, 96, 6, 69112, 10461, 65450, 75358, 4353, 110218, 21748, 28864, 26073, 7, 89...

[ 0.121337890625, 0.007354736328125, 0.1888427734375, 0.1527099609375, 0.00018310546875, 0.0831298828125, 0.25048828125, 0.1676025390625, 0.0787353515625, 0.07666015625, 0.007843017578125, 0.046295166015625, 0.04388427734375, 0.07171630859375, 0.1136474609375, 0.05548095703125, 0.16467...

embed

20527814_c0

20527814

haskell

0

Title: How do I transform a function defined with pattern matching into an equivalent lambda? Problem title: How do I transform a function defined with pattern matching into an equivalent lambda? Tags: haskell Problem: How do I transform a function defined with pattern matching into an equivalent lambda? How do I write...

How do I transform a function defined with pattern matching into an equivalent lambda? How do I transform a function defined with pattern matching into an equivalent lambda? haskell How x-1 How do I transform a function defined with pattern matching into an equivalent lambda? How do I write as a lambda in Haskell? Than...

[ -0.0145263671875, 0.01068115234375, -0.0035858154296875, -0.0028228759765625, 0.01263427734375, -0.006103515625, 0.016845703125, 0.0242919921875, 0.011474609375, -0.018798828125, 0.01495361328125, -0.0216064453125, -0.0040283203125, -0.0106201171875, 0.026123046875, -0.0074462890625, ...

[ 11249, 54, 87, 27198, 32354, 61924, 678, 103510, 14858, 214, 3934, 183234, 21, 6492, 85, 1556, 142508, 1022, 5759, 33022, 237, 10, 23, 20625, 130534 ]

[ 0.08465576171875, 0.04461669921875, 0.049835205078125, 0.204345703125, 0.1806640625, 0.126220703125, 0.05145263671875, 0.2281494140625, 0.19287109375, 0.1004638671875, 0.0750732421875, 0.14111328125, 0.0906982421875, 0.2071533203125, 0.1898193359375, 0.09130859375, 0.250244140625, ...

embed

74510905_c0

74510905

haskell

0

Title: Eq Ord Classes Haskell Data Problem title: Eq Ord Classes Haskell Data Tags: haskell Problem: Eq Ord Classes Haskell Data Now I have another problem: Another subtask tells me to derive a data type from the classes. I don't know how to compare it. Do you have an idea and could you explain it to me so that I can u...

Eq Ord Classes Haskell Data Eq Ord Classes Haskell Data haskell Ord Classes Haskell Data Eq Ord Classes Haskell Data Now I have another problem: Another subtask tells me to derive a data type from the classes. I don't know how to compare it. Do you have an idea and could you explain it to me so that I can understand? `...

[ 0.0194091796875, 0.0179443359375, -0.0010223388671875, 0.0042724609375, 0.0146484375, 0.0179443359375, 0.01153564453125, -0.0017242431640625, 0.00057220458984375, 0.012939453125, -0.0115966796875, -0.0233154296875, 0.0211181640625, 0.01226806640625, -0.04736328125, -0.01141357421875, ...

[ 241, 864, 35379, 35014, 20625, 142508, 11809, 1556, 15700, 2967, 116267, 1614, 1073, 92, 14192, 122, 5844, 2053, 10644, 1295, 70, 61112, 3714, 3642, 69101, 442, 6528, 73342, 28219, 110527, 7440 ]

[ 0.0555419921875, 0.211181640625, 0.239501953125, 0.223876953125, 0.1282958984375, 0.224365234375, 0.158447265625, 0.1131591796875, 0.00054931640625, 0.066650390625, 0.007537841796875, 0.06585693359375, 0.119140625, 0.029449462890625, 0.03179931640625, 0.09033203125, 0.077880859375, ...

embed

9454793_c0

9454793

haskell

0

Title: Haskell offline documentation? Problem title: Haskell offline documentation? Tags: haskell, offline-mode Problem: Haskell offline documentation? What are the possibilities, if any, for getting offline docs for Haskell core libraries (and maybe more)? Sometimes I take my laptop to the coffee-shop where there is n...

Haskell offline documentation? Haskell offline documentation? haskell offline-mode Haskell Haskell offline documentation? What are the possibilities, if any, for getting offline docs for Haskell core libraries (and maybe more)? Sometimes I take my laptop to the coffee-shop where there is no wifi, and it would be nice h...

[ 0.01446533203125, 0.008544921875, 0.017822265625, -0.00244140625, -0.010009765625, 0.00640869140625, -0.0038604736328125, -0.00543212890625, -0.003448486328125, 0.004791259765625, 0.00482177734375, -0.0203857421875, 0.006866455078125, 0.0115966796875, 0.00933837890625, -0.0035247802734...

[ 20625, 142508, 96083, 209806, 32, 1556, 61170, 97370, 2449, 2499, 20949, 54, 4439, 56458, 35773, 10484, 160193, 5646, 26367, 47, 79497, 10534, 110, 68673, 2806, 26267, 19441, 9844, 152488, 133, 1284, 4527 ]

[ 0.15380859375, 0.23681640625, 0.275146484375, 0.240966796875, 0.049652099609375, 0.146484375, 0.148193359375, 0.1085205078125, 0.050567626953125, 0.001678466796875, 0.0804443359375, 0.132080078125, 0.1470947265625, 0.1163330078125, 0.1357421875, 0.031707763671875, 0.04412841796875, ...

embed

6400568_c0

6400568

haskell

0

Title: Exponentiation in Haskell Problem title: Exponentiation in Haskell Tags: haskell, exponent, exponentiation Problem: Exponentiation in Haskell Can someone tell me why the Haskell Prelude defines two separate functions for exponentiation (i.e. ^ and ** )? I thought the type system was supposed to eliminate this ki...

Exponentiation in Haskell Exponentiation in Haskell haskell exponent exponentiation Exponentiation Haskell Prelude Exponentiation in Haskell Can someone tell me why the Haskell Prelude defines two separate functions for exponentiation (i.e. ^ and ** )? I thought the type system was supposed to eliminate this kind of du...

[ 0.0191650390625, -0.0115966796875, -0.004547119140625, 0.01416015625, 0.006256103515625, 0.00054168701171875, -0.0108642578125, -0.00836181640625, -0.000568389892578125, -0.006744384765625, -0.0167236328125, -0.00421142578125, -0.00921630859375, -0.00469970703125, -0.007354736328125, -...

[ 5443, 54137, 14, 2320, 23, 20625, 142508, 1556, 1119, 78643, 21616, 1914, 822, 14192, 15400, 112, 61924, 6626, 84797, 32354, 100, 13331, 136, 16459, 17569, 10644, 5426, 134598, 27169, 903, 8562, 115, 182867 ]

[ 0.08831787109375, 0.2314453125, 0.1331787109375, 0.06280517578125, 0.053314208984375, 0.1400146484375, 0.2393798828125, 0.1287841796875, 0.0880126953125, 0.1973876953125, 0.188232421875, 0.0936279296875, 0.1552734375, 0.052490234375, 0.09222412109375, 0.09814453125, 0.1552734375, 0...

embed

34538754_c0

34538754

haskell

0

Title: Proving Composition Applicative law for ((->) r) type Problem title: Proving Composition Applicative law for ((->) r) type Tags: haskell Problem: Proving Composition Applicative law for ((->) r) type \x -> ((u x) . (v x)) (w x) -- (B) I don't think (A) & (B) are equivalent, so where did I make a mistake? I...

Proving Composition Applicative law for ((->) r) type Proving Composition Applicative law for ((->) r) type haskell Proving Composition Applicative Expanding Proving Composition Applicative law for ((->) r) type The Composition Applicative Law is as follows: Here's my attempt at proving the Composition law for th...

[ -0.00933837890625, 0.0140380859375, 0.004730224609375, 0.048583984375, -0.0045166015625, 0.006103515625, 0.0029449462890625, 0.010986328125, 0.018798828125, -0.002838134765625, -0.016357421875, 0.004730224609375, 0.034912109375, 0.0196533203125, -0.0196533203125, -0.009521484375, 0.0...

[ 1250, 6496, 3288, 40322, 5659, 11048, 4935, 27165, 100, 60494, 9, 1230, 5386, 1690, 10644, 1556, 142508, 60075, 11, 103607, 36293, 28960, 81887, 502, 68416, 294, 12, 339, 38131, 5351, 284, 619, 571, 183234, 3249, 121742, 77947, 4358 ]

[ 0.10736083984375, 0.055267333984375, 0.1551513671875, 0.2161865234375, 0.121337890625, 0.1385498046875, 0.0648193359375, 0.16357421875, 0.016510009765625, 0.049774169921875, 0.037933349609375, 0.06036376953125, 0.07415771484375, 0.0960693359375, 0.14013671875, 0.12451171875, 0.215820...

embed

36382793_c0

36382793

haskell

0

Title: Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Problem title: Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Tags: haskell Problem: Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Can some body explain me the difference between hGetBuf and...

Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking haskell Haskell Difference Haskell: Difference between hGetBuf, hGetBufSome and hGetBufNonBlocking Can some body explain me the difference between hGetBuf and hGetBufSome. When...

[ 0.01519775390625, 0.0084228515625, 0.032958984375, -0.007293701171875, 0.0027313232421875, 0.01544189453125, 0.00335693359375, -0.003936767578125, 0.00994873046875, 0.028076171875, 0.00860595703125, -0.0380859375, 0.01226806640625, -0.0030975341796875, 0.007293701171875, 0.004272460937...

[ 20625, 142508, 803, 18234, 6620, 17721, 1096, 724, 126, 7235, 420, 8912, 282, 136, 59881, 166191, 214, 1556, 14361, 73342, 163, 60212, 14847, 4527 ]

[ 0.11181640625, 0.235595703125, 0.045440673828125, 0.13232421875, 0.0880126953125, 0.0770263671875, 0.087646484375, 0.1004638671875, 0.1168212890625, 0.177734375, 0.1741943359375, 0.1143798828125, 0.115234375, 0.05615234375, 0.1016845703125, 0.115966796875, 0.0888671875, 0.078002929...

embed

28524471_c0

28524471

haskell

0

Title: Haskell: get rid of parentheses in liftM2 Problem title: Haskell: get rid of parentheses in liftM2 Tags: haskell Problem: Haskell: get rid of parentheses in liftM2 How to remove the parentheses marked with ^ , without introducing new names? (better if it can be splitted into multiple lines) liftM2 (+) (somefunc ...

Haskell: get rid of parentheses in liftM2 Haskell: get rid of parentheses in liftM2 haskell Haskell liftM2 arg1 arg2 arg3 Haskell: get rid of parentheses in liftM2 How to remove the parentheses marked with ^ , without introducing new names? (better if it can be splitted into multiple lines)

[ -0.00194549560546875, 0.00897216796875, -0.00927734375, 0.036376953125, 0.0274658203125, 0.01275634765625, -0.01226806640625, 0.0111083984375, 0.0145263671875, -0.00958251953125, 0.010009765625, -0.002777099609375, -0.01495361328125, -0.00250244140625, -0.00063323974609375, -0.01519775...

[ 20625, 142508, 31351, 49129, 35412, 90, 60520, 594, 304, 1556, 79459, 363, 11249, 87388, 94419, 678, 13331, 15490, 39864, 123055, 3055, 65450, 3934, 48716, 124519 ]

[ 0.10009765625, 0.2158203125, 0.1256103515625, 0.182373046875, 0.21435546875, 0.1173095703125, 0.1927490234375, 0.12939453125, 0.177490234375, 0.102783203125, 0.0843505859375, 0.0675048828125, 0.0161285400390625, 0.1728515625, 0.15625, 0.0285797119140625, 0.1756591796875, 0.04641723...

embed

32468799_c0

32468799

haskell

0

Title: Need help understanding what this Haskell function does Problem title: Need help understanding what this Haskell function does Tags: functional-programming, haskell Problem: Need help understanding what this Haskell function does Not sure exactly what this does, or what to enter into the function to find a patte...

Need help understanding what this Haskell function does Need help understanding what this Haskell function does functional-programming haskell Need Haskell x:xs Need help understanding what this Haskell function does Not sure exactly what this does, or what to enter into the function to find a pattern in the outputs

[ 0.01513671875, 0.003509521484375, -0.0103759765625, 0.0029144287109375, 0.0017547607421875, 0.0269775390625, 0.0004253387451171875, 0.0064697265625, 0.0203857421875, -0.00156402587890625, 0.019287109375, -0.0184326171875, 0.003509521484375, 0.01422119140625, 0.013671875, -0.00265502929...

[ 52889, 4358, 100094, 2367, 903, 20625, 142508, 32354, 14602, 123309, 28966, 1556, 1022, 12, 425, 7, 11205, 9077, 66161, 30957, 7413, 10, 103510, 23, 140992 ]

[ 0.10577392578125, 0.1051025390625, 0.135009765625, 0.0770263671875, 0.12493896484375, 0.1314697265625, 0.216552734375, 0.2044677734375, 0.1229248046875, 0.1356201171875, 0.08544921875, 0.1234130859375, 0.0902099609375, 0.084716796875, 0.127197265625, 0.0787353515625, 0.00609588623046...

embed

36351560_c0

36351560

haskell

0

Title: Haskell divide Double by Int Problem title: Haskell divide Double by Int Tags: haskell Problem: Haskell divide Double by Int I have the following piece of code, the problem is that I try to divide a Double by an Int factorial :: Int -> Int factorial 0 = 1 factorial e = e * (factorial e-1) sumX :: Double -> Int -...

Haskell divide Double by Int Haskell divide Double by Int haskell Haskell Double e-1 Haskell divide Double by Int I have the following piece of code, the problem is that I try to divide a Double by an Int How can I get it to work?

[ -0.001800537109375, 0.00830078125, 0.02001953125, -0.008544921875, -0.01031494140625, 0.0016937255859375, -0.0031585693359375, 0.002532958984375, 0.01214599609375, -0.016845703125, 0.008544921875, -0.00457763671875, 0.00408935546875, -0.0205078125, -0.00518798828125, 0.02685546875, -...

[ 20625, 142508, 101637, 107172, 390, 360, 18, 1556, 28, 5759, 765, 25632, 63847, 18151, 2967, 9790, 142, 11249, 831, 2046, 442, 47, 4488 ]

[ 0.1553955078125, 0.2191162109375, 0.211669921875, 0.22802734375, 0.1434326171875, 0.1710205078125, 0.186279296875, 0.1495361328125, 0.11749267578125, 0.1453857421875, 0.01055908203125, 0.07452392578125, 0.06695556640625, 0.12451171875, 0.13330078125, 0.12744140625, 0.0230255126953125...

embed

15693505_c0

15693505

haskell

0

Title: reaching elements of tuple by index number in Haskell Problem title: reaching elements of tuple by index number in Haskell Tags: tuples, haskell Problem: reaching elements of tuple by index number in Haskell how to reach elements of tuple by giving the index number ? Or is there any other similar way to do it? F...

reaching elements of tuple by index number in Haskell reaching elements of tuple by index number in Haskell tuples haskell Haskell reaching elements of tuple by index number in Haskell how to reach elements of tuple by giving the index number ? Or is there any other similar way to do it? For example i have a tuple with...

[ 0.01239013671875, 0.01361083984375, 0.01611328125, 0.010009765625, 0.0003032684326171875, -0.007415771484375, -0.0108642578125, -0.008056640625, 0.01446533203125, -0.029296875, 0.0045166015625, -0.032470703125, -0.028076171875, 0.018798828125, 0.0086669921875, 0.000591278076171875, 0...

[ 58359, 214, 80854, 111, 370, 8705, 390, 63262, 14012, 23, 20625, 142508, 99726, 1556, 3642, 47, 68772, 21373, 3917, 54, 442, 17, 678, 136659, 12830, 3444, 305, 927 ]

[ 0.2470703125, 0.060699462890625, 0.208984375, 0.05853271484375, 0.144775390625, 0.2332763671875, 0.07025146484375, 0.196533203125, 0.1783447265625, 0.05389404296875, 0.151123046875, 0.2412109375, 0.1923828125, 0.1251220703125, 0.077392578125, 0.051788330078125, 0.08563232421875, 0....

embed

26025392_c0

26025392

haskell

0

Title: How to check cabal flags in a sandbox Problem title: How to check cabal flags in a sandbox Tags: cabal, haskell Problem: How to check cabal flags in a sandbox I can do cabal install --enable-executable-profiling . cabal is supposed to remember the flag cabal.config file. However, I'm using a sandbox and I can't ...

How to check cabal flags in a sandbox How to check cabal flags in a sandbox cabal haskell How cabal.config How to check cabal flags in a sandbox I can do cabal install --enable-executable-profiling . cabal is supposed to remember the flag cabal.config file. However, I'm using a sandbox and I can't find any config file....

[ 0.002410888671875, -0.0130615234375, 0.01226806640625, 0.018798828125, -0.006683349609375, -0.0033721923828125, 0.004364013671875, 0.017333984375, 0.0068359375, 0.0244140625, -0.00003528594970703125, -0.01263427734375, -0.009033203125, -0.01904296875, 0.01019287109375, 0.0157470703125,...

[ 11249, 12765, 109524, 49938, 7, 23, 19096, 11728, 47, 10, 1556, 142508, 153837, 20600, 2886, 46480, 1010, 22819, 58395, 214, 134598, 37629, 11435, 17368, 831, 18, 7413, 765, 2809, 34704, 3674 ]

[ 0.0252685546875, 0.197509765625, 0.25537109375, 0.2369384765625, 0.113037109375, 0.07611083984375, 0.1453857421875, 0.2225341796875, 0.0185546875, 0.0248870849609375, 0.089599609375, 0.1756591796875, 0.196533203125, 0.0806884765625, 0.07110595703125, 0.0201416015625, 0.08740234375, ...

embed

45338043_c0

45338043

haskell

0

Title: Concatenate two integers in haskell Problem title: Concatenate two integers in haskell Tags: haskell Problem: Concatenate two integers in haskell Hey guys I am having a problem with my code. The code below supposed to remove the first 2 in the list and then concatenate them.So the result answer would be 1,2. fir...

Concatenate two integers in haskell Concatenate two integers in haskell haskell Concatenate Concatenate two integers in haskell Hey guys I am having a problem with my code. The code below supposed to remove the first 2 in the list and then concatenate them.So the result answer would be 1,2.

[ -0.0020599365234375, -0.01263427734375, -0.006805419921875, 0.0260009765625, 0.0052490234375, 0.044189453125, -0.008056640625, 0.0137939453125, 0.0157470703125, -0.01544189453125, -0.0118408203125, -0.023681640625, 0.01495361328125, 0.0167236328125, 0.01123046875, -0.02685546875, 0.0...

[ 1657, 33478, 76, 67, 6626, 892, 26255, 23, 1556, 142508, 28240, 51484, 2967, 18151, 35064, 134598, 87388, 5117, 116, 5303, 158, 2856, 16750, 35166, 2806, 186, 25568 ]

[ 0.09881591796875, 0.2044677734375, 0.1480712890625, 0.07861328125, 0.1485595703125, 0.15576171875, 0.127685546875, 0.07464599609375, 0.16796875, 0.23779296875, 0.0177459716796875, 0.0287017822265625, 0.05938720703125, 0.0941162109375, 0.075439453125, 0.06005859375, 0.1573486328125, ...

embed

8820604_c0

8820604

haskell

0

Title: Haskell Plugin for XCode 4 under OS X Lion Problem title: Haskell Plugin for XCode 4 under OS X Lion Tags: plugins, xcode, osx-lion, macos, haskell Problem: Haskell Plugin for XCode 4 under OS X Lion Is there an alternative to http://www.hoovy.org/HaskellXcodePlugin/ i can use for XCode 4 whilst using Mac OS X L...

Haskell Plugin for XCode 4 under OS X Lion Haskell Plugin for XCode 4 under OS X Lion plugins xcode osx-lion macos haskell Haskell Plugin XCode Lion Haskell Plugin for XCode 4 under OS X Lion Is there an alternative to http://www.hoovy.org/HaskellXcodePlugin/ i can use for XCode 4 whilst using Mac OS X Lion ? Or if it ...

[ -0.005767822265625, 0.039794921875, -0.004364013671875, -0.00445556640625, -0.0115966796875, 0.005828857421875, -0.007476806640625, -0.006317138671875, -0.0098876953125, -0.0201416015625, -0.0245361328125, -0.025634765625, 0.004913330078125, -0.0135498046875, 0.0179443359375, -0.008117...

[ 20625, 142508, 187364, 100, 1193, 114211, 201, 1379, 11787, 82209, 69993, 1022, 40899, 362, 45486, 7840, 1556, 2685, 30700, 497, 67983, 1478, 6495, 7, 1542, 683, 35159, 73, 17, 831, 4527, 217982, 17368, 4727, 43240, 45367 ]

[ 0.17431640625, 0.255615234375, 0.25732421875, 0.02667236328125, 0.07342529296875, 0.25048828125, 0.197509765625, 0.136962890625, 0.0997314453125, 0.19677734375, 0.2115478515625, 0.000030517578125, 0.2200927734375, 0.048919677734375, 0.134765625, 0.05316162109375, 0.139892578125, 0....

embed

36918873_c0

36918873

haskell

0

Title: Can I have plus or minus when doing cases? Problem title: Can I have plus or minus when doing cases? Tags: haskell Problem: Can I have plus or minus when doing cases? Could I put a case to be within a certain range or another number? say ... case x of +/- 3 -> yes ... Would that be something Haskell should under...

Can I have plus or minus when doing cases? Can I have plus or minus when doing cases? haskell Can Can I have plus or minus when doing cases? Could I put a case to be within a certain range or another number? say ... ... Would that be something Haskell should understand? Update: In short, would i be able to match to an ...

[ -0.0255126953125, 0.00640869140625, 0.01031494140625, 0.00347900390625, -0.00860595703125, -0.00811767578125, 0.000576019287109375, 0.01611328125, 0.01025390625, -0.00994873046875, 0.00188446044921875, -0.0036468505859375, 0.0052490234375, 0.005706787109375, -0.0023193359375, -0.003128...

[ 4171, 87, 765, 1001, 707, 26948, 3229, 20594, 50218, 1556, 142508, 191147, 3884, 7225, 47, 186, 28032, 24233, 37457, 15700, 14012, 20625, 5608, 28219, 16610, 2806, 17, 19048, 14858, 51514, 43257 ]

[ 0.107177734375, 0.0701904296875, 0.13232421875, 0.2298583984375, 0.1448974609375, 0.289306640625, 0.06365966796875, 0.10333251953125, 0.2373046875, 0.1414794921875, 0.245849609375, 0.0718994140625, 0.087890625, 0.1988525390625, 0.053619384765625, 0.011016845703125, 0.1123046875, 0....

embed

22748546_c0

22748546

haskell

0

Title: How to add spaces to string in Haskell Problem title: How to add spaces to string in Haskell Tags: haskell Problem: How to add spaces to string in Haskell I have a string "AB0123456789" and the output I would like to have is: "AB01 2345 6789" ... I want to add a space after every fourth character. How can I do t...

How to add spaces to string in Haskell How to add spaces to string in Haskell haskell How Haskell AB0123456789 AB01 Main How to add spaces to string in Haskell I have a string "AB0123456789" and the output I would like to have is: "AB01 2345 6789" ... I want to add a space after every fourth character. How can I do thi...

[ -0.015869140625, 0.005157470703125, -0.01312255859375, 0.0123291015625, -0.0291748046875, 0.0225830078125, 0.008544921875, -0.0206298828125, 0.0007476806640625, -0.007476806640625, 0.03564453125, -0.0213623046875, -0.0257568359375, 0.00750732421875, -0.01025390625, -0.00176239013671875...

[ 11249, 47, 15190, 32628, 7, 79315, 23, 20625, 142508, 1556, 11321, 6746, 3742, 121317, 153781, 12321, 765, 11040, 140992, 2806, 1884, 1105, 4633, 305, 3444, 10, 7103, 11907, 22759, 927, 62816, 831, 54, 903 ]

[ 0.06982421875, 0.10699462890625, 0.1455078125, 0.289306640625, 0.160400390625, 0.254638671875, 0.0789794921875, 0.166259765625, 0.2481689453125, 0.143310546875, 0.1126708984375, 0.126708984375, 0.08349609375, 0.1204833984375, 0.1639404296875, 0.04803466796875, 0.032196044921875, 0....

embed

24700762_c0

24700762

haskell

0

Title: Or-patterns in Haskell Problem title: Or-patterns in Haskell Tags: haskell, ocaml Problem: Or-patterns in Haskell In OCaml, I was used to writing code which looked like: let combine o1 o2 = match o1, o2 with | Valid, Invalid | Invalid, Valid -> Invalid | _ -> ... I didn't find a way to write or-patterns in Haske...

Or-patterns in Haskell Or-patterns in Haskell haskell ocaml Or-patterns Haskell Valid Invalid Or-patterns in Haskell In OCaml, I was used to writing code which looked like: I didn't find a way to write or-patterns in Haskell and I really miss it. Does anyone have a solution?

[ -0.01483154296875, 0.006744384765625, 0.0030364990234375, 0.01043701171875, -0.0159912109375, 0.007568359375, -0.047607421875, -0.006317138671875, 0.0028076171875, 0.00836181640625, 0.002197265625, -0.006011962890625, 0.0277099609375, 0.008544921875, -0.0147705078125, -0.0107421875, ...

[ 3347, 9, 4453, 22766, 7, 23, 20625, 142508, 1556, 36, 9779, 141, 25447, 71, 360, 7013, 180, 105272, 509, 11814, 32562, 18151, 54811, 1884, 15935, 18, 7413, 10, 3917, 47, 33022, 707, 87, 6183, 18025, 442, 35672, 765, 29806 ]

[ 0.2337646484375, 0.0657958984375, 0.2034912109375, 0.2088623046875, 0.03057861328125, 0.0660400390625, 0.120849609375, 0.23291015625, 0.101806640625, 0.0596923828125, 0.104248046875, 0.1422119140625, 0.10693359375, 0.0111083984375, 0.0389404296875, 0.1380615234375, 0.0904541015625, ...

embed

28666113_c0

28666113

haskell

0

Title: Goto Definition in Emacs - Haskell mode Problem title: Goto Definition in Emacs - Haskell mode Tags: haskell, emacs Problem: Goto Definition in Emacs - Haskell mode I installed Haskell Mode through Melpa package-install . However, M - . ( goto-definition) still uses emacs' inbuilt findTags function. Doesn't hask...

Goto Definition in Emacs - Haskell mode Goto Definition in Emacs - Haskell mode haskell emacs Goto Definition Emacs Haskell Mode Goto Definition in Emacs - Haskell mode I installed Haskell Mode through Melpa package-install . However, M - . ( goto-definition) still uses emacs' inbuilt findTags function. Doesn't haskell...

[ 0.0091552734375, 0.0166015625, 0.022705078125, -0.018310546875, 0.01141357421875, 0.0162353515625, -0.01531982421875, -0.016357421875, 0.0010833740234375, -0.031982421875, 0.01708984375, -0.0303955078125, -0.022216796875, -0.0177001953125, -0.0120849609375, -0.00146484375, 0.00424194...

[ 2016, 188, 155455, 85269, 4439, 20625, 142508, 13736, 23, 1556, 352, 2263, 36024, 20600, 13892, 763, 98169, 80383, 276, 20, 5, 4163, 31, 49919, 7464, 4527, 978, 24908, 7413, 66448, 32354, 903, 80934, 60213 ]

[ 0.1917724609375, 0.265625, 0.1876220703125, 0.1497802734375, 0.1756591796875, 0.11083984375, 0.217041015625, 0.14892578125, 0.039093017578125, 0.1160888671875, 0.0738525390625, 0.146728515625, 0.1552734375, 0.06707763671875, 0.06451416015625, 0.1253662109375, 0.0711669921875, 0.046...

embed

4161111_c0

4161111

haskell

0

Title: Haskell function to parse a string and return any urls found Problem title: Haskell function to parse a string and return any urls found Tags: haskell, parsing Problem: Haskell function to parse a string and return any urls found What I've been looking for is the function in the title. I could write something in...

Haskell function to parse a string and return any urls found Haskell function to parse a string and return any urls found haskell parsing Haskell Haskell function to parse a string and return any urls found What I've been looking for is the function in the title. I could write something in parsec, but before I do, anyo...

[ -0.005615234375, 0.0037384033203125, 0.00148773193359375, 0.0322265625, 0.000518798828125, 0.0186767578125, -0.0029296875, -0.025390625, 0.00049591064453125, -0.0439453125, -0.00946044921875, -0.04931640625, 0.00238037109375, -0.01055908203125, 0.001617431640625, 0.015625, -0.0046997...

[ 20625, 142508, 32354, 47, 366, 184, 79315, 136, 30646, 2499, 25002, 14037, 1556, 6953, 16487, 100, 23, 44759, 5809, 33022, 39797, 35672, 3714, 1884, 903, 4358 ]

[ 0.11572265625, 0.2362060546875, 0.21484375, 0.056854248046875, 0.17041015625, 0.133056640625, 0.226806640625, 0.06365966796875, 0.16064453125, 0.10205078125, 0.183349609375, 0.1395263671875, 0.1171875, 0.09088134765625, 0.05718994140625, 0.0511474609375, 0.0229339599609375, 0.17333...

embed

46265118_c0

46265118

haskell

0

Title: How to parse to custom type in Haskell Problem title: How to parse to custom type in Haskell Tags: parsing, haskell, string, types Problem: How to parse to custom type in Haskell I'm new to haskell and have no idea how to parse. I have created a new type type Field = String Now I want parse [String] to [Field], ...

How to parse to custom type in Haskell How to parse to custom type in Haskell parsing haskell string types How Haskell Field How to parse to custom type in Haskell I'm new to haskell and have no idea how to parse. I have created a new type Now I want parse [String] to [Field], how could I do this? I already have this:

[ -0.01025390625, -0.0101318359375, -0.0123291015625, 0.03515625, -0.0069580078125, 0.02197265625, 0.0086669921875, -0.00872802734375, 0.00592041015625, 0.005401611328125, 0.0006866455078125, -0.020263671875, 0.006866455078125, -0.0029296875, -0.02783203125, -0.0235595703125, 0.0019378...

[ 11249, 47, 366, 184, 114122, 10644, 23, 20625, 142508, 6953, 1556, 79315, 52895, 117657, 3525, 110, 6528, 3642, 75935, 14240, 3444, 71713, 214, 6159, 19388, 5809, 903, 21771, 765 ]

[ 0.07049560546875, 0.1431884765625, 0.157958984375, 0.135498046875, 0.2279052734375, 0.242919921875, 0.0689697265625, 0.1351318359375, 0.219482421875, 0.05792236328125, 0.1297607421875, 0.1668701171875, 0.191162109375, 0.1734619140625, 0.02789306640625, 0.007354736328125, 0.0438537597...

embed