using System.Numerics; using Shouldly; using Xunit; namespace Just.PreciseMath.Tests; public class DoubleDoubleArithmeticTests { [Fact] public void CancellationRetainsBothLowSumTerms() { double small = Math.ScaleB(1.0, -54); double tiny = Math.ScaleB(1.0, -108); DoubleDouble left = DoubleDouble.FromComponents(1.0, small); DoubleDouble right = DoubleDouble.FromComponents(-1.0, tiny); Check(left + right, small, tiny); Check(right + left, small, tiny); Check(left - (-right), small, tiny); Check(+left, 1.0, small); Check(-left, -1.0, -small); Check(left - left, 0.0, 0.0); } [Fact] public void ScalarOverloadsPreserveOperandOrderAndResiduals() { DoubleDouble value = DoubleDouble.FromComponents(2.0, Math.ScaleB(1.0, -80)); Check(3.0 - value, 1.0, -value.Low); Check(value - 3.0, -1.0, value.Low); Check(value + 3.0, 5.0, value.Low); Check(3.0 + value, 5.0, value.Low); Check(value * 2.0, 4.0, 2.0 * value.Low); Check(2.0 * value, 4.0, 2.0 * value.Low); Check(value / 2.0, 1.0, value.Low / 2.0); Check(6.0 / new DoubleDouble(2.0), 3.0, 0.0); } [Fact] public void ExpansionCancellationRetainsExactComponentsAcrossTheAdditionGuard() { // (2^e + 2^(e-54)) - (2^e - 2^(e-108)) is exactly the // normalized pair (2^(e-54), 2^(e-108)). The smallest residual // is epsilon; the largest case exercises the boundary fallback. foreach (int exponent in new[] { -966, -450, 0, 450, 1020, 1021 }) { foreach (double sign in new[] { -1.0, 1.0 }) { double high = sign * Math.ScaleB(1.0, exponent); double small = sign * Math.ScaleB(1.0, exponent - 54); double tiny = sign * Math.ScaleB(1.0, exponent - 108); DoubleDouble left = DoubleDouble.FromComponents(high, small); DoubleDouble right = DoubleDouble.FromComponents(high, -tiny); CheckBoundary(left - right, small, tiny); CheckBoundary(right - left, -small, -tiny); CheckBoundary(left + (-right), small, tiny); CheckBoundary((-right) + left, small, tiny); CheckBoundary(left - left, 0.0, 0.0); } } } [Fact] public void ExpansionSubtractionHandlesSpecialValuesAlongsideNonzeroResiduals() { foreach (double sign in new[] { -1.0, 1.0 }) { DoubleDouble value = DoubleDouble.FromComponents(sign, sign * double.Epsilon); foreach (double special in new[] { 0.0, -0.0, double.NegativeInfinity, double.PositiveInfinity, double.NaN }) { DoubleDouble other = new(special); if (special == 0.0) { CheckBoundary(value - other, value.High, value.Low); CheckBoundary(other - value, -value.High, -value.Low); } else { CheckBits(value - other, sign - special); CheckBits(other - value, special - sign); } } } } [Fact] public void ScalarLeftSubtractionAppliesTheRequestedOperandOrder() { // Review-1 §1: the former operator -(double, DoubleDouble) returned arg - lvalue, // so 3.0 - DD(2.0) produced -1 instead of 1. Check(3.0 - new DoubleDouble(2.0), 1.0, 0.0); Check(new DoubleDouble(2.0) - 3.0, -1.0, 0.0); Check(3.0 - DoubleDouble.FromComponents(2.0, Math.ScaleB(1.0, -80)), 1.0, -Math.ScaleB(1.0, -80)); Check(DoubleDouble.FromComponents(2.0, Math.ScaleB(1.0, -80)) - 3.0, -1.0, Math.ScaleB(1.0, -80)); } [Fact] public void DivisionByAValueCarriedOnlyInTheLowComponentIsFinite() { // Review-2 §5: with high == 0 and low != 0 the former division returned // Infinity because it divided by the zero high component. The public factory // now folds such a pair into its high component, so the quotient is finite. DoubleDouble denominator = DoubleDouble.FromComponents(0.0, 1.0); Check(denominator, 1.0, 0.0); Check(new DoubleDouble(4.0) / denominator, 4.0, 0.0); Check(4.0 / denominator, 4.0, 0.0); Check(new DoubleDouble(4.0) / DoubleDouble.FromComponents(0.0, -2.0), -2.0, 0.0); } [Fact] public void ScalarCancellationPreservesTheRemainingExpansionInBothOrders() { // At a normal binade boundary, 2^e - BitDecrement(2^e) = 2^(e-53). // The low input becomes the representable residual of that exact difference. foreach (int exponent in new[] { -967, -900, -450, 0, 450, 969, 1020, 1023 }) { foreach (double sign in new[] { -1.0, 1.0 }) { double high = Math.ScaleB(1.0, exponent); double low = sign * Math.ScaleB(1.0, exponent - 107); double scalar = sign * Math.BitDecrement(high); double difference = sign * Math.ScaleB(1.0, exponent - 53); DoubleDouble value = DoubleDouble.FromComponents(sign * high, low); Check(value - scalar, difference, low); Check(scalar - value, -difference, -low); Check(value + (-scalar), difference, low); Check((-scalar) + value, difference, low); } } } [Fact] public void MixedSpecialValuesIgnoreFiniteResidualsButPreserveResultSigns() { foreach (double sign in new[] { -1.0, 1.0 }) { DoubleDouble value = DoubleDouble.FromComponents(sign, sign * Math.ScaleB(1.0, -54)); foreach (double scalar in new[] { double.NaN, double.NegativeInfinity, double.PositiveInfinity }) { CheckBits(value + scalar, sign + scalar); CheckBits(scalar + value, scalar + sign); CheckBits(value - scalar, sign - scalar); CheckBits(scalar - value, scalar - sign); CheckBits(value * scalar, sign * scalar); CheckBits(scalar * value, scalar * sign); CheckBits(value / scalar, sign / scalar); CheckBits(scalar / value, scalar / sign); } foreach (double zero in new[] { 0.0, -0.0 }) { CheckBits(value * zero, sign * zero); CheckBits(zero * value, zero * sign); CheckBits(value / zero, sign / zero); CheckBits(zero / value, zero / sign); Check(value + zero, value.High, value.Low); Check(zero + value, value.High, value.Low); Check(value - zero, value.High, value.Low); Check(zero - value, -value.High, -value.Low); } } } [Fact] public void ProductAndQuotientRetainExtraPrecision() { // (1 + 2^-52)(1 - 2^-52) = 1 - 2^-104 exactly. Check(new DoubleDouble(1.0 + Math.ScaleB(1.0, -52)) * new DoubleDouble(1.0 - Math.ScaleB(1.0, -52)), 1.0, -Math.ScaleB(1.0, -104)); // Binary expansion of 1/3, rounding high then residual ties-to-even. Check(DoubleDouble.One / 3.0, 0.3333333333333333, 1.850371707708594e-17); } [Fact] public void ScalarProductNormalizesACorrectionBeyondTheHighMidpoint() { // (1 + 2^-53)(1 + 2^-52) = 1 + 3*2^-53 + 2^-105, exactly. // The rounded high advances twice above 1; its residual is still exact. DoubleDouble value = DoubleDouble.FromComponents(1.0, Math.ScaleB(1.0, -53)); double scalar = Math.BitIncrement(1.0); double high = 1.0 + Math.ScaleB(1.0, -51); double low = -Math.ScaleB(1.0, -53) + Math.ScaleB(1.0, -105); Check(value * scalar, high, low); Check(scalar * value, high, low); Check(value * (-scalar), -high, -low); Check((-scalar) * value, -high, -low); CheckBoundary(value * new DoubleDouble(scalar), high, low); CheckBoundary(new DoubleDouble(scalar) * value, high, low); CheckBoundary(value * new DoubleDouble(-scalar), -high, -low); CheckBoundary(new DoubleDouble(-scalar) * value, -high, -low); } [Fact] public void ExpansionProductRetainsTheLowLowTermAtFastRangeEndpoints() { // (1 + 2^-53)(1 - 2^-54) = 1 + 2^-54 - 2^-107 exactly. // Its residual is BitDecrement(2^-54); omitting low*low loses that bit. // Power-of-two scaling keeps both expected components representable, // including exponent sums at each inclusive fast-path endpoint. foreach (int leftExponent in new[] { -450, 0, 450 }) { foreach (int rightExponent in new[] { -450, 0, 450 }) { foreach (double leftSign in new[] { -1.0, 1.0 }) { foreach (double rightSign in new[] { -1.0, 1.0 }) { DoubleDouble left = DoubleDouble.FromComponents(leftSign * Math.ScaleB(1.0, leftExponent), leftSign * Math.ScaleB(1.0, leftExponent - 53)); DoubleDouble right = DoubleDouble.FromComponents(rightSign * Math.ScaleB(1.0, rightExponent), -rightSign * Math.ScaleB(1.0, rightExponent - 54)); int exponent = leftExponent + rightExponent; double sign = leftSign * rightSign; double high = sign * Math.ScaleB(1.0, exponent); double low = sign * Math.ScaleB(Math.BitDecrement(Math.ScaleB(1.0, -54)), exponent); CheckBoundary(left * right, high, low); CheckBoundary(right * left, high, low); } } } } } [Fact] public void ScalarDivisionRetainsNumeratorAndDenominatorResiduals() { double low = Math.ScaleB(1.0, -80); DoubleDouble value = DoubleDouble.FromComponents(1.0, low); Check(value / 1.0, 1.0, low); Check(value / (-1.0), -1.0, -low); // Compare the reciprocal to its exact rational, not another DD operator. BigInteger numerator = BigInteger.One << 2148; AssertRelative(1.0 / value, numerator, Units(value)); AssertRelative(-1.0 / value, -numerator, Units(value)); } [Fact] public void DivisionRetainsSubnormalCorrectionsWithOrdinaryHighComponents() { // Dividing (1 + epsilon) by +/-1 is exact. The outer division is // ordinary, but its second residual product can use the boundary path. foreach (double sign in new[] { -1.0, 1.0 }) { DoubleDouble numerator = DoubleDouble.FromComponents(sign, sign * double.Epsilon); foreach (double denominator in new[] { -1.0, 1.0 }) { double high = sign / denominator; double low = high * double.Epsilon; CheckBoundary(numerator / new DoubleDouble(denominator), high, low); CheckBoundary(numerator / denominator, high, low); } } } [Fact] public void SubnormalProductsWithLargeNormalsRetainExactResultsInBothOrders() { // 2^-1074 * 2^1023 = 2^-51 exactly, despite the subnormal input. foreach (double leftSign in new[] { -1.0, 1.0 }) { foreach (double rightSign in new[] { -1.0, 1.0 }) { double tiny = leftSign * double.Epsilon; double large = rightSign * Math.ScaleB(1.0, 1023); double expected = (leftSign * rightSign) * Math.ScaleB(1.0, -51); DoubleDouble left = new(tiny); DoubleDouble right = new(large); CheckBoundary(left * right, expected, 0.0); CheckBoundary(right * left, expected, 0.0); CheckBoundary(left * large, expected, 0.0); CheckBoundary(large * left, expected, 0.0); CheckBoundary(tiny * right, expected, 0.0); CheckBoundary(right * tiny, expected, 0.0); } } } [Fact] public void ExtremeFiniteOperationsDoNotOverflowIntermediates() { DoubleDouble maximum = new(double.MaxValue); DoubleDouble third = maximum / 3.0; DoubleDouble thirdPair = maximum / new DoubleDouble(3.0); DoubleDouble thirdScalar = double.MaxValue / new DoubleDouble(3.0); AssertRelative(third, Units(maximum), 3); thirdPair.ShouldBe(third); thirdScalar.ShouldBe(third); Check(new DoubleDouble(double.Epsilon) / new DoubleDouble(double.Epsilon), 1.0, 0.0); Check(new DoubleDouble(double.Epsilon) * new DoubleDouble(Math.ScaleB(1.0, 1023)), Math.ScaleB(1.0, -51), 0.0); Check(new DoubleDouble(Math.ScaleB(1.0, -1022)) / 2.0, Math.ScaleB(1.0, -1023), 0.0); Check(maximum * 2.0, double.PositiveInfinity, 0.0); Check(maximum + maximum, double.PositiveInfinity, 0.0); // High-only addition overflows, but the complete sum is exactly MaxValue. DoubleDouble below = DoubleDouble.FromComponents(double.MaxValue, -Math.ScaleB(1.0, 969)); Check(below + Math.ScaleB(1.0, 969), double.MaxValue, 0.0); } [Fact] public void SubnormalHighProductsRetainANormalPartnersResidual() { // (2^-1074, 0) * (2^1023, 2^969) = (2^-51, 2^-105), exactly. // The high product is ordinary despite the subnormal input high. foreach (double leftSign in new[] { -1.0, 1.0 }) { foreach (double rightSign in new[] { -1.0, 1.0 }) { double scalar = leftSign * double.Epsilon; DoubleDouble tiny = new(scalar); DoubleDouble large = DoubleDouble.FromComponents(rightSign * Math.ScaleB(1.0, 1023), rightSign * Math.ScaleB(1.0, 969)); double high = (leftSign * rightSign) * Math.ScaleB(1.0, -51); double low = (leftSign * rightSign) * Math.ScaleB(1.0, -105); CheckBoundary(tiny * large, high, low); CheckBoundary(large * tiny, high, low); CheckBoundary(scalar * large, high, low); CheckBoundary(large * scalar, high, low); } } } [Theory] [InlineData(1.0)] [InlineData(-1.0)] public void ExactOverflowMidpointStillOverflows(double sign) { DoubleDouble maximum = new(sign * double.MaxValue); double halfUlp = sign * Math.ScaleB(1.0, 970); Check(maximum + halfUlp, sign * double.PositiveInfinity, 0.0); Check(maximum - (-halfUlp), sign * double.PositiveInfinity, 0.0); Check(DoubleDouble.FromComponents(sign * double.MaxValue, halfUlp), sign * double.PositiveInfinity, 0.0); } [Theory] [InlineData(-1)] [InlineData(0)] [InlineData(1)] public void ProductAndQuotientCrossTheExactOverflowMidpoint(int side) { // M = 2^1024 - 2^970. M/2 is the normalized pair (2^1023, -2^969). // Its adjacent normalized pairs use different highs across this tie: // below uses (MaxValue/2, BitDecrement(2^969)), above increments -2^969. // Doubling gives M +/- 2^917; below has residual BitDecrement(2^970). // The tie rounds to the even significand at 2^1024, hence infinity. double high = side < 0 ? Math.ScaleB(double.MaxValue, -1) : Math.ScaleB(1.0, 1023); double low = side switch { -1 => Math.BitDecrement(Math.ScaleB(1.0, 969)), 1 => Math.BitIncrement(-Math.ScaleB(1.0, 969)), _ => -Math.ScaleB(1.0, 969) }; BigInteger midpointUnits = Units(double.MaxValue) + Units(Math.ScaleB(1.0, 970)); foreach (double sign in new[] { -1.0, 1.0 }) { DoubleDouble value = DoubleDouble.FromComponents(sign * high, sign * low); (BigInteger.Abs(Units(value)) * 2).ShouldBe(midpointUnits + (side * Units(Math.ScaleB(1.0, 917)))); double expectedHigh = sign * (side < 0 ? double.MaxValue : double.PositiveInfinity); double expectedLow = side < 0 ? sign * Math.BitDecrement(Math.ScaleB(1.0, 970)) : 0.0; CheckBoundary(value * new DoubleDouble(2.0), expectedHigh, expectedLow); CheckBoundary(new DoubleDouble(2.0) * value, expectedHigh, expectedLow); CheckBoundary(value * 2.0, expectedHigh, expectedLow); CheckBoundary(2.0 * value, expectedHigh, expectedLow); CheckBoundary(value / new DoubleDouble(0.5), expectedHigh, expectedLow); CheckBoundary(value / 0.5, expectedHigh, expectedLow); } } [Theory] [InlineData(false)] [InlineData(true)] public void ScalarLeftDivisionStraddlesTheOverflowMidpoint(bool below) { // An exact M = (2^54 - 1)*2^970 quotient is impossible with a finite // binary64 numerator and dyadic denominator: its odd numerator would // need all 54 bits. Instead use adjacent low components bracketing // 2^1023/M = 1/2 + 2^-55 + 2^-109 + ... . double low = Math.ScaleB(1.0, -55); DoubleDouble denominator = DoubleDouble.FromComponents(0.5, below ? Math.BitIncrement(low) : low); BigInteger midpointUnits = Units(double.MaxValue) + Units(Math.ScaleB(1.0, 970)); BigInteger numeratorUnits = Units(Math.ScaleB(1.0, 1023)); ((numeratorUnits << 1074) < midpointUnits * Units(denominator)).ShouldBe(below); // Exact rational residual rounding gives BitDecrement(2^970) below M. foreach (double sign in new[] { -1.0, 1.0 }) { double numerator = sign * Math.ScaleB(1.0, 1023); double high = sign * (below ? double.MaxValue : double.PositiveInfinity); double residual = below ? sign * Math.BitDecrement(Math.ScaleB(1.0, 970)) : 0.0; CheckBoundary(numerator / denominator, high, residual); CheckBoundary(new DoubleDouble(numerator) / denominator, high, residual); CheckBoundary((-numerator) / (-denominator), high, residual); } } [Theory] [InlineData(-1)] [InlineData(0)] [InlineData(1)] public void ProductAndQuotientRoundUnderflowTiesToSignedZero(int side) { // (2^-1022 + side*2^-1074)*2^-53 = epsilon/2 + side*2^-1127. // The low component is stepped by its smallest possible increment. // Ties select even zero, retaining the exact nonzero result's sign. foreach (double sign in new[] { -1.0, 1.0 }) { DoubleDouble value = DoubleDouble.FromComponents(sign * Math.ScaleB(1.0, -1022), sign * side * double.Epsilon); double multiplier = Math.ScaleB(1.0, -53); double divisor = Math.ScaleB(1.0, 53); double expected = Math.CopySign(side > 0 ? double.Epsilon : 0.0, sign); CheckBits(value * new DoubleDouble(multiplier), expected); CheckBits(new DoubleDouble(multiplier) * value, expected); CheckBits(value * multiplier, expected); CheckBits(multiplier * value, expected); CheckBits(value / new DoubleDouble(divisor), expected); CheckBits(value / divisor, expected); // epsilon/(2 - side*epsilon) brackets the same tie; the nonzero // denominator residual is essential despite being invisible in double. DoubleDouble denominator = DoubleDouble.FromComponents(2.0, -side * double.Epsilon); CheckBits((sign * double.Epsilon) / denominator, expected); CheckBits(new DoubleDouble(sign * double.Epsilon) / denominator, expected); CheckBits((-sign * double.Epsilon) / (-denominator), expected); } } [Theory] [InlineData(0)] [InlineData(1)] [InlineData(2)] [InlineData(3)] [InlineData(4)] [InlineData(5)] [InlineData(6)] [InlineData(7)] [InlineData(8)] [InlineData(9)] [InlineData(10)] [InlineData(11)] public void WarmedFiniteArithmeticAllocatesSubstantiallyLessThanBoundaryFallback(int operation) { DoubleDouble ordinary = DoubleDouble.FromComponents(1.25, Math.ScaleB(1.0, -70)); DoubleDouble boundary = DoubleDouble.FromComponents(Math.ScaleB(1.0, 1022), Math.ScaleB(1.0, 968)); DoubleDouble right = DoubleDouble.FromComponents(1.5, Math.ScaleB(1.0, -55)); // Synchronous per-thread counters exclude other parallel tests. Warm both // branches, keep setup/assertions outside measurement, and consume results. _ = MeasureArithmeticAllocations(operation, ordinary, right, 128, out _); _ = MeasureArithmeticAllocations(operation, boundary, right, 128, out _); long ordinaryBytes = long.MaxValue; long boundaryBytes = long.MaxValue; for (int sample = 0; sample < 3; ++sample) { long finite = MeasureArithmeticAllocations(operation, ordinary, right, 256, out double finiteChecksum); long fallback = MeasureArithmeticAllocations(operation, boundary, right, 256, out double fallbackChecksum); double.IsFinite(finiteChecksum).ShouldBeTrue(); double.IsFinite(fallbackChecksum).ShouldBeTrue(); ordinaryBytes = Math.Min(ordinaryBytes, finite); boundaryBytes = Math.Min(boundaryBytes, fallback); } // A coarse relative distinction, not a runtime-dependent BigInteger byte // count or timing benchmark. Minima discard incidental warm-up allocation. boundaryBytes.ShouldBeGreaterThan(0L); ordinaryBytes.ShouldBeLessThan(boundaryBytes / 16); } private static long MeasureArithmeticAllocations(int operation, DoubleDouble left, DoubleDouble right, int iterations, out double checksum) { checksum = 0.0; long before = GC.GetAllocatedBytesForCurrentThread(); for (int i = 0; i < iterations; ++i) { DoubleDouble result = operation switch { 0 => left + right, 1 => left - right, 2 => left * right, 3 => left / right, 4 => left + right.High, 5 => right.High + left, 6 => left - right.High, 7 => right.High - left, 8 => left * right.High, 9 => right.High * left, 10 => left / right.High, 11 => right.High / left, _ => throw new ArgumentOutOfRangeException(nameof(operation)) }; // Scale before accumulation so boundary-sized results cannot overflow. checksum += Math.ScaleB(result.High, -1023) + Math.ScaleB(result.Low, -1023); } return GC.GetAllocatedBytesForCurrentThread() - before; } private static void CheckBoundary(DoubleDouble value, double high, double low) { BitConverter.DoubleToInt64Bits(value.High).ShouldBe(BitConverter.DoubleToInt64Bits(high)); BitConverter.DoubleToInt64Bits(value.Low).ShouldBe(BitConverter.DoubleToInt64Bits(low)); } [Fact] public void SpecialValueMatrixMatchesBinary64IncludingZeroSigns() { double[] values = [0.0, -0.0, 1.0, -1.0, double.PositiveInfinity, double.NegativeInfinity, double.NaN]; foreach (double left in values) { foreach (double right in values) { DoubleDouble a = new(left); DoubleDouble b = new(right); CheckBits(a + b, left + right); CheckBits(a - b, left - right); CheckBits(a * b, left * right); CheckBits(a / b, left / right); CheckBits(a + right, left + right); CheckBits(left + b, left + right); CheckBits(a - right, left - right); CheckBits(left - b, left - right); CheckBits(a * right, left * right); CheckBits(left * b, left * right); CheckBits(a / right, left / right); CheckBits(left / b, left / right); } } } [Fact] public void DeterministicArithmeticMeetsConservativeErrorBound() { Random random = new(1729); for (int i = 0; i < 250; ++i) { DoubleDouble a = DoubleDouble.FromComponents(Math.ScaleB((random.NextDouble() * 2.0) - 1.0, random.Next(-400, 401)), Math.ScaleB(random.NextDouble(), random.Next(-500, -450))); DoubleDouble b = DoubleDouble.FromComponents(Math.ScaleB((random.NextDouble() * 2.0) - 1.0, random.Next(-400, 401)), Math.ScaleB(random.NextDouble(), random.Next(-500, -450))); BigInteger x = Units(a); BigInteger y = Units(b); AssertRelative(a + b, x + y, BigInteger.One); AssertRelative(a - b, x - y, BigInteger.One); AssertRelative(a * b, x * y, BigInteger.One << 1074); AssertRelative(a / b, x << 1074, y); } } private static void Check(DoubleDouble value, double high, double low) { value.High.ShouldBe(high); value.Low.ShouldBe(low); } private static void CheckBits(DoubleDouble value, double expected) { if (double.IsNaN(expected)) { DoubleDouble.IsNaN(value).ShouldBeTrue(); } else { BitConverter.DoubleToInt64Bits(value.High).ShouldBe(BitConverter.DoubleToInt64Bits(expected)); } BitConverter.DoubleToInt64Bits(value.Low).ShouldBe(0L); } // Independent oracle: every finite binary64 is an integer multiple of 2^-1074. private static BigInteger Units(DoubleDouble value) { return Units(value.High) + Units(value.Low); } private static BigInteger Units(double value) { long bits = BitConverter.DoubleToInt64Bits(value); int exponent = (int)((bits >> 52) & 0x7ff); BigInteger significand = bits & 0xfffffffffffffL; if (exponent != 0) { significand += BigInteger.One << 52; significand <<= exponent - 1; } return bits < 0 ? -significand : significand; } private static void AssertRelative(DoubleDouble actual, BigInteger numerator, BigInteger denominator) { DoubleDouble.IsFinite(actual).ShouldBeTrue(); BigInteger error = BigInteger.Abs((Units(actual) * denominator) - numerator); // <= 2^-100 relative error plus one minimum subnormal (rounding floor). (error <= (BigInteger.Abs(numerator) >> 100) + BigInteger.Abs(denominator)).ShouldBeTrue(); if (actual.High != 0.0) { (Math.Abs(actual.Low) <= Math.ScaleB(1.0, Math.ILogB(actual.High) - 53)).ShouldBeTrue(); } } }