Systems, devices, computer-implemented methods, and tangible non-transitory computer readable media for performing multilayered generation and processing of computer instructions are provided. For example, a computing device may receive a request with instructions in a first computer language, parse the instructions in the first computer language, analyze the instructions in the first computer language in view of information describing structure of a first application, generate instructions in a second computer language different from the first computer language where the instructions in the second computer language are generated based on the instructions in the first computer language and the information describing structure of the first application, obtain a result from a second application where the result comprises information based on the instructions in the second computing language, and provide the result in response to the request comprising the instructions in the first computer language.

A router configuration is provided for creating and destroying parts of an application based on URL patterns. A first uniform resource locator (URL) pattern is received. Parts of an application are created based on the first URL pattern. A second URL pattern with a portion that is different than the first URL pattern is received. A subset of the parts of the application are destroyed based the portion that is different between the first and the second URL patterns.

A hierarchy of containers is received at a user interface of a design time tool. The hierarchy of containers includes a container nested inside of one or more other containers. Each of the containers includes a different part of a web client application. The design time tool associates state with each of the containers in the hierarchy of containers. Lifecycles for each of the containers are received at the user interface. The design time tool creates computer executable instructions in the web client application that enable state for each of the containers to be created and destroyed according to the hierarchy based on the respective lifecycles of each of the containers. The design time tool provides each of the containers access to its own state and state of containers that include it based on respective lifecycle events associated with each of the containers.

Techniques for deserializing stream objects are disclosed. The system may receive data representing a stream object. The data can include an object descriptor, a class descriptor, and stream field values corresponding to the stream object. The system may select a particular deserialization process, from among a plurality of deserialization processes. The selection may be based at least in part on the object descriptor and the class descriptor. The system can deserialize the data representing the stream object using the selected deserialization process, yielding one or more deserialized objects.

Techniques for serializing objects stored in system memory are disclosed. The system may receive data representing an object stored in system memory. The system may select a particular serialization process, from among a plurality of serialization processes, for serializing the received data. The particular serialization process may be selected based at least in part on the received data. The system may serialize the data representing the object in system memory using the selected serialization process. Serializing the data may yield one or more stream objects.

To provide a method, apparatus, and computer program for performing type inference of serialization for each generation site and specializing a serializer for each generation site. A type of serialization is inferred for each generation site of compiling a query, and a serializer is specialized for each generation site based on the inferred type and a type that is actually used. A data value is serialized using the specialized serializer for each generation site. The inference is executed while transcribing identification information assigned to each generation site to a type as an annotation, and the inferred type and the type used in serialization are recursively compared.

Techniques for efficiently swizzling pointers in persistent objects are provided. In one embodiment, a computer system can allocate slabs in a persistent heap, where the persistent heap resides on a byte-addressable persistent memory of the system, and where each slab is a continuous memory segment of the persistent heap that is configured to store instances of an object type used by an application. The system can further store associations between the slabs and their respective object types, and information indicating the locations of pointers in each object type. At the time of a system restart or crash recovery, the system can iterate through each slab and determine, based on the stored associations, the slab's object type. The system can then scan though the allocated objects in the slab and, if the system determines that the object includes any pointers based on the stored pointer location information, can swizzle each pointer.

A generation apparatus that generates a mapping between individual properties included in an object in a program and individual elements of a structured document. The generation apparatus includes: an object tree generation unit that generates a tree structure representing hierarchical structure of the object by assigning the individual properties included in the object to nodes of the tree structure; and a selection unit that selects a mapping minimizing conversion cost of converting the tree structure of the object to a tree structure that includes the individual elements of the structured document as its nodes. The selection is from mappings that associate the individual properties included in the object with the individual elements of the structured document.

A system and method for dynamically selecting a garbage collection algorithm based on the contents of heap regions. In accordance with an embodiment, a software application can be instrumented so that the system can place software objects allocated by the application, or by different parts of the application, into different regions of the heap. When garbage collection is invoked, the system can scan the heap, examine object statistics to determine if particular objects are, e.g., short-lived, long-lived, or some other type of object, and then use this information to determine which garbage collection algorithm to use with particular heap regions. In accordance with an embodiment, the system can identify regions as containing particular object types, for example, movable or non-movable object types, or object liveness, and use different garbage collection algorithms accordingly. Different garbage collection algorithms can be used with different regions, based on their content at a particular time.

A ledgered repository of persistent data objects is replicated on a network of persistent storage systems (PSSs) by transactions recorded across multiple blockchains. The blockchains are replicated on each of the PSSs. Using multiple blockchains enables greater parallelism; however, use of the multiple blockchains requires using measures that ensure that transactions distributed across multiple blockchains are applied in way that ensures a level of transactional consistency. Furthermore, the measures are efficient, thereby reducing overhead of maintaining a level of transactional consistency and increasing throughput of applying the transactions using multiple blockchains.