1 Vis a vim-like text editor
2 ==========================
4 Vis aims to be a modern, legacy free, simple yet efficient vim-like editor.
6 As an universal editor it has decent Unicode support (including double width
7 and combining characters) and should cope with arbitrary files including:
9 - large (up to a few Gigabytes) ones including
10 - Wikipedia/OpenStreetMap XML / SQL / CVS dumps
11 - amalgamated source trees (e.g. SQLite)
12 - single line ones e.g. minified JavaScript
13 - binary ones e.g. ELF files
15 Efficient syntax highlighting is provided using Parsing Expression Grammars
16 which can be conveniently expressed using Lua in form of LPeg.
18 The editor core is written in a reasonable amount of clean (your mileage
19 may vary), modern and legacy free C code enabling it to run in resource
20 constrained environments. The implementation should be easy to hack on
21 and encourage experimentation (e.g. native built in support for multiple
22 cursors). There also exists a Lua API for in process extensions.
24 Vis strives to be *simple* and focuses on its core task: efficient text
25 management. As an example the file open dialog is provided by an independent
26 utility. There exist plans to use a client/server architecture, delegating
27 window management to your windowing system or favorite terminal multiplexer.
29 The intention is *not* to be bug for bug compatible with vim, instead a
30 similar editing experience should be provided. The goal could thus be
31 summarized as "80% of vim's features implemented in roughly 1% of the code".
33 ![vis demo](https://raw.githubusercontent.com/martanne/vis/gh-pages/screencast.gif)
35 Getting started / Build instructions
36 ====================================
38 In order to build vis you will need a C99 compiler as well as:
40 * a C library, we recommend [musl](http://www.musl-libc.org/)
41 * [libcurses](http://www.gnu.org/software/ncurses/), preferably in the
42 wide-character version
43 * [libtermkey](http://www.leonerd.org.uk/code/libtermkey/)
44 * [lua](http://www.lua.org/) >= 5.2
45 * [LPeg](http://www.inf.puc-rio.br/~roberto/lpeg/) >= 0.12 (runtime
46 dependency required for syntax highlighting)
48 If you want a self contained statically linked binary you can try
49 to run `make standalone` which will attempt to download, compile
50 and install all of the above dependencies. `make local` will do
51 the same but only for libtermkey, lua and LPeg (i.e. the system
52 C and curses libraries are used).
54 To build a regular dynamically linked binary using the system
55 libraries, simply run `make` (possibly after adapting `config.mk`
56 to match your system).
60 $ VIS_PATH=. ./vis config.h
65 The following section gives a quick overview over the currently
81 = (format using fmt(1))
83 Operators can be forced to work line wise by specifying `V`.
91 gj (display line down)
94 ^ (first non-blank of line)
95 g_ (last non-blank of line)
98 b (previous start of a word)
99 B (previous start of a WORD)
100 w (next start of a word)
101 W (next start of a WORD)
102 e (next end of a word)
103 E (next end of a WORD)
104 ge (previous end of a word)
105 gE (previous end of a WORD)
106 { (previous paragraph)
108 ( (previous sentence)
110 [[ (previous start of C-like function)
111 [] (previous end of C-like function)
112 ][ (next start of C-like function)
113 ]] (next end of C-like function)
115 g0 (begin of display line)
116 gm (middle of display line)
117 g$ (end of display line)
118 G (goto line or end of file)
120 n (repeat last search forward)
121 N (repeat last search backwards)
122 H (goto top/home line of window)
123 M (goto middle line of window)
124 L (goto bottom/last line of window)
125 * (search word under cursor forwards)
126 # (search word under cursor backwards)
127 f{char} (to next occurrence of char to the right)
128 t{char} (till before next occurrence of char to the right)
129 F{char} (to next occurrence of char to the left)
130 T{char} (till before next occurrence of char to the left)
131 ; (repeat last to/till movement)
132 , (repeat last to/till movement but in opposite direction)
133 /{text} (to next match of text in forward direction)
134 ?{text} (to next match of text in backward direction)
136 '{mark} (go to start of line containing mark)
138 An empty line is currently neither a word nor a WORD.
140 Some of these commands do not work as in vim when prefixed with a
141 digit i.e. a multiplier. As an example in vim `3$` moves to the end
142 of the 3rd line down. However vis treats it as a move to the end of
143 current line which is repeated 3 times where the last two have no
148 All of the following text objects are implemented in an inner variant
149 (prefixed with `i`) and a normal variant (prefixed with `a`):
155 [,], (,), {,}, <,>, ", ', ` block enclosed by these symbols
157 For sentence and paragraph there is no difference between the
158 inner and normal variants.
160 gn matches the last used search term in forward direction
161 gN matches the last used search term in backward direction
163 Additionally the following text objects, which are not part of stock vim
166 ae entire file content
167 ie entire file content except for leading and trailing empty lines
168 af C-like function definition including immediately preceding comments
169 if C-like function definition only function body
171 il current line without leading and trailing white spaces
175 Vis implements more or less functional normal, operator-pending, insert,
176 replace and visual (in both line and character wise variants) modes.
178 Visual block mode is not implemented and there exists no immediate
179 plan to do so. Instead vis has built in support for multiple cursors.
181 Command mode is implemented as a regular file. Use the full power of the
182 editor to edit your commands / search terms.
184 Ex mode is deliberately not implemented, use `ssam(1)` if you need a
187 ### Multiple Cursors / Selections
189 vis supports multiple cursors with immediate visual feedback (unlike
190 in the visual block mode of vim where for example inserts only become
191 visible upon exit). There always exists one primary cursor, additional
192 ones can be created as needed.
194 To manipulate multiple cursors use in normal mode:
196 CTRL-K create a new cursor on the line above
197 CTRL-J create a new cursor on the line below
198 CTRL-P remove least recently added cursor
199 CTRL-N select word the cursor is currently over, switch to visual mode
200 TAB try to align all cursor on the same column
201 ESC if a selection is active, clear it.
202 Otherwise dispose all but the primary cursor.
204 Visual mode was enhanced to recognize:
206 I create a cursor at the start of every selected line
207 A create a cursor at the end of every selected line
208 CTRL-N create new cursor and select next word matching current selection
209 CTRL-X clear (skip) current selection, but select next matching word
210 CTRL-P remove least recently added cursor
212 In insert/replace mode
214 S-Tab aligns all cursors by inserting spaces
218 [a-z] general purpose marks
219 < start of the last selected visual area in current buffer
220 > end of the last selected visual area in current buffer
222 No marks across files are supported. Marks are not preserved over
227 Supported registers include:
229 "a-"z general purpose registers
230 "A-"Z append to corresponding general purpose register
231 "*, "+ system clipboard integration via shell scripts vis-{copy,paste}
233 "_ black hole (/dev/null) register
235 If no explicit register is specified a default register is used.
237 Registers used for macros are currently independent.
239 ### Undo/Redo and Repeat
241 The text is currently snapshotted whenever an operator is completed as
242 well as when insert or replace mode is left. Additionally a snapshot
243 is also taken if in insert or replace mode a certain idle time elapses.
245 Another idea is to snapshot based on the distance between two consecutive
246 editing operations (as they are likely unrelated and thus should be
247 individually reversible).
249 Besides the regular undo functionality, the key bindings `g+` and `g-`
250 traverse the history in chronological order. Further more the `:earlier`
251 and `:later` commands provide means to restore the text to an arbitrary
254 The repeat command `.` works for all operators and is able to repeat
255 the last insertion or replacement.
259 `[a-z]` are recognized macro names, `q` starts a recording, `@` plays it back.
260 `@@` refers to the least recently recorded macro.
262 ### Command line prompt
264 At the `:`-command prompt only the following commands are recognized, any
265 valid unique prefix can be used:
268 :bdelete close all windows which display the same file as the current one
269 :edit replace current file with a new one or reload it from disk
270 :open open a new window
271 :qall close all windows, exit editor
272 :quit close currently focused window
273 :read insert content of another file at current cursor position
274 :split split window horizontally
275 :vsplit split window vertically
276 :new open an empty window, arrange horizontally
277 :vnew open an empty window, arrange vertically
278 :wq write changes then close window
279 :xit like :wq but write only when changes have been made
280 :write write current buffer content to file
281 :saveas save file under another name
282 :substitute search and replace currently implemented in terms of `sed(1)`
283 :earlier revert to older text state
284 :later revert to newer text state
285 :map add a global key mapping
286 :unmap remove a global key mapping
287 :map-window add a window local key mapping
288 :unmap-window remove a window local key mapping
289 :langmap set key equivalents for layout specific key mappings
290 :! filter range through external command
291 :| pipe range to external command and display output in a new window
292 :set set the options below
294 tabwidth [1-8] default 8
296 set display width of a tab and number of spaces to use if
299 expandtab (yes|no) default no
301 whether typed in tabs should be expanded to tabwidth spaces
303 autoindent (yes|no) default no
305 replicate spaces and tabs at the beginning of the line when
308 number (yes|no) default no
309 relativenumber (yes|no) default no
311 whether absolute or relative line numbers are printed alongside
314 syntax name default yes
316 use syntax definition given (e.g. "c") or disable syntax
317 highlighting if no such definition exists (e.g :set syntax off)
321 show/hide special white space replacement symbols
323 newlines = [0|1] default 0
324 tabs = [0|1] default 0
325 spaces = [0|1] default 0
327 cursorline (yes|no) default no
329 highlight the line on which the cursor currently resides
331 colorcolumn number default 0
333 highlight the given column
335 theme name default dark-16.lua |Â solarized.lua (16 | 256 color)
337 use the given theme / color scheme for syntax highlighting
339 Each command can be prefixed with a range made up of a start and
340 an end position as in start,end. Valid position specifiers are:
342 . start of the current line
343 +n and -n start of the line relative to the current line
344 'm position of mark m
345 /pattern/ first match after current position
347 If only a start position without a command is given then the cursor
348 is moved to that position. Additionally the following ranges are
351 % the whole file, equivalent to 1,$
352 * the current selection, equivalent to '<,'>
354 History support, tab completion and wildcard expansion are other
355 worthwhile features. However implementing them inside the editor feels
356 wrong. For now you can use the `:edit` command with a pattern or a
362 vis will call the `vis-open` script which invokes dmenu or slmenu
363 with the files corresponding to the pattern. The file you select in
364 dmenu/slmenu will be opened in vis.
366 ### Runtime Configurable Key Bindings
368 Vis supports run time key bindings via the `:{un,}map{,-window}` set of
369 commands. The basic syntax is:
371 :map <mode> <lhs> <rhs>
373 where mode is one of `normal`, `insert`, `replace`, `visual`,
374 `visual-line` or `operator-pending`. lhs refers to the key to map, rhs is
375 a key action or alias. An existing mapping can be overridden by appending
376 `!` to the map command.
378 Key mappings are always recursive, this means doing something like:
382 will not work because it will enter an endless loop. Instead vis uses
383 pseudo keys referred to as key actions which can be used to invoke a set
384 of available (see :help or <F1> for a list) editor functions. Hence the
385 correct thing to do would be:
387 :map! normal j 2<cursor-line-down>
389 Unmapping works as follows:
393 The commands suffixed with `-window` only affect the currently active window.
395 ### Layout Specific Key Bindings
397 Vis allows to set key equivalents for non-latin keyboard layouts. This
398 facilitates editing non-latin texts. The defined mappings take effect
399 in all non-input modes, i.e. everywhere except in insert and replace mode.
401 For example, the following maps the movement keys in Russian layout:
403 :langmap ролд hjkl
405 More generally the syntax of the `:langmap` command is:
407 :langmap <sequence of keys in your layout> <sequence of equivalent keys in latin layout>
409 If the key sequences have not the same length, the rest of the longer
410 sequence will be discarded.
412 ### Tab <-> Space conversion and Line endings \n vs \r\n
414 Tabs can optionally be expanded to a configurable number of spaces.
415 The first line ending in the file determines what will be inserted
416 upon a line break (defaults to \n).
418 ### Jump list and change list
420 A per window, file local jump list (navigate with `CTRL+O` and `CTRL+I`)
421 and change list (navigate with `g;` and `g,`) is supported. The jump
422 list is implemented as a fixed sized ring buffer.
426 The mouse is currently not used at all.
430 Some of the features of vim which will *not* be implemented:
432 - tabs / multiple workspaces / advanced window management
433 - file and directory browser
434 - support for file archives (tar, zip, ...)
435 - support for network protocols (ftp, http, ssh ...)
438 - GUIs (neither x11, motif, gtk, win32 ...) although the codebase
439 should make it easy to add them
441 - plugins (certainly not vimscript, if anything it should be lua based)
443 - ex mode (if you need a stream editor use `ssam(1)`
446 - internal spell checker
447 - compile time configurable features / `#ifdef` mess
449 Lua API for in process extension
450 ================================
452 Vis provides a simple Lua API for in process extension. At startup the
453 `visrc.lua` file is executed, this can be used to register a few event
454 callbacks which will be invoked from the editor core. While executing
455 these user scripts the editor core is blocked, hence it is intended for
456 simple short lived (configuration) tasks.
458 At this time there exists no API stability guarantees.
461 - `MODE_NORMAL`, `MODE_OPERATOR_PENDING`, `MODE_INSERT`, `MODE_REPLACE`, `MODE_VISUAL`, `MODE_VISUAL_LINE` mode constants
462 - `lexers` LPeg lexer support module
469 - `windows()` iterator
473 - `textobject_register(function)` register a Lua function as a text object, returns associated `id` or `-1`
474 - `textobject(id)` select/execute a text object
475 - `motion_register(function)` register a Lua function as a motion, returns associated `id` or `-1`
476 - `motion(id)` select/execute a motion
477 - `map(mode, key, function)` map a Lua function to `key` in `mode`
479 - `content(pos, len)`
480 - `insert(pos, data)`
484 - `lines[0..#lines+1]` array giving read/write access to lines
487 - `syntax` lexer name used for syntax highlighting or `nil`
489 - `line` (1 based), `col` (0 based)
491 - `pos` bytes from start of file (0 based)
493 Most of the exposed objects are managed by the C core. Allthough there
494 is a simple object life time management mechanism in place, it is still
495 recommended to *not* let the Lua objects escape from the event handlers
496 (e.g. by assigning to global Lua variables).
498 Text management using a piece table/chain
499 =========================================
501 The core of this editor is a persistent data structure called a piece
502 table which supports all modifications in `O(m)`, where `m` is the number
503 of non-consecutive editing operations. This bound could be further
504 improved to `O(log m)` by use of a balanced search tree, however the
505 additional complexity doesn't seem to be worth it, for now.
507 The actual data is stored in buffers which are strictly append only.
508 There exist two types of buffers, one fixed-sized holding the original
509 file content and multiple append-only ones storing the modifications.
511 A text, i.e. a sequence of bytes, is represented as a double linked
512 list of pieces each with a pointer into a buffer and an associated
513 length. Pieces are never deleted but instead always kept around for
514 redo/undo support. A span is a range of pieces, consisting of a start
515 and end piece. Changes to the text are always performed by swapping
516 out an existing, possibly empty, span with a new one.
518 An empty document is represented by two special sentinel pieces which
526 Loading a file from disk is as simple as mmap(2)-ing it into a buffer,
527 creating a corresponding piece and adding it to the double linked list.
528 Hence loading a file is a constant time operation i.e. independent of
529 the actual file size (assuming the operating system uses demand paging).
531 /-+ --> +-----------------+ --> +-\
532 | | | I am an editor! | | |
533 \-+ <-- +-----------------+ <-- +-/
539 Inserting a junk of data amounts to appending the new content to a
540 modification buffer. Followed by the creation of new pieces. An insertion
541 in the middle of an existing piece requires the creation of 3 new pieces.
542 Two of them hold references to the text before respectively after the
543 insertion point. While the third one points to the newly added text.
545 /-+ --> +---------------+ --> +----------------+ --> +--+ --> +-\
546 | | | I am an editor| |which sucks less| |! | | |
547 \-+ <-- +---------------+ <-- +----------------+ <-- +--+ <-- +-/
550 modification buffer content: "which sucks less"
552 During this insertion operation the old span [3,3] has been replaced
553 by the new span [4,6]. Notice that the pieces in the old span were not
554 changed, therefore still point to their predecessors/successors, and can
555 thus be swapped back in.
557 If the insertion point happens to be at a piece boundary, the old span
558 is empty, and the new span only consists of the newly allocated piece.
563 Similarly a delete operation splits the pieces at appropriate places.
565 /-+ --> +-----+ --> +--+ --> +-\
567 \-+ <-- +-----+ <-- +--+ <-- +-/
570 Where the old span [4,5] got replaced by the new span [7,7]. The underlying
571 buffers remain unchanged.
576 Notice that the common case of appending text to a given piece is fast
577 since, the new data is simply appended to the buffer and the piece length
578 is increased accordingly. In order to keep the number of pieces down,
579 the least recently edited piece is cached and changes to it are done
580 in place (this is the only time buffers are modified in a non-append
581 only way). As a consequence they can not be undone.
586 Since the buffers are append only and the spans/pieces are never destroyed
587 undo/redo functionality is implemented by swapping the required spans/pieces
590 As illustrated above, each change to the text is recorded by an old and
591 a new span. An action consists of multiple changes which logically belong
592 to each other and should thus also be reverted together. For example
593 a search and replace operation is one action with possibly many changes
596 The text states can be marked by means of a snapshotting operation.
597 Snapshotting saves a new node to the history graph and creates a fresh
598 Action to which future changes will be appended until the next snapshot.
600 Actions make up the nodes of a connected digraph, each representing a state
601 of the file at some time during the current editing session. The edges of the
602 digraph represent state transitions that are supported by the editor. The edges
603 are implemented as four Action pointers (`prev`, `next`, `earlier`, and `later`).
605 The editor operations that execute the four aforementioned transitions
606 are `undo`, `redo`,`earlier`, and `later`, respectively. Undo and
607 redo behave in the traditional manner, changing the state one Action
608 at a time. Earlier and later, however, traverse the states in chronological
609 order, which may occasionally involve undoing and redoing many Actions at once.
614 Because we are working with a persistent data structure marks can be
615 represented as pointers into the underlying (append only) buffers.
616 To get the position of an existing mark it suffices to traverse the
617 list of pieces and perform a range query on the associated buffer
618 segments. This also nicely integrates with the undo/redo mechanism.
619 If a span is swapped out all contained marks (pointers) become invalid
620 because they are no longer reachable from the piece chain. Once an
621 action is undone, and the corresponding span swapped back in, the
622 marks become visible again. No explicit mark management is necessary.
627 The main advantage of the piece chain as described above is that all
628 operations are performed independent of the file size but instead linear
629 in the number of pieces i.e. editing operations. The original file buffer
630 never changes which means the `mmap(2)` can be performed read only which
631 makes optimal use of the operating system's virtual memory / paging system.
633 The maximum editable file size is limited by the amount of memory a process
634 is allowed to map into its virtual address space, this shouldn't be a problem
635 in practice. The whole process assumes that the file can be used as is.
636 In particular the editor assumes all input and the file itself is encoded
637 as UTF-8. Supporting other encodings would require conversion using `iconv(3)`
638 or similar upon loading and saving the document.
640 Similarly the editor has to cope with the fact that lines can be terminated
641 either by `\n` or `\r\n`. There is no conversion to a line based structure in
642 place. Instead the whole text is exposed as a sequence of bytes. All
643 addressing happens by means of zero based byte offsets from the start of
646 The main disadvantage of the piece chain data structure is that the text
647 is not stored contiguous in memory which makes seeking around somewhat
648 harder. This also implies that standard library calls like the `regex(3)`
649 functions can not be used as is. However this is the case for all but
650 the most simple data structures used in text editors.
652 Syntax Highlighting using Parsing Expression Grammars
653 =====================================================
655 [Parsing Expression Grammars](https://en.wikipedia.org/wiki/Parsing_expression_grammar)
656 (PEG) have the nice property that they are closed under composition.
657 In the context of an editor this is useful because lexers can be
658 embedded into each other, thus simplifying syntax highlighting
661 Vis reuses the [Lua](http://www.lua.org/) [LPeg](http://www.inf.puc-rio.br/~roberto/lpeg/)
662 based lexers from the [Scintillua](http://foicica.com/scintillua/) project.
667 This section contains some ideas for further architectural changes.
669 Event loop with asynchronous I/O
670 --------------------------------
672 The editor core should feature a proper main loop mechanism supporting
673 asynchronous non-blocking and always cancelable tasks which could be
674 used for all possibly long lived actions such as:
677 - `:substitute` and `:write` commands
679 - compiler integration (similar to vim's quick fix functionality)
681 Client/Server Architecture / RPC interface
682 ------------------------------------------
684 In principle it would be nice to follow a similar client/server approach
685 as [sam/samterm](http://sam.cat-v.org/) i.e. having the main editor as a
686 server and each window as a separate client process with communication
687 over a unix domain socket.
689 That way window management would be taken care of by dwm or dvtm and the
690 different client processes would still share common cut/paste registers
693 This would also enable a language agnostic plugin system.
695 Efficient Search and Replace
696 ----------------------------
698 Currently the editor copies the whole text to a contiguous memory block
699 and then uses the standard regex functions from libc. Clearly this is not
700 a satisfactory solution for large files.
702 The long term solution is to write our own regular expression engine or
703 modify an existing one to make use of the iterator API. This would allow
704 efficient search without having to double memory consumption.
706 The used regex engine should use a non-backtracking algorithm. Useful
709 - [Russ Cox's regex page](http://swtch.com/~rsc/regexp/)
710 - [TRE](https://github.com/laurikari/tre) as
711 [used by musl](http://git.musl-libc.org/cgit/musl/tree/src/regex)
712 which uses a parallel [TNFA matcher](http://laurikari.net/ville/spire2000-tnfa.ps)
713 - [Plan9's regex library](http://plan9.bell-labs.com/sources/plan9/sys/src/libregexp/)
714 which has its root in Rob Pike's sam text editor
715 - [RE2](https://github.com/google/re2) C++ regex library
720 A quick overview over the code structure to get you started:
722 File(s) | Description
723 ------------------- | -----------------------------------------------------
724 `text.[ch]` | low level text / marks / {un,re}do / piece table implementation
725 `text-motions.[ch]` | movement functions take a file position and return a new one
726 `text-objects.[ch]` | functions take a file position and return a file range
727 `text-regex.[ch]` | text search functionality, designated place for regex engine
728 `text-util.[ch]` | text related utility functions mostly dealing with file ranges
729 `view.[ch]` | ui-independent viewport, shows part of a file, syntax highlighting, cursor placement, selection handling
730 `ui.h` | abstract interface which has to be implemented by ui backends
731 `ui-curses.[ch]` | a terminal / curses based user interface implementation
732 `buffer.[ch]` | dynamically growing buffer used for registers and macros
733 `ring-buffer.[ch]` | fixed size ring buffer used for the jump list
734 `map.[ch]` | crit-bit tree based map supporting unique prefix lookups and ordered iteration. used to implement `:`-commands
735 `vis.h` | vi(m) specific editor frontend library public API
736 `vis.c` | vi(m) specific editor frontend implementation
737 `vis-core.h` | internal header file, various structs for core editor primitives
738 `vis-cmds.c` | vi(m) `:`-command implementation
739 `vis-modes.c` | vi(m) mode switching, enter/leave event handling
740 `vis-motions.c` | vi(m) cursor motion implementation
741 `vis-operators.c` | vi(m) operator implementation
742 `vis-lua.c` | Lua bindings, exposing core vis APIs for in process extension
743 `main.c` | key action definitions, program entry point
744 `config.def.h` | definition of default key bindings (mapping of key actions)
745 `visrc.lua` | Lua startup and configuration script
746 `lexers/` | Lua LPeg based lexers used for syntax highlighting
748 Testing infrastructure for the [low level text manipulation routines]
749 (https://github.com/martanne/vis/tree/test/test/text), [vim compatibility]
750 (https://github.com/martanne/vis/tree/test/test/vim) and [vis specific features]
751 (https://github.com/martanne/vis/tree/test/test/vis) is in place, but
752 lacks proper test cases.