vitus

36 ms·

391.
by vitus 3y ago
Good to know! I admittedly haven't written much Go in the past year, and while min / max were some of the most egregious examples, I'm sure there are plenty more that still exist.
392.
by vitus 3y ago
> This is funny to me, because Go is often touted as a language that has "everything you need" in the stdlib. My usual example of something missing from the standard library is func max(a, b int) int { if a > b {
393.
by vitus 3y ago
It is also useful for conveying intent. If the commit message describes one thing, and the code does the opposite (or doesn't do it at all), that's something the "gatekeeper" can and should call out. I've certainly
394.
by vitus 3y ago
> The second style likely feels foreign, and possibly uncomfortable. It's passive voice and present tense — all the things that we aren't supposed to make our commit messages. Nitpick: it's passive voice and indicative mo
395.
by vitus 3y ago
Shor's algorithm also solves the discrete logarithm problem, so it also theoretically breaks Elliptic Curve Diffie-Hellman. That is, it breaks both of the main types of key-exchange algorithms (as well as SRP) in use today with TLS. (N
396.
by vitus 3y ago
TCO is about more than self-recursive calls -- you should be able to handle mutual recursion: f = x => x > 0 ? g(x - 1) : 0; g = x => x > 0 ? f(x - 1) : 0; (These functions don't do anything other than stress-t
397.
by vitus 3y ago
(Context: https://learnmoderncpp.com/2022/12/07/applications-of-c23s-d... ) While the article describes why you'd want this abomination, honestly, I'd rather opt for the copy-pasted code T&
398.
by vitus 3y ago
Either way, this point is moot, as any copyrighted material from mid-19th century France entered the public domain long ago. In this case, Baldus died in 1889, so any of his works would have entered the public domain in 1939, in accordance
399.
by vitus 3y ago
Broadly, the entire space of (lossy, lossless) compression falls under the purview of information theory, which tells us that almost all [0] encoding schemes with sufficient codebook entropy can achieve the desired capacity / compressi
400.
by vitus 3y ago
This is hinted at very briefly in one code comment [0] in the article, but this application of SVD is a well-known (to the point that it's even taught in university) method for dimensionality reduction, and typically referred to as Pri
401.
by vitus 3y ago
There are a number of good resources at https://ebf.io , including a couple of links to books. I haven't read those books personally, but I would be surprised if "BPF Performance Tools" by Brendan Gregg isn't
402.
by vitus 3y ago
That's a good point. I should clarify that no such verification is necessary in classic BPF due to the absence of backward jumps -- you can trivially show that the maximum steps executed by a BPF program is 4096, since you'll exec
403.
by vitus 3y ago
tcpdump only uses BPF, not eBPF. BPF is a simpler language that, among other things, is guaranteed to run in finite time because it doesn't have backward jumps, and has limitations on program size (4096 instructions). (The "e&quot
404.
by vitus 3y ago
I believe this is the referenced Nvidia blog post, for context (since AMD's post doesn't seem to link to it): https://developer.nvidia.com/blog/achieving-top-inference-pe...
405.
by vitus 3y ago
> Or are those ports for control inside the firewall only? It seems so. This traffic likely will not even traverse a firewall -- the article lists the IP addresses used with port 52699, which are all RFC1918 space (172.16.0.0/12).
406.
by vitus 3y ago
The other side of Shor's algorithm is that you can use it to solve discrete logarithm (which additionally breaks elliptic curve crypto; factoring breaks RSA). I don't agree that Grover's algorithm is as fundamental in breakin
407.
by vitus 3y ago
The problem is that a bad hire is really expensive to correct, and so traditionally Google's hiring process has erred on the side of being overly conservative. We've rejected some excellent engineers (or driven them away with the
408.
by vitus 3y ago
When interviews were actually in person, there would be a pass-along sheet where you would write down your question. Of course, that wasn't perfect (the comment I had about too many people asking BFS was from a pre-pandemic email threa
409.
by vitus 3y ago
Do note that these interview slates will vary depending on level of candidate experience. At Google, we generally do not ask system design interviews of new grads / entry-level candidates. It's pretty rare for mid-level candidates
410.
by vitus 3y ago
Right. I was commenting specifically on the effectiveness of > with the right permissions it may also be feasible to maintain a scam number list based on user reports that sends out a notification when a known scammer is trying to call y
411.
by vitus 3y ago
Phone number is unfortunately not reliable, since it can be spoofed (and phone companies are broadly uninterested in doing more than the bare minimum to address this). There are plenty of scams based on impersonating some official (FBI, IRS
412.
by vitus 3y ago
Indeed. These are cards from ~2012 (Kepler came about with the GTX 600 series).
413.
by vitus 3y ago
Amazon used to have a separate web search product, but they shuttered that effort a while ago. https://en.wikipedia.org/wiki/A9.com#A9.com_search_portal Back in 2006: https://web.archive.org/web/20
414.
by vitus 3y ago
> Given that destiny, a 1st person shooter, was their flagship game these flaws really jumped out. In the earliest days of the internal dogfood, there was one game available: Doom (2016). This was very much intentional to make sure the s
415.
by vitus 3y ago
This is apparently a change to the order agreement. I can't see how it'd be held up in a court of law if they don't make people sign the new terms. (archive.org links to prevent those from changing from under me) v20211124 Cy
416.
by vitus 3y ago
> std::deque will never beat your hand-rolled ring buffer. std::deque may never beat a hand-rolled ring buffer of fixed size that maintains cursors, but it will beat a hand-rolled linked-list implementation. The typical implementation wi
417.
by vitus 3y ago
> Actually not true - it’s mostly grocery store employees. I would not have guessed that -- Whole Foods's website indicates 105k+ employees. Am I missing a whole other order of magnitude? https://media.wholefoodsmarket.co
418.
by vitus 3y ago
I don't disagree with most of what you've written, but to set the record straight: > In my experience this is why Amazon employs nearly 2 million people and is hyperbolic in its growth over such a long time. Amazon employs mill
419.
by vitus 3y ago
The only logarithmic algorithm here is fib_closed_form because floating-point multiplication is a fixed-cost operation (and yields a progressively imprecise result, as other commenters have pointed out). The other approaches use arbitrary p
420.
by vitus 3y ago
ECC RAM is for the most part relegated to server-grade components, for what it's worth. So your phone, your laptop, your router? Almost certainly not using any ECC RAM, unless you've gone out of your way to do so.

More ›