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