aboutsummaryrefslogtreecommitdiffstats
path: root/lisp
diff options
context:
space:
mode:
Diffstat (limited to 'lisp')
-rw-r--r--lisp/subr.el13
1 files changed, 7 insertions, 6 deletions
diff --git a/lisp/subr.el b/lisp/subr.el
index 8767511f651..73dd0fe71df 100644
--- a/lisp/subr.el
+++ b/lisp/subr.el
@@ -335,12 +335,6 @@ configuration."
335 (and (consp object) 335 (and (consp object)
336 (eq (car object) 'frame-configuration))) 336 (eq (car object) 'frame-configuration)))
337 337
338(defun zerop (number)
339 "Return t if NUMBER is zero."
340 ;; Used to be in C, but it's pointless since (= 0 n) is faster anyway because
341 ;; = has a byte-code.
342 (declare (compiler-macro (lambda (_) `(= 0 ,number))))
343 (= 0 number))
344 338
345;;;; List functions. 339;;;; List functions.
346 340
@@ -389,6 +383,13 @@ If N is omitted or nil, remove the last element."
389 (if (> n 0) (setcdr (nthcdr (- (1- m) n) list) nil)) 383 (if (> n 0) (setcdr (nthcdr (- (1- m) n) list) nil))
390 list)))) 384 list))))
391 385
386(defun zerop (number)
387 "Return t if NUMBER is zero."
388 ;; Used to be in C, but it's pointless since (= 0 n) is faster anyway because
389 ;; = has a byte-code.
390 (declare (compiler-macro (lambda (_) `(= 0 ,number))))
391 (= 0 number))
392
392(defun delete-dups (list) 393(defun delete-dups (list)
393 "Destructively remove `equal' duplicates from LIST. 394 "Destructively remove `equal' duplicates from LIST.
394Store the result in LIST and return it. LIST must be a proper list. 395Store the result in LIST and return it. LIST must be a proper list.