Since the cpu always accesses a full cache line (64 bytes) at a time, you might as well search the entire cache line (it’s practically free once the data is on-cpu). So I’d like to try a ‘binary’ search that tests all the values in the ‘middle cache line’ and then chooses to go left or right if none match. You can do the cache line search as a single 512bit simd instruction. A cache line is 64 bytes (or 32 16-bit integers); such a search might well be almost 32 times faster than simple binary search; at least it’ll do 32x less memory accesses, which will dominate in most realistic programs.
I’m surprised how many places in the world measure rain in percentage chance. Must be a metropolitan concept. Here in Denmark, weather reports estimate mm/hr - the amount of rain. Maybe it’s our agricultural inheritance?
“Any sufficiently complicated concurrent program in another language contains an ad hoc informally-specified bug-ridden slow implementation of half of Erlang.” – Virding’s first rule of programming
Interesting. When you give a third-party access to your GitHub repositories, you also have to trust that the third-party implements all of GitHub’s security policies. This must be very hard to actually assume.
Unfortunately that’s the case because large US-based companies can leverage their existing global sales / marketing / governance setup to rationalize very high exit valuations. In the EU we don’t have the large software shops that can do that. So for an EU based startup - it’s exit to a US-based company or go all the way to an IPO / profitability.