Patent classifications
G06F8/31
OPTIMIZING ABAP DEVELOPMENT AS A SERVICE
A development account is provisioned, the provisioning including a request for a backing service. The backing service includes: generating a developer schema in a database, generating a table link in the developer schema to shared tables required for the new development environment, generating a delta table, and generating a union view with a defined instead-of-trigger used to write, update, or delete from the delta table upon a write, update, or delete operation on the union view. A runtime application server is obtained and a repository is configured in a version control system. The runtime application server is configured to connect to the generated developer schema of the provisioned development account, and an identifier is provided to the provisioned development account.
Application platform operable on network node
A formula-driven programming-environment is described, which may be used to provide an environment for applications to operate within a network node or other computing device. In one example, statements of a program may be interpreted to thereby execute formula-style commands within an address space defined and constrained in a memory device by the integrated development environment. The commands may obtain data, assign values to variables and access data from other node(s) by the interpretation of statements in the program and communicating over a network. The communicating may include queuing a message for transmission by the formula-driven programming-environment. The commands may provide named access or relative access to data in response to the interpretation of statements in the program. The commands may communicate with at least one application located on a remote computing device in response to the interpretation of statements in the program.
Automated code-generation for cross-language development, testing, and integration
A system and method provide for easy sharing of data between different software languages. A method begins by creating a definition defining a data structure with a domain specific language. The definition is then input to a code generator which generates data structures and algorithms in a first software language. The same generator software also creates equivalent data structures and algorithms in a second software language that is different than the first software language. The two output implementations provide compatible utilities for marshalling and de-marshalling data back and forth between the first software language and the second software language without requiring further manipulation of the two implementations.
Memory Model for a Layout Engine and Scripting Engine
Various embodiments provide an interface between a Web browser's layout engine and a scripting engine. The interface enables objects from the layout engine to be recognized by a memory manager in the scripting engine and interact in a streamlined, efficient manner. In accordance with one or more embodiments, the interface allows browser layout engine objects to be created as objects that are native to the scripting engine. Alternately or additionally, in some embodiments, the native objects are further configured to proxy functionality between the layout engine and the scripting engine.
Predictive injection of conversation fillers for assistant systems
In one embodiment, a method includes, by one or more computing systems, receiving, from a client system associated with a first user, a first user input from the first user, identifying one or more entities referenced by the first user input, determining a classification of the first user input based on a machine-learning classifier model, generating several candidate conversational fillers based on the classification of the first user input and the one or more identified entities, wherein each candidate conversational filler references at least one of the one or more identified entities, ranking the candidate conversational fillers based on a relevancy of the candidate conversational filler to the first user input and a decay model hysteresis, and sending instructions for presenting a top-ranked candidate conversational filler as an initial response to the first user.
MANAGING EXTERNAL FEEDS IN AN EVENT-BASED COMPUTING SYSTEM
At a cloud platform, a class of feed is received for an external feed corresponding to an information source, as are an instruction corresponding to a create operation for the external feed, and a dictionary input corresponding to parameters expected by the information source. The external feed produces a corresponding class of events. At the cloud platform, a handler is selected based on the received class of feed and the received create operation; the input dictionary is transferred to the handler; and the handler generates a unique destination to receive events for the class of events. The handler on the cloud platform generates a unique request to the information source to generate events of the class of feed to the unique destination and sends the request to the information source. Events generated from the information source responsive to the unique request are received at the unique destination.
Restricting class inheritance relationships
In an embodiment, a system may include a processor having memory storing processor-executable instructions for a programming environment. The processor may perform the following instructions. A first, second, and third class may be defined. The second class may be defined as being compatible with the first class. The third class may be defined as being incompatible with the first class. A fourth class may be defined as a subclass of both the first class and the second class. A fifth class may be prevented from being a subclass of both the first class and the third class.
Accurate static dependency analysis via execution-context type prediction
Exemplary embodiments provide methods, mediums, and systems for generating a runtime environment that is customized to a particular computer program, particularly in terms of the function definitions that support function calls made in the computer program. The customized runtime environment may therefore be smaller in size than a conventional runtime environment. To create such a customized runtime environment, an analyzer may be provided which monitors test executions of the computer program and/or performs a structural analysis of the source code of the computer program. The analyzer may determine a list of probabilistically or deterministically required function definitions, and provide the list to a component reducer. The component reducer may eliminate any function definitions not deemed to be required from a runtime environment, thereby producing a customized runtime environment that is built to support a particular computer program.
Method of achieving intra-machine workload balance for task chunks for distributed graph-processing systems
Techniques are provided for efficiently distributing graph data to multiple processor threads located on a server node. The server node receives graph data to be processed by the server node of a graph processing system. The received graph data is a portion of a larger graph to be processed by the graph processing system. In response to receiving graph data the server node compiles a list of vertices and attributes of each vertex from the graph data received. The server node then creates task chunks of work based upon the compiled list of vertices and their corresponding attribute data. The server node then distributes the task chunks to a plurality of threads available on the server node.
System of type inference for tuple graph programs
A programming model provides a method for type inference in programming operations. Information defining one or more attributes of an operation is received, the information specifying a field including a field name and a field type identifier for each of the attributes. Constraints for the operation are determined at least based on the attributes, wherein the constraints restrict at least one of a type of input for the operation or a type of output for the operation. Information defining an input for the operation is received, and it is determined, based on the constraints and the received information defining the input, the type of output for the operation. The type of output is associated with an output for the operation.