[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Emacs-diffs] master e6f8ddb: * lisp/emacs-lisp/cl-lib.el (cl-endp): Mov
From: |
Stefan Monnier |
Subject: |
[Emacs-diffs] master e6f8ddb: * lisp/emacs-lisp/cl-lib.el (cl-endp): Move to cl-seq.el |
Date: |
Mon, 18 Feb 2019 13:17:03 -0500 (EST) |
branch: master
commit e6f8ddbb3b8f99c73b2be66bb1e691d4757c3b12
Author: Stefan Monnier <address@hidden>
Commit: Stefan Monnier <address@hidden>
* lisp/emacs-lisp/cl-lib.el (cl-endp): Move to cl-seq.el
Use 'cl-check-type'.
---
lisp/emacs-lisp/cl-lib.el | 7 -------
lisp/emacs-lisp/cl-seq.el | 7 +++++++
2 files changed, 7 insertions(+), 7 deletions(-)
diff --git a/lisp/emacs-lisp/cl-lib.el b/lisp/emacs-lisp/cl-lib.el
index 60c52c2..3a9280f 100644
--- a/lisp/emacs-lisp/cl-lib.el
+++ b/lisp/emacs-lisp/cl-lib.el
@@ -365,13 +365,6 @@ SEQ, this is like `mapcar'. With several, it is like the
Common Lisp
(cl--defalias 'cl-second 'cadr)
(cl--defalias 'cl-rest 'cdr)
-(defun cl-endp (x)
- "Return true if X is the empty list; false if it is a cons.
-Signal an error if X is not a list."
- (if (listp x)
- (null x)
- (signal 'wrong-type-argument (list 'listp x))))
-
(cl--defalias 'cl-third 'cl-caddr "Return the third element of the list X.")
(cl--defalias 'cl-fourth 'cl-cadddr "Return the fourth element of the list X.")
diff --git a/lisp/emacs-lisp/cl-seq.el b/lisp/emacs-lisp/cl-seq.el
index 31ad811..3eb6ea1 100644
--- a/lisp/emacs-lisp/cl-seq.el
+++ b/lisp/emacs-lisp/cl-seq.el
@@ -113,6 +113,13 @@
(defvar cl-key)
;;;###autoload
+(defun cl-endp (x)
+ "Return true if X is the empty list; false if it is a cons.
+Signal an error if X is not a list."
+ (cl-check-type x list)
+ (null x))
+
+;;;###autoload
(defun cl-reduce (cl-func cl-seq &rest cl-keys)
"Reduce two-argument FUNCTION across SEQ.
\nKeywords supported: :start :end :from-end :initial-value :key
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Emacs-diffs] master e6f8ddb: * lisp/emacs-lisp/cl-lib.el (cl-endp): Move to cl-seq.el,
Stefan Monnier <=