Guix will hold its first online conference November 22nd. Propose a talk before November 6th. Learn more!

emacs-avy 0.5.0 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.