This is the btrie Reference Manual, version 0.2.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 04:27:50 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
btrieBranch trie - a generic trie implementation with branch widths.
* Implementation is generic: keys can be of sequences of any type.
* Branch width of a trie node tells how many branches go through that node and
can be used to calculate probabilites for different suffixes.
Peter Hillerström <peter.hillerstrom@gmail.com>
Simplified BSD license.
0.2.1
arnesi (system).
split-sequence (system).
lift (system).
btrie.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
btrie/btrie.lispbtrie (system).
+word-marker+ (special variable).
add (method).
add-seqs (method).
add-seqs-as-keys (method).
add-subseqs (method).
branches (reader method).
(setf branches) (writer method).
find-key (method).
key (reader method).
leafp (function).
make-leaf (function).
make-node (function).
make-trie (function).
make-word-trie (function).
nodes-equalp (function).
obtain-seq (method).
only-terminal-p (function).
print-object (method).
print-words (function).
sort-trie (function).
sort-trie-branch (function).
traverse (method).
trie (class).
trie-prob (method).
width (reader method).
(setf width) (writer method).
wordp (function).
*debug* (special variable).
add-key (method).
create-node (method).
cut-sequence (function).
interleave (function).
make-trie-with-fn (function).
print-trie-simple (function).
print-trie-to-stream (method).
remove-key (method).
remove-node (method).
subseqs (function).
sym-interval (method).
sym-low (method).
Packages are listed by definition order.
nu.composed.btrieBranch trie – an implementation of tries with branch widths.
btrie
common-lisp.
it.bese.arnesi.
lift.
+word-marker+ (special variable).
add (generic function).
add-seqs (generic function).
add-seqs-as-keys (generic function).
add-subseqs (generic function).
branches (generic reader).
(setf branches) (generic writer).
find-key (generic function).
key (generic reader).
leafp (function).
make-leaf (function).
make-node (function).
make-trie (function).
make-word-trie (function).
nodes-equalp (function).
obtain-seq (generic function).
only-terminal-p (function).
print-words (function).
sort-trie (function).
sort-trie-branch (function).
traverse (generic function).
trie (class).
trie-prob (generic function).
width (generic reader).
(setf width) (generic writer).
wordp (function).
*debug* (special variable).
add-key (generic function).
create-node (generic function).
cut-sequence (function).
interleave (function).
make-trie-with-fn (function).
print-trie-simple (function).
print-trie-to-stream (generic function).
remove-key (generic function).
remove-node (generic function).
subseqs (function).
sym-interval (generic function).
sym-low (generic function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Predicate to tell if there are no branches for a node.
Utility function to make a trie instance.
Make a trie with letters as keys.
Make a test trie with words as keys.
This predicate tells if node has only terminal as a child.
Prints words from the trie, one per line. Returns total word count.
Options:
* with-count: Prints word counts after tab when over one.
TODO:
* Use keyword arguments?
* Implement start, end
* Allow to specify separator instead of newline
Sort a trie recursively with a predicate function.
Sort a trie node’s branches with a predicate function.
Predicate to tell whether this node ends any words.
Trie data structure, see package documentation for more info.
Can be any type for generality.
atom
""
:key
key.
This slot is read-only.
(integer 0 *)
0
:width
list
:branches
Simple utility function to build a trie from a sequence.
## Traverse tries printing out nodes
| Jump to: | (
A B C F G I K L M N O P R S T W |
|---|
| Jump to: | (
A B C F G I K L M N O P R S T W |
|---|
| Jump to: | *
+
B K S W |
|---|
| Jump to: | *
+
B K S W |
|---|
| Jump to: | B C F N P S T |
|---|
| Jump to: | B C F N P S T |
|---|