3 This file is part of the MSP Märklin suite
4 Copyright © 2006-2009 Mikkosoft Productions, Mikko Rasa
5 Distributed under the GPL
8 #include <msp/core/refptr.h>
9 #include <msp/datafile/parser.h>
10 #include <msp/datafile/writer.h>
11 #include "catalogue.h"
13 #include "tracktype.h"
20 Layout::Layout(const Catalogue &c):
26 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
30 void Layout::add_track(Track &t)
32 if(tracks.insert(&t).second)
33 signal_track_added.emit(t);
36 void Layout::remove_track(Track &t)
39 signal_track_removed.emit(t);
42 void Layout::add_route(Route &r)
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);
50 Route &Layout::get_route(const string &name) const
52 map<string, Route *>::const_iterator i = routes.find(name);
54 throw KeyError("Unknown route", name);
58 void Layout::remove_route(Route &r)
60 if(routes.erase(r.get_name()))
61 signal_route_removed.emit(r);
64 void Layout::save(const string &fn)
66 IO::BufferedFile out(fn, IO::M_WRITE);
67 DataFile::Writer writer(out);
70 writer.write((DataFile::Statement("base"), base));
72 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
74 DataFile::Statement st("track");
75 st.append((*i)->get_type().get_article_number());
80 for(map<string, Route *>::iterator i=routes.begin(); i!=routes.end(); ++i)
82 DataFile::Statement st("route");
84 i->second->save(st.sub);
89 void Layout::check_links()
91 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
95 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
101 for(set<Track *>::iterator j=i; j!=tracks.end(); ++j)
103 (*i)->snap_to(**j, true);
107 for(list<Track *>::iterator i=flext.begin(); i!=flext.end(); ++i)
108 for(set<Track *>::iterator j=tracks.begin(); j!=tracks.end(); ++j)
110 (*i)->snap_to(**j, true);
113 void Layout::check_routes()
115 for(map<string, Route *>::iterator i=routes.begin(); i!=routes.end(); ++i)
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();
121 // Find any turnout in the route
123 unsigned trk_path = 0;
124 for(set<Track *>::const_iterator j=tracks.begin(); j!=tracks.end(); ++j)
126 map<unsigned, int>::const_iterator k = turnouts.find((*j)->get_turnout_id());
127 if(k!=turnouts.end())
130 trk_path = k->second;
138 // Find an applicable endpoint
139 const vector<Endpoint> &eps = track->get_type().get_endpoints();
141 for(unsigned j=0; j<eps.size(); ++j)
142 if(eps[j].paths&(1<<trk_path))
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)
157 ep = next->get_endpoint_by_link(*track);
158 if(next->get_type().get_n_paths()>1)
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())
164 trk_path = j->second;
170 /* Start adding tracks when we find the first non-turnout. This
171 prevents the occurrence of ambiguities while adding the tracks */
177 i->second->add_track(*next);
185 Layout::Loader::Loader(Layout &l):
186 DataFile::BasicLoader<Layout>(l)
188 add("base", &Layout::base);
189 add("route", &Loader::route);
190 add("track", &Loader::track);
193 void Layout::Loader::finish()
198 for(set<Track *>::iterator i=obj.tracks.begin(); i!=obj.tracks.end(); ++i)
202 void Layout::Loader::route(const string &n)
204 RefPtr<Route> rte = new Route(obj, n);
206 obj.add_route(*rte.release());
209 void Layout::Loader::track(unsigned art_nr)
211 TrackType &type = obj.catalogue.get_track(art_nr);
213 RefPtr<Track> trk = new Track(type);
215 obj.add_track(*trk.release());
218 } // namespace Marklin