Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ot
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
32 ms
·
391.
▲
by
ot
6y ago
I meant to write "safer" but the "r" fell through :)
392.
▲
by
ot
6y ago
It could be made safe by making to_string_t a template and forwarding from_string's argument into its storage, if things are not complicated enough already :) Something like this template <class String> struct to_string
393.
▲
by
ot
6y ago
Yeah, this is something that might have made sense before auto, and in fact IIRC there were some Boost libraries that used this trick (Boost.Assign?), but it's just unnecessary complication at this point.
394.
▲
Behind Twitter’s biased AI cropping and how to fix it
(medium.com)
2 points
by
ot
6y ago
|
0 comments
395.
▲
Efficient Integer Overflow Checking in LLVM (2016)
(blog.regehr.org)
84 points
by
ot
6y ago
|
22 comments
396.
▲
by
ot
6y ago
This blog post has a much more in-depth analysis of the cost of overflow checking: https://blog.regehr.org/archives/1384 The tl;dr is that (on x86-64) the additional branch to trap has almost negligible cost (processor
397.
▲
Google offers first part of its in-house M:N thread code as open source to Linux
(theregister.com)
2 points
by
ot
6y ago
|
0 comments
398.
▲
Deep Retrieval: A Learnable Structure Model for Large-Scale Recommendations
(arxiv.org)
1 points
by
ot
6y ago
|
0 comments
399.
▲
by
ot
6y ago
When analyzing complexity, "n" is conventionally the input size. For arithmetic operations it would be the number of digits, not the number itself.
400.
▲
by
ot
6y ago
I'm not sure what the point of this post is. It says > And yet at every point in history, there were true things that would get you in terrible trouble to say. Is ours the first where this isn't so? What an amazing coincidence
401.
▲
by
ot
6y ago
"Attention is all you need"
402.
▲
Twins: White-Glove Approach for BFT Testing
(arxiv.org)
1 points
by
ot
6y ago
|
0 comments
403.
▲
by
ot
7y ago
The machine can only do one test at a time, so throughput = 1 / latency.
404.
▲
Firefox's low-latency WebAssembly compiler
(wingolog.org)
8 points
by
ot
7y ago
|
0 comments
405.
▲
Tech vs. Covid-19
(stop-covid.tech)
2 points
by
ot
7y ago
|
0 comments
406.
▲
by
ot
7y ago
> I often end up wrapping class members in std::optional to arrange for one That's not going to help you unless you explicitly unset the optional in your move constructor. std::optional's move constructor doesn't unset the
407.
▲
by
ot
7y ago
Yes there is some concern that it would affect code size and/or make some optimizations impossible, but on the latter I have yet to see hard data that that is the case. We're talking about adding about 1-2 cycles of latency. Note
408.
▲
by
ot
7y ago
Also see https://www.nytimes.com/2006/10/15/arts/15morr.html
409.
▲
Is Parallel Programming Hard, and, If So, What Can You Do About It?
(arxiv.org)
3 points
by
ot
7y ago
|
0 comments
410.
▲
by
ot
7y ago
"The Axiom of Choice is obviously true, the Well–ordering theorem is obviously false; and who can tell about Zorn’s Lemma?"
411.
▲
Writing BPF Code in Rust
(blog.redsift.com)
2 points
by
ot
7y ago
|
0 comments
412.
▲
by
ot
7y ago
> RCU in userland is not portable Portable implementations are possible by using thread-local integers. There's one in Folly for example.
413.
▲
Optimizations in C++ Compilers
(queue.acm.org)
6 points
by
ot
7y ago
|
0 comments
414.
▲
by
ot
7y ago
> I want the equivalent of atomic<shared_ptr<T>>, but lock-free. You can do that without transactions with a lock cmpxchg16b instruction, or with a more complicated algorithm like this: https://github.com/face
415.
▲
Oculus Insight – AI Slam-Based Position Tracking
(ai.facebook.com)
1 points
by
ot
7y ago
|
0 comments
416.
▲
Sushi Roll: A CPU kernel for cycle-by-cycle micro-architectural introspection
(gamozolabs.github.io)
53 points
by
ot
7y ago
|
1 comments
417.
▲
Scheele’s Green, the Color of Fake Foliage and Death (2018)
(theparisreview.org)
18 points
by
ot
7y ago
|
4 comments
418.
▲
by
ot
7y ago
It looks like a Fresnel lens taken to the limit.
419.
▲
by
ot
7y ago
I wonder if they have considered implementing futexes in userland so they don't have to wait for the kernel implementing this. WebKit has its own implementation (see the ParkingLot in https://webkit.org/blog/6161&#
420.
▲
Scaling Static Analyses at Facebook
(cacm.acm.org)
2 points
by
ot
7y ago
|
0 comments
More ›