1 /* -*- Mode: C++ -*- *****************************************************
3 * Written by Durk Talsma. Started May 5, 2004
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation; either version 2 of the
8 * License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
20 **************************************************************************/
22 /**************************************************************************
23 * This file contains the definition of the class Shedule.
25 * A schedule is basically a number of scheduled flights, wich can be
26 * assigned to an AI aircraft.
27 **************************************************************************/
29 #ifndef _FGSCHEDULE_HXX_
30 #define _FGSCHEDULE_HXX_
32 #define TRAFFICTOAIDISTTOSTART 150.0
33 #define TRAFFICTOAIDISTTODIE 200.0
47 string flightIdentifier;
48 string currentDestination;
50 FGScheduledFlightVec flights;
54 double distanceToUser;
57 unsigned int runCount;
63 void scheduleFlights();
66 * Transition this schedule from distant mode to AI mode;
67 * create the AIAircraft (and flight plan) and register with the AIManager
69 bool createAIAircraft(FGScheduledFlight* flight, double speedKnots, time_t deptime);
72 FGAISchedule(); // constructor
73 FGAISchedule(string model,
84 double offset); // construct & init
85 FGAISchedule(const FGAISchedule &other); // copy constructor
89 ~FGAISchedule(); //destructor
91 bool update(time_t now, const SGVec3d& userCart);
95 //void setClosestDistanceToUser();
96 bool next(); // forces the schedule to move on to the next flight.
98 // TODO: rework these four functions
99 time_t getDepartureTime () { return (*flights.begin())->getDepartureTime (); };
100 FGAirport * getDepartureAirport () { return (*flights.begin())->getDepartureAirport(); };
101 FGAirport * getArrivalAirport () { return (*flights.begin())->getArrivalAirport (); };
102 int getCruiseAlt () { return (*flights.begin())->getCruiseAlt (); };
103 double getRadius () { return radius; };
104 double getGroundOffset () { return groundOffset;};
105 const string& getFlightType () { return flightType;};
106 const string& getAirline () { return airline; };
107 const string& getAircraft () { return acType; };
108 const string& getCallSign () { return (*flights.begin())->getCallSign (); };
109 const string& getRegistration () { return registration;};
110 const string& getFlightRules () { return (*flights.begin())->getFlightRules (); };
111 bool getHeavy () { return heavy; };
112 double getCourse () { return courseToDest; };
113 unsigned int getRunCount () { return runCount; };
114 unsigned int getHits () { return hits; };
116 void setrunCount(unsigned int count) { runCount = count; };
117 void setHits (unsigned int count) { hits = count; };
119 double getScore () { return score; };
120 FGScheduledFlight*findAvailableFlight (const string ¤tDestination, const string &req);
121 // used to sort in decending order of score: I've probably found a better way to
122 // decending order sorting, but still need to test that.
123 bool operator< (const FGAISchedule &other) const { return (score > other.score); };
124 //void * getAiRef () { return AIManagerRef; };
125 //FGAISchedule* getAddress () { return this;};
129 typedef vector<FGAISchedule*> ScheduleVector;
130 typedef vector<FGAISchedule*>::iterator ScheduleVectorIterator;
132 bool compareSchedules(FGAISchedule*a, FGAISchedule*b);