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
47058601_c0
47058601
haskell
0
Title: Making ToJSON use Show Instance Problem title: Making ToJSON use Show Instance Tags: haskell, aeson Problem: Making ToJSON use Show Instance If I have a data type that looks like this: data SumType = ABC | DEF deriving (Generic, ToJSON) data MyType = MyType {field1 :: String, field2 :: SumType} deriving (Generic...
Making ToJSON use Show Instance Making ToJSON use Show Instance haskell aeson Making ToJSON Show Instance SumType ABC Generic MyType field1 field2 field3 Making ToJSON use Show Instance If I have a data type that looks like this: The above will generate a JSON that looks like: {"field1": "blah", "field2":"ABC"} In prac...
[ -0.0177001953125, 0.0064697265625, 0.0240478515625, 0.01904296875, -0.011474609375, -0.003875732421875, -0.002685546875, 0.0255126953125, 0.016357421875, 0.0177001953125, -0.017333984375, 0.01611328125, 0.00604248046875, 0.01458740234375, -0.00531005859375, 0.00823974609375, -0.00836...
[ 13676, 717, 1375, 58627, 4527, 17367, 360, 116071, 1556, 142508, 10, 90, 191, 36335, 196707, 47457, 88342, 2646, 44457, 418, 304, 363, 2053, 10644, 33342, 1884, 36917, 139392, 821, 28394, 275, 1566, 186944, 41361, 180663, 27140, 13695, 126596...
[ 0.082275390625, 0.1888427734375, 0.1912841796875, 0.2154541015625, 0.099609375, 0.2529296875, 0.079345703125, 0.2235107421875, 0.125244140625, 0.1968994140625, 0.0518798828125, 0.0704345703125, 0.1195068359375, 0.1873779296875, 0.267333984375, 0.123046875, 0.109619140625, 0.1383056...
embed
57470639_c0
57470639
haskell
0
Title: f, g, h :: Kleisli ((->) e) a b <=> f >>> (g &&& h) = (f >>> g) &&& (f >>> h)? Problem title: f, g, h :: Kleisli ((->) e) a b <=> f >>> (g &&& h) = (f >>> g) &&& (f >>> h)? Tags: kleisli, monad...
f, g, h :: Kleisli ((->) e) a b <=> f >>> (g &&& h) = (f >>> g) &&& (f >>> h)? f, g, h :: Kleisli ((->) e) a b <=> f >>> (g &&& h) = (f >>> g) &&& (f >>> h)? kleisli monads haskell reader-monad arrow-...
[ 0.0120849609375, 0.006378173828125, 0.01092529296875, 0.01202392578125, -0.0135498046875, 0.00872802734375, 0.00119781494140625, -0.005462646484375, 0.01104736328125, 0.00823974609375, 0.002197265625, 0.045654296875, -0.0130615234375, 0.00457763671875, 0.02099609375, 0.0024871826171875...
[ 1238, 706, 1096, 1984, 24798, 164, 150, 9, 28, 10, 876, 420, 4, 60494, 18945, 2667, 712, 1556, 142508, 155255, 3796, 118201, 2055, 7, 117474, 527, 73265, 14, 11321, 49068, 571, 8031, 60331, 71, 103607, 58142, 1230, 1401, 1221, 11782, 91...
[ 0.20361328125, 0.186279296875, 0.1741943359375, 0.0361328125, 0.1787109375, 0.1513671875, 0.267333984375, 0.01019287109375, 0.1534423828125, 0.048248291015625, 0.1319580078125, 0.1708984375, 0.042236328125, 0.002227783203125, 0.1273193359375, 0.05694580078125, 0.09979248046875, 0.0...
embed
15807687_c0
15807687
haskell
0
Title: Haskell inheriting type classes Problem title: Haskell inheriting type classes Tags: typeclass, ghc, haskell Problem: Haskell inheriting type classes Suppose I have the following class: class P a where nameOf :: a -> String I would like to declare that all instances of this class are automatically instances of S...
Haskell inheriting type classes Haskell inheriting type classes typeclass ghc haskell Haskell Show UndecidableInstances Double Haskell inheriting type classes Suppose I have the following class: I would like to declare that all instances of this class are automatically instances of Show . My first attempt would be the ...
[ -0.004608154296875, -0.006195068359375, 0.0125732421875, 0.02001953125, -0.01507568359375, 0.00909423828125, -0.0028839111328125, -0.0174560546875, 0.004058837890625, -0.0224609375, 0.00045013427734375, -0.01519775390625, 0.0234375, 0.019287109375, -0.01806640625, -0.004608154296875, ...
[ 20625, 142508, 23, 86151, 10644, 61112, 67413, 31380, 238, 1556, 17367, 79912, 24750, 2661, 116071, 107172, 25632, 18507, 1884, 159978, 756, 110527, 191082, 111, 5117, 81887, 131101, 152131, 18, 1631, 982, 46876, 111938, 30745, 101089, 110677, ...
[ 0.1219482421875, 0.2310791015625, 0.030914306640625, 0.1939697265625, 0.1966552734375, 0.20361328125, 0.15185546875, 0.048797607421875, 0.04840087890625, 0.10986328125, 0.252197265625, 0.084716796875, 0.1773681640625, 0.1363525390625, 0.2113037109375, 0.2127685546875, 0.0284118652343...
embed
24718873_c0
24718873
haskell
0
Title: Downloading large files from the Internet in Haskell Problem title: Downloading large files from the Internet in Haskell Tags: network-programming, haskell, http-conduit Problem: Downloading large files from the Internet in Haskell Are there any suggestions about how to download large files in Haskell? I figure ...
Downloading large files from the Internet in Haskell Downloading large files from the Internet in Haskell network-programming haskell http-conduit the Data.Conduit.Binary Network.HTTP.Conduit qualified Downloading Internet Haskell Data.Conduit google.com google.html Downloading large files from the Internet in Haskell ...
[ -0.0069580078125, 0.0157470703125, 0.02001953125, 0.01239013671875, 0.0103759765625, 0.00823974609375, -0.0224609375, -0.012451171875, 0.004364013671875, -0.01220703125, 0.00982666015625, -0.032958984375, -0.005126953125, 0.0123291015625, 0.003143310546875, 0.00732421875, -0.00338745...
[ 4857, 214, 21334, 102158, 1295, 2665, 23, 20625, 142508, 33120, 28966, 1556, 1621, 2271, 112061, 70, 11809, 11935, 571, 73, 6635, 28997, 18544, 23658, 217225, 26484, 277, 157666, 3642, 47, 7026, 26366, 572, 3062, 254, 5, 83, 35773, 1294, ...
[ 0.1986083984375, 0.0699462890625, 0.19091796875, 0.19287109375, 0.1126708984375, 0.167236328125, 0.1173095703125, 0.16748046875, 0.279541015625, 0.08477783203125, 0.0704345703125, 0.153076171875, 0.1015625, 0.0731201171875, 0.2218017578125, 0.00738525390625, 0.0859375, 0.0974121093...
embed
29342974_c0
29342974
haskell
0
Title: Implementing a list of Ints in Scala's case classes not working Problem title: Implementing a list of Ints in Scala's case classes not working Tags: haskell, list, scala Problem: Implementing a list of Ints in Scala's case classes not working Why do I get an error when trying to implement a linked list...
Implementing a list of Ints in Scala's case classes not working Implementing a list of Ints in Scala's case classes not working haskell list scala Implementing Ints Scala Data List Cons Nil Show List1 acc.head acc.tail Implementing a list of Ints in Scala's case classes not working Why do I get an error when ...
[ 0.0079345703125, 0.01953125, 0.0026397705078125, -0.00567626953125, 0.000774383544921875, 0.01092529296875, -0.012939453125, -0.006500244140625, -0.0037078857421875, -0.02490234375, 0.01141357421875, -0.00579833984375, 0.0244140625, 0.004791259765625, 0.00958251953125, -0.0029754638671...
[ 153941, 5303, 360, 933, 23, 152653, 11, 3768, 7225, 61112, 959, 20697, 1556, 142508, 146232, 11809, 32036, 39215, 77175, 17367, 418, 50015, 31251, 46741, 18499, 31577, 29479, 3126, 16031, 20625, 85590, 96760, 18151, 3934, 114453, 11782, 5, 90...
[ 0.208740234375, 0.175537109375, 0.1575927734375, 0.188232421875, 0.04302978515625, 0.199951171875, 0.1588134765625, 0.05706787109375, 0.19482421875, 0.2335205078125, 0.1097412109375, 0.1412353515625, 0.083984375, 0.1949462890625, 0.1873779296875, 0.042205810546875, 0.154541015625, ...
embed
74239832_c1
74239832
haskell
1
@(ExcerptNode x (Left xls)) b@(ExcerptNode y (Left yls)) = if x == y then [ExcerptNode x (Left (mergeExcerpts xls yls))] else [a, b] mergeExcerpts :: Excerpt -> Excerpt -> Excerpt mergeExcerpts (Excerpt []) (Excerpt y) = Excerpt y mergeExcerpts (Excerpt x) (Excerpt []) = Excerpt x mergeExcerpts (Excerpt a) (Excerpt b) ...
@(ExcerptNode x (Left xls)) b@(ExcerptNode y (Left yls)) = if x == y then [ExcerptNode x (Left (mergeExcerpts xls yls))] else [a, b] mergeExcerpts :: Excerpt -> Excerpt -> Excerpt mergeExcerpts (Excerpt []) (Excerpt y) = Excerpt y mergeExcerpts (Excerpt x) (Excerpt []) = Excerpt x mergeExcerpts (Excerpt a) (Excerpt b) ...
[ 0.0198974609375, -0.002593994140625, 0.0118408203125, -0.007537841796875, 0.005126953125, 0.015380859375, -0.0164794921875, -0.0216064453125, 0.022216796875, 0.0247802734375, -0.0155029296875, 0.0155029296875, 0.0274658203125, -0.01513671875, 0.0103759765625, -0.0213623046875, 0.0030...
[ 1374, 19279, 3443, 6328, 5021, 112, 1022, 5267, 2480, 8080, 876, 981, 113, 2203, 2174, 69112, 7068, 378, 1991, 429, 37076, 42564, 1984, 110823, 56, 33079, 10, 3650, 154663, 988, 4778, 4153, 188, 12096, 92595, 37223, 7 ]
[ 0.1524658203125, 0.1134033203125, 0.255615234375, 0.15234375, 0.183349609375, 0.12548828125, 0.1771240234375, 0.02325439453125, 0.100341796875, 0.1358642578125, 0.156005859375, 0.09637451171875, 0.1444091796875, 0.0782470703125, 0.1678466796875, 0.23046875, 0.04736328125, 0.0132446...
embed
13264417_c0
13264417
haskell
0
Title: Bug? ByteString function returning quotation mark upon calling it Problem title: Bug? ByteString function returning quotation mark upon calling it Tags: haskell Problem: Bug? ByteString function returning quotation mark upon calling it Ive got two two functions which act on byte strings. The first one is a bytes...
Bug? ByteString function returning quotation mark upon calling it Bug? ByteString function returning quotation mark upon calling it haskell qualified Bug ByteString Data.ByteString Cycle B.ByteString B.null B.append Rotate B.take B.length B.drop Main B.readFile test.dat CInterrupted Bug? ByteString function returning q...
[ 0.03857421875, -0.003326416015625, 0.0030059814453125, -0.003387451171875, -0.024658203125, -0.000827789306640625, -0.0033721923828125, -0.0091552734375, -0.001434326171875, 0.0142822265625, -0.0106201171875, 0.005340576171875, -0.005889892578125, 0.007049560546875, -0.006317138671875, ...
[ 57279, 32, 3311, 67, 71713, 214, 32354, 30646, 81732, 1363, 16188, 54799, 159029, 442, 1556, 142508, 217225, 11809, 75358, 151612, 335, 139550, 9007, 146283, 78219, 23986, 138810, 12321, 5, 39116, 174350, 3034, 5164, 313, 44851, 9167, 6626, 2...
[ 0.1912841796875, 0.044647216796875, 0.134521484375, 0.1417236328125, 0.2333984375, 0.1298828125, 0.1983642578125, 0.188232421875, 0.2222900390625, 0.090576171875, 0.16943359375, 0.072998046875, 0.1942138671875, 0.094482421875, 0.120849609375, 0.2109375, 0.1624755859375, 0.104125976...
embed
15047775_c0
15047775
haskell
0
Title: Do Hask or Agda have equalisers? Problem title: Do Hask or Agda have equalisers? Tags: haskell, category-theory, agda Problem: Do Hask or Agda have equalisers? I was somewhat undecided as to whether this was a math.SE question or an SO one, but I suspect that mathematicians in general are fairly unlikely to know...
Do Hask or Agda have equalisers? Do Hask or Agda have equalisers? haskell category-theory agda Hask Agda Do Hask or Agda have equalisers? I was somewhat undecided as to whether this was a math.SE question or an SO one, but I suspect that mathematicians in general are fairly unlikely to know or care much about this cate...
[ 0.030517578125, 0.0016632080078125, 0.00188446044921875, -0.006561279296875, -0.0146484375, -0.0205078125, 0.0031585693359375, -0.0133056640625, 0.0027923583984375, -0.052001953125, -0.02734375, 0.002777099609375, 0.0081787109375, 0.0052490234375, -0.0145263671875, -0.00085830688476562...
[ 1391, 1042, 707, 12342, 85, 765, 105950, 20995, 7, 1556, 142508, 95487, 2347, 30675, 1377, 984, 104024, 48909, 9127, 15969, 92610, 13, 47148, 4537, 5062, 3714, 517, 20625, 77848, 38742, 40715, 20697, 6528, 48353, 6495, 60892, 756, 94418, 17...
[ 0.1878662109375, 0.212890625, 0.0692138671875, 0.1676025390625, 0.1839599609375, 0.060333251953125, 0.1912841796875, 0.189208984375, 0.0833740234375, 0.1097412109375, 0.2110595703125, 0.141845703125, 0.00830078125, 0.001861572265625, 0.1065673828125, 0.006256103515625, 0.033477783203...
embed
37912882_c1
37912882
haskell
1
) Using these data types, I define a lookup function using some sort of existential quantification (type Ex2 ): data Ex2 (p :: k -> k' -> *) where Ex2 :: p e i -> Ex2 p lookupEnv :: Lookup s env ~ 'Just t => Sing s -> Env env -> Ex2 Exp lookupEnv s (Cons (s',e) env) = case s %:== s' of STrue -> Ex2 e SFalse -> lookupEn...
) Using these data types, I define a lookup function using some sort of existential quantification (type Ex2 ): data Ex2 (p :: k -> k' -> *) where Ex2 :: p e i -> Ex2 p lookupEnv :: Lookup s env ~ 'Just t => Sing s -> Env env -> Ex2 Exp lookupEnv s (Cons (s',e) env) = case s %:== s' of STrue -> Ex2 e SFalse -> lookupEn...
[ -0.0186767578125, -0.000010192394256591797, 0.0016326904296875, 0.0011138916015625, 0.00775146484375, -0.00830078125, -0.0030059814453125, 0.01519775390625, 0.00982666015625, 0.01446533203125, 0.0140380859375, 0.0031890869140625, -0.00189971923828125, -0.024658203125, 0.0028228759765625,...
[ 345, 6097, 2053, 52895, 61924, 6713, 2037, 32354, 17368, 12096, 99707, 15403, 55230, 41274, 50986, 5443, 304, 254, 1984, 472, 661, 28, 17, 915, 7768, 334, 60818, 91, 22, 127794, 808, 53427, 357, 60075, 11935, 13, 7225, 1745, 69112, 111, ...
[ 0.03143310546875, 0.011199951171875, 0.1529541015625, 0.1744384765625, 0.176513671875, 0.167724609375, 0.179931640625, 0.17919921875, 0.0006103515625, 0.00872802734375, 0.1983642578125, 0.10302734375, 0.134521484375, 0.133056640625, 0.1529541015625, 0.1729736328125, 0.1741943359375, ...
embed
40820093_c0
40820093
haskell
0
Title: Haskell: head . mergeSort (for min element) in linear time? Problem title: Haskell: head . mergeSort (for min element) in linear time? Tags: sorting, mergesort, lazy-evaluation, haskell Problem: Haskell: head . mergeSort (for min element) in linear time? In the HaskellWiki https://wiki.haskell.org/Performance/La...
Haskell: head . mergeSort (for min element) in linear time? Haskell: head . mergeSort (for min element) in linear time? sorting mergesort lazy-evaluation haskell Haskell merge_sort Ord x:t y:u x:eacc x:x Haskell: head . mergeSort (for min element) in linear time? In the HaskellWiki https://wiki.haskell.org/Performance/...
[ 0.0068359375, 0.021484375, 0.0257568359375, -0.0194091796875, 0.0091552734375, 0.007781982421875, 0.0169677734375, -0.012451171875, 0.028076171875, -0.0185546875, 0.007568359375, 0.03173828125, 0.0196533203125, -0.00009822845458984375, 0.0133056640625, -0.0194091796875, -0.0140991210...
[ 20625, 142508, 10336, 5, 42564, 158240, 18, 881, 12830, 23, 192617, 1733, 2472, 12096, 62351, 21, 3285, 159258, 1556, 35379, 113, 34, 1022, 10060, 147822, 10557, 5037, 2729, 708, 7432, 65508, 32354, 351, 143, 5117, 765, 195625, 81993, 8216,...
[ 0.1387939453125, 0.218017578125, 0.210205078125, 0.014251708984375, 0.285888671875, 0.2283935546875, 0.104248046875, 0.20849609375, 0.1732177734375, 0.02972412109375, 0.2000732421875, 0.1612548828125, 0.0151214599609375, 0.1976318359375, 0.267822265625, 0.0880126953125, 0.14123535156...
embed
27623260_c0
27623260
haskell
0
Title: How to define settable lens Problem title: How to define settable lens Tags: haskell, haskell-lens Problem: How to define settable lens I have a record type in my Haskell code to which I want to define a lens that can be used as a getter and as a setter. The code looks like this: data Players = Players { _white ...
How to define settable lens How to define settable lens haskell haskell-lens a How Players _white Player _black Show _byColor Color White Black Access Game _players Contravariant Identity Possible How to define settable lens I have a record type in my Haskell code to which I want to define a lens that can be used as a ...
[ -0.0079345703125, -0.00946044921875, -0.006317138671875, 0.000514984130859375, 0.003448486328125, 0.0087890625, -0.020751953125, 0.00494384765625, 0.0031280517578125, -0.01507568359375, 0.0027923583984375, 0.048095703125, -0.0013275146484375, 0.004638671875, -0.00127410888671875, 0.009...
[ 11249, 61924, 9615, 2886, 3098, 7, 1556, 142508, 9, 1977, 10, 60560, 148477, 151675, 17367, 1272, 10625, 1484, 51193, 22392, 10074, 40266, 13547, 139570, 45380, 162591, 71257, 2481, 115861, 17164, 10644, 20625, 18151, 11814, 2046, 720, 88685, ...
[ 0.03472900390625, 0.2047119140625, 0.2203369140625, 0.2293701171875, 0.227294921875, 0.099365234375, 0.127197265625, 0.2210693359375, 0.00152587890625, 0.2177734375, 0.022247314453125, 0.1492919921875, 0.1522216796875, 0.145263671875, 0.1470947265625, 0.0992431640625, 0.11767578125, ...
embed
27028986_c0
27028986
haskell
0
Title: What are the steps for deducing this pointfree code? Problem title: What are the steps for deducing this pointfree code? Tags: pointfree, lifting, haskell Problem: What are the steps for deducing this pointfree code? I was reviewing some code and came across the following gem, which I'd wager is a copy-paste of ...
What are the steps for deducing this pointfree code? What are the steps for deducing this pointfree code? pointfree lifting haskell Control.Monad What liftM2 Battleship Show GHCI What are the steps for deducing this pointfree code? I was reviewing some code and came across the following gem, which I'd wager is a copy-p...
[ 0.005615234375, 0.027587890625, 0.002288818359375, 0.0101318359375, 0.00830078125, -0.0021820068359375, 0.0194091796875, -0.01007080078125, 0.0135498046875, -0.0079345703125, -0.0152587890625, 0.0002079010009765625, -0.0027923583984375, 0.0028076171875, -0.0301513671875, 0.001396179199...
[ 98441, 8, 39367, 214, 903, 6275, 32087, 18151, 177691, 1556, 142508, 27131, 46674, 712, 60520, 594, 304, 99381, 16070, 17367, 41877, 17304, 30203, 134665, 140992, 5775, 31, 1909, 73342, 44841, 112892, 18929, 1295, 176866, 876, 47, 1573, 113, ...
[ 0.1614990234375, 0.1123046875, 0.2056884765625, 0.042327880859375, 0.0523681640625, 0.110595703125, 0.21435546875, 0.1749267578125, 0.1844482421875, 0.05670166015625, 0.1949462890625, 0.171630859375, 0.071533203125, 0.156494140625, 0.1639404296875, 0.10198974609375, 0.1348876953125, ...
embed
60126107_c0
60126107
haskell
0
Title: What is the previous value of a monadic computation in the function context? Problem title: What is the previous value of a monadic computation in the function context? Tags: functional-programming, haskell, monads Problem: What is the previous value of a monadic computation in the function context? I am strugge...
What is the previous value of a monadic computation in the function context? What is the previous value of a monadic computation in the function context? functional-programming haskell monads What Infinity What is the previous value of a monadic computation in the function context? I am struggeling with the function in...
[ -0.0166015625, 0.01904296875, 0.0002307891845703125, 0.0260009765625, -0.00567626953125, 0.015869140625, 0.0164794921875, -0.007720947265625, 0.0135498046875, -0.039306640625, 0.004791259765625, -0.005889892578125, 0.002685546875, 0.009521484375, 0.0218505859375, -0.005401611328125, ...
[ 4865, 83, 70, 96362, 34292, 2667, 11, 18403, 181135, 1363, 32354, 43701, 23, 123309, 28966, 1556, 142508, 712, 134322, 53, 110527, 7, 497, 959, 60331, 6468, 1543, 56566, 29459, 3059, 208124, 41816, 4935, 3796, 16750, 706, 1022, 11764, 22631...
[ 0.036712646484375, 0.040618896484375, 0.0679931640625, 0.222900390625, 0.22900390625, 0.148193359375, 0.0975341796875, 0.135009765625, 0.174072265625, 0.0231781005859375, 0.159423828125, 0.2103271484375, 0.003021240234375, 0.111328125, 0.0745849609375, 0.0782470703125, 0.193603515625...
embed
19898602_c0
19898602
haskell
0
Title: Haskell: How to use attoparsec in order to read a nested list from a ByteString Problem title: Haskell: How to use attoparsec in order to read a nested list from a ByteString Tags: haskell, bytestring, attoparsec, parsing Problem: Haskell: How to use attoparsec in order to read a nested list from a ByteString I ...
Haskell: How to use attoparsec in order to read a nested list from a ByteString Haskell: How to use attoparsec in order to read a nested list from a ByteString haskell bytestring attoparsec parsing a qualified ByteStr.readFile Haskell How ByteString Integer Data.ByteString ByteStr Haskell: How to use attoparsec in orde...
[ -0.01953125, -0.004608154296875, -0.0017852783203125, 0.0064697265625, 0.004730224609375, 0.041259765625, 0.0177001953125, -0.010986328125, 0.01177978515625, -0.01708984375, 0.010009765625, -0.035888671875, 0.00115203857421875, 0.00927734375, 0.004547119140625, -0.0174560546875, -0.0...
[ 20625, 142508, 11249, 4527, 243, 31, 2500, 39797, 12301, 8512, 71, 5303, 1295, 3311, 67, 71713, 214, 1556, 390, 91693, 366, 217225, 39116, 174350, 44401, 11809, 75358, 7986, 11435, 2668, 12918, 21334, 21373, 1528, 3934, 43240, 19336, 102158, ...
[ 0.1148681640625, 0.232666015625, 0.0328369140625, 0.099853515625, 0.1719970703125, 0.1395263671875, 0.1641845703125, 0.21435546875, 0.1898193359375, 0.215576171875, 0.0986328125, 0.220703125, 0.0845947265625, 0.09619140625, 0.148193359375, 0.1771240234375, 0.09716796875, 0.11938476...
embed
46016524_c0
46016524
haskell
0
Title: How to generate arbitrary two argument function with QuickCheck? Problem title: How to generate arbitrary two argument function with QuickCheck? Tags: quickcheck, haskell Problem: How to generate arbitrary two argument function with QuickCheck? I am trying to test my implementation of zipWith using QuickCheck. M...
How to generate arbitrary two argument function with QuickCheck? How to generate arbitrary two argument function with QuickCheck? quickcheck haskell How QuickCheck prop_myZipWith Bool Arbitrary Test.QuickCheck.Function Fun prop_myMap How to generate arbitrary two argument function with QuickCheck? I am trying to test m...
[ 0.000316619873046875, -0.00140380859375, -0.012939453125, -0.005615234375, -0.01019287109375, 0.03173828125, 0.0000896453857421875, -0.031005859375, 0.015869140625, -0.0166015625, 0.005889892578125, 0.0142822265625, -0.015625, -0.0009613037109375, 0.0089111328125, -0.002197265625, -0...
[ 11249, 139392, 61799, 1294, 6626, 10750, 32354, 678, 89038, 202567, 63773, 78292, 1556, 142508, 25793, 1176, 1511, 3442, 194583, 2460, 929, 242522, 8647, 96010, 97249, 28670, 166179, 3034, 208124, 68330, 759, 37397, 5570, 959, 4488, 4153, 18, ...
[ 0.041656494140625, 0.1912841796875, 0.1573486328125, 0.093017578125, 0.18505859375, 0.2451171875, 0.1834716796875, 0.0215911865234375, 0.157470703125, 0.273681640625, 0.1170654296875, 0.227294921875, 0.0648193359375, 0.1619873046875, 0.1484375, 0.05926513671875, 0.0596923828125, 0....
embed
14715811_c0
14715811
haskell
0
Title: What general structure does this type have? Problem title: What general structure does this type have? Tags: haskell, higher-kinded-types, types Problem: What general structure does this type have? While hacking something up earlier, I created the following code: newtype Callback a = Callback { unCallback :: a -...
What general structure does this type have? What general structure does this type have? haskell higher-kinded-types types What Callback IORef What general structure does this type have? While hacking something up earlier, I created the following code: Callback a represents a function that handles some data and returns ...
[ -0.000263214111328125, 0.0211181640625, -0.007049560546875, 0.0223388671875, 0.024169921875, 0.003082275390625, -0.002044677734375, -0.0203857421875, 0.003143310546875, -0.0281982421875, -0.0096435546875, -0.0311279296875, -0.01190185546875, 0.00799560546875, -0.00994873046875, 0.00109...
[ 4865, 4537, 45646, 14602, 903, 10644, 765, 1556, 142508, 77546, 68347, 297, 50986, 52895, 26265, 12620, 123435, 4240, 256, 110680, 75935, 18151, 10, 33636, 32354, 34831, 2053, 30646, 3525, 11782, 5608, 11814, 11737, 185325, 831, 198343, 91995, ...
[ 0.046051025390625, 0.1922607421875, 0.254150390625, 0.0067138671875, 0.07177734375, 0.2061767578125, 0.08447265625, 0.161376953125, 0.269775390625, 0.116943359375, 0.116943359375, 0.03369140625, 0.18212890625, 0.172607421875, 0.1964111328125, 0.2666015625, 0.1605224609375, 0.244995...
embed
16049138_c0
16049138
haskell
0
Title: Why my two codes work so differently? (Haskell, Merge Sort) Problem title: Why my two codes work so differently? (Haskell, Merge Sort) Tags: mergesort, haskell Problem: Why my two codes work so differently? (Haskell, Merge Sort) I was writing a code for merge sort (Haskell). I have a question on the function tha...
Why my two codes work so differently? (Haskell, Merge Sort) Why my two codes work so differently? (Haskell, Merge Sort) mergesort haskell Why Haskell Merge Sort msort4 x:xs y:ys Why my two codes work so differently? (Haskell, Merge Sort) I was writing a code for merge sort (Haskell). I have a question on the function t...
[ 0.008056640625, -0.0016632080078125, 0.0145263671875, -0.010498046875, 0.002532958984375, -0.00262451171875, -0.0272216796875, 0.00341796875, 0.01080322265625, 0.000396728515625, 0.01708984375, -0.0023345947265625, 0.0223388671875, -0.0012969970703125, 0.006103515625, -0.00442504882812...
[ 44084, 759, 6626, 18151, 7, 4488, 221, 12921, 538, 6495, 142508, 6035, 429, 53666, 42564, 62351, 1556, 20625, 347, 617, 1022, 12, 425, 113, 4778, 32562, 12096, 9655, 32354, 3884, 5303, 25842, 59499, 12989, 108368, 104629, 33079, 133063, 803...
[ 0.140380859375, 0.061614990234375, 0.174072265625, 0.2220458984375, 0.07757568359375, 0.1312255859375, 0.12646484375, 0.2161865234375, 0.1219482421875, 0.10040283203125, 0.21826171875, 0.176513671875, 0.134521484375, 0.229736328125, 0.2203369140625, 0.21533203125, 0.116943359375, 0...
embed
71223344_c0
71223344
haskell
0
Title: How do I deal with the error "No instance for (Control.Monad.IO.Class.MonadIO [])"? Problem title: How do I deal with the error "No instance for (Control.Monad.IO.Class.MonadIO [])"? Tags: do-notation, haskell, monads, random Problem: How do I deal with the error "No instance for (Control.Mon...
How do I deal with the error "No instance for (Control.Monad.IO.Class.MonadIO [])"? How do I deal with the error "No instance for (Control.Monad.IO.Class.MonadIO [])"? do-notation haskell monads random a How Control.Monad.IO.Class.MonadIO xRanElems2 n-1 How do I deal with the error "No instance for ...
[ -0.0038909912109375, 0.01104736328125, 0.00994873046875, -0.01434326171875, 0.005523681640625, 0.033935546875, 0.00189971923828125, -0.0181884765625, 0.0174560546875, -0.041015625, 0.023193359375, -0.032470703125, -0.0023040771484375, 0.002349853515625, 0.016845703125, -0.0022430419921...
[ 11249, 35142, 678, 18499, 5021, 110527, 100, 175904, 46674, 712, 17780, 140803, 157, 22062, 1556, 142508, 2667, 7, 96759, 10, 27131, 1022, 126525, 7623, 195, 304, 5759, 105216, 195348, 20625, 3444, 2046, 80854, 1295, 5303, 32354, 2967, 9790, ...
[ 0.0258026123046875, 0.1195068359375, 0.059906005859375, 0.202880859375, 0.142333984375, 0.275634765625, 0.137939453125, 0.2254638671875, 0.083984375, 0.126708984375, 0.209228515625, 0.1435546875, 0.130615234375, 0.053192138671875, 0.0926513671875, 0.2364501953125, 0.08642578125, 0....
embed
69595495_c0
69595495
haskell
0
Title: BadType routing failure in IHP even though types are defined Problem title: BadType routing failure in IHP even though types are defined Tags: haskell, ihp Problem: BadType routing failure in IHP even though types are defined Context I have a record with a field that is of type Day (which corresponds to a field ...
BadType routing failure in IHP even though types are defined BadType routing failure in IHP even though types are defined haskell ihp BadType IHP Day DATE PostsController.hs CreatePostAction Post Left NewView Right date1 SomeAction Query UUID Routing Just Types.hs PostsController BadType routing failure in IHP even tho...
[ 0.011474609375, 0.000362396240234375, 0.0086669921875, 0.01275634765625, -0.019287109375, -0.006622314453125, -0.017333984375, -0.00823974609375, 0.0029754638671875, -0.0400390625, -0.005950927734375, -0.01416015625, -0.01416015625, -0.001861572265625, -0.01422119140625, -0.00349426269...
[ 12745, 196707, 22629, 1916, 137578, 87, 36599, 3853, 21208, 52895, 61924, 1556, 142508, 9633, 254, 10013, 391, 35746, 2795, 175904, 603, 127, 151313, 49411, 284, 10763, 2480, 2356, 100474, 90911, 5622, 31384, 58836, 91916, 7146, 56709, 9563, ...
[ 0.1942138671875, 0.2822265625, 0.1651611328125, 0.05535888671875, 0.184326171875, 0.07763671875, 0.2034912109375, 0.10687255859375, 0.099365234375, 0.245849609375, 0.1854248046875, 0.1197509765625, 0.1881103515625, 0.0841064453125, 0.113525390625, 0.2120361328125, 0.0704345703125, ...
embed
30203566_c0
30203566
haskell
0
Title: What does .(...) mean in a .prof report mean? Problem title: What does .(...) mean in a .prof report mean? Tags: haskell, profiling Problem: What does .(...) mean in a .prof report mean? I'm looking for optimization oportunities in my Haskell program by compiling with -prof , but I don't know how to interpret th...
What does .(...) mean in a .prof report mean? What does .(...) mean in a .prof report mean? haskell profiling What jankRoulette.select COST CENTRE MODULE Forest MultiMapSet main.hs RTS main.prof filter.foo filter.bar What does .(...) mean in a .prof report mean? I'm looking for optimization oportunities in my Haskell p...
[ 0.007415771484375, 0.0076904296875, -0.01043701171875, 0.0167236328125, -0.0079345703125, 0.0003108978271484375, 0.000690460205078125, -0.008544921875, -0.000736236572265625, -0.004791259765625, -0.01507568359375, 0.006805419921875, -0.0216064453125, -0.0022125244140625, -0.0091552734375...
[ 4865, 5, 139666, 29459, 23, 3454, 420, 13416, 1556, 142508, 9468, 79, 7570, 12724, 34, 36711, 7, 100184, 313, 34274, 89859, 56564, 98610, 87282, 19335, 166179, 126, 127, 27389, 294, 5201, 46312, 3584, 31, 1299, 14602, 87235, 80206, 20625, ...
[ 0.0323486328125, 0.1214599609375, 0.281005859375, 0.147705078125, 0.03338623046875, 0.147705078125, 0.17236328125, 0.19677734375, 0.06561279296875, 0.2086181640625, 0.14892578125, 0.0780029296875, 0.1209716796875, 0.0777587890625, 0.07623291015625, 0.2171630859375, 0.041290283203125,...
embed
72897214_c0
72897214
haskell
0
Title: Problem with showing/outputting Nat type in a function that converts integers to Nats Problem title: Problem with showing/outputting Nat type in a function that converts integers to Nats Tags: function, haskell, error-handling, types Problem: Problem with showing/outputting Nat type in a function that converts i...
Problem with showing/outputting Nat type in a function that converts integers to Nats Problem with showing/outputting Nat type in a function that converts integers to Nats function haskell error-handling types Problem Nat Nats Zero Suc nat2int int2nat n-1 Problem with showing/outputting Nat type in a function that conv...
[ -0.006256103515625, 0.0003204345703125, 0.004638671875, 0.003082275390625, 0.00543212890625, 0.006622314453125, 0.005889892578125, -0.0091552734375, -0.011962890625, 0.013916015625, 0.005706787109375, -0.043701171875, 0.004791259765625, 0.0172119140625, 0.01483154296875, -0.00122833251...
[ 15649, 141377, 6056, 7077, 68875, 10644, 32354, 96760, 892, 26255, 47, 353, 933, 1556, 142508, 18499, 54885, 52895, 83947, 103544, 24, 18, 304, 4288, 7695, 5759, 64, 23, 52080, 20625, 27781, 12877, 61924, 2053, 6626, 64549, 25251, 45234, 74...
[ 0.1478271484375, 0.1644287109375, 0.0885009765625, 0.08544921875, 0.27099609375, 0.2177734375, 0.1702880859375, 0.1348876953125, 0.1212158203125, 0.09326171875, 0.08740234375, 0.2125244140625, 0.1734619140625, 0.072998046875, 0.1986083984375, 0.1939697265625, 0.0748291015625, 0.184...
embed
45003110_c0
45003110
haskell
0
Title: Haskell -- Concurrent I/O Routing Problem title: Haskell -- Concurrent I/O Routing Tags: io, haskell, jack, routes Problem: Haskell -- Concurrent I/O Routing I am new to Haskell, and I'm not exactly sure how the concurrent I/O works. I'm exploring what can be accomplished with the JACK audio bindings. Basically,...
Haskell -- Concurrent I/O Routing Haskell -- Concurrent I/O Routing io haskell jack routes Haskell Concurrent Routing IORef Double Just Nothing Nada Input Result Output Frequency Outputs Happens Haskell -- Concurrent I/O Routing I am new to Haskell, and I'm not exactly sure how the concurrent I/O works. I'm exploring w...
[ 0.003692626953125, 0.01336669921875, -0.01318359375, 0.00469970703125, 0.0024261474609375, 0.00592041015625, 0.001922607421875, -0.01275634765625, -0.00323486328125, -0.048828125, 0.01300048828125, -0.0113525390625, -0.01080322265625, 0.00811767578125, 0.011474609375, 0.00408935546875,...
[ 20625, 142508, 4210, 1657, 163812, 87, 64, 670, 56709, 1916, 22995, 1556, 121477, 36439, 123435, 4240, 107172, 9563, 182747, 60092, 360, 126684, 13538, 21612, 944, 7077, 208612, 3525, 133244, 43240, 163846, 9846, 20572, 18215, 128239, 25632, 18...
[ 0.152099609375, 0.244873046875, 0.04241943359375, 0.065673828125, 0.2335205078125, 0.060882568359375, 0.2247314453125, 0.157470703125, 0.1243896484375, 0.054046630859375, 0.1982421875, 0.151611328125, 0.1727294921875, 0.1719970703125, 0.05767822265625, 0.163818359375, 0.115966796875,...
embed
69731342_c0
69731342
haskell
0
Title: Apply function to argument before performing pattern matching Problem title: Apply function to argument before performing pattern matching Tags: haskell, functional-programming Problem: Apply function to argument before performing pattern matching I'm new to Haskell and trying to not instinctively think imperati...
Apply function to argument before performing pattern matching Apply function to argument before performing pattern matching haskell functional-programming Apply c:s Apply function to argument before performing pattern matching I'm new to Haskell and trying to not instinctively think imperatively. I have a function whic...
[ 0.005279541015625, 0.005462646484375, -0.003570556640625, 0.01007080078125, 0.00848388671875, -0.01092529296875, -0.008056640625, 0.007293701171875, 0.0235595703125, -0.0294189453125, 0.027587890625, -0.0159912109375, -0.0093994140625, 0.01611328125, 0.000942230224609375, -0.0209960937...
[ 5659, 538, 32354, 47, 10750, 8108, 51339, 103510, 14858, 1556, 142508, 123309, 28966, 501, 12, 214, 3525, 20625, 31577, 218024, 5351, 222530, 756, 4488, 46389, 27117, 98, 7103, 190659, 78662, 5775, 31, 83, 29479, 1284, 1909, 7440, 16940, 47...
[ 0.146484375, 0.09521484375, 0.203369140625, 0.158935546875, 0.249755859375, 0.1573486328125, 0.1279296875, 0.2105712890625, 0.2293701171875, 0.10443115234375, 0.2108154296875, 0.10302734375, 0.057373046875, 0.01629638671875, 0.03338623046875, 0.030303955078125, 0.0196380615234375, ...
embed
62144911_c1
62144911
haskell
1
cat1 cat2 bf1 bf2 i1 i2 f | cat1 bf1 -> i1 , cat2 bf2 -> i2 where fzip :: (f x `bf2` f y) `cat2` f (x `bf1` y) pure :: i2 `cat2` f i1 Before we even compile this I can already see an issue. We don't mention cat1 anywhere in these two functions! And I can't derrive cat1 from any combination of the other types in the cl...
cat1 cat2 bf1 bf2 i1 i2 f | cat1 bf1 -> i1 , cat2 bf2 -> i2 where fzip :: (f x `bf2` f y) `cat2` f (x `bf1` y) pure :: i2 `cat2` f i1 Before we even compile this I can already see an issue. We don't mention cat1 anywhere in these two functions! And I can't derrive cat1 from any combination of the other types in the cl...
[ 0.00142669677734375, 0.01275634765625, -0.0238037109375, 0.01068115234375, -0.010498046875, 0.006561279296875, -0.0137939453125, -0.01214599609375, 0.01348876953125, -0.01556396484375, -0.0130615234375, -0.03271484375, -0.0198974609375, 0.0037384033203125, -0.01361083984375, 0.00218200...
[ 7515, 418, 304, 150598, 17, 1238, 33079, 50836, 1022, 113, 4460, 34166, 9969, 21771, 31089, 1401, 2301, 18, 41392, 151107, 6626, 32354, 831, 122, 416, 162515, 52895, 18507, 136, 920, 12282, 10821, 47, 1556, 142508, 53418, 53498, 765, 959, ...
[ 0.229736328125, 0.1492919921875, 0.1783447265625, 0.17138671875, 0.079345703125, 0.0941162109375, 0.038604736328125, 0.2188720703125, 0.0197601318359375, 0.045745849609375, 0.162841796875, 0.1959228515625, 0.060028076171875, 0.02801513671875, 0.068603515625, 0.001220703125, 0.0151367...
embed
34484570_c0
34484570
haskell
0
Title: Using pandoc as a library to make a PDF Problem title: Using pandoc as a library to make a PDF Tags: haskell, pandoc Problem: Using pandoc as a library to make a PDF Part of a project I am working on involves creating a PDF, using Pandoc. I have the part of the program which makes a PDF. To figure out how to do ...
Using pandoc as a library to make a PDF Using pandoc as a library to make a PDF haskell pandoc outside implicit Using PDF fuel.hs MonadIO Pandoc Either BL.ByteString Run lts-3.7 stack.yaml Left Emergency tex2pdf.8283 input.tex input.log Fail Using pandoc as a library to make a PDF Part of a project I am working on invo...
[ 0.009521484375, 0.006134033203125, -0.001953125, -0.00982666015625, 0.01153564453125, -0.00189208984375, -0.00180816650390625, -0.0205078125, -0.00982666015625, 0.0005645751953125, -0.007232666015625, -0.0177001953125, 0.022216796875, -0.0106201171875, 0.0206298828125, -0.0060729980468...
[ 345, 6953, 2652, 29713, 237, 35773, 1294, 3249, 6859, 1556, 142508, 50782, 165164, 160692, 127, 60331, 71, 17780, 4378, 68170, 71713, 28398, 933, 109981, 177261, 14520, 141, 2480, 63636, 1409, 24371, 304, 15483, 175283, 363, 107730, 4867, 190...
[ 0.0745849609375, 0.001708984375, 0.154296875, 0.244140625, 0.07025146484375, 0.2091064453125, 0.1312255859375, 0.08477783203125, 0.2371826171875, 0.0924072265625, 0.216064453125, 0.11328125, 0.2044677734375, 0.2427978515625, 0.1143798828125, 0.08184814453125, 0.0250396728515625, 0....
embed
70732752_c0
70732752
haskell
0
Title: Haskell - Get user input in do block and use it in if statement Problem title: Haskell - Get user input in do block and use it in if statement Tags: haskell, if-statement, user-input Problem: Haskell - Get user input in do block and use it in if statement Here is my code main :: IO () main = do putStrLn "Pick a ...
Haskell - Get user input in do block and use it in if statement Haskell - Get user input in do block and use it in if statement haskell if-statement user-input Haskell Get Pick Thank Were hlsurl.hs:18:11 Couldn Maybe Handle ProcessHandle Expected Actual Haskell - Get user input in do block and use it in if statement He...
[ -0.015869140625, 0.004730224609375, -0.001190185546875, 0.0167236328125, -0.01092529296875, 0.0177001953125, 0.0111083984375, -0.00994873046875, -0.006103515625, -0.005279541015625, -0.007781982421875, -0.00994873046875, -0.0159912109375, 0.00909423828125, -0.006866455078125, 0.0169677...
[ 20625, 142508, 20779, 38937, 107730, 23, 54, 46389, 4527, 2174, 63805, 20, 136, 1556, 61340, 674, 73, 7077, 122554, 25689, 1401, 107, 75084, 25002, 127, 24033, 19993, 191147, 83425, 10639, 133, 123996, 135679, 60075, 13, 100582, 442, 11853, ...
[ 0.158447265625, 0.27734375, 0.114013671875, 0.181640625, 0.2047119140625, 0.058746337890625, 0.129150390625, 0.21337890625, 0.1151123046875, 0.207763671875, 0.2196044921875, 0.015106201171875, 0.009063720703125, 0.1448974609375, 0.1458740234375, 0.060211181640625, 0.08355712890625, ...
embed
3473389_c0
3473389
haskell
0
Title: LHS and Markdown: Codeblocks Problem title: LHS and Markdown: Codeblocks Tags: markdown, literate-programming, haskell Problem: LHS and Markdown: Codeblocks I happen to really like Markdown (probably because of SO) and I like programming in Haskell. I have recently discovered Literate Haskell (LHS) and I want to...
LHS and Markdown: Codeblocks LHS and Markdown: Codeblocks markdown literate-programming haskell LHS Markdown Codeblocks Crazy Literate Haskell Main Look Monad Wasn LHS and Markdown: Codeblocks I happen to really like Markdown (probably because of SO) and I like programming in Haskell. I have recently discovered Literat...
[ 0.01336669921875, 0.006744384765625, 0.000453948974609375, -0.0118408203125, 0.005523681640625, 0.00970458984375, -0.0027923583984375, 0.004547119140625, -0.00077056884765625, -0.0322265625, -0.0034637451171875, -0.01513671875, 0.002044677734375, -0.00634765625, -0.007110595703125, 0.0...
[ 339, 38131, 136, 7880, 34695, 28864, 81409, 12, 16188, 80109, 13, 28966, 1556, 142508, 170500, 135940, 67, 20625, 12321, 60818, 60331, 5282, 53383, 6183, 1884, 15969, 56037, 134053, 866, 3444, 4527, 25842, 903, 115, 6492, 27781, 11435, 366, ...
[ 0.1063232421875, 0.223876953125, 0.1156005859375, 0.1519775390625, 0.1920166015625, 0.1270751953125, 0.214111328125, 0.02117919921875, 0.149658203125, 0.13427734375, 0.044586181640625, 0.0753173828125, 0.1212158203125, 0.225341796875, 0.1072998046875, 0.1605224609375, 0.109130859375,...
embed
23101621_c0
23101621
haskell
0
Title: Compose list of functions in Haskell Problem title: Compose list of functions in Haskell Tags: haskell, functional-programming, function-composition, fold Problem: Compose list of functions in Haskell I need to define a function that receives a tuple t1 (String,(Int,Int,Int) and another tuple t2 (String,[(String...
Compose list of functions in Haskell Compose list of functions in Haskell haskell functional-programming function-composition fold Compose Haskell trd3 Warrior Bag Compose list of functions in Haskell I need to define a function that receives a tuple t1 (String,(Int,Int,Int) and another tuple t2 (String,[(String,Int,[F...
[ -0.0089111328125, -0.00170135498046875, -0.00714111328125, 0.038330078125, -0.005706787109375, 0.009765625, -0.0255126953125, 0.01275634765625, 0.0045166015625, -0.004241943359375, -0.005889892578125, 0.0157470703125, 0.007110595703125, 0.0303955078125, -0.00701904296875, -0.0023803710...
[ 15612, 8364, 5303, 32354, 7, 20625, 142508, 23, 1556, 123309, 28966, 277, 40322, 42822, 4307, 71, 363, 5550, 4726, 19413, 3871, 61924, 53299, 370, 8705, 808, 418, 71713, 4153, 136, 15700, 304, 919, 30646, 678, 73197, 142424, 17932, 12830, ...
[ 0.1876220703125, 0.0953369140625, 0.1595458984375, 0.21826171875, 0.04034423828125, 0.119140625, 0.22998046875, 0.01025390625, 0.1068115234375, 0.14208984375, 0.06414794921875, 0.1112060546875, 0.0802001953125, 0.221435546875, 0.006866455078125, 0.0203399658203125, 0.0955810546875, ...
embed
52178550_c0
52178550
haskell
0
Title: Haskell: Array Loop Comparison Equivalent Problem title: Haskell: Array Loop Comparison Equivalent Tags: haskell Problem: Haskell: Array Loop Comparison Equivalent I am trying to compare certain aspects of two linked lists. The arrays both have format (assume a...p derive Eq): linkedList1 = [(a, b, c, d), (e, f,...
Haskell: Array Loop Comparison Equivalent Haskell: Array Loop Comparison Equivalent haskell Haskell Array Loop Comparison Equivalent linkedList1 linkedList2 Haskell: Array Loop Comparison Equivalent I am trying to compare certain aspects of two linked lists. The arrays both have format (assume a...p derive Eq): What I ...
[ -0.00921630859375, -0.00089263916015625, -0.01611328125, 0.00457763671875, -0.016845703125, -0.00872802734375, 0.015625, 0.0034942626953125, 0.0157470703125, 0.005035400390625, -0.007080078125, 0.000331878662109375, 0.01507568359375, 0.0115966796875, -0.0076904296875, -0.032470703125, ...
[ 20625, 142508, 69253, 199694, 113307, 40514, 145666, 85540, 1556, 3126, 297, 154663, 418, 304, 53, 31577, 69101, 128746, 6626, 5303, 10298, 4778, 15044, 9384, 254, 122, 5844, 864, 15673, 163846, 3444, 107730, 63262, 91067, 12638, 2799, 186514, ...
[ 0.1226806640625, 0.2242431640625, 0.1182861328125, 0.162109375, 0.147705078125, 0.09423828125, 0.043792724609375, 0.13818359375, 0.114013671875, 0.1695556640625, 0.1026611328125, 0.1697998046875, 0.016387939453125, 0.091552734375, 0.01873779296875, 0.07403564453125, 0.1973876953125, ...
embed
717873_c0
717873
haskell
0
Title: changing search-dirs for $ sudo gcc Problem title: changing search-dirs for $ sudo gcc Tags: gcc, sudo, haskell Problem: changing search-dirs for $ sudo gcc On OS X I'm trying to install the zlib prerequisite for haskell's Cabal. I get this error: $ sudo ./Setup build Preprocessing library zlib-0.5.0.0… ld: libr...
changing search-dirs for $ sudo gcc changing search-dirs for $ sudo gcc gcc sudo haskell Setup Preprocessing zlib-0.5.0.0 collect2 Codec Compression Zlib Stream_hsc_make.o ghc-6.8.3 bytestring-0.9.0.1.1 array-0.1.0.0 base-3.0.2.0 Stream_hsc_make i686-apple-darwin9 LIBRARY_PATH lib:$LIBRARY_PATH script.sh Configuring ca...
[ -0.01446533203125, 0.0181884765625, -0.0067138671875, -0.000614166259765625, -0.0174560546875, -0.00396728515625, -0.01611328125, 0.0201416015625, -0.0004482269287109375, -0.004486083984375, 0.01019287109375, -0.0169677734375, 0.011962890625, 0.004241943359375, 0.00182342529296875, -0....
[ 151134, 33938, 936, 7, 100, 3650, 166, 246, 22109, 238, 1556, 142508, 19943, 1914, 63923, 97, 5612, 93645, 99929, 43799, 304, 28864, 3288, 48448, 567, 115061, 10382, 55898, 31380, 166141, 91693, 143161, 102014, 3647, 132265, 73011, 178475, 90...
[ 0.188720703125, 0.2333984375, 0.1966552734375, 0.07159423828125, 0.029815673828125, 0.084716796875, 0.17236328125, 0.169921875, 0.162353515625, 0.1375732421875, 0.103271484375, 0.2080078125, 0.011993408203125, 0.069580078125, 0.0645751953125, 0.09814453125, 0.2276611328125, 0.06958...
embed
47934802_c0
47934802
haskell
0
Title: How do I print the label text in Haskell GI-Gtk listBoxRow? Problem title: How do I print the label text in Haskell GI-Gtk listBoxRow? Tags: haskell Problem: How do I print the label text in Haskell GI-Gtk listBoxRow? I am trying to print the label text when I click on a listBoxRow. This is the link to my gist: ...
How do I print the label text in Haskell GI-Gtk listBoxRow? How do I print the label text in Haskell GI-Gtk listBoxRow? haskell How Haskell GI-Gtk listbox2 Just Required GI.Gtk.Objects.Label.Label GI.Gtk.Objects.Widget.Widget Clicked How do I print the label text in Haskell GI-Gtk listBoxRow? I am trying to print the l...
[ 0.007354736328125, -0.000164031982421875, 0.01531982421875, 0.0294189453125, 0.004119873046875, 0.00179290771484375, 0.0235595703125, 0.007415771484375, 0.00909423828125, 0.0025787353515625, 0.03125, -0.08544921875, -0.0233154296875, -0.005157470703125, 0.00015735626220703125, 0.003860...
[ 11249, 28412, 67967, 7986, 23, 20625, 142508, 42887, 724, 31472, 5303, 72295, 12724, 434, 1556, 11728, 304, 3181, 75161, 4063, 2729, 532, 3794, 21138, 54, 31577, 18158, 3126, 3016, 271, 735, 15769, 32102, 232, 29191, 18151, 18499, 209806, 1...
[ 0.051513671875, 0.2110595703125, 0.268310546875, 0.21142578125, 0.035980224609375, 0.10986328125, 0.1959228515625, 0.18212890625, 0.049102783203125, 0.165283203125, 0.1724853515625, 0.1376953125, 0.146484375, 0.130126953125, 0.0753173828125, 0.1478271484375, 0.0640869140625, 0.0554...
embed
54787344_c0
54787344
haskell
0
Title: How to get referenced model information in Yesod? Problem title: How to get referenced model information in Yesod? Tags: haskell-persistent, yesod, haskell Problem: How to get referenced model information in Yesod? I have 3 Models Address json number Text street Text pincode Text deriving Show Person json email ...
How to get referenced model information in Yesod? How to get referenced model information in Yesod? haskell-persistent yesod haskell How Yesod Address Text Show Person House PersonId AddressId Handler Value Asc HouseRent email.com Moto How to get referenced model information in Yesod? I have 3 Models I want to access a...
[ -0.0032958984375, 0.04345703125, 0.003631591796875, 0.005401611328125, 0.009521484375, -0.0030517578125, -0.0120849609375, -0.00787353515625, 0.0038299560546875, -0.07568359375, 0.008544921875, -0.00081634521484375, -0.0284423828125, -0.0159912109375, -0.0040283203125, 0.00527954101562...
[ 11249, 2046, 91067, 71, 3299, 4677, 32635, 2199, 47, 23, 1556, 142508, 6892, 2422, 23722, 49990, 24129, 17367, 15270, 13038, 10639, 603, 190060, 238, 1052, 2517, 33100, 138, 13293, 3444, 17203, 756, 18276, 3789, 77630, 3445, 619, 29823, 188...
[ 0.066650390625, 0.1014404296875, 0.2252197265625, 0.134765625, 0.2254638671875, 0.1754150390625, 0.1724853515625, 0.258544921875, 0.010162353515625, 0.045928955078125, 0.049102783203125, 0.16015625, 0.0540771484375, 0.12109375, 0.2161865234375, 0.0970458984375, 0.12255859375, 0.064...
embed
60914233_c1
60914233
haskell
1
n m) = if i == 2 then "(" ++ s ++ ")" else s where s = f 1 n ++ " " ++ f 2 m substitute :: Var -> Term -> Term -> Term substitute x n (Variable y) --if y = x, then leave n alone | y == x = n -- otherwise change to y | otherwise = Variable y substitute x n (Lambda y m) --(\y.M)[N/x] = \y.M if y = x | y == x = Lambda y ...
n m) = if i == 2 then "(" ++ s ++ ")" else s where s = f 1 n ++ " " ++ f 2 m substitute :: Var -> Term -> Term -> Term substitute x n (Variable y) --if y = x, then leave n alone | y == x = n -- otherwise change to y | otherwise = Variable y substitute x n (Lambda y m) --(\y.M)[N/x] = \y.M if y = x | y == x = Lambda y ...
[ -0.0174560546875, 0.01068115234375, 0.00836181640625, 0.01507568359375, 0.0089111328125, 0.002105712890625, 0.00994873046875, 0.00982666015625, 0.004180908203125, 0.0189208984375, 0.005126953125, -0.0228271484375, -0.01177978515625, -0.0015106201171875, -0.00970458984375, -0.00390625, ...
[ 653, 347, 16, 2203, 2174, 17, 69112, 116, 7068, 37223, 91, 37076, 1238, 106, 161740, 13, 1984, 3323, 33079, 2994, 39, 1022, 81827, 14, 2886, 113, 4210, 3190, 31358, 75447, 120262, 15549, 47, 84572, 2729, 6492, 85, 594, 64, 6, 122930, ...
[ 0.1663818359375, 0.1812744140625, 0.048797607421875, 0.07806396484375, 0.09130859375, 0.1373291015625, 0.139892578125, 0.1727294921875, 0.011962890625, 0.1527099609375, 0.1075439453125, 0.029052734375, 0.0911865234375, 0.047882080078125, 0.271484375, 0.11474609375, 0.078125, 0.2110...
embed
63821091_c0
63821091
haskell
0
Title: How to change the behavior of the function based on class constraints in Haskell? Problem title: How to change the behavior of the function based on class constraints in Haskell? Tags: haskell Problem: How to change the behavior of the function based on class constraints in Haskell? I have a data type that repre...
How to change the behavior of the function based on class constraints in Haskell? How to change the behavior of the function based on class constraints in Haskell? haskell How Haskell Tree Leaf Node left::Tree Prob POrd Ord Rational PEq PPlain How to change the behavior of the function based on class constraints in Has...
[ -0.0016326904296875, -0.003326416015625, 0.003448486328125, -0.017822265625, 0.00494384765625, 0.0186767578125, -0.0400390625, -0.022216796875, 0.0028076171875, -0.017333984375, -0.00180816650390625, -0.0283203125, 0.0174560546875, -0.0147705078125, -0.002227783203125, 0.00543212890625...
[ 11249, 47, 15549, 123166, 32354, 35509, 98, 18507, 158, 2816, 4288, 20625, 142508, 23, 1556, 101344, 636, 2407, 438, 112, 25737, 62731, 1250, 275, 8574, 4216, 35379, 2552, 43315, 17051, 864, 16442, 2053, 10644, 33636, 42486, 142424, 80836, ...
[ 0.08380126953125, 0.036041259765625, 0.2310791015625, 0.202880859375, 0.184326171875, 0.1575927734375, 0.053436279296875, 0.2237548828125, 0.10516357421875, 0.1990966796875, 0.1551513671875, 0.1396484375, 0.2340087890625, 0.03814697265625, 0.11767578125, 0.18408203125, 0.024932861328...
embed
34492664_c0
34492664
haskell
0
Title: Cabal error: Failed to load interface for `Control.Lens.Type' Problem title: Cabal error: Failed to load interface for `Control.Lens.Type' Tags: cabal, haskell-lens, haskell Problem: Cabal error: Failed to load interface for `Control.Lens.Type' Can't build trifecta-1.5.2 ghc-pkg check shows no borken p...
Cabal error: Failed to load interface for `Control.Lens.Type' Cabal error: Failed to load interface for `Control.Lens.Type' cabal haskell-lens haskell version Cabal Failed Control.Lens.Type Compiling Text.Trifecta.Highlight Text Trifecta Highlight.hs Highlight.o Highlight.hs:73:1 lens-4.13-3NqKPNVtlmaitmhxgiG...
[ 0.005706787109375, -0.00457763671875, -0.00927734375, 0.005096435546875, -0.004638671875, 0.000316619873046875, -0.005767822265625, -0.00732421875, -0.02294921875, -0.00396728515625, 0.00014495849609375, -0.0035400390625, -0.017578125, -0.02294921875, 0.020263671875, 0.012451171875, ...
[ 30438, 289, 18499, 190355, 297, 72367, 101758, 100, 175904, 866, 1755, 196707, 3768, 47, 109524, 1556, 142508, 1977, 11389, 27131, 15612, 49725, 24129, 74257, 17928, 102, 163025, 4699, 132951, 127, 31, 13574, 19721, 3098, 120518, 163496, 23076,...
[ 0.1761474609375, 0.158935546875, 0.1536865234375, 0.1534423828125, 0.038665771484375, 0.2161865234375, 0.2440185546875, 0.0184173583984375, 0.194580078125, 0.117919921875, 0.1741943359375, 0.23095703125, 0.0899658203125, 0.00274658203125, 0.222412109375, 0.10357666015625, 0.189941406...
embed
39637099_c0
39637099
haskell
0
Title: Understanding Type Classes, Scala implicit and C# Problem title: Understanding Type Classes, Scala implicit and C# Tags: c%23, scala, haskell, functional-programming Problem: Understanding Type Classes, Scala implicit and C# I read this blog post by Joe Duffy about Haskell type classes and C# interfaces. I'm try...
Understanding Type Classes, Scala implicit and C# Understanding Type Classes, Scala implicit and C# c%23 scala haskell functional-programming Understanding Type Classes Scala IReducableOf Append Empty Reduce IEnumerable IReducerOf Enumerable.Aggregate reducer.Append Understanding Type Classes, Scala implicit and C# I r...
[ -0.00070953369140625, 0.014404296875, 0.0034637451171875, 0.01092529296875, 0.0010833740234375, -0.00604248046875, -0.0252685546875, 0.0174560546875, -0.012939453125, -0.046142578125, -0.005157470703125, -0.023193359375, -0.00994873046875, -0.0096435546875, -0.0003261566162109375, 0.00...
[ 9626, 144057, 60457, 35014, 90, 152653, 11, 165164, 136, 313, 4904, 3742, 146232, 1556, 142508, 123309, 28966, 32863, 108343, 2661, 132887, 5659, 3611, 31678, 939, 853, 106357, 2606, 15246, 3443, 316, 2886, 68722, 34390, 42, 39179, 40207, 761...
[ 0.0849609375, 0.0509033203125, 0.2393798828125, 0.2486572265625, 0.06982421875, 0.17333984375, 0.1123046875, 0.220458984375, 0.06640625, 0.03216552734375, 0.186279296875, 0.040008544921875, 0.2210693359375, 0.0791015625, 0.1895751953125, 0.093505859375, 0.05206298828125, 0.05065917...
embed
13329392_c0
13329392
haskell
0
Title: compile error in do block with Maybe expected Problem title: compile error in do block with Maybe expected Tags: haskell, io, option-type Problem: compile error in do block with Maybe expected Here is my code: getMove :: Board -> Player -> IO (Maybe (Move, Board, Player)) completeUserTurn :: Player -> Board -> M...
compile error in do block with Maybe expected compile error in do block with Maybe expected haskell io option-type Maybe Board Player Move Nothing Invalid Couldn compile error in do block with Maybe expected Here is my code: Here is the error I am getting (On the indicated line): What is wrong? I though the <- would do...
[ -0.00372314453125, 0.0029296875, 0.014404296875, -0.004364013671875, 0.004852294921875, 0.01458740234375, -0.000835418701171875, -0.005462646484375, 0.0184326171875, -0.013916015625, -0.0145263671875, -0.0084228515625, 0.003997802734375, -0.0189208984375, -0.0021514892578125, 0.0105590...
[ 9969, 1340, 18499, 23, 54, 46389, 678, 83425, 84751, 1556, 142508, 22995, 35829, 50986, 62554, 60560, 135828, 182747, 7013, 191147, 18151, 20320, 117414, 13315, 44691, 21208, 4426, 9, 2806, 17780, 22631, 3884, 16750, 347, 44084, 41206, 10, 70...
[ 0.166259765625, 0.13330078125, 0.1959228515625, 0.04254150390625, 0.0997314453125, 0.19189453125, 0.06988525390625, 0.27587890625, 0.2186279296875, 0.08294677734375, 0.1854248046875, 0.1539306640625, 0.175537109375, 0.07421875, 0.109130859375, 0.1392822265625, 0.1527099609375, 0.07...
embed
50948583_c0
50948583
haskell
0
Title: How to implement prism for GADT? Problem title: How to implement prism for GADT? Tags: gadt, haskell-lens, haskell Problem: How to implement prism for GADT? I have GADT data type like this: data TValue = TInt | TBool data Value (t :: TValue) where I :: Int -> Value 'TInt B :: Bool -> Value 'TBool And I want to h...
How to implement prism for GADT? How to implement prism for GADT? gadt haskell-lens haskell How GADT TValue TInt TBool Value Bool ValuePrism Maybe Just Nothing Prism Either How to implement prism for GADT? I have GADT data type like this: And I want to have prisms for pattern matching on this data type. I'm using data ...
[ -0.010498046875, 0.0159912109375, -0.00013828277587890625, -0.0016326904296875, 0.0146484375, 0.01116943359375, -0.0206298828125, 0.002227783203125, 0.00067138671875, -0.0224609375, 0.024658203125, 0.01129150390625, -0.0076904296875, -0.0169677734375, 0.00909423828125, 0.00946044921875...
[ 11249, 47, 29479, 4067, 39, 100, 23749, 41072, 914, 13384, 1556, 142508, 1977, 1910, 50770, 26906, 660, 43386, 190060, 2460, 929, 33163, 7, 83425, 9563, 182747, 20204, 2053, 10644, 1884, 3444, 765, 4432, 103510, 14858, 903, 51515, 134381, 1...
[ 0.083251953125, 0.03460693359375, 0.2020263671875, 0.220703125, 0.2044677734375, 0.1214599609375, 0.16796875, 0.2484130859375, 0.1192626953125, 0.191162109375, 0.09814453125, 0.1986083984375, 0.1181640625, 0.08251953125, 0.1829833984375, 0.0079345703125, 0.0867919921875, 0.16040039...
embed
45723921_c0
45723921
haskell
0
Title: Haskell Yesod serving large file issue Problem title: Haskell Yesod serving large file issue Tags: haskell, yesod Problem: Haskell Yesod serving large file issue I'm working on a Yesod file server, and I need to be able to serve larger files (in this case, pictures) as well. I have a static file subsite set up t...
Haskell Yesod serving large file issue Haskell Yesod serving large file issue haskell yesod Haskell Yesod Yesod.Core.Handler Haskell Yesod serving large file issue I'm working on a Yesod file server, and I need to be able to serve larger files (in this case, pictures) as well. I have a static file subsite set up to ser...
[ 0.008544921875, 0.0159912109375, 0.0224609375, -0.01239013671875, -0.03955078125, 0.001434326171875, -0.031982421875, -0.00787353515625, -0.00469970703125, -0.0025177001953125, 0.018310546875, 0.0164794921875, -0.01141357421875, 0.0186767578125, 0.0120849609375, -0.0036773681640625, ...
[ 20625, 142508, 32635, 2199, 520, 6496, 21334, 11435, 31089, 1556, 2422, 23722, 50886, 135679, 603, 20697, 10723, 3871, 19048, 21265, 150679, 102158, 75073, 201939, 1614, 11090, 104851, 14364, 9790, 7026, 8382, 35644, 101912, 9148, 70870, 57553, ...
[ 0.1568603515625, 0.255615234375, 0.194091796875, 0.284423828125, 0.1343994140625, 0.045257568359375, 0.1761474609375, 0.1351318359375, 0.1197509765625, 0.140380859375, 0.08441162109375, 0.21630859375, 0.0909423828125, 0.12353515625, 0.149169921875, 0.0416259765625, 0.099365234375, ...
embed
57497146_c0
57497146
haskell
0
Title: How to use atomicModifyIORef with impure functions? Problem title: How to use atomicModifyIORef with impure functions? Tags: haskell Problem: How to use atomicModifyIORef with impure functions? I have a code like this: changedMap <- traverseMyMap s $ itemVisitor config atomicModifyIORef' (theMap s) $ \_map -> (c...
How to use atomicModifyIORef with impure functions? How to use atomicModifyIORef with impure functions? haskell How _map MyKey MyValue Maybe How to use atomicModifyIORef with impure functions? I have a code like this: which should be buggy, as I understand, because I ignore _map argument in modification function, which...
[ -0.0255126953125, 0.0213623046875, 0.033447265625, 0.00787353515625, -0.00116729736328125, 0.00360107421875, -0.0262451171875, -0.01153564453125, -0.001739501953125, -0.01019287109375, 0.03369140625, 0.03125, -0.00946044921875, 0.01806640625, 0.03759765625, -0.0086669921875, -0.00860...
[ 11249, 4527, 34627, 1771, 91616, 40383, 123435, 4240, 678, 21980, 3408, 32354, 1556, 142508, 62346, 2646, 162429, 856, 50770, 83425, 18151, 1884, 903, 5608, 373, 67192, 28219, 124962, 101, 10750, 129344, 3789, 86997, 831, 15549, 22288, 37317, ...
[ 0.087646484375, 0.1390380859375, 0.178955078125, 0.10577392578125, 0.1673583984375, 0.1256103515625, 0.14453125, 0.2486572265625, 0.1319580078125, 0.1561279296875, 0.2310791015625, 0.2008056640625, 0.1292724609375, 0.240478515625, 0.204833984375, 0.140869140625, 0.2398681640625, 0....
embed
34705334_c0
34705334
haskell
0
Title: `stack build` Issue with Yesod Problem title: `stack build` Issue with Yesod Tags: haskell-stack, haskell, yesod Problem: `stack build` Issue with Yesod I am trying to stack-build a new Yesod-based project on a clean (new) VPS server, which runs on Ubuntu Trusty x86_64. In case it matters for the question, here ...
`stack build` Issue with Yesod `stack build` Issue with Yesod haskell-stack haskell yesod Issue Yesod proj-web01 Mem Swap Lib Haskell2010 proj-web01-exe Main.hs Progress Version Git x86_64 Checking stack.yaml stack_Jo7PUTL0uTIFJF98jKr0KI:Stack.Config Stack Config.hs:577:9 Loading Config.hs:600:13 Run stack_Jo7PUTL0uTIF...
[ -0.0181884765625, 0.0255126953125, -0.003173828125, -0.00069427490234375, -0.017578125, 0.006683349609375, -0.0235595703125, -0.01495361328125, -0.00335693359375, 0.005706787109375, 0.02734375, -0.01336669921875, -0.0011444091796875, 0.0089111328125, 0.0137939453125, -0.002655029296875...
[ 590, 2594, 45367, 223317, 678, 32635, 2199, 1556, 142508, 2422, 23722, 502, 170, 14051, 6746, 17443, 43062, 43278, 20625, 11436, 46480, 12321, 127, 109816, 40647, 527, 217, 15276, 13307, 38679, 177261, 14520, 16604, 124599, 16665, 42378, 83671,...
[ 0.1876220703125, 0.182373046875, 0.2354736328125, 0.1690673828125, 0.09234619140625, 0.195556640625, 0.258056640625, 0.0936279296875, 0.1820068359375, 0.154296875, 0.2330322265625, 0.04742431640625, 0.0657958984375, 0.1083984375, 0.12255859375, 0.1353759765625, 0.1488037109375, 0.0...
embed
15424390_c0
15424390
haskell
0
Title: In Haskell, how do I install the encoding package on Windows? Problem title: In Haskell, how do I install the encoding package on Windows? Tags: cygwin, haskell, windows, cabal-install, cabal Problem: In Haskell, how do I install the encoding package on Windows? I'm a total newb with haskell and I'm making a tri...
In Haskell, how do I install the encoding package on Windows? In Haskell, how do I install the encoding package on Windows? cygwin haskell windows cabal-install cabal Haskell Windows Configuring encoding-0.6.7.2 setup.exe Missing system_encoding.h cabal.exe Error ExitFailure In Haskell, how do I install the encoding pa...
[ 0.0146484375, 0.005218505859375, 0.0029449462890625, -0.006439208984375, -0.00762939453125, 0.00110626220703125, -0.010498046875, -0.00238037109375, -0.01141357421875, 0.00020122528076171875, -0.00994873046875, -0.03271484375, 0.005645751953125, 0.00384521484375, 0.0003261566162109375, ...
[ 360, 20625, 142508, 3642, 20600, 22, 587, 6238, 98169, 98, 3773, 54, 19932, 177, 9494, 1556, 54825, 109524, 80383, 59994, 122887, 179642, 169581, 46480, 16771, 5426, 66332, 127, 212059, 5443, 217, 17647, 379, 275, 678, 13452, 11675, 18499, ...
[ 0.040313720703125, 0.1473388671875, 0.251220703125, 0.05487060546875, 0.205810546875, 0.119384765625, 0.22119140625, 0.161376953125, 0.19091796875, 0.09912109375, 0.19140625, 0.013946533203125, 0.0229339599609375, 0.014678955078125, 0.135009765625, 0.1376953125, 0.104736328125, 0.2...
embed
7267013_c0
7267013
haskell
0
Title: Parameterizing types by integers in Haskell Problem title: Parameterizing types by integers in Haskell Tags: algebraic-data-types, kdtree, haskell, higher-kinded-types Problem: Parameterizing types by integers in Haskell I am trying to make some Haskell types which are parametrized not by types but by elements o...
Parameterizing types by integers in Haskell Parameterizing types by integers in Haskell algebraic-data-types kdtree haskell higher-kinded-types Parameterizing Haskell TupleOfDoubles KDTree Double Parameterizing types by integers in Haskell I am trying to make some Haskell types which are parametrized not by types but b...
[ 0.008544921875, 0.02099609375, -0.018798828125, -0.0020294189453125, 0.004058837890625, 0.009033203125, -0.010986328125, -0.0247802734375, -0.0189208984375, -0.0172119140625, -0.0191650390625, -0.04150390625, -0.01312255859375, 0.0203857421875, -0.01220703125, -0.0033416748046875, 0....
[ 1720, 29089, 84382, 52895, 390, 892, 26255, 20625, 142508, 429, 10135, 50986, 472, 62600, 1556, 77546, 68347, 1371, 8705, 132887, 34, 13566, 341, 107, 107172, 31577, 3249, 39850, 959, 80854, 10644, 2256, 2844, 173, 18770, 627, 8353, 304, 13...
[ 0.115234375, 0.1644287109375, 0.0650634765625, 0.235107421875, 0.0614013671875, 0.1463623046875, 0.12939453125, 0.145751953125, 0.23779296875, 0.038787841796875, 0.0306396484375, 0.180419921875, 0.0153045654296875, 0.178466796875, 0.0780029296875, 0.0272216796875, 0.0277862548828125,...
embed
74594663_c0
74594663
haskell
0
Title: Recursive function in haskell to capitilize each word by in a list of strings Problem title: Recursive function in haskell to capitilize each word by in a list of strings Tags: function, haskell, recursion Problem: Recursive function in haskell to capitilize each word by in a list of strings I need to writea fun...
Recursive function in haskell to capitilize each word by in a list of strings Recursive function in haskell to capitilize each word by in a list of strings function haskell recursion Recursive x:xs capitilized2 y:ys Recursive function in haskell to capitilize each word by in a list of strings I need to writea function ...
[ -0.02001953125, 0.014892578125, 0.0008697509765625, -0.006805419921875, 0.0133056640625, 0.011474609375, 0.00147247314453125, 0.01287841796875, 0.021728515625, 0.0257568359375, 0.002655029296875, -0.0172119140625, 0.0025482177734375, 0.0172119140625, 0.0096435546875, 0.00830078125, 0...
[ 853, 48650, 5844, 32354, 1556, 142508, 65226, 2104, 731, 12638, 2565, 390, 5303, 79315, 23, 195625, 1830, 1022, 425, 379, 29367, 304, 113, 4778, 33022, 44759, 4332, 238, 1984, 71713, 33079, 214, 34153, 10323, 62093, 5608, 52021, 27798, 1503...
[ 0.02142333984375, 0.1839599609375, 0.0833740234375, 0.156494140625, 0.13330078125, 0.212646484375, 0.1749267578125, 0.10064697265625, 0.041778564453125, 0.09210205078125, 0.1875, 0.15478515625, 0.127685546875, 0.17333984375, 0.001861572265625, 0.2020263671875, 0.003173828125, 0.012...
embed
6623316_c1
6623316
haskell
1
1 102334155 real 0m3.712s user 0m0.016s sys 0m0.046s [4] $ time ./test +RTS -N2 ## number of core = 2 102334155 real 0m1.646s user 0m0.016s sys 0m0.046s Second question As can be seen from above, I am using the time command to measure the runtimes. I am taking the 'real' time. But if I run the program with the -sstderr...
1 102334155 real 0m3.712s user 0m0.016s sys 0m0.046s [4] $ time ./test +RTS -N2 ## number of core = 2 102334155 real 0m1.646s user 0m0.016s sys 0m0.046s Second question As can be seen from above, I am using the time command to measure the runtimes. I am taking the 'real' time. But if I run the program with the -sstderr...
[ -0.00909423828125, 0.0010986328125, 0.00193023681640625, -0.0050048828125, 0.00830078125, -0.0103759765625, -0.0196533203125, 0.0155029296875, -0.0072021484375, -0.040283203125, 0.005615234375, -0.00494384765625, -0.00066375732421875, -0.0162353515625, 0.0052490234375, 0.0205078125, ...
[ 106, 30669, 124618, 119477, 2773, 757, 109981, 1530, 7, 38937, 182149, 910, 954, 99929, 9271, 59535, 1733, 6954, 997, 20503, 294, 304, 14012, 56458, 116, 9655, 17368, 75101, 72350, 11675, 70141, 35971, 30544, 1528, 678, 20, 271, 820, 42, ...
[ 0.01287841796875, 0.126220703125, 0.1435546875, 0.173583984375, 0.168701171875, 0.09796142578125, 0.094970703125, 0.0806884765625, 0.053955078125, 0.1773681640625, 0.0986328125, 0.0828857421875, 0.09844970703125, 0.05657958984375, 0.15283203125, 0.00860595703125, 0.217041015625, 0....
embed
6085347_c0
6085347
haskell
0
Title: Haskell list comprehension for finding primes Problem title: Haskell list comprehension for finding primes Tags: haskell, syntax, list-comprehension, primes, syntax-error Problem: Haskell list comprehension for finding primes I'm trying to find all the primes less than some integer n as concisely as possible, us...
Haskell list comprehension for finding primes Haskell list comprehension for finding primes haskell syntax list-comprehension primes syntax-error Haskell Integral exercise-99-1.hs:138:39 Not exercise-99-1.hs:138:46 Illegal XParallelListComp exercise-99-1.hs:138:68 Haskell list comprehension for finding primes I'm tryin...
[ -0.025390625, 0.0079345703125, 0.0216064453125, -0.007110595703125, 0.024658203125, 0.00897216796875, -0.00176239013671875, -0.014404296875, 0.006378173828125, -0.022705078125, -0.0042724609375, -0.01031494140625, 0.01104736328125, -0.00811767578125, -0.037109375, 0.001800537109375, ...
[ 20625, 142508, 5303, 46683, 3220, 6889, 100, 90791, 20809, 7, 1556, 6002, 86531, 277, 4692, 188800, 204681, 81979, 15205, 179219, 127, 141535, 34539, 11205, 32909, 891, 86966, 1193, 55292, 1229, 154663, 108161, 16028, 31577, 7413, 756, 40715, ...
[ 0.1380615234375, 0.2066650390625, 0.1815185546875, 0.17431640625, 0.175048828125, 0.069091796875, 0.009735107421875, 0.1165771484375, 0.2418212890625, 0.058441162109375, 0.130859375, 0.1234130859375, 0.1883544921875, 0.006866455078125, 0.12060546875, 0.1593017578125, 0.1455078125, ...
embed
60469338_c0
60469338
haskell
0
Title: Getting a first element of the list within IO monad Problem title: Getting a first element of the list within IO monad Tags: haskell, io-monad Problem: Getting a first element of the list within IO monad I'm trying to get the first element from the chain of IO monads (as far as I understand, I'm still learning H...
Getting a first element of the list within IO monad Getting a first element of the list within IO monad haskell io-monad Getting FilePath pom.xml Couldn Char Expected Actual Getting a first element of the list within IO monad I'm trying to get the first element from the chain of IO monads (as far as I understand, I'm s...
[ 0.000331878662109375, -0.000873565673828125, 0.00080108642578125, -0.00176239013671875, 0.0040283203125, 0.01300048828125, -0.00182342529296875, -0.006256103515625, 0.0007781982421875, -0.03662109375, 0.035400390625, 0.0027618408203125, -0.0029449462890625, -0.0005950927734375, -0.004547...
[ 210732, 10, 5117, 12830, 111, 5303, 28032, 17780, 2667, 712, 1556, 142508, 22995, 3796, 42724, 683, 10519, 26378, 131492, 191147, 19, 21656, 60075, 13, 100582, 31577, 2046, 1295, 121293, 52080, 20625, 18499, 135179, 59911, 10336, 32354, 272, ...
[ 0.1317138671875, 0.138916015625, 0.204345703125, 0.194091796875, 0.063232421875, 0.158935546875, 0.126953125, 0.2418212890625, 0.1337890625, 0.193115234375, 0.0966796875, 0.2052001953125, 0.2183837890625, 0.1485595703125, 0.15283203125, 0.08428955078125, 0.1461181640625, 0.14685058...
embed
70023464_c0
70023464
haskell
0
Title: How to get this function to be evaluated lazily Problem title: How to get this function to be evaluated lazily Tags: haskell Problem: How to get this function to be evaluated lazily I have the following function: main = do xs <- getContents edLines <- ed $ lines xs putStr $ unlines edLines Firstly I used the wor...
How to get this function to be evaluated lazily How to get this function to be evaluated lazily haskell How Bool EdCmdLine EdLines Leaf EdState r:_ Foldable Monad How to get this function to be evaluated lazily I have the following function: Firstly I used the working version main = interact (unlines . ed . lines) but ...
[ 0.005279541015625, 0.0021514892578125, 0.01116943359375, -0.004547119140625, -0.0019073486328125, 0.0274658203125, 0.00897216796875, 0.015380859375, 0.006561279296875, -0.0247802734375, 0.012451171875, -0.00494384765625, 0.0004787445068359375, -0.00148773193359375, 0.01263427734375, 0....
[ 11249, 2046, 903, 32354, 151575, 297, 21, 708, 538, 47, 1556, 142508, 2460, 929, 10462, 54686, 93232, 636, 2407, 135206, 30077, 71, 2886, 60331, 20697, 11389, 5201, 78974, 309, 59801, 2223, 124519, 98816, 138256, 30646, 17780, 71713, 214, 1...
[ 0.029083251953125, 0.0816650390625, 0.0870361328125, 0.193603515625, 0.2049560546875, 0.059326171875, 0.149169921875, 0.16845703125, 0.1376953125, 0.005096435546875, 0.1324462890625, 0.244384765625, 0.065185546875, 0.182861328125, 0.11865234375, 0.07159423828125, 0.232421875, 0.031...
embed
56129585_c0
56129585
haskell
0
Title: Good examples of not a Contravariant/Contravariant/Divisible/Decidable? Problem title: Good examples of not a Contravariant/Contravariant/Divisible/Decidable? Tags: contravariant, typeclass, haskell, functor Problem: Good examples of not a Contravariant/Contravariant/Divisible/Decidable? The Contravariant family...
Good examples of not a Contravariant/Contravariant/Divisible/Decidable? Good examples of not a Contravariant/Contravariant/Divisible/Decidable? contravariant typeclass haskell functor Good Contravariant Divisible Decidable Either Good examples of not a Contravariant/Contravariant/Divisible/Decidable? The Contravariant ...
[ 0.008544921875, -0.01177978515625, -0.0078125, 0.0052490234375, 0.0120849609375, 0.0035858154296875, -0.01324462890625, -0.024658203125, 0.004180908203125, 0.02587890625, -0.01318359375, -0.02490234375, 0.0172119140625, 0.03857421875, 0.00170135498046875, -0.01495361328125, 0.0026245...
[ 18621, 27781, 959, 10, 45380, 162591, 11935, 1517, 14055, 99017, 120152, 532, 2886, 2304, 10644, 67413, 1556, 142508, 7477, 18770, 803, 49132, 71, 14449, 33636, 5570, 20531, 164789, 20625, 16751, 28219, 23755, 50155, 105416, 3355, 302, 11205, ...
[ 0.0899658203125, 0.1690673828125, 0.1826171875, 0.03369140625, 0.2308349609375, 0.2454833984375, 0.00653076171875, 0.1165771484375, 0.0662841796875, 0.1826171875, 0.099365234375, 0.0819091796875, 0.1485595703125, 0.1824951171875, 0.1793212890625, 0.1826171875, 0.07586669921875, 0.1...
embed
12660323_c0
12660323
haskell
0
Title: What alternatives are there to return a string that contains null values from a Haskell shared library to be used in C? Problem title: What alternatives are there to return a string that contains null values from a Haskell shared library to be used in C? Tags: binary-data, c, ffi, haskell, shared-libraries Probl...
What alternatives are there to return a string that contains null values from a Haskell shared library to be used in C? What alternatives are there to return a string that contains null values from a Haskell shared library to be used in C? binary-data c ffi haskell shared-libraries a What Haskell CString CStringLen Byt...
[ 0.0223388671875, 0.00286865234375, 0.006011962890625, 0.0390625, -0.01324462890625, -0.0130615234375, 0.0130615234375, -0.0213623046875, 0.0068359375, -0.001312255859375, -0.006927490234375, -0.036376953125, 0.00762939453125, 0.01336669921875, -0.0034637451171875, -0.00775146484375, ...
[ 30700, 30646, 79315, 70541, 56574, 142424, 20625, 142508, 99764, 35773, 11814, 313, 2394, 6635, 10135, 24500, 1556, 150, 2844, 10, 4865, 25841, 18, 2852, 866, 33, 3311, 67, 71713, 214, 1295, 23, 57278, 93457, 42, 51776, 678, 89845, 18151, ...
[ 0.1690673828125, 0.2076416015625, 0.2447509765625, 0.137451171875, 0.2169189453125, 0.1663818359375, 0.1273193359375, 0.2081298828125, 0.15283203125, 0.1668701171875, 0.0826416015625, 0.118408203125, 0.1522216796875, 0.0794677734375, 0.10064697265625, 0.1502685546875, 0.0888061523437...
embed
28416827_c0
28416827
haskell
0
Title: Cabal and HPC and Errors when Running Tests with Code Coverage Problem title: Cabal and HPC and Errors when Running Tests with Code Coverage Tags: cabal, haskell Problem: Cabal and HPC and Errors when Running Tests with Code Coverage I use Cabal to run my tests. Here is how it is configured in the .cabal file: t...
Cabal and HPC and Errors when Running Tests with Code Coverage Cabal and HPC and Errors when Running Tests with Code Coverage cabal haskell Cabal HPC Errors Running Tests Coverage exitcode-stdio-1.0 Test.hs QuickCheck HUnit test-framework-quickcheck2 Haskell2010 Wall test.tix Cabal and HPC and Errors when Running Tests...
[ 0.0174560546875, 0.01226806640625, 0.0089111328125, 0.00384521484375, -0.0072021484375, -0.0047607421875, -0.0240478515625, 0.01104736328125, 0.0125732421875, -0.006683349609375, -0.01904296875, -0.004608154296875, -0.005706787109375, 0.0054931640625, 0.007537841796875, 0.036865234375,...
[ 30438, 289, 136, 572, 12233, 212059, 28398, 8647, 678, 28864, 76417, 109524, 1556, 142508, 82230, 40899, 5670, 102107, 127, 89038, 202567, 22438, 6773, 3034, 160328, 3181, 78292, 304, 20625, 11436, 23706, 118, 425, 4527, 11675, 109921, 222495, ...
[ 0.2401123046875, 0.217041015625, 0.08837890625, 0.09033203125, 0.1768798828125, 0.1868896484375, 0.09527587890625, 0.19970703125, 0.098388671875, 0.1341552734375, 0.148193359375, 0.236083984375, 0.0811767578125, 0.1744384765625, 0.1165771484375, 0.1021728515625, 0.107666015625, 0.0...
embed
19065899_c0
19065899
haskell
0
Title: Why does these instances not produce the Overlapping Instances error Problem title: Why does these instances not produce the Overlapping Instances error Tags: haskell Problem: Why does these instances not produce the Overlapping Instances error Let's define a collapse function that collapses any possibly nested ...
Why does these instances not produce the Overlapping Instances error Why does these instances not produce the Overlapping Instances error haskell Why Overlapping Instances Maybe LANGUAGE FlexibleInstances IncoherentInstances MultiParamTypeClasses NoOverlappingInstances TypeFamilies MaybeCollapsable Nothing Just XNoOver...
[ -0.0069580078125, -0.00396728515625, 0.01104736328125, 0.00013446807861328125, -0.0034027099609375, 0.0303955078125, -0.0023193359375, -0.0185546875, 0.01239013671875, 0.00189971923828125, -0.00384521484375, -0.0235595703125, 0.0089111328125, 0.021240234375, 0.01190185546875, -0.018798...
[ 44084, 14602, 6097, 110527, 959, 27489, 9578, 143, 26783, 116071, 18499, 1556, 142508, 83425, 3358, 98064, 180842, 2661, 587, 3334, 19335, 55292, 196707, 140803, 438, 156673, 60457, 1191, 96091, 2886, 182747, 1193, 5021, 61924, 3365, 127966, 32...
[ 0.0633544921875, 0.0178375244140625, 0.0751953125, 0.236328125, 0.1116943359375, 0.1097412109375, 0.1290283203125, 0.19970703125, 0.1793212890625, 0.2034912109375, 0.1700439453125, 0.1107177734375, 0.2169189453125, 0.24951171875, 0.003143310546875, 0.062469482421875, 0.087890625, 0...
embed
22424780_c1
22424780
haskell
1
In the first argument of `(||)', namely `findpath z y edges edges nodes ++ [z]' In the expression: (findpath z y edges edges nodes ++ [z] || findpath y z edges edges nodes ++ [z]) In an equation for `findpath': findpath x y ((w, z) : xs) edges nodes | ((x == w && y == z) || (x == z && y == w)) = True | (x == w && not ...
In the first argument of `(||)', namely `findpath z y edges edges nodes ++ [z]' In the expression: (findpath z y edges edges nodes ++ [z] || findpath y z edges edges nodes ++ [z]) In an equation for `findpath': findpath x y ((w, z) : xs) edges nodes | ((x == w && y == z) || (x == z && y == w)) = True | (x == w && not ...
[ -0.00408935546875, -0.0107421875, 0.002197265625, 0.0224609375, -0.01556396484375, -0.00958251953125, -0.01275634765625, -0.00994873046875, 0.01055908203125, 0.0157470703125, -0.00010013580322265625, -0.00274658203125, 0.0002384185791015625, -0.011962890625, 0.01251220703125, 0.0178222...
[ 360, 5117, 10750, 111, 9473, 132, 58745, 110987, 111607, 128405, 97, 113, 121303, 7, 110, 988, 37223, 169, 125195, 15, 7413, 28, 5490, 100, 1022, 434, 148, 619, 1230, 87599, 959, 27417, 120262, 13452, 5442, 127, 35315, 97024, 191147, 18, ...
[ 0.0758056640625, 0.125, 0.248779296875, 0.03228759765625, 0.03729248046875, 0.085693359375, 0.2274169921875, 0.059539794921875, 0.187744140625, 0.253173828125, 0.1229248046875, 0.1787109375, 0.196044921875, 0.04791259765625, 0.1446533203125, 0.1510009765625, 0.224365234375, 0.13098...
embed
79546898_c1
79546898
haskell
1
(maintainInfo (Node lr value nilInfo rs))) rotateR :: Tree a -> Tree a rotateR (Node ls value _ (Node rl rv _ rr)) = maintainInfo (Node (maintainInfo (Node ls value nilInfo rl)) rv nilInfo rr) rotateL_ :: Tree a -> Tree a rotateL_ (Node (Node ll lv _ lr) value _ rs) | height ll >= height lr = rotateL (Node (Node ll lv...
(maintainInfo (Node lr value nilInfo rs))) rotateR :: Tree a -> Tree a rotateR (Node ls value _ (Node rl rv _ rr)) = maintainInfo (Node (maintainInfo (Node ls value nilInfo rl)) rv nilInfo rr) rotateL_ :: Tree a -> Tree a rotateL_ (Node (Node ll lv _ lr) value _ rs) | height ll >= height lr = rotateL (Node (Node ll lv...
[ -0.00994873046875, 0.00144195556640625, 0.01031494140625, -0.025634765625, -0.00051116943359375, 0.0089111328125, -0.02197265625, -0.03564453125, -0.01263427734375, 0.01214599609375, 0.006622314453125, -0.005828857421875, 0.0164794921875, -0.01312255859375, 0.0036773681640625, 0.000820...
[ 15, 24931, 25500, 93147, 5021, 112, 96, 42, 34292, 17324, 151756, 32149, 47014, 67, 1052, 1984, 101344, 10, 33079, 54123, 33760, 29161, 76104, 866, 1181, 3723, 155955, 120262, 3004, 997, 183540, 143045, 77175, 3502, 720, 37223, 28864, 26073, ...
[ 0.008270263671875, 0.1649169921875, 0.171630859375, 0.278076171875, 0.174560546875, 0.1024169921875, 0.08734130859375, 0.0751953125, 0.1917724609375, 0.1656494140625, 0.111572265625, 0.0859375, 0.20361328125, 0.1741943359375, 0.162353515625, 0.0751953125, 0.25634765625, 0.175048828...
embed
56060053_c0
56060053
haskell
0
Title: Write a function that counts the number of elements in a rosetree Problem title: Write a function that counts the number of elements in a rosetree Tags: haskell Problem: Write a function that counts the number of elements in a rosetree Write a function that counts the number of elements in a rosetree. I tried co...
Write a function that counts the number of elements in a rosetree Write a function that counts the number of elements in a rosetree haskell Write RoseTree RoseNode Show Granny Smith Pink Lady Planet Earth Mars Star Sun Sirius Galaxy Milky Way x:xs Write a function that counts the number of elements in a rosetree Write ...
[ -0.00135040283203125, 0.0152587890625, -0.019775390625, -0.0023040771484375, 0.009521484375, 0.01495361328125, -0.00732421875, -0.01556396484375, 0.0233154296875, -0.020751953125, -0.006591796875, -0.01953125, 0.0260009765625, 0.022216796875, 0.00958251953125, -0.01531982421875, -0.0...
[ 601, 18781, 32354, 54529, 14012, 80854, 23, 10, 49175, 62600, 1556, 142508, 24009, 62731, 13, 5021, 112, 17367, 14091, 299, 37700, 59849, 40073, 40357, 64883, 23342, 4612, 7550, 41668, 223, 13356, 10663, 1002, 42261, 1022, 425, 37842, 1650, ...
[ 0.048095703125, 0.0787353515625, 0.21142578125, 0.186767578125, 0.1502685546875, 0.246826171875, 0.0987548828125, 0.078857421875, 0.17333984375, 0.31005859375, 0.1495361328125, 0.232177734375, 0.179443359375, 0.268310546875, 0.03875732421875, 0.154052734375, 0.1405029296875, 0.1445...
embed
25152634_c0
25152634
haskell
0
Title: weird type issue in haskell giving me issues (Par Monad) Problem title: weird type issue in haskell giving me issues (Par Monad) Tags: types, haskell Problem: weird type issue in haskell giving me issues (Par Monad) For reference my code. import Control.Monad.Par makeGridx:: (Enum a,Num a)=>a->a->a->[a] makeGrid...
weird type issue in haskell giving me issues (Par Monad) weird type issue in haskell giving me issues (Par Monad) types haskell Control.Monad.Par Par Monad Enum Num x:xs t:ts phi:phis phi1 ph2 ph3:phis IVar ph3 Fractional heateqpar.hs:28:156 Couldn Expected Actual weird type issue in haskell giving me issues (Par Monad...
[ -0.01483154296875, 0.014892578125, 0.0001621246337890625, -0.00616455078125, 0.006744384765625, 0.00885009765625, 0.00439453125, -0.0223388671875, 0.00933837890625, -0.01165771484375, -0.0133056640625, 0.011474609375, 0.019287109375, -0.0036773681640625, -0.012939453125, -0.025390625, ...
[ 179459, 10644, 31089, 23, 1556, 142508, 68772, 163, 37348, 28636, 60331, 71, 52895, 27131, 46674, 712, 2392, 357, 316, 52782, 1022, 425, 933, 44171, 19379, 418, 11521, 363, 7610, 147, 7868, 80097, 2500, 28270, 155740, 191147, 60075, 13, 100...
[ 0.20068359375, 0.2135009765625, 0.1627197265625, 0.0241546630859375, 0.1427001953125, 0.240966796875, 0.083984375, 0.05303955078125, 0.167724609375, 0.1031494140625, 0.12109375, 0.08734130859375, 0.1761474609375, 0.1661376953125, 0.069580078125, 0.080078125, 0.09625244140625, 0.016...
embed
20204746_c1
20204746
haskell
1
−> Bool endOfGame game = sum gane == 0 symbol :: Int −> IO () symbol n = do winner <− play [1..n] first putStrLn $ show winner ++ " Player Won! " All the functions i just wrote i think are 100% correct, but there are three of them i'm struggling with: getNumber :: String −> (Int −> Bool) −> IO Int getNumber = do num <...
−> Bool endOfGame game = sum gane == 0 symbol :: Int −> IO () symbol n = do winner <− play [1..n] first putStrLn $ show winner ++ " Player Won! " All the functions i just wrote i think are 100% correct, but there are three of them i'm struggling with: getNumber :: String −> (Int −> Bool) −> IO Int getNumber = do num <...
[ -0.0322265625, -0.006134033203125, 0.0205078125, 0.02490234375, 0.001983642578125, 0.006195068359375, 0.006927490234375, -0.005035400390625, 0.0186767578125, 0.018798828125, -0.00823974609375, -0.002410888671875, -0.0128173828125, -0.002410888671875, -0.0255126953125, -0.004150390625, ...
[ 48768, 2740, 2460, 929, 3564, 132887, 107576, 6712, 10554, 1756, 13, 69112, 757, 26582, 360, 18, 17780, 653, 54, 159690, 11301, 19, 5117, 3884, 71713, 3650, 7639, 37223, 60560, 104525, 38, 32354, 54397, 5351, 3555, 26785, 17262, 17, 39, 2...
[ 0.010833740234375, 0.0186767578125, 0.1064453125, 0.2113037109375, 0.132568359375, 0.1622314453125, 0.24169921875, 0.1466064453125, 0.1575927734375, 0.056854248046875, 0.07513427734375, 0.031494140625, 0.134521484375, 0.2025146484375, 0.037109375, 0.0760498046875, 0.1708984375, 0.0...
embed
22094971_c0
22094971
haskell
0
Title: What are the differences between lenses and zippers? Problem title: What are the differences between lenses and zippers? Tags: clojure, haskell-lens, functional-programming, haskell, zipper Problem: What are the differences between lenses and zippers? This is an example of using a zipper in Haskell: data Tree a ...
What are the differences between lenses and zippers? What are the differences between lenses and zippers? clojure haskell-lens functional-programming haskell zipper What Tree Fork Leaf Cxt Top Loc clojure.zip Person Address User What are the differences between lenses and zippers? This is an example of using a zipper i...
[ -0.00063323974609375, 0.00543212890625, -0.006591796875, -0.0042724609375, -0.000774383544921875, 0.00970458984375, -0.0233154296875, -0.0220947265625, 0.0009613037109375, -0.0252685546875, -0.007354736328125, 0.0164794921875, 0.001251220703125, -0.0020904541015625, 0.013427734375, -0....
[ 60212, 7, 17721, 96, 47754, 136, 68330, 21777, 20450, 461, 107, 1556, 142508, 1977, 123309, 28966, 3546, 8079, 101344, 1326, 92, 2407, 29062, 4792, 88784, 50836, 15270, 49990, 53400, 27781, 17368, 23, 20625, 51053, 18226, 15044, 48322, 37317,...
[ 0.2041015625, 0.112060546875, 0.1300048828125, 0.176513671875, 0.23193359375, 0.11962890625, 0.213623046875, 0.2373046875, 0.08642578125, 0.1383056640625, 0.10107421875, 0.07537841796875, 0.2177734375, 0.1505126953125, 0.14453125, 0.07891845703125, 0.1661376953125, 0.2242431640625,...
embed
9960269_c0
9960269
haskell
0
Title: Can&#x27;t install gtk-mac-integration Problem title: Can&#x27;t install gtk-mac-integration Tags: macos, leksah, haskell, gtk, cabal Problem: Can't install gtk-mac-integration I don't understand the error because it appears to be requiring a version of the same package that I'm trying to install. $ cabal instal...
Can&#x27;t install gtk-mac-integration Can&#x27;t install gtk-mac-integration macos leksah haskell gtk cabal Can Resolving Compiling SetupWrapper cUDMo9 h1DAvk Tmp gtk-mac-integration-0.1.0.46479 gtk-mac-integration-0.1.0.4 SetupWrapper.hs SetupWrapper.o Main Setup.hs Main.o Linking Gtk2HsSetup Gtk2HsSetup.hs Gtk2HsSet...
[ -0.01043701171875, 0.024169921875, 0.00823974609375, 0.002532958984375, 0.00628662109375, 0.004241943359375, -0.0108642578125, -0.0125732421875, -0.008056640625, 0.01275634765625, -0.01177978515625, -0.04296875, -0.0142822265625, -0.01275634765625, 0.01904296875, 0.0067138671875, -0....
[ 4171, 3768, 18, 20600, 706, 31472, 9, 35572, 100743, 1363, 291, 7840, 17143, 23474, 1556, 142508, 109524, 132944, 15612, 49725, 19943, 2037, 219, 8079, 26119, 9083, 1126, 334, 92, 2676, 102107, 9271, 165131, 102014, 121254, 127, 31, 12321, ...
[ 0.121826171875, 0.04473876953125, 0.1060791015625, 0.2073974609375, 0.08526611328125, 0.244384765625, 0.0218353271484375, 0.2093505859375, 0.2381591796875, 0.05841064453125, 0.0802001953125, 0.09991455078125, 0.0787353515625, 0.1732177734375, 0.1026611328125, 0.196044921875, 0.183593...
embed
25835294_c0
25835294
haskell
0
Title: Configure cabal upload to work with local hackage-server Problem title: Configure cabal upload to work with local hackage-server Tags: hackage, haskell, cabal Problem: Configure cabal upload to work with local hackage-server I have a local hackage-server installed for development at 192.168.1.100:8080 . After I ...
Configure cabal upload to work with local hackage-server Configure cabal upload to work with local hackage-server hackage haskell cabal Configure Uploading my-package-0.1.1.0.tar.gz Error Not Found Page Sorry hackage.haskell.org:http hackage.haskell.org my.hackage:http Configure cabal upload to work with local hackage-...
[ 0.000904083251953125, 0.0211181640625, 0.01263427734375, 0.0130615234375, -0.01953125, -0.00665283203125, -0.01531982421875, 0.003265380859375, 0.0029449462890625, 0.01092529296875, -0.01220703125, -0.01434326171875, 0.036376953125, 0.00506591796875, 0.0004787445068359375, -0.014526367...
[ 1657, 59994, 109524, 70622, 47, 4488, 678, 4000, 85526, 4588, 39642, 1556, 142508, 171958, 759, 29102, 102014, 102107, 867, 177, 212059, 11205, 215624, 14231, 90502, 10557, 1478, 5475, 139509, 20600, 34754, 90644, 93657, 3559, 4836, 85493, 9816...
[ 0.045501708984375, 0.204345703125, 0.288818359375, 0.251953125, 0.07012939453125, 0.130615234375, 0.138427734375, 0.1685791015625, 0.2005615234375, 0.1641845703125, 0.187744140625, 0.1270751953125, 0.2159423828125, 0.1898193359375, 0.10211181640625, 0.1591796875, 0.1309814453125, 0...
embed
74420265_c0
74420265
haskell
0
Title: Haskell Float to Int to Float conversion Error Problem title: Haskell Float to Int to Float conversion Error Tags: type-conversion, haskell Problem: Haskell Float to Int to Float conversion Error I want to convert the a Floating Point Number (0,123456) and round it with b (positive whole number). I use the trunc...
Haskell Float to Int to Float conversion Error Haskell Float to Int to Float conversion Error type-conversion haskell a Haskell Float Error Double Integral Variable Haskell Float to Int to Float conversion Error I want to convert the a Floating Point Number (0,123456) and round it with b (positive whole number). I use ...
[ -0.002105712890625, -0.01470947265625, 0.01104736328125, 0.00390625, 0.000484466552734375, 0.0001544952392578125, -0.007415771484375, -0.0225830078125, 0.0115966796875, 0.02392578125, -0.034423828125, -0.009521484375, 0.0003986358642578125, 0.00016307830810546875, 0.01324462890625, 0.0...
[ 20625, 142508, 38699, 257, 47, 360, 18, 142477, 212059, 10644, 2271, 46354, 1556, 10, 107172, 204681, 84572, 2886, 3444, 96760, 26518, 41097, 103332, 22085, 4, 190875, 74757, 68807, 442, 678, 876, 67890, 28271, 14012, 4527, 14617, 19, 33478, ...
[ 0.1893310546875, 0.26611328125, 0.26416015625, 0.1724853515625, 0.118408203125, 0.1583251953125, 0.196533203125, 0.2193603515625, 0.2047119140625, 0.1387939453125, 0.07061767578125, 0.1435546875, 0.162353515625, 0.0657958984375, 0.12841796875, 0.1849365234375, 0.1395263671875, 0.01...
embed
75149401_c0
75149401
haskell
0
Title: Data constructor not in scope despite copy-pasting exact code and importing module Problem title: Data constructor not in scope despite copy-pasting exact code and importing module Tags: state-monad, stateful, haskell, module Problem: Data constructor not in scope despite copy-pasting exact code and importing mo...
Data constructor not in scope despite copy-pasting exact code and importing module Data constructor not in scope despite copy-pasting exact code and importing module state-monad stateful haskell module Control.Monad.State Data Stack State x:xs a:xs state.hs:6:7 state.hs:9:10 Failed Data constructor not in scope despite...
[ -0.001861572265625, -0.0028533935546875, -0.03173828125, 0.0240478515625, 0.007781982421875, 0.01806640625, 0.0225830078125, -0.0009613037109375, -0.007232666015625, -0.052490234375, 0.001312255859375, -0.033447265625, 0.0031280517578125, -0.004730224609375, 0.000301361083984375, -0.00...
[ 11809, 64549, 748, 959, 23, 70820, 61518, 43658, 3166, 24763, 18151, 24927, 88996, 1916, 11341, 3796, 712, 7844, 1556, 142508, 27131, 46674, 135206, 6512, 2594, 22836, 1022, 425, 10, 127, 910, 966, 1126, 15110, 190355, 31577, 11675, 2684, 8...
[ 0.1365966796875, 0.2266845703125, 0.14599609375, 0.1214599609375, 0.11767578125, 0.2274169921875, 0.0723876953125, 0.1270751953125, 0.1229248046875, 0.1539306640625, 0.1463623046875, 0.1663818359375, 0.1951904296875, 0.00177001953125, 0.1468505859375, 0.087890625, 0.1123046875, 0.1...
embed
57902098_c0
57902098
haskell
0
Title: No ghc or ghci commands after installing in Windows Problem title: No ghc or ghci commands after installing in Windows Tags: haskell, windows, installation Problem: No ghc or ghci commands after installing in Windows I downloaded HaskellPlatform-core setup file from here and installed it. The installation proces...
No ghc or ghci commands after installing in Windows No ghc or ghci commands after installing in Windows haskell windows installation Windows Program Files Haskell Platform ghc-stage2.exe Directory DIR haddock.exe hp2ps.exe hpc.exe hsc2hs.exe runghc.exe runhaskell.exe File No ghc or ghci commands after installing in Win...
[ 0.0035247802734375, 0.01385498046875, 0.0185546875, 0.0033111572265625, -0.00811767578125, 0.0208740234375, -0.005218505859375, -0.015869140625, -0.004669189453125, 0.0245361328125, -0.00848388671875, -0.0166015625, -0.00811767578125, -0.01190185546875, 0.005950927734375, 0.00160980224...
[ 438, 31380, 238, 707, 318, 75101, 7, 7103, 20600, 23, 3773, 1556, 142508, 54825, 59720, 7663, 42724, 20625, 70968, 16852, 5442, 46480, 31068, 123237, 1902, 138414, 118258, 304, 6423, 1096, 10382, 127, 120649, 11675, 10557, 7026, 117231, 5037,...
[ 0.1226806640625, 0.1767578125, 0.157470703125, 0.11279296875, 0.1929931640625, 0.2509765625, 0.03375244140625, 0.10009765625, 0.163330078125, 0.0513916015625, 0.1417236328125, 0.158447265625, 0.2420654296875, 0.07830810546875, 0.0933837890625, 0.0928955078125, 0.0863037109375, 0.15...
embed
11457687_c0
11457687
haskell
0
Title: Composable atomic-like operations Problem title: Composable atomic-like operations Tags: transactions, haskell, atomic Problem: Composable atomic-like operations I want to compose operations that may fail, but there is a way to roll back. For example - an external call to book a hotel room, and an external call ...
Composable atomic-like operations Composable atomic-like operations transactions haskell atomic Composable STM Atomic Composable atomic-like operations I want to compose operations that may fail, but there is a way to roll back. For example - an external call to book a hotel room, and an external call to charge a credi...
[ -0.019287109375, 0.010986328125, 0.007415771484375, 0.01409912109375, 0.01239013671875, 0.006561279296875, 0.004791259765625, 0.015869140625, -0.0126953125, -0.0031585693359375, 0.00122833251953125, 0.0164794921875, 0.007598876953125, 0.0234375, 0.00726318359375, 0.005340576171875, -...
[ 15612, 232, 2886, 34627, 1771, 5062, 41018, 124161, 1556, 142508, 159, 10111, 69728, 3444, 150350, 1543, 35782, 1284, 3917, 47, 21972, 4420, 173591, 11782, 12877, 3018, 17155, 25534, 22299, 20596, 149766, 110, 112875, 25737, 56649, 765, 48322, ...
[ 0.1461181640625, 0.16015625, 0.138427734375, 0.1785888671875, 0.1075439453125, 0.162109375, 0.203369140625, 0.197998046875, 0.138671875, 0.249267578125, 0.03759765625, 0.2138671875, 0.183837890625, 0.047119140625, 0.2076416015625, 0.1744384765625, 0.222412109375, 0.0196075439453125...
embed
1330400_c0
1330400
haskell
0
Title: Haskell: -fglasgow-exts should one avoid code that requires this? Problem title: Haskell: -fglasgow-exts should one avoid code that requires this? Tags: coding-style, haskell Problem: Haskell: -fglasgow-exts should one avoid code that requires this? I am a beginner with Haskell and I've started seeing errors sim...
Haskell: -fglasgow-exts should one avoid code that requires this? Haskell: -fglasgow-exts should one avoid code that requires this? coding-style haskell Haskell Illegal Haskell: -fglasgow-exts should one avoid code that requires this? I am a beginner with Haskell and I've started seeing errors similar to: I am working ...
[ -0.00390625, 0.01202392578125, 0.004730224609375, -0.0205078125, -0.003936767578125, 0.005615234375, -0.011962890625, 0.0010528564453125, -0.015380859375, -0.0546875, 0.010009765625, -0.0091552734375, 0.0264892578125, 0.001800537109375, -0.01361083984375, -0.00848388671875, 0.0239257...
[ 20625, 142508, 20, 420, 21462, 519, 434, 3355, 933, 5608, 71864, 18151, 144570, 903, 552, 40946, 1556, 891, 86966, 1632, 1679, 18499, 21373, 20697, 28032, 31380, 318, 678, 238, 5117, 14037, 33938, 40225, 111938, 172554, 1379, 538, 135094, 8...
[ 0.1339111328125, 0.25634765625, 0.041473388671875, 0.076904296875, 0.17578125, 0.191650390625, 0.1798095703125, 0.1378173828125, 0.131103515625, 0.08135986328125, 0.1947021484375, 0.177001953125, 0.1455078125, 0.057159423828125, 0.058349609375, 0.080810546875, 0.0802001953125, 0.05...
embed
41130707_c0
41130707
haskell
0
Title: How can I generalize this in-place Selection Sort? Problem title: How can I generalize this in-place Selection Sort? Tags: haskell Problem: How can I generalize this in-place Selection Sort? Below is an implementation of a selection sort in the ST Monad. The input array is copied to a STUArray s Int Int with tha...
How can I generalize this in-place Selection Sort? How can I generalize this in-place Selection Sort? haskell a the How Selection Sort STUArray UArray forM_ l..n i..n FlexibleContexts IArray Ord Enum Could MArray How can I generalize this in-place Selection Sort? Below is an implementation of a selection sort in the ST...
[ -0.03662109375, 0.023193359375, 0.0220947265625, -0.018310546875, -0.0150146484375, -0.0281982421875, -0.007354736328125, -0.023193359375, 0.01239013671875, -0.005035400390625, -0.01177978515625, 0.01251220703125, -0.006439208984375, -0.0018768310546875, -0.0115966796875, -0.0209960937...
[ 11249, 4537, 20650, 903, 23, 23935, 51620, 1830, 53666, 831, 87, 1556, 142508, 70, 134929, 7092, 345, 7614, 100, 180842, 2661, 22829, 35379, 316, 191147, 873, 17336, 208124, 132216, 12096, 16992, 60331, 71, 107730, 10298, 53, 71200, 47, 360...
[ 0.108642578125, 0.1800537109375, 0.1339111328125, 0.0501708984375, 0.0635986328125, 0.13232421875, 0.181884765625, 0.071044921875, 0.2344970703125, 0.020477294921875, 0.010223388671875, 0.115234375, 0.21875, 0.007598876953125, 0.0180206298828125, 0.150390625, 0.00665283203125, 0.05...
embed
43347582_c0
43347582
haskell
0
Title: Permission denied when reading from clipboard Problem title: Permission denied when reading from clipboard Tags: clipboard, permissions, windows, haskell Problem: Permission denied when reading from clipboard I wrote a small program to track my clipboard activity and print it to the terminal using reactive-banan...
Permission denied when reading from clipboard Permission denied when reading from clipboard clipboard permissions windows haskell clipboard Reactive.Banana Reactive.Banana.Frameworks System.Clipboard Data.Maybe Permission Main Main.hs CloseClipboard Thread Permission denied when reading from clipboard I wrote a small p...
[ 0.000644683837890625, 0.030517578125, 0.005828857421875, 0.0038909912109375, -0.0012054443359375, 0.0111083984375, 0.00921630859375, -0.006622314453125, -0.027587890625, -0.056640625, 0.00341796875, -0.017333984375, 0.0015869140625, 0.01446533203125, 0.000629425048828125, 0.00915527343...
[ 908, 21150, 8, 93, 3229, 16454, 1295, 34196, 24351, 168081, 54825, 1556, 142508, 853, 71232, 571, 75791, 108386, 18244, 12353, 21392, 11809, 82419, 12321, 127, 153335, 136719, 54397, 19336, 1528, 28560, 103488, 28412, 33949, 456, 105281, 11, ...
[ 0.12939453125, 0.123046875, 0.134765625, 0.1656494140625, 0.04998779296875, 0.2059326171875, 0.1627197265625, 0.193603515625, 0.2259521484375, 0.2220458984375, 0.1009521484375, 0.0960693359375, 0.204345703125, 0.016082763671875, 0.1593017578125, 0.029022216796875, 0.148681640625, 0...
embed
77206117_c1
77206117
haskell
1
.Arrow import Control.Monad.Free import qualified Control.Monad.Trans.State as S import Data.Functor.Classes import Data.List import Debug.SimpleReflect.Expr newtype StateF s a = StateF { runStateF :: s -> (a, s) } deriving stock Functor deriving instance (ExprArg s, Show s, Show a) => Show (StateF s a) instance (ExprA...
.Arrow import Control.Monad.Free import qualified Control.Monad.Trans.State as S import Data.Functor.Classes import Data.List import Debug.SimpleReflect.Expr newtype StateF s a = StateF { runStateF :: s -> (a, s) } deriving stock Functor deriving instance (ExprArg s, Show s, Show a) => Show (StateF s a) instance (ExprA...
[ -0.01409912109375, 0.00042724609375, 0.000713348388671875, -0.0002307891845703125, -0.0027923583984375, 0.0013275146484375, -0.002593994140625, -0.01171875, 0.0032196044921875, 0.01904296875, 0.00186920166015625, 0.0264892578125, -0.00714111328125, 0.024169921875, -0.028076171875, -0.0...
[ 5, 7614, 15555, 24927, 27131, 46674, 712, 81437, 217225, 62624, 135206, 13, 237, 159, 11809, 97249, 18770, 140803, 154663, 262, 85779, 33209, 190015, 8996, 19279, 10287, 3525, 50986, 22836, 919, 91, 10, 2203, 11675, 33079, 11, 6496, 31837, ...
[ 0.1097412109375, 0.1488037109375, 0.2587890625, 0.2205810546875, 0.2303466796875, 0.09588623046875, 0.1387939453125, 0.153564453125, 0.1722412109375, 0.0999755859375, 0.1182861328125, 0.05584716796875, 0.0498046875, 0.0887451171875, 0.116943359375, 0.125732421875, 0.194091796875, 0...
embed
32294670_c1
32294670
haskell
1
t1 <- getCurrentTime >>= return . utctDayTime System.IO.putStrLn $ (show t1) process_file h_in outfile System.IO.putStrLn "after time: " t2 <- getCurrentTime >>= return . utctDayTime System.IO.putStrLn $ (show t2) hClose h_in process_file h_in outfile = do eof <- hIsEOF h_in if eof then return () else do bin1 <- BIN.h...
t1 <- getCurrentTime >>= return . utctDayTime System.IO.putStrLn $ (show t1) process_file h_in outfile System.IO.putStrLn "after time: " t2 <- getCurrentTime >>= return . utctDayTime System.IO.putStrLn $ (show t2) hClose h_in process_file h_in outfile = do eof <- hIsEOF h_in if eof then return () else do bin1 <- BIN.h...
[ -0.00335693359375, -0.01519775390625, 0.0128173828125, 0.01092529296875, 0.0220947265625, 0.0201416015625, -0.017333984375, -0.0054931640625, -0.00018787384033203125, -0.0123291015625, 0.01531982421875, 0.012939453125, -0.01153564453125, 0.00372314453125, -0.002716064453125, 0.00500488...
[ 808, 418, 2046, 474, 15724, 70059, 6396, 30646, 486, 15390, 97141, 12353, 17780, 5, 7077, 71713, 866, 3650, 31374, 17727, 9433, 29822, 1096, 73, 1810, 19, 11, 46327, 1733, 304, 441, 1369, 6, 15, 10461, 59453, 454, 2203, 54, 28, 4390, ...
[ 0.083251953125, 0.102294921875, 0.107666015625, 0.15576171875, 0.200439453125, 0.265625, 0.0057373046875, 0.1551513671875, 0.0587158203125, 0.0789794921875, 0.1275634765625, 0.1243896484375, 0.1884765625, 0.002105712890625, 0.07464599609375, 0.08013916015625, 0.002532958984375, 0.0...
embed
7242764_c0
7242764
haskell
0
Title: Isn&#x27;t Monad just a syntactic sugar? Problem title: Isn&#x27;t Monad just a syntactic sugar? Tags: f%23, functional-programming, haskell Problem: Isn't Monad just a syntactic sugar? I have been through various papers/articles/blogs and what not about Monads. People talk about them in various context like cat...
Isn&#x27;t Monad just a syntactic sugar? Isn&#x27;t Monad just a syntactic sugar? f%23 functional-programming haskell Isn Monad Isn't Monad just a syntactic sugar? I have been through various papers/articles/blogs and what not about Monads. People talk about them in various context like category theory (what in world i...
[ -0.0098876953125, 0.01068115234375, 0.02783203125, 0.009033203125, -0.00909423828125, 0.0174560546875, -0.00157928466796875, 0.00921630859375, -0.01373291015625, -0.017578125, -0.002471923828125, -0.0205078125, -0.01422119140625, -0.004608154296875, 0.0037384033203125, -0.0062255859375...
[ 2071, 3768, 18, 60331, 71, 1660, 10, 6002, 102, 49086, 101087, 1238, 3742, 123309, 28966, 1556, 142508, 19, 6468, 22120, 95487, 154453, 8999, 2667, 11, 18403, 18151, 712, 7, 621, 2684, 92910, 110, 20625, 25129, 563, 4904, 46610, 2737, 368...
[ 0.0721435546875, 0.03143310546875, 0.0484619140625, 0.2318115234375, 0.200927734375, 0.06854248046875, 0.059051513671875, 0.14892578125, 0.1572265625, 0.10198974609375, 0.230712890625, 0.002044677734375, 0.01177978515625, 0.1324462890625, 0.08905029296875, 0.1002197265625, 0.20068359...
embed
6147201_c0
6147201
haskell
0
Title: Haskell (haskeline) word completion Problem title: Haskell (haskeline) word completion Tags: haskell, word-completion, haskeline, command-line Problem: Haskell (haskeline) word completion Haskeline makes it very easy to get filename tab-completion functionality: module Main where import System.Console.Haskeline ...
Haskell (haskeline) word completion Haskell (haskeline) word completion haskell word-completion haskeline command-line System.Console.Haskeline System.Environment Haskell Main Settings Just Caught Nothing Haskell (haskeline) word completion Haskeline makes it very easy to get filename tab-completion functionality: It a...
[ -0.00457763671875, -0.00921630859375, -0.0012664794921875, 0.022705078125, -0.0208740234375, 0.016845703125, 0.024658203125, 0.006805419921875, 0.00439453125, -0.0181884765625, -0.0089111328125, 0.015380859375, -0.00008344650268554688, -0.000843048095703125, -0.0135498046875, 0.0017623...
[ 20625, 142508, 528, 1205, 2256, 2565, 21721, 1830, 1556, 277, 8705, 256, 75101, 12353, 40777, 6495, 686, 1900, 12321, 105548, 9563, 2041, 46526, 182747, 1391, 30482, 4552, 23468, 2046, 11435, 11627, 20928, 123309, 87344, 32354, 28484, 164805, ...
[ 0.1407470703125, 0.235107421875, 0.11962890625, 0.168701171875, 0.2255859375, 0.137939453125, 0.2191162109375, 0.04400634765625, 0.06280517578125, 0.1075439453125, 0.177734375, 0.06781005859375, 0.091064453125, 0.07183837890625, 0.0849609375, 0.0968017578125, 0.021240234375, 0.0572...
embed
12667060_c1
12667060
haskell
1
configure: error: no acceptable C compiler found in $PATH See `config.log' for more details cabal.exe: Error: some packages failed to install: clientsession-0.8.0.1 depends on directory-1.2.0.0 which failed to install. configurator-0.2.0.1 depends on directory-1.2.0.0 which failed to install. directory-1.2.0.0 failed ...
configure: error: no acceptable C compiler found in $PATH See `config.log' for more details cabal.exe: Error: some packages failed to install: clientsession-0.8.0.1 depends on directory-1.2.0.0 which failed to install. configurator-0.2.0.1 depends on directory-1.2.0.0 which failed to install. directory-1.2.0.0 failed ...
[ 0.01123046875, 0.0157470703125, 0.010986328125, -0.01416015625, -0.004364013671875, 0.0024261474609375, -0.0208740234375, -0.01239013671875, -0.00860595703125, -0.0020904541015625, -0.01434326171875, -0.0145263671875, -0.01422119140625, -0.000728607177734375, 0.00946044921875, -0.00360...
[ 222495, 18499, 12, 110, 213850, 313, 9969, 34759, 14037, 23, 3650, 65135, 841, 6872, 153837, 4867, 41653, 109524, 46480, 212059, 3060, 98169, 165523, 47, 20600, 23282, 169234, 132208, 102014, 56566, 7, 14364, 53, 48400, 99929, 56231, 1290, 13...
[ 0.281494140625, 0.179931640625, 0.00103759765625, 0.1380615234375, 0.25341796875, 0.1778564453125, 0.2093505859375, 0.2288818359375, 0.1309814453125, 0.00445556640625, 0.04693603515625, 0.1533203125, 0.127197265625, 0.07672119140625, 0.1934814453125, 0.099365234375, 0.004486083984375...
embed
36678700_c0
36678700
haskell
0
Title: Compose/bind &quot;Except&quot;s with varying error types by common error type class Problem title: Compose/bind &quot;Except&quot;s with varying error types by common error type class Tags: haskell Problem: Compose/bind "Except"s with varying error types by common error type class I have some functions returnin...
Compose/bind &quot;Except&quot;s with varying error types by common error type class Compose/bind &quot;Except&quot;s with varying error types by common error type class haskell StrError TxtError Control.Monad.Trans.Except qualified Compose Except Show RankNTypes Main Data.Text T.Text T.pack Left Right Compose/bind "Ex...
[ -0.023193359375, 0.00927734375, -0.0101318359375, 0.0135498046875, 0.00762939453125, 0.01806640625, -0.0167236328125, -0.0206298828125, 0.0028228759765625, 0.0004825592041015625, -0.0007781982421875, -0.0201416015625, 0.041259765625, 0.01116943359375, 0.00592041015625, -0.0083618164062...
[ 15612, 8364, 64, 89817, 19279, 19462, 678, 285, 38543, 18499, 52895, 39210, 10644, 18507, 1556, 142508, 23351, 18468, 31611, 94046, 27131, 46674, 712, 62624, 217225, 218288, 17367, 134405, 196707, 12321, 11809, 174379, 29102, 90911, 32354, 30646,...
[ 0.1661376953125, 0.15185546875, 0.003143310546875, 0.244140625, 0.1158447265625, 0.255126953125, 0.051544189453125, 0.15283203125, 0.12060546875, 0.2154541015625, 0.2122802734375, 0.1192626953125, 0.189697265625, 0.149169921875, 0.0931396484375, 0.1982421875, 0.099853515625, 0.0834...
embed
45815830_c0
45815830
haskell
0
Title: Cabal 2.0 required when using a nightly snapshot with stack Problem title: Cabal 2.0 required when using a nightly snapshot with stack Tags: haskell, haskell-stack, cabal Problem: Cabal 2.0 required when using a nightly snapshot with stack I'm trying to setup a new project using the nightly-2017-08-17 snapshot s...
Cabal 2.0 required when using a nightly snapshot with stack Cabal 2.0 required when using a nightly snapshot with stack haskell haskell-stack cabal a Cabal nightly-2017-08-17 Downloading Looking package.yaml Using test.cabal Selected Unable FromString Nothing Currently GHC Cabal 2.0 required when using a nightly snapsh...
[ -0.00506591796875, -0.00811767578125, 0.0087890625, 0.00262451171875, -0.00811767578125, 0.00775146484375, -0.00726318359375, 0.0101318359375, 0.006011962890625, 0.0177001953125, -0.00628662109375, -0.038330078125, -0.015869140625, -0.00360107421875, 0.0213623046875, 0.00701904296875, ...
[ 30438, 289, 16655, 56065, 17368, 10, 17431, 538, 76685, 72697, 678, 177261, 1556, 142508, 590, 2594, 109524, 22842, 47355, 2489, 4857, 157268, 98169, 14520, 141, 345, 3034, 408, 3571, 51620, 992, 2886, 28090, 71713, 182747, 527, 73265, 31577,...
[ 0.2186279296875, 0.2408447265625, 0.236083984375, 0.1854248046875, 0.06390380859375, 0.0009765625, 0.163818359375, 0.1279296875, 0.166259765625, 0.200439453125, 0.08056640625, 0.182861328125, 0.113525390625, 0.196533203125, 0.09814453125, 0.1134033203125, 0.2445068359375, 0.1503906...
embed
63692563_c0
63692563
haskell
0
Title: How can I use `bound` for non-monads? Problem title: How can I use `bound` for non-monads? Tags: dsl, monads, haskell, logic, package Problem: How can I use `bound` for non-monads? I am trying to use the bound package to represent terms and propositions in a simple logical language. Here is what I have so far: i...
How can I use `bound` for non-monads? How can I use `bound` for non-monads? dsl monads haskell logic package Bound How Term Func Ord Read Show Functor Foldable Traversable Prop Relation Forall Scope abstract1 Monad How can I use `bound` for non-monads? I am trying to use the bound package to represent terms and proposi...
[ 0.001129150390625, 0.00909423828125, 0.019775390625, 0.00408935546875, 0.00885009765625, 0.004852294921875, 0.01513671875, -0.025390625, 0.00075531005859375, -0.0301513671875, 0.0019683837890625, -0.0198974609375, -0.0181884765625, 0.00958251953125, 0.0064697265625, 0.006011962890625, ...
[ 11249, 4527, 99091, 351, 87039, 6468, 831, 100, 24861, 2667, 712, 1556, 142508, 62775, 98169, 2460, 7030, 2994, 28670, 35379, 4764, 17367, 18770, 30077, 7864, 43796, 116822, 1326, 5584, 182783, 164789, 60331, 71, 33636, 69407, 89261, 8781, 46...
[ 0.0261993408203125, 0.1280517578125, 0.295166015625, 0.1732177734375, 0.1409912109375, 0.110107421875, 0.03240966796875, 0.052215576171875, 0.1002197265625, 0.09814453125, 0.1290283203125, 0.0623779296875, 0.1849365234375, 0.1046142578125, 0.18212890625, 0.1275634765625, 0.1936035156...
embed
29407289_c0
29407289
haskell
0
Title: Lens: zooming newtype Problem title: Lens: zooming newtype Tags: zooming, newtype, haskell, haskell-lens Problem: Lens: zooming newtype I'm interested in getting a zooming functionality for my monad transformer stack which is defined the following way: newtype Awesome a = Awesome (StateT AwesomeState (ExceptT B....
Lens: zooming newtype Lens: zooming newtype zooming newtype haskell haskell-lens MonadError Lens Awesome StateT AwesomeState ExceptT B.ByteString Functor Applicative Monad MonadIO MonadState Couldn Control.Lens.Internal.Zoom.Zoomed Lens: zooming newtype I'm interested in getting a zooming functionality for my monad tra...
[ -0.0225830078125, -0.01318359375, -0.00946044921875, -0.0013275146484375, -0.0034942626953125, 0.007537841796875, -0.014892578125, -0.00994873046875, -0.01068115234375, -0.005523681640625, 0.019775390625, -0.00360107421875, -0.005401611328125, -0.01165771484375, 0.000972747802734375, -...
[ 18226, 111245, 214, 3525, 50986, 1556, 142508, 1977, 60331, 71, 18468, 31611, 227865, 22836, 618, 135206, 218288, 335, 75358, 71713, 28670, 11048, 17780, 191147, 27131, 866, 1755, 44851, 60551, 306, 297, 60892, 20949, 123309, 2667, 712, 27198, ...
[ 0.1866455078125, 0.254638671875, 0.135498046875, 0.1644287109375, 0.28125, 0.0791015625, 0.20068359375, 0.141357421875, 0.11474609375, 0.0557861328125, 0.05267333984375, 0.046142578125, 0.188232421875, 0.1279296875, 0.038421630859375, 0.15185546875, 0.0430908203125, 0.0198822021484...
embed
42037064_c0
42037064
haskell
0
Title: Why `guard` is not defined with a MonadPlus constraint? Problem title: Why `guard` is not defined with a MonadPlus constraint? Tags: haskell, monads, monadplus, alternative-functor Problem: Why `guard` is not defined with a MonadPlus constraint? I am currently reading about the Alternative/MonadPlus typeclasses ...
Why `guard` is not defined with a MonadPlus constraint? Why `guard` is not defined with a MonadPlus constraint? haskell monads monadplus alternative-functor Why MonadPlus Control.Monad Alternative Bool Why `guard` is not defined with a MonadPlus constraint? I am currently reading about the Alternative/MonadPlus typecla...
[ -0.0027313232421875, 0.0216064453125, 0.035888671875, -0.005584716796875, 0.01141357421875, -0.006195068359375, -0.0198974609375, -0.00823974609375, -0.0159912109375, -0.029541015625, -0.002655029296875, -0.0230712890625, -0.0252685546875, 0.00189208984375, 0.01409912109375, -0.0088500...
[ 44084, 32116, 959, 61924, 60331, 71, 88225, 158, 2816, 4288, 678, 1556, 142508, 2667, 712, 32108, 30700, 16498, 27131, 46674, 103905, 2460, 929, 10644, 67413, 81415, 60212, 2638, 13894, 56050, 32354, 66596, 11814, 186500, 82063, 7143, 214, 18...
[ 0.07568359375, 0.303955078125, 0.084716796875, 0.1953125, 0.15966796875, 0.1082763671875, 0.244384765625, 0.0657958984375, 0.1663818359375, 0.1214599609375, 0.026641845703125, 0.078857421875, 0.205810546875, 0.098876953125, 0.12841796875, 0.2030029296875, 0.1314697265625, 0.0885009...
embed
66616780_c1
66616780
haskell
1
RIO (a1,a2) main :: IO () main = putStrLn "" -- main :: IO () -- main = do -- play 1 (6::Int) >>= print -- play 'a' 'z' >>= print -- putStrLn "done" Code that doesn't compile: {-# LANGUAGE ConstraintKinds #-} module Main where -- showing how to program in the mtl style import Control.Monad.IO.Class import System.Random...
RIO (a1,a2) main :: IO () main = putStrLn "" -- main :: IO () -- main = do -- play 1 (6::Int) >>= print -- play 'a' 'z' >>= print -- putStrLn "done" Code that doesn't compile: {-# LANGUAGE ConstraintKinds #-} module Main where -- showing how to program in the mtl style import Control.Monad.IO.Class import System.Random...
[ -0.0208740234375, 0.0113525390625, 0.006622314453125, 0.0257568359375, 0.02587890625, 0.0211181640625, -0.0010833740234375, -0.0244140625, 0.0067138671875, -0.013427734375, 0.005523681640625, -0.005523681640625, -0.0147705078125, 0.0084228515625, -0.0021820068359375, -0.002761840820312...
[ 92823, 11, 418, 4, 10461, 5201, 1984, 17780, 2203, 3884, 71713, 866, 19, 54, 11301, 106, 16156, 12, 4153, 18, 28412, 169, 64007, 28864, 450, 22027, 9969, 4904, 3358, 98064, 1657, 2816, 4288, 7250, 9, 88996, 12321, 7440, 141377, 3642, 47...
[ 0.323486328125, 0.1241455078125, 0.07855224609375, 0.013397216796875, 0.1435546875, 0.1358642578125, 0.0191192626953125, 0.181884765625, 0.028961181640625, 0.1387939453125, 0.1199951171875, 0.0148162841796875, 0.0479736328125, 0.06768798828125, 0.1722412109375, 0.0914306640625, 0.118...
embed
31999322_c1
31999322
haskell
1
another way to evaluate inside of IO monad immediately. The following is the whole of my code (Sorry, it's a bit long...) Thank you for your help. -- Small path tracing with Haskell import System.Environment import System.Random.Mersenne import System.IO.Unsafe import Control.Monad import Codec.Picture import Data.Tim...
another way to evaluate inside of IO monad immediately. The following is the whole of my code (Sorry, it's a bit long...) Thank you for your help. -- Small path tracing with Haskell import System.Environment import System.Random.Mersenne import System.IO.Unsafe import Control.Monad import Codec.Picture import Data.Tim...
[ -0.0272216796875, 0.00189971923828125, 0.007781982421875, 0.0159912109375, 0.004638671875, 0.0230712890625, 0.00153350830078125, -0.0264892578125, -0.01055908203125, -0.0264892578125, -0.00860595703125, 0.0208740234375, -0.00531005859375, -0.0244140625, 0.007049560546875, 0.01385498046...
[ 15700, 3917, 47, 151575, 13, 46132, 111, 17780, 2667, 712, 109312, 25632, 28271, 759, 18151, 158240, 1294, 4, 4785, 4989, 4358, 105508, 60875, 1152, 21896, 678, 20625, 142508, 24927, 12353, 686, 1900, 126525, 3815, 30248, 1015, 86, 5, 14256...
[ 0.116943359375, 0.0965576171875, 0.001983642578125, 0.262939453125, 0.1427001953125, 0.250732421875, 0.058868408203125, 0.268798828125, 0.18994140625, 0.2481689453125, 0.254150390625, 0.044921875, 0.1051025390625, 0.0078125, 0.176025390625, 0.0280914306640625, 0.0081787109375, 0.00...
embed
51221528_c0
51221528
haskell
0
Title: Haskell - flip arguments of a typeclass with two parameters Problem title: Haskell - flip arguments of a typeclass with two parameters Tags: typeclass, haskell Problem: Haskell - flip arguments of a typeclass with two parameters I have a multiparam typeclass which supplies a function that makes sense to have its...
Haskell - flip arguments of a typeclass with two parameters Haskell - flip arguments of a typeclass with two parameters typeclass haskell Haskell Swappable Bool Illegal All Use FlexibleInstances Haskell - flip arguments of a typeclass with two parameters I have a multiparam typeclass which supplies a function that make...
[ 0.0022735595703125, 0.00152587890625, 0.0185546875, -0.00701904296875, -0.0140380859375, 0.0303955078125, -0.02490234375, 0.0030975341796875, 0.00360107421875, 0.0198974609375, 0.000827789306640625, -0.0089111328125, 0.01458740234375, 0.0142822265625, -0.0064697265625, -0.0206298828125...
[ 20625, 142508, 147505, 10750, 10644, 67413, 678, 6626, 171859, 7, 111, 1556, 43062, 6366, 2886, 2460, 929, 891, 86966, 3164, 36836, 180842, 2661, 116071, 6024, 6276, 39, 120384, 32354, 10422, 68062, 48398, 2174, 10, 136, 876, 3173, 5608, 21...
[ 0.1156005859375, 0.2330322265625, 0.20751953125, 0.213134765625, 0.1812744140625, 0.2135009765625, 0.0305328369140625, 0.1383056640625, 0.175048828125, 0.0225677490234375, 0.030181884765625, 0.108642578125, 0.166259765625, 0.1324462890625, 0.181396484375, 0.066650390625, 0.1586914062...
embed
67017921_c0
67017921
haskell
0
Title: Trouble installing haskell: how to adjust PATH variable to add to a shell config file? Problem title: Trouble installing haskell: how to adjust PATH variable to add to a shell config file? Tags: haskell, macos, shell, bash Problem: Trouble installing haskell: how to adjust PATH variable to add to a shell config ...
Trouble installing haskell: how to adjust PATH variable to add to a shell config file? Trouble installing haskell: how to adjust PATH variable to add to a shell config file? haskell macos shell bash Trouble PATH You Users user1 e.g Detected YES ENTER Trouble installing haskell: how to adjust PATH variable to add to a s...
[ -0.00616455078125, 0.0228271484375, 0.00762939453125, 0.01409912109375, -0.0223388671875, 0.0133056640625, -0.0072021484375, 0.01220703125, -0.0142822265625, 0.034912109375, -0.00014019012451171875, -0.00921630859375, -0.01904296875, -0.01080322265625, 0.001556396484375, 0.000705718994...
[ 119671, 2661, 20600, 1556, 142508, 3642, 126596, 436, 139909, 77336, 15190, 128019, 153837, 11435, 7840, 87109, 2583, 53400, 38937, 418, 579, 13, 990, 6706, 116563, 20625, 4727, 7285, 5426, 31380, 33874, 74022, 79786, 10644, 318, 36069, 3934, ...
[ 0.18505859375, 0.08251953125, 0.1708984375, 0.18505859375, 0.281494140625, 0.053466796875, 0.2325439453125, 0.148193359375, 0.2288818359375, 0.26611328125, 0.1153564453125, 0.2392578125, 0.2064208984375, 0.201416015625, 0.07470703125, 0.1788330078125, 0.008758544921875, 0.152587890...
embed
57325619_c0
57325619
haskell
0
Title: Why doesn&#x27;t `first` from Data.Bifunctor transform this value Problem title: Why doesn&#x27;t `first` from Data.Bifunctor transform this value Tags: bifunctor, haskell Problem: Why doesn't `first` from Data.Bifunctor transform this value In the following: import Data.Bifunctor import qualified Data.ByteStrin...
Why doesn&#x27;t `first` from Data.Bifunctor transform this value Why doesn&#x27;t `first` from Data.Bifunctor transform this value bifunctor haskell throwError Data.Bifunctor qualified Why Data.ByteString.Lazy.UTF8 BLU FilePath ExceptT Text File FromJSON BLU.fromString nonExistantFile.json Left Does Why doesn't `first...
[ 0.007476806640625, 0.00186920166015625, 0.01495361328125, 0.01519775390625, -0.00054931640625, 0.00543212890625, -0.01708984375, -0.00994873046875, -0.00701904296875, 0.0019683837890625, 0.01104736328125, 0.004150390625, -0.00193023681640625, -0.006500244140625, 0.003631591796875, -0.0...
[ 44084, 22027, 3768, 18, 13448, 271, 1295, 11809, 16882, 16498, 18770, 27198, 903, 34292, 333, 1556, 142508, 104250, 217225, 75358, 67, 71713, 2729, 3285, 17632, 919, 1019, 22335, 42724, 683, 10519, 218288, 618, 24129, 28090, 1375, 58627, 1610...
[ 0.1190185546875, 0.0968017578125, 0.037811279296875, 0.11279296875, 0.132080078125, 0.1363525390625, 0.1004638671875, 0.1171875, 0.165771484375, 0.1641845703125, 0.12255859375, 0.242431640625, 0.051300048828125, 0.15673828125, 0.1279296875, 0.080322265625, 0.149169921875, 0.0722656...
embed
59028967_c1
59028967
haskell
1
Body -> Handler ()) :<|> ((KindUid -> SubjectUid -> EventData -> Handler EventUid) :<|> (KindUid -> SubjectUid -> p0 (Handler [Event])))) • In a stmt of a 'do' block: k <- kind In the expression: do k <- kind s <- subject e <- event return $ k :<|> s :<|> e In an equation for ‘server’: server = do k <- kind s <- subjec...
Body -> Handler ()) :<|> ((KindUid -> SubjectUid -> EventData -> Handler EventUid) :<|> (KindUid -> SubjectUid -> p0 (Handler [Event])))) • In a stmt of a 'do' block: k <- kind In the expression: do k <- kind s <- subject e <- event return $ k :<|> s :<|> e In an equation for ‘server’: server = do k <- kind s <- subjec...
[ -0.0081787109375, 0.0166015625, 0.015380859375, -0.003936767578125, -0.0089111328125, -0.01171875, -0.00077056884765625, -0.0177001953125, 0.01446533203125, -0.046875, -0.0013275146484375, 0.0113525390625, 0.0125732421875, 0.006622314453125, 0.005950927734375, -0.01043701171875, 0.01...
[ 43960, 33079, 10639, 603, 7250, 1062, 532, 94341, 36943, 137989, 2389, 135679, 192134, 360, 6138, 39, 18, 111, 246, 46389, 472, 8562, 125195, 54, 28368, 19732, 30646, 3650, 91, 28, 5490, 39642, 10723, 4859, 4027, 168793, 127, 28565, 1019, ...
[ 0.227294921875, 0.0141448974609375, 0.2474365234375, 0.30419921875, 0.1600341796875, 0.1448974609375, 0.148681640625, 0.1385498046875, 0.10150146484375, 0.1209716796875, 0.111328125, 0.2125244140625, 0.1505126953125, 0.06011962890625, 0.0748291015625, 0.050201416015625, 0.10107421875...
embed
7489968_c1
7489968
haskell
1
.hs:12:10-36 instance MonadWriter [Packet] MStack -- Defined at /Users/djoyner/working/channelized-writer/Try1.hs:17:10-36 Failed, modules loaded: none. I understand why this approach is not valid as shown here but I couldn't figure out a way around the fundamental issues so I abandoned it altogether. Solution Attempt ...
.hs:12:10-36 instance MonadWriter [Packet] MStack -- Defined at /Users/djoyner/working/channelized-writer/Try1.hs:17:10-36 Failed, modules loaded: none. I understand why this approach is not valid as shown here but I couldn't figure out a way around the fundamental issues so I abandoned it altogether. Solution Attempt ...
[ -0.02490234375, 0.01031494140625, -0.0091552734375, 0.0230712890625, 0.00640869140625, 0.0079345703125, -0.0228271484375, -0.016845703125, 0.0020751953125, 0.0106201171875, 0.00982666015625, 0.016845703125, 0.02294921875, -0.0086669921875, -0.003143310546875, 0.01385498046875, -0.009...
[ 127, 20927, 15110, 126884, 110527, 60331, 71, 1456, 2783, 56, 205956, 126, 16265, 102, 2594, 262, 5983, 1062, 7, 105414, 1679, 174796, 17032, 8876, 29367, 70035, 618, 1294, 22950, 190355, 88996, 72367, 351, 13, 28219, 51515, 35604, 20531, 3...
[ 0.081787109375, 0.11572265625, 0.1710205078125, 0.2188720703125, 0.213623046875, 0.1932373046875, 0.1038818359375, 0.126708984375, 0.2093505859375, 0.152099609375, 0.13330078125, 0.007110595703125, 0.03411865234375, 0.13916015625, 0.1617431640625, 0.065185546875, 0.1630859375, 0.04...
embed
4742330_c1
4742330
haskell
1
) ⇒ CompositionAlgebra a a sumTree = CompositionAlgebra { leaf = id, composite = (+) } -- and this lattest sumTree is wrong too for ghc I see > and +, just like the C++ operators > and +. So I don't understand ghc is angry at me without my giving to it objets implementing opertor >/+ or not. Secondly I must admit I'm c...
) ⇒ CompositionAlgebra a a sumTree = CompositionAlgebra { leaf = id, composite = (+) } -- and this lattest sumTree is wrong too for ghc I see > and +, just like the C++ operators > and +. So I don't understand ghc is angry at me without my giving to it objets implementing opertor >/+ or not. Secondly I must admit I'm c...
[ -0.0262451171875, -0.004913330078125, 0.00994873046875, 0.0223388671875, 0.0201416015625, 0.01373291015625, -0.00689697265625, 0.0208740234375, 0.0159912109375, -0.02587890625, -0.025146484375, -0.004180908203125, 0.015380859375, 0.005126953125, -0.007080078125, -0.00555419921875, 0....
[ 148525, 3288, 40322, 429, 2844, 10, 10554, 62731, 13, 95, 2407, 3447, 375, 77087, 22183, 903, 113732, 271, 83, 44691, 5792, 31380, 238, 1957, 977, 136, 997, 37223, 39933, 28219, 348, 1294, 68772, 172388, 29479, 17327, 1290, 64, 1328, 3645...
[ 0.008392333984375, 0.1136474609375, 0.1998291015625, 0.0860595703125, 0.0655517578125, 0.147216796875, 0.145263671875, 0.21728515625, 0.0411376953125, 0.035736083984375, 0.17138671875, 0.06640625, 0.09173583984375, 0.21240234375, 0.137939453125, 0.0263824462890625, 0.0838623046875, ...
embed
23580096_c0
23580096
haskell
0
Title: Streaming Data.Vector to File using io-streams Problem title: Streaming Data.Vector to File using io-streams Tags: haskell Problem: Streaming Data.Vector to File using io-streams I am trying to learn io-streams to stream a Data.Vector.Unboxed to a file on disk; however there is a type mismatch between Int and By...
Streaming Data.Vector to File using io-streams Streaming Data.Vector to File using io-streams haskell io-streams qualified System.IO.Streams.Core System.IO.Streams.File System.IO.Streams.Vector Streaming Data.Vector File Data.Vector.Unboxed V.Vector V.generate test.dat iostream.hs:12:66 Couldn Data.ByteString.Internal....
[ 0.001983642578125, 0.0263671875, -0.017333984375, -0.00830078125, 0.004638671875, 0.006103515625, -0.015869140625, -0.0213623046875, -0.0289306640625, 0.015625, 0.00665283203125, -0.01275634765625, 0.0185546875, 0.0299072265625, -0.006256103515625, -0.01007080078125, -0.0122680664062...
[ 163274, 11809, 26455, 18770, 47, 42724, 17368, 22995, 9, 86429, 5, 7, 1556, 142508, 217225, 12353, 17780, 115061, 50886, 174350, 14256, 11728, 310, 48281, 3034, 5164, 127, 20927, 14604, 191147, 75358, 71713, 214, 44851, 60075, 89829, 13538, 7...
[ 0.27490234375, 0.1607666015625, 0.2320556640625, 0.225830078125, 0.0885009765625, 0.1973876953125, 0.08624267578125, 0.29736328125, 0.07550048828125, 0.25439453125, 0.03387451171875, 0.038543701171875, 0.1256103515625, 0.2242431640625, 0.1778564453125, 0.08721923828125, 0.2265625, ...
embed
52791746_c1
52791746
haskell
1
g a)) deriving (Show) -- functor application, analog of $ infixr 0 ↯ newtype (↯) f a = Apply (f a) deriving (Show) test :: [] (Maybe Int) test = [Just 1] test2 :: ([] ○ Maybe) Int test2 = Composition [Just 1] test2' :: [] ○ Maybe ↯ Int test2' = Apply (Composition [Just 1]) test3 :: ([] ○ Maybe ○ Maybe) Int test3 = Comp...
g a)) deriving (Show) -- functor application, analog of $ infixr 0 ↯ newtype (↯) f a = Apply (f a) deriving (Show) test :: [] (Maybe Int) test = [Just 1] test2 :: ([] ○ Maybe) Int test2 = Composition [Just 1] test2' :: [] ○ Maybe ↯ Int test2' = Apply (Composition [Just 1]) test3 :: ([] ○ Maybe ○ Maybe) Int test3 = Comp...
[ -0.018798828125, 0.00421142578125, 0.0218505859375, 0.031982421875, -0.0042724609375, 0.008544921875, -0.01214599609375, 0.01031494140625, 0.0164794921875, 0.003936767578125, -0.01214599609375, -0.004547119140625, -0.00677490234375, -0.0091552734375, -0.0024871826171875, -0.00726318359...
[ 706, 10, 16, 16406, 6496, 15, 168660, 4210, 7477, 18770, 38415, 60223, 3650, 23, 55923, 42, 757, 248135, 3525, 50986, 1238, 2203, 5659, 538, 420, 3034, 1984, 82419, 372, 360, 18, 127794, 106, 304, 77035, 83425, 3288, 40322, 25, 10770, 3...
[ 0.1268310546875, 0.1544189453125, 0.032806396484375, 0.2049560546875, 0.25390625, 0.040924072265625, 0.305419921875, 0.06927490234375, 0.1480712890625, 0.179443359375, 0.208740234375, 0.17431640625, 0.1209716796875, 0.121826171875, 0.1767578125, 0.1251220703125, 0.1181640625, 0.126...
embed
53942479_c0
53942479
haskell
0
Title: Adding maybeness to a Haskell data type (with record syntax) Problem title: Adding maybeness to a Haskell data type (with record syntax) Tags: haskell, option-type Problem: Adding maybeness to a Haskell data type (with record syntax) Looking at an answer to this question: https://stackoverflow.com/a/34164251/105...
Adding maybeness to a Haskell data type (with record syntax) Adding maybeness to a Haskell data type (with record syntax) haskell option-type Adding Haskell Address Integer Maybe Show Adding maybeness to a Haskell data type (with record syntax) Looking at an answer to this question: https://stackoverflow.com/a/34164251...
[ 0, 0.017333984375, 0.01611328125, 0.029296875, 0.000896453857421875, 0.01275634765625, 0.005767822265625, -0.0003414154052734375, -0.009033203125, 0.0054931640625, -0.006256103515625, -0.0107421875, -0.0030059814453125, 0.0019378662109375, 0, 0.0118408203125, 0.00396728515625, 0.01...
[ 62, 59725, 51139, 7432, 47, 20625, 142508, 2053, 10644, 76228, 17164, 6002, 86531, 1556, 35829, 50986, 49990, 44401, 83425, 17367, 118664, 442, 61924, 11814, 366, 184, 821, 58627, 36746, 98893, 11249, 5809, 15549, 765, 756, 1647, 1681, 44457,...
[ 0.09844970703125, 0.1114501953125, 0.292724609375, 0.2158203125, 0.042938232421875, 0.1575927734375, 0.245849609375, 0.1221923828125, 0.19140625, 0.0626220703125, 0.1683349609375, 0.09161376953125, 0.1715087890625, 0.1470947265625, 0.1715087890625, 0.1556396484375, 0.175048828125, ...
embed
5614893_c0
5614893
haskell
0
Title: Using color inside separator | fixed width of xmobar command field Problem title: Using color inside separator | fixed width of xmobar command field Tags: xmobar, haskell, xmonad Problem: Using color inside separator | fixed width of xmobar command field I have some xmobarrc config Config { lowerOnStart = False,...
Using color inside separator | fixed width of xmobar command field Using color inside separator | fixed width of xmobar command field xmobar haskell xmonad Using Config xft:Terminus-12 Top Run Network eth0 A36666 Cpu Memory Mem Date Com weather.sh StdinReader fce94f Using color inside separator | fixed width of xmobar ...
[ 0.004302978515625, -0.0098876953125, -0.0218505859375, 0.0198974609375, 0.008056640625, 0.00506591796875, 0.003875732421875, 0.005706787109375, 0.0013275146484375, 0.017333984375, 0.0081787109375, 0.01202392578125, 0.0235595703125, -0.00946044921875, -0.009033203125, -0.025146484375, ...
[ 345, 6953, 10576, 46132, 38310, 748, 188347, 146984, 1022, 432, 1299, 75101, 44457, 1556, 142508, 3796, 712, 139403, 2480, 35484, 34731, 9955, 4792, 28398, 28997, 127, 2389, 8659, 77622, 1766, 172681, 17443, 25512, 3288, 92949, 1495, 2907, 30...
[ 0.070556640625, 0.0516357421875, 0.2303466796875, 0.1773681640625, 0.212646484375, 0.1962890625, 0.1739501953125, 0.1990966796875, 0.052581787109375, 0.1246337890625, 0.2149658203125, 0.1654052734375, 0.1689453125, 0.045013427734375, 0.189208984375, 0.06280517578125, 0.0897216796875,...
embed
9798975_c1
9798975
haskell
1
Options -> Options)] options = [ Option ['v'] ["verbose"] (NoArg (\ opts -> opts { optVerbose = True })) "chatty output on stderr" , Option ['V','?'] ["version"] (NoArg (\ opts -> opts { optShowVersion = True })) "show version number" , Option ['o'] ["output"] (OptArg ((\ f opts -> opts { optOutput = Just f }) . fromMa...
Options -> Options)] options = [ Option ['v'] ["verbose"] (NoArg (\ opts -> opts { optVerbose = True })) "chatty output on stderr" , Option ['V','?'] ["version"] (NoArg (\ opts -> opts { optShowVersion = True })) "show version number" , Option ['o'] ["output"] (OptArg ((\ f opts -> opts { optOutput = Just f }) . fromMa...
[ 0.00147247314453125, 0.00384521484375, 0.003021240234375, -0.00189208984375, -0.0191650390625, 0.00494384765625, -0.0003108978271484375, -0.0164794921875, -0.02099609375, 0.004852294921875, -0.0238037109375, -0.01611328125, -0.007354736328125, -0.0034027099609375, -0.0201416015625, 0.0...
[ 152448, 33079, 16, 268, 50717, 2203, 86769, 334, 81465, 8364, 5021, 7614, 177, 233, 933, 43922, 15896, 837, 184, 87599, 21393, 939, 140992, 98, 6138, 820, 42, 856, 46354, 168660, 178390, 31374, 11389, 14012, 31, 6056, 39029, 1238, 79858, ...
[ 0.320068359375, 0.0875244140625, 0.003082275390625, 0.02813720703125, 0.31787109375, 0.112060546875, 0.26611328125, 0.156494140625, 0.0994873046875, 0.1475830078125, 0.054443359375, 0.08636474609375, 0.06011962890625, 0.145751953125, 0.10235595703125, 0.181884765625, 0.1021728515625,...
embed
42187771_c0
42187771
haskell
0
Title: Couldn&#x27;t match expected type Person with actual type IO () Problem title: Couldn&#x27;t match expected type Person with actual type IO () Tags: types, io, haskell Problem: Couldn't match expected type Person with actual type IO () I have started learning Haskell, and reading Learn You Haskell. Chapter 8 dea...
Couldn&#x27;t match expected type Person with actual type IO () Couldn&#x27;t match expected type Person with actual type IO () types io haskell Couldn Person Show Read Michael Diamond Couldn't match expected type Person with actual type IO () I have started learning Haskell, and reading Learn You Haskell. Chapter 8 de...
[ -0.0108642578125, 0.00799560546875, 0.00061798095703125, 0.0189208984375, -0.005279541015625, 0.025634765625, -0.0145263671875, 0.00933837890625, -0.012451171875, -0.023681640625, 0.00506591796875, -0.0419921875, 0.01385498046875, -0.0113525390625, 0.00555419921875, -0.0179443359375, ...
[ 191147, 19, 3768, 18, 14858, 84751, 10644, 15270, 678, 8561, 17780, 52895, 22995, 1556, 142508, 17367, 4764, 11617, 69124, 26859, 52080, 20625, 16454, 134031, 2583, 117615, 382, 184017, 109513, 2446, 10002, 136, 67413, 18499, 26008, 3129, 2967,...
[ 0.108642578125, 0.0150604248046875, 0.09814453125, 0.113525390625, 0.210693359375, 0.201416015625, 0.22021484375, 0.20263671875, 0.1217041015625, 0.153564453125, 0.1943359375, 0.2197265625, 0.1998291015625, 0.112548828125, 0.205322265625, 0.135498046875, 0.1517333984375, 0.14196777...
embed
8608448_c0
8608448
haskell
0
Title: Existential types and monad transformers Problem title: Existential types and monad transformers Tags: monads, haskell, existential-type, monad-transformers Problem: Existential types and monad transformers Context: I'm trying to produce an error monad that also keeps track of a list of warnings, something like ...
Existential types and monad transformers Existential types and monad transformers monads haskell existential-type monad-transformers the Existential Dangerous Error Show ErrorT State Either Could Existential types and monad transformers Context: I'm trying to produce an error monad that also keeps track of a list of wa...
[ 0.01055908203125, 0.00982666015625, -0.00482177734375, 0.00372314453125, 0.00015354156494140625, -0.00909423828125, -0.0184326171875, -0.00897216796875, -0.01373291015625, -0.0196533203125, 0.0186767578125, 0.004150390625, 0.00188446044921875, -0.01483154296875, 0.000896453857421875, -...
[ 122688, 118, 52895, 136, 2667, 712, 27198, 289, 1314, 1556, 142508, 99707, 15403, 50986, 215175, 2290, 1505, 10821, 212059, 17367, 618, 22836, 9319, 191147, 22829, 31577, 27489, 18499, 13695, 28560, 5303, 1631, 6977, 1884, 903, 10, 83, 41018,...
[ 0.1705322265625, 0.0823974609375, 0.205322265625, 0.067626953125, 0.1357421875, 0.158935546875, 0.220458984375, 0.061492919921875, 0.09930419921875, 0.109130859375, 0.2119140625, 0.1995849609375, 0.1318359375, 0.1483154296875, 0.2100830078125, 0.12158203125, 0.1199951171875, 0.1293...
embed
9344366_c0
9344366
haskell
0
Title: case statement not evaluated Problem title: case statement not evaluated Tags: haskell Problem: case statement not evaluated If m2 and m are equal I want to do an IO operation (send out some stuff over the network) that returns nothing and update my map. I have crafted the following code and wonder (1) if this c...
case statement not evaluated case statement not evaluated haskell AF_INET Datagram Just Map.lookup B.pack case statement not evaluated If m2 and m are equal I want to do an IO operation (send out some stuff over the network) that returns nothing and update my map. I have crafted the following code and wonder (1) if thi...
[ -0.0186767578125, 0.0128173828125, -0.0185546875, 0.004669189453125, 0.007415771484375, -0.01116943359375, 0.000766754150390625, 0.013671875, 0.01611328125, 0.00244140625, 0.0264892578125, 0.01544189453125, 0.00897216796875, -0.01611328125, 0.0107421875, 0.01409912109375, -0.02478027...
[ 7225, 63805, 959, 151575, 297, 1556, 142508, 28211, 17777, 11809, 25561, 9563, 42719, 64747, 335, 29102, 347, 304, 136, 105950, 3444, 17780, 41018, 39285, 1810, 41884, 33120, 30646, 33720, 28350, 22288, 131346, 18151, 144810, 40715, 29786, 2918...
[ 0.2110595703125, 0.2281494140625, 0.144775390625, 0.1981201171875, 0.0703125, 0.1156005859375, 0.1947021484375, 0.136962890625, 0.1239013671875, 0.056182861328125, 0.14208984375, 0.0196380615234375, 0.1197509765625, 0.0160675048828125, 0.0301361083984375, 0.1533203125, 0.134033203125...
embed
62206017_c1
62206017
haskell
1
entelemetry-extra-0.4.2 (user goal) [__3] next goal: proto-lens (dependency of opentelemetry-extra) [__3] rejecting: proto-lens-0.6.0.0 (conflict: base==4.14.0.0/installed-4.1..., proto-lens => base>=4.10 && <4.14) [__3] rejecting: proto-lens-0.5.1.0, proto-lens-0.5.0.1, proto-lens-0.5.0.0, proto-lens-0.4.0.1 (conflict...
entelemetry-extra-0.4.2 (user goal) [__3] next goal: proto-lens (dependency of opentelemetry-extra) [__3] rejecting: proto-lens-0.6.0.0 (conflict: base==4.14.0.0/installed-4.1..., proto-lens => base>=4.10 && <4.14) [__3] rejecting: proto-lens-0.5.1.0, proto-lens-0.5.0.1, proto-lens-0.5.0.0, proto-lens-0.4.0.1 (conflict...
[ -0.01556396484375, -0.01446533203125, 0.00823974609375, -0.0089111328125, -0.01544189453125, -0.024169921875, -0.025634765625, 0.00665283203125, -0.0087890625, 0.025146484375, -0.003936767578125, -0.020263671875, 0.00958251953125, 0.0023193359375, 0.0218505859375, 0.01116943359375, -...
[ 22, 3025, 1928, 1294, 112779, 23320, 117904, 65918, 69236, 11737, 22664, 1977, 7, 105254, 9803, 456, 75161, 122887, 99929, 2271, 134225, 3647, 120518, 617, 80383, 107947, 963, 65283, 93645, 102107, 102014, 121254, 107506, 9655, 7440, 35773, 113...
[ 0.02435302734375, 0.1629638671875, 0.1719970703125, 0.1116943359375, 0.19384765625, 0.040618896484375, 0.1759033203125, 0.131103515625, 0.2098388671875, 0.06146240234375, 0.240234375, 0.2119140625, 0.04681396484375, 0.1092529296875, 0.1080322265625, 0.03424072265625, 0.162841796875, ...
embed
26375699_c1
26375699
haskell
1
PrimeIndex sqrtNat :: Nat -> Nat sqrtNat = floor . sqrt . fromIntegral Edit Oops, the !! wasn't the problem; in the next version of the algorithm (below) I've removed the use of !!; also, I fixed 1 being a prime, which is not, as pointed by @pedrorodrigues main :: IO () main = print $ primesUpTo 20000 type Nat = Int pr...
PrimeIndex sqrtNat :: Nat -> Nat sqrtNat = floor . sqrt . fromIntegral Edit Oops, the !! wasn't the problem; in the next version of the algorithm (below) I've removed the use of !!; also, I fixed 1 being a prime, which is not, as pointed by @pedrorodrigues main :: IO () main = print $ primesUpTo 20000 type Nat = Int pr...
[ -0.0419921875, 0.02783203125, 0.01385498046875, -0.00115966796875, 0.017578125, -0.00653076171875, -0.0019989013671875, -0.01611328125, 0.01031494140625, -0.050048828125, 0.0172119140625, 0.007080078125, 0.00138092041015625, -0.000293731689453125, -0.01226806640625, -0.01104736328125, ...
[ 56195, 4153, 39659, 91, 864, 3198, 4645, 18, 1984, 68875, 33079, 2203, 74912, 6, 5, 1295, 67, 5739, 42079, 68818, 70, 6506, 2967, 11737, 11389, 234873, 372, 17336, 184750, 4527, 111, 188347, 106, 8035, 10, 20809, 4, 83, 959, 297, 390, ...
[ 0.2568359375, 0.14501953125, 0.235595703125, 0.036468505859375, 0.1597900390625, 0.1922607421875, 0.1845703125, 0.1884765625, 0.05841064453125, 0.259765625, 0.083984375, 0.05596923828125, 0.2008056640625, 0.006866455078125, 0.0068359375, 0.150390625, 0.06756591796875, 0.09124755859...
embed
38973342_c0
38973342
haskell
0
Title: Understanding how MagicHaskeller generates functions Problem title: Understanding how MagicHaskeller generates functions Tags: haskell Problem: Understanding how MagicHaskeller generates functions I stumbled upon this product : http://nautilus.cs.miyazaki-u.ac.jp/~skata/MagicHaskeller.html and am very impressed ...
Understanding how MagicHaskeller generates functions Understanding how MagicHaskeller generates functions haskell memoization Understanding MagicHaskeller There Understanding how MagicHaskeller generates functions I stumbled upon this product : http://nautilus.cs.miyazaki-u.ac.jp/~skata/MagicHaskeller.html and am very ...
[ -0.0125732421875, 0.01544189453125, 0.00201416015625, -0.00494384765625, 0.00994873046875, 0.002899169921875, 0.00885009765625, 0.0030517578125, 0.00188446044921875, -0.0159912109375, 0.00020503997802734375, -0.000743865966796875, -0.01025390625, 0.0157470703125, 0.022705078125, 0.0007...
[ 9626, 144057, 3642, 61707, 6495, 1042, 14191, 139392, 7, 32354, 1556, 142508, 163, 432, 47691, 18784, 40099, 54799, 903, 12996, 7130, 5782, 103080, 11222, 54084, 1771, 204971, 442, 831, 101904, 29458, 104951, 10557, 91088, 1436, 29786, 43240, ...
[ 0.07379150390625, 0.03997802734375, 0.03582763671875, 0.183349609375, 0.1590576171875, 0.1732177734375, 0.2274169921875, 0.2139892578125, 0.0261077880859375, 0.2264404296875, 0.1318359375, 0.1796875, 0.0819091796875, 0.1212158203125, 0.071533203125, 0.0276336669921875, 0.017501831054...
embed
27996544_c0
27996544
haskell
0
Title: How to correctly curry a function in JavaScript? Problem title: How to correctly curry a function in JavaScript? Tags: partial-application, lambda-calculus, javascript, haskell, currying Problem: How to correctly curry a function in JavaScript? I wrote a simple curry function in JavaScript which works correctly ...
How to correctly curry a function in JavaScript? How to correctly curry a function in JavaScript? partial-application lambda-calculus javascript haskell currying How JavaScript a.length f.length add2 add5 console.log Number Bool a.filter How to correctly curry a function in JavaScript? I wrote a simple curry function i...
[ 0.00091552734375, 0.0159912109375, 0.00982666015625, -0.0042724609375, -0.00396728515625, 0.0054931640625, 0.003936767578125, -0.01251220703125, 0.019287109375, -0.0030364990234375, 0.018798828125, -0.0257568359375, 0.000247955322265625, 0.00946044921875, 0.003570556640625, -0.02172851...
[ 11249, 47, 26785, 538, 198555, 32354, 23, 17925, 10, 2878, 289, 101687, 6492, 85, 6827, 94739, 136951, 1556, 142508, 214, 23986, 1238, 15190, 304, 758, 130250, 4867, 103332, 2460, 929, 120337, 54397, 8781, 43240, 2684, 22027, 18, 4488, 5452...
[ 0.0963134765625, 0.0426025390625, 0.1954345703125, 0.06610107421875, 0.31640625, 0.241943359375, 0.075927734375, 0.287841796875, 0.07562255859375, 0.09814453125, 0.022247314453125, 0.10302734375, 0.111083984375, 0.06634521484375, 0.1019287109375, 0.1409912109375, 0.2357177734375, 0...
embed
77892943_c0
77892943
haskell
0
Title: nixos 23.11 cabal install mysql-simple problem - &quot;Missing (or bad) C libraries&quot; Problem title: nixos 23.11 cabal install mysql-simple problem - &quot;Missing (or bad) C libraries&quot; Tags: nixos, nix, haskell, cabal Problem: nixos 23.11 cabal install mysql-simple problem - "Missing (or bad) C librari...
nixos 23.11 cabal install mysql-simple problem - &quot;Missing (or bad) C libraries&quot; nixos 23.11 cabal install mysql-simple problem - &quot;Missing (or bad) C libraries&quot; nixos nix haskell cabal p1-0.1.0.0 Missing Build ghc-9.4.8 mysql-0.2.1 lib:mysql pcre-light-0.4.1.2 mysql-simple-0.4.9 exe:p1 Starting Faile...
[ 0.00090789794921875, -0.007537841796875, 0.00970458984375, -0.000789642333984375, 0.00994873046875, 0.004119873046875, -0.00051116943359375, -0.0174560546875, -0.0142822265625, 0.000408172607421875, 0.0208740234375, -0.04638671875, 0.0177001953125, -0.00982666015625, -0.015625, -0.0234...
[ 300, 47436, 9559, 1662, 109524, 20600, 759, 7, 99247, 191560, 2967, 135261, 214, 748, 6494, 313, 35773, 10484, 425, 1556, 142508, 915, 180033, 22892, 16771, 121137, 31380, 238, 15205, 29485, 23320, 68107, 25474, 74277, 36719, 107, 20016, 1212...
[ 0.0654296875, 0.1490478515625, 0.1922607421875, 0.1787109375, 0.2491455078125, 0.1944580078125, 0.13818359375, 0.0667724609375, 0.1978759765625, 0.25634765625, 0.146484375, 0.1458740234375, 0.057464599609375, 0.0821533203125, 0.1513671875, 0.1156005859375, 0.205078125, 0.1156005859...
embed
63654252_c0
63654252
haskell
0
Title: What happened to Haskell&#x27;s EitherT? Problem title: What happened to Haskell&#x27;s EitherT? Tags: monad-transformers, loops, haskell, either Problem: What happened to Haskell's EitherT? When reading an old (2012) blog post titled Breaking from a Loop by Gabriel Gonzalez it became apparent that the spotlight...
What happened to Haskell&#x27;s EitherT? What happened to Haskell&#x27;s EitherT? monad-transformers loops haskell either Control.Monad.Transfomers.EitherT What Haskell EitherT ErrorT ContT ExceptT What happened to Haskell's EitherT? When reading an old (2012) blog post titled Breaking from a Loop by Gabriel Gonzalez i...
[ 0.0032806396484375, -0.0030364990234375, 0.008056640625, -0.0038604736328125, 0.003692626953125, -0.0115966796875, -0.00677490234375, -0.0294189453125, 0.002655029296875, -0.021240234375, 0.00811767578125, -0.000492095947265625, -0.0205078125, -0.0037689208984375, 0.015869140625, -0.00...
[ 4865, 73659, 47, 20625, 142508, 3768, 4565, 9319, 618, 2667, 712, 215175, 1314, 40956, 7, 1556, 40101, 27131, 46674, 62624, 3584, 31648, 14, 212059, 1657, 18, 218288, 16454, 75582, 1415, 1305, 71, 91365, 1295, 10, 199694, 25203, 8433, 31179...
[ 0.04278564453125, 0.123291015625, 0.06201171875, 0.1536865234375, 0.28955078125, 0.08441162109375, 0.10003662109375, 0.226806640625, 0.2578125, 0.1185302734375, 0.1494140625, 0.203857421875, 0.059539794921875, 0.197509765625, 0.0321044921875, 0.1434326171875, 0.11279296875, 0.19958...
embed
49541559_c0
49541559
haskell
0
Title: List Comprehension with list of lists Problem title: List Comprehension with list of lists Tags: list-comprehension, haskell Problem: List Comprehension with list of lists I have problems to understand the following piece of code: treePositions :: Tree a -> [[Int]] treePositions (Node _ ts) = [] : [ (i : is ) | ...
List Comprehension with list of lists List Comprehension with list of lists list-comprehension haskell List Comprehension Tree Node x:xs i-1 List Comprehension with list of lists I have problems to understand the following piece of code: This function would calculate any valid paths to a position in the given tree, whe...
[ -0.0078125, 0.00390625, -0.0084228515625, -0.0034637451171875, -0.001190185546875, 0.0115966796875, 0.0023193359375, 0.0032501220703125, 0.0036773681640625, -0.0281982421875, -0.005828857421875, -0.02099609375, 0.0223388671875, 0.02978515625, -0.0089111328125, -0.001861572265625, 0.0...
[ 32036, 142158, 3220, 678, 5303, 111, 6889, 277, 4692, 1556, 142508, 101344, 438, 1022, 425, 17, 5759, 44402, 28219, 25632, 18151, 32354, 74481, 2499, 35604, 60875, 19069, 34475, 53201, 11907, 110, 121303, 94419, 757, 19777, 79858, 519, 214, ...
[ 0.2203369140625, 0.1494140625, 0.1524658203125, 0.1185302734375, 0.22509765625, 0.06756591796875, 0.040374755859375, 0.00750732421875, 0.1143798828125, 0.1185302734375, 0.2120361328125, 0.1617431640625, 0.109619140625, 0.0775146484375, 0.05902099609375, 0.1422119140625, 0.06958007812...
embed