Patent classifications
G06F8/48
Hierarchies to generate animation control rigs
An animation system is provided for generating an animation control rig for character development, configured to manipulate a skeleton of an animated character. Hierarchical representation of puppets includes groups of functions related in a hierarchy according to character specialization for creating the animated rig are derived using base functions of a core component node. The hierarchical nodes may include an archetype node, at least one appendage node, and at least one feature node. In some implementations, portions of a hierarchical node, including the functions from the core component node, may be shared to generate different animation rigs for a variety of characters. In some implementations, portions of a hierarchical node, including the component node functions, may be reused to build similar appendages of a same animation rig.
Blackbox matching engine
A method and apparatus are disclosed for enhancing operable functionality of input source code files from a software program by identifying a first code snippet and a first library function which generate similar outputs from a shared input by parsing each and every line of code in a candidate code snippet to generate a templatized code snippet data structure for the first code snippet, and then testing the templatized code snippet data structure against extracted library function information to check for similarity of outputs between the first code snippet and the first library function in response to a shared input so that the developer is presented with a library function recommendation which includes the first code snippet, the first library function, and instructions for replacing the first code snippet with the first library function.
AUTOMATIC PERFORMANCE TELEMETRY
The disclosed techniques assist in diagnosing performance problems of a software application. A profiling module dynamically instruments the application at runtime by intercepting a request to compile one of the application's functions and augmenting the function with performance measuring code. This way, instrumentation is installed without recompiling the application. The execution time of a synchronous function is tracked by adding a local variable that stores function entry time, and by inserting code at each function exit point that computes the elapsed time. The execution time of an async function that executes across multiple threads is measured by repurposing a state machine value to also store the initial function entry time. Instrumented functions that are executed at a rate exceeding a threshold are un-instrumented to avoid self-inflicted performance problems. Function invocations associated with a particular activity, such as responding to a particular web request, may be correlated.
Integrated development environment for developing and compiling query language schemas for application program interfaces
An integrated development environment (IDE) system that may provide runtime validation, and incremental compilation and linking of multiple schema resources for a query language such as e.g., GraphQL. The runtime validation may be performed during the incremental compilation and linking process. If errors in the source code are detected during the runtime validation process, the compilation and linking process may be stopped without generating runtime objects.
REDUCING A DELIVERY SIZE OF A SOFTWARE UPDATE
Aspects of the invention include includes detecting a change in a code section of a source code in relation to a reference code section. An incremental section is created in object code, the incremental section includes an object code section describing the change in the code section and a symbol section describing a change to a symbol associated with the changed code section. The incremental section is attached to a software update. The software update to a target computer system.
Blackbox Matching Engine
A method and apparatus are disclosed for enhancing operable functionality of input source code files from a software program by identifying a first code snippet and a first library function which generate similar outputs from a shared input by parsing each and every line of code in a candidate code snippet to generate a templatized code snippet data structure for the first code snippet, and then testing the templatized code snippet data structure against extracted library function information to check for similarity of outputs between the first code snippet and the first library function in response to a shared input so that the developer is presented with a library function recommendation which includes the first code snippet, the first library function, and instructions for replacing the first code snippet with the first library function.
SYSTEM, METHOD AND COMPUTER READABLE MEDIUM FOR SPACE-EFFICIENT BINARY REWRITING
According to some illustrative embodiments of the invention, a method is performed that includes using a representation of a computer software program, using identified addresses which correspond to a part of the representation, and converting the representation into a created binary program, which includes reserving spaces at the identified addresses in the created binary program's address space at the same addresses as the identified addresses in the representation.
SYSTEMS AND METHODS FOR AUTOMAPPING SOURCE CODE TO MACHINE CODE
Systems and methods for mapping a location in a source code to a location in a machine code are disclosed. An identifier of the source code and an identifier of a first location of the source code are received. A marker is inserted in association with the source code based on the identifier of the first location. The source code is compiled into machine code. A second location associated with the marker is identified in the machine code. A third location is returned based on identifying the second location.
Document editing synchronization
Document editing synchronization techniques are described. In one or more implementations, one or more inputs are received via a user interface to edit a first portion of a first document, the first portion of the first document corresponding to a first portion of a second document. Responsive to receipt of an input to begin editing of a second portion of the first document, correspondence in the user interface of the second portion of the first document is indicated to a second portion of the second document automatically and without user intervention.
BYTECODE TRANSFORMATIONS USING VIRTUAL ARTIFACTS
Methods and systems for transforming bytecodes using virtual artifacts are disclosed. In one aspect, a method is provided that includes receiving a build request to convert source code into a first bytecode. A first virtual artifact may be identified within the source code and it may be determined that a local repository does not store the first virtual artifact. A real artifact that corresponds to the first virtual artifact may be retrieved from a centralized repository. A bytecode transformation may be applied to the real artifact to generate a second bytecode and the second bytecode may be added to the first bytecode.