[plt-scheme] Fixed size integer arithmetic

From: Noel Welsh (noelwelsh at yahoo.com)
Date: Wed Jul 7 11:32:25 EDT 2004

Despite the wishful thinking of the R5RS committee there
are actual instances when computing with fixed size
integers, normally 32-bit, is useful.  Computing hash codes
is one pertinent example.  Does anyone have suggestions for
doing this in PLT Scheme?  My current ideas are:

  - implement fixed size arithmetic using the provided bit
manipulation operators
  - write the code in C

Neither seems very pleasant.  Any alternatives?


Email: noelwelsh <at> yahoo <dot> com
Jabber: noelw <at> jabber <dot> org

Do you Yahoo!?
Yahoo! Mail - Helps protect you from nasty viruses.

Posted on the users mailing list.