CPC G06F 8/311 (2013.01) [G06F 8/71 (2013.01); G06F 8/61 (2013.01); G06F 8/65 (2013.01); G06F 9/45533 (2013.01); G06F 16/24573 (2019.01); G06F 16/9038 (2019.01); H04L 63/1433 (2013.01)] | 34 Claims |
1. A computer-implemented method comprising:
identifying a group of one or more references to respective first virtual partitions, the group of one or more references defining a graph representative of a logical organization of the respective first virtual partitions, wherein the graph comprises a first node representing a first one of the respective first virtual partitions and a second node representing a second one of the respective first virtual partitions;
determining, by a parse component, based on a parse of the one or more references, that the group of one or more references satisfies a consistency criterion;
generating, by a merge component, a second virtual partition by flattening the graph, the second virtual partition containing one or more computer-readable components present in the respective first virtual partitions, wherein the flattening comprises applying, in graph order, one or more primitive code segments present in at least one of the respective first virtual partitions;
generating, by a build subsystem, based on the one or more computer-readable components, one or more computer-executable components; and
executing the one or more computer-executable components.
|