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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
#pragma once
#include "routing/coding.hpp"
#include "routing/road_access.hpp"
#include "routing/road_point.hpp"
#include "routing/segment.hpp"
#include "routing/vehicle_mask.hpp"
#include "routing_common/num_mwm_id.hpp"
#include "coding/bit_streams.hpp"
#include "coding/reader.hpp"
#include "coding/varint.hpp"
#include "coding/write_to_sink.hpp"
#include "base/assert.hpp"
#include "base/checked_cast.hpp"
#include <algorithm>
#include <array>
#include <cstdint>
#include <map>
#include <utility>
#include <vector>
namespace routing
{
class RoadAccessSerializer final
{
public:
using RoadAccessTypesFeatureMap = std::map<uint32_t, RoadAccess::Type>;
using RoadAccessTypesPointMap = std::map<RoadPoint, RoadAccess::Type>;
using RoadAccessByVehicleType = std::array<RoadAccess, static_cast<size_t>(VehicleType::Count)>;
RoadAccessSerializer() = delete;
template <class Sink>
static void Serialize(Sink & sink, RoadAccessByVehicleType const & roadAccessByType)
{
uint32_t const header = kLatestVersion;
WriteToSink(sink, header);
auto const sectionSizesPos = sink.Pos();
std::array<uint32_t, static_cast<size_t>(VehicleType::Count)> sectionSizes;
for (size_t i = 0; i < sectionSizes.size(); ++i)
{
sectionSizes[i] = 0;
WriteToSink(sink, sectionSizes[i]);
}
for (size_t i = 0; i < static_cast<size_t>(VehicleType::Count); ++i)
{
auto const pos = sink.Pos();
SerializeOneVehicleType(sink, roadAccessByType[i].GetFeatureTypes(),
roadAccessByType[i].GetPointTypes());
sectionSizes[i] = base::checked_cast<uint32_t>(sink.Pos() - pos);
}
auto const endPos = sink.Pos();
sink.Seek(sectionSizesPos);
for (size_t i = 0; i < sectionSizes.size(); ++i)
WriteToSink(sink, sectionSizes[i]);
sink.Seek(endPos);
}
template <class Source>
static void Deserialize(Source & src, VehicleType vehicleType, RoadAccess & roadAccess)
{
auto const subsectionNumberToVehicleType = [](uint32_t version, size_t subsection)
{
if (version == 0)
{
switch (subsection)
{
case 0: return VehicleType::Pedestrian;
case 1: return VehicleType::Bicycle;
case 2: return VehicleType::Car;
default: return VehicleType::Count;
}
}
return static_cast<VehicleType>(subsection);
};
uint32_t const header = ReadPrimitiveFromSource<uint32_t>(src);
std::vector<uint32_t> sectionSizes;
for (size_t i = 0; subsectionNumberToVehicleType(header, i) < VehicleType::Count; ++i)
sectionSizes.push_back(ReadPrimitiveFromSource<uint32_t>(src));
for (size_t i = 0; subsectionNumberToVehicleType(header, i) < VehicleType::Count; ++i)
{
if (vehicleType != subsectionNumberToVehicleType(header, i))
{
src.Skip(sectionSizes[i]);
continue;
}
RoadAccessTypesFeatureMap mf;
RoadAccessTypesPointMap mp;
DeserializeOneVehicleType(src, mf, mp);
roadAccess.SetAccessTypes(std::move(mf), std::move(mp));
}
}
private:
template <typename Sink>
static void SerializeOneVehicleType(Sink & sink, RoadAccessTypesFeatureMap const & mf,
RoadAccessTypesPointMap const & mp)
{
std::array<std::vector<Segment>, static_cast<size_t>(RoadAccess::Type::Count)>
segmentsByRoadAccessType;
for (auto const & kv : mf)
{
segmentsByRoadAccessType[static_cast<size_t>(kv.second)].push_back(
Segment(kFakeNumMwmId, kv.first, 0 /* wildcard segmentIdx */, true /* widcard forward */));
}
// For nodes we store |pointId + 1| because 0 is reserved for wildcard segmentIdx.
for (auto const & kv : mp)
{
segmentsByRoadAccessType[static_cast<size_t>(kv.second)].push_back(
Segment(kFakeNumMwmId, kv.first.GetFeatureId(), kv.first.GetPointId() + 1, true));
}
for (auto & segs : segmentsByRoadAccessType)
{
std::sort(segs.begin(), segs.end());
SerializeSegments(sink, segs);
}
}
template <typename Source>
static void DeserializeOneVehicleType(Source & src, RoadAccessTypesFeatureMap & mf,
RoadAccessTypesPointMap & mp)
{
mf.clear();
mp.clear();
for (size_t i = 0; i < static_cast<size_t>(RoadAccess::Type::Count); ++i)
{
// An earlier version allowed blocking any segment of a feature (or the entire feature
// by providing a wildcard segment index).
// At present, we either block the feature entirely or block any of its road points. The
// the serialization code remains the same, although its semantics changes as we now
// work with point indices instead of segment indices.
std::vector<Segment> segs;
DeserializeSegments(src, segs);
for (auto const & seg : segs)
{
if (seg.GetSegmentIdx() == 0)
{
// Wildcard segmentIdx.
mf[seg.GetFeatureId()] = static_cast<RoadAccess::Type>(i);
}
else
{
// For nodes we store |pointId + 1| because 0 is reserved for wildcard segmentIdx.
mp[RoadPoint(seg.GetFeatureId(), seg.GetSegmentIdx() - 1)] =
static_cast<RoadAccess::Type>(i);
}
}
}
}
// todo(@m) This code borrows heavily from traffic/traffic_info.hpp:SerializeTrafficKeys.
template <typename Sink>
static void SerializeSegments(Sink & sink, std::vector<Segment> const & segments)
{
std::vector<uint32_t> featureIds(segments.size());
std::vector<uint32_t> segmentIndices(segments.size());
std::vector<bool> isForward(segments.size());
for (size_t i = 0; i < segments.size(); ++i)
{
auto const & seg = segments[i];
CHECK_EQUAL(seg.GetMwmId(), kFakeNumMwmId,
("Numeric mwm ids are temporary and must not be serialized."));
featureIds[i] = seg.GetFeatureId();
segmentIndices[i] = seg.GetSegmentIdx();
isForward[i] = seg.IsForward();
}
WriteVarUint(sink, segments.size());
{
BitWriter<Sink> bitWriter(sink);
uint32_t prevFid = 0;
for (auto const fid : featureIds)
{
CHECK_GREATER_OR_EQUAL(fid, prevFid, ());
uint64_t const fidDiff = static_cast<uint64_t>(fid - prevFid);
WriteGamma(bitWriter, fidDiff + 1);
prevFid = fid;
}
for (auto const idx : segmentIndices)
WriteGamma(bitWriter, idx + 1);
for (auto const val : isForward)
bitWriter.Write(val ? 1 : 0, 1 /* numBits */);
}
}
template <typename Source>
static void DeserializeSegments(Source & src, std::vector<Segment> & segments)
{
auto const n = static_cast<size_t>(ReadVarUint<uint64_t>(src));
std::vector<uint32_t> featureIds(n);
std::vector<uint32_t> segmentIndices(n);
std::vector<bool> isForward(n);
BitReader<Source> bitReader(src);
uint32_t prevFid = 0;
for (size_t i = 0; i < n; ++i)
{
prevFid += ReadGamma<uint64_t>(bitReader) - 1;
featureIds[i] = prevFid;
}
for (size_t i = 0; i < n; ++i)
segmentIndices[i] = ReadGamma<uint32_t>(bitReader) - 1;
for (size_t i = 0; i < n; ++i)
isForward[i] = bitReader.Read(1) > 0;
// Read the padding bits.
auto bitsRead = bitReader.BitsRead();
while (bitsRead % CHAR_BIT != 0)
{
bitReader.Read(1);
++bitsRead;
}
segments.clear();
segments.reserve(n);
for (size_t i = 0; i < n; ++i)
segments.emplace_back(kFakeNumMwmId, featureIds[i], segmentIndices[i], isForward[i]);
}
uint32_t static const kLatestVersion;
};
} // namespace routing
|