3 This file is part of the MSP Märklin suite
4 Copyright © 2006-2010 Mikkosoft Productions, Mikko Rasa
5 Distributed under the GPL
9 #include <msp/core/refptr.h>
10 #include <msp/datafile/parser.h>
11 #include <msp/datafile/writer.h>
12 #include <msp/time/utils.h>
14 #include "catalogue.h"
20 #include "tracktype.h"
28 Layout::Layout(Catalogue &c, Driver *d):
36 while(!trains.empty())
37 delete trains.begin()->second;
38 while(!routes.empty())
39 delete routes.begin()->second;
40 while(!tracks.empty())
41 delete *tracks.begin();
42 while(!blocks.empty())
43 delete *blocks.begin();
46 Driver &Layout::get_driver() const
49 throw InvalidState("No driver");
53 void Layout::add_track(Track &t)
55 if(tracks.insert(&t).second)
58 signal_track_added.emit(t);
62 void Layout::remove_track(Track &t)
67 signal_track_removed.emit(t);
71 void Layout::add_block(Block &b)
76 Block &Layout::get_block(unsigned id) const
78 for(set<Block *>::const_iterator i=blocks.begin(); i!=blocks.end(); ++i)
79 if((*i)->get_id()==id)
82 throw KeyError("Unknown block", lexical_cast(id));
85 Block &Layout::get_block_by_track(const Track &t) const
87 for(set<Block *>::const_iterator i=blocks.begin(); i!=blocks.end(); ++i)
88 if((*i)->get_tracks().count(const_cast<Track *>(&t)))
91 throw InvalidParameterValue("No block found for track");
94 void Layout::create_blocks()
96 set<Track *> used_tracks;
97 for(set<Block *>::const_iterator i=blocks.begin(); i!=blocks.end(); ++i)
99 const set<Track *> &btracks = (*i)->get_tracks();
100 used_tracks.insert(btracks.begin(), btracks.end());
103 for(set<Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
104 if(used_tracks.count(*i)==0)
106 Block *block = new Block(*this, **i);
107 used_tracks.insert(block->get_tracks().begin(), block->get_tracks().end());
110 for(set<Block *>::iterator i=blocks.begin(); i!=blocks.end(); ++i)
111 for(set<Block *>::iterator j=i; j!=blocks.end(); ++j)
113 (*i)->check_link(**j);
116 void Layout::create_blocks(const Track &track)
118 const vector<Track *> &links = track.get_links();
119 for(set<Block *>::iterator i=blocks.begin(); i!=blocks.end();)
121 bool del = (*i)->get_tracks().count(const_cast<Track *>(&track));
122 for(vector<Track *>::const_iterator j=links.begin(); (!del && j!=links.end()); ++j)
123 del = (*i)->get_tracks().count(*j);
134 void Layout::remove_block(Block &b)
139 void Layout::add_route(Route &r)
141 if(routes.count(r.get_name()))
142 throw KeyError("Duplicate route name", r.get_name());
144 routes[r.get_name()] = &r;
145 signal_route_added.emit(r);
148 Route &Layout::get_route(const string &name) const
150 map<string, Route *>::const_iterator i = routes.find(name);
152 throw KeyError("Unknown route", name);
156 void Layout::remove_route(Route &r)
158 if(routes.erase(r.get_name()))
159 signal_route_removed.emit(r);
162 void Layout::add_train(Train &t)
164 if(trains.count(t.get_address()))
165 throw KeyError("Duplicate train address", lexical_cast(t.get_address()));
167 trains[t.get_address()] = &t;
168 signal_train_added.emit(t);
171 Train &Layout::get_train(unsigned addr) const
173 map<unsigned, Train *>::const_iterator i = trains.find(addr);
175 throw KeyError("Unknown train", lexical_cast(addr));
179 void Layout::remove_train(Train &t)
181 if(trains.erase(t.get_address()))
182 signal_train_removed.emit(t);
185 void Layout::add_vehicle(Vehicle &v)
187 if(vehicles.insert(&v).second)
188 signal_vehicle_added.emit(v);
191 void Layout::remove_vehicle(Vehicle &v)
193 if(vehicles.erase(&v))
194 signal_vehicle_removed.emit(v);
202 Time::TimeStamp t = Time::now();
208 for(map<unsigned, Train *>::iterator i=trains.begin(); i!=trains.end(); ++i)
209 i->second->tick(t, dt);
212 void Layout::save(const string &fn)
214 IO::BufferedFile out(fn, IO::M_WRITE);
215 DataFile::Writer writer(out);
218 writer.write((DataFile::Statement("base"), base));
220 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
222 DataFile::Statement st("track");
223 st.append((*i)->get_type().get_article_number());
228 for(map<string, Route *>::iterator i=routes.begin(); i!=routes.end(); ++i)
230 DataFile::Statement st("route");
232 i->second->save(st.sub);
237 void Layout::save_trains(const string &fn)
239 IO::BufferedFile out(fn, IO::M_WRITE);
240 DataFile::Writer writer(out);
242 for(map<unsigned, Train *>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
244 DataFile::Statement st("train");
245 st.append(i->second->get_locomotive_type().get_article_number());
246 st.append(i->second->get_address());
247 i->second->save(st.sub);
252 void Layout::check_links()
254 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
258 for(set<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
264 for(set<Track *>::iterator j=i; j!=tracks.end(); ++j)
266 (*i)->snap_to(**j, true);
270 for(list<Track *>::iterator i=flext.begin(); i!=flext.end(); ++i)
271 for(set<Track *>::iterator j=tracks.begin(); j!=tracks.end(); ++j)
273 (*i)->snap_to(**j, true);
276 void Layout::check_routes()
278 for(map<string, Route *>::iterator i=routes.begin(); i!=routes.end(); ++i)
280 /* We must copy the turnout map, since adding tracks to the route will
281 (temporarily) mess it up */
282 const map<unsigned, int> turnouts = i->second->get_turnouts();
284 // Find any turnout in the route
286 unsigned trk_path = 0;
287 for(set<Track *>::const_iterator j=tracks.begin(); j!=tracks.end(); ++j)
289 map<unsigned, int>::const_iterator k = turnouts.find((*j)->get_turnout_id());
290 if(k!=turnouts.end())
293 trk_path = k->second;
301 // Find an applicable endpoint
302 const vector<Endpoint> &eps = track->get_type().get_endpoints();
304 for(unsigned j=0; j<eps.size(); ++j)
305 if(eps[j].paths&(1<<trk_path))
314 // Traverse the track and get the next one
315 unsigned out_ep = track->traverse(ep, trk_path);
316 Track *next = track->get_links()[out_ep];
317 if(!next || next == start)
320 ep = next->get_endpoint_by_link(*track);
321 if(next->get_type().is_turnout())
323 // Select correct path across the turnout, or break if we hit an unknown turnout
324 map<unsigned, int>::const_iterator j = turnouts.find(next->get_turnout_id());
325 if(j==turnouts.end())
327 trk_path = j->second;
333 /* Start adding tracks when we find the first non-turnout. This
334 prevents the occurrence of ambiguities while adding the tracks */
340 i->second->add_track(*next);
348 Layout::Loader::Loader(Layout &l):
349 DataFile::BasicLoader<Layout>(l),
352 add("base", &Layout::base);
353 add("route", &Loader::route);
354 add("track", &Loader::track);
355 add("train", &Loader::train);
358 void Layout::Loader::finish()
364 for(set<Track *>::iterator i=obj.tracks.begin(); i!=obj.tracks.end(); ++i)
368 void Layout::Loader::route(const string &n)
370 Route *rte = new Route(obj, n);
374 void Layout::Loader::track(unsigned art_nr)
376 Track *trk = new Track(obj, obj.catalogue.get_track(art_nr));
381 void Layout::Loader::train(unsigned art_nr, unsigned addr)
383 Train *trn = new Train(obj, obj.catalogue.get_locomotive(art_nr), addr);
387 } // namespace Marklin