The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Feb. 18, 2020
Filed:
Jan. 07, 2010
Matthew J. Warren, Redmond, WA (US);
Avner Y. Aharoni, Seattle, WA (US);
Mads Torgersen, Issaquah, WA (US);
Renaud Paquay, Redmond, WA (US);
Neal M. Gafter, San Jose, CA (US);
Jared Parsons, Seattle, WA (US);
David N. Schach, Redmond, WA (US);
Aleksey V. Tsingauz, Seattle, WA (US);
Peter Golde, Bellevue, WA (US);
Kevin Pilch-bisson, Snohomish, WA (US);
Karen Liu, Bellevue, WA (US);
Matthew J. Warren, Redmond, WA (US);
Avner Y. Aharoni, Seattle, WA (US);
Mads Torgersen, Issaquah, WA (US);
Renaud Paquay, Redmond, WA (US);
Neal M. Gafter, San Jose, CA (US);
Jared Parsons, Seattle, WA (US);
David N. Schach, Redmond, WA (US);
Aleksey V. Tsingauz, Seattle, WA (US);
Peter Golde, Bellevue, WA (US);
Kevin Pilch-Bisson, Snohomish, WA (US);
Karen Liu, Bellevue, WA (US);
Microsoft Technology Licensing, LLC, Redmond, WA (US);
Abstract
Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.