All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.google.javascript.jscomp.graph.FixedPointGraphTraversal.class Maven / Gradle / Ivy

The newest version!
????3?
$q	rs
tu
q
vwxyz{z|}~?
?
v???d
???
qy
v?
?
?
y
???y??~%??
????EdgeCallbackInnerClassescallbackJLcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;	SignatureRLcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;NON_HALTING_ERROR_MSGLjava/lang/String;
ConstantValueM(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;)VCodeLineNumberTableLocalVariableTablethis=Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal;LocalVariableTypeTableELcom/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;)VnodeDiGraphNode8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;graph,Lcom/google/javascript/jscomp/graph/DiGraph;nodesLjava/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;)VA(Lcom/google/javascript/jscomp/graph/DiGraph;Ljava/lang/Object;)VentryLjava/lang/Object;entrySetTN;:(Lcom/google/javascript/jscomp/graph/DiGraph;TN;)V>(Lcom/google/javascript/jscomp/graph/DiGraph;Ljava/util/Set;)VndestNodeedgeDiGraphEdge8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge;sourcesourceValueoutEdgesLjava/util/List;
cycleCountI	nodeCountJ
maxIterationsworkSetLjava/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;
SourceFileFixedPointGraphTraversal.java/?();com/google/javascript/jscomp/graph/FixedPointGraphTraversal/0java/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/ObjectHcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback
java/util/Setjava/util/Iterator*com/google/javascript/jscomp/graph/DiGraphjava/util/List()VgetDirectedGraphNodes()Ljava/lang/Iterable;java/lang/Iterableiterator()Ljava/util/Iterator;hasNext()Znext()Ljava/lang/Object;getValueadd(Ljava/lang/Object;)ZgetNodes()Ljava/util/Collection;java/util/Collectionsize()Ijava/lang/Mathmax(JJ)JgetDirectedGraphNodeL(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;isEmptyremovegetOutEdges()Ljava/util/List;getDestination:()Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;traverseEdge9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Z$com/google/common/base/Preconditions
checkState(ZLjava/lang/Object;)V1$()*+,-."/01b
*?*+??245	63
45
()6
47
(+*8	9:1E	?Y*??2=3	()6	(;*<=>1?>?Y?M+??N-?	?-?
?:,??
W???*+,??2EF&G4H7I=J3*&?A>45>BC6DE6*&?F>47>BG6DHI?JK?$*L=M1??Y?N-,?
W*+-??2RSTU3*45BCNOPE6*47BGNQPH*R=S1??>+???7ii?7?Y?:,?:		?	?	?
:
+
??W????????????
?:		?:
	?W	?:?:?	?D?
?:

??:*?

? ?!?
??W??????p????"?#?2R]^be'gBhNiQjaoppyr?t?u?v?w?x?z?j?}?3?
BTO
?$UO?2VX
pnYA	yeZO
?T[\?45?BC?PE?]^?_`?a`'?bc6f
BTQ
?$UQ?2Vd
pnYF	yeZQ
?T[e?47?BG?PH'?bfI]?/ghJiK?!?AghJijklK?G?ghJi@*m*nop'%&	v@	vW	




© 2015 - 2025 Weber Informatics LLC | Privacy Policy