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