Sorting a STL Sequential Container of Pointers

Expertise: Intermediate
Language: C

January 26, 2004

Say you have a user structure and a container of pointers to that user structure. You need to sort the container based only on some structure's members. The solution is to define the structure's specific function objects less and greater and to pass to the sort algorithm the appropiate function object (less for ascending sorting and greater for descending sorting).

The following code example illustrates the solution for a vector container and a simple user structure sorted by the member m_i:


#include <iostream>
#include <vector>
#include <functional>
#include <algorithm>
using namespace std;
struct STest
{
STest(int i) : m_i(i) {}
int m_i;
};
namespace std
{
struct less<STest*>
{
bool operator()(STest const* p1, STest const* p2)
{
if(!p1)
return true;
if(!p2)
return false;
return p1->m_i < p2->m_i;
}
};
struct greater<STest*>
{
bool operator()(STest const* p1, STest const* p2)
{
if(!p1)
return false;
if(!p2)
return true;
return p1->m_i > p2->m_i;
}
};
};
int main()
{
vector<STest*> myvect;
myvect.push_back(new STest(11));
myvect.push_back(new STest(22));
myvect.push_back(new STest(13));
myvect.push_back(new STest(7));
myvect.push_back(new STest(15));
//Ascending Sorting
sort(myvect.begin(), myvect.end(), less<STest*>());
//Display
vector<STest*>::iterator it;
for(it=myvect.begin(); it!=myvect.end(); it++)
cout << (*it)->m_i << endl;
//Descending Sorting
sort(myvect.begin(), myvect.end(), greater<STest*>());
//Display
for(it=myvect.begin(); it!=myvect.end(); it++)
cout << (*it)->m_i &l;t< endl;
//Free allocated memory
for(it=myvect.begin(); it!=myvect.end(); it++)
delete *it;
}
return 0;
}

This solution can be applied to all the STL sequential containers, excepting the list container, for which only the greater function object can be implemented and instead of the sort algorithm the sort member function has to be applied.

It's quick, easy and you get access to all the articles on DevX.
This registration/login is to allow you to read articles on devx.com.
Already a member?

To become a member of DevX.com create your Member Profile by completing the form below.
Membership is free!

Already registered? Sign In

E-mail (User Name)

Create a Password

Re-enter Password

First Name

Last Name

Company

Company Size

Address

City

State/Province

Country

Postal Code/Zip

Job Function

Phone

Note: Extension number is optional, but may be included by adding an "x" before the extension number.

By registering you will also be signed up for the Enterprise Development Daily newsletter.
After registering you may choose to opt-out by clicking on the "Manage Profile" link.

Cancel

George Anescu

If you have a hot tip and we publish it, we'll pay you. However, due to accounting overhead we no longer pay $10 for a single tip submission. You must accumulate 10 acceptable tips to receive payment. Be sure to include a clear explanation of what the technique does and why it's useful. If it includes code, limit it to 20 lines if possible. Submit your tip here.

DevX: C++ Zone

Browse "C++" Tips

Browse All Tips