[Gmp-commit] /home/hgfiles/gmp-4.3: Fix typos in documentation.

[mercurial at gmplib.org]

details:   /home/hgfiles/gmp-4.3/rev/aba92ed22197
changeset: 12554:aba92ed22197
user:      Marco Bodrato <bodrato at mail.dm.unipi.it>
date:      Tue Jan 25 18:35:02 2011 +0100
description:
Fix typos in documentation.

diffstat:

 doc/gmp.texi |  6 +++---
 1 files changed, 3 insertions(+), 3 deletions(-)

diffs (30 lines):

diff -r 1a2742d53add -r aba92ed22197 doc/gmp.texi
--- a/doc/gmp.texi	Thu Nov 11 14:09:58 2010 +0100
+++ b/doc/gmp.texi	Tue Jan 25 18:35:02 2011 +0100
@@ -15,7 +15,7 @@
 arithmetic library, version @value{VERSION}.
 
 Copyright 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc.
+2003, 2004, 2005, 2006, 2007, 2008, 2009, 2011 Free Software Foundation, Inc.
 
 Permission is granted to copy, distribute and/or modify this document under
 the terms of the GNU Free Documentation License, Version 1.3 or any later
@@ -4093,7 +4093,7 @@
 @code{mp_bits_per_limb}.
 
 @item
- at code{mpz_mul}, @code{mpz_mul_ui} and @code{mpz_mul_ui} need room for the sum
+ at code{mpz_mul}, @code{mpz_mul_ui} and @code{mpz_mul_si} need room for the sum
 of the number of bits in their operands, but each rounded up to a multiple of
 @code{mp_bits_per_limb}.
 
@@ -8423,7 +8423,7 @@
 resulting matrix is applied to the inputs using @code{mpn_mul_1} and
 @code{mpn_submul_1}. Each iteration usually reduces the inputs by almost one
 limb. In the rare case of a large quotient, no progress can be made by
-examining just the most significant two limbs, and the quotient is computing
+examining just the most significant two limbs, and the quotient is computed
 using plain division.
 
 The resulting algorithm is asymptotically @math{O(N^2)}, just as the Euclidean