lispdoc - results for test

test
 
 Mentioned in:
HyperSpec - 17.2 Rules about Test Functions
HyperSpec - 17.2.1 Satisfying a Two-Argument Test
HyperSpec - 17.2.1.1 Examples of Satisfying a Two-Argument Test
HyperSpec - 17.2.2 Satisfying a One-Argument Test
HyperSpec - 17.2.2.1 Examples of Satisfying a One-Argument Test
HyperSpec - 6.1.1.5.3 Summary of Termination Test Clauses
HyperSpec - 6.1.4 Termination Test Clauses
tests
 
 Mentioned in:
HyperSpec - 9.1.4.2.3 Restart Tests
(ldb-test bytespec integer)
Function: Return T if any of the specified bits in integer are 1's.
 Mentioned in:
CLtL2 - 12.8. Byte Manipulation Functions
HyperSpec - Function LDB-TEST
Successful Lisp - chapter18
asdf:test-op
Undocumented
  
(asdf:test-system system &rest args &key force verbose version
 &allow-other-keys)
Function: Shorthand for `(operate 'asdf:test-op system)`. See OPERATE for details.
  
(hash-table-test instance)
Function: Return whether debug-block represents elsewhere code.
 Mentioned in:
CLtL2 - 16.1. Hash Table Functions
HyperSpec - Function HASH-TABLE-TEST
cl-fad-test:test
Undocumented
  
cl-base64:test-base64
Undocumented
  
(cl-ppcre:create-optimized-test-function test-function &key (start 0)
 (end *regex-char-code-limit*) (kind *optimize-char-classes*))
Function: Given a unary test function which is applicable to characters returns a function which yields the same boolean results for all characters with character codes from START to (excluding) END. If KIND is NIL, TEST-FUNCTION will simply be returned. Otherwise, KIND should be one of: * :HASH-TABLE - builds a hash table representing all characters which satisfy the test and returns a closure which checks if a character is in that hash table * :CHARSET - instead of a hash table uses a "charset" which is a data structure using non-linear hashing and optimized to represent (sparse) sets of characters in a fast and space-efficient way (contributed by Nikodemus Siivola) * :CHARMAP - instead of a hash table uses a bit vector to represent the set of characters You can also use :HASH-TABLE* or :CHARSET* which are like :HASH-TABLE and :CHARSET but use the complement of the set if the set contains more than half of all characters between START and END. This saves space but needs an additional pass across all characters to create the data structure. There is no corresponding :CHARMAP* kind as the bit vectors are already created to cover the smallest possible interval which contains either the set or its complement.