| --- Log opened Wed Sep 19 00:00:23 2018 |
| 00:01 | <&McMartin> | Yep. https://i.redd.it/mxxe336ox8m11.png |
| 00:01 | <&McMartin> | Notably missing: "10 years of experience driving Tesla Model 3s" |
| 00:14 | < [R]> | lol |
| 00:18 | | macdjord|slep is now known as macdjord |
| 00:43 | | Kindamoody is now known as Kindamoody[zZz] |
| 00:45 | | Degi [Degi@Nightstar-dppioi.dyn.telefonica.de] has quit [Connection closed] |
| 00:50 | | celticminstrel [celticminst@Nightstar-v1qb0r.dsl.bell.ca] has joined #code |
| 00:50 | | mode/#code [+o celticminstrel] by ChanServ |
| 00:59 | | himi [sjjf@Nightstar-1drtbs.anu.edu.au] has joined #code |
| 00:59 | | mode/#code [+o himi] by ChanServ |
| 01:59 | | Derakon[AFK] is now known as Derakon |
| 03:49 | <@Reiv> | McMartin: Lol, yes |
| 04:35 | | Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has joined #code |
| 04:35 | | mode/#code [+qo Vornicus Vornicus] by ChanServ |
| 05:10 | <&McMartin> | Meanwhile, in less exciting looking Atari work by someone not me that was nevertheless super-useful to me |
| 05:10 | <&McMartin> | https://i0.wp.com/bumbershootsoft.files.wordpress.com/2018/09/tonetoy.png?ssl=1 |
| 05:17 | <~Vornicus> | what is it |
| 05:17 | | Jessikat` [Jessikat@Nightstar-5dv16h.cable.virginm.net] has quit [[NS] Quit: Bye] |
| 05:17 | <&McMartin> | Those are the six sound registers |
| 05:18 | <&McMartin> | So it lets you experiment with creating proper sound effects |
| 05:26 | | McMartin [mcmartin@Nightstar-rpcdbf.sntcca.sbcglobal.net] has quit [Ping timeout: 121 seconds] |
| 05:43 | | Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has quit [Ping timeout: 121 seconds] |
| 05:48 | | McMartin [mcmartin@Nightstar-rpcdbf.sntcca.sbcglobal.net] has joined #code |
| 05:48 | | mode/#code [+ao McMartin McMartin] by ChanServ |
| 05:50 | | Vorntastic [uid293981@Nightstar-6br85t.irccloud.com] has joined #code |
| 05:50 | | mode/#code [+qo Vorntastic Vorntastic] by ChanServ |
| 06:23 | | celticminstrel [celticminst@Nightstar-v1qb0r.dsl.bell.ca] has quit [[NS] Quit: And lo! The computer falls into a deep sleep, to awake again some other day!] |
| 06:49 | <~Vorntastic> | I forgot quite how silly clbuttic can be. "Buttociated press" "embbutty", "pbuttport" |
| 06:51 | <&McMartin> | What, what? |
| 06:51 | <&McMartin> | In the cloud? |
| 07:01 | < [R]> | # sed 's/butt/ass/g' |
| 07:01 | < [R]> | <Vorntastic> I forgot quite how silly clbuttic can be. "Buttociated press" "embbutty", "pbuttport" |
| 07:01 | < [R]> | <Vorntastic> I forgot quite how silly classic can be. "Buttociated press" "embassy", "passport" |
| 07:02 | < [R]> | McMartin: ^ |
| 07:03 | <~Vorntastic> | You forgot the i tag |
| 07:03 | < [R]> | No. Buttociated is clearly a real word. |
| 07:18 | | Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has joined #code |
| 07:18 | | mode/#code [+qo Vornicus Vornicus] by ChanServ |
| 07:23 | | Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has quit [Ping timeout: 121 seconds] |
| 07:26 | <~Vorntastic> | Shri why the fuck are you doing that in a root console |
| 07:29 | < [R]> | My PS1 is just '# ' |
| 07:36 | <~Vorntastic> | Shri why did it autocorrect "also" as Shri |
| 07:36 | < [R]> | I was wondering why you called me that |
| 07:37 | < [R]> | Wait, you weren't saying my name? |
| 07:37 | < [R]> | You were saying "also"? |
| 07:37 | < [R]> | WTF |
| 07:37 | < [R]> | Apple! |
| 07:59 | <&McMartin> | HADOUKEN |
| 08:00 | <~Vorntastic> | What |
| 08:03 | | Kindamoody[zZz] is now known as Kindamoody|afk |
| 08:05 | | * McMartin beats up things that are aggravating with chi pies. |
| 08:07 | <&McMartin> | In other news I managed to get the binutils built for linking programs to run on the Atari ST |
| 08:07 | <&McMartin> | ... which turns out to have secretly been a cousin to MS-DOS |
| 08:08 | <&McMartin> | (Both are half-hearted CP/M clones at their core) |
| 08:21 | | Degi [Degi@Nightstar-kca5p0.dyn.telefonica.de] has joined #code |
| 08:35 | | himi [sjjf@Nightstar-1drtbs.anu.edu.au] has quit [Ping timeout: 121 seconds] |
| 08:36 | <@abudhabi> | Hmm. I am increasingly warming up to the 'no-save' paradigm. |
| 08:36 | <@abudhabi> | Scrivener saves my work automatically. |
| 08:37 | <@abudhabi> | And it doesn't take several seconds like in OO. |
| 08:40 | <~Vorntastic> | It's quite nice in video games where I'm liable to rage quit |
| 08:44 | < Mahal> | My problem with the no-save paradigm is this: |
| 08:44 | < Mahal> | o365 documents and I do not, at all, trust it :P |
| 08:44 | <@abudhabi> | I wish it were included in the FO2 restoration. |
| 08:44 | <@abudhabi> | Given how often it crashes. |
| 08:44 | <@abudhabi> | Mahal: That's Microsoft for you. |
| 08:45 | | Degi [Degi@Nightstar-kca5p0.dyn.telefonica.de] has quit [Connection closed] |
| 08:51 | | Emmy [Emmy@Nightstar-9p7hb1.direct-adsl.nl] has joined #code |
| 08:56 | <~Vorntastic> | Sublime Text does it well I think |
| 08:57 | | Emmy [Emmy@Nightstar-9p7hb1.direct-adsl.nl] has quit [Ping timeout: 121 seconds] |
| 10:55 | | You're now known as TheWatcher[d00m] |
| 10:58 | | Natasha [Natasha@Nightstar-udedvo.moldtelecom.md] has joined #code |
| 10:58 | < Natasha> | Всем привет !!I am from Moscow. Does anyone want to chat? |
| 11:14 | | himi [sjjf@Nightstar-v37cpe.internode.on.net] has joined #code |
| 11:14 | | mode/#code [+o himi] by ChanServ |
| 12:16 | | Kindamoody|afk is now known as Kindamoody |
| 12:34 | | Degi [Degi@Nightstar-kca5p0.dyn.telefonica.de] has joined #code |
| 12:36 | | You're now known as TheWatcher |
| 12:39 | <@gnolam> | I like that this test rig has nice big clunky toggle switches for all its components. Makes inducing errors so much more satisfying. |
| 12:40 | <@gnolam> | I'd like it more if the driver and/or firmware weren't buggy pieces of shit so that toggling said switches /actually fucking worked the way they're supposed to/ rglarhgashgl... but I guess you can't have everything. |
| 13:05 | | Natasha [Natasha@Nightstar-udedvo.moldtelecom.md] has quit [Ping timeout: 121 seconds] |
| 13:26 | | Degi [Degi@Nightstar-kca5p0.dyn.telefonica.de] has quit [Connection closed] |
| 13:28 | | himi [sjjf@Nightstar-v37cpe.internode.on.net] has quit [Ping timeout: 121 seconds] |
| 13:41 | | macdjord is now known as macdjord|wurk |
| 15:00 | | Vorntastic [uid293981@Nightstar-6br85t.irccloud.com] has quit [[NS] Quit: Connection closed for inactivity] |
| 15:06 | | Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has joined #code |
| 15:06 | | mode/#code [+qo Vornicus Vornicus] by ChanServ |
| 17:09 | | Emmy [Emmy@Nightstar-9p7hb1.direct-adsl.nl] has joined #code |
| 17:32 | < simon_> | I've got a mathy problem. I want to generate an ordered stream of multiples of a set of initial numbers with no duplicates. e.g. multiples [3,7] == [3,6,7,9,12,14,15,18,21,...] with 21 being the first element that is a multiple of both 3 and 7. |
| 17:32 | < simon_> | https://gist.github.com/sshine/263aad85398eccf528c64e475f4f2f47 has two solutions. the second one actually performs worse than the first in several cases. |
| 17:32 | < simon_> | (and not better in any) |
| 17:33 | < simon_> | I figured that I wanted to try and construct the result free from duplicates. |
| 17:33 | < simon_> | the bottleneck in version 2 is 'go' applying a filter in a bunch of cases even though the duplicates occur at predictable intervals. |
| 17:34 | < simon_> | ok, I think I got this... |
| 17:34 | < simon_> | I don't know if the approach will perform, but I can think of a way to express it that's somewhat simple. |
| 17:35 | < simon_> | no, wait, that's a different algorithm than what I also thought about. |
| 17:35 | <@ErikMesoy> | is the initial set of numbers supposed to be 2 or arbitrarily large? |
| 17:36 | < simon_> | ErikMesoy, it can be a list. I tried solving for just two and tried to generalise the approach and my head blew up. |
| 17:38 | < [R]> | So from the input list, you take each item and start outputting every number that has that input entry as a factor? |
| 17:38 | < [R]> | IE: [3] would simply be [3,6,9,12,15,18,21,24,27,30,...]? |
| 17:38 | < simon_> | yes |
| 17:39 | < simon_> | the trick is combining those streams without a large overhead in filtering, and without a sorting algorithm that assumes the stream is finite. |
| 17:39 | <@ErikMesoy> | hmm |
| 17:40 | < [R]> | Is this for an assingment? |
| 17:40 | <@ErikMesoy> | I'm bad at Haskell so I may be misunderstanding what the second version is doing, it seems only vaguely similar to what I have in mind but might be the same already. |
| 17:40 | < simon_> | for 'multiples [3,7]' I figured: take `floor (7 / 3)` == 2 elements from the stream [3,6,..] and one element from the stream [7,14,..], and do this `p` times where `p` is a multiple of 3 or 7. |
| 17:40 | < [R]> | Oh you have two algos already |
| 17:40 | < simon_> | [R], it's an exercise on exercism.io. I already solved it, and the mentor wants me to optimize it. |
| 17:40 | < simon_> | [R], yup. |
| 17:41 | | * iospace mauls simon_ |
| 17:42 | < [R]> | Mine would be: sort the input, then map that into an array or arrays, the internal array will have three items: input value, step (start at 1), and last output (initial value of input * step). |
| 17:42 | < simon_> | my first attempt gave me something slower. profiling it I can see that when there's a lot of duplicates (short distance between factors), version 2 blows up, and when there's a large gap, version 1 blows up. |
| 17:43 | <@ErikMesoy> | And the output stream is supposed to be infinitely generatable. Hmm |
| 17:43 | < simon_> | [R], the streams are infinite. I can't sort them. what version 2 does is merge them because they're all monotonically increasing. |
| 17:43 | < [R]> | Then loop though the values indefinately, output the lowest output value, then increment the step for all inputs that have that output value and recalculate the outputs. |
| 17:43 | < simon_> | [R], you're describing my algorithm 2. |
| 17:43 | < [R]> | Ah |
| 17:43 | < simon_> | [R], pickLeast :: [[Integer]] -> (Integer, [[Integer]]) |
| 17:43 | < [R]> | Yeah I can't read sillycode |
| 17:43 | < simon_> | :D |
| 17:44 | <@ErikMesoy> | Is it worth considered generating the output stream in chunks? |
| 17:44 | < simon_> | ErikMesoy, yes! |
| 17:45 | < simon_> | ErikMesoy, that somewhat describes an idea I'm sitting with. |
| 17:46 | <@ErikMesoy> | Pick a chunk-size of at least 2x largest input value. Generate multiples of each input within the range of a chunk-size. Merge these multiples into a chunk of output. |
| 17:46 | < simon_> | ErikMesoy, largest input value? |
| 17:46 | < simon_> | ErikMesoy, these are arbitrary-size integers. |
| 17:46 | <@ErikMesoy> | But still finite, right? |
| 17:46 | < simon_> | yes, sorry |
| 17:49 | <@ErikMesoy> | I'm guessing on the chunk size target, but I think the idea is sound. |
| 17:49 | <@ErikMesoy> | Say you get [3,5,7]. You pick chunk size 20. So first you generate [3,6,9,12,15,18], [5,10,15,20], [7,14] and merge these into a single chunk of output. |
| 17:50 | <@ErikMesoy> | Then for range 21-40 you generate [21,24..39], [25,30,35,40], [21,28,35] and merge those into a chunk of output. |
| 17:51 | < simon_> | what's the advantage of doing it in chunks? |
| 17:51 | <@ErikMesoy> | Merging smaller lists and filtering for duplicates is faster |
| 17:51 | < simon_> | I'll be generating and filtering out just as many elements. |
| 17:51 | < simon_> | how come? |
| 17:52 | <@ErikMesoy> | Each candidate-element is being checked against fewer things? |
| 17:52 | < simon_> | I'd still have to check each element against `isMultipleOf [3,5,7]`? |
| 17:52 | <@ErikMesoy> | No you wouldn't. |
| 17:52 | <@ErikMesoy> | You'd only generate multiples of those in the first place, so they don't need to be checked for being multiples. |
| 17:53 | < simon_> | err |
| 17:53 | < simon_> | sorry |
| 17:54 | < simon_> | but to eliminate duplicates, the chunk in the range 21-40 generated by 5 would still need to be filtered for multiples of 3. |
| 17:54 | <@ErikMesoy> | No, it would only need to be filtered for overlap with the two other intermediate lists. |
| 17:55 | < simon_> | ah. hm. |
| 17:55 | <@ErikMesoy> | If you are optimizing for speed, I *think* a few equality comparisons will be faster than a divisibility check. |
| 17:55 | < simon_> | I'm optimizing for speed (and memory, since it affects speed). |
| 17:56 | <@ErikMesoy> | Especially since the intermediate lists-for-merging start out sorted |
| 17:56 | < simon_> | I think the algorithm is easy enough to follow that I'd like to benchmark/profile it. |
| 17:57 | | Jessikat [Jessikat@Nightstar-4rp.jtr.132.82.IP] has joined #code |
| 17:58 | < simon_> | I'm not sure I'm completely convinced it will make a difference. luckily lazy list append is O(1). :P |
| 18:01 | <@ErikMesoy> | If you do something Clever, I think you could even get duplicate-filtering nearly for free while merging the intermediate lists, using a variant of mergesort algorithm |
| 18:01 | <@ErikMesoy> | using < instead of <= at a relevant point to determine when to advance head to next item to be merged |
| 18:05 | < simon_> | ErikMesoy, my idea was to calculate, for each stream of multiples of each individual factor, a fixed interval at which to take A non-duplicates, drop 1 duplicate, take B non-duplicates, drop 1 duplicate, etc. until the process repeats at the K'th element that is a common multiple of all factors, and repeat the process. so no filtering, no merging. just take and drop. |
| 18:09 | <@ErikMesoy> | sounds like it might blow up if the LCM is large |
| 18:12 | < simon_> | yeah. |
| 18:12 | < simon_> | it does. |
| 18:30 | | Jessikat [Jessikat@Nightstar-4rp.jtr.132.82.IP] has quit [[NS] Quit: Bye] |
| 18:58 | <&McMartin> | Oh dear, the Space Core is back, albeit not yet on this network |
| 18:58 | | Vorntastic [uid293981@Nightstar-6br85t.irccloud.com] has joined #code |
| 18:58 | | mode/#code [+qo Vorntastic Vorntastic] by ChanServ |
| 18:58 | <&McMartin> | And it's discovered unicode |
| 18:58 | <&McMartin> | Next yera, it will be Zalgo |
| 18:59 | <&jeroud> | Space Core? |
| 18:59 | <&jeroud> | This sounds like a thing that I should be glad to not know about... |
| 19:00 | <@ErikMesoy> | http://elderscrolls.wikia.com/wiki/Space_Core ? |
| 19:13 | <@TheWatcher> | McMartin: is this something I can preemptively train killbot to recognise? >.> |
| 20:07 | <&McMartin> | jeroud: The Space Core, who was fixated on various astronomical objects and what they may or may not be doing, as compared to one of the standard names for the god of the Abrahamic religions |
| 20:07 | | * McMartin tiptoes around pre-existing killbots~ |
| 20:07 | <&McMartin> | TheWatcher: I can PM you the text that appeared elsenet |
| 20:09 | <@TheWatcher> | Thank'ee |
| 20:09 | <@TheWatcher> | Also, just so's you know, you're safe if you have any form of ops |
| 20:10 | <&McMartin> | Ah, OK |
| 20:10 | <&McMartin> | In which case, to be clear |
| 20:10 | <&McMartin> | This is the "dragons are not doing allah is doing" dude |
| 20:11 | <&McMartin> | I'm pretty sure that jeroud was here in those days |
| 20:12 | <&jeroud> | Oh, right. I know that one, just not the name. |
| 20:12 | <@TheWatcher> | Thanks for the paste, I shall add it to the mix |
| 20:15 | <&McMartin> | I might have been the only one that referred to him as the space core |
| 20:15 | < [R]> | He's hitting Freenode hard |
| 20:15 | <&McMartin> | GUILTY OF BEING IN SPACE |
| 20:15 | <&McMartin> | GOIN' TO SPACE JAIL |
| 20:15 | < [R]> | AFAICT it's only Freenode though |
| 20:15 | < [R]> | So I think the GNAA has figgured out Freenode is the only network that doesn't have their shit together RE: anti-spam |
| 20:17 | <&McMartin> | GNAA EAP |
| 20:19 | <&jeroud> | Maybe search the term carefully? |
| 20:20 | <&jeroud> | I'm not entirely comfortable typing those words on my phone in case my keyboard app remembers them. |
| 20:21 | <&McMartin> | Maybe I'll just enjoy my ignorance if it's not something expected to be widely available. |
| 20:22 | <&jeroud> | Pasting a Wikipedia link should be safe enough: https://en.m.wikipedia.org/wiki/Gay_Nigger_Association_of_America |
| 20:23 | < [R]> | Easy as Pie? |
| 20:24 | <&jeroud> | Expand Acronym Please. |
| 20:24 | < [R]> | Ah |
| 20:24 | < [R]> | See, a questionmark is shorter and clearer |
| 20:25 | < [R]> | McMartin: the GNAA was responsible for that last major wave that was advertising spamming services, calling the Freenode staff pedos and all that |
| 20:25 | < [R]> | Supposedly anyways |
| 20:27 | <&McMartin> | Aha. |
| 20:27 | < [R]> | I suspect this Allah crap is also them |
| 20:27 | < [R]> | Since the spam on Freenode really didn't stop |
| 20:27 | < [R]> | It just shifted |
| 20:28 | <&McMartin> | Odd to take on the modus operandi of a known loon from years back |
| 20:29 | < [R]> | Perhaps they were always the loon? |
| 20:29 | < [R]> | The bastards have been flooding Slashdot with shitposts forever |
| 20:37 | <&jeroud> | Every time I see a reference to Slashdot I'm vaguely surprised it's still around. |
| 20:43 | < [R]> | Dice tried very hard to kill it |
| 20:43 | <@gnolam> | It committed suicide. |
| 20:43 | < [R]> | But that ultimately failed |
| 20:43 | < [R]> | But it was also quite successful |
| 21:34 | | Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has quit [Ping timeout: 121 seconds] |
| 22:51 | | Degi [Degi@Nightstar-kca5p0.dyn.telefonica.de] has joined #code |
| 23:00 | | Vorntastic [uid293981@Nightstar-6br85t.irccloud.com] has quit [[NS] Quit: Connection closed for inactivity] |
| 23:23 | <&McMartin> | https://arstechnica.com/information-technology/2018/09/newegg-hit-by-credit-card-stealing-code-injected-into-shopping-code/ |
| 23:23 | | himi [sjjf@Nightstar-v37cpe.internode.on.net] has joined #code |
| 23:23 | | mode/#code [+o himi] by ChanServ |
| 23:33 | | himi [sjjf@Nightstar-v37cpe.internode.on.net] has quit [Ping timeout: 121 seconds] |
| --- Log closed Thu Sep 20 00:00:25 2018 |