How to use std::sort with a vector of structures and compare function?

by

std::sort takes a different compare function from that used in qsort. Instead of returning –1, 0 or 1, this function is expected to return a bool value indicating whether the first element is less than the second.

You have two possibilites: implement operator < for your objects; in that case, the default sort invocation without a third argument will work; or you can rewrite your above function to accomplish the same thing.

Notice that you have to use strong typing in the arguments.

Additionally, it’s good not to use a function here at all. Instead, use a function object. These benefit from inlining.

struct pkt_less {
    bool operator ()(pkt const& a, pkt const& b) const {
        if (a.alfa < b.alfa) return true;
        if (a.alfa > b.alfa) return false;

        if (a.x < b.x) return true;
        if (a.x > b.x) return false;

        return false;
    }
};

// Usage:

sort(wektor.begin(), wektor.end(), pkt_less());

More Related Contents:

  1. What’s the most efficient way to erase duplicates and sort a vector?
  2. How do I sort a std::vector by the values of a different std::vector?
  3. Sorting a vector in descending order
  4. how do you insert the value in a sorted vector?
  5. Sorting a std::vector by the string?
  6. Thou shalt not inherit from std::vector
  7. C++ sorting and keeping track of indexes
  8. std::vector::resize() vs. std::vector::reserve()
  9. Is std::vector so much slower than plain arrays?
  10. vector vs. list in STL
  11. problem sorting using member function as comparator
  12. Is it safe to assume that STL vector storage is always contiguous?
  13. How to get std::vector pointer to the raw data?
  14. Efficient way of reading a file into an std::vector?
  15. Looking for C++ STL-like vector class but using stack storage
  16. Sort list using STL sort function
  17. How to initialize std::vector from C-style array?
  18. Appending a vector to a vector [duplicate]
  19. Why is it OK to return a ‘vector’ from a function?
  20. C++, Sort One Vector Based On Another One [duplicate]
  21. Is the use of std::vector objects in C++ acceptable, or should I use an alternative?
  22. Cleaning up an STL list/vector of pointers
  23. Performance of qsort vs std::sort?
  24. std::vector reserve() and push_back() is faster than resize() and array index, why?
  25. Vector Iterators Incompatible
  26. Which type of sorting is used in the std::sort()?
  27. Why the libc++ std::vector internally keeps three pointers instead of one pointer and two sizes?
  28. iterator for 2d vector
  29. C++ template function compiles in header but not implementation
  30. How to get the address of the std::vector buffer start most elegantly?

Leave a Comment