C / C++ / MFC

std::vector<CMyType> vec;
std::sort(vec.begin(), vec.end());

break; wrote:

sort(vec.begin(), &vec[vec.size()]);

<br />
class CVector<br />
{<br />
public:<br />
CString csName;<br />
CString csLastName;<br />
UINT iIndex;<br />
}<br />
// this two functions are global :confused:<br />
bool operator==(const CVector& x, const CVector& y)<br />
{<br />
	return (x.csUrl == y.csUrl) && (x.iIndex == y.iIndex);<br />
}<br />
<br />
// IDs will be sorted by Score, not by Name.<br />
bool operator<(const CVector& x, const CVector& y)<br />
{<br />
	return x.iIndex < y.iIndex;<br />
}<br />

class CVector
{
public:
	CString csIndex;
	CString csUrl;
	UINT iIndex;  

	CVector(int i, char *a, char *b)
	{
		iIndex = i;
		csIndex = a;
		csUrl = b;
	}
};

// this two functions are global
bool operator==(const CVector& x, const CVector& y)
{
	return (x.csUrl == y.csUrl) && (x.iIndex == y.iIndex);
}

// IDs will be sorted by Score, not by Name.
bool operator<(const CVector& x, const CVector& y)
{
	return x.iIndex < y.iIndex;
}
  
  
.... main
  
  
	// Global definition:
	typedef vector < CVector > VectorGlobal;
	VectorGlobal vec;
	
	// in function:
	// in an iteration i fill the vec with data
	// example while!
	int int_value = 0;
	while(int_value < 10)
	{
		char a[2];
		a[0] = 'a' + (rand() % 26);
		char b[2];
		b[0]= 'A' + (rand() % 26);
		a[1]=b[1]=0;
		vec.push_back(CVector(rand() % 40, a, b));
		int_value++;
	}
	
	// after this i call the sort-function and check if any data stored in vec:
	VectorGlobal::iterator iter;
	
	for(iter = vec.begin(); iter != vec.end(); iter++)
	{
		TRACE("CSindex: %s, Url: %s   Idx: %d\n", iter->csIndex, iter->csUrl, iter->iIndex);
	}
	sort(vec.begin(), vec.end());
	
	for(iter = vec.begin(); iter != vec.end(); iter++)
	{
		TRACE("CSindex: %s, Url: %s   Idx: %d\n", iter->csIndex, iter->csUrl, iter->iIndex);
	}
	// here is end of fill data in an vector, no debugger errors!

class CVector<br />
{<br />
	// whatever you want here<br />
	bool operator< (const CVector& that)<br />
	{<br />
		// replace with whatever you need to<br />
		// sort this object by<br />
		return this.data < that.data;<br />
	}<br />
};<br />
<br />
typedef vector<CVector> VectorGlobal;<br />
VectorGlobal vec;<br />
<br />
// fill your vector<br />
while(int_value < 10)<br />
{<br />
	// assume you have a proper constructor for this<br />
	vec.push_back(CVector(int_value, cstring_value,	cstring_value));<br />
}<br />
<br />
// used to print your data<br />
void print(const CVector& v)<br />
{<br />
	TRACE(L"CSindex: %s, Url: %s\n", v.csIndex, v.csUrl);<br />
}<br />
<br />
for_each(vec.begin(), vec.end(), print);<br />
sort(vec.begin(), vec.end());<br />
for_each(vec.begin(), vec.end(), print);

<br />
class CVector//:public CResultObject<br />
{<br />
public:<br />
	CString csName;<br />
	CString csIndex;<br />
	UINT iIndex;<br />
public:<br />
	<br />
	CVector()<br />
	{<br />
		//CResultObject();<br />
<br />
		csIndex = L"";<br />
		csName = L"";	<br />
		iIndex = 0;<br />
	}<br />
	CVector(UINT index,CString csindex, CString csname,...)<br />
	{<br />
		iIndex = index;<br />
		csIndex = csindex;<br />
		csName= csname;<br />
	}	<br />
<br />
<br />
	bool operator==(const CVector& y)<br />
	{<br />
		<br />
		return (csUrl == y.csUrl) && (iIndex == y.iIndex);<br />
	}<br />
<br />
	<br />
	bool operator<(const CVector& y)<br />
	{<br />
		return iIndex < y.iIndex;<br />
	}<br />
<br />
};<br />

std::sort(vec.begin(), vec.end(), CompareFunction(vec));

ArtiGujare wrote:

Also please note that I read the whole file into a memory buffer...

"The largest fire starts but with the smallest spark." - David Crow

"Judge not by the eye but by the heart." - Native American Proverb

"The largest fire starts but with the smallest spark." - David Crow

"Judge not by the eye but by the heart." - Native American Proverb

George_George wrote:

I can not find detailed descriptions from MSDN.

"The largest fire starts but with the smallest spark." - David Crow

"Judge not by the eye but by the heart." - Native American Proverb