468 karma · joined July 14, 2014
I've lately started to email companies asking random questions like that one. I find more often than not small companies take the time to reply. In this case I imagine someone in the company went beyond the minimum requirements of the product to make sure it had a song, so they're probably at least mildly passionate about the product and the song and would happily write a few sentences about it.
Simplest to implement is to just wrap a hash table and insert time checks in the accessors.
The hash function was poorly chosen which had the effect that if you found a tile where you gained a skill point, there was a good chance the tile 8 steps to your North would let you gain another skill point.
So the algorithm became: 1. Run boat continuously trying the skill over and over 2. Stop when there is a skill gain 3. Move boat 8 steps north 4. Do skill again 5. Gain? Go to 3 6. Otherwise, go to 1
There is suspicious clustering in the plot, at complexity slightly lower and higher than -1. Complexity -1 is also more sparse than seems reasonable from the shape/density of the cloud.
Surely if you're still using C now it's for legacy reasons. And if using it for legacy reasons you are likely stuck using an old C standard.
So who will use C23?
But it makes the whole thing more complicated with parameters that need tuning, and no longer the simple and powerful things that bloom filters are sold as.