The video is about a 2x1 link, which the author hopes to eventually scale up to 3x4 using 40 gig transceivers. I'd say thunderbolt is probably safe in the near future.
Just to put some context into what _never_ means here:
If a website offers me the choice between "accept cookies" and "more options", I'll manually edit the DOM to remove the popup from the offending website. Some sites disable scrolling while such a "We value your privacy" popup is shown, so I wrote a js bookmarklet to work around most common means of scroll hijacking.
Google is currently waging a war against adblockers, especially on youtube. I currently have a way around that too but should they start baking ads in the video bytes, I'll stop using youtube altogether (though I am willing to look the other way for content creators shouting out their curated sponsors).
There is simply no universe in which I pay for certain types of digital content, and while I can't stop the data collection that ultimately pays for it, I can at least make damn sure that it's unlawful.
With respect to Spain and sports, stadiums are littered with ads, players wear ads, the commentator stream itself has ads baked in and people buy tickets and tapas to watch the game live. If that's not enough, go fuck yourselves!
Github: https://github.com/luckyPipewrench
> Pipe-layin' mastermind, code slayer supreme. Typin' fire across the screen, layin' pipe through the night. Bustin' blockages and bugs with no mercy.
That's a nice niche you found (spoken from one heap fan to another) but I have to say I strongly disagree with your use of *roughly* twice as much
At best you were off by one but in the context of performance, you'd want to assign that extra to a super-root of ±inf in order to save log2n extra range checks per heap-up, no?
Ah, I meant that for a classic heap, it's convenient to assign h[0] to the limit of your goal function (e.g. -inf for a min heap) cause that way you can skip the while i>0 check and just do while h[i>>1] > min(h[i], h[i+1]), asserting that the condition is definitely false when i < 2
I guess that it's not as important when you're explicitly willing to pay the piper and run the full log2n iterations just for the sake of branch predictability.
Thanks for the algo though, before today I never would've thought about doing a branchless downheap with i = i<<1 + h[i<<1] != h[i]
Thank you for the impromtpu audit. I agree that localStorage is overkill for the discord use-case, but wanted a bit more leeway for async forum posts.
I might tweak the UI to let users explicitly opt into no-storage operation, though now I wonder whether opening it in incognito is the correct UX approach for that behavior?
I initially wanted to go with inplainsight dot net cause that felt more fitting, but that's parked and the owner won't let it go for less than the low 4 figures, which was outside my budget for a hobby project
reply