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

????3
T?

??
?
>??
?	?	?	?
???

??
?
???
?$?$?
?
??
?
?
?
???????
?














	


'




?



,
?


,?
?


?












?






 
!
 AnnotatedLinkedDirectedGraphEdge
InnerClasses
LinkedDirectedGraphEdge
 AnnotatedLinkedDirectedGraphNode
LinkedDirectedGraphNode
nodes
Ljava/util/Map;
	Signature
lLjava/util/Map;>;
useNodeAnnotations

Z
useEdgeAnnotations
newSubGraph
/()Lcom/google/javascript/jscomp/graph/SubGraph;
Code
LineNumberTable
LocalVariableTable
this
8Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph;
LocalVariableTypeTable
@Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph;
7()Lcom/google/javascript/jscomp/graph/SubGraph;
createWithoutAnnotations
:()Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph;
l()Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph;
create

(ZZ)V
connect
9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)V
srcValue
Ljava/lang/Object;
	edgeValue
	destValue
src
PLcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDirectedGraphNode;
dest
edge
PLcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDirectedGraphEdge;
TN;
TE;
XLcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDirectedGraphNode;
XLcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDirectedGraphEdge;

StackMapTable??
(TN;TE;TN;)V
DiGraphNode
?(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;Ljava/lang/Object;Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)V
8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;
@Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;
?(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;TE;Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)V
 connectIfNotConnectedInDirection

disconnect
'(Ljava/lang/Object;Ljava/lang/Object;)V
n1
n2
	(TN;TN;)V
disconnectInDirection
DiGraphEdge
8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge;
>Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge<*TE;>;
"
getDirectedGraphNodes
()Ljava/lang/Iterable;
X()Ljava/lang/Iterable;>;
getDirectedGraphNode
L(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;
	nodeValue
E(TN;)Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;
getNode
B(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/GraphNode;
;(TN;)Lcom/google/javascript/jscomp/graph/GraphNode;

getInEdges
$(Ljava/lang/Object;)Ljava/util/List;
node
W(TN;)Ljava/util/List;>;
getOutEdges
createDirectedGraphNode
d(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDirectedGraphNode;
](TN;)Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDirectedGraphNode;
getEdges
6(Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/List;
forwardEdges
Ljava/util/List;

backwardEdges
	totalSize

I
edges
RLjava/util/List;>;
Z(TN;TN;)Ljava/util/List;>;
getFirstEdge
#
	GraphEdge
Z(Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/Graph$GraphEdge;
outEdge
dNode1
dNode2
@Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge;

D(TN;TN;)Lcom/google/javascript/jscomp/graph/Graph$GraphEdge;

createNode
value
getDirectedGraphEdges?
$
%
isConnectedInDirection
'(Ljava/lang/Object;Ljava/lang/Object;)Z
	(TN;TN;)Z
9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Z
(TN;TE;TN;)Z
?(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;Lcom/google/common/base/Predicate;Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Z

i
edgeMatcher
"Lcom/google/common/base/Predicate;
outEdges
len
'Lcom/google/common/base/Predicate;
?(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;Lcom/google/common/base/Predicate;Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Z
I(Ljava/lang/Object;Lcom/google/common/base/Predicate;Ljava/lang/Object;)Z
0(TN;Lcom/google/common/base/Predicate;TN;)Z
getDirectedPredNodes
W(TN;)Ljava/util/List;>;
getDirectedSuccNodes
J(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Ljava/util/List;
dNode
nodeList
RLjava/util/List;>;
?(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Ljava/util/List;>;
getGraphvizEdges
()Ljava/util/List;
edgeList
&
GraphvizEdge
QLjava/util/List;
S()Ljava/util/List;
getGraphvizNodes
'
GraphvizNode
QLjava/util/List;
S()Ljava/util/List;
getName
()Ljava/lang/String;

isDirected
()Z
getNodes
()Ljava/util/Collection;
Z()Ljava/util/Collection;>;
getNeighborNodes
inEdge
result
HLjava/util/List;>;
M(TN;)Ljava/util/List;>;
T()Ljava/util/List;>;

getNodeDegree
(Ljava/lang/Object;)I
(TN;)I
?Lcom/google/javascript/jscomp/graph/DiGraph;Lcom/google/javascript/jscomp/graph/GraphvizGraph;

SourceFile
LinkedDirectedGraph.java
(
7com/google/javascript/jscomp/graph/Graph$SimpleSubGraph
SimpleSubGraphZ
)
6com/google/javascript/jscomp/graph/LinkedDirectedGraphZ[Z
*
java/util/HashMapEFIJKJ
+?
Ncom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDirectedGraphNode
Wcom/google/javascript/jscomp/graph/LinkedDirectedGraph$AnnotatedLinkedDirectedGraphEdgeZp
Ncom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDirectedGraphEdge??
%
,
-????
.
/
0??\pzv??
1
2
"
3?
4
5
6com/google/javascript/jscomp/graph/DiGraph$DiGraphEdge
6
-
7
8?
9
:
;
<
=
6com/google/javascript/jscomp/graph/DiGraph$DiGraphNode??
>
?
Wcom/google/javascript/jscomp/graph/LinkedDirectedGraph$AnnotatedLinkedDirectedGraphNodeZ
@
A
B
C
D
java/util/ArrayListZ
E
F
G
H
I
J
K??
<
L
M
5
N
O
-????
P
Q
=
R
I
S
LinkedGraph??
*com/google/javascript/jscomp/graph/DiGraph
0com/google/javascript/jscomp/graph/GraphvizGraph
java/util/Iterator
2com/google/javascript/jscomp/graph/Graph$GraphEdge
java/lang/Object
java/util/List
=com/google/javascript/jscomp/graph/GraphvizGraph$GraphvizEdge
=com/google/javascript/jscomp/graph/GraphvizGraph$GraphvizNode
(com/google/javascript/jscomp/graph/Graph
-(Lcom/google/javascript/jscomp/graph/Graph;)V
()V

getNodeOrFail
add
(Ljava/lang/Object;)Z
!com/google/common/base/Predicates
equalTo
6(Ljava/lang/Object;)Lcom/google/common/base/Predicate;
iterator
()Ljava/util/Iterator;
hasNext
next
()Ljava/lang/Object;
remove

java/util/Map
values
java/util/Collections
unmodifiableCollection
.(Ljava/util/Collection;)Ljava/util/Collection;
get
&(Ljava/lang/Object;)Ljava/lang/Object;
unmodifiableList
"(Ljava/util/List;)Ljava/util/List;
(Ljava/lang/Object;)V
put
8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
size
()I
(I)V
addAll
(Ljava/util/Collection;)Z
getDestination
:()Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;

alwaysTrue
$()Lcom/google/common/base/Predicate;
(I)Ljava/lang/Object;
getValue
 com/google/common/base/Predicate
apply
$com/google/common/base/Preconditions
checkNotNull
	getSource
java/util/Collection!>
?EF
GHIJKJ%
LMNE
	?
Y*??O
.P
	QRS
	QTGU	VWN"
?Y??
O
2GX	YWN"
?Y??
O
6GXZ[
Nz*?*?Y??*?	*?
?O=*>?@P QRIJ
KJS
QT
\]N
0S*+??:*-??:*?
??
Y,???Y,?:??W??W?OD
EF8JEKRLPHSQRS^_
S`_Sa_
Ibc?dc8efSHSQTS^g
S`hSag
Ibi?di8ejk?*llKmGn
\pN?=*?
??
Y+,-??
?Y+,-?:+?
?W-?
?W?OW [.\<]P4=QR=bq
=`_=dq efS4=QT=br
=`h=dr ejkImGs
t]N?'*+?:*-?:*,???*,??Oefgh&jP>'QR'^_
'`_'a_ bcdcS>'QT'^g
'`h'ag bidik
?&llGn
uvNy
*+,?*,+??OnopP 
QR
w_

x_S 
QT
wg

xgGy
zvN
"S*+??N*,??:*+,??
:?
?+?
?:-?? W?? W??ѱOt	uv6wBxOyRzP>6e|SQRS^_
Sa_	Jbc@dcS>6e}SQTS^g
Sag	Jbi@dik? ll~?1Gy
?NQ


*??!
?"?O~	~P

QRS

QTG?
??N^*?+?#?$?O
?PQR?_
SQT?g
G?
??NV*+?%?O
?PQR?_
SQT?g
G?
??Ny*+??M,??&?O
?	?P QR?_
	?cS QT?g
	?iG?
??Ny*+??M,??&?O
?	?P QR?_
	?cS QT?g
	?iG?
??N?;*?+?#?M,?**?	??'Y+?(??Y+?)M*?+,?*W,?O???-?9?P ;QR;?_
-?cS ;QT;?g
-?ik
?$lGlG?
??N
@*+,?N*,+?:-?+
?+
`6?,Y?-:-?.W?.W?O????*?3?=?PH@QR@w_
@x_9??1??!??*??S>@QT@wg
@xg9??1??*??G?
??N
}*+??$N*,??$:-?
?
:?
?!?
?:?/
??????
?
:?
? ?
?:?/
-?????
?O.?	??6?B?E?H?l?w?z?}?PH6?|l?|QRw_
x_	v?ql?qSH6??l??QTwg
xg	v?rl?rk? ??~$??
~#?G?
??NV*+??O
?PQR?_
SQT?g
G?
??N
S[*+??$N*,??$:?,Y?0:-?
?
:?
?(?
?:?/
?
?W????O"?	?????K?U?X?PH??|[QR[w_
[x_	R?qH?q???SH???[QT[wg
[xg	R?rH?r???k"?)??????~+?G?
??Nn
*+?1,?2?O
?P 
QR
w_

x_S 
QT
wg

xgG?
??N?*+,?-?2?O
?P*QRw_
`_x_S*QTwg
`hxgG?
??N
6N+?
:?+
66?4?3?:?/
-?,?4
?5???
????O&	????)?7?D?F?L?PR)?|8??NQRN?q
N??N?qF??=??S>)??NQTN?r
N??N?rF??k??

1?G???N
C[*+??$:*-??$:?
?
:?
?0?
?:?/
?,?4
?5??????O"?
?
8

G
T
V
Y
PH8?|[QR[w_
[??[x_
Q?qG?qSH8??[QT[wg
[??[xg
Q?rG?rk?"??~3?G?
??Nb**?+?#?$?6?O

PQR?_
SQT?g
G?
??Nb**?+?#?$?7?O

PQR?_
SQT?g
G?
??N?K+?8W?,Y+?
?+
?-M+?
?
N-?
?-?
?:,?9
?W???,?O




8
F
I
P*8e|KQRK?q
3??S*8e?KQTK?r
3??k?$?~?$G?
??N?K+?8W?,Y+?
?+
?-M+?
?
N-?
?-?
?:,?/
?W???,?O
#
$

%
&8
'F
(I
)P*8e|KQRK?q
3??S*8e?KQTK?r
3??k?$?~?$G?
??N
_?,Y?0L*??!
?:
M,?
?@,?
?N-??
:?
??
?:+??W??ާ??+?O
.
/*
0K
1W
2Z
3]
4P*Ke|*0?c_QRW??
S*Ke?*0?i_QTW??
k??~?l~?$?G?
??N?@?,Y*??;
?-L*??!
?:
M,?
?,?
?N+-?W???+?O
9
:3
;;
<>
=P 3?c@QR/??
S 3?i@QT/??
k? ?~?G?
??
N?



?O

GP
QRS
QT
??NI


*??!
?"?O

LP

QRS

QTG?
??N
s?*+?%M?,Y,?
?+
,?
?+
`?-N,?
?
:?
? ?
?:-?9
?W???,?
?
:?
? ?
?:-?/
?W???-?O*

Q
R
S%
TH
UV
VY
W|
X?
Y?
ZP>H?||?|?QR??_
??q%j??S>H??|???QT??g
??r%j??k?2??~?&?~?&G?
??N???,Y?0L*??!
?:
M,?
?,?
?$N+-?
?.W???+?&?O
_
`*
a7
b:
cP *
?q?QR7??
S *
?r?QT7??
k??~?"G?
??N?!*+??$M,?
?+
,?
?+
`?O

h	
iP !QR!?_
	?qS !QT!?g
	?rG?A??
NB*+??O
(P
QRS
QTA??
NB*+?=?O
(P
QRS
QTG???AR

@B'CD	$>o	>{	???	???	???	
??