* lisp/subr.el (zerop): Move later so bootstrap works.

diff --git a/lisp/subr.el b/lisp/subr.el
index 8767511f6512c20b5c0ffe63b3d6660109ea0e33..73dd0fe71df624e2d262ba512b0932602350f4d3 100644 (file)
--- a/lisp/subr.el
+++ b/lisp/subr.el
@@ -335,12 +335,6 @@ configuration."
   (and (consp object)
        (eq (car object) 'frame-configuration)))
 
-(defun zerop (number)
-  "Return t if NUMBER is zero."
-  ;; Used to be in C, but it's pointless since (= 0 n) is faster anyway because
-  ;; = has a byte-code.
-  (declare (compiler-macro (lambda (_) `(= 0 ,number))))
-  (= 0 number))
 \f
 ;;;; List functions.
 
@@ -389,6 +383,13 @@ If N is omitted or nil, remove the last element."
           (if (> n 0) (setcdr (nthcdr (- (1- m) n) list) nil))
           list))))
 
+(defun zerop (number)
+  "Return t if NUMBER is zero."
+  ;; Used to be in C, but it's pointless since (= 0 n) is faster anyway because
+  ;; = has a byte-code.
+  (declare (compiler-macro (lambda (_) `(= 0 ,number))))
+  (= 0 number))
+
 (defun delete-dups (list)
   "Destructively remove `equal' duplicates from LIST.
 Store the result in LIST and return it.  LIST must be a proper list.