Libosmium  2.2.0
Fast and flexible C++ library for working with OpenStreetMap data
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
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 (http://osmcode.org/libosmium).
7 
8 Copyright 2013-2015 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 
36 #include <algorithm>
37 #include <cstddef>
38 #include <map>
39 #include <utility>
40 #include <vector>
41 
43 #include <osmium/io/detail/read_write.hpp>
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  typedef typename std::multimap<const TId, TValue> collection_type;
67  typedef typename collection_type::iterator iterator;
68  typedef typename collection_type::const_iterator const_iterator;
69  typedef typename collection_type::value_type value_type;
70 
71  typedef typename std::pair<TId, TValue> element_type;
72 
73  private:
74 
75  collection_type m_elements;
76 
77  public:
78 
79  SparseMemMultimap() = default;
80 
81  ~SparseMemMultimap() noexcept override final = default;
82 
83  void unsorted_set(const TId id, const TValue value) {
84  m_elements.emplace(id, value);
85  }
86 
87  void set(const TId id, const TValue value) override final {
88  m_elements.emplace(id, value);
89  }
90 
91  std::pair<iterator, iterator> get_all(const TId id) {
92  return m_elements.equal_range(id);
93  }
94 
95  std::pair<const_iterator, const_iterator> get_all(const TId id) const {
96  return m_elements.equal_range(id);
97  }
98 
99  void remove(const TId id, const TValue value) {
100  std::pair<iterator, iterator> r = get_all(id);
101  for (iterator it = r.first; it != r.second; ++it) {
102  if (it->second == value) {
103  m_elements.erase(it);
104  return;
105  }
106  }
107  }
108 
109  iterator begin() {
110  return m_elements.begin();
111  }
112 
113  iterator end() {
114  return m_elements.end();
115  }
116 
117  size_t size() const override final {
118  return m_elements.size();
119  }
120 
121  size_t used_memory() const override final {
122  return element_size * m_elements.size();
123  }
124 
125  void clear() override final {
126  m_elements.clear();
127  }
128 
129  void consolidate() {
130  // intentionally left blank
131  }
132 
133  void dump_as_list(const int fd) override final {
134  std::vector<element_type> v;
135  for (const auto& element : m_elements) {
136  v.emplace_back(element.first, element.second);
137  }
138 // std::copy(m_elements.cbegin(), m_elements.cend(), std::back_inserter(v));
139  std::sort(v.begin(), v.end());
140  osmium::io::detail::reliable_write(fd, reinterpret_cast<const char*>(v.data()), sizeof(element_type) * v.size());
141  }
142 
143  }; // class SparseMemMultimap
144 
145  } // namespace multimap
146 
147  } // namespace index
148 
149 } // namespace osmium
150 
151 #endif // OSMIUM_INDEX_MULTIMAP_SPARSE_MEM_MULTIMAP_HPP
~SparseMemMultimap() noexceptoverridefinal=default
void unsorted_set(const TId id, const TValue value)
Definition: sparse_mem_multimap.hpp:83
size_t size() const overridefinal
Definition: sparse_mem_multimap.hpp:117
iterator end()
Definition: sparse_mem_multimap.hpp:113
collection_type m_elements
Definition: sparse_mem_multimap.hpp:75
std::pair< iterator, iterator > get_all(const TId id)
Definition: sparse_mem_multimap.hpp:91
void consolidate()
Definition: sparse_mem_multimap.hpp:129
Namespace for everything in the Osmium library.
Definition: assembler.hpp:55
size_t used_memory() const overridefinal
Definition: sparse_mem_multimap.hpp:121
void dump_as_list(const int fd) overridefinal
Definition: sparse_mem_multimap.hpp:133
collection_type::iterator iterator
Definition: sparse_mem_multimap.hpp:67
void set(const TId id, const TValue value) overridefinal
Set the field with id to value.
Definition: sparse_mem_multimap.hpp:87
Definition: sparse_mem_multimap.hpp:56
collection_type::const_iterator const_iterator
Definition: sparse_mem_multimap.hpp:68
void clear() overridefinal
Definition: sparse_mem_multimap.hpp:125
Definition: multimap.hpp:51
iterator begin()
Definition: sparse_mem_multimap.hpp:109
std::pair< TId, TValue > element_type
Definition: sparse_mem_multimap.hpp:71
collection_type::value_type value_type
Definition: sparse_mem_multimap.hpp:69
static constexpr size_t element_size
Definition: sparse_mem_multimap.hpp:62
std::pair< const_iterator, const_iterator > get_all(const TId id) const
Definition: sparse_mem_multimap.hpp:95
std::multimap< const TId, TValue > collection_type
Definition: sparse_mem_multimap.hpp:66