summaryrefslogtreecommitdiff
path: root/lispref
diff options
context:
space:
mode:
authorRichard M. Stallman <rms@gnu.org>1995-01-27 01:41:28 +0000
committerRichard M. Stallman <rms@gnu.org>1995-01-27 01:41:28 +0000
commitd18a1bbd02a279d1d7ea33c7d1a01f12871ac75f (patch)
tree56c9ee8c2965a19e6c7b9b9cdf9257c4d77ccea9 /lispref
parent92d3bf5f484bc453815e94d571883ce0825c3530 (diff)
downloademacs-d18a1bbd02a279d1d7ea33c7d1a01f12871ac75f.tar.gz
Fix integer width changes.
Diffstat (limited to 'lispref')
-rw-r--r--lispref/numbers.texi14
1 files changed, 7 insertions, 7 deletions
diff --git a/lispref/numbers.texi b/lispref/numbers.texi
index dec1af1c93f..6bcd9b1c6cc 100644
--- a/lispref/numbers.texi
+++ b/lispref/numbers.texi
@@ -39,22 +39,22 @@ where Emacs does not support them.
@section Integer Basics
The range of values for an integer depends on the machine. The
-range is @minus{}8388608 to 8388607 (28 bits; i.e.,
+minimum range is @minus{}134217728 to 134217727 (28 bits; i.e.,
@ifinfo
-2**27
@end ifinfo
@tex
-$-2^{27}$
+$-2^{27}$
@end tex
to
@ifinfo
-2**27 - 1)
+2**27 - 1),
@end ifinfo
@tex
-$2^{27}-1$)
+$2^{27}-1$),
@end tex
-on most machines, but some machines may have a wider range. Many
-examples in this chapter assume an integer has 28 bits.
+but some machines may provide a wider range. Many examples in this
+chapter assume an integer has 28 bits.
@cindex overflow
The Lisp reader reads an integer as a sequence of digits with optional
@@ -103,7 +103,7 @@ complement} notation.)
1111 1111 1111 1111 1111 1111 1011
@end example
- In this implementation, the largest 24-bit binary integer is the
+ In this implementation, the largest 28-bit binary integer is the
decimal integer 134,217,727. In binary, it looks like this:
@example