Mastodon Feed
dysfun@treehouse.systems ("gaytabase") wrote:
there is a variant of HOT node key material picking that i came up with a while back. the original paper has two modes:
- pick 8 consecutive bytes
- pick 1 byte, n times
the former only works if you're in a dense region of the tree and you have to fall back to the latter otherwise. this of course is all branchy.
we could eliminate the branch if we instead picked 8 bytes every time and then only kept some of them, according to a bitmask. left packing those bytes, if you will. in the fast case, it only runs one iteration.