Libosmium
2.11.0
Fast and flexible C++ library for working with OpenStreetMap data
|
#include <relations_map.hpp>
Public Member Functions | |
RelationsMapStash ()=default | |
RelationsMapStash (const RelationsMapStash &)=delete | |
RelationsMapStash & | operator= (const RelationsMapStash &)=delete |
RelationsMapStash (RelationsMapStash &&)=default | |
RelationsMapStash & | operator= (RelationsMapStash &&)=default |
void | add (osmium::unsigned_object_id_type member_id, osmium::unsigned_object_id_type relation_id) |
void | add_members (const osmium::Relation &relation) |
bool | empty () const noexcept |
size_t | size () const noexcept |
RelationsMapIndex | build_index () |
Private Types | |
using | map_type = detail::flat_map< osmium::unsigned_object_id_type, uint32_t, osmium::unsigned_object_id_type, uint32_t > |
Private Attributes | |
map_type | m_map |
bool | m_valid = true |
The RelationsMapStash is used to build up the data needed to create an index of member relation ID to parent relation ID. See the RelationsMapIndex class for more.
|
private |
|
default |
|
delete |
|
default |
|
inline |
Add mapping from member to parent relation in the stash.
|
inline |
Add mapping from all members to given parent relation in the stash.
|
inline |
Build an index with the contents of this stash and return it.
After you get the index you can not use the stash any more!
|
inlinenoexcept |
Is this stash empty?
Complexity: Constant.
|
delete |
|
default |
|
inlinenoexcept |
How many entries are in this stash?
Complexity: Constant.
|
private |
|
private |