Convert Catalogue to a Collection

[r2c2.git] / source / libr2c2 / tracktype.cpp

diff --git a/source/libr2c2/tracktype.cpp b/source/libr2c2/tracktype.cpp
index e9136ac741e704e574199f0d1630a499d6844306..c2740f1d39b33ccfe10f819863ea26da220544f8 100644 (file)
--- a/source/libr2c2/tracktype.cpp
+++ b/source/libr2c2/tracktype.cpp
@@ -1,5 +1,6 @@
 #include <cmath>
 #include <msp/geometry/union.h>
+#include "trackappearance.h"
 #include "tracktype.h"
 
 using namespace std;
@@ -7,12 +8,25 @@ using namespace Msp;
 
 namespace R2C2 {
 
-TrackType::TrackType(const ArticleNumber &an):
+TrackType::TrackType(const ArticleNumber &an, const TrackAppearance *ta):
        ObjectType(an),
+       appearance(ta),
        state_bits(0),
        autofit_preference(1)
 { }
 
+const TrackAppearance &TrackType::get_appearance() const
+{
+       if(!appearance)
+               throw logic_error("no appearance");
+       return *appearance;
+}
+
+float TrackType::get_gauge() const
+{
+       return get_appearance().get_gauge();
+}
+
 float TrackType::get_total_length() const
 {
        return get_path_length(-1);
@@ -43,6 +57,36 @@ unsigned TrackType::get_n_paths() const
        return n;
 }
 
+unsigned TrackType::coerce_path(unsigned entry, unsigned path) const
+{
+       const Endpoint &ep = get_endpoint(entry);
+       if(ep.has_path(path))
+               return path;
+
+       unsigned paths = get_paths();
+       if(paths>>(1<<state_bits))
+       {
+               /* There are more paths than can be expressed with state_bits, so
+               multiple paths are set at once.  See if one of the alternatives fits. */
+               unsigned step = 1<<state_bits;
+               for(unsigned p=path+step; paths>>p; p+=step)
+                       if(ep.has_path(p))
+                               return p;
+       }
+
+       // Find an endpoint that's connected to the entry and has the requested path
+       for(vector<Endpoint>::const_iterator i=endpoints.begin(); i!=endpoints.end(); ++i)
+               if(i->has_path(path) && i->has_common_paths(ep))
+               {
+                       unsigned p = 1;
+                       for(unsigned m=i->paths&ep.paths; m>>p; ++p) ;
+                       return p-1;
+               }
+
+       // TODO crossings fall here
+       throw logic_error("TrackType::coerce_path");
+}
+
 bool TrackType::is_turnout() const
 {
        return endpoints.size()>2;