我不完全理解你的问题。但是,如果您想选择要对结构的哪个成员进行排序,则可以使用以下非常简单的函数。
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <iomanip>
struct Point {
float x{};
float y{};
friend std::ostream& operator << (std::ostream& os, const Point& p) {
return os << "X: " << std::left << std::setw(6) << p.x << " Y: " << std::setw(6) << p.y << "\n";
}
};
inline void selectiveSort(std::vector<Point>& vp, float Point::* member) {
std::sort(vp.begin(), vp.end(), [&](const Point & p1, const Point & p2) { return p1.*member < p2.*member; });
}
int main(void) {
// Define and initialise vector
std::vector<Point> points{ {1.0,9.0},{2.0,8.0},{3.0,7.0},{4.0,6.0},{5.0,5.0},{6.0,4.0},{7.0,3.0},{8.0,2.0},{9.0,1.0} };
// Sort by y and display result
selectiveSort(points, &Point::y);
std::copy(points.begin(), points.end(), std::ostream_iterator<Point>(std::cout)); std::cout << "\n";
// Sort by x and display result
selectiveSort(points, &Point::x);
std::copy(points.begin(), points.end(), std::ostream_iterator<Point>(std::cout)); std::cout << "\n";
return 0;
}