2 #include <msp/core/maputils.h>
3 #include <msp/strings/format.h>
18 typedef std::pair<Track *, unsigned> Key;
30 Node(const TrackIter &t):
31 track(t), prev(0), dist(0)
34 Node(const TrackIter &t, Node &r, float d):
35 track(t), prev(&r), dist(prev->dist+d)
38 bool operator<(const Node &other) const
39 { return dist>other.dist; }
46 TrackMatch(Track &t): track(t) { }
48 bool operator()(Track &t) const { return &t==&track; }
53 const set<Track *> &tracks;
55 TrackInSet(const set<Track *> &t): tracks(t) { }
57 bool operator()(Track &t) const { return tracks.count(&t); }
60 template<typename Pred>
61 list<Track *> dijkstra(const TrackIter &from, const Pred &goal)
63 map<Key, Node> track_nodes;
64 priority_queue<Node> nodes;
71 Node lowest = nodes.top();
74 Key key(lowest.track.track(), lowest.track.entry());
75 if(track_nodes.count(key))
78 Node &ref = track_nodes[key] = lowest;
79 if(goal(*lowest.track))
85 unsigned paths = lowest.track.endpoint().paths;
86 for(unsigned i=0; paths>>i; ++i)
89 TrackIter next = lowest.track.next(i);
93 if(track_nodes.count(Key(next.track(), next.entry())))
96 nodes.push(Node(next, ref, lowest.track->get_type().get_path_length(i)));
100 list<Track *> result;
101 for(Node *node=final; node; node=node->prev)
102 result.push_front(&*node->track);
107 template<typename Pred>
108 Route *create_route(const TrackIter &from, const Pred &goal)
110 list<Track *> tracks = dijkstra(from, goal);
115 Route *route = new Route(from->get_layout());
116 for(list<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
117 route->add_track(**i);
119 route->set_name("Pathfinder");
120 route->set_temporary(true);
130 Route::Route(Layout &l):
134 layout.add_route(*this);
135 layout.signal_track_removed.connect(sigc::mem_fun(this, &Route::track_removed));
140 layout.remove_route(*this);
143 void Route::set_name(const string &n)
146 signal_name_changed.emit(name);
149 void Route::set_temporary(bool t)
154 void Route::set_turnout(unsigned addr, unsigned path)
157 throw InvalidParameterValue("Invalid turnout address");
158 int &state = get_item(turnouts, addr);
159 if(state>=0 && path!=static_cast<unsigned>(state))
160 throw InvalidState("Setting conflicts with route");
164 void Route::update_turnouts()
167 for(set<Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
168 if(unsigned tid = (*i)->get_turnout_id())
172 const vector<TrackType::Endpoint> &endpoints = (*i)->get_type().get_endpoints();
173 const vector<Track *> &links = (*i)->get_links();
175 // Build a combined path mask from linked endpoints
176 unsigned mask = (*i)->get_type().get_paths();
177 for(unsigned j=0; j<endpoints.size(); ++j)
179 if(!tracks.count(links[j]))
182 if(unsigned tid2 = links[j]->get_turnout_id())
184 const TrackType::Endpoint &ep = links[j]->get_type().get_endpoint(links[j]->get_endpoint_by_link(**i));
185 int p = get_turnout(tid2);
186 if(p>=0 && !(ep.paths&(1<<p)))
188 // The linked track is a turnout and has a path which is incompatible with this endpoint
189 mask &= ~endpoints[j].paths;
193 mask &= endpoints[j].paths;
196 if(mask && !(mask&(mask-1)))
198 // Exactly one possible choice, set the path accordingly
200 for(; (mask && !(mask&1)); mask>>=1, ++path) ;
201 turnouts[tid] = path;
203 else if(!turnouts.count(tid))
204 // More than one possible choice, and no existing entry - set as undecided
208 // Remove any turnouts that do not exist in the route
209 for(map<unsigned, int>::iterator i=turnouts.begin(); i!=turnouts.end();)
211 if(!found.count(i->first))
218 int Route::get_turnout(unsigned id) const
220 map<unsigned, int>::const_iterator i = turnouts.find(id);
221 if(i!=turnouts.end())
226 unsigned Route::get_path(Track &trk) const
228 if(unsigned tid = trk.get_turnout_id())
230 map<unsigned, int>::const_iterator i = turnouts.find(tid);
231 if(i!=turnouts.end())
234 return trk.get_active_path();
237 void Route::add_track(Track &trk)
239 if(tracks.count(&trk))
244 unsigned valid = check_validity(trk);
246 throw Exception("Not linked to existing tracks");
248 throw Exception("Branching routes not allowed");
250 throw Exception("Route must be smooth");
257 void Route::add_tracks(const set<Track *> &trks)
259 set<Track *> pending;
260 for(set<Track *>::const_iterator i=trks.begin(); i!=trks.end(); ++i)
261 if(!tracks.count(*i))
264 while(!pending.empty())
267 for(set<Track *>::const_iterator i=pending.begin(); i!=pending.end(); ++i)
268 if(tracks.empty() || check_validity(**i)==7)
277 throw Exception("Could not add all tracks to route");
283 void Route::add_track_chain(Track &start, unsigned ep, const TurnoutMap &trnts)
285 TrackIter iter(&start, ep);
288 if(iter->get_type().is_dead_end())
295 if(iter->get_turnout_id())
297 TurnoutMap::const_iterator i = trnts.find(iter->get_turnout_id());
306 iter = iter.next(path);
310 bool Route::has_track(Track &t) const
312 return tracks.count(&t);
315 void Route::save(list<DataFile::Statement> &st) const
317 st.push_back((DataFile::Statement("name"), name));
318 for(map<unsigned, int>::const_iterator i=turnouts.begin(); i!=turnouts.end(); ++i)
319 st.push_back((DataFile::Statement("turnout"), i->first, i->second));
322 unsigned Route::check_validity(Track &trk) const
325 const vector<Track *> &links = trk.get_links();
326 for(vector<Track *>::const_iterator i=links.begin(); i!=links.end(); ++i)
330 if(!tracks.count(*i))
333 // Linked to an existing track - good
336 if(unsigned tid = (*i)->get_turnout_id())
338 const TrackType::Endpoint &ep = (*i)->get_type().get_endpoint((*i)->get_endpoint_by_link(trk));
339 int path = get_turnout(tid);
342 // Linking to a turnout with path set is only good if we're continuing that path
343 if(ep.paths&(1<<path))
348 // Linked to a turnout with no path set - check other linked tracks
349 const vector<Track *> &tlinks = (*i)->get_links();
351 for(unsigned j=0; j<tlinks.size(); ++j)
352 if(tracks.count(tlinks[j]))
354 unsigned tid2 = tlinks[j]->get_turnout_id();
357 const TrackType::Endpoint &ep2 = tlinks[j]->get_type().get_endpoint(tlinks[j]->get_endpoint_by_link(**i));
358 path = get_turnout(tid2);
359 // Ignore a linked turnout with some other path set
360 if(path>=0 && !(ep2.paths&(1<<path)))
366 const TrackType::Endpoint &ep2 = (*i)->get_type().get_endpoint(j);
367 if(!(ep.paths&ep2.paths))
368 // Impossible path through the turnout - not good
372 // Only good if at most one other track is linked to the turnout
378 // Linked to something linear - good
385 void Route::track_removed(Track &t)
390 Route *Route::find(const TrackIter &from, Track &to)
392 return create_route(from, TrackMatch(to));
395 Route *Route::find(const TrackIter &from, const Route &to)
397 return create_route(from, TrackInSet(to.get_tracks()));
400 Route *Route::find(const TrackIter &from, const Zone &to)
402 return create_route(from, TrackInSet(to.get_tracks()));
405 Route *Route::find(const TrackIter &from, const set<Track *> &to)
407 return create_route(from, TrackInSet(to));
411 Route::Loader::Loader(Route &r):
412 DataFile::BasicLoader<Route>(r)
414 add("name", &Route::name);
415 add("turnout", &Loader::turnout);
418 void Route::Loader::finish()
420 const set<Track *> <racks = obj.layout.get_tracks();
421 for(set<Track *>::const_iterator i=ltracks.begin(); i!=ltracks.end(); ++i)
423 unsigned tid = (*i)->get_turnout_id();
427 TurnoutMap::iterator j = turnouts.find(tid);
428 if(j==turnouts.end())
431 unsigned path_mask = 1<<j->second;
432 const vector<TrackType::Endpoint> &eps = (*i)->get_type().get_endpoints();
433 for(unsigned k=0; k<eps.size(); ++k)
434 if(eps[k].paths&path_mask)
436 Track *link = (*i)->get_link(k);
437 if(!obj.tracks.count(link))
438 obj.add_track_chain(*link, link->get_endpoint_by_link(**i), turnouts);
439 if(!obj.tracks.count(*i))
440 obj.add_track_chain(**i, k, turnouts);
448 void Route::Loader::turnout(unsigned id, unsigned path)