source/libr2c2/route.cpp

   1 #include <queue>
   2 #include <msp/core/maputils.h>
   3 #include <msp/strings/format.h>
   4 #include <msp/strings/utils.h>
   5 #include "layout.h"
   6 #include "route.h"
   7 #include "track.h"
   8 #include "trackiter.h"
   9 #include "tracktype.h"
  10 #include "zone.h"
  11
  12 using namespace std;
  13 using namespace Msp;
  14
  15 namespace {
  16
  17 using namespace R2C2;
  18
  19 typedef std::pair<Track *, unsigned> Key;
  20
  21 struct Node
  22 {
  23         TrackIter track;
  24         Node *prev;
  25         float dist;
  26
  27         Node():
  28                 prev(0), dist(0)
  29         { }
  30
  31         Node(const TrackIter &t):
  32                 track(t), prev(0), dist(0)
  33         { }
  34
  35         Node(const TrackIter &t, Node &r, float d):
  36                 track(t), prev(&r), dist(prev->dist+d)
  37         { }
  38
  39         bool operator<(const Node &other) const
  40         { return dist>other.dist; }
  41 };
  42
  43 struct TrackMatch
  44 {
  45         Track &track;
  46
  47         TrackMatch(Track &t): track(t) { }
  48
  49         bool operator()(Track &t) const { return &t==&track; }
  50 };
  51
  52 struct TrackInSet
  53 {
  54         const set<Track *> &tracks;
  55
  56         TrackInSet(const set<Track *> &t): tracks(t) { }
  57
  58         bool operator()(Track &t) const { return tracks.count(&t); }
  59 };
  60
  61 template<typename Pred>
  62 list<Track *> dijkstra(const TrackIter &from, const Pred &goal)
  63 {
  64         map<Key, Node> track_nodes;
  65         priority_queue<Node> nodes;
  66         Node *final = 0;
  67
  68         nodes.push(from);
  69
  70         while(!nodes.empty())
  71         {
  72                 Node lowest = nodes.top();
  73                 nodes.pop();
  74
  75                 Key key(lowest.track.track(), lowest.track.entry());
  76                 if(track_nodes.count(key))
  77                         continue;
  78
  79                 Node &ref = track_nodes[key] = lowest;
  80                 if(goal(*lowest.track))
  81                 {
  82                         final = &ref;
  83                         break;
  84                 }
  85
  86                 const TrackType::Endpoint &ep = lowest.track.endpoint();
  87                 for(unsigned i=0; ep.paths>>i; ++i)
  88                         if(ep.has_path(i))
  89                         {
  90                                 TrackIter next = lowest.track.next(i);
  91                                 if(!next)
  92                                         continue;
  93
  94                                 if(track_nodes.count(Key(next.track(), next.entry())))
  95                                         continue;
  96
  97                                 nodes.push(Node(next, ref, lowest.track->get_type().get_path_length(i)));
  98                         }
  99         }
 100
 101         list<Track *> result;
 102         for(Node *node=final; node; node=node->prev)
 103                 result.push_front(&*node->track);
 104
 105         return result;
 106 }
 107
 108 template<typename Pred>
 109 Route *create_route(const TrackIter &from, const Pred &goal)
 110 {
 111         list<Track *> tracks = dijkstra(from, goal);
 112
 113         if(tracks.empty())
 114                 return 0;
 115
 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);
 119
 120         route->set_name("Pathfinder");
 121         route->set_temporary(true);
 122
 123         return route;
 124 }
 125
 126 }
 127
 128
 129 namespace R2C2 {
 130
 131 Route::Route(Layout &l):
 132         TrackChain(l),
 133         temporary(false)
 134 {
 135         layout.add(*this);
 136 }
 137
 138 Route::~Route()
 139 {
 140         layout.remove(*this);
 141 }
 142
 143 void Route::set_name(const string &n)
 144 {
 145         name = n;
 146         signal_name_changed.emit(name);
 147 }
 148
 149 void Route::set_temporary(bool t)
 150 {
 151         temporary = t;
 152 }
 153
 154 void Route::update_turnouts()
 155 {
 156         set<unsigned> found;
 157         for(set<Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
 158                 if((*i)->get_type().is_turnout())
 159                 {
 160                         found.insert((*i)->get_turnout_address());
 161                         update_turnout(**i);
 162                 }
 163
 164         // Remove any turnouts that do not exist in the route
 165         for(map<unsigned, int>::iterator i=turnouts.begin(); i!=turnouts.end();)
 166         {
 167                 if(!found.count(i->first))
 168                         turnouts.erase(i++);
 169                 else
 170                         ++i;
 171         }
 172 }
 173
 174 void Route::update_turnout(Track &track)
 175 {
 176         // Build a combined path mask from linked endpoints
 177         unsigned nls = track.get_n_link_slots();
 178         unsigned mask = track.get_type().get_paths();
 179         for(unsigned i=0; i<nls; ++i)
 180         {
 181                 Track *link = track.get_link(i);
 182                 if(!tracks.count(link))
 183                         continue;
 184
 185                 unsigned ep_mask = track.get_type().get_endpoint(i).paths;
 186                 if(link->get_type().is_turnout())
 187                 {
 188                         const TrackType::Endpoint &link_ep = link->get_type().get_endpoint(link->get_link_slot(track));
 189                         int p = get_turnout(link->get_turnout_address());
 190                         if(p>=0 && !link_ep.has_path(p))
 191                                 // The linked track is a turnout and has a path which is incompatible with this endpoint
 192                                 ep_mask = ~ep_mask;
 193                 }
 194
 195                 mask &= ep_mask;
 196         }
 197
 198         unsigned taddr = track.get_turnout_address();
 199         if(mask && !(mask&(mask-1)))
 200         {
 201                 // Exactly one possible choice, set the path accordingly
 202                 unsigned path = 0;
 203                 for(; (mask && !(mask&1)); mask>>=1, ++path) ;
 204                 turnouts[taddr] = path;
 205         }
 206         else if(!turnouts.count(taddr))
 207                 // More than one possible choice, and no existing entry - set as undecided
 208                 turnouts[taddr] = -1;
 209 }
 210
 211 int Route::get_turnout(unsigned id) const
 212 {
 213         map<unsigned, int>::const_iterator i = turnouts.find(id);
 214         if(i!=turnouts.end())
 215                 return i->second;
 216         return -1;
 217 }
 218
 219 unsigned Route::get_path(Track &trk) const
 220 {
 221         if(unsigned taddr = trk.get_turnout_address())
 222         {
 223                 map<unsigned, int>::const_iterator i = turnouts.find(taddr);
 224                 if(i!=turnouts.end())
 225                         return i->second;
 226         }
 227         return trk.get_active_path();
 228 }
 229
 230 void Route::add_turnout(Track &track, unsigned path)
 231 {
 232         TrackSet tracks_to_add;
 233         tracks_to_add.insert(&track);
 234         unsigned nls = track.get_n_link_slots();
 235         for(unsigned i=0; i<nls; ++i)
 236                 if(track.get_type().get_endpoint(i).has_path(path))
 237                 {
 238                         TrackIter iter = TrackIter(&track, i).flip();
 239                         for(; (iter && !iter->get_type().is_turnout()); iter=iter.next())
 240                                 tracks_to_add.insert(&*iter);
 241                 }
 242
 243         add_tracks(tracks_to_add);
 244 }
 245
 246 void Route::on_track_added(Track &track)
 247 {
 248         update_turnout(track);
 249         unsigned nls = track.get_n_link_slots();
 250         for(unsigned i=0; i<nls; ++i)
 251                 if(Track *link = track.get_link(i))
 252                         if(tracks.count(link))
 253                                 update_turnout(*link);
 254 }
 255
 256 void Route::save(list<DataFile::Statement> &st) const
 257 {
 258         st.push_back((DataFile::Statement("name"), name));
 259         for(map<unsigned, int>::const_iterator i=turnouts.begin(); i!=turnouts.end(); ++i)
 260                 st.push_back((DataFile::Statement("turnout"), i->first, i->second));
 261 }
 262
 263 Route *Route::find(const TrackIter &from, Track &to)
 264 {
 265         return create_route(from, TrackMatch(to));
 266 }
 267
 268 Route *Route::find(const TrackIter &from, const Route &to)
 269 {
 270         return create_route(from, TrackInSet(to.get_tracks()));
 271 }
 272
 273 Route *Route::find(const TrackIter &from, const Zone &to)
 274 {
 275         return create_route(from, TrackInSet(to.get_tracks()));
 276 }
 277
 278 Route *Route::find(const TrackIter &from, const set<Track *> &to)
 279 {
 280         return create_route(from, TrackInSet(to));
 281 }
 282
 283
 284 Route::Loader::Loader(Route &r):
 285         DataFile::ObjectLoader<Route>(r)
 286 {
 287         add("name",    &Route::name);
 288         add("turnout", &Loader::turnout);
 289 }
 290
 291 void Route::Loader::finish()
 292 {
 293         const set<Track *> &ltracks = obj.layout.get_all<Track>();
 294         map<Track *, unsigned> turnout_tracks;
 295         for(set<Track *>::const_iterator i=ltracks.begin(); i!=ltracks.end(); ++i)
 296                 if((*i)->get_type().is_turnout())
 297                 {
 298                         TurnoutMap::iterator j = turnouts.find((*i)->get_turnout_address());
 299                         if(j!=turnouts.end())
 300                                 turnout_tracks[*i] = j->second;
 301                 }
 302
 303         for(map<Track *, unsigned>::iterator i=turnout_tracks.begin(); i!=turnout_tracks.end(); )
 304         {
 305                 if(obj.check_validity(*i->first)==VALID)
 306                 {
 307                         obj.add_turnout(*i->first, i->second);
 308                         turnout_tracks.erase(i);
 309                         i = turnout_tracks.begin();
 310                 }
 311                 else
 312                         ++i;
 313         }
 314 }
 315
 316 void Route::Loader::turnout(unsigned id, unsigned path)
 317 {
 318         turnouts[id] = path;
 319 }
 320
 321 } // namespace R2C2