1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
#pragma once
#include "coding/file_container.hpp"
#include "geometry/latlon.hpp"
#include "geometry/mercator.hpp"
#include "geometry/point2d.hpp"
#include "geometry/rect2d.hpp"
#include "geometry/tree4d.hpp"
#include "std/function.hpp"
#include "std/string.hpp"
#include "std/vector.hpp"
namespace routing
{
using TWrittenNodeId = uint32_t;
using TWrittenEdgeWeight = uint32_t;
TWrittenEdgeWeight constexpr kInvalidContextEdgeNodeId = std::numeric_limits<uint32_t>::max();
TWrittenEdgeWeight constexpr kInvalidContextEdgeWeight = std::numeric_limits<TWrittenEdgeWeight>::max();
size_t constexpr kInvalidAdjacencyIndex = numeric_limits<size_t>::max();
double constexpr kMwmCrossingNodeEqualityMeters = 80;
struct IngoingCrossNode
{
ms::LatLon m_point;
TWrittenNodeId m_nodeId;
size_t m_adjacencyIndex;
IngoingCrossNode()
: m_point(ms::LatLon::Zero())
, m_nodeId(kInvalidContextEdgeNodeId)
, m_adjacencyIndex(kInvalidAdjacencyIndex)
{
}
IngoingCrossNode(TWrittenNodeId nodeId, ms::LatLon const & point, size_t const adjacencyIndex)
: m_point(point), m_nodeId(nodeId), m_adjacencyIndex(adjacencyIndex)
{
}
bool IsValid() const { return m_nodeId != kInvalidContextEdgeNodeId; }
void Save(Writer & w) const;
size_t Load(Reader const & r, size_t pos, size_t adjacencyIndex);
m2::RectD const GetLimitRect() const { return m2::RectD(m_point.lat, m_point.lon, m_point.lat, m_point.lon); }
};
struct OutgoingCrossNode
{
ms::LatLon m_point;
TWrittenNodeId m_nodeId;
unsigned char m_outgoingIndex;
size_t m_adjacencyIndex;
OutgoingCrossNode()
: m_point(ms::LatLon::Zero())
, m_nodeId(kInvalidContextEdgeNodeId)
, m_outgoingIndex(0)
, m_adjacencyIndex(kInvalidAdjacencyIndex)
{
}
OutgoingCrossNode(TWrittenNodeId nodeId, size_t const index, ms::LatLon const & point,
size_t const adjacencyIndex)
: m_point(point)
, m_nodeId(nodeId)
, m_outgoingIndex(static_cast<unsigned char>(index))
, m_adjacencyIndex(adjacencyIndex)
{
}
bool IsValid() const { return m_nodeId != kInvalidContextEdgeNodeId; }
void Save(Writer & w) const;
size_t Load(Reader const & r, size_t pos, size_t adjacencyIndex);
m2::RectD const GetLimitRect() const { return m2::RectD(m_point.lat, m_point.lon, m_point.lat, m_point.lon); }
};
using IngoingEdgeIteratorT = vector<IngoingCrossNode>::const_iterator;
using OutgoingEdgeIteratorT = vector<OutgoingCrossNode>::const_iterator;
/// Reader class from cross context section in mwm.routing file
class CrossRoutingContextReader
{
vector<OutgoingCrossNode> m_outgoingNodes;
vector<string> m_neighborMwmList;
vector<TWrittenEdgeWeight> m_adjacencyMatrix;
m4::Tree<IngoingCrossNode> m_ingoingIndex;
m4::Tree<OutgoingCrossNode> m_outgoingIndex;
public:
void Load(Reader const & r);
const string & GetOutgoingMwmName(OutgoingCrossNode const & outgoingNode) const;
TWrittenEdgeWeight GetAdjacencyCost(IngoingCrossNode const & ingoing,
OutgoingCrossNode const & outgoing) const;
vector<string> const & GetNeighboringMwmList() const { return m_neighborMwmList; }
m2::RectD GetMwmCrossingNodeEqualityRect(ms::LatLon const & point) const;
template <class Fn>
bool ForEachIngoingNodeNearPoint(ms::LatLon const & point, Fn && fn) const
{
bool found = false;
m_ingoingIndex.ForEachInRect(GetMwmCrossingNodeEqualityRect(point),
[&found, &fn](IngoingCrossNode const & node) {
fn(node);
found = true;
});
return found;
}
template <class Fn>
bool ForEachOutgoingNodeNearPoint(ms::LatLon const & point, Fn && fn) const
{
bool found = false;
m_outgoingIndex.ForEachInRect(GetMwmCrossingNodeEqualityRect(point),
[&found, &fn](OutgoingCrossNode const & node) {
fn(node);
found = true;
});
return found;
}
template <class TFunctor>
void ForEachIngoingNode(TFunctor f) const
{
m_ingoingIndex.ForEach(f);
}
template <class TFunctor>
void ForEachOutgoingNode(TFunctor f) const
{
for_each(m_outgoingNodes.cbegin(), m_outgoingNodes.cend(), f);
}
};
/// Helper class to generate cross context section in mwm.routing file
class CrossRoutingContextWriter
{
vector<IngoingCrossNode> m_ingoingNodes;
vector<OutgoingCrossNode> m_outgoingNodes;
vector<TWrittenEdgeWeight> m_adjacencyMatrix;
vector<string> m_neighborMwmList;
size_t GetIndexInAdjMatrix(IngoingEdgeIteratorT ingoing, OutgoingEdgeIteratorT outgoing) const;
public:
void Save(Writer & w) const;
void AddIngoingNode(TWrittenNodeId const nodeId, ms::LatLon const & point);
void AddOutgoingNode(TWrittenNodeId const nodeId, string const & targetMwm,
ms::LatLon const & point);
void ReserveAdjacencyMatrix();
void SetAdjacencyCost(IngoingEdgeIteratorT ingoing, OutgoingEdgeIteratorT outgoin,
TWrittenEdgeWeight value);
pair<IngoingEdgeIteratorT, IngoingEdgeIteratorT> GetIngoingIterators() const;
pair<OutgoingEdgeIteratorT, OutgoingEdgeIteratorT> GetOutgoingIterators() const;
};
}
|
