STL 提供std::sort 对容器进行分类(有关更多信息,请参阅here)。
它利用operator< 对容器内的元素进行排序,您可以在其中指定用于排序的元素。
调用std::sort 后,容器已排序,您可以通过对其进行迭代来打印它。
这是一个快速而完整的示例:
#include <iostream>
#include <vector>
#include <algorithm>
class staff {
public:
explicit staff(const uint32_t id, const std::string& name,
const std::string& class_type)
: id_(id), name_(name), class_(class_type) {}
bool operator<(const staff& other) {
return id_ < other.id_; // sort by id
}
void print() const {
std::cout << "ID: " << id_
<< ", name: " << name_
<< ", class: " << class_ << "\n";
}
private:
uint32_t id_;
std::string name_;
std::string class_;
};
static void print_staffs(const std::vector<staff>& staffs) {
for (const staff& staff : staffs) {
staff.print();
}
std::cout << "----------\n";
}
int main()
{
std::vector<staff> staffs = { staff(234, "Mark", "biology"),
staff(3455, "Mitch", "English"),
staff(1234, "Hen", "Maths") };
print_staffs(staffs); // print unsorted
std::sort(staffs.begin(), staffs.end()); // sort
print_staffs(staffs); // print sorted
return 0;
}
这会产生:
ID: 234, name: Mark, class: biology
ID: 3455, name: Mitch, class: English
ID: 1234, name: Hen, class: Maths
----------
ID: 234, name: Mark, class: biology
ID: 1234, name: Hen, class: Maths
ID: 3455, name: Mitch, class: English