Libosmium: include/osmium/index/multimap/sparse_mem_multimap.hpp Source File

Libosmium Fast and flexible C++ library for working with OpenStreetMap data

Loading...
Searching...
No Matches
sparse_mem_multimap.hpp
Go to the documentation of this file.
1#ifndef OSMIUM_INDEX_MULTIMAP_SPARSE_MEM_MULTIMAP_HPP
2#define OSMIUM_INDEX_MULTIMAP_SPARSE_MEM_MULTIMAP_HPP
3
4/*
5
6This file is part of Osmium (https://osmcode.org/libosmium).
7
8Copyright 2013-2026 Jochen Topf <jochen@topf.org> and others (see README).
9
10Boost Software License - Version 1.0 - August 17th, 2003
11
12Permission is hereby granted, free of charge, to any person or organization
13obtaining a copy of the software and accompanying documentation covered by
14this license (the "Software") to use, reproduce, display, distribute,
15execute, and transmit the Software, and to prepare derivative works of the
16Software, and to permit third-parties to whom the Software is furnished to
17do so, all subject to the following:
18
19The copyright notices in the Software and this entire statement, including
20the above license grant, this restriction and the following disclaimer,
21must be included in all copies of the Software, in whole or in part, and
22all derivative works of the Software, unless such copies or derivative
23works are solely in the form of machine-executable object code generated by
24a source language processor.
25
26THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
27IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
28FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
29SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
30FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
31ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
32DEALINGS IN THE SOFTWARE.
33
34*/
35
36#include <osmium/index/multimap.hpp>
37#include <osmium/io/detail/read_write.hpp>
38
39#include <algorithm>
40#include <cstddef>
41#include <map>
42#include <utility>
43#include <vector>
44
45namespace osmium {
46
47 namespace index {
48
49 namespace multimap {
50
55 template <typename TId, typename TValue>
56 class SparseMemMultimap final : public osmium::index::multimap::Multimap<TId, TValue> {
57
58 // This is a rough estimate for the memory needed for each
59 // element in the map (id + value + pointers to left, right,
60 // and parent plus some overhead for color of red-black-tree
61 // or similar).
62 enum {
63 element_size = sizeof(TId) + sizeof(TValue) + (sizeof(void*) * 4U)
64 };
65
66 public:
67
68 using collection_type = typename std::multimap<const TId, TValue>;
69 using iterator = typename collection_type::iterator;
70 using const_iterator = typename collection_type::const_iterator;
71 using value_type = typename collection_type::value_type;
72 using element_type = typename std::pair<TId, TValue>;
73
74 private:
75
76 collection_type m_elements;
77
78 public:
79
80 SparseMemMultimap() = default;
81
82 ~SparseMemMultimap() noexcept = default;
83
84 void unsorted_set(const TId id, const TValue value) {
85 m_elements.emplace(id, value);
86 }
87
88 void set(const TId id, const TValue value) override {
89 m_elements.emplace(id, value);
90 }
91
92 std::pair<iterator, iterator> get_all(const TId id) {
93 return m_elements.equal_range(id);
94 }
95
96 std::pair<const_iterator, const_iterator> get_all(const TId id) const {
97 return m_elements.equal_range(id);
98 }
99
100 void remove(const TId id, const TValue value) {
101 std::pair<iterator, iterator> r = get_all(id);
102 for (iterator it = r.first; it != r.second; ++it) {
103 if (it->second == value) {
104 m_elements.erase(it);
105 return;
106 }
107 }
108 }
109
110 iterator begin() {
111 return m_elements.begin();
112 }
113
114 iterator end() {
115 return m_elements.end();
116 }
117
118 size_t size() const override {
119 return m_elements.size();
120 }
121
122 size_t used_memory() const override {
123 return element_size * m_elements.size();
124 }
125
126 void clear() override {
127 m_elements.clear();
128 }
129
130 void consolidate() {
131 // intentionally left blank
132 }
133
134 void dump_as_list(const int fd) override {
135 std::vector<element_type> v;
136 v.reserve(m_elements.size());
137 for (const auto& element : m_elements) {
138 v.emplace_back(element.first, element.second);
139 }
140 std::sort(v.begin(), v.end());
141 osmium::io::detail::reliable_write(fd, reinterpret_cast<const char*>(v.data()), sizeof(element_type) * v.size());
142 }
143
144 }; // class SparseMemMultimap
145
146 } // namespace multimap
147
148 } // namespace index
149
150} // namespace osmium
151
152#endif // OSMIUM_INDEX_MULTIMAP_SPARSE_MEM_MULTIMAP_HPP
osmium::index::multimap::Multimap
Definition multimap.hpp:51
osmium::index::multimap::SparseMemMultimap::element_type
typename std::pair< TId, TValue > element_type
Definition sparse_mem_multimap.hpp:72
osmium::index::multimap::SparseMemMultimap::element_size
@ element_size
Definition sparse_mem_multimap.hpp:63
osmium::index::multimap::SparseMemMultimap::used_memory
size_t used_memory() const override
Definition sparse_mem_multimap.hpp:122
osmium::index::multimap::SparseMemMultimap::end
iterator end()
Definition sparse_mem_multimap.hpp:114
osmium::index::multimap::SparseMemMultimap::const_iterator
typename collection_type::const_iterator const_iterator
Definition sparse_mem_multimap.hpp:70
osmium::index::multimap::SparseMemMultimap::SparseMemMultimap
SparseMemMultimap()=default
osmium::index::multimap::SparseMemMultimap::collection_type
typename std::multimap< const TId, TValue > collection_type
Definition sparse_mem_multimap.hpp:68
osmium::index::multimap::SparseMemMultimap::consolidate
void consolidate()
Definition sparse_mem_multimap.hpp:130
osmium::index::multimap::SparseMemMultimap::remove
void remove(const TId id, const TValue value)
Definition sparse_mem_multimap.hpp:100
osmium::index::multimap::SparseMemMultimap::size
size_t size() const override
Definition sparse_mem_multimap.hpp:118
osmium::index::multimap::SparseMemMultimap::m_elements
collection_type m_elements
Definition sparse_mem_multimap.hpp:76
osmium::index::multimap::SparseMemMultimap::dump_as_list
void dump_as_list(const int fd) override
Definition sparse_mem_multimap.hpp:134
osmium::index::multimap::SparseMemMultimap::begin
iterator begin()
Definition sparse_mem_multimap.hpp:110
osmium::index::multimap::SparseMemMultimap::value_type
typename collection_type::value_type value_type
Definition sparse_mem_multimap.hpp:71
osmium::index::multimap::SparseMemMultimap::iterator
typename collection_type::iterator iterator
Definition sparse_mem_multimap.hpp:69
osmium::index::multimap::SparseMemMultimap::set
void set(const TId id, const TValue value) override
Set the field with id to value.
Definition sparse_mem_multimap.hpp:88
osmium::index::multimap::SparseMemMultimap::unsorted_set
void unsorted_set(const TId id, const TValue value)
Definition sparse_mem_multimap.hpp:84
osmium::index::multimap::SparseMemMultimap::get_all
std::pair< iterator, iterator > get_all(const TId id)
Definition sparse_mem_multimap.hpp:92
osmium::index::multimap::SparseMemMultimap::get_all
std::pair< const_iterator, const_iterator > get_all(const TId id) const
Definition sparse_mem_multimap.hpp:96
osmium::index::multimap::SparseMemMultimap::~SparseMemMultimap
~SparseMemMultimap() noexcept=default
osmium::index::multimap::SparseMemMultimap::clear
void clear() override
Definition sparse_mem_multimap.hpp:126
multimap.hpp
osmium::index::multimap
Key-value containers with multiple values for an integer key.
Definition multimap.hpp:48
osmium::index
Indexing of OSM data, Locations, etc.
Definition id_set.hpp:51
osmium
Namespace for everything in the Osmium library.
Definition assembler.hpp:53