vector<shared_ptr<IBslBuildingStorey>> buildStoreys;
//按楼层排序 -----------方法1
map<double, shared_ptr<IBslBuildingStorey>> MapStoreys;
for (auto &istorey : buildStoreys)
{
MapStoreys.insert(make_pair(istorey->getStoreyBase(), istorey));
}
buildStoreys.clear();
auto iter = MapStoreys.begin();
while (iter != MapStoreys.end()) {
buildStoreys.push_back(iter->second);
}
//按楼层排序 ------------方法2
struct
{
bool operator()(const shared_ptr<IBslBuildingStorey>& lhs, const shared_ptr<IBslBuildingStorey>& rhs)
{
return lhs->getStoreyBase() < rhs->getStoreyBase();
}
} StoreyBase;
std::sort(buildStoreys.begin(), buildStoreys.end(), StoreyBase);
对于大批