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
66535628_c0	66535628	haskell	0	Title: What is the difference between install, v1-install, v2-install and new-install? Problem title: What is the difference between install, v1-install, v2-install and new-install? Tags: cabal, cabal-install, haskell Problem: What is the difference between install, v1-install, v2-install and new-install? The commands ...	What is the difference between install, v1-install, v2-install and new-install? What is the difference between install, v1-install, v2-install and new-install? cabal cabal-install haskell What v1-install v2-install What is the difference between install, v1-install, v2-install and new-install? The commands install , v1...	[ 0.0048828125, -0.0185546875, 0.0126953125, 0.016357421875, -0.00970458984375, 0.02197265625, -0.0234375, -0.00148773193359375, 0.01409912109375, 0.0712890625, 0.01483154296875, -0.0181884765625, 0.00958251953125, 0.0038909912109375, -0.023193359375, 0.0074462890625, -0.00741577148437...	[ 70, 60212, 17721, 20600, 81, 20268, 80383, 18504, 136, 3525, 9, 109524, 1556, 142508, 4865, 83, 75101, 7, 42856, 151552, 47, 4153, 92621, 98169, 51042, 332, 1836, 12921, 1632, 15700, 12601, 2822, 35829 ]	[ 0.031158447265625, 0.2093505859375, 0.1312255859375, 0.2427978515625, 0.2000732421875, 0.1875, 0.25927734375, 0.255859375, 0.0531005859375, 0.1796875, 0.057403564453125, 0.2509765625, 0.1064453125, 0.2059326171875, 0.03277587890625, 0.0261688232421875, 0.2021484375, 0.0490417480468...	embed
69525291_c0	69525291	haskell	0	Title: Combining swap and pair function in haskell Problem title: Combining swap and pair function in haskell Tags: haskell Problem: Combining swap and pair function in haskell I am very new to haskell and i have begun reading the book 'programming in haskell'. I came across the function called swap swap (x,y) = (y,x) ...	Combining swap and pair function in haskell Combining swap and pair function in haskell haskell Combining Combining swap and pair function in haskell I am very new to haskell and i have begun reading the book 'programming in haskell'. I came across the function called swap and the function pair. Then i began to wonder ...	[ -0.009521484375, 0.03173828125, -0.0174560546875, -0.00089263916015625, -0.0152587890625, 0.006378173828125, -0.0308837890625, -0.01422119140625, -0.00732421875, 0.00072479248046875, -0.00176239013671875, -0.004486083984375, 0.00732421875, 0.013916015625, -0.00921630859375, -0.00866699...	[ 106935, 592, 202317, 136, 80836, 32354, 1556, 142508, 23, 4552, 3525, 16454, 12877, 28966, 36880, 32195, 7722, 70163, 6626, 209303, 1884, 17368, 494, 147, 237, 4358 ]	[ 0.202880859375, 0.0224151611328125, 0.28369140625, 0.10546875, 0.27197265625, 0.222412109375, 0.144775390625, 0.2415771484375, 0.033721923828125, 0.0189208984375, 0.027618408203125, 0.03924560546875, 0.04052734375, 0.0279388427734375, 0.034576416015625, 0.01287841796875, 0.0972900390...	embed
12687898_c1	12687898	haskell	1	_number \| card_number == 2 = ((Card Club R5):(Card Heart J),cardDeck) and now, I need to write the nextGuess code. nextGuess :: ([Card],GameState) -> (Int,Int,Int,Int,Int) ->([Card],GameState) (Int,Int,Int,Int,Int) is the feedback value. How can i represent the first parameter ([Card],GameState) , which means the previ...	_number \| card_number == 2 = ((Card Club R5):(Card Heart J),cardDeck) and now, I need to write the nextGuess code. nextGuess :: ([Card],GameState) -> (Int,Int,Int,Int,Int) ->([Card],GameState) (Int,Int,Int,Int,Int) is the feedback value. How can i represent the first parameter ([Card],GameState) , which means the previ...	[ -0.0133056640625, -0.00170135498046875, -0.0026092529296875, 0.0230712890625, 0.0113525390625, 0.004913330078125, -0.020263671875, -0.003570556640625, 0.0274658203125, 0.00408935546875, -0.01318359375, 0.0107421875, 0.01025390625, 0.0286865234375, -0.00848388671875, -0.0048828125, -0...	[ 2606, 1297, 20596, 69112, 116, 156119, 7687, 627, 43317, 60861, 821, 38931, 120152, 92, 3871, 33022, 11737, 22769, 90, 7, 18151, 107576, 135206, 18, 58269, 34292, 17, 33636, 5117, 171859, 26950, 96362, 57767, 126381, 13547, 28864, 26073, 2062...	[ 0.069091796875, 0.05224609375, 0.190673828125, 0.081787109375, 0.081298828125, 0.1839599609375, 0.181884765625, 0.04071044921875, 0.1158447265625, 0.1485595703125, 0.0982666015625, 0.08612060546875, 0.0926513671875, 0.004180908203125, 0.017974853515625, 0.083740234375, 0.1435546875, ...	embed
38236762_c2	38236762	haskell	2	00s 0.0000s Gen 1 2 colls, 1 par 0.000s 0.000s 0.0002s 0.0003s Parallel GC work balance: 12.41% (serial 0%, perfect 100%) TASKS: 4 (1 bound, 3 peak workers (3 total), using -N2) SPARKS: 40 (10 converted, 0 overflowed, 0 dud, 0 GC'd, 30 fizzled) INIT time 0.000s ( 0.001s elapsed) MUT time 7.453s ( Code signals: Control....	00s 0.0000s Gen 1 2 colls, 1 par 0.000s 0.000s 0.0002s 0.0003s Parallel GC work balance: 12.41% (serial 0%, perfect 100%) TASKS: 4 (1 bound, 3 peak workers (3 total), using -N2) SPARKS: 40 (10 converted, 0 overflowed, 0 dud, 0 GC'd, 30 fizzled) INIT time 0.000s ( 0.001s elapsed) MUT time 7.453s ( Code signals: Control....	[ 0.004425048828125, 0.0174560546875, -0.012451171875, -0.00738525390625, 0.00506591796875, 0.0020294189453125, 0.005767822265625, -0.02685546875, 0.01348876953125, -0.001556396484375, 0.0019989013671875, -0.01507568359375, 0.0120849609375, 0.0169677734375, 0.003326416015625, 0.006225585...	[ 7227, 7, 89678, 9508, 15937, 106, 116, 122907, 366, 757, 8557, 97259, 123276, 211485, 69657, 4488, 40197, 12, 5035, 617, 13961, 184, 51626, 83137, 15787, 3555, 16, 36195, 20113, 201, 99091, 138, 280, 344, 133325, 6896, 3622, 17368, 20, 83...	[ 0.202392578125, 0.048583984375, 0.1456298828125, 0.2052001953125, 0.2159423828125, 0.123779296875, 0.06781005859375, 0.1419677734375, 0.140625, 0.032928466796875, 0.214599609375, 0.149169921875, 0.1444091796875, 0.287841796875, 0.218017578125, 0.1505126953125, 0.2435302734375, 0.02...	embed
5331380_c0	5331380	haskell	0	Title: Recursion over lists in Haskell Problem title: Recursion over lists in Haskell Tags: recursion, list, haskell, fold Problem: Recursion over lists in Haskell For instance, i have a list like ['a','b','c','d','e']. I want to do something like this: First do something with the first two elements, f 'a' 'b' Then do ...	Recursion over lists in Haskell Recursion over lists in Haskell recursion list haskell fold Recursion Haskell Recursion over lists in Haskell For instance, i have a list like ['a','b','c','d','e']. I want to do something like this: First do something with the first two elements, f 'a' 'b' Then do the same thing with th...	[ -0.0064697265625, -0.000385284423828125, 0.0042724609375, 0.008056640625, 0.0079345703125, 0.01287841796875, -0.0185546875, 0.00024127960205078125, -0.000820159912109375, -0.0186767578125, 0.01116943359375, -0.0301513671875, -0.004180908203125, 0.0159912109375, -0.0076904296875, -0.007...	[ 165428, 42, 6889, 645, 5303, 7, 23, 20625, 142508, 195625, 1830, 1556, 42822, 110527, 765, 1884, 275, 238, 71, 13, 3444, 54, 9844, 903, 23972, 678, 5117, 6626, 80854, 1238, 5701, 30646, 34292, 136, 11737, 12830, 16750, 2203, 4390, 2109, ...	[ 0.1702880859375, 0.1566162109375, 0.1246337890625, 0.1746826171875, 0.2252197265625, 0.081298828125, 0.0303802490234375, 0.15673828125, 0.23681640625, 0.21826171875, 0.0743408203125, 0.134033203125, 0.196044921875, 0.01116943359375, 0.0196380615234375, 0.1068115234375, 0.019851684570...	embed
47857512_c0	47857512	haskell	0	Title: Maximum element on a Tree in haskell? Problem title: Maximum element on a Tree in haskell? Tags: tree, haskell, data-structures Problem: Maximum element on a Tree in haskell? Given a Tree : data Tree a = Empty \| Node a [Tree a] deriving Show I am trying to get the maximum element so I've tried: maxElem:: (Ord a)...	Maximum element on a Tree in haskell? Maximum element on a Tree in haskell? tree haskell data-structures Maximum Tree Empty Node Show Ord Maximum element on a Tree in haskell? Given a Tree : I am trying to get the maximum element so I've tried: But I get an error and I don't find it.	[ 0.007415771484375, 0.00665283203125, 0.0186767578125, -0.00860595703125, 0.015869140625, 0.0186767578125, -0.00994873046875, -0.01434326171875, -0.0078125, -0.05322265625, 0.0001926422119140625, -0.0240478515625, 0.01385498046875, -0.01116943359375, 0.012939453125, -0.01904296875, 0....	[ 46540, 316, 12830, 98, 101344, 23, 1556, 142508, 53201, 2053, 137656, 31678, 939, 438, 112, 17367, 35379, 10, 77878, 31577, 2046, 38132, 37842, 18499, 2301, 18, 7413 ]	[ 0.197021484375, 0.1248779296875, 0.199462890625, 0.069091796875, 0.2386474609375, 0.05352783203125, 0.1378173828125, 0.211669921875, 0.13720703125, 0.039337158203125, 0.07568359375, 0.137939453125, 0.058837890625, 0.09735107421875, 0.08038330078125, 0.0771484375, 0.147216796875, 0....	embed
31169262_c0	31169262	haskell	0	Title: Sorting algorithm in Haskell Problem title: Sorting algorithm in Haskell Tags: quicksort, sorting, haskell Problem: Sorting algorithm in Haskell I am trying to implement a very trivial sorting algorithm in Haskell. It compiles but keeps giving me incorrect outputs. Here is the code import Data.List minimum' :: (...	Sorting algorithm in Haskell Sorting algorithm in Haskell quicksort sorting haskell Data.List Sorting Haskell Ord x:xs Sorting algorithm in Haskell I am trying to implement a very trivial sorting algorithm in Haskell. It compiles but keeps giving me incorrect outputs. Here is the code Any thoughts?	[ -0.01068115234375, 0.014892578125, 0.022705078125, -0.03466796875, -0.004913330078125, 0.0091552734375, -0.0015411376953125, -0.0294189453125, 0.005889892578125, -0.006591796875, -0.006561279296875, 0.000766754150390625, 0.00469970703125, -0.005218505859375, -0.0037841796875, -0.005981...	[ 53666, 214, 234873, 23, 20625, 142508, 63773, 62351, 12096, 1556, 11809, 154663, 35379, 1022, 12, 425, 31577, 29479, 4552, 1927, 686, 9969, 1340, 1284, 13695, 214552, 140992, 11853, 18151, 38514 ]	[ 0.1763916015625, 0.0738525390625, 0.225830078125, 0.0506591796875, 0.12646484375, 0.226318359375, 0.11529541015625, 0.20166015625, 0.14599609375, 0.1121826171875, 0.06201171875, 0.087646484375, 0.11883544921875, 0.02911376953125, 0.0048065185546875, 0.052398681640625, 0.0498962402343...	embed
54294951_c2	54294951	haskell	2	out how to use it in a stack-based project (it wraps the system GHC?). Any advice for how to make the core more readable? Code signals: Formatting, GHC, ipv_aAYC, ipv1_aAYD, GHC.Prim.State, Lamdu.Calc.Infer.R:WorldSTInfer, GHC.Prim.RealWorld, Control.Monad.ST.Class.D:R:Worldt, ReaderT, InferEnv, STVar, STRef, Lamdu.Ca...	out how to use it in a stack-based project (it wraps the system GHC?). Any advice for how to make the core more readable? Code signals: Formatting, GHC, ipv_aAYC, ipv1_aAYD, GHC.Prim.State, Lamdu.Calc.Infer.R:WorldSTInfer, GHC.Prim.RealWorld, Control.Monad.ST.Class.D:R:Worldt, ReaderT, InferEnv, STVar, STRef, Lamdu.Ca...	[ -0.000865936279296875, -0.01507568359375, 0.0211181640625, 0.0006103515625, -0.00518798828125, -0.01513671875, -0.0026092529296875, -0.0235595703125, 0.00958251953125, -0.0235595703125, 0.00872802734375, -0.006622314453125, -0.01055908203125, 0.006988525390625, 0.01129150390625, 0.0060...	[ 1810, 3642, 47, 4527, 442, 23, 177261, 77007, 13452, 217, 137565, 7, 70, 5426, 527, 73265, 194, 28541, 67660, 3249, 56458, 1286, 12301, 2886, 32, 28864, 26073, 12, 60972, 1916, 17, 132059, 11, 51720, 441, 397, 145111, 135206, 59387, 693, ...	[ 0.0784912109375, 0.08966064453125, 0.06365966796875, 0.175048828125, 0.1678466796875, 0.04193115234375, 0.209228515625, 0.1497802734375, 0.1724853515625, 0.10662841796875, 0.1568603515625, 0.11328125, 0.022247314453125, 0.165283203125, 0.1162109375, 0.229736328125, 0.042022705078125,...	embed
57219021_c0	57219021	haskell	0	Title: How is `join` implemented in Maybe/List monad? Problem title: How is `join` implemented in Maybe/List monad? Tags: haskell, monads Problem: How is `join` implemented in Maybe/List monad? join can be defined implemented in terms of >>= : join :: Monad m => m (m a) -> m a join m = m >>= id Specifically, how is it ...	How is `join` implemented in Maybe/List monad? How is `join` implemented in Maybe/List monad? haskell monads How Maybe List Monad Nothing Just How is `join` implemented in Maybe/List monad? join can be defined implemented in terms of >>= : Specifically, how is it implemented in a Maybe and a List monad? Is it in Maybe ...	[ -0.00738525390625, 0.00098419189453125, 0.0250244140625, -0.0031890869140625, 0.003936767578125, 0.0311279296875, -0.0033416748046875, 0.00885009765625, 0.02099609375, 0.0001850128173828125, 0.01123046875, -0.024658203125, -0.010009765625, -0.01611328125, 0.005096435546875, 0.014343261...	[ 11249, 83, 513, 73, 29479, 297, 23, 83425, 64, 154663, 2667, 712, 1556, 142508, 32036, 60331, 71, 182747, 32, 33284, 831, 61924, 69407, 6396, 1369, 3642, 442, 136 ]	[ 0.1358642578125, 0.040802001953125, 0.21923828125, 0.222900390625, 0.2213134765625, 0.080078125, 0.07720947265625, 0.298095703125, 0.049346923828125, 0.190673828125, 0.123291015625, 0.1593017578125, 0.08502197265625, 0.19189453125, 0.193359375, 0.1546630859375, 0.099853515625, 0.09...	embed
2544349_c0	2544349	haskell	0	Title: Why must named functions be in a separate file in hugs? Problem title: Why must named functions be in a separate file in hugs? Tags: haskell, hugs Problem: Why must named functions be in a separate file in hugs? In Haskell in 5 steps the factorial function is defined as follows: let fac n = if n == 0 then 1 else...	Why must named functions be in a separate file in hugs? Why must named functions be in a separate file in hugs? haskell hugs Why n-1 Why must named functions be in a separate file in hugs? In Haskell in 5 steps the factorial function is defined as follows: But for hugs, it says that fac needs to be in fac.h. Can anyone...	[ 0.005584716796875, -0.0169677734375, 0.01416015625, 0.036865234375, -0.0020294189453125, 0.0009918212890625, 0.00927734375, 0.006072998046875, 0.00836181640625, -0.013671875, 0.00168609619140625, -0.045654296875, -0.0179443359375, -0.010498046875, 0.01513671875, -0.005340576171875, 0...	[ 44084, 8110, 24, 4806, 32354, 7, 186, 23, 84797, 11435, 35875, 1556, 142508, 653, 5759, 20625, 190, 98441, 31461, 15403, 61924, 71, 28960, 100, 17378, 7808, 27117, 5, 127, 73342, 15400, 132283, 81273, 205969, 29481 ]	[ 0.09454345703125, 0.1114501953125, 0.162353515625, 0.19580078125, 0.2313232421875, 0.134033203125, 0.035369873046875, 0.101318359375, 0.18408203125, 0.2152099609375, 0.208984375, 0.0965576171875, 0.223876953125, 0.0440673828125, 0.130615234375, 0.1116943359375, 0.07720947265625, 0....	embed
67434679_c0	67434679	haskell	0	Title: I couldn't figure out how to use sInsert function. Can you help me? Problem title: I couldn't figure out how to use sInsert function. Can you help me? Tags: haskell Problem: I couldn't figure out how to use sInsert function. Can you help me? I couldn't figure out how to use sInsert function. Can you he...	I couldn't figure out how to use sInsert function. Can you help me? I couldn't figure out how to use sInsert function. Can you help me? haskell Can Ord Tree Nil Node I couldn't figure out how to use sInsert function. Can you help me? I couldn't figure out how to use sInsert function. Can you help me? sInsert ...	[ -0.012451171875, -0.00115203857421875, 0.015869140625, -0.01434326171875, -0.00135040283203125, 0.00634765625, -0.01275634765625, -0.029052734375, 0.012451171875, -0.002288818359375, 0.0166015625, -0.0203857421875, 0.0028533935546875, -0.01416015625, 0.01019287109375, -0.00738525390625...	[ 69427, 3768, 26366, 1810, 3642, 4527, 91, 4153, 33657, 32354, 4171, 4358, 18, 47, 1556, 142508, 35379, 101344, 77175, 438, 112, 7273 ]	[ 0.06365966796875, 0.043487548828125, 0.0869140625, 0.0430908203125, 0.0562744140625, 0.125244140625, 0.13232421875, 0.1737060546875, 0.287109375, 0.1961669921875, 0.1005859375, 0.0675048828125, 0.03466796875, 0.0228271484375, 0.085693359375, 0.2138671875, 0.1993408203125, 0.1955566...	embed
62249261_c1	62249261	haskell	1	being true. The fix was to change: gotHit = if isUp==True && wasHit==False to gotHit = if up==True && wasHit==False I don't see why the first way is a problem though. Shouldn't "isUp" get evaluated when it needs to be? You can probably imagine the information overload and completely tangent information when trying to ...	being true. The fix was to change: gotHit = if isUp==True && wasHit==False to gotHit = if up==True && wasHit==False I don't see why the first way is a problem though. Shouldn't "isUp" get evaluated when it needs to be? You can probably imagine the information overload and completely tangent information when trying to ...	[ -0.00885009765625, 0.01318359375, 0.02294921875, -0.006622314453125, -0.005828857421875, 0.0166015625, 0.0230712890625, -0.006805419921875, 0.00958251953125, 0.0208740234375, -0.0048828125, 0.002960205078125, 0.0194091796875, -0.0101318359375, -0.0009307861328125, 0.000946044921875, ...	[ 8035, 29568, 30022, 15549, 4163, 841, 217, 2203, 2174, 83, 53234, 69112, 618, 882, 1230, 509, 17647, 11971, 1257, 1957, 3917, 2967, 151117, 164, 2046, 151575, 297, 3229, 27117, 186, 28987, 4677, 645, 63033, 25269, 26484, 10557, 142508, 2460...	[ 0.1800537109375, 0.2275390625, 0.1597900390625, 0.09173583984375, 0.16552734375, 0.2086181640625, 0.226806640625, 0.0631103515625, 0.1416015625, 0.1575927734375, 0.2491455078125, 0.043060302734375, 0.04339599609375, 0.2025146484375, 0.039337158203125, 0.1461181640625, 0.0955810546875...	embed
38301455_c1	38301455	haskell	1	start end sess lt checksum):acc) Code signals: ErrorError, direct-sqlite, Text.Regex.Base.RegexLike, qualified, Database.SQLite3, segments, SQLite, REGEXP, Text.Regex.PCRE.ByteString, PCRE, UmeQuery, Text, SQLData, Show, Segment, SegmentLabel, SegmentStart, SegmentEnd, Session, LabelType, Checksum, FilePath, Database,...	start end sess lt checksum):acc) Code signals: ErrorError, direct-sqlite, Text.Regex.Base.RegexLike, qualified, Database.SQLite3, segments, SQLite, REGEXP, Text.Regex.PCRE.ByteString, PCRE, UmeQuery, Text, SQLData, Show, Segment, SegmentLabel, SegmentStart, SegmentEnd, Session, LabelType, Checksum, FilePath, Database,...	[ -0.00099945068359375, 0.0194091796875, 0.0118408203125, 0.0262451171875, 0.0059814453125, 0.00101470947265625, 0.000591278076171875, 0.000301361083984375, 0.016845703125, 0.00482177734375, 0.01336669921875, 0.001678466796875, 0.029296875, -0.000058650970458984375, -0.003448486328125, -...	[ 4034, 3564, 3401, 7, 96, 18, 12765, 11832, 2077, 10060, 16, 28864, 26073, 212059, 18468, 31611, 8951, 95255, 67, 24129, 54601, 3355, 63473, 156607, 217225, 187781, 158897, 1486, 363, 33180, 80866, 60280, 26939, 683, 11766, 5, 71713, 2793, 1...	[ 0.142822265625, 0.1634521484375, 0.1312255859375, 0.113037109375, 0.0194091796875, 0.11083984375, 0.2259521484375, 0.2822265625, 0.048248291015625, 0.049774169921875, 0.0015869140625, 0.249267578125, 0.274169921875, 0.139404296875, 0.0814208984375, 0.136962890625, 0.1654052734375, ...	embed
4981817_c0	4981817	haskell	0	Title: Generalized foldr function for trees? Problem title: Generalized foldr function for trees? Tags: tree, haskell, fold Problem: Generalized foldr function for trees? How can I write a generalized foldr function for generic Haskell trees? data (Eq a, Show a) => Tree a = Void \| Node a [Tree a] deriving (Eq, Show) tr...	Generalized foldr function for trees? Generalized foldr function for trees? tree haskell fold Generalized Show Tree Node Generalized foldr function for trees? How can I write a generalized foldr function for generic Haskell trees? I'm stuck at the first argument definition... EDIT : what about a more generalized versio...	[ 0.004608154296875, 0.0113525390625, 0.006622314453125, -0.0159912109375, 0.006561279296875, 0.008544921875, -0.024169921875, -0.01806640625, 0.001220703125, -0.0198974609375, -0.00653076171875, -0.0281982421875, -0.01068115234375, 0.0059814453125, -0.00060272216796875, 0.00042152404785...	[ 9082, 29367, 18344, 7569, 32354, 100, 1360, 90, 53201, 1556, 142508, 42822, 17367, 101344, 438, 112, 11249, 33022, 4537, 189534, 20625, 179933, 10750, 80934, 11389, 71864, 5303 ]	[ 0.112060546875, 0.1112060546875, 0.1285400390625, 0.197509765625, 0.1888427734375, 0.0819091796875, 0.1934814453125, 0.069580078125, 0.147216796875, 0.083251953125, 0.1968994140625, 0.1588134765625, 0.122314453125, 0.197265625, 0.066650390625, 0.07275390625, 0.006134033203125, 0.10...	embed
42735454_c0	42735454	haskell	0	Title: Haskell log viewer Problem title: Haskell log viewer Tags: apache-chainsaw, logging, haskell Problem: Haskell log viewer I implemented logging in my program using HSLogger . I use Chainsaw to view the logs. A first concern is that the logs are not updated in real time when I use the option "Open remote log4J Fil...	Haskell log viewer Haskell log viewer apache-chainsaw logging haskell Haskell Haskell log viewer I implemented logging in my program using HSLogger . I use Chainsaw to view the logs. A first concern is that the logs are not updated in real time when I use the option "Open remote log4J File". Other concerns is that HSLo...	[ -0.00121307373046875, 0.031982421875, 0.00982666015625, -0.0108642578125, 0.0247802734375, 0.01300048828125, -0.015869140625, 0.00689697265625, -0.012939453125, -0.03857421875, 0.00555419921875, -0.012451171875, 0.0120849609375, -0.0213623046875, 0.0185546875, -0.0101318359375, -0.02...	[ 20625, 142508, 12684, 21455, 56, 2241, 1430, 115097, 7, 15519, 459, 36659, 1556, 29479, 1528, 17368, 39718, 113972, 1505, 4527, 4841, 55588, 434, 50509, 959, 150011, 2773, 1733, 35829, 103264, 148814, 617, 1375, 42724, 8060, 4734, 13146, 3720...	[ 0.1307373046875, 0.23095703125, 0.18359375, 0.2149658203125, 0.0791015625, 0.0860595703125, 0.073486328125, 0.1787109375, 0.054656982421875, 0.2239990234375, 0.173095703125, 0.140869140625, 0.123046875, 0.11083984375, 0.0794677734375, 0.03961181640625, 0.1282958984375, 0.1724853515...	embed
10447924_c0	10447924	haskell	0	Title: Removes occurrences a given element within a list of lists Problem title: Removes occurrences a given element within a list of lists Tags: haskell Problem: Removes occurrences a given element within a list of lists I have this function which removes occurrences of a given element within the list of lists. remove...	Removes occurrences a given element within a list of lists Removes occurrences a given element within a list of lists haskell an Removes Can Removes occurrences a given element within a list of lists I have this function which removes occurrences of a given element within the list of lists. How would I be able to do th...	[ -0.0135498046875, 0.018798828125, 0.006988525390625, -0.000041484832763671875, -0.00970458984375, -0.0072021484375, 0.01312255859375, 0.0086669921875, -0.0137939453125, -0.00408935546875, -0.003143310546875, 0.010009765625, 0.005584716796875, -0.0031280517578125, -0.02587890625, -0.007...	[ 181139, 7, 74918, 42, 69098, 34475, 12830, 28032, 5303, 111, 1556, 142508, 142, 4171, 10, 765, 903, 32354, 87388, 19048, 54, 5701, 17368, 32036, 46683, 3220, 6889 ]	[ 0.2861328125, 0.115234375, 0.187255859375, 0.1363525390625, 0.1356201171875, 0.1192626953125, 0.1671142578125, 0.1715087890625, 0.215576171875, 0.095703125, 0.154052734375, 0.2298583984375, 0.041778564453125, 0.1663818359375, 0.000823974609375, 0.0252227783203125, 0.024993896484375, ...	embed
11237307_c0	11237307	haskell	0	Title: Haskell, mongodb, date Problem title: Haskell, mongodb, date Tags: haskell, mongodb, bson Problem: Haskell, mongodb, date How would I insert or auto insert date into mongodb from haskell? What is the best way to convert from mongo date type to haskell data type? Say, in a situation where I insert blog post recor...	Haskell, mongodb, date Haskell, mongodb, date haskell mongodb bson Haskell Haskell, mongodb, date How would I insert or auto insert date into mongodb from haskell? What is the best way to convert from mongo date type to haskell data type? Say, in a situation where I insert blog post records (any haskell web framework) ...	[ 0.01129150390625, -0.0068359375, 0.0157470703125, 0.0159912109375, -0.0201416015625, 0.01446533203125, -0.0262451171875, -0.01043701171875, -0.01513671875, -0.02880859375, 0.012451171875, -0.004730224609375, 0.009765625, -0.0263671875, -0.01190185546875, 0.003936767578125, -0.0080566...	[ 20625, 142508, 2667, 7803, 275, 5622, 1556, 876, 1681, 11249, 2806, 183540, 707, 1809, 3934, 1295, 2965, 3917, 96760, 14896, 31, 10644, 47, 2053, 1415, 1305, 115923, 1467, 170846, 3444, 106507, 11907, 17164, 191082, 1672, 142477, 166635, 2803...	[ 0.1502685546875, 0.264404296875, 0.124755859375, 0.1627197265625, 0.2198486328125, 0.18994140625, 0.147705078125, 0.010162353515625, 0.13525390625, 0.00048828125, 0.0321044921875, 0.1668701171875, 0.0158538818359375, 0.1700439453125, 0.093505859375, 0.08148193359375, 0.06256103515625...	embed
24585951_c0	24585951	haskell	0	Title: Cannot call function to concatenate it with a string Problem title: Cannot call function to concatenate it with a string Tags: haskell Problem: Cannot call function to concatenate it with a string This error doesn't make sense for me: url1 = "https://someUrl.com/" url2 = url1 ++ "/fdsfdsfd/fdsgfdgfd" No instance...	Cannot call function to concatenate it with a string Cannot call function to concatenate it with a string haskell a Cannot url1 someUrl.com url2 Num Char Possible Cannot call function to concatenate it with a string This error doesn't make sense for me: What's the matter? Syntax-wise, everything is ok, isn't it?	[ -0.0007171630859375, -0.00860595703125, 0.00144195556640625, 0.021240234375, -0.0101318359375, 0.017578125, -0.0030517578125, 0.005126953125, 0.0029144287109375, -0.041015625, -0.027099609375, -0.058349609375, 0.003387451171875, 0.000591278076171875, 0.004974365234375, -0.03271484375, ...	[ 4171, 10869, 11782, 32354, 47, 158, 33478, 76, 67, 442, 678, 79315, 1556, 142508, 25002, 418, 3060, 48743, 141, 277, 304, 52782, 21656, 115861, 18499, 10422, 26866, 86531, 26818, 3664 ]	[ 0.09375, 0.188232421875, 0.182373046875, 0.2041015625, 0.01959228515625, 0.108154296875, 0.181884765625, 0.13134765625, 0.04669189453125, 0.012176513671875, 0.130859375, 0.2159423828125, 0.126953125, 0.2113037109375, 0.1304931640625, 0.0870361328125, 0.09405517578125, 0.09118652343...	embed
39549204_c0	39549204	haskell	0	Title: Haskell about how to separate the last number from a string number Problem title: Haskell about how to separate the last number from a string number Tags: haskell Problem: Haskell about how to separate the last number from a string number I have a question about haskell in seperation the last number from a strin...	Haskell about how to separate the last number from a string number Haskell about how to separate the last number from a string number haskell a Haskell Haskell about how to separate the last number from a string number I have a question about haskell in seperation the last number from a string number. For example, inpu...	[ 0.003173828125, -0.002685546875, -0.01251220703125, -0.000274658203125, -0.028564453125, 0.02490234375, -0.002288818359375, -0.0072021484375, 0.00141143798828125, -0.01416015625, -0.0093994140625, -0.0341796875, -0.006622314453125, 0.00860595703125, -0.0223388671875, -0.0162353515625, ...	[ 20625, 142508, 1672, 3642, 84797, 4568, 14012, 1295, 79315, 1556, 10, 87, 9655, 40, 1264, 2320, 70, 107730, 83, 190875, 140992, 21204, 82449, 56037, 1284, 959, 4488 ]	[ 0.1318359375, 0.2138671875, 0.03302001953125, 0.04833984375, 0.20361328125, 0.226318359375, 0.19482421875, 0.1226806640625, 0.2037353515625, 0.1346435546875, 0.004486083984375, 0.0029296875, 0.045318603515625, 0.06671142578125, 0.1597900390625, 0.0560302734375, 0.0025634765625, 0.1...	embed
46789241_c0	46789241	haskell	0	Title: Redirections in Servant Problem title: Redirections in Servant Tags: haskell, servant Problem: Redirections in Servant What's the appropriate way to make a Servant handler respond with a redirection? I am working in a navigation REST app and I would like to respond to POST requests that create resources with a r...	Redirections in Servant Redirections in Servant haskell servant Redirections Servant Redirections in Servant What's the appropriate way to make a Servant handler respond with a redirection? I am working in a navigation REST app and I would like to respond to POST requests that create resources with a redirection to the...	[ -0.0162353515625, 0.0013275146484375, 0.02294921875, -0.00341796875, -0.010009765625, -0.0177001953125, -0.0201416015625, -0.01434326171875, -0.00286865234375, -0.0093994140625, 0.01068115234375, -0.006439208984375, 0.0003566741943359375, 0.00927734375, 0.00311279296875, 0.008911132812...	[ 853, 80581, 17514, 23, 5406, 30624, 1556, 142508, 187646, 95307, 3917, 3249, 35863, 35644, 678, 456, 936, 58994, 20697, 134470, 21828, 4027, 81903, 50336, 28282, 65514, 42518, 79794, 177953, 5303, 60875, 248, 3584, 232, 5608, 47, 7103, 105233...	[ 0.1416015625, 0.24072265625, 0.086181640625, 0.056640625, 0.17236328125, 0.242431640625, 0.1171875, 0.164794921875, 0.2171630859375, 0.0924072265625, 0.047454833984375, 0.07354736328125, 0.1990966796875, 0.2056884765625, 0.0572509765625, 0.149169921875, 0.1890869140625, 0.164184570...	embed
3177545_c0	3177545	haskell	0	Title: Haskell sorting of an unorderable list using a proxy order Problem title: Haskell sorting of an unorderable list using a proxy order Tags: haskell, sorting Problem: Haskell sorting of an unorderable list using a proxy order Suppose I have x :: [(n, a)] where n is a number and a is an unorderable item (is not of ...	Haskell sorting of an unorderable list using a proxy order Haskell sorting of an unorderable list using a proxy order haskell sorting a Haskell Haskell sorting of an unorderable list using a proxy order Suppose I have x :: [(n, a)] where n is a number and a is an unorderable item (is not of class Ord). I want to sort t...	[ 0.00131988525390625, 0.0233154296875, 0.00604248046875, -0.031982421875, -0.00909423828125, -0.0086669921875, -0.01470947265625, -0.0137939453125, 0.01031494140625, -0.0111083984375, -0.0244140625, -0.00543212890625, 0.016845703125, -0.00390625, -0.001434326171875, -0.0181884765625, ...	[ 20625, 142508, 12096, 214, 51, 80596, 2886, 5303, 17368, 502, 50878, 12989, 111, 1556, 10, 765, 1022, 1984, 19, 653, 14012, 83, 35735, 959, 18507, 35379, 3444, 390, 53418, 6637, 831, 91995, 136044, 93457, 3525, 6506, 37202, 1884, 70425, 2...	[ 0.126708984375, 0.2039794921875, 0.2225341796875, 0.049163818359375, 0.104736328125, 0.181640625, 0.1541748046875, 0.1744384765625, 0.02545166015625, 0.147216796875, 0.2484130859375, 0.2037353515625, 0.027191162109375, 0.132568359375, 0.0909423828125, 0.03216552734375, 0.083984375, ...	embed
61534034_c0	61534034	haskell	0	Title: file descriptor out of range for select - Recompile with -threaded to work around this Problem title: file descriptor out of range for select - Recompile with -threaded to work around this Tags: haskell Problem: file descriptor out of range for select - Recompile with -threaded to work around this I had a Haskel...	file descriptor out of range for select - Recompile with -threaded to work around this file descriptor out of range for select - Recompile with -threaded to work around this haskell Recompile file descriptor out of range for select - Recompile with -threaded to work around this I had a Haskell application crash today w...	[ 0.00958251953125, 0.00469970703125, -0.0033721923828125, 0.01202392578125, -0.004425048828125, -0.006378173828125, -0.016845703125, 0.032470703125, 0.00213623046875, -0.034423828125, 0.013916015625, -0.028564453125, -0.01458740234375, 0.00823974609375, 0.00592041015625, -0.006469726562...	[ 11435, 104, 121707, 1810, 111, 37457, 100, 36849, 853, 58875, 1340, 678, 20, 927, 39116, 297, 4488, 10932, 903, 1556, 142508, 20625, 38415, 150631, 18925, 18499, 26008, 831, 86869, 4865, 14602, 29459 ]	[ 0.1444091796875, 0.08270263671875, 0.2462158203125, 0.1463623046875, 0.1416015625, 0.2008056640625, 0.0226287841796875, 0.1605224609375, 0.08099365234375, 0.1236572265625, 0.1380615234375, 0.06292724609375, 0.0833740234375, 0.07513427734375, 0.2265625, 0.211669921875, 0.0358581542968...	embed
69553129_c0	69553129	haskell	0	Title: tryhaskell.org does not seem to support GHCi commands Problem title: tryhaskell.org does not seem to support GHCi commands Tags: ghci, haskell Problem: tryhaskell.org does not seem to support GHCi commands When I use GHCi commands (i.e. any command starting with ":" for example :set +t ) on https://tryhaskell.or...	tryhaskell.org does not seem to support GHCi commands tryhaskell.org does not seem to support GHCi commands ghci haskell tryhaskell.org GHCi tryhaskell.org does not seem to support GHCi commands When I use GHCi commands (i.e. any command starting with ":" for example :set +t ) on https://tryhaskell.org/ I get an error:...	[ -0.002593994140625, 0.00909423828125, -0.00115203857421875, 0.01226806640625, 0.0011138916015625, -0.00174713134765625, -0.00970458984375, -0.002349853515625, -0.00872802734375, -0.0181884765625, 0.0040283203125, -0.039794921875, 0.00994873046875, 0.00933837890625, 0.004913330078125, 0...	[ 9790, 10557, 142508, 1478, 959, 48903, 8060, 527, 73265, 14, 75101, 31380, 318, 1556, 4527, 2499, 72134, 678, 12, 3509, 997, 18, 15123, 18499, 209806, 903, 5608, 4488, 53418, 5045, 4677, 37842, 107, 2424 ]	[ 0.166748046875, 0.1190185546875, 0.2451171875, 0.145263671875, 0.07220458984375, 0.0382080078125, 0.1787109375, 0.1046142578125, 0.15478515625, 0.20751953125, 0.2208251953125, 0.1107177734375, 0.1121826171875, 0.10791015625, 0.07080078125, 0.001373291015625, 0.0887451171875, 0.0321...	embed
64589261_c0	64589261	haskell	0	Title: Haskell: treat newtype as String Problem title: Haskell: treat newtype as String Tags: haskell Problem: Haskell: treat newtype as String I often have this simple pattern: newtype Username = Username Text The purpose is of course to increase security when manipulating "Username" and not mix it with other fields. ...	Haskell: treat newtype as String Haskell: treat newtype as String haskell Haskell Username Text Haskell: treat newtype as String I often have this simple pattern: The purpose is of course to increase security when manipulating "Username" and not mix it with other fields. However, packing and unpacking it all the time b...	[ 0.010986328125, -0.0172119140625, 0.015625, 0.0322265625, -0.0019378662109375, 0.027099609375, 0.000579833984375, 0.00098419189453125, 0.004669189453125, 0.011962890625, 0.008544921875, -0.02587890625, -0.0028839111328125, 0.00107574462890625, -0.016845703125, -0.00616455078125, 0.01...	[ 20625, 142508, 85689, 3525, 50986, 237, 23351, 214, 1556, 53400, 11627, 24129, 27983, 8781, 103510, 60042, 51312, 48031, 45258, 1062, 2189, 17664, 44457, 43824, 29102, 1733, 24209, 120, 5670, 32195, 88308, 1957, 10, 1301, 71713, 9578, 63033, ...	[ 0.1170654296875, 0.2099609375, 0.1478271484375, 0.1348876953125, 0.286376953125, 0.1260986328125, 0.1929931640625, 0.1256103515625, 0.10162353515625, 0.1375732421875, 0.2164306640625, 0.1640625, 0.0816650390625, 0.049285888671875, 0.1435546875, 0.114990234375, 0.1123046875, 0.11962...	embed
13892337_c0	13892337	haskell	0	Title: Why does haskell evaluate a in a >> b? Problem title: Why does haskell evaluate a in a >> b? Tags: functional-programming, operators, monads, haskell Problem: Why does haskell evaluate a in a >> b? The >> operator for Monads in haskell is often defined as (>>) :: m a -> m b -> m b a >> b = a >>= \_ -...	Why does haskell evaluate a in a >> b? Why does haskell evaluate a in a >> b? functional-programming operators monads haskell Why Why does haskell evaluate a in a >> b? The >> operator for Monads in haskell is often defined as It can be used to print things like Why does the compiler not optimize away the v...	[ -0.00421142578125, -0.0029449462890625, 0.024169921875, 0.018310546875, 0.0091552734375, -0.006683349609375, -0.005584716796875, -0.01611328125, 0.006866455078125, 0.01226806640625, -0.00872802734375, -0.003143310546875, -0.003509521484375, 0.00168609619140625, 0.0014190673828125, -0.0...	[ 44084, 1556, 142508, 151575, 13, 10, 23, 5386, 1230, 876, 619, 123309, 28966, 39933, 2667, 712, 14602, 6396, 60331, 6468, 27983, 61924, 831, 11814, 28412, 9969, 34759, 959, 15572, 16065, 34292, 3884, 71713, 3584, 31, 866, 19, 1299, 3871, ...	[ 0.1448974609375, 0.1536865234375, 0.25927734375, 0.195068359375, 0.059967041015625, 0.0963134765625, 0.0943603515625, 0.1402587890625, 0.013397216796875, 0.126220703125, 0.004791259765625, 0.1129150390625, 0.05621337890625, 0.22900390625, 0.08642578125, 0.111083984375, 0.022842407226...	embed
35112489_c0	35112489	haskell	0	Title: Geometric point data type - tuple vs record? Problem title: Geometric point data type - tuple vs record? Tags: haskell Problem: Geometric point data type - tuple vs record? I can think of three ways to define a geometric point as an algebraic data type in Haskell. I want to define it as an algebraic data type fo...	Geometric point data type - tuple vs record? Geometric point data type - tuple vs record? haskell Geometric Point Geometric point data type - tuple vs record? I can think of three ways to define a geometric point as an algebraic data type in Haskell. I want to define it as an algebraic data type for better documentatio...	[ 0.01806640625, 0.00982666015625, -0.002349853515625, 0.0037384033203125, -0.00189208984375, -0.000675201416015625, -0.005126953125, 0.0014495849609375, 0.009033203125, 0.01373291015625, -0.0025177001953125, -0.0184326171875, -0.0079345703125, 0.008544921875, -0.021728515625, 0.00331115...	[ 30152, 186518, 6275, 2053, 10644, 370, 8705, 20209, 17164, 1556, 142508, 41097, 831, 5351, 17262, 48322, 61924, 10, 84183, 238, 237, 144, 429, 2844, 1771, 23, 20625, 11522, 209806, 1301, 4331, 40946, 15400 ]	[ 0.13671875, 0.22265625, 0.177734375, 0.160400390625, 0.19482421875, 0.1192626953125, 0.1968994140625, 0.1138916015625, 0.236572265625, 0.1146240234375, 0.2340087890625, 0.169921875, 0.00146484375, 0.0198822021484375, 0.08111572265625, 0.050506591796875, 0.11962890625, 0.01496887207...	embed
50159349_c1	50159349	haskell	1	and it would readily be accepted if I could write g like this: g :: (forall f. Functor f => Secret f) -> Int g h = f 4 (\\f -> h @f) Where \\ is hypothetical syntax for System Fw's big lambda, i.e. type abstraction. I can emulate this with ugly Proxy s, but is there some other GHC Haskell feature that let's me write s...	and it would readily be accepted if I could write g like this: g :: (forall f. Functor f => Secret f) -> Int g h = f 4 (\\f -> h @f) Where \\ is hypothetical syntax for System Fw's big lambda, i.e. type abstraction. I can emulate this with ugly Proxy s, but is there some other GHC Haskell feature that let's me write s...	[ -0.000637054443359375, 0.01092529296875, -0.02392578125, -0.0322265625, 0.01251220703125, -0.016845703125, -0.005828857421875, 0.0208740234375, 0.00921630859375, -0.0045166015625, -0.005615234375, -0.01123046875, 0, 0.00421142578125, 0.003387451171875, -0.00738525390625, -0.005798339...	[ 2806, 12301, 20102, 186, 68186, 71, 2174, 5809, 33022, 706, 1884, 903, 1984, 5584, 1238, 28670, 18770, 39008, 33079, 360, 18, 1096, 2203, 201, 420, 1374, 18991, 170933, 70760, 6002, 86531, 12353, 563, 434, 6957, 21, 6492, 85, 10644, 16478...	[ 0.009429931640625, 0.03375244140625, 0.0291595458984375, 0.0157470703125, 0.08599853515625, 0.0167083740234375, 0.005462646484375, 0.0765380859375, 0.173095703125, 0.1644287109375, 0.1143798828125, 0.09490966796875, 0.122802734375, 0.1014404296875, 0.1038818359375, 0.119140625, 0.126...	embed
72738622_c1	72738622	haskell	1	single pattern function match case that can take care of #3, I can't think of a way for #4 to work, as I think I would be forced to build a list while traversing the given list. But the list being built might not even be returned if a PCall is found, which means extra work was done for nothing. How should I go about t...	single pattern function match case that can take care of #3, I can't think of a way for #4 to work, as I think I would be forced to build a list while traversing the given list. But the list being built might not even be returned if a PCall is found, which means extra work was done for nothing. How should I go about t...	[ -0.02978515625, 0.0164794921875, 0.0032806396484375, -0.0020599365234375, 0.00167083740234375, 0.01031494140625, -0.0196533203125, -0.01214599609375, 0.03173828125, -0.01495361328125, 0.022216796875, -0.0155029296875, 0.01055908203125, -0.017822265625, -0.00811767578125, 0.003234863281...	[ 11001, 103510, 32354, 14858, 7225, 831, 5646, 517, 111378, 18, 5351, 3917, 468, 617, 4488, 168861, 45367, 5303, 37317, 34475, 88303, 13648, 959, 176377, 6107, 5584, 14037, 4173, 33720, 1672, 903, 61924, 15700, 30793, 29479, 28864, 26073, 9876...	[ 0.1895751953125, 0.2498779296875, 0.1663818359375, 0.18603515625, 0.15087890625, 0.027374267578125, 0.0203094482421875, 0.11767578125, 0.1246337890625, 0.006103515625, 0.0538330078125, 0.032440185546875, 0.0162811279296875, 0.179443359375, 0.07421875, 0.0565185546875, 0.1044311523437...	embed
30260610_c1	30260610	haskell	1	Ref treeRef UI.liftIO $ writeFile ".Hoed/debugTree.dot" (shw $ summarize tree mcv) UI.liftIO $ system $ "dot -Tpng -Gsize=9,5 -Gdpi=100 .Hoed/debugTree.dot " ++ "> .Hoed/wwwroot/debugTree.png" UI.element img # UI.set UI.src "static/debugTree.png" return () My full code for Threepenny-gui 0.5 is here: https://github.com...	Ref treeRef UI.liftIO $ writeFile ".Hoed/debugTree.dot" (shw $ summarize tree mcv) UI.liftIO $ system $ "dot -Tpng -Gsize=9,5 -Gdpi=100 .Hoed/debugTree.dot " ++ "> .Hoed/wwwroot/debugTree.png" UI.element img # UI.set UI.src "static/debugTree.png" return () My full code for Threepenny-gui 0.5 is here: https://github.com...	[ -0.008056640625, 0.0255126953125, -0.007537841796875, -0.00159454345703125, 0.0125732421875, 0.0145263671875, -0.0184326171875, -0.020263671875, 0.0014495849609375, -0.0157470703125, 0.002777099609375, -0.0093994140625, 0.015869140625, 0.01312255859375, 0.0179443359375, -0.0048828125, ...	[ 53295, 53201, 190015, 111481, 104501, 17780, 3650, 33022, 174350, 11193, 297, 112, 85779, 62731, 13, 15464, 434, 29334, 14096, 334, 5426, 128468, 62539, 93754, 1434, 3559, 37223, 1574, 148920, 62766, 566, 3509, 19437, 201939, 30646, 4393, 18151...	[ 0.235107421875, 0.2188720703125, 0.2900390625, 0.1700439453125, 0.224853515625, 0.23388671875, 0.0760498046875, 0.146484375, 0.207275390625, 0.1170654296875, 0.1932373046875, 0.1416015625, 0.2430419921875, 0.23828125, 0.1085205078125, 0.1497802734375, 0.03399658203125, 0.1350097656...	embed
31274733_c0	31274733	haskell	0	Title: Haskell and Emacs Problem title: Haskell and Emacs Tags: haskell-mode, emacs, haskell Problem: Haskell and Emacs I'm trying to learn Haskell. I have configured Emacs for Haskell development, I followed this blog post: http://tim.dysinger.net/posts/2014-02-18-haskell-with-emacs.html The system works but I always ...	Haskell and Emacs Haskell and Emacs haskell-mode emacs haskell Haskell Emacs Haskell and Emacs I'm trying to learn Haskell. I have configured Emacs for Haskell development, I followed this blog post: http://tim.dysinger.net/posts/2014-02-18-haskell-with-emacs.html The system works but I always get this error: I looked ...	[ 0.0096435546875, -0.0024261474609375, 0.0010223388671875, -0.0089111328125, -0.0040283203125, 0.034423828125, -0.0206298828125, 0.00653076171875, -0.00274658203125, -0.018798828125, -0.0011749267578125, -0.0164794921875, 0.00860595703125, 0.01385498046875, -0.006011962890625, -0.009704...	[ 20625, 142508, 136, 85269, 4439, 1556, 61170, 352, 2263, 31577, 30698, 222495, 34754, 134629, 1415, 1305, 5083, 21228, 1819, 10557, 76228, 11883, 5426, 43240, 1284, 11343, 903, 18499, 87, 54811, 1257, 102158, 77336, 61924, 959, 3714, 15400, 1...	[ 0.1611328125, 0.262939453125, 0.0985107421875, 0.191162109375, 0.1876220703125, 0.16455078125, 0.150146484375, 0.11767578125, 0.1099853515625, 0.037109375, 0.06695556640625, 0.142822265625, 0.09478759765625, 0.055816650390625, 0.015716552734375, 0.014862060546875, 0.07196044921875, ...	embed
13078583_c0	13078583	haskell	0	Title: Haskell recursion ":" replaced by \|\| why? Problem title: Haskell recursion ":" replaced by \|\| why? Tags: recursion, haskell Problem: Haskell recursion ":" replaced by \|\| why? I have a question why this function cannot work with ":" but works with \|\| and why ":" is replaced by \|\| I mean why ca...	Haskell recursion ":" replaced by \|\| why? Haskell recursion ":" replaced by \|\| why? recursion haskell Haskell Bool y:ys Haskell recursion ":" replaced by \|\| why? I have a question why this function cannot work with ":" but works with \|\| and why ":" is replaced by \|\| I mean why cannot write contains ...	[ -0.01129150390625, 0.0016937255859375, 0.0005950927734375, 0.0150146484375, -0.006072998046875, -0.007476806640625, 0.0025787353515625, -0.019287109375, -0.00640869140625, -0.000705718994140625, 0.006500244140625, 0.003448486328125, 0.0213623046875, -0.0194091796875, 0.0223388671875, -...	[ 20625, 142508, 195625, 1830, 41502, 12, 1230, 91995, 71, 15400, 1556, 2460, 929, 113, 4778, 9655, 903, 32354, 53418, 4488, 678, 1284, 43240, 33022, 70541, 7, 1022, 53, 183114 ]	[ 0.1451416015625, 0.23779296875, 0.2371826171875, 0.1103515625, 0.09326171875, 0.1766357421875, 0.04376220703125, 0.14013671875, 0.018218994140625, 0.1258544921875, 0.1260986328125, 0.0677490234375, 0.1729736328125, 0.08160400390625, 0.1473388671875, 0.030242919921875, 0.0560913085937...	embed
9849355_c1	9849355	haskell	1	", and end it there. It sort of does, I do get 1, 2 in the list, but why is it not exhaustive? Thanks in advanced. Thank you for the help Tikhon changed my function to this: data Tree a = Empty \| Branch a (Tree a) (Tree a) deriving (Show, Eq) internals :: Tree a -> [a] internals (Branch a Empty Empty) = [] internals (B...	", and end it there. It sort of does, I do get 1, 2 in the list, but why is it not exhaustive? Thanks in advanced. Thank you for the help Tikhon changed my function to this: data Tree a = Empty \| Branch a (Tree a) (Tree a) deriving (Show, Eq) internals :: Tree a -> [a] internals (Branch a Empty Empty) = [] internals (B...	[ -0.005279541015625, -0.0125732421875, 0.000408172607421875, 0.01519775390625, 0.0074462890625, 0.03125, -0.01300048828125, -0.017822265625, -0.004119873046875, -0.0252685546875, 0.004180908203125, -0.0007781982421875, 0.0118408203125, 0.0113525390625, 0.027099609375, 0.013671875, 0.0...	[ 44, 136, 3564, 442, 2685, 1650, 12096, 14602, 2046, 106, 116, 5303, 1284, 15400, 83, 959, 146353, 5844, 175961, 4358, 2371, 68384, 98816, 759, 32354, 47, 903, 2053, 101344, 10, 2203, 31678, 939, 21110, 206, 62731, 16406, 6496, 168660, 864...	[ 0.0743408203125, 0.003753662109375, 0.181884765625, 0.05029296875, 0.10601806640625, 0.0194549560546875, 0.0347900390625, 0.0870361328125, 0.047454833984375, 0.0153350830078125, 0.044891357421875, 0.138916015625, 0.005523681640625, 0.099609375, 0.0634765625, 0.158203125, 0.23046875, ...	embed
65445169_c0	65445169	haskell	0	Title: Question about the argument type of sqrt and round Problem title: Question about the argument type of sqrt and round Tags: types, haskell Problem: Question about the argument type of sqrt and round following the signature: sqrt :: Floating a => a -> a why is (sqrt 2) legal? Isn't the number 2 a Integer which def...	Question about the argument type of sqrt and round Question about the argument type of sqrt and round types haskell Question Floating RealFrac Integral Question about the argument type of sqrt and round following the signature: why is (sqrt 2) legal? Isn't the number 2 a Integer which definitely doesn't satisfy Floatin...	[ -0.000942230224609375, -0.0087890625, -0.00933837890625, 0.0174560546875, 0.0166015625, 0.00946044921875, -0.012451171875, -0.0167236328125, -0.00811767578125, 0.0126953125, -0.00799560546875, -0.04931640625, -0.01007080078125, 0.004486083984375, -0.01263427734375, -0.0068359375, -0....	[ 68185, 1672, 10750, 10644, 91, 864, 3198, 136, 68807, 52895, 1556, 142508, 38699, 26518, 5120, 919, 20251, 204681, 25632, 138256, 15400, 83, 7, 4958, 8437, 14012, 116, 10, 44401, 58621, 22027, 18, 40407, 30646, 27117, 4764 ]	[ 0.1260986328125, 0.0399169921875, 0.2249755859375, 0.1512451171875, 0.051300048828125, 0.1510009765625, 0.214111328125, 0.0927734375, 0.1953125, 0.1434326171875, 0.1043701171875, 0.2103271484375, 0.1268310546875, 0.10589599609375, 0.1212158203125, 0.0174713134765625, 0.1685791015625,...	embed
6172573_c0	6172573	haskell	0	Title: Haskell list comprehension Problem title: Haskell list comprehension Tags: haskell Problem: Haskell list comprehension sum1::[Int]->[Int] sum1 [] =0 sum1 (x:xs) = [x\|x<-xs,x `mod` 2 ==0] I need to return the numbers which are divisible by 2 when a list is provided, but the above code gives me this compile error:...	Haskell list comprehension Haskell list comprehension haskell Haskell sum1 x:xs Instance Num Haskell list comprehension I need to return the numbers which are divisible by 2 when a list is provided, but the above code gives me this compile error: Also please explain what (x:xs) does. Is it ' X element of xs list?' If w...	[ -0.02978515625, 0.0140380859375, 0.0230712890625, -0.00072479248046875, 0.01708984375, 0.041748046875, 0.00848388671875, 0.0166015625, 0.0169677734375, -0.01025390625, 0.004730224609375, -0.036376953125, 0.037109375, -0.004547119140625, -0.01373291015625, 0.0091552734375, 0.013305664...	[ 20625, 142508, 5303, 46683, 3220, 1556, 10554, 418, 1022, 12, 425, 7, 116071, 52782, 3871, 30646, 101935, 45, 99017, 390, 116, 62952, 70, 36917, 18151, 903, 9969, 1340, 18499, 73342, 14602, 1193, 12830, 111, 3444, 2046, 653, 927 ]	[ 0.1146240234375, 0.1756591796875, 0.1788330078125, 0.088623046875, 0.08941650390625, 0.1146240234375, 0.174072265625, 0.0294647216796875, 0.087890625, 0.1005859375, 0.171142578125, 0.1378173828125, 0.1611328125, 0.1314697265625, 0.045623779296875, 0.151611328125, 0.1527099609375, 0...	embed
33851495_c0	33851495	haskell	0	Title: Recurrence relations in haskell Problem title: Recurrence relations in haskell Tags: recurrence, haskell Problem: Recurrence relations in haskell I'm new to Haskell and still haven't figured out how to do anything realistic. I've looked at examples of recurrence relations but the implementation is too advanced f...	Recurrence relations in haskell Recurrence relations in haskell recurrence haskell Recurrence i-1 Recurrence relations in haskell I'm new to Haskell and still haven't figured out how to do anything realistic. I've looked at examples of recurrence relations but the implementation is too advanced for me at the moment. I'...	[ -0.0162353515625, -0.004241943359375, 0.003326416015625, 0.00836181640625, 0.0035552978515625, -0.013671875, -0.005218505859375, 0.00872802734375, 0.0004634857177734375, -0.01226806640625, -0.01458740234375, -0.0213623046875, -0.0016632080078125, 0.00457763671875, 0.01226806640625, -0....	[ 853, 64240, 6620, 91582, 23, 1556, 142508, 456, 17, 5759, 3525, 47, 20625, 7464, 38246, 26366, 61207, 27781, 208124, 5792, 175961, 3095, 5423, 1257, 41911, 52895, 107730, 1238, 132, 11, 4, 275, 61924, 442, 4537 ]	[ 0.1263427734375, 0.26220703125, 0.08184814453125, 0.2158203125, 0.04925537109375, 0.148681640625, 0.189697265625, 0.1258544921875, 0.0908203125, 0.09356689453125, 0.0634765625, 0.0272674560546875, 0.1265869140625, 0.006988525390625, 0.006561279296875, 0.052093505859375, 0.12341308593...	embed
2333613_c0	2333613	haskell	0	Title: Which tree-based dictionary is the easiest to implement functionally? Problem title: Which tree-based dictionary is the easiest to implement functionally? Tags: data-structures, haskell Problem: Which tree-based dictionary is the easiest to implement functionally? I'm looking for a tree-based dictionary data str...	Which tree-based dictionary is the easiest to implement functionally? Which tree-based dictionary is the easiest to implement functionally? data-structures haskell Which Which tree-based dictionary is the easiest to implement functionally? I'm looking for a tree-based dictionary data structure which is easy to implemen...	[ 0.032470703125, -0.000972747802734375, -0.0089111328125, -0.01519775390625, 0.00162506103515625, -0.0098876953125, -0.0030670166015625, -0.0106201171875, -0.0029144287109375, -0.01806640625, -0.0062255859375, -0.0301513671875, 0.00007295608520507812, 0.00994873046875, 0.0169677734375, ...	[ 130078, 53201, 9, 77007, 45, 10763, 6635, 70, 28, 1544, 525, 47, 29479, 123309, 538, 83, 2053, 137656, 1556, 142508, 16487, 45646, 23468, 20625, 16981, 62, 92414, 1360, 90, 45176, 47644, 91, 20706, 561, 22819 ]	[ 0.05322265625, 0.2327880859375, 0.03350830078125, 0.1617431640625, 0.115966796875, 0.1646728515625, 0.1453857421875, 0.033721923828125, 0.074462890625, 0.1619873046875, 0.13134765625, 0.046173095703125, 0.199951171875, 0.1387939453125, 0.017303466796875, 0.0198516845703125, 0.0985107...	embed
39251728_c0	39251728	haskell	0	Title: ghci randomio type inference Problem title: ghci randomio type inference Tags: ghci, haskell Problem: ghci randomio type inference I am following https://en.wikibooks.org/wiki/Haskell/Understanding_monads/State , and randomIO prints an integer in ghci directly. Given its type is polymorphic, how does ghci know i...	ghci randomio type inference ghci randomio type inference ghci haskell GHCi System.Random Random ghci randomio type inference I am following https://en.wikibooks.org/wiki/Haskell/Understanding_monads/State , and randomIO prints an integer in ghci directly. Given its type is polymorphic, how does ghci know it's Int here...	[ -0.005035400390625, -0.0169677734375, 0.0067138671875, 0.0252685546875, 0.00775146484375, 0.019287109375, 0.0084228515625, -0.00714111328125, -0.01220703125, -0.0211181640625, 0.00518798828125, -0.048828125, -0.00970458984375, 0.00506591796875, 0.0262451171875, -0.006256103515625, 0....	[ 31380, 318, 96759, 846, 10644, 53498, 6620, 1556, 142508, 527, 73265, 14, 12353, 126525, 3815, 39643, 306, 25632, 81415, 13691, 6495, 7, 7944, 144057, 87039, 6468, 135206, 17780, 28412, 892, 1505, 23, 105237, 35874, 178851, 1771, 3642, 14602,...	[ 0.1427001953125, 0.179931640625, 0.198974609375, 0.21435546875, 0.2332763671875, 0.2001953125, 0.083984375, 0.134033203125, 0.22216796875, 0.07012939453125, 0.107666015625, 0.190185546875, 0.1270751953125, 0.0623779296875, 0.07537841796875, 0.120361328125, 0.04119873046875, 0.05895...	embed
2763864_c0	2763864	haskell	0	Title: Multithreaded Haskell Problem title: Multithreaded Haskell Tags: multicore, haskell, parallel-processing, multithreading Problem: Multithreaded Haskell I'm learning Haskell and I'd like to write some multithreaded programs now to see the performance gains from that in a functional language. I can find some refer...	Multithreaded Haskell Multithreaded Haskell multicore haskell parallel-processing multithreading Multithreaded Haskell Multithreaded Haskell I'm learning Haskell and I'd like to write some multithreaded programs now to see the performance gains from that in a functional language. I can find some references to it on the...	[ -0.0004367828369140625, 0.0024261474609375, 0.003204345703125, 0.007049560546875, 0.0023040771484375, -0.00096893310546875, -0.01385498046875, -0.01220703125, -0.016357421875, -0.07080078125, 0.0022735595703125, -0.0196533203125, -0.01239013671875, 0.01214599609375, -0.00927734375, 0.0...	[ 19335, 927, 39116, 297, 20625, 142508, 6024, 30854, 1556, 95103, 63923, 3869, 65847, 11, 6238, 52080, 1884, 33022, 712, 103391, 5036, 1957, 23718, 21647, 123309, 46876, 91067, 442, 1820, 8306, 27798, 39864, 6275, 17997, 28219, 93002, 6002, 86...	[ 0.138671875, 0.05584716796875, 0.211181640625, 0.05596923828125, 0.15185546875, 0.2198486328125, 0.0960693359375, 0.1649169921875, 0.1376953125, 0.1392822265625, 0.0928955078125, 0.1595458984375, 0.19384765625, 0.06060791015625, 0.00921630859375, 0.0789794921875, 0.06671142578125, ...	embed
21799853_c0	21799853	haskell	0	Title: Define methods for subclasses of type classes Problem title: Define methods for subclasses of type classes Tags: haskell, typeclass Problem: Define methods for subclasses of type classes I tried this: class Functor f where fmap :: (a -> b) -> f a -> f b class (Functor f) => Applicative f where pure :: a -> f a (...	Define methods for subclasses of type classes Define methods for subclasses of type classes haskell typeclass Define Functor Applicative Define methods for subclasses of type classes I tried this: I got this: How to define fmap for Applicative and other subclasses of Functor ?	[ 0.00762939453125, 0.00653076171875, 0.005523681640625, 0.0272216796875, 0.010986328125, 0.007568359375, -0.004852294921875, 0.002044677734375, 0.00933837890625, 0.00787353515625, -0.01904296875, -0.03662109375, -0.0091552734375, 0.036376953125, -0.0172119140625, -0.00634765625, 0.015...	[ 262, 64552, 150624, 100, 1614, 67413, 90, 111, 10644, 61112, 1556, 142508, 28670, 18770, 5659, 11048, 4935, 37842, 903, 11249, 61924, 1238, 62346, 136 ]	[ 0.056396484375, 0.1634521484375, 0.21875, 0.0694580078125, 0.194580078125, 0.198486328125, 0.0574951171875, 0.043548583984375, 0.1734619140625, 0.1904296875, 0.118408203125, 0.1875, 0.12298583984375, 0.1807861328125, 0.1038818359375, 0.1470947265625, 0.1214599609375, 0.037231445312...	embed
22337214_c0	22337214	haskell	0	Title: Understanding Haskell Type Signatures Problem title: Understanding Haskell Type Signatures Tags: types, type-signature, haskell Problem: Understanding Haskell Type Signatures I am in the process of teaching myself Haskell and I was wondering about the following type signatures: Prelude> :t ($) ($) :: (a -> b) ->...	Understanding Haskell Type Signatures Understanding Haskell Type Signatures types type-signature haskell Understanding Haskell Type Signatures Prelude Understanding Haskell Type Signatures I am in the process of teaching myself Haskell and I was wondering about the following type signatures: How should I interpret (no ...	[ 0.0244140625, 0.01324462890625, 0.0030059814453125, 0.017333984375, -0.0203857421875, 0.0230712890625, -0.0007781982421875, 0.0093994140625, -0.0201416015625, -0.00604248046875, -0.0084228515625, -0.041259765625, -0.002105712890625, 0.016845703125, -0.00714111328125, 0.00445556640625, ...	[ 9626, 144057, 20625, 142508, 60457, 26729, 141762, 52895, 10644, 137432, 1556, 822, 128169, 149016, 25632, 138256, 5608, 29481, 1992, 179140, 450, 36137, 62318, 16750, 6496, 2638, 13894, 2069 ]	[ 0.100830078125, 0.0980224609375, 0.1175537109375, 0.196044921875, 0.1829833984375, 0.1162109375, 0.1566162109375, 0.20166015625, 0.1815185546875, 0.1658935546875, 0.119873046875, 0.044158935546875, 0.03778076171875, 0.037078857421875, 0.04168701171875, 0.20556640625, 0.01104736328125...	embed
29803664_c0	29803664	haskell	0	Title: haskell hGetLines implementation Problem title: haskell hGetLines implementation Tags: haskell, io, input Problem: haskell hGetLines implementation Does anyone know where can I find the hGetLine :: Handle -> IO Text function implementation? I have to implement a HTTP server in haskell which has multiple subtasks...	haskell hGetLines implementation haskell hGetLines implementation haskell io input Handle Text haskell hGetLines implementation Does anyone know where can I find the function implementation? I have to implement a HTTP server in haskell which has multiple subtasks. The first one is to write the implementation of a funct...	[ -0.00482177734375, 0.006744384765625, 0.014404296875, 0.0203857421875, -0.0159912109375, 0.03125, 0.00830078125, 0.01007080078125, -0.004913330078125, -0.0228271484375, 0.0008697509765625, -0.03271484375, -0.01470947265625, -0.002105712890625, 0.0120849609375, 0.025634765625, 0.01104...	[ 1556, 142508, 1096, 724, 126, 93232, 7, 208124, 22995, 107730, 10639, 133, 24129, 35672, 3714, 7440, 831, 87, 7413, 70, 32354, 765, 29479, 135913, 10723, 48716, 1614, 1073, 1224, 5117, 83, 33022, 12301, 26818, 1295, 17780, 86723, 24189, 201...	[ 0.1807861328125, 0.2237548828125, 0.1317138671875, 0.1556396484375, 0.1766357421875, 0.277587890625, 0.05328369140625, 0.2308349609375, 0.1856689453125, 0.150634765625, 0.1634521484375, 0.14306640625, 0.1763916015625, 0.02099609375, 0.06353759765625, 0.04547119140625, 0.0569458007812...	embed
3015173_c1	3015173	haskell	1	PotatoId = Database.Persist.Key Potato Question: Is there an easier way to get information on instances of type families and data families, using ghci or any other tool? Code signals: qualified, Database.Persist.Sqlite, Language.Haskell.TH, Data.List, Info, Maybe, Nothing, Just, Defined, Data.Maybe, Persist.Key, Potat...	PotatoId = Database.Persist.Key Potato Question: Is there an easier way to get information on instances of type families and data families, using ghci or any other tool? Code signals: qualified, Database.Persist.Sqlite, Language.Haskell.TH, Data.List, Info, Maybe, Nothing, Just, Defined, Data.Maybe, Persist.Key, Potat...	[ 0.03271484375, -0.0036468505859375, 0.001617431640625, -0.005401611328125, -0.017822265625, 0.01055908203125, 0.0106201171875, -0.0205078125, 0.0164794921875, -0.007568359375, 0.0059814453125, -0.02783203125, -0.003997802734375, -0.00130462646484375, -0.02734375, 0.005828857421875, 0...	[ 663, 28647, 568, 71, 2203, 187781, 15277, 57702, 162429, 68185, 2071, 2685, 99156, 3917, 47, 2046, 4677, 98, 110527, 111, 10644, 87143, 136, 2053, 17368, 31380, 318, 2499, 3789, 55516, 28864, 26073, 7, 217225, 95255, 67, 83658, 6495, 142508...	[ 0.132080078125, 0.2100830078125, 0.114501953125, 0.1531982421875, 0.025970458984375, 0.1578369140625, 0.1116943359375, 0.2115478515625, 0.16943359375, 0.052459716796875, 0.00445556640625, 0.0182952880859375, 0.1905517578125, 0.0755615234375, 0.0343017578125, 0.1328125, 0.201293945312...	embed
58064216_c0	58064216	haskell	0	Title: Difference between mod in the beggining of the operation or `mod` in the middle Problem title: Difference between mod in the beggining of the operation or `mod` in the middle Tags: operators, modulo, haskell Problem: Difference between mod in the beggining of the operation or `mod` in the middle I really don't k...	Difference between mod in the beggining of the operation or `mod` in the middle Difference between mod in the beggining of the operation or `mod` in the middle operators modulo haskell Difference Difference between mod in the beggining of the operation or `mod` in the middle I really don't know what's the difference be...	[ -0.00701904296875, -0.000560760498046875, 0.0146484375, -0.0029296875, 0.01019287109375, -0.00021457672119140625, 0.00775146484375, 0.0062255859375, 0.019775390625, -0.0341796875, 0.000720977783203125, -0.00091552734375, 0.0294189453125, 0.01556396484375, 0.01397705078125, -0.027832031...	[ 803, 18234, 6620, 17721, 2811, 23, 70, 186, 16680, 592, 41018, 707, 13415, 86991, 39933, 140807, 1556, 142508, 6183, 3714, 2367, 60212, 1632, 55300, 15700, 3060, 31380, 318, 4734, 43240, 2174, 4527, 136, 3789, 38, 4171, 176256, 4358, 73342,...	[ 0.1229248046875, 0.1961669921875, 0.1075439453125, 0.133056640625, 0.27197265625, 0.1158447265625, 0.045867919921875, 0.084716796875, 0.125244140625, 0.1026611328125, 0.2001953125, 0.03485107421875, 0.26708984375, 0.2271728515625, 0.19921875, 0.248779296875, 0.1490478515625, 0.2658...	embed
37545204_c0	37545204	haskell	0	Title: How to specify the instance from which a function is called Problem title: How to specify the instance from which a function is called Tags: haskell Problem: How to specify the instance from which a function is called Say I have a type class such that for every instance a of this type class I have a function f :...	How to specify the instance from which a function is called How to specify the instance from which a function is called haskell which How Bool Maybe How to specify the instance from which a function is called Say I have a type class such that for every instance a of this type class I have a function How can I call f? M...	[ 0.0128173828125, -0.01495361328125, 0.01519775390625, 0.00787353515625, -0.0093994140625, 0.0028076171875, 0.0020751953125, -0.005279541015625, 0.00885009765625, -0.01324462890625, -0.00958251953125, -0.0169677734375, -0.01202392578125, 0.00653076171875, 0.0098876953125, -0.03466796875...	[ 11249, 47, 40140, 18929, 70, 110527, 1295, 3129, 32354, 83, 35839, 1556, 142508, 2460, 929, 83425, 10, 765, 10644, 18507, 100, 11907, 903, 831, 87, 11782, 1238, 134995, 3642, 29459, 136, 959, 876, 2174, 15700, 23 ]	[ 0.09521484375, 0.0246734619140625, 0.2149658203125, 0.1444091796875, 0.040496826171875, 0.2802734375, 0.1805419921875, 0.093505859375, 0.2406005859375, 0.039703369140625, 0.1741943359375, 0.1751708984375, 0.26416015625, 0.07470703125, 0.14208984375, 0.1435546875, 0.095947265625, 0....	embed
20452786_c0	20452786	haskell	0	Title: Different fold in Haskell and SML/NJ Problem title: Different fold in Haskell and SML/NJ Tags: smlnj, haskell, fold Problem: Different fold in Haskell and SML/NJ In foldl definition possible wrong in SML/NJ 110.75 , I found that the relation foldl (op -) 2 [1] = foldr (op -) 2 [1] holds. But when I tried the abo...	Different fold in Haskell and SML/NJ Different fold in Haskell and SML/NJ smlnj haskell fold Different Haskell SML Different fold in Haskell and SML/NJ In foldl definition possible wrong in SML/NJ 110.75 , I found that the relation foldl (op -) 2 [1] = foldr (op -) 2 [1] holds. But when I tried the above in Haskell I f...	[ -0.0146484375, 0.002838134765625, 0.00897216796875, 0.00384521484375, -0.0228271484375, 0.003448486328125, -0.01544189453125, 0.0020599365234375, 0.0003223419189453125, 0.03125, 0.0003337860107421875, -0.00543212890625, -0.008544921875, 0.0028076171875, -0.00433349609375, -0.0162353515...	[ 242520, 42822, 23, 20625, 142508, 136, 159, 39456, 64, 91551, 7237, 170, 1556, 18344, 20469, 80934, 7722, 44691, 12062, 6873, 41911, 2146, 20, 116, 17550, 2203, 7569, 16401, 37842, 36917, 456, 5429, 75639, 9, 69112, 22027, 18, 44084, 12921,...	[ 0.20068359375, 0.26220703125, 0.06591796875, 0.1343994140625, 0.24853515625, 0.1033935546875, 0.0692138671875, 0.2265625, 0.07568359375, 0.2291259765625, 0.01104736328125, 0.129150390625, 0.1158447265625, 0.1552734375, 0.1968994140625, 0.1617431640625, 0.11328125, 0.13623046875, ...	embed
30502941_c0	30502941	haskell	0	Title: Why doesn't product [0..] evaluate to 0 "instantly"? Problem title: Why doesn't product [0..] evaluate to 0 "instantly"? Tags: haskell, lazy-evaluation Problem: Why doesn't product [0..] evaluate to 0 "instantly"? I am trying to understand laziness. Because 0 multiplied with any num...	Why doesn't product [0..] evaluate to 0 "instantly"? Why doesn't product [0..] evaluate to 0 "instantly"? haskell lazy-evaluation Why Why doesn't product [0..] evaluate to 0 "instantly"? I am trying to understand laziness. Because 0 multiplied with any number is 0, shouldn't product [0..] ...	[ -0.0216064453125, 0.0069580078125, 0.01434326171875, -0.005706787109375, -0.0157470703125, -0.005279541015625, 0.0076904296875, -0.014892578125, 0.0234375, 0.00811767578125, 0.01171875, 0.01177978515625, -0.00775146484375, -0.004119873046875, 0.004150390625, 0.01153564453125, 0.02893...	[ 44084, 22027, 3768, 18, 12996, 2389, 5, 151575, 13, 47, 757, 143034, 538, 1556, 142508, 21, 3285, 159258, 28219, 708, 7432, 118126, 297, 678, 2499, 14012, 5608, 37842, 18344, 20469, 80019, 106, 61924, 10002, 6, 42822, 7279, 33662, 14037 ]	[ 0.147216796875, 0.09033203125, 0.0628662109375, 0.1192626953125, 0.267822265625, 0.1905517578125, 0.08013916015625, 0.1951904296875, 0.061126708984375, 0.0830078125, 0.2113037109375, 0.196533203125, 0.163818359375, 0.1239013671875, 0.22998046875, 0.12158203125, 0.176513671875, 0.16...	embed
32993547_c0	32993547	haskell	0	Title: Is complex differentiation of datatypes sensible? Problem title: Is complex differentiation of datatypes sensible? Tags: types, calculus, haskell Problem: Is complex differentiation of datatypes sensible? pigworker once asked how to express that a type is infinitely differentiable . This question brought to mind...	Is complex differentiation of datatypes sensible? Is complex differentiation of datatypes sensible? types calculus haskell Is complex differentiation of datatypes sensible? pigworker once asked how to express that a type is infinitely differentiable . This question brought to mind the fact that in complex analysis, a f...	[ 0.02392578125, 0.00653076171875, -0.0106201171875, 0.01458740234375, 0.00408935546875, -0.007659912109375, 0.010986328125, -0.006927490234375, -0.00185394287109375, -0.041015625, 0.0001201629638671875, -0.006622314453125, -0.004974365234375, 0.00026702880859375, -0.000934600830078125, ...	[ 2071, 27140, 99710, 2320, 2053, 50986, 82091, 52895, 44805, 223, 1556, 142508, 53408, 18244, 3642, 36510, 10644, 83, 54241, 21286, 2886, 114137, 32354, 191, 9803, 5423, 8110, 450, 3917, 22120, 21373, 58391, 16401 ]	[ 0.039581298828125, 0.2352294921875, 0.19970703125, 0.047637939453125, 0.1046142578125, 0.254150390625, 0.2374267578125, 0.193359375, 0.10186767578125, 0.03375244140625, 0.08544921875, 0.1827392578125, 0.0634765625, 0.05804443359375, 0.000885009765625, 0.1015625, 0.219970703125, 0.0...	embed
16207008_c0	16207008	haskell	0	Title: Encoding correctness constraints directly into the Haskell type system? Problem title: Encoding correctness constraints directly into the Haskell type system? Tags: haskell Problem: Encoding correctness constraints directly into the Haskell type system? While reading the article written by matt might, I saw the ...	Encoding correctness constraints directly into the Haskell type system? Encoding correctness constraints directly into the Haskell type system? haskell Encoding Haskell Encoding correctness constraints directly into the Haskell type system? While reading the article written by matt might, I saw the following sentance. ...	[ 0.0087890625, -0.000278472900390625, 0.0032501220703125, 0.01123046875, 0.0032958984375, -0.00115966796875, -0.0279541015625, 0.007171630859375, -0.017578125, -0.0240478515625, -0.0107421875, -0.035400390625, -0.00469970703125, 0.0208740234375, -0.005859375, 0.0174560546875, 0.023559...	[ 357, 587, 6238, 26785, 7432, 158, 2816, 4288, 105237, 3934, 20625, 142508, 10644, 5426, 1556, 2589, 18, 13648, 24124, 25632, 9325, 7154, 73342, 91084, 903, 149357, 16610, 27781 ]	[ 0.03399658203125, 0.18603515625, 0.05078125, 0.177978515625, 0.08740234375, 0.074951171875, 0.158447265625, 0.107666015625, 0.10345458984375, 0.0765380859375, 0.1385498046875, 0.2314453125, 0.1099853515625, 0.091064453125, 0.1171875, 0.01116943359375, 0.003387451171875, 0.147705078...	embed
52298333_c0	52298333	haskell	0	Title: Traversable in Haskell Problem title: Traversable in Haskell Tags: haskell, algebraic-data-types Problem: Traversable in Haskell I'm trying to understand the example from the Data.Traversable documentation. data Tree a = Empty \| Leaf a \| Node (Tree a) a (Tree a) instance Traversable Tree where traverse f Empty =...	Traversable in Haskell Traversable in Haskell haskell algebraic-data-types Traversable Haskell Data.Traversable Tree Empty Leaf Node Traversable in Haskell I'm trying to understand the example from the Data.Traversable documentation. How it is possible to apply Leaf <$> f x . Leaf is not a function and it is still poss...	[ -0.00133514404296875, 0.01348876953125, 0.0003662109375, 0.01025390625, 0.028076171875, 0.007537841796875, -0.01507568359375, -0.0133056640625, 0.006683349609375, -0.037353515625, 0.00009822845458984375, 0.004150390625, -0.00323486328125, 0.006103515625, -0.00750732421875, 0.0016784667...	[ 4937, 7864, 2886, 20625, 142508, 23, 1556, 429, 2844, 10135, 50986, 11809, 28542, 101344, 31678, 939, 636, 2407, 438, 112, 28219, 27781, 209806, 11249, 83, 7722, 59911, 4369, 1238, 1022, 959, 32354, 7464, 4527 ]	[ 0.1334228515625, 0.1790771484375, 0.20703125, 0.15087890625, 0.2464599609375, 0.010345458984375, 0.1231689453125, 0.031707763671875, 0.0428466796875, 0.105224609375, 0.1732177734375, 0.10302734375, 0.097412109375, 0.1446533203125, 0.13818359375, 0.0618896484375, 0.08648681640625, 0...	embed
75880063_c0	75880063	haskell	0	Title: Increment suffix with Lens Problem title: Increment suffix with Lens Tags: haskell, haskell-lens Problem: Increment suffix with Lens How to write a lens-based function incrementing numerical suffix (if it exists) and keeping the string as is if no such one? "aaa1" -> "aaa2" "aaa_123" -> "aaa_124" "" -> "" "aaa" ...	Increment suffix with Lens Increment suffix with Lens haskell haskell-lens Increment Lens aaa1 aaa2 aaa_123 aaa_124 Increment suffix with Lens How to write a lens-based function incrementing numerical suffix (if it exists) and keeping the string as is if no such one? I have feeling that I need some prism maybe, first, ...	[ -0.012451171875, 0.00151824951171875, -0.00555419921875, 0.0257568359375, -0.00103759765625, 0.001983642578125, 0.01507568359375, -0.00714111328125, -0.000415802001953125, 0.014892578125, -0.005706787109375, 0.0157470703125, -0.00555419921875, 0.00138092041015625, 0.01458740234375, -0....	[ 8942, 107, 674, 133784, 425, 678, 18226, 7, 1556, 142508, 9, 1977, 10, 11, 418, 304, 48636, 109589, 11249, 47, 33022, 3098, 77007, 32354, 158661, 214, 54744, 6827, 3190, 442, 32316, 136, 120260, 79315, 237, 83, 2174, 110, 6044, 1632, 34...	[ 0.126708984375, 0.173583984375, 0.0662841796875, 0.198974609375, 0.1085205078125, 0.1348876953125, 0.251220703125, 0.1036376953125, 0.12109375, 0.197998046875, 0.010162353515625, 0.2177734375, 0.04296875, 0.030517578125, 0.04052734375, 0.04840087890625, 0.1510009765625, 0.154907226...	embed
45476163_c0	45476163	haskell	0	Title: How does it become to particular type? Problem title: How does it become to particular type? Tags: haskell Problem: How does it become to particular type? I have following code snippet: Prelude Data.Monoid> :t 1 <> (2 :: Sum Integer) 1 <> (2 :: Sum Integer) :: Sum Integer How does 1 become to Sum Integer type? U...	How does it become to particular type? How does it become to particular type? haskell How Prelude Data.Monoid Sum Integer Num How does it become to particular type? I have following code snippet: How does 1 become to Sum Integer type? Update I play a bit with mappend function and discovered: Why does mappend accept the...	[ -0.0186767578125, 0.003387451171875, 0.017578125, 0.041015625, 0.0062255859375, 0.0242919921875, -0.00897216796875, 0.0050048828125, 0.02001953125, -0.01434326171875, 0.00116729736328125, -0.033203125, -0.01025390625, 0.003631591796875, 0.0128173828125, -0.01507568359375, 0.008239746...	[ 11249, 14602, 24209, 47, 17311, 10644, 1556, 142508, 1914, 822, 112, 11809, 46674, 48899, 36335, 44401, 52782, 442, 25632, 18151, 106, 11301, 4785, 291, 9858, 71, 32354, 134053, 44084, 26946, 14012, 6260, 83, 110, 22460, 532, 110527 ]	[ 0.0926513671875, 0.07696533203125, 0.13134765625, 0.10418701171875, 0.188720703125, 0.2166748046875, 0.1265869140625, 0.2080078125, 0.08599853515625, 0.1427001953125, 0.1348876953125, 0.1456298828125, 0.1212158203125, 0.1878662109375, 0.2025146484375, 0.189453125, 0.1676025390625, ...	embed
4846974_c0	4846974	haskell	0	Title: Haskell: Check if Int is in a list of Int's Problem title: Haskell: Check if Int is in a list of Int's Tags: haskell Problem: Haskell: Check if Int is in a list of Int's I am new to Haskell, sorry if this is a basic question. I currently have a list of Int's and I am trying to create a function that ta...	Haskell: Check if Int is in a list of Int's Haskell: Check if Int is in a list of Int's haskell Haskell Check Haskell: Check if Int is in a list of Int's I am new to Haskell, sorry if this is a basic question. I currently have a list of Int's and I am trying to create a function that takes a variable x and re...	[ -0.0223388671875, 0.0115966796875, 0.00787353515625, 0.017578125, -0.005950927734375, 0.0281982421875, 0.0028839111328125, -0.000217437744140625, 0.003082275390625, -0.01007080078125, 0.00762939453125, -0.0198974609375, 0.0172119140625, 0.005035400390625, -0.00182342529296875, 0.011596...	[ 20625, 142508, 38679, 2174, 360, 18, 83, 23, 5303, 111, 3768, 1556, 10, 25, 7, 3525, 59090, 62822, 82424, 31577, 28282, 32354, 51776, 77336, 1022, 30646, 337, 31, 34677, 96819, 36766, 32316, 33938, 11809, 154663, 7413, 12832, 17368, 527, ...	[ 0.1268310546875, 0.252685546875, 0.2138671875, 0.094482421875, 0.1668701171875, 0.1890869140625, 0.0855712890625, 0.1494140625, 0.1861572265625, 0.08978271484375, 0.0287933349609375, 0.1162109375, 0.019012451171875, 0.0477294921875, 0.01849365234375, 0.006439208984375, 0.022430419921...	embed
15046316_c0	15046316	haskell	0	Title: Cabal dependency conflict when installing yesod Problem title: Cabal dependency conflict when installing yesod Tags: cabal, haskell, yesod Problem: Cabal dependency conflict when installing yesod I am trying to install the yesod web framework. When I run cabal install yesod-platform , I get a dependency conflict...	Cabal dependency conflict when installing yesod Cabal dependency conflict when installing yesod cabal haskell yesod Cabal Cabal dependency conflict when installing yesod I am trying to install the yesod web framework. When I run cabal install yesod-platform , I get a dependency conflict: I get this error even in a hsen...	[ -0.0089111328125, 0.0076904296875, 0.0078125, 0.00653076171875, -0.021240234375, -0.0003604888916015625, -0.0185546875, -0.00048065185546875, -0.007171630859375, 0.052001953125, -0.001617431640625, -0.026123046875, -0.0031280517578125, -0.00811767578125, 0.013427734375, -0.009460449218...	[ 30438, 289, 42548, 27771, 79612, 3229, 20600, 214, 2422, 23722, 109524, 1556, 142508, 31577, 1467, 170846, 11675, 172121, 903, 18499, 3853, 1096, 1015, 334, 19096, 11728, 65998, 831 ]	[ 0.1783447265625, 0.158203125, 0.1944580078125, 0.12646484375, 0.2376708984375, 0.0214080810546875, 0.159912109375, 0.03839111328125, 0.147216796875, 0.2423095703125, 0.2274169921875, 0.10546875, 0.1864013671875, 0.001800537109375, 0.049957275390625, 0.1002197265625, 0.015640258789062...	embed
25242994_c0	25242994	haskell	0	Title: Infinite cycle of bytestream Problem title: Infinite cycle of bytestream Tags: haskell Problem: Infinite cycle of bytestream Hello I'm trying to produce infinite cycle of ByteStream . (not that it would be of much use, just messing around) main :: IO () main = L.writeFile "test" $ L.take 10000 $ L.cycle [0..255]...	Infinite cycle of bytestream Infinite cycle of bytestream haskell Infinite ByteStream L.writeFile L.take L.cycle Couldn L8.ByteString Integer Infinite cycle of bytestream Hello I'm trying to produce infinite cycle of ByteStream . (not that it would be of much use, just messing around) But because of L.cycle [0..255] it...	[ 0.01287841796875, -0.005645751953125, -0.02294921875, -0.004669189453125, -0.00543212890625, -0.00885009765625, 0.01531982421875, -0.01177978515625, 0.00628662109375, -0.010009765625, -0.001739501953125, 0.0130615234375, 0.021728515625, 0.03466796875, -0.0029754638671875, 0.01879882812...	[ 134322, 13, 105823, 390, 67, 86429, 111, 1556, 142508, 3311, 115061, 339, 434, 18781, 174350, 78219, 75457, 191147, 1019, 75358, 71713, 44401, 35378, 31577, 27489, 54241, 6, 442, 4527, 163, 38001, 2389, 135455, 24855, 18, 14858, 84751, 10644,...	[ 0.173828125, 0.07635498046875, 0.217529296875, 0.0699462890625, 0.110595703125, 0.2357177734375, 0.035491943359375, 0.1175537109375, 0.2276611328125, 0.09222412109375, 0.23193359375, 0.1131591796875, 0.002471923828125, 0.05828857421875, 0.1441650390625, 0.1175537109375, 0.21459960937...	embed
25826604_c0	25826604	haskell	0	Title: Parsing IPv6 address Problem title: Parsing IPv6 address Tags: haskell Problem: Parsing IPv6 address I need to convert IPv6 from string like "fe80::dd99:5d56:cf09:b1ef" to Binary or to (Word64,Word64). Closest I came to is Network.IP.Addr package, but I'm a newbie and this signature is impenetrable for me: net6P...	Parsing IPv6 address Parsing IPv6 address haskell Parsing IPv6 net6Parser CharParsing Monad IsNetAddr NetHost IP6 Parsing IPv6 address I need to convert IPv6 from string like "fe80::dd99:5d56:cf09:b1ef" to Binary or to (Word64,Word64). Closest I came to is Network.IP.Addr package, but I'm a newbie and this signature is...	[ -0.00897216796875, -0.010498046875, 0.00927734375, 0.031005859375, 0.0128173828125, 0.01708984375, -0.004791259765625, -0.0274658203125, -0.005767822265625, -0.0267333984375, 0.02294921875, -0.01031494140625, 0.00823974609375, -0.007659912109375, -0.004241943359375, 0.0205078125, -0....	[ 2392, 6953, 8021, 334, 910, 29823, 1556, 142508, 2043, 28636, 2189, 21656, 60331, 71, 2071, 24447, 22409, 7569, 10086, 11193, 271, 87, 3871, 47, 96760, 1295, 79315, 1884, 2242, 4836, 12, 4028, 5046, 758, 13683, 67466, 6463, 275, 418, 4240...	[ 0.21240234375, 0.1353759765625, 0.159912109375, 0.1746826171875, 0.251953125, 0.1781005859375, 0.1336669921875, 0.240234375, 0.076171875, 0.1990966796875, 0.10308837890625, 0.1055908203125, 0.110595703125, 0.09613037109375, 0.098388671875, 0.120361328125, 0.0802001953125, 0.1809082...	embed
27349483_c1	27349483	haskell	1	_ -> DbTypePrimitive (DbOther $ OtherTypeDef [Left "uuid"]) False Nothing Nothing In the expression: case db of { Postgresql _ -> DbTypePrimitive (DbOther $ OtherTypeDef [Left "uuid"]) False Nothing Nothing _ -> DbTypePrimitive (DbOther $ OtherTypeDef [Left "varchar"]) False Nothing Nothing } Code signals: db, How, Ha...	_ -> DbTypePrimitive (DbOther $ OtherTypeDef [Left "uuid"]) False Nothing Nothing In the expression: case db of { Postgresql _ -> DbTypePrimitive (DbOther $ OtherTypeDef [Left "uuid"]) False Nothing Nothing _ -> DbTypePrimitive (DbOther $ OtherTypeDef [Left "varchar"]) False Nothing Nothing } Code signals: db, How, Ha...	[ -0.00836181640625, 0.011474609375, -0.000545501708984375, 0.00830078125, 0.01507568359375, -0.004119873046875, -0.01055908203125, -0.023193359375, 0.010009765625, -0.015869140625, -0.013916015625, -0.008544921875, -0.0034027099609375, -0.016357421875, -0.0205078125, 0.01104736328125, ...	[ 101, 33079, 391, 275, 196707, 145111, 14, 4935, 397, 670, 9319, 3650, 64511, 187423, 2480, 17349, 532, 22225, 182747, 125195, 7225, 40041, 111, 2795, 17562, 99247, 184, 1961, 9254, 28864, 26073, 11249, 20625, 142508, 205540, 497, 177, 44506, ...	[ 0.053741455078125, 0.08685302734375, 0.07244873046875, 0.1036376953125, 0.270751953125, 0.157958984375, 0.094482421875, 0.185302734375, 0.0213623046875, 0.044158935546875, 0.1524658203125, 0.120849609375, 0.127685546875, 0.269287109375, 0.07867431640625, 0.068603515625, 0.13403320312...	embed
28090985_c0	28090985	haskell	0	Title: How to use Shibboleth authentication for a Yesod application? Problem title: How to use Shibboleth authentication for a Yesod application? Tags: yesod, shibboleth, haskell Problem: How to use Shibboleth authentication for a Yesod application? How can I put a Yesod application behind Shibboleth authentication? I ...	How to use Shibboleth authentication for a Yesod application? How to use Shibboleth authentication for a Yesod application? yesod shibboleth haskell How Shibboleth Yesod How to use Shibboleth authentication for a Yesod application? How can I put a Yesod application behind Shibboleth authentication? I currently have (wi...	[ 0.00714111328125, 0.030029296875, 0.00909423828125, -0.005584716796875, -0.0303955078125, 0.02734375, 0.0002880096435546875, -0.00262451171875, -0.01336669921875, -0.00982666015625, 0.0113525390625, 0.007781982421875, -0.0291748046875, 0.00848388671875, -0.007110595703125, -0.017456054...	[ 11249, 47, 4527, 8294, 275, 61217, 927, 195734, 2320, 100, 32635, 2199, 38415, 2422, 23722, 104795, 1556, 142508, 831, 87, 3884, 10, 50155, 82424, 765, 76228, 6056, 237, 313, 18027, 1528, 136, 17203, 6226, 390, 9795, 1430, 294, 26036, 142...	[ 0.158203125, 0.0799560546875, 0.1602783203125, 0.1773681640625, 0.1280517578125, 0.25146484375, 0.1988525390625, 0.238525390625, 0.1492919921875, 0.07861328125, 0.203369140625, 0.267578125, 0.200439453125, 0.143310546875, 0.2261962890625, 0.1737060546875, 0.1337890625, 0.2164306640...	embed
33817372_c0	33817372	haskell	0	Title: Dynamic stdout in Haskell Problem title: Dynamic stdout in Haskell Tags: haskell, command-line-interface Problem: Dynamic stdout in Haskell I have simple command line interface with insertion records in DB and now it writes a lot of info to stdout, like this: ... record 856/1000: 85% record 857/1000: 85% record ...	Dynamic stdout in Haskell Dynamic stdout in Haskell haskell command-line-interface Dynamic Haskell Dynamic stdout in Haskell I have simple command line interface with insertion records in DB and now it writes a lot of info to stdout, like this: but I want to have 1 dynamic line with updating current string parameters H...	[ -0.0019683837890625, 0.0101318359375, 0.00799560546875, 0.020263671875, 0.00732421875, 0.002593994140625, -0.0037689208984375, -0.0067138671875, -0.00714111328125, -0.0003509521484375, -0.021484375, -0.0123291015625, -0.005462646484375, -0.0146484375, -0.004119873046875, 0.016967773437...	[ 73327, 21068, 6138, 246, 1003, 20625, 142508, 23, 1556, 75101, 2256, 10433, 8781, 13315, 101758, 241860, 115923, 57976, 33022, 5915, 3004, 47, 3444, 106, 84079, 678, 1257, 56464, 43581, 79315, 171859, 69307 ]	[ 0.1651611328125, 0.0670166015625, 0.15185546875, 0.107421875, 0.2041015625, 0.1298828125, 0.22412109375, 0.0546875, 0.112548828125, 0.1243896484375, 0.09295654296875, 0.04998779296875, 0.0634765625, 0.162841796875, 0.1197509765625, 0.085693359375, 0.1080322265625, 0.099853515625, ...	embed
15240840_c0	15240840	haskell	0	Title: Ruby Method similar to Haskells cycle Problem title: Ruby Method similar to Haskells cycle Tags: functional-programming, haskell, ruby Problem: Ruby Method similar to Haskells cycle Is there a Ruby method similar to Haskell's cycle? Haskell's cycle takes a list and returns that list infinitely appended to itself...	Ruby Method similar to Haskells cycle Ruby Method similar to Haskells cycle functional-programming haskell ruby Ruby Method Haskells Ruby Method similar to Haskells cycle Is there a Ruby method similar to Haskell's cycle? Haskell's cycle takes a list and returns that list infinitely appended to itself. It's commonly us...	[ 0.00811767578125, 0.00830078125, -0.00057220458984375, 0.0233154296875, 0.005126953125, -0.005615234375, 0.00970458984375, -0.00439453125, 0.008056640625, -0.033447265625, -0.026123046875, -0.0194091796875, -0.0174560546875, 0.0184326171875, -0.00089263916015625, 0.00518798828125, -0...	[ 158189, 74644, 21373, 47, 20625, 142508, 7, 105823, 123309, 28966, 1556, 21922, 53, 2685, 10, 55300, 25, 51776, 5303, 30646, 54241, 114689, 48141, 68034, 39210, 11814, 678, 5646, 3129, 59102, 24233, 80854, 5773, 2663, 10298, 2071, 450, 3060, ...	[ 0.281005859375, 0.2237548828125, 0.153076171875, 0.06927490234375, 0.1280517578125, 0.2265625, 0.0343017578125, 0.2200927734375, 0.11083984375, 0.07159423828125, 0.1163330078125, 0.1636962890625, 0.06182861328125, 0.06329345703125, 0.07080078125, 0.2042236328125, 0.0062255859375, 0...	embed
15258587_c0	15258587	haskell	0	Title: What's the benefit of conduit's leftovers? Problem title: What's the benefit of conduit's leftovers? Tags: haskell-pipes, haskell, conduit Problem: What's the benefit of conduit's leftovers? I'm trying to understand the differences between conduit and pipes . Unlike pipes , conduit has the co...	What's the benefit of conduit's leftovers? What's the benefit of conduit's leftovers? haskell-pipes haskell conduit What What's the benefit of conduit's leftovers? I'm trying to understand the differences between conduit and pipes . Unlike pipes , conduit has the concept of leftovers. What are lefto...	[ 0.01141357421875, 0.024658203125, -0.0015411376953125, 0.020751953125, -0.0118408203125, 0.0028228759765625, -0.007415771484375, -0.0093994140625, 0.01556396484375, 0.0218505859375, -0.026123046875, -0.025390625, 0.0361328125, 0.000339508056640625, -0.01507568359375, -0.009033203125, ...	[ 4865, 3768, 70, 68073, 111, 120565, 7, 25737, 5465, 1556, 142508, 1434, 13569, 25, 28219, 60212, 17721, 136, 137158, 992, 5062, 23755, 621, 80234, 100, 27781, 85590, 18, 765, 69307, 21373, 123166, 678 ]	[ 0.0899658203125, 0.059539794921875, 0.091064453125, 0.223876953125, 0.072998046875, 0.2626953125, 0.14013671875, 0.2135009765625, 0.2457275390625, 0.134765625, 0.22265625, 0.127197265625, 0.035980224609375, 0.048858642578125, 0.024658203125, 0.1044921875, 0.0631103515625, 0.0935058...	embed
25496501_c0	25496501	haskell	0	Title: What is the list comprehension for right triangles in python à la Haskell? Problem title: What is the list comprehension for right triangles in python à la Haskell? Tags: geometry, list-comprehension, list, python, haskell Problem: What is the list comprehension for right triangles in python à la Haskell? In Has...	What is the list comprehension for right triangles in python à la Haskell? What is the list comprehension for right triangles in python à la Haskell? geometry list-comprehension list python haskell What Haskell What is the list comprehension for right triangles in python à la Haskell? In Haskell: Is there such an elega...	[ 0.0089111328125, 0.005279541015625, 0.0279541015625, 0.00787353515625, 0.009033203125, 0.007781982421875, -0.003448486328125, 0.00958251953125, 0.00860595703125, -0.0191650390625, -0.004791259765625, -0.048828125, 0.004364013671875, -0.0062255859375, -0.0400390625, 0.0025482177734375, ...	[ 5303, 46683, 3220, 6889, 7108, 1927, 109217, 17198, 50828, 253, 21, 20625, 142508, 100, 7, 23, 700, 87739, 277, 4692, 1556, 4865, 83, 70, 6044, 27650, 29806, 145581 ]	[ 0.2054443359375, 0.1685791015625, 0.1630859375, 0.053558349609375, 0.1883544921875, 0.166259765625, 0.1976318359375, 0.0985107421875, 0.148193359375, 0.0810546875, 0.0938720703125, 0.157470703125, 0.2578125, 0.030609130859375, 0.0250396728515625, 0.014923095703125, 0.035186767578125,...	embed
47144419_c0	47144419	haskell	0	Title: When I run a lot of http requests in parallel, I get "no such protocol name: tcp" Problem title: When I run a lot of http requests in parallel, I get "no such protocol name: tcp" Tags: haskell, http-conduit Problem: When I run a lot of http requests in parallel, I get "no such protocol name: ...	When I run a lot of http requests in parallel, I get "no such protocol name: tcp" When I run a lot of http requests in parallel, I get "no such protocol name: tcp" haskell http-conduit When ConnectionFailure Network.BSD.getProtocolByName When I run a lot of http requests in parallel, I get "no such ...	[ 0.006439208984375, 0.00799560546875, -0.002227783203125, 0.01348876953125, -0.0023345947265625, -0.01055908203125, -0.00958251953125, -0.023681640625, 0.004425048828125, 0.0036468505859375, -0.0009918212890625, -0.00970458984375, 0.013427734375, 0.00019741058349609375, 0.00604248046875, ...	[ 14847, 11675, 5915, 111, 1621, 50336, 23, 95103, 157, 6044, 91363, 9351, 808, 121422, 7, 2046, 1556, 142508, 2271, 112061, 62448, 17647, 379, 28997, 20429, 397, 10752, 188, 8447, 75358, 163612, 12, 18151, 104250, 7103, 1672, 106, 92 ]	[ 0.0264129638671875, 0.10302734375, 0.1282958984375, 0.022430419921875, 0.1798095703125, 0.1932373046875, 0.037872314453125, 0.185546875, 0.1060791015625, 0.1517333984375, 0.22705078125, 0.10540771484375, 0.049346923828125, 0.2216796875, 0.01025390625, 0.021209716796875, 0.09216308593...	embed
67863482_c0	67863482	haskell	0	Title: How do I make custom data type orderable? Problem title: How do I make custom data type orderable? Tags: haskell Problem: How do I make custom data type orderable? I have a Haskell custom data type that I would like to use as a key in Data.Map , Data.Graph , and other lookup tables. data State = State { playerId...	How do I make custom data type orderable? How do I make custom data type orderable? haskell How Data.Map Data.Graph State Show Ord How do I make custom data type orderable? I have a Haskell custom data type that I would like to use as a key in Data.Map , Data.Graph , and other lookup tables. How do I make it orderable?...	[ 0.00274658203125, 0.0028839111328125, 0.00860595703125, 0.003265380859375, -0.009521484375, 0.00994873046875, -0.007537841796875, -0.0172119140625, 0.00439453125, -0.0126953125, -0.00579833984375, -0.0145263671875, 0.0159912109375, 0.00445556640625, -0.02880859375, -0.0086669921875, ...	[ 11249, 3249, 114122, 2053, 10644, 12989, 2886, 54, 87, 1556, 142508, 11809, 166179, 37878, 11727, 22836, 17367, 35379, 20625, 1884, 4527, 237, 22799, 6713, 2037, 23180, 442, 25632, 18, 48903, 4488 ]	[ 0.0794677734375, 0.10107421875, 0.219970703125, 0.1514892578125, 0.228271484375, 0.2327880859375, 0.1795654296875, 0.034088134765625, 0.03253173828125, 0.1170654296875, 0.205810546875, 0.10296630859375, 0.1412353515625, 0.0999755859375, 0.1048583984375, 0.1171875, 0.103271484375, 0...	embed
30288847_c0	30288847	haskell	0	Title: Why is there no "Functor" trait in Scala? Problem title: Why is there no "Functor" trait in Scala? Tags: functional-programming, functor, haskell, scala Problem: Why is there no "Functor" trait in Scala? In Scala, the generic classes such as Future , Option and List all have methods map and f...	Why is there no "Functor" trait in Scala? Why is there no "Functor" trait in Scala? functional-programming functor haskell scala Why Functor Scala Future Option List Why is there no "Functor" trait in Scala? In Scala, the generic classes such as Future , Option and List all have methods map and flat...	[ 0.02099609375, 0.0186767578125, -0.0002727508544921875, -0.020263671875, 0.00799560546875, -0.0194091796875, 0.00909423828125, -0.01336669921875, -0.0057373046875, -0.000762939453125, -0.0179443359375, -0.0281982421875, -0.005645751953125, 0.00927734375, -0.01123046875, -0.003570556640...	[ 44084, 83, 2685, 110, 97249, 18770, 110106, 23, 152653, 11, 41502, 123309, 28966, 7477, 1556, 142508, 146232, 28670, 94724, 86769, 32036, 360, 189534, 61112, 136, 150624, 22288, 49878, 166179, 1884, 20625, 15400, 56112, 18, 10, 10433, 40404, ...	[ 0.118408203125, 0.039093017578125, 0.0533447265625, 0.1324462890625, 0.21826171875, 0.2354736328125, 0.235595703125, 0.07318115234375, 0.223876953125, 0.1666259765625, 0.0113525390625, 0.126220703125, 0.036346435546875, 0.1165771484375, 0.045196533203125, 0.2310791015625, 0.175537109...	embed
5418710_c0	5418710	haskell	0	Title: Haskell List of List problem Problem title: Haskell List of List problem Tags: haskell, list Problem: Haskell List of List problem Im trying to change a particular particular list in a list of lists, Ive already defined the function which changes the list. But im not sure how to go about implementing this functi...	Haskell List of List problem Haskell List of List problem haskell list Haskell List Haskell List of List problem Im trying to change a particular particular list in a list of lists, Ive already defined the function which changes the list. But im not sure how to go about implementing this function into another function ...	[ 0.00130462646484375, 0.006500244140625, 0.011962890625, 0.00994873046875, 0.005340576171875, 0.005157470703125, -0.01116943359375, -0.00107574462890625, 0.01177978515625, 0.040283203125, 0.0026092529296875, -0.0177001953125, 0.0037841796875, 0.0257568359375, -0.00897216796875, -0.00616...	[ 20625, 142508, 32036, 111, 2967, 1556, 5303, 3370, 31577, 47, 15549, 17311, 23, 272, 21771, 61924, 71, 70, 32354, 3129, 65572, 566, 959, 9077, 29479, 3934, 15700, 2831, 3173, 11, 33079, 10, 110558 ]	[ 0.133544921875, 0.2012939453125, 0.2139892578125, 0.165771484375, 0.18310546875, 0.1326904296875, 0.1868896484375, 0.05023193359375, 0.07989501953125, 0.00848388671875, 0.1754150390625, 0.058624267578125, 0.04815673828125, 0.0037841796875, 0.05535888671875, 0.1650390625, 0.0231323242...	embed
35630580_c0	35630580	haskell	0	Title: Can someone please explain what k, a and r make sense into this mapM definition?i am a haskell newbie Problem title: Can someone please explain what k, a and r make sense into this mapM definition?i am a haskell newbie Tags: haskell-platform, haskell Problem: Can someone please explain what k, a and r make sense...	Can someone please explain what k, a and r make sense into this mapM definition?i am a haskell newbie Can someone please explain what k, a and r make sense into this mapM definition?i am a haskell newbie haskell-platform haskell Can Monad INLINE x:xs Can someone please explain what k, a and r make sense into this mapM ...	[ -0.0126953125, 0.0084228515625, 0.01409912109375, -0.004180908203125, 0.003936767578125, 0.0004138946533203125, 0.00836181640625, -0.00142669677734375, 0.0225830078125, -0.0194091796875, 0.0224609375, -0.00555419921875, -0.00689697265625, 0.017333984375, -0.005157470703125, -0.00405883...	[ 4171, 22008, 22936, 73342, 472, 4, 10, 136, 1690, 3249, 10422, 903, 22288, 594, 80934, 444, 1556, 142508, 9014, 2367, 3934, 172121, 60331, 71, 5881, 57339, 1022, 12, 425 ]	[ 0.05511474609375, 0.02587890625, 0.0572509765625, 0.1722412109375, 0.156982421875, 0.03863525390625, 0.1484375, 0.1656494140625, 0.16357421875, 0.062225341796875, 0.162109375, 0.000518798828125, 0.163818359375, 0.16552734375, 0.143798828125, 0.0120849609375, 0.0870361328125, 0.2064...	embed
28131135_c1	28131135	haskell	1	the outermost closure (which is called first) has closed over the last element of xs, so it can't pair them in the right order. I think the fix is to somehow build the closures inside-out, but I can't really see how to do it. I would happily accept a solution in either Haskell or Clojure. I'm hoping for a solution of ...	the outermost closure (which is called first) has closed over the last element of xs, so it can't pair them in the right order. I think the fix is to somehow build the closures inside-out, but I can't really see how to do it. I would happily accept a solution in either Haskell or Clojure. I'm hoping for a solution of ...	[ -0.00543212890625, 0.0107421875, -0.00787353515625, -0.0125732421875, -0.00494384765625, 0.0242919921875, -0.02099609375, 0.001678466796875, -0.005706787109375, -0.021240234375, 0.002410888671875, 0.004608154296875, 0.0024566650390625, 0.00299072265625, -0.007659912109375, 0.0068054199...	[ 628, 32166, 5510, 170224, 35839, 5117, 1556, 155738, 645, 4568, 12830, 1022, 7, 831, 18, 80836, 2856, 23, 7108, 12989, 5351, 30022, 209303, 45367, 70, 46132, 6056, 1957, 29806, 20625, 142508, 51053, 461, 107, 156377, 3173, 68330, 2203, 1834...	[ 0.1419677734375, 0.1650390625, 0.216064453125, 0.258056640625, 0.045440673828125, 0.1763916015625, 0.072509765625, 0.1943359375, 0.1546630859375, 0.1630859375, 0.15966796875, 0.1685791015625, 0.144775390625, 0.092529296875, 0.0887451171875, 0.242919921875, 0.03662109375, 0.05172729...	embed
4592509_c0	4592509	haskell	0	Title: Using parallel strategies with monads Problem title: Using parallel strategies with monads Tags: parallel-processing, monads, haskell, concurrency Problem: Using parallel strategies with monads I often see the usage and explanation of Haskell's parallel strategies connected to pure computations (for example fib ...	Using parallel strategies with monads Using parallel strategies with monads parallel-processing monads haskell concurrency Using Using parallel strategies with monads I often see the usage and explanation of Haskell's parallel strategies connected to pure computations (for example fib ). However, I do not often see it ...	[ -0.0152587890625, 0.0211181640625, -0.0033721923828125, -0.0247802734375, 0.0054931640625, 0.001220703125, 0.005462646484375, -0.01318359375, 0.00872802734375, -0.038818359375, 0.006805419921875, -0.00714111328125, 0.01202392578125, 0.006866455078125, 0.0038909912109375, 0.010559082031...	[ 345, 95103, 50531, 678, 2667, 712, 63923, 1556, 142508, 108636, 982, 7, 27983, 127689, 187136, 20625, 162711, 34166, 181135, 809, 275, 959, 1957, 11814, 11, 18403, 50961, 169022, 206019, 21543, 366, 62548, 32354, 190659, 16992, 91, 17780, 154...	[ 0.0648193359375, 0.242919921875, 0.202880859375, 0.06787109375, 0.1234130859375, 0.16015625, 0.09014892578125, 0.1009521484375, 0.234619140625, 0.1378173828125, 0.076904296875, 0.044158935546875, 0.11083984375, 0.130859375, 0.07159423828125, 0.10357666015625, 0.037322998046875, 0.0...	embed
49339973_c0	49339973	haskell	0	Title: Function containing head and tail functions throws empty list error Problem title: Function containing head and tail functions throws empty list error Tags: functional-programming, haskell Problem: Function containing head and tail functions throws empty list error I'm trying the solve the first question in Adve...	Function containing head and tail functions throws empty list error Function containing head and tail functions throws empty list error functional-programming haskell Bool x:xs Function containing head and tail functions throws empty list error I'm trying the solve the first question in Advent of Code 2017 , and come u...	[ -0.006500244140625, 0.003692626953125, 0.000606536865234375, 0.0040283203125, -0.0250244140625, 0.01171875, 0.006103515625, -0.01080322265625, 0.026611328125, 0.00433349609375, 0.006805419921875, 0.002532958984375, 0.004608154296875, 0.0142822265625, 0.00494384765625, 0.001091003417968...	[ 28670, 10763, 70541, 10336, 136, 46741, 32354, 104250, 201505, 5303, 18499, 123309, 28966, 1556, 142508, 2460, 929, 425, 86869, 9655, 89718, 111, 28864, 505, 29806, 74481, 44841, 34292, 3229, 8337, 107730, 57346, 101935, 68252, 363, 96386, 7619...	[ 0.1463623046875, 0.08148193359375, 0.1768798828125, 0.2340087890625, 0.1541748046875, 0.26806640625, 0.2177734375, 0.1812744140625, 0.1927490234375, 0.2152099609375, 0.2220458984375, 0.1387939453125, 0.0833740234375, 0.0975341796875, 0.1951904296875, 0.0240936279296875, 0.12426757812...	embed
32151151_c1	32151151	haskell	1	pagePosts = posts <$> postResponse let nextAfterCode = after $ fromJust postResponse if isNothing pagePosts then return Nothing else return (Just (fromJust pagePosts,nextAfterCode)) getPosts :: Text -> [Post] -> IO [Post] getPosts x y = do p <- liftIO $ fetchPage x let posts = fst (fromJust p) let afterParam = snd (fr...	pagePosts = posts <$> postResponse let nextAfterCode = after $ fromJust postResponse if isNothing pagePosts then return Nothing else return (Just (fromJust pagePosts,nextAfterCode)) getPosts :: Text -> [Post] -> IO [Post] getPosts x y = do p <- liftIO $ fetchPage x let posts = fst (fromJust p) let afterParam = snd (fr...	[ 0.006011962890625, 0.01104736328125, 0.00775146484375, 0.01544189453125, 0.0198974609375, 0.0201416015625, 0.002899169921875, 0.009033203125, -0.0002841949462890625, -0.0218505859375, 0.033935546875, -0.00823974609375, -0.0155029296875, -0.033203125, 0.0283203125, 0.005584716796875, ...	[ 9191, 49411, 7, 2203, 32323, 4369, 1305, 94399, 2633, 11737, 46327, 114211, 7103, 3650, 1295, 127794, 2174, 83, 5021, 64113, 30646, 182747, 37076, 161063, 29062, 16, 2046, 24129, 6, 17780, 113, 915, 60520, 7647, 147101, 1022, 271, 55292, 72...	[ 0.1685791015625, 0.228271484375, 0.08441162109375, 0.07470703125, 0.1702880859375, 0.023193359375, 0.0987548828125, 0.1951904296875, 0.04058837890625, 0.13427734375, 0.1795654296875, 0.188720703125, 0.1302490234375, 0.05401611328125, 0.0728759765625, 0.09552001953125, 0.0064086914062...	embed
34779431_c1	34779431	haskell	1	)) (maybe you haven't applied enough arguments to a function?) A bunch of questions here: Obviously, I didn't get the types right while mimicking the HAVING , how to fix it. Is there a way to add type notation just for a parameter like f in havingGroupBy f n tab = [ filter f \| g <- groupBySql 2 tab ] , for debugging? M...	)) (maybe you haven't applied enough arguments to a function?) A bunch of questions here: Obviously, I didn't get the types right while mimicking the HAVING , how to fix it. Is there a way to add type notation just for a parameter like f in havingGroupBy f n tab = [ filter f \| g <- groupBySql 2 tab ] , for debugging? M...	[ 0.018310546875, -0.00421142578125, -0.016357421875, 0.01318359375, -0.006988525390625, 0.0067138671875, -0.00007534027099609375, -0.005584716796875, -0.005157470703125, 0.0118408203125, 0.01129150390625, -0.004608154296875, -0.002655029296875, -0.0130615234375, -0.029296875, 0.00028038...	[ 78960, 11354, 38246, 190659, 20174, 10750, 32354, 147306, 17582, 3688, 15935, 18, 2046, 52895, 7108, 37423, 41324, 11666, 856, 23186, 3642, 30022, 3917, 15190, 10644, 110, 22062, 1660, 171859, 1238, 19441, 205072, 75358, 653, 20928, 46312, 706,...	[ 0.0845947265625, 0.00286865234375, 0.00823974609375, 0.0521240234375, 0.026275634765625, 0.16015625, 0.1807861328125, 0.08740234375, 0.09210205078125, 0.00958251953125, 0.012420654296875, 0.030120849609375, 0.0531005859375, 0.253662109375, 0.1170654296875, 0.17724609375, 0.0656738281...	embed
16628067_c0	16628067	haskell	0	Title: Convert Int into [Int] Problem title: Convert Int into [Int] Tags: haskell, factors Problem: Convert Int into [Int] I'm looking through a past exam paper and don't understand how to convert Int to [Int] . For example, one of the questions asks us to produce a list of all the factors of a whole number excluding b...	Convert Int into [Int] Convert Int into [Int] haskell factors Convert Convert Int into [Int] I'm looking through a past exam paper and don't understand how to convert Int to [Int] . For example, one of the questions asks us to produce a list of all the factors of a whole number excluding both the number itself and 1. I...	[ -0.014892578125, -0.009033203125, 0.003204345703125, -0.006195068359375, -0.0230712890625, 0.02099609375, -0.0120849609375, -0.0205078125, 0.0028076171875, -0.018798828125, 0.003387451171875, -0.02001953125, 0.00022792816162109375, 0.03369140625, -0.02734375, 0.0174560546875, -0.0145...	[ 1657, 11549, 360, 18, 3934, 378, 4153, 268, 1556, 142508, 120103, 16487, 8305, 11015, 42276, 15122, 2301, 28219, 3642, 47, 96760, 17582, 26458, 27489, 5303, 111, 756, 70, 28271, 14012, 39041, 6238, 68034, 136, 615, 113292, 35672, 9655, 163,...	[ 0.07537841796875, 0.1949462890625, 0.1978759765625, 0.2261962890625, 0.15771484375, 0.055694580078125, 0.184326171875, 0.045074462890625, 0.1495361328125, 0.260009765625, 0.269287109375, 0.03900146484375, 0.0195465087890625, 0.056640625, 0.1339111328125, 0.0924072265625, 0.0193481445...	embed
17844223_c1	17844223	haskell	1	state",JSString (JSONString {fromJSString = "New York"})),("zip",JSRational False (10001 % 1))]}))]})) Needless to say, it seems pretty verbose (and frightening). I tried doing ...> decode aa :: Result Person and it gave me an error. How do I go about populating an instance of the Person datastructure from this json st...	state",JSString (JSONString {fromJSString = "New York"})),("zip",JSRational False (10001 % 1))]}))]})) Needless to say, it seems pretty verbose (and frightening). I tried doing ...> decode aa :: Result Person and it gave me an error. How do I go about populating an instance of the Person datastructure from this json st...	[ 0.005767822265625, 0.015380859375, -0.0272216796875, 0.01300048828125, -0.01202392578125, 0.0205078125, 0.0003032684326171875, 0.0079345703125, 0.0020751953125, -0.01953125, -0.007232666015625, -0.0087890625, 0.003814697265625, -0.004058837890625, -0.004364013671875, -0.0067138671875, ...	[ 11341, 830, 64977, 71713, 214, 85742, 2852, 161063, 46568, 5753, 50836, 12248, 43315, 34479, 1745, 4879, 37202, 28875, 57823, 184, 2940, 14119, 228624, 37842, 8, 40899, 10, 11, 1984, 126684, 15270, 18499, 11249, 54, 738, 1672, 27623, 1916, ...	[ 0.2265625, 0.03057861328125, 0.16650390625, 0.1646728515625, 0.093017578125, 0.084228515625, 0.16796875, 0.1165771484375, 0.07342529296875, 0.2257080078125, 0.1195068359375, 0.13134765625, 0.137451171875, 0.111083984375, 0.036956787109375, 0.0235748291015625, 0.0635986328125, 0.030...	embed
39309616_c0	39309616	haskell	0	Title: Haskell: parse error on input `\|' Problem title: Haskell: parse error on input `\|' Tags: haskell Problem: Haskell: parse error on input `\|' I am getting this error: sky.hs:3:5: error: parse error on input `\|' This is the code: sky list \| (length list) /= 1 = reverse (last(even (sky list)) : reverse(odd...	Haskell: parse error on input `\|' Haskell: parse error on input `\|' haskell Haskell Haskell: parse error on input `\|' I am getting this error: This is the code: Does anyone have any idea why this is happening? I have made sure that there are no tabs, just 4 spaces before the \| symbol. This might seem like a n...	[ -0.007171630859375, 0.038330078125, -0.001068115234375, 0.002197265625, -0.0260009765625, 0.018310546875, -0.018798828125, 0.00250244140625, 0.01544189453125, -0.00250244140625, 0.005340576171875, -0.01519775390625, 0.0087890625, -0.003631591796875, 0, 0.0108642578125, 0.01171875, ...	[ 20625, 142508, 12, 366, 184, 18499, 98, 107730, 9473, 58745, 3768, 1556, 87, 444, 20949, 903, 3293, 83, 18151, 35672, 6528, 15400, 123087, 7228, 9077, 621, 110, 20928, 1660, 201, 32628, 8108, 26582, 95968, 9842, 1679 ]	[ 0.1624755859375, 0.23486328125, 0.048065185546875, 0.1793212890625, 0.15869140625, 0.234130859375, 0.1119384765625, 0.212646484375, 0.043731689453125, 0.1766357421875, 0.10467529296875, 0.143798828125, 0.001678466796875, 0.0093994140625, 0.02581787109375, 0.051666259765625, 0.0350952...	embed
27374642_c1	27374642	haskell	1	State i -> Pos -> More -> Failure i (State i) a -> Success i (State i) a -> IResult i a } data IResult i a = Fail i [String] String \| Partial (i -> IResult i a) \| Done i a type Failure i t a = t -> Pos -> More -> [String] -> String -> IResult i a type Success i t a = t -> Pos -> More -> a -> IResult i a where the type...	State i -> Pos -> More -> Failure i (State i) a -> Success i (State i) a -> IResult i a } data IResult i a = Fail i [String] String \| Partial (i -> IResult i a) \| Done i a type Failure i t a = t -> Pos -> More -> [String] -> String -> IResult i a type Success i t a = t -> Pos -> More -> a -> IResult i a where the type...	[ -0.021240234375, -0.00090789794921875, 0.00104522705078125, 0.005645751953125, -0.002899169921875, 0.0147705078125, -0.01141357421875, -0.032470703125, 0.01708984375, 0.00994873046875, 0.0159912109375, -0.0017242431640625, -0.028564453125, 0.00189971923828125, -0.0225830078125, 0.00897...	[ 22836, 17, 33079, 13498, 5455, 190355, 3408, 135206, 13, 10, 144053, 32863, 90, 7136, 2053, 2203, 71713, 214, 23351, 9148, 289, 14, 984, 86, 10644, 808, 6276, 29089, 1690, 959, 11814, 5, 15400, 903, 80934, 2806, 186, 434, 35133, 44402, ...	[ 0.173583984375, 0.1500244140625, 0.01397705078125, 0.1478271484375, 0.168212890625, 0.1905517578125, 0.1181640625, 0.09979248046875, 0.03497314453125, 0.12451171875, 0.201416015625, 0.0880126953125, 0.1689453125, 0.1915283203125, 0.156005859375, 0.09228515625, 0.045501708984375, 0....	embed
19208356_c0	19208356	haskell	0	Title: Ghc not starting properly [Windows 7 64 bit] Problem title: Ghc not starting properly [Windows 7 64 bit] Tags: haskell, ghc Problem: Ghc not starting properly [Windows 7 64 bit] I've just installed Haskell Platform, and ghci works fine, but for some reason i can't launch ghc. It crashes approximately 0,5 seconds...	Ghc not starting properly [Windows 7 64 bit] Ghc not starting properly [Windows 7 64 bit] haskell ghc Ghc Windows Ghc not starting properly [Windows 7 64 bit] I've just installed Haskell Platform, and ghci works fine, but for some reason i can't launch ghc. It crashes approximately 0,5 seconds after i start it. In the ...	[ 0.0076904296875, 0.0130615234375, 0.0184326171875, -0.003082275390625, -0.004669189453125, 0.0108642578125, -0.01092529296875, -0.02685546875, -0.00787353515625, -0.0024261474609375, 0.0089111328125, -0.00457763671875, -0.000736236572265625, 0.01470947265625, 0.006591796875, 0.00482177...	[ 55112, 238, 959, 72134, 155965, 43342, 361, 7911, 4785, 268, 1556, 142508, 31380, 3773, 1660, 20600, 20625, 70968, 318, 43240, 5885, 1284, 3060, 31635, 17, 831, 18, 83184, 1650, 150631, 189275, 32008, 94131, 7103, 4034, 442, 13651, 14364, 4...	[ 0.2191162109375, 0.23876953125, 0.0947265625, 0.1744384765625, 0.1434326171875, 0.1209716796875, 0.1536865234375, 0.185302734375, 0.12646484375, 0.001251220703125, 0.16552734375, 0.2374267578125, 0.1953125, 0.156494140625, 0.009857177734375, 0.0875244140625, 0.118896484375, 0.125, ...	embed
19970072_c0	19970072	haskell	0	Title: Get a session value with lookupSession Problem title: Get a session value with lookupSession Tags: yesod, haskell Problem: Get a session value with lookupSession I try to put a session value in a variable to display it in my .hamlet but it does not focntion! getEtatR :: Handler Html getEtatR = do mSessionValue <...	Get a session value with lookupSession Get a session value with lookupSession yesod haskell Get Handler Html Maybe Text Get a session value with lookupSession I try to put a session value in a variable to display it in my .hamlet but it does not focntion! I need #{myValue} to put it in my etat.hamlet	[ 0.003204345703125, 0.01104736328125, 0.00372314453125, -0.0198974609375, -0.0003681182861328125, -0.0022125244140625, 0.01336669921875, 0.00732421875, -0.00714111328125, -0.061767578125, 0.00933837890625, 0.00457763671875, -0.0223388671875, -0.00927734375, 0.01214599609375, 0.009887695...	[ 20779, 10, 56002, 34292, 678, 6713, 2037, 294, 90, 6889, 2422, 23722, 1556, 142508, 10639, 603, 18, 7237, 83425, 24129, 9790, 3884, 77336, 44116, 5, 3915, 1974, 959, 25581, 3871, 468, 1176, 856, 50770, 522 ]	[ 0.07415771484375, 0.07427978515625, 0.21337890625, 0.1895751953125, 0.100830078125, 0.115966796875, 0.150390625, 0.0926513671875, 0.143798828125, 0.1187744140625, 0.0748291015625, 0.1441650390625, 0.073974609375, 0.1781005859375, 0.1217041015625, 0.144287109375, 0.050872802734375, ...	embed
7838724_c0	7838724	haskell	0	Title: Get list of lists without recursion Problem title: Get list of lists without recursion Tags: haskell Problem: Get list of lists without recursion I'm trying to get all lists with length 4 from alphabet [0..9] with unique elements. allNumbers = [a \| let list = [0..9], x1 <- list, x2 <- list, x3 <- list, x4 <- lis...	Get list of lists without recursion Get list of lists without recursion haskell Get Get list of lists without recursion I'm trying to get all lists with length 4 from alphabet [0..9] with unique elements. How can I get some simplest and nicest version of that? What if I need all such lists with length 10 (I don't want ...	[ -0.034912109375, 0.01513671875, -0.007659912109375, -0.00506591796875, -0.0034027099609375, -0.01409912109375, -0.0004711151123046875, -0.007476806640625, 0.0189208984375, -0.0517578125, 0.01409912109375, -0.0004215240478515625, 0.0211181640625, 0.0262451171875, -0.01092529296875, -0.0...	[ 20779, 5303, 111, 7, 15490, 195625, 1830, 1556, 142508, 31577, 2046, 756, 678, 140909, 201, 1295, 229231, 2389, 1126, 36998, 80854, 30362, 10443, 525, 11389, 3871, 209, 568, 1022, 4904, 20028, 3775, 48650, 35166, 65524 ]	[ 0.134521484375, 0.2259521484375, 0.0926513671875, 0.0936279296875, 0.190185546875, 0.2005615234375, 0.087646484375, 0.1524658203125, 0.202392578125, 0.057769775390625, 0.0963134765625, 0.04376220703125, 0.00537109375, 0.112060546875, 0.160888671875, 0.0286712646484375, 0.171630859375...	embed
67024536_c0	67024536	haskell	0	Title: Haskell: Print type of variable within function Problem title: Haskell: Print type of variable within function Tags: ghc, ghci, haskell, functional-programming Problem: Haskell: Print type of variable within function How do I print the type of a variable within a function in an .hs file? From ghci, I can do :typ...	Haskell: Print type of variable within function Haskell: Print type of variable within function ghc ghci haskell functional-programming Haskell Print h:t Haskell: Print type of variable within function How do I print the type of a variable within a function in an .hs file? From ghci, I can do :type var . How do I do so...	[ 0.00604248046875, -0.00457763671875, 0.00848388671875, 0.0174560546875, -0.0023651123046875, -0.0012054443359375, -0.0179443359375, 0.0186767578125, -0.002960205078125, -0.0157470703125, 0.0032958984375, -0.040771484375, 0.0030364990234375, -0.021240234375, 0.009765625, 0.01611328125, ...	[ 20625, 142508, 39754, 10644, 111, 77336, 28032, 32354, 31380, 238, 318, 1556, 123309, 28966, 1096, 12, 18, 54, 87, 28412, 23, 5, 127, 7, 11435, 28090, 831, 152, 50986, 285, 4153, 99, 11907, 195625, 720 ]	[ 0.1241455078125, 0.2303466796875, 0.211669921875, 0.210693359375, 0.054046630859375, 0.2486572265625, 0.12841796875, 0.1663818359375, 0.0997314453125, 0.090576171875, 0.1207275390625, 0.109375, 0.09619140625, 0.02301025390625, 0.09808349609375, 0.017242431640625, 0.09423828125, 0.0...	embed
11370778_c0	11370778	haskell	0	Title: How to import specific PortNumber constructor Problem title: How to import specific PortNumber constructor Tags: haskell Problem: How to import specific PortNumber constructor Simple question. This compiles: module Example where import Network port :: PortID port = PortNumber 3001 And this does not: module Examp...	How to import specific PortNumber constructor How to import specific PortNumber constructor haskell specific Network How PortNumber Example PortID Example.hs:6:8 Not How to import specific PortNumber constructor Simple question. This compiles: And this does not: GHC says: Why?	[ -0.01153564453125, -0.0096435546875, -0.0133056640625, 0.02734375, -0.00262451171875, 0.00347900390625, -0.01397705078125, -0.002044677734375, 0.003692626953125, 0.000858306884765625, -0.00040435791015625, -0.0546875, 0.01220703125, 0.00592041015625, -0.00147247314453125, -0.013671875,...	[ 11249, 24927, 29458, 13791, 18444, 26278, 64549, 748, 47, 1556, 142508, 28997, 89536, 7146, 127, 910, 1019, 11205, 3293, 9969, 1340, 903, 14602, 959, 527, 73265, 17378, 44084 ]	[ 0.0275421142578125, 0.2479248046875, 0.2138671875, 0.16259765625, 0.1556396484375, 0.18994140625, 0.185302734375, 0.10986328125, 0.034698486328125, 0.11761474609375, 0.184814453125, 0.10919189453125, 0.0286865234375, 0.1126708984375, 0.0635986328125, 0.042236328125, 0.1083984375, 0...	embed
24439917_c0	24439917	haskell	0	Title: Combining the state monad with the costate comonad Problem title: Combining the state monad with the costate comonad Tags: functional-programming, haskell, comonad, monads, category-theory Problem: Combining the state monad with the costate comonad How to combine the state monad S -> (A, S) with the costate como...	Combining the state monad with the costate comonad Combining the state monad with the costate comonad functional-programming haskell comonad monads category-theory Combining Combining the state monad with the costate comonad How to combine the state monad S -> (A, S) with the costate comonad (E->A, E) ? I tried with bo...	[ -0.0244140625, 0.021484375, -0.00994873046875, 0.0172119140625, -0.006439208984375, -0.00860595703125, -0.0137939453125, -0.007659912109375, 0.00909423828125, -0.036865234375, -0.007781982421875, 0.0004215240478515625, -0.004058837890625, 0.034423828125, -0.0130615234375, 0.00248718261...	[ 106935, 592, 11341, 2667, 712, 678, 80028, 13, 533, 9169, 123309, 28966, 1556, 142508, 95487, 2347, 11249, 47, 70163, 159, 33079, 284, 4, 70, 647, 103607, 241, 37842, 15044, 162520, 162515, 40101, 959, 3714, 3642, 61924, 41018, 30646, 12566...	[ 0.2293701171875, 0.057647705078125, 0.2054443359375, 0.154052734375, 0.2027587890625, 0.12158203125, 0.16943359375, 0.1544189453125, 0.1649169921875, 0.23828125, 0.11376953125, 0.1119384765625, 0.090087890625, 0.1861572265625, 0.1314697265625, 0.0225830078125, 0.04559326171875, 0.0...	embed
28246409_c0	28246409	haskell	0	Title: Inlining repeated calls (GHC) Problem title: Inlining repeated calls (GHC) Tags: optimization, inlining, haskell, ghc Problem: Inlining repeated calls (GHC) Will GHC inline a function that is used more than once? For example: {-# INLINE innerLoop #-} innerLoop x = stuff... g f = f 0 + f 1 + f 2 If we call g inne...	Inlining repeated calls (GHC) Inlining repeated calls (GHC) optimization inlining haskell ghc Inlining GHC INLINE Inlining repeated calls (GHC) Will GHC inline a function that is used more than once? For example: If we call g innerLoop will the function innerLoop be duplicated three times? Or will it just became g stuf...	[ 0.0034942626953125, -0.0004520416259765625, 0.00592041015625, 0.01397705078125, 0.0036163330078125, 0.00836181640625, 0.000644683837890625, -0.01251220703125, 0.00701904296875, -0.0224609375, -0.003814697265625, -0.0113525390625, -0.0093994140625, 0.002777099609375, 0.0274658203125, 0....	[ 360, 150, 592, 119140, 297, 11782, 41877, 441, 7, 87235, 23, 1556, 142508, 31380, 238, 527, 73265, 5881, 57339, 20255, 2256, 32354, 83, 11814, 1286, 3501, 24145, 706, 75414, 15363, 2146, 1221, 171763, 3674, 17262, 20028, 100512, 41884, 3777...	[ 0.1165771484375, 0.19091796875, 0.1292724609375, 0.2001953125, 0.087158203125, 0.189208984375, 0.145263671875, 0.13818359375, 0.0171661376953125, 0.116455078125, 0.1458740234375, 0.075927734375, 0.1683349609375, 0.1090087890625, 0.0911865234375, 0.109619140625, 0.215087890625, 0.11...	embed
19938423_c0	19938423	haskell	0	Title: Traversable and zippers. Necessity and sufficiency Problem title: Traversable and zippers. Necessity and sufficiency Tags: zipper, haskell Problem: Traversable and zippers. Necessity and sufficiency Every type T overloading the Traversable brings forth a Zipper T . I.e. existence of the instance Traversable T is...	Traversable and zippers. Necessity and sufficiency Traversable and zippers. Necessity and sufficiency zipper haskell Traversable Necessity Traversable and zippers. Necessity and sufficiency Every type T overloading the Traversable brings forth a Zipper T . I.e. existence of the instance Traversable T is the sufficient ...	[ -0.004425048828125, 0.01031494140625, -0.00186920166015625, 0.01458740234375, -0.00140380859375, 0.004150390625, -0.01068115234375, 0.00191497802734375, 0.01055908203125, -0.02490234375, -0.01312255859375, -0.006866455078125, -0.0089111328125, -0.002899169921875, 0.00933837890625, 0.02...	[ 4937, 7864, 2886, 136, 68330, 21777, 161467, 7, 2481, 133784, 1474, 3546, 8079, 1556, 142508, 87769, 10644, 384, 645, 63033, 214, 19095, 100, 927, 10, 9315, 116311, 110527, 129980, 35431, 98869, 63559, 80934 ]	[ 0.1239013671875, 0.201171875, 0.211669921875, 0.0767822265625, 0.157958984375, 0.2047119140625, 0.169921875, 0.11083984375, 0.0771484375, 0.144775390625, 0.0921630859375, 0.161865234375, 0.2369384765625, 0.124755859375, 0.21630859375, 0.05474853515625, 0.1490478515625, 0.1772460937...	embed
20247749_c0	20247749	haskell	0	Title: Haskell Couldn't match expected type `Integer' with actual type `[Integer]' Problem title: Haskell Couldn't match expected type `Integer' with actual type `[Integer]' Tags: haskell Problem: Haskell Couldn't match expected type `Integer' with actual type `[Integer]' Here is my code h...	Haskell Couldn't match expected type `Integer' with actual type `[Integer]' Haskell Couldn't match expected type `Integer' with actual type `[Integer]' haskell Haskell Couldn Integer Rank Numeric Jack Queen King Ace Show Haskell Couldn't match expected type `Integer' with actual type `[Int...	[ -0.0262451171875, -0.0150146484375, -0.00848388671875, 0.00469970703125, -0.006988525390625, 0.015869140625, -0.0238037109375, -0.031982421875, -0.0191650390625, 0.009765625, 0.017333984375, 0.0012664794921875, 0.01007080078125, -0.016845703125, -0.0167236328125, -0.01312255859375, -...	[ 20625, 142508, 191147, 3768, 18, 14858, 84751, 10644, 4153, 67, 1505, 678, 8561, 1556, 44401, 134405, 93511, 21763, 44109, 18813, 70280, 17367, 759, 18151, 3642, 831, 5154, 7440, 653, 83, 23, 17721, 787, 5, 963 ]	[ 0.142578125, 0.267333984375, 0.07818603515625, 0.083251953125, 0.151123046875, 0.158203125, 0.1400146484375, 0.1572265625, 0.06884765625, 0.16015625, 0.1429443359375, 0.0301055908203125, 0.111328125, 0.109619140625, 0.21533203125, 0.2135009765625, 0.09637451171875, 0.1163330078125,...	embed
4290163_c0	4290163	haskell	0	Title: How can I write a MST algorithm (Prim or Kruskal) in Haskell? Problem title: How can I write a MST algorithm (Prim or Kruskal) in Haskell? Tags: minimum-spanning-tree, kruskals-algorithm, prims-algorithm, haskell Problem: How can I write a MST algorithm (Prim or Kruskal) in Haskell? I can write both Prim's and K...	How can I write a MST algorithm (Prim or Kruskal) in Haskell? How can I write a MST algorithm (Prim or Kruskal) in Haskell? minimum-spanning-tree kruskals-algorithm prims-algorithm haskell How MST Prim Kruskal Haskell How can I write a MST algorithm (Prim or Kruskal) in Haskell? I can write both Prim's and Kruskal's al...	[ 0.01416015625, 0.04541015625, 0.004547119140625, -0.007537841796875, 0.01239013671875, 0.00020503997802734375, -0.02392578125, -0.0260009765625, -0.03173828125, -0.0322265625, 0.00677490234375, -0.0194091796875, 0.00144195556640625, 0.0019378662109375, -0.002716064453125, 0.01013183593...	[ 11249, 831, 33022, 276, 8545, 234873, 145111, 707, 28160, 7, 2595, 23, 20625, 142508, 87, 10, 15440, 19332, 592, 62600, 13210, 100628, 2783, 18337, 29810, 1556, 44506, 136, 7413, 175884, 53201, 313, 37223, 41925, 3642, 29479, 2856, 678, 180...	[ 0.0830078125, 0.10528564453125, 0.19287109375, 0.1182861328125, 0.20703125, 0.251953125, 0.2445068359375, 0.0196380615234375, 0.19091796875, 0.1253662109375, 0.249755859375, 0.0902099609375, 0.1641845703125, 0.260986328125, 0.0283966064453125, 0.02459716796875, 0.2220458984375, 0.1...	embed
46589047_c2	46589047	haskell	2	go’ at NoSnd.hs:27:9-15 ‘x’ is a rigid type variable bound by a pattern with constructor: :& :: forall k (a :: k -> *) (x :: k) (xr :: [k]). a x -> HList a xr -> HList a (x : xr), in an equation for ‘go’ at NoSnd.hs:27:9 • In the first argument of ‘(:&)’, namely ‘f x’ In the expression: f x :& go xs Code signals: HList...	go’ at NoSnd.hs:27:9-15 ‘x’ is a rigid type variable bound by a pattern with constructor: :& :: forall k (a :: k -> *) (x :: k) (xr :: [k]). a x -> HList a xr -> HList a (x : xr), in an equation for ‘go’ at NoSnd.hs:27:9 • In the first argument of ‘(:&)’, namely ‘f x’ In the expression: f x :& go xs Code signals: HList...	[ -0.0002346038818359375, 0.0223388671875, -0.01007080078125, -0.0115966796875, 0.008056640625, 0.0103759765625, -0.01287841796875, 0.00872802734375, 0.0113525390625, -0.0269775390625, 0.00439453125, -0.035888671875, 0.0118408203125, 0.0024261474609375, -0.0042724609375, 0.00139617919921...	[ 738, 26, 99, 438, 2208, 127, 27592, 1126, 13386, 204, 425, 83, 10, 128652, 10644, 77336, 99091, 390, 103510, 678, 64549, 748, 152, 1230, 1984, 100, 5584, 472, 11, 33079, 661, 42, 92, 1022, 572, 154663, 28, 5490, 519, 5117, 10750, 12, ...	[ 0.290283203125, 0.096435546875, 0.0701904296875, 0.102294921875, 0.09893798828125, 0.03448486328125, 0.093994140625, 0.10546875, 0.1246337890625, 0.051239013671875, 0.242919921875, 0.1239013671875, 0.1007080078125, 0.256591796875, 0.22314453125, 0.286376953125, 0.2208251953125, 0.0...	embed
47271149_c0	47271149	haskell	0	Title: Haskell Use guarded equation to create type Problem title: Haskell Use guarded equation to create type Tags: haskell, functional-programming Problem: Haskell Use guarded equation to create type I want to create a type called TwoValued and it contains two values: a and b , and I'd like to make sure that a <= b da...	Haskell Use guarded equation to create type Haskell Use guarded equation to create type haskell functional-programming Haskell Use TwoValued ValuePair Haskell Use guarded equation to create type I want to create a type called TwoValued and it contains two values: a and b , and I'd like to make sure that a <= b But it's...	[ -0.01092529296875, -0.003631591796875, 0.00396728515625, 0.01470947265625, 0.00927734375, 0.0172119140625, -0.014892578125, 0.00897216796875, 0.019287109375, 0.01348876953125, 0.0042724609375, -0.0001392364501953125, 0.0167236328125, -0.0033721923828125, 0.0103759765625, -0.00860595703...	[ 20625, 142508, 36836, 56050, 297, 28, 5490, 2320, 28282, 10644, 1556, 123309, 28966, 32964, 42272, 34, 190060, 8335, 481, 3444, 35839, 70541, 6626, 142424, 10, 136, 876, 1884, 3249, 9077, 4426, 1369, 959, 20697, 83, 107003, 3688, 69307 ]	[ 0.1441650390625, 0.20068359375, 0.05841064453125, 0.218994140625, 0.1527099609375, 0.04937744140625, 0.1937255859375, 0.06005859375, 0.1561279296875, 0.2230224609375, 0.1444091796875, 0.11474609375, 0.07733154296875, 0.18115234375, 0.1800537109375, 0.1287841796875, 0.097900390625, ...	embed
30072001_c0	30072001	haskell	0	Title: Haskell - zip 2 lists Problem title: Haskell - zip 2 lists Tags: haskell Problem: Haskell - zip 2 lists I want to write a function that zips two lists together. I have the following code: zip' :: [a]->[b]->[(a,b)] zip' _ [] = [] zip' [] _ = [] zip' (x:xs)(y:ys)=(x,y) zip'(xs ys) The problem is that when I compil...	Haskell - zip 2 lists Haskell - zip 2 lists haskell Haskell x:xs y:ys Haskell - zip 2 lists I want to write a function that zips two lists together. I have the following code: The problem is that when I compile the code I get a lot of errors Any ideas what am I doing wrong? Sorry if this may sound like stupid question.	[ 0.00921630859375, 0.005126953125, 0.006744384765625, 0.0162353515625, -0.0032196044921875, 0.029052734375, -0.0274658203125, -0.005767822265625, 0.0098876953125, 0.00848388671875, 0.0140380859375, -0.01611328125, 0.0087890625, 0.00616455078125, -0.01531982421875, 0.0194091796875, 0.0...	[ 20625, 142508, 68330, 116, 5303, 20, 1556, 1022, 12, 425, 7, 113, 4778, 87, 3444, 33022, 32354, 6626, 25842, 70, 25632, 18151, 2967, 3229, 9969, 1340, 2046, 5915, 18499, 25647, 20594, 44691, 90502, 45730, 110833 ]	[ 0.126953125, 0.2286376953125, 0.2371826171875, 0.169677734375, 0.2322998046875, 0.011871337890625, 0.125244140625, 0.03729248046875, 0.03363037109375, 0.0867919921875, 0.09735107421875, 0.0753173828125, 0.1251220703125, 0.004638671875, 0.081298828125, 0.106201171875, 0.154541015625, ...	embed
31790327_c0	31790327	haskell	0	Title: Where can BangPatterns appear Problem title: Where can BangPatterns appear Tags: haskell, strictness, ghc Problem: Where can BangPatterns appear From GHC user guide it seems like most Pat can be PBangPat , but there are a few exceptions. e.g. top-level bangs in a module (like !main ) aren't allowed and x : !xs f...	Where can BangPatterns appear Where can BangPatterns appear haskell strictness ghc Where BangPatterns Pat PBangPat Where can BangPatterns appear From GHC user guide it seems like most Pat can be PBangPat , but there are a few exceptions. e.g. top-level bangs in a module (like !main ) aren't allowed and x : !xs fails to...	[ 0.0069580078125, 0.02587890625, -0.0157470703125, -0.00439453125, -0.01434326171875, 0.026611328125, 0.01104736328125, 0.003143310546875, 0.016845703125, 0.0034637451171875, -0.00118255615234375, -0.044189453125, 0.03857421875, -0.01904296875, -0.0115966796875, 0.00162506103515625, 0...	[ 78662, 831, 26387, 8335, 3055, 1779, 108975, 1556, 142508, 81113, 7432, 31380, 238, 9876, 57842, 1463, 683, 257, 527, 73265, 38937, 17997, 2684, 186, 10846, 131527, 2663, 67919, 11339, 7, 23, 88996, 711, 24931, 18, 107003, 1022, 425, 35782,...	[ 0.1226806640625, 0.0968017578125, 0.2471923828125, 0.2122802734375, 0.1890869140625, 0.1370849609375, 0.15673828125, 0.1085205078125, 0.1796875, 0.1597900390625, 0.03173828125, 0.0682373046875, 0.06915283203125, 0.160888671875, 0.052825927734375, 0.16748046875, 0.13330078125, 0.146...	embed
61293220_c0	61293220	haskell	0	Title: What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) -> a) Problem title: What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) -> a) Tags: haskell, functor Problem: What would be the Functor instance for the following type: newty...	What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) -> a) What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) -> a) haskell functor What Functor What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) ...	[ -0.005340576171875, -0.0228271484375, 0.024169921875, -0.0036163330078125, 0.004058837890625, 0.038330078125, -0.00119781494140625, -0.0047607421875, 0.0186767578125, 0.0196533203125, -0.0036773681640625, -0.0150146484375, 0.01385498046875, 0.00872802734375, -0.0078125, -0.013793945312...	[ 4865, 2806, 186, 28670, 18770, 110527, 100, 25632, 10644, 3525, 50986, 563, 304, 1022, 10, 11, 20, 1230, 5386, 70, 1556, 142508, 7477, 60494, 33079, 16, 3444, 33022, 1238, 62346, 32354, 36917, 119056, 1284, 444, 179933, 3688 ]	[ 0.0906982421875, 0.1041259765625, 0.0648193359375, 0.2061767578125, 0.224853515625, 0.259765625, 0.049530029296875, 0.0928955078125, 0.1688232421875, 0.1376953125, 0.246337890625, 0.1461181640625, 0.19873046875, 0.1058349609375, 0.1072998046875, 0.063720703125, 0.0447998046875, 0.0...	embed
1861432_c0	1861432	haskell	0	Title: Choosing among alternatives in a Haskell algebraic datatype Problem title: Choosing among alternatives in a Haskell algebraic datatype Tags: haskell, types, data-structures, algebraic-data-types Problem: Choosing among alternatives in a Haskell algebraic datatype When type X is defined as: data X = X { sVal :: S...	Choosing among alternatives in a Haskell algebraic datatype Choosing among alternatives in a Haskell algebraic datatype haskell types data-structures algebraic-data-types Choosing Haskell Bool Choosing among alternatives in a Haskell algebraic datatype When type X is defined as: and I want the Int inside an X value, if...	[ -0.0130615234375, 0.0003108978271484375, 0.01904296875, 0.034423828125, -0.01007080078125, 0.00885009765625, -0.000782012939453125, -0.0126953125, -0.00732421875, 0.023193359375, 0.0091552734375, -0.0137939453125, -0.0098876953125, 0.00909423828125, 0.017822265625, 0.0007781982421875, ...	[ 4960, 232, 214, 54940, 30700, 20625, 142508, 429, 2844, 2053, 50986, 1556, 52895, 137656, 10135, 2460, 929, 10644, 1193, 61924, 237, 87, 3444, 360, 18, 46132, 34292, 2174, 2685, 1632, 120262, 45234, 83324, 111, 10750, 30646, 4153, 83 ]	[ 0.062744140625, 0.1038818359375, 0.0157318115234375, 0.1116943359375, 0.1766357421875, 0.121337890625, 0.2288818359375, 0.0404052734375, 0.1141357421875, 0.068603515625, 0.205322265625, 0.1058349609375, 0.18701171875, 0.126708984375, 0.0574951171875, 0.0723876953125, 0.1697998046875,...	embed
39424505_c0	39424505	haskell	0	Title: What is the name of this monoid law? Problem title: What is the name of this monoid law? Tags: haskell Problem: What is the name of this monoid law? In the documentation for Data.Monoid , it states the following laws should be satisfied: mappend mempty x = x mappend x mempty = x mappend x (mappend y z) = mappend...	What is the name of this monoid law? What is the name of this monoid law? haskell What Data.Monoid What is the name of this monoid law? In the documentation for Data.Monoid , it states the following laws should be satisfied: My understanding of these is that the first 2 are identity, and the third is associativity. But...	[ 0.007415771484375, -0.00994873046875, 0.01513671875, 0.049560546875, 0.018798828125, 0.0303955078125, 0.005279541015625, 0.01904296875, 0.0247802734375, 0.0107421875, -0.007415771484375, -0.01019287109375, -0.0091552734375, -0.005462646484375, 0.002838134765625, 0.00518798828125, -0....	[ 4865, 9351, 111, 903, 22460, 532, 27165, 83, 1556, 142508, 11809, 5, 46674, 48899, 70, 209806, 25632, 131703, 5608, 214521, 100094, 5117, 182324, 50960, 166027, 3760, 22759, 927, 13315, 71257, 2481, 13438, 347, 2271, 4460 ]	[ 0.04449462890625, 0.1334228515625, 0.06976318359375, 0.1395263671875, 0.2117919921875, 0.218017578125, 0.2174072265625, 0.03350830078125, 0.1419677734375, 0.2410888671875, 0.1622314453125, 0.030029296875, 0.17919921875, 0.24560546875, 0.00225830078125, 0.1055908203125, 0.009826660156...	embed
40412068_c0	40412068	haskell	0	Title: Order of execution with Haskell's `mapM` Problem title: Order of execution with Haskell's `mapM` Tags: haskell, traversable, io-monad, monads Problem: Order of execution with Haskell's `mapM` Consider the following Haskell statement: mapM print ["1", "2", "3"] Indeed, this prints "1", "2", and "3" in o...	Order of execution with Haskell's `mapM` Order of execution with Haskell's `mapM` haskell traversable io-monad monads Order Haskell Order of execution with Haskell's `mapM` Consider the following Haskell statement: Indeed, this prints "1", "2", and "3" in order. Question: How do you know that mapM will first ...	[ 0.01019287109375, 0.001373291015625, -0.006744384765625, 0.0235595703125, 0.0072021484375, 0.00799560546875, -0.0035400390625, -0.0133056640625, 0.0084228515625, -0.02099609375, -0.0008087158203125, -0.015869140625, 0.0086669921875, 0.00103759765625, -0.004547119140625, 0.017822265625,...	[ 81206, 111, 71924, 1830, 678, 20625, 142508, 3768, 62346, 594, 1556, 37317, 2886, 22995, 3796, 712, 2667, 137399, 25632, 63805, 102627, 903, 28412, 418, 304, 136, 363, 12989, 11249, 3714, 22288, 1221, 5117, 7068, 77681, 142027, 187020, 29479,...	[ 0.19873046875, 0.070068359375, 0.19482421875, 0.0340576171875, 0.0965576171875, 0.128173828125, 0.238525390625, 0.055419921875, 0.2177734375, 0.2059326171875, 0.1029052734375, 0.1243896484375, 0.025177001953125, 0.1484375, 0.0509033203125, 0.06817626953125, 0.048095703125, 0.012451...	embed
55086822_c1	55086822	haskell	1	Value -- V ["dish","dash","dosh"] -- instance Read Value where readPrec = readP_to_Prec (const readValues) Is it the case that read will success only if there is nothing left in the snd of the last [(Value,String)] , other elements in this list are unuse anywhere? I am aware of alternative way to do this. This questio...	Value -- V ["dish","dash","dosh"] -- instance Read Value where readPrec = readP_to_Prec (const readValues) Is it the case that read will success only if there is nothing left in the snd of the last [(Value,String)] , other elements in this list are unuse anywhere? I am aware of alternative way to do this. This questio...	[ -0.005462646484375, 0.003692626953125, -0.00701904296875, 0.0301513671875, -0.026123046875, 0.02734375, 0.0128173828125, -0.016357421875, 0.00933837890625, 0.00909423828125, 0.010009765625, 0.003448486328125, 0.01416015625, -0.01953125, -0.005828857421875, -0.0159912109375, -0.023437...	[ 190060, 4210, 310, 71, 4745, 155892, 79652, 110527, 4764, 12301, 19273, 238, 683, 188, 25553, 18, 42272, 21049, 7225, 1221, 36272, 4734, 2174, 33720, 25737, 23, 91, 2208, 111, 4568, 856, 50770, 71713, 214, 3789, 80854, 903, 5303, 51, 4032...	[ 0.29443359375, 0.0303955078125, 0.2130126953125, 0.0958251953125, 0.1766357421875, 0.193115234375, 0.17724609375, 0.218017578125, 0.2113037109375, 0.26904296875, 0.16650390625, 0.0789794921875, 0.12646484375, 0.154296875, 0.06512451171875, 0.083740234375, 0.1514892578125, 0.1276855...	embed
41026605_c0	41026605	haskell	0	Title: Haskell - put function on pair Problem title: Haskell - put function on pair Tags: haskell Problem: Haskell - put function on pair I have a following State monad: type S = (M.Map String Integer, [String]) Now, I have a function: rTD :: [String] -> ReaderT Env (StateT S (ErrorT String IO)) rTD (s, _) <- get -- (1...	Haskell - put function on pair Haskell - put function on pair haskell Haskell State M.Map Integer ReaderT Env StateT ErrorT Store Haskell - put function on pair I have a following State monad: Now, I have a function: (1) how to here use put function to modify one element of pair my Store ? Thanks in advance.	[ -0.023193359375, 0.0024566650390625, -0.020263671875, -0.00885009765625, -0.0028076171875, 0.00023937225341796875, -0.028564453125, -0.0081787109375, -0.0028076171875, -0.017578125, 0.0262451171875, 0.0245361328125, 0.00146484375, -0.00836181640625, 0.003662109375, -0.0079345703125, ...	[ 20625, 142508, 3884, 32354, 98, 80836, 1556, 22836, 276, 166179, 44401, 122636, 618, 334, 212059, 14934, 765, 25632, 2667, 712, 798, 3642, 47, 3688, 4527, 2811, 40383, 1632, 12830, 111, 129745 ]	[ 0.1397705078125, 0.25390625, 0.2197265625, 0.2138671875, 0.1695556640625, 0.262939453125, 0.1397705078125, 0.1395263671875, 0.01471710205078125, 0.12225341796875, 0.0948486328125, 0.178466796875, 0.063720703125, 0.053253173828125, 0.11309814453125, 0.21728515625, 0.00820159912109375,...	embed
19286264_c0	19286264	haskell	0	Title: Snap web framework and dynamic recompilation Problem title: Snap web framework and dynamic recompilation Tags: haskell-snap-framework, haskell Problem: Snap web framework and dynamic recompilation I'm building a web app with the Snap web framework. I have created a project with snap init. I then cabal install -f...	Snap web framework and dynamic recompilation Snap web framework and dynamic recompilation haskell-snap-framework haskell Snap Details Unknown Snap web framework and dynamic recompilation I'm building a web app with the Snap web framework. I have created a project with snap init. I then cabal install -fdevelopment, caba...	[ -0.01123046875, 0.01055908203125, 0.00665283203125, -0.00124359130859375, -0.029541015625, 0.020263671875, -0.00775146484375, 0.004241943359375, -0.0035247802734375, -0.03955078125, -0.040771484375, -0.0296630859375, -0.013427734375, 0.00086212158203125, 0.0247802734375, 0.003295898437...	[ 121190, 1467, 170846, 136, 84079, 33844, 11368, 57860, 1556, 142508, 7, 10957, 160328, 18244, 77658, 69723, 33976, 4027, 678, 75935, 10, 13452, 76685, 23, 217, 109524, 20600, 20, 420, 229815, 11675, 1957, 903, 18499, 3229, 81887, 19922, 63262...	[ 0.276611328125, 0.192138671875, 0.2213134765625, 0.0733642578125, 0.1966552734375, 0.1011962890625, 0.1702880859375, 0.04241943359375, 0.11181640625, 0.1893310546875, 0.006744384765625, 0.2108154296875, 0.12841796875, 0.0262298583984375, 0.08319091796875, 0.0751953125, 0.086608886718...	embed
43003686_c0	43003686	haskell	0	Title: Haskell optimizing infinite list implementation Problem title: Haskell optimizing infinite list implementation Tags: haskell, optimization, infinite, list Problem: Haskell optimizing infinite list implementation My code gives the wanted result but I wonder if there is a better way to code this. This is the given...	Haskell optimizing infinite list implementation Haskell optimizing infinite list implementation haskell optimization infinite list Haskell x:y:xs x:y Haskell optimizing infinite list implementation My code gives the wanted result but I wonder if there is a better way to code this. This is the given example: and the giv...	[ 0.00421142578125, 0.00244140625, 0.006072998046875, -0.003448486328125, 0.00048828125, 0.013671875, -0.01361083984375, -0.01495361328125, 0.0196533203125, -0.009521484375, 0.0230712890625, -0.0017852783203125, 0.0067138671875, -0.0184326171875, -0.014892578125, 0.00933837890625, 0.00...	[ 20625, 142508, 15572, 84382, 54241, 5303, 208124, 13, 1556, 87235, 1022, 12, 53, 425, 7, 18151, 76199, 36663, 16750, 32195, 11522, 3917, 903, 70, 27781, 136, 34475, 2646, 29806 ]	[ 0.1279296875, 0.1685791015625, 0.162353515625, 0.0616455078125, 0.166748046875, 0.1861572265625, 0.1671142578125, 0.047088623046875, 0.1365966796875, 0.161865234375, 0.034912109375, 0.01454925537109375, 0.0576171875, 0.0721435546875, 0.0330810546875, 0.126953125, 0.046234130859375, ...	embed
68910984_c0	68910984	haskell	0	Title: hSetBuffering stdin NoBuffering doesn't work on windows Problem title: hSetBuffering stdin NoBuffering doesn't work on windows Tags: windows, haskell Problem: hSetBuffering stdin NoBuffering doesn't work on windows im trying to read raw characters from input but modifying the buffer mode to "NoBufferMo...	hSetBuffering stdin NoBuffering doesn't work on windows hSetBuffering stdin NoBuffering doesn't work on windows windows haskell NoBuffering hSetBuffering stdin NoBuffering doesn't work on windows im trying to read raw characters from input but modifying the buffer mode to "NoBufferMode" doesn't seems to work ...	[ -0.0020904541015625, 0.01263427734375, 0.018310546875, -0.001922607421875, -0.01434326171875, 0.0103759765625, 0.027587890625, -0.0155029296875, -0.0096435546875, -0.0017852783203125, -0.013671875, -0.01470947265625, 0.0035247802734375, -0.00750732421875, -0.0191650390625, -0.027099609...	[ 1096, 294, 126, 7235, 18234, 6138, 3035, 438, 214, 22027, 3768, 18, 4488, 98, 54825, 1556, 142508, 12301, 49649, 124850, 107730, 2811, 373, 13736, 5021, 9083, 7464, 144570, 24234, 3525, 2256, 51347, 11782, 46389, 86997 ]	[ 0.107666015625, 0.033416748046875, 0.1434326171875, 0.1220703125, 0.173583984375, 0.1512451171875, 0.1568603515625, 0.1556396484375, 0.061767578125, 0.032012939453125, 0.054901123046875, 0.048492431640625, 0.1181640625, 0.069091796875, 0.17236328125, 0.1177978515625, 0.207275390625, ...	embed
50222098_c0	50222098	haskell	0	Title: Is there Bounded (Maybe a) for un-Bounded a? Problem title: Is there Bounded (Maybe a) for un-Bounded a? Tags: haskell Problem: Is there Bounded (Maybe a) for un-Bounded a? I have a Foldable of Integer s which are unbounded and thus I cannot apply a Max fold to it. Would it make sense to define Max instance of N...	Is there Bounded (Maybe a) for un-Bounded a? Is there Bounded (Maybe a) for un-Bounded a? haskell Bounded Maybe Foldable Integer Max Nothing Ord Semigroup Option Is there Bounded (Maybe a) for un-Bounded a? I have a Foldable of Integer s which are unbounded and thus I cannot apply a Max fold to it. Would it make sense ...	[ -0.01318359375, 0.0137939453125, 0.0286865234375, 0.0111083984375, -0.01092529296875, 0.005157470703125, 0.01397705078125, -0.0203857421875, 0.028076171875, 0.0167236328125, -0.01544189453125, 0.00372314453125, 0.001708984375, 0.0128173828125, 0.0152587890625, -0.0107421875, -0.00772...	[ 2071, 2685, 335, 167457, 82419, 372, 10, 100, 51, 571, 1556, 142508, 83425, 30077, 71, 2886, 44401, 9920, 182747, 35379, 84420, 51588, 86769, 91, 99091, 53418, 59911, 42822, 10422, 61924, 110527, 111, 34292, 959, 32316, 71346, 7413, 143045, ...	[ 0.044830322265625, 0.08953857421875, 0.1224365234375, 0.230712890625, 0.1253662109375, 0.061859130859375, 0.17626953125, 0.0467529296875, 0.118896484375, 0.0977783203125, 0.1234130859375, 0.2142333984375, 0.105712890625, 0.1591796875, 0.101318359375, 0.184814453125, 0.16015625, 0.1...	embed
47468078_c0	47468078	haskell	0	Title: Constructing a reverse order list of Ints in Haskell Problem title: Constructing a reverse order list of Ints in Haskell Tags: haskell Problem: Constructing a reverse order list of Ints in Haskell I understand that I can define an ordered list of integers by use of the construct [1..10]. For example: > [1..10] =...	Constructing a reverse order list of Ints in Haskell Constructing a reverse order list of Ints in Haskell haskell Constructing Ints Haskell Constructing a reverse order list of Ints in Haskell I understand that I can define an ordered list of integers by use of the construct [1..10]. For example: But if I want to defin...	[ -0.01019287109375, 0.00927734375, -0.0020904541015625, 0.01165771484375, -0.0074462890625, 0.0198974609375, -0.013671875, 0.005615234375, -0.003936767578125, 0.0089111328125, 0.01043701171875, -0.0140380859375, 0.02099609375, 0.0174560546875, -0.00823974609375, 0.00150299072265625, 0...	[ 1657, 36716, 39531, 184, 12989, 5303, 360, 933, 20625, 142508, 23, 1556, 28219, 831, 61924, 297, 111, 892, 26255, 4527, 64549, 68252, 5, 963, 21373, 15400, 25632, 4488, 237, 84751, 1284, 27489, 201505 ]	[ 0.0255889892578125, 0.175048828125, 0.1846923828125, 0.1722412109375, 0.1806640625, 0.16796875, 0.1119384765625, 0.1337890625, 0.1280517578125, 0.22119140625, 0.0180816650390625, 0.12109375, 0.027618408203125, 0.0086669921875, 0.1700439453125, 0.08050537109375, 0.005157470703125, 0...	embed

66535628_c0

66535628

haskell

0

Title: What is the difference between install, v1-install, v2-install and new-install? Problem title: What is the difference between install, v1-install, v2-install and new-install? Tags: cabal, cabal-install, haskell Problem: What is the difference between install, v1-install, v2-install and new-install? The commands ...

What is the difference between install, v1-install, v2-install and new-install? What is the difference between install, v1-install, v2-install and new-install? cabal cabal-install haskell What v1-install v2-install What is the difference between install, v1-install, v2-install and new-install? The commands install , v1...

[ 0.0048828125, -0.0185546875, 0.0126953125, 0.016357421875, -0.00970458984375, 0.02197265625, -0.0234375, -0.00148773193359375, 0.01409912109375, 0.0712890625, 0.01483154296875, -0.0181884765625, 0.00958251953125, 0.0038909912109375, -0.023193359375, 0.0074462890625, -0.00741577148437...

[ 70, 60212, 17721, 20600, 81, 20268, 80383, 18504, 136, 3525, 9, 109524, 1556, 142508, 4865, 83, 75101, 7, 42856, 151552, 47, 4153, 92621, 98169, 51042, 332, 1836, 12921, 1632, 15700, 12601, 2822, 35829 ]

[ 0.031158447265625, 0.2093505859375, 0.1312255859375, 0.2427978515625, 0.2000732421875, 0.1875, 0.25927734375, 0.255859375, 0.0531005859375, 0.1796875, 0.057403564453125, 0.2509765625, 0.1064453125, 0.2059326171875, 0.03277587890625, 0.0261688232421875, 0.2021484375, 0.0490417480468...

embed

69525291_c0

69525291

haskell

0

Title: Combining swap and pair function in haskell Problem title: Combining swap and pair function in haskell Tags: haskell Problem: Combining swap and pair function in haskell I am very new to haskell and i have begun reading the book 'programming in haskell'. I came across the function called swap swap (x,y) = (y,x) ...

Combining swap and pair function in haskell Combining swap and pair function in haskell haskell Combining Combining swap and pair function in haskell I am very new to haskell and i have begun reading the book 'programming in haskell'. I came across the function called swap and the function pair. Then i began to wonder ...

[ -0.009521484375, 0.03173828125, -0.0174560546875, -0.00089263916015625, -0.0152587890625, 0.006378173828125, -0.0308837890625, -0.01422119140625, -0.00732421875, 0.00072479248046875, -0.00176239013671875, -0.004486083984375, 0.00732421875, 0.013916015625, -0.00921630859375, -0.00866699...

[ 106935, 592, 202317, 136, 80836, 32354, 1556, 142508, 23, 4552, 3525, 16454, 12877, 28966, 36880, 32195, 7722, 70163, 6626, 209303, 1884, 17368, 494, 147, 237, 4358 ]

[ 0.202880859375, 0.0224151611328125, 0.28369140625, 0.10546875, 0.27197265625, 0.222412109375, 0.144775390625, 0.2415771484375, 0.033721923828125, 0.0189208984375, 0.027618408203125, 0.03924560546875, 0.04052734375, 0.0279388427734375, 0.034576416015625, 0.01287841796875, 0.0972900390...

embed

12687898_c1

12687898

haskell

1

_number | card_number == 2 = ((Card Club R5):(Card Heart J),cardDeck) and now, I need to write the nextGuess code. nextGuess :: ([Card],GameState) -> (Int,Int,Int,Int,Int) ->([Card],GameState) (Int,Int,Int,Int,Int) is the feedback value. How can i represent the first parameter ([Card],GameState) , which means the previ...

[ -0.0133056640625, -0.00170135498046875, -0.0026092529296875, 0.0230712890625, 0.0113525390625, 0.004913330078125, -0.020263671875, -0.003570556640625, 0.0274658203125, 0.00408935546875, -0.01318359375, 0.0107421875, 0.01025390625, 0.0286865234375, -0.00848388671875, -0.0048828125, -0...

[ 2606, 1297, 20596, 69112, 116, 156119, 7687, 627, 43317, 60861, 821, 38931, 120152, 92, 3871, 33022, 11737, 22769, 90, 7, 18151, 107576, 135206, 18, 58269, 34292, 17, 33636, 5117, 171859, 26950, 96362, 57767, 126381, 13547, 28864, 26073, 2062...

[ 0.069091796875, 0.05224609375, 0.190673828125, 0.081787109375, 0.081298828125, 0.1839599609375, 0.181884765625, 0.04071044921875, 0.1158447265625, 0.1485595703125, 0.0982666015625, 0.08612060546875, 0.0926513671875, 0.004180908203125, 0.017974853515625, 0.083740234375, 0.1435546875, ...

embed

38236762_c2

38236762

haskell

2

00s 0.0000s Gen 1 2 colls, 1 par 0.000s 0.000s 0.0002s 0.0003s Parallel GC work balance: 12.41% (serial 0%, perfect 100%) TASKS: 4 (1 bound, 3 peak workers (3 total), using -N2) SPARKS: 40 (10 converted, 0 overflowed, 0 dud, 0 GC'd, 30 fizzled) INIT time 0.000s ( 0.001s elapsed) MUT time 7.453s ( Code signals: Control....

[ 0.004425048828125, 0.0174560546875, -0.012451171875, -0.00738525390625, 0.00506591796875, 0.0020294189453125, 0.005767822265625, -0.02685546875, 0.01348876953125, -0.001556396484375, 0.0019989013671875, -0.01507568359375, 0.0120849609375, 0.0169677734375, 0.003326416015625, 0.006225585...

[ 7227, 7, 89678, 9508, 15937, 106, 116, 122907, 366, 757, 8557, 97259, 123276, 211485, 69657, 4488, 40197, 12, 5035, 617, 13961, 184, 51626, 83137, 15787, 3555, 16, 36195, 20113, 201, 99091, 138, 280, 344, 133325, 6896, 3622, 17368, 20, 83...

[ 0.202392578125, 0.048583984375, 0.1456298828125, 0.2052001953125, 0.2159423828125, 0.123779296875, 0.06781005859375, 0.1419677734375, 0.140625, 0.032928466796875, 0.214599609375, 0.149169921875, 0.1444091796875, 0.287841796875, 0.218017578125, 0.1505126953125, 0.2435302734375, 0.02...

embed

5331380_c0

5331380

haskell

0

Title: Recursion over lists in Haskell Problem title: Recursion over lists in Haskell Tags: recursion, list, haskell, fold Problem: Recursion over lists in Haskell For instance, i have a list like ['a','b','c','d','e']. I want to do something like this: First do something with the first two elements, f 'a' 'b' Then do ...

Recursion over lists in Haskell Recursion over lists in Haskell recursion list haskell fold Recursion Haskell Recursion over lists in Haskell For instance, i have a list like ['a','b','c','d','e']. I want to do something like this: First do something with the first two elements, f 'a' 'b' Then do the same thing with th...

[ -0.0064697265625, -0.000385284423828125, 0.0042724609375, 0.008056640625, 0.0079345703125, 0.01287841796875, -0.0185546875, 0.00024127960205078125, -0.000820159912109375, -0.0186767578125, 0.01116943359375, -0.0301513671875, -0.004180908203125, 0.0159912109375, -0.0076904296875, -0.007...

[ 165428, 42, 6889, 645, 5303, 7, 23, 20625, 142508, 195625, 1830, 1556, 42822, 110527, 765, 1884, 275, 238, 71, 13, 3444, 54, 9844, 903, 23972, 678, 5117, 6626, 80854, 1238, 5701, 30646, 34292, 136, 11737, 12830, 16750, 2203, 4390, 2109, ...

[ 0.1702880859375, 0.1566162109375, 0.1246337890625, 0.1746826171875, 0.2252197265625, 0.081298828125, 0.0303802490234375, 0.15673828125, 0.23681640625, 0.21826171875, 0.0743408203125, 0.134033203125, 0.196044921875, 0.01116943359375, 0.0196380615234375, 0.1068115234375, 0.019851684570...

embed

47857512_c0

47857512

haskell

0

Title: Maximum element on a Tree in haskell? Problem title: Maximum element on a Tree in haskell? Tags: tree, haskell, data-structures Problem: Maximum element on a Tree in haskell? Given a Tree : data Tree a = Empty | Node a [Tree a] deriving Show I am trying to get the maximum element so I've tried: maxElem:: (Ord a)...

Maximum element on a Tree in haskell? Maximum element on a Tree in haskell? tree haskell data-structures Maximum Tree Empty Node Show Ord Maximum element on a Tree in haskell? Given a Tree : I am trying to get the maximum element so I've tried: But I get an error and I don't find it.

[ 0.007415771484375, 0.00665283203125, 0.0186767578125, -0.00860595703125, 0.015869140625, 0.0186767578125, -0.00994873046875, -0.01434326171875, -0.0078125, -0.05322265625, 0.0001926422119140625, -0.0240478515625, 0.01385498046875, -0.01116943359375, 0.012939453125, -0.01904296875, 0....

[ 46540, 316, 12830, 98, 101344, 23, 1556, 142508, 53201, 2053, 137656, 31678, 939, 438, 112, 17367, 35379, 10, 77878, 31577, 2046, 38132, 37842, 18499, 2301, 18, 7413 ]

[ 0.197021484375, 0.1248779296875, 0.199462890625, 0.069091796875, 0.2386474609375, 0.05352783203125, 0.1378173828125, 0.211669921875, 0.13720703125, 0.039337158203125, 0.07568359375, 0.137939453125, 0.058837890625, 0.09735107421875, 0.08038330078125, 0.0771484375, 0.147216796875, 0....

embed

31169262_c0

31169262

haskell

0

Title: Sorting algorithm in Haskell Problem title: Sorting algorithm in Haskell Tags: quicksort, sorting, haskell Problem: Sorting algorithm in Haskell I am trying to implement a very trivial sorting algorithm in Haskell. It compiles but keeps giving me incorrect outputs. Here is the code import Data.List minimum' :: (...

Sorting algorithm in Haskell Sorting algorithm in Haskell quicksort sorting haskell Data.List Sorting Haskell Ord x:xs Sorting algorithm in Haskell I am trying to implement a very trivial sorting algorithm in Haskell. It compiles but keeps giving me incorrect outputs. Here is the code Any thoughts?

[ -0.01068115234375, 0.014892578125, 0.022705078125, -0.03466796875, -0.004913330078125, 0.0091552734375, -0.0015411376953125, -0.0294189453125, 0.005889892578125, -0.006591796875, -0.006561279296875, 0.000766754150390625, 0.00469970703125, -0.005218505859375, -0.0037841796875, -0.005981...

[ 53666, 214, 234873, 23, 20625, 142508, 63773, 62351, 12096, 1556, 11809, 154663, 35379, 1022, 12, 425, 31577, 29479, 4552, 1927, 686, 9969, 1340, 1284, 13695, 214552, 140992, 11853, 18151, 38514 ]

[ 0.1763916015625, 0.0738525390625, 0.225830078125, 0.0506591796875, 0.12646484375, 0.226318359375, 0.11529541015625, 0.20166015625, 0.14599609375, 0.1121826171875, 0.06201171875, 0.087646484375, 0.11883544921875, 0.02911376953125, 0.0048065185546875, 0.052398681640625, 0.0498962402343...

embed

54294951_c2

54294951

haskell

2

out how to use it in a stack-based project (it wraps the system GHC?). Any advice for how to make the core more readable? Code signals: Formatting, GHC, ipv_aAYC, ipv1_aAYD, GHC.Prim.State, Lamdu.Calc.Infer.R:WorldSTInfer, GHC.Prim.RealWorld, Control.Monad.ST.Class.D:R:Worldt, ReaderT, InferEnv, STVar, STRef, Lamdu.Ca...

[ -0.000865936279296875, -0.01507568359375, 0.0211181640625, 0.0006103515625, -0.00518798828125, -0.01513671875, -0.0026092529296875, -0.0235595703125, 0.00958251953125, -0.0235595703125, 0.00872802734375, -0.006622314453125, -0.01055908203125, 0.006988525390625, 0.01129150390625, 0.0060...

[ 1810, 3642, 47, 4527, 442, 23, 177261, 77007, 13452, 217, 137565, 7, 70, 5426, 527, 73265, 194, 28541, 67660, 3249, 56458, 1286, 12301, 2886, 32, 28864, 26073, 12, 60972, 1916, 17, 132059, 11, 51720, 441, 397, 145111, 135206, 59387, 693, ...

[ 0.0784912109375, 0.08966064453125, 0.06365966796875, 0.175048828125, 0.1678466796875, 0.04193115234375, 0.209228515625, 0.1497802734375, 0.1724853515625, 0.10662841796875, 0.1568603515625, 0.11328125, 0.022247314453125, 0.165283203125, 0.1162109375, 0.229736328125, 0.042022705078125,...

embed

57219021_c0

57219021

haskell

0

Title: How is `join` implemented in Maybe/List monad? Problem title: How is `join` implemented in Maybe/List monad? Tags: haskell, monads Problem: How is `join` implemented in Maybe/List monad? join can be defined implemented in terms of >>= : join :: Monad m => m (m a) -> m a join m = m >>= id Specifically, how is it ...

How is `join` implemented in Maybe/List monad? How is `join` implemented in Maybe/List monad? haskell monads How Maybe List Monad Nothing Just How is `join` implemented in Maybe/List monad? join can be defined implemented in terms of >>= : Specifically, how is it implemented in a Maybe and a List monad? Is it in Maybe ...

[ -0.00738525390625, 0.00098419189453125, 0.0250244140625, -0.0031890869140625, 0.003936767578125, 0.0311279296875, -0.0033416748046875, 0.00885009765625, 0.02099609375, 0.0001850128173828125, 0.01123046875, -0.024658203125, -0.010009765625, -0.01611328125, 0.005096435546875, 0.014343261...

[ 11249, 83, 513, 73, 29479, 297, 23, 83425, 64, 154663, 2667, 712, 1556, 142508, 32036, 60331, 71, 182747, 32, 33284, 831, 61924, 69407, 6396, 1369, 3642, 442, 136 ]

[ 0.1358642578125, 0.040802001953125, 0.21923828125, 0.222900390625, 0.2213134765625, 0.080078125, 0.07720947265625, 0.298095703125, 0.049346923828125, 0.190673828125, 0.123291015625, 0.1593017578125, 0.08502197265625, 0.19189453125, 0.193359375, 0.1546630859375, 0.099853515625, 0.09...

embed

2544349_c0

2544349

haskell

0

Title: Why must named functions be in a separate file in hugs? Problem title: Why must named functions be in a separate file in hugs? Tags: haskell, hugs Problem: Why must named functions be in a separate file in hugs? In Haskell in 5 steps the factorial function is defined as follows: let fac n = if n == 0 then 1 else...

Why must named functions be in a separate file in hugs? Why must named functions be in a separate file in hugs? haskell hugs Why n-1 Why must named functions be in a separate file in hugs? In Haskell in 5 steps the factorial function is defined as follows: But for hugs, it says that fac needs to be in fac.h. Can anyone...

[ 0.005584716796875, -0.0169677734375, 0.01416015625, 0.036865234375, -0.0020294189453125, 0.0009918212890625, 0.00927734375, 0.006072998046875, 0.00836181640625, -0.013671875, 0.00168609619140625, -0.045654296875, -0.0179443359375, -0.010498046875, 0.01513671875, -0.005340576171875, 0...

[ 44084, 8110, 24, 4806, 32354, 7, 186, 23, 84797, 11435, 35875, 1556, 142508, 653, 5759, 20625, 190, 98441, 31461, 15403, 61924, 71, 28960, 100, 17378, 7808, 27117, 5, 127, 73342, 15400, 132283, 81273, 205969, 29481 ]

[ 0.09454345703125, 0.1114501953125, 0.162353515625, 0.19580078125, 0.2313232421875, 0.134033203125, 0.035369873046875, 0.101318359375, 0.18408203125, 0.2152099609375, 0.208984375, 0.0965576171875, 0.223876953125, 0.0440673828125, 0.130615234375, 0.1116943359375, 0.07720947265625, 0....

embed

67434679_c0

67434679

haskell

0

Title: I couldn't figure out how to use sInsert function. Can you help me? Problem title: I couldn't figure out how to use sInsert function. Can you help me? Tags: haskell Problem: I couldn't figure out how to use sInsert function. Can you help me? I couldn't figure out how to use sInsert function. Can you he...

I couldn't figure out how to use sInsert function. Can you help me? I couldn't figure out how to use sInsert function. Can you help me? haskell Can Ord Tree Nil Node I couldn't figure out how to use sInsert function. Can you help me? I couldn't figure out how to use sInsert function. Can you help me? sInsert ...

[ -0.012451171875, -0.00115203857421875, 0.015869140625, -0.01434326171875, -0.00135040283203125, 0.00634765625, -0.01275634765625, -0.029052734375, 0.012451171875, -0.002288818359375, 0.0166015625, -0.0203857421875, 0.0028533935546875, -0.01416015625, 0.01019287109375, -0.00738525390625...

[ 69427, 3768, 26366, 1810, 3642, 4527, 91, 4153, 33657, 32354, 4171, 4358, 18, 47, 1556, 142508, 35379, 101344, 77175, 438, 112, 7273 ]

[ 0.06365966796875, 0.043487548828125, 0.0869140625, 0.0430908203125, 0.0562744140625, 0.125244140625, 0.13232421875, 0.1737060546875, 0.287109375, 0.1961669921875, 0.1005859375, 0.0675048828125, 0.03466796875, 0.0228271484375, 0.085693359375, 0.2138671875, 0.1993408203125, 0.1955566...

embed

62249261_c1

62249261

haskell

1

being true. The fix was to change: gotHit = if isUp==True && wasHit==False to gotHit = if up==True && wasHit==False I don't see why the first way is a problem though. Shouldn't "isUp" get evaluated when it needs to be? You can probably imagine the information overload and completely tangent information when trying to ...

[ -0.00885009765625, 0.01318359375, 0.02294921875, -0.006622314453125, -0.005828857421875, 0.0166015625, 0.0230712890625, -0.006805419921875, 0.00958251953125, 0.0208740234375, -0.0048828125, 0.002960205078125, 0.0194091796875, -0.0101318359375, -0.0009307861328125, 0.000946044921875, ...

[ 8035, 29568, 30022, 15549, 4163, 841, 217, 2203, 2174, 83, 53234, 69112, 618, 882, 1230, 509, 17647, 11971, 1257, 1957, 3917, 2967, 151117, 164, 2046, 151575, 297, 3229, 27117, 186, 28987, 4677, 645, 63033, 25269, 26484, 10557, 142508, 2460...

[ 0.1800537109375, 0.2275390625, 0.1597900390625, 0.09173583984375, 0.16552734375, 0.2086181640625, 0.226806640625, 0.0631103515625, 0.1416015625, 0.1575927734375, 0.2491455078125, 0.043060302734375, 0.04339599609375, 0.2025146484375, 0.039337158203125, 0.1461181640625, 0.0955810546875...

embed

38301455_c1

38301455

haskell

1

start end sess lt checksum):acc) Code signals: ErrorError, direct-sqlite, Text.Regex.Base.RegexLike, qualified, Database.SQLite3, segments, SQLite, REGEXP, Text.Regex.PCRE.ByteString, PCRE, UmeQuery, Text, SQLData, Show, Segment, SegmentLabel, SegmentStart, SegmentEnd, Session, LabelType, Checksum, FilePath, Database,...

[ -0.00099945068359375, 0.0194091796875, 0.0118408203125, 0.0262451171875, 0.0059814453125, 0.00101470947265625, 0.000591278076171875, 0.000301361083984375, 0.016845703125, 0.00482177734375, 0.01336669921875, 0.001678466796875, 0.029296875, -0.000058650970458984375, -0.003448486328125, -...

[ 4034, 3564, 3401, 7, 96, 18, 12765, 11832, 2077, 10060, 16, 28864, 26073, 212059, 18468, 31611, 8951, 95255, 67, 24129, 54601, 3355, 63473, 156607, 217225, 187781, 158897, 1486, 363, 33180, 80866, 60280, 26939, 683, 11766, 5, 71713, 2793, 1...

[ 0.142822265625, 0.1634521484375, 0.1312255859375, 0.113037109375, 0.0194091796875, 0.11083984375, 0.2259521484375, 0.2822265625, 0.048248291015625, 0.049774169921875, 0.0015869140625, 0.249267578125, 0.274169921875, 0.139404296875, 0.0814208984375, 0.136962890625, 0.1654052734375, ...

embed

4981817_c0

4981817

haskell

0

Title: Generalized foldr function for trees? Problem title: Generalized foldr function for trees? Tags: tree, haskell, fold Problem: Generalized foldr function for trees? How can I write a generalized foldr function for generic Haskell trees? data (Eq a, Show a) => Tree a = Void | Node a [Tree a] deriving (Eq, Show) tr...

Generalized foldr function for trees? Generalized foldr function for trees? tree haskell fold Generalized Show Tree Node Generalized foldr function for trees? How can I write a generalized foldr function for generic Haskell trees? I'm stuck at the first argument definition... EDIT : what about a more generalized versio...

[ 0.004608154296875, 0.0113525390625, 0.006622314453125, -0.0159912109375, 0.006561279296875, 0.008544921875, -0.024169921875, -0.01806640625, 0.001220703125, -0.0198974609375, -0.00653076171875, -0.0281982421875, -0.01068115234375, 0.0059814453125, -0.00060272216796875, 0.00042152404785...

[ 9082, 29367, 18344, 7569, 32354, 100, 1360, 90, 53201, 1556, 142508, 42822, 17367, 101344, 438, 112, 11249, 33022, 4537, 189534, 20625, 179933, 10750, 80934, 11389, 71864, 5303 ]

[ 0.112060546875, 0.1112060546875, 0.1285400390625, 0.197509765625, 0.1888427734375, 0.0819091796875, 0.1934814453125, 0.069580078125, 0.147216796875, 0.083251953125, 0.1968994140625, 0.1588134765625, 0.122314453125, 0.197265625, 0.066650390625, 0.07275390625, 0.006134033203125, 0.10...

embed

42735454_c0

42735454

haskell

0

Title: Haskell log viewer Problem title: Haskell log viewer Tags: apache-chainsaw, logging, haskell Problem: Haskell log viewer I implemented logging in my program using HSLogger . I use Chainsaw to view the logs. A first concern is that the logs are not updated in real time when I use the option "Open remote log4J Fil...

Haskell log viewer Haskell log viewer apache-chainsaw logging haskell Haskell Haskell log viewer I implemented logging in my program using HSLogger . I use Chainsaw to view the logs. A first concern is that the logs are not updated in real time when I use the option "Open remote log4J File". Other concerns is that HSLo...

[ -0.00121307373046875, 0.031982421875, 0.00982666015625, -0.0108642578125, 0.0247802734375, 0.01300048828125, -0.015869140625, 0.00689697265625, -0.012939453125, -0.03857421875, 0.00555419921875, -0.012451171875, 0.0120849609375, -0.0213623046875, 0.0185546875, -0.0101318359375, -0.02...

[ 20625, 142508, 12684, 21455, 56, 2241, 1430, 115097, 7, 15519, 459, 36659, 1556, 29479, 1528, 17368, 39718, 113972, 1505, 4527, 4841, 55588, 434, 50509, 959, 150011, 2773, 1733, 35829, 103264, 148814, 617, 1375, 42724, 8060, 4734, 13146, 3720...

[ 0.1307373046875, 0.23095703125, 0.18359375, 0.2149658203125, 0.0791015625, 0.0860595703125, 0.073486328125, 0.1787109375, 0.054656982421875, 0.2239990234375, 0.173095703125, 0.140869140625, 0.123046875, 0.11083984375, 0.0794677734375, 0.03961181640625, 0.1282958984375, 0.1724853515...

embed

10447924_c0

10447924

haskell

0

Title: Removes occurrences a given element within a list of lists Problem title: Removes occurrences a given element within a list of lists Tags: haskell Problem: Removes occurrences a given element within a list of lists I have this function which removes occurrences of a given element within the list of lists. remove...

Removes occurrences a given element within a list of lists Removes occurrences a given element within a list of lists haskell an Removes Can Removes occurrences a given element within a list of lists I have this function which removes occurrences of a given element within the list of lists. How would I be able to do th...

[ -0.0135498046875, 0.018798828125, 0.006988525390625, -0.000041484832763671875, -0.00970458984375, -0.0072021484375, 0.01312255859375, 0.0086669921875, -0.0137939453125, -0.00408935546875, -0.003143310546875, 0.010009765625, 0.005584716796875, -0.0031280517578125, -0.02587890625, -0.007...

[ 181139, 7, 74918, 42, 69098, 34475, 12830, 28032, 5303, 111, 1556, 142508, 142, 4171, 10, 765, 903, 32354, 87388, 19048, 54, 5701, 17368, 32036, 46683, 3220, 6889 ]

[ 0.2861328125, 0.115234375, 0.187255859375, 0.1363525390625, 0.1356201171875, 0.1192626953125, 0.1671142578125, 0.1715087890625, 0.215576171875, 0.095703125, 0.154052734375, 0.2298583984375, 0.041778564453125, 0.1663818359375, 0.000823974609375, 0.0252227783203125, 0.024993896484375, ...

embed

11237307_c0

11237307

haskell

0

Title: Haskell, mongodb, date Problem title: Haskell, mongodb, date Tags: haskell, mongodb, bson Problem: Haskell, mongodb, date How would I insert or auto insert date into mongodb from haskell? What is the best way to convert from mongo date type to haskell data type? Say, in a situation where I insert blog post recor...

Haskell, mongodb, date Haskell, mongodb, date haskell mongodb bson Haskell Haskell, mongodb, date How would I insert or auto insert date into mongodb from haskell? What is the best way to convert from mongo date type to haskell data type? Say, in a situation where I insert blog post records (any haskell web framework) ...

[ 0.01129150390625, -0.0068359375, 0.0157470703125, 0.0159912109375, -0.0201416015625, 0.01446533203125, -0.0262451171875, -0.01043701171875, -0.01513671875, -0.02880859375, 0.012451171875, -0.004730224609375, 0.009765625, -0.0263671875, -0.01190185546875, 0.003936767578125, -0.0080566...

[ 20625, 142508, 2667, 7803, 275, 5622, 1556, 876, 1681, 11249, 2806, 183540, 707, 1809, 3934, 1295, 2965, 3917, 96760, 14896, 31, 10644, 47, 2053, 1415, 1305, 115923, 1467, 170846, 3444, 106507, 11907, 17164, 191082, 1672, 142477, 166635, 2803...

[ 0.1502685546875, 0.264404296875, 0.124755859375, 0.1627197265625, 0.2198486328125, 0.18994140625, 0.147705078125, 0.010162353515625, 0.13525390625, 0.00048828125, 0.0321044921875, 0.1668701171875, 0.0158538818359375, 0.1700439453125, 0.093505859375, 0.08148193359375, 0.06256103515625...

embed

24585951_c0

24585951

haskell

0

Title: Cannot call function to concatenate it with a string Problem title: Cannot call function to concatenate it with a string Tags: haskell Problem: Cannot call function to concatenate it with a string This error doesn't make sense for me: url1 = "https://someUrl.com/" url2 = url1 ++ "/fdsfdsfd/fdsgfdgfd" No instance...

Cannot call function to concatenate it with a string Cannot call function to concatenate it with a string haskell a Cannot url1 someUrl.com url2 Num Char Possible Cannot call function to concatenate it with a string This error doesn't make sense for me: What's the matter? Syntax-wise, everything is ok, isn't it?

[ -0.0007171630859375, -0.00860595703125, 0.00144195556640625, 0.021240234375, -0.0101318359375, 0.017578125, -0.0030517578125, 0.005126953125, 0.0029144287109375, -0.041015625, -0.027099609375, -0.058349609375, 0.003387451171875, 0.000591278076171875, 0.004974365234375, -0.03271484375, ...

[ 4171, 10869, 11782, 32354, 47, 158, 33478, 76, 67, 442, 678, 79315, 1556, 142508, 25002, 418, 3060, 48743, 141, 277, 304, 52782, 21656, 115861, 18499, 10422, 26866, 86531, 26818, 3664 ]

[ 0.09375, 0.188232421875, 0.182373046875, 0.2041015625, 0.01959228515625, 0.108154296875, 0.181884765625, 0.13134765625, 0.04669189453125, 0.012176513671875, 0.130859375, 0.2159423828125, 0.126953125, 0.2113037109375, 0.1304931640625, 0.0870361328125, 0.09405517578125, 0.09118652343...

embed

39549204_c0

39549204

haskell

0

Title: Haskell about how to separate the last number from a string number Problem title: Haskell about how to separate the last number from a string number Tags: haskell Problem: Haskell about how to separate the last number from a string number I have a question about haskell in seperation the last number from a strin...

Haskell about how to separate the last number from a string number Haskell about how to separate the last number from a string number haskell a Haskell Haskell about how to separate the last number from a string number I have a question about haskell in seperation the last number from a string number. For example, inpu...

[ 0.003173828125, -0.002685546875, -0.01251220703125, -0.000274658203125, -0.028564453125, 0.02490234375, -0.002288818359375, -0.0072021484375, 0.00141143798828125, -0.01416015625, -0.0093994140625, -0.0341796875, -0.006622314453125, 0.00860595703125, -0.0223388671875, -0.0162353515625, ...

[ 20625, 142508, 1672, 3642, 84797, 4568, 14012, 1295, 79315, 1556, 10, 87, 9655, 40, 1264, 2320, 70, 107730, 83, 190875, 140992, 21204, 82449, 56037, 1284, 959, 4488 ]

[ 0.1318359375, 0.2138671875, 0.03302001953125, 0.04833984375, 0.20361328125, 0.226318359375, 0.19482421875, 0.1226806640625, 0.2037353515625, 0.1346435546875, 0.004486083984375, 0.0029296875, 0.045318603515625, 0.06671142578125, 0.1597900390625, 0.0560302734375, 0.0025634765625, 0.1...

embed

46789241_c0

46789241

haskell

0

Title: Redirections in Servant Problem title: Redirections in Servant Tags: haskell, servant Problem: Redirections in Servant What's the appropriate way to make a Servant handler respond with a redirection? I am working in a navigation REST app and I would like to respond to POST requests that create resources with a r...

Redirections in Servant Redirections in Servant haskell servant Redirections Servant Redirections in Servant What's the appropriate way to make a Servant handler respond with a redirection? I am working in a navigation REST app and I would like to respond to POST requests that create resources with a redirection to the...

[ -0.0162353515625, 0.0013275146484375, 0.02294921875, -0.00341796875, -0.010009765625, -0.0177001953125, -0.0201416015625, -0.01434326171875, -0.00286865234375, -0.0093994140625, 0.01068115234375, -0.006439208984375, 0.0003566741943359375, 0.00927734375, 0.00311279296875, 0.008911132812...

[ 853, 80581, 17514, 23, 5406, 30624, 1556, 142508, 187646, 95307, 3917, 3249, 35863, 35644, 678, 456, 936, 58994, 20697, 134470, 21828, 4027, 81903, 50336, 28282, 65514, 42518, 79794, 177953, 5303, 60875, 248, 3584, 232, 5608, 47, 7103, 105233...

[ 0.1416015625, 0.24072265625, 0.086181640625, 0.056640625, 0.17236328125, 0.242431640625, 0.1171875, 0.164794921875, 0.2171630859375, 0.0924072265625, 0.047454833984375, 0.07354736328125, 0.1990966796875, 0.2056884765625, 0.0572509765625, 0.149169921875, 0.1890869140625, 0.164184570...

embed

3177545_c0

3177545

haskell

0

Title: Haskell sorting of an unorderable list using a proxy order Problem title: Haskell sorting of an unorderable list using a proxy order Tags: haskell, sorting Problem: Haskell sorting of an unorderable list using a proxy order Suppose I have x :: [(n, a)] where n is a number and a is an unorderable item (is not of ...

Haskell sorting of an unorderable list using a proxy order Haskell sorting of an unorderable list using a proxy order haskell sorting a Haskell Haskell sorting of an unorderable list using a proxy order Suppose I have x :: [(n, a)] where n is a number and a is an unorderable item (is not of class Ord). I want to sort t...

[ 0.00131988525390625, 0.0233154296875, 0.00604248046875, -0.031982421875, -0.00909423828125, -0.0086669921875, -0.01470947265625, -0.0137939453125, 0.01031494140625, -0.0111083984375, -0.0244140625, -0.00543212890625, 0.016845703125, -0.00390625, -0.001434326171875, -0.0181884765625, ...

[ 20625, 142508, 12096, 214, 51, 80596, 2886, 5303, 17368, 502, 50878, 12989, 111, 1556, 10, 765, 1022, 1984, 19, 653, 14012, 83, 35735, 959, 18507, 35379, 3444, 390, 53418, 6637, 831, 91995, 136044, 93457, 3525, 6506, 37202, 1884, 70425, 2...

[ 0.126708984375, 0.2039794921875, 0.2225341796875, 0.049163818359375, 0.104736328125, 0.181640625, 0.1541748046875, 0.1744384765625, 0.02545166015625, 0.147216796875, 0.2484130859375, 0.2037353515625, 0.027191162109375, 0.132568359375, 0.0909423828125, 0.03216552734375, 0.083984375, ...

embed

61534034_c0

61534034

haskell

0

Title: file descriptor out of range for select - Recompile with -threaded to work around this Problem title: file descriptor out of range for select - Recompile with -threaded to work around this Tags: haskell Problem: file descriptor out of range for select - Recompile with -threaded to work around this I had a Haskel...

file descriptor out of range for select - Recompile with -threaded to work around this file descriptor out of range for select - Recompile with -threaded to work around this haskell Recompile file descriptor out of range for select - Recompile with -threaded to work around this I had a Haskell application crash today w...

[ 0.00958251953125, 0.00469970703125, -0.0033721923828125, 0.01202392578125, -0.004425048828125, -0.006378173828125, -0.016845703125, 0.032470703125, 0.00213623046875, -0.034423828125, 0.013916015625, -0.028564453125, -0.01458740234375, 0.00823974609375, 0.00592041015625, -0.006469726562...

[ 11435, 104, 121707, 1810, 111, 37457, 100, 36849, 853, 58875, 1340, 678, 20, 927, 39116, 297, 4488, 10932, 903, 1556, 142508, 20625, 38415, 150631, 18925, 18499, 26008, 831, 86869, 4865, 14602, 29459 ]

[ 0.1444091796875, 0.08270263671875, 0.2462158203125, 0.1463623046875, 0.1416015625, 0.2008056640625, 0.0226287841796875, 0.1605224609375, 0.08099365234375, 0.1236572265625, 0.1380615234375, 0.06292724609375, 0.0833740234375, 0.07513427734375, 0.2265625, 0.211669921875, 0.0358581542968...

embed

69553129_c0

69553129

haskell

0

Title: tryhaskell.org does not seem to support GHCi commands Problem title: tryhaskell.org does not seem to support GHCi commands Tags: ghci, haskell Problem: tryhaskell.org does not seem to support GHCi commands When I use GHCi commands (i.e. any command starting with ":" for example :set +t ) on https://tryhaskell.or...

tryhaskell.org does not seem to support GHCi commands tryhaskell.org does not seem to support GHCi commands ghci haskell tryhaskell.org GHCi tryhaskell.org does not seem to support GHCi commands When I use GHCi commands (i.e. any command starting with ":" for example :set +t ) on https://tryhaskell.org/ I get an error:...

[ -0.002593994140625, 0.00909423828125, -0.00115203857421875, 0.01226806640625, 0.0011138916015625, -0.00174713134765625, -0.00970458984375, -0.002349853515625, -0.00872802734375, -0.0181884765625, 0.0040283203125, -0.039794921875, 0.00994873046875, 0.00933837890625, 0.004913330078125, 0...

[ 9790, 10557, 142508, 1478, 959, 48903, 8060, 527, 73265, 14, 75101, 31380, 318, 1556, 4527, 2499, 72134, 678, 12, 3509, 997, 18, 15123, 18499, 209806, 903, 5608, 4488, 53418, 5045, 4677, 37842, 107, 2424 ]

[ 0.166748046875, 0.1190185546875, 0.2451171875, 0.145263671875, 0.07220458984375, 0.0382080078125, 0.1787109375, 0.1046142578125, 0.15478515625, 0.20751953125, 0.2208251953125, 0.1107177734375, 0.1121826171875, 0.10791015625, 0.07080078125, 0.001373291015625, 0.0887451171875, 0.0321...

embed

64589261_c0

64589261

haskell

0

Title: Haskell: treat newtype as String Problem title: Haskell: treat newtype as String Tags: haskell Problem: Haskell: treat newtype as String I often have this simple pattern: newtype Username = Username Text The purpose is of course to increase security when manipulating "Username" and not mix it with other fields. ...

Haskell: treat newtype as String Haskell: treat newtype as String haskell Haskell Username Text Haskell: treat newtype as String I often have this simple pattern: The purpose is of course to increase security when manipulating "Username" and not mix it with other fields. However, packing and unpacking it all the time b...

[ 0.010986328125, -0.0172119140625, 0.015625, 0.0322265625, -0.0019378662109375, 0.027099609375, 0.000579833984375, 0.00098419189453125, 0.004669189453125, 0.011962890625, 0.008544921875, -0.02587890625, -0.0028839111328125, 0.00107574462890625, -0.016845703125, -0.00616455078125, 0.01...

[ 20625, 142508, 85689, 3525, 50986, 237, 23351, 214, 1556, 53400, 11627, 24129, 27983, 8781, 103510, 60042, 51312, 48031, 45258, 1062, 2189, 17664, 44457, 43824, 29102, 1733, 24209, 120, 5670, 32195, 88308, 1957, 10, 1301, 71713, 9578, 63033, ...

[ 0.1170654296875, 0.2099609375, 0.1478271484375, 0.1348876953125, 0.286376953125, 0.1260986328125, 0.1929931640625, 0.1256103515625, 0.10162353515625, 0.1375732421875, 0.2164306640625, 0.1640625, 0.0816650390625, 0.049285888671875, 0.1435546875, 0.114990234375, 0.1123046875, 0.11962...

embed

13892337_c0

13892337

haskell

0

Title: Why does haskell evaluate a in a >> b? Problem title: Why does haskell evaluate a in a >> b? Tags: functional-programming, operators, monads, haskell Problem: Why does haskell evaluate a in a >> b? The >> operator for Monads in haskell is often defined as (>>) :: m a -> m b -> m b a >> b = a >>= \_ -...

Why does haskell evaluate a in a >> b? Why does haskell evaluate a in a >> b? functional-programming operators monads haskell Why Why does haskell evaluate a in a >> b? The >> operator for Monads in haskell is often defined as It can be used to print things like Why does the compiler not optimize away the v...

[ -0.00421142578125, -0.0029449462890625, 0.024169921875, 0.018310546875, 0.0091552734375, -0.006683349609375, -0.005584716796875, -0.01611328125, 0.006866455078125, 0.01226806640625, -0.00872802734375, -0.003143310546875, -0.003509521484375, 0.00168609619140625, 0.0014190673828125, -0.0...

[ 44084, 1556, 142508, 151575, 13, 10, 23, 5386, 1230, 876, 619, 123309, 28966, 39933, 2667, 712, 14602, 6396, 60331, 6468, 27983, 61924, 831, 11814, 28412, 9969, 34759, 959, 15572, 16065, 34292, 3884, 71713, 3584, 31, 866, 19, 1299, 3871, ...

[ 0.1448974609375, 0.1536865234375, 0.25927734375, 0.195068359375, 0.059967041015625, 0.0963134765625, 0.0943603515625, 0.1402587890625, 0.013397216796875, 0.126220703125, 0.004791259765625, 0.1129150390625, 0.05621337890625, 0.22900390625, 0.08642578125, 0.111083984375, 0.022842407226...

embed

35112489_c0

35112489

haskell

0

Title: Geometric point data type - tuple vs record? Problem title: Geometric point data type - tuple vs record? Tags: haskell Problem: Geometric point data type - tuple vs record? I can think of three ways to define a geometric point as an algebraic data type in Haskell. I want to define it as an algebraic data type fo...

Geometric point data type - tuple vs record? Geometric point data type - tuple vs record? haskell Geometric Point Geometric point data type - tuple vs record? I can think of three ways to define a geometric point as an algebraic data type in Haskell. I want to define it as an algebraic data type for better documentatio...

[ 0.01806640625, 0.00982666015625, -0.002349853515625, 0.0037384033203125, -0.00189208984375, -0.000675201416015625, -0.005126953125, 0.0014495849609375, 0.009033203125, 0.01373291015625, -0.0025177001953125, -0.0184326171875, -0.0079345703125, 0.008544921875, -0.021728515625, 0.00331115...

[ 30152, 186518, 6275, 2053, 10644, 370, 8705, 20209, 17164, 1556, 142508, 41097, 831, 5351, 17262, 48322, 61924, 10, 84183, 238, 237, 144, 429, 2844, 1771, 23, 20625, 11522, 209806, 1301, 4331, 40946, 15400 ]

[ 0.13671875, 0.22265625, 0.177734375, 0.160400390625, 0.19482421875, 0.1192626953125, 0.1968994140625, 0.1138916015625, 0.236572265625, 0.1146240234375, 0.2340087890625, 0.169921875, 0.00146484375, 0.0198822021484375, 0.08111572265625, 0.050506591796875, 0.11962890625, 0.01496887207...

embed

50159349_c1

50159349

haskell

1

and it would readily be accepted if I could write g like this: g :: (forall f. Functor f => Secret f) -> Int g h = f 4 (\\f -> h @f) Where \\ is hypothetical syntax for System Fw's big lambda, i.e. type abstraction. I can emulate this with ugly Proxy s, but is there some other GHC Haskell feature that let's me write s...

[ -0.000637054443359375, 0.01092529296875, -0.02392578125, -0.0322265625, 0.01251220703125, -0.016845703125, -0.005828857421875, 0.0208740234375, 0.00921630859375, -0.0045166015625, -0.005615234375, -0.01123046875, 0, 0.00421142578125, 0.003387451171875, -0.00738525390625, -0.005798339...

[ 2806, 12301, 20102, 186, 68186, 71, 2174, 5809, 33022, 706, 1884, 903, 1984, 5584, 1238, 28670, 18770, 39008, 33079, 360, 18, 1096, 2203, 201, 420, 1374, 18991, 170933, 70760, 6002, 86531, 12353, 563, 434, 6957, 21, 6492, 85, 10644, 16478...

[ 0.009429931640625, 0.03375244140625, 0.0291595458984375, 0.0157470703125, 0.08599853515625, 0.0167083740234375, 0.005462646484375, 0.0765380859375, 0.173095703125, 0.1644287109375, 0.1143798828125, 0.09490966796875, 0.122802734375, 0.1014404296875, 0.1038818359375, 0.119140625, 0.126...

embed

72738622_c1

72738622

haskell

1

single pattern function match case that can take care of #3, I can't think of a way for #4 to work, as I think I would be forced to build a list while traversing the given list. But the list being built might not even be returned if a PCall is found, which means extra work was done for nothing. How should I go about t...

[ -0.02978515625, 0.0164794921875, 0.0032806396484375, -0.0020599365234375, 0.00167083740234375, 0.01031494140625, -0.0196533203125, -0.01214599609375, 0.03173828125, -0.01495361328125, 0.022216796875, -0.0155029296875, 0.01055908203125, -0.017822265625, -0.00811767578125, 0.003234863281...

[ 11001, 103510, 32354, 14858, 7225, 831, 5646, 517, 111378, 18, 5351, 3917, 468, 617, 4488, 168861, 45367, 5303, 37317, 34475, 88303, 13648, 959, 176377, 6107, 5584, 14037, 4173, 33720, 1672, 903, 61924, 15700, 30793, 29479, 28864, 26073, 9876...

[ 0.1895751953125, 0.2498779296875, 0.1663818359375, 0.18603515625, 0.15087890625, 0.027374267578125, 0.0203094482421875, 0.11767578125, 0.1246337890625, 0.006103515625, 0.0538330078125, 0.032440185546875, 0.0162811279296875, 0.179443359375, 0.07421875, 0.0565185546875, 0.1044311523437...

embed

30260610_c1

30260610

haskell

1

Ref treeRef UI.liftIO $ writeFile ".Hoed/debugTree.dot" (shw $ summarize tree mcv) UI.liftIO $ system $ "dot -Tpng -Gsize=9,5 -Gdpi=100 .Hoed/debugTree.dot " ++ "> .Hoed/wwwroot/debugTree.png" UI.element img # UI.set UI.src "static/debugTree.png" return () My full code for Threepenny-gui 0.5 is here: https://github.com...

[ -0.008056640625, 0.0255126953125, -0.007537841796875, -0.00159454345703125, 0.0125732421875, 0.0145263671875, -0.0184326171875, -0.020263671875, 0.0014495849609375, -0.0157470703125, 0.002777099609375, -0.0093994140625, 0.015869140625, 0.01312255859375, 0.0179443359375, -0.0048828125, ...

[ 53295, 53201, 190015, 111481, 104501, 17780, 3650, 33022, 174350, 11193, 297, 112, 85779, 62731, 13, 15464, 434, 29334, 14096, 334, 5426, 128468, 62539, 93754, 1434, 3559, 37223, 1574, 148920, 62766, 566, 3509, 19437, 201939, 30646, 4393, 18151...

[ 0.235107421875, 0.2188720703125, 0.2900390625, 0.1700439453125, 0.224853515625, 0.23388671875, 0.0760498046875, 0.146484375, 0.207275390625, 0.1170654296875, 0.1932373046875, 0.1416015625, 0.2430419921875, 0.23828125, 0.1085205078125, 0.1497802734375, 0.03399658203125, 0.1350097656...

embed

31274733_c0

31274733

haskell

0

Title: Haskell and Emacs Problem title: Haskell and Emacs Tags: haskell-mode, emacs, haskell Problem: Haskell and Emacs I'm trying to learn Haskell. I have configured Emacs for Haskell development, I followed this blog post: http://tim.dysinger.net/posts/2014-02-18-haskell-with-emacs.html The system works but I always ...

Haskell and Emacs Haskell and Emacs haskell-mode emacs haskell Haskell Emacs Haskell and Emacs I'm trying to learn Haskell. I have configured Emacs for Haskell development, I followed this blog post: http://tim.dysinger.net/posts/2014-02-18-haskell-with-emacs.html The system works but I always get this error: I looked ...

[ 0.0096435546875, -0.0024261474609375, 0.0010223388671875, -0.0089111328125, -0.0040283203125, 0.034423828125, -0.0206298828125, 0.00653076171875, -0.00274658203125, -0.018798828125, -0.0011749267578125, -0.0164794921875, 0.00860595703125, 0.01385498046875, -0.006011962890625, -0.009704...

[ 20625, 142508, 136, 85269, 4439, 1556, 61170, 352, 2263, 31577, 30698, 222495, 34754, 134629, 1415, 1305, 5083, 21228, 1819, 10557, 76228, 11883, 5426, 43240, 1284, 11343, 903, 18499, 87, 54811, 1257, 102158, 77336, 61924, 959, 3714, 15400, 1...

[ 0.1611328125, 0.262939453125, 0.0985107421875, 0.191162109375, 0.1876220703125, 0.16455078125, 0.150146484375, 0.11767578125, 0.1099853515625, 0.037109375, 0.06695556640625, 0.142822265625, 0.09478759765625, 0.055816650390625, 0.015716552734375, 0.014862060546875, 0.07196044921875, ...

embed

13078583_c0

13078583

haskell

0

Title: Haskell recursion ":" replaced by || why? Problem title: Haskell recursion ":" replaced by || why? Tags: recursion, haskell Problem: Haskell recursion ":" replaced by || why? I have a question why this function cannot work with ":" but works with || and why ":" is replaced by || I mean why ca...

Haskell recursion ":" replaced by || why? Haskell recursion ":" replaced by || why? recursion haskell Haskell Bool y:ys Haskell recursion ":" replaced by || why? I have a question why this function cannot work with ":" but works with || and why ":" is replaced by || I mean why cannot write contains ...

[ -0.01129150390625, 0.0016937255859375, 0.0005950927734375, 0.0150146484375, -0.006072998046875, -0.007476806640625, 0.0025787353515625, -0.019287109375, -0.00640869140625, -0.000705718994140625, 0.006500244140625, 0.003448486328125, 0.0213623046875, -0.0194091796875, 0.0223388671875, -...

[ 20625, 142508, 195625, 1830, 41502, 12, 1230, 91995, 71, 15400, 1556, 2460, 929, 113, 4778, 9655, 903, 32354, 53418, 4488, 678, 1284, 43240, 33022, 70541, 7, 1022, 53, 183114 ]

[ 0.1451416015625, 0.23779296875, 0.2371826171875, 0.1103515625, 0.09326171875, 0.1766357421875, 0.04376220703125, 0.14013671875, 0.018218994140625, 0.1258544921875, 0.1260986328125, 0.0677490234375, 0.1729736328125, 0.08160400390625, 0.1473388671875, 0.030242919921875, 0.0560913085937...

embed

9849355_c1

9849355

haskell

1

", and end it there. It sort of does, I do get 1, 2 in the list, but why is it not exhaustive? Thanks in advanced. Thank you for the help Tikhon changed my function to this: data Tree a = Empty | Branch a (Tree a) (Tree a) deriving (Show, Eq) internals :: Tree a -> [a] internals (Branch a Empty Empty) = [] internals (B...

[ -0.005279541015625, -0.0125732421875, 0.000408172607421875, 0.01519775390625, 0.0074462890625, 0.03125, -0.01300048828125, -0.017822265625, -0.004119873046875, -0.0252685546875, 0.004180908203125, -0.0007781982421875, 0.0118408203125, 0.0113525390625, 0.027099609375, 0.013671875, 0.0...

[ 44, 136, 3564, 442, 2685, 1650, 12096, 14602, 2046, 106, 116, 5303, 1284, 15400, 83, 959, 146353, 5844, 175961, 4358, 2371, 68384, 98816, 759, 32354, 47, 903, 2053, 101344, 10, 2203, 31678, 939, 21110, 206, 62731, 16406, 6496, 168660, 864...

[ 0.0743408203125, 0.003753662109375, 0.181884765625, 0.05029296875, 0.10601806640625, 0.0194549560546875, 0.0347900390625, 0.0870361328125, 0.047454833984375, 0.0153350830078125, 0.044891357421875, 0.138916015625, 0.005523681640625, 0.099609375, 0.0634765625, 0.158203125, 0.23046875, ...

embed

65445169_c0

65445169

haskell

0

Title: Question about the argument type of sqrt and round Problem title: Question about the argument type of sqrt and round Tags: types, haskell Problem: Question about the argument type of sqrt and round following the signature: sqrt :: Floating a => a -> a why is (sqrt 2) legal? Isn't the number 2 a Integer which def...

Question about the argument type of sqrt and round Question about the argument type of sqrt and round types haskell Question Floating RealFrac Integral Question about the argument type of sqrt and round following the signature: why is (sqrt 2) legal? Isn't the number 2 a Integer which definitely doesn't satisfy Floatin...

[ -0.000942230224609375, -0.0087890625, -0.00933837890625, 0.0174560546875, 0.0166015625, 0.00946044921875, -0.012451171875, -0.0167236328125, -0.00811767578125, 0.0126953125, -0.00799560546875, -0.04931640625, -0.01007080078125, 0.004486083984375, -0.01263427734375, -0.0068359375, -0....

[ 68185, 1672, 10750, 10644, 91, 864, 3198, 136, 68807, 52895, 1556, 142508, 38699, 26518, 5120, 919, 20251, 204681, 25632, 138256, 15400, 83, 7, 4958, 8437, 14012, 116, 10, 44401, 58621, 22027, 18, 40407, 30646, 27117, 4764 ]

[ 0.1260986328125, 0.0399169921875, 0.2249755859375, 0.1512451171875, 0.051300048828125, 0.1510009765625, 0.214111328125, 0.0927734375, 0.1953125, 0.1434326171875, 0.1043701171875, 0.2103271484375, 0.1268310546875, 0.10589599609375, 0.1212158203125, 0.0174713134765625, 0.1685791015625,...

embed

6172573_c0

6172573

haskell

0

Title: Haskell list comprehension Problem title: Haskell list comprehension Tags: haskell Problem: Haskell list comprehension sum1::[Int]->[Int] sum1 [] =0 sum1 (x:xs) = [x|x<-xs,x `mod` 2 ==0] I need to return the numbers which are divisible by 2 when a list is provided, but the above code gives me this compile error:...

Haskell list comprehension Haskell list comprehension haskell Haskell sum1 x:xs Instance Num Haskell list comprehension I need to return the numbers which are divisible by 2 when a list is provided, but the above code gives me this compile error: Also please explain what (x:xs) does. Is it ' X element of xs list?' If w...

[ -0.02978515625, 0.0140380859375, 0.0230712890625, -0.00072479248046875, 0.01708984375, 0.041748046875, 0.00848388671875, 0.0166015625, 0.0169677734375, -0.01025390625, 0.004730224609375, -0.036376953125, 0.037109375, -0.004547119140625, -0.01373291015625, 0.0091552734375, 0.013305664...

[ 20625, 142508, 5303, 46683, 3220, 1556, 10554, 418, 1022, 12, 425, 7, 116071, 52782, 3871, 30646, 101935, 45, 99017, 390, 116, 62952, 70, 36917, 18151, 903, 9969, 1340, 18499, 73342, 14602, 1193, 12830, 111, 3444, 2046, 653, 927 ]

[ 0.1146240234375, 0.1756591796875, 0.1788330078125, 0.088623046875, 0.08941650390625, 0.1146240234375, 0.174072265625, 0.0294647216796875, 0.087890625, 0.1005859375, 0.171142578125, 0.1378173828125, 0.1611328125, 0.1314697265625, 0.045623779296875, 0.151611328125, 0.1527099609375, 0...

embed

33851495_c0

33851495

haskell

0

Title: Recurrence relations in haskell Problem title: Recurrence relations in haskell Tags: recurrence, haskell Problem: Recurrence relations in haskell I'm new to Haskell and still haven't figured out how to do anything realistic. I've looked at examples of recurrence relations but the implementation is too advanced f...

Recurrence relations in haskell Recurrence relations in haskell recurrence haskell Recurrence i-1 Recurrence relations in haskell I'm new to Haskell and still haven't figured out how to do anything realistic. I've looked at examples of recurrence relations but the implementation is too advanced for me at the moment. I'...

[ -0.0162353515625, -0.004241943359375, 0.003326416015625, 0.00836181640625, 0.0035552978515625, -0.013671875, -0.005218505859375, 0.00872802734375, 0.0004634857177734375, -0.01226806640625, -0.01458740234375, -0.0213623046875, -0.0016632080078125, 0.00457763671875, 0.01226806640625, -0....

[ 853, 64240, 6620, 91582, 23, 1556, 142508, 456, 17, 5759, 3525, 47, 20625, 7464, 38246, 26366, 61207, 27781, 208124, 5792, 175961, 3095, 5423, 1257, 41911, 52895, 107730, 1238, 132, 11, 4, 275, 61924, 442, 4537 ]

[ 0.1263427734375, 0.26220703125, 0.08184814453125, 0.2158203125, 0.04925537109375, 0.148681640625, 0.189697265625, 0.1258544921875, 0.0908203125, 0.09356689453125, 0.0634765625, 0.0272674560546875, 0.1265869140625, 0.006988525390625, 0.006561279296875, 0.052093505859375, 0.12341308593...

embed

2333613_c0

2333613

haskell

0

Title: Which tree-based dictionary is the easiest to implement functionally? Problem title: Which tree-based dictionary is the easiest to implement functionally? Tags: data-structures, haskell Problem: Which tree-based dictionary is the easiest to implement functionally? I'm looking for a tree-based dictionary data str...

Which tree-based dictionary is the easiest to implement functionally? Which tree-based dictionary is the easiest to implement functionally? data-structures haskell Which Which tree-based dictionary is the easiest to implement functionally? I'm looking for a tree-based dictionary data structure which is easy to implemen...

[ 0.032470703125, -0.000972747802734375, -0.0089111328125, -0.01519775390625, 0.00162506103515625, -0.0098876953125, -0.0030670166015625, -0.0106201171875, -0.0029144287109375, -0.01806640625, -0.0062255859375, -0.0301513671875, 0.00007295608520507812, 0.00994873046875, 0.0169677734375, ...

[ 130078, 53201, 9, 77007, 45, 10763, 6635, 70, 28, 1544, 525, 47, 29479, 123309, 538, 83, 2053, 137656, 1556, 142508, 16487, 45646, 23468, 20625, 16981, 62, 92414, 1360, 90, 45176, 47644, 91, 20706, 561, 22819 ]

[ 0.05322265625, 0.2327880859375, 0.03350830078125, 0.1617431640625, 0.115966796875, 0.1646728515625, 0.1453857421875, 0.033721923828125, 0.074462890625, 0.1619873046875, 0.13134765625, 0.046173095703125, 0.199951171875, 0.1387939453125, 0.017303466796875, 0.0198516845703125, 0.0985107...

embed

39251728_c0

39251728

haskell

0

Title: ghci randomio type inference Problem title: ghci randomio type inference Tags: ghci, haskell Problem: ghci randomio type inference I am following https://en.wikibooks.org/wiki/Haskell/Understanding_monads/State , and randomIO prints an integer in ghci directly. Given its type is polymorphic, how does ghci know i...

ghci randomio type inference ghci randomio type inference ghci haskell GHCi System.Random Random ghci randomio type inference I am following https://en.wikibooks.org/wiki/Haskell/Understanding_monads/State , and randomIO prints an integer in ghci directly. Given its type is polymorphic, how does ghci know it's Int here...

[ -0.005035400390625, -0.0169677734375, 0.0067138671875, 0.0252685546875, 0.00775146484375, 0.019287109375, 0.0084228515625, -0.00714111328125, -0.01220703125, -0.0211181640625, 0.00518798828125, -0.048828125, -0.00970458984375, 0.00506591796875, 0.0262451171875, -0.006256103515625, 0....

[ 31380, 318, 96759, 846, 10644, 53498, 6620, 1556, 142508, 527, 73265, 14, 12353, 126525, 3815, 39643, 306, 25632, 81415, 13691, 6495, 7, 7944, 144057, 87039, 6468, 135206, 17780, 28412, 892, 1505, 23, 105237, 35874, 178851, 1771, 3642, 14602,...

[ 0.1427001953125, 0.179931640625, 0.198974609375, 0.21435546875, 0.2332763671875, 0.2001953125, 0.083984375, 0.134033203125, 0.22216796875, 0.07012939453125, 0.107666015625, 0.190185546875, 0.1270751953125, 0.0623779296875, 0.07537841796875, 0.120361328125, 0.04119873046875, 0.05895...

embed

2763864_c0

2763864

haskell

0

Title: Multithreaded Haskell Problem title: Multithreaded Haskell Tags: multicore, haskell, parallel-processing, multithreading Problem: Multithreaded Haskell I'm learning Haskell and I'd like to write some multithreaded programs now to see the performance gains from that in a functional language. I can find some refer...

Multithreaded Haskell Multithreaded Haskell multicore haskell parallel-processing multithreading Multithreaded Haskell Multithreaded Haskell I'm learning Haskell and I'd like to write some multithreaded programs now to see the performance gains from that in a functional language. I can find some references to it on the...

[ -0.0004367828369140625, 0.0024261474609375, 0.003204345703125, 0.007049560546875, 0.0023040771484375, -0.00096893310546875, -0.01385498046875, -0.01220703125, -0.016357421875, -0.07080078125, 0.0022735595703125, -0.0196533203125, -0.01239013671875, 0.01214599609375, -0.00927734375, 0.0...

[ 19335, 927, 39116, 297, 20625, 142508, 6024, 30854, 1556, 95103, 63923, 3869, 65847, 11, 6238, 52080, 1884, 33022, 712, 103391, 5036, 1957, 23718, 21647, 123309, 46876, 91067, 442, 1820, 8306, 27798, 39864, 6275, 17997, 28219, 93002, 6002, 86...

[ 0.138671875, 0.05584716796875, 0.211181640625, 0.05596923828125, 0.15185546875, 0.2198486328125, 0.0960693359375, 0.1649169921875, 0.1376953125, 0.1392822265625, 0.0928955078125, 0.1595458984375, 0.19384765625, 0.06060791015625, 0.00921630859375, 0.0789794921875, 0.06671142578125, ...

embed

21799853_c0

21799853

haskell

0

Title: Define methods for subclasses of type classes Problem title: Define methods for subclasses of type classes Tags: haskell, typeclass Problem: Define methods for subclasses of type classes I tried this: class Functor f where fmap :: (a -> b) -> f a -> f b class (Functor f) => Applicative f where pure :: a -> f a (...

Define methods for subclasses of type classes Define methods for subclasses of type classes haskell typeclass Define Functor Applicative Define methods for subclasses of type classes I tried this: I got this: How to define fmap for Applicative and other subclasses of Functor ?

[ 0.00762939453125, 0.00653076171875, 0.005523681640625, 0.0272216796875, 0.010986328125, 0.007568359375, -0.004852294921875, 0.002044677734375, 0.00933837890625, 0.00787353515625, -0.01904296875, -0.03662109375, -0.0091552734375, 0.036376953125, -0.0172119140625, -0.00634765625, 0.015...

[ 262, 64552, 150624, 100, 1614, 67413, 90, 111, 10644, 61112, 1556, 142508, 28670, 18770, 5659, 11048, 4935, 37842, 903, 11249, 61924, 1238, 62346, 136 ]

[ 0.056396484375, 0.1634521484375, 0.21875, 0.0694580078125, 0.194580078125, 0.198486328125, 0.0574951171875, 0.043548583984375, 0.1734619140625, 0.1904296875, 0.118408203125, 0.1875, 0.12298583984375, 0.1807861328125, 0.1038818359375, 0.1470947265625, 0.1214599609375, 0.037231445312...

embed

22337214_c0

22337214

haskell

0

Title: Understanding Haskell Type Signatures Problem title: Understanding Haskell Type Signatures Tags: types, type-signature, haskell Problem: Understanding Haskell Type Signatures I am in the process of teaching myself Haskell and I was wondering about the following type signatures: Prelude> :t ($) ($) :: (a -> b) ->...

Understanding Haskell Type Signatures Understanding Haskell Type Signatures types type-signature haskell Understanding Haskell Type Signatures Prelude Understanding Haskell Type Signatures I am in the process of teaching myself Haskell and I was wondering about the following type signatures: How should I interpret (no ...

[ 0.0244140625, 0.01324462890625, 0.0030059814453125, 0.017333984375, -0.0203857421875, 0.0230712890625, -0.0007781982421875, 0.0093994140625, -0.0201416015625, -0.00604248046875, -0.0084228515625, -0.041259765625, -0.002105712890625, 0.016845703125, -0.00714111328125, 0.00445556640625, ...

[ 9626, 144057, 20625, 142508, 60457, 26729, 141762, 52895, 10644, 137432, 1556, 822, 128169, 149016, 25632, 138256, 5608, 29481, 1992, 179140, 450, 36137, 62318, 16750, 6496, 2638, 13894, 2069 ]

[ 0.100830078125, 0.0980224609375, 0.1175537109375, 0.196044921875, 0.1829833984375, 0.1162109375, 0.1566162109375, 0.20166015625, 0.1815185546875, 0.1658935546875, 0.119873046875, 0.044158935546875, 0.03778076171875, 0.037078857421875, 0.04168701171875, 0.20556640625, 0.01104736328125...

embed

29803664_c0

29803664

haskell

0

Title: haskell hGetLines implementation Problem title: haskell hGetLines implementation Tags: haskell, io, input Problem: haskell hGetLines implementation Does anyone know where can I find the hGetLine :: Handle -> IO Text function implementation? I have to implement a HTTP server in haskell which has multiple subtasks...

haskell hGetLines implementation haskell hGetLines implementation haskell io input Handle Text haskell hGetLines implementation Does anyone know where can I find the function implementation? I have to implement a HTTP server in haskell which has multiple subtasks. The first one is to write the implementation of a funct...

[ -0.00482177734375, 0.006744384765625, 0.014404296875, 0.0203857421875, -0.0159912109375, 0.03125, 0.00830078125, 0.01007080078125, -0.004913330078125, -0.0228271484375, 0.0008697509765625, -0.03271484375, -0.01470947265625, -0.002105712890625, 0.0120849609375, 0.025634765625, 0.01104...

[ 1556, 142508, 1096, 724, 126, 93232, 7, 208124, 22995, 107730, 10639, 133, 24129, 35672, 3714, 7440, 831, 87, 7413, 70, 32354, 765, 29479, 135913, 10723, 48716, 1614, 1073, 1224, 5117, 83, 33022, 12301, 26818, 1295, 17780, 86723, 24189, 201...

[ 0.1807861328125, 0.2237548828125, 0.1317138671875, 0.1556396484375, 0.1766357421875, 0.277587890625, 0.05328369140625, 0.2308349609375, 0.1856689453125, 0.150634765625, 0.1634521484375, 0.14306640625, 0.1763916015625, 0.02099609375, 0.06353759765625, 0.04547119140625, 0.0569458007812...

embed

3015173_c1

3015173

haskell

1

PotatoId = Database.Persist.Key Potato Question: Is there an easier way to get information on instances of type families and data families, using ghci or any other tool? Code signals: qualified, Database.Persist.Sqlite, Language.Haskell.TH, Data.List, Info, Maybe, Nothing, Just, Defined, Data.Maybe, Persist.Key, Potat...

[ 0.03271484375, -0.0036468505859375, 0.001617431640625, -0.005401611328125, -0.017822265625, 0.01055908203125, 0.0106201171875, -0.0205078125, 0.0164794921875, -0.007568359375, 0.0059814453125, -0.02783203125, -0.003997802734375, -0.00130462646484375, -0.02734375, 0.005828857421875, 0...

[ 663, 28647, 568, 71, 2203, 187781, 15277, 57702, 162429, 68185, 2071, 2685, 99156, 3917, 47, 2046, 4677, 98, 110527, 111, 10644, 87143, 136, 2053, 17368, 31380, 318, 2499, 3789, 55516, 28864, 26073, 7, 217225, 95255, 67, 83658, 6495, 142508...

[ 0.132080078125, 0.2100830078125, 0.114501953125, 0.1531982421875, 0.025970458984375, 0.1578369140625, 0.1116943359375, 0.2115478515625, 0.16943359375, 0.052459716796875, 0.00445556640625, 0.0182952880859375, 0.1905517578125, 0.0755615234375, 0.0343017578125, 0.1328125, 0.201293945312...

embed

58064216_c0

58064216

haskell

0

Title: Difference between mod in the beggining of the operation or `mod` in the middle Problem title: Difference between mod in the beggining of the operation or `mod` in the middle Tags: operators, modulo, haskell Problem: Difference between mod in the beggining of the operation or `mod` in the middle I really don't k...

Difference between mod in the beggining of the operation or `mod` in the middle Difference between mod in the beggining of the operation or `mod` in the middle operators modulo haskell Difference Difference between mod in the beggining of the operation or `mod` in the middle I really don't know what's the difference be...

[ -0.00701904296875, -0.000560760498046875, 0.0146484375, -0.0029296875, 0.01019287109375, -0.00021457672119140625, 0.00775146484375, 0.0062255859375, 0.019775390625, -0.0341796875, 0.000720977783203125, -0.00091552734375, 0.0294189453125, 0.01556396484375, 0.01397705078125, -0.027832031...

[ 803, 18234, 6620, 17721, 2811, 23, 70, 186, 16680, 592, 41018, 707, 13415, 86991, 39933, 140807, 1556, 142508, 6183, 3714, 2367, 60212, 1632, 55300, 15700, 3060, 31380, 318, 4734, 43240, 2174, 4527, 136, 3789, 38, 4171, 176256, 4358, 73342,...

[ 0.1229248046875, 0.1961669921875, 0.1075439453125, 0.133056640625, 0.27197265625, 0.1158447265625, 0.045867919921875, 0.084716796875, 0.125244140625, 0.1026611328125, 0.2001953125, 0.03485107421875, 0.26708984375, 0.2271728515625, 0.19921875, 0.248779296875, 0.1490478515625, 0.2658...

embed

37545204_c0

37545204

haskell

0

Title: How to specify the instance from which a function is called Problem title: How to specify the instance from which a function is called Tags: haskell Problem: How to specify the instance from which a function is called Say I have a type class such that for every instance a of this type class I have a function f :...

How to specify the instance from which a function is called How to specify the instance from which a function is called haskell which How Bool Maybe How to specify the instance from which a function is called Say I have a type class such that for every instance a of this type class I have a function How can I call f? M...

[ 0.0128173828125, -0.01495361328125, 0.01519775390625, 0.00787353515625, -0.0093994140625, 0.0028076171875, 0.0020751953125, -0.005279541015625, 0.00885009765625, -0.01324462890625, -0.00958251953125, -0.0169677734375, -0.01202392578125, 0.00653076171875, 0.0098876953125, -0.03466796875...

[ 11249, 47, 40140, 18929, 70, 110527, 1295, 3129, 32354, 83, 35839, 1556, 142508, 2460, 929, 83425, 10, 765, 10644, 18507, 100, 11907, 903, 831, 87, 11782, 1238, 134995, 3642, 29459, 136, 959, 876, 2174, 15700, 23 ]

[ 0.09521484375, 0.0246734619140625, 0.2149658203125, 0.1444091796875, 0.040496826171875, 0.2802734375, 0.1805419921875, 0.093505859375, 0.2406005859375, 0.039703369140625, 0.1741943359375, 0.1751708984375, 0.26416015625, 0.07470703125, 0.14208984375, 0.1435546875, 0.095947265625, 0....

embed

20452786_c0

20452786

haskell

0

Title: Different fold in Haskell and SML/NJ Problem title: Different fold in Haskell and SML/NJ Tags: smlnj, haskell, fold Problem: Different fold in Haskell and SML/NJ In foldl definition possible wrong in SML/NJ 110.75 , I found that the relation foldl (op -) 2 [1] = foldr (op -) 2 [1] holds. But when I tried the abo...

Different fold in Haskell and SML/NJ Different fold in Haskell and SML/NJ smlnj haskell fold Different Haskell SML Different fold in Haskell and SML/NJ In foldl definition possible wrong in SML/NJ 110.75 , I found that the relation foldl (op -) 2 [1] = foldr (op -) 2 [1] holds. But when I tried the above in Haskell I f...

[ -0.0146484375, 0.002838134765625, 0.00897216796875, 0.00384521484375, -0.0228271484375, 0.003448486328125, -0.01544189453125, 0.0020599365234375, 0.0003223419189453125, 0.03125, 0.0003337860107421875, -0.00543212890625, -0.008544921875, 0.0028076171875, -0.00433349609375, -0.0162353515...

[ 242520, 42822, 23, 20625, 142508, 136, 159, 39456, 64, 91551, 7237, 170, 1556, 18344, 20469, 80934, 7722, 44691, 12062, 6873, 41911, 2146, 20, 116, 17550, 2203, 7569, 16401, 37842, 36917, 456, 5429, 75639, 9, 69112, 22027, 18, 44084, 12921,...

[ 0.20068359375, 0.26220703125, 0.06591796875, 0.1343994140625, 0.24853515625, 0.1033935546875, 0.0692138671875, 0.2265625, 0.07568359375, 0.2291259765625, 0.01104736328125, 0.129150390625, 0.1158447265625, 0.1552734375, 0.1968994140625, 0.1617431640625, 0.11328125, 0.13623046875, ...

embed

30502941_c0

30502941

haskell

0

Title: Why doesn't product [0..] evaluate to 0 "instantly"? Problem title: Why doesn't product [0..] evaluate to 0 "instantly"? Tags: haskell, lazy-evaluation Problem: Why doesn't product [0..] evaluate to 0 "instantly"? I am trying to understand laziness. Because 0 multiplied with any num...

Why doesn't product [0..] evaluate to 0 "instantly"? Why doesn't product [0..] evaluate to 0 "instantly"? haskell lazy-evaluation Why Why doesn't product [0..] evaluate to 0 "instantly"? I am trying to understand laziness. Because 0 multiplied with any number is 0, shouldn't product [0..] ...

[ -0.0216064453125, 0.0069580078125, 0.01434326171875, -0.005706787109375, -0.0157470703125, -0.005279541015625, 0.0076904296875, -0.014892578125, 0.0234375, 0.00811767578125, 0.01171875, 0.01177978515625, -0.00775146484375, -0.004119873046875, 0.004150390625, 0.01153564453125, 0.02893...

[ 44084, 22027, 3768, 18, 12996, 2389, 5, 151575, 13, 47, 757, 143034, 538, 1556, 142508, 21, 3285, 159258, 28219, 708, 7432, 118126, 297, 678, 2499, 14012, 5608, 37842, 18344, 20469, 80019, 106, 61924, 10002, 6, 42822, 7279, 33662, 14037 ]

[ 0.147216796875, 0.09033203125, 0.0628662109375, 0.1192626953125, 0.267822265625, 0.1905517578125, 0.08013916015625, 0.1951904296875, 0.061126708984375, 0.0830078125, 0.2113037109375, 0.196533203125, 0.163818359375, 0.1239013671875, 0.22998046875, 0.12158203125, 0.176513671875, 0.16...

embed

32993547_c0

32993547

haskell

0

Title: Is complex differentiation of datatypes sensible? Problem title: Is complex differentiation of datatypes sensible? Tags: types, calculus, haskell Problem: Is complex differentiation of datatypes sensible? pigworker once asked how to express that a type is infinitely differentiable . This question brought to mind...

Is complex differentiation of datatypes sensible? Is complex differentiation of datatypes sensible? types calculus haskell Is complex differentiation of datatypes sensible? pigworker once asked how to express that a type is infinitely differentiable . This question brought to mind the fact that in complex analysis, a f...

[ 0.02392578125, 0.00653076171875, -0.0106201171875, 0.01458740234375, 0.00408935546875, -0.007659912109375, 0.010986328125, -0.006927490234375, -0.00185394287109375, -0.041015625, 0.0001201629638671875, -0.006622314453125, -0.004974365234375, 0.00026702880859375, -0.000934600830078125, ...

[ 2071, 27140, 99710, 2320, 2053, 50986, 82091, 52895, 44805, 223, 1556, 142508, 53408, 18244, 3642, 36510, 10644, 83, 54241, 21286, 2886, 114137, 32354, 191, 9803, 5423, 8110, 450, 3917, 22120, 21373, 58391, 16401 ]

[ 0.039581298828125, 0.2352294921875, 0.19970703125, 0.047637939453125, 0.1046142578125, 0.254150390625, 0.2374267578125, 0.193359375, 0.10186767578125, 0.03375244140625, 0.08544921875, 0.1827392578125, 0.0634765625, 0.05804443359375, 0.000885009765625, 0.1015625, 0.219970703125, 0.0...

embed

16207008_c0

16207008

haskell

0

Title: Encoding correctness constraints directly into the Haskell type system? Problem title: Encoding correctness constraints directly into the Haskell type system? Tags: haskell Problem: Encoding correctness constraints directly into the Haskell type system? While reading the article written by matt might, I saw the ...

Encoding correctness constraints directly into the Haskell type system? Encoding correctness constraints directly into the Haskell type system? haskell Encoding Haskell Encoding correctness constraints directly into the Haskell type system? While reading the article written by matt might, I saw the following sentance. ...

[ 0.0087890625, -0.000278472900390625, 0.0032501220703125, 0.01123046875, 0.0032958984375, -0.00115966796875, -0.0279541015625, 0.007171630859375, -0.017578125, -0.0240478515625, -0.0107421875, -0.035400390625, -0.00469970703125, 0.0208740234375, -0.005859375, 0.0174560546875, 0.023559...

[ 357, 587, 6238, 26785, 7432, 158, 2816, 4288, 105237, 3934, 20625, 142508, 10644, 5426, 1556, 2589, 18, 13648, 24124, 25632, 9325, 7154, 73342, 91084, 903, 149357, 16610, 27781 ]

[ 0.03399658203125, 0.18603515625, 0.05078125, 0.177978515625, 0.08740234375, 0.074951171875, 0.158447265625, 0.107666015625, 0.10345458984375, 0.0765380859375, 0.1385498046875, 0.2314453125, 0.1099853515625, 0.091064453125, 0.1171875, 0.01116943359375, 0.003387451171875, 0.147705078...

embed

52298333_c0

52298333

haskell

0

Title: Traversable in Haskell Problem title: Traversable in Haskell Tags: haskell, algebraic-data-types Problem: Traversable in Haskell I'm trying to understand the example from the Data.Traversable documentation. data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a) instance Traversable Tree where traverse f Empty =...

Traversable in Haskell Traversable in Haskell haskell algebraic-data-types Traversable Haskell Data.Traversable Tree Empty Leaf Node Traversable in Haskell I'm trying to understand the example from the Data.Traversable documentation. How it is possible to apply Leaf <$> f x . Leaf is not a function and it is still poss...

[ -0.00133514404296875, 0.01348876953125, 0.0003662109375, 0.01025390625, 0.028076171875, 0.007537841796875, -0.01507568359375, -0.0133056640625, 0.006683349609375, -0.037353515625, 0.00009822845458984375, 0.004150390625, -0.00323486328125, 0.006103515625, -0.00750732421875, 0.0016784667...

[ 4937, 7864, 2886, 20625, 142508, 23, 1556, 429, 2844, 10135, 50986, 11809, 28542, 101344, 31678, 939, 636, 2407, 438, 112, 28219, 27781, 209806, 11249, 83, 7722, 59911, 4369, 1238, 1022, 959, 32354, 7464, 4527 ]

[ 0.1334228515625, 0.1790771484375, 0.20703125, 0.15087890625, 0.2464599609375, 0.010345458984375, 0.1231689453125, 0.031707763671875, 0.0428466796875, 0.105224609375, 0.1732177734375, 0.10302734375, 0.097412109375, 0.1446533203125, 0.13818359375, 0.0618896484375, 0.08648681640625, 0...

embed

75880063_c0

75880063

haskell

0

Title: Increment suffix with Lens Problem title: Increment suffix with Lens Tags: haskell, haskell-lens Problem: Increment suffix with Lens How to write a lens-based function incrementing numerical suffix (if it exists) and keeping the string as is if no such one? "aaa1" -> "aaa2" "aaa_123" -> "aaa_124" "" -> "" "aaa" ...

Increment suffix with Lens Increment suffix with Lens haskell haskell-lens Increment Lens aaa1 aaa2 aaa_123 aaa_124 Increment suffix with Lens How to write a lens-based function incrementing numerical suffix (if it exists) and keeping the string as is if no such one? I have feeling that I need some prism maybe, first, ...

[ -0.012451171875, 0.00151824951171875, -0.00555419921875, 0.0257568359375, -0.00103759765625, 0.001983642578125, 0.01507568359375, -0.00714111328125, -0.000415802001953125, 0.014892578125, -0.005706787109375, 0.0157470703125, -0.00555419921875, 0.00138092041015625, 0.01458740234375, -0....

[ 8942, 107, 674, 133784, 425, 678, 18226, 7, 1556, 142508, 9, 1977, 10, 11, 418, 304, 48636, 109589, 11249, 47, 33022, 3098, 77007, 32354, 158661, 214, 54744, 6827, 3190, 442, 32316, 136, 120260, 79315, 237, 83, 2174, 110, 6044, 1632, 34...

[ 0.126708984375, 0.173583984375, 0.0662841796875, 0.198974609375, 0.1085205078125, 0.1348876953125, 0.251220703125, 0.1036376953125, 0.12109375, 0.197998046875, 0.010162353515625, 0.2177734375, 0.04296875, 0.030517578125, 0.04052734375, 0.04840087890625, 0.1510009765625, 0.154907226...

embed

45476163_c0

45476163

haskell

0

Title: How does it become to particular type? Problem title: How does it become to particular type? Tags: haskell Problem: How does it become to particular type? I have following code snippet: Prelude Data.Monoid> :t 1 <> (2 :: Sum Integer) 1 <> (2 :: Sum Integer) :: Sum Integer How does 1 become to Sum Integer type? U...

How does it become to particular type? How does it become to particular type? haskell How Prelude Data.Monoid Sum Integer Num How does it become to particular type? I have following code snippet: How does 1 become to Sum Integer type? Update I play a bit with mappend function and discovered: Why does mappend accept the...

[ -0.0186767578125, 0.003387451171875, 0.017578125, 0.041015625, 0.0062255859375, 0.0242919921875, -0.00897216796875, 0.0050048828125, 0.02001953125, -0.01434326171875, 0.00116729736328125, -0.033203125, -0.01025390625, 0.003631591796875, 0.0128173828125, -0.01507568359375, 0.008239746...

[ 11249, 14602, 24209, 47, 17311, 10644, 1556, 142508, 1914, 822, 112, 11809, 46674, 48899, 36335, 44401, 52782, 442, 25632, 18151, 106, 11301, 4785, 291, 9858, 71, 32354, 134053, 44084, 26946, 14012, 6260, 83, 110, 22460, 532, 110527 ]

[ 0.0926513671875, 0.07696533203125, 0.13134765625, 0.10418701171875, 0.188720703125, 0.2166748046875, 0.1265869140625, 0.2080078125, 0.08599853515625, 0.1427001953125, 0.1348876953125, 0.1456298828125, 0.1212158203125, 0.1878662109375, 0.2025146484375, 0.189453125, 0.1676025390625, ...

embed

4846974_c0

4846974

haskell

0

Title: Haskell: Check if Int is in a list of Int's Problem title: Haskell: Check if Int is in a list of Int's Tags: haskell Problem: Haskell: Check if Int is in a list of Int's I am new to Haskell, sorry if this is a basic question. I currently have a list of Int's and I am trying to create a function that ta...

Haskell: Check if Int is in a list of Int's Haskell: Check if Int is in a list of Int's haskell Haskell Check Haskell: Check if Int is in a list of Int's I am new to Haskell, sorry if this is a basic question. I currently have a list of Int's and I am trying to create a function that takes a variable x and re...

[ -0.0223388671875, 0.0115966796875, 0.00787353515625, 0.017578125, -0.005950927734375, 0.0281982421875, 0.0028839111328125, -0.000217437744140625, 0.003082275390625, -0.01007080078125, 0.00762939453125, -0.0198974609375, 0.0172119140625, 0.005035400390625, -0.00182342529296875, 0.011596...

[ 20625, 142508, 38679, 2174, 360, 18, 83, 23, 5303, 111, 3768, 1556, 10, 25, 7, 3525, 59090, 62822, 82424, 31577, 28282, 32354, 51776, 77336, 1022, 30646, 337, 31, 34677, 96819, 36766, 32316, 33938, 11809, 154663, 7413, 12832, 17368, 527, ...

[ 0.1268310546875, 0.252685546875, 0.2138671875, 0.094482421875, 0.1668701171875, 0.1890869140625, 0.0855712890625, 0.1494140625, 0.1861572265625, 0.08978271484375, 0.0287933349609375, 0.1162109375, 0.019012451171875, 0.0477294921875, 0.01849365234375, 0.006439208984375, 0.022430419921...

embed

15046316_c0

15046316

haskell

0

Title: Cabal dependency conflict when installing yesod Problem title: Cabal dependency conflict when installing yesod Tags: cabal, haskell, yesod Problem: Cabal dependency conflict when installing yesod I am trying to install the yesod web framework. When I run cabal install yesod-platform , I get a dependency conflict...

Cabal dependency conflict when installing yesod Cabal dependency conflict when installing yesod cabal haskell yesod Cabal Cabal dependency conflict when installing yesod I am trying to install the yesod web framework. When I run cabal install yesod-platform , I get a dependency conflict: I get this error even in a hsen...

[ -0.0089111328125, 0.0076904296875, 0.0078125, 0.00653076171875, -0.021240234375, -0.0003604888916015625, -0.0185546875, -0.00048065185546875, -0.007171630859375, 0.052001953125, -0.001617431640625, -0.026123046875, -0.0031280517578125, -0.00811767578125, 0.013427734375, -0.009460449218...

[ 30438, 289, 42548, 27771, 79612, 3229, 20600, 214, 2422, 23722, 109524, 1556, 142508, 31577, 1467, 170846, 11675, 172121, 903, 18499, 3853, 1096, 1015, 334, 19096, 11728, 65998, 831 ]

[ 0.1783447265625, 0.158203125, 0.1944580078125, 0.12646484375, 0.2376708984375, 0.0214080810546875, 0.159912109375, 0.03839111328125, 0.147216796875, 0.2423095703125, 0.2274169921875, 0.10546875, 0.1864013671875, 0.001800537109375, 0.049957275390625, 0.1002197265625, 0.015640258789062...

embed

25242994_c0

25242994

haskell

0

Title: Infinite cycle of bytestream Problem title: Infinite cycle of bytestream Tags: haskell Problem: Infinite cycle of bytestream Hello I'm trying to produce infinite cycle of ByteStream . (not that it would be of much use, just messing around) main :: IO () main = L.writeFile "test" $ L.take 10000 $ L.cycle [0..255]...

Infinite cycle of bytestream Infinite cycle of bytestream haskell Infinite ByteStream L.writeFile L.take L.cycle Couldn L8.ByteString Integer Infinite cycle of bytestream Hello I'm trying to produce infinite cycle of ByteStream . (not that it would be of much use, just messing around) But because of L.cycle [0..255] it...

[ 0.01287841796875, -0.005645751953125, -0.02294921875, -0.004669189453125, -0.00543212890625, -0.00885009765625, 0.01531982421875, -0.01177978515625, 0.00628662109375, -0.010009765625, -0.001739501953125, 0.0130615234375, 0.021728515625, 0.03466796875, -0.0029754638671875, 0.01879882812...

[ 134322, 13, 105823, 390, 67, 86429, 111, 1556, 142508, 3311, 115061, 339, 434, 18781, 174350, 78219, 75457, 191147, 1019, 75358, 71713, 44401, 35378, 31577, 27489, 54241, 6, 442, 4527, 163, 38001, 2389, 135455, 24855, 18, 14858, 84751, 10644,...

[ 0.173828125, 0.07635498046875, 0.217529296875, 0.0699462890625, 0.110595703125, 0.2357177734375, 0.035491943359375, 0.1175537109375, 0.2276611328125, 0.09222412109375, 0.23193359375, 0.1131591796875, 0.002471923828125, 0.05828857421875, 0.1441650390625, 0.1175537109375, 0.21459960937...

embed

25826604_c0

25826604

haskell

0

Title: Parsing IPv6 address Problem title: Parsing IPv6 address Tags: haskell Problem: Parsing IPv6 address I need to convert IPv6 from string like "fe80::dd99:5d56:cf09:b1ef" to Binary or to (Word64,Word64). Closest I came to is Network.IP.Addr package, but I'm a newbie and this signature is impenetrable for me: net6P...

Parsing IPv6 address Parsing IPv6 address haskell Parsing IPv6 net6Parser CharParsing Monad IsNetAddr NetHost IP6 Parsing IPv6 address I need to convert IPv6 from string like "fe80::dd99:5d56:cf09:b1ef" to Binary or to (Word64,Word64). Closest I came to is Network.IP.Addr package, but I'm a newbie and this signature is...

[ -0.00897216796875, -0.010498046875, 0.00927734375, 0.031005859375, 0.0128173828125, 0.01708984375, -0.004791259765625, -0.0274658203125, -0.005767822265625, -0.0267333984375, 0.02294921875, -0.01031494140625, 0.00823974609375, -0.007659912109375, -0.004241943359375, 0.0205078125, -0....

[ 2392, 6953, 8021, 334, 910, 29823, 1556, 142508, 2043, 28636, 2189, 21656, 60331, 71, 2071, 24447, 22409, 7569, 10086, 11193, 271, 87, 3871, 47, 96760, 1295, 79315, 1884, 2242, 4836, 12, 4028, 5046, 758, 13683, 67466, 6463, 275, 418, 4240...

[ 0.21240234375, 0.1353759765625, 0.159912109375, 0.1746826171875, 0.251953125, 0.1781005859375, 0.1336669921875, 0.240234375, 0.076171875, 0.1990966796875, 0.10308837890625, 0.1055908203125, 0.110595703125, 0.09613037109375, 0.098388671875, 0.120361328125, 0.0802001953125, 0.1809082...

embed

27349483_c1

27349483

haskell

1

_ -> DbTypePrimitive (DbOther $ OtherTypeDef [Left "uuid"]) False Nothing Nothing In the expression: case db of { Postgresql _ -> DbTypePrimitive (DbOther $ OtherTypeDef [Left "uuid"]) False Nothing Nothing _ -> DbTypePrimitive (DbOther $ OtherTypeDef [Left "varchar"]) False Nothing Nothing } Code signals: db, How, Ha...

[ -0.00836181640625, 0.011474609375, -0.000545501708984375, 0.00830078125, 0.01507568359375, -0.004119873046875, -0.01055908203125, -0.023193359375, 0.010009765625, -0.015869140625, -0.013916015625, -0.008544921875, -0.0034027099609375, -0.016357421875, -0.0205078125, 0.01104736328125, ...

[ 101, 33079, 391, 275, 196707, 145111, 14, 4935, 397, 670, 9319, 3650, 64511, 187423, 2480, 17349, 532, 22225, 182747, 125195, 7225, 40041, 111, 2795, 17562, 99247, 184, 1961, 9254, 28864, 26073, 11249, 20625, 142508, 205540, 497, 177, 44506, ...

[ 0.053741455078125, 0.08685302734375, 0.07244873046875, 0.1036376953125, 0.270751953125, 0.157958984375, 0.094482421875, 0.185302734375, 0.0213623046875, 0.044158935546875, 0.1524658203125, 0.120849609375, 0.127685546875, 0.269287109375, 0.07867431640625, 0.068603515625, 0.13403320312...

embed

28090985_c0

28090985

haskell

0

Title: How to use Shibboleth authentication for a Yesod application? Problem title: How to use Shibboleth authentication for a Yesod application? Tags: yesod, shibboleth, haskell Problem: How to use Shibboleth authentication for a Yesod application? How can I put a Yesod application behind Shibboleth authentication? I ...

How to use Shibboleth authentication for a Yesod application? How to use Shibboleth authentication for a Yesod application? yesod shibboleth haskell How Shibboleth Yesod How to use Shibboleth authentication for a Yesod application? How can I put a Yesod application behind Shibboleth authentication? I currently have (wi...

[ 0.00714111328125, 0.030029296875, 0.00909423828125, -0.005584716796875, -0.0303955078125, 0.02734375, 0.0002880096435546875, -0.00262451171875, -0.01336669921875, -0.00982666015625, 0.0113525390625, 0.007781982421875, -0.0291748046875, 0.00848388671875, -0.007110595703125, -0.017456054...

[ 11249, 47, 4527, 8294, 275, 61217, 927, 195734, 2320, 100, 32635, 2199, 38415, 2422, 23722, 104795, 1556, 142508, 831, 87, 3884, 10, 50155, 82424, 765, 76228, 6056, 237, 313, 18027, 1528, 136, 17203, 6226, 390, 9795, 1430, 294, 26036, 142...

[ 0.158203125, 0.0799560546875, 0.1602783203125, 0.1773681640625, 0.1280517578125, 0.25146484375, 0.1988525390625, 0.238525390625, 0.1492919921875, 0.07861328125, 0.203369140625, 0.267578125, 0.200439453125, 0.143310546875, 0.2261962890625, 0.1737060546875, 0.1337890625, 0.2164306640...

embed

33817372_c0

33817372

haskell

0

Title: Dynamic stdout in Haskell Problem title: Dynamic stdout in Haskell Tags: haskell, command-line-interface Problem: Dynamic stdout in Haskell I have simple command line interface with insertion records in DB and now it writes a lot of info to stdout, like this: ... record 856/1000: 85% record 857/1000: 85% record ...

Dynamic stdout in Haskell Dynamic stdout in Haskell haskell command-line-interface Dynamic Haskell Dynamic stdout in Haskell I have simple command line interface with insertion records in DB and now it writes a lot of info to stdout, like this: but I want to have 1 dynamic line with updating current string parameters H...

[ -0.0019683837890625, 0.0101318359375, 0.00799560546875, 0.020263671875, 0.00732421875, 0.002593994140625, -0.0037689208984375, -0.0067138671875, -0.00714111328125, -0.0003509521484375, -0.021484375, -0.0123291015625, -0.005462646484375, -0.0146484375, -0.004119873046875, 0.016967773437...

[ 73327, 21068, 6138, 246, 1003, 20625, 142508, 23, 1556, 75101, 2256, 10433, 8781, 13315, 101758, 241860, 115923, 57976, 33022, 5915, 3004, 47, 3444, 106, 84079, 678, 1257, 56464, 43581, 79315, 171859, 69307 ]

[ 0.1651611328125, 0.0670166015625, 0.15185546875, 0.107421875, 0.2041015625, 0.1298828125, 0.22412109375, 0.0546875, 0.112548828125, 0.1243896484375, 0.09295654296875, 0.04998779296875, 0.0634765625, 0.162841796875, 0.1197509765625, 0.085693359375, 0.1080322265625, 0.099853515625, ...

embed

15240840_c0

15240840

haskell

0

Title: Ruby Method similar to Haskells cycle Problem title: Ruby Method similar to Haskells cycle Tags: functional-programming, haskell, ruby Problem: Ruby Method similar to Haskells cycle Is there a Ruby method similar to Haskell's cycle? Haskell's cycle takes a list and returns that list infinitely appended to itself...

Ruby Method similar to Haskells cycle Ruby Method similar to Haskells cycle functional-programming haskell ruby Ruby Method Haskells Ruby Method similar to Haskells cycle Is there a Ruby method similar to Haskell's cycle? Haskell's cycle takes a list and returns that list infinitely appended to itself. It's commonly us...

[ 0.00811767578125, 0.00830078125, -0.00057220458984375, 0.0233154296875, 0.005126953125, -0.005615234375, 0.00970458984375, -0.00439453125, 0.008056640625, -0.033447265625, -0.026123046875, -0.0194091796875, -0.0174560546875, 0.0184326171875, -0.00089263916015625, 0.00518798828125, -0...

[ 158189, 74644, 21373, 47, 20625, 142508, 7, 105823, 123309, 28966, 1556, 21922, 53, 2685, 10, 55300, 25, 51776, 5303, 30646, 54241, 114689, 48141, 68034, 39210, 11814, 678, 5646, 3129, 59102, 24233, 80854, 5773, 2663, 10298, 2071, 450, 3060, ...

[ 0.281005859375, 0.2237548828125, 0.153076171875, 0.06927490234375, 0.1280517578125, 0.2265625, 0.0343017578125, 0.2200927734375, 0.11083984375, 0.07159423828125, 0.1163330078125, 0.1636962890625, 0.06182861328125, 0.06329345703125, 0.07080078125, 0.2042236328125, 0.0062255859375, 0...

embed

15258587_c0

15258587

haskell

0

Title: What's the benefit of conduit's leftovers? Problem title: What's the benefit of conduit's leftovers? Tags: haskell-pipes, haskell, conduit Problem: What's the benefit of conduit's leftovers? I'm trying to understand the differences between conduit and pipes . Unlike pipes , conduit has the co...

What's the benefit of conduit's leftovers? What's the benefit of conduit's leftovers? haskell-pipes haskell conduit What What's the benefit of conduit's leftovers? I'm trying to understand the differences between conduit and pipes . Unlike pipes , conduit has the concept of leftovers. What are lefto...

[ 0.01141357421875, 0.024658203125, -0.0015411376953125, 0.020751953125, -0.0118408203125, 0.0028228759765625, -0.007415771484375, -0.0093994140625, 0.01556396484375, 0.0218505859375, -0.026123046875, -0.025390625, 0.0361328125, 0.000339508056640625, -0.01507568359375, -0.009033203125, ...

[ 4865, 3768, 70, 68073, 111, 120565, 7, 25737, 5465, 1556, 142508, 1434, 13569, 25, 28219, 60212, 17721, 136, 137158, 992, 5062, 23755, 621, 80234, 100, 27781, 85590, 18, 765, 69307, 21373, 123166, 678 ]

[ 0.0899658203125, 0.059539794921875, 0.091064453125, 0.223876953125, 0.072998046875, 0.2626953125, 0.14013671875, 0.2135009765625, 0.2457275390625, 0.134765625, 0.22265625, 0.127197265625, 0.035980224609375, 0.048858642578125, 0.024658203125, 0.1044921875, 0.0631103515625, 0.0935058...

embed

25496501_c0

25496501

haskell

0

Title: What is the list comprehension for right triangles in python à la Haskell? Problem title: What is the list comprehension for right triangles in python à la Haskell? Tags: geometry, list-comprehension, list, python, haskell Problem: What is the list comprehension for right triangles in python à la Haskell? In Has...

What is the list comprehension for right triangles in python à la Haskell? What is the list comprehension for right triangles in python à la Haskell? geometry list-comprehension list python haskell What Haskell What is the list comprehension for right triangles in python à la Haskell? In Haskell: Is there such an elega...

[ 0.0089111328125, 0.005279541015625, 0.0279541015625, 0.00787353515625, 0.009033203125, 0.007781982421875, -0.003448486328125, 0.00958251953125, 0.00860595703125, -0.0191650390625, -0.004791259765625, -0.048828125, 0.004364013671875, -0.0062255859375, -0.0400390625, 0.0025482177734375, ...

[ 5303, 46683, 3220, 6889, 7108, 1927, 109217, 17198, 50828, 253, 21, 20625, 142508, 100, 7, 23, 700, 87739, 277, 4692, 1556, 4865, 83, 70, 6044, 27650, 29806, 145581 ]

[ 0.2054443359375, 0.1685791015625, 0.1630859375, 0.053558349609375, 0.1883544921875, 0.166259765625, 0.1976318359375, 0.0985107421875, 0.148193359375, 0.0810546875, 0.0938720703125, 0.157470703125, 0.2578125, 0.030609130859375, 0.0250396728515625, 0.014923095703125, 0.035186767578125,...

embed

47144419_c0

47144419

haskell

0

Title: When I run a lot of http requests in parallel, I get "no such protocol name: tcp" Problem title: When I run a lot of http requests in parallel, I get "no such protocol name: tcp" Tags: haskell, http-conduit Problem: When I run a lot of http requests in parallel, I get "no such protocol name: ...

When I run a lot of http requests in parallel, I get "no such protocol name: tcp" When I run a lot of http requests in parallel, I get "no such protocol name: tcp" haskell http-conduit When ConnectionFailure Network.BSD.getProtocolByName When I run a lot of http requests in parallel, I get "no such ...

[ 0.006439208984375, 0.00799560546875, -0.002227783203125, 0.01348876953125, -0.0023345947265625, -0.01055908203125, -0.00958251953125, -0.023681640625, 0.004425048828125, 0.0036468505859375, -0.0009918212890625, -0.00970458984375, 0.013427734375, 0.00019741058349609375, 0.00604248046875, ...

[ 14847, 11675, 5915, 111, 1621, 50336, 23, 95103, 157, 6044, 91363, 9351, 808, 121422, 7, 2046, 1556, 142508, 2271, 112061, 62448, 17647, 379, 28997, 20429, 397, 10752, 188, 8447, 75358, 163612, 12, 18151, 104250, 7103, 1672, 106, 92 ]

[ 0.0264129638671875, 0.10302734375, 0.1282958984375, 0.022430419921875, 0.1798095703125, 0.1932373046875, 0.037872314453125, 0.185546875, 0.1060791015625, 0.1517333984375, 0.22705078125, 0.10540771484375, 0.049346923828125, 0.2216796875, 0.01025390625, 0.021209716796875, 0.09216308593...

embed

67863482_c0

67863482

haskell

0

Title: How do I make custom data type orderable? Problem title: How do I make custom data type orderable? Tags: haskell Problem: How do I make custom data type orderable? I have a Haskell custom data type that I would like to use as a key in Data.Map , Data.Graph , and other lookup tables. data State = State { playerId...

How do I make custom data type orderable? How do I make custom data type orderable? haskell How Data.Map Data.Graph State Show Ord How do I make custom data type orderable? I have a Haskell custom data type that I would like to use as a key in Data.Map , Data.Graph , and other lookup tables. How do I make it orderable?...

[ 0.00274658203125, 0.0028839111328125, 0.00860595703125, 0.003265380859375, -0.009521484375, 0.00994873046875, -0.007537841796875, -0.0172119140625, 0.00439453125, -0.0126953125, -0.00579833984375, -0.0145263671875, 0.0159912109375, 0.00445556640625, -0.02880859375, -0.0086669921875, ...

[ 11249, 3249, 114122, 2053, 10644, 12989, 2886, 54, 87, 1556, 142508, 11809, 166179, 37878, 11727, 22836, 17367, 35379, 20625, 1884, 4527, 237, 22799, 6713, 2037, 23180, 442, 25632, 18, 48903, 4488 ]

[ 0.0794677734375, 0.10107421875, 0.219970703125, 0.1514892578125, 0.228271484375, 0.2327880859375, 0.1795654296875, 0.034088134765625, 0.03253173828125, 0.1170654296875, 0.205810546875, 0.10296630859375, 0.1412353515625, 0.0999755859375, 0.1048583984375, 0.1171875, 0.103271484375, 0...

embed

30288847_c0

30288847

haskell

0

Title: Why is there no "Functor" trait in Scala? Problem title: Why is there no "Functor" trait in Scala? Tags: functional-programming, functor, haskell, scala Problem: Why is there no "Functor" trait in Scala? In Scala, the generic classes such as Future , Option and List all have methods map and f...

Why is there no "Functor" trait in Scala? Why is there no "Functor" trait in Scala? functional-programming functor haskell scala Why Functor Scala Future Option List Why is there no "Functor" trait in Scala? In Scala, the generic classes such as Future , Option and List all have methods map and flat...

[ 0.02099609375, 0.0186767578125, -0.0002727508544921875, -0.020263671875, 0.00799560546875, -0.0194091796875, 0.00909423828125, -0.01336669921875, -0.0057373046875, -0.000762939453125, -0.0179443359375, -0.0281982421875, -0.005645751953125, 0.00927734375, -0.01123046875, -0.003570556640...

[ 44084, 83, 2685, 110, 97249, 18770, 110106, 23, 152653, 11, 41502, 123309, 28966, 7477, 1556, 142508, 146232, 28670, 94724, 86769, 32036, 360, 189534, 61112, 136, 150624, 22288, 49878, 166179, 1884, 20625, 15400, 56112, 18, 10, 10433, 40404, ...

[ 0.118408203125, 0.039093017578125, 0.0533447265625, 0.1324462890625, 0.21826171875, 0.2354736328125, 0.235595703125, 0.07318115234375, 0.223876953125, 0.1666259765625, 0.0113525390625, 0.126220703125, 0.036346435546875, 0.1165771484375, 0.045196533203125, 0.2310791015625, 0.175537109...

embed

5418710_c0

5418710

haskell

0

Title: Haskell List of List problem Problem title: Haskell List of List problem Tags: haskell, list Problem: Haskell List of List problem Im trying to change a particular particular list in a list of lists, Ive already defined the function which changes the list. But im not sure how to go about implementing this functi...

Haskell List of List problem Haskell List of List problem haskell list Haskell List Haskell List of List problem Im trying to change a particular particular list in a list of lists, Ive already defined the function which changes the list. But im not sure how to go about implementing this function into another function ...

[ 0.00130462646484375, 0.006500244140625, 0.011962890625, 0.00994873046875, 0.005340576171875, 0.005157470703125, -0.01116943359375, -0.00107574462890625, 0.01177978515625, 0.040283203125, 0.0026092529296875, -0.0177001953125, 0.0037841796875, 0.0257568359375, -0.00897216796875, -0.00616...

[ 20625, 142508, 32036, 111, 2967, 1556, 5303, 3370, 31577, 47, 15549, 17311, 23, 272, 21771, 61924, 71, 70, 32354, 3129, 65572, 566, 959, 9077, 29479, 3934, 15700, 2831, 3173, 11, 33079, 10, 110558 ]

[ 0.133544921875, 0.2012939453125, 0.2139892578125, 0.165771484375, 0.18310546875, 0.1326904296875, 0.1868896484375, 0.05023193359375, 0.07989501953125, 0.00848388671875, 0.1754150390625, 0.058624267578125, 0.04815673828125, 0.0037841796875, 0.05535888671875, 0.1650390625, 0.0231323242...

embed

35630580_c0

35630580

haskell

0

Title: Can someone please explain what k, a and r make sense into this mapM definition?i am a haskell newbie Problem title: Can someone please explain what k, a and r make sense into this mapM definition?i am a haskell newbie Tags: haskell-platform, haskell Problem: Can someone please explain what k, a and r make sense...

Can someone please explain what k, a and r make sense into this mapM definition?i am a haskell newbie Can someone please explain what k, a and r make sense into this mapM definition?i am a haskell newbie haskell-platform haskell Can Monad INLINE x:xs Can someone please explain what k, a and r make sense into this mapM ...

[ -0.0126953125, 0.0084228515625, 0.01409912109375, -0.004180908203125, 0.003936767578125, 0.0004138946533203125, 0.00836181640625, -0.00142669677734375, 0.0225830078125, -0.0194091796875, 0.0224609375, -0.00555419921875, -0.00689697265625, 0.017333984375, -0.005157470703125, -0.00405883...

[ 4171, 22008, 22936, 73342, 472, 4, 10, 136, 1690, 3249, 10422, 903, 22288, 594, 80934, 444, 1556, 142508, 9014, 2367, 3934, 172121, 60331, 71, 5881, 57339, 1022, 12, 425 ]

[ 0.05511474609375, 0.02587890625, 0.0572509765625, 0.1722412109375, 0.156982421875, 0.03863525390625, 0.1484375, 0.1656494140625, 0.16357421875, 0.062225341796875, 0.162109375, 0.000518798828125, 0.163818359375, 0.16552734375, 0.143798828125, 0.0120849609375, 0.0870361328125, 0.2064...

embed

28131135_c1

28131135

haskell

1

the outermost closure (which is called first) has closed over the last element of xs, so it can't pair them in the right order. I think the fix is to somehow build the closures inside-out, but I can't really see how to do it. I would happily accept a solution in either Haskell or Clojure. I'm hoping for a solution of ...

[ -0.00543212890625, 0.0107421875, -0.00787353515625, -0.0125732421875, -0.00494384765625, 0.0242919921875, -0.02099609375, 0.001678466796875, -0.005706787109375, -0.021240234375, 0.002410888671875, 0.004608154296875, 0.0024566650390625, 0.00299072265625, -0.007659912109375, 0.0068054199...

[ 628, 32166, 5510, 170224, 35839, 5117, 1556, 155738, 645, 4568, 12830, 1022, 7, 831, 18, 80836, 2856, 23, 7108, 12989, 5351, 30022, 209303, 45367, 70, 46132, 6056, 1957, 29806, 20625, 142508, 51053, 461, 107, 156377, 3173, 68330, 2203, 1834...

[ 0.1419677734375, 0.1650390625, 0.216064453125, 0.258056640625, 0.045440673828125, 0.1763916015625, 0.072509765625, 0.1943359375, 0.1546630859375, 0.1630859375, 0.15966796875, 0.1685791015625, 0.144775390625, 0.092529296875, 0.0887451171875, 0.242919921875, 0.03662109375, 0.05172729...

embed

4592509_c0

4592509

haskell

0

Title: Using parallel strategies with monads Problem title: Using parallel strategies with monads Tags: parallel-processing, monads, haskell, concurrency Problem: Using parallel strategies with monads I often see the usage and explanation of Haskell's parallel strategies connected to pure computations (for example fib ...

Using parallel strategies with monads Using parallel strategies with monads parallel-processing monads haskell concurrency Using Using parallel strategies with monads I often see the usage and explanation of Haskell's parallel strategies connected to pure computations (for example fib ). However, I do not often see it ...

[ -0.0152587890625, 0.0211181640625, -0.0033721923828125, -0.0247802734375, 0.0054931640625, 0.001220703125, 0.005462646484375, -0.01318359375, 0.00872802734375, -0.038818359375, 0.006805419921875, -0.00714111328125, 0.01202392578125, 0.006866455078125, 0.0038909912109375, 0.010559082031...

[ 345, 95103, 50531, 678, 2667, 712, 63923, 1556, 142508, 108636, 982, 7, 27983, 127689, 187136, 20625, 162711, 34166, 181135, 809, 275, 959, 1957, 11814, 11, 18403, 50961, 169022, 206019, 21543, 366, 62548, 32354, 190659, 16992, 91, 17780, 154...

[ 0.0648193359375, 0.242919921875, 0.202880859375, 0.06787109375, 0.1234130859375, 0.16015625, 0.09014892578125, 0.1009521484375, 0.234619140625, 0.1378173828125, 0.076904296875, 0.044158935546875, 0.11083984375, 0.130859375, 0.07159423828125, 0.10357666015625, 0.037322998046875, 0.0...

embed

49339973_c0

49339973

haskell

0

Title: Function containing head and tail functions throws empty list error Problem title: Function containing head and tail functions throws empty list error Tags: functional-programming, haskell Problem: Function containing head and tail functions throws empty list error I'm trying the solve the first question in Adve...

Function containing head and tail functions throws empty list error Function containing head and tail functions throws empty list error functional-programming haskell Bool x:xs Function containing head and tail functions throws empty list error I'm trying the solve the first question in Advent of Code 2017 , and come u...

[ -0.006500244140625, 0.003692626953125, 0.000606536865234375, 0.0040283203125, -0.0250244140625, 0.01171875, 0.006103515625, -0.01080322265625, 0.026611328125, 0.00433349609375, 0.006805419921875, 0.002532958984375, 0.004608154296875, 0.0142822265625, 0.00494384765625, 0.001091003417968...

[ 28670, 10763, 70541, 10336, 136, 46741, 32354, 104250, 201505, 5303, 18499, 123309, 28966, 1556, 142508, 2460, 929, 425, 86869, 9655, 89718, 111, 28864, 505, 29806, 74481, 44841, 34292, 3229, 8337, 107730, 57346, 101935, 68252, 363, 96386, 7619...

[ 0.1463623046875, 0.08148193359375, 0.1768798828125, 0.2340087890625, 0.1541748046875, 0.26806640625, 0.2177734375, 0.1812744140625, 0.1927490234375, 0.2152099609375, 0.2220458984375, 0.1387939453125, 0.0833740234375, 0.0975341796875, 0.1951904296875, 0.0240936279296875, 0.12426757812...

embed

32151151_c1

32151151

haskell

1

pagePosts = posts <$> postResponse let nextAfterCode = after $ fromJust postResponse if isNothing pagePosts then return Nothing else return (Just (fromJust pagePosts,nextAfterCode)) getPosts :: Text -> [Post] -> IO [Post] getPosts x y = do p <- liftIO $ fetchPage x let posts = fst (fromJust p) let afterParam = snd (fr...

[ 0.006011962890625, 0.01104736328125, 0.00775146484375, 0.01544189453125, 0.0198974609375, 0.0201416015625, 0.002899169921875, 0.009033203125, -0.0002841949462890625, -0.0218505859375, 0.033935546875, -0.00823974609375, -0.0155029296875, -0.033203125, 0.0283203125, 0.005584716796875, ...

[ 9191, 49411, 7, 2203, 32323, 4369, 1305, 94399, 2633, 11737, 46327, 114211, 7103, 3650, 1295, 127794, 2174, 83, 5021, 64113, 30646, 182747, 37076, 161063, 29062, 16, 2046, 24129, 6, 17780, 113, 915, 60520, 7647, 147101, 1022, 271, 55292, 72...

[ 0.1685791015625, 0.228271484375, 0.08441162109375, 0.07470703125, 0.1702880859375, 0.023193359375, 0.0987548828125, 0.1951904296875, 0.04058837890625, 0.13427734375, 0.1795654296875, 0.188720703125, 0.1302490234375, 0.05401611328125, 0.0728759765625, 0.09552001953125, 0.0064086914062...

embed

34779431_c1

34779431

haskell

1

)) (maybe you haven't applied enough arguments to a function?) A bunch of questions here: Obviously, I didn't get the types right while mimicking the HAVING , how to fix it. Is there a way to add type notation just for a parameter like f in havingGroupBy f n tab = [ filter f | g <- groupBySql 2 tab ] , for debugging? M...

[ 0.018310546875, -0.00421142578125, -0.016357421875, 0.01318359375, -0.006988525390625, 0.0067138671875, -0.00007534027099609375, -0.005584716796875, -0.005157470703125, 0.0118408203125, 0.01129150390625, -0.004608154296875, -0.002655029296875, -0.0130615234375, -0.029296875, 0.00028038...

[ 78960, 11354, 38246, 190659, 20174, 10750, 32354, 147306, 17582, 3688, 15935, 18, 2046, 52895, 7108, 37423, 41324, 11666, 856, 23186, 3642, 30022, 3917, 15190, 10644, 110, 22062, 1660, 171859, 1238, 19441, 205072, 75358, 653, 20928, 46312, 706,...

[ 0.0845947265625, 0.00286865234375, 0.00823974609375, 0.0521240234375, 0.026275634765625, 0.16015625, 0.1807861328125, 0.08740234375, 0.09210205078125, 0.00958251953125, 0.012420654296875, 0.030120849609375, 0.0531005859375, 0.253662109375, 0.1170654296875, 0.17724609375, 0.0656738281...

embed

16628067_c0

16628067

haskell

0

Title: Convert Int into [Int] Problem title: Convert Int into [Int] Tags: haskell, factors Problem: Convert Int into [Int] I'm looking through a past exam paper and don't understand how to convert Int to [Int] . For example, one of the questions asks us to produce a list of all the factors of a whole number excluding b...

Convert Int into [Int] Convert Int into [Int] haskell factors Convert Convert Int into [Int] I'm looking through a past exam paper and don't understand how to convert Int to [Int] . For example, one of the questions asks us to produce a list of all the factors of a whole number excluding both the number itself and 1. I...

[ -0.014892578125, -0.009033203125, 0.003204345703125, -0.006195068359375, -0.0230712890625, 0.02099609375, -0.0120849609375, -0.0205078125, 0.0028076171875, -0.018798828125, 0.003387451171875, -0.02001953125, 0.00022792816162109375, 0.03369140625, -0.02734375, 0.0174560546875, -0.0145...

[ 1657, 11549, 360, 18, 3934, 378, 4153, 268, 1556, 142508, 120103, 16487, 8305, 11015, 42276, 15122, 2301, 28219, 3642, 47, 96760, 17582, 26458, 27489, 5303, 111, 756, 70, 28271, 14012, 39041, 6238, 68034, 136, 615, 113292, 35672, 9655, 163,...

[ 0.07537841796875, 0.1949462890625, 0.1978759765625, 0.2261962890625, 0.15771484375, 0.055694580078125, 0.184326171875, 0.045074462890625, 0.1495361328125, 0.260009765625, 0.269287109375, 0.03900146484375, 0.0195465087890625, 0.056640625, 0.1339111328125, 0.0924072265625, 0.0193481445...

embed

17844223_c1

17844223

haskell

1

state",JSString (JSONString {fromJSString = "New York"})),("zip",JSRational False (10001 % 1))]}))]})) Needless to say, it seems pretty verbose (and frightening). I tried doing ...> decode aa :: Result Person and it gave me an error. How do I go about populating an instance of the Person datastructure from this json st...

[ 0.005767822265625, 0.015380859375, -0.0272216796875, 0.01300048828125, -0.01202392578125, 0.0205078125, 0.0003032684326171875, 0.0079345703125, 0.0020751953125, -0.01953125, -0.007232666015625, -0.0087890625, 0.003814697265625, -0.004058837890625, -0.004364013671875, -0.0067138671875, ...

[ 11341, 830, 64977, 71713, 214, 85742, 2852, 161063, 46568, 5753, 50836, 12248, 43315, 34479, 1745, 4879, 37202, 28875, 57823, 184, 2940, 14119, 228624, 37842, 8, 40899, 10, 11, 1984, 126684, 15270, 18499, 11249, 54, 738, 1672, 27623, 1916, ...

[ 0.2265625, 0.03057861328125, 0.16650390625, 0.1646728515625, 0.093017578125, 0.084228515625, 0.16796875, 0.1165771484375, 0.07342529296875, 0.2257080078125, 0.1195068359375, 0.13134765625, 0.137451171875, 0.111083984375, 0.036956787109375, 0.0235748291015625, 0.0635986328125, 0.030...

embed

39309616_c0

39309616

haskell

0

Title: Haskell: parse error on input `|' Problem title: Haskell: parse error on input `|' Tags: haskell Problem: Haskell: parse error on input `|' I am getting this error: sky.hs:3:5: error: parse error on input `|' This is the code: sky list | (length list) /= 1 = reverse (last(even (sky list)) : reverse(odd...

Haskell: parse error on input `|' Haskell: parse error on input `|' haskell Haskell Haskell: parse error on input `|' I am getting this error: This is the code: Does anyone have any idea why this is happening? I have made sure that there are no tabs, just 4 spaces before the | symbol. This might seem like a n...

[ -0.007171630859375, 0.038330078125, -0.001068115234375, 0.002197265625, -0.0260009765625, 0.018310546875, -0.018798828125, 0.00250244140625, 0.01544189453125, -0.00250244140625, 0.005340576171875, -0.01519775390625, 0.0087890625, -0.003631591796875, 0, 0.0108642578125, 0.01171875, ...

[ 20625, 142508, 12, 366, 184, 18499, 98, 107730, 9473, 58745, 3768, 1556, 87, 444, 20949, 903, 3293, 83, 18151, 35672, 6528, 15400, 123087, 7228, 9077, 621, 110, 20928, 1660, 201, 32628, 8108, 26582, 95968, 9842, 1679 ]

[ 0.1624755859375, 0.23486328125, 0.048065185546875, 0.1793212890625, 0.15869140625, 0.234130859375, 0.1119384765625, 0.212646484375, 0.043731689453125, 0.1766357421875, 0.10467529296875, 0.143798828125, 0.001678466796875, 0.0093994140625, 0.02581787109375, 0.051666259765625, 0.0350952...

embed

27374642_c1

27374642

haskell

1

State i -> Pos -> More -> Failure i (State i) a -> Success i (State i) a -> IResult i a } data IResult i a = Fail i [String] String | Partial (i -> IResult i a) | Done i a type Failure i t a = t -> Pos -> More -> [String] -> String -> IResult i a type Success i t a = t -> Pos -> More -> a -> IResult i a where the type...

[ -0.021240234375, -0.00090789794921875, 0.00104522705078125, 0.005645751953125, -0.002899169921875, 0.0147705078125, -0.01141357421875, -0.032470703125, 0.01708984375, 0.00994873046875, 0.0159912109375, -0.0017242431640625, -0.028564453125, 0.00189971923828125, -0.0225830078125, 0.00897...

[ 22836, 17, 33079, 13498, 5455, 190355, 3408, 135206, 13, 10, 144053, 32863, 90, 7136, 2053, 2203, 71713, 214, 23351, 9148, 289, 14, 984, 86, 10644, 808, 6276, 29089, 1690, 959, 11814, 5, 15400, 903, 80934, 2806, 186, 434, 35133, 44402, ...

[ 0.173583984375, 0.1500244140625, 0.01397705078125, 0.1478271484375, 0.168212890625, 0.1905517578125, 0.1181640625, 0.09979248046875, 0.03497314453125, 0.12451171875, 0.201416015625, 0.0880126953125, 0.1689453125, 0.1915283203125, 0.156005859375, 0.09228515625, 0.045501708984375, 0....

embed

19208356_c0

19208356

haskell

0

Title: Ghc not starting properly [Windows 7 64 bit] Problem title: Ghc not starting properly [Windows 7 64 bit] Tags: haskell, ghc Problem: Ghc not starting properly [Windows 7 64 bit] I've just installed Haskell Platform, and ghci works fine, but for some reason i can't launch ghc. It crashes approximately 0,5 seconds...

Ghc not starting properly [Windows 7 64 bit] Ghc not starting properly [Windows 7 64 bit] haskell ghc Ghc Windows Ghc not starting properly [Windows 7 64 bit] I've just installed Haskell Platform, and ghci works fine, but for some reason i can't launch ghc. It crashes approximately 0,5 seconds after i start it. In the ...

[ 0.0076904296875, 0.0130615234375, 0.0184326171875, -0.003082275390625, -0.004669189453125, 0.0108642578125, -0.01092529296875, -0.02685546875, -0.00787353515625, -0.0024261474609375, 0.0089111328125, -0.00457763671875, -0.000736236572265625, 0.01470947265625, 0.006591796875, 0.00482177...

[ 55112, 238, 959, 72134, 155965, 43342, 361, 7911, 4785, 268, 1556, 142508, 31380, 3773, 1660, 20600, 20625, 70968, 318, 43240, 5885, 1284, 3060, 31635, 17, 831, 18, 83184, 1650, 150631, 189275, 32008, 94131, 7103, 4034, 442, 13651, 14364, 4...

[ 0.2191162109375, 0.23876953125, 0.0947265625, 0.1744384765625, 0.1434326171875, 0.1209716796875, 0.1536865234375, 0.185302734375, 0.12646484375, 0.001251220703125, 0.16552734375, 0.2374267578125, 0.1953125, 0.156494140625, 0.009857177734375, 0.0875244140625, 0.118896484375, 0.125, ...

embed

19970072_c0

19970072

haskell

0

Title: Get a session value with lookupSession Problem title: Get a session value with lookupSession Tags: yesod, haskell Problem: Get a session value with lookupSession I try to put a session value in a variable to display it in my .hamlet but it does not focntion! getEtatR :: Handler Html getEtatR = do mSessionValue <...

Get a session value with lookupSession Get a session value with lookupSession yesod haskell Get Handler Html Maybe Text Get a session value with lookupSession I try to put a session value in a variable to display it in my .hamlet but it does not focntion! I need #{myValue} to put it in my etat.hamlet

[ 0.003204345703125, 0.01104736328125, 0.00372314453125, -0.0198974609375, -0.0003681182861328125, -0.0022125244140625, 0.01336669921875, 0.00732421875, -0.00714111328125, -0.061767578125, 0.00933837890625, 0.00457763671875, -0.0223388671875, -0.00927734375, 0.01214599609375, 0.009887695...

[ 20779, 10, 56002, 34292, 678, 6713, 2037, 294, 90, 6889, 2422, 23722, 1556, 142508, 10639, 603, 18, 7237, 83425, 24129, 9790, 3884, 77336, 44116, 5, 3915, 1974, 959, 25581, 3871, 468, 1176, 856, 50770, 522 ]

[ 0.07415771484375, 0.07427978515625, 0.21337890625, 0.1895751953125, 0.100830078125, 0.115966796875, 0.150390625, 0.0926513671875, 0.143798828125, 0.1187744140625, 0.0748291015625, 0.1441650390625, 0.073974609375, 0.1781005859375, 0.1217041015625, 0.144287109375, 0.050872802734375, ...

embed

7838724_c0

7838724

haskell

0

Title: Get list of lists without recursion Problem title: Get list of lists without recursion Tags: haskell Problem: Get list of lists without recursion I'm trying to get all lists with length 4 from alphabet [0..9] with unique elements. allNumbers = [a | let list = [0..9], x1 <- list, x2 <- list, x3 <- list, x4 <- lis...

Get list of lists without recursion Get list of lists without recursion haskell Get Get list of lists without recursion I'm trying to get all lists with length 4 from alphabet [0..9] with unique elements. How can I get some simplest and nicest version of that? What if I need all such lists with length 10 (I don't want ...

[ -0.034912109375, 0.01513671875, -0.007659912109375, -0.00506591796875, -0.0034027099609375, -0.01409912109375, -0.0004711151123046875, -0.007476806640625, 0.0189208984375, -0.0517578125, 0.01409912109375, -0.0004215240478515625, 0.0211181640625, 0.0262451171875, -0.01092529296875, -0.0...

[ 20779, 5303, 111, 7, 15490, 195625, 1830, 1556, 142508, 31577, 2046, 756, 678, 140909, 201, 1295, 229231, 2389, 1126, 36998, 80854, 30362, 10443, 525, 11389, 3871, 209, 568, 1022, 4904, 20028, 3775, 48650, 35166, 65524 ]

[ 0.134521484375, 0.2259521484375, 0.0926513671875, 0.0936279296875, 0.190185546875, 0.2005615234375, 0.087646484375, 0.1524658203125, 0.202392578125, 0.057769775390625, 0.0963134765625, 0.04376220703125, 0.00537109375, 0.112060546875, 0.160888671875, 0.0286712646484375, 0.171630859375...

embed

67024536_c0

67024536

haskell

0

Title: Haskell: Print type of variable within function Problem title: Haskell: Print type of variable within function Tags: ghc, ghci, haskell, functional-programming Problem: Haskell: Print type of variable within function How do I print the type of a variable within a function in an .hs file? From ghci, I can do :typ...

Haskell: Print type of variable within function Haskell: Print type of variable within function ghc ghci haskell functional-programming Haskell Print h:t Haskell: Print type of variable within function How do I print the type of a variable within a function in an .hs file? From ghci, I can do :type var . How do I do so...

[ 0.00604248046875, -0.00457763671875, 0.00848388671875, 0.0174560546875, -0.0023651123046875, -0.0012054443359375, -0.0179443359375, 0.0186767578125, -0.002960205078125, -0.0157470703125, 0.0032958984375, -0.040771484375, 0.0030364990234375, -0.021240234375, 0.009765625, 0.01611328125, ...

[ 20625, 142508, 39754, 10644, 111, 77336, 28032, 32354, 31380, 238, 318, 1556, 123309, 28966, 1096, 12, 18, 54, 87, 28412, 23, 5, 127, 7, 11435, 28090, 831, 152, 50986, 285, 4153, 99, 11907, 195625, 720 ]

[ 0.1241455078125, 0.2303466796875, 0.211669921875, 0.210693359375, 0.054046630859375, 0.2486572265625, 0.12841796875, 0.1663818359375, 0.0997314453125, 0.090576171875, 0.1207275390625, 0.109375, 0.09619140625, 0.02301025390625, 0.09808349609375, 0.017242431640625, 0.09423828125, 0.0...

embed

11370778_c0

11370778

haskell

0

Title: How to import specific PortNumber constructor Problem title: How to import specific PortNumber constructor Tags: haskell Problem: How to import specific PortNumber constructor Simple question. This compiles: module Example where import Network port :: PortID port = PortNumber 3001 And this does not: module Examp...

How to import specific PortNumber constructor How to import specific PortNumber constructor haskell specific Network How PortNumber Example PortID Example.hs:6:8 Not How to import specific PortNumber constructor Simple question. This compiles: And this does not: GHC says: Why?

[ -0.01153564453125, -0.0096435546875, -0.0133056640625, 0.02734375, -0.00262451171875, 0.00347900390625, -0.01397705078125, -0.002044677734375, 0.003692626953125, 0.000858306884765625, -0.00040435791015625, -0.0546875, 0.01220703125, 0.00592041015625, -0.00147247314453125, -0.013671875,...

[ 11249, 24927, 29458, 13791, 18444, 26278, 64549, 748, 47, 1556, 142508, 28997, 89536, 7146, 127, 910, 1019, 11205, 3293, 9969, 1340, 903, 14602, 959, 527, 73265, 17378, 44084 ]

[ 0.0275421142578125, 0.2479248046875, 0.2138671875, 0.16259765625, 0.1556396484375, 0.18994140625, 0.185302734375, 0.10986328125, 0.034698486328125, 0.11761474609375, 0.184814453125, 0.10919189453125, 0.0286865234375, 0.1126708984375, 0.0635986328125, 0.042236328125, 0.1083984375, 0...

embed

24439917_c0

24439917

haskell

0

Title: Combining the state monad with the costate comonad Problem title: Combining the state monad with the costate comonad Tags: functional-programming, haskell, comonad, monads, category-theory Problem: Combining the state monad with the costate comonad How to combine the state monad S -> (A, S) with the costate como...

Combining the state monad with the costate comonad Combining the state monad with the costate comonad functional-programming haskell comonad monads category-theory Combining Combining the state monad with the costate comonad How to combine the state monad S -> (A, S) with the costate comonad (E->A, E) ? I tried with bo...

[ -0.0244140625, 0.021484375, -0.00994873046875, 0.0172119140625, -0.006439208984375, -0.00860595703125, -0.0137939453125, -0.007659912109375, 0.00909423828125, -0.036865234375, -0.007781982421875, 0.0004215240478515625, -0.004058837890625, 0.034423828125, -0.0130615234375, 0.00248718261...

[ 106935, 592, 11341, 2667, 712, 678, 80028, 13, 533, 9169, 123309, 28966, 1556, 142508, 95487, 2347, 11249, 47, 70163, 159, 33079, 284, 4, 70, 647, 103607, 241, 37842, 15044, 162520, 162515, 40101, 959, 3714, 3642, 61924, 41018, 30646, 12566...

[ 0.2293701171875, 0.057647705078125, 0.2054443359375, 0.154052734375, 0.2027587890625, 0.12158203125, 0.16943359375, 0.1544189453125, 0.1649169921875, 0.23828125, 0.11376953125, 0.1119384765625, 0.090087890625, 0.1861572265625, 0.1314697265625, 0.0225830078125, 0.04559326171875, 0.0...

embed

28246409_c0

28246409

haskell

0

Title: Inlining repeated calls (GHC) Problem title: Inlining repeated calls (GHC) Tags: optimization, inlining, haskell, ghc Problem: Inlining repeated calls (GHC) Will GHC inline a function that is used more than once? For example: {-# INLINE innerLoop #-} innerLoop x = stuff... g f = f 0 + f 1 + f 2 If we call g inne...

Inlining repeated calls (GHC) Inlining repeated calls (GHC) optimization inlining haskell ghc Inlining GHC INLINE Inlining repeated calls (GHC) Will GHC inline a function that is used more than once? For example: If we call g innerLoop will the function innerLoop be duplicated three times? Or will it just became g stuf...

[ 0.0034942626953125, -0.0004520416259765625, 0.00592041015625, 0.01397705078125, 0.0036163330078125, 0.00836181640625, 0.000644683837890625, -0.01251220703125, 0.00701904296875, -0.0224609375, -0.003814697265625, -0.0113525390625, -0.0093994140625, 0.002777099609375, 0.0274658203125, 0....

[ 360, 150, 592, 119140, 297, 11782, 41877, 441, 7, 87235, 23, 1556, 142508, 31380, 238, 527, 73265, 5881, 57339, 20255, 2256, 32354, 83, 11814, 1286, 3501, 24145, 706, 75414, 15363, 2146, 1221, 171763, 3674, 17262, 20028, 100512, 41884, 3777...

[ 0.1165771484375, 0.19091796875, 0.1292724609375, 0.2001953125, 0.087158203125, 0.189208984375, 0.145263671875, 0.13818359375, 0.0171661376953125, 0.116455078125, 0.1458740234375, 0.075927734375, 0.1683349609375, 0.1090087890625, 0.0911865234375, 0.109619140625, 0.215087890625, 0.11...

embed

19938423_c0

19938423

haskell

0

Title: Traversable and zippers. Necessity and sufficiency Problem title: Traversable and zippers. Necessity and sufficiency Tags: zipper, haskell Problem: Traversable and zippers. Necessity and sufficiency Every type T overloading the Traversable brings forth a Zipper T . I.e. existence of the instance Traversable T is...

Traversable and zippers. Necessity and sufficiency Traversable and zippers. Necessity and sufficiency zipper haskell Traversable Necessity Traversable and zippers. Necessity and sufficiency Every type T overloading the Traversable brings forth a Zipper T . I.e. existence of the instance Traversable T is the sufficient ...

[ -0.004425048828125, 0.01031494140625, -0.00186920166015625, 0.01458740234375, -0.00140380859375, 0.004150390625, -0.01068115234375, 0.00191497802734375, 0.01055908203125, -0.02490234375, -0.01312255859375, -0.006866455078125, -0.0089111328125, -0.002899169921875, 0.00933837890625, 0.02...

[ 4937, 7864, 2886, 136, 68330, 21777, 161467, 7, 2481, 133784, 1474, 3546, 8079, 1556, 142508, 87769, 10644, 384, 645, 63033, 214, 19095, 100, 927, 10, 9315, 116311, 110527, 129980, 35431, 98869, 63559, 80934 ]

[ 0.1239013671875, 0.201171875, 0.211669921875, 0.0767822265625, 0.157958984375, 0.2047119140625, 0.169921875, 0.11083984375, 0.0771484375, 0.144775390625, 0.0921630859375, 0.161865234375, 0.2369384765625, 0.124755859375, 0.21630859375, 0.05474853515625, 0.1490478515625, 0.1772460937...

embed

20247749_c0

20247749

haskell

0

Title: Haskell Couldn't match expected type `Integer' with actual type `[Integer]' Problem title: Haskell Couldn't match expected type `Integer' with actual type `[Integer]' Tags: haskell Problem: Haskell Couldn't match expected type `Integer' with actual type `[Integer]' Here is my code h...

Haskell Couldn't match expected type `Integer' with actual type `[Integer]' Haskell Couldn't match expected type `Integer' with actual type `[Integer]' haskell Haskell Couldn Integer Rank Numeric Jack Queen King Ace Show Haskell Couldn't match expected type `Integer' with actual type `[Int...

[ -0.0262451171875, -0.0150146484375, -0.00848388671875, 0.00469970703125, -0.006988525390625, 0.015869140625, -0.0238037109375, -0.031982421875, -0.0191650390625, 0.009765625, 0.017333984375, 0.0012664794921875, 0.01007080078125, -0.016845703125, -0.0167236328125, -0.01312255859375, -...

[ 20625, 142508, 191147, 3768, 18, 14858, 84751, 10644, 4153, 67, 1505, 678, 8561, 1556, 44401, 134405, 93511, 21763, 44109, 18813, 70280, 17367, 759, 18151, 3642, 831, 5154, 7440, 653, 83, 23, 17721, 787, 5, 963 ]

[ 0.142578125, 0.267333984375, 0.07818603515625, 0.083251953125, 0.151123046875, 0.158203125, 0.1400146484375, 0.1572265625, 0.06884765625, 0.16015625, 0.1429443359375, 0.0301055908203125, 0.111328125, 0.109619140625, 0.21533203125, 0.2135009765625, 0.09637451171875, 0.1163330078125,...

embed

4290163_c0

4290163

haskell

0

Title: How can I write a MST algorithm (Prim or Kruskal) in Haskell? Problem title: How can I write a MST algorithm (Prim or Kruskal) in Haskell? Tags: minimum-spanning-tree, kruskals-algorithm, prims-algorithm, haskell Problem: How can I write a MST algorithm (Prim or Kruskal) in Haskell? I can write both Prim's and K...

How can I write a MST algorithm (Prim or Kruskal) in Haskell? How can I write a MST algorithm (Prim or Kruskal) in Haskell? minimum-spanning-tree kruskals-algorithm prims-algorithm haskell How MST Prim Kruskal Haskell How can I write a MST algorithm (Prim or Kruskal) in Haskell? I can write both Prim's and Kruskal's al...

[ 0.01416015625, 0.04541015625, 0.004547119140625, -0.007537841796875, 0.01239013671875, 0.00020503997802734375, -0.02392578125, -0.0260009765625, -0.03173828125, -0.0322265625, 0.00677490234375, -0.0194091796875, 0.00144195556640625, 0.0019378662109375, -0.002716064453125, 0.01013183593...

[ 11249, 831, 33022, 276, 8545, 234873, 145111, 707, 28160, 7, 2595, 23, 20625, 142508, 87, 10, 15440, 19332, 592, 62600, 13210, 100628, 2783, 18337, 29810, 1556, 44506, 136, 7413, 175884, 53201, 313, 37223, 41925, 3642, 29479, 2856, 678, 180...

[ 0.0830078125, 0.10528564453125, 0.19287109375, 0.1182861328125, 0.20703125, 0.251953125, 0.2445068359375, 0.0196380615234375, 0.19091796875, 0.1253662109375, 0.249755859375, 0.0902099609375, 0.1641845703125, 0.260986328125, 0.0283966064453125, 0.02459716796875, 0.2220458984375, 0.1...

embed

46589047_c2

46589047

haskell

2

go’ at NoSnd.hs:27:9-15 ‘x’ is a rigid type variable bound by a pattern with constructor: :& :: forall k (a :: k -> *) (x :: k) (xr :: [k]). a x -> HList a xr -> HList a (x : xr), in an equation for ‘go’ at NoSnd.hs:27:9 • In the first argument of ‘(:&)’, namely ‘f x’ In the expression: f x :& go xs Code signals: HList...

[ -0.0002346038818359375, 0.0223388671875, -0.01007080078125, -0.0115966796875, 0.008056640625, 0.0103759765625, -0.01287841796875, 0.00872802734375, 0.0113525390625, -0.0269775390625, 0.00439453125, -0.035888671875, 0.0118408203125, 0.0024261474609375, -0.0042724609375, 0.00139617919921...

[ 738, 26, 99, 438, 2208, 127, 27592, 1126, 13386, 204, 425, 83, 10, 128652, 10644, 77336, 99091, 390, 103510, 678, 64549, 748, 152, 1230, 1984, 100, 5584, 472, 11, 33079, 661, 42, 92, 1022, 572, 154663, 28, 5490, 519, 5117, 10750, 12, ...

[ 0.290283203125, 0.096435546875, 0.0701904296875, 0.102294921875, 0.09893798828125, 0.03448486328125, 0.093994140625, 0.10546875, 0.1246337890625, 0.051239013671875, 0.242919921875, 0.1239013671875, 0.1007080078125, 0.256591796875, 0.22314453125, 0.286376953125, 0.2208251953125, 0.0...

embed

47271149_c0

47271149

haskell

0

Title: Haskell Use guarded equation to create type Problem title: Haskell Use guarded equation to create type Tags: haskell, functional-programming Problem: Haskell Use guarded equation to create type I want to create a type called TwoValued and it contains two values: a and b , and I'd like to make sure that a <= b da...

Haskell Use guarded equation to create type Haskell Use guarded equation to create type haskell functional-programming Haskell Use TwoValued ValuePair Haskell Use guarded equation to create type I want to create a type called TwoValued and it contains two values: a and b , and I'd like to make sure that a <= b But it's...

[ -0.01092529296875, -0.003631591796875, 0.00396728515625, 0.01470947265625, 0.00927734375, 0.0172119140625, -0.014892578125, 0.00897216796875, 0.019287109375, 0.01348876953125, 0.0042724609375, -0.0001392364501953125, 0.0167236328125, -0.0033721923828125, 0.0103759765625, -0.00860595703...

[ 20625, 142508, 36836, 56050, 297, 28, 5490, 2320, 28282, 10644, 1556, 123309, 28966, 32964, 42272, 34, 190060, 8335, 481, 3444, 35839, 70541, 6626, 142424, 10, 136, 876, 1884, 3249, 9077, 4426, 1369, 959, 20697, 83, 107003, 3688, 69307 ]

[ 0.1441650390625, 0.20068359375, 0.05841064453125, 0.218994140625, 0.1527099609375, 0.04937744140625, 0.1937255859375, 0.06005859375, 0.1561279296875, 0.2230224609375, 0.1444091796875, 0.11474609375, 0.07733154296875, 0.18115234375, 0.1800537109375, 0.1287841796875, 0.097900390625, ...

embed

30072001_c0

30072001

haskell

0

Title: Haskell - zip 2 lists Problem title: Haskell - zip 2 lists Tags: haskell Problem: Haskell - zip 2 lists I want to write a function that zips two lists together. I have the following code: zip' :: [a]->[b]->[(a,b)] zip' _ [] = [] zip' [] _ = [] zip' (x:xs)(y:ys)=(x,y) zip'(xs ys) The problem is that when I compil...

Haskell - zip 2 lists Haskell - zip 2 lists haskell Haskell x:xs y:ys Haskell - zip 2 lists I want to write a function that zips two lists together. I have the following code: The problem is that when I compile the code I get a lot of errors Any ideas what am I doing wrong? Sorry if this may sound like stupid question.

[ 0.00921630859375, 0.005126953125, 0.006744384765625, 0.0162353515625, -0.0032196044921875, 0.029052734375, -0.0274658203125, -0.005767822265625, 0.0098876953125, 0.00848388671875, 0.0140380859375, -0.01611328125, 0.0087890625, 0.00616455078125, -0.01531982421875, 0.0194091796875, 0.0...

[ 20625, 142508, 68330, 116, 5303, 20, 1556, 1022, 12, 425, 7, 113, 4778, 87, 3444, 33022, 32354, 6626, 25842, 70, 25632, 18151, 2967, 3229, 9969, 1340, 2046, 5915, 18499, 25647, 20594, 44691, 90502, 45730, 110833 ]

[ 0.126953125, 0.2286376953125, 0.2371826171875, 0.169677734375, 0.2322998046875, 0.011871337890625, 0.125244140625, 0.03729248046875, 0.03363037109375, 0.0867919921875, 0.09735107421875, 0.0753173828125, 0.1251220703125, 0.004638671875, 0.081298828125, 0.106201171875, 0.154541015625, ...

embed

31790327_c0

31790327

haskell

0

Title: Where can BangPatterns appear Problem title: Where can BangPatterns appear Tags: haskell, strictness, ghc Problem: Where can BangPatterns appear From GHC user guide it seems like most Pat can be PBangPat , but there are a few exceptions. e.g. top-level bangs in a module (like !main ) aren't allowed and x : !xs f...

Where can BangPatterns appear Where can BangPatterns appear haskell strictness ghc Where BangPatterns Pat PBangPat Where can BangPatterns appear From GHC user guide it seems like most Pat can be PBangPat , but there are a few exceptions. e.g. top-level bangs in a module (like !main ) aren't allowed and x : !xs fails to...

[ 0.0069580078125, 0.02587890625, -0.0157470703125, -0.00439453125, -0.01434326171875, 0.026611328125, 0.01104736328125, 0.003143310546875, 0.016845703125, 0.0034637451171875, -0.00118255615234375, -0.044189453125, 0.03857421875, -0.01904296875, -0.0115966796875, 0.00162506103515625, 0...

[ 78662, 831, 26387, 8335, 3055, 1779, 108975, 1556, 142508, 81113, 7432, 31380, 238, 9876, 57842, 1463, 683, 257, 527, 73265, 38937, 17997, 2684, 186, 10846, 131527, 2663, 67919, 11339, 7, 23, 88996, 711, 24931, 18, 107003, 1022, 425, 35782,...

[ 0.1226806640625, 0.0968017578125, 0.2471923828125, 0.2122802734375, 0.1890869140625, 0.1370849609375, 0.15673828125, 0.1085205078125, 0.1796875, 0.1597900390625, 0.03173828125, 0.0682373046875, 0.06915283203125, 0.160888671875, 0.052825927734375, 0.16748046875, 0.13330078125, 0.146...

embed

61293220_c0

61293220

haskell

0

Title: What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) -> a) Problem title: What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) -> a) Tags: haskell, functor Problem: What would be the Functor instance for the following type: newty...

What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) -> a) What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) -> a) haskell functor What Functor What would be the Functor instance for the following type: newtype F2 x a = F2 ((a -> x) ...

[ -0.005340576171875, -0.0228271484375, 0.024169921875, -0.0036163330078125, 0.004058837890625, 0.038330078125, -0.00119781494140625, -0.0047607421875, 0.0186767578125, 0.0196533203125, -0.0036773681640625, -0.0150146484375, 0.01385498046875, 0.00872802734375, -0.0078125, -0.013793945312...

[ 4865, 2806, 186, 28670, 18770, 110527, 100, 25632, 10644, 3525, 50986, 563, 304, 1022, 10, 11, 20, 1230, 5386, 70, 1556, 142508, 7477, 60494, 33079, 16, 3444, 33022, 1238, 62346, 32354, 36917, 119056, 1284, 444, 179933, 3688 ]

[ 0.0906982421875, 0.1041259765625, 0.0648193359375, 0.2061767578125, 0.224853515625, 0.259765625, 0.049530029296875, 0.0928955078125, 0.1688232421875, 0.1376953125, 0.246337890625, 0.1461181640625, 0.19873046875, 0.1058349609375, 0.1072998046875, 0.063720703125, 0.0447998046875, 0.0...

embed

1861432_c0

1861432

haskell

0

Title: Choosing among alternatives in a Haskell algebraic datatype Problem title: Choosing among alternatives in a Haskell algebraic datatype Tags: haskell, types, data-structures, algebraic-data-types Problem: Choosing among alternatives in a Haskell algebraic datatype When type X is defined as: data X = X { sVal :: S...

Choosing among alternatives in a Haskell algebraic datatype Choosing among alternatives in a Haskell algebraic datatype haskell types data-structures algebraic-data-types Choosing Haskell Bool Choosing among alternatives in a Haskell algebraic datatype When type X is defined as: and I want the Int inside an X value, if...

[ -0.0130615234375, 0.0003108978271484375, 0.01904296875, 0.034423828125, -0.01007080078125, 0.00885009765625, -0.000782012939453125, -0.0126953125, -0.00732421875, 0.023193359375, 0.0091552734375, -0.0137939453125, -0.0098876953125, 0.00909423828125, 0.017822265625, 0.0007781982421875, ...

[ 4960, 232, 214, 54940, 30700, 20625, 142508, 429, 2844, 2053, 50986, 1556, 52895, 137656, 10135, 2460, 929, 10644, 1193, 61924, 237, 87, 3444, 360, 18, 46132, 34292, 2174, 2685, 1632, 120262, 45234, 83324, 111, 10750, 30646, 4153, 83 ]

[ 0.062744140625, 0.1038818359375, 0.0157318115234375, 0.1116943359375, 0.1766357421875, 0.121337890625, 0.2288818359375, 0.0404052734375, 0.1141357421875, 0.068603515625, 0.205322265625, 0.1058349609375, 0.18701171875, 0.126708984375, 0.0574951171875, 0.0723876953125, 0.1697998046875,...

embed

39424505_c0

39424505

haskell

0

Title: What is the name of this monoid law? Problem title: What is the name of this monoid law? Tags: haskell Problem: What is the name of this monoid law? In the documentation for Data.Monoid , it states the following laws should be satisfied: mappend mempty x = x mappend x mempty = x mappend x (mappend y z) = mappend...

What is the name of this monoid law? What is the name of this monoid law? haskell What Data.Monoid What is the name of this monoid law? In the documentation for Data.Monoid , it states the following laws should be satisfied: My understanding of these is that the first 2 are identity, and the third is associativity. But...

[ 0.007415771484375, -0.00994873046875, 0.01513671875, 0.049560546875, 0.018798828125, 0.0303955078125, 0.005279541015625, 0.01904296875, 0.0247802734375, 0.0107421875, -0.007415771484375, -0.01019287109375, -0.0091552734375, -0.005462646484375, 0.002838134765625, 0.00518798828125, -0....

[ 4865, 9351, 111, 903, 22460, 532, 27165, 83, 1556, 142508, 11809, 5, 46674, 48899, 70, 209806, 25632, 131703, 5608, 214521, 100094, 5117, 182324, 50960, 166027, 3760, 22759, 927, 13315, 71257, 2481, 13438, 347, 2271, 4460 ]

[ 0.04449462890625, 0.1334228515625, 0.06976318359375, 0.1395263671875, 0.2117919921875, 0.218017578125, 0.2174072265625, 0.03350830078125, 0.1419677734375, 0.2410888671875, 0.1622314453125, 0.030029296875, 0.17919921875, 0.24560546875, 0.00225830078125, 0.1055908203125, 0.009826660156...

embed

40412068_c0

40412068

haskell

0

Title: Order of execution with Haskell's `mapM` Problem title: Order of execution with Haskell's `mapM` Tags: haskell, traversable, io-monad, monads Problem: Order of execution with Haskell's `mapM` Consider the following Haskell statement: mapM print ["1", "2", "3"] Indeed, this prints "1", "2", and "3" in o...

Order of execution with Haskell's `mapM` Order of execution with Haskell's `mapM` haskell traversable io-monad monads Order Haskell Order of execution with Haskell's `mapM` Consider the following Haskell statement: Indeed, this prints "1", "2", and "3" in order. Question: How do you know that mapM will first ...

[ 0.01019287109375, 0.001373291015625, -0.006744384765625, 0.0235595703125, 0.0072021484375, 0.00799560546875, -0.0035400390625, -0.0133056640625, 0.0084228515625, -0.02099609375, -0.0008087158203125, -0.015869140625, 0.0086669921875, 0.00103759765625, -0.004547119140625, 0.017822265625,...

[ 81206, 111, 71924, 1830, 678, 20625, 142508, 3768, 62346, 594, 1556, 37317, 2886, 22995, 3796, 712, 2667, 137399, 25632, 63805, 102627, 903, 28412, 418, 304, 136, 363, 12989, 11249, 3714, 22288, 1221, 5117, 7068, 77681, 142027, 187020, 29479,...

[ 0.19873046875, 0.070068359375, 0.19482421875, 0.0340576171875, 0.0965576171875, 0.128173828125, 0.238525390625, 0.055419921875, 0.2177734375, 0.2059326171875, 0.1029052734375, 0.1243896484375, 0.025177001953125, 0.1484375, 0.0509033203125, 0.06817626953125, 0.048095703125, 0.012451...

embed

55086822_c1

55086822

haskell

1

Value -- V ["dish","dash","dosh"] -- instance Read Value where readPrec = readP_to_Prec (const readValues) Is it the case that read will success only if there is nothing left in the snd of the last [(Value,String)] , other elements in this list are unuse anywhere? I am aware of alternative way to do this. This questio...

[ -0.005462646484375, 0.003692626953125, -0.00701904296875, 0.0301513671875, -0.026123046875, 0.02734375, 0.0128173828125, -0.016357421875, 0.00933837890625, 0.00909423828125, 0.010009765625, 0.003448486328125, 0.01416015625, -0.01953125, -0.005828857421875, -0.0159912109375, -0.023437...

[ 190060, 4210, 310, 71, 4745, 155892, 79652, 110527, 4764, 12301, 19273, 238, 683, 188, 25553, 18, 42272, 21049, 7225, 1221, 36272, 4734, 2174, 33720, 25737, 23, 91, 2208, 111, 4568, 856, 50770, 71713, 214, 3789, 80854, 903, 5303, 51, 4032...

[ 0.29443359375, 0.0303955078125, 0.2130126953125, 0.0958251953125, 0.1766357421875, 0.193115234375, 0.17724609375, 0.218017578125, 0.2113037109375, 0.26904296875, 0.16650390625, 0.0789794921875, 0.12646484375, 0.154296875, 0.06512451171875, 0.083740234375, 0.1514892578125, 0.1276855...

embed

41026605_c0

41026605

haskell

0

Title: Haskell - put function on pair Problem title: Haskell - put function on pair Tags: haskell Problem: Haskell - put function on pair I have a following State monad: type S = (M.Map String Integer, [String]) Now, I have a function: rTD :: [String] -> ReaderT Env (StateT S (ErrorT String IO)) rTD (s, _) <- get -- (1...

Haskell - put function on pair Haskell - put function on pair haskell Haskell State M.Map Integer ReaderT Env StateT ErrorT Store Haskell - put function on pair I have a following State monad: Now, I have a function: (1) how to here use put function to modify one element of pair my Store ? Thanks in advance.

[ -0.023193359375, 0.0024566650390625, -0.020263671875, -0.00885009765625, -0.0028076171875, 0.00023937225341796875, -0.028564453125, -0.0081787109375, -0.0028076171875, -0.017578125, 0.0262451171875, 0.0245361328125, 0.00146484375, -0.00836181640625, 0.003662109375, -0.0079345703125, ...

[ 20625, 142508, 3884, 32354, 98, 80836, 1556, 22836, 276, 166179, 44401, 122636, 618, 334, 212059, 14934, 765, 25632, 2667, 712, 798, 3642, 47, 3688, 4527, 2811, 40383, 1632, 12830, 111, 129745 ]

[ 0.1397705078125, 0.25390625, 0.2197265625, 0.2138671875, 0.1695556640625, 0.262939453125, 0.1397705078125, 0.1395263671875, 0.01471710205078125, 0.12225341796875, 0.0948486328125, 0.178466796875, 0.063720703125, 0.053253173828125, 0.11309814453125, 0.21728515625, 0.00820159912109375,...

embed

19286264_c0

19286264

haskell

0

Title: Snap web framework and dynamic recompilation Problem title: Snap web framework and dynamic recompilation Tags: haskell-snap-framework, haskell Problem: Snap web framework and dynamic recompilation I'm building a web app with the Snap web framework. I have created a project with snap init. I then cabal install -f...

Snap web framework and dynamic recompilation Snap web framework and dynamic recompilation haskell-snap-framework haskell Snap Details Unknown Snap web framework and dynamic recompilation I'm building a web app with the Snap web framework. I have created a project with snap init. I then cabal install -fdevelopment, caba...

[ -0.01123046875, 0.01055908203125, 0.00665283203125, -0.00124359130859375, -0.029541015625, 0.020263671875, -0.00775146484375, 0.004241943359375, -0.0035247802734375, -0.03955078125, -0.040771484375, -0.0296630859375, -0.013427734375, 0.00086212158203125, 0.0247802734375, 0.003295898437...

[ 121190, 1467, 170846, 136, 84079, 33844, 11368, 57860, 1556, 142508, 7, 10957, 160328, 18244, 77658, 69723, 33976, 4027, 678, 75935, 10, 13452, 76685, 23, 217, 109524, 20600, 20, 420, 229815, 11675, 1957, 903, 18499, 3229, 81887, 19922, 63262...

[ 0.276611328125, 0.192138671875, 0.2213134765625, 0.0733642578125, 0.1966552734375, 0.1011962890625, 0.1702880859375, 0.04241943359375, 0.11181640625, 0.1893310546875, 0.006744384765625, 0.2108154296875, 0.12841796875, 0.0262298583984375, 0.08319091796875, 0.0751953125, 0.086608886718...

embed

43003686_c0

43003686

haskell

0

Title: Haskell optimizing infinite list implementation Problem title: Haskell optimizing infinite list implementation Tags: haskell, optimization, infinite, list Problem: Haskell optimizing infinite list implementation My code gives the wanted result but I wonder if there is a better way to code this. This is the given...

Haskell optimizing infinite list implementation Haskell optimizing infinite list implementation haskell optimization infinite list Haskell x:y:xs x:y Haskell optimizing infinite list implementation My code gives the wanted result but I wonder if there is a better way to code this. This is the given example: and the giv...

[ 0.00421142578125, 0.00244140625, 0.006072998046875, -0.003448486328125, 0.00048828125, 0.013671875, -0.01361083984375, -0.01495361328125, 0.0196533203125, -0.009521484375, 0.0230712890625, -0.0017852783203125, 0.0067138671875, -0.0184326171875, -0.014892578125, 0.00933837890625, 0.00...

[ 20625, 142508, 15572, 84382, 54241, 5303, 208124, 13, 1556, 87235, 1022, 12, 53, 425, 7, 18151, 76199, 36663, 16750, 32195, 11522, 3917, 903, 70, 27781, 136, 34475, 2646, 29806 ]

[ 0.1279296875, 0.1685791015625, 0.162353515625, 0.0616455078125, 0.166748046875, 0.1861572265625, 0.1671142578125, 0.047088623046875, 0.1365966796875, 0.161865234375, 0.034912109375, 0.01454925537109375, 0.0576171875, 0.0721435546875, 0.0330810546875, 0.126953125, 0.046234130859375, ...

embed

68910984_c0

68910984

haskell

0

Title: hSetBuffering stdin NoBuffering doesn't work on windows Problem title: hSetBuffering stdin NoBuffering doesn't work on windows Tags: windows, haskell Problem: hSetBuffering stdin NoBuffering doesn't work on windows im trying to read raw characters from input but modifying the buffer mode to "NoBufferMo...

hSetBuffering stdin NoBuffering doesn't work on windows hSetBuffering stdin NoBuffering doesn't work on windows windows haskell NoBuffering hSetBuffering stdin NoBuffering doesn't work on windows im trying to read raw characters from input but modifying the buffer mode to "NoBufferMode" doesn't seems to work ...

[ -0.0020904541015625, 0.01263427734375, 0.018310546875, -0.001922607421875, -0.01434326171875, 0.0103759765625, 0.027587890625, -0.0155029296875, -0.0096435546875, -0.0017852783203125, -0.013671875, -0.01470947265625, 0.0035247802734375, -0.00750732421875, -0.0191650390625, -0.027099609...

[ 1096, 294, 126, 7235, 18234, 6138, 3035, 438, 214, 22027, 3768, 18, 4488, 98, 54825, 1556, 142508, 12301, 49649, 124850, 107730, 2811, 373, 13736, 5021, 9083, 7464, 144570, 24234, 3525, 2256, 51347, 11782, 46389, 86997 ]

[ 0.107666015625, 0.033416748046875, 0.1434326171875, 0.1220703125, 0.173583984375, 0.1512451171875, 0.1568603515625, 0.1556396484375, 0.061767578125, 0.032012939453125, 0.054901123046875, 0.048492431640625, 0.1181640625, 0.069091796875, 0.17236328125, 0.1177978515625, 0.207275390625, ...

embed

50222098_c0

50222098

haskell

0

Title: Is there Bounded (Maybe a) for un-Bounded a? Problem title: Is there Bounded (Maybe a) for un-Bounded a? Tags: haskell Problem: Is there Bounded (Maybe a) for un-Bounded a? I have a Foldable of Integer s which are unbounded and thus I cannot apply a Max fold to it. Would it make sense to define Max instance of N...

Is there Bounded (Maybe a) for un-Bounded a? Is there Bounded (Maybe a) for un-Bounded a? haskell Bounded Maybe Foldable Integer Max Nothing Ord Semigroup Option Is there Bounded (Maybe a) for un-Bounded a? I have a Foldable of Integer s which are unbounded and thus I cannot apply a Max fold to it. Would it make sense ...

[ -0.01318359375, 0.0137939453125, 0.0286865234375, 0.0111083984375, -0.01092529296875, 0.005157470703125, 0.01397705078125, -0.0203857421875, 0.028076171875, 0.0167236328125, -0.01544189453125, 0.00372314453125, 0.001708984375, 0.0128173828125, 0.0152587890625, -0.0107421875, -0.00772...

[ 2071, 2685, 335, 167457, 82419, 372, 10, 100, 51, 571, 1556, 142508, 83425, 30077, 71, 2886, 44401, 9920, 182747, 35379, 84420, 51588, 86769, 91, 99091, 53418, 59911, 42822, 10422, 61924, 110527, 111, 34292, 959, 32316, 71346, 7413, 143045, ...

[ 0.044830322265625, 0.08953857421875, 0.1224365234375, 0.230712890625, 0.1253662109375, 0.061859130859375, 0.17626953125, 0.0467529296875, 0.118896484375, 0.0977783203125, 0.1234130859375, 0.2142333984375, 0.105712890625, 0.1591796875, 0.101318359375, 0.184814453125, 0.16015625, 0.1...

embed

47468078_c0

47468078

haskell

0

Title: Constructing a reverse order list of Ints in Haskell Problem title: Constructing a reverse order list of Ints in Haskell Tags: haskell Problem: Constructing a reverse order list of Ints in Haskell I understand that I can define an ordered list of integers by use of the construct [1..10]. For example: > [1..10] =...

Constructing a reverse order list of Ints in Haskell Constructing a reverse order list of Ints in Haskell haskell Constructing Ints Haskell Constructing a reverse order list of Ints in Haskell I understand that I can define an ordered list of integers by use of the construct [1..10]. For example: But if I want to defin...

[ -0.01019287109375, 0.00927734375, -0.0020904541015625, 0.01165771484375, -0.0074462890625, 0.0198974609375, -0.013671875, 0.005615234375, -0.003936767578125, 0.0089111328125, 0.01043701171875, -0.0140380859375, 0.02099609375, 0.0174560546875, -0.00823974609375, 0.00150299072265625, 0...

[ 1657, 36716, 39531, 184, 12989, 5303, 360, 933, 20625, 142508, 23, 1556, 28219, 831, 61924, 297, 111, 892, 26255, 4527, 64549, 68252, 5, 963, 21373, 15400, 25632, 4488, 237, 84751, 1284, 27489, 201505 ]

[ 0.0255889892578125, 0.175048828125, 0.1846923828125, 0.1722412109375, 0.1806640625, 0.16796875, 0.1119384765625, 0.1337890625, 0.1280517578125, 0.22119140625, 0.0180816650390625, 0.12109375, 0.027618408203125, 0.0086669921875, 0.1700439453125, 0.08050537109375, 0.005157470703125, 0...

embed