add better and more precise comments to Restrictionmap

Distance tables and JSON generator

.travis.yml

@@ -4,8 +4,15 @@ compiler:
 #  - clang
 # Make sure CMake is installed
 install:
+ - sudo apt-add-repository -y ppa:ubuntu-toolchain-r/test
+ - sudo add-apt-repository -y ppa:boost-latest/ppa
  - sudo apt-get update >/dev/null
- - sudo apt-get -q install libprotoc-dev libprotobuf7 libprotobuf-dev libosmpbf-dev libbz2-dev libstxxl-dev libstxxl1 libxml2-dev libzip-dev libboost1.46-all-dev lua5.1 liblua5.1-0-dev libluabind-dev rubygems
+ - sudo apt-get -q install libprotoc-dev libprotobuf7 libprotobuf-dev libosmpbf-dev libbz2-dev libstxxl-dev libstxxl1 libxml2-dev libzip-dev lua5.1 liblua5.1-0-dev rubygems
+ - sudo apt-get -q install g++-4.7
+ - sudo apt-get install libboost1.54-all-dev
+ #luabind
+ - curl https://gist.githubusercontent.com/DennisOSRM/f2eb7b948e6fe1ae319e/raw/install-luabind.sh | sudo bash
+ #osmosis
  - curl -s https://gist.githubusercontent.com/DennisOSRM/803a64a9178ec375069f/raw/ | sudo bash
 before_script:
  - rvm use 1.9.3
@@ -29,8 +36,8 @@ cache:
 - bundler
 - apt
 env:
- - CMAKEOPTIONS="-DCMAKE_BUILD_TYPE=Release" OSRM_PORT=5000 OSRM_TIMEOUT=60
- - CMAKEOPTIONS="-DCMAKE_BUILD_TYPE=Debug" OSRM_PORT=5010 OSRM_TIMEOUT=60
+ - CMAKEOPTIONS="-DCMAKE_BUILD_TYPE=Release -DCMAKE_CXX_COMPILER=g++-4.7" OSRM_PORT=5000 OSRM_TIMEOUT=60
+ - CMAKEOPTIONS="-DCMAKE_BUILD_TYPE=Debug -DCMAKE_CXX_COMPILER=g++-4.7" OSRM_PORT=5010 OSRM_TIMEOUT=60
 notifications:
  irc:
   channels:

Algorithms/BFSComponentExplorer.h

@@ -0,0 +1,140 @@
+#ifndef __BFS_COMPONENT_EXPLORER_H__
+#define __BFS_COMPONENT_EXPLORER_H__
+
+#include "../typedefs.h"
+#include "../DataStructures/DynamicGraph.h"
+#include "../DataStructures/RestrictionMap.h"
+
+#include <queue>
+#include <unordered_set>
+
+// Explores the components of the given graph while respecting turn restrictions
+// and barriers.
+template <typename GraphT> class BFSComponentExplorer
+{
+  public:
+    BFSComponentExplorer(const GraphT &dynamicGraph,
+                         const RestrictionMap &restrictions,
+                         const std::unordered_set<NodeID> &barrier_nodes)
+        : m_graph(dynamicGraph), m_restriction_map(restrictions), m_barrier_nodes(barrier_nodes)
+    {
+        BOOST_ASSERT(m_graph.GetNumberOfNodes() > 0);
+    }
+
+    /*!
+     * Returns the size of the component that the node belongs to.
+     */
+    inline unsigned int GetComponentSize(NodeID node)
+    {
+        BOOST_ASSERT(node < m_component_index_list.size());
+
+        return m_component_index_size[m_component_index_list[node]];
+    }
+
+    inline unsigned int GetNumberOfComponents() { return m_component_index_size.size(); }
+
+    /*!
+     * Computes the component sizes.
+     */
+    void run()
+    {
+        std::queue<std::pair<NodeID, NodeID>> bfs_queue;
+        unsigned current_component = 0;
+
+        BOOST_ASSERT(m_component_index_list.empty());
+        BOOST_ASSERT(m_component_index_size.empty());
+
+        unsigned num_nodes = m_graph.GetNumberOfNodes();
+
+        m_component_index_list.resize(num_nodes, std::numeric_limits<unsigned>::max());
+
+        BOOST_ASSERT(num_nodes > 0);
+
+        // put unexplorered node with parent pointer into queue
+        for (NodeID node = 0; node < num_nodes; ++node)
+        {
+            if (std::numeric_limits<unsigned>::max() == m_component_index_list[node])
+            {
+                unsigned size = ExploreComponent(bfs_queue, node, current_component);
+
+                // push size into vector
+                m_component_index_size.emplace_back(size);
+                ++current_component;
+            }
+        }
+    }
+
+  private:
+    /*!
+     * Explores the current component that starts at node using BFS.
+     */
+    inline unsigned ExploreComponent(std::queue<std::pair<NodeID, NodeID>> &bfs_queue,
+                                     NodeID node,
+                                     unsigned current_component)
+    {
+        bfs_queue.emplace(node, node);
+        // mark node as read
+        m_component_index_list[node] = current_component;
+
+        unsigned current_component_size = 1;
+
+        while (!bfs_queue.empty())
+        {
+            // fetch element from BFS queue
+            std::pair<NodeID, NodeID> current_queue_item = bfs_queue.front();
+            bfs_queue.pop();
+
+            const NodeID v = current_queue_item.first; // current node
+            const NodeID u = current_queue_item.second; // parent
+            // increment size counter of current component
+            ++current_component_size;
+            const bool is_barrier_node = (m_barrier_nodes.find(v) != m_barrier_nodes.end());
+            if (!is_barrier_node)
+            {
+                const NodeID to_node_of_only_restriction =
+                    m_restriction_map.CheckForEmanatingIsOnlyTurn(u, v);
+
+                for (auto e2 : m_graph.GetAdjacentEdgeRange(v))
+                {
+                    const NodeID w = m_graph.GetTarget(e2);
+
+                    if (to_node_of_only_restriction != std::numeric_limits<unsigned>::max() &&
+                        w != to_node_of_only_restriction)
+                    {
+                        // At an only_-restriction but not at the right turn
+                        continue;
+                    }
+
+                    if (u != w)
+                    {
+                        // only add an edge if turn is not a U-turn except
+                        // when it is at the end of a dead-end street.
+                        if (!m_restriction_map.CheckIfTurnIsRestricted(u, v, w))
+                        {
+                            // only add an edge if turn is not prohibited
+                            if (std::numeric_limits<unsigned>::max() == m_component_index_list[w])
+                            {
+                                // insert next (node, parent) only if w has
+                                // not yet been explored
+                                // mark node as read
+                                m_component_index_list[w] = current_component;
+                                bfs_queue.emplace(w, v);
+                            }
+                        }
+                    }
+                }
+            }
+        }
+
+        return current_component_size;
+    }
+
+    std::vector<unsigned> m_component_index_list;
+    std::vector<NodeID> m_component_index_size;
+
+    const GraphT &m_graph;
+    const RestrictionMap &m_restriction_map;
+    const std::unordered_set<NodeID> &m_barrier_nodes;
+};
+
+#endif

Algorithms/DouglasPeucker.cpp

@@ -25,173 +25,115 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
+#include <osrm/Coordinate.h>
+
 #include "DouglasPeucker.h"
 #include "../DataStructures/SegmentInformation.h"
-#include "../Util/MercatorUtil.h"
+#include "../Util/SimpleLogger.h"
+
+#include <boost/assert.hpp>
+
+#include <cmath>
 
 #include <limits>
 
-//These thresholds are more or less heuristically chosen.
-static double DouglasPeuckerThresholds[19] = {
-      262144., //z0
-      131072., //z1
-       65536., //z2
-       32768., //z3
-       16384., //z4
-        8192., //z5
-        4096., //z6
-        2048., //z7
-         960., //z8
-         480., //z9
-         240., //z10
-          90., //z11
-          50., //z12
-          25., //z13
-          15., //z14
-           5., //z15
-            .65, //z16
-            .5, //z17
-            .35  //z18
-};
-
-/**
- * Yuck! Code duplication. This function is also in EgdeBasedNode.h
- */
-double DouglasPeucker::ComputeDistance(
-    const FixedPointCoordinate& point,
-    const FixedPointCoordinate& segA,
-    const FixedPointCoordinate& segB
-) const {
-    const double x = lat2y(point.lat/COORDINATE_PRECISION);
-    const double y = point.lon/COORDINATE_PRECISION;
-    const double a = lat2y(segA.lat/COORDINATE_PRECISION);
-    const double b = segA.lon/COORDINATE_PRECISION;
-    const double c = lat2y(segB.lat/COORDINATE_PRECISION);
-    const double d = segB.lon/COORDINATE_PRECISION;
-    double p,q,nY;
-    if( std::abs(a-c) > std::numeric_limits<double>::epsilon() ){
-        const double m = (d-b)/(c-a); // slope
-        // Projection of (x,y) on line joining (a,b) and (c,d)
-        p = ((x + (m*y)) + (m*m*a - m*b))/(1. + m*m);
-        q = b + m*(p - a);
-    } else {
-        p = c;
-        q = y;
-    }
-    nY = (d*p - c*q)/(a*d - b*c);
-
-    //discretize the result to coordinate precision. it's a hack!
-    if( std::abs(nY) < (1./COORDINATE_PRECISION) ) {
-        nY = 0.;
-    }
-
-    double r = (p - nY*a)/c;
-    if( std::isnan(r) ) {
-        r = ((segB.lat == point.lat) && (segB.lon == point.lon)) ? 1. : 0.;
-    } else if( std::abs(r) <= std::numeric_limits<double>::epsilon() ) {
-        r = 0.;
-    } else if( std::abs(r-1.) <= std::numeric_limits<double>::epsilon() ) {
-        r = 1.;
-    }
-    FixedPointCoordinate nearest_location;
-    BOOST_ASSERT( !std::isnan(r) );
-    if( r <= 0. ){
-        nearest_location.lat = segA.lat;
-        nearest_location.lon = segA.lon;
-    } else if( r >= 1. ){
-        nearest_location.lat = segB.lat;
-        nearest_location.lon = segB.lon;
-    } else { // point lies in between
-        nearest_location.lat = y2lat(p)*COORDINATE_PRECISION;
-        nearest_location.lon = q*COORDINATE_PRECISION;
-    }
-    BOOST_ASSERT( nearest_location.isValid() );
-    const double approximated_distance = FixedPointCoordinate::ApproximateEuclideanDistance(
-        point,
-        nearest_location
-    );
-    BOOST_ASSERT( 0. <= approximated_distance );
-    return approximated_distance;
+DouglasPeucker::DouglasPeucker()
+    : douglas_peucker_thresholds({262144., // z0
+                                  131072., // z1
+                                  65536.,  // z2
+                                  32768.,  // z3
+                                  16384.,  // z4
+                                  8192.,   // z5
+                                  4096.,   // z6
+                                  2048.,   // z7
+                                  960.,    // z8
+                                  480.,    // z9
+                                  240.,    // z10
+                                  90.,     // z11
+                                  50.,     // z12
+                                  25.,     // z13
+                                  15.,     // z14
+                                  5.,      // z15
+                                  .65,     // z16
+                                  .5,      // z17
+                                  .35      // z18
+      })
+{
 }
 
-void DouglasPeucker::Run(
-    std::vector<SegmentInformation> & input_geometry,
-    const unsigned zoom_level
-) {
+void DouglasPeucker::Run(std::vector<SegmentInformation> &input_geometry, const unsigned zoom_level)
+{
+    input_geometry.front().necessary = true;
+    input_geometry.back().necessary = true;
+
+    BOOST_ASSERT_MSG(!input_geometry.empty(), "geometry invalid");
+    if (input_geometry.size() < 2)
+    {
+        return;
+    }
+
+    SimpleLogger().Write() << "input_geometry.size()=" << input_geometry.size();
+
     {
         BOOST_ASSERT_MSG(zoom_level < 19, "unsupported zoom level");
-        BOOST_ASSERT_MSG(1 < input_geometry.size(), "geometry invalid");
-        std::size_t left_border = 0;
-        std::size_t right_border = 1;
-        //Sweep over array and identify those ranges that need to be checked
-        do {
-            BOOST_ASSERT_MSG(
-                input_geometry[left_border].necessary,
-                "left border must be necessary"
-            );
-            BOOST_ASSERT_MSG(
-                input_geometry.back().necessary,
-                "right border must be necessary"
-            );
+        unsigned left_border = 0;
+        unsigned right_border = 1;
+        // Sweep over array and identify those ranges that need to be checked
+        do
+        {
+            if (!input_geometry[left_border].necessary)
+            {
+              SimpleLogger().Write() << "broken interval [" << left_border << "," << right_border << "]";
+            }
+            BOOST_ASSERT_MSG(input_geometry[left_border].necessary,
+                             "left border must be necessary");
+            BOOST_ASSERT_MSG(input_geometry.back().necessary, "right border must be necessary");
 
-            if(input_geometry[right_border].necessary) {
-                recursion_stack.push(std::make_pair(left_border, right_border));
+            if (input_geometry[right_border].necessary)
+            {
+                recursion_stack.emplace(left_border, right_border);
                 left_border = right_border;
             }
             ++right_border;
-        } while( right_border < input_geometry.size());
+        } while (right_border < input_geometry.size());
     }
-    while( !recursion_stack.empty() ) {
-        //pop next element
-        const PairOfPoints pair = recursion_stack.top();
+    while (!recursion_stack.empty())
+    {
+        // pop next element
+        const GeometryRange pair = recursion_stack.top();
         recursion_stack.pop();
-        BOOST_ASSERT_MSG(
-            input_geometry[pair.first].necessary,
-            "left border mus be necessary"
-        );
-        BOOST_ASSERT_MSG(
-            input_geometry[pair.second].necessary,
-            "right border must be necessary"
-        );
-        BOOST_ASSERT_MSG(
-            pair.second < input_geometry.size(),
-            "right border outside of geometry"
-        );
-        BOOST_ASSERT_MSG(
-            pair.first < pair.second,
-            "left border on the wrong side"
-        );
+        BOOST_ASSERT_MSG(input_geometry[pair.first].necessary, "left border mus be necessary");
+        BOOST_ASSERT_MSG(input_geometry[pair.second].necessary, "right border must be necessary");
+        BOOST_ASSERT_MSG(pair.second < input_geometry.size(), "right border outside of geometry");
+        BOOST_ASSERT_MSG(pair.first < pair.second, "left border on the wrong side");
         double max_distance = std::numeric_limits<double>::min();
 
-        std::size_t farthest_element_index = pair.second;
-        //find index idx of element with max_distance
-        for(std::size_t i = pair.first+1; i < pair.second; ++i){
-            const int temp_dist = ComputeDistance(
-                                    input_geometry[i].location,
-                                    input_geometry[pair.first].location,
-                                    input_geometry[pair.second].location
-                                );
+        unsigned farthest_element_index = pair.second;
+        // find index idx of element with max_distance
+        for (unsigned i = pair.first + 1; i < pair.second; ++i)
+        {
+            const double temp_dist = FixedPointCoordinate::ComputePerpendicularDistance(
+                input_geometry[i].location,
+                input_geometry[pair.first].location,
+                input_geometry[pair.second].location);
             const double distance = std::abs(temp_dist);
-            if(
-                distance > DouglasPeuckerThresholds[zoom_level] &&
-                distance > max_distance
-            ) {
+            if (distance > douglas_peucker_thresholds[zoom_level] && distance > max_distance)
+            {
                 farthest_element_index = i;
                 max_distance = distance;
             }
         }
-        if (max_distance > DouglasPeuckerThresholds[zoom_level]) {
+        if (max_distance > douglas_peucker_thresholds[zoom_level])
+        {
             //  mark idx as necessary
             input_geometry[farthest_element_index].necessary = true;
-            if (1 < (farthest_element_index - pair.first) ) {
-                recursion_stack.push(
-                    std::make_pair(pair.first, farthest_element_index)
-                );
+            if (1 < (farthest_element_index - pair.first))
+            {
+                recursion_stack.emplace(pair.first, farthest_element_index);
             }
-            if (1 < (pair.second - farthest_element_index) ) {
-                recursion_stack.push(
-                    std::make_pair(farthest_element_index, pair.second)
-                );
+            if (1 < (pair.second - farthest_element_index))
+            {
+                recursion_stack.emplace(farthest_element_index, pair.second);
             }
         }
     }

Algorithms/DouglasPeucker.h

@@ -28,16 +28,6 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef DOUGLASPEUCKER_H_
 #define DOUGLASPEUCKER_H_
 
-#include "../Util/SimpleLogger.h"
-
-#include <osrm/Coordinate.h>
-
-#include <boost/assert.hpp>
-#include <boost/foreach.hpp>
-
-#include <cmath>
-
-#include <limits>
 #include <stack>
 #include <vector>
 
@@ -48,25 +38,25 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  * bit indicating if the points is present in the generalization.
  * Note: points may also be pre-selected*/
 
+struct FixedPointCoordinate;
 struct SegmentInformation;
 
-class DouglasPeucker {
-private:
-    typedef std::pair<std::size_t, std::size_t> PairOfPoints;
-    //Stack to simulate the recursion
-    std::stack<PairOfPoints> recursion_stack;
+class DouglasPeucker
+{
+  private:
+    std::vector<double> douglas_peucker_thresholds;
 
-    double ComputeDistance(
-        const FixedPointCoordinate& point,
-        const FixedPointCoordinate& segA,
-        const FixedPointCoordinate& segB
-    ) const;
-public:
-    void Run(
-        std::vector<SegmentInformation> & input_geometry,
-        const unsigned zoom_level
-    );
+    typedef std::pair<unsigned, unsigned> GeometryRange;
+    // Stack to simulate the recursion
+    std::stack<GeometryRange> recursion_stack;
 
+    double ComputeDistance(const FixedPointCoordinate &point,
+                           const FixedPointCoordinate &segA,
+                           const FixedPointCoordinate &segB) const;
+
+  public:
+    DouglasPeucker();
+    void Run(std::vector<SegmentInformation> &input_geometry, const unsigned zoom_level);
 };
 
 #endif /* DOUGLASPEUCKER_H_ */

Algorithms/ExtractRouteNames.h

@@ -0,0 +1,142 @@
+/*
+
+Copyright (c) 2013, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+#ifndef EXTRACT_ROUTE_NAMES_H
+#define EXTRACT_ROUTE_NAMES_H
+
+#include <boost/assert.hpp>
+
+#include <algorithm>
+#include <string>
+#include <vector>
+
+struct RouteNames
+{
+    std::string shortest_path_name_1;
+    std::string shortest_path_name_2;
+    std::string alternative_path_name_1;
+    std::string alternative_path_name_2;
+};
+
+// construct routes names
+template <class DataFacadeT, class SegmentT> struct ExtractRouteNames
+{
+    RouteNames operator()(std::vector<SegmentT> &shortest_path_segments,
+                          std::vector<SegmentT> &alternative_path_segments,
+                          const DataFacadeT *facade)
+    {
+        RouteNames route_names;
+
+        SegmentT shortest_segment_1, shortest_segment_2;
+        SegmentT alternative_segment_1, alternative_segment_2;
+
+        auto length_comperator = [](SegmentT a, SegmentT b)
+        { return a.length > b.length; };
+        auto name_id_comperator = [](SegmentT a, SegmentT b)
+        { return a.name_id < b.name_id; };
+
+        if (shortest_path_segments.empty())
+        {
+            return route_names;
+        }
+
+        std::sort(shortest_path_segments.begin(), shortest_path_segments.end(), length_comperator);
+        shortest_segment_1 = shortest_path_segments[0];
+        if (!alternative_path_segments.empty())
+        {
+            std::sort(alternative_path_segments.begin(),
+                      alternative_path_segments.end(),
+                      length_comperator);
+            alternative_segment_1 = alternative_path_segments[0];
+        }
+        std::vector<SegmentT> shortest_path_set_difference(shortest_path_segments.size());
+        std::vector<SegmentT> alternative_path_set_difference(alternative_path_segments.size());
+        std::set_difference(shortest_path_segments.begin(),
+                            shortest_path_segments.end(),
+                            alternative_path_segments.begin(),
+                            alternative_path_segments.end(),
+                            shortest_path_set_difference.begin(),
+                            name_id_comperator);
+        int size_of_difference = shortest_path_set_difference.size();
+        if (size_of_difference)
+        {
+            int i = 0;
+            while (i < size_of_difference &&
+                   shortest_path_set_difference[i].name_id == shortest_path_segments[0].name_id)
+            {
+                ++i;
+            }
+            if (i < size_of_difference)
+            {
+                shortest_segment_2 = shortest_path_set_difference[i];
+            }
+        }
+
+        std::set_difference(alternative_path_segments.begin(),
+                            alternative_path_segments.end(),
+                            shortest_path_segments.begin(),
+                            shortest_path_segments.end(),
+                            alternative_path_set_difference.begin(),
+                            name_id_comperator);
+        size_of_difference = alternative_path_set_difference.size();
+        if (size_of_difference)
+        {
+            int i = 0;
+            while (i < size_of_difference &&
+                   alternative_path_set_difference[i].name_id ==
+                       alternative_path_segments[0].name_id)
+            {
+                ++i;
+            }
+            if (i < size_of_difference)
+            {
+                alternative_segment_2 = alternative_path_set_difference[i];
+            }
+        }
+        if (shortest_segment_1.position > shortest_segment_2.position)
+        {
+            std::swap(shortest_segment_1, shortest_segment_2);
+        }
+        if (alternative_segment_1.position > alternative_segment_2.position)
+        {
+            std::swap(alternative_segment_1, alternative_segment_2);
+        }
+        route_names.shortest_path_name_1 =
+            facade->GetEscapedNameForNameID(shortest_segment_1.name_id);
+        route_names.shortest_path_name_2 =
+            facade->GetEscapedNameForNameID(shortest_segment_2.name_id);
+
+        route_names.alternative_path_name_1 =
+            facade->GetEscapedNameForNameID(alternative_segment_1.name_id);
+        route_names.alternative_path_name_2 =
+            facade->GetEscapedNameForNameID(alternative_segment_2.name_id);
+
+        return route_names;
+    }
+};
+
+#endif // EXTRACT_ROUTE_NAMES_H

Algorithms/IteratorBasedCRC32.h

@@ -33,34 +33,31 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <iostream>
 
 #if defined(__x86_64__)
-    #include <cpuid.h>
+#include <cpuid.h>
 #else
-    #include <boost/crc.hpp>  // for boost::crc_32_type
+#include <boost/crc.hpp> // for boost::crc_32_type
 
-    inline void __get_cpuid(
-        int param,
-        unsigned *eax,
-        unsigned *ebx,
-        unsigned *ecx,
-        unsigned *edx
-    ) { *ecx = 0; }
+inline void __get_cpuid(int param, unsigned *eax, unsigned *ebx, unsigned *ecx, unsigned *edx)
+{
+    *ecx = 0;
+}
 #endif
 
-template<class ContainerT>
-class IteratorbasedCRC32 {
-private:
+template <class ContainerT> class IteratorbasedCRC32
+{
+  private:
     typedef typename ContainerT::iterator IteratorType;
     unsigned crc;
 
     bool use_SSE42_CRC_function;
 
 #if !defined(__x86_64__)
-        boost::crc_optimal<32, 0x1EDC6F41, 0x0, 0x0, true, true> CRC32_processor;
+    boost::crc_optimal<32, 0x1EDC6F41, 0x0, 0x0, true, true> CRC32_processor;
 #endif
-    unsigned SoftwareBasedCRC32( char *str, unsigned len )
+    unsigned SoftwareBasedCRC32(char *str, unsigned len)
     {
 #if !defined(__x86_64__)
-        CRC32_processor.process_bytes( str, len);
+        CRC32_processor.process_bytes(str, len);
         return CRC32_processor.checksum();
 #else
         return 0;
@@ -68,30 +65,28 @@ private:
     }
 
     // adapted from http://byteworm.com/2010/10/13/crc32/
-    unsigned SSE42BasedCRC32( char *str, unsigned len )
+    unsigned SSE42BasedCRC32(char *str, unsigned len)
     {
 #if defined(__x86_64__)
-        unsigned q = len/sizeof(unsigned);
-        unsigned r = len%sizeof(unsigned);
-        unsigned *p = (unsigned*)str;
+        unsigned q = len / sizeof(unsigned);
+        unsigned r = len % sizeof(unsigned);
+        unsigned *p = (unsigned *)str;
 
-        //crc=0;
-        while (q--) {
-            __asm__ __volatile__(
-                    ".byte 0xf2, 0xf, 0x38, 0xf1, 0xf1;"
-                    :"=S"(crc)
-                     :"0"(crc), "c"(*p)
-            );
+        // crc=0;
+        while (q--)
+        {
+            __asm__ __volatile__(".byte 0xf2, 0xf, 0x38, 0xf1, 0xf1;"
+                                 : "=S"(crc)
+                                 : "0"(crc), "c"(*p));
             ++p;
         }
 
-        str=(char*)p;
-        while (r--) {
-            __asm__ __volatile__(
-                    ".byte 0xf2, 0xf, 0x38, 0xf1, 0xf1;"
-                    :"=S"(crc)
-                     :"0"(crc), "c"(*str)
-            );
+        str = (char *)p;
+        while (r--)
+        {
+            __asm__ __volatile__(".byte 0xf2, 0xf, 0x38, 0xf1, 0xf1;"
+                                 : "=S"(crc)
+                                 : "0"(crc), "c"(*str));
             ++str;
         }
 #endif
@@ -102,7 +97,7 @@ private:
     {
         unsigned eax = 0, ebx = 0, ecx = 0, edx = 0;
         // on X64 this calls hardware cpuid(.) instr. otherwise a dummy impl.
-        __get_cpuid( 1, &eax,  &ebx, &ecx, &edx );
+        __get_cpuid(1, &eax, &ebx, &ecx, &edx);
         return ecx;
     }
 
@@ -111,33 +106,34 @@ private:
         static const int SSE42_BIT = 0x00100000;
         const unsigned ecx = cpuid();
         const bool has_SSE42 = ecx & SSE42_BIT;
-        if (has_SSE42) {
+        if (has_SSE42)
+        {
             SimpleLogger().Write() << "using hardware based CRC32 computation";
-        } else {
+        }
+        else
+        {
             SimpleLogger().Write() << "using software based CRC32 computation";
         }
         return has_SSE42;
     }
 
-public:
-    IteratorbasedCRC32() : crc(0)
-    {
-        use_SSE42_CRC_function = DetectNativeCRC32Support();
-    }
+  public:
+    IteratorbasedCRC32() : crc(0) { use_SSE42_CRC_function = DetectNativeCRC32Support(); }
 
-    unsigned operator()( IteratorType iter, const IteratorType end )
+    unsigned operator()(IteratorType iter, const IteratorType end)
     {
         unsigned crc = 0;
-        while(iter != end) {
-            char * data = reinterpret_cast<char*>(&(*iter) );
+        while (iter != end)
+        {
+            char *data = reinterpret_cast<char *>(&(*iter));
 
             if (use_SSE42_CRC_function)
             {
-                crc = SSE42BasedCRC32( data, sizeof(typename ContainerT::value_type) );
+                crc = SSE42BasedCRC32(data, sizeof(typename ContainerT::value_type));
             }
             else
             {
-                crc = SoftwareBasedCRC32( data, sizeof(typename ContainerT::value_type) );
+                crc = SoftwareBasedCRC32(data, sizeof(typename ContainerT::value_type));
             }
             ++iter;
         }

Algorithms/ObjectToBase64.h

@@ -34,7 +34,6 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <boost/archive/iterators/base64_from_binary.hpp>
 #include <boost/archive/iterators/binary_from_base64.hpp>
 #include <boost/archive/iterators/transform_width.hpp>
-#include <boost/foreach.hpp>
 
 #include <algorithm>
 #include <string>

Algorithms/PolylineCompressor.cpp

@@ -26,122 +26,126 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
 #include "PolylineCompressor.h"
+#include "../Util/StringUtil.h"
 
-void PolylineCompressor::encodeVectorSignedNumber(
-    std::vector<int> & numbers,
-    std::string & output
-) const {
-    for(unsigned i = 0; i < numbers.size(); ++i) {
+//TODO: return vector of start indices for each leg
+
+void PolylineCompressor::encodeVectorSignedNumber(std::vector<int> &numbers, std::string &output)
+    const
+{
+    const unsigned end = numbers.size();
+    for (unsigned i = 0; i < end; ++i)
+    {
         numbers[i] <<= 1;
-        if (numbers[i] < 0) {
+        if (numbers[i] < 0)
+        {
             numbers[i] = ~(numbers[i]);
         }
     }
-    for(unsigned i = 0; i < numbers.size(); ++i) {
-        encodeNumber(numbers[i], output);
+    for (const int number: numbers)
+    {
+        encodeNumber(number, output);
     }
 }
 
-void PolylineCompressor::encodeNumber(int number_to_encode, std::string & output) const {
-    while (number_to_encode >= 0x20) {
-        int nextValue = (0x20 | (number_to_encode & 0x1f)) + 63;
-        output += static_cast<char>(nextValue);
-        if(92 == nextValue) {
-            output += static_cast<char>(nextValue);
+void PolylineCompressor::encodeNumber(int number_to_encode, std::string &output) const
+{
+    while (number_to_encode >= 0x20)
+    {
+        int next_value = (0x20 | (number_to_encode & 0x1f)) + 63;
+        output += static_cast<char>(next_value);
+        if (92 == next_value)
+        {
+            output += static_cast<char>(next_value);
         }
         number_to_encode >>= 5;
     }
 
     number_to_encode += 63;
     output += static_cast<char>(number_to_encode);
-    if(92 == number_to_encode) {
+    if (92 == number_to_encode)
+    {
         output += static_cast<char>(number_to_encode);
     }
 }
 
-void PolylineCompressor::printEncodedString(
-    const std::vector<SegmentInformation> & polyline,
-    std::string & output
-) const {
-    std::vector<int> deltaNumbers;
-    output += "\"";
-    if(!polyline.empty()) {
-        FixedPointCoordinate lastCoordinate = polyline[0].location;
-        deltaNumbers.push_back( lastCoordinate.lat );
-        deltaNumbers.push_back( lastCoordinate.lon );
-        for(unsigned i = 1; i < polyline.size(); ++i) {
-            if(!polyline[i].necessary) {
-                continue;
+JSON::String PolylineCompressor::printEncodedString(const std::vector<SegmentInformation> &polyline) const
+{
+    std::string output;
+    std::vector<int> delta_numbers;
+    if (!polyline.empty())
+    {
+        FixedPointCoordinate last_coordinate = polyline[0].location;
+        delta_numbers.emplace_back(last_coordinate.lat);
+        delta_numbers.emplace_back(last_coordinate.lon);
+        for (const auto & segment : polyline)
+        {
+            if (segment.necessary)
+            {
+                int lat_diff = segment.location.lat - last_coordinate.lat;
+                int lon_diff = segment.location.lon - last_coordinate.lon;
+                delta_numbers.emplace_back(lat_diff);
+                delta_numbers.emplace_back(lon_diff);
+                last_coordinate = segment.location;
             }
-            deltaNumbers.push_back(polyline[i].location.lat - lastCoordinate.lat);
-            deltaNumbers.push_back(polyline[i].location.lon - lastCoordinate.lon);
-            lastCoordinate = polyline[i].location;
         }
-        encodeVectorSignedNumber(deltaNumbers, output);
+        encodeVectorSignedNumber(delta_numbers, output);
     }
-    output += "\"";
-
+    JSON::String return_value(output);
+    return return_value;
 }
 
-void PolylineCompressor::printEncodedString(
-    const std::vector<FixedPointCoordinate>& polyline,
-    std::string &output
-) const {
-    std::vector<int> deltaNumbers(2*polyline.size());
-    output += "\"";
-    if(!polyline.empty()) {
-        deltaNumbers[0] = polyline[0].lat;
-        deltaNumbers[1] = polyline[0].lon;
-        for(unsigned i = 1; i < polyline.size(); ++i) {
-            deltaNumbers[(2*i)]   = (polyline[i].lat - polyline[i-1].lat);
-            deltaNumbers[(2*i)+1] = (polyline[i].lon - polyline[i-1].lon);
+JSON::String PolylineCompressor::printEncodedString(const std::vector<FixedPointCoordinate> &polyline) const
+{
+    std::string output;
+    std::vector<int> delta_numbers(2 * polyline.size());
+    if (!polyline.empty())
+    {
+        delta_numbers[0] = polyline[0].lat;
+        delta_numbers[1] = polyline[0].lon;
+        for (unsigned i = 1; i < polyline.size(); ++i)
+        {
+            int lat_diff = polyline[i].lat - polyline[i - 1].lat;
+            int lon_diff = polyline[i].lon - polyline[i - 1].lon;
+            delta_numbers[(2 * i)] = (lat_diff);
+            delta_numbers[(2 * i) + 1] = (lon_diff);
         }
-        encodeVectorSignedNumber(deltaNumbers, output);
+        encodeVectorSignedNumber(delta_numbers, output);
     }
-    output += "\"";
+    JSON::String return_value(output);
+    return return_value;
 }
 
-void PolylineCompressor::printUnencodedString(
-    const std::vector<FixedPointCoordinate> & polyline,
-    std::string & output
-) const {
-    output += "[";
-    std::string tmp;
-    for(unsigned i = 0; i < polyline.size(); i++) {
-        FixedPointCoordinate::convertInternalLatLonToString(polyline[i].lat, tmp);
-        output += "[";
+
+JSON::Array PolylineCompressor::printUnencodedString(const std::vector<FixedPointCoordinate> &polyline) const
+{
+    JSON::Array json_geometry_array;
+    for( const auto & coordinate : polyline)
+    {
+        std::string tmp, output;
+        FixedPointCoordinate::convertInternalLatLonToString(coordinate.lat, tmp);
+        output += (tmp + ",");
+        FixedPointCoordinate::convertInternalLatLonToString(coordinate.lon, tmp);
         output += tmp;
-        FixedPointCoordinate::convertInternalLatLonToString(polyline[i].lon, tmp);
-        output += ", ";
-        output += tmp;
-        output += "]";
-        if( i < polyline.size()-1 ) {
-            output += ",";
-        }
+        json_geometry_array.values.push_back(output);
     }
-    output += "]";
+    return json_geometry_array;
 }
 
-void PolylineCompressor::printUnencodedString(
-    const std::vector<SegmentInformation> & polyline,
-    std::string & output
-) const {
-    output += "[";
-    std::string tmp;
-    for(unsigned i = 0; i < polyline.size(); i++) {
-        if(!polyline[i].necessary) {
-            continue;
-        }
-        FixedPointCoordinate::convertInternalLatLonToString(polyline[i].location.lat, tmp);
-        output += "[";
-        output += tmp;
-        FixedPointCoordinate::convertInternalLatLonToString(polyline[i].location.lon, tmp);
-        output += ", ";
-        output += tmp;
-        output += "]";
-        if( i < polyline.size()-1 ) {
-            output += ",";
+JSON::Array PolylineCompressor::printUnencodedString(const std::vector<SegmentInformation> &polyline) const
+{
+    JSON::Array json_geometry_array;
+    for( const auto & segment : polyline)
+    {
+        if (segment.necessary)
+        {
+            std::string tmp, output;
+            FixedPointCoordinate::convertInternalLatLonToString(segment.location.lat, tmp);
+            output += (tmp + ",");
+            FixedPointCoordinate::convertInternalLatLonToString(segment.location.lon, tmp);
+            output += tmp;
+            json_geometry_array.values.push_back(output);
         }
     }
-    output += "]";
+    return json_geometry_array;
 }

Algorithms/PolylineCompressor.h

@@ -28,42 +28,27 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef POLYLINECOMPRESSOR_H_
 #define POLYLINECOMPRESSOR_H_
 
+#include "../DataStructures/JSONContainer.h"
 #include "../DataStructures/SegmentInformation.h"
-#include "../Util/StringUtil.h"
 
 #include <string>
 #include <vector>
 
-class PolylineCompressor {
-private:
-	void encodeVectorSignedNumber(
-        std::vector<int> & numbers,
-        std::string & output
-    ) const;
+class PolylineCompressor
+{
+  private:
+    void encodeVectorSignedNumber(std::vector<int> &numbers, std::string &output) const;
 
-	void encodeNumber(int number_to_encode, std::string & output) const;
+    void encodeNumber(int number_to_encode, std::string &output) const;
 
-public:
-    void printEncodedString(
-        const std::vector<SegmentInformation> & polyline,
-        std::string & output
-    ) const;
+  public:
+    JSON::String printEncodedString(const std::vector<SegmentInformation> &polyline) const;
 
-    void printEncodedString(
-        const std::vector<FixedPointCoordinate>& polyline,
-        std::string &output
-    ) const;
+    JSON::String printEncodedString(const std::vector<FixedPointCoordinate> &polyline) const;
 
-    void printUnencodedString(
-        const std::vector<FixedPointCoordinate> & polyline,
-        std::string & output
-    ) const;
-
-    void printUnencodedString(
-        const std::vector<SegmentInformation> & polyline,
-        std::string & output
-    ) const;
+    JSON::Array printUnencodedString(const std::vector<FixedPointCoordinate> &polyline) const;
 
+    JSON::Array printUnencodedString(const std::vector<SegmentInformation> &polyline) const;
 };
 
 #endif /* POLYLINECOMPRESSOR_H_ */

Algorithms/StronglyConnectedComponents.h

@@ -28,6 +28,7 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef STRONGLYCONNECTEDCOMPONENTS_H_
 #define STRONGLYCONNECTEDCOMPONENTS_H_
 
+#include "../typedefs.h"
 #include "../DataStructures/DeallocatingVector.h"
 #include "../DataStructures/DynamicGraph.h"
 #include "../DataStructures/ImportEdge.h"
@@ -37,190 +38,174 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../DataStructures/TurnInstructions.h"
 
 #include "../Util/SimpleLogger.h"
+#include "../Util/StdHashExtensions.h"
 
 #include <osrm/Coordinate.h>
 
 #include <boost/assert.hpp>
 #include <boost/filesystem.hpp>
-#include <boost/foreach.hpp>
-#include <boost/integer.hpp>
-#include <boost/make_shared.hpp>
-#include <boost/unordered_map.hpp>
-#include <boost/unordered_set.hpp>
 
 #ifdef __APPLE__
-    #include <gdal.h>
-    #include <ogrsf_frmts.h>
+#include <gdal.h>
+#include <ogrsf_frmts.h>
 #else
-    #include <gdal/gdal.h>
-    #include <gdal/ogrsf_frmts.h>
+#include <gdal/gdal.h>
+#include <gdal/ogrsf_frmts.h>
 #endif
 
+#include <cstdint>
+
+#include <memory>
 #include <stack>
+#include <unordered_map>
+#include <unordered_set>
 #include <vector>
 
-class TarjanSCC {
-private:
-
-    struct TarjanNode {
-        TarjanNode() : index(UINT_MAX), lowlink(UINT_MAX), onStack(false) {}
+class TarjanSCC
+{
+  private:
+    struct TarjanNode
+    {
+        TarjanNode() : index(UINT_MAX), low_link(UINT_MAX), on_stack(false) {}
         unsigned index;
-        unsigned lowlink;
-        bool onStack;
+        unsigned low_link;
+        bool on_stack;
     };
 
-    struct TarjanEdgeData {
+    struct TarjanEdgeData
+    {
         int distance;
-        unsigned nameID:31;
-        bool shortcut:1;
+        unsigned name_id : 31;
+        bool shortcut : 1;
         short type;
-        bool isAccessRestricted:1;
-        bool forward:1;
-        bool backward:1;
-        bool roundabout:1;
-        bool ignoreInGrid:1;
-        bool reversedEdge:1;
+        bool forward : 1;
+        bool backward : 1;
+        bool reversedEdge : 1;
     };
 
-    struct TarjanStackFrame {
-        explicit TarjanStackFrame(
-            NodeID v,
-            NodeID parent
-        ) : v(v), parent(parent) { }
+    struct TarjanStackFrame
+    {
+        explicit TarjanStackFrame(NodeID v, NodeID parent) : v(v), parent(parent) {}
         NodeID v;
         NodeID parent;
     };
 
-    typedef DynamicGraph<TarjanEdgeData>        TarjanDynamicGraph;
-    typedef TarjanDynamicGraph::InputEdge       TarjanEdge;
-    typedef std::pair<NodeID, NodeID>           RestrictionSource;
-    typedef std::pair<NodeID, bool>             restriction_target;
-    typedef std::vector<restriction_target>      EmanatingRestrictionsVector;
-    typedef boost::unordered_map<RestrictionSource, unsigned> RestrictionMap;
+    typedef DynamicGraph<TarjanEdgeData> TarjanDynamicGraph;
+    typedef TarjanDynamicGraph::InputEdge TarjanEdge;
+    typedef std::pair<NodeID, NodeID> RestrictionSource;
+    typedef std::pair<NodeID, bool> restriction_target;
+    typedef std::vector<restriction_target> EmanatingRestrictionsVector;
+    typedef std::unordered_map<RestrictionSource, unsigned> RestrictionMap;
 
-    std::vector<NodeInfo>                       m_coordinate_list;
-    std::vector<EmanatingRestrictionsVector>    m_restriction_bucket_list;
-    boost::shared_ptr<TarjanDynamicGraph>       m_node_based_graph;
-    boost::unordered_set<NodeID>                m_barrier_node_list;
-    boost::unordered_set<NodeID>                m_traffic_light_list;
-    unsigned                                    m_restriction_counter;
-    RestrictionMap                              m_restriction_map;
+    std::vector<NodeInfo> m_coordinate_list;
+    std::vector<EmanatingRestrictionsVector> m_restriction_bucket_list;
+    std::shared_ptr<TarjanDynamicGraph> m_node_based_graph;
+    std::unordered_set<NodeID> m_barrier_node_list;
+    std::unordered_set<NodeID> m_traffic_light_list;
+    unsigned m_restriction_counter;
+    RestrictionMap m_restriction_map;
 
-    struct EdgeBasedNode {
-        bool operator<(const EdgeBasedNode & other) const {
-            return other.id < id;
-        }
-        bool operator==(const EdgeBasedNode & other) const {
-            return id == other.id;
-        }
-        NodeID id;
-        int lat1;
-        int lat2;
-        int lon1;
-        int lon2:31;
-        bool belongsToTinyComponent:1;
-        NodeID nameID;
-        unsigned weight:31;
-        bool ignoreInGrid:1;
-    };
-
-public:
-    TarjanSCC(
-        int number_of_nodes,
-        std::vector<NodeBasedEdge> & input_edges,
-        std::vector<NodeID> & bn,
-        std::vector<NodeID> & tl,
-        std::vector<TurnRestriction> & irs,
-        std::vector<NodeInfo> & nI
-    ) :
-        m_coordinate_list(nI),
-        m_restriction_counter(irs.size())
+  public:
+    TarjanSCC(int number_of_nodes,
+              std::vector<NodeBasedEdge> &input_edges,
+              std::vector<NodeID> &bn,
+              std::vector<NodeID> &tl,
+              std::vector<TurnRestriction> &irs,
+              std::vector<NodeInfo> &nI)
+        : m_coordinate_list(nI), m_restriction_counter(irs.size())
     {
-        BOOST_FOREACH(const TurnRestriction & restriction, irs) {
-            std::pair<NodeID, NodeID> restrictionSource = std::make_pair(
-                restriction.fromNode, restriction.viaNode
-            );
+        for (const TurnRestriction &restriction : irs)
+        {
+            std::pair<NodeID, NodeID> restrictionSource = {restriction.fromNode,
+                                                           restriction.viaNode};
             unsigned index;
-            RestrictionMap::iterator restriction_iterator = m_restriction_map.find(restrictionSource);
-            if(restriction_iterator == m_restriction_map.end()) {
+            RestrictionMap::iterator restriction_iterator =
+                m_restriction_map.find(restrictionSource);
+            if (restriction_iterator == m_restriction_map.end())
+            {
                 index = m_restriction_bucket_list.size();
-                m_restriction_bucket_list.resize(index+1);
-                m_restriction_map.insert(std::make_pair(restrictionSource, index));
-            } else {
+                m_restriction_bucket_list.resize(index + 1);
+                m_restriction_map.emplace(restrictionSource, index);
+            }
+            else
+            {
                 index = restriction_iterator->second;
-                //Map already contains an is_only_*-restriction
-                if(m_restriction_bucket_list.at(index).begin()->second) {
+                // Map already contains an is_only_*-restriction
+                if (m_restriction_bucket_list.at(index).begin()->second)
+                {
                     continue;
-                } else if(restriction.flags.isOnly) {
-                    //We are going to insert an is_only_*-restriction. There can be only one.
+                }
+                else if (restriction.flags.isOnly)
+                {
+                    // We are going to insert an is_only_*-restriction. There can be only one.
                     m_restriction_bucket_list.at(index).clear();
                 }
             }
 
-            m_restriction_bucket_list.at(index).push_back(
-                std::make_pair(restriction.toNode, restriction.flags.isOnly)
-            );
+            m_restriction_bucket_list.at(index)
+                .emplace_back(restriction.toNode, restriction.flags.isOnly);
         }
 
         m_barrier_node_list.insert(bn.begin(), bn.end());
         m_traffic_light_list.insert(tl.begin(), tl.end());
 
-        DeallocatingVector< TarjanEdge > edge_list;
-        BOOST_FOREACH(const NodeBasedEdge & input_edge, input_edges) {
+        DeallocatingVector<TarjanEdge> edge_list;
+        for (const NodeBasedEdge &input_edge : input_edges)
+        {
+            if (input_edge.source() == input_edge.target())
+            {
+                continue;
+            }
+
             TarjanEdge edge;
-            if(!input_edge.isForward()) {
-                edge.source = input_edge.target();
-                edge.target = input_edge.source();
-                edge.data.backward = input_edge.isForward();
-                edge.data.forward = input_edge.isBackward();
-            } else {
+            if (input_edge.isForward())
+            {
                 edge.source = input_edge.source();
                 edge.target = input_edge.target();
                 edge.data.forward = input_edge.isForward();
                 edge.data.backward = input_edge.isBackward();
             }
-            if(edge.source == edge.target) {
-                continue;
+            else
+            {
+                edge.source = input_edge.target();
+                edge.target = input_edge.source();
+                edge.data.backward = input_edge.isForward();
+                edge.data.forward = input_edge.isBackward();
             }
 
-            edge.data.distance = (std::max)((int)input_edge.weight(), 1 );
-            BOOST_ASSERT( edge.data.distance > 0 );
+            edge.data.distance = (std::max)((int)input_edge.weight(), 1);
+            BOOST_ASSERT(edge.data.distance > 0);
             edge.data.shortcut = false;
-            edge.data.roundabout = input_edge.isRoundabout();
-            edge.data.ignoreInGrid = input_edge.ignoreInGrid();
-            edge.data.nameID = input_edge.name();
+            // edge.data.roundabout = input_edge.isRoundabout();
+            // edge.data.ignoreInGrid = input_edge.ignoreInGrid();
+            edge.data.name_id = input_edge.name();
             edge.data.type = input_edge.type();
-            edge.data.isAccessRestricted = input_edge.isAccessRestricted();
+            // edge.data.isAccessRestricted = input_edge.isAccessRestricted();
             edge.data.reversedEdge = false;
-            edge_list.push_back( edge );
-            if( edge.data.backward ) {
-                std::swap( edge.source, edge.target );
+            edge_list.push_back(edge);
+            if (edge.data.backward)
+            {
+                std::swap(edge.source, edge.target);
                 edge.data.forward = input_edge.isBackward();
                 edge.data.backward = input_edge.isForward();
                 edge.data.reversedEdge = true;
-                edge_list.push_back( edge );
+                edge_list.push_back(edge);
             }
         }
         std::vector<NodeBasedEdge>().swap(input_edges);
-        BOOST_ASSERT_MSG(
-            0 == input_edges.size() && 0 == input_edges.capacity(),
-            "input edge vector not properly deallocated"
-        );
+        BOOST_ASSERT_MSG(0 == input_edges.size() && 0 == input_edges.capacity(),
+                         "input edge vector not properly deallocated");
 
-        std::sort( edge_list.begin(), edge_list.end() );
+        std::sort(edge_list.begin(), edge_list.end());
 
-        m_node_based_graph = boost::make_shared<TarjanDynamicGraph>(
-            number_of_nodes,
-            edge_list
-        );
+        m_node_based_graph = std::make_shared<TarjanDynamicGraph>(number_of_nodes, edge_list);
     }
 
-    ~TarjanSCC() {
-        m_node_based_graph.reset();
-    }
+    ~TarjanSCC() { m_node_based_graph.reset(); }
 
-    void Run() {
-        //remove files from previous run if exist
+    void Run()
+    {
+        // remove files from previous run if exist
         DeleteFileIfExists("component.dbf");
         DeleteFileIfExists("component.shx");
         DeleteFileIfExists("component.shp");
@@ -230,121 +215,107 @@ public:
         OGRRegisterAll();
 
         const char *pszDriverName = "ESRI Shapefile";
-        OGRSFDriver * poDriver = OGRSFDriverRegistrar::GetRegistrar()->
-            GetDriverByName( pszDriverName );
-        if( NULL == poDriver ) {
+        OGRSFDriver *poDriver =
+            OGRSFDriverRegistrar::GetRegistrar()->GetDriverByName(pszDriverName);
+        if (NULL == poDriver)
+        {
             throw OSRMException("ESRI Shapefile driver not available");
         }
-        OGRDataSource * poDS = poDriver->CreateDataSource(
-            "component.shp",
-            NULL
-        );
+        OGRDataSource *poDS = poDriver->CreateDataSource("component.shp", NULL);
 
-        if( NULL == poDS ) {
+        if (NULL == poDS)
+        {
             throw OSRMException("Creation of output file failed");
         }
 
-        OGRLayer * poLayer = poDS->CreateLayer(
-            "component",
-            NULL,
-            wkbLineString,
-            NULL
-        );
+        OGRLayer *poLayer = poDS->CreateLayer("component", NULL, wkbLineString, NULL);
 
-        if( NULL == poLayer ) {
+        if (NULL == poLayer)
+        {
             throw OSRMException("Layer creation failed.");
         }
 
-        //The following is a hack to distinguish between stuff that happens
-        //before the recursive call and stuff that happens after
-        std::stack<std::pair<bool, TarjanStackFrame> > recursion_stack;
-        //true = stuff before, false = stuff after call
+        // The following is a hack to distinguish between stuff that happens
+        // before the recursive call and stuff that happens after
+        std::stack<std::pair<bool, TarjanStackFrame>> recursion_stack;
+        // true = stuff before, false = stuff after call
         std::stack<NodeID> tarjan_stack;
-        std::vector<unsigned> components_index(
-            m_node_based_graph->GetNumberOfNodes(),
-            UINT_MAX
-        );
+        std::vector<unsigned> components_index(m_node_based_graph->GetNumberOfNodes(), UINT_MAX);
         std::vector<NodeID> component_size_vector;
-        std::vector<TarjanNode> tarjan_node_list(
-            m_node_based_graph->GetNumberOfNodes()
-        );
+        std::vector<TarjanNode> tarjan_node_list(m_node_based_graph->GetNumberOfNodes());
         unsigned component_index = 0, size_of_current_component = 0;
         int index = 0;
-        for(
-            NodeID node = 0, last_node = m_node_based_graph->GetNumberOfNodes();
-            node < last_node;
-            ++node
-        ) {
-            if(UINT_MAX == components_index[node]) {
-                recursion_stack.push(
-                    std::make_pair(true, TarjanStackFrame(node,node))
-                );
+        NodeID last_node = m_node_based_graph->GetNumberOfNodes();
+        for (NodeID node = 0; node < last_node; ++node)
+        {
+            if (UINT_MAX == components_index[node])
+            {
+                recursion_stack.emplace(true, TarjanStackFrame(node, node));
             }
 
-            while(!recursion_stack.empty()) {
-                bool before_recursion = recursion_stack.top().first;
+            while (!recursion_stack.empty())
+            {
+                const bool before_recursion = recursion_stack.top().first;
                 TarjanStackFrame currentFrame = recursion_stack.top().second;
                 NodeID v = currentFrame.v;
                 recursion_stack.pop();
 
-                if(before_recursion) {
-                    //Mark frame to handle tail of recursion
-                    recursion_stack.push(std::make_pair(false, currentFrame));
+                if (before_recursion)
+                {
+                    // Mark frame to handle tail of recursion
+                    recursion_stack.emplace(false, currentFrame);
 
-                    //Mark essential information for SCC
+                    // Mark essential information for SCC
                     tarjan_node_list[v].index = index;
-                    tarjan_node_list[v].lowlink = index;
+                    tarjan_node_list[v].low_link = index;
                     tarjan_stack.push(v);
-                    tarjan_node_list[v].onStack = true;
+                    tarjan_node_list[v].on_stack = true;
                     ++index;
 
-                    //Traverse outgoing edges
-                    for(
-                        TarjanDynamicGraph::EdgeIterator e2 = m_node_based_graph->BeginEdges(v);
-                        e2 < m_node_based_graph->EndEdges(v);
-                        ++e2
-                    ) {
+                    // Traverse outgoing edges
+                    for (auto e2 : m_node_based_graph->GetAdjacentEdgeRange(v))
+                    {
                         const TarjanDynamicGraph::NodeIterator vprime =
                             m_node_based_graph->GetTarget(e2);
-                        if(UINT_MAX == tarjan_node_list[vprime].index) {
-                            recursion_stack.push(
-                                std::make_pair(
-                                    true,
-                                    TarjanStackFrame(vprime, v)
-                                )
-                            );
-                        } else {
-                            if(
-                                tarjan_node_list[vprime].onStack &&
-                                tarjan_node_list[vprime].index < tarjan_node_list[v].lowlink
-                            ) {
-                                tarjan_node_list[v].lowlink = tarjan_node_list[vprime].index;
+                        if (UINT_MAX == tarjan_node_list[vprime].index)
+                        {
+                            recursion_stack.emplace(true, TarjanStackFrame(vprime, v));
+                        }
+                        else
+                        {
+                            if (tarjan_node_list[vprime].on_stack &&
+                                tarjan_node_list[vprime].index < tarjan_node_list[v].low_link)
+                            {
+                                tarjan_node_list[v].low_link = tarjan_node_list[vprime].index;
                             }
                         }
                     }
-                } else {
-                    tarjan_node_list[currentFrame.parent].lowlink =
-                        std::min(
-                            tarjan_node_list[currentFrame.parent].lowlink,
-                            tarjan_node_list[v].lowlink
-                        );
-                    //after recursion, lets do cycle checking
-                    //Check if we found a cycle. This is the bottom part of the recursion
-                    if(tarjan_node_list[v].lowlink == tarjan_node_list[v].index) {
+                }
+                else
+                {
+                    tarjan_node_list[currentFrame.parent].low_link =
+                        std::min(tarjan_node_list[currentFrame.parent].low_link,
+                                 tarjan_node_list[v].low_link);
+                    // after recursion, lets do cycle checking
+                    // Check if we found a cycle. This is the bottom part of the recursion
+                    if (tarjan_node_list[v].low_link == tarjan_node_list[v].index)
+                    {
                         NodeID vprime;
-                        do {
-                            vprime = tarjan_stack.top(); tarjan_stack.pop();
-                            tarjan_node_list[vprime].onStack = false;
+                        do
+                        {
+                            vprime = tarjan_stack.top();
+                            tarjan_stack.pop();
+                            tarjan_node_list[vprime].on_stack = false;
                             components_index[vprime] = component_index;
                             ++size_of_current_component;
-                        } while( v != vprime);
+                        } while (v != vprime);
 
-                        component_size_vector.push_back(size_of_current_component);
+                        component_size_vector.emplace_back(size_of_current_component);
 
-                        if(size_of_current_component > 1000) {
-                            SimpleLogger().Write() <<
-                            "large component [" << component_index << "]=" <<
-                            size_of_current_component;
+                        if (size_of_current_component > 1000)
+                        {
+                            SimpleLogger().Write() << "large component [" << component_index
+                                                   << "]=" << size_of_current_component;
                         }
 
                         ++component_index;
@@ -354,115 +325,101 @@ public:
             }
         }
 
-        SimpleLogger().Write() <<
-            "identified: " << component_size_vector.size() <<
-            " many components, marking small components";
+        SimpleLogger().Write() << "identified: " << component_size_vector.size()
+                               << " many components, marking small components";
 
         // TODO/C++11: prime candidate for lambda function
-        unsigned size_one_counter = 0;
-        for(unsigned i = 0, end = component_size_vector.size(); i < end; ++i){
-            if(1 == component_size_vector[i]) {
-                ++size_one_counter;
-            }
-        }
+        // unsigned size_one_counter = 0;
+        // for (unsigned i = 0, end = component_size_vector.size(); i < end; ++i)
+        // {
+        //     if (1 == component_size_vector[i])
+        //     {
+        //         ++size_one_counter;
+        //     }
+        // }
+        unsigned size_one_counter = std::count_if(component_size_vector.begin(),
+                                                  component_size_vector.end(),
+                                                  [] (unsigned value) { return 1 == value;});
 
-        SimpleLogger().Write() <<
-            "identified " << size_one_counter << " SCCs of size 1";
+        SimpleLogger().Write() << "identified " << size_one_counter << " SCCs of size 1";
 
         uint64_t total_network_distance = 0;
         p.reinit(m_node_based_graph->GetNumberOfNodes());
-        for(
-            TarjanDynamicGraph::NodeIterator u = 0, last_u_node = m_node_based_graph->GetNumberOfNodes();
-            u < last_u_node;
-            ++u
-         ) {
+        NodeID last_u_node = m_node_based_graph->GetNumberOfNodes();
+        for (NodeID u = 0; u < last_u_node; ++u)
+        {
             p.printIncrement();
-            for(
-                TarjanDynamicGraph::EdgeIterator e1 = m_node_based_graph->BeginEdges(u), last_edge = m_node_based_graph->EndEdges(u);
-                e1 < last_edge;
-                ++e1
-            ) {
-                if(!m_node_based_graph->GetEdgeData(e1).reversedEdge) {
+            for (auto e1 : m_node_based_graph->GetAdjacentEdgeRange(u))
+            {
+                if (!m_node_based_graph->GetEdgeData(e1).reversedEdge)
+                {
                     continue;
                 }
                 const TarjanDynamicGraph::NodeIterator v = m_node_based_graph->GetTarget(e1);
 
-                total_network_distance += 100*FixedPointCoordinate::ApproximateDistance(
-                        m_coordinate_list[u].lat,
-                        m_coordinate_list[u].lon,
-                        m_coordinate_list[v].lat,
-                        m_coordinate_list[v].lon
-                );
+                total_network_distance +=
+                    100 * FixedPointCoordinate::ApproximateDistance(m_coordinate_list[u].lat,
+                                                                    m_coordinate_list[u].lon,
+                                                                    m_coordinate_list[v].lat,
+                                                                    m_coordinate_list[v].lon);
 
-                if( SHRT_MAX != m_node_based_graph->GetEdgeData(e1).type ) {
+                if (SHRT_MAX != m_node_based_graph->GetEdgeData(e1).type)
+                {
                     BOOST_ASSERT(e1 != UINT_MAX);
                     BOOST_ASSERT(u != UINT_MAX);
                     BOOST_ASSERT(v != UINT_MAX);
 
                     const unsigned size_of_containing_component =
-                        std::min(
-                            component_size_vector[components_index[u]],
-                            component_size_vector[components_index[v]]
-                        );
+                        std::min(component_size_vector[components_index[u]],
+                                 component_size_vector[components_index[v]]);
 
-                    //edges that end on bollard nodes may actually be in two distinct components
-                    if(size_of_containing_component < 10) {
+                    // edges that end on bollard nodes may actually be in two distinct components
+                    if (size_of_containing_component < 10)
+                    {
                         OGRLineString lineString;
-                        lineString.addPoint(
-                            m_coordinate_list[u].lon/COORDINATE_PRECISION,
-                            m_coordinate_list[u].lat/COORDINATE_PRECISION
-                        );
-                        lineString.addPoint(
-                            m_coordinate_list[v].lon/COORDINATE_PRECISION,
-                            m_coordinate_list[v].lat/COORDINATE_PRECISION
-                        );
+                        lineString.addPoint(m_coordinate_list[u].lon / COORDINATE_PRECISION,
+                                            m_coordinate_list[u].lat / COORDINATE_PRECISION);
+                        lineString.addPoint(m_coordinate_list[v].lon / COORDINATE_PRECISION,
+                                            m_coordinate_list[v].lat / COORDINATE_PRECISION);
 
-                        OGRFeature * poFeature = OGRFeature::CreateFeature(
-                            poLayer->GetLayerDefn()
-                        );
+                        OGRFeature *poFeature = OGRFeature::CreateFeature(poLayer->GetLayerDefn());
 
-                        poFeature->SetGeometry( &lineString );
-                        if( OGRERR_NONE != poLayer->CreateFeature(poFeature) ) {
-                            throw OSRMException(
-                                "Failed to create feature in shapefile."
-                            );
+                        poFeature->SetGeometry(&lineString);
+                        if (OGRERR_NONE != poLayer->CreateFeature(poFeature))
+                        {
+                            throw OSRMException("Failed to create feature in shapefile.");
                         }
-                        OGRFeature::DestroyFeature( poFeature );
+                        OGRFeature::DestroyFeature(poFeature);
                     }
                 }
             }
         }
-        OGRDataSource::DestroyDataSource( poDS );
+        OGRDataSource::DestroyDataSource(poDS);
         std::vector<NodeID>().swap(component_size_vector);
-        BOOST_ASSERT_MSG(
-            0 == component_size_vector.size() &&
-            0 == component_size_vector.capacity(),
-            "component_size_vector not properly deallocated"
-        );
+        BOOST_ASSERT_MSG(0 == component_size_vector.size() && 0 == component_size_vector.capacity(),
+                         "component_size_vector not properly deallocated");
 
         std::vector<NodeID>().swap(components_index);
-        BOOST_ASSERT_MSG(
-            0 == components_index.size() && 0 == components_index.capacity(),
-            "icomponents_index not properly deallocated"
-        );
+        BOOST_ASSERT_MSG(0 == components_index.size() && 0 == components_index.capacity(),
+                         "icomponents_index not properly deallocated");
 
-        SimpleLogger().Write()
-            << "total network distance: " <<
-             (uint64_t)total_network_distance/100/1000. <<
-            " km";
+        SimpleLogger().Write() << "total network distance: " << (uint64_t)total_network_distance /
+                                                                    100 / 1000. << " km";
     }
 
-private:
-    unsigned CheckForEmanatingIsOnlyTurn(const NodeID u, const NodeID v) const {
-        std::pair < NodeID, NodeID > restriction_source = std::make_pair(u, v);
-        RestrictionMap::const_iterator restriction_iterator = m_restriction_map.find(restriction_source);
-        if (restriction_iterator != m_restriction_map.end()) {
+  private:
+    unsigned CheckForEmanatingIsOnlyTurn(const NodeID u, const NodeID v) const
+    {
+        std::pair<NodeID, NodeID> restriction_source = {u, v};
+        RestrictionMap::const_iterator restriction_iterator =
+            m_restriction_map.find(restriction_source);
+        if (restriction_iterator != m_restriction_map.end())
+        {
             const unsigned index = restriction_iterator->second;
-            BOOST_FOREACH(
-                const RestrictionSource & restriction_target,
-                m_restriction_bucket_list.at(index)
-            ) {
-                if(restriction_target.second) {
+            for (const RestrictionSource &restriction_target : m_restriction_bucket_list.at(index))
+            {
+                if (restriction_target.second)
+                {
                     return restriction_target.first;
                 }
             }
@@ -470,21 +427,19 @@ private:
         return UINT_MAX;
     }
 
-    bool CheckIfTurnIsRestricted(
-        const NodeID u,
-        const NodeID v,
-        const NodeID w
-    ) const {
-        //only add an edge if turn is not a U-turn except it is the end of dead-end street.
-        std::pair < NodeID, NodeID > restriction_source = std::make_pair(u, v);
-        RestrictionMap::const_iterator restriction_iterator = m_restriction_map.find(restriction_source);
-        if (restriction_iterator != m_restriction_map.end()) {
+    bool CheckIfTurnIsRestricted(const NodeID u, const NodeID v, const NodeID w) const
+    {
+        // only add an edge if turn is not a U-turn except it is the end of dead-end street.
+        std::pair<NodeID, NodeID> restriction_source = {u, v};
+        RestrictionMap::const_iterator restriction_iterator =
+            m_restriction_map.find(restriction_source);
+        if (restriction_iterator != m_restriction_map.end())
+        {
             const unsigned index = restriction_iterator->second;
-            BOOST_FOREACH(
-                const restriction_target & restriction_target,
-                m_restriction_bucket_list.at(index)
-            ) {
-                if(w == restriction_target.first) {
+            for (const restriction_target &restriction_target : m_restriction_bucket_list.at(index))
+            {
+                if (w == restriction_target.first)
+                {
                     return true;
                 }
             }
@@ -492,8 +447,10 @@ private:
         return false;
     }
 
-    void DeleteFileIfExists(const std::string & file_name) const {
-        if (boost::filesystem::exists(file_name) ) {
+    void DeleteFileIfExists(const std::string &file_name) const
+    {
+        if (boost::filesystem::exists(file_name))
+        {
             boost::filesystem::remove(file_name);
         }
     }

CMakeLists.txt

@@ -1,4 +1,4 @@
-cmake_minimum_required(VERSION 2.6)
+cmake_minimum_required(VERSION 2.8)
 project(OSRM)
 set(CMAKE_EXPORT_COMPILE_COMMANDS ON)
 include(CheckCXXCompilerFlag)
@@ -41,13 +41,13 @@ file(GLOB ExtractorGlob Extractor/*.cpp)
 set(ExtractorSources extractor.cpp ${ExtractorGlob})
 add_executable(osrm-extract ${ExtractorSources})
 
-file(GLOB PrepareGlob Contractor/*.cpp DataStructures/HilbertValue.cpp)
+file(GLOB PrepareGlob Contractor/*.cpp DataStructures/HilbertValue.cpp DataStructures/RestrictionMap.cpp)
 set(PrepareSources prepare.cpp ${PrepareGlob})
 add_executable(osrm-prepare ${PrepareSources})
 
 file(GLOB ServerGlob Server/*.cpp)
 file(GLOB DescriptorGlob Descriptors/*.cpp)
-file(GLOB DatastructureGlob DataStructures/SearchEngineData.cpp)
+file(GLOB DatastructureGlob DataStructures/SearchEngineData.cpp DataStructures/RouteParameters.cpp)
 file(GLOB CoordinateGlob DataStructures/Coordinate.cpp)
 file(GLOB AlgorithmGlob Algorithms/*.cpp)
 file(GLOB HttpGlob Server/Http/*.cpp)
@@ -86,7 +86,21 @@ if(CMAKE_BUILD_TYPE MATCHES Debug)
   endif()
 endif()
 if(CMAKE_BUILD_TYPE MATCHES Release)
-    message(STATUS "Configuring OSRM in release mode")
+  message(STATUS "Configuring OSRM in release mode")
+  # Check if LTO is available
+  set(LTO_FLAGS "")
+  CHECK_CXX_COMPILER_FLAG("-flto" HAS_LTO_FLAG)
+  if (HAS_LTO_FLAG)
+    set(LTO_FLAGS "${LTO_FLAGS} -flto")
+
+    # Since gcc 4.9 the LTO format is non-standart ('slim'), so we need to use the build-in tools
+    if ("${CMAKE_CXX_COMPILER_ID}" STREQUAL "GNU" AND
+        NOT "${CMAKE_CXX_COMPILER_VERSION}" VERSION_LESS "4.9.0")
+      message(STATUS "Using gcc specific binutils for LTO.")
+      set(CMAKE_AR     "/usr/bin/gcc-ar")
+      set(CMAKE_RANLIB "/usr/bin/gcc-ranlib")
+    endif()
+  endif (HAS_LTO_FLAG)
 endif()
 
 # Configuring compilers
@@ -104,13 +118,6 @@ elseif("${CMAKE_CXX_COMPILER_ID}" STREQUAL "MSVC")
   # using Visual Studio C++
 endif()
 
-# Check if LTO is available
-set(LTO_FLAGS "")
-CHECK_CXX_COMPILER_FLAG("-flto" HAS_LTO_FLAG)
-if    (HAS_LTO_FLAG)
-  set(LTO_FLAGS "${LTO_FLAGS} -flto")
-endif (HAS_LTO_FLAG)
-
 # disable partitioning of LTO process when possible (fixes Debian issues)
 set(LTO_PARTITION_FLAGS "")
 CHECK_CXX_COMPILER_FLAG("-flto-partition=none" HAS_LTO_PARTITION_FLAG)
@@ -118,21 +125,27 @@ if    (HAS_LTO_PARTITION_FLAG)
   set(LTO_PARTITION_FLAGS "${LTO_PARTITION_FLAGS} -flto-partition=none")
 endif (HAS_LTO_PARTITION_FLAG)
 
-# Add Link-Time-Optimization flags, if supported (GCC >= 4.5) and enabled
+# Add Link-Time-Optimization flags, if supported (GCC >= 4.7) and enabled
 set(CMAKE_CXX_FLAGS           "${CMAKE_CXX_FLAGS}           ${LTO_FLAGS}")
 set(CMAKE_EXE_LINKER_FLAGS    "${CMAKE_EXE_LINKER_FLAGS}    ${LTO_FLAGS} ${LTO_PARTITION_FLAGS}")
 set(CMAKE_MODULE_LINKER_FLAGS "${CMAKE_MODULE_LINKER_FLAGS} ${LTO_FLAGS} ${LTO_PARTITION_FLAGS}")
 
+# Activate C++11
+ADD_DEFINITIONS(
+    -std=c++11 # Or -std=c++0x
+    # Other flags
+)
+
 # Configuring other platform dependencies
 if(APPLE)
   set(CMAKE_OSX_ARCHITECTURES "x86_64")
   message(STATUS "Set Architecture to x64 on OS X")
   exec_program(uname ARGS -v  OUTPUT_VARIABLE DARWIN_VERSION)
   string(REGEX MATCH "[0-9]+" DARWIN_VERSION ${DARWIN_VERSION})
-  if(DARWIN_VERSION GREATER 12 AND NOT OSXLIBSTD)
-    message(STATUS "Activating -std=c++11 flag for >= OS X 10.9")
-    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
-  endif()
+#  if(DARWIN_VERSION GREATER 12 AND NOT OSXLIBSTD)
+#    message(STATUS "Activating -std=c++11 flag for >= OS X 10.9")
+#    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
+#  endif()
   if(OSXLIBSTD)
     message(STATUS "linking against ${OSXLIBSTD}")
     set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -stdlib=${OSXLIBSTD}")
@@ -148,10 +161,10 @@ if(UNIX AND NOT APPLE)
 endif()
 
 #Check Boost
-set(BOOST_MIN_VERSION "1.46.0")
+set(BOOST_MIN_VERSION "1.49.0")
 find_package(Boost ${BOOST_MIN_VERSION} COMPONENTS ${BOOST_COMPONENTS} REQUIRED)
 if(NOT Boost_FOUND)
-  message(FATAL_ERROR "Fatal error: Boost (version >= 1.46.0) required.\n")
+  message(FATAL_ERROR "Fatal error: Boost (version >= 1.49.0) required.\n")
 endif()
 include_directories(${Boost_INCLUDE_DIRS})
 
@@ -223,7 +236,7 @@ if(WITH_TOOLS)
   message(STATUS "Activating OSRM internal tools")
   find_package(GDAL)
   if(GDAL_FOUND)
-    add_executable(osrm-components Tools/componentAnalysis.cpp)
+    add_executable(osrm-components Tools/components.cpp)
     include_directories(${GDAL_INCLUDE_DIR})
     target_link_libraries(
       osrm-components

Contractor/EdgeBasedGraphFactory.h

@@ -34,178 +34,93 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../DataStructures/DeallocatingVector.h"
 #include "../DataStructures/DynamicGraph.h"
 #include "../DataStructures/EdgeBasedNode.h"
-#include "../DataStructures/HashTable.h"
-#include "../DataStructures/ImportEdge.h"
 #include "../DataStructures/OriginalEdgeData.h"
-#include "../DataStructures/Percent.h"
-#include "../DataStructures/QueryEdge.h"
 #include "../DataStructures/QueryNode.h"
 #include "../DataStructures/TurnInstructions.h"
 #include "../DataStructures/Restriction.h"
-#include "../Util/LuaUtil.h"
-#include "../Util/SimpleLogger.h"
-
+#include "../DataStructures/NodeBasedGraph.h"
+#include "../DataStructures/RestrictionMap.h"
 #include "GeometryCompressor.h"
 
-#include <boost/noncopyable.hpp>
-#include <boost/shared_ptr.hpp>
-#include <boost/unordered_map.hpp>
-#include <boost/unordered_set.hpp>
-
 #include <algorithm>
 #include <iosfwd>
+#include <memory>
 #include <queue>
+#include <string>
+#include <unordered_map>
+#include <unordered_set>
 #include <vector>
 
-class EdgeBasedGraphFactory : boost::noncopyable {
-public:
+struct lua_State;
+
+class EdgeBasedGraphFactory
+{
+  public:
+    EdgeBasedGraphFactory() = delete;
+    EdgeBasedGraphFactory(const EdgeBasedGraphFactory &) = delete;
+
     struct SpeedProfileProperties;
 
-    explicit EdgeBasedGraphFactory(
-        int number_of_nodes,
-        std::vector<ImportEdge> & input_edge_list,
-        std::vector<NodeID> & barrier_node_list,
-        std::vector<NodeID> & traffic_light_node_list,
-        std::vector<TurnRestriction> & input_restrictions_list,
-        std::vector<NodeInfo> & m_node_info_list,
-        SpeedProfileProperties & speed_profile
-    );
+    explicit EdgeBasedGraphFactory(const std::shared_ptr<NodeBasedDynamicGraph> &node_based_graph,
+                                   std::unique_ptr<RestrictionMap> restricion_map,
+                                   std::vector<NodeID> &barrier_node_list,
+                                   std::vector<NodeID> &traffic_light_node_list,
+                                   std::vector<NodeInfo> &m_node_info_list,
+                                   SpeedProfileProperties &speed_profile);
 
-    void Run(
-        const std::string & original_edge_data_filename,
-        const std::string & geometry_filename,
-        lua_State *myLuaState
-    );
+    void Run(const std::string &original_edge_data_filename,
+             const std::string &geometry_filename,
+             lua_State *lua_state);
 
-    void GetEdgeBasedEdges( DeallocatingVector< EdgeBasedEdge >& edges );
+    void GetEdgeBasedEdges(DeallocatingVector<EdgeBasedEdge> &edges);
 
-    void GetEdgeBasedNodes( std::vector< EdgeBasedNode> & nodes);
+    void GetEdgeBasedNodes(std::vector<EdgeBasedNode> &nodes);
 
-    TurnInstruction AnalyzeTurn(
-        const NodeID u,
-        const NodeID v,
-        const NodeID w
-    ) const;
+    TurnInstruction AnalyzeTurn(const NodeID u, const NodeID v, const NodeID w, double angle) const;
 
-    int GetTurnPenalty(
-        const NodeID u,
-        const NodeID v,
-        const NodeID w,
-        lua_State *myLuaState
-    ) const;
+    int GetTurnPenalty(double angle, lua_State *lua_state) const;
 
     unsigned GetNumberOfEdgeBasedNodes() const;
 
-    struct SpeedProfileProperties{
-        SpeedProfileProperties() :
-            trafficSignalPenalty(0),
-            uTurnPenalty(0),
-            has_turn_penalty_function(false)
-        { }
+    struct SpeedProfileProperties
+    {
+        SpeedProfileProperties()
+            : trafficSignalPenalty(0), uTurnPenalty(0), has_turn_penalty_function(false)
+        {
+        }
 
         int trafficSignalPenalty;
         int uTurnPenalty;
         bool has_turn_penalty_function;
     } speed_profile;
 
-private:
-    struct NodeBasedEdgeData {
-        NodeBasedEdgeData() {
-            //TODO: proper c'tor
-            edgeBasedNodeID = UINT_MAX;
-        }
+  private:
+    typedef NodeBasedDynamicGraph::EdgeData EdgeData;
 
-        int distance;
-        unsigned edgeBasedNodeID;
-        unsigned nameID;
-        short type;
-        bool isAccessRestricted:1;
-        bool shortcut:1;
-        bool forward:1;
-        bool backward:1;
-        bool roundabout:1;
-        bool ignore_in_grid:1;
-        bool contraFlow:1;
-
-        void SwapDirectionFlags() {
-            bool temp_flag = forward;
-            forward = backward;
-            backward = temp_flag;
-        }
-
-        bool IsEqualTo( const NodeBasedEdgeData & other ) const {
-            return (forward  == other.forward)          &&
-                   (backward == other.backward)         &&
-                   (nameID == other.nameID)             &&
-                   (ignore_in_grid == other.ignore_in_grid) &&
-                   (contraFlow == other.contraFlow);
-        }
-    };
-
-    unsigned m_turn_restrictions_count;
     unsigned m_number_of_edge_based_nodes;
 
-    typedef DynamicGraph<NodeBasedEdgeData>     NodeBasedDynamicGraph;
-    typedef NodeBasedDynamicGraph::InputEdge    NodeBasedEdge;
-    typedef NodeBasedDynamicGraph::NodeIterator NodeIterator;
-    typedef NodeBasedDynamicGraph::EdgeIterator EdgeIterator;
-    typedef NodeBasedDynamicGraph::EdgeData     EdgeData;
-    typedef std::pair<NodeID, NodeID>           RestrictionSource;
-    typedef std::pair<NodeID, bool>             RestrictionTarget;
-    typedef std::vector<RestrictionTarget>      EmanatingRestrictionsVector;
-    typedef boost::unordered_map<RestrictionSource, unsigned > RestrictionMap;
+    std::vector<NodeInfo> m_node_info_list;
+    std::vector<EdgeBasedNode> m_edge_based_node_list;
+    DeallocatingVector<EdgeBasedEdge> m_edge_based_edge_list;
 
-    std::vector<NodeInfo>                       m_node_info_list;
-    std::vector<EmanatingRestrictionsVector>    m_restriction_bucket_list;
-    std::vector<EdgeBasedNode>                  m_edge_based_node_list;
-    DeallocatingVector<EdgeBasedEdge>           m_edge_based_edge_list;
+    std::shared_ptr<NodeBasedDynamicGraph> m_node_based_graph;
+    std::unordered_set<NodeID> m_barrier_nodes;
+    std::unordered_set<NodeID> m_traffic_lights;
 
-    boost::shared_ptr<NodeBasedDynamicGraph>    m_node_based_graph;
-    boost::unordered_set<NodeID>                m_barrier_nodes;
-    boost::unordered_set<NodeID>                m_traffic_lights;
+    std::unique_ptr<RestrictionMap> m_restriction_map;
 
-    RestrictionMap                              m_restriction_map;
-    GeometryCompressor                          m_geometry_compressor;
+    GeometryCompressor m_geometry_compressor;
 
-    NodeID CheckForEmanatingIsOnlyTurn(
-        const NodeID u,
-        const NodeID v
-    ) const;
+    void CompressGeometry();
+    void RenumberEdges();
+    void GenerateEdgeExpandedNodes();
+    void GenerateEdgeExpandedEdges(const std::string &original_edge_data_filename,
+                                   lua_State *lua_state);
 
-    bool CheckIfTurnIsRestricted(
-        const NodeID u,
-        const NodeID v,
-        const NodeID w
-    ) const;
+    void InsertEdgeBasedNode(NodeID u, NodeID v, EdgeID e1, bool belongsToTinyComponent);
 
-    void InsertEdgeBasedNode(
-        NodeBasedDynamicGraph::NodeIterator u,
-        NodeBasedDynamicGraph::NodeIterator v,
-        NodeBasedDynamicGraph::EdgeIterator e1,
-        bool belongsToTinyComponent
-    );
-
-    void BFSCompentExplorer(
-        std::vector<unsigned> & component_index_list,
-        std::vector<unsigned> & component_index_size
-    ) const;
-
-    void FlushVectorToStream(
-        std::ofstream & edge_data_file,
-        std::vector<OriginalEdgeData> & original_edge_data_vector
-    ) const;
-
-    void FixupArrivingTurnRestriction(
-        const NodeID u,
-        const NodeID v,
-        const NodeID w
-    );
-
-    void FixupStartingTurnRestriction(
-        const NodeID u,
-        const NodeID v,
-        const NodeID w
-    );
+    void FlushVectorToStream(std::ofstream &edge_data_file,
+                             std::vector<OriginalEdgeData> &original_edge_data_vector) const;
 
     unsigned max_id;
 };

Contractor/GeometryCompressor.cpp

@@ -31,9 +31,9 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <boost/assert.hpp>
 #include <boost/filesystem.hpp>
 #include <boost/filesystem/fstream.hpp>
-#include <boost/foreach.hpp>
 
 #include <limits>
+#include <string>
 
 int current_free_list_maximum = 0;
 int UniqueNumber() { return ++current_free_list_maximum; }
@@ -49,7 +49,7 @@ void GeometryCompressor::IncreaseFreeList()
     m_compressed_geometries.resize(m_compressed_geometries.size() + 100);
     for (unsigned i = 100; i > 0; --i)
     {
-        m_free_list.push_back(current_free_list_maximum);
+        m_free_list.emplace_back(current_free_list_maximum);
         ++current_free_list_maximum;
     }
 }
@@ -61,8 +61,7 @@ bool GeometryCompressor::HasEntryForID(const EdgeID edge_id) const
 
 unsigned GeometryCompressor::GetPositionForID(const EdgeID edge_id) const
 {
-    boost::unordered_map<EdgeID, unsigned>::const_iterator map_iterator;
-    map_iterator = m_edge_id_to_list_index_map.find(edge_id);
+    auto map_iterator = m_edge_id_to_list_index_map.find(edge_id);
     BOOST_ASSERT(map_iterator != m_edge_id_to_list_index_map.end());
     BOOST_ASSERT(map_iterator->second < m_compressed_geometries.size());
     return map_iterator->second;
@@ -71,20 +70,20 @@ unsigned GeometryCompressor::GetPositionForID(const EdgeID edge_id) const
 void GeometryCompressor::SerializeInternalVector(const std::string &path) const
 {
 
-    boost::filesystem::fstream geometry_out_stream(path, std::ios::binary|std::ios::out);
+    boost::filesystem::fstream geometry_out_stream(path, std::ios::binary | std::ios::out);
     const unsigned number_of_compressed_geometries = m_compressed_geometries.size() + 1;
-    BOOST_ASSERT(UINT_MAX != number_of_compressed_geometries);
+    BOOST_ASSERT(std::numeric_limits<unsigned>::max() != number_of_compressed_geometries);
     geometry_out_stream.write((char *)&number_of_compressed_geometries, sizeof(unsigned));
 
     // write indices array
     unsigned prefix_sum_of_list_indices = 0;
-    for (unsigned i = 0; i < m_compressed_geometries.size(); ++i)
+    for (const auto &elem : m_compressed_geometries)
     {
         geometry_out_stream.write((char *)&prefix_sum_of_list_indices, sizeof(unsigned));
 
-        const std::vector<CompressedNode> &current_vector = m_compressed_geometries.at(i);
+        const std::vector<CompressedNode> &current_vector = elem;
         const unsigned unpacked_size = current_vector.size();
-        BOOST_ASSERT(UINT_MAX != unpacked_size);
+        BOOST_ASSERT(std::numeric_limits<unsigned>::max() != unpacked_size);
         prefix_sum_of_list_indices += unpacked_size;
     }
     // sentinel element
@@ -95,13 +94,13 @@ void GeometryCompressor::SerializeInternalVector(const std::string &path) const
 
     unsigned control_sum = 0;
     // write compressed geometries
-    for (unsigned i = 0; i < m_compressed_geometries.size(); ++i)
+    for (auto &elem : m_compressed_geometries)
     {
-        const std::vector<CompressedNode> &current_vector = m_compressed_geometries[i];
+        const std::vector<CompressedNode> &current_vector = elem;
         const unsigned unpacked_size = current_vector.size();
         control_sum += unpacked_size;
-        BOOST_ASSERT(UINT_MAX != unpacked_size);
-        BOOST_FOREACH (const CompressedNode current_node, current_vector)
+        BOOST_ASSERT(std::numeric_limits<unsigned>::max() != unpacked_size);
+        for (const CompressedNode current_node : current_vector)
         {
             geometry_out_stream.write((char *)&(current_node.first), sizeof(NodeID));
         }
@@ -123,8 +122,8 @@ void GeometryCompressor::CompressEdge(const EdgeID edge_id_1,
     BOOST_ASSERT(SPECIAL_EDGEID != edge_id_2);
     BOOST_ASSERT(SPECIAL_NODEID != via_node_id);
     BOOST_ASSERT(SPECIAL_NODEID != target_node_id);
-    BOOST_ASSERT(std::numeric_limits<int>::max() != weight1);
-    BOOST_ASSERT(std::numeric_limits<int>::max() != weight2);
+    BOOST_ASSERT(INVALID_EDGE_WEIGHT != weight1);
+    BOOST_ASSERT(INVALID_EDGE_WEIGHT != weight2);
 
     // append list of removed edge_id plus via node to surviving edge id:
     // <surv_1, .. , surv_n, via_node_id, rem_1, .. rem_n
@@ -147,7 +146,9 @@ void GeometryCompressor::CompressEdge(const EdgeID edge_id_1,
         m_free_list.pop_back();
     }
 
-    const unsigned edge_bucket_id1 = m_edge_id_to_list_index_map[edge_id_1];
+    const auto iter = m_edge_id_to_list_index_map.find(edge_id_1);
+    BOOST_ASSERT(iter != m_edge_id_to_list_index_map.end());
+    const unsigned edge_bucket_id1 = iter->second;
     BOOST_ASSERT(edge_bucket_id1 == GetPositionForID(edge_id_1));
     BOOST_ASSERT(edge_bucket_id1 < m_compressed_geometries.size());
 
@@ -155,7 +156,7 @@ void GeometryCompressor::CompressEdge(const EdgeID edge_id_1,
 
     if (edge_bucket_list1.empty())
     {
-        edge_bucket_list1.push_back(std::make_pair(via_node_id, weight1));
+        edge_bucket_list1.emplace_back(via_node_id, weight1);
     }
 
     BOOST_ASSERT(0 < edge_bucket_list1.size());
@@ -180,13 +181,13 @@ void GeometryCompressor::CompressEdge(const EdgeID edge_id_1,
                      m_edge_id_to_list_index_map.find(edge_id_2));
         edge_bucket_list2.clear();
         BOOST_ASSERT(0 == edge_bucket_list2.size());
-        m_free_list.push_back(list_to_remove_index);
+        m_free_list.emplace_back(list_to_remove_index);
         BOOST_ASSERT(list_to_remove_index == m_free_list.back());
     }
     else
     {
         // we are certain that the second edge is atomic.
-        edge_bucket_list1.push_back(std::make_pair(target_node_id, weight2));
+        edge_bucket_list1.emplace_back(target_node_id, weight2);
     }
 }
 
@@ -198,7 +199,7 @@ void GeometryCompressor::PrintStatistics() const
 
     uint64_t number_of_compressed_geometries = 0;
     uint64_t longest_chain_length = 0;
-    BOOST_FOREACH (const std::vector<CompressedNode> &current_vector, m_compressed_geometries)
+    for (const std::vector<CompressedNode> &current_vector : m_compressed_geometries)
     {
         number_of_compressed_geometries += current_vector.size();
         longest_chain_length = std::max(longest_chain_length, (uint64_t)current_vector.size());

Contractor/GeometryCompressor.h

@@ -27,8 +27,9 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "../typedefs.h"
 
-#include <boost/unordered_map.hpp>
+#include <unordered_map>
 
+#include <string>
 #include <vector>
 
 #ifndef GEOMETRY_COMPRESSOR_H
@@ -56,9 +57,9 @@ class GeometryCompressor
 
   private:
     void IncreaseFreeList();
-    std::vector<std::vector<CompressedNode> > m_compressed_geometries;
+    std::vector<std::vector<CompressedNode>> m_compressed_geometries;
     std::vector<unsigned> m_free_list;
-    boost::unordered_map<EdgeID, unsigned> m_edge_id_to_list_index_map;
+    std::unordered_map<EdgeID, unsigned> m_edge_id_to_list_index_map;
 };
 
 #endif // GEOMETRY_COMPRESSOR_H

Contractor/TemporaryStorage.cpp

@@ -27,136 +27,146 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "TemporaryStorage.h"
 
-TemporaryStorage::TemporaryStorage() {
-    temp_directory = boost::filesystem::temp_directory_path();
+StreamData::StreamData()
+    : write_mode(true), temp_path(boost::filesystem::unique_path(temp_directory.append(
+                            TemporaryFilePattern.begin(), TemporaryFilePattern.end()))),
+      temp_file(new boost::filesystem::fstream(
+          temp_path, std::ios::in | std::ios::out | std::ios::trunc | std::ios::binary)),
+      readWriteMutex(std::make_shared<boost::mutex>())
+{
+    if (temp_file->fail())
+    {
+        throw OSRMException("temporary file could not be created");
+    }
 }
 
-TemporaryStorage & TemporaryStorage::GetInstance(){
+TemporaryStorage::TemporaryStorage() { temp_directory = boost::filesystem::temp_directory_path(); }
+
+TemporaryStorage &TemporaryStorage::GetInstance()
+{
     static TemporaryStorage static_instance;
     return static_instance;
 }
 
-TemporaryStorage::~TemporaryStorage() {
-    RemoveAll();
-}
+TemporaryStorage::~TemporaryStorage() { RemoveAll(); }
 
-void TemporaryStorage::RemoveAll() {
+void TemporaryStorage::RemoveAll()
+{
     boost::mutex::scoped_lock lock(mutex);
-    for(unsigned slot_id = 0; slot_id < stream_data_list.size(); ++slot_id) {
+    for (unsigned slot_id = 0; slot_id < stream_data_list.size(); ++slot_id)
+    {
         DeallocateSlot(slot_id);
     }
     stream_data_list.clear();
 }
 
-int TemporaryStorage::AllocateSlot() {
+int TemporaryStorage::AllocateSlot()
+{
     boost::mutex::scoped_lock lock(mutex);
-    try {
-        stream_data_list.push_back(StreamData());
-    } catch(boost::filesystem::filesystem_error & e) {
-        Abort(e);
-    }
+    try { stream_data_list.push_back(StreamData()); }
+    catch (boost::filesystem::filesystem_error &e) { Abort(e); }
     CheckIfTemporaryDeviceFull();
     return stream_data_list.size() - 1;
 }
 
-void TemporaryStorage::DeallocateSlot(const int slot_id) {
-    try {
-        StreamData & data = stream_data_list[slot_id];
+void TemporaryStorage::DeallocateSlot(const int slot_id)
+{
+    try
+    {
+        StreamData &data = stream_data_list[slot_id];
         boost::mutex::scoped_lock lock(*data.readWriteMutex);
-        if(!boost::filesystem::exists(data.temp_path)) {
+        if (!boost::filesystem::exists(data.temp_path))
+        {
             return;
         }
-        if(data.temp_file->is_open()) {
+        if (data.temp_file->is_open())
+        {
             data.temp_file->close();
         }
 
         boost::filesystem::remove(data.temp_path);
-    } catch(boost::filesystem::filesystem_error & e) {
-        Abort(e);
     }
+    catch (boost::filesystem::filesystem_error &e) { Abort(e); }
 }
 
-void TemporaryStorage::WriteToSlot(
-    const int slot_id,
-    char * pointer,
-    const std::size_t size
-) {
-    try {
-        StreamData & data = stream_data_list[slot_id];
+void TemporaryStorage::WriteToSlot(const int slot_id, char *pointer, const std::size_t size)
+{
+    try
+    {
+        StreamData &data = stream_data_list[slot_id];
         BOOST_ASSERT(data.write_mode);
 
         boost::mutex::scoped_lock lock(*data.readWriteMutex);
-        BOOST_ASSERT_MSG(
-            data.write_mode,
-            "Writing after first read is not allowed"
-        );
-        if( 1073741824 < data.buffer.size() ) {
+        BOOST_ASSERT_MSG(data.write_mode, "Writing after first read is not allowed");
+        if (1073741824 < data.buffer.size())
+        {
             data.temp_file->write(&data.buffer[0], data.buffer.size());
             // data.temp_file->write(pointer, size);
             data.buffer.clear();
             CheckIfTemporaryDeviceFull();
         }
-        data.buffer.insert(data.buffer.end(), pointer, pointer+size);
-
-    } catch(boost::filesystem::filesystem_error & e) {
-        Abort(e);
+        data.buffer.insert(data.buffer.end(), pointer, pointer + size);
     }
+    catch (boost::filesystem::filesystem_error &e) { Abort(e); }
 }
-void TemporaryStorage::ReadFromSlot(
-    const int slot_id,
-    char * pointer,
-    const std::size_t size
-) {
-    try {
-        StreamData & data = stream_data_list[slot_id];
+void TemporaryStorage::ReadFromSlot(const int slot_id, char *pointer, const std::size_t size)
+{
+    try
+    {
+        StreamData &data = stream_data_list[slot_id];
         boost::mutex::scoped_lock lock(*data.readWriteMutex);
-        if( data.write_mode ) {
+        if (data.write_mode)
+        {
             data.write_mode = false;
             data.temp_file->write(&data.buffer[0], data.buffer.size());
             data.buffer.clear();
-            data.temp_file->seekg( data.temp_file->beg );
-            BOOST_ASSERT( data.temp_file->beg == data.temp_file->tellg() );
+            data.temp_file->seekg(data.temp_file->beg);
+            BOOST_ASSERT(data.temp_file->beg == data.temp_file->tellg());
         }
-        BOOST_ASSERT( !data.write_mode );
+        BOOST_ASSERT(!data.write_mode);
         data.temp_file->read(pointer, size);
-    } catch(boost::filesystem::filesystem_error & e) {
-        Abort(e);
     }
+    catch (boost::filesystem::filesystem_error &e) { Abort(e); }
 }
 
-uint64_t TemporaryStorage::GetFreeBytesOnTemporaryDevice() {
+uint64_t TemporaryStorage::GetFreeBytesOnTemporaryDevice()
+{
     uint64_t value = -1;
-    try {
-        boost::filesystem::path p =  boost::filesystem::temp_directory_path();
-        boost::filesystem::space_info s = boost::filesystem::space( p );
+    try
+    {
+        boost::filesystem::path p = boost::filesystem::temp_directory_path();
+        boost::filesystem::space_info s = boost::filesystem::space(p);
         value = s.free;
-    } catch(boost::filesystem::filesystem_error & e) {
-        Abort(e);
     }
+    catch (boost::filesystem::filesystem_error &e) { Abort(e); }
     return value;
 }
 
-void TemporaryStorage::CheckIfTemporaryDeviceFull() {
+void TemporaryStorage::CheckIfTemporaryDeviceFull()
+{
     boost::filesystem::path p = boost::filesystem::temp_directory_path();
-    boost::filesystem::space_info s = boost::filesystem::space( p );
-    if( (1024*1024) > s.free ) {
+    boost::filesystem::space_info s = boost::filesystem::space(p);
+    if ((1024 * 1024) > s.free)
+    {
         throw OSRMException("temporary device is full");
     }
 }
 
-boost::filesystem::fstream::pos_type TemporaryStorage::Tell(const int slot_id) {
+boost::filesystem::fstream::pos_type TemporaryStorage::Tell(const int slot_id)
+{
     boost::filesystem::fstream::pos_type position;
-    try {
-        StreamData & data = stream_data_list[slot_id];
+    try
+    {
+        StreamData &data = stream_data_list[slot_id];
         boost::mutex::scoped_lock lock(*data.readWriteMutex);
         position = data.temp_file->tellp();
-    } catch(boost::filesystem::filesystem_error & e) {
-        Abort(e);
     }
+    catch (boost::filesystem::filesystem_error &e) { Abort(e); }
     return position;
 }
 
-void TemporaryStorage::Abort(const boost::filesystem::filesystem_error& e) {
+void TemporaryStorage::Abort(const boost::filesystem::filesystem_error &e)
+{
     RemoveAll();
     throw OSRMException(e.what());
 }

Contractor/TemporaryStorage.h

@@ -34,83 +34,61 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../typedefs.h"
 
 #include <boost/assert.hpp>
-#include <boost/foreach.hpp>
-#include <boost/integer.hpp>
 #include <boost/filesystem.hpp>
 #include <boost/filesystem/fstream.hpp>
-#include <boost/make_shared.hpp>
-#include <boost/shared_ptr.hpp>
 #include <boost/thread/mutex.hpp>
 
+#include <cstdint>
+
 #include <vector>
 #include <fstream>
+#include <memory>
 
-/**
- * This class implements a singleton file storage for temporary data.
- * temporary slots can be accessed by other objects through an int
- * On deallocation every slot gets deallocated
- *
- * Access is sequential, which means, that there is no random access
- * -> Data is written in first phase and reread in second.
- */
+struct StreamData
+{
+    bool write_mode;
+    boost::filesystem::path temp_path;
+    std::shared_ptr<boost::filesystem::fstream> temp_file;
+    std::shared_ptr<boost::mutex> readWriteMutex;
+    std::vector<char> buffer;
+
+    StreamData();
+};
+
+// This class implements a singleton file storage for temporary data.
+// temporary slots can be accessed by other objects through an int
+// On deallocation every slot gets deallocated
+//
+// Access is sequential, which means, that there is no random access
+// -> Data is written in first phase and reread in second.
 
 static boost::filesystem::path temp_directory;
 static std::string TemporaryFilePattern("OSRM-%%%%-%%%%-%%%%");
-class TemporaryStorage {
-public:
-    static TemporaryStorage & GetInstance();
+class TemporaryStorage
+{
+  public:
+    static TemporaryStorage &GetInstance();
     virtual ~TemporaryStorage();
 
     int AllocateSlot();
     void DeallocateSlot(const int slot_id);
-    void WriteToSlot(const int slot_id, char * pointer, const std::size_t size);
-    void ReadFromSlot(const int slot_id, char * pointer, const std::size_t size);
-    //returns the number of free bytes
+    void WriteToSlot(const int slot_id, char *pointer, const std::size_t size);
+    void ReadFromSlot(const int slot_id, char *pointer, const std::size_t size);
+    // returns the number of free bytes
     uint64_t GetFreeBytesOnTemporaryDevice();
     boost::filesystem::fstream::pos_type Tell(const int slot_id);
     void RemoveAll();
-private:
+
+  private:
     TemporaryStorage();
-    TemporaryStorage(TemporaryStorage const &){};
+    TemporaryStorage(TemporaryStorage const &) {};
 
-    TemporaryStorage & operator=(TemporaryStorage const &) {
-        return *this;
-    }
+    TemporaryStorage &operator=(TemporaryStorage const &) { return *this; }
 
-    void Abort(const boost::filesystem::filesystem_error& e);
+    void Abort(const boost::filesystem::filesystem_error &e);
     void CheckIfTemporaryDeviceFull();
 
-    struct StreamData {
-        bool write_mode;
-        boost::filesystem::path temp_path;
-        boost::shared_ptr<boost::filesystem::fstream> temp_file;
-        boost::shared_ptr<boost::mutex> readWriteMutex;
-        std::vector<char> buffer;
-
-        StreamData() :
-            write_mode(true),
-            temp_path(
-                boost::filesystem::unique_path(
-                    temp_directory.append(
-                        TemporaryFilePattern.begin(),
-                        TemporaryFilePattern.end()
-                    )
-                )
-            ),
-            temp_file(
-                new boost::filesystem::fstream(
-                    temp_path,
-                    std::ios::in|std::ios::out|std::ios::trunc|std::ios::binary
-                )
-            ),
-            readWriteMutex(boost::make_shared<boost::mutex>())
-        {
-            if( temp_file->fail() ) {
-                throw OSRMException("temporary file could not be created");
-            }
-        }
-    };
-    //vector of file streams that is used to store temporary data
+    // vector of file streams that is used to store temporary data
     boost::mutex mutex;
     std::vector<StreamData> stream_data_list;
 };

DataStructures/BinaryHeap.h

@@ -28,273 +28,262 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef BINARY_HEAP_H
 #define BINARY_HEAP_H
 
-//Not compatible with non contiguous node ids
-
-#include <boost/unordered_map.hpp>
-
 #include <boost/assert.hpp>
 
 #include <algorithm>
 #include <limits>
 #include <map>
+#include <type_traits>
+#include <unordered_map>
 #include <vector>
 
-template< typename NodeID, typename Key >
-class ArrayStorage {
-public:
-
-    explicit ArrayStorage( size_t size ) : positions( new Key[size] ) {
-        memset(positions, 0, size*sizeof(Key));
+template <typename NodeID, typename Key> class ArrayStorage
+{
+  public:
+    explicit ArrayStorage(size_t size) : positions(new Key[size])
+    {
+        memset(positions, 0, size * sizeof(Key));
     }
 
-    ~ArrayStorage() {
-        delete[] positions;
-    }
+    ~ArrayStorage() { delete[] positions; }
 
-    Key &operator[]( NodeID node ) {
-        return positions[node];
-    }
+    Key &operator[](NodeID node) { return positions[node]; }
 
     void Clear() {}
 
-private:
-    Key* positions;
+  private:
+    Key *positions;
 };
 
-template< typename NodeID, typename Key >
-class MapStorage {
-public:
+template <typename NodeID, typename Key> class MapStorage
+{
+  public:
+    explicit MapStorage(size_t) {}
 
-    explicit MapStorage( size_t ) {}
+    Key &operator[](NodeID node) { return nodes[node]; }
 
-    Key &operator[]( NodeID node ) {
-        return nodes[node];
-    }
-
-    void Clear() {
-        nodes.clear();
-    }
-
-private:
-    std::map< NodeID, Key > nodes;
+    void Clear() { nodes.clear(); }
 
+  private:
+    std::map<NodeID, Key> nodes;
 };
 
-template< typename NodeID, typename Key >
-class UnorderedMapStorage {
-    typedef boost::unordered_map<NodeID, Key> UnorderedMapType;
-    typedef typename UnorderedMapType::iterator UnorderedMapIterator;
-    typedef typename UnorderedMapType::const_iterator UnorderedMapConstIterator;
-public:
+template <typename NodeID, typename Key> class UnorderedMapStorage
+{
+  public:
+    explicit UnorderedMapStorage(size_t) { nodes.rehash(1000); }
 
-	explicit UnorderedMapStorage( size_t ) {
-		//hash table gets 1000 Buckets
-		nodes.rehash(1000);
-	}
+    Key &operator[](const NodeID node) { return nodes[node]; }
 
-    Key & operator[]( const NodeID node ) {
-        return nodes[node];
-    }
-
-    Key const & operator[]( const NodeID node ) const {
-        UnorderedMapConstIterator iter = nodes.find(node);
+    Key const &operator[](const NodeID node) const
+    {
+        auto iter = nodes.find(node);
         return iter->second;
     }
 
-    void Clear() {
-        nodes.clear();
-    }
+    void Clear() { nodes.clear(); }
 
-private:
-    boost::unordered_map< NodeID, Key > nodes;
+  private:
+    std::unordered_map<NodeID, Key> nodes;
 };
 
-template<
-    typename NodeID,
-    typename Key,
-    typename Weight,
-    typename Data,
-    typename IndexStorage = ArrayStorage<NodeID, NodeID>
->
-class BinaryHeap {
-private:
-    BinaryHeap( const BinaryHeap& right );
-    void operator=( const BinaryHeap& right );
-public:
+template <typename NodeID,
+          typename Key,
+          typename Weight,
+          typename Data,
+          typename IndexStorage = ArrayStorage<NodeID, NodeID>>
+class BinaryHeap
+{
+  private:
+    BinaryHeap(const BinaryHeap &right);
+    void operator=(const BinaryHeap &right);
+
+  public:
     typedef Weight WeightType;
     typedef Data DataType;
 
-    explicit BinaryHeap( size_t maxID )
-     :
-        nodeIndex( maxID )
+    explicit BinaryHeap(size_t maxID) : node_index(maxID) { Clear(); }
+
+    void Clear()
     {
-        Clear();
+        heap.resize(1);
+        inserted_nodes.clear();
+        heap[0].weight = std::numeric_limits<Weight>::min();
+        node_index.Clear();
     }
 
-    void Clear() {
-        heap.resize( 1 );
-        insertedNodes.clear();
-        heap[0].weight = std::numeric_limits< Weight >::min();
-        nodeIndex.Clear();
-    }
+    std::size_t Size() const { return (heap.size() - 1); }
 
-    Key Size() const {
-        return static_cast<Key>( heap.size() - 1 );
-    }
+    bool Empty() const { return 0 == Size(); }
 
-    bool Empty() const {
-        return 0 == Size();
-    }
-
-    void Insert( NodeID node, Weight weight, const Data &data ) {
+    void Insert(NodeID node, Weight weight, const Data &data)
+    {
         HeapElement element;
-        element.index = static_cast<NodeID>(insertedNodes.size());
+        element.index = static_cast<NodeID>(inserted_nodes.size());
         element.weight = weight;
         const Key key = static_cast<Key>(heap.size());
-        heap.push_back( element );
-        insertedNodes.push_back( HeapNode( node, key, weight, data ) );
-        nodeIndex[node] = element.index;
-        Upheap( key );
+        heap.emplace_back(element);
+        inserted_nodes.emplace_back(node, key, weight, data);
+        node_index[node] = element.index;
+        Upheap(key);
         CheckHeap();
     }
 
-    Data& GetData( NodeID node ) {
-        const Key index = nodeIndex[node];
-        return insertedNodes[index].data;
+    Data &GetData(NodeID node)
+    {
+        const Key index = node_index[node];
+        return inserted_nodes[index].data;
     }
 
-    Data const & GetData( NodeID node ) const {
-        const Key index = nodeIndex[node];
-        return insertedNodes[index].data;
+    Data const &GetData(NodeID node) const
+    {
+        const Key index = node_index[node];
+        return inserted_nodes[index].data;
     }
 
-    Weight& GetKey( NodeID node ) {
-        const Key index = nodeIndex[node];
-        return insertedNodes[index].weight;
+    Weight &GetKey(NodeID node)
+    {
+        const Key index = node_index[node];
+        return inserted_nodes[index].weight;
     }
 
-    bool WasRemoved( const NodeID node ) {
-        BOOST_ASSERT( WasInserted( node ) );
-        const Key index = nodeIndex[node];
-        return insertedNodes[index].key == 0;
+    bool WasRemoved(const NodeID node)
+    {
+        BOOST_ASSERT(WasInserted(node));
+        const Key index = node_index[node];
+        return inserted_nodes[index].key == 0;
     }
 
-    bool WasInserted( const NodeID node ) {
-        const Key index = nodeIndex[node];
-        if ( index >= static_cast<Key> (insertedNodes.size()) )
+    bool WasInserted(const NodeID node)
+    {
+        const Key index = node_index[node];
+        if (index >= static_cast<Key>(inserted_nodes.size()))
+        {
             return false;
-        return insertedNodes[index].node == node;
+        }
+        return inserted_nodes[index].node == node;
     }
 
-    NodeID Min() const {
-        BOOST_ASSERT( heap.size() > 1 );
-        return insertedNodes[heap[1].index].node;
+    NodeID Min() const
+    {
+        BOOST_ASSERT(heap.size() > 1);
+        return inserted_nodes[heap[1].index].node;
     }
 
-    NodeID DeleteMin() {
-        BOOST_ASSERT( heap.size() > 1 );
+    NodeID DeleteMin()
+    {
+        BOOST_ASSERT(heap.size() > 1);
         const Key removedIndex = heap[1].index;
-        heap[1] = heap[heap.size()-1];
+        heap[1] = heap[heap.size() - 1];
         heap.pop_back();
-        if ( heap.size() > 1 )
-            Downheap( 1 );
-        insertedNodes[removedIndex].key = 0;
+        if (heap.size() > 1)
+        {
+            Downheap(1);
+        }
+        inserted_nodes[removedIndex].key = 0;
         CheckHeap();
-        return insertedNodes[removedIndex].node;
+        return inserted_nodes[removedIndex].node;
     }
 
-    void DeleteAll() {
-        for ( typename std::vector< HeapElement >::iterator i = heap.begin() + 1, iend = heap.end(); i != iend; ++i )
-            insertedNodes[i->index].key = 0;
-        heap.resize( 1 );
-        heap[0].weight = (std::numeric_limits< Weight >::min)();
+    void DeleteAll()
+    {
+        auto iend = heap.end();
+        for (typename std::vector<HeapElement>::iterator i = heap.begin() + 1; i != iend; ++i)
+        {
+            inserted_nodes[i->index].key = 0;
+        }
+        heap.resize(1);
+        heap[0].weight = (std::numeric_limits<Weight>::min)();
     }
 
-    void DecreaseKey( NodeID node, Weight weight ) {
-        BOOST_ASSERT( UINT_MAX != node );
-        const Key & index = nodeIndex[node];
-        Key & key = insertedNodes[index].key;
-        BOOST_ASSERT ( key >= 0 );
+    void DecreaseKey(NodeID node, Weight weight)
+    {
+        BOOST_ASSERT(std::numeric_limits<NodeID>::max() != node);
+        const Key &index = node_index[node];
+        Key &key = inserted_nodes[index].key;
+        BOOST_ASSERT(key >= 0);
 
-        insertedNodes[index].weight = weight;
+        inserted_nodes[index].weight = weight;
         heap[key].weight = weight;
-        Upheap( key );
+        Upheap(key);
         CheckHeap();
     }
 
-private:
-    class HeapNode {
-    public:
-        HeapNode( NodeID n, Key k, Weight w, Data d )
-         :
-            node(n),
-            key(k),
-            weight(w),
-            data(d)
-        { }
+  private:
+    class HeapNode
+    {
+      public:
+        HeapNode(NodeID n, Key k, Weight w, Data d) : node(n), key(k), weight(w), data(d) {}
 
         NodeID node;
         Key key;
         Weight weight;
         Data data;
     };
-    struct HeapElement {
+    struct HeapElement
+    {
         Key index;
         Weight weight;
     };
 
-    std::vector< HeapNode > insertedNodes;
-    std::vector< HeapElement > heap;
-    IndexStorage nodeIndex;
+    std::vector<HeapNode> inserted_nodes;
+    std::vector<HeapElement> heap;
+    IndexStorage node_index;
 
-    void Downheap( Key key ) {
+    void Downheap(Key key)
+    {
         const Key droppingIndex = heap[key].index;
         const Weight weight = heap[key].weight;
         Key nextKey = key << 1;
-        while( nextKey < static_cast<Key>( heap.size() ) ){
+        while (nextKey < static_cast<Key>(heap.size()))
+        {
             const Key nextKeyOther = nextKey + 1;
-            if (
-                ( nextKeyOther < static_cast<Key>( heap.size() )   ) &&
-                ( heap[nextKey].weight > heap[nextKeyOther].weight )
-            ) {
+            if ((nextKeyOther < static_cast<Key>(heap.size())) &&
+                (heap[nextKey].weight > heap[nextKeyOther].weight))
+            {
                 nextKey = nextKeyOther;
             }
-            if ( weight <= heap[nextKey].weight ){
+            if (weight <= heap[nextKey].weight)
+            {
                 break;
             }
             heap[key] = heap[nextKey];
-            insertedNodes[heap[key].index].key = key;
+            inserted_nodes[heap[key].index].key = key;
             key = nextKey;
             nextKey <<= 1;
         }
         heap[key].index = droppingIndex;
         heap[key].weight = weight;
-        insertedNodes[droppingIndex].key = key;
+        inserted_nodes[droppingIndex].key = key;
     }
 
-    void Upheap( Key key ) {
+    void Upheap(Key key)
+    {
         const Key risingIndex = heap[key].index;
         const Weight weight = heap[key].weight;
         Key nextKey = key >> 1;
-        while ( heap[nextKey].weight > weight ) {
-            BOOST_ASSERT( nextKey != 0 );
+        while (heap[nextKey].weight > weight)
+        {
+            BOOST_ASSERT(nextKey != 0);
             heap[key] = heap[nextKey];
-            insertedNodes[heap[key].index].key = key;
+            inserted_nodes[heap[key].index].key = key;
             key = nextKey;
             nextKey >>= 1;
         }
         heap[key].index = risingIndex;
         heap[key].weight = weight;
-        insertedNodes[risingIndex].key = key;
+        inserted_nodes[risingIndex].key = key;
     }
 
-    void CheckHeap() {
+    void CheckHeap()
+    {
 #ifndef NDEBUG
-        for ( Key i = 2; i < (Key) heap.size(); ++i ) {
-            BOOST_ASSERT( heap[i].weight >= heap[i >> 1].weight );
+        for (Key i = 2; i < (Key)heap.size(); ++i)
+        {
+            BOOST_ASSERT(heap[i].weight >= heap[i >> 1].weight);
         }
 #endif
     }
 };
 
-#endif //BINARY_HEAP_H
+#endif // BINARY_HEAP_H

DataStructures/ConcurrentQueue.h

@@ -25,75 +25,64 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef CONCURRENTQUEUE_H_
-#define CONCURRENTQUEUE_H_
+#ifndef CONCURRENT_QUEUE_H
+#define CONCURRENT_QUEUE_H
 
 #include "../typedefs.h"
 
-#include <boost/bind.hpp>
 #include <boost/circular_buffer.hpp>
-#include <boost/thread/condition.hpp>
-#include <boost/thread/mutex.hpp>
-#include <boost/thread/thread.hpp>
+#include <condition_variable>
+#include <mutex>
 
-template<typename Data>
-class ConcurrentQueue {
+template <typename Data> class ConcurrentQueue
+{
+  public:
+    explicit ConcurrentQueue(const size_t max_size) : m_internal_queue(max_size) {}
 
-public:
-    explicit ConcurrentQueue(const size_t max_size) : m_internal_queue(max_size) { }
-
-    inline void push(const Data & data) {
-        boost::mutex::scoped_lock lock(m_mutex);
-        m_not_full.wait(
-            lock,
-            boost::bind(&ConcurrentQueue<Data>::is_not_full, this)
-        );
+    inline void push(const Data &data)
+    {
+        std::unique_lock<std::mutex> lock(m_mutex);
+        m_not_full.wait(lock,
+                        [this]
+                        { return m_internal_queue.size() < m_internal_queue.capacity(); });
         m_internal_queue.push_back(data);
-        lock.unlock();
+        m_mutex.unlock();
         m_not_empty.notify_one();
     }
 
-    inline bool empty() const {
-        return m_internal_queue.empty();
-    }
+    inline bool empty() const { return m_internal_queue.empty(); }
 
-    inline void wait_and_pop(Data & popped_value) {
-        boost::mutex::scoped_lock lock(m_mutex);
-        m_not_empty.wait(
-            lock,
-            boost::bind(&ConcurrentQueue<Data>::is_not_empty, this)
-        );
+    inline void wait_and_pop(Data &popped_value)
+    {
+        std::unique_lock<std::mutex> lock(m_mutex);
+        m_not_empty.wait(lock,
+                         [this]
+                         { return !m_internal_queue.empty(); });
         popped_value = m_internal_queue.front();
         m_internal_queue.pop_front();
-        lock.unlock();
+        m_mutex.unlock();
         m_not_full.notify_one();
     }
 
-    inline bool try_pop(Data& popped_value) {
-        boost::mutex::scoped_lock lock(m_mutex);
-        if(m_internal_queue.empty()) {
+    inline bool try_pop(Data &popped_value)
+    {
+        std::unique_lock<std::mutex> lock(m_mutex);
+        if (m_internal_queue.empty())
+        {
             return false;
         }
-        popped_value=m_internal_queue.front();
+        popped_value = m_internal_queue.front();
         m_internal_queue.pop_front();
-        lock.unlock();
+        m_mutex.unlock();
         m_not_full.notify_one();
         return true;
     }
 
-private:
-    inline bool is_not_empty() const {
-        return !m_internal_queue.empty();
-    }
-
-    inline bool is_not_full() const {
-        return m_internal_queue.size() < m_internal_queue.capacity();
-    }
-
-    boost::circular_buffer<Data>    m_internal_queue;
-    boost::mutex                    m_mutex;
-    boost::condition                m_not_empty;
-    boost::condition                m_not_full;
+  private:
+    boost::circular_buffer<Data> m_internal_queue;
+    std::mutex m_mutex;
+    std::condition_variable m_not_empty;
+    std::condition_variable m_not_full;
 };
 
-#endif /* CONCURRENTQUEUE_H_ */
+#endif // CONCURRENT_QUEUE_H

DataStructures/Coordinate.cpp

@@ -1,183 +1,380 @@
-/*
-
-Copyright (c) 2013, Project OSRM, Dennis Luxen, others
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification,
-are permitted provided that the following conditions are met:
-
-Redistributions of source code must retain the above copyright notice, this list
-of conditions and the following disclaimer.
-Redistributions in binary form must reproduce the above copyright notice, this
-list of conditions and the following disclaimer in the documentation and/or
-other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-*/
-
-#include <osrm/Coordinate.h>
-#include "../Util/SimpleLogger.h"
-#include "../Util/StringUtil.h"
-
-#include <boost/assert.hpp>
-
-#ifndef NDEBUG
-#include <bitset>
-#endif
-#include <iostream>
-#include <limits>
-
-FixedPointCoordinate::FixedPointCoordinate()
- :  lat(std::numeric_limits<int>::min()),
-    lon(std::numeric_limits<int>::min())
-{ }
-
-FixedPointCoordinate::FixedPointCoordinate(int lat, int lon)
- :  lat(lat),
-    lon(lon)
-{
-#ifndef NDEBUG
-    if(0 != (std::abs(lat) >> 30))
-    {
-        std::bitset<32> y(lat);
-        SimpleLogger().Write(logDEBUG) << "broken lat: " << lat << ", bits: " << y;
-    }
-    if(0 != (std::abs(lon) >> 30))
-    {
-        std::bitset<32> x(lon);
-        SimpleLogger().Write(logDEBUG) << "broken lon: " << lon << ", bits: " << x;
-    }
-#endif
-}
-
-void FixedPointCoordinate::Reset() {
-    lat = std::numeric_limits<int>::min();
-    lon = std::numeric_limits<int>::min();
-}
-bool FixedPointCoordinate::isSet() const {
-    return (std::numeric_limits<int>::min() != lat) &&
-           (std::numeric_limits<int>::min() != lon);
-}
-bool FixedPointCoordinate::isValid() const {
-    if (lat >   90*COORDINATE_PRECISION ||
-        lat <  -90*COORDINATE_PRECISION ||
-        lon >  180*COORDINATE_PRECISION ||
-        lon < -180*COORDINATE_PRECISION)
-    {
-        return false;
-    }
-    return true;
-}
-bool FixedPointCoordinate::operator==(const FixedPointCoordinate & other) const {
-    return lat == other.lat && lon == other.lon;
-}
-
-double FixedPointCoordinate::ApproximateDistance(
-    const int lat1,
-    const int lon1,
-    const int lat2,
-    const int lon2
-) {
-    BOOST_ASSERT(lat1 != std::numeric_limits<int>::min());
-    BOOST_ASSERT(lon1 != std::numeric_limits<int>::min());
-    BOOST_ASSERT(lat2 != std::numeric_limits<int>::min());
-    BOOST_ASSERT(lon2 != std::numeric_limits<int>::min());
-    double RAD = 0.017453292519943295769236907684886;
-    double lt1 = lat1/COORDINATE_PRECISION;
-    double ln1 = lon1/COORDINATE_PRECISION;
-    double lt2 = lat2/COORDINATE_PRECISION;
-    double ln2 = lon2/COORDINATE_PRECISION;
-    double dlat1=lt1*(RAD);
-
-    double dlong1=ln1*(RAD);
-    double dlat2=lt2*(RAD);
-    double dlong2=ln2*(RAD);
-
-    double dLong=dlong1-dlong2;
-    double dLat=dlat1-dlat2;
-
-    double aHarv= pow(sin(dLat/2.0),2.0)+cos(dlat1)*cos(dlat2)*pow(sin(dLong/2.),2);
-    double cHarv=2.*atan2(sqrt(aHarv),sqrt(1.0-aHarv));
-    //earth radius varies between 6,356.750-6,378.135 km (3,949.901-3,963.189mi)
-    //The IUGG value for the equatorial radius is 6378.137 km (3963.19 miles)
-    const double earth=6372797.560856;
-    return earth*cHarv;
-}
-
-double FixedPointCoordinate::ApproximateDistance(
-    const FixedPointCoordinate &c1,
-    const FixedPointCoordinate &c2
-) {
-    return ApproximateDistance(c1.lat, c1.lon, c2.lat, c2.lon);
-}
-
-double FixedPointCoordinate::ApproximateEuclideanDistance(
-    const FixedPointCoordinate &c1,
-    const FixedPointCoordinate &c2
-) {
-    BOOST_ASSERT(c1.lat != std::numeric_limits<int>::min());
-    BOOST_ASSERT(c1.lon != std::numeric_limits<int>::min());
-    BOOST_ASSERT(c2.lat != std::numeric_limits<int>::min());
-    BOOST_ASSERT(c2.lon != std::numeric_limits<int>::min());
-    const double RAD = 0.017453292519943295769236907684886;
-    const double lat1 = (c1.lat/COORDINATE_PRECISION)*RAD;
-    const double lon1 = (c1.lon/COORDINATE_PRECISION)*RAD;
-    const double lat2 = (c2.lat/COORDINATE_PRECISION)*RAD;
-    const double lon2 = (c2.lon/COORDINATE_PRECISION)*RAD;
-
-    const double x = (lon2-lon1) * cos((lat1+lat2)/2.);
-    const double y = (lat2-lat1);
-    const double earthRadius = 6372797.560856;
-    return sqrt(x*x + y*y) * earthRadius;
-}
-
-void FixedPointCoordinate::convertInternalLatLonToString(
-    const int value,
-    std::string & output
-) {
-    char buffer[100];
-    buffer[11] = 0; // zero termination
-    char* string = printInt< 11, 6 >( buffer, value );
-    output = string;
-}
-
-void FixedPointCoordinate::convertInternalCoordinateToString(
-    const FixedPointCoordinate & coord,
-    std::string & output
-) {
-    std::string tmp;
-    tmp.reserve(23);
-    convertInternalLatLonToString(coord.lon, tmp);
-    output = tmp;
-    output += ",";
-    convertInternalLatLonToString(coord.lat, tmp);
-    output += tmp;
-}
-
-void FixedPointCoordinate::convertInternalReversedCoordinateToString(
-    const FixedPointCoordinate & coord,
-    std::string & output
-) {
-    std::string tmp;
-    tmp.reserve(23);
-    convertInternalLatLonToString(coord.lat, tmp);
-    output = tmp;
-    output += ",";
-    convertInternalLatLonToString(coord.lon, tmp);
-    output += tmp;
-}
-
-void FixedPointCoordinate::Output(std::ostream & out) const
-{
-    out << "(" << lat/COORDINATE_PRECISION << "," << lon/COORDINATE_PRECISION << ")";
-}
+/*
+
+Copyright (c) 2013, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+#include <osrm/Coordinate.h>
+#include "../Util/MercatorUtil.h"
+#include "../Util/SimpleLogger.h"
+#include "../Util/StringUtil.h"
+#include "../Util/TrigonometryTables.h"
+
+#include <boost/assert.hpp>
+
+#ifndef NDEBUG
+#include <bitset>
+#endif
+#include <iostream>
+#include <limits>
+
+FixedPointCoordinate::FixedPointCoordinate()
+    : lat(std::numeric_limits<int>::min()), lon(std::numeric_limits<int>::min())
+{
+}
+
+FixedPointCoordinate::FixedPointCoordinate(int lat, int lon) : lat(lat), lon(lon)
+{
+#ifndef NDEBUG
+    if (0 != (std::abs(lat) >> 30))
+    {
+        std::bitset<32> y(lat);
+        SimpleLogger().Write(logDEBUG) << "broken lat: " << lat << ", bits: " << y;
+    }
+    if (0 != (std::abs(lon) >> 30))
+    {
+        std::bitset<32> x(lon);
+        SimpleLogger().Write(logDEBUG) << "broken lon: " << lon << ", bits: " << x;
+    }
+#endif
+}
+
+void FixedPointCoordinate::Reset()
+{
+    lat = std::numeric_limits<int>::min();
+    lon = std::numeric_limits<int>::min();
+}
+bool FixedPointCoordinate::isSet() const
+{
+    return (std::numeric_limits<int>::min() != lat) && (std::numeric_limits<int>::min() != lon);
+}
+bool FixedPointCoordinate::isValid() const
+{
+    if (lat > 90 * COORDINATE_PRECISION || lat < -90 * COORDINATE_PRECISION ||
+        lon > 180 * COORDINATE_PRECISION || lon < -180 * COORDINATE_PRECISION)
+    {
+        return false;
+    }
+    return true;
+}
+bool FixedPointCoordinate::operator==(const FixedPointCoordinate &other) const
+{
+    return lat == other.lat && lon == other.lon;
+}
+
+double FixedPointCoordinate::ApproximateDistance(const int lat1,
+                                                 const int lon1,
+                                                 const int lat2,
+                                                 const int lon2)
+{
+    BOOST_ASSERT(lat1 != std::numeric_limits<int>::min());
+    BOOST_ASSERT(lon1 != std::numeric_limits<int>::min());
+    BOOST_ASSERT(lat2 != std::numeric_limits<int>::min());
+    BOOST_ASSERT(lon2 != std::numeric_limits<int>::min());
+    double RAD = 0.017453292519943295769236907684886;
+    double lt1 = lat1 / COORDINATE_PRECISION;
+    double ln1 = lon1 / COORDINATE_PRECISION;
+    double lt2 = lat2 / COORDINATE_PRECISION;
+    double ln2 = lon2 / COORDINATE_PRECISION;
+    double dlat1 = lt1 * (RAD);
+
+    double dlong1 = ln1 * (RAD);
+    double dlat2 = lt2 * (RAD);
+    double dlong2 = ln2 * (RAD);
+
+    double dLong = dlong1 - dlong2;
+    double dLat = dlat1 - dlat2;
+
+    double aHarv = pow(sin(dLat / 2.0), 2.0) + cos(dlat1) * cos(dlat2) * pow(sin(dLong / 2.), 2);
+    double cHarv = 2. * atan2(sqrt(aHarv), sqrt(1.0 - aHarv));
+    // earth radius varies between 6,356.750-6,378.135 km (3,949.901-3,963.189mi)
+    // The IUGG value for the equatorial radius is 6378.137 km (3963.19 miles)
+    const double earth = 6372797.560856;
+    return earth * cHarv;
+}
+
+double FixedPointCoordinate::ApproximateDistance(const FixedPointCoordinate &c1,
+                                                 const FixedPointCoordinate &c2)
+{
+    return ApproximateDistance(c1.lat, c1.lon, c2.lat, c2.lon);
+}
+
+float FixedPointCoordinate::ApproximateEuclideanDistance(const FixedPointCoordinate &c1,
+                                                 const FixedPointCoordinate &c2)
+{
+    return ApproximateEuclideanDistance(c1.lat, c1.lon, c2.lat, c2.lon);
+}
+
+float FixedPointCoordinate::ApproximateEuclideanDistance(const int lat1,
+                                                          const int lon1,
+                                                          const int lat2,
+                                                          const int lon2)
+{
+    BOOST_ASSERT(lat1 != std::numeric_limits<int>::min());
+    BOOST_ASSERT(lon1 != std::numeric_limits<int>::min());
+    BOOST_ASSERT(lat2 != std::numeric_limits<int>::min());
+    BOOST_ASSERT(lon2 != std::numeric_limits<int>::min());
+
+    const float RAD = 0.017453292519943295769236907684886;
+    const float float_lat1 = (lat1 / COORDINATE_PRECISION) * RAD;
+    const float float_lon1 = (lon1 / COORDINATE_PRECISION) * RAD;
+    const float float_lat2 = (lat2 / COORDINATE_PRECISION) * RAD;
+    const float float_lon2 = (lon2 / COORDINATE_PRECISION) * RAD;
+
+    const float x = (float_lon2 - float_lon1) * cos((float_lat1 + float_lat2) / 2.);
+    const float y = (float_lat2 - float_lat1);
+    const float earth_radius = 6372797.560856;
+    return sqrt(x * x + y * y) * earth_radius;
+}
+
+float FixedPointCoordinate::ComputePerpendicularDistance(const FixedPointCoordinate &point,
+                                                          const FixedPointCoordinate &segA,
+                                                          const FixedPointCoordinate &segB)
+{
+    const float x = lat2y(point.lat / COORDINATE_PRECISION);
+    const float y = point.lon / COORDINATE_PRECISION;
+    const float a = lat2y(segA.lat / COORDINATE_PRECISION);
+    const float b = segA.lon / COORDINATE_PRECISION;
+    const float c = lat2y(segB.lat / COORDINATE_PRECISION);
+    const float d = segB.lon / COORDINATE_PRECISION;
+    float p, q, nY;
+    if (std::abs(a - c) > std::numeric_limits<float>::epsilon())
+    {
+        const float m = (d - b) / (c - a); // slope
+        // Projection of (x,y) on line joining (a,b) and (c,d)
+        p = ((x + (m * y)) + (m * m * a - m * b)) / (1. + m * m);
+        q = b + m * (p - a);
+    }
+    else
+    {
+        p = c;
+        q = y;
+    }
+    nY = (d * p - c * q) / (a * d - b * c);
+
+    // discretize the result to coordinate precision. it's a hack!
+    if (std::abs(nY) < (1. / COORDINATE_PRECISION))
+    {
+        nY = 0.;
+    }
+
+    float r = (p - nY * a) / c;
+    if (std::isnan(r))
+    {
+        r = ((segB.lat == point.lat) && (segB.lon == point.lon)) ? 1. : 0.;
+    }
+    else if (std::abs(r) <= std::numeric_limits<float>::epsilon())
+    {
+        r = 0.;
+    }
+    else if (std::abs(r - 1.) <= std::numeric_limits<float>::epsilon())
+    {
+        r = 1.;
+    }
+    FixedPointCoordinate nearest_location;
+    BOOST_ASSERT(!std::isnan(r));
+    if (r <= 0.)
+    { // point is "left" of edge
+        nearest_location.lat = segA.lat;
+        nearest_location.lon = segA.lon;
+    }
+    else if (r >= 1.)
+    { // point is "right" of edge
+        nearest_location.lat = segB.lat;
+        nearest_location.lon = segB.lon;
+    }
+    else
+    { // point lies in between
+        nearest_location.lat = y2lat(p) * COORDINATE_PRECISION;
+        nearest_location.lon = q * COORDINATE_PRECISION;
+    }
+    BOOST_ASSERT(nearest_location.isValid());
+    const float approximated_distance =
+        FixedPointCoordinate::ApproximateEuclideanDistance(point, nearest_location);
+    BOOST_ASSERT(0. <= approximated_distance);
+    return approximated_distance;
+}
+
+float FixedPointCoordinate::ComputePerpendicularDistance(const FixedPointCoordinate &coord_a,
+                                                   const FixedPointCoordinate &coord_b,
+                                                   const FixedPointCoordinate &query_location,
+                                                   FixedPointCoordinate &nearest_location,
+                                                   float &r)
+{
+    BOOST_ASSERT(query_location.isValid());
+
+    const float x = lat2y(query_location.lat / COORDINATE_PRECISION);
+    const float y = query_location.lon / COORDINATE_PRECISION;
+    const float a = lat2y(coord_a.lat / COORDINATE_PRECISION);
+    const float b = coord_a.lon / COORDINATE_PRECISION;
+    const float c = lat2y(coord_b.lat / COORDINATE_PRECISION);
+    const float d = coord_b.lon / COORDINATE_PRECISION;
+    float p, q /*,mX*/, nY;
+    if (std::abs(a - c) > std::numeric_limits<float>::epsilon())
+    {
+        const float m = (d - b) / (c - a); // slope
+        // Projection of (x,y) on line joining (a,b) and (c,d)
+        p = ((x + (m * y)) + (m * m * a - m * b)) / (1. + m * m);
+        q = b + m * (p - a);
+    }
+    else
+    {
+        p = c;
+        q = y;
+    }
+    nY = (d * p - c * q) / (a * d - b * c);
+
+    // discretize the result to coordinate precision. it's a hack!
+    if (std::abs(nY) < (1. / COORDINATE_PRECISION))
+    {
+        nY = 0.;
+    }
+
+    r = (p - nY * a) / c; // These values are actually n/m+n and m/m+n , we need
+    // not calculate the explicit values of m an n as we
+    // are just interested in the ratio
+    if (std::isnan(r))
+    {
+        r = ((coord_b.lat == query_location.lat) && (coord_b.lon == query_location.lon)) ? 1. : 0.;
+    }
+    else if (std::abs(r) <= std::numeric_limits<float>::epsilon())
+    {
+        r = 0.;
+    }
+    else if (std::abs(r - 1.) <= std::numeric_limits<float>::epsilon())
+    {
+        r = 1.;
+    }
+    BOOST_ASSERT(!std::isnan(r));
+    if (r <= 0.)
+    {
+        nearest_location = coord_a;
+    }
+    else if (r >= 1.)
+    {
+        nearest_location = coord_b;
+    }
+    else
+    {
+        // point lies in between
+        nearest_location.lat = y2lat(p) * COORDINATE_PRECISION;
+        nearest_location.lon = q * COORDINATE_PRECISION;
+    }
+    BOOST_ASSERT(nearest_location.isValid());
+
+    // TODO: Replace with euclidean approximation when k-NN search is done
+    // const float approximated_distance = FixedPointCoordinate::ApproximateEuclideanDistance(
+    const float approximated_distance =
+        FixedPointCoordinate::ApproximateEuclideanDistance(query_location, nearest_location);
+    BOOST_ASSERT(0. <= approximated_distance);
+    return approximated_distance;
+}
+
+void FixedPointCoordinate::convertInternalLatLonToString(const int value, std::string &output)
+{
+    char buffer[12];
+    buffer[11] = 0; // zero termination
+    output = printInt<11, 6>(buffer, value);
+}
+
+void FixedPointCoordinate::convertInternalCoordinateToString(const FixedPointCoordinate &coord,
+                                                             std::string &output)
+{
+    std::string tmp;
+    tmp.reserve(23);
+    convertInternalLatLonToString(coord.lon, tmp);
+    output = tmp;
+    output += ",";
+    convertInternalLatLonToString(coord.lat, tmp);
+    output += tmp;
+}
+
+void
+FixedPointCoordinate::convertInternalReversedCoordinateToString(const FixedPointCoordinate &coord,
+                                                                std::string &output)
+{
+    std::string tmp;
+    tmp.reserve(23);
+    convertInternalLatLonToString(coord.lat, tmp);
+    output = tmp;
+    output += ",";
+    convertInternalLatLonToString(coord.lon, tmp);
+    output += tmp;
+}
+
+void FixedPointCoordinate::Output(std::ostream &out) const
+{
+    out << "(" << lat / COORDINATE_PRECISION << "," << lon / COORDINATE_PRECISION << ")";
+}
+
+float FixedPointCoordinate::GetBearing(const FixedPointCoordinate &A, const FixedPointCoordinate &B)
+{
+    const float delta_long = DegreeToRadian(B.lon / COORDINATE_PRECISION - A.lon / COORDINATE_PRECISION);
+    const float lat1 = DegreeToRadian(A.lat / COORDINATE_PRECISION);
+    const float lat2 = DegreeToRadian(B.lat / COORDINATE_PRECISION);
+    const float y = sin(delta_long) * cos(lat2);
+    const float x = cos(lat1) * sin(lat2) - sin(lat1) * cos(lat2) * cos(delta_long);
+    float result = RadianToDegree(std::atan2(y, x));
+    while (result < 0.f)
+    {
+        result += 360.f;
+    }
+
+    while (result >= 360.f)
+    {
+        result -= 360.f;
+    }
+    return result;
+}
+
+float FixedPointCoordinate::GetBearing(const FixedPointCoordinate &other) const
+{
+    const float delta_long = DegreeToRadian(lon / COORDINATE_PRECISION - other.lon / COORDINATE_PRECISION);
+    const float lat1 = DegreeToRadian(other.lat / COORDINATE_PRECISION);
+    const float lat2 = DegreeToRadian(lat / COORDINATE_PRECISION);
+    const float y = std::sin(delta_long) * std::cos(lat2);
+    const float x = std::cos(lat1) * std::sin(lat2) - std::sin(lat1) * std::cos(lat2) * std::cos(delta_long);
+    float result = RadianToDegree(std::atan2(y, x));
+
+    while (result < 0.f)
+    {
+        result += 360.f;
+    }
+
+    while (result >= 360.f)
+    {
+        result -= 360.f;
+    }
+    return result;
+}
+
+float FixedPointCoordinate::DegreeToRadian(const float degree)
+{
+    return degree * (M_PI / 180.f);
+}
+
+float FixedPointCoordinate::RadianToDegree(const float radian) 
+{
+    return radian * (180.f / M_PI);
+}

DataStructures/DeallocatingVector.h

@@ -32,292 +32,369 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <cstring>
 #include <vector>
 
-#if __cplusplus > 199711L
-#define DEALLOCATION_VECTOR_NULL_PTR nullptr
-#else
-#define DEALLOCATION_VECTOR_NULL_PTR NULL
-#endif
-
-
-template<typename ElementT, std::size_t bucketSizeC = 8388608/sizeof(ElementT), bool DeallocateC = false>
-class DeallocatingVectorIterator : public std::iterator<std::random_access_iterator_tag, ElementT> {
-protected:
-
-    class DeallocatingVectorIteratorState {
-    private:
-        //make constructors explicit, so we do not mix random access and deallocation iterators.
+template <typename ElementT,
+          std::size_t bucketSizeC = 8388608 / sizeof(ElementT),
+          bool DeallocateC = false>
+class DeallocatingVectorIterator : public std::iterator<std::random_access_iterator_tag, ElementT>
+{
+  protected:
+    class DeallocatingVectorIteratorState
+    {
+      private:
+        // make constructors explicit, so we do not mix random access and deallocation iterators.
         DeallocatingVectorIteratorState();
-    public:
-        explicit DeallocatingVectorIteratorState(const DeallocatingVectorIteratorState &r) : /*mData(r.mData),*/ mIndex(r.mIndex), mBucketList(r.mBucketList) {}
-        explicit DeallocatingVectorIteratorState(const std::size_t idx, std::vector<ElementT *> & input_list) : /*mData(DEALLOCATION_VECTOR_NULL_PTR),*/ mIndex(idx), mBucketList(input_list) {
-        }
-        std::size_t mIndex;
-        std::vector<ElementT *> & mBucketList;
 
-        inline bool operator!=(const DeallocatingVectorIteratorState &other) {
-            return mIndex != other.mIndex;
+      public:
+        explicit DeallocatingVectorIteratorState(const DeallocatingVectorIteratorState &r)
+            : index(r.index), bucket_list(r.bucket_list)
+        {
+        }
+        explicit DeallocatingVectorIteratorState(const std::size_t idx,
+                                                 std::vector<ElementT *> &input_list)
+            : index(idx), bucket_list(input_list)
+        {
+        }
+        std::size_t index;
+        std::vector<ElementT *> &bucket_list;
+
+        inline bool operator!=(const DeallocatingVectorIteratorState &other)
+        {
+            return index != other.index;
         }
 
-        inline bool operator==(const DeallocatingVectorIteratorState &other) {
-            return mIndex == other.mIndex;
+        inline bool operator==(const DeallocatingVectorIteratorState &other)
+        {
+            return index == other.index;
         }
 
-        bool operator<(const DeallocatingVectorIteratorState &other) const {
-            return mIndex < other.mIndex;
+        bool operator<(const DeallocatingVectorIteratorState &other) const
+        {
+            return index < other.index;
         }
 
-        bool operator>(const DeallocatingVectorIteratorState &other) const {
-            return mIndex > other.mIndex;
+        bool operator>(const DeallocatingVectorIteratorState &other) const
+        {
+            return index > other.index;
         }
 
-        bool operator>=(const DeallocatingVectorIteratorState &other) const {
-            return mIndex >= other.mIndex;
+        bool operator>=(const DeallocatingVectorIteratorState &other) const
+        {
+            return index >= other.index;
         }
 
-        //This is a hack to make assignment operator possible with reference member
-        inline DeallocatingVectorIteratorState& operator= (const DeallocatingVectorIteratorState &a) {
-            if (this != &a) {
-                this->DeallocatingVectorIteratorState::~DeallocatingVectorIteratorState(); // explicit non-virtual destructor
+        // This is a hack to make assignment operator possible with reference member
+        inline DeallocatingVectorIteratorState &operator=(const DeallocatingVectorIteratorState &a)
+        {
+            if (this != &a)
+            {
+                this->DeallocatingVectorIteratorState::
+                    ~DeallocatingVectorIteratorState();        // explicit non-virtual destructor
                 new (this) DeallocatingVectorIteratorState(a); // placement new
             }
             return *this;
         }
     };
 
-    DeallocatingVectorIteratorState mState;
+    DeallocatingVectorIteratorState current_state;
 
-public:
+  public:
     typedef std::random_access_iterator_tag iterator_category;
-    typedef typename std::iterator<std::random_access_iterator_tag, ElementT>::value_type value_type;
-    typedef typename std::iterator<std::random_access_iterator_tag, ElementT>::difference_type difference_type;
+    typedef typename std::iterator<std::random_access_iterator_tag, ElementT>::value_type
+    value_type;
+    typedef typename std::iterator<std::random_access_iterator_tag, ElementT>::difference_type
+    difference_type;
     typedef typename std::iterator<std::random_access_iterator_tag, ElementT>::reference reference;
     typedef typename std::iterator<std::random_access_iterator_tag, ElementT>::pointer pointer;
 
     DeallocatingVectorIterator() {}
 
-    template<typename T2>
-    explicit DeallocatingVectorIterator(const DeallocatingVectorIterator<T2> & r) : mState(r.mState) {}
-
-    DeallocatingVectorIterator(std::size_t idx, std::vector<ElementT *> & input_list) : mState(idx, input_list) {}
-    explicit DeallocatingVectorIterator(const DeallocatingVectorIteratorState & r) : mState(r) {}
-
-    template<typename T2>
-    DeallocatingVectorIterator& operator=(const DeallocatingVectorIterator<T2> &r) {
-        if(DeallocateC) BOOST_ASSERT(false);
-        mState = r.mState; return *this;
+    template <typename T2>
+    explicit DeallocatingVectorIterator(const DeallocatingVectorIterator<T2> &r)
+        : current_state(r.current_state)
+    {
     }
 
-    inline DeallocatingVectorIterator& operator++() { //prefix
-        ++mState.mIndex;
+    DeallocatingVectorIterator(std::size_t idx, std::vector<ElementT *> &input_list)
+        : current_state(idx, input_list)
+    {
+    }
+    explicit DeallocatingVectorIterator(const DeallocatingVectorIteratorState &r) : current_state(r) {}
+
+    template <typename T2>
+    DeallocatingVectorIterator &operator=(const DeallocatingVectorIterator<T2> &r)
+    {
+        if (DeallocateC)
+        {
+            BOOST_ASSERT(false);
+        }
+        current_state = r.current_state;
         return *this;
     }
 
-    inline DeallocatingVectorIterator& operator--() { //prefix
-        if(DeallocateC) BOOST_ASSERT(false);
-        --mState.mIndex;
+    inline DeallocatingVectorIterator &operator++()
+    { // prefix
+        ++current_state.index;
         return *this;
     }
 
-    inline DeallocatingVectorIterator operator++(int) { //postfix
-        DeallocatingVectorIteratorState _myState(mState);
-        mState.mIndex++;
-        return DeallocatingVectorIterator(_myState);
-    }
-    inline DeallocatingVectorIterator operator--(int) { //postfix
-        if(DeallocateC) BOOST_ASSERT(false);
-        DeallocatingVectorIteratorState _myState(mState);
-        mState.mIndex--;
-        return DeallocatingVectorIterator(_myState);
+    inline DeallocatingVectorIterator &operator--()
+    { // prefix
+        if (DeallocateC)
+        {
+            BOOST_ASSERT(false);
+        }
+        --current_state.index;
+        return *this;
     }
 
-    inline DeallocatingVectorIterator operator+(const difference_type& n) const {
-        DeallocatingVectorIteratorState _myState(mState);
-        _myState.mIndex+=n;
-        return DeallocatingVectorIterator(_myState);
+    inline DeallocatingVectorIterator operator++(int)
+    { // postfix
+        DeallocatingVectorIteratorState my_state(current_state);
+        current_state.index++;
+        return DeallocatingVectorIterator(my_state);
+    }
+    inline DeallocatingVectorIterator operator--(int)
+    { // postfix
+        if (DeallocateC)
+        {
+            BOOST_ASSERT(false);
+        }
+        DeallocatingVectorIteratorState my_state(current_state);
+        current_state.index--;
+        return DeallocatingVectorIterator(my_state);
     }
 
-    inline DeallocatingVectorIterator& operator+=(const difference_type& n) {
-        mState.mIndex+=n; return *this;
+    inline DeallocatingVectorIterator operator+(const difference_type &n) const
+    {
+        DeallocatingVectorIteratorState my_state(current_state);
+        my_state.index += n;
+        return DeallocatingVectorIterator(my_state);
     }
 
-    inline DeallocatingVectorIterator operator-(const difference_type& n) const {
-        if(DeallocateC) BOOST_ASSERT(false);
-        DeallocatingVectorIteratorState _myState(mState);
-        _myState.mIndex-=n;
-        return DeallocatingVectorIterator(_myState);
+    inline DeallocatingVectorIterator &operator+=(const difference_type &n)
+    {
+        current_state.index += n;
+        return *this;
     }
 
-    inline DeallocatingVectorIterator& operator-=(const difference_type &n) const {
-        if(DeallocateC) BOOST_ASSERT(false);
-        mState.mIndex-=n; return *this;
+    inline DeallocatingVectorIterator operator-(const difference_type &n) const
+    {
+        if (DeallocateC)
+        {
+            BOOST_ASSERT(false);
+        }
+        DeallocatingVectorIteratorState my_state(current_state);
+        my_state.index -= n;
+        return DeallocatingVectorIterator(my_state);
     }
 
-    inline reference operator*() const {
-        std::size_t _bucket = mState.mIndex/bucketSizeC;
-        std::size_t _index = mState.mIndex%bucketSizeC;
-        return (mState.mBucketList[_bucket][_index]);
+    inline DeallocatingVectorIterator &operator-=(const difference_type &n) const
+    {
+        if (DeallocateC)
+        {
+            BOOST_ASSERT(false);
+        }
+        current_state.index -= n;
+        return *this;
     }
 
-    inline pointer operator->() const {
-        std::size_t _bucket = mState.mIndex/bucketSizeC;
-        std::size_t _index = mState.mIndex%bucketSizeC;
-        return &(mState.mBucketList[_bucket][_index]);
+    inline reference operator*() const
+    {
+        std::size_t current_bucket = current_state.index / bucketSizeC;
+        std::size_t current_index = current_state.index % bucketSizeC;
+        return (current_state.bucket_list[current_bucket][current_index]);
     }
 
-    inline bool operator!=(const DeallocatingVectorIterator & other) {
-        return mState != other.mState;
+    inline pointer operator->() const
+    {
+        std::size_t current_bucket = current_state.index / bucketSizeC;
+        std::size_t current_index = current_state.index % bucketSizeC;
+        return &(current_state.bucket_list[current_bucket][current_index]);
     }
 
-    inline bool operator==(const DeallocatingVectorIterator & other) {
-        return mState == other.mState;
+    inline bool operator!=(const DeallocatingVectorIterator &other)
+    {
+        return current_state != other.current_state;
     }
 
-    inline bool operator<(const DeallocatingVectorIterator & other) const {
-        return mState < other.mState;
+    inline bool operator==(const DeallocatingVectorIterator &other)
+    {
+        return current_state == other.current_state;
     }
 
-    inline bool operator>(const DeallocatingVectorIterator & other) const {
-        return mState > other.mState;
+    inline bool operator<(const DeallocatingVectorIterator &other) const
+    {
+        return current_state < other.current_state;
     }
 
-    inline bool operator>=(const DeallocatingVectorIterator & other) const {
-        return mState >= other.mState;
+    inline bool operator>(const DeallocatingVectorIterator &other) const
+    {
+        return current_state > other.current_state;
     }
 
-    difference_type operator-(const DeallocatingVectorIterator & other) {
-        if(DeallocateC) BOOST_ASSERT(false);
-        return mState.mIndex-other.mState.mIndex;
+    inline bool operator>=(const DeallocatingVectorIterator &other) const
+    {
+        return current_state >= other.current_state;
+    }
+
+    difference_type operator-(const DeallocatingVectorIterator &other)
+    {
+        if (DeallocateC)
+        {
+            BOOST_ASSERT(false);
+        }
+        return current_state.index - other.current_state.index;
     }
 };
 
-template<typename ElementT, std::size_t bucketSizeC = 8388608/sizeof(ElementT) >
-class DeallocatingVector {
-private:
-    std::size_t mCurrentSize;
-    std::vector<ElementT *> mBucketList;
+template <typename ElementT, std::size_t bucketSizeC = 8388608 / sizeof(ElementT)>
+class DeallocatingVector
+{
+  private:
+    std::size_t current_size;
+    std::vector<ElementT *> bucket_list;
 
-public:
+  public:
     typedef ElementT value_type;
     typedef DeallocatingVectorIterator<ElementT, bucketSizeC, false> iterator;
     typedef DeallocatingVectorIterator<ElementT, bucketSizeC, false> const_iterator;
 
-    //this iterator deallocates all buckets that have been visited. Iterators to visited objects become invalid.
+    // this iterator deallocates all buckets that have been visited. Iterators to visited objects
+    // become invalid.
     typedef DeallocatingVectorIterator<ElementT, bucketSizeC, true> deallocation_iterator;
 
-    DeallocatingVector() : mCurrentSize(0) {
-        //initial bucket
-        mBucketList.push_back(new ElementT[bucketSizeC]);
+    DeallocatingVector() : current_size(0)
+    {
+        // initial bucket
+        bucket_list.emplace_back(new ElementT[bucketSizeC]);
     }
 
-    ~DeallocatingVector() {
-        clear();
+    ~DeallocatingVector() { clear(); }
+
+    inline void swap(DeallocatingVector<ElementT, bucketSizeC> &other)
+    {
+        std::swap(current_size, other.current_size);
+        bucket_list.swap(other.bucket_list);
     }
 
-    inline void swap(DeallocatingVector<ElementT, bucketSizeC> & other) {
-        std::swap(mCurrentSize, other.mCurrentSize);
-        mBucketList.swap(other.mBucketList);
-    }
-
-    inline void clear() {
-        //Delete[]'ing ptr's to all Buckets
-        for(unsigned i = 0; i < mBucketList.size(); ++i) {
-            if(DEALLOCATION_VECTOR_NULL_PTR != mBucketList[i]) {
-                delete[] mBucketList[i];
-                mBucketList[i] = DEALLOCATION_VECTOR_NULL_PTR;
+    inline void clear()
+    {
+        // Delete[]'ing ptr's to all Buckets
+        for (unsigned i = 0; i < bucket_list.size(); ++i)
+        {
+            if (nullptr != bucket_list[i])
+            {
+                delete[] bucket_list[i];
+                bucket_list[i] = nullptr;
             }
         }
-        //Removing all ptrs from vector
-        std::vector<ElementT *>().swap(mBucketList);
-        mCurrentSize = 0;
+        // Removing all ptrs from vector
+        std::vector<ElementT *>().swap(bucket_list);
+        current_size = 0;
     }
 
-    inline void push_back(const ElementT & element) {
-        std::size_t _capacity = capacity();
-        if(mCurrentSize == _capacity) {
-            mBucketList.push_back(new ElementT[bucketSizeC]);
+    inline void push_back(const ElementT &element)
+    {
+        const std::size_t current_capacity = capacity();
+        if (current_size == current_capacity)
+        {
+            bucket_list.push_back(new ElementT[bucketSizeC]);
         }
 
-        std::size_t _index = size()%bucketSizeC;
-        mBucketList.back()[_index] = element;
-        ++mCurrentSize;
+        std::size_t current_index = size() % bucketSizeC;
+        bucket_list.back()[current_index] = element;
+        ++current_size;
     }
 
-    inline void reserve(const std::size_t) const {
-        //don't do anything
+    inline void emplace_back(const ElementT &&element)
+    {
+        const std::size_t current_capacity = capacity();
+        if (current_size == current_capacity)
+        {
+            bucket_list.push_back(new ElementT[bucketSizeC]);
+        }
+
+        const std::size_t current_index = size() % bucketSizeC;
+        bucket_list.back()[current_index] = element;
+        ++current_size;
     }
 
-    inline void resize(const std::size_t new_size) {
-        if(new_size > mCurrentSize) {
-            while(capacity() < new_size) {
-                mBucketList.push_back(new ElementT[bucketSizeC]);
+    inline void reserve(const std::size_t) const
+    {
+        // don't do anything
+    }
+
+    inline void resize(const std::size_t new_size)
+    {
+        if (new_size > current_size)
+        {
+            while (capacity() < new_size)
+            {
+                bucket_list.push_back(new ElementT[bucketSizeC]);
             }
-            mCurrentSize = new_size;
+            current_size = new_size;
         }
-        if(new_size < mCurrentSize) {
-            std::size_t number_of_necessary_buckets = 1+(new_size / bucketSizeC);
+        if (new_size < current_size)
+        {
+            const std::size_t number_of_necessary_buckets = 1 + (new_size / bucketSizeC);
 
-            for(unsigned i = number_of_necessary_buckets; i < mBucketList.size(); ++i) {
-                delete[] mBucketList[i];
+            for (unsigned i = number_of_necessary_buckets; i < bucket_list.size(); ++i)
+            {
+                delete[] bucket_list[i];
             }
-            mBucketList.resize(number_of_necessary_buckets);
-            mCurrentSize = new_size;
+            bucket_list.resize(number_of_necessary_buckets);
+            current_size = new_size;
         }
     }
 
-    inline std::size_t size() const {
-        return mCurrentSize;
+    inline std::size_t size() const { return current_size; }
+
+    inline std::size_t capacity() const { return bucket_list.size() * bucketSizeC; }
+
+    inline iterator begin() { return iterator(static_cast<std::size_t>(0), bucket_list); }
+
+    inline iterator end() { return iterator(size(), bucket_list); }
+
+    inline deallocation_iterator dbegin()
+    {
+        return deallocation_iterator(static_cast<std::size_t>(0), bucket_list);
     }
 
-    inline std::size_t capacity() const {
-        return mBucketList.size() * bucketSizeC;
+    inline deallocation_iterator dend() { return deallocation_iterator(size(), bucket_list); }
+
+    inline const_iterator begin() const
+    {
+        return const_iterator(static_cast<std::size_t>(0), bucket_list);
     }
 
-    inline iterator begin() {
-        return iterator(static_cast<std::size_t>(0), mBucketList);
-    }
+    inline const_iterator end() const { return const_iterator(size(), bucket_list); }
 
-    inline iterator end() {
-        return iterator(size(), mBucketList);
-    }
-
-    inline deallocation_iterator dbegin() {
-        return deallocation_iterator(static_cast<std::size_t>(0), mBucketList);
-    }
-
-    inline deallocation_iterator dend() {
-        return deallocation_iterator(size(), mBucketList);
-    }
-
-    inline const_iterator begin() const {
-        return const_iterator(static_cast<std::size_t>(0), mBucketList);
-    }
-
-    inline const_iterator end() const {
-        return const_iterator(size(), mBucketList);
-    }
-
-    inline ElementT & operator[](const std::size_t index) {
+    inline ElementT &operator[](const std::size_t index)
+    {
         std::size_t _bucket = index / bucketSizeC;
         std::size_t _index = index % bucketSizeC;
-        return (mBucketList[_bucket][_index]);
+        return (bucket_list[_bucket][_index]);
     }
 
-    const inline ElementT & operator[](const std::size_t index) const {
+    const inline ElementT &operator[](const std::size_t index) const
+    {
         std::size_t _bucket = index / bucketSizeC;
         std::size_t _index = index % bucketSizeC;
-        return (mBucketList[_bucket][_index]);
+        return (bucket_list[_bucket][_index]);
     }
 
-    inline ElementT & back() {
-        std::size_t _bucket = mCurrentSize / bucketSizeC;
-    	std::size_t _index = mCurrentSize % bucketSizeC;
-    	return (mBucketList[_bucket][_index]);
+    inline ElementT &back()
+    {
+        std::size_t _bucket = current_size / bucketSizeC;
+        std::size_t _index = current_size % bucketSizeC;
+        return (bucket_list[_bucket][_index]);
     }
 
-    const inline ElementT & back() const {
-        std::size_t _bucket = mCurrentSize / bucketSizeC;
-        std::size_t _index = mCurrentSize % bucketSizeC;
-    	return (mBucketList[_bucket][_index]);
+    const inline ElementT &back() const
+    {
+        std::size_t _bucket = current_size / bucketSizeC;
+        std::size_t _index = current_size % bucketSizeC;
+        return (bucket_list[_bucket][_index]);
     }
 };
 

DataStructures/DynamicGraph.h

@@ -25,223 +25,257 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef DYNAMICGRAPH_H_INCLUDED
-#define DYNAMICGRAPH_H_INCLUDED
+#ifndef DYNAMICGRAPH_H
+#define DYNAMICGRAPH_H
 
 #include "../DataStructures/DeallocatingVector.h"
 
 #include <boost/assert.hpp>
-#include <boost/integer.hpp>
+#include <boost/range/irange.hpp>
+
+#include <cstdint>
 
 #include <algorithm>
 #include <limits>
 #include <vector>
 
-template< typename EdgeDataT>
-class DynamicGraph {
-    public:
-        typedef EdgeDataT EdgeData;
-        typedef unsigned NodeIterator;
-        typedef unsigned EdgeIterator;
+template <typename EdgeDataT> class DynamicGraph
+{
+  public:
+    typedef decltype(boost::irange(0u,0u)) EdgeRange;
+    typedef EdgeDataT EdgeData;
+    typedef unsigned NodeIterator;
+    typedef unsigned EdgeIterator;
 
-        class InputEdge {
-            public:
-                NodeIterator source;
-                NodeIterator target;
-                EdgeDataT data;
-                bool operator<( const InputEdge& right ) const {
-                    if ( source != right.source )
-                        return source < right.source;
-                    return target < right.target;
-                }
-        };
-
-        //Constructs an empty graph with a given number of nodes.
-        explicit DynamicGraph( int32_t nodes ) : m_numNodes(nodes), m_numEdges(0) {
-            m_nodes.reserve( m_numNodes );
-            m_nodes.resize( m_numNodes );
-
-            m_edges.reserve( m_numNodes * 1.1 );
-            m_edges.resize( m_numNodes );
+    class InputEdge
+    {
+      public:
+        NodeIterator source;
+        NodeIterator target;
+        EdgeDataT data;
+        bool operator<(const InputEdge &right) const
+        {
+            if (source != right.source)
+                return source < right.source;
+            return target < right.target;
         }
+    };
 
-        template<class ContainerT>
-        DynamicGraph( const int32_t nodes, const ContainerT &graph ) {
-            m_numNodes = nodes;
-            m_numEdges = ( EdgeIterator ) graph.size();
-            m_nodes.reserve( m_numNodes +1);
-            m_nodes.resize( m_numNodes +1);
-            EdgeIterator edge = 0;
-            EdgeIterator position = 0;
-            for ( NodeIterator node = 0; node < m_numNodes; ++node ) {
-                EdgeIterator lastEdge = edge;
-                while ( edge < m_numEdges && graph[edge].source == node ) {
-                    ++edge;
-                }
-                m_nodes[node].firstEdge = position;
-                m_nodes[node].edges = edge - lastEdge;
-                position += m_nodes[node].edges;
+    // Constructs an empty graph with a given number of nodes.
+    explicit DynamicGraph(int32_t nodes) : m_numNodes(nodes), m_numEdges(0)
+    {
+        m_nodes.reserve(m_numNodes);
+        m_nodes.resize(m_numNodes);
+
+        m_edges.reserve(m_numNodes * 1.1);
+        m_edges.resize(m_numNodes);
+    }
+
+    template <class ContainerT> DynamicGraph(const int32_t nodes, const ContainerT &graph)
+    {
+        m_numNodes = nodes;
+        m_numEdges = (EdgeIterator)graph.size();
+        m_nodes.reserve(m_numNodes + 1);
+        m_nodes.resize(m_numNodes + 1);
+        EdgeIterator edge = 0;
+        EdgeIterator position = 0;
+        for (NodeIterator node = 0; node < m_numNodes; ++node)
+        {
+            EdgeIterator lastEdge = edge;
+            while (edge < m_numEdges && graph[edge].source == node)
+            {
+                ++edge;
             }
-            m_nodes.back().firstEdge = position;
-            m_edges.reserve( position * 1.1 );
-            m_edges.resize( position );
-            edge = 0;
-            for ( NodeIterator node = 0; node < m_numNodes; ++node ) {
-                for ( EdgeIterator i = m_nodes[node].firstEdge, e = m_nodes[node].firstEdge + m_nodes[node].edges; i != e; ++i ) {
-                    m_edges[i].target = graph[edge].target;
-                    m_edges[i].data = graph[edge].data;
-                    BOOST_ASSERT_MSG(
-                        graph[edge].data.distance > 0,
-                        "edge distance invalid"
-                    );
-                    ++edge;
+            m_nodes[node].firstEdge = position;
+            m_nodes[node].edges = edge - lastEdge;
+            position += m_nodes[node].edges;
+        }
+        m_nodes.back().firstEdge = position;
+        m_edges.reserve(position * 1.1);
+        m_edges.resize(position);
+        edge = 0;
+        for (NodeIterator node = 0; node < m_numNodes; ++node)
+        {
+            for (EdgeIterator i = m_nodes[node].firstEdge,
+                              e = m_nodes[node].firstEdge + m_nodes[node].edges;
+                 i != e;
+                 ++i)
+            {
+                m_edges[i].target = graph[edge].target;
+                m_edges[i].data = graph[edge].data;
+                BOOST_ASSERT_MSG(graph[edge].data.distance > 0, "edge distance invalid");
+                ++edge;
+            }
+        }
+    }
+
+    ~DynamicGraph() {}
+
+    unsigned GetNumberOfNodes() const { return m_numNodes; }
+
+    unsigned GetNumberOfEdges() const { return m_numEdges; }
+
+    unsigned GetOutDegree(const NodeIterator n) const { return m_nodes[n].edges; }
+
+    unsigned GetDirectedOutDegree(const NodeIterator n) const
+    {
+        unsigned degree = 0;
+        for(EdgeIterator edge = BeginEdges(n); edge < EndEdges(n); ++edge)
+        {
+            if (GetEdgeData(edge).forward)
+            {
+                ++degree;
+            }
+        }
+        return degree;
+    }
+
+    NodeIterator GetTarget(const EdgeIterator e) const { return NodeIterator(m_edges[e].target); }
+
+    void SetTarget(const EdgeIterator e, const NodeIterator n) { m_edges[e].target = n; }
+
+    EdgeDataT &GetEdgeData(const EdgeIterator e) { return m_edges[e].data; }
+
+    const EdgeDataT &GetEdgeData(const EdgeIterator e) const { return m_edges[e].data; }
+
+    EdgeIterator BeginEdges(const NodeIterator n) const
+    {
+        return EdgeIterator(m_nodes[n].firstEdge);
+    }
+
+    EdgeIterator EndEdges(const NodeIterator n) const
+    {
+        return EdgeIterator(m_nodes[n].firstEdge + m_nodes[n].edges);
+    }
+
+    EdgeRange GetAdjacentEdgeRange(const NodeIterator node) const
+    {
+        return boost::irange(BeginEdges(node), EndEdges(node));
+    }
+
+    // adds an edge. Invalidates edge iterators for the source node
+    EdgeIterator InsertEdge(const NodeIterator from, const NodeIterator to, const EdgeDataT &data)
+    {
+        Node &node = m_nodes[from];
+        EdgeIterator newFirstEdge = node.edges + node.firstEdge;
+        if (newFirstEdge >= m_edges.size() || !isDummy(newFirstEdge))
+        {
+            if (node.firstEdge != 0 && isDummy(node.firstEdge - 1))
+            {
+                node.firstEdge--;
+                m_edges[node.firstEdge] = m_edges[node.firstEdge + node.edges];
+            }
+            else
+            {
+                EdgeIterator newFirstEdge = (EdgeIterator)m_edges.size();
+                unsigned newSize = node.edges * 1.1 + 2;
+                EdgeIterator requiredCapacity = newSize + m_edges.size();
+                EdgeIterator oldCapacity = m_edges.capacity();
+                if (requiredCapacity >= oldCapacity)
+                {
+                    m_edges.reserve(requiredCapacity * 1.1);
                 }
+                m_edges.resize(m_edges.size() + newSize);
+                for (EdgeIterator i = 0; i < node.edges; ++i)
+                {
+                    m_edges[newFirstEdge + i] = m_edges[node.firstEdge + i];
+                    makeDummy(node.firstEdge + i);
+                }
+                for (EdgeIterator i = node.edges + 1; i < newSize; ++i)
+                    makeDummy(newFirstEdge + i);
+                node.firstEdge = newFirstEdge;
+            }
+        }
+        Edge &edge = m_edges[node.firstEdge + node.edges];
+        edge.target = to;
+        edge.data = data;
+        ++m_numEdges;
+        ++node.edges;
+        return EdgeIterator(node.firstEdge + node.edges);
+    }
+
+    // removes an edge. Invalidates edge iterators for the source node
+    void DeleteEdge(const NodeIterator source, const EdgeIterator e)
+    {
+        Node &node = m_nodes[source];
+#pragma omp atomic
+        --m_numEdges;
+        --node.edges;
+        BOOST_ASSERT(std::numeric_limits<unsigned>::max() != node.edges);
+        const unsigned last = node.firstEdge + node.edges;
+        BOOST_ASSERT(std::numeric_limits<unsigned>::max() != last);
+        // swap with last edge
+        m_edges[e] = m_edges[last];
+        makeDummy(last);
+    }
+
+    // removes all edges (source,target)
+    int32_t DeleteEdgesTo(const NodeIterator source, const NodeIterator target)
+    {
+        int32_t deleted = 0;
+        for (EdgeIterator i = BeginEdges(source), iend = EndEdges(source); i < iend - deleted; ++i)
+        {
+            if (m_edges[i].target == target)
+            {
+                do
+                {
+                    deleted++;
+                    m_edges[i] = m_edges[iend - deleted];
+                    makeDummy(iend - deleted);
+                } while (i < iend - deleted && m_edges[i].target == target);
             }
         }
 
-        ~DynamicGraph(){ }
+#pragma omp atomic
+        m_numEdges -= deleted;
+        m_nodes[source].edges -= deleted;
 
-        unsigned GetNumberOfNodes() const {
-            return m_numNodes;
-        }
+        return deleted;
+    }
 
-        unsigned GetNumberOfEdges() const {
-            return m_numEdges;
-        }
-
-        unsigned GetOutDegree( const NodeIterator n ) const {
-            return m_nodes[n].edges;
-        }
-
-        NodeIterator GetTarget( const EdgeIterator e ) const {
-            return NodeIterator( m_edges[e].target );
-        }
-
-        void SetTarget( const EdgeIterator e, const NodeIterator n ) {
-            m_edges[e].target = n;
-        }
-
-        EdgeDataT &GetEdgeData( const EdgeIterator e ) {
-            return m_edges[e].data;
-        }
-
-        const EdgeDataT &GetEdgeData( const EdgeIterator e ) const {
-            return m_edges[e].data;
-        }
-
-        EdgeIterator BeginEdges( const NodeIterator n ) const {
-            return EdgeIterator( m_nodes[n].firstEdge );
-        }
-
-        EdgeIterator EndEdges( const NodeIterator n ) const {
-            return EdgeIterator( m_nodes[n].firstEdge + m_nodes[n].edges );
-        }
-
-        //adds an edge. Invalidates edge iterators for the source node
-        EdgeIterator InsertEdge( const NodeIterator from, const NodeIterator to, const EdgeDataT &data ) {
-            Node &node = m_nodes[from];
-            EdgeIterator newFirstEdge = node.edges + node.firstEdge;
-            if ( newFirstEdge >= m_edges.size() || !isDummy( newFirstEdge ) ) {
-                if ( node.firstEdge != 0 && isDummy( node.firstEdge - 1 ) ) {
-                    node.firstEdge--;
-                    m_edges[node.firstEdge] = m_edges[node.firstEdge + node.edges];
-                } else {
-                    EdgeIterator newFirstEdge = ( EdgeIterator ) m_edges.size();
-                    unsigned newSize = node.edges * 1.1 + 2;
-                    EdgeIterator requiredCapacity = newSize + m_edges.size();
-                    EdgeIterator oldCapacity = m_edges.capacity();
-                    if ( requiredCapacity >= oldCapacity ) {
-                        m_edges.reserve( requiredCapacity * 1.1 );
-                    }
-                    m_edges.resize( m_edges.size() + newSize );
-                    for ( EdgeIterator i = 0; i < node.edges; ++i ) {
-                        m_edges[newFirstEdge + i ] = m_edges[node.firstEdge + i];
-                        makeDummy( node.firstEdge + i );
-                    }
-                    for ( EdgeIterator i = node.edges + 1; i < newSize; ++i )
-                        makeDummy( newFirstEdge + i );
-                    node.firstEdge = newFirstEdge;
-                }
+    // searches for a specific edge
+    EdgeIterator FindEdge(const NodeIterator from, const NodeIterator to) const
+    {
+        for (EdgeIterator i = BeginEdges(from), iend = EndEdges(from); i != iend; ++i)
+        {
+            if (to == m_edges[i].target)
+            {
+                return i;
             }
-            Edge &edge = m_edges[node.firstEdge + node.edges];
-            edge.target = to;
-            edge.data = data;
-            ++m_numEdges;
-            ++node.edges;
-            return EdgeIterator( node.firstEdge + node.edges );
         }
+        return EndEdges(from);
+    }
 
-        //removes an edge. Invalidates edge iterators for the source node
-        void DeleteEdge( const NodeIterator source, const EdgeIterator e ) {
-            Node &node = m_nodes[source];
-            #pragma omp atomic
-            --m_numEdges;
-            --node.edges;
-            BOOST_ASSERT(UINT_MAX != node.edges);
-            const unsigned last = node.firstEdge + node.edges;
-            BOOST_ASSERT( UINT_MAX != last);
-            //swap with last edge
-            m_edges[e] = m_edges[last];
-            makeDummy( last );
-        }
+  protected:
+    bool isDummy(const EdgeIterator edge) const
+    {
+        return m_edges[edge].target == (std::numeric_limits<NodeIterator>::max)();
+    }
 
-        //removes all edges (source,target)
-        int32_t DeleteEdgesTo( const NodeIterator source, const NodeIterator target ) {
-            int32_t deleted = 0;
-            for ( EdgeIterator i = BeginEdges( source ), iend = EndEdges( source ); i < iend - deleted; ++i ) {
-                if ( m_edges[i].target == target ) {
-                    do {
-                        deleted++;
-                        m_edges[i] = m_edges[iend - deleted];
-                        makeDummy( iend - deleted );
-                    } while ( i < iend - deleted && m_edges[i].target == target );
-                }
-            }
+    void makeDummy(const EdgeIterator edge)
+    {
+        m_edges[edge].target = (std::numeric_limits<NodeIterator>::max)();
+    }
 
-            #pragma omp atomic
-            m_numEdges -= deleted;
-            m_nodes[source].edges -= deleted;
+    struct Node
+    {
+        // index of the first edge
+        EdgeIterator firstEdge;
+        // amount of edges
+        unsigned edges;
+    };
 
-            return deleted;
-        }
+    struct Edge
+    {
+        NodeIterator target;
+        EdgeDataT data;
+    };
 
-        //searches for a specific edge
-        EdgeIterator FindEdge( const NodeIterator from, const NodeIterator to ) const {
-            for ( EdgeIterator i = BeginEdges( from ), iend = EndEdges( from ); i != iend; ++i ) {
-                if ( to == m_edges[i].target ) {
-                    return i;
-                }
-            }
-            return EndEdges( from );
-        }
+    NodeIterator m_numNodes;
+    EdgeIterator m_numEdges;
 
-    protected:
-
-        bool isDummy( const EdgeIterator edge ) const {
-            return m_edges[edge].target == (std::numeric_limits< NodeIterator >::max)();
-        }
-
-        void makeDummy( const EdgeIterator edge ) {
-            m_edges[edge].target = (std::numeric_limits< NodeIterator >::max)();
-        }
-
-        struct Node {
-            //index of the first edge
-            EdgeIterator firstEdge;
-            //amount of edges
-            unsigned edges;
-        };
-
-        struct Edge {
-            NodeIterator target;
-            EdgeDataT data;
-        };
-
-        NodeIterator m_numNodes;
-        EdgeIterator m_numEdges;
-
-        std::vector< Node > m_nodes;
-        DeallocatingVector< Edge > m_edges;
+    std::vector<Node> m_nodes;
+    DeallocatingVector<Edge> m_edges;
 };
 
-#endif // DYNAMICGRAPH_H_INCLUDED
+#endif // DYNAMICGRAPH_H

DataStructures/EdgeBasedNode.h

@@ -1,7 +1,6 @@
 #ifndef EDGE_BASED_NODE_H
 #define EDGE_BASED_NODE_H
 
-#include "../Util/MercatorUtil.h"
 #include "../Util/SimpleLogger.h"
 #include "../typedefs.h"
 
@@ -11,7 +10,8 @@
 
 #include <limits>
 
-struct EdgeBasedNode {
+struct EdgeBasedNode
+{
 
     EdgeBasedNode() :
         forward_edge_based_node_id(SPECIAL_NODEID),
@@ -25,7 +25,7 @@ struct EdgeBasedNode {
         reverse_offset(0),
         packed_geometry_id(SPECIAL_EDGEID),
         fwd_segment_position( std::numeric_limits<unsigned short>::max() ),
-        belongsToTinyComponent(false)
+        is_in_tiny_cc(false)
     { }
 
     explicit EdgeBasedNode(
@@ -53,93 +53,23 @@ struct EdgeBasedNode {
         reverse_offset(reverse_offset),
         packed_geometry_id(packed_geometry_id),
         fwd_segment_position(fwd_segment_position),
-        belongsToTinyComponent(belongs_to_tiny_component)
+        is_in_tiny_cc(belongs_to_tiny_component)
     {
-        BOOST_ASSERT(
-            ( forward_edge_based_node_id != SPECIAL_NODEID ) ||
-            ( reverse_edge_based_node_id != SPECIAL_NODEID )
-        );
+        BOOST_ASSERT((forward_edge_based_node_id != SPECIAL_NODEID) ||
+                     (reverse_edge_based_node_id != SPECIAL_NODEID));
     }
 
-    inline static double ComputePerpendicularDistance(
-        const FixedPointCoordinate & coord_a,
-        const FixedPointCoordinate & coord_b,
-        const FixedPointCoordinate & query_location,
-        FixedPointCoordinate & nearest_location,
-        double & r
-    ) {
-        BOOST_ASSERT( query_location.isValid() );
-
-        const double x = lat2y(query_location.lat/COORDINATE_PRECISION);
-        const double y = query_location.lon/COORDINATE_PRECISION;
-        const double a = lat2y(coord_a.lat/COORDINATE_PRECISION);
-        const double b = coord_a.lon/COORDINATE_PRECISION;
-        const double c = lat2y(coord_b.lat/COORDINATE_PRECISION);
-        const double d = coord_b.lon/COORDINATE_PRECISION;
-        double p,q/*,mX*/,nY;
-        if( std::abs(a-c) > std::numeric_limits<double>::epsilon() ){
-            const double m = (d-b)/(c-a); // slope
-            // Projection of (x,y) on line joining (a,b) and (c,d)
-            p = ((x + (m*y)) + (m*m*a - m*b))/(1. + m*m);
-            q = b + m*(p - a);
-        } else {
-            p = c;
-            q = y;
-        }
-        nY = (d*p - c*q)/(a*d - b*c);
-
-        //discretize the result to coordinate precision. it's a hack!
-        if( std::abs(nY) < (1./COORDINATE_PRECISION) ) {
-            nY = 0.;
-        }
-
-        r = (p - nY*a)/c;// These values are actually n/m+n and m/m+n , we need
-        // not calculate the explicit values of m an n as we
-        // are just interested in the ratio
-        if( std::isnan(r) ) {
-            r = ((coord_b.lat == query_location.lat) && (coord_b.lon == query_location.lon)) ? 1. : 0.;
-        } else if( std::abs(r) <= std::numeric_limits<double>::epsilon() ) {
-            r = 0.;
-        } else if( std::abs(r-1.) <= std::numeric_limits<double>::epsilon() ) {
-            r = 1.;
-        }
-        BOOST_ASSERT( !std::isnan(r) );
-        if( r <= 0. ){
-            nearest_location.lat = coord_a.lat;
-            nearest_location.lon = coord_a.lon;
-        } else if( r >= 1. ){
-            nearest_location.lat = coord_b.lat;
-            nearest_location.lon = coord_b.lon;
-        } else {
-            // point lies in between
-            nearest_location.lat = y2lat(p)*COORDINATE_PRECISION;
-            nearest_location.lon = q*COORDINATE_PRECISION;
-        }
-        BOOST_ASSERT( nearest_location.isValid() );
-
-        // TODO: Replace with euclidean approximation when k-NN search is done
-        // const double approximated_distance = FixedPointCoordinate::ApproximateEuclideanDistance(
-        const double approximated_distance = FixedPointCoordinate::ApproximateDistance(
-            query_location,
-            nearest_location
-        );
-        BOOST_ASSERT( 0. <= approximated_distance );
-        return approximated_distance;
-    }
-
-    static inline FixedPointCoordinate Centroid(
-        const FixedPointCoordinate & a,
-        const FixedPointCoordinate & b
-    ) {
+    static inline FixedPointCoordinate Centroid(const FixedPointCoordinate & a, const FixedPointCoordinate & b)
+    {
         FixedPointCoordinate centroid;
         //The coordinates of the midpoint are given by:
-        //x = (x1 + x2) /2 and y = (y1 + y2) /2.
-        centroid.lon = (std::min(a.lon, b.lon) + std::max(a.lon, b.lon))/2;
-        centroid.lat = (std::min(a.lat, b.lat) + std::max(a.lat, b.lat))/2;
+        centroid.lat = (a.lat + b.lat)/2;
+        centroid.lon = (a.lon + b.lon)/2;
         return centroid;
     }
 
-    bool IsCompressed() {
+    bool IsCompressed() const
+    {
         return packed_geometry_id != SPECIAL_EDGEID;
     }
 
@@ -154,7 +84,7 @@ struct EdgeBasedNode {
     int reverse_offset; // prefix sum of the weight from the edge TODO: short must suffice
     unsigned packed_geometry_id; // if set, then the edge represents a packed geometry
     unsigned short fwd_segment_position; // segment id in a compressed geometry
-    bool belongsToTinyComponent;
+    bool is_in_tiny_cc;
 };
 
 #endif //EDGE_BASED_NODE_H

DataStructures/HashTable.h

@@ -28,38 +28,33 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef HASH_TABLE_H
 #define HASH_TABLE_H
 
-#include <boost/functional/hash.hpp>
-#include <boost/ref.hpp>
-#include <boost/unordered_map.hpp>
+#include <unordered_map>
 
-template<typename Key, typename Value, typename Hash = boost::hash<Key> >
-class HashTable : public boost::unordered_map<Key, Value> {
-private:
-    typedef boost::unordered_map<Key, Value, Hash> super;
-public:
-    static Value default_value;
+template <typename Key, typename Value> class HashTable : public std::unordered_map<Key, Value>
+{
+  private:
+    typedef std::unordered_map<Key, Value> super;
 
-    HashTable() : super() { }
+  public:
+    HashTable() : super() {}
 
-    explicit HashTable(const unsigned size) : super(size) { }
+    explicit HashTable(const unsigned size) : super(size) {}
 
-    inline void Add( Key const & key, Value const & value) {
-        super::emplace(std::make_pair(key, value));
-    }
+    inline void Add(Key const &key, Value const &value) { super::emplace(key, value); }
 
-    inline const Value Find(Key const & key) const
+    inline const Value Find(Key const &key) const
     {
-        typename super::const_iterator iter = super::find(key);
+        auto iter = super::find(key);
         if (iter == super::end())
         {
-            return boost::cref(default_value);
+            return Value();
         }
-        return boost::cref(iter->second);
+        return iter->second;
     }
 
-    inline const bool Holds( Key const & key) const
+    inline const bool Holds(Key const &key) const
     {
-        if(super::find(key) == super::end())
+        if (super::find(key) == super::end())
         {
             return false;
         }
@@ -67,7 +62,4 @@ public:
     }
 };
 
-template<typename Key, typename Value, typename Hash>
-Value HashTable<Key, Value, Hash>::default_value;
-
 #endif /* HASH_TABLE_H */

DataStructures/HilbertValue.cpp

@@ -27,12 +27,13 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "HilbertValue.h"
 
-uint64_t HilbertCode::operator() (
-    const FixedPointCoordinate & current_coordinate
-) const {
+#include <osrm/Coordinate.h>
+
+uint64_t HilbertCode::operator()(const FixedPointCoordinate &current_coordinate) const
+{
     unsigned location[2];
-    location[0] = current_coordinate.lat+( 90*COORDINATE_PRECISION);
-    location[1] = current_coordinate.lon+(180*COORDINATE_PRECISION);
+    location[0] = current_coordinate.lat + (90 * COORDINATE_PRECISION);
+    location[1] = current_coordinate.lon + (180 * COORDINATE_PRECISION);
 
     TransposeCoordinate(location);
     return BitInterleaving(location[0], location[1]);
@@ -41,48 +42,59 @@ uint64_t HilbertCode::operator() (
 uint64_t HilbertCode::BitInterleaving(const uint32_t latitude, const uint32_t longitude) const
 {
     uint64_t result = 0;
-    for(int8_t index = 31; index >= 0; --index){
+    for (int8_t index = 31; index >= 0; --index)
+    {
         result |= (latitude >> index) & 1;
         result <<= 1;
         result |= (longitude >> index) & 1;
-        if(0 != index){
+        if (0 != index)
+        {
             result <<= 1;
         }
     }
     return result;
 }
 
-void HilbertCode::TransposeCoordinate( uint32_t * X) const
+void HilbertCode::TransposeCoordinate(uint32_t *X) const
 {
-    uint32_t M = 1 << (32-1), P, Q, t;
+    uint32_t M = 1 << (32 - 1), P, Q, t;
     int i;
     // Inverse undo
-    for( Q = M; Q > 1; Q >>= 1 ) {
-        P=Q-1;
-        for( i = 0; i < 2; ++i ) {
+    for (Q = M; Q > 1; Q >>= 1)
+    {
+        P = Q - 1;
+        for (i = 0; i < 2; ++i)
+        {
 
             const bool condition = (X[i] & Q);
-            if( condition ) {
+            if (condition)
+            {
                 X[0] ^= P; // invert
-            } else {
-                t = (X[0]^X[i]) & P;
+            }
+            else
+            {
+                t = (X[0] ^ X[i]) & P;
                 X[0] ^= t;
                 X[i] ^= t;
             }
         } // exchange
     }
     // Gray encode
-    for( i = 1; i < 2; ++i ) {
-        X[i] ^= X[i-1];
+    for (i = 1; i < 2; ++i)
+    {
+        X[i] ^= X[i - 1];
     }
-    t=0;
-    for( Q = M; Q > 1; Q >>= 1 ) {
-        const bool condition = (X[2-1] & Q);
-        if( condition ) {
-            t ^= Q-1;
+    t = 0;
+    for (Q = M; Q > 1; Q >>= 1)
+    {
+        const bool condition = (X[2 - 1] & Q);
+        if (condition)
+        {
+            t ^= Q - 1;
         }
-    } //check if this for loop is wrong
-    for( i = 0; i < 2; ++i ) {
+    } // check if this for loop is wrong
+    for (i = 0; i < 2; ++i)
+    {
         X[i] ^= t;
     }
 }

DataStructures/HilbertValue.h

@@ -28,23 +28,22 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef HILBERTVALUE_H_
 #define HILBERTVALUE_H_
 
-#include <osrm/Coordinate.h>
-
-#include <boost/integer.hpp>
-#include <boost/noncopyable.hpp>
+#include <cstdint>
 
 // computes a 64 bit value that corresponds to the hilbert space filling curve
 
-class HilbertCode : boost::noncopyable
+struct FixedPointCoordinate;
+
+class HilbertCode
 {
-public:
-	uint64_t operator()
-    (
-		const FixedPointCoordinate & current_coordinate
-	) const;
-private:
-	inline uint64_t BitInterleaving( const uint32_t a, const uint32_t b) const;
-	inline void TransposeCoordinate( uint32_t * X) const;
+  public:
+    uint64_t operator()(const FixedPointCoordinate &current_coordinate) const;
+    HilbertCode() {}
+    HilbertCode(const HilbertCode &) = delete;
+
+  private:
+    inline uint64_t BitInterleaving(const uint32_t a, const uint32_t b) const;
+    inline void TransposeCoordinate(uint32_t *X) const;
 };
 
 #endif /* HILBERTVALUE_H_ */

DataStructures/ImportEdge.h

@@ -33,15 +33,19 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <boost/assert.hpp>
 
-class NodeBasedEdge {
+class NodeBasedEdge
+{
 
-public:
-    bool operator< (const NodeBasedEdge& e) const {
-        if (source() == e.source()) {
-            if (target() == e.target()) {
-                if (weight() == e.weight()) {
-                    return (isForward() && isBackward() &&
-                            ((! e.isForward()) || (! e.isBackward())));
+  public:
+    bool operator<(const NodeBasedEdge &e) const
+    {
+        if (source() == e.source())
+        {
+            if (target() == e.target())
+            {
+                if (weight() == e.weight())
+                {
+                    return (isForward() && isBackward() && ((!e.isForward()) || (!e.isBackward())));
                 }
                 return (weight() < e.weight());
             }
@@ -50,80 +54,77 @@ public:
         return (source() < e.source());
     }
 
-    explicit NodeBasedEdge(
-        NodeID s,
-        NodeID t,
-        NodeID n,
-        EdgeWeight w,
-        bool f,
-        bool b,
-        short ty,
-        bool ra,
-        bool ig,
-        bool ar,
-        bool cf,
-        bool is_split
-    ) : _source(s),
-        _target(t),
-        _name(n),
-        _weight(w),
-        _type(ty),
-        forward(f),
-        backward(b),
-        _roundabout(ra),
-        _ignoreInGrid(ig),
-        _accessRestricted(ar),
-        _contraFlow(cf),
-        is_split(is_split)
+    explicit NodeBasedEdge(NodeID s,
+                           NodeID t,
+                           NodeID n,
+                           EdgeWeight w,
+                           bool f,
+                           bool b,
+                           short ty,
+                           bool ra,
+                           bool ig,
+                           bool ar,
+                           bool cf,
+                           bool is_split)
+        : _source(s), _target(t), _name(n), _weight(w), _type(ty), forward(f), backward(b),
+          _roundabout(ra), _ignoreInGrid(ig), _accessRestricted(ar), _contraFlow(cf),
+          is_split(is_split)
     {
-        if(ty < 0) {
+        if (ty < 0)
+        {
             throw OSRMException("negative edge type");
         }
     }
 
-    NodeID target()             const {return _target; }
-    NodeID source()             const {return _source; }
-    NodeID name()               const { return _name;  }
-    EdgeWeight weight()         const {return _weight; }
-    short type()                const {
+    NodeID target() const { return _target; }
+    NodeID source() const { return _source; }
+    NodeID name() const { return _name; }
+    EdgeWeight weight() const { return _weight; }
+    short type() const
+    {
         BOOST_ASSERT_MSG(_type >= 0, "type of ImportEdge invalid");
-                                        return _type;   }
-    bool isBackward()           const { return backward; }
-    bool isForward()            const { return forward; }
-    bool isLocatable()          const { return _type != 14; }
-    bool isRoundabout()         const { return _roundabout; }
-    bool ignoreInGrid()         const { return _ignoreInGrid; }
-    bool isAccessRestricted()   const { return _accessRestricted; }
-    bool isContraFlow()         const { return _contraFlow; }
-    bool IsSplit()              const { return is_split; }
+        return _type;
+    }
+    bool isBackward() const { return backward; }
+    bool isForward() const { return forward; }
+    bool isLocatable() const { return _type != 14; }
+    bool isRoundabout() const { return _roundabout; }
+    bool ignoreInGrid() const { return _ignoreInGrid; }
+    bool isAccessRestricted() const { return _accessRestricted; }
+    bool isContraFlow() const { return _contraFlow; }
+    bool IsSplit() const { return is_split; }
 
-    //TODO: names need to be fixed.
-    NodeID      _source;
-    NodeID      _target;
-    NodeID      _name;
-    EdgeWeight  _weight;
-    short       _type;
-    bool        forward:1;
-    bool        backward:1;
-    bool        _roundabout:1;
-    bool        _ignoreInGrid:1;
-    bool        _accessRestricted:1;
-    bool        _contraFlow:1;
-    bool        is_split:1;
+    // TODO: names need to be fixed.
+    NodeID _source;
+    NodeID _target;
+    NodeID _name;
+    EdgeWeight _weight;
+    short _type;
+    bool forward : 1;
+    bool backward : 1;
+    bool _roundabout : 1;
+    bool _ignoreInGrid : 1;
+    bool _accessRestricted : 1;
+    bool _contraFlow : 1;
+    bool is_split : 1;
 
-private:
-    NodeBasedEdge() { }
+  private:
+    NodeBasedEdge() {}
 };
 
-class EdgeBasedEdge {
+class EdgeBasedEdge
+{
 
-public:
-    bool operator< (const EdgeBasedEdge& e) const {
-        if (source() == e.source()) {
-            if (target() == e.target()) {
-                if (weight() == e.weight()) {
-                    return (isForward() && isBackward() &&
-                            ((! e.isForward()) || (! e.isBackward())));
+  public:
+    bool operator<(const EdgeBasedEdge &e) const
+    {
+        if (source() == e.source())
+        {
+            if (target() == e.target())
+            {
+                if (weight() == e.weight())
+                {
+                    return (isForward() && isBackward() && ((!e.isForward()) || (!e.isBackward())));
                 }
                 return (weight() < e.weight());
             }
@@ -132,56 +133,44 @@ public:
         return (source() < e.source());
     }
 
-    template<class EdgeT>
-    explicit EdgeBasedEdge(const EdgeT & myEdge ) :
-        m_source(myEdge.source),
-        m_target(myEdge.target),
-        m_edgeID(myEdge.data.via),
-        m_weight(myEdge.data.distance),
-        m_forward(myEdge.data.forward),
-        m_backward(myEdge.data.backward)
-    { }
+    template <class EdgeT>
+    explicit EdgeBasedEdge(const EdgeT &myEdge)
+        : m_source(myEdge.source), m_target(myEdge.target), m_edgeID(myEdge.data.via),
+          m_weight(myEdge.data.distance), m_forward(myEdge.data.forward),
+          m_backward(myEdge.data.backward)
+    {
+    }
 
     /** Default constructor. target and weight are set to 0.*/
-    EdgeBasedEdge() :
-        m_source(0),
-        m_target(0),
-        m_edgeID(0),
-        m_weight(0),
-        m_forward(false),
-        m_backward(false)
-    { }
+    EdgeBasedEdge()
+        : m_source(0), m_target(0), m_edgeID(0), m_weight(0), m_forward(false), m_backward(false)
+    {
+    }
 
-    explicit EdgeBasedEdge(
-        const NodeID s,
-        const NodeID t,
-        const NodeID v,
-        const EdgeWeight w,
-        const bool f,
-        const bool b
-    ) :
-        m_source(s),
-        m_target(t),
-        m_edgeID(v),
-        m_weight(w),
-        m_forward(f),
-        m_backward(b)
-    { }
+    explicit EdgeBasedEdge(const NodeID s,
+                           const NodeID t,
+                           const NodeID v,
+                           const EdgeWeight w,
+                           const bool f,
+                           const bool b)
+        : m_source(s), m_target(t), m_edgeID(v), m_weight(w), m_forward(f), m_backward(b)
+    {
+    }
 
-    NodeID      target()        const { return m_target;   }
-    NodeID      source()        const { return m_source;   }
-    EdgeWeight  weight()        const { return m_weight;   }
-    NodeID      id()            const { return m_edgeID;   }
-    bool        isBackward()    const { return m_backward; }
-    bool        isForward()     const { return m_forward;  }
+    NodeID target() const { return m_target; }
+    NodeID source() const { return m_source; }
+    EdgeWeight weight() const { return m_weight; }
+    NodeID id() const { return m_edgeID; }
+    bool isBackward() const { return m_backward; }
+    bool isForward() const { return m_forward; }
 
-private:
-    NodeID      m_source;
-    NodeID      m_target;
-    NodeID      m_edgeID;
-    EdgeWeight  m_weight:30;
-    bool        m_forward:1;
-    bool        m_backward:1;
+  private:
+    NodeID m_source;
+    NodeID m_target;
+    NodeID m_edgeID;
+    EdgeWeight m_weight : 30;
+    bool m_forward : 1;
+    bool m_backward : 1;
 };
 
 typedef NodeBasedEdge ImportEdge;

DataStructures/ImportNode.h

@@ -31,55 +31,48 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "QueryNode.h"
 #include "../DataStructures/HashTable.h"
 
+#include <limits>
+#include <string>
 
-struct ExternalMemoryNode : NodeInfo {
-    ExternalMemoryNode(
-        int lat,
-        int lon,
-        unsigned int id,
-        bool bollard,
-        bool traffic_light
-    ) :
-        NodeInfo(lat, lon, id),
-        bollard(bollard),
-        trafficLight(traffic_light)
-    { }
-
-    ExternalMemoryNode()
-     :
-    bollard(false),
-    trafficLight(false)
-    { }
-
-    static ExternalMemoryNode min_value() {
-        return ExternalMemoryNode(0,0,0, false, false);
+struct ExternalMemoryNode : NodeInfo
+{
+    ExternalMemoryNode(int lat, int lon, unsigned int id, bool bollard, bool traffic_light)
+        : NodeInfo(lat, lon, id), bollard(bollard), trafficLight(traffic_light)
+    {
     }
 
-    static ExternalMemoryNode max_value() {
-        return ExternalMemoryNode(
-            std::numeric_limits<int>::max(),
-            std::numeric_limits<int>::max(),
-            std::numeric_limits<unsigned>::max(),
-            false,
-            false
-        );
+    ExternalMemoryNode() : bollard(false), trafficLight(false) {}
+
+    static ExternalMemoryNode min_value() { return ExternalMemoryNode(0, 0, 0, false, false); }
+
+    static ExternalMemoryNode max_value()
+    {
+        return ExternalMemoryNode(std::numeric_limits<int>::max(),
+                                  std::numeric_limits<int>::max(),
+                                  std::numeric_limits<unsigned>::max(),
+                                  false,
+                                  false);
     }
 
-    NodeID key() const {
-        return id;
-    }
+    NodeID key() const { return id; }
 
     bool bollard;
     bool trafficLight;
 };
 
-struct ImportNode : public ExternalMemoryNode {
+struct ImportNode : public ExternalMemoryNode
+{
     HashTable<std::string, std::string> keyVals;
 
-	inline void Clear() {
-		keyVals.clear();
-		lat = 0; lon = 0; id = 0; bollard = false; trafficLight = false;
-	}
+    inline void Clear()
+    {
+        keyVals.clear();
+        lat = 0;
+        lon = 0;
+        id = 0;
+        bollard = false;
+        trafficLight = false;
+    }
 };
 
 #endif /* IMPORTNODE_H_ */

DataStructures/InputReaderFactory.h

@@ -25,80 +25,99 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-
-#ifndef INPUTREADERFACTORY_H
-#define INPUTREADERFACTORY_H
+#ifndef INPUT_READER_FACTORY_H
+#define INPUT_READER_FACTORY_H
 
 #include <boost/assert.hpp>
 
 #include <bzlib.h>
 #include <libxml/xmlreader.h>
 
-struct BZ2Context {
-    FILE* file;
-    BZFILE* bz2;
+struct BZ2Context
+{
+    FILE *file;
+    BZFILE *bz2;
     int error;
     int nUnused;
     char unused[BZ_MAX_UNUSED];
 };
 
-int readFromBz2Stream( void* pointer, char* buffer, int len ) {
-    void *unusedTmpVoid=NULL;
-    char *unusedTmp=NULL;
-    BZ2Context* context = (BZ2Context*) pointer;
+int readFromBz2Stream(void *pointer, char *buffer, int len)
+{
+    void *unusedTmpVoid = NULL;
+    char *unusedTmp = NULL;
+    BZ2Context *context = (BZ2Context *)pointer;
     int read = 0;
-    while(0 == read && !(BZ_STREAM_END == context->error && 0 == context->nUnused && feof(context->file))) {
+    while (0 == read &&
+           !(BZ_STREAM_END == context->error && 0 == context->nUnused && feof(context->file)))
+    {
         read = BZ2_bzRead(&context->error, context->bz2, buffer, len);
-        if(BZ_OK == context->error) {
+        if (BZ_OK == context->error)
+        {
             return read;
-        } else if(BZ_STREAM_END == context->error) {
+        }
+        else if (BZ_STREAM_END == context->error)
+        {
             BZ2_bzReadGetUnused(&context->error, context->bz2, &unusedTmpVoid, &context->nUnused);
             BOOST_ASSERT_MSG(BZ_OK == context->error, "Could not BZ2_bzReadGetUnused");
-            unusedTmp = (char*)unusedTmpVoid;
-            for(int i=0;i<context->nUnused;i++) {
+            unusedTmp = (char *)unusedTmpVoid;
+            for (int i = 0; i < context->nUnused; i++)
+            {
                 context->unused[i] = unusedTmp[i];
             }
             BZ2_bzReadClose(&context->error, context->bz2);
             BOOST_ASSERT_MSG(BZ_OK == context->error, "Could not BZ2_bzReadClose");
             context->error = BZ_STREAM_END; // set to the stream end for next call to this function
-            if(0 == context->nUnused && feof(context->file)) {
+            if (0 == context->nUnused && feof(context->file))
+            {
                 return read;
-            } else {
-                context->bz2 = BZ2_bzReadOpen(&context->error, context->file, 0, 0, context->unused, context->nUnused);
+            }
+            else
+            {
+                context->bz2 = BZ2_bzReadOpen(
+                    &context->error, context->file, 0, 0, context->unused, context->nUnused);
                 BOOST_ASSERT_MSG(NULL != context->bz2, "Could not open file");
             }
-        } else { BOOST_ASSERT_MSG(false, "Could not read bz2 file"); }
+        }
+        else
+        {
+            BOOST_ASSERT_MSG(false, "Could not read bz2 file");
+        }
     }
     return read;
 }
 
-int closeBz2Stream( void *pointer )
+int closeBz2Stream(void *pointer)
 {
-    BZ2Context* context = (BZ2Context*) pointer;
-    fclose( context->file );
+    BZ2Context *context = (BZ2Context *)pointer;
+    fclose(context->file);
     delete context;
     return 0;
 }
 
-xmlTextReaderPtr inputReaderFactory( const char* name )
+xmlTextReaderPtr inputReaderFactory(const char *name)
 {
     std::string inputName(name);
 
-    if(inputName.find(".osm.bz2")!=std::string::npos)
+    if (inputName.find(".osm.bz2") != std::string::npos)
     {
-        BZ2Context* context = new BZ2Context();
+        BZ2Context *context = new BZ2Context();
         context->error = false;
-        context->file = fopen( name, "r" );
+        context->file = fopen(name, "r");
         int error;
-        context->bz2 = BZ2_bzReadOpen( &error, context->file, 0, 0, context->unused, context->nUnused );
-        if ( context->bz2 == NULL || context->file == NULL ) {
+        context->bz2 =
+            BZ2_bzReadOpen(&error, context->file, 0, 0, context->unused, context->nUnused);
+        if (context->bz2 == NULL || context->file == NULL)
+        {
             delete context;
             return NULL;
         }
-        return xmlReaderForIO( readFromBz2Stream, closeBz2Stream, (void*) context, NULL, NULL, 0 );
-    } else {
+        return xmlReaderForIO(readFromBz2Stream, closeBz2Stream, (void *)context, NULL, NULL, 0);
+    }
+    else
+    {
         return xmlNewTextReaderFilename(name);
     }
 }
 
-#endif // INPUTREADERFACTORY_H
+#endif // INPUT_READER_FACTORY_H

DataStructures/JSONContainer.h

@@ -0,0 +1,237 @@
+/*
+
+Copyright (c) 2013, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+// based on https://svn.apache.org/repos/asf/mesos/tags/release-0.9.0-incubating-RC0/src/common/json.hpp
+
+#ifndef JSON_CONTAINER_H
+#define JSON_CONTAINER_H
+
+#include "../Util/StringUtil.h"
+
+#include <boost/variant.hpp>
+
+#include <iostream>
+#include <vector>
+#include <string>
+#include <unordered_map>
+
+namespace JSON
+{
+
+struct String;
+struct Number;
+struct Object;
+struct Array;
+struct True;
+struct False;
+struct Null;
+
+typedef boost::variant<boost::recursive_wrapper<String>,
+                       boost::recursive_wrapper<Number>,
+                       boost::recursive_wrapper<Object>,
+                       boost::recursive_wrapper<Array>,
+                       boost::recursive_wrapper<True>,
+                       boost::recursive_wrapper<False>,
+                       boost::recursive_wrapper<Null> > Value;
+
+struct String
+{
+    String() {}
+    String(const char *value) : value(value) {}
+    String(const std::string &value) : value(value) {}
+    std::string value;
+};
+
+struct Number
+{
+    Number() {}
+    Number(double value) : value(value) {}
+    double value;
+};
+
+struct Object
+{
+    std::unordered_map<std::string, Value> values;
+};
+
+struct Array
+{
+    std::vector<Value> values;
+};
+
+struct True
+{
+};
+
+struct False
+{
+};
+
+struct Null
+{
+};
+
+struct Renderer : boost::static_visitor<>
+{
+    Renderer(std::ostream &_out) : out(_out) {}
+
+    void operator()(const String &string) const { out << "\"" << string.value << "\""; }
+
+    void operator()(const Number &number) const
+    {
+        out.precision(10);
+        out << number.value;
+    }
+
+    void operator()(const Object &object) const
+    {
+        out << "{";
+        auto iterator = object.values.begin();
+        while (iterator != object.values.end())
+        {
+            out << "\"" << (*iterator).first << "\":";
+            boost::apply_visitor(Renderer(out), (*iterator).second);
+            if (++iterator != object.values.end())
+            {
+                out << ",";
+            }
+        }
+        out << "}";
+    }
+
+    void operator()(const Array &array) const
+    {
+        out << "[";
+        std::vector<Value>::const_iterator iterator;
+        iterator = array.values.begin();
+        while (iterator != array.values.end())
+        {
+            boost::apply_visitor(Renderer(out), *iterator);
+            if (++iterator != array.values.end())
+            {
+                out << ",";
+            }
+        }
+        out << "]";
+    }
+
+    void operator()(const True &) const { out << "true"; }
+
+    void operator()(const False &) const { out << "false"; }
+
+    void operator()(const Null &) const { out << "null"; }
+
+  private:
+    std::ostream &out;
+};
+
+struct ArrayRenderer : boost::static_visitor<>
+{
+    ArrayRenderer(std::vector<char> &_out) : out(_out) {}
+
+    void operator()(const String &string) const {
+        out.push_back('\"');
+        out.insert(out.end(), string.value.begin(), string.value.end());
+        out.push_back('\"');
+    }
+
+    void operator()(const Number &number) const
+    {
+        const std::string number_string = FixedDoubleToString(number.value);
+        out.insert(out.end(), number_string.begin(), number_string.end());
+    }
+
+    void operator()(const Object &object) const
+    {
+        out.push_back('{');
+        auto iterator = object.values.begin();
+        while (iterator != object.values.end())
+        {
+            out.push_back('\"');
+            out.insert(out.end(), (*iterator).first.begin(), (*iterator).first.end());
+            out.push_back('\"');
+            out.push_back(':');
+
+            boost::apply_visitor(ArrayRenderer(out), (*iterator).second);
+            if (++iterator != object.values.end())
+            {
+                out.push_back(',');
+            }
+        }
+        out.push_back('}');
+    }
+
+    void operator()(const Array &array) const
+    {
+        out.push_back('[');
+        std::vector<Value>::const_iterator iterator;
+        iterator = array.values.begin();
+        while (iterator != array.values.end())
+        {
+            boost::apply_visitor(ArrayRenderer(out), *iterator);
+            if (++iterator != array.values.end())
+            {
+                out.push_back(',');
+            }
+        }
+        out.push_back(']');
+    }
+
+    void operator()(const True &) const {
+        const std::string temp("true");
+        out.insert(out.end(), temp.begin(), temp.end());
+    }
+
+    void operator()(const False &) const {
+        const std::string temp("false");
+        out.insert(out.end(), temp.begin(), temp.end());
+    }
+
+    void operator()(const Null &) const {
+        const std::string temp("null");
+        out.insert(out.end(), temp.begin(), temp.end());
+    }
+
+  private:
+    std::vector<char> &out;
+};
+
+inline void render(std::ostream &out, const Object &object)
+{
+    Value value = object;
+    boost::apply_visitor(Renderer(out), value);
+}
+
+inline void render(std::vector<char> &out, const Object &object)
+{
+    Value value = object;
+    boost::apply_visitor(ArrayRenderer(out), value);
+}
+
+} // namespace JSON
+
+#endif // JSON_CONTAINER_H

DataStructures/LRUCache.h

@@ -29,61 +29,69 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #define LRUCACHE_H
 
 #include <list>
-#include <boost/unordered_map.hpp>
+#include <unordered_map>
 
-template<typename KeyT, typename ValueT>
-class LRUCache {
-private:
-    struct CacheEntry {
+template <typename KeyT, typename ValueT> class LRUCache
+{
+  private:
+    struct CacheEntry
+    {
         CacheEntry(KeyT k, ValueT v) : key(k), value(v) {}
         KeyT key;
         ValueT value;
     };
     unsigned capacity;
     std::list<CacheEntry> itemsInCache;
-    boost::unordered_map<KeyT, typename std::list<CacheEntry>::iterator > positionMap;
-public:
+    std::unordered_map<KeyT, typename std::list<CacheEntry>::iterator> positionMap;
+
+  public:
     explicit LRUCache(unsigned c) : capacity(c) {}
 
-    bool Holds(KeyT key) {
-        if(positionMap.find(key) != positionMap.end()) {
+    bool Holds(KeyT key)
+    {
+        if (positionMap.find(key) != positionMap.end())
+        {
             return true;
         }
         return false;
     }
 
-    void Insert(const KeyT key, ValueT &value) {
+    void Insert(const KeyT key, ValueT &value)
+    {
         itemsInCache.push_front(CacheEntry(key, value));
         positionMap.insert(std::make_pair(key, itemsInCache.begin()));
-        if(itemsInCache.size() > capacity) {
+        if (itemsInCache.size() > capacity)
+        {
             positionMap.erase(itemsInCache.back().key);
             itemsInCache.pop_back();
         }
     }
 
-    void Insert(const KeyT key, ValueT value) {
+    void Insert(const KeyT key, ValueT value)
+    {
         itemsInCache.push_front(CacheEntry(key, value));
         positionMap.insert(std::make_pair(key, itemsInCache.begin()));
-        if(itemsInCache.size() > capacity) {
+        if (itemsInCache.size() > capacity)
+        {
             positionMap.erase(itemsInCache.back().key);
             itemsInCache.pop_back();
         }
     }
 
-    bool Fetch(const KeyT key, ValueT& result) {
-        if(Holds(key)) {
+    bool Fetch(const KeyT key, ValueT &result)
+    {
+        if (Holds(key))
+        {
             CacheEntry e = *(positionMap.find(key)->second);
             result = e.value;
 
-            //move to front
+            // move to front
             itemsInCache.splice(positionMap.find(key)->second, itemsInCache, itemsInCache.begin());
             positionMap.find(key)->second = itemsInCache.begin();
             return true;
         }
         return false;
     }
-    unsigned Size() const {
-        return itemsInCache.size();
-    }
+    unsigned Size() const { return itemsInCache.size(); }
 };
-#endif //LRUCACHE_H
+#endif // LRUCACHE_H

DataStructures/NodeBasedGraph.h

@@ -0,0 +1,110 @@
+#ifndef __NODE_BASED_GRAPH_H__
+#define __NODE_BASED_GRAPH_H__
+
+#include "DynamicGraph.h"
+#include "ImportEdge.h"
+
+#include <memory>
+
+struct NodeBasedEdgeData
+{
+    NodeBasedEdgeData()
+        : distance(INVALID_EDGE_WEIGHT), edgeBasedNodeID(SPECIAL_NODEID),
+          nameID(std::numeric_limits<unsigned>::max()), type(std::numeric_limits<short>::max()),
+          isAccessRestricted(false), shortcut(false), forward(false), backward(false),
+          roundabout(false), ignore_in_grid(false), contraFlow(false)
+    {
+    }
+
+    int distance;
+    unsigned edgeBasedNodeID;
+    unsigned nameID;
+    short type;
+    bool isAccessRestricted : 1;
+    bool shortcut : 1;
+    bool forward : 1;
+    bool backward : 1;
+    bool roundabout : 1;
+    bool ignore_in_grid : 1;
+    bool contraFlow : 1;
+
+    void SwapDirectionFlags()
+    {
+        bool temp_flag = forward;
+        forward = backward;
+        backward = temp_flag;
+    }
+
+    bool IsEqualTo(const NodeBasedEdgeData &other) const
+    {
+        return (forward == other.forward) && (backward == other.backward) &&
+               (nameID == other.nameID) && (ignore_in_grid == other.ignore_in_grid) &&
+               (contraFlow == other.contraFlow);
+    }
+};
+
+typedef DynamicGraph<NodeBasedEdgeData> NodeBasedDynamicGraph;
+
+// Factory method to create NodeBasedDynamicGraph from ImportEdges
+inline std::shared_ptr<NodeBasedDynamicGraph>
+NodeBasedDynamicGraphFromImportEdges(int number_of_nodes, std::vector<ImportEdge> &input_edge_list)
+{
+    static_assert(sizeof(NodeBasedEdgeData) == 16, "changing node based edge data size changes memory consumption");
+    std::sort(input_edge_list.begin(), input_edge_list.end());
+
+    // TODO: remove duplicate edges
+    DeallocatingVector<NodeBasedDynamicGraph::InputEdge> edges_list;
+    NodeBasedDynamicGraph::InputEdge edge;
+    for (const ImportEdge &import_edge : input_edge_list)
+    {
+        // TODO: give ImportEdge a proper c'tor to use emplace_back's below
+        if (!import_edge.isForward())
+        {
+            edge.source = import_edge.target();
+            edge.target = import_edge.source();
+            edge.data.backward = import_edge.isForward();
+            edge.data.forward = import_edge.isBackward();
+        }
+        else
+        {
+            edge.source = import_edge.source();
+            edge.target = import_edge.target();
+            edge.data.forward = import_edge.isForward();
+            edge.data.backward = import_edge.isBackward();
+        }
+
+        if (edge.source == edge.target)
+        {
+            continue;
+        }
+
+        edge.data.distance = (std::max)((int)import_edge.weight(), 1);
+        BOOST_ASSERT(edge.data.distance > 0);
+        edge.data.shortcut = false;
+        edge.data.roundabout = import_edge.isRoundabout();
+        edge.data.ignore_in_grid = import_edge.ignoreInGrid();
+        edge.data.nameID = import_edge.name();
+        edge.data.type = import_edge.type();
+        edge.data.isAccessRestricted = import_edge.isAccessRestricted();
+        edge.data.contraFlow = import_edge.isContraFlow();
+        edges_list.push_back(edge);
+
+        if (!import_edge.IsSplit())
+        {
+            using std::swap; // enable ADL
+            swap(edge.source, edge.target);
+            edge.data.SwapDirectionFlags();
+            edges_list.push_back(edge);
+        }
+    }
+
+    std::sort(edges_list.begin(), edges_list.end());
+    auto graph = std::make_shared<NodeBasedDynamicGraph>(number_of_nodes, edges_list);
+
+    edges_list.clear();
+    BOOST_ASSERT(0 == edges_list.size());
+
+    return graph;
+}
+
+#endif // __NODE_BASED_GRAPH_H__

DataStructures/OriginalEdgeData.h

@@ -33,25 +33,23 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <limits>
 
-struct OriginalEdgeData{
-    explicit OriginalEdgeData(
-        NodeID via_node,
-        unsigned name_id,
-        TurnInstruction turn_instruction,
-        bool compressed_geometry
-    ) :
-        via_node( via_node ),
-        name_id( name_id ),
-        turn_instruction( turn_instruction ),
-        compressed_geometry( compressed_geometry )
-    { }
+struct OriginalEdgeData
+{
+    explicit OriginalEdgeData(NodeID via_node,
+                              unsigned name_id,
+                              TurnInstruction turn_instruction,
+                              bool compressed_geometry)
+        : via_node(via_node), name_id(name_id), turn_instruction(turn_instruction),
+          compressed_geometry(compressed_geometry)
+    {
+    }
 
-    OriginalEdgeData() :
-        via_node( std::numeric_limits<unsigned>::max() ),
-        name_id( std::numeric_limits<unsigned>::max() ),
-        turn_instruction( std::numeric_limits<unsigned char>::max() ),
-        compressed_geometry( false )
-    { }
+    OriginalEdgeData()
+        : via_node(std::numeric_limits<unsigned>::max()),
+          name_id(std::numeric_limits<unsigned>::max()),
+          turn_instruction(TurnInstruction::NoTurn), compressed_geometry(false)
+    {
+    }
 
     NodeID via_node;
     unsigned name_id;
@@ -59,4 +57,4 @@ struct OriginalEdgeData{
     bool compressed_geometry;
 };
 
-#endif //ORIGINAL_EDGE_DATA_H
+#endif // ORIGINAL_EDGE_DATA_H

DataStructures/Percent.h

@@ -31,64 +31,68 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../Util/OpenMPWrapper.h"
 #include <iostream>
 
-class Percent {
-public:
-    /**
-     * Constructor.
-     * @param maxValue the value that corresponds to 100%
-     * @param step the progress is shown in steps of 'step' percent
-     */
-    explicit Percent(unsigned maxValue, unsigned step = 5) {
-        reinit(maxValue, step);
+class Percent
+{
+  public:
+    explicit Percent(unsigned max_value, unsigned step = 5) { reinit(max_value, step); }
+
+   // Reinitializes
+    void reinit(unsigned max_value, unsigned step = 5)
+    {
+        m_max_value = max_value;
+        m_current_value = 0;
+        m_percent_interval = m_max_value / 100;
+        m_next_threshold = m_percent_interval;
+        m_last_percent = 0;
+        m_step = step;
     }
 
-    /** Reinitializes this object. */
-    void reinit(unsigned maxValue, unsigned step = 5) {
-        _maxValue = maxValue;
-        _current_value = 0;
-        _intervalPercent = _maxValue / 100;
-        _nextThreshold = _intervalPercent;
-        _lastPercent = 0;
-        _step = step;
-    }
-
-    /** If there has been significant progress, display it. */
-    void printStatus(unsigned currentValue) {
-        if (currentValue >= _nextThreshold) {
-            _nextThreshold += _intervalPercent;
-            printPercent( currentValue / (double)_maxValue * 100 );
+    // If there has been significant progress, display it.
+    void printStatus(unsigned current_value)
+    {
+        if (current_value >= m_next_threshold)
+        {
+            m_next_threshold += m_percent_interval;
+            printPercent(current_value / (double)m_max_value * 100);
         }
-        if (currentValue + 1 == _maxValue)
+        if (current_value + 1 == m_max_value)
             std::cout << " 100%" << std::endl;
     }
 
-    void printIncrement() {
+    void printIncrement()
+    {
 #pragma omp atomic
-        ++_current_value;
-        printStatus(_current_value);
+        ++m_current_value;
+        printStatus(m_current_value);
     }
 
-    void printAddition(const unsigned addition) {
+    void printAddition(const unsigned addition)
+    {
 #pragma omp atomic
-        _current_value += addition;
-        printStatus(_current_value);
+        m_current_value += addition;
+        printStatus(m_current_value);
     }
-private:
-    unsigned _current_value;
-    unsigned _maxValue;
-    unsigned _intervalPercent;
-    unsigned _nextThreshold;
-    unsigned _lastPercent;
-    unsigned _step;
 
-    /** Displays the new progress. */
-    void printPercent(double percent) {
-        while (percent >= _lastPercent+_step) {
-            _lastPercent+=_step;
-            if (_lastPercent % 10 == 0) {
-                std::cout << " " << _lastPercent << "% ";
+  private:
+    unsigned m_current_value;
+    unsigned m_max_value;
+    unsigned m_percent_interval;
+    unsigned m_next_threshold;
+    unsigned m_last_percent;
+    unsigned m_step;
+
+    // Displays progress.
+    void printPercent(double percent)
+    {
+        while (percent >= m_last_percent + m_step)
+        {
+            m_last_percent += m_step;
+            if (m_last_percent % 10 == 0)
+            {
+                std::cout << " " << m_last_percent << "% ";
             }
-            else {
+            else
+            {
                 std::cout << ".";
             }
             std::cout.flush();

DataStructures/PhantomNodes.h

@@ -25,8 +25,8 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef PHANTOMNODES_H_
-#define PHANTOMNODES_H_
+#ifndef PHANTOM_NODES_H
+#define PHANTOM_NODES_H
 
 #include <osrm/Coordinate.h>
 #include "../Util/SimpleLogger.h"
@@ -115,6 +115,12 @@ struct PhantomNode
         );
     }
 
+    bool isValid() const
+    {
+        return location.isValid() &&
+               (name_id != std::numeric_limits<unsigned>::max());
+    }
+
     bool operator==(const PhantomNode & other) const
     {
         return location == other.location;
@@ -171,4 +177,4 @@ inline std::ostream& operator<<(std::ostream &out, const PhantomNode & pn)
     return out;
 }
 
-#endif /* PHANTOMNODES_H_ */
+#endif // PHANTOM_NODES_H

DataStructures/QueryEdge.h

@@ -30,34 +30,34 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "../typedefs.h"
 
-struct QueryEdge {
+struct QueryEdge
+{
     NodeID source;
     NodeID target;
-    struct EdgeData {
-        NodeID id:31;
-        bool   shortcut:1;
-        int    distance:30;
-        bool   forward:1;
-        bool   backward:1;
+    struct EdgeData
+    {
+        NodeID id : 31;
+        bool shortcut : 1;
+        int distance : 30;
+        bool forward : 1;
+        bool backward : 1;
     } data;
 
-    bool operator<( const QueryEdge& right ) const {
-        if ( source != right.source ) {
+    bool operator<(const QueryEdge &right) const
+    {
+        if (source != right.source)
+        {
             return source < right.source;
         }
         return target < right.target;
     }
 
-    bool operator== ( const QueryEdge& right ) const {
-        return (
-            source == right.source               &&
-            target == right.target               &&
-            data.distance == right.data.distance &&
-            data.shortcut == right.data.shortcut &&
-            data.forward == right.data.forward   &&
-            data.backward == right.data.backward &&
-            data.id == right.data.id
-        );
+    bool operator==(const QueryEdge &right) const
+    {
+        return (source == right.source && target == right.target &&
+                data.distance == right.data.distance && data.shortcut == right.data.shortcut &&
+                data.forward == right.data.forward && data.backward == right.data.backward &&
+                data.id == right.data.id);
     }
 };
 

DataStructures/QueryNode.h

@@ -36,52 +36,50 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <limits>
 
-struct NodeInfo {
-	typedef NodeID key_type; 	//type of NodeID
-	typedef int value_type;		//type of lat,lons
+struct NodeInfo
+{
+    typedef NodeID key_type; // type of NodeID
+    typedef int value_type; // type of lat,lons
 
-	NodeInfo(int lat, int lon, NodeID id) : lat(lat), lon(lon), id(id) { }
-	NodeInfo()
-	 :
-		lat(std::numeric_limits<int>::max()),
-		lon(std::numeric_limits<int>::max()),
-		id(std::numeric_limits<unsigned>::max())
-	{ }
+    NodeInfo(int lat, int lon, NodeID id) : lat(lat), lon(lon), id(id) {}
+    NodeInfo()
+        : lat(std::numeric_limits<int>::max()), lon(std::numeric_limits<int>::max()),
+          id(std::numeric_limits<unsigned>::max())
+    {
+    }
 
-	int lat;
-	int lon;
-	NodeID id;
+    int lat;
+    int lon;
+    NodeID id;
 
-	static NodeInfo min_value() {
-		return NodeInfo(
-			 -90*COORDINATE_PRECISION,
-			-180*COORDINATE_PRECISION,
-			std::numeric_limits<NodeID>::min()
-		);
-	}
+    static NodeInfo min_value()
+    {
+        return NodeInfo(-90 * COORDINATE_PRECISION,
+                        -180 * COORDINATE_PRECISION,
+                        std::numeric_limits<NodeID>::min());
+    }
 
-	static NodeInfo max_value() {
-		return NodeInfo(
-			 90*COORDINATE_PRECISION,
-			180*COORDINATE_PRECISION,
-			std::numeric_limits<NodeID>::max()
-			);
-	}
+    static NodeInfo max_value()
+    {
+        return NodeInfo(90 * COORDINATE_PRECISION,
+                        180 * COORDINATE_PRECISION,
+                        std::numeric_limits<NodeID>::max());
+    }
 
-	value_type operator[](const std::size_t n) const {
-		switch(n) {
-		case 1:
-			return lat;
-			// break;
-		case 0:
-			return lon;
-			// break;
-		default:
-			break;
-		}
-		BOOST_ASSERT_MSG(false, "should not happen");
-		return std::numeric_limits<unsigned>::max();
-	}
+    value_type operator[](const std::size_t n) const
+    {
+        switch (n)
+        {
+        case 1:
+            return lat;
+        case 0:
+            return lon;
+        default:
+            break;
+        }
+        BOOST_ASSERT_MSG(false, "should not happen");
+        return std::numeric_limits<unsigned>::max();
+    }
 };
 
-#endif //QUERY_NODE_H
+#endif // QUERY_NODE_H

DataStructures/RawRouteData.h

@@ -25,10 +25,11 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef RAWROUTEDATA_H_
-#define RAWROUTEDATA_H_
+#ifndef RAW_ROUTE_DATA_H
+#define RAW_ROUTE_DATA_H
 
 #include "../DataStructures/PhantomNodes.h"
+#include "../DataStructures/TurnInstructions.h"
 #include "../typedefs.h"
 
 #include <osrm/Coordinate.h>
@@ -37,53 +38,47 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <vector>
 
-struct PathData {
-    PathData() :
-        node(UINT_MAX),
-        name_id(UINT_MAX),
-        durationOfSegment(UINT_MAX),
-        turnInstruction(UCHAR_MAX)
-    { }
+struct PathData
+{
+    PathData()
+        : node(std::numeric_limits<unsigned>::max()), name_id(std::numeric_limits<unsigned>::max()),
+          segment_duration(std::numeric_limits<unsigned>::max()),
+          turn_instruction(TurnInstruction::NoTurn)
+    {
+    }
 
-    PathData(
-        NodeID no,
-        unsigned na,
-        unsigned tu,
-        unsigned dur
-    ) :
-        node(no),
-        name_id(na),
-        durationOfSegment(dur),
-        turnInstruction(tu)
-    { }
+    PathData(NodeID node, unsigned name_id, TurnInstruction turn_instruction, unsigned segment_duration)
+        : node(node), name_id(name_id), segment_duration(segment_duration), turn_instruction(turn_instruction)
+    {
+    }
     NodeID node;
     unsigned name_id;
-    unsigned durationOfSegment;
-    short turnInstruction;
+    unsigned segment_duration;
+    TurnInstruction turn_instruction;
 };
 
-struct RawRouteData {
-    std::vector< std::vector<PathData> > unpacked_path_segments;
-    std::vector< PathData > unpacked_alternative;
-    std::vector< PhantomNodes > segmentEndCoordinates;
-    std::vector< FixedPointCoordinate > rawViaNodeCoordinates;
-    unsigned checkSum;
-    int lengthOfShortestPath;
-    int lengthOfAlternativePath;
+struct RawRouteData
+{
+    std::vector<std::vector<PathData>> unpacked_path_segments;
+    std::vector<PathData> unpacked_alternative;
+    std::vector<PhantomNodes> segment_end_coordinates;
+    std::vector<FixedPointCoordinate> raw_via_node_coordinates;
+    unsigned check_sum;
+    int shortest_path_length;
+    int alternative_path_length;
     bool source_traversed_in_reverse;
     bool target_traversed_in_reverse;
     bool alt_source_traversed_in_reverse;
     bool alt_target_traversed_in_reverse;
 
-    RawRouteData() :
-        checkSum(UINT_MAX),
-        lengthOfShortestPath(INT_MAX),
-        lengthOfAlternativePath(INT_MAX),
-        source_traversed_in_reverse(false),
-        target_traversed_in_reverse(false),
-        alt_source_traversed_in_reverse(false),
-        alt_target_traversed_in_reverse(false)
-    { }
+    RawRouteData()
+        : check_sum(std::numeric_limits<unsigned>::max()),
+          shortest_path_length(std::numeric_limits<int>::max()),
+          alternative_path_length(std::numeric_limits<int>::max()),
+          source_traversed_in_reverse(false), target_traversed_in_reverse(false),
+          alt_source_traversed_in_reverse(false), alt_target_traversed_in_reverse(false)
+    {
+    }
 };
 
-#endif /* RAWROUTEDATA_H_ */
+#endif // RAW_ROUTE_DATA_H

DataStructures/Restriction.h

@@ -25,125 +25,102 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef RESTRICTION_H_
-#define RESTRICTION_H_
+#ifndef RESTRICTION_H
+#define RESTRICTION_H
 
 #include "../typedefs.h"
 
 #include <limits>
 
-struct TurnRestriction {
+struct TurnRestriction
+{
     NodeID viaNode;
     NodeID fromNode;
     NodeID toNode;
-    struct Bits { //mostly unused
+    struct Bits
+    { // mostly unused
         Bits()
-         :
-            isOnly(false),
-            unused1(false),
-            unused2(false),
-            unused3(false),
-            unused4(false),
-            unused5(false),
-            unused6(false),
-            unused7(false)
-        { }
+            : isOnly(false), unused1(false), unused2(false), unused3(false), unused4(false),
+              unused5(false), unused6(false), unused7(false)
+        {
+        }
 
-        bool isOnly:1;
-        bool unused1:1;
-        bool unused2:1;
-        bool unused3:1;
-        bool unused4:1;
-        bool unused5:1;
-        bool unused6:1;
-        bool unused7:1;
+        bool isOnly : 1;
+        bool unused1 : 1;
+        bool unused2 : 1;
+        bool unused3 : 1;
+        bool unused4 : 1;
+        bool unused5 : 1;
+        bool unused6 : 1;
+        bool unused7 : 1;
     } flags;
 
-    explicit TurnRestriction(NodeID viaNode) :
-        viaNode(viaNode),
-        fromNode(std::numeric_limits<unsigned>::max()),
-        toNode(std::numeric_limits<unsigned>::max()) {
+    explicit TurnRestriction(NodeID viaNode)
+        : viaNode(viaNode), fromNode(std::numeric_limits<unsigned>::max()),
+          toNode(std::numeric_limits<unsigned>::max())
+    {
     }
 
-    explicit TurnRestriction(const bool isOnly = false) :
-        viaNode(UINT_MAX),
-        fromNode(UINT_MAX),
-        toNode(UINT_MAX) {
+    explicit TurnRestriction(const bool isOnly = false)
+        : viaNode(std::numeric_limits<unsigned>::max()),
+          fromNode(std::numeric_limits<unsigned>::max()),
+          toNode(std::numeric_limits<unsigned>::max())
+    {
         flags.isOnly = isOnly;
     }
 };
 
-struct InputRestrictionContainer {
+struct InputRestrictionContainer
+{
     EdgeID fromWay;
     EdgeID toWay;
     unsigned viaNode;
     TurnRestriction restriction;
 
-    InputRestrictionContainer(
-        EdgeID fromWay,
-        EdgeID toWay,
-        NodeID vn,
-        unsigned vw
-    ) :
-        fromWay(fromWay),
-        toWay(toWay),
-        viaNode(vw)
+    InputRestrictionContainer(EdgeID fromWay, EdgeID toWay, NodeID vn, unsigned vw)
+        : fromWay(fromWay), toWay(toWay), viaNode(vw)
     {
         restriction.viaNode = vn;
     }
-    explicit InputRestrictionContainer(
-        bool isOnly = false
-    ) :
-        fromWay(std::numeric_limits<unsigned>::max()),
-        toWay(std::numeric_limits<unsigned>::max()),
-        viaNode(std::numeric_limits<unsigned>::max())
+    explicit InputRestrictionContainer(bool isOnly = false)
+        : fromWay(std::numeric_limits<unsigned>::max()),
+          toWay(std::numeric_limits<unsigned>::max()), viaNode(std::numeric_limits<unsigned>::max())
     {
         restriction.flags.isOnly = isOnly;
     }
 
-    static InputRestrictionContainer min_value() {
-        return InputRestrictionContainer(0, 0, 0, 0);
-    }
-    static InputRestrictionContainer max_value() {
-        return  InputRestrictionContainer(
-                    std::numeric_limits<unsigned>::max(),
-                    std::numeric_limits<unsigned>::max(),
-                    std::numeric_limits<unsigned>::max(),
-                    std::numeric_limits<unsigned>::max()
-                );
+    static InputRestrictionContainer min_value() { return InputRestrictionContainer(0, 0, 0, 0); }
+    static InputRestrictionContainer max_value()
+    {
+        return InputRestrictionContainer(std::numeric_limits<unsigned>::max(),
+                                         std::numeric_limits<unsigned>::max(),
+                                         std::numeric_limits<unsigned>::max(),
+                                         std::numeric_limits<unsigned>::max());
     }
 };
 
-struct CmpRestrictionContainerByFrom {
+struct CmpRestrictionContainerByFrom
+{
     typedef InputRestrictionContainer value_type;
-    inline bool operator()(
-        const InputRestrictionContainer & a,
-        const InputRestrictionContainer & b
-    ) const {
+    inline bool operator()(const InputRestrictionContainer &a, const InputRestrictionContainer &b)
+        const
+    {
         return a.fromWay < b.fromWay;
     }
-    inline value_type max_value() const {
-        return InputRestrictionContainer::max_value();
-    }
-    inline value_type min_value() const {
-        return InputRestrictionContainer::min_value();
-    }
+    inline value_type max_value() const { return InputRestrictionContainer::max_value(); }
+    inline value_type min_value() const { return InputRestrictionContainer::min_value(); }
 };
 
-struct CmpRestrictionContainerByTo {
+struct CmpRestrictionContainerByTo
+{
     typedef InputRestrictionContainer value_type;
-    inline bool operator()(
-        const InputRestrictionContainer & a,
-        const InputRestrictionContainer & b
-    ) const {
+    inline bool operator()(const InputRestrictionContainer &a, const InputRestrictionContainer &b)
+        const
+    {
         return a.toWay < b.toWay;
     }
-    value_type max_value() const {
-        return InputRestrictionContainer::max_value();
-    }
-    value_type min_value() const {
-        return InputRestrictionContainer::min_value();
-    }
+    value_type max_value() const { return InputRestrictionContainer::max_value(); }
+    value_type min_value() const { return InputRestrictionContainer::min_value(); }
 };
 
-#endif /* RESTRICTION_H_ */
+#endif // RESTRICTION_H

DataStructures/RestrictionMap.cpp

@@ -0,0 +1,215 @@
+/*
+
+Copyright (c) 2013, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+#include "RestrictionMap.h"
+#include "NodeBasedGraph.h"
+
+#include "../Util/SimpleLogger.h"
+
+bool RestrictionMap::IsNodeAViaNode(const NodeID node) const
+{
+    return m_no_turn_via_node_set.find(node) != m_no_turn_via_node_set.end();
+}
+
+RestrictionMap::RestrictionMap(const std::shared_ptr<NodeBasedDynamicGraph> &graph,
+                               const std::vector<TurnRestriction> &input_restrictions_list)
+    : m_count(0), m_graph(graph)
+{
+    // decompose restriction consisting of a start, via and end node into a
+    // a pair of starting edge and a list of all end nodes
+    for (auto &restriction : input_restrictions_list)
+    {
+        m_restriction_start_nodes.insert(restriction.fromNode);
+        m_no_turn_via_node_set.insert(restriction.viaNode);
+
+        std::pair<NodeID, NodeID> restriction_source = {restriction.fromNode, restriction.viaNode};
+
+        unsigned index;
+        auto restriction_iter = m_restriction_map.find(restriction_source);
+        if (restriction_iter == m_restriction_map.end())
+        {
+            index = m_restriction_bucket_list.size();
+            m_restriction_bucket_list.resize(index + 1);
+            m_restriction_map.emplace(restriction_source, index);
+        }
+        else
+        {
+            index = restriction_iter->second;
+            // Map already contains an is_only_*-restriction
+            if (m_restriction_bucket_list.at(index).begin()->second)
+            {
+                continue;
+            }
+            else if (restriction.flags.isOnly)
+            {
+                // We are going to insert an is_only_*-restriction. There can be only one.
+                m_count -= m_restriction_bucket_list.at(index).size();
+                m_restriction_bucket_list.at(index).clear();
+            }
+        }
+        ++m_count;
+        m_restriction_bucket_list.at(index)
+            .emplace_back(restriction.toNode, restriction.flags.isOnly);
+    }
+}
+
+// Replace end v with w in each turn restriction containing u as via node
+void RestrictionMap::FixupArrivingTurnRestriction(const NodeID u, const NodeID v, const NodeID w)
+{
+    BOOST_ASSERT(u != SPECIAL_NODEID);
+    BOOST_ASSERT(v != SPECIAL_NODEID);
+    BOOST_ASSERT(w != SPECIAL_NODEID);
+
+    if (!RestrictionStartsAtNode(u))
+    {
+        return;
+    }
+
+    // find all potential start edges
+    // it is more efficent to get a (small) list of potential start edges than iterating over all buckets
+    std::vector<NodeID> predecessors;
+    for (const EdgeID current_edge_id : m_graph->GetAdjacentEdgeRange(u))
+    {
+        const EdgeData &edge_data = m_graph->GetEdgeData(current_edge_id);
+        const NodeID target = m_graph->GetTarget(current_edge_id);
+        if (edge_data.backward && (v != target))
+        {
+            predecessors.push_back(target);
+        }
+    }
+
+    for (const NodeID x : predecessors)
+    {
+        auto restriction_iterator = m_restriction_map.find({x, u});
+        if (restriction_iterator == m_restriction_map.end())
+        {
+            continue;
+        }
+
+        const unsigned index = restriction_iterator->second;
+        auto &bucket = m_restriction_bucket_list.at(index);
+        for (RestrictionTarget &restriction_target : bucket)
+        {
+            if (v == restriction_target.first)
+            {
+                restriction_target.first = w;
+            }
+        }
+    }
+}
+
+// Replaces start edge (v, w) with (u, w). Only start node changes.
+void RestrictionMap::FixupStartingTurnRestriction(const NodeID u, const NodeID v, const NodeID w)
+{
+    BOOST_ASSERT(u != SPECIAL_NODEID);
+    BOOST_ASSERT(v != SPECIAL_NODEID);
+    BOOST_ASSERT(w != SPECIAL_NODEID);
+
+    if (!RestrictionStartsAtNode(u))
+    {
+        return;
+    }
+
+    const auto restriction_iterator = m_restriction_map.find({v, w});
+    if (restriction_iterator != m_restriction_map.end())
+    {
+        const unsigned index = restriction_iterator->second;
+        // remove old restriction start (v,w)
+        m_restriction_map.erase(restriction_iterator);
+
+        // insert new restriction start (u,w) (point to index)
+        RestrictionSource new_source = {u, w};
+        m_restriction_map.emplace(new_source, index);
+    }
+}
+
+// Check if edge (u, v) is the start of any turn restriction.
+// If so returns id of first target node.
+NodeID RestrictionMap::CheckForEmanatingIsOnlyTurn(const NodeID u, const NodeID v) const
+{
+    BOOST_ASSERT(u != SPECIAL_NODEID);
+    BOOST_ASSERT(v != SPECIAL_NODEID);
+
+    if (!RestrictionStartsAtNode(u))
+    {
+        return SPECIAL_NODEID;
+    }
+
+    auto restriction_iter = m_restriction_map.find({u, v});
+    if (restriction_iter != m_restriction_map.end())
+    {
+        const unsigned index = restriction_iter->second;
+        auto &bucket = m_restriction_bucket_list.at(index);
+        for (const RestrictionSource &restriction_target : bucket)
+        {
+            if (restriction_target.second)
+            {
+                return restriction_target.first;
+            }
+        }
+    }
+    return SPECIAL_NODEID;
+}
+
+// Checks if turn <u,v,w> is actually a turn restriction.
+bool RestrictionMap::CheckIfTurnIsRestricted(const NodeID u, const NodeID v, const NodeID w) const
+{
+    BOOST_ASSERT(u != SPECIAL_NODEID);
+    BOOST_ASSERT(v != SPECIAL_NODEID);
+    BOOST_ASSERT(w != SPECIAL_NODEID);
+
+    if (!RestrictionStartsAtNode(u))
+    {
+        return false;
+    }
+
+    auto restriction_iter = m_restriction_map.find({u, v});
+    if (restriction_iter != m_restriction_map.end())
+    {
+        const unsigned index = restriction_iter->second;
+        const auto &bucket = m_restriction_bucket_list.at(index);
+        for (const RestrictionTarget &restriction_target : bucket)
+        {
+            if ((w == restriction_target.first) && // target found
+                (!restriction_target.second))       // and not an only_-restr.
+            {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+
+// check of node is the start of any restriction
+bool RestrictionMap::RestrictionStartsAtNode(const NodeID node) const
+{
+    if (m_restriction_start_nodes.find(node) == m_restriction_start_nodes.end())
+    {
+        return false;
+    }
+    return true;
+}

DataStructures/RestrictionMap.h

@@ -0,0 +1,74 @@
+/*
+
+Copyright (c) 2013, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+#ifndef __RESTRICTION_MAP_H__
+#define __RESTRICTION_MAP_H__
+
+#include <memory>
+
+#include "DynamicGraph.h"
+#include "Restriction.h"
+#include "NodeBasedGraph.h"
+#include "../Util/StdHashExtensions.h"
+#include "../typedefs.h"
+
+#include <unordered_map>
+#include <unordered_set>
+
+// Efficent look up if an edge is the start + via node of a TurnRestriction
+// EdgeBasedEdgeFactory decides by it if edges are inserted or geometry is compressed
+class RestrictionMap
+{
+  public:
+    RestrictionMap(const std::shared_ptr<NodeBasedDynamicGraph> &graph,
+                   const std::vector<TurnRestriction> &input_restrictions_list);
+
+    void FixupArrivingTurnRestriction(const NodeID u, const NodeID v, const NodeID w);
+    void FixupStartingTurnRestriction(const NodeID u, const NodeID v, const NodeID w);
+    NodeID CheckForEmanatingIsOnlyTurn(const NodeID u, const NodeID v) const;
+    bool CheckIfTurnIsRestricted(const NodeID u, const NodeID v, const NodeID w) const;
+    bool IsNodeAViaNode(const NodeID node) const;
+    unsigned size() { return m_count; }
+
+  private:
+    bool RestrictionStartsAtNode(const NodeID node) const;
+    typedef std::pair<NodeID, NodeID> RestrictionSource;
+    typedef std::pair<NodeID, bool> RestrictionTarget;
+    typedef std::vector<RestrictionTarget> EmanatingRestrictionsVector;
+    typedef NodeBasedDynamicGraph::EdgeData EdgeData;
+
+    unsigned m_count;
+    std::shared_ptr<NodeBasedDynamicGraph> m_graph;
+    //! index -> list of (target, isOnly)
+    std::vector<EmanatingRestrictionsVector> m_restriction_bucket_list;
+    //! maps (start, via) -> bucket index
+    std::unordered_map<RestrictionSource, unsigned> m_restriction_map;
+    std::unordered_set<NodeID> m_restriction_start_nodes;
+    std::unordered_set<NodeID> m_no_turn_via_node_set;
+};
+
+#endif

DataStructures/RouteParameters.cpp

@@ -0,0 +1,82 @@
+/*
+
+Copyright (c) 2013, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+#include <osrm/RouteParameters.h>
+
+#include <boost/fusion/container/vector.hpp>
+#include <boost/fusion/sequence/intrinsic.hpp>
+#include <boost/fusion/include/at_c.hpp>
+
+RouteParameters::RouteParameters()
+    : zoom_level(18), print_instructions(false), alternate_route(true), geometry(true),
+      compression(true), deprecatedAPI(false), check_sum(-1)
+{
+}
+
+void RouteParameters::setZoomLevel(const short level)
+{
+    if (18 >= level && 0 <= level)
+    {
+        zoom_level = level;
+    }
+}
+
+void RouteParameters::setAlternateRouteFlag(const bool flag) { alternate_route = flag; }
+
+void RouteParameters::setDeprecatedAPIFlag(const std::string &) { deprecatedAPI = true; }
+
+void RouteParameters::setChecksum(const unsigned sum) { check_sum = sum; }
+
+void RouteParameters::setInstructionFlag(const bool flag) { print_instructions = flag; }
+
+void RouteParameters::setService(const std::string &service_string) { service = service_string; }
+
+void RouteParameters::setOutputFormat(const std::string &format) { output_format = format; }
+
+void RouteParameters::setJSONpParameter(const std::string &parameter) { jsonp_parameter = parameter; }
+
+void RouteParameters::addHint(const std::string &hint)
+{
+    hints.resize(coordinates.size());
+    if (!hints.empty())
+    {
+        hints.back() = hint;
+    }
+}
+
+void RouteParameters::setLanguage(const std::string &language_string) { language = language_string; }
+
+void RouteParameters::setGeometryFlag(const bool flag) { geometry = flag; }
+
+void RouteParameters::setCompressionFlag(const bool flag) { compression = flag; }
+
+void RouteParameters::addCoordinate(const boost::fusion::vector<double, double> &transmitted_coordinates)
+{
+    const int lat = COORDINATE_PRECISION * boost::fusion::at_c<0>(transmitted_coordinates);
+    const int lon = COORDINATE_PRECISION * boost::fusion::at_c<1>(transmitted_coordinates);
+    coordinates.emplace_back(lat, lon);
+}

DataStructures/SearchEngine.h

@@ -29,40 +29,32 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #define SEARCHENGINE_H
 
 #include "SearchEngineData.h"
-#include "PhantomNodes.h"
-#include "QueryEdge.h"
 #include "../RoutingAlgorithms/AlternativePathRouting.h"
+#include "../RoutingAlgorithms/ManyToManyRouting.h"
 #include "../RoutingAlgorithms/ShortestPathRouting.h"
 
-#include "../Util/StringUtil.h"
-#include "../typedefs.h"
+#include <type_traits>
 
-#include <osrm/Coordinate.h>
-
-#include <boost/assert.hpp>
-
-#include <climits>
-#include <string>
-#include <vector>
-
-template<class DataFacadeT>
-class SearchEngine {
-private:
-    DataFacadeT * facade;
+template <class DataFacadeT> class SearchEngine
+{
+  private:
+    DataFacadeT *facade;
     SearchEngineData engine_working_data;
-public:
-    ShortestPathRouting<DataFacadeT> shortest_path;
-    AlternativeRouting <DataFacadeT> alternative_path;
 
-    explicit SearchEngine( DataFacadeT * facade )
-     :
-        facade             (facade),
-        shortest_path      (facade, engine_working_data),
-        alternative_path   (facade, engine_working_data)
-    {}
+  public:
+    ShortestPathRouting<DataFacadeT> shortest_path;
+    AlternativeRouting<DataFacadeT> alternative_path;
+    ManyToManyRouting<DataFacadeT> distance_table;
+
+    explicit SearchEngine(DataFacadeT *facade)
+        : facade(facade), shortest_path(facade, engine_working_data),
+          alternative_path(facade, engine_working_data), distance_table(facade, engine_working_data)
+    {
+        static_assert(!std::is_pointer<DataFacadeT>(), "don't instantiate with ptr type");
+        static_assert(std::is_object<DataFacadeT>(), "don't instantiate with void, function, or reference");
+    }
 
     ~SearchEngine() {}
-
 };
 
 #endif // SEARCHENGINE_H

DataStructures/SearchEngineData.h

@@ -36,18 +36,17 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <boost/thread.hpp>
 
-#include <string>
 #include <vector>
 
-struct _HeapData {
+struct HeapData
+{
     NodeID parent;
-    /* explicit */ _HeapData( NodeID p ) : parent(p) { }
+    /* explicit */ HeapData(NodeID p) : parent(p) {}
 };
 
-// typedef StaticGraph<QueryEdge::EdgeData> QueryGraph;
-
-struct SearchEngineData {
-    typedef BinaryHeap< NodeID, NodeID, int, _HeapData, UnorderedMapStorage<NodeID, int> > QueryHeap;
+struct SearchEngineData
+{
+    typedef BinaryHeap<NodeID, NodeID, int, HeapData, UnorderedMapStorage<NodeID, int>> QueryHeap;
     typedef boost::thread_specific_ptr<QueryHeap> SearchEngineHeapPtr;
 
     static SearchEngineHeapPtr forwardHeap;

DataStructures/SegmentInformation.h

@@ -25,8 +25,8 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef SEGMENTINFORMATION_H_
-#define SEGMENTINFORMATION_H_
+#ifndef SEGMENT_INFORMATION_H
+#define SEGMENT_INFORMATION_H
 
 #include "TurnInstructions.h"
 
@@ -35,47 +35,36 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <osrm/Coordinate.h>
 
 // Struct fits everything in one cache line
-struct SegmentInformation {
+struct SegmentInformation
+{
     FixedPointCoordinate location;
     NodeID name_id;
     unsigned duration;
     double length;
-    short bearing; //more than enough [0..3600] fits into 12 bits
+    short bearing; // more than enough [0..3600] fits into 12 bits
     TurnInstruction turn_instruction;
     bool necessary;
 
-    explicit SegmentInformation(
-        const FixedPointCoordinate & location,
-        const NodeID name_id,
-        const unsigned duration,
-        const double length,
-        const TurnInstruction turn_instruction,
-        const bool necessary
-    ) :
-        location(location),
-        name_id(name_id),
-        duration(duration),
-        length(length),
-        bearing(0),
-        turn_instruction(turn_instruction),
-        necessary(necessary)
-    { }
+    explicit SegmentInformation(const FixedPointCoordinate &location,
+                                const NodeID name_id,
+                                const unsigned duration,
+                                const double length,
+                                const TurnInstruction turn_instruction,
+                                const bool necessary)
+        : location(location), name_id(name_id), duration(duration), length(length), bearing(0),
+          turn_instruction(turn_instruction), necessary(necessary)
+    {
+    }
 
-    explicit SegmentInformation(
-        const FixedPointCoordinate & location,
-        const NodeID name_id,
-        const unsigned duration,
-        const double length,
-        const TurnInstruction turn_instruction
-    ) :
-        location(location),
-        name_id(name_id),
-        duration(duration),
-        length(length),
-        bearing(0),
-        turn_instruction(turn_instruction),
-        necessary(turn_instruction != 0)
-    { }
+    explicit SegmentInformation(const FixedPointCoordinate &location,
+                                const NodeID name_id,
+                                const unsigned duration,
+                                const double length,
+                                const TurnInstruction turn_instruction)
+        : location(location), name_id(name_id), duration(duration), length(length), bearing(0),
+          turn_instruction(turn_instruction), necessary(turn_instruction != TurnInstruction::NoTurn)
+    {
+    }
 };
 
-#endif /* SEGMENTINFORMATION_H_ */
+#endif /* SEGMENT_INFORMATION_H */

DataStructures/SharedMemoryFactory.h

@@ -31,10 +31,8 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../Util/OSRMException.h"
 #include "../Util/SimpleLogger.h"
 
-#include <boost/noncopyable.hpp>
 #include <boost/filesystem.hpp>
 #include <boost/filesystem/fstream.hpp>
-#include <boost/integer.hpp>
 #include <boost/interprocess/mapped_region.hpp>
 #include <boost/interprocess/xsi_shared_memory.hpp>
 
@@ -43,206 +41,191 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <sys/shm.h>
 #endif
 
-#include <cstring>
+// #include <cstring>
+#include <cstdint>
 
 #include <algorithm>
 #include <exception>
 
-struct OSRMLockFile {
-	boost::filesystem::path operator()() {
-		boost::filesystem::path temp_dir =
-			boost::filesystem::temp_directory_path();
-	    boost::filesystem::path lock_file = temp_dir / "osrm.lock";
-	    return lock_file;
-	}
+struct OSRMLockFile
+{
+    boost::filesystem::path operator()()
+    {
+        boost::filesystem::path temp_dir = boost::filesystem::temp_directory_path();
+        boost::filesystem::path lock_file = temp_dir / "osrm.lock";
+        return lock_file;
+    }
 };
 
-class SharedMemory : boost::noncopyable {
+class SharedMemory
+{
 
-	//Remove shared memory on destruction
-	class shm_remove : boost::noncopyable {
-	private:
-		int m_shmid;
-		bool m_initialized;
-	public:
-		void SetID(int shmid) {
-		 	m_shmid = shmid;
-		 	m_initialized = true;
-		}
+    // Remove shared memory on destruction
+    class shm_remove
+    {
+      private:
+        int m_shmid;
+        bool m_initialized;
 
-		shm_remove() : m_shmid(INT_MIN), m_initialized(false) {}
+      public:
+        void SetID(int shmid)
+        {
+            m_shmid = shmid;
+            m_initialized = true;
+        }
 
-		~shm_remove(){
-			if(m_initialized) {
-				SimpleLogger().Write(logDEBUG) <<
-					"automatic memory deallocation";
-				if(!boost::interprocess::xsi_shared_memory::remove(m_shmid)) {
-					SimpleLogger().Write(logDEBUG) << "could not deallocate id " << m_shmid;
-				}
-			}
-		}
-	};
+        shm_remove() : m_shmid(INT_MIN), m_initialized(false) {}
+        shm_remove(const shm_remove &) = delete;
+        ~shm_remove()
+        {
+            if (m_initialized)
+            {
+                SimpleLogger().Write(logDEBUG) << "automatic memory deallocation";
+                if (!boost::interprocess::xsi_shared_memory::remove(m_shmid))
+                {
+                    SimpleLogger().Write(logDEBUG) << "could not deallocate id " << m_shmid;
+                }
+            }
+        }
+    };
 
-public:
-	void * Ptr() const {
-		return region.get_address();
-	}
+  public:
+    void *Ptr() const { return region.get_address(); }
 
-	template<typename IdentifierT >
-	SharedMemory(
-		const boost::filesystem::path & lock_file,
-		const IdentifierT id,
-		const uint64_t size = 0,
-		bool read_write = false,
-		bool remove_prev = true
-	) : key(
-			lock_file.string().c_str(),
-			id
-	) {
-    	if( 0 == size ){ //read_only
-    		shm = boost::interprocess::xsi_shared_memory (
-    			boost::interprocess::open_only,
-    			key
-			);
+    SharedMemory() = delete;
+    SharedMemory(const SharedMemory &) = delete;
 
-    		region = boost::interprocess::mapped_region (
-    			shm,
-    			(
-    				read_write ?
-    					boost::interprocess::read_write :
-    					boost::interprocess::read_only
-    			)
-			);
-    	} else { //writeable pointer
-    		//remove previously allocated mem
-    		if( remove_prev ) {
-	    		Remove(key);
-	    	}
-    		shm = boost::interprocess::xsi_shared_memory (
-    			boost::interprocess::open_or_create,
-    			key,
-    			size
-    		);
+    template <typename IdentifierT>
+    SharedMemory(const boost::filesystem::path &lock_file,
+                 const IdentifierT id,
+                 const uint64_t size = 0,
+                 bool read_write = false,
+                 bool remove_prev = true)
+        : key(lock_file.string().c_str(), id)
+    {
+        if (0 == size)
+        { // read_only
+            shm = boost::interprocess::xsi_shared_memory(boost::interprocess::open_only, key);
+
+            region = boost::interprocess::mapped_region(
+                shm,
+                (read_write ? boost::interprocess::read_write : boost::interprocess::read_only));
+        }
+        else
+        { // writeable pointer
+            // remove previously allocated mem
+            if (remove_prev)
+            {
+                Remove(key);
+            }
+            shm = boost::interprocess::xsi_shared_memory(
+                boost::interprocess::open_or_create, key, size);
 #ifdef __linux__
-			if( -1 == shmctl(shm.get_shmid(), SHM_LOCK, 0) ) {
-				if( ENOMEM == errno ) {
-					SimpleLogger().Write(logWARNING) <<
-						"could not lock shared memory to RAM";
-				}
-			}
+            if (-1 == shmctl(shm.get_shmid(), SHM_LOCK, 0))
+            {
+                if (ENOMEM == errno)
+                {
+                    SimpleLogger().Write(logWARNING) << "could not lock shared memory to RAM";
+                }
+            }
 #endif
-		    region = boost::interprocess::mapped_region (
-		    	shm,
-		    	boost::interprocess::read_write
-	    	);
+            region = boost::interprocess::mapped_region(shm, boost::interprocess::read_write);
 
- 			remover.SetID( shm.get_shmid() );
- 			SimpleLogger().Write(logDEBUG) <<
- 				"writeable memory allocated " << size << " bytes";
-    	}
-	}
+            remover.SetID(shm.get_shmid());
+            SimpleLogger().Write(logDEBUG) << "writeable memory allocated " << size << " bytes";
+        }
+    }
 
-	template<typename IdentifierT >
-	static bool RegionExists(
-		const IdentifierT id
-	) {
-		bool result = true;
-		try {
-			OSRMLockFile lock_file;
-			boost::interprocess::xsi_key key( lock_file().string().c_str(), id );
-			result = RegionExists(key);
-		} catch(...) {
-			result = false;
-		}
-		return result;
-	}
+    template <typename IdentifierT> static bool RegionExists(const IdentifierT id)
+    {
+        bool result = true;
+        try
+        {
+            OSRMLockFile lock_file;
+            boost::interprocess::xsi_key key(lock_file().string().c_str(), id);
+            result = RegionExists(key);
+        }
+        catch (...) { result = false; }
+        return result;
+    }
 
-	template<typename IdentifierT >
-	static bool Remove(
-		const IdentifierT id
-	) {
-		OSRMLockFile lock_file;
-		boost::interprocess::xsi_key key( lock_file().string().c_str(), id );
-		return Remove(key);
-	}
+    template <typename IdentifierT> static bool Remove(const IdentifierT id)
+    {
+        OSRMLockFile lock_file;
+        boost::interprocess::xsi_key key(lock_file().string().c_str(), id);
+        return Remove(key);
+    }
 
-private:
-	static bool RegionExists( const boost::interprocess::xsi_key &key ) {
-		bool result = true;
-	    try {
-		    boost::interprocess::xsi_shared_memory shm(
-		        boost::interprocess::open_only,
-		        key
-		    );
-	    } catch(...) {
-	    	result = false;
-	    }
-	    return result;
-	}
+  private:
+    static bool RegionExists(const boost::interprocess::xsi_key &key)
+    {
+        bool result = true;
+        try { boost::interprocess::xsi_shared_memory shm(boost::interprocess::open_only, key); }
+        catch (...) { result = false; }
+        return result;
+    }
 
-	static bool Remove(
-		const boost::interprocess::xsi_key &key
-	) {
-		bool ret = false;
-		try{
-			SimpleLogger().Write(logDEBUG) << "deallocating prev memory";
-			boost::interprocess::xsi_shared_memory xsi(
-				boost::interprocess::open_only,
-				key
-			);
-			ret = boost::interprocess::xsi_shared_memory::remove(xsi.get_shmid());
-		} catch(const boost::interprocess::interprocess_exception &e){
-			if(e.get_error_code() != boost::interprocess::not_found_error) {
-				throw;
-			}
-		}
-		return ret;
-	}
+    static bool Remove(const boost::interprocess::xsi_key &key)
+    {
+        bool ret = false;
+        try
+        {
+            SimpleLogger().Write(logDEBUG) << "deallocating prev memory";
+            boost::interprocess::xsi_shared_memory xsi(boost::interprocess::open_only, key);
+            ret = boost::interprocess::xsi_shared_memory::remove(xsi.get_shmid());
+        }
+        catch (const boost::interprocess::interprocess_exception &e)
+        {
+            if (e.get_error_code() != boost::interprocess::not_found_error)
+            {
+                throw;
+            }
+        }
+        return ret;
+    }
 
-	boost::interprocess::xsi_key key;
-	boost::interprocess::xsi_shared_memory shm;
-	boost::interprocess::mapped_region region;
-	shm_remove remover;
+    boost::interprocess::xsi_key key;
+    boost::interprocess::xsi_shared_memory shm;
+    boost::interprocess::mapped_region region;
+    shm_remove remover;
 };
 
-template<class LockFileT = OSRMLockFile>
-class SharedMemoryFactory_tmpl : boost::noncopyable {
-public:
+template <class LockFileT = OSRMLockFile> class SharedMemoryFactory_tmpl
+{
+  public:
+    template <typename IdentifierT>
+    static SharedMemory *Get(const IdentifierT &id,
+                             const uint64_t size = 0,
+                             bool read_write = false,
+                             bool remove_prev = true)
+    {
+        try
+        {
+            LockFileT lock_file;
+            if (!boost::filesystem::exists(lock_file()))
+            {
+                if (0 == size)
+                {
+                    throw OSRMException("lock file does not exist, exiting");
+                }
+                else
+                {
+                    boost::filesystem::ofstream ofs(lock_file());
+                    ofs.close();
+                }
+            }
+            return new SharedMemory(lock_file(), id, size, read_write, remove_prev);
+        }
+        catch (const boost::interprocess::interprocess_exception &e)
+        {
+            SimpleLogger().Write(logWARNING) << "caught exception: " << e.what() << ", code "
+                                             << e.get_error_code();
+            throw OSRMException(e.what());
+        }
+    }
 
-	template<typename IdentifierT >
-	static SharedMemory * Get(
-		const IdentifierT & id,
-		const uint64_t size = 0,
-		bool read_write = false,
-		bool remove_prev = true
-	) {
-		try {
-			LockFileT lock_file;
-		    if(!boost::filesystem::exists(lock_file()) ) {
-		    	if( 0 == size ) {
-	      			throw OSRMException("lock file does not exist, exiting");
-	      		} else {
-	      			boost::filesystem::ofstream ofs(lock_file());
-	      			ofs.close();
-	      		}
-	      	}
-			return new SharedMemory(
-				lock_file(),
-				id,
-				size,
-				read_write,
-				remove_prev
-			);
-	   	} catch(const boost::interprocess::interprocess_exception &e){
-    		SimpleLogger().Write(logWARNING) <<
-    			"caught exception: " << e.what() <<
-    			", code " << e.get_error_code();
-    		throw OSRMException(e.what());
-    	}
-	}
-
-private:
-	SharedMemoryFactory_tmpl() {}
+    SharedMemoryFactory_tmpl() = delete;
+    SharedMemoryFactory_tmpl(const SharedMemoryFactory_tmpl &) = delete;
 };
 
 typedef SharedMemoryFactory_tmpl<> SharedMemoryFactory;

DataStructures/SharedMemoryVectorWrapper.h

@@ -31,153 +31,114 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../Util/SimpleLogger.h"
 
 #include <boost/assert.hpp>
-#include <boost/type_traits.hpp>
 
 #include <algorithm>
 #include <iterator>
+#include <type_traits>
 #include <vector>
 
-template<typename DataT>
-class ShMemIterator : public std::iterator<std::input_iterator_tag, DataT> {
-    DataT * p;
-public:
-    explicit ShMemIterator(DataT * x) : p(x) {}
-    ShMemIterator(const ShMemIterator & mit) : p(mit.p) {}
-    ShMemIterator& operator++() {
+template <typename DataT> class ShMemIterator : public std::iterator<std::input_iterator_tag, DataT>
+{
+    DataT *p;
+
+  public:
+    explicit ShMemIterator(DataT *x) : p(x) {}
+    ShMemIterator(const ShMemIterator &mit) : p(mit.p) {}
+    ShMemIterator &operator++()
+    {
         ++p;
         return *this;
     }
-    ShMemIterator operator++(int) {
+    ShMemIterator operator++(int)
+    {
         ShMemIterator tmp(*this);
         operator++();
         return tmp;
     }
-    ShMemIterator operator+(std::ptrdiff_t diff) {
-        ShMemIterator tmp(p+diff);
+    ShMemIterator operator+(std::ptrdiff_t diff)
+    {
+        ShMemIterator tmp(p + diff);
         return tmp;
     }
-    bool operator==(const ShMemIterator& rhs) {
-        return p==rhs.p;
-    }
-    bool operator!=(const ShMemIterator& rhs) {
-        return p!=rhs.p;
-    }
-    DataT& operator*() {
-        return *p;
-    }
+    bool operator==(const ShMemIterator &rhs) { return p == rhs.p; }
+    bool operator!=(const ShMemIterator &rhs) { return p != rhs.p; }
+    DataT &operator*() { return *p; }
 };
 
-template<typename DataT>
-class SharedMemoryWrapper {
-private:
-    DataT * m_ptr;
+template <typename DataT> class SharedMemoryWrapper
+{
+  private:
+    DataT *m_ptr;
     std::size_t m_size;
 
-public:
-    SharedMemoryWrapper() :
-        m_ptr(NULL),
-        m_size(0)
-    { }
+  public:
+    SharedMemoryWrapper() : m_ptr(nullptr), m_size(0) {}
 
-    SharedMemoryWrapper(DataT * ptr, std::size_t size) :
-        m_ptr(ptr),
-        m_size(size)
-    { }
+    SharedMemoryWrapper(DataT *ptr, std::size_t size) : m_ptr(ptr), m_size(size) {}
 
-    void swap( SharedMemoryWrapper<DataT> & other ) {
+    void swap(SharedMemoryWrapper<DataT> &other)
+    {
         BOOST_ASSERT_MSG(m_size != 0 || other.size() != 0, "size invalid");
-        std::swap( m_size, other.m_size);
-        std::swap( m_ptr , other.m_ptr );
+        std::swap(m_size, other.m_size);
+        std::swap(m_ptr, other.m_ptr);
     }
 
-    // void SetData(const DataT * ptr, const std::size_t size) {
-    //     BOOST_ASSERT_MSG( 0 == m_size, "vector not empty");
-    //     BOOST_ASSERT_MSG( 0 < size   , "new vector empty");
-    //     m_ptr.reset(ptr);
-    //     m_size = size;
-    // }
+    DataT &at(const std::size_t index) { return m_ptr[index]; }
 
-    DataT & at(const std::size_t index) {
-        return m_ptr[index];
-    }
+    const DataT &at(const std::size_t index) const { return m_ptr[index]; }
 
-    const DataT & at(const std::size_t index) const {
-        return m_ptr[index];
-    }
+    ShMemIterator<DataT> begin() const { return ShMemIterator<DataT>(m_ptr); }
 
-    ShMemIterator<DataT> begin() const {
-        return ShMemIterator<DataT>(m_ptr);
-    }
-
-    ShMemIterator<DataT> end() const {
-        return ShMemIterator<DataT>(m_ptr+m_size);
-    }
+    ShMemIterator<DataT> end() const { return ShMemIterator<DataT>(m_ptr + m_size); }
 
     std::size_t size() const { return m_size; }
 
     bool empty() const { return 0 == size(); }
 
-    DataT & operator[](const unsigned index) {
+    DataT &operator[](const unsigned index)
+    {
         BOOST_ASSERT_MSG(index < m_size, "invalid size");
         return m_ptr[index];
     }
 
-    const DataT & operator[](const unsigned index) const {
+    const DataT &operator[](const unsigned index) const
+    {
         BOOST_ASSERT_MSG(index < m_size, "invalid size");
         return m_ptr[index];
     }
 };
 
-template<>
-class SharedMemoryWrapper<bool> {
-private:
-    unsigned * m_ptr;
+template <> class SharedMemoryWrapper<bool>
+{
+  private:
+    unsigned *m_ptr;
     std::size_t m_size;
 
-public:
-    SharedMemoryWrapper() :
-        m_ptr(NULL),
-        m_size(0)
-    { }
+  public:
+    SharedMemoryWrapper() : m_ptr(nullptr), m_size(0) {}
 
-    SharedMemoryWrapper(unsigned * ptr, std::size_t size) :
-        m_ptr(ptr),
-        m_size(size)
-    { }
+    SharedMemoryWrapper(unsigned *ptr, std::size_t size) : m_ptr(ptr), m_size(size) {}
 
-    void swap( SharedMemoryWrapper<bool> & other ) {
+    void swap(SharedMemoryWrapper<bool> &other)
+    {
         BOOST_ASSERT_MSG(m_size != 0 || other.size() != 0, "size invalid");
-        std::swap( m_size, other.m_size);
-        std::swap( m_ptr , other.m_ptr );
+        std::swap(m_size, other.m_size);
+        std::swap(m_ptr, other.m_ptr);
     }
 
-    // void SetData(const DataT * ptr, const std::size_t size) {
-    //     BOOST_ASSERT_MSG( 0 == m_size, "vector not empty");
-    //     BOOST_ASSERT_MSG( 0 < size   , "new vector empty");
-    //     m_ptr.reset(ptr);
-    //     m_size = size;
-    // }
-
-    bool at(const std::size_t index) const {
-        // BOOST_ASSERT_MSG(index < m_size, "invalid size");
+    bool at(const std::size_t index) const
+    {
         const unsigned bucket = index / 32;
         const unsigned offset = index % 32;
         return m_ptr[bucket] & (1 << offset);
     }
 
-    // ShMemIterator<DataT> begin() const {
-    //     return ShMemIterator<DataT>(m_ptr);
-    // }
-
-    // ShMemIterator<DataT> end() const {
-    //     return ShMemIterator<DataT>(m_ptr+m_size);
-    // }
-
     std::size_t size() const { return m_size; }
 
     bool empty() const { return 0 == size(); }
 
-    bool operator[](const unsigned index) {
+    bool operator[](const unsigned index)
+    {
         BOOST_ASSERT_MSG(index < m_size, "invalid size");
         const unsigned bucket = index / 32;
         const unsigned offset = index % 32;
@@ -185,13 +146,11 @@ public:
     }
 };
 
-template<typename DataT, bool UseSharedMemory>
-struct ShM {
-    typedef typename boost::conditional<
-                     UseSharedMemory,
-                     SharedMemoryWrapper<DataT>,
-                     std::vector<DataT>
-                 >::type vector;
- };
+template <typename DataT, bool UseSharedMemory> struct ShM
+{
+    typedef typename std::conditional<UseSharedMemory,
+                                      SharedMemoryWrapper<DataT>,
+                                      std::vector<DataT>>::type vector;
+};
 
-#endif //SHARED_MEMORY_VECTOR_WRAPPER_H
+#endif // SHARED_MEMORY_VECTOR_WRAPPER_H

DataStructures/StaticGraph.h

@@ -25,104 +25,126 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef STATICGRAPH_H_INCLUDED
-#define STATICGRAPH_H_INCLUDED
+#ifndef STATIC_GRAPH_H
+#define STATIC_GRAPH_H
 
 #include "../DataStructures/Percent.h"
 #include "../DataStructures/SharedMemoryVectorWrapper.h"
 #include "../Util/SimpleLogger.h"
 #include "../typedefs.h"
 
+#include <boost/range/irange.hpp>
+
 #include <algorithm>
+#include <limits>
 #include <vector>
 
-template< typename EdgeDataT, bool UseSharedMemory = false>
-class StaticGraph {
-public:
+template <typename EdgeDataT, bool UseSharedMemory = false> class StaticGraph
+{
+  public:
+    typedef decltype(boost::irange(0u,0u)) EdgeRange;
     typedef NodeID NodeIterator;
     typedef NodeID EdgeIterator;
     typedef EdgeDataT EdgeData;
-    class InputEdge {
-    public:
+    class InputEdge
+    {
+      public:
         EdgeDataT data;
         NodeIterator source;
         NodeIterator target;
-        bool operator<( const InputEdge& right ) const {
-            if ( source != right.source ) {
+        bool operator<(const InputEdge &right) const
+        {
+            if (source != right.source)
+            {
                 return source < right.source;
             }
             return target < right.target;
         }
     };
 
-    struct _StrNode {
-        //index of the first edge
-        EdgeIterator firstEdge;
+    struct NodeArrayEntry
+    {
+        // index of the first edge
+        EdgeIterator first_edge;
     };
 
-    struct _StrEdge {
+    struct EdgeArrayEntry
+    {
         NodeID target;
         EdgeDataT data;
     };
 
-    StaticGraph( const int nodes, std::vector< InputEdge > &graph ) {
-        std::sort( graph.begin(), graph.end() );
-        _numNodes = nodes;
-        _numEdges = ( EdgeIterator ) graph.size();
-        _nodes.resize( _numNodes + 1);
+    EdgeRange GetAdjacentEdgeRange(const NodeID node) const
+    {
+        return boost::irange(BeginEdges(node), EndEdges(node));
+    }
+
+    StaticGraph(const int nodes, std::vector<InputEdge> &graph)
+    {
+        std::sort(graph.begin(), graph.end());
+        number_of_nodes = nodes;
+        number_of_edges = (EdgeIterator)graph.size();
+        node_array.resize(number_of_nodes + 1);
         EdgeIterator edge = 0;
         EdgeIterator position = 0;
-        for ( NodeIterator node = 0; node <= _numNodes; ++node ) {
-            EdgeIterator lastEdge = edge;
-            while ( edge < _numEdges && graph[edge].source == node )
+        for (NodeIterator node = 0; node <= number_of_nodes; ++node)
+        {
+            EdgeIterator last_edge = edge;
+            while (edge < number_of_edges && graph[edge].source == node)
+            {
                 ++edge;
-            _nodes[node].firstEdge = position; //=edge
-            position += edge - lastEdge; //remove
+            }
+            node_array[node].first_edge = position; //=edge
+            position += edge - last_edge;           // remove
         }
-        _edges.resize( position ); //(edge)
+        edge_array.resize(position); //(edge)
         edge = 0;
-        for ( NodeIterator node = 0; node < _numNodes; ++node ) {
-            for ( EdgeIterator i = _nodes[node].firstEdge, e = _nodes[node+1].firstEdge; i != e; ++i ) {
-                _edges[i].target = graph[edge].target;
-                _edges[i].data = graph[edge].data;
-                assert(_edges[i].data.distance > 0);
+        for (NodeIterator node = 0; node < number_of_nodes; ++node)
+        {
+            EdgeIterator e = node_array[node + 1].first_edge;
+            for (EdgeIterator i = node_array[node].first_edge; i != e; ++i)
+            {
+                edge_array[i].target = graph[edge].target;
+                edge_array[i].data = graph[edge].data;
+                assert(edge_array[i].data.distance > 0);
                 edge++;
             }
         }
     }
 
-    StaticGraph(
-        typename ShM<_StrNode, UseSharedMemory>::vector & nodes,
-        typename ShM<_StrEdge, UseSharedMemory>::vector & edges
-    ) {
-        _numNodes = nodes.size()-1;
-        _numEdges = edges.size();
+    StaticGraph(typename ShM<NodeArrayEntry, UseSharedMemory>::vector &nodes,
+                typename ShM<EdgeArrayEntry, UseSharedMemory>::vector &edges)
+    {
+        number_of_nodes = nodes.size() - 1;
+        number_of_edges = edges.size();
 
-        _nodes.swap(nodes);
-        _edges.swap(edges);
+        node_array.swap(nodes);
+        edge_array.swap(edges);
 
 #ifndef NDEBUG
         Percent p(GetNumberOfNodes());
-        for(unsigned u = 0; u < GetNumberOfNodes(); ++u) {
-            for(unsigned eid = BeginEdges(u); eid < EndEdges(u); ++eid) {
-                unsigned v = GetTarget(eid);
-                EdgeData & data = GetEdgeData(eid);
-                if(data.shortcut) {
-                    unsigned eid2 = FindEdgeInEitherDirection(u, data.id);
-                    if(eid2 == UINT_MAX) {
-                        SimpleLogger().Write(logWARNING) <<
-                            "cannot find first segment of edge (" <<
-                                u << "," << data.id << "," << v << "), eid: " << eid;
-
-                        data.shortcut = false;
+        for (unsigned u = 0; u < GetNumberOfNodes(); ++u)
+        {
+            for (auto eid : GetAdjacentEdgeRange(u))
+            {
+                const unsigned v = GetTarget(eid);
+                const EdgeData &data = GetEdgeData(eid);
+                if (data.shortcut)
+                {
+                    const EdgeID first_edge_id = FindEdgeInEitherDirection(u, data.id);
+                    if (SPECIAL_EDGEID == first_edge_id)
+                    {
+                        SimpleLogger().Write(logWARNING) << "cannot find first segment of edge ("
+                                                         << u << "," << data.id << "," << v
+                                                         << "), eid: " << eid;
                         BOOST_ASSERT(false);
                     }
-                    eid2 = FindEdgeInEitherDirection(data.id, v);
-                    if(eid2 == UINT_MAX) {
-                        SimpleLogger().Write(logWARNING) <<
-                            "cannot find second segment of edge (" <<
-                                u << "," << data.id << "," << v << "), eid2: " << eid2;
-                        data.shortcut = false;
+                    const EdgeID second_edge_id = FindEdgeInEitherDirection(data.id, v);
+                    if (SPECIAL_EDGEID == second_edge_id)
+                    {
+                        SimpleLogger().Write(logWARNING) << "cannot find second segment of edge ("
+                                                         << u << "," << data.id << "," << v
+                                                         << "), eid: " << eid;
                         BOOST_ASSERT(false);
                     }
                 }
@@ -132,75 +154,76 @@ public:
 #endif
     }
 
-    unsigned GetNumberOfNodes() const {
-        return _numNodes;
+    unsigned GetNumberOfNodes() const { return number_of_nodes -1; }
+
+    unsigned GetNumberOfEdges() const { return number_of_edges; }
+
+    unsigned GetOutDegree(const NodeIterator n) const { return BeginEdges(n) - EndEdges(n) - 1; }
+
+    inline NodeIterator GetTarget(const EdgeIterator e) const
+    {
+        return NodeIterator(edge_array[e].target);
     }
 
-    unsigned GetNumberOfEdges() const {
-        return _numEdges;
+    inline EdgeDataT &GetEdgeData(const EdgeIterator e) { return edge_array[e].data; }
+
+    const EdgeDataT &GetEdgeData(const EdgeIterator e) const { return edge_array[e].data; }
+
+    EdgeIterator BeginEdges(const NodeIterator n) const
+    {
+        return EdgeIterator(node_array.at(n).first_edge);
     }
 
-    unsigned GetOutDegree( const NodeIterator n ) const {
-        return BeginEdges(n)-EndEdges(n) - 1;
+    EdgeIterator EndEdges(const NodeIterator n) const
+    {
+        return EdgeIterator(node_array.at(n + 1).first_edge);
     }
 
-    inline NodeIterator GetTarget( const EdgeIterator e ) const {
-        return NodeIterator( _edges[e].target );
-    }
-
-    inline EdgeDataT &GetEdgeData( const EdgeIterator e ) {
-        return _edges[e].data;
-    }
-
-    const EdgeDataT &GetEdgeData( const EdgeIterator e ) const {
-        return _edges[e].data;
-    }
-
-    EdgeIterator BeginEdges( const NodeIterator n ) const {
-        return EdgeIterator( _nodes.at(n).firstEdge );
-    }
-
-    EdgeIterator EndEdges( const NodeIterator n ) const {
-        return EdgeIterator( _nodes.at(n+1).firstEdge );
-    }
-
-    //searches for a specific edge
-    EdgeIterator FindEdge( const NodeIterator from, const NodeIterator to ) const {
-        EdgeIterator smallestEdge = SPECIAL_EDGEID;
-        EdgeWeight smallestWeight = INVALID_EDGE_WEIGHT;
-        for ( EdgeIterator edge = BeginEdges( from ); edge < EndEdges(from); edge++ ) {
+    // searches for a specific edge
+    EdgeIterator FindEdge(const NodeIterator from, const NodeIterator to) const
+    {
+        EdgeIterator smallest_edge = SPECIAL_EDGEID;
+        EdgeWeight smallest_weight = INVALID_EDGE_WEIGHT;
+        for (auto edge : GetAdjacentEdgeRange(from))
+        {
             const NodeID target = GetTarget(edge);
             const EdgeWeight weight = GetEdgeData(edge).distance;
-            if(target == to && weight < smallestWeight) {
-                smallestEdge = edge; smallestWeight = weight;
+            if (target == to && weight < smallest_weight)
+            {
+                smallest_edge = edge;
+                smallest_weight = weight;
             }
         }
-        return smallestEdge;
+        return smallest_edge;
     }
 
-    EdgeIterator FindEdgeInEitherDirection( const NodeIterator from, const NodeIterator to ) const {
-        EdgeIterator tmp =  FindEdge( from, to );
-        return (UINT_MAX != tmp ? tmp : FindEdge( to, from ));
+    EdgeIterator FindEdgeInEitherDirection(const NodeIterator from, const NodeIterator to) const
+    {
+        EdgeIterator tmp = FindEdge(from, to);
+        return (SPECIAL_NODEID != tmp ? tmp : FindEdge(to, from));
     }
 
-    EdgeIterator FindEdgeIndicateIfReverse( const NodeIterator from, const NodeIterator to, bool & result ) const {
-        EdgeIterator tmp =  FindEdge( from, to );
-        if(UINT_MAX == tmp) {
-            tmp =  FindEdge( to, from );
-            if(UINT_MAX != tmp) {
+    EdgeIterator
+    FindEdgeIndicateIfReverse(const NodeIterator from, const NodeIterator to, bool &result) const
+    {
+        EdgeIterator current_iterator = FindEdge(from, to);
+        if (SPECIAL_NODEID == current_iterator)
+        {
+            current_iterator = FindEdge(to, from);
+            if (SPECIAL_NODEID != current_iterator)
+            {
                 result = true;
             }
         }
-        return tmp;
+        return current_iterator;
     }
 
-private:
+  private:
+    NodeIterator number_of_nodes;
+    EdgeIterator number_of_edges;
 
-    NodeIterator _numNodes;
-    EdgeIterator _numEdges;
-
-    typename ShM< _StrNode, UseSharedMemory >::vector _nodes;
-    typename ShM< _StrEdge, UseSharedMemory >::vector _edges;
+    typename ShM<NodeArrayEntry, UseSharedMemory>::vector node_array;
+    typename ShM<EdgeArrayEntry, UseSharedMemory>::vector edge_array;
 };
 
-#endif // STATICGRAPH_H_INCLUDED
+#endif // STATIC_GRAPH_H

DataStructures/StaticKDTree.h

@@ -36,17 +36,20 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <stack>
 #include <limits>
 
-namespace KDTree {
+namespace KDTree
+{
 
 #define KDTREE_BASESIZE (8)
 
-template< unsigned k, typename T >
-class BoundingBox {
-public:
-    BoundingBox() {
-        for ( unsigned dim = 0; dim < k; ++dim ) {
-            min[dim] = std::numeric_limits< T >::min();
-            max[dim] = std::numeric_limits< T >::max();
+template <unsigned k, typename T> class BoundingBox
+{
+  public:
+    BoundingBox()
+    {
+        for (unsigned dim = 0; dim < k; ++dim)
+        {
+            min[dim] = std::numeric_limits<T>::min();
+            max[dim] = std::numeric_limits<T>::max();
         }
     }
 
@@ -54,102 +57,118 @@ public:
     T max[k];
 };
 
-struct NoData {};
+struct NoData
+{
+};
 
-template< unsigned k, typename T >
-class EuclidianMetric {
-public:
-    double operator() ( const T left[k], const T right[k] ) {
+template <unsigned k, typename T> class EuclidianMetric
+{
+  public:
+    double operator()(const T left[k], const T right[k])
+    {
         double result = 0;
-        for ( unsigned i = 0; i < k; ++i ) {
+        for (unsigned i = 0; i < k; ++i)
+        {
             double temp = (double)left[i] - (double)right[i];
             result += temp * temp;
         }
         return result;
     }
 
-    double operator() ( const BoundingBox< k, T > &box, const T point[k] ) {
+    double operator()(const BoundingBox<k, T> &box, const T point[k])
+    {
         T nearest[k];
-        for ( unsigned dim = 0; dim < k; ++dim ) {
-            if ( point[dim] < box.min[dim] )
+        for (unsigned dim = 0; dim < k; ++dim)
+        {
+            if (point[dim] < box.min[dim])
                 nearest[dim] = box.min[dim];
-            else if ( point[dim] > box.max[dim] )
+            else if (point[dim] > box.max[dim])
                 nearest[dim] = box.max[dim];
             else
                 nearest[dim] = point[dim];
         }
-        return operator() ( point, nearest );
+        return operator()(point, nearest);
     }
 };
 
-template < unsigned k, typename T, typename Data = NoData, typename Metric = EuclidianMetric< k, T > >
-class StaticKDTree {
-public:
-
-    struct InputPoint {
+template <unsigned k, typename T, typename Data = NoData, typename Metric = EuclidianMetric<k, T>>
+class StaticKDTree
+{
+  public:
+    struct InputPoint
+    {
         T coordinates[k];
         Data data;
-        bool operator==( const InputPoint& right )
-		                {
-            for ( int i = 0; i < k; i++ ) {
-                if ( coordinates[i] != right.coordinates[i] )
+        bool operator==(const InputPoint &right)
+        {
+            for (int i = 0; i < k; i++)
+            {
+                if (coordinates[i] != right.coordinates[i])
                     return false;
             }
             return true;
-		                }
+        }
     };
 
-    explicit StaticKDTree( std::vector< InputPoint > * points ){
-        BOOST_ASSERT( k > 0 );
-        BOOST_ASSERT ( points->size() > 0 );
+    explicit StaticKDTree(std::vector<InputPoint> *points)
+    {
+        BOOST_ASSERT(k > 0);
+        BOOST_ASSERT(points->size() > 0);
         size = points->size();
         kdtree = new InputPoint[size];
-        for ( Iterator i = 0; i != size; ++i ) {
+        for (Iterator i = 0; i != size; ++i)
+        {
             kdtree[i] = points->at(i);
-            for ( unsigned dim = 0; dim < k; ++dim ) {
-                if ( kdtree[i].coordinates[dim] < boundingBox.min[dim] )
+            for (unsigned dim = 0; dim < k; ++dim)
+            {
+                if (kdtree[i].coordinates[dim] < boundingBox.min[dim])
                     boundingBox.min[dim] = kdtree[i].coordinates[dim];
-                if ( kdtree[i].coordinates[dim] > boundingBox.max[dim] )
+                if (kdtree[i].coordinates[dim] > boundingBox.max[dim])
                     boundingBox.max[dim] = kdtree[i].coordinates[dim];
             }
         }
-        std::stack< Tree > s;
-        s.push ( Tree ( 0, size, 0 ) );
-        while ( !s.empty() ) {
+        std::stack<Tree> s;
+        s.push(Tree(0, size, 0));
+        while (!s.empty())
+        {
             Tree tree = s.top();
             s.pop();
 
-            if ( tree.right - tree.left < KDTREE_BASESIZE )
+            if (tree.right - tree.left < KDTREE_BASESIZE)
                 continue;
 
-            Iterator middle = tree.left + ( tree.right - tree.left ) / 2;
-            std::nth_element( kdtree + tree.left, kdtree + middle, kdtree + tree.right, Less( tree.dimension ) );
-            s.push( Tree( tree.left, middle, ( tree.dimension + 1 ) % k ) );
-            s.push( Tree( middle + 1, tree.right, ( tree.dimension + 1 ) % k ) );
+            Iterator middle = tree.left + (tree.right - tree.left) / 2;
+            std::nth_element(
+                kdtree + tree.left, kdtree + middle, kdtree + tree.right, Less(tree.dimension));
+            s.push(Tree(tree.left, middle, (tree.dimension + 1) % k));
+            s.push(Tree(middle + 1, tree.right, (tree.dimension + 1) % k));
         }
     }
 
-    ~StaticKDTree(){
-        delete[] kdtree;
-    }
+    ~StaticKDTree() { delete[] kdtree; }
 
-    bool NearestNeighbor( InputPoint* result, const InputPoint& point ) {
+    bool NearestNeighbor(InputPoint *result, const InputPoint &point)
+    {
         Metric distance;
         bool found = false;
-        double nearestDistance = std::numeric_limits< T >::max();
-        std::stack< NNTree > s;
-        s.push ( NNTree ( 0, size, 0, boundingBox ) );
-        while ( !s.empty() ) {
+        double nearestDistance = std::numeric_limits<T>::max();
+        std::stack<NNTree> s;
+        s.push(NNTree(0, size, 0, boundingBox));
+        while (!s.empty())
+        {
             NNTree tree = s.top();
             s.pop();
 
-            if ( distance( tree.box, point.coordinates ) >= nearestDistance )
+            if (distance(tree.box, point.coordinates) >= nearestDistance)
                 continue;
 
-            if ( tree.right - tree.left < KDTREE_BASESIZE ) {
-                for ( unsigned i = tree.left; i < tree.right; i++ ) {
-                    double newDistance = distance( kdtree[i].coordinates, point.coordinates );
-                    if ( newDistance < nearestDistance ) {
+            if (tree.right - tree.left < KDTREE_BASESIZE)
+            {
+                for (unsigned i = tree.left; i < tree.right; i++)
+                {
+                    double newDistance = distance(kdtree[i].coordinates, point.coordinates);
+                    if (newDistance < nearestDistance)
+                    {
                         nearestDistance = newDistance;
                         *result = kdtree[i];
                         found = true;
@@ -158,73 +177,84 @@ public:
                 continue;
             }
 
-            Iterator middle = tree.left + ( tree.right - tree.left ) / 2;
+            Iterator middle = tree.left + (tree.right - tree.left) / 2;
 
-            double newDistance = distance( kdtree[middle].coordinates, point.coordinates );
-            if ( newDistance < nearestDistance ) {
+            double newDistance = distance(kdtree[middle].coordinates, point.coordinates);
+            if (newDistance < nearestDistance)
+            {
                 nearestDistance = newDistance;
                 *result = kdtree[middle];
                 found = true;
             }
 
-            Less comperator( tree.dimension );
-            if ( !comperator( point, kdtree[middle] ) ) {
-                NNTree first( middle + 1, tree.right, ( tree.dimension + 1 ) % k, tree.box );
-                NNTree second( tree.left, middle, ( tree.dimension + 1 ) % k, tree.box );
+            Less comperator(tree.dimension);
+            if (!comperator(point, kdtree[middle]))
+            {
+                NNTree first(middle + 1, tree.right, (tree.dimension + 1) % k, tree.box);
+                NNTree second(tree.left, middle, (tree.dimension + 1) % k, tree.box);
                 first.box.min[tree.dimension] = kdtree[middle].coordinates[tree.dimension];
                 second.box.max[tree.dimension] = kdtree[middle].coordinates[tree.dimension];
-                s.push( second );
-                s.push( first );
+                s.push(second);
+                s.push(first);
             }
-            else {
-                NNTree first( middle + 1, tree.right, ( tree.dimension + 1 ) % k, tree.box );
-                NNTree second( tree.left, middle, ( tree.dimension + 1 ) % k, tree.box );
+            else
+            {
+                NNTree first(middle + 1, tree.right, (tree.dimension + 1) % k, tree.box);
+                NNTree second(tree.left, middle, (tree.dimension + 1) % k, tree.box);
                 first.box.min[tree.dimension] = kdtree[middle].coordinates[tree.dimension];
                 second.box.max[tree.dimension] = kdtree[middle].coordinates[tree.dimension];
-                s.push( first );
-                s.push( second );
+                s.push(first);
+                s.push(second);
             }
         }
         return found;
     }
 
-private:
+  private:
     typedef unsigned Iterator;
-    struct Tree {
+    struct Tree
+    {
         Iterator left;
         Iterator right;
         unsigned dimension;
         Tree() {}
-        Tree( Iterator l, Iterator r, unsigned d ): left( l ), right( r ), dimension( d ) {}
+        Tree(Iterator l, Iterator r, unsigned d) : left(l), right(r), dimension(d) {}
     };
-    struct NNTree {
+    struct NNTree
+    {
         Iterator left;
         Iterator right;
         unsigned dimension;
-        BoundingBox< k, T > box;
+        BoundingBox<k, T> box;
         NNTree() {}
-        NNTree( Iterator l, Iterator r, unsigned d, const BoundingBox< k, T >& b ): left( l ), right( r ), dimension( d ), box ( b ) {}
+        NNTree(Iterator l, Iterator r, unsigned d, const BoundingBox<k, T> &b)
+            : left(l), right(r), dimension(d), box(b)
+        {
+        }
     };
-    class Less {
-    public:
-        explicit Less( unsigned d ) {
+    class Less
+    {
+      public:
+        explicit Less(unsigned d)
+        {
             dimension = d;
-            BOOST_ASSERT( dimension < k );
+            BOOST_ASSERT(dimension < k);
         }
 
-        bool operator() ( const InputPoint& left, const InputPoint& right ) {
-            BOOST_ASSERT( dimension < k );
+        bool operator()(const InputPoint &left, const InputPoint &right)
+        {
+            BOOST_ASSERT(dimension < k);
             return left.coordinates[dimension] < right.coordinates[dimension];
         }
-    private:
+
+      private:
         unsigned dimension;
     };
 
-    BoundingBox< k, T > boundingBox;
-    InputPoint* kdtree;
+    BoundingBox<k, T> boundingBox;
+    InputPoint *kdtree;
     Iterator size;
 };
-
 }
 
 #endif // STATICKDTREE_H_INCLUDED

DataStructures/TurnInstructions.h

@@ -25,71 +25,66 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef TURNINSTRUCTIONS_H_
-#define TURNINSTRUCTIONS_H_
-
-#include <boost/noncopyable.hpp>
-
-typedef unsigned char TurnInstruction;
-
-//This is a hack until c++0x is available enough to use scoped enums
-struct TurnInstructionsClass : boost::noncopyable {
-
-    const static TurnInstruction NoTurn = 0;          //Give no instruction at all
-    const static TurnInstruction GoStraight = 1;      //Tell user to go straight!
-    const static TurnInstruction TurnSlightRight = 2;
-    const static TurnInstruction TurnRight = 3;
-    const static TurnInstruction TurnSharpRight = 4;
-    const static TurnInstruction UTurn = 5;
-    const static TurnInstruction TurnSharpLeft = 6;
-    const static TurnInstruction TurnLeft = 7;
-    const static TurnInstruction TurnSlightLeft = 8;
-    const static TurnInstruction ReachViaPoint = 9;
-    const static TurnInstruction HeadOn = 10;
-    const static TurnInstruction EnterRoundAbout = 11;
-    const static TurnInstruction LeaveRoundAbout = 12;
-    const static TurnInstruction StayOnRoundAbout = 13;
-    const static TurnInstruction StartAtEndOfStreet = 14;
-    const static TurnInstruction ReachedYourDestination = 15;
-    const static TurnInstruction EnterAgainstAllowedDirection = 16;
-    const static TurnInstruction LeaveAgainstAllowedDirection = 17;
-
-    const static TurnInstruction AccessRestrictionFlag = 128;
-    const static TurnInstruction InverseAccessRestrictionFlag = 0x7f; // ~128 does not work without a warning.
-
-    const static int AccessRestrictionPenalty = 1 << 15; //unrelated to the bit set in the restriction flag
-
-    static inline TurnInstruction GetTurnDirectionOfInstruction( const double angle ) {
-        if(angle >= 23 && angle < 67) {
-            return TurnSharpRight;
-        }
-        if (angle >= 67 && angle < 113) {
-            return TurnRight;
-        }
-        if (angle >= 113 && angle < 158) {
-            return TurnSlightRight;
-        }
-        if (angle >= 158 && angle < 202) {
-            return GoStraight;
-        }
-        if (angle >= 202 && angle < 248) {
-            return TurnSlightLeft;
-        }
-        if (angle >= 248 && angle < 292) {
-            return TurnLeft;
-        }
-        if (angle >= 292 && angle < 336) {
-            return TurnSharpLeft;
-        }
-        return UTurn;
-    }
-
-    static inline bool TurnIsNecessary ( const short turnInstruction ) {
-        if(NoTurn == turnInstruction || StayOnRoundAbout == turnInstruction)
-            return false;
-        return true;
-    }
+#ifndef TURN_INSTRUCTIONS_H
+#define TURN_INSTRUCTIONS_H
 
+enum class TurnInstruction : unsigned char
+{
+    NoTurn = 0, GoStraight, TurnSlightRight, TurnRight, TurnSharpRight, UTurn,
+    TurnSharpLeft, TurnLeft, TurnSlightLeft, ReachViaPoint, HeadOn, EnterRoundAbout,
+    LeaveRoundAbout, StayOnRoundAbout, StartAtEndOfStreet, ReachedYourDestination,
+    EnterAgainstAllowedDirection, LeaveAgainstAllowedDirection,
+    InverseAccessRestrictionFlag = 127,
+    AccessRestrictionFlag = 128,
+    AccessRestrictionPenalty = 129
 };
 
-#endif /* TURNINSTRUCTIONS_H_ */
+struct TurnInstructionsClass
+{
+    TurnInstructionsClass() = delete;
+    TurnInstructionsClass(const TurnInstructionsClass&) = delete;
+
+    static inline TurnInstruction GetTurnDirectionOfInstruction(const double angle)
+    {
+        if (angle >= 23 && angle < 67)
+        {
+            return TurnInstruction::TurnSharpRight;
+        }
+        if (angle >= 67 && angle < 113)
+        {
+            return TurnInstruction::TurnRight;
+        }
+        if (angle >= 113 && angle < 158)
+        {
+            return TurnInstruction::TurnSlightRight;
+        }
+        if (angle >= 158 && angle < 202)
+        {
+            return TurnInstruction::GoStraight;
+        }
+        if (angle >= 202 && angle < 248)
+        {
+            return TurnInstruction::TurnSlightLeft;
+        }
+        if (angle >= 248 && angle < 292)
+        {
+            return TurnInstruction::TurnLeft;
+        }
+        if (angle >= 292 && angle < 336)
+        {
+            return TurnInstruction::TurnSharpLeft;
+        }
+        return TurnInstruction::UTurn;
+    }
+
+    static inline bool TurnIsNecessary(const TurnInstruction turn_instruction)
+    {
+        if (TurnInstruction::NoTurn == turn_instruction || TurnInstruction::StayOnRoundAbout == turn_instruction)
+        {
+            return false;
+        }
+        return true;
+    }
+};
+
+#endif /* TURN_INSTRUCTIONS_H */

DataStructures/XORFastHash.h

@@ -25,14 +25,15 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef FASTXORHASH_H_
-#define FASTXORHASH_H_
+#ifndef XOR_FAST_HASH_H
+#define XOR_FAST_HASH_H
 
 #include <algorithm>
 #include <vector>
 
 /*
-    This is an implementation of Tabulation hashing, which has suprising properties like universality.
+    This is an implementation of Tabulation hashing, which has suprising properties like
+   universality.
     The space requirement is 2*2^16 = 256 kb of memory, which fits into L2 cache.
     Evaluation boils down to 10 or less assembly instruction on any recent X86 CPU:
 
@@ -48,49 +49,61 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     10: ret
 
 */
-class XORFastHash { //65k entries
+class XORFastHash
+{ // 65k entries
     std::vector<unsigned short> table1;
     std::vector<unsigned short> table2;
-public:
-    XORFastHash() {
+
+  public:
+    XORFastHash()
+    {
         table1.resize(2 << 16);
         table2.resize(2 << 16);
-        for(unsigned i = 0; i < (2 << 16); ++i) {
-            table1[i] = i; table2[i] = i;
+        for (unsigned i = 0; i < (2 << 16); ++i)
+        {
+            table1[i] = i;
+            table2[i] = i;
         }
         std::random_shuffle(table1.begin(), table1.end());
         std::random_shuffle(table2.begin(), table2.end());
     }
 
-    inline unsigned short operator()(const unsigned originalValue) const {
+    inline unsigned short operator()(const unsigned originalValue) const
+    {
         unsigned short lsb = ((originalValue) & 0xffff);
         unsigned short msb = (((originalValue) >> 16) & 0xffff);
         return table1[lsb] ^ table2[msb];
     }
 };
 
-class XORMiniHash { //256 entries
+class XORMiniHash
+{ // 256 entries
     std::vector<unsigned char> table1;
     std::vector<unsigned char> table2;
     std::vector<unsigned char> table3;
     std::vector<unsigned char> table4;
 
-public:
-    XORMiniHash() {
+  public:
+    XORMiniHash()
+    {
         table1.resize(1 << 8);
         table2.resize(1 << 8);
         table3.resize(1 << 8);
         table4.resize(1 << 8);
-        for(unsigned i = 0; i < (1 << 8); ++i) {
-            table1[i] = i; table2[i] = i;
-            table3[i] = i; table4[i] = i;
+        for (unsigned i = 0; i < (1 << 8); ++i)
+        {
+            table1[i] = i;
+            table2[i] = i;
+            table3[i] = i;
+            table4[i] = i;
         }
         std::random_shuffle(table1.begin(), table1.end());
         std::random_shuffle(table2.begin(), table2.end());
         std::random_shuffle(table3.begin(), table3.end());
         std::random_shuffle(table4.begin(), table4.end());
     }
-    unsigned char operator()(const unsigned originalValue) const {
+    unsigned char operator()(const unsigned originalValue) const
+    {
         unsigned char byte1 = ((originalValue) & 0xff);
         unsigned char byte2 = ((originalValue >> 8) & 0xff);
         unsigned char byte3 = ((originalValue >> 16) & 0xff);
@@ -99,4 +112,4 @@ public:
     }
 };
 
-#endif /* FASTXORHASH_H_ */
+#endif // XOR_FAST_HASH_H

DataStructures/XORFastHashStorage.h

@@ -25,63 +25,65 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef XORFASTHASHSTORAGE_H_
-#define XORFASTHASHSTORAGE_H_
+#ifndef XOR_FAST_HASH_STORAGE_H
+#define XOR_FAST_HASH_STORAGE_H
 
 #include "XORFastHash.h"
 
-#include <climits>
+#include <limits>
 #include <vector>
-#include <bitset>
 
-template< typename NodeID, typename Key >
-class XORFastHashStorage {
-public:
-    struct HashCell{
+template <typename NodeID, typename Key> class XORFastHashStorage
+{
+  public:
+    struct HashCell
+    {
         Key key;
         NodeID id;
         unsigned time;
-        HashCell() : key(UINT_MAX), id(UINT_MAX), time(UINT_MAX) {}
-
-        HashCell(const HashCell & other) : key(other.key), id(other.id), time(other.time) { }
-
-        inline operator Key() const {
-            return key;
+        HashCell()
+            : key(std::numeric_limits<unsigned>::max()), id(std::numeric_limits<unsigned>::max()),
+              time(std::numeric_limits<unsigned>::max())
+        {
         }
 
-        inline void operator=(const Key & keyToInsert) {
-            key = keyToInsert;
-        }
+        HashCell(const HashCell &other) : key(other.key), id(other.id), time(other.time) {}
+
+        inline operator Key() const { return key; }
+
+        inline void operator=(const Key &key_to_insert) { key = key_to_insert; }
     };
 
-    explicit XORFastHashStorage( size_t ) : positions(2<<16), currentTimestamp(0) { }
+    explicit XORFastHashStorage(size_t) : positions(2 << 16), current_timestamp(0) {}
 
-    inline HashCell& operator[]( const NodeID node ) {
-        unsigned short position = fastHash(node);
-        while((positions[position].time == currentTimestamp) && (positions[position].id != node)){
-            ++position %= (2<<16);
+    inline HashCell &operator[](const NodeID node)
+    {
+        unsigned short position = fast_hasher(node);
+        while ((positions[position].time == current_timestamp) && (positions[position].id != node))
+        {
+            ++position %= (2 << 16);
         }
 
         positions[position].id = node;
-        positions[position].time = currentTimestamp;
+        positions[position].time = current_timestamp;
         return positions[position];
     }
 
-    inline void Clear() {
-        ++currentTimestamp;
-        if(UINT_MAX == currentTimestamp) {
+    inline void Clear()
+    {
+        ++current_timestamp;
+        if (std::numeric_limits<unsigned>::max() == current_timestamp)
+        {
             positions.clear();
-            positions.resize((2<<16));
+            positions.resize((2 << 16));
         }
     }
 
-private:
-    XORFastHashStorage() : positions(2<<16), currentTimestamp(0) {}
+  private:
+    XORFastHashStorage() : positions(2 << 16), current_timestamp(0) {}
     std::vector<HashCell> positions;
-    XORFastHash fastHash;
-    unsigned currentTimestamp;
+    XORFastHash fast_hasher;
+    unsigned current_timestamp;
 };
 
-
-#endif /* XORFASTHASHSTORAGE_H_ */
-
+#endif // XOR_FAST_HASH_STORAGE_H

Descriptors/BaseDescriptor.h

@@ -25,8 +25,8 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef BASE_DESCRIPTOR_H_
-#define BASE_DESCRIPTOR_H_
+#ifndef BASE_DESCRIPTOR_H
+#define BASE_DESCRIPTOR_H
 
 #include "../DataStructures/PhantomNodes.h"
 #include "../DataStructures/RawRouteData.h"
@@ -37,32 +37,27 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <string>
 #include <vector>
 
-struct DescriptorConfig {
-    DescriptorConfig() :
-        instructions(true),
-        geometry(true),
-        encode_geometry(true),
-        zoom_level(18)
-    { }
+struct DescriptorConfig
+{
+    DescriptorConfig() : instructions(true), geometry(true), encode_geometry(true), zoom_level(18)
+    {
+    }
     bool instructions;
     bool geometry;
     bool encode_geometry;
     unsigned short zoom_level;
 };
 
-template<class DataFacadeT>
-class BaseDescriptor {
-public:
-    BaseDescriptor() { }
-    //Maybe someone can explain the pure virtual destructor thing to me (dennis)
-    virtual ~BaseDescriptor() { }
-    virtual void Run(
-        const RawRouteData & rawRoute,
-        const PhantomNodes & phantomNodes,
-        DataFacadeT * facade,
-        http::Reply & reply
-    ) = 0;
-    virtual void SetConfig(const DescriptorConfig & config) = 0;
+template <class DataFacadeT> class BaseDescriptor
+{
+  public:
+    BaseDescriptor() {}
+    // Maybe someone can explain the pure virtual destructor thing to me (dennis)
+    virtual ~BaseDescriptor() {}
+    virtual void Run(const RawRouteData &raw_route,
+                     const PhantomNodes &phantom_nodes,
+                     http::Reply &reply) = 0;
+    virtual void SetConfig(const DescriptorConfig &config) = 0;
 };
 
-#endif /* BASE_DESCRIPTOR_H_ */
+#endif // BASE_DESCRIPTOR_H

Descriptors/DescriptionFactory.cpp

@@ -27,114 +27,54 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "DescriptionFactory.h"
 
-DescriptionFactory::DescriptionFactory() : entireLength(0) { }
+DescriptionFactory::DescriptionFactory() : entireLength(0) {}
 
-DescriptionFactory::~DescriptionFactory() { }
-
-inline double DescriptionFactory::DegreeToRadian(const double degree) const
-{
-    return degree * (M_PI/180.);
-}
-
-inline double DescriptionFactory::RadianToDegree(const double radian) const
-{
-    return radian * (180./M_PI);
-}
-
-double DescriptionFactory::GetBearing(const FixedPointCoordinate & A, const FixedPointCoordinate & B) const
-{
-    double delta_long = DegreeToRadian(B.lon/COORDINATE_PRECISION - A.lon/COORDINATE_PRECISION);
-
-    const double lat1 = DegreeToRadian(A.lat/COORDINATE_PRECISION);
-    const double lat2 = DegreeToRadian(B.lat/COORDINATE_PRECISION);
-
-    const double y = sin(delta_long) * cos(lat2);
-    const double x = cos(lat1) * sin(lat2) - sin(lat1) * cos(lat2) * cos(delta_long);
-    double result = RadianToDegree(atan2(y, x));
-    while (result < 0.)
-    {
-        result += 360.;
-    }
-
-    while (result >= 360.)
-    {
-        result -= 360.;
-    }
-    return result;
-}
-
-void DescriptionFactory::SetStartSegment(const PhantomNode & source, const bool source_traversed_in_reverse)
+void DescriptionFactory::SetStartSegment(const PhantomNode &source)
 {
     start_phantom = source;
-    AppendSegment(
-        source.location,
-        PathData(0, source.name_id, 10, source.forward_weight)
-    );
+    AppendSegment(source.location, PathData(0, source.name_id, TurnInstruction::HeadOn, source.forward_weight));
 }
 
-void DescriptionFactory::SetEndSegment(const PhantomNode & target, const bool target_traversed_in_reverse)
+void DescriptionFactory::SetEndSegment(const PhantomNode &target)
 {
     target_phantom = target;
-    pathDescription.push_back(
-        SegmentInformation(
-            target.location,
-            target.name_id,
-            0,
-            target.reverse_weight,
-            0,
-            true
-        )
-    );
+    path_description.emplace_back(
+        target.location, target.name_id, 0, target.reverse_weight, TurnInstruction::NoTurn, true);
 }
 
-void DescriptionFactory::AppendSegment(const FixedPointCoordinate & coordinate, const PathData & path_point)
+void DescriptionFactory::AppendSegment(const FixedPointCoordinate &coordinate,
+                                       const PathData &path_point)
 {
-    if ((1 == pathDescription.size()) && ( pathDescription.back().location == coordinate))
+    if ((1 == path_description.size()) && (path_description.back().location == coordinate))
     {
-        pathDescription.back().name_id = path_point.name_id;
+        path_description.back().name_id = path_point.name_id;
+        return;
     }
-    else
+
+    path_description.emplace_back(coordinate,
+                                  path_point.name_id,
+                                  path_point.segment_duration,
+                                  0,
+                                  path_point.turn_instruction);
+}
+
+JSON::Value DescriptionFactory::AppendEncodedPolylineString(const bool return_encoded)
+{
+    if (return_encoded)
     {
-        pathDescription.push_back(
-            SegmentInformation(coordinate, path_point.name_id, path_point.durationOfSegment, 0, path_point.turnInstruction)
-        );
+        return polyline_compressor.printEncodedString(path_description);
     }
+    return polyline_compressor.printUnencodedString(path_description);
 }
 
-void DescriptionFactory::AppendEncodedPolylineString(
-    const bool return_encoded,
-    std::vector<std::string> & output
-) {
-    std::string temp;
-    if(return_encoded) {
-        polyline_compressor.printEncodedString(pathDescription, temp);
-    } else {
-        polyline_compressor.printUnencodedString(pathDescription, temp);
-    }
-    output.push_back(temp);
+JSON::Value DescriptionFactory::AppendUnencodedPolylineString() const
+{
+    return polyline_compressor.printUnencodedString(path_description);
 }
 
-void DescriptionFactory::AppendEncodedPolylineString(
-    std::vector<std::string> &output
-) const {
-    std::string temp;
-    polyline_compressor.printEncodedString(pathDescription, temp);
-    output.push_back(temp);
-}
-
-void DescriptionFactory::AppendUnencodedPolylineString(
-    std::vector<std::string>& output
-) const {
-    std::string temp;
-    polyline_compressor.printUnencodedString(pathDescription, temp);
-    output.push_back(temp);
-}
-
-void DescriptionFactory::BuildRouteSummary(
-    const double distance,
-    const unsigned time
-) {
-    summary.startName = start_phantom.name_id;
-    summary.destName = target_phantom.name_id;
+void DescriptionFactory::BuildRouteSummary(const double distance, const unsigned time)
+{
+    summary.source_name_id = start_phantom.name_id;
+    summary.target_name_id = target_phantom.name_id;
     summary.BuildDurationAndLengthStrings(distance, time);
 }

Descriptors/DescriptionFactory.h

@@ -45,71 +45,59 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 /* This class is fed with all way segments in consecutive order
  *  and produces the description plus the encoded polyline */
 
-class DescriptionFactory {
+class DescriptionFactory
+{
     DouglasPeucker polyline_generalizer;
     PolylineCompressor polyline_compressor;
     PhantomNode start_phantom, target_phantom;
 
     double DegreeToRadian(const double degree) const;
     double RadianToDegree(const double degree) const;
-public:
-    struct RouteSummary {
-        std::string lengthString;
-        std::string durationString;
-        unsigned startName;
-        unsigned destName;
-        RouteSummary() :
-            lengthString("0"),
-            durationString("0"),
-            startName(0),
-            destName(0)
-        {}
 
-        void BuildDurationAndLengthStrings(
-            const double distance,
-            const unsigned time
-        ) {
-            //compute distance/duration for route summary
-            intToString(round(distance), lengthString);
-            int travel_time = round(time/10.);
-            intToString(std::max(travel_time, 1), durationString);
+  public:
+    struct RouteSummary
+    {
+        unsigned distance;
+        EdgeWeight duration;
+        unsigned source_name_id;
+        unsigned target_name_id;
+        RouteSummary() : distance(0), duration(0), source_name_id(0), target_name_id(0) {}
+
+        void BuildDurationAndLengthStrings(const double raw_distance, const unsigned raw_duration)
+        {
+            // compute distance/duration for route summary
+            distance = round(raw_distance);
+            duration = round(raw_duration / 10.);
         }
     } summary;
 
     double entireLength;
 
-    //I know, declaring this public is considered bad. I'm lazy
-    std::vector <SegmentInformation> pathDescription;
+    // I know, declaring this public is considered bad. I'm lazy
+    std::vector<SegmentInformation> path_description;
     DescriptionFactory();
-    virtual ~DescriptionFactory();
-    double GetBearing(const FixedPointCoordinate& C, const FixedPointCoordinate& B) const;
-    void AppendEncodedPolylineString(std::vector<std::string> &output) const;
-    void AppendUnencodedPolylineString(std::vector<std::string> &output) const;
-    void AppendSegment(const FixedPointCoordinate & coordinate, const PathData & data);
+    JSON::Value AppendUnencodedPolylineString() const;
+    void AppendSegment(const FixedPointCoordinate &coordinate, const PathData &data);
     void BuildRouteSummary(const double distance, const unsigned time);
-    void SetStartSegment(const PhantomNode & start_phantom, const bool source_traversed_in_reverse);
-    void SetEndSegment(const PhantomNode & start_phantom, const bool target_traversed_in_reverse);
-    void AppendEncodedPolylineString(
-        const bool return_encoded,
-        std::vector<std::string> & output
-    );
+    void SetStartSegment(const PhantomNode &start_phantom);
+    void SetEndSegment(const PhantomNode &start_phantom);
+    JSON::Value AppendEncodedPolylineString(const bool return_encoded);
 
-    template<class DataFacadeT>
-    void Run(
-        const DataFacadeT * facade,
-        const unsigned zoomLevel
-    ) {
-        if( pathDescription.empty() ) {
+    template <class DataFacadeT> void Run(const DataFacadeT *facade, const unsigned zoomLevel)
+    {
+        if (path_description.empty())
+        {
             return;
         }
 
         /** starts at index 1 */
-        pathDescription[0].length = 0;
-        for (unsigned i = 1; i < pathDescription.size(); ++i)
+        path_description[0].length = 0;
+        for (unsigned i = 1; i < path_description.size(); ++i)
         {
-            //move down names by one, q&d hack
-            pathDescription[i-1].name_id = pathDescription[i].name_id;
-            pathDescription[i].length = FixedPointCoordinate::ApproximateEuclideanDistance(pathDescription[i-1].location, pathDescription[i].location);
+            // move down names by one, q&d hack
+            path_description[i - 1].name_id = path_description[i].name_id;
+            path_description[i].length = FixedPointCoordinate::ApproximateEuclideanDistance(
+                path_description[i - 1].location, path_description[i].location);
         }
 
         /*Simplify turn instructions
@@ -121,84 +109,93 @@ public:
         becomes:
         10. Turn left on B 36 for 35 km
         */
-    //TODO: rework to check only end and start of string.
-    //      stl string is way to expensive
+        // TODO: rework to check only end and start of string.
+        //      stl string is way to expensive
 
-    //    unsigned lastTurn = 0;
-    //    for(unsigned i = 1; i < pathDescription.size(); ++i) {
-    //        string1 = sEngine.GetEscapedNameForNameID(pathDescription[i].name_id);
-    //        if(TurnInstructionsClass::GoStraight == pathDescription[i].turn_instruction) {
-    //            if(std::string::npos != string0.find(string1+";")
-    //                  || std::string::npos != string0.find(";"+string1)
-    //                  || std::string::npos != string0.find(string1+" ;")
-    //                    || std::string::npos != string0.find("; "+string1)
-    //                    ){
-    //                SimpleLogger().Write() << "->next correct: " << string0 << " contains " << string1;
-    //                for(; lastTurn != i; ++lastTurn)
-    //                    pathDescription[lastTurn].name_id = pathDescription[i].name_id;
-    //                pathDescription[i].turn_instruction = TurnInstructionsClass::NoTurn;
-    //            } else if(std::string::npos != string1.find(string0+";")
-    //                  || std::string::npos != string1.find(";"+string0)
-    //                    || std::string::npos != string1.find(string0+" ;")
-    //                    || std::string::npos != string1.find("; "+string0)
-    //                    ){
-    //                SimpleLogger().Write() << "->prev correct: " << string1 << " contains " << string0;
-    //                pathDescription[i].name_id = pathDescription[i-1].name_id;
-    //                pathDescription[i].turn_instruction = TurnInstructionsClass::NoTurn;
-    //            }
-    //        }
-    //        if (TurnInstructionsClass::NoTurn != pathDescription[i].turn_instruction) {
-    //            lastTurn = i;
-    //        }
-    //        string0 = string1;
-    //    }
+        //    unsigned lastTurn = 0;
+        //    for(unsigned i = 1; i < path_description.size(); ++i) {
+        //        string1 = sEngine.GetEscapedNameForNameID(path_description[i].name_id);
+        //        if(TurnInstruction::GoStraight == path_description[i].turn_instruction) {
+        //            if(std::string::npos != string0.find(string1+";")
+        //                  || std::string::npos != string0.find(";"+string1)
+        //                  || std::string::npos != string0.find(string1+" ;")
+        //                    || std::string::npos != string0.find("; "+string1)
+        //                    ){
+        //                SimpleLogger().Write() << "->next correct: " << string0 << " contains " <<
+        //                string1;
+        //                for(; lastTurn != i; ++lastTurn)
+        //                    path_description[lastTurn].name_id = path_description[i].name_id;
+        //                path_description[i].turn_instruction = TurnInstruction::NoTurn;
+        //            } else if(std::string::npos != string1.find(string0+";")
+        //                  || std::string::npos != string1.find(";"+string0)
+        //                    || std::string::npos != string1.find(string0+" ;")
+        //                    || std::string::npos != string1.find("; "+string0)
+        //                    ){
+        //                SimpleLogger().Write() << "->prev correct: " << string1 << " contains " <<
+        //                string0;
+        //                path_description[i].name_id = path_description[i-1].name_id;
+        //                path_description[i].turn_instruction = TurnInstruction::NoTurn;
+        //            }
+        //        }
+        //        if (TurnInstruction::NoTurn != path_description[i].turn_instruction) {
+        //            lastTurn = i;
+        //        }
+        //        string0 = string1;
+        //    }
 
         double segment_length = 0.;
         unsigned segment_duration = 0;
         unsigned segment_start_index = 0;
 
-        for(unsigned i = 1; i < pathDescription.size(); ++i) {
-            entireLength += pathDescription[i].length;
-            segment_length += pathDescription[i].length;
-            segment_duration += pathDescription[i].duration;
-            pathDescription[segment_start_index].length = segment_length;
-            pathDescription[segment_start_index].duration = segment_duration;
+        for (unsigned i = 1; i < path_description.size(); ++i)
+        {
+            entireLength += path_description[i].length;
+            segment_length += path_description[i].length;
+            segment_duration += path_description[i].duration;
+            path_description[segment_start_index].length = segment_length;
+            path_description[segment_start_index].duration = segment_duration;
 
-
-            if(TurnInstructionsClass::NoTurn != pathDescription[i].turn_instruction) {
-                BOOST_ASSERT(pathDescription[i].necessary);
+            if (TurnInstruction::NoTurn != path_description[i].turn_instruction)
+            {
+                BOOST_ASSERT(path_description[i].necessary);
                 segment_length = 0;
                 segment_duration = 0;
                 segment_start_index = i;
             }
         }
 
-        //Post-processing to remove empty or nearly empty path segments
-        if(std::numeric_limits<double>::epsilon() > pathDescription.back().length) {
-            if(pathDescription.size() > 2){
-                pathDescription.pop_back();
-                pathDescription.back().necessary = true;
-                pathDescription.back().turn_instruction = TurnInstructionsClass::NoTurn;
-                target_phantom.name_id = (pathDescription.end()-2)->name_id;
+        // Post-processing to remove empty or nearly empty path segments
+        if (std::numeric_limits<double>::epsilon() > path_description.back().length)
+        {
+            if (path_description.size() > 2)
+            {
+                path_description.pop_back();
+                path_description.back().necessary = true;
+                path_description.back().turn_instruction = TurnInstruction::NoTurn;
+                target_phantom.name_id = (path_description.end() - 2)->name_id;
             }
         }
-        if(std::numeric_limits<double>::epsilon() > pathDescription[0].length) {
-            if(pathDescription.size() > 2) {
-                pathDescription.erase(pathDescription.begin());
-                pathDescription[0].turn_instruction = TurnInstructionsClass::HeadOn;
-                pathDescription[0].necessary = true;
-                start_phantom.name_id = pathDescription[0].name_id;
+        if (std::numeric_limits<double>::epsilon() > path_description.front().length)
+        {
+            if (path_description.size() > 2)
+            {
+                path_description.erase(path_description.begin());
+                path_description.front().turn_instruction = TurnInstruction::HeadOn;
+                path_description.front().necessary = true;
+                start_phantom.name_id = path_description.front().name_id;
             }
         }
 
-        //Generalize poly line
-        polyline_generalizer.Run(pathDescription, zoomLevel);
+        // Generalize poly line
+        polyline_generalizer.Run(path_description, zoomLevel);
 
-        //fix what needs to be fixed else
-        for(unsigned i = 0; i < pathDescription.size()-1 && pathDescription.size() >= 2; ++i){
-            if(pathDescription[i].necessary) {
-                double angle = GetBearing(pathDescription[i].location, pathDescription[i+1].location);
-                pathDescription[i].bearing = angle*10;
+        // fix what needs to be fixed else
+        for (unsigned i = 0; i < path_description.size() - 1 && path_description.size() >= 2; ++i)
+        {
+            if (path_description[i].necessary)
+            {
+                const double angle = path_description[i+1].location.GetBearing(path_description[i].location);
+                path_description[i].bearing = angle * 10;
             }
         }
         return;

Descriptors/GPXDescriptor.h

@@ -25,82 +25,78 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef GPX_DESCRIPTOR_H_
-#define GPX_DESCRIPTOR_H_
+#ifndef GPX_DESCRIPTOR_H
+#define GPX_DESCRIPTOR_H
 
 #include "BaseDescriptor.h"
 
-#include <boost/foreach.hpp>
-
-template<class DataFacadeT>
-class GPXDescriptor : public BaseDescriptor<DataFacadeT> {
-private:
+template <class DataFacadeT> class GPXDescriptor : public BaseDescriptor<DataFacadeT>
+{
+  private:
     DescriptorConfig config;
     FixedPointCoordinate current;
+    DataFacadeT * facade;
 
-    std::string tmp;
-public:
-    void SetConfig(const DescriptorConfig & c) { config = c; }
+    void AddRoutePoint(const FixedPointCoordinate & coordinate, std::vector<char> & output)
+    {
+        const std::string route_point_head = "<rtept lat=\"";
+        const std::string route_point_middle = " lon=\"";
+        const std::string route_point_tail = "\"></rtept>";
 
-    //TODO: reorder parameters
-    void Run(
-        const RawRouteData &raw_route,
-        const PhantomNodes &phantom_node_list,
-        DataFacadeT * facade,
-        http::Reply & reply
-    ) {
-        reply.content.push_back("<?xml version=\"1.0\" encoding=\"UTF-8\"?>");
-        reply.content.push_back(
-                "<gpx creator=\"OSRM Routing Engine\" version=\"1.1\" "
-                "xmlns=\"http://www.topografix.com/GPX/1/1\" "
-                "xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" "
-                "xsi:schemaLocation=\"http://www.topografix.com/GPX/1/1 gpx.xsd"
-                "\">");
-        reply.content.push_back(
-                "<metadata><copyright author=\"Project OSRM\"><license>Data (c)"
-                " OpenStreetMap contributors (ODbL)</license></copyright>"
-                "</metadata>");
-        reply.content.push_back("<rte>");
-        bool found_route =  (raw_route.lengthOfShortestPath != INT_MAX) &&
-                            (raw_route.unpacked_path_segments[0].size());
-        if( found_route ) {
-            FixedPointCoordinate::convertInternalLatLonToString(
-                phantom_node_list.source_phantom.location.lat,
-                tmp
-            );
-            reply.content.push_back("<rtept lat=\"" + tmp + "\" ");
-            FixedPointCoordinate::convertInternalLatLonToString(
-                phantom_node_list.source_phantom.location.lon,
-                tmp
-            );
-            reply.content.push_back("lon=\"" + tmp + "\"></rtept>");
+        std::string tmp;
 
-            for(unsigned i=0; i < raw_route.unpacked_path_segments.size(); ++i){
-                BOOST_FOREACH(
-                    const PathData & pathData,
-                    raw_route.unpacked_path_segments[i]
-                ) {
-                    current = facade->GetCoordinateOfNode(pathData.node);
+        FixedPointCoordinate::convertInternalLatLonToString(coordinate.lat, tmp);
+        output.insert(output.end(), route_point_head.begin(), route_point_head.end());
+        output.insert(output.end(), tmp.begin(), tmp.end());
+        output.push_back('\"');
 
-                    FixedPointCoordinate::convertInternalLatLonToString(current.lat, tmp);
-                    reply.content.push_back("<rtept lat=\"" + tmp + "\" ");
-                    FixedPointCoordinate::convertInternalLatLonToString(current.lon, tmp);
-                    reply.content.push_back("lon=\"" + tmp + "\"></rtept>");
+        FixedPointCoordinate::convertInternalLatLonToString(coordinate.lon, tmp);
+        output.insert(output.end(), route_point_middle.begin(), route_point_middle.end());
+        output.insert(output.end(), tmp.begin(), tmp.end());
+        output.insert(output.end(), route_point_tail.begin(), route_point_tail.end());
+    }
+
+  public:
+    GPXDescriptor(DataFacadeT *facade) : facade(facade) {}
+
+    void SetConfig(const DescriptorConfig &c) { config = c; }
+
+    // TODO: reorder parameters
+    void Run(const RawRouteData &raw_route,
+             const PhantomNodes &phantom_node_list,
+             http::Reply &reply)
+    {
+        std::string header("<?xml version=\"1.0\" encoding=\"UTF-8\"?>"
+                           "<gpx creator=\"OSRM Routing Engine\" version=\"1.1\" "
+                           "xmlns=\"http://www.topografix.com/GPX/1/1\" "
+                           "xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" "
+                           "xsi:schemaLocation=\"http://www.topografix.com/GPX/1/1 gpx.xsd"
+                           "\">"
+                           "<metadata><copyright author=\"Project OSRM\"><license>Data (c)"
+                           " OpenStreetMap contributors (ODbL)</license></copyright>"
+                           "</metadata>"
+                           "<rte>");
+        reply.content.insert(reply.content.end(), header.begin(), header.end());
+        const bool found_route = (raw_route.shortest_path_length != INVALID_EDGE_WEIGHT) &&
+                                 (!raw_route.unpacked_path_segments.front().empty());
+        if (found_route)
+        {
+            AddRoutePoint(phantom_node_list.source_phantom.location, reply.content);
+
+            for (const std::vector<PathData> &path_data_vector : raw_route.unpacked_path_segments)
+            {
+                for (const PathData &path_data : path_data_vector)
+                {
+                    const FixedPointCoordinate current_coordinate =
+                        facade->GetCoordinateOfNode(path_data.node);
+                    AddRoutePoint(current_coordinate, reply.content);
                 }
             }
-            // Add the via point or the end coordinate
-            FixedPointCoordinate::convertInternalLatLonToString(
-                phantom_node_list.target_phantom.location.lat,
-                tmp
-            );
-            reply.content.push_back("<rtept lat=\"" + tmp + "\" ");
-            FixedPointCoordinate::convertInternalLatLonToString(
-                phantom_node_list.target_phantom.location.lon,
-                tmp
-            );
-            reply.content.push_back("lon=\"" + tmp + "\"></rtept>");
+            AddRoutePoint(phantom_node_list.target_phantom.location, reply.content);
+
         }
-        reply.content.push_back("</rte></gpx>");
+        std::string footer("</rte></gpx>");
+        reply.content.insert(reply.content.end(), footer.begin(), footer.end());
     }
 };
-#endif // GPX_DESCRIPTOR_H_
+#endif // GPX_DESCRIPTOR_H

Descriptors/JSONDescriptor.h

@@ -1,542 +1,356 @@
-/*
-
-Copyright (c) 2013, Project OSRM, Dennis Luxen, others
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification,
-are permitted provided that the following conditions are met:
-
-Redistributions of source code must retain the above copyright notice, this list
-of conditions and the following disclaimer.
-Redistributions in binary form must reproduce the above copyright notice, this
-list of conditions and the following disclaimer in the documentation and/or
-other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-*/
-
-#ifndef JSON_DESCRIPTOR_H_
-#define JSON_DESCRIPTOR_H_
-
-#include "BaseDescriptor.h"
-#include "DescriptionFactory.h"
-#include "../Algorithms/ObjectToBase64.h"
-#include "../DataStructures/SegmentInformation.h"
-#include "../DataStructures/TurnInstructions.h"
-#include "../Util/Azimuth.h"
-#include "../Util/StringUtil.h"
-
-#include <boost/bind.hpp>
-#include <boost/lambda/lambda.hpp>
-
-#include <algorithm>
-
-template<class DataFacadeT>
-class JSONDescriptor : public BaseDescriptor<DataFacadeT> {
-private:
-    // TODO: initalize in c'tor
-    DataFacadeT * facade;
-    DescriptorConfig config;
-    DescriptionFactory description_factory;
-    DescriptionFactory alternate_descriptionFactory;
-    FixedPointCoordinate current;
-    unsigned entered_restricted_area_count;
-    struct RoundAbout{
-        RoundAbout() :
-            start_index(INT_MAX),
-            name_id(INT_MAX),
-            leave_at_exit(INT_MAX)
-        {}
-        int start_index;
-        int name_id;
-        int leave_at_exit;
-    } round_about;
-
-    struct Segment {
-        Segment() : name_id(-1), length(-1), position(-1) {}
-        Segment(int n, int l, int p) : name_id(n), length(l), position(p) {}
-        int name_id;
-        int length;
-        int position;
-    };
-    std::vector<Segment> shortest_path_segments, alternative_path_segments;
-    std::vector<unsigned> shortest_leg_end_indices, alternative_leg_end_indices;
-
-    struct RouteNames {
-        std::string shortestPathName1;
-        std::string shortestPathName2;
-        std::string alternativePathName1;
-        std::string alternativePathName2;
-    };
-
-public:
-    JSONDescriptor() :
-        facade(NULL),
-        entered_restricted_area_count(0)
-    {
-        shortest_leg_end_indices.push_back(0);
-        alternative_leg_end_indices.push_back(0);
-    }
-
-    void SetConfig(const DescriptorConfig & c) { config = c; }
-
-    int DescribeLeg(
-        const std::vector<PathData> route_leg,
-        const PhantomNodes & leg_phantoms
-    ) {
-        int added_element_count = 0;
-        //Get all the coordinates for the computed route
-        FixedPointCoordinate current_coordinate;
-        BOOST_FOREACH(const PathData & path_data, route_leg) {
-            current_coordinate = facade->GetCoordinateOfNode(path_data.node);
-            description_factory.AppendSegment(current_coordinate, path_data);
-            ++added_element_count;
-        }
-        // description_factory.SetEndSegment( leg_phantoms.target_phantom );
-        ++added_element_count;
-        BOOST_ASSERT( (int)(route_leg.size() + 1) == added_element_count );
-        return added_element_count;
-    }
-
-    void Run(
-        const RawRouteData & raw_route,
-        const PhantomNodes & phantom_nodes,
-        // TODO: move facade initalization to c'tor
-        DataFacadeT * f,
-        http::Reply & reply
-    ) {
-        facade = f;
-        reply.content.push_back(
-            "{\"status\":"
-        );
-
-        if (INVALID_EDGE_WEIGHT == raw_route.lengthOfShortestPath)
-        {
-            //We do not need to do much, if there is no route ;-)
-            reply.content.push_back(
-                "207,\"status_message\": \"Cannot find route between points\"}"
-            );
-            return;
-        }
-
-        SimpleLogger().Write(logDEBUG) << "distance: " << raw_route.lengthOfShortestPath;
-
-        //check if first segment is non-zero
-        std::string road_name;
-        road_name = facade->GetEscapedNameForNameID(phantom_nodes.source_phantom.name_id);
-
-        // for each unpacked segment add the leg to the description
-        BOOST_ASSERT( raw_route.unpacked_path_segments.size() == raw_route.segmentEndCoordinates.size() );
-
-        for (unsigned i = 0; i < raw_route.unpacked_path_segments.size(); ++i)
-        {
-            const std::vector<PathData> & leg_path = raw_route.unpacked_path_segments[i];
-            FixedPointCoordinate current_coordinate;
-            BOOST_FOREACH(const PathData & path_data, leg_path)
-            {
-                current_coordinate = facade->GetCoordinateOfNode(path_data.node);
-                road_name = facade->GetEscapedNameForNameID(path_data.name_id);
-            }
-        }
-
-        //check if last segment is non-zero
-        road_name = facade->GetEscapedNameForNameID(phantom_nodes.target_phantom.name_id);
-
-        description_factory.SetStartSegment(phantom_nodes.source_phantom, raw_route.source_traversed_in_reverse);
-        reply.content.push_back("0,"
-                "\"status_message\": \"Found route between points\",");
-
-        BOOST_ASSERT( raw_route.unpacked_path_segments.size() == raw_route.segmentEndCoordinates.size() );
-        for (unsigned i = 0; i < raw_route.unpacked_path_segments.size(); ++i)
-        {
-            const int added_segments = DescribeLeg(
-                raw_route.unpacked_path_segments[i],
-                raw_route.segmentEndCoordinates[i]
-            );
-            BOOST_ASSERT( 0 < added_segments );
-            shortest_leg_end_indices.push_back(
-                added_segments + shortest_leg_end_indices.back()
-            );
-        }
-        description_factory.SetEndSegment(phantom_nodes.target_phantom, raw_route.target_traversed_in_reverse);
-        description_factory.Run(facade, config.zoom_level);
-
-        reply.content.push_back("\"route_geometry\": ");
-        if(config.geometry) {
-            description_factory.AppendEncodedPolylineString(
-               config.encode_geometry,
-               reply.content
-            );
-        } else {
-            reply.content.push_back("[]");
-        }
-
-        reply.content.push_back(",\"route_instructions\": [");
-        if(config.instructions) {
-            BuildTextualDescription(
-                description_factory,
-                reply,
-                raw_route.lengthOfShortestPath,
-                facade,
-                shortest_path_segments
-            );
-        }
-        reply.content.push_back("],");
-        description_factory.BuildRouteSummary(
-            description_factory.entireLength,
-            raw_route.lengthOfShortestPath
-        );
-
-        reply.content.push_back("\"route_summary\":");
-        reply.content.push_back("{");
-        reply.content.push_back("\"total_distance\":");
-        reply.content.push_back(description_factory.summary.lengthString);
-        reply.content.push_back(","
-                "\"total_time\":");
-        reply.content.push_back(description_factory.summary.durationString);
-        reply.content.push_back(","
-                "\"start_point\":\"");
-        reply.content.push_back(
-            facade->GetEscapedNameForNameID(description_factory.summary.startName)
-        );
-        reply.content.push_back("\","
-                "\"end_point\":\"");
-        reply.content.push_back(
-            facade->GetEscapedNameForNameID(description_factory.summary.destName)
-        );
-        reply.content.push_back("\"");
-        reply.content.push_back("}");
-        reply.content.push_back(",");
-
-        //only one alternative route is computed at this time, so this is hardcoded
-
-        if(raw_route.lengthOfAlternativePath != INVALID_EDGE_WEIGHT)
-        {
-            alternate_descriptionFactory.SetStartSegment(phantom_nodes.source_phantom, raw_route.alt_source_traversed_in_reverse);
-            //Get all the coordinates for the computed route
-            BOOST_FOREACH(const PathData & path_data, raw_route.unpacked_alternative) {
-                current = facade->GetCoordinateOfNode(path_data.node);
-                alternate_descriptionFactory.AppendSegment(current, path_data );
-            }
-            alternate_descriptionFactory.SetEndSegment(phantom_nodes.target_phantom, raw_route.alt_target_traversed_in_reverse);
-        }
-        alternate_descriptionFactory.Run(facade, config.zoom_level);
-
-        // //give an array of alternative routes
-        reply.content.push_back("\"alternative_geometries\": [");
-        if(config.geometry && INT_MAX != raw_route.lengthOfAlternativePath) {
-            //Generate the linestrings for each alternative
-            alternate_descriptionFactory.AppendEncodedPolylineString(
-                config.encode_geometry,
-                reply.content
-            );
-        }
-        reply.content.push_back("],");
-        reply.content.push_back("\"alternative_instructions\":[");
-        if(INT_MAX != raw_route.lengthOfAlternativePath) {
-            reply.content.push_back("[");
-            //Generate instructions for each alternative
-            if(config.instructions) {
-                BuildTextualDescription(
-                    alternate_descriptionFactory,
-                    reply,
-                    raw_route.lengthOfAlternativePath,
-                    facade,
-                    alternative_path_segments
-                );
-            }
-            reply.content.push_back("]");
-        }
-        reply.content.push_back("],");
-        reply.content.push_back("\"alternative_summaries\":[");
-        if(INT_MAX != raw_route.lengthOfAlternativePath) {
-            //Generate route summary (length, duration) for each alternative
-            alternate_descriptionFactory.BuildRouteSummary(
-                alternate_descriptionFactory.entireLength,
-                raw_route.lengthOfAlternativePath
-            );
-            reply.content.push_back("{");
-            reply.content.push_back("\"total_distance\":");
-            reply.content.push_back(
-                alternate_descriptionFactory.summary.lengthString
-            );
-            reply.content.push_back(","
-                    "\"total_time\":");
-            reply.content.push_back(
-                alternate_descriptionFactory.summary.durationString
-            );
-            reply.content.push_back(","
-                    "\"start_point\":\"");
-            reply.content.push_back(
-                facade->GetEscapedNameForNameID(
-                    description_factory.summary.startName
-                )
-            );
-            reply.content.push_back("\","
-                    "\"end_point\":\"");
-            reply.content.push_back(facade->GetEscapedNameForNameID(description_factory.summary.destName));
-            reply.content.push_back("\"");
-            reply.content.push_back("}");
-        }
-        reply.content.push_back("],");
-
-        // //Get Names for both routes
-        RouteNames routeNames;
-        GetRouteNames(shortest_path_segments, alternative_path_segments, facade, routeNames);
-
-        reply.content.push_back("\"route_name\":[\"");
-        reply.content.push_back(routeNames.shortestPathName1);
-        reply.content.push_back("\",\"");
-        reply.content.push_back(routeNames.shortestPathName2);
-        reply.content.push_back("\"],"
-                "\"alternative_names\":[");
-        reply.content.push_back("[\"");
-        reply.content.push_back(routeNames.alternativePathName1);
-        reply.content.push_back("\",\"");
-        reply.content.push_back(routeNames.alternativePathName2);
-        reply.content.push_back("\"]");
-        reply.content.push_back("],");
-        //list all viapoints so that the client may display it
-        reply.content.push_back("\"via_points\":[");
-
-        BOOST_ASSERT( !raw_route.segmentEndCoordinates.empty() );
-
-        std::string tmp;
-        FixedPointCoordinate::convertInternalReversedCoordinateToString(
-            raw_route.segmentEndCoordinates.front().source_phantom.location,
-            tmp
-        );
-        reply.content.push_back("[");
-        reply.content.push_back(tmp);
-        reply.content.push_back("]");
-
-        BOOST_FOREACH(const PhantomNodes & nodes, raw_route.segmentEndCoordinates) {
-            tmp.clear();
-            FixedPointCoordinate::convertInternalReversedCoordinateToString(
-                nodes.target_phantom.location,
-                tmp
-            );
-            reply.content.push_back(",[");
-            reply.content.push_back(tmp);
-            reply.content.push_back("]");
-        }
-
-        reply.content.push_back("],");
-        reply.content.push_back("\"via_indices\":[");
-        BOOST_FOREACH(const unsigned index, shortest_leg_end_indices) {
-            tmp.clear();
-            intToString(index, tmp);
-            reply.content.push_back(tmp);
-            if( index != shortest_leg_end_indices.back() ) {
-                reply.content.push_back(",");
-            }
-        }
-        reply.content.push_back("],\"alternative_indices\":[");
-        if(INT_MAX != raw_route.lengthOfAlternativePath) {
-            reply.content.push_back("0,");
-            tmp.clear();
-            intToString(alternate_descriptionFactory.pathDescription.size(), tmp);
-            reply.content.push_back(tmp);
-        }
-
-        reply.content.push_back("],");
-        reply.content.push_back("\"hint_data\": {");
-        reply.content.push_back("\"checksum\":");
-        intToString(raw_route.checkSum, tmp);
-        reply.content.push_back(tmp);
-        reply.content.push_back(", \"locations\": [");
-
-        std::string hint;
-        for(unsigned i = 0; i < raw_route.segmentEndCoordinates.size(); ++i) {
-            reply.content.push_back("\"");
-            EncodeObjectToBase64(raw_route.segmentEndCoordinates[i].source_phantom, hint);
-            reply.content.push_back(hint);
-            reply.content.push_back("\", ");
-        }
-        EncodeObjectToBase64(raw_route.segmentEndCoordinates.back().target_phantom, hint);
-        reply.content.push_back("\"");
-        reply.content.push_back(hint);
-        reply.content.push_back("\"]");
-        reply.content.push_back("}}");
-    }
-
-    // construct routes names
-    void GetRouteNames(
-        std::vector<Segment> & shortest_path_segments,
-        std::vector<Segment> & alternative_path_segments,
-        const DataFacadeT * facade,
-        RouteNames & routeNames
-    ) {
-
-        Segment shortestSegment1, shortestSegment2;
-        Segment alternativeSegment1, alternativeSegment2;
-
-        if(0 < shortest_path_segments.size()) {
-            sort(shortest_path_segments.begin(), shortest_path_segments.end(), boost::bind(&Segment::length, _1) > boost::bind(&Segment::length, _2) );
-            shortestSegment1 = shortest_path_segments[0];
-            if(0 < alternative_path_segments.size()) {
-                sort(alternative_path_segments.begin(), alternative_path_segments.end(), boost::bind(&Segment::length, _1) > boost::bind(&Segment::length, _2) );
-                alternativeSegment1 = alternative_path_segments[0];
-            }
-            std::vector<Segment> shortestDifference(shortest_path_segments.size());
-            std::vector<Segment> alternativeDifference(alternative_path_segments.size());
-            std::set_difference(shortest_path_segments.begin(), shortest_path_segments.end(), alternative_path_segments.begin(), alternative_path_segments.end(), shortestDifference.begin(), boost::bind(&Segment::name_id, _1) < boost::bind(&Segment::name_id, _2) );
-            int size_of_difference = shortestDifference.size();
-            if(0 < size_of_difference ) {
-                int i = 0;
-                while( i < size_of_difference && shortestDifference[i].name_id == shortest_path_segments[0].name_id) {
-                    ++i;
-                }
-                if(i < size_of_difference ) {
-                    shortestSegment2 = shortestDifference[i];
-                }
-            }
-
-            std::set_difference(alternative_path_segments.begin(), alternative_path_segments.end(), shortest_path_segments.begin(), shortest_path_segments.end(), alternativeDifference.begin(), boost::bind(&Segment::name_id, _1) < boost::bind(&Segment::name_id, _2) );
-            size_of_difference = alternativeDifference.size();
-            if(0 < size_of_difference ) {
-                int i = 0;
-                while( i < size_of_difference && alternativeDifference[i].name_id == alternative_path_segments[0].name_id) {
-                    ++i;
-                }
-                if(i < size_of_difference ) {
-                    alternativeSegment2 = alternativeDifference[i];
-                }
-            }
-            if(shortestSegment1.position > shortestSegment2.position)
-                std::swap(shortestSegment1, shortestSegment2);
-
-            if(alternativeSegment1.position >  alternativeSegment2.position)
-                std::swap(alternativeSegment1, alternativeSegment2);
-
-            routeNames.shortestPathName1 = facade->GetEscapedNameForNameID(
-                shortestSegment1.name_id
-            );
-            routeNames.shortestPathName2 = facade->GetEscapedNameForNameID(
-                shortestSegment2.name_id
-            );
-
-            routeNames.alternativePathName1 = facade->GetEscapedNameForNameID(
-                alternativeSegment1.name_id
-            );
-            routeNames.alternativePathName2 = facade->GetEscapedNameForNameID(
-                alternativeSegment2.name_id
-            );
-        }
-    }
-
-    //TODO: reorder parameters
-    inline void BuildTextualDescription(
-        DescriptionFactory & description_factory,
-        http::Reply & reply,
-        const int route_length,
-        const DataFacadeT * facade,
-        std::vector<Segment> & route_segments_list
-    ) {
-        //Segment information has following format:
-        //["instruction","streetname",length,position,time,"length","earth_direction",azimuth]
-        //Example: ["Turn left","High Street",200,4,10,"200m","NE",22.5]
-        unsigned necessary_segments_running_index = 0;
-        round_about.leave_at_exit = 0;
-        round_about.name_id = 0;
-        std::string temp_dist, temp_length, temp_duration, temp_bearing, temp_instruction;
-
-        //Fetch data from Factory and generate a string from it.
-        BOOST_FOREACH(const SegmentInformation & segment, description_factory.pathDescription) {
-            TurnInstruction current_instruction = segment.turn_instruction & TurnInstructionsClass::InverseAccessRestrictionFlag;
-            entered_restricted_area_count += (current_instruction != segment.turn_instruction);
-            if (TurnInstructionsClass::TurnIsNecessary( current_instruction) )
-            {
-                if (TurnInstructionsClass::EnterRoundAbout == current_instruction)
-                {
-                    round_about.name_id = segment.name_id;
-                    round_about.start_index = necessary_segments_running_index;
-                }
-                else
-                {
-                    if (0 != necessary_segments_running_index)
-                    {
-                        reply.content.push_back(",");
-                    }
-                    reply.content.push_back("[\"");
-                    if(TurnInstructionsClass::LeaveRoundAbout == current_instruction) {
-                        intToString(TurnInstructionsClass::EnterRoundAbout, temp_instruction);
-                        reply.content.push_back(temp_instruction);
-                        reply.content.push_back("-");
-                        intToString(round_about.leave_at_exit+1, temp_instruction);
-                        reply.content.push_back(temp_instruction);
-                        round_about.leave_at_exit = 0;
-                    } else {
-                        intToString(current_instruction, temp_instruction);
-                        reply.content.push_back(temp_instruction);
-                    }
-
-                    reply.content.push_back("\",\"");
-                    reply.content.push_back(facade->GetEscapedNameForNameID(segment.name_id));
-                    reply.content.push_back("\",");
-                    intToString(segment.length, temp_dist);
-                    reply.content.push_back(temp_dist);
-                    reply.content.push_back(",");
-                    intToString(necessary_segments_running_index, temp_length);
-                    reply.content.push_back(temp_length);
-                    reply.content.push_back(",");
-                    intToString(round(segment.duration/10.), temp_duration);
-                    reply.content.push_back(temp_duration);
-                    reply.content.push_back(",\"");
-                    intToString(segment.length, temp_length);
-                    reply.content.push_back(temp_length);
-                    reply.content.push_back("m\",\"");
-                    double bearing_value = round(segment.bearing/10.);
-                    reply.content.push_back(Azimuth::Get(bearing_value));
-                    reply.content.push_back("\",");
-                    intToString(bearing_value, temp_bearing);
-                    reply.content.push_back(temp_bearing);
-                    reply.content.push_back("]");
-
-                    route_segments_list.push_back(
-                        Segment(
-                            segment.name_id,
-                            segment.length,
-                            route_segments_list.size()
-                        )
-                    );
-                }
-            } else if(TurnInstructionsClass::StayOnRoundAbout == current_instruction) {
-                ++round_about.leave_at_exit;
-            }
-            if(segment.necessary)
-                ++necessary_segments_running_index;
-        }
-        if(INT_MAX != route_length) {
-            reply.content.push_back(",[\"");
-            intToString(TurnInstructionsClass::ReachedYourDestination, temp_instruction);
-            reply.content.push_back(temp_instruction);
-            reply.content.push_back("\",\"");
-            reply.content.push_back("\",");
-            reply.content.push_back("0");
-            reply.content.push_back(",");
-            intToString(necessary_segments_running_index-1, temp_length);
-            reply.content.push_back(temp_length);
-            reply.content.push_back(",");
-            reply.content.push_back("0");
-            reply.content.push_back(",\"");
-            reply.content.push_back("\",\"");
-            reply.content.push_back(Azimuth::Get(0.0));
-            reply.content.push_back("\",");
-            reply.content.push_back("0.0");
-            reply.content.push_back("]");
-        }
-    }
-};
-
-#endif /* JSON_DESCRIPTOR_H_ */
+/*
+
+Copyright (c) 2013, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+#ifndef JSON_DESCRIPTOR_H_
+#define JSON_DESCRIPTOR_H_
+
+#include "BaseDescriptor.h"
+#include "DescriptionFactory.h"
+#include "../Algorithms/ObjectToBase64.h"
+#include "../Algorithms/ExtractRouteNames.h"
+#include "../DataStructures/JSONContainer.h"
+#include "../DataStructures/SegmentInformation.h"
+#include "../DataStructures/TurnInstructions.h"
+#include "../Util/Azimuth.h"
+#include "../Util/StringUtil.h"
+#include "../Util/TimingUtil.h"
+
+#include <algorithm>
+
+template <class DataFacadeT> class JSONDescriptor : public BaseDescriptor<DataFacadeT>
+{
+  private:
+    DataFacadeT *facade;
+    DescriptorConfig config;
+    DescriptionFactory description_factory, alternate_description_factory;
+    FixedPointCoordinate current;
+    unsigned entered_restricted_area_count;
+    struct RoundAbout
+    {
+        RoundAbout() : start_index(INT_MAX), name_id(INT_MAX), leave_at_exit(INT_MAX) {}
+        int start_index;
+        int name_id;
+        int leave_at_exit;
+    } round_about;
+
+    struct Segment
+    {
+        Segment() : name_id(-1), length(-1), position(-1) {}
+        Segment(int n, int l, int p) : name_id(n), length(l), position(p) {}
+        int name_id;
+        int length;
+        int position;
+    };
+    std::vector<Segment> shortest_path_segments, alternative_path_segments;
+    std::vector<unsigned> shortest_leg_end_indices, alternative_leg_end_indices;
+    ExtractRouteNames<DataFacadeT, Segment> GenerateRouteNames;
+
+
+  public:
+    JSONDescriptor(DataFacadeT *facade) : facade(facade), entered_restricted_area_count(0)
+    {
+        shortest_leg_end_indices.emplace_back(0);
+        alternative_leg_end_indices.emplace_back(0);
+    }
+
+    void SetConfig(const DescriptorConfig &c) { config = c; }
+
+    unsigned DescribeLeg(const std::vector<PathData> route_leg, const PhantomNodes &leg_phantoms)
+    {
+        unsigned added_element_count = 0;
+        // Get all the coordinates for the computed route
+        FixedPointCoordinate current_coordinate;
+        for (const PathData &path_data : route_leg)
+        {
+            current_coordinate = facade->GetCoordinateOfNode(path_data.node);
+            description_factory.AppendSegment(current_coordinate, path_data);
+            ++added_element_count;
+        }
+        ++added_element_count;
+        BOOST_ASSERT((route_leg.size() + 1) == added_element_count);
+        return added_element_count;
+    }
+
+    void Run(const RawRouteData &raw_route,
+             const PhantomNodes &phantom_nodes,
+             http::Reply &reply)
+    {
+        JSON::Object json_result;
+
+        if (INVALID_EDGE_WEIGHT == raw_route.shortest_path_length)
+        {
+            // We do not need to do much, if there is no route ;-)
+            json_result.values["status"] = 207;
+            json_result.values["status_message"] = "Cannot find route between points";
+            JSON::render(reply.content, json_result);
+            return;
+        }
+
+        // check if first segment is non-zero
+        std::string road_name =
+            facade->GetEscapedNameForNameID(phantom_nodes.source_phantom.name_id);
+
+        BOOST_ASSERT(raw_route.unpacked_path_segments.size() ==
+                     raw_route.segment_end_coordinates.size());
+
+        description_factory.SetStartSegment(phantom_nodes.source_phantom);
+        json_result.values["status"] = 0;
+        json_result.values["status_message"] = "Found route between points";
+
+        // for each unpacked segment add the leg to the description
+        for (unsigned i = 0; i < raw_route.unpacked_path_segments.size(); ++i)
+        {
+            const int added_segments = DescribeLeg(raw_route.unpacked_path_segments[i],
+                                                   raw_route.segment_end_coordinates[i]);
+            BOOST_ASSERT(0 < added_segments);
+            shortest_leg_end_indices.emplace_back(added_segments + shortest_leg_end_indices.back());
+        }
+        description_factory.SetEndSegment(phantom_nodes.target_phantom);
+        description_factory.Run(facade, config.zoom_level);
+
+        if (config.geometry)
+        {
+            JSON::Value route_geometry = description_factory.AppendEncodedPolylineString(config.encode_geometry);
+            json_result.values["route_geometry"] = route_geometry;
+        }
+        if (config.instructions)
+        {
+            JSON::Array json_route_instructions;
+            BuildTextualDescription(description_factory,
+                                    json_route_instructions,
+                                    raw_route.shortest_path_length,
+                                    shortest_path_segments);
+            json_result.values["route_instructions"] = json_route_instructions;
+        }
+        description_factory.BuildRouteSummary(description_factory.entireLength,
+                                              raw_route.shortest_path_length);
+        JSON::Object json_route_summary;
+        json_route_summary.values["total_distance"] = description_factory.summary.distance;
+        json_route_summary.values["total_time"] = description_factory.summary.duration;
+        json_route_summary.values["start_point"] = facade->GetEscapedNameForNameID(description_factory.summary.source_name_id);
+        json_route_summary.values["end_point"] = facade->GetEscapedNameForNameID(description_factory.summary.target_name_id);
+        json_result.values["route_summary"] = json_route_summary;
+
+        BOOST_ASSERT(!raw_route.segment_end_coordinates.empty());
+
+        JSON::Array json_via_points_array;
+        JSON::Array json_first_coordinate;
+        json_first_coordinate.values.push_back(raw_route.segment_end_coordinates.front().source_phantom.location.lat/COORDINATE_PRECISION);
+        json_first_coordinate.values.push_back(raw_route.segment_end_coordinates.front().source_phantom.location.lon/COORDINATE_PRECISION);
+        json_via_points_array.values.push_back(json_first_coordinate);
+        for (const PhantomNodes &nodes : raw_route.segment_end_coordinates)
+        {
+            std::string tmp;
+            JSON::Array json_coordinate;
+            json_coordinate.values.push_back(nodes.target_phantom.location.lat/COORDINATE_PRECISION);
+            json_coordinate.values.push_back(nodes.target_phantom.location.lon/COORDINATE_PRECISION);
+            json_via_points_array.values.push_back(json_coordinate);
+        }
+        json_result.values["via_points"] = json_via_points_array;
+
+        JSON::Array json_via_indices_array;
+        json_via_indices_array.values.insert(json_via_indices_array.values.end(), shortest_leg_end_indices.begin(), shortest_leg_end_indices.end());
+        json_result.values["via_indices"] = json_via_indices_array;
+
+        // only one alternative route is computed at this time, so this is hardcoded
+        if (INVALID_EDGE_WEIGHT != raw_route.alternative_path_length)
+        {
+            json_result.values["found_alternative"] = JSON::True();
+            alternate_description_factory.SetStartSegment(phantom_nodes.source_phantom);
+            // Get all the coordinates for the computed route
+            for (const PathData &path_data : raw_route.unpacked_alternative)
+            {
+                current = facade->GetCoordinateOfNode(path_data.node);
+                alternate_description_factory.AppendSegment(current, path_data);
+            }
+            alternate_description_factory.Run(facade, config.zoom_level);
+
+            if (config.geometry)
+            {
+                JSON::Value alternate_geometry_string = alternate_description_factory.AppendEncodedPolylineString(config.encode_geometry);
+                JSON::Array json_alternate_geometries_array;
+                json_alternate_geometries_array.values.push_back(alternate_geometry_string);
+                json_result.values["alternative_geometries"] = json_alternate_geometries_array;
+            }
+            // Generate instructions for each alternative (simulated here)
+            JSON::Array json_alt_instructions;
+            JSON::Array json_current_alt_instructions;
+            if (config.instructions)
+            {
+                BuildTextualDescription(alternate_description_factory,
+                                        json_current_alt_instructions,
+                                        raw_route.alternative_path_length,
+                                        alternative_path_segments);
+                json_alt_instructions.values.push_back(json_current_alt_instructions);
+                json_result.values["alternative_instructions"] = json_alt_instructions;
+            }
+            alternate_description_factory.BuildRouteSummary(
+                alternate_description_factory.entireLength, raw_route.alternative_path_length);
+
+            JSON::Object json_alternate_route_summary;
+            JSON::Array json_alternate_route_summary_array;
+            json_alternate_route_summary.values["total_distance"] = alternate_description_factory.summary.distance;
+            json_alternate_route_summary.values["total_time"] = alternate_description_factory.summary.duration;
+            json_alternate_route_summary.values["start_point"] = facade->GetEscapedNameForNameID(alternate_description_factory.summary.source_name_id);
+            json_alternate_route_summary.values["end_point"] = facade->GetEscapedNameForNameID(alternate_description_factory.summary.target_name_id);
+            json_alternate_route_summary_array.values.push_back(json_alternate_route_summary);
+            json_result.values["alternative_summaries"] = json_alternate_route_summary_array;
+
+            JSON::Array json_altenative_indices_array;
+            json_altenative_indices_array.values.push_back(0);
+            json_altenative_indices_array.values.push_back(alternate_description_factory.path_description.size());
+            json_result.values["alternative_indices"] = json_altenative_indices_array;
+        } else {
+            json_result.values["found_alternative"] = JSON::False();
+        }
+
+        // Get Names for both routes
+        RouteNames route_names = GenerateRouteNames(shortest_path_segments, alternative_path_segments, facade);
+        JSON::Array json_route_names;
+        json_route_names.values.push_back(route_names.shortest_path_name_1);
+        json_route_names.values.push_back(route_names.shortest_path_name_2);
+        json_result.values["route_name"] = json_route_names;
+
+        if (INVALID_EDGE_WEIGHT != raw_route.alternative_path_length)
+        {
+            JSON::Array json_alternate_names_array;
+            JSON::Array json_alternate_names;
+            json_alternate_names.values.push_back(route_names.alternative_path_name_1);
+            json_alternate_names.values.push_back(route_names.alternative_path_name_2);
+            json_alternate_names_array.values.push_back(json_alternate_names);
+            json_result.values["alternative_names"] = json_alternate_names_array;
+        }
+
+        JSON::Object json_hint_object;
+        json_hint_object.values["checksum"] = raw_route.check_sum;
+        JSON::Array json_location_hint_array;
+        std::string hint;
+        for (unsigned i = 0; i < raw_route.segment_end_coordinates.size(); ++i)
+        {
+            EncodeObjectToBase64(raw_route.segment_end_coordinates[i].source_phantom, hint);
+            json_location_hint_array.values.push_back(hint);
+        }
+        EncodeObjectToBase64(raw_route.segment_end_coordinates.back().target_phantom, hint);
+        json_location_hint_array.values.push_back(hint);
+        json_hint_object.values["locations"] = json_location_hint_array;
+        json_result.values["hint_data"] = json_hint_object;
+
+        // render the content to the output array
+        TIMER_START(route_render);
+        JSON::render(reply.content, json_result);
+        TIMER_STOP(route_render);
+        SimpleLogger().Write(logDEBUG) << "rendering took: " << TIMER_MSEC(route_render);
+    }
+
+    // TODO: reorder parameters
+    inline void BuildTextualDescription(DescriptionFactory &description_factory,
+                                        JSON::Array & json_instruction_array,
+                                        const int route_length,
+                                        std::vector<Segment> &route_segments_list)
+    {
+        // Segment information has following format:
+        //["instruction id","streetname",length,position,time,"length","earth_direction",azimuth]
+        unsigned necessary_segments_running_index = 0;
+        round_about.leave_at_exit = 0;
+        round_about.name_id = 0;
+        std::string temp_dist, temp_length, temp_duration, temp_bearing, temp_instruction;
+
+        // Fetch data from Factory and generate a string from it.
+        for (const SegmentInformation &segment : description_factory.path_description)
+        {
+            JSON::Array json_instruction_row;
+            TurnInstruction current_instruction = segment.turn_instruction;
+            entered_restricted_area_count += (current_instruction != segment.turn_instruction);
+            if (TurnInstructionsClass::TurnIsNecessary(current_instruction))
+            {
+                if (TurnInstruction::EnterRoundAbout == current_instruction)
+                {
+                    round_about.name_id = segment.name_id;
+                    round_about.start_index = necessary_segments_running_index;
+                }
+                else
+                {
+                    std::string current_turn_instruction;
+                    if (TurnInstruction::LeaveRoundAbout == current_instruction)
+                    {
+                        temp_instruction = IntToString(as_integer(TurnInstruction::EnterRoundAbout));
+                        current_turn_instruction += temp_instruction;
+                        current_turn_instruction += "-";
+                        temp_instruction = IntToString(round_about.leave_at_exit + 1);
+                        current_turn_instruction += temp_instruction;
+                        round_about.leave_at_exit = 0;
+                    }
+                    else
+                    {
+                        temp_instruction = IntToString(as_integer(current_instruction));
+                        current_turn_instruction += temp_instruction;
+                    }
+                    json_instruction_row.values.push_back(current_turn_instruction);
+
+                    json_instruction_row.values.push_back(facade->GetEscapedNameForNameID(segment.name_id));
+                    json_instruction_row.values.push_back(std::round(segment.length));
+                    json_instruction_row.values.push_back(necessary_segments_running_index);
+                    json_instruction_row.values.push_back(round(segment.duration / 10));
+                    json_instruction_row.values.push_back(IntToString(segment.length)+"m");
+                    int bearing_value = round(segment.bearing / 10.);
+                    json_instruction_row.values.push_back(Azimuth::Get(bearing_value));
+                    json_instruction_row.values.push_back(bearing_value);
+
+                    route_segments_list.emplace_back(
+                        segment.name_id, segment.length, route_segments_list.size());
+                    json_instruction_array.values.push_back(json_instruction_row);
+                }
+            }
+            else if (TurnInstruction::StayOnRoundAbout == current_instruction)
+            {
+                ++round_about.leave_at_exit;
+            }
+            if (segment.necessary)
+            {
+                ++necessary_segments_running_index;
+            }
+        }
+
+        //TODO: check if this in an invariant
+        if (INVALID_EDGE_WEIGHT != route_length)
+        {
+            JSON::Array json_last_instruction_row;
+            temp_instruction = IntToString(as_integer(TurnInstruction::ReachedYourDestination));
+            json_last_instruction_row.values.push_back(temp_instruction);
+            json_last_instruction_row.values.push_back("");
+            json_last_instruction_row.values.push_back(0);
+            json_last_instruction_row.values.push_back(necessary_segments_running_index - 1);
+            json_last_instruction_row.values.push_back(0);
+            json_last_instruction_row.values.push_back("0m");
+            json_last_instruction_row.values.push_back(Azimuth::Get(0.0));
+            json_last_instruction_row.values.push_back(0.);
+            json_instruction_array.values.push_back(json_last_instruction_row);
+        }
+    }
+};
+
+#endif /* JSON_DESCRIPTOR_H_ */

Extractor/BaseParser.cpp

@@ -36,102 +36,102 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <boost/algorithm/string.hpp>
 #include <boost/algorithm/string/regex.hpp>
-#include <boost/foreach.hpp>
+#include <boost/ref.hpp>
 #include <boost/regex.hpp>
 
-BaseParser::BaseParser(
-    ExtractorCallbacks   * extractor_callbacks,
-    ScriptingEnvironment & scripting_environment
-) : extractor_callbacks(extractor_callbacks),
-    lua_state(scripting_environment.getLuaStateForThreadID(0)),
-    scripting_environment(scripting_environment),
-    use_turn_restrictions(true)
+BaseParser::BaseParser(ExtractorCallbacks *extractor_callbacks,
+                       ScriptingEnvironment &scripting_environment)
+    : extractor_callbacks(extractor_callbacks),
+      lua_state(scripting_environment.getLuaStateForThreadID(0)),
+      scripting_environment(scripting_environment), use_turn_restrictions(true)
 {
     ReadUseRestrictionsSetting();
     ReadRestrictionExceptions();
 }
 
-void BaseParser::ReadUseRestrictionsSetting() {
-    if( 0 != luaL_dostring( lua_state, "return use_turn_restrictions\n") ) {
+void BaseParser::ReadUseRestrictionsSetting()
+{
+    if (0 != luaL_dostring(lua_state, "return use_turn_restrictions\n"))
+    {
         throw OSRMException("ERROR occured in scripting block");
     }
-    if( lua_isboolean( lua_state, -1) ) {
+    if (lua_isboolean(lua_state, -1))
+    {
         use_turn_restrictions = lua_toboolean(lua_state, -1);
     }
-    if( use_turn_restrictions ) {
+    if (use_turn_restrictions)
+    {
         SimpleLogger().Write() << "Using turn restrictions";
-    } else {
+    }
+    else
+    {
         SimpleLogger().Write() << "Ignoring turn restrictions";
     }
 }
 
-void BaseParser::ReadRestrictionExceptions() {
-    if(lua_function_exists(lua_state, "get_exceptions" )) {
-        //get list of turn restriction exceptions
+void BaseParser::ReadRestrictionExceptions()
+{
+    if (lua_function_exists(lua_state, "get_exceptions"))
+    {
+        // get list of turn restriction exceptions
         luabind::call_function<void>(
-            lua_state,
-            "get_exceptions",
-            boost::ref(restriction_exceptions)
-        );
+            lua_state, "get_exceptions", boost::ref(restriction_exceptions));
         const unsigned exception_count = restriction_exceptions.size();
-        SimpleLogger().Write() <<
-            "Found " << exception_count << " exceptions to turn restrictions:";
-        BOOST_FOREACH(const std::string & str, restriction_exceptions) {
+        SimpleLogger().Write() << "Found " << exception_count
+                               << " exceptions to turn restrictions:";
+        for (const std::string &str : restriction_exceptions)
+        {
             SimpleLogger().Write() << "  " << str;
         }
-    } else {
+    }
+    else
+    {
         SimpleLogger().Write() << "Found no exceptions to turn restrictions";
     }
 }
 
-void BaseParser::report_errors(lua_State *L, const int status) const {
-    if( 0!=status ) {
-        std::cerr << "-- " << lua_tostring(L, -1) << std::endl;
-        lua_pop(L, 1); // remove error message
+void BaseParser::report_errors(lua_State *lua_state, const int status) const
+{
+    if (0 != status)
+    {
+        std::cerr << "-- " << lua_tostring(lua_state, -1) << std::endl;
+        lua_pop(lua_state, 1); // remove error message
     }
 }
 
-void BaseParser::ParseNodeInLua(ImportNode& n, lua_State* local_lua_state) {
-    luabind::call_function<void>(
-        local_lua_state,
-        "node_function",
-        boost::ref(n)
-    );
+void BaseParser::ParseNodeInLua(ImportNode &node, lua_State *local_lua_state)
+{
+    luabind::call_function<void>(local_lua_state, "node_function", boost::ref(node));
 }
 
-void BaseParser::ParseWayInLua(ExtractionWay& w, lua_State* local_lua_state) {
-    luabind::call_function<void>(
-        local_lua_state,
-        "way_function",
-        boost::ref(w)
-    );
+void BaseParser::ParseWayInLua(ExtractionWay &way, lua_State *local_lua_state)
+{
+    luabind::call_function<void>(local_lua_state, "way_function", boost::ref(way));
 }
 
-bool BaseParser::ShouldIgnoreRestriction(
-    const std::string & except_tag_string
-) const {
-    //should this restriction be ignored? yes if there's an overlap between:
+bool BaseParser::ShouldIgnoreRestriction(const std::string &except_tag_string) const
+{
+    // should this restriction be ignored? yes if there's an overlap between:
     // a) the list of modes in the except tag of the restriction
     //    (except_tag_string), eg: except=bus;bicycle
     // b) the lua profile defines a hierachy of modes,
     //    eg: [access, vehicle, bicycle]
 
-    if( except_tag_string.empty() ) {
+    if (except_tag_string.empty())
+    {
         return false;
     }
 
-    //Be warned, this is quadratic work here, but we assume that
-    //only a few exceptions are actually defined.
+    // Be warned, this is quadratic work here, but we assume that
+    // only a few exceptions are actually defined.
     std::vector<std::string> exceptions;
     boost::algorithm::split_regex(exceptions, except_tag_string, boost::regex("[;][ ]*"));
-    BOOST_FOREACH(std::string& current_string, exceptions) {
-        std::vector<std::string>::const_iterator string_iterator;
-        string_iterator = std::find(
-            restriction_exceptions.begin(),
-            restriction_exceptions.end(),
-            current_string
-        );
-        if( restriction_exceptions.end() != string_iterator ) {
+    for (std::string &current_string : exceptions)
+    {
+        const auto string_iterator =
+            std::find(restriction_exceptions.begin(), restriction_exceptions.end(), current_string);
+        if (restriction_exceptions.end() != string_iterator)
+        {
             return true;
         }
     }

Extractor/BaseParser.h

@@ -28,45 +28,38 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef BASEPARSER_H_
 #define BASEPARSER_H_
 
-extern "C" {
-    #include <lua.h>
-    #include <lauxlib.h>
-    #include <lualib.h>
-}
-
-#include <boost/noncopyable.hpp>
 #include <string>
 #include <vector>
 
+struct lua_State;
 class ExtractorCallbacks;
 class ScriptingEnvironment;
 struct ExtractionWay;
 struct ImportNode;
 
-class BaseParser : boost::noncopyable {
-public:
-    BaseParser(
-        ExtractorCallbacks * extractor_callbacks,
-        ScriptingEnvironment & scripting_environment
-    );
+class BaseParser
+{
+  public:
+    BaseParser() = delete;
+    BaseParser(const BaseParser &) = delete;
+    BaseParser(ExtractorCallbacks *extractor_callbacks,
+               ScriptingEnvironment &scripting_environment);
     virtual ~BaseParser() {}
     virtual bool ReadHeader() = 0;
     virtual bool Parse() = 0;
 
-    virtual void ParseNodeInLua(ImportNode & n, lua_State* thread_lua_state);
-    virtual void ParseWayInLua(ExtractionWay & n, lua_State* thread_lua_state);
-    virtual void report_errors(lua_State * lua_state, const int status) const;
+    virtual void ParseNodeInLua(ImportNode &node, lua_State *lua_state);
+    virtual void ParseWayInLua(ExtractionWay &way, lua_State *lua_state);
+    virtual void report_errors(lua_State *lua_state, const int status) const;
 
-protected:
+  protected:
     virtual void ReadUseRestrictionsSetting();
     virtual void ReadRestrictionExceptions();
-    virtual bool ShouldIgnoreRestriction(
-        const std::string & except_tag_string
-    ) const;
+    virtual bool ShouldIgnoreRestriction(const std::string &except_tag_string) const;
 
-    ExtractorCallbacks     * extractor_callbacks;
-    lua_State              * lua_state;
-    ScriptingEnvironment   & scripting_environment;
+    ExtractorCallbacks *extractor_callbacks;
+    lua_State *lua_state;
+    ScriptingEnvironment &scripting_environment;
     std::vector<std::string> restriction_exceptions;
     bool use_turn_restrictions;
 };

Extractor/ExtractionContainers.cpp

@@ -27,23 +27,27 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "ExtractionContainers.h"
 #include "ExtractionWay.h"
+#include "../Util/OSRMException.h"
 #include "../Util/SimpleLogger.h"
-#include "../Util/TimingUtil.h"
 
 #include <boost/assert.hpp>
-#include <boost/foreach.hpp>
 #include <boost/filesystem.hpp>
 #include <boost/filesystem/fstream.hpp>
 
 #include <stxxl/sort>
 
-ExtractionContainers::ExtractionContainers() {
-    //Check if stxxl can be instantiated
+#include <chrono>
+#include <limits>
+
+ExtractionContainers::ExtractionContainers()
+{
+    // Check if stxxl can be instantiated
     stxxl::vector<unsigned> dummy_vector;
     name_list.push_back("");
 }
 
-ExtractionContainers::~ExtractionContainers() {
+ExtractionContainers::~ExtractionContainers()
+{
     used_node_id_list.clear();
     all_nodes_list.clear();
     all_edges_list.clear();
@@ -52,412 +56,396 @@ ExtractionContainers::~ExtractionContainers() {
     way_start_end_id_list.clear();
 }
 
-void ExtractionContainers::PrepareData(
-    const std::string & output_file_name,
-    const std::string & restrictions_file_name
-) {
-    try {
+void ExtractionContainers::PrepareData(const std::string &output_file_name,
+                                       const std::string &restrictions_file_name)
+{
+    try
+    {
         unsigned number_of_used_nodes = 0;
         unsigned number_of_used_edges = 0;
-        double time = get_timestamp();
+        std::chrono::time_point<std::chrono::steady_clock> time1 = std::chrono::steady_clock::now();
 
         std::cout << "[extractor] Sorting used nodes        ... " << std::flush;
-        stxxl::sort(
-            used_node_id_list.begin(),
-            used_node_id_list.end(),
-            Cmp(),
-            4294967296
-        );
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
+        stxxl::sort(used_node_id_list.begin(), used_node_id_list.end(), Cmp(), stxxl_memory);
+        std::chrono::time_point<std::chrono::steady_clock> time2 = std::chrono::steady_clock::now();
+        std::chrono::duration<double> elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
 
-        time = get_timestamp();
+        time1 = std::chrono::steady_clock::now();
         std::cout << "[extractor] Erasing duplicate nodes   ... " << std::flush;
-        stxxl::vector<NodeID>::iterator NewEnd = std::unique ( used_node_id_list.begin(),used_node_id_list.end() ) ;
-        used_node_id_list.resize ( NewEnd - used_node_id_list.begin() );
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
-        time = get_timestamp();
+        auto new_end = std::unique(used_node_id_list.begin(), used_node_id_list.end());
+        used_node_id_list.resize(new_end - used_node_id_list.begin());
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
+
+        time1 = std::chrono::steady_clock::now();
 
         std::cout << "[extractor] Sorting all nodes         ... " << std::flush;
-        stxxl::sort(
-            all_nodes_list.begin(),
-            all_nodes_list.end(),
-            CmpNodeByID(),
-            4294967296
-        );
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
-        time = get_timestamp();
+        stxxl::sort(all_nodes_list.begin(), all_nodes_list.end(), CmpNodeByID(), stxxl_memory);
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
+
+        time1 = std::chrono::steady_clock::now();
 
         std::cout << "[extractor] Sorting used ways         ... " << std::flush;
         stxxl::sort(
-            way_start_end_id_list.begin(),
-            way_start_end_id_list.end(),
-            CmpWayByID(),
-            4294967296
-        );
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
+            way_start_end_id_list.begin(), way_start_end_id_list.end(), CmpWayByID(), stxxl_memory);
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
 
-        std::cout << "[extractor] Sorting restrctns. by from... " << std::flush;
-        stxxl::sort(
-            restrictions_list.begin(),
-            restrictions_list.end(),
-            CmpRestrictionContainerByFrom(),
-            4294967296
-        );
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
+        std::cout << "[extractor] Sorting restrictions. by from... " << std::flush;
+        stxxl::sort(restrictions_list.begin(),
+                    restrictions_list.end(),
+                    CmpRestrictionContainerByFrom(),
+                    stxxl_memory);
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
 
         std::cout << "[extractor] Fixing restriction starts ... " << std::flush;
-        STXXLRestrictionsVector::iterator restrictions_iterator = restrictions_list.begin();
-        STXXLWayIDStartEndVector::iterator way_start_and_end_iterator = way_start_end_id_list.begin();
+        auto restrictions_iterator = restrictions_list.begin();
+        auto way_start_and_end_iterator = way_start_end_id_list.begin();
 
-        while(
-            way_start_and_end_iterator != way_start_end_id_list.end() &&
-            restrictions_iterator      != restrictions_list.end()
-        ) {
-
-            if(way_start_and_end_iterator->wayID < restrictions_iterator->fromWay){
+        while (way_start_and_end_iterator != way_start_end_id_list.end() &&
+               restrictions_iterator != restrictions_list.end())
+        {
+            if (way_start_and_end_iterator->wayID < restrictions_iterator->fromWay)
+            {
                 ++way_start_and_end_iterator;
                 continue;
             }
 
-            if(way_start_and_end_iterator->wayID > restrictions_iterator->fromWay) {
+            if (way_start_and_end_iterator->wayID > restrictions_iterator->fromWay)
+            {
                 ++restrictions_iterator;
                 continue;
             }
 
             BOOST_ASSERT(way_start_and_end_iterator->wayID == restrictions_iterator->fromWay);
-            NodeID via_node_id = restrictions_iterator->restriction.viaNode;
+            const NodeID via_node_id = restrictions_iterator->restriction.viaNode;
 
-            if(way_start_and_end_iterator->firstStart == via_node_id) {
-                restrictions_iterator->restriction.fromNode = way_start_and_end_iterator->firstTarget;
-            } else if(way_start_and_end_iterator->firstTarget == via_node_id) {
-                restrictions_iterator->restriction.fromNode = way_start_and_end_iterator->firstStart;
-            } else if(way_start_and_end_iterator->lastStart == via_node_id) {
-                restrictions_iterator->restriction.fromNode = way_start_and_end_iterator->lastTarget;
-            } else if(way_start_and_end_iterator->lastTarget == via_node_id) {
+            if (way_start_and_end_iterator->firstStart == via_node_id)
+            {
+                restrictions_iterator->restriction.fromNode =
+                    way_start_and_end_iterator->firstTarget;
+            }
+            else if (way_start_and_end_iterator->firstTarget == via_node_id)
+            {
+                restrictions_iterator->restriction.fromNode =
+                    way_start_and_end_iterator->firstStart;
+            }
+            else if (way_start_and_end_iterator->lastStart == via_node_id)
+            {
+                restrictions_iterator->restriction.fromNode =
+                    way_start_and_end_iterator->lastTarget;
+            }
+            else if (way_start_and_end_iterator->lastTarget == via_node_id)
+            {
                 restrictions_iterator->restriction.fromNode = way_start_and_end_iterator->lastStart;
             }
             ++restrictions_iterator;
         }
 
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
-        time = get_timestamp();
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
 
-        std::cout << "[extractor] Sorting restrctns. by to  ... " << std::flush;
-        stxxl::sort(
-            restrictions_list.begin(),
-            restrictions_list.end(),
-            CmpRestrictionContainerByTo(),
-            4294967296
-        );
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
+        time1 = std::chrono::steady_clock::now();
 
-        time = get_timestamp();
-        unsigned usableRestrictionsCounter(0);
+        std::cout << "[extractor] Sorting restrictions. by to  ... " << std::flush;
+        stxxl::sort(restrictions_list.begin(),
+                    restrictions_list.end(),
+                    CmpRestrictionContainerByTo(),
+                    stxxl_memory);
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
+
+        time1 = std::chrono::steady_clock::now();
+        unsigned number_of_useable_restrictions = 0;
         std::cout << "[extractor] Fixing restriction ends   ... " << std::flush;
         restrictions_iterator = restrictions_list.begin();
         way_start_and_end_iterator = way_start_end_id_list.begin();
-        while(
-            way_start_and_end_iterator != way_start_end_id_list.end() &&
-            restrictions_iterator       != restrictions_list.end()
-        ) {
-            if(way_start_and_end_iterator->wayID < restrictions_iterator->toWay){
+        while (way_start_and_end_iterator != way_start_end_id_list.end() &&
+               restrictions_iterator != restrictions_list.end())
+        {
+            if (way_start_and_end_iterator->wayID < restrictions_iterator->toWay)
+            {
                 ++way_start_and_end_iterator;
                 continue;
             }
-            if(way_start_and_end_iterator->wayID > restrictions_iterator->toWay) {
+            if (way_start_and_end_iterator->wayID > restrictions_iterator->toWay)
+            {
                 ++restrictions_iterator;
                 continue;
             }
             NodeID via_node_id = restrictions_iterator->restriction.viaNode;
-            if(way_start_and_end_iterator->lastStart == via_node_id) {
+            if (way_start_and_end_iterator->lastStart == via_node_id)
+            {
                 restrictions_iterator->restriction.toNode = way_start_and_end_iterator->lastTarget;
-            } else if(way_start_and_end_iterator->lastTarget == via_node_id) {
+            }
+            else if (way_start_and_end_iterator->lastTarget == via_node_id)
+            {
                 restrictions_iterator->restriction.toNode = way_start_and_end_iterator->lastStart;
-            } else if(way_start_and_end_iterator->firstStart == via_node_id) {
+            }
+            else if (way_start_and_end_iterator->firstStart == via_node_id)
+            {
                 restrictions_iterator->restriction.toNode = way_start_and_end_iterator->firstTarget;
-            } else if(way_start_and_end_iterator->firstTarget == via_node_id) {
+            }
+            else if (way_start_and_end_iterator->firstTarget == via_node_id)
+            {
                 restrictions_iterator->restriction.toNode = way_start_and_end_iterator->firstStart;
             }
 
-            if(
-                UINT_MAX != restrictions_iterator->restriction.fromNode &&
-                UINT_MAX != restrictions_iterator->restriction.toNode
-            ) {
-                ++usableRestrictionsCounter;
+            if (std::numeric_limits<unsigned>::max() != restrictions_iterator->restriction.fromNode &&
+                std::numeric_limits<unsigned>::max() != restrictions_iterator->restriction.toNode)
+            {
+                ++number_of_useable_restrictions;
             }
             ++restrictions_iterator;
         }
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
-        SimpleLogger().Write() << "usable restrictions: " << usableRestrictionsCounter;
-        //serialize restrictions
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
+
+        SimpleLogger().Write() << "usable restrictions: " << number_of_useable_restrictions;
+        // serialize restrictions
         std::ofstream restrictions_out_stream;
         restrictions_out_stream.open(restrictions_file_name.c_str(), std::ios::binary);
-        restrictions_out_stream.write((char*)&uuid, sizeof(UUID));
-        restrictions_out_stream.write(
-            (char*)&usableRestrictionsCounter,
-            sizeof(unsigned)
-        );
-        for(
-            restrictions_iterator = restrictions_list.begin();
-            restrictions_iterator != restrictions_list.end();
-            ++restrictions_iterator
-        ) {
-            if(
-                UINT_MAX != restrictions_iterator->restriction.fromNode &&
-                UINT_MAX != restrictions_iterator->restriction.toNode
-            ) {
-                restrictions_out_stream.write(
-                    (char *)&(restrictions_iterator->restriction),
-                    sizeof(TurnRestriction)
-                );
+        restrictions_out_stream.write((char *)&uuid, sizeof(UUID));
+        restrictions_out_stream.write((char *)&number_of_useable_restrictions, sizeof(unsigned));
+        // for (restrictions_iterator = restrictions_list.begin();
+        //      restrictions_iterator != restrictions_list.end();
+        //      ++restrictions_iterator)
+        for(const auto & restriction_container : restrictions_list)
+        {
+            if (std::numeric_limits<unsigned>::max() != restriction_container.restriction.fromNode &&
+                std::numeric_limits<unsigned>::max() != restriction_container.restriction.toNode)
+            {
+                restrictions_out_stream.write((char *)&(restriction_container.restriction),
+                                              sizeof(TurnRestriction));
             }
         }
         restrictions_out_stream.close();
 
         std::ofstream file_out_stream;
         file_out_stream.open(output_file_name.c_str(), std::ios::binary);
-        file_out_stream.write((char*)&uuid, sizeof(UUID));
-        file_out_stream.write((char*)&number_of_used_nodes, sizeof(unsigned));
-        time = get_timestamp();
+        file_out_stream.write((char *)&uuid, sizeof(UUID));
+        file_out_stream.write((char *)&number_of_used_nodes, sizeof(unsigned));
+        time1 = std::chrono::steady_clock::now();
         std::cout << "[extractor] Confirming/Writing used nodes     ... " << std::flush;
 
-        //identify all used nodes by a merging step of two sorted lists
-        STXXLNodeVector::iterator node_iterator = all_nodes_list.begin();
-        STXXLNodeIDVector::iterator node_id_iterator = used_node_id_list.begin();
-        while(
-            node_id_iterator != used_node_id_list.end() &&
-            node_iterator    != all_nodes_list.end()
-        ) {
-            if(*node_id_iterator < node_iterator->id){
+        // identify all used nodes by a merging step of two sorted lists
+        auto node_iterator = all_nodes_list.begin();
+        auto node_id_iterator = used_node_id_list.begin();
+        while (node_id_iterator != used_node_id_list.end() && node_iterator != all_nodes_list.end())
+        {
+            if (*node_id_iterator < node_iterator->id)
+            {
                 ++node_id_iterator;
                 continue;
             }
-            if(*node_id_iterator > node_iterator->id) {
+            if (*node_id_iterator > node_iterator->id)
+            {
                 ++node_iterator;
                 continue;
             }
-            BOOST_ASSERT( *node_id_iterator == node_iterator->id);
+            BOOST_ASSERT(*node_id_iterator == node_iterator->id);
 
-            file_out_stream.write(
-                (char*)&(*node_iterator),
-                sizeof(ExternalMemoryNode)
-            );
+            file_out_stream.write((char *)&(*node_iterator), sizeof(ExternalMemoryNode));
 
             ++number_of_used_nodes;
             ++node_id_iterator;
             ++node_iterator;
         }
 
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
 
         std::cout << "[extractor] setting number of nodes   ... " << std::flush;
         std::ios::pos_type previous_file_position = file_out_stream.tellp();
-        file_out_stream.seekp(std::ios::beg+sizeof(UUID));
-        file_out_stream.write((char*)&number_of_used_nodes, sizeof(unsigned));
+        file_out_stream.seekp(std::ios::beg + sizeof(UUID));
+        file_out_stream.write((char *)&number_of_used_nodes, sizeof(unsigned));
         file_out_stream.seekp(previous_file_position);
 
         std::cout << "ok" << std::endl;
-        time = get_timestamp();
+        time1 = std::chrono::steady_clock::now();
 
         // Sort edges by start.
         std::cout << "[extractor] Sorting edges by start    ... " << std::flush;
-        stxxl::sort(
-            all_edges_list.begin(),
-            all_edges_list.end(),
-            CmpEdgeByStartID(),
-            4294967296
-        );
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
-        time = get_timestamp();
+        stxxl::sort(all_edges_list.begin(), all_edges_list.end(), CmpEdgeByStartID(), stxxl_memory);
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
+
+        time1 = std::chrono::steady_clock::now();
 
         std::cout << "[extractor] Setting start coords      ... " << std::flush;
-        file_out_stream.write((char*)&number_of_used_edges, sizeof(unsigned));
+        file_out_stream.write((char *)&number_of_used_edges, sizeof(unsigned));
         // Traverse list of edges and nodes in parallel and set start coord
         node_iterator = all_nodes_list.begin();
-        STXXLEdgeVector::iterator edge_iterator = all_edges_list.begin();
-        while(
-            edge_iterator != all_edges_list.end() &&
-            node_iterator != all_nodes_list.end()
-        ) {
-            if(edge_iterator->start < node_iterator->id){
+        auto edge_iterator = all_edges_list.begin();
+        while (edge_iterator != all_edges_list.end() && node_iterator != all_nodes_list.end())
+        {
+            if (edge_iterator->start < node_iterator->id)
+            {
                 ++edge_iterator;
                 continue;
             }
-            if(edge_iterator->start > node_iterator->id) {
+            if (edge_iterator->start > node_iterator->id)
+            {
                 node_iterator++;
                 continue;
             }
 
             BOOST_ASSERT(edge_iterator->start == node_iterator->id);
-            edge_iterator->startCoord.lat = node_iterator->lat;
-            edge_iterator->startCoord.lon = node_iterator->lon;
+            edge_iterator->source_coordinate.lat = node_iterator->lat;
+            edge_iterator->source_coordinate.lon = node_iterator->lon;
             ++edge_iterator;
         }
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
-        time = get_timestamp();
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
 
+        time1 = std::chrono::steady_clock::now();
         // Sort Edges by target
         std::cout << "[extractor] Sorting edges by target   ... " << std::flush;
-        stxxl::sort(
-            all_edges_list.begin(),
-            all_edges_list.end(),
-            CmpEdgeByTargetID(),
-            4294967296
-        );
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
-        time = get_timestamp();
+        stxxl::sort(all_edges_list.begin(), all_edges_list.end(), CmpEdgeByTargetID(), stxxl_memory);
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
 
+        time1 = std::chrono::steady_clock::now();
         std::cout << "[extractor] Setting target coords     ... " << std::flush;
         // Traverse list of edges and nodes in parallel and set target coord
         node_iterator = all_nodes_list.begin();
         edge_iterator = all_edges_list.begin();
 
-        while(
-            edge_iterator != all_edges_list.end() &&
-            node_iterator != all_nodes_list.end()
-        ) {
-            if(edge_iterator->target < node_iterator->id){
+        while (edge_iterator != all_edges_list.end() && node_iterator != all_nodes_list.end())
+        {
+            if (edge_iterator->target < node_iterator->id)
+            {
                 ++edge_iterator;
                 continue;
             }
-            if(edge_iterator->target > node_iterator->id) {
+            if (edge_iterator->target > node_iterator->id)
+            {
                 ++node_iterator;
                 continue;
             }
             BOOST_ASSERT(edge_iterator->target == node_iterator->id);
-            if(edge_iterator->startCoord.lat != INT_MIN && edge_iterator->startCoord.lon != INT_MIN) {
-                edge_iterator->targetCoord.lat = node_iterator->lat;
-                edge_iterator->targetCoord.lon = node_iterator->lon;
-
-                const double distance = FixedPointCoordinate::ApproximateDistance(
-                    edge_iterator->startCoord.lat,
-                    edge_iterator->startCoord.lon,
-                    node_iterator->lat,
-                    node_iterator->lon
-                );
-
+            if (edge_iterator->source_coordinate.lat != std::numeric_limits<int>::min() &&
+                edge_iterator->source_coordinate.lon != std::numeric_limits<int>::min())
+            {
                 BOOST_ASSERT(edge_iterator->speed != -1);
-                const double weight = ( distance * 10. ) / (edge_iterator->speed / 3.6);
-                int integer_weight = std::max( 1, (int)std::floor((edge_iterator->isDurationSet ? edge_iterator->speed : weight)+.5) );
-                int integer_distance = std::max( 1, (int)distance );
+                BOOST_ASSERT(edge_iterator->type >= 0);
+                edge_iterator->target_coordinate.lat = node_iterator->lat;
+                edge_iterator->target_coordinate.lon = node_iterator->lon;
+
+                const double distance = FixedPointCoordinate::ApproximateEuclideanDistance(
+                    edge_iterator->source_coordinate.lat,
+                    edge_iterator->source_coordinate.lon,
+                    node_iterator->lat,
+                    node_iterator->lon);
+
+                const double weight = (distance * 10.) / (edge_iterator->speed / 3.6);
+                int integer_weight = std::max(
+                    1,
+                    (int)std::floor(
+                        (edge_iterator->is_duration_set ? edge_iterator->speed : weight) + .5));
+                int integer_distance = std::max(1, (int)distance);
                 short zero = 0;
                 short one = 1;
 
-                file_out_stream.write((char*)&edge_iterator->start, sizeof(unsigned));
-                file_out_stream.write((char*)&edge_iterator->target, sizeof(unsigned));
-                file_out_stream.write((char*)&integer_distance, sizeof(int));
-                switch(edge_iterator->direction) {
+                file_out_stream.write((char *)&edge_iterator->start, sizeof(unsigned));
+                file_out_stream.write((char *)&edge_iterator->target, sizeof(unsigned));
+                file_out_stream.write((char *)&integer_distance, sizeof(int));
+                switch (edge_iterator->direction)
+                {
                 case ExtractionWay::notSure:
-                    file_out_stream.write((char*)&zero, sizeof(short));
+                    file_out_stream.write((char *)&zero, sizeof(short));
                     break;
                 case ExtractionWay::oneway:
-                    file_out_stream.write((char*)&one, sizeof(short));
+                    file_out_stream.write((char *)&one, sizeof(short));
                     break;
                 case ExtractionWay::bidirectional:
-                    file_out_stream.write((char*)&zero, sizeof(short));
-
+                    file_out_stream.write((char *)&zero, sizeof(short));
                     break;
                 case ExtractionWay::opposite:
-                    file_out_stream.write((char*)&one, sizeof(short));
+                    file_out_stream.write((char *)&one, sizeof(short));
                     break;
                 default:
                     throw OSRMException("edge has broken direction");
                 }
-                file_out_stream.write(
-                    (char*)&integer_weight, sizeof(int)
-                );
-                BOOST_ASSERT(edge_iterator->type >= 0);
-                file_out_stream.write(
-                    (char*)&edge_iterator->type,
-                    sizeof(short)
-                );
-                file_out_stream.write(
-                    (char *) &edge_iterator->nameID,
-                    sizeof(unsigned)
-                );
-                file_out_stream.write(
-                    (char *) &edge_iterator->isRoundabout,
-                    sizeof(bool)
-                );
-                file_out_stream.write(
-                    (char *) &edge_iterator->ignoreInGrid,
-                    sizeof(bool)
-                );
-                file_out_stream.write(
-                    (char *) &edge_iterator->isAccessRestricted,
-                    sizeof(bool)
-                );
-                file_out_stream.write(
-                    (char *) &edge_iterator->isContraFlow,
-                    sizeof(bool)
-                );
-                file_out_stream.write(
-                    (char *) &edge_iterator->is_split,
-                    sizeof(bool)
-                );
+
+                file_out_stream.write((char *)&integer_weight, sizeof(int));
+                file_out_stream.write((char *)&edge_iterator->type, sizeof(short));
+                file_out_stream.write((char *)&edge_iterator->name_id, sizeof(unsigned));
+                file_out_stream.write((char *)&edge_iterator->is_roundabout, sizeof(bool));
+                file_out_stream.write((char *)&edge_iterator->is_in_tiny_cc, sizeof(bool));
+                file_out_stream.write((char *)&edge_iterator->is_access_restricted, sizeof(bool));
+                file_out_stream.write((char *)&edge_iterator->is_contra_flow, sizeof(bool));
+                file_out_stream.write((char *)&edge_iterator->is_split, sizeof(bool));
                 ++number_of_used_edges;
             }
             ++edge_iterator;
         }
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
+
         std::cout << "[extractor] setting number of edges   ... " << std::flush;
 
         file_out_stream.seekp(previous_file_position);
-        file_out_stream.write((char*)&number_of_used_edges, sizeof(unsigned));
+        file_out_stream.write((char *)&number_of_used_edges, sizeof(unsigned));
         file_out_stream.close();
         std::cout << "ok" << std::endl;
-        time = get_timestamp();
+        time1 = std::chrono::steady_clock::now();
 
         std::cout << "[extractor] writing street name index ... " << std::flush;
         std::string name_file_streamName = (output_file_name + ".names");
-        boost::filesystem::ofstream name_file_stream(
-            name_file_streamName,
-            std::ios::binary
-        );
+        boost::filesystem::ofstream name_file_stream(name_file_streamName, std::ios::binary);
 
-        //write number of names
-        const unsigned number_of_names = name_list.size()+1;
+        // write number of names
+        const unsigned number_of_names = name_list.size() + 1;
         name_file_stream.write((char *)&(number_of_names), sizeof(unsigned));
 
-        //compute total number of chars
+        // compute total number of chars
         unsigned total_number_of_chars = 0;
-        BOOST_FOREACH(const std::string & temp_string, name_list) {
+        for (const std::string &temp_string : name_list)
+        {
             total_number_of_chars += temp_string.length();
         }
-        //write total number of chars
-        name_file_stream.write(
-            (char *)&(total_number_of_chars),
-            sizeof(unsigned)
-        );
-        //write prefixe sums
+        // write total number of chars
+        name_file_stream.write((char *)&(total_number_of_chars), sizeof(unsigned));
+        // write prefixe sums
         unsigned name_lengths_prefix_sum = 0;
-        BOOST_FOREACH(const std::string & temp_string, name_list) {
-            name_file_stream.write(
-                (char *)&(name_lengths_prefix_sum),
-                sizeof(unsigned)
-            );
+        for (const std::string &temp_string : name_list)
+        {
+            name_file_stream.write((char *)&(name_lengths_prefix_sum), sizeof(unsigned));
             name_lengths_prefix_sum += temp_string.length();
         }
-        //duplicate on purpose!
-        name_file_stream.write(
-            (char *)&(name_lengths_prefix_sum),
-            sizeof(unsigned)
-        );
+        // duplicate on purpose!
+        name_file_stream.write((char *)&(name_lengths_prefix_sum), sizeof(unsigned));
 
-        //write all chars consecutively
-        BOOST_FOREACH(const std::string & temp_string, name_list) {
+        // write all chars consecutively
+        for (const std::string &temp_string : name_list)
+        {
             const unsigned string_length = temp_string.length();
             name_file_stream.write(temp_string.c_str(), string_length);
         }
 
         name_file_stream.close();
-        std::cout << "ok, after " << get_timestamp() - time << "s" << std::endl;
-        SimpleLogger().Write() << "Processed " <<
-            number_of_used_nodes << " nodes and " <<
-            number_of_used_edges << " edges";
+        time2 = std::chrono::steady_clock::now();
+        elapsed_seconds = time2 - time1;
+        std::cout << "ok, after " << elapsed_seconds.count() << "s" << std::endl;
 
-    } catch ( const std::exception& e ) {
-        std::cerr <<  "Caught Execption:" << e.what() << std::endl;
+        SimpleLogger().Write() << "Processed " << number_of_used_nodes << " nodes and "
+                               << number_of_used_edges << " edges";
     }
+    catch (const std::exception &e) { std::cerr << "Caught Execption:" << e.what() << std::endl; }
 }
-

Extractor/ExtractionContainers.h

@@ -35,31 +35,31 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <stxxl/vector>
 
-class ExtractionContainers {
-public:
-    typedef stxxl::vector<NodeID>                    STXXLNodeIDVector;
-    typedef stxxl::vector<ExternalMemoryNode>        STXXLNodeVector;
-    typedef stxxl::vector<InternalExtractorEdge>     STXXLEdgeVector;
-    typedef stxxl::vector<std::string>               STXXLStringVector;
+class ExtractionContainers
+{
+    constexpr static unsigned stxxl_memory = ((sizeof(std::size_t) == 4) ? std::numeric_limits<int>::max() : std::numeric_limits<unsigned>::max());
+  public:
+    typedef stxxl::vector<NodeID> STXXLNodeIDVector;
+    typedef stxxl::vector<ExternalMemoryNode> STXXLNodeVector;
+    typedef stxxl::vector<InternalExtractorEdge> STXXLEdgeVector;
+    typedef stxxl::vector<std::string> STXXLStringVector;
     typedef stxxl::vector<InputRestrictionContainer> STXXLRestrictionsVector;
-    typedef stxxl::vector<_WayIDStartAndEndEdge>     STXXLWayIDStartEndVector;
+    typedef stxxl::vector<WayIDStartAndEndEdge> STXXLWayIDStartEndVector;
 
-    STXXLNodeIDVector                               used_node_id_list;
-    STXXLNodeVector                                 all_nodes_list;
-    STXXLEdgeVector                                 all_edges_list;
-    STXXLStringVector                               name_list;
-    STXXLRestrictionsVector                         restrictions_list;
-    STXXLWayIDStartEndVector                        way_start_end_id_list;
+    STXXLNodeIDVector used_node_id_list;
+    STXXLNodeVector all_nodes_list;
+    STXXLEdgeVector all_edges_list;
+    STXXLStringVector name_list;
+    STXXLRestrictionsVector restrictions_list;
+    STXXLWayIDStartEndVector way_start_end_id_list;
     const UUID uuid;
 
     ExtractionContainers();
 
     virtual ~ExtractionContainers();
 
-    void PrepareData(
-        const std::string & output_file_name,
-        const std::string & restrictions_file_name
-    );
+    void PrepareData(const std::string &output_file_name,
+                     const std::string &restrictions_file_name);
 };
 
 #endif /* EXTRACTIONCONTAINERS_H_ */

Extractor/ExtractionHelperFunctions.h

@@ -25,63 +25,65 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef EXTRACTIONHELPERFUNCTIONS_H_
-#define EXTRACTIONHELPERFUNCTIONS_H_
+#ifndef EXTRACTION_HELPER_FUNCTIONS_H
+#define EXTRACTION_HELPER_FUNCTIONS_H
 
 #include "../Util/StringUtil.h"
 
 #include <boost/algorithm/string.hpp>
 #include <boost/algorithm/string_regex.hpp>
 #include <boost/regex.hpp>
-#include <climits>
+
+#include <limits>
 
 namespace qi = boost::spirit::qi;
 
-//TODO: Move into LUA
+// TODO: Move into LUA
 
-inline bool durationIsValid(const std::string &s) {
-    boost::regex e ("((\\d|\\d\\d):(\\d|\\d\\d):(\\d|\\d\\d))|((\\d|\\d\\d):(\\d|\\d\\d))|(\\d|\\d\\d)",boost::regex_constants::icase|boost::regex_constants::perl);
+inline bool durationIsValid(const std::string &s)
+{
+    boost::regex e(
+        "((\\d|\\d\\d):(\\d|\\d\\d):(\\d|\\d\\d))|((\\d|\\d\\d):(\\d|\\d\\d))|(\\d|\\d\\d)",
+        boost::regex_constants::icase | boost::regex_constants::perl);
 
-    std::vector< std::string > result;
-    boost::algorithm::split_regex( result, s, boost::regex( ":" ) ) ;
+    std::vector<std::string> result;
+    boost::algorithm::split_regex(result, s, boost::regex(":"));
     bool matched = regex_match(s, e);
     return matched;
 }
 
-inline unsigned parseDuration(const std::string &s) {
-	unsigned hours = 0;
+inline unsigned parseDuration(const std::string &s)
+{
+    unsigned hours = 0;
     unsigned minutes = 0;
     unsigned seconds = 0;
-    boost::regex e ("((\\d|\\d\\d):(\\d|\\d\\d):(\\d|\\d\\d))|((\\d|\\d\\d):(\\d|\\d\\d))|(\\d|\\d\\d)",boost::regex_constants::icase|boost::regex_constants::perl);
+    boost::regex e(
+        "((\\d|\\d\\d):(\\d|\\d\\d):(\\d|\\d\\d))|((\\d|\\d\\d):(\\d|\\d\\d))|(\\d|\\d\\d)",
+        boost::regex_constants::icase | boost::regex_constants::perl);
 
-    std::vector< std::string > result;
-    boost::algorithm::split_regex( result, s, boost::regex( ":" ) ) ;
+    std::vector<std::string> result;
+    boost::algorithm::split_regex(result, s, boost::regex(":"));
     bool matched = regex_match(s, e);
-    if(matched) {
-    	if(1 == result.size()) {
-    		minutes = stringToInt(result[0]);
-    	}
-    	if(2 == result.size()) {
-    		minutes =  stringToInt(result[1]);
-    		hours = stringToInt(result[0]);
-    	}
-    	if(3 == result.size()) {
+    if (matched)
+    {
+        if (1 == result.size())
+        {
+            minutes = stringToInt(result[0]);
+        }
+        if (2 == result.size())
+        {
+            minutes = stringToInt(result[1]);
+            hours = stringToInt(result[0]);
+        }
+        if (3 == result.size())
+        {
             seconds = stringToInt(result[2]);
             minutes = stringToInt(result[1]);
-            hours   = stringToInt(result[0]);
-    	}
-        return 10*(3600*hours+60*minutes+seconds);
+            hours = stringToInt(result[0]);
+        }
+        return 10 * (3600 * hours + 60 * minutes + seconds);
     }
-    return UINT_MAX;
+    return std::numeric_limits<unsigned>::max();
 }
 
-// inline int parseMaxspeed(std::string input) { //call-by-value on purpose.
-//     boost::algorithm::to_lower(input);
-//     int n = stringToInt(input);
-//     if (input.find("mph") != std::string::npos || input.find("mp/h") != std::string::npos) {
-//         n = (n*1609)/1000;
-//     }
-//     return n;
-// }
-
-#endif /* EXTRACTIONHELPERFUNCTIONS_H_ */
+#endif // EXTRACTION_HELPER_FUNCTIONS_H_

Extractor/ExtractionWay.h

@@ -34,14 +34,14 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <string>
 #include <vector>
 
-struct ExtractionWay {
-    ExtractionWay() {
-        Clear();
-    }
+struct ExtractionWay
+{
+    ExtractionWay() { Clear(); }
 
-    inline void Clear(){
-        id = UINT_MAX;
-        nameID = UINT_MAX;
+    inline void Clear()
+    {
+        id = SPECIAL_NODEID;
+        nameID = INVALID_NAMEID;
         path.clear();
         keyVals.clear();
         direction = ExtractionWay::notSure;
@@ -55,9 +55,11 @@ struct ExtractionWay {
         ignoreInGrid = false;
     }
 
-    enum Directions {
-        notSure = 0, oneway, bidirectional, opposite
-    };
+    enum Directions
+    { notSure = 0,
+      oneway,
+      bidirectional,
+      opposite };
     unsigned id;
     unsigned nameID;
     double speed;
@@ -70,9 +72,8 @@ struct ExtractionWay {
     bool roundabout;
     bool isAccessRestricted;
     bool ignoreInGrid;
-    std::vector< NodeID > path;
+    std::vector<NodeID> path;
     HashTable<std::string, std::string> keyVals;
 };
 
-
-#endif //EXTRACTION_WAY_H
+#endif // EXTRACTION_WAY_H

Extractor/ExtractorCallbacks.cpp

@@ -35,120 +35,132 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <osrm/Coordinate.h>
 
+#include <limits>
 #include <string>
 #include <vector>
 
-ExtractorCallbacks::ExtractorCallbacks()
- :
-    string_map(NULL),
-    externalMemory(NULL)
-{ }
-
-ExtractorCallbacks::ExtractorCallbacks(
-    ExtractionContainers * ext,
-    boost::unordered_map<std::string, NodeID> * string_map
-) :
-    string_map(string_map),
-    externalMemory(ext)
-{ }
-
-ExtractorCallbacks::~ExtractorCallbacks() { }
+ExtractorCallbacks::ExtractorCallbacks(ExtractionContainers &extraction_containers,
+                                       std::unordered_map<std::string, NodeID> &string_map)
+    : string_map(string_map), external_memory(extraction_containers)
+{
+}
 
 /** warning: caller needs to take care of synchronization! */
-void ExtractorCallbacks::nodeFunction(const ExternalMemoryNode &n) {
-    if(n.lat <= 85*COORDINATE_PRECISION && n.lat >= -85*COORDINATE_PRECISION) {
-        externalMemory->all_nodes_list.push_back(n);
+void ExtractorCallbacks::ProcessNode(const ExternalMemoryNode &n)
+{
+    if (n.lat <= 85 * COORDINATE_PRECISION && n.lat >= -85 * COORDINATE_PRECISION)
+    {
+        external_memory.all_nodes_list.push_back(n);
     }
 }
 
-bool ExtractorCallbacks::restrictionFunction(const InputRestrictionContainer &r) {
-    externalMemory->restrictions_list.push_back(r);
+bool ExtractorCallbacks::ProcessRestriction(const InputRestrictionContainer &restriction)
+{
+    external_memory.restrictions_list.push_back(restriction);
     return true;
 }
 
 /** warning: caller needs to take care of synchronization! */
-void ExtractorCallbacks::wayFunction(ExtractionWay &parsed_way) {
-    if((0 < parsed_way.speed) || (0 < parsed_way.duration)) { //Only true if the way is specified by the speed profile
-        if(UINT_MAX == parsed_way.id){
-            SimpleLogger().Write(logDEBUG) <<
-                "found bogus way with id: " << parsed_way.id <<
-                " of size " << parsed_way.path.size();
-            return;
-        }
-
-        if(0 < parsed_way.duration) {
-         //TODO: iterate all way segments and set duration corresponding to the length of each segment
-            parsed_way.speed = parsed_way.duration/(parsed_way.path.size()-1);
-        }
-
-        if(std::numeric_limits<double>::epsilon() >= std::abs(-1. - parsed_way.speed)){
-            SimpleLogger().Write(logDEBUG) <<
-                "found way with bogus speed, id: " << parsed_way.id;
-            return;
-        }
-
-        //Get the unique identifier for the street name
-        const boost::unordered_map<std::string, NodeID>::const_iterator & string_map_iterator = string_map->find(parsed_way.name);
-        if(string_map->end() == string_map_iterator) {
-            parsed_way.nameID = externalMemory->name_list.size();
-            externalMemory->name_list.push_back(parsed_way.name);
-            string_map->insert(std::make_pair(parsed_way.name, parsed_way.nameID));
-        } else {
-            parsed_way.nameID = string_map_iterator->second;
-        }
-
-        if(ExtractionWay::opposite == parsed_way.direction) {
-            std::reverse( parsed_way.path.begin(), parsed_way.path.end() );
-            parsed_way.direction = ExtractionWay::oneway;
-        }
-
-        const bool split_bidirectional_edge = (parsed_way.backward_speed > 0) && (parsed_way.speed != parsed_way.backward_speed);
-
-        for(std::vector< NodeID >::size_type n = 0; n < parsed_way.path.size()-1; ++n) {
-            externalMemory->all_edges_list.push_back(
-                    InternalExtractorEdge(
-                        parsed_way.path[n],
-                        parsed_way.path[n+1],
-                        parsed_way.type,
-                        (split_bidirectional_edge ? ExtractionWay::oneway : parsed_way.direction),
-                        parsed_way.speed,
-                        parsed_way.nameID,
-                        parsed_way.roundabout,
-                        parsed_way.ignoreInGrid,
-                        (0 < parsed_way.duration),
-                        parsed_way.isAccessRestricted,
-                        false,
-                        split_bidirectional_edge
-                    )
-            );
-            externalMemory->used_node_id_list.push_back(parsed_way.path[n]);
-        }
-        externalMemory->used_node_id_list.push_back(parsed_way.path.back());
-
-        //The following information is needed to identify start and end segments of restrictions
-        externalMemory->way_start_end_id_list.push_back(_WayIDStartAndEndEdge(parsed_way.id, parsed_way.path[0], parsed_way.path[1], parsed_way.path[parsed_way.path.size()-2], parsed_way.path.back()));
-
-        if(split_bidirectional_edge) { //Only true if the way should be split
-            std::reverse( parsed_way.path.begin(), parsed_way.path.end() );
-            for(std::vector< NodeID >::size_type n = 0; n < parsed_way.path.size()-1; ++n) {
-                externalMemory->all_edges_list.push_back(
-                        InternalExtractorEdge(
-                            parsed_way.path[n],
-                            parsed_way.path[n+1],
-                            parsed_way.type,
-                            ExtractionWay::oneway,
-                            parsed_way.backward_speed,
-                            parsed_way.nameID,
-                            parsed_way.roundabout,
-                            parsed_way.ignoreInGrid,
-                            (0 < parsed_way.duration),
-                            parsed_way.isAccessRestricted,
-                            (ExtractionWay::oneway == parsed_way.direction),
-                            split_bidirectional_edge
-                        )
-                );
-            }
-            externalMemory->way_start_end_id_list.push_back(_WayIDStartAndEndEdge(parsed_way.id, parsed_way.path[0], parsed_way.path[1], parsed_way.path[parsed_way.path.size()-2], parsed_way.path.back()));
+void ExtractorCallbacks::ProcessWay(ExtractionWay &parsed_way)
+{
+    if ((0 >= parsed_way.speed) && (0 >= parsed_way.duration))
+    { // Only true if the way is specified by the speed profile
+        return;
+    }
+
+    if (std::numeric_limits<unsigned>::max() == parsed_way.id)
+    {
+        SimpleLogger().Write(logDEBUG) << "found bogus way with id: " << parsed_way.id
+                                       << " of size " << parsed_way.path.size();
+        return;
+    }
+
+    if (0 < parsed_way.duration)
+    {
+        // TODO: iterate all way segments and set duration corresponding to the length of each
+        // segment
+        parsed_way.speed = parsed_way.duration / (parsed_way.path.size() - 1);
+    }
+
+    if (std::numeric_limits<double>::epsilon() >= std::abs(-1. - parsed_way.speed))
+    {
+        SimpleLogger().Write(logDEBUG) << "found way with bogus speed, id: " << parsed_way.id;
+        return;
+    }
+
+    // Get the unique identifier for the street name
+    const auto &string_map_iterator = string_map.find(parsed_way.name);
+    if (string_map.end() == string_map_iterator)
+    {
+        parsed_way.nameID = external_memory.name_list.size();
+        external_memory.name_list.push_back(parsed_way.name);
+        string_map.insert(std::make_pair(parsed_way.name, parsed_way.nameID));
+    }
+    else
+    {
+        parsed_way.nameID = string_map_iterator->second;
+    }
+
+    if (ExtractionWay::opposite == parsed_way.direction)
+    {
+        std::reverse(parsed_way.path.begin(), parsed_way.path.end());
+        parsed_way.direction = ExtractionWay::oneway;
+    }
+
+    const bool split_bidirectional_edge =
+        (parsed_way.backward_speed > 0) && (parsed_way.speed != parsed_way.backward_speed);
+
+    for (unsigned n = 0; n < parsed_way.path.size() - 1; ++n)
+    {
+        external_memory.all_edges_list.push_back(InternalExtractorEdge(
+            parsed_way.path[n],
+            parsed_way.path[n + 1],
+            parsed_way.type,
+            (split_bidirectional_edge ? ExtractionWay::oneway : parsed_way.direction),
+            parsed_way.speed,
+            parsed_way.nameID,
+            parsed_way.roundabout,
+            parsed_way.ignoreInGrid,
+            (0 < parsed_way.duration),
+            parsed_way.isAccessRestricted,
+            false,
+            split_bidirectional_edge));
+        external_memory.used_node_id_list.push_back(parsed_way.path[n]);
+    }
+    external_memory.used_node_id_list.push_back(parsed_way.path.back());
+
+    // The following information is needed to identify start and end segments of restrictions
+    external_memory.way_start_end_id_list.push_back(
+        WayIDStartAndEndEdge(parsed_way.id,
+                             parsed_way.path[0],
+                             parsed_way.path[1],
+                             parsed_way.path[parsed_way.path.size() - 2],
+                             parsed_way.path.back()));
+
+    if (split_bidirectional_edge)
+    { // Only true if the way should be split
+        std::reverse(parsed_way.path.begin(), parsed_way.path.end());
+        for (std::vector<NodeID>::size_type n = 0; n < parsed_way.path.size() - 1; ++n)
+        {
+            external_memory.all_edges_list.push_back(
+                InternalExtractorEdge(parsed_way.path[n],
+                                      parsed_way.path[n + 1],
+                                      parsed_way.type,
+                                      ExtractionWay::oneway,
+                                      parsed_way.backward_speed,
+                                      parsed_way.nameID,
+                                      parsed_way.roundabout,
+                                      parsed_way.ignoreInGrid,
+                                      (0 < parsed_way.duration),
+                                      parsed_way.isAccessRestricted,
+                                      (ExtractionWay::oneway == parsed_way.direction),
+                                      split_bidirectional_edge));
         }
+        external_memory.way_start_end_id_list.push_back(
+            WayIDStartAndEndEdge(parsed_way.id,
+                                 parsed_way.path[0],
+                                 parsed_way.path[1],
+                                 parsed_way.path[parsed_way.path.size() - 2],
+                                 parsed_way.path.back()));
     }
 }

Extractor/ExtractorCallbacks.h

@@ -25,12 +25,12 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef EXTRACTORCALLBACKS_H_
-#define EXTRACTORCALLBACKS_H_
+#ifndef EXTRACTOR_CALLBACKS_H
+#define EXTRACTOR_CALLBACKS_H
 
 #include "../typedefs.h"
 
-#include <boost/unordered_map.hpp>
+#include <unordered_map>
 #include <string>
 
 struct ExternalMemoryNode;
@@ -38,29 +38,26 @@ class ExtractionContainers;
 struct ExtractionWay;
 struct InputRestrictionContainer;
 
-class ExtractorCallbacks{
-private:
+class ExtractorCallbacks
+{
+  private:
+    std::unordered_map<std::string, NodeID> &string_map;
+    ExtractionContainers &external_memory;
 
-    boost::unordered_map<std::string, NodeID> * string_map;
-    ExtractionContainers * externalMemory;
+  public:
+    ExtractorCallbacks() = delete;
+    ExtractorCallbacks(const ExtractorCallbacks &) = delete;
+    explicit ExtractorCallbacks(ExtractionContainers &extraction_containers,
+                                std::unordered_map<std::string, NodeID> &string_map);
 
-    ExtractorCallbacks();
-public:
-    explicit ExtractorCallbacks(
-        ExtractionContainers * ext,
-        boost::unordered_map<std::string, NodeID> * string_map
-    );
+    // warning: caller needs to take care of synchronization!
+    void ProcessNode(const ExternalMemoryNode &node);
 
-    ~ExtractorCallbacks();
-
-    /** warning: caller needs to take care of synchronization! */
-    void nodeFunction(const ExternalMemoryNode &n);
-
-    bool restrictionFunction(const InputRestrictionContainer &r);
-
-    /** warning: caller needs to take care of synchronization! */
-    void wayFunction(ExtractionWay &w);
+    // warning: caller needs to take care of synchronization!
+    bool ProcessRestriction(const InputRestrictionContainer &restriction);
 
+    // warning: caller needs to take care of synchronization!
+    void ProcessWay(ExtractionWay &way);
 };
 
-#endif /* EXTRACTORCALLBACKS_H_ */
+#endif /* EXTRACTOR_CALLBACKS_H */

Extractor/ExtractorStructs.h

@@ -32,99 +32,83 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../DataStructures/ImportNode.h"
 #include "../typedefs.h"
 
+#include <limits>
 #include <string>
 
-struct ExtractorRelation {
-    ExtractorRelation() : type(unknown){}
-    enum {
-        unknown = 0, ferry, turnRestriction
-    } type;
+struct ExtractorRelation
+{
+    ExtractorRelation() : type(unknown) {}
+    enum
+    { unknown = 0,
+      ferry,
+      turnRestriction } type;
     HashTable<std::string, std::string> keyVals;
 };
 
-struct _WayIDStartAndEndEdge {
+struct WayIDStartAndEndEdge
+{
     unsigned wayID;
     NodeID firstStart;
     NodeID firstTarget;
     NodeID lastStart;
     NodeID lastTarget;
-    _WayIDStartAndEndEdge()
-     :
-        wayID(UINT_MAX),
-        firstStart(UINT_MAX),
-        firstTarget(UINT_MAX),
-        lastStart(UINT_MAX),
-        lastTarget(UINT_MAX)
-    { }
-
-    explicit _WayIDStartAndEndEdge(
-        unsigned w,
-        NodeID fs,
-        NodeID ft,
-        NodeID ls,
-        NodeID lt
-    ) :
-        wayID(w),
-        firstStart(fs),
-        firstTarget(ft),
-        lastStart(ls),
-        lastTarget(lt)
-    { }
-
-    static _WayIDStartAndEndEdge min_value() {
-        return _WayIDStartAndEndEdge((std::numeric_limits<unsigned>::min)(), (std::numeric_limits<unsigned>::min)(), (std::numeric_limits<unsigned>::min)(), (std::numeric_limits<unsigned>::min)(), (std::numeric_limits<unsigned>::min)());
+    WayIDStartAndEndEdge()
+        : wayID(std::numeric_limits<unsigned>::max()), firstStart(std::numeric_limits<unsigned>::max()), firstTarget(std::numeric_limits<unsigned>::max()), lastStart(std::numeric_limits<unsigned>::max()),
+          lastTarget(std::numeric_limits<unsigned>::max())
+    {
     }
-    static _WayIDStartAndEndEdge max_value() {
-        return _WayIDStartAndEndEdge((std::numeric_limits<unsigned>::max)(), (std::numeric_limits<unsigned>::max)(), (std::numeric_limits<unsigned>::max)(), (std::numeric_limits<unsigned>::max)(), (std::numeric_limits<unsigned>::max)());
+
+    explicit WayIDStartAndEndEdge(unsigned w, NodeID fs, NodeID ft, NodeID ls, NodeID lt)
+        : wayID(w), firstStart(fs), firstTarget(ft), lastStart(ls), lastTarget(lt)
+    {
+    }
+
+    static WayIDStartAndEndEdge min_value()
+    {
+        return WayIDStartAndEndEdge((std::numeric_limits<unsigned>::min)(),
+                                    (std::numeric_limits<unsigned>::min)(),
+                                    (std::numeric_limits<unsigned>::min)(),
+                                    (std::numeric_limits<unsigned>::min)(),
+                                    (std::numeric_limits<unsigned>::min)());
+    }
+    static WayIDStartAndEndEdge max_value()
+    {
+        return WayIDStartAndEndEdge((std::numeric_limits<unsigned>::max)(),
+                                    (std::numeric_limits<unsigned>::max)(),
+                                    (std::numeric_limits<unsigned>::max)(),
+                                    (std::numeric_limits<unsigned>::max)(),
+                                    (std::numeric_limits<unsigned>::max)());
     }
 };
 
-struct CmpWayByID {
-    typedef _WayIDStartAndEndEdge value_type;
-    bool operator ()(
-        const _WayIDStartAndEndEdge & a,
-        const _WayIDStartAndEndEdge & b
-    ) const {
+struct CmpWayByID
+{
+    typedef WayIDStartAndEndEdge value_type;
+    bool operator()(const WayIDStartAndEndEdge &a, const WayIDStartAndEndEdge &b) const
+    {
         return a.wayID < b.wayID;
     }
-    value_type max_value() {
-        return _WayIDStartAndEndEdge::max_value();
-    }
-    value_type min_value() {
-        return _WayIDStartAndEndEdge::min_value();
-    }
+    value_type max_value() { return WayIDStartAndEndEdge::max_value(); }
+    value_type min_value() { return WayIDStartAndEndEdge::min_value(); }
 };
 
-struct Cmp {
+struct Cmp
+{
     typedef NodeID value_type;
-    bool operator ()(
-        const NodeID a,
-        const NodeID b
-    ) const {
-        return a < b;
-    }
-    value_type max_value() {
-        return 0xffffffff;
-    }
-    value_type min_value() {
-        return 0x0;
-    }
+    bool operator()(const NodeID a, const NodeID b) const { return a < b; }
+    value_type max_value() { return 0xffffffff; }
+    value_type min_value() { return 0x0; }
 };
 
-struct CmpNodeByID {
+struct CmpNodeByID
+{
     typedef ExternalMemoryNode value_type;
-    bool operator () (
-        const ExternalMemoryNode & a,
-        const ExternalMemoryNode & b
-    ) const {
+    bool operator()(const ExternalMemoryNode &a, const ExternalMemoryNode &b) const
+    {
         return a.id < b.id;
     }
-    value_type max_value()  {
-        return ExternalMemoryNode::max_value();
-    }
-    value_type min_value() {
-        return ExternalMemoryNode::min_value();
-    }
+    value_type max_value() { return ExternalMemoryNode::max_value(); }
+    value_type min_value() { return ExternalMemoryNode::min_value(); }
 };
 
 #endif /* EXTRACTORSTRUCTS_H_ */

Extractor/InternalExtractorEdge.h

@@ -28,92 +28,49 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef INTERNAL_EXTRACTOR_EDGE_H
 #define INTERNAL_EXTRACTOR_EDGE_H
 
-
 #include "../typedefs.h"
 #include <osrm/Coordinate.h>
 
 #include <boost/assert.hpp>
 
-struct InternalExtractorEdge {
+struct InternalExtractorEdge
+{
     InternalExtractorEdge()
-     :
-        start(0),
-        target(0),
-        type(0),
-        direction(0),
-        speed(0),
-        nameID(0),
-        isRoundabout(false),
-        ignoreInGrid(false),
-        isDurationSet(false),
-        isAccessRestricted(false),
-        isContraFlow(false),
-        is_split(false)
-    { }
+        : start(0), target(0), type(0), direction(0), speed(0), name_id(0), is_roundabout(false),
+          is_in_tiny_cc(false), is_duration_set(false), is_access_restricted(false),
+          is_contra_flow(false), is_split(false)
+    {
+    }
 
-
-    explicit InternalExtractorEdge(
-        NodeID start,
-        NodeID target,
-        short type,
-        short direction,
-        double speed,
-        unsigned nameID,
-        bool isRoundabout,
-        bool ignoreInGrid,
-        bool isDurationSet,
-        bool isAccressRestricted,
-        bool isContraFlow,
-        bool is_split
-    ) :
-        start(start),
-        target(target),
-        type(type),
-        direction(direction),
-        speed(speed),
-        nameID(nameID),
-        isRoundabout(isRoundabout),
-        ignoreInGrid(ignoreInGrid),
-        isDurationSet(isDurationSet),
-        isAccessRestricted(isAccressRestricted),
-        isContraFlow(isContraFlow),
-        is_split(is_split)
+    explicit InternalExtractorEdge(NodeID start,
+                                   NodeID target,
+                                   short type,
+                                   short direction,
+                                   double speed,
+                                   unsigned name_id,
+                                   bool is_roundabout,
+                                   bool is_in_tiny_cc,
+                                   bool is_duration_set,
+                                   bool is_access_restricted,
+                                   bool is_contra_flow,
+                                   bool is_split)
+        : start(start), target(target), type(type), direction(direction), speed(speed),
+          name_id(name_id), is_roundabout(is_roundabout), is_in_tiny_cc(is_in_tiny_cc),
+          is_duration_set(is_duration_set), is_access_restricted(is_access_restricted),
+          is_contra_flow(is_contra_flow), is_split(is_split)
     {
         BOOST_ASSERT(0 <= type);
     }
 
     // necessary static util functions for stxxl's sorting
-    static InternalExtractorEdge min_value() {
-        return InternalExtractorEdge(
-            0,
-            0,
-            0,
-            0,
-            0,
-            0,
-            false,
-            false,
-            false,
-            false,
-            false,
-            false
-        );
+    static InternalExtractorEdge min_value()
+    {
+        return InternalExtractorEdge(0, 0, 0, 0, 0, 0, false, false, false, false, false, false);
     }
-    static InternalExtractorEdge max_value() {
+    static InternalExtractorEdge max_value()
+    {
         return InternalExtractorEdge(
-            std::numeric_limits<unsigned>::max(),
-            std::numeric_limits<unsigned>::max(),
-            0,
-            0,
-            0,
-            0,
-            false,
-            false,
-            false,
-            false,
-            false,
-            false
-        );
+            SPECIAL_NODEID, SPECIAL_NODEID, 0, 0, 0, 0, false, false, false, false, false, false);
     }
 
     NodeID start;
@@ -121,53 +78,43 @@ struct InternalExtractorEdge {
     short type;
     short direction;
     double speed;
-    unsigned nameID;
-    bool isRoundabout;
-    bool ignoreInGrid;
-    bool isDurationSet;
-    bool isAccessRestricted;
-    bool isContraFlow;
+    unsigned name_id;
+    bool is_roundabout;
+    bool is_in_tiny_cc;
+    bool is_duration_set;
+    bool is_access_restricted;
+    bool is_contra_flow;
     bool is_split;
 
-    FixedPointCoordinate startCoord;
-    FixedPointCoordinate targetCoord;
+    FixedPointCoordinate source_coordinate;
+    FixedPointCoordinate target_coordinate;
 };
 
-struct CmpEdgeByStartID {
+struct CmpEdgeByStartID
+{
     typedef InternalExtractorEdge value_type;
-    bool operator ()(
-        const InternalExtractorEdge & a,
-        const InternalExtractorEdge & b
-    ) const {
+    bool operator()(const InternalExtractorEdge &a, const InternalExtractorEdge &b) const
+    {
         return a.start < b.start;
     }
 
-    value_type max_value() {
-        return InternalExtractorEdge::max_value();
-    }
+    value_type max_value() { return InternalExtractorEdge::max_value(); }
 
-    value_type min_value() {
-        return InternalExtractorEdge::min_value();
-    }
+    value_type min_value() { return InternalExtractorEdge::min_value(); }
 };
 
-struct CmpEdgeByTargetID {
+struct CmpEdgeByTargetID
+{
     typedef InternalExtractorEdge value_type;
 
-    bool operator ()(
-        const InternalExtractorEdge & a,
-        const InternalExtractorEdge & b
-    ) const {
+    bool operator()(const InternalExtractorEdge &a, const InternalExtractorEdge &b) const
+    {
         return a.target < b.target;
     }
 
-    value_type max_value() {
-        return InternalExtractorEdge::max_value();
-    }
+    value_type max_value() { return InternalExtractorEdge::max_value(); }
 
-    value_type min_value() {
-        return InternalExtractorEdge::min_value();
-    }
+    value_type min_value() { return InternalExtractorEdge::min_value(); }
 };
 
-#endif //INTERNAL_EXTRACTOR_EDGE_H
+#endif // INTERNAL_EXTRACTOR_EDGE_H

Extractor/PBFParser.h

@@ -31,24 +31,24 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "BaseParser.h"
 #include "../DataStructures/ConcurrentQueue.h"
 
-#include <boost/shared_ptr.hpp>
-
 #include <osmpbf/fileformat.pb.h>
 #include <osmpbf/osmformat.pb.h>
 
 #include <fstream>
+#include <memory>
 
-class PBFParser : public BaseParser {
+class PBFParser : public BaseParser
+{
 
-    enum EntityType {
-        TypeDummy     = 0,
-        TypeNode      = 1,
-        TypeWay       = 2,
-        TypeRelation  = 4,
-        TypeDenseNode = 8
-    };
+    enum EntityType
+    { TypeDummy = 0,
+      TypeNode = 1,
+      TypeWay = 2,
+      TypeRelation = 4,
+      TypeDenseNode = 8 };
 
-    struct _ThreadData {
+    struct ParserThreadData
+    {
         int currentGroupID;
         int currentEntityID;
         EntityType entityTypeIndicator;
@@ -62,42 +62,38 @@ class PBFParser : public BaseParser {
         std::vector<char> charBuffer;
     };
 
-public:
-    PBFParser(
-        const char * fileName,
-        ExtractorCallbacks* ec,
-        ScriptingEnvironment& se
-    );
+  public:
+    PBFParser(const char *file_name, ExtractorCallbacks *extractor_callbacks, ScriptingEnvironment &scripting_environment);
     virtual ~PBFParser();
 
     inline bool ReadHeader();
-	inline bool Parse();
+    inline bool Parse();
 
-private:
+  private:
     inline void ReadData();
     inline void ParseData();
-    inline void parseDenseNode   (_ThreadData * threadData);
-    inline void parseNode        (_ThreadData * threadData);
-    inline void parseRelation    (_ThreadData * threadData);
-    inline void parseWay         (_ThreadData * threadData);
+    inline void parseDenseNode(ParserThreadData *thread_data);
+    inline void parseNode(ParserThreadData *thread_data);
+    inline void parseRelation(ParserThreadData *thread_data);
+    inline void parseWay(ParserThreadData *thread_data);
 
-    inline void loadGroup        (_ThreadData * threadData);
-    inline void loadBlock        (_ThreadData * threadData);
-    inline bool readPBFBlobHeader(std::fstream & stream, _ThreadData * threadData);
-    inline bool unpackZLIB       (std::fstream & stream, _ThreadData * threadData);
-    inline bool unpackLZMA       (std::fstream & stream, _ThreadData * threadData);
-    inline bool readBlob         (std::fstream & stream, _ThreadData * threadData);
-    inline bool readNextBlock    (std::fstream & stream, _ThreadData * threadData);
+    inline void loadGroup(ParserThreadData *thread_data);
+    inline void loadBlock(ParserThreadData *thread_data);
+    inline bool readPBFBlobHeader(std::fstream &stream, ParserThreadData *thread_data);
+    inline bool unpackZLIB(std::fstream &stream, ParserThreadData *thread_data);
+    inline bool unpackLZMA(std::fstream &stream, ParserThreadData *thread_data);
+    inline bool readBlob(std::fstream &stream, ParserThreadData *thread_data);
+    inline bool readNextBlock(std::fstream &stream, ParserThreadData *thread_data);
 
     static const int NANO = 1000 * 1000 * 1000;
     static const int MAX_BLOB_HEADER_SIZE = 64 * 1024;
     static const int MAX_BLOB_SIZE = 32 * 1024 * 1024;
 
-    unsigned groupCount;
-    unsigned blockCount;
+    unsigned group_count;
+    unsigned block_count;
 
-    std::fstream input;     // the input stream to parse
-    boost::shared_ptr<ConcurrentQueue < _ThreadData* > > threadDataQueue;
+    std::fstream input; // the input stream to parse
+    std::shared_ptr<ConcurrentQueue<ParserThreadData *>> thread_data_queue;
 };
 
 #endif /* PBFPARSER_H_ */

Extractor/ScriptingEnvironment.cpp

@@ -37,90 +37,88 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../typedefs.h"
 
 ScriptingEnvironment::ScriptingEnvironment() {}
-ScriptingEnvironment::ScriptingEnvironment(const char * fileName) {
-	SimpleLogger().Write() << "Using script " << fileName;
+ScriptingEnvironment::ScriptingEnvironment(const char *file_name)
+{
+    SimpleLogger().Write() << "Using script " << file_name;
 
     // Create a new lua state
-    for(int i = 0; i < omp_get_max_threads(); ++i) {
-        luaStateVector.push_back(luaL_newstate());
+    for (int i = 0; i < omp_get_max_threads(); ++i)
+    {
+        lua_state_vector.push_back(luaL_newstate());
     }
 
-    // Connect LuaBind to this lua state for all threads
+// Connect LuaBind to this lua state for all threads
 #pragma omp parallel
     {
-        lua_State * myLuaState = getLuaStateForThreadID(omp_get_thread_num());
-        luabind::open(myLuaState);
-        //open utility libraries string library;
-        luaL_openlibs(myLuaState);
+        lua_State *lua_state = getLuaStateForThreadID(omp_get_thread_num());
+        luabind::open(lua_state);
+        // open utility libraries string library;
+        luaL_openlibs(lua_state);
 
-        luaAddScriptFolderToLoadPath( myLuaState, fileName );
+        luaAddScriptFolderToLoadPath(lua_state, file_name);
 
         // Add our function to the state's global scope
-        luabind::module(myLuaState) [
+        luabind::module(lua_state)[
             luabind::def("print", LUA_print<std::string>),
             luabind::def("durationIsValid", durationIsValid),
             luabind::def("parseDuration", parseDuration)
         ];
 
-        luabind::module(myLuaState) [
-            luabind::class_<HashTable<std::string, std::string> >("keyVals")
-            .def("Add", &HashTable<std::string, std::string>::Add)
-            .def("Find", &HashTable<std::string, std::string>::Find)
-            .def("Holds", &HashTable<std::string, std::string>::Holds)
-        ];
+        luabind::module(lua_state)[luabind::class_<HashTable<std::string, std::string>>("keyVals")
+                                        .def("Add", &HashTable<std::string, std::string>::Add)
+                                        .def("Find", &HashTable<std::string, std::string>::Find)
+                                        .def("Holds", &HashTable<std::string, std::string>::Holds)];
 
-        luabind::module(myLuaState) [
-            luabind::class_<ImportNode>("Node")
-            .def(luabind::constructor<>())
-            .def_readwrite("lat", &ImportNode::lat)
-            .def_readwrite("lon", &ImportNode::lon)
-            .def_readonly("id", &ImportNode::id)
-            .def_readwrite("bollard", &ImportNode::bollard)
-            .def_readwrite("traffic_light", &ImportNode::trafficLight)
-            .def_readwrite("tags", &ImportNode::keyVals)
-        ];
+        luabind::module(lua_state)[luabind::class_<ImportNode>("Node")
+                                        .def(luabind::constructor<>())
+                                        .def_readwrite("lat", &ImportNode::lat)
+                                        .def_readwrite("lon", &ImportNode::lon)
+                                        .def_readonly("id", &ImportNode::id)
+                                        .def_readwrite("bollard", &ImportNode::bollard)
+                                        .def_readwrite("traffic_light", &ImportNode::trafficLight)
+                                        .def_readwrite("tags", &ImportNode::keyVals)];
 
-        luabind::module(myLuaState) [
-            luabind::class_<ExtractionWay>("Way")
-            .def(luabind::constructor<>())
-            .def_readonly("id", &ExtractionWay::id)
-            .def_readwrite("name", &ExtractionWay::name)
-            .def_readwrite("speed", &ExtractionWay::speed)
-            .def_readwrite("backward_speed", &ExtractionWay::backward_speed)
-            .def_readwrite("duration", &ExtractionWay::duration)
-            .def_readwrite("type", &ExtractionWay::type)
-            .def_readwrite("access", &ExtractionWay::access)
-            .def_readwrite("roundabout", &ExtractionWay::roundabout)
-            .def_readwrite("is_access_restricted", &ExtractionWay::isAccessRestricted)
-            .def_readwrite("ignore_in_grid", &ExtractionWay::ignoreInGrid)
-            .def_readwrite("tags", &ExtractionWay::keyVals)
-            .def_readwrite("direction", &ExtractionWay::direction)
-            .enum_("constants") [
-				  luabind::value("notSure", 0),
-				  luabind::value("oneway", 1),
-				  luabind::value("bidirectional", 2),
-				  luabind::value("opposite", 3)
-			]
-    	];
+        luabind::module(lua_state)
+            [luabind::class_<ExtractionWay>("Way")
+                 .def(luabind::constructor<>())
+                 .def_readonly("id", &ExtractionWay::id)
+                 .def_readwrite("name", &ExtractionWay::name)
+                 .def_readwrite("speed", &ExtractionWay::speed)
+                 .def_readwrite("backward_speed", &ExtractionWay::backward_speed)
+                 .def_readwrite("duration", &ExtractionWay::duration)
+                 .def_readwrite("type", &ExtractionWay::type)
+                 .def_readwrite("access", &ExtractionWay::access)
+                 .def_readwrite("roundabout", &ExtractionWay::roundabout)
+                 .def_readwrite("is_access_restricted", &ExtractionWay::isAccessRestricted)
+                 .def_readwrite("ignore_in_grid", &ExtractionWay::ignoreInGrid)
+                 .def_readwrite("tags", &ExtractionWay::keyVals)
+                 .def_readwrite("direction", &ExtractionWay::direction)
+                 .enum_("constants")[
+                     luabind::value("notSure", 0),
+                     luabind::value("oneway", 1),
+                     luabind::value("bidirectional", 2),
+                     luabind::value("opposite", 3)
+                 ]];
 
         // fails on c++11/OS X 10.9
-        luabind::module(myLuaState) [
-            luabind::class_<std::vector<std::string> >("vector")
-            .def("Add", static_cast<void (std::vector<std::string>::*)(const std::string&)>(&std::vector<std::string>::push_back))
-        ];
+        luabind::module(lua_state)[luabind::class_<std::vector<std::string>>("vector").def(
+            "Add",
+            static_cast<void (std::vector<std::string>::*)(const std::string &)>(
+                &std::vector<std::string>::push_back))];
 
-        if(0 != luaL_dofile(myLuaState, fileName) ) {
+        if (0 != luaL_dofile(lua_state, file_name))
+        {
             throw OSRMException("ERROR occured in scripting block");
         }
     }
 }
 
-ScriptingEnvironment::~ScriptingEnvironment() {
-    for(unsigned i = 0; i < luaStateVector.size(); ++i) {
-        //        luaStateVector[i];
+ScriptingEnvironment::~ScriptingEnvironment()
+{
+    for (unsigned i = 0; i < lua_state_vector.size(); ++i)
+    {
+        //        lua_state_vector[i];
     }
 }
 
-lua_State * ScriptingEnvironment::getLuaStateForThreadID(const int id) {
-    return luaStateVector[id];
-}
+lua_State *ScriptingEnvironment::getLuaStateForThreadID(const int id) { return lua_state_vector[id]; }

Extractor/ScriptingEnvironment.h

@@ -32,15 +32,16 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 struct lua_State;
 
-class ScriptingEnvironment {
-public:
+class ScriptingEnvironment
+{
+  public:
     ScriptingEnvironment();
-    explicit ScriptingEnvironment(const char * fileName);
+    explicit ScriptingEnvironment(const char *file_name);
     virtual ~ScriptingEnvironment();
 
-    lua_State * getLuaStateForThreadID(const int);
+    lua_State *getLuaStateForThreadID(const int);
 
-    std::vector<lua_State *> luaStateVector;
+    std::vector<lua_State *> lua_state_vector;
 };
 
 #endif /* SCRIPTINGENVIRONMENT_H_ */

Extractor/XMLParser.cpp

@@ -40,8 +40,6 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <osrm/Coordinate.h>
 
-#include <boost/ref.hpp>
-
 XMLParser::XMLParser(const char *filename, ExtractorCallbacks *ec, ScriptingEnvironment &se)
     : BaseParser(ec, se)
 {
@@ -71,19 +69,19 @@ bool XMLParser::Parse()
         {
             ImportNode n = ReadXMLNode();
             ParseNodeInLua(n, lua_state);
-            extractor_callbacks->nodeFunction(n);
+            extractor_callbacks->ProcessNode(n);
         }
 
         if (xmlStrEqual(currentName, (const xmlChar *)"way") == 1)
         {
             ExtractionWay way = ReadXMLWay();
             ParseWayInLua(way, lua_state);
-            extractor_callbacks->wayFunction(way);
+            extractor_callbacks->ProcessWay(way);
         }
         if (use_turn_restrictions && xmlStrEqual(currentName, (const xmlChar *)"relation") == 1)
         {
             InputRestrictionContainer r = ReadXMLRestriction();
-            if ((UINT_MAX != r.fromWay) && !extractor_callbacks->restrictionFunction(r))
+            if ((UINT_MAX != r.fromWay) && !extractor_callbacks->ProcessRestriction(r))
             {
                 std::cerr << "[XMLParser] restriction not parsed" << std::endl;
             }
@@ -103,8 +101,8 @@ InputRestrictionContainer XMLParser::ReadXMLRestriction()
         const int depth = xmlTextReaderDepth(inputReader);
         while (xmlTextReaderRead(inputReader) == 1)
         {
-            const int childType = xmlTextReaderNodeType(inputReader);
-            if (childType != 1 && childType != 15)
+            const int child_type = xmlTextReaderNodeType(inputReader);
+            if (child_type != 1 && child_type != 15)
             {
                 continue;
             }
@@ -114,13 +112,13 @@ InputRestrictionContainer XMLParser::ReadXMLRestriction()
             {
                 continue;
             }
-            if (depth == childDepth && childType == 15 &&
+            if (depth == childDepth && child_type == 15 &&
                 xmlStrEqual(childName, (const xmlChar *)"relation") == 1)
             {
                 xmlFree(childName);
                 break;
             }
-            if (childType != 1)
+            if (child_type != 1)
             {
                 xmlFree(childName);
                 continue;
@@ -204,67 +202,68 @@ InputRestrictionContainer XMLParser::ReadXMLRestriction()
 ExtractionWay XMLParser::ReadXMLWay()
 {
     ExtractionWay way;
-    if (xmlTextReaderIsEmptyElement(inputReader) != 1)
+    if (xmlTextReaderIsEmptyElement(inputReader) == 1)
     {
-        const int depth = xmlTextReaderDepth(inputReader);
-        while (xmlTextReaderRead(inputReader) == 1)
+        return way;
+    }
+    const int depth = xmlTextReaderDepth(inputReader);
+    while (xmlTextReaderRead(inputReader) == 1)
+    {
+        const int child_type = xmlTextReaderNodeType(inputReader);
+        if (child_type != 1 && child_type != 15)
         {
-            const int childType = xmlTextReaderNodeType(inputReader);
-            if (childType != 1 && childType != 15)
-            {
-                continue;
-            }
-            const int childDepth = xmlTextReaderDepth(inputReader);
-            xmlChar *childName = xmlTextReaderName(inputReader);
-            if (childName == NULL)
-            {
-                continue;
-            }
-
-            if (depth == childDepth && childType == 15 &&
-                xmlStrEqual(childName, (const xmlChar *)"way") == 1)
-            {
-                xmlChar *id = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"id");
-                way.id = stringToUint((char *)id);
-                xmlFree(id);
-                xmlFree(childName);
-                break;
-            }
-            if (childType != 1)
-            {
-                xmlFree(childName);
-                continue;
-            }
-
-            if (xmlStrEqual(childName, (const xmlChar *)"tag") == 1)
-            {
-                xmlChar *k = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"k");
-                xmlChar *value = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"v");
-
-                if (k != NULL && value != NULL)
-                {
-                    way.keyVals.Add(std::string((char *)k), std::string((char *)value));
-                }
-                if (k != NULL)
-                {
-                    xmlFree(k);
-                }
-                if (value != NULL)
-                {
-                    xmlFree(value);
-                }
-            }
-            else if (xmlStrEqual(childName, (const xmlChar *)"nd") == 1)
-            {
-                xmlChar *ref = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"ref");
-                if (ref != NULL)
-                {
-                    way.path.push_back(stringToUint((const char *)ref));
-                    xmlFree(ref);
-                }
-            }
-            xmlFree(childName);
+            continue;
         }
+        const int childDepth = xmlTextReaderDepth(inputReader);
+        xmlChar *childName = xmlTextReaderName(inputReader);
+        if (childName == NULL)
+        {
+            continue;
+        }
+
+        if (depth == childDepth && child_type == 15 &&
+            xmlStrEqual(childName, (const xmlChar *)"way") == 1)
+        {
+            xmlChar *id = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"id");
+            way.id = stringToUint((char *)id);
+            xmlFree(id);
+            xmlFree(childName);
+            break;
+        }
+        if (child_type != 1)
+        {
+            xmlFree(childName);
+            continue;
+        }
+
+        if (xmlStrEqual(childName, (const xmlChar *)"tag") == 1)
+        {
+            xmlChar *k = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"k");
+            xmlChar *value = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"v");
+
+            if (k != NULL && value != NULL)
+            {
+                way.keyVals.Add(std::string((char *)k), std::string((char *)value));
+            }
+            if (k != NULL)
+            {
+                xmlFree(k);
+            }
+            if (value != NULL)
+            {
+                xmlFree(value);
+            }
+        }
+        else if (xmlStrEqual(childName, (const xmlChar *)"nd") == 1)
+        {
+            xmlChar *ref = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"ref");
+            if (ref != NULL)
+            {
+                way.path.push_back(stringToUint((const char *)ref));
+                xmlFree(ref);
+            }
+        }
+        xmlFree(childName);
     }
     return way;
 }
@@ -292,57 +291,57 @@ ImportNode XMLParser::ReadXMLNode()
         xmlFree(attribute);
     }
 
-    if (xmlTextReaderIsEmptyElement(inputReader) != 1)
+    if (xmlTextReaderIsEmptyElement(inputReader) == 1)
     {
-        const int depth = xmlTextReaderDepth(inputReader);
-        while (xmlTextReaderRead(inputReader) == 1)
+        return node;
+    }
+    const int depth = xmlTextReaderDepth(inputReader);
+    while (xmlTextReaderRead(inputReader) == 1)
+    {
+        const int child_type = xmlTextReaderNodeType(inputReader);
+        // 1 = Element, 15 = EndElement
+        if (child_type != 1 && child_type != 15)
         {
-            const int childType = xmlTextReaderNodeType(inputReader);
-            // 1 = Element, 15 = EndElement
-            if (childType != 1 && childType != 15)
-            {
-                continue;
-            }
-            const int childDepth = xmlTextReaderDepth(inputReader);
-            xmlChar *childName = xmlTextReaderName(inputReader);
-            if (childName == NULL)
-            {
-                continue;
-            }
-
-            if (depth == childDepth && childType == 15 &&
-                xmlStrEqual(childName, (const xmlChar *)"node") == 1)
-            {
-                xmlFree(childName);
-                break;
-            }
-            if (childType != 1)
-            {
-                xmlFree(childName);
-                continue;
-            }
-
-            if (xmlStrEqual(childName, (const xmlChar *)"tag") == 1)
-            {
-                xmlChar *k = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"k");
-                xmlChar *value = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"v");
-                if (k != NULL && value != NULL)
-                {
-                    node.keyVals.emplace(std::string((char *)(k)),
-                                         std::string((char *)(value)));
-                }
-                if (k != NULL)
-                {
-                    xmlFree(k);
-                }
-                if (value != NULL)
-                {
-                    xmlFree(value);
-                }
-            }
-
-            xmlFree(childName);
+            continue;
         }
+        const int childDepth = xmlTextReaderDepth(inputReader);
+        xmlChar *childName = xmlTextReaderName(inputReader);
+        if (childName == NULL)
+        {
+            continue;
+        }
+
+        if (depth == childDepth && child_type == 15 &&
+            xmlStrEqual(childName, (const xmlChar *)"node") == 1)
+        {
+            xmlFree(childName);
+            break;
+        }
+        if (child_type != 1)
+        {
+            xmlFree(childName);
+            continue;
+        }
+
+        if (xmlStrEqual(childName, (const xmlChar *)"tag") == 1)
+        {
+            xmlChar *k = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"k");
+            xmlChar *value = xmlTextReaderGetAttribute(inputReader, (const xmlChar *)"v");
+            if (k != NULL && value != NULL)
+            {
+                node.keyVals.emplace(std::string((char *)(k)), std::string((char *)(value)));
+            }
+            if (k != NULL)
+            {
+                xmlFree(k);
+            }
+            if (value != NULL)
+            {
+                xmlFree(value);
+            }
+        }
+
+        xmlFree(childName);
     }
     return node;
 }

Include/osrm/Coordinate.h

@@ -28,57 +28,67 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef FIXED_POINT_COORDINATE_H_
 #define FIXED_POINT_COORDINATE_H_
 
-#include <iosfwd>   //for std::ostream
+#include <functional>
+#include <iosfwd> //for std::ostream
 
-static const double COORDINATE_PRECISION = 1000000.;
+constexpr float COORDINATE_PRECISION = 1000000.;
 
-struct FixedPointCoordinate {
+struct FixedPointCoordinate
+{
     int lat;
     int lon;
 
     FixedPointCoordinate();
-    explicit FixedPointCoordinate( int lat, int lon);
+    explicit FixedPointCoordinate(int lat, int lon);
     void Reset();
     bool isSet() const;
     bool isValid() const;
-    bool operator==(const FixedPointCoordinate & other) const;
+    bool operator==(const FixedPointCoordinate &other) const;
 
-    static double ApproximateDistance(
-        const int lat1,
-        const int lon1,
-        const int lat2,
-        const int lon2
-    );
+    static double
+    ApproximateDistance(const int lat1, const int lon1, const int lat2, const int lon2);
 
-    static double ApproximateDistance(
-        const FixedPointCoordinate & c1,
-        const FixedPointCoordinate & c2
-    );
+    static double ApproximateDistance(const FixedPointCoordinate &c1,
+                                      const FixedPointCoordinate &c2);
 
-    static double ApproximateEuclideanDistance(
-        const FixedPointCoordinate & c1,
-        const FixedPointCoordinate & c2
-    );
+    static float ApproximateEuclideanDistance(const FixedPointCoordinate &c1,
+                                              const FixedPointCoordinate &c2);
 
-    static void convertInternalLatLonToString(
-        const int value,
-        std::string & output
-    );
+    static float ApproximateEuclideanDistance(const int lat1, const int lon1, const int lat2, const int lon2);
 
-    static void convertInternalCoordinateToString(
-        const FixedPointCoordinate & coord,
-        std::string & output
-    );
+    static float ApproximateSquaredEuclideanDistance(const FixedPointCoordinate &c1,
+                                                     const FixedPointCoordinate &c2);
 
-    static void convertInternalReversedCoordinateToString(
-        const FixedPointCoordinate & coord,
-        std::string & output
-    );
+    static void convertInternalLatLonToString(const int value, std::string &output);
 
-    void Output(std::ostream & out) const;
+    static void convertInternalCoordinateToString(const FixedPointCoordinate &coord,
+                                                  std::string &output);
+
+    static void convertInternalReversedCoordinateToString(const FixedPointCoordinate &coord,
+                                                          std::string &output);
+
+    static float ComputePerpendicularDistance(const FixedPointCoordinate &point,
+                                               const FixedPointCoordinate &segA,
+                                               const FixedPointCoordinate &segB);
+
+    static float ComputePerpendicularDistance(const FixedPointCoordinate &coord_a,
+                                               const FixedPointCoordinate &coord_b,
+                                               const FixedPointCoordinate &query_location,
+                                               FixedPointCoordinate &nearest_location,
+                                               float &r);
+
+    static float GetBearing(const FixedPointCoordinate &A, const FixedPointCoordinate &B);
+
+    float GetBearing(const FixedPointCoordinate &other) const;
+
+    void Output(std::ostream &out) const;
+
+    static float DegreeToRadian(const float degree);
+    static float RadianToDegree(const float radian);
 };
 
-inline std::ostream& operator<<(std::ostream& o, FixedPointCoordinate const & c){
+inline std::ostream &operator<<(std::ostream &o, FixedPointCoordinate const &c)
+{
     c.Output(o);
     return o;
 }

Include/osrm/Header.h

@@ -30,16 +30,18 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <string>
 
-namespace http {
-
-    struct Header {
-        std::string name;
-        std::string value;
-        void Clear() {
-            name.clear();
-            value.clear();
-        }
-    };
+namespace http
+{
+struct Header
+{
+    std::string name;
+    std::string value;
+    void Clear()
+    {
+        name.clear();
+        value.clear();
+    }
+};
 }
 
-#endif //HTTP_HEADER_H
+#endif // HTTP_HEADER_H

Include/osrm/Reply.h

@@ -34,40 +34,41 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <vector>
 
-namespace http {
+namespace http
+{
 
-const char okHTML[]                  = "";
-const char badRequestHTML[]          = "{\"status\": 400,\"status_message\":\"Bad Request\"}";
-const char internalServerErrorHTML[] = "{\"status\": 500,\"status_message\":\"Internal Server Error\"}";
-const char seperators[]              = { ':', ' ' };
-const char crlf[]                    = { '\r', '\n' };
+const char okHTML[] = "";
+const char badRequestHTML[] = "{\"status\": 400,\"status_message\":\"Bad Request\"}";
+const char internalServerErrorHTML[] =
+    "{\"status\": 500,\"status_message\":\"Internal Server Error\"}";
+const char seperators[] = {':', ' '};
+const char crlf[] = {'\r', '\n'};
 const std::string okString = "HTTP/1.0 200 OK\r\n";
 const std::string badRequestString = "HTTP/1.0 400 Bad Request\r\n";
 const std::string internalServerErrorString = "HTTP/1.0 500 Internal Server Error\r\n";
 
-class Reply {
-public:
-    enum status_type {
-        ok                  = 200,
-        badRequest          = 400,
-        internalServerError = 500
-    } status;
-
+class Reply
+{
+  public:
+    enum status_type
+    { ok = 200,
+      badRequest = 400,
+      internalServerError = 500 } status;
 
     std::vector<Header> headers;
     std::vector<boost::asio::const_buffer> toBuffers();
     std::vector<boost::asio::const_buffer> HeaderstoBuffers();
-    std::vector<std::string> content;
+    std::vector<char> content;
     static Reply StockReply(status_type status);
     void setSize(const unsigned size);
     void SetUncompressedSize();
 
     Reply();
-private:
+
+  private:
     std::string ToString(Reply::status_type status);
     boost::asio::const_buffer ToBuffer(Reply::status_type status);
 };
-
 }
 
-#endif //REPLY_H
+#endif // REPLY_H

Include/osrm/RouteParameters.h

@@ -30,96 +30,54 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <osrm/Coordinate.h>
 
-#include <boost/fusion/container/vector.hpp>
-#include <boost/fusion/sequence/intrinsic.hpp>
-#include <boost/fusion/include/at_c.hpp>
+#include <boost/fusion/container/vector/vector_fwd.hpp>
 
 #include <string>
 #include <vector>
 
-struct RouteParameters {
-    RouteParameters() :
-        zoomLevel(18),
-        printInstructions(false),
-        alternateRoute(true),
-        geometry(true),
-        compression(true),
-        deprecatedAPI(false),
-        checkSum(-1)
-    { }
+struct RouteParameters
+{
+    RouteParameters();
 
-    short zoomLevel;
-    bool printInstructions;
-    bool alternateRoute;
+    void setZoomLevel(const short level);
+
+    void setAlternateRouteFlag(const bool flag);
+
+    void setDeprecatedAPIFlag(const std::string &);
+
+    void setChecksum(const unsigned check_sum);
+
+    void setInstructionFlag(const bool flag);
+
+    void setService(const std::string &service);
+
+    void setOutputFormat(const std::string &format);
+
+    void setJSONpParameter(const std::string &parameter);
+
+    void addHint(const std::string &hint);
+
+    void setLanguage(const std::string &language);
+
+    void setGeometryFlag(const bool flag);
+
+    void setCompressionFlag(const bool flag);
+
+    void addCoordinate(const boost::fusion::vector<double, double> &coordinates);
+
+    short zoom_level;
+    bool print_instructions;
+    bool alternate_route;
     bool geometry;
     bool compression;
     bool deprecatedAPI;
-    unsigned checkSum;
+    unsigned check_sum;
     std::string service;
-    std::string outputFormat;
-    std::string jsonpParameter;
+    std::string output_format;
+    std::string jsonp_parameter;
     std::string language;
     std::vector<std::string> hints;
     std::vector<FixedPointCoordinate> coordinates;
-
-    void setZoomLevel(const short i) {
-        if (18 >= i && 0 <= i) {
-            zoomLevel = i;
-        }
-    }
-
-    void setAlternateRouteFlag(const bool b) {
-        alternateRoute = b;
-    }
-
-    void setDeprecatedAPIFlag(const std::string &) {
-        deprecatedAPI = true;
-    }
-
-    void setChecksum(const unsigned c) {
-        checkSum = c;
-    }
-
-    void setInstructionFlag(const bool b) {
-        printInstructions = b;
-    }
-
-    void setService( const std::string & s) {
-        service = s;
-    }
-
-    void setOutputFormat(const std::string & s) {
-        outputFormat = s;
-    }
-
-    void setJSONpParameter(const std::string & s) {
-        jsonpParameter = s;
-    }
-
-    void addHint(const std::string & s) {
-        hints.resize( coordinates.size() );
-        if( !hints.empty() ) {
-            hints.back() = s;
-        }
-    }
-
-    void setLanguage(const std::string & s) {
-        language = s;
-    }
-
-    void setGeometryFlag(const bool b) {
-        geometry = b;
-    }
-
-    void setCompressionFlag(const bool b) {
-        compression = b;
-    }
-
-    void addCoordinate(const boost::fusion::vector < double, double > & arg_) {
-        int lat = COORDINATE_PRECISION*boost::fusion::at_c < 0 > (arg_);
-        int lon = COORDINATE_PRECISION*boost::fusion::at_c < 1 > (arg_);
-        coordinates.push_back(FixedPointCoordinate(lat, lon));
-    }
 };
 
-#endif /*ROUTE_PARAMETERS_H*/
+#endif // ROUTE_PARAMETERS_H

Include/osrm/ServerPaths.h

@@ -28,11 +28,11 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef SERVER_PATH_H
 #define SERVER_PATH_H
 
-#include <boost/unordered_map.hpp>
 #include <boost/filesystem.hpp>
 
+#include <unordered_map>
 #include <string>
 
-typedef boost::unordered_map<const std::string, boost::filesystem::path> ServerPaths;
+typedef std::unordered_map<std::string, boost::filesystem::path> ServerPaths;
 
-#endif //SERVER_PATH_H
+#endif // SERVER_PATH_H

Library/OSRM.h

@@ -28,22 +28,25 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef OSRM_H
 #define OSRM_H
 
-#include <osrm/Reply.h>
-#include <osrm/RouteParameters.h>
 #include <osrm/ServerPaths.h>
 
 class OSRM_impl;
+struct RouteParameters;
 
-class OSRM {
-private:
-    OSRM_impl * OSRM_pimpl_;
-public:
-    explicit OSRM(
-        const ServerPaths & paths,
-        const bool use_shared_memory = false
-    );
+namespace http
+{
+class Reply;
+}
+
+class OSRM
+{
+  private:
+    OSRM_impl *OSRM_pimpl_;
+
+  public:
+    explicit OSRM(const ServerPaths &paths, const bool use_shared_memory = false);
     ~OSRM();
-    void RunQuery(RouteParameters & route_parameters, http::Reply & reply);
+    void RunQuery(RouteParameters &route_parameters, http::Reply &reply);
 };
 
 #endif // OSRM_H

Library/OSRM_impl.cpp

@@ -28,6 +28,7 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "OSRM_impl.h"
 #include "OSRM.h"
 
+#include "../Plugins/DistanceTablePlugin.h"
 #include "../Plugins/HelloWorldPlugin.h"
 #include "../Plugins/LocatePlugin.h"
 #include "../Plugins/NearestPlugin.h"
@@ -41,82 +42,66 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <boost/assert.hpp>
 
-OSRM_impl::OSRM_impl( const ServerPaths & server_paths, const bool use_shared_memory )
- :
-    use_shared_memory(use_shared_memory)
+OSRM_impl::OSRM_impl(const ServerPaths &server_paths, const bool use_shared_memory)
+    : use_shared_memory(use_shared_memory)
 {
     if (use_shared_memory)
     {
         barrier = new SharedBarriers();
-        query_data_facade = new SharedDataFacade<QueryEdge::EdgeData>( );
+        query_data_facade = new SharedDataFacade<QueryEdge::EdgeData>();
     }
     else
     {
-        query_data_facade = new InternalDataFacade<QueryEdge::EdgeData>(
-            server_paths
-        );
+        query_data_facade = new InternalDataFacade<QueryEdge::EdgeData>(server_paths);
     }
 
-    //The following plugins handle all requests.
-    RegisterPlugin(
-        new HelloWorldPlugin()
-    );
-    RegisterPlugin(
-        new LocatePlugin<BaseDataFacade<QueryEdge::EdgeData> >(
-            query_data_facade
-        )
-    );
-    RegisterPlugin(
-        new NearestPlugin<BaseDataFacade<QueryEdge::EdgeData> >(
-            query_data_facade
-        )
-    );
-    RegisterPlugin(
-        new TimestampPlugin<BaseDataFacade<QueryEdge::EdgeData> >(
-            query_data_facade
-        )
-    );
-    RegisterPlugin(
-        new ViaRoutePlugin<BaseDataFacade<QueryEdge::EdgeData> >(
-            query_data_facade
-        )
-    );
+    // The following plugins handle all requests.
+    RegisterPlugin(new DistanceTablePlugin<BaseDataFacade<QueryEdge::EdgeData>>(query_data_facade));
+    RegisterPlugin(new HelloWorldPlugin());
+    RegisterPlugin(new LocatePlugin<BaseDataFacade<QueryEdge::EdgeData>>(query_data_facade));
+    RegisterPlugin(new NearestPlugin<BaseDataFacade<QueryEdge::EdgeData>>(query_data_facade));
+    RegisterPlugin(new TimestampPlugin<BaseDataFacade<QueryEdge::EdgeData>>(query_data_facade));
+    RegisterPlugin(new ViaRoutePlugin<BaseDataFacade<QueryEdge::EdgeData>>(query_data_facade));
 }
 
-OSRM_impl::~OSRM_impl() {
-    BOOST_FOREACH(PluginMap::value_type & plugin_pointer, plugin_map) {
+OSRM_impl::~OSRM_impl()
+{
+    for (PluginMap::value_type &plugin_pointer : plugin_map)
+    {
         delete plugin_pointer.second;
     }
-    if( use_shared_memory ) {
+    if (use_shared_memory)
+    {
         delete barrier;
     }
 }
 
-void OSRM_impl::RegisterPlugin(BasePlugin * plugin) {
-    SimpleLogger().Write()  << "loaded plugin: " << plugin->GetDescriptor();
-    if( plugin_map.find(plugin->GetDescriptor()) != plugin_map.end() ) {
+void OSRM_impl::RegisterPlugin(BasePlugin *plugin)
+{
+    SimpleLogger().Write() << "loaded plugin: " << plugin->GetDescriptor();
+    if (plugin_map.find(plugin->GetDescriptor()) != plugin_map.end())
+    {
         delete plugin_map.find(plugin->GetDescriptor())->second;
     }
     plugin_map.emplace(plugin->GetDescriptor(), plugin);
 }
 
-void OSRM_impl::RunQuery(RouteParameters & route_parameters, http::Reply & reply) {
-    const PluginMap::const_iterator & iter = plugin_map.find(
-        route_parameters.service
-    );
+void OSRM_impl::RunQuery(RouteParameters &route_parameters, http::Reply &reply)
+{
+    const PluginMap::const_iterator &iter = plugin_map.find(route_parameters.service);
 
-    if(plugin_map.end() != iter) {
+    if (plugin_map.end() != iter)
+    {
         reply.status = http::Reply::ok;
-        if( use_shared_memory ) {
+        if (use_shared_memory)
+        {
             // lock update pending
-            boost::interprocess::scoped_lock<
-                boost::interprocess::named_mutex
-            > pending_lock(barrier->pending_update_mutex);
+            boost::interprocess::scoped_lock<boost::interprocess::named_mutex> pending_lock(
+                barrier->pending_update_mutex);
 
             // lock query
-            boost::interprocess::scoped_lock<
-                boost::interprocess::named_mutex
-            > query_lock(barrier->query_mutex);
+            boost::interprocess::scoped_lock<boost::interprocess::named_mutex> query_lock(
+                barrier->query_mutex);
 
             // unlock update pending
             pending_lock.unlock();
@@ -124,44 +109,44 @@ void OSRM_impl::RunQuery(RouteParameters & route_parameters, http::Reply & reply
             // increment query count
             ++(barrier->number_of_queries);
 
-            (static_cast<SharedDataFacade<QueryEdge::EdgeData>* >(query_data_facade))->CheckAndReloadFacade();
+            (static_cast<SharedDataFacade<QueryEdge::EdgeData> *>(query_data_facade))
+                ->CheckAndReloadFacade();
         }
 
-        iter->second->HandleRequest(route_parameters, reply );
-        if( use_shared_memory ) {
+        iter->second->HandleRequest(route_parameters, reply);
+        if (use_shared_memory)
+        {
             // lock query
-            boost::interprocess::scoped_lock<
-                boost::interprocess::named_mutex
-            > query_lock(barrier->query_mutex);
+            boost::interprocess::scoped_lock<boost::interprocess::named_mutex> query_lock(
+                barrier->query_mutex);
 
             // decrement query count
             --(barrier->number_of_queries);
-            BOOST_ASSERT_MSG(
-                0 <= barrier->number_of_queries,
-                "invalid number of queries"
-            );
+            BOOST_ASSERT_MSG(0 <= barrier->number_of_queries, "invalid number of queries");
 
             // notify all processes that were waiting for this condition
-            if (0 == barrier->number_of_queries) {
+            if (0 == barrier->number_of_queries)
+            {
                 barrier->no_running_queries_condition.notify_all();
             }
         }
-    } else {
+    }
+    else
+    {
         reply = http::Reply::StockReply(http::Reply::badRequest);
     }
 }
 
 // proxy code for compilation firewall
 
-OSRM::OSRM(
-    const ServerPaths & paths,
-    const bool use_shared_memory
-) : OSRM_pimpl_(new OSRM_impl(paths, use_shared_memory)) { }
-
-OSRM::~OSRM() {
-    delete OSRM_pimpl_;
+OSRM::OSRM(const ServerPaths &paths, const bool use_shared_memory)
+    : OSRM_pimpl_(new OSRM_impl(paths, use_shared_memory))
+{
 }
 
-void OSRM::RunQuery(RouteParameters & route_parameters, http::Reply & reply) {
+OSRM::~OSRM() { delete OSRM_pimpl_; }
+
+void OSRM::RunQuery(RouteParameters &route_parameters, http::Reply &reply)
+{
     OSRM_pimpl_->RunQuery(route_parameters, reply);
 }

Library/OSRM_impl.h

@@ -36,30 +36,30 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../Plugins/BasePlugin.h"
 #include "../Util/ProgramOptions.h"
 
-#include <boost/noncopyable.hpp>
+#include <unordered_map>
+#include <string>
 
 struct SharedBarriers;
-template<class EdgeDataT>
-class BaseDataFacade;
+template <class EdgeDataT> class BaseDataFacade;
 
-class OSRM_impl : boost::noncopyable {
-private:
-    typedef boost::unordered_map<std::string, BasePlugin *> PluginMap;
-public:
-    OSRM_impl(
-        const ServerPaths & paths,
-        const bool use_shared_memory
-    );
+class OSRM_impl
+{
+  private:
+    typedef std::unordered_map<std::string, BasePlugin *> PluginMap;
+
+  public:
+    OSRM_impl(const ServerPaths &paths, const bool use_shared_memory);
+    OSRM_impl(const OSRM_impl &) = delete;
     virtual ~OSRM_impl();
-    void RunQuery(RouteParameters & route_parameters, http::Reply & reply);
+    void RunQuery(RouteParameters &route_parameters, http::Reply &reply);
 
-private:
-    void RegisterPlugin(BasePlugin * plugin);
+  private:
+    void RegisterPlugin(BasePlugin *plugin);
     PluginMap plugin_map;
     bool use_shared_memory;
-    SharedBarriers * barrier;
-    //base class pointer to the objects
-    BaseDataFacade<QueryEdge::EdgeData> * query_data_facade;
+    SharedBarriers *barrier;
+    // base class pointer to the objects
+    BaseDataFacade<QueryEdge::EdgeData> *query_data_facade;
 };
 
-#endif //OSRM_IMPL_H
+#endif // OSRM_IMPL_H

Plugins/BasePlugin.h

@@ -34,30 +34,17 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <osrm/Reply.h>
 #include <osrm/RouteParameters.h>
 
-#include <boost/foreach.hpp>
-
 #include <string>
 #include <vector>
 
-class BasePlugin {
-public:
-	BasePlugin() { }
-	//Maybe someone can explain the pure virtual destructor thing to me (dennis)
-	virtual ~BasePlugin() { }
-	virtual const std::string & GetDescriptor() const = 0;
-	virtual void HandleRequest(const RouteParameters & routeParameters, http::Reply& reply) = 0;
-
-	inline bool checkCoord(const FixedPointCoordinate & c) {
-        if(
-            c.lat >   90*COORDINATE_PRECISION ||
-            c.lat <  -90*COORDINATE_PRECISION ||
-            c.lon >  180*COORDINATE_PRECISION ||
-            c.lon < -180*COORDINATE_PRECISION
-        ) {
-            return false;
-        }
-        return true;
-    }
+class BasePlugin
+{
+  public:
+    BasePlugin() {}
+    // Maybe someone can explain the pure virtual destructor thing to me (dennis)
+    virtual ~BasePlugin() {}
+    virtual const std::string GetDescriptor() const = 0;
+    virtual void HandleRequest(const RouteParameters &routeParameters, http::Reply &reply) = 0;
 };
 
 #endif /* BASEPLUGIN_H_ */

Plugins/DistanceTablePlugin.h

@@ -0,0 +1,141 @@
+/*
+
+Copyright (c) 2014, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+#ifndef DISTANCE_TABLE_PLUGIN_H
+#define DISTANCE_TABLE_PLUGIN_H
+
+#include "BasePlugin.h"
+
+#include "../Algorithms/ObjectToBase64.h"
+#include "../DataStructures/JSONContainer.h"
+#include "../DataStructures/QueryEdge.h"
+#include "../DataStructures/SearchEngine.h"
+#include "../Descriptors/BaseDescriptor.h"
+#include "../Util/SimpleLogger.h"
+#include "../Util/StringUtil.h"
+#include "../Util/TimingUtil.h"
+
+#include <cstdlib>
+
+#include <algorithm>
+#include <memory>
+#include <unordered_map>
+#include <string>
+#include <vector>
+
+template <class DataFacadeT> class DistanceTablePlugin : public BasePlugin
+{
+  private:
+    std::shared_ptr<SearchEngine<DataFacadeT>> search_engine_ptr;
+
+  public:
+    explicit DistanceTablePlugin(DataFacadeT *facade) : descriptor_string("table"), facade(facade)
+    {
+        search_engine_ptr = std::make_shared<SearchEngine<DataFacadeT>>(facade);
+    }
+
+    virtual ~DistanceTablePlugin() {}
+
+    const std::string GetDescriptor() const { return descriptor_string; }
+
+    void HandleRequest(const RouteParameters &route_parameters, http::Reply &reply)
+    {
+        // check number of parameters
+        if (2 > route_parameters.coordinates.size())
+        {
+            reply = http::Reply::StockReply(http::Reply::badRequest);
+            return;
+        }
+
+        RawRouteData raw_route;
+        raw_route.check_sum = facade->GetCheckSum();
+
+        if (std::any_of(begin(route_parameters.coordinates),
+                        end(route_parameters.coordinates),
+                        [&](FixedPointCoordinate coordinate)
+                        { return !coordinate.isValid(); }))
+        {
+            reply = http::Reply::StockReply(http::Reply::badRequest);
+            return;
+        }
+
+        for (const FixedPointCoordinate &coordinate : route_parameters.coordinates)
+        {
+            raw_route.raw_via_node_coordinates.emplace_back(coordinate);
+        }
+
+        std::vector<PhantomNode> phantom_node_vector(raw_route.raw_via_node_coordinates.size());
+        const bool checksum_OK = (route_parameters.check_sum == raw_route.check_sum);
+
+        unsigned max_locations = std::min((std::size_t)100, raw_route.raw_via_node_coordinates.size());
+        for (unsigned i = 0; i < max_locations; ++i)
+        {
+            if (checksum_OK && i < route_parameters.hints.size() &&
+                !route_parameters.hints[i].empty())
+            {
+                DecodeObjectFromBase64(route_parameters.hints[i], phantom_node_vector[i]);
+                if (phantom_node_vector[i].isValid(facade->GetNumberOfNodes()))
+                {
+                    continue;
+                }
+            }
+            facade->FindPhantomNodeForCoordinate(raw_route.raw_via_node_coordinates[i],
+                                                 phantom_node_vector[i],
+                                                 route_parameters.zoom_level);
+            BOOST_ASSERT(phantom_node_vector[i].isValid(facade->GetNumberOfNodes()));
+        }
+
+        TIMER_START(distance_table);
+        std::shared_ptr<std::vector<EdgeWeight>> result_table = search_engine_ptr->distance_table(phantom_node_vector);
+        TIMER_STOP(distance_table);
+
+        if (!result_table)
+        {
+            reply = http::Reply::StockReply(http::Reply::badRequest);
+            return;
+        }
+        JSON::Object json_object;
+        JSON::Array json_array;
+        const unsigned number_of_locations = phantom_node_vector.size();
+        for(unsigned row = 0; row < number_of_locations; ++row)
+        {
+            JSON::Array json_row;
+            auto row_begin_iterator = result_table->begin() + (row*number_of_locations);
+            auto row_end_iterator = result_table->begin() + ((row+1)*number_of_locations);
+            json_row.values.insert(json_row.values.end(), row_begin_iterator, row_end_iterator);
+            json_array.values.push_back(json_row);
+        }
+        json_object.values["distance_table"] = json_array;
+        JSON::render(reply.content, json_object);
+    }
+
+  private:
+    std::string descriptor_string;
+    DataFacadeT *facade;
+};
+
+#endif // DISTANCE_TABLE_PLUGIN_H

Plugins/HelloWorldPlugin.h

@@ -25,77 +25,80 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef HELLOWORLDPLUGIN_H_
-#define HELLOWORLDPLUGIN_H_
+#ifndef HELLO_WORLD_PLUGIN_H
+#define HELLO_WORLD_PLUGIN_H
 
 #include "BasePlugin.h"
+#include "../DataStructures/JSONContainer.h"
 #include "../Util/StringUtil.h"
 
 #include <string>
 
-class HelloWorldPlugin : public BasePlugin {
-    private:
-        std::string temp_string;
-public:
-	HelloWorldPlugin() : descriptor_string("hello"){}
-	virtual ~HelloWorldPlugin() { }
-	const std::string & GetDescriptor()    const { return descriptor_string; }
+class HelloWorldPlugin : public BasePlugin
+{
+  private:
+    std::string temp_string;
 
-	void HandleRequest(const RouteParameters & routeParameters, http::Reply& reply) {
-		reply.status = http::Reply::ok;
-		reply.content.push_back("<html><head><title>Hello World Demonstration Document</title></head><body><h1>Hello, World!</h1>");
-		reply.content.push_back("<pre>");
-        reply.content.push_back("zoom level: ");
-        intToString(routeParameters.zoomLevel, temp_string);
-        reply.content.push_back(temp_string);
-        reply.content.push_back("\nchecksum: ");
-        intToString(routeParameters.checkSum, temp_string);
-        reply.content.push_back(temp_string);
-        reply.content.push_back("\ninstructions: ");
-        reply.content.push_back((routeParameters.printInstructions ? "yes" : "no"));
-        reply.content.push_back(temp_string);
-        reply.content.push_back("\ngeometry: ");
-        reply.content.push_back((routeParameters.geometry ? "yes" : "no"));
-        reply.content.push_back("\ncompression: ");
-        reply.content.push_back((routeParameters.compression ? "yes" : "no"));
-        reply.content.push_back("\noutput format: ");
-        reply.content.push_back(routeParameters.outputFormat);
-        reply.content.push_back("\njson parameter: ");
-        reply.content.push_back(routeParameters.jsonpParameter);
-        reply.content.push_back("\nlanguage: ");
-        reply.content.push_back(routeParameters.language);
-        reply.content.push_back("\nNumber of locations: ");
-        intToString(routeParameters.coordinates.size(), temp_string);
-        reply.content.push_back(temp_string);
-        reply.content.push_back("\n");
-        for(unsigned i = 0; i < routeParameters.coordinates.size(); ++i) {
-            reply.content.push_back( "  [");
-            intToString(i, temp_string);
-            reply.content.push_back(temp_string);
-            reply.content.push_back("] ");
-            doubleToString(routeParameters.coordinates[i].lat/COORDINATE_PRECISION, temp_string);
-            reply.content.push_back(temp_string);
-            reply.content.push_back(",");
-            doubleToString(routeParameters.coordinates[i].lon/COORDINATE_PRECISION, temp_string);
-            reply.content.push_back(temp_string);
-            reply.content.push_back("\n");
+  public:
+    HelloWorldPlugin() : descriptor_string("hello") {}
+    virtual ~HelloWorldPlugin() {}
+    const std::string GetDescriptor() const { return descriptor_string; }
+
+    void HandleRequest(const RouteParameters &routeParameters, http::Reply &reply)
+    {
+        reply.status = http::Reply::ok;
+
+        JSON::Object json_result;
+        std::string temp_string;
+        json_result.values["title"] = "Hello World";
+
+        temp_string = IntToString(routeParameters.zoom_level);
+        json_result.values["zoom_level"] = temp_string;
+
+        temp_string = IntToString(routeParameters.check_sum);
+        json_result.values["check_sum"] = temp_string;
+        json_result.values["instructions"] = (routeParameters.print_instructions ? "yes" : "no");
+        json_result.values["geometry"] = (routeParameters.geometry ? "yes" : "no");
+        json_result.values["compression"] = (routeParameters.compression ? "yes" : "no");
+        json_result.values["output_format"] = (!routeParameters.output_format.empty() ? "yes" : "no");
+
+        json_result.values["jsonp_parameter"] = (!routeParameters.jsonp_parameter.empty() ? "yes" : "no");
+        json_result.values["language"] = (!routeParameters.language.empty() ? "yes" : "no");
+
+        temp_string = IntToString(routeParameters.coordinates.size());
+        json_result.values["location_count"] = temp_string;
+
+        JSON::Array json_locations;
+        unsigned counter = 0;
+        for (const FixedPointCoordinate &coordinate : routeParameters.coordinates)
+        {
+            JSON::Object json_location;
+            JSON::Array json_coordinates;
+
+            json_coordinates.values.push_back(coordinate.lat / COORDINATE_PRECISION);
+            json_coordinates.values.push_back(coordinate.lon / COORDINATE_PRECISION);
+            json_location.values[IntToString(counter)] = json_coordinates;
+            json_locations.values.push_back(json_location);
+            ++counter;
         }
-        reply.content.push_back( "Number of hints: ");
-        intToString(routeParameters.hints.size(), temp_string);
-        reply.content.push_back(temp_string);
-        reply.content.push_back("\n");
-        for(unsigned i = 0; i < routeParameters.hints.size(); ++i) {
-            reply.content.push_back( "  [");
-            intToString(i, temp_string);
-            reply.content.push_back(temp_string);
-            reply.content.push_back("] ");
-            reply.content.push_back(routeParameters.hints[i]);
-            reply.content.push_back("\n");
+        json_result.values["locations"] = json_locations;
+        json_result.values["hint_count"] = routeParameters.hints.size();
+
+        JSON::Array json_hints;
+        counter = 0;
+        for (const std::string &current_hint : routeParameters.hints)
+        {
+            // JSON::String json_hint_string = current_hint;
+            json_hints.values.push_back(current_hint);
+            ++counter;
         }
-        reply.content.push_back( "</pre></body></html>");
-	}
-private:
+        json_result.values["hints"] = json_hints;
+
+        JSON::render(reply.content, json_result);
+    }
+
+  private:
     std::string descriptor_string;
 };
 
-#endif /* HELLOWORLDPLUGIN_H_ */
+#endif // HELLO_WORLD_PLUGIN_H

Plugins/LocatePlugin.h

@@ -25,97 +25,55 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef LOCATEPLUGIN_H_
-#define LOCATEPLUGIN_H_
+#ifndef LOCATE_PLUGIN_H
+#define LOCATE_PLUGIN_H
 
 #include "BasePlugin.h"
+#include "../DataStructures/JSONContainer.h"
 #include "../Util/StringUtil.h"
 
-//locates the nearest node in the road network for a given coordinate.
+#include <string>
 
-template<class DataFacadeT>
-class LocatePlugin : public BasePlugin {
-public:
-    explicit LocatePlugin(DataFacadeT * facade)
-     :
-        descriptor_string("locate"),
-        facade(facade)
-    { }
-    const std::string & GetDescriptor() const { return descriptor_string; }
+// locates the nearest node in the road network for a given coordinate.
+template <class DataFacadeT> class LocatePlugin : public BasePlugin
+{
+  public:
+    explicit LocatePlugin(DataFacadeT *facade) : descriptor_string("locate"), facade(facade) {}
+    const std::string GetDescriptor() const { return descriptor_string; }
 
-    void HandleRequest(
-        const RouteParameters & routeParameters,
-        http::Reply& reply
-    ) {
-        //check number of parameters
-        if(!routeParameters.coordinates.size()) {
-            reply = http::Reply::StockReply(http::Reply::badRequest);
-            return;
-        }
-        if(false == checkCoord(routeParameters.coordinates[0])) {
+    void HandleRequest(const RouteParameters &route_parameters, http::Reply &reply)
+    {
+        // check number of parameters
+        if (route_parameters.coordinates.empty() ||
+            !route_parameters.coordinates.front().isValid())
+        {
             reply = http::Reply::StockReply(http::Reply::badRequest);
             return;
         }
 
-        //query to helpdesk
+        JSON::Object json_result;
         FixedPointCoordinate result;
-        std::string tmp;
-        //json
-
-        if(!routeParameters.jsonpParameter.empty()) {
-            reply.content.push_back(routeParameters.jsonpParameter);
-            reply.content.push_back("(");
+        if (!facade->LocateClosestEndPointForCoordinate(route_parameters.coordinates.front(),
+                                                        result))
+        {
+            json_result.values["status"] = 207;
         }
-        reply.status = http::Reply::ok;
-        reply.content.push_back ("{");
-        if(
-            !facade->LocateClosestEndPointForCoordinate(
-                routeParameters.coordinates[0],
-                result
-             )
-        ) {
-            reply.content.push_back ("\"status\":207,");
-            reply.content.push_back ("\"mapped_coordinate\":[]");
-        } else {
-            //Write coordinate to stream
+        else
+        {
             reply.status = http::Reply::ok;
-            reply.content.push_back ("\"status\":0,");
-            reply.content.push_back ("\"mapped_coordinate\":");
-            FixedPointCoordinate::convertInternalLatLonToString(result.lat, tmp);
-            reply.content.push_back("[");
-            reply.content.push_back(tmp);
-            FixedPointCoordinate::convertInternalLatLonToString(result.lon, tmp);
-            reply.content.push_back(",");
-            reply.content.push_back(tmp);
-            reply.content.push_back("]");
+            json_result.values["status"] = 0;
+            JSON::Array json_coordinate;
+            json_coordinate.values.push_back(result.lat/COORDINATE_PRECISION);
+            json_coordinate.values.push_back(result.lon/COORDINATE_PRECISION);
+            json_result.values["mapped_coordinate"] = json_coordinate;
         }
-        reply.content.push_back("}");
-        reply.headers.resize(3);
-        if(!routeParameters.jsonpParameter.empty()) {
-            reply.content.push_back( ")");
-            reply.headers[1].name = "Content-Type";
-            reply.headers[1].value = "text/javascript";
-            reply.headers[2].name = "Content-Disposition";
-            reply.headers[2].value = "attachment; filename=\"location.js\"";
-        } else {
-            reply.headers[1].name = "Content-Type";
-            reply.headers[1].value = "application/x-javascript";
-            reply.headers[2].name = "Content-Disposition";
-            reply.headers[2].value = "attachment; filename=\"location.json\"";
-        }
-        reply.headers[0].name = "Content-Length";
-        unsigned content_length = 0;
-        BOOST_FOREACH(const std::string & snippet, reply.content) {
-            content_length += snippet.length();
-        }
-        intToString(content_length, tmp);
-        reply.headers[0].value = tmp;
-        return;
+
+        JSON::render(reply.content, json_result);
     }
 
-private:
+  private:
     std::string descriptor_string;
-    DataFacadeT * facade;
+    DataFacadeT *facade;
 };
 
-#endif /* LOCATEPLUGIN_H_ */
+#endif /* LOCATE_PLUGIN_H */

Plugins/NearestPlugin.h

@@ -29,102 +29,62 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #define NEAREST_PLUGIN_H
 
 #include "BasePlugin.h"
+#include "../DataStructures/JSONContainer.h"
 #include "../DataStructures/PhantomNodes.h"
 #include "../Util/StringUtil.h"
 
-#include <boost/unordered_map.hpp>
+#include <string>
 
 /*
  * This Plugin locates the nearest point on a street in the road network for a given coordinate.
  */
 
-template<class DataFacadeT>
-class NearestPlugin : public BasePlugin {
-public:
-    explicit NearestPlugin(DataFacadeT * facade )
-     :
-        facade(facade),
-        descriptor_string("nearest")
+template <class DataFacadeT> class NearestPlugin : public BasePlugin
+{
+  public:
+    explicit NearestPlugin(DataFacadeT *facade) : facade(facade), descriptor_string("nearest")
     {
-        descriptorTable.emplace("",     0); //default descriptor
-        descriptorTable.emplace("json", 1);
     }
-    const std::string & GetDescriptor() const { return descriptor_string; }
-    void HandleRequest(
-        const RouteParameters & routeParameters,
-        http::Reply & reply
-    ) {
-        //check number of parameters
-        if(!routeParameters.coordinates.size()) {
-            reply = http::Reply::StockReply(http::Reply::badRequest);
-            return;
-        }
-        if( !checkCoord(routeParameters.coordinates[0]) ) {
+
+    const std::string GetDescriptor() const { return descriptor_string; }
+
+    void HandleRequest(const RouteParameters &route_parameters, http::Reply &reply)
+    {
+        // check number of parameters
+        if (route_parameters.coordinates.empty() ||
+            !route_parameters.coordinates.front().isValid())
+        {
             reply = http::Reply::StockReply(http::Reply::badRequest);
             return;
         }
 
-        PhantomNode result;
+        PhantomNode phantom_node;
         facade->FindPhantomNodeForCoordinate(
-            routeParameters.coordinates[0],
-            result,
-            routeParameters.zoomLevel
-        );
+            route_parameters.coordinates.front(), phantom_node, route_parameters.zoom_level);
 
-        std::string temp_string;
-        //json
-
-        if("" != routeParameters.jsonpParameter) {
-            reply.content.push_back(routeParameters.jsonpParameter);
-            reply.content.push_back("(");
+        JSON::Object json_result;
+        if (!phantom_node.isValid())
+        {
+            json_result.values["status"] = 207;
+        }
+        else
+        {
+            reply.status = http::Reply::ok;
+            json_result.values["status"] = 0;
+                        JSON::Array json_coordinate;
+            json_coordinate.values.push_back(phantom_node.location.lat/COORDINATE_PRECISION);
+            json_coordinate.values.push_back(phantom_node.location.lon/COORDINATE_PRECISION);
+            json_result.values["mapped_coordinate"] = json_coordinate;
+            std::string temp_string;
+            facade->GetName(phantom_node.name_id, temp_string);
+            json_result.values["name"] = temp_string;
         }
 
-        reply.status = http::Reply::ok;
-        reply.content.push_back("{\"status\":");
-        if(UINT_MAX != result.forward_node_id) {
-            reply.content.push_back("0,");
-        } else {
-            reply.content.push_back("207,");
-        }
-        reply.content.push_back("\"mapped_coordinate\":[");
-        if(UINT_MAX != result.forward_node_id) {
-            FixedPointCoordinate::convertInternalLatLonToString(result.location.lat, temp_string);
-            reply.content.push_back(temp_string);
-            FixedPointCoordinate::convertInternalLatLonToString(result.location.lon, temp_string);
-            reply.content.push_back(",");
-            reply.content.push_back(temp_string);
-        }
-        reply.content.push_back("],\"name\":\"");
-        if(UINT_MAX != result.forward_node_id) {
-            facade->GetName(result.name_id, temp_string);
-            reply.content.push_back(temp_string);
-        }
-        reply.content.push_back("\"}");
-        reply.headers.resize(3);
-        if( !routeParameters.jsonpParameter.empty() ) {
-            reply.content.push_back(")");
-            reply.headers[1].name = "Content-Type";
-            reply.headers[1].value = "text/javascript";
-            reply.headers[2].name = "Content-Disposition";
-            reply.headers[2].value = "attachment; filename=\"location.js\"";
-        } else {
-            reply.headers[1].name = "Content-Type";
-            reply.headers[1].value = "application/x-javascript";
-            reply.headers[2].name = "Content-Disposition";
-            reply.headers[2].value = "attachment; filename=\"location.json\"";
-        }
-        reply.headers[0].name = "Content-Length";
-        unsigned content_length = 0;
-        BOOST_FOREACH(const std::string & snippet, reply.content) {
-            content_length += snippet.length();
-        }
-        intToString(content_length, temp_string);
-        reply.headers[0].value = temp_string;
+        JSON::render(reply.content, json_result);
     }
 
-private:
-    DataFacadeT * facade;
-    boost::unordered_map<std::string, unsigned> descriptorTable;
+  private:
+    DataFacadeT *facade;
     std::string descriptor_string;
 };
 

Plugins/TimestampPlugin.h

@@ -25,58 +25,35 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef TIMESTAMPPLUGIN_H_
-#define TIMESTAMPPLUGIN_H_
+#ifndef TIMESTAMP_PLUGIN_H
+#define TIMESTAMP_PLUGIN_H
 
+#include "../DataStructures/JSONContainer.h"
 #include "BasePlugin.h"
 
-template<class DataFacadeT>
-class TimestampPlugin : public BasePlugin {
-public:
-    explicit TimestampPlugin(const DataFacadeT * facade)
-     : facade(facade), descriptor_string("timestamp")
-    { }
-    const std::string & GetDescriptor() const { return descriptor_string; }
-    void HandleRequest(const RouteParameters & routeParameters, http::Reply& reply) {
-        std::string tmp;
+#include <string>
 
-        //json
-        if("" != routeParameters.jsonpParameter) {
-            reply.content.push_back(routeParameters.jsonpParameter);
-            reply.content.push_back("(");
-        }
-
-        reply.status = http::Reply::ok;
-        reply.content.push_back("{");
-        reply.content.push_back("\"status\":");
-            reply.content.push_back("0,");
-        reply.content.push_back("\"timestamp\":\"");
-        reply.content.push_back(facade->GetTimestamp());
-        reply.content.push_back("\"");
-        reply.content.push_back("}");
-        reply.headers.resize(3);
-        if("" != routeParameters.jsonpParameter) {
-            reply.content.push_back(")");
-            reply.headers[1].name = "Content-Type";
-            reply.headers[1].value = "text/javascript";
-            reply.headers[2].name = "Content-Disposition";
-            reply.headers[2].value = "attachment; filename=\"timestamp.js\"";
-        } else {
-            reply.headers[1].name = "Content-Type";
-            reply.headers[1].value = "application/x-javascript";
-            reply.headers[2].name = "Content-Disposition";
-            reply.headers[2].value = "attachment; filename=\"timestamp.json\"";
-        }
-        unsigned content_length = 0;
-        BOOST_FOREACH(const std::string & snippet, reply.content) {
-            content_length += snippet.length();
-        }
-        intToString(content_length, tmp);
-        reply.headers[0].value = tmp;
+template <class DataFacadeT> class TimestampPlugin : public BasePlugin
+{
+  public:
+    explicit TimestampPlugin(const DataFacadeT *facade)
+        : facade(facade), descriptor_string("timestamp")
+    {
     }
-private:
-    const DataFacadeT * facade;
+    const std::string GetDescriptor() const { return descriptor_string; }
+    void HandleRequest(const RouteParameters &route_parameters, http::Reply &reply)
+    {
+        reply.status = http::Reply::ok;
+        JSON::Object json_result;
+        json_result.values["status"] = 0;
+        const std::string timestamp = facade->GetTimestamp();
+        json_result.values["timestamp"] = timestamp;
+        JSON::render(reply.content, json_result);
+    }
+
+  private:
+    const DataFacadeT *facade;
     std::string descriptor_string;
 };
 
-#endif /* TIMESTAMPPLUGIN_H_ */
+#endif /* TIMESTAMP_PLUGIN_H */

Plugins/ViaRoutePlugin.h

@@ -1,226 +1,182 @@
-/*
-
-Copyright (c) 2013, Project OSRM, Dennis Luxen, others
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification,
-are permitted provided that the following conditions are met:
-
-Redistributions of source code must retain the above copyright notice, this list
-of conditions and the following disclaimer.
-Redistributions in binary form must reproduce the above copyright notice, this
-list of conditions and the following disclaimer in the documentation and/or
-other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-*/
-
-#ifndef VIAROUTEPLUGIN_H_
-#define VIAROUTEPLUGIN_H_
-
-#include "BasePlugin.h"
-
-#include "../Algorithms/ObjectToBase64.h"
-#include "../DataStructures/QueryEdge.h"
-#include "../DataStructures/SearchEngine.h"
-#include "../Descriptors/BaseDescriptor.h"
-#include "../Descriptors/GPXDescriptor.h"
-#include "../Descriptors/JSONDescriptor.h"
-#include "../Util/SimpleLogger.h"
-#include "../Util/StringUtil.h"
-
-#include <boost/make_shared.hpp>
-#include <boost/shared_ptr.hpp>
-#include <boost/unordered_map.hpp>
-
-#include <cstdlib>
-
-#include <string>
-#include <vector>
-
-template<class DataFacadeT>
-class ViaRoutePlugin : public BasePlugin {
-private:
-    boost::unordered_map<std::string, unsigned> descriptorTable;
-    boost::shared_ptr<SearchEngine<DataFacadeT> > search_engine_ptr;
-public:
-
-    explicit ViaRoutePlugin(DataFacadeT * facade)
-     :
-        descriptor_string("viaroute"),
-        facade(facade)
-    {
-        search_engine_ptr = boost::make_shared<SearchEngine<DataFacadeT> >(facade);
-
-        descriptorTable.emplace("json", 0);
-        descriptorTable.emplace("gpx" , 1);
-    }
-
-    virtual ~ViaRoutePlugin() { }
-
-    const std::string & GetDescriptor() const { return descriptor_string; }
-
-    void HandleRequest(
-        const RouteParameters & routeParameters,
-        http::Reply& reply
-    ) {
-        //check number of parameters
-        if( 2 > routeParameters.coordinates.size() ) {
-            reply = http::Reply::StockReply(http::Reply::badRequest);
-            return;
-        }
-
-        RawRouteData raw_route;
-        raw_route.checkSum = facade->GetCheckSum();
-        const bool checksumOK = (routeParameters.checkSum == raw_route.checkSum);
-        std::vector<std::string> textCoord;
-        for(unsigned i = 0; i < routeParameters.coordinates.size(); ++i) {
-            if( !checkCoord(routeParameters.coordinates[i]) ) {
-                reply = http::Reply::StockReply(http::Reply::badRequest);
-                return;
-            }
-            raw_route.rawViaNodeCoordinates.push_back(routeParameters.coordinates[i]);
-        }
-        std::vector<PhantomNode> phantomNodeVector(raw_route.rawViaNodeCoordinates.size());
-        for(unsigned i = 0; i < raw_route.rawViaNodeCoordinates.size(); ++i) {
-            if(checksumOK && i < routeParameters.hints.size() && "" != routeParameters.hints[i]) {
-                DecodeObjectFromBase64(routeParameters.hints[i], phantomNodeVector[i]);
-                if(phantomNodeVector[i].isValid(facade->GetNumberOfNodes())) {
-                    continue;
-                }
-            }
-            facade->FindPhantomNodeForCoordinate(
-                raw_route.rawViaNodeCoordinates[i],
-                phantomNodeVector[i],
-                routeParameters.zoomLevel
-            );
-        }
-
-        PhantomNodes current_phantom_node_pair;
-        for (unsigned i = 0; i < phantomNodeVector.size()-1; ++i)
-        {
-            current_phantom_node_pair.source_phantom = phantomNodeVector[i];
-            current_phantom_node_pair.target_phantom = phantomNodeVector[i+1];
-            raw_route.segmentEndCoordinates.push_back(current_phantom_node_pair);
-        }
-
-        if ((routeParameters.alternateRoute) && (1 == raw_route.segmentEndCoordinates.size()))
-        {
-            search_engine_ptr->alternative_path(raw_route.segmentEndCoordinates[0], raw_route);
-        }
-        else
-        {
-            search_engine_ptr->shortest_path(raw_route.segmentEndCoordinates, raw_route);
-        }
-
-        if (INT_MAX == raw_route.lengthOfShortestPath)
-        {
-            SimpleLogger().Write(logDEBUG) << "Error occurred, single path not found";
-        }
-        reply.status = http::Reply::ok;
-
-        if (!routeParameters.jsonpParameter.empty())
-        {
-            reply.content.push_back(routeParameters.jsonpParameter);
-            reply.content.push_back("(");
-        }
-
-        DescriptorConfig descriptor_config;
-
-        unsigned descriptor_type = 0;
-        if(descriptorTable.find(routeParameters.outputFormat) != descriptorTable.end() ) {
-            descriptor_type = descriptorTable.find(routeParameters.outputFormat)->second;
-        }
-        descriptor_config.zoom_level = routeParameters.zoomLevel;
-        descriptor_config.instructions = routeParameters.printInstructions;
-        descriptor_config.geometry = routeParameters.geometry;
-        descriptor_config.encode_geometry = routeParameters.compression;
-
-        boost::shared_ptr<BaseDescriptor<DataFacadeT> > descriptor;
-        switch(descriptor_type){
-        case 0:
-            descriptor = boost::make_shared<JSONDescriptor<DataFacadeT> >();
-            break;
-        case 1:
-            descriptor = boost::make_shared<GPXDescriptor<DataFacadeT> >();
-            break;
-        default:
-            descriptor = boost::make_shared<JSONDescriptor<DataFacadeT> >();
-            break;
-        }
-
-        PhantomNodes phantom_nodes;
-        phantom_nodes.source_phantom = raw_route.segmentEndCoordinates[0].source_phantom;
-        phantom_nodes.target_phantom = raw_route.segmentEndCoordinates[raw_route.segmentEndCoordinates.size()-1].target_phantom;
-        descriptor->SetConfig(descriptor_config);
-
-        descriptor->Run(raw_route, phantom_nodes, facade, reply);
-
-        if (!routeParameters.jsonpParameter.empty())
-        {
-            reply.content.push_back(")\n");
-        }
-        reply.headers.resize(3);
-        reply.headers[0].name = "Content-Length";
-        unsigned content_length = 0;
-        BOOST_FOREACH(const std::string & snippet, reply.content) {
-            content_length += snippet.length();
-        }
-        std::string tmp_string;
-        intToString(content_length, tmp_string);
-        reply.headers[0].value = tmp_string;
-        switch(descriptor_type){
-        case 0:
-            if( !routeParameters.jsonpParameter.empty() ){
-                reply.headers[1].name = "Content-Type";
-                reply.headers[1].value = "text/javascript";
-                reply.headers[2].name = "Content-Disposition";
-                reply.headers[2].value = "attachment; filename=\"route.js\"";
-            } else {
-                reply.headers[1].name = "Content-Type";
-                reply.headers[1].value = "application/x-javascript";
-                reply.headers[2].name = "Content-Disposition";
-                reply.headers[2].value = "attachment; filename=\"route.json\"";
-            }
-
-            break;
-        case 1:
-            reply.headers[1].name = "Content-Type";
-            reply.headers[1].value = "application/gpx+xml; charset=UTF-8";
-            reply.headers[2].name = "Content-Disposition";
-            reply.headers[2].value = "attachment; filename=\"route.gpx\"";
-
-            break;
-        default:
-            if( !routeParameters.jsonpParameter.empty() ){
-                reply.headers[1].name = "Content-Type";
-                reply.headers[1].value = "text/javascript";
-                reply.headers[2].name = "Content-Disposition";
-                reply.headers[2].value = "attachment; filename=\"route.js\"";
-            } else {
-                reply.headers[1].name = "Content-Type";
-                reply.headers[1].value = "application/x-javascript";
-                reply.headers[2].name = "Content-Disposition";
-                reply.headers[2].value = "attachment; filename=\"route.json\"";
-            }
-            break;
-        }
-        return;
-    }
-private:
-    std::string descriptor_string;
-    DataFacadeT * facade;
-};
-
-
-#endif /* VIAROUTEPLUGIN_H_ */
+/*
+
+Copyright (c) 2013, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+#ifndef VIA_ROUTE_PLUGIN_H
+#define VIA_ROUTE_PLUGIN_H
+
+#include "BasePlugin.h"
+
+#include "../Algorithms/ObjectToBase64.h"
+
+#include "../DataStructures/QueryEdge.h"
+#include "../DataStructures/SearchEngine.h"
+#include "../Descriptors/BaseDescriptor.h"
+#include "../Descriptors/GPXDescriptor.h"
+#include "../Descriptors/JSONDescriptor.h"
+#include "../Util/SimpleLogger.h"
+#include "../Util/StringUtil.h"
+#include "../Util/TimingUtil.h"
+
+#include <cstdlib>
+
+#include <algorithm>
+#include <memory>
+#include <unordered_map>
+#include <string>
+#include <vector>
+
+template <class DataFacadeT> class ViaRoutePlugin : public BasePlugin
+{
+  private:
+    std::unordered_map<std::string, unsigned> descriptor_table;
+    std::shared_ptr<SearchEngine<DataFacadeT>> search_engine_ptr;
+
+  public:
+    explicit ViaRoutePlugin(DataFacadeT *facade) : descriptor_string("viaroute"), facade(facade)
+    {
+        search_engine_ptr = std::make_shared<SearchEngine<DataFacadeT>>(facade);
+
+        descriptor_table.emplace("json", 0);
+        descriptor_table.emplace("gpx", 1);
+        // descriptor_table.emplace("geojson", 2);
+    }
+
+    virtual ~ViaRoutePlugin() {}
+
+    const std::string GetDescriptor() const { return descriptor_string; }
+
+    void HandleRequest(const RouteParameters &route_parameters, http::Reply &reply)
+    {
+        // check number of parameters
+        if (2 > route_parameters.coordinates.size() ||
+            std::any_of(begin(route_parameters.coordinates),
+                        end(route_parameters.coordinates),
+                        [&](FixedPointCoordinate coordinate)
+                        { return !coordinate.isValid(); }))
+        {
+            reply = http::Reply::StockReply(http::Reply::badRequest);
+            return;
+        }
+
+        RawRouteData raw_route;
+        raw_route.check_sum = facade->GetCheckSum();
+        for (const FixedPointCoordinate &coordinate : route_parameters.coordinates)
+        {
+            raw_route.raw_via_node_coordinates.emplace_back(coordinate);
+        }
+
+        std::vector<PhantomNode> phantom_node_vector(raw_route.raw_via_node_coordinates.size());
+        const bool checksum_OK = (route_parameters.check_sum == raw_route.check_sum);
+
+        for (unsigned i = 0; i < raw_route.raw_via_node_coordinates.size(); ++i)
+        {
+            if (checksum_OK && i < route_parameters.hints.size() &&
+                !route_parameters.hints[i].empty())
+            {
+                DecodeObjectFromBase64(route_parameters.hints[i], phantom_node_vector[i]);
+                if (phantom_node_vector[i].isValid(facade->GetNumberOfNodes()))
+                {
+                    continue;
+                }
+            }
+            facade->FindPhantomNodeForCoordinate(raw_route.raw_via_node_coordinates[i],
+                                                 phantom_node_vector[i],
+                                                 route_parameters.zoom_level);
+        }
+
+        PhantomNodes current_phantom_node_pair;
+        for (unsigned i = 0; i < phantom_node_vector.size() - 1; ++i)
+        {
+            current_phantom_node_pair.source_phantom = phantom_node_vector[i];
+            current_phantom_node_pair.target_phantom = phantom_node_vector[i + 1];
+            raw_route.segment_end_coordinates.emplace_back(current_phantom_node_pair);
+        }
+
+        const bool is_alternate_requested = route_parameters.alternate_route;
+        const bool is_only_one_segment = (1 == raw_route.segment_end_coordinates.size());
+        TIMER_START(routing);
+        if (is_alternate_requested && is_only_one_segment)
+        {
+            search_engine_ptr->alternative_path(raw_route.segment_end_coordinates.front(),
+                                                raw_route);
+        }
+        else
+        {
+            search_engine_ptr->shortest_path(raw_route.segment_end_coordinates, raw_route);
+        }
+        TIMER_STOP(routing);
+        SimpleLogger().Write() << "routing took " << TIMER_MSEC(routing) << "ms";
+
+        if (INVALID_EDGE_WEIGHT == raw_route.shortest_path_length)
+        {
+            SimpleLogger().Write(logDEBUG) << "Error occurred, single path not found";
+        }
+        reply.status = http::Reply::ok;
+
+        DescriptorConfig descriptor_config;
+
+        auto iter = descriptor_table.find(route_parameters.output_format);
+        unsigned descriptor_type = (iter != descriptor_table.end() ? iter->second : 0);
+
+        descriptor_config.zoom_level = route_parameters.zoom_level;
+        descriptor_config.instructions = route_parameters.print_instructions;
+        descriptor_config.geometry = route_parameters.geometry;
+        descriptor_config.encode_geometry = route_parameters.compression;
+
+        std::shared_ptr<BaseDescriptor<DataFacadeT>> descriptor;
+        switch (descriptor_type)
+        {
+        // case 0:
+        //     descriptor = std::make_shared<JSONDescriptor<DataFacadeT>>();
+        //     break;
+        case 1:
+            descriptor = std::make_shared<GPXDescriptor<DataFacadeT>>(facade);
+            break;
+        // case 2:
+        //      descriptor = std::make_shared<GEOJSONDescriptor<DataFacadeT>>();
+        //      break;
+        default:
+            descriptor = std::make_shared<JSONDescriptor<DataFacadeT>>(facade);
+            break;
+        }
+
+        PhantomNodes phantom_nodes;
+        phantom_nodes.source_phantom = raw_route.segment_end_coordinates.front().source_phantom;
+        phantom_nodes.target_phantom = raw_route.segment_end_coordinates.back().target_phantom;
+        descriptor->SetConfig(descriptor_config);
+        TIMER_START(descriptor);
+        descriptor->Run(raw_route, phantom_nodes, reply);
+        TIMER_STOP(descriptor);
+        SimpleLogger().Write() << "descriptor took " << TIMER_MSEC(descriptor) << "ms";
+    }
+
+  private:
+    std::string descriptor_string;
+    DataFacadeT *facade;
+};
+
+#endif // VIA_ROUTE_PLUGIN_H

RoutingAlgorithms/BasicRoutingInterface.h

@@ -25,8 +25,8 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef BASICROUTINGINTERFACE_H_
-#define BASICROUTINGINTERFACE_H_
+#ifndef BASIC_ROUTING_INTERFACE_H
+#define BASIC_ROUTING_INTERFACE_H
 
 #include "../DataStructures/RawRouteData.h"
 #include "../DataStructures/SearchEngineData.h"
@@ -35,8 +35,6 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../Util/SimpleLogger.h"
 
 #include <boost/assert.hpp>
-#include <boost/foreach.hpp>
-#include <boost/noncopyable.hpp>
 
 #include <stack>
 
@@ -47,30 +45,32 @@ SearchEngineData::SearchEngineHeapPtr SearchEngineData::backwardHeap2;
 SearchEngineData::SearchEngineHeapPtr SearchEngineData::forwardHeap3;
 SearchEngineData::SearchEngineHeapPtr SearchEngineData::backwardHeap3;
 
-template<class DataFacadeT>
-class BasicRoutingInterface : boost::noncopyable {
-private:
+template <class DataFacadeT> class BasicRoutingInterface
+{
+  private:
     typedef typename DataFacadeT::EdgeData EdgeData;
-protected:
-    DataFacadeT * facade;
-public:
-    explicit BasicRoutingInterface( DataFacadeT * facade ) : facade(facade) { }
-    virtual ~BasicRoutingInterface(){ };
 
-    inline void RoutingStep(
-        SearchEngineData::QueryHeap & forward_heap,
-        SearchEngineData::QueryHeap & reverse_heap,
-        NodeID * middle_node_id,
-        int * upper_bound,
-        const bool forward_direction
-    ) const
+  protected:
+    DataFacadeT *facade;
+
+  public:
+    BasicRoutingInterface() = delete;
+    BasicRoutingInterface(const BasicRoutingInterface &) = delete;
+    explicit BasicRoutingInterface(DataFacadeT *facade) : facade(facade) {}
+    virtual ~BasicRoutingInterface() {};
+
+    inline void RoutingStep(SearchEngineData::QueryHeap &forward_heap,
+                            SearchEngineData::QueryHeap &reverse_heap,
+                            NodeID *middle_node_id,
+                            int *upper_bound,
+                            const bool forward_direction) const
     {
         const NodeID node = forward_heap.DeleteMin();
         const int distance = forward_heap.GetKey(node);
         if (reverse_heap.WasInserted(node))
         {
             const int new_distance = reverse_heap.GetKey(node) + distance;
-            if(new_distance < *upper_bound )
+            if (new_distance < *upper_bound)
             {
                 if (new_distance >= 0)
                 {
@@ -86,10 +86,10 @@ public:
             return;
         }
 
-        //Stalling
-        for (EdgeID edge = facade->BeginEdges( node ); edge < facade->EndEdges(node); ++edge)
+        // Stalling
+        for (auto edge : facade->GetAdjacentEdgeRange(node))
         {
-            const EdgeData & data = facade->GetEdgeData(edge);
+            const EdgeData &data = facade->GetEdgeData(edge);
             const bool reverse_flag = ((!forward_direction) ? data.forward : data.backward);
             if (reverse_flag)
             {
@@ -100,7 +100,7 @@ public:
 
                 if (forward_heap.WasInserted(to))
                 {
-                    if(forward_heap.GetKey( to ) + edge_weight < distance)
+                    if (forward_heap.GetKey(to) + edge_weight < distance)
                     {
                         return;
                     }
@@ -108,9 +108,9 @@ public:
             }
         }
 
-        for (EdgeID edge = facade->BeginEdges(node), end_edge = facade->EndEdges(node); edge < end_edge; ++edge)
+        for (auto edge : facade->GetAdjacentEdgeRange(node))
         {
-            const EdgeData & data = facade->GetEdgeData(edge);
+            const EdgeData &data = facade->GetEdgeData(edge);
             bool forward_directionFlag = (forward_direction ? data.forward : data.backward);
             if (forward_directionFlag)
             {
@@ -118,36 +118,41 @@ public:
                 const NodeID to = facade->GetTarget(edge);
                 const int edge_weight = data.distance;
 
-                BOOST_ASSERT_MSG( edge_weight > 0, "edge_weight invalid" );
+                BOOST_ASSERT_MSG(edge_weight > 0, "edge_weight invalid");
                 const int to_distance = distance + edge_weight;
 
-                //New Node discovered -> Add to Heap + Node Info Storage
-                if ( !forward_heap.WasInserted( to ) ) {
-                    forward_heap.Insert( to, to_distance, node );
+                // New Node discovered -> Add to Heap + Node Info Storage
+                if (!forward_heap.WasInserted(to))
+                {
+                    forward_heap.Insert(to, to_distance, node);
                 }
-                //Found a shorter Path -> Update distance
-                else if ( to_distance < forward_heap.GetKey( to ) ) {
-                    //new parent
-                    forward_heap.GetData( to ).parent = node;
-                    forward_heap.DecreaseKey( to, to_distance );
+                // Found a shorter Path -> Update distance
+                else if (to_distance < forward_heap.GetKey(to))
+                {
+                    // new parent
+                    forward_heap.GetData(to).parent = node;
+                    forward_heap.DecreaseKey(to, to_distance);
                 }
             }
         }
     }
 
-    inline void UnpackPath(const std::vector<NodeID> & packed_path, const PhantomNodes & phantom_node_pair, std::vector<PathData> & unpacked_path) const
+    inline void UnpackPath(const std::vector<NodeID> &packed_path,
+                           const PhantomNodes &phantom_node_pair,
+                           std::vector<PathData> &unpacked_path) const
     {
-        const bool start_traversed_in_reverse = (packed_path.front() != phantom_node_pair.source_phantom.forward_node_id);
-        const bool target_traversed_in_reverse = (packed_path.back() != phantom_node_pair.target_phantom.forward_node_id);
+        const bool start_traversed_in_reverse =
+            (packed_path.front() != phantom_node_pair.source_phantom.forward_node_id);
+        const bool target_traversed_in_reverse =
+            (packed_path.back() != phantom_node_pair.target_phantom.forward_node_id);
 
         const unsigned packed_path_size = packed_path.size();
-        std::stack<std::pair<NodeID, NodeID> > recursion_stack;
+        std::stack<std::pair<NodeID, NodeID>> recursion_stack;
 
-        //We have to push the path in reverse order onto the stack because it's LIFO.
-        for(unsigned i = packed_path_size-1; i > 0; --i){
-            recursion_stack.push(
-                std::make_pair(packed_path[i-1], packed_path[i])
-            );
+        // We have to push the path in reverse order onto the stack because it's LIFO.
+        for (unsigned i = packed_path_size - 1; i > 0; --i)
+        {
+            recursion_stack.emplace(packed_path[i - 1], packed_path[i]);
         }
 
         std::pair<NodeID, NodeID> edge;
@@ -160,11 +165,10 @@ public:
             // The above explanation unclear? Think!
             EdgeID smaller_edge_id = SPECIAL_EDGEID;
             int edge_weight = INT_MAX;
-            for (EdgeID edge_id = facade->BeginEdges(edge.first); edge_id < facade->EndEdges(edge.first); ++edge_id)
+            for (auto edge_id : facade->GetAdjacentEdgeRange(edge.first))
             {
                 const int weight = facade->GetEdgeData(edge_id).distance;
-                if ((facade->GetTarget(edge_id) == edge.second) &&
-                    (weight < edge_weight)                      &&
+                if ((facade->GetTarget(edge_id) == edge.second) && (weight < edge_weight) &&
                     facade->GetEdgeData(edge_id).forward)
                 {
                     smaller_edge_id = edge_id;
@@ -173,10 +177,11 @@ public:
             }
             if (SPECIAL_EDGEID == smaller_edge_id)
             {
-                for (EdgeID edge_id = facade->BeginEdges(edge.second); edge_id < facade->EndEdges(edge.second); ++edge_id)
+                for (auto edge_id : facade->GetAdjacentEdgeRange(edge.second))
                 {
                     const int weight = facade->GetEdgeData(edge_id).distance;
-                    if ((facade->GetTarget(edge_id) == edge.first) && (weight < edge_weight) && facade->GetEdgeData(edge_id).backward)
+                    if ((facade->GetTarget(edge_id) == edge.first) && (weight < edge_weight) &&
+                        facade->GetEdgeData(edge_id).backward)
                     {
                         smaller_edge_id = edge_id;
                         edge_weight = weight;
@@ -185,13 +190,13 @@ public:
             }
             BOOST_ASSERT_MSG(edge_weight != INVALID_EDGE_WEIGHT, "edge id invalid");
 
-            const EdgeData & ed = facade->GetEdgeData(smaller_edge_id);
+            const EdgeData &ed = facade->GetEdgeData(smaller_edge_id);
             if (ed.shortcut)
-            {//unpack
+            { // unpack
                 const NodeID middle_node_id = ed.id;
-                //again, we need to this in reversed order
-                recursion_stack.push(std::make_pair(middle_node_id, edge.second));
-                recursion_stack.push(std::make_pair(edge.first, middle_node_id));
+                // again, we need to this in reversed order
+                recursion_stack.emplace(middle_node_id, edge.second);
+                recursion_stack.emplace(edge.first, middle_node_id);
             }
             else
             {
@@ -201,57 +206,58 @@ public:
 
                 if (!facade->EdgeIsCompressed(ed.id))
                 {
-                    BOOST_ASSERT( !facade->EdgeIsCompressed(ed.id) );
-                    unpacked_path.push_back(
-                        PathData(
-                            facade->GetGeometryIndexForEdgeID(ed.id),
-                            name_index,
-                            turn_instruction,
-                            ed.distance
-                        )
-                    );
+                    BOOST_ASSERT(!facade->EdgeIsCompressed(ed.id));
+                    unpacked_path.emplace_back(facade->GetGeometryIndexForEdgeID(ed.id),
+                                               name_index,
+                                               turn_instruction,
+                                               ed.distance);
                 }
                 else
                 {
                     std::vector<unsigned> id_vector;
-                    facade->GetUncompressedGeometry(facade->GetGeometryIndexForEdgeID(ed.id), id_vector);
+                    facade->GetUncompressedGeometry(facade->GetGeometryIndexForEdgeID(ed.id),
+                                                    id_vector);
 
-                    const int start_index = ( unpacked_path.empty() ? ( ( start_traversed_in_reverse ) ?  id_vector.size() - phantom_node_pair.source_phantom.fwd_segment_position - 1 : phantom_node_pair.source_phantom.fwd_segment_position ) : 0 );
+                    const int start_index =
+                        (unpacked_path.empty()
+                             ? ((start_traversed_in_reverse)
+                                    ? id_vector.size() -
+                                          phantom_node_pair.source_phantom.fwd_segment_position - 1
+                                    : phantom_node_pair.source_phantom.fwd_segment_position)
+                             : 0);
                     const int end_index = id_vector.size();
 
                     BOOST_ASSERT(start_index >= 0);
                     BOOST_ASSERT(start_index <= end_index);
                     for (int i = start_index; i < end_index; ++i)
                     {
-                        unpacked_path.push_back(
-                            PathData(
-                                id_vector[i],
-                                name_index,
-                                TurnInstructionsClass::NoTurn,
-                                0
-                            )
-                        );
+                        unpacked_path.emplace_back(PathData{
+                            id_vector[i], name_index, TurnInstruction::NoTurn, 0});
                     }
-                    unpacked_path.back().turnInstruction = turn_instruction;
-                    unpacked_path.back().durationOfSegment = ed.distance;
+                    unpacked_path.back().turn_instruction = turn_instruction;
+                    unpacked_path.back().segment_duration = ed.distance;
                 }
             }
         }
         if (SPECIAL_EDGEID != phantom_node_pair.target_phantom.packed_geometry_id)
         {
             std::vector<unsigned> id_vector;
-            facade->GetUncompressedGeometry(phantom_node_pair.target_phantom.packed_geometry_id, id_vector);
+            facade->GetUncompressedGeometry(phantom_node_pair.target_phantom.packed_geometry_id,
+                                            id_vector);
             if (target_traversed_in_reverse)
             {
-                std::reverse(id_vector.begin(), id_vector.end() );
+                std::reverse(id_vector.begin(), id_vector.end());
             }
-            const bool is_local_path = (phantom_node_pair.source_phantom.packed_geometry_id  == phantom_node_pair.target_phantom.packed_geometry_id) && unpacked_path.empty();
+            const bool is_local_path = (phantom_node_pair.source_phantom.packed_geometry_id ==
+                                        phantom_node_pair.target_phantom.packed_geometry_id) &&
+                                       unpacked_path.empty();
 
             int start_index = 0;
             int end_index = phantom_node_pair.target_phantom.fwd_segment_position;
             if (target_traversed_in_reverse)
             {
-                end_index = id_vector.size() - phantom_node_pair.target_phantom.fwd_segment_position;
+                end_index =
+                    id_vector.size() - phantom_node_pair.target_phantom.fwd_segment_position;
             }
             if (is_local_path)
             {
@@ -259,23 +265,21 @@ public:
                 end_index = phantom_node_pair.target_phantom.fwd_segment_position;
                 if (target_traversed_in_reverse)
                 {
-                    start_index = id_vector.size() - phantom_node_pair.source_phantom.fwd_segment_position;
-                    end_index = id_vector.size() - phantom_node_pair.target_phantom.fwd_segment_position;
+                    start_index =
+                        id_vector.size() - phantom_node_pair.source_phantom.fwd_segment_position;
+                    end_index =
+                        id_vector.size() - phantom_node_pair.target_phantom.fwd_segment_position;
                 }
             }
 
             BOOST_ASSERT(start_index >= 0);
-            for (int i = start_index; i != end_index; (start_index < end_index ? ++i :--i))
+            for (int i = start_index; i != end_index; (start_index < end_index ? ++i : --i))
             {
-                BOOST_ASSERT( i >= -1 );
-                unpacked_path.push_back(
-                    PathData(
-                        id_vector[i],
-                        phantom_node_pair.target_phantom.name_id,
-                        TurnInstructionsClass::NoTurn,
-                        0
-                    )
-                );
+                BOOST_ASSERT(i >= -1);
+                unpacked_path.emplace_back(PathData{id_vector[i],
+                                           phantom_node_pair.target_phantom.name_id,
+                                           TurnInstruction::NoTurn,
+                                           0});
             }
         }
 
@@ -286,10 +290,10 @@ public:
         // the last node.
         if (unpacked_path.size() > 1)
         {
-            const unsigned last_index = unpacked_path.size()-1;
-            const unsigned second_to_last_index = last_index -1;
+            const unsigned last_index = unpacked_path.size() - 1;
+            const unsigned second_to_last_index = last_index - 1;
 
-            //looks like a trivially true check but tests for underflow
+            // looks like a trivially true check but tests for underflow
             BOOST_ASSERT(last_index > second_to_last_index);
 
             if (unpacked_path[last_index].node == unpacked_path[second_to_last_index].node)
@@ -300,10 +304,10 @@ public:
         }
     }
 
-    inline void UnpackEdge(const NodeID s, const NodeID t, std::vector<NodeID> & unpacked_path) const
+    inline void UnpackEdge(const NodeID s, const NodeID t, std::vector<NodeID> &unpacked_path) const
     {
-        std::stack<std::pair<NodeID, NodeID> > recursion_stack;
-        recursion_stack.push(std::make_pair(s,t));
+        std::stack<std::pair<NodeID, NodeID>> recursion_stack;
+        recursion_stack.emplace(s, t);
 
         std::pair<NodeID, NodeID> edge;
         while (!recursion_stack.empty())
@@ -313,14 +317,12 @@ public:
 
             EdgeID smaller_edge_id = SPECIAL_EDGEID;
             int edge_weight = INT_MAX;
-            for (EdgeID edge_id = facade->BeginEdges(edge.first); edge_id < facade->EndEdges(edge.first); ++edge_id)
+            for (auto edge_id : facade->GetAdjacentEdgeRange(edge.first))
             {
                 const int weight = facade->GetEdgeData(edge_id).distance;
-                if(
-                    (facade->GetTarget(edge_id) == edge.second) &&
-                    (weight < edge_weight)               &&
-                    facade->GetEdgeData(edge_id).forward
-                ){
+                if ((facade->GetTarget(edge_id) == edge.second) && (weight < edge_weight) &&
+                    facade->GetEdgeData(edge_id).forward)
+                {
                     smaller_edge_id = edge_id;
                     edge_weight = weight;
                 }
@@ -328,10 +330,11 @@ public:
 
             if (SPECIAL_EDGEID == smaller_edge_id)
             {
-                for (EdgeID edge_id = facade->BeginEdges(edge.second); edge_id < facade->EndEdges(edge.second); ++edge_id)
+                for (auto edge_id : facade->GetAdjacentEdgeRange(edge.second))
                 {
                     const int weight = facade->GetEdgeData(edge_id).distance;
-                    if ((facade->GetTarget(edge_id) == edge.first) && (weight < edge_weight) && facade->GetEdgeData(edge_id).backward)
+                    if ((facade->GetTarget(edge_id) == edge.first) && (weight < edge_weight) &&
+                        facade->GetEdgeData(edge_id).backward)
                     {
                         smaller_edge_id = edge_id;
                         edge_weight = weight;
@@ -340,59 +343,55 @@ public:
             }
             BOOST_ASSERT_MSG(edge_weight != INT_MAX, "edge weight invalid");
 
-            const EdgeData& ed = facade->GetEdgeData(smaller_edge_id);
+            const EdgeData &ed = facade->GetEdgeData(smaller_edge_id);
             if (ed.shortcut)
-            {//unpack
+            { // unpack
                 const NodeID middle_node_id = ed.id;
-                //again, we need to this in reversed order
-                recursion_stack.push(std::make_pair(middle_node_id, edge.second));
-                recursion_stack.push(std::make_pair(edge.first, middle_node_id));
+                // again, we need to this in reversed order
+                recursion_stack.emplace(middle_node_id, edge.second);
+                recursion_stack.emplace(edge.first, middle_node_id);
             }
             else
             {
                 BOOST_ASSERT_MSG(!ed.shortcut, "edge must be shortcut");
-                unpacked_path.push_back(edge.first );
+                unpacked_path.emplace_back(edge.first);
             }
         }
-        unpacked_path.push_back(t);
+        unpacked_path.emplace_back(t);
     }
 
-    inline void RetrievePackedPathFromHeap(
-        const SearchEngineData::QueryHeap & forward_heap,
-        const SearchEngineData::QueryHeap & reverse_heap,
-        const NodeID middle_node_id,
-        std::vector<NodeID> & packed_path
-    ) const
+    inline void RetrievePackedPathFromHeap(const SearchEngineData::QueryHeap &forward_heap,
+                                           const SearchEngineData::QueryHeap &reverse_heap,
+                                           const NodeID middle_node_id,
+                                           std::vector<NodeID> &packed_path) const
     {
         NodeID current_node_id = middle_node_id;
-        while(current_node_id != forward_heap.GetData(current_node_id).parent)
+        while (current_node_id != forward_heap.GetData(current_node_id).parent)
         {
             current_node_id = forward_heap.GetData(current_node_id).parent;
-            packed_path.push_back(current_node_id);
+            packed_path.emplace_back(current_node_id);
         }
         std::reverse(packed_path.begin(), packed_path.end());
-        packed_path.push_back(middle_node_id);
+        packed_path.emplace_back(middle_node_id);
         current_node_id = middle_node_id;
         while (current_node_id != reverse_heap.GetData(current_node_id).parent)
         {
             current_node_id = reverse_heap.GetData(current_node_id).parent;
-            packed_path.push_back(current_node_id);
-    	}
+            packed_path.emplace_back(current_node_id);
+        }
     }
 
-    inline void RetrievePackedPathFromSingleHeap(
-        const SearchEngineData::QueryHeap & search_heap,
-        const NodeID middle_node_id,
-        std::vector<NodeID>& packed_path
-    ) const
+    inline void RetrievePackedPathFromSingleHeap(const SearchEngineData::QueryHeap &search_heap,
+                                                 const NodeID middle_node_id,
+                                                 std::vector<NodeID> &packed_path) const
     {
         NodeID current_node_id = middle_node_id;
-        while(current_node_id != search_heap.GetData(current_node_id).parent)
+        while (current_node_id != search_heap.GetData(current_node_id).parent)
         {
             current_node_id = search_heap.GetData(current_node_id).parent;
-            packed_path.push_back(current_node_id);
+            packed_path.emplace_back(current_node_id);
         }
     }
 };
 
-#endif /* BASICROUTINGINTERFACE_H_ */
+#endif // BASIC_ROUTING_INTERFACE_H

RoutingAlgorithms/ManyToManyRouting.h

@@ -0,0 +1,246 @@
+/*
+
+Copyright (c) 2014, Project OSRM, Dennis Luxen, others
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list
+of conditions and the following disclaimer.
+Redistributions in binary form must reproduce the above copyright notice, this
+list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+#ifndef MANY_TO_MANY_ROUTING_H
+#define MANY_TO_MANY_ROUTING_H
+
+#include "BasicRoutingInterface.h"
+#include "../DataStructures/SearchEngineData.h"
+#include "../typedefs.h"
+
+#include <boost/assert.hpp>
+
+#include <limits>
+#include <memory>
+#include <unordered_map>
+#include <vector>
+
+template <class DataFacadeT> class ManyToManyRouting : public BasicRoutingInterface<DataFacadeT>
+{
+    typedef BasicRoutingInterface<DataFacadeT> super;
+    typedef SearchEngineData::QueryHeap QueryHeap;
+    SearchEngineData &engine_working_data;
+
+    struct NodeBucket
+    {
+        unsigned target_id; // essentially a row in the distance matrix
+        EdgeWeight distance;
+        NodeBucket(const unsigned target_id, const EdgeWeight distance)
+            : target_id(target_id), distance(distance)
+        {
+        }
+    };
+    typedef std::unordered_map<NodeID, std::vector<NodeBucket>> SearchSpaceWithBuckets;
+
+  public:
+    ManyToManyRouting(DataFacadeT *facade, SearchEngineData &engine_working_data)
+        : super(facade), engine_working_data(engine_working_data)
+    {
+    }
+
+    ~ManyToManyRouting() {}
+
+    std::shared_ptr<std::vector<EdgeWeight>>
+    operator()(const std::vector<PhantomNode> &phantom_nodes_vector) const
+    {
+        const unsigned number_of_locations = phantom_nodes_vector.size();
+        std::shared_ptr<std::vector<EdgeWeight>> result_table = std::make_shared<std::vector<EdgeWeight>>(
+            number_of_locations * number_of_locations, std::numeric_limits<EdgeWeight>::max());
+
+        engine_working_data.InitializeOrClearFirstThreadLocalStorage(
+            super::facade->GetNumberOfNodes());
+
+        QueryHeap &query_heap = *(engine_working_data.forwardHeap);
+
+        SearchSpaceWithBuckets search_space_with_buckets;
+
+        unsigned target_id = 0;
+        for (const PhantomNode &phantom_node : phantom_nodes_vector)
+        {
+            query_heap.Clear();
+            // insert target(s) at distance 0
+            if (SPECIAL_NODEID != phantom_node.forward_node_id)
+            {
+                query_heap.Insert(phantom_node.forward_node_id, phantom_node.GetForwardWeightPlusOffset(), phantom_node.forward_node_id);
+            }
+            if (SPECIAL_NODEID != phantom_node.reverse_node_id)
+            {
+                query_heap.Insert(phantom_node.reverse_node_id, phantom_node.GetReverseWeightPlusOffset(), phantom_node.reverse_node_id);
+            }
+
+            // explore search space
+            while (!query_heap.Empty())
+            {
+                BackwardRoutingStep(target_id, query_heap, search_space_with_buckets);
+            }
+            ++target_id;
+        }
+
+        // for each source do forward search
+        unsigned source_id = 0;
+        for (const PhantomNode &phantom_node : phantom_nodes_vector)
+        {
+            query_heap.Clear();
+            // insert sources at distance 0
+            if (SPECIAL_NODEID != phantom_node.forward_node_id)
+            {
+                query_heap.Insert(phantom_node.forward_node_id, -phantom_node.GetForwardWeightPlusOffset(), phantom_node.forward_node_id);
+            }
+            if (SPECIAL_NODEID != phantom_node.reverse_node_id)
+            {
+                query_heap.Insert(phantom_node.reverse_node_id, -phantom_node.GetReverseWeightPlusOffset(), phantom_node.reverse_node_id);
+            }
+
+            // explore search space
+            while (!query_heap.Empty())
+            {
+                ForwardRoutingStep(source_id,
+                                   number_of_locations,
+                                   query_heap,
+                                   search_space_with_buckets,
+                                   result_table);
+            }
+
+            ++source_id;
+        }
+        BOOST_ASSERT(source_id == target_id);
+        return result_table;
+    }
+
+    void ForwardRoutingStep(const unsigned source_id,
+                            const unsigned number_of_locations,
+                            QueryHeap &query_heap,
+                            const SearchSpaceWithBuckets &search_space_with_buckets,
+                            std::shared_ptr<std::vector<EdgeWeight>> result_table) const
+    {
+        const NodeID node = query_heap.DeleteMin();
+        const int source_distance = query_heap.GetKey(node);
+
+        // check if each encountered node has an entry
+        const auto bucket_iterator = search_space_with_buckets.find(node);
+        // iterate bucket if there exists one
+        if (bucket_iterator != search_space_with_buckets.end())
+        {
+            const std::vector<NodeBucket> &bucket_list = bucket_iterator->second;
+            for (const NodeBucket &current_bucket : bucket_list)
+            {
+                // get target id from bucket entry
+                const unsigned target_id = current_bucket.target_id;
+                const int target_distance = current_bucket.distance;
+                const EdgeWeight current_distance =
+                    (*result_table)[source_id * number_of_locations + target_id];
+                // check if new distance is better
+                if ((source_distance + target_distance) < current_distance)
+                {
+                    (*result_table)[source_id * number_of_locations + target_id] =
+                        (source_distance + target_distance);
+                }
+            }
+        }
+        if (StallAtNode<true>(node, source_distance, query_heap))
+        {
+            return;
+        }
+        RelaxOutgoingEdges<true>(node, source_distance, query_heap);
+    }
+
+    void BackwardRoutingStep(const unsigned target_id,
+                             QueryHeap &query_heap,
+                             SearchSpaceWithBuckets &search_space_with_buckets) const
+    {
+        const NodeID node = query_heap.DeleteMin();
+        const int target_distance = query_heap.GetKey(node);
+
+        // store settled nodes in search space bucket
+        search_space_with_buckets[node].emplace_back(target_id, target_distance);
+
+        if (StallAtNode<false>(node, target_distance, query_heap))
+        {
+            return;
+        }
+
+        RelaxOutgoingEdges<false>(node, target_distance, query_heap);
+    }
+
+    template <bool forward_direction>
+    inline void
+    RelaxOutgoingEdges(const NodeID node, const EdgeWeight distance, QueryHeap &query_heap) const
+    {
+        for (auto edge : super::facade->GetAdjacentEdgeRange(node))
+        {
+            const auto &data = super::facade->GetEdgeData(edge);
+            const bool direction_flag = (forward_direction ? data.forward : data.backward);
+            if (direction_flag)
+            {
+                const NodeID to = super::facade->GetTarget(edge);
+                const int edge_weight = data.distance;
+
+                BOOST_ASSERT_MSG(edge_weight > 0, "edge_weight invalid");
+                const int to_distance = distance + edge_weight;
+
+                // New Node discovered -> Add to Heap + Node Info Storage
+                if (!query_heap.WasInserted(to))
+                {
+                    query_heap.Insert(to, to_distance, node);
+                }
+                // Found a shorter Path -> Update distance
+                else if (to_distance < query_heap.GetKey(to))
+                {
+                    // new parent
+                    query_heap.GetData(to).parent = node;
+                    query_heap.DecreaseKey(to, to_distance);
+                }
+            }
+        }
+    }
+
+    // Stalling
+    template <bool forward_direction>
+    inline bool StallAtNode(const NodeID node, const EdgeWeight distance, QueryHeap &query_heap) const
+    {
+        for (auto edge : super::facade->GetAdjacentEdgeRange(node))
+        {
+            const auto &data = super::facade->GetEdgeData(edge);
+            const bool reverse_flag = ((!forward_direction) ? data.forward : data.backward);
+            if (reverse_flag)
+            {
+                const NodeID to = super::facade->GetTarget(edge);
+                const int edge_weight = data.distance;
+                BOOST_ASSERT_MSG(edge_weight > 0, "edge_weight invalid");
+                if (query_heap.WasInserted(to))
+                {
+                    if (query_heap.GetKey(to) + edge_weight < distance)
+                    {
+                        return true;
+                    }
+                }
+            }
+        }
+        return false;
+    }
+};
+#endif

RoutingAlgorithms/ShortestPathRouting.h

@@ -25,332 +25,266 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef SHORTESTPATHROUTING_H_
-#define SHORTESTPATHROUTING_H_
+#ifndef SHORTEST_PATH_ROUTING_H
+#define SHORTEST_PATH_ROUTING_H
 
 #include <boost/assert.hpp>
-#include <boost/foreach.hpp>
 
 #include "BasicRoutingInterface.h"
 #include "../DataStructures/SearchEngineData.h"
 #include "../typedefs.h"
 
-template<class DataFacadeT>
-class ShortestPathRouting : public BasicRoutingInterface<DataFacadeT>{
+template <class DataFacadeT> class ShortestPathRouting : public BasicRoutingInterface<DataFacadeT>
+{
     typedef BasicRoutingInterface<DataFacadeT> super;
     typedef SearchEngineData::QueryHeap QueryHeap;
-    SearchEngineData & engine_working_data;
+    SearchEngineData &engine_working_data;
 
-public:
-    ShortestPathRouting(
-        DataFacadeT * facade,
-        SearchEngineData & engine_working_data
-    ) :
-        super(facade),
-        engine_working_data(engine_working_data)
-    { }
-
-    ~ShortestPathRouting() { }
-
-    void operator()(
-        const std::vector<PhantomNodes> & phantom_nodes_vector,
-        RawRouteData & raw_route_data
-    ) const
+  public:
+    ShortestPathRouting(DataFacadeT *facade, SearchEngineData &engine_working_data)
+        : super(facade), engine_working_data(engine_working_data)
     {
-        BOOST_FOREACH(
-            const PhantomNodes & phantom_node_pair,
-            phantom_nodes_vector
-        ){
-            if( phantom_node_pair.AtLeastOnePhantomNodeIsInvalid() ) {
-                // raw_route_data.lengthOfShortestPath = INT_MAX;
-                // raw_route_data.lengthOfAlternativePath = INT_MAX;
-                return;
-            }
+    }
+
+    ~ShortestPathRouting() {}
+
+    void operator()(const std::vector<PhantomNodes> &phantom_nodes_vector,
+                    RawRouteData &raw_route_data) const
+    {
+        if(std::any_of(begin(phantom_nodes_vector),
+                        end(phantom_nodes_vector),
+                        [](PhantomNodes phantom_node_pair)
+                        { return phantom_node_pair.AtLeastOnePhantomNodeIsInvalid(); }))
+        {
+            BOOST_ASSERT(false);
+            return;
         }
+
         int distance1 = 0;
         int distance2 = 0;
         bool search_from_1st_node = true;
         bool search_from_2nd_node = true;
         NodeID middle1 = UINT_MAX;
         NodeID middle2 = UINT_MAX;
-        std::vector<std::vector<NodeID> > packed_legs1(phantom_nodes_vector.size());
-        std::vector<std::vector<NodeID> > packed_legs2(phantom_nodes_vector.size());
+        std::vector<std::vector<NodeID>> packed_legs1(phantom_nodes_vector.size());
+        std::vector<std::vector<NodeID>> packed_legs2(phantom_nodes_vector.size());
 
         engine_working_data.InitializeOrClearFirstThreadLocalStorage(
-            super::facade->GetNumberOfNodes()
-        );
+            super::facade->GetNumberOfNodes());
         engine_working_data.InitializeOrClearSecondThreadLocalStorage(
-            super::facade->GetNumberOfNodes()
-        );
+            super::facade->GetNumberOfNodes());
         engine_working_data.InitializeOrClearThirdThreadLocalStorage(
-            super::facade->GetNumberOfNodes()
-        );
+            super::facade->GetNumberOfNodes());
 
-        QueryHeap & forward_heap1 = *(engine_working_data.forwardHeap);
-        QueryHeap & reverse_heap1 = *(engine_working_data.backwardHeap);
-        QueryHeap & forward_heap2 = *(engine_working_data.forwardHeap2);
-        QueryHeap & reverse_heap2 = *(engine_working_data.backwardHeap2);
+        QueryHeap &forward_heap1 = *(engine_working_data.forwardHeap);
+        QueryHeap &reverse_heap1 = *(engine_working_data.backwardHeap);
+        QueryHeap &forward_heap2 = *(engine_working_data.forwardHeap2);
+        QueryHeap &reverse_heap2 = *(engine_working_data.backwardHeap2);
 
         int current_leg = 0;
-        //Get distance to next pair of target nodes.
-        BOOST_FOREACH(
-            const PhantomNodes & phantom_node_pair, phantom_nodes_vector
-        ){
-            forward_heap1.Clear();	forward_heap2.Clear();
-            reverse_heap1.Clear();	reverse_heap2.Clear();
+        // Get distance to next pair of target nodes.
+        for (const PhantomNodes &phantom_node_pair : phantom_nodes_vector)
+        {
+            forward_heap1.Clear();
+            forward_heap2.Clear();
+            reverse_heap1.Clear();
+            reverse_heap2.Clear();
             int local_upper_bound1 = INT_MAX;
             int local_upper_bound2 = INT_MAX;
 
             middle1 = UINT_MAX;
             middle2 = UINT_MAX;
 
-            //insert new starting nodes into forward heap, adjusted by previous distances.
-            if(
-                search_from_1st_node &&
-                phantom_node_pair.source_phantom.forward_node_id != SPECIAL_NODEID
-            ) {
-                // SimpleLogger().Write(logDEBUG) << "fwd1 insert: " << phantom_node_pair.source_phantom.forward_node_id << ", w: " << -phantom_node_pair.source_phantom.GetForwardWeightPlusOffset();
+            // insert new starting nodes into forward heap, adjusted by previous distances.
+            if (search_from_1st_node &&
+                phantom_node_pair.source_phantom.forward_node_id != SPECIAL_NODEID)
+            {
                 forward_heap1.Insert(
                     phantom_node_pair.source_phantom.forward_node_id,
-                    distance1-phantom_node_pair.source_phantom.GetForwardWeightPlusOffset(),
-                    phantom_node_pair.source_phantom.forward_node_id
-                );
+                    distance1 - phantom_node_pair.source_phantom.GetForwardWeightPlusOffset(),
+                    phantom_node_pair.source_phantom.forward_node_id);
                 forward_heap2.Insert(
                     phantom_node_pair.source_phantom.forward_node_id,
-                    distance1-phantom_node_pair.source_phantom.GetForwardWeightPlusOffset(),
-                    phantom_node_pair.source_phantom.forward_node_id
-                );
+                    distance1 - phantom_node_pair.source_phantom.GetForwardWeightPlusOffset(),
+                    phantom_node_pair.source_phantom.forward_node_id);
             }
-            if(
-                search_from_2nd_node &&
-                phantom_node_pair.source_phantom.reverse_node_id != SPECIAL_NODEID
-            ) {
-                // SimpleLogger().Write(logDEBUG) << "fwd1 insert: " << phantom_node_pair.source_phantom.reverse_node_id << ", w: " << -phantom_node_pair.source_phantom.GetReverseWeightPlusOffset();
+            if (search_from_2nd_node &&
+                phantom_node_pair.source_phantom.reverse_node_id != SPECIAL_NODEID)
+            {
                 forward_heap1.Insert(
                     phantom_node_pair.source_phantom.reverse_node_id,
-                    distance2-phantom_node_pair.source_phantom.GetReverseWeightPlusOffset(),
-                    phantom_node_pair.source_phantom.reverse_node_id
-                );
+                    distance2 - phantom_node_pair.source_phantom.GetReverseWeightPlusOffset(),
+                    phantom_node_pair.source_phantom.reverse_node_id);
                 forward_heap2.Insert(
                     phantom_node_pair.source_phantom.reverse_node_id,
-                    distance2-phantom_node_pair.source_phantom.GetReverseWeightPlusOffset(),
-                    phantom_node_pair.source_phantom.reverse_node_id
-                );
+                    distance2 - phantom_node_pair.source_phantom.GetReverseWeightPlusOffset(),
+                    phantom_node_pair.source_phantom.reverse_node_id);
             }
 
-            //insert new backward nodes into backward heap, unadjusted.
-            if( phantom_node_pair.target_phantom.forward_node_id != SPECIAL_NODEID ) {
-                // SimpleLogger().Write(logDEBUG) << "rev insert: " << phantom_node_pair.target_phantom.forward_node_id << ", w: " << phantom_node_pair.target_phantom.GetForwardWeightPlusOffset();
-                reverse_heap1.Insert(
-                    phantom_node_pair.target_phantom.forward_node_id,
-                    phantom_node_pair.target_phantom.GetForwardWeightPlusOffset(),
-                    phantom_node_pair.target_phantom.forward_node_id
-                );
+            // insert new backward nodes into backward heap, unadjusted.
+            if (phantom_node_pair.target_phantom.forward_node_id != SPECIAL_NODEID)
+            {
+                reverse_heap1.Insert(phantom_node_pair.target_phantom.forward_node_id,
+                                     phantom_node_pair.target_phantom.GetForwardWeightPlusOffset(),
+                                     phantom_node_pair.target_phantom.forward_node_id);
             }
 
-            if( phantom_node_pair.target_phantom.reverse_node_id != SPECIAL_NODEID ) {
-                // SimpleLogger().Write(logDEBUG) << "rev insert: " << phantom_node_pair.target_phantom.reverse_node_id << ", w: " << phantom_node_pair.target_phantom.GetReverseWeightPlusOffset();
-                reverse_heap2.Insert(
-                    phantom_node_pair.target_phantom.reverse_node_id,
-                    phantom_node_pair.target_phantom.GetReverseWeightPlusOffset(),
-                    phantom_node_pair.target_phantom.reverse_node_id
-                );
+            if (phantom_node_pair.target_phantom.reverse_node_id != SPECIAL_NODEID)
+            {
+                reverse_heap2.Insert(phantom_node_pair.target_phantom.reverse_node_id,
+                                     phantom_node_pair.target_phantom.GetReverseWeightPlusOffset(),
+                                     phantom_node_pair.target_phantom.reverse_node_id);
             }
 
-            // const int forward_offset = phantom_node_pair.ComputeForwardQueueOffset();
-            // const int forward_offset =  super::ComputeForwardOffset(
-            //                                 phantom_node_pair.source_phantom
-            //                             );
-            // const int reverse_offset = -phantom_node_pair.ComputeReverseQueueOffset();
-            // const int reverse_offset =  super::ComputeReverseOffset(
-            //                                 phantom_node_pair.target_phantom
-            //                             );
-
-            //run two-Target Dijkstra routing step.
-            while(0 < (forward_heap1.Size() + reverse_heap1.Size() )){
-                if( 0 < forward_heap1.Size() ){
+            // run two-Target Dijkstra routing step.
+            while (0 < (forward_heap1.Size() + reverse_heap1.Size()))
+            {
+                if (0 < forward_heap1.Size())
+                {
                     super::RoutingStep(
-                        forward_heap1,
-                        reverse_heap1,
-                        &middle1,
-                        &local_upper_bound1,
-                        true
-                    );
+                        forward_heap1, reverse_heap1, &middle1, &local_upper_bound1, true);
                 }
-                if( 0 < reverse_heap1.Size() ){
+                if (0 < reverse_heap1.Size())
+                {
                     super::RoutingStep(
-                        reverse_heap1,
-                        forward_heap1,
-                        &middle1,
-                        &local_upper_bound1,
-                        false
-                    );
+                        reverse_heap1, forward_heap1, &middle1, &local_upper_bound1, false);
                 }
             }
 
-            if( !reverse_heap2.Empty() ) {
-                while(0 < (forward_heap2.Size() + reverse_heap2.Size() )){
-                    if( 0 < forward_heap2.Size() ){
+            if (!reverse_heap2.Empty())
+            {
+                while (0 < (forward_heap2.Size() + reverse_heap2.Size()))
+                {
+                    if (0 < forward_heap2.Size())
+                    {
                         super::RoutingStep(
-                            forward_heap2,
-                            reverse_heap2,
-                            &middle2,
-                            &local_upper_bound2,
-                            true
-                        );
+                            forward_heap2, reverse_heap2, &middle2, &local_upper_bound2, true);
                     }
-                    if( 0 < reverse_heap2.Size() ){
+                    if (0 < reverse_heap2.Size())
+                    {
                         super::RoutingStep(
-                            reverse_heap2,
-                            forward_heap2,
-                            &middle2,
-                            &local_upper_bound2,
-                            false
-                        );
+                            reverse_heap2, forward_heap2, &middle2, &local_upper_bound2, false);
                     }
                 }
             }
 
-            //No path found for both target nodes?
-            if(
-                (INVALID_EDGE_WEIGHT == local_upper_bound1) &&
-                (INVALID_EDGE_WEIGHT == local_upper_bound2)
-            ) {
-                raw_route_data.lengthOfShortestPath = INVALID_EDGE_WEIGHT;
-                raw_route_data.lengthOfAlternativePath = INVALID_EDGE_WEIGHT;
+            // No path found for both target nodes?
+            if ((INVALID_EDGE_WEIGHT == local_upper_bound1) &&
+                (INVALID_EDGE_WEIGHT == local_upper_bound2))
+            {
+                raw_route_data.shortest_path_length = INVALID_EDGE_WEIGHT;
+                raw_route_data.alternative_path_length = INVALID_EDGE_WEIGHT;
                 return;
             }
-            if( SPECIAL_NODEID == middle1 ) {
+            if (SPECIAL_NODEID == middle1)
+            {
                 search_from_1st_node = false;
             }
-            if( SPECIAL_NODEID == middle2 ) {
+            if (SPECIAL_NODEID == middle2)
+            {
                 search_from_2nd_node = false;
             }
 
-            //Was at most one of the two paths not found?
-            BOOST_ASSERT_MSG(
-                (INT_MAX != distance1 || INT_MAX != distance2),
-                "no path found"
-            );
+            // Was at most one of the two paths not found?
+            BOOST_ASSERT_MSG((INT_MAX != distance1 || INT_MAX != distance2), "no path found");
 
-            //Unpack paths if they exist
+            // Unpack paths if they exist
             std::vector<NodeID> temporary_packed_leg1;
             std::vector<NodeID> temporary_packed_leg2;
 
-            BOOST_ASSERT( (unsigned)current_leg < packed_legs1.size() );
-            BOOST_ASSERT( (unsigned)current_leg < packed_legs2.size() );
+            BOOST_ASSERT((unsigned)current_leg < packed_legs1.size());
+            BOOST_ASSERT((unsigned)current_leg < packed_legs2.size());
 
-            if( INVALID_EDGE_WEIGHT != local_upper_bound1 ) {
+            if (INVALID_EDGE_WEIGHT != local_upper_bound1)
+            {
                 super::RetrievePackedPathFromHeap(
-                    forward_heap1,
-                    reverse_heap1,
-                    middle1,
-                    temporary_packed_leg1
-                );
+                    forward_heap1, reverse_heap1, middle1, temporary_packed_leg1);
             }
 
-            if( INVALID_EDGE_WEIGHT != local_upper_bound2 ) {
+            if (INVALID_EDGE_WEIGHT != local_upper_bound2)
+            {
                 super::RetrievePackedPathFromHeap(
-                    forward_heap2,
-                    reverse_heap2,
-                    middle2,
-                    temporary_packed_leg2
-                );
+                    forward_heap2, reverse_heap2, middle2, temporary_packed_leg2);
             }
 
-            //if one of the paths was not found, replace it with the other one.
-            if( temporary_packed_leg1.empty() ) {
-                temporary_packed_leg1.insert(
-                    temporary_packed_leg1.end(),
-                    temporary_packed_leg2.begin(),
-                    temporary_packed_leg2.end()
-                );
+            // if one of the paths was not found, replace it with the other one.
+            if (temporary_packed_leg1.empty())
+            {
+                temporary_packed_leg1.insert(temporary_packed_leg1.end(),
+                                             temporary_packed_leg2.begin(),
+                                             temporary_packed_leg2.end());
                 local_upper_bound1 = local_upper_bound2;
             }
-            if( temporary_packed_leg2.empty() ) {
-                temporary_packed_leg2.insert(
-                    temporary_packed_leg2.end(),
-                    temporary_packed_leg1.begin(),
-                    temporary_packed_leg1.end()
-                );
+            if (temporary_packed_leg2.empty())
+            {
+                temporary_packed_leg2.insert(temporary_packed_leg2.end(),
+                                             temporary_packed_leg1.begin(),
+                                             temporary_packed_leg1.end());
                 local_upper_bound2 = local_upper_bound1;
             }
 
-            BOOST_ASSERT_MSG(
-                !temporary_packed_leg1.empty() ||
-                !temporary_packed_leg2.empty(),
-                "tempory packed paths empty"
-            );
+            BOOST_ASSERT_MSG(!temporary_packed_leg1.empty() || !temporary_packed_leg2.empty(),
+                             "tempory packed paths empty");
 
-            BOOST_ASSERT(
-                (0 == current_leg) || !packed_legs1[current_leg-1].empty()
-            );
-            BOOST_ASSERT(
-                (0 == current_leg) || !packed_legs2[current_leg-1].empty()
-            );
+            BOOST_ASSERT((0 == current_leg) || !packed_legs1[current_leg - 1].empty());
+            BOOST_ASSERT((0 == current_leg) || !packed_legs2[current_leg - 1].empty());
 
-            if( 0 < current_leg ) {
-                const NodeID end_id_of_segment1 = packed_legs1[current_leg-1].back();
-                const NodeID end_id_of_segment2 = packed_legs2[current_leg-1].back();
-                BOOST_ASSERT( !temporary_packed_leg1.empty() );
+            if (0 < current_leg)
+            {
+                const NodeID end_id_of_segment1 = packed_legs1[current_leg - 1].back();
+                const NodeID end_id_of_segment2 = packed_legs2[current_leg - 1].back();
+                BOOST_ASSERT(!temporary_packed_leg1.empty());
                 const NodeID start_id_of_leg1 = temporary_packed_leg1.front();
                 const NodeID start_id_of_leg2 = temporary_packed_leg2.front();
-                if( ( end_id_of_segment1 != start_id_of_leg1 ) &&
-                    ( end_id_of_segment2 != start_id_of_leg2 )
-                ) {
+                if ((end_id_of_segment1 != start_id_of_leg1) &&
+                    (end_id_of_segment2 != start_id_of_leg2))
+                {
                     std::swap(temporary_packed_leg1, temporary_packed_leg2);
                     std::swap(local_upper_bound1, local_upper_bound2);
                 }
             }
 
             // remove one path if both legs end at the same segment
-            if( 0 < current_leg ) {
+            if (0 < current_leg)
+            {
                 const NodeID start_id_of_leg1 = temporary_packed_leg1.front();
                 const NodeID start_id_of_leg2 = temporary_packed_leg2.front();
-                if(
-                    start_id_of_leg1 == start_id_of_leg2
-                ) {
-                    const NodeID last_id_of_packed_legs1 = packed_legs1[current_leg-1].back();
-                    const NodeID last_id_of_packed_legs2 = packed_legs2[current_leg-1].back();
-                    if( start_id_of_leg1 != last_id_of_packed_legs1 ) {
+                if (start_id_of_leg1 == start_id_of_leg2)
+                {
+                    const NodeID last_id_of_packed_legs1 = packed_legs1[current_leg - 1].back();
+                    const NodeID last_id_of_packed_legs2 = packed_legs2[current_leg - 1].back();
+                    if (start_id_of_leg1 != last_id_of_packed_legs1)
+                    {
                         packed_legs1 = packed_legs2;
-                        BOOST_ASSERT(
-                            start_id_of_leg1 == temporary_packed_leg1.front()
-                        );
-                    } else
-                    if( start_id_of_leg2 != last_id_of_packed_legs2 ) {
+                        BOOST_ASSERT(start_id_of_leg1 == temporary_packed_leg1.front());
+                    }
+                    else if (start_id_of_leg2 != last_id_of_packed_legs2)
+                    {
                         packed_legs2 = packed_legs1;
-                        BOOST_ASSERT(
-                            start_id_of_leg2 == temporary_packed_leg2.front()
-                        );
+                        BOOST_ASSERT(start_id_of_leg2 == temporary_packed_leg2.front());
                     }
                 }
             }
-            BOOST_ASSERT(
-                packed_legs1.size() == packed_legs2.size()
-            );
+            BOOST_ASSERT(packed_legs1.size() == packed_legs2.size());
 
-            packed_legs1[current_leg].insert(
-                packed_legs1[current_leg].end(),
-                temporary_packed_leg1.begin(),
-                temporary_packed_leg1.end()
-            );
-            BOOST_ASSERT(packed_legs1[current_leg].size() == temporary_packed_leg1.size() );
-            packed_legs2[current_leg].insert(
-                packed_legs2[current_leg].end(),
-                temporary_packed_leg2.begin(),
-                temporary_packed_leg2.end()
-            );
-            BOOST_ASSERT(packed_legs2[current_leg].size() == temporary_packed_leg2.size() );
+            packed_legs1[current_leg].insert(packed_legs1[current_leg].end(),
+                                             temporary_packed_leg1.begin(),
+                                             temporary_packed_leg1.end());
+            BOOST_ASSERT(packed_legs1[current_leg].size() == temporary_packed_leg1.size());
+            packed_legs2[current_leg].insert(packed_legs2[current_leg].end(),
+                                             temporary_packed_leg2.begin(),
+                                             temporary_packed_leg2.end());
+            BOOST_ASSERT(packed_legs2[current_leg].size() == temporary_packed_leg2.size());
 
-            if(
-                (packed_legs1[current_leg].back() == packed_legs2[current_leg].back()) &&
-                phantom_node_pair.target_phantom.isBidirected()
-            ) {
+            if ((packed_legs1[current_leg].back() == packed_legs2[current_leg].back()) &&
+                phantom_node_pair.target_phantom.isBidirected())
+            {
                 const NodeID last_node_id = packed_legs2[current_leg].back();
-                search_from_1st_node &= !(last_node_id == phantom_node_pair.target_phantom.reverse_node_id);
-                search_from_2nd_node &= !(last_node_id == phantom_node_pair.target_phantom.forward_node_id);
-                BOOST_ASSERT( search_from_1st_node != search_from_2nd_node );
+                search_from_1st_node &=
+                    !(last_node_id == phantom_node_pair.target_phantom.reverse_node_id);
+                search_from_2nd_node &=
+                    !(last_node_id == phantom_node_pair.target_phantom.forward_node_id);
+                BOOST_ASSERT(search_from_1st_node != search_from_2nd_node);
             }
 
             distance1 = local_upper_bound1;
@@ -360,45 +294,33 @@ public:
 
         if (distance1 > distance2)
         {
-            std::swap( packed_legs1, packed_legs2 );
+            std::swap(packed_legs1, packed_legs2);
         }
-        raw_route_data.unpacked_path_segments.resize( packed_legs1.size() );
-        // const int start_offset = ( packed_legs1[0].front() == phantom_nodes_vector.front().source_phantom.forward_node_id  ?  1 : -1 )*phantom_nodes_vector.front().source_phantom.fwd_segment_position;
+        raw_route_data.unpacked_path_segments.resize(packed_legs1.size());
 
-        raw_route_data.source_traversed_in_reverse = (packed_legs1.front().front() != phantom_nodes_vector.front().source_phantom.forward_node_id);
-        raw_route_data.target_traversed_in_reverse = (packed_legs1.back().back() != phantom_nodes_vector.back().target_phantom.forward_node_id);
+        raw_route_data.source_traversed_in_reverse =
+            (packed_legs1.front().front() !=
+             phantom_nodes_vector.front().source_phantom.forward_node_id);
+        raw_route_data.target_traversed_in_reverse =
+            (packed_legs1.back().back() !=
+             phantom_nodes_vector.back().target_phantom.forward_node_id);
 
         for (unsigned i = 0; i < packed_legs1.size(); ++i)
         {
             BOOST_ASSERT(!phantom_nodes_vector.empty());
-            // const bool at_beginning = (packed_legs1[i] == packed_legs1.front());
-            // const bool at_end = (packed_legs1[i] == packed_legs1.back());
             BOOST_ASSERT(packed_legs1.size() == raw_route_data.unpacked_path_segments.size());
 
             PhantomNodes unpack_phantom_node_pair = phantom_nodes_vector[i];
-            // if (!at_beginning)
-            // {
-            //     unpack_phantom_node_pair.source_phantom.packed_geometry_id = SPECIAL_EDGEID;
-            //     unpack_phantom_node_pair.source_phantom.fwd_segment_position = 0;
-            // }
-
-            // if (!at_end)
-            // {
-            //    unpack_phantom_node_pair.target_phantom.packed_geometry_id = SPECIAL_EDGEID;
-            //    unpack_phantom_node_pair.target_phantom.fwd_segment_position = 0;
-            // }
-
             super::UnpackPath(
                 // -- packed input
                 packed_legs1[i],
                 // -- start and end of (sub-)route
                 unpack_phantom_node_pair,
                 // -- unpacked output
-                raw_route_data.unpacked_path_segments[i]
-            );
+                raw_route_data.unpacked_path_segments[i]);
         }
-        raw_route_data.lengthOfShortestPath = std::min(distance1, distance2);
+        raw_route_data.shortest_path_length = std::min(distance1, distance2);
     }
 };
 
-#endif /* SHORTESTPATHROUTING_H_ */
+#endif /* SHORTEST_PATH_ROUTING_H */

Server/APIGrammar.h

@@ -35,15 +35,17 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 namespace qi = boost::spirit::qi;
 
 template <typename Iterator, class HandlerT>
-struct APIGrammar : qi::grammar<Iterator> {
-    explicit APIGrammar(HandlerT * h) : APIGrammar::base_type(api_call), handler(h) {
+struct APIGrammar : qi::grammar<Iterator>
+{
+    explicit APIGrammar(HandlerT * h) : APIGrammar::base_type(api_call), handler(h)
+    {
         api_call = qi::lit('/') >> string[boost::bind(&HandlerT::setService, handler, ::_1)] >> *(query);
         query    = ('?') >> (+(zoom | output | jsonp | checksum | location | hint | cmp | language | instruction | geometry | alt_route | old_API) ) ;
 
         zoom        = (-qi::lit('&')) >> qi::lit('z')            >> '=' >> qi::short_[boost::bind(&HandlerT::setZoomLevel, handler, ::_1)];
         output      = (-qi::lit('&')) >> qi::lit("output")       >> '=' >> string[boost::bind(&HandlerT::setOutputFormat, handler, ::_1)];
         jsonp       = (-qi::lit('&')) >> qi::lit("jsonp")        >> '=' >> stringwithPercent[boost::bind(&HandlerT::setJSONpParameter, handler, ::_1)];
-        checksum    = (-qi::lit('&')) >> qi::lit("checksum")     >> '=' >> qi::int_[boost::bind(&HandlerT::setChecksum, handler, ::_1)];
+        checksum    = (-qi::lit('&')) >> qi::lit("checksum")     >> '=' >> qi::uint_[boost::bind(&HandlerT::setChecksum, handler, ::_1)];
         instruction = (-qi::lit('&')) >> qi::lit("instructions") >> '=' >> qi::bool_[boost::bind(&HandlerT::setInstructionFlag, handler, ::_1)];
         geometry    = (-qi::lit('&')) >> qi::lit("geometry")     >> '=' >> qi::bool_[boost::bind(&HandlerT::setGeometryFlag, handler, ::_1)];
         cmp         = (-qi::lit('&')) >> qi::lit("compression")  >> '=' >> qi::bool_[boost::bind(&HandlerT::setCompressionFlag, handler, ::_1)];

Server/Connection.cpp

@@ -31,125 +31,88 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <boost/assert.hpp>
 #include <boost/bind.hpp>
-#include <boost/enable_shared_from_this.hpp>
 #include <boost/iostreams/filtering_stream.hpp>
 #include <boost/iostreams/filter/gzip.hpp>
 
 #include <string>
 #include <vector>
 
-namespace http {
+namespace http
+{
 
-Connection::Connection(
-    boost::asio::io_service& io_service,
-    RequestHandler& handler
-) :
-    strand(io_service),
-    TCP_socket(io_service),
-    request_handler(handler),
-    request_parser(new RequestParser())
-{ }
-
-Connection::~Connection() {
-    delete request_parser;
+Connection::Connection(boost::asio::io_service &io_service, RequestHandler &handler)
+    : strand(io_service), TCP_socket(io_service), request_handler(handler),
+      request_parser(new RequestParser())
+{
 }
 
-boost::asio::ip::tcp::socket& Connection::socket() {
-    return TCP_socket;
-}
+Connection::~Connection() { delete request_parser; }
+
+boost::asio::ip::tcp::socket &Connection::socket() { return TCP_socket; }
 
 /// Start the first asynchronous operation for the connection.
-void Connection::start() {
+void Connection::start()
+{
     TCP_socket.async_read_some(
         boost::asio::buffer(incoming_data_buffer),
-        strand.wrap( boost::bind(
-                        &Connection::handle_read,
-                        this->shared_from_this(),
-                        boost::asio::placeholders::error,
-                        boost::asio::placeholders::bytes_transferred)
-        )
-    );
+        strand.wrap(boost::bind(&Connection::handle_read,
+                                this->shared_from_this(),
+                                boost::asio::placeholders::error,
+                                boost::asio::placeholders::bytes_transferred)));
 }
 
-void Connection::handle_read(
-    const boost::system::error_code& e,
-    std::size_t bytes_transferred
-) {
-    if( !e ) {
+void Connection::handle_read(const boost::system::error_code &e, std::size_t bytes_transferred)
+{
+    if (!e)
+    {
         CompressionType compression_type(noCompression);
         boost::tribool result;
-        boost::tie(result, boost::tuples::ignore) = request_parser->Parse(
-            request,
-            incoming_data_buffer.data(),
-            incoming_data_buffer.data() + bytes_transferred,
-            &compression_type
-        );
+        boost::tie(result, boost::tuples::ignore) =
+            request_parser->Parse(request,
+                                  incoming_data_buffer.data(),
+                                  incoming_data_buffer.data() + bytes_transferred,
+                                  &compression_type);
 
-        if( result ) {
+        if (result)
+        {
             request.endpoint = TCP_socket.remote_endpoint().address();
             request_handler.handle_request(request, reply);
 
             Header compression_header;
             std::vector<char> compressed_output;
             std::vector<boost::asio::const_buffer> output_buffer;
-            switch(compression_type) {
+
+            switch (compression_type)
+            {
             case deflateRFC1951:
                 compression_header.name = "Content-Encoding";
                 compression_header.value = "deflate";
-                reply.headers.insert(
-                    reply.headers.begin(),
-                    compression_header
-                );
-                compressBufferCollection(
-                    reply.content,
-                    compression_type,
-                    compressed_output
-                );
+                reply.headers.insert(reply.headers.begin(), compression_header);
+                compressBufferCollection(reply.content, compression_type, compressed_output);
                 reply.setSize(compressed_output.size());
                 output_buffer = reply.HeaderstoBuffers();
-                output_buffer.push_back(
-                    boost::asio::buffer(compressed_output)
-                );
+                output_buffer.push_back(boost::asio::buffer(compressed_output));
                 boost::asio::async_write(
                     TCP_socket,
                     output_buffer,
-                    strand.wrap(
-                        boost::bind(
-                            &Connection::handle_write,
-                            this->shared_from_this(),
-                            boost::asio::placeholders::error
-                        )
-                    )
-                );
+                    strand.wrap(boost::bind(&Connection::handle_write,
+                                            this->shared_from_this(),
+                                            boost::asio::placeholders::error)));
                 break;
             case gzipRFC1952:
                 compression_header.name = "Content-Encoding";
                 compression_header.value = "gzip";
-                reply.headers.insert(
-                    reply.headers.begin(),
-                    compression_header
-                );
-                compressBufferCollection(
-                    reply.content,
-                    compression_type,
-                    compressed_output
-                );
+                reply.headers.insert(reply.headers.begin(), compression_header);
+                compressBufferCollection(reply.content, compression_type, compressed_output);
                 reply.setSize(compressed_output.size());
                 output_buffer = reply.HeaderstoBuffers();
-                output_buffer.push_back(
-                    boost::asio::buffer(compressed_output)
-                );
+                output_buffer.push_back(boost::asio::buffer(compressed_output));
                 boost::asio::async_write(
                     TCP_socket,
                     output_buffer,
-                    strand.wrap(
-                        boost::bind(
-                            &Connection::handle_write,
-                            this->shared_from_this(),
-                            boost::asio::placeholders::error
-                        )
-                    )
-                );
+                    strand.wrap(boost::bind(&Connection::handle_write,
+                                            this->shared_from_this(),
+                                            boost::asio::placeholders::error)));
                 break;
             case noCompression:
                 reply.SetUncompressedSize();
@@ -157,84 +120,62 @@ void Connection::handle_read(
                 boost::asio::async_write(
                     TCP_socket,
                     output_buffer,
-                    strand.wrap(
-                        boost::bind(
-                            &Connection::handle_write,
-                            this->shared_from_this(),
-                            boost::asio::placeholders::error
-                            )
-                        )
-                    );
+                    strand.wrap(boost::bind(&Connection::handle_write,
+                                            this->shared_from_this(),
+                                            boost::asio::placeholders::error)));
                 break;
             }
-        } else if (!result) {
+        }
+        else if (!result)
+        {
             reply = Reply::StockReply(Reply::badRequest);
 
-            boost::asio::async_write(
-                TCP_socket,
-                reply.toBuffers(),
-                strand.wrap(
-                    boost::bind(
-                        &Connection::handle_write,
-                        this->shared_from_this(),
-                        boost::asio::placeholders::error
-                    )
-                )
-            );
-        } else {
+            boost::asio::async_write(TCP_socket,
+                                     reply.toBuffers(),
+                                     strand.wrap(boost::bind(&Connection::handle_write,
+                                                             this->shared_from_this(),
+                                                             boost::asio::placeholders::error)));
+        }
+        else
+        {
             TCP_socket.async_read_some(
                 boost::asio::buffer(incoming_data_buffer),
-                strand.wrap(
-                    boost::bind(
-                        &Connection::handle_read,
-                        this->shared_from_this(),
-                        boost::asio::placeholders::error,
-                        boost::asio::placeholders::bytes_transferred
-                    )
-                )
-            );
+                strand.wrap(boost::bind(&Connection::handle_read,
+                                        this->shared_from_this(),
+                                        boost::asio::placeholders::error,
+                                        boost::asio::placeholders::bytes_transferred)));
         }
     }
 }
 
 /// Handle completion of a write operation.
-void Connection::handle_write(const boost::system::error_code& e) {
-    if (!e) {
+void Connection::handle_write(const boost::system::error_code &e)
+{
+    if (!e)
+    {
         // Initiate graceful connection closure.
         boost::system::error_code ignoredEC;
-        TCP_socket.shutdown(
-            boost::asio::ip::tcp::socket::shutdown_both,
-            ignoredEC
-        );
+        TCP_socket.shutdown(boost::asio::ip::tcp::socket::shutdown_both, ignoredEC);
     }
 }
 
-void Connection::compressBufferCollection(
-    std::vector<std::string> uncompressed_data,
-    CompressionType compression_type,
-    std::vector<char> & compressed_data
-) {
+void Connection::compressBufferCollection(std::vector<char> uncompressed_data,
+                                          CompressionType compression_type,
+                                          std::vector<char> &compressed_data)
+{
     boost::iostreams::gzip_params compression_parameters;
 
     compression_parameters.level = boost::iostreams::zlib::best_speed;
-    if ( deflateRFC1951 == compression_type ) {
+    if (deflateRFC1951 == compression_type)
+    {
         compression_parameters.noheader = true;
     }
 
-    BOOST_ASSERT( compressed_data.empty() );
-    boost::iostreams::filtering_ostream compressing_stream;
-
-    compressing_stream.push(
-        boost::iostreams::gzip_compressor(compression_parameters)
-    );
-    compressing_stream.push(
-        boost::iostreams::back_inserter(compressed_data)
-    );
-
-    BOOST_FOREACH( const std::string & line, uncompressed_data) {
-        compressing_stream << line;
-    }
-
-    compressing_stream.reset();
+    BOOST_ASSERT(compressed_data.empty());
+    boost::iostreams::filtering_ostream gzip_stream;
+    gzip_stream.push(boost::iostreams::gzip_compressor(compression_parameters));
+    gzip_stream.push(boost::iostreams::back_inserter(compressed_data));
+    gzip_stream.write(&uncompressed_data[0], uncompressed_data.size());
+    boost::iostreams::close(gzip_stream);
 }
 }

Server/Connection.h

@@ -35,56 +35,71 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <boost/array.hpp>
 #include <boost/asio.hpp>
-#include <boost/enable_shared_from_this.hpp>
-#include <boost/noncopyable.hpp>
+#include <boost/config.hpp>
+#include <boost/version.hpp>
+
+ #include <memory>
+ #include <string>
+ #include <vector>
+
+//workaround for incomplete std::shared_ptr compatibility in old boost versions
+#if BOOST_VERSION < 105300 || defined BOOST_NO_CXX11_SMART_PTR
+
+namespace boost {
+template<class T>
+const T* get_pointer(std::shared_ptr<T> const& p)
+{
+    return p.get();
+}
+
+template<class T>
+T* get_pointer(std::shared_ptr<T>& p)
+{
+    return p.get();
+}
+} // namespace boost
+
+#endif
+
 
-#include <string>
-#include <vector>
 
 class RequestHandler;
 
-namespace http {
+namespace http
+{
 
 class RequestParser;
 
 /// Represents a single connection from a client.
-class Connection : 	public boost::enable_shared_from_this<Connection>,
-					private boost::noncopyable {
-public:
-	explicit Connection(
-		boost::asio::io_service& io_service,
-		RequestHandler& handler
-	);
+class Connection : public std::enable_shared_from_this<Connection>
+{
+  public:
+    explicit Connection(boost::asio::io_service &io_service, RequestHandler &handler);
+    Connection(const Connection &) = delete;
+    ~Connection();
 
-	~Connection();
+    boost::asio::ip::tcp::socket &socket();
 
-	boost::asio::ip::tcp::socket& socket();
+    /// Start the first asynchronous operation for the connection.
+    void start();
 
-	/// Start the first asynchronous operation for the connection.
-	void start();
+  private:
+    void handle_read(const boost::system::error_code &e, std::size_t bytes_transferred);
 
-private:
-	void handle_read(
-		const boost::system::error_code& e,
-		std::size_t bytes_transferred
-	);
+    /// Handle completion of a write operation.
+    void handle_write(const boost::system::error_code &e);
 
-	/// Handle completion of a write operation.
-	void handle_write(const boost::system::error_code& e);
+    void compressBufferCollection(std::vector<char> uncompressed_data,
+                                  CompressionType compression_type,
+                                  std::vector<char> &compressed_data);
 
-	void compressBufferCollection(
-		std::vector<std::string> uncompressed_data,
-		CompressionType compression_type,
-	   	std::vector<char> & compressed_data
-   	);
-
-	boost::asio::io_service::strand strand;
-	boost::asio::ip::tcp::socket TCP_socket;
-	RequestHandler& request_handler;
-	boost::array<char, 8192> incoming_data_buffer;
-	Request request;
-	RequestParser * request_parser;
-	Reply reply;
+    boost::asio::io_service::strand strand;
+    boost::asio::ip::tcp::socket TCP_socket;
+    RequestHandler &request_handler;
+    boost::array<char, 8192> incoming_data_buffer;
+    Request request;
+    RequestParser *request_parser;
+    Reply reply;
 };
 
 } // namespace http

Server/DataStructures/BaseDataFacade.h

@@ -25,10 +25,10 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 */
 
-#ifndef QUERY_DATA_FACADE_H
-#define QUERY_DATA_FACADE_H
+#ifndef BASE_DATA_FACADE_H
+#define BASE_DATA_FACADE_H
 
-//Exposes all data access interfaces to the algorithms via base class ptr
+// Exposes all data access interfaces to the algorithms via base class ptr
 
 #include "../../DataStructures/EdgeBasedNode.h"
 #include "../../DataStructures/ImportNode.h"
@@ -38,89 +38,77 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../../Util/StringUtil.h"
 #include "../../typedefs.h"
 
+#include <boost/range/irange.hpp>
+
 #include <osrm/Coordinate.h>
 
 #include <string>
 
-template<class EdgeDataT>
-class BaseDataFacade {
-public:
+typedef decltype(boost::irange(0u,0u)) EdgeRange;
+
+template <class EdgeDataT> class BaseDataFacade
+{
+  public:
     typedef EdgeBasedNode RTreeLeaf;
     typedef EdgeDataT EdgeData;
-    BaseDataFacade( ) { }
-    virtual ~BaseDataFacade() { }
+    BaseDataFacade() {}
+    virtual ~BaseDataFacade() {}
 
-    //search graph access
+    // search graph access
     virtual unsigned GetNumberOfNodes() const = 0;
 
     virtual unsigned GetNumberOfEdges() const = 0;
 
-    virtual unsigned GetOutDegree( const NodeID n ) const = 0;
+    virtual unsigned GetOutDegree(const NodeID n) const = 0;
 
-    virtual NodeID GetTarget( const EdgeID e ) const = 0;
+    virtual NodeID GetTarget(const EdgeID e) const = 0;
 
-    virtual EdgeDataT &GetEdgeData( const EdgeID e ) = 0;
+    virtual EdgeDataT &GetEdgeData(const EdgeID e) = 0;
 
     // virtual const EdgeDataT &GetEdgeData( const EdgeID e ) const = 0;
 
-    virtual EdgeID BeginEdges( const NodeID n ) const = 0;
+    virtual EdgeID BeginEdges(const NodeID n) const = 0;
 
-    virtual EdgeID EndEdges( const NodeID n ) const = 0;
+    virtual EdgeID EndEdges(const NodeID n) const = 0;
 
-    //searches for a specific edge
-    virtual EdgeID FindEdge( const NodeID from, const NodeID to ) const = 0;
+    virtual EdgeRange GetAdjacentEdgeRange(const NodeID node) const = 0;
 
-    virtual EdgeID FindEdgeInEitherDirection(
-        const NodeID from,
-        const NodeID to
-    ) const = 0;
+    // searches for a specific edge
+    virtual EdgeID FindEdge(const NodeID from, const NodeID to) const = 0;
 
-    virtual EdgeID FindEdgeIndicateIfReverse(
-        const NodeID from,
-        const NodeID to,
-        bool & result
-    ) const = 0;
+    virtual EdgeID FindEdgeInEitherDirection(const NodeID from, const NodeID to) const = 0;
 
-    //node and edge information access
-    virtual FixedPointCoordinate GetCoordinateOfNode(
-        const unsigned id
-    ) const = 0;
+    virtual EdgeID
+    FindEdgeIndicateIfReverse(const NodeID from, const NodeID to, bool &result) const = 0;
 
-    virtual bool EdgeIsCompressed( const unsigned id ) const = 0;
+    // node and edge information access
+    virtual FixedPointCoordinate GetCoordinateOfNode(const unsigned id) const = 0;
+
+    virtual bool EdgeIsCompressed(const unsigned id) const = 0;
 
     virtual unsigned GetGeometryIndexForEdgeID(const unsigned id) const = 0;
 
-    virtual void GetUncompressedGeometry(
-        const unsigned id,
-        std::vector<unsigned> & result_nodes
-    ) const = 0;
+    virtual void GetUncompressedGeometry(const unsigned id,
+                                         std::vector<unsigned> &result_nodes) const = 0;
 
-    virtual TurnInstruction GetTurnInstructionForEdgeID(
-        const unsigned id
-    ) const  = 0;
+    virtual TurnInstruction GetTurnInstructionForEdgeID(const unsigned id) const = 0;
 
-    virtual bool LocateClosestEndPointForCoordinate(
-        const FixedPointCoordinate& input_coordinate,
-        FixedPointCoordinate& result,
-        const unsigned zoom_level = 18
-    ) const  = 0;
+    virtual bool LocateClosestEndPointForCoordinate(const FixedPointCoordinate &input_coordinate,
+                                                    FixedPointCoordinate &result,
+                                                    const unsigned zoom_level = 18) const = 0;
 
-    virtual bool FindPhantomNodeForCoordinate(
-        const FixedPointCoordinate & input_coordinate,
-        PhantomNode & resulting_phantom_node,
-        const unsigned zoom_level
-    ) const  = 0;
+    virtual bool FindPhantomNodeForCoordinate(const FixedPointCoordinate &input_coordinate,
+                                              PhantomNode &resulting_phantom_node,
+                                              const unsigned zoom_level) const = 0;
 
     virtual unsigned GetCheckSum() const = 0;
 
-    virtual unsigned GetNameIndexFromEdgeID(const unsigned id) const  = 0;
+    virtual unsigned GetNameIndexFromEdgeID(const unsigned id) const = 0;
 
-    virtual void GetName(
-        const unsigned name_id,
-        std::string & result
-    ) const = 0;
+    virtual void GetName(const unsigned name_id, std::string &result) const = 0;
 
-    std::string GetEscapedNameForNameID(const unsigned name_id) const {
+    std::string GetEscapedNameForNameID(const unsigned name_id) const
+    {
         std::string temporary_string;
         GetName(name_id, temporary_string);
         return EscapeJSONString(temporary_string);
@@ -129,4 +117,4 @@ public:
     virtual std::string GetTimestamp() const = 0;
 };
 
-#endif // QUERY_DATA_FACADE_H
+#endif // BASE_DATA_FACADE_H

Server/DataStructures/InternalDataFacade.h

@@ -28,7 +28,7 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef INTERNAL_DATA_FACADE
 #define INTERNAL_DATA_FACADE
 
-//implements all data storage when shared memory is _NOT_ used
+// implements all data storage when shared memory is _NOT_ used
 
 #include "BaseDataFacade.h"
 
@@ -45,78 +45,71 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include <osrm/Coordinate.h>
 
-#include <boost/make_shared.hpp>
-#include <boost/shared_ptr.hpp>
+template <class EdgeDataT> class InternalDataFacade : public BaseDataFacade<EdgeDataT>
+{
 
-template<class EdgeDataT>
-class InternalDataFacade : public BaseDataFacade<EdgeDataT> {
-
-private:
-    typedef BaseDataFacade<EdgeDataT>             super;
+  private:
+    typedef BaseDataFacade<EdgeDataT> super;
     typedef StaticGraph<typename super::EdgeData> QueryGraph;
-    typedef typename QueryGraph::InputEdge        InputEdge;
-    typedef typename super::RTreeLeaf             RTreeLeaf;
+    typedef typename QueryGraph::InputEdge InputEdge;
+    typedef typename super::RTreeLeaf RTreeLeaf;
 
-    InternalDataFacade() { }
+    InternalDataFacade() {}
 
-    unsigned                                 m_check_sum;
-    unsigned                                 m_number_of_nodes;
-    QueryGraph                             * m_query_graph;
-    std::string                              m_timestamp;
+    unsigned m_check_sum;
+    unsigned m_number_of_nodes;
+    QueryGraph *m_query_graph;
+    std::string m_timestamp;
 
-    boost::shared_ptr<ShM<FixedPointCoordinate, false>::vector> m_coordinate_list;
-    ShM<NodeID, false>::vector               m_via_node_list;
-    ShM<unsigned, false>::vector             m_name_ID_list;
-    ShM<TurnInstruction, false>::vector      m_turn_instruction_list;
-    ShM<char, false>::vector                 m_names_char_list;
-    ShM<unsigned, false>::vector             m_name_begin_indices;
-    ShM<bool, false>::vector                 m_egde_is_compressed;
-    ShM<unsigned, false>::vector             m_geometry_indices;
-    ShM<unsigned, false>::vector             m_geometry_list;
+    std::shared_ptr<ShM<FixedPointCoordinate, false>::vector> m_coordinate_list;
+    ShM<NodeID, false>::vector m_via_node_list;
+    ShM<unsigned, false>::vector m_name_ID_list;
+    ShM<TurnInstruction, false>::vector m_turn_instruction_list;
+    ShM<char, false>::vector m_names_char_list;
+    ShM<unsigned, false>::vector m_name_begin_indices;
+    ShM<bool, false>::vector m_egde_is_compressed;
+    ShM<unsigned, false>::vector m_geometry_indices;
+    ShM<unsigned, false>::vector m_geometry_list;
 
-    boost::shared_ptr<
-        StaticRTree<
-            RTreeLeaf,
-            ShM<FixedPointCoordinate, false>::vector,
-            false
-        >
-    > m_static_rtree;
+    std::shared_ptr<StaticRTree<RTreeLeaf, ShM<FixedPointCoordinate, false>::vector, false>>
+    m_static_rtree;
 
-
-    void LoadTimestamp(const boost::filesystem::path & timestamp_path) {
-        if( boost::filesystem::exists(timestamp_path) ) {
+    void LoadTimestamp(const boost::filesystem::path &timestamp_path)
+    {
+        if (boost::filesystem::exists(timestamp_path))
+        {
             SimpleLogger().Write() << "Loading Timestamp";
-            boost::filesystem::ifstream timestampInStream( timestamp_path );
-            if(!timestampInStream) {
+            boost::filesystem::ifstream timestamp_stream(timestamp_path);
+            if (!timestamp_stream)
+            {
                 SimpleLogger().Write(logWARNING) << timestamp_path << " not found";
             }
-            getline(timestampInStream, m_timestamp);
-            timestampInStream.close();
+            getline(timestamp_stream, m_timestamp);
+            timestamp_stream.close();
         }
-        if(m_timestamp.empty()) {
+        if (m_timestamp.empty())
+        {
             m_timestamp = "n/a";
         }
-        if(25 < m_timestamp.length()) {
+        if (25 < m_timestamp.length())
+        {
             m_timestamp.resize(25);
         }
     }
 
-    void LoadGraph(const boost::filesystem::path & hsgr_path) {
-        typename ShM<typename QueryGraph::_StrNode, false>::vector node_list;
-        typename ShM<typename QueryGraph::_StrEdge, false>::vector edge_list;
+    void LoadGraph(const boost::filesystem::path &hsgr_path)
+    {
+        typename ShM<typename QueryGraph::NodeArrayEntry, false>::vector node_list;
+        typename ShM<typename QueryGraph::EdgeArrayEntry, false>::vector edge_list;
 
         SimpleLogger().Write() << "loading graph from " << hsgr_path.string();
 
-        m_number_of_nodes = readHSGRFromStream(
-            hsgr_path,
-            node_list,
-            edge_list,
-            &m_check_sum
-        );
+        m_number_of_nodes = readHSGRFromStream(hsgr_path, node_list, edge_list, &m_check_sum);
 
         BOOST_ASSERT_MSG(0 != node_list.size(), "node list empty");
         // BOOST_ASSERT_MSG(0 != edge_list.size(), "edge list empty");
-        SimpleLogger().Write() << "loaded " << node_list.size() << " nodes and " << edge_list.size() << " edges";
+        SimpleLogger().Write() << "loaded " << node_list.size() << " nodes and " << edge_list.size()
+                               << " edges";
         m_query_graph = new QueryGraph(node_list, edge_list);
 
         BOOST_ASSERT_MSG(0 == node_list.size(), "node list not flushed");
@@ -124,57 +117,45 @@ private:
         SimpleLogger().Write() << "Data checksum is " << m_check_sum;
     }
 
-    void LoadNodeAndEdgeInformation(
-        const boost::filesystem::path & nodes_file,
-        const boost::filesystem::path & edges_file
-    ) {
-        boost::filesystem::ifstream nodes_input_stream(
-            nodes_file,
-            std::ios::binary
-        );
+    void LoadNodeAndEdgeInformation(const boost::filesystem::path &nodes_file,
+                                    const boost::filesystem::path &edges_file)
+    {
+        boost::filesystem::ifstream nodes_input_stream(nodes_file, std::ios::binary);
 
         NodeInfo current_node;
         unsigned number_of_coordinates = 0;
-        nodes_input_stream.read(
-            (char *)&number_of_coordinates,
-            sizeof(unsigned)
-        );
-        m_coordinate_list = boost::make_shared<std::vector<FixedPointCoordinate> >(number_of_coordinates);
-        for(unsigned i = 0; i < number_of_coordinates; ++i) {
+        nodes_input_stream.read((char *)&number_of_coordinates, sizeof(unsigned));
+        m_coordinate_list =
+            std::make_shared<std::vector<FixedPointCoordinate>>(number_of_coordinates);
+        for (unsigned i = 0; i < number_of_coordinates; ++i)
+        {
             nodes_input_stream.read((char *)&current_node, sizeof(NodeInfo));
-            m_coordinate_list->at(i) = FixedPointCoordinate(
-                    current_node.lat,
-                    current_node.lon
-            );
-            BOOST_ASSERT( ( std::abs(m_coordinate_list->at(i).lat) >> 30) == 0 );
-            BOOST_ASSERT( ( std::abs(m_coordinate_list->at(i).lon) >> 30) == 0 );
+            m_coordinate_list->at(i) = FixedPointCoordinate(current_node.lat, current_node.lon);
+            BOOST_ASSERT((std::abs(m_coordinate_list->at(i).lat) >> 30) == 0);
+            BOOST_ASSERT((std::abs(m_coordinate_list->at(i).lon) >> 30) == 0);
         }
         nodes_input_stream.close();
 
-        boost::filesystem::ifstream edges_input_stream(
-            edges_file,
-            std::ios::binary
-        );
+        boost::filesystem::ifstream edges_input_stream(edges_file, std::ios::binary);
         unsigned number_of_edges = 0;
-        edges_input_stream.read((char*)&number_of_edges, sizeof(unsigned));
-        m_via_node_list.resize        (number_of_edges);
-        m_name_ID_list.resize         (number_of_edges);
+        edges_input_stream.read((char *)&number_of_edges, sizeof(unsigned));
+        m_via_node_list.resize(number_of_edges);
+        m_name_ID_list.resize(number_of_edges);
         m_turn_instruction_list.resize(number_of_edges);
-        m_egde_is_compressed.resize   (number_of_edges);
+        m_egde_is_compressed.resize(number_of_edges);
 
         unsigned compressed = 0;
 
         OriginalEdgeData current_edge_data;
-        for(unsigned i = 0; i < number_of_edges; ++i) {
-            edges_input_stream.read(
-                (char*)&(current_edge_data),
-                sizeof(OriginalEdgeData)
-            );
+        for (unsigned i = 0; i < number_of_edges; ++i)
+        {
+            edges_input_stream.read((char *)&(current_edge_data), sizeof(OriginalEdgeData));
             m_via_node_list[i] = current_edge_data.via_node;
-            m_name_ID_list[i]  = current_edge_data.name_id;
+            m_name_ID_list[i] = current_edge_data.name_id;
             m_turn_instruction_list[i] = current_edge_data.turn_instruction;
             m_egde_is_compressed[i] = current_edge_data.compressed_geometry;
-            if(m_egde_is_compressed[i]) {
+            if (m_egde_is_compressed[i])
+            {
                 ++compressed;
             }
         }
@@ -182,60 +163,39 @@ private:
         edges_input_stream.close();
     }
 
-    void LoadGeometries(const boost::filesystem::path & geometry_file)
+    void LoadGeometries(const boost::filesystem::path &geometry_file)
     {
-        std::ifstream geometry_stream(
-            geometry_file.c_str(),
-            std::ios::binary
-        );
+        std::ifstream geometry_stream(geometry_file.c_str(), std::ios::binary);
         unsigned number_of_indices = 0;
         unsigned number_of_compressed_geometries = 0;
 
-        geometry_stream.read(
-            (char *)&number_of_indices,
-            sizeof(unsigned)
-        );
+        geometry_stream.read((char *)&number_of_indices, sizeof(unsigned));
 
         m_geometry_indices.resize(number_of_indices);
-        geometry_stream.read(
-            (char *)&(m_geometry_indices[0]),
-            number_of_indices*sizeof(unsigned)
-        );
+        geometry_stream.read((char *)&(m_geometry_indices[0]),
+                             number_of_indices * sizeof(unsigned));
 
-        geometry_stream.read(
-            (char *)&number_of_compressed_geometries,
-            sizeof(unsigned)
-        );
+        geometry_stream.read((char *)&number_of_compressed_geometries, sizeof(unsigned));
 
-        BOOST_ASSERT( m_geometry_indices.back() == number_of_compressed_geometries );
-        m_geometry_list.resize( number_of_compressed_geometries );
+        BOOST_ASSERT(m_geometry_indices.back() == number_of_compressed_geometries);
+        m_geometry_list.resize(number_of_compressed_geometries);
 
-        geometry_stream.read(
-            (char *)&(m_geometry_list[0]),
-            number_of_compressed_geometries*sizeof(unsigned)
-        );
+        geometry_stream.read((char *)&(m_geometry_list[0]),
+                             number_of_compressed_geometries * sizeof(unsigned));
         geometry_stream.close();
     }
 
-    void LoadRTree(
-        const boost::filesystem::path & ram_index_path,
-        const boost::filesystem::path & file_index_path
-    ) {
-        BOOST_ASSERT_MSG(
-            !m_coordinate_list->empty(),
-            "coordinates must be loaded before r-tree"
-        );
+    void LoadRTree(const boost::filesystem::path &ram_index_path,
+                   const boost::filesystem::path &file_index_path)
+    {
+        BOOST_ASSERT_MSG(!m_coordinate_list->empty(), "coordinates must be loaded before r-tree");
 
-        m_static_rtree = boost::make_shared<StaticRTree<RTreeLeaf> >(
-            ram_index_path,
-            file_index_path,
-            m_coordinate_list
-        );
+        m_static_rtree = std::make_shared<StaticRTree<RTreeLeaf>>(
+            ram_index_path, file_index_path, m_coordinate_list);
     }
 
-    void LoadStreetNames(
-        const boost::filesystem::path & names_file
-    ) {
+    void LoadStreetNames(const boost::filesystem::path &names_file)
+    {
         boost::filesystem::ifstream name_stream(names_file, std::ios::binary);
         unsigned number_of_names = 0;
         unsigned number_of_chars = 0;
@@ -245,241 +205,210 @@ private:
         BOOST_ASSERT_MSG(0 != number_of_chars, "name file broken");
 
         m_name_begin_indices.resize(number_of_names);
-        name_stream.read(
-            (char*)&m_name_begin_indices[0],
-            number_of_names*sizeof(unsigned)
-        );
+        name_stream.read((char *)&m_name_begin_indices[0], number_of_names * sizeof(unsigned));
 
-        m_names_char_list.resize(number_of_chars+1); //+1 gives sentinel element
-        name_stream.read(
-            (char *)&m_names_char_list[0],
-            number_of_chars*sizeof(char)
-        );
-        BOOST_ASSERT_MSG(
-            0 != m_names_char_list.size(),
-            "could not load any names"
-        );
+        m_names_char_list.resize(number_of_chars + 1); //+1 gives sentinel element
+        name_stream.read((char *)&m_names_char_list[0], number_of_chars * sizeof(char));
+        BOOST_ASSERT_MSG(0 != m_names_char_list.size(), "could not load any names");
         name_stream.close();
     }
-public:
-    ~InternalDataFacade() {
+
+  public:
+    ~InternalDataFacade()
+    {
         delete m_query_graph;
         m_static_rtree.reset();
     }
 
-    explicit InternalDataFacade( const ServerPaths & server_paths ) {
-        //generate paths of data files
-        if( server_paths.find("hsgrdata") == server_paths.end() ) {
+    explicit InternalDataFacade(const ServerPaths &server_paths)
+    {
+        // generate paths of data files
+        if (server_paths.find("hsgrdata") == server_paths.end())
+        {
             throw OSRMException("no hsgr file given in ini file");
         }
-        if( server_paths.find("ramindex") == server_paths.end() ) {
+        if (server_paths.find("ramindex") == server_paths.end())
+        {
             throw OSRMException("no ram index file given in ini file");
         }
-        if( server_paths.find("fileindex") == server_paths.end() ) {
+        if (server_paths.find("fileindex") == server_paths.end())
+        {
             throw OSRMException("no leaf index file given in ini file");
         }
-        if( server_paths.find("geometries") == server_paths.end() ) {
+        if (server_paths.find("geometries") == server_paths.end())
+        {
             throw OSRMException("no geometries file given in ini file");
         }
-        if( server_paths.find("nodesdata") == server_paths.end() ) {
+        if (server_paths.find("nodesdata") == server_paths.end())
+        {
             throw OSRMException("no nodes file given in ini file");
         }
-        if( server_paths.find("edgesdata") == server_paths.end() ) {
+        if (server_paths.find("edgesdata") == server_paths.end())
+        {
             throw OSRMException("no edges file given in ini file");
         }
-        if( server_paths.find("namesdata") == server_paths.end() ) {
+        if (server_paths.find("namesdata") == server_paths.end())
+        {
             throw OSRMException("no names file given in ini file");
         }
 
         ServerPaths::const_iterator paths_iterator = server_paths.find("hsgrdata");
         BOOST_ASSERT(server_paths.end() != paths_iterator);
-        const boost::filesystem::path & hsgr_path = paths_iterator->second;
+        const boost::filesystem::path &hsgr_path = paths_iterator->second;
         paths_iterator = server_paths.find("timestamp");
         BOOST_ASSERT(server_paths.end() != paths_iterator);
-        const boost::filesystem::path & timestamp_path = paths_iterator->second;
+        const boost::filesystem::path &timestamp_path = paths_iterator->second;
         paths_iterator = server_paths.find("ramindex");
         BOOST_ASSERT(server_paths.end() != paths_iterator);
-        const boost::filesystem::path & ram_index_path = paths_iterator->second;
+        const boost::filesystem::path &ram_index_path = paths_iterator->second;
         paths_iterator = server_paths.find("fileindex");
         BOOST_ASSERT(server_paths.end() != paths_iterator);
-        const boost::filesystem::path & file_index_path = paths_iterator->second;
+        const boost::filesystem::path &file_index_path = paths_iterator->second;
         paths_iterator = server_paths.find("nodesdata");
         BOOST_ASSERT(server_paths.end() != paths_iterator);
-        const boost::filesystem::path & nodes_data_path = paths_iterator->second;
+        const boost::filesystem::path &nodes_data_path = paths_iterator->second;
         paths_iterator = server_paths.find("edgesdata");
         BOOST_ASSERT(server_paths.end() != paths_iterator);
-        const boost::filesystem::path & edges_data_path = paths_iterator->second;
+        const boost::filesystem::path &edges_data_path = paths_iterator->second;
         paths_iterator = server_paths.find("namesdata");
         BOOST_ASSERT(server_paths.end() != paths_iterator);
-        const boost::filesystem::path & names_data_path = paths_iterator->second;
+        const boost::filesystem::path &names_data_path = paths_iterator->second;
         paths_iterator = server_paths.find("geometries");
         BOOST_ASSERT(server_paths.end() != paths_iterator);
-        const boost::filesystem::path & geometries_path = paths_iterator->second;
+        const boost::filesystem::path &geometries_path = paths_iterator->second;
 
-        //load data
+        // load data
         SimpleLogger().Write() << "loading graph data";
+        AssertPathExists(hsgr_path);
         LoadGraph(hsgr_path);
         SimpleLogger().Write() << "loading egde information";
+        AssertPathExists(nodes_data_path);
+        AssertPathExists(edges_data_path);
         LoadNodeAndEdgeInformation(nodes_data_path, edges_data_path);
         SimpleLogger().Write() << "loading geometries";
-        LoadGeometries( geometries_path );
+        AssertPathExists(geometries_path);
+        LoadGeometries(geometries_path);
         SimpleLogger().Write() << "loading r-tree";
+        AssertPathExists(ram_index_path);
+        AssertPathExists(file_index_path);
         LoadRTree(ram_index_path, file_index_path);
         SimpleLogger().Write() << "loading timestamp";
         LoadTimestamp(timestamp_path);
         SimpleLogger().Write() << "loading street names";
+        AssertPathExists(names_data_path);
         LoadStreetNames(names_data_path);
     }
 
-    //search graph access
-    unsigned GetNumberOfNodes() const {
-        return m_query_graph->GetNumberOfNodes();
-    }
+    // search graph access
+    unsigned GetNumberOfNodes() const { return m_query_graph->GetNumberOfNodes(); }
 
-    unsigned GetNumberOfEdges() const {
-        return m_query_graph->GetNumberOfEdges();
-    }
+    unsigned GetNumberOfEdges() const { return m_query_graph->GetNumberOfEdges(); }
 
-    unsigned GetOutDegree( const NodeID n ) const {
-        return m_query_graph->GetOutDegree(n);
-    }
+    unsigned GetOutDegree(const NodeID n) const { return m_query_graph->GetOutDegree(n); }
 
-    NodeID GetTarget( const EdgeID e ) const {
-        return m_query_graph->GetTarget(e); }
+    NodeID GetTarget(const EdgeID e) const { return m_query_graph->GetTarget(e); }
 
-    EdgeDataT &GetEdgeData( const EdgeID e ) {
-        return m_query_graph->GetEdgeData(e);
-    }
+    EdgeDataT &GetEdgeData(const EdgeID e) { return m_query_graph->GetEdgeData(e); }
 
-    const EdgeDataT &GetEdgeData( const EdgeID e ) const {
-        return m_query_graph->GetEdgeData(e);
-    }
+    const EdgeDataT &GetEdgeData(const EdgeID e) const { return m_query_graph->GetEdgeData(e); }
 
-    EdgeID BeginEdges( const NodeID n ) const {
-        return m_query_graph->BeginEdges(n);
-    }
+    EdgeID BeginEdges(const NodeID n) const { return m_query_graph->BeginEdges(n); }
 
-    EdgeID EndEdges( const NodeID n ) const {
-        return m_query_graph->EndEdges(n);
-    }
+    EdgeID EndEdges(const NodeID n) const { return m_query_graph->EndEdges(n); }
 
-    //searches for a specific edge
-    EdgeID FindEdge( const NodeID from, const NodeID to ) const {
+    EdgeRange GetAdjacentEdgeRange(const NodeID node) const { return m_query_graph->GetAdjacentEdgeRange(node); };
+
+    // searches for a specific edge
+    EdgeID FindEdge(const NodeID from, const NodeID to) const
+    {
         return m_query_graph->FindEdge(from, to);
     }
 
-    EdgeID FindEdgeInEitherDirection(
-        const NodeID from,
-        const NodeID to
-    ) const {
+    EdgeID FindEdgeInEitherDirection(const NodeID from, const NodeID to) const
+    {
         return m_query_graph->FindEdgeInEitherDirection(from, to);
     }
 
-    EdgeID FindEdgeIndicateIfReverse(
-        const NodeID from,
-        const NodeID to,
-        bool & result
-    ) const {
+    EdgeID FindEdgeIndicateIfReverse(const NodeID from, const NodeID to, bool &result) const
+    {
         return m_query_graph->FindEdgeIndicateIfReverse(from, to, result);
     }
 
-    //node and edge information access
-    FixedPointCoordinate GetCoordinateOfNode(
-        const unsigned id
-    ) const {
+    // node and edge information access
+    FixedPointCoordinate GetCoordinateOfNode(const unsigned id) const
+    {
         return m_coordinate_list->at(id);
     };
 
-    bool EdgeIsCompressed( const unsigned id ) const {
-        return m_egde_is_compressed.at(id);
-    }
+    bool EdgeIsCompressed(const unsigned id) const { return m_egde_is_compressed.at(id); }
 
-    TurnInstruction GetTurnInstructionForEdgeID(
-        const unsigned id
-    ) const {
+    TurnInstruction GetTurnInstructionForEdgeID(const unsigned id) const
+    {
         return m_turn_instruction_list.at(id);
     }
 
-    bool LocateClosestEndPointForCoordinate(
-        const FixedPointCoordinate& input_coordinate,
-        FixedPointCoordinate& result,
-        const unsigned zoom_level = 18
-    ) const {
-        return  m_static_rtree->LocateClosestEndPointForCoordinate(
-                    input_coordinate,
-                    result,
-                    zoom_level
-                );
+    bool LocateClosestEndPointForCoordinate(const FixedPointCoordinate &input_coordinate,
+                                            FixedPointCoordinate &result,
+                                            const unsigned zoom_level = 18) const
+    {
+        return m_static_rtree->LocateClosestEndPointForCoordinate(
+            input_coordinate, result, zoom_level);
     }
 
-    bool FindPhantomNodeForCoordinate(
-        const FixedPointCoordinate & input_coordinate,
-        PhantomNode & resulting_phantom_node,
-        const unsigned zoom_level
-    ) const {
-        const bool found =  m_static_rtree->FindPhantomNodeForCoordinate(
-                        input_coordinate,
-                        resulting_phantom_node,
-                        zoom_level
-                    );
+    bool FindPhantomNodeForCoordinate(const FixedPointCoordinate &input_coordinate,
+                                      PhantomNode &resulting_phantom_node,
+                                      const unsigned zoom_level) const
+    {
+        const bool found = m_static_rtree->FindPhantomNodeForCoordinate(
+            input_coordinate, resulting_phantom_node, zoom_level);
         return found;
     }
 
     unsigned GetCheckSum() const { return m_check_sum; }
 
-    unsigned GetNameIndexFromEdgeID(const unsigned id) const {
+    unsigned GetNameIndexFromEdgeID(const unsigned id) const
+    {
         return m_name_ID_list.at(id);
     };
 
-    void GetName( const unsigned name_id, std::string & result ) const {
-        if(UINT_MAX == name_id) {
+    void GetName(const unsigned name_id, std::string &result) const
+    {
+        if (UINT_MAX == name_id)
+        {
             result = "";
             return;
         }
-        BOOST_ASSERT_MSG(
-            name_id < m_name_begin_indices.size(),
-            "name id too high"
-        );
+        BOOST_ASSERT_MSG(name_id < m_name_begin_indices.size(), "name id too high");
         const unsigned begin_index = m_name_begin_indices[name_id];
-        const unsigned end_index = m_name_begin_indices[name_id+1];
-        BOOST_ASSERT_MSG(
-            begin_index < m_names_char_list.size(),
-            "begin index of name too high"
-        );
-        BOOST_ASSERT_MSG(
-            end_index < m_names_char_list.size(),
-            "end index of name too high"
-        );
+        const unsigned end_index = m_name_begin_indices[name_id + 1];
+        BOOST_ASSERT_MSG(begin_index < m_names_char_list.size(), "begin index of name too high");
+        BOOST_ASSERT_MSG(end_index < m_names_char_list.size(), "end index of name too high");
 
         BOOST_ASSERT_MSG(begin_index <= end_index, "string ends before begin");
         result.clear();
         result.resize(end_index - begin_index);
-        std::copy(
-            m_names_char_list.begin() + begin_index,
-            m_names_char_list.begin() + end_index,
-            result.begin()
-        );
+        std::copy(m_names_char_list.begin() + begin_index,
+                  m_names_char_list.begin() + end_index,
+                  result.begin());
     }
 
-    virtual unsigned GetGeometryIndexForEdgeID(const unsigned id) const {
+    virtual unsigned GetGeometryIndexForEdgeID(const unsigned id) const
+    {
         return m_via_node_list.at(id);
     }
 
-    virtual void GetUncompressedGeometry(
-        const unsigned id, std::vector<unsigned> & result_nodes
-    ) const {
+    virtual void GetUncompressedGeometry(const unsigned id, std::vector<unsigned> &result_nodes)
+        const
+    {
         const unsigned begin = m_geometry_indices.at(id);
-        const unsigned end = m_geometry_indices.at(id+1);
+        const unsigned end = m_geometry_indices.at(id + 1);
 
         result_nodes.clear();
-        result_nodes.insert(result_nodes.begin(),
-                            m_geometry_list.begin() + begin,
-                            m_geometry_list.begin() + end);
+        result_nodes.insert(
+            result_nodes.begin(), m_geometry_list.begin() + begin, m_geometry_list.begin() + end);
     }
 
-    std::string GetTimestamp() const {
-        return m_timestamp;
-    }
+    std::string GetTimestamp() const { return m_timestamp; }
 };
 
-#endif  // INTERNAL_DATA_FACADE
+#endif // INTERNAL_DATA_FACADE

Server/DataStructures/SharedBarriers.h

@@ -31,42 +31,30 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include <boost/interprocess/sync/named_mutex.hpp>
 #include <boost/interprocess/sync/named_condition.hpp>
 
-struct SharedBarriers {
+struct SharedBarriers
+{
 
-   SharedBarriers ()
-    :
-      pending_update_mutex(
-         boost::interprocess::open_or_create,
-         "pending_update"
-      ),
-      update_mutex(
-         boost::interprocess::open_or_create,
-         "update"
-      ),
-      query_mutex(
-         boost::interprocess::open_or_create,
-         "query"
-      ),
-      no_running_queries_condition(
-         boost::interprocess::open_or_create,
-         "no_running_queries"
-      ),
-      update_ongoing(false),
-      number_of_queries(0)
-   { }
+    SharedBarriers()
+        : pending_update_mutex(boost::interprocess::open_or_create, "pending_update"),
+          update_mutex(boost::interprocess::open_or_create, "update"),
+          query_mutex(boost::interprocess::open_or_create, "query"),
+          no_running_queries_condition(boost::interprocess::open_or_create, "no_running_queries"),
+          update_ongoing(false), number_of_queries(0)
+    {
+    }
 
-   // Mutex to protect access to the boolean variable
-   boost::interprocess::named_mutex   pending_update_mutex;
-   boost::interprocess::named_mutex   update_mutex;
-   boost::interprocess::named_mutex   query_mutex;
+    // Mutex to protect access to the boolean variable
+    boost::interprocess::named_mutex pending_update_mutex;
+    boost::interprocess::named_mutex update_mutex;
+    boost::interprocess::named_mutex query_mutex;
 
-   // Condition that no update is running
-   boost::interprocess::named_condition  no_running_queries_condition;
+    // Condition that no update is running
+    boost::interprocess::named_condition no_running_queries_condition;
 
-   // Is there an ongoing update?
-   bool update_ongoing;
-   // Is there any query?
-   int number_of_queries;
+    // Is there an ongoing update?
+    bool update_ongoing;
+    // Is there any query?
+    int number_of_queries;
 };
 
-#endif //SHARED_BARRIER_H
+#endif // SHARED_BARRIER_H

Server/DataStructures/SharedDataFacade.h

@@ -28,7 +28,7 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #ifndef SHARED_DATA_FACADE_H
 #define SHARED_DATA_FACADE_H
 
-//implements all data storage when shared memory _IS_ used
+// implements all data storage when shared memory _IS_ used
 
 #include "BaseDataFacade.h"
 #include "SharedDataType.h"
@@ -39,249 +39,189 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../../Util/ProgramOptions.h"
 #include "../../Util/SimpleLogger.h"
 
-#include <boost/make_shared.hpp>
-#include <boost/shared_ptr.hpp>
-
 #include <algorithm>
+#include <memory>
 
-template<class EdgeDataT>
-class SharedDataFacade : public BaseDataFacade<EdgeDataT> {
+template <class EdgeDataT> class SharedDataFacade : public BaseDataFacade<EdgeDataT>
+{
 
-private:
+  private:
     typedef EdgeDataT EdgeData;
-    typedef BaseDataFacade<EdgeData>                        super;
-    typedef StaticGraph<EdgeData, true>                     QueryGraph;
-    typedef typename StaticGraph<EdgeData, true>::_StrNode  GraphNode;
-    typedef typename StaticGraph<EdgeData, true>::_StrEdge  GraphEdge;
-    typedef typename QueryGraph::InputEdge                  InputEdge;
-    typedef typename super::RTreeLeaf                       RTreeLeaf;
-    typedef typename StaticRTree<RTreeLeaf, ShM<FixedPointCoordinate, true>::vector, true>::TreeNode RTreeNode;
+    typedef BaseDataFacade<EdgeData> super;
+    typedef StaticGraph<EdgeData, true> QueryGraph;
+    typedef typename StaticGraph<EdgeData, true>::NodeArrayEntry GraphNode;
+    typedef typename StaticGraph<EdgeData, true>::EdgeArrayEntry GraphEdge;
+    typedef typename QueryGraph::InputEdge InputEdge;
+    typedef typename super::RTreeLeaf RTreeLeaf;
+    typedef typename StaticRTree<RTreeLeaf, ShM<FixedPointCoordinate, true>::vector, true>::TreeNode
+    RTreeNode;
 
-    SharedDataLayout    * data_layout;
-    char                * shared_memory;
-    SharedDataTimestamp * data_timestamp_ptr;
+    SharedDataLayout *data_layout;
+    char *shared_memory;
+    SharedDataTimestamp *data_timestamp_ptr;
 
-    SharedDataType     CURRENT_LAYOUT;
-    SharedDataType     CURRENT_DATA;
-    unsigned           CURRENT_TIMESTAMP;
+    SharedDataType CURRENT_LAYOUT;
+    SharedDataType CURRENT_DATA;
+    unsigned CURRENT_TIMESTAMP;
 
-    unsigned                                m_check_sum;
-    unsigned                                m_number_of_nodes;
-    boost::shared_ptr<QueryGraph>           m_query_graph;
-    boost::shared_ptr<SharedMemory>         m_layout_memory;
-    boost::shared_ptr<SharedMemory>         m_large_memory;
-    std::string                             m_timestamp;
+    unsigned m_check_sum;
+    unsigned m_number_of_nodes;
+    std::shared_ptr<QueryGraph> m_query_graph;
+    std::shared_ptr<SharedMemory> m_layout_memory;
+    std::shared_ptr<SharedMemory> m_large_memory;
+    std::string m_timestamp;
 
-    boost::shared_ptr<
-        ShM<FixedPointCoordinate, true>::vector
-    > m_coordinate_list;
-    ShM<NodeID, true>::vector               m_via_node_list;
-    ShM<unsigned, true>::vector             m_name_ID_list;
-    ShM<TurnInstruction, true>::vector      m_turn_instruction_list;
-    ShM<char, true>::vector                 m_names_char_list;
-    ShM<unsigned, true>::vector             m_name_begin_indices;
-    ShM<bool, true>::vector                 m_egde_is_compressed;
-    ShM<unsigned, true>::vector             m_geometry_indices;
-    ShM<unsigned, true>::vector             m_geometry_list;
+    std::shared_ptr<ShM<FixedPointCoordinate, true>::vector> m_coordinate_list;
+    ShM<NodeID, true>::vector m_via_node_list;
+    ShM<unsigned, true>::vector m_name_ID_list;
+    ShM<TurnInstruction, true>::vector m_turn_instruction_list;
+    ShM<char, true>::vector m_names_char_list;
+    ShM<unsigned, true>::vector m_name_begin_indices;
+    ShM<bool, true>::vector m_egde_is_compressed;
+    ShM<unsigned, true>::vector m_geometry_indices;
+    ShM<unsigned, true>::vector m_geometry_list;
 
-    boost::shared_ptr<
-        StaticRTree<
-            RTreeLeaf,
-            ShM<FixedPointCoordinate, true>::vector,
-            true
-        >
-    > m_static_rtree;
+    std::shared_ptr<StaticRTree<RTreeLeaf, ShM<FixedPointCoordinate, true>::vector, true>>
+    m_static_rtree;
 
-    void LoadTimestamp() {
-        char * timestamp_ptr = shared_memory + data_layout->GetTimeStampOffset();
+    void LoadTimestamp()
+    {
+        char *timestamp_ptr = shared_memory + data_layout->GetTimeStampOffset();
         m_timestamp.resize(data_layout->timestamp_length);
         std::copy(
-            timestamp_ptr,
-            timestamp_ptr+data_layout->timestamp_length,
-            m_timestamp.begin()
-        );
+            timestamp_ptr, timestamp_ptr + data_layout->timestamp_length, m_timestamp.begin());
     }
 
-    void LoadRTree(
-        const boost::filesystem::path & file_index_path
-    ) {
-        BOOST_ASSERT_MSG(
-            !m_coordinate_list->empty(),
-            "coordinates must be loaded before r-tree"
-        );
+    void LoadRTree(const boost::filesystem::path &file_index_path)
+    {
+        BOOST_ASSERT_MSG(!m_coordinate_list->empty(), "coordinates must be loaded before r-tree");
 
-        RTreeNode * tree_ptr = (RTreeNode *)(
-            shared_memory + data_layout->GetRSearchTreeOffset()
-        );
-        m_static_rtree = boost::make_shared<StaticRTree<RTreeLeaf, ShM<FixedPointCoordinate, true>::vector, true> >(
-            tree_ptr,
-            data_layout->r_search_tree_size,
-            file_index_path,
-            m_coordinate_list
-        );
+        RTreeNode *tree_ptr = (RTreeNode *)(shared_memory + data_layout->GetRSearchTreeOffset());
+        m_static_rtree =
+            std::make_shared<StaticRTree<RTreeLeaf, ShM<FixedPointCoordinate, true>::vector, true>>(
+                tree_ptr, data_layout->r_search_tree_size, file_index_path, m_coordinate_list);
     }
 
-    void LoadGraph() {
+    void LoadGraph()
+    {
         m_number_of_nodes = data_layout->graph_node_list_size;
-        GraphNode * graph_nodes_ptr = (GraphNode *)(
-            shared_memory + data_layout->GetGraphNodeListOffset()
-        );
+        GraphNode *graph_nodes_ptr =
+            (GraphNode *)(shared_memory + data_layout->GetGraphNodeListOffset());
 
-        GraphEdge * graph_edges_ptr = (GraphEdge *)(
-            shared_memory + data_layout->GetGraphEdgeListOffset()
-        );
+        GraphEdge *graph_edges_ptr =
+            (GraphEdge *)(shared_memory + data_layout->GetGraphEdgeListOffset());
 
-        typename ShM<GraphNode, true>::vector node_list(
-            graph_nodes_ptr,
-            data_layout->graph_node_list_size
-        );
-        typename ShM<GraphEdge, true>::vector edge_list(
-            graph_edges_ptr,
-            data_layout->graph_edge_list_size
-        );
-        m_query_graph.reset(
-            new QueryGraph(node_list, edge_list)
-        );
+        typename ShM<GraphNode, true>::vector node_list(graph_nodes_ptr,
+                                                        data_layout->graph_node_list_size);
+        typename ShM<GraphEdge, true>::vector edge_list(graph_edges_ptr,
+                                                        data_layout->graph_edge_list_size);
+        m_query_graph.reset(new QueryGraph(node_list, edge_list));
     }
 
-    void LoadNodeAndEdgeInformation() {
+    void LoadNodeAndEdgeInformation()
+    {
 
-        FixedPointCoordinate * coordinate_list_ptr = (FixedPointCoordinate *)(
-            shared_memory + data_layout->GetCoordinateListOffset()
-        );
-        m_coordinate_list = boost::make_shared<ShM<FixedPointCoordinate, true>::vector> (
-                coordinate_list_ptr,
-                data_layout->coordinate_list_size
-        );
+        FixedPointCoordinate *coordinate_list_ptr =
+            (FixedPointCoordinate *)(shared_memory + data_layout->GetCoordinateListOffset());
+        m_coordinate_list = std::make_shared<ShM<FixedPointCoordinate, true>::vector>(
+            coordinate_list_ptr, data_layout->coordinate_list_size);
 
-        TurnInstruction * turn_instruction_list_ptr = (TurnInstruction *)(
-            shared_memory + data_layout->GetTurnInstructionListOffset()
-        );
+        TurnInstruction *turn_instruction_list_ptr =
+            (TurnInstruction *)(shared_memory + data_layout->GetTurnInstructionListOffset());
         typename ShM<TurnInstruction, true>::vector turn_instruction_list(
-            turn_instruction_list_ptr,
-            data_layout->turn_instruction_list_size
-        );
+            turn_instruction_list_ptr, data_layout->turn_instruction_list_size);
         m_turn_instruction_list.swap(turn_instruction_list);
 
-        unsigned * name_id_list_ptr = (unsigned *)(
-            shared_memory + data_layout->GetNameIDListOffset()
-        );
-        typename ShM<unsigned, true>::vector name_id_list(
-            name_id_list_ptr,
-            data_layout->name_id_list_size
-        );
+        unsigned *name_id_list_ptr =
+            (unsigned *)(shared_memory + data_layout->GetNameIDListOffset());
+        typename ShM<unsigned, true>::vector name_id_list(name_id_list_ptr,
+                                                          data_layout->name_id_list_size);
         m_name_ID_list.swap(name_id_list);
     }
 
-    void LoadViaNodeList() {
-        NodeID * via_node_list_ptr = (NodeID *)(
-            shared_memory + data_layout->GetViaNodeListOffset()
-        );
-        typename ShM<NodeID, true>::vector via_node_list(
-            via_node_list_ptr,
-            data_layout->via_node_list_size
-        );
+    void LoadViaNodeList()
+    {
+        NodeID *via_node_list_ptr = (NodeID *)(shared_memory + data_layout->GetViaNodeListOffset());
+        typename ShM<NodeID, true>::vector via_node_list(via_node_list_ptr,
+                                                         data_layout->via_node_list_size);
         m_via_node_list.swap(via_node_list);
     }
 
-    void LoadNames() {
-        unsigned * street_names_index_ptr = (unsigned *)(
-            shared_memory + data_layout->GetNameIndexOffset()
-        );
-        typename ShM<unsigned, true>::vector name_begin_indices(
-            street_names_index_ptr,
-            data_layout->name_index_list_size
-        );
+    void LoadNames()
+    {
+        unsigned *street_names_index_ptr =
+            (unsigned *)(shared_memory + data_layout->GetNameIndexOffset());
+        typename ShM<unsigned, true>::vector name_begin_indices(street_names_index_ptr,
+                                                                data_layout->name_index_list_size);
         m_name_begin_indices.swap(name_begin_indices);
 
-        char * names_list_ptr = (char *)(
-            shared_memory + data_layout->GetNameListOffset()
-        );
-        typename ShM<char, true>::vector names_char_list(
-            names_list_ptr,
-            data_layout->name_char_list_size
-        );
+        char *names_list_ptr = (char *)(shared_memory + data_layout->GetNameListOffset());
+        typename ShM<char, true>::vector names_char_list(names_list_ptr,
+                                                         data_layout->name_char_list_size);
         m_names_char_list.swap(names_char_list);
     }
 
     void LoadGeometries()
     {
-        unsigned * geometries_compressed_ptr = (unsigned *)(
-            shared_memory + data_layout->GetGeometriesIndicatorOffset()
-        );
-        typename ShM<bool, true>::vector egde_is_compressed(
-            geometries_compressed_ptr,
-            data_layout->geometries_indicators
-        );
+        unsigned *geometries_compressed_ptr =
+            (unsigned *)(shared_memory + data_layout->GetGeometriesIndicatorOffset());
+        typename ShM<bool, true>::vector egde_is_compressed(geometries_compressed_ptr,
+                                                            data_layout->geometries_indicators);
         m_egde_is_compressed.swap(egde_is_compressed);
 
-        unsigned * geometries_index_ptr = (unsigned *)(
-            shared_memory + data_layout->GetGeometriesIndexListOffset()
-        );
+        unsigned *geometries_index_ptr =
+            (unsigned *)(shared_memory + data_layout->GetGeometriesIndexListOffset());
         typename ShM<unsigned, true>::vector geometry_begin_indices(
-            geometries_index_ptr,
-            data_layout->geometries_index_list_size
-        );
+            geometries_index_ptr, data_layout->geometries_index_list_size);
         m_geometry_indices.swap(geometry_begin_indices);
 
-        unsigned * geometries_list_ptr = (unsigned *)(
-            shared_memory + data_layout->GetGeometryListOffset()
-        );
-        typename ShM<unsigned, true>::vector geometry_list(
-            geometries_list_ptr,
-            data_layout->geometries_list_size
-        );
+        unsigned *geometries_list_ptr =
+            (unsigned *)(shared_memory + data_layout->GetGeometryListOffset());
+        typename ShM<unsigned, true>::vector geometry_list(geometries_list_ptr,
+                                                           data_layout->geometries_list_size);
         m_geometry_list.swap(geometry_list);
     }
 
-public:
-    SharedDataFacade( ) {
+  public:
+    SharedDataFacade()
+    {
         data_timestamp_ptr = (SharedDataTimestamp *)SharedMemoryFactory::Get(
-            CURRENT_REGIONS,
-            sizeof(SharedDataTimestamp),
-            false,
-            false
-        )->Ptr();
+                                 CURRENT_REGIONS, sizeof(SharedDataTimestamp), false, false)->Ptr();
 
         CURRENT_LAYOUT = LAYOUT_NONE;
         CURRENT_DATA = DATA_NONE;
         CURRENT_TIMESTAMP = 0;
 
-        //load data
+        // load data
         CheckAndReloadFacade();
     }
 
-    void CheckAndReloadFacade() {
-        if(
-            CURRENT_LAYOUT    != data_timestamp_ptr->layout    ||
-            CURRENT_DATA      != data_timestamp_ptr->data      ||
-            CURRENT_TIMESTAMP != data_timestamp_ptr->timestamp
-        ) {
+    void CheckAndReloadFacade()
+    {
+        if (CURRENT_LAYOUT != data_timestamp_ptr->layout ||
+            CURRENT_DATA != data_timestamp_ptr->data ||
+            CURRENT_TIMESTAMP != data_timestamp_ptr->timestamp)
+        {
             // release the previous shared memory segments
             SharedMemory::Remove(CURRENT_LAYOUT);
             SharedMemory::Remove(CURRENT_DATA);
 
-            CURRENT_LAYOUT    = data_timestamp_ptr->layout;
-            CURRENT_DATA      = data_timestamp_ptr->data;
+            CURRENT_LAYOUT = data_timestamp_ptr->layout;
+            CURRENT_DATA = data_timestamp_ptr->data;
             CURRENT_TIMESTAMP = data_timestamp_ptr->timestamp;
 
-            m_layout_memory.reset( SharedMemoryFactory::Get(CURRENT_LAYOUT) );
+            m_layout_memory.reset(SharedMemoryFactory::Get(CURRENT_LAYOUT));
 
-            data_layout = (SharedDataLayout *)(
-                m_layout_memory->Ptr()
-            );
+            data_layout = (SharedDataLayout *)(m_layout_memory->Ptr());
             boost::filesystem::path ram_index_path(data_layout->ram_index_file_name);
-            if( !boost::filesystem::exists(ram_index_path) ) {
-                throw OSRMException(
-                    "no leaf index file given. "
-                    "Is any data loaded into shared memory?"
-                );
+            if (!boost::filesystem::exists(ram_index_path))
+            {
+                throw OSRMException("no leaf index file given. "
+                                    "Is any data loaded into shared memory?");
             }
 
-            m_large_memory.reset( SharedMemoryFactory::Get(CURRENT_DATA) );
-            shared_memory = (char *)(
-                m_large_memory->Ptr()
-            );
+            m_large_memory.reset(SharedMemoryFactory::Get(CURRENT_DATA));
+            shared_memory = (char *)(m_large_memory->Ptr());
 
             LoadGraph();
             LoadNodeAndEdgeInformation();
@@ -295,155 +235,118 @@ public:
         }
     }
 
-    //search graph access
-    unsigned GetNumberOfNodes() const {
-        return m_query_graph->GetNumberOfNodes();
-    }
+    // search graph access
+    unsigned GetNumberOfNodes() const { return m_query_graph->GetNumberOfNodes(); }
 
-    unsigned GetNumberOfEdges() const {
-        return m_query_graph->GetNumberOfEdges();
-    }
+    unsigned GetNumberOfEdges() const { return m_query_graph->GetNumberOfEdges(); }
 
-    unsigned GetOutDegree( const NodeID n ) const {
-        return m_query_graph->GetOutDegree(n);
-    }
+    unsigned GetOutDegree(const NodeID n) const { return m_query_graph->GetOutDegree(n); }
 
-    NodeID GetTarget( const EdgeID e ) const {
-        return m_query_graph->GetTarget(e); }
+    NodeID GetTarget(const EdgeID e) const { return m_query_graph->GetTarget(e); }
 
-    EdgeDataT &GetEdgeData( const EdgeID e ) {
-        return m_query_graph->GetEdgeData(e);
-    }
+    EdgeDataT &GetEdgeData(const EdgeID e) { return m_query_graph->GetEdgeData(e); }
 
     // const EdgeDataT &GetEdgeData( const EdgeID e ) const {
     //     return m_query_graph->GetEdgeData(e);
     // }
 
-    EdgeID BeginEdges( const NodeID n ) const {
-        return m_query_graph->BeginEdges(n);
-    }
+    EdgeID BeginEdges(const NodeID n) const { return m_query_graph->BeginEdges(n); }
 
-    EdgeID EndEdges( const NodeID n ) const {
-        return m_query_graph->EndEdges(n);
-    }
+    EdgeID EndEdges(const NodeID n) const { return m_query_graph->EndEdges(n); }
 
-    //searches for a specific edge
-    EdgeID FindEdge( const NodeID from, const NodeID to ) const {
+    EdgeRange GetAdjacentEdgeRange(const NodeID node) const { return m_query_graph->GetAdjacentEdgeRange(node); };
+
+    // searches for a specific edge
+    EdgeID FindEdge(const NodeID from, const NodeID to) const
+    {
         return m_query_graph->FindEdge(from, to);
     }
 
-    EdgeID FindEdgeInEitherDirection(
-        const NodeID from,
-        const NodeID to
-    ) const {
+    EdgeID FindEdgeInEitherDirection(const NodeID from, const NodeID to) const
+    {
         return m_query_graph->FindEdgeInEitherDirection(from, to);
     }
 
-    EdgeID FindEdgeIndicateIfReverse(
-        const NodeID from,
-        const NodeID to,
-        bool & result
-    ) const {
+    EdgeID FindEdgeIndicateIfReverse(const NodeID from, const NodeID to, bool &result) const
+    {
         return m_query_graph->FindEdgeIndicateIfReverse(from, to, result);
     }
 
-    //node and edge information access
-    FixedPointCoordinate GetCoordinateOfNode(
-        const unsigned id
-    ) const {
+    // node and edge information access
+    FixedPointCoordinate GetCoordinateOfNode(const unsigned id) const
+    {
         return m_coordinate_list->at(id);
     };
 
-    virtual bool EdgeIsCompressed( const unsigned id ) const {
-        return m_egde_is_compressed.at(id);
-    }
+    virtual bool EdgeIsCompressed(const unsigned id) const { return m_egde_is_compressed.at(id); }
 
-    virtual void GetUncompressedGeometry(
-        const unsigned id, std::vector<unsigned> & result_nodes
-    ) const {
+    virtual void GetUncompressedGeometry(const unsigned id, std::vector<unsigned> &result_nodes)
+        const
+    {
         const unsigned begin = m_geometry_indices.at(id);
-        const unsigned end = m_geometry_indices.at(id+1);
+        const unsigned end = m_geometry_indices.at(id + 1);
 
         result_nodes.clear();
-        result_nodes.insert(result_nodes.begin(),
-                            m_geometry_list.begin() + begin,
-                            m_geometry_list.begin() + end);
+        result_nodes.insert(
+            result_nodes.begin(), m_geometry_list.begin() + begin, m_geometry_list.begin() + end);
     }
 
-    virtual unsigned GetGeometryIndexForEdgeID(const unsigned id) const {
+    virtual unsigned GetGeometryIndexForEdgeID(const unsigned id) const
+    {
         return m_via_node_list.at(id);
     }
 
-    TurnInstruction GetTurnInstructionForEdgeID(
-        const unsigned id
-    ) const {
+    TurnInstruction GetTurnInstructionForEdgeID(const unsigned id) const
+    {
         return m_turn_instruction_list.at(id);
     }
 
-    bool LocateClosestEndPointForCoordinate(
-        const FixedPointCoordinate& input_coordinate,
-        FixedPointCoordinate& result,
-        const unsigned zoom_level = 18
-    ) const {
-        return  m_static_rtree->LocateClosestEndPointForCoordinate(
-                    input_coordinate,
-                    result,
-                    zoom_level
-                );
+    bool LocateClosestEndPointForCoordinate(const FixedPointCoordinate &input_coordinate,
+                                            FixedPointCoordinate &result,
+                                            const unsigned zoom_level = 18) const
+    {
+        return m_static_rtree->LocateClosestEndPointForCoordinate(
+            input_coordinate, result, zoom_level);
     }
 
-    bool FindPhantomNodeForCoordinate(
-        const FixedPointCoordinate & input_coordinate,
-        PhantomNode & resulting_phantom_node,
-        const unsigned zoom_level
-    ) const {
-        const bool found =  m_static_rtree->FindPhantomNodeForCoordinate(
-                        input_coordinate,
-                        resulting_phantom_node,
-                        zoom_level
-                    );
+    bool FindPhantomNodeForCoordinate(const FixedPointCoordinate &input_coordinate,
+                                      PhantomNode &resulting_phantom_node,
+                                      const unsigned zoom_level) const
+    {
+        const bool found = m_static_rtree->FindPhantomNodeForCoordinate(
+            input_coordinate, resulting_phantom_node, zoom_level);
         return found;
     }
 
     unsigned GetCheckSum() const { return m_check_sum; }
 
-    unsigned GetNameIndexFromEdgeID(const unsigned id) const {
+    unsigned GetNameIndexFromEdgeID(const unsigned id) const
+    {
         return m_name_ID_list.at(id);
     };
 
-    void GetName( const unsigned name_id, std::string & result ) const {
-        if(UINT_MAX == name_id) {
+    void GetName(const unsigned name_id, std::string &result) const
+    {
+        if (UINT_MAX == name_id)
+        {
             result = "";
             return;
         }
-        BOOST_ASSERT_MSG(
-            name_id < m_name_begin_indices.size(),
-            "name id too high"
-        );
+        BOOST_ASSERT_MSG(name_id < m_name_begin_indices.size(), "name id too high");
         const unsigned begin_index = m_name_begin_indices[name_id];
-        const unsigned end_index = m_name_begin_indices[name_id+1];
-        BOOST_ASSERT_MSG(
-            begin_index <= m_names_char_list.size(),
-            "begin index of name too high"
-        );
-        BOOST_ASSERT_MSG(
-            end_index <= m_names_char_list.size(),
-            "end index of name too high"
-        );
+        const unsigned end_index = m_name_begin_indices[name_id + 1];
+        BOOST_ASSERT_MSG(begin_index <= m_names_char_list.size(), "begin index of name too high");
+        BOOST_ASSERT_MSG(end_index <= m_names_char_list.size(), "end index of name too high");
 
         BOOST_ASSERT_MSG(begin_index <= end_index, "string ends before begin");
         result.clear();
         result.resize(end_index - begin_index);
-        std::copy(
-            m_names_char_list.begin() + begin_index,
-            m_names_char_list.begin() + end_index,
-            result.begin()
-        );
+        std::copy(m_names_char_list.begin() + begin_index,
+                  m_names_char_list.begin() + end_index,
+                  result.begin());
     }
 
-    std::string GetTimestamp() const {
-        return m_timestamp;
-    }
+    std::string GetTimestamp() const { return m_timestamp; }
 };
 
-#endif  // SHARED_DATA_FACADE_H
+#endif // SHARED_DATA_FACADE_H