Encode a double as a binary floating point pattern with the given field widths.
Rounds once, to nearest with ties to even, straight from the double, so a float widened to double is never rounded twice. Overflow becomes infinity and NaN becomes a quiet NaN.
95{
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;
99
100 if (std::isnan(value))
101 return sign | (exponent_all << mantissa_bits) | (1U << (mantissa_bits - 1));
102
103 value = std::fabs(value);
104 if (std::isinf(value))
105 return sign | (exponent_all << mantissa_bits);
106 if (value == 0.0)
107 return sign;
108
109 int exponent = 0;
110 std::frexp(value, &exponent);
111 const int unbiased = exponent - 1;
112 const int min_exponent = 1 - bias;
113
114 if (unbiased < min_exponent) {
115 const auto steps = static_cast<uint32_t>(std::nearbyint(std::ldexp(value, mantissa_bits - min_exponent)));
116 return sign | steps;
117 }
118
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;
123 ++biased;
124 }
125 if (std::cmp_greater_equal(biased, exponent_all))
126 return sign | (exponent_all << mantissa_bits);
127
128 return sign | (static_cast<uint32_t>(biased) << mantissa_bits) | (steps - (1U << mantissa_bits));
129}