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.
96 lines
3.1 KiB
C++
96 lines
3.1 KiB
C++
#ifndef EDGE_BASED_EDGE_HPP
|
|
#define EDGE_BASED_EDGE_HPP
|
|
|
|
#include "extractor/travel_mode.hpp"
|
|
#include "util/typedefs.hpp"
|
|
#include <tuple>
|
|
|
|
namespace osrm
|
|
{
|
|
namespace extractor
|
|
{
|
|
|
|
struct EdgeBasedEdge
|
|
{
|
|
public:
|
|
struct EdgeData
|
|
{
|
|
EdgeData() : turn_id(0), weight(0), duration(0), forward(false), backward(false) {}
|
|
|
|
EdgeData(const NodeID turn_id,
|
|
const EdgeWeight weight,
|
|
const EdgeWeight duration,
|
|
const bool forward,
|
|
const bool backward)
|
|
: turn_id(turn_id), weight(weight), duration(duration), forward(forward),
|
|
backward(backward)
|
|
{
|
|
}
|
|
|
|
NodeID turn_id; // ID of the edge based node (node based edge)
|
|
EdgeWeight weight;
|
|
EdgeWeight duration : 30;
|
|
std::uint32_t forward : 1;
|
|
std::uint32_t backward : 1;
|
|
|
|
auto is_unidirectional() const { return !forward || !backward; }
|
|
};
|
|
|
|
EdgeBasedEdge();
|
|
template <class EdgeT> explicit EdgeBasedEdge(const EdgeT &other);
|
|
EdgeBasedEdge(const NodeID source,
|
|
const NodeID target,
|
|
const NodeID edge_id,
|
|
const EdgeWeight weight,
|
|
const EdgeWeight duration,
|
|
const bool forward,
|
|
const bool backward);
|
|
EdgeBasedEdge(const NodeID source, const NodeID target, const EdgeBasedEdge::EdgeData &data);
|
|
|
|
bool operator<(const EdgeBasedEdge &other) const;
|
|
|
|
NodeID source;
|
|
NodeID target;
|
|
EdgeData data;
|
|
};
|
|
static_assert(sizeof(extractor::EdgeBasedEdge) == 20,
|
|
"Size of extractor::EdgeBasedEdge type is "
|
|
"bigger than expected. This will influence "
|
|
"memory consumption.");
|
|
|
|
// Impl.
|
|
|
|
inline EdgeBasedEdge::EdgeBasedEdge() : source(0), target(0) {}
|
|
|
|
inline EdgeBasedEdge::EdgeBasedEdge(const NodeID source,
|
|
const NodeID target,
|
|
const NodeID turn_id,
|
|
const EdgeWeight weight,
|
|
const EdgeWeight duration,
|
|
const bool forward,
|
|
const bool backward)
|
|
: source(source), target(target), data{turn_id, weight, duration, forward, backward}
|
|
{
|
|
}
|
|
|
|
inline EdgeBasedEdge::EdgeBasedEdge(const NodeID source,
|
|
const NodeID target,
|
|
const EdgeBasedEdge::EdgeData &data)
|
|
: source(source), target(target), data{data}
|
|
{
|
|
}
|
|
|
|
inline bool EdgeBasedEdge::operator<(const EdgeBasedEdge &other) const
|
|
{
|
|
const auto unidirectional = data.is_unidirectional();
|
|
const auto other_is_unidirectional = other.data.is_unidirectional();
|
|
// if all items are the same, we want to keep bidirectional edges. due to the `<` operator,
|
|
// preferring 0 (false) over 1 (true), we need to compare the inverse of `bidirectional`
|
|
return std::tie(source, target, data.weight, unidirectional) <
|
|
std::tie(other.source, other.target, other.data.weight, other_is_unidirectional);
|
|
}
|
|
} // ns extractor
|
|
} // ns osrm
|
|
|
|
#endif /* EDGE_BASED_EDGE_HPP */
|