• Home
• org.kie.j2cl.tools
• closure-compiler-unshaded
• v20241106-1
• source code
• FixedPointGraphTraversal.class

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

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

????7?

java/lang/Object

()V		

;com/google/javascript/jscomp/graph/FixedPointGraphTraversal
callback
JLcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;	
traversalDirection
PLcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$TraversalDirection;	
Ncom/google/javascript/jscomp/graph/FixedPointGraphTraversal$TraversalDirection
OUTWARDS

?(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$TraversalDirection;)V	
INWARDS
java/util/LinkedHashSet

 !"#$
*com/google/javascript/jscomp/graph/DiGraph
getNodes
()Ljava/util/Collection;&'()*
java/util/Collection
iterator
()Ljava/util/Iterator;,-./0
java/util/Iterator
hasNext
()Z,234
next
()Ljava/lang/Object;6
6com/google/javascript/jscomp/graph/DiGraph$DiGraphNode5894
getValue;<=>?

java/util/Set
add
(Ljava/lang/Object;)Z
ABC
computeFixedPoint
>(Lcom/google/javascript/jscomp/graph/DiGraph;Ljava/util/Set;)V
 EFG
getNodeCount
()I	IJK
"MAX_NODE_COUNT_FOR_ITERATION_LIMIT

J
MNOPQ
java/lang/Math
min
(JJ)Jd
MUVQ
max;'
 YZ[
getNode
L(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;
<
^_0
isEmpty
'
bcd
	visitNode
T(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;Ljava/util/LinkedHashSet;)Vf
#Fixed point computation not halting
hijkl
$com/google/common/base/Preconditions

checkState
(ZLjava/lang/Object;)V
no?
remove	qrstu
=com/google/javascript/jscomp/graph/FixedPointGraphTraversal$1
Y$SwitchMap$com$google$javascript$jscomp$graph$FixedPointGraphTraversal$TraversalDirection
[I
wxG
ordinal5z{|
getOutEdges
()Ljava/util/List;~'
java/util/List?
6com/google/javascript/jscomp/graph/DiGraph$DiGraphEdge????
getDestination
:()Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;?8?????
Hcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback
traverseEdge
9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Z5??|

getInEdges????
	getSource?
java/lang/AssertionError???
makeConcatWithConstants
d(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$TraversalDirection;)Ljava/lang/String;
???
(Ljava/lang/Object;)VB+???
M???
cbrt
(D)D
M???
floor
	Signature
RLcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;
NON_HALTING_ERROR_MSG
Ljava/lang/String;

ConstantValue
Code
LineNumberTable
LocalVariableTable
this
=Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal;
LocalVariableTypeTable
ELcom/google/javascript/jscomp/graph/FixedPointGraphTraversal;
MethodParameters
?(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$TraversalDirection;)V
newTraversal
?(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;)Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal;
ZLcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;
?(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;)Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal;
newReverseTraversal
/(Lcom/google/javascript/jscomp/graph/DiGraph;)V
node
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

n

cycleCount
	nodeCount

maxIterations
workSet
Ljava/util/LinkedHashSet;
[Ljava/util/LinkedHashSet;>;
K(Lcom/google/javascript/jscomp/graph/DiGraph;Ljava/util/Set;)V
	destValue
edge
8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge;
sourceValue
revDestValue
revSourceValue
@Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge;
?(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;Ljava/util/LinkedHashSet;>;)V

<Ljava/lang/Object;

SourceFile
FixedPointGraphTraversal.java
NestMembers
BootstrapMethods?
?????
$java/lang/invoke/StringConcatFactory
?(Ljava/lang/invoke/MethodHandles$Lookup;Ljava/lang/String;Ljava/lang/invoke/MethodType;Ljava/lang/String;[Ljava/lang/Object;)Ljava/lang/invoke/CallSite;?
Unrecognized direction 

InnerClasses
EdgeCallback
TraversalDirection
DiGraphNode
DiGraphEdge?
%java/lang/invoke/MethodHandles$Lookup?
java/lang/invoke/MethodHandles
Lookup1
????
?eJK?u*?
*+?*,?
??;<	=>? ??
????
?	??	???H
?Y*????
C?
?
??
??	???H
?Y*????
I?
?
??
??
B???>?Y?M+??%
N-?+
?-?1
?5:,?7
?:W???*+,?@??RS&T4U7V=W?*&??>??>??
6???*&??>??>??
6????;,?$?
???
B????Y?N-,?:W*+-?@??_`ab?*????
?????*????
?????	????
BC?
??	B+?D??H?L7iiR?T7?Y?:	,?W
:

?+
?
?1
:	+?X?\W???	?]?$!??*	?`?1
?5	?a!
aB???!???e?g??2stx{(|C}O~Ra?t{????RC????????
?????K~?Kn?K(e??	?4C????????
???(e??	?"?0 ;,?!(
@
?	????cd?E?,+?mW?p*?
?v.??
y+?7
N+?y
?}
:?+
?B?1
??:??
?7
:*?-??
???,??
?\W????+?7
:+??
?}
:?+
?C?1
??:??
?7
:*???
???,??
?\W??????Y*?
??????F??,?3?V?d?z??????????????????????\	d"??V0??3W???#???1???X????????
????\	d"??V0??3W???#???1???X????????
????(	,?,?E???,?F???	?????
?&???????H?
?
k?????q??
?
??2??	?@5 ?	q? ?	???