3 This file is part of the MSP Märklin suite
4 Copyright © 2007-2010 Mikkosoft Productions, Mikko Rasa
5 Distributed under the GPL
9 #include <msp/strings/formatter.h>
13 #include "tracktype.h"
20 using namespace Marklin;
22 typedef std::pair<const Track *, unsigned> Key;
32 track(0), ep(0), prev(0), dist(0)
35 Node(const Track &t, unsigned e):
36 track(&t), ep(e), prev(0), dist(0)
39 Node(const Track &t, unsigned e, Node &r, float d):
40 track(&t), ep(e), prev(&r), dist(prev->dist+d)
43 bool operator<(const Node &other) const
44 { return dist>other.dist; }
51 TrackMatch(const Track &t): track(t) { }
53 bool operator()(const Track &t) const { return &t==&track; }
60 TrackInRoute(const Route &r): route(r) { }
62 bool operator()(const Track &t) const { return route.get_tracks().count(&t); }
65 template<typename Pred>
66 list<const Track *> dijkstra(const Track &from, unsigned ep, const Pred &goal)
68 map<Key, Node> track_nodes;
69 priority_queue<Node> nodes;
72 nodes.push(Node(from, ep));
76 Node lowest = nodes.top();
79 Key key(lowest.track, lowest.ep);
80 if(track_nodes.count(key))
83 Node &ref = track_nodes[key] = lowest;
84 if(goal(*lowest.track))
90 const TrackType &type = lowest.track->get_type();
91 const vector<Endpoint> &eps = type.get_endpoints();
92 const vector<Track *> &links = lowest.track->get_links();
93 for(unsigned i=0; i<eps.size(); ++i)
95 if(i==lowest.ep || !links[i])
98 unsigned link_ep = links[i]->get_endpoint_by_link(*lowest.track);
99 if(track_nodes.count(Key(links[i], link_ep)))
102 unsigned mask = eps[i].paths&eps[lowest.ep].paths;
107 for(; !(mask&1); ++path, mask>>=1) ;
108 nodes.push(Node(*links[i], links[i]->get_endpoint_by_link(*lowest.track), ref, type.get_path_length(path)));
113 throw InvalidParameterValue("Could not find a route");
115 list<const Track *> result;
116 for(Node *node=final; node; node=node->prev)
117 result.push_front(node->track);
124 template<typename Pred>
125 Route *create_route(const Track &from, unsigned ep, const Pred &goal)
127 list<const Track *> tracks = dijkstra(from, ep, goal);
129 Route *route = new Route(from.get_layout(), format("-%d-", ++count));
130 for(list<const Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
131 route->add_track(**i);
133 route->set_temporary(true);
143 Route::Route(Layout &l, const string &n):
148 layout.add_route(*this);
149 layout.signal_track_removed.connect(sigc::mem_fun(this, &Route::track_removed));
154 layout.remove_route(*this);
157 void Route::set_temporary(bool t)
162 int Route::get_turnout(unsigned id) const
164 map<unsigned, int>::const_iterator i = turnouts.find(id);
165 if(i!=turnouts.end())
170 void Route::add_track(const Track &trk)
172 if(tracks.count(&trk))
177 unsigned valid = check_validity(trk);
179 throw Exception("Not linked to existing tracks");
181 throw Exception("Branching routes not allowed");
183 throw Exception("Route must be smooth");
190 void Route::add_tracks(const set<const Track *> &trks)
192 set<const Track *> pending;
193 for(set<const Track *>::const_iterator i=trks.begin(); i!=trks.end(); ++i)
194 if(!tracks.count(*i))
197 while(!pending.empty())
200 for(set<const Track *>::const_iterator i=pending.begin(); i!=pending.end(); ++i)
201 if(tracks.empty() || check_validity(**i)==7)
210 throw Exception("Could not add all tracks to route");
216 void Route::add_track_chain(const Track &start, unsigned ep, const TurnoutMap &trnts)
218 const Track *track = &start;
221 if(track->get_type().is_dead_end())
224 if(tracks.count(track))
228 if(track->get_turnout_id())
230 TurnoutMap::const_iterator i = trnts.find(track->get_turnout_id());
239 unsigned out_ep = track->traverse(ep, path);
240 Track *next = track->get_links()[out_ep];
244 ep = next->get_endpoint_by_link(*track);
249 void Route::update_turnouts()
252 for(set<const Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
253 if(unsigned tid = (*i)->get_turnout_id())
257 const vector<Endpoint> &endpoints = (*i)->get_type().get_endpoints();
258 const vector<Track *> &links = (*i)->get_links();
260 // Build a combined path mask from linked endpoints
262 for(unsigned j=0; j<endpoints.size(); ++j)
264 if(!tracks.count(links[j]))
267 if(unsigned tid2 = links[j]->get_turnout_id())
269 const Endpoint &ep = links[j]->get_type().get_endpoints()[links[j]->get_endpoint_by_link(**i)];
270 int p = get_turnout(tid2);
271 if(p>=0 && !(ep.paths&(1<<p)))
273 // The linked track is a turnout and has a path which is incompatible with this endpoint
274 mask &= ~endpoints[j].paths;
278 mask &= endpoints[j].paths;
281 if(mask && !(mask&(mask-1)))
283 // Exactly one possible choice, set the path accordingly
285 for(; (mask && !(mask&1)); mask>>=1, ++path) ;
286 turnouts[tid] = path;
288 else if(!turnouts.count(tid))
289 // More than one possible choice, and no existing entry - set as undecided
293 // Remove any turnouts that do not exist in the route
294 for(map<unsigned, int>::iterator i=turnouts.begin(); i!=turnouts.end();)
296 if(!found.count(i->first))
303 void Route::save(list<DataFile::Statement> &st) const
305 for(map<unsigned, int>::const_iterator i=turnouts.begin(); i!=turnouts.end(); ++i)
306 st.push_back((DataFile::Statement("turnout"), i->first, i->second));
309 unsigned Route::check_validity(const Track &trk) const
312 for(set<const Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
314 int epi=(*i)->get_endpoint_by_link(trk);
317 // Linked to an existing track - good
319 const vector<Endpoint> &endpoints = (*i)->get_type().get_endpoints();
320 if(unsigned tid=(*i)->get_turnout_id())
322 int r = get_turnout(tid);
325 // Linking to a turnout with path set is only good if we're continuing that path
326 if(endpoints[epi].paths&(1<<r))
331 // Linked to a turnout with no path set - find out other linked tracks
333 const vector<Track *> &links = (*i)->get_links();
335 for(unsigned k=0; k<endpoints.size(); ++k)
336 if(tracks.count(links[k]))
342 // Only good if at most one other track is linked to the turnout
346 if(epj>=0 && !(endpoints[epi].paths&endpoints[epj].paths))
347 // Impossible path through the turnout - not good
353 // Linked to something linear - good
361 void Route::track_removed(Track &t)
366 Route *Route::find(const Track &from, unsigned ep, const Track &to)
368 return create_route(from, ep, TrackMatch(to));
371 Route *Route::find(const Track &from, unsigned ep, const Route &to)
373 return create_route(from, ep, TrackInRoute(to));
377 Route::Loader::Loader(Route &r):
378 DataFile::BasicLoader<Route>(r)
380 add("turnout", &Loader::turnout);
383 void Route::Loader::finish()
385 const set<Track *> <racks = obj.layout.get_tracks();
386 for(set<Track *>::const_iterator i=ltracks.begin(); i!=ltracks.end(); ++i)
388 unsigned tid = (*i)->get_turnout_id();
392 TurnoutMap::iterator j = turnouts.find(tid);
393 if(j==turnouts.end())
396 unsigned path_mask = 1<<j->second;
397 const vector<Endpoint> &eps = (*i)->get_type().get_endpoints();
398 for(unsigned k=0; k<eps.size(); ++k)
399 if(eps[k].paths&path_mask)
401 Track *link = (*i)->get_link(k);
402 if(!obj.tracks.count(link))
403 obj.add_track_chain(*link, link->get_endpoint_by_link(**i), turnouts);
404 if(!obj.tracks.count(*i))
405 obj.add_track_chain(**i, k, turnouts);
411 void Route::Loader::turnout(unsigned id, unsigned path)
416 } // namespace Marklin