hash-consing bignums and eq==eql

[Stefan Monnier]

> The whole purpose of hash-consing (for me) is to avoid turning EQ into
> something like:
>
>     if (BIGNUMP (x))
>         return slow_eq (x, y);
>     else
>         return x == y;

BTW, hash-consing bignums would have the following advantages:
- EQ is just as fast as before.
- EQ is equivalent to EQL for all integers.
- While bignum operations would be somewhat slower (30-40% according to
  a message I can't find any more), they'd still be faster than what
  we had before (i.e. which varies between "signals an error" and "uses
  a list of cons cells").

Admittedly, if we used a dedicated tag for bignums, eql could turn into

    BIGNUM_OR_FLOAT_P (x) ? slow_eql (x, y) : (x == y);

where BIGNUM_OR_FLOAT_P can be just as efficient as FLOATP, so it
would be cheap enough (IMO) to make `eq` an alias for `eql`.



        Stefan