Lines Matching refs:changes

43 The treatment of files as a database, with changes logged
112 using a dataflow-like syntax for specifying changes.
139 perhaps while making thousands of changes
143 treat the file as a transaction database, implementing changes as atomic
144 updates.  These updates may be unwound easily to `undo' changes.
350 changes it to
472 u \f2n\fP	Undo last \f2n\fP (default 1) changes
735 simple changes are usually made.
736 For large or repetitive changes, however, a textual language
961 is badly flawed: it changes not only the variable
984 changes the remainder (identifiers
1081 changes the name associated with the file and displays the result:
1333 changes the mouse cursor to prompt the user to create one.
1346 changes the size of the indicated window, and
1386 it changes the mouse cursor from the usual arrow to a box with
1468 For example, to make a set of changes in a C subroutine, dot can be
1651 partially made changes (see the section below on `undoing'), and
1721 The only changes in the notation are two additions:
1922 Third, changes to files need be made by only two primitives:
1983 When changes are made the live part of blocks may change size.
2011 To reduce disc traffic, changes to a
2026 large changes are typically sequential,
2084 has an unusual method for managing changes to files.
2085 The command language makes it easy to specify multiple variable-length changes
2086 to a file millions of bytes long, and such changes
2096 many changes simultaneously.
2099 uses a two-pass algorithm for making changes, and treats each file as a database
2112 application in this way is to simplify tracking the addresses of changes
2114 The two-pass algorithm also allows all changes to apply to the
2120 from stumbling over changes made earlier in the execution.
2122 algorithm is cleaner than the way other UNIX editors allow changes to
2130 simple model, in which all changes in a command occur effectively
2136 (It is an error if the changes are not at monotonically greater
2139 offset by earlier changes, but that is straightforward and
2159 successive changes.
2179 so a cache was added to coalesce nearby changes,
2180 replacing multiple small changes by a single larger one.
2186 to handle changes in non-monotonic order in the file; the caching method
2187 only works if changes don't overlap.
2189 if the changes were out of order, although
2192 restriction on global changes, which is sometimes, but rarely, an annoyance.
2221 This translates to about 500 changes per second.
2333 the host and terminal track changes through a per-file
2360 because all changes made on the terminal apply to parts of the file
2365 Small changes to pieces of the file loaded in the terminal
2367 Larger changes, and changes that fall entirely in the holes,
2385 Except for small changes to active pieces of the file, which are
2394 are generated by the routine that applies the transcript of the changes
2397 Since changes are undone by the same update routine,
2400 the usual messages describing changes to the file are sufficient
2441 they also clump screen updates so that complicated changes to the
2542 When making changes to the display, most of the original image will
2572 because changes are made synchronously and because the contents of the window
2583 However, when multi-file changes are being made, or when
2620 for every change, or clipping all the changes made to the image
2629 exist only while multi-window changes are occurring,
3036 substitute command is necessary to make changes within lines, but in
3053 to have the recipe for that and a few other fancy changes.
3124 is able to make global changes to files that some of our other