Next: Basic Sequence Functions, Previous: Building Cons Cells and Lists, Up: Sequence Functions [Index]
The following predicates test whether a Lisp object is an atom, whether it is a cons cell or is a list, or whether it is the distinguished object ‘nil’. (Many of these predicates can be defined in terms of the others, but they are used so often that it is worth having them.)
This function returns ‘t’ if OBJECT is ‘nil’, and returns ‘nil’ otherwise.
This function is identical to ‘not’, but as a matter of clarity we use ‘null’ when OBJECT is considered a list and ‘not’ when it is considered a truth value
This function returns ‘t’ if OBJECT is an atom, ‘nil’ otherwise. All objects except cons cells are atoms.
The symbol ‘nil’ is an atom and is also a list; it is the only Lisp object that is both.
This function returns ‘t’ if OBJECT is a cons cell, ‘nil’ otherwise.
‘nil’ is not a cons cell, although it is a list.
This function returns ‘t’ if OBJECT is a cons cell or ‘nil’. Otherwise, it returns ‘nil’.
This function is the opposite of ‘listp’: it returns ‘t’ if OBJECT is not a list. Otherwise, it returns ‘nil’.
This function returns the length of OBJECT if it is a proper list, ‘nil’ otherwise. In addition to satisfying ‘listp’, a proper list is neither circular nor dotted.
Predicate function to determine if OBJECT is a sequence type:
See also ‘seqp’.
This function returns ‘t’ if OBJECT is an array (i.e., a vector, a string, a bool-vector or a char-table).
Next: Basic Sequence Functions, Previous: Building Cons Cells and Lists, Up: Sequence Functions [Index]