From df58f9d140e8609ca24b1c8d95a25575b1508b7d Mon Sep 17 00:00:00 2001 From: Nick T <59980396+nick20201@users.noreply.github.com> Date: Thu, 15 Aug 2024 15:47:23 +1200 Subject: [PATCH] Updated the min and max to deal with a macro in minwindef.h --- include/argparse/argparse.hpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/include/argparse/argparse.hpp b/include/argparse/argparse.hpp index 72dd7883..394031d3 100644 --- a/include/argparse/argparse.hpp +++ b/include/argparse/argparse.hpp @@ -550,7 +550,7 @@ std::size_t get_levenshtein_distance(const StringType &s1, } else if (s1[i - 1] == s2[j - 1]) { dp[i][j] = dp[i - 1][j - 1]; } 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({dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]}); } } } @@ -562,7 +562,7 @@ template std::string get_most_similar_string(const std::map &map, const std::string &input) { std::string most_similar{}; - std::size_t min_distance = std::numeric_limits::max(); + std::size_t min_distance = (std::numeric_limits::max)(); for (const auto &entry : map) { std::size_t distance = get_levenshtein_distance(entry.first, input); @@ -2057,7 +2057,7 @@ class ArgumentParser { std::string curline("Usage: "); curline += this->m_program_name; const bool multiline_usage = - this->m_usage_max_line_width < std::numeric_limits::max(); + this->m_usage_max_line_width < (std::numeric_limits::max)(); const size_t indent_size = curline.size(); const auto deal_with_options_of_group = [&](std::size_t group_idx) { @@ -2534,7 +2534,7 @@ class ArgumentParser { std::map m_subparser_used; std::vector m_mutually_exclusive_groups; bool m_suppress = false; - std::size_t m_usage_max_line_width = std::numeric_limits::max(); + std::size_t m_usage_max_line_width = (std::numeric_limits::max)(); bool m_usage_break_on_mutex = false; int m_usage_newline_counter = 0; std::vector m_group_names;