首页 > 其他 > 详细

reverse iterator

时间:2014-09-11 18:56:12      阅读:228      评论:0      收藏:0      [点我收藏+]

bubuko.com,布布扣

Problem 1:

vector<int> coll = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };

vector<int>::const_iterator pos = find (coll.cbegin(), coll.cend(),5);

cout << "pos: " << *pos << endl;

vector<int>::const_reverse_iterator rpos(pos);

cout << "rpos: " << *rpos << endl;

This program has the following output:

pos: 5

rpos: 4

Same position but its value is changed; this can use the pos in the diagram to illustrate it.

bubuko.com,布布扣

Problem 2:

deque<int> coll = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };

deque<int>::const_iterator pos1;

pos1 = find (coll.cbegin(), coll.cend(), 2); // value

deque<int>::const_iterator pos2;

pos2 = find (coll.cbegin(), coll.cend(), 7); // value

for_each (pos1, pos2, print); // operation

deque<int>::const_reverse_iterator rpos1(pos1);

deque<int>::const_reverse_iterator rpos2(pos2);

for_each (rpos2, rpos1, print); // operation

The program is as follows:

2 3 4 5 6

6 5 4 3 2

It seems the behavior of the problem 2 is not same with problem 1.

This can use the pos1, pos2 in the diagram to illustrate it.

reverse iterator

原文:http://www.cnblogs.com/Cmpl/p/3966886.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!