Tree-based completion for Emacs
This package provides a generic completion method based on building a balanced decision tree with each candidate being a leaf. To traverse the tree from the root to a desired leaf, typically a sequence of read-key can be used.
In order for read-key to make sense, the tree needs to be visualized appropriately, with a character at each branch node. So this completion method works only for things that you can see on your screen, all at once, such as the positions of characters, words, line beginnings, links, or windows.
| System | Target | Derivation | Build status |
|---|---|---|---|
| x86_64-linux | /gnu/store/q12vi8l9kslrljgbi4cvf8g5sx8942gm-emacs-avy-0.5.0.drv | ||
| mips64el-linux | /gnu/store/m0w21a0hxsjpdf5c5dyvhxmnc6klbqva-emacs-avy-0.5.0.drv | ||
| i686-linux | /gnu/store/4n8qr22s937b8p16gznd30zl66l5n4j3-emacs-avy-0.5.0.drv | ||
| armhf-linux | /gnu/store/bxj3qbsnhl6cf237gpcpr2s0nrv7h1pr-emacs-avy-0.5.0.drv | ||
| aarch64-linux | /gnu/store/80ysr87wp4cqd1w5xphg5hcy05lk5dwv-emacs-avy-0.5.0.drv |
| Linter | Message | Location |
|---|---|---|
| No lint warnings ✓ | ||