Sample of STL(Vector)：begin and rbegin_‘rbegin’ was not declared-优快云博客

本文通过一个C++程序示例介绍了如何使用标准库中的`sort`函数对`vector`容器进行排序，并展示了正向迭代器与反向迭代器的应用。此外，还解释了排序操作如何不影响容器内部元素的实际存储位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream> #include <iomanip> #include <vector> #include <string> #include <algorithm> #include <iterator> using namespace std; class ID { friend bool operator < ( const ID&, const ID& ); public: ID(string name,int score) : name(name), score(score) {} void display () { cout.setf(ios::left); cout << setw(3) << score << name << endl; } private: string name; int score; }; //----------------------------------------------------- // comperation function for sorting bool operator < ( const ID& a, const ID& b ) { return a.score < b.score; } //----------------------------------------------------- typedef vector<ID> Vector; // new name for existing datatype int main () { Vector v; Vector::iterator Iter; v.push_back(ID("Smith A",96)); v.push_back(ID("Amstrong B.",91)); v.push_back(ID("Watson D.",82)); for ( Iter = v.begin(); Iter != v.end(); Iter++ ) Iter->display(); sort(v.begin(),v.end()); // sort algorithm cout << endl << "Sorted by Score" << endl; cout << "===============" << endl; for ( Iter = v.begin(); Iter != v.end(); Iter++ ) Iter->display(); cout << endl << "Reverse output" << endl; cout << "===============" << endl; Vector::reverse_iterator r = v.rbegin(); while ( r != v.rend() ) (r++)->display(); cout << endl; return 0; } //OUTPUT: // 96 Smith A. // 91 Amstrong B. // 82 Watson D. // // Sorted by Score // =============== // 82 Watson D. // 91 Amstrong B. // 96 Smith A. // // Reverse output // =============== // 96 Smith A. // 91 Amstrong B. // 82 Watson D.

由上述可知vecotr的rbegin是实际存储顺序的开始，而begin是实际的容器元素顺序，由此可见对vector进行排序并没有实际的改变存储位置。

转自：http://hi.baidu.com/ycdoit/blog/item/bf2afc02dff8a2fe09fa93e1.html