-
Notifications
You must be signed in to change notification settings - Fork 1
implements a binary search algorithm to a cursor movement
vim-scripts/BinarySearchMove
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
This is a mirror of http://www.vim.org/scripts/script.php?script_id=1756 Move a cursor with binary search principle - each step is twice shorter than previous. This requires log2(N) steps in a worth case to position in a line with a length N (7 keypresses for a 120 chars line). left/right movement are bound to H and L up/down to <Leader>u and <Leader>d
About
implements a binary search algorithm to a cursor movement
Resources
Stars
Watchers
Forks
Packages 0
No packages published