Re: [Scheme-reports] Bitwise operations on bytes

[Alan Watson <alan@x>]

> See <http://srfi.schemers.org/srfi-60/srfi-60.html>.  Bitwise
> operations on integers (both positive and negative) are well defined
> and implementable in pure R4RS using no more bits than the input
> numbers.

The implementation of SRFI-60 assumes two's complement binary representations:

  (define (lognot n) (- -1 n))

However, in this context, the basic point that you can implement a mapping from any finite domain in R4RS Scheme using a look-up table remains valid.

Regards,

Alan


_______________________________________________
Scheme-reports mailing list
Scheme-reports@x
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports