1 ;;; cl-loaddefs.el --- automatically extracted autoloads
6 ;;;### (autoloads (cl-prettyexpand cl-remprop cl--do-remf cl--set-getf
7 ;;;;;; cl-getf cl-get cl-tailp cl-list-length cl-nreconc cl-revappend
8 ;;;;;; cl-concatenate cl-subseq cl-float-limits cl-random-state-p
9 ;;;;;; cl-make-random-state cl-random cl-signum cl-rem cl-mod cl-round
10 ;;;;;; cl-truncate cl-ceiling cl-floor cl-isqrt cl-lcm cl-gcd cl--set-frame-visible-p
11 ;;;;;; cl--map-overlays cl--map-intervals cl--map-keymap-recursively
12 ;;;;;; cl-notevery cl-notany cl-every cl-some cl-mapcon cl-mapcan
13 ;;;;;; cl-mapl cl-maplist cl-map cl--mapcar-many cl-equalp cl-coerce)
14 ;;;;;; "cl-extra" "cl-extra.el" "535a24c1cff55a16e3d51219498a7858")
15 ;;; Generated autoloads from cl-extra.el
17 (autoload 'cl-coerce
"cl-extra" "\
18 Coerce OBJECT to type TYPE.
19 TYPE is a Common Lisp type specifier.
21 \(fn OBJECT TYPE)" nil nil
)
23 (autoload 'cl-equalp
"cl-extra" "\
24 Return t if two Lisp objects have similar structures and contents.
25 This is like `equal', except that it accepts numerically equal
26 numbers of different types (float vs. integer), and also compares
27 strings case-insensitively.
31 (autoload 'cl--mapcar-many
"cl-extra" "\
34 \(fn CL-FUNC CL-SEQS)" nil nil
)
36 (autoload 'cl-map
"cl-extra" "\
37 Map a FUNCTION across one or more SEQUENCEs, returning a sequence.
38 TYPE is the sequence type to return.
40 \(fn TYPE FUNCTION SEQUENCE...)" nil nil
)
42 (autoload 'cl-maplist
"cl-extra" "\
43 Map FUNCTION to each sublist of LIST or LISTs.
44 Like `mapcar', except applies to lists and their cdr's rather than to
45 the elements themselves.
47 \(fn FUNCTION LIST...)" nil nil
)
49 (autoload 'cl-mapl
"cl-extra" "\
50 Like `cl-maplist', but does not accumulate values returned by the function.
52 \(fn FUNCTION LIST...)" nil nil
)
54 (autoload 'cl-mapcan
"cl-extra" "\
55 Like `mapcar', but nconc's together the values returned by the function.
57 \(fn FUNCTION SEQUENCE...)" nil nil
)
59 (autoload 'cl-mapcon
"cl-extra" "\
60 Like `cl-maplist', but nconc's together the values returned by the function.
62 \(fn FUNCTION LIST...)" nil nil
)
64 (autoload 'cl-some
"cl-extra" "\
65 Return true if PREDICATE is true of any element of SEQ or SEQs.
66 If so, return the true (non-nil) value returned by PREDICATE.
68 \(fn PREDICATE SEQ...)" nil nil
)
70 (autoload 'cl-every
"cl-extra" "\
71 Return true if PREDICATE is true of every element of SEQ or SEQs.
73 \(fn PREDICATE SEQ...)" nil nil
)
75 (autoload 'cl-notany
"cl-extra" "\
76 Return true if PREDICATE is false of every element of SEQ or SEQs.
78 \(fn PREDICATE SEQ...)" nil nil
)
80 (autoload 'cl-notevery
"cl-extra" "\
81 Return true if PREDICATE is false of some element of SEQ or SEQs.
83 \(fn PREDICATE SEQ...)" nil nil
)
85 (autoload 'cl--map-keymap-recursively
"cl-extra" "\
88 \(fn CL-FUNC-REC CL-MAP &optional CL-BASE)" nil nil
)
90 (autoload 'cl--map-intervals
"cl-extra" "\
93 \(fn CL-FUNC &optional CL-WHAT CL-PROP CL-START CL-END)" nil nil
)
95 (autoload 'cl--map-overlays
"cl-extra" "\
98 \(fn CL-FUNC &optional CL-BUFFER CL-START CL-END CL-ARG)" nil nil
)
100 (autoload 'cl--set-frame-visible-p
"cl-extra" "\
103 \(fn FRAME VAL)" nil nil
)
105 (autoload 'cl-gcd
"cl-extra" "\
106 Return the greatest common divisor of the arguments.
108 \(fn &rest ARGS)" nil nil
)
110 (autoload 'cl-lcm
"cl-extra" "\
111 Return the least common multiple of the arguments.
113 \(fn &rest ARGS)" nil nil
)
115 (autoload 'cl-isqrt
"cl-extra" "\
116 Return the integer square root of the argument.
120 (autoload 'cl-floor
"cl-extra" "\
121 Return a list of the floor of X and the fractional part of X.
122 With two arguments, return floor and remainder of their quotient.
124 \(fn X &optional Y)" nil nil
)
126 (autoload 'cl-ceiling
"cl-extra" "\
127 Return a list of the ceiling of X and the fractional part of X.
128 With two arguments, return ceiling and remainder of their quotient.
130 \(fn X &optional Y)" nil nil
)
132 (autoload 'cl-truncate
"cl-extra" "\
133 Return a list of the integer part of X and the fractional part of X.
134 With two arguments, return truncation and remainder of their quotient.
136 \(fn X &optional Y)" nil nil
)
138 (autoload 'cl-round
"cl-extra" "\
139 Return a list of X rounded to the nearest integer and the remainder.
140 With two arguments, return rounding and remainder of their quotient.
142 \(fn X &optional Y)" nil nil
)
144 (autoload 'cl-mod
"cl-extra" "\
145 The remainder of X divided by Y, with the same sign as Y.
149 (autoload 'cl-rem
"cl-extra" "\
150 The remainder of X divided by Y, with the same sign as X.
154 (autoload 'cl-signum
"cl-extra" "\
155 Return 1 if X is positive, -1 if negative, 0 if zero.
159 (autoload 'cl-random
"cl-extra" "\
160 Return a random nonnegative number less than LIM, an integer or float.
161 Optional second arg STATE is a random-state object.
163 \(fn LIM &optional STATE)" nil nil
)
165 (autoload 'cl-make-random-state
"cl-extra" "\
166 Return a copy of random-state STATE, or of the internal state if omitted.
167 If STATE is t, return a new state object seeded from the time of day.
169 \(fn &optional STATE)" nil nil
)
171 (autoload 'cl-random-state-p
"cl-extra" "\
172 Return t if OBJECT is a random-state object.
174 \(fn OBJECT)" nil nil
)
176 (autoload 'cl-float-limits
"cl-extra" "\
177 Initialize the Common Lisp floating-point parameters.
178 This sets the values of: `cl-most-positive-float', `cl-most-negative-float',
179 `cl-least-positive-float', `cl-least-negative-float', `cl-float-epsilon',
180 `cl-float-negative-epsilon', `cl-least-positive-normalized-float', and
181 `cl-least-negative-normalized-float'.
185 (autoload 'cl-subseq
"cl-extra" "\
186 Return the subsequence of SEQ from START to END.
187 If END is omitted, it defaults to the length of the sequence.
188 If START or END is negative, it counts from the end.
190 \(fn SEQ START &optional END)" nil nil
)
192 (autoload 'cl-concatenate
"cl-extra" "\
193 Concatenate, into a sequence of type TYPE, the argument SEQUENCEs.
195 \(fn TYPE SEQUENCE...)" nil nil
)
197 (autoload 'cl-revappend
"cl-extra" "\
198 Equivalent to (append (reverse X) Y).
202 (autoload 'cl-nreconc
"cl-extra" "\
203 Equivalent to (nconc (nreverse X) Y).
207 (autoload 'cl-list-length
"cl-extra" "\
208 Return the length of list X. Return nil if list is circular.
212 (autoload 'cl-tailp
"cl-extra" "\
213 Return true if SUBLIST is a tail of LIST.
215 \(fn SUBLIST LIST)" nil nil
)
217 (autoload 'cl-get
"cl-extra" "\
218 Return the value of SYMBOL's PROPNAME property, or DEFAULT if none.
220 \(fn SYMBOL PROPNAME &optional DEFAULT)" nil nil
)
222 (put 'cl-get
'compiler-macro
#'cl--compiler-macro-get
)
224 (autoload 'cl-getf
"cl-extra" "\
225 Search PROPLIST for property PROPNAME; return its value or DEFAULT.
226 PROPLIST is a list of the sort returned by `symbol-plist'.
228 \(fn PROPLIST PROPNAME &optional DEFAULT)" nil nil
)
230 (autoload 'cl--set-getf
"cl-extra" "\
233 \(fn PLIST TAG VAL)" nil nil
)
235 (autoload 'cl--do-remf
"cl-extra" "\
238 \(fn PLIST TAG)" nil nil
)
240 (autoload 'cl-remprop
"cl-extra" "\
241 Remove from SYMBOL's plist the property PROPNAME and its value.
243 \(fn SYMBOL PROPNAME)" nil nil
)
245 (autoload 'cl-prettyexpand
"cl-extra" "\
248 \(fn FORM &optional FULL)" nil nil
)
252 ;;;### (autoloads (cl--compiler-macro-adjoin cl-defsubst cl-compiler-macroexpand
253 ;;;;;; cl-define-compiler-macro cl-assert cl-check-type cl-typep
254 ;;;;;; cl-deftype cl-defstruct cl-callf2 cl-callf cl-letf* cl-letf
255 ;;;;;; cl-rotatef cl-shiftf cl-remf cl-psetf cl-declare cl-the cl-locally
256 ;;;;;; cl-multiple-value-setq cl-multiple-value-bind cl-symbol-macrolet
257 ;;;;;; cl-macrolet cl-labels cl-flet* cl-flet cl-progv cl-psetq
258 ;;;;;; cl-do-all-symbols cl-do-symbols cl-dotimes cl-dolist cl-do*
259 ;;;;;; cl-do cl-loop cl-return-from cl-return cl-block cl-etypecase
260 ;;;;;; cl-typecase cl-ecase cl-case cl-load-time-value cl-eval-when
261 ;;;;;; cl-destructuring-bind cl-function cl-defmacro cl-defun cl-gentemp
262 ;;;;;; cl-gensym cl--compiler-macro-cXXr cl--compiler-macro-list*)
263 ;;;;;; "cl-macs" "cl-macs.el" "6d0676869af66e5b5a671f95ee069461")
264 ;;; Generated autoloads from cl-macs.el
266 (autoload 'cl--compiler-macro-list
* "cl-macs" "\
269 \(fn FORM ARG &rest OTHERS)" nil nil
)
271 (autoload 'cl--compiler-macro-cXXr
"cl-macs" "\
274 \(fn FORM X)" nil nil
)
276 (autoload 'cl-gensym
"cl-macs" "\
277 Generate a new uninterned symbol.
278 The name is made by appending a number to PREFIX, default \"G\".
280 \(fn &optional PREFIX)" nil nil
)
282 (autoload 'cl-gentemp
"cl-macs" "\
283 Generate a new interned symbol with a unique name.
284 The name is made by appending a number to PREFIX, default \"G\".
286 \(fn &optional PREFIX)" nil nil
)
288 (autoload 'cl-defun
"cl-macs" "\
289 Define NAME as a function.
290 Like normal `defun', except ARGLIST allows full Common Lisp conventions,
291 and BODY is implicitly surrounded by (cl-block NAME ...).
293 \(fn NAME ARGLIST [DOCSTRING] BODY...)" nil t
)
295 (put 'cl-defun
'doc-string-elt
'3)
297 (put 'cl-defun
'lisp-indent-function
'2)
299 (autoload 'cl-defmacro
"cl-macs" "\
300 Define NAME as a macro.
301 Like normal `defmacro', except ARGLIST allows full Common Lisp conventions,
302 and BODY is implicitly surrounded by (cl-block NAME ...).
304 \(fn NAME ARGLIST [DOCSTRING] BODY...)" nil t
)
306 (put 'cl-defmacro
'doc-string-elt
'3)
308 (put 'cl-defmacro
'lisp-indent-function
'2)
310 (autoload 'cl-function
"cl-macs" "\
311 Introduce a function.
312 Like normal `function', except that if argument is a lambda form,
313 its argument list allows full Common Lisp conventions.
317 (autoload 'cl-destructuring-bind
"cl-macs" "\
320 \(fn ARGS EXPR &rest BODY)" nil t
)
322 (put 'cl-destructuring-bind
'lisp-indent-function
'2)
324 (autoload 'cl-eval-when
"cl-macs" "\
325 Control when BODY is evaluated.
326 If `compile' is in WHEN, BODY is evaluated when compiled at top-level.
327 If `load' is in WHEN, BODY is evaluated when loaded after top-level compile.
328 If `eval' is in WHEN, BODY is evaluated when interpreted or at non-top-level.
330 \(fn (WHEN...) BODY...)" nil t
)
332 (put 'cl-eval-when
'lisp-indent-function
'1)
334 (autoload 'cl-load-time-value
"cl-macs" "\
335 Like `progn', but evaluates the body at load time.
336 The result of the body appears to the compiler as a quoted constant.
338 \(fn FORM &optional READ-ONLY)" nil t
)
340 (autoload 'cl-case
"cl-macs" "\
341 Eval EXPR and choose among clauses on that value.
342 Each clause looks like (KEYLIST BODY...). EXPR is evaluated and compared
343 against each key in each KEYLIST; the corresponding BODY is evaluated.
344 If no clause succeeds, cl-case returns nil. A single atom may be used in
345 place of a KEYLIST of one atom. A KEYLIST of t or `otherwise' is
346 allowed only in the final clause, and matches if no other keys match.
347 Key values are compared by `eql'.
349 \(fn EXPR (KEYLIST BODY...)...)" nil t
)
351 (put 'cl-case
'lisp-indent-function
'1)
353 (autoload 'cl-ecase
"cl-macs" "\
354 Like `cl-case', but error if no case fits.
355 `otherwise'-clauses are not allowed.
357 \(fn EXPR (KEYLIST BODY...)...)" nil t
)
359 (put 'cl-ecase
'lisp-indent-function
'1)
361 (autoload 'cl-typecase
"cl-macs" "\
362 Evals EXPR, chooses among clauses on that value.
363 Each clause looks like (TYPE BODY...). EXPR is evaluated and, if it
364 satisfies TYPE, the corresponding BODY is evaluated. If no clause succeeds,
365 cl-typecase returns nil. A TYPE of t or `otherwise' is allowed only in the
366 final clause, and matches if no other keys match.
368 \(fn EXPR (TYPE BODY...)...)" nil t
)
370 (put 'cl-typecase
'lisp-indent-function
'1)
372 (autoload 'cl-etypecase
"cl-macs" "\
373 Like `cl-typecase', but error if no case fits.
374 `otherwise'-clauses are not allowed.
376 \(fn EXPR (TYPE BODY...)...)" nil t
)
378 (put 'cl-etypecase
'lisp-indent-function
'1)
380 (autoload 'cl-block
"cl-macs" "\
381 Define a lexically-scoped block named NAME.
382 NAME may be any symbol. Code inside the BODY forms can call `cl-return-from'
383 to jump prematurely out of the block. This differs from `catch' and `throw'
384 in two respects: First, the NAME is an unevaluated symbol rather than a
385 quoted symbol or other form; and second, NAME is lexically rather than
386 dynamically scoped: Only references to it within BODY will work. These
387 references may appear inside macro expansions, but not inside functions
390 \(fn NAME &rest BODY)" nil t
)
392 (put 'cl-block
'lisp-indent-function
'1)
394 (autoload 'cl-return
"cl-macs" "\
395 Return from the block named nil.
396 This is equivalent to `(cl-return-from nil RESULT)'.
398 \(fn &optional RESULT)" nil t
)
400 (autoload 'cl-return-from
"cl-macs" "\
401 Return from the block named NAME.
402 This jumps out to the innermost enclosing `(cl-block NAME ...)' form,
403 returning RESULT from that form (or nil if RESULT is omitted).
404 This is compatible with Common Lisp, but note that `defun' and
405 `defmacro' do not create implicit blocks as they do in Common Lisp.
407 \(fn NAME &optional RESULT)" nil t
)
409 (put 'cl-return-from
'lisp-indent-function
'1)
411 (autoload 'cl-loop
"cl-macs" "\
412 The Common Lisp `cl-loop' macro.
414 for VAR from/upfrom/downfrom NUM to/upto/downto/above/below NUM by NUM,
415 for VAR in LIST by FUNC, for VAR on LIST by FUNC, for VAR = INIT then EXPR,
416 for VAR across ARRAY, repeat NUM, with VAR = INIT, while COND, until COND,
417 always COND, never COND, thereis COND, collect EXPR into VAR,
418 append EXPR into VAR, nconc EXPR into VAR, sum EXPR into VAR,
419 count EXPR into VAR, maximize EXPR into VAR, minimize EXPR into VAR,
420 if COND CLAUSE [and CLAUSE]... else CLAUSE [and CLAUSE...],
421 unless COND CLAUSE [and CLAUSE]... else CLAUSE [and CLAUSE...],
422 do EXPRS..., initially EXPRS..., finally EXPRS..., return EXPR,
423 finally return EXPR, named NAME.
425 \(fn CLAUSE...)" nil t
)
427 (autoload 'cl-do
"cl-macs" "\
428 The Common Lisp `cl-do' loop.
430 \(fn ((VAR INIT [STEP])...) (END-TEST [RESULT...]) BODY...)" nil t
)
432 (put 'cl-do
'lisp-indent-function
'2)
434 (autoload 'cl-do
* "cl-macs" "\
435 The Common Lisp `cl-do*' loop.
437 \(fn ((VAR INIT [STEP])...) (END-TEST [RESULT...]) BODY...)" nil t
)
439 (put 'cl-do
* 'lisp-indent-function
'2)
441 (autoload 'cl-dolist
"cl-macs" "\
443 Evaluate BODY with VAR bound to each `car' from LIST, in turn.
444 Then evaluate RESULT to get return value, default nil.
445 An implicit nil block is established around the loop.
447 \(fn (VAR LIST [RESULT]) BODY...)" nil t
)
449 (put 'cl-dolist
'lisp-indent-function
'1)
451 (autoload 'cl-dotimes
"cl-macs" "\
452 Loop a certain number of times.
453 Evaluate BODY with VAR bound to successive integers from 0, inclusive,
454 to COUNT, exclusive. Then evaluate RESULT to get return value, default
457 \(fn (VAR COUNT [RESULT]) BODY...)" nil t
)
459 (put 'cl-dotimes
'lisp-indent-function
'1)
461 (autoload 'cl-do-symbols
"cl-macs" "\
462 Loop over all symbols.
463 Evaluate BODY with VAR bound to each interned symbol, or to each symbol
466 \(fn (VAR [OBARRAY [RESULT]]) BODY...)" nil t
)
468 (put 'cl-do-symbols
'lisp-indent-function
'1)
470 (autoload 'cl-do-all-symbols
"cl-macs" "\
473 \(fn SPEC &rest BODY)" nil t
)
475 (put 'cl-do-all-symbols
'lisp-indent-function
'1)
477 (autoload 'cl-psetq
"cl-macs" "\
478 Set SYMs to the values VALs in parallel.
479 This is like `setq', except that all VAL forms are evaluated (in order)
480 before assigning any symbols SYM to the corresponding values.
482 \(fn SYM VAL SYM VAL ...)" nil t
)
484 (autoload 'cl-progv
"cl-macs" "\
485 Bind SYMBOLS to VALUES dynamically in BODY.
486 The forms SYMBOLS and VALUES are evaluated, and must evaluate to lists.
487 Each symbol in the first list is bound to the corresponding value in the
488 second list (or made unbound if VALUES is shorter than SYMBOLS); then the
489 BODY forms are executed and their result is returned. This is much like
490 a `let' form, except that the list of symbols can be computed at run-time.
492 \(fn SYMBOLS VALUES &rest BODY)" nil t
)
494 (put 'cl-progv
'lisp-indent-function
'2)
496 (autoload 'cl-flet
"cl-macs" "\
497 Make temporary function definitions.
498 Like `cl-labels' but the definitions are not recursive.
500 \(fn ((FUNC ARGLIST BODY...) ...) FORM...)" nil t
)
502 (put 'cl-flet
'lisp-indent-function
'1)
504 (autoload 'cl-flet
* "cl-macs" "\
505 Make temporary function definitions.
506 Like `cl-flet' but the definitions can refer to previous ones.
508 \(fn ((FUNC ARGLIST BODY...) ...) FORM...)" nil t
)
510 (put 'cl-flet
* 'lisp-indent-function
'1)
512 (autoload 'cl-labels
"cl-macs" "\
513 Make temporary function bindings.
514 The bindings can be recursive and the scoping is lexical, but capturing them
515 in closures will only work if `lexical-binding' is in use.
517 \(fn ((FUNC ARGLIST BODY...) ...) FORM...)" nil t
)
519 (put 'cl-labels
'lisp-indent-function
'1)
521 (autoload 'cl-macrolet
"cl-macs" "\
522 Make temporary macro definitions.
523 This is like `cl-flet', but for macros instead of functions.
525 \(fn ((NAME ARGLIST BODY...) ...) FORM...)" nil t
)
527 (put 'cl-macrolet
'lisp-indent-function
'1)
529 (autoload 'cl-symbol-macrolet
"cl-macs" "\
530 Make symbol macro definitions.
531 Within the body FORMs, references to the variable NAME will be replaced
532 by EXPANSION, and (setq NAME ...) will act like (setf EXPANSION ...).
534 \(fn ((NAME EXPANSION) ...) FORM...)" nil t
)
536 (put 'cl-symbol-macrolet
'lisp-indent-function
'1)
538 (autoload 'cl-multiple-value-bind
"cl-macs" "\
539 Collect multiple return values.
540 FORM must return a list; the BODY is then executed with the first N elements
541 of this list bound (`let'-style) to each of the symbols SYM in turn. This
542 is analogous to the Common Lisp `cl-multiple-value-bind' macro, using lists to
543 simulate true multiple return values. For compatibility, (cl-values A B C) is
544 a synonym for (list A B C).
546 \(fn (SYM...) FORM BODY)" nil t
)
548 (put 'cl-multiple-value-bind
'lisp-indent-function
'2)
550 (autoload 'cl-multiple-value-setq
"cl-macs" "\
551 Collect multiple return values.
552 FORM must return a list; the first N elements of this list are stored in
553 each of the symbols SYM in turn. This is analogous to the Common Lisp
554 `cl-multiple-value-setq' macro, using lists to simulate true multiple return
555 values. For compatibility, (cl-values A B C) is a synonym for (list A B C).
557 \(fn (SYM...) FORM)" nil t
)
559 (put 'cl-multiple-value-setq
'lisp-indent-function
'1)
561 (autoload 'cl-locally
"cl-macs" "\
564 \(fn &rest BODY)" nil t
)
566 (autoload 'cl-the
"cl-macs" "\
569 \(fn TYPE FORM)" nil t
)
571 (put 'cl-the
'lisp-indent-function
'1)
573 (autoload 'cl-declare
"cl-macs" "\
574 Declare SPECS about the current function while compiling.
577 (cl-declare (warn 0))
579 will turn off byte-compile warnings in the function.
580 See Info node `(cl)Declarations' for details.
582 \(fn &rest SPECS)" nil t
)
584 (autoload 'cl-psetf
"cl-macs" "\
585 Set PLACEs to the values VALs in parallel.
586 This is like `setf', except that all VAL forms are evaluated (in order)
587 before assigning any PLACEs to the corresponding values.
589 \(fn PLACE VAL PLACE VAL ...)" nil t
)
591 (autoload 'cl-remf
"cl-macs" "\
592 Remove TAG from property list PLACE.
593 PLACE may be a symbol, or any generalized variable allowed by `setf'.
594 The form returns true if TAG was found and removed, nil otherwise.
596 \(fn PLACE TAG)" nil t
)
598 (autoload 'cl-shiftf
"cl-macs" "\
599 Shift left among PLACEs.
600 Example: (cl-shiftf A B C) sets A to B, B to C, and returns the old A.
601 Each PLACE may be a symbol, or any generalized variable allowed by `setf'.
603 \(fn PLACE... VAL)" nil t
)
605 (autoload 'cl-rotatef
"cl-macs" "\
606 Rotate left among PLACEs.
607 Example: (cl-rotatef A B C) sets A to B, B to C, and C to A. It returns nil.
608 Each PLACE may be a symbol, or any generalized variable allowed by `setf'.
610 \(fn PLACE...)" nil t
)
612 (autoload 'cl-letf
"cl-macs" "\
613 Temporarily bind to PLACEs.
614 This is the analogue of `let', but with generalized variables (in the
615 sense of `setf') for the PLACEs. Each PLACE is set to the corresponding
616 VALUE, then the BODY forms are executed. On exit, either normally or
617 because of a `throw' or error, the PLACEs are set back to their original
618 values. Note that this macro is *not* available in Common Lisp.
619 As a special case, if `(PLACE)' is used instead of `(PLACE VALUE)',
620 the PLACE is not modified before executing BODY.
622 \(fn ((PLACE VALUE) ...) BODY...)" nil t
)
624 (put 'cl-letf
'lisp-indent-function
'1)
626 (autoload 'cl-letf
* "cl-macs" "\
627 Temporarily bind to PLACEs.
628 Like `cl-letf' but where the bindings are performed one at a time,
629 rather than all at the end (i.e. like `let*' rather than like `let').
631 \(fn BINDINGS &rest BODY)" nil t
)
633 (put 'cl-letf
* 'lisp-indent-function
'1)
635 (autoload 'cl-callf
"cl-macs" "\
636 Set PLACE to (FUNC PLACE ARGS...).
637 FUNC should be an unquoted function name. PLACE may be a symbol,
638 or any generalized variable allowed by `setf'.
640 \(fn FUNC PLACE &rest ARGS)" nil t
)
642 (put 'cl-callf
'lisp-indent-function
'2)
644 (autoload 'cl-callf2
"cl-macs" "\
645 Set PLACE to (FUNC ARG1 PLACE ARGS...).
646 Like `cl-callf', but PLACE is the second argument of FUNC, not the first.
648 \(fn FUNC ARG1 PLACE ARGS...)" nil t
)
650 (put 'cl-callf2
'lisp-indent-function
'3)
652 (autoload 'cl-defstruct
"cl-macs" "\
653 Define a struct type.
654 This macro defines a new data type called NAME that stores data
655 in SLOTs. It defines a `make-NAME' constructor, a `copy-NAME'
656 copier, a `NAME-p' predicate, and slot accessors named `NAME-SLOT'.
657 You can use the accessors to set the corresponding slots, via `setf'.
659 NAME may instead take the form (NAME OPTIONS...), where each
660 OPTION is either a single keyword or (KEYWORD VALUE).
661 See Info node `(cl)Structures' for a list of valid keywords.
663 Each SLOT may instead take the form (SLOT SLOT-OPTS...), where
664 SLOT-OPTS are keyword-value pairs for that slot. Currently, only
665 one keyword is supported, `:read-only'. If this has a non-nil
666 value, that slot cannot be set via `setf'.
668 \(fn NAME SLOTS...)" nil t
)
670 (put 'cl-defstruct
'doc-string-elt
'2)
672 (put 'cl-defstruct
'lisp-indent-function
'1)
674 (autoload 'cl-deftype
"cl-macs" "\
675 Define NAME as a new data type.
676 The type name can then be used in `cl-typecase', `cl-check-type', etc.
678 \(fn NAME ARGLIST &rest BODY)" nil t
)
680 (put 'cl-deftype
'doc-string-elt
'3)
682 (autoload 'cl-typep
"cl-macs" "\
683 Check that OBJECT is of type TYPE.
684 TYPE is a Common Lisp-style type specifier.
686 \(fn OBJECT TYPE)" nil nil
)
688 (autoload 'cl-check-type
"cl-macs" "\
689 Verify that FORM is of type TYPE; signal an error if not.
690 STRING is an optional description of the desired type.
692 \(fn FORM TYPE &optional STRING)" nil t
)
694 (autoload 'cl-assert
"cl-macs" "\
695 Verify that FORM returns non-nil; signal an error if not.
696 Second arg SHOW-ARGS means to include arguments of FORM in message.
697 Other args STRING and ARGS... are arguments to be passed to `error'.
698 They are not evaluated unless the assertion fails. If STRING is
699 omitted, a default message listing FORM itself is used.
701 \(fn FORM &optional SHOW-ARGS STRING &rest ARGS)" nil t
)
703 (autoload 'cl-define-compiler-macro
"cl-macs" "\
704 Define a compiler-only macro.
705 This is like `defmacro', but macro expansion occurs only if the call to
706 FUNC is compiled (i.e., not interpreted). Compiler macros should be used
707 for optimizing the way calls to FUNC are compiled; the form returned by
708 BODY should do the same thing as a call to the normal function called
709 FUNC, though possibly more efficiently. Note that, like regular macros,
710 compiler macros are expanded repeatedly until no further expansions are
711 possible. Unlike regular macros, BODY can decide to \"punt\" and leave the
712 original function call alone by declaring an initial `&whole foo' parameter
713 and then returning foo.
715 \(fn FUNC ARGS &rest BODY)" nil t
)
717 (autoload 'cl-compiler-macroexpand
"cl-macs" "\
722 (autoload 'cl-defsubst
"cl-macs" "\
723 Define NAME as a function.
724 Like `defun', except the function is automatically declared `inline',
725 ARGLIST allows full Common Lisp conventions, and BODY is implicitly
726 surrounded by (cl-block NAME ...).
728 \(fn NAME ARGLIST [DOCSTRING] BODY...)" nil t
)
730 (put 'cl-defsubst
'lisp-indent-function
'2)
732 (autoload 'cl--compiler-macro-adjoin
"cl-macs" "\
735 \(fn FORM A LIST &rest KEYS)" nil nil
)
739 ;;;### (autoloads (cl-tree-equal cl-nsublis cl-sublis cl-nsubst-if-not
740 ;;;;;; cl-nsubst-if cl-nsubst cl-subst-if-not cl-subst-if cl-subsetp
741 ;;;;;; cl-nset-exclusive-or cl-set-exclusive-or cl-nset-difference
742 ;;;;;; cl-set-difference cl-nintersection cl-intersection cl-nunion
743 ;;;;;; cl-union cl-rassoc-if-not cl-rassoc-if cl-rassoc cl-assoc-if-not
744 ;;;;;; cl-assoc-if cl-assoc cl--adjoin cl-member-if-not cl-member-if
745 ;;;;;; cl-member cl-merge cl-stable-sort cl-sort cl-search cl-mismatch
746 ;;;;;; cl-count-if-not cl-count-if cl-count cl-position-if-not cl-position-if
747 ;;;;;; cl-position cl-find-if-not cl-find-if cl-find cl-nsubstitute-if-not
748 ;;;;;; cl-nsubstitute-if cl-nsubstitute cl-substitute-if-not cl-substitute-if
749 ;;;;;; cl-substitute cl-delete-duplicates cl-remove-duplicates cl-delete-if-not
750 ;;;;;; cl-delete-if cl-delete cl-remove-if-not cl-remove-if cl-remove
751 ;;;;;; cl-replace cl-fill cl-reduce) "cl-seq" "cl-seq.el" "b444601641dcbd14a23ca5182bc80ffa")
752 ;;; Generated autoloads from cl-seq.el
754 (autoload 'cl-reduce
"cl-seq" "\
755 Reduce two-argument FUNCTION across SEQ.
757 Keywords supported: :start :end :from-end :initial-value :key
759 \(fn FUNCTION SEQ [KEYWORD VALUE]...)" nil nil
)
761 (autoload 'cl-fill
"cl-seq" "\
762 Fill the elements of SEQ with ITEM.
764 Keywords supported: :start :end
766 \(fn SEQ ITEM [KEYWORD VALUE]...)" nil nil
)
768 (autoload 'cl-replace
"cl-seq" "\
769 Replace the elements of SEQ1 with the elements of SEQ2.
770 SEQ1 is destructively modified, then returned.
772 Keywords supported: :start1 :end1 :start2 :end2
774 \(fn SEQ1 SEQ2 [KEYWORD VALUE]...)" nil nil
)
776 (autoload 'cl-remove
"cl-seq" "\
777 Remove all occurrences of ITEM in SEQ.
778 This is a non-destructive function; it makes a copy of SEQ if necessary
779 to avoid corrupting the original SEQ.
781 Keywords supported: :test :test-not :key :count :start :end :from-end
783 \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil
)
785 (autoload 'cl-remove-if
"cl-seq" "\
786 Remove all items satisfying PREDICATE in SEQ.
787 This is a non-destructive function; it makes a copy of SEQ if necessary
788 to avoid corrupting the original SEQ.
790 Keywords supported: :key :count :start :end :from-end
792 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
794 (autoload 'cl-remove-if-not
"cl-seq" "\
795 Remove all items not satisfying PREDICATE in SEQ.
796 This is a non-destructive function; it makes a copy of SEQ if necessary
797 to avoid corrupting the original SEQ.
799 Keywords supported: :key :count :start :end :from-end
801 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
803 (autoload 'cl-delete
"cl-seq" "\
804 Remove all occurrences of ITEM in SEQ.
805 This is a destructive function; it reuses the storage of SEQ whenever possible.
807 Keywords supported: :test :test-not :key :count :start :end :from-end
809 \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil
)
811 (autoload 'cl-delete-if
"cl-seq" "\
812 Remove all items satisfying PREDICATE in SEQ.
813 This is a destructive function; it reuses the storage of SEQ whenever possible.
815 Keywords supported: :key :count :start :end :from-end
817 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
819 (autoload 'cl-delete-if-not
"cl-seq" "\
820 Remove all items not satisfying PREDICATE in SEQ.
821 This is a destructive function; it reuses the storage of SEQ whenever possible.
823 Keywords supported: :key :count :start :end :from-end
825 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
827 (autoload 'cl-remove-duplicates
"cl-seq" "\
828 Return a copy of SEQ with all duplicate elements removed.
830 Keywords supported: :test :test-not :key :start :end :from-end
832 \(fn SEQ [KEYWORD VALUE]...)" nil nil
)
834 (autoload 'cl-delete-duplicates
"cl-seq" "\
835 Remove all duplicate elements from SEQ (destructively).
837 Keywords supported: :test :test-not :key :start :end :from-end
839 \(fn SEQ [KEYWORD VALUE]...)" nil nil
)
841 (autoload 'cl-substitute
"cl-seq" "\
842 Substitute NEW for OLD in SEQ.
843 This is a non-destructive function; it makes a copy of SEQ if necessary
844 to avoid corrupting the original SEQ.
846 Keywords supported: :test :test-not :key :count :start :end :from-end
848 \(fn NEW OLD SEQ [KEYWORD VALUE]...)" nil nil
)
850 (autoload 'cl-substitute-if
"cl-seq" "\
851 Substitute NEW for all items satisfying PREDICATE in SEQ.
852 This is a non-destructive function; it makes a copy of SEQ if necessary
853 to avoid corrupting the original SEQ.
855 Keywords supported: :key :count :start :end :from-end
857 \(fn NEW PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
859 (autoload 'cl-substitute-if-not
"cl-seq" "\
860 Substitute NEW for all items not satisfying PREDICATE in SEQ.
861 This is a non-destructive function; it makes a copy of SEQ if necessary
862 to avoid corrupting the original SEQ.
864 Keywords supported: :key :count :start :end :from-end
866 \(fn NEW PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
868 (autoload 'cl-nsubstitute
"cl-seq" "\
869 Substitute NEW for OLD in SEQ.
870 This is a destructive function; it reuses the storage of SEQ whenever possible.
872 Keywords supported: :test :test-not :key :count :start :end :from-end
874 \(fn NEW OLD SEQ [KEYWORD VALUE]...)" nil nil
)
876 (autoload 'cl-nsubstitute-if
"cl-seq" "\
877 Substitute NEW for all items satisfying PREDICATE in SEQ.
878 This is a destructive function; it reuses the storage of SEQ whenever possible.
880 Keywords supported: :key :count :start :end :from-end
882 \(fn NEW PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
884 (autoload 'cl-nsubstitute-if-not
"cl-seq" "\
885 Substitute NEW for all items not satisfying PREDICATE in SEQ.
886 This is a destructive function; it reuses the storage of SEQ whenever possible.
888 Keywords supported: :key :count :start :end :from-end
890 \(fn NEW PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
892 (autoload 'cl-find
"cl-seq" "\
893 Find the first occurrence of ITEM in SEQ.
894 Return the matching ITEM, or nil if not found.
896 Keywords supported: :test :test-not :key :start :end :from-end
898 \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil
)
900 (autoload 'cl-find-if
"cl-seq" "\
901 Find the first item satisfying PREDICATE in SEQ.
902 Return the matching item, or nil if not found.
904 Keywords supported: :key :start :end :from-end
906 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
908 (autoload 'cl-find-if-not
"cl-seq" "\
909 Find the first item not satisfying PREDICATE in SEQ.
910 Return the matching item, or nil if not found.
912 Keywords supported: :key :start :end :from-end
914 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
916 (autoload 'cl-position
"cl-seq" "\
917 Find the first occurrence of ITEM in SEQ.
918 Return the index of the matching item, or nil if not found.
920 Keywords supported: :test :test-not :key :start :end :from-end
922 \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil
)
924 (autoload 'cl-position-if
"cl-seq" "\
925 Find the first item satisfying PREDICATE in SEQ.
926 Return the index of the matching item, or nil if not found.
928 Keywords supported: :key :start :end :from-end
930 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
932 (autoload 'cl-position-if-not
"cl-seq" "\
933 Find the first item not satisfying PREDICATE in SEQ.
934 Return the index of the matching item, or nil if not found.
936 Keywords supported: :key :start :end :from-end
938 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
940 (autoload 'cl-count
"cl-seq" "\
941 Count the number of occurrences of ITEM in SEQ.
943 Keywords supported: :test :test-not :key :start :end
945 \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil
)
947 (autoload 'cl-count-if
"cl-seq" "\
948 Count the number of items satisfying PREDICATE in SEQ.
950 Keywords supported: :key :start :end
952 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
954 (autoload 'cl-count-if-not
"cl-seq" "\
955 Count the number of items not satisfying PREDICATE in SEQ.
957 Keywords supported: :key :start :end
959 \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil
)
961 (autoload 'cl-mismatch
"cl-seq" "\
962 Compare SEQ1 with SEQ2, return index of first mismatching element.
963 Return nil if the sequences match. If one sequence is a prefix of the
964 other, the return value indicates the end of the shorter sequence.
966 Keywords supported: :test :test-not :key :start1 :end1 :start2 :end2 :from-end
968 \(fn SEQ1 SEQ2 [KEYWORD VALUE]...)" nil nil
)
970 (autoload 'cl-search
"cl-seq" "\
971 Search for SEQ1 as a subsequence of SEQ2.
972 Return the index of the leftmost element of the first match found;
973 return nil if there are no matches.
975 Keywords supported: :test :test-not :key :start1 :end1 :start2 :end2 :from-end
977 \(fn SEQ1 SEQ2 [KEYWORD VALUE]...)" nil nil
)
979 (autoload 'cl-sort
"cl-seq" "\
980 Sort the argument SEQ according to PREDICATE.
981 This is a destructive function; it reuses the storage of SEQ if possible.
983 Keywords supported: :key
985 \(fn SEQ PREDICATE [KEYWORD VALUE]...)" nil nil
)
987 (autoload 'cl-stable-sort
"cl-seq" "\
988 Sort the argument SEQ stably according to PREDICATE.
989 This is a destructive function; it reuses the storage of SEQ if possible.
991 Keywords supported: :key
993 \(fn SEQ PREDICATE [KEYWORD VALUE]...)" nil nil
)
995 (autoload 'cl-merge
"cl-seq" "\
996 Destructively merge the two sequences to produce a new sequence.
997 TYPE is the sequence type to return, SEQ1 and SEQ2 are the two argument
998 sequences, and PREDICATE is a `less-than' predicate on the elements.
1000 Keywords supported: :key
1002 \(fn TYPE SEQ1 SEQ2 PREDICATE [KEYWORD VALUE]...)" nil nil
)
1004 (autoload 'cl-member
"cl-seq" "\
1005 Find the first occurrence of ITEM in LIST.
1006 Return the sublist of LIST whose car is ITEM.
1008 Keywords supported: :test :test-not :key
1010 \(fn ITEM LIST [KEYWORD VALUE]...)" nil nil
)
1012 (put 'cl-member
'compiler-macro
#'cl--compiler-macro-member
)
1014 (autoload 'cl-member-if
"cl-seq" "\
1015 Find the first item satisfying PREDICATE in LIST.
1016 Return the sublist of LIST whose car matches.
1018 Keywords supported: :key
1020 \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil
)
1022 (autoload 'cl-member-if-not
"cl-seq" "\
1023 Find the first item not satisfying PREDICATE in LIST.
1024 Return the sublist of LIST whose car matches.
1026 Keywords supported: :key
1028 \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil
)
1030 (autoload 'cl--adjoin
"cl-seq" "\
1033 \(fn CL-ITEM CL-LIST &rest CL-KEYS)" nil nil
)
1035 (autoload 'cl-assoc
"cl-seq" "\
1036 Find the first item whose car matches ITEM in LIST.
1038 Keywords supported: :test :test-not :key
1040 \(fn ITEM LIST [KEYWORD VALUE]...)" nil nil
)
1042 (put 'cl-assoc
'compiler-macro
#'cl--compiler-macro-assoc
)
1044 (autoload 'cl-assoc-if
"cl-seq" "\
1045 Find the first item whose car satisfies PREDICATE in LIST.
1047 Keywords supported: :key
1049 \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil
)
1051 (autoload 'cl-assoc-if-not
"cl-seq" "\
1052 Find the first item whose car does not satisfy PREDICATE in LIST.
1054 Keywords supported: :key
1056 \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil
)
1058 (autoload 'cl-rassoc
"cl-seq" "\
1059 Find the first item whose cdr matches ITEM in LIST.
1061 Keywords supported: :test :test-not :key
1063 \(fn ITEM LIST [KEYWORD VALUE]...)" nil nil
)
1065 (autoload 'cl-rassoc-if
"cl-seq" "\
1066 Find the first item whose cdr satisfies PREDICATE in LIST.
1068 Keywords supported: :key
1070 \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil
)
1072 (autoload 'cl-rassoc-if-not
"cl-seq" "\
1073 Find the first item whose cdr does not satisfy PREDICATE in LIST.
1075 Keywords supported: :key
1077 \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil
)
1079 (autoload 'cl-union
"cl-seq" "\
1080 Combine LIST1 and LIST2 using a set-union operation.
1081 The resulting list contains all items that appear in either LIST1 or LIST2.
1082 This is a non-destructive function; it makes a copy of the data if necessary
1083 to avoid corrupting the original LIST1 and LIST2.
1085 Keywords supported: :test :test-not :key
1087 \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil
)
1089 (autoload 'cl-nunion
"cl-seq" "\
1090 Combine LIST1 and LIST2 using a set-union operation.
1091 The resulting list contains all items that appear in either LIST1 or LIST2.
1092 This is a destructive function; it reuses the storage of LIST1 and LIST2
1095 Keywords supported: :test :test-not :key
1097 \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil
)
1099 (autoload 'cl-intersection
"cl-seq" "\
1100 Combine LIST1 and LIST2 using a set-intersection operation.
1101 The resulting list contains all items that appear in both LIST1 and LIST2.
1102 This is a non-destructive function; it makes a copy of the data if necessary
1103 to avoid corrupting the original LIST1 and LIST2.
1105 Keywords supported: :test :test-not :key
1107 \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil
)
1109 (autoload 'cl-nintersection
"cl-seq" "\
1110 Combine LIST1 and LIST2 using a set-intersection operation.
1111 The resulting list contains all items that appear in both LIST1 and LIST2.
1112 This is a destructive function; it reuses the storage of LIST1 and LIST2
1115 Keywords supported: :test :test-not :key
1117 \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil
)
1119 (autoload 'cl-set-difference
"cl-seq" "\
1120 Combine LIST1 and LIST2 using a set-difference operation.
1121 The resulting list contains all items that appear in LIST1 but not LIST2.
1122 This is a non-destructive function; it makes a copy of the data if necessary
1123 to avoid corrupting the original LIST1 and LIST2.
1125 Keywords supported: :test :test-not :key
1127 \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil
)
1129 (autoload 'cl-nset-difference
"cl-seq" "\
1130 Combine LIST1 and LIST2 using a set-difference operation.
1131 The resulting list contains all items that appear in LIST1 but not LIST2.
1132 This is a destructive function; it reuses the storage of LIST1 and LIST2
1135 Keywords supported: :test :test-not :key
1137 \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil
)
1139 (autoload 'cl-set-exclusive-or
"cl-seq" "\
1140 Combine LIST1 and LIST2 using a set-exclusive-or operation.
1141 The resulting list contains all items appearing in exactly one of LIST1, LIST2.
1142 This is a non-destructive function; it makes a copy of the data if necessary
1143 to avoid corrupting the original LIST1 and LIST2.
1145 Keywords supported: :test :test-not :key
1147 \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil
)
1149 (autoload 'cl-nset-exclusive-or
"cl-seq" "\
1150 Combine LIST1 and LIST2 using a set-exclusive-or operation.
1151 The resulting list contains all items appearing in exactly one of LIST1, LIST2.
1152 This is a destructive function; it reuses the storage of LIST1 and LIST2
1155 Keywords supported: :test :test-not :key
1157 \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil
)
1159 (autoload 'cl-subsetp
"cl-seq" "\
1160 Return true if LIST1 is a subset of LIST2.
1161 I.e., if every element of LIST1 also appears in LIST2.
1163 Keywords supported: :test :test-not :key
1165 \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil
)
1167 (autoload 'cl-subst-if
"cl-seq" "\
1168 Substitute NEW for elements matching PREDICATE in TREE (non-destructively).
1169 Return a copy of TREE with all matching elements replaced by NEW.
1171 Keywords supported: :key
1173 \(fn NEW PREDICATE TREE [KEYWORD VALUE]...)" nil nil
)
1175 (autoload 'cl-subst-if-not
"cl-seq" "\
1176 Substitute NEW for elts not matching PREDICATE in TREE (non-destructively).
1177 Return a copy of TREE with all non-matching elements replaced by NEW.
1179 Keywords supported: :key
1181 \(fn NEW PREDICATE TREE [KEYWORD VALUE]...)" nil nil
)
1183 (autoload 'cl-nsubst
"cl-seq" "\
1184 Substitute NEW for OLD everywhere in TREE (destructively).
1185 Any element of TREE which is `eql' to OLD is changed to NEW (via a call
1188 Keywords supported: :test :test-not :key
1190 \(fn NEW OLD TREE [KEYWORD VALUE]...)" nil nil
)
1192 (autoload 'cl-nsubst-if
"cl-seq" "\
1193 Substitute NEW for elements matching PREDICATE in TREE (destructively).
1194 Any element of TREE which matches is changed to NEW (via a call to `setcar').
1196 Keywords supported: :key
1198 \(fn NEW PREDICATE TREE [KEYWORD VALUE]...)" nil nil
)
1200 (autoload 'cl-nsubst-if-not
"cl-seq" "\
1201 Substitute NEW for elements not matching PREDICATE in TREE (destructively).
1202 Any element of TREE which matches is changed to NEW (via a call to `setcar').
1204 Keywords supported: :key
1206 \(fn NEW PREDICATE TREE [KEYWORD VALUE]...)" nil nil
)
1208 (autoload 'cl-sublis
"cl-seq" "\
1209 Perform substitutions indicated by ALIST in TREE (non-destructively).
1210 Return a copy of TREE with all matching elements replaced.
1212 Keywords supported: :test :test-not :key
1214 \(fn ALIST TREE [KEYWORD VALUE]...)" nil nil
)
1216 (autoload 'cl-nsublis
"cl-seq" "\
1217 Perform substitutions indicated by ALIST in TREE (destructively).
1218 Any matching element of TREE is changed via a call to `setcar'.
1220 Keywords supported: :test :test-not :key
1222 \(fn ALIST TREE [KEYWORD VALUE]...)" nil nil
)
1224 (autoload 'cl-tree-equal
"cl-seq" "\
1225 Return t if trees TREE1 and TREE2 have `eql' leaves.
1226 Atoms are compared by `eql'; cons cells are compared recursively.
1228 Keywords supported: :test :test-not :key
1230 \(fn TREE1 TREE2 [KEYWORD VALUE]...)" nil nil
)
1235 ;; version-control: never
1236 ;; no-byte-compile: t
1237 ;; no-update-autoloads: t
1240 ;;; cl-loaddefs.el ends here