0266c9d969
The new numbering uses the partition information to sort border nodes first to compactify storages that need access indexed by border node ID. We also get an optimized cache performance for free sincr we can also recursively sort the nodes by cell ID. This implements issue #3779.
66 lines
1.9 KiB
C++
66 lines
1.9 KiB
C++
#ifndef OSRM_PARTITION_RENUMBER_HPP
|
|
#define OSRM_PARTITION_RENUMBER_HPP
|
|
|
|
#include "extractor/edge_based_node_segment.hpp"
|
|
#include "extractor/node_data_container.hpp"
|
|
|
|
#include "partition/bisection_to_partition.hpp"
|
|
#include "partition/edge_based_graph.hpp"
|
|
|
|
#include "util/dynamic_graph.hpp"
|
|
#include "util/static_graph.hpp"
|
|
|
|
namespace osrm
|
|
{
|
|
namespace partition
|
|
{
|
|
std::vector<std::uint32_t> makePermutation(const DynamicEdgeBasedGraph &graph,
|
|
const std::vector<Partition> &partitions);
|
|
|
|
template <typename EdgeDataT>
|
|
inline void renumber(util::DynamicGraph<EdgeDataT> &graph,
|
|
const std::vector<std::uint32_t> &permutation)
|
|
{
|
|
// dynamic graph has own specilization
|
|
graph.Renumber(permutation);
|
|
}
|
|
|
|
template <typename EdgeDataT>
|
|
inline void renumber(util::StaticGraph<EdgeDataT> &graph,
|
|
const std::vector<std::uint32_t> &permutation)
|
|
{
|
|
// static graph has own specilization
|
|
graph.Renumber(permutation);
|
|
}
|
|
|
|
inline void renumber(extractor::EdgeBasedNodeDataContainer &node_data_container,
|
|
const std::vector<std::uint32_t> &permutation)
|
|
{
|
|
node_data_container.Renumber(permutation);
|
|
}
|
|
|
|
inline void renumber(std::vector<Partition> &partitions,
|
|
const std::vector<std::uint32_t> &permutation)
|
|
{
|
|
for (auto &partition : partitions)
|
|
{
|
|
util::inplacePermutation(partition.begin(), partition.end(), permutation);
|
|
}
|
|
}
|
|
|
|
inline void renumber(util::vector_view<extractor::EdgeBasedNodeSegment> &segments,
|
|
const std::vector<std::uint32_t> &permutation)
|
|
{
|
|
for (auto &segment : segments)
|
|
{
|
|
BOOST_ASSERT(segment.forward_segment_id.enabled);
|
|
segment.forward_segment_id.id = permutation[segment.forward_segment_id.id];
|
|
if (segment.reverse_segment_id.enabled)
|
|
segment.reverse_segment_id.id = permutation[segment.reverse_segment_id.id];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif
|