returning to cost of Integer
Bulat Ziganshin
bulat.ziganshin at gmail.com
Wed Aug 2 09:57:49 EDT 2006
Hello Simon,
Wednesday, August 2, 2006, 4:06:48 PM, you wrote:
>> Actually, you can keep it to one test for add/subtract if you
>> use a single word that is either a number or a pointer, the
>> pointer being tagged in lowest bit. Then you can add first
>> and check for tags after. Having tags is rare, so the machine
>> should be told so, if possible. This way you can keep the
>> overhead for bignums really low. But it requires very special
>> handling of bignums and I'm not sure it's worth it.
it's used in Ocaml, btw
--
Best regards,
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Glasgow-haskell-users
mailing list