drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-20 05:13:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

[traffic] Prioritize message which are updates with an unchanged location

Browse Source 
Signed-off-by: mvglasow <michael -at- vonglasow.com>
This commit is contained in:
mvglasow
2025-11-08 23:45:45 +02:00
parent e6937b211a
commit cd1201cb02
1 changed files with 7 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
libs/map/traffic_manager.cpp
View File

@@ -651,11 +651,17 @@ void TrafficManager::DecodeFirstMessage()
std::sort(m_feedQueue.front().begin(), m_feedQueue.front().end(), std::sort(m_feedQueue.front().begin(), m_feedQueue.front().end(),
[this](const traffxml::TraffMessage & a, const traffxml::TraffMessage & b){ [this](const traffxml::TraffMessage & a, const traffxml::TraffMessage & b){
// return a < b // return a < b
// cancellations before others // put messages first which decode quickly: cancellations, and updates with same location
if (a.m_cancellation) if (a.m_cancellation)
return !b.m_cancellation; return !b.m_cancellation;
else if (b.m_cancellation) else if (b.m_cancellation)
return false; return false;
auto aIt = m_messageCache.find(a.m_id);
auto bIt = m_messageCache.find(b.m_id);
if ((aIt != m_messageCache.end()) && (aIt->second.m_location == a.m_location))
return !((bIt != m_messageCache.end()) && (bIt->second.m_location == b.m_location));
else if ((bIt != m_messageCache.end()) && (bIt->second.m_location == b.m_location))
return false;
// sort by shortest distance between reference point and position/viewport // sort by shortest distance between reference point and position/viewport
std::vector<ms::LatLon> locations; std::vector<ms::LatLon> locations;
if (m_currentPositionLazy.second) if (m_currentPositionLazy.second)