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
35749318_c0
35749318
haskell
0
Title: Is there a standard Haskell function like iterate that stops for Nothing? Problem title: Is there a standard Haskell function like iterate that stops for Nothing? Tags: haskell-platform, standard-library, haskell Problem: Is there a standard Haskell function like iterate that stops for Nothing? I am wondering if...
Is there a standard Haskell function like iterate that stops for Nothing? Is there a standard Haskell function like iterate that stops for Nothing? haskell-platform standard-library haskell Haskell Nothing Just Is there a standard Haskell function like iterate that stops for Nothing? I am wondering if there is a standa...
[ 0.0029296875, -0.00885009765625, 0.03173828125, 0.0012054443359375, 0.0025634765625, 0.022216796875, 0.01153564453125, -0.0140380859375, 0.0036468505859375, -0.035888671875, -0.0086669921875, -0.001983642578125, -0.020263671875, -0.01409912109375, 0.0205078125, 0.00048065185546875, -...
[ 2685, 5570, 20625, 142508, 32354, 1884, 17, 8560, 67, 450, 7279, 7, 100, 182747, 10, 1556, 172121, 2844, 9563, 149016, 1636, 30646, 34292, 645, 61475, 43799, 214, 142424, 5303, 1284, 86658, 3229, 62163, 47, 29479, 12921, 438, 86, 152488, ...
[ 0.06304931640625, 0.2132568359375, 0.1417236328125, 0.2548828125, 0.2232666015625, 0.1065673828125, 0.07763671875, 0.270751953125, 0.1759033203125, 0.0400390625, 0.1781005859375, 0.08392333984375, 0.129150390625, 0.21484375, 0.0226593017578125, 0.1060791015625, 0.045074462890625, 0...
embed
51359696_c0
51359696
haskell
0
Title: Couldn't match expected type when defining data type Problem title: Couldn't match expected type when defining data type Tags: haskell Problem: Couldn't match expected type when defining data type I'm trying to define my own data type containing Odds: data Odd = Odd Integer deriving (Eq, Show) instance...
Couldn't match expected type when defining data type Couldn't match expected type when defining data type haskell Couldn Odd Integer Show Enum hello.hs:92:18 Failed Couldn't match expected type when defining data type I'm trying to define my own data type containing Odds: When I try to compile that, I get: I ...
[ -0.01446533203125, 0.001983642578125, 0.00469970703125, 0.01611328125, -0.003448486328125, 0.01708984375, -0.0196533203125, 0.0130615234375, 0.004669189453125, -0.00579833984375, 0.001495361328125, -0.02392578125, 0.0137939453125, -0.0016326904296875, -0.0028533935546875, -0.0020599365...
[ 191147, 3768, 18, 14858, 84751, 10644, 13204, 2053, 1556, 142508, 19, 67948, 44401, 17367, 357, 316, 33600, 31, 12231, 24033, 190355, 31577, 61924, 10002, 70541, 9790, 9969, 1340, 2301, 28219, 15400, 41206, 98, 25737, 3535, 110527, 35839, 959...
[ 0.080322265625, 0.051055908203125, 0.07476806640625, 0.1937255859375, 0.1539306640625, 0.18603515625, 0.131103515625, 0.103271484375, 0.12646484375, 0.2095947265625, 0.0146026611328125, 0.2486572265625, 0.1868896484375, 0.09527587890625, 0.07879638671875, 0.1802978515625, 0.064819335...
embed
27015446_c0
27015446
haskell
0
Title: How to profile libraries? Problem title: How to profile libraries? Tags: cabal, haskell Problem: How to profile libraries? Is there any hidden option that will put cost centres in libraries? Currently I have set up my profiling like this: cabal: ghc-prof-options: -O2 -threaded -fexcess-precision -fprof-auto -rts...
How to profile libraries? How to profile libraries? cabal haskell How i0.1 How to profile libraries? Is there any hidden option that will put cost centres in libraries? Currently I have set up my profiling like this: cabal: exec: This works and creates the expected .prof file, .hp file and the summary when the program ...
[ -0.00946044921875, -0.00482177734375, -0.01202392578125, 0.0002422332763671875, -0.0284423828125, 0.0142822265625, 0.002685546875, -0.0005035400390625, -0.010498046875, -0.0458984375, -0.0096435546875, -0.017578125, 0.003387451171875, 0.0140380859375, 0.006927490234375, -0.006927490234...
[ 11249, 47, 60641, 35773, 10484, 32, 109524, 1556, 142508, 17, 102014, 204105, 35829, 1221, 3884, 11034, 70880, 23, 114063, 5423, 1257, 9468, 214, 1884, 903, 12, 1119, 3240, 43240, 28282, 84751, 3454, 420, 11435, 127, 254, 177074, 3229, 1528...
[ 0.0908203125, 0.111083984375, 0.298095703125, 0.224365234375, 0.150390625, 0.007171630859375, 0.2249755859375, 0.1109619140625, 0.1951904296875, 0.025726318359375, 0.1368408203125, 0.135498046875, 0.1396484375, 0.011749267578125, 0.0628662109375, 0.189453125, 0.2027587890625, 0.057...
embed
21653178_c1
21653178
haskell
1
2 case val1 of FunVal env' n body -> local (const $ Map.insert n val2 env') $ eval5 body _ -> throwError "type error in App" fails to compile with the message: No instance for (MonadWriter [Name] Identity) arising from a use of `tell' Possible fix: add an instance declaration for (MonadWriter [Name] Identity) In a stmt...
2 case val1 of FunVal env' n body -> local (const $ Map.insert n val2 env') $ eval5 body _ -> throwError "type error in App" fails to compile with the message: No instance for (MonadWriter [Name] Identity) arising from a use of `tell' Possible fix: add an instance declaration for (MonadWriter [Name] Identity) In a stmt...
[ -0.0218505859375, 0.00830078125, 0.005218505859375, -0.00921630859375, -0.00579833984375, 0.01055908203125, -0.0159912109375, -0.00909423828125, 0.00555419921875, -0.0225830078125, 0.00186920166015625, 0.025634765625, 0.01953125, -0.0162353515625, 0.0250244140625, 0.0018157958984375, ...
[ 116, 7225, 3502, 418, 28670, 42272, 22, 334, 14361, 4000, 42719, 33657, 28, 1405, 758, 104250, 18468, 31611, 50986, 18499, 23, 5659, 35782, 9969, 1340, 26008, 438, 110527, 100, 46674, 712, 1456, 2783, 56, 163612, 71257, 2481, 187, 72219, ...
[ 0.0175018310546875, 0.08056640625, 0.1702880859375, 0.026336669921875, 0.184814453125, 0.259521484375, 0.0728759765625, 0.161865234375, 0.1343994140625, 0.09771728515625, 0.1309814453125, 0.073974609375, 0.040985107421875, 0.2078857421875, 0.14697265625, 0.1885986328125, 0.1385498046...
embed
63257898_c1
63257898
haskell
1
:: [a] -> [a] -> [a] vAppend :: Vec a n -> Vec a m -> Vec a (Plus n m) vAppend Nil xs = xs vAppend (Cons y ys) xs = Cons y (vAppend ys xs) -- Type-level addition type family Plus (x :: Nat) (y :: Nat) :: Nat where Plus Z n = n Plus (S m) n = S (Plus m n) -- concat :: [[a]] -> [a] vConcat :: Vec (Vec a n) m -> Vec a (T...
:: [a] -> [a] -> [a] vAppend :: Vec a n -> Vec a m -> Vec a (Plus n m) vAppend Nil xs = xs vAppend (Cons y ys) xs = Cons y (vAppend ys xs) -- Type-level addition type family Plus (x :: Nat) (y :: Nat) :: Nat where Plus Z n = n Plus (S m) n = S (Plus m n) -- concat :: [[a]] -> [a] vConcat :: Vec (Vec a n) m -> Vec a (T...
[ -0.005096435546875, 0.0341796875, -0.00823974609375, 0.004302978515625, 0.021240234375, -0.0137939453125, -0.017333984375, -0.01177978515625, -0.00144195556640625, -0.0150146484375, 0.0004405975341796875, -0.0213623046875, -0.0167236328125, -0.000598907470703125, -0.024658203125, 0.003...
[ 1984, 11, 33079, 81, 39179, 3611, 52884, 10, 653, 347, 88225, 77175, 1022, 7, 2203, 11935, 113, 39215, 334, 4210, 60457, 67919, 66044, 10644, 14449, 8183, 425, 68875, 53, 7440, 567, 294, 159, 158, 4460, 856, 3240, 70059, 127664, 1363, 1...
[ 0.1533203125, 0.09454345703125, 0.076171875, 0.1646728515625, 0.153076171875, 0.1976318359375, 0.266357421875, 0.1474609375, 0.1278076171875, 0.146484375, 0.207275390625, 0.25146484375, 0.114013671875, 0.1370849609375, 0.007476806640625, 0.168701171875, 0.11083984375, 0.20568847656...
embed
11981253_c0
11981253
haskell
0
Title: Using X Pixmaps with OpenGL and Haskell Problem title: Using X Pixmaps with OpenGL and Haskell Tags: haskell, opengl Problem: Using X Pixmaps with OpenGL and Haskell I am a little bit confused on how to combine using the X11 library to generate a texture for OpenGL ( I am grabbing the pixmap area using https://g...
Using X Pixmaps with OpenGL and Haskell Using X Pixmaps with OpenGL and Haskell haskell opengl Using Pixmaps OpenGL Haskell Using X Pixmaps with OpenGL and Haskell I am a little bit confused on how to combine using the X11 library to generate a texture for OpenGL ( I am grabbing the pixmap area using https://github.com...
[ -0.005401611328125, 0.0252685546875, 0.004119873046875, -0.0084228515625, 0.00445556640625, 0.0174560546875, -0.003204345703125, -0.02783203125, 0.0011749267578125, -0.040283203125, 0.023193359375, -0.03271484375, 0.0234375, -0.00970458984375, -0.00946044921875, -0.01507568359375, -0...
[ 345, 1193, 159939, 62346, 7, 678, 13527, 78703, 136, 20625, 142508, 1556, 9803, 11016, 10176, 55681, 70163, 17368, 1662, 35773, 1294, 139392, 168286, 100, 59102, 66535, 16128, 32102, 1283, 587, 38931, 10557, 425, 77087, 62163, 166179, 30646, ...
[ 0.05755615234375, 0.18603515625, 0.1536865234375, 0.2384033203125, 0.03094482421875, 0.06304931640625, 0.1243896484375, 0.2191162109375, 0.04486083984375, 0.107177734375, 0.2178955078125, 0.0888671875, 0.088134765625, 0.1715087890625, 0.001800537109375, 0.0460205078125, 0.15173339843...
embed
25142575_c0
25142575
haskell
0
Title: pipes for each evaluates before sending downstream? Problem title: pipes for each evaluates before sending downstream? Tags: haskell-pipes, haskell Problem: pipes for each evaluates before sending downstream? going through the pipes tutorial led to toying with some examples: import Pipes import qualified Pipes.P...
pipes for each evaluates before sending downstream? pipes for each evaluates before sending downstream? haskell-pipes haskell Pipes qualified Pipes.Prelude Show P.take P.stdoutLn P.map pipes for each evaluates before sending downstream? going through the pipes tutorial led to toying with some examples: but the above pr...
[ 0.019775390625, 0.0067138671875, -0.0115966796875, 0.0257568359375, -0.034912109375, 0.0228271484375, 0.0223388671875, -0.01513671875, 0.006439208984375, 0.0089111328125, -0.00665283203125, 0.005218505859375, 0.050537109375, 0.025146484375, -0.00408935546875, 0.0024261474609375, 0.00...
[ 137158, 7, 100, 12638, 151575, 90, 8108, 135834, 7565, 86429, 1556, 142508, 1434, 13569, 93128, 217225, 19273, 822, 112, 17367, 78219, 436, 62346, 57143, 47, 27781, 36917, 27489, 2304, 1294, 41206, 1238, 418, 136, 304, 5701, 16750, 10461, 9...
[ 0.211181640625, 0.092041015625, 0.1248779296875, 0.173095703125, 0.2177734375, 0.083984375, 0.1219482421875, 0.07958984375, 0.1297607421875, 0.1627197265625, 0.1256103515625, 0.2115478515625, 0.1416015625, 0.07318115234375, 0.1514892578125, 0.2030029296875, 0.04833984375, 0.1330566...
embed
52314364_c0
52314364
haskell
0
Title: Pattern matching a List of Strings with a String using isInfixOf Problem title: Pattern matching a List of Strings with a String using isInfixOf Tags: haskell Problem: Pattern matching a List of Strings with a String using isInfixOf Hello i am a beginner in haskell and i have a problem with comparing/matching St...
Pattern matching a List of Strings with a String using isInfixOf Pattern matching a List of Strings with a String using isInfixOf haskell isInfixOf Data.List Pattern List Strings g:h:j:k Pattern matching a List of Strings with a String using isInfixOf Hello i am a beginner in haskell and i have a problem with comparing...
[ 0.006072998046875, 0.00139617919921875, -0.0177001953125, 0.015869140625, -0.01458740234375, 0.002899169921875, 0.00074005126953125, 0.0205078125, 0.0235595703125, 0.017333984375, 0.01300048828125, -0.0272216796875, 0.025634765625, -0.011962890625, -0.00732421875, 0.00714111328125, 0...
[ 9876, 22766, 14858, 214, 32036, 23351, 5180, 678, 17368, 83, 4153, 55923, 132887, 1556, 142508, 11809, 154663, 706, 127, 12, 170, 92, 35378, 9842, 1679, 2967, 37397, 98753, 1295, 5423, 34475, 237, 1720, 29089, 69307, 3444, 28670, 10763, 691...
[ 0.1729736328125, 0.1116943359375, 0.22119140625, 0.06842041015625, 0.137451171875, 0.175537109375, 0.109619140625, 0.080322265625, 0.007720947265625, 0.14599609375, 0.10736083984375, 0.1954345703125, 0.2486572265625, 0.1014404296875, 0.181640625, 0.05670166015625, 0.1136474609375, ...
embed
7989697_c0
7989697
haskell
0
Title: Another haskell type dilemma Problem title: Another haskell type dilemma Tags: haskell Problem: Another haskell type dilemma Hey everyone i am trying to write this code and I am having problems with the data types data Collection = Set [Int] deriving (Show) remove :: Int -> Collection -> Collection remove _ (Set...
Another haskell type dilemma Another haskell type dilemma haskell Another Collection Set Show x:xs Couldn Failed Another haskell type dilemma Hey everyone i am trying to write this code and I am having problems with the data types I am getting this error, its a problem with the types: Any help is appreciated Thanks
[ -0.006805419921875, 0.03662109375, 0.006622314453125, 0.0059814453125, -0.0284423828125, -0.004058837890625, -0.018310546875, -0.002349853515625, 0.00592041015625, -0.01397705078125, -0.0030364990234375, 0.00616455078125, 0.018310546875, -0.0081787109375, -0.00701904296875, 0.001998901...
[ 116267, 1556, 142508, 10644, 204081, 68220, 19943, 17367, 1022, 425, 191147, 19, 190355, 297, 30309, 31577, 33022, 903, 18151, 19441, 44402, 2053, 52895, 20949, 18499, 6863, 2967, 4358 ]
[ 0.1585693359375, 0.10882568359375, 0.1866455078125, 0.1812744140625, 0.2291259765625, 0.18212890625, 0.1326904296875, 0.138916015625, 0.049774169921875, 0.0772705078125, 0.143310546875, 0.07733154296875, 0.1876220703125, 0.003574371337890625, 0.04254150390625, 0.053924560546875, 0.02...
embed
5570460_c0
5570460
haskell
0
Title: Haskell FFI for pdflib Problem title: Haskell FFI for pdflib Tags: haskell, ffi Problem: Haskell FFI for pdflib I am trying to write ffi for pdflib library ( pdflib.com ) using c2hs on 64 linux. You can download pdflib from their website for free (fully functional eval.) I tried to compile and run their hello.c ...
Haskell FFI for pdflib Haskell FFI for pdflib haskell ffi Haskell FFI Haskell FFI for pdflib I am trying to write ffi for pdflib library ( pdflib.com ) using c2hs on 64 linux. You can download pdflib from their website for free (fully functional eval.) I tried to compile and run their hello.c demo program and it works ...
[ 0.01287841796875, -0.0001354217529296875, -0.0045166015625, 0.015625, -0.00653076171875, 0.020751953125, 0.003692626953125, -0.00860595703125, -0.00872802734375, -0.020751953125, -0.00738525390625, -0.032958984375, 0.0164794921875, 0.01953125, 0.00177764892578125, -0.0223388671875, -...
[ 20625, 142508, 563, 22724, 100, 26198, 5612, 1556, 24500, 31577, 33022, 35773, 277, 501, 304, 127, 7, 7911, 11508, 6077, 7026, 4165, 4092, 123309, 1405, 37842, 9969, 1340, 11675, 33600, 31, 5, 238, 53397, 1528, 43240, 5885, 3871, 4734, 11...
[ 0.1781005859375, 0.243896484375, 0.1259765625, 0.239013671875, 0.09466552734375, 0.1756591796875, 0.234619140625, 0.1541748046875, 0.205810546875, 0.049713134765625, 0.100830078125, 0.179931640625, 0.042510986328125, 0.022369384765625, 0.1187744140625, 0.1348876953125, 0.070007324218...
embed
13896649_c1
13896649
haskell
1
of Hierarchy for which we only need to implement ordering without requiring of building new node. In this particular case ( FilePath ) having two non-overlapping functionality isn't feasible and even may result in extra-work (splitting directories twice for hierarchyCompare and hierarchyJoint ). That's why it was deci...
of Hierarchy for which we only need to implement ordering without requiring of building new node. In this particular case ( FilePath ) having two non-overlapping functionality isn't feasible and even may result in extra-work (splitting directories twice for hierarchyCompare and hierarchyJoint ). That's why it was deci...
[ -0.006561279296875, 0.0030059814453125, 0.00003910064697265625, -0.0093994140625, -0.002349853515625, 0.01007080078125, 0.006927490234375, -0.021484375, -0.00022125244140625, 0.006561279296875, 0.0022735595703125, -0.0142822265625, -0.00098419189453125, 0.008544921875, -0.005096435546875...
[ 111, 5389, 147, 7668, 4734, 3871, 29479, 12989, 214, 15490, 33976, 110, 42724, 683, 10519, 6626, 351, 5465, 143, 26783, 123309, 18, 3820, 55356, 1543, 4173, 18244, 26026, 14364, 186351, 1791, 108161, 1046, 16604, 4288, 29256, 10422, 4163, 9...
[ 0.08514404296875, 0.1702880859375, 0.159423828125, 0.1630859375, 0.024139404296875, 0.0193634033203125, 0.139404296875, 0.1722412109375, 0.07086181640625, 0.0169830322265625, 0.035980224609375, 0.06756591796875, 0.1578369140625, 0.11376953125, 0.1602783203125, 0.08001708984375, 0.048...
embed
38420499_c0
38420499
haskell
0
Title: Type instance and phantom type Problem title: Type instance and phantom type Tags: haskell, ghc, phantom-types, servant, type-synonyms Problem: Type instance and phantom type I ran into a strange error, I cannot find a way to fix it. I’m using servant and I am trying to build a generic authentication library (no...
Type instance and phantom type Type instance and phantom type haskell ghc phantom-types servant type-synonyms Type TokenProtect AuthProtect AuthServerData Family LHS Type instance and phantom type I ran into a strange error, I cannot find a way to fix it. I’m using servant and I am trying to build a generic authenticat...
[ 0.0057373046875, 0.0032958984375, -0.00909423828125, 0.008056640625, -0.015869140625, 0.01409912109375, 0.00799560546875, 0.0191650390625, 0.0005340576171875, -0.0223388671875, -0.0113525390625, 0.00201416015625, 0.00139617919921875, 0.005035400390625, 0.009033203125, 0.0201416015625, ...
[ 60457, 110527, 136, 68743, 5928, 10644, 1556, 142508, 31380, 238, 50986, 187646, 45757, 717, 1098, 127942, 5655, 193348, 137989, 59745, 339, 38131, 13028, 114453, 18499, 53418, 30022, 31577, 45367, 10, 189534, 195734, 35773, 157, 4420, 3611, 11...
[ 0.22705078125, 0.22705078125, 0.087646484375, 0.1351318359375, 0.1689453125, 0.2509765625, 0.063720703125, 0.1807861328125, 0.035308837890625, 0.02337646484375, 0.2042236328125, 0.259521484375, 0.06494140625, 0.0192108154296875, 0.06243896484375, 0.166015625, 0.05877685546875, 0.09...
embed
79220374_c0
79220374
haskell
0
Title: haskell package installation problem using GHCup "addDLL: mingw32 or dependencies not loaded. (Win32 error 126)" error message Problem title: haskell package installation problem using GHCup "addDLL: mingw32 or dependencies not loaded. (Win32 error 126)" error message Tags: haskell Problem: h...
haskell package installation problem using GHCup "addDLL: mingw32 or dependencies not loaded. (Win32 error 126)" error message haskell package installation problem using GHCup "addDLL: mingw32 or dependencies not loaded. (Win32 error 126)" error message haskell GHCup mingw32 Win32 haskell package in...
[ 0.0126953125, 0.013427734375, 0.01373291015625, 0.01519775390625, -0.0135498046875, 0.016357421875, -0.00555419921875, -0.0164794921875, -0.0169677734375, 0.003265380859375, -0.002105712890625, -0.0189208984375, -0.00689697265625, 0.0031890869140625, -0.0027618408203125, 0.017211914062...
[ 1556, 142508, 98169, 59720, 2967, 17368, 527, 73265, 2037, 4028, 397, 23708, 46996, 434, 6460, 42548, 117538, 959, 72367, 92049, 18499, 49988, 26008, 707, 24372, 20600, 26531, 214, 20625, 9803, 3773, 17170, 79544, 9790, 11675, 903, 212059, 48...
[ 0.1744384765625, 0.293701171875, 0.167236328125, 0.1566162109375, 0.098388671875, 0.03192138671875, 0.10662841796875, 0.0843505859375, 0.21142578125, 0.106689453125, 0.03338623046875, 0.205810546875, 0.1348876953125, 0.1365966796875, 0.229736328125, 0.1920166015625, 0.096435546875, ...
embed
56891178_c0
56891178
haskell
0
Title: Couldn't install ghcup installer for Haskell on my MacOS machine Problem title: Couldn't install ghcup installer for Haskell on my MacOS machine Tags: haskell Problem: Couldn't install ghcup installer for Haskell on my MacOS machine Currently, I'm trying to learn pure functional programming language, w...
Couldn't install ghcup installer for Haskell on my MacOS machine Couldn't install ghcup installer for Haskell on my MacOS machine haskell Couldn Haskell MacOS get-ghcup.haskell.org Following Couldn't install ghcup installer for Haskell on my MacOS machine Currently, I'm trying to learn pure functional program...
[ -0.0004673004150390625, 0.026123046875, 0.0235595703125, 0.01495361328125, -0.004791259765625, 0.0029754638671875, 0.005096435546875, -0.0091552734375, 0.0030059814453125, 0.02294921875, -0.00469970703125, -0.030029296875, 0.0164794921875, -0.007080078125, -0.016357421875, 0.0086669921...
[ 191147, 3768, 18, 20600, 31380, 33874, 74022, 20625, 142508, 4727, 7285, 36279, 1556, 2046, 9486, 10557, 1478, 77168, 100, 98, 31577, 30698, 34166, 123309, 56037, 46876, 9969, 34759, 134629, 167934, 25632, 75101, 9709, 141, 3794, 420, 7547, 6...
[ 0.0980224609375, 0.07958984375, 0.085693359375, 0.191162109375, 0.162841796875, 0.252685546875, 0.2197265625, 0.1385498046875, 0.2449951171875, 0.1075439453125, 0.1402587890625, 0.09332275390625, 0.1087646484375, 0.05047607421875, 0.1385498046875, 0.1005859375, 0.096923828125, 0.09...
embed
59870167_c0
59870167
haskell
0
Title: Haskell - Will lazy evaluation cause this foldr to stop evaulating all functions Problem title: Haskell - Will lazy evaluation cause this foldr to stop evaulating all functions Tags: haskell Problem: Haskell - Will lazy evaluation cause this foldr to stop evaulating all functions func1, func2.. are all defined :...
Haskell - Will lazy evaluation cause this foldr to stop evaulating all functions Haskell - Will lazy evaluation cause this foldr to stop evaulating all functions haskell Haskell Will func1 func2 func3 func4 Haskell - Will lazy evaluation cause this foldr to stop evaulating all functions func1, func2.. are all defined :...
[ -0.0135498046875, 0.00634765625, 0.009521484375, -0.00836181640625, -0.0203857421875, 0.01361083984375, 0.006500244140625, 0.003173828125, 0.0011749267578125, -0.0255126953125, -0.013916015625, -0.003997802734375, -0.0031585693359375, 0.021240234375, 0.01025390625, 0.007781982421875, ...
[ 20625, 142508, 20255, 21, 3285, 219836, 22304, 903, 18344, 7569, 7279, 70890, 202, 756, 32354, 26518, 1556, 7477, 418, 304, 363, 617, 238, 5442, 61924, 71713, 2460, 929, 1221, 25632, 42822, 151575, 214, 33662, 5117, 29568, 83, 5962, 1238, ...
[ 0.136962890625, 0.2467041015625, 0.049652099609375, 0.126708984375, 0.167236328125, 0.2042236328125, 0.1046142578125, 0.0711669921875, 0.0997314453125, 0.119873046875, 0.1885986328125, 0.1239013671875, 0.046051025390625, 0.0875244140625, 0.1829833984375, 0.0067138671875, 0.1275634765...
embed
41959171_c0
41959171
haskell
0
Title: Compile error with type families, GADTs and named records Problem title: Compile error with type families, GADTs and named records Tags: type-families, haskell, gadt Problem: Compile error with type families, GADTs and named records In the following code, T1 and T2 compile fine, but T3 fails: {-# LANGUAGE GADTs ...
Compile error with type families, GADTs and named records Compile error with type families, GADTs and named records type-families haskell gadt Compile GADTs LANGUAGE TypeFamilies Show Compile error with type families, GADTs and named records In the following code, T1 and T2 compile fine, but T3 fails: I'm trying to und...
[ 0.0036773681640625, -0.00445556640625, -0.006072998046875, 0.00262451171875, 0.0040283203125, -0.011474609375, -0.034912109375, -0.0166015625, -0.00665283203125, 0.000396728515625, -0.00347900390625, -0.01953125, 0.01470947265625, 0.00701904296875, 0.01251220703125, 0.004852294921875, ...
[ 15612, 1340, 18499, 678, 10644, 87143, 23749, 41072, 24, 4806, 115923, 69128, 1556, 142508, 914, 13384, 98064, 60457, 1191, 25632, 18151, 384, 418, 304, 9969, 5885, 363, 35782, 28219, 15400, 17164, 5361, 64549, 748, 6002, 86531, 125663, 27781...
[ 0.145751953125, 0.1446533203125, 0.154541015625, 0.05413818359375, 0.1795654296875, 0.144287109375, 0.09722900390625, 0.1326904296875, 0.07855224609375, 0.1075439453125, 0.145751953125, 0.0872802734375, 0.0721435546875, 0.19140625, 0.0546875, 0.1351318359375, 0.06256103515625, 0.13...
embed
1092783_c1
1092783
haskell
1
(filter isSearchable) $ findFiles path wordsPerFile <- forM files $ fmap (wordsWithSuffix suffix) . readFile -- by ephemient -- was: wordsPerFile <- forM files (\x -> liftM (wordsWithSuffix suffix) (readFile x)) return . sort . nub $ concat wordsPerFile -- by ephemient -- was: return $ (sort . nub . concat) wordsPerFi...
(filter isSearchable) $ findFiles path wordsPerFile <- forM files $ fmap (wordsWithSuffix suffix) . readFile -- by ephemient -- was: wordsPerFile <- forM files (\x -> liftM (wordsWithSuffix suffix) (readFile x)) return . sort . nub $ concat wordsPerFile -- by ephemient -- was: return $ (sort . nub . concat) wordsPerFi...
[ 0.00168609619140625, -0.0023651123046875, -0.00799560546875, -0.0147705078125, -0.0017852783203125, 0.00909423828125, 0.01129150390625, -0.0101318359375, 0.0205078125, -0.04638671875, -0.00537109375, 0.0118408203125, 0.003509521484375, -0.01031494140625, -0.01123046875, 0.0143432617187...
[ 120337, 83, 221175, 2886, 3650, 7413, 174350, 7, 60875, 34153, 15277, 100, 594, 102158, 1238, 62346, 47416, 194583, 21493, 4084, 133784, 425, 12301, 20133, 12828, 18, 509, 60520, 39116, 1022, 30646, 12096, 315, 275, 158, 4460, 62351, 5201, ...
[ 0.26171875, 0.1578369140625, 0.1884765625, 0.2388916015625, 0.080078125, 0.1705322265625, 0.251708984375, 0.0028076171875, 0.2081298828125, 0.2169189453125, 0.21826171875, 0.10009765625, 0.1031494140625, 0.1571044921875, 0.05218505859375, 0.1986083984375, 0.1260986328125, 0.1177978...
embed
12017946_c0
12017946
haskell
0
Title: Tools to indent badly indented code Problem title: Tools to indent badly indented code Tags: haskell, indentation Problem: Tools to indent badly indented code Consider the following piece of operational Haskell code : Code A describeList :: [a] -> String describeList xs = "The list is " ++ what xs where what [] ...
Tools to indent badly indented code Tools to indent badly indented code haskell indentation Tools Tools to indent badly indented code Consider the following piece of operational Haskell code : Code A which is a snippet taken from Syntax in Functions . Now suppose that we start off with the following piece of badly inde...
[ 0.00726318359375, -0.0111083984375, 0.00001895427703857422, 0.0089111328125, 0.005767822265625, 0.0206298828125, -0.0198974609375, -0.000926971435546875, 0.0098876953125, -0.0301513671875, 0.00787353515625, -0.003631591796875, -0.015869140625, 0.00970458984375, 0.0002918243408203125, -...
[ 119296, 47, 18597, 18, 6494, 538, 3674, 18151, 1556, 142508, 22062, 137399, 63847, 41018, 20625, 28864, 62, 93, 58134, 39958, 19010, 86531, 28670, 10763, 139124, 4034, 5773, 25632, 351, 21473, 43315, 335, 2499, 55516, 831, 5646, 114211, 26785...
[ 0.2335205078125, 0.04327392578125, 0.170166015625, 0.1123046875, 0.138671875, 0.14404296875, 0.11181640625, 0.2108154296875, 0.111083984375, 0.1890869140625, 0.03399658203125, 0.0140838623046875, 0.0283966064453125, 0.135498046875, 0.09625244140625, 0.14208984375, 0.06964111328125, ...
embed
12658443_c0
12658443
haskell
0
Title: How to decorate a Tree in Haskell Problem title: How to decorate a Tree in Haskell Tags: tree, haskell Problem: How to decorate a Tree in Haskell I want to tag each element of a tree with a different value (Int, for example sake). I managed to do this but the code is ugly as a beast and I don't know how to work ...
How to decorate a Tree in Haskell How to decorate a Tree in Haskell tree haskell Data.List How Tree Haskell How to decorate a Tree in Haskell I want to tag each element of a tree with a different value (Int, for example sake). I managed to do this but the code is ugly as a beast and I don't know how to work with Monads...
[ -0.0142822265625, 0.0113525390625, -0.0032806396484375, -0.005584716796875, 0.016357421875, 0.0150146484375, -0.033935546875, -0.0059814453125, -0.00213623046875, -0.048583984375, 0.000789642333984375, -0.01446533203125, 0.0093994140625, 0.027587890625, 0.01239013671875, 0.000050067901...
[ 11249, 122329, 13, 101344, 23, 20625, 142508, 47, 10, 53201, 1556, 11809, 154663, 3444, 7909, 12638, 12830, 678, 12921, 34292, 4153, 18, 27781, 72018, 145755, 18151, 83, 75, 110608, 4438, 4488, 60331, 6468, 5646, 11522, 36917, 18344, 20469, ...
[ 0.0849609375, 0.240478515625, 0.09844970703125, 0.266845703125, 0.0767822265625, 0.1416015625, 0.25341796875, 0.032562255859375, 0.049163818359375, 0.21923828125, 0.1326904296875, 0.08868408203125, 0.118896484375, 0.064208984375, 0.1903076171875, 0.08282470703125, 0.1324462890625, ...
embed
15192964_c0
15192964
haskell
0
Title: Haskell: &#x27;makeNtuple&#x27; function? Problem title: Haskell: &#x27;makeNtuple&#x27; function? Tags: tuples, haskell Problem: Haskell: 'makeNtuple' function? Is there a function or functions in Haskell that takes n arguments, and returns an n-tuple? For example: make3tuple:: a -> a -> a -> (a,a,a) make3tuple...
Haskell: &#x27;makeNtuple&#x27; function? Haskell: &#x27;makeNtuple&#x27; function? tuples haskell Haskell make3tuple RandomState State StdGen liftM2 get3Randoms liftM3 Haskell: 'makeNtuple' function? Is there a function or functions in Haskell that takes n arguments, and returns an n-tuple? For example: ie: like comma...
[ 0.003448486328125, 0.00616455078125, 0.0115966796875, -0.01141357421875, 0.0125732421875, 0.0228271484375, -0.00494384765625, -0.0228271484375, 0.0235595703125, -0.0277099609375, -0.01434326171875, -0.0240478515625, 0.01019287109375, 0.0037384033203125, -0.01434326171875, -0.0029296875...
[ 20625, 142508, 3768, 55898, 458, 8705, 32354, 370, 99726, 1556, 3249, 363, 39643, 306, 135206, 22836, 2907, 105376, 60520, 594, 304, 2046, 126525, 3815, 839, 2685, 707, 23, 51776, 653, 10750, 136, 30646, 27781, 17, 13, 1884, 96117, 1284, ...
[ 0.1422119140625, 0.248291015625, 0.090087890625, 0.1685791015625, 0.188232421875, 0.260986328125, 0.1959228515625, 0.1549072265625, 0.201171875, 0.1121826171875, 0.1346435546875, 0.155517578125, 0.124755859375, 0.036590576171875, 0.0538330078125, 0.0731201171875, 0.050384521484375, ...
embed
23875471_c1
23875471
haskell
1
)) a *= b = readSTRef b >>= \b -> modifySTRef a ((*) b) instance (Num a) => NumMod (STRef s a) a (ST s) where a += b = modifySTRef a ((+) (b)) a -= b = modifySTRef a ((+) (negate b)) a *= b = modifySTRef a ((*) (b)) That actually works, but only as long as factorial returns an Integer . As soon as I change the return t...
)) a *= b = readSTRef b >>= \b -> modifySTRef a ((*) b) instance (Num a) => NumMod (STRef s a) a (ST s) where a += b = modifySTRef a ((+) (b)) a -= b = modifySTRef a ((+) (negate b)) a *= b = modifySTRef a ((*) (b)) That actually works, but only as long as factorial returns an Integer . As soon as I change the return t...
[ -0.0169677734375, 0.006011962890625, 0.01171875, 0.007232666015625, 0.0196533203125, -0.01953125, -0.004058837890625, -0.02197265625, -0.0050048828125, -0.01287841796875, -0.01275634765625, -0.000293731689453125, -0.004852294921875, -0.00160980224609375, 0.008056640625, -0.010009765625...
[ 78960, 10, 661, 1369, 876, 2203, 12301, 94539, 4240, 6396, 41872, 275, 2811, 40383, 88746, 16, 110527, 316, 52782, 91616, 91, 8545, 997, 102817, 20, 15, 3331, 67, 9925, 20653, 43240, 4, 4734, 4989, 31461, 15403, 30646, 44401, 33662, 15549...
[ 0.09423828125, 0.111572265625, 0.0770263671875, 0.03057861328125, 0.1419677734375, 0.0197906494140625, 0.1820068359375, 0.09307861328125, 0.227783203125, 0.015838623046875, 0.019683837890625, 0.08349609375, 0.1676025390625, 0.140869140625, 0.020416259765625, 0.015625, 0.1942138671875...
embed
40948153_c0
40948153
haskell
0
Title: Find min element&#x27;s index of a large list in Haskell Problem title: Find min element&#x27;s index of a large list in Haskell Tags: haskell Problem: Find min element's index of a large list in Haskell i know some way to find the min or max element's index, but when i deal with a large list. ghc said:"stack ov...
Find min element&#x27;s index of a large list in Haskell Find min element&#x27;s index of a large list in Haskell haskell Find Haskell Prelude Data.List Exception x:xs Find min element's index of a large list in Haskell i know some way to find the min or max element's index, but when i deal with a large list. ghc said:...
[ -0.00634765625, 0.0244140625, 0.0181884765625, -0.00494384765625, -0.0146484375, 0.00494384765625, 0.021728515625, -0.01446533203125, 0.029296875, -0.0247802734375, 0.0140380859375, 0.0035400390625, 0.006591796875, -0.00037384033203125, 0.00872802734375, -0.009765625, 0.0220947265625...
[ 26040, 881, 12830, 3768, 63262, 21334, 5303, 20625, 142508, 111, 23, 1556, 1914, 822, 112, 11809, 154663, 63928, 1022, 425, 3714, 3917, 7413, 70, 707, 18389, 35142, 590, 2594, 645, 118664, 738, 47, 177261, 11522, 88, 195, 4153, 39659, 831...
[ 0.1180419921875, 0.28857421875, 0.2408447265625, 0.1190185546875, 0.2445068359375, 0.1690673828125, 0.1934814453125, 0.135986328125, 0.252685546875, 0.061370849609375, 0.054443359375, 0.1239013671875, 0.05859375, 0.177001953125, 0.13232421875, 0.016510009765625, 0.101806640625, 0.1...
embed
53436097_c0
53436097
haskell
0
Title: Haskell SQLite3 query all Problem title: Haskell SQLite3 query all Tags: sqlite, haskell Problem: Haskell SQLite3 query all Would like to determine the size of a table (length) to avoid a user entering an incremental ID that already exists (Note: left all Haskell books to get my feet wet). Got a table with id, t...
Haskell SQLite3 query all Haskell SQLite3 query all sqlite haskell Haskell SQLite3 date_in date_out taglist.db SELECT Only Haskell SQLite3 query all Would like to determine the size of a table (length) to avoid a user entering an incremental ID that already exists (Note: left all Haskell books to get my feet wet). Got ...
[ 0.00848388671875, 0.023681640625, 0.01483154296875, 0.0211181640625, 0.005279541015625, -0.009765625, 0.0033416748046875, -0.001983642578125, 0.0206298828125, -0.03173828125, 0.013427734375, -0.048095703125, 0.0040283203125, 0.002899169921875, -0.01416015625, 0.003875732421875, 0.010...
[ 20625, 142508, 80866, 1486, 363, 41, 1294, 756, 91, 95255, 67, 1556, 5622, 73, 6056, 7909, 6562, 48073, 6755, 144832, 87293, 1884, 83324, 13267, 111, 23180, 23986, 71864, 38937, 22, 145322, 11338, 21771, 32316, 25737, 42840, 74261, 36311, 1...
[ 0.1279296875, 0.1944580078125, 0.1221923828125, 0.2022705078125, 0.16796875, 0.1326904296875, 0.09161376953125, 0.1749267578125, 0.003875732421875, 0.153564453125, 0.116455078125, 0.075927734375, 0.1102294921875, 0.06884765625, 0.1390380859375, 0.09808349609375, 0.1383056640625, 0....
embed
48837238_c0
48837238
haskell
0
Title: Return the item at the specified position in list Problem title: Return the item at the specified position in list Tags: recursion, haskell Problem: Return the item at the specified position in list I'm trying to find out en element at a particular position in a list using recursive function. The function takes ...
Return the item at the specified position in list Return the item at the specified position in list recursion haskell Ord y:ys x-1 Main Exception Return the item at the specified position in list I'm trying to find out en element at a particular position in a list using recursive function. The function takes 2 paramete...
[ -0.01953125, 0.002838134765625, 0.002349853515625, -0.02685546875, 0.01104736328125, 0.0164794921875, 0.00107574462890625, -0.0135498046875, -0.007171630859375, -0.002655029296875, 0.039794921875, -0.032470703125, -0.0047607421875, -0.002349853515625, 0.00567626953125, 0.00418090820312...
[ 173340, 35735, 99, 70, 58735, 19069, 23, 5303, 297, 195625, 1830, 1556, 142508, 35379, 113, 4778, 1022, 5759, 12321, 5443, 63928, 31577, 7413, 1810, 22, 12830, 17311, 5844, 32354, 51776, 116, 171859, 18, 619, 50218, 7225, 201505, 62952, 351...
[ 0.2340087890625, 0.1939697265625, 0.1505126953125, 0.090087890625, 0.2215576171875, 0.220947265625, 0.08447265625, 0.18505859375, 0.09326171875, 0.19775390625, 0.0780029296875, 0.1309814453125, 0.215087890625, 0.134033203125, 0.050933837890625, 0.10693359375, 0.05950927734375, 0.11...
embed
56349611_c0
56349611
haskell
0
Title: Generically determining arity of data types Problem title: Generically determining arity of data types Tags: haskell Problem: Generically determining arity of data types I want to calculate the "arity" of a certain class of data types . Namely data-types with a single constructor and some number of fields. E.g. ...
Generically determining arity of data types Generically determining arity of data types haskell Generically Generic Rep Typeable Generically determining arity of data types I want to calculate the "arity" of a certain class of data types . Namely data-types with a single constructor and some number of fields. E.g. data...
[ 0.006011962890625, 0.01470947265625, -0.01483154296875, 0.00689697265625, -0.001861572265625, 0.0201416015625, 0.003265380859375, -0.0034942626953125, 0.0038909912109375, -0.027099609375, -0.033203125, -0.05517578125, 0.0034942626953125, 0.029052734375, 0.0054931640625, -0.011169433593...
[ 88342, 71407, 72694, 187, 2481, 2053, 52895, 1556, 142508, 33742, 60457, 2886, 3444, 74481, 67, 147, 24233, 18507, 50986, 11001, 64549, 748, 14012, 44457, 384, 10, 2203, 360, 18, 23351, 214, 1221, 201, 191195, 32354, 138256, 1884, 100, 9530...
[ 0.1883544921875, 0.06695556640625, 0.1888427734375, 0.1800537109375, 0.230224609375, 0.1376953125, 0.2236328125, 0.1416015625, 0.214111328125, 0.18310546875, 0.234375, 0.188232421875, 0.0548095703125, 0.17333984375, 0.045867919921875, 0.1773681640625, 0.01068115234375, 0.1107177734...
embed
27315208_c0
27315208
haskell
0
Title: How to show Title from text file on Browsers Tab instead of on page Haskell, HTML Problem title: How to show Title from text file on Browsers Tab instead of on page Haskell, HTML Tags: haskell, formatting, html Problem: How to show Title from text file on Browsers Tab instead of on page Haskell, HTML I have the ...
How to show Title from text file on Browsers Tab instead of on page Haskell, HTML How to show Title from text file on Browsers Tab instead of on page Haskell, HTML haskell formatting html text How Title Browsers Tab Haskell HTML DOCTYPE Goes Here How to show Title from text file on Browsers Tab instead of on page Haske...
[ 0.0235595703125, 0.004638671875, 0.00787353515625, 0.00194549560546875, 0.00506591796875, 0.01336669921875, -0.00173187255859375, 0.01300048828125, -0.0074462890625, -0.02099609375, -0.013427734375, -0.0194091796875, -0.0186767578125, -0.01220703125, 0.0177001953125, -0.00164794921875,...
[ 11249, 7639, 48962, 1295, 7986, 11435, 86976, 22193, 64457, 98, 9191, 20625, 142508, 19097, 7, 1556, 9384, 7693, 120959, 27143, 2016, 90, 11853, 5570, 59121, 1528, 51776, 107730, 124326, 140992, 73197, 3871, 5646, 5117, 13315, 44759, 7909, 16...
[ 0.05023193359375, 0.1695556640625, 0.27392578125, 0.109130859375, 0.15380859375, 0.174072265625, 0.21484375, 0.2139892578125, 0.1165771484375, 0.06683349609375, 0.12353515625, 0.095947265625, 0.2142333984375, 0.2218017578125, 0.038909912109375, 0.0855712890625, 0.123779296875, 0.14...
embed
75213700_c0
75213700
haskell
0
Title: Why in some cases some come works when pattern matching via case-of, but not via a let binding? Problem title: Why in some cases some come works when pattern matching via case-of, but not via a let binding? Tags: haskell, let, pattern-matching Problem: Why in some cases some come works when pattern matching via ...
Why in some cases some come works when pattern matching via case-of, but not via a let binding? Why in some cases some come works when pattern matching via case-of, but not via a let binding? haskell let pattern-matching singXs Why SingKind List Nil Cons SList Type SNil SCons Sing Demote SomeSing Couldn Expected Actual...
[ -0.0174560546875, 0.01287841796875, -0.00165557861328125, -0.0155029296875, -0.01019287109375, -0.0130615234375, -0.01544189453125, -0.00836181640625, 0.018798828125, 0.021484375, -0.002777099609375, 0.000873565673828125, 0.02001953125, -0.0025177001953125, 0.0018157958984375, -0.00204...
[ 44084, 3060, 50218, 1380, 43240, 103510, 14858, 214, 1829, 7225, 4390, 2633, 128239, 1284, 959, 1556, 142508, 98753, 5367, 1542, 53427, 605, 7250, 32036, 77175, 39215, 159, 154663, 60457, 379, 5245, 42506, 67, 31384, 294, 191147, 60075, 10058...
[ 0.06951904296875, 0.0469970703125, 0.056976318359375, 0.1483154296875, 0.10888671875, 0.2027587890625, 0.212646484375, 0.188232421875, 0.07086181640625, 0.142333984375, 0.2379150390625, 0.184326171875, 0.1943359375, 0.001617431640625, 0.0361328125, 0.0703125, 0.1900634765625, 0.201...
embed
43770613_c0
43770613
haskell
0
Title: How to work with data structures in Haskell Problem title: How to work with data structures in Haskell Tags: data-structures, haskell Problem: How to work with data structures in Haskell I'm trying to write a simple Terminal game in Haskell I have a function: moveDirection :: Direction -> Position -> Position wh...
How to work with data structures in Haskell How to work with data structures in Haskell data-structures haskell How Haskell Direction Position Player How to work with data structures in Haskell I'm trying to write a simple Terminal game in Haskell I have a function: which is supposed to move a player. A player looks li...
[ -0.00188446044921875, 0.018798828125, 0.0096435546875, 0.0152587890625, 0.00848388671875, 0.032470703125, 0.002410888671875, -0.00262451171875, 0.00457763671875, -0.047119140625, 0.014404296875, 0.03076171875, 0.006805419921875, 0.00604248046875, -0.01318359375, -0.01300048828125, 0....
[ 11249, 47, 4488, 678, 2053, 45646, 7, 23, 20625, 142508, 137656, 1556, 176774, 99428, 60560, 31577, 33022, 8781, 124090, 6712, 32354, 134598, 25813, 58585, 33342, 1884, 903, 3444, 59911, 184911, 1830, 5809, 72546, 32562, 60520, 10644, 21771, ...
[ 0.09014892578125, 0.06268310546875, 0.155517578125, 0.1756591796875, 0.142578125, 0.237060546875, 0.093994140625, 0.08447265625, 0.1634521484375, 0.26513671875, 0.2008056640625, 0.14794921875, 0.22216796875, 0.1876220703125, 0.2025146484375, 0.0258331298828125, 0.1070556640625, 0.0...
embed
33149324_c2
33149324
haskell
2
0m2.260s It took quite long (1m33.757s) given that each thread is supposed to only just wait for 10s but we've build it non-threaded so fair enough for now. All in all, we used 350 MB, that's not too bad, that's 3.5 KB per thread. Given that the initial stack size ( -ki is 1 KB ). Right, but now let's compile is in th...
0m2.260s It took quite long (1m33.757s) given that each thread is supposed to only just wait for 10s but we've build it non-threaded so fair enough for now. All in all, we used 350 MB, that's not too bad, that's 3.5 KB per thread. Given that the initial stack size ( -ki is 1 KB ). Right, but now let's compile is in th...
[ 0.01708984375, 0.002349853515625, 0.0016937255859375, -0.006103515625, 0.001251220703125, -0.0020294189453125, -0.005126953125, 0.0203857421875, 0.00860595703125, -0.07470703125, -0.00070953369140625, -0.00860595703125, 0.00156402587890625, -0.01361083984375, 0.01141357421875, 0.012939...
[ 757, 39, 70147, 4598, 7, 1650, 34739, 32233, 4989, 9185, 178785, 16, 34475, 12638, 86997, 134598, 4734, 1660, 40485, 100, 209, 45367, 442, 351, 39116, 297, 44075, 5036, 23, 756, 642, 11814, 14877, 12918, 6494, 38704, 30742, 117, 61475, 17...
[ 0.133544921875, 0.105224609375, 0.1209716796875, 0.2421875, 0.1268310546875, 0.0204620361328125, 0.1292724609375, 0.07537841796875, 0.1251220703125, 0.132568359375, 0.0994873046875, 0.030853271484375, 0.000091552734375, 0.0830078125, 0.2288818359375, 0.0877685546875, 0.05801391601562...
embed
7541438_c0
7541438
haskell
0
Title: Put two monadic values into a pair and return it Problem title: Put two monadic values into a pair and return it Tags: applicative, pointfree, parsec, haskell, monads Problem: Put two monadic values into a pair and return it I am playing with Parsec and I want to combine two parsers into one with the result put ...
Put two monadic values into a pair and return it Put two monadic values into a pair and return it applicative pointfree parsec haskell monads Put Monad Functor Put two monadic values into a pair and return it I am playing with Parsec and I want to combine two parsers into one with the result put in a pair, and then fee...
[ 0.006805419921875, 0.0272216796875, -0.0078125, 0.029052734375, 0.0002155303955078125, 0.031005859375, -0.01318359375, -0.032958984375, 0.00921630859375, -0.043701171875, 0.0247802734375, -0.01348876953125, 0.01275634765625, 0.0062255859375, -0.01287841796875, -0.0028839111328125, -0...
[ 19577, 6626, 2667, 11, 18403, 142424, 3934, 80836, 30646, 442, 10, 41816, 6275, 32087, 366, 39797, 1556, 142508, 712, 60331, 71, 28670, 18770, 75169, 2392, 3444, 70163, 7, 1314, 1632, 16750, 3884, 23, 61590, 15700, 32354, 160404, 70, 184, ...
[ 0.1214599609375, 0.1702880859375, 0.1458740234375, 0.1046142578125, 0.1649169921875, 0.1973876953125, 0.1461181640625, 0.228271484375, 0.2098388671875, 0.01055908203125, 0.0277252197265625, 0.123046875, 0.099365234375, 0.201171875, 0.138916015625, 0.208740234375, 0.0880126953125, 0...
embed
75561861_c2
75561861
haskell
2
(lat-lat')^2 + (lng-lng')^2 data City = City { name :: ByteString , location :: Point } deriving Show data Cluster = Cluster { Code signals: Data.ByteString, System.Random, System.Random.Stateful, Data.Attoparsec.ByteString, Data.Csv, Data.Vector, qualified, Data.Csv.Parser, Data.HashMap.Strict, Types, Data.Function, ...
(lat-lat')^2 + (lng-lng')^2 data City = City { name :: ByteString , location :: Point } deriving Show data Cluster = Cluster { Code signals: Data.ByteString, System.Random, System.Random.Stateful, Data.Attoparsec.ByteString, Data.Csv, Data.Vector, qualified, Data.Csv.Parser, Data.HashMap.Strict, Types, Data.Function, ...
[ -0.0169677734375, 0.00994873046875, -0.009521484375, 0.0029449462890625, 0.01904296875, -0.00738525390625, 0.00469970703125, -0.01202392578125, 0.003631591796875, -0.0026397705078125, -0.010009765625, -0.0057373046875, 0.00139617919921875, -0.0230712890625, -0.0400390625, 0.00233459472...
[ 15, 2335, 9, 25, 16, 8353, 304, 997, 141, 449, 2053, 6406, 2203, 9351, 1984, 3311, 67, 71713, 214, 31913, 41097, 51912, 16406, 6496, 17367, 140077, 1515, 10666, 28864, 26073, 11809, 5, 75358, 12353, 126525, 3815, 135206, 10628, 39797, 677...
[ 0.019683837890625, 0.1962890625, 0.067138671875, 0.1339111328125, 0.0195465087890625, 0.0931396484375, 0.172119140625, 0.2122802734375, 0.0213623046875, 0.1566162109375, 0.241943359375, 0.212158203125, 0.0999755859375, 0.10186767578125, 0.034271240234375, 0.071533203125, 0.0885009765...
embed
9833385_c0
9833385
haskell
0
Title: Translate Haskell Parsec grammar to Scala? Problem title: Translate Haskell Parsec grammar to Scala? Tags: haskell, parsing, scala Problem: Translate Haskell Parsec grammar to Scala? I'm trying to translate a grammar written in Haskell using Parsec into Scala's parser combinators. The translation of the actual m...
Translate Haskell Parsec grammar to Scala? Translate Haskell Parsec grammar to Scala? haskell parsing scala Translate Haskell Parsec Scala Translate Haskell Parsec grammar to Scala? I'm trying to translate a grammar written in Haskell using Parsec into Scala's parser combinators. The translation of the actual matching ...
[ -0.00909423828125, 0.01806640625, -0.0030670166015625, 0.00885009765625, -0.00555419921875, 0.00555419921875, -0.00946044921875, -0.02001953125, -0.010986328125, -0.0162353515625, 0.0035247802734375, -0.00830078125, -0.0098876953125, 0.00128173828125, -0.00482177734375, -0.000526428222...
[ 11062, 19309, 20625, 142508, 2392, 39797, 122092, 147, 47, 152653, 11, 1556, 366, 6953, 146232, 31577, 3900, 59121, 17368, 3934, 2189, 22321, 22230, 153648, 8561, 14858, 125195, 28875, 80560, 10176, 99156, 34735, 34831, 11341, 7844, 10922, 1093...
[ 0.115478515625, 0.1400146484375, 0.140625, 0.24560546875, 0.1622314453125, 0.258056640625, 0.1334228515625, 0.103271484375, 0.08642578125, 0.1949462890625, 0.146484375, 0.099853515625, 0.159423828125, 0.075439453125, 0.2044677734375, 0.0166778564453125, 0.1068115234375, 0.000244140...
embed
30284679_c0
30284679
haskell
0
Title: Shake: Signal whether anything had to be rebuilt at all Problem title: Shake: Signal whether anything had to be rebuilt at all Tags: haskell, shake-build-system Problem: Shake: Signal whether anything had to be rebuilt at all I use shake to build a bunch of static webpages, which I then have to upload to a remot...
Shake: Signal whether anything had to be rebuilt at all Shake: Signal whether anything had to be rebuilt at all haskell shake-build-system Shake Signal Shake: Signal whether anything had to be rebuilt at all I use shake to build a bunch of static webpages, which I then have to upload to a remote host, using sftp. Curre...
[ 0.00078582763671875, 0.036865234375, 0.01318359375, 0.022216796875, -0.016357421875, 0.0269775390625, -0.03515625, -0.000835418701171875, -0.0069580078125, 0.04736328125, -0.00909423828125, -0.01116943359375, -0.01531982421875, 0.0380859375, 0.006103515625, 0.01141357421875, 0.006500...
[ 68161, 13, 144000, 36766, 23937, 1902, 47, 456, 978, 24908, 99, 756, 1556, 142508, 174450, 177149, 16751, 12, 186, 4527, 45367, 147306, 201939, 1467, 22469, 70622, 148814, 27980, 2480, 254, 71138, 36791, 127877, 1884, 71864, 51042, 2704, 7510...
[ 0.222412109375, 0.173095703125, 0.240234375, 0.08154296875, 0.07159423828125, 0.0950927734375, 0.03887939453125, 0.114501953125, 0.1080322265625, 0.10009765625, 0.01220703125, 0.07269287109375, 0.0872802734375, 0.1630859375, 0.25830078125, 0.1707763671875, 0.08184814453125, 0.03402...
embed
64515485_c0
64515485
haskell
0
Title: Group elements of a list using Haskell Problem title: Group elements of a list using Haskell Tags: haskell Problem: Group elements of a list using Haskell I'm trying to group the elements of this list based on the value of the first item of each, but can't make it work. I'm trying to get [("A",[("EXP1",5),("EXP2...
Group elements of a list using Haskell Group elements of a list using Haskell haskell Haskell Data.Function Data.List Data.Ord Group Ord EXP1 EXP2 EXP15 EXP16 EXP24 Group elements of a list using Haskell I'm trying to group the elements of this list based on the value of the first item of each, but can't make it work. ...
[ 0.01116943359375, 0, -0.007598876953125, 0.006927490234375, -0.007293701171875, 0.0174560546875, -0.00897216796875, -0.0145263671875, 0.005401611328125, 0.0089111328125, -0.00058746337890625, 0.01220703125, 0.01129150390625, 0.015869140625, -0.0267333984375, -0.0086669921875, 0.00402...
[ 10760, 80854, 111, 5303, 17368, 20625, 142508, 1556, 11809, 97249, 154663, 143045, 35379, 104165, 418, 304, 1837, 2485, 2357, 31577, 21115, 35509, 34292, 5117, 35735, 12638, 831, 18, 4488, 2046, 284, 26939, 683, 43317, 77816, 571, 50490, 1395...
[ 0.2705078125, 0.2449951171875, 0.07293701171875, 0.224609375, 0.070068359375, 0.1512451171875, 0.245361328125, 0.1590576171875, 0.093994140625, 0.111572265625, 0.1785888671875, 0.17333984375, 0.1680908203125, 0.1597900390625, 0.055267333984375, 0.06396484375, 0.1485595703125, 0.094...
embed
28709336_c1
28709336
haskell
1
Just when the email exists and it has a key, it sends the verify email again to the user, whiche he/she can use as a password reset link. My questions are: Why does it work this way? This basically makes registering an already existing email address equal requesting password reset. I'm sure it has a good reason, and i...
Just when the email exists and it has a key, it sends the verify email again to the user, whiche he/she can use as a password reset link. My questions are: Why does it work this way? This basically makes registering an already existing email address equal requesting password reset. I'm sure it has a good reason, and i...
[ 0.02880859375, 0.003814697265625, 0.00469970703125, -0.0079345703125, 0.010009765625, 0.0101318359375, -0.002227783203125, 0.01263427734375, 0.0106201171875, -0.0166015625, -0.000843048095703125, 0.0159912109375, -0.020263671875, -0.0103759765625, 0.00445556640625, 0.00176239013671875,...
[ 9563, 3229, 3340, 32316, 1556, 22799, 442, 25379, 493, 40383, 13438, 38937, 4527, 78506, 168398, 3126, 17582, 44084, 14602, 4488, 903, 3917, 198343, 30482, 68067, 214, 21771, 144573, 29823, 105950, 50336, 4127, 31635, 17368, 5655, 927, 161994, ...
[ 0.1185302734375, 0.08306884765625, 0.181396484375, 0.2261962890625, 0.05438232421875, 0.17431640625, 0.0186309814453125, 0.043853759765625, 0.1588134765625, 0.1787109375, 0.10693359375, 0.0794677734375, 0.049041748046875, 0.2091064453125, 0.2015380859375, 0.130615234375, 0.0113830566...
embed
20093312_c0
20093312
haskell
0
Title: How to capitalize the first letter of a string and lowercase the rest in Haskell Problem title: How to capitalize the first letter of a string and lowercase the rest in Haskell Tags: string, haskell Problem: How to capitalize the first letter of a string and lowercase the rest in Haskell I have to write a functi...
How to capitalize the first letter of a string and lowercase the rest in Haskell How to capitalize the first letter of a string and lowercase the rest in Haskell string haskell How Haskell How to capitalize the first letter of a string and lowercase the rest in Haskell I have to write a function which uppercase the FIR...
[ 0.00616455078125, 0.007232666015625, -0.0040283203125, 0.01263427734375, 0.0106201171875, 0.016845703125, 0.01483154296875, -0.02685546875, 0.0162353515625, 0.0087890625, -0.01263427734375, -0.025146484375, 0.00714111328125, 0.030517578125, 0.005279541015625, -0.01129150390625, -0.00...
[ 11249, 47, 10323, 20650, 5117, 31330, 111, 79315, 136, 92319, 58437, 10588, 23, 20625, 142508, 1556, 765, 33022, 32354, 1407, 56, 133907, 8545, 2843, 143141, 101917, 70541, 96759, 408, 707, 120820, 145755, 179459, 26366, 4358, 9904, 2967, 387...
[ 0.096435546875, 0.0394287109375, 0.204345703125, 0.11669921875, 0.175537109375, 0.19580078125, 0.050506591796875, 0.2347412109375, 0.1080322265625, 0.218505859375, 0.185791015625, 0.15185546875, 0.049468994140625, 0.1533203125, 0.24462890625, 0.1334228515625, 0.0059814453125, 0.069...
embed
30630873_c0
30630873
haskell
0
Title: Map function to a BST in Haskell Problem title: Map function to a BST in Haskell Tags: haskell Problem: Map function to a BST in Haskell Suppose I have a datatype of BST as: data tree a = Empty | Node a (tree a) (tree a) deriving (Show, Read, Eq) I am doing a simple map function to apply each element of a BST. t...
Map function to a BST in Haskell Map function to a BST in Haskell haskell Map BST Haskell Empty Node Show Read Constructor Map function to a BST in Haskell Suppose I have a datatype of BST as: I am doing a simple map function to apply each element of a BST. However it gives me an error saying that: How do I solve this ...
[ 0.0081787109375, 0.01373291015625, 0.00958251953125, -0.01806640625, 0.01531982421875, 0.00787353515625, -0.00982666015625, -0.00087738037109375, -0.008056640625, -0.02099609375, 0.005615234375, -0.032470703125, 0.0155029296875, 0.0133056640625, 0.01324462890625, -0.01068115234375, -...
[ 42719, 32354, 47, 10, 335, 8545, 23, 20625, 142508, 1556, 31678, 939, 438, 112, 17367, 4764, 82084, 18770, 2053, 50986, 8781, 22288, 59911, 12638, 12830, 18499, 54433, 11249, 54, 87, 86869, 903, 208124, 53201 ]
[ 0.262939453125, 0.1929931640625, 0.161865234375, 0.07135009765625, 0.10888671875, 0.2327880859375, 0.04638671875, 0.161376953125, 0.25146484375, 0.147705078125, 0.1715087890625, 0.058349609375, 0.1351318359375, 0.1080322265625, 0.07452392578125, 0.1522216796875, 0.1591796875, 0.130...
embed
31125664_c1
31125664
haskell
1
25tK4x3nJhHHjFM.a-18744\libHSdata-default-instances-old-locale-0.0.1-6jcjjaR25tK4x3nJhHHjFM.a . That final path is 272 characters long, well over the 255 limit. It is possible to deal with longer paths on Windows, but it isn't trivial and in any case, ar doesn't seem to do whatever is necessary to handle them (not surp...
3nJhHHjFM.a-45644\libHSdata-default-instances-old-locale-0.0.1-6jcjjaR25tK4x3nJhHHjFM.a . This is relative to a working folder under the temp directory (which I have set to simply C:\Temp ), so the full path works out to be C:\Temp\data-default-instances-old-locale-0.0.1-18744\data-default-instances-old-locale-0.0.1\di...
[ 0.013427734375, 0.00180816650390625, -0.003814697265625, -0.00543212890625, 0.0026702880859375, -0.01263427734375, -0.006195068359375, -0.0087890625, 0.0244140625, -0.0169677734375, -0.01708984375, -0.0118408203125, 0.0361328125, 0.019287109375, 0.0191650390625, -0.023193359375, 0.00...
[ 138, 1375, 78288, 59370, 5, 185355, 41872, 5612, 38131, 10135, 214810, 73, 116071, 7, 18345, 98908, 13, 99929, 130514, 145, 2588, 11, 3293, 35845, 10, 20697, 78303, 1379, 70, 20805, 14364, 53, 87, 765, 5423, 47, 42856, 313, 12, 159065, ...
[ 0.0606689453125, 0.03826904296875, 0.0657958984375, 0.10888671875, 0.0450439453125, 0.162841796875, 0.039520263671875, 0.1602783203125, 0.198486328125, 0.2000732421875, 0.297607421875, 0.07586669921875, 0.2098388671875, 0.07855224609375, 0.218994140625, 0.1568603515625, 0.08062744140...
embed
58767464_c0
58767464
haskell
0
Title: Check if all elements from first argument appears in the second argument Problem title: Check if all elements from first argument appears in the second argument Tags: haskell Problem: Check if all elements from first argument appears in the second argument I get the wrong result from my code. I want to check if ...
Check if all elements from first argument appears in the second argument Check if all elements from first argument appears in the second argument haskell first Check Bool x:xs y:ys Check if all elements from first argument appears in the second argument I get the wrong result from my code. I want to check if the elemen...
[ 0.0031280517578125, 0.0081787109375, -0.009033203125, 0.015625, -0.000606536865234375, 0.021240234375, 0.01409912109375, 0.00604248046875, 0.0167236328125, 0.0250244140625, 0.0225830078125, -0.00946044921875, 0.01904296875, 0.0167236328125, -0.0206298828125, 0.01806640625, 0.02502441...
[ 38679, 2174, 756, 80854, 1295, 5117, 10750, 135179, 23, 17932, 1556, 142508, 2460, 929, 1022, 425, 113, 4778, 44691, 16750, 18151, 12765, 5303, 569, 1614, 6562, 15700, 104851, 28219 ]
[ 0.16650390625, 0.055633544921875, 0.0867919921875, 0.1588134765625, 0.065185546875, 0.1046142578125, 0.213623046875, 0.123291015625, 0.0614013671875, 0.1761474609375, 0.093505859375, 0.17578125, 0.059051513671875, 0.1500244140625, 0.002532958984375, 0.0168304443359375, 0.012725830078...
embed
17031529_c0
17031529
haskell
0
Title: Primality test in Haskell Problem title: Primality test in Haskell Tags: haskell Problem: Primality test in Haskell I have the following code in Haskell. I want to repeat 30 times the Fermat primality test for a given number n, but the problem is that it always returns False...I tried to fix the problem but I al...
Primality test in Haskell Primality test in Haskell haskell System.Random System.IO.Unsafe Primality Haskell Bool n-1 n-2 maxTest-1 Primality test in Haskell I have the following code in Haskell. I want to repeat 30 times the Fermat primality test for a given number n, but the problem is that it always returns False......
[ -0.0106201171875, -0.002960205078125, 0.01171875, -0.00179290771484375, 0.006195068359375, 0.01141357421875, 0.02099609375, -0.0281982421875, -0.006103515625, -0.0225830078125, 0.019287109375, -0.0108642578125, -0.0172119140625, 0.009033203125, 0.003387451171875, 0.00445556640625, 0....
[ 44506, 134393, 3034, 20625, 142508, 23, 1556, 12353, 126525, 3815, 17780, 14256, 115840, 2460, 929, 5759, 5428, 18389, 111337, 25632, 18151, 3444, 47, 119140, 496, 20028, 8002, 2227, 29810, 34475, 14012, 653, 1284, 2967, 11343, 30646, 22225, ...
[ 0.2171630859375, 0.1805419921875, 0.2164306640625, 0.161865234375, 0.228515625, 0.025970458984375, 0.1373291015625, 0.072265625, 0.04833984375, 0.07177734375, 0.10693359375, 0.043426513671875, 0.1639404296875, 0.066162109375, 0.1307373046875, 0.0948486328125, 0.1058349609375, 0.119...
embed
24063219_c1
24063219
haskell
1
100.0 100.0 doStuff Main 152 1000398 0.3 0.0 88.1 71.8 snapshotParser Main 154 0 4.7 4.0 87.7 71.7 tab Main 157 0 83.1 67.7 83.1 67.7 readTextDevice Data.Text.IO.Internal 151 40145 5.5 24.0 5.5 24.0 CAF Data.Text.Array 142 0 0.0 0.0 0.0 0.0 CAF Data.Text.Internal 140 0 0.0 0.0 0.0 0.0 CAF GHC.IO.Handle.FD 122 0 0.0 0.0...
100.0 100.0 doStuff Main 152 1000398 0.3 0.0 88.1 71.8 snapshotParser Main 154 0 4.7 4.0 87.7 71.7 tab Main 157 0 83.1 67.7 83.1 67.7 readTextDevice Data.Text.IO.Internal 151 40145 5.5 24.0 5.5 24.0 CAF Data.Text.Array 142 0 0.0 0.0 0.0 0.0 CAF Data.Text.Internal 140 0 0.0 0.0 0.0 0.0 CAF GHC.IO.Handle.FD 122 0 0.0 0.0...
[ 0.025634765625, -0.012451171875, 0.00115966796875, 0.01263427734375, -0.01806640625, -0.004364013671875, 0.0067138671875, -0.0157470703125, -0.00921630859375, -0.006591796875, -0.01544189453125, -0.0023040771484375, -0.0211181640625, -0.036865234375, -0.0026397705078125, 0.022338867187...
[ 209, 99929, 54, 37455, 21493, 12321, 66633, 4382, 151616, 127089, 89678, 382, 206730, 361, 119044, 76685, 72697, 28636, 2189, 81384, 757, 1398, 40401, 196800, 133760, 20928, 78600, 97109, 305, 12301, 174379, 4657, 20375, 11809, 17780, 44851, 90...
[ 0.203125, 0.2418212890625, 0.182373046875, 0.1761474609375, 0.30615234375, 0.1971435546875, 0.215087890625, 0.11962890625, 0.2215576171875, 0.1396484375, 0.1348876953125, 0.0728759765625, 0.08447265625, 0.0792236328125, 0.1258544921875, 0.173828125, 0.19189453125, 0.163818359375, ...
embed
26706944_c0
26706944
haskell
0
Title: Counting even number haskell with list comprehension? Problem title: Counting even number haskell with list comprehension? Tags: list, haskell, list-comprehension Problem: Counting even number haskell with list comprehension? I implemented a function that can count a list of numbers and produces how many even nu...
Counting even number haskell with list comprehension? Counting even number haskell with list comprehension? list haskell list-comprehension Counting Integral Num x:xs Counting even number haskell with list comprehension? I implemented a function that can count a list of numbers and produces how many even numbers in the...
[ -0.02783203125, 0.01495361328125, 0.0098876953125, -0.01904296875, 0.0289306640625, 0.02392578125, 0.0074462890625, 0.01055908203125, 0.01068115234375, -0.0341796875, -0.0035400390625, -0.0306396484375, 0.03369140625, 0.0216064453125, -0.004486083984375, 0.0023040771484375, 0.0055236...
[ 1311, 128396, 3853, 14012, 1556, 142508, 678, 5303, 46683, 3220, 6889, 277, 4692, 204681, 52782, 1022, 12, 425, 29479, 32354, 831, 54529, 101935, 27489, 3642, 5941, 17368, 195625, 1830, 3871, 903, 1733, 9790, 24145, 71924, 6863, 10756, 76199,...
[ 0.1202392578125, 0.145263671875, 0.2193603515625, 0.156005859375, 0.151611328125, 0.23291015625, 0.07171630859375, 0.1947021484375, 0.16943359375, 0.1966552734375, 0.1046142578125, 0.063720703125, 0.14208984375, 0.1656494140625, 0.109130859375, 0.059234619140625, 0.05218505859375, ...
embed
42533673_c0
42533673
haskell
0
Title: Eta reduce and DuplicateRecordFields language extension Problem title: Eta reduce and DuplicateRecordFields language extension Tags: haskell Problem: Eta reduce and DuplicateRecordFields language extension Issue is about having 2 data types, Transaction and FormatModel , both having formatId field. To prevent ad...
Eta reduce and DuplicateRecordFields language extension Eta reduce and DuplicateRecordFields language extension haskell Eta DuplicateRecordFields Transaction FormatModel HasFormat formatId_ FormatId Eta reduce and DuplicateRecordFields language extension Issue is about having 2 data types, Transaction and FormatModel ,...
[ -0.02001953125, -0.007781982421875, 0.004302978515625, 0.01251220703125, 0.0032196044921875, -0.01123046875, -0.0029144287109375, 0.0150146484375, 0.00335693359375, -0.01806640625, 0.0040283203125, 0.004302978515625, 0.00628662109375, -0.02392578125, 0.00238037109375, -0.029296875, 0...
[ 25623, 34390, 136, 786, 52721, 32271, 6159, 19388, 46876, 111938, 67, 1556, 142508, 11062, 44713, 60972, 140290, 20625, 102973, 257, 9384, 568, 71, 223317, 19441, 116, 2053, 52895, 15044, 44457, 56282, 154107, 10644, 138256, 7, 10, 124161, 75...
[ 0.250244140625, 0.227783203125, 0.059051513671875, 0.07830810546875, 0.16455078125, 0.1314697265625, 0.02984619140625, 0.11767578125, 0.1409912109375, 0.16064453125, 0.042877197265625, 0.1314697265625, 0.2236328125, 0.08502197265625, 0.0933837890625, 0.2152099609375, 0.201171875, 0...
embed
8655858_c0
8655858
haskell
0
Title: Sort a multimap with respect to another list? Problem title: Sort a multimap with respect to another list? Tags: list, sorting, haskell, multimap Problem: Sort a multimap with respect to another list? Given a certain order of keys, how can I sort a multimap (list of tuples with duplicate keys) with respect to th...
Sort a multimap with respect to another list? Sort a multimap with respect to another list? list sorting haskell multimap Sort Sort a multimap with respect to another list? Given a certain order of keys, how can I sort a multimap (list of tuples with duplicate keys) with respect to this list, where the order of duplica...
[ 0.005462646484375, 0.0164794921875, 0.0166015625, -0.0169677734375, -0.0216064453125, -0.00634765625, -0.00494384765625, -0.0140380859375, 0.0155029296875, 0.0140380859375, -0.0093994140625, 0.01495361328125, 0.01123046875, 0.004180908203125, -0.01177978515625, -0.01019287109375, -0....
[ 53666, 10, 6024, 62346, 15072, 15700, 5303, 32, 678, 12096, 214, 1556, 142508, 47, 77878, 24233, 12989, 22799, 3642, 831, 6562, 370, 99726, 171763, 67, 80854, 22027, 18, 26866, 16487, 32354, 25632, 138256, 25647, 29479, 48903, 110608, 43452, ...
[ 0.25146484375, 0.04632568359375, 0.2154541015625, 0.240966796875, 0.14501953125, 0.09259033203125, 0.1640625, 0.01654052734375, 0.0195770263671875, 0.247314453125, 0.0152740478515625, 0.10369873046875, 0.2059326171875, 0.012847900390625, 0.013153076171875, 0.056732177734375, 0.117309...
embed
15631142_c0
15631142
haskell
0
Title: Need advice on tuning the performance of a Haskell program Problem title: Need advice on tuning the performance of a Haskell program Tags: haskell, performance Problem: Need advice on tuning the performance of a Haskell program I've written a program in Haskell to do reporting using a bunch of XML files as input...
Need advice on tuning the performance of a Haskell program Need advice on tuning the performance of a Haskell program haskell performance Need Haskell Need advice on tuning the performance of a Haskell program I've written a program in Haskell to do reporting using a bunch of XML files as input. Each xml file contains ...
[ 0.00177001953125, 0.021484375, 0.000732421875, 0.015869140625, -0.0038299560546875, 0.024658203125, -0.0283203125, -0.0031890869140625, 0.0004253387451171875, -0.02001953125, 0.0196533203125, -0.01513671875, -0.00604248046875, 0.01007080078125, 0.00457763671875, 0.021728515625, -0.00...
[ 52889, 67660, 370, 592, 23718, 20625, 142508, 1528, 1556, 59121, 13416, 17368, 147306, 92537, 102158, 107730, 98423, 131492, 11435, 70541, 41653, 72104, 17164, 185397, 13695, 51042, 3934, 6056, 111, 98323, 31089, 3688, 15769, 32102, 62959, 10557,...
[ 0.1070556640625, 0.19189453125, 0.1866455078125, 0.0706787109375, 0.2001953125, 0.166015625, 0.261962890625, 0.1802978515625, 0.1512451171875, 0.06500244140625, 0.1513671875, 0.005615234375, 0.0609130859375, 0.1824951171875, 0.1046142578125, 0.1141357421875, 0.0261383056640625, 0.1...
embed
18144364_c0
18144364
haskell
0
Title: How do I use Text.JSON.Generic with optional JSON fields? Problem title: How do I use Text.JSON.Generic with optional JSON fields? Tags: json, haskell, data-binding Problem: How do I use Text.JSON.Generic with optional JSON fields? Is it possible to use Text.JSON.Generic with a JSON record type that includes opt...
How do I use Text.JSON.Generic with optional JSON fields? How do I use Text.JSON.Generic with optional JSON fields? json haskell data-binding Text.JSON.Generic How JSON Maybe Record Integer Show Data Typeable How do I use Text.JSON.Generic with optional JSON fields? Is it possible to use Text.JSON.Generic with a JSON r...
[ -0.0036773681640625, 0.007354736328125, 0.00946044921875, 0.0016632080078125, 0.00087738037109375, 0.01080322265625, 0.0167236328125, -0.01214599609375, -0.00634765625, 0.025390625, -0.00762939453125, -0.006103515625, 0.005950927734375, -0.01953125, -0.001495361328125, 0.0113525390625,...
[ 11249, 4527, 24129, 5, 1375, 58627, 135932, 12259, 678, 35829, 289, 821, 44457, 1647, 1681, 1556, 142508, 2053, 128239, 83425, 54877, 44401, 17367, 11809, 60457, 2886, 7722, 17164, 10644, 96853, 156377, 4488, 159978, 20625, 30700, 35773, 1294 ]
[ 0.04425048828125, 0.1104736328125, 0.2283935546875, 0.0343017578125, 0.1236572265625, 0.212158203125, 0.177978515625, 0.125732421875, 0.076416015625, 0.202392578125, 0.0814208984375, 0.119384765625, 0.2022705078125, 0.0670166015625, 0.1171875, 0.07940673828125, 0.185302734375, 0.06...
embed
25095364_c0
25095364
haskell
0
Title: How to override Eq, Show in records in Haskell Problem title: How to override Eq, Show in records in Haskell Tags: haskell Problem: How to override Eq, Show in records in Haskell I would like to be able to override the default definitions for Eq and Show for records in Haskell. For example, suppose I want to def...
How to override Eq, Show in records in Haskell How to override Eq, Show in records in Haskell haskell How Show Haskell Two a::Int b::Int Ambiguous TestOverride TestOverride.hs:15:3 Prelude TestOverride.hs:7:8-19 GHC.Classes How to override Eq, Show in records in Haskell I would like to be able to override the default d...
[ 0.004974365234375, 0.01177978515625, 0.0155029296875, 0.0277099609375, 0.0211181640625, 0.00604248046875, -0.01495361328125, 0.001556396484375, 0.0096435546875, 0.0169677734375, -0.01324462890625, 0.006378173828125, 0.0185546875, 0.0086669921875, 0.005401611328125, -0.01123046875, 0....
[ 11249, 645, 416, 112, 241, 864, 4, 17367, 115923, 20625, 142508, 23, 1556, 32964, 10, 876, 4153, 10250, 12282, 8647, 156673, 822, 8363, 73265, 140803, 1884, 114977, 80934, 136, 3444, 61924, 12989, 297, 80836, 105950, 5117, 42805, 33022, 186...
[ 0.0295867919921875, 0.1217041015625, 0.173095703125, 0.09222412109375, 0.08624267578125, 0.221923828125, 0.0277252197265625, 0.2464599609375, 0.196533203125, 0.148681640625, 0.229736328125, 0.054595947265625, 0.125732421875, 0.13720703125, 0.033782958984375, 0.0279541015625, 0.003448...
embed
22667012_c0
22667012
haskell
0
Title: Haskell: Is it possible to use the abstract data type in pattern matching Problem title: Haskell: Is it possible to use the abstract data type in pattern matching Tags: haskell, adt, pattern-matching Problem: Haskell: Is it possible to use the abstract data type in pattern matching Say I have an ADT called foo d...
Haskell: Is it possible to use the abstract data type in pattern matching Haskell: Is it possible to use the abstract data type in pattern matching haskell adt pattern-matching Haskell Integer Div Haskell: Is it possible to use the abstract data type in pattern matching Say I have an ADT called foo Is there a way to us...
[ -0.01434326171875, 0.0002346038818359375, 0.003936767578125, 0.00087738037109375, 0.01190185546875, -0.0091552734375, -0.0262451171875, 0.016357421875, 0.00750732421875, -0.032958984375, 0.0225830078125, -0.02685546875, 0.00080108642578125, 0.00927734375, -0.009521484375, -0.0317382812...
[ 20625, 142508, 2071, 7722, 4527, 164789, 2053, 10644, 103510, 14858, 1556, 606, 18, 98753, 44401, 53026, 23, 214, 765, 62, 41072, 35839, 5775, 31, 3917, 33022, 1810, 11907, 162515, 52895 ]
[ 0.10321044921875, 0.19677734375, 0.01641845703125, 0.1204833984375, 0.09039306640625, 0.2264404296875, 0.125, 0.168212890625, 0.17578125, 0.185302734375, 0.1011962890625, 0.07183837890625, 0.0931396484375, 0.1796875, 0.1170654296875, 0.1195068359375, 0.0115966796875, 0.029388427734...
embed
63535881_c0
63535881
haskell
0
Title: Performing side effects during computation only once in Haskell Problem title: Performing side effects during computation only once in Haskell Tags: haskell Problem: Performing side effects during computation only once in Haskell Let's say we want a collection of values that are computed on demand (the computati...
Performing side effects during computation only once in Haskell Performing side effects during computation only once in Haskell haskell Performing Haskell Prelude Char Performing side effects during computation only once in Haskell Let's say we want a collection of values that are computed on demand (the computation ha...
[ -0.006317138671875, 0.0040283203125, 0.007537841796875, 0.0045166015625, -0.000675201416015625, 0.01519775390625, -0.000965118408203125, -0.01141357421875, -0.008544921875, -0.021240234375, -0.007415771484375, -0.00506591796875, 0.01507568359375, 0.01116943359375, 0.01025390625, -0.002...
[ 169033, 5609, 93425, 20271, 181135, 1363, 4734, 24145, 20625, 142508, 1556, 1914, 822, 112, 21656, 3444, 42486, 111, 142424, 375, 7077, 98, 35968, 3060, 136, 959, 33844, 65970, 13438, 3229, 17203, 25632, 6626, 24, 5844, 51515, 4488, 11249, ...
[ 0.1636962890625, 0.1959228515625, 0.24462890625, 0.0870361328125, 0.205078125, 0.03619384765625, 0.148193359375, 0.212890625, 0.1629638671875, 0.260986328125, 0.1474609375, 0.08331298828125, 0.18408203125, 0.04888916015625, 0.140869140625, 0.09698486328125, 0.21484375, 0.0073242187...
embed
36131396_c1
36131396
haskell
1
) <interactive>:574:1: Cannot use record selector "answer" as a function due to escaped type variables Probable fix: use pattern-matching syntax instead In the expression: answer (def :: DefaultAnswer A) In an equation for "it": it = answer (def :: DefaultAnswer A) Now the way I understand it is that, since I use exist...
) <interactive>:574:1: Cannot use record selector "answer" as a function due to escaped type variables Probable fix: use pattern-matching syntax instead In the expression: answer (def :: DefaultAnswer A) In an equation for "it": it = answer (def :: DefaultAnswer A) Now the way I understand it is that, since I use exist...
[ -0.0169677734375, 0.007293701171875, 0.0157470703125, 0.000843048095703125, 0.004669189453125, -0.0162353515625, -0.02490234375, 0.00154876708984375, 0.00177764892578125, -0.0201416015625, -0.000522613525390625, -0.00732421875, 0.01055908203125, 0.00823974609375, -0.004364013671875, -0...
[ 10433, 71232, 178021, 19721, 4171, 10869, 4527, 17164, 40, 187075, 10133, 6488, 237, 32354, 4743, 144281, 71, 10644, 77336, 275, 30022, 103510, 98753, 6002, 86531, 64457, 125195, 35166, 112, 420, 1984, 262, 1021, 7136, 7251, 7, 62, 5490, 21...
[ 0.05780029296875, 0.09271240234375, 0.188720703125, 0.0428466796875, 0.0634765625, 0.10748291015625, 0.109619140625, 0.17431640625, 0.058837890625, 0.230224609375, 0.134765625, 0.185791015625, 0.0362548828125, 0.12451171875, 0.01422119140625, 0.194580078125, 0.05987548828125, 0.175...
embed
39021799_c0
39021799
haskell
0
Title: Reversing a list in another list in Haskell Problem title: Reversing a list in another list in Haskell Tags: functional-programming, reverse, haskell, list Problem: Reversing a list in another list in Haskell I'm quite new to Haskell and I'm trying to reverse a list. At the same time I want to reverse the lists ...
Reversing a list in another list in Haskell Reversing a list in another list in Haskell functional-programming reverse haskell list Reversing Haskell Prelude Reversing a list in another list in Haskell I'm quite new to Haskell and I'm trying to reverse a list. At the same time I want to reverse the lists in that list. ...
[ -0.019287109375, 0.0191650390625, 0.010498046875, 0.007568359375, -0.004608154296875, 0.004913330078125, 0.007781982421875, -0.0019073486328125, -0.0034637451171875, -0.00118255615234375, 0.004241943359375, 0.00164031982421875, 0.017578125, 0.01446533203125, -0.017333984375, 0.01013183...
[ 853, 7864, 214, 5303, 23, 15700, 20625, 142508, 123309, 28966, 39531, 184, 1556, 1914, 822, 112, 3525, 47, 31577, 3444, 3714, 25632, 18151, 5908, 237875, 12960, 66044, 7464, 18, 20697, 179933, 77947, 4358 ]
[ 0.0845947265625, 0.22998046875, 0.0546875, 0.1968994140625, 0.1177978515625, 0.105224609375, 0.1185302734375, 0.1915283203125, 0.1243896484375, 0.08447265625, 0.186767578125, 0.1373291015625, 0.1097412109375, 0.0294342041015625, 0.1077880859375, 0.03564453125, 0.04315185546875, 0.0...
embed
27663084_c1
27663084
haskell
1
T (replicateM_ 5 (traceState inc)) 2 v2 <- execStateT (replicateM_ 5 (traceState inc')) [2] v3 <- execStateT manip' [2] print (v1,v2,v3) As expected, here is the output: 2 3 4 5 6 [2] [3,2] [4,3,2] [5,4,3,2] [6,5,4,3,2] [2] [3,2] [4,3,2] [5,4,3,2] [6,5,4,3,2] [7,6,5,4,3,2] [6,5,4,3,2] (7,[7,6,5,4,3,2],[7,6,5,4,3,2]) Th...
T (replicateM_ 5 (traceState inc)) 2 v2 <- execStateT (replicateM_ 5 (traceState inc')) [2] v3 <- execStateT manip' [2] print (v1,v2,v3) As expected, here is the output: 2 3 4 5 6 [2] [3,2] [4,3,2] [5,4,3,2] [6,5,4,3,2] [2] [3,2] [4,3,2] [5,4,3,2] [6,5,4,3,2] [7,6,5,4,3,2] [6,5,4,3,2] (7,[7,6,5,4,3,2],[7,6,5,4,3,2]) Th...
[ -0.0272216796875, 0.010986328125, -0.004150390625, 0.0281982421875, -0.005462646484375, 0.024169921875, -0.006866455078125, 0.000667572021484375, -0.004150390625, -0.03857421875, 0.0125732421875, 0.031982421875, 0.0076904296875, 0.012451171875, 0.0036773681640625, -0.0027923583984375, ...
[ 384, 107, 52721, 67, 594, 454, 190, 39989, 13, 135206, 23, 238, 116, 81, 304, 1119, 3240, 618, 363, 332, 3442, 28412, 334, 418, 21320, 84751, 3688, 140992, 138, 201, 305, 33579, 122101, 617, 758, 129678, 79442, 12620, 759, 51515, 46741,...
[ 0.1622314453125, 0.0972900390625, 0.1932373046875, 0.095458984375, 0.10162353515625, 0.045013427734375, 0.1640625, 0.1485595703125, 0.08544921875, 0.1519775390625, 0.0892333984375, 0.05804443359375, 0.1190185546875, 0.1175537109375, 0.1319580078125, 0.0540771484375, 0.132568359375, ...
embed
32678426_c0
32678426
haskell
0
Title: Get specific EXIF tag from HsExif.parseFileExif Problem title: Get specific EXIF tag from HsExif.parseFileExif Tags: exif, haskell, jpeg Problem: Get specific EXIF tag from HsExif.parseFileExif I'm trying to get a specific tag (e.g. dateTimeDigitized ) from HsExif . Documentation says I can do it using lookup fu...
Get specific EXIF tag from HsExif.parseFileExif Get specific EXIF tag from HsExif.parseFileExif exif haskell jpeg HsExif.parseFileExif Get EXIF HsExif Couldn ExifTag Either containers-0.5.0.0:Data.Map.Base.Map ExifValue Get specific EXIF tag from HsExif.parseFileExif I'm trying to get a specific tag (e.g. dateTimeDigit...
[ 0.000743865966796875, -0.013671875, -0.0045166015625, 0.0093994140625, -0.002227783203125, 0.00634765625, -0.006011962890625, 0.008056640625, 0.000766754150390625, -0.00714111328125, 0.0005340576171875, 0.0174560546875, -0.0184326171875, -0.005157470703125, -0.01556396484375, -0.012634...
[ 20779, 29458, 29426, 29836, 7909, 1295, 572, 7, 19279, 3190, 2500, 184, 174350, 1119, 1556, 142508, 215109, 191147, 19, 5443, 66448, 9319, 116419, 93645, 99929, 137989, 166179, 63473, 5, 856, 50770, 31577, 2046, 5622, 70059, 14055, 15769, 293...
[ 0.07745361328125, 0.234619140625, 0.1634521484375, 0.28955078125, 0.224609375, 0.077392578125, 0.1422119140625, 0.11181640625, 0.1632080078125, 0.231689453125, 0.10198974609375, 0.07843017578125, 0.1519775390625, 0.1060791015625, 0.1473388671875, 0.237060546875, 0.22021484375, 0.10...
embed
12646082_c0
12646082
haskell
0
Title: Have a list of strings but need a list of Integers Problem title: Have a list of strings but need a list of Integers Tags: list, haskell Problem: Have a list of strings but need a list of Integers I have a list with a string inside it and I need to have that deconstructed Char by Char and put into a list as Inte...
Have a list of strings but need a list of Integers Have a list of strings but need a list of Integers list haskell Have Integers foo.txt Char Integer Have a list of strings but need a list of Integers I have a list with a string inside it and I need to have that deconstructed Char by Char and put into a list as Integer...
[ -0.0103759765625, -0.00335693359375, -0.0089111328125, 0.02392578125, 0.01483154296875, 0.0223388671875, 0.0172119140625, 0.0023345947265625, -0.005157470703125, -0.0111083984375, -0.008544921875, -0.03466796875, -0.0093994140625, 0.02392578125, -0.02001953125, -0.0169677734375, 0.00...
[ 31901, 5303, 111, 79315, 1284, 3871, 44401, 7, 1556, 142508, 5775, 31, 124326, 21656, 765, 46132, 8, 2271, 36716, 390, 3884, 3934, 237, 64457, 40536, 266, 52895, 11435, 12301, 2667, 712, 4734, 70541, 903, 17569, 20903, 944, 4153, 67, 1505...
[ 0.107666015625, 0.17822265625, 0.050384521484375, 0.1895751953125, 0.1151123046875, 0.1416015625, 0.2349853515625, 0.055999755859375, 0.1165771484375, 0.2047119140625, 0.142578125, 0.15185546875, 0.189453125, 0.1319580078125, 0.05950927734375, 0.0836181640625, 0.1214599609375, 0.06...
embed
36741999_c0
36741999
haskell
0
Title: haskell, how to deal with mismatched types - monads Problem title: haskell, how to deal with mismatched types - monads Tags: haskell, monads Problem: haskell, how to deal with mismatched types - monads I can't deal with following problem: I have some function, that return foo :: a -> b -> ErrorT String IO Int I ...
haskell, how to deal with mismatched types - monads haskell, how to deal with mismatched types - monads haskell monads throwError ErrorT Either StateT Char ReaderT haskell, how to deal with mismatched types - monads I can't deal with following problem: I have some function, that return foo :: a -> b -> ErrorT String IO...
[ 0.006805419921875, -0.005035400390625, -0.01544189453125, -0.006500244140625, 0.01251220703125, -0.006622314453125, -0.0186767578125, -0.009033203125, 0.002685546875, -0.0133056640625, 0.024658203125, -0.002777099609375, 0.00994873046875, -0.00180816650390625, -0.0057373046875, -0.0395...
[ 1556, 142508, 3642, 35142, 678, 1239, 98753, 297, 52895, 2667, 712, 104250, 18468, 31611, 212059, 618, 9319, 22836, 21656, 122636, 831, 25632, 2967, 32354, 30646, 5775, 31, 876, 23351, 17780, 360, 18, 1286, 27140, 1909, 33079, 31345, 56, 11...
[ 0.1231689453125, 0.2254638671875, 0.014434814453125, 0.14794921875, 0.113037109375, 0.1280517578125, 0.260009765625, 0.114013671875, 0.2105712890625, 0.0667724609375, 0.1304931640625, 0.1143798828125, 0.116943359375, 0.107421875, 0.1611328125, 0.1336669921875, 0.03765869140625, 0.0...
embed
24011236_c0
24011236
haskell
0
Title: A Difficult Haskell List Problem title: A Difficult Haskell List Tags: haskell Problem: A Difficult Haskell List I have a question about lists in Haskell. There is a integer list which consists of different values. How can I write a function will calculate all the sub-lists which will consist of n elements and t...
A Difficult Haskell List A Difficult Haskell List haskell Difficult Haskell List Output Integer A Difficult Haskell List I have a question about lists in Haskell. There is a integer list which consists of different values. How can I write a function will calculate all the sub-lists which will consist of n elements and ...
[ 0.00653076171875, 0.00098419189453125, 0.004425048828125, 0.0037078857421875, -0.0177001953125, 0.007293701171875, -0.007354736328125, 0.012451171875, 0.002197265625, -0.00323486328125, 0.0172119140625, -0.0225830078125, 0.01953125, 0.017578125, -0.000644683837890625, -0.00184631347656...
[ 62, 191144, 71333, 18, 20625, 142508, 32036, 1556, 13538, 7077, 44401, 9655, 5303, 7, 23, 892, 1505, 58055, 12921, 142424, 11249, 831, 87, 33022, 32354, 1221, 74481, 756, 70, 1614, 9, 6562, 653, 80854, 136, 808, 3622, 123019, 934, 190, ...
[ 0.0830078125, 0.1488037109375, 0.20458984375, 0.09759521484375, 0.15087890625, 0.245361328125, 0.229736328125, 0.1290283203125, 0.14453125, 0.055145263671875, 0.2222900390625, 0.063720703125, 0.2269287109375, 0.04266357421875, 0.031341552734375, 0.1180419921875, 0.1380615234375, 0....
embed
42110847_c0
42110847
haskell
0
Title: Function composition with the Writer monad? Problem title: Function composition with the Writer monad? Tags: haskell, writer-monad, function-composition Problem: Function composition with the Writer monad? I'm studying the Writer monad and have the following: myFunction :: Int -> Int -> Writer String Int myFunct...
Function composition with the Writer monad? Function composition with the Writer monad? haskell writer-monad function-composition Writer Couldn WriterT Data.Functor.Identity.Identity Expected Actual Function composition with the Writer monad? I'm studying the Writer monad and have the following: Error: Why does this co...
[ -0.03125, 0.006927490234375, -0.007781982421875, 0.0130615234375, -0.00335693359375, 0.0089111328125, 0.00457763671875, -0.0247802734375, -0.01190185546875, -0.00010347366333007812, 0.01275634765625, 0.031494140625, 0.01361083984375, -0.005767822265625, 0.01104736328125, -0.02136230468...
[ 28670, 10763, 166577, 678, 601, 2783, 56, 2667, 712, 32, 70, 1556, 142508, 70035, 3796, 32354, 277, 40322, 191147, 19, 618, 11809, 97249, 18770, 37379, 2481, 60075, 13, 100582, 35187, 212059, 44084, 14602, 903, 181135, 18499, 5, 136, 959, ...
[ 0.162109375, 0.0968017578125, 0.26171875, 0.1339111328125, 0.05841064453125, 0.169677734375, 0.13330078125, 0.135498046875, 0.1844482421875, 0.00830078125, 0.012939453125, 0.1068115234375, 0.2281494140625, 0.2305908203125, 0.1279296875, 0.208740234375, 0.1549072265625, 0.1657714843...
embed
10470964_c0
10470964
haskell
0
Title: Haskell: Using map in function composition Problem title: Haskell: Using map in function composition Tags: syntax, haskell, function-composition, dictionary Problem: Haskell: Using map in function composition I am relatively new to Haskell so apologies if my question sounds stupid. I have been trying to understa...
Haskell: Using map in function composition Haskell: Using map in function composition syntax haskell function-composition dictionary Haskell Using Couldn Haskell: Using map in function composition I am relatively new to Haskell so apologies if my question sounds stupid. I have been trying to understand how function com...
[ -0.01263427734375, 0.013427734375, 0.000675201416015625, 0.0164794921875, -0.0162353515625, 0.0233154296875, -0.0084228515625, 0.00909423828125, 0.0208740234375, -0.01287841796875, 0.004608154296875, -0.005279541015625, 0.00872802734375, 0.0087890625, -0.00104522705078125, -0.009521484...
[ 20625, 142508, 12, 345, 6953, 22288, 23, 32354, 166577, 6002, 86531, 1556, 277, 40322, 45, 10763, 191147, 19, 35845, 3525, 18709, 102678, 110833, 31577, 28219, 3642, 43240, 2967, 149016, 22008, 5809, 4358, 17368, 25632, 6626, 106117, 75402, 1...
[ 0.1494140625, 0.2371826171875, 0.0078125, 0.10888671875, 0.035308837890625, 0.2490234375, 0.06396484375, 0.2071533203125, 0.2626953125, 0.0616455078125, 0.027374267578125, 0.1397705078125, 0.125244140625, 0.1239013671875, 0.00885009765625, 0.059478759765625, 0.156494140625, 0.03976...
embed
35738219_c0
35738219
haskell
0
Title: Haskell&#x27;s subset operation doesn&#x27;t give me all results, only part of it is shown? Problem title: Haskell&#x27;s subset operation doesn&#x27;t give me all results, only part of it is shown? Tags: filter, list-comprehension, haskell Problem: Haskell's subset operation doesn't give me all results, only pa...
Haskell&#x27;s subset operation doesn&#x27;t give me all results, only part of it is shown? Haskell&#x27;s subset operation doesn&#x27;t give me all results, only part of it is shown? filter list-comprehension haskell Haskell Prelude Haskell's subset operation doesn't give me all results, only part of it is shown? I've...
[ 0.0269775390625, 0.0084228515625, 0.01519775390625, 0.007415771484375, -0.007232666015625, 0.01409912109375, -0.0050048828125, 0.0087890625, 0.010498046875, 0.0135498046875, -0.01458740234375, -0.0235595703125, 0.007659912109375, -0.0037078857421875, -0.03564453125, -0.004364013671875,...
[ 20625, 142508, 3768, 1614, 3509, 41018, 22027, 18, 8337, 163, 756, 50339, 4734, 2831, 111, 127887, 46312, 5303, 4692, 3220, 1556, 1914, 822, 112, 442, 52080, 339, 192583, 4568, 9655, 117615, 106, 7413, 10, 876, 136, 501, 238, 3173, 7108, ...
[ 0.1458740234375, 0.26123046875, 0.08087158203125, 0.20263671875, 0.2452392578125, 0.1614990234375, 0.054046630859375, 0.08392333984375, 0.067626953125, 0.0665283203125, 0.0841064453125, 0.1802978515625, 0.09454345703125, 0.1522216796875, 0.1197509765625, 0.185302734375, 0.15405273437...
embed
40591673_c0
40591673
haskell
0
Title: Instantiation error in Haskell Problem title: Instantiation error in Haskell Tags: haskell Problem: Instantiation error in Haskell I have the following code in Haskell type Year = Int data MonthData = Jan | Feb | March | Apr | Mar | May | Jun | Jul | Aug | Sep | Oct | Nov | Dec deriving ( Eq, Show, Ord ) type Mo...
Instantiation error in Haskell Instantiation error in Haskell haskell Instantiation Haskell Year MonthData Jan Feb March Apr Mar May Jun Jul Aug Sep Oct Nov Dec Show Ord Month ERROR Instance Num Instantiation error in Haskell I have the following code in Haskell When I try to execute it in the Hugs interpreter, I have ...
[ 0.01190185546875, 0.0022430419921875, 0.024658203125, 0.0152587890625, 0.00634765625, 0.00689697265625, -0.000804901123046875, -0.00445556640625, -0.0089111328125, -0.00555419921875, -0.038330078125, -0.034423828125, -0.0014495849609375, -0.0172119140625, 0.00836181640625, -0.003341674...
[ 166945, 14, 2320, 18499, 20625, 142508, 23, 1556, 42552, 12982, 137989, 3342, 43677, 11994, 42053, 1784, 4347, 13328, 19579, 23177, 21693, 33649, 15360, 25755, 17367, 35379, 151206, 116071, 52782, 25632, 18151, 9790, 71924, 99926, 7, 29481, 56,...
[ 0.1834716796875, 0.1640625, 0.078369140625, 0.209228515625, 0.15771484375, 0.24072265625, 0.0143890380859375, 0.148681640625, 0.13525390625, 0.131591796875, 0.0814208984375, 0.0849609375, 0.10589599609375, 0.117919921875, 0.09576416015625, 0.09454345703125, 0.0888671875, 0.10791015...
embed
20839996_c0
20839996
haskell
0
Title: haskell GHC. exe crashes on executing sqlite3 trigger Problem title: haskell GHC. exe crashes on executing sqlite3 trigger Tags: triggers, crash, ghci, haskell, sqlite Problem: haskell GHC. exe crashes on executing sqlite3 trigger I have written the following trigger. When I execute it, ghc. exe crashes. It says...
haskell GHC. exe crashes on executing sqlite3 trigger haskell GHC. exe crashes on executing sqlite3 trigger triggers crash ghci haskell sqlite GHC sqlite3 Database.HDBC.Sqlite3.Connection SELECT SUM WHERE CREATE TRIGGER AFTER INSERT EACH ROW BEGIN UPDATE SET END conv::Integer haskell GHC. exe crashes on executing sqlit...
[ -0.007049560546875, 0.03076171875, -0.00042724609375, -0.0098876953125, 0.01080322265625, 0.0084228515625, -0.005767822265625, -0.007354736328125, 0.01953125, -0.04638671875, -0.0026702880859375, -0.03173828125, 0.0079345703125, -0.02783203125, 0.01068115234375, -0.00148773193359375, ...
[ 1556, 142508, 527, 73265, 5, 97733, 150631, 90, 98, 71924, 95255, 67, 363, 185553, 31380, 318, 187781, 24318, 235603, 144832, 127944, 175151, 94536, 724, 56599, 28211, 14755, 64083, 56263, 37672, 19452, 9622, 108526, 161521, 128565, 39015, 158,...
[ 0.12109375, 0.2225341796875, 0.065673828125, 0.2401123046875, 0.07415771484375, 0.1982421875, 0.203125, 0.080810546875, 0.0377197265625, 0.1295166015625, 0.198974609375, 0.1414794921875, 0.1717529296875, 0.255859375, 0.1204833984375, 0.047027587890625, 0.0745849609375, 0.0653686523...
embed
7629622_c0
7629622
haskell
0
Title: How to interpret the function type in Haskell? Problem title: How to interpret the function type in Haskell? Tags: function, haskell Problem: How to interpret the function type in Haskell? My code is the following data Tree a = Leaf a | Node (Tree a) (Tree a) deriving (Show) f x = x + 1 myTree = Node (Node (Leaf...
How to interpret the function type in Haskell? How to interpret the function type in Haskell? function haskell How Haskell Tree Leaf Node Show Main How to interpret the function type in Haskell? My code is the following which can add one to the Leaf element in the tree. I further look at the function type which are Wha...
[ 0.0179443359375, -0.009765625, 0.0027618408203125, 0.005645751953125, 0.0252685546875, -0.0003871917724609375, -0.0023040771484375, -0.00144195556640625, -0.01312255859375, -0.021728515625, -0.01385498046875, -0.036376953125, -0.0037078857421875, 0.00701904296875, -0.0068359375, -0.005...
[ 11249, 47, 29481, 32354, 10644, 23, 20625, 142508, 1556, 101344, 636, 2407, 438, 112, 17367, 12321, 18151, 25632, 831, 15190, 1632, 12830, 53201, 808, 10, 418, 29459, 645, 3688, 91067, 12301, 41884 ]
[ 0.0474853515625, 0.06304931640625, 0.2196044921875, 0.20703125, 0.2294921875, 0.03582763671875, 0.1158447265625, 0.23046875, 0.1103515625, 0.1251220703125, 0.049835205078125, 0.1458740234375, 0.09527587890625, 0.1077880859375, 0.0885009765625, 0.0279541015625, 0.0675048828125, 0.01...
embed
42602789_c2
42602789
haskell
2
e-cache\x86_64-windows\Cabal-simple_Z6RU0evB_1.24.2.0_ghc-8.0.2.exe --builddir=.stack-work\dist\ca59d0ab build lib:samChecker3 exe:samChecker3-exe Code signals: text-icu, extra-library-dirs, Execution, Users, Documents, Haskell, samChecker3, Warning, File, samChecker3.cabal, README.md, samChecker3-0.1.0.0, Main.hs, Lib...
e-cache\x86_64-windows\Cabal-simple_Z6RU0evB_1.24.2.0_ghc-8.0.2.exe --builddir=.stack-work\dist\ca59d0ab build lib:samChecker3 exe:samChecker3-exe Code signals: text-icu, extra-library-dirs, Execution, Users, Documents, Haskell, samChecker3, Warning, File, samChecker3.cabal, README.md, samChecker3-0.1.0.0, Main.hs, Lib...
[ 0.0135498046875, -0.01214599609375, -0.002655029296875, -0.0037841796875, 0.007476806640625, 0.000713348388671875, -0.0177001953125, 0.000293731689453125, -0.015380859375, 0.0177001953125, -0.0015869140625, -0.0072021484375, 0.030517578125, -0.03125, 0.0032501220703125, 0.0087280273437...
[ 28, 408, 1430, 41872, 15276, 13307, 229792, 20370, 3571, 191560, 1511, 910, 17759, 4854, 571, 115187, 5, 20682, 73011, 9486, 238, 17376, 133684, 46480, 177149, 936, 590, 2594, 18244, 46295, 12975, 2055, 45367, 25474, 3306, 202567, 56, 363, ...
[ 0.123779296875, 0.1331787109375, 0.1529541015625, 0.002288818359375, 0.1943359375, 0.17236328125, 0.1358642578125, 0.1258544921875, 0.23291015625, 0.1893310546875, 0.037994384765625, 0.04449462890625, 0.1064453125, 0.137451171875, 0.0892333984375, 0.015411376953125, 0.037567138671875...
embed
59795708_c0
59795708
haskell
0
Title: Is Eta interoprable with Java and/or Kotlin yet? Problem title: Is Eta interoprable with Java and/or Kotlin yet? Tags: jvm, haskell, functional-programming, eta Problem: Is Eta interoprable with Java and/or Kotlin yet? I've been learning Haskell, but during my day job I am writing Kotlin/Java. I've come across E...
Is Eta interoprable with Java and/or Kotlin yet? Is Eta interoprable with Java and/or Kotlin yet? jvm haskell functional-programming eta Eta Java Kotlin Robust Interoperability Foreign Interface FFI Is Eta interoprable with Java and/or Kotlin yet? I've been learning Haskell, but during my day job I am writing Kotlin/Ja...
[ 0.0172119140625, -0.00159454345703125, -0.003387451171875, 0.004913330078125, 0.00555419921875, 0.005157470703125, -0.004730224609375, 0.00072479248046875, -0.0283203125, -0.0023040771484375, -0.0038604736328125, -0.01361083984375, 0.012939453125, 0.0074462890625, 0, -0.0230712890625, ...
[ 2071, 25623, 1940, 2146, 42, 2886, 678, 41925, 136, 19856, 2397, 14373, 748, 1647, 334, 39, 1556, 142508, 123309, 28966, 522, 30520, 8160, 5337, 42227, 184293, 220237, 22724, 52080, 20625, 5155, 12447, 32562, 156202, 1380, 36880, 4241, 3066, ...
[ 0.03839111328125, 0.280029296875, 0.120361328125, 0.1734619140625, 0.1002197265625, 0.1363525390625, 0.144775390625, 0.25537109375, 0.0167236328125, 0.1630859375, 0.2186279296875, 0.1328125, 0.0179443359375, 0.0430908203125, 0.0836181640625, 0.09100341796875, 0.1070556640625, 0.223...
embed
35261406_c0
35261406
haskell
0
Title: IntelliJ Haskell &quot;Correct path to remote debugger was not set.&quot; Problem title: IntelliJ Haskell &quot;Correct path to remote debugger was not set.&quot; Tags: debugging, haskell, intellij-idea Problem: IntelliJ Haskell "Correct path to remote debugger was not set." In Haskell, I can run my IntelliJ pro...
IntelliJ Haskell &quot;Correct path to remote debugger was not set.&quot; IntelliJ Haskell &quot;Correct path to remote debugger was not set.&quot; debugging haskell intellij-idea IntelliJ Haskell Correct See Settings Debugger IntelliJ Haskell "Correct path to remote debugger was not set." In Haskell, I can run my Inte...
[ -0.00653076171875, 0.0260009765625, -0.01385498046875, 0.00872802734375, -0.017333984375, 0.026123046875, -0.01556396484375, 0.0030364990234375, -0.018798828125, 0.00732421875, 0.0045166015625, -0.0206298828125, 0, 0.0228271484375, 0.0191650390625, 0.0057373046875, -0.010498046875, ...
[ 24018, 150, 1375, 20625, 142508, 50886, 173247, 60875, 47, 148814, 8, 978, 21407, 509, 959, 5423, 1556, 33049, 170, 30610, 46348, 105548, 262, 831, 11675, 13452, 53418, 85779, 10, 16865, 4734, 4488, 13736, 212059, 26008, 77641, 15769, 32102, ...
[ 0.1259765625, 0.125244140625, 0.232421875, 0.1475830078125, 0.2462158203125, 0.0946044921875, 0.1370849609375, 0.224365234375, 0.09161376953125, 0.1900634765625, 0.1622314453125, 0.1990966796875, 0.1708984375, 0.0294189453125, 0.0999755859375, 0.1611328125, 0.1190185546875, 0.15100...
embed
28002150_c0
28002150
haskell
0
Title: having trouble with isSuffix function in Haskell Problem title: having trouble with isSuffix function in Haskell Tags: haskell Problem: having trouble with isSuffix function in Haskell i want to check if a list is a suffix of the other. I'm struggling with this, for a while know. Here's my code: isSuffix :: Eq a...
having trouble with isSuffix function in Haskell having trouble with isSuffix function in Haskell haskell Haskell Bool x:xs y:ys having trouble with isSuffix function in Haskell i want to check if a list is a suffix of the other. I'm struggling with this, for a while know. Here's my code: This doesn't work, and i can't...
[ 0.0025634765625, 0.006927490234375, 0.01007080078125, -0.0014801025390625, -0.021728515625, -0.0108642578125, -0.000782012939453125, -0.006805419921875, 0.00144195556640625, 0.044677734375, 0.0002079010009765625, -0.01373291015625, 0.01031494140625, -0.007476806640625, -0.00921630859375,...
[ 19441, 63134, 678, 83, 294, 21493, 4084, 32354, 20625, 142508, 23, 1556, 2460, 929, 1022, 12, 425, 7, 113, 4778, 3444, 47, 12765, 2174, 10, 5303, 133784, 111, 3789, 237875, 12960, 3714, 18151, 3293, 22027, 18, 4488, 831, 7413, 70, 18499...
[ 0.037139892578125, 0.157958984375, 0.06011962890625, 0.211669921875, 0.09857177734375, 0.2271728515625, 0.2060546875, 0.1822509765625, 0.1456298828125, 0.2408447265625, 0.038177490234375, 0.1265869140625, 0.0625, 0.1455078125, 0.05902099609375, 0.0406494140625, 0.172607421875, 0.03...
embed
22556253_c2
22556253
haskell
2
, nualeargais.ie, Build-Type, Simple, Cabal-Version, creatur.git, GHC-Options, Wall, Hs-source-dirs, ALife.Creatur, ALife.Creatur.AgentNamer, ALife.Creatur.Checklist, ALife.Creatur.Clock, ALife.Creatur.Counter, ALife.Creatur.Daemon, ALife.Creatur.Database, ALife.Creatur.Database.FileSystem, ALife.Creatur.Genetics.Analy...
, nualeargais.ie, Build-Type, Simple, Cabal-Version, creatur.git, GHC-Options, Wall, Hs-source-dirs, ALife.Creatur, ALife.Creatur.AgentNamer, ALife.Creatur.Checklist, ALife.Creatur.Clock, ALife.Creatur.Counter, ALife.Creatur.Daemon, ALife.Creatur.Database, ALife.Creatur.Database.FileSystem, ALife.Creatur.Genetics.Analy...
[ 0.00213623046875, -0.007598876953125, 0.0106201171875, 0.000713348388671875, 0.01104736328125, -0.00640869140625, -0.0003833770751953125, -0.00885009765625, 0.0191650390625, 0.02099609375, 0.00628662109375, -0.0252685546875, -0.000858306884765625, 0.000843048095703125, 0.007415771484375,...
[ 6, 4, 315, 1935, 61477, 1606, 5, 478, 121137, 9, 196707, 60552, 30438, 289, 178390, 48107, 474, 15769, 527, 73265, 39029, 23706, 572, 7, 60427, 936, 62, 69397, 63784, 16989, 284, 46825, 124197, 56, 202567, 6562, 21135, 108210, 74768, 1379...
[ 0.07379150390625, 0.093994140625, 0.1717529296875, 0.1405029296875, 0.1407470703125, 0.228759765625, 0.085693359375, 0.1995849609375, 0.2022705078125, 0.012603759765625, 0.224365234375, 0.182373046875, 0.1881103515625, 0.1572265625, 0.19873046875, 0.2069091796875, 0.2069091796875, ...
embed
9247495_c0
9247495
haskell
0
Title: Map and Filter in Haskell Problem title: Map and Filter in Haskell Tags: filter, haskell, dictionary, function Problem: Map and Filter in Haskell I have two lists of tuples which are as follows: [(String,Integer)] and [(Float,Integer)] . Each list has several tuples. For every Integer that has a Float in the sec...
Map and Filter in Haskell Map and Filter in Haskell filter haskell dictionary function Map Filter Haskell Integer Float Map and Filter in Haskell I have two lists of tuples which are as follows: [(String,Integer)] and [(Float,Integer)] . Each list has several tuples. For every Integer that has a Float in the second lis...
[ 0.00799560546875, -0.00823974609375, -0.024658203125, -0.002716064453125, -0.00439453125, 0.016357421875, 0.01318359375, -0.01287841796875, 0.0074462890625, 0.012939453125, -0.0067138671875, -0.0020904541015625, 0.006011962890625, -0.004852294921875, -0.00408935546875, -0.0075988769531...
[ 42719, 136, 128896, 23, 20625, 142508, 46312, 1556, 10763, 32354, 44401, 38699, 257, 765, 6626, 5303, 370, 99726, 28960, 71713, 214, 4153, 67, 1505, 919, 365, 98423, 40368, 11907, 17932, 3871, 12765, 2174, 14858, 5117, 14602, 30646, 23351, ...
[ 0.2369384765625, 0.126708984375, 0.2822265625, 0.03863525390625, 0.1544189453125, 0.265380859375, 0.22021484375, 0.1279296875, 0.061767578125, 0.1697998046875, 0.2237548828125, 0.2020263671875, 0.1072998046875, 0.005523681640625, 0.0948486328125, 0.18408203125, 0.115966796875, 0.21...
embed
9283200_c0
9283200
haskell
0
Title: Loop through a set of functions with Haskell Problem title: Loop through a set of functions with Haskell Tags: recursion, loops, while-loop, list-comprehension, haskell Problem: Loop through a set of functions with Haskell Here's a simple, barebones example of how the code that I'm trying to do would look in C++...
Loop through a set of functions with Haskell Loop through a set of functions with Haskell recursion loops while-loop list-comprehension haskell Loop Haskell function1 function2 function3 Loop through a set of functions with Haskell Here's a simple, barebones example of how the code that I'm trying to do would look in C...
[ 0.005279541015625, -0.00164794921875, -0.003509521484375, 0.0211181640625, 0.0078125, 0.0007781982421875, 0.0042724609375, 0.01141357421875, 0.01361083984375, -0.0103759765625, -0.003631591796875, 0.00579833984375, -0.009521484375, 0.0162353515625, 0.01226806640625, -0.0020599365234375...
[ 199694, 8305, 5423, 32354, 678, 20625, 142508, 195625, 1830, 40956, 12960, 28354, 5303, 4692, 3220, 1556, 304, 363, 8781, 3059, 96959, 27781, 18151, 31577, 2806, 6713, 23, 313, 37223, 1528, 20697, 3871, 24189, 142484, 11341, 105950, 98320, 77...
[ 0.192138671875, 0.2283935546875, 0.1123046875, 0.2054443359375, 0.1318359375, 0.170166015625, 0.2493896484375, 0.154541015625, 0.048919677734375, 0.2122802734375, 0.089111328125, 0.1591796875, 0.111572265625, 0.0740966796875, 0.0770263671875, 0.1619873046875, 0.0205535888671875, 0....
embed
32944035_c0
32944035
haskell
0
Title: ***Exception: Prelude.head empty List. What is the base case? Problem title: ***Exception: Prelude.head empty List. What is the base case? Tags: haskell Problem: ***Exception: Prelude.head empty List. What is the base case? I am writing a function of getting the product of 2 matrix. transpose' :: [[a]] -> [[a]] ...
***Exception: Prelude.head empty List. What is the base case? ***Exception: Prelude.head empty List. What is the base case? haskell Exception Prelude.head List What x:xs y:ys ***Exception: Prelude.head empty List. What is the base case? I am writing a function of getting the product of 2 matrix. I always get something ...
[ 0.0037841796875, 0.0218505859375, 0.00160980224609375, -0.006378173828125, 0.0014190673828125, 0.0016021728515625, -0.00616455078125, -0.0020294189453125, 0.0191650390625, -0.0027923583984375, 0.00469970703125, 0.0142822265625, -0.006378173828125, 0.000946044921875, -0.02490234375, -0....
[ 24428, 19279, 63928, 1914, 822, 112, 31251, 201505, 32036, 83, 3647, 7225, 4865, 70, 1556, 142508, 5443, 1022, 12, 425, 7, 113, 4778, 32562, 32354, 20949, 12996, 116, 50944, 11343, 2046, 1884, 110558, 304, 5, 44691 ]
[ 0.022369384765625, 0.03790283203125, 0.1527099609375, 0.10211181640625, 0.1767578125, 0.1353759765625, 0.2247314453125, 0.201904296875, 0.205810546875, 0.0350341796875, 0.2015380859375, 0.2154541015625, 0.0166778564453125, 0.0186614990234375, 0.1109619140625, 0.191162109375, 0.020751...
embed
10487726_c1
10487726
haskell
1
Random a => RandomState a getRandom = get >>= \gen -> let (val, gen') = random gen in put gen' >> return val I get the following: import Monad import System import IO import Random import Control.Monad.State type RandomState a = State StdGen a data CountedRandom = CountedRandom { crGen :: StdGen , crCount :: Int } typ...
Random a => RandomState a getRandom = get >>= \gen -> let (val, gen') = random gen in put gen' >> return val I get the following: import Monad import System import IO import Random import Control.Monad.State type RandomState a = State StdGen a data CountedRandom = CountedRandom { crGen :: StdGen , crCount :: Int } typ...
[ -0.0230712890625, -0.0030670166015625, 0.0069580078125, -0.000286102294921875, 0.01708984375, 0.0016326904296875, 0.002227783203125, -0.037353515625, -0.0091552734375, -0.0537109375, 0.01141357421875, 0.03369140625, -0.0284423828125, 0.01318359375, 0.00122833251953125, -0.0128784179687...
[ 39643, 306, 10, 44357, 135206, 13, 2046, 126525, 3815, 1409, 2633, 1405, 9226, 25, 96759, 3884, 30646, 3502, 87, 25632, 24927, 60331, 71, 12353, 17780, 27131, 46674, 712, 10644, 22836, 2907, 105376, 2053, 108210, 297, 8374, 18, 25109, 3229,...
[ 0.1971435546875, 0.1519775390625, 0.181396484375, 0.031402587890625, 0.18310546875, 0.0213775634765625, 0.1290283203125, 0.18505859375, 0.2445068359375, 0.1590576171875, 0.135498046875, 0.1871337890625, 0.20068359375, 0.0972900390625, 0.22021484375, 0.1611328125, 0.138427734375, 0....
embed
34837008_c0
34837008
haskell
0
Title: Arrows, Free Monads and IO Problem title: Arrows, Free Monads and IO Tags: arrow-abstraction, free-monad, functional-programming, haskell Problem: Arrows, Free Monads and IO Gabriella Gonzalez in her blog post describes a way to purify code using free monads. Let's say we have FreeMonadIO a , then we can write d...
Arrows, Free Monads and IO Arrows, Free Monads and IO arrow-abstraction free-monad functional-programming haskell Arrows Free Monads FreeMonadIO FreeArrowIO Kleisli Arrows, Free Monads and IO Gabriella Gonzalez in her blog post describes a way to purify code using free monads. Let's say we have FreeMonadIO a , then we ...
[ 0.00007724761962890625, 0.0113525390625, 0.0157470703125, 0.020751953125, -0.005950927734375, 0.0027923583984375, -0.016845703125, 0.01092529296875, -0.00347900390625, 0.0022125244140625, 0.011474609375, -0.00927734375, -0.0101318359375, 0.0245361328125, 0.004974365234375, -0.010559082...
[ 1172, 15555, 7, 5153, 60331, 6468, 136, 17780, 118201, 2055, 117474, 4092, 3796, 712, 123309, 28966, 1556, 142508, 46674, 7614, 24798, 164, 150, 25203, 143, 8433, 31179, 98363, 3917, 7398, 40383, 18151, 17368, 2667, 10, 831, 33022, 12921, 2...
[ 0.0897216796875, 0.2333984375, 0.08392333984375, 0.171630859375, 0.1934814453125, 0.145751953125, 0.009246826171875, 0.2413330078125, 0.2357177734375, 0.09466552734375, 0.10333251953125, 0.17529296875, 0.11376953125, 0.181884765625, 0.1485595703125, 0.12646484375, 0.09124755859375, ...
embed
3542969_c0
3542969
haskell
0
Title: head and tail calls on empty list bringing an exception Problem title: head and tail calls on empty list bringing an exception Tags: ghci, haskell, haskell-platform Problem: head and tail calls on empty list bringing an exception I'm following a tutorial. (Real World Haskell) And I have one beginner question abo...
head and tail calls on empty list bringing an exception head and tail calls on empty list bringing an exception ghci haskell haskell-platform head and tail calls on empty list bringing an exception I'm following a tutorial. (Real World Haskell) And I have one beginner question about head and tail called on empty lists:...
[ 0.030029296875, -0.0016937255859375, 0.0147705078125, 0.0029144287109375, 0.007537841796875, 0.018310546875, 0.025146484375, -0.01129150390625, 0.005584716796875, -0.026123046875, 0.023681640625, -0.0225830078125, -0.000850677490234375, 0.0076904296875, 0.0269775390625, -0.02587890625,...
[ 10336, 136, 46741, 11782, 98, 201505, 5303, 172915, 131527, 31380, 318, 1556, 142508, 172121, 57143, 68996, 6661, 20625, 9842, 1679, 35839, 527, 73265, 14, 30646, 18425, 15044, 5608, 26785, 62468, 39456, 25737, 7108, 17324, 54608, 101904, 110, ...
[ 0.210693359375, 0.1533203125, 0.2607421875, 0.1932373046875, 0.031982421875, 0.221435546875, 0.201904296875, 0.0804443359375, 0.20068359375, 0.068603515625, 0.1134033203125, 0.08367919921875, 0.2030029296875, 0.0767822265625, 0.07177734375, 0.0750732421875, 0.06439208984375, 0.0892...
embed
35948278_c0
35948278
haskell
0
Title: How to create a Foldable instance of a type with multiple parameters in Haskell? Problem title: How to create a Foldable instance of a type with multiple parameters in Haskell? Tags: foldable, typeclass, instance, haskell Problem: How to create a Foldable instance of a type with multiple parameters in Haskell? I...
How to create a Foldable instance of a type with multiple parameters in Haskell? How to create a Foldable instance of a type with multiple parameters in Haskell? foldable typeclass instance haskell How Foldable Haskell Box How to create a Foldable instance of a type with multiple parameters in Haskell? I have a data ty...
[ 0.00921630859375, -0.00933837890625, -0.00506591796875, 0.001800537109375, -0.015625, 0.0123291015625, -0.00811767578125, -0.0035552978515625, 0.00750732421875, 0.00013065338134765625, -0.01263427734375, -0.05224609375, 0.0059814453125, 0.007476806640625, -0.00958251953125, -0.00750732...
[ 11249, 28282, 30077, 71, 2886, 110527, 10644, 678, 48716, 171859, 20625, 142508, 47, 111, 42822, 67413, 1556, 27271, 10, 23, 2053, 3444, 34475, 9844, 8562, 159978, 237, 1884, 80934, 18344, 7569, 172852, 98, 91, 9969, 34759, 2633, 27798 ]
[ 0.056365966796875, 0.1539306640625, 0.181640625, 0.125732421875, 0.1885986328125, 0.262451171875, 0.194580078125, 0.052520751953125, 0.1923828125, 0.1968994140625, 0.1314697265625, 0.2347412109375, 0.03204345703125, 0.002899169921875, 0.1947021484375, 0.11669921875, 0.09197998046875,...
embed
41004612_c0
41004612
haskell
0
Title: Can&#x27;t replace in Haskell Problem title: Can&#x27;t replace in Haskell Tags: replace, haskell Problem: Can't replace in Haskell I'm trying to read in a string from a file, which works fine. But trying to replace punctuation marks with nothing to delete them, it gives me always the same message. My program pa...
Can&#x27;t replace in Haskell Can&#x27;t replace in Haskell replace haskell FPH Data.List Can Haskell contents2 sonnet18 contents3 Can't replace in Haskell I'm trying to read in a string from a file, which works fine. But trying to replace punctuation marks with nothing to delete them, it gives me always the same messa...
[ -0.01214599609375, -0.0018310546875, -0.013427734375, 0.021240234375, -0.0050048828125, 0.004974365234375, 0.006622314453125, -0.0166015625, 0.0125732421875, 0.0250244140625, -0.00152587890625, -0.00885009765625, 0.00151824951171875, -0.0220947265625, 0.00176239013671875, -0.0054016113...
[ 4171, 3768, 18, 91995, 23, 20625, 142508, 1556, 563, 54259, 11809, 154663, 10941, 304, 775, 1179, 1819, 363, 31577, 12301, 79315, 11435, 43240, 33595, 34, 16188, 154109, 11343, 5701, 1528, 2831, 33342, 127, 131527, 2500, 18499, 214552, 18597,...
[ 0.0772705078125, 0.07470703125, 0.06903076171875, 0.2169189453125, 0.051300048828125, 0.141845703125, 0.2437744140625, 0.133056640625, 0.042266845703125, 0.19091796875, 0.060882568359375, 0.10687255859375, 0.1842041015625, 0.098876953125, 0.0782470703125, 0.1868896484375, 0.197021484...
embed
53361532_c2
53361532
haskell
2
:1 Code signals: How, Resolving, Configuring, liquidhaskell-0.8.0.5, Building, Failed, Build, liquidhaskell-0.8.0.5.log, Entering, cabal-tmp-1752, Preprocessing, Compiling, Test.Target.Expr, Test, Target, Expr.hs, Expr.o, Paths_liquidhaskell, Paths_liquidhaskell.hs, Paths_liquidhaskell.o, Language.Haskell.Liquid.UX.Con...
:1 Code signals: How, Resolving, Configuring, liquidhaskell-0.8.0.5, Building, Failed, Build, liquidhaskell-0.8.0.5.log, Entering, cabal-tmp-1752, Preprocessing, Compiling, Test.Target.Expr, Test, Target, Expr.hs, Expr.o, Paths_liquidhaskell, Paths_liquidhaskell.hs, Paths_liquidhaskell.o, Language.Haskell.Liquid.UX.Con...
[ 0.01446533203125, -0.0084228515625, -0.003082275390625, 0.0042724609375, 0.00147247314453125, 0.006622314453125, -0.00396728515625, 0.007537841796875, 0.006683349609375, 0.01190185546875, -0.00506591796875, -0.03271484375, 0.00372314453125, 0.007537841796875, 0.0172119140625, -0.004028...
[ 19721, 28864, 26073, 7, 12, 11249, 853, 132944, 214, 59994, 41931, 10557, 142508, 132208, 93645, 104919, 190355, 297, 121137, 4867, 357, 33558, 109524, 2676, 13521, 12744, 1914, 63923, 15612, 49725, 8647, 63031, 10287, 160017, 60075, 42, 127, ...
[ 0.14111328125, 0.25439453125, 0.260498046875, 0.1123046875, 0.05743408203125, 0.1182861328125, 0.014495849609375, 0.1751708984375, 0.046295166015625, 0.17041015625, 0.2115478515625, 0.1561279296875, 0.263427734375, 0.1640625, 0.20361328125, 0.11767578125, 0.15771484375, 0.032867431...
embed
9461053_c0
9461053
haskell
0
Title: Generic &#x27;unwrap&#x27; function in Haskell? Problem title: Generic &#x27;unwrap&#x27; function in Haskell? Tags: haskell Problem: Generic 'unwrap' function in Haskell? When I use fmap over a value, it essentially "unboxes" that value, applies the function to it, and boxes it back up. For example: -- returns ...
Generic &#x27;unwrap&#x27; function in Haskell? Generic &#x27;unwrap&#x27; function in Haskell? haskell Generic Haskell Just fmap_2 Either Maybe Otherwise Nothing Generic 'unwrap' function in Haskell? When I use fmap over a value, it essentially "unboxes" that value, applies the function to it, and boxes it back up. Fo...
[ -0.006072998046875, -0.00017261505126953125, 0.006591796875, -0.0002880096435546875, -0.00762939453125, 0.0218505859375, -0.014404296875, -0.01519775390625, 0.01190185546875, 0.0081787109375, 0.0004119873046875, -0.02099609375, -0.017333984375, -0.0012969970703125, -0.007537841796875, ...
[ 88342, 1771, 3768, 309, 434, 13631, 32354, 23, 20625, 142508, 1556, 9563, 1238, 62346, 304, 4565, 9319, 83425, 64511, 90825, 182747, 14847, 4527, 645, 34292, 85590, 11728, 4027, 25720, 16530, 4420, 1257, 2499, 76199, 163, 15490, 442, 4488, ...
[ 0.19873046875, 0.04876708984375, 0.0645751953125, 0.172119140625, 0.09588623046875, 0.262451171875, 0.2252197265625, 0.05633544921875, 0.1533203125, 0.28369140625, 0.1160888671875, 0.05645751953125, 0.153564453125, 0.3076171875, 0.1334228515625, 0.04412841796875, 0.14990234375, 0.2...
embed
66423816_c2
66423816
haskell
2
JYgx6uK.conf, parallel-3.2.2.0-HTf2o2horULDwL7cXUB9uv.conf, hashable-1.3.0.0-K3FFBNAmsvaIvBv4Qg15rQ.conf, semigroups-0.19.1-CdJZL8lQRXTEuOuxFhFNIa.conf, contravariant-1.5.3-A4NbUFeaP6W4UzkL1ejoXa.conf, indexed-traversable-0.1.1-Dw8MIJyvCj8IZQDXOa8TBp.conf, tagged-0.8.6.1-A3E8I7zg2qBFE9O5vQsg6C.conf, void-0.7.3-FJLCa6y3...
ZpS7bE.conf kan-extensions-5.2.2-Z55rpCSAQY7rC9ino1jlr.conf vector-0.12.1.2-6jlbObSa8iuJfxUVGBQC5r.conf lens-4.19.2-86eTsWPqcVQ3qs5KiS7cYu.conf Preprocessing cabal-component-hook-0.1.0 Building Compiling Paths_cabal_component_hook CExeName UnqualComponentName Main Linking Cabal-3.2.1.0 cabal-component-hook-0.1.0-8kPvy0...
[ -0.00799560546875, -0.0106201171875, 0.0128173828125, -0.00145721435546875, 0.00982666015625, -0.01312255859375, -0.0223388671875, 0.00167083740234375, 0.01434326171875, 0.024169921875, -0.004180908203125, 0.0220947265625, -0.004608154296875, -0.003631591796875, -0.005462646484375, 0.0...
[ 567, 254, 294, 966, 275, 647, 70547, 203, 3355, 128872, 70147, 1511, 11663, 4043, 42, 173, 18770, 15654, 48400, 3098, 120518, 151309, 15276, 95950, 1914, 63923, 109524, 277, 54137, 497, 685, 23320, 102107, 104919, 15612, 49725, 108421, 408, ...
[ 0.05499267578125, 0.0141143798828125, 0.002044677734375, 0.0248870849609375, 0.0333251953125, 0.084228515625, 0.182861328125, 0.1258544921875, 0.0386962890625, 0.1268310546875, 0.07562255859375, 0.0050048828125, 0.1239013671875, 0.08135986328125, 0.05242919921875, 0.1036376953125, 0....
embed
67972231_c0
67972231
haskell
0
Title: Syntax for lazy pattern matching with `as` syntax Problem title: Syntax for lazy pattern matching with `as` syntax Tags: haskell, ghci Problem: Syntax for lazy pattern matching with `as` syntax In (vanilla) GHCi 8.6.5 following function was prefectly valid: f xs@ ~(x:xt) = xs If I now do the same in 9.0.1 I get ...
Syntax for lazy pattern matching with `as` syntax Syntax for lazy pattern matching with `as` syntax haskell ghci Syntax x:xt Suffix Syntax for lazy pattern matching with `as` syntax In (vanilla) GHCi 8.6.5 following function was prefectly valid: If I now do the same in 9.0.1 I get an error Just removing the white space...
[ -0.01287841796875, 0.014404296875, -0.018798828125, -0.00457763671875, -0.0057373046875, 0.0098876953125, -0.011962890625, 0.007476806640625, 0.0025482177734375, 0.006683349609375, 0.0194091796875, 0.00127410888671875, -0.006591796875, -0.00177764892578125, 0.0244140625, 0.007293701171...
[ 19010, 86531, 100, 21, 3285, 103510, 14858, 214, 678, 162, 6002, 1556, 142508, 31380, 318, 1022, 12, 29062, 142830, 55923, 2187, 2298, 527, 73265, 14, 3217, 136473, 25632, 32354, 93660, 35604, 5036, 54, 5701, 3569, 102014, 18499, 35011, 326...
[ 0.1265869140625, 0.1800537109375, 0.015167236328125, 0.1610107421875, 0.240478515625, 0.224365234375, 0.1878662109375, 0.02899169921875, 0.0855712890625, 0.2410888671875, 0.1427001953125, 0.06842041015625, 0.189697265625, 0.109130859375, 0.160400390625, 0.0771484375, 0.06732177734375...
embed
59339405_c0
59339405
haskell
0
Title: Make list from a custom data type in Haskell (reverse operation also) Problem title: Make list from a custom data type in Haskell (reverse operation also) Tags: haskell, functional-programming Problem: Make list from a custom data type in Haskell (reverse operation also) I'm going to learn how to convert a data ...
Make list from a custom data type in Haskell (reverse operation also) Make list from a custom data type in Haskell (reverse operation also) haskell functional-programming a Make Haskell List Nil Cons Make list from a custom data type in Haskell (reverse operation also) I'm going to learn how to convert a data type to a...
[ -0.0135498046875, 0.0299072265625, 0.003997802734375, 0.0177001953125, -0.0101318359375, 0.007293701171875, -0.0017852783203125, 0.013671875, 0.0208740234375, -0.010009765625, -0.0167236328125, -0.02294921875, 0.017822265625, 0.00640869140625, -0.014404296875, 0.0026092529296875, 0.0...
[ 26176, 5303, 1295, 114122, 2053, 10644, 20625, 142508, 107, 37676, 41018, 23, 1556, 123309, 28966, 32036, 77175, 39215, 30698, 96760, 47, 142, 10298, 53, 17368, 2046, 132283, 3688, 28484, 142477, 15490, 351, 18391, 14858, 150632, 510, 88500, ...
[ 0.0853271484375, 0.21728515625, 0.09130859375, 0.2021484375, 0.1209716796875, 0.2177734375, 0.12939453125, 0.222900390625, 0.082763671875, 0.2100830078125, 0.1353759765625, 0.002471923828125, 0.114990234375, 0.11181640625, 0.04339599609375, 0.18505859375, 0.111328125, 0.14099121093...
embed
25105261_c0
25105261
haskell
0
Title: Haskell: data type for representation of binary, hexadecimal, and octal Problem title: Haskell: data type for representation of binary, hexadecimal, and octal Tags: haskell Problem: Haskell: data type for representation of binary, hexadecimal, and octal I'm trying to define a data type to represent numbers in bi...
Haskell: data type for representation of binary, hexadecimal, and octal Haskell: data type for representation of binary, hexadecimal, and octal haskell Haskell Number Bin Char Hex Oct Show oct2Bin bin2Hex oct2Hex Haskell: data type for representation of binary, hexadecimal, and octal I'm trying to define a data type to...
[ 0.0062255859375, -0.00677490234375, 0.005706787109375, 0.0286865234375, 0.007171630859375, 0.01904296875, -0.00994873046875, 0.00066375732421875, -0.0030975341796875, 0.018310546875, -0.022705078125, -0.05859375, 0.006805419921875, 0.0263671875, -0.01611328125, 0.01324462890625, 0.01...
[ 20625, 142508, 12, 2053, 10644, 100, 18811, 1363, 2394, 6635, 764, 3798, 170753, 289, 136, 154447, 141, 1556, 103332, 16666, 21656, 1529, 425, 33649, 17367, 36, 15390, 304, 571, 73, 841, 3355, 111, 31577, 61924, 47, 33636, 101935, 23, 4, ...
[ 0.149169921875, 0.260498046875, 0.0294952392578125, 0.1690673828125, 0.228515625, 0.0645751953125, 0.2086181640625, 0.004730224609375, 0.1795654296875, 0.1414794921875, 0.105712890625, 0.12939453125, 0.16162109375, 0.01275634765625, 0.058563232421875, 0.2010498046875, 0.132080078125,...
embed
27332815_c0
27332815
haskell
0
Title: Haskell intersection with duplicates Problem title: Haskell intersection with duplicates Tags: haskell Problem: Haskell intersection with duplicates I am new to Haskell and this has to be quite simple, but I have been searching the net for an hour without finding a convenient answer. What I want is a function th...
Haskell intersection with duplicates Haskell intersection with duplicates haskell Haskell Haskell intersection with duplicates I am new to Haskell and this has to be quite simple, but I have been searching the net for an hour without finding a convenient answer. What I want is a function that returns an 'intersection' ...
[ -0.00341796875, 0.00567626953125, 0.0118408203125, -0.01153564453125, 0.002349853515625, 0.0322265625, -0.011962890625, -0.0194091796875, 0.010498046875, -0.031494140625, -0.006011962890625, 0.00494384765625, 0.007659912109375, 0.0235595703125, -0.004119873046875, 0.00762939453125, 0...
[ 20625, 142508, 1940, 7, 58994, 678, 171763, 1636, 1556, 3525, 8781, 157318, 56816, 142267, 35166, 4865, 3444, 32354, 30646, 10433, 111, 6626, 5303, 80854, 32316, 15044, 35971, 15426, 17569, 24762, 36663, 54, 2174, 5117, 70541, 16750, 959, 304...
[ 0.1392822265625, 0.2158203125, 0.196533203125, 0.2054443359375, 0.204345703125, 0.09906005859375, 0.299560546875, 0.1854248046875, 0.1488037109375, 0.0487060546875, 0.054229736328125, 0.015472412109375, 0.04058837890625, 0.0347900390625, 0.06170654296875, 0.03985595703125, 0.12634277...
embed
19739066_c0
19739066
haskell
0
Title: How can I generate the faces of a cube in Haskell? Problem title: How can I generate the faces of a cube in Haskell? Tags: haskell, 3d, geometry Problem: How can I generate the faces of a cube in Haskell? I am writing a function in Haskell that takes a Point and a Double that represent the center and side length...
How can I generate the faces of a cube in Haskell? How can I generate the faces of a cube in Haskell? haskell 3d geometry How Haskell Point Double Cube Face How can I generate the faces of a cube in Haskell? I am writing a function in Haskell that takes a Point and a Double that represent the center and side length of ...
[ 0.0299072265625, -0.00604248046875, -0.01171875, 0.0084228515625, 0.0223388671875, 0.00714111328125, 0.001251220703125, -0.031982421875, 0.016845703125, -0.0157470703125, 0.01043701171875, -0.0128173828125, -0.00787353515625, -0.006561279296875, -0.019287109375, -0.0035400390625, 0.0...
[ 11249, 831, 139392, 2577, 7, 111, 314, 372, 23, 20625, 142508, 1556, 138, 71, 700, 87739, 41097, 107172, 3003, 26219, 87, 70, 10, 32562, 32354, 51776, 136, 33636, 27585, 5609, 140909, 10644, 8331, 34, 2661, 138256, 2046, 33177, 135518, 90...
[ 0.0863037109375, 0.0792236328125, 0.230224609375, 0.211181640625, 0.1419677734375, 0.05181884765625, 0.192626953125, 0.210693359375, 0.0572509765625, 0.1451416015625, 0.269775390625, 0.09881591796875, 0.07373046875, 0.051239013671875, 0.00042724609375, 0.011016845703125, 0.1824951171...
embed
64971059_c0
64971059
haskell
0
Title: Binary Search Tree in Haskell Problem title: Binary Search Tree in Haskell Tags: haskell, search-tree, binary-search-tree Problem: Binary Search Tree in Haskell I am starting to learn Haskell and therefore I tried to implement a Binary Search Tree. My current code looks like this: data SearchTree = Empty | Node ...
Binary Search Tree in Haskell Binary Search Tree in Haskell haskell search-tree binary-search-tree Binary Search Tree Haskell SearchTree Empty Node Show Binary Search Tree in Haskell I am starting to learn Haskell and therefore I tried to implement a Binary Search Tree. My current code looks like this: But somehow the ...
[ 0.0010223388671875, 0.001373291015625, 0.021240234375, 0.00185394287109375, 0.018798828125, 0.018798828125, -0.01953125, -0.04443359375, -0.0069580078125, -0.027099609375, -0.00012302398681640625, -0.033203125, -0.00567626953125, 0.017578125, -0.00127410888671875, 0.01116943359375, 0...
[ 54092, 1294, 33086, 101344, 20625, 142508, 1556, 33938, 62600, 2394, 6635, 86250, 62731, 31678, 939, 438, 112, 17367, 37842, 29479, 43581, 18151, 33342, 17932, 2831, 183540, 32354, 959, 20697, 26785, 9790, 16750, 201, 64457, 116, 5021, 84751, ...
[ 0.1845703125, 0.0965576171875, 0.1898193359375, 0.2352294921875, 0.1214599609375, 0.207275390625, 0.09478759765625, 0.1083984375, 0.1854248046875, 0.1656494140625, 0.0772705078125, 0.1488037109375, 0.197265625, 0.134033203125, 0.09423828125, 0.112548828125, 0.113037109375, 0.070190...
embed
6636400_c0
6636400
haskell
0
Title: Recursion or list comprehension? Problem title: Recursion or list comprehension? Tags: haskell, list-comprehension, recursion Problem: Recursion or list comprehension? Working through Learn You a Haskell For Great Good , in the chapter on higher-order functions the author walks through an implementation of a few...
Recursion or list comprehension? Recursion or list comprehension? haskell list-comprehension recursion Recursion x:xs Recursion or list comprehension? Working through Learn You a Haskell For Great Good , in the chapter on higher-order functions the author walks through an implementation of a few different library funct...
[ -0.013916015625, 0.02392578125, 0.012939453125, -0.0146484375, 0.005706787109375, -0.004241943359375, 0.0089111328125, 0.004364013671875, 0.0257568359375, -0.01513671875, 0.0216064453125, -0.013427734375, 0.0002288818359375, -0.010009765625, -0.004852294921875, 0.00384521484375, 0.03...
[ 165428, 42, 6889, 707, 5303, 46683, 3220, 1556, 142508, 277, 4692, 195625, 1830, 1022, 12, 425, 134031, 2583, 20625, 1326, 18621, 139539, 77546, 80596, 32354, 35691, 208124, 12921, 35773, 80934, 46312, 25, 197648, 5570, 1294, 17569, 162520, 4...
[ 0.2066650390625, 0.2078857421875, 0.185546875, 0.0780029296875, 0.211181640625, 0.187744140625, 0.1920166015625, 0.1243896484375, 0.20556640625, 0.042266845703125, 0.1387939453125, 0.277099609375, 0.0670166015625, 0.035186767578125, 0.0287322998046875, 0.0770263671875, 0.075439453125...
embed
12486329_c0
12486329
haskell
0
Title: What is going on when I compose &quot;show&quot; and &quot;read&quot; in Haskell? Problem title: What is going on when I compose &quot;show&quot; and &quot;read&quot; in Haskell? Tags: generics, typeclass, ghci, haskell, type-inference Problem: What is going on when I compose "show" and "read" in Haskell? Here's...
What is going on when I compose &quot;show&quot; and &quot;read&quot; in Haskell? What is going on when I compose &quot;show&quot; and &quot;read&quot; in Haskell? generics typeclass ghci haskell type-inference What Haskell Prelude Read Show show.read Exception Prelude.read What is going on when I compose "show" and "r...
[ -0.00970458984375, 0.0025787353515625, 0.0087890625, 0.038818359375, 0.00823974609375, 0.023193359375, 0.0037841796875, -0.013427734375, 0.005279541015625, 0.0086669921875, -0.0179443359375, -0.0283203125, 0.000823974609375, 0.006927490234375, 0.0012969970703125, -0.019775390625, -0....
[ 7730, 98, 3229, 150350, 31374, 136, 39116, 20625, 142508, 189534, 10644, 67413, 31380, 318, 1556, 69988, 1914, 822, 112, 4764, 17367, 7639, 63928, 4865, 87, 23, 16610, 527, 73265, 14, 12301, 41591, 19667, 61799, 19048, 10433, 12333, 67, 550...
[ 0.04779052734375, 0.05389404296875, 0.051513671875, 0.2156982421875, 0.26904296875, 0.1650390625, 0.2357177734375, 0.1260986328125, 0.244140625, 0.14208984375, 0.148681640625, 0.1182861328125, 0.0303192138671875, 0.0877685546875, 0.09228515625, 0.09075927734375, 0.046051025390625, ...
embed
36139011_c0
36139011
haskell
0
Title: How to remove module from &quot;target list&quot; in GHCi Problem title: How to remove module from &quot;target list&quot; in GHCi Tags: haskell, ghci Problem: How to remove module from "target list" in GHCi In GHCI, you can add modules from your current project using :add module , or you can add modules to the ...
How to remove module from &quot;target list&quot; in GHCi How to remove module from &quot;target list&quot; in GHCi haskell ghci How GHCi How to remove module from "target list" in GHCi In GHCI, you can add modules from your current project using :add module , or you can add modules to the current scope using :module +...
[ -0.00174713134765625, 0.005615234375, 0.00104522705078125, 0.028076171875, -0.00634765625, 0.007232666015625, -0.004486083984375, 0.00543212890625, -0.00469970703125, -0.033447265625, 0.01324462890625, -0.0458984375, -0.000713348388671875, -0.00909423828125, 0.00823974609375, -0.005889...
[ 11249, 87388, 88996, 1295, 867, 3794, 5303, 527, 73265, 14, 47, 1556, 142508, 31380, 318, 23, 41877, 17304, 15190, 43581, 13452, 4028, 70820, 152, 83279, 997, 72367, 191082, 456, 63033, 4527, 107, 75101, 31344, 53418, 173591, 98169, 27998, ...
[ 0.055908203125, 0.2374267578125, 0.258056640625, 0.1195068359375, 0.1436767578125, 0.1739501953125, 0.1700439453125, 0.0794677734375, 0.1220703125, 0.201416015625, 0.004791259765625, 0.09326171875, 0.1861572265625, 0.07861328125, 0.1190185546875, 0.035400390625, 0.1358642578125, 0....
embed
71281644_c0
71281644
haskell
0
Title: How can I demonstrate that a function space is not empty? Problem title: How can I demonstrate that a function space is not empty? Tags: haskell, is-empty Problem: How can I demonstrate that a function space is not empty? I declared a class of types that admits a value: class NonEmpty a where example :: a And al...
How can I demonstrate that a function space is not empty? How can I demonstrate that a function space is not empty? haskell is-empty Data.Void How NonEmpty Empty How can I demonstrate that a function space is not empty? I declared a class of types that admits a value: And also, I declared the complement class: Demonstr...
[ -0.00543212890625, -0.007354736328125, 0.012939453125, 0.00543212890625, -0.0247802734375, 0.01611328125, 0.007598876953125, -0.03271484375, 0.00122833251953125, 0.0194091796875, -0.00958251953125, 0.00102996826171875, 0.00732421875, -0.002777099609375, 0.004547119140625, 0.00772094726...
[ 11249, 831, 106804, 13, 450, 32354, 32628, 83, 959, 201505, 1556, 142508, 33548, 939, 11809, 36635, 532, 3775, 134332, 31678, 159978, 18507, 52895, 36456, 34292, 110633, 181810, 1916, 23468, 20625, 22027, 18, 2633, 765, 6097, 110527, 134477, ...
[ 0.07464599609375, 0.0213470458984375, 0.185302734375, 0.082275390625, 0.0148162841796875, 0.1715087890625, 0.21630859375, 0.081298828125, 0.164794921875, 0.2215576171875, 0.1170654296875, 0.2197265625, 0.1605224609375, 0.1004638671875, 0.1005859375, 0.12646484375, 0.0545654296875, ...
embed
44488637_c0
44488637
haskell
0
Title: Haskell pattern not matched [_] Problem title: Haskell pattern not matched [_] Tags: string, pattern-matching, list, haskell Problem: Haskell pattern not matched [_] I have been trying to make the following code work: {-# OPTIONS_GHC -fwarn-incomplete-patterns #-} import Data.List format :: String -> String form...
Haskell pattern not matched [_] Haskell pattern not matched [_] string pattern-matching list haskell Data.List Haskell OPTIONS_GHC a:b:xs b:xs Pattern Patterns Haskell pattern not matched [_] I have been trying to make the following code work: When I test with: I expect "ABC" as output. However, I'm getting an unusual ...
[ -0.0306396484375, -0.0033721923828125, 0.014892578125, 0.0208740234375, -0.01458740234375, 0.0091552734375, -0.00072479248046875, -0.0247802734375, 0.027099609375, 0.056396484375, 0.0184326171875, -0.04345703125, 0.005859375, -0.0191650390625, -0.0174560546875, 0.008056640625, 0.0106...
[ 20625, 142508, 103510, 959, 14858, 297, 454, 79315, 98753, 214, 5303, 1556, 11809, 154663, 28023, 165117, 41877, 441, 10, 12, 275, 425, 876, 9876, 22766, 31577, 25632, 18151, 4488, 3034, 678, 41206, 186944, 58, 237, 140992, 225073, 1631, 90...
[ 0.138427734375, 0.22607421875, 0.2176513671875, 0.1348876953125, 0.2060546875, 0.102783203125, 0.0863037109375, 0.1402587890625, 0.1824951171875, 0.049224853515625, 0.1016845703125, 0.127685546875, 0.0498046875, 0.0537109375, 0.135498046875, 0.00341796875, 0.065185546875, 0.0116271...
embed
4676645_c1
4676645
haskell
1
2s :: [Double] theMax = maximum dots :: Double main :: IO () main = putStrLn $ "theMax: " ++ show theMax When I compile with ghc 6.12.1 (ubuntu linux on an i486 machine) ghc --make -O2 Vec.hs -prof -auto-all -fforce-recomp and run Vec +RTS -p Looking at the Vec.prof file, COST CENTRE MODULE %time %alloc v2s Main 30.9 3...
2s :: [Double] theMax = maximum dots :: Double main :: IO () main = putStrLn $ "theMax: " ++ show theMax When I compile with ghc 6.12.1 (ubuntu linux on an i486 machine) ghc --make -O2 Vec.hs -prof -auto-all -fforce-recomp and run Vec +RTS -p Looking at the Vec.prof file, COST CENTRE MODULE %time %alloc v2s Main 30.9 3...
[ 0.004302978515625, 0.0189208984375, 0.00115966796875, -0.01123046875, 0.0002765655517578125, 0.0191650390625, -0.00982666015625, -0.01104736328125, 0.0027313232421875, -0.0267333984375, -0.006317138671875, -0.0017242431640625, -0.01031494140625, -0.0277099609375, -0.016845703125, -0.00...
[ 116, 7, 1984, 8331, 34, 2661, 70, 71346, 2203, 38132, 54, 933, 107172, 5201, 17780, 3884, 71713, 3650, 2347, 37223, 7639, 9969, 1340, 31380, 238, 91532, 68107, 198996, 11508, 6077, 159645, 36279, 670, 304, 52884, 127, 3454, 420, 8913, 558...
[ 0.1619873046875, 0.104736328125, 0.012603759765625, 0.031341552734375, 0.0748291015625, 0.101806640625, 0.18994140625, 0.2406005859375, 0.007904052734375, 0.16796875, 0.1412353515625, 0.0751953125, 0.1370849609375, 0.15087890625, 0.164306640625, 0.09747314453125, 0.017669677734375, ...
embed
30816994_c0
30816994
haskell
0
Title: How to improve the performance of Haskell IO? Problem title: How to improve the performance of Haskell IO? Tags: haskell, io Problem: How to improve the performance of Haskell IO? It seems that Haskell's IO is relatively slow. For example, comparing Haskell with Python #io.py import sys s=sys.stdin.read() sys.st...
How to improve the performance of Haskell IO? How to improve the performance of Haskell IO? haskell io sys How Haskell io.py sys.stdin.read sys.stdout.write io.hs gen.py How to improve the performance of Haskell IO? It seems that Haskell's IO is relatively slow. For example, comparing Haskell with Python , Their perfor...
[ -0.00787353515625, 0.00787353515625, -0.005401611328125, -0.0184326171875, 0.0062255859375, -0.01434326171875, -0.004669189453125, -0.02099609375, -0.0123291015625, -0.00665283203125, 0.0172119140625, -0.0205078125, 0.01123046875, -0.0023956298828125, -0.00323486328125, -0.021362304687...
[ 11249, 47, 52295, 23718, 20625, 142508, 17780, 1556, 22995, 954, 6493, 271, 3035, 39116, 246, 1003, 434, 18781, 127, 9226, 111, 37202, 25, 7, 83, 35845, 72803, 37397, 678, 145581, 1409, 33022, 112733, 92, 2053, 3934, 6138, 11389, 1632, 20...
[ 0.10687255859375, 0.08203125, 0.2117919921875, 0.2113037109375, 0.1900634765625, 0.288330078125, 0.2490234375, 0.163818359375, 0.2215576171875, 0.1112060546875, 0.1519775390625, 0.0780029296875, 0.1138916015625, 0.1466064453125, 0.0623779296875, 0.1483154296875, 0.036651611328125, ...
embed
60538257_c0
60538257
haskell
0
Title: How do I return a list of merged tuples? Problem title: How do I return a list of merged tuples? Tags: haskell Problem: How do I return a list of merged tuples? Currently I have a list of tuples [ (1 , [1]) , (2 , [1]) , (3 , [1]) , (1 , [2]) , (3 , [2]) , (1 , [3]) ]. I'd like to return a list of [ (1 , [1,2,3]...
How do I return a list of merged tuples? How do I return a list of merged tuples? haskell How Ord Bool How do I return a list of merged tuples? Currently I have a list of tuples [ (1 , [1]) , (2 , [1]) , (3 , [1]) , (1 , [2]) , (3 , [2]) , (1 , [3]) ]. I'd like to return a list of [ (1 , [1,2,3]) , (2 , [1]) , (3 , [1,...
[ 0.0020294189453125, 0.01019287109375, 0.011962890625, 0.0152587890625, -0.00384521484375, 0.012451171875, -0.03125, -0.0172119140625, 0.00689697265625, 0.002777099609375, 0.00457763671875, 0.00994873046875, 0.003204345703125, 0.0179443359375, 0.004425048828125, -0.004608154296875, -0...
[ 11249, 87, 30646, 5303, 111, 42564, 71, 370, 99726, 54, 1556, 142508, 35379, 2460, 929, 10, 114063, 765, 2858, 4700, 6896, 1884, 47, 155761, 59121, 55300, 6626, 12765, 2174, 5117, 12830, 12638, 8705, 105950, 63134, 11675, 83, 647, 71723, ...
[ 0.1063232421875, 0.027862548828125, 0.22412109375, 0.2078857421875, 0.1014404296875, 0.2496337890625, 0.150634765625, 0.18798828125, 0.266357421875, 0.050628662109375, 0.1282958984375, 0.193115234375, 0.13916015625, 0.0438232421875, 0.1064453125, 0.0357666015625, 0.030364990234375, ...
embed
14397128_c0
14397128
haskell
0
Title: How does the flip function work? Problem title: How does the flip function work? Tags: haskell Problem: How does the flip function work? Haskell newbie here. I was going through Learn you a haskell, and came across this definition of the flip function. flip' :: (a -> b -> c) -> (b -> a -> c) flip' f = g where g ...
How does the flip function work? How does the flip function work? haskell How How does the flip function work? Haskell newbie here. I was going through Learn you a haskell, and came across this definition of the flip function. What I don't get is, where did x and y come from? I mean, the signature tells me that flip' i...
[ 0.01116943359375, 0.024658203125, 0.00286865234375, 0.003509521484375, -0.00130462646484375, 0.0267333984375, -0.01007080078125, -0.00897216796875, -0.0030670166015625, -0.0030364990234375, 0.0076904296875, -0.0084228515625, -0.018798828125, -0.01202392578125, 0.0037384033203125, -0.01...
[ 11249, 14602, 70, 147505, 32354, 4488, 1556, 142508, 20625, 3525, 9014, 3688, 134031, 398, 80934, 2301, 18, 2046, 7440, 6777, 1022, 136, 113, 1380, 1295, 138256, 14192, 25, 83, 51776, 76228, 6626, 171859, 30646, 4729, 678, 100094, 33022, 60...
[ 0.1240234375, 0.1171875, 0.0863037109375, 0.278564453125, 0.232177734375, 0.18701171875, 0.106201171875, 0.22021484375, 0.10565185546875, 0.00946044921875, 0.0743408203125, 0.000701904296875, 0.0537109375, 0.0261688232421875, 0.137451171875, 0.0302734375, 0.00909423828125, 0.070312...
embed
18562881_c1
18562881
haskell
1
member_function()' ../CPlusPlusBinding/c-src/libA_C.a(A_C.o): In function `A_new': ../CPlusPlusBinding/c-src/A_C.cpp:10:0: undefined reference to `operator new(unsigned long)' collect2: error: ld returned 1 exit status Running cabal configure , and cabal build will compile the C++ and C bindings and reproduce the error...
member_function()' ../CPlusPlusBinding/c-src/libA_C.a(A_C.o): In function `A_new': ../CPlusPlusBinding/c-src/A_C.cpp:10:0: undefined reference to `operator new(unsigned long)' collect2: error: ld returned 1 exit status Running cabal configure , and cabal build will compile the C++ and C bindings and reproduce the error...
[ 0.00136566162109375, 0.0030059814453125, 0.006622314453125, -0.0125732421875, -0.00506591796875, -0.011962890625, 0.0106201171875, 0.01544189453125, -0.007354736328125, -0.00634765625, -0.03076171875, -0.03173828125, 0.01495361328125, 0.0185546875, 0.013427734375, -0.0140380859375, -...
[ 32786, 137175, 441, 88225, 16882, 33770, 19437, 5612, 284, 11, 31, 32354, 54936, 6366, 15110, 53861, 9232, 5983, 91067, 206469, 3525, 309, 31304, 4989, 43799, 304, 18499, 71, 176377, 106, 82230, 10778, 28398, 109524, 222495, 45367, 9969, 1340...
[ 0.267822265625, 0.1834716796875, 0.05621337890625, 0.1944580078125, 0.1356201171875, 0.1728515625, 0.10009765625, 0.057769775390625, 0.13818359375, 0.041748046875, 0.112060546875, 0.18359375, 0.2030029296875, 0.1226806640625, 0.034149169921875, 0.11083984375, 0.0286407470703125, 0....
embed
2585344_c0
2585344
haskell
0
Title: Haskell as REST server Problem title: Haskell as REST server Tags: service, haskell, rest Problem: Haskell as REST server I would like to try Haskell on a smallish project which should be well suited to it. I would like to use it as a backend to a small ajax application. Haskell backend should be able to do auth...
Haskell as REST server Haskell as REST server service haskell rest Haskell REST Haskell as REST server I would like to try Haskell on a smallish project which should be well suited to it. I would like to use it as a backend to a small ajax application. Haskell backend should be able to do authentication (basic, form, w...
[ -0.0208740234375, 0.020263671875, 0.01153564453125, -0.005523681640625, -0.0130615234375, 0.006195068359375, -0.00408935546875, -0.004302978515625, 0.0069580078125, -0.032958984375, 0.0027923583984375, -0.019287109375, -0.0013275146484375, 0.0203857421875, -0.007568359375, -0.004119873...
[ 20625, 142508, 237, 627, 21828, 10723, 4516, 1556, 10588, 2806, 1884, 9790, 98, 19336, 4745, 13452, 5608, 5299, 14947, 4527, 4420, 3611, 7767, 425, 38415, 19048, 54, 195734, 402, 3173, 89778, 13695, 28560, 38937, 56002, 10869, 2053, 58580, ...
[ 0.18310546875, 0.28564453125, 0.135986328125, 0.133056640625, 0.2137451171875, 0.2027587890625, 0.1317138671875, 0.168212890625, 0.20849609375, 0.048614501953125, 0.07611083984375, 0.14501953125, 0.05303955078125, 0.1226806640625, 0.110107421875, 0.09808349609375, 0.0709228515625, ...
embed
53919450_c0
53919450
haskell
0
Title: How to add a monad transformer into a Spock app? Problem title: How to add a monad transformer into a Spock app? Tags: haskell-spock, monads, monad-transformers, haskell Problem: How to add a monad transformer into a Spock app? I have a basic hello world Spock app from following the tutorial , but now I want to ...
How to add a monad transformer into a Spock app? How to add a monad transformer into a Spock app? haskell-spock monads monad-transformers haskell How Spock FooT SpockCfg SpockM StateT How to add a monad transformer into a Spock app? I have a basic hello world Spock app from following the tutorial , but now I want to ad...
[ -0.015625, 0.00823974609375, -0.004150390625, -0.007354736328125, -0.00982666015625, -0.01275634765625, -0.0000591278076171875, -0.0147705078125, 0.0021209716796875, -0.048095703125, 0.02392578125, -0.01275634765625, -0.0286865234375, -0.005126953125, 0.003936767578125, -0.005554199218...
[ 11249, 47, 15190, 2667, 712, 27198, 56, 3934, 23172, 2594, 4027, 1556, 142508, 11955, 215175, 1314, 9572, 31, 618, 420, 177, 594, 22836, 10, 62822, 33600, 8999, 57143, 10002, 177261, 5732, 11814, 42850, 11389, 32354, 51776, 136, 347, 10750,...
[ 0.07208251953125, 0.006927490234375, 0.1859130859375, 0.145263671875, 0.2056884765625, 0.2423095703125, 0.1632080078125, 0.1396484375, 0.1851806640625, 0.1898193359375, 0.232177734375, 0.058837890625, 0.176025390625, 0.12060546875, 0.1964111328125, 0.039825439453125, 0.149658203125, ...
embed
70405363_c0
70405363
haskell
0
Title: Cut a string into a list of strings with &#x27;.&#x27; Problem title: Cut a string into a list of strings with &#x27;.&#x27; Tags: list, haskell Problem: Cut a string into a list of strings with '.' I have to write a cutString :: String -> [String] function that has to cut a string into a list of strings. It sho...
Cut a string into a list of strings with &#x27;.&#x27; Cut a string into a list of strings with &#x27;.&#x27; list haskell Cut this.is.a.string x:xs Cut a string into a list of strings with '.' I have to write a cutString :: String -> [String] function that has to cut a string into a list of strings. It should cut at t...
[ 0.0172119140625, 0.0177001953125, 0.0036163330078125, 0.0177001953125, 0.006591796875, 0.0087890625, -0.00274658203125, -0.0137939453125, 0.002716064453125, 0.00433349609375, -0.015869140625, -0.0155029296875, -0.0130615234375, 0.000720977783203125, -0.00738525390625, 0.01373291015625,...
[ 3003, 18, 79315, 3934, 5303, 111, 7, 678, 6, 54764, 425, 3768, 5, 1556, 142508, 903, 164, 11, 91693, 1022, 12, 10, 242, 87, 765, 33022, 59226, 71713, 214, 1984, 23351, 33079, 378, 32354, 5608, 99, 25, 124850, 1326, 27781, 1061, 2060, ...
[ 0.2216796875, 0.07293701171875, 0.2646484375, 0.184326171875, 0.2091064453125, 0.0599365234375, 0.023956298828125, 0.0777587890625, 0.03167724609375, 0.03155517578125, 0.1226806640625, 0.158447265625, 0.1893310546875, 0.1146240234375, 0.23388671875, 0.157958984375, 0.1507568359375, ...
embed
32286489_c0
32286489
haskell
0
Title: How to import module hiding submodules or instances? Problem title: How to import module hiding submodules or instances? Tags: module, import, haskell Problem: How to import module hiding submodules or instances? With this code import Control.Monad import Control.Applicative import Control.Monad.State class DefV...
How to import module hiding submodules or instances? How to import module hiding submodules or instances? module import haskell Control.Monad.Trans.Error.Error Control.Monad.Trans.Error module Control.Monad Control.Applicative Control.Monad.State haskell How DefVal Alternative Either Left MonadPlus ErrString Show Defau...
[ -0.011962890625, -0.007476806640625, -0.00909423828125, 0.017333984375, 0.00020313262939453125, -0.0035552978515625, -0.00396728515625, -0.02392578125, 0.00193023681640625, -0.00994873046875, -0.018798828125, -0.025390625, 0.018310546875, 0.00946044921875, 0.003173828125, -0.0137329101...
[ 11249, 24927, 88996, 1274, 6238, 1614, 83279, 110527, 90, 707, 1556, 142508, 27131, 46674, 712, 62624, 18468, 31611, 11048, 135206, 85535, 42272, 103905, 2480, 60331, 71, 88225, 1004, 42, 71713, 17367, 262, 1021, 212059, 52721, 5983, 5201, 12...
[ 0.05352783203125, 0.251953125, 0.24658203125, 0.1678466796875, 0.130859375, 0.1707763671875, 0.177001953125, 0.1715087890625, 0.023956298828125, 0.0250396728515625, 0.07464599609375, 0.2103271484375, 0.176513671875, 0.07061767578125, 0.122802734375, 0.1319580078125, 0.0889892578125, ...
embed
35419908_c1
35419908
haskell
1
7.62 ns (27.21 ns .. 28.05 ns) std dev 1.391 ns (1.154 ns .. 1.744 ns) variance introduced by outliers: 73% (severely inflated) The mean execution time of simply taking the first and last elements and dividing them is ~27ns. Dropping the first 9 elements and performing the same operation has a mean of ~85ms or 3000x sl...
7.62 ns (27.21 ns .. 28.05 ns) std dev 1.391 ns (1.154 ns .. 1.744 ns) variance introduced by outliers: 73% (severely inflated) The mean execution time of simply taking the first and last elements and dividing them is ~27ns. Dropping the first 9 elements and performing the same operation has a mean of ~85ms or 3000x sl...
[ -0.006591796875, -0.00433349609375, -0.0208740234375, 0.00726318359375, 0.007415771484375, 0.006622314453125, 0.000789642333984375, -0.029296875, 0.00634765625, -0.035888671875, -0.005645751953125, 0.0130615234375, -0.0196533203125, -0.00787353515625, -0.01190185546875, -0.006378173828...
[ 2861, 10837, 1779, 65323, 3117, 1468, 12511, 6138, 71, 33245, 155420, 16757, 3956, 65508, 1810, 150, 1314, 11587, 115044, 41036, 29459, 71924, 1733, 42856, 35971, 5117, 136, 4568, 80854, 61998, 449, 2856, 3768, 46193, 26783, 483, 51339, 5701,...
[ 0.028564453125, 0.1246337890625, 0.1324462890625, 0.06365966796875, 0.0204620361328125, 0.009765625, 0.0262451171875, 0.125244140625, 0.0699462890625, 0.15625, 0.0919189453125, 0.1890869140625, 0.00750732421875, 0.0703125, 0.12548828125, 0.129150390625, 0.07080078125, 0.11267089843...
embed
1513020_c0
1513020
haskell
0
Title: How do I do python-style indent/dedent tokens with alex/haskell? Problem title: How do I do python-style indent/dedent tokens with alex/haskell? Tags: parsing, haskell Problem: How do I do python-style indent/dedent tokens with alex/haskell? I'm writing a lexer for a small language in Alex with Haskell. The lang...
How do I do python-style indent/dedent tokens with alex/haskell? How do I do python-style indent/dedent tokens with alex/haskell? parsing haskell How How do I do python-style indent/dedent tokens with alex/haskell? I'm writing a lexer for a small language in Alex with Haskell. The language is specified to have pythones...
[ 0.004852294921875, -0.01275634765625, 0.01068115234375, 0.0157470703125, -0.00946044921875, 0.0135498046875, 0.0034637451171875, 0.00384521484375, 0.0062255859375, -0.0206298828125, 0.0225830078125, 0.0135498046875, -0.0177001953125, 0.01483154296875, 0.00396728515625, 0.00479125976562...
[ 11249, 54, 17198, 50828, 40946, 18597, 18, 64, 112, 37379, 47, 84694, 678, 662, 425, 10557, 142508, 366, 6953, 1556, 32562, 95, 34058, 19336, 46876, 20984, 20625, 58735, 765, 105397, 88551, 22062, 51383, 20157, 1098, 1514, 397, 53225, 21768...
[ 0.05780029296875, 0.07586669921875, 0.1226806640625, 0.1573486328125, 0.1817626953125, 0.1956787109375, 0.1544189453125, 0.05352783203125, 0.1556396484375, 0.2156982421875, 0.111328125, 0.197509765625, 0.0882568359375, 0.10595703125, 0.1468505859375, 0.1026611328125, 0.2315673828125,...
embed