4 #include "trainrouteplanner.h"
5 #include "trainrouter.h"
13 TrainRoutePlanner::TrainRoutePlanner(Layout &layout)
15 const map<unsigned, Train *> &trains = layout.get_trains();
16 for(map<unsigned, Train *>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
18 TrainRoutingInfo info(*i->second);
19 if(info.router && info.router->get_destination())
20 routed_trains.push_back(info);
23 steps.push_back(RoutingStep());
24 RoutingStep &start = steps.back();
25 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
26 start.trains.push_back(TrainRoutingState(*i));
29 void TrainRoutePlanner::plan()
31 RoutingStep *goal = 0;
32 for(list<RoutingStep>::iterator i=steps.begin(); i!=steps.end(); ++i)
42 int next_train = find_next_train(*i);
44 add_steps(*i, next_train);
52 bool TrainRoutePlanner::update_states(RoutingStep &step)
54 RoutingStep next(&step);
56 for(vector<TrainRoutingState>::iterator i=next.trains.begin(); i!=next.trains.end(); ++i)
58 TrainState old_state = i->state;
62 TrackIter next_track = i->track.next(i->path);
66 for(vector<TrainRoutingState>::iterator j=next.trains.begin(); j!=next.trains.end(); ++j)
69 if(j->track.track()==next_track.track())
71 unsigned other_exit = j->track.reverse(j->path).entry();
72 if(next_track.entry()==other_exit)
75 else if(!j->is_occupied(*next_track))
81 if(i->state!=old_state)
87 list<RoutingStep>::iterator i;
88 for(i=steps.begin(); (i!=steps.end() && !(next<*i)); ++i) ;
89 steps.insert(i, next);
95 int TrainRoutePlanner::find_next_train(RoutingStep &step)
97 Time::TimeDelta min_dt;
99 for(unsigned i=0; i<step.trains.size(); ++i)
100 if(step.trains[i].state==MOVING)
102 Time::TimeDelta dt = step.trains[i].get_time_to_next_track();
103 if(dt<min_dt || next_train<0)
113 void TrainRoutePlanner::add_steps(RoutingStep &step, unsigned train_index)
115 TrainRoutingState &train = step.trains[train_index];
116 Time::TimeDelta dt = train.get_time_to_next_track();
117 TrackIter next_track = train.track.next(train.path);
119 list<RoutingStep> new_steps;
121 RoutingStep next(&step);
123 TrainRouter &router = *train.info->router;
124 if(train.waypoint<0 && router.is_destination(*train.track) && !router.is_destination(*next_track))
126 next.trains[train_index].state = ARRIVED;
127 new_steps.push_back(next);
131 if(train.waypoint>=0 && router.is_waypoint(train.waypoint, *train.track) && !router.is_waypoint(train.waypoint, *next_track))
133 ++next.trains[train_index].waypoint;
134 if(next.trains[train_index].waypoint>=static_cast<int>(router.get_n_waypoints()))
135 next.trains[train_index].waypoint = -1;
138 next.trains[train_index].advance_track(0);
140 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
141 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
142 if(next_entry_ep.has_path(i))
144 next.trains[train_index].path = i;
145 new_steps.push_back(next);
148 if(next_entry_ep.paths!=next_track->get_type().get_paths())
150 RoutingStep wait(&step);
152 wait.trains[train_index].state = WAITING;
153 new_steps.push_back(wait);
158 steps.merge(new_steps);
161 void TrainRoutePlanner::create_routes(RoutingStep &goal)
163 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
165 i->route = new Route(i->train->get_layout());
166 i->route->set_name("Router");
167 i->route->set_temporary(true);
170 for(RoutingStep *i=&goal; i; i=i->prev)
172 for(vector<TrainRoutingState>::iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
174 if(j->state==WAITING || j->state==BLOCKED)
175 j->info->waits.push_front(&*j);
176 j->info->route->add_track(*j->track);
180 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
182 i->router->set_route(i->route);
183 TrainRoutingState *current_wait = 0;
184 for(list<TrainRoutingState *>::iterator j=i->waits.begin(); j!=i->waits.end(); ++j)
185 if(!current_wait || (*j)->track.track()!=current_wait->track.track())
187 Block &block = (*j)->track.next()->get_block();
188 i->router->add_wait(block, 0);
195 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
197 router(train->get_ai_of_type<TrainRouter>()),
202 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
204 path_length(track->get_type().get_path_length(p)),
206 n_tracks(next ? next->n_tracks+1 : 1),
213 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
215 path_length(other.path_length),
217 n_tracks(other.n_tracks),
224 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
226 if(next && !--next->refcount)
231 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
235 delay(info->router->get_departure_delay()),
236 waypoint(info->router->get_n_waypoints() ? 0 : -1)
238 const Vehicle *veh = &info->train->get_vehicle(0);
240 TrackOffsetIter track_and_offs = veh->get_placement().get_position(VehiclePlacement::FRONT_BUFFER);
241 track = track_and_offs.track_iter();
242 offset = track_and_offs.offset();
243 path = track->get_active_path();
245 while(Vehicle *next = veh->get_link(1))
247 track_and_offs = veh->get_placement().get_position(VehiclePlacement::BACK_BUFFER);
248 back_offset = track_and_offs.offset();
250 TrackIter iter = track_and_offs.track_iter();
253 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
254 if(iter.track()==track.track())
260 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
264 occupied_tracks(other.occupied_tracks),
265 offset(other.offset),
266 back_offset(other.back_offset),
268 waypoint(other.waypoint)
270 ++occupied_tracks->refcount;
273 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
275 if(!--occupied_tracks->refcount)
276 delete occupied_tracks;
279 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
281 // TODO Consider the speed of the train
282 return (track->get_type().get_path_length(path)-offset)*Time::sec+delay;
285 bool TrainRoutePlanner::TrainRoutingState::is_occupied(Track &trk) const
287 OccupiedTrack *occ = occupied_tracks;
288 for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
294 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
297 back_offset += distance;
299 OccupiedTrack *last_occ = occupied_tracks;
300 for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
301 last_occ = last_occ->next;
303 // XXX What if there's multiple tracks to remove?
304 if(back_offset>last_occ->path_length)
306 back_offset -= last_occ->path_length;
307 if(occupied_tracks->refcount>1)
309 --occupied_tracks->refcount;
310 occupied_tracks = new OccupiedTrack(*occupied_tracks);
312 --occupied_tracks->n_tracks;
316 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
318 float distance = occupied_tracks->path_length-offset;
319 track = track.next(path);
321 occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
327 TrainRoutePlanner::RoutingStep::RoutingStep():
331 TrainRoutePlanner::RoutingStep::RoutingStep(RoutingStep *p):
337 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
340 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
345 if(i->delay>Time::zero)
347 i->delay = Time::zero;
349 else if(i->state==MOVING)
351 float distance = dt/Time::sec;
352 i->advance(distance);
357 bool TrainRoutePlanner::RoutingStep::is_goal() const
359 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
360 if(i->state!=ARRIVED)
365 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
367 return time<other.time;