C / C++ / MFC

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;
}

 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;
 }*/

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

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

Harold_Wishes wrote:

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

// declared somewhere
void printData(const MyData& data)
{
	cout << data.m_iData << endl;
}

// use instead of loop
for_each(myList.begin(), myList.end(), printData);

C:\Documents and Settings\WoodallH\Desktop\C++\Project 6 Nesty tag\Sort.cpp(38) : error C2664: 'void __thiscall std::list<class MyData,class std::allocator<class MyData> >::sort(struct std::greater<class MyData>)' : cannot convert parameter 1 from '
bool (const class MyData &,const class MyData &)' to 'struct std::greater<class MyData>'
        No constructor could take the source type, or constructor overload resolution was ambiguous
Error executing cl.exe.

struct std::less<MyData>
{
	bool operator()(const MyData& lhs, const MyData& rhs)
	{
		return lhs.m_iData < rhs.m_iData;
	}
};

void main( void )
{
    // Create list
    list<MyData> mylist;
    ...
    for (list<MyData>::const_iterator citer = mylist.begin();
}

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

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

FarPointer wrote:

and that horizontal slash in prev post.

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

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

struct data
{
    string Length;
    string Sequence; 
    string N_Terminal;
    string C_Terminal;
 
    friend bool operator<(const data &L, const data &R)
    {
       // In this example I'm only sorting by 'Sequence'
       return L.Sequence<R.Sequence;
    }
};
 
// Now you can sort like this.
g_DataList.sort();