The bucket count of a will be at least n . All iterators pointing to element in a will remain valid. Hash Function and Key Equal are amortized constant time. Worst case is linear in the size of the container. Erase Element is amortized constant time.
Worse case is linear in the size of the container.
Average complexity for Find is constant time. Worst case is linear in the size of the container. Worst case is linear in the size of the container. Worst case is linear in the size of the container. Bucket Count is amortized constant time.