|
Libosmium
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 &&) noexcept | |
| RelationsMapIndex & | operator= (RelationsMapIndex &&) noexcept |
| ~RelationsMapIndex () noexcept=default | |
| template<typename TFunc> | |
| void | for_each (const osmium::unsigned_object_id_type id, TFunc &&func) const |
| bool | empty () const noexcept |
| std::size_t | size () const noexcept |
Private Member Functions | |
| RelationsMapIndex (detail::rel_index_map_type< uint32_t > &&map) | |
| RelationsMapIndex (detail::rel_index_map_type< uint64_t > &&map) | |
Private Attributes | |
| detail::rel_index_map_type< uint32_t > | m_map32 |
| detail::rel_index_map_type< uint64_t > | m_map64 |
| bool | m_small |
Friends | |
| class | RelationsMapStash |
| class | RelationsMapIndexes |
Index for looking up parent relation IDs given a member relation ID or the other way around.
You can not instantiate such an index yourself, instead you need to instantiate a RelationsMapStash, fill it and then create an index from it:
|
inlineexplicitprivate |
|
inlineexplicitprivate |
|
delete |
|
delete |
|
inlinedefaultnoexcept |
|
defaultnoexcept |
|
inlinenoexcept |
Is this index empty?
Complexity: Constant.
|
inline |
Find the given relation id in the index and call the given function with all related relation ids.
Complexity: Logarithmic in the number of elements in the index. (Lookup uses binary search.)
|
delete |
|
inlinedefaultnoexcept |
|
inlinenoexcept |
How many entries are in this index?
Complexity: Constant.
|
friend |
|
friend |
|
private |
|
private |
|
private |