It would indeed be better to create appropriately sized storage. However, I don't think that underlying array is resized every time `add` is called. I'd expect

It would indeed be better to create appropriately sized storage. However, I don't think that underlying array is resized every time `add` is called. I'd expect that resize will happen less than 30 times for 1M adds (capacity grows geometrically with a=10 and r=1.5)