c++利用stl set_difference对车辆进出区域进行判定
核心代码
#include#include #include #include usingnamespacestd; struct_AREA_VECTOR_STRUCT { intnAreaType;//区域类型 intnAreaID;//区域ID }; voidCtestDlg::OnBnClickedButton2() { vector<_AREA_VECTOR_STRUCT>structAreaHistory;//车辆上一次所在区域 vector<_AREA_VECTOR_STRUCT>structAreaNow;//车辆本次所在区域 vector<_AREA_VECTOR_STRUCT>OutStructAreaVector;//输出区域 _AREA_VECTOR_STRUCTstructVehicle; //模拟上一次车辆所在的区域集合 structVehicle.nAreaType=2; structVehicle.nAreaID=0x45; structAreaHistory.push_back(structVehicle); structVehicle.nAreaID=0x7A; structAreaHistory.push_back(structVehicle); structVehicle.nAreaID=0x88; structAreaHistory.push_back(structVehicle); structVehicle.nAreaType=3; structVehicle.nAreaID=0x55; structAreaHistory.push_back(structVehicle); structVehicle.nAreaID=0x88; structAreaHistory.push_back(structVehicle); //模拟本次车辆所在的区域集合 structVehicle.nAreaType=2; structVehicle.nAreaID=0x88; structAreaNow.push_back(structVehicle); structVehicle.nAreaID=0x45; structAreaNow.push_back(structVehicle); structVehicle.nAreaID=0x11; structAreaNow.push_back(structVehicle); structVehicle.nAreaType=3; structVehicle.nAreaID=0x55; structAreaNow.push_back(structVehicle); //排序,先按区域类型排序,再按区域ID排序 sort(structAreaHistory.begin(),structAreaHistory.end(),[](_AREA_VECTOR_STRUCTstructArea1,_AREA_VECTOR_STRUCTstructArea2)->bool { if(structArea1.nAreaType!=structArea2.nAreaType) returnstructArea1.nAreaType bool { if(structArea1.nAreaType!=structArea2.nAreaType) returnstructArea1.nAreaType bool { if(structArea1.nAreaType!=structArea2.nAreaType) returnstructArea1.nAreaType bool { if(structArea1.nAreaType!=structArea2.nAreaType) returnstructArea1.nAreaType