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

Claim 2

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.

Claim 3

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

Claim 4

The method of claim 1, further comprising: performing a function using the second component before the traversal of the data structure is completed.

Claim 5

The method of claim 1, further comprising: providing a plurality of traversal routines that sequentially execute to identify a virtual link between components.

Claim 6

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.

Claim 7

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.

Claim 8

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

Claim 9

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

Claim 10

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

Claim 11

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

Claim 12

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

Claim 13

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.

Claim 14

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.

Claim 15

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.

Claim 16

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.

Claim 17

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.

Claim 18

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.

Claim 19

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.

Claim 20

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

Claim 21

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.

Claim 22

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.

Claim 23

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

Claim 24

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