This is the ucons Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 07:59:11 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
uconsUnique conses and functions for working on them.
Marco Heisig <marco.heisig@fau.de>
MIT
alexandria (system).
atomics (system).
named-readtables (system).
trivia (system).
bordeaux-threads (system).
packages.lisp (file).
concurrent-hash-table.lisp (file).
cache.lisp (file).
ucons.lisp (file).
library.lisp (file).
readtable.lisp (file).
print-object.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
ucons/ucons.asducons/packages.lispucons/concurrent-hash-table.lispucons/cache.lispucons/ucons.lispucons/library.lispucons/readtable.lispucons/print-object.lispucons/concurrent-hash-table.lisppackages.lisp (file).
ucons (system).
concurrent-hash-table (type).
concurrent-hash-table-from-alist (function).
ensure-concurrent-hash-table-entry (macro).
make-concurrent-hash-table (function).
ucons/cache.lispconcurrent-hash-table.lisp (file).
ucons (system).
cachep (function).
make-cache (function).
with-caching (macro).
+cache-hash-threshold+ (constant).
cache (structure).
cache-benchmark (function).
cache-data (reader).
(setf cache-data) (writer).
call-with-caching (function).
ucons/ucons.lispcache.lisp (file).
ucons (system).
*atom-cache* (special variable).
make-load-form (method).
ucar (reader).
ucdr (reader).
ucons (function).
ucons (structure).
uconsp (function).
ulist (type).
cdr-cache (function).
make-fresh-ucons (function).
ucache (reader).
ucons/library.lispucons.lisp (file).
ucons (system).
do-ulist (macro).
list-from-ulist (function).
tree-from-utree (function).
ulength (function).
ulist (compiler macro).
ulist (function).
ulist* (compiler macro).
ulist* (function).
ulist-from-list (function).
ulist-from-vector (function).
umapcar (function).
unth (function).
unthcdr (function).
upop (macro).
upush (macro).
utree-from-tree (function).
vector-from-ulist (function).
ucons/readtable.lisplibrary.lisp (file).
ucons (system).
read-ulist (function).
read-right-square-bracket (function).
unmatched-closing-square-bracket (condition).
ucons/print-object.lispreadtable.lisp (file).
ucons (system).
print-object (method).
print-list (function).
Packages are listed by definition order.
uconscommon-lisp.
*atom-cache* (special variable).
cachep (function).
do-ulist (macro).
list-from-ulist (function).
make-cache (function).
read-ulist (function).
tree-from-utree (function).
ucar (reader).
ucdr (reader).
ucons (function).
ucons (structure).
uconsp (function).
ulength (function).
ulist (compiler macro).
ulist (function).
ulist (type).
ulist* (compiler macro).
ulist* (function).
ulist-from-list (function).
ulist-from-vector (function).
umapcar (function).
unth (function).
unthcdr (function).
upop (macro).
upush (macro).
utree-from-tree (function).
vector-from-ulist (function).
with-caching (macro).
+cache-hash-threshold+ (constant).
cache (structure).
cache-benchmark (function).
cache-data (reader).
(setf cache-data) (writer).
call-with-caching (function).
cdr-cache (function).
concurrent-hash-table (type).
concurrent-hash-table-from-alist (function).
ensure-concurrent-hash-table-entry (macro).
make-concurrent-hash-table (function).
make-fresh-ucons (function).
print-list (function).
read-right-square-bracket (function).
ucache (reader).
unmatched-closing-square-bracket (condition).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Return a (possibly dotted) list of the elements of the supplied ulist.
Return a tree of the same shape as UTREE, but where all occuring ulists have been converted to lists.
Return the length of the given ulist.
Return the ulist associated with the supplied arguments.
Return the ulist associated with the supplied arguments, but using the last argument as the tail of the constructed ulist.
Return an ulist containing the results of applying FUNCTION to successive elements of the supplied sequences. The resulting ulist is as long as the shortest supplied sequence.
structure-object.
How many entries are cached in a list with linear search before switching to a hash table.
data.
reader-error.
| Jump to: | (
C D E F L M P R T U V W |
|---|
| Jump to: | (
C D E F L M P R T U V W |
|---|
| Jump to: | *
+
C D S |
|---|
| Jump to: | *
+
C D S |
|---|
| Jump to: | C F L P R S T U |
|---|
| Jump to: | C F L P R S T U |
|---|