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 float 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(const Msp::Time::TimeDelta &);
78 void advance_track(unsigned);
79 void update_estimate();
84 Msp::Time::TimeDelta time;
85 Msp::Time::TimeDelta total_estimate;
86 std::vector<TrainRoutingState> trains;
87 const RoutingStep *prev;
90 RoutingStep(const RoutingStep *);
92 void create_successors(std::list<RoutingStep> &) const;
94 bool check_deadlocks() const;
95 int get_occupant(Track &) const;
96 int find_next_train() const;
97 void advance(const Msp::Time::TimeDelta &);
98 void update_estimate();
99 bool is_viable() const;
100 bool is_goal() const;
102 bool operator<(const RoutingStep &) const;
105 std::vector<TrainRoutingInfo> routed_trains;
106 std::list<RoutingStep> steps;
107 std::list<RoutingStep> queue;
110 TrainRoutePlanner(Layout &);
114 const RoutingStep &get_step();
115 void add_steps(const RoutingStep &);
116 void create_routes(const RoutingStep &);