Based on the last two convos I saw on this, I feel like there’s a simpler algorithm here waiting to break out. Underneath this is a sort of b-tree scented data

Based on the last two convos I saw on this, I feel like there’s a simpler algorithm here waiting to break out. Underneath this is a sort of b-tree scented data structure that avoids the bimodal distribution on insertion times, which is important for a concurrent hash table.