Go to the first, previous, next, last section, table of contents.
Returns the intersection of LIST1 and LIST2. LIST1 may be destroyed.
Returns the first cons in ALIST whose cdr satisfies PREDICATE.
Creates and returns a list containing SIZE elements, each of which is initialized to INITIAL-ELEMENT.
Returns the N-th element of LIST, where the car of LIST is the zeroth element.
Equivalent to (CAR (CAR X)).
Returns T if X is NIL; NIL otherwise.
Equivalent to (CAR (CDDDDR X)).
Concatenates LISTs by destructively modifying them.
Returns T if SUBLIST is one of the conses in LIST; NIL otherwise.
Returns T if X is a cons; NIL otherwise.
Equivalent to (CADR (CDDDDR (CDDDDR X))).
Returns T if X is either a cons or NIL; NIL otherwise.
Applies FUN to successive cars of LISTs, NCONCs the results, and returns it.
Equivalent to (CADDDR (CDDDDR X)).
Returns the length of SEQUENCE.
Returns the first cons in ALIST whose cdr is equal to ITEM.
Substitutes NEW for subtrees of TREE that do not satisfy TEST.
Changes the cdr of the N+1 th cons from the end of the list LIST to NIL. Returns the whole list.
Returns the cdr of LIST. Returns NIL if LIST is NIL.
Applies FUN to successive cars of LISTs. Returns the first LIST.
Applies FUN to successive cdrs of LISTs. Returns the first LIST.
Returns a new cons whose car and cdr are X and Y, respectively.
Returns a list of its arguments
Equivalent to (CADDR X).
Equivalent to (CDR (CDR (CAR (CAR X)))).
Equivalent to (CDR (CAR (CDR (CAR X)))).
Equivalent to (CDR (CAR (CAR (CDR X)))).
Equivalent to (CAR (CDR (CDR (CAR X)))).
Equivalent to (CAR (CDR (CAR (CDR X)))).
Equivalent to (CAR (CAR (CDR (CDR X)))).
Returns the result of performing the CDR operation N times on LIST.
Constructs an association list from KEYS and DATA adding to ALIST.
Equivalent to (CADDR (CDDDDR X)).
Returns T if every element of LIST1 appears in LIST2; NIL otherwise.
Substitutes NEW for subtrees of TREE that satisfy TEST.
Returns a new copy of LIST.
Returns the last cons in LIST
Equivalent to (CAR (CAR (CAR X))).
Returns the length of LIST, or NIL if LIST is circular.
Equivalent to (CDR (CDR (CDR X))).
Returns the intersection of List1 and List2.
Substitutes NEW for subtrees in TREE that match OLD.
Equivalent to (APPEND (REVERSE X) Y)
Equivalent to (CDR (CAR X)).
Equivalent to (CAR (CDR X)).
Equivalent to (CDR X).
Returns a list with elements which appear but once in LIST1 and LIST2.
Constructs a new alist by adding the pair (KEY . DATUM) to ALIST.
Substitutes NEW for subtrees of TREE that do not satisfy TEST.
Replaces the car of X with Y, and returns the modified X.
Equivalent to (CADR X).
Returns the union of LIST1 and LIST2. LIST1 and/or LIST2 may be destroyed.
Creates and returns a list with the same elements as LIST but without the last N elements.
Equivalent to (CAR (CAR (CAR (CAR X)))).
Equivalent to (CDR (CDR (CDR (CAR X)))).
Equivalent to (CDR (CDR (CAR (CDR X)))).
Equivalent to (CDR (CAR (CDR (CDR X)))).
Equivalent to (CAR (CDR (CDR (CDR X)))).
Equivalent to (CADDDR X).
Substitutes from ALIST for subtrees of TREE.
Substitutes NEW for subtrees of TREE that satisfy TEST.
Returns a list of elements of LIST1 that do not appear in LIST2. LIST1 may be destroyed.
Syntax:
(pop place)
Pops one item off the front of the list in PLACE and returns it.
Syntax:
(push item place)
Conses ITEM onto the list in PLACE, and returns the new list.
Equivalent to (CDR (CAR (CAR X))).
Equivalent to (CAR (CDR (CAR X))).
Equivalent to (CAR (CAR (CDR X))).
Equivalent to (CAR X).
Substitutes NEW for subtrees of TREE that match OLD.
Adds ITEM to LIST unless ITEM is already a member of LIST.
Applies FUN to successive cdrs of LISTs, NCONCs the results, and returns it.
Syntax:
(pushnew item place {keyword value}*)
If ITEM is already in the list stored in PLACE, does nothing. Else, conses ITEM onto the list. Returns NIL. If no KEYWORDs are supplied, each element in the list is compared with ITEM by EQL, but the comparison can be controlled by supplying keywords :TEST, :TEST-NOT, and/or :KEY.
Returns a list of elements appearing exactly once in LIST1 and LIST2.
Returns T if X and Y are isomorphic trees with identical leaves.
Equivalent to (CDR (CDR X)).
Searches the property list stored in Place for an indicator EQ to Indicator. If one is found, the corresponding value is returned, else the Default is returned.
Returns a new list, whose elements are those of LIST that appear before SUBLIST. If SUBLIST is not a tail of LIST, a copy of LIST is returned.
Returns the union of LIST1 and LIST2.
Returns the first pair in ALIST whose car does not satisfy TEST.
Replaces the cdr of X with Y, and returns the modified X.
Returns the tail of LIST beginning with the first element not satisfying TEST.
Returns the car of LIST. Returns NIL if LIST is NIL.
Returns T if X is NIL. Returns NIL if X is a cons. Otherwise, signals an error.
Returns a list of its arguments with the last cons being a dotted pair of the next to the last argument and the last argument.
Equivalent to (CAR (CDDDDR (CDDDDR X))).
Equivalent to (CDR (CAR (CAR (CAR X)))).
Equivalent to (CAR (CDR (CAR (CAR X)))).
Equivalent to (CAR (CAR (CDR (CAR X)))).
Equivalent to (CAR (CAR (CAR (CDR X)))).
Equivalent to (CDR (CDR (CDR (CDR X)))).
Substitutes from ALIST for subtrees of TREE nondestructively.
Returns the first cons in ALIST whose cdr does not satisfy PREDICATE.
Equivalent to (NCONC (NREVERSE X) Y).
Applies FUN to successive cdrs of LISTs and returns the results as a list.
Returns a list of elements of LIST1 that do not appear in LIST2.
Returns the first pair in ALIST whose car satisfies TEST.
Looks for the elements of INDICATOR-LIST in the property list stored in PLACE. If found, returns the indicator, the value, and T as multiple-values. If not, returns NILs as its three values.
Returns the tail of LIST beginning with the first element satisfying TEST.
Recursively copies conses in OBJECT and returns the result.
Returns T if X is not a cons; NIL otherwise.
Equivalent to (CDR (CDR (CAR X))).
Equivalent to (CDR (CAR (CDR X))).
Equivalent to (CAR (CDR (CDR X))).
Returns the first pair in ALIST whose car is equal (in the sense of TEST) to ITEM.
Constructs a new list by concatenating its arguments.
Returns the tail of LIST beginning with the first ITEM.
Go to the first, previous, next, last section, table of contents.