This is the cl-trie Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon Feb 26 15:48:24 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
cl-trieCommon Lisp implementation of Trie data structure.
Mateusz Malisz <maliszmat@gmail.com>
MIT
package.lisp (file).
generics.lisp (file).
basic-trie.lisp (file).
trie.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
cl-trie/cl-trie.asdcl-trie/package.lispcl-trie/generics.lispcl-trie/basic-trie.lispcl-trie/trie.lispcl-trie/generics.lisppackage.lisp (file).
cl-trie (system).
all-keys (generic function).
all-values (generic function).
clear (generic function).
empty-key-warning (condition).
emptyp (generic function).
find-node (generic function).
insert (generic function).
leafp (generic function).
lookup (generic function).
(setf lookup) (generic function).
mapkeys (generic function).
mapvalues (generic function).
remove-index (generic function).
remove-node (generic function).
size (generic function).
wrong-key-type-error (condition).
attach (generic function).
cl-trie/basic-trie.lispgenerics.lisp (file).
cl-trie (system).
children (reader method).
(setf children) (writer method).
key (reader method).
value (reader method).
(setf value) (writer method).
basic-trie (class).
cl-trie/trie.lispbasic-trie.lisp (file).
cl-trie (system).
activep (reader method).
(setf activep) (writer method).
all-keys (method).
all-values (method).
clear (method).
emptyp (method).
find-node (method).
hash-table->trie (function).
initialize-instance (method).
initialize-instance (method).
insert (method).
leafp (method).
lookup (method).
(setf lookup) (method).
mapkeys (method).
mapvalues (method).
remove-index (method).
remove-node (method).
size (method).
trie (class).
(setf value) (method).
Packages are listed by definition order.
cl-triecommon-lisp.
activep (generic reader).
(setf activep) (generic writer).
all-keys (generic function).
all-values (generic function).
children (generic reader).
(setf children) (generic writer).
clear (generic function).
empty-key-warning (condition).
emptyp (generic function).
find-node (generic function).
hash-table->trie (function).
insert (generic function).
key (generic reader).
leafp (generic function).
lookup (generic function).
(setf lookup) (generic function).
mapkeys (generic function).
mapvalues (generic function).
remove-index (generic function).
remove-node (generic function).
size (generic function).
trie (class).
value (generic reader).
(setf value) (generic function).
wrong-key-type-error (condition).
attach (generic function).
basic-trie (class).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Return list of all keys of TRIE.
Return list of all values of TRIE.
basic-trie)) ¶basic-trie)) ¶Children nodes of the trie.
Clear TRIE of its contents, leaving it empty.
Return T if TRIE is empty, otherwise NIL.
Find node under INDEX in TRIE, or return NIL if no node has been found. If CREATE-NEW is T, all the nodes, including the searched one, will be created if they do not exist, effectively creating the node at index.
Insert ELEM as value of item at INDEX in TRIE to NEW-VALUE. Alias to (setf lookup).
basic-trie)) ¶A part of the sequence, that indicates that this node represents a sequence of all keys from the root up to this node, including this node.
%key.
Return T if trie is a leaf (has no children), NIL otherwise.
Check if there is something at INDEX in TRIE.
Return two values, the first one being value at TRIE, and second one being
T if anything was found at index and NIL if not.
If DEFAULT is provided, in case nothing is found, DEFAULT will be returned as the first value.
Set value of item at INDEX in TRIE to NEW-VALUE. Return the node that will hold the value.
Apply function FN to each key in TRIE. Returns TRIE.
Apply function FN to each value in TRIE. Returns TRIE.
Remove INDEX entry from TRIE. Return TRIE.
Deactivate NODE, removing the value unless preserve-value is non-nil. Return NODE.
Return size of TRIE, where size is number of elements found in the trie.
basic-trie)) ¶automatically generated reader method
basic-trie)) ¶automatically generated writer method
A warning emitted when key for trie is not provided.
warning.
An error emitted when key is of a wrong type.
error.
A lexicographically sorted trie.
| Initarg | Value |
|---|---|
:children | nil |
:verbose | t |
A flag that tells whether a node is active and value is of interest, or is inactive and value can be ignored.
boolean
:activep
Attach CHILDREN-TRIE to PARENT-TRIE.
If conflict happens (attached trie has the same key as already existing branch),
ON-CONFLICT describes the chosen strategy.
Possible options:
NIL - do nothing
:merge - try to merge tries
:error - raise an error
trie.
Children nodes of the trie.
list
:children
A part of the sequence, that indicates that this node represents a sequence of all keys from the root up to this node, including this node.
(warn (quote cl-trie:empty-key-warning))
:key
key.
This slot is read-only.
:value
| Jump to: | (
A C E F G H I K L M R S V |
|---|
| Jump to: | (
A C E F G H I K L M R S V |
|---|
| Jump to: | %
S |
|---|
| Jump to: | %
S |
|---|
| Jump to: | B C E F G P S T W |
|---|
| Jump to: | B C E F G P S T W |
|---|