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
|
// Copyright (C) 2020-2023 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-rib.h"
namespace Rust {
namespace Resolver2_0 {
DuplicateNameError::DuplicateNameError (std::string name, NodeId existing)
: name (name), existing (existing)
{}
Rib::Rib (Kind kind) : kind (kind) {}
Rib::Rib (Kind kind, std::string identifier, NodeId id)
: Rib (kind, {{identifier, id}})
{}
Rib::Rib (Kind kind, std::unordered_map<std::string, NodeId> values)
: kind (kind), values (std::move (values))
{}
tl::expected<NodeId, DuplicateNameError>
Rib::insert (std::string name, NodeId id)
{
auto res = values.insert ({name, id});
auto inserted_id = res.first->second;
// if we couldn't insert, the element already exists - exit with an error
if (!res.second)
return tl::make_unexpected (DuplicateNameError (name, inserted_id));
// return the NodeId
return inserted_id;
}
tl::optional<NodeId>
Rib::get (const std::string &name)
{
auto it = values.find (name);
if (it == values.end ())
return {};
return it->second;
}
const std::unordered_map<std::string, NodeId> &
Rib::get_values () const
{
return values;
}
} // namespace Resolver2_0
} // namespace Rust
|
