|
Home | Switchboard | Unix Administration | Red Hat | TCP/IP Networks | Neoliberalism | Toxic Managers |
(slightly skeptical) Educational society promoting "Back to basics" movement against IT overcomplexity and bastardization of classic Unix |
|
VIM distinguishes between windows and buffers.
Such a logical approach is an important advantage of all orthodox editors that provides additional flexibility.
|
The topic, which is often glossed over or omitted entirely in most proprietary 'vi' documentation, can be stated very simply: any named text buffer can be treated as a 'vi' command-mode macro by typing the at-sign character ("@") followed by the name of the buffer. If named buffer "a" contains H!Lsort then "@a" from 'vi' command mode will sort the lines now on the terminal screen.
The ability to execute a named text buffer as if the buffer were a sequence of commands allows 'vi' macros sometimes to operate in a self-modifying way, because a macro can load a text buffer from text in the current file and then invoke that text buffer as a command macro, without having to know in advance what the text is that will be loaded into the buffer.
A hidden buffer is not displayed in a window, but is still loaded into memory. This makes it possible to jump from file to file, without the need to read or write the file every time you get another buffer in a window.
If the option 'hidden' ('hid') is set, abandoned buffers are kept for all commands that start editing another file: ":edit", ":next", ":tag", etc. The commands that move through the buffer list sometimes make the current buffer hidden although the 'hidden' option is not set. This happens when a buffer is modified, but is forced (with '!') to be removed from a window, and 'autowrite' is off or the buffer can't be written.
You can make a hidden buffer not hidden by starting to edit it with any command. Or by deleting it with the ":bdelete" command.
When you try to quit Vim while there is a hidden, modified buffer, you will get an error message and Vim will make that buffer the current buffer. You can then decide to write this buffer (":wq") or quit without writing (":q!"). Be careful: there may be more hidden, modified buffers! :files
:buffers :ls Show all buffers. Example:
1 #h "/test/text" line 1 2 - "asdf" line 0 3 % + "version.c" line 1Each buffer has a unique number. That number will not change, so you can always go to a specific buffer with ":buffer N" or "N CTRL-^", where N is the buffer number. '-' indicates a buffer that is not loaded. 'h' indicates a hidden buffer: It is loaded, but currently not displayed in a window. '%' indicates the buffer in the current window. '#' indicates the alternate buffer for ":e #" or CTRL-^. '+' indicates a modified buffer.
:bad[d] [+lnum] {fname} Add file name {fname} to the buffer list, without loading it. If "lnum" is specified, the cursor will be positioned at that line when the buffer is first entered. Note that other commands after the + will be ignored.
:[N]bd[elete] :bd[elete] [N] Unload buffer [N] (default: current buffer) and delete it from the buffer list. If the buffer was changed, this fails. The file remains unaffected. Any windows for this buffer are closed. If buffer [N] is the current buffer, another buffer will be displayed instead. This is the most recent entry in the jump list that points into a loaded buffer.
:[N]bdelete! :bdelete! [N] Unload buffer [N] (default: current buffer) and delete it from the buffer list. If the buffer was changed the changes are lost. The file remains unaffected. Any windows for this buffer are closed. If buffer [N] is the current buffer, another buffer will be displayed instead. This is the most recent entry in the jump list that points into a loaded buffer.
:bdelete[!] {bufname} Like ":bdelete[!] [N]", but buffer given by name. Note that a buffer whose name is a number cannot be referenced by that name; use the buffer number instead. Insert a backslash before a space in a buffer name.
:N,Mbdelete[!] do ":bdelete[!]" for all buffers in the range N to M (inclusive).
:bdelete[!] N1 N2 ... do ":bdelete[!]" for buffer N1, N2, etc.
The arguments can be buffer numbers or buffer names (but not buffer names
that are a number).
Insert
a
backslash before a
space
in a buffer name. :[N]bun[load] :bun[load] [N] Unload buffer [N] (default:
current buffer). The memory allocated for this buffer will be freed.
The buffer remains in the buffer list. If the buffer was changed,
this fails. Any
windows
for this buffer are closed. If buffer [N] is the current buffer, another
buffer will be displayed instead.
This is the most recent entry in the jump list that points into a loaded
buffer.
:[N]bunload!
:bunload! The memory allocated for this buffer will
be freed. The buffer remains in the buffer list. If the buffer
was changed, the changes are lost. Any
windows
for this buffer are closed. If buffer [N] is the current buffer, another
buffer will be displayed instead. This is the most recent entry in
the jump list that points into a loaded buffer.
:bunload[!] {bufname} Like ":bunload[!] [N]", but buffer given by
name. Note that a buffer whose name is a number cannot be referenced
by that name; use the buffer number instead.
Insert
a
backslash before a
space
in a buffer name.
:N,Mbunload[!] do ":bunload[!]" for all
buffers
in the range N to
M (inclusive).
:bunload[!] N1 N2 ... do ":bunload[!]" for buffer N1, N2, etc.
The arguments can be buffer numbers or buffer names (but not buffer names
that are a number).
Insert
a
backslash before a
space
in a buffer name.
:[N]b[uffer][!] [N] Edit buffer [N] from the buffer list. If
[N] is not given, the current buffer remains being edited. See |:buffer-!|
for[!].
:[N]b[uffer][!] {filename}Edit buffer for {filename} from the buffer
list. See |:buffer-!|
for [!]. Split window and edit buffer [N] from the buffer list.
If [N] is not given, the current buffer is edited. Respects the "useopen"
setting of
'switchbuf' when splitting.
:[N]sb[uffer] {filename} Split window and edit buffer for {filename}
from the buffer list.
:[N]bn[ext][!] [N] Go to [N]th next buffer in buffer list.
[N] defaults to one. Wraps around the end of the buffer list. See
|:buffer-!|
for
[!]. If you are in a help buffer, this takes you to the next help buffer
(if there is one). Similarly, if you are in a normal (non-help) buffer,
this takes you to the next normal buffer. This is so that if you have invoked
help, it doesn't get in the way when you're browsing code/text
buffers.
The next three commands also work like this.
:[N]sbn[ext] [N] Split window and go to [N]th next buffer in buffer
list. Wraps around the end of the buffer list. Uses
'switchbuf'
:[N]bN[ext][!] [N] :[N]bp[revious][!] [N] Go to [N]th previous buffer
in buffer list. [N] defaults to one. Wraps around the start
of the buffer list. See |:buffer-!|
for [!] and
'switchbuf'.
:[N]sbN[ext] [N] :[N]sbp[revious] [N] Split window and go to [N]th
previous buffer in buffer list. + Wraps around the start of the buffer list.
Uses
'switchbuf'.
:br[ewind][!] Go to first buffer in buffer list. See |:buffer-!|
for [!].
:sbr[ewind] Split window and go to first buffer in buffer list. Respects
'switchbuf' option.
:bl[ast][!] Go to last buffer in buffer list. See |:buffer-!|
for [!].
:sbl[ast] Split window and go to last buffer in buffer list. Respects
'switchbuf' option.
:[N]bm[odified][!] [N] Go to [N]th next modified buffer in buffer
list.
:[N]sbm[odified] [N] Split window and go to [N]th next modified buffer
in buffer list. Respects
'switchbuf' option.
:[N]unh[ide] [N] :[N]sun[hide] [N] Rearrange the screen to open one
window for each loaded buffer in the buffer list. When a
count
is given, this is the maximum number of
windows
to open.
:[N]ba[ll] [N] :[N]sba[ll] [N] Rearrange the screen to open one window
for each buffer in the buffer list. When a
count
is given, this is the maximum
number of
windows
to open. Buf/Win Enter/Leave autocommands are not executed for the
new
windows
here, that's only done
when they are really entered.
Note: All the commands above that start editing another buffer, keep the
'readonly' flag as it was. This differs from the ":edit"
command, which sets the
'readonly' flag each time the file is read.
|
Switchboard | ||||
Latest | |||||
Past week | |||||
Past month |
Google matched content |
Society
Groupthink : Two Party System as Polyarchy : Corruption of Regulators : Bureaucracies : Understanding Micromanagers and Control Freaks : Toxic Managers : Harvard Mafia : Diplomatic Communication : Surviving a Bad Performance Review : Insufficient Retirement Funds as Immanent Problem of Neoliberal Regime : PseudoScience : Who Rules America : Neoliberalism : The Iron Law of Oligarchy : Libertarian Philosophy
Quotes
War and Peace : Skeptical Finance : John Kenneth Galbraith :Talleyrand : Oscar Wilde : Otto Von Bismarck : Keynes : George Carlin : Skeptics : Propaganda : SE quotes : Language Design and Programming Quotes : Random IT-related quotes : Somerset Maugham : Marcus Aurelius : Kurt Vonnegut : Eric Hoffer : Winston Churchill : Napoleon Bonaparte : Ambrose Bierce : Bernard Shaw : Mark Twain Quotes
Bulletin:
Vol 25, No.12 (December, 2013) Rational Fools vs. Efficient Crooks The efficient markets hypothesis : Political Skeptic Bulletin, 2013 : Unemployment Bulletin, 2010 : Vol 23, No.10 (October, 2011) An observation about corporate security departments : Slightly Skeptical Euromaydan Chronicles, June 2014 : Greenspan legacy bulletin, 2008 : Vol 25, No.10 (October, 2013) Cryptolocker Trojan (Win32/Crilock.A) : Vol 25, No.08 (August, 2013) Cloud providers as intelligence collection hubs : Financial Humor Bulletin, 2010 : Inequality Bulletin, 2009 : Financial Humor Bulletin, 2008 : Copyleft Problems Bulletin, 2004 : Financial Humor Bulletin, 2011 : Energy Bulletin, 2010 : Malware Protection Bulletin, 2010 : Vol 26, No.1 (January, 2013) Object-Oriented Cult : Political Skeptic Bulletin, 2011 : Vol 23, No.11 (November, 2011) Softpanorama classification of sysadmin horror stories : Vol 25, No.05 (May, 2013) Corporate bullshit as a communication method : Vol 25, No.06 (June, 2013) A Note on the Relationship of Brooks Law and Conway Law
History:
Fifty glorious years (1950-2000): the triumph of the US computer engineering : Donald Knuth : TAoCP and its Influence of Computer Science : Richard Stallman : Linus Torvalds : Larry Wall : John K. Ousterhout : CTSS : Multix OS Unix History : Unix shell history : VI editor : History of pipes concept : Solaris : MS DOS : Programming Languages History : PL/1 : Simula 67 : C : History of GCC development : Scripting Languages : Perl history : OS History : Mail : DNS : SSH : CPU Instruction Sets : SPARC systems 1987-2006 : Norton Commander : Norton Utilities : Norton Ghost : Frontpage history : Malware Defense History : GNU Screen : OSS early history
Classic books:
The Peter Principle : Parkinson Law : 1984 : The Mythical Man-Month : How to Solve It by George Polya : The Art of Computer Programming : The Elements of Programming Style : The Unix Hater’s Handbook : The Jargon file : The True Believer : Programming Pearls : The Good Soldier Svejk : The Power Elite
Most popular humor pages:
Manifest of the Softpanorama IT Slacker Society : Ten Commandments of the IT Slackers Society : Computer Humor Collection : BSD Logo Story : The Cuckoo's Egg : IT Slang : C++ Humor : ARE YOU A BBS ADDICT? : The Perl Purity Test : Object oriented programmers of all nations : Financial Humor : Financial Humor Bulletin, 2008 : Financial Humor Bulletin, 2010 : The Most Comprehensive Collection of Editor-related Humor : Programming Language Humor : Goldman Sachs related humor : Greenspan humor : C Humor : Scripting Humor : Real Programmers Humor : Web Humor : GPL-related Humor : OFM Humor : Politically Incorrect Humor : IDS Humor : "Linux Sucks" Humor : Russian Musical Humor : Best Russian Programmer Humor : Microsoft plans to buy Catholic Church : Richard Stallman Related Humor : Admin Humor : Perl-related Humor : Linus Torvalds Related humor : PseudoScience Related Humor : Networking Humor : Shell Humor : Financial Humor Bulletin, 2011 : Financial Humor Bulletin, 2012 : Financial Humor Bulletin, 2013 : Java Humor : Software Engineering Humor : Sun Solaris Related Humor : Education Humor : IBM Humor : Assembler-related Humor : VIM Humor : Computer Viruses Humor : Bright tomorrow is rescheduled to a day after tomorrow : Classic Computer Humor
The Last but not Least Technology is dominated by two types of people: those who understand what they do not manage and those who manage what they do not understand ~Archibald Putt. Ph.D
Copyright © 1996-2021 by Softpanorama Society. www.softpanorama.org was initially created as a service to the (now defunct) UN Sustainable Development Networking Programme (SDNP) without any remuneration. This document is an industrial compilation designed and created exclusively for educational use and is distributed under the Softpanorama Content License. Original materials copyright belong to respective owners. Quotes are made for educational purposes only in compliance with the fair use doctrine.
FAIR USE NOTICE This site contains copyrighted material the use of which has not always been specifically authorized by the copyright owner. We are making such material available to advance understanding of computer science, IT technology, economic, scientific, and social issues. We believe this constitutes a 'fair use' of any such copyrighted material as provided by section 107 of the US Copyright Law according to which such material can be distributed without profit exclusively for research and educational purposes.
This is a Spartan WHYFF (We Help You For Free) site written by people for whom English is not a native language. Grammar and spelling errors should be expected. The site contain some broken links as it develops like a living tree...
|
You can use PayPal to to buy a cup of coffee for authors of this site |
Disclaimer:
The statements, views and opinions presented on this web page are those of the author (or referenced source) and are not endorsed by, nor do they necessarily reflect, the opinions of the Softpanorama society. We do not warrant the correctness of the information provided or its fitness for any purpose. The site uses AdSense so you need to be aware of Google privacy policy. You you do not want to be tracked by Google please disable Javascript for this site. This site is perfectly usable without Javascript.
Last modified: March 12, 2019