├── .clang-format ├── .gitignore ├── LICENSE ├── README.md ├── argparse.hpp └── example.cpp /.clang-format: -------------------------------------------------------------------------------- 1 | BasedOnStyle: LLVM 2 | 3 | AccessModifierOffset: -4 4 | BreakConstructorInitializersBeforeComma: true 5 | IndentWidth: 4 6 | NamespaceIndentation: All 7 | ColumnLimit: 100 8 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Prerequisites 2 | *.d 3 | 4 | # Compiled Object files 5 | *.slo 6 | *.lo 7 | *.o 8 | *.obj 9 | 10 | # Precompiled Headers 11 | *.gch 12 | *.pch 13 | 14 | # Compiled Dynamic libraries 15 | *.so 16 | *.dylib 17 | *.dll 18 | 19 | # Fortran module files 20 | *.mod 21 | *.smod 22 | 23 | # Compiled Static libraries 24 | *.lai 25 | *.la 26 | *.a 27 | *.lib 28 | 29 | # Executables 30 | *.exe 31 | *.out 32 | *.app 33 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "[]" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright [yyyy] [name of copyright owner] 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # argparse: Python like C++ Argument parser 2 | 3 | © 2018 SiLeader. 4 | 5 | ## features 6 | + only one header file. 7 | + simular with Python's argparse module 8 | 9 | ## usage 10 | ```c++ 11 | #include "argparse.hpp" 12 | 13 | int main(int argc, char** argv) { 14 | argparse::ArgumentParser parser("test", "argparse test program", "Apache License 2.0"); 15 | 16 | parser.addArgument({"--value", "--set-value"}, "set value"); 17 | parser.addArgument({"--flag"}, "flag", argparse::ArgumentType::StoreTrue); 18 | parser.addArgument({"--value-default", "--value-with-default-value"}, "set value or use default value"); 19 | 20 | auto args = parser.parseArgs(argc, argv); 21 | 22 | std::cout << std::boolalpha; 23 | std::cout << "value: " << args.get("value") << std::endl; 24 | std::cout << "flag: " << args.has("flag") << std::endl; 25 | std::cout << "value(default='abc'): " << args.safeGet("value-default", "abc") << std::endl; 26 | } 27 | ``` 28 | 29 | ### run `COMMAND -h` on shell 30 | 31 | ```plain 32 | usage: test [OPTIONS]... 33 | 34 | argparse test program 35 | 36 | keyword arguments: 37 | --help, -h : show this help 38 | --value VALUE, --set-value VALUE : set value 39 | --flag : flag 40 | --value-default VALUE, --value-with-default-value VALUE : set value or use default value 41 | 42 | Apache License 2.0 43 | ``` 44 | 45 | ### run `COMMAND --value=argparse` on shell 46 | ```plain 47 | value: argparse 48 | flag: false 49 | value(default='abc'): abc 50 | ``` 51 | 52 | ### run `COMMAND --value argparse --flag` on shell 53 | ```plain 54 | value: argparse 55 | flag: true 56 | value(default='abc'): abc 57 | ``` 58 | 59 | ### run `COMMAND --value=argparse --flag --value-default parser` on shell 60 | ```plain 61 | value: argparse 62 | flag: true 63 | value(default='abc'): parser 64 | ``` 65 | 66 | ## license 67 | Apache License 2.0 68 | -------------------------------------------------------------------------------- /argparse.hpp: -------------------------------------------------------------------------------- 1 | // Copyright 2018 SiLeader. 2 | // 3 | // Licensed under the Apache License, Version 2.0 (the "License"); 4 | // you may not use this file except in compliance with the License. 5 | // You may obtain a copy of the License at 6 | // 7 | // http://www.apache.org/licenses/LICENSE-2.0 8 | // 9 | // Unless required by applicable law or agreed to in writing, software 10 | // distributed under the License is distributed on an "AS IS" BASIS, 11 | // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 12 | // See the License for the specific language governing permissions and 13 | // limitations under the License. 14 | 15 | #ifndef PYLIKE_UTILITY_ARGPARSE_HPP 16 | #define PYLIKE_UTILITY_ARGPARSE_HPP 17 | 18 | #include 19 | #include 20 | #include 21 | #include 22 | #include 23 | #include 24 | #include 25 | 26 | namespace argparse { 27 | namespace detail { 28 | inline std::vector split(const std::string &s, char delim) { 29 | std::vector elems; 30 | std::string item; 31 | for (char ch : s) { 32 | if (ch == delim) { 33 | if (!item.empty()) 34 | elems.emplace_back(item); 35 | item.clear(); 36 | } else { 37 | item += ch; 38 | } 39 | } 40 | if (!item.empty()) 41 | elems.emplace_back(item); 42 | return elems; 43 | } 44 | } // namespace detail 45 | 46 | enum class ArgumentType { 47 | Store, 48 | StoreTrue, 49 | }; 50 | 51 | class Arguments { 52 | private: 53 | std::unordered_map> _arguments; 54 | std::string _program; 55 | std::vector _command_line; 56 | 57 | public: 58 | Arguments(const std::unordered_map> &arguments, 59 | const std::string &program, const std::vector &command_line) 60 | : _arguments(arguments) 61 | , _program(program) 62 | , _command_line(command_line) {} 63 | 64 | public: 65 | const std::string &program() const noexcept { return _program; } 66 | 67 | bool get(const std::string &kw, signed char &buf, std::size_t index = 0) const { 68 | if (_arguments.count(kw) == 0) 69 | return false; 70 | if (_arguments.at(kw).size() <= index) 71 | return false; 72 | buf = static_cast(std::stoi(_arguments.at(kw)[index])); 73 | return true; 74 | } 75 | bool get(const std::string &kw, unsigned char &buf, std::size_t index = 0) const { 76 | if (_arguments.count(kw) == 0) 77 | return false; 78 | if (_arguments.at(kw).size() <= index) 79 | return false; 80 | buf = static_cast(std::stoi(_arguments.at(kw)[index])); 81 | return true; 82 | } 83 | bool get(const std::string &kw, signed short &buf, std::size_t index = 0) const { 84 | if (_arguments.count(kw) == 0) 85 | return false; 86 | if (_arguments.at(kw).size() <= index) 87 | return false; 88 | buf = static_cast(std::stoi(_arguments.at(kw)[index])); 89 | return true; 90 | } 91 | bool get(const std::string &kw, unsigned short &buf, std::size_t index = 0) const { 92 | if (_arguments.count(kw) == 0) 93 | return false; 94 | if (_arguments.at(kw).size() <= index) 95 | return false; 96 | buf = static_cast(std::stoi(_arguments.at(kw)[index])); 97 | return true; 98 | } 99 | bool get(const std::string &kw, signed int &buf, std::size_t index = 0) const { 100 | if (_arguments.count(kw) == 0) 101 | return false; 102 | if (_arguments.at(kw).size() <= index) 103 | return false; 104 | buf = std::stoi(_arguments.at(kw)[index]); 105 | return true; 106 | } 107 | bool get(const std::string &kw, unsigned int &buf, std::size_t index = 0) const { 108 | if (_arguments.count(kw) == 0) 109 | return false; 110 | if (_arguments.at(kw).size() <= index) 111 | return false; 112 | buf = static_cast(std::stoul(_arguments.at(kw)[index])); 113 | return true; 114 | } 115 | bool get(const std::string &kw, signed long &buf, std::size_t index = 0) const { 116 | if (_arguments.count(kw) == 0) 117 | return false; 118 | if (_arguments.at(kw).size() <= index) 119 | return false; 120 | buf = std::stol(_arguments.at(kw)[index]); 121 | return true; 122 | } 123 | bool get(const std::string &kw, unsigned long &buf, std::size_t index = 0) const { 124 | if (_arguments.count(kw) == 0) 125 | return false; 126 | if (_arguments.at(kw).size() <= index) 127 | return false; 128 | buf = std::stoul(_arguments.at(kw)[index]); 129 | return true; 130 | } 131 | bool get(const std::string &kw, signed long long &buf, std::size_t index = 0) const { 132 | if (_arguments.count(kw) == 0) 133 | return false; 134 | if (_arguments.at(kw).size() <= index) 135 | return false; 136 | buf = std::stoll(_arguments.at(kw)[index]); 137 | return true; 138 | } 139 | bool get(const std::string &kw, unsigned long long &buf, std::size_t index = 0) const { 140 | if (_arguments.count(kw) == 0) 141 | return false; 142 | if (_arguments.at(kw).size() <= index) 143 | return false; 144 | buf = std::stoull(_arguments.at(kw)[index]); 145 | return true; 146 | } 147 | bool get(const std::string &kw, std::string &buf, std::size_t index = 0) const { 148 | if (_arguments.count(kw) == 0) 149 | return false; 150 | if (_arguments.at(kw).size() <= index) 151 | return false; 152 | buf = _arguments.at(kw)[index]; 153 | return true; 154 | } 155 | bool has(const std::string &kw) const { return _arguments.count(kw) != 0; } 156 | 157 | bool get(const std::string &kw, std::vector &buf) const { 158 | if (_arguments.count(kw) == 0) 159 | return false; 160 | buf = _arguments.at(kw); 161 | return true; 162 | } 163 | 164 | template DataT get(const std::string &kw, std::size_t index = 0) const { 165 | DataT buf; 166 | if (get(kw, buf, index)) { 167 | return buf; 168 | } 169 | throw std::runtime_error("cannot find value of '" + kw + "'"); 170 | } 171 | 172 | template 173 | DataT safeGet(const std::string &kw, const DataT &defaultValue, 174 | std::size_t index = 0) const { 175 | if (has(kw)) { 176 | return get(kw, index); 177 | } 178 | return defaultValue; 179 | } 180 | 181 | const std::vector &getCommandLine() const noexcept { return _command_line; } 182 | }; 183 | 184 | class ArgumentParser { 185 | private: 186 | struct _argument_info { 187 | std::vector name; 188 | std::string help; 189 | ArgumentType type; 190 | }; 191 | 192 | private: 193 | std::vector<_argument_info> _positional, _keyword; 194 | std::string _program; 195 | std::string _description; 196 | std::string _epilog; 197 | 198 | public: 199 | explicit ArgumentParser(std::string prog, std::string description = "", 200 | std::string epilog = "") 201 | : _program(std::move(prog)) 202 | , _description(std::move(description)) 203 | , _epilog(std::move(epilog)) { 204 | addArgument({"--help", "-h"}, "show this help", ArgumentType::StoreTrue); 205 | } 206 | 207 | public: 208 | Arguments parseArgs(int argc, char const *const *const argv, 209 | bool allowEmptyPositionalArguments = false) const { 210 | std::string program = argv[0]; 211 | std::vector args(argv + 1, argv + argc); 212 | 213 | auto remove_hyphen = [](const std::string &str) -> std::string { 214 | for (std::size_t i = 0; i < str.size(); ++i) { 215 | if (str[i] != '-') { 216 | return std::string(std::begin(str) + i, std::end(str)); 217 | } 218 | } 219 | return str; 220 | }; 221 | 222 | { 223 | std::vector a; 224 | a.reserve(args.size() * 2); 225 | for (auto &arg : args) { 226 | auto ss = detail::split(arg, '='); 227 | a.insert(std::end(a), std::begin(ss), std::end(ss)); 228 | } 229 | args = a; 230 | } 231 | 232 | std::unordered_map> parsed; 233 | 234 | if (args.empty()) { 235 | return Arguments(parsed, program, args); 236 | } 237 | 238 | auto itr = std::begin(args); 239 | if (args[0][0] == '-') { 240 | auto kw_begin = std::begin(_keyword); 241 | auto kw_end = std::end(_keyword); 242 | 243 | // check keyword arguments; 244 | for (; itr != std::end(args); ++itr) { 245 | auto kw_itr = 246 | std::find_if(kw_begin, kw_end, [&itr](const _argument_info &info) { 247 | return std::find(std::begin(info.name), std::end(info.name), *itr) != 248 | std::end(info.name); 249 | }); 250 | if (kw_itr == kw_end) { 251 | if (itr->front() == '-') { 252 | std::cerr << "cannot find keyword argument: " << *itr << std::endl; 253 | std::exit(EXIT_FAILURE); 254 | } 255 | break; 256 | } 257 | 258 | auto name = *itr; 259 | switch (kw_itr->type) { 260 | case ArgumentType::Store: { 261 | if (itr + 1 == std::end(args)) { 262 | std::cerr << "keyword argument " << name << " must have value." 263 | << std::endl; 264 | std::exit(EXIT_FAILURE); 265 | } 266 | auto value = *(++itr); 267 | parsed[remove_hyphen(kw_itr->name[0])].emplace_back(value); 268 | break; 269 | } 270 | case ArgumentType::StoreTrue: { 271 | if (kw_itr->name[0] == "--help") { 272 | printHelp(); 273 | std::exit(EXIT_SUCCESS); 274 | } 275 | parsed[remove_hyphen(kw_itr->name[0])].emplace_back(""); 276 | break; 277 | } 278 | } 279 | } 280 | } 281 | 282 | if (_positional.empty() && itr != std::end(args)) { 283 | std::cerr << "no positional arguments is set. but some positional " 284 | "arguments passed." 285 | << std::endl; 286 | std::exit(EXIT_FAILURE); 287 | } 288 | 289 | auto passed_positional_count = static_cast(std::end(args) - itr); 290 | if (!allowEmptyPositionalArguments) { 291 | if (_positional.size() != passed_positional_count) { 292 | std::cerr << "required positional arguments is " << _positional.size() 293 | << ". but " << passed_positional_count << " was passed." << std::endl; 294 | std::exit(EXIT_FAILURE); 295 | } 296 | } 297 | for (const auto &i : _positional) { 298 | if (itr == std::end(args)) 299 | break; 300 | parsed[remove_hyphen(i.name[0])].emplace_back(*(itr++)); 301 | } 302 | 303 | return Arguments(parsed, program, args); 304 | } 305 | 306 | public: 307 | void addArgument(const std::vector &name, const std::string &help, 308 | ArgumentType type = ArgumentType::Store) { 309 | if (name.empty()) 310 | return; 311 | 312 | _argument_info info; 313 | 314 | info.name = name; 315 | info.help = help; 316 | info.type = type; 317 | 318 | if (name[0][0] == '-') { 319 | _keyword.emplace_back(info); 320 | } else { 321 | _positional.emplace_back(info); 322 | } 323 | } 324 | 325 | public: 326 | std::string help() const { 327 | std::stringstream ss; 328 | ss << "usage: " << _program; 329 | if (!_keyword.empty()) { 330 | ss << " [OPTIONS]"; 331 | if (_keyword.size() > 1) { 332 | ss << "..."; 333 | } 334 | } 335 | for (const auto &p : _positional) { 336 | auto n = p.name[0]; 337 | std::transform(std::begin(n), std::end(n), std::begin(n), ::toupper); 338 | ss << " " << n; 339 | } 340 | 341 | ss << "\n\n"; 342 | 343 | ss << _description << "\n\n"; 344 | 345 | if (!_keyword.empty()) { 346 | ss << "keyword arguments:\n"; 347 | 348 | std::size_t most_long_length = 0; 349 | std::vector> name_helps; 350 | name_helps.reserve(_keyword.size()); 351 | for (const auto &k : _keyword) { 352 | std::string name; 353 | for (const auto &n : k.name) { 354 | name += n; 355 | if (k.type == ArgumentType::Store) { 356 | name += " VALUE"; 357 | } 358 | name += ", "; 359 | } 360 | name.pop_back(); 361 | name.pop_back(); 362 | name_helps.emplace_back(name, k.help); 363 | 364 | if (name.size() > most_long_length) { 365 | most_long_length = name.size(); 366 | } 367 | } 368 | 369 | for (const auto &nh : name_helps) { 370 | std::string name, help; 371 | std::tie(name, help) = nh; 372 | 373 | ss << " " << std::setw(static_cast(most_long_length)) << std::left << name 374 | << " : " << help << "\n"; 375 | } 376 | ss << "\n"; 377 | } 378 | 379 | if (!_positional.empty()) { 380 | ss << "positional arguments:\n"; 381 | 382 | std::size_t most_long_length = 0; 383 | std::vector> name_helps; 384 | name_helps.reserve(_positional.size()); 385 | for (const auto &p : _positional) { 386 | std::string name; 387 | for (const auto &n : p.name) { 388 | name += n; 389 | name += ", "; 390 | } 391 | name.pop_back(); 392 | name.pop_back(); 393 | name_helps.emplace_back(name, p.help); 394 | 395 | if (name.size() > most_long_length) { 396 | most_long_length = name.size(); 397 | } 398 | } 399 | 400 | for (const auto &nh : name_helps) { 401 | std::string name, help; 402 | std::tie(name, help) = nh; 403 | 404 | ss << " " << std::setw(static_cast(most_long_length)) << std::left << name 405 | << " : " << help << "\n"; 406 | } 407 | ss << "\n"; 408 | } 409 | 410 | if (!_epilog.empty()) { 411 | ss << _epilog << "\n"; 412 | } 413 | ss << std::flush; 414 | return ss.str(); 415 | } 416 | void printHelp(std::ostream &os = std::cout) const { os << help() << std::flush; } 417 | }; 418 | } // namespace argparse 419 | 420 | #endif // PYLIKE_UTILITY_ARGPARSE_HPP 421 | -------------------------------------------------------------------------------- /example.cpp: -------------------------------------------------------------------------------- 1 | #include "argparse.hpp" 2 | 3 | int main(int argc, char** argv) { 4 | argparse::ArgumentParser parser("test", "argparse test program", "Apache License 2.0"); 5 | 6 | parser.addArgument({"--value", "--set-value"}, "set value"); 7 | parser.addArgument({"--flag"}, "flag", argparse::ArgumentType::StoreTrue); 8 | parser.addArgument({"--value-default", "--value-with-default-value"}, "set value or use default value"); 9 | parser.addArgument({"value1"}, "value1"); 10 | parser.addArgument({"value2"}, "value2"); 11 | 12 | auto args = parser.parseArgs(argc, argv); 13 | 14 | std::cout << std::boolalpha; 15 | std::cout << "value: " << args.get("value") << std::endl; 16 | std::cout << "flag: " << args.has("flag") << std::endl; 17 | std::cout << "value(default='abc'): " << args.safeGet("value-default", "abc") << std::endl; 18 | std::cout << "value1: " << args.get("value1")<("value2")<