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

Updated the min and max to deal with a macro in minwindef.h

Browse Source
This commit is contained in:
Nick T 2024-08-15 15:47:23 +12:00 committed by GitHub
parent 8a7fa18998
commit df58f9d140
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
include/argparse/argparse.hpp
View File

@ -550,7 +550,7 @@ std::size_t get_levenshtein_distance(const StringType &s1,
} else if (s1[i - 1] == s2[j - 1]) { } else if (s1[i - 1] == s2[j - 1]) {
dp[i][j] = dp[i - 1][j - 1]; dp[i][j] = dp[i - 1][j - 1];
} else { } else {
dp[i][j] = 1 + std::min({dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]}); dp[i][j] = 1 + std::min<std::size_t>({dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]});
} }
} }
} }
@ -562,7 +562,7 @@ template <typename ValueType>
std::string get_most_similar_string(const std::map<std::string, ValueType> &map, std::string get_most_similar_string(const std::map<std::string, ValueType> &map,
const std::string &input) { const std::string &input) {
std::string most_similar{}; std::string most_similar{};
std::size_t min_distance = std::numeric_limits<std::size_t>::max(); std::size_t min_distance = (std::numeric_limits<std::size_t>::max)();
for (const auto &entry : map) { for (const auto &entry : map) {
std::size_t distance = get_levenshtein_distance(entry.first, input); std::size_t distance = get_levenshtein_distance(entry.first, input);
@ -2057,7 +2057,7 @@ public:
std::string curline("Usage: "); std::string curline("Usage: ");
curline += this->m_program_name; curline += this->m_program_name;
const bool multiline_usage = const bool multiline_usage =
this->m_usage_max_line_width < std::numeric_limits<std::size_t>::max(); this->m_usage_max_line_width < (std::numeric_limits<std::size_t>::max)();
const size_t indent_size = curline.size(); const size_t indent_size = curline.size();
const auto deal_with_options_of_group = [&](std::size_t group_idx) { const auto deal_with_options_of_group = [&](std::size_t group_idx) {
@ -2534,7 +2534,7 @@ protected:
std::map<std::string, bool> m_subparser_used; std::map<std::string, bool> m_subparser_used;
std::vector<MutuallyExclusiveGroup> m_mutually_exclusive_groups; std::vector<MutuallyExclusiveGroup> m_mutually_exclusive_groups;
bool m_suppress = false; bool m_suppress = false;
std::size_t m_usage_max_line_width = std::numeric_limits<std::size_t>::max(); std::size_t m_usage_max_line_width = (std::numeric_limits<std::size_t>::max)();
bool m_usage_break_on_mutex = false; bool m_usage_break_on_mutex = false;
int m_usage_newline_counter = 0; int m_usage_newline_counter = 0;
std::vector<std::string> m_group_names; std::vector<std::string> m_group_names;