source/libmarklin/layout.cpp

   1 /* $Id$
   2
   3 This file is part of the MSP Märklin suite
   4 Copyright © 2006-2009 Mikkosoft Productions, Mikko Rasa
   5 Distributed under the GPL
   6 */
   7
   8 #include <msp/core/refptr.h>
   9 #include <msp/datafile/parser.h>
  10 #include <msp/datafile/writer.h>
  11 #include "catalogue.h"
  12 #include "layout.h"
  13 #include "tracktype.h"
  14
  15 using namespace std;
  16 using namespace Msp;
  17
  18 namespace Marklin {
  19
  20 Layout::Layout(const Catalogue &c):
  21         catalogue(c)
  22 { }
  23
  24 Layout::~Layout()
  25 {
  26         for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
  27                 delete *i;
  28 }
  29
  30 void Layout::add_track(Track &t)
  31 {
  32         if(tracks.insert(&t).second)
  33                 signal_track_added.emit(t);
  34 }
  35
  36 void Layout::remove_track(Track &t)
  37 {
  38         if(tracks.erase(&t))
  39                 signal_track_removed.emit(t);
  40 }
  41
  42 void Layout::add_route(Route &r)
  43 {
  44         if(routes.count(r.get_name()))
  45                 throw KeyError("Duplicate route name");
  46         routes[r.get_name()] = &r;
  47         signal_route_added.emit(r);
  48 }
  49
  50 Route &Layout::get_route(const string &name) const
  51 {
  52         map<string, Route *>::const_iterator i = routes.find(name);
  53         if(i==routes.end())
  54                 throw KeyError("Unknown route", name);
  55         return *i->second;
  56 }
  57
  58 void Layout::remove_route(Route &r)
  59 {
  60         if(routes.erase(r.get_name()))
  61                 signal_route_removed.emit(r);
  62 }
  63
  64 void Layout::save(const string &fn)
  65 {
  66         IO::BufferedFile out(fn, IO::M_WRITE);
  67         DataFile::Writer writer(out);
  68
  69         if(!base.empty())
  70                 writer.write((DataFile::Statement("base"), base));
  71
  72         for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
  73         {
  74                 DataFile::Statement st("track");
  75                 st.append((*i)->get_type().get_article_number());
  76                 (*i)->save(st.sub);
  77                 writer.write(st);
  78         }
  79
  80         for(map<string, Route *>::iterator i=routes.begin(); i!=routes.end(); ++i)
  81         {
  82                 DataFile::Statement st("route");
  83                 st.append(i->first);
  84                 i->second->save(st.sub);
  85                 writer.write(st);
  86         }
  87 }
  88
  89 void Layout::check_links()
  90 {
  91         for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
  92                 (*i)->break_links();
  93
  94         list<Track *> flext;
  95         for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
  96         {
  97                 if((*i)->get_flex())
  98                         flext.push_back(*i);
  99                 else
 100                 {
 101                         for(set<Track *>::iterator j=i; j!=tracks.end(); ++j)
 102                                 if(j!=i)
 103                                         (*i)->snap_to(**j, true);
 104                 }
 105         }
 106
 107         for(list<Track *>::iterator i=flext.begin(); i!=flext.end(); ++i)
 108                 for(set<Track *>::iterator j=tracks.begin(); j!=tracks.end(); ++j)
 109                         if(*j!=*i)
 110                                 (*i)->snap_to(**j, true);
 111 }
 112
 113 void Layout::check_routes()
 114 {
 115         for(map<string, Route *>::iterator i=routes.begin(); i!=routes.end(); ++i)
 116         {
 117                 /* We must copy the turnout map, since adding tracks to the route will
 118                 (temporarily) mess it up */
 119                 const map<unsigned, int> turnouts = i->second->get_turnouts();
 120
 121                 // Find any turnout in the route
 122                 Track *track = 0;
 123                 unsigned trk_path = 0;
 124                 for(set<Track *>::const_iterator j=tracks.begin(); j!=tracks.end(); ++j)
 125                 {
 126                         map<unsigned, int>::const_iterator k = turnouts.find((*j)->get_turnout_id());
 127                         if(k!=turnouts.end())
 128                         {
 129                                 track = *j;
 130                                 trk_path = k->second;
 131                                 break;
 132                         }
 133                 }
 134
 135                 if(!track)
 136                         continue;
 137
 138                 // Find an applicable endpoint
 139                 const vector<Endpoint> &eps = track->get_type().get_endpoints();
 140                 unsigned ep = 0;
 141                 for(unsigned j=0; j<eps.size(); ++j)
 142                         if(eps[j].paths&(1<<trk_path))
 143                         {
 144                                 ep = j;
 145                                 break;
 146                         }
 147
 148                 Track *start = 0;
 149                 while(1)
 150                 {
 151                         // Traverse the track and get the next one
 152                         unsigned out_ep = track->traverse(ep, trk_path);
 153                         Track *next = track->get_links()[out_ep];
 154                         if(!next || next == start)
 155                                 break;
 156
 157                         ep = next->get_endpoint_by_link(*track);
 158                         if(next->get_type().get_n_paths()>1)
 159                         {
 160                                 // Select correct path across the turnout, or break if we hit an unknown turnout
 161                                 map<unsigned, int>::const_iterator j = turnouts.find(next->get_turnout_id());
 162                                 if(j==turnouts.end())
 163                                         break;
 164                                 trk_path = j->second;
 165                         }
 166                         else
 167                         {
 168                                 trk_path = 0;
 169
 170                                 /* Start adding tracks when we find the first non-turnout.  This
 171                                 prevents the occurrence of ambiguities while adding the tracks */
 172                                 if(!start)
 173                                         start = next;
 174                         }
 175
 176                         if(start)
 177                                 i->second->add_track(*next);
 178
 179                         track = next;
 180                 }
 181         }
 182 }
 183
 184
 185 Layout::Loader::Loader(Layout &l):
 186         DataFile::BasicLoader<Layout>(l)
 187 {
 188         add("base",  &Layout::base);
 189         add("route", &Loader::route);
 190         add("track", &Loader::track);
 191 }
 192
 193 void Layout::Loader::finish()
 194 {
 195         obj.check_links();
 196         obj.check_routes();
 197
 198         for(set<Track *>::iterator i=obj.tracks.begin(); i!=obj.tracks.end(); ++i)
 199                 (*i)->check_slope();
 200 }
 201
 202 void Layout::Loader::route(const string &n)
 203 {
 204         RefPtr<Route> rte = new Route(obj, n);
 205         load_sub(*rte);
 206         obj.add_route(*rte.release());
 207 }
 208
 209 void Layout::Loader::track(unsigned art_nr)
 210 {
 211         TrackType &type = obj.catalogue.get_track(art_nr);
 212
 213         RefPtr<Track> trk = new Track(type);
 214         load_sub(*trk);
 215         obj.add_track(*trk.release());
 216 }
 217
 218 } // namespace Marklin