blob: 54870f7d971732707f51e922e630ea16a26f6068 (
plain)
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
|
// Copyright (C) 2020-2025 Free Software Foundation, Inc.
// This file is part of GCC.
// GCC is free software; you can redistribute it and/or modify it under
// the terms of the GNU General Public License as published by the Free
// Software Foundation; either version 3, or (at your option) any later
// version.
// GCC is distributed in the hope that it will be useful, but WITHOUT ANY
// WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
// for more details.
// You should have received a copy of the GNU General Public License
// along with GCC; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
#include "rust-system.h"
#ifndef BIMAP_H
#define BIMAP_H
// very simple bi-directional hashmap
template <typename K, typename V> class BiMap
{
public:
BiMap (std::unordered_map<K, V> &&original) : map (std::move (original))
{
for (auto &kv : map)
rmap.insert ({kv.second, kv.first});
}
const tl::optional<const V &> lookup (const K &key) const
{
auto itr = map.find (key);
if (itr == map.end ())
return tl::nullopt;
return itr->second;
}
const tl::optional<const K &> lookup (const V &key) const
{
auto itr = rmap.find (key);
if (itr == rmap.end ())
return tl::nullopt;
return itr->second;
}
private:
std::unordered_map<K, V> map;
std::unordered_map<V, K> rmap;
};
#endif // !BIMAP_H
|
