mirror of
https://github.com/boostorg/beast.git
synced 2025-07-30 04:47:29 +02:00
@ -1,3 +1,9 @@
|
||||
Version 139:
|
||||
|
||||
* Revisit boost library min/max guidance
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
|
||||
Version 138:
|
||||
|
||||
* Tidy up some documentation
|
||||
|
@ -124,7 +124,7 @@ public:
|
||||
void
|
||||
commit(std::size_t n)
|
||||
{
|
||||
out_ += std::min<std::size_t>(n, last_ - out_);
|
||||
out_ += (std::min<std::size_t>)(n, last_ - out_);
|
||||
}
|
||||
|
||||
/// Remove bytes from the input sequence.
|
||||
|
@ -263,9 +263,9 @@ prepare(std::size_t n) ->
|
||||
BOOST_THROW_EXCEPTION(std::length_error{
|
||||
"basic_flat_buffer overflow"});
|
||||
// allocate a new buffer
|
||||
auto const new_size = std::min<std::size_t>(
|
||||
auto const new_size = (std::min<std::size_t>)(
|
||||
max_,
|
||||
std::max<std::size_t>(2 * len, len + n));
|
||||
(std::max<std::size_t>)(2 * len, len + n));
|
||||
auto const p = alloc_traits::allocate(
|
||||
this->member(), new_size);
|
||||
if(begin_)
|
||||
|
@ -700,9 +700,9 @@ prepare(size_type n) ->
|
||||
{
|
||||
static auto const growth_factor = 2.0f;
|
||||
auto const size =
|
||||
std::min<std::size_t>(
|
||||
(std::min<std::size_t>)(
|
||||
max_ - total,
|
||||
std::max<std::size_t>({
|
||||
(std::max<std::size_t>)({
|
||||
static_cast<std::size_t>(
|
||||
in_size_ * growth_factor - in_size_),
|
||||
512,
|
||||
|
@ -45,9 +45,9 @@ read_size(DynamicBuffer& buffer,
|
||||
auto const size = buffer.size();
|
||||
auto const limit = buffer.max_size() - size;
|
||||
BOOST_ASSERT(size <= buffer.max_size());
|
||||
return std::min<std::size_t>(
|
||||
std::max<std::size_t>(512, buffer.capacity() - size),
|
||||
std::min<std::size_t>(max_size, limit));
|
||||
return (std::min<std::size_t>)(
|
||||
(std::max<std::size_t>)(512, buffer.capacity() - size),
|
||||
(std::min<std::size_t>)(max_size, limit));
|
||||
}
|
||||
|
||||
} // detail
|
||||
|
@ -167,7 +167,7 @@ loop:
|
||||
maybe_need_more(p, n, ec);
|
||||
if(ec)
|
||||
goto done;
|
||||
parse_start_line(p, p + std::min<std::size_t>(
|
||||
parse_start_line(p, p + (std::min<std::size_t>)(
|
||||
header_limit_, n), ec, is_request{});
|
||||
if(ec)
|
||||
{
|
||||
@ -198,7 +198,7 @@ loop:
|
||||
maybe_need_more(p, n, ec);
|
||||
if(ec)
|
||||
goto done;
|
||||
parse_fields(p, p + std::min<std::size_t>(
|
||||
parse_fields(p, p + (std::min<std::size_t>)(
|
||||
header_limit_, n), ec);
|
||||
if(ec)
|
||||
{
|
||||
|
@ -417,8 +417,8 @@ operator()()
|
||||
}
|
||||
auto& r = sr_.reader_impl();
|
||||
boost::winapi::DWORD_ const nNumberOfBytesToWrite =
|
||||
std::min<boost::winapi::DWORD_>(
|
||||
beast::detail::clamp(std::min<std::uint64_t>(
|
||||
(std::min<boost::winapi::DWORD_>)(
|
||||
beast::detail::clamp((std::min<std::uint64_t>)(
|
||||
r.body_.last_ - r.pos_, sr_.limit())),
|
||||
2147483646);
|
||||
boost::asio::windows::overlapped_ptr overlapped{
|
||||
@ -514,8 +514,8 @@ write_some(
|
||||
if(ec)
|
||||
return 0;
|
||||
boost::winapi::DWORD_ const nNumberOfBytesToWrite =
|
||||
std::min<boost::winapi::DWORD_>(
|
||||
beast::detail::clamp(std::min<std::uint64_t>(
|
||||
(std::min<boost::winapi::DWORD_>)(
|
||||
beast::detail::clamp((std::min<std::uint64_t>)(
|
||||
r.body_.last_ - r.pos_, sr.limit())),
|
||||
2147483646);
|
||||
auto const bSuccess = ::TransmitFile(
|
||||
|
@ -277,7 +277,7 @@ pmd_negotiate(
|
||||
s += "; client_no_context_takeover";
|
||||
|
||||
if(offer.server_max_window_bits != 0)
|
||||
config.server_max_window_bits = std::min(
|
||||
config.server_max_window_bits = (std::min)(
|
||||
offer.server_max_window_bits,
|
||||
o.server_max_window_bits);
|
||||
else
|
||||
@ -326,7 +326,7 @@ pmd_negotiate(
|
||||
|
||||
default:
|
||||
// extension parameter has value in [8..15]
|
||||
config.client_max_window_bits = std::min(
|
||||
config.client_max_window_bits = (std::min)(
|
||||
o.client_max_window_bits,
|
||||
offer.client_max_window_bits);
|
||||
s += "; client_max_window_bits=";
|
||||
|
Reference in New Issue
Block a user