Re: asserting the equality of double values

[Kevin Ryde]

"Nelson H. F. Beebe" <address@hidden> writes:
>
> Subtracting one produces a significant of all
> 1-bits:  2**53 - 1 = +0x1.fffffffffffffp+52,

Yes.

> and that is the
> next-to-largest exactly representable whole number in this arithmetic
> system.  Its floor is identical, so "x == floor()" is true.

Well, it's supposed to be.  I think I put in that test.  If it's failing
on alpha someone will want to dig around and see how it went wrong.  It
ought to be pretty simple, all the values are integers, so no rounding
at all (and it hasn't even reached the actual scm_c_round).