shared lock for reads and unique lock for writes
declare cache as object and not pointer in serach engine data to simulate singleton declaration
put a lock infront of the clear function to make it threadsafe
remove clear function from cache because cache will never get dropped
unit tests
unit tests and timestamp as part of key
cache generations
hash the key
500 mb
1000 mb
250 mb
rebase against implement-cache
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
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
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
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.
