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(Catalogue &c):
26 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
28 for(map<string, Route *>::iterator i=routes.begin(); i!=routes.end(); ++i)
32 void Layout::add_track(Track &t)
34 if(tracks.insert(&t).second)
35 signal_track_added.emit(t);
38 void Layout::remove_track(Track &t)
41 signal_track_removed.emit(t);
44 void Layout::add_route(Route &r)
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);
52 Route &Layout::get_route(const string &name) const
54 map<string, Route *>::const_iterator i = routes.find(name);
56 throw KeyError("Unknown route", name);
60 void Layout::remove_route(Route &r)
62 if(routes.erase(r.get_name()))
63 signal_route_removed.emit(r);
66 void Layout::save(const string &fn)
68 IO::BufferedFile out(fn, IO::M_WRITE);
69 DataFile::Writer writer(out);
72 writer.write((DataFile::Statement("base"), base));
74 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
76 DataFile::Statement st("track");
77 st.append((*i)->get_type().get_article_number());
82 for(map<string, Route *>::iterator i=routes.begin(); i!=routes.end(); ++i)
84 DataFile::Statement st("route");
86 i->second->save(st.sub);
91 void Layout::check_links()
93 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
97 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
103 for(set<Track *>::iterator j=i; j!=tracks.end(); ++j)
105 (*i)->snap_to(**j, true);
109 for(list<Track *>::iterator i=flext.begin(); i!=flext.end(); ++i)
110 for(set<Track *>::iterator j=tracks.begin(); j!=tracks.end(); ++j)
112 (*i)->snap_to(**j, true);
115 void Layout::check_routes()
117 for(map<string, Route *>::iterator i=routes.begin(); i!=routes.end(); ++i)
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();
123 // Find any turnout in the route
125 unsigned trk_path = 0;
126 for(set<Track *>::const_iterator j=tracks.begin(); j!=tracks.end(); ++j)
128 map<unsigned, int>::const_iterator k = turnouts.find((*j)->get_turnout_id());
129 if(k!=turnouts.end())
132 trk_path = k->second;
140 // Find an applicable endpoint
141 const vector<Endpoint> &eps = track->get_type().get_endpoints();
143 for(unsigned j=0; j<eps.size(); ++j)
144 if(eps[j].paths&(1<<trk_path))
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)
159 ep = next->get_endpoint_by_link(*track);
160 if(next->get_type().get_n_paths()>1)
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())
166 trk_path = j->second;
172 /* Start adding tracks when we find the first non-turnout. This
173 prevents the occurrence of ambiguities while adding the tracks */
179 i->second->add_track(*next);
187 Layout::Loader::Loader(Layout &l):
188 DataFile::BasicLoader<Layout>(l)
190 add("base", &Layout::base);
191 add("route", &Loader::route);
192 add("track", &Loader::track);
195 void Layout::Loader::finish()
200 for(set<Track *>::iterator i=obj.tracks.begin(); i!=obj.tracks.end(); ++i)
204 void Layout::Loader::route(const string &n)
206 RefPtr<Route> rte = new Route(obj, n);
208 obj.add_route(*rte.release());
211 void Layout::Loader::track(unsigned art_nr)
213 const TrackType &type = obj.catalogue.get_track(art_nr);
215 RefPtr<Track> trk = new Track(type);
217 obj.add_track(*trk.release());
220 } // namespace Marklin