49441fe204
rather than being cached in the StaticRTree. This means we can freely apply traffic data and not have stale values lying around. It reduces the size of the RTree on disk, at the expense of some additional data in RAM.
89 lines
3.3 KiB
C++
89 lines
3.3 KiB
C++
#ifndef EDGE_BASED_NODE_HPP
|
|
#define EDGE_BASED_NODE_HPP
|
|
|
|
#include "extractor/travel_mode.hpp"
|
|
#include "util/typedefs.hpp"
|
|
|
|
#include <boost/assert.hpp>
|
|
|
|
#include "osrm/coordinate.hpp"
|
|
|
|
#include <limits>
|
|
|
|
namespace osrm
|
|
{
|
|
namespace extractor
|
|
{
|
|
|
|
/// This is what util::StaticRTree serialized and stores on disk
|
|
/// It is generated in EdgeBasedGraphFactory.
|
|
struct EdgeBasedNode
|
|
{
|
|
EdgeBasedNode()
|
|
: forward_edge_based_node_id(SPECIAL_NODEID), reverse_edge_based_node_id(SPECIAL_NODEID),
|
|
u(SPECIAL_NODEID), v(SPECIAL_NODEID), name_id(0),
|
|
forward_packed_geometry_id(SPECIAL_EDGEID),
|
|
reverse_packed_geometry_id(SPECIAL_EDGEID),
|
|
component{INVALID_COMPONENTID, false},
|
|
fwd_segment_position(std::numeric_limits<unsigned short>::max()),
|
|
forward_travel_mode(TRAVEL_MODE_INACCESSIBLE),
|
|
backward_travel_mode(TRAVEL_MODE_INACCESSIBLE)
|
|
{
|
|
}
|
|
|
|
explicit EdgeBasedNode(NodeID forward_edge_based_node_id,
|
|
NodeID reverse_edge_based_node_id,
|
|
NodeID u,
|
|
NodeID v,
|
|
unsigned name_id,
|
|
unsigned forward_weight_or_packed_geometry_id_,
|
|
unsigned reverse_weight_or_packed_geometry_id_,
|
|
bool is_tiny_component,
|
|
unsigned component_id,
|
|
unsigned short fwd_segment_position,
|
|
TravelMode forward_travel_mode,
|
|
TravelMode backward_travel_mode)
|
|
: forward_edge_based_node_id(forward_edge_based_node_id),
|
|
reverse_edge_based_node_id(reverse_edge_based_node_id), u(u), v(v), name_id(name_id),
|
|
forward_packed_geometry_id(forward_weight_or_packed_geometry_id_),
|
|
reverse_packed_geometry_id(reverse_weight_or_packed_geometry_id_),
|
|
component{component_id, is_tiny_component},
|
|
fwd_segment_position(fwd_segment_position), forward_travel_mode(forward_travel_mode),
|
|
backward_travel_mode(backward_travel_mode)
|
|
{
|
|
BOOST_ASSERT((forward_edge_based_node_id != SPECIAL_NODEID) ||
|
|
(reverse_edge_based_node_id != SPECIAL_NODEID));
|
|
}
|
|
|
|
static inline util::FixedPointCoordinate Centroid(const util::FixedPointCoordinate a,
|
|
const util::FixedPointCoordinate b)
|
|
{
|
|
util::FixedPointCoordinate centroid;
|
|
// The coordinates of the midpoint are given by:
|
|
centroid.lat = (a.lat + b.lat) / 2;
|
|
centroid.lon = (a.lon + b.lon) / 2;
|
|
return centroid;
|
|
}
|
|
|
|
NodeID forward_edge_based_node_id; // needed for edge-expanded graph
|
|
NodeID reverse_edge_based_node_id; // needed for edge-expanded graph
|
|
NodeID u; // indices into the coordinates array
|
|
NodeID v; // indices into the coordinates array
|
|
unsigned name_id; // id of the edge name
|
|
|
|
unsigned forward_packed_geometry_id;
|
|
unsigned reverse_packed_geometry_id;
|
|
struct
|
|
{
|
|
unsigned id : 31;
|
|
bool is_tiny : 1;
|
|
} component;
|
|
unsigned short fwd_segment_position; // segment id in a compressed geometry
|
|
TravelMode forward_travel_mode : 4;
|
|
TravelMode backward_travel_mode : 4;
|
|
};
|
|
}
|
|
}
|
|
|
|
#endif // EDGE_BASED_NODE_HPP
|