Index: emacs/lisp/emacs-lisp/cl-seq.el
diff -c emacs/lisp/emacs-lisp/cl-seq.el:1.12
emacs/lisp/emacs-lisp/cl-seq.el:1.13
*** emacs/lisp/emacs-lisp/cl-seq.el:1.12 Mon Sep 1 15:45:20 2003
--- emacs/lisp/emacs-lisp/cl-seq.el Tue May 17 00:27:32 2005
***************
*** 800,806 ****
(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.
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)
--- 800,806 ----
(apply 'nset-difference cl-list2 cl-list1 cl-keys)))))
(defun subsetp (cl-list1 cl-list2 &rest cl-keys)
! "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,894 ****
(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.
Atoms are compared by `eql'; cons cells are compared recursively.
Keywords supported: :test :test-not :key"
(cl-parsing-keywords (:test :test-not :key) ()
--- 888,894 ----
(setq cl-tree (cdr cl-tree))))))
(defun tree-equal (cl-x cl-y &rest cl-keys)
! "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) ()
_______________________________________________
Emacs-diffs mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/emacs-diffs
