High performance navigator for parsing inputs of a message
AssigneeMicrosoft Corporation
InventorsAaron A. Stern, Geary L. Eppley, Umesh Madan
Life of this patent
Estimating the term…
Loading patent…
AssigneeMicrosoft Corporation
InventorsAaron A. Stern, Geary L. Eppley, Umesh Madan
Estimating the term…
Example embodiments provide a high performance navigator configured to lightly touch on the elements or input of a message, without necessarily having to build an entire tree structure for each input within the message. In addition, as portions of the inputs are identified as requiring further details, only those stub nodes representing that particular input will be created; thus avoiding the setup cost associated with loading an entire tree. Other example embodiments also provide for other optimizations such as reducing the class types of node allocations needed for navigating a particular message. For instance, a single class is defined that holds enough fields to store all of the information needed for numerous input nodes. Further, these common node structures can simultaneously generate as an array that further allows for more efficient navigation of the inputs.
In a message navigator that exposes inputs of a message as branches of a hierarchical data structure, a method of increasing navigation performance by enabling a load-on-demand feature that creates complete branches for only select inputs in order to reduce runtime setup costs for applications that do not need detailed branches for each input within the message, the method implemented by a computer comprising a processor and a memory, the method comprising:
Dependencies are inferred from the claim text.