C / C++ / MFC

Mark Salsbery wrote:

For what it's worth

led mike wrote:

I'm trying to minimize the gratuitous sarcasm in the new year

Mark Salsbery
Microsoft MVP - Visual C++

Mark Salsbery wrote:

your malformed posts?

led mike wrote:

I haven't made a mistake since the Fair.

Mark Salsbery
Microsoft MVP - Visual C++

Mark Salsbery wrote:

what happened at what fair?

George_George wrote:

In what situation will sort throw exception?

Preconditions
(first, last) is a valid range.

template <class RandomAccessIterator>
void sort(RandomAccessIterator first, RandomAccessIterator last);

std::vector<T> v1; // has many data.
std::vector<S> v2; // has many data.
std::vector<T>::iterator p1 = ... ; // points to somewhere in v1.
std::vector<S>::iterator p2 = ... ; // points to somewhere in v2.
std::sort(p1, p2); // Orz ... 

George_George wrote:

In what situation will sort throw exception? I can not find a case

#include <vector>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;

class test
{
private:

	

public:
	int nValue;
	bool operator <(test obj)
	{
		int i= i/0;
		if(this->nValue<obj.nValue)
		{
			return(true);
		}
		else
		{
			return(false);
		}
	}
	

};

int main(int argc, char* argv[])
{
	printf("Hello World!\n");
	std::vector<test> vec_testObj;
	test testObjs[4];
	testObjs[0].nValue =5;
	testObjs[1].nValue =4;
	testObjs[2].nValue =3;
	testObjs[3].nValue =2;
	vec_testObj.push_back(testObjs[0]);
	vec_testObj.push_back(testObjs[1]);
	vec_testObj.push_back(testObjs[2]);
	vec_testObj.push_back(testObjs[3]);
	std::sort(vec_testObj.begin(),vec_testObj.end());
	vector<test>::iterator itr_vecTest = vec_testObj.begin();
	while(vec_testObj.end()!=itr_vecTest)
	{
		cout<<"\n"<<itr_vecTest->nValue;
		itr_vecTest++;
	}
	
	return 0;
}