Consolidate read/write code in updater for compressed geometries

This commit is contained in:
Patrick Niklaus 2017-03-09 00:41:18 +00:00 committed by Patrick Niklaus
parent 1b5ab37dfd
commit 4986f5ea2d
4 changed files with 113 additions and 227 deletions

View File

@ -8,7 +8,7 @@
#include "engine/algorithm.hpp" #include "engine/algorithm.hpp"
#include "engine/geospatial_query.hpp" #include "engine/geospatial_query.hpp"
#include "extractor/compressed_edge_container.hpp" #include "extractor/segment_data_container.hpp"
#include "extractor/guidance/turn_instruction.hpp" #include "extractor/guidance/turn_instruction.hpp"
#include "extractor/guidance/turn_lane_types.hpp" #include "extractor/guidance/turn_lane_types.hpp"
#include "extractor/profile_properties.hpp" #include "extractor/profile_properties.hpp"
@ -218,18 +218,13 @@ class ContiguousInternalMemoryDataFacadeBase : public BaseDataFacade
util::ShM<util::guidance::TurnBearing, true>::vector m_post_turn_bearing; util::ShM<util::guidance::TurnBearing, true>::vector m_post_turn_bearing;
util::NameTable m_names_table; util::NameTable m_names_table;
util::ShM<unsigned, true>::vector m_name_begin_indices; util::ShM<unsigned, true>::vector m_name_begin_indices;
util::ShM<unsigned, true>::vector m_geometry_indices;
util::ShM<NodeID, true>::vector m_geometry_node_list;
util::ShM<EdgeWeight, true>::vector m_geometry_fwd_weight_list;
util::ShM<EdgeWeight, true>::vector m_geometry_rev_weight_list;
util::ShM<EdgeWeight, true>::vector m_geometry_fwd_duration_list;
util::ShM<EdgeWeight, true>::vector m_geometry_rev_duration_list;
util::ShM<bool, true>::vector m_is_core_node; util::ShM<bool, true>::vector m_is_core_node;
util::ShM<DatasourceID, true>::vector m_datasource_list; util::ShM<DatasourceID, true>::vector m_datasource_list;
util::ShM<std::uint32_t, true>::vector m_lane_description_offsets; util::ShM<std::uint32_t, true>::vector m_lane_description_offsets;
util::ShM<extractor::guidance::TurnLaneType::Mask, true>::vector m_lane_description_masks; util::ShM<extractor::guidance::TurnLaneType::Mask, true>::vector m_lane_description_masks;
util::ShM<TurnPenalty, true>::vector m_turn_weight_penalties; util::ShM<TurnPenalty, true>::vector m_turn_weight_penalties;
util::ShM<TurnPenalty, true>::vector m_turn_duration_penalties; util::ShM<TurnPenalty, true>::vector m_turn_duration_penalties;
extractor::SegmentDataView segment_data;
util::ShM<char, true>::vector m_datasource_name_data; util::ShM<char, true>::vector m_datasource_name_data;
util::ShM<std::size_t, true>::vector m_datasource_name_offsets; util::ShM<std::size_t, true>::vector m_datasource_name_offsets;
@ -441,48 +436,49 @@ class ContiguousInternalMemoryDataFacadeBase : public BaseDataFacade
data_layout.GetBlockPtr<unsigned>(memory_block, storage::DataLayout::GEOMETRIES_INDEX); data_layout.GetBlockPtr<unsigned>(memory_block, storage::DataLayout::GEOMETRIES_INDEX);
util::ShM<unsigned, true>::vector geometry_begin_indices( util::ShM<unsigned, true>::vector geometry_begin_indices(
geometries_index_ptr, data_layout.num_entries[storage::DataLayout::GEOMETRIES_INDEX]); geometries_index_ptr, data_layout.num_entries[storage::DataLayout::GEOMETRIES_INDEX]);
m_geometry_indices = std::move(geometry_begin_indices);
auto geometries_node_list_ptr = data_layout.GetBlockPtr<NodeID>( auto geometries_node_list_ptr = data_layout.GetBlockPtr<NodeID>(
memory_block, storage::DataLayout::GEOMETRIES_NODE_LIST); memory_block, storage::DataLayout::GEOMETRIES_NODE_LIST);
util::ShM<NodeID, true>::vector geometry_node_list( util::ShM<NodeID, true>::vector geometry_node_list(
geometries_node_list_ptr, geometries_node_list_ptr,
data_layout.num_entries[storage::DataLayout::GEOMETRIES_NODE_LIST]); data_layout.num_entries[storage::DataLayout::GEOMETRIES_NODE_LIST]);
m_geometry_node_list = std::move(geometry_node_list);
auto geometries_fwd_weight_list_ptr = data_layout.GetBlockPtr<EdgeWeight>( auto geometries_fwd_weight_list_ptr = data_layout.GetBlockPtr<EdgeWeight>(
memory_block, storage::DataLayout::GEOMETRIES_FWD_WEIGHT_LIST); memory_block, storage::DataLayout::GEOMETRIES_FWD_WEIGHT_LIST);
util::ShM<EdgeWeight, true>::vector geometry_fwd_weight_list( util::ShM<EdgeWeight, true>::vector geometry_fwd_weight_list(
geometries_fwd_weight_list_ptr, geometries_fwd_weight_list_ptr,
data_layout.num_entries[storage::DataLayout::GEOMETRIES_FWD_WEIGHT_LIST]); data_layout.num_entries[storage::DataLayout::GEOMETRIES_FWD_WEIGHT_LIST]);
m_geometry_fwd_weight_list = std::move(geometry_fwd_weight_list);
auto geometries_rev_weight_list_ptr = data_layout.GetBlockPtr<EdgeWeight>( auto geometries_rev_weight_list_ptr = data_layout.GetBlockPtr<EdgeWeight>(
memory_block, storage::DataLayout::GEOMETRIES_REV_WEIGHT_LIST); memory_block, storage::DataLayout::GEOMETRIES_REV_WEIGHT_LIST);
util::ShM<EdgeWeight, true>::vector geometry_rev_weight_list( util::ShM<EdgeWeight, true>::vector geometry_rev_weight_list(
geometries_rev_weight_list_ptr, geometries_rev_weight_list_ptr,
data_layout.num_entries[storage::DataLayout::GEOMETRIES_REV_WEIGHT_LIST]); data_layout.num_entries[storage::DataLayout::GEOMETRIES_REV_WEIGHT_LIST]);
m_geometry_rev_weight_list = std::move(geometry_rev_weight_list);
auto datasources_list_ptr = data_layout.GetBlockPtr<DatasourceID>(
memory_block, storage::DataLayout::DATASOURCES_LIST);
util::ShM<DatasourceID, true>::vector datasources_list(
datasources_list_ptr, data_layout.num_entries[storage::DataLayout::DATASOURCES_LIST]);
m_datasource_list = std::move(datasources_list);
auto geometries_fwd_duration_list_ptr = data_layout.GetBlockPtr<EdgeWeight>( auto geometries_fwd_duration_list_ptr = data_layout.GetBlockPtr<EdgeWeight>(
memory_block, storage::DataLayout::GEOMETRIES_FWD_DURATION_LIST); memory_block, storage::DataLayout::GEOMETRIES_FWD_DURATION_LIST);
util::ShM<EdgeWeight, true>::vector geometry_fwd_duration_list( util::ShM<EdgeWeight, true>::vector geometry_fwd_duration_list(
geometries_fwd_duration_list_ptr, geometries_fwd_duration_list_ptr,
data_layout.num_entries[storage::DataLayout::GEOMETRIES_FWD_DURATION_LIST]); data_layout.num_entries[storage::DataLayout::GEOMETRIES_FWD_DURATION_LIST]);
m_geometry_fwd_duration_list = std::move(geometry_fwd_duration_list);
auto geometries_rev_duration_list_ptr = data_layout.GetBlockPtr<EdgeWeight>( auto geometries_rev_duration_list_ptr = data_layout.GetBlockPtr<EdgeWeight>(
memory_block, storage::DataLayout::GEOMETRIES_REV_DURATION_LIST); memory_block, storage::DataLayout::GEOMETRIES_REV_DURATION_LIST);
util::ShM<EdgeWeight, true>::vector geometry_rev_duration_list( util::ShM<EdgeWeight, true>::vector geometry_rev_duration_list(
geometries_rev_duration_list_ptr, geometries_rev_duration_list_ptr,
data_layout.num_entries[storage::DataLayout::GEOMETRIES_REV_DURATION_LIST]); data_layout.num_entries[storage::DataLayout::GEOMETRIES_REV_DURATION_LIST]);
m_geometry_rev_duration_list = std::move(geometry_rev_duration_list);
segment_data = extractor::SegmentDataView{std::move(geometry_begin_indices),
std::move(geometry_node_list),
std::move(geometry_fwd_weight_list),
std::move(geometry_rev_weight_list),
std::move(geometry_fwd_duration_list),
std::move(geometry_rev_duration_list)};
auto datasources_list_ptr = data_layout.GetBlockPtr<DatasourceID>(
memory_block, storage::DataLayout::DATASOURCES_LIST);
util::ShM<DatasourceID, true>::vector datasources_list(
datasources_list_ptr, data_layout.num_entries[storage::DataLayout::DATASOURCES_LIST]);
m_datasource_list = std::move(datasources_list);
auto datasource_name_data_ptr = auto datasource_name_data_ptr =
data_layout.GetBlockPtr<char>(memory_block, storage::DataLayout::DATASOURCE_NAME_DATA); data_layout.GetBlockPtr<char>(memory_block, storage::DataLayout::DATASOURCE_NAME_DATA);
@ -576,144 +572,43 @@ class ContiguousInternalMemoryDataFacadeBase : public BaseDataFacade
virtual std::vector<NodeID> GetUncompressedForwardGeometry(const EdgeID id) const override final virtual std::vector<NodeID> GetUncompressedForwardGeometry(const EdgeID id) const override final
{ {
/*
* NodeID's for geometries are stored in one place for
* both forward and reverse segments along the same bi-
* directional edge. The m_geometry_indices stores
* refences to where to find the beginning of the bi-
* directional edge in the m_geometry_node_list vector. For
* forward geometries of bi-directional edges, edges 2 to
* n of that edge need to be read.
*/
const auto begin = m_geometry_indices.at(id);
const auto end = m_geometry_indices.at(id + 1);
std::vector<NodeID> result_nodes; auto range = segment_data.GetForwardGeometry(id);
result_nodes.reserve(end - begin); return std::vector<NodeID> {range.begin(), range.end()};
std::copy(m_geometry_node_list.begin() + begin,
m_geometry_node_list.begin() + end,
std::back_inserter(result_nodes));
return result_nodes;
} }
virtual std::vector<NodeID> GetUncompressedReverseGeometry(const EdgeID id) const override final virtual std::vector<NodeID> GetUncompressedReverseGeometry(const EdgeID id) const override final
{ {
/* auto range = segment_data.GetReverseGeometry(id);
* NodeID's for geometries are stored in one place for return std::vector<NodeID> {range.begin(), range.end()};
* both forward and reverse segments along the same bi-
* directional edge. The m_geometry_indices stores
* refences to where to find the beginning of the bi-
* directional edge in the m_geometry_node_list vector.
* */
const auto begin = m_geometry_indices.at(id);
const auto end = m_geometry_indices.at(id + 1);
std::vector<NodeID> result_nodes;
result_nodes.reserve(end - begin);
std::reverse_copy(m_geometry_node_list.begin() + begin,
m_geometry_node_list.begin() + end,
std::back_inserter(result_nodes));
return result_nodes;
} }
virtual std::vector<EdgeWeight> virtual std::vector<EdgeWeight>
GetUncompressedForwardDurations(const EdgeID id) const override final GetUncompressedForwardDurations(const EdgeID id) const override final
{ {
/* auto range = segment_data.GetForwardDurations(id);
* EdgeWeights's for geometries are stored in one place for return std::vector<EdgeWeight> {range.begin(), range.end()};
* both forward and reverse segments along the same bi-
* directional edge. The m_geometry_indices stores
* refences to where to find the beginning of the bi-
* directional edge in the m_geometry_fwd_weight_list vector.
* */
const auto begin = m_geometry_indices.at(id) + 1;
const auto end = m_geometry_indices.at(id + 1);
std::vector<EdgeWeight> result_durations;
result_durations.reserve(end - begin);
std::copy(m_geometry_fwd_duration_list.begin() + begin,
m_geometry_fwd_duration_list.begin() + end,
std::back_inserter(result_durations));
return result_durations;
} }
virtual std::vector<EdgeWeight> virtual std::vector<EdgeWeight>
GetUncompressedReverseDurations(const EdgeID id) const override final GetUncompressedReverseDurations(const EdgeID id) const override final
{ {
/* auto range = segment_data.GetReverseDurations(id);
* EdgeWeights for geometries are stored in one place for return std::vector<EdgeWeight> {range.begin(), range.end()};
* both forward and reverse segments along the same bi-
* directional edge. The m_geometry_indices stores
* refences to where to find the beginning of the bi-
* directional edge in the m_geometry_rev_weight_list vector. For
* reverse durations of bi-directional edges, edges 1 to
* n-1 of that edge need to be read in reverse.
*/
const auto begin = m_geometry_indices.at(id);
const auto end = m_geometry_indices.at(id + 1) - 1;
std::vector<EdgeWeight> result_durations;
result_durations.reserve(end - begin);
std::reverse_copy(m_geometry_rev_duration_list.begin() + begin,
m_geometry_rev_duration_list.begin() + end,
std::back_inserter(result_durations));
return result_durations;
} }
virtual std::vector<EdgeWeight> virtual std::vector<EdgeWeight>
GetUncompressedForwardWeights(const EdgeID id) const override final GetUncompressedForwardWeights(const EdgeID id) const override final
{ {
/* auto range = segment_data.GetForwardWeights(id);
* EdgeWeights's for geometries are stored in one place for return std::vector<EdgeWeight> {range.begin(), range.end()};
* both forward and reverse segments along the same bi-
* directional edge. The m_geometry_indices stores
* refences to where to find the beginning of the bi-
* directional edge in the m_geometry_fwd_weight_list vector.
* */
const auto begin = m_geometry_indices.at(id) + 1;
const auto end = m_geometry_indices.at(id + 1);
std::vector<EdgeWeight> result_weights;
result_weights.reserve(end - begin);
std::copy(m_geometry_fwd_weight_list.begin() + begin,
m_geometry_fwd_weight_list.begin() + end,
std::back_inserter(result_weights));
return result_weights;
} }
virtual std::vector<EdgeWeight> virtual std::vector<EdgeWeight>
GetUncompressedReverseWeights(const EdgeID id) const override final GetUncompressedReverseWeights(const EdgeID id) const override final
{ {
/* auto range = segment_data.GetReverseWeights(id);
* EdgeWeights for geometries are stored in one place for return std::vector<EdgeWeight> {range.begin(), range.end()};
* both forward and reverse segments along the same bi-
* directional edge. The m_geometry_indices stores
* refences to where to find the beginning of the bi-
* directional edge in the m_geometry_rev_weight_list vector. For
* reverse weights of bi-directional edges, edges 1 to
* n-1 of that edge need to be read in reverse.
*/
const auto begin = m_geometry_indices.at(id);
const auto end = m_geometry_indices.at(id + 1) - 1;
std::vector<EdgeWeight> result_weights;
result_weights.reserve(end - begin);
std::reverse_copy(m_geometry_rev_weight_list.begin() + begin,
m_geometry_rev_weight_list.begin() + end,
std::back_inserter(result_weights));
return result_weights;
} }
virtual GeometryID GetGeometryIndexForEdgeID(const EdgeID id) const override final virtual GeometryID GetGeometryIndexForEdgeID(const EdgeID id) const override final
@ -894,14 +789,14 @@ class ContiguousInternalMemoryDataFacadeBase : public BaseDataFacade
/* /*
* Data sources for geometries are stored in one place for * Data sources for geometries are stored in one place for
* both forward and reverse segments along the same bi- * both forward and reverse segments along the same bi-
* directional edge. The m_geometry_indices stores * directional edge. The indices stores
* refences to where to find the beginning of the bi- * refences to where to find the beginning of the bi-
* directional edge in the m_geometry_list vector. For * directional edge in the list vector. For
* forward datasources of bi-directional edges, edges 2 to * forward datasources of bi-directional edges, edges 2 to
* n of that edge need to be read. * n of that edge need to be read.
*/ */
const auto begin = m_geometry_indices.at(id) + 1; const auto begin = segment_data.GetOffset(id, 0) + 1;
const auto end = m_geometry_indices.at(id + 1); const auto end = segment_data.GetOffset(id + 1, 0);
std::vector<DatasourceID> result_datasources; std::vector<DatasourceID> result_datasources;
result_datasources.reserve(end - begin); result_datasources.reserve(end - begin);
@ -929,14 +824,14 @@ class ContiguousInternalMemoryDataFacadeBase : public BaseDataFacade
/* /*
* Datasources for geometries are stored in one place for * Datasources for geometries are stored in one place for
* both forward and reverse segments along the same bi- * both forward and reverse segments along the same bi-
* directional edge. The m_geometry_indices stores * directional edge. The indices stores
* refences to where to find the beginning of the bi- * refences to where to find the beginning of the bi-
* directional edge in the m_geometry_list vector. For * directional edge in the list vector. For
* reverse datasources of bi-directional edges, edges 1 to * reverse datasources of bi-directional edges, edges 1 to
* n-1 of that edge need to be read in reverse. * n-1 of that edge need to be read in reverse.
*/ */
const unsigned begin = m_geometry_indices.at(id); const auto begin = segment_data.GetOffset(id, 0);
const unsigned end = m_geometry_indices.at(id + 1) - 1; const auto end = segment_data.GetOffset(id + 1, 0) - 1;
std::vector<DatasourceID> result_datasources; std::vector<DatasourceID> result_datasources;
result_datasources.reserve(end - begin); result_datasources.reserve(end - begin);

View File

@ -42,7 +42,9 @@ template <bool UseShareMemory> class SegmentDataContainerImpl
friend CompressedEdgeContainer; friend CompressedEdgeContainer;
public: public:
using SegmentID = std::uint32_t; // FIXME We should change the indexing to Edge-Based-Node id
using DirectionalGeometryID = std::uint32_t;
using SegmentOffset = std::uint32_t;
SegmentDataContainerImpl() = default; SegmentDataContainerImpl() = default;
@ -58,51 +60,80 @@ template <bool UseShareMemory> class SegmentDataContainerImpl
{ {
} }
auto GetForwardGeometry(const SegmentID id) const // TODO these random access functions can be removed after we implemented #3737
auto& ForwardDuration(const DirectionalGeometryID id, const SegmentOffset offset)
{ {
const auto begin = nodes.begin() + index.at(id); return fwd_durations[index[id] + 1 + offset];
const auto end = nodes.begin() + index.at(id + 1); }
auto& ReverseDuration(const DirectionalGeometryID id, const SegmentOffset offset)
{
return rev_durations[index[id] + offset];
}
auto& ForwardWeight(const DirectionalGeometryID id, const SegmentOffset offset)
{
return fwd_weights[index[id] + 1 + offset];
}
auto& ReverseWeight(const DirectionalGeometryID id, const SegmentOffset offset)
{
return rev_weights[index[id] + offset];
}
// TODO we only need this for the datasource file since it breaks this
// abstraction, but uses this index
auto GetOffset(const DirectionalGeometryID id, const SegmentOffset offset) const
{
return index[id] + offset;
}
auto GetForwardGeometry(const DirectionalGeometryID id) const
{
const auto begin = nodes.cbegin() + index.at(id);
const auto end = nodes.cbegin() + index.at(id + 1);
return boost::make_iterator_range(begin, end); return boost::make_iterator_range(begin, end);
} }
auto GetReverseGeometry(const SegmentID id) const auto GetReverseGeometry(const DirectionalGeometryID id) const
{ {
return boost::adaptors::reverse(GetForwardGeometry(id)); return boost::adaptors::reverse(GetForwardGeometry(id));
} }
auto GetForwardDurations(const SegmentID id) const auto GetForwardDurations(const DirectionalGeometryID id) const
{ {
const auto begin = fwd_durations.begin() + index.at(id) + 1; const auto begin = fwd_durations.cbegin() + index.at(id) + 1;
const auto end = fwd_durations.begin() + index.at(id + 1); const auto end = fwd_durations.cbegin() + index.at(id + 1);
return boost::make_iterator_range(begin, end); return boost::make_iterator_range(begin, end);
} }
auto GetReverseDurations(const SegmentID id) const auto GetReverseDurations(const DirectionalGeometryID id) const
{ {
const auto begin = rev_durations.begin() + index.at(id); const auto begin = rev_durations.cbegin() + index.at(id);
const auto end = rev_durations.begin() + index.at(id + 1) - 1; const auto end = rev_durations.cbegin() + index.at(id + 1) - 1;
return boost::adaptors::reverse(boost::make_iterator_range(begin, end)); return boost::adaptors::reverse(boost::make_iterator_range(begin, end));
} }
auto GetForwardWeights(const SegmentID id) const auto GetForwardWeights(const DirectionalGeometryID id) const
{ {
const auto begin = fwd_weights.begin() + index.at(id) + 1; const auto begin = fwd_weights.cbegin() + index.at(id) + 1;
const auto end = fwd_weights.begin() + index.at(id + 1); const auto end = fwd_weights.cbegin() + index.at(id + 1);
return boost::make_iterator_range(begin, end); return boost::make_iterator_range(begin, end);
} }
auto GetReverseWeights(const SegmentID id) const auto GetReverseWeights(const DirectionalGeometryID id) const
{ {
const auto begin = rev_weights.begin() + index.at(id); const auto begin = rev_weights.cbegin() + index.at(id);
const auto end = rev_weights.begin() + index.at(id + 1) - 1; const auto end = rev_weights.cbegin() + index.at(id + 1) - 1;
return boost::adaptors::reverse(boost::make_iterator_range(begin, end)); return boost::adaptors::reverse(boost::make_iterator_range(begin, end));
} }
auto GetNumberOfSegments() const
{
return fwd_weights.size();
}
friend void io::read<UseShareMemory>(const boost::filesystem::path &path, friend void io::read<UseShareMemory>(const boost::filesystem::path &path,
detail::SegmentDataContainerImpl<UseShareMemory> &segment_data); detail::SegmentDataContainerImpl<UseShareMemory> &segment_data);
friend void io::write<UseShareMemory>(const boost::filesystem::path &path, friend void io::write<UseShareMemory>(const boost::filesystem::path &path,

View File

@ -34,6 +34,7 @@ class ShMemIterator
typedef typename base_t::reference reference; typedef typename base_t::reference reference;
typedef std::random_access_iterator_tag iterator_category; typedef std::random_access_iterator_tag iterator_category;
explicit ShMemIterator() : m_value(nullptr) {}
explicit ShMemIterator(DataT *x) : m_value(x) {} explicit ShMemIterator(DataT *x) : m_value(x) {}
private: private:
@ -60,6 +61,7 @@ template <typename DataT> class SharedMemoryWrapper
public: public:
using value_type = DataT; using value_type = DataT;
using iterator = ShMemIterator<DataT>; using iterator = ShMemIterator<DataT>;
using const_iterator = ShMemIterator<const DataT>;
using reverse_iterator = boost::reverse_iterator<iterator>; using reverse_iterator = boost::reverse_iterator<iterator>;
SharedMemoryWrapper() : m_ptr(nullptr), m_size(0) {} SharedMemoryWrapper() : m_ptr(nullptr), m_size(0) {}
@ -86,6 +88,10 @@ template <typename DataT> class SharedMemoryWrapper
auto end() const { return iterator(m_ptr + m_size); } auto end() const { return iterator(m_ptr + m_size); }
auto cbegin() const { return const_iterator(m_ptr); }
auto cend() const { return const_iterator(m_ptr + m_size); }
auto rbegin() const { return reverse_iterator(iterator(m_ptr + m_size)); } auto rbegin() const { return reverse_iterator(iterator(m_ptr + m_size)); }
auto rend() const { return reverse_iterator(iterator(m_ptr)); } auto rend() const { return reverse_iterator(iterator(m_ptr)); }

View File

@ -5,6 +5,7 @@
#include "extractor/compressed_edge_container.hpp" #include "extractor/compressed_edge_container.hpp"
#include "extractor/edge_based_graph_factory.hpp" #include "extractor/edge_based_graph_factory.hpp"
#include "extractor/node_based_edge.hpp" #include "extractor/node_based_edge.hpp"
#include "extractor/io.hpp"
#include "storage/io.hpp" #include "storage/io.hpp"
#include "util/exception.hpp" #include "util/exception.hpp"
@ -268,12 +269,7 @@ Updater::LoadAndUpdateEdgeExpandedGraph(std::vector<extractor::EdgeBasedEdge> &e
std::vector<uint8_t> geometry_datasource; std::vector<uint8_t> geometry_datasource;
std::vector<extractor::QueryNode> internal_to_external_node_map; std::vector<extractor::QueryNode> internal_to_external_node_map;
std::vector<unsigned> geometry_indices; extractor::SegmentDataContainer segment_data;
std::vector<NodeID> geometry_node_list;
std::vector<EdgeWeight> geometry_fwd_weight_list;
std::vector<EdgeWeight> geometry_rev_weight_list;
std::vector<EdgeWeight> geometry_fwd_duration_list;
std::vector<EdgeWeight> geometry_rev_duration_list;
const auto maybe_load_internal_to_external_node_map = [&] { const auto maybe_load_internal_to_external_node_map = [&] {
if (!update_edge_weights) if (!update_edge_weights)
@ -289,33 +285,7 @@ Updater::LoadAndUpdateEdgeExpandedGraph(std::vector<extractor::EdgeBasedEdge> &e
if (!update_edge_weights) if (!update_edge_weights)
return; return;
storage::io::FileReader geometry_file(config.geometry_path, extractor::io::read(config.geometry_path, segment_data);
storage::io::FileReader::HasNoFingerprint);
const auto number_of_indices = geometry_file.ReadElementCount32();
geometry_indices.resize(number_of_indices);
geometry_file.ReadInto(geometry_indices.data(), number_of_indices);
const auto number_of_compressed_geometries = geometry_file.ReadElementCount32();
BOOST_ASSERT(geometry_indices.back() == number_of_compressed_geometries);
geometry_node_list.resize(number_of_compressed_geometries);
geometry_fwd_weight_list.resize(number_of_compressed_geometries);
geometry_rev_weight_list.resize(number_of_compressed_geometries);
geometry_fwd_duration_list.resize(number_of_compressed_geometries);
geometry_rev_duration_list.resize(number_of_compressed_geometries);
if (number_of_compressed_geometries > 0)
{
geometry_file.ReadInto(geometry_node_list.data(), number_of_compressed_geometries);
geometry_file.ReadInto(geometry_fwd_weight_list.data(),
number_of_compressed_geometries);
geometry_file.ReadInto(geometry_rev_weight_list.data(),
number_of_compressed_geometries);
geometry_file.ReadInto(geometry_fwd_duration_list.data(),
number_of_compressed_geometries);
geometry_file.ReadInto(geometry_rev_duration_list.data(),
number_of_compressed_geometries);
}
}; };
// Folds all our actions into independently concurrently executing lambdas // Folds all our actions into independently concurrently executing lambdas
@ -332,7 +302,7 @@ Updater::LoadAndUpdateEdgeExpandedGraph(std::vector<extractor::EdgeBasedEdge> &e
// CSV file that supplied the value that gets used for that segment, then // CSV file that supplied the value that gets used for that segment, then
// we write out this list so that it can be returned by the debugging // we write out this list so that it can be returned by the debugging
// vector tiles later on. // vector tiles later on.
geometry_datasource.resize(geometry_fwd_weight_list.size(), 0); geometry_datasource.resize(segment_data.GetNumberOfSegments(), 0);
// Now, we iterate over all the segments stored in the StaticRTree, updating // Now, we iterate over all the segments stored in the StaticRTree, updating
// the packed geometry weights in the `.geometries` file (note: we do not // the packed geometry weights in the `.geometries` file (note: we do not
@ -363,14 +333,20 @@ Updater::LoadAndUpdateEdgeExpandedGraph(std::vector<extractor::EdgeBasedEdge> &e
{ {
const auto &leaf_object = current_node.objects[i]; const auto &leaf_object = current_node.objects[i];
const auto forward_begin = geometry_indices.at(leaf_object.packed_geometry_id); const auto geometry_id = leaf_object.packed_geometry_id;
const auto u_index = forward_begin + leaf_object.fwd_segment_position; auto nodes_range = segment_data.GetForwardGeometry(geometry_id);
const auto v_index = forward_begin + leaf_object.fwd_segment_position + 1;
const auto segment_offset = leaf_object.fwd_segment_position;
const auto u_index = segment_offset;
const auto v_index = segment_offset + 1;
BOOST_ASSERT(u_index < nodes_range.size());
BOOST_ASSERT(v_index < nodes_range.size());
const extractor::QueryNode &u = const extractor::QueryNode &u =
internal_to_external_node_map[geometry_node_list[u_index]]; internal_to_external_node_map[nodes_range[u_index]];
const extractor::QueryNode &v = const extractor::QueryNode &v =
internal_to_external_node_map[geometry_node_list[v_index]]; internal_to_external_node_map[nodes_range[v_index]];
const double segment_length = util::coordinate_calculation::greatCircleDistance( const double segment_length = util::coordinate_calculation::greatCircleDistance(
util::Coordinate{u.lon, u.lat}, util::Coordinate{v.lon, v.lat}); util::Coordinate{u.lon, u.lat}, util::Coordinate{v.lon, v.lat});
@ -383,15 +359,15 @@ Updater::LoadAndUpdateEdgeExpandedGraph(std::vector<extractor::EdgeBasedEdge> &e
weight_multiplier, weight_multiplier,
*value, *value,
segment_length, segment_length,
geometry_fwd_duration_list[u_index], segment_data.ForwardWeight(geometry_id, segment_offset),
u.node_id, u.node_id,
v.node_id, v.node_id,
new_segment_weight, new_segment_weight,
new_segment_duration); new_segment_duration);
geometry_fwd_weight_list[v_index] = new_segment_weight; segment_data.ForwardWeight(geometry_id, segment_offset) = new_segment_weight;
geometry_fwd_duration_list[v_index] = new_segment_duration; segment_data.ForwardDuration(geometry_id, segment_offset) = new_segment_duration;
geometry_datasource[v_index] = value->source; geometry_datasource[segment_data.GetOffset(geometry_id, segment_offset)+1] = value->source;
fwd_source = value->source; fwd_source = value->source;
} }
@ -402,15 +378,15 @@ Updater::LoadAndUpdateEdgeExpandedGraph(std::vector<extractor::EdgeBasedEdge> &e
weight_multiplier, weight_multiplier,
*value, *value,
segment_length, segment_length,
geometry_rev_duration_list[u_index], segment_data.ReverseWeight(geometry_id, segment_offset),
v.node_id, v.node_id,
u.node_id, u.node_id,
new_segment_weight, new_segment_weight,
new_segment_duration); new_segment_duration);
geometry_rev_weight_list[u_index] = new_segment_weight; segment_data.ReverseWeight(geometry_id, segment_offset) = new_segment_weight;
geometry_rev_duration_list[u_index] = new_segment_duration; segment_data.ReverseDuration(geometry_id, segment_offset) = new_segment_duration;
geometry_datasource[u_index] = value->source; geometry_datasource[segment_data.GetOffset(geometry_id, segment_offset)] = value->source;
rev_source = value->source; rev_source = value->source;
} }
@ -451,29 +427,7 @@ Updater::LoadAndUpdateEdgeExpandedGraph(std::vector<extractor::EdgeBasedEdge> &e
return; return;
// Now save out the updated compressed geometries // Now save out the updated compressed geometries
std::ofstream geometry_stream(config.geometry_path, std::ios::binary); extractor::io::write(config.geometry_path, segment_data);
if (!geometry_stream)
{
const std::string message{"Failed to open " + config.geometry_path + " for writing"};
throw util::exception(message + SOURCE_REF);
}
const unsigned number_of_indices = geometry_indices.size();
const unsigned number_of_compressed_geometries = geometry_node_list.size();
geometry_stream.write(reinterpret_cast<const char *>(&number_of_indices), sizeof(unsigned));
geometry_stream.write(reinterpret_cast<char *>(&(geometry_indices[0])),
number_of_indices * sizeof(unsigned));
geometry_stream.write(reinterpret_cast<const char *>(&number_of_compressed_geometries),
sizeof(unsigned));
geometry_stream.write(reinterpret_cast<char *>(&(geometry_node_list[0])),
number_of_compressed_geometries * sizeof(NodeID));
geometry_stream.write(reinterpret_cast<char *>(&(geometry_fwd_weight_list[0])),
number_of_compressed_geometries * sizeof(EdgeWeight));
geometry_stream.write(reinterpret_cast<char *>(&(geometry_rev_weight_list[0])),
number_of_compressed_geometries * sizeof(EdgeWeight));
geometry_stream.write(reinterpret_cast<char *>(&(geometry_fwd_duration_list[0])),
number_of_compressed_geometries * sizeof(EdgeWeight));
geometry_stream.write(reinterpret_cast<char *>(&(geometry_rev_duration_list[0])),
number_of_compressed_geometries * sizeof(EdgeWeight));
}; };
const auto save_datasource_indexes = [&] { const auto save_datasource_indexes = [&] {