[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[elpa] master 9103291 048/110: Update description to be easier to unders

From: Oleh Krehel
Subject: [elpa] master 9103291 048/110: Update description to be easier to understand.
Date: Sat, 11 May 2019 10:15:41 -0400 (EDT)

branch: master
commit 91032912146f16c09987d8d35083f09809d6afaa
Author: Christoph Michelbach <address@hidden>
Commit: Christoph Michelbach <address@hidden>

    Update description to be easier to understand.
 avy.el | 26 +++++++++++++++++---------
 1 file changed, 17 insertions(+), 9 deletions(-)

diff --git a/avy.el b/avy.el
index 63b9590..70e1ca4 100644
--- a/avy.el
+++ b/avy.el
@@ -1,4 +1,4 @@
-;;; avy.el --- tree-based completion -*- lexical-binding: t -*-
+;;; avy.el --- Jump to arbitrary positions in visible text and select text 
quickly. -*- lexical-binding: t -*-
 ;; Copyright (C) 2015  Free Software Foundation, Inc.
@@ -25,15 +25,23 @@
 ;;; Commentary:
-;; 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.
+;; With Avy, you can move point to any position in Emacs – even in a
+;; different window – using very few keystrokes. For this, you look at
+;; the position where you want point to be, invoke Avy, and then enter
+;; the sequence of characters displayed at that position.
-;; 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:
+;; If the position you want to jump to can be determined after only
+;; issuing a single keystroke, point is moved to the desired position
+;; immediately after that keystroke. In case this isn't possible, the
+;; sequence of keystrokes you need to enter is comprised of more than
+;; one character. Avy uses a decision tree where each candidate position
+;; is a leaf and each edge is described by a character which is distinct
+;; per level of the tree. By entering those characters, you navigate the
+;; tree, quickly arriving at the desired candidate position, such that
+;; Avy can move point to it.
+;; Note that this only makes sense for positions you are able to see
+;; when invoking Avy. These kinds of positions are supported:
 ;; * character positions
 ;; * word or subword start positions

reply via email to

[Prev in Thread] Current Thread [Next in Thread]