zl:1 - FTP

367 notinline
For example:
(notevery #'oddp '(1 2 5»
=> T
(notevery #'equal '(1 2 3) '(1 2 3»
=> NIL
If predicate has side effects, it can count on being called fIrst on all those
elements with an index of 0, then all those with an index of 1, and so on.
For a table of related items: See the section "Predicates That Operate on
Sequences" in Symbolics Common Lisp: Language Concepts.
I
notinline
Declaration
(notinline functionl function2 ... ) specifies that it is undesirable to compile
the specified functions in-line. This declaration is pervasive, that is it affects
all code in the body of the form.
Note that rules of lexical scoping are observed; if one of the functions mentioned
has a lexically apparent local defInition (as made by flet or labels),
then the declaration applies to that local defInition and not to the global
function defmition.
nreeone 1 tail Function
This returns a list that is the fIrst argument reversed concatenated concatenated
together with the second argument. (nreeone 1 tail) is exactly
the same as (neone (nreverse l) tail) except that it is more effIcient. Both
1 and tail should be lists. Example:
(setq x '(a b c»
(setq y '(d e f»
(nreconc x y) => (c bad e f)
x => (a d e f)
nreeone could have been defmed by:
(de fun nreconc (1 tail)
(cond «null 1) tail)
«nreverse1 1 tail» »
defun nreverse1 (1 tail)
; auxiliary function
(cond «null (cdr 1» (rp1acd 1 tail»
«nreverse1 (cdr 1) (rp1acd 1 tail»»)
;; this last call depends on order of argument evaluation.
For a table of related items: See the section "Functions for Constructing
Lists and Conses" in Symbolics Common Lisp: Language Concepts.