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

clang-tidy fixes

Browse Source
This commit is contained in:
Philip Top 2025-04-21 14:03:19 -07:00
parent 91ded76992
commit b857f3516e
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

@ -11,6 +11,7 @@
#include <limits> #include <limits>
#include <string> #include <string>
#include <vector> #include <vector>
#include <utility>
// 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) {
@ -18,9 +19,9 @@ int levenshteinDistance(const std::string &s1, const std::string &s2) {
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) for(size_t i = 0; i <= len1; ++i)
dp[i][0] = i; dp[i][0] = static_cast<int>(i);
for(size_t j = 0; j <= len2; ++j) for(size_t j = 0; j <= len2; ++j)
dp[0][j] = j; dp[0][j] = static_cast<int>(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) {