superdimwit

Thanks!

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 is the preservation from?).

https://eli.thegreenplace.net/2012/07/12/computed-goto-for-e...

is a good summary

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 often get repeated sequences of opcodes (increment, then compare) that can be predicted. These branch predictors can be pattern based.

Try dear-imgui + implot. There are Python bindings

There’s a Hello World on the page

30 years?

Agreed, autovec is in my experience where clang really shines.

Disappointed this wasn't an article about bath houses

One nice property is their stable addressing. A linked list element won't move once allocated.

Amsterdam is good for options market making, most of the techniques in this book come up a lot in trading

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?

You can just define a generic fallback method like `eff(p, d1, d2) = eff(p, d2, d1)`

Could a difference in alignment of the hot loop also have an effect here?

QR, Cholesky

I most often need to restart the REPL when redefining structs.

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.

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.

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!

Big if/else lists will often get compiled into a jump table anyway.

Go Channels?

ARKK is far from passive

A low-latency GC would also be great. But again, the JVM only has that due to many millions of dollars spent over decades.

In your experience, what are the current limitations?

Who writes the third party library, though?

It does look like the benchmarks include compilation time.

You can memory map Arrow

or a husband?

Exactly, and I don't see how it would work any less well in a to café than VScode remote SSH.

It's also the name of a very popular french furniture chain