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.
77 lines
2.3 KiB
C++
77 lines
2.3 KiB
C++
#ifndef OSMR_UTIL_SERIALIZATION_HPP
|
|
#define OSMR_UTIL_SERIALIZATION_HPP
|
|
|
|
#include "util/dynamic_graph.hpp"
|
|
#include "util/packed_vector.hpp"
|
|
#include "util/static_graph.hpp"
|
|
|
|
#include "storage/io.hpp"
|
|
#include "storage/serialization.hpp"
|
|
|
|
namespace osrm
|
|
{
|
|
namespace util
|
|
{
|
|
namespace serialization
|
|
{
|
|
template <typename T, std::size_t Bits, storage::Ownership Ownership>
|
|
inline void read(storage::io::FileReader &reader, detail::PackedVector<T, Bits, Ownership> &vec)
|
|
{
|
|
vec.num_elements = reader.ReadOne<std::uint64_t>();
|
|
storage::serialization::read(reader, vec.vec);
|
|
}
|
|
|
|
template <typename T, std::size_t Bits, storage::Ownership Ownership>
|
|
inline void write(storage::io::FileWriter &writer,
|
|
const detail::PackedVector<T, Bits, Ownership> &vec)
|
|
{
|
|
writer.WriteOne(vec.num_elements);
|
|
storage::serialization::write(writer, vec.vec);
|
|
}
|
|
|
|
template <typename EdgeDataT, storage::Ownership Ownership>
|
|
inline void read(storage::io::FileReader &reader, StaticGraph<EdgeDataT, Ownership> &graph)
|
|
{
|
|
storage::serialization::read(reader, graph.node_array);
|
|
storage::serialization::read(reader, graph.edge_array);
|
|
graph.number_of_nodes = graph.node_array.size() - 1;
|
|
graph.number_of_edges = graph.edge_array.size();
|
|
}
|
|
|
|
template <typename EdgeDataT, storage::Ownership Ownership>
|
|
inline void write(storage::io::FileWriter &writer, const StaticGraph<EdgeDataT, Ownership> &graph)
|
|
{
|
|
storage::serialization::write(writer, graph.node_array);
|
|
storage::serialization::write(writer, graph.edge_array);
|
|
}
|
|
|
|
template <typename EdgeDataT>
|
|
inline void read(storage::io::FileReader &reader, DynamicGraph<EdgeDataT> &graph)
|
|
{
|
|
storage::serialization::read(reader, graph.node_array);
|
|
auto num_edges = reader.ReadElementCount64();
|
|
graph.edge_list.resize(num_edges);
|
|
for (auto index : irange<std::size_t>(0, num_edges))
|
|
{
|
|
reader.ReadOne(graph.edge_list[index]);
|
|
}
|
|
graph.number_of_nodes = graph.node_array.size();
|
|
graph.number_of_edges = num_edges;
|
|
}
|
|
|
|
template <typename EdgeDataT>
|
|
inline void write(storage::io::FileWriter &writer, const DynamicGraph<EdgeDataT> &graph)
|
|
{
|
|
storage::serialization::write(writer, graph.node_array);
|
|
writer.WriteElementCount64(graph.number_of_edges);
|
|
for (auto index : irange<std::size_t>(0, graph.number_of_edges))
|
|
{
|
|
writer.WriteOne(graph.edge_list[index]);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif
|