Home freenode/#haskell: Logs Calendar

Logs: freenode/#haskell

←Prev  Next→
Page 1 .. 644 645 646 647 648 649 650 651 652 653 654 .. 5022
— 502,152 events total
2020-10-15 04:35:14 → nyaomi joins (~naomi@cpe-74-75-6-125.maine.res.rr.com)
2020-10-15 04:37:05 × thir quits (~thir@p200300f27f02580060eb7dde324e54c8.dip0.t-ipconnect.de) (Ping timeout: 246 seconds)
2020-10-15 04:37:24 → emmanuel_erc joins (~user@2604:2000:1382:ce03:1864:d59f:f9f2:35b1)
2020-10-15 04:41:54 → tzh joins (~tzh@2601:448:c500:5300::c7f6)
2020-10-15 04:43:13 <proofofme> https://pastebin.com/E97L9507 How do I make sense of these error files? Everything was working until I tried to add imap to my cabal file. I messed around with versions of base ... but no success
2020-10-15 04:43:49 → plast1k joins (~plast1k@196.207.181.246)
2020-10-15 04:43:59 × plast1k quits (~plast1k@196.207.181.246) (Remote host closed the connection)
2020-10-15 04:43:59 × plast1k_ quits (~plast1k@196.207.181.246) (Quit: Leaving)
2020-10-15 04:44:50 <lemmih> proofofme: Looks like the 'imap' package is broken.
2020-10-15 04:45:01 → merijn joins (~merijn@83-160-49-249.ip.xs4all.nl)
2020-10-15 04:45:18 <proofofme> which part do you look at to know this?
2020-10-15 04:45:40 <lemmih> rejecting: base-4.12.0.0/installed-4.12.0.0 (conflict: imap => base>=4.8
2020-10-15 04:45:40 <lemmih> && <4.9)
2020-10-15 04:46:15 <lemmih> This means it can't use base-4.12 (which is the base library for 8.6.5) because 'imap' depends on base-4.8.
2020-10-15 04:46:44 <proofofme> should I change base versions, and if so, how?
2020-10-15 04:46:54 <proofofme> I tried, without any success earlier
2020-10-15 04:47:12 × vicfred quits (~vicfred@unaffiliated/vicfred) (Quit: Leaving)
2020-10-15 04:47:24 <koz_> proofofme: base is tied closely to compiler version.
2020-10-15 04:47:30 <koz_> So you can't really change it.
2020-10-15 04:47:36 <koz_> What're you after from imap?
2020-10-15 04:47:40 <lemmih> proofofme: No, the problem is with the version of 'imap' that you're using. There are more recent versions, though.
2020-10-15 04:47:52 <proofofme> getting and index inside a map function
2020-10-15 04:47:57 <proofofme> getting an index*
2020-10-15 04:48:10 <lemmih> proofofme: I don't see the dependency for 'imap' in your cabal file.
2020-10-15 04:48:41 <koz_> Wait, this imap? http://hackage.haskell.org/package/imap
2020-10-15 04:48:53 <koz_> That doesn't gel with what you've just said, proofofme .
2020-10-15 04:50:07 × merijn quits (~merijn@83-160-49-249.ip.xs4all.nl) (Ping timeout: 246 seconds)
2020-10-15 04:50:50 <proofofme> I tried several versions of imap in the cabal before I removed it ... forgot that I did actually
2020-10-15 04:50:57 <proofofme> koz_ in which way?
2020-10-15 04:51:10 <koz_> You said you wanted 'getting an index inside a map function'.
2020-10-15 04:51:20 <koz_> If you meant http://hackage.haskell.org/package/imap, then I don't see how that helps.
2020-10-15 04:51:47 <proofofme> hmm ... wow, good point ...
2020-10-15 04:51:49 <proofofme> one sec
2020-10-15 04:52:52 × nineonine quits (~nineonine@216.81.48.202) (Remote host closed the connection)
2020-10-15 04:53:22 → tanuki_ joins (~quassel@173.168.154.189)
2020-10-15 04:53:36 <proofofme> how would y'all do it?
2020-10-15 04:53:37 × tanuki quits (~quassel@173.168.154.189) (Ping timeout: 264 seconds)
2020-10-15 04:53:45 <lemmih> I think you forgot to save the cabal file after removing the 'imap' dependency. The pasted error message doesn't match the pasted cabal file.
2020-10-15 04:53:47 × ezzieyguywuf quits (~Unknown@unaffiliated/ezzieyguywuf) (Ping timeout: 240 seconds)
2020-10-15 04:54:06 → jlamothe joins (~jlamothe@dev.jlamothe.net)
2020-10-15 04:54:12 <proofofme> yeah, the cabal file was after I removed imap dependency
2020-10-15 04:54:34 × nshepperd_ quits (nshepperd@gateway/vpn/mullvad/nshepperd) (Quit: bye)
2020-10-15 04:54:47 → plast1k_ joins (~plast1k@196.207.181.246)
2020-10-15 04:55:28 <lemmih> Well, then run your executable again and see if it works.
2020-10-15 04:55:55 → ezzieyguywuf joins (~Unknown@unaffiliated/ezzieyguywuf)
2020-10-15 04:56:12 <proofofme> well that works ... but how would y'all get an index inside a map function?
2020-10-15 04:56:42 <lemmih> I'm not sure what that means. What are you trying to do?
2020-10-15 04:57:33 → nyd joins (~lpy@unaffiliated/elysian)
2020-10-15 04:57:58 → polyrain joins (~polyrain@2001:8003:e501:6901:65d3:a281:acef:914d)
2020-10-15 04:58:04 × nyd quits (~lpy@unaffiliated/elysian) (Client Quit)
2020-10-15 04:58:13 <proofofme> find the numeric index of an element inside a map of elements
2020-10-15 04:58:28 → nyd joins (~lpy@unaffiliated/elysian)
2020-10-15 04:59:19 <lemmih> > zip [0..] "Hello world" -- Like this?
2020-10-15 04:59:21 <lambdabot> [(0,'H'),(1,'e'),(2,'l'),(3,'l'),(4,'o'),(5,' '),(6,'w'),(7,'o'),(8,'r'),(9,...
2020-10-15 05:00:00 <lemmih> > elemIndex 'o' "Hello world" -- Or maybe like this?
2020-10-15 05:00:04 <lambdabot> Just 4
2020-10-15 05:00:57 <proofofme> https://pastebin.com/RPLNgZ03
2020-10-15 05:01:18 <proofofme> get which index the needle is in actualDivs
2020-10-15 05:02:57 <lemmih> I still don't understand what you want but I can assure you that you won't get it from the 'imap' package. :)
2020-10-15 05:03:40 → zq joins (~zq@xorshift.org)
2020-10-15 05:03:42 <proofofme> return '2', because that's the first index that contains one element of the needle ... for this example, at least
2020-10-15 05:05:02 <zq> how to go about proving that reverse . concat == concat . reverse . map reverse ?
2020-10-15 05:05:17 × conal_ quits (~conal@64.71.133.70) (Quit: Computer has gone to sleep.)
2020-10-15 05:13:28 × plast1k_ quits (~plast1k@196.207.181.246) (Quit: Leaving)
2020-10-15 05:13:47 → plast1k_ joins (~plast1k_@196.207.181.246)
2020-10-15 05:17:53 → merijn joins (~merijn@83-160-49-249.ip.xs4all.nl)
2020-10-15 05:20:05 × drbean quits (~drbean@TC210-63-209-70.static.apol.com.tw) (Ping timeout: 240 seconds)
2020-10-15 05:20:11 → lucid_0x80 joins (~lucid_0x8@188.253.225.49)
2020-10-15 05:20:17 × acidjnk_new quits (~acidjnk@p200300d0c7237896b056d7f56d23f214.dip0.t-ipconnect.de) (Ping timeout: 260 seconds)
2020-10-15 05:22:45 × Kaiepi quits (~Kaiepi@nwcsnbsc03w-47-55-225-82.dhcp-dynamic.fibreop.nb.bellaliant.net) (Ping timeout: 240 seconds)
2020-10-15 05:28:09 × nbloomf quits (~nbloomf@2600:1700:83e0:1f40:e531:b955:8b3c:f641) (Quit: My MacBook has gone to sleep. ZZZzzz…)
2020-10-15 05:28:45 → bahamas joins (~lucian@unaffiliated/bahamas)
2020-10-15 05:29:26 → Kaiepi joins (~Kaiepi@nwcsnbsc03w-47-55-225-82.dhcp-dynamic.fibreop.nb.bellaliant.net)
2020-10-15 05:30:16 × Kaiepi quits (~Kaiepi@nwcsnbsc03w-47-55-225-82.dhcp-dynamic.fibreop.nb.bellaliant.net) (Remote host closed the connection)
2020-10-15 05:31:38 → Kaiepi joins (~Kaiepi@nwcsnbsc03w-47-55-225-82.dhcp-dynamic.fibreop.nb.bellaliant.net)
2020-10-15 05:32:42 → falafel joins (~falafel@2605:e000:1527:d491:c9d2:9986:8bf7:dec8)
2020-10-15 05:33:24 → snakemas1 joins (~snakemast@213.100.206.23)
2020-10-15 05:34:47 <c_wraith> zq: start by proving reverse (xs ++ ys) == reverse ys ++ reverse xs
2020-10-15 05:37:04 → aqd joins (~aqd@87-92-145-87.rev.dnainternet.fi)
2020-10-15 05:37:11 <zq> c_wraith: how would i do that? would dependent lists need to get involved?
2020-10-15 05:37:19 <koz_> proofofme: So you want to find the poisition at which a certain predicate holds?
2020-10-15 05:37:22 <c_wraith> just work definitionally
2020-10-15 05:37:36 <c_wraith> use the definitions of reverse and (++)
2020-10-15 05:38:06 <koz_> proofofme: So like http://hackage.haskell.org/package/vector-0.12.1.2/docs/Data-Vector.html#v:findIndex ?
2020-10-15 05:39:29 <proofofme> just like findIndex! so I can pass a vector into it for the predicates, yeah?
2020-10-15 05:39:35 → zacts joins (~zacts@dragora/developer/zacts)
2020-10-15 05:39:59 × alp quits (~alp@2a01:e0a:58b:4920:4dc1:e34a:e4c0:3af7) (Ping timeout: 272 seconds)
2020-10-15 05:40:01 <zq> oh right, equational reasoning works in haskell
2020-10-15 05:40:05 <koz_> proofofme: I don't understand what the statement 'pass a vector into it for the predicates' means in this context.
2020-10-15 05:40:31 <koz_> You are correct in that findIndex takes a Vector as an argument.
2020-10-15 05:40:37 <koz_> It has nothing to do with the predicate aspect of this.
2020-10-15 05:41:06 <proofofme> ah ok
2020-10-15 05:42:02 <koz_> So, once again, what exactly do you want to do?
2020-10-15 05:42:05 <koz_> Be as specific as possible.
2020-10-15 05:43:10 Guest88073 is now known as lep-delete
2020-10-15 05:43:11 lep-delete is now known as Guest88073
2020-10-15 05:43:11 Guest88073 is now known as lep-delete
2020-10-15 05:43:15 lep-delete is now known as Guest88073
2020-10-15 05:44:04 × zacts quits (~zacts@dragora/developer/zacts) (Client Quit)
2020-10-15 05:44:13 <proofofme> So if the needle is [a,b,c], and the array to search is [z,y,x,a], it should return 3 because the first instance of the needle found in the "haystack" is the 3rd element (counting 0)
←Prev  Next→
Page 1 .. 644 645 646 647 648 649 650 651 652 653 654 .. 5022

All times are in UTC.