1 #ifndef LIBR2C2_TRAINROUTEPLANNER_H_
2 #define LIBR2C2_TRAINROUTEPLANNER_H_
6 #include <msp/time/timedelta.h>
17 class TrainRoutePlanner
20 struct TrainRoutingState;
22 struct TrainRoutingInfo
27 std::list<Route *> routes;
28 Track *track_history[3];
29 std::list<const TrainRoutingState *> waits;
31 TrainRoutingInfo(Train &);
42 OccupiedTrack(Track &, unsigned, OccupiedTrack *);
43 OccupiedTrack(const OccupiedTrack &);
55 struct TrainRoutingState
57 TrainRoutingInfo *info;
60 OccupiedTrack *occupied_tracks;
64 Msp::Time::TimeDelta delay;
66 Msp::Time::TimeDelta remaining_estimate;
69 TrainRoutingState(TrainRoutingInfo &);
70 TrainRoutingState(const TrainRoutingState &);
73 Msp::Time::TimeDelta get_time_to_next_track() const;
74 bool is_occupying(Track &) const;
77 void advance_track(unsigned);
78 void update_estimate();
83 Msp::Time::TimeDelta time;
84 Msp::Time::TimeDelta total_estimate;
85 std::vector<TrainRoutingState> trains;
86 const RoutingStep *prev;
89 RoutingStep(const RoutingStep *);
91 void create_successors(std::list<RoutingStep> &) const;
93 bool check_deadlocks() const;
94 int get_occupant(Track &) const;
95 int find_next_train() const;
96 void advance(const Msp::Time::TimeDelta &);
97 void update_estimate();
98 bool is_viable() const;
101 bool operator<(const RoutingStep &) const;
104 std::vector<TrainRoutingInfo> routed_trains;
105 std::list<RoutingStep> steps;
106 std::list<RoutingStep> queue;
109 TrainRoutePlanner(Layout &);
113 const RoutingStep &get_step();
114 void add_steps(const RoutingStep &);
115 void create_routes(const RoutingStep &);