(subsetp, tree-equal): Doc fixes.

diff --git a/lisp/ChangeLog b/lisp/ChangeLog
index bd2034c6f658d16bfc504aa5ea5f0db8996d69fd..80b9156acfeb9b1ce1c0d6f105617c175701f176 100644 (file)
--- a/lisp/ChangeLog
+++ b/lisp/ChangeLog
@@ -1,5 +1,10 @@
 2005-05-17  Juanma Barranquero  <lekktu@gmail.com>
 
+       * emacs-lisp/cl.el (eql, floatp-safe, plusp, minusp, oddp)
+       (evenp, list*):
+       * emacs-lisp/cl-macs.el (macrolet, symbol-macrolet):
+       * emacs-lisp/cl-seq.el (subsetp, tree-equal): Doc fixes.
+
        * net/tramp-smb.el (tramp-smb-open-connection):
        Pass `tramp-chunksize' as fifth (required) argument.
 

diff --git a/lisp/emacs-lisp/cl-seq.el b/lisp/emacs-lisp/cl-seq.el
index 93237f0206fa125e13462f37f3535e6f82ad33f3..cb202700a005efa547e1cb3ecc8de45c0161cde6 100644 (file)
--- a/lisp/emacs-lisp/cl-seq.el
+++ b/lisp/emacs-lisp/cl-seq.el
@@ -800,7 +800,7 @@ Keywords supported:  :test :test-not :key"
                  (apply 'nset-difference cl-list2 cl-list1 cl-keys)))))
 
 (defun subsetp (cl-list1 cl-list2 &rest cl-keys)
-  "True if LIST1 is a subset of LIST2.
+  "Return true if LIST1 is a subset of LIST2.
 I.e., if every element of LIST1 also appears in LIST2.
 Keywords supported:  :test :test-not :key"
   (cond ((null cl-list1) t) ((null cl-list2) nil)
@@ -888,7 +888,7 @@ Keywords supported:  :test :test-not :key"
        (setq cl-tree (cdr cl-tree))))))
 
 (defun tree-equal (cl-x cl-y &rest cl-keys)
-  "T if trees X and Y have `eql' leaves.
+  "Return t if trees X and Y have `eql' leaves.
 Atoms are compared by `eql'; cons cells are compared recursively.
 Keywords supported:  :test :test-not :key"
   (cl-parsing-keywords (:test :test-not :key) ()