Sorting a list of a custom type

by

You can specify a custom sort predicate. In C++11 this is best done with a lambda:

typedef std::pair<int, int> ipair;
std::list<ipair> thelist;

thelist.sort([](const ipair & a, const ipair & b) { return a.first < b.first; });

In older versions of C++ you have to write an appropriate function:

bool compFirst(const ipair & a, const ipair & b) { return a.first < b.first; }

thelist.sort(compFirst);

(Instead if ipair you can of course have your own data structure; just modify the comparison function accordingly to access the relevant data member.)

Finally, if this makes sense, you can also equip your custom class with an operator<. That allows you to use the class freely in any ordered context, but be sure to understand the consequences of that.

More Related Contents:

  1. In which scenario do I use a particular STL container?
  2. What are the complexity guarantees of the standard containers?
  3. How do I sort a std::vector by the values of a different std::vector?
  4. problem sorting using member function as comparator
  5. Why can’t we declare a std::vector?
  6. Determine if a type is an STL container at compile time
  7. How to initialize std::vector from C-style array?
  8. string c_str() vs. data()
  9. std::transform() and toupper(), no matching function
  10. stl::multimap – how do i get groups of data?
  11. Case insensitive std::string.find()
  12. Does std::list::remove method call destructor of each removed element?
  13. Should I store entire objects, or pointers to objects in containers?
  14. What is the preferred/idiomatic way to insert into a map?
  15. Custom Iterator in C++
  16. I want to convert std::string into a const wchar_t *
  17. what is the best modern c++ approach to construct and manipulate a 2d array [closed]
  18. How do you copy the contents of an array to a std::vector in C++ without looping?
  19. How to read and write a STL C++ string?
  20. What is the meaning of numeric_limits::digits10
  21. Why would I prefer using vector to deque
  22. What the heque is going on with the memory overhead of std::deque?
  23. Thread safety of std::map for read-only operations
  24. std::vector removing elements which fulfill some conditions
  25. How can std::make_heap be implemented while making at most 3N comparisons?
  26. What is the right approach when using STL container for median calculation?
  27. Why is a C++ Vector called a Vector? [closed]
  28. Types of iterator : Output vs. Input vs. Forward vs. Random Access Iterator
  29. C++ STL: Array vs Vector: Raw element accessing performance
  30. stl container with std::unique_ptr’s vs boost::ptr_container

Leave a Comment