c++反向迭代器之.base()

1.问题来源：

在写质因数分解的时候，想着练一下容器。就有了这样的代码：

#include<iostream>
using namespace std;
#include<cmath>
#include<vector>

bool isPrime(int num)
{
	if (num <= 3)
	{
		return num > 1;  // 1不是  2,3是质数
	}
	else if (num % 6 != 1 && num % 6 != 5)
	{
		return false;
	}
	else
	{
		for (int i = 5; i <= sqrt(num); i += 6)
		{
			if (num % i == 0 || num % (i + 2) == 0)
			{
				return false;
			}
		}
		return true;
	}
}

int main()
{
	int num;
	cin >> num;

	vector<int>vInt;
	for (int i = 2; i <= num / 2; i++)
	{
		if (isPrime(i))
		{
			vInt.push_back(i);
		}
	}

	for (vector<int>::reverse_iterator  it = vInt.rbegin(); it != vInt.rend(); ++it)
	{
		for (vector<int>::iterator jt = vInt.begin(); jt != it.base(); ++jt)
		{
			if ((*it) * (*jt) == num)
			{
				cout << *it << endl;
			}
		}
	}

	system("pause");
	return 0;
}

---

在chat时我不是很理解下面的，反向迭代器的base()方法。

for (vector<int>::iterator jt = vInt.begin(); jt != it.base(); ++jt)

具体地，疑惑于下面：

---

2.测试：

#include<iostream>
using namespace std;
#include<cmath>
#include<vector>



int main()
{

	vector<int>vInt;
	for (int i = 1; i <= 9; i++)
	{
		vInt.push_back(i);
	}

	for (auto it : vInt)
	{
		cout << it << " ";
	}
	cout << endl;

	for (vector<int>::reverse_iterator it = vInt.rbegin(); it != vInt.rend(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;

	cout << "-----------------------------" << endl;

	vector<int>::reverse_iterator it_test = vInt.rbegin();
	it_test += 2;
	cout << "it " << *it_test << endl;
	cout << "it.base() " << *it_test.base() << endl;


	system("pause");
	return 0;
}

---

3.输出：

下面这里写的是对的：

for (vector<int>::reverse_iterator  it = vInt.rbegin(); it != vInt.rend(); ++it)
	{
		for (vector<int>::iterator jt = vInt.begin(); jt != it.base(); ++jt)