c++ iterator 失效_c++迭代器失效的问题汇总（Summary of c++ iterator failures）.doc

c迭代器失效的问题汇总(Summaryofciteratorfailures)

c++迭代器失效的问题汇总(Summary of c++ iterator failures)

Summary of C++ iterator failures

First, for vector, adding and deleting operations can cause partial or full iterator invalidation of the container. So why does the iterator fail? The vector element is stored in memory, if the current container has 10 elements, now have to add an element to a container, but the memory behind these 10 elements have a free space, and vector elements must be stored sequentially while access by index, so we can't in memory just to find the element local storage. So vector must be re allocation of storage space, used to store the original elements and the newly added: stored in the storage space of the old elements are copied to the new storage space, then inserts a new element, finally cancelled the old storage space. This happens and must cause all iterators in the vector container to fail. We see how the implementation of the above mentioned allocation and cancellation of memory space achieves the self growth of vector, and the efficiency is extremely low. In order to make the vector container to achieve fast allocation, the actual distribution of the container will be more than the needed space, the vector container reserved this extra storage area for storing newly added elements, without the need for each re allocation of new storage space. You can do this from vector, and capacity and reserve members can see the mechanism. The difference between capacity and size: size is the number of elements that the container currently has, and capacity refers to the total number of elements that the container can store before it must allocate new storage space.

The failure of the vector iterator:

1. when an element is inserted (push_back), the iterator returned by the end operation is certainly invalid.

2. when an element is inserted (push_back), the capacity return value has changed before it has been inserted, and the entire container needs to be reloaded, when the iterator returned by the beg