Systems and methods for managing preparation of graphical elements for presentation

• US 7,478,340 B2
• Filed: 10/22/2003
• Issued: 01/13/2009
• Est. Priority Date: 10/22/2003
• Status: Expired due to Fees

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Titov, Dmitry, Parikh, Sujal S.
• Primary Examiner(s): Huynh; Ba
• Assistant Examiner(s): Heffington; John M
• Application Number:
  US10/691,349
• Publication Number:
  US 20050091605A1
• Time in Patent Office: 1,910 Days
• Field of Search: 715/788, 715/248, 715/252, 715/764, 715/765, 715/771, 715/866, 345/619, 719/328
• US Class Current: 715/788
• CPC Class Codes: G06F 40/103 Formatting, i.e. changing of presentation of documents automatic justification G06F40/189; automatic line break hyphenation G06F40/191
• CPC Class Codes: G06F 40/106 Display of layout of documents; Previewing
• CPC Class Codes: G06F 9/451 Execution arrangements for user interfaces

Abstract

Methods and systems are provided for managing the preparation of graphical elements in computer application programs for presentation. The methods independently identify and measure, and identify and arrange, sets of elements. A computer-readable medium is also provided for facilitating the management of the preparation for presentation of graphical elements in computer application programs.

Claims

1. A method for managing the preparation of a set of graphical elements in a hierarchical structure for presentation, the method comprising:

identifying a first subset of the elements where measurement is desirable, wherein the measurement comprises measuring a root element and subsequently recursively measuring child elements of the root element,

identifying at least one island within the first subset of elements, wherein each element in the first subset has associated with it a respective island of elements;

wherein the at least one island includes the root element and at least one of the following;

zero of the child elements or more than zero of the child elements;

adding the root element to a first data structure;

identifying a second subset of the elements where arrangement is desirable, wherein the arrangement comprises arranging a root element and subsequently recursively arranging child elements of the root element;

identifying at least one island within the second subset of elements, wherein each element in the second subset has associated with it a respective island of elements and wherein the at least one island includes the root element and at least one of the following;

zero of the child elements or more than zero of the child elements;

adding the root element to a second data structure;

executing a first series of operations for measuring the elements comprising the first subset, wherein the first series of operations comprises;

a) identifying a maximal element represented in the first data structure, wherein the maximal element comprises the highest element in the first data structure, the first data structure comprising a hierarchical structure;

b) removing the maximal element'"'"'s representation in the first data structure;

c) measuring the maximal element;

repeating the listed steps until the first data structure is empty; and

executing a second series of operations for arranging the elements comprising the second subset;

issuing a notify message that the layout of the measured and arranged elements has been updated.

2. The method of claim 1 wherein the first and second data structures are queues.

3. The method of claim 1 wherein the second series of operations comprises:

a) identifying a maximal element represented in the second data structure;

b) removing the maximal element'"'"'s representation in the second data structure;

c) arranging the maximal element; and

repeating the listed steps until the second data structure is empty.

4. The method of claim 1 wherein the first series of operations further comprises:

d) notifying a parent element of the maximal element that the measurements of the maximal element have changed.

5. The method of claim 4 wherein, in response to the notification, a representation of the parent element is placed in the first data structure.

6. The method of claim 1 wherein the number of elements represented in the first data structure cannot exceed a fixed maximum number.

7. The method of claim 1 wherein the number of elements represented in the second data structure does not exceed a fixed maximum number.

8. The method of claim 1 wherein the first series of operations further comprises:

d) determining that an orphan element represented on the first data structure is not to be measured; and

e) removing from the data structure the representation of the orphan element.

21. The method of claim 1 further comprising:

determining if an element on the first data structure is a baby, wherein an element is a baby if it is a child of the root element being added to the first data structure; and

removing the baby from the first data structure to minimize the number of elements in the first data structure.

9. A system for managing the preparation of a set of graphical elements in a hierarchical structure for presentation, the system comprising:

a first subset of the set of graphical elements requiring measurement, wherein measurement comprises measuring a root element and subsequently recursively measuring child elements of the root element;

a second subset of the set of graphical elements requiring arrangement, wherein arrangement comprises arranging a root element and subsequently recursively arranging child elements of the root element;

using a first procedure for;

a) identifying at least one island within the first subset of elements, wherein the at least one island includes the root element and at least one of the following;

zero of the child elements or more than zero of the child elements;

b) adding the root element to a first data structure;

c) identifying a maximal element within the first data structure, wherein the maximal element comprises the highest element in the first data structure, the first data structure comprising a hierarchical structure;

d) removing the maximal element'"'"'s representation in the first data structure;

e) measuring the maximal element;

repeating the listed steps until the first data structure is empty; and

using a second procedure for;

a) identifying at least one island within the second subset of elements, wherein the at least one island includes the root element and at least one of the following;

zero of the child elements or more than zero of the child of child elements; and

b) adding the root element to a second data structure;

issuing a notify message that the layout of the measured and arranged elements has been undated.

10. The system of claim 9 wherein the second procedure comprises the steps of:

c) identifying a maximal element represented in the second data structure;

d) removing the maximal element'"'"'s representation in the second data structure;

e) arranging the maximal element; and

repeating the listed steps until the second data structure is empty.

11. The system of claim 9 wherein the first procedure further comprises:

f) notifying a parent element of the maximal element that the measurements of the maximal element have changed.

12. The system of claim 9 wherein the first procedure further comprises:

f) determining that an orphan element represented on the first data structure is not to be measured; and

g) removing from the first data structure the representation of the orphan element.

22. The system of claim 9, further comprising:

using the first procedure for determining if an element on the first data structure is a baby, wherein an element is a baby if it is a child of the root element being added to the first data structure; and

using the first procedure for removing the baby from the first data structure to minimize the number of elements in the first data structure.

13. A computer-readable medium including computer-executable instructions facilitating managing the preparation of graphical elements in a hierarchical structure for presentation in a system, the computer-executable instructions comprising:

computer executable instructions for;

identifying a first subset of the elements in a hierarchical structure where measurement is desirable, wherein measurement comprises measuring a root element and subsequently recursively measuring child elements of the root element;

identifying at least one island within the first subset of elements, wherein each element in the first subset has associated with it a respective island of elements, and wherein the at least one island includes the root element and at least one of the following;

zero of the child elements or more than zero of the child elements;

adding the root element to a first data structure;

identifying a second subset of the elements in a hierarchical structure where arrangement is desirable, wherein arrangement comprises arranging a root element and subsequently recursively arranging child elements of the root;

identifying at least one island within the second subset of elements, wherein each element in the second subset has associated with it a respective island of elements; and

wherein the at least one island includes the root element and at least one of the following;

zero of the child elements or more than zero of the child elements;

adding the root element to a second data structure;

executing a first series of operations for measuring the elements comprising the first subset, wherein the first series of operations comprises;

a) identifying a maximal element represented in the first data structure, wherein the maximal element comprises the highest element in the hierarchical structure;

b) removing the maximal element'"'"'s representation in the first data structure; and

c) measuring the maximal element;

repeating the listed steps until the first data structure is empty;

executing a second series of operations for arranging the elements comprising the second subset, wherein the internal arrangement functions comprise computing a final size for a child element and utilizing the computed size to set a location for displaying the child element, wherein the location is stored as a coordinate of a geometric shape representing the child element; and

issuing a notify message that the layout of the measured and arranged elements has been updated.

14. The computer-readable medium of claim 13 wherein the first and second data structures are queues.

15. The computer-readable medium of claim 13 wherein the second series of operations comprises:

a) identifying a maximal element represented in the second data structure;

b) removing the maximal element'"'"'s representation in the second data structure;

c) arranging the maximal element; and

repeating the listed steps until the second data structure is empty.

16. The computer-readable medium of claim 13 wherein step c) in the first series of operations comprises measuring an element from the island associated with the maximal element.

17. The computer-readable medium of claim 13 wherein step c) in the first series of operations comprises:

determining whether an element from the island associated with the maximal element requires measuring.

18. The computer-readable medium of claim 13 wherein the first series of operations further comprises:

d) notifying a parent element of the maximal element that the measurements of the maximal element have changed.

19. The computer-readable medium of claim 18 wherein the first series of operations further comprises:

e) in response to the notification in step d), placing a representation of the parent element in the first data structure.

20. The computer-readable medium of claim 13 wherein the first series of operations further comprises:

d) determining that an orphan element represented on the first data structure is not to be measured; and

e) removing from the data structure the representation of the orphan element.

23. The computer-readable medium of claim 13, wherein the first series of operations further comprises:

determining if an element on the first data structure is a baby, wherein an element is a baby if it is a child of the root element being added to the first data structure; and

removing the baby from the first data structure to minimize the number of elements in the first data structure.