Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
superdimwit
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
superdimwit
2y ago
Thanks!
2.
▲
by
superdimwit
2y ago
Clang recently got a new calling convention that makes these tail calls much cheaper (avoids the need for the caller to preserve some registers). I can never remember the name - it’s either preserve_all or preserve_none (whose perspective i
3.
▲
by
superdimwit
3y ago
https://eli.thegreenplace.net/2012/07/12/computed-goto-for-e... is a good summary
4.
▲
by
superdimwit
3y ago
On 1: this small amount of overhead matters because the amount of work you do on each opcode can be tiny. The extra jump could be 20% of your runtime! On 2: yes, this helps the indirect branch target predictor. In a real program you’ll oft
5.
▲
by
superdimwit
3y ago
Try dear-imgui + implot. There are Python bindings
6.
▲
Show HN: A site for competitive performance programming and micro-optimisation
(highload.fun)
3 points
by
superdimwit
4y ago
|
0 comments
7.
▲
by
superdimwit
4y ago
There’s a Hello World on the page
8.
▲
by
superdimwit
4y ago
30 years?
9.
▲
by
superdimwit
4y ago
Agreed, autovec is in my experience where clang really shines.
10.
▲
by
superdimwit
4y ago
Disappointed this wasn't an article about bath houses
11.
▲
by
superdimwit
4y ago
One nice property is their stable addressing. A linked list element won't move once allocated.
12.
▲
by
superdimwit
5y ago
Amsterdam is good for options market making, most of the techniques in this book come up a lot in trading
13.
▲
by
superdimwit
5y ago
reinterpret_cast comes up a lot when handling binary protocols - e.g. reading a message struct off a buffer / packet. How would this be handled in Rust or otherwise without copying the data?
14.
▲
by
superdimwit
5y ago
You can just define a generic fallback method like `eff(p, d1, d2) = eff(p, d2, d1)`
15.
▲
by
superdimwit
5y ago
Could a difference in alignment of the hot loop also have an effect here?
16.
▲
by
superdimwit
5y ago
QR, Cholesky
17.
▲
by
superdimwit
5y ago
I most often need to restart the REPL when redefining structs.
18.
▲
by
superdimwit
5y ago
If they don't, and can't demonstrate that they're doing something else useful with that money, investors get angry and fire the board.
19.
▲
by
superdimwit
5y ago
I am hopeful that Julia should be able to get this cross-session caching of compiled code. Would make restarting the REPL (to e.g. add a field to a struct) much less frustrating.
20.
▲
by
superdimwit
5y ago
even better, don't leave it as a comment. Leave it uncommented, as a syntax error, so when you try and run your code on Monday morning you are reminded of it!
21.
▲
by
superdimwit
5y ago
Big if/else lists will often get compiled into a jump table anyway.
22.
▲
by
superdimwit
5y ago
Go Channels?
23.
▲
by
superdimwit
5y ago
ARKK is far from passive
24.
▲
by
superdimwit
5y ago
A low-latency GC would also be great. But again, the JVM only has that due to many millions of dollars spent over decades.
25.
▲
by
superdimwit
5y ago
In your experience, what are the current limitations?
26.
▲
by
superdimwit
6y ago
Who writes the third party library, though?
27.
▲
by
superdimwit
6y ago
It does look like the benchmarks include compilation time.
28.
▲
by
superdimwit
6y ago
You can memory map Arrow
29.
▲
by
superdimwit
6y ago
or a husband?
30.
▲
by
superdimwit
6y ago
Exactly, and I don't see how it would work any less well in a to café than VScode remote SSH.
More ›