遍历vector最简洁的方法是通过迭代器:

for (auto it = begin (vector); it != end (vector); ++it) {
    it->doSomething ();
}

或(相当于上述)

for (auto & element : vector) {
    element.doSomething ();
}

在c++ 0x之前，必须将auto替换为迭代器类型，并使用成员函数而不是全局函数begin和end。

This probably is what you have seen. Compared to the approach you mention, the advantage is that you do not heavily depend on the type of vector. If you change vector to a different "collection-type" class, your code will probably still work. You can, however, do something similar in Java as well. There is not much difference conceptually; C++, however, uses templates to implement this (as compared to generics in Java); hence the approach will work for all types for which begin and end functions are defined, even for non-class types such as static arrays. See here: How does the range-based for work for plain arrays?

如果你使用

std::vector<std::reference_wrapper<std::string>> names{ };

不要忘记，当你在for循环中使用auto时，也要使用get，就像这样:

for (auto element in : names)
{
    element.get()//do something
}

正确的做法是:

for(std::vector<T>::iterator it = v.begin(); it != v.end(); ++it) {
    it->doSomething();
 }

其中T是向量中类的类型。例如，如果类是CActivity，只需写CActivity而不是T。

这种类型的方法将适用于每个STL(不仅仅是向量，这是更好的一点)。

如果你仍然想使用索引，方法是:

for(std::vector<T>::size_type i = 0; i != v.size(); i++) {
    v[i].doSomething();
}

遍历vector最简洁的方法是通过迭代器:

for (auto it = begin (vector); it != end (vector); ++it) {
    it->doSomething ();
}

或(相当于上述)

for (auto & element : vector) {
    element.doSomething ();
}

在c++ 0x之前，必须将auto替换为迭代器类型，并使用成员函数而不是全局函数begin和end。

This probably is what you have seen. Compared to the approach you mention, the advantage is that you do not heavily depend on the type of vector. If you change vector to a different "collection-type" class, your code will probably still work. You can, however, do something similar in Java as well. There is not much difference conceptually; C++, however, uses templates to implement this (as compared to generics in Java); hence the approach will work for all types for which begin and end functions are defined, even for non-class types such as static arrays. See here: How does the range-based for work for plain arrays?

为什么你没有看到这样的实践是非常主观的，不能有一个明确的答案，因为我已经看到许多代码使用你提到的方式，而不是迭代器风格的代码。

以下可能是人们不考虑vector.size()循环方式的原因:

每次在循环中都要调用size() 条件。然而，这要么不是问题，要么是小事 固定 优先选择std::for_each()而不是for循环本身 稍后将容器从std::vector更改为其他容器(例如:std::vector)。 Map, list)也会要求改变循环机制， 因为不是每个容器都支持size()类型的循环

c++ 11提供了在容器间移动的良好工具。这被称为“基于范围的for循环”(或Java中的“增强for循环”)。

用很少的代码，你可以遍历完整的(强制的!)std::vector:

vector<int> vi;
...
for(int i : vi) 
  cout << "i = " << i << endl;

在STL中，程序员使用迭代器遍历容器，因为迭代器是一个抽象概念，在所有标准容器中实现。例如，std::list根本没有操作符[]。