1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Sprout/sprout/bit/length.hpp

81 lines
2.7 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
2014-01-08 07:48:12 +00:00
Copyright (c) 2011-2014 Bolero MURAKAMI
2013-08-08 09:54:33 +00:00
https://github.com/bolero-MURAKAMI/Sprout
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
2012-08-08 12:59:47 +00:00
#ifndef SPROUT_BIT_LENGTH_HPP
#define SPROUT_BIT_LENGTH_HPP
#include <climits>
#include <cstddef>
#include <type_traits>
#include <sprout/config.hpp>
namespace sprout {
namespace detail {
SPROUT_STATIC_CONSTEXPR std::size_t bit_len_8_table[std::size_t(UCHAR_MAX) + 1] = {
0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8
};
template<std::size_t Size>
struct bit_len {
private:
SPROUT_STATIC_CONSTEXPR std::size_t next_size = Size - 1;
SPROUT_STATIC_CONSTEXPR std::size_t shift_bits = next_size * CHAR_BIT;
private:
template<typename IntType>
2012-10-05 15:58:56 +00:00
SPROUT_CONSTEXPR IntType
impl(IntType x, unsigned char i) const {
2012-08-08 12:59:47 +00:00
return bit_len_8_table[i]
? bit_len_8_table[i] + next_size * CHAR_BIT
: sprout::detail::bit_len<next_size>().template operator()(x)
;
}
public:
template<typename IntType>
2012-10-05 15:58:56 +00:00
SPROUT_CONSTEXPR IntType
operator()(IntType x) const {
2012-08-08 12:59:47 +00:00
return impl(x, static_cast<unsigned char>((x >> shift_bits) & UCHAR_MAX));
}
};
template<>
struct bit_len<1> {
public:
template<typename IntType>
2012-10-05 15:58:56 +00:00
SPROUT_CONSTEXPR IntType
operator()(IntType x) const {
2012-08-08 12:59:47 +00:00
return bit_len_8_table[static_cast<unsigned char>(x & UCHAR_MAX)];
}
};
} // namespace detail
//
// bit_length
//
template<typename IntType>
inline SPROUT_CONSTEXPR typename std::enable_if<
std::is_integral<IntType>::value,
IntType
2012-10-05 15:58:56 +00:00
>::type
bit_length(IntType x) {
2012-08-08 12:59:47 +00:00
return sprout::detail::bit_len<sizeof(IntType)>().template operator()(x);
}
} // namespace sprout
#endif // #ifndef SPROUT_BIT_LENGTH_HPP