Undo/redo technique with insertion point state handling for token-oriented representation of program code

• US 20040006763A1
• Filed: 06/28/2002
• Published: 01/08/2004
• Est. Priority Date: 06/28/2002
• Status: Abandoned Application

• Current Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Urquhart, Kenneth B., Van De Vanter, Michael L.
• Application Number:
  US10/185,754
• Publication Number:
  US 20040006763A1
• Time in Patent Office: Days
• US Class Current: 717/110
• CPC Class Codes: G06F 40/166 Editing, e.g. inserting or deleting
• CPC Class Codes: G06F 8/33 Intelligent editors

Abstract

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.

Claims

1. A method of providing undo operation support in an edit buffer represented as a ordered set of lexical tokens, the method comprising:

maintaining, in correspondence with operations that modify contents of the edit buffer, an ordered set of undo objects that identify respective subsets of the lexical tokens corresponding to content removed by respective ones of the modifying operations; and

maintaining in correspondence with the undo objects, respective encodings of pre-modification states of an insertion point into the edit buffer.

2. The method of claim 1, further comprising:

storing the encodings of pre-modification insertion point states in respective ones of the undo objects.

3. The method of claim 1,

wherein pre-modification insertion point states encode both a token-coordinates representation of insertion point state and a character-coordinates representation of insertion point state.

4. The method of claim 3,

wherein the token-coordinates representation identifies both a token and a character-offset, zero or more, thereinto, which together corresponds to pre-modification insertion point state.

5. The method of claim 3,

wherein the character-coordinates representation at least partially encodes a total character offset into the edit buffer.

6. The method of claim 1, further comprising:

restoring, in correspondence with an undo operation, a corresponding removed one of the lexical token subsets;

restoring, in correspondence with the undo operation, the insertion point using a corresponding one of the pre-modification insertion point state encodings.

7. The method of claim 6,

wherein the restoring includes swapping a then current insertion point state with a pre-modification insertion point state encoding that corresponds to the removed one of the lexical token subsets.

8. The method of claim 6, further comprising:

subsequent to completion of the undo operation and in correspondence with a redo operation, reinstating the undone removal and swapping a then current insertion point state with an insertion point state encoding that corresponds to the reinstated removal.

9. The method of claim 1,

wherein the modifying operations include remove-type operations.

10. The method of claim 1,

wherein the modifying operations include replace-type operations.

11. The method of claim 1,

wherein the modifying operations include insert-type operations that split respective pre-existing ones of the lexical tokens.

12. The method of claim 1, further comprising:

restoring, coincident with an undo directive, the doubly-linked list of lexical tokens to a state that existed prior to prior to execution of a particular remove-type operation at least in part by reintroducing thereinto the sublist identified by a corresponding one of the undo objects; and

maintaining as a redo object, identification of at least the opposing end nodes of the reintroduced sublist.

13. A software engineering tool comprising:

a representation of program code encoded in a computer readable medium as a set of nodes, each node corresponding to a respective token recognized in accordance with an operative set of lexical rules;

functional encodings of edit methods executable to operate on the set of nodes; and

an undo-redo manager that maintains an ordered set of undo-redo objects in correspondence with operation of the edit methods, undo-type ones of the undo-redo objects including respective encodings of insertion point states prior to operation of the respective edit methods.

14. The software engineering tool of claim 13,

wherein redo-type ones of the undo-redo objects include respective encodings of insertion point states after undo of respective edit methods.

15. The software engineering tool of claim 13,

wherein the undo-redo manager further maintains the ordered set of undo-redo objects in correspondence with operation of undo and redo directives, wherein the maintaining includes swapping a pre-directive insertion point state with an insertion point state encoding that corresponds to respectively undone or redone edit operation.

16. The software engineering tool of claim 13, further comprising:

a functional encoding of an undo directive that reverses effects of a previously executed edit operation on state of the list and swaps a then current insertion point state with an insertion point state encoding that corresponds to insertion point state prior to the undone edit operation.

17. The software engineering tool of claim 13,

a functional encoding of a redo directive that reinstates effects of a previously executed edit method on state of the list and swaps a then current insertion point state with an insertion point state encoding that corresponds to insertion point state prior to the undone edit operation.

18. 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.

19. The software engineering tool of claim 18,

wherein the pre-modification state encodes a character coordinates representation of the insertion point.

20. The software engineering tool of claim 18,

wherein the pre-modification state encodes both a token coordinates representation and a character coordinates representation of the insertion point.

21. The software engineering tool of claim 20,

wherein the token coordinates representation identifies both a particular one of the lexical tokens and a character offset thereinto.

22. The software engineering tool of claim 18,

wherein the operation is an remove-type operation and the sublist of lexical tokens corresponds to a substring removed by the remove-type operation.

23. The software engineering tool of claim 18,

wherein the operation is an replace-type operation and the sublist of lexical tokens corresponds to a substring displaced by the remove-type operation.

24. The software engineering tool of claim 18,

wherein the one or more computer readable media are selected from the set of a disk, tape or other magnetic, optical, or electronic storage medium and a network, wireline, wireless or other communications medium.

25. 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:

a doubly linked list of nodes;

token representations each corresponding to at least one respective node of the list, wherein at least some of the token representations have associated substring encodings; and

an ordered representation of undo objects that identify (i) respective sublists of one or more lexical tokens introduced into or removed by a list modifying operation and (ii) a pre-modification state of an insertion point.

26. The encoded data structure of claim 25,

wherein the identification of pre-modification insertion point state allows reversal of introductions and removals, including update of insertion point state, in response to respective undo directives with a computational burden that is independent of size of the edit buffer and independent of size of the introduction or removal.

27. The encoded data structure of claim 25, embodied as a software object that defines at least one of the list modifying operations.

28. The encoded data structure of claim 25,

wherein the one or more computer readable media are selected from the set of a disk, tape or other magnetic, optical, or electronic storage medium and a network, wireline, wireless or other communications medium.

29. An apparatus comprising:

storage for a computer readable encoding of an edit buffer represented as a sequence of lexical tokens; and

means for maintaining an edit-operation-ordered representation of undo objects that each respective sublists of one or more lexical tokens introduced into or removed by a list modifying edit operation and a pre-modification state of an insertion point.

30. The apparatus of claim 29, further comprising:

means for reversing a particular execution of one of the list modifying edit operations using the sublist identification of a corresponding one of the undo objects and using the pre-modification insertion point state.

31. The apparatus of claim 30, further comprising:

means for supporting reinstatement of the reversed edit operation including means for swapping a then current insertion point state with an insertion point state encoding that corresponds to insertion point state prior to the reversed edit operation.