90e0beaed6
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
91 lines
2.4 KiB
C++
91 lines
2.4 KiB
C++
#ifndef MANY_TO_MANY_ROUTING_HPP
|
|
#define MANY_TO_MANY_ROUTING_HPP
|
|
|
|
#include "engine/algorithm.hpp"
|
|
#include "engine/datafacade.hpp"
|
|
#include "engine/search_engine_data.hpp"
|
|
|
|
#include "util/typedefs.hpp"
|
|
|
|
#include <vector>
|
|
|
|
namespace osrm
|
|
{
|
|
namespace engine
|
|
{
|
|
namespace routing_algorithms
|
|
{
|
|
|
|
namespace
|
|
{
|
|
struct NodeBucket
|
|
{
|
|
NodeID middle_node;
|
|
NodeID parent_node;
|
|
unsigned column_index; // a column in the weight/duration matrix
|
|
EdgeWeight weight;
|
|
EdgeDuration duration;
|
|
|
|
NodeBucket(NodeID middle_node,
|
|
NodeID parent_node,
|
|
unsigned column_index,
|
|
EdgeWeight weight,
|
|
EdgeDuration duration)
|
|
: middle_node(middle_node), parent_node(parent_node), column_index(column_index),
|
|
weight(weight), duration(duration)
|
|
{
|
|
}
|
|
|
|
// partial order comparison
|
|
bool operator<(const NodeBucket &rhs) const
|
|
{
|
|
return std::tie(middle_node, column_index) < std::tie(rhs.middle_node, rhs.column_index);
|
|
}
|
|
|
|
// functor for equal_range
|
|
struct Compare
|
|
{
|
|
bool operator()(const NodeBucket &lhs, const NodeID &rhs) const
|
|
{
|
|
return lhs.middle_node < rhs;
|
|
}
|
|
|
|
bool operator()(const NodeID &lhs, const NodeBucket &rhs) const
|
|
{
|
|
return lhs < rhs.middle_node;
|
|
}
|
|
};
|
|
|
|
// functor for equal_range
|
|
struct ColumnCompare
|
|
{
|
|
unsigned column_idx;
|
|
|
|
ColumnCompare(unsigned column_idx) : column_idx(column_idx){};
|
|
|
|
bool operator()(const NodeBucket &lhs, const NodeID &rhs) const // lowerbound
|
|
{
|
|
return std::tie(lhs.middle_node, lhs.column_index) < std::tie(rhs, column_idx);
|
|
}
|
|
|
|
bool operator()(const NodeID &lhs, const NodeBucket &rhs) const // upperbound
|
|
{
|
|
return std::tie(lhs, column_idx) < std::tie(rhs.middle_node, rhs.column_index);
|
|
}
|
|
};
|
|
};
|
|
}
|
|
|
|
template <typename Algorithm>
|
|
std::vector<EdgeDuration> manyToManySearch(SearchEngineData<Algorithm> &engine_working_data,
|
|
const DataFacade<Algorithm> &facade,
|
|
const std::vector<PhantomNode> &phantom_nodes,
|
|
const std::vector<std::size_t> &source_indices,
|
|
const std::vector<std::size_t> &target_indices);
|
|
|
|
} // namespace routing_algorithms
|
|
} // namespace engine
|
|
} // namespace osrm
|
|
|
|
#endif
|