mirrors/CLI11
1
0
Fork 0
mirror of https://github.com/CLIUtils/CLI11.git synced 2025-05-07 07:33:51 +00:00
Code Issues Releases Wiki Activity

style: pre-commit.ci fixes

Browse Source
This commit is contained in:
pre-commit-ci[bot] 2025-05-03 13:07:35 +00:00
parent 67c1728649
commit a3c7f25bfe
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
examples/close_match.cpp
View File

@ -6,7 +6,6 @@
// 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 <algorithm> #include <algorithm>
#include <iostream> #include <iostream>
#include <numeric> #include <numeric>
@ -51,7 +50,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::string::npos }; 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) {