File: cl.el.html

This is a compatibility file which provides the old names provided by CL before we cleaned up its namespace usage.

Defined variables (8)

float-epsilonThe smallest positive float that adds to 1.0 to give a distinct value.
float-negative-epsilonThe smallest positive float that subtracts from 1.0 to give a distinct value.
least-negative-floatThe smallest value less than zero that a Lisp float can hold.
least-negative-normalized-floatThe smallest normalized Lisp float less than zero.
least-positive-floatThe smallest value greater than zero that a Lisp float can hold.
least-positive-normalized-floatThe smallest normalized Lisp float greater than zero.
most-negative-floatThe largest negative value that a Lisp float can hold.
most-positive-floatThe largest value that a Lisp float can hold.

Defined functions (195)

acons(KEY VALUE ALIST)
adjoin(ITEM LIST [KEYWORD VALUE]...)
assert(FORM &optional SHOW-ARGS STRING &rest ARGS)
assoc*(ITEM LIST [KEYWORD VALUE]...)
assoc-if(PREDICATE LIST [KEYWORD VALUE]...)
assoc-if-not(PREDICATE LIST [KEYWORD VALUE]...)
block(NAME &rest BODY)
callf(FUNC PLACE &rest ARGS)
callf2(FUNC ARG1 PLACE ARGS...)
case(EXPR (KEYLIST BODY...)...)
ceiling*(X &optional Y)
check-type(FORM TYPE &optional STRING)
cl--function-convert(F)
cl--gv-adapt(CL-GV DO)
cl--pass-args-to-cl-declare(&rest SPECS)
cl--wrap-in-nil-block(FUN &rest ARGS)
cl-clrhash(TABLE)
cl-copy-tree(TREE &optional VECTORS-AND-RECORDS)
cl-gethash(KEY TABLE &optional DEFAULT)
cl-hash-table-count(TABLE)
cl-hash-table-p(OBJ)
cl-maclisp-member(ITEM LIST)
cl-macroexpand(FORM &optional ENVIRONMENT)
cl-macroexpand-all(FORM &optional ENVIRONMENT)
cl-make-hash-table(&rest KEYWORD-ARGS)
cl-map-extents(FUNC &optional BUFFER START END ARG)
cl-map-intervals(FUNC &optional WHAT PROP START END)
cl-map-keymap(FUNCTION KEYMAP)
cl-map-keymap-recursively(FUNC-REC MAP &optional BASE)
cl-maphash(FUNCTION TABLE)
cl-not-hash-table(X &optional Y &rest Z)
cl-puthash(KEY VALUE TABLE)
cl-remhash(KEY TABLE)
cl-set-getf(PLIST TAG VAL)
cl-struct-setf-expander(X NAME ACCESSOR PRED-FORM POS)
cl-unload-function()
coerce(OBJECT TYPE)
compiler-macroexpand(FORM)
concatenate(TYPE SEQUENCE...)
copy-list(LIST)
copy-seq(ARG)
count(ITEM SEQ [KEYWORD VALUE]...)
count-if(PREDICATE SEQ [KEYWORD VALUE]...)
count-if-not(PREDICATE SEQ [KEYWORD VALUE]...)
declaim(&rest SPECS)
define-compiler-macro(FUNC ARGS &rest BODY)
define-modify-macro(NAME ARGLIST FUNC &optional DOC)
define-setf-expander(NAME ARGLIST &rest BODY)
define-setf-method(NAME ARGLIST &rest BODY)
defmacro*(NAME ARGLIST [DOCSTRING] BODY...)
defsetf(NAME [FUNC | ARGLIST (STORE) BODY...])
defstruct(NAME &optional DOCSTRING &rest SLOTS)
defsubst*(NAME ARGLIST [DOCSTRING] BODY...)
deftype(NAME ARGLIST &rest BODY)
defun*(NAME ARGLIST [DOCSTRING] BODY...)
delete*(ITEM SEQ [KEYWORD VALUE]...)
delete-duplicates(SEQ [KEYWORD VALUE]...)
delete-if(PREDICATE SEQ [KEYWORD VALUE]...)
delete-if-not(PREDICATE SEQ [KEYWORD VALUE]...)
destructuring-bind(ARGS EXPR &rest BODY)
do(((VAR INIT [STEP])...) (END-TEST [RESULT...]) BODY...)
do*(((VAR INIT [STEP])...) (END-TEST [RESULT...]) BODY...)
do-all-symbols((VAR [RESULT]) BODY...)
do-symbols((VAR [OBARRAY [RESULT]]) BODY...)
ecase(EXPR (KEYLIST BODY...)...)
eighth(X)
endp(X)
equalp(X Y)
etypecase(EXPR (TYPE BODY...)...)
eval-when((WHEN...) BODY...)
every(PREDICATE SEQ...)
fifth(X)
fill(SEQ ITEM [KEYWORD VALUE]...)
find(ITEM SEQ [KEYWORD VALUE]...)
find-if(PREDICATE SEQ [KEYWORD VALUE]...)
find-if-not(PREDICATE SEQ [KEYWORD VALUE]...)
first(LIST)
flet(((FUNC ARGLIST BODY...) ...) FORM...)
floatp-safe(OBJECT)
floor*(X &optional Y)
fourth(X)
function*(FUNC)
gcd(&rest ARGS)
gentemp(&optional PREFIX)
get*(SYMBOL PROPNAME &optional DEFAULT)
getf(PROPLIST PROPNAME &optional DEFAULT)
intersection(LIST1 LIST2 [KEYWORD VALUE]...)
isqrt(X)
labels(BINDINGS &rest BODY)
lcm(&rest ARGS)
ldiff(LIST SUBLIST)
letf(((PLACE VALUE) ...) BODY...)
letf*(BINDINGS &rest BODY)
lexical-let(BINDINGS BODY)
lexical-let*(BINDINGS BODY)
list*(ARG...)
list-length(X)
load-time-value(FORM &optional READ-ONLY)
locally(BODY...)
loop(CLAUSE...)
macrolet(((NAME ARGLIST BODY...) ...) FORM...)
make-random-state(&optional STATE)
map(TYPE FUNCTION SEQUENCE...)
mapcar*(FUNCTION SEQ...)
mapcon(FUNCTION LIST...)
mapl(FUNCTION LIST...)
maplist(FUNCTION LIST...)
member*(ITEM LIST [KEYWORD VALUE]...)
member-if(PREDICATE LIST [KEYWORD VALUE]...)
member-if-not(PREDICATE LIST [KEYWORD VALUE]...)
merge(TYPE SEQ1 SEQ2 PREDICATE [KEYWORD VALUE]...)
mismatch(SEQ1 SEQ2 [KEYWORD VALUE]...)
mod*(X Y)
multiple-value-apply(FUNCTION EXPRESSION)
multiple-value-bind((SYM...) FORM BODY)
multiple-value-call(FUNCTION &rest ARGUMENTS)
multiple-value-list(EXPRESSION)
multiple-value-setq((SYM...) FORM)
nintersection(LIST1 LIST2 [KEYWORD VALUE]...)
ninth(X)
notany(PREDICATE SEQ...)
notevery(PREDICATE SEQ...)
nreconc(X Y)
nset-difference(LIST1 LIST2 [KEYWORD VALUE]...)
nset-exclusive-or(LIST1 LIST2 [KEYWORD VALUE]...)
nsublis(ALIST TREE [KEYWORD VALUE]...)
nsubst(NEW OLD TREE [KEYWORD VALUE]...)
nsubst-if(NEW PREDICATE TREE [KEYWORD VALUE]...)
nsubst-if-not(NEW PREDICATE TREE [KEYWORD VALUE]...)
nsubstitute(NEW OLD SEQ [KEYWORD VALUE]...)
nsubstitute-if(NEW PREDICATE SEQ [KEYWORD VALUE]...)
nsubstitute-if-not(NEW PREDICATE SEQ [KEYWORD VALUE]...)
nth-value(N LIST)
nunion(LIST1 LIST2 [KEYWORD VALUE]...)
pairlis(KEYS VALUES &optional ALIST)
position(ITEM SEQ [KEYWORD VALUE]...)
position-if(PREDICATE SEQ [KEYWORD VALUE]...)
position-if-not(PREDICATE SEQ [KEYWORD VALUE]...)
proclaim(SPEC)
progv(SYMBOLS VALUES &rest BODY)
psetf(PLACE VAL PLACE VAL ...)
psetq(SYM VAL SYM VAL ...)
pushnew(X PLACE [KEYWORD VALUE]...)
random*(LIM &optional STATE)
random-state-p(X)
rassoc*(ITEM LIST [KEYWORD VALUE]...)
rassoc-if(PREDICATE LIST [KEYWORD VALUE]...)
rassoc-if-not(PREDICATE LIST [KEYWORD VALUE]...)
reduce(FUNCTION SEQ [KEYWORD VALUE]...)
rem*(X Y)
remf(PLACE TAG)
remove*(ITEM SEQ [KEYWORD VALUE]...)
remove-duplicates(SEQ [KEYWORD VALUE]...)
remove-if(PREDICATE SEQ [KEYWORD VALUE]...)
remove-if-not(PREDICATE SEQ [KEYWORD VALUE]...)
remprop(SYMBOL PROPNAME)
rest(LIST)
return(&optional RESULT)
return-from(NAME &optional RESULT)
revappend(X Y)
rotatef(PLACE...)
round*(X &optional Y)
search(SEQ1 SEQ2 [KEYWORD VALUE]...)
second(X)
set-difference(LIST1 LIST2 [KEYWORD VALUE]...)
set-exclusive-or(LIST1 LIST2 [KEYWORD VALUE]...)
seventh(X)
shiftf(PLACE... VAL)
signum(X)
sixth(X)
some(PREDICATE SEQ...)
sort*(SEQ PREDICATE [KEYWORD VALUE]...)
stable-sort(SEQ PREDICATE [KEYWORD VALUE]...)
sublis(ALIST TREE [KEYWORD VALUE]...)
subseq(SEQ START &optional END)
subsetp(LIST1 LIST2 [KEYWORD VALUE]...)
subst(NEW OLD TREE [KEYWORD VALUE]...)
subst-if(NEW PREDICATE TREE [KEYWORD VALUE]...)
subst-if-not(NEW PREDICATE TREE [KEYWORD VALUE]...)
substitute(NEW OLD SEQ [KEYWORD VALUE]...)
substitute-if(NEW PREDICATE SEQ [KEYWORD VALUE]...)
substitute-if-not(NEW PREDICATE SEQ [KEYWORD VALUE]...)
svref(ARRAY IDX)
symbol-macrolet(((NAME EXPANSION) ...) FORM...)
tailp(SUBLIST LIST)
tenth(X)
the(TYPE FORM)
third(X)
tree-equal(TREE1 TREE2 [KEYWORD VALUE]...)
truncate*(X &optional Y)
typecase(EXPR (TYPE BODY...)...)
typep(VAL TYPE)
union(LIST1 LIST2 [KEYWORD VALUE]...)
values(&rest OBJECTS)
values-list(LIST)

Defined faces (0)