akhanna@bbn.COM (Atul Khanna) (01/22/88)
I just discovered dabbrev-expand the other day. An awesome command,
which I immediately bound to the biggest function key on my bitgraph.
For those of you who do not know about it, here's the documenation:
dabbrev-expand:
Expand previous word "dynamically".
Expands to the most recent, preceding word for which this is a prefix.
If no suitable preceding word is found, words following point are considered.
A positive prefix argument, N, says to take the Nth backward DISTINCT
possibility. A negative argument says search forward. The variable
dabbrev-backward-only may be used to limit the direction of search to
backward if set non-nil.
If the cursor has not moved from the end of the previous expansion and
no argument is given, replace the previously-made expansion
with the next possible expansion not yet tried.
Anyway, the command would be much more useful if it could be told to
search for a match in a set of specified buffers, as opposed to just
the current one. Has anyone done this or know how to do it?
--------------------------------------------------------------------------
Atul C Khanna (akhanna@bbn.com)
BBN Communications Corporation 50 Moulton Street Cambridge, MA 02238
..!{decvax, wjh12, ihnp4, harvard}!bbnccv!akhanna
--
--------------------------------------------------------------------------
Atul C Khanna (akhanna@bbn.com)
BBN Communications Corporation 50 Moulton Street Cambridge, MA 02238
..!{decvax, wjh12, ihnp4, harvard}!bbnccv!akhanna