This is the treedb Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Sep 15 06:55:30 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
treedb
A hierarchical key-value-database
Christoph Finkensiep <chfin@freenet.de>
MIT
cl-json
(system).
package.lisp
(file).
treedb.lisp
(file).
Files are sorted by type and then listed depth-first from the systems components trees.
treedb/treedb.lisp
package.lisp
(file).
treedb
(system).
children
(generic function).
del-node
(generic function).
leaf-p
(generic function).
make-alist-treedb
(function).
node
(generic function).
(setf node)
(generic function).
node-no-leaf-error
(condition).
node-not-found-error
(condition).
node-or
(macro).
node-p
(generic function).
subtree
(generic function).
to-alist
(generic function).
to-json
(generic function).
<alist-treedb>
(class).
malformed-tree-error
(condition).
root
(reader method).
(setf root)
(writer method).
subtree-p
(function).
to-key
(function).
to-keys
(function).
value-p
(function).
Packages are listed by definition order.
treedb
common-lisp
.
children
(generic function).
del-node
(generic function).
leaf-p
(generic function).
make-alist-treedb
(function).
node
(generic function).
(setf node)
(generic function).
node-no-leaf-error
(condition).
node-not-found-error
(condition).
node-or
(macro).
node-p
(generic function).
subtree
(generic function).
to-alist
(generic function).
to-json
(generic function).
<alist-treedb>
(class).
malformed-tree-error
(condition).
root
(generic reader).
(setf root)
(generic writer).
subtree-p
(function).
to-key
(function).
to-keys
(function).
value-p
(function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
=> the value at ‘/k/e/y/s or ‘default‘
Returns the value at ‘keys or, if it is not found, ‘default‘.
Returns an empty tree of type ‘<alist-treedb>‘.
=> children of node ‘/k/e/y/s‘
Returns a list of keys, which are the children of the given node.
<alist-treedb>
) &rest keys) ¶=> the deleted value
Deletes the value at ‘/k/e/y/s‘.
<alist-treedb>
) &rest keys) ¶=> ‘t‘ or ‘nil‘
Tests, if ‘/k/e/y/s‘ is a leaf in ‘db‘.
<alist-treedb>
) &rest keys) ¶=> (the value at ‘/k/e/y/s‘, ‘t‘ / ‘nil‘) Returns the value of a leaf node as the first and ‘t‘ or ‘nil‘ as the second value, depending on if the node was found or not. Can be used with ‘setf‘.
<alist-treedb>
) &rest keys) ¶=> ‘val‘
Sets the value at ‘/k/e/y/s‘ to ‘val‘.
<alist-treedb>
) &rest keys) ¶=> ‘t‘ or ‘nil‘
Tests, if ‘/k/e/y/s‘ is a node in ‘db‘.
<alist-treedb>
) &rest keys) ¶=> subtree at ‘/k/e/y/s‘
Returns a new tree object with the contents of the subtree.
The new object has the same type as ‘db‘.
<alist-treedb>
) &rest keys) ¶=> a nested alist
Returns the tree in alist form
<alist-treedb>
)) ¶=> a json string or ‘nil‘
Serializes the tree into json objects.
If ‘stream‘ is supplied, the json object is written to the corresponding stream.
Otherwise it is returned as a string.
<alist-treedb>
) &optional stream) ¶<alist-treedb>
)) ¶automatically generated reader method
root
.
<alist-treedb>
)) ¶automatically generated writer method
root
.
Signaled, if an internal error occurs. Probably means, you found a bug.
error
.
Jump to: | (
C D F G L M N R S T V |
---|
Jump to: | (
C D F G L M N R S T V |
---|
Jump to: | <
C F M N P S T |
---|
Jump to: | <
C F M N P S T |
---|