feedc0de/boost_endian
1
0
Fork 0
forked from boostorg/endian
Code Pull Requests Activity

Minor namespace detail cleanup.

Browse Source
This commit is contained in:
Beman
2014-12-09 07:38:04 -05:00
parent 7b86b251d7
commit a0b5805b73
1 changed files with 29 additions and 40 deletions
Download Patch File Download Diff File Expand all files Collapse all files

69
include/boost/endian/conversion.hpp
View File

@@ -174,6 +174,35 @@ namespace endian
//----------------------------------- end synopsis -------------------------------------// //----------------------------------- end synopsis -------------------------------------//
namespace detail
{
// generic reverse function template implementation approach using std::reverse
// suggested by Mathias Gaunard. Primary motivation for inclusion is to have an
// independent implementation to test against. Secondary motivation is use by
// floating-point reverse_endianness, but that use is likely to be replace by a
// more tailored floating-point implementation.
template <class T>
inline T std_reverse_endianness(T x) BOOST_NOEXCEPT
{
T tmp(x);
std::reverse(
reinterpret_cast<char*>(&tmp),
reinterpret_cast<char*>(&tmp) + sizeof(T));
return tmp;
}
// conditional unaligned reverse copy, patterned after std::reverse_copy
template <class T>
inline void big_reverse_copy(T from, char* to) BOOST_NOEXCEPT;
template <class T>
inline void big_reverse_copy(const char* from, T& to) BOOST_NOEXCEPT;
template <class T>
inline void little_reverse_copy(T from, char* to) BOOST_NOEXCEPT;
template <class T>
inline void little_reverse_copy(const char* from, T& to) BOOST_NOEXCEPT;
} // namespace detail
//--------------------------------------------------------------------------------------// //--------------------------------------------------------------------------------------//
// // // //
// return-by-value implementation // // return-by-value implementation //
@@ -270,35 +299,6 @@ namespace endian
# endif # endif
} }
namespace detail
{
// generic reverse function template implementation approach using std::reverse
// suggested by Mathias Gaunard. Primary motivation for inclusion is to have an
// independent implementation to test against. Secondary motivation is use by
// floating-point reverse_endianness, but that use is likely to be replace by a
// more tailored floating-point implementation.
template <class T>
inline T std_reverse_endianness(T x) BOOST_NOEXCEPT
{
T tmp(x);
std::reverse(
reinterpret_cast<char*>(&tmp),
reinterpret_cast<char*>(&tmp) + sizeof(T));
return tmp;
}
// conditional unaligned reverse copy, patterned after std::reverse_copy
template <class T>
inline void big_reverse_copy(T from, char* to) BOOST_NOEXCEPT;
template <class T>
inline void big_reverse_copy(const char* from, T& to) BOOST_NOEXCEPT;
template <class T>
inline void little_reverse_copy(T from, char* to) BOOST_NOEXCEPT;
template <class T>
inline void little_reverse_copy(const char* from, T& to) BOOST_NOEXCEPT;
} // namespace detail
inline float reverse_endianness(float x) BOOST_NOEXCEPT inline float reverse_endianness(float x) BOOST_NOEXCEPT
{ {
BOOST_STATIC_ASSERT_MSG(sizeof(float) == sizeof(uint32_t), BOOST_STATIC_ASSERT_MSG(sizeof(float) == sizeof(uint32_t),
@@ -534,17 +534,6 @@ namespace endian
namespace detail namespace detail
{ {
// general reverse_value function template implementation approach using std::reverse
// suggested by Mathias Gaunard
template <class T>
inline T reverse_value(T x) BOOST_NOEXCEPT
{
T tmp(x);
std::reverse(
reinterpret_cast<char*>(&tmp),
reinterpret_cast<char*>(&tmp) + sizeof(T));
return tmp;
}
template <class T> template <class T>
inline void big_reverse_copy(T from, char* to) BOOST_NOEXCEPT inline void big_reverse_copy(T from, char* to) BOOST_NOEXCEPT
{ {