Details
Diff Detail
- Repository
- rG LLVM Github Monorepo
Event Timeline
libc/test/utils/FPUtil/x86_long_double_test.cpp | ||
---|---|---|
27 | You can test whether some combinations of bits are significant, instead of iterating over all integers from 0 to 1000000 (it is slow). |
libc/test/utils/FPUtil/x86_long_double_test.cpp | ||
---|---|---|
29 | There is some ASSERT_NE(a, b) macro which might be useful. It asserts directly the inequality. | |
53 | I would add one or two tests also for the false case - e.g.: bits.exponent = 1; // If exponent is non-zero and also not max, and the implicit bit is 0, // then the number is a NaN for all values of mantissa. bits.mantissa = i; long double nan = bits; ASSERT_EQ(isnan(nan), 0); ASSERT_FALSE(bits.isNaN()); } |
Sorry, I kept there the old comment.
libc/test/utils/FPUtil/x86_long_double_test.cpp | ||
---|---|---|
53 | Sorry, I left there an old comment from copy-pasting. There should be something like: |
You can test whether some combinations of bits are significant, instead of iterating over all integers from 0 to 1000000 (it is slow).