> The indexing also seems dependent on division. As long as the number of slots in a bucket is a power of two division reduces to right shift (I have no idea w

> The indexing also seems dependent on division. As long as the number of slots in a bucket is a power of two division reduces to right shift (I have no idea what std::deque does though). One of the advantages of not growing exponentially is that you can use a deque the way you would a ring buffer without it attempting to eat the entire address space.