# HG changeset patch
# User Juanma Barranquero <lekktu@gmail.com>
# Date 1116289652 0
# Node ID c5a3c48f99b5db6763d72b5db6ae21790dd26e37
# Parent  b8c3e904ae106ff1441d80e5ee6ccfbdd7fa504e
(subsetp, tree-equal): Doc fixes.

diff -r b8c3e904ae10 -r c5a3c48f99b5 lisp/emacs-lisp/cl-seq.el
--- a/lisp/emacs-lisp/cl-seq.el	Tue May 17 00:26:59 2005 +0000
+++ b/lisp/emacs-lisp/cl-seq.el	Tue May 17 00:27:32 2005 +0000
@@ -800,7 +800,7 @@
 		  (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 @@
 	(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) ()