Virtual navigator that produces virtual links at run time for identifying links in an electronic file

• US 6,006,236 A
• Filed: 12/22/1997
• Issued: 12/21/1999
• Est. Priority Date: 12/22/1997
• Status: Expired due to Term

• Current Assignee: Adobe Systems Incorporated (Adobe Inc.)
• Original Assignee: Adobe Systems Incorporated (Adobe Inc.)
• Inventors: Young, Jeffrey E.
• Primary Examiner(s): HO, RUAY L
• Application Number:
  US08/995,313
• Time in Patent Office: 729 Days
• Field of Search: 707/1-5, 707/10, 707/100-104, 707/200-206, 345/356, 345/357, 345/134, 345/132, 395/200.33, 395/200.52, 364/131, 364/132, 364/221.9, 364/222, 364/228, 364/229, 364/139
• US Class Current: 1/1
• CPC Class Codes: G06F 16/94 Hypermedia Hyperlinking G06F40/134
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure

Abstract

A method and apparatus for identifying links in an electronic document provides an electronic file as a data structure having components and having base links that define the structural relationship between the components, traverses the data structure using the base links, and produces a virtual link between two components by recognizing a characteristic shared by the components. The virtual link is identified when needed at run-time. A function may be performed using the components as components are identified.

Claims

1. A computer-implemented method for identifying links in an electronic file that is expressed as a data structure having a plurality of components and base links that define a structural relationship between the components, the method comprising:

traversing a data structure using a plurality of base links; and

producing at run time, a virtual link between a first component and a second component in the data structure by recognizing a characteristic shared by the first component and the second component.

2. The method of claim 1, wherein the virtual link is produced as needed.

3. The method of claim 1, further comprising:

performing a function using the second component before the traversal of the data structure is completed.

4. The method of claim 1, further comprising:

providing a plurality of traversal routines that sequentially execute to identify a virtual link between components.

5. The method of claim 1, wherein the second component inherits features from a component class, and a traversal routine recognizes the second component by recognizing members of the component class until the second component is found.

6. The method of claim 5, wherein the data structure is a hierarchical data structure and the traversal routine specifies a traversal path in terms of family, next, and previous structural relationships.

7. The method of claim 3, wherein the electronic file is an electronic document.

8. The method of claim 7, wherein the function performed on the second component is a renumbering function.

9. The method of claim 7, wherein the function performed on the second component generates text.

10. The method of claim 7, wherein the function performed on the second component locates a text string.

11. The method of claim 7, wherein the traversal routine identifies a plurality of virtual links between components.

12. The method of claim 11, wherein the data structure is a hierarchical data structure, the virtual links represent a hierarchical subset of components in the hierarchical data structure, the traversal routine specifies a traversal path in terms of family, next, or previous structural relationships, and the traversal routine specifies components according to data type.

13. A computer-implemented method for identifying links in an electronic file at run time, comprising:

providing an electronic file as a hierarchical data structure having a plurality of components and a plurality of base links that define a structural relationship between the components;

traversing the hierarchical data structure using a plurality of traversal routines that use the base links;

defining the traversal routines as classes that inherit features from other traversal routine classes;

using each traversal routine to identify a plurality of links between a plurality of components in the hierarchical data structure by recognizing a characteristic shared by the components; and

performing a function using each identified component at the time the component is identified.

14. A computer program operating on an electronic file arranged as a data structure having a plurality of components and a plurality of base links that define a structural relationship between the components, the computer program residing on a computer-readable medium, comprising instructions causing a computer to:

provide at least one traversal routine, with the traversal routine identifying, at run time, a link between a first component and a second component in a data structure by traversing the data structure using the base links.

15. The computer program of claim 14, wherein the second component inherits characteristics from a class of components and the traversal routine identifies the link by recognizing members of the class of components.

16. The computer program of claim 14, further comprising the instruction causing a computer to:

perform a function using the second component at the time the component is identified.

17. The computer program of claim 14, wherein the electronic file is an electronic document.

18. The computer program of claim 17, further comprising the instruction causing a computer to:

produce a plurality of links between a plurality of components in the data structure.

19. The computer program of claim 17, further comprising the instruction causing a computer to:

perform a function using the second component and subsequently linked components before traversal of the data structure is completed.

20. The computer program of claim 19, wherein the function performed is a renumbering function.

21. The computer program of claim 19, wherein the function performed generates text.