C / C++ / MFC

ThatsAlok wrote:

Where are you getting problem

Taka Muraoka wrote:

Sounds like somewhere between firing up his IDE and typing void main() { }

"Opinions are neither right nor wrong. I cannot change your opinion. I can, however, change what influences your opinion." - David Crow

"Opinions are neither right nor wrong. I cannot change your opinion. I can, however, change what influences your opinion." - David Crow

<br />
int CFindUserDlg::GetPosByNick(CString szNick)<br />
{<br />
..<br />
}

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

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

sort void sort();<br />
Sorts the list elements in ascending order. The comparison operator < ("less than") must be defined for the list element type. Note that the STL sort algorithm does NOT work for lists; that's why a sort member function is supplied.<br />
  nums.sort(); <br />

Harold_Wishes wrote:

This program for the first link is not compiling...

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

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

#include <list>
#include <string>
#include <iostream>
#include <algorithm>

using namespace std;

class MyData
{
public:
  int m_iData;
  string m_strSomeOtherData;
};

bool MyDataSortPredicate(const MyData& lhs, const MyData& rhs)
{
  return lhs.m_iData < rhs.m_iData;
}

int main()
{
  // Create list
  list mylist;

  // Add data to the list
  MyData data;
  data.m_iData = 3;
  mylist.push_back(data);
  data.m_iData = 1;
  mylist.push_back(data);

  // Sort the list using predicate
  mylist.sort(MyDataSortPredicate);

  // Dump the list to check the result
  for (list::const_iterator citer = mylist.begin();
     citer != mylist.end(); ++citer)
  {
    cout << (*citer).m_iData << endl;
  }

  return 0;
}

#include <list>
#include <string>
#include <iostream>
#include <algorithm>

using namespace std;

class MyData
{
public:
  int m_iData;
  string m_strSomeOtherData;
};

bool MyDataSortPredicate(const MyData& lhs, const MyData& rhs)
{
  return lhs.m_iData < rhs.m_iData;
}

int main()
{
  // Create list
  list<MyData> mylist;

  // Add data to the list
  MyData data;
  data.m_iData = 3;
  mylist.push_back(data);
  data.m_iData = 1;
  mylist.push_back(data);

  // Sort the list using predicate
  mylist.sort(MyDataSortPredicate);

  // Dump the list to check the result
  for (list::const_iterator citer = mylist.begin();
     citer != mylist.end(); ++citer)
  {
    cout << (*citer).m_iData << endl;
  }

  return 0;
}