Commit | Line | Data |
---|---|---|
d1b8746d SM |
1 | ;;; cl-loaddefs.el --- automatically extracted autoloads |
2 | ;; | |
3 | ;;; Code: | |
4 | ||
5 | \f | |
6 | ;;;### (autoloads (cl-prettyexpand cl-macroexpand-all cl-remprop | |
7 | ;;;;;; cl-do-remf cl-set-getf getf get* tailp list-length nreconc | |
8 | ;;;;;; revappend concatenate subseq cl-float-limits random-state-p | |
9 | ;;;;;; make-random-state random* signum rem* mod* round* truncate* | |
10 | ;;;;;; ceiling* floor* isqrt lcm gcd cl-progv-before cl-set-frame-visible-p | |
11 | ;;;;;; cl-map-overlays cl-map-intervals cl-map-keymap-recursively | |
12 | ;;;;;; notevery notany every some mapcon mapcan mapl maplist map | |
4735906a | 13 | ;;;;;; cl-mapcar-many equalp coerce) "cl-extra" "cl-extra.el" "1a3a04c6a0286373093bea4b9bcf2e91") |
d1b8746d SM |
14 | ;;; Generated autoloads from cl-extra.el |
15 | ||
5c4133cb | 16 | (autoload 'coerce "cl-extra" "\ |
d1b8746d SM |
17 | Coerce OBJECT to type TYPE. |
18 | TYPE is a Common Lisp type specifier. | |
19 | ||
20 | \(fn OBJECT TYPE)" nil nil) | |
21 | ||
5c4133cb | 22 | (autoload 'equalp "cl-extra" "\ |
d1b8746d SM |
23 | Return t if two Lisp objects have similar structures and contents. |
24 | This is like `equal', except that it accepts numerically equal | |
25 | numbers of different types (float vs. integer), and also compares | |
26 | strings case-insensitively. | |
27 | ||
28 | \(fn X Y)" nil nil) | |
29 | ||
5c4133cb | 30 | (autoload 'cl-mapcar-many "cl-extra" "\ |
01db225d | 31 | |
d1b8746d SM |
32 | |
33 | \(fn CL-FUNC CL-SEQS)" nil nil) | |
34 | ||
5c4133cb | 35 | (autoload 'map "cl-extra" "\ |
d1b8746d SM |
36 | Map a FUNCTION across one or more SEQUENCEs, returning a sequence. |
37 | TYPE is the sequence type to return. | |
38 | ||
39 | \(fn TYPE FUNCTION SEQUENCE...)" nil nil) | |
40 | ||
5c4133cb | 41 | (autoload 'maplist "cl-extra" "\ |
d1b8746d SM |
42 | Map FUNCTION to each sublist of LIST or LISTs. |
43 | Like `mapcar', except applies to lists and their cdr's rather than to | |
44 | the elements themselves. | |
45 | ||
46 | \(fn FUNCTION LIST...)" nil nil) | |
47 | ||
5c4133cb | 48 | (autoload 'mapl "cl-extra" "\ |
d1b8746d SM |
49 | Like `maplist', but does not accumulate values returned by the function. |
50 | ||
51 | \(fn FUNCTION LIST...)" nil nil) | |
52 | ||
5c4133cb | 53 | (autoload 'mapcan "cl-extra" "\ |
d1b8746d SM |
54 | Like `mapcar', but nconc's together the values returned by the function. |
55 | ||
56 | \(fn FUNCTION SEQUENCE...)" nil nil) | |
57 | ||
5c4133cb | 58 | (autoload 'mapcon "cl-extra" "\ |
d1b8746d SM |
59 | Like `maplist', but nconc's together the values returned by the function. |
60 | ||
61 | \(fn FUNCTION LIST...)" nil nil) | |
62 | ||
5c4133cb | 63 | (autoload 'some "cl-extra" "\ |
d1b8746d SM |
64 | Return true if PREDICATE is true of any element of SEQ or SEQs. |
65 | If so, return the true (non-nil) value returned by PREDICATE. | |
66 | ||
67 | \(fn PREDICATE SEQ...)" nil nil) | |
68 | ||
5c4133cb | 69 | (autoload 'every "cl-extra" "\ |
d1b8746d SM |
70 | Return true if PREDICATE is true of every element of SEQ or SEQs. |
71 | ||
72 | \(fn PREDICATE SEQ...)" nil nil) | |
73 | ||
5c4133cb | 74 | (autoload 'notany "cl-extra" "\ |
d1b8746d SM |
75 | Return true if PREDICATE is false of every element of SEQ or SEQs. |
76 | ||
77 | \(fn PREDICATE SEQ...)" nil nil) | |
78 | ||
5c4133cb | 79 | (autoload 'notevery "cl-extra" "\ |
d1b8746d SM |
80 | Return true if PREDICATE is false of some element of SEQ or SEQs. |
81 | ||
82 | \(fn PREDICATE SEQ...)" nil nil) | |
83 | ||
5c4133cb | 84 | (defalias 'cl-map-keymap 'map-keymap) |
d1b8746d | 85 | |
5c4133cb | 86 | (autoload 'cl-map-keymap-recursively "cl-extra" "\ |
01db225d | 87 | |
d1b8746d SM |
88 | |
89 | \(fn CL-FUNC-REC CL-MAP &optional CL-BASE)" nil nil) | |
90 | ||
5c4133cb | 91 | (autoload 'cl-map-intervals "cl-extra" "\ |
01db225d | 92 | |
d1b8746d SM |
93 | |
94 | \(fn CL-FUNC &optional CL-WHAT CL-PROP CL-START CL-END)" nil nil) | |
95 | ||
5c4133cb | 96 | (autoload 'cl-map-overlays "cl-extra" "\ |
01db225d | 97 | |
d1b8746d SM |
98 | |
99 | \(fn CL-FUNC &optional CL-BUFFER CL-START CL-END CL-ARG)" nil nil) | |
100 | ||
5c4133cb | 101 | (autoload 'cl-set-frame-visible-p "cl-extra" "\ |
01db225d | 102 | |
d1b8746d SM |
103 | |
104 | \(fn FRAME VAL)" nil nil) | |
105 | ||
5c4133cb | 106 | (autoload 'cl-progv-before "cl-extra" "\ |
01db225d | 107 | |
d1b8746d SM |
108 | |
109 | \(fn SYMS VALUES)" nil nil) | |
110 | ||
5c4133cb | 111 | (autoload 'gcd "cl-extra" "\ |
d1b8746d SM |
112 | Return the greatest common divisor of the arguments. |
113 | ||
114 | \(fn &rest ARGS)" nil nil) | |
115 | ||
5c4133cb | 116 | (autoload 'lcm "cl-extra" "\ |
d1b8746d SM |
117 | Return the least common multiple of the arguments. |
118 | ||
119 | \(fn &rest ARGS)" nil nil) | |
120 | ||
5c4133cb | 121 | (autoload 'isqrt "cl-extra" "\ |
d1b8746d SM |
122 | Return the integer square root of the argument. |
123 | ||
124 | \(fn X)" nil nil) | |
125 | ||
5c4133cb | 126 | (autoload 'floor* "cl-extra" "\ |
d1b8746d SM |
127 | Return a list of the floor of X and the fractional part of X. |
128 | With two arguments, return floor and remainder of their quotient. | |
129 | ||
130 | \(fn X &optional Y)" nil nil) | |
131 | ||
5c4133cb | 132 | (autoload 'ceiling* "cl-extra" "\ |
d1b8746d SM |
133 | Return a list of the ceiling of X and the fractional part of X. |
134 | With two arguments, return ceiling and remainder of their quotient. | |
135 | ||
136 | \(fn X &optional Y)" nil nil) | |
137 | ||
5c4133cb | 138 | (autoload 'truncate* "cl-extra" "\ |
d1b8746d SM |
139 | Return a list of the integer part of X and the fractional part of X. |
140 | With two arguments, return truncation and remainder of their quotient. | |
141 | ||
142 | \(fn X &optional Y)" nil nil) | |
143 | ||
5c4133cb | 144 | (autoload 'round* "cl-extra" "\ |
d1b8746d SM |
145 | Return a list of X rounded to the nearest integer and the remainder. |
146 | With two arguments, return rounding and remainder of their quotient. | |
147 | ||
148 | \(fn X &optional Y)" nil nil) | |
149 | ||
5c4133cb | 150 | (autoload 'mod* "cl-extra" "\ |
d1b8746d SM |
151 | The remainder of X divided by Y, with the same sign as Y. |
152 | ||
153 | \(fn X Y)" nil nil) | |
154 | ||
5c4133cb | 155 | (autoload 'rem* "cl-extra" "\ |
d1b8746d SM |
156 | The remainder of X divided by Y, with the same sign as X. |
157 | ||
158 | \(fn X Y)" nil nil) | |
159 | ||
5c4133cb | 160 | (autoload 'signum "cl-extra" "\ |
d1b8746d SM |
161 | Return 1 if X is positive, -1 if negative, 0 if zero. |
162 | ||
163 | \(fn X)" nil nil) | |
164 | ||
5c4133cb | 165 | (autoload 'random* "cl-extra" "\ |
d1b8746d SM |
166 | Return a random nonnegative number less than LIM, an integer or float. |
167 | Optional second arg STATE is a random-state object. | |
168 | ||
169 | \(fn LIM &optional STATE)" nil nil) | |
170 | ||
5c4133cb | 171 | (autoload 'make-random-state "cl-extra" "\ |
4735906a | 172 | Return a copy of random-state STATE, or of the internal state if omitted. |
d1b8746d SM |
173 | If STATE is t, return a new state object seeded from the time of day. |
174 | ||
175 | \(fn &optional STATE)" nil nil) | |
176 | ||
5c4133cb | 177 | (autoload 'random-state-p "cl-extra" "\ |
d1b8746d SM |
178 | Return t if OBJECT is a random-state object. |
179 | ||
180 | \(fn OBJECT)" nil nil) | |
181 | ||
5c4133cb | 182 | (autoload 'cl-float-limits "cl-extra" "\ |
01db225d GM |
183 | Initialize the Common Lisp floating-point parameters. |
184 | This sets the values of: `most-positive-float', `most-negative-float', | |
185 | `least-positive-float', `least-negative-float', `float-epsilon', | |
186 | `float-negative-epsilon', `least-positive-normalized-float', and | |
187 | `least-negative-normalized-float'. | |
d1b8746d SM |
188 | |
189 | \(fn)" nil nil) | |
190 | ||
5c4133cb | 191 | (autoload 'subseq "cl-extra" "\ |
d1b8746d SM |
192 | Return the subsequence of SEQ from START to END. |
193 | If END is omitted, it defaults to the length of the sequence. | |
194 | If START or END is negative, it counts from the end. | |
195 | ||
196 | \(fn SEQ START &optional END)" nil nil) | |
197 | ||
5c4133cb | 198 | (autoload 'concatenate "cl-extra" "\ |
d1b8746d SM |
199 | Concatenate, into a sequence of type TYPE, the argument SEQUENCEs. |
200 | ||
201 | \(fn TYPE SEQUENCE...)" nil nil) | |
202 | ||
5c4133cb | 203 | (autoload 'revappend "cl-extra" "\ |
d1b8746d SM |
204 | Equivalent to (append (reverse X) Y). |
205 | ||
206 | \(fn X Y)" nil nil) | |
207 | ||
5c4133cb | 208 | (autoload 'nreconc "cl-extra" "\ |
d1b8746d SM |
209 | Equivalent to (nconc (nreverse X) Y). |
210 | ||
211 | \(fn X Y)" nil nil) | |
212 | ||
5c4133cb | 213 | (autoload 'list-length "cl-extra" "\ |
d1b8746d SM |
214 | Return the length of list X. Return nil if list is circular. |
215 | ||
216 | \(fn X)" nil nil) | |
217 | ||
5c4133cb | 218 | (autoload 'tailp "cl-extra" "\ |
d1b8746d SM |
219 | Return true if SUBLIST is a tail of LIST. |
220 | ||
221 | \(fn SUBLIST LIST)" nil nil) | |
222 | ||
5c4133cb | 223 | (autoload 'get* "cl-extra" "\ |
d1b8746d SM |
224 | Return the value of SYMBOL's PROPNAME property, or DEFAULT if none. |
225 | ||
226 | \(fn SYMBOL PROPNAME &optional DEFAULT)" nil nil) | |
227 | ||
5c4133cb | 228 | (autoload 'getf "cl-extra" "\ |
d1b8746d SM |
229 | Search PROPLIST for property PROPNAME; return its value or DEFAULT. |
230 | PROPLIST is a list of the sort returned by `symbol-plist'. | |
231 | ||
232 | \(fn PROPLIST PROPNAME &optional DEFAULT)" nil nil) | |
233 | ||
5c4133cb | 234 | (autoload 'cl-set-getf "cl-extra" "\ |
01db225d | 235 | |
d1b8746d SM |
236 | |
237 | \(fn PLIST TAG VAL)" nil nil) | |
238 | ||
5c4133cb | 239 | (autoload 'cl-do-remf "cl-extra" "\ |
01db225d | 240 | |
d1b8746d SM |
241 | |
242 | \(fn PLIST TAG)" nil nil) | |
243 | ||
5c4133cb | 244 | (autoload 'cl-remprop "cl-extra" "\ |
d1b8746d SM |
245 | Remove from SYMBOL's plist the property PROPNAME and its value. |
246 | ||
247 | \(fn SYMBOL PROPNAME)" nil nil) | |
248 | ||
5c4133cb | 249 | (defalias 'remprop 'cl-remprop) |
d1b8746d | 250 | |
5c4133cb | 251 | (defalias 'cl-gethash 'gethash) |
d1b8746d | 252 | |
5c4133cb | 253 | (defalias 'cl-puthash 'puthash) |
d1b8746d | 254 | |
5c4133cb | 255 | (defalias 'cl-remhash 'remhash) |
d1b8746d | 256 | |
5c4133cb | 257 | (defalias 'cl-clrhash 'clrhash) |
d1b8746d | 258 | |
5c4133cb | 259 | (defalias 'cl-maphash 'maphash) |
d1b8746d | 260 | |
5c4133cb | 261 | (defalias 'cl-make-hash-table 'make-hash-table) |
d1b8746d | 262 | |
5c4133cb | 263 | (defalias 'cl-hash-table-p 'hash-table-p) |
d1b8746d | 264 | |
5c4133cb | 265 | (defalias 'cl-hash-table-count 'hash-table-count) |
d1b8746d | 266 | |
5c4133cb | 267 | (autoload 'cl-macroexpand-all "cl-extra" "\ |
d1b8746d SM |
268 | Expand all macro calls through a Lisp FORM. |
269 | This also does some trivial optimizations to make the form prettier. | |
270 | ||
271 | \(fn FORM &optional ENV)" nil nil) | |
272 | ||
5c4133cb | 273 | (autoload 'cl-prettyexpand "cl-extra" "\ |
01db225d | 274 | |
d1b8746d SM |
275 | |
276 | \(fn FORM &optional FULL)" nil nil) | |
277 | ||
278 | ;;;*** | |
279 | \f | |
eb123b12 GM |
280 | ;;;### (autoloads (defsubst* compiler-macroexpand define-compiler-macro |
281 | ;;;;;; assert check-type typep deftype cl-struct-setf-expander defstruct | |
c93d41ba CY |
282 | ;;;;;; define-modify-macro callf2 callf letf* letf rotatef shiftf |
283 | ;;;;;; remf cl-do-pop psetf setf get-setf-method defsetf define-setf-method | |
ba83908c SM |
284 | ;;;;;; declare the locally multiple-value-setq multiple-value-bind |
285 | ;;;;;; lexical-let* lexical-let symbol-macrolet macrolet labels | |
286 | ;;;;;; flet progv psetq do-all-symbols do-symbols dotimes dolist | |
287 | ;;;;;; do* do loop return-from return block etypecase typecase ecase | |
288 | ;;;;;; case load-time-value eval-when destructuring-bind function* | |
e7f32283 | 289 | ;;;;;; defmacro* defun* gentemp gensym) "cl-macs" "cl-macs.el" "609f133b406e41ac5609fcd85e3f23de") |
d1b8746d SM |
290 | ;;; Generated autoloads from cl-macs.el |
291 | ||
5e4599b8 | 292 | (autoload 'gensym "cl-macs" "\ |
d1b8746d SM |
293 | Generate a new uninterned symbol. |
294 | The name is made by appending a number to PREFIX, default \"G\". | |
295 | ||
296 | \(fn &optional PREFIX)" nil nil) | |
297 | ||
5e4599b8 | 298 | (autoload 'gentemp "cl-macs" "\ |
d1b8746d SM |
299 | Generate a new interned symbol with a unique name. |
300 | The name is made by appending a number to PREFIX, default \"G\". | |
301 | ||
302 | \(fn &optional PREFIX)" nil nil) | |
303 | ||
5e4599b8 | 304 | (autoload 'defun* "cl-macs" "\ |
d1b8746d SM |
305 | Define NAME as a function. |
306 | Like normal `defun', except ARGLIST allows full Common Lisp conventions, | |
307 | and BODY is implicitly surrounded by (block NAME ...). | |
308 | ||
03fef3e6 | 309 | \(fn NAME ARGLIST [DOCSTRING] BODY...)" nil t) |
b581bb5c SM |
310 | |
311 | (put 'defun* 'doc-string-elt '3) | |
312 | ||
03fef3e6 SM |
313 | (put 'defun* 'lisp-indent-function '2) |
314 | ||
5e4599b8 | 315 | (autoload 'defmacro* "cl-macs" "\ |
d1b8746d SM |
316 | Define NAME as a macro. |
317 | Like normal `defmacro', except ARGLIST allows full Common Lisp conventions, | |
318 | and BODY is implicitly surrounded by (block NAME ...). | |
319 | ||
03fef3e6 | 320 | \(fn NAME ARGLIST [DOCSTRING] BODY...)" nil t) |
b581bb5c SM |
321 | |
322 | (put 'defmacro* 'doc-string-elt '3) | |
323 | ||
03fef3e6 SM |
324 | (put 'defmacro* 'lisp-indent-function '2) |
325 | ||
5e4599b8 | 326 | (autoload 'function* "cl-macs" "\ |
d1b8746d SM |
327 | Introduce a function. |
328 | Like normal `function', except that if argument is a lambda form, | |
329 | its argument list allows full Common Lisp conventions. | |
330 | ||
03fef3e6 | 331 | \(fn FUNC)" nil t) |
d1b8746d | 332 | |
5e4599b8 | 333 | (autoload 'destructuring-bind "cl-macs" "\ |
0d6459df | 334 | |
d1b8746d | 335 | |
03fef3e6 | 336 | \(fn ARGS EXPR &rest BODY)" nil t) |
d1b8746d | 337 | |
b581bb5c SM |
338 | (put 'destructuring-bind 'lisp-indent-function '2) |
339 | ||
5e4599b8 | 340 | (autoload 'eval-when "cl-macs" "\ |
d1b8746d SM |
341 | Control when BODY is evaluated. |
342 | If `compile' is in WHEN, BODY is evaluated when compiled at top-level. | |
343 | If `load' is in WHEN, BODY is evaluated when loaded after top-level compile. | |
344 | If `eval' is in WHEN, BODY is evaluated when interpreted or at non-top-level. | |
345 | ||
03fef3e6 | 346 | \(fn (WHEN...) BODY...)" nil t) |
d1b8746d | 347 | |
b581bb5c SM |
348 | (put 'eval-when 'lisp-indent-function '1) |
349 | ||
5e4599b8 | 350 | (autoload 'load-time-value "cl-macs" "\ |
d1b8746d SM |
351 | Like `progn', but evaluates the body at load time. |
352 | The result of the body appears to the compiler as a quoted constant. | |
353 | ||
03fef3e6 | 354 | \(fn FORM &optional READ-ONLY)" nil t) |
d1b8746d | 355 | |
5e4599b8 | 356 | (autoload 'case "cl-macs" "\ |
d1b8746d SM |
357 | Eval EXPR and choose among clauses on that value. |
358 | Each clause looks like (KEYLIST BODY...). EXPR is evaluated and compared | |
359 | against each key in each KEYLIST; the corresponding BODY is evaluated. | |
360 | If no clause succeeds, case returns nil. A single atom may be used in | |
361 | place of a KEYLIST of one atom. A KEYLIST of t or `otherwise' is | |
362 | allowed only in the final clause, and matches if no other keys match. | |
363 | Key values are compared by `eql'. | |
364 | ||
03fef3e6 | 365 | \(fn EXPR (KEYLIST BODY...)...)" nil t) |
d1b8746d | 366 | |
b581bb5c SM |
367 | (put 'case 'lisp-indent-function '1) |
368 | ||
5e4599b8 | 369 | (autoload 'ecase "cl-macs" "\ |
d1b8746d SM |
370 | Like `case', but error if no case fits. |
371 | `otherwise'-clauses are not allowed. | |
372 | ||
03fef3e6 | 373 | \(fn EXPR (KEYLIST BODY...)...)" nil t) |
d1b8746d | 374 | |
b581bb5c SM |
375 | (put 'ecase 'lisp-indent-function '1) |
376 | ||
5e4599b8 | 377 | (autoload 'typecase "cl-macs" "\ |
d1b8746d SM |
378 | Evals EXPR, chooses among clauses on that value. |
379 | Each clause looks like (TYPE BODY...). EXPR is evaluated and, if it | |
380 | satisfies TYPE, the corresponding BODY is evaluated. If no clause succeeds, | |
381 | typecase returns nil. A TYPE of t or `otherwise' is allowed only in the | |
382 | final clause, and matches if no other keys match. | |
383 | ||
03fef3e6 | 384 | \(fn EXPR (TYPE BODY...)...)" nil t) |
d1b8746d | 385 | |
b581bb5c SM |
386 | (put 'typecase 'lisp-indent-function '1) |
387 | ||
5e4599b8 | 388 | (autoload 'etypecase "cl-macs" "\ |
d1b8746d SM |
389 | Like `typecase', but error if no case fits. |
390 | `otherwise'-clauses are not allowed. | |
391 | ||
03fef3e6 | 392 | \(fn EXPR (TYPE BODY...)...)" nil t) |
d1b8746d | 393 | |
b581bb5c SM |
394 | (put 'etypecase 'lisp-indent-function '1) |
395 | ||
5e4599b8 | 396 | (autoload 'block "cl-macs" "\ |
d1b8746d SM |
397 | Define a lexically-scoped block named NAME. |
398 | NAME may be any symbol. Code inside the BODY forms can call `return-from' | |
399 | to jump prematurely out of the block. This differs from `catch' and `throw' | |
400 | in two respects: First, the NAME is an unevaluated symbol rather than a | |
401 | quoted symbol or other form; and second, NAME is lexically rather than | |
402 | dynamically scoped: Only references to it within BODY will work. These | |
403 | references may appear inside macro expansions, but not inside functions | |
404 | called from BODY. | |
405 | ||
03fef3e6 | 406 | \(fn NAME &rest BODY)" nil t) |
d1b8746d | 407 | |
b581bb5c SM |
408 | (put 'block 'lisp-indent-function '1) |
409 | ||
5e4599b8 | 410 | (autoload 'return "cl-macs" "\ |
d1b8746d SM |
411 | Return from the block named nil. |
412 | This is equivalent to `(return-from nil RESULT)'. | |
413 | ||
03fef3e6 | 414 | \(fn &optional RESULT)" nil t) |
d1b8746d | 415 | |
5e4599b8 | 416 | (autoload 'return-from "cl-macs" "\ |
d1b8746d | 417 | Return from the block named NAME. |
50c822bd | 418 | This jumps out to the innermost enclosing `(block NAME ...)' form, |
d1b8746d SM |
419 | returning RESULT from that form (or nil if RESULT is omitted). |
420 | This is compatible with Common Lisp, but note that `defun' and | |
421 | `defmacro' do not create implicit blocks as they do in Common Lisp. | |
422 | ||
03fef3e6 | 423 | \(fn NAME &optional RESULT)" nil t) |
d1b8746d | 424 | |
b581bb5c SM |
425 | (put 'return-from 'lisp-indent-function '1) |
426 | ||
5e4599b8 | 427 | (autoload 'loop "cl-macs" "\ |
d1b8746d SM |
428 | The Common Lisp `loop' macro. |
429 | Valid clauses are: | |
430 | for VAR from/upfrom/downfrom NUM to/upto/downto/above/below NUM by NUM, | |
431 | for VAR in LIST by FUNC, for VAR on LIST by FUNC, for VAR = INIT then EXPR, | |
432 | for VAR across ARRAY, repeat NUM, with VAR = INIT, while COND, until COND, | |
433 | always COND, never COND, thereis COND, collect EXPR into VAR, | |
434 | append EXPR into VAR, nconc EXPR into VAR, sum EXPR into VAR, | |
435 | count EXPR into VAR, maximize EXPR into VAR, minimize EXPR into VAR, | |
436 | if COND CLAUSE [and CLAUSE]... else CLAUSE [and CLAUSE...], | |
437 | unless COND CLAUSE [and CLAUSE]... else CLAUSE [and CLAUSE...], | |
438 | do EXPRS..., initially EXPRS..., finally EXPRS..., return EXPR, | |
439 | finally return EXPR, named NAME. | |
440 | ||
03fef3e6 | 441 | \(fn CLAUSE...)" nil t) |
d1b8746d | 442 | |
5e4599b8 | 443 | (autoload 'do "cl-macs" "\ |
d1b8746d SM |
444 | The Common Lisp `do' loop. |
445 | ||
03fef3e6 | 446 | \(fn ((VAR INIT [STEP])...) (END-TEST [RESULT...]) BODY...)" nil t) |
d1b8746d | 447 | |
b581bb5c SM |
448 | (put 'do 'lisp-indent-function '2) |
449 | ||
5e4599b8 | 450 | (autoload 'do* "cl-macs" "\ |
d1b8746d SM |
451 | The Common Lisp `do*' loop. |
452 | ||
03fef3e6 | 453 | \(fn ((VAR INIT [STEP])...) (END-TEST [RESULT...]) BODY...)" nil t) |
d1b8746d | 454 | |
b581bb5c SM |
455 | (put 'do* 'lisp-indent-function '2) |
456 | ||
5e4599b8 | 457 | (autoload 'dolist "cl-macs" "\ |
d1b8746d SM |
458 | Loop over a list. |
459 | Evaluate BODY with VAR bound to each `car' from LIST, in turn. | |
460 | Then evaluate RESULT to get return value, default nil. | |
568352e7 | 461 | An implicit nil block is established around the loop. |
d1b8746d | 462 | |
03fef3e6 | 463 | \(fn (VAR LIST [RESULT]) BODY...)" nil t) |
d1b8746d | 464 | |
5e4599b8 | 465 | (autoload 'dotimes "cl-macs" "\ |
d1b8746d SM |
466 | Loop a certain number of times. |
467 | Evaluate BODY with VAR bound to successive integers from 0, inclusive, | |
468 | to COUNT, exclusive. Then evaluate RESULT to get return value, default | |
469 | nil. | |
470 | ||
03fef3e6 | 471 | \(fn (VAR COUNT [RESULT]) BODY...)" nil t) |
d1b8746d | 472 | |
5e4599b8 | 473 | (autoload 'do-symbols "cl-macs" "\ |
d1b8746d SM |
474 | Loop over all symbols. |
475 | Evaluate BODY with VAR bound to each interned symbol, or to each symbol | |
476 | from OBARRAY. | |
477 | ||
03fef3e6 | 478 | \(fn (VAR [OBARRAY [RESULT]]) BODY...)" nil t) |
d1b8746d | 479 | |
b581bb5c SM |
480 | (put 'do-symbols 'lisp-indent-function '1) |
481 | ||
5e4599b8 | 482 | (autoload 'do-all-symbols "cl-macs" "\ |
0d6459df | 483 | |
d1b8746d | 484 | |
03fef3e6 | 485 | \(fn SPEC &rest BODY)" nil t) |
d1b8746d | 486 | |
b581bb5c SM |
487 | (put 'do-all-symbols 'lisp-indent-function '1) |
488 | ||
5e4599b8 | 489 | (autoload 'psetq "cl-macs" "\ |
d1b8746d SM |
490 | Set SYMs to the values VALs in parallel. |
491 | This is like `setq', except that all VAL forms are evaluated (in order) | |
492 | before assigning any symbols SYM to the corresponding values. | |
493 | ||
03fef3e6 | 494 | \(fn SYM VAL SYM VAL ...)" nil t) |
d1b8746d | 495 | |
5e4599b8 | 496 | (autoload 'progv "cl-macs" "\ |
d1b8746d SM |
497 | Bind SYMBOLS to VALUES dynamically in BODY. |
498 | The forms SYMBOLS and VALUES are evaluated, and must evaluate to lists. | |
499 | Each symbol in the first list is bound to the corresponding value in the | |
500 | second list (or made unbound if VALUES is shorter than SYMBOLS); then the | |
501 | BODY forms are executed and their result is returned. This is much like | |
502 | a `let' form, except that the list of symbols can be computed at run-time. | |
503 | ||
03fef3e6 | 504 | \(fn SYMBOLS VALUES &rest BODY)" nil t) |
d1b8746d | 505 | |
b581bb5c SM |
506 | (put 'progv 'lisp-indent-function '2) |
507 | ||
5e4599b8 | 508 | (autoload 'flet "cl-macs" "\ |
d1b8746d SM |
509 | Make temporary function definitions. |
510 | This is an analogue of `let' that operates on the function cell of FUNC | |
511 | rather than its value cell. The FORMs are evaluated with the specified | |
512 | function definitions in place, then the definitions are undone (the FUNCs | |
513 | go back to their previous definitions, or lack thereof). | |
514 | ||
03fef3e6 | 515 | \(fn ((FUNC ARGLIST BODY...) ...) FORM...)" nil t) |
d1b8746d | 516 | |
b581bb5c SM |
517 | (put 'flet 'lisp-indent-function '1) |
518 | ||
5e4599b8 | 519 | (autoload 'labels "cl-macs" "\ |
d1b8746d SM |
520 | Make temporary function bindings. |
521 | This is like `flet', except the bindings are lexical instead of dynamic. | |
522 | Unlike `flet', this macro is fully compliant with the Common Lisp standard. | |
523 | ||
03fef3e6 | 524 | \(fn ((FUNC ARGLIST BODY...) ...) FORM...)" nil t) |
d1b8746d | 525 | |
b581bb5c SM |
526 | (put 'labels 'lisp-indent-function '1) |
527 | ||
5e4599b8 | 528 | (autoload 'macrolet "cl-macs" "\ |
d1b8746d SM |
529 | Make temporary macro definitions. |
530 | This is like `flet', but for macros instead of functions. | |
531 | ||
03fef3e6 | 532 | \(fn ((NAME ARGLIST BODY...) ...) FORM...)" nil t) |
d1b8746d | 533 | |
b581bb5c SM |
534 | (put 'macrolet 'lisp-indent-function '1) |
535 | ||
5e4599b8 | 536 | (autoload 'symbol-macrolet "cl-macs" "\ |
d1b8746d SM |
537 | Make symbol macro definitions. |
538 | Within the body FORMs, references to the variable NAME will be replaced | |
539 | by EXPANSION, and (setq NAME ...) will act like (setf EXPANSION ...). | |
540 | ||
03fef3e6 | 541 | \(fn ((NAME EXPANSION) ...) FORM...)" nil t) |
d1b8746d | 542 | |
b581bb5c SM |
543 | (put 'symbol-macrolet 'lisp-indent-function '1) |
544 | ||
5e4599b8 | 545 | (autoload 'lexical-let "cl-macs" "\ |
d1b8746d SM |
546 | Like `let', but lexically scoped. |
547 | The main visible difference is that lambdas inside BODY will create | |
548 | lexical closures as in Common Lisp. | |
549 | ||
03fef3e6 | 550 | \(fn BINDINGS BODY)" nil t) |
d1b8746d | 551 | |
b581bb5c SM |
552 | (put 'lexical-let 'lisp-indent-function '1) |
553 | ||
5e4599b8 | 554 | (autoload 'lexical-let* "cl-macs" "\ |
d1b8746d | 555 | Like `let*', but lexically scoped. |
ae232225 | 556 | The main visible difference is that lambdas inside BODY, and in |
cafdcef3 | 557 | successive bindings within BINDINGS, will create lexical closures |
ae232225 JB |
558 | as in Common Lisp. This is similar to the behavior of `let*' in |
559 | Common Lisp. | |
d1b8746d | 560 | |
03fef3e6 | 561 | \(fn BINDINGS BODY)" nil t) |
d1b8746d | 562 | |
b581bb5c SM |
563 | (put 'lexical-let* 'lisp-indent-function '1) |
564 | ||
5e4599b8 | 565 | (autoload 'multiple-value-bind "cl-macs" "\ |
d1b8746d SM |
566 | Collect multiple return values. |
567 | FORM must return a list; the BODY is then executed with the first N elements | |
568 | of this list bound (`let'-style) to each of the symbols SYM in turn. This | |
569 | is analogous to the Common Lisp `multiple-value-bind' macro, using lists to | |
570 | simulate true multiple return values. For compatibility, (values A B C) is | |
571 | a synonym for (list A B C). | |
572 | ||
03fef3e6 | 573 | \(fn (SYM...) FORM BODY)" nil t) |
d1b8746d | 574 | |
b581bb5c SM |
575 | (put 'multiple-value-bind 'lisp-indent-function '2) |
576 | ||
5e4599b8 | 577 | (autoload 'multiple-value-setq "cl-macs" "\ |
d1b8746d SM |
578 | Collect multiple return values. |
579 | FORM must return a list; the first N elements of this list are stored in | |
580 | each of the symbols SYM in turn. This is analogous to the Common Lisp | |
581 | `multiple-value-setq' macro, using lists to simulate true multiple return | |
582 | values. For compatibility, (values A B C) is a synonym for (list A B C). | |
583 | ||
03fef3e6 | 584 | \(fn (SYM...) FORM)" nil t) |
d1b8746d | 585 | |
b581bb5c SM |
586 | (put 'multiple-value-setq 'lisp-indent-function '1) |
587 | ||
5e4599b8 | 588 | (autoload 'locally "cl-macs" "\ |
0d6459df | 589 | |
d1b8746d | 590 | |
03fef3e6 | 591 | \(fn &rest BODY)" nil t) |
d1b8746d | 592 | |
ba83908c SM |
593 | (autoload 'the "cl-macs" "\ |
594 | ||
595 | ||
03fef3e6 | 596 | \(fn TYPE FORM)" nil t) |
ba83908c | 597 | |
b581bb5c SM |
598 | (put 'the 'lisp-indent-function '1) |
599 | ||
5e4599b8 | 600 | (autoload 'declare "cl-macs" "\ |
7b41decb | 601 | Declare SPECS about the current function while compiling. |
1b5eaeb3 | 602 | For instance |
0d6459df | 603 | |
1b5eaeb3 LMI |
604 | (declare (warn 0)) |
605 | ||
7b41decb LMI |
606 | will turn off byte-compile warnings in the function. |
607 | See Info node `(cl)Declarations' for details. | |
d1b8746d | 608 | |
03fef3e6 | 609 | \(fn &rest SPECS)" nil t) |
d1b8746d | 610 | |
5e4599b8 | 611 | (autoload 'define-setf-method "cl-macs" "\ |
d1b8746d SM |
612 | Define a `setf' method. |
613 | This method shows how to handle `setf's to places of the form (NAME ARGS...). | |
614 | The argument forms ARGS are bound according to ARGLIST, as if NAME were | |
615 | going to be expanded as a macro, then the BODY forms are executed and must | |
616 | return a list of five elements: a temporary-variables list, a value-forms | |
617 | list, a store-variables list (of length one), a store-form, and an access- | |
618 | form. See `defsetf' for a simpler way to define most setf-methods. | |
619 | ||
03fef3e6 | 620 | \(fn NAME ARGLIST BODY...)" nil t) |
d1b8746d | 621 | |
5e4599b8 | 622 | (autoload 'defsetf "cl-macs" "\ |
a2fb8c1e | 623 | Define a `setf' method. |
d1b8746d SM |
624 | This macro is an easy-to-use substitute for `define-setf-method' that works |
625 | well for simple place forms. In the simple `defsetf' form, `setf's of | |
626 | the form (setf (NAME ARGS...) VAL) are transformed to function or macro | |
627 | calls of the form (FUNC ARGS... VAL). Example: | |
628 | ||
629 | (defsetf aref aset) | |
630 | ||
631 | Alternate form: (defsetf NAME ARGLIST (STORE) BODY...). | |
632 | Here, the above `setf' call is expanded by binding the argument forms ARGS | |
633 | according to ARGLIST, binding the value form VAL to STORE, then executing | |
634 | BODY, which must return a Lisp form that does the necessary `setf' operation. | |
635 | Actually, ARGLIST and STORE may be bound to temporary variables which are | |
636 | introduced automatically to preserve proper execution order of the arguments. | |
637 | Example: | |
638 | ||
03fef3e6 | 639 | (defsetf nth (n x) (v) `(setcar (nthcdr ,n ,x) ,v)) |
d1b8746d | 640 | |
03fef3e6 | 641 | \(fn NAME [FUNC | ARGLIST (STORE) BODY...])" nil t) |
d1b8746d | 642 | |
5e4599b8 | 643 | (autoload 'get-setf-method "cl-macs" "\ |
d1b8746d SM |
644 | Return a list of five values describing the setf-method for PLACE. |
645 | PLACE may be any Lisp form which can appear as the PLACE argument to | |
646 | a macro like `setf' or `incf'. | |
647 | ||
648 | \(fn PLACE &optional ENV)" nil nil) | |
649 | ||
5e4599b8 | 650 | (autoload 'setf "cl-macs" "\ |
d1b8746d SM |
651 | Set each PLACE to the value of its VAL. |
652 | This is a generalized version of `setq'; the PLACEs may be symbolic | |
653 | references such as (car x) or (aref x i), as well as plain symbols. | |
654 | For example, (setf (cadar x) y) is equivalent to (setcar (cdar x) y). | |
655 | The return value is the last VAL in the list. | |
656 | ||
03fef3e6 | 657 | \(fn PLACE VAL PLACE VAL ...)" nil t) |
d1b8746d | 658 | |
5e4599b8 | 659 | (autoload 'psetf "cl-macs" "\ |
d1b8746d SM |
660 | Set PLACEs to the values VALs in parallel. |
661 | This is like `setf', except that all VAL forms are evaluated (in order) | |
662 | before assigning any PLACEs to the corresponding values. | |
663 | ||
03fef3e6 | 664 | \(fn PLACE VAL PLACE VAL ...)" nil t) |
d1b8746d | 665 | |
5e4599b8 | 666 | (autoload 'cl-do-pop "cl-macs" "\ |
0d6459df | 667 | |
d1b8746d SM |
668 | |
669 | \(fn PLACE)" nil nil) | |
670 | ||
5e4599b8 | 671 | (autoload 'remf "cl-macs" "\ |
d1b8746d SM |
672 | Remove TAG from property list PLACE. |
673 | PLACE may be a symbol, or any generalized variable allowed by `setf'. | |
674 | The form returns true if TAG was found and removed, nil otherwise. | |
675 | ||
03fef3e6 | 676 | \(fn PLACE TAG)" nil t) |
d1b8746d | 677 | |
5e4599b8 | 678 | (autoload 'shiftf "cl-macs" "\ |
d1b8746d SM |
679 | Shift left among PLACEs. |
680 | Example: (shiftf A B C) sets A to B, B to C, and returns the old A. | |
681 | Each PLACE may be a symbol, or any generalized variable allowed by `setf'. | |
682 | ||
03fef3e6 | 683 | \(fn PLACE... VAL)" nil t) |
d1b8746d | 684 | |
5e4599b8 | 685 | (autoload 'rotatef "cl-macs" "\ |
d1b8746d SM |
686 | Rotate left among PLACEs. |
687 | Example: (rotatef A B C) sets A to B, B to C, and C to A. It returns nil. | |
688 | Each PLACE may be a symbol, or any generalized variable allowed by `setf'. | |
689 | ||
03fef3e6 | 690 | \(fn PLACE...)" nil t) |
d1b8746d | 691 | |
5e4599b8 | 692 | (autoload 'letf "cl-macs" "\ |
d1b8746d SM |
693 | Temporarily bind to PLACEs. |
694 | This is the analogue of `let', but with generalized variables (in the | |
695 | sense of `setf') for the PLACEs. Each PLACE is set to the corresponding | |
696 | VALUE, then the BODY forms are executed. On exit, either normally or | |
697 | because of a `throw' or error, the PLACEs are set back to their original | |
698 | values. Note that this macro is *not* available in Common Lisp. | |
699 | As a special case, if `(PLACE)' is used instead of `(PLACE VALUE)', | |
700 | the PLACE is not modified before executing BODY. | |
701 | ||
03fef3e6 | 702 | \(fn ((PLACE VALUE) ...) BODY...)" nil t) |
d1b8746d | 703 | |
b581bb5c SM |
704 | (put 'letf 'lisp-indent-function '1) |
705 | ||
5e4599b8 | 706 | (autoload 'letf* "cl-macs" "\ |
d1b8746d SM |
707 | Temporarily bind to PLACEs. |
708 | This is the analogue of `let*', but with generalized variables (in the | |
709 | sense of `setf') for the PLACEs. Each PLACE is set to the corresponding | |
710 | VALUE, then the BODY forms are executed. On exit, either normally or | |
711 | because of a `throw' or error, the PLACEs are set back to their original | |
712 | values. Note that this macro is *not* available in Common Lisp. | |
713 | As a special case, if `(PLACE)' is used instead of `(PLACE VALUE)', | |
714 | the PLACE is not modified before executing BODY. | |
715 | ||
03fef3e6 | 716 | \(fn ((PLACE VALUE) ...) BODY...)" nil t) |
d1b8746d | 717 | |
b581bb5c SM |
718 | (put 'letf* 'lisp-indent-function '1) |
719 | ||
5e4599b8 | 720 | (autoload 'callf "cl-macs" "\ |
d1b8746d SM |
721 | Set PLACE to (FUNC PLACE ARGS...). |
722 | FUNC should be an unquoted function name. PLACE may be a symbol, | |
723 | or any generalized variable allowed by `setf'. | |
724 | ||
03fef3e6 | 725 | \(fn FUNC PLACE ARGS...)" nil t) |
d1b8746d | 726 | |
b581bb5c SM |
727 | (put 'callf 'lisp-indent-function '2) |
728 | ||
5e4599b8 | 729 | (autoload 'callf2 "cl-macs" "\ |
d1b8746d SM |
730 | Set PLACE to (FUNC ARG1 PLACE ARGS...). |
731 | Like `callf', but PLACE is the second argument of FUNC, not the first. | |
732 | ||
03fef3e6 | 733 | \(fn FUNC ARG1 PLACE ARGS...)" nil t) |
d1b8746d | 734 | |
b581bb5c SM |
735 | (put 'callf2 'lisp-indent-function '3) |
736 | ||
5e4599b8 | 737 | (autoload 'define-modify-macro "cl-macs" "\ |
d1b8746d SM |
738 | Define a `setf'-like modify macro. |
739 | If NAME is called, it combines its PLACE argument with the other arguments | |
740 | from ARGLIST using FUNC: (define-modify-macro incf (&optional (n 1)) +) | |
741 | ||
03fef3e6 | 742 | \(fn NAME ARGLIST FUNC &optional DOC)" nil t) |
d1b8746d | 743 | |
5e4599b8 | 744 | (autoload 'defstruct "cl-macs" "\ |
d1b8746d | 745 | Define a struct type. |
c7dc1ac1 CY |
746 | This macro defines a new data type called NAME that stores data |
747 | in SLOTs. It defines a `make-NAME' constructor, a `copy-NAME' | |
748 | copier, a `NAME-p' predicate, and slot accessors named `NAME-SLOT'. | |
749 | You can use the accessors to set the corresponding slots, via `setf'. | |
d1b8746d | 750 | |
c7dc1ac1 CY |
751 | NAME may instead take the form (NAME OPTIONS...), where each |
752 | OPTION is either a single keyword or (KEYWORD VALUE). | |
753 | See Info node `(cl)Structures' for a list of valid keywords. | |
754 | ||
755 | Each SLOT may instead take the form (SLOT SLOT-OPTS...), where | |
756 | SLOT-OPTS are keyword-value pairs for that slot. Currently, only | |
757 | one keyword is supported, `:read-only'. If this has a non-nil | |
758 | value, that slot cannot be set via `setf'. | |
759 | ||
03fef3e6 | 760 | \(fn NAME SLOTS...)" nil t) |
d1b8746d | 761 | |
b581bb5c SM |
762 | (put 'defstruct 'doc-string-elt '2) |
763 | ||
5e4599b8 | 764 | (autoload 'cl-struct-setf-expander "cl-macs" "\ |
0d6459df | 765 | |
d1b8746d SM |
766 | |
767 | \(fn X NAME ACCESSOR PRED-FORM POS)" nil nil) | |
768 | ||
c93d41ba CY |
769 | (autoload 'deftype "cl-macs" "\ |
770 | Define NAME as a new data type. | |
771 | The type name can then be used in `typecase', `check-type', etc. | |
772 | ||
03fef3e6 | 773 | \(fn NAME ARGLIST &rest BODY)" nil t) |
c93d41ba | 774 | |
b581bb5c SM |
775 | (put 'deftype 'doc-string-elt '3) |
776 | ||
5e4599b8 | 777 | (autoload 'typep "cl-macs" "\ |
d1b8746d SM |
778 | Check that OBJECT is of type TYPE. |
779 | TYPE is a Common Lisp-style type specifier. | |
780 | ||
781 | \(fn OBJECT TYPE)" nil nil) | |
782 | ||
5e4599b8 | 783 | (autoload 'check-type "cl-macs" "\ |
d1b8746d SM |
784 | Verify that FORM is of type TYPE; signal an error if not. |
785 | STRING is an optional description of the desired type. | |
786 | ||
03fef3e6 | 787 | \(fn FORM TYPE &optional STRING)" nil t) |
d1b8746d | 788 | |
5e4599b8 | 789 | (autoload 'assert "cl-macs" "\ |
d1b8746d SM |
790 | Verify that FORM returns non-nil; signal an error if not. |
791 | Second arg SHOW-ARGS means to include arguments of FORM in message. | |
792 | Other args STRING and ARGS... are arguments to be passed to `error'. | |
793 | They are not evaluated unless the assertion fails. If STRING is | |
794 | omitted, a default message listing FORM itself is used. | |
795 | ||
03fef3e6 | 796 | \(fn FORM &optional SHOW-ARGS STRING &rest ARGS)" nil t) |
d1b8746d | 797 | |
5e4599b8 | 798 | (autoload 'define-compiler-macro "cl-macs" "\ |
d1b8746d SM |
799 | Define a compiler-only macro. |
800 | This is like `defmacro', but macro expansion occurs only if the call to | |
801 | FUNC is compiled (i.e., not interpreted). Compiler macros should be used | |
802 | for optimizing the way calls to FUNC are compiled; the form returned by | |
803 | BODY should do the same thing as a call to the normal function called | |
804 | FUNC, though possibly more efficiently. Note that, like regular macros, | |
805 | compiler macros are expanded repeatedly until no further expansions are | |
806 | possible. Unlike regular macros, BODY can decide to \"punt\" and leave the | |
807 | original function call alone by declaring an initial `&whole foo' parameter | |
808 | and then returning foo. | |
809 | ||
03fef3e6 | 810 | \(fn FUNC ARGS &rest BODY)" nil t) |
d1b8746d | 811 | |
5e4599b8 | 812 | (autoload 'compiler-macroexpand "cl-macs" "\ |
0d6459df | 813 | |
d1b8746d SM |
814 | |
815 | \(fn FORM)" nil nil) | |
816 | ||
eb123b12 GM |
817 | (autoload 'defsubst* "cl-macs" "\ |
818 | Define NAME as a function. | |
819 | Like `defun', except the function is automatically declared `inline', | |
820 | ARGLIST allows full Common Lisp conventions, and BODY is implicitly | |
821 | surrounded by (block NAME ...). | |
822 | ||
03fef3e6 | 823 | \(fn NAME ARGLIST [DOCSTRING] BODY...)" nil t) |
eb123b12 | 824 | |
d1b8746d SM |
825 | ;;;*** |
826 | \f | |
827 | ;;;### (autoloads (tree-equal nsublis sublis nsubst-if-not nsubst-if | |
828 | ;;;;;; nsubst subst-if-not subst-if subsetp nset-exclusive-or set-exclusive-or | |
829 | ;;;;;; nset-difference set-difference nintersection intersection | |
830 | ;;;;;; nunion union rassoc-if-not rassoc-if rassoc* assoc-if-not | |
4735906a | 831 | ;;;;;; assoc-if assoc* cl--adjoin member-if-not member-if member* |
d1b8746d SM |
832 | ;;;;;; merge stable-sort sort* search mismatch count-if-not count-if |
833 | ;;;;;; count position-if-not position-if position find-if-not find-if | |
834 | ;;;;;; find nsubstitute-if-not nsubstitute-if nsubstitute substitute-if-not | |
835 | ;;;;;; substitute-if substitute delete-duplicates remove-duplicates | |
836 | ;;;;;; delete-if-not delete-if delete* remove-if-not remove-if remove* | |
4735906a | 837 | ;;;;;; replace fill reduce) "cl-seq" "cl-seq.el" "2d8563fcbdf4bc77e569d0aeb0a35cfc") |
d1b8746d SM |
838 | ;;; Generated autoloads from cl-seq.el |
839 | ||
fc5e09b3 | 840 | (autoload 'reduce "cl-seq" "\ |
d1b8746d SM |
841 | Reduce two-argument FUNCTION across SEQ. |
842 | ||
843 | Keywords supported: :start :end :from-end :initial-value :key | |
844 | ||
845 | \(fn FUNCTION SEQ [KEYWORD VALUE]...)" nil nil) | |
846 | ||
fc5e09b3 | 847 | (autoload 'fill "cl-seq" "\ |
d1b8746d SM |
848 | Fill the elements of SEQ with ITEM. |
849 | ||
850 | Keywords supported: :start :end | |
851 | ||
852 | \(fn SEQ ITEM [KEYWORD VALUE]...)" nil nil) | |
853 | ||
fc5e09b3 | 854 | (autoload 'replace "cl-seq" "\ |
d1b8746d SM |
855 | Replace the elements of SEQ1 with the elements of SEQ2. |
856 | SEQ1 is destructively modified, then returned. | |
857 | ||
858 | Keywords supported: :start1 :end1 :start2 :end2 | |
859 | ||
860 | \(fn SEQ1 SEQ2 [KEYWORD VALUE]...)" nil nil) | |
861 | ||
fc5e09b3 | 862 | (autoload 'remove* "cl-seq" "\ |
d1b8746d SM |
863 | Remove all occurrences of ITEM in SEQ. |
864 | This is a non-destructive function; it makes a copy of SEQ if necessary | |
865 | to avoid corrupting the original SEQ. | |
866 | ||
867 | Keywords supported: :test :test-not :key :count :start :end :from-end | |
868 | ||
869 | \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil) | |
870 | ||
fc5e09b3 | 871 | (autoload 'remove-if "cl-seq" "\ |
d1b8746d SM |
872 | Remove all items satisfying PREDICATE in SEQ. |
873 | This is a non-destructive function; it makes a copy of SEQ if necessary | |
874 | to avoid corrupting the original SEQ. | |
875 | ||
876 | Keywords supported: :key :count :start :end :from-end | |
877 | ||
878 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
879 | ||
fc5e09b3 | 880 | (autoload 'remove-if-not "cl-seq" "\ |
d1b8746d SM |
881 | Remove all items not satisfying PREDICATE in SEQ. |
882 | This is a non-destructive function; it makes a copy of SEQ if necessary | |
883 | to avoid corrupting the original SEQ. | |
884 | ||
885 | Keywords supported: :key :count :start :end :from-end | |
886 | ||
887 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
888 | ||
fc5e09b3 | 889 | (autoload 'delete* "cl-seq" "\ |
d1b8746d SM |
890 | Remove all occurrences of ITEM in SEQ. |
891 | This is a destructive function; it reuses the storage of SEQ whenever possible. | |
892 | ||
893 | Keywords supported: :test :test-not :key :count :start :end :from-end | |
894 | ||
895 | \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil) | |
896 | ||
fc5e09b3 | 897 | (autoload 'delete-if "cl-seq" "\ |
d1b8746d SM |
898 | Remove all items satisfying PREDICATE in SEQ. |
899 | This is a destructive function; it reuses the storage of SEQ whenever possible. | |
900 | ||
901 | Keywords supported: :key :count :start :end :from-end | |
902 | ||
903 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
904 | ||
fc5e09b3 | 905 | (autoload 'delete-if-not "cl-seq" "\ |
d1b8746d SM |
906 | Remove all items not satisfying PREDICATE in SEQ. |
907 | This is a destructive function; it reuses the storage of SEQ whenever possible. | |
908 | ||
909 | Keywords supported: :key :count :start :end :from-end | |
910 | ||
911 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
912 | ||
fc5e09b3 | 913 | (autoload 'remove-duplicates "cl-seq" "\ |
d1b8746d SM |
914 | Return a copy of SEQ with all duplicate elements removed. |
915 | ||
916 | Keywords supported: :test :test-not :key :start :end :from-end | |
917 | ||
918 | \(fn SEQ [KEYWORD VALUE]...)" nil nil) | |
919 | ||
fc5e09b3 | 920 | (autoload 'delete-duplicates "cl-seq" "\ |
d1b8746d SM |
921 | Remove all duplicate elements from SEQ (destructively). |
922 | ||
923 | Keywords supported: :test :test-not :key :start :end :from-end | |
924 | ||
925 | \(fn SEQ [KEYWORD VALUE]...)" nil nil) | |
926 | ||
fc5e09b3 | 927 | (autoload 'substitute "cl-seq" "\ |
d1b8746d SM |
928 | Substitute NEW for OLD in SEQ. |
929 | This is a non-destructive function; it makes a copy of SEQ if necessary | |
930 | to avoid corrupting the original SEQ. | |
931 | ||
932 | Keywords supported: :test :test-not :key :count :start :end :from-end | |
933 | ||
934 | \(fn NEW OLD SEQ [KEYWORD VALUE]...)" nil nil) | |
935 | ||
fc5e09b3 | 936 | (autoload 'substitute-if "cl-seq" "\ |
d1b8746d SM |
937 | Substitute NEW for all items satisfying PREDICATE in SEQ. |
938 | This is a non-destructive function; it makes a copy of SEQ if necessary | |
939 | to avoid corrupting the original SEQ. | |
940 | ||
941 | Keywords supported: :key :count :start :end :from-end | |
942 | ||
943 | \(fn NEW PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
944 | ||
fc5e09b3 | 945 | (autoload 'substitute-if-not "cl-seq" "\ |
d1b8746d SM |
946 | Substitute NEW for all items not satisfying PREDICATE in SEQ. |
947 | This is a non-destructive function; it makes a copy of SEQ if necessary | |
948 | to avoid corrupting the original SEQ. | |
949 | ||
950 | Keywords supported: :key :count :start :end :from-end | |
951 | ||
952 | \(fn NEW PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
953 | ||
fc5e09b3 | 954 | (autoload 'nsubstitute "cl-seq" "\ |
d1b8746d SM |
955 | Substitute NEW for OLD in SEQ. |
956 | This is a destructive function; it reuses the storage of SEQ whenever possible. | |
957 | ||
958 | Keywords supported: :test :test-not :key :count :start :end :from-end | |
959 | ||
960 | \(fn NEW OLD SEQ [KEYWORD VALUE]...)" nil nil) | |
961 | ||
fc5e09b3 | 962 | (autoload 'nsubstitute-if "cl-seq" "\ |
d1b8746d SM |
963 | Substitute NEW for all items satisfying PREDICATE in SEQ. |
964 | This is a destructive function; it reuses the storage of SEQ whenever possible. | |
965 | ||
966 | Keywords supported: :key :count :start :end :from-end | |
967 | ||
968 | \(fn NEW PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
969 | ||
fc5e09b3 | 970 | (autoload 'nsubstitute-if-not "cl-seq" "\ |
d1b8746d SM |
971 | Substitute NEW for all items not satisfying PREDICATE in SEQ. |
972 | This is a destructive function; it reuses the storage of SEQ whenever possible. | |
973 | ||
974 | Keywords supported: :key :count :start :end :from-end | |
975 | ||
976 | \(fn NEW PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
977 | ||
fc5e09b3 | 978 | (autoload 'find "cl-seq" "\ |
d1b8746d SM |
979 | Find the first occurrence of ITEM in SEQ. |
980 | Return the matching ITEM, or nil if not found. | |
981 | ||
982 | Keywords supported: :test :test-not :key :start :end :from-end | |
983 | ||
984 | \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil) | |
985 | ||
fc5e09b3 | 986 | (autoload 'find-if "cl-seq" "\ |
d1b8746d SM |
987 | Find the first item satisfying PREDICATE in SEQ. |
988 | Return the matching item, or nil if not found. | |
989 | ||
990 | Keywords supported: :key :start :end :from-end | |
991 | ||
992 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
993 | ||
fc5e09b3 | 994 | (autoload 'find-if-not "cl-seq" "\ |
d1b8746d SM |
995 | Find the first item not satisfying PREDICATE in SEQ. |
996 | Return the matching item, or nil if not found. | |
997 | ||
998 | Keywords supported: :key :start :end :from-end | |
999 | ||
1000 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
1001 | ||
fc5e09b3 | 1002 | (autoload 'position "cl-seq" "\ |
d1b8746d SM |
1003 | Find the first occurrence of ITEM in SEQ. |
1004 | Return the index of the matching item, or nil if not found. | |
1005 | ||
1006 | Keywords supported: :test :test-not :key :start :end :from-end | |
1007 | ||
1008 | \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil) | |
1009 | ||
fc5e09b3 | 1010 | (autoload 'position-if "cl-seq" "\ |
d1b8746d SM |
1011 | Find the first item satisfying PREDICATE in SEQ. |
1012 | Return the index of the matching item, or nil if not found. | |
1013 | ||
1014 | Keywords supported: :key :start :end :from-end | |
1015 | ||
1016 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
1017 | ||
fc5e09b3 | 1018 | (autoload 'position-if-not "cl-seq" "\ |
d1b8746d SM |
1019 | Find the first item not satisfying PREDICATE in SEQ. |
1020 | Return the index of the matching item, or nil if not found. | |
1021 | ||
1022 | Keywords supported: :key :start :end :from-end | |
1023 | ||
1024 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
1025 | ||
fc5e09b3 | 1026 | (autoload 'count "cl-seq" "\ |
d1b8746d SM |
1027 | Count the number of occurrences of ITEM in SEQ. |
1028 | ||
1029 | Keywords supported: :test :test-not :key :start :end | |
1030 | ||
1031 | \(fn ITEM SEQ [KEYWORD VALUE]...)" nil nil) | |
1032 | ||
fc5e09b3 | 1033 | (autoload 'count-if "cl-seq" "\ |
d1b8746d SM |
1034 | Count the number of items satisfying PREDICATE in SEQ. |
1035 | ||
1036 | Keywords supported: :key :start :end | |
1037 | ||
1038 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
1039 | ||
fc5e09b3 | 1040 | (autoload 'count-if-not "cl-seq" "\ |
d1b8746d SM |
1041 | Count the number of items not satisfying PREDICATE in SEQ. |
1042 | ||
1043 | Keywords supported: :key :start :end | |
1044 | ||
1045 | \(fn PREDICATE SEQ [KEYWORD VALUE]...)" nil nil) | |
1046 | ||
fc5e09b3 | 1047 | (autoload 'mismatch "cl-seq" "\ |
d1b8746d SM |
1048 | Compare SEQ1 with SEQ2, return index of first mismatching element. |
1049 | Return nil if the sequences match. If one sequence is a prefix of the | |
1050 | other, the return value indicates the end of the shorter sequence. | |
1051 | ||
1052 | Keywords supported: :test :test-not :key :start1 :end1 :start2 :end2 :from-end | |
1053 | ||
1054 | \(fn SEQ1 SEQ2 [KEYWORD VALUE]...)" nil nil) | |
1055 | ||
fc5e09b3 | 1056 | (autoload 'search "cl-seq" "\ |
d1b8746d SM |
1057 | Search for SEQ1 as a subsequence of SEQ2. |
1058 | Return the index of the leftmost element of the first match found; | |
1059 | return nil if there are no matches. | |
1060 | ||
1061 | Keywords supported: :test :test-not :key :start1 :end1 :start2 :end2 :from-end | |
1062 | ||
1063 | \(fn SEQ1 SEQ2 [KEYWORD VALUE]...)" nil nil) | |
1064 | ||
fc5e09b3 | 1065 | (autoload 'sort* "cl-seq" "\ |
d1b8746d SM |
1066 | Sort the argument SEQ according to PREDICATE. |
1067 | This is a destructive function; it reuses the storage of SEQ if possible. | |
1068 | ||
1069 | Keywords supported: :key | |
1070 | ||
1071 | \(fn SEQ PREDICATE [KEYWORD VALUE]...)" nil nil) | |
1072 | ||
fc5e09b3 | 1073 | (autoload 'stable-sort "cl-seq" "\ |
d1b8746d SM |
1074 | Sort the argument SEQ stably according to PREDICATE. |
1075 | This is a destructive function; it reuses the storage of SEQ if possible. | |
1076 | ||
1077 | Keywords supported: :key | |
1078 | ||
1079 | \(fn SEQ PREDICATE [KEYWORD VALUE]...)" nil nil) | |
1080 | ||
fc5e09b3 | 1081 | (autoload 'merge "cl-seq" "\ |
d1b8746d SM |
1082 | Destructively merge the two sequences to produce a new sequence. |
1083 | TYPE is the sequence type to return, SEQ1 and SEQ2 are the two argument | |
1084 | sequences, and PREDICATE is a `less-than' predicate on the elements. | |
1085 | ||
1086 | Keywords supported: :key | |
1087 | ||
1088 | \(fn TYPE SEQ1 SEQ2 PREDICATE [KEYWORD VALUE]...)" nil nil) | |
1089 | ||
fc5e09b3 | 1090 | (autoload 'member* "cl-seq" "\ |
d1b8746d SM |
1091 | Find the first occurrence of ITEM in LIST. |
1092 | Return the sublist of LIST whose car is ITEM. | |
1093 | ||
1094 | Keywords supported: :test :test-not :key | |
1095 | ||
1096 | \(fn ITEM LIST [KEYWORD VALUE]...)" nil nil) | |
1097 | ||
fc5e09b3 | 1098 | (autoload 'member-if "cl-seq" "\ |
d1b8746d SM |
1099 | Find the first item satisfying PREDICATE in LIST. |
1100 | Return the sublist of LIST whose car matches. | |
1101 | ||
1102 | Keywords supported: :key | |
1103 | ||
1104 | \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil) | |
1105 | ||
fc5e09b3 | 1106 | (autoload 'member-if-not "cl-seq" "\ |
d1b8746d SM |
1107 | Find the first item not satisfying PREDICATE in LIST. |
1108 | Return the sublist of LIST whose car matches. | |
1109 | ||
1110 | Keywords supported: :key | |
1111 | ||
1112 | \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil) | |
1113 | ||
4735906a | 1114 | (autoload 'cl--adjoin "cl-seq" "\ |
cf3304e1 | 1115 | |
d1b8746d SM |
1116 | |
1117 | \(fn CL-ITEM CL-LIST &rest CL-KEYS)" nil nil) | |
1118 | ||
fc5e09b3 | 1119 | (autoload 'assoc* "cl-seq" "\ |
d1b8746d SM |
1120 | Find the first item whose car matches ITEM in LIST. |
1121 | ||
1122 | Keywords supported: :test :test-not :key | |
1123 | ||
1124 | \(fn ITEM LIST [KEYWORD VALUE]...)" nil nil) | |
1125 | ||
fc5e09b3 | 1126 | (autoload 'assoc-if "cl-seq" "\ |
d1b8746d SM |
1127 | Find the first item whose car satisfies PREDICATE in LIST. |
1128 | ||
1129 | Keywords supported: :key | |
1130 | ||
1131 | \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil) | |
1132 | ||
fc5e09b3 | 1133 | (autoload 'assoc-if-not "cl-seq" "\ |
d1b8746d SM |
1134 | Find the first item whose car does not satisfy PREDICATE in LIST. |
1135 | ||
1136 | Keywords supported: :key | |
1137 | ||
1138 | \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil) | |
1139 | ||
fc5e09b3 | 1140 | (autoload 'rassoc* "cl-seq" "\ |
d1b8746d SM |
1141 | Find the first item whose cdr matches ITEM in LIST. |
1142 | ||
1143 | Keywords supported: :test :test-not :key | |
1144 | ||
1145 | \(fn ITEM LIST [KEYWORD VALUE]...)" nil nil) | |
1146 | ||
fc5e09b3 | 1147 | (autoload 'rassoc-if "cl-seq" "\ |
d1b8746d SM |
1148 | Find the first item whose cdr satisfies PREDICATE in LIST. |
1149 | ||
1150 | Keywords supported: :key | |
1151 | ||
1152 | \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil) | |
1153 | ||
fc5e09b3 | 1154 | (autoload 'rassoc-if-not "cl-seq" "\ |
d1b8746d SM |
1155 | Find the first item whose cdr does not satisfy PREDICATE in LIST. |
1156 | ||
1157 | Keywords supported: :key | |
1158 | ||
1159 | \(fn PREDICATE LIST [KEYWORD VALUE]...)" nil nil) | |
1160 | ||
fc5e09b3 | 1161 | (autoload 'union "cl-seq" "\ |
d1b8746d | 1162 | Combine LIST1 and LIST2 using a set-union operation. |
16b737dc | 1163 | The resulting list contains all items that appear in either LIST1 or LIST2. |
d1b8746d SM |
1164 | This is a non-destructive function; it makes a copy of the data if necessary |
1165 | to avoid corrupting the original LIST1 and LIST2. | |
1166 | ||
1167 | Keywords supported: :test :test-not :key | |
1168 | ||
1169 | \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil) | |
1170 | ||
fc5e09b3 | 1171 | (autoload 'nunion "cl-seq" "\ |
d1b8746d | 1172 | Combine LIST1 and LIST2 using a set-union operation. |
16b737dc | 1173 | The resulting list contains all items that appear in either LIST1 or LIST2. |
d1b8746d SM |
1174 | This is a destructive function; it reuses the storage of LIST1 and LIST2 |
1175 | whenever possible. | |
1176 | ||
1177 | Keywords supported: :test :test-not :key | |
1178 | ||
1179 | \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil) | |
1180 | ||
fc5e09b3 | 1181 | (autoload 'intersection "cl-seq" "\ |
d1b8746d | 1182 | Combine LIST1 and LIST2 using a set-intersection operation. |
16b737dc | 1183 | The resulting list contains all items that appear in both LIST1 and LIST2. |
d1b8746d SM |
1184 | This is a non-destructive function; it makes a copy of the data if necessary |
1185 | to avoid corrupting the original LIST1 and LIST2. | |
1186 | ||
1187 | Keywords supported: :test :test-not :key | |
1188 | ||
1189 | \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil) | |
1190 | ||
fc5e09b3 | 1191 | (autoload 'nintersection "cl-seq" "\ |
d1b8746d | 1192 | Combine LIST1 and LIST2 using a set-intersection operation. |
16b737dc | 1193 | The resulting list contains all items that appear in both LIST1 and LIST2. |
d1b8746d SM |
1194 | This is a destructive function; it reuses the storage of LIST1 and LIST2 |
1195 | whenever possible. | |
1196 | ||
1197 | Keywords supported: :test :test-not :key | |
1198 | ||
1199 | \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil) | |
1200 | ||
fc5e09b3 | 1201 | (autoload 'set-difference "cl-seq" "\ |
d1b8746d | 1202 | Combine LIST1 and LIST2 using a set-difference operation. |
16b737dc | 1203 | The resulting list contains all items that appear in LIST1 but not LIST2. |
d1b8746d SM |
1204 | This is a non-destructive function; it makes a copy of the data if necessary |
1205 | to avoid corrupting the original LIST1 and LIST2. | |
1206 | ||
1207 | Keywords supported: :test :test-not :key | |
1208 | ||
1209 | \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil) | |
1210 | ||
fc5e09b3 | 1211 | (autoload 'nset-difference "cl-seq" "\ |
d1b8746d | 1212 | Combine LIST1 and LIST2 using a set-difference operation. |
16b737dc | 1213 | The resulting list contains all items that appear in LIST1 but not LIST2. |
d1b8746d SM |
1214 | This is a destructive function; it reuses the storage of LIST1 and LIST2 |
1215 | whenever possible. | |
1216 | ||
1217 | Keywords supported: :test :test-not :key | |
1218 | ||
1219 | \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil) | |
1220 | ||
fc5e09b3 | 1221 | (autoload 'set-exclusive-or "cl-seq" "\ |
d1b8746d | 1222 | Combine LIST1 and LIST2 using a set-exclusive-or operation. |
16b737dc | 1223 | The resulting list contains all items appearing in exactly one of LIST1, LIST2. |
d1b8746d SM |
1224 | This is a non-destructive function; it makes a copy of the data if necessary |
1225 | to avoid corrupting the original LIST1 and LIST2. | |
1226 | ||
1227 | Keywords supported: :test :test-not :key | |
1228 | ||
1229 | \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil) | |
1230 | ||
fc5e09b3 | 1231 | (autoload 'nset-exclusive-or "cl-seq" "\ |
d1b8746d | 1232 | Combine LIST1 and LIST2 using a set-exclusive-or operation. |
16b737dc | 1233 | The resulting list contains all items appearing in exactly one of LIST1, LIST2. |
d1b8746d SM |
1234 | This is a destructive function; it reuses the storage of LIST1 and LIST2 |
1235 | whenever possible. | |
1236 | ||
1237 | Keywords supported: :test :test-not :key | |
1238 | ||
1239 | \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil) | |
1240 | ||
fc5e09b3 | 1241 | (autoload 'subsetp "cl-seq" "\ |
d1b8746d SM |
1242 | Return true if LIST1 is a subset of LIST2. |
1243 | I.e., if every element of LIST1 also appears in LIST2. | |
1244 | ||
1245 | Keywords supported: :test :test-not :key | |
1246 | ||
1247 | \(fn LIST1 LIST2 [KEYWORD VALUE]...)" nil nil) | |
1248 | ||
fc5e09b3 | 1249 | (autoload 'subst-if "cl-seq" "\ |
d1b8746d SM |
1250 | Substitute NEW for elements matching PREDICATE in TREE (non-destructively). |
1251 | Return a copy of TREE with all matching elements replaced by NEW. | |
1252 | ||
1253 | Keywords supported: :key | |
1254 | ||
1255 | \(fn NEW PREDICATE TREE [KEYWORD VALUE]...)" nil nil) | |
1256 | ||
fc5e09b3 | 1257 | (autoload 'subst-if-not "cl-seq" "\ |
d1b8746d SM |
1258 | Substitute NEW for elts not matching PREDICATE in TREE (non-destructively). |
1259 | Return a copy of TREE with all non-matching elements replaced by NEW. | |
1260 | ||
1261 | Keywords supported: :key | |
1262 | ||
1263 | \(fn NEW PREDICATE TREE [KEYWORD VALUE]...)" nil nil) | |
1264 | ||
fc5e09b3 | 1265 | (autoload 'nsubst "cl-seq" "\ |
d1b8746d SM |
1266 | Substitute NEW for OLD everywhere in TREE (destructively). |
1267 | Any element of TREE which is `eql' to OLD is changed to NEW (via a call | |
1268 | to `setcar'). | |
1269 | ||
1270 | Keywords supported: :test :test-not :key | |
1271 | ||
1272 | \(fn NEW OLD TREE [KEYWORD VALUE]...)" nil nil) | |
1273 | ||
fc5e09b3 | 1274 | (autoload 'nsubst-if "cl-seq" "\ |
d1b8746d SM |
1275 | Substitute NEW for elements matching PREDICATE in TREE (destructively). |
1276 | Any element of TREE which matches is changed to NEW (via a call to `setcar'). | |
1277 | ||
1278 | Keywords supported: :key | |
1279 | ||
1280 | \(fn NEW PREDICATE TREE [KEYWORD VALUE]...)" nil nil) | |
1281 | ||
fc5e09b3 | 1282 | (autoload 'nsubst-if-not "cl-seq" "\ |
d1b8746d SM |
1283 | Substitute NEW for elements not matching PREDICATE in TREE (destructively). |
1284 | Any element of TREE which matches is changed to NEW (via a call to `setcar'). | |
1285 | ||
1286 | Keywords supported: :key | |
1287 | ||
1288 | \(fn NEW PREDICATE TREE [KEYWORD VALUE]...)" nil nil) | |
1289 | ||
fc5e09b3 | 1290 | (autoload 'sublis "cl-seq" "\ |
d1b8746d SM |
1291 | Perform substitutions indicated by ALIST in TREE (non-destructively). |
1292 | Return a copy of TREE with all matching elements replaced. | |
1293 | ||
1294 | Keywords supported: :test :test-not :key | |
1295 | ||
1296 | \(fn ALIST TREE [KEYWORD VALUE]...)" nil nil) | |
1297 | ||
fc5e09b3 | 1298 | (autoload 'nsublis "cl-seq" "\ |
d1b8746d SM |
1299 | Perform substitutions indicated by ALIST in TREE (destructively). |
1300 | Any matching element of TREE is changed via a call to `setcar'. | |
1301 | ||
1302 | Keywords supported: :test :test-not :key | |
1303 | ||
1304 | \(fn ALIST TREE [KEYWORD VALUE]...)" nil nil) | |
1305 | ||
fc5e09b3 | 1306 | (autoload 'tree-equal "cl-seq" "\ |
d1b8746d SM |
1307 | Return t if trees TREE1 and TREE2 have `eql' leaves. |
1308 | Atoms are compared by `eql'; cons cells are compared recursively. | |
1309 | ||
1310 | Keywords supported: :test :test-not :key | |
1311 | ||
1312 | \(fn TREE1 TREE2 [KEYWORD VALUE]...)" nil nil) | |
1313 | ||
1314 | ;;;*** | |
1315 | \f | |
1316 | ;; Local Variables: | |
1317 | ;; version-control: never | |
1318 | ;; no-byte-compile: t | |
1319 | ;; no-update-autoloads: t | |
e97a42c1 | 1320 | ;; coding: utf-8 |
d1b8746d | 1321 | ;; End: |
d1b8746d | 1322 | ;;; cl-loaddefs.el ends here |