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->has_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(router.is_destination(*train.track) && !router.is_destination(*next_track))
126 next.trains[train_index].state = ARRIVED;
127 new_steps.push_back(next);
131 next.trains[train_index].advance_track(0);
133 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
134 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
135 if(next_entry_ep.has_path(i))
137 next.trains[train_index].path = i;
138 new_steps.push_back(next);
141 if(next_entry_ep.paths!=next_track->get_type().get_paths())
143 RoutingStep wait(&step);
145 wait.trains[train_index].state = WAITING;
146 new_steps.push_back(wait);
151 steps.merge(new_steps);
154 void TrainRoutePlanner::create_routes(RoutingStep &goal)
156 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
158 i->route = new Route(i->train->get_layout());
159 i->route->set_name("Router");
162 for(RoutingStep *i=&goal; i; i=i->prev)
164 for(vector<TrainRoutingState>::iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
166 if(j->state==WAITING || j->state==BLOCKED)
167 j->info->waits.push_front(&*j);
168 j->info->route->add_track(*j->track);
172 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
174 i->router->set_route(i->route);
175 TrainRoutingState *current_wait = 0;
176 for(list<TrainRoutingState *>::iterator j=i->waits.begin(); j!=i->waits.end(); ++j)
177 if(!current_wait || (*j)->track.track()!=current_wait->track.track())
179 Block &block = (*j)->track.next()->get_block();
180 i->router->add_wait(block, 0);
187 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
189 router(train->get_ai_of_type<TrainRouter>()),
194 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
196 path_length(track->get_type().get_path_length(p)),
198 n_tracks(next ? next->n_tracks+1 : 1),
205 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
207 path_length(other.path_length),
209 n_tracks(other.n_tracks),
216 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
218 if(next && !--next->refcount)
223 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
228 const Vehicle *veh = &info->train->get_vehicle(0);
230 float half_length = veh->get_type().get_length()/2;
231 TrackOffsetIter track_and_offs = veh->get_track_iter().advance(half_length);
232 track = track_and_offs.track_iter();
233 offset = track_and_offs.offset();
234 path = track->get_active_path();
236 while(Vehicle *next = veh->get_link(1))
238 track_and_offs = veh->get_track_iter().advance(-half_length);
239 back_offset = track_and_offs.offset();
241 TrackIter iter = track_and_offs.track_iter();
244 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
245 if(iter.track()==track.track())
251 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
255 occupied_tracks(other.occupied_tracks),
256 offset(other.offset),
257 back_offset(other.back_offset),
260 ++occupied_tracks->refcount;
263 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
265 if(!--occupied_tracks->refcount)
266 delete occupied_tracks;
269 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
271 // TODO Consider the speed of the train
272 return (track->get_type().get_path_length(path)-offset)*Time::sec;
275 bool TrainRoutePlanner::TrainRoutingState::is_occupied(Track &trk) const
277 OccupiedTrack *occ = occupied_tracks;
278 for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
284 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
287 back_offset += distance;
289 OccupiedTrack *last_occ = occupied_tracks;
290 for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
291 last_occ = last_occ->next;
293 // XXX What if there's multiple tracks to remove?
294 if(back_offset>last_occ->path_length)
296 back_offset -= last_occ->path_length;
297 if(occupied_tracks->refcount>1)
299 --occupied_tracks->refcount;
300 occupied_tracks = new OccupiedTrack(*occupied_tracks);
302 --occupied_tracks->n_tracks;
306 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
308 float distance = occupied_tracks->path_length-offset;
309 track = track.next(path);
311 occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
317 TrainRoutePlanner::RoutingStep::RoutingStep():
321 TrainRoutePlanner::RoutingStep::RoutingStep(RoutingStep *p):
327 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
330 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
333 float distance = dt/Time::sec;
334 i->advance(distance);
338 bool TrainRoutePlanner::RoutingStep::is_goal() const
340 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
341 if(i->state!=ARRIVED)
346 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
348 return time<other.time;