copy dummy cache over
implement retrievePackedPathFromSearchSpace
calculate packed_path_from_source_to_middle
debugging the retrievePackedPathFromSearchSpace function implementation
adding in packed_path_from_source_to_middle
cache is partway working
unpack path and get duration that way
the computeDurationForEdge method
comment out cache
clean up the code
move vector creation and allocation to outside of loop
hack to not return vectors on facade.GetUncompressedForwardDurations and facade.GetUncompressedReverseDurations
clean up hack
add exclude_index to cache key
clearing cache with timestamp
rebase against vectors->range pr
swapped out unordered_map cache with a boost_lru implementation
calculation for cache size
cleaned up comment about cache size calculations
unit tests
cache uses unsigned char for exclude index
clean up cache and unit tests
There is no possibility until multiple-weights are implemented
to break tie in the contraction and the direct shortest path plugin
as duration is not computed during contraction.
This must be fixed after multiple-weights implementation
by using `std::tie(weight, duration)` pairs everywhere.
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).
Add ability to pass extra parameters to during tests.
Limit distance table search so that it doesn't return any big components if they're beyond max_distance.
