Uses of Class
com.ensoftcorp.open.commons.sandbox.SandboxGraph
-
Packages that use SandboxGraph Package Description com.ensoftcorp.open.commons.algorithms com.ensoftcorp.open.commons.sandbox -
-
Uses of SandboxGraph in com.ensoftcorp.open.commons.algorithms
Methods in com.ensoftcorp.open.commons.algorithms that return SandboxGraph Modifier and Type Method Description static SandboxGraphDominanceAnalysis. computeSandboxedDominance(Sandbox sandbox, UniqueEntryExitGraph ucfg)Returns a graph of all dominance relationship edgesstatic SandboxGraphDominanceAnalysis. computeSandboxedDominanceFrontier(Sandbox sandbox, UniqueEntryExitGraph ucfg)Returns the dominance frontier (each edge represents a frontier node for a given from node)static SandboxGraphDominanceAnalysis. computeSandboxedDominatorTree(Sandbox sandbox, UniqueEntryExitGraph ucfg)Returns the immediate dominator treestatic SandboxGraphDominanceAnalysis. computeSandboxedPostDominanceFrontier(Sandbox sandbox, UniqueEntryExitGraph ucfg)Returns the post-dominance frontier (each edge represents a frontier node for a given from node)static SandboxGraphDominanceAnalysis. computeSandboxedPostDominatorTree(Sandbox sandbox, UniqueEntryExitGraph ucfg)Returns the post dominator tree -
Uses of SandboxGraph in com.ensoftcorp.open.commons.sandbox
Fields in com.ensoftcorp.open.commons.sandbox declared as SandboxGraph Modifier and Type Field Description SandboxGraphSandbox. UThe sandbox universe graphMethods in com.ensoftcorp.open.commons.sandbox that return SandboxGraph Modifier and Type Method Description SandboxGraphSandbox. addGraph(com.ensoftcorp.atlas.core.db.graph.Graph graph)Adds the current state of the Atlas nodes and edges from the given Atlas graph to the sandboxSandboxGraphSandboxGraph. between(SandboxHashSet<SandboxNode> from, SandboxHashSet<SandboxNode> to)From this graph, selects the subgraph such that the given nodes in to are reachable from the nodes in from using forward traversal.SandboxGraphSandboxGraph. between(SandboxNode from, SandboxNode to)From this graph, selects the subgraph such that the given nodes in to are reachable from the nodes in from using forward traversal.SandboxGraphSandboxGraph. betweenStep(SandboxHashSet<SandboxNode> from, SandboxHashSet<SandboxNode> to)From this graph, selects the subgraph such that the given nodes in to are reachable from the nodes in from in a single stepSandboxGraphSandboxGraph. betweenStep(SandboxNode from, SandboxNode to)From this graph, selects the subgraph such that the given nodes in to are reachable from the nodes in from in a single stepSandboxGraphSandboxGraph. difference(SandboxGraph... graphs)Select this graph, excluding the graphs g.SandboxGraphSandboxGraph. differenceEdges(SandboxGraph... graphs)Select this graph, excluding the edges from the given graphs.SandboxGraphSandbox. empty()Returns an empty sandbox graphSandboxGraphSandboxGraph. forward(SandboxHashSet<SandboxNode> origin)From this graph, selects the subgraph reachable from the given nodes using forward transitive traversal.SandboxGraphSandboxGraph. forward(SandboxNode origin)From this graph, selects the subgraph reachable from the given nodes using forward transitive traversal.SandboxGraphSandboxGraph. forwardStep(SandboxHashSet<SandboxNode> origin)From this graph, selects the subgraph reachable from the given nodes along a path length of 1 in the forward direction.SandboxGraphSandboxGraph. forwardStep(SandboxNode origin)From this graph, selects the subgraph reachable from the given nodes along a path length of 1 in the forward direction.SandboxGraphSandbox. graph(com.ensoftcorp.atlas.core.db.graph.Graph graph)Returns a sandbox graph contained in the sandbox universe referenced in the given set of the Atlas graphSandboxGraphSandboxGraph. intersection(SandboxGraph... graphs)Yields the intersection of this graph and the given graphs.SandboxGraphSandboxGraph. reverse(SandboxHashSet<SandboxNode> origin)From this graph, selects the subgraph reachable from the given nodes using reverse transitive traversal.SandboxGraphSandboxGraph. reverse(SandboxNode origin)From this graph, selects the subgraph reachable from the given nodes using reverse transitive traversal.SandboxGraphSandboxGraph. reverseStep(SandboxHashSet<SandboxNode> origin)From this graph, selects the subgraph reachable from the given nodes along a path length of 1 in the reverse direction.SandboxGraphSandboxGraph. reverseStep(SandboxNode origin)From this graph, selects the subgraph reachable from the given nodes along a path length of 1 in the reverse direction.SandboxGraphSandbox. toGraph(SandboxGraphElement... graphElements)Converts the given graph elements into a sandbox graphSandboxGraphSandbox. toGraph(SandboxHashSet<? extends SandboxGraphElement> graphElements)Converts the given graph elements into a sandbox graphSandboxGraphSandbox. toGraph(SandboxHashSet<SandboxNode> nodes, SandboxHashSet<SandboxEdge> edges)Converts the given graph elements into a sandbox graphSandboxGraphSandboxGraph. union(SandboxGraph... graphs)Yields the union of this graph and the given graphs.SandboxGraphSandbox. universe()Returns the current sandbox universe graphMethods in com.ensoftcorp.open.commons.sandbox with parameters of type SandboxGraph Modifier and Type Method Description SandboxGraphSandboxGraph. difference(SandboxGraph... graphs)Select this graph, excluding the graphs g.SandboxGraphSandboxGraph. differenceEdges(SandboxGraph... graphs)Select this graph, excluding the edges from the given graphs.com.ensoftcorp.atlas.core.db.graph.GraphDefaultFlushProvider. flush(SandboxGraph graph, java.util.Map<java.lang.String,SandboxGraphElement> addresses)Flushes the changes made in the sandbox that are restricted to the nodes and edges in the given graph to the Atlas graph This methods does the following: 1) Adds nodes/edges that are not mirrored to the Atlas graph with the current tags/attributes 2) Updates (adds/removes) tags and attributes from the corresponding Atlas graph element's to match the current sandbox tags/attributes for each node/edge in the sandbox.com.ensoftcorp.atlas.core.db.graph.GraphFlushProvider. flush(SandboxGraph graph, java.util.Map<java.lang.String,SandboxGraphElement> addresses)Flushes the changes made in the sandbox that are restricted to the nodes and edges in the given graph to the Atlas graph and updates the address map accordingly.com.ensoftcorp.atlas.core.db.graph.GraphSandbox. flush(SandboxGraph graph)Flushes the changes made in the sandbox that are restricted to the nodes and edges in the given graph to the Atlas graph This methods does the following: 1) Adds nodes/edges that are not mirrored to the Atlas graph with the current tags/attributes 2) Updates (adds/removes) tags and attributes from the corresponding Atlas graph element's to match the current sandbox tags/attributes for each node/edge in the sandbox.SandboxGraphSandboxGraph. intersection(SandboxGraph... graphs)Yields the intersection of this graph and the given graphs.SandboxGraphSandboxGraph. union(SandboxGraph... graphs)Yields the union of this graph and the given graphs.Constructors in com.ensoftcorp.open.commons.sandbox with parameters of type SandboxGraph Constructor Description SandboxGraph(SandboxGraph graph)SandboxHashSet(SandboxGraph graph)
-