Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
hendzen
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
41 ms
·
391.
▲
by
hendzen
10y ago
FYI, much of ARM is held via ADRs (American Depositary Receipts) denominated in USD. This is how ARM shares trade on NASDAQ (under the ticker ARMH) in addition to trading on LSE.
392.
▲
by
hendzen
10y ago
Hardware transactions as implemented by TSX are not wait free. There is no guarantee that any TSX transaction will ever commit, so you need a non-transactional fallback path to guarantee forward progress.
393.
▲
by
hendzen
10y ago
"Our main source of revenue is off the toolbars we push out, which isn't a great source of monetization, but it's something. You can do the math on how many installs we have and what the monetization of toolbars is, and subtr
394.
▲
by
hendzen
10y ago
jq with less/more as pagers...
395.
▲
by
hendzen
10y ago
The ultimate guide on writing shared libraries, ABI compatibility, etc, is this document written by Ulrich Drepper: https://www.akkadia.org/drepper/dsohowto.pdf
396.
▲
by
hendzen
10y ago
in practice you will bind a single core to each NIC and then run a single polling thread for each networking core that runs with rtprio enabled.
397.
▲
by
hendzen
10y ago
sure, that saves you from dumping TLB state - but you still need to save register state, copy data from a user supplied buffer in to a kernel-owned device-mapped buffer - wiping L1 data and instruction caches in the process. For 99% of use
398.
▲
by
hendzen
10y ago
Sure, check out git-subtree (different than submodule).
399.
▲
by
hendzen
10y ago
There is an obscure pitfall of making a class noncopyable by making the copy constructor private. Consider the following class: class X { private: X& (const X&); // not defined public: X bar() {
400.
▲
IEX [Flash Boys Exchange] – The Good, the Bad, and the Ugly
(meanderful.blogspot.com)
1 points
by
hendzen
10y ago
|
0 comments
401.
▲
by
hendzen
10y ago
I don't think Palantir should be shamed for this. It's laudable that they invested in penetration testing - better they find out this way than by an actual APT/hacking group.
402.
▲
by
hendzen
10y ago
Here are some newer numbers: http://www.mckay-brothers.com/wp-content/uploads/2016/06/201... CME -> NY4 latency is now slightly higher than that allowed by the speed of light.
403.
▲
by
hendzen
10y ago
This is very interesting. It seems like a much more user-friendly version of TLA+. Wonder what Lamport thinks about it :) I think the next logical feature would be to have Runway compile a model-checked specification to an actual C++/J
404.
▲
by
hendzen
10y ago
If you can actually reliably generate alpha from a model like this there is no point of running the strategy yourself. There are any number of hedge funds that will sign you on, let you keep all of the IP you develop, and give you 10-12% of
405.
▲
by
hendzen
10y ago
Actually, if this lack of index update isolation is correct, you can get the matching document zero, one or multiple times !
406.
▲
by
hendzen
10y ago
There has been a technique (the 'unity build') that approximates a poor-man's LTO for a long time. Basically you #include all your cpp files in to a giant translation unit and then compile it :)
407.
▲
by
hendzen
10y ago
Not if their company provides free food/beer.
408.
▲
by
hendzen
10y ago
I usually prefer median absolute deviation on real world data. It's more robust than either SD or mean absolute deviation.
409.
▲
by
hendzen
10y ago
yeah - the C++ bits were clearly written by someone who doesn't know the language well. I'd be careful about using this code in production. EDIT: Specifically I'm referring to the usage of raw pointers, unchecked pointer arit
410.
▲
by
hendzen
10y ago
Thw complexity and overheead of PIMPL is justified in one scenario, and one scenario only - when you are writing a shared library and need to maintain a stable ABI. Otherwise it is complete overkill.
411.
▲
by
hendzen
10y ago
FPGAs
412.
▲
by
hendzen
10y ago
Not milliseconds. Nanoseconds. Competitive tick-to-trade times are on the order of 1000ns or less.
413.
▲
by
hendzen
10y ago
So that's why the NSA has a whole suite of confidential ciphers? https://en.wikipedia.org/wiki/NSA_Suite_A_Cryptography
414.
▲
by
hendzen
10y ago
http://en.cppreference.com/w/cpp/language/fold
415.
▲
by
hendzen
10y ago
That snippet depends on fold expressions, which are in c++17. AFAIK, capturing a variadic parameter pack should work in C++11.
416.
▲
by
hendzen
10y ago
Another mildly obscure feature of lambdas is the ability to capture a variadic number of parameters. Example (slightly contrived): #include <future> #include <iostream> template<typename... Args> void log(Args&a
417.
▲
by
hendzen
10y ago
What if you want to move some things, but copy others? e.g. auto shared = std::make_shared<MySharedType>(...); auto unique = std::make_unique<MyOwnedType>(...); function_that_accepts_lambda([shared, u = std::move(unique
418.
▲
by
hendzen
10y ago
How would you do the equivalent of this in Rust? auto on_heap = std::make_unique<MyType>(...); function_that_accepts_lambda([obj = std::move(on_heap)]() { obj->bar(...); })
419.
▲
by
hendzen
10y ago
How is it ugly? The capture list is a necessary complexity in a language with manual memory management.
420.
▲
by
hendzen
10y ago
Yes, I work in a template heavy C++ codebase and the (already quite good) situation is getting better with each language standard. C++11 was really a turning point for the language - features like 'auto', lambdas, and variadic tem
More ›