After some thought, you can avoid so much reserve by just not having any reserve buckets (and thus no need for the header either). You can only resize once every O(sqrt n) operations and a resize costs O(n), so it&#x27;s amortized O(n &#x2F; sqrt n) = O(sqrt n) insertion. You can lower the constant factors a bit by doing occasional local reshuffling.<p>Not sure if it&#x27;s a great idea, but it&#x27;s tempting.