7 const uint32_t sign =
static_cast<uint32_t
>(bits & 0x8000U) << 16;
8 const uint32_t exponent = (bits >> 10) & 0x1FU;
9 const uint32_t mantissa = bits & 0x3FFU;
17 uint32_t normalised = mantissa;
18 while ((normalised & 0x400U) == 0) {
23 pattern = sign | ((113U - shifts) << 23) | (normalised << 13);
25 }
else if (exponent == 0x1FU) {
26 pattern = sign | 0x7F800000U | (mantissa << 13);
28 pattern = sign | ((exponent - 15U + 127U) << 23) | (mantissa << 13);
32 std::memcpy(&value, &pattern,
sizeof(value));
39 std::memcpy(&pattern, &value,
sizeof(pattern));
41 const uint32_t sign = (pattern >> 16) & 0x8000U;
42 const auto field =
static_cast<int32_t
>((pattern >> 23) & 0xFFU);
43 uint32_t mantissa = pattern & 0x7FFFFFU;
47 return static_cast<uint16_t
>(sign | 0x7C00U);
48 return static_cast<uint16_t
>(sign | 0x7C00U | 0x200U | (mantissa >> 13));
51 const int32_t exponent = field - 127 + 15;
53 return static_cast<uint16_t
>(sign | 0x7C00U);
57 return static_cast<uint16_t
>(sign);
58 mantissa |= 0x800000U;
59 const auto shift =
static_cast<uint32_t
>(14 - exponent);
60 uint32_t half = mantissa >> shift;
61 const uint32_t round_bit = 1U << (shift - 1U);
62 if ((mantissa & round_bit) != 0U && ((mantissa & (round_bit - 1U)) != 0U || (half & 1U) != 0U))
64 return static_cast<uint16_t
>(sign | half);
67 uint32_t half = (
static_cast<uint32_t
>(exponent) << 10) | (mantissa >> 13);
68 const uint32_t remainder = mantissa & 0x1FFFU;
69 if (remainder > 0x1000U || (remainder == 0x1000U && (half & 1U) != 0U))
71 return static_cast<uint16_t
>(sign | half);
76 const int bias = (1 << (exponent_bits - 1)) - 1;
77 const uint32_t exponent_all = (1U << exponent_bits) - 1U;
78 const bool negative = ((bits >> (exponent_bits + mantissa_bits)) & 1U) != 0U;
79 const uint32_t exponent = (bits >> mantissa_bits) & exponent_all;
80 const uint32_t mantissa = bits & ((1U << mantissa_bits) - 1U);
83 if (exponent == exponent_all) {
84 value = mantissa != 0U ? std::numeric_limits<double>::quiet_NaN() : std::numeric_limits<double>::infinity();
85 }
else if (exponent == 0U) {
86 value = std::ldexp(
static_cast<double>(mantissa), 1 - bias - mantissa_bits);
88 value = std::ldexp(
static_cast<double>(mantissa | (1U << mantissa_bits)),
89 static_cast<int>(exponent) - bias - mantissa_bits);
91 return negative ? -value : value;
96 const int bias = (1 << (exponent_bits - 1)) - 1;
97 const uint32_t exponent_all = (1U << exponent_bits) - 1U;
98 const uint32_t sign = std::signbit(value) ? (1U << (exponent_bits + mantissa_bits)) : 0U;
100 if (std::isnan(value))
101 return sign | (exponent_all << mantissa_bits) | (1U << (mantissa_bits - 1));
103 value = std::fabs(value);
104 if (std::isinf(value))
105 return sign | (exponent_all << mantissa_bits);
110 std::frexp(value, &exponent);
111 const int unbiased = exponent - 1;
112 const int min_exponent = 1 - bias;
114 if (unbiased < min_exponent) {
115 const auto steps =
static_cast<uint32_t
>(std::nearbyint(std::ldexp(value, mantissa_bits - min_exponent)));
119 auto steps =
static_cast<uint32_t
>(std::nearbyint(std::ldexp(value, mantissa_bits - unbiased)));
120 int biased = unbiased + bias;
121 if (steps == (2U << mantissa_bits)) {
122 steps = 1U << mantissa_bits;
125 if (std::cmp_greater_equal(biased, exponent_all))
126 return sign | (exponent_all << mantissa_bits);
128 return sign | (
static_cast<uint32_t
>(biased) << mantissa_bits) | (steps - (1U << mantissa_bits));