BUG: The STL list::sort() Function Doesn't Sort a List of Pointers (265109)

MORE INFORMATION

//sort.cpp
//compiler options cl /GX sort.cpp
#include <iostream>
#include <algorithm>
#include <list>
using namespace std;

//#define WORKAROUND //Uncomment this line to work around the bug.

class CSort 
{
public:
    CSort(int i) : m_i(i) { }
    int m_i;
};

struct PrintElements 
{
   void operator()(CSort* pfi) const
   {
      cout << pfi->m_i << "\n";
   }
};

#ifdef WORKAROUND
template<>
struct std::greater<CSort*>  : public binary_function<CSort* ,CSort*, bool> 
{
    bool operator()(const CSort* &x, const CSort* &y) const
    { 
	return (x->m_i < y->m_i); 
    };
};
#endif

// User-defined predicate function for sorting.
struct lessThan : public greater<CSort*> 
{
    bool operator()(const CSort* &pfi1, const CSort* &pfi2) const
    { 
	return pfi1->m_i < pfi2->m_i; 
    }
};

void SortTest()
{
    list<CSort*> l3;
    l3.push_back(new CSort(11));
    l3.push_back(new CSort(01));
    l3.push_back(new CSort(21));
    l3.push_back(new CSort(14));
    l3.push_back(new CSort(41));
    list<CSort*>::iterator lfii = l3.begin();
    l3.sort(lessThan());
    for_each(l3.begin(), l3.end(), PrintElements());
    cout.flush();
}


int main(int argc, char* argv[])
{
    SortTest();
    return 0;
}