2 #include <msp/core/maputils.h>
3 #include <msp/strings/format.h>
4 #include <msp/strings/utils.h>
19 typedef std::pair<Track *, unsigned> Key;
31 Node(const TrackIter &t):
32 track(t), prev(0), dist(0)
35 Node(const TrackIter &t, Node &r, float d):
36 track(t), prev(&r), dist(prev->dist+d)
39 bool operator<(const Node &other) const
40 { return dist>other.dist; }
47 TrackMatch(Track &t): track(t) { }
49 bool operator()(Track &t) const { return &t==&track; }
54 const set<Track *> &tracks;
56 TrackInSet(const set<Track *> &t): tracks(t) { }
58 bool operator()(Track &t) const { return tracks.count(&t); }
61 template<typename Pred>
62 list<Track *> dijkstra(const TrackIter &from, const Pred &goal)
64 map<Key, Node> track_nodes;
65 priority_queue<Node> nodes;
72 Node lowest = nodes.top();
75 Key key(lowest.track.track(), lowest.track.entry());
76 if(track_nodes.count(key))
79 Node &ref = track_nodes[key] = lowest;
80 if(goal(*lowest.track))
86 const TrackType::Endpoint &ep = lowest.track.endpoint();
87 for(unsigned i=0; ep.paths>>i; ++i)
90 TrackIter next = lowest.track.next(i);
94 if(track_nodes.count(Key(next.track(), next.entry())))
97 nodes.push(Node(next, ref, lowest.track->get_type().get_path_length(i)));
101 list<Track *> result;
102 for(Node *node=final; node; node=node->prev)
103 result.push_front(&*node->track);
108 template<typename Pred>
109 Route *create_route(const TrackIter &from, const Pred &goal)
111 list<Track *> tracks = dijkstra(from, goal);
116 Route *route = new Route(from->get_layout());
117 for(list<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
118 route->add_track(**i);
120 route->set_name("Pathfinder");
121 route->set_temporary(true);
131 Route::Route(Layout &l):
135 layout.add_route(*this);
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 invalid_argument("Route::set_turnout");
158 int &state = get_item(turnouts, addr);
159 if(state>=0 && path!=static_cast<unsigned>(state))
160 throw logic_error("route conflict");
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_link_slot(**i));
185 int p = get_turnout(tid2);
186 if(p>=0 && !ep.has_path(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_chain(const TrackIter &start, const TurnoutMap &trnts)
240 throw invalid_argument("Route::add_track_chain");
242 TrackIter iter = start;
245 if(iter->get_type().is_dead_end())
252 if(iter->get_turnout_id())
254 TurnoutMap::const_iterator i = trnts.find(iter->get_turnout_id());
263 iter = iter.next(path);
267 void Route::on_track_added(Track &)
272 void Route::save(list<DataFile::Statement> &st) const
274 st.push_back((DataFile::Statement("name"), name));
275 for(map<unsigned, int>::const_iterator i=turnouts.begin(); i!=turnouts.end(); ++i)
276 st.push_back((DataFile::Statement("turnout"), i->first, i->second));
279 Route *Route::find(const TrackIter &from, Track &to)
281 return create_route(from, TrackMatch(to));
284 Route *Route::find(const TrackIter &from, const Route &to)
286 return create_route(from, TrackInSet(to.get_tracks()));
289 Route *Route::find(const TrackIter &from, const Zone &to)
291 return create_route(from, TrackInSet(to.get_tracks()));
294 Route *Route::find(const TrackIter &from, const set<Track *> &to)
296 return create_route(from, TrackInSet(to));
300 Route::Loader::Loader(Route &r):
301 DataFile::ObjectLoader<Route>(r)
303 add("name", &Route::name);
304 add("turnout", &Loader::turnout);
307 void Route::Loader::finish()
309 const set<Track *> <racks = obj.layout.get_all<Track>();
310 for(set<Track *>::const_iterator i=ltracks.begin(); i!=ltracks.end(); ++i)
312 unsigned tid = (*i)->get_turnout_id();
316 TurnoutMap::iterator j = turnouts.find(tid);
317 if(j==turnouts.end())
320 const vector<TrackType::Endpoint> &eps = (*i)->get_type().get_endpoints();
321 for(unsigned k=0; k<eps.size(); ++k)
322 if(eps[k].has_path(j->second))
324 Track *link = (*i)->get_link(k);
325 if(!obj.tracks.count(link))
326 obj.add_track_chain(TrackIter(link, link->get_link_slot(**i)), turnouts);
327 if(!obj.tracks.count(*i))
328 obj.add_track_chain(TrackIter(*i, k), turnouts);
336 void Route::Loader::turnout(unsigned id, unsigned path)