Skip to content

Commit

Permalink
🚑 fixed compilation error
Browse files Browse the repository at this point in the history
  • Loading branch information
nlohmann committed Oct 7, 2018
1 parent 3abb788 commit 6e49d9f
Show file tree
Hide file tree
Showing 3 changed files with 18 additions and 22 deletions.
4 changes: 2 additions & 2 deletions include/nlohmann/detail/input/lexer.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -104,9 +104,9 @@ class lexer

// delete because of pointer members
lexer(const lexer&) = delete;
lexer(lexer&&) noexcept = default;
lexer(lexer&&) = delete;
lexer& operator=(lexer&) = delete;
lexer& operator=(lexer&&) noexcept = default;
lexer& operator=(lexer&&) = delete;
~lexer() = default;

private:
Expand Down
4 changes: 2 additions & 2 deletions include/nlohmann/detail/output/serializer.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -53,8 +53,8 @@ class serializer
// delete because of pointer members
serializer(const serializer&) = delete;
serializer& operator=(const serializer&) = delete;
serializer(serializer&&) noexcept = default;
serializer& operator=(serializer&&) noexcept = default;
serializer(serializer&&) = delete;
serializer& operator=(serializer&&) = delete;
~serializer() = default;

/*!
Expand Down
32 changes: 14 additions & 18 deletions single_include/nlohmann/json.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -2373,9 +2373,9 @@ class lexer

// delete because of pointer members
lexer(const lexer&) = delete;
lexer(lexer&&) noexcept = default;
lexer(lexer&&) = delete;
lexer& operator=(lexer&) = delete;
lexer& operator=(lexer&&) noexcept = default;
lexer& operator=(lexer&&) = delete;
~lexer() = default;

private:
Expand Down Expand Up @@ -8510,22 +8510,20 @@ class binary_writer
{
return 'i';
}
else if ((std::numeric_limits<uint8_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<uint8_t>::max)())
if ((std::numeric_limits<uint8_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<uint8_t>::max)())
{
return 'U';
}
else if ((std::numeric_limits<int16_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<int16_t>::max)())
if ((std::numeric_limits<int16_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<int16_t>::max)())
{
return 'I';
}
else if ((std::numeric_limits<int32_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<int32_t>::max)())
if ((std::numeric_limits<int32_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<int32_t>::max)())
{
return 'l';
}
else // no check and assume int64_t (see note above)
{
return 'L';
}
// no check and assume int64_t (see note above)
return 'L';
}

case value_t::number_unsigned:
Expand All @@ -8534,22 +8532,20 @@ class binary_writer
{
return 'i';
}
else if (j.m_value.number_unsigned <= (std::numeric_limits<uint8_t>::max)())
if (j.m_value.number_unsigned <= (std::numeric_limits<uint8_t>::max)())
{
return 'U';
}
else if (j.m_value.number_unsigned <= (std::numeric_limits<int16_t>::max)())
if (j.m_value.number_unsigned <= (std::numeric_limits<int16_t>::max)())
{
return 'I';
}
else if (j.m_value.number_unsigned <= (std::numeric_limits<int32_t>::max)())
if (j.m_value.number_unsigned <= (std::numeric_limits<int32_t>::max)())
{
return 'l';
}
else // no check and assume int64_t (see note above)
{
return 'L';
}
// no check and assume int64_t (see note above)
return 'L';
}

case value_t::number_float:
Expand Down Expand Up @@ -9765,8 +9761,8 @@ class serializer
// delete because of pointer members
serializer(const serializer&) = delete;
serializer& operator=(const serializer&) = delete;
serializer(serializer&&) noexcept = default;
serializer& operator=(serializer&&) noexcept = default;
serializer(serializer&&) = delete;
serializer& operator=(serializer&&) = delete;
~serializer() = default;

/*!
Expand Down

0 comments on commit 6e49d9f

Please sign in to comment.