271 std::deque<uint32>
const& taxi = player->m_taxi.GetPath();
272 for (
uint32 src = 0, dst = 1; dst < taxi.size(); src = dst++)
275 sObjectMgr->GetTaxiPath(taxi[src], taxi[dst], path, cost);
284 bool passedPreviousSegmentProximityCheck =
false;
285 for (
uint32 i = 0; i < nodes.size(); ++i)
292 passedPreviousSegmentProximityCheck =
true;
293 i_path.push_back(nodes[i]);
bool IsNodeIncludedInShortenedPath(TaxiPathNodeEntry const *p1, TaxiPathNodeEntry const *p2)
Definition: WaypointMovementGenerator.cpp:261
TaxiPathNodesByPath sTaxiPathNodesByPath
Definition: DB2Stores.cpp:139
#define sObjectMgr
Definition: ObjectMgr.h:1567
TaxiPathNodeList i_path
Definition: WaypointMovementGenerator.h:46
std::deque< TaxiNodeChangeInfo > _pointsForPathSwitch
Definition: WaypointMovementGenerator.h:149
uint32_t uint32
Definition: Define.h:150
Definition: DB2Structure.h:1345
uint32 i_currentNode
Definition: WaypointMovementGenerator.h:47
int32_t int32
Definition: g3dmath.h:167
uint32_t uint32
Definition: g3dmath.h:168
std::vector< TaxiPathNodeEntry const * > TaxiPathNodeList
Definition: DB2Structure.h:1449