C++迭代器失效的问题汇总(国外英语资料).docVIP

C++迭代器失效的问题汇总(国外英语资料) Summary of the problem of the c + + iterator failure First, for vector, adding and removing operations may invalidate portions of the container or all of the iterators. So why does the iterator fail? Vector elements in memory is stored in order, just think: if the container has been around for 10 elements, and now want to add an element to the container, but follow closely behind the ten elements in memory without a free space, and vector elements index access must be stored in order, so we cant casually find a place to store the elements in memory. So the vector must to allocate storage space, used to store the original elements and the newly added elements: stored in a storage space than the old one element to be copied to the new storage space, and then insert a new element, finally cancel the old storage space. This happens, and it is certain that all the iterators of the vector container will fail. We see the way in which the allocation and revocation of memory space is implemented to achieve the self-growth of the vector, and the efficiency is extremely low. Achieve rapid memory allocation, in order to make the vector container actual allocation of the container, would be more than the space required for the current vector reserved these extra storage container, used to store the newly added elements, without the need for redistribution every time a new storage space. You can see this mechanism by implementing the capacity and reserve members in vector. The difference between capacity and size: size is the number of elements that the container currently has, and capacity is the total number of elements that the container can store before it has to allocate new storage space. The failure of the vector iterator: When an element is inserted (push_back), the iterator returned by the end operation must be invalidated. 2. After the insert an element (push_back), capacity return values compared with no insert element before have changed, you nee