2 #include <msp/strings/format.h>
17 typedef std::pair<Track *, unsigned> Key;
29 Node(const TrackIter &t):
30 track(t), prev(0), dist(0)
33 Node(const TrackIter &t, Node &r, float d):
34 track(t), prev(&r), dist(prev->dist+d)
37 bool operator<(const Node &other) const
38 { return dist>other.dist; }
45 TrackMatch(Track &t): track(t) { }
47 bool operator()(Track &t) const { return &t==&track; }
52 const set<Track *> &tracks;
54 TrackInSet(const set<Track *> &t): tracks(t) { }
56 bool operator()(Track &t) const { return tracks.count(&t); }
59 template<typename Pred>
60 list<Track *> dijkstra(const TrackIter &from, const Pred &goal)
62 map<Key, Node> track_nodes;
63 priority_queue<Node> nodes;
70 Node lowest = nodes.top();
73 Key key(lowest.track.track(), lowest.track.entry());
74 if(track_nodes.count(key))
77 Node &ref = track_nodes[key] = lowest;
78 if(goal(*lowest.track))
84 unsigned paths = lowest.track.endpoint().paths;
85 for(unsigned i=0; paths>>i; ++i)
88 TrackIter next = lowest.track.next(i);
92 if(track_nodes.count(Key(next.track(), next.entry())))
95 nodes.push(Node(next, ref, lowest.track->get_type().get_path_length(i)));
100 for(Node *node=final; node; node=node->prev)
101 result.push_front(&*node->track);
106 template<typename Pred>
107 Route *create_route(const TrackIter &from, const Pred &goal)
109 list<Track *> tracks = dijkstra(from, goal);
114 Route *route = new Route(from->get_layout());
115 for(list<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
116 route->add_track(**i);
118 route->set_name("Pathfinder");
119 route->set_temporary(true);
129 Route::Route(Layout &l):
133 layout.add_route(*this);
134 layout.signal_track_removed.connect(sigc::mem_fun(this, &Route::track_removed));
139 layout.remove_route(*this);
142 void Route::set_name(const string &n)
145 signal_name_changed.emit(name);
148 void Route::set_temporary(bool t)
153 void Route::set_turnout(unsigned addr, unsigned path)
156 throw InvalidParameterValue("Invalid turnout address");
157 map<unsigned, int>::iterator i = turnouts.find(addr);
158 if(i==turnouts.end())
159 throw KeyError("Turnout is not in this route");
160 if(i->second>=0 && path!=static_cast<unsigned>(i->second))
161 throw InvalidState("Setting conflicts with route");
165 void Route::update_turnouts()
168 for(set<Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
169 if(unsigned tid = (*i)->get_turnout_id())
173 const vector<TrackType::Endpoint> &endpoints = (*i)->get_type().get_endpoints();
174 const vector<Track *> &links = (*i)->get_links();
176 // Build a combined path mask from linked endpoints
177 unsigned mask = (*i)->get_type().get_paths();
178 for(unsigned j=0; j<endpoints.size(); ++j)
180 if(!tracks.count(links[j]))
183 if(unsigned tid2 = links[j]->get_turnout_id())
185 const TrackType::Endpoint &ep = links[j]->get_type().get_endpoint(links[j]->get_endpoint_by_link(**i));
186 int p = get_turnout(tid2);
187 if(p>=0 && !(ep.paths&(1<<p)))
189 // The linked track is a turnout and has a path which is incompatible with this endpoint
190 mask &= ~endpoints[j].paths;
194 mask &= endpoints[j].paths;
197 if(mask && !(mask&(mask-1)))
199 // Exactly one possible choice, set the path accordingly
201 for(; (mask && !(mask&1)); mask>>=1, ++path) ;
202 turnouts[tid] = path;
204 else if(!turnouts.count(tid))
205 // More than one possible choice, and no existing entry - set as undecided
209 // Remove any turnouts that do not exist in the route
210 for(map<unsigned, int>::iterator i=turnouts.begin(); i!=turnouts.end();)
212 if(!found.count(i->first))
219 int Route::get_turnout(unsigned id) const
221 map<unsigned, int>::const_iterator i = turnouts.find(id);
222 if(i!=turnouts.end())
227 unsigned Route::get_path(Track &trk) const
229 if(unsigned tid = trk.get_turnout_id())
231 map<unsigned, int>::const_iterator i = turnouts.find(tid);
232 if(i!=turnouts.end())
235 return trk.get_active_path();
238 void Route::add_track(Track &trk)
240 if(tracks.count(&trk))
245 unsigned valid = check_validity(trk);
247 throw Exception("Not linked to existing tracks");
249 throw Exception("Branching routes not allowed");
251 throw Exception("Route must be smooth");
258 void Route::add_tracks(const set<Track *> &trks)
260 set<Track *> pending;
261 for(set<Track *>::const_iterator i=trks.begin(); i!=trks.end(); ++i)
262 if(!tracks.count(*i))
265 while(!pending.empty())
268 for(set<Track *>::const_iterator i=pending.begin(); i!=pending.end(); ++i)
269 if(tracks.empty() || check_validity(**i)==7)
278 throw Exception("Could not add all tracks to route");
284 void Route::add_track_chain(Track &start, unsigned ep, const TurnoutMap &trnts)
286 TrackIter iter(&start, ep);
289 if(iter->get_type().is_dead_end())
296 if(iter->get_turnout_id())
298 TurnoutMap::const_iterator i = trnts.find(iter->get_turnout_id());
307 iter = iter.next(path);
311 bool Route::has_track(Track &t) const
313 return tracks.count(&t);
316 void Route::save(list<DataFile::Statement> &st) const
318 st.push_back((DataFile::Statement("name"), name));
319 for(map<unsigned, int>::const_iterator i=turnouts.begin(); i!=turnouts.end(); ++i)
320 st.push_back((DataFile::Statement("turnout"), i->first, i->second));
323 unsigned Route::check_validity(Track &trk) const
326 const vector<Track *> &links = trk.get_links();
327 for(vector<Track *>::const_iterator i=links.begin(); i!=links.end(); ++i)
331 if(!tracks.count(*i))
334 // Linked to an existing track - good
337 if(unsigned tid = (*i)->get_turnout_id())
339 const TrackType::Endpoint &ep = (*i)->get_type().get_endpoint((*i)->get_endpoint_by_link(trk));
340 int path = get_turnout(tid);
343 // Linking to a turnout with path set is only good if we're continuing that path
344 if(ep.paths&(1<<path))
349 // Linked to a turnout with no path set - check other linked tracks
350 const vector<Track *> &tlinks = (*i)->get_links();
352 for(unsigned j=0; j<tlinks.size(); ++j)
353 if(tracks.count(tlinks[j]))
355 unsigned tid2 = tlinks[j]->get_turnout_id();
358 const TrackType::Endpoint &ep2 = tlinks[j]->get_type().get_endpoint(tlinks[j]->get_endpoint_by_link(**i));
359 path = get_turnout(tid2);
360 // Ignore a linked turnout with some other path set
361 if(path>=0 && !(ep2.paths&(1<<path)))
367 const TrackType::Endpoint &ep2 = (*i)->get_type().get_endpoint(j);
368 if(!(ep.paths&ep2.paths))
369 // Impossible path through the turnout - not good
373 // Only good if at most one other track is linked to the turnout
379 // Linked to something linear - good
386 void Route::track_removed(Track &t)
391 Route *Route::find(const TrackIter &from, Track &to)
393 return create_route(from, TrackMatch(to));
396 Route *Route::find(const TrackIter &from, const Route &to)
398 return create_route(from, TrackInSet(to.get_tracks()));
401 Route *Route::find(const TrackIter &from, const Zone &to)
403 return create_route(from, TrackInSet(to.get_tracks()));
406 Route *Route::find(const TrackIter &from, const set<Track *> &to)
408 return create_route(from, TrackInSet(to));
412 Route::Loader::Loader(Route &r):
413 DataFile::BasicLoader<Route>(r)
415 add("name", &Route::name);
416 add("turnout", &Loader::turnout);
419 void Route::Loader::finish()
421 const set<Track *> <racks = obj.layout.get_tracks();
422 for(set<Track *>::const_iterator i=ltracks.begin(); i!=ltracks.end(); ++i)
424 unsigned tid = (*i)->get_turnout_id();
428 TurnoutMap::iterator j = turnouts.find(tid);
429 if(j==turnouts.end())
432 unsigned path_mask = 1<<j->second;
433 const vector<TrackType::Endpoint> &eps = (*i)->get_type().get_endpoints();
434 for(unsigned k=0; k<eps.size(); ++k)
435 if(eps[k].paths&path_mask)
437 Track *link = (*i)->get_link(k);
438 if(!obj.tracks.count(link))
439 obj.add_track_chain(*link, link->get_endpoint_by_link(**i), turnouts);
440 if(!obj.tracks.count(*i))
441 obj.add_track_chain(**i, k, turnouts);
449 void Route::Loader::turnout(unsigned id, unsigned path)