Libosmium
2.11.1
Fast and flexible C++ library for working with OpenStreetMap data
|
#include <relations_map.hpp>
Public Member Functions | |
RelationsMapIndex ()=delete | |
RelationsMapIndex (const RelationsMapIndex &)=delete | |
RelationsMapIndex & | operator= (const RelationsMapIndex &)=delete |
RelationsMapIndex (RelationsMapIndex &&)=default | |
RelationsMapIndex & | operator= (RelationsMapIndex &&)=default |
template<typename Func > | |
void | for_each_parent (osmium::unsigned_object_id_type member_id, Func &&func) const |
bool | empty () const noexcept |
size_t | size () const noexcept |
Private Types | |
using | map_type = detail::flat_map< osmium::unsigned_object_id_type, uint32_t, osmium::unsigned_object_id_type, uint32_t > |
Private Member Functions | |
RelationsMapIndex (map_type &&map) | |
Private Attributes | |
map_type | m_map |
Friends | |
class | RelationsMapStash |
Index for looking up parent relation IDs given a member relation ID. You can not instantiate such an index yourself, instead you need to instantiate a RelationsMapStash, fill it and then create an index from it:
|
private |
|
inlineprivate |
|
delete |
|
delete |
|
default |
|
inlinenoexcept |
Is this index empty?
Complexity: Constant.
|
inline |
Find the given relation id in the index and call the given function with all parent relation ids.
Complexity: Logarithmic in the number of elements in the index. (Lookup uses binary search.)
|
delete |
|
default |
|
inlinenoexcept |
How many entries are in this index?
Complexity: Constant.
|
friend |
|
private |