Loading patent…
OwnerMichael L. Van De Vanter, Kenneth B. Urquhartinventors
Estimating the term…
An editor or other software engineering tool may be configured to represent program code as an ordered set of lexical tokens and to maintain, coincident with an operation that modifies contents of the set, an undo object that identifies a pre-modification state of an insertion point. Often, the pre-modification state includes both a token coordinates and a character coordinates representation of the insertion point and storage of pre-modification state in, or in association with, the undo object facilitates efficient implementation of a undo operation, e.g., generally without recomputation of a coordinate representation that would otherwise scale with buffer size. In this way, lexical tokens corresponding to an inserted substring can be readily and efficiently excised to restore a pre-insertion tokenized list and insertion point state. Similarly, lexical tokens corresponding to a removed substring can be readily and efficiently reinstated to restore a pre-deletion tokenized list and insertion point state.
A method of providing undo operation support in an edit buffer represented as a ordered set of lexical tokens, the method comprising:
A software engineering tool comprising:
A software engineering tool encoded in one or more computer readable media as instructions executable to represent program code as lexical tokens and to maintain, consistent with an operation that removes one or more lexical tokens from the representation, an undo object that identifies the removed lexical tokens and a pre-modification state of an insertion point.
One or more computer readable media encoding a data structure that represents contents of an edit buffer as a sequence of lexical tokens, the encoded data structure comprising:
An apparatus comprising:
Dependencies are inferred from the claim text.