-
Notifications
You must be signed in to change notification settings - Fork 90
/
tag_store.h
471 lines (408 loc) · 19.4 KB
/
tag_store.h
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
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
/** Copyright 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018 Roland Olbricht et al.
*
* This file is part of Overpass_API.
*
* Overpass_API is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* Overpass_API is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with Overpass_API. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef DE__OSM3S___OVERPASS_API__DATA__TAG_STORE_H
#define DE__OSM3S___OVERPASS_API__DATA__TAG_STORE_H
#include "filenames.h"
#include "../core/datatypes.h"
#include "../../template_db/block_backend.h"
#include "../../template_db/transaction.h"
#include <map>
#include <string>
#include <vector>
template< typename Index, typename Object >
class Tag_Store
{
public:
Tag_Store(Transaction& transaction);
~Tag_Store();
void prefetch_all(const std::map< Index, std::vector< Object > >& elems);
void prefetch_chunk(const std::map< Index, std::vector< Object > >& elems,
typename Object::Id_Type lower_id_bound, typename Object::Id_Type upper_id_bound);
void prefetch_all(const std::map< Index, std::vector< Attic< Object > > >& elems);
void prefetch_chunk(const std::map< Index, std::vector< Attic< Object > > >& elems,
typename Object::Id_Type lower_id_bound, typename Object::Id_Type upper_id_bound);
const std::vector< std::pair< std::string, std::string > >* get(const Index& index, const Object& elem);
private:
std::map< typename Object::Id_Type, std::vector< std::pair< std::string, std::string > > > tags_by_id;
Transaction* transaction;
bool use_index;
Index stored_index;
std::map< uint32, std::vector< typename Object::Id_Type > > ids_by_coarse;
std::map< uint32, std::vector< Attic< typename Object::Id_Type > > > attic_ids_by_coarse;
std::set< std::pair< Tag_Index_Local, Tag_Index_Local > > range_set;
Block_Backend< Tag_Index_Local, typename Object::Id_Type >* items_db;
typename Block_Backend< Tag_Index_Local, typename Object::Id_Type >::Range_Iterator* tag_it;
Block_Backend< Tag_Index_Local, Attic< typename Object::Id_Type > >* attic_items_db;
typename Block_Backend< Tag_Index_Local, Attic< typename Object::Id_Type > >::Range_Iterator* attic_tag_it;
};
template< >
class Tag_Store< Uint31_Index, Derived_Structure >
{
public:
Tag_Store(Transaction& transaction) {}
Tag_Store() {}
void prefetch_all(const std::map< Uint31_Index, std::vector< Derived_Structure > >& elems) {}
void prefetch_chunk(const std::map< Uint31_Index, std::vector< Derived_Structure > >& elems,
Derived_Structure::Id_Type lower_id_bound, Derived_Structure::Id_Type upper_id_bound) {}
const std::vector< std::pair< std::string, std::string > >* get(
const Uint31_Index& index, const Derived_Structure& elem) const { return &elem.tags; }
};
template< class Id_Type >
void collect_attic_tags
(std::map< Id_Type, std::vector< std::pair< std::string, std::string > > >& tags_by_id,
const Block_Backend< Tag_Index_Local, Id_Type >& current_items_db,
typename Block_Backend< Tag_Index_Local, Id_Type >::Range_Iterator& current_tag_it,
const Block_Backend< Tag_Index_Local, Attic< Id_Type > >& attic_items_db,
typename Block_Backend< Tag_Index_Local, Attic< Id_Type > >::Range_Iterator& attic_tag_it,
const std::vector< Attic< Id_Type > >& id_vec, uint32 coarse_index)
{
std::map< Attic< Id_Type >, std::vector< std::pair< std::string, std::string > > > found_tags;
// Collect all id-matched tag information from the current tags
while ((!(current_tag_it == current_items_db.range_end())) &&
(((current_tag_it.index().index) & 0x7fffff00) < coarse_index))
++current_tag_it;
while ((!(current_tag_it == current_items_db.range_end())) &&
(((current_tag_it.index().index) & 0x7fffff00) == coarse_index))
{
typename std::vector< Attic< Id_Type > >::const_iterator it_id
= std::lower_bound(id_vec.begin(), id_vec.end(), Attic< Id_Type >(current_tag_it.object(), 0ull));
typename std::vector< Attic< Id_Type > >::const_iterator it_id_end
= std::upper_bound(id_vec.begin(), id_vec.end(), Attic< Id_Type >
(current_tag_it.object(), 0xffffffffffffffffull));
if (it_id != it_id_end)
found_tags[Attic< Id_Type >(current_tag_it.object(), 0xffffffffffffffffull)].push_back
(std::make_pair(current_tag_it.index().key, current_tag_it.index().value));
++current_tag_it;
}
// Collect all id-matched tag information that is younger than the respective timestamp from the attic tags
while ((!(attic_tag_it == attic_items_db.range_end())) &&
(((attic_tag_it.index().index) & 0x7fffff00) < coarse_index))
++attic_tag_it;
while ((!(attic_tag_it == attic_items_db.range_end())) &&
(((attic_tag_it.index().index) & 0x7fffff00) == coarse_index))
{
typename std::vector< Attic< Id_Type > >::const_iterator it_id
= std::lower_bound(id_vec.begin(), id_vec.end(), Attic< Id_Type >(attic_tag_it.object(), 0ull));
typename std::vector< Attic< Id_Type > >::const_iterator it_id_end
= std::upper_bound(id_vec.begin(), id_vec.end(), attic_tag_it.object());
if (it_id != it_id_end)
found_tags[attic_tag_it.object()].push_back
(std::make_pair(attic_tag_it.index().key, attic_tag_it.index().value));
++attic_tag_it;
}
// Actually take for each object and key of the multiple versions only the oldest valid version
for (typename std::map< Attic< Id_Type >, std::vector< std::pair< std::string, std::string > > >
::const_iterator
it = found_tags.begin(); it != found_tags.end(); ++it)
{
typename std::vector< Attic< Id_Type > >::const_iterator it_id
= std::lower_bound(id_vec.begin(), id_vec.end(), Attic< Id_Type >(it->first, 0ull));
typename std::vector< Attic< Id_Type > >::const_iterator it_id_end
= std::upper_bound(id_vec.begin(), id_vec.end(), it->first);
while (it_id != it_id_end)
{
std::vector< std::pair< std::string, std::string > >& obj_vec = tags_by_id[*it_id];
std::vector< std::pair< std::string, std::string > >::const_iterator last_added_it = it->second.end();
for (std::vector< std::pair< std::string, std::string > >::const_iterator
it_source = it->second.begin(); it_source != it->second.end(); ++it_source)
{
if (last_added_it != it->second.end())
{
if (last_added_it->first == it_source->first)
{
obj_vec.push_back(*it_source);
continue;
}
else
last_added_it = it->second.end();
}
std::vector< std::pair< std::string, std::string > >::const_iterator it_obj = obj_vec.begin();
for (; it_obj != obj_vec.end(); ++it_obj)
{
if (it_obj->first == it_source->first)
break;
}
if (it_obj == obj_vec.end())
{
obj_vec.push_back(*it_source);
last_added_it = it_source;
}
}
++it_id;
}
}
// Remove empty tags. They are placeholders for tags added later than each timestamp in question.
for (typename std::map< Id_Type, std::vector< std::pair< std::string, std::string > > >
::iterator
it_obj = tags_by_id.begin(); it_obj != tags_by_id.end(); ++it_obj)
{
for (typename std::vector< std::pair< std::string, std::string > >::size_type
i = 0; i < it_obj->second.size(); )
{
if (it_obj->second[i].second == void_tag_value())
{
it_obj->second[i] = it_obj->second.back();
it_obj->second.pop_back();
}
else
++i;
}
}
}
template< class Id_Type >
void collect_attic_tags
(std::map< Id_Type, std::vector< std::pair< std::string, std::string > > >& tags_by_id,
const Block_Backend< Tag_Index_Local, Id_Type >& current_items_db,
typename Block_Backend< Tag_Index_Local, Id_Type >::Range_Iterator& current_tag_it,
const Block_Backend< Tag_Index_Local, Attic< Id_Type > >& attic_items_db,
typename Block_Backend< Tag_Index_Local, Attic< Id_Type > >::Range_Iterator& attic_tag_it,
std::map< uint32, std::vector< Attic< Id_Type > > >& ids_by_coarse,
uint32 coarse_index,
Id_Type lower_id_bound, Id_Type upper_id_bound)
{
std::vector< Attic< Id_Type > > id_vec = ids_by_coarse[coarse_index];
if (!(upper_id_bound == Id_Type()))
{
typename std::vector< Attic< Id_Type > >::iterator it_id
= std::lower_bound(id_vec.begin(), id_vec.end(),
Attic< Id_Type >(upper_id_bound, 0ull));
id_vec.erase(it_id, id_vec.end());
}
if (!(lower_id_bound == Id_Type()))
{
typename std::vector< Attic< Id_Type > >::iterator it_id
= std::lower_bound(id_vec.begin(), id_vec.end(),
Attic< Id_Type >(lower_id_bound, 0ull));
id_vec.erase(id_vec.begin(), it_id);
}
collect_attic_tags< Id_Type >(tags_by_id, current_items_db, current_tag_it, attic_items_db, attic_tag_it,
id_vec, coarse_index);
}
template< class Id_Type >
void collect_tags
(std::map< Id_Type, std::vector< std::pair< std::string, std::string > > >& tags_by_id,
const Block_Backend< Tag_Index_Local, Id_Type >& items_db,
typename Block_Backend< Tag_Index_Local, Id_Type >::Range_Iterator& tag_it,
const std::vector< Id_Type >& ids, uint32 coarse_index)
{
while ((!(tag_it == items_db.range_end())) &&
(((tag_it.index().index) & 0x7fffff00) < coarse_index))
++tag_it;
while ((!(tag_it == items_db.range_end())) &&
(((tag_it.index().index) & 0x7fffff00) == coarse_index))
{
if ((binary_search(ids.begin(), ids.end(), tag_it.object())))
tags_by_id[tag_it.object()].push_back
(std::make_pair(tag_it.index().key, tag_it.index().value));
++tag_it;
}
}
template< class Id_Type >
void collect_tags_framed
(std::map< Id_Type, std::vector< std::pair< std::string, std::string > > >& tags_by_id,
const Block_Backend< Tag_Index_Local, Id_Type >& items_db,
typename Block_Backend< Tag_Index_Local, Id_Type >::Range_Iterator& tag_it,
std::map< uint32, std::vector< Id_Type > >& ids_by_coarse,
uint32 coarse_index,
Id_Type lower_id_bound, Id_Type upper_id_bound)
{
while ((!(tag_it == items_db.range_end())) &&
(((tag_it.index().index) & 0x7fffff00) < coarse_index))
++tag_it;
while ((!(tag_it == items_db.range_end())) &&
(((tag_it.index().index) & 0x7fffff00) == coarse_index))
{
if (!(tag_it.object() < lower_id_bound) &&
(tag_it.object() < upper_id_bound) &&
(binary_search(ids_by_coarse[coarse_index].begin(),
ids_by_coarse[coarse_index].end(), tag_it.object())))
tags_by_id[tag_it.object()].push_back
(std::make_pair(tag_it.index().key, tag_it.index().value));
++tag_it;
}
}
template< typename Index, typename Object >
Tag_Store< Index, Object >::Tag_Store(Transaction& transaction_)
: transaction(&transaction_), use_index(false), items_db(0), tag_it(0), attic_items_db(0), attic_tag_it(0) {}
template< typename Index, typename Object >
void Tag_Store< Index, Object >::prefetch_all(const std::map< Index, std::vector< Object > >& elems)
{
use_index = true;
//generate std::set of relevant coarse indices
generate_ids_by_coarse(ids_by_coarse, elems);
//formulate range query
range_set.clear();
formulate_range_query(range_set, ids_by_coarse);
delete items_db;
items_db = new Block_Backend< Tag_Index_Local, typename Object::Id_Type >(
transaction->data_index(current_local_tags_file_properties< Object >()));
delete tag_it;
tag_it = new typename Block_Backend< Tag_Index_Local, typename Object::Id_Type >::Range_Iterator(
items_db->range_begin(Default_Range_Iterator< Tag_Index_Local >(range_set.begin()),
Default_Range_Iterator< Tag_Index_Local >(range_set.end())));
if (!ids_by_coarse.empty())
{
tags_by_id.clear();
stored_index = ids_by_coarse.begin()->first;
collect_tags< typename Object::Id_Type >(tags_by_id, *items_db, *tag_it,
ids_by_coarse[stored_index.val()], stored_index.val());
}
}
template< typename Index, typename Object >
void Tag_Store< Index, Object >::prefetch_chunk(const std::map< Index, std::vector< Object > >& elems,
typename Object::Id_Type lower_id_bound, typename Object::Id_Type upper_id_bound)
{
tags_by_id.clear();
//generate std::set of relevant coarse indices
std::set< Index > coarse_indices;
generate_ids_by_coarse(ids_by_coarse, elems);
//formulate range query
std::set< std::pair< Tag_Index_Local, Tag_Index_Local > > range_set;
formulate_range_query(range_set, ids_by_coarse);
Block_Backend< Tag_Index_Local, typename Object::Id_Type > items_db
(transaction->data_index(current_local_tags_file_properties< Object >()));
typename Block_Backend< Tag_Index_Local, typename Object::Id_Type >::Range_Iterator
tag_it(items_db.range_begin
(Default_Range_Iterator< Tag_Index_Local >(range_set.begin()),
Default_Range_Iterator< Tag_Index_Local >(range_set.end())));
for (typename std::map< uint32, std::vector< typename Object::Id_Type > >::const_iterator
it = ids_by_coarse.begin(); it != ids_by_coarse.end(); ++it)
collect_tags_framed< typename Object::Id_Type >(tags_by_id, items_db, tag_it, ids_by_coarse, it->first,
lower_id_bound, upper_id_bound);
}
template< typename Index, typename Object >
void Tag_Store< Index, Object >::prefetch_all(const std::map< Index, std::vector< Attic< Object > > >& attic_items)
{
use_index = true;
//generate std::set of relevant coarse indices
generate_ids_by_coarse(attic_ids_by_coarse, attic_items);
//formulate range query
range_set.clear();
formulate_range_query(range_set, attic_ids_by_coarse);
delete items_db;
items_db = new Block_Backend< Tag_Index_Local, typename Object::Id_Type >(
transaction->data_index(current_local_tags_file_properties< Object >()));
delete attic_items_db;
attic_items_db = new Block_Backend< Tag_Index_Local, Attic< typename Object::Id_Type > >(
transaction->data_index(attic_local_tags_file_properties< Object >()));
delete tag_it;
tag_it = new typename Block_Backend< Tag_Index_Local, typename Object::Id_Type >::Range_Iterator(
items_db->range_begin
(Default_Range_Iterator< Tag_Index_Local >(range_set.begin()),
Default_Range_Iterator< Tag_Index_Local >(range_set.end())));
delete attic_tag_it;
attic_tag_it = new typename Block_Backend< Tag_Index_Local, Attic< typename Object::Id_Type > >::Range_Iterator(
attic_items_db->range_begin
(Default_Range_Iterator< Tag_Index_Local >(range_set.begin()),
Default_Range_Iterator< Tag_Index_Local >(range_set.end())));
if (!attic_ids_by_coarse.empty())
{
tags_by_id.clear();
stored_index = attic_ids_by_coarse.begin()->first;
collect_attic_tags< typename Object::Id_Type >(tags_by_id, *items_db, *tag_it, *attic_items_db, *attic_tag_it,
attic_ids_by_coarse[stored_index.val()], stored_index.val());
}
}
template< typename Index, typename Object >
void Tag_Store< Index, Object >::prefetch_chunk(const std::map< Index, std::vector< Attic< Object > > >& attic_items,
typename Object::Id_Type lower_id_bound, typename Object::Id_Type upper_id_bound)
{
//generate std::set of relevant coarse indices
generate_ids_by_coarse(attic_ids_by_coarse, attic_items);
//formulate range query
std::set< std::pair< Tag_Index_Local, Tag_Index_Local > > attic_range_set;
formulate_range_query(attic_range_set, attic_ids_by_coarse);
Block_Backend< Tag_Index_Local, typename Object::Id_Type > current_tags_db
(transaction->data_index(current_local_tags_file_properties< Object >()));
Block_Backend< Tag_Index_Local, Attic< typename Object::Id_Type > > attic_tags_db
(transaction->data_index(attic_local_tags_file_properties< Object >()));
typename Block_Backend< Tag_Index_Local, typename Object::Id_Type >::Range_Iterator
current_tag_it(current_tags_db.range_begin
(Default_Range_Iterator< Tag_Index_Local >(attic_range_set.begin()),
Default_Range_Iterator< Tag_Index_Local >(attic_range_set.end())));
typename Block_Backend< Tag_Index_Local, Attic< typename Object::Id_Type > >::Range_Iterator
attic_tag_it(attic_tags_db.range_begin
(Default_Range_Iterator< Tag_Index_Local >(attic_range_set.begin()),
Default_Range_Iterator< Tag_Index_Local >(attic_range_set.end())));
for (typename std::map< uint32, std::vector< Attic< typename Object::Id_Type > > >::const_iterator
it = attic_ids_by_coarse.begin(); it != attic_ids_by_coarse.end(); ++it)
collect_attic_tags(tags_by_id, current_tags_db, current_tag_it, attic_tags_db, attic_tag_it,
attic_ids_by_coarse, it->first, lower_id_bound, upper_id_bound);
}
template< typename Index, typename Object >
Tag_Store< Index, Object >::~Tag_Store()
{
delete items_db;
delete tag_it;
delete attic_items_db;
delete attic_tag_it;
}
template< typename Index, typename Object >
const std::vector< std::pair< std::string, std::string > >*
Tag_Store< Index, Object >::get(const Index& index, const Object& elem)
{
if (use_index && stored_index < Index(index.val() & 0x7fffff00))
{
tags_by_id.clear();
stored_index = Index(index.val() & 0x7fffff00);
if (attic_items_db)
collect_attic_tags< typename Object::Id_Type >(tags_by_id, *items_db, *tag_it, *attic_items_db, *attic_tag_it,
attic_ids_by_coarse[stored_index.val()], stored_index.val());
else
collect_tags< typename Object::Id_Type >(tags_by_id, *items_db, *tag_it,
ids_by_coarse[stored_index.val()], stored_index.val());
}
else if (use_index && Index(index.val() & 0x7fffff00) < stored_index)
{
if (attic_items_db)
{
delete tag_it;
tag_it = new typename Block_Backend< Tag_Index_Local, typename Object::Id_Type >::Range_Iterator(
items_db->range_begin
(Default_Range_Iterator< Tag_Index_Local >(range_set.begin()),
Default_Range_Iterator< Tag_Index_Local >(range_set.end())));
delete attic_tag_it;
attic_tag_it = new typename Block_Backend< Tag_Index_Local, Attic< typename Object::Id_Type > >::Range_Iterator(
attic_items_db->range_begin
(Default_Range_Iterator< Tag_Index_Local >(range_set.begin()),
Default_Range_Iterator< Tag_Index_Local >(range_set.end())));
}
else
{
delete tag_it;
tag_it = new typename Block_Backend< Tag_Index_Local, typename Object::Id_Type >::Range_Iterator(
items_db->range_begin(Default_Range_Iterator< Tag_Index_Local >(range_set.begin()),
Default_Range_Iterator< Tag_Index_Local >(range_set.end())));
}
tags_by_id.clear();
stored_index = Index(index.val() & 0x7fffff00);
if (attic_items_db)
collect_attic_tags< typename Object::Id_Type >(tags_by_id, *items_db, *tag_it, *attic_items_db, *attic_tag_it,
attic_ids_by_coarse[stored_index.val()], stored_index.val());
else
collect_tags< typename Object::Id_Type >(tags_by_id, *items_db, *tag_it,
ids_by_coarse[stored_index.val()], stored_index.val());
}
typename std::map< typename Object::Id_Type, std::vector< std::pair< std::string, std::string > > >::const_iterator
it = tags_by_id.find(elem.id);
if (it != tags_by_id.end())
return &it->second;
else
return 0;
}
#endif