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):
140 layout.remove(*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::update_turnouts()
157 for(set<Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
158 if((*i)->get_type().is_turnout())
160 found.insert((*i)->get_turnout_address());
164 // Remove any turnouts that do not exist in the route
165 for(map<unsigned, int>::iterator i=turnouts.begin(); i!=turnouts.end();)
167 if(!found.count(i->first))
174 void Route::update_turnout(Track &track)
176 if(!track.get_type().is_turnout())
179 // Build a combined path mask from linked endpoints
180 unsigned nls = track.get_n_link_slots();
181 unsigned mask = track.get_type().get_paths();
182 for(unsigned i=0; i<nls; ++i)
184 Track *link = track.get_link(i);
185 if(!tracks.count(link))
188 unsigned ep_mask = track.get_type().get_endpoint(i).paths;
189 if(link->get_type().is_turnout())
191 const TrackType::Endpoint &link_ep = link->get_type().get_endpoint(link->get_link_slot(track));
192 int p = get_turnout(link->get_turnout_address());
193 if(p>=0 && !link_ep.has_path(p))
194 // The linked track is a turnout and has a path which is incompatible with this endpoint
201 unsigned taddr = track.get_turnout_address();
202 if(mask && !(mask&(mask-1)))
204 // Exactly one possible choice, set the path accordingly
206 for(; (mask && !(mask&1)); mask>>=1, ++path) ;
207 turnouts[taddr] = path;
209 else if(!turnouts.count(taddr))
210 // More than one possible choice, and no existing entry - set as undecided
211 turnouts[taddr] = -1;
214 int Route::get_turnout(unsigned id) const
216 map<unsigned, int>::const_iterator i = turnouts.find(id);
217 if(i!=turnouts.end())
222 unsigned Route::get_path(Track &trk) const
224 if(unsigned taddr = trk.get_turnout_address())
226 map<unsigned, int>::const_iterator i = turnouts.find(taddr);
227 if(i!=turnouts.end())
230 return trk.get_active_path();
233 void Route::add_turnout(Track &track, unsigned path)
235 TrackSet tracks_to_add;
236 tracks_to_add.insert(&track);
237 unsigned nls = track.get_n_link_slots();
238 for(unsigned i=0; i<nls; ++i)
239 if(track.get_type().get_endpoint(i).has_path(path))
241 TrackIter iter = TrackIter(&track, i).flip();
242 for(; (iter && !iter->get_type().is_turnout()); iter=iter.next())
243 tracks_to_add.insert(&*iter);
246 add_tracks(tracks_to_add);
249 void Route::on_track_added(Track &track)
251 update_turnout(track);
252 unsigned nls = track.get_n_link_slots();
253 for(unsigned i=0; i<nls; ++i)
254 if(Track *link = track.get_link(i))
255 if(tracks.count(link))
256 update_turnout(*link);
259 void Route::save(list<DataFile::Statement> &st) const
261 st.push_back((DataFile::Statement("name"), name));
262 for(map<unsigned, int>::const_iterator i=turnouts.begin(); i!=turnouts.end(); ++i)
263 st.push_back((DataFile::Statement("turnout"), i->first, i->second));
266 Route *Route::find(const TrackIter &from, Track &to)
268 return create_route(from, TrackMatch(to));
271 Route *Route::find(const TrackIter &from, const Route &to)
273 return create_route(from, TrackInSet(to.get_tracks()));
276 Route *Route::find(const TrackIter &from, const Zone &to)
278 return create_route(from, TrackInSet(to.get_tracks()));
281 Route *Route::find(const TrackIter &from, const set<Track *> &to)
283 return create_route(from, TrackInSet(to));
287 Route::Loader::Loader(Route &r):
288 DataFile::ObjectLoader<Route>(r)
290 add("name", &Route::name);
291 add("turnout", &Loader::turnout);
294 void Route::Loader::finish()
296 const set<Track *> <racks = obj.layout.get_all<Track>();
297 map<Track *, unsigned> turnout_tracks;
298 for(set<Track *>::const_iterator i=ltracks.begin(); i!=ltracks.end(); ++i)
299 if((*i)->get_type().is_turnout())
301 TurnoutMap::iterator j = turnouts.find((*i)->get_turnout_address());
302 if(j!=turnouts.end())
303 turnout_tracks[*i] = j->second;
306 for(map<Track *, unsigned>::iterator i=turnout_tracks.begin(); i!=turnout_tracks.end(); )
308 if(obj.check_validity(*i->first)==VALID)
310 obj.add_turnout(*i->first, i->second);
311 turnout_tracks.erase(i);
312 i = turnout_tracks.begin();
319 void Route::Loader::turnout(unsigned id, unsigned path)