Next: Introduction, Previous: (dir), Up: (dir) [Contents][Index]
This is the cl-string-complete Reference Manual, version 0.1, generated automatically by Declt version 3.0 "Montgomery Scott" on Tue Dec 22 12:51:11 2020 GMT+0.
• Introduction | What cl-string-complete is all about | |
• Systems | The systems documentation | |
• Files | The files documentation | |
• Packages | The packages documentation | |
• Definitions | The symbols documentation | |
• Indexes | Concepts, functions, variables and data types |
#+TITLE: The =CL-STRING-COMPLETE= String Completion Library #+AUTHOR: Robert Smith #+EMAIL: quad@symbo1ics.com * Summary A small library for string completion by Robert Smith. * Usage The principle use follows. Create a completion tree: : > (defparameter *tree* (make-completion-tree)) Add your words to it: : > (completion-tree-add *tree* "hello") : > (completion-tree-add* *tree* "helmet" : "help" : "helsinki") Check if something exists in the tree: : > (completion-tree-contains-p *tree* "hello") : T : > (completion-tree-contains-p *tree* "hexagon") : NIL Compute the completions of a character: : > (compute-completions *tree* #\h) : ("ello" "elmet" "elp" "elsinki") : > (compute-completions *tree* #\x) : NIL Compute the completions of a string: : > (compute-completions *tree* "hel") : ("lo" "met" "sinki" "p") * Dependencies None. * License See the file ~LICENSE~. ---------- ### End of file
Next: Files, Previous: Introduction, Up: Top [Contents][Index]
The main system appears first, followed by any subsystem dependency.
• The cl-string-complete system |
Robert Smith
Robert Smith
Simple string completion in Common Lisp.
Simple string completion (finding suffixes of a string given a prefix) in Common Lisp.
0.1
cl-string-complete.asd (file)
Files are sorted by type and then listed depth-first from the systems components trees.
• Lisp files |
• The cl-string-complete.asd file | ||
• The cl-string-complete/package.lisp file | ||
• The cl-string-complete/exact-completion.lisp file |
Next: The cl-string-complete/package․lisp file, Previous: Lisp files, Up: Lisp files [Contents][Index]
cl-string-complete.asd
cl-string-complete (system)
Next: The cl-string-complete/exact-completion․lisp file, Previous: The cl-string-complete․asd file, Up: Lisp files [Contents][Index]
cl-string-complete (system)
package.lisp
Previous: The cl-string-complete/package․lisp file, Up: Lisp files [Contents][Index]
package.lisp (file)
cl-string-complete (system)
exact-completion.lisp
Next: Definitions, Previous: Files, Up: Top [Contents][Index]
Packages are listed by definition order.
• The cl-string-complete-asd package | ||
• The cl-string-complete package |
Next: The cl-string-complete package, Previous: Packages, Up: Packages [Contents][Index]
cl-string-complete.asd
Previous: The cl-string-complete-asd package, Up: Packages [Contents][Index]
String completion API.
package.lisp (file)
common-lisp
Definitions are sorted by export status, category, package, and then by lexicographic order.
• Exported definitions | ||
• Internal definitions |
Next: Internal definitions, Previous: Definitions, Up: Definitions [Contents][Index]
• Exported functions | ||
• Exported generic functions | ||
• Exported structures |
Next: Exported generic functions, Previous: Exported definitions, Up: Exported definitions [Contents][Index]
Add a string STR to the ternary tree TREE.
exact-completion.lisp (file)
Add a list of strings to TREE. The strings are suffled to help balance the tree.
exact-completion.lisp (file)
Check if TREE contains the word STR.
exact-completion.lisp (file)
exact-completion.lisp (file)
exact-completion.lisp (file)
Next: Exported structures, Previous: Exported functions, Up: Exported definitions [Contents][Index]
Compute the completions of of ITEM given a node or
tree NODE. If an integer limit LIMIT is given, then only a maximum
of LIMIT completions will be given. If PREFIXEDP is true, then the
completions will include the prefix.
exact-completion.lisp (file)
Previous: Exported generic functions, Up: Exported definitions [Contents][Index]
exact-completion.lisp (file)
structure-object (structure)
(or null cl-string-complete::completion-node)
completion-tree.root (function)
(setf completion-tree.root) (function)
Previous: Exported definitions, Up: Definitions [Contents][Index]
• Internal functions | ||
• Internal generic functions | ||
• Internal structures |
Next: Internal generic functions, Previous: Internal definitions, Up: Internal definitions [Contents][Index]
Make a fresh ternary node. with character CHAR.
exact-completion.lisp (file)
Walk the children of NODE to find all completions.
exact-completion.lisp (file)
exact-completion.lisp (file)
Printer for ternary nodes.
exact-completion.lisp (file)
exact-completion.lisp (file)
exact-completion.lisp (file)
exact-completion.lisp (file)
exact-completion.lisp (file)
exact-completion.lisp (file)
Printer for ternary trees.
exact-completion.lisp (file)
exact-completion.lisp (file)
exact-completion.lisp (file)
exact-completion.lisp (file)
exact-completion.lisp (file)
Next: Internal structures, Previous: Internal functions, Up: Internal definitions [Contents][Index]
Travel to the next node from NODE along the branch(es) specified by ITEM.
exact-completion.lisp (file)
Previous: Internal generic functions, Up: Internal definitions [Contents][Index]
exact-completion.lisp (file)
structure-object (structure)
base-char
#\nul
completion-node.char (function)
(setf completion-node.char) (function)
boolean
completion-node.endp (function)
(setf completion-node.endp) (function)
(or null cl-string-complete::completion-node)
completion-node.left (function)
(setf completion-node.left) (function)
(or null cl-string-complete::completion-node)
completion-node.middle (function)
(setf completion-node.middle) (function)
(or null cl-string-complete::completion-node)
completion-node.right (function)
(setf completion-node.right) (function)
Previous: Definitions, Up: Top [Contents][Index]
• Concept index | ||
• Function index | ||
• Variable index | ||
• Data type index |
Next: Function index, Previous: Indexes, Up: Indexes [Contents][Index]
Jump to: | C F L |
---|
Jump to: | C F L |
---|
Next: Variable index, Previous: Concept index, Up: Indexes [Contents][Index]
Jump to: | (
C F G M |
---|
Jump to: | (
C F G M |
---|
Next: Data type index, Previous: Function index, Up: Indexes [Contents][Index]
Jump to: | C E L M R S |
---|
Jump to: | C E L M R S |
---|
Previous: Variable index, Up: Indexes [Contents][Index]
Jump to: | C P S |
---|
Jump to: | C P S |
---|