X-Git-Url: https://git.mxchange.org/?a=blobdiff_plain;f=src%2FAirports%2Fgroundnetwork.hxx;h=fe83d4df25cd51b4db5e2b4fcac2001b9836628d;hb=386aefe69358ce41a11c9afeb8f56e26758fe56b;hp=a70fa2c099c2b78384517af64a07e4a603902a06;hpb=667e64e1ebc86a0c53112b92b53475898f315c36;p=flightgear.git diff --git a/src/Airports/groundnetwork.hxx b/src/Airports/groundnetwork.hxx index a70fa2c09..fe83d4df2 100644 --- a/src/Airports/groundnetwork.hxx +++ b/src/Airports/groundnetwork.hxx @@ -162,7 +162,7 @@ private: intVec nodes; intVec routes; double distance; - int depth; +// int depth; intVecIterator currNode; intVecIterator currRoute; @@ -173,14 +173,14 @@ public: routes = rts; distance = dist; currNode = nodes.begin(); - depth = dpth; +// depth = dpth; }; FGTaxiRoute& operator= (const FGTaxiRoute &other) { nodes = other.nodes; routes = other.routes; distance = other.distance; - depth = other.depth; +// depth = other.depth; currNode = nodes.begin(); currRoute = routes.begin(); return *this; @@ -190,7 +190,7 @@ public: nodes(copy.nodes), routes(copy.routes), distance(copy.distance), - depth(copy.depth), +// depth(copy.depth), currNode(nodes.begin()), currRoute(routes.begin()) {}; @@ -203,7 +203,7 @@ public: void first() { currNode = nodes.begin(); currRoute = routes.begin(); }; int size() { return nodes.size(); }; - int getDepth() { return depth; }; +// int getDepth() { return depth; }; }; typedef vector TaxiRouteVector; @@ -227,7 +227,6 @@ private: TaxiRouteVector routes; TrafficVector activeTraffic; TrafficVectorIterator currTraffic; - SGWayPoint destination; bool foundRoute; double totalDistance, maxDistance; @@ -253,9 +252,12 @@ public: void init(); bool exists() { return hasNetwork; }; void setTowerController(FGTowerController *twrCtrlr) { towerController = twrCtrlr; }; + int findNearestNode(double lat, double lon); - FGTaxiNode *findNode(int idx); - FGTaxiSegment *findSegment(int idx); + int findNearestNode(const SGGeod& aGeod); + + FGTaxiNode *findNode(unsigned idx); + FGTaxiSegment *findSegment(unsigned idx); FGTaxiRoute findShortestRoute(int start, int end, bool fullSearch=true); //void trace(FGTaxiNode *, int, int, double dist);