Next: Building Lists, Previous: List-related Predicates, Up: Lists
This function returns the value referred to by the first slot of the cons cell cons-cell. In other words, it returns the car of cons-cell.
As a special case, if cons-cell is
nil
, this function returnsnil
. Therefore, any list is a valid argument. An error is signaled if the argument is not a cons cell ornil
.(car '(a b c)) ⇒ a (car '()) ⇒ nil
This function returns the value referred to by the second slot of the cons cell cons-cell. In other words, it returns the cdr of cons-cell.
As a special case, if cons-cell is
nil
, this function returnsnil
; therefore, any list is a valid argument. An error is signaled if the argument is not a cons cell ornil
.(cdr '(a b c)) ⇒ (b c) (cdr '()) ⇒ nil
This function lets you take the car of a cons cell while avoiding errors for other data types. It returns the car of object if object is a cons cell,
nil
otherwise. This is in contrast tocar
, which signals an error if object is not a list.(car-safe object) == (let ((x object)) (if (consp x) (car x) nil))
This function lets you take the cdr of a cons cell while avoiding errors for other data types. It returns the cdr of object if object is a cons cell,
nil
otherwise. This is in contrast tocdr
, which signals an error if object is not a list.(cdr-safe object) == (let ((x object)) (if (consp x) (cdr x) nil))
This macro provides a convenient way to examine the car of a list, and take it off the list, all at once. It operates on the list stored in listname. It removes the first element from the list, saves the cdr into listname, then returns the removed element.
In the simplest case, listname is an unquoted symbol naming a list; in that case, this macro is equivalent to
(prog1 (car listname) (setq listname (cdr listname)))
.x ⇒ (a b c) (pop x) ⇒ a x ⇒ (b c)More generally, listname can be a generalized variable. In that case, this macro saves into listname using
setf
. See Generalized Variables.For the
push
macro, which adds an element to a list, See List Variables.
This function returns the nth element of list. Elements are numbered starting with zero, so the car of list is element number zero. If the length of list is n or less, the value is
nil
.(nth 2 '(1 2 3 4)) ⇒ 3 (nth 10 '(1 2 3 4)) ⇒ nil (nth n x) == (car (nthcdr n x))The function
elt
is similar, but applies to any kind of sequence. For historical reasons, it takes its arguments in the opposite order. See Sequence Functions.
This function returns the nth cdr of list. In other words, it skips past the first n links of list and returns what follows.
If n is zero,
nthcdr
returns all of list. If the length of list is n or less,nthcdr
returnsnil
.(nthcdr 1 '(1 2 3 4)) ⇒ (2 3 4) (nthcdr 10 '(1 2 3 4)) ⇒ nil (nthcdr 0 '(1 2 3 4)) ⇒ (1 2 3 4)
This function returns the last link of list. The
car
of this link is the list's last element. If list is null,nil
is returned. If n is non-nil
, the nth-to-last link is returned instead, or the whole of list if n is bigger than list's length.
This function returns the length of list, with no risk of either an error or an infinite loop. It generally returns the number of distinct cons cells in the list. However, for circular lists, the value is just an upper bound; it is often too large.
If list is not
nil
or a cons cell,safe-length
returns 0.
The most common way to compute the length of a list, when you are not
worried that it may be circular, is with length
. See Sequence Functions.
In addition to the above, 24 additional compositions of car
and
cdr
are defined as c
xxxr
and c
xxxxr
,
where each x is either a
or d
. cadr
,
caddr
, and cadddr
pick out the second, third or fourth
elements of a list, respectively. cl-lib provides the same
under the names cl-second
, cl-third
, and
cl-fourth
. See List Functions.