Re: doco on bitwise logicals

[Kevin Ryde]

Rob Browning <address@hidden> writes:
>
> Two things that I thought of were wondering if we could think of
> something other than "highest FOO bit", that might be clearer.  (Would
> "most significant FOO bit" be appropriate or more confusing?)

Yes, most significant would be good.

> and wondering if you might want to include some negative n examples
> in the integer-length verbage and example set.

Yep, new text:

 - Scheme Procedure: integer-length n
 - C Function: scm_integer_length (n)
     Return the number of bits necessary to represent N.

     For positive N this is how many bits to the most significant one
     bit.  For negative N it's how many bits to the most significant
     zero bit in twos complement form.

          (integer-length #b10101010) => 8
          (integer-length #b1111)     => 4
          (integer-length 0)          => 0
          (integer-length -1)         => 0
          (integer-length -256)       => 8
          (integer-length -257)       => 9