about summary refs log tree commit diff
diff options
context:
space:
mode:
authorUlrich Drepper <drepper@redhat.com>2000-05-28 16:31:09 +0000
committerUlrich Drepper <drepper@redhat.com>2000-05-28 16:31:09 +0000
commite6e813911c66af8e91e6fae70a8fcee84c03015c (patch)
tree456246cf653318247ff9d46b409b6d0d027eed9a
parentf0f8ed4e3fd994a4c62117aadee96ec4993ca1b3 (diff)
downloadglibc-e6e813911c66af8e91e6fae70a8fcee84c03015c.tar.gz
glibc-e6e813911c66af8e91e6fae70a8fcee84c03015c.tar.xz
glibc-e6e813911c66af8e91e6fae70a8fcee84c03015c.zip
Update.
2000-05-28  Ulrich Drepper  <drepper@redhat.com>

	* manual/arith.texi (Rounding Functions): Fix documentation of trunc.
	Patch by Steven G. Johnson <stevenj@gil-galad.mit.edu>.
-rw-r--r--ChangeLog5
-rw-r--r--manual/arith.texi14
2 files changed, 13 insertions, 6 deletions
diff --git a/ChangeLog b/ChangeLog
index e354f02aaa..b6446b41a5 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,8 @@
+2000-05-28  Ulrich Drepper  <drepper@redhat.com>
+
+	* manual/arith.texi (Rounding Functions): Fix documentation of trunc.
+	Patch by Steven G. Johnson <stevenj@gil-galad.mit.edu>.
+
 2000-05-27  Andreas Jaeger  <aj@suse.de>
 
 	* sysdeps/unix/sysv/linux/i386/pread.c: Removed, we can use the
diff --git a/manual/arith.texi b/manual/arith.texi
index 511c7ce37f..2112ef2fce 100644
--- a/manual/arith.texi
+++ b/manual/arith.texi
@@ -29,8 +29,8 @@ These functions are declared in the header files @file{math.h} and
 
 The C language defines several integer data types: integer, short integer,
 long integer, and character, all in both signed and unsigned varieties.
-The GNU C compiler extends the language to contain long long integers 
-as well.  
+The GNU C compiler extends the language to contain long long integers
+as well.
 @cindex signedness
 
 The C integer types were intended to allow code to be portable among
@@ -79,7 +79,7 @@ structure with @emph{at least} N bits, use one of these:
 @item uint64_least_t
 @end itemize
 
-If you don't need a specific storage size, but want the data structure 
+If you don't need a specific storage size, but want the data structure
 that allows the fastest access while having at least N bits (and
 among data structures with the same access speed, the smallest one), use
 one of these:
@@ -95,7 +95,7 @@ one of these:
 @item uint64_fast_t
 @end itemize
 
-If you want an integer with the widest range possible on the platform on 
+If you want an integer with the widest range possible on the platform on
 which it is being used, use one of the following.  If you use these,
 you should write code that takes into account the variable size and range
 of the integer.
@@ -1398,7 +1398,9 @@ integer, returning that value as a @code{double}.  Thus, @code{floor
 @comment math.h
 @comment ISO
 @deftypefunx {long double} truncl (long double @var{x})
-@code{trunc} is another name for @code{floor}
+The @code{trunc} functions round @var{x} towards zero to the nearest
+integer (returned in floating-point format).  Thus, @code{trunc (1.5)}
+is @code{1.0} and @code{trunc (-1.5)} is @code{-1.0}.
 @end deftypefun
 
 @comment math.h
@@ -2131,7 +2133,7 @@ returned on overflow is @code{ULONG_MAX} (@pxref{Range of Type}).
 If @var{string} depicts a negative number, @code{strtoul} acts the same
 as @var{strtol} but casts the result to an unsigned integer.  That means
 for example that @code{strtoul} on @code{"-1"} returns @code{ULONG_MAX}
-and an input more negative than @code{LONG_MIN} returns 
+and an input more negative than @code{LONG_MIN} returns
 (@code{ULONG_MAX} + 1) / 2.
 
 @code{strtoul} sets @var{errno} to @code{EINVAL} if @var{base} is out of