5e2e1d4c96
Renamed EdgeBasedNode to EdgeBasedNodeSegment
2017-05-17 15:21:51 +00:00
26702920b4
Move ComponentID to EdgeBasedNodeDataContainer
2017-05-17 15:21:51 +00:00
07c7cb3c6c
Rename BinaryHeap to QueryHeap
2017-05-02 15:54:25 +00:00
8ff5a22799
clang-format
2017-04-18 12:01:06 +00:00
4929d1297e
Address PR comments
2017-04-18 12:01:06 +00:00
df0ee955e8
Fingerprint and move .levels
2017-04-18 12:01:06 +00:00
4ec7ca29f1
Fix formating
2017-04-06 15:42:38 +00:00
dce0ce0e17
Fix readGraph to not use UseSharedMemory
2017-04-06 15:42:38 +00:00
ef3fcdc6e6
Refactor graph writing code in contractor
2017-04-06 15:42:38 +00:00
43a7e8e08a
Rename {id|edge_id} to turn_id
2017-03-17 12:27:47 +01:00
eb2e4d0aaf
Load edge based graph to memory in one block and then update
2017-03-17 11:19:58 +00:00
fb552fd751
Apply clang-format
2017-03-10 14:43:02 +00:00
20e028c47b
Split updater code from contract into own module
2017-03-10 14:43:02 +00:00
f42136637d
Add edge-based graph loading in MLD facade
2017-03-08 00:56:50 +00:00
bf690df97a
Merge branch 'minor_fixes' of https://github.com/seemoritz/osrm-backend into seemoritz-minor_fixes
2017-02-07 12:48:29 +00:00
25baf51a2c
Add duration to edges and use it in table plugin
2017-01-27 11:19:37 +01:00
c059d15cb9
Added weight multipliers for speed and turn updates
2017-01-27 11:19:37 +01:00
279f8aabfb
Allow specifing a weight for routing that is independent of duration
2017-01-27 11:19:37 +01:00
226ee62981
refactor graph contractor for readability
...
move to a dedicated dijkstra, separate code and header
reduce heap size, we don't use more than 2000 nodes, so why allocate 170k?
2017-01-18 15:03:15 +01:00
a2a2cf84d1
fix: do not add duplicate edges
...
Previously duplicate edges were added if their weight was worse.
2017-01-13 11:12:02 +01:00
4e897aad50
constexpr implies const, no need to state it twice
2017-01-13 11:12:02 +01:00
5e8bdbfa0c
fix to prevent (very unlikely) overflow of originalEdges
...
If originalEdges gets initialized with 1 << 28, it will overflow and
thereby be set to 0.
Which defeats the point of checking for overflows in the first place.
2017-01-13 11:12:02 +01:00
f6fef5c166
refactor graph contraction: flush moved into dedicated function
2017-01-05 16:28:38 +01:00
bc081b7132
refactor route step / intermediate intersections
...
rename intersection (engine version) to IntermediateIntersection
follow coding convention for existing functions, move invalidate into routeStep
moved elongate into route step
move forward-step-signage into route step
replace post-processings `forwardInto` with `RouteStep` functionality. Don't change maneuver in step
separete declaration and implementation
2016-12-22 08:33:27 +01:00
dc8e6bd8d9
use correct type in graph contractor to avoid overflows in nodes
2016-12-15 10:56:07 +01:00
8c7f744b1a
Update node weights if traffic data is applied.
2016-12-11 16:02:58 +01:00
468d8c0031
Refactor logging, improve error handling workflow, clang-format. ( #3385 )
2016-12-06 12:30:46 -08:00
561b7cc58e
Rember Intersection Shapes
...
Changes the processing order in the edge based graph factory.
Instead of iterating over all outgoing edges in order, we compute the edge
expanded graph in the order of intersections.
This allows to remember intersection shapes and re-use them for all possible ingoing edges.
Also: use low accuracry mode for intersections degree 2 intersections
We can use lower accuracy here, since the `bearing`
after the turn is not as relevant for off-route detection.
Getting lost is near impossible here.
2016-12-01 15:24:20 +01:00
b8795c7341
Rename increasingly inaccuratly named distance member of QueryEdge to weight
2016-10-21 21:00:02 +02:00
3d5a53566c
implement flag edge-weight-updates-over-factor, to log edge weight
...
updates over provided x factor
2016-09-28 15:19:59 +02:00
12d4832037
Fix platform-independent data in data files
2016-06-20 22:45:40 +02:00
ae06300c17
Fix unused variables warnings in crc32
2016-06-20 22:43:28 +02:00
6e16eab6ec
Format with clang-format 3.8
2016-05-27 21:05:04 +02:00
d12a95b4ef
Fix naming convention of Percent
2016-05-02 17:25:58 +02:00
b796033473
Clean up naming conventions in CRC32 code
2016-05-02 17:25:58 +02:00
d078ed67ca
Fix naming convention in GraphContractor
2016-05-02 17:25:58 +02:00
b8f7569e93
Implement arbitrary turn penalty file IO and integration ( #2306 )
...
Closes #1830
2016-04-29 00:48:13 -07:00
7416653874
Force correct type deduction for irange on windows
2016-04-12 18:11:08 +02:00
11b356e55f
Enables the use of multiple segment-speed-files on the osrm-contract
...
command line, and exposes the file name used for each edge in the debug
tiles.
2016-04-05 22:58:32 +02:00
298f68c966
Adds the license preamble for all publicly installed eaders, closes #2036
2016-04-05 22:58:32 +02:00
7c30ea32bf
Runs scripts/format.sh
2016-04-05 22:58:32 +02:00
a013da860e
Fixes unneeded includes in contractor header and self-include
2016-03-15 10:44:33 +01:00
49441fe204
Make forward/reverse weight/offset calculated at query time,
...
rather than being cached in the StaticRTree. This means we
can freely apply traffic data and not have stale values lying
around. It reduces the size of the RTree on disk, at the expense
of some additional data in RAM.
2016-03-03 10:49:12 -08:00
96a5e594b3
Removes profiles from osrm-prepare, only needed in osrm-extract. Fixes #1950 .
2016-03-01 16:43:34 +01:00
7398bed974
Include real coordinates in debug geojson mode
2016-02-11 17:09:20 -05:00
a6e7954128
Make XORFastHash's number of hashable elements compile time constant
...
Still constraint by the usage of uint32_t and subsequent splitting into
two uint16_t we use for indexing into the tables.
2016-01-26 17:54:08 +01:00
439eb9da3d
Create public facing libraries for extractor, contractor and datastore
...
New libraries libosrm_extract, libosrm_contract, libosrm_store
2016-01-21 06:47:34 +01:00
1c1bfd7541
Fix routing when start and target are on the same segment
...
Fixes issue #1864 . Given the simple set-up:
a --> b --> c
^-----------|
This would translate into an edge based graph (ab) -> (bc),
(bc) -> (ca), (ca) -> (ab).
Starting at the end of the one-way street (ab) and going to
the beginning, the query has to find a self-loop within the
graph (ab) -> (bc) -> (ca) -> (ab), as both nodes map to the
same segment (ab).
2016-01-19 23:26:19 +01:00
c93ca02fb8
Rips out dead code from the container.hpp and creates for_each_pai.hpp
...
I added two TODOs that I would like to address in the future.
2016-01-11 20:14:35 +01:00
4813488f84
Split import_edge.hpp: node_based_edge.hpp, edge_based_edge.hpp closes #1604
2016-01-11 20:11:44 +01:00
Michael Krasnyk
Pepijn Schoen
Patrick Niklaus
Moritz Kobitzsch
Moritz Seemann
Daniel Patterson
karenzshea
Lauren Budorick
Daniel J. Hofmann