(cookie, cookie-insert, shuffle-vector): Doc fixes.

diff --git a/lisp/ChangeLog b/lisp/ChangeLog
index 497fe9b663a01b11daa66c5b8cd5b0a96159d831..3887fb1968bd7a975f94452571f82d873ce88232 100644 (file)
--- a/lisp/ChangeLog
+++ b/lisp/ChangeLog
@@ -1,5 +1,8 @@
 2001-11-29  Pavel Jan\e,Bm\e(Bk  <Pavel@Janik.cz>
 
+       * play/cookie1.el (cookie, cookie-insert, shuffle-vector): Doc
+       fixes.
+
        * play/studly.el (studlify-word, studlify-region)
        (studlify-buffer): Fix doc-string.
        (studlify-buffer): Add autoload cookie.

diff --git a/lisp/play/cookie1.el b/lisp/play/cookie1.el
index 2c3ff16fe13a513349b956b318d926c93d26d917..cd3c715bc9934d2209c0594ac66fb8c9873ac6d7 100644 (file)
--- a/lisp/play/cookie1.el
+++ b/lisp/play/cookie1.el
@@ -69,16 +69,18 @@
 
 ;;;###autoload
 (defun cookie (phrase-file startmsg endmsg)
-  "Return a random phrase from PHRASE-FILE.  When the phrase file
-is read in, display STARTMSG at beginning of load, ENDMSG at end."
+  "Return a random phrase from PHRASE-FILE.
+When the phrase file is read in, display STARTMSG at the beginning
+of load, ENDMSG at the end."
   (let ((cookie-vector (cookie-snarf phrase-file startmsg endmsg)))
     (shuffle-vector cookie-vector)
     (aref cookie-vector 1)))
 
 ;;;###autoload
 (defun cookie-insert (phrase-file &optional count startmsg endmsg)
-  "Insert random phrases from PHRASE-FILE; COUNT of them.  When the phrase file
-is read in, display STARTMSG at beginning of load, ENDMSG at end."
+  "Insert random phrases from PHRASE-FILE; COUNT of them.
+When the phrase file is read in, display STARTMSG at the beginning
+of load, ENDMSG at the end."
   (let ((cookie-vector (cookie-snarf phrase-file startmsg endmsg)))
     (shuffle-vector cookie-vector)
     (let ((start (point)))
@@ -151,7 +153,7 @@ Optional fifth arg REQUIRE-MATCH non-nil forces a matching cookie."
 ;
 ;;;###autoload
 (defun shuffle-vector (vector)
-  "Randomly permute the elements of VECTOR (all permutations equally likely)"
+  "Randomly permute the elements of VECTOR (all permutations equally likely)."
   (let ((i 0)
        j
        temp