Sync up with r21-4-15.

[chise/xemacs-chise.git.1] / man / lispref / text.texi

diff --git a/man/lispref/text.texi b/man/lispref/text.texi
index b4ec428..1d8b9b1 100644 (file)
--- a/man/lispref/text.texi
+++ b/man/lispref/text.texi
@@ -476,10 +476,11 @@ This command deletes the text in @var{buffer} in the region defined by
 argument @var{buffer} is @code{nil}, the current buffer is assumed.
 @end deffn
 
-@deffn Command delete-char count &optional killp
+@deffn Command delete-char &optional count killp
 This command deletes @var{count} characters directly after point, or
-before point if @var{count} is negative.  If @var{killp} is
-non-@code{nil}, then it saves the deleted characters in the kill ring.
+before point if @var{count} is negative.  @var{count} defaults to @code{1}.
+If @var{killp} is non-@code{nil}, then it saves the deleted characters
+in the kill ring.
 
 In an interactive call, @var{count} is the numeric prefix argument, and
 @var{killp} is the unprocessed prefix argument.  Therefore, if a prefix
@@ -490,11 +491,12 @@ the kill ring.
 The value returned is always @code{nil}.
 @end deffn
 
-@deffn Command delete-backward-char count &optional killp
+@deffn Command delete-backward-char &optional count killp
 @cindex delete previous char
 This command deletes @var{count} characters directly before point, or
-after point if @var{count} is negative.  If @var{killp} is
-non-@code{nil}, then it saves the deleted characters in the kill ring.
+after point if @var{count} is negative.  @var{count} defaults to 1.
+If @var{killp} is non-@code{nil}, then it saves the deleted characters
+in the kill ring.
 
 In an interactive call, @var{count} is the numeric prefix argument, and
 @var{killp} is the unprocessed prefix argument.  Therefore, if a prefix
@@ -2759,7 +2761,7 @@ implemented in C, with an appropriate interface for Lisp programmers.
 Examples of algorithms thus provided are MD5 and base64 support.
 
 MD5 is an algorithm for calculating message digests, as described in
-rfc1321.  Given a message of arbitrary length, MD5 produces an 128-bit
+rfc1321.  Given a message of arbitrary length, MD5 produces a 128-bit
 ``fingerprint'' (``message digest'') corresponding to that message.  It
 is considered computationally infeasible to produce two messages having
 the same MD5 digest, or to produce a message having a prespecified