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