Package | Description |
---|---|
com.google.javascript.jscomp |
Provides the core compiler and its public API.
|
com.google.javascript.jscomp.graph |
Provides graph data structures and algorithms for coloring and fixed-point
computations.
|
Modifier and Type | Class and Description |
---|---|
private static class |
ControlFlowAnalysis.AstControlFlowGraph
A
ControlFlowGraph which provides a node comparator based on the
pre-order traversal of the AST. |
class |
ControlFlowGraph<N>
Control flow graph.
|
(package private) class |
NameReferenceGraph
A graph represents all the referencing of global names in the program.
|
Modifier and Type | Field and Description |
---|---|
private DiGraph<N,E> |
CheckPathsBetweenNodes.graph |
Modifier and Type | Method and Description |
---|---|
private DiGraph<CallGraph.Function,CallGraph.Callsite> |
CallGraph.constructDirectedGraph(boolean forward)
Constructs a digraph of the call graph.
|
DiGraph<CallGraph.Function,CallGraph.Callsite> |
CallGraph.getBackwardDirectedGraph()
Constructs and returns a directed graph where the nodes are functions and
the edges are callsites connecting callees to callers.
|
DiGraph<CallGraph.Function,CallGraph.Callsite> |
CallGraph.getForwardDirectedGraph()
Constructs and returns a directed graph where the nodes are functions and
the edges are callsites connecting callers to callees.
|
Modifier and Type | Method and Description |
---|---|
private static void |
CallGraph.digraphConnect(DiGraph<CallGraph.Function,CallGraph.Callsite> digraph,
CallGraph.Function caller,
CallGraph.Callsite callsite,
CallGraph.Function callee,
boolean forward) |
Constructor and Description |
---|
CheckPathsBetweenNodes(DiGraph<N,E> graph,
DiGraph.DiGraphNode<N,E> a,
DiGraph.DiGraphNode<N,E> b,
com.google.common.base.Predicate<N> nodePredicate,
com.google.common.base.Predicate<DiGraph.DiGraphEdge<N,E>> edgePredicate)
Inclusive check.
|
CheckPathsBetweenNodes(DiGraph<N,E> graph,
DiGraph.DiGraphNode<N,E> a,
DiGraph.DiGraphNode<N,E> b,
com.google.common.base.Predicate<N> nodePredicate,
com.google.common.base.Predicate<DiGraph.DiGraphEdge<N,E>> edgePredicate,
boolean inclusive)
Given a graph G with nodes A and B, this algorithm determines if all paths
from A to B contain at least one node satisfying a given predicate.
|
Modifier and Type | Class and Description |
---|---|
class |
LinkedDirectedGraph<N,E>
A directed graph using linked list within nodes to store edge information.
|
Modifier and Type | Field and Description |
---|---|
private DiGraph<N,E> |
GraphReachability.graph |
Modifier and Type | Method and Description |
---|---|
void |
FixedPointGraphTraversal.computeFixedPoint(DiGraph<N,E> graph)
Compute a fixed point for the given graph.
|
void |
FixedPointGraphTraversal.computeFixedPoint(DiGraph<N,E> graph,
N entry)
Compute a fixed point for the given graph, entering from the given node.
|
void |
FixedPointGraphTraversal.computeFixedPoint(DiGraph<N,E> graph,
java.util.Set<N> entrySet)
Compute a fixed point for the given graph, entering from the given nodes.
|
Constructor and Description |
---|
GraphReachability(DiGraph<N,E> graph) |
GraphReachability(DiGraph<N,E> graph,
com.google.common.base.Predicate<GraphReachability.EdgeTuple<N,E>> edgePredicate) |