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
pass in a hashed key to the threadlocal cache
500 mb threadlocal 2 t
fixes and a rebase
correct calculation
For the MLD algorithm we can partition the NodeID range into boundary
and non-boundary nodes. Since there are only we boundary nodes we can
use the ArrayStorage for those yielding much faster query times.
this allows to keep a single Algorithm template parameter in internal
interfaces as
template <typename Algorithm>
search(SearchEngineData<Algorithm> &,
const datafacade::ContiguousInternalMemoryDataFacade<Algorithm> &, ...)
