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