-
Notifications
You must be signed in to change notification settings - Fork 5
/
bimap.hpp
165 lines (161 loc) · 4.88 KB
/
bimap.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
#pragma once
#include <unordered_set>
#include <set>
namespace stde
{
using namespace std;
template<
class _KeyType,
class _ValueType,
class _Key_Container = std::set<_KeyType>,
class _Mapped_Container = std::set<_ValueType>>
class bimap
{
public:
class const_iterator : public iterator<
std::bidirectional_iterator_tag,
std::pair<const _KeyType&, const _ValueType&>>
{
public:
typedef const_iterator self_type;
typedef pair<typename _Key_Container::iterator, typename _Mapped_Container::iterator> value_type;
typedef int difference_type;
explicit const_iterator(const value_type& value) : m_data(std::move(value)) { }
const self_type& operator++() { ++m_data.first; ++m_data.second; return *this; }
const value_type& operator*() { return m_data; }
bool operator==(const self_type& rhs) { return m_data.first == rhs.m_data.first; }
bool operator!=(const self_type& rhs) { return m_data.first != rhs.m_data.first; }
private:
value_type m_data;
};
using key_type = _KeyType;
using value_type = _ValueType;
using rkey_type = _ValueType;
using rvalue_type = _KeyType;
private:
using _Tree = _Key_Container;
using _RTree = _Mapped_Container;
using _Tree_Node = std::pair<key_type, value_type>;
using _RTree_Node = std::pair<rkey_type, rvalue_type>;
private:
// Test for the container types
static_assert(
is_same_v<key_type, typename _Tree::key_type>,
"bimap::key_type has to match _Container_Type::key_type!");
static_assert(
is_same_v<rkey_type, typename _RTree::key_type>,
"bimap::rkey_type has to match _Reverse_Container_Type::key_type!");
private:
_Tree m_key_tree;
_RTree m_value_tree;
private:
/* Inner helper functions */
inline size_t index_of_key(const key_type& key) const
{
const auto k_itr = m_key_tree.find(key);
const auto offset = static_cast<unsigned>(std::distance(m_key_tree.begin(), k_itr));
return (offset < m_key_tree.size() ? offset : 0);
}
inline size_t index_of_value(const value_type& value) const
{
const auto v_itr = m_value_tree.find(value);
const auto offset = static_cast<unsigned>(std::distance(m_value_tree.begin(), v_itr));
return (offset < m_value_tree.size() ? offset : 0);
}
inline value_type value_at_index(size_t index) const
{
auto v_itr = m_value_tree.begin();
std::advance(v_itr, index);
return *v_itr;
}
inline key_type key_at_index(size_t index) const
{
auto k_itr = m_key_tree.begin();
std::advance(k_itr, index);
return *k_itr;
}
public:
/* Constructors */
bimap() = default;
bimap(std::initializer_list<_Tree_Node> init)
{
for (const auto& elem : init)
insert(elem);
}
public:
/* Iterator functions */
const_iterator begin() const { return const_iterator({ m_key_tree.begin(), m_value_tree.begin() }); }
const_iterator end() const { return const_iterator({ m_key_tree.end(), m_value_tree.end() }); }
public:
/* Modification functions */
void insert(_Tree_Node&& node)
{
m_key_tree.emplace_hint(m_key_tree.begin(), std::move(node.first));
m_value_tree.emplace_hint(m_value_tree.begin(), std::move(node.second));
}
void insert(const _Tree_Node& node)
{
m_key_tree.emplace_hint(m_key_tree.begin(), std::move(node.first));
m_value_tree.emplace_hint(m_value_tree.begin(), std::move(node.second));
}
void insert(const key_type& key, const value_type& value)
{
m_key_tree.emplace_hint(m_key_tree.begin(), std::move(key));
m_value_tree.emplace_hint(m_value_tree.begin(), std::move(value));
}
void erase_key(const key_type& key)
{
const auto k_itr = m_key_tree.find(key);
const auto offset = std::distance(m_key_tree.begin(), k_itr);
auto v_itr = m_value_tree.begin();
std::advance(v_itr, offset);
m_key_tree.erase(k_itr);
m_value_tree.erase(v_itr);
}
void erase_value(const value_type& value)
{
const auto v_itr = m_value_tree.find(value);
const auto offset = std::distance(m_value_tree.begin(), v_itr);
auto k_itr = m_key_tree.begin();
std::advance(k_itr, offset);
m_key_tree.erase(k_itr);
m_value_tree.erase(v_itr);
}
public:
/* Helper functions */
bool has_key(const key_type& key) const
{
return m_key_tree.find(key) != m_key_tree.end();
}
bool has_value(const value_type& value) const
{
return m_value_tree.find(value) != m_value_tree.end();
}
value_type get_value(const key_type& key) const
{
const auto offset = index_of_key(key);
auto v_itr = m_value_tree.begin();
std::advance(v_itr, offset);
return *v_itr;
}
key_type get_key(const value_type& value) const
{
const auto offset = index_of_value(value);
auto k_itr = m_key_tree.begin();
std::advance(k_itr, offset);
return *k_itr;
}
size_t size() const
{
return m_key_tree.size();
}
};
template<
class _KeyType,
class _ValueType>
using unordered_bimap = bimap<
_KeyType,
_ValueType,
std::unordered_set<_KeyType>,
std::unordered_set<_ValueType>>;
}