Uses of Interface
com.google.javascript.jscomp.graph.DiGraph.DiGraphNode
-
Packages that use DiGraph.DiGraphNode Package Description com.google.javascript.jscomp com.google.javascript.jscomp.graph -
-
Uses of DiGraph.DiGraphNode in com.google.javascript.jscomp
Methods in com.google.javascript.jscomp that return DiGraph.DiGraphNode Modifier and Type Method Description DiGraph.DiGraphNode<N,ControlFlowGraph.Branch>
ControlFlowGraph. getEntry()
Gets the entry point of the control flow graph.DiGraph.DiGraphNode<N,ControlFlowGraph.Branch>
ControlFlowGraph. getImplicitReturn()
Gets the implicit return node.Methods in com.google.javascript.jscomp that return types with arguments of type DiGraph.DiGraphNode Modifier and Type Method Description java.util.Comparator<DiGraph.DiGraphNode<N,ControlFlowGraph.Branch>>
ControlFlowGraph. getOptionalNodeComparator(boolean isForward)
Gets a comparator for the nodes.Methods in com.google.javascript.jscomp with parameters of type DiGraph.DiGraphNode Modifier and Type Method Description boolean
ControlFlowGraph. isImplicitReturn(DiGraph.DiGraphNode<N,ControlFlowGraph.Branch> node)
Checks whether node is the implicit return. -
Uses of DiGraph.DiGraphNode in com.google.javascript.jscomp.graph
Classes in com.google.javascript.jscomp.graph that implement DiGraph.DiGraphNode Modifier and Type Class Description static class
LinkedDirectedGraph.LinkedDiGraphNode<N,E>
A directed graph node that stores outgoing edges and incoming edges as an list within the node itself.Methods in com.google.javascript.jscomp.graph that return DiGraph.DiGraphNode Modifier and Type Method Description abstract DiGraph.DiGraphNode<N,E>
DiGraph. createNode(N nodeValue)
DiGraph.DiGraphNode<N,E>
DiGraph.DiGraphEdge. getDestination()
abstract DiGraph.DiGraphNode<N,E>
DiGraph. getNode(N nodeValue)
DiGraph.DiGraphNode<N,E>
DiGraph.DiGraphEdge. getSource()
Methods in com.google.javascript.jscomp.graph that return types with arguments of type DiGraph.DiGraphNode Modifier and Type Method Description abstract java.util.List<? extends DiGraph.DiGraphNode<N,E>>
DiGraph. getDirectedPredNodes(DiGraph.DiGraphNode<N,E> n)
abstract java.util.List<? extends DiGraph.DiGraphNode<N,E>>
DiGraph. getDirectedPredNodes(N nodeValue)
abstract java.util.List<? extends DiGraph.DiGraphNode<N,E>>
DiGraph. getDirectedSuccNodes(DiGraph.DiGraphNode<N,E> n)
abstract java.util.List<? extends DiGraph.DiGraphNode<N,E>>
DiGraph. getDirectedSuccNodes(N nodeValue)
abstract java.util.Collection<? extends DiGraph.DiGraphNode<N,E>>
DiGraph. getNodes()
Methods in com.google.javascript.jscomp.graph with parameters of type DiGraph.DiGraphNode Modifier and Type Method Description void
LinkedDirectedGraph. connect(DiGraph.DiGraphNode<N,E> src, E edgeValue, DiGraph.DiGraphNode<N,E> dest)
DiGraphNode look ups can be expensive for a large graph operation, prefer this method if you have the DiGraphNode available.abstract java.util.List<? extends DiGraph.DiGraphNode<N,E>>
DiGraph. getDirectedPredNodes(DiGraph.DiGraphNode<N,E> n)
java.util.List<LinkedDirectedGraph.LinkedDiGraphNode<N,E>>
LinkedDirectedGraph. getDirectedPredNodes(DiGraph.DiGraphNode<N,E> dNode)
abstract java.util.List<? extends DiGraph.DiGraphNode<N,E>>
DiGraph. getDirectedSuccNodes(DiGraph.DiGraphNode<N,E> n)
java.util.List<LinkedDirectedGraph.LinkedDiGraphNode<N,E>>
LinkedDirectedGraph. getDirectedSuccNodes(DiGraph.DiGraphNode<N,E> dNode)
Constructors in com.google.javascript.jscomp.graph with parameters of type DiGraph.DiGraphNode Constructor 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.
-