Electronic Inking Process

• US 20060218171A1
• Filed: 06/08/2006
• Published: 09/28/2006
• Est. Priority Date: 08/21/2003
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Sutanto, Herry, Wakeam, Jamie, Duncan, Richard, Szilagyi, Zoltan, Kannapel, Timothy H., Raghupathy, Sashi
• Granted Patent: US 7,631,001 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06V 30/333 Preprocessing; Feature extraction
• CPC Class Codes: G06V 30/414 Extracting the geometrical structure, e.g. layout tree; Block segmentation, e.g. bounding boxes for graphics or text
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99938 Concurrency, e.g. lock management in shared database
• CPC Class Codes: Y10S 707/99939 Privileged access
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99952 Coherency, e.g. same view to multiple users
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

Claims

1. A method of reconciling a first data structure with a second data structure, comprising:

accessing each node in the first data structure for which a change has been made to a corresponding node in the second data structure; and

for each accessed node,

determining if the change made to the corresponding node in the second data structure creates a collision with the first data structure; and

if the change made to the corresponding node in the second data structure does not create a collision with the fast data structure, making the change to the accessed node in the first data structure.

2. The method recited in claim 1, further comprising:

determining that the change made to the corresponding node in the second data structure creates a collision with the first data structure; and

determining whether the collision is a mandatory collision or a discretionary collision.

3. The method recited in claim 2, further comprising:

determining that the change made to the corresponding node in the second data structure creates a discretionary collision with the first data structure, and

making the change to the accessed node in the first data structure.

4. The method recited in claim 2, further comprising:

determining that the change made to the corresponding node in the second data structure creates a discretionary collision with the first data structure;

determining whether the discretionary collision will allow the change made to the corresponding node in the second data structure to be made to the accessed node; and

if the discretionary collision will allow the change made to the corresponding node in the second data structure to be made to the accessed node, making the change to the accessed node.

5. The method recited in claim 2, further comprising determining whether a collision is discretionary based upon interface rules for the first data structure.

6. The method recited in claim 1, further comprising:

employing a log of changes to the second data structure to determine, for each accessed node in the first data structure, if a change made to a corresponding node in the second data structure.