mirrors/CLI11
1
0
Fork 0
mirror of https://github.com/CLIUtils/CLI11.git synced 2025-05-01 05:03:52 +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-28 13:31:17 +00:00
parent a5768acf08
commit bf467089b2
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
examples/close_match.cpp
View File

@ -15,7 +15,7 @@
std::size_t prefixMatch(const std::string &s1, const std::string &s2) { std::size_t prefixMatch(const std::string &s1, const std::string &s2) {
if(s1.size() < s2.size()) { if(s1.size() < s2.size()) {
if (s2.compare(0, s1.size(), s1) == 0) { if(s2.compare(0, s1.size(), s1) == 0) {
return s2.size() - s1.size(); return s2.size() - s1.size();
} }
return std::string::npos; return std::string::npos;
@ -59,7 +59,8 @@ findClosestMatch(const std::string &input, const std::vector<std::string> &candi
std::string closest; std::string closest;
std::size_t minDistance = (std::numeric_limits<std::size_t>::max)(); std::size_t minDistance = (std::numeric_limits<std::size_t>::max)();
for(const auto &candidate : candidates) { for(const auto &candidate : candidates) {
std::size_t distance=(match == MatchType::proximity)?levenshteinDistance(input, candidate):prefixMatch(input, candidate); std::size_t distance =
(match == MatchType::proximity) ? levenshteinDistance(input, candidate) : prefixMatch(input, candidate);
if(distance < minDistance) { if(distance < minDistance) {
minDistance = distance; minDistance = distance;
closest = candidate; closest = candidate;