mirrors/CLI11
1
0
Fork 0
mirror of https://github.com/CLIUtils/CLI11.git synced 2025-04-29 20:23:55 +00:00
Code Issues Releases Wiki Activity

style: pre-commit.ci fixes

Browse Source
This commit is contained in:
pre-commit-ci[bot] 2025-04-21 16:07:10 +00:00
parent 0549f7c450
commit 3021257c04
1 changed files with 30 additions and 38 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
examples/close_match.cpp
View File

@ -8,17 +8,19 @@
#include <CLI/CLI.hpp> #include <CLI/CLI.hpp>
#include <iostream> #include <iostream>
#include <limits>
#include <string> #include <string>
#include <vector> #include <vector>
#include <limits>
// Levenshtein distance function code generated by chatgpt // Levenshtein distance function code generated by chatgpt
int levenshteinDistance(const std::string &s1, const std::string &s2) { int levenshteinDistance(const std::string &s1, const std::string &s2) {
size_t len1 = s1.size(), len2 = s2.size(); size_t len1 = s1.size(), len2 = s2.size();
std::vector<std::vector<int>> dp(len1 + 1, std::vector<int>(len2 + 1)); std::vector<std::vector<int>> dp(len1 + 1, std::vector<int>(len2 + 1));
for (size_t i = 0; i <= len1; ++i) dp[i][0] = i; for(size_t i = 0; i <= len1; ++i)
for (size_t j = 0; j <= len2; ++j) dp[0][j] = j; dp[i][0] = i;
for(size_t j = 0; j <= len2; ++j)
dp[0][j] = j;
for(size_t i = 1; i <= len1; ++i) { for(size_t i = 1; i <= len1; ++i) {
for(size_t j = 1; j <= len2; ++j) { for(size_t j = 1; j <= len2; ++j) {
@ -69,39 +71,29 @@ int main(int argc, const char *argv[]) {
app.parse_complete_callback([&app]() { app.parse_complete_callback([&app]() {
auto extras = app.remaining(); auto extras = app.remaining();
if (extras.empty()) if(extras.empty()) {
{
return; return;
} }
auto subs = app.get_subcommands(nullptr); auto subs = app.get_subcommands(nullptr);
std::vector<std::string> list; std::vector<std::string> list;
for(const auto *sub : subs) { for(const auto *sub : subs) {
if (!sub->get_name().empty()) if(!sub->get_name().empty()) {
{
list.push_back(sub->get_name()); list.push_back(sub->get_name());
} }
auto aliases = sub->get_aliases(); auto aliases = sub->get_aliases();
if (!aliases.empty()) if(!aliases.empty()) {
{
list.insert(list.end(), aliases.begin(), aliases.end()); list.insert(list.end(), aliases.begin(), aliases.end());
} }
} }
for (auto& extra : extras) for(auto &extra : extras) {
{ if(extra.front() != '-') {
if (extra.front() != '-')
{
auto closest = findClosestMatch(extra, list); auto closest = findClosestMatch(extra, list);
if (closest.second <= 3) if(closest.second <= 3) {
{
std::cout << "unmatched commands " << extra << ", closest match is " << closest.first << "\n"; std::cout << "unmatched commands " << extra << ", closest match is " << closest.first << "\n";
} }
} }
} }
});
}
);
CLI11_PARSE(app, argc, argv); CLI11_PARSE(app, argc, argv);
return 0; return 0;
} }