Release Date: 2017-07-31 Valhalla 2.3.2
- Bug Fix
- Update to use oneway:psv if oneway:bus does not exist.
- Fix out of bounds memory issue in DoubleBucketQueue.
- Many things are now taken into consideration to determine which sides of the road have what cyclelanes, because they were not being parsed correctly before
- Fixed issue where sometimes a "oneway:bicycle=no" tag on a two-way street would cause the road to become a oneway for bicycles
- Fixed trace_attributes edge_walk cases where the start or end points in the shape are close to graph nodes (intersections)
- Fixed 32bit architecture crashing for certain routes with non-deterministic placement of edges labels in bucketized queue datastructure
- Enhancement
- Improve multi-modal routes by adjusting the pedestrian mode factor (routes use less walking in favor of public transit).
- Added interface framework to support "top-k" paths within map-matching.
- Created a base EdgeLabel class that contains all data needed within costing methods and supports the basic path algorithms (forward direction, A*, with accumulated path distance). Derive class for bidirectional algorithms (BDEdgeLabel) and for multimodal algorithms. Lowers memory use by combining some fields (using spare bits from GraphId).
- Added elapsed time estimates to map-matching labels in preparation for using timestamps in map-matching.
- Added parsing of various OSM tags: "bicycle=use_sidepath", "bicycle=dismount", "segregated=", "shoulder=", "cycleway:buffer=*", and several variations of these.
- Both trace_route and trace_attributes will parse
timeandaccuracyparameters when the shape is provided as unencoded - Map-matching will now use the time (in seconds) of each gps reading (if provided) to narrow the search space and avoid finding matches that are impossibly fast