Commit: r1051: Loop splitting code now copes with ways that contain nested loops.
Version 1051 was commited by markb on 2009-05-30 10:04:30 +0100 (Sat, 30 May 2009) Loop splitting code now copes with ways that contain nested loops. Before, having detected a loop and split the way into two, it did not then go on to check whether the first portion contained any more loops. It does now.
Working great. Autria.osm.bz2 from Geofabrik compiles without any unroutable roads now. I checked some that with 1049 still would not route and they do route. Quick Distance also working without problems - though speed improvement only up to 40% (but hey that's a lot too, after your reports I thought it would speed up even more however). svn commit wrote:
Version 1051 was commited by markb on 2009-05-30 10:04:30 +0100 (Sat, 30 May 2009)
Loop splitting code now copes with ways that contain nested loops.
Before, having detected a loop and split the way into two, it did not then go on to check whether the first portion contained any more loops. It does now. _______________________________________________ mkgmap-dev mailing list mkgmap-dev@lists.mkgmap.org.uk http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev
Hi Felix,
Working great. Autria.osm.bz2 from Geofabrik compiles without any unroutable roads now. I checked some that with 1049 still would not route and they do route.
Very good.
Quick Distance also working without problems - though speed improvement only up to 40% (but hey that's a lot too, after your reports I thought it would speed up even more however).
The speedup you will see does depend on quite a few factors (map contents, mkgmap options, java implementation, computer performance, etc). Perhaps you need the 4 core box and the parallel patch as well! Cheers, Mark
participants (3)
-
Felix Hartmann -
Mark Burton -
svn commit