-
Notifications
You must be signed in to change notification settings - Fork 84
Expand file tree
/
Copy pathoption_map.cpp
More file actions
93 lines (79 loc) · 2.82 KB
/
option_map.cpp
File metadata and controls
93 lines (79 loc) · 2.82 KB
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
/* vim:set ts=2 sw=2 sts=2 et: */
/**
* \author Marcus Holland-Moritz (github@mhxnet.de)
* \copyright Copyright (c) Marcus Holland-Moritz
*
* This file is part of dwarfs.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the “Software”), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
* SPDX-License-Identifier: MIT
*/
#include <algorithm>
#include <vector>
#include <fmt/format.h>
#if FMT_VERSION >= 110000
#include <fmt/ranges.h>
#endif
#include <dwarfs/error.h>
#include <dwarfs/option_map.h>
#include <dwarfs/string.h>
#include <dwarfs/util.h>
namespace dwarfs {
option_map::option_map(std::string_view const spec) {
auto arg = split_to<std::vector<std::string_view>>(spec, ':');
choice_ = arg[0];
for (size_t i = 1; i < arg.size(); ++i) {
std::string key;
std::string val;
if (auto eqpos = arg[i].find('='); eqpos != std::string_view::npos) {
key.assign(arg[i].substr(0, eqpos));
val.assign(arg[i].substr(eqpos + 1));
} else {
key.assign(arg[i]);
val.assign("1");
}
if (!opt_.emplace(key, val).second) {
DWARFS_THROW(
runtime_error,
fmt::format("duplicate option {} for choice {}", key, choice_));
}
}
}
size_t option_map::get_size(std::string const& key, size_t default_value) {
auto i = opt_.find(key);
if (i != opt_.end()) {
std::string val = i->second;
opt_.erase(i);
return parse_size_with_unit(val);
}
return default_value;
}
void option_map::report() {
if (!opt_.empty()) {
std::vector<std::string> invalid;
std::ranges::transform(opt_, std::back_inserter(invalid),
[](auto const& p) { return p.first; });
std::ranges::sort(invalid);
DWARFS_THROW(runtime_error,
fmt::format("invalid option(s) for choice {}: {}", choice_,
fmt::join(invalid, ", ")));
}
}
} // namespace dwarfs