Variable: comp-known-predicates-h
comp-known-predicates-h is a variable defined in comp.el.gz.
Value
Large value
#s(hash-table test eq data
(arrayp
(#s(comp-cstr (array) nil nil nil)
. #s(comp-cstr (array) nil nil t))
atom
(#s(comp-cstr (atom) nil nil nil)
. #s(comp-cstr (atom) nil nil t))
bool-vector-p
(#s(comp-cstr (bool-vector) nil nil nil)
. #s(comp-cstr (bool-vector) nil nil t))
booleanp
(#s(comp-cstr nil (t nil) nil nil)
. #s(comp-cstr nil (t nil) nil t))
bufferp
(#s(comp-cstr (buffer) nil nil nil)
. #s(comp-cstr (buffer) nil nil t))
char-table-p
(#s(comp-cstr (char-table) nil nil nil)
. #s(comp-cstr (char-table) nil nil t))
characterp
(#s(comp-cstr nil nil
((-2305843009213693952
. 2305843009213693951))
nil)
. #s(comp-cstr (t) nil nil nil))
consp
(#s(comp-cstr (cons) nil nil nil)
. #s(comp-cstr (cons) nil nil t))
floatp
(#s(comp-cstr (float) nil nil nil)
. #s(comp-cstr (float) nil nil t))
framep
(#s(comp-cstr (frame) nil nil nil)
. #s(comp-cstr (frame) nil nil t))
functionp
(#s(comp-cstr (function list symbol) nil nil nil)
. #s(comp-cstr (function) nil nil t))
hash-table-p
(#s(comp-cstr (hash-table) nil nil nil)
. #s(comp-cstr (hash-table) nil nil t))
integer-or-marker-p
(#s(comp-cstr (integer-or-marker) nil nil nil)
. #s(comp-cstr (integer-or-marker) nil nil t))
integerp
(#s(comp-cstr nil nil ((- . +)) nil)
. #s(comp-cstr nil nil ((- . +)) t))
keywordp
(#s(comp-cstr (symbol) nil nil nil)
. #s(comp-cstr (t) nil nil nil))
listp
(#s(comp-cstr (list) nil nil nil)
. #s(comp-cstr (list) nil nil t))
markerp
(#s(comp-cstr (marker) nil nil nil)
. #s(comp-cstr (marker) nil nil t))
natnump
(#s(comp-cstr nil nil ((0 . +)) nil)
. #s(comp-cstr nil nil ((0 . +)) t))
null
(#s(comp-cstr nil (nil) nil nil)
. #s(comp-cstr nil (nil) nil t))
number-or-marker-p
(#s(comp-cstr (number-or-marker) nil nil nil)
. #s(comp-cstr (number-or-marker) nil nil t))
numberp
(#s(comp-cstr (number) nil nil nil)
. #s(comp-cstr (number) nil nil t))
obarrayp
(#s(comp-cstr (obarray) nil nil nil)
. #s(comp-cstr (obarray) nil nil t))
overlayp
(#s(comp-cstr (overlay) nil nil nil)
. #s(comp-cstr (overlay) nil nil t))
processp
(#s(comp-cstr (process) nil nil nil)
. #s(comp-cstr (process) nil nil t))
sequencep
(#s(comp-cstr (sequence) nil nil nil)
. #s(comp-cstr (sequence) nil nil t))
stringp
(#s(comp-cstr (string) nil nil nil)
. #s(comp-cstr (string) nil nil t))
subrp
(#s(comp-cstr (subr) nil nil nil)
. #s(comp-cstr (subr) nil nil t))
symbol-with-pos-p
(#s(comp-cstr (symbol-with-pos) nil nil nil)
. #s(comp-cstr (symbol-with-pos) nil nil t))
symbolp
(#s(comp-cstr (symbol) nil nil nil)
. #s(comp-cstr (symbol) nil nil t))
vectorp
(#s(comp-cstr (vector) nil nil nil)
. #s(comp-cstr (vector) nil nil t))
windowp
(#s(comp-cstr (window) nil nil nil)
. #s(comp-cstr (window) nil nil t))))
Documentation
Hash table FUNCTION -> (POS-CSTR . NEG-CSTR).
Source Code
;; Defined in /usr/src/emacs/lisp/emacs-lisp/comp.el.gz
(defconst comp-known-predicates-h
(cl-loop
with comp-ctxt = (make-comp-cstr-ctxt)
with h = (make-hash-table :test #'eq)
for (pred . type-specs) in comp-known-predicates
for pos-cstr = (comp-type-spec-to-cstr (car type-specs))
for neg-cstr = (if (length> type-specs 1)
(comp-type-spec-to-cstr (cl-second type-specs))
(comp-cstr-negation-make pos-cstr))
do (puthash pred (cons pos-cstr neg-cstr) h)
finally return h)
"Hash table FUNCTION -> (POS-CSTR . NEG-CSTR).")