Performance optimization for text layout processing
AssigneeMicrosoft Corporation
InventorsSergey Malkin, Antonio Vargas Garcia
Life of this patent
Estimating the term…
Abstract
A text formatting system includes a set of rules that are each configured to be applied to perform a text formatting adjustment. An engine is configured to process an input to make a determination as to which rules in the set should be applied so as to carry out a text formatting adjustment on the input. The engine is further configured to process the input without checking every rule in said set for applicability to every component of said input.
Claims8
A computer-implemented method of selectively checking a set of text formatting rules for applicability to an input, the method comprising:
- receiving an input;
- utilizing a computer processor that is a functional component of the computer to reference a cache to identify a sub-set of the set of text formatting rules, the sub-set containing rules that are specifically applicable to the input, wherein the sub-set is a limited number of rules selected from the set of text formatting rules, the limited number being less than all of the rules in the set of text formatting rules;
- wherein referencing a cache comprises maintaining an array of pointers to rules indicated in the cache as being associated with at least one glyph contained in the input;
- applying, to the input, rules indicated by the array of pointers, wherein the rules are applied in the order that they are listed in the set of rules;
- and
- dynamically updating the array of pointers to reflect changes made to the input.
A computer-implemented text formatting system comprising:
- a set of rules that are each configured to be applied to perform a text formatting adjustment;
- an engine that utilizes a computer processor that is a functional component of the computer to process an input and make a determination as to which rules in the set should be applied so as to carry out a text formatting adjustment on the input, wherein the engine also processes the input without checking every rule in said set for applicability to every component of said input, and wherein the engine checks a sub-set of rules for applicability to the input, the sub-set being a limited number of rules selected from said set, the limited number being less than all of the rules;
- wherein the engine checks a single rule, selected from said set, for applicability to less than all the components of the input;
- a cache stored on a computer-readable storage medium;
- an array of pointers to rules from the set indicated in the cache as being associated with at least one glyph contained in the input;
- and
- wherein the engine references the array of pointers when making the determination as to which rules in the set should be applied.
Dependencies are inferred from the claim text.