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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
|
#pragma once
#include "generator/generate_info.hpp"
#include "generator/intermediate_elements.hpp"
#include "coding/file_reader.hpp"
#include "coding/file_writer.hpp"
#include "coding/mmap_reader.hpp"
#include "base/assert.hpp"
#include "base/control_flow.hpp"
#include "base/file_name_utils.hpp"
#include "base/logging.hpp"
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <limits>
#include <memory>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <utility>
#include <vector>
#include "defines.hpp"
// Classes for reading and writing any data in file with map of offsets for
// fast searching in memory by some key.
namespace generator
{
namespace cache
{
using Key = uint64_t;
static_assert(std::is_integral<Key>::value, "Key must be an integral type");
// Used to store all world nodes inside temporary index file.
// To find node by id, just calculate offset inside index file:
// offset_in_file = sizeof(LatLon) * node_ID
struct LatLon
{
int32_t m_lat = 0;
int32_t m_lon = 0;
};
static_assert(sizeof(LatLon) == 8, "Invalid structure size");
static_assert(std::is_trivially_copyable<LatLon>::value, "");
struct LatLonPos
{
uint64_t m_pos = 0;
int32_t m_lat = 0;
int32_t m_lon = 0;
};
static_assert(sizeof(LatLonPos) == 16, "Invalid structure size");
static_assert(std::is_trivially_copyable<LatLonPos>::value, "");
class PointStorageWriterInterface
{
public:
virtual ~PointStorageWriterInterface() {}
virtual void AddPoint(uint64_t id, double lat, double lon) = 0;
virtual uint64_t GetNumProcessedPoints() const = 0;
};
class PointStorageReaderInterface
{
public:
virtual ~PointStorageReaderInterface() {}
virtual bool GetPoint(uint64_t id, double & lat, double & lon) const = 0;
};
class IndexFileReader
{
public:
using Value = uint64_t;
explicit IndexFileReader(std::string const & name);
void ReadAll();
bool GetValueByKey(Key key, Value & value) const;
template <typename ToDo>
void ForEachByKey(Key k, ToDo && toDo) const
{
auto range = std::equal_range(m_elements.begin(), m_elements.end(), k, ElementComparator());
for (; range.first != range.second; ++range.first)
{
if (toDo((*range.first).second) == base::ControlFlow::Break)
break;
}
}
private:
using Element = std::pair<Key, Value>;
struct ElementComparator
{
bool operator()(Element const & r1, Element const & r2) const
{
return ((r1.first == r2.first) ? r1.second < r2.second : r1.first < r2.first);
}
bool operator()(Element const & r1, Key r2) const { return (r1.first < r2); }
bool operator()(Key r1, Element const & r2) const { return (r1 < r2.first); }
};
std::vector<Element> m_elements;
FileReader m_fileReader;
};
class IndexFileWriter
{
public:
using Value = uint64_t;
explicit IndexFileWriter(std::string const & name);
void WriteAll();
void Add(Key k, Value const & v);
private:
using Element = std::pair<Key, Value>;
std::vector<Element> m_elements;
FileWriter m_fileWriter;
};
class OSMElementCacheReader
{
public:
explicit OSMElementCacheReader(std::string const & name, bool preload = false);
template <class Value>
bool Read(Key id, Value & value)
{
uint64_t pos = 0;
if (!m_offsets.GetValueByKey(id, pos))
{
LOG_SHORT(LWARNING, ("Can't find offset in file", m_name + OFFSET_EXT, "by id", id));
return false;
}
uint32_t valueSize = m_preload ? *(reinterpret_cast<uint32_t *>(m_data.data() + pos)) : 0;
size_t offset = pos + sizeof(uint32_t);
if (!m_preload)
{
// in case not-in-memory work we read buffer
m_fileReader.Read(pos, &valueSize, sizeof(valueSize));
m_data.resize(valueSize);
m_fileReader.Read(pos + sizeof(valueSize), m_data.data(), valueSize);
offset = 0;
}
MemReader reader(m_data.data() + offset, valueSize);
value.Read(reader);
return true;
}
void LoadOffsets();
protected:
FileReader m_fileReader;
IndexFileReader m_offsets;
std::string m_name;
std::vector<uint8_t> m_data;
bool m_preload = false;
};
class OSMElementCacheWriter
{
public:
explicit OSMElementCacheWriter(std::string const & name, bool preload = false);
template <typename Value>
void Write(Key id, Value const & value)
{
m_offsets.Add(id, m_fileWriter.Pos());
m_data.clear();
MemWriter<decltype(m_data)> w(m_data);
value.Write(w);
ASSERT_LESS(m_data.size(), std::numeric_limits<uint32_t>::max(), ());
uint32_t sz = static_cast<uint32_t>(m_data.size());
m_fileWriter.Write(&sz, sizeof(sz));
m_fileWriter.Write(m_data.data(), sz);
}
void SaveOffsets();
protected:
FileWriter m_fileWriter;
IndexFileWriter m_offsets;
std::string m_name;
std::vector<uint8_t> m_data;
bool m_preload = false;
};
class IntermediateDataReader
{
public:
IntermediateDataReader(std::shared_ptr<PointStorageReaderInterface> nodes,
feature::GenerateInfo & info);
// TODO |GetNode()|, |lat|, |lon| are used as y, x in real.
bool GetNode(Key id, double & lat, double & lon) const { return m_nodes->GetPoint(id, lat, lon); }
bool GetWay(Key id, WayElement & e) { return m_ways.Read(id, e); }
void LoadIndex();
template <typename ToDo>
void ForEachRelationByWay(Key id, ToDo && toDo)
{
RelationProcessor<ToDo> processor(m_relations, std::forward<ToDo>(toDo));
m_wayToRelations.ForEachByKey(id, processor);
}
template <typename ToDo>
void ForEachRelationByWayCached(Key id, ToDo && toDo)
{
CachedRelationProcessor<ToDo> processor(m_relations, std::forward<ToDo>(toDo));
m_wayToRelations.ForEachByKey(id, processor);
}
template <typename ToDo>
void ForEachRelationByNodeCached(Key id, ToDo && toDo)
{
CachedRelationProcessor<ToDo> processor(m_relations, std::forward<ToDo>(toDo));
m_nodeToRelations.ForEachByKey(id, processor);
}
private:
using CacheReader = cache::OSMElementCacheReader;
template <typename Element, typename ToDo>
class ElementProcessorBase
{
public:
ElementProcessorBase(CacheReader & reader, ToDo & toDo) : m_reader(reader), m_toDo(toDo) {}
base::ControlFlow operator()(uint64_t id)
{
Element e;
return m_reader.Read(id, e) ? m_toDo(id, e) : base::ControlFlow::Break;
}
protected:
CacheReader & m_reader;
ToDo & m_toDo;
};
template <typename ToDo>
struct RelationProcessor : public ElementProcessorBase<RelationElement, ToDo>
{
using Base = ElementProcessorBase<RelationElement, ToDo>;
RelationProcessor(CacheReader & reader, ToDo & toDo) : Base(reader, toDo) {}
};
template <typename ToDo>
struct CachedRelationProcessor : public RelationProcessor<ToDo>
{
using Base = RelationProcessor<ToDo>;
CachedRelationProcessor(CacheReader & reader, ToDo & toDo) : Base(reader, toDo) {}
base::ControlFlow operator()(uint64_t id) { return this->m_toDo(id, this->m_reader); }
};
std::shared_ptr<PointStorageReaderInterface> m_nodes;
cache::OSMElementCacheReader m_ways;
cache::OSMElementCacheReader m_relations;
cache::IndexFileReader m_nodeToRelations;
cache::IndexFileReader m_wayToRelations;
};
class IntermediateDataWriter
{
public:
IntermediateDataWriter(std::shared_ptr<PointStorageWriterInterface> nodes, feature::GenerateInfo & info);
void AddNode(Key id, double lat, double lon) { m_nodes->AddPoint(id, lat, lon); }
void AddWay(Key id, WayElement const & e) { m_ways.Write(id, e); }
void AddRelation(Key id, RelationElement const & e);
void SaveIndex();
static void AddToIndex(cache::IndexFileWriter & index, Key relationId, std::vector<uint64_t> const & values)
{
for (auto const v : values)
index.Add(v, relationId);
}
private:
template <typename Container>
static void AddToIndex(cache::IndexFileWriter & index, Key relationId, Container const & values)
{
for (auto const & v : values)
index.Add(v.first, relationId);
}
std::shared_ptr<PointStorageWriterInterface> m_nodes;
cache::OSMElementCacheWriter m_ways;
cache::OSMElementCacheWriter m_relations;
cache::IndexFileWriter m_nodeToRelations;
cache::IndexFileWriter m_wayToRelations;
};
std::shared_ptr<PointStorageReaderInterface>
CreatePointStorageReader(feature::GenerateInfo::NodeStorageType type, std::string const & name);
std::shared_ptr<PointStorageWriterInterface>
CreatePointStorageWriter(feature::GenerateInfo::NodeStorageType type, std::string const & name);
} // namespace cache
} // namespace generator
|