mirror of
https://codeberg.org/comaps/comaps
synced 2025-12-20 13:23:59 +00:00
Merge commit '05cc660641' into traffic
# Conflicts: # CMakeLists.txt # android/app/src/main/java/app/organicmaps/settings/SettingsPrefsFragment.java # android/sdk/src/main/cpp/app/organicmaps/sdk/Framework.hpp # android/sdk/src/main/cpp/app/organicmaps/sdk/OrganicMaps.cpp # android/sdk/src/main/cpp/app/organicmaps/sdk/util/Config.cpp # libs/indexer/data_source.hpp # libs/indexer/feature.hpp # libs/indexer/ftypes_matcher.hpp # libs/map/framework.cpp # libs/map/traffic_manager.cpp # libs/routing/absent_regions_finder.cpp # libs/routing/edge_estimator.hpp # libs/routing/index_router.cpp # libs/routing/index_router.hpp # libs/routing/routing_session.hpp # libs/routing_common/num_mwm_id.hpp # libs/traffic/traffic_info.cpp # qt/mainwindow.hpp # qt/preferences_dialog.cpp # tools/openlr/helpers.hpp # tools/openlr/openlr_decoder.cpp # tools/openlr/openlr_decoder.hpp # tools/openlr/openlr_stat/openlr_stat.cpp # tools/openlr/router.hpp # tools/openlr/score_candidate_paths_getter.cpp # tools/openlr/score_candidate_paths_getter.hpp # xcode/CoMaps.xcworkspace/contents.xcworkspacedata
This commit is contained in:
101
libs/routing/segment.hpp
Normal file
101
libs/routing/segment.hpp
Normal file
@@ -0,0 +1,101 @@
|
||||
#pragma once
|
||||
|
||||
#include "routing/road_point.hpp"
|
||||
#include "routing/route_weight.hpp"
|
||||
|
||||
#include "routing_common/num_mwm_id.hpp"
|
||||
|
||||
#include <string>
|
||||
|
||||
namespace routing
|
||||
{
|
||||
/**
|
||||
* @brief A directed road segment used as a vertex in the index graph.
|
||||
*
|
||||
* You can imagine the segment as a material arrow.
|
||||
* Head of each arrow is connected to fletchings of next arrows with invisible links:
|
||||
* these are the edges of the graph.
|
||||
*
|
||||
* Position of the segment is a position of the arrowhead: GetPointId(true).
|
||||
* This position is used in heuristic and edges weight calculations.
|
||||
*/
|
||||
class Segment final
|
||||
{
|
||||
public:
|
||||
Segment() = default;
|
||||
|
||||
constexpr Segment(NumMwmId mwmId, uint32_t featureId, uint32_t segmentIdx, bool forward)
|
||||
: m_featureId(featureId)
|
||||
, m_segmentIdx(segmentIdx)
|
||||
, m_mwmId(mwmId)
|
||||
, m_forward(forward)
|
||||
{}
|
||||
|
||||
Segment const & GetSegment(bool /* start */) const { return *this; }
|
||||
NumMwmId GetMwmId() const { return m_mwmId; }
|
||||
uint32_t GetFeatureId() const { return m_featureId; }
|
||||
uint32_t GetSegmentIdx() const { return m_segmentIdx; }
|
||||
bool IsForward() const { return m_forward; }
|
||||
|
||||
uint32_t GetPointId(bool front) const;
|
||||
|
||||
uint32_t GetMinPointId() const { return m_segmentIdx; }
|
||||
uint32_t GetMaxPointId() const { return m_segmentIdx + 1; }
|
||||
|
||||
RoadPoint GetRoadPoint(bool front) const { return RoadPoint(m_featureId, GetPointId(front)); }
|
||||
|
||||
bool operator<(Segment const & seg) const;
|
||||
bool operator==(Segment const & seg) const;
|
||||
bool operator!=(Segment const & seg) const { return !(*this == seg); }
|
||||
|
||||
bool IsInverse(Segment const & seg) const;
|
||||
Segment GetReversed() const { return {m_mwmId, m_featureId, m_segmentIdx, !m_forward}; }
|
||||
|
||||
/// @todo Logically, these functions should be equal, but keep existing logic,
|
||||
/// and investigate possible enhancements in future.
|
||||
/// @{
|
||||
bool IsFakeCreated() const;
|
||||
bool IsRealSegment() const;
|
||||
/// @}
|
||||
|
||||
void Next(bool forward) { forward ? ++m_segmentIdx : --m_segmentIdx; }
|
||||
|
||||
private:
|
||||
uint32_t m_featureId = 0;
|
||||
uint32_t m_segmentIdx = 0;
|
||||
NumMwmId m_mwmId = kFakeNumMwmId;
|
||||
bool m_forward = false;
|
||||
};
|
||||
|
||||
class SegmentEdge final
|
||||
{
|
||||
public:
|
||||
SegmentEdge() = default;
|
||||
SegmentEdge(Segment const & target, RouteWeight const & weight) : m_target(target), m_weight(weight) {}
|
||||
|
||||
Segment const & GetTarget() const { return m_target; }
|
||||
RouteWeight const & GetWeight() const { return m_weight; }
|
||||
RouteWeight & GetWeight() { return m_weight; }
|
||||
bool operator==(SegmentEdge const & edge) const;
|
||||
bool operator<(SegmentEdge const & edge) const;
|
||||
|
||||
private:
|
||||
/**
|
||||
* @brief Vertex going to for outgoing edges, vertex going from for ingoing edges.
|
||||
*/
|
||||
Segment m_target;
|
||||
RouteWeight m_weight;
|
||||
};
|
||||
|
||||
std::string DebugPrint(Segment const & segment);
|
||||
std::string DebugPrint(SegmentEdge const & edge);
|
||||
} // namespace routing
|
||||
|
||||
namespace std
|
||||
{
|
||||
template <>
|
||||
struct hash<routing::Segment>
|
||||
{
|
||||
size_t operator()(routing::Segment const & segment) const;
|
||||
};
|
||||
} // namespace std
|
||||
Reference in New Issue
Block a user