source/libmarklin/route.cpp

   1 /* $Id$
   2
   3 This file is part of the MSP Märklin suite
   4 Copyright © 2007-2010  Mikkosoft Productions, Mikko Rasa
   5 Distributed under the GPL
   6 */
   7
   8 #include <queue>
   9 #include <msp/strings/formatter.h>
  10 #include "layout.h"
  11 #include "route.h"
  12 #include "track.h"
  13 #include "tracktype.h"
  14
  15 using namespace std;
  16 using namespace Msp;
  17
  18 namespace {
  19
  20 using namespace Marklin;
  21
  22 typedef std::pair<const Track *, unsigned> Key;
  23
  24 struct Node
  25 {
  26         const Track *track;
  27         unsigned ep;
  28         Node *prev;
  29         float dist;
  30
  31         Node():
  32                 track(0), ep(0), prev(0), dist(0)
  33         { }
  34
  35         Node(const Track &t, unsigned e):
  36                 track(&t), ep(e), prev(0), dist(0)
  37         { }
  38
  39         Node(const Track &t, unsigned e, Node &r, float d):
  40                 track(&t), ep(e), prev(&r), dist(prev->dist+d)
  41         { }
  42
  43         bool operator<(const Node &other) const
  44         { return dist>other.dist; }
  45 };
  46
  47 struct TrackMatch
  48 {
  49         const Track &track;
  50
  51         TrackMatch(const Track &t): track(t) { }
  52
  53         bool operator()(const Track &t) const { return &t==&track; }
  54 };
  55
  56 struct TrackInRoute
  57 {
  58         const Route &route;
  59
  60         TrackInRoute(const Route &r): route(r) { }
  61
  62         bool operator()(const Track &t) const { return route.get_tracks().count(&t); }
  63 };
  64
  65 template<typename Pred>
  66 list<const Track *> dijkstra(const Track &from, unsigned ep, const Pred &goal)
  67 {
  68         map<Key, Node> track_nodes;
  69         priority_queue<Node> nodes;
  70         Node *final = 0;
  71
  72         nodes.push(Node(from, ep));
  73
  74         while(!nodes.empty())
  75         {
  76                 Node lowest = nodes.top();
  77                 nodes.pop();
  78
  79                 Key key(lowest.track, lowest.ep);
  80                 if(track_nodes.count(key))
  81                         continue;
  82
  83                 Node &ref = track_nodes[key] = lowest;
  84                 if(goal(*lowest.track))
  85                 {
  86                         final = &ref;
  87                         break;
  88                 }
  89
  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)
  94                 {
  95                         if(i==lowest.ep || !links[i])
  96                                 continue;
  97
  98                         unsigned link_ep = links[i]->get_endpoint_by_link(*lowest.track);
  99                         if(track_nodes.count(Key(links[i], link_ep)))
 100                                 continue;
 101
 102                         unsigned mask = eps[i].paths&eps[lowest.ep].paths;
 103                         if(!mask)
 104                                 continue;
 105
 106                         unsigned path=0;
 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)));
 109                 }
 110         }
 111
 112         if(!final)
 113                 throw InvalidParameterValue("Could not find a route");
 114
 115         list<const Track *> result;
 116         for(Node *node=final; node; node=node->prev)
 117                 result.push_front(node->track);
 118
 119         return result;
 120 }
 121
 122 template<typename Pred>
 123 Route *create_route(const Track &from, unsigned ep, const Pred &goal)
 124 {
 125         list<const Track *> tracks = dijkstra(from, ep, goal);
 126
 127         Route *route = new Route(from.get_layout());
 128         for(list<const Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
 129                 route->add_track(**i);
 130
 131         route->set_name("Pathfinder");
 132         route->set_temporary(true);
 133
 134         return route;
 135 }
 136
 137 }
 138
 139
 140 namespace Marklin {
 141
 142 Route::Route(Layout &l):
 143         layout(l),
 144         temporary(false)
 145 {
 146         layout.add_route(*this);
 147         layout.signal_track_removed.connect(sigc::mem_fun(this, &Route::track_removed));
 148 }
 149
 150 Route::~Route()
 151 {
 152         layout.remove_route(*this);
 153 }
 154
 155 void Route::set_name(const string &n)
 156 {
 157         name = n;
 158         signal_name_changed.emit(name);
 159 }
 160
 161 void Route::set_temporary(bool t)
 162 {
 163         temporary = t;
 164 }
 165
 166 int Route::get_turnout(unsigned id) const
 167 {
 168         map<unsigned, int>::const_iterator i = turnouts.find(id);
 169         if(i!=turnouts.end())
 170                 return i->second;
 171         return -1;
 172 }
 173
 174 void Route::add_track(const Track &trk)
 175 {
 176         if(tracks.count(&trk))
 177                 return;
 178
 179         if(!tracks.empty())
 180         {
 181                 unsigned valid = check_validity(trk);
 182                 if(!(valid&1))
 183                         throw Exception("Not linked to existing tracks");
 184                 else if(!(valid&2))
 185                         throw Exception("Branching routes not allowed");
 186                 else if(!(valid&4))
 187                         throw Exception("Route must be smooth");
 188         }
 189
 190         tracks.insert(&trk);
 191         update_turnouts();
 192 }
 193
 194 void Route::add_tracks(const set<const Track *> &trks)
 195 {
 196         set<const Track *> pending;
 197         for(set<const Track *>::const_iterator i=trks.begin(); i!=trks.end(); ++i)
 198                 if(!tracks.count(*i))
 199                         pending.insert(*i);
 200
 201         while(!pending.empty())
 202         {
 203                 bool found = false;
 204                 for(set<const Track *>::const_iterator i=pending.begin(); i!=pending.end(); ++i)
 205                         if(tracks.empty() || check_validity(**i)==7)
 206                         {
 207                                 tracks.insert(*i);
 208                                 pending.erase(*i);
 209                                 found = true;
 210                                 break;
 211                         }
 212
 213                 if(!found)
 214                         throw Exception("Could not add all tracks to route");
 215         }
 216
 217         update_turnouts();
 218 }
 219
 220 void Route::add_track_chain(const Track &start, unsigned ep, const TurnoutMap &trnts)
 221 {
 222         const Track *track = &start;
 223         while(1)
 224         {
 225                 if(track->get_type().is_dead_end())
 226                         break;
 227
 228                 if(tracks.count(track))
 229                         break;
 230
 231                 int path = 0;
 232                 if(track->get_turnout_id())
 233                 {
 234                         TurnoutMap::const_iterator i = trnts.find(track->get_turnout_id());
 235                         if(i==trnts.end())
 236                                 break;
 237
 238                         path = i->second;
 239                 }
 240
 241                 add_track(*track);
 242
 243                 unsigned out_ep = track->traverse(ep, path);
 244                 Track *next = track->get_links()[out_ep];
 245                 if(!next)
 246                         break;
 247
 248                 ep = next->get_endpoint_by_link(*track);
 249                 track = next;
 250         }
 251 }
 252
 253 void Route::update_turnouts()
 254 {
 255         set<unsigned> found;
 256         for(set<const Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
 257                 if(unsigned tid = (*i)->get_turnout_id())
 258                 {
 259                         found.insert(tid);
 260
 261                         const vector<Endpoint> &endpoints = (*i)->get_type().get_endpoints();
 262                         const vector<Track *> &links = (*i)->get_links();
 263
 264                         // Build a combined path mask from linked endpoints
 265                         unsigned mask = 15;
 266                         for(unsigned j=0; j<endpoints.size(); ++j)
 267                         {
 268                                 if(!tracks.count(links[j]))
 269                                         continue;
 270
 271                                 if(unsigned tid2 = links[j]->get_turnout_id())
 272                                 {
 273                                         const Endpoint &ep = links[j]->get_type().get_endpoints()[links[j]->get_endpoint_by_link(**i)];
 274                                         int p = get_turnout(tid2);
 275                                         if(p>=0 && !(ep.paths&(1<<p)))
 276                                         {
 277                                                 // The linked track is a turnout and has a path which is incompatible with this endpoint
 278                                                 mask &= ~endpoints[j].paths;
 279                                                 continue;
 280                                         }
 281                                 }
 282                                 mask &= endpoints[j].paths;
 283                         }
 284
 285                         if(mask && !(mask&(mask-1)))
 286                         {
 287                                 // Exactly one possible choice, set the path accordingly
 288                                 unsigned path = 0;
 289                                 for(; (mask && !(mask&1)); mask>>=1, ++path) ;
 290                                 turnouts[tid] = path;
 291                         }
 292                         else if(!turnouts.count(tid))
 293                                 // More than one possible choice, and no existing entry - set as undecided
 294                                 turnouts[tid] = -1;
 295                 }
 296
 297         // Remove any turnouts that do not exist in the route
 298         for(map<unsigned, int>::iterator i=turnouts.begin(); i!=turnouts.end();)
 299         {
 300                 if(!found.count(i->first))
 301                         turnouts.erase(i++);
 302                 else
 303                         ++i;
 304         }
 305 }
 306
 307 void Route::save(list<DataFile::Statement> &st) const
 308 {
 309         st.push_back((DataFile::Statement("name"), name));
 310         for(map<unsigned, int>::const_iterator i=turnouts.begin(); i!=turnouts.end(); ++i)
 311                 st.push_back((DataFile::Statement("turnout"), i->first, i->second));
 312 }
 313
 314 unsigned Route::check_validity(const Track &trk) const
 315 {
 316         unsigned result = 4;
 317         for(set<const Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
 318         {
 319                 int epi=(*i)->get_endpoint_by_link(trk);
 320                 if(epi>=0)
 321                 {
 322                         // Linked to an existing track - good
 323                         result |= 1;
 324                         const vector<Endpoint> &endpoints = (*i)->get_type().get_endpoints();
 325                         if(unsigned tid=(*i)->get_turnout_id())
 326                         {
 327                                 int r = get_turnout(tid);
 328                                 if(r>=0)
 329                                 {
 330                                         // Linking to a turnout with path set is only good if we're continuing that path
 331                                         if(endpoints[epi].paths&(1<<r))
 332                                                 result |= 2;
 333                                 }
 334                                 else
 335                                 {
 336                                         // Linked to a turnout with no path set - find out other linked tracks
 337                                         unsigned count = 0;
 338                                         const vector<Track *> &links = (*i)->get_links();
 339                                         int epj = -1;
 340                                         for(unsigned k=0; k<endpoints.size(); ++k)
 341                                                 if(tracks.count(links[k]))
 342                                                 {
 343                                                         ++count;
 344                                                         epj = k;
 345                                                 }
 346
 347                                         // Only good if at most one other track is linked to the turnout
 348                                         if(count<=1)
 349                                         {
 350                                                 result |= 2;
 351                                                 if(epj>=0 && !(endpoints[epi].paths&endpoints[epj].paths))
 352                                                         // Impossible path through the turnout - not good
 353                                                         result &= 3;
 354                                         }
 355                                 }
 356                         }
 357                         else
 358                                 // Linked to something linear - good
 359                                 result |= 2;
 360                 }
 361         }
 362
 363         return result;
 364 }
 365
 366 void Route::track_removed(Track &t)
 367 {
 368         tracks.erase(&t);
 369 }
 370
 371 Route *Route::find(const Track &from, unsigned ep, const Track &to)
 372 {
 373         return create_route(from, ep, TrackMatch(to));
 374 }
 375
 376 Route *Route::find(const Track &from, unsigned ep, const Route &to)
 377 {
 378         return create_route(from, ep, TrackInRoute(to));
 379 }
 380
 381
 382 Route::Loader::Loader(Route &r):
 383         DataFile::BasicLoader<Route>(r)
 384 {
 385         add("name",    &Route::name);
 386         add("turnout", &Loader::turnout);
 387 }
 388
 389 void Route::Loader::finish()
 390 {
 391         const set<Track *> &ltracks = obj.layout.get_tracks();
 392         for(set<Track *>::const_iterator i=ltracks.begin(); i!=ltracks.end(); ++i)
 393         {
 394                 unsigned tid = (*i)->get_turnout_id();
 395                 if(!tid)
 396                         continue;
 397
 398                 TurnoutMap::iterator j = turnouts.find(tid);
 399                 if(j==turnouts.end())
 400                         continue;
 401
 402                 unsigned path_mask = 1<<j->second;
 403                 const vector<Endpoint> &eps = (*i)->get_type().get_endpoints();
 404                 for(unsigned k=0; k<eps.size(); ++k)
 405                         if(eps[k].paths&path_mask)
 406                         {
 407                                 Track *link = (*i)->get_link(k);
 408                                 if(!obj.tracks.count(link))
 409                                         obj.add_track_chain(*link, link->get_endpoint_by_link(**i), turnouts);
 410                                 if(!obj.tracks.count(*i))
 411                                         obj.add_track_chain(**i, k, turnouts);
 412                                 break;
 413                         }
 414         }
 415 }
 416
 417 void Route::Loader::turnout(unsigned id, unsigned path)
 418 {
 419         turnouts[id] = path;
 420 }
 421
 422 } // namespace Marklin