
com.google.javascript.jscomp.graph.FixedPointGraphTraversal.class Maven / Gradle / Ivy
The newest version!
???? 3 ?
$ q r s
t u
q
v w x y z { z | } ~ ?
?
v ? ? ? d
? ? ?
q y
v ?
?
?
y
? ? ? y ? ? ~ % ? ?
? ? ? ? EdgeCallback InnerClasses callback JLcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback; Signature RLcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback; NON_HALTING_ERROR_MSG Ljava/lang/String;
ConstantValue M(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;)V Code LineNumberTable LocalVariableTable this =Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal; LocalVariableTypeTable ELcom/google/javascript/jscomp/graph/FixedPointGraphTraversal; U(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;)V newTraversal ?(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;)Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal; XLcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback; ?(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;)Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal; computeFixedPoint /(Lcom/google/javascript/jscomp/graph/DiGraph;)V node DiGraphNode 8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode; graph ,Lcom/google/javascript/jscomp/graph/DiGraph; nodes Ljava/util/Set; @Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode; 4Lcom/google/javascript/jscomp/graph/DiGraph; Ljava/util/Set;
StackMapTable ? ? 7(Lcom/google/javascript/jscomp/graph/DiGraph;)V A(Lcom/google/javascript/jscomp/graph/DiGraph;Ljava/lang/Object;)V entry Ljava/lang/Object; entrySet TN; :(Lcom/google/javascript/jscomp/graph/DiGraph;TN;)V >(Lcom/google/javascript/jscomp/graph/DiGraph;Ljava/util/Set;)V n destNode edge DiGraphEdge 8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge; source sourceValue outEdges Ljava/util/List;
cycleCount I nodeCount J
maxIterations workSet Ljava/util/LinkedHashSet; @Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge; RLjava/util/List;>; [Ljava/util/LinkedHashSet;>; s ? ? } ? ? K(Lcom/google/javascript/jscomp/graph/DiGraph;Ljava/util/Set;)V <Ljava/lang/Object;
SourceFile FixedPointGraphTraversal.java / ? ( ) ;com/google/javascript/jscomp/graph/FixedPointGraphTraversal / 0 java/util/HashSet ? ? ? ? ? ? ? ? ? ? ? 6com/google/javascript/jscomp/graph/DiGraph$DiGraphNode ? ? ? ? ? = S ? ? ? ? ? ? ? ? java/util/LinkedHashSet ? ? ? ? ? ? ? ? ? 6com/google/javascript/jscomp/graph/DiGraph$DiGraphEdge ? ? ? ? #Fixed point computation not halting ? ? ? java/lang/Object Hcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback
java/util/Set java/util/Iterator *com/google/javascript/jscomp/graph/DiGraph java/util/List ()V getDirectedGraphNodes ()Ljava/lang/Iterable; java/lang/Iterable iterator ()Ljava/util/Iterator; hasNext ()Z next ()Ljava/lang/Object; getValue add (Ljava/lang/Object;)Z getNodes ()Ljava/util/Collection; java/util/Collection size ()I java/lang/Math max (JJ)J getDirectedGraphNode L(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode; isEmpty remove getOutEdges ()Ljava/util/List; getDestination :()Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode; traverseEdge 9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Z $com/google/common/base/Preconditions
checkState (ZLjava/lang/Object;)V 1 $ ( ) * + , - . " / 0 1 b
*? *+? ? 2 4 5 6 3
4 5
( ) 6
4 7
( + * 8 9 : 1 E ? Y*? ? 2 = 3 ( ) 6 ( ; * <