std::deque is a much better fit, should have bit better performance

This commit is contained in:
Michael Cook (mackal)
2014-12-18 02:20:03 -05:00
parent fe4872c921
commit ce9bcef620
6 changed files with 28 additions and 28 deletions
+1 -1
View File
@@ -2636,7 +2636,7 @@ void EntityList::FindPathsToAllNPCs()
while (it != npc_list.end()) {
Map::Vertex Node0 = zone->pathing->GetPathNodeCoordinates(0, false);
Map::Vertex Dest(it->second->GetX(), it->second->GetY(), it->second->GetZ());
std::vector<int> Route = zone->pathing->FindRoute(Node0, Dest);
std::deque<int> Route = zone->pathing->FindRoute(Node0, Dest);
if (Route.size() == 0)
printf("Unable to find a route to %s\n", it->second->GetName());
else