]> git.tdb.fi Git - r2c2.git/blob - source/libr2c2/trainrouteplanner.h
Consider train length when calculating wait time estimate
[r2c2.git] / source / libr2c2 / trainrouteplanner.h
1 #ifndef LIBR2C2_TRAINROUTEPLANNER_H_
2 #define LIBR2C2_TRAINROUTEPLANNER_H_
3
4 #include <list>
5 #include <vector>
6 #include <msp/core/thread.h>
7 #include <msp/time/timedelta.h>
8 #include "trackiter.h"
9 #include "trainrouter.h"
10
11 namespace R2C2 {
12
13 class Layout;
14 class Route;
15 class Track;
16 class Train;
17
18 class TrainRoutePlanner
19 {
20 public:
21         enum Result
22         {
23                 PENDING,
24                 COMPLETE,
25                 FAILED
26         };
27
28 private:
29         struct TrainRoutingState;
30
31         struct TrainRoutingInfo
32         {
33                 Train *train;
34                 float length;
35                 float speed;
36                 Block *first_noncritical;
37                 TrainRouter *router;
38                 std::vector<TrainRouter::Waypoint> waypoints;
39                 std::vector<const TrainRouteMetric *> metrics;
40                 bool has_duration;
41                 std::list<Route *> routes;
42                 Track *track_history[2];
43                 std::list<TrainRouter::SequencePoint> sequence;
44
45                 TrainRoutingInfo(Train &);
46         };
47
48         struct OccupiedTrack
49         {
50                 Track *track;
51                 float path_length;
52                 OccupiedTrack *next;
53                 unsigned n_tracks;
54                 unsigned refcount;
55
56                 OccupiedTrack(Track &, unsigned, OccupiedTrack *);
57                 OccupiedTrack(const OccupiedTrack &);
58                 ~OccupiedTrack();
59         };
60
61         enum TrainState
62         {
63                 MOVING,
64                 WAITING,
65                 BLOCKED,
66                 ARRIVED
67         };
68
69         struct TrainRoutingState
70         {
71                 TrainRoutingInfo *info;
72                 TrackIter track;
73                 unsigned char path;
74                 bool critical;
75                 OccupiedTrack *occupied_tracks;
76                 float offset;
77                 float back_offset;
78                 TrainState state;
79                 Msp::Time::TimeDelta delay;
80                 Msp::Time::TimeDelta duration;
81                 unsigned waypoint;
82                 float distance_traveled;
83                 float remaining_estimate;
84                 Msp::Time::TimeDelta wait_time;
85                 Msp::Time::TimeDelta estimated_wait;
86                 int blocked_by;
87
88                 TrainRoutingState(TrainRoutingInfo &);
89                 TrainRoutingState(const TrainRoutingState &);
90                 ~TrainRoutingState();
91
92                 Msp::Time::TimeDelta get_time_to_next_track() const;
93                 Msp::Time::TimeDelta get_time_to_pass(Track &) const;
94                 bool is_occupying(Track &) const;
95                 bool check_arrival();
96                 void advance(float);
97                 void advance(const Msp::Time::TimeDelta &);
98                 void advance_track(unsigned);
99                 void update_estimate();
100                 bool is_viable() const;
101         };
102
103         struct RoutingStep
104         {
105                 Msp::Time::TimeDelta time;
106                 Msp::Time::TimeDelta penalty;
107                 Msp::Time::TimeDelta cost_estimate;
108                 std::vector<TrainRoutingState> trains;
109                 const RoutingStep *prev;
110
111                 RoutingStep();
112                 RoutingStep(const RoutingStep *);
113
114                 void create_successors(std::list<RoutingStep> &) const;
115                 static void create_successor(RoutingStep &, unsigned, unsigned, std::list<RoutingStep> &);
116                 bool update_states();
117                 bool check_deadlocks() const;
118                 int get_occupant(Track &) const;
119                 int find_next_train() const;
120                 void advance(const Msp::Time::TimeDelta &);
121                 void update_estimate();
122                 bool is_viable() const;
123                 bool is_goal() const;
124
125                 bool operator<(const RoutingStep &) const;
126         };
127
128         class PlanningThread: public Msp::Thread
129         {
130         private:
131                 TrainRoutePlanner &planner;
132
133         public:
134                 PlanningThread(TrainRoutePlanner &);
135
136         private:
137                 virtual void main();
138         };
139
140         std::vector<TrainRoutingInfo> routed_trains;
141         std::list<RoutingStep> steps;
142         std::list<RoutingStep> queue;
143         const RoutingStep *goal;
144         Msp::Time::TimeDelta timeout;
145         Result result;
146         PlanningThread *thread;
147
148 public:
149         TrainRoutePlanner(Layout &);
150         ~TrainRoutePlanner();
151
152         void set_timeout(const Msp::Time::TimeDelta &);
153         Result plan();
154         void plan_async();
155         Result check();
156         Result get_result() const { return result; }
157         const std::list<Route *> &get_routes_for(const Train &) const;
158         const std::list<TrainRouter::SequencePoint> &get_sequence_for(const Train &) const;
159 private:
160         const TrainRoutingInfo &get_train_info(const Train &) const;
161         const RoutingStep &get_step();
162         void prepare_plan();
163         void create_plan();
164         void add_steps(const RoutingStep &);
165         void finalize_plan();
166 };
167
168 } // namespace R2C2
169
170 #endif