KeqingMoe/argparse
1
0
Fork 0
mirror of https://github.com/KeqingMoe/argparse.git synced 2025-07-04 07:04:39 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Using size_t for levenshtein distance

Browse Source
This commit is contained in:
Pranav Srinivas Kumar 2023-11-04 15:48:13 -05:00
parent b43c0a7e83
commit ecccae530c
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
include/argparse/argparse.hpp
View File

@ -481,10 +481,10 @@ std::string_view
get_most_similar_string(const std::map<std::string_view, ValueType> &map, get_most_similar_string(const std::map<std::string_view, ValueType> &map,
const std::string_view input) { const std::string_view input) {
std::string_view most_similar{}; std::string_view most_similar{};
int min_distance = std::numeric_limits<int>::max(); std::size_t min_distance = std::numeric_limits<std::size_t>::max();
for (const auto &entry : map) { for (const auto &entry : map) {
int distance = get_levenshtein_distance(entry.first, input); std::size_t distance = get_levenshtein_distance(entry.first, input);
if (distance < min_distance) { if (distance < min_distance) {
min_distance = distance; min_distance = distance;
most_similar = entry.first; most_similar = entry.first;