迭代器无效的规则 [英] Rules for Iterator Invalidation

问题描述

当操作STL容器类（向量，出队，列表，地图，多图，集合，多集）时，Iterator无效的通常规则是什么。是否可以对C ++ STL程序员在使用容器及其迭代器时必须注意的一些一般规则/准则进行分类和总结？

What are the usual rules for Iterator invalidation when operating over STL container classes(Vector,Dequeue,list,map,multimap,set,multiset). Is it possible to categorize and sum up some general rules/guidelines that a C++ STL programmer must be aware of while working with containers and their Iterators?

推荐答案

这些规则是特定于容器的。实际上，这些是决定您使用哪个容器的重要标准。

These rules are container specific. In fact, these are important criteria for deciding which container you use.

例如，迭代器到 std :: vector 可以在插入对象时被取消（取决于对象插入的位置和重新分配的位置），并且当在迭代器之前删除对象时，它们会失效。 std :: list 没有这个问题。插入和删除对象（迭代器指向的对象除外）不会使迭代器无效。

For instance, iterators to an std::vector can get invalidated when an object is inserted (depends in where the object is inserted and if reallocation takes place), and they get invalidated when an object is removed before the iterator. An std::list does not have this problem. Inserting and removing objects (except for the object the iterator points to) does not invalidate the iterator.

SGI提供了良好的文档。

SGI provides good documentation on this.

这篇关于迭代器无效的规则的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！