00:26:27 -!- MDude has joined.
01:10:47 -!- atslash has quit (Read error: Connection reset by peer).
01:11:35 -!- atslash has joined.
01:15:10 -!- imode has joined.
01:26:20 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)).
01:38:40 -!- MDude has joined.
01:43:15 -!- delta23 has quit (Quit: Leaving).
01:48:57 -!- Lord_of_Life_ has joined.
01:49:56 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
01:50:18 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
01:57:42 -!- MDude has quit (Ping timeout: 260 seconds).
01:58:36 -!- MDude has joined.
02:16:11 <esowiki> [[C-trice]]  https://esolangs.org/w/index.php?diff=79425&oldid=78911 * RocketRace * (-1596) Replaced content with "Candidate for deletion"
03:56:29 <esowiki> [[OISC]]  https://esolangs.org/w/index.php?diff=79426&oldid=74877 * Unl256 * (+96) /* List of OISCs */
04:18:17 -!- arseniiv has joined.
04:21:24 -!- adu has joined.
04:52:37 -!- rodgort has quit (Quit: Leaving).
04:54:16 -!- rodgort has joined.
04:55:22 -!- haavard has quit (Ping timeout: 260 seconds).
04:56:33 -!- haavard has joined.
05:08:08 -!- FireFly has quit (Quit: Goodbye).
05:09:45 -!- FireFly has joined.
05:47:33 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)).
06:37:08 -!- adu has quit (Quit: adu).
06:58:54 <int-e> unsurprisingly, today's task doesn't look very twisty
06:59:00 <int-e> emphasis on very
07:00:08 <int-e> and yesterday's is not nearly as twisted as it might have been
07:14:09 <int-e> actually today is the first time I spent effort on optimising the code after getting both stars
07:14:30 <int-e> I was not happy with my code taking more than a minute for the second part.
08:12:12 -!- sprocklem has quit (Ping timeout: 260 seconds).
08:35:29 -!- Sgeo has quit (Read error: Connection reset by peer).
08:46:19 <Taneb> int-e: mine still takes over 30 seconds and I'm not happy with that
08:47:59 <int-e> Taneb: I bit the bullet and used ST and unboxed arrays.
08:48:27 <int-e> well, array, singular.
08:49:12 <Taneb> I'm just using IntMap but I'm surprised there's that much of a speedup from arrays
08:50:08 <int-e> well you do get millions of entries, so a tree of depth 20 or so, and traversing that is a lot of random memory accesses
08:50:44 <Taneb> Hmm, good point
08:53:08 <int-e> oh and GC cost may be nontrivial too... hmm.
08:55:25 <int-e> "Productivity  49.4% of total user, 49.3% of total elapsed"
08:56:34 <int-e> Just passing +RTS -A2G  is a nice 150% speedup
08:56:52 <int-e> bringing productivity up to 85%.
08:56:58 <int-e> (ymmv)
09:00:06 <int-e> But the array version has 99.5% productivity (unsurprisingly; the big array isn't scanned and the rest of the heap is really small)
09:00:48 <int-e> > 29.717 / 0.562
09:00:51 <lambdabot>  52.87722419928825
09:04:39 <int-e> Taneb: what happened to yesterday's second star?
09:05:02 <int-e> (looking at the #haskell list)
09:06:32 <Taneb> int-e: critical motivation error
09:09:21 <int-e> it just looks out of place among all the gold :)
09:09:31 <Taneb> I'll get round to it
09:10:13 <Taneb> ...eventually
09:10:25 <Taneb> (Seeing as I've done some of the 2015 tasks this month, it may be a while)
09:38:35 -!- rain1 has joined.
10:06:04 -!- Arcorann has joined.
10:20:46 -!- delta23 has joined.
10:49:56 <shachaf> int-e: I'm unsure what to do at this island that has two tall trees and two rocks.
10:50:31 <int-e> shachaf: if you make a screenshot I might have an idea
10:50:57 <shachaf> Ah, I was trying to be deliberately vague. But I guess I can do that.
10:51:24 <shachaf> https://slbkbs.org/tmp/2020-12-15-025059_3840x2160.png
10:51:30 <shachaf> Not that I've been stuck here for that long or anything.
10:54:01 <int-e> Yeah I know what you can do there and it doesn't seem terribly difficult.
10:54:17 <shachaf> I'll figure it out.
11:00:57 -!- atslash has quit (Quit: Leaving).
11:05:04 -!- LKoen has joined.
11:06:23 <shachaf> int-e: Oh, wow, I can't believe I missed that.
11:06:38 <shachaf> Especially since it was the theme of this whole area.
11:07:01 <shachaf> I spent a little time trying to get to the rock but most of the time I was thinking I needed to get to the (barely visible) island in the southeast.
11:08:48 <shachaf> Oh, and it just brought me here.
11:14:26 <int-e> sometimes all it needs is a small leap of faith
11:20:54 <esowiki> [[Category:Graphical Output]] N https://esolangs.org/w/index.php?oldid=79427 * Sinthorion * (+69) Created page with "Languages with primarily graphical IO (to screen or to an image file)"
11:21:39 <esowiki> [[PixelCode]] M https://esolangs.org/w/index.php?diff=79428&oldid=78088 * Sinthorion * (+114) categories
11:22:03 <esowiki> [[Graphical Brainfuck]] M https://esolangs.org/w/index.php?diff=79429&oldid=50990 * Sinthorion * (+30) category
11:26:08 -!- imode has quit (Ping timeout: 260 seconds).
11:27:14 <esowiki> [[Image]]  https://esolangs.org/w/index.php?diff=79430&oldid=62030 * Razetime * (+30) 
11:28:36 <esowiki> [[Drawfuck]]  https://esolangs.org/w/index.php?diff=79431&oldid=47307 * Razetime * (-5) 
11:30:45 -!- rain1 has quit (Quit: WeeChat 2.9).
11:30:53 <esowiki> [[MATL]]  https://esolangs.org/w/index.php?diff=79432&oldid=76648 * Razetime * (+30) 
11:31:37 <esowiki> [[Rebmu]]  https://esolangs.org/w/index.php?diff=79433&oldid=68159 * Razetime * (+30) 
11:34:01 <esowiki> [[Rebmu]]  https://esolangs.org/w/index.php?diff=79434&oldid=79433 * Razetime * (+0) 
11:39:47 <int-e> did we just get another new category without discussion :-(
11:41:56 <int-e> though the current state spells out "gimp" in the middle which is a funny accident https://esolangs.org/wiki/Category:Graphical_Output (may need to be logged in to see the latest version)
11:42:03 -!- Arcorann_ has joined.
11:45:22 -!- Arcorann has quit (Ping timeout: 256 seconds).
12:13:43 -!- sftp has quit (Ping timeout: 258 seconds).
12:14:07 -!- sftp has joined.
12:32:49 <nakilon> 02:31:48 <fizzie> And for the same low price of none, here's also a stack-only day 2 part 1
12:32:51 <nakilon> wow how
12:36:35 <nakilon> my day 1 part 2 is https://dpaste.org/0rDS/slim
12:42:51 <nakilon> somehow your part 2 is different from part 1 only by a little
12:43:31 <nakilon> but it has to be a whole one more loop around
12:54:26 -!- TheLie has joined.
13:02:37 <esowiki> [[Rui]] M https://esolangs.org/w/index.php?diff=79435&oldid=78269 * PythonshellDebugwindow * (+21) /* Turing-Completeness */ rm redirect
13:03:08 <fizzie> It doesn't, though.
13:04:10 <fizzie> What it does is essentially: for i { for j { k = 2020 - (i+j); if exists[k]: return i*j*k } }
13:06:07 <fizzie> It uses one of the playfield rows as a bitmap, basically. The input-reading loop collects all the input numbers to consecutive cells of row f as with part 1, but for every number i, it also sets the i'th column of row e to 0 for that "check if we have this number" test.
13:07:34 <nakilon> oh cool, you kind of use the program space for implicit sorting
13:07:40 <nakilon> by that exists[]
13:08:29 <esowiki> [[Rebmu]] M https://esolangs.org/w/index.php?diff=79436&oldid=79434 * PythonshellDebugwindow * (+50) External link
13:08:31 <nakilon> can't be done in rasel since it currently isn't supposed for random writing
13:08:56 <fizzie> Yeah, that's why I said "it's a bit of a cheat".
13:09:21 <int-e> ultimate bucket sort
13:09:48 <fizzie> I did part 2 of day 2 as well, but had to use one cell on the playfield for it: http://ix.io/2I9P
13:10:20 <nakilon> I went sleep yesterday on doing day 2 part 2, have to finish it yet
13:10:43 <nakilon> unlike day 1 the part 2 here is changing the program a lot
13:10:57 <fizzie> A rot or a 2swap/2dup would certainly make stack-only Befunge solutions much more plausible.
13:11:19 <nakilon> what's that?
13:11:28 <nakilon> swap 3 top items?
13:11:48 <fizzie> Yeah, [a b c] -> [b c a]. Or the other way around, I can never remember.
13:12:19 <fizzie> It's a Forth term. 2swap and 2dup do [a b c d] -> [c d a b] and [a b] -> [a b a b] respectively.
13:12:21 <nakilon> yeah, each step deeper is a huge help
13:12:36 <nakilon> the number is problems become easily solvable grows exponentially
13:13:38 <nakilon> *of problems
13:14:11 <fizzie> The "algorithms" (if you can call them that) in my Befunge solutions are: for part 1, it just reads characters and compares them to the reference character, possibly incrementing a count stored below the reference. After it's done, it compares the result to the low/high bounds. The input transforms the (low, high) pair to (high-low+1, low) to make it possible with just swap.
13:17:38 <fizzie> And for part 2 it just uses two read-and-discard loops to skip over characters before the first important one, and between the first and second ones, and then calculates essentially (a == c) + (b == c) == 1. But I had to p/g the c value. :/
13:19:55 <fizzie> int-e: The problem with modern computers are, they're just too fast. I did the "just play the game" solution for part 1, fully assuming they'd ask for some ridiculously large number for part 2 that'd need some clever trick, but then they asked for a relatively modest number, which comes out of the simple solution in less than two seconds. So now I'm not motivated to think about shortcuts.
13:21:43 <nakilon> to see if X is within A and B I stored it like A B B X, then subtract-compare the last two, then restore X by subtracting the (B-X) from B, then compare with A
13:25:10 <fizzie> Hmm, makes sense. What I did was (modulo some +1s) to store B-A A X, turn it into B-A X-A, then do the comparisons X-A > 0 (aka X > A) and X-A < B-A (aka X < B).
13:31:53 <int-e> fizzie: well as indicated earlier, the Data.Map based Haskell solution made me bite my nails for a minute
13:33:25 <int-e> I also followed my usual pattern of producing a list of numbers and then taking the N-th element. Turns out that list alone accounted for half of the time.
13:33:42 <esowiki> [[PRSCNT]]  https://esolangs.org/w/index.php?diff=79437&oldid=79424 * Someone else * (+828) 
13:35:39 <esowiki> [[PRSCNT]]  https://esolangs.org/w/index.php?diff=79438&oldid=79437 * Someone else * (+33) 
13:50:48 -!- LKoen has quit (Remote host closed the connection).
13:51:04 -!- LKoen has joined.
13:52:16 <fizzie> FWIW, here's also a stack-only day 2 part 2, with just a little code duplication (to maintain state in the IP rather than on the stack): http://ix.io/2Ia7
13:53:36 <fizzie> Probably that could be fixed too, with some similar system for restoring the value, just don't have time now.
14:01:15 <esowiki> [[PRSCNT]]  https://esolangs.org/w/index.php?diff=79439&oldid=79438 * Someone else * (+1266) Added examples
14:01:37 <fizzie> Eh, actually, it's much simpler than that, I can just http://ix.io/2Iab -- though that's got a larger bounding box after all. Not sure what's better.
14:04:28 <esowiki> [[PRSCNT]]  https://esolangs.org/w/index.php?diff=79440&oldid=79439 * Someone else * (+9) 
14:19:01 -!- adu has joined.
14:21:42 -!- Arcorann_ has quit (Ping timeout: 256 seconds).
14:48:57 -!- Sgeo has joined.
14:54:19 <esowiki> [[PRSCNT]]  https://esolangs.org/w/index.php?diff=79441&oldid=79440 * Someone else * (+1268) Added examples
14:55:21 <esowiki> [[PRSCNT]]  https://esolangs.org/w/index.php?diff=79442&oldid=79441 * Someone else * (+6) Formatting
14:56:52 -!- rain1 has joined.
15:15:36 -!- deltaepsilon23 has joined.
15:15:55 -!- delta23 has quit (Disconnected by services).
15:15:59 -!- deltaepsilon23 has changed nick to delta23.
15:17:14 <esowiki> [[PRSCNT]]  https://esolangs.org/w/index.php?diff=79443&oldid=79442 * Someone else * (-680) 
15:28:54 -!- TheLie has quit (Remote host closed the connection).
16:47:56 <esowiki> [[PRSCNT]]  https://esolangs.org/w/index.php?diff=79444&oldid=79443 * Someone else * (+7) 
16:53:24 -!- S_Gautam has joined.
16:58:45 -!- adu has quit (Quit: adu).
17:03:22 -!- sprocklem has joined.
17:05:21 -!- adu has joined.
17:05:26 -!- TheLie has joined.
17:45:54 -!- adu has quit (Quit: adu).
17:56:45 -!- MDude has joined.
18:27:49 -!- arseniiv has quit (Ping timeout: 264 seconds).
18:57:11 <b_jonas> fungot, is "four-legged feline" a tautology?
18:57:11 <fungot> b_jonas: the planned liberalization of telecommunications on 1 january 2001, brought a case before the appeal court of the hague convention.
19:02:40 <shachaf> Why would it be a tautology?
19:45:00 -!- pr0gr3sR has joined.
19:45:30 -!- imode has joined.
19:51:43 -!- FreeFull has joined.
19:57:40 <b_jonas> I think all felines have four legs. even tigers, who can swim well, have four legs, not fins, just like crocodiles. catfish aren't actually related that closely, they just have one of these unfortunate aristotelian names like seahorses.
20:13:01 -!- S_Gautam has quit (Quit: Connection closed for inactivity).
20:13:24 <shachaf> I've seen some videos of three-legged and two-legged cats.
20:37:34 <nakilon> there was a song https://www.youtube.com/watch?v=9JSIrfHNJCI
20:38:16 <nakilon> my father often quoted this line but I never knew where it's from, just googled, the last result on the first google's page
20:38:24 <nakilon> it says "cat has 4 legs"
20:38:33 <nakilon> "and behind it there is a tail"
20:38:35 <nakilon> ..D
20:55:25 -!- bitkiller has joined.
20:55:38 -!- bitkiller has left.
21:19:19 -!- Apache has joined.
21:19:26 <Apache> https://cryptotabbrowser.com/16879401
21:34:45 -!- TheLie has quit (Remote host closed the connection).
21:36:57 -!- Arcorann_ has joined.
21:45:49 -!- jess has joined.
21:49:36 -!- Apache has quit (K-Lined).
21:50:38 <esowiki> [[AmBored]] M https://esolangs.org/w/index.php?diff=79445&oldid=78301 * Tetrapyronia * (+30) ~ c ~ a ~ t ~
21:52:10 -!- Apache has joined.
21:54:00 -!- Apache has quit (K-Lined).
21:54:49 -!- Apache has joined.
21:56:18 -!- Apache has quit (K-Lined).
22:07:08 -!- LKoen has quit (Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.”).
23:08:30 <nakilon> > (a == c) + (b == c) == 1. But I had to p/g the c value. :/
23:08:32 <lambdabot>  <hint>:1:57: error: <hint>:1:57: error: parse error on input ‘:/’
23:08:40 <nakilon> yeah I've got a problem too
23:10:01 <nakilon> I have to store 1. the second skip length 2. the char 3. and the result of the first comparison
23:11:00 <nakilon> and I can't just push the (2) behind (1), I needed it here on top because I duped it for the first comparison
23:12:12 <nakilon> fizzie so you just made copypaste for two branches?
23:12:31 <fizzie> That's the first non-g/p solution I did, yes.
23:15:05 <nakilon> I have a feeling that there is a solution
23:15:42 <fizzie> The other one I have just does a branch followed by either \0\ or \1\ to basically go from stack [skip char result] to [result char skip].
23:16:34 <fizzie> Er, I don't think that was quite right.
23:16:46 <fizzie> It works, anyway.
23:19:18 <fizzie> Right, from [skip char result] to [char result skip], is what I was supposed to say. By temporarily discarding the result, since the only thing that matters is whether it was 0 or not, so that state can be kept by which branch it's in while it swaps skip and char.
23:20:26 -!- TheLie has joined.
23:21:37 <fizzie> So it's quite similar except that instead of duplicating the whole "discard the middle bit" code it only duplicates the "swap the order of (1) and (2) and then put (3) back" code, to use your numbers.
23:32:50 <nakilon> if only there was a way for first char check part to has an effect on the second part so it reversed its mind
23:35:02 <nakilon> maybe read both chars, compare them with each other and only then compare to the X?
23:35:54 <nakilon> meh, won't work, still need plenty of space
23:43:29 -!- mla has joined.