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

下载本文档

126
0
约1.52万字
约 16页
2017-07-28 发布于河南
举报
版权申诉

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

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

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 cant 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 begi