(tempo-local-tags, tempo-user-elements, tempo-use-tag-list):

[gnu-emacs] / lisp / cl.el

diff --git a/lisp/cl.el b/lisp/cl.el
index e4777ef37941f47313145d53497c4a2a8a5ca6af..1a6a385e3eec815ef10e644a9559cd95e7a22262 100644 (file)
--- a/lisp/cl.el
+++ b/lisp/cl.el
@@ -1358,7 +1358,7 @@ if clumsier, control over this feature."
 ;;; extract a value with (extract-from-klist KLIST KEY [DEFAULT]).
 
 (defun reduce (function sequence &rest kargs)
 ;;; extract a value with (extract-from-klist KLIST KEY [DEFAULT]).
 
 (defun reduce (function sequence &rest kargs)

-  "Apply FUNCTION (a function of two arguments) to succesive pairs of elements
+  "Apply FUNCTION (a function of two arguments) to successive pairs of elements

 from SEQUENCE.  Some keyword arguments are valid after FUNCTION and SEQUENCE:
 :from-end       If non-nil, process the values backwards
 :initial-value  If given, prefix it to the SEQUENCE.  Suffix, if :from-end
 from SEQUENCE.  Some keyword arguments are valid after FUNCTION and SEQUENCE:
 :from-end       If non-nil, process the values backwards
 :initial-value  If given, prefix it to the SEQUENCE.  Suffix, if :from-end


@@ -1665,7 +1665,7 @@ The arguments must be integers.  With no arguments, value is zero."
            (do* ((absa (abs (nth 0 integers))) ; better to operate only
                  (absb (abs (nth 1 integers))) ;on positives.
                  (dd (max absa absb))   ; setup correct order for the
            (do* ((absa (abs (nth 0 integers))) ; better to operate only
                  (absb (abs (nth 1 integers))) ;on positives.
                  (dd (max absa absb))   ; setup correct order for the

-                 (ds (min absa absb))   ;succesive divisions.
+                 (ds (min absa absb))   ;successive divisions.

                  ;; intermediate results
                  (q 0)
                  (r 0)
                  ;; intermediate results
                  (q 0)
                  (r 0)


@@ -1804,7 +1804,7 @@ DIVISOR defaults to 1.  The remainder is produced as a second value."
 ;;; These two functions access the implementation-dependent representation of
 ;;; the multiple value returns.
 
 ;;; These two functions access the implementation-dependent representation of
 ;;; the multiple value returns.
 

-(defun mod (number divisor)
+(defun cl-mod (number divisor)

   "Return remainder of X by Y (rounding quotient toward minus infinity).
 That is, the remainder goes with the quotient produced by `cl-floor'.
 Emacs Lisp hint:
   "Return remainder of X by Y (rounding quotient toward minus infinity).
 That is, the remainder goes with the quotient produced by `cl-floor'.
 Emacs Lisp hint:


@@ -1968,7 +1968,7 @@ updating called for."
 
 (defsetf apply
   (lambda (&rest args)
 
 (defsetf apply
   (lambda (&rest args)

-    ;; dissasemble the calling form
+    ;; disassemble the calling form

     ;; "(((quote fn) x1 x2 ... xn) val)" (function instead of quote, too)
     (let* ((fnform (car args))          ;functional form
            (applyargs (append           ;arguments "to apply fnform"
     ;; "(((quote fn) x1 x2 ... xn) val)" (function instead of quote, too)
     (let* ((fnform (car args))          ;functional form
            (applyargs (append           ;arguments "to apply fnform"


@@ -2383,7 +2383,7 @@ Each option is either a symbol, or a list of a keyword symbol taken from the
 list \{:conc-name, :copier, :constructor, :predicate, :include,
 :print-function, :type, :initial-offset\}.  The meanings of these are as in
 CLtL, except that no BOA-constructors are provided, and the options
 list \{:conc-name, :copier, :constructor, :predicate, :include,
 :print-function, :type, :initial-offset\}.  The meanings of these are as in
 CLtL, except that no BOA-constructors are provided, and the options

-\{:print-fuction, :type, :initial-offset\} are ignored quietly.  All these
+\{:print-function, :type, :initial-offset\} are ignored quietly.  All these

 structs are named, in the sense that their names can be used for type
 discrimination.
 
 structs are named, in the sense that their names can be used for type
 discrimination.