Patent classifications
G06F8/41
HOTFIX METHOD AND APPARATUS
A hotfix method and apparatus are provided. The method comprises: compiling each SDK to obtain a compiled file of each SDK, a project to be fixed comprising at least two SDKs having a dependency relationship, and the compiled file of each SDK comprising an instrumentation code of each method to be fixed; if target methods to be fixed exist in the plurality of SDKs, retaining the instrumentation codes of said target methods in one of the SDKs, and deleting the instrumentation codes of said target methods in other SDKs; generating a hotfix patch, the hotfix patch comprising a patch corresponding to the instrumentation code of each method to be fixed; and when an access end accesses the compiled file of the at least one SDK of the project to be fixed, sending the hotfix patch to the access end.
CODE PROCESSING METHOD AND APPARATUS, AND STORAGE MEDIUM
This application discloses code processing methods, apparatuses, and storage media. An example method includes: obtaining a first code in low-level language and applicable to a source platform; decompiling the obtained first code to obtain an intermediate representation (IR); and then compiling the IR into a second code in low-level language and applicable to a first target platform, where the source platform and the target platform have different instruction sets.
PAGE RENDERING METHOD, APPARATUS, ELECTRONIC DEVICE, COMPUTER-READABLE STORAGE MEDIUM, AND COMPUTER PROGRAM PRODUCT
A page rendering method and apparatus. The method includes presenting a local compilation control, the local compilation control being directed to a page node to be locally compiled for a page to be viewed; obtaining a page node in response to a local compilation operation performed on the local compilation control; obtaining a code node corresponding to the page node of the page to be complied from a code dependency relationship, the code dependency relationship being constructed based on a dependency relationship between code files, and the code dependency relationship representing a hierarchical relationship between nodes corresponding to the code files; compiling a code file corresponding to the code node of the code to be complied to obtain a compiled code; and presenting the page to be viewed corresponding to the page node of the page to be complied based on the compiled code.
PAGE RENDERING METHOD, APPARATUS, ELECTRONIC DEVICE, COMPUTER-READABLE STORAGE MEDIUM, AND COMPUTER PROGRAM PRODUCT
A page rendering method and apparatus. The method includes presenting a local compilation control, the local compilation control being directed to a page node to be locally compiled for a page to be viewed; obtaining a page node in response to a local compilation operation performed on the local compilation control; obtaining a code node corresponding to the page node of the page to be complied from a code dependency relationship, the code dependency relationship being constructed based on a dependency relationship between code files, and the code dependency relationship representing a hierarchical relationship between nodes corresponding to the code files; compiling a code file corresponding to the code node of the code to be complied to obtain a compiled code; and presenting the page to be viewed corresponding to the page node of the page to be complied based on the compiled code.
Method of distributed graph loading for minimal communication and good balance via lazy materialization and directory indirection using indexed tabular representation
Techniques herein minimally communicate between computers to repartition a graph. In embodiments, each computer receives a partition of edges and vertices of the graph. For each of its edges or vertices, each computer stores an intermediate representation into an edge table (ET) or vertex table. Different edges of a vertex may be loaded by different computers, which may cause a conflict. Each computer announces that a vertex resides on the computer to a respective tracking computer. Each tracking computer makes assignments of vertices to computers and publicizes those assignments. Each computer that loaded conflicted vertices transfers those vertices to computers of the respective assignments. Each computer stores a materialized representation of a partition based on: the ET and vertex table of the computer, and the vertices and edges that were transferred to the computer. Edges stored in the materialized representation are stored differently than edges stored in the ET.
System configuration derivation device and system configuration derivation method
A system configuration derivation device 90 includes a storage unit 91 that stores a concretization rule in which a method is specified for concretizing abstract configuration information by confirming an unconfirmed portion of the abstract configuration information, which is information indicating configuration of a system in which the unconfirmed portion is included, and a generation unit 92 that concretizes the abstract configuration information included in configuration requirements of the system using the concretization rule stored to generate system configuration information, which is information indicating the configuration of the system in which the unconfirmed portion is not included, on the basis of the configuration requirements.
METHOD AND APPARATUS FOR IDENTIFYING DYNAMICALLY INVOKED COMPUTER CODE
A method, computerized apparatus and computer program product, the method comprising: obtaining user code; using static analysis, determining from the user code a collection of components upon which the user code depends, the collection of components comprising a first component representing a first entity, wherein one or more components of the collection of components is to be loaded dynamically by the user code; determining whether the user code or the first component from the collection of components uses dynamic invocation; subject to the user code or the first component using dynamic invocation, adding a new connection to a second component from the collection of components, the second component representing a second entity that augments an entity reachable from the first entity; and outputting information about the second entity.
SYSTEM AND METHOD TO COMPARE MODULES FOR THE COMMON CODE, REMOVE THE REDUNDANCY AND RUN THE UNIQUE WORKFLOWS
One example method includes receiving a code request, parsing code associated with the code request, storing, in a staging database, a portion of the code, traversing a codebase to identify any code in the codebase that matches the portion of the code, and when code is found in the codebase that matches the portion of the code, incrementing a green count and pushing the portion of the code to a redundant code bin, and when no code is found in the codebase that matches the portion of the code, incrementing a red counter and updating the codebase to include the portion of the code.
SYSTEM AND METHOD OF USING SUSTAINABILITY TO ESTABLISH COMPILATION METHODS ALIGNED WITH SUSTAINABILITY GOALS
Generating compilation methods using sustainability. Code is compiled in a manner that accounts for sustainability values. When a compilation request is received, sustainability values are identified. The resources needed to fulfill the compilation request are identified based on the sustainability values and available resources. Once the resources that are likely to best meet the sustainability values, the compilation request is performed using those resources.
COGNITIVE METHOD TO SPLIT MONOLITHIC ARCHITECTURE INTO MICROSERVICE ARCHITECTURE
A method and related system detail a split of an architecture of a monolithic application into an architecture of a micro service application. The method receives source code for the monolithic application, and maps the source code into a directed graph. The graph is split into subgraphs and optimized. The method further provides the detailing of the micro service application split, based on the subgraphs.