• Home
• org.zenframework.z8.dependencies.minimizers
• closure
• 2.0
• source code
• DataFlowAnalysis.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.DataFlowAnalysis.class Maven / Gradle / Ivy

????3
u
O?	?	?
?
???
?	??
	?
?
??#??
?
???????
?
?????
??
?
??
?
????????
?
?
??
??????????
????
?
?#?
?#?







O



?




?
?
	




?
??




C


E

E





I







I





BranchedFlowState
InnerClasses
 
BranchedForwardDataFlowAnalysis
MaxIterationsExceededException
	FlowState
cfg
/Lcom/google/javascript/jscomp/ControlFlowGraph;
	Signature
4Lcom/google/javascript/jscomp/ControlFlowGraph;
joinOp
%Lcom/google/javascript/jscomp/JoinOp;
*Lcom/google/javascript/jscomp/JoinOp;
orderedWorkSet
Ljava/util/Set;
DiGraphNode
!
Branch
?Ljava/util/Set;>;
	MAX_STEPS

I

ConstantValue

W(Lcom/google/javascript/jscomp/ControlFlowGraph;Lcom/google/javascript/jscomp/JoinOp;)V
Code
LineNumberTable
LocalVariableTable
this
/Lcom/google/javascript/jscomp/DataFlowAnalysis;
	targetCfg
nodeComparator
Ljava/util/Comparator;
LocalVariableTypeTable
7Lcom/google/javascript/jscomp/DataFlowAnalysis;
?Ljava/util/Comparator;>;

StackMapTable?
"
#
$
a(Lcom/google/javascript/jscomp/ControlFlowGraph;Lcom/google/javascript/jscomp/JoinOp;)V
getCfg
1()Lcom/google/javascript/jscomp/ControlFlowGraph;
6()Lcom/google/javascript/jscomp/ControlFlowGraph;
getExitLatticeElement
5()Lcom/google/javascript/jscomp/graph/LatticeElement;
node
8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;
state
9Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowState;
sLcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;
>Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowState;
()TL;
join
?(Lcom/google/javascript/jscomp/graph/LatticeElement;Lcom/google/javascript/jscomp/graph/LatticeElement;)Lcom/google/javascript/jscomp/graph/LatticeElement;
latticeA
3Lcom/google/javascript/jscomp/graph/LatticeElement;
latticeB
TL;
(TL;TL;)TL;
	isForward
()Z
flowThrough
z(Ljava/lang/Object;Lcom/google/javascript/jscomp/graph/LatticeElement;)Lcom/google/javascript/jscomp/graph/LatticeElement;
(TN;TL;)TL;
analyze
()V
(I)V
nextNode
	nextNodes
Ljava/util/List;
curNode
maxSteps
step
?Ljava/util/List;>;?
%
&
createInitialEstimateLattice
createEntryLattice

initialize
flow
;(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Z
	outBefore
inBefore??
v(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Z

joinInputs
;(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)V
inNodeState
currentNodeState
currentNode
values
inNodes
inNode
Ljava/util/List;
v(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)V
computeEscaped
e(Lcom/google/javascript/jscomp/Scope;Ljava/util/Set;Lcom/google/javascript/jscomp/AbstractCompiler;)V
var
"Lcom/google/javascript/jscomp/Var;
jsScope
$Lcom/google/javascript/jscomp/Scope;
escaped
compiler
/Lcom/google/javascript/jscomp/AbstractCompiler;
finder
'
AbstractPostOrderCallback
FLcom/google/javascript/jscomp/NodeTraversal$AbstractPostOrderCallback;

t
,Lcom/google/javascript/jscomp/NodeTraversal;
3Ljava/util/Set;
'


?(Lcom/google/javascript/jscomp/Scope;Ljava/util/Set;Lcom/google/javascript/jscomp/AbstractCompiler;)V
^Ljava/lang/Object;

SourceFile
DataFlowAnalysis.javag?WX[\??
"
(
)
java/util/TreeSetg
*^_
java/util/LinkedHashSetz{
+
,
-
.
7com/google/javascript/jscomp/DataFlowAnalysis$FlowState
/~
0
1
2
#
3
4
1com/google/javascript/jscomp/graph/LatticeElement
-com/google/javascript/jscomp/DataFlowAnalysis????
5
6?
Lcom/google/javascript/jscomp/DataFlowAnalysis$MaxIterationsExceededException
java/lang/StringBuilder
!Analysis did not terminate after 
7
8
7
9
 iterations
:
;g
<
=
>
&
?
@
A
6com/google/javascript/jscomp/graph/DiGraph$DiGraphNode
B
C????
D
E
F
E
%
G?
H
C
I?
J
K
L?~g
M
N
O
P
Q
R
@
S
Q??
T
U
V
C
W
U
X
,?~
Y
Z
[
\
]
^
_~
java/util/ArrayListg?
`
Z
/com/google/javascript/jscomp/DataFlowAnalysis$1g
a
*com/google/javascript/jscomp/NodeTraversalg
d
e
f
g
h
K
 com/google/javascript/jscomp/Var
i
j
k
l?
m
n
o
p
;
q
r
s
java/lang/Object
?com/google/javascript/jscomp/DataFlowAnalysis$BranchedFlowState
Mcom/google/javascript/jscomp/DataFlowAnalysis$BranchedForwardDataFlowAnalysis
4com/google/javascript/jscomp/ControlFlowGraph$Branch
-com/google/javascript/jscomp/ControlFlowGraph
#com/google/javascript/jscomp/JoinOp
java/util/Comparator
java/util/List
java/util/Iterator
Dcom/google/javascript/jscomp/NodeTraversal$AbstractPostOrderCallback
getOptionalNodeComparator
(Z)Ljava/util/Comparator;
(Ljava/util/Comparator;)V
getImplicitReturn
:()Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;

getAnnotation
1()Lcom/google/javascript/jscomp/graph/Annotation;
getIn
'com/google/common/collect/ImmutableList
of
O(Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/collect/ImmutableList;
apply
&(Ljava/lang/Object;)Ljava/lang/Object;

java/util/Set
isEmpty
append
-(Ljava/lang/String;)Ljava/lang/StringBuilder;
(I)Ljava/lang/StringBuilder;
toString
()Ljava/lang/String;
(Ljava/lang/String;)V
iterator
()Ljava/util/Iterator;
next
()Ljava/lang/Object;
*com/google/javascript/jscomp/graph/DiGraph
remove
(Ljava/lang/Object;)Z
getDirectedSuccNodes
J(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Ljava/util/List;
getDirectedPredNodes
hasNext
add
clear
getDirectedGraphNodes
()Ljava/lang/Iterable;
java/lang/Iterable
?(Lcom/google/javascript/jscomp/graph/LatticeElement;Lcom/google/javascript/jscomp/graph/LatticeElement;Lcom/google/javascript/jscomp/DataFlowAnalysis$1;)V

setAnnotation
2(Lcom/google/javascript/jscomp/graph/Annotation;)V

access$100
n(Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowState;)Lcom/google/javascript/jscomp/graph/LatticeElement;
getValue

access$200

access$102
?(Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowState;Lcom/google/javascript/jscomp/graph/LatticeElement;)Lcom/google/javascript/jscomp/graph/LatticeElement;
equals

access$202
getEntry
setIn
6(Lcom/google/javascript/jscomp/graph/LatticeElement;)V
size
()I
get
(I)Ljava/lang/Object;
getOut
setOut
6(Lcom/google/javascript/jscomp/Scope;Ljava/util/Set;)V
t
Callback
g(Lcom/google/javascript/jscomp/AbstractCompiler;Lcom/google/javascript/jscomp/NodeTraversal$Callback;)V
traverseAtScope
'(Lcom/google/javascript/jscomp/Scope;)V
"com/google/javascript/jscomp/Scope
getVarIterable

getParentNode
$()Lcom/google/javascript/rhino/Node;
 com/google/javascript/rhino/Node
isCatch
-com/google/javascript/jscomp/AbstractCompiler
getCodingConvention
1()Lcom/google/javascript/jscomp/CodingConvention;
getName
-com/google/javascript/jscomp/CodingConvention

isExported
(Ljava/lang/String;)Z
3com/google/javascript/jscomp/NodeTraversal$Callback OWX
YZ[\
Y]^_
Ycde
fghi?9*?
*+?*,?*?*??N-?*?Y-???*?	Y?
??j&	xy	z{|}~-?8?k*9lm9nX
9[\opq*9lr9nZ
9[]ost?-uvwx
Yyz{iA

*??j
?k
lmq
lrY|}~i?
*??L+?

?M,??j???k lm?
??q lr?
??Y???iv*?+,????j
?k lm??
??q lr??
??Y?????
Y???
iG
*??j
??k
lmq
lr??
i
??*?=*??
???#?Y?Y?????? ?*??!
?"
?#N*?-?$W*-?%*-?&?Y*??*?-?'?*?-?(:?)
:?*
?*?"
?#:*???*??+W??҄
??L*??**???%?jV?????7?I?T?Y?a?m?x?}?????????????????k>???}:??Iq???lm??e
??eq*???}:??Iq???lrt"	?
0?;?G??
??-???~
Y??~
Y???
i?Y*??,
*??-?.
L+?*
?<+?"
?#M,?Y*?/*?/
?0?1,*???*?,?+W????j&	?	?)?3?:??
J

U
X
k),?Ylmq),?Ylrt??>???i
)c+?

?M*??,,?2N,*+?3
,?4?5?6W-,?2?7???,?4N,*+?3
,?2?5?8W-,?4?7???j"





)
:
?
R
k4$???$??clmc?

Y??q4$???$??clrc?

Y??t?8??@
??&?@
Y???in
v+?

?M*???*??9+?,*?:?;?
Q*?+?(N-?<
?#-?=?#?

?:,?>?;?h-?<
?^??Y-?<
?@:-?)
:?*
?+?"
?#:?

?:?>?AW???,*????;??*?+?'N-?<
?>-?=?#:*???,*?:?B??

?:,??B?h-?<
?^??Y-?<
?@:-?)
:?*
?+?"
?#:?

?:??AW???,*????B?j~


 
!
"'
$0
%:
&N
'W
(d
)s
*?
+?
,?
-?
.?
0?
2?
3?
4?
5?
6?
8

9


;

<
)
=
G
>
S
?
`
@
c
A
u
Dk?N	???
?????sL??0???
	???,??
S
??
G??
)L??????
vlm
v?


l??q?N	???
?????sL??0???
	???,??
S
??
G??
)L??????
vlr
v?


l??t:?'??2?? ???1??5???? ???1?Y???i
e?CY*+?DN?EY,-?F:*?G*?H?.
:?*
?7?"
?I:?J?K?,?L?M?N?+?+W??űj&	/
>?C<DHEXFaHdIk><%??e??e?_
e??
[??P??q
e??
t?&????1???Y?Y???RJ	PQSTUVC#?`	a?b@?E?	
bE
c