mirrors/CLI11
1
0
Fork 0
mirror of https://github.com/CLIUtils/CLI11.git synced 2025-05-06 15:13:52 +00:00
Code Issues Releases Wiki Activity

more code clean up

Browse Source
This commit is contained in:
Philip Top 2025-05-03 06:07:11 -07:00
parent 9b071f4804
commit 67c1728649
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
examples/close_match.cpp
View File

@ -6,15 +6,16 @@
// Code inspired by discussion from https://github.com/CLIUtils/CLI11/issues/1149 // Code inspired by discussion from https://github.com/CLIUtils/CLI11/issues/1149
#include <CLI/CLI.hpp>
#include <algorithm> #include <algorithm>
#include <iostream> #include <iostream>
#include <limits>
#include <numeric> #include <numeric>
#include <string> #include <string>
#include <utility> #include <utility>
#include <vector> #include <vector>
#include <CLI/CLI.hpp>
// only works with C++14 or higher // only works with C++14 or higher
// Levenshtein distance function code generated by chatgpt/copilot // Levenshtein distance function code generated by chatgpt/copilot
@ -50,7 +51,7 @@ std::size_t levenshteinDistance(const std::string &s1, const std::string &s2) {
std::pair<std::string, std::size_t> findClosestMatch(const std::string &input, std::pair<std::string, std::size_t> findClosestMatch(const std::string &input,
const std::vector<std::string> &candidates) { const std::vector<std::string> &candidates) {
std::string closest; std::string closest;
std::size_t minDistance = (std::numeric_limits<std::size_t>::max)(); std::size_t minDistance{ std::string::npos };
for(const auto &candidate : candidates) { for(const auto &candidate : candidates) {
std::size_t distance = levenshteinDistance(input, candidate); std::size_t distance = levenshteinDistance(input, candidate);
if(distance < minDistance) { if(distance < minDistance) {