Microsoft Technology Licensing, LLC

Peter Villadsen

John Stairs

Marcos Calderon Macias

Per Bendsen

Peter Christensen

Tanmoy Dutta

Ramakanthachary S Gottumukkala

Gustavo A Plancarte

Uffe Kjall

Peter Sloth

Freddy Kristiansen

Gustavo Adolfo Plancarte Ibarra

Zhaoqi Chen

Jens Møller-Pedersen

Marcos Calderon

Jesper Theil Hansen

Jens Moller-Pedersen

An augmenting system for augmenting a program's original class with an augmenting class is provided. In some embodiments, the augmenting system receives a definition of an augmenting class that includes a data member. The augmenting system generates resolution code for the computer program. The resolution code is for accessing a reference to an original instance of the original class and providing a reference to a corresponding augmenting instance of the augmenting class. When processing a statement of the computer program that accesses the data member using the reference to the original instance, the augmenting system generates access code for the computer program. The access code uses the resolution code to retrieve the reference to the augmenting instance for the original instance and accesses the data member based on the retrieved reference to the augmenting instance.

Augmenting an original class with an augmenting class

Abstract Syntax Trees (ASTs) are generated using the source code of a programming language that include information relating to the structure of the program. The generation of the ASTs may be performed in parallel. The types are split into a number of modules (e.g. configurable) that form an assembly. During the different stages of the compilation process, each module may be compiled in parallel. As the different modules are being compiled (e.g. in parallel), compiler metadata from the different modules may be written to a repository accessible by the different compilation processes. After flowing through the compilation pipeline, each of the enriched ASTs are used for code generation where they are transformed into the target language (e.g. a code stream that can be executed on hardware). The executable code is then stored as part of the assembly. The storage of the code may also be performed in parallel.

Deeply parallel source code compilation

Concepts and technologies are described herein for incremental generation of managed assemblies. In accordance with some of the concepts and technologies disclosed herein, a compiler incrementally generates a managed assembly thereby facilitating a rapid application development environment in which changes to the assembly require recompilation of only a changed portion of the assembly instead of recompilation of the entire assembly.

Incremental generation of managed assemblies

Concepts and technologies are described herein for providing metadata-based eventing supporting operations on data. Application data such as classes and events can be stored in a table and can be associated with and/or described by application metadata. The application metadata also can specify one or more event handlers that reference one or more methods on a class. The event handlers can be invoked via various delegates linked to the one or more application metadata tables. When a create, update, or delete operation on the application data is received, the application metadata can be queried to determine if the application metadata describes event handlers associated with the application data. If event handlers associated with the application data exist, the event handlers can be invoked.

Metadata-based eventing supporting operations on data

Architecture allows a programmer to answer questions about the source code the programmer is authoring, questions that cannot be answered by other means. A searching mechanism is provided over a much more structured presentation of the source code. The architecture utilizes components that provide an intimate knowledge about the structure of the text, namely, the source code of some particular programming language. The search mechanism employs an abstract syntax tree representation of the code over which the search is conducted. The program source code (as edited by the programmer) is transformed into the abstract syntax tree to embody the structure of the program. If the syntax tree is provided in XML, for example, an XML search mechanism such as Xpath can be utilized to perform the actual searching. This tree is then queried, allowing richer searching criteria to be expressed (by virtue of the structured format of the tree).

Structured search in source code

A method, computer readable medium and system are provided which generate a model driven form user interface to represent an application model. The method includes selecting which of multiple different logical form types to use to generate the form user interface to represent the application model. The method also includes providing a first map. A display target independent logical form is generated using the application model, the selected form type and the first map.

Method and apparatus for generating user interfaces based upon automation with full flexibility

A method, computer readable medium and system are provided which generate a model driven form user interface. In accordance with the method, a data model is mapped to a user interface model using at least one declarative map. The one or more declarative maps used to map the data model to the user interface model can be explicit maps which are external to a mapping engine used to generate the user interface model and any intermediate models.

Growing community of inventors

Sammamish, WA, United States of America

Peter Villadsen