Filter segments correctly by bounding box

Remove tests from default target until we get proper switchting in place
Bump osrm version
2016-04-03 11:41:46 +02:00 · 2016-04-03 10:17:07 +02:00 · 2016-04-03 01:08:08 +02:00 · 2016-04-03 01:07:32 +02:00 · 2016-04-01 23:59:12 +02:00 · 2016-04-01 23:59:12 +02:00
377 changed files with 9389 additions and 19605 deletions
@@ -2,89 +2,53 @@
 Language:        Cpp
 # BasedOnStyle:  LLVM
 AccessModifierOffset: -2
-AlignAfterOpenBracket: Align
-AlignConsecutiveAssignments: false
-AlignConsecutiveDeclarations: false
+ConstructorInitializerIndentWidth: 4
 AlignEscapedNewlinesLeft: false
-AlignOperands:   true
 AlignTrailingComments: true
 AllowAllParametersOfDeclarationOnNextLine: true
-AllowShortBlocksOnASingleLine: true
-AllowShortCaseLabelsOnASingleLine: false
-AllowShortFunctionsOnASingleLine: All
 AllowShortIfStatementsOnASingleLine: false
 AllowShortLoopsOnASingleLine: false
-AlwaysBreakAfterDefinitionReturnType: None
-AlwaysBreakAfterReturnType: None
-AlwaysBreakBeforeMultilineStrings: false
+AllowShortFunctionsOnASingleLine: true
 AlwaysBreakTemplateDeclarations: false
-BinPackArguments: false
-BinPackParameters: false
-BraceWrapping:   
-  AfterClass:      true
-  AfterControlStatement: true
-  AfterEnum:       true
-  AfterFunction:   true
-  AfterNamespace:  true
-  AfterObjCDeclaration: true
-  AfterStruct:     true
-  AfterUnion:      true
-  BeforeCatch:     true
-  BeforeElse:      true
-  IndentBraces:    true
+AlwaysBreakBeforeMultilineStrings: false
 BreakBeforeBinaryOperators: false
-BreakBeforeBraces: Allman
 BreakBeforeTernaryOperators: true
 BreakConstructorInitializersBeforeComma: false
+BinPackParameters: false
 ColumnLimit:     100
-CommentPragmas:  '^ IWYU pragma:'
 ConstructorInitializerAllOnOneLineOrOnePerLine: false
-ConstructorInitializerIndentWidth: 4
-ContinuationIndentWidth: 4
-Cpp11BracedListStyle: true
-DerivePointerAlignment: false
-DisableFormat:   false
+DerivePointerBinding: false
 ExperimentalAutoDetectBinPacking: false
-ForEachMacros:   [ foreach, Q_FOREACH, BOOST_FOREACH ]
-IncludeCategories: 
-  - Regex:           '^<'
-    Priority:        3
-  - Regex:           '^"(osrm|util|engine|extract|contract)/'
-    Priority:        2
-  - Regex:           '.*'
-    Priority:        1
 IndentCaseLabels: false
-IndentWidth:     4
-IndentWrappedFunctionNames: false
-KeepEmptyLinesAtTheStartOfBlocks: true
-MacroBlockBegin: ''
-MacroBlockEnd:   ''
 MaxEmptyLinesToKeep: 1
+KeepEmptyLinesAtTheStartOfBlocks: true
 NamespaceIndentation: None
-ObjCBlockIndentWidth: 2
 ObjCSpaceAfterProperty: false
 ObjCSpaceBeforeProtocolList: true
 PenaltyBreakBeforeFirstCallParameter: 19
 PenaltyBreakComment: 300
-PenaltyBreakFirstLessLess: 120
 PenaltyBreakString: 1000
-PenaltyExcessCharacter: 1000000
+PenaltyBreakFirstLessLess: 120
+PenaltyExcessCharacter: 1000
 PenaltyReturnTypeOnItsOwnLine: 60
-PointerAlignment: Right
-ReflowComments:  true
-SortIncludes:    true
-SpaceAfterCStyleCast: false
-SpaceBeforeAssignmentOperators: true
-SpaceBeforeParens: ControlStatements
-SpaceInEmptyParentheses: false
+PointerBindsToType: false
 SpacesBeforeTrailingComments: 1
-SpacesInAngles:  false
-SpacesInContainerLiterals: true
-SpacesInCStyleCastParentheses: false
-SpacesInParentheses: false
-SpacesInSquareBrackets: false
+Cpp11BracedListStyle: true
 Standard:        Cpp11
+IndentWidth:     4
 TabWidth:        8
 UseTab:          Never
+BreakBeforeBraces: Allman
+IndentFunctionDeclarationAfterType: false
+SpacesInParentheses: false
+SpacesInAngles:  false
+SpaceInEmptyParentheses: false
+SpacesInCStyleCastParentheses: false
+SpacesInContainerLiterals: true
+SpaceBeforeAssignmentOperators: true
+ContinuationIndentWidth: 4
+CommentPragmas:  '^ IWYU pragma:'
+ForEachMacros:   [ foreach, Q_FOREACH, BOOST_FOREACH ]
+SpaceBeforeParens: ControlStatements
 ...

@@ -80,8 +80,6 @@ stxxl.errlog
 /test/profile.lua
 /test/cache
 /test/speeds.csv
-/test/penalties.csv
-/test/data/monaco.*
 node_modules

 # Deprecated config file #
@@ -1,7 +1,7 @@
-language: cpp
+#language: cpp
+# This makes travis use the thin image which boots faster
+language: generic

-git:
-  depth: 10

 # sudo:required is needed for trusty images
 sudo: required
@@ -13,175 +13,165 @@ notifications:
 branches:
  only:
    - master
-    - "5.2"
-
-cache:
-  ccache: true
-  apt: true
-  directories:
-    - test/cache
-
-env:
-  global:
-   - CCACHE_TEMPDIR=/tmp/.ccache-temp
-   - CCACHE_COMPRESS=1
-   - JOBS=4
+    - develop

 matrix:
  fast_finish: true

-  # We override the compiler names here to yield better ccache behavior, which uses this as key
  include:

    # Debug Builds
    - os: linux
-      compiler: "gcc-5-debug"
+      compiler: gcc
      addons: &gcc5
        apt:
          sources: ['ubuntu-toolchain-r-test']
-          packages: ['g++-5', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev', 'ccache']
-      env: CCOMPILER='gcc-5' CXXCOMPILER='g++-5' BUILD_TYPE='Debug' COVERAGE=ON
+          packages: ['g++-5', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
+      env: COMPILER='g++-5' BUILD_TYPE='Debug'

    - os: linux
-      compiler: "gcc-4.8-debug"
+      compiler: gcc
      addons: &gcc48
        apt:
          sources: ['ubuntu-toolchain-r-test']
-          packages: ['g++-4.8', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev', 'ccache']
-      env: CCOMPILER='gcc-4.8' CXXCOMPILER='g++-4.8' BUILD_TYPE='Debug'
+          packages: ['g++-4.8', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
+      env: COMPILER='g++-4.8' BUILD_TYPE='Debug'

    - os: linux
-      compiler: "clang-3.8-debug"
+      compiler: clang
      addons: &clang38
        apt:
-          sources: ['ubuntu-toolchain-r-test']
-          packages: ['libstdc++-5-dev', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev', 'ccache']
-      env: CLANG_VERSION='3.8.0' BUILD_TYPE='Debug' RUN_CLANG_FORMAT=ON
+          sources: ['llvm-toolchain-precise', 'ubuntu-toolchain-r-test']
+          packages: ['clang-3.8', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
+      env: COMPILER='clang++-3.8' BUILD_TYPE='Debug' RUN_CLANG_FORMAT=ON

    - os: osx
      osx_image: xcode7.3
      compiler: clang
-      env: CCOMPILER='clang' CXXCOMPILER='clang++' BUILD_TYPE='Debug' JOBS=1 CUCUMBER_TIMEOUT=60000
+      env: COMPILER='clang++' BUILD_TYPE='Debug'

    # Release Builds
    - os: linux
-      compiler: "gcc-5-release"
+      compiler: gcc
      addons: &gcc5
        apt:
          sources: ['ubuntu-toolchain-r-test']
-          packages: ['g++-5', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev', 'ccache']
-      env: CCOMPILER='gcc-5' CXXCOMPILER='g++-5' BUILD_TYPE='Release'
+          packages: ['g++-5', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
+      env: COMPILER='g++-5' BUILD_TYPE='Release'

-      # Disabled because of CI slowness
-      #- os: linux
-      #- compiler: gcc
-      #- addons: &gcc48
-      #-   apt:
-      #-     sources: ['ubuntu-toolchain-r-test']
-      #-     packages: ['g++-4.8', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
-      #- env: CCOMPILER='gcc-4.8' CXXCOMPILER='g++-4.8' BUILD_TYPE='Release'
+    - os: linux
+      compiler: gcc
+      addons: &gcc48
+        apt:
+          sources: ['ubuntu-toolchain-r-test']
+          packages: ['g++-4.8', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
+      env: COMPILER='g++-4.8' BUILD_TYPE='Release'

-      # Disabled because of CI slowness
-      #- os: linux
-      #- compiler: clang
-      #- addons: &clang38
-      #-   apt:
-      #-     sources: ['llvm-toolchain-precise-3.8', 'ubuntu-toolchain-r-test']
-      #-     packages: ['clang-3.8', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
-      #- env: CCOMPILER='clang-3.8' CXXCOMPILER='clang++-3.8' BUILD_TYPE='Release'
+    - os: linux
+      compiler: clang
+      addons: &clang38
+        apt:
+          sources: ['llvm-toolchain-precise', 'ubuntu-toolchain-r-test']
+          packages: ['clang-3.8', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
+      env: COMPILER='clang++-3.8' BUILD_TYPE='Release'

-      # Disabled because of CI slowness
-      #- os: osx
-      #- osx_image: xcode7.3
-      #- compiler: clang
-      #- env: CCOMPILER='clang' CXXCOMPILER='clang++' BUILD_TYPE='Release'
+    - os: osx
+      osx_image: xcode7.3
+      compiler: clang
+      env: COMPILER='clang++' BUILD_TYPE='Release'

    # Shared Library
    - os: linux
-      compiler: "gcc-5-release-shared"
+      compiler: gcc
      addons: &gcc5
        apt:
          sources: ['ubuntu-toolchain-r-test']
-          packages: ['g++-5', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev', 'ccache']
-      env: CCOMPILER='gcc-5' CXXCOMPILER='g++-5' BUILD_TYPE='Release' BUILD_SHARED_LIBS=ON
+          packages: ['g++-5', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
+      env: COMPILER='g++-5' BUILD_TYPE='Release' BUILD_SHARED_LIBS=ON

-      # Disabled because CI slowness
-      #- os: linux
-      #- compiler: clang
-      #- addons: &clang38
-      #-   apt:
-      #-     sources: ['llvm-toolchain-precise-3.8', 'ubuntu-toolchain-r-test']
-      #-     packages: ['clang-3.8', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
-      #- env: CCOMPILER='clang-3.8' CXXCOMPILER='clang++-3.8' BUILD_TYPE='Release' BUILD_SHARED_LIBS=ON
+    - os: linux
+      compiler: clang
+      addons: &clang38
+        apt:
+          sources: ['llvm-toolchain-precise', 'ubuntu-toolchain-r-test']
+          packages: ['clang-3.8', 'libbz2-dev', 'libstxxl-dev', 'libstxxl1', 'libxml2-dev', 'libzip-dev', 'lua5.1', 'liblua5.1-0-dev', 'libtbb-dev', 'libgdal-dev', 'libluabind-dev', 'libboost-all-dev']
+      env: COMPILER='clang++-3.8' BUILD_TYPE='Release' BUILD_SHARED_LIBS=ON
+
+
+    # Disabled until tests all pass on OSX:
+    #
+    # 3/ OSX Clang Builds
+    #- os: osx
+    #  osx_image: xcode6.4
+    #  compiler: clang
+    #  env: COMPILER='clang++' BUILD_TYPE='Debug'
+
+    #- os: osx
+    #  osx_image: xcode6.4
+    #  compiler: clang
+    #  env: COMPILER='clang++' BUILD_TYPE='Release'
+
+    #- os: osx
+    #  osx_image: xcode6.4
+    #  compiler: clang
+    #  env: COMPILER='clang++' BUILD_TYPE='Release' BUILD_SHARED_LIBS=ON
+
+    #- os: osx
+    #  osx_image: xcode7
+    #  compiler: clang
+    #  env: COMPILER='clang++' BUILD_TYPE='Release' BUILD_SHARED_LIBS=ON

 before_install:
-  - if [[ $(uname -s) == 'Darwin' ]]; then sudo mdutil -i off /; fi;
  - source ./scripts/install_node.sh 4
-  - npm install
-  - DEPS_DIR="${TRAVIS_BUILD_DIR}/deps"
-  - export PATH=${DEPS_DIR}/bin:${PATH} && mkdir -p ${DEPS_DIR}
-  - CMAKE_URL="https://mason-binaries.s3.amazonaws.com/${TRAVIS_OS_NAME}-x86_64/cmake/3.5.2.tar.gz"
-  - travis_retry wget --quiet -O - ${CMAKE_URL} | tar --strip-components=1 -xz -C ${DEPS_DIR}
-  - |
-    if [[ ${CLANG_VERSION:-false} != false ]]; then
-      export CCOMPILER='clang'
-      export CXXCOMPILER='clang++'
-      CLANG_URL="https://mason-binaries.s3.amazonaws.com/${TRAVIS_OS_NAME}-x86_64/clang/${CLANG_VERSION}.tar.gz"
-      travis_retry wget --quiet -O - ${CLANG_URL} | tar --strip-components=1 -xz -C ${DEPS_DIR}
-    fi
-  - |
-    if [[ "${TRAVIS_OS_NAME}" == "osx" ]]; then
-      # implicit deps, but seem to be installed by default with recent images: libxml2 GDAL boost
-      brew install libzip libstxxl lua51 luabind tbb md5sha1sum ccache
-    fi

 install:
+  - npm install
+  - DEPS_DIR="${TRAVIS_BUILD_DIR}/deps"
+  - mkdir -p ${DEPS_DIR} && cd ${DEPS_DIR}
+  - |
+    if [[ "${TRAVIS_OS_NAME}" == "linux" ]]; then
+      CMAKE_URL="http://www.cmake.org/files/v3.3/cmake-3.3.2-Linux-x86_64.tar.gz"
+      mkdir cmake && travis_retry wget --quiet -O - ${CMAKE_URL} | tar --strip-components=1 -xz -C cmake
+      export PATH=${DEPS_DIR}/cmake/bin:${PATH}
+
+    elif [[ "${TRAVIS_OS_NAME}" == "osx" ]]; then
+      # implicit deps, but seem to be installed by default with recent images: libxml2 GDAL boost
+      brew install cmake libzip libstxxl lua51 luabind tbb md5sha1sum
+    fi
+
+before_script:
+  - cd ${TRAVIS_BUILD_DIR}
  - |
    if [[ "${TRAVIS_OS_NAME}" == "linux" ]]; then
      ./scripts/check_taginfo.py taginfo.json profiles/car.lua
    fi
  - mkdir build && pushd build
-  - export CC=${CCOMPILER} CXX=${CXXCOMPILER}
-  - cmake .. -DCMAKE_BUILD_TYPE=${BUILD_TYPE} -DBUILD_SHARED_LIBS=${BUILD_SHARED_LIBS:-OFF} -DCOVERAGE=${COVERAGE:-OFF} -DBUILD_TOOLS=1 -DENABLE_CCACHE=ON
-  - echo "travis_fold:start:MAKE"
-  - make osrm-extract --jobs=3
-  - make --jobs=${JOBS}
-  - make tests --jobs=${JOBS}
-  - make benchmarks --jobs=${JOBS}
-  - echo "travis_fold:end:MAKE"
-  - ccache -s
+  - export CXX=${COMPILER}
+  - export OSRM_PORT=5000 OSRM_TIMEOUT=6000
+  - cmake .. -DCMAKE_BUILD_TYPE=${BUILD_TYPE} -DBUILD_SHARED_LIBS=${BUILD_SHARED_LIBS:-OFF} -DBUILD_TOOLS=1 -DENABLE_CCACHE=0
+
+script:
+  - make --jobs=2
+  - make tests --jobs=2
+  - make benchmarks
  - sudo make install
  - |
    if [[ "${TRAVIS_OS_NAME}" == "linux" ]]; then
      sudo ldconfig
    fi
-  - popd
-  - mkdir example/build && pushd example/build
-  - cmake .. -DCMAKE_BUILD_TYPE=${BUILD_TYPE}
-  - make
-  - popd
-
-script:
-  - echo "travis_fold:start:BENCHMARK"
-  - make -C test/data benchmark
-  - echo "travis_fold:end:BENCHMARK"
-  - ./example/build/osrm-example test/data/monaco.osrm
-  # All tests assume to be run from the build directory
-  - pushd build
-  - ./unit_tests/library-tests ../test/data/monaco.osrm
-  - ./unit_tests/extractor-tests
-  - ./unit_tests/engine-tests
-  - ./unit_tests/util-tests
-  - ./unit_tests/server-tests
+  - ./extractor-tests
+  - ./engine-tests
+  - ./util-tests
  - popd
  - npm test
-
-after_success:
+  - make -C test/data
+  - ./build/library-tests test/data/monaco.osrm
+  - mkdir example/build && pushd example/build
+  - cmake ..
+  - make
+  - ./osrm-example ../../test/data/monaco.osrm
+  - popd
  - |
-    if [ -n "${RUN_CLANG_FORMAT}" ]; then
-      ./scripts/format.sh # we don't want to fail just yet
-    fi
-  - |
-    if [ -n "${COVERAGE}" ]; then
-      bash <(curl -s https://codecov.io/bash)
+    if [ -n "$RUN_CLANG_FORMAT" ]; then
+      ./scripts/format.sh || true # we don't want to fail just yet
    fi
@@ -1,231 +1,3 @@
-# 5.2.6
-  - Bugfixes
-    - Fix numeric overflow in roundabout center calculation which throws an exception
-
-# 5.2.5
-  - Bugfixes
-    - Fixes a segfault caused by incorrect trimming logic for very short steps.
-
-# 5.2.4
-  Changes from 5.2.3:
-  - Bugfixes:
-    - Fixed a crash that arised on roundabouts in combination with intermediate intersections and sliproads
-    - Fixed #2518: Invalid bilinear interpolation when using raster data
-    - Fixed #2546: The geometry returned by the match service was missing the last coordinate.
-
-  BREAKING: The data format changed between 5.2.3 and 5.2.4, you need to reprocess.
-
-# 5.2.3
-  - Bugfixes:
-    - Fixed an issue with name changes in roundabouts that could result in crashes
-
-# 5.2.2
-  Changes from 5.2.1
-  - Bugfixes:
-    - Buffer overrun in tile plugin response handling
-
-# 5.2.1
-  Changes from 5.2.0
-  - Bugfixes:
-    - Removed debug statement that was spamming the console
-
-# 5.2.0
-  Changes from 5.2.0 RC2
-   - Bugfixes:
-     - Fixed crash when loading shared memory caused by invalid OSM IDs segment size.
-     - Various small instructions handling fixes
-
-   Changes from 5.1.0
-   - API:
-     - new parameter `annotations` for `route`, `trip` and `match` requests.  Returns additional data about each
-       coordinate along the selected/matched route line per `RouteLeg`:
-         - duration of each segment
-         - distance of each segment
-         - OSM node ids of all segment endpoints
-     - Introducing Intersections for Route Steps. This changes the API format in multiple ways.
-         - `bearing_before`/`bearing_after` of `StepManeuver` are now deprecated and will be removed in the next major release
-         - `location` of `StepManeuvers` is now deprecated and will be removed in the next major release
-         - every `RouteStep` now has property `intersections` containing a list of `Intersection` objects.
-     - Support for destination signs. New member `destinations` in `RouteStep`, based on `destination` and `destination:ref`
-     - Support for name pronunciations. New member `pronunciation` in `RouteStep`, based on `name:pronunciation`
-
-   - Profile changes:
-     - duration parser now accepts P[n]DT[n]H[n]M[n]S, P[n]W, PTHHMMSS and PTHH:MM:SS ISO8601 formats.
-     - `result.destinations` allows you to set a way's destinations
-     - `result.pronunciation` allows you to set way name pronunciations
-     - `highway=motorway_link` no longer implies `oneway` as per the OSM Wiki
-
-   - Infrastructure:
-     - BREAKING: Changed the on-disk encoding of the StaticRTree to reduce ramIndex file size. This breaks the **data format**
-     - BREAKING: Intersection Classification adds a new file to the mix (osrm.icd). This breaks the fileformat for older versions.
-     - Better support for osrm-routed binary upgrade on the fly [UNIX specific]:
-       - Open sockets with SO_REUSEPORT to allow multiple osrm-routed processes serving requests from the same port.
-       - Add SIGNAL_PARENT_WHEN_READY environment variable to enable osrm-routed signal its parent with USR1 when it's running and waiting for requests.
-     - Disable http access logging via DISABLE_ACCESS_LOGGING environment variable.
-
-   - Guidance:
-     - BREAKING: modifies the file format with new internal identifiers
-     - improved detection of turning streets, not reporting new-name in wrong situations
-     - improved handling of sliproads (emit turns instead of 'take the ramp')
-     - improved collapsing of instructions. Some 'new name' instructions will be suppressed if they are without alternative and the segment is short
-
-   - Bugfixes
-     - fixed broken summaries for very short routes
-
-# 5.2.0 RC2
-   Changes from 5.2.0 RC1
-
-   - Guidance:
-     - improved handling of sliproads (emit turns instead of 'take the ramp')
-     - improved collapsing of instructions. Some 'new name' instructions will be suppressed if they are without alternative and the segment is short
-     - BREAKING: modifies the file format with new internal identifiers
-
-   - API:
-     - paramater `annotate` was renamed to `annotations`.
-     - `annotation` as accidentally placed in `Route` instead of `RouteLeg`
-     - Support for destination signs. New member `destinations` in `RouteStep`, based on `destination` and `destination:ref`
-     - Support for name pronunciations. New member `pronunciation` in `RouteStep`, based on `name:pronunciation`
-     - Add `nodes` property to `annotation` in `RouteLeg` containing the ids of nodes covered by the route
-
-   - Profile changes:
-     - `result.destinations` allows you to set a way's destinations
-     - `result.pronunciation` allows you to set way name pronunciations
-     - `highway=motorway_link` no longer implies `oneway` as per the OSM Wiki
-
-   - Infrastructure
-     - BREAKING: Changed the on-disk encoding of the StaticRTree to reduce ramIndex file size. This breaks the **data format**
-
-   - Bugfixes
-     - fixed broken summaries for very short routes
-
-# 5.2.0 RC1
-   Changes from 5.1.0
-
-   - API:
-     - new parameter `annotate` for `route` and `match` requests.  Returns additional data about each
-       coordinate along the selected/matched route line.
-     - Introducing Intersections for Route Steps. This changes the API format in multiple ways.
-         - `bearing_before`/`bearing_after` of `StepManeuver` are now deprecated and will be removed in the next major release
-         - `location` of `StepManeuvers` is now deprecated and will be removed in the next major release
-         - every `RouteStep` now has property `intersections` containing a list of `Intersection` objects.
-
-   - Profile changes:
-     - duration parser now accepts P[n]DT[n]H[n]M[n]S, P[n]W, PTHHMMSS and PTHH:MM:SS ISO8601 formats.
-
-   - Infrastructure:
-     - Better support for osrm-routed binary upgrade on the fly [UNIX specific]:
-       - Open sockets with SO_REUSEPORT to allow multiple osrm-routed processes serving requests from the same port.
-       - Add SIGNAL_PARENT_WHEN_READY environment variable to enable osrm-routed signal its parent with USR1 when it's running and waiting for requests.
-     - BREAKING: Intersection Classification adds a new file to the mix (osrm.icd). This breaks the fileformat for older versions.
-     - Disable http access logging via DISABLE_ACCESS_LOGGING environment
-       variable.
-
-   - Guidance:
-     - improved detection of turning streets, not reporting new-name in wrong situations
-
-# 5.1.0
-   Changes with regard to 5.0.0
-
-   - API:
-     - added StepManeuver type `roundabout turn`. The type indicates a small roundabout that is treated as an intersection
-        (turn right at the roundabout for first exit, go straight at the roundabout...)
-     - added StepManeuver type `on ramp` and `off ramp` to distinguish between ramps that enter and exit a highway.
-     - reduced new name instructions for trivial changes
-     - combined multiple turns into a single instruction at segregated roads`
-
-   - Profile Changes:
-    - introduced a suffix_list / get_name_suffix_list to specify name suffices to be suppressed in name change announcements
-    - street names are now consistently assembled for the car, bike and walk profile as: "Name (Ref)" as in "Berlin (A5)"
-    - new `car.lua` dependency `lib/destination.lua`
-    - register a way's .nodes() function for use in the profile's way_function.
-
-   - Infrastructure
-    - BREAKING: reordered internal instruction types. This breaks the **data format**
-    - BREAKING: Changed the on-disk encoding of the StaticRTree for better performance. This breaks the **data format**
-
-   - Fixes:
-    - Issue #2310: post-processing for local paths, fixes #2310
-    - Issue #2309: local path looping, fixes #2309
-    - Issue #2356: Make hint values optional
-    - Issue #2349: Segmentation fault in some requests
-    - Issue #2335: map matching was using shortest path with uturns disabled
-    - Issue #2193: Fix syntax error position indicators in parameters queries
-    - Fix search with u-turn
-    - PhantomNode packing in MSVC now the same on other platforms
-    - Summary is now not malformed when including unnamed roads
-    - Emit new-name on when changing fron unanmed road to named road
-
-# 5.0.0
-   Changes with regard 5.0.0 RC2:
-   - API:
-     - if `geometry=geojson` is passed the resulting geometry can be a LineString or Point
-       depending on how many coordinates are present.
-     - the removal of the summary field was revered. for `steps=flase` the field will always be an empty string.
-
-   Changes with regard to 4.9.1:
-   - API:
-     - BREAKING: Complete rewrite of the HTTP and library API. See detailed documentation in the wiki.
-     - BREAKING: The default coordinate order is now `longitude, latidue`. Exception: Polyline geometry
-         which follow the original Google specification of `latitdue, longitude`.
-     - BREAKING: Polyline geometries now use precision 5, instead of previously 6
-     - BREAKING: Removed GPX support
-     - New service `tile` which serves debug vector tiles of the road network
-     - Completely new engine for guidance generation:
-        - Support for highway ramps
-        - Support for different intersection types (end of street, forks, merges)
-        - Instruction post-processing to merge unimportant instructions
-        - Improved handling of roundabouts
-
-   - Tools:
-     - BREAKING: Renamed osrm-prepare to osrm-contract
-     - BREAKING: Removes profiles from osrm-contract, only needed in osrm-extract.
-     - Abort processing in osrm-extract if there are no snappable edges remaining.
-     - Added .properties file to osrm-extract ouput.
-     - Enables the use of multiple segment-speed-files on the osrm-contract command line
-
-   - Profile changes:
-     - Remove movable bridge mode
-     - Add `maxspeed=none` tag to car profile.
-     - A `side_road` tag support for the OSRM car profile.
-
-   - Fixes:
-     - Issue #2150: Prevents routing over delivery ways and nodes
-     - Issue #1972: Provide uninstall target
-     - Issue #2072: Disable alternatives by default and if core factor < 1.0
-     - Issue #1999: Fix unpacking for self-loop nodes not in core.
-
-   - Infrastructure:
-     - Cucumber test suit is now based on cucumber-js, removes Ruby as dependency
-     - Updated to mapbox/variant v1.1
-     - Updated to libosmium v2.6.1
-     - Remove GeoJSON based debugging output, replaced by debug tiles
-
-
-# 5.0.0 RC2
-   - Profiles:
-      - `properties.allow_uturns_at_via` -> `properties.continue_straight_at_waypoint` (value is inverted!)
-   - API:
-      - Removed summary from legs property
-      - Disable steps and alternatives by default
-      - Fix `code` field: 'ok' -> 'Ok'
-      - Allow 4.json and 4.3.json format
-      - Conform to v5 spec and support "unlimited" as radiuses value.
-      - `uturns` parameter was replaced by `continue_straight` (value is inverted!)
-   - Features:
-      - Report progress for gennerating edge expanded edges in the edge based graph factory
-      - Add maxspeed=none tag to car profile.
-      - Optimize StaticRTree code: speedup 2x (to RC1)
-      - Optimize DouglasPeucker code: speedup 10x (to RC1)
-      - Optimize WebMercator projection: speedup 2x (to RC1)
-   - Bugs:
-      - #2195: Resolves issues with multiple includedirs in pkg-config file
-      - #2219: Internal server error when using the match plugin
-      - #2027: basename -> filename
-      - #2168: Report correct position where parsing failed
-      - #2036: Add license to storage and storage config exposed in public API
-      - Fix uturn detection in match plugin
-      - Add missing -lz to fix linking of server-tests
-
 # 5.0.0 RC1
   - Renamed osrm-prepare into osrm-contract
   - osrm-contract does not need a profile parameter anymore
@@ -1,5 +1,4 @@
-cmake_minimum_required(VERSION 2.8.11)
-# we depend on 2.8.11 introducing target_include_directories
+cmake_minimum_required(VERSION 2.8.8)

 if(CMAKE_CURRENT_SOURCE_DIR STREQUAL CMAKE_CURRENT_BINARY_DIR AND NOT MSVC_IDE)
  message(FATAL_ERROR "In-source builds are not allowed.
@@ -9,24 +8,8 @@ endif()

 project(OSRM C CXX)
 set(OSRM_VERSION_MAJOR 5)
-set(OSRM_VERSION_MINOR 2)
-set(OSRM_VERSION_PATCH 6)
-
-# these two functions build up custom variables:
-#   OSRM_INCLUDE_PATHS and OSRM_DEFINES
-# These variables we want to pass to
-# include_directories and add_definitions for both
-# this build and for sharing externally via pkg-config
-
-function(add_dependency_includes includes)
-  list(APPEND OSRM_INCLUDE_PATHS "${includes}")
-  set(OSRM_INCLUDE_PATHS "${OSRM_INCLUDE_PATHS}" PARENT_SCOPE)
-endfunction(add_dependency_includes)
-
-function(add_dependency_defines defines)
-  list(APPEND OSRM_DEFINES "${defines}")
-  set(OSRM_DEFINES "${OSRM_DEFINES}" PARENT_SCOPE)
-endfunction(add_dependency_defines)
+set(OSRM_VERSION_MINOR 0)
+set(OSRM_VERSION_PATCH 0)

 set(CMAKE_EXPORT_COMPILE_COMMANDS ON)
 include(CheckCXXCompilerFlag)
@@ -42,17 +25,15 @@ else()
  message(WARNING "Building on a 32 bit system is unsupported")
 endif()

-if(WIN32 AND MSVC_VERSION LESS 1900)
-  message(FATAL_ERROR "Building with Microsoft compiler needs Latest Visual Studio 2015 (Community or better)")
+if(WIN32 AND MSVC_VERSION LESS 1800)
+  message(FATAL_ERROR "Building with Microsoft compiler needs Visual Studio 2013 or later (Express version works too)")
 endif()

 option(ENABLE_CCACHE "Speed up incremental rebuilds via ccache" ON)
 option(ENABLE_JSON_LOGGING "Adds additional JSON debug logging to the response" OFF)
 option(BUILD_TOOLS "Build OSRM tools" OFF)
-option(BUILD_COMPONENTS "Build osrm-components" OFF)
+option(BUILD_COMPONENTS "Build OSRM tools" ON)
 option(ENABLE_ASSERTIONS OFF)
-option(COVERAGE OFF)
-option(SANITIZER OFF)

 include_directories(BEFORE ${CMAKE_CURRENT_BINARY_DIR}/include/)
 include_directories(BEFORE ${CMAKE_CURRENT_SOURCE_DIR}/include/)
@@ -65,18 +46,27 @@ add_custom_target(FingerPrintConfigure ALL ${CMAKE_COMMAND}
  COMMENT "Configuring revision fingerprint"
  VERBATIM)

-set(BOOST_COMPONENTS date_time filesystem iostreams program_options regex system thread)
+add_custom_target(tests DEPENDS engine-tests extractor-tests util-tests server-tests library-tests)
+add_custom_target(benchmarks DEPENDS rtree-bench)
+
+set(BOOST_COMPONENTS date_time filesystem iostreams program_options regex system thread unit_test_framework)

 configure_file(
  ${CMAKE_CURRENT_SOURCE_DIR}/include/util/version.hpp.in
  ${CMAKE_CURRENT_BINARY_DIR}/include/util/version.hpp
 )
-file(GLOB UtilGlob src/util/*.cpp src/util/*/*.cpp)
+file(GLOB UtilGlob src/util/*.cpp)
 file(GLOB ExtractorGlob src/extractor/*.cpp src/extractor/*/*.cpp)
 file(GLOB ContractorGlob src/contractor/*.cpp)
 file(GLOB StorageGlob src/storage/*.cpp)
 file(GLOB ServerGlob src/server/*.cpp src/server/**/*.cpp)
 file(GLOB EngineGlob src/engine/*.cpp src/engine/**/*.cpp)
+file(GLOB ExtractorTestsGlob unit_tests/extractor/*.cpp)
+file(GLOB EngineTestsGlob unit_tests/engine/*.cpp)
+file(GLOB UtilTestsGlob unit_tests/util/*.cpp)
+file(GLOB ServerTestsGlob unit_tests/server/*.cpp)
+file(GLOB LibraryTestsGlob unit_tests/library/*.cpp)
+file(GLOB IOTestsGlob unit_tests/io/*.cpp)

 add_library(UTIL OBJECT ${UtilGlob})
 add_library(EXTRACTOR OBJECT ${ExtractorGlob})
@@ -97,6 +87,21 @@ add_library(osrm_extract $<TARGET_OBJECTS:EXTRACTOR> $<TARGET_OBJECTS:UTIL>)
 add_library(osrm_contract $<TARGET_OBJECTS:CONTRACTOR> $<TARGET_OBJECTS:UTIL>)
 add_library(osrm_store $<TARGET_OBJECTS:STORAGE> $<TARGET_OBJECTS:UTIL>)

+# Unit tests
+add_executable(engine-tests EXCLUDE_FROM_ALL unit_tests/engine_tests.cpp ${EngineTestsGlob} $<TARGET_OBJECTS:ENGINE> $<TARGET_OBJECTS:STORAGE> $<TARGET_OBJECTS:UTIL>)
+add_executable(extractor-tests EXCLUDE_FROM_ALL unit_tests/extractor_tests.cpp ${ExtractorTestsGlob} $<TARGET_OBJECTS:EXTRACTOR> $<TARGET_OBJECTS:UTIL>)
+add_executable(util-tests EXCLUDE_FROM_ALL unit_tests/util_tests.cpp ${UtilTestsGlob} $<TARGET_OBJECTS:UTIL>)
+add_executable(server-tests EXCLUDE_FROM_ALL unit_tests/server_tests.cpp ${ServerTestsGlob} $<TARGET_OBJECTS:UTIL> $<TARGET_OBJECTS:SERVER>)
+add_executable(library-tests EXCLUDE_FROM_ALL unit_tests/library_tests.cpp ${LibraryTestsGlob})
+
+# Benchmarks
+add_executable(rtree-bench EXCLUDE_FROM_ALL src/benchmarks/static_rtree.cpp $<TARGET_OBJECTS:UTIL>)
+
+target_include_directories(engine-tests PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/unit_tests)
+target_include_directories(util-tests PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/unit_tests)
+target_include_directories(library-tests PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/include ${CMAKE_CURRENT_SOURCE_DIR}/)
+target_include_directories(rtree-bench PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/unit_tests)
+
 # Check the release mode
 if(NOT CMAKE_BUILD_TYPE MATCHES Debug)
  set(CMAKE_BUILD_TYPE Release)
@@ -152,20 +157,8 @@ if(CMAKE_BUILD_TYPE MATCHES Release)
  endif()
 endif()

-set(MAYBE_COVERAGE_LIBRARIES "")
-if (COVERAGE)
-  if (NOT CMAKE_BUILD_TYPE MATCHES "Debug")
-    message(ERROR "COVERAGE=ON only make sense with a Debug build")
-  endif()
-  message(INFO "Enabling coverage")
-  set(MAYBE_COVERAGE_LIBRARIES "gcov")
-  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -ftest-coverage -fprofile-arcs")
-endif()
-if (SANITIZER)
-  if (NOT CMAKE_BUILD_TYPE MATCHES "Debug")
-    message(ERROR "SANITIZER=ON only make sense with a Debug build")
-  endif()
-  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fsanitize=address")
+if(NOT WIN32)
+  add_definitions(-DBOOST_TEST_DYN_LINK)
 endif()

 # Configuring compilers
@@ -180,7 +173,7 @@ elseif(${CMAKE_CXX_COMPILER_ID} STREQUAL "GNU")
  # using GCC
  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall -Wextra -pedantic -Wuninitialized -Wunreachable-code -Wstrict-overflow=1 -D_FORTIFY_SOURCE=2 ${COLOR_FLAG} -fPIC")
  if(WIN32) # using mingw
-    add_dependency_defines(-DWIN32)
+    add_definitions(-DWIN32)
    set(OPTIONAL_SOCKET_LIBS ws2_32 wsock32)
  endif()
 elseif(${CMAKE_CXX_COMPILER_ID} STREQUAL "Intel")
@@ -189,12 +182,12 @@ elseif(${CMAKE_CXX_COMPILER_ID} STREQUAL "Intel")
 elseif(${CMAKE_CXX_COMPILER_ID} STREQUAL "MSVC")
  # using Visual Studio C++
  set(BOOST_COMPONENTS ${BOOST_COMPONENTS} date_time chrono zlib)
-  add_dependency_defines(-DBOOST_LIB_DIAGNOSTIC)
-  add_dependency_defines(-D_CRT_SECURE_NO_WARNINGS)
-  add_dependency_defines(-DNOMINMAX) # avoid min and max macros that can break compilation
-  add_dependency_defines(-D_USE_MATH_DEFINES) #needed for M_PI with cmath.h
-  add_dependency_defines(-D_WIN32_WINNT=0x0501)
-  add_dependency_defines(-DXML_STATIC)
+  add_definitions(-DBOOST_LIB_DIAGNOSTIC)
+  add_definitions(-D_CRT_SECURE_NO_WARNINGS)
+  add_definitions(-DNOMINMAX) # avoid min and max macros that can break compilation
+  add_definitions(-D_USE_MATH_DEFINES) #needed for M_PI with cmath.h
+  add_definitions(-D_WIN32_WINNT=0x0501)
+  add_definitions(-DXML_STATIC)
  find_library(ws2_32_LIBRARY_PATH ws2_32)
  target_link_libraries(osrm-extract wsock32 ws2_32)
 endif()
@@ -221,7 +214,7 @@ set(CMAKE_MODULE_LINKER_FLAGS "${CMAKE_MODULE_LINKER_FLAGS} ${LINKER_FLAGS}")

 # Activate C++11
 if(NOT ${CMAKE_CXX_COMPILER_ID} STREQUAL "MSVC")
-  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11 ")
 endif()

 # Configuring other platform dependencies
@@ -246,54 +239,39 @@ endif()
 list(APPEND CMAKE_MODULE_PATH "${CMAKE_CURRENT_SOURCE_DIR}/third_party/libosmium/cmake")
 set(OSMIUM_INCLUDE_DIR "${CMAKE_CURRENT_SOURCE_DIR}/third_party/libosmium/include")
 find_package(Osmium REQUIRED COMPONENTS io)
-add_dependency_includes(${OSMIUM_INCLUDE_DIR})
+include_directories(SYSTEM ${OSMIUM_INCLUDE_DIRS})


-find_package(Boost 1.49.0 REQUIRED COMPONENTS ${BOOST_COMPONENTS})
-
-# collect a subset of the boost libraries needed
-# by libosrm
-foreach(lib ${Boost_LIBRARIES})
-  if(NOT WIN32)
-    if(lib MATCHES filesystem OR lib MATCHES thread OR lib MATCHES iostreams OR lib MATCHES system)
-       list(APPEND BOOST_ENGINE_LIBRARIES "${lib}")
-    endif()
-  else()
-    list(APPEND BOOST_ENGINE_LIBRARIES "${lib}")
-  endif()
-endforeach(lib)
-
-if(NOT WIN32 AND NOT Boost_USE_STATIC_LIBS)
-  add_dependency_defines(-DBOOST_TEST_DYN_LINK)
+find_package(Boost 1.49.0 COMPONENTS ${BOOST_COMPONENTS} REQUIRED)
+if(NOT WIN32)
+  add_definitions(-DBOOST_TEST_DYN_LINK)
 endif()
-add_dependency_defines(-DBOOST_SPIRIT_USE_PHOENIX_V3)
-add_dependency_defines(-DBOOST_RESULT_OF_USE_DECLTYPE)
-add_dependency_defines(-DBOOST_FILESYSTEM_NO_DEPRECATED)
-add_dependency_includes(${Boost_INCLUDE_DIRS})
+add_definitions(-DBOOST_SPIRIT_USE_PHOENIX_V3 -DBOOST_RESULT_OF_USE_DECLTYPE)
+include_directories(SYSTEM ${Boost_INCLUDE_DIRS})

 find_package(Threads REQUIRED)

 find_package(TBB REQUIRED)
-add_dependency_includes(${TBB_INCLUDE_DIR})
+include_directories(SYSTEM ${TBB_INCLUDE_DIR})
 if(WIN32 AND CMAKE_BUILD_TYPE MATCHES Debug)
  set(TBB_LIBRARIES ${TBB_DEBUG_LIBRARIES})
 endif()

-find_package(Luabind REQUIRED)
+find_package( Luabind REQUIRED )
 include(check_luabind)
-add_dependency_includes(${LUABIND_INCLUDE_DIR})
+include_directories(SYSTEM ${LUABIND_INCLUDE_DIR})

 set(USED_LUA_LIBRARIES ${LUA_LIBRARY})
 if(LUAJIT_FOUND)
  set(USED_LUA_LIBRARIES, LUAJIT_LIBRARIES)
 endif()
-add_dependency_includes(${LUA_INCLUDE_DIR})
+include_directories(SYSTEM ${LUA_INCLUDE_DIR})

 find_package(EXPAT REQUIRED)
-add_dependency_includes(${EXPAT_INCLUDE_DIRS})
+include_directories(SYSTEM ${EXPAT_INCLUDE_DIRS})

 find_package(STXXL REQUIRED)
-add_dependency_includes(${STXXL_INCLUDE_DIR})
+include_directories(SYSTEM ${STXXL_INCLUDE_DIR})

 set(OpenMP_FIND_QUIETLY ON)
 find_package(OpenMP)
@@ -303,19 +281,16 @@ if(OPENMP_FOUND)
 endif()

 find_package(BZip2 REQUIRED)
-add_dependency_includes(${BZIP2_INCLUDE_DIR})
+include_directories(SYSTEM ${BZIP_INCLUDE_DIRS})

 find_package(ZLIB REQUIRED)
-add_dependency_includes(${ZLIB_INCLUDE_DIRS})
+include_directories(SYSTEM ${ZLIB_INCLUDE_DIRS})

 if (ENABLE_JSON_LOGGING)
  message(STATUS "Enabling json logging")
-  add_dependency_defines(-DENABLE_JSON_LOGGING)
+  add_definitions(-DENABLE_JSON_LOGGING)
 endif()

-add_definitions(${OSRM_DEFINES})
-include_directories(SYSTEM ${OSRM_INCLUDE_PATHS})
-
 # Binaries
 target_link_libraries(osrm-datastore osrm_store ${Boost_LIBRARIES})
 target_link_libraries(osrm-extract osrm_extract ${Boost_LIBRARIES})
@@ -332,8 +307,7 @@ set(EXTRACTOR_LIBRARIES
    ${OSMIUM_LIBRARIES}
    ${STXXL_LIBRARY}
    ${TBB_LIBRARIES}
-    ${ZLIB_LIBRARY}
-    ${MAYBE_COVERAGE_LIBRARIES})
+    ${ZLIB_LIBRARY})
 set(CONTRACTOR_LIBRARIES
    ${Boost_LIBRARIES}
    ${CMAKE_THREAD_LIBS_INIT}
@@ -341,32 +315,35 @@ set(CONTRACTOR_LIBRARIES
    ${USED_LUA_LIBRARIES}
    ${STXXL_LIBRARY}
    ${TBB_LIBRARIES}
-    ${MAYBE_RT_LIBRARY}
-    ${MAYBE_COVERAGE_LIBRARIES})
+    ${MAYBE_RT_LIBRARY})
 set(ENGINE_LIBRARIES
-    ${BOOST_ENGINE_LIBRARIES}
-    ${CMAKE_THREAD_LIBS_INIT}
-    ${TBB_LIBRARIES}
-    ${MAYBE_RT_LIBRARY}
-    ${MAYBE_COVERAGE_LIBRARIES}
-    ${ZLIB_LIBRARY})
-set(STORAGE_LIBRARIES
-    ${Boost_LIBRARIES}
-    ${CMAKE_THREAD_LIBS_INIT}
-    ${TBB_LIBRARIES}
-    ${MAYBE_RT_LIBRARY}
-    ${MAYBE_COVERAGE_LIBRARIES})
-set(UTIL_LIBRARIES
    ${Boost_LIBRARIES}
    ${CMAKE_THREAD_LIBS_INIT}
    ${STXXL_LIBRARY}
    ${TBB_LIBRARIES}
-    ${MAYBE_COVERAGE_LIBRARIES})
+    ${MAYBE_RT_LIBRARY})
+set(STORAGE_LIBRARIES
+    ${Boost_LIBRARIES}
+    ${CMAKE_THREAD_LIBS_INIT}
+    ${TBB_LIBRARIES}
+    ${MAYBE_RT_LIBRARY})
+set(UTIL_LIBRARIES
+    ${Boost_LIBRARIES}
+    ${CMAKE_THREAD_LIBS_INIT}
+    ${STXXL_LIBRARY}
+    ${TBB_LIBRARIES})
 # Libraries
 target_link_libraries(osrm ${ENGINE_LIBRARIES})
 target_link_libraries(osrm_contract ${CONTRACTOR_LIBRARIES})
 target_link_libraries(osrm_extract ${EXTRACTOR_LIBRARIES})
 target_link_libraries(osrm_store ${STORAGE_LIBRARIES})
+# Tests
+target_link_libraries(engine-tests ${ENGINE_LIBRARIES})
+target_link_libraries(server-tests osrm ${Boost_LIBRARIES})
+target_link_libraries(extractor-tests ${EXTRACTOR_LIBRARIES})
+target_link_libraries(rtree-bench ${Boost_LIBRARIES} ${CMAKE_THREAD_LIBS_INIT} ${TBB_LIBRARIES})
+target_link_libraries(util-tests ${UTIL_LIBRARIES})
+target_link_libraries(library-tests osrm ${Boost_LIBRARIES})

 if(BUILD_COMPONENTS)
  find_package(GDAL)
@@ -445,23 +422,14 @@ foreach(lib ${ENGINE_LIBRARIES})
  set(ENGINE_LIBRARY_LISTING "${ENGINE_LIBRARY_LISTING} -L${ENGINE_LIBRARY_PATH} -l${ENGINE_LIBRARY_NAME}")
 endforeach()

+configure_file(${CMAKE_CURRENT_SOURCE_DIR}/cmake/pkgconfig.in libosrm.pc @ONLY)
+install(FILES ${PROJECT_BINARY_DIR}/libosrm.pc DESTINATION lib/pkgconfig)
+
 if(BUILD_DEBIAN_PACKAGE)
  include(CPackDebianConfig)
  include(CPack)
 endif()

-function(JOIN VALUES GLUE OUTPUT)
-  string (REPLACE ";" "${GLUE}" _TMP_STR "${VALUES}")
-  set (${OUTPUT} "${_TMP_STR}" PARENT_SCOPE)
-endfunction()
-
-# Set up variables, then write to pkgconfig file
-JOIN("${OSRM_DEFINES}" " " OSRM_DEFINES_STRING)
-JOIN("-I${OSRM_INCLUDE_PATHS}" " -I" OSRM_INCLUDE_PATHS_STRING)
-
-configure_file(${CMAKE_CURRENT_SOURCE_DIR}/cmake/pkgconfig.in libosrm.pc @ONLY)
-install(FILES ${PROJECT_BINARY_DIR}/libosrm.pc DESTINATION lib/pkgconfig)
-
 # add a target to generate API documentation with Doxygen
 find_package(Doxygen)
 if(DOXYGEN_FOUND)
@@ -492,8 +460,3 @@ configure_file(

 add_custom_target(uninstall
    COMMAND ${CMAKE_COMMAND} -P ${CMAKE_CURRENT_BINARY_DIR}/cmake/cmake_uninstall.cmake)
-
-
-# Modular build system: each directory registered here provides its own CMakeLists.txt
-add_subdirectory(unit_tests)
-add_subdirectory(src/benchmarks)
@@ -4,11 +4,12 @@ The Open Source Routing Machine is a high performance routing engine written in

 ## Current build status

-| build config | status |
-|:-------------|:-------|
-| Linux        | [![Build Status](https://travis-ci.org/Project-OSRM/osrm-backend.png?branch=master)](https://travis-ci.org/Project-OSRM/osrm-backend) |
-| Windows      | [![Build status](https://ci.appveyor.com/api/projects/status/4iuo3s9gxprmcjjh)](https://ci.appveyor.com/project/DennisOSRM/osrm-backend) |
-| Coverage     | [![codecov](https://codecov.io/gh/Project-OSRM/osrm-backend/branch/master/graph/badge.svg)](https://codecov.io/gh/Project-OSRM/osrm-backend) |
+| build config |  branch | status |
+|:-------------|:--------|:------------|
+| Linux        | master  | [![Build Status](https://travis-ci.org/Project-OSRM/osrm-backend.png?branch=master)](https://travis-ci.org/Project-OSRM/osrm-backend) |
+| Linux        | develop | [![Build Status](https://travis-ci.org/Project-OSRM/osrm-backend.png?branch=develop)](https://travis-ci.org/Project-OSRM/osrm-backend) |
+| Windows      | master/develop | [![Build status](https://ci.appveyor.com/api/projects/status/4iuo3s9gxprmcjjh)](https://ci.appveyor.com/project/DennisOSRM/osrm-backend) |
+| LUAbind fork | master  | [![Build Status](https://travis-ci.org/DennisOSRM/luabind.png?branch=master)](https://travis-ci.org/DennisOSRM/luabind) |

 ## Building

@@ -18,46 +19,7 @@ To quickly try OSRM use our [free and daily updated online service](http://map.p

 ## Documentation

-### Full documentation
-
- [osrm-routed HTTP API documentation](docs/http.md)
- [libosrm API documentation](docs/libosrm.md)
-
-### Quick start
-
-Building OSRM assuming all dependencies are installed:
-
-```
-mkdir -p build
-cd build
-cmake .. -DCMAKE_BUILD_TYPE=Release
-cmake --build .
-sudo cmake --build . --target install
-```
-
-Loading preparing a dataset and starting the server:
-
-```
-osrm-extract data.osm.pbf -p profiles/car.lua
-osrm-contract data.osrm
-osrm-routed data.osrm
-```
-
-Running a query on your local server:
-
-```
-curl http://127.0.0.1:5000/13.388860,52.517037;13.385983,52.496891?steps=true&alternatives=true
-```
-
-### Running a request against the Demo Server
-
-First read the [API usage policy](https://github.com/Project-OSRM/osrm-backend/wiki/Api-usage-policy).
-
-Then run simple query with instructions and alternatives on Berlin:
-
-```
-curl https://router.project-osrm.org/13.388860,52.517037;13.385983,52.496891?steps=true&alternatives=true
-```
+See the Wiki's [server API documentation](https://github.com/Project-OSRM/osrm-backend/wiki/Server-api) as well as the [library API documentation](https://github.com/Project-OSRM/osrm-backend/wiki/Library-api)

 ## References in publications

@@ -116,20 +116,17 @@ IF %ERRORLEVEL% NEQ 0 GOTO ERROR

 SET PATH=%PROJECT_DIR%\osrm-deps\libs\bin;%PATH%

-ECHO running extractor-tests.exe ...
-unit_tests\%Configuration%\extractor-tests.exe
-IF %ERRORLEVEL% NEQ 0 GOTO ERROR
 ECHO running engine-tests.exe ...
-unit_tests\%Configuration%\engine-tests.exe
+%Configuration%\engine-tests.exe
+IF %ERRORLEVEL% NEQ 0 GOTO ERROR
+ECHO running extractor-tests.exe ...
+%Configuration%\extractor-tests.exe
 IF %ERRORLEVEL% NEQ 0 GOTO ERROR
 ECHO running util-tests.exe ...
-unit_tests\%Configuration%\util-tests.exe
-IF %ERRORLEVEL% NEQ 0 GOTO ERROR
-ECHO running server-tests.exe ...
-unit_tests\%Configuration%\server-tests.exe
+%Configuration%\util-tests.exe
 IF %ERRORLEVEL% NEQ 0 GOTO ERROR

-IF NOT "%APPVEYOR_REPO_BRANCH%"=="master" GOTO DONE
+IF NOT "%APPVEYOR_REPO_BRANCH%"=="develop" GOTO DONE
 ECHO ========= CREATING PACKAGES ==========

 CD %PROJECT_DIR%\build\%Configuration%
@@ -28,6 +28,7 @@ artifacts:
 branches:
  only:
    - master
+    - develop

 deploy:
  provider: FTP
@@ -280,5 +280,4 @@ if (TBB_FOUND)
 	FILE(READ "${TBB_INCLUDE_DIRS}/tbb/tbb_stddef.h" _TBB_VERSION_CONTENTS)
 	STRING(REGEX REPLACE ".*#define TBB_INTERFACE_VERSION ([0-9]+).*" "\\1" TBB_INTERFACE_VERSION "${_TBB_VERSION_CONTENTS}")
 	set(TBB_INTERFACE_VERSION "${TBB_INTERFACE_VERSION}")
-        message(STATUS "TBB interface version: ${TBB_INTERFACE_VERSION}")
 endif (TBB_FOUND)
@@ -1,5 +1,5 @@
 prefix=@CMAKE_INSTALL_PREFIX@
-includedir=${prefix}/include
+includedir=${prefix}/include ${prefix}/include/osrm
 libdir=${prefix}/lib

 Name: libOSRM
@@ -8,4 +8,4 @@ Version: v@OSRM_VERSION_MAJOR@.@OSRM_VERSION_MINOR@.@OSRM_VERSION_PATCH@
 Requires:
 Libs: -L${libdir} -losrm
 Libs.private: @ENGINE_LIBRARY_LISTING@
-Cflags: -I${includedir} -I${includedir}/osrm @OSRM_INCLUDE_PATHS_STRING@ @OSRM_DEFINES_STRING@ @CMAKE_CXX_FLAGS@
+Cflags: -I${includedir}
@@ -1,7 +0,0 @@
-coverage:
-
-  ignore:
-    - unit_tests/.*
-    - third_party/.*
-
-comment: off
@@ -1,6 +1,6 @@
 module.exports = {
-    default: '--require features --tags ~@stress --tags ~@todo',
-    verify: '--require features --tags ~@todo --tags ~@bug --tags ~@stress -f progress',
+    default: '--require features --tags ~@todo --tags ~@bug --tags ~@stress --tags ~@guidance',
+    verify: '--require features --tags ~@todo --tags ~@bug --tags ~@stress -f progress --tags ~@guidance',
    jenkins: '--require features --tags ~@todo --tags ~@bug --tags ~@stress --tags ~@options -f progress',
    bugs: '--require features --tags @bug',
    todo: '--require features --tags @todo',
@@ -5,23 +5,15 @@ RUN apt-get install -y build-essential git-core python-pip python-software-prope

 RUN apt-get -y install gcc-4.8 g++-4.8 libboost1.55-all-dev llvm-3.4
 RUN apt-get -y install libbz2-dev libstxxl-dev libstxxl1 libxml2-dev
-RUN apt-get -y install libzip-dev lua5.1 liblua5.1-0-dev libtbb-dev libgdal-dev
+RUN apt-get -y install libzip-dev lua5.1 liblua5.1-0-dev libtbb-dev libgdal-dev ruby1.9
 RUN apt-get -y install curl cmake cmake-curses-gui

 RUN pip install awscli

-
 # luabind
 RUN curl https://gist.githubusercontent.com/DennisOSRM/f2eb7b948e6fe1ae319e/raw/install-luabind.sh | sudo bash

-WORKDIR /opt
-RUN git clone --depth 1 --branch v0.31.0 https://github.com/creationix/nvm.git
-RUN /bin/bash -c "source /opt/nvm/nvm.sh && nvm install v4"
-
 RUN useradd -ms /bin/bash mapbox
 USER mapbox
 ENV HOME /home/mapbox
 WORKDIR /home/mapbox
-
-RUN echo "source /opt/nvm/nvm.sh" > .bashrc
-RUN echo "source /home/mapbox/.bashrc" > .profile
@@ -8,4 +8,4 @@ docker run \
    -e "CXX=clang++" \
    -v `pwd`:/home/mapbox/osrm-backend \
    -t mapbox/osrm:linux \
-    /bin/bash -lc "osrm-backend/docker/test.sh"
+    osrm-backend/docker/test.sh
@@ -8,4 +8,4 @@ docker run \
    -e "CXX=g++" \
    -v `pwd`:/home/mapbox/osrm-backend \
    -t mapbox/osrm:linux \
-    /bin/bash -lc "osrm-backend/docker/test.sh"
+    osrm-backend/docker/test.sh
@@ -4,8 +4,11 @@ set -e
 set -o pipefail

 export CMAKEOPTIONS="-DCMAKE_BUILD_TYPE=Release"
+export PATH=$PATH:/home/mapbox/.gem/ruby/1.9.1/bin:/home/mapbox/osrm-backend/vendor/bundle/ruby/1.9.1/bin

 cd /home/mapbox/osrm-backend
+gem install --user-install bundler
+bundle install --path vendor/bundle
 [ -d build ] && rm -rf build
 mkdir -p build
 cd build
@@ -13,9 +16,7 @@ cmake .. $CMAKEOPTIONS -DBUILD_TOOLS=1

 make -j`nproc`
 make tests -j`nproc`
-#./unit_tests/server-tests
-#./unit_tests/library-tests
-#./unit_tests/extractor-tests
-#./unit_tests/util-tests
+./datastructure-tests
+./algorithm-tests
 cd ..
-npm test
+bundle exec cucumber -p verify
@@ -1,595 +0,0 @@
-## Environent Variables
-
-### SIGNAL_PARENT_WHEN_READY
-
-If the SIGNAL_PARENT_WHEN_READY environment variable is set osrm-routed will
-send the USR1 signal to its parent when it will be running and waiting for
-requests. This could be used to upgrade osrm-routed to a new binary on the fly
-without any service downtime - no incoming requests will be lost.
-
-### DISABLE_ACCESS_LOGGING
-
-If the DISABLE_ACCESS_LOGGING environment variable is set osrm-routed will
-**not** log any http requests to standard output. This can be useful in high
-traffic setup.
-
-## HTTP API
-
-`osrm-routed` supports only `GET` requests of the form. If you your response size
-exceeds the limits of a simple URL encoding, consider using our [NodeJS bindings](https://github.com/Project-OSRM/node-osrm)
-or using the [C++ library directly](libosrm.md).
-
-### Request
-
-```
-http://{server}/{service}/{version}/{profile}/{coordinates}[.{format}]?option=value&option=value
-```
-
- `server`: location of the server. Example: `127.0.0.1:5000` (default)
- `service`: Name of the service to be used. Support are the following services:
-  
-    | Service     |           Description                                     |
-    |-------------|-----------------------------------------------------------|
-    | [`route`](#service-route)     | shortest path between given coordinates                   |
-    | [`nearest`](#service-nearest)   | returns the nearest street segment for a given coordinate |
-    | [`table`](#service-table)     | computes distance tables for given coordinates            |
-    | [`match`](#service-match)     | matches given coordinates to the road network             |
-    | [`trip`](#service-trip)      | Compute the shortest round trip between given coordinates |
-    | [`tile`](#service-tile)      | Return vector tiles containing debugging info             |
-  
- `version`: Version of the protocol implemented by the service.
- `profile`: Mode of transportation, is determined by the profile that is used to prepare the data
- `coordinates`: String of format `{longitude},{latitude};{longitude},{latitude}[;{longitude},{latitude} ...]` or `polyline({polyline})`.
- `format`: Only `json` is supportest at the moment. This parameter is optional and defaults to `json`.
-
-Passing any `option=value` is optional. `polyline` follows Google's polyline format with precision 5 and can be generated using [this package](https://www.npmjs.com/package/polyline).
-To pass parameters to each location some options support an array like encoding:
-
-```
-{option}={element};{element}[;{element} ... ]
-```
-
-The number of elements must match exactly the number of locations. If you don't want to pass a value but instead use the default you can pass an empty `element`.
-
-Example: 2nd location use the default value for `option`:
-
-```
-{option}={element};;{element}
-```
-
-## General options
-
-| Option     | Values                                                 | Description                                      |
-|------------|--------------------------------------------------------|--------------------------------------------------|
-|bearings    |`{bearing};{bearing}[;{bearing} ...]`                   |Limits the search to segments with given bearing in degrees towards true north in clockwise direction. |
-|radiuses    |`{radius};{radius}[;{radius} ...]`                      |Limits the search to given radius in meters.      |
-|hints       |`{hint};{hint}[;{hint} ...]`                            |Hint to derive position in street network.        |
-
-Where the elements follow the following format:
-
-| Element    | Values                                                 |
-|------------|--------------------------------------------------------|
-|bearing     |`{value},{range}` `integer 0 .. 360,integer 0 .. 180`  |
-|radius      |`double >= 0` or `unlimited` (default)                  |
-|hint        |Base64 `string`                                         |
-
-#### Examples
-
-Query on Berlin with three coordinates:
-
-```
-http://router.project-osrm.org/route/v1/driving/13.388860,52.517037;13.397634,52.529407;13.428555,52.523219?overview=false
-```
-
-Using polyline:
-
-```
-http://router.project-osrm.org/route/v1/driving/polyline(ofp_Ik_vpAilAyu@te@g`E)?overview=false
-```
-
-### Response
-
-Every response object has a `code` field.
-
-```json
-{
-"code": {code},
-"message": {message}
-}
-```
-
-Where `code` is on one of the strings below or service dependent:
-
-| Type              | Description                                                                      |
-|-------------------|----------------------------------------------------------------------------------|
-| `Ok`              | Request could be processed as expected.                                          |
-| `InvalidUrl`      | URL string is invalid.                                                           |
-| `InvalidService`  | Service name is invalid.                                                         |
-| `InvalidVersion`  | Version is not found.                                                            |
-| `InvalidOptions`  | Options are invalid.                                                             |
-| `NoSegment`       | One of the supplied input coordinates could not snap to street segment.          |
-| `TooBig`          | The request size violates one of the service specific request size restrictions. |
-
-`message` is a **optional** human-readable error message. All other status types are service dependent.
-
-In case of an error the HTTP status code will be `400`. Otherwise the HTTP status code will be `200` and `code` will be `Ok`.
-
-## Service `nearest`
-
-Snaps a coordinate to the street network and returns the nearest n matches.
-
-### Request
-
-```
-http://{server}/nearest/v1/{profile}/{coordinates}.json?number={number}
-```
-
-Where `coordinates` only supports a single `{longitude},{latitude}` entry.
-
-In addition to the [general options](#general-options) the following options are supported for this service:
-
-|Option      |Values                        |Description                                         |
-|------------|------------------------------|----------------------------------------------------|
-|number      |`integer >= 1` (default `1`)  |Number of nearest segments that should be returned. |
-
-### Response
-
- `code` if the request was successful `Ok` otherwise see the service dependent and general status codes.
- `waypoints` array of `Waypoint` objects sorted by distance to the input coordinate. Each object has at least the following additional properties:
-  - `distance`: Distance in meters to the supplied input coordinate.
-
-### Examples
-
-Querying nearest three snapped locations of `13.388860,52.517037` with a bearing between `20° - 340°`.
-
-```
-http://router.project-osrm.org/nearest/v1/driving/13.388860,52.517037?number=3&bearings=0,20
-```
-
-## Service `route`
-
-### Request
-
-```
-http://{server}/route/v1/{profile}/{coordinates}?alternatives={true|false}&steps={true|false}&geometries={polyline|geojson}&overview={full|simplified|false}&annotations={true|false}
-```
-
-In addition to the [general options](#general-options) the following options are supported for this service:
-
-|Option      |Values                                    |Description                                                                    |
-|------------|------------------------------------------|-------------------------------------------------------------------------------|
-|alternatives|`true`, `false` (default)                 |Search for alternative routes and return as well.\*                            |
-|steps       |`true`, `false` (default)                 |Return route steps for each route leg                                          |
-|annotations |`true`, `false` (default)                 |Returns additional metadata for each coordinate along the route geometry.      |
-|geometries  |`polyline` (default), `geojson`           |Returned route geometry format (influences overview and per step)             |
-|overview    |`simplified` (default), `full`, `false`   |Add overview geometry either full, simplified according to highest zoom level it could be display on, or not at all.|
-|continue_straight |`default` (default), `true`, `false`|Forces the route to keep going straight at waypoints and don't do a uturn even if it would be faster. Default value depends on the profile. |
-
-\* Please note that even if an alternative route is requested, a result cannot be guaranteed.
-
-### Response
-
- `code` if the request was successful `Ok` otherwise see the service dependent and general status codes.
- `waypoints`: Array of `Waypoint` objects representing all waypoints in order:
- `routes`: An array of `Route` objects, ordered by descending recommendation rank.
-
-In case of error the following `code`s are supported in addition to the general ones:
-
-| Type              | Description     |
-|-------------------|-----------------|
-| `NoRoute`        | No route found. |
-
-All other fields might be undefined.
-
-## Service `table`
-### Request
-```
-http://{server}/table/v1/{profile}/{coordinates}?{sources}=[{elem}...];&destinations=[{elem}...]`
-```
-
-This computes duration tables for the given locations. Allows for both symmetric and asymmetric tables.
-
-### Coordinates
-
-In addition to the [general options](#general-options) the following options are supported for this service:
-
-|Option      |Values                                            |Description                                  |
-|------------|--------------------------------------------------|---------------------------------------------|
-|sources     |`{index};{index}[;{index} ...]` or `all` (default)|Use location with given index as source.     |
-|destinations|`{index};{index}[;{index} ...]` or `all` (default)|Use location with given index as destination.|
-
-Unlike other array encoded options, the length of `sources` and `destinations` can be **smaller or equal**
-to number of input locations;
-
-Example:
-
-```
-sources=0;5;7&destinations=5;1;4;2;3;6
-```
-
-|Element     |Values                       |
-|------------|-----------------------------|
-|index       |`0 <= integer < #locations`  |
-
-### Response
-
- `code` if the request was successful `Ok` otherwise see the service dependent and general status codes.
- `durations` array of arrays that stores the matrix in row-major order. `durations[i][j]` gives the travel time from
-  the i-th waypoint to the j-th waypoint. Values are given in seconds.
- `sources` array of `Waypoint` objects describing all sources in order
- `destinations` array of `Waypoint` objects describing all destinations in order
-
-In case of error the following `code`s are supported in addition to the general ones:
-
-| Type              | Description     |
-|-------------------|-----------------|
-| `NoTable`        | No route found. |
-
-All other fields might be undefined.
-
-#### Examples
-
-Returns a `3x3` matrix:
-```
-http://router.project-osrm.org/table/v1/driving/13.388860,52.517037;13.397634,52.529407;13.428555,52.523219
-```
-
-Returns a `1x3` matrix:
-```
-http://router.project-osrm.org/table/v1/driving/13.388860,52.517037;13.397634,52.529407;13.428555,52.523219?sources=0
-```
-
-Returns a asymmetric 3x2 matrix with from the polyline encoded locations `qikdcB}~dpXkkHz`:
-```
-http://router.project-osrm.org/table/v1/driving/qikdcB}~dpXkkHz?sources=0;1;3&destinations=2;4
-```
-
-## Service `match`
-
-Map matching matches given GPS points to the road network in the most plausible way.
-Please note the request might result multiple sub-traces. Large jumps in the timestamps (>60s) or improbable transitions lead to trace splits if a complete matching could not be found.
-The algorithm might not be able to match all points. Outliers are removed if they can not be matched successfully.
-
-### Request
-
-```
-http://{server}/match/v1/{profile}/{coordinates}?steps={true|false}&geometries={polyline|geojson}&overview={simplified|full|false}&annotations={true|false}
-```
-
-In addition to the [general options](#general-options) the following options are supported for this service:
-
-
-|Option      |Values                                          |Description                                                                               |
-|------------|------------------------------------------------|------------------------------------------------------------------------------------------|
-|steps       |`true`, `false` (default)                       |Return route steps for each route                                                         |
-|geometries  |`polyline` (default), `geojson`                 |Returned route geometry format (influences overview and per step)                        |
-|annotations |`true`, `false` (default)                       |Returns additional metadata for each coordinate along the route geometry.                |
-|overview    |`simplified` (default), `full`, `false`         |Add overview geometry either full, simplified according to highest zoom level it could be display on, or not at all.|
-|timestamps  |`{timestamp};{timestamp}[;{timestamp} ...]`     |Timestamp of the input location.                                                          |
-|radiuses    |`{radius};{radius}[;{radius} ...]`              |Standard deviation of GPS precision used for map matching. If applicable use GPS accuracy.|
-
-|Parameter   |Values                        |
-|------------|------------------------------|
-|timestamp   |`integer` UNIX-like timestamp |
-|radius      |`double >= 0` (default 5m)    |
-
-### Response
- `code` if the request was successful `Ok` otherwise see the service dependent and general status codes.
- `tracepoints`: Array of `Ẁaypoint` objects representing all points of the trace in order.
-  If the trace point was ommited by map matching because it is an outlier, the entry will be `null`.
-  Each `Waypoint` object has the following additional properties:
-  - `matchings_index`: Index to the `Route` object in `matchings` the sub-trace was matched to.
-  - `waypoint_index`: Index of the waypoint inside the matched route.
- `matchings`: An array of `Route` objects that assemble the trace. Each `Route` object has the following additional properties:
-  - `confidence`: Confidence of the matching. `float` value between 0 and 1. 1 is very confident that the matching is correct.
-
-In case of error the following `code`s are supported in addition to the general ones:
-
-| Type              | Description         |
-|-------------------|---------------------|
-| `NoMatch`         | No matchings found. |
-
-All other fields might be undefined.
-
-## Service `trip`
-
-The trip plugin solves the Traveling Salesman Problem using a greedy heuristic (farthest-insertion algorithm).
-The returned path does not have to be the shortest path, as TSP is NP-hard it is only an approximation.
-Note that if the input coordinates can not be joined by a single trip (e.g. the coordinates are on several disconnected islands)
-multiple trips for each connected component are returned.
-
-### Request
-
-```
-http://{server}/trip/v1/{profile}/{coordinates}?steps={true|false}&geometries={polyline|geojson}&overview={simplified|full|false}&annotations={true|false}
-```
-
-In addition to the [general options](#general-options) the following options are supported for this service:
-
-|Option      |Values                                          |Description                                                                |
-|------------|------------------------------------------------|---------------------------------------------------------------------------|
-|steps       |`true`, `false` (default)                       |Return route instructions for each trip                                    |
-|annotations |`true`, `false` (default)                       |Returns additional metadata for each coordinate along the route geometry.      |
-|geometries  |`polyline` (default), `geojson`                 |Returned route geometry format (influences overview and per step)         |
-|overview    |`simplified` (default), `full`, `false`         |Add overview geometry either full, simplified according to highest zoom level it could be display on, or not at all.|
-
-### Response
-
- `code` if the request was successful `Ok` otherwise see the service dependent and general status codes.
- `waypoints`: Array of `Waypoint` objects representing all waypoints in input order. Each `Waypoint` object has the following additional properties:
-  - `trips_index`: Index to `trips` of the sub-trip the point was matched to.
-  - `waypoint_index`: Index of the point in the trip.
- `trips`: An array of `Route` objects that assemble the trace.
-
-In case of error the following `code`s are supported in addition to the general ones:
-
-| Type              | Description         |
-|-------------------|---------------------|
-| `NoTrips`        | No trips found.     |
-
-All other fields might be undefined.
-
-## Result objects
-
-### Route
-
-Represents a route through (potentially multiple) waypoints.
-
-#### Properties
-
- `distance`: The distance traveled by the route, in `float` meters.
- `duration`: The estimated travel time, in `float` number of seconds.
- `geometry`: The whole geometry of the route value depending on `overview` parameter, format depending on the `geometries` parameter. See `RouteStep`'s `geometry` field for a parameter documentation.
-  
-  | overview   | Description                 |
-  |------------|-----------------------------|
-  | simplified | Geometry is simplified according to the highest zoom level it can still be displayed on full. |
-  | full       | Geometry is not simplified. |
-  | false      | Geometry is not added.      |
-  
- `legs`: The legs between the given waypoints, an array of `RouteLeg` objects.
-
-#### Example
-
-Three input coordinates, `geometry=geojson`, `steps=false`:
-
-```json
-{
-  "distance": 90.0,
-  "duration": 300.0,
-  "geometry": {"type": "LineString", "coordinates": [[120., 10.], [120.1, 10.], [120.2, 10.], [120.3, 10.]]},
-  "legs": [
-    {
-      "distance": 30.0,
-      "duration": 100.0,
-      "steps": []
-    },
-    {
-      "distance": 60.0,
-      "duration": 200.0,
-      "steps": []
-    }
-  ]
-}
-```
-
-### RouteLeg
-
-Represents a route between two waypoints.
-
-#### Properties
-
- `distance`: The distance traveled by this route leg, in `float` meters.
- `duration`: The estimated travel time, in `float` number of seconds.
- `summary`: Summary of the route taken as `string`. Depends on the `steps` parameter:
-   
-   | steps        |                                                                       |
-   |--------------|-----------------------------------------------------------------------|
-   | true         | Names of the two major roads used. Can be empty if route is too short.|
-   | false        | empty `string`                                                        |
-
- `steps`: Depends on the `steps` parameter.
-   
-   | steps        |                                                                       |
-   |--------------|-----------------------------------------------------------------------|
-   | true         | array of `RouteStep` objects describing the turn-by-turn instructions |
-   | false        | empty array                                                           |
-
- `annotation`: Additional details about each coordinate along the route geometry:
-
-   | annotations  |                                                                       |
-   |--------------|-----------------------------------------------------------------------|
-   | true         | returns distance and durations of each coordinate along the route     |
-   | false        | will not exist                                                        |
-
-#### Example
-
-With `steps=false` and `annotations=true`:
-
-```json
-{
-  "distance": 30.0,
-  "duration": 100.0,
-  "steps": []
-  "annotation": {
-    "distance": [5,5,10,5,5],
-    "duration": [15,15,40,15,15],
-    "nodes": [49772551,49772552,49786799,49786800,49786801,49786802]
-  }
-}
-```
-
-### RouteStep
-
-A step consists of a maneuver such as a turn or merge, followed
-by a distance of travel along a single way to the subsequent
-step.
-
-#### Properties
-
- `distance`: The distance of travel from the maneuver to the subsequent step, in `float` meters.
- `duration`: The estimated travel time, in `float` number of seconds.
- `geometry`: The unsimplified geometry of the route segment, depending on the `geometries` parameter.
-  
-  | geometries |                                                                    |
-  |------------|--------------------------------------------------------------------|
-  | polyline   | [polyline](https://www.npmjs.com/package/polyline) with precision 5 in [latitude,longitude] encoding |
-  | geojson    | [GeoJSON `LineString`](http://geojson.org/geojson-spec.html#linestring) or [GeoJSON `Point`](http://geojson.org/geojson-spec.html#point) if it is only one coordinate (not wrapped by a GeoJSON feature)|
-  
- `name`: The name of the way along which travel proceeds.
- `pronunciation`: The pronunciation hint of the way name. Will be `undefined` if there is no pronunciation hit.
- `destinations`: The destinations of the way. Will be `undefined` if there are no destinations.
- `mode`: A string signifying the mode of transportation.
- `maneuver`: A `StepManeuver` object representing the maneuver.
- `intersections`: A list of `Intersections` that are passed along the segment, the very first belonging to the StepManeuver
-
-#### Example
-
-```
-{
- "distance":152.3,
- "duration":15.6,
- "name":"Lortzingstraße",
- "maneuver":{
-     "type":"depart",
-     "modifier":"left"
- },
- "geometry":"{lu_IypwpAVrAvAdI",
- "mode":"driving",
- "intersections":[
-    {"location":[13.39677,52.54366],
-    "out":1,
-    "bearings":[66,246],
-    "entry":["true","true"]},
-    {"location":[13.394718,52.543096],
-    "in":0,
-    "out":2,
-    "bearings":[60,150,240,330],
-    "entry":["false","true","true","true"]
-    }
-]}
-```
-
-### StepManeuver
-
-#### Properties
-
- `location`: A `[longitude, latitude]` pair describing the location of the turn.
- `bearing_before`: The clockwise angle from true north to the
-  direction of travel immediately before the maneuver.
- `bearing_after`: The clockwise angle from true north to the
-  direction of travel immediately after the maneuver.
- `type` A string indicating the type of maneuver. **new identifiers might be introduced without API change**
-   Types  unknown to the client should be handled like the `turn` type, the existance of correct `modifier` values is guranteed.
-  
-  | `type`            | Description                                                  |
-  |-------------------|--------------------------------------------------------------|
-  | turn              | a basic turn into direction of the `modifier`                |
-  | new name          | no turn is taken/possible, but the road name changes. The road can take a turn itself, following `modifier`.                  |
-  | depart            | indicates the departure of the leg                           |
-  | arrive            | indicates the destination of the leg                         |
-  | merge             | merge onto a street (e.g. getting on the highway from a ramp, the `modifier specifies the direction of the merge`) |
-  | ramp              | **Deprecated**. Replaced by `on_ramp` and `off_ramp`.        |
-  | on ramp           | take a ramp to enter a highway (direction given my `modifier`) |
-  | off ramp          | take a ramp to exit a highway (direction given my `modifier`)  |
-  | fork              | take the left/right side at a fork depending on `modifier`   |
-  | end of road       | road ends in a T intersection turn in direction of `modifier`|
-  | continue          | Turn in direction of `modifier` to stay on the same road     |
-  | roundabout        | traverse roundabout, has additional field `exit` with NR if the roundabout is left. `the modifier specifies the direction of entering the roundabout` |
-  | rotary            | a larger version of a roundabout, can offer `rotary_name` in addition to the `exit` parameter.  |
-  | roundabout turn   | Describes a turn at a small roundabout that should be treated as normal turn. The `modifier` indicates the turn direciton. Example instruction: `At the roundabout turn left`. |
-  | notification      | not an actual turn but a change in the driving conditions. For example the travel mode.  If the road takes a turn itself, the `modifier` describes the direction |
-
-  Please note that even though there are `new name` and `notification` instructions, the `mode` and `name` can change
-  between all instructions. They only offer a fallback in case nothing else is to report.
-
-
- `modifier` An optional `string` indicating the direction change of the maneuver.
-
-  | `modifier`        | Description                               |
-  |-------------------|-------------------------------------------|
-  | uturn             | indicates  reversal of direction          |
-  | sharp right       | a sharp right turn                        |
-  | right             | a normal turn to the right                |
-  | slight right      | a slight turn to the right                |
-  | straight          | no relevant change in direction           |
-  | slight left       | a slight turn to the left                 |
-  | left              | a normal turn to the left                 |
-  | sharp left        | a sharp turn to the left                  |
-
- The list of turns without a modifier is limited to: `depart/arrive`. If the source/target location is close enough to the `depart/arrive` location, no modifier will be given.
-  
-  The meaning depends on the `type` field.
-    
-  | `type`                 | Description                                                                                                               |
-  |------------------------|---------------------------------------------------------------------------------------------------------------------------|
-  | `turn`                 | `modifier` indicates the change in direction accomplished through the turn                                                |
-  | `depart`/`arrive`      | `modifier` indicates the position of departure point and arrival point in relation to the current direction of travel      |
- 
-
- `exit` An optional `integer` indicating number of the exit to take. The field exists for the following `type` field:
-  
-  | `type`                 | Description                                                                                                               |
-  |------------------------|---------------------------------------------------------------------------------------------------------------------------|
-  | `roundabout`           | Number of the roundabout exit to take. If exit is `undefined` the destination is on the roundabout.                       |
-  | else                   | Indicates the number of intersections passed until the turn. Example instruction: `at the fourth intersection, turn left` |
-  
-
-New properties (potentially depending on `type`) may be introduced in the future without an API version change.
-
-### Intersections
-
-An intersection gives a full representation of any cross-way the path passes bay. For every step, the very first intersection (`intersections[0]`) corresponds to the
-location of the StepManeuver. Further intersections are listed for every cross-way until the next turn instruction.
-
-#### Properties
-
- `location`: A `[longitude, latitude]` pair describing the location of the turn.
- `bearings`: A list of bearing values (e.g. [0,90,180,270]) that are available at the intersection. The bearings describe all available roads at the intersection.
- `entry`: A list of entry flags, corresponding in a 1:1 relationship to the bearings. A value of `true` indicates that the respective road could be entered on a valid route.
-  `false` indicates that the turn onto the respective road would violate a restriction.
- `in`: index into bearings/entry array. Used to calculate the bearing just before the turn. Namely, the clockwise angle from true north to the
-  direction of travel immediately before the maneuver/passing the intersection. Bearings are given relative to the intersection. To get the bearing
-  in the direction of driving, the bearing has to be rotated by a value of 180. The value is not supplied for `depart` maneuvers.
- `out`: index into the bearings/entry array. Used to extract the bearing just after the turn. Namely, The clockwise angle from true north to the
-  direction of travel immediately after the maneuver/passing the intersection. The value is not supplied for `arrive` maneuvers.
-
-#### Example
-```
-{
-    "location":[13.394718,52.543096],
-    "in":0,
-    "out":2,
-    "bearings":[60,150,240,330],
-    "entry":["false","true","true","true"]
-}
-```
-
-### Waypoint
-
-Object used to describe waypoint on a route.
-
-#### Properties
-
- `name` Name of the street the coordinate snapped to
- `location` Array that contains the `[longitude, latitude]` pair of the snapped coordinate
- `hint` Unique internal identifier of the segment (ephemeral, not constant over data updates)
-   This can be used on subsequent request to significantly speed up the query and to connect multiple services.
-   E.g. you can use the `hint` value obtained by the `nearest` query as `hint` values for `route` inputs.
-
-## Service `tile`
-
-This generates [Mapbox Vector Tiles](https://www.mapbox.com/developers/vector-tiles/) that can be viewed with a vector-tile capable slippy-map viewer.  The tiles contain road geometries and metadata that can be used to examine the routing graph.  The tiles are generated directly from the data in-memory, so are in sync with actual routing results, and let you examine which roads are actually routable, and what weights they have applied.
-
-### Request
-```
-http://{server}/tile/v1/{profile}/tile({x},{y},{zoom}).mvt
-```
-
-The `x`, `y`, and `zoom` values are the same as described at https://wiki.openstreetmap.org/wiki/Slippy_map_tilenames, and are supported by vector tile viewers like [Mapbox GL JS](https://www.mapbox.com/mapbox-gl-js/api/).
-
-### Response
-
-The response object is either a binary encoded blob with a `Content-Type` of `application/x-protobuf`, or a `404` error.  Note that OSRM is hard-coded to only return tiles from zoom level 12 and higher (to avoid accidentally returning extremely large vector tiles).
-
-Vector tiles contain just a single layer named `speeds`.  Within that layer, features can have `speed` (int) and `is_small` (boolean) attributes.
@@ -1,26 +0,0 @@
-OSRM can be used as a library (libosrm) via C++ instead of using it through the HTTP interface and `osrm-routed`. This allows for fine-tuning OSRM and has much less overhead. Here is a quick introduction into how to use `libosrm` in the upcoming v5 release.
-
-Take a look at the example code that lives in the [example directory](https://github.com/Project-OSRM/osrm-backend/tree/master/example). Here is all you ever wanted to know about `libosrm`, that is a short description of what the types do and where to find documentation on it:
-
- [`EngineConfig`](https://github.com/Project-OSRM/osrm-backend/blob/master/include/engine/engine_config.hpp) - for initializing an OSRM instance we can configure certain properties and constraints. E.g. the storage config is the base path such as `france.osm.osrm` from which we derive and load `france.osm.osrm.*` auxiliary files. This also lets you set constraints such as the maximum number of locations allowed for specific services.
-
- [`OSRM`](https://github.com/Project-OSRM/osrm-backend/blob/master/include/osrm/osrm.hpp) - this is the main Routing Machine type with functions such as `Route` and `Table`. You initialize it with a `EngineConfig`. It does all the heavy lifting for you. Each function takes its own parameters, e.g. the `Route` function takes `RouteParameters`, and a out-reference to a JSON result that gets filled. The return value is a `Status`, indicating error or success.
-
- [`Status`](https://github.com/Project-OSRM/osrm-backend/blob/master/include/engine/status.hpp) - this is a type wrapping `Error` or `Ok` for indicating error or success, respectively.
-
- [`TableParameters`](https://github.com/Project-OSRM/osrm-backend/blob/master/include/engine/api/table_parameters.hpp) - this is an example of parameter types the Routing Machine functions expect. In this case `Table` expects its own parameters as `TableParameters`. You can see it wrapping two vectors, sources and destinations --- these are indices into your coordinates for the table service to construct a matrix from (empty sources or destinations means: use all of them). If you ask yourself where coordinates come from, you can see `TableParameters` inheriting from `BaseParameters`.
-
- [`BaseParameter`](https://github.com/Project-OSRM/osrm-backend/blob/master/include/engine/api/base_parameters.hpp) - this most importantly holds coordinates (and a few other optional properties that you don't need for basic usage); the specific parameter types inherit from `BaseParameters` to get these member attributes. That means your `TableParameters` type has `coordinates`, `sources` and `destination` member attributes (and a few other that we ignore for now).
-
- [`Coordinate`](https://github.com/Project-OSRM/osrm-backend/blob/master/include/util/coordinate.hpp) - this is a wrapper around a (longitude, latitude) pair. We really don't care about (lon,lat) vs (lat, lon) but we don't want you to accidentally mix them up, so both latitude and longitude are strictly typed wrappers around integers (fixed notation such as `13423240`) and floating points (floating notation such as `13.42324`).
-
- [Parameters for other services](https://github.com/Project-OSRM/osrm-backend/tree/master/include/engine/api) - here are all other `*Parameters` you need for other Routing Machine services.
-
- [JSON](https://github.com/Project-OSRM/osrm-backend/blob/master/include/util/json_container.hpp) - this is a sum type resembling JSON. The Routing Machine service functions take a out-ref to a JSON result and fill it accordingly. It is currently implemented using [mapbox/variant](https://github.com/mapbox/variant) which is similar to [Boost.Variant](http://www.boost.org/doc/libs/1_55_0/doc/html/variant.html) (Boost documentation is great). There are two ways to work with this sum type: either provide a visitor that acts on each type on visitation or use the `get` function in case you're sure about the structure. The JSON structure is written down in the [[v5 server API|Server-API-v5,-current]].
-
------------------------------------------------------------------------------------------------------------------
-
-To summarize:
- - create an `OSRM` instance initialized with a `EngineConfig`
- - call the service function on the `OSRM` object providing service specific `*Parameters`
- - check the return code and use the JSON result
@@ -1,34 +0,0 @@
-OSRM supports "profiles". Configurations representing different routing behaviours for (typically) different transport modes. A profile describes whether or not we route along a particular type of way, or over a particular node in the OpenStreetMap data, and also how quickly we'll be travelling when we do. This feeds into the way the routing graph is created and thus influences the output routes.
-
-## Available profiles
-
-Out-of-the-box OSRM comes with several different profiles, including car, bicycle and foot.
-
-Profile configuration files have a 'lua' extension, and are found under the 'profiles' subdirectory.
-Alternatively commands will take a lua profile specified with an explicit -p param, for example:
-
-`osrm-extract -p ../profiles/car.lua planet-latest.osm.pbf`
-
-And then **you will need to extract and contract again** (A change to the profile will typically affect the extract step as well as the contract step. See [Processing Flow](https://github.com/Project-OSRM/osrm-backend/wiki/Processing-Flow))
-
-## lua scripts?
-
-Profiles are not just configuration files. They are scripts written in the "lua" scripting language ( http://www.lua.org )  The reason for this, is that OpenStreetMap data is not sufficiently straightforward, to simply define tag mappings. Lua scripting offers a powerful way of coping with the complexity of different node,way,relation,tag combinations found within OpenStreetMap data.
-
-## Basic structure of a profile
-
-You can understand these lua scripts enough to make interesting modifications, without needing to get to grips with how they work completely.
-
-Towards the top of the file, a profile (such as [car.lua](../profiles/car.lua)) will typically define various configurations as global variables. A lot of these are look-up hashes of one sort or another.
-
-As you scroll down the file you'll see local variables, and then local functions, and finally...
-
-`way_function` and `node_function` are the important functions which are called when extracting OpenStreetMap data with `osrm-extract`.
-
-## way_function
-
-Given an OpenStreetMap way, the way_function will either return nothing (meaning we are not going to route over this way at all), or it will set up a result hash to be returned. The most important thing it will do is set the value of `result.forward_speed` and `result.backward_speed` as a suitable integer value representing the speed for traversing the way.
-
-All other calculations stem from that, including the returned timings in driving directions, but also, less directly, it feeds into the actual routing decisions the engine will take (a way with a slow traversal speed, may be less favoured than a way with fast traversal speed, but it depends how long it is, and... what it connects to in the rest of the network graph)
-
-Using the power of the scripting language you wouldn't typically see something as simple as a `result.forward_speed = 20` line within the way_function. Instead a way_function will examine the tagging (e.g. `way:get_value_by_key("highway")` and many others), process this information in various ways, calling other local functions, referencing the global variables and look-up hashes, before arriving at the result.
@@ -1,50 +0,0 @@
-# Releasing a new OSRM version
-
-Do decide if this is a major or minor version bump use: http://semver.org/
-
-What we guarantee on major version changes:
-
- Breaking changes will be in the changelog
- If we break an HTTP API we bump the version
-
-What we guarantee on minor version changes:
-
- HTTP API does not include breaking changes
- C++ library API does not include breaking changes
- node-osrm API does not include breaking changes
-
-What we DO NOT guarantee on minor version changes:
-
- file format comp ability. Breakage will be listed in the changelog.
- new turn types and fields may be introduced. How to handle this see [the HTTP API docs](http.md).
-
-What we guarantee on patch version changes:
-
- HTTP API does not include breaking changes
- C++ library API does not include breaking changes
- node-osrm API does not include breaking changes
- full file format compatibility
-
-## Major or Minor release x.y
-
-1. Make sure all tests are passing (e.g. Travis CI gives you a :thumbs_up:)
-2. Make sure `CHANGELOG.md` is up to date.
-3. Make sure the OSRM version in `CMakeLists.txt` is up to date
-4. Use an annotated tag to mark the release: `git tag vx.y.0 -a` Body of the tag description should be the changelog entries.
-5. Push tags and commits: `git push; git push --tags`
-6. Branch of the `vx.y.0` tag to create a release branch `x.y`:
-   `git branch x.y. vx.y.0; git push -u x.y:origin/x.y`
-7. Modify `.travis.yml` to allow builds for the `x.y` branch.
-8. Write a mailing-list post to osrm-talk@openstreetmap.org to announce the release
-
-## Patch release x.y.z
-
-1. Check out the appropriate release branch x.y
-2. Make sure all fixes are listed in the changelog and included in the branch
-3. Make sure all tests are passing (e.g. Travis CI gives you a :thumbs_up:)
-4. Make sure the OSRM version in `CMakeLists.txt` is up to date
-5. Use an annotated tag to mark the release: `git tag vx.y.z -a` Body of the tag description should be the changelog entries.
-6. Push tags and commits: `git push; git push --tags`
-7. Proceede with the `node-osrm` release as outlined in the repository.
-8. Write a mailing-list post to osrm-talk@openstreetmap.org to announce the release
-
@@ -1,239 +0,0 @@
-# Testsuite
-
-OSRM comes with a testsuite containing both unit-tests using the Boost library and cucucmber.js for scenario driven testing.
-
-## Unit Tests
-
-For a general introduction on Boost.Test have a look at [its docs](http://www.boost.org/doc/libs/1_60_0/libs/test/doc/html/index.html).
-
-### Separate Test Binaries
-
-Unit tests should be registered according to the sub-project they're in.
-If you want to write tests for utility functions, add them to the utility test binary.
-See `CMakeLists.txt` in the unit test directory for how to register new unit tests.
-
-### Using Boost.Test Primitives
-
-There is a difference between only reporting a failed condition and aborting the test right at a failed condition.
-Have a look at [`BOOST_CHECK` vs `BOOST_REQUIRE`](http://www.boost.org/doc/libs/1_60_0/libs/test/doc/html/boost_test/utf_reference/testing_tool_ref/assertion_boost_level.html).
-Instead of manually checking e.g. for equality, less than, if a function throws etc. use their [corresponding Boost.Test primitives](http://www.boost.org/doc/libs/1_60_0/libs/test/doc/html/boost_test/utf_reference/testing_tool_ref.html).
-
-If you use `BOOST_CHECK_EQUAL` you have to implement `operator<<` for your type so that Boost.Test can print mismatches.
-If you do not want to do this, define `BOOST_TEST_DONT_PRINT_LOG_VALUE` (and undef it after the check call) or sidestep it with `BOOST_CHECK(fst == snd);`.
-
-### Test Fixture
-
-If you need to test features on a real dataset (think about this twice: prefer cucumber and dataset-independent tests for their reproducibility and minimality), there is a fixed dataset in `test/data`.
-This dataset is a small extract and may not even contain all tags or edge cases.
-Furthermore this dataset is not in sync with what you see in up-to-date OSM maps or on the demo server.
-See the library tests for how to add new dataset dependent tests.
-
-
-## Cucumber
-
-For a general introduction on cucumber in our testsuite, have a look at [the wiki](https://github.com/Project-OSRM/osrm-backend/wiki/Cucumber-Test-Suite).
-
-This documentation aims to supply a guideline on how to write cucumber tests that test new features introduced into osrm.
-
-### Test the feature
-
-It is often tempting to reduce the test to a path and accompanying instructions. Instructions can and will change over the course of improving guidance.
-
-Instructions should only be used when writing a feature located in `features/guidance`. All other features should avoid using instructions at all.
-
-### Write Tests to Scale
-
-OSRM is a navigation engine. Tests should always consider this background. 
-
-An important implication is the grid size. If tests use a very small grid size, you run into the chance of instructions being omitted.
-For example:
-
-```
-Background:
-    Given the profile "car"
-    Given a grid size of 10 meters
-
-Scenario: Testbot - Straight Road
-    Given the node map
-        | a | b | c | d |
-
-    And the ways
-        | nodes | highway |
-        | ab    | primary |
-        | bc    | primary |
-        | cd    | primary |
-
-    When I route I should get
-        | from | to | route       |
-        | a    | d  | ab,bc,cd,cd |
-
-```
-
-In a navigation engine, the instructions
-
- - depart east on ab
- - in 10 meters the road name changes to bc
- - in 10 meters the road name changes to cd
- - you arrived at cd
- 
-would be impossible to announce and not helpful at all.
-Since no actual choices exist, the route you get could result in `ab,cd` and simply say `depart` and `arrive`.
-
-To prevent such surprises, always consider the availability of other roads and use grid sizes/road lengths that correspond to actually reasonable scenarios in a road network.
-
-### Use names
-
-If you specify many nodes in close succession to present a specific road geometry, consider using `name` to indicate to OSRM that the segment is a single road.
-
-```
-Background:
-    Given the profile "car"
-    Given a grid size of 10 meters
-
-Scenario: Testbot - Straight Road
-    Given the node map
-        | a | b | c | d |
-
-    And the ways
-        | nodes | highway | name |
-        | ab    | primary | road |
-        | bc    | primary | road |
-        | cd    | primary | road |
-
-    When I route I should get
-        | from | to | route     | turns         |
-        | a    | d  | road,road | depart,arrive |
-
-```
-
-Guidance guarantees only essential maneuvers. You will always see `depart` and `arrive` as well as all turns that are not obvious.
-
-So the following scenario does not change the instructions
-
-```
-Background:
-    Given the profile "car"
-    Given a grid size of 10 meters
-
-Scenario: Testbot - Straight Road
-    Given the node map
-        | a | b |
-        | d | c |
-
-    And the ways
-        | nodes | highway | name |
-        | ab    | primary | road |
-        | bc    | primary | road |
-        | cd    | primary | road |
-
-    When I route I should get
-        | from | to | route     | turns         |
-        | a    | d  | road,road | depart,arrive |
-```
-
-but if we modify it to
-
-```
-Background:
-    Given the profile "car"
-    Given a grid size of 10 meters
-
-Scenario: Testbot - Straight Road
-    Given the node map
-        | a | b | e |
-        | d | c |   |
-
-    And the ways
-        | nodes | highway | name |
-        | ab    | primary | road |
-        | bc    | primary | road |
-        | cd    | primary | road |
-        | be    | primary | turn |
-
-    When I route I should get
-        | from | to | route          | turns                        |
-        | a    | d  | road,road,road | depart,continue right,arrive |
-```
-
-### Test all directions
-
-Modelling a road as roundabout has an implied oneway tag associated with it. In the following case, we can route from `a` to `d` but not from `d` to `a`.
-To discover those errors, make sure to check for all allowed directions.
-
-```
-Scenario: Enter and Exit mini roundabout with sharp angle   # features/guidance/mini-roundabout.feature:37
-    Given the profile "car"                                   # features/step_definitions/data.js:8
-    Given a grid size of 10 meters                            # features/step_definitions/data.js:20
-    Given the node map                                        # features/step_definitions/data.js:45
-        | a | b |   |
-        |   | c | d |
-    And the ways                                              # features/step_definitions/data.js:128
-        | nodes | highway         | name |
-        | ab    | tertiary        | MySt |
-        | bc    | roundabout      |      |
-        | cd    | tertiary        | MySt |
-    When I route I should get                                 # features/step_definitions/routing.js:4
-        | from | to | route     | turns         | #                                               |
-        | a    | d  | MySt,MySt | depart,arrive | # suppress multiple enter/exit mini roundabouts |
-        | d    | a  | MySt,MySt | depart,arrive | # suppress multiple enter/exit mini roundabouts |
-    Tables were not identical:
-        |  from |     to |     route     |     turns         |     #
-        |     a |      d |     MySt,MySt |     depart,arrive |     # suppress multiple enter/exit mini roundabouts |
-        | (-) d |  (-) a | (-) MySt,MySt | (-) depart,arrive | (-) # suppress multiple enter/exit mini roundabouts |
-        | (+) d |  (+) a | (+)           | (+)               | (+) # suppress multiple enter/exit mini roundabouts |
-```
-
-### Prevent Randomness
-
-Some features in OSRM can result in strange experiences during testcases. To prevent some of these issues, follow the guidelines below.
-
-#### Use Waypoints
-
-Using grid nodes as waypoints offers the chance of unwanted side effects.
-OSRM converts the grid into a so called edge-based graph.
-
-```
-Scenario: Testbot - Intersection
-    Given the node map
-        |   | e |   |
-        | b | a | d |
-        |   | c |   |
-
-    And the ways
-        | nodes | highway | oneway |
-        | ab    | primary | yes    |
-        | ac    | primary | yes    |
-        | ad    | primary | yes    |
-        | ae    | primary | yes    |
-```
-Selecting `a` as a `waypoint` results in four possible starting locations. Which one of the routes `a,b`, `a,c`, `a,d`, or `a,e` is found is pure chance and depends on the order in the static `r-tree`.
-
-To guarantee discovery, use:
-
-```
-Scenario: Testbot - Intersection
-    Given the node map
-        |   |   | e |   |   |
-        |   |   | 4 |   |   |
-        | b | 1 | a | 3 | d |
-        |   |   | 2 |   |   |
-        |   |   | c |   |   |
-
-    And the ways
-        | nodes | highway | oneway |
-        | ab    | primary | yes    |
-        | ac    | primary | yes    |
-        | ad    | primary | yes    |
-        | ae    | primary | yes    |
-```
-And use `1`,`2`,`3`, and `4` as starting waypoints. The routes `1,b`, `2,c`, `3,d`, and `4,e` can all be discovered.
-
-#### Allow For Small Offsets
-
-Whenever you are independent of the start location (see use waypoints), the waypoint chosen as start/end location can still influence distances/durations.
-
-If you are testing for a duration metric, allow for a tiny offset to ensure a passing test in the presence of rounding/snapping issues.
-
-#### Don't Rely on Alternatives
-
-Alternative route discovery is a random feature in itself. The discovery of routes depends on the contraction order of roads and cannot be assumed successful, ever.
@@ -6,13 +6,10 @@ Please create a directory and run cmake from there, passing the path to this sou
 This process created the file `CMakeCache.txt' and the directory `CMakeFiles'. Please delete them.")
 endif()

-if(NOT CMAKE_BUILD_TYPE MATCHES Debug)
-  set(CMAKE_BUILD_TYPE Release)
-endif()
-
 project(osrm-example C CXX)

 list(APPEND CMAKE_MODULE_PATH "${CMAKE_CURRENT_SOURCE_DIR}/cmake")
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11 ")

 set(bitness 32)
 if(CMAKE_SIZEOF_VOID_P EQUAL 8)
@@ -22,15 +19,15 @@ else()
  message(WARNING "Building on a 32 bit system is unsupported")
 endif()

-if(WIN32 AND MSVC_VERSION LESS 1900)
-  message(FATAL_ERROR "Building with Microsoft compiler needs Latest Visual Studio 2015 (Community or better)")
+if(WIN32 AND MSVC_VERSION LESS 1800)
+  message(FATAL_ERROR "Building with Microsoft compiler needs Visual Studio 2013 or later (Express version works too)")
 endif()

-link_directories(${LibOSRM_LIBRARY_DIRS})
 add_executable(osrm-example example.cpp)

 find_package(LibOSRM REQUIRED)
+find_package(Boost 1.49.0 COMPONENTS filesystem system thread REQUIRED)
+
+target_link_libraries(osrm-example ${LibOSRM_LIBRARIES} ${Boost_LIBRARIES})
+include_directories(SYSTEM ${LibOSRM_INCLUDE_DIRS} ${Boost_INCLUDE_DIRS})

-target_link_libraries(osrm-example ${LibOSRM_LIBRARIES} ${LibOSRM_DEPENDENT_LIBRARIES})
-include_directories(SYSTEM ${LibOSRM_INCLUDE_DIRS})
-set(CMAKE_CXX_FLAGS ${LibOSRM_CXXFLAGS})
@@ -1,24 +1,13 @@
 # - Try to find LibOSRM
 # Once done this will define
 #  LibOSRM_FOUND - System has LibOSRM
-#  LibOSRM_LIBRARIES - The libraries and ldflags needed to use LibOSRM
-#  LibOSRM_DEPENDENT_LIBRARIES - The libraries and ldflags need to link LibOSRM dependencies
-#  LibOSRM_LIBRARY_DIRS - The libraries paths needed to find LibOSRM
-#  LibOSRM_CXXFLAGS - Compiler switches required for using LibOSRM
+#  LibOSRM_INCLUDE_DIRS - The LibOSRM include directories
+#  LibOSRM_LIBRARIES - The libraries needed to use LibOSRM
+#  LibOSRM_DEFINITIONS - Compiler switches required for using LibOSRM

 find_package(PkgConfig)
-pkg_search_module(PC_LibOSRM QUIET libosrm)
-
-function(JOIN VALUES GLUE OUTPUT)
-  string (REPLACE ";" "${GLUE}" _TMP_STR "${VALUES}")
-  set (${OUTPUT} "${_TMP_STR}" PARENT_SCOPE)
-endfunction()
-
-list(REMOVE_ITEM PC_LibOSRM_CFLAGS " ")
-JOIN("${PC_LibOSRM_CFLAGS}" " " output)
-
-set(LibOSRM_CXXFLAGS ${output})
-set(LibOSRM_LIBRARY_DIRS ${PC_LibOSRM_LIBRARY_DIRS})
+pkg_check_modules(PC_LibOSRM QUIET libosrm)
+set(LibOSRM_DEFINITIONS ${PC_LibOSRM_CFLAGS_OTHER})

 find_path(LibOSRM_INCLUDE_DIR osrm/osrm.hpp
  PATH_SUFFIXES osrm include/osrm include
@@ -30,6 +19,8 @@ find_path(LibOSRM_INCLUDE_DIR osrm/osrm.hpp
  /opt/local
  /opt)

+set(LibOSRM_INCLUDE_DIRS ${LibOSRM_INCLUDE_DIR} ${LibOSRM_INCLUDE_DIR}/osrm)
+
 find_library(TEST_LibOSRM_STATIC_LIBRARY Names osrm.lib libosrm.a
  PATH_SUFFIXES osrm lib/osrm lib
  HINTS ${PC_LibOSRM_LIBDIR} ${PC_LibOSRM_LIBRARY_DIRS}
@@ -39,7 +30,7 @@ find_library(TEST_LibOSRM_STATIC_LIBRARY Names osrm.lib libosrm.a
  /usr
  /opt/local
  /opt)
-find_library(TEST_LibOSRM_DYNAMIC_LIBRARY Names libosrm.dylib libosrm.so
+find_library(TEST_LibOSRM_DYNAMIC_LIBRARY Names osrm.dynlib libosrm.so
  PATH_SUFFIXES osrm lib/osrm lib
  HINTS ${PC_LibOSRM_LIBDIR} ${PC_LibOSRM_LIBRARY_DIRS}
  ~/Library/Frameworks
@@ -49,15 +40,26 @@ find_library(TEST_LibOSRM_DYNAMIC_LIBRARY Names libosrm.dylib libosrm.so
  /opt/local
  /opt)

-set(LibOSRM_DEPENDENT_LIBRARIES ${PC_LibOSRM_STATIC_LDFLAGS})
-set(LibOSRM_LIBRARIES ${PC_LibOSRM_LDFLAGS})
+if (NOT ("${TEST_LibOSRM_STATIC_LIBRARY}" STREQUAL "TEST_LibOSRM_STATIC_LIBRARY-NOTFOUND"))
+  if ("${PC_LibOSRM_STATIC_LIBRARIES}" STREQUAL "")
+    set(LibOSRM_STATIC_LIBRARIES ${TEST_LibOSRM_STATIC_LIBRARY})
+  else()
+    set(LibOSRM_STATIC_LIBRARIES ${PC_LibOSRM_STATIC_LIBRARIES})
+  endif()
+  set(LibOSRM_LIBRARIES ${LibOSRM_STATIC_LIBRARIES})
+endif()
+
+if (NOT ("${TEST_LibOSRM_DYNAMIC_LIBRARY}" STREQUAL "TEST_LibOSRM_DYNAMIC_LIBRARY-NOTFOUND"))
+  if ("${PC_LibOSRM_LIBRARIES}" STREQUAL "")
+    set(LibOSRM_DYNAMIC_LIBRARIES ${TEST_LibOSRM_DYNAMIC_LIBRARY})
+  else()
+    set(LibOSRM_DYNAMIC_LIBRARIES ${PC_LibOSRM_LIBRARIES})
+  endif()
+  set(LibOSRM_LIBRARIES ${LibOSRM_DYNAMIC_LIBRARIES})
+endif()

 include(FindPackageHandleStandardArgs)
 # handle the QUIETLY and REQUIRED arguments and set LIBOSRM_FOUND to TRUE
 # if all listed variables are TRUE
 find_package_handle_standard_args(LibOSRM DEFAULT_MSG
-                                LibOSRM_LIBRARY_DIRS
-                                LibOSRM_CXXFLAGS
-                                LibOSRM_LIBRARIES
-                                LibOSRM_DEPENDENT_LIBRARIES
-                                LibOSRM_INCLUDE_DIR)
+                                LibOSRM_LIBRARIES LibOSRM_INCLUDE_DIR)
@@ -1,20 +1,20 @@
-#include "osrm/match_parameters.hpp"
-#include "osrm/nearest_parameters.hpp"
 #include "osrm/route_parameters.hpp"
 #include "osrm/table_parameters.hpp"
+#include "osrm/nearest_parameters.hpp"
 #include "osrm/trip_parameters.hpp"
+#include "osrm/match_parameters.hpp"

 #include "osrm/coordinate.hpp"
 #include "osrm/engine_config.hpp"
 #include "osrm/json_container.hpp"

-#include "osrm/osrm.hpp"
 #include "osrm/status.hpp"
+#include "osrm/osrm.hpp"

-#include <exception>
-#include <iostream>
 #include <string>
 #include <utility>
+#include <iostream>
+#include <exception>

 #include <cstdlib>

@@ -5,7 +5,7 @@ Feature: Bike - Access tags on ways
    Background:
        Given the profile "bicycle"

-    Scenario: Bike - Access tag hierarchy on ways
+    Scenario: Bike - Access tag hierachy on ways
        Then routability should be
            | highway | access | vehicle | bicycle | bothw |
            |         |        |         |         | x     |
@@ -121,7 +121,6 @@ Feature: Bike - Access tags on ways
            | private      |              |              |       |
            | agricultural |              |              |       |
            | forestry     |              |              |       |
-            | delivery     |              |              |       |
            |              | yes          |              | x     |
            |              | permissive   |              | x     |
            |              | designated   |              | x     |
@@ -130,7 +129,6 @@ Feature: Bike - Access tags on ways
            |              | private      |              |       |
            |              | agricultural |              |       |
            |              | forestry     |              |       |
-            |              | delivery     |              |       |
            |              |              | yes          | x     |
            |              |              | permissive   | x     |
            |              |              | designated   | x     |
@@ -139,7 +137,6 @@ Feature: Bike - Access tags on ways
            |              |              | private      |       |
            |              |              | agricultural |       |
            |              |              | forestry     |       |
-            |              |              | delivery     |       |

    Scenario: Bike - Access tags on both node and way
        Then routability should be
@@ -5,7 +5,7 @@ Feature: Bike - Access tags on nodes
    Background:
        Given the profile "bicycle"

-    Scenario: Bike - Access tag hierarchy on nodes
+    Scenario: Bike - Access tag hierachy on nodes
        Then routability should be
            | node/access | node/vehicle | node/bicycle | node/highway  | bothw |
            |             |              |              |               | x     |
@@ -47,7 +47,6 @@ Feature: Bike - Access tags on nodes
            | private      |              |              |       |
            | agricultural |              |              |       |
            | forestry     |              |              |       |
-            | delivery     |              |              |       |
            |              | yes          |              | x     |
            |              | permissive   |              | x     |
            |              | designated   |              | x     |
@@ -56,7 +55,6 @@ Feature: Bike - Access tags on nodes
            |              | private      |              |       |
            |              | agricultural |              |       |
            |              | forestry     |              |       |
-            |              | delivery     |              |       |
            |              |              | yes          | x     |
            |              |              | permissive   | x     |
            |              |              | designated   | x     |
@@ -65,4 +63,3 @@ Feature: Bike - Access tags on nodes
            |              |              | private      |       |
            |              |              | agricultural |       |
            |              |              | forestry     |       |
-            |              |              | delivery     |       |
@@ -4,7 +4,7 @@ Feature: Bike - Squares and other areas
    Background:
        Given the profile "bicycle"

-    @square
+    @square @mokob @2154
    Scenario: Bike - Route along edge of a squares
        Given the node map
            | x |   |
@@ -50,7 +50,7 @@ Feature: Bike - Squares and other areas
            | d    | a  | xa,xa |
            | a    | d  | xa,xa |

-    @parking
+    @parking @mokob @2154
    Scenario: Bike - parking areas
        Given the node map
            | e |   |   | f |
@@ -78,7 +78,7 @@ Feature: Bike - Squares and other areas
            | a    | d  | abcda,abcda    |


-    @train @platform
+    @train @platform @mokob @2154
    Scenario: Bike - railway platforms
        Given the node map
            | x | a | b | y |
@@ -1,5 +1,5 @@
@routing @bicycle @bridge
-Feature: Bicycle - Handle cycling
+Feature: Bicycle - Handle movable bridge

    Background:
        Given the profile "bicycle"
@@ -18,14 +18,14 @@ Feature: Bicycle - Handle cycling

        When I route I should get
            | from | to | route           | modes                                  |
-            | a    | g  | abc,cde,efg,efg | cycling,cycling,cycling,cycling |
-            | b    | f  | abc,cde,efg,efg | cycling,cycling,cycling,cycling |
-            | e    | c  | cde,cde         | cycling,cycling          |
-            | e    | b  | cde,abc,abc     | cycling,cycling,cycling         |
-            | e    | a  | cde,abc,abc     | cycling,cycling,cycling         |
-            | c    | e  | cde,cde         | cycling,cycling          |
-            | c    | f  | cde,efg,efg     | cycling,cycling,cycling         |
-            | c    | g  | cde,efg,efg     | cycling,cycling,cycling         |
+            | a    | g  | abc,cde,efg,efg | cycling,movable bridge,cycling,cycling |
+            | b    | f  | abc,cde,efg,efg | cycling,movable bridge,cycling,cycling |
+            | e    | c  | cde,cde         | movable bridge,movable bridge          |
+            | e    | b  | cde,abc,abc     | movable bridge,cycling,cycling         |
+            | e    | a  | cde,abc,abc     | movable bridge,cycling,cycling         |
+            | c    | e  | cde,cde         | movable bridge,movable bridge          |
+            | c    | f  | cde,efg,efg     | movable bridge,cycling,cycling         |
+            | c    | g  | cde,efg,efg     | movable bridge,cycling,cycling         |

    Scenario: Bicycle - Properly handle durations
        Given the node map
@@ -41,7 +41,7 @@ Feature: Bicycle - Handle cycling

        When I route I should get
            | from | to | route           | modes                                  | speed  |
-            | a    | g  | abc,cde,efg,efg | cycling,cycling,cycling,cycling | 5 km/h |
-            | b    | f  | abc,cde,efg,efg | cycling,cycling,cycling,cycling | 4 km/h |
-            | c    | e  | cde,cde         | cycling,cycling          | 2 km/h |
-            | e    | c  | cde,cde         | cycling,cycling          | 2 km/h |
+            | a    | g  | abc,cde,efg,efg | cycling,movable bridge,cycling,cycling | 5 km/h |
+            | b    | f  | abc,cde,efg,efg | cycling,movable bridge,cycling,cycling | 4 km/h |
+            | c    | e  | cde,cde         | movable bridge,movable bridge          | 2 km/h |
+            | e    | c  | cde,cde         | movable bridge,movable bridge          | 2 km/h |
@@ -19,15 +19,15 @@ Feature: Bike - Destination only, no passing through
            | axye  |             |

        When I route I should get
-            | from | to | route      |
-            | a    | b  | ab,ab      |
-            | a    | c  | ab,bcd,bcd |
-            | a    | d  | ab,bcd,bcd |
-            | a    | e  | axye,axye  |
-            | e    | d  | de,de      |
-            | e    | c  | de,bcd,bcd |
-            | e    | b  | de,bcd,bcd |
-            | e    | a  | axye,axye  |
+            | from | to | route  |
+            | a    | b  | ab     |
+            | a    | c  | ab,bcd |
+            | a    | d  | ab,bcd |
+            | a    | e  | axye   |
+            | e    | d  | de     |
+            | e    | c  | de,bcd |
+            | e    | b  | de,bcd |
+            | e    | a  | axye   |

    Scenario: Bike - Destination only street
        Given the node map
@@ -45,15 +45,15 @@ Feature: Bike - Destination only, no passing through
            | axye  |             |

        When I route I should get
-            | from | to | route       |
-            | a    | b  | ab,ab       |
-            | a    | c  | ab,bc,bc    |
-            | a    | d  | ab,bc,cd,cd |
-            | a    | e  | axye,axye   |
-            | e    | d  | de,de       |
-            | e    | c  | de,cd,cd    |
-            | e    | b  | de,cd,bc,bc |
-            | e    | a  | axye,axye   |
+            | from | to | route    |
+            | a    | b  | ab       |
+            | a    | c  | ab,bc    |
+            | a    | d  | ab,bc,cd |
+            | a    | e  | axye     |
+            | e    | d  | de       |
+            | e    | c  | de,dc    |
+            | e    | b  | de,dc,bc |
+            | e    | a  | axye     |

    Scenario: Bike - Routing inside a destination only area
        Given the node map
@@ -70,8 +70,8 @@ Feature: Bike - Destination only, no passing through
            | axye  |             |

        When I route I should get
-            | from | to | route          |
-            | a    | e  | ab,bc,cd,de,de |
-            | e    | a  | de,cd,bc,ab,ab |
-            | b    | d  | bc,cd,cd       |
-            | d    | b  | cd,bc,bc       |
+            | from | to | route       |
+            | a    | e  | ab,bc,cd,de |
+            | e    | a  | de,cd,bc,ab |
+            | b    | d  | bc,cd       |
+            | d    | b  | cd,bc       |
@@ -16,13 +16,13 @@ Feature: Bike - Mode flag
    	 | cd    | primary |       |          |

    	When I route I should get
-    	 | from | to | route       | modes                         |
-    	 | a    | d  | ab,bc,cd,cd | cycling,ferry,cycling,cycling |
-    	 | d    | a  | cd,bc,ab,ab | cycling,ferry,cycling,cycling |
-    	 | c    | a  | bc,ab,ab    | ferry,cycling,cycling         |
-    	 | d    | b  | cd,bc,bc    | cycling,ferry,ferry           |
-    	 | a    | c  | ab,bc,bc    | cycling,ferry,ferry           |
-    	 | b    | d  | bc,cd,cd    | ferry,cycling,cycling         |
+    	 | from | to | route       | turns                    | modes                         |
+    	 | a    | d  | ab,bc,cd,cd | depart,right,left,arrive | cycling,ferry,cycling,cycling |
+    	 | d    | a  | cd,bc,ab,ab | depart,right,left,arrive | cycling,ferry,cycling,cycling |
+    	 | c    | a  | bc,ab,ab    | depart,left,arrive       | ferry,cycling,cycling         |
+    	 | d    | b  | cd,bc,bc    | depart,right,arrive      | cycling,ferry,ferry           |
+    	 | a    | c  | ab,bc,bc    | depart,right,arrive      | cycling,ferry,ferry           |
+    	 | b    | d  | bc,cd,cd    | depart,left,arrive       | ferry,cycling,cycling         |

     Scenario: Bike - Mode when using a train
     	Given the node map
@@ -36,13 +36,13 @@ Feature: Bike - Mode flag
     	 | cd    | primary |         |         |

     	When I route I should get
-     	 | from | to | route       | modes                         |
-     	 | a    | d  | ab,bc,cd,cd | cycling,train,cycling,cycling |
-     	 | d    | a  | cd,bc,ab,ab | cycling,train,cycling,cycling |
-     	 | c    | a  | bc,ab,ab    | train,cycling,cycling         |
-     	 | d    | b  | cd,bc,bc    | cycling,train,train           |
-     	 | a    | c  | ab,bc,bc    | cycling,train,train           |
-     	 | b    | d  | bc,cd,cd    | train,cycling,cycling         |
+     	 | from | to | route       | turns                    | modes                         |
+     	 | a    | d  | ab,bc,cd,cd | depart,right,left,arrive | cycling,train,cycling,cycling |
+     	 | d    | a  | cd,bc,ab,ab | depart,right,left,arrive | cycling,train,cycling,cycling |
+     	 | c    | a  | bc,ab,ab    | depart,left,arrive       | train,cycling,cycling         |
+     	 | d    | b  | cd,bc,bc    | depart,right,arrive      | cycling,train,train           |
+     	 | a    | c  | ab,bc,bc    | depart,right,arrive      | cycling,train,train           |
+     	 | b    | d  | bc,cd,cd    | depart,left,arrive       | train,cycling,cycling         |

     Scenario: Bike - Mode when pushing bike against oneways
     	Given the node map
@@ -56,13 +56,13 @@ Feature: Bike - Mode flag
     	 | cd    | primary |        |

     	When I route I should get
-     	 | from | to | route       | modes                                |
-     	 | a    | d  | ab,bc,cd,cd | cycling,cycling,cycling,cycling      |
-     	 | d    | a  | cd,bc,ab,ab | cycling,pushing bike,cycling,cycling |
-     	 | c    | a  | bc,ab,ab    | pushing bike,cycling,cycling         |
-     	 | d    | b  | cd,bc,bc    | cycling,pushing bike,pushing bike    |
-     	 | a    | c  | ab,bc,bc    | cycling,cycling,cycling              |
-     	 | b    | d  | bc,cd,cd    | cycling,cycling,cycling              |
+     	 | from | to | route       | turns                                   | modes                                |
+     	 | a    | d  | ab,bc,cd,cd | depart,right,left,arrive                | cycling,cycling,cycling,cycling      |
+     	 | d    | a  | cd,bc,ab,ab | depart,right,left,arrive                | cycling,pushing bike,cycling,cycling |
+     	 | c    | a  | bc,ab,ab    | depart,left,arrive                      | pushing bike,cycling,cycling         |
+     	 | d    | b  | cd,bc,bc    | depart,right,arrive                     | cycling,pushing bike,pushing bike    |
+     	 | a    | c  | ab,bc,bc    | depart,right,arrive                     | cycling,cycling,cycling              |
+     	 | b    | d  | bc,cd,cd    | depart,left,arrive                      | cycling,cycling,cycling              |

     Scenario: Bike - Mode when pushing on pedestrain streets
     	Given the node map
@@ -76,13 +76,13 @@ Feature: Bike - Mode flag
     	 | cd    | primary    |

     	When I route I should get
-     	 | from | to | route       | modes                                |
-     	 | a    | d  | ab,bc,cd,cd | cycling,pushing bike,cycling,cycling |
-     	 | d    | a  | cd,bc,ab,ab | cycling,pushing bike,cycling,cycling |
-     	 | c    | a  | bc,ab,ab    | pushing bike,cycling,cycling         |
-     	 | d    | b  | cd,bc,bc    | cycling,pushing bike,pushing bike    |
-     	 | a    | c  | ab,bc,bc    | cycling,pushing bike,pushing bike    |
-     	 | b    | d  | bc,cd,cd    | pushing bike,cycling,cycling         |
+     	 | from | to | route       | turns                    | modes                                |
+     	 | a    | d  | ab,bc,cd,cd | depart,right,left,arrive | cycling,pushing bike,cycling,cycling |
+     	 | d    | a  | cd,bc,ab,ab | depart,right,left,arrive | cycling,pushing bike,cycling,cycling |
+     	 | c    | a  | bc,ab,ab    | depart,left,arrive       | pushing bike,cycling,cycling         |
+     	 | d    | b  | cd,bc,bc    | depart,right,arrive      | cycling,pushing bike,pushing bike    |
+     	 | a    | c  | ab,bc,bc    | depart,right,arrive      | cycling,pushing bike,pushing bike    |
+     	 | b    | d  | bc,cd,cd    | depart,left,arrive       | pushing bike,cycling,cycling         |

     Scenario: Bike - Mode when pushing on pedestrain areas
     	Given the node map
@@ -116,13 +116,13 @@ Feature: Bike - Mode flag
    	 | cd    | primary |

     	When I route I should get
-    	 | from | to | route       | modes                                |
-    	 | a    | d  | ab,bc,cd,cd | cycling,pushing bike,cycling,cycling |
-    	 | d    | a  | cd,bc,ab,ab | cycling,pushing bike,cycling,cycling |
-    	 | c    | a  | bc,ab,ab    | pushing bike,cycling,cycling         |
-    	 | d    | b  | cd,bc,bc    | cycling,pushing bike,pushing bike    |
-    	 | a    | c  | ab,bc,bc    | cycling,pushing bike,pushing bike    |
-    	 | b    | d  | bc,cd,cd    | pushing bike,cycling,cycling         |
+    	 | from | to | route       | turns                    | modes                                |
+    	 | a    | d  | ab,bc,cd,cd | depart,right,left,arrive | cycling,pushing bike,cycling,cycling |
+    	 | d    | a  | cd,bc,ab,ab | depart,right,left,arrive | cycling,pushing bike,cycling,cycling |
+    	 | c    | a  | bc,ab,ab    | depart,left,arrive       | pushing bike,cycling,cycling         |
+    	 | d    | b  | cd,bc,bc    | depart,right,arrive      | cycling,pushing bike,pushing bike    |
+    	 | a    | c  | ab,bc,bc    | depart,right,arrive      | cycling,pushing bike,pushing bike    |
+    	 | b    | d  | bc,cd,cd    | depart,left,arrive       | pushing bike,cycling,cycling         |

     Scenario: Bike - Mode when bicycle=dismount
     	Given the node map
@@ -136,13 +136,13 @@ Feature: Bike - Mode flag
    	 | cd    | primary |          |

     	When I route I should get
-    	 | from | to | route       | modes                                |
-    	 | a    | d  | ab,bc,cd,cd | cycling,pushing bike,cycling,cycling |
-    	 | d    | a  | cd,bc,ab,ab | cycling,pushing bike,cycling,cycling |
-    	 | c    | a  | bc,ab,ab    | pushing bike,cycling,cycling         |
-    	 | d    | b  | cd,bc,bc    | cycling,pushing bike,pushing bike    |
-    	 | a    | c  | ab,bc,bc    | cycling,pushing bike,pushing bike    |
-         | b    | d  | bc,cd,cd    | pushing bike,cycling,cycling         |
+    	 | from | to | route       | turns                    | modes                                |
+    	 | a    | d  | ab,bc,cd,cd | depart,right,left,arrive | cycling,pushing bike,cycling,cycling |
+    	 | d    | a  | cd,bc,ab,ab | depart,right,left,arrive | cycling,pushing bike,cycling,cycling |
+    	 | c    | a  | bc,ab,ab    | depart,left,arrive       | pushing bike,cycling,cycling         |
+    	 | d    | b  | cd,bc,bc    | depart,right,arrive      | cycling,pushing bike,pushing bike    |
+    	 | a    | c  | ab,bc,bc    | depart,right,arrive      | cycling,pushing bike,pushing bike    |
+         | b    | d  | bc,cd,cd    | depart,left,arrive       | pushing bike,cycling,cycling         |

    Scenario: Bicycle - Modes when starting on forward oneway
        Given the node map
@@ -10,13 +10,13 @@ Feature: Bike - Street names in instructions
            |   | c |

        And the ways
-            | nodes | name     | ref |
-            | ab    | My Way   | A6  |
-            | bc    | Your Way | A7  |
+            | nodes | name     |
+            | ab    | My Way   |
+            | bc    | Your Way |

        When I route I should get
-            | from | to | route                                   |
-            | a    | c  | My Way (A6),Your Way (A7),Your Way (A7) |
+            | from | to | route                    |
+            | a    | c  | My Way,Your Way,Your Way |

    @unnamed
    Scenario: Bike - Use way type to describe unnamed ways
@@ -48,22 +48,22 @@ Feature: Bike - Oneway streets

    Scenario: Bike - Implied oneways
        Then routability should be
-            | highway         | foot | bicycle | junction   | forw | backw | #                     |
-            |                 | no   |         |            | x    | x     |                       |
-            |                 | no   |         | roundabout | x    |       |                       |
-            | motorway        | no   | yes     |            | x    |       |                       |
-            | motorway_link   | no   | yes     |            | x    | x     | does not imply oneway |
-            | motorway        | no   | yes     | roundabout | x    |       |                       |
-            | motorway_link   | no   | yes     | roundabout | x    |       |                       |
+            | highway       | foot | bicycle | junction   | forw | backw |
+            |               | no   |         |            | x    | x     |
+            |               | no   |         | roundabout | x    |       |
+            | motorway      | no   | yes     |            | x    |       |
+            | motorway_link | no   | yes     |            | x    |       |
+            | motorway      | no   | yes     | roundabout | x    |       |
+            | motorway_link | no   | yes     | roundabout | x    |       |

    Scenario: Bike - Overriding implied oneways
        Then routability should be
-            | highway         | foot | junction   | oneway | forw | backw |
-            | primary         | no   | roundabout | no     | x    | x     |
-            | primary         | no   | roundabout | yes    | x    |       |
-            | motorway_link   | no   |            | -1     |      |       |
-            | trunk_link      | no   |            | -1     |      |       |
-            | primary         | no   | roundabout | -1     |      | x     |
+            | highway       | foot | junction   | oneway | forw | backw |
+            | primary       | no   | roundabout | no     | x    | x     |
+            | primary       | no   | roundabout | yes    | x    |       |
+            | motorway_link | no   |            | -1     |      |       |
+            | trunk_link    | no   |            | -1     |      |       |
+            | primary       | no   | roundabout | -1     |      | x     |

    Scenario: Bike - Oneway:bicycle should override normal oneways tags
        Then routability should be
@@ -115,7 +115,7 @@ Feature: Bike - Oneway streets

    Scenario: Bike - Two consecutive oneways
        Given the node map
-            | a | b |   | c |
+            | a | b | c |

        And the ways
            | nodes | oneway |
@@ -63,6 +63,7 @@ Feature: Bike - Accessability of different way types
            | runway   |      |      |       |
            | runway   | yes  | foot | foot  |

+    @todo
    Scenario: Bike - Pushing bikes on ways with foot=yes in one direction
        Then routability should be
            | highway  | foot:forward | foot:backward | forw | backw |
@@ -97,12 +98,13 @@ Feature: Bike - Accessability of different way types
            | cd    | primary |        |

        When I route I should get
-            | from | to | route       | modes                                   |
-            | a    | d  | ab,bc,cd,cd | cycling,cycling,cycling,cycling         |
-            | d    | a  | cd,bc,ab,ab | cycling,pushing bike,cycling,cycling    |
-            | c    | a  | bc,ab,ab    | pushing bike,cycling,cycling            |
-            | d    | b  | cd,bc,bc    | cycling,pushing bike,pushing bike       |
+            | from | to | route       | turns                                   |
+            | a    | d  | ab,bc,cd,cd | depart,right,left,arrive                |
+            | d    | a  | cd,bc,ab,ab | depart,right,left,arrive                |
+            | c    | a  | bc,ab,ab    | depart,left,arrive                      |
+            | d    | b  | cd,bc,bc    | depart,right,arrive                     |

+    @todo
    Scenario: Bike - Instructions when pushing bike on footway/pedestrian, etc.
        Given the node map
            | a | b |   |
@@ -115,8 +117,8 @@ Feature: Bike - Accessability of different way types
            | cd    | primary |

        When I route I should get
-            | from | to | route       | modes                                |
-            | a    | d  | ab,bc,cd,cd | cycling,pushing bike,cycling,cycling |
-            | d    | a  | cd,bc,ab,ab | cycling,pushing bike,cycling,cycling |
-            | c    | a  | bc,ab,ab    | pushing bike,cycling,cycling         |
-            | d    | b  | cd,bc,bc    | cycling,pushing bike,pushing bike    |
+            | from | to | route       | turns                    |
+            | a    | d  | ab,bc,cd,cd | depart,right,left,arrive |
+            | d    | a  | cd,bc,ab,ab | depart,right,left,arrive |
+            | c    | a  | bc,ab,ab    | depart,left,arrive       |
+            | d    | b  | cd,bc,bc    | depart,right,arrive      |
@@ -14,7 +14,7 @@ Feature: Bike - Way ref

        When I route I should get
            | from | to | route                               |
-            | a    | b  | Utopia Drive (E7),Utopia Drive (E7) |
+            | a    | b  | Utopia Drive / E7,Utopia Drive / E7 |

    Scenario: Bike - Way with only ref
        Given the node map
@@ -0,0 +1,30 @@
+@routing @bicycle @roundabout @instruction
+Feature: Roundabout Instructions
+
+    Background:
+        Given the profile "bicycle"
+
+    Scenario: Bicycle - Roundabout instructions
+        Given the node map
+            |   |   | v |   |   |
+            |   |   | d |   |   |
+            | s | a |   | c | u |
+            |   |   | b |   |   |
+            |   |   | t |   |   |
+
+        And the ways
+            | nodes | junction   |
+            | sa    |            |
+            | tb    |            |
+            | uc    |            |
+            | vd    |            |
+            | abcda | roundabout |
+
+        When I route I should get
+            | from | to | route    | turns                           |
+            | s    | t  | sa,tb,tb | depart,roundabout-exit-1,arrive |
+            | s    | u  | sa,uc,uc | depart,roundabout-exit-2,arrive |
+            | s    | v  | sa,vd,vd | depart,roundabout-exit-3,arrive |
+            | u    | v  | uc,vd,vd | depart,roundabout-exit-1,arrive |
+            | u    | s  | uc,sa,sa | depart,roundabout-exit-2,arrive |
+            | u    | t  | uc,tb,tb | depart,roundabout-exit-3,arrive |
@@ -5,7 +5,7 @@ Feature: Car - Restricted access
    Background:
        Given the profile "car"

-    Scenario: Car - Access tag hierarchy    on ways
+    Scenario: Car - Access tag hierachy    on ways
        Then routability should be
            | access | vehicle | motor_vehicle | motorcar | bothw |
            |        |         |               |          | x     |
@@ -30,7 +30,7 @@ Feature: Car - Restricted access
            |        |         | no            | yes      | x     |
            |        |         | yes           | no       |       |

-    Scenario: Car - Access tag hierarchy on nodes
+    Scenario: Car - Access tag hierachy on nodes
        Then routability should be
            | node/access | node/vehicle | node/motor_vehicle | node/motorcar | bothw |
            |             |              |                    |               | x     |
@@ -94,7 +94,6 @@ Feature: Car - Restricted access
            | agricultural |       |
            | forestry     |       |
            | psv          |       |
-            | delivery     |       |
            | some_tag     | x     |


@@ -109,7 +108,6 @@ Feature: Car - Restricted access
            | agricultural |       |
            | forestry     |       |
            | psv          |       |
-            | delivery     |       |
            | some_tag     | x     |

    Scenario: Car - Access tags on both node and way
@@ -34,6 +34,7 @@ OSRM will use 4/5 of the projected free-flow speed.
            | a    | b  | ab,ab | 47 km/h +- 1 |
            | b    | c  | bc,bc | 47 km/h +- 1 |

+    @mokob @2162
    Scenario: Car - Advisory speed overwrites backwards maxspeed
        Given the node map
            | a | b | c |
@@ -48,6 +49,7 @@ OSRM will use 4/5 of the projected free-flow speed.
            | b    | a  | ab,ab | 47 km/h +- 1 |
            | c    | b  | bc,bc | 47 km/h +- 1 |

+    @mokob @2162 @deleteme
    Scenario: Car - Advisory speed overwrites backwards maxspeed
        Given the node map
            | a | b | c | d |
@@ -63,6 +65,7 @@ OSRM will use 4/5 of the projected free-flow speed.
            | c    | b  | bc,bc | 47 km/h +- 1 |
            | d    | c  | cd,cd | 47 km/h +- 1 |

+    @mokob @2162
    Scenario: Car - Directional advisory speeds play nice with eachother
        Given the node map
            | a | b | c |
@@ -1,5 +1,5 @@
@routing @car @bridge
-Feature: Car - Handle driving
+Feature: Car - Handle movable bridge

    Background:
        Given the profile "car"
@@ -18,14 +18,14 @@ Feature: Car - Handle driving

        When I route I should get
            | from | to | route           | modes                                  |
-            | a    | g  | abc,cde,efg,efg | driving,driving,driving,driving |
-            | b    | f  | abc,cde,efg,efg | driving,driving,driving,driving |
-            | e    | c  | cde,cde         | driving,driving          |
-            | e    | b  | cde,abc,abc     | driving,driving,driving         |
-            | e    | a  | cde,abc,abc     | driving,driving,driving         |
-            | c    | e  | cde,cde         | driving,driving          |
-            | c    | f  | cde,efg,efg     | driving,driving,driving         |
-            | c    | g  | cde,efg,efg     | driving,driving,driving         |
+            | a    | g  | abc,cde,efg,efg | driving,movable bridge,driving,driving |
+            | b    | f  | abc,cde,efg,efg | driving,movable bridge,driving,driving |
+            | e    | c  | cde,cde         | movable bridge,movable bridge          |
+            | e    | b  | cde,abc,abc     | movable bridge,driving,driving         |
+            | e    | a  | cde,abc,abc     | movable bridge,driving,driving         |
+            | c    | e  | cde,cde         | movable bridge,movable bridge          |
+            | c    | f  | cde,efg,efg     | movable bridge,driving,driving         |
+            | c    | g  | cde,efg,efg     | movable bridge,driving,driving         |

    Scenario: Car - Properly handle durations
        Given the node map
@@ -41,7 +41,7 @@ Feature: Car - Handle driving

        When I route I should get
            | from | to | route           | modes                                  | speed  |
-            | a    | g  | abc,cde,efg,efg | driving,driving,driving,driving | 7 km/h |
-            | b    | f  | abc,cde,efg,efg | driving,driving,driving,driving | 5 km/h |
-            | c    | e  | cde,cde         | driving,driving          | 2 km/h |
-            | e    | c  | cde,cde         | driving,driving          | 2 km/h |
+            | a    | g  | abc,cde,efg,efg | driving,movable bridge,driving,driving | 7 km/h |
+            | b    | f  | abc,cde,efg,efg | driving,movable bridge,driving,driving | 5 km/h |
+            | c    | e  | cde,cde         | movable bridge,movable bridge          | 2 km/h |
+            | e    | c  | cde,cde         | movable bridge,movable bridge          | 2 km/h |
@@ -19,15 +19,15 @@ Feature: Car - Destination only, no passing through
            | axye  |             |

        When I route I should get
-            | from | to | route      |
-            | a    | b  | ab,ab      |
-            | a    | c  | ab,bcd,bcd |
-            | a    | d  | ab,bcd,bcd |
-            | a    | e  | axye,axye  |
-            | e    | d  | de,de      |
-            | e    | c  | de,bcd,bcd |
-            | e    | b  | de,bcd,bcd |
-            | e    | a  | axye,axye  |
+            | from | to | route  |
+            | a    | b  | ab     |
+            | a    | c  | ab,bcd |
+            | a    | d  | ab,bcd |
+            | a    | e  | axye   |
+            | e    | d  | de     |
+            | e    | c  | de,bcd |
+            | e    | b  | de,bcd |
+            | e    | a  | axye   |

    Scenario: Car - Destination only street
        Given the node map
@@ -45,15 +45,15 @@ Feature: Car - Destination only, no passing through
            | axye  |             |

        When I route I should get
-            | from | to | route       |
-            | a    | b  | ab,ab       |
-            | a    | c  | ab,bc,bc    |
-            | a    | d  | ab,bc,cd,cd |
-            | a    | e  | axye,axye   |
-            | e    | d  | de,de       |
-            | e    | c  | de,cd,cd    |
-            | e    | b  | de,cd,bc,bc |
-            | e    | a  | axye,axye   |
+            | from | to | route    |
+            | a    | b  | ab       |
+            | a    | c  | ab,bc    |
+            | a    | d  | ab,bc,cd |
+            | a    | e  | axye     |
+            | e    | d  | de       |
+            | e    | c  | de,dc    |
+            | e    | b  | de,dc,bc |
+            | e    | a  | axye     |

    Scenario: Car - Routing inside a destination only area
        Given the node map
@@ -70,8 +70,8 @@ Feature: Car - Destination only, no passing through
            | axye  |             |

        When I route I should get
-            | from | to | route          |
-            | a    | e  | ab,bc,cd,de,de |
-            | e    | a  | de,cd,bc,ab,ab |
-            | b    | d  | bc,cd,cd       |
-            | d    | b  | cd,bc,bc       |
+            | from | to | route       |
+            | a    | e  | ab,bc,cd,de |
+            | e    | a  | de,cd,bc,ab |
+            | b    | d  | bc,cd       |
+            | d    | b  | cd,bc       |
@@ -15,13 +15,13 @@ Feature: Car - Mode flag
            | cd    | primary |       |          |

        When I route I should get
-            | from | to | route       | modes                         |
-            | a    | d  | ab,bc,cd,cd | driving,ferry,driving,driving |
-            | d    | a  | cd,bc,ab,ab | driving,ferry,driving,driving |
-            | c    | a  | bc,ab,ab    | ferry,driving,driving         |
-            | d    | b  | cd,bc,bc    | driving,ferry,ferry           |
-            | a    | c  | ab,bc,bc    | driving,ferry,ferry           |
-            | b    | d  | bc,cd,cd    | ferry,driving,driving         |
+            | from | to | route       | turns                    | modes                         |
+            | a    | d  | ab,bc,cd,cd | depart,right,left,arrive | driving,ferry,driving,driving |
+            | d    | a  | cd,bc,ab,ab | depart,right,left,arrive | driving,ferry,driving,driving |
+            | c    | a  | bc,ab,ab    | depart,left,arrive       | ferry,driving,driving         |
+            | d    | b  | cd,bc,bc    | depart,right,arrive      | driving,ferry,ferry           |
+            | a    | c  | ab,bc,bc    | depart,right,arrive      | driving,ferry,ferry           |
+            | b    | d  | bc,cd,cd    | depart,left,arrive       | ferry,driving,driving         |

    Scenario: Car - Snapping when using a ferry
        Given the node map
@@ -34,7 +34,7 @@ Feature: Car - Mode flag
            | ef    | primary |       |          |

        When I route I should get
-            | from | to | route     | modes       | time  |
-            | c    | d  | bcde,bcde | ferry,ferry | 600s  |
+            | from | to | route     | turns         | modes       | time  |
+            | c    | d  | bcde,bcde | depart,arrive | ferry,ferry | 600s  |


@@ -18,23 +18,6 @@ Feature: Car - Street names in instructions
            | from | to | route                              |
            | a    | c  | My Way,Your Way (A1),Your Way (A1) |

-    Scenario: Car - A named street with pronunciation
-        Given the node map
-            | a | b | d |
-            |   | 1 |   |
-            |   | c |   |
-
-        And the ways
-            | nodes | name     |name:pronunciation | ref |
-            | ab    | My Way   |                    |     |
-            | bd    | My Way   | meyeway            | A1  |
-            | cd    | Your Way | yourewaye          |     |
-
-        When I route I should get
-            | from | to | route              | pronunciations      |
-            | a    | d  | My Way,My Way (A1) | ,meyeway             |
-            | 1    | c  | Your Way,Your Way  | yourewaye,yourewaye  |
-
    @todo
    Scenario: Car - Use way type to describe unnamed ways
        Given the node map
@@ -17,21 +17,19 @@ Feature: Car - Oneway streets

    Scenario: Car - Implied oneways
        Then routability should be
-            | highway         | junction   | forw | backw | #                     |
-            | motorway        |            | x    |       |                       |
-            | motorway_link   |            | x    | x     | does not imply oneway |
-            | primary         |            | x    | x     |                       |
-            | motorway        | roundabout | x    |       |                       |
-            | motorway_link   | roundabout | x    |       |                       |
-            | primary         | roundabout | x    |       |                       |
+            | highway       | junction   | forw | backw |
+            | motorway      |            | x    |       |
+            | motorway_link |            | x    |       |
+            | primary       |            | x    | x     |
+            | motorway      | roundabout | x    |       |
+            | motorway_link | roundabout | x    |       |
+            | primary       | roundabout | x    |       |

    Scenario: Car - Overrule implied oneway
        Then routability should be
-            | highway       | oneway | forw | backw | #                    |
-            | motorway      | no     | x    | x     |                      |
-            | motorway_link | no     | x    | x     |                      |
-            | motorway_link | yes    | x    |       |                      |
-            | motorway_link |        | x    | x     | does not imply onway |
+            | highway       | oneway | forw | backw |
+            | motorway      | no     | x    | x     |
+            | motorway_link | no     | x    | x     |

    Scenario: Car - Around the Block
        Given the node map
@@ -68,7 +66,7 @@ Feature: Car - Oneway streets

    Scenario: Car - Two consecutive oneways
        Given the node map
-            | a | b |   | c |
+            | a | b | c |

        And the ways
            | nodes | oneway |
@@ -5,7 +5,6 @@ Feature: Car - Turn restrictions

    Background: Use car routing
        Given the profile "car"
-        Given a grid size of 200 meters

    @no_turning
    Scenario: Car - No left turn
@@ -0,0 +1,30 @@
+@routing @car @roundabout @instruction
+Feature: Roundabout Instructions
+
+    Background:
+        Given the profile "car"
+
+    Scenario: Car - Roundabout instructions
+        Given the node map
+            |   |   | v |   |   |
+            |   |   | d |   |   |
+            | s | a |   | c | u |
+            |   |   | b |   |   |
+            |   |   | t |   |   |
+
+        And the ways
+            | nodes | junction   |
+            | sa    |            |
+            | tb    |            |
+            | uc    |            |
+            | vd    |            |
+            | abcda | roundabout |
+
+        When I route I should get
+            | from | to | route    | turns                            |
+            | s    | t  | sa,tb,tb | depart,roundabout-exit-1,arrive |
+            | s    | u  | sa,uc,uc | depart,roundabout-exit-2,arrive |
+            | s    | v  | sa,vd,vd | depart,roundabout-exit-3,arrive |
+            | u    | v  | uc,vd,vd | depart,roundabout-exit-1,arrive |
+            | u    | s  | uc,sa,sa | depart,roundabout-exit-2,arrive |
+            | u    | t  | uc,tb,tb | depart,roundabout-exit-3,arrive |
@@ -31,7 +31,7 @@ Feature: Traffic - speeds
        4,1,27
        """

-    Scenario: Weighting based on speed file
+    Scenario: Weighting not based on raster sources
        Given the profile "testbot"
        Given the extract extra arguments "--generate-edge-lookup"
        Given the contract extra arguments "--segment-speed-file speeds.csv"
@@ -1,95 +0,0 @@
-@routing @speed @traffic
-Feature: Traffic - turn penalties
-
-    Background: Evenly spaced grid with multiple intersections
-        Given the node map
-            |      | a:1  |      | b:2  |      |
-            | c:3  | d:4  | e:5  | f:6  | g:7  |
-            |      | h:8  |      | i:9  |      |
-            | j:10 | k:11 | l:12 | m:13 | n:14 |
-            |      | o:15 |      | p:16 |      |
-        And the ways
-            | nodes | highway |
-            | ad    | primary |
-            | cd    | primary |
-            | def   | primary |
-            | dhk   | primary |
-
-            | bf    | primary |
-            | fg    | primary |
-            | fim   | primary |
-
-            | jk    | primary |
-            | klm   | primary |
-            | ko    | primary |
-
-            | mn    | primary |
-            | mp    | primary |
-        And the profile "car"
-        And the extract extra arguments "--generate-edge-lookup"
-
-    Scenario: Weighting not based on turn penalty file
-        When I route I should get
-            | from | to | route           | speed   | time      |
-            | a    | h  | ad,dhk,dhk      | 63 km/h | 11.5s +-1 |
-                                                                  # straight
-            | i    | g  | fim,fg,fg       | 59 km/h | 12s  +-1  |
-                                                                  # right
-            | a    | e  | ad,def,def      | 57 km/h | 12.5s +-1 |
-                                                                  # left
-            | c    | g  | cd,def,fg,fg    | 63 km/h | 23s +-1   |
-                                                                  # double straight
-            | p    | g  | mp,fim,fg,fg    | 61 km/h | 23.5s +-1 |
-                                                                  # straight-right
-            | a    | l  | ad,dhk,klm,klm  | 60 km/h | 24s +-1   |
-                                                                  # straight-left
-            | l    | e  | klm,dhk,def,def | 59 km/h | 24.5s +-1 |
-                                                                  # double right
-            | g    | n  | fg,fim,mn,mn    | 57 km/h | 25s +-1   |
-                                                                  # double left
-
-    Scenario: Weighting based on turn penalty file
-        Given the turn penalty file
-            """
-            9,6,7,1.8
-            9,13,14,24.5
-            8,4,3,26
-            12,11,8,9
-            8,11,12,13
-            1,4,5,-0.2
-            """
-        And the contract extra arguments "--turn-penalty-file penalties.csv"
-        When I route I should get
-            | from | to | route                 | speed   | time      |
-            | a    | h  | ad,dhk,dhk            | 63 km/h | 11.5s +-1 |
-                                                                              # straight
-            | i    | g  | fim,fg,fg             | 55 km/h | 13s +-1   |
-                                                                              # right - ifg penalty
-            | a    | e  | ad,def,def            | 64 km/h | 11s +-1   |
-                                                                              # left - faster because of negative ade penalty
-            | c    | g  | cd,def,fg,fg          | 63 km/h | 23s +-1   |
-                                                                              # double straight
-            | p    | g  | mp,fim,fg,fg          | 59 km/h | 24.5s +-1 |
-                                                                              # straight-right - ifg penalty
-            | a    | l  | ad,def,fim,klm,klm    | 61 km/h | 35.5s +-1 |
-                                                                              # was straight-left - forced around by hkl penalty
-            | l    | e  | klm,fim,def,def       | 57 km/h | 25s +-1   |
-                                                                              # double right - forced left by lkh penalty
-            | g    | n  | fg,fim,mn,mn          | 30 km/h | 47.5s +-1 |
-                                                                              # double left - imn penalty
-            | j    | c  | jk,klm,fim,def,cd,cd  | 60 km/h | 48s +-1   |
-                                                                              # double left - hdc penalty ever so slightly higher than imn; forces all the way around
-
-    Scenario: Too-negative penalty clamps, but does not fail
-        Given the contract extra arguments "--turn-penalty-file penalties.csv"
-        And the profile "testbot"
-        And the turn penalty file
-            """
-            1,4,5,-10
-            """
-        When I route I should get
-            | from | to | route      | time    |
-            | a    | d  | ad,ad      | 10s +-1 |
-            | a    | e  | ad,def,def | 10s +-1 |
-            | b    | f  | bf,bf      | 10s +-1 |
-            | b    | g  | bf,fg,fg   | 20s +-1 |
@@ -5,7 +5,7 @@ Feature: Foot - Access tags on ways
    Background:
        Given the profile "foot"

-    Scenario: Foot - Access tag hierarchy on ways
+    Scenario: Foot - Access tag hierachy on ways
        Then routability should be
            | highway  | access | foot | bothw |
            | footway  |        |      | x     |
@@ -52,7 +52,6 @@ Feature: Foot - Access tags on ways
            | private      |              |       |
            | agricultural |              |       |
            | forestry     |              |       |
-            | delivery     |              |       |
            |              | yes          | x     |
            |              | permissive   | x     |
            |              | designated   | x     |
@@ -61,7 +60,6 @@ Feature: Foot - Access tags on ways
            |              | private      |       |
            |              | agricultural |       |
            |              | forestry     |       |
-            |              | delivery     |       |

    Scenario: Foot - Access tags on both node and way
        Then routability should be
@@ -5,7 +5,7 @@ Feature: Foot - Access tags on nodes
    Background:
        Given the profile "foot"

-    Scenario: Foot - Access tag hierarchy on nodes
+    Scenario: Foot - Access tag hierachy on nodes
        Then routability should be
            | node/access | node/foot | bothw |
            |             |           | x     |
@@ -40,7 +40,6 @@ Feature: Foot - Access tags on nodes
            | private      |              |       |
            | agricultural |              |       |
            | forestry     |              |       |
-            | delivery     |              |       |
            | no           | yes          | x     |
            | no           | permissive   | x     |
            | no           | designated   | x     |
@@ -49,4 +48,3 @@ Feature: Foot - Access tags on nodes
            | yes          | private      |       |
            | yes          | agricultural |       |
            | yes          | forestry     |       |
-            | yes          | delivery     |       |
@@ -10,13 +10,13 @@ Feature: Foot - Street names in instructions
            |   | c |

        And the ways
-            | nodes | name     | ref |
-            | ab    | My Way   | A6  |
-            | bc    | Your Way | B7  |
+            | nodes | name     |
+            | ab    | My Way   |
+            | bc    | Your Way |

        When I route I should get
-            | from | to | route                                   |
-            | a    | c  | My Way (A6),Your Way (B7),Your Way (B7) |
+            | from | to | route                    |
+            | a    | c  | My Way,Your Way,Your Way |

    @unnamed
    Scenario: Foot - Use way type to describe unnamed ways
@@ -14,7 +14,7 @@ Feature: Foot - Way ref

        When I route I should get
            | from | to | route                               |
-            | a    | b  | Utopia Drive (E7),Utopia Drive (E7) |
+            | a    | b  | Utopia Drive / E7,Utopia Drive / E7 |

    Scenario: Foot - Way with only ref
        Given the node map
@@ -1,120 +0,0 @@
-@routing @car @bridge @tunnel @guidance
-Feature: Car - Guidance - Bridges and Tunnels
-    Background:
-        Given the profile "car"
-        And a grid size of 100 meters
-
-    Scenario: Simple Bridge
-        Given the node map
-            | a | b | c | d |
-
-        And the ways
-            | nodes | highway | bridge | name               |
-            | ab    | primary |        | Hauptstraße        |
-            | bc    | primary | yes    | Hauptstraßenbrücke |
-            | cd    | primary |        | Hauptstraße        |
-
-        When I route I should get
-            | from | to | route                   | turns         |
-            | a    | d  | Hauptstraße,Hauptstraße | depart,arrive |
-
-    Scenario: Bridge with Immediate Turn
-        Given the node map
-            |   |   |   | d |
-            | a |   | b | c |
-            |   |   |   | e |
-
-        And the ways
-            | nodes | highway | bridge | name               |
-            | ab    | primary |        | Hauptstraße        |
-            | bc    | primary | yes    | Hauptstraßenbrücke |
-            | dce   | primary |        | Nebenstraße        |
-
-        When I route I should get
-            | from | to | route                                      | turns                           |
-            | a    | d  | Hauptstraße,Nebenstraße,Nebenstraße        | depart,end of road left,arrive  |
-            | a    | e  | Hauptstraße,Nebenstraße,Nebenstraße        | depart,end of road right,arrive |
-            | e    | a  | Nebenstraße,Hauptstraßenbrücke,Hauptstraße | depart,turn left,arrive         |
-            | d    | a  | Nebenstraße,Hauptstraßenbrücke,Hauptstraße | depart,turn right,arrive        |
-
-    Scenario: Bridge with Immediate Turn Front and Back
-        Given the node map
-            | f |   |   | d |
-            | a |   | b | c |
-            | g |   |   | e |
-
-        And the ways
-            | nodes | highway | bridge | name               |
-            | ab    | primary |        | Hauptstraße        |
-            | bc    | primary | yes    | Hauptstraßenbrücke |
-            | dce   | primary |        | Nebenstraße        |
-            | gaf   | primary |        | Anderestraße       |
-
-        When I route I should get
-            | from | to | route                                                    | turns                                      |
-            | f    | d  | Anderestraße,Hauptstraße,Nebenstraße,Nebenstraße         | depart,turn left,end of road left,arrive   |
-            | f    | e  | Anderestraße,Hauptstraße,Nebenstraße,Nebenstraße         | depart,turn left,end of road right,arrive  |
-            | g    | d  | Anderestraße,Hauptstraße,Nebenstraße,Nebenstraße         | depart,turn right,end of road left,arrive  |
-            | g    | e  | Anderestraße,Hauptstraße,Nebenstraße,Nebenstraße         | depart,turn right,end of road right,arrive |
-            | e    | f  | Nebenstraße,Hauptstraßenbrücke,Anderestraße,Anderestraße | depart,turn left,end of road right,arrive  |
-            | e    | g  | Nebenstraße,Hauptstraßenbrücke,Anderestraße,Anderestraße | depart,turn left,end of road left,arrive   |
-            | d    | f  | Nebenstraße,Hauptstraßenbrücke,Anderestraße,Anderestraße | depart,turn right,end of road right,arrive |
-            | d    | g  | Nebenstraße,Hauptstraßenbrücke,Anderestraße,Anderestraße | depart,turn right,end of road left,arrive  |
-
-    Scenario: Simple Tunnel
-        Given the node map
-            | a | b | c | d |
-
-        And the ways
-            | nodes | highway | tunnel | name               |
-            | ab    | primary |        | Hauptstraße        |
-            | bc    | primary | yes    | Hauptstraßentunnel |
-            | cd    | primary |        | Hauptstraße        |
-
-        When I route I should get
-            | from | to | route                   | turns         |
-            | a    | d  | Hauptstraße,Hauptstraße | depart,arrive |
-
-    Scenario: Tunnel with Immediate Turn
-        Given the node map
-            |   |   |   | d |
-            | a |   | b | c |
-            |   |   |   | e |
-
-        And the ways
-            | nodes | highway | tunnel | name               |
-            | ab    | primary |        | Hauptstraße        |
-            | bc    | primary | yes    | Hauptstraßentunnel |
-            | dce   | primary |        | Nebenstraße        |
-
-        When I route I should get
-            | from | to | route                                      | turns                           |
-            | a    | d  | Hauptstraße,Nebenstraße,Nebenstraße        | depart,end of road left,arrive  |
-            | a    | e  | Hauptstraße,Nebenstraße,Nebenstraße        | depart,end of road right,arrive |
-            | e    | a  | Nebenstraße,Hauptstraßentunnel,Hauptstraße | depart,turn left,arrive         |
-            | d    | a  | Nebenstraße,Hauptstraßentunnel,Hauptstraße | depart,turn right,arrive        |
-
-    Scenario: Tunnel with Immediate Turn Front and Back
-        Given the node map
-            | f |   |   | d |
-            | a |   | b | c |
-            | g |   |   | e |
-
-        And the ways
-            | nodes | highway | bridge | name               |
-            | ab    | primary |        | Hauptstraße        |
-            | bc    | primary | yes    | Hauptstraßentunnel |
-            | dce   | primary |        | Nebenstraße        |
-            | gaf   | primary |        | Anderestraße       |
-
-        When I route I should get
-            | from | to | route                                                    | turns                                      |
-            | f    | d  | Anderestraße,Hauptstraße,Nebenstraße,Nebenstraße         | depart,turn left,end of road left,arrive   |
-            | f    | e  | Anderestraße,Hauptstraße,Nebenstraße,Nebenstraße         | depart,turn left,end of road right,arrive  |
-            | g    | d  | Anderestraße,Hauptstraße,Nebenstraße,Nebenstraße         | depart,turn right,end of road left,arrive  |
-            | g    | e  | Anderestraße,Hauptstraße,Nebenstraße,Nebenstraße         | depart,turn right,end of road right,arrive |
-            | e    | f  | Nebenstraße,Hauptstraßentunnel,Anderestraße,Anderestraße | depart,turn left,end of road right,arrive  |
-            | e    | g  | Nebenstraße,Hauptstraßentunnel,Anderestraße,Anderestraße | depart,turn left,end of road left,arrive   |
-            | d    | f  | Nebenstraße,Hauptstraßentunnel,Anderestraße,Anderestraße | depart,turn right,end of road right,arrive |
-            | d    | g  | Nebenstraße,Hauptstraßentunnel,Anderestraße,Anderestraße | depart,turn right,end of road left,arrive  |
-
@@ -1,632 +0,0 @@
-@routing  @guidance @collapsing
-Feature: Collapse
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 20 meters
-
-    Scenario: Segregated Intersection, Cross Belonging to Single Street
-        Given the node map
-            |   |   | i | l |   |   |
-            |   |   |   |   |   |   |
-            | d |   | c | b |   | a |
-            | e |   | f | g |   | h |
-            |   |   |   |   |   |   |
-            |   |   | j | k |   |   |
-
-        And the ways
-            | nodes | highway | name   | oneway |
-            | ab    | primary | first  | yes    |
-            | bc    | primary | first  | yes    |
-            | cd    | primary | first  | yes    |
-            | ef    | primary | first  | yes    |
-            | fg    | primary | first  | yes    |
-            | gh    | primary | first  | yes    |
-            | ic    | primary | second | yes    |
-            | bl    | primary | second | yes    |
-            | kg    | primary | second | yes    |
-            | fj    | primary | second | yes    |
-            | cf    | primary | first  | yes    |
-            | gb    | primary | first  | yes    |
-
-       When I route I should get
-            | waypoints | route                | turns                        |
-            | a,l       | first,second,second  | depart,turn right,arrive     |
-            | a,d       | first,first          | depart,arrive                |
-            | a,j       | first,second,second  | depart,turn left,arrive      |
-            | a,h       | first,first,first    | depart,continue uturn,arrive |
-            | e,j       | first,second,second  | depart,turn right,arrive     |
-            | e,h       | first,first          | depart,arrive                |
-            | e,l       | first,second,second  | depart,turn left,arrive      |
-            | e,d       | first,first,first    | depart,continue uturn,arrive |
-            | k,h       | second,first,first   | depart,turn right,arrive     |
-            | k,l       | second,second        | depart,arrive                |
-            | k,d       | second,first,first   | depart,turn left,arrive      |
-            | k,j       | second,second,second | depart,continue uturn,arrive |
-            | i,d       | second,first,first   | depart,turn right,arrive     |
-            | i,j       | second,second        | depart,arrive                |
-            | i,h       | second,first,first   | depart,turn left,arrive      |
-            | i,l       | second,second,second | depart,continue uturn,arrive |
-
-    Scenario: Segregated Intersection, Cross Belonging to Correct Street
-        Given the node map
-            |   |   | i | l |   |   |
-            |   |   |   |   |   |   |
-            | d |   | c | b |   | a |
-            | e |   | f | g |   | h |
-            |   |   |   |   |   |   |
-            |   |   | j | k |   |   |
-
-        And the ways
-            | nodes | highway | name   | oneway |
-            | ab    | primary | first  | yes    |
-            | bc    | primary | first  | yes    |
-            | cd    | primary | first  | yes    |
-            | ef    | primary | first  | yes    |
-            | fg    | primary | first  | yes    |
-            | gh    | primary | first  | yes    |
-            | ic    | primary | second | yes    |
-            | bl    | primary | second | yes    |
-            | kg    | primary | second | yes    |
-            | fj    | primary | second | yes    |
-            | cf    | primary | second | yes    |
-            | gb    | primary | second | yes    |
-
-       When I route I should get
-            | waypoints | route                | turns                        |
-            | a,l       | first,second,second  | depart,turn right,arrive     |
-            | a,d       | first,first          | depart,arrive                |
-            | a,j       | first,second,second  | depart,turn left,arrive      |
-            | a,h       | first,first,first    | depart,continue uturn,arrive |
-            | e,j       | first,second,second  | depart,turn right,arrive     |
-            | e,h       | first,first          | depart,arrive                |
-            | e,l       | first,second,second  | depart,turn left,arrive      |
-            | e,d       | first,first,first    | depart,continue uturn,arrive |
-            | k,h       | second,first,first   | depart,turn right,arrive     |
-            | k,l       | second,second        | depart,arrive                |
-            | k,d       | second,first,first   | depart,turn left,arrive      |
-            | k,j       | second,second,second | depart,continue uturn,arrive |
-            | i,d       | second,first,first   | depart,turn right,arrive     |
-            | i,j       | second,second        | depart,arrive                |
-            | i,h       | second,first,first   | depart,turn left,arrive      |
-            | i,l       | second,second,second | depart,continue uturn,arrive |
-
-    Scenario: Segregated Intersection, Cross Belonging to Mixed Streets
-        Given the node map
-            |   |   | i | l |   |   |
-            |   |   |   |   |   |   |
-            | d |   | c | b |   | a |
-            | e |   | f | g |   | h |
-            |   |   |   |   |   |   |
-            |   |   | j | k |   |   |
-
-        And the ways
-            | nodes | highway | name   | oneway |
-            | ab    | primary | first  | yes    |
-            | bc    | primary | second | yes    |
-            | cd    | primary | first  | yes    |
-            | ef    | primary | first  | yes    |
-            | fg    | primary | first  | yes    |
-            | gh    | primary | first  | yes    |
-            | ic    | primary | second | yes    |
-            | bl    | primary | second | yes    |
-            | kg    | primary | second | yes    |
-            | fj    | primary | second | yes    |
-            | cf    | primary | second | yes    |
-            | gb    | primary | first  | yes    |
-
-       When I route I should get
-            | waypoints | route                | turns                        |
-            | a,l       | first,second,second  | depart,turn right,arrive     |
-            | a,d       | first,first          | depart,arrive                |
-            | a,j       | first,second,second  | depart,turn left,arrive      |
-            | a,h       | first,first,first    | depart,continue uturn,arrive |
-            | e,j       | first,second,second  | depart,turn right,arrive     |
-            | e,h       | first,first          | depart,arrive                |
-            | e,l       | first,second,second  | depart,turn left,arrive      |
-            | e,d       | first,first,first    | depart,continue uturn,arrive |
-            | k,h       | second,first,first   | depart,turn right,arrive     |
-            | k,l       | second,second        | depart,arrive                |
-            | k,d       | second,first,first   | depart,turn left,arrive      |
-            | k,j       | second,second,second | depart,continue uturn,arrive |
-            | i,d       | second,first,first   | depart,turn right,arrive     |
-            | i,j       | second,second        | depart,arrive                |
-            | i,h       | second,first,first   | depart,turn left,arrive      |
-            | i,l       | second,second,second | depart,continue uturn,arrive |
-
-    Scenario: Partly Segregated Intersection, Two Segregated Roads
-        Given the node map
-            |   | g |   | h |   |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            | c |   | b |   | a |
-            | d |   | e |   | f |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            |   | j |   | i |   |
-
-        And the ways
-            | nodes | highway | name   | oneway |
-            | ab    | primary | first  | yes    |
-            | bc    | primary | first  | yes    |
-            | de    | primary | first  | yes    |
-            | ef    | primary | first  | yes    |
-            | be    | primary | first  | no     |
-            | gbh   | primary | second | yes    |
-            | iej   | primary | second | yes    |
-
-       When I route I should get
-            | waypoints | route                | turns                        |
-            | a,h       | first,second,second  | depart,turn right,arrive     |
-            | a,c       | first,first          | depart,arrive                |
-            | a,j       | first,second,second  | depart,turn left,arrive      |
-            | a,f       | first,first,first    | depart,continue uturn,arrive |
-            | d,j       | first,second,second  | depart,turn right,arrive     |
-            | d,f       | first,first          | depart,arrive                |
-            | d,h       | first,second,second  | depart,turn left,arrive      |
-            | d,c       | first,first,first    | depart,continue uturn,arrive |
-            | g,c       | second,first,first   | depart,turn right,arrive     |
-            | g,j       | second,second        | depart,arrive                |
-            | g,f       | second,first,first   | depart,turn left,arrive      |
-            | g,h       | second,second,second | depart,continue uturn,arrive |
-            | i,f       | second,first,first   | depart,turn right,arrive     |
-            | i,h       | second,second        | depart,arrive                |
-            | i,c       | second,first,first   | depart,turn left,arrive      |
-            | i,j       | second,second,second | depart,continue uturn,arrive |
-
-    Scenario: Partly Segregated Intersection, Two Segregated Roads, Intersection belongs to Second
-        Given the node map
-            |   | g |   | h |   |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            | c |   | b |   | a |
-            | d |   | e |   | f |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            |   | j |   | i |   |
-
-        And the ways
-            | nodes | highway | name   | oneway |
-            | ab    | primary | first  | yes    |
-            | bc    | primary | first  | yes    |
-            | de    | primary | first  | yes    |
-            | ef    | primary | first  | yes    |
-            | be    | primary | second | no     |
-            | gbh   | primary | second | yes    |
-            | iej   | primary | second | yes    |
-
-       When I route I should get
-            | waypoints | route                | turns                        |
-            | a,h       | first,second,second  | depart,turn right,arrive     |
-            | a,c       | first,first          | depart,arrive                |
-            | a,j       | first,second,second  | depart,turn left,arrive      |
-            | a,f       | first,first,first    | depart,continue uturn,arrive |
-            | d,j       | first,second,second  | depart,turn right,arrive     |
-            | d,f       | first,first          | depart,arrive                |
-            | d,h       | first,second,second  | depart,turn left,arrive      |
-            | d,c       | first,first,first    | depart,continue uturn,arrive |
-            | g,c       | second,first,first   | depart,turn right,arrive     |
-            | g,j       | second,second        | depart,arrive                |
-            | g,f       | second,first,first   | depart,turn left,arrive      |
-            | g,h       | second,second,second | depart,continue uturn,arrive |
-            | i,f       | second,first,first   | depart,turn right,arrive     |
-            | i,h       | second,second        | depart,arrive                |
-            | i,c       | second,first,first   | depart,turn left,arrive      |
-            | i,j       | second,second,second | depart,continue uturn,arrive |
-
-    Scenario: Segregated Intersection, Cross Belonging to Mixed Streets - Slight Angles
-        Given the node map
-            |   |   | i | l |   |   |
-            |   |   |   |   |   | a |
-            |   |   | c | b |   | h |
-            | d |   | f | g |   |   |
-            | e |   |   |   |   |   |
-            |   |   | j | k |   |   |
-
-        And the ways
-            | nodes | highway | name   | oneway |
-            | ab    | primary | first  | yes    |
-            | bc    | primary | second | yes    |
-            | cd    | primary | first  | yes    |
-            | ef    | primary | first  | yes    |
-            | fg    | primary | first  | yes    |
-            | gh    | primary | first  | yes    |
-            | ic    | primary | second | yes    |
-            | bl    | primary | second | yes    |
-            | kg    | primary | second | yes    |
-            | fj    | primary | second | yes    |
-            | cf    | primary | second | yes    |
-            | gb    | primary | first  | yes    |
-
-       When I route I should get
-            | waypoints | route                | turns                        |
-            | a,l       | first,second,second  | depart,turn right,arrive     |
-            | a,d       | first,first          | depart,arrive                |
-            | a,j       | first,second,second  | depart,turn left,arrive      |
-            | a,h       | first,first,first    | depart,continue uturn,arrive |
-            | e,j       | first,second,second  | depart,turn right,arrive     |
-            | e,h       | first,first          | depart,arrive                |
-            | e,l       | first,second,second  | depart,turn left,arrive      |
-            | e,d       | first,first,first    | depart,continue uturn,arrive |
-            | k,h       | second,first,first   | depart,turn right,arrive     |
-            | k,l       | second,second        | depart,arrive                |
-            | k,d       | second,first,first   | depart,turn left,arrive      |
-            | k,j       | second,second,second | depart,continue uturn,arrive |
-            | i,d       | second,first,first   | depart,turn right,arrive     |
-            | i,j       | second,second        | depart,arrive                |
-            | i,h       | second,first,first   | depart,turn left,arrive      |
-            | i,l       | second,second,second | depart,continue uturn,arrive |
-
-    Scenario: Segregated Intersection, Cross Belonging to Mixed Streets - Slight Angles (2)
-        Given the node map
-            |   |   | i | l |   |   |
-            |   |   |   |   |   |   |
-            |   |   | c | b |   |   |
-            | d |   | f | g |   | a |
-            | e |   |   |   |   | h |
-            |   |   | j | k |   |   |
-
-        And the ways
-            | nodes | highway | name   | oneway |
-            | ab    | primary | first  | yes    |
-            | bc    | primary | second | yes    |
-            | cd    | primary | first  | yes    |
-            | ef    | primary | first  | yes    |
-            | fg    | primary | first  | yes    |
-            | gh    | primary | first  | yes    |
-            | ic    | primary | second | yes    |
-            | bl    | primary | second | yes    |
-            | kg    | primary | second | yes    |
-            | fj    | primary | second | yes    |
-            | cf    | primary | second | yes    |
-            | gb    | primary | first  | yes    |
-
-       When I route I should get
-            | waypoints | route                | turns                        |
-            | a,l       | first,second,second  | depart,turn right,arrive     |
-            | a,d       | first,first          | depart,arrive                |
-            | a,j       | first,second,second  | depart,turn left,arrive      |
-            | a,h       | first,first,first    | depart,continue uturn,arrive |
-            | e,j       | first,second,second  | depart,turn right,arrive     |
-            | e,h       | first,first          | depart,arrive                |
-            | e,l       | first,second,second  | depart,turn left,arrive      |
-            | e,d       | first,first,first    | depart,continue uturn,arrive |
-            | k,h       | second,first,first   | depart,turn right,arrive     |
-            | k,l       | second,second        | depart,arrive                |
-            | k,d       | second,first,first   | depart,turn left,arrive      |
-            | k,j       | second,second,second | depart,continue uturn,arrive |
-            | i,d       | second,first,first   | depart,turn right,arrive     |
-            | i,j       | second,second        | depart,arrive                |
-            | i,h       | second,first,first   | depart,turn left,arrive      |
-            | i,l       | second,second,second | depart,continue uturn,arrive |
-
-    Scenario: Entering a segregated road
-        Given the node map
-            |   | a | f |   |   |
-            |   |   |   |   | g |
-            |   | b | e |   |   |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            | c | d |   |   |   |
-
-        And the ways
-            | nodes | highway | name   | oneway |
-            | abc   | primary | first  | yes    |
-            | def   | primary | first  | yes    |
-            | be    | primary | first  | no     |
-            | ge    | primary | second | no     |
-
-        When I route I should get
-            | waypoints | route               | turns                          |
-            | d,c       | first,first,first   | depart,continue uturn,arrive   |
-            | a,f       | first,first,first   | depart,continue uturn,arrive   |
-            | a,g       | first,second,second | depart,turn left,arrive        |
-            | d,g       | first,second,second | depart,turn right,arrive       |
-            | g,f       | second,first,first  | depart,turn right,arrive       |
-            | g,c       | second,first,first  | depart,end of road left,arrive |
-
-
-    Scenario: Do not collapse turning roads
-        Given the node map
-            |   |   | e |   |   |
-            |   |   | c |   | d |
-            | a |   | b | f |   |
-
-        And the ways
-            | nodes | highway | name   |
-            | ab    | primary | first  |
-            | bc    | primary | first  |
-            | cd    | primary | first  |
-            | ce    | primary | second |
-            | bf    | primary | third  |
-
-        When I route I should get
-            | waypoints | route                   | turns                                      |
-            | a,d       | first,first,first,first | depart,continue left,continue right,arrive |
-            | a,e       | first,second,second     | depart,turn left,arrive                    |
-            | a,f       | first,third,third       | depart,turn straight,arrive                |
-
-     Scenario: Bridge on unnamed road
-        Given the node map
-            | a | b |   |   |   | c | d |
-
-        And the ways
-            | nodes | highway | name   |
-            | ab    | primary |        |
-            | bc    | primary | Bridge |
-            | cd    | primary |        |
-
-        When I route I should get
-            | waypoints | route | turns         |
-            | a,d       | ,     | depart,arrive |
-
-     Scenario: Crossing Bridge into Segregated Turn
-        Given the node map
-            |   |   |   |   |   | f |
-            | i | h |   |   | g | e |
-            | a | b |   |   | c | d |
-
-        And the ways
-            | nodes | highway | oneway | name        |
-            | ab    | primary | yes    | to_bridge   |
-            | bc    | primary | yes    | bridge      |
-            | cd    | primary | yes    | off_bridge  |
-            | de    | primary | yes    |             |
-            | ef    | primary | no     | target_road |
-            | eg    | primary | yes    | off_bridge  |
-            | gh    | primary | yes    | bridge      |
-            | hi    | primary | yes    | to_bridge   |
-
-        When I route I should get
-            | waypoints | route                             | turns                   |
-            | a,f       | to_bridge,target_road,target_road | depart,turn left,arrive |
-
-    Scenario: Pankenbruecke
-        Given the node map
-            | h |   |   |   |   |   | i |   |   |   |   |   |   |
-            |   |   | b | c | d | e | f |   |   |   |   |   | g |
-            | a |   |   |   |   |   |   |   |   |   |   |   |   |
-
-        And the ways
-            | nodes | highway | name    | oneway |
-            | abh   | primary | inroad  | yes    |
-            | bc    | primary | inroad  | no     |
-            | cd    | primary | bridge  | no     |
-            | defg  | primary | outroad | no     |
-            | fi    | primary | cross   | no     |
-
-       When I route I should get
-            | waypoints | route                  | turns                           |
-            | a,g       | inroad,outroad,outroad | depart,new name straight,arrive |
-            | a,i       | inroad,cross,cross     | depart,turn left,arrive         |
-
-     Scenario: Close Turns - Don't Collapse
-        Given the node map
-            |   | g | d |   |
-            |   |   |   |   |
-            | e | b | c | f |
-            |   |   |   |   |
-            |   | a | h |   |
-
-        And the ways
-            | nodes | highway | name     |
-            | ab    | primary | in       |
-            | ebcf  | primary | cross    |
-            | cd    | primary | out      |
-            | bg    | primary | straight |
-            | ch    | primary | reverse  |
-
-        When I route I should get
-            | waypoints | route                    | turns                               |
-            | a,d       | in,cross,out,out         | depart,turn right,turn left,arrive  |
-            | a,h       | in,cross,reverse,reverse | depart,turn right,turn right,arrive |
-            | g,d       | straight,cross,out,out   | depart,turn left,turn left,arrive   |
-
-     Scenario: No Name During Turns
-        Given the node map
-            | a | b |   |
-            |   | c | d |
-
-        And the ways
-            | nodes | highway  | name |
-            | ab    | tertiary | road |
-            | bc    | tertiary |      |
-            | cd    | tertiary | road |
-
-        When I route I should get
-            | waypoints | route     | turns         |
-            | a,d       | road,road | depart,arrive |
-
-    Scenario: No Name During Turns, Random Oneway
-        Given the node map
-            | a | b |   |
-            |   | c | d |
-
-        And the ways
-            | nodes | highway  | name | oneway |
-            | ab    | tertiary | road | no     |
-            | bc    | tertiary |      | yes    |
-            | cd    | tertiary | road | no     |
-
-        When I route I should get
-            | waypoints | route     | turns         |
-            | a,d       | road,road | depart,arrive |
-
-    Scenario: Pulled Back Turn
-        Given the node map
-            |   |   | d |
-            | a | b | c |
-            |   | e |   |
-
-        And the ways
-            | nodes | highway  | name  |
-            | abc   | tertiary | road  |
-            | cd    | tertiary | left  |
-            | be    | tertiary | right |
-
-        When I route I should get
-            | waypoints | route            | turns                    |
-            | a,d       | road,left,left   | depart,turn left,arrive  |
-            | a,e       | road,right,right | depart,turn right,arrive |
-
-    Scenario: No Name During Turns, keep important turns
-        Given the node map
-            | a | b | e |
-            |   | c | d |
-
-        And the ways
-            | nodes | highway  | name  |
-            | ab    | tertiary | road  |
-            | bc    | tertiary |       |
-            | cd    | tertiary | road  |
-            | be    | tertiary | other |
-
-        When I route I should get
-            | waypoints | route          | turns                        |
-            | a,d       | road,road,road | depart,continue right,arrive |
-
-    Scenario: Segregated Intersection into Slight Turn
-        Given the node map
-            | h |   |   |   |   |   |   |
-            | a |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |
-            |   |   | g |   |   |   |   |
-            |   |   | b | f |   |   |   |
-            |   |   |   | c |   |   |   |
-            |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   | e |
-            |   |   |   |   |   |   | d |
-            |   |   | j | i |   |   |   |
-
-        And the ways
-            | nodes | highway   | name | oneway |
-            | abcd  | primary   | road | yes    |
-            | efgh  | primary   | road | yes    |
-            | icf   | secondary | in   | yes    |
-            | gbj   | secondary | out  | yes    |
-
-        When I route I should get
-            | waypoints | route        | turns                           |
-            | i,h       | in,road,road | depart,turn slight left,arrive  |
-            | a,d       | road,road    | depart,arrive                   |
-            | a,j       | road,out,out | depart,turn slight right,arrive |
-
-    Scenario: Don't collapse everything to u-turn / too wide
-        Given the node map
-            | a |   | b |   | e |
-            |   |   |   |   |   |
-            | d |   | c |   | f |
-
-        And the ways
-            | nodes | highway   | name   |
-            | abcd  | primary   | road   |
-            | be    | secondary | top    |
-            | cf    | secondary | bottom |
-
-        When I route I should get
-            | waypoints | turns                                          | route               |
-            | a,d       | depart,continue right,end of road right,arrive | road,road,road,road |
-            | d,a       | depart,continue left,end of road left,arrive   | road,road,road,road |
-
-    Scenario: Forking before a turn
-        Given the node map
-            |   |   |   | g |   |
-            |   |   |   |   |   |
-            |   |   |   | c |   |
-            | a |   | b | d | e |
-            |   |   |   |   |   |
-            |   |   |   | f |   |
-
-        And the ways
-            | nodes | name  | oneway | highway   |
-            | ab    | road  | yes    | primary   |
-            | bd    | road  | yes    | primary   |
-            | bc    | road  | yes    | primary   |
-            | de    | road  | yes    | primary   |
-            | fdcg  | cross | no     | secondary |
-
-        And the relations
-            | type        | way:from | way:to | node:via | restriction   |
-            | restriction | bd       | fdcg   | d        | no_left_turn  |
-            | restriction | bc       | fdcg   | c        | no_right_turn |
-
-        When I route I should get
-          | waypoints | route            | turns                   |
-          | a,g       | road,cross,cross | depart,turn left,arrive |
-          | a,e       | road,road        | depart,arrive           |
-
-    Scenario: Forking before a turn (narrow)
-        Given the node map
-            |   |   |   | g |   |
-            |   |   |   |   |   |
-            |   |   |   | c |   |
-            | a | b |   | d | e |
-            |   |   |   |   |   |
-            |   |   |   | f |   |
-
-        And the ways
-            | nodes | name  | oneway | highway   |
-            | ab    | road  | yes    | primary   |
-            | bd    | road  | yes    | primary   |
-            | bc    | road  | yes    | primary   |
-            | de    | road  | yes    | primary   |
-            | fdcg  | cross | no     | secondary |
-
-        And the relations
-            | type        | way:from | way:to | node:via | restriction   |
-            | restriction | bd       | fdcg   | d        | no_left_turn  |
-            | restriction | bc       | fdcg   | c        | no_right_turn |
-
-        When I route I should get
-          | waypoints | route            | turns                   |
-          | a,g       | road,cross,cross | depart,turn left,arrive |
-          | a,e       | road,road        | depart,arrive           |
-
-    Scenario: Forking before a turn (forky)
-        Given the node map
-            |   |   |   | g |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   | c |   |   |
-            | a | b |   |   |   |   |
-            |   |   |   |   | d |   |
-            |   |   |   |   | f | e |
-
-        And the ways
-            | nodes | name  | oneway | highway   |
-            | ab    | road  | yes    | primary   |
-            | bd    | road  | yes    | primary   |
-            | bc    | road  | yes    | primary   |
-            | de    | road  | yes    | primary   |
-            | fdcg  | cross | no     | secondary |
-
-        And the relations
-            | type        | way:from | way:to | node:via | restriction   |
-            | restriction | bd       | fdcg   | d        | no_left_turn  |
-            | restriction | bc       | fdcg   | c        | no_right_turn |
-
-        When I route I should get
-          | waypoints | route                 | turns                                          |
-          | a,g       | road,cross,cross      | depart,turn left,arrive                        |
-          | a,e       | road,road,road        | depart,continue slight right,arrive            |
-          # We should discuss whether the next item should be collapsed to depart,turn right,arrive.
-          | a,f       | road,road,cross,cross | depart,continue slight right,turn right,arrive |
-
-     Scenario: On-Off on Highway
-        Given the node map
-            | f |   |   |   |
-            | a | b | c | d |
-            |   |   |   | e |
-
-        And the ways
-            | nodes | name | highway       | oneway |
-            | abcd  | Hwy  | motorway      | yes    |
-            | fb    | on   | motorway_link | yes    |
-            | ce    | off  | motorway_link | yes    |
-
-        When I route I should get
-            | waypoints | route          | turns                                           |
-            | a,d       | Hwy,Hwy        | depart,arrive                                   |
-            | f,d       | on,Hwy,Hwy     | depart,merge slight right,arrive                |
-            | f,e       | on,Hwy,off,off | depart,merge slight right,off ramp right,arrive |
-            | a,e       | Hwy,off,off    | depart,off ramp right,arrive                    |
@@ -1,123 +0,0 @@
-@routing  @guidance
-Feature: Continue Instructions
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 10 meters
-
-    Scenario: Road turning left
-        Given the node map
-            |   |   | c |   |
-            | a |   | b | d |
-
-        And the ways
-            | nodes  | highway |
-            | abc    | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route       | turns                       |
-            | a,c       | abc,abc,abc | depart,continue left,arrive |
-            | a,d       | abc,bd,bd   | depart,turn straight,arrive |
-
-    Scenario: Road turning left and straight
-        Given the node map
-            |   |   | c |   |
-            | a |   | b | d |
-
-        And the ways
-            | nodes  | highway | name |
-            | abc    | primary | road |
-            | bd     | primary | road |
-
-       When I route I should get
-            | waypoints | route          | turns                       |
-            | a,c       | road,road,road | depart,continue left,arrive |
-            | a,d       | road,road      | depart,arrive               |
-
-    Scenario: Road turning left and straight
-        Given the node map
-            |   |   | c |   |
-            | a |   | b | d |
-            |   |   | e |   |
-
-        And the ways
-            | nodes  | highway | name |
-            | abc    | primary | road |
-            | bd     | primary | road |
-            | be     | primary | road |
-
-       When I route I should get
-            | waypoints | route          | turns                        |
-            | a,c       | road,road,road | depart,continue left,arrive  |
-            | a,d       | road,road      | depart,arrive                |
-            | a,e       | road,road,road | depart,continue right,arrive |
-
-    Scenario: Road turning right
-        Given the node map
-            | a |   | b | d |
-            |   |   | c |   |
-
-        And the ways
-            | nodes  | highway |
-            | abc    | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route       | turns                        |
-            | a,c       | abc,abc,abc | depart,continue right,arrive |
-            | a,d       | abc,bd,bd   | depart,turn straight,arrive  |
-
-    Scenario: Road turning slight left
-        Given the node map
-            |   |   |   |   | c |
-            |   |   |   |   |   |
-            | a |   | b |   |   |
-            |   |   |   | d |   |
-
-        And the ways
-            | nodes  | highway |
-            | abc    | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route       | turns                       |
-            | a,c       | abc,abc,abc | depart,continue left,arrive |
-            | a,d       | abc,bd,bd   | depart,turn right,arrive    |
-
-    Scenario: Road turning slight right
-        Given the node map
-            |   |   |   | d |   |
-            | a |   | b |   |   |
-            |   |   |   |   |   |
-            |   |   |   |   | c |
-
-        And the ways
-            | nodes  | highway |
-            | abc    | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route       | turns                        |
-            | a,c       | abc,abc,abc | depart,continue right,arrive |
-            | a,d       | abc,bd,bd   | depart,turn left,arrive      |
-
-    Scenario: Road Loop
-       Given the node map
-           |   |   | f |   | e |
-           |   |   |   |   |   |
-           | a |   | b | g |   |
-           |   |   |   |   |   |
-           |   |   | c |   | d |
-
-       And the ways
-          | nodes   | highway |
-          | abcdefb | primary |
-          | bg      | primary |
-
-       When I route I should get
-          | waypoints | route                   | turns                        |
-          | a,c       | abcdefb,abcdefb,abcdefb | depart,continue right,arrive |
-          | a,f       | abcdefb,abcdefb,abcdefb | depart,continue left,arrive  |
-          | a,d       | abcdefb,abcdefb,abcdefb | depart,continue right,arrive |
-          | a,e       | abcdefb,abcdefb,abcdefb | depart,continue left,arrive  |
@@ -1,125 +0,0 @@
-@routing  @guidance
-Feature: Slipways and Dedicated Turn Lanes
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 5 meters
-
-    Scenario: Turn Instead of Ramp
-        Given the node map
-            |   |   |   |   | e |   |
-            | a | b |   |   | c | d |
-            |   |   |   | h |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   | 1 |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   | f |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   | g |   |
-
-        And the ways
-            | nodes | highway    | name   |
-            | abcd  | trunk      | first  |
-            | bhf   | trunk_link |        |
-            | ecfg  | primary    | second |
-
-        And the relations
-            | type        | way:from | way:to | node:via | restriction   |
-            | restriction | abcd     | ecfg   | c        | no_right_turn |
-
-       When I route I should get
-            | waypoints | route               | turns                           |
-            | a,g       | first,second,second | depart,turn right,arrive        |
-            | a,1       | first,,             | depart,turn slight right,arrive |
-
-    Scenario: Turn Instead of Ramp
-        Given the node map
-            |   |   |   |   | e |   |
-            | a | b |   |   | c | d |
-            |   |   |   | h |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   | f |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   | g |   |
-
-        And the ways
-            | nodes | highway       | name   |
-            | abcd  | motorway      | first  |
-            | bhf   | motorway_link |        |
-            | efg   | primary       | second |
-
-       When I route I should get
-            | waypoints | route                | turns                                                 |
-            | a,g       | first,,second,second | depart,off ramp slight right,merge slight left,arrive |
-
-    Scenario: Inner city expressway with on road
-        Given the node map
-            | a | b |   |   |   | c |
-            |   |   |   |   | f |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   | d |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   | e |
-
-        And the ways
-            | nodes | highway      | name  |
-            | abc   | primary      | road  |
-            | bfd   | trunk_link   |       |
-            | cde   | trunk        | trunk |
-
-        And the relations
-            | type        | way:from | way:to | node:via | restriction   |
-            | restriction | abc      | cde    | c        | no_right_turn |
-
-       When I route I should get
-            | waypoints | route                | turns                    |
-            | a,e       | road,trunk,trunk     | depart,turn right,arrive |
-
-
-    Scenario: Slipway Round U-Turn
-        Given the node map
-            | a |   | f |
-            |   |   |   |
-            | b |   | e |
-            |   |   |   |
-            |   |   |   |
-            |   | g |   |
-            |   |   |   |
-            | c |   | d |
-
-        And the ways
-            | nodes | highway      | name | oneway |
-            | abc   | primary      | road | yes    |
-            | bge   | primary_link |      | yes    |
-            | def   | primary      | road | yes    |
-
-       When I route I should get
-            | waypoints | route          | turns                        |
-            | a,f       | road,road,road | depart,continue uturn,arrive |
-
-    Scenario: Slipway Steep U-Turn
-        Given the node map
-            | a |   | f |
-            |   |   |   |
-            | b |   | e |
-            |   | g |   |
-            |   |   |   |
-            |   |   |   |
-            | c |   | d |
-
-        And the ways
-            | nodes | highway      | name | oneway |
-            | abc   | primary      | road | yes    |
-            | bge   | primary_link |      | yes    |
-            | def   | primary      | road | yes    |
-
-       When I route I should get
-            | waypoints | route          | turns                        |
-            | a,f       | road,road,road | depart,continue uturn,arrive |
@@ -1,41 +0,0 @@
-@routing @guidance
-Feature: Destination Signs
-
-    Background:
-        Given the profile "car"
-
-    Scenario: Car - route name assembly with destination signs
-        Given the node map
-          | a | b |
-          | c | d |
-          | e | f |
-          | g | h |
-          | i | j |
-          | k | l |
-          | m | n |
-          | o | p |
-          | q | r |
-
-        And the ways
-          | nodes | name | ref | destination    | destination:ref | oneway | #                                    |
-          | ab    | AB   | E1  |                |                 | yes    |                                      |
-          | cd    | CD   |     | Berlin         |                 | yes    |                                      |
-          | ef    | EF   |     | Berlin         | A1              | yes    |                                      |
-          | gh    |      |     | Berlin         | A1              | yes    |                                      |
-          | ij    |      |     | Berlin         |                 | yes    |                                      |
-          | kl    | KL   | E1  | Berlin         | A1              | yes    |                                      |
-          | mn    | MN   |     | Berlin;Hamburg | A1;A2           | yes    |                                      |
-          | op    | OP   |     | Berlin;Hamburg | A1;A2           | no     | mis-tagged destination: not a oneway |
-          | qr    | QR   |     |                | A1;A2           | yes    |                                      |
-
-        When I route I should get
-          | from | to | route                                                     | destinations                                    | #                         |
-          | a    | b  | AB (E1),AB (E1)                                           | ,                                               |                           |
-          | c    | d  | CD (Berlin),CD (Berlin)                                   | Berlin,Berlin                                   |                           |
-          | e    | f  | EF (A1: Berlin),EF (A1: Berlin)                           | A1: Berlin,A1: Berlin                           |                           |
-          | g    | h  | ,                                                         | A1: Berlin,A1: Berlin                           |                           |
-          | i    | j  | ,                                                         | Berlin,Berlin                                   |                           |
-          | k    | l  | KL (E1),KL (E1)                                           | A1: Berlin,A1: Berlin                           |                           |
-          | m    | n  | MN (A1, A2: Berlin, Hamburg),MN (A1, A2: Berlin, Hamburg) | A1, A2: Berlin, Hamburg,A1, A2: Berlin, Hamburg |                           |
-          | o    | p  | OP,OP                                                     | ,                                               | guard against mis-tagging |
-          | q    | r  | QR (A1, A2),QR (A1, A2)                                   | A1, A2,A1, A2                                   |                           |
@@ -1,123 +0,0 @@
-@routing  @guidance
-Feature: End Of Road Instructions
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 10 meters
-
-    Scenario: End of Road with through street
-        Given the node map
-            |   |   | c |
-            | a |   | b |
-            |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | cbd    | primary |
-
-       When I route I should get
-            | waypoints | route      | turns                           |
-            | a,c       | ab,cbd,cbd | depart,end of road left,arrive  |
-            | a,d       | ab,cbd,cbd | depart,end of road right,arrive |
-
-    Scenario: End of Road with three streets
-        Given the node map
-            |   |   | c |
-            | a |   | b |
-            |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | cb     | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,cb,cb | depart,end of road left,arrive  |
-            | a,d       | ab,bd,bd | depart,end of road right,arrive |
-
-    Scenario: End of Road with three streets, slightly angled
-        Given the node map
-            | a |   |   |   |   | c |
-            |   |   |   |   |   | b |
-            |   |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | cb     | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,cb,cb | depart,end of road left,arrive  |
-            | a,d       | ab,bd,bd | depart,end of road right,arrive |
-
-    Scenario: End of Road with three streets, slightly angled
-        Given the node map
-            |   |   |   |   |   | c |
-            |   |   |   |   |   | b |
-            | a |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | cb     | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,cb,cb | depart,end of road left,arrive  |
-            | a,d       | ab,bd,bd | depart,end of road right,arrive |
-
-    Scenario: End of Road with through street, slightly angled
-        Given the node map
-            | a |   |   |   |   | c |
-            |   |   |   |   |   | b |
-            |   |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | cbd    | primary |
-
-       When I route I should get
-            | waypoints | route      | turns                           |
-            | a,c       | ab,cbd,cbd | depart,end of road left,arrive  |
-            | a,d       | ab,cbd,cbd | depart,end of road right,arrive |
-
-    Scenario: End of Road with through street, slightly angled
-        Given the node map
-            |   |   |   |   |   | c |
-            |   |   |   |   |   | b |
-            | a |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | cbd    | primary |
-
-       When I route I should get
-            | waypoints | route      | turns                           |
-            | a,c       | ab,cbd,cbd | depart,end of road left,arrive  |
-            | a,d       | ab,cbd,cbd | depart,end of road right,arrive |
-
-    Scenario: End of Road with two ramps - prefer ramp over end of road
-        Given the node map
-            |   |   | c |
-            | a |   | b |
-            |   |   | d |
-
-        And the ways
-            | nodes  | highway       |
-            | ab     | primary       |
-            | bc     | motorway_link |
-            | bd     | motorway_link |
-
-       When I route I should get
-            | waypoints | route    | turns                       |
-            | a,c       | ab,bc,bc | depart,on ramp left,arrive  |
-            | a,d       | ab,bd,bd | depart,on ramp right,arrive |
-
@@ -1,298 +0,0 @@
-@routing  @guidance
-Feature: Fork Instructions
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 10 meters
-
-    Scenario: Fork Same Road Class
-        Given the node map
-            |   |   |   |   | c |
-            | a |   | b |   |   |
-            |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | bc     | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,bc,bc | depart,fork slight left,arrive  |
-            | a,d       | ab,bd,bd | depart,fork slight right,arrive |
-
-    Scenario: Do not fork on link type
-        Given the node map
-            |   |   |   |   | c |
-            | a |   | b |   |   |
-            |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway      |
-            | abc    | primary      |
-            | bd     | primary_link |
-
-
-       When I route I should get
-            | waypoints | route      | turns                           |
-            | a,c       | abc,abc    | depart,arrive                   |
-            | a,d       | abc,bd,bd  | depart,turn slight right,arrive |
-
-    Scenario: Fork in presence of other roads
-        Given the node map
-            |   |   |   |   | c |
-            | a |   | b |   |   |
-            |   | e |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | bc     | primary |
-            | bd     | primary |
-            | eb     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,bc,bc | depart,fork slight left,arrive  |
-            | a,d       | ab,bd,bd | depart,fork slight right,arrive |
-
-    Scenario: Fork Turning Slight Left
-        Given the node map
-            |   |   |   |   |   | c |
-            |   |   |   |   |   |   |
-            | a |   | b |   |   |   |
-            |   |   |   |   | d |   |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | bc     | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,bc,bc | depart,fork slight left,arrive  |
-            | a,d       | ab,bd,bd | depart,fork slight right,arrive |
-
-    Scenario: Fork Turning Slight Right
-        Given the node map
-            |   |   |   |   | c |   |
-            | a |   | b |   |   |   |
-            |   |   |   |   |   |   |
-            |   |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | bc     | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,bc,bc | depart,fork slight left,arrive  |
-            | a,d       | ab,bd,bd | depart,fork slight right,arrive |
-
-    Scenario: Do not fork on service
-        Given the node map
-            |   |   |   |   | c |
-            | a |   | b |   |   |
-            |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway     |
-            | abc    | residential |
-            | bd     | service     |
-
-       When I route I should get
-            | waypoints | route     | turns                           |
-            | a,c       | abc,abc   | depart,arrive                   |
-            | a,d       | abc,bd,bd | depart,turn slight right,arrive |
-
-    Scenario: Fork Both Turning Slight Right
-        Given the node map
-            | a |   | b |   |   |   |
-            |   |   |   |   |   | c |
-            |   |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | bc     | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,bc,bc | depart,fork slight left,arrive  |
-            | a,d       | ab,bd,bd | depart,fork slight right,arrive |
-
-    Scenario: Fork Both Turning Slight Left
-        Given the node map
-            |   |   |   |   |   | c |
-            |   |   |   |   |   | d |
-            | a |   | b |   |   |   |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | bc     | primary |
-            | bd     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,bc,bc | depart,fork slight left,arrive  |
-            | a,d       | ab,bd,bd | depart,fork slight right,arrive |
-
-    Scenario: Fork Both Turning Slight Right - Unnamed
-        Given the node map
-            | a |   | b |   |   |   |
-            |   |   |   |   |   | c |
-            |   |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway | name |
-            | ab     | primary |      |
-            | bc     | primary |      |
-            | bd     | primary |      |
-
-       When I route I should get
-            | waypoints | route | turns                           |
-            | a,c       | ,,    | depart,fork slight left,arrive  |
-            | a,d       | ,,    | depart,fork slight right,arrive |
-
-    Scenario: Fork Both Turning Slight Left - Unnamed
-        Given the node map
-            |   |   |   |   |   | c |
-            |   |   |   |   |   | d |
-            | a |   | b |   |   |   |
-
-        And the ways
-            | nodes  | highway | name |
-            | ab     | primary |      |
-            | bc     | primary |      |
-            | bd     | primary |      |
-
-       When I route I should get
-            | waypoints | route | turns                           |
-            | a,c       | ,,    | depart,fork slight left,arrive  |
-            | a,d       | ,,    | depart,fork slight right,arrive |
-
-    Scenario: Fork Both Turning Very Slightly Right - Unnamed
-        Given the node map
-            | a |   | b |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   | c |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway | name |
-            | ab     | primary |      |
-            | bc     | primary |      |
-            | bd     | primary |      |
-
-       When I route I should get
-            | waypoints | route | turns                           |
-            | a,c       | ,,    | depart,fork slight left,arrive  |
-            | a,d       | ,,    | depart,fork slight right,arrive |
-
-    Scenario: Fork Both Turning Very Slightly Right - Unnamed Ramps
-        Given the node map
-            | a |   | b |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   | c |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway       | name |
-            | ab     | motorway_link |      |
-            | bc     | motorway_link |      |
-            | bd     | motorway_link |      |
-
-       When I route I should get
-            | waypoints | route | turns                           |
-            | a,c       | ,,    | depart,fork slight left,arrive  |
-            | a,d       | ,,    | depart,fork slight right,arrive |
-
-    Scenario: Non-Fork on complex intersection - left
-        Given the node map
-            |   |   |   |   | c |
-            | a |   | b |   |   |
-            |   | e |   |   | d |
-
-        And the ways
-            | nodes  | highway   |
-            | abc    | secondary |
-            | bd     | tertiary  |
-            | eb     | tertiary  |
-
-       When I route I should get
-            | waypoints | route     | turns                           |
-            | a,c       | abc,abc   | depart,arrive                   |
-            | a,d       | abc,bd,bd | depart,turn slight right,arrive |
-
-    Scenario: Non-Fork on complex intersection - right
-        Given the node map
-            |   | e |   |   | c |
-            | a |   | b |   |   |
-            |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway   |
-            | abd    | secondary |
-            | bc     | tertiary  |
-            | eb     | tertiary  |
-
-       When I route I should get
-            | waypoints | route     | turns                          |
-            | a,c       | abd,bc,bc | depart,turn slight left,arrive |
-            | a,d       | abd,abd   | depart,arrive                  |
-
-    Scenario: Tripple fork
-        Given the node map
-            |   |   |   |   |   |   |   |   | c |
-            | a |   | b |   | d |   |   |   |   |
-            |   |   |   |   |   |   |   |   | e |
-
-        And the ways
-            | nodes  | highway   |
-            | ab     | secondary |
-            | bc     | secondary |
-            | bd     | secondary |
-            | be     | secondary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,bc,bc | depart,fork slight left,arrive  |
-            | a,d       | ab,bd,bd | depart,fork straight,arrive     |
-            | a,e       | ab,be,be | depart,fork slight right,arrive |
-
-    Scenario: Tripple fork -- middle obvious
-        Given the node map
-            |   |   |   |   | c |
-            | a |   | b |   | d |
-            |   |   |   |   | e |
-
-        And the ways
-            | nodes  | highway   |
-            | abd    | secondary |
-            | bc     | secondary |
-            | be     | secondary |
-
-       When I route I should get
-            | waypoints | route     | turns                           |
-            | a,c       | abd,bc,bc | depart,turn slight left,arrive  |
-            | a,d       | abd,abd   | depart,arrive                   |
-            | a,e       | abd,be,be | depart,turn slight right,arrive |
-
-    Scenario: Don't Fork when leaving Road
-        Given the node map
-            | a |   | b |   | c |
-            |   |   |   |   | d |
-
-        And the ways
-            | nodes  | highway   |
-            | abc    | secondary |
-            | bd     | secondary |
-
-       When I route I should get
-            | waypoints | route     | turns                           |
-            | a,c       | abc,abc   | depart,arrive                   |
-            | a,d       | abc,bd,bd | depart,turn slight right,arrive |
@@ -1,153 +0,0 @@
-@routing  @guidance @intersections
-Feature: Intersections Data
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 10 meters
-
-    Scenario: Passing Three Way South
-        Given the node map
-            | a |   | b |   | c |
-            |   |   | d |   |   |
-
-        And the ways
-            | nodes  | name    |
-            | ab     | through |
-            | bc     | through |
-            | bd     | corner  |
-
-       When I route I should get
-            | waypoints | route           | turns         | intersections                               |
-            | a,c       | through,through | depart,arrive | true:90,true:90 true:180 false:270;true:270 |
-
-    Scenario: Passing Three Way North
-        Given the node map
-            |   |   | d |   |   |
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  | name    |
-            | ab     | through |
-            | bc     | through |
-            | bd     | corner  |
-
-       When I route I should get
-            | waypoints | route           | turns         | intersections                             |
-            | a,c       | through,through | depart,arrive | true:90,true:0 true:90 false:270;true:270 |
-
-    Scenario: Passing Oneway Street In
-        Given the node map
-            |   |   | d |   |   |
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  | name    | oneway |
-            | ab     | through | no     |
-            | bc     | through | no     |
-            | db     | corner  | yes    |
-
-       When I route I should get
-            | waypoints | route           | turns         | intersections                              |
-            | a,c       | through,through | depart,arrive | true:90,false:0 true:90 false:270;true:270 |
-
-    Scenario: Passing Oneway Street Out
-        Given the node map
-            |   |   | d |   |   |
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  | name    | oneway |
-            | ab     | through | no     |
-            | bc     | through | no     |
-            | bd     | corner  | yes    |
-
-       When I route I should get
-            | waypoints | route           | turns         | intersections                             |
-            | a,c       | through,through | depart,arrive | true:90,true:0 true:90 false:270;true:270 |
-
-    Scenario: Passing Two Intersections
-        Given the node map
-            |   |   | e |   |   |   |   |
-            | a |   | b |   | c |   | d |
-            |   |   |   |   | f |   |   |
-
-        And the ways
-            | nodes  | name    |
-            | ab     | through |
-            | bc     | through |
-            | cd     | through |
-            | be     | corner  |
-            | cf     | corner  |
-
-       When I route I should get
-            | waypoints | route           | turns         | intersections                                                        |
-            | a,d       | through,through | depart,arrive | true:90,true:0 true:90 false:270,true:90 true:180 false:270;true:270 |
-
-    Scenario: Regression test #2424
-        Given the node map
-            |   |   | e |   |   |   |   |   | i |   |   |   |   |
-            | a |   | b |   | c |   | d |   | h |   | k |   | m |
-            |   |   |   |   | f |   |   |   |   |   | l |   |   |
-
-        And the ways
-            | nodes  | name    |
-            | abcd   | Fritz-Elsas-Straße |
-            | hkm    | Fritz-Elsas-Straße |
-            | dhi    | Martin-Luther-Straße |
-            | be     | corner  |
-            | kl     | corner  |
-            | cf     | corner  |
-
-       When I route I should get
-            | waypoints | route | turns         |
-            | a,m       | Fritz-Elsas-Straße,Fritz-Elsas-Straße| depart,arrive |
-
-    Scenario: Passing Two Intersections, Collapsing
-        Given the node map
-            |   |   | e |   |   |   |   |
-            | a |   | b |   | c |   | d |
-            |   |   |   |   | f |   |   |
-
-        And the ways
-            | nodes  | name          |
-            | ab     | through       |
-            | bc     | throughbridge |
-            | cd     | through       |
-            | be     | corner        |
-            | cf     | corner        |
-
-       When I route I should get
-            | waypoints | route                  | turns                          | intersections                                                        |
-            | a,d       | through,through        | depart,arrive                  | true:90,true:0 true:90 false:270,true:90 true:180 false:270;true:270 |
-            | f,a       | corner,through,through | depart,end of road left,arrive | true:0;true:90 false:180 true:270,true:0 false:90 true:270;true:90   |
-
-    Scenario: Roundabouts
-        Given the node map
-            |   |   |   |   | e |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   | a |   |   |   |   |
-            |   |   |   | 1 |   | 4 |   |   |   |
-            |   |   |   |   |   |   |   |   |   |
-            | f |   | b |   |   |   | d |   | h |
-            |   |   |   |   |   |   |   |   |   |
-            |   |   |   | 2 |   | 3 |   |   |   |
-            |   |   |   |   | c |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   | g |   |   |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | abcda | roundabout |
-            | ea    |            |
-            | fb    |            |
-            | gc    |            |
-            | hd    |            |
-
-        When I route I should get
-            | waypoints | route          | turns                              | intersections                                                                                                                 |
-            | e,f       | ea,fb,fb       | depart,abcda-exit-1,arrive         | true:180;false:0 false:150 true:210,false:30 true:150 true:270;true:90                                                        |
-            | e,g       | ea,gc,gc       | depart,abcda-exit-2,arrive         | true:180;false:0 false:150 true:210,false:30 true:150 true:270,true:30 true:180 false:330;true:0                              |
-            | e,h       | ea,hd,hd       | depart,abcda-exit-3,arrive         | true:180;false:0 false:150 true:210,false:30 true:150 true:270,true:30 true:180 false:330,true:90 false:210 true:330;true:270 |
-            | e,2       | ea,abcda,abcda | depart,abcda-exit-undefined,arrive | true:180;false:0 false:150 true:210,false:30 true:150 true:270;true:327 +-1                                                   |
-            | 1,g       | abcda,gc,gc    | depart,abcda-exit-2,arrive         | true:214;false:30 true:150 true:270,true:30 true:180 false:330;true:0                                                         |
-            | 1,3       | abcda,abcda    | depart,arrive                      | true:214,false:30 true:150 true:270,true:30 true:180 false:330;true:214                                                       |
@@ -1,52 +0,0 @@
-@routing  @guidance
-Feature: Merging
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 10 meters
-
-    Scenario: Merge on Four Way Intersection
-        Given the node map
-            | d |   |   |
-            | a | b | c |
-            | e |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | db    | primary |
-            | eb    | primary |
-
-       When I route I should get
-            | waypoints | route      | turns                            |
-            | d,c       | db,abc,abc | depart,merge slight right,arrive |
-            | e,c       | eb,abc,abc | depart,merge slight left,arrive  |
-
-    Scenario: Merge on Three Way Intersection Right
-        Given the node map
-            | d |   |   |
-            | a | b | c |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | db    | primary |
-
-       When I route I should get
-            | waypoints | route      | turns                            |
-            | d,c       | db,abc,abc | depart,merge slight right,arrive |
-
-    Scenario: Merge on Three Way Intersection Right
-        Given the node map
-            | a | b | c |
-            | d |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | db    | primary |
-
-       When I route I should get
-            | waypoints | route      | turns                           |
-            | d,c       | db,abc,abc | depart,merge slight left,arrive |
-
@@ -1,8 +1,8 @@
@routing  @guidance
-Feature: Motorway Guidance
+Feature: Basic Roundabout

    Background:
-        Given the profile "car"
+        Given the profile "testbot"
        Given a grid size of 10 meters

    Scenario: Ramp Exit Right
@@ -11,14 +11,14 @@ Feature: Motorway Guidance
            |   |   |   | f | g |

        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | bfg   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | bfg    | motorway_link |

       When I route I should get
-            | waypoints | route         | turns                                |
-            | a,e       | abcde,abcde   | depart,arrive                        |
-            | a,g       | abcde,bfg,bfg | depart,off ramp slight right,arrive |
+            | waypoints | route           | turns                             |
+            | a,e       | abcde, abcde    | depart, arrive                    |
+            | a,g       | abcde, bfg, bfg | depart, ramp-slight-right, arrive |

    Scenario: Ramp Exit Right Curved Right
        Given the node map
@@ -27,14 +27,14 @@ Feature: Motorway Guidance
            |   |   |   | g | e |

        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | bfg   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | bfg    | motorway_link |

       When I route I should get
-            | waypoints | route         | turns                         |
-            | a,e       | abcde,abcde   | depart,arrive                 |
-            | a,g       | abcde,bfg,bfg | depart,off ramp right,arrive |
+            | waypoints | route           | turns                             |
+            | a,e       | abcde, abcde    | depart, arrive                    |
+            | a,g       | abcde, bfg, bfg | depart, ramp-slight-right, arrive |

    Scenario: Ramp Exit Right Curved Left
        Given the node map
@@ -44,14 +44,14 @@ Feature: Motorway Guidance


        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | cfg   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | cfg    | motorway_link |

       When I route I should get
-            | waypoints | route         | turns                                |
-            | a,e       | abcde,abcde   | depart,arrive                        |
-            | a,g       | abcde,cfg,cfg | depart,off ramp slight right,arrive |
+            | waypoints | route           | turns                             |
+            | a,e       | abcde, abcde    | depart, arrive                    |
+            | a,g       | abcde, cfg, cfg | depart, ramp-slight-right, arrive |


    Scenario: Ramp Exit Left
@@ -60,14 +60,14 @@ Feature: Motorway Guidance
            | a | b | c | d | e |

        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | bfg   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | bfg    | motorway_link |

       When I route I should get
-            | waypoints | route         | turns                               |
-            | a,e       | abcde,abcde   | depart,arrive                       |
-            | a,g       | abcde,bfg,bfg | depart,off ramp slight left,arrive |
+            | waypoints | route           | turns                            |
+            | a,e       | abcde, abcde    | depart, arrive                   |
+            | a,g       | abcde, bfg, bfg | depart, ramp-slight-left, arrive |

    Scenario: Ramp Exit Left Curved Left
        Given the node map
@@ -76,14 +76,14 @@ Feature: Motorway Guidance
            | a | b | c |   |   |

        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | bfg   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | bfg    | motorway_link |

       When I route I should get
-            | waypoints | route         | turns                        |
-            | a,e       | abcde,abcde   | depart,arrive                |
-            | a,g       | abcde,bfg,bfg | depart,off ramp left,arrive |
+            | waypoints | route           | turns                            |
+            | a,e       | abcde, abcde    | depart, arrive                   |
+            | a,g       | abcde, bfg, bfg | depart, ramp-slight-left, arrive |

    Scenario: Ramp Exit Left Curved Right
        Given the node map
@@ -92,14 +92,14 @@ Feature: Motorway Guidance
            |   |   |   |   | e |

        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | cfg   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | cfg    | motorway_link |

       When I route I should get
-            | waypoints | route         | turns                               |
-            | a,e       | abcde,abcde   | depart,arrive                       |
-            | a,g       | abcde,cfg,cfg | depart,off ramp slight left,arrive |
+            | waypoints | route           | turns                            |
+            | a,e       | abcde, abcde    | depart, arrive                   |
+            | a,g       | abcde, cfg, cfg | depart, ramp-slight-left, arrive |

    Scenario: On Ramp Right
        Given the node map
@@ -107,14 +107,14 @@ Feature: Motorway Guidance
            | f | g |   |   |   |

        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | fgd   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | fgd    | motorway_link |

       When I route I should get
-            | waypoints | route           | turns                           |
-            | a,e       | abcde,abcde     | depart,arrive                   |
-            | f,e       | fgd,abcde,abcde | depart,merge slight left,arrive |
+            | waypoints | route           | turns                             |
+            | a,e       | abcde, abcde    | depart, arrive                    |
+            | f,e       | abcde, fgd, fgd | depart, merge-slight-left, arrive |

    Scenario: On Ramp Left
        Given the node map
@@ -122,14 +122,14 @@ Feature: Motorway Guidance
            | a | b | c | d | e |

        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | fgd   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | fgd    | motorway_link |

       When I route I should get
-            | waypoints | route           | turns                            |
-            | a,e       | abcde,abcde     | depart,arrive                    |
-            | f,e       | fgd,abcde,abcde | depart,merge slight right,arrive |
+            | waypoints | route           | turns                              |
+            | a,e       | abcde, abcde    | depart, arrive                     |
+            | f,e       | abcde, fgd, fgd | depart, merge-slight-right, arrive |

    Scenario: Highway Fork
        Given the node map
@@ -143,9 +143,9 @@ Feature: Motorway Guidance
            | cfg    | motorway |

       When I route I should get
-            | waypoints | route             | turns                           |
-            | a,e       | abcde,abcde,abcde | depart,fork slight left,arrive  |
-            | a,g       | abcde,cfg,cfg     | depart,fork slight right,arrive |
+            | waypoints | route               | turns                      |
+            | a,e       | abcde, abcde, abcde | depart, fork-left, arrive  |
+            | a,g       | abcde, cfg, cfg     | depart, fork-right, arrive |

     Scenario: Fork After Ramp
       Given the node map
@@ -154,15 +154,15 @@ Feature: Motorway Guidance
            |   |   |   |   | f | g |

        And the ways
-            | nodes | highway       | oneway |
-            | abc   | motorway_link | yes    |
-            | cde   | motorway      |        |
-            | cfg   | motorway      |        |
+            | nodes  | highway       |
+            | abc    | motorway_link |
+            | cde    | motorway      |
+            | cfg    | motorway      |

       When I route I should get
-            | waypoints | route       | turns                           |
-            | a,e       | abc,cde,cde | depart,fork slight left,arrive  |
-            | a,g       | abc,cfg,cfg | depart,fork slight right,arrive |
+            | waypoints | route         | turns                      |
+            | a,e       | abc, cde, cde | depart, fork-left, arrive  |
+            | a,g       | abc, cfg, cfg | depart, fork-right, arrive |

     Scenario: On And Off Ramp Right
       Given the node map
@@ -170,17 +170,17 @@ Feature: Motorway Guidance
            | f | g |   |   |   | h | i |

        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | fgc   | motorway_link | yes    |
-            | chi   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | fgc    | motorway_link |
+            | chi    | motorway_link |

       When I route I should get
-            | waypoints | route           | turns                              |
-            | a,e       | abcde,abcde     | depart,arrive                      |
-            | f,e       | fgc,abcde,abcde | depart,merge slight left,arrive    |
-            | a,i       | abcde,chi,chi   | depart,off ramp slight right,arrive |
-            | f,i       | fgc,chi,chi     | depart,off ramp right,arrive       |
+            | waypoints | route             | turns                             |
+            | a,e       | abcde, abcde      | depart, arrive                    |
+            | f,e       | fgc, abcde, abcde | depart, merge-slight-left, arrive |
+            | a,i       | abcde, chi, chi   | depart, ramp-slight-right, arrive |
+            | f,i       | fgc, chi, chi     | depart, turn-slight-right, arrive |

    Scenario: On And Off Ramp Left
       Given the node map
@@ -188,31 +188,15 @@ Feature: Motorway Guidance
            | a | b |   | c |   | d | e |

        And the ways
-            | nodes | highway       | oneway |
-            | abcde | motorway      |        |
-            | fgc   | motorway_link | yes    |
-            | chi   | motorway_link | yes    |
+            | nodes  | highway       |
+            | abcde  | motorway      |
+            | fgc    | motorway_link |
+            | chi    | motorway_link |

       When I route I should get
-            | waypoints | route           | turns                             |
-            | a,e       | abcde,abcde     | depart,arrive                     |
-            | f,e       | fgc,abcde,abcde | depart,merge slight right,arrive  |
-            | a,i       | abcde,chi,chi   | depart,off ramp slight left,arrive |
-            | f,i       | fgc,chi,chi     | depart,off ramp left,arrive       |
+            | waypoints | route             | turns                              |
+            | a,e       | abcde, abcde      | depart, arrive                     |
+            | f,e       | fgc, abcde, abcde | depart, merge-slight-right, arrive |
+            | a,i       | abcde, chi, chi   | depart, ramp-slight-left, arrive   |
+            | f,i       | fgc, chi, chi     | depart, turn-slight-left, arrive   |

-    Scenario: Merging Motorways
-        Given the node map
-            | e |   |   |
-            | a | b | c |
-            | d |   |   |
-
-        And the ways
-            | nodes | highway  |
-            | abc   | motorway |
-            | db    | motorway |
-            | eb    | motorway |
-
-        When I route I should get
-            | waypoints | route      | turns                            |
-            | d,c       | db,abc,abc | depart,merge slight left,arrive  |
-            | e,c       | eb,abc,abc | depart,merge slight right,arrive |
@@ -1,166 +0,0 @@
-@routing  @guidance
-Feature: New-Name Instructions
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 100 meters
-
-    Scenario: Undisturbed name Change
-        Given the node map
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  |
-            | ab     |
-            | bc     |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,bc,bc | depart,new name straight,arrive |
-
-
-    Scenario: Undisturbed Name Change with unannounced Turn Right
-        Given the node map
-            | a |   | b |   |   |
-            |   |   |   |   | c |
-
-        And the ways
-            | nodes  |
-            | ab     |
-            | bc     |
-
-       When I route I should get
-            | waypoints | route    | turns                               |
-            | a,c       | ab,bc,bc | depart,new name slight right,arrive |
-
-    Scenario: Undisturbed Name Change with unannounced Turn Left
-        Given the node map
-            |   |   |   |   | c |
-            | a |   | b |   |   |
-
-        And the ways
-            | nodes  |
-            | ab     |
-            | bc     |
-
-       When I route I should get
-            | waypoints | route    | turns                              |
-            | a,c       | ab,bc,bc | depart,new name slight left,arrive |
-
-    Scenario: Disturbed Name Change with Turn
-        Given the node map
-            | a |   | b |   |   |
-            |   | d |   |   | c |
-
-        And the ways
-            | nodes  |
-            | ab     |
-            | bc     |
-            | db     |
-
-       When I route I should get
-            | waypoints | route    | turns                               |
-            | a,c       | ab,bc,bc | depart,new name slight right,arrive |
-
-    Scenario: Undisturbed Name Change with announced Turn Left
-        Given the node map
-            |   |   | c |
-            | a |   | b |
-
-        And the ways
-            | nodes  |
-            | ab     |
-            | bc     |
-
-       When I route I should get
-            | waypoints | route    | turns                       |
-            | a,c       | ab,bc,bc | depart,new name left,arrive |
-
-    Scenario: Undisturbed Name Change with announced Turn Sharp Left
-        Given the node map
-            | c |   |   |
-            | a |   | b |
-
-        And the ways
-            | nodes  |
-            | ab     |
-            | bc     |
-
-       When I route I should get
-            | waypoints | route    | turns                             |
-            | a,c       | ab,bc,bc | depart,new name sharp left,arrive |
-
-    Scenario: Undisturbed Name Change with announced Turn Right
-        Given the node map
-            | a |   | b |
-            |   |   | c |
-
-        And the ways
-            | nodes  |
-            | ab     |
-            | bc     |
-
-       When I route I should get
-            | waypoints | route    | turns                        |
-            | a,c       | ab,bc,bc | depart,new name right,arrive |
-
-    Scenario: Undisturbed Name Change with announced Turn Sharp Right
-        Given the node map
-            | a |   | b |
-            | c |   |   |
-
-        And the ways
-            | nodes  |
-            | ab     |
-            | bc     |
-
-       When I route I should get
-            | waypoints | route    | turns                              |
-            | a,c       | ab,bc,bc | depart,new name sharp right,arrive |
-
-
-    Scenario: Disturbed Name Change with minor road class
-        Given the node map
-            | a |   | b |   | d |
-            |   |   |   |   | c |
-
-        And the ways
-            | nodes  | highway     |
-            | ab     | residential |
-            | bc     | residential |
-            | bd     | service     |
-
-       When I route I should get
-            | waypoints | route    | turns                               |
-            | a,c       | ab,bc,bc | depart,new name slight right,arrive |
-
-    Scenario: Empty road names - Announce Change From, suppress Change To
-        Given the node map
-            | a |  | b | 1 | c |  | d |
-
-        And the ways
-            | nodes | name |
-            | ab    | ab   |
-            | bc    |      |
-            | cd    | cd   |
-
-        When I route I should get
-            | waypoints | route    | turns                           |
-            | a,d       | ab,cd,cd | depart,new name straight,arrive |
-            | a,1       | ab,      | depart,arrive                   |
-
-    Scenario: Empty road names - Loose name shortly
-        Given the node map
-            | a |  | b |  | c |  | d |  | e |
-
-        And the ways
-            | nodes | name      |
-            | ab    | name      |
-            | bc    | with-name |
-            | cd    |           |
-            | de    | with-name |
-
-        When I route I should get
-            | waypoints | route                    | turns                           |
-            | a,e       | name,with-name,with-name | depart,new name straight,arrive |
-            | b,e       | with-name,with-name      | depart,arrive                   |
@@ -1,229 +0,0 @@
-@routing  @guidance
-Feature: Ramp Guidance
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 10 meters
-
-    Scenario: Ramp On Through Street Right
-        Given the node map
-            | a | b | c |
-            |   | d |   |
-
-        And the ways
-            | nodes | highway       |
-            | abc   | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route     | turns                          |
-            | a,d       | abc,bd,bd | depart,on ramp right,arrive |
-
-    Scenario: Ramp On Through Street Left
-        Given the node map
-            |   | d |   |
-            | a | b | c |
-
-        And the ways
-            | nodes | highway       |
-            | abc   | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route     | turns                         |
-            | a,d       | abc,bd,bd | depart,on ramp left,arrive |
-
-    Scenario: Ramp On Through Street Left and Right
-        Given the node map
-            |   | e |   |
-            | a | b | c |
-            |   | d |   |
-
-        And the ways
-            | nodes | highway       |
-            | be    | motorway_link |
-            | abc   | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route     | turns                          |
-            | a,d       | abc,bd,bd | depart,on ramp right,arrive |
-            | a,e       | abc,be,be | depart,on ramp left,arrive  |
-
-    Scenario: Ramp On Three Way Intersection Right
-        Given the node map
-            | a | b | c |
-            |   | d |   |
-
-        And the ways
-            | nodes | highway       |
-            | ab    | tertiary      |
-            | bc    | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route    | turns                          |
-            | a,d       | ab,bd,bd | depart,on ramp right,arrive |
-
-    Scenario: Ramp On Three Way Intersection Right
-        Given the node map
-            |   |   | c |
-            | a | b |   |
-            |   | d |   |
-
-        And the ways
-            | nodes | highway       |
-            | ab    | tertiary      |
-            | bc    | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route    | turns                          |
-            | a,d       | ab,bd,bd | depart,on ramp right,arrive |
-
-    Scenario: Ramp Off Though Street
-        Given the node map
-            |   |   | c |
-            | a | b |   |
-            |   | d |   |
-
-        And the ways
-            | nodes | highway       |
-            | abc   | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route     | turns                          |
-            | a,d       | abc,bd,bd | depart,on ramp right,arrive |
-            | a,c       | abc,abc   | depart,arrive                  |
-
-    Scenario: Straight Ramp Off Turning Though Street
-        Given the node map
-            |   |   | c |
-            | a | b | d |
-
-        And the ways
-            | nodes | highway       |
-            | abc   | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route       | turns                             |
-            | a,d       | abc,bd,bd   | depart,on ramp straight,arrive |
-            | a,c       | abc,abc,abc | depart,continue left,arrive       |
-
-    Scenario: Fork Ramp Off Turning Though Street
-        Given the node map
-            |   |   | c |
-            | a | b |   |
-            |   |   | d |
-
-        And the ways
-            | nodes | highway       |
-            | abc   | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route       | turns                             |
-            | a,d       | abc,bd,bd   | depart,on ramp right,arrive    |
-            | a,c       | abc,abc,abc | depart,continue left,arrive       |
-
-    Scenario: Fork Ramp
-        Given the node map
-            |   |   | c |
-            | a | b |   |
-            |   |   | d |
-
-        And the ways
-            | nodes | highway       |
-            | ab    | tertiary      |
-            | bc    | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route    | turns                          |
-            | a,d       | ab,bd,bd | depart,on ramp right,arrive |
-            | a,c       | ab,bc,bc | depart,turn left,arrive        |
-
-    Scenario: Fork Slight Ramp
-        Given the node map
-            |   |   |   | c |
-            | a | b |   |   |
-            |   |   |   | d |
-
-        And the ways
-            | nodes | highway       |
-            | ab    | tertiary      |
-            | bc    | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route    | turns                                 |
-            | a,d       | ab,bd,bd | depart,on ramp slight right,arrive |
-            | a,c       | ab,bc,bc | depart,turn slight left,arrive        |
-
-    Scenario: Fork Slight Ramp on Through Street
-        Given the node map
-            |   |   |   | c |
-            | a | b |   |   |
-            |   |   |   | d |
-
-        And the ways
-            | nodes | highway       |
-            | abc   | tertiary      |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route       | turns                                    |
-            | a,d       | abc,bd,bd   | depart,on ramp slight right,arrive    |
-            | a,c       | abc,abc,abc | depart,continue slight left,arrive       |
-
-    Scenario: Fork Slight Ramp on Obvious Through Street
-        Given the node map
-            |   |   |   | c |
-            | a | b |   |   |
-            |   |   |   | d |
-
-        And the ways
-            | nodes | highway       |
-            | abc   | primary       |
-            | bd    | motorway_link |
-
-       When I route I should get
-            | waypoints | route     | turns                                 |
-            | a,d       | abc,bd,bd | depart,on ramp slight right,arrive |
-            | a,c       | abc,abc   | depart,arrive                         |
-
-    Scenario: Two Ramps Joining into common Motorway
-        Given the node map
-            | a |   |   |   |
-            |   |   | c | d |
-            | b |   |   |   |
-
-        And the ways
-            | nodes | highway       |
-            | ac    | motorway_link |
-            | bc    | motorway_link |
-            | cd    | motorway      |
-
-        When I route I should get
-            | waypoints | route    | turns                               |
-            | a,d       | ac,cd,cd | depart,new name slight left,arrive  |
-            | b,d       | bc,cd,cd | depart,new name slight right,arrive |
-
-    Scenario: Two Ramps Joining into common Motorway Unnamed
-        Given the node map
-            | a |   |   |   |
-            |   |   | c | d |
-            | b |   |   |   |
-
-        And the ways
-            | nodes | highway       | name |
-            | ac    | motorway_link |      |
-            | bc    | motorway_link |      |
-            | cd    | motorway      |      |
-
-        When I route I should get
-            | waypoints | route    | turns         |
-            | a,d       | ,        | depart,arrive |
-            | b,d       | ,        | depart,arrive |
@@ -1,167 +0,0 @@
-@routing  @guidance
-Feature: Rotary
-
-    Background:
-        Given the profile "bicycle"
-        Given a grid size of 30 meters
-
-    Scenario: Enter and Exit
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | h | g |   | c | d |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bgecb  | roundabout |
-
-       When I route I should get
-           | waypoints | route    | turns                      |
-           | a,d       | ab,cd,cd | depart,bgecb-exit-3,arrive |
-           | a,f       | ab,ef,ef | depart,bgecb-exit-2,arrive |
-           | a,h       | ab,gh,gh | depart,bgecb-exit-1,arrive |
-           | d,f       | cd,ef,ef | depart,bgecb-exit-3,arrive |
-           | d,h       | cd,gh,gh | depart,bgecb-exit-2,arrive |
-           | d,a       | cd,ab,ab | depart,bgecb-exit-1,arrive |
-           | f,h       | ef,gh,gh | depart,bgecb-exit-3,arrive |
-           | f,a       | ef,ab,ab | depart,bgecb-exit-2,arrive |
-           | f,d       | ef,cd,cd | depart,bgecb-exit-1,arrive |
-           | h,a       | gh,ab,ab | depart,bgecb-exit-3,arrive |
-           | h,d       | gh,cd,cd | depart,bgecb-exit-2,arrive |
-           | h,f       | gh,ef,ef | depart,bgecb-exit-1,arrive |
-
-    Scenario: Only Enter
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route          | turns                              |
-           | a,c       | ab,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | a,e       | ab,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | a,g       | ab,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | d,e       | cd,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | d,g       | cd,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | d,b       | cd,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | f,g       | ef,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | f,b       | ef,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | f,c       | ef,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | h,b       | gh,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | h,c       | gh,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | h,e       | gh,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-
-    Scenario: Only Exit
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route       | turns                      |
-           | b,d       | bcegb,cd,cd | depart,bcegb-exit-1,arrive |
-           | b,f       | bcegb,ef,ef | depart,bcegb-exit-2,arrive |
-           | b,h       | bcegb,gh,gh | depart,bcegb-exit-3,arrive |
-           | c,f       | bcegb,ef,ef | depart,bcegb-exit-1,arrive |
-           | c,h       | bcegb,gh,gh | depart,bcegb-exit-2,arrive |
-           | c,a       | bcegb,ab,ab | depart,bcegb-exit-3,arrive |
-           | e,h       | bcegb,gh,gh | depart,bcegb-exit-1,arrive |
-           | e,a       | bcegb,ab,ab | depart,bcegb-exit-2,arrive |
-           | e,d       | bcegb,cd,cd | depart,bcegb-exit-3,arrive |
-           | g,a       | bcegb,ab,ab | depart,bcegb-exit-1,arrive |
-           | g,d       | bcegb,cd,cd | depart,bcegb-exit-2,arrive |
-           | g,f       | bcegb,ef,ef | depart,bcegb-exit-3,arrive |
-      #phantom node snapping can result in a full round-trip here, therefore we cannot test b->a and the other direct exits
-
-    Scenario: Drive Around
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route       | turns         |
-           | b,c       | bcegb,bcegb | depart,arrive |
-           | b,e       | bcegb,bcegb | depart,arrive |
-           | b,g       | bcegb,bcegb | depart,arrive |
-           | c,e       | bcegb,bcegb | depart,arrive |
-           | c,g       | bcegb,bcegb | depart,arrive |
-           | c,b       | bcegb,bcegb | depart,arrive |
-           | e,g       | bcegb,bcegb | depart,arrive |
-           | e,b       | bcegb,bcegb | depart,arrive |
-           | e,c       | bcegb,bcegb | depart,arrive |
-           | g,b       | bcegb,bcegb | depart,arrive |
-           | g,c       | bcegb,bcegb | depart,arrive |
-           | g,e       | bcegb,bcegb | depart,arrive |
-
-     #needs to be adjusted when name-discovery works for entrys
-     Scenario: Mixed Entry and Exit
-        Given the node map
-           |   | c |   | a |   |
-           | j |   | b |   | f |
-           |   | k |   | e |   |
-           | l |   | h |   | d |
-           |   | g |   | i |   |
-
-        And the ways
-           | nodes | junction   | oneway |
-           | abc   |            | yes    |
-           | def   |            | yes    |
-           | ghi   |            | yes    |
-           | jkl   |            | yes    |
-           | bkheb | roundabout | yes    |
-
-        When I route I should get
-           | waypoints | route       | turns                       |
-           | a,c       | abc,abc,abc | depart,rotary-exit-1,arrive |
-           | a,l       | abc,jkl,jkl | depart,bkheb-exit-2,arrive  |
-           | a,i       | abc,ghi,ghi | depart,bkheb-exit-3,arrive  |
-           | a,f       | abc,def,def | depart,bkheb-exit-4,arrive  |
-           | d,f       | def,def,def | depart,rotary-exit-1,arrive |
-           | d,c       | def,abc,abc | depart,bkheb-exit-2,arrive  |
-           | d,l       | def,jkl,jkl | depart,bkheb-exit-3,arrive  |
-           | d,i       | def,ghi,ghi | depart,bkheb-exit-4,arrive  |
-           | g,i       | ghi,ghi,ghi | depart,rotary-exit-1,arrive |
-           | g,f       | ghi,def,def | depart,bkheb-exit-2,arrive  |
-           | g,c       | ghi,abc,abc | depart,bkheb-exit-3,arrive  |
-           | g,l       | ghi,jkl,jkl | depart,bkheb-exit-4,arrive  |
-           | j,l       | jkl,jkl,jkl | depart,rotary-exit-1,arrive |
-           | j,i       | jkl,ghi,ghi | depart,bkheb-exit-2,arrive  |
-           | j,f       | jkl,def,def | depart,bkheb-exit-3,arrive  |
-           | j,c       | jkl,abc,abc | depart,bkheb-exit-4,arrive  |
@@ -1,262 +0,0 @@
-@routing  @guidance
-Feature: Rotary
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 30 meters
-
-    Scenario: Enter and Exit
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | h | g |   | c | d |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bgecb  | roundabout |
-
-       When I route I should get
-           | waypoints | route    | turns                      |
-           | a,d       | ab,cd,cd | depart,bgecb-exit-3,arrive |
-           | a,f       | ab,ef,ef | depart,bgecb-exit-2,arrive |
-           | a,h       | ab,gh,gh | depart,bgecb-exit-1,arrive |
-           | d,f       | cd,ef,ef | depart,bgecb-exit-3,arrive |
-           | d,h       | cd,gh,gh | depart,bgecb-exit-2,arrive |
-           | d,a       | cd,ab,ab | depart,bgecb-exit-1,arrive |
-           | f,h       | ef,gh,gh | depart,bgecb-exit-3,arrive |
-           | f,a       | ef,ab,ab | depart,bgecb-exit-2,arrive |
-           | f,d       | ef,cd,cd | depart,bgecb-exit-1,arrive |
-           | h,a       | gh,ab,ab | depart,bgecb-exit-3,arrive |
-           | h,d       | gh,cd,cd | depart,bgecb-exit-2,arrive |
-           | h,f       | gh,ef,ef | depart,bgecb-exit-1,arrive |
-
-    Scenario: Only Enter
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route          | turns                              |
-           | a,c       | ab,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | a,e       | ab,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | a,g       | ab,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | d,e       | cd,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | d,g       | cd,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | d,b       | cd,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | f,g       | ef,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | f,b       | ef,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | f,c       | ef,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | h,b       | gh,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | h,c       | gh,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-           | h,e       | gh,bcegb,bcegb | depart,bcegb-exit-undefined,arrive |
-
-    Scenario: Only Exit
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route       | turns                      |
-           | b,d       | bcegb,cd,cd | depart,bcegb-exit-1,arrive |
-           | b,f       | bcegb,ef,ef | depart,bcegb-exit-2,arrive |
-           | b,h       | bcegb,gh,gh | depart,bcegb-exit-3,arrive |
-           | c,f       | bcegb,ef,ef | depart,bcegb-exit-1,arrive |
-           | c,h       | bcegb,gh,gh | depart,bcegb-exit-2,arrive |
-           | c,a       | bcegb,ab,ab | depart,bcegb-exit-3,arrive |
-           | e,h       | bcegb,gh,gh | depart,bcegb-exit-1,arrive |
-           | e,a       | bcegb,ab,ab | depart,bcegb-exit-2,arrive |
-           | e,d       | bcegb,cd,cd | depart,bcegb-exit-3,arrive |
-           | g,a       | bcegb,ab,ab | depart,bcegb-exit-1,arrive |
-           | g,d       | bcegb,cd,cd | depart,bcegb-exit-2,arrive |
-           | g,f       | bcegb,ef,ef | depart,bcegb-exit-3,arrive |
-      #phantom node snapping can result in a full round-trip here, therefore we cannot test b->a and the other direct exits
-
-    Scenario: Drive Around
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route       | turns         |
-           | b,c       | bcegb,bcegb | depart,arrive |
-           | b,e       | bcegb,bcegb | depart,arrive |
-           | b,g       | bcegb,bcegb | depart,arrive |
-           | c,e       | bcegb,bcegb | depart,arrive |
-           | c,g       | bcegb,bcegb | depart,arrive |
-           | c,b       | bcegb,bcegb | depart,arrive |
-           | e,g       | bcegb,bcegb | depart,arrive |
-           | e,b       | bcegb,bcegb | depart,arrive |
-           | e,c       | bcegb,bcegb | depart,arrive |
-           | g,b       | bcegb,bcegb | depart,arrive |
-           | g,c       | bcegb,bcegb | depart,arrive |
-           | g,e       | bcegb,bcegb | depart,arrive |
-
-     #needs to be adjusted when name-discovery works for entrys
-     Scenario: Mixed Entry and Exit
-        Given the node map
-           |   | c |   | a |   |
-           | j |   | b |   | f |
-           |   | k |   | e |   |
-           | l |   | h |   | d |
-           |   | g |   | i |   |
-
-        And the ways
-           | nodes | junction   | oneway |
-           | abc   |            | yes    |
-           | def   |            | yes    |
-           | ghi   |            | yes    |
-           | jkl   |            | yes    |
-           | bkheb | roundabout | yes    |
-
-        When I route I should get
-           | waypoints | route       | turns                       |
-           | a,c       | abc,abc,abc | depart,rotary-exit-1,arrive |
-           | a,l       | abc,jkl,jkl | depart,bkheb-exit-2,arrive  |
-           | a,i       | abc,ghi,ghi | depart,bkheb-exit-3,arrive  |
-           | a,f       | abc,def,def | depart,bkheb-exit-4,arrive  |
-           | d,f       | def,def,def | depart,rotary-exit-1,arrive |
-           | d,c       | def,abc,abc | depart,bkheb-exit-2,arrive  |
-           | d,l       | def,jkl,jkl | depart,bkheb-exit-3,arrive  |
-           | d,i       | def,ghi,ghi | depart,bkheb-exit-4,arrive  |
-           | g,i       | ghi,ghi,ghi | depart,rotary-exit-1,arrive |
-           | g,f       | ghi,def,def | depart,bkheb-exit-2,arrive  |
-           | g,c       | ghi,abc,abc | depart,bkheb-exit-3,arrive  |
-           | g,l       | ghi,jkl,jkl | depart,bkheb-exit-4,arrive  |
-           | j,l       | jkl,jkl,jkl | depart,rotary-exit-1,arrive |
-           | j,i       | jkl,ghi,ghi | depart,bkheb-exit-2,arrive  |
-           | j,f       | jkl,def,def | depart,bkheb-exit-3,arrive  |
-           | j,c       | jkl,abc,abc | depart,bkheb-exit-4,arrive  |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | a |   |   |
-            | b |   |   |
-            | c | d | f |
-            | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | bcdb  | roundabout |
-            | ce    |            |
-            | df    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                     |
-            | a,e       | ab,ce,ce | depart,bcdb-exit-1,arrive |
-            | a,f       | ab,df,df | depart,bcdb-exit-2,arrive |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | a |   |   |
-            | d |   |   |
-            | b | c | f |
-            | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ad    |            |
-            | bcdb  | roundabout |
-            | be    |            |
-            | cf    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                     |
-            | a,e       | ad,be,be | depart,bcdb-exit-1,arrive |
-            | a,f       | ad,cf,cf | depart,bcdb-exit-2,arrive |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | a |   |   |
-            | c |   |   |
-            | d | b | f |
-            | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ac    |            |
-            | bcdb  | roundabout |
-            | de    |            |
-            | bf    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                     |
-            | a,e       | ac,de,de | depart,bcdb-exit-1,arrive |
-            | a,f       | ac,bf,bf | depart,bcdb-exit-2,arrive |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | f |   |   |
-            | d | c | e |
-            |   | b |   |
-            |   | a |   |
-
-        And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | bcdb  | roundabout |
-            | ce    |            |
-            | df    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                     |
-            | a,e       | ab,ce,ce | depart,bcdb-exit-1,arrive |
-            | a,f       | ab,df,df | depart,bcdb-exit-2,arrive |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | f |   |   |
-            | d | c | e |
-            | b |   |   |
-            | a |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | bcdb  | roundabout |
-            | ce    |            |
-            | df    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                     |
-            | a,e       | ab,ce,ce | depart,bcdb-exit-1,arrive |
-            | a,f       | ab,df,df | depart,bcdb-exit-2,arrive |
@@ -1,166 +0,0 @@
-@routing  @guidance
-Feature: Basic Roundabout
-
-    Background:
-        Given the profile "bicycle"
-        Given a grid size of 10 meters
-
-    Scenario: Enter and Exit
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | h | g |   | c | d |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bgecb  | roundabout |
-
-       When I route I should get
-           | waypoints | route    | turns                           |
-           | a,d       | ab,cd,cd | depart,roundabout-exit-3,arrive |
-           | a,f       | ab,ef,ef | depart,roundabout-exit-2,arrive |
-           | a,h       | ab,gh,gh | depart,roundabout-exit-1,arrive |
-           | d,f       | cd,ef,ef | depart,roundabout-exit-3,arrive |
-           | d,h       | cd,gh,gh | depart,roundabout-exit-2,arrive |
-           | d,a       | cd,ab,ab | depart,roundabout-exit-1,arrive |
-           | f,h       | ef,gh,gh | depart,roundabout-exit-3,arrive |
-           | f,a       | ef,ab,ab | depart,roundabout-exit-2,arrive |
-           | f,d       | ef,cd,cd | depart,roundabout-exit-1,arrive |
-           | h,a       | gh,ab,ab | depart,roundabout-exit-3,arrive |
-           | h,d       | gh,cd,cd | depart,roundabout-exit-2,arrive |
-           | h,f       | gh,ef,ef | depart,roundabout-exit-1,arrive |
-
-    Scenario: Only Enter
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route          | turns                                   |
-           | a,c       | ab,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | a,e       | ab,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | a,g       | ab,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | d,e       | cd,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | d,g       | cd,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | d,b       | cd,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | f,g       | ef,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | f,b       | ef,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | f,c       | ef,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | h,b       | gh,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | h,c       | gh,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | h,e       | gh,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-
-    Scenario: Only Exit
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route       | turns                           |
-           | b,d       | bcegb,cd,cd | depart,roundabout-exit-1,arrive |
-           | b,f       | bcegb,ef,ef | depart,roundabout-exit-2,arrive |
-           | b,h       | bcegb,gh,gh | depart,roundabout-exit-3,arrive |
-           | c,f       | bcegb,ef,ef | depart,roundabout-exit-1,arrive |
-           | c,h       | bcegb,gh,gh | depart,roundabout-exit-2,arrive |
-           | c,a       | bcegb,ab,ab | depart,roundabout-exit-3,arrive |
-           | e,h       | bcegb,gh,gh | depart,roundabout-exit-1,arrive |
-           | e,a       | bcegb,ab,ab | depart,roundabout-exit-2,arrive |
-           | e,d       | bcegb,cd,cd | depart,roundabout-exit-3,arrive |
-           | g,a       | bcegb,ab,ab | depart,roundabout-exit-1,arrive |
-           | g,d       | bcegb,cd,cd | depart,roundabout-exit-2,arrive |
-           | g,f       | bcegb,ef,ef | depart,roundabout-exit-3,arrive |
-      #phantom node snapping can result in a full round-trip here, therefore we cannot test b->a and the other direct exits
-
-    Scenario: Drive Around
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route       | turns         |
-           | b,c       | bcegb,bcegb | depart,arrive |
-           | b,e       | bcegb,bcegb | depart,arrive |
-           | b,g       | bcegb,bcegb | depart,arrive |
-           | c,e       | bcegb,bcegb | depart,arrive |
-           | c,g       | bcegb,bcegb | depart,arrive |
-           | c,b       | bcegb,bcegb | depart,arrive |
-           | e,g       | bcegb,bcegb | depart,arrive |
-           | e,b       | bcegb,bcegb | depart,arrive |
-           | e,c       | bcegb,bcegb | depart,arrive |
-           | g,b       | bcegb,bcegb | depart,arrive |
-           | g,c       | bcegb,bcegb | depart,arrive |
-           | g,e       | bcegb,bcegb | depart,arrive |
-
-     Scenario: Mixed Entry and Exit
-        Given the node map
-           |   | c |   | a |   |
-           | j |   | b |   | f |
-           |   | k |   | e |   |
-           | l |   | h |   | d |
-           |   | g |   | i |   |
-
-        And the ways
-           | nodes | junction   | oneway |
-           | abc   |            | yes    |
-           | def   |            | yes    |
-           | ghi   |            | yes    |
-           | jkl   |            | yes    |
-           | bkheb | roundabout | yes    |
-
-        When I route I should get
-           | waypoints | route       | turns                           |
-           | a,c       | abc,abc,abc | depart,roundabout-exit-1,arrive |
-           | a,l       | abc,jkl,jkl | depart,roundabout-exit-2,arrive |
-           | a,i       | abc,ghi,ghi | depart,roundabout-exit-3,arrive |
-           | a,f       | abc,def,def | depart,roundabout-exit-4,arrive |
-           | d,f       | def,def,def | depart,roundabout-exit-1,arrive |
-           | d,c       | def,abc,abc | depart,roundabout-exit-2,arrive |
-           | d,l       | def,jkl,jkl | depart,roundabout-exit-3,arrive |
-           | d,i       | def,ghi,ghi | depart,roundabout-exit-4,arrive |
-           | g,i       | ghi,ghi,ghi | depart,roundabout-exit-1,arrive |
-           | g,f       | ghi,def,def | depart,roundabout-exit-2,arrive |
-           | g,c       | ghi,abc,abc | depart,roundabout-exit-3,arrive |
-           | g,l       | ghi,jkl,jkl | depart,roundabout-exit-4,arrive |
-           | j,l       | jkl,jkl,jkl | depart,roundabout-exit-1,arrive |
-           | j,i       | jkl,ghi,ghi | depart,roundabout-exit-2,arrive |
-           | j,f       | jkl,def,def | depart,roundabout-exit-3,arrive |
-           | j,c       | jkl,abc,abc | depart,roundabout-exit-4,arrive |
@@ -1,391 +0,0 @@
-@routing  @guidance
-Feature: Basic Roundabout
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 3 meters
-
-    Scenario: Enter and Exit
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | h | g |   | c | d |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bgecb  | roundabout |
-
-       When I route I should get
-           | waypoints | route    | turns                                         |
-           | a,d       | ab,cd,cd | depart,roundabout turn left exit-3,arrive     |
-           | a,f       | ab,ef,ef | depart,roundabout turn straight exit-2,arrive |
-           | a,h       | ab,gh,gh | depart,roundabout turn right exit-1,arrive    |
-           | d,f       | cd,ef,ef | depart,roundabout turn left exit-3,arrive     |
-           | d,h       | cd,gh,gh | depart,roundabout turn straight exit-2,arrive |
-           | d,a       | cd,ab,ab | depart,roundabout turn right exit-1,arrive    |
-           | f,h       | ef,gh,gh | depart,roundabout turn left exit-3,arrive     |
-           | f,a       | ef,ab,ab | depart,roundabout turn straight exit-2,arrive |
-           | f,d       | ef,cd,cd | depart,roundabout turn right exit-1,arrive    |
-           | h,a       | gh,ab,ab | depart,roundabout turn left exit-3,arrive     |
-           | h,d       | gh,cd,cd | depart,roundabout turn straight exit-2,arrive |
-           | h,f       | gh,ef,ef | depart,roundabout turn right exit-1,arrive    |
-
-    Scenario: Enter and Exit - Rotated
-        Given the node map
-            | a |   |   | d |
-            |   | b | c |   |
-            |   | g | e |   |
-            | h |   |   | f |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bgecb  | roundabout |
-
-       When I route I should get
-           | waypoints | route    | turns                                         |
-           | a,d       | ab,cd,cd | depart,roundabout turn left exit-3,arrive     |
-           | a,f       | ab,ef,ef | depart,roundabout turn straight exit-2,arrive |
-           | a,h       | ab,gh,gh | depart,roundabout turn right exit-1,arrive    |
-           | d,f       | cd,ef,ef | depart,roundabout turn left exit-3,arrive     |
-           | d,h       | cd,gh,gh | depart,roundabout turn straight exit-2,arrive |
-           | d,a       | cd,ab,ab | depart,roundabout turn right exit-1,arrive    |
-           | f,h       | ef,gh,gh | depart,roundabout turn left exit-3,arrive     |
-           | f,a       | ef,ab,ab | depart,roundabout turn straight exit-2,arrive |
-           | f,d       | ef,cd,cd | depart,roundabout turn right exit-1,arrive    |
-           | h,a       | gh,ab,ab | depart,roundabout turn left exit-3,arrive     |
-           | h,d       | gh,cd,cd | depart,roundabout turn straight exit-2,arrive |
-           | h,f       | gh,ef,ef | depart,roundabout turn right exit-1,arrive    |
-
-    Scenario: Only Enter
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route          | turns                                   |
-           | a,c       | ab,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | a,e       | ab,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | a,g       | ab,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | d,e       | cd,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | d,g       | cd,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | d,b       | cd,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | f,g       | ef,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | f,b       | ef,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | f,c       | ef,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | h,b       | gh,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | h,c       | gh,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | h,e       | gh,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-
-    Scenario: Only Exit
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route       | turns                           |
-           | b,d       | bcegb,cd,cd | depart,roundabout-exit-1,arrive |
-           | b,f       | bcegb,ef,ef | depart,roundabout-exit-2,arrive |
-           | b,h       | bcegb,gh,gh | depart,roundabout-exit-3,arrive |
-           | c,f       | bcegb,ef,ef | depart,roundabout-exit-1,arrive |
-           | c,h       | bcegb,gh,gh | depart,roundabout-exit-2,arrive |
-           | c,a       | bcegb,ab,ab | depart,roundabout-exit-3,arrive |
-           | e,h       | bcegb,gh,gh | depart,roundabout-exit-1,arrive |
-           | e,a       | bcegb,ab,ab | depart,roundabout-exit-2,arrive |
-           | e,d       | bcegb,cd,cd | depart,roundabout-exit-3,arrive |
-           | g,a       | bcegb,ab,ab | depart,roundabout-exit-1,arrive |
-           | g,d       | bcegb,cd,cd | depart,roundabout-exit-2,arrive |
-           | g,f       | bcegb,ef,ef | depart,roundabout-exit-3,arrive |
-      #phantom node snapping can result in a full round-trip here, therefore we cannot test b->a and the other direct exits
-
-    Scenario: Drive Around
-        Given the node map
-            |   |   | a |   |   |
-            |   |   | b |   |   |
-            | d | c |   | g | h |
-            |   |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bcegb  | roundabout |
-
-       When I route I should get
-           | waypoints | route       | turns         |
-           | b,c       | bcegb,bcegb | depart,arrive |
-           | b,e       | bcegb,bcegb | depart,arrive |
-           | b,g       | bcegb,bcegb | depart,arrive |
-           | c,e       | bcegb,bcegb | depart,arrive |
-           | c,g       | bcegb,bcegb | depart,arrive |
-           | c,b       | bcegb,bcegb | depart,arrive |
-           | e,g       | bcegb,bcegb | depart,arrive |
-           | e,b       | bcegb,bcegb | depart,arrive |
-           | e,c       | bcegb,bcegb | depart,arrive |
-           | g,b       | bcegb,bcegb | depart,arrive |
-           | g,c       | bcegb,bcegb | depart,arrive |
-           | g,e       | bcegb,bcegb | depart,arrive |
-
-     Scenario: Mixed Entry and Exit - Not an Intersection
-        Given the node map
-           |   | c |   | a |   |
-           | j |   | b |   | f |
-           |   | k |   | e |   |
-           | l |   | h |   | d |
-           |   | g |   | i |   |
-
-        And the ways
-           | nodes | junction   | oneway |
-           | abc   |            | yes    |
-           | def   |            | yes    |
-           | ghi   |            | yes    |
-           | jkl   |            | yes    |
-           | bkheb | roundabout | yes    |
-
-        When I route I should get
-           | waypoints | route       | turns                           |
-           | a,c       | abc,abc,abc | depart,roundabout-exit-1,arrive |
-           | a,l       | abc,jkl,jkl | depart,roundabout-exit-2,arrive |
-           | a,i       | abc,ghi,ghi | depart,roundabout-exit-3,arrive |
-           | a,f       | abc,def,def | depart,roundabout-exit-4,arrive |
-           | d,f       | def,def,def | depart,roundabout-exit-1,arrive |
-           | d,c       | def,abc,abc | depart,roundabout-exit-2,arrive |
-           | d,l       | def,jkl,jkl | depart,roundabout-exit-3,arrive |
-           | d,i       | def,ghi,ghi | depart,roundabout-exit-4,arrive |
-           | g,i       | ghi,ghi,ghi | depart,roundabout-exit-1,arrive |
-           | g,f       | ghi,def,def | depart,roundabout-exit-2,arrive |
-           | g,c       | ghi,abc,abc | depart,roundabout-exit-3,arrive |
-           | g,l       | ghi,jkl,jkl | depart,roundabout-exit-4,arrive |
-           | j,l       | jkl,jkl,jkl | depart,roundabout-exit-1,arrive |
-           | j,i       | jkl,ghi,ghi | depart,roundabout-exit-2,arrive |
-           | j,f       | jkl,def,def | depart,roundabout-exit-3,arrive |
-           | j,c       | jkl,abc,abc | depart,roundabout-exit-4,arrive |
-
-    Scenario: Segregated roads - Not an intersection
-        Given the node map
-           |   | a |   | c |   |
-           | l |   | b |   | d |
-           |   | k |   | e |   |
-           | j |   | h |   | f |
-           |   | i |   | g |   |
-
-        And the ways
-           | nodes | junction   | oneway |
-           | abc   |            | yes    |
-           | def   |            | yes    |
-           | ghi   |            | yes    |
-           | jkl   |            | yes    |
-           | bkheb | roundabout | yes    |
-
-        When I route I should get
-           | waypoints | route       | turns                           |
-           | a,c       | abc,abc,abc | depart,roundabout-exit-4,arrive |
-           | a,l       | abc,jkl,jkl | depart,roundabout-exit-1,arrive |
-           | a,i       | abc,ghi,ghi | depart,roundabout-exit-2,arrive |
-           | a,f       | abc,def,def | depart,roundabout-exit-3,arrive |
-           | d,f       | def,def,def | depart,roundabout-exit-4,arrive |
-           | d,c       | def,abc,abc | depart,roundabout-exit-1,arrive |
-           | d,l       | def,jkl,jkl | depart,roundabout-exit-2,arrive |
-           | d,i       | def,ghi,ghi | depart,roundabout-exit-3,arrive |
-           | g,i       | ghi,ghi,ghi | depart,roundabout-exit-4,arrive |
-           | g,f       | ghi,def,def | depart,roundabout-exit-1,arrive |
-           | g,c       | ghi,abc,abc | depart,roundabout-exit-2,arrive |
-           | g,l       | ghi,jkl,jkl | depart,roundabout-exit-3,arrive |
-           | j,l       | jkl,jkl,jkl | depart,roundabout-exit-4,arrive |
-           | j,i       | jkl,ghi,ghi | depart,roundabout-exit-1,arrive |
-           | j,f       | jkl,def,def | depart,roundabout-exit-2,arrive |
-           | j,c       | jkl,abc,abc | depart,roundabout-exit-3,arrive |
-
-       Scenario: Collinear in X
-        Given the node map
-            | a | b | c | d | f |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | bcdb  | roundabout |
-            | ce    |            |
-            | df    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                           |
-            | a,e       | ab,ce,ce | depart,roundabout-exit-1,arrive |
-            | a,f       | ab,df,df | depart,roundabout-exit-2,arrive |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | a |   |   |
-            | b |   |   |
-            | c | d | f |
-            | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | bcdb  | roundabout |
-            | ce    |            |
-            | df    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                                         |
-            | a,e       | ab,ce,ce | depart,roundabout turn straight exit-1,arrive |
-            | a,f       | ab,df,df | depart,roundabout turn left exit-2,arrive     |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | a |   |   |
-            | d |   |   |
-            | b | c | f |
-            | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ad    |            |
-            | bcdb  | roundabout |
-            | be    |            |
-            | cf    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                                         |
-            | a,e       | ad,be,be | depart,roundabout turn straight exit-1,arrive |
-            | a,f       | ad,cf,cf | depart,roundabout turn left exit-2,arrive     |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | a |   |   |
-            | c |   |   |
-            | d | b | f |
-            | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ac    |            |
-            | bcdb  | roundabout |
-            | de    |            |
-            | bf    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                                         |
-            | a,e       | ac,de,de | depart,roundabout turn straight exit-1,arrive |
-            | a,f       | ac,bf,bf | depart,roundabout turn left exit-2,arrive     |
-
-    Scenario: Enter and Exit -- too complex
-        Given the node map
-            | j |   | a |   |   |
-            |   | i | b |   |   |
-            |   | g |   | c | d |
-            | h |   | e |   |   |
-            |   |   | f |   |   |
-
-       And the ways
-            | nodes  | junction   |
-            | ab     |            |
-            | ij     |            |
-            | cd     |            |
-            | ef     |            |
-            | gh     |            |
-            | bigecb | roundabout |
-
-       When I route I should get
-           | waypoints | route    | turns                           |
-           | a,d       | ab,cd,cd | depart,roundabout-exit-4,arrive |
-           | a,f       | ab,ef,ef | depart,roundabout-exit-3,arrive |
-           | a,h       | ab,gh,gh | depart,roundabout-exit-2,arrive |
-           | d,f       | cd,ef,ef | depart,roundabout-exit-4,arrive |
-           | d,h       | cd,gh,gh | depart,roundabout-exit-3,arrive |
-           | d,a       | cd,ab,ab | depart,roundabout-exit-1,arrive |
-           | f,h       | ef,gh,gh | depart,roundabout-exit-4,arrive |
-           | f,a       | ef,ab,ab | depart,roundabout-exit-2,arrive |
-           | f,d       | ef,cd,cd | depart,roundabout-exit-1,arrive |
-           | h,a       | gh,ab,ab | depart,roundabout-exit-3,arrive |
-           | h,d       | gh,cd,cd | depart,roundabout-exit-2,arrive |
-           | h,f       | gh,ef,ef | depart,roundabout-exit-1,arrive |
-
-    Scenario: Enter and Exit -- Non-Distinct
-        Given the node map
-           |   |   | a |   |   |
-           |   |   | b |   |   |
-           |   | g |   | c | d |
-           |   |   | e |   |   |
-           | h |   | f |   |   |
-
-       And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | cd    |            |
-            | ef    |            |
-            | gh    |            |
-            | bgecb | roundabout |
-
-       When I route I should get
-           | waypoints | route    | turns                           |
-           | a,d       | ab,cd,cd | depart,roundabout-exit-3,arrive |
-           | a,f       | ab,ef,ef | depart,roundabout-exit-2,arrive |
-           | a,h       | ab,gh,gh | depart,roundabout-exit-1,arrive |
-           | d,f       | cd,ef,ef | depart,roundabout-exit-3,arrive |
-           | d,h       | cd,gh,gh | depart,roundabout-exit-2,arrive |
-           | d,a       | cd,ab,ab | depart,roundabout-exit-1,arrive |
-           | f,h       | ef,gh,gh | depart,roundabout-exit-3,arrive |
-           | f,a       | ef,ab,ab | depart,roundabout-exit-2,arrive |
-           | f,d       | ef,cd,cd | depart,roundabout-exit-1,arrive |
-           | h,a       | gh,ab,ab | depart,roundabout-exit-3,arrive |
-           | h,d       | gh,cd,cd | depart,roundabout-exit-2,arrive |
-           | h,f       | gh,ef,ef | depart,roundabout-exit-1,arrive |
-
-    Scenario: Enter and Exit -- Bearing
-        Given the node map
-           |   |   | a |   |   |
-           |   |   | b |   |   |
-           | h | g |   | c | d |
-           |   |   | e |   |   |
-           |   |   | f |   |   |
-
-       And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | cd    |            |
-            | ef    |            |
-            | gh    |            |
-            | bgecb | roundabout |
-
-       When I route I should get
-           | waypoints | route    | turns                                         | bearing                |
-           | a,d       | ab,cd,cd | depart,roundabout turn left exit-3,arrive     | 0->180,180->224,90->0  |
-           | a,f       | ab,ef,ef | depart,roundabout turn straight exit-2,arrive | 0->180,180->224,180->0 |
-           | a,h       | ab,gh,gh | depart,roundabout turn right exit-1,arrive    | 0->180,180->224,270->0 |
-
@@ -2,7 +2,7 @@
 Feature: Basic Roundabout

    Background:
-        Given the profile "car"
+        Given the profile "testbot"
        Given a grid size of 10 meters

    Scenario: Enter and Exit
@@ -19,28 +19,28 @@ Feature: Basic Roundabout
            | cd     |            |
            | ef     |            |
            | gh     |            |
-            | bgecb  | roundabout |
+            | bcegb  | roundabout |

       When I route I should get
           | waypoints | route    | turns                           |
-           | a,d       | ab,cd,cd | depart,roundabout-exit-3,arrive |
+           | a,d       | ab,cd,cd | depart,roundabout-exit-1,arrive |
           | a,f       | ab,ef,ef | depart,roundabout-exit-2,arrive |
-           | a,h       | ab,gh,gh | depart,roundabout-exit-1,arrive |
-           | d,f       | cd,ef,ef | depart,roundabout-exit-3,arrive |
+           | a,h       | ab,gh,gh | depart,roundabout-exit-3,arrive |
+           | d,f       | cd,ef,ef | depart,roundabout-exit-1,arrive |
           | d,h       | cd,gh,gh | depart,roundabout-exit-2,arrive |
-           | d,a       | cd,ab,ab | depart,roundabout-exit-1,arrive |
-           | f,h       | ef,gh,gh | depart,roundabout-exit-3,arrive |
+           | d,a       | cd,ab,ab | depart,roundabout-exit-3,arrive |
+           | f,h       | ef,gh,gh | depart,roundabout-exit-1,arrive |
           | f,a       | ef,ab,ab | depart,roundabout-exit-2,arrive |
-           | f,d       | ef,cd,cd | depart,roundabout-exit-1,arrive |
-           | h,a       | gh,ab,ab | depart,roundabout-exit-3,arrive |
+           | f,d       | ef,cd,cd | depart,roundabout-exit-3,arrive |
+           | h,a       | gh,ab,ab | depart,roundabout-exit-1,arrive |
           | h,d       | gh,cd,cd | depart,roundabout-exit-2,arrive |
-           | h,f       | gh,ef,ef | depart,roundabout-exit-1,arrive |
+           | h,f       | gh,ef,ef | depart,roundabout-exit-3,arrive |

    Scenario: Only Enter
        Given the node map
            |   |   | a |   |   |
            |   |   | b |   |   |
-            | d | c |   | g | h |
+            | h | g |   | c | d |
            |   |   | e |   |   |
            |   |   | f |   |   |

@@ -53,25 +53,29 @@ Feature: Basic Roundabout
            | bcegb  | roundabout |

       When I route I should get
-           | waypoints | route          | turns                                   |
-           | a,c       | ab,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | a,e       | ab,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | a,g       | ab,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | d,e       | cd,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | d,g       | cd,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | d,b       | cd,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | f,g       | ef,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | f,b       | ef,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | f,c       | ef,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | h,b       | gh,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | h,c       | gh,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
-           | h,e       | gh,bcegb,bcegb | depart,roundabout-exit-undefined,arrive |
+           | waypoints | route    | turns                          |
+           | a,b       | ab,ab    | depart,arrive                  |
+           | a,c       | ab,bcegb | depart,roundabout-enter,arrive |
+           | a,e       | ab,bcegb | depart,roundabout-enter,arrive |
+           | a,g       | ab,bcegb | depart,roundabout-enter,arrive |
+           | d,c       | cd,cd    | depart,arrive                  |
+           | d,e       | cd,bcegb | depart,roundabout-enter,arrive |
+           | d,g       | cd,bcegb | depart,roundabout-enter,arrive |
+           | d,b       | cd,bcegb | depart,roundabout-enter,arrive |
+           | f,e       | ef,ef    | depart,arrive                  |
+           | f,g       | ef,bcegb | depart,roundabout-enter,arrive |
+           | f,b       | ef,bcegb | depart,roundabout-enter,arrive |
+           | f,c       | ef,bcegb | depart,roundabout-enter,arrive |
+           | h,g       | gh,gh    | depart,arrive                  |
+           | h,b       | gh,bcegb | depart,roundabout-enter,arrive |
+           | h,c       | gh,bcegb | depart,roundabout-enter,arrive |
+           | h,e       | gh,bcegb | depart,roundabout-enter,arrive |

    Scenario: Only Exit
        Given the node map
            |   |   | a |   |   |
            |   |   | b |   |   |
-            | d | c |   | g | h |
+            | h | g |   | c | d |
            |   |   | e |   |   |
            |   |   | f |   |   |

@@ -85,25 +89,28 @@ Feature: Basic Roundabout

       When I route I should get
           | waypoints | route       | turns                           |
+           | b,a       | ab,ab       | depart,arrive                   |
           | b,d       | bcegb,cd,cd | depart,roundabout-exit-1,arrive |
           | b,f       | bcegb,ef,ef | depart,roundabout-exit-2,arrive |
           | b,h       | bcegb,gh,gh | depart,roundabout-exit-3,arrive |
+           | c,d       | cd,cd       | depart,arrive                   |
           | c,f       | bcegb,ef,ef | depart,roundabout-exit-1,arrive |
           | c,h       | bcegb,gh,gh | depart,roundabout-exit-2,arrive |
           | c,a       | bcegb,ab,ab | depart,roundabout-exit-3,arrive |
+           | e,f       | ef,ef       | depart,arrive                   |
           | e,h       | bcegb,gh,gh | depart,roundabout-exit-1,arrive |
           | e,a       | bcegb,ab,ab | depart,roundabout-exit-2,arrive |
           | e,d       | bcegb,cd,cd | depart,roundabout-exit-3,arrive |
+           | g,h       | gh,gh       | depart,arrive                   |
           | g,a       | bcegb,ab,ab | depart,roundabout-exit-1,arrive |
           | g,d       | bcegb,cd,cd | depart,roundabout-exit-2,arrive |
           | g,f       | bcegb,ef,ef | depart,roundabout-exit-3,arrive |
-      #phantom node snapping can result in a full round-trip here, therefore we cannot test b->a and the other direct exits

    Scenario: Drive Around
        Given the node map
            |   |   | a |   |   |
            |   |   | b |   |   |
-            | d | c |   | g | h |
+            | h | g |   | c | d |
            |   |   | e |   |   |
            |   |   | f |   |   |

@@ -132,11 +139,11 @@ Feature: Basic Roundabout

     Scenario: Mixed Entry and Exit
        Given the node map
-           |   | c |   | a |   |
-           | j |   | b |   | f |
+           |   | a |   | c |   |
+           | l |   | b |   | d |
           |   | k |   | e |   |
-           | l |   | h |   | d |
-           |   | g |   | i |   |
+           | j |   | h |   | f |
+           |   | i |   | g |   |

        And the ways
           | nodes | junction   | oneway |
@@ -144,296 +151,23 @@ Feature: Basic Roundabout
           | def   |            | yes    |
           | ghi   |            | yes    |
           | jkl   |            | yes    |
-           | bkheb | roundabout | yes    |
+           | behkb | roundabout | yes    |

        When I route I should get
           | waypoints | route       | turns                           |
           | a,c       | abc,abc,abc | depart,roundabout-exit-1,arrive |
-           | a,l       | abc,jkl,jkl | depart,roundabout-exit-2,arrive |
+           | a,f       | abc,def,def | depart,roundabout-exit-2,arrive |
           | a,i       | abc,ghi,ghi | depart,roundabout-exit-3,arrive |
-           | a,f       | abc,def,def | depart,roundabout-exit-4,arrive |
+           | a,l       | abc,jkl,jkl | depart,roundabout-exit-4,arrive |
           | d,f       | def,def,def | depart,roundabout-exit-1,arrive |
-           | d,c       | def,abc,abc | depart,roundabout-exit-2,arrive |
+           | d,i       | def,ghi,ghi | depart,roundabout-exit-2,arrive |
           | d,l       | def,jkl,jkl | depart,roundabout-exit-3,arrive |
-           | d,i       | def,ghi,ghi | depart,roundabout-exit-4,arrive |
+           | d,c       | def,abc,abc | depart,roundabout-exit-4,arrive |
           | g,i       | ghi,ghi,ghi | depart,roundabout-exit-1,arrive |
-           | g,f       | ghi,def,def | depart,roundabout-exit-2,arrive |
+           | g,l       | ghi,jkl,jkl | depart,roundabout-exit-2,arrive |
           | g,c       | ghi,abc,abc | depart,roundabout-exit-3,arrive |
-           | g,l       | ghi,jkl,jkl | depart,roundabout-exit-4,arrive |
+           | g,f       | ghi,edf,edf | depart,roundabout-exit-4,arrive |
           | j,l       | jkl,jkl,jkl | depart,roundabout-exit-1,arrive |
-           | j,i       | jkl,ghi,ghi | depart,roundabout-exit-2,arrive |
+           | j,c       | jkl,abc,abc | depart,roundabout-exit-2,arrive |
           | j,f       | jkl,def,def | depart,roundabout-exit-3,arrive |
-           | j,c       | jkl,abc,abc | depart,roundabout-exit-4,arrive |
-
-    Scenario: Mixed Entry and Exit - segregated roads
-        Given the node map
-           |   |   | a |   | c |   |   |
-           |   |   |   |   |   |   |   |
-           | l |   |   | b |   |   | d |
-           |   |   | k |   | e |   |   |
-           | j |   |   | h |   |   | f |
-           |   |   |   |   |   |   |   |
-           |   |   | i |   | g |   |   |
-
-        And the ways
-           | nodes | junction   | oneway |
-           | abc   |            | yes    |
-           | def   |            | yes    |
-           | ghi   |            | yes    |
-           | jkl   |            | yes    |
-           | bkheb | roundabout | yes    |
-
-        When I route I should get
-           | waypoints | route       | turns                           |
-           | a,c       | abc,abc,abc | depart,roundabout-exit-4,arrive |
-           | a,l       | abc,jkl,jkl | depart,roundabout-exit-1,arrive |
-           | a,i       | abc,ghi,ghi | depart,roundabout-exit-2,arrive |
-           | a,f       | abc,def,def | depart,roundabout-exit-3,arrive |
-           | d,f       | def,def,def | depart,roundabout-exit-4,arrive |
-           | d,c       | def,abc,abc | depart,roundabout-exit-1,arrive |
-           | d,l       | def,jkl,jkl | depart,roundabout-exit-2,arrive |
-           | d,i       | def,ghi,ghi | depart,roundabout-exit-3,arrive |
-           | g,i       | ghi,ghi,ghi | depart,roundabout-exit-4,arrive |
-           | g,f       | ghi,def,def | depart,roundabout-exit-1,arrive |
-           | g,c       | ghi,abc,abc | depart,roundabout-exit-2,arrive |
-           | g,l       | ghi,jkl,jkl | depart,roundabout-exit-3,arrive |
-           | j,l       | jkl,jkl,jkl | depart,roundabout-exit-4,arrive |
-           | j,i       | jkl,ghi,ghi | depart,roundabout-exit-1,arrive |
-           | j,f       | jkl,def,def | depart,roundabout-exit-2,arrive |
-           | j,c       | jkl,abc,abc | depart,roundabout-exit-3,arrive |
-
-    Scenario: Mixed Entry and Exit - segregated roads, different names
-        Given the node map
-           |   |   | a |   | c |   |   |
-           |   |   |   |   |   |   |   |
-           | l |   |   | b |   |   | d |
-           |   |   | k |   | e |   |   |
-           | j |   |   | h |   |   | f |
-           |   |   |   |   |   |   |   |
-           |   |   | i |   | g |   |   |
-
-        And the ways
-           | nodes | junction   | oneway |
-           | ab    |            | yes    |
-           | bc    |            | yes    |
-           | de    |            | yes    |
-           | ef    |            | yes    |
-           | gh    |            | yes    |
-           | hi    |            | yes    |
-           | jk    |            | yes    |
-           | kl    |            | yes    |
-           | bkheb | roundabout | yes    |
-
-        When I route I should get
-           | waypoints | route    | turns                           |
-           | a,c       | ab,bc,bc | depart,roundabout-exit-4,arrive |
-           | a,l       | ab,kl,kl | depart,roundabout-exit-1,arrive |
-           | a,i       | ab,hi,hi | depart,roundabout-exit-2,arrive |
-           | a,f       | ab,ef,ef | depart,roundabout-exit-3,arrive |
-           | d,f       | de,ef,ef | depart,roundabout-exit-4,arrive |
-           | d,c       | de,bc,bc | depart,roundabout-exit-1,arrive |
-           | d,l       | de,kl,kl | depart,roundabout-exit-2,arrive |
-           | d,i       | de,hi,hi | depart,roundabout-exit-3,arrive |
-           | g,i       | gh,hi,hi | depart,roundabout-exit-4,arrive |
-           | g,f       | gh,ef,ef | depart,roundabout-exit-1,arrive |
-           | g,c       | gh,bc,bc | depart,roundabout-exit-2,arrive |
-           | g,l       | gh,kl,kl | depart,roundabout-exit-3,arrive |
-           | j,l       | jk,kl,kl | depart,roundabout-exit-4,arrive |
-           | j,i       | jk,hi,hi | depart,roundabout-exit-1,arrive |
-           | j,f       | jk,ef,ef | depart,roundabout-exit-2,arrive |
-           | j,c       | jk,bc,bc | depart,roundabout-exit-3,arrive |
-
-       Scenario: Collinear in X
-        Given the node map
-            | a | b | c | d | f |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | bcdb  | roundabout |
-            | ce    |            |
-            | df    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                           |
-            | a,e       | ab,ce,ce | depart,roundabout-exit-1,arrive |
-            | a,f       | ab,df,df | depart,roundabout-exit-2,arrive |
-
-       Scenario: Collinear in Y
-        Given the node map
-            |   | a |
-            |   | b |
-            | e | c |
-            |   | d |
-            |   | f |
-
-        And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | bcdb  | roundabout |
-            | ce    |            |
-            | df    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                           |
-            | a,e       | ab,ce,ce | depart,roundabout-exit-1,arrive |
-            | a,f       | ab,df,df | depart,roundabout-exit-2,arrive |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | a |   |   |
-            | b |   |   |
-            | c | d | f |
-            | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ab    |            |
-            | bcdb  | roundabout |
-            | ce    |            |
-            | df    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                           |
-            | a,e       | ab,ce,ce | depart,roundabout-exit-1,arrive |
-            | a,f       | ab,df,df | depart,roundabout-exit-2,arrive |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | a |   |   |
-            | d |   |   |
-            | b | c | f |
-            | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ad    |            |
-            | bcdb  | roundabout |
-            | be    |            |
-            | cf    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                           |
-            | a,e       | ad,be,be | depart,roundabout-exit-1,arrive |
-            | a,f       | ad,cf,cf | depart,roundabout-exit-2,arrive |
-
-       Scenario: Collinear in X,Y
-        Given the node map
-            | a |   |   |
-            | c |   |   |
-            | d | b | f |
-            | e |   |   |
-
-        And the ways
-            | nodes | junction   |
-            | ac    |            |
-            | bcdb  | roundabout |
-            | de    |            |
-            | bf    |            |
-
-        When I route I should get
-            | waypoints | route    | turns                           |
-            | a,e       | ac,de,de | depart,roundabout-exit-1,arrive |
-            | a,f       | ac,bf,bf | depart,roundabout-exit-2,arrive |
-
-    Scenario: Enter and Exit - Bearings
-        Given the node map
-            |   |   |   | a |   |   |   |
-            |   |   |   |   |   |   |   |
-            |   |   | i | b | l |   |   |
-            | h |   | g |   | c |   | d |
-            |   |   | j | e | k |   |   |
-            |   |   |   |   |   |   |   |
-            |   |   |   | f |   |   |   |
-
-       And the ways
-            | nodes      | junction   |
-            | ab         |            |
-            | cd         |            |
-            | ef         |            |
-            | gh         |            |
-            | bigjekclb  | roundabout |
-
-       When I route I should get
-           | waypoints | route    | turns                           | bearing                |
-           | a,d       | ab,cd,cd | depart,roundabout-exit-3,arrive | 0->180,180->270,90->0  |
-           | a,f       | ab,ef,ef | depart,roundabout-exit-2,arrive | 0->180,180->270,180->0 |
-           | a,h       | ab,gh,gh | depart,roundabout-exit-1,arrive | 0->180,180->270,270->0 |
-
-    Scenario: Motorway Roundabout
-    #See 39.933742 -75.082345
-        Given the node map
-            |   |   |   |   | l |   |   |   | a |   | i |
-            |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   | b |   |   |   |   |
-            |   |   |   | c |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   | h |   |   |
-            | n |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   | d |   |   |   |   |   |   |   | j |
-            |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   | m |   |   | g |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   | e |   | f |   |   |   |   |   |   |
-
-        And the ways
-            | nodes | junction   | name     | highway    | oneway | ref    |
-            | ab    |            | crescent | trunk      | yes    | US 130 |
-            | bcd   | roundabout | crescent | trunk      | yes    | US 130 |
-            | de    |            | crescent | trunk      | yes    | US 130 |
-            | fg    |            | crescent | trunk      | yes    | US 130 |
-            | gh    | roundabout | crescent | trunk      | yes    | US 130 |
-            | hi    |            | crescent | trunk      | yes    | US 130 |
-            | jh    |            |          | trunk_link | yes    | NJ 38  |
-            | hb    | roundabout |          | trunk_link | yes    | NJ 38  |
-            | bl    |            |          | trunk_link | yes    | NJ 38  |
-            | cnd   |            | kaighns  | trunk_link | yes    |        |
-            | dmg   | roundabout |          | trunk_link | yes    |        |
-
-        When I route I should get
-            | waypoints | route                                                 | turns                           |
-            | a,e       | crescent (US 130),crescent (US 130),crescent (US 130) | depart,roundabout-exit-3,arrive |
-            | j,l       | NJ 38,NJ 38,NJ 38                                     | depart,roundabout-exit-2,arrive |
-
-    Scenario: Double Roundabout with through-lane
-    #http://map.project-osrm.org/?z=18&center=38.911752%2C-77.048667&loc=38.912003%2C-77.050831&loc=38.909277%2C-77.042516&hl=en&alt=0
-        Given the node map
-            |   |   |   |   | o |   |   |   |   |   |   |   |   |   |   |   | n |   |   |   |   |
-            |   |   |   |   | e |   |   |   |   |   |   |   |   |   |   |   | j |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   | q |   |   |   |   |   |   |   |   |   |   |   |   |   |   |
-            | a |   | b |   |   |   |   |   | s |   | f |   |   |   | g |   |   |   | i |   | k |
-            |   |   |   |   |   |   | r |   |   |   |   |   |   |   |   |   |   | p |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   | t |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   | c |   | d |   |   |   |   |   |   |   |   |   | h |   |   |   |   |
-            |   |   |   |   | l |   |   |   |   |   |   |   |   |   |   |   | m |   |   |   |   |
-
-        And the nodes
-            | node | highway         |
-            | i    | traffic_signals |
-
-        And the ways
-            | nodes   | junction   | name            | oneway |
-            | bcdrqeb | roundabout | sheridan circle | yes    |
-            | ghi     | roundabout | dupont circle   | yes    |
-            | ijg     | roundabout | dupont circle   | yes    |
-            | ab      |            | massachusetts   | no     |
-            | sfgpik  |            | massachusetts   | no     |
-            | cl      |            | 23rd street     | no     |
-            | oe      |            | r street        | no     |
-            | jn      |            | new hampshire   | no     |
-            | mh      |            | new hampshire   | yes    |
-            | rsq     |            | massachusetts   | yes    |
-            | ft      |            | suppressed      | no     |
-
-        And the relations
-            | type        | way:from | way:to | node:via | restriction   |
-            | restriction | sfgpik   | ijg    | i        | no_left_turn  |
-
-        When I route I should get
-            | waypoints | route                                                   | turns                                                     |
-            | a,k       | massachusetts,massachusetts,massachusetts,massachusetts | depart,sheridan circle-exit-2,dupont circle-exit-1,arrive |
+           | j,i       | jkl,ghi,ghi | depart,roundabout-exit-4,arrive |
@@ -1,101 +0,0 @@
-@routing  @guidance
-Feature: Suppress New Names on dedicated Suffices
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 10 meters
-
-    Scenario: Suffix To Suffix
-        Given the node map
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  | name |
-            | ab     | 42 N |
-            | bc     | 42 S |
-
-       When I route I should get
-            | waypoints | route     | turns         |
-            | a,c       | 42 N,42 S | depart,arrive |
-
-    Scenario: Suffix To Suffix Ref
-        Given the node map
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  | name | ref |
-            | ab     | 42 N |     |
-            | bc     | 42 S | 101 |
-
-       When I route I should get
-            | waypoints | route           | turns         |
-            | a,c       | 42 N,42 S (101) | depart,arrive |
-
-    Scenario: Prefix Change
-        Given the node map
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  | name    |
-            | ab     | West 42 |
-            | bc     | East 42 |
-
-       When I route I should get
-            | waypoints | route           | turns         |
-            | a,c       | West 42,East 42 | depart,arrive |
-
-    Scenario: Prefix Change and Reference
-        Given the node map
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  | name    | ref |
-            | ab     | West 42 | 101 |
-            | bc     | East 42 |     |
-
-       When I route I should get
-            | waypoints | route                 | turns         |
-            | a,c       | West 42 (101),East 42 | depart,arrive |
-
-    Scenario: Suffix To Suffix - Turn
-        Given the node map
-            | a |   | b |   | c |
-            |   |   | d |   |   |
-
-        And the ways
-            | nodes  | name |
-            | ab     | 42 N |
-            | bc     | 42 S |
-            | bd     | 42 E |
-
-       When I route I should get
-            | waypoints | route          | turns                    |
-            | a,c       | 42 N,42 S      | depart,arrive            |
-            | a,d       | 42 N,42 E,42 E | depart,turn right,arrive |
-
-    Scenario: Suffix To No Suffix
-        Given the node map
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  | name |
-            | ab     | 42 N |
-            | bc     | 42   |
-
-       When I route I should get
-            | waypoints | route   | turns         |
-            | a,c       | 42 N,42 | depart,arrive |
-
-    Scenario: No Suffix To Suffix
-        Given the node map
-            | a |   | b |   | c |
-
-        And the ways
-            | nodes  | name |
-            | ab     | 42   |
-            | bc     | 42 S |
-
-       When I route I should get
-            | waypoints | route   | turns         |
-            | a,c       | 42,42 S | depart,arrive |
-
@@ -1,66 +0,0 @@
-@routing  @guidance
-Feature: Suppressed Turns
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 10 meters
-
-    Scenario: Do not announce passing a exit ramp
-        Given the node map
-            | a | b | c | d | e |
-            |   |   |   | f | g |
-
-        And the ways
-            | nodes  | highway       |
-            | abcde  | motorway      |
-            | bfg    | motorway_link |
-
-       When I route I should get
-            | waypoints | route         | turns         |
-            | a,e       | abcde,abcde   | depart,arrive |
-
-    Scenario: Do not announce reference changes
-        Given the node map
-            | a | b | c | d | e | f |
-
-        And the ways
-            | nodes | highway  | name     | ref   |
-            | ab    | motorway | highway  | A1    |
-            | bc    | motorway | highway  | A1,A2 |
-            | cd    | motorway | highway  | A2    |
-            | de    | motorway | highway  |       |
-            | ef    | motorway | highway  | A1    |
-
-        When I route I should get
-            | waypoints | route                     | turns         |
-            | a,f       | highway (A1),highway (A1) | depart,arrive |
-
-
-    Scenario: Don't Announce Turn on following major road class -- service
-        Given the node map
-            | a | b | d |
-            |   |   | c |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | service |
-
-        When I route I should get
-            | waypoints | route   | turns         |
-            | a,c       | abc,abc | depart,arrive |
-
-    Scenario: Don't Announce Turn on following major road class -- residential
-        Given the node map
-            | a | b | d |
-            |   |   | c |
-
-        And the ways
-            | nodes | highway     |
-            | abc   | primary     |
-            | bd    | residential |
-
-        When I route I should get
-            | waypoints | route     | turns                       |
-            | a,c       | abc,abc   | depart,arrive               |
-            | a,d       | abc,bd,bd | depart,turn straight,arrive |
@@ -1,835 +0,0 @@
-@routing  @guidance
-Feature: Simple Turns
-
-    Background:
-        Given the profile "car"
-        Given a grid size of 10 meters
-
-    Scenario: Four Way Intersection
-        Given the node map
-            |   | c |   |
-            | a | b | e |
-            |   | d |   |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | cb     | primary |
-            | db     | primary |
-            | eb     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,cb,cb | depart,turn left,arrive         |
-            | a,e       | ab,eb,eb | depart,new name straight,arrive |
-            | a,d       | ab,db,db | depart,turn right,arrive        |
-            | c,a       | cb,ab,ab | depart,turn right,arrive        |
-            | c,d       | cb,db,db | depart,new name straight,arrive |
-            | c,e       | cb,eb,eb | depart,turn left,arrive         |
-            | d,a       | db,ab,ab | depart,turn left,arrive         |
-            | d,c       | db,cb,cb | depart,new name straight,arrive |
-            | d,e       | db,eb,eb | depart,turn right,arrive        |
-            | e,a       | eb,ab,ab | depart,new name straight,arrive |
-            | e,c       | eb,cb,cb | depart,turn right,arrive        |
-            | e,d       | eb,db,db | depart,turn left,arrive         |
-
-    Scenario: Rotated Four Way Intersection
-        Given the node map
-            | a |   | c |
-            |   | b |   |
-            | d |   | e |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | cb     | primary |
-            | db     | primary |
-            | eb     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,cb,cb | depart,turn left,arrive         |
-            | a,e       | ab,eb,eb | depart,new name straight,arrive |
-            | a,d       | ab,db,db | depart,turn right,arrive        |
-            | c,a       | cb,ab,ab | depart,turn right,arrive        |
-            | c,d       | cb,db,db | depart,new name straight,arrive |
-            | c,e       | cb,eb,eb | depart,turn left,arrive         |
-            | d,a       | db,ab,ab | depart,turn left,arrive         |
-            | d,c       | db,cb,cb | depart,new name straight,arrive |
-            | d,e       | db,eb,eb | depart,turn right,arrive        |
-            | e,a       | eb,ab,ab | depart,new name straight,arrive |
-            | e,c       | eb,cb,cb | depart,turn right,arrive        |
-            | e,d       | eb,db,db | depart,turn left,arrive         |
-
-
-    Scenario: Four Way Intersection Through Street
-        Given the node map
-            |   | c |   |
-            | a | b | e |
-            |   | d |   |
-
-        And the ways
-            | nodes  | highway |
-            | abe    | primary |
-            | cb     | primary |
-            | db     | primary |
-
-       When I route I should get
-            | waypoints | route      | turns                           |
-            | a,c       | abe,cb,cb  | depart,turn left,arrive         |
-            | a,e       | abe,abe    | depart,arrive                   |
-            | a,d       | abe,db,db  | depart,turn right,arrive        |
-            | c,a       | cb,abe,abe | depart,turn right,arrive        |
-            | c,d       | cb,db,db   | depart,new name straight,arrive |
-            | c,e       | cb,abe,abe | depart,turn left,arrive         |
-            | d,a       | db,abe,abe | depart,turn left,arrive         |
-            | d,c       | db,cb,cb   | depart,new name straight,arrive |
-            | d,e       | db,abe,abe | depart,turn right,arrive        |
-            | e,a       | abe,abe    | depart,arrive                   |
-            | e,c       | abe,cb,cb  | depart,turn right,arrive        |
-            | e,d       | abe,db,db  | depart,turn left,arrive         |
-
-    Scenario: Four Way Intersection Double Through Street
-        Given the node map
-            |   | c |   |
-            | a | b | e |
-            |   | d |   |
-
-        And the ways
-            | nodes  | highway |
-            | abe    | primary |
-            | cbd    | primary |
-
-       When I route I should get
-            | waypoints | route       | turns                    |
-            | a,c       | abe,cbd,cbd | depart,turn left,arrive  |
-            | a,e       | abe,abe     | depart,arrive            |
-            | a,d       | abe,cbd,cbd | depart,turn right,arrive |
-            | c,a       | cbd,abe,abe | depart,turn right,arrive |
-            | c,d       | cbd,cbd     | depart,arrive            |
-            | c,e       | cbd,abe,abe | depart,turn left,arrive  |
-            | d,a       | cbd,abe,abe | depart,turn left,arrive  |
-            | d,c       | cbd,cbd     | depart,arrive            |
-            | d,e       | cbd,abe,abe | depart,turn right,arrive |
-            | e,a       | abe,abe     | depart,arrive            |
-            | e,c       | abe,cbd,cbd | depart,turn right,arrive |
-            | e,d       | abe,cbd,cbd | depart,turn left,arrive  |
-
-    Scenario: Three Way Intersection
-        Given the node map
-            |   | c |   |
-            | a | b | d |
-
-        And the ways
-            | nodes  | highway |
-            | ab     | primary |
-            | cb     | primary |
-            | db     | primary |
-
-       When I route I should get
-            | waypoints | route    | turns                           |
-            | a,c       | ab,cb,cb | depart,turn left,arrive         |
-            | a,d       | ab,db,db | depart,new name straight,arrive |
-            | d,c       | db,cb,cb | depart,turn right,arrive        |
-            | d,a       | db,ab,ab | depart,new name straight,arrive |
-
-    Scenario: Three Way Intersection on Through Street
-        Given the node map
-            |   | d |   |
-            | a | b | c |
-
-        And the ways
-            | nodes  | highway |
-            | abc    | primary |
-            | db     | primary |
-
-       When I route I should get
-            | waypoints | route     | turns                    |
-            | a,c       | abc,abc   | depart,arrive            |
-            | a,d       | abc,db,db | depart,turn left,arrive  |
-            | c,a       | abc,abc   | depart,arrive            |
-            | c,d       | abc,db,db | depart,turn right,arrive |
-
-     Scenario: High Degree Intersection
-        Given the node map
-            | i |   | b |   | c |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            | h |   | a |   | d |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            | g |   | f |   | e |
-
-        And the ways
-            | nodes | highway |
-            | ab    | primary |
-            | ac    | primary |
-            | ad    | primary |
-            | ae    | primary |
-            | af    | primary |
-            | ag    | primary |
-            | ah    | primary |
-            | ai    | primary |
-
-        When I route I should get
-            | waypoints | route    | turns                           |
-            | b,c       | ab,ac,ac | depart,turn sharp left,arrive   |
-            | b,d       | ab,ad,ad | depart,turn left,arrive         |
-            | b,e       | ab,ae,ae | depart,turn slight left,arrive  |
-            | b,f       | ab,af,af | depart,new name straight,arrive |
-            | b,g       | ab,ag,ag | depart,turn slight right,arrive |
-            | b,h       | ab,ah,ah | depart,turn right,arrive        |
-            | b,i       | ab,ai,ai | depart,turn sharp right,arrive  |
-
-    Scenario: Disturbed High Degree Intersection
-        Given the node map
-            |   |   | b |   |   |
-            | i |   |   |   | c |
-            |   |   |   |   |   |
-            | h |   | a |   | d |
-            |   |   |   |   |   |
-            | g |   |   |   | e |
-            |   |   | f |   |   |
-
-        And the ways
-            | nodes | highway |
-            | ab    | primary |
-            | ac    | primary |
-            | ad    | primary |
-            | ae    | primary |
-            | af    | primary |
-            | ag    | primary |
-            | ah    | primary |
-            | ai    | primary |
-
-        When I route I should get
-            | waypoints | route    | turns                           |
-            | b,c       | ab,ac,ac | depart,turn sharp left,arrive   |
-            | b,d       | ab,ad,ad | depart,turn left,arrive         |
-            | b,e       | ab,ae,ae | depart,turn slight left,arrive  |
-            | b,f       | ab,af,af | depart,new name straight,arrive |
-            | b,g       | ab,ag,ag | depart,turn slight right,arrive |
-            | b,h       | ab,ah,ah | depart,turn right,arrive        |
-            | b,i       | ab,ai,ai | depart,turn sharp right,arrive  |
-
-    Scenario: Turn instructions at high latitude
-        Given the node locations
-            | node | lat       | lon      |
-            | a    | 55.68740  | 12.52430 |
-            | b    | 55.68745  | 12.52409 |
-            | c    | 55.68711  | 12.52383 |
-            | d    | 55.68745  | 12.52450 |
-            | e    | 55.68755  | 12.52450 |
-            | x    | -55.68740 | 12.52430 |
-            | y    | -55.68745 | 12.52409 |
-            | z    | -55.68711 | 12.52383 |
-            | v    | -55.68745 | 12.52450 |
-            | w    | -55.68755 | 12.52450 |
-
-        And the ways
-            | nodes |
-            | ab    |
-            | bc    |
-            | bd    |
-            | be    |
-            | xy    |
-            | yz    |
-            | vy    |
-            | wy    |
-
-        When I route I should get
-            | from | to | route    | turns                    |
-            | a    | c  | ab,bc,bc | depart,turn left,arrive  |
-            | c    | a  | bc,ab,ab | depart,turn right,arrive |
-            | x    | z  | xy,yz,yz | depart,turn right,arrive |
-            | z    | x  | yz,xy,xy | depart,turn left,arrive  |
-
-    Scenario: Four Way Intersection Double Through Street Segregated
-        Given the node map
-            |   | b |   | c |   |
-            | i |   |   |   | d |
-            |   |   | a |   |   |
-            | h |   |   |   | e |
-            |   | g |   | f |   |
-
-        And the ways
-            | nodes  | highway | oneway | name   |
-            | ha     | primary | yes    | first  |
-            | ai     | primary | yes    | first  |
-            | ae     | primary | yes    | first  |
-            | da     | primary | yes    | first  |
-            | ba     | primary | yes    | second |
-            | ac     | primary | yes    | second |
-            | fa     | primary | yes    | second |
-            | ag     | primary | yes    | second |
-
-       When I route I should get
-            | waypoints | route                | turns                        |
-            | f,e       | second,first,first   | depart,turn right,arrive     |
-            | f,c       | second,second        | depart,arrive                |
-            | f,i       | second,first,first   | depart,turn left,arrive      |
-            | f,g       | second,second,second | depart,continue uturn,arrive |
-            | d,c       | first,second,second  | depart,turn right,arrive     |
-            | d,i       | first,first          | depart,arrive                |
-            | d,g       | first,second,second  | depart,turn left,arrive      |
-            | d,e       | first,first,first    | depart,continue uturn,arrive |
-            | b,i       | second,first,first   | depart,turn right,arrive     |
-            | b,g       | second,second        | depart,arrive                |
-            | b,e       | second,first,first   | depart,turn left,arrive      |
-            | b,c       | second,second,second | depart,continue uturn,arrive |
-            | h,g       | first,second,second  | depart,turn right,arrive     |
-            | h,e       | first,first          | depart,arrive                |
-            | h,c       | first,second,second  | depart,turn left,arrive      |
-            | h,i       | first,first,first    | depart,continue uturn,arrive |
-
-    Scenario: Three Way Similar Sharp Turns
-        Given the node map
-            | a |   |   |   | b |
-            | c |   |   |   |   |
-            |   | d |   |   |   |
-
-        And the ways
-            | nodes | highway |
-            | ab    | primary |
-            | bc    | primary |
-            | bd    | primary |
-
-        When I route I should get
-            | waypoints | route    | turns                          |
-            | a,c       | ab,bc,bc | depart,turn sharp right,arrive |
-            | a,d       | ab,bd,bd | depart,turn sharp right,arrive |
-            | d,c       | bd,bc,bc | depart,turn sharp left,arrive  |
-            | d,a       | bd,ab,ab | depart,turn sharp left,arrive  |
-
-    Scenario: Left Turn Assignment (1)
-        Given the node map
-            |   |   |   |   | d |
-            | a |   | b |   | c |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                          |
-            | a,d       | abc,bd,bd | depart,turn slight left,arrive |
-
-    Scenario: Left Turn Assignment (2)
-        Given the node map
-            |   |   |   |   | d |
-            |   |   |   |   |   |
-            | a |   | b |   | c |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                   |
-            | a,d       | abc,bd,bd | depart,turn left,arrive |
-
-    Scenario: Left Turn Assignment (3)
-        Given the node map
-            |   |   |   | d |   |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            | a |   | b |   | c |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                   |
-            | a,d       | abc,bd,bd | depart,turn left,arrive |
-
-    Scenario: Left Turn Assignment (4)
-        Given the node map
-            |   |   | d |   |   |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            | a |   | b |   | c |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                   |
-            | a,d       | abc,bd,bd | depart,turn left,arrive |
-
-    Scenario: Left Turn Assignment (5)
-        Given the node map
-            |   | d |   |   |   |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            | a |   | b |   | c |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                   |
-            | a,d       | abc,bd,bd | depart,turn left,arrive |
-
-    Scenario: Left Turn Assignment (6)
-        Given the node map
-            | d |   |   |   |   |
-            |   |   |   |   |   |
-            | a |   | b |   | c |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                         |
-            | a,d       | abc,bd,bd | depart,turn sharp left,arrive |
-
-    Scenario: Left Turn Assignment (7)
-        Given the node map
-            | d |   |   |   |   |
-            | a |   | b |   | c |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                         |
-            | a,d       | abc,bd,bd | depart,turn sharp left,arrive |
-
-    Scenario: Right Turn Assignment (1)
-        Given the node map
-            |   |   | e |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   | d |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                           |
-            | a,d       | abc,bd,bd | depart,turn slight right,arrive |
-
-    Scenario: Right Turn Assignment (2)
-        Given the node map
-            |   |   | e |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            |   |   |   |   | d |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                    |
-            | a,d       | abc,bd,bd | depart,turn right,arrive |
-
-    Scenario: Right Turn Assignment (3)
-        Given the node map
-            |   |   | e |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            |   |   |   | d |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                    |
-            | a,d       | abc,bd,bd | depart,turn right,arrive |
-
-    Scenario: Right Turn Assignment (4)
-        Given the node map
-            |   |   | e |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            |   |   | d |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                    |
-            | a,d       | abc,bd,bd | depart,turn right,arrive |
-
-    Scenario: Right Turn Assignment (5)
-        Given the node map
-            |   |   | e |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            |   | d |   |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                    |
-            | a,d       | abc,bd,bd | depart,turn right,arrive |
-
-    Scenario: Right Turn Assignment (6)
-        Given the node map
-            |   |   | e |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            | d |   |   |   |   |
-
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                          |
-            | a,d       | abc,bd,bd | depart,turn sharp right,arrive |
-
-    Scenario: Right Turn Assignment (7)
-        Given the node map
-            |   |   | e |   |   |
-            | a |   | b |   | c |
-            | d |   |   |   |   |
-
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                          |
-            | a,d       | abc,bd,bd | depart,turn sharp right,arrive |
-
-   Scenario: Right Turn Assignment Two Turns
-        Given the node map
-            |   |   | f |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            | d | e |   |   |   |
-
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-            | bf    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                          |
-            | a,d       | abc,bd,bd | depart,turn sharp right,arrive |
-            | a,e       | abc,be,be | depart,turn right,arrive       |
-
-   Scenario: Right Turn Assignment Two Turns (2)
-        Given the node map
-            |   |   | f |   | c |
-            | a |   | b |   |   |
-            |   |   |   |   | e |
-            |   |   |   | d |   |
-
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-            | bf    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                           |
-            | a,d       | abc,bd,bd | depart,turn right,arrive        |
-            | a,e       | abc,be,be | depart,turn slight right,arrive |
-
-   Scenario: Right Turn Assignment Two Turns (3)
-        Given the node map
-            |   |   | f |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   | e |
-            |   |   |   | d |   |
-
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-            | bf    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                           |
-            | a,d       | abc,bd,bd | depart,turn right,arrive        |
-            | a,e       | abc,be,be | depart,turn slight right,arrive |
-
-   Scenario: Right Turn Assignment Two Turns (4)
-        Given the node map
-            |   |   | f |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            |   |   | d |   | e |
-
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-            | bf    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                           |
-            | a,d       | abc,bd,bd | depart,turn right,arrive        |
-            | a,e       | abc,be,be | depart,turn slight right,arrive |
-
-   Scenario: Right Turn Assignment Three Turns
-        Given the node map
-            |   |   | g |   |   |
-            | a |   | b |   | c |
-            |   | d |   | f |   |
-            |   |   | e |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-            | bf    | primary |
-            | bg    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                           |
-            | a,d       | abc,bd,bd | depart,turn sharp right,arrive  |
-            | a,e       | abc,be,be | depart,turn right,arrive        |
-            | a,f       | abc,bf,bf | depart,turn slight right,arrive |
-
-    Scenario: Slight Turn involving Oneways
-        Given the node map
-            |   |   | a |   |   |
-            |   |   |   |   |   |
-            |   |   | b |   | e |
-            | d |   |   |   |   |
-            |   |   | c |   |   |
-
-        And the ways
-            | nodes | highway | oneway |
-            | abc   | primary | yes    |
-            | dbe   | primary | no     |
-
-        When I route I should get
-            | waypoints | route   | turns         |
-            | a,c       | abc,abc | depart,arrive |
-            | d,e       | dbe,dbe | depart,arrive |
-            | e,d       | dbe,dbe | depart,arrive |
-
-    Scenario: Slight Turn involving Oneways
-        Given the node map
-            |   |   |   | a |   |
-            |   |   |   |   |   |
-            |   |   |   |   |   |
-            |   |   | b |   | e |
-            | d |   |   |   |   |
-            |   |   | c |   |   |
-
-        And the ways
-            | nodes | highway | oneway |
-            | abc   | primary | yes    |
-            | dbe   | primary | no     |
-
-        When I route I should get
-            | waypoints | route   | turns         |
-            | a,c       | abc,abc | depart,arrive |
-            | d,e       | dbe,dbe | depart,arrive |
-            | e,d       | dbe,dbe | depart,arrive |
-
-
-    Scenario: Slight Turn involving Oneways - Name Change
-        Given the node map
-            |   |   | a |   |   |
-            |   |   |   |   |   |
-            |   |   | b |   | e |
-            | d |   |   |   |   |
-            |   |   | c |   |   |
-
-        And the ways
-            | nodes | highway | oneway |
-            | abc   | primary | yes    |
-            | db    | primary | no     |
-            | be    | primary | no     |
-
-        When I route I should get
-            | waypoints | route    | turns                               |
-            | a,c       | abc,abc  | depart,arrive                       |
-            | d,e       | db,be,be | depart,new name slight right,arrive |
-            | e,d       | be,db,db | depart,new name slight left,arrive  |
-
-     Scenario: Right Turn Assignment Three Conflicting Turns with invalid - 1
-        Given the node map
-            |   |   | g |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            |   | d | e | f |   |
-
-        And the ways
-            | nodes | highway | oneway |
-            | abc   | primary | no     |
-            | db    | primary | yes    |
-            | eb    | primary | no     |
-            | fb    | primary | no     |
-            | bg    | primary | no     |
-
-        When I route I should get
-            | waypoints | route     | turns                           |
-            | a,e       | abc,eb,eb | depart,turn right,arrive        |
-            | a,f       | abc,fb,fb | depart,turn slight right,arrive |
-
-     Scenario: Right Turn Assignment Three Conflicting Turns with invalid - 2
-        Given the node map
-            |   |   | g |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            |   | d | e | f |   |
-
-        And the ways
-            | nodes | highway | oneway |
-            | abc   | primary | no     |
-            | db    | primary | no     |
-            | eb    | primary | yes    |
-            | fb    | primary | no     |
-            | bg    | primary | no     |
-
-        When I route I should get
-            | waypoints | route     | turns                          |
-            | a,d       | abc,db,db | depart,turn sharp right,arrive |
-            | a,f       | abc,fb,fb | depart,turn right,arrive       |
-
-    Scenario: Right Turn Assignment Three Conflicting Turns with invalid - 3
-        Given the node map
-            |   |   | g |   |   |
-            | a |   | b |   | c |
-            |   |   |   |   |   |
-            |   | d | e | f |   |
-
-        And the ways
-            | nodes | highway | oneway |
-            | abc   | primary | no     |
-            | db    | primary | no     |
-            | be    | primary | no     |
-            | fb    | primary | yes    |
-            | bg    | primary | no     |
-
-        When I route I should get
-            | waypoints | route     | turns                          |
-            | a,d       | abc,db,db | depart,turn sharp right,arrive |
-            | a,e       | abc,be,be | depart,turn right,arrive       |
-
-    Scenario: Conflicting Turns with well distinguished turn
-        Given the node map
-            | a |   |   | b |   |   | c |
-            |   |   |   |   |   |   |   |
-            | f |   |   |   |   |   | d |
-            |   |   |   |   |   |   | e |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-            | bf    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                           |
-            | a,d       | abc,bd,bd | depart,turn slight right,arrive |
-            | a,e       | abc,be,be | depart,turn right,arrive        |
-            | a,f       | abc,bf,bf | depart,turn sharp right,arrive  |
-
-    Scenario: Conflicting Turns with well distinguished turn (back)
-        Given the node map
-            | a |   |   | b |   |   | c |
-            |   |   |   |   |   |   |   |
-            | d |   |   |   |   |   | f |
-            |   | e |   |   |   |   |   |
-
-        And the ways
-            | nodes | highway |
-            | abc   | primary |
-            | bd    | primary |
-            | be    | primary |
-            | bf    | primary |
-
-        When I route I should get
-            | waypoints | route     | turns                           |
-            | a,d       | abc,bd,bd | depart,turn sharp right,arrive  |
-            | a,e       | abc,be,be | depart,turn right,arrive        |
-            | a,f       | abc,bf,bf | depart,turn slight right,arrive |
-
-    Scenario: Turn Lane on Splitting up Road
-        Given the node map
-            |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |
-            | g |   |   |   | f |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   |   |   | h |   |   | e |   |   | c |   |   | d |
-            | a |   |   | b |   |   |   |   |   |   |   |   |   |   |   |
-            |   |   |   | i |   |   |   |   |   |   |   |   |   |   |   |
-
-        And the ways
-            | nodes | highway        | oneway | name  |
-            | ab    | secondary      | yes    | road  |
-            | be    | secondary      | yes    | road  |
-            | ecd   | secondary      | no     | road  |
-            | efg   | secondary      | yes    | road  |
-            | ehb   | secondary_link | yes    | road  |
-            | bi    | tertiary       | no     | cross |
-
-        And the relations
-            | type        | way:from | way:to | node:via | restriction  |
-            | restriction | ehb      | be     | b        | no_left_turn |
-
-        When I route I should get
-            | waypoints | route            | turns                   |
-            | a,d       | road,road        | depart,arrive           |
-            | d,i       | road,cross,cross | depart,turn left,arrive |
-            | d,g       | road,road        | depart,arrive           |
@@ -1,30 +0,0 @@
-@prepare @options @files
-Feature: osrm-contract command line options: datasources
-# expansions:
-# {extracted_base} => path to current extracted input file
-# {profile} => path to current profile script
-
-    Background:
-        Given the profile "testbot"
-        Given the extract extra arguments "--generate-edge-lookup"
-        And the node map
-            | a | b |
-        And the ways
-            | nodes |
-            | ab    |
-        And the speed file
-        """
-        1,2,27
-        2,1,27
-        2,3,27
-        3,2,27
-        1,4,27
-        4,1,27
-        """
-        And the data has been extracted
-
-    Scenario: osrm-contract - Passing base file
-        When I run "osrm-contract --segment-speed-file speeds.csv {extracted_base}.osrm"
-        Then stderr should be empty
-        And datasource names should contain "lua profile,speeds"
-        And it should exit with code 0
@@ -10,14 +10,16 @@ module.exports = function () {
    });

    this.Given(/^the extract extra arguments "(.*?)"$/, (args, callback) => {
-        this.setExtractArgs(args, callback);
+        this.setExtractArgs(args);
+        callback();
    });

    this.Given(/^the contract extra arguments "(.*?)"$/, (args, callback) => {
-        this.setContractArgs(args, callback);
+        this.setContractArgs(args);
+        callback();
    });

-    this.Given(/^a grid size of ([0-9.]+) meters$/, (meters, callback) => {
+    this.Given(/^a grid size of (\d+) meters$/, (meters, callback) => {
        this.setGridSize(meters);
        callback();
    });
@@ -47,27 +49,18 @@ module.exports = function () {

        var addNode = (name, ri, ci, cb) => {
            if (name) {
-                var nodeWithID = name.match(/([a-z])\:([0-9]*)/);
-                if (nodeWithID) {
-                    var nodeName = nodeWithID[1],
-                        nodeID = nodeWithID[2];
-                    if (this.nameNodeHash[nodeName]) throw new Error(util.format('*** duplicate node %s', name));
-                    lonLat = this.tableCoordToLonLat(ci, ri);
-                    this.addOSMNode(nodeName, lonLat[0], lonLat[1], nodeID);
-                } else {
-                    if (name.length !== 1) throw new Error(util.format('*** node invalid name %s, must be single characters', name));
-                    if (!name.match(/[a-z0-9]/)) throw new Error(util.format('*** invalid node name %s, must me alphanumeric', name));
+                if (name.length !== 1) throw new Error(util.format('*** node invalid name %s, must be single characters', name));
+                if (!name.match(/[a-z0-9]/)) throw new Error(util.format('*** invalid node name %s, must me alphanumeric', name));

-                    var lonLat;
-                    if (name.match(/[a-z]/)) {
-                        if (this.nameNodeHash[name]) throw new Error(util.format('*** duplicate node %s', name));
-                        lonLat = this.tableCoordToLonLat(ci, ri);
-                        this.addOSMNode(name, lonLat[0], lonLat[1], null);
-                    } else {
-                        if (this.locationHash[name]) throw new Error(util.format('*** duplicate node %s'), name);
-                        lonLat = this.tableCoordToLonLat(ci, ri);
-                        this.addLocation(name, lonLat[0], lonLat[1], null);
-                    }
+                var lonLat;
+                if (name.match(/[a-z]/)) {
+                    if (this.nameNodeHash[name]) throw new Error(util.format('*** duplicate node %s', name));
+                    lonLat = this.tableCoordToLonLat(ci, ri);
+                    this.addOSMNode(name, lonLat[0], lonLat[1], null);
+                } else {
+                    if (this.locationHash[name]) throw new Error(util.format('*** duplicate node %s'), name);
+                    lonLat = this.tableCoordToLonLat(ci, ri);
+                    this.addLocation(name, lonLat[0], lonLat[1], null);
                }

                cb();
@@ -228,20 +221,13 @@ module.exports = function () {
    });

    this.Given(/^the raster source$/, (data, callback) => {
-        this.updateFingerprintExtract(data);
        fs.writeFile(path.resolve(this.TEST_FOLDER, 'rastersource.asc'), data, callback);
    });

    this.Given(/^the speed file$/, (data, callback) => {
-        this.updateFingerprintContract(data);
        fs.writeFile(path.resolve(this.TEST_FOLDER, 'speeds.csv'), data, callback);
    });

-    this.Given(/^the turn penalty file$/, (data, callback) => {
-        this.updateFingerprintContract(data);
-        fs.writeFile(path.resolve(this.TEST_FOLDER, 'penalties.csv'), data, callback);
-    });
-
    this.Given(/^the data has been saved to disk$/, (callback) => {
        try {
            this.reprocess(callback);
@@ -252,11 +238,9 @@ module.exports = function () {
    });

    this.Given(/^the data has been extracted$/, (callback) => {
-        this.osmData.populate(() => {
-            this.writeAndExtract((err) => {
-                if (err) this.processError = err;
-                callback();
-            });
+        this.writeAndExtract((err) => {
+            if (err) this.processError = err;
+            callback();
        });
    });

@@ -1,6 +1,5 @@
 var util = require('util');
 var d3 = require('d3-queue');
-var polyline = require('polyline');

 module.exports = function () {
    this.When(/^I match I should get$/, (table, callback) => {
@@ -34,11 +33,7 @@ module.exports = function () {
                    var subMatchings = [],
                        turns = '',
                        route = '',
-                        duration = '',
-                        annotation = '',
-                        geometry = '',
-                        OSMIDs = '';
-
+                        duration = '';

                    if (res.statusCode === 200) {
                        if (headers.has('matchings')) {
@@ -59,21 +54,6 @@ module.exports = function () {
                            if (json.matchings.length != 1) throw new Error('*** Checking duration only supported for matchings with one subtrace');
                            duration = json.matchings[0].duration;
                        }
-
-                        if (headers.has('annotation')) {
-                            if (json.matchings.length != 1) throw new Error('*** Checking annotation only supported for matchings with one subtrace');
-                            annotation = this.annotationList(json.matchings[0]);
-                        }
-
-                        if (headers.has('geometry')) {
-                            if (json.matchings.length != 1) throw new Error('*** Checking geometry only supported for matchings with one subtrace');
-                            geometry = json.matchings[0].geometry;
-                        }
-
-                        if (headers.has('OSM IDs')) {
-                            if (json.matchings.length != 1) throw new Error('*** CHecking annotation only supported for matchings with one subtrace');
-                            OSMIDs = this.OSMIDList(json.matchings[0]);
-                        }
                    }

                    if (headers.has('turns')) {
@@ -88,21 +68,6 @@ module.exports = function () {
                        got.duration = duration.toString();
                    }

-                    if (headers.has('annotation')) {
-                        got.annotation = annotation.toString();
-                    }
-
-                    if (headers.has('geometry')) {
-                        if (this.queryParams['geometries'] === 'polyline')
-                            got.geometry = polyline.decode(geometry).toString();
-                        else
-                            got.geometry = geometry;
-                    }
-
-                    if (headers.has('OSM IDs')) {
-                        got['OSM IDs'] = OSMIDs;
-                    }
-
                    var ok = true;
                    var encodedResult = '',
                        extendedTarget = '';
@@ -1,8 +1,7 @@
 var assert = require('assert');
-var fs = require('fs');

 module.exports = function () {
-    this.When(/^I run "osrm\-routed\s?(.*?)"$/, { timeout: this.TIMEOUT }, (options, callback) => {
+    this.When(/^I run "osrm\-routed\s?(.*?)"$/, { timeout: this.SHUTDOWN_TIMEOUT }, (options, callback) => {
        this.runBin('osrm-routed', options, () => {
            callback();
        });
@@ -60,11 +59,6 @@ module.exports = function () {
        assert.equal(this.stdout.split('\n').length - 1, parseInt(lines));
    });

-    this.Then(/^datasource names should contain "(.+)"$/, (expectedData) => {
-        var actualData = fs.readFileSync(this.osmData.extractedFile + '.osrm.datasource_names', {encoding:'UTF-8'}).trim().split('\n').join(',');
-        assert.equal(actualData, expectedData);
-    });
-
    this.Given(/^the query options$/, (table, callback) => {
        table.raw().forEach(tuple => {
            this.queryParams[tuple[0]] = tuple[1];
@@ -44,9 +44,12 @@ module.exports = function () {

    this.Then(/^response should be a well-formed route$/, () => {
        this.ShouldBeWellFormed();
-        assert.equal(this.json.code, 'ok');
-        assert.ok(Array.isArray(this.json.routes));
-        assert.ok(Array.isArray(this.json.waypoints));
+        assert.equal(typeof this.json.status_message, 'string');
+        assert.equal(typeof this.json.route_summary, 'object');
+        assert.equal(typeof this.json.route_geometry, 'string');
+        assert.ok(Array.isArray(this.json.route_instructions));
+        assert.ok(Array.isArray(this.json.via_points));
+        assert.ok(Array.isArray(this.json.via_indices));
    });

    this.Then(/^"([^"]*)" should return code (\d+)$/, (binary, code) => {
@@ -12,8 +12,7 @@ module.exports = function () {
                throw new Error('*** routability table must contain either "forw", "backw" or "bothw" column');
            }

-            this.reprocessAndLoadData((e) => {
-                if (e) callback(e);
+            this.reprocessAndLoadData(() => {
                var testRow = (row, i, cb) => {
                    var outputRow = row;

@@ -72,7 +71,6 @@ module.exports = function () {
                r.status = res.statusCode === 200 ? 'x' : null;
                if (r.status) {
                    r.route = this.wayList(r.json.routes[0]);
-                    r.summary = r.json.routes[0].legs.map(l => l.summary).join(',');

                    if (r.route.split(',')[0] === util.format('w%d', i)) {
                        r.time = r.json.routes[0].duration;
@@ -3,7 +3,8 @@ var d3 = require('d3-queue');
 module.exports = function () {
    this.When(/^I route I should get$/, this.WhenIRouteIShouldGet);

-    this.When(/^I route (\d+) times I should get$/, { timeout: 100 * this.TIMEOUT }, (n, table, callback) => {
+    // This is used to route 100 times; timeout for entire step is therefore set to 100 * STRESS_TIMEOUT
+    this.When(/^I route (\d+) times I should get$/, { timeout: 30000 }, (n, table, callback) => {
        var q = d3.queue(1);

        for (var i=0; i<n; i++) {
@@ -46,8 +46,8 @@ module.exports = function () {
                        if (headers.has('trips')) {
                            subTrips = json.trips.filter(t => !!t).map(t => t.legs).map(tl => Array.prototype.concat.apply([], tl.map((sl, i) => {
                                var toAdd = [];
-                                if (i === 0) toAdd.push(sl.steps[0].intersections[0].location);
-                                toAdd.push(sl.steps[sl.steps.length-1].intersections[0].location);
+                                if (i === 0) toAdd.push(sl.steps[0].maneuver.location);
+                                toAdd.push(sl.steps[sl.steps.length-1].maneuver.location);
                                return toAdd;
                            })));
                        }
@@ -110,7 +110,6 @@ module.exports = function () {
                } else {
                    var params = this.queryParams,
                        waypoints = [];
-                    params['steps'] = 'true';
                    if (row.from && row.to) {
                        var fromNode = this.findNodeByName(row.from);
                        if (!fromNode) throw new Error(util.format('*** unknown from-node "%s"', row.from));
@@ -19,6 +19,8 @@ module.exports = function () {

        this.osmData = new classes.osmData(this);

+        this.STRESS_TIMEOUT = 300;
+
        this.OSRMLoader = this._OSRMLoader();

        this.PREPROCESS_LOG_FILE = path.resolve(this.TEST_FOLDER, 'preprocessing.log');
@@ -50,27 +52,22 @@ module.exports = function () {
        };

        var hashExtract = (cb) => {
-            var files = [ util.format('%s/osrm-extract%s', this.BIN_PATH, this.EXE),
-                          util.format('%s/libosrm_extract%s', this.BIN_PATH, this.LIB) ];
-            this.hashOfFiles(files, (hash) => {
+            this.hashOfFiles(util.format('%s/osrm-extract%s', this.BIN_PATH, this.EXE), (hash) => {
                this.binExtractHash = hash;
                cb();
            });
        };

        var hashContract = (cb) => {
-            var files = [ util.format('%s/osrm-contract%s', this.BIN_PATH, this.EXE),
-                          util.format('%s/libosrm_contract%s', this.BIN_PATH, this.LIB) ];
-            this.hashOfFiles(files, (hash) => {
+            this.hashOfFiles(util.format('%s/osrm-contract%s', this.BIN_PATH, this.EXE), (hash) => {
                this.binContractHash = hash;
+                this.fingerprintContract = this.hashString(this.binContractHash);
                cb();
            });
        };

        var hashRouted = (cb) => {
-            var files = [ util.format('%s/osrm-routed%s', this.BIN_PATH, this.EXE),
-                          util.format('%s/libosrm%s', this.BIN_PATH, this.LIB) ];
-            this.hashOfFiles(files, (hash) => {
+            this.hashOfFiles(util.format('%s/osrm-routed%s', this.BIN_PATH, this.EXE), (hash) => {
                this.binRoutedHash = hash;
                this.fingerprintRoute = this.hashString(this.binRoutedHash);
                cb();
@@ -84,18 +81,16 @@ module.exports = function () {
            .defer(hashContract)
            .defer(hashRouted)
            .awaitAll(() => {
+                this.fingerprintExtract = this.hashString([this.profileHash, this.luaLibHash, this.binExtractHash].join('-'));
                this.AfterConfiguration(() => {
                    callback();
                });
            });
    };

-    this.updateFingerprintExtract = (str) => {
-        this.fingerprintExtract = this.hashString([this.fingerprintExtract, str].join('-'));
-    };
-
-    this.updateFingerprintContract = (str) => {
-        this.fingerprintContract = this.hashString([this.fingerprintContract, str].join('-'));
+    this.setProfileBasedHashes = () => {
+        this.fingerprintExtract = this.hashString([this.profileHash, this.luaLibHash, this.binExtractHash].join('-'));
+        this.fingerprintContract = this.hashString(this.binContractHash);
    };

    this.setProfile = (profile, cb) => {
@@ -104,24 +99,17 @@ module.exports = function () {
            this.profile = profile;
            this.hashProfile((hash) => {
                this.profileHash = hash;
-                this.updateFingerprintExtract(this.profileHash);
+                this.setProfileBasedHashes();
                cb();
            });
-        } else {
-            this.updateFingerprintExtract(this.profileHash);
-            cb();
-        }
+        } else cb();
    };

-    this.setExtractArgs = (args, callback) => {
+    this.setExtractArgs = (args) => {
        this.extractArgs = args;
-        this.updateFingerprintExtract(args);
-        callback();
    };

-    this.setContractArgs = (args, callback) => {
+    this.setContractArgs = (args) => {
        this.contractArgs = args;
-        this.updateFingerprintContract(args);
-        callback();
    };
 };
@@ -194,8 +194,8 @@ module.exports = function () {
    this.extractData = (callback) => {
        this.logPreprocessInfo();
        this.log(util.format('== Extracting %s.osm...', this.osmData.osmFile), 'preprocess');
-        var cmd = util.format('%s/osrm-extract %s.osm %s --profile %s/%s.lua >>%s 2>&1',
-            this.BIN_PATH, this.osmData.osmFile, this.extractArgs || '', this.PROFILES_PATH, this.profile, this.PREPROCESS_LOG_FILE);
+        var cmd = util.format('%s%s/osrm-extract %s.osm %s --profile %s/%s.lua >>%s 2>&1',
+            this.LOAD_LIBRARIES, this.BIN_PATH, this.osmData.osmFile, this.extractArgs || '', this.PROFILES_PATH, this.profile, this.PREPROCESS_LOG_FILE);
        this.log(cmd);
        process.chdir(this.TEST_FOLDER);
        exec(cmd, (err) => {
@@ -222,12 +222,11 @@ module.exports = function () {
                });
            };

-            ['osrm', 'osrm.ebg', 'osrm.edges', 'osrm.enw', 'osrm.fileIndex', 'osrm.geometry', 'osrm.icd',
-             'osrm.names', 'osrm.nodes', 'osrm.properties', 'osrm.ramIndex', 'osrm.restrictions'].forEach(file => {
-                 q.defer(rename, file);
-             });
+            ['osrm','osrm.names','osrm.restrictions','osrm.ebg','osrm.enw','osrm.edges','osrm.fileIndex','osrm.geometry','osrm.nodes','osrm.ramIndex','osrm.properties'].forEach(file => {
+                q.defer(rename, file);
+            });

-            ['osrm.edge_penalties', 'osrm.edge_segment_lookup'].forEach(file => {
+            ['osrm.edge_segment_lookup','osrm.edge_penalties'].forEach(file => {
                q.defer(renameIfExists, file);
            });

@@ -242,8 +241,8 @@ module.exports = function () {
    this.contractData = (callback) => {
        this.logPreprocessInfo();
        this.log(util.format('== Contracting %s.osm...', this.osmData.extractedFile), 'preprocess');
-        var cmd = util.format('%s/osrm-contract %s %s.osrm >>%s 2>&1',
-            this.BIN_PATH, this.contractArgs || '', this.osmData.extractedFile, this.PREPROCESS_LOG_FILE);
+        var cmd = util.format('%s%s/osrm-contract %s %s.osrm >>%s 2>&1',
+            this.LOAD_LIBRARIES, this.BIN_PATH, this.contractArgs || '', this.osmData.extractedFile, this.PREPROCESS_LOG_FILE);
        this.log(cmd);
        process.chdir(this.TEST_FOLDER);
        exec(cmd, (err) => {
@@ -261,13 +260,6 @@ module.exports = function () {
                });
            };

-            var renameIfExists = (file, cb) => {
-                fs.stat([this.osmData.extractedFile, file].join('.'), (doesNotExistErr, exists) => {
-                    if (exists) rename(file, cb);
-                    else cb();
-                });
-            };
-
            var copy = (file, cb) => {
                this.log(util.format('Copying %s.%s to %s.%s', this.osmData.extractedFile, file, this.osmData.contractedFile, file), 'preprocess');
                fs.createReadStream([this.osmData.extractedFile, file].join('.'))
@@ -281,17 +273,11 @@ module.exports = function () {

            var q = d3.queue();

-            ['osrm', 'osrm.core', 'osrm.datasource_indexes', 'osrm.datasource_names', 'osrm.ebg','osrm.edges',
-             'osrm.enw', 'osrm.fileIndex', 'osrm.geometry', 'osrm.hsgr', 'osrm.icd','osrm.level', 'osrm.names',
-             'osrm.nodes', 'osrm.properties', 'osrm.ramIndex', 'osrm.restrictions'].forEach((file) => {
-                 q.defer(rename, file);
-             });
-
-            ['osrm.edge_penalties', 'osrm.edge_segment_lookup'].forEach(file => {
-                q.defer(renameIfExists, file);
+            ['osrm.hsgr','osrm.fileIndex','osrm.geometry','osrm.nodes','osrm.ramIndex','osrm.core','osrm.edges','osrm.datasource_indexes','osrm.datasource_names','osrm.level'].forEach((file) => {
+                q.defer(rename, file);
            });

-            [].forEach((file) => {
+            ['osrm.names','osrm.restrictions','osrm.properties','osrm'].forEach((file) => {
                q.defer(copy, file);
            });

@@ -306,33 +292,30 @@ module.exports = function () {
    var noop = (cb) => cb();

    this.reprocess = (callback) => {
-        this.osmData.populate(() => {
+        this.writeAndExtract((e) => {
+            if (e) return callback(e);
            this.isContracted((isContracted) => {
-                if (!isContracted) {
-                    this.writeAndExtract((e) => {
-                        if (e) return callback(e);
-                        this.contractData((e) => {
-                            if (e) return callback(e);
-                            this.logPreprocessDone();
-                            callback();
-                        });
-                    });
-                } else {
-                    this.log('Already contracted ' + this.osmData.contractedFile, 'preprocess');
+                var contractFn = isContracted ? noop : this.contractData;
+                if (isContracted) this.log('Already contracted ' + this.osmData.contractedFile, 'preprocess');
+                contractFn((e) => {
+                    if (e) return callback(e);
+                    this.logPreprocessDone();
                    callback();
-                }
+                });
            });
        });
    };

    this.writeAndExtract = (callback) => {
-        this.writeInputData((e) => {
-            if (e) return callback(e);
-            this.isExtracted((isExtracted) => {
-                var extractFn = isExtracted ? noop : this.extractData;
-                if (isExtracted) this.log('Already extracted ' + this.osmData.extractedFile, 'preprocess');
-                extractFn((e) => {
-                    callback(e);
+        this.osmData.populate(() => {
+            this.writeInputData((e) => {
+                if (e) return callback(e);
+                this.isExtracted((isExtracted) => {
+                    var extractFn = isExtracted ? noop : this.extractData;
+                    if (isExtracted) this.log('Already extracted ' + this.osmData.extractedFile, 'preprocess');
+                    extractFn((e) => {
+                        callback(e);
+                    });
                });
            });
        });
@@ -52,91 +52,24 @@ module.exports = {
        match (got, want) {
            var matchPercent = want.match(/(.*)\s+~(.+)%$/),
                matchAbs = want.match(/(.*)\s+\+\-(.+)$/),
-                matchRe = want.match(/^\/(.*)\/$/),
-                // we use this for matching before/after bearing
-                matchBearingListAbs = want.match(/^((\d+)->(\d+))(,(\d+)->(\d+))*\s+\+\-(.+)$/),
-                matchIntersectionListAbs = want.match(/^(((((true|false):\d+)\s{0,1})+,{0,1})+;{0,1})+\s+\+\-(.+)$/);
-
-            function inRange(margin, got, want) {
-                var fromR = parseFloat(want) - margin,
-                    toR = parseFloat(want) + margin;
-                return parseFloat(got) >= fromR && parseFloat(got) <= toR;
-            }
-            function parseIntersectionString(str) {
-                return str.split(';')
-                          .map((turn_intersections) => turn_intersections
-                                                       .split(',')
-                                                       .map((intersection) => intersection
-                                                                               .split(' ')
-                                                                               .map((entry_bearing_pair) => entry_bearing_pair
-                                                                                                            .split(':'))));
-            }
+                matchRe = want.match(/^\/(.*)\/$/);

            if (got === want) {
                return true;
-            } else if (matchBearingListAbs) {
-                let want_and_margin = want.split('+-'),
-                    margin = parseFloat(want_and_margin[1].trim()),
-                    want_pairs = want_and_margin[0].trim().split(',').map((pair) => pair.split('->')),
-                    got_pairs = got.split(',').map((pair) => pair.split('->'));
-                if (want_pairs.length != got_pairs.length)
-                {
-                    return false;
-                }
-                for (var i = 0; i < want_pairs.length; ++i)
-                {
-                    if (!inRange(margin, got_pairs[i][0], want_pairs[i][0]) ||
-                        !inRange(margin, got_pairs[i][1], want_pairs[i][1]))
-                    {
-                        return false;
-                    }
-                }
-                return true;
-            } else if (matchIntersectionListAbs) {
-                let margin = parseFloat(want.split('+-')[1]),
-                    want_intersections = parseIntersectionString(want.split('+-')[0].trim()),
-                    got_intersections = parseIntersectionString(got);
-                if (want_intersections.length != got_intersections.length)
-                {
-                    return false;
-                }
-                for (let step_idx = 0; step_idx < want_intersections.length; ++step_idx)
-                {
-                    if (want_intersections[step_idx].length != got_intersections[step_idx].length)
-                    {
-                        return false;
-                    }
-                    for (let intersection_idx = 0; intersection_idx < want_intersections[step_idx].length; ++intersection_idx)
-                    {
-                        if (want_intersections[step_idx][intersection_idx].length != got_intersections[step_idx][intersection_idx].length)
-                        {
-                            return false;
-                        }
-                        for (let pair_idx = 0; pair_idx < want_intersections[step_idx][intersection_idx].length; ++pair_idx)
-                        {
-                            let want_pair = want_intersections[step_idx][intersection_idx][pair_idx],
-                                got_pair = got_intersections[step_idx][intersection_idx][pair_idx];
-                            if (got_pair[0] != want_pair[0] ||
-                                !inRange(margin, got_pair[1], want_pair[1]))
-                            {
-                                return false;
-                            }
-                        }
-                    }
-                }
-                return true;
            } else if (matchPercent) {         // percentage range: 100 ~ 5%
                var target = parseFloat(matchPercent[1]),
                    percentage = parseFloat(matchPercent[2]);
                if (target === 0) {
                    return true;
                } else {
-                    let ratio = Math.abs(1 - parseFloat(got) / target);
+                    var ratio = Math.abs(1 - parseFloat(got) / target);
                    return 100 * ratio < percentage;
                }
            } else if (matchAbs) {             // absolute range: 100 +-5
-                let margin = parseFloat(matchAbs[2]);
-                return inRange(margin, got, matchAbs[1]);
+                var margin = parseFloat(matchAbs[2]),
+                    fromR = parseFloat(matchAbs[1]) - margin,
+                    toR = parseFloat(matchAbs[1]) + margin;
+                return parseFloat(got) >= fromR && parseFloat(got) <= toR;
            } else if (matchRe) {               // regex: /a,b,.*/
                return got.match(matchRe[1]);
            } else {
@@ -6,9 +6,9 @@ var d3 = require('d3-queue');

 module.exports = function () {
    this.initializeEnv = (callback) => {
-        this.OSRM_PORT = process.env.OSRM_PORT && parseInt(process.env.OSRM_PORT) || 5000;
-        this.TIMEOUT = process.env.CUCUMBER_TIMEOUT && parseInt(process.env.CUCUMBER_TIMEOUT) || 5000;
-        this.setDefaultTimeout(this.TIMEOUT);
+        this.DEFAULT_PORT = 5000;
+        this.DEFAULT_TIMEOUT = 2000;
+        this.setDefaultTimeout(this.DEFAULT_TIMEOUT);
        this.ROOT_FOLDER = process.cwd();
        this.OSM_USER = 'osrm';
        this.OSM_GENERATOR = 'osrm-test';
@@ -24,20 +24,25 @@ module.exports = function () {
        this.BIN_PATH = path.resolve(this.ROOT_FOLDER, 'build');
        this.DEFAULT_INPUT_FORMAT = 'osm';
        this.DEFAULT_ORIGIN = [1,1];
+        this.LAUNCH_TIMEOUT = 1000;
+        this.SHUTDOWN_TIMEOUT = 10000;
        this.DEFAULT_LOAD_METHOD = 'datastore';
        this.OSRM_ROUTED_LOG_FILE = path.resolve(this.TEST_FOLDER, 'osrm-routed.log');
        this.ERROR_LOG_FILE = path.resolve(this.TEST_FOLDER, 'error.log');

+        // OS X shim to ensure shared libraries from custom locations can be loaded
+        // This is needed in OS X >= 10.11 because DYLD_LIBRARY_PATH is blocked
+        // https://forums.developer.apple.com/thread/9233
+        this.LOAD_LIBRARIES = process.env.OSRM_SHARED_LIBRARY_PATH ? util.format('DYLD_LIBRARY_PATH=%s ', process.env.OSRM_SHARED_LIBRARY_PATH) : '';
+
        // TODO make sure this works on win
        if (process.platform.match(/indows.*/)) {
            this.TERMSIGNAL = 9;
            this.EXE = '.exe';
-            this.LIB = '.dll';
            this.QQ = '"';
        } else {
            this.TERMSIGNAL = 'SIGTERM';
            this.EXE = '';
-            this.LIB = '.so';
            this.QQ = '';
        }

@@ -45,6 +50,26 @@ module.exports = function () {
        console.info(util.format('Node Version', process.version));
        if (parseInt(process.version.match(/v(\d)/)[1]) < 4) throw new Error('*** PLease upgrade to Node 4.+ to run OSRM cucumber tests');

+        if (process.env.OSRM_PORT) {
+            this.OSRM_PORT = parseInt(process.env.OSRM_PORT);
+            // eslint-disable-next-line no-console
+            console.info(util.format('Port set to %d', this.OSRM_PORT));
+        } else {
+            this.OSRM_PORT = this.DEFAULT_PORT;
+            // eslint-disable-next-line no-console
+            console.info(util.format('Using default port %d', this.OSRM_PORT));
+        }
+
+        if (process.env.OSRM_TIMEOUT) {
+            this.OSRM_TIMEOUT = parseInt(process.env.OSRM_TIMEOUT);
+            // eslint-disable-next-line no-console
+            console.info(util.format('Timeout set to %d', this.OSRM_TIMEOUT));
+        } else {
+            this.OSRM_TIMEOUT = this.DEFAULT_TIMEOUT;
+            // eslint-disable-next-line no-console
+            console.info(util.format('Using default timeout %d', this.OSRM_TIMEOUT));
+        }
+
        fs.exists(this.TEST_FOLDER, (exists) => {
            if (!exists) throw new Error(util.format('*** Test folder %s doesn\'t exist.', this.TEST_FOLDER));
            callback();
@@ -62,7 +87,7 @@ module.exports = function () {
            var binPath = path.resolve(util.format('%s/%s%s', this.BIN_PATH, bin, this.EXE));
            fs.exists(binPath, (exists) => {
                if (!exists) throw new Error(util.format('%s is missing. Build failed?', binPath));
-                var helpPath = util.format('%s --help > /dev/null 2>&1', binPath);
+                var helpPath = util.format('%s%s --help > /dev/null 2>&1', this.LOAD_LIBRARIES, binPath);
                exec(helpPath, (err) => {
                    if (err) {
                        this.log(util.format('*** Exited with code %d', err.code), 'preprocess');
@@ -6,19 +6,14 @@ var d3 = require('d3-queue');
 module.exports = function () {
    this.hashOfFiles = (paths, cb) => {
        paths = Array.isArray(paths) ? paths : [paths];
-        var shasum = crypto.createHash('sha1'), hashedFiles = false;
+        var shasum = crypto.createHash('sha1');

        var q = d3.queue(1);

        var addFile = (path, cb) => {
            fs.readFile(path, (err, data) => {
-                if (err && err.code === 'ENOENT') cb(); // ignore non-existing files
-                else if (err) cb(err);
-                else {
-                    shasum.update(data);
-                    hashedFiles = true;
-                    cb();
-                }
+                shasum.update(data);
+                cb(err);
            });
        };

@@ -26,7 +21,6 @@ module.exports = function () {

        q.awaitAll(err => {
            if (err) throw new Error('*** Error reading files:', err);
-            if (!hashedFiles) throw new Error('*** No files found: [' + paths.join(', ') + ']');
            cb(shasum.digest('hex'));
        });
    };
@@ -20,18 +20,14 @@ module.exports = function () {
        this.hasLoggedScenarioInfo = false;
        this.setGridSize(this.DEFAULT_GRID_SIZE);
        this.setOrigin(this.DEFAULT_ORIGIN);
-        this.fingerprintExtract = this.hashString([this.luaLibHash, this.binExtractHash].join('-'));
-        this.fingerprintContract = this.hashString(this.binContractHash);
        callback();
    });

    this.After((scenario, callback) => {
-        this.setExtractArgs('', () => {
-            this.setContractArgs('', () => {
-                if (this.loadMethod === 'directly' && !!this.OSRMLoader.loader) this.OSRMLoader.shutdown(callback);
-                else callback();
-            });
-        });
+        this.setExtractArgs('');
+        this.setContractArgs('');
+        if (this.loadMethod === 'directly' && !!this.OSRMLoader.loader) this.OSRMLoader.shutdown(callback);
+        else callback();
    });

    this.Around('@stress', (scenario, callback) => {
@@ -20,7 +20,7 @@ module.exports = function () {
    };

    this.sendRequest = (baseUri, parameters, callback) => {
-        var limit = Timeout(this.TIMEOUT, { err: { statusCode: 408 } });
+        var limit = Timeout(this.OSRM_TIMEOUT, { err: { statusCode: 408 } });

        var runRequest = (cb) => {
            var params = this.paramsToString(parameters);
@@ -1,9 +1,9 @@
 'use strict';

 var fs = require('fs');
+var net = require('net');
 var spawn = require('child_process').spawn;
 var util = require('util');
-var net = require('net');
 var Timeout = require('node-timeout');

 var OSRMBaseLoader = class {
@@ -12,17 +12,19 @@ var OSRMBaseLoader = class {
    }

    launch (callback) {
-        var limit = Timeout(this.scope.TIMEOUT, { err: this.scope.RoutedError('Launching osrm-routed timed out.') });
+        var limit = Timeout(this.scope.LAUNCH_TIMEOUT, { err: this.scope.RoutedError('Launching osrm-routed timed out.') });

        var runLaunch = (cb) => {
-            this.osrmUp(() => { this.waitForConnection(cb); });
+            this.osrmUp(() => {
+                this.waitForConnection(cb);
+            });
        };

        runLaunch(limit((e) => { if (e) callback(e); else callback(); }));
    }

    shutdown (callback) {
-        var limit = Timeout(this.scope.TIMEOUT, { err: this.scope.RoutedError('Shutting down osrm-routed timed out.')});
+        var limit = Timeout(this.scope.SHUTDOWN_TIMEOUT, { err: this.scope.RoutedError('Shutting down osrm-routed timed out.')});

        var runShutdown = (cb) => {
            this.osrmDown(cb);
@@ -44,21 +46,18 @@ var OSRMBaseLoader = class {
    }

    waitForConnection (callback) {
-        var retryCount = 0;
-        var connectWithRetry = () => {
-            net.connect({ port: this.scope.OSRM_PORT, host: '127.0.0.1' })
-               .on('connect', () => { callback(); })
-               .on('error', () => {
-                   if (retryCount < 2) {
-                       retryCount++;
-                       setTimeout(connectWithRetry, 100);
-                   } else {
-                       callback(new Error('Could not connect to osrm-routed after three retires'));
-                   }
-               });
-        };
-
-        connectWithRetry();
+        net.connect({
+            port: this.scope.OSRM_PORT,
+            host: '127.0.0.1'
+        })
+            .on('connect', () => {
+                callback();
+            })
+            .on('error', (e) => {
+                setTimeout(() => {
+                    callback(e);
+                }, 100);
+            });
    }

    waitForShutdown (callback) {
@@ -87,7 +86,7 @@ var OSRMDirectLoader = class extends OSRMBaseLoader {
            fs.appendFile(this.scope.OSRM_ROUTED_LOG_FILE, data, (err) => { if (err) throw err; });
        };

-        var child = spawn(util.format('%s/osrm-routed', this.scope.BIN_PATH), [this.inputFile, util.format('-p%d', this.scope.OSRM_PORT)]);
+        var child = spawn(util.format('%s%s/osrm-routed', this.scope.LOAD_LIBRARIES, this.scope.BIN_PATH), [this.inputFile, util.format('-p%d', this.scope.OSRM_PORT)]);
        this.scope.pid = child.pid;
        child.stdout.on('data', writeToLog);
        child.stderr.on('data', writeToLog);
@@ -123,7 +122,7 @@ var OSRMDatastoreLoader = class extends OSRMBaseLoader {
            fs.appendFile(this.scope.OSRM_ROUTED_LOG_FILE, data, (err) => { if (err) throw err; });
        };

-        var child = spawn(util.format('%s/osrm-routed', this.scope.BIN_PATH), ['--shared-memory=1', util.format('-p%d', this.scope.OSRM_PORT)]);
+        var child = spawn(util.format('%s%s/osrm-routed', this.scope.LOAD_LIBRARIES, this.scope.BIN_PATH), ['--shared-memory=1', util.format('-p%d', this.scope.OSRM_PORT)]);
        this.child = child;
        this.scope.pid = child.pid;
        child.stdout.on('data', writeToLog);
@@ -149,7 +148,7 @@ module.exports = {
                this.loader = new OSRMDirectLoader(this.scope);
                this.loader.load(inputFile, callback);
            } else {
-                callback(new Error('*** Unknown load method ' + method));
+                throw new Error('*** Unknown load method ' + method);
            }
        }

@@ -1,5 +1,3 @@
-'use strict';
-
 var Timeout = require('node-timeout');
 var request = require('request');

@@ -17,7 +15,7 @@ module.exports = function () {

    this.requestUrl = (path, callback) => {
        var uri = this.query = [this.HOST, path].join('/'),
-            limit = Timeout(this.TIMEOUT, { err: { statusCode: 408 } });
+            limit = Timeout(this.OSRM_TIMEOUT, { err: { statusCode: 408 } });

        function runRequest (cb) {
            request(uri, cb);
@@ -129,43 +127,12 @@ module.exports = function () {
        }
    };

-    this.summary = (instructions) => {
-        if (instructions) {
-            return instructions.legs.map(l => l.summary).join(',');
-        }
-    };
-
    this.wayList = (instructions) => {
        return this.extractInstructionList(instructions, s => s.name);
    };

-    this.pronunciationList = (instructions) => {
-        return this.extractInstructionList(instructions, s => s.pronunciation || '');
-    };
-
-    this.destinationsList = (instructions) => {
-        return this.extractInstructionList(instructions, s => s.destinations || '');
-    };
-
    this.bearingList = (instructions) => {
-        return this.extractInstructionList(instructions, s => s.maneuver.bearing_before + '->' + s.maneuver.bearing_after);
-    };
-
-    this.annotationList = (instructions) => {
-        function zip(list_1, list_2)
-        {
-            let pairs = [];
-            for (let i = 0; i <  list_1.length; ++i) {
-                pairs.push([list_1[i], list_2[i]]);
-            }
-            return pairs;
-        }
-        return instructions.legs.map(l => {return zip(l.annotation.duration, l.annotation.distance).map(p => { return p.join(':'); }).join(','); }).join(',');
-    };
-
-    this.OSMIDList = (instructions) => {
-        // OSM node IDs also come from the annotation list
-        return instructions.legs.map(l => l.annotation.nodes.map(n => n.toString()).join(',')).join(',');
+        return this.extractInstructionList(instructions, s => s.maneuver.bearing_after);
    };

    this.turnList = (instructions) => {
@@ -175,39 +142,16 @@ module.exports = function () {
                case 'depart':
                case 'arrive':
                    return v.maneuver.type;
-                case 'on ramp':
-                case 'off ramp':
-                    return v.maneuver.type + ' ' + v.maneuver.modifier;
                case 'roundabout':
                    return 'roundabout-exit-' + v.maneuver.exit;
-                case 'rotary':
-                    if( 'rotary_name' in v )
-                        return v.rotary_name + '-exit-' + v.maneuver.exit;
-                    else
-                        return 'rotary-exit-' + v.maneuver.exit;
-                case 'roundabout turn':
-                    return v.maneuver.type + ' ' + v.maneuver.modifier + ' exit-' + v.maneuver.exit;
                // FIXME this is a little bit over-simplistic for merge/fork instructions
                default:
-                    return v.maneuver.type + ' ' + v.maneuver.modifier;
+                    return v.maneuver.modifier;
                }
            })
            .join(',');
    };

-    this.intersectionList = (instructions) => {
-        return instructions.legs.reduce((m, v) => m.concat(v.steps), [])
-            .map( v => {
-                return v.intersections
-                    .map( intersection => {
-                        var string = intersection.entry[0]+':'+intersection.bearings[0], i;
-                        for( i = 1; i < intersection.bearings.length; ++i )
-                            string = string + ' ' + intersection.entry[i]+':'+intersection.bearings[i];
-                        return string;
-                    }).join(',');
-            }).join(';');
-    };
-
    this.modeList = (instructions) => {
        return this.extractInstructionList(instructions, s => s.mode);
    };
@@ -25,7 +25,7 @@ module.exports = function () {
            opts = opts.replace('{profile}', [this.PROFILES_PATH, this.profile + '.lua'].join('/'));
        }

-        var cmd = util.format('%s%s/%s%s%s %s 2>%s', this.QQ, this.BIN_PATH, bin, this.EXE, this.QQ, opts, this.ERROR_LOG_FILE);
+        var cmd = util.format('%s%s%s/%s%s%s %s 2>%s', this.QQ, this.LOAD_LIBRARIES, this.BIN_PATH, bin, this.EXE, this.QQ, opts, this.ERROR_LOG_FILE);
        process.chdir(this.TEST_FOLDER);
        exec(cmd, (err, stdout, stderr) => {
            this.stdout = stdout.toString();
@@ -1,5 +1,3 @@
-'use strict';
-
 var util = require('util');
 var assert = require('assert');

@@ -33,23 +31,19 @@ module.exports = function () {
                var afterRequest = (err, res, body) => {
                    if (err) return cb(err);
                    if (body && body.length) {
-                        let destinations, pronunciations, instructions, bearings, turns, modes, times, distances, summary, intersections;
+                        var instructions, bearings, turns, modes, times, distances;

-                        let json = JSON.parse(body);
+                        var json = JSON.parse(body);

-                        let hasRoute = json.code === 'Ok';
+                        var hasRoute = json.code === 'ok';

                        if (hasRoute) {
                            instructions = this.wayList(json.routes[0]);
-                            pronunciations = this.pronunciationList(json.routes[0]);
-                            destinations = this.destinationsList(json.routes[0]);
                            bearings = this.bearingList(json.routes[0]);
                            turns = this.turnList(json.routes[0]);
-                            intersections = this.intersectionList(json.routes[0]);
                            modes = this.modeList(json.routes[0]);
                            times = this.timeList(json.routes[0]);
                            distances = this.distanceList(json.routes[0]);
-                            summary = this.summary(json.routes[0]);
                        }

                        if (headers.has('status')) {
@@ -65,6 +59,14 @@ module.exports = function () {
                            got['#'] = row['#'];
                        }

+                        if (headers.has('start')) {
+                            got.start = instructions ? json.route_summary.start_point : null;
+                        }
+
+                        if (headers.has('end')) {
+                            got.end = instructions ? json.route_summary.end_point : null;
+                        }
+
                        if (headers.has('geometry')) {
                            got.geometry = json.routes[0].geometry;
                        }
@@ -72,10 +74,6 @@ module.exports = function () {
                        if (headers.has('route')) {
                            got.route = (instructions || '').trim();

-                            if (headers.has('summary')) {
-                                got.summary = (summary || '').trim();
-                            }
-
                            if (headers.has('alternative')) {
                                // TODO examine more than first alternative?
                                got.alternative ='';
@@ -113,10 +111,6 @@ module.exports = function () {
                                }
                            }

-                            if (headers.has('intersections')) {
-                                got.intersections = (intersections || '').trim();
-                            }
-
                            var putValue = (key, value) => {
                                if (headers.has(key)) got[key] = instructions ? value : '';
                            };
@@ -126,8 +120,6 @@ module.exports = function () {
                            putValue('modes', modes);
                            putValue('times', times);
                            putValue('distances', distances);
-                            putValue('pronunciations', pronunciations);
-                            putValue('destinations', destinations);
                        }

                        var ok = true;
@@ -3,7 +3,6 @@ Feature: Alternative route

    Background:
        Given the profile "testbot"
-        And a grid size of 200 meters

        And the node map
            |   | b | c | d |   |   |
@@ -18,11 +17,11 @@ Feature: Alternative route
            | dz    |
            | ag    |
            | gh    |
-            | ck    |
-            | kh    |
            | hi    |
            | ij    |
            | jz    |
+            | ck    |
+            | kh    |

    Scenario: Enabled alternative
        Given the query options
@@ -56,7 +56,7 @@ Feature: Basic Routing

    Scenario: Two ways connected in a straight line
        Given the node map
-            | a |   | b |   | c |
+            | a | b | c |

        And the ways
            | nodes |
@@ -14,8 +14,8 @@ Feature: Compass bearing
            | ab    |

        When I route I should get
-            | from | to | route    | bearing      |
-            | a    | b  | ab,ab    | 0->315,315->0|
+            | from | to | route    | bearing   |
+            | a    | b  | ab,ab    | 315,0     |

    Scenario: Bearing when going west
        Given the node map
@@ -26,8 +26,8 @@ Feature: Compass bearing
            | ab    |

        When I route I should get
-            | from | to | route    | bearing      |
-            | a    | b  | ab,ab    | 0->270,270->0|
+            | from | to | route    | bearing |
+            | a    | b  | ab,ab    | 270,0   |

    Scenario: Bearing af 45 degree intervals
        Given the node map
@@ -48,14 +48,14 @@ Feature: Compass bearing

        When I route I should get
            | from | to | route    | bearing |
-            | x    | a  | xa,xa    | 0->0,0->0|
-            | x    | b  | xb,xb    | 0->315,315->0|
-            | x    | c  | xc,xc    | 0->270,270->0|
-            | x    | d  | xd,xd    | 0->225,225->0|
-            | x    | e  | xe,xe    | 0->180,180->0|
-            | x    | f  | xf,xf    | 0->135,135->0|
-            | x    | g  | xg,xg    | 0->90,90->0|
-            | x    | h  | xh,xh    | 0->45,45->0|
+            | x    | a  | xa,xa    | 0,0     |
+            | x    | b  | xb,xb    | 315,0   |
+            | x    | c  | xc,xc    | 270,0   |
+            | x    | d  | xd,xd    | 225,0   |
+            | x    | e  | xe,xe    | 180,0   |
+            | x    | f  | xf,xf    | 135,0   |
+            | x    | g  | xg,xg    | 90,0    |
+            | x    | h  | xh,xh    | 45,0    |

    Scenario: Bearing in a roundabout
        Given the node map
@@ -76,9 +76,9 @@ Feature: Compass bearing
            | ha    | yes    |

        When I route I should get
-            | from | to | route                   | bearing                                                     |
-            | c    | b  | cd,de,ef,fg,gh,ha,ab,ab | 0->270,270->225,225->180,180->135,135->90,90->45,45->0,0->0 |
-            | g    | f  | gh,ha,ab,bc,cd,de,ef,ef | 0->90,90->45,45->0,0->315,315->270,270->225,225->180,180->0 |
+            | from | to | route                   | bearing                   |
+            | c    | b  | cd,de,ef,fg,gh,ha,ab,ab | 270,225,180,135,90,45,0,0 |
+            | g    | f  | gh,ha,ab,bc,cd,de,ef,ef | 90,45,0,315,270,225,180,0 |

    Scenario: Bearing should stay constant when zig-zagging
        Given the node map
@@ -97,7 +97,7 @@ Feature: Compass bearing

        When I route I should get
            | from | to | route                   | bearing               |
-            | a    | h  | ab,bc,cd,de,ef,fg,gh,gh | 0->0,0->135,135->0,0->135,135->0,0->135,135->0,0->0 |
+            | a    | h  | ab,bc,cd,de,ef,fg,gh,gh | 0,135,0,135,0,135,0,0 |

    Scenario: Bearings on an east-west way.
        Given the node map
@@ -108,37 +108,37 @@ Feature: Compass bearing
            | abcdef |

        When I route I should get
-            | from | to | route         | bearing       |
-            | a    | b  | abcdef,abcdef | 0->90,90->0   |
-            | a    | c  | abcdef,abcdef | 0->90,90->0   |
-            | a    | d  | abcdef,abcdef | 0->90,90->0   |
-            | a    | e  | abcdef,abcdef | 0->90,90->0   |
-            | a    | f  | abcdef,abcdef | 0->90,90->0   |
-            | b    | a  | abcdef,abcdef | 0->270,270->0 |
-            | b    | c  | abcdef,abcdef | 0->90,90->0   |
-            | b    | d  | abcdef,abcdef | 0->90,90->0   |
-            | b    | e  | abcdef,abcdef | 0->90,90->0   |
-            | b    | f  | abcdef,abcdef | 0->90,90->0   |
-            | c    | a  | abcdef,abcdef | 0->270,270->0 |
-            | c    | b  | abcdef,abcdef | 0->270,270->0 |
-            | c    | d  | abcdef,abcdef | 0->90,90->0   |
-            | c    | e  | abcdef,abcdef | 0->90,90->0   |
-            | c    | f  | abcdef,abcdef | 0->90,90->0   |
-            | d    | a  | abcdef,abcdef | 0->270,270->0 |
-            | d    | b  | abcdef,abcdef | 0->270,270->0 |
-            | d    | c  | abcdef,abcdef | 0->270,270->0 |
-            | d    | e  | abcdef,abcdef | 0->90,90->0   |
-            | d    | f  | abcdef,abcdef | 0->90,90->0   |
-            | e    | a  | abcdef,abcdef | 0->270,270->0 |
-            | e    | b  | abcdef,abcdef | 0->270,270->0 |
-            | e    | c  | abcdef,abcdef | 0->270,270->0 |
-            | e    | d  | abcdef,abcdef | 0->270,270->0 |
-            | e    | f  | abcdef,abcdef | 0->90,90->0   |
-            | f    | a  | abcdef,abcdef | 0->270,270->0 |
-            | f    | b  | abcdef,abcdef | 0->270,270->0 |
-            | f    | c  | abcdef,abcdef | 0->270,270->0 |
-            | f    | d  | abcdef,abcdef | 0->270,270->0 |
-            | f    | e  | abcdef,abcdef | 0->270,270->0 |
+            | from | to | route         | bearing |
+            | a    | b  | abcdef,abcdef | 90,0    |
+            | a    | c  | abcdef,abcdef | 90,0    |
+            | a    | d  | abcdef,abcdef | 90,0    |
+            | a    | e  | abcdef,abcdef | 90,0    |
+            | a    | f  | abcdef,abcdef | 90,0    |
+            | b    | a  | abcdef,abcdef | 270,0   |
+            | b    | c  | abcdef,abcdef | 90,0    |
+            | b    | d  | abcdef,abcdef | 90,0    |
+            | b    | e  | abcdef,abcdef | 90,0    |
+            | b    | f  | abcdef,abcdef | 90,0    |
+            | c    | a  | abcdef,abcdef | 270,0   |
+            | c    | b  | abcdef,abcdef | 270,0   |
+            | c    | d  | abcdef,abcdef | 90,0    |
+            | c    | e  | abcdef,abcdef | 90,0    |
+            | c    | f  | abcdef,abcdef | 90,0    |
+            | d    | a  | abcdef,abcdef | 270,0   |
+            | d    | b  | abcdef,abcdef | 270,0   |
+            | d    | c  | abcdef,abcdef | 270,0   |
+            | d    | e  | abcdef,abcdef | 90,0    |
+            | d    | f  | abcdef,abcdef | 90,0    |
+            | e    | a  | abcdef,abcdef | 270,0   |
+            | e    | b  | abcdef,abcdef | 270,0   |
+            | e    | c  | abcdef,abcdef | 270,0   |
+            | e    | d  | abcdef,abcdef | 270,0   |
+            | e    | f  | abcdef,abcdef | 90,0    |
+            | f    | a  | abcdef,abcdef | 270,0   |
+            | f    | b  | abcdef,abcdef | 270,0   |
+            | f    | c  | abcdef,abcdef | 270,0   |
+            | f    | d  | abcdef,abcdef | 270,0   |
+            | f    | e  | abcdef,abcdef | 270,0   |

    Scenario: Bearings at high latitudes
    # The coordinas below was calculated using http://www.movable-type.co.uk/scripts/latlong.html,
@@ -161,19 +161,19 @@ Feature: Compass bearing
            | bd    |

        When I route I should get
-            | from | to | route | bearing         |
-            | a    | b  | ab,ab | 0->0,0->0       |
-            | b    | c  | bc,bc | 0->90,90->0     |
-            | c    | d  | cd,cd | 0->180,180->0   |
-            | d    | a  | da,da | 0->270,270->0   |
-            | b    | a  | ab,ab | 0->180,180->0   |
-            | c    | b  | bc,bc | 0->270,270->0   |
-            | d    | c  | cd,cd | 0->0,0->0       |
-            | a    | d  | da,da | 0->90,90->0     |
-            | a    | c  | ac,ac | 0->45,45->0     |
-            | c    | a  | ac,ac | 0->225,225->0   |
-            | b    | d  | bd,bd | 0->135,135->0   |
-            | d    | b  | bd,bd | 0->315,315->0   |
+            | from | to | route | bearing |
+            | a    | b  | ab,ab | 0,0     |
+            | b    | c  | bc,bc | 90,0    |
+            | c    | d  | cd,cd | 180,0   |
+            | d    | a  | da,da | 270,0   |
+            | b    | a  | ab,ab | 180,0   |
+            | c    | b  | bc,bc | 270,0   |
+            | d    | c  | cd,cd | 0,0     |
+            | a    | d  | da,da | 90,0    |
+            | a    | c  | ac,ac | 45,0    |
+            | c    | a  | ac,ac | 225,0   |
+            | b    | d  | bd,bd | 135,0   |
+            | d    | b  | bd,bd | 315,0   |

    Scenario: Bearings at high negative latitudes
    # The coordinas below was calculated using http://www.movable-type.co.uk/scripts/latlong.html,
@@ -196,16 +196,16 @@ Feature: Compass bearing
            | bd    |

        When I route I should get
-            | from | to | route  | bearing         |
-            | a    | b  | ab,ab  | 0->180,180->0   |
-            | b    | c  | bc,bc  | 0->90,90->0     |
-            | c    | d  | cd,cd  | 0->0,0->0       |
-            | d    | a  | da,da  | 0->270,270->0   |
-            | b    | a  | ab,ab  | 0->0,0->0       |
-            | c    | b  | bc,bc  | 0->270,270->0   |
-            | d    | c  | cd,cd  | 0->180,180->0   |
-            | a    | d  | da,da  | 0->90,90->0     |
-            | a    | c  | ac,ac  | 0->135,135->0   |
-            | c    | a  | ac,ac  | 0->315,315->0   |
-            | b    | d  | bd,bd  | 0->45,45->0     |
-            | d    | b  | bd,bd  | 0->225,225->0   |
+            | from | to | route  | bearing |
+            | a    | b  | ab,ab  | 180,0   |
+            | b    | c  | bc,bc  | 90,0    |
+            | c    | d  | cd,cd  | 0,0     |
+            | d    | a  | da,da  | 270,0   |
+            | b    | a  | ab,ab  | 0,0     |
+            | c    | b  | bc,bc  | 270,0   |
+            | d    | c  | cd,cd  | 180,0   |
+            | a    | d  | da,da  | 90,0    |
+            | a    | c  | ac,ac  | 135,0   |
+            | c    | a  | ac,ac  | 315,0   |
+            | b    | d  | bd,bd  | 45,0    |
+            | d    | b  | bd,bd  | 225,0   |
@@ -15,11 +15,11 @@ Feature: Bearing parameter

        When I route I should get
            | from | to | bearings  | route | bearing |
-            | b    | c  | 90 90     | ad,ad | 0->90,90->0|
+            | b    | c  | 90 90     | ad,ad | 90,0    |
            | b    | c  | 180 90    |       |         |
-            | b    | c  | 80 100    | ad,ad | 0->90,90->0|
+            | b    | c  | 80 100    | ad,ad | 90,0    |
            | b    | c  | 79 100    |       |         |
-            | b    | c  | 79,11 100 | ad,ad | 0->90,90->0|
+            | b    | c  | 79,11 100 | ad,ad | 90,0    |

    Scenario: Testbot - Intial bearing in simple case
        Given the node map
@@ -35,16 +35,16 @@ Feature: Bearing parameter
        When I route I should get
            | from | to | bearings | route | bearing |
            | 0    | c  | 0 0      |       |         |
-            | 0    | c  | 45 45    | bc,bc | 0->44,44->0 +- 1|
+            | 0    | c  | 45 45    | bc,bc | 45 ~3%  |
            | 0    | c  | 85 85    |       |         |
            | 0    | c  | 95 95    |       |         |
-            | 0    | c  | 135 135  | ac,ac | 0->135,135->0 +- 1|
+            | 0    | c  | 135 135  | ac,ac | 135 ~1% |
            | 0    | c  | 180 180  |       |         |

    Scenario: Testbot - Initial bearing on split way
        Given the node map
-           | g | d |  |  |  |  | 1 |  |  |  |  | c | f |
-           | h | a |  |  |  |  | 0 |  |  |  |  | b | e |
+        | d |  |  |  |  | 1 |  |  |  |  | c |
+        | a |  |  |  |  | 0 |  |  |  |  | b |

        And the ways
            | nodes | oneway |
@@ -52,26 +52,22 @@ Feature: Bearing parameter
            | bc    | yes    |
            | cd    | yes    |
            | da    | yes    |
-            | be    | yes    |
-            | fc    | yes    |
-            | dg    | yes    |
-            | ha    | yes    |

        When I route I should get
            | from | to | bearings | route       | bearing       |
-            | 0    | b  | 10 10    | bc,bc       | 0->0,0->0     |
-            | 0    | b  | 90 90    | ab,ab       | 0->90,90->0   |
+            | 0    | b  | 10 10    | bc,bc       | 0,0            |
+            | 0    | b  | 90 90    | ab,ab       | 90,0           |
            # The returned bearing is wrong here, it's based on the snapped
            # coordinates, not the acutal edge bearing.  This should be
            # fixed one day, but it's only a problem when we snap two vias
            # to the same point - DP
            #| 0    | b  | 170 170  | da          | 180           |
            #| 0    | b  | 189 189  | da          | 180           |
-            | 0    | 1  | 90 270   | ab,bc,cd,cd    | 0->90,90->0,0->270,270->0      |
-            | 1    | d  | 10 10    | bc,bc          | 0->0,0->0  |
-            | 1    | d  | 90 90    | ab,bc,cd,da,da | 0->90,90->0,0->270,270->180,180->0  |
-            | 1    | 0  | 189 189  | da,da       | 0->180,180->0 |
-            | 1    | d  | 270 270  | cd,cd       | 0->270,270->0 |
+            | 0    | 1  | 90 270   | ab,bc,cd,cd    | 90,0,270,0      |
+            | 1    | d  | 10 10    | bc,bc          | 0,0             |
+            | 1    | d  | 90 90    | ab,bc,cd,da,da | 90,0,270,180,0  |
+            | 1    | 0  | 189 189  | da,da       | 180,0           |
+            | 1    | d  | 270 270  | cd,cd       | 270,0           |
            | 1    | d  | 349 349  |             |               |

    Scenario: Testbot - Initial bearing in all direction
@@ -85,31 +81,31 @@ Feature: Bearing parameter
            | f |  |   | e |   |  | d |

        And the ways
-            | nodes | oneway | name |
-            | ia    | yes    | ia   |
-            | jb    | yes    | jb   |
-            | kc    | yes    | kc   |
-            | ld    | yes    | ld   |
-            | me    | yes    | me   |
-            | nf    | yes    | nf   |
-            | og    | yes    | og   |
-            | ph    | yes    | ph   |
-            | ab    | yes    | ring |
-            | bc    | yes    | ring |
-            | cd    | yes    | ring |
-            | de    | yes    | ring |
-            | ef    | yes    | ring |
-            | fg    | yes    | ring |
-            | gh    | yes    | ring |
-            | ha    | yes    | ring |
+            | nodes | oneway |
+            | ia    | yes    |
+            | jb    | yes    |
+            | kc    | yes    |
+            | ld    | yes    |
+            | me    | yes    |
+            | nf    | yes    |
+            | og    | yes    |
+            | ph    | yes    |
+            | ab    | yes    |
+            | bc    | yes    |
+            | cd    | yes    |
+            | de    | yes    |
+            | ef    | yes    |
+            | fg    | yes    |
+            | gh    | yes    |
+            | ha    | yes    |

        When I route I should get
-            | from | to | bearings | route                       | bearing                                   |
-            | 0    | q  | 0 90     | ia,ring,ring,ring,ring,ring | 0->0,0->90,180->270,270->0,0->90,90->0    |
-            | 0    | a  | 45 90    | jb,ring,ring,ring,ring,ring | 0->45,45->180,180->270,270->0,0->90,90->0 |
-            | 0    | q  | 90 90    | kc,ring,ring,ring,ring      | 0->90,90->180,270->0,0->90,90->0          |
-            | 0    | a  | 135 90   | ld,ring,ring,ring,ring      | 0->135,135->270,270->0,0->90,90->0        |
-            | 0    | a  | 180 90   | me,ring,ring,ring           | 0->180,180->270,0->90,90->0               |
-            | 0    | a  | 225 90   | nf,ring,ring,ring           | 0->225,225->0,0->90,90->0                 |
-            | 0    | a  | 270 90   | og,ring,ring                | 0->270,270->0,90->0                       |
-            | 0    | a  | 315 90   | ph,ring,ring                | 0->315,315->90,90->0                      |
+            | from | to | bearings | route                         | bearing                       |
+            | 0    | q  | 0 90     | ia,ab,bc,cd,de,ef,fg,gh,ha,ha | 0,90,180,180,270,270,0,0,90,0 |
+            | 0    | a  | 45 90    | jb,bc,cd,de,ef,fg,gh,ha,ha    | 45,180,180,270,270,0,0,90,0   |
+            | 0    | q  | 90 90    | kc,cd,de,ef,fg,gh,ha,ha       | 90,180,270,270,0,0,90,0       |
+            | 0    | a  | 135 90   | ld,de,ef,fg,gh,ha,ha          | 135,270,270,0,0,90,0          |
+            | 0    | a  | 180 90   | me,ef,fg,gh,ha,ha             | 180,270,0,0,90,0              |
+            | 0    | a  | 225 90   | nf,fg,gh,ha,ha                | 225,0,0,90,0                  |
+            | 0    | a  | 270 90   | og,gh,ha,ha                   | 270,0,90,0                    |
+            | 0    | a  | 315 90   | ph,ha,ha                      | 315,90,0                      |
@@ -18,5 +18,5 @@ Feature: Geometry Compression

        When I route I should get
            | from | to | route         | distance | speed   |
-            | b    | e  | abcdef,abcdef | 588.8m   | 36 km/h |
-            | e    | b  | abcdef,abcdef | 588.8m   | 36 km/h |
+            | b    | e  | abcdef,abcdef | 589m     | 36 km/h |
+            | e    | b  | abcdef,abcdef | 589m     | 36 km/h |
@@ -24,18 +24,3 @@ Feature: Fixed bugs, kept to check for regressions
        When I route I should get
            | from | to | route   |
            | x    | y  | abc,abc |
-
-    Scenario: Step trimming with very short segments
-        Given a grid size of 0.1 meters
-        Given the node map
-            | a | 1 | b | c | d | 2 | e |
-
-        Given the ways
-            | nodes | oneway |
-            | ab    | yes    |
-            | bcd   | yes    |
-            | de    | yes    |
-
-        When I route I should get
-            | from | to | route     |
-            | 1    | 2  | bcd,bcd   |
@@ -36,5 +36,5 @@ Feature: Basic Routing
            | fy     | last  |

        When I route I should get
-            | from | to | route                 |
-            | x    | y  | first,compr,last,last |
+            | from | to | route                 | turns                    |
+            | x    | y  | first,compr,last,last | depart,right,left,arrive |
@@ -85,64 +85,3 @@ Feature: Basic Map Matching
            | trace | matchings |
            | dcba  | hgfe      |

-    Scenario: Testbot - Matching with oneway streets
-        Given a grid size of 10 meters
-        Given the node map
-            | a | b | c | d |
-            | e | f | g | h |
-
-        And the ways
-            | nodes | oneway |
-            | ab    | yes    |
-            | bc    | yes    |
-            | cd    | yes    |
-            | hg    | yes    |
-            | gf    | yes    |
-            | fe    | yes    |
-
-        When I match I should get
-            | trace | matchings |
-            | dcba  | hg,gf,fe  |
-            | efgh  | ab,bc,cd  |
-
-    Scenario: Testbot - Duration details
-        Given the query options
-            | annotations | true |
-
-        Given the node map
-            | a | b | c | d | e |   | g | h |
-            |   |   | i |   |   |   |   |   |
-
-        And the ways
-            | nodes    | oneway |
-            | abcdegh  | no     |
-            | ci       | no     |
-
-        When I match I should get
-            | trace | matchings | annotation                                                                     |
-            | abeh  | abcedgh   | 1:9.897633,0:0,1:10.008842,1:10.008842,1:10.008842,0:0,2:20.017685,1:10.008842 |
-            | abci  | abc,ci    | 1:9.897633,0:0,1:10.008842,0:0.111209,1:10.010367                              |
-
-        # The following is the same as the above, but separated for readability (line length)
-        When I match I should get
-            | trace | matchings | OSM IDs               |
-            | abeh  | abcedgh   | 1,2,3,2,3,4,5,4,5,6,7 |
-            | abci  | abc,ci    | 1,2,3,2,3,8,3,8       |
-
-    Scenario: Testbot - Geometry details
-        Given the query options
-            | overview   | full     |
-            | geometries | polyline |
-
-        Given the node map
-            | a | b | c |
-            |   | d |   |
-
-        And the ways
-            | nodes | oneway |
-            | abc   | no     |
-            | bd    | no     |
-
-        When I match I should get
-            | trace | matchings | geometry                                |
-            | abd   | abd       | 1,1,1,1.00009,1,1.00009,0.99991,1.00009 |
@@ -11,8 +11,8 @@ Feature: Testbot - Travel mode

    Background:
       Given the profile "testbot"
-       Given a grid size of 200 meters

+    @mokob @2166
    Scenario: Testbot - Always announce mode change
        Given the node map
            | a | b | c | d |
@@ -28,6 +28,7 @@ Feature: Testbot - Travel mode
            | a    | d  | foo,foo,foo,foo | driving,river downstream,driving,driving |
            | b    | d  | foo,foo,foo     | river downstream,driving,driving         |

+    @mokob @2166
    Scenario: Testbot - Compressed Modes
        Given the node map
            | a | b | c | d | e | f | g |
@@ -43,6 +44,7 @@ Feature: Testbot - Travel mode
            | a    | g  | road,liquid,solid,solid  | driving,river downstream,driving,driving |
            | c    | g  | liquid,solid,solid       | river downstream,driving,driving         |

+    @mokob @2166
    Scenario: Testbot - Modes in each direction, different forward/backward speeds
        Given the node map
            |   | 0 | 1 |   |
@@ -73,11 +75,11 @@ Feature: Testbot - Travel mode
            | ab    | steps   |

        When I route I should get
-            | from | to | route | modes                 | time     |
-            | 0    | 1  | ab,ab | steps down,steps down | 120s +-1 |
-            | 1    | 0  | ab,ab | steps up,steps up     | 120s +-1 |
+            | from | to | route | modes                 | time    |
+            | 0    | 1  | ab,ab | steps down,steps down | 60s +-1 |
+            | 1    | 0  | ab,ab | steps up,steps up     | 60s +-1 |

-    @oneway
+    @oneway @mokob @2166
    Scenario: Testbot - Modes for oneway, different forward/backward speeds
        Given the node map
            | a | b |
@@ -105,7 +107,7 @@ Feature: Testbot - Travel mode
            | a    | b  | ab,ab | steps down,steps down |
            | b    | a  |       |                       |

-    @oneway
+    @oneway @mokob @2166
    Scenario: Testbot - Modes for reverse oneway, different forward/backward speeds
        Given the node map
            | a | b |
@@ -133,7 +135,7 @@ Feature: Testbot - Travel mode
            | a    | b  |       |                   |
            | b    | a  | ab,ab | steps up,steps up |

-    @via
+    @via @mokob @2166
    Scenario: Testbot - Mode should be set at via points
        Given the node map
            | a | 1 | b |
@@ -147,6 +149,7 @@ Feature: Testbot - Travel mode
            | a,1,b     | ab,ab,ab,ab | river downstream,river downstream,river downstream,river downstream |
            | b,1,a     | ab,ab,ab,ab | river upstream,river upstream,river upstream,river upstream         |

+    @mokob @2166
    Scenario: Testbot - Starting at a tricky node
       Given the node map
            |  | a |  |   |   |
@@ -161,6 +164,7 @@ Feature: Testbot - Travel mode
            | from | to | route | modes                         |
            | b    | a  | ab,ab | river upstream,river upstream |

+    @mokob @2166
    Scenario: Testbot - Mode changes on straight way without name change
       Given the node map
            | a | 1 | b | 2 | c |
@@ -200,6 +204,7 @@ Feature: Testbot - Travel mode
            | b    | d  | bc,cd,cd          | route,driving,driving                         |
            | a    | f  | ab,bc,cd,de,ef,ef | driving,route,driving,driving,driving,driving |

+    @mokob @2166
    Scenario: Testbot - Modes, triangle map
        Given the node map
            |   |   |   |   |   |   | d |
@@ -234,6 +239,7 @@ Feature: Testbot - Travel mode
            | a    | d  | abc,cd,cd        | driving,driving,driving                        |
            | d    | a  | de,ce,abc,abc    | driving,river upstream,driving,driving         |

+    @mokob @2166
    Scenario: Testbot - River in the middle
        Given the node map
            | a | b | c |   |   |
@@ -1,9 +1,10 @@
-@routing @testbot @overlap @todo
+@routing @testbot @overlap
 Feature: Testbot - overlapping ways
-
+ 
    Background:
        Given the profile "testbot"

+    @bug @610
    Scenario: Testbot - multiple way between same nodes 
    Note that cb is connecting the same two nodes as bc
        Given the node map
@@ -17,10 +18,11 @@ Feature: Testbot - overlapping ways
            | cb    | secondary |

        When I route I should get
-            | from | to | route       |
-            | a    | d  | ab,bc,cd,cd |
-            | d    | a  | cd,bc,ab,ab |
-
+            | from | to | route    |
+            | a    | d  | ab,bc,cd |
+            | d    | a  | cd,bc,ab |
+    
+    @bug @610
    Scenario: Testbot - area on top of way
        Given the node map
            | x | a | b | y |
@@ -32,6 +34,6 @@ Feature: Testbot - overlapping ways
            | abcda | secondary | yes  |

        When I route I should get
-            | from | to | route      |
-            | x    | y  | xaby,xaby  |
-            | y    | x  | xaby,xaby  |
+            | from | to | route |
+            | x    | y  | xaby  |
+            | y    | x  | xaby  |
@@ -24,12 +24,12 @@ Feature: Projection to nearest point on road
    Scenario: Projection onto way at high latitudes, 1km distance
        When I route I should get
            | from | to | route   | bearing   | distance   |
-            | b    | a  | abc,abc | 0->225,225->0 | 1000m +- 7 |
-            | b    | c  | abc,abc | 0->45,45->0 | 1000m +- 7 |
-            | a    | d  | abc,abc | 0->45,45->0 | 1000m +- 7 |
-            | d    | a  | abc,abc | 0->225,225->0 | 1000m +- 7 |
-            | c    | d  | abc,abc | 0->225,224->0 | 1000m +- 8 |
-            | d    | c  | abc,abc | 0->44,45->0  | 1000m +- 8 |
+            | b    | a  | abc,abc | 225,0 +-1 | 1000m +- 7 |
+            | b    | c  | abc,abc | 45,0  +-1 | 1000m +- 7 |
+            | a    | d  | abc,abc | 45,0  +-1 | 1000m +- 7 |
+            | d    | a  | abc,abc | 225,0 +-1 | 1000m +- 7 |
+            | c    | d  | abc,abc | 225,0 +-1 | 1000m +- 8 |
+            | d    | c  | abc,abc | 45 +-1    | 1000m +- 8 |

    Scenario: Projection onto way at high latitudes, no distance
        When I route I should get
--- a/Show More
+++ b/Show More