suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

doc corrections

Browse Source 
svn: r18224
This commit is contained in:
Matthew Flatt 2010-02-20 14:58:10 +00:00
parent 457a2da675
commit eb46f95246
2 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
collects/scribblings/reference/numbers.scrbl
View File

@ -596,7 +596,7 @@ but faster and in constant time when @scheme[n] is positive.
[start exact-nonnegative-integer?] [start exact-nonnegative-integer?]
[end (and/c exact-nonnegative-integer? [end (and/c exact-nonnegative-integer?
(start . <= . end))]) (start . <= . end))])
boolean?]{ exact-integer?]{
Returns Returns

5
collects/scribblings/reference/unsafe.scrbl
View File

@ -70,8 +70,9 @@ the result is always a @tech{fixnum}. The @scheme[unsafe-fxlshift] and
@scheme[unsafe-fxlshift] is a positive (i.e., left) shift, and @scheme[unsafe-fxlshift] is a positive (i.e., left) shift, and
@scheme[unsafe-fxrshift] is a negative (i.e., right) shift, where the @scheme[unsafe-fxrshift] is a negative (i.e., right) shift, where the
number of bits to shift must be less than the number of bits used to number of bits to shift must be less than the number of bits used to
represent a @tech{fixnum}, and the result is effectively represent a @tech{fixnum}. In the case of @scheme[unsafe-fxlshift],
@scheme[bitwise-and]ed with the most negative @tech{fixnum}.} bits in the result beyond the the number of bits used to represent a
@tech{fixnum} are effectively replaced with a copy of the high bit.}
@deftogether[( @deftogether[(