com.google.javascript.jscomp.graph.LinkedDirectedGraph.class Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of closure-compiler-unshaded Show documentation
Show all versions of closure-compiler-unshaded Show documentation
Closure Compiler is a JavaScript optimizing compiler. It parses your
JavaScript, analyzes it, removes dead code and rewrites and minimizes
what's left. It also checks syntax, variable references, and types, and
warns about common JavaScript pitfalls. It is used in many of Google's
JavaScript apps, including Gmail, Google Web Search, Google Maps, and
Google Docs.
The newest version!
???? 7h 7com/google/javascript/jscomp/graph/Graph$SimpleSubGraph
-(Lcom/google/javascript/jscomp/graph/Graph;)V 6com/google/javascript/jscomp/graph/LinkedDirectedGraph
(ZZ)V
*com/google/javascript/jscomp/graph/DiGraph ()V java/util/LinkedHashMap
nodes Ljava/util/Map; useNodeAnnotations Z useEdgeAnnotations
! "
getNodeOrFail B(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/GraphNode; $ Hcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode & Qcom/google/javascript/jscomp/graph/LinkedDirectedGraph$AnnotatedLinkedDiGraphEdge
% ( ) ?(Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode;Ljava/lang/Object;Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode;)V + Hcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphEdge
* (
# . / 0 getOutEdges ()Ljava/util/List; 2 3 4 5 6 java/util/List add (Ljava/lang/Object;)Z
# 8 9 0
getInEdges
; < =
createNode ^(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode;
? @ A B C !com/google/common/base/Predicates equalTo 6(Ljava/lang/Object;)Lcom/google/common/base/Predicate;
E F G isConnectedInDirection ?(Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode;Lcom/google/common/base/Predicate;Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode;)Z
I J K connect ?(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;Ljava/lang/Object;Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)V
M N O disconnectInDirection '(Ljava/lang/Object;Ljava/lang/Object;)V
Q R S getEdgesInDirection 6(Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/List; 2 U V W iterator ()Ljava/util/Iterator; Y Z [ \ ] java/util/Iterator hasNext ()Z Y _ ` a next ()Ljava/lang/Object; c 6com/google/javascript/jscomp/graph/DiGraph$DiGraphEdge 2 e f 6 remove h i j k l
java/util/Map values ()Ljava/util/Collection;
n o p q r java/util/Collections unmodifiableCollection .(Ljava/util/Collection;)Ljava/util/Collection; h t u v get &(Ljava/lang/Object;)Ljava/lang/Object;
n x y z unmodifiableList "(Ljava/util/List;)Ljava/util/List; | } ~ apply W(Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph;)Ljava/util/function/Function; h ? ? ? computeIfAbsent C(Ljava/lang/Object;Ljava/util/function/Function;)Ljava/lang/Object; 2 ? ? ? size ()I ? java/util/ArrayList
? ? ? (I)V 2 ? ? ? addAll (Ljava/util/Collection;)Z
? ? U ? java/util/Collection b ? ? ? getDestination :()Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;
* ? ? ? L()Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode;
? ? ? ?
alwaysTrue $()Lcom/google/common/base/Predicate;
? F ? I(Ljava/lang/Object;Lcom/google/common/base/Predicate;Ljava/lang/Object;)Z b ? ? a getValue ? ? ? } 6 com/google/common/base/Predicate b ? ? ? getSource ? 6com/google/javascript/jscomp/graph/DiGraph$DiGraphNode
? ? ? getDirectedPredNodes J(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Ljava/util/List;
? ? ? ? v $com/google/common/base/Preconditions checkNotNull
* ? ? ?
? ? ? getDirectedSuccNodes h ? ? LinkedGraph
? ? = getNode ? Qcom/google/javascript/jscomp/graph/LinkedDirectedGraph$AnnotatedLinkedDiGraphNode
? ? ? (Ljava/lang/Object;)V
# ? ? 0com/google/javascript/jscomp/graph/GraphvizGraph Signature fLjava/util/Map;>; 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 MethodParameters 9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)V srcValue Ljava/lang/Object; edgeValue destValue src JLcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode; dest edge JLcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphEdge; TN; TE; RLcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode; RLcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphEdge;
StackMapTable (TN;TE;TN;)V 8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode; lSrc lDest @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 n1 n2 (TN;TN;)V 8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge; >Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge<*TE;>; getNodes l()Ljava/util/Collection;>; nodeValue W(TN;)Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode; $(Ljava/lang/Object;)Ljava/util/List; node i(TN;)Ljava/util/List;>; getEdges forwardEdges Ljava/util/List;
backwardEdges totalSize I edges dLjava/util/List;>; l(TN;TN;)Ljava/util/List;>; result f()Ljava/util/List;>; getFirstEdge 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; RuntimeVisibleTypeAnnotations #Lorg/jspecify/annotations/Nullable; java/lang/Object '(Ljava/lang/Object;Ljava/lang/Object;)Z source (TN;TN;)Z 9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Z (TN;TE;TN;)Z inEdge
edgeFilter "Lcom/google/common/base/Predicate; outEdges outEdgesLen inEdges
inEdgesLen 'Lcom/google/common/base/Predicate; ?(Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode;Lcom/google/common/base/Predicate;Lcom/google/javascript/jscomp/graph/LinkedDirectedGraph$LinkedDiGraphNode;)Z edgeMatcher 0(TN;Lcom/google/common/base/Predicate;TN;)Z i(TN;)Ljava/util/List;>; dNode lNode nodeList dLjava/util/List;>; ?(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Ljava/util/List;>; getGraphvizEdges edgeList QLjava/util/List; S()Ljava/util/List; getGraphvizNodes QLjava/util/List; S()Ljava/util/List; getName ()Ljava/lang/String;
isDirected getNodeCount getNeighborNodes value HLjava/util/List;>; M(TN;)Ljava/util/List;>;
getNodeDegree (Ljava/lang/Object;)I (TN;)I L(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode; lambda$createNode$0 k ?Lcom/google/javascript/jscomp/graph/DiGraph;Lcom/google/javascript/jscomp/graph/GraphvizGraph;
SourceFile LinkedDirectedGraph.java NestMembers BootstrapMethodsE
FGH IJ "java/lang/invoke/LambdaMetafactory metafactory ?(Ljava/lang/invoke/MethodHandles$Lookup;Ljava/lang/String;Ljava/lang/invoke/MethodType;Ljava/lang/invoke/MethodType;Ljava/lang/invoke/MethodHandle;Ljava/lang/invoke/MethodType;)Ljava/lang/invoke/CallSite; vM
N = = = InnerClassesR (com/google/javascript/jscomp/graph/Graph SimpleSubGraph LinkedDiGraphNode AnnotatedLinkedDiGraphEdge LinkedDiGraphEdge DiGraphNode DiGraphEdge AnnotatedLinkedDiGraphNode[ 2com/google/javascript/jscomp/graph/Graph$GraphEdge GraphEdge^ =com/google/javascript/jscomp/graph/GraphvizGraph$GraphvizEdge GraphvizEdgea =com/google/javascript/jscomp/graph/GraphvizGraph$GraphvizNode GraphvizNoded %java/lang/invoke/MethodHandles$Lookupf java/lang/invoke/MethodHandles Lookup !
? ? ? & ? ? ? E ? Y*? ? ? 3 ? ? ? ? ? ? ? ? ? ? ? "
? Y? ? ? 7 ? ? ? ? ? "
? Y? ? ? ; ? ? ? z *? *? Y? ? *? * ? ? ? B / C D E ? ? ? ? ? ? ? J ? ? 8 S*+? ? #:*-? ? #:*? ? ? %Y,? '? ? *Y,? ,:? -? 1 W? 7? 1 W? ? " I
J L M * N 8 O E P R Q ? H S ? ? S ? ? S ? ? S ? ?
I ? ? ? ? ? 8 ? ? ? H S ? ? S ? ? S ? ? S ? ?
I ? ? ? ? ? 8 ? ? ? ? * # #K * ?
? ? ? ? ? J K ? 0 K+? #:-? #:*? ? ? %Y,? '? ? *Y,? ,:? -? 1 W? 7? 1 W? ? " Y Z ] ^ " _ 0 ` = a J b ? H K ? ? K ? ? K ? ? K ? ? E ? ? ? ? ? 0 ? ? ? H K ? ? K ? ? K ? ? K ? ? E ? ? ? ? ? 0 ? ? ? ? " # #K * ?
? ? ? ? ? ? ? ? ? '*+? ::*-? ::*,? >? D? *,? H? ? j k l m & o ? > ' ? ? ' ? ? ' ? ? ' ? ? ? ? ? ? ? > ' ? ? ' ? ? ' ? ? ' ? ? ? ? ? ? ? ? & # # ?
? ? ? ? ? ? O ? y
*+,? L*,+? L? ? s t u ?
? ?
? ?
? ? ?
? ?
? ?
? ? ? ? ? ? ? N O ? " S*+? ? #N*,? ? #:*+,? P? T :? X ? +? ^ ? b:-? -? d W? 7? d W??ѱ ? y z { 6 | B } O ~ R ? > 6 ? ? S ? ? S ? ? S ? ? J ? ? @ ? ? ? > 6 ? ? S ? ? S ? ? S ? ? J ? ? @ ? ? ? ? # # Y? 1 ? ? ? ? ? ? l ? I
*? ? g ? m? ? ? ?
? ? ?
? ? ? ? ? = ? ^ *? +? s ? #? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 9 ? ? y *+? ? #M,? 7? w? ?
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? / ? ? y *+? ? #M,? -? w? ?
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? < = ? d *? +*? { ? ? #? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? S ? @*+,? PN*,+? P:-? ? ? ? `6? ?Y? ?:-? ? W? ? W? ? ? ? ? ? * ? 3 ? = ? ? H @ ? ? @ ? ? @ ? ? 9 ? 1 ! * ? > @ ? ? @ ? ? @ ? ? 9 ? 1 * ? ? ? ? ? 0 ? ? =? ?Y? ?L*? ? g ? ? M,? X ? ,? ^ ? #N+-? -? ? W???+? w? ? ? ? * ? 5 ? 8 ? ? * ? ? = ? ? 5 ? * ? ? = ? ? 5 ? ? 2 Y? ?
? y {*+? ? #N*,? ? #:-? -? T :? X ? !? ^ ? b:? ? ? ????? -? T :? X ? ? ^ ? b:? ? -? ????? ? . ? ? ? 4 ? @ ? C ? F ? h ? s ? v ? y ? ? H 4 ? h ? { ? ? { ? ? { ? ? r ? h
? ? H 4 h { ? ? { ? ? { ? ? r ? h
? ? ? # # Y$? ? Y#? ? ? ? ? R S ? O W*+? ? #N*,? ? #:? ?Y? ?:-? -? T :? X ? &? ^ ? *:? ??
? 1 W???? ? " ? ? ? ? = ? G ? Q ? T ? ? H = ? W ? ? W ? ? W ? ? N ? D
? ; ? H = ? W ? ? W ? ? W ? ? N ? D
? ; ? " ? ' # # 2 Y )? ? ? ? ? F ? n
*+? ?,? ?? ? ? ?
? ?
?
? ? ?
? ?
?
? ? ? ? ? F ? ? *+,? >-? ?? ? ? ? * ? ? ? ? ? ? ? ? * ? ? ? ? ? ? ? ?
? ? ? F G ? ?
?+? -:? ? 6-? 7:? ? 6? E? T :? X ? /? ^ ? b: ? ? -? , ? ? ? ? ? ???ͧ B? T :? X ? /? ^ ? b: ? ? +? , ? ? ? ? ? ????? ? : ? ? ? ? ? % ? D ? _ ? a g ? ? ? ?
? f
D ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? R D ? ? ? ? ? ? ? ? ? ? ? ? ? / ? . # ? # 2 2 Y 2? ? Y2? ?
? ? ! F ? ? ? *+? ? #:*-? ? #:*,? D? ?
? > ? ? ? ? " ? ?
?
? ? > ? ? ? ? " ? ?
?
? ?
? " ? ? # ? ? ? b **? +? s ? ?? ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? $ ? ? ? M+? ?W+? #M? ?Y,? 7? ? ? ?N,? 7? T :? X ? ? ^ ? *:-? ?? 1 W???-? ?
< H! K" ? 4 < ? ? M ? ? M% ?
C& ? 2' ? 4 < ? ? M ? ? M% ?
C& ? 2'( ? ? & # 2 Y? $ ? % ? ) ? ? ? b **? +? s ? ?? ?? ? ' ? ? ? ? ? ? ? ? ? ? ? ? ? $ ? ? ? M+? ?W+? #M? ?Y,? -? ? ? ?N,? -? T :? X ? ? ^ ? *:-? ?? 1 W???-? ? , -
/ 0 <1 H2 K3 ? 4 < ? ? M ? ? M% ?
C& ? 2' ? 4 < ? ? M ? ? M% ?
C& ? 2'( ? ? & # 2 Y? $ ? % ? ) * 0 ? _? ?Y? ?L*? ? g ? ? M,? X ? @,? ^ ? #N-? -? T :? X ? ? ^ ? b:+? *? 1 W??ާ??+? ? 8 9 *: K; W< Z= ]> ? * K ? ? * 0 ? ? _ ? ? W+ ? * K ? * 0 ? ? _ ? ? W+, ? ? 2 Y? # Y? $? ? - . 0 ? ? @? ?Y*? ? ? ? ?L*? ? g ? ? M,? X ? ,? ^ ? #N+-? 1 W???+? ? C D 3E ;F >G ? 3 ? ? @ ? ? /' ? 3 ? ? @ ? ? /'/ ? ? 2 Y? ? 0 12 ? ? ?? ? L ? ? ? ? ? ? 3 ] ? > ? ? Q ? ? ? ? ? ? 4 ? ? F
*? ? ? ? ? V ?
? ? ?
? ? 5 ? ? k ?*+? ?M? ?Y,? 7? ? ,? -? ? `? ?N,? 7? T :? X ? ? ^ ? b:-? ? ? 1 W???,? -? T :? X ? ? ^ ? b:-? ? ? 1 W???-? ? *
[ \ ] !^ B_ P` Sa tb ?c ?d ? > B ? t ? ? ? ? ?6 ? ? ? ? ! f ? > B t ? ? ? ?6 ? ? ? ? ! f7 ? ? , # 2 Y? &?
Y? & ? 6 ? 8 9: ? ? *+? ? #M,? 7? ? ,? -? ? `? ?
i j ? ? ? 6 ? ? ? ? ? ? 6 ? ? ? ? 6 ? ;A ?< ? B *+? ?? ? . ? ? ? ? ? ? ? ? A << ? B *+? :? ? . ? ? ? ? ? ? ? ? A < " ? B *+? :? ? . ? ? ? ? ? ? ? ? A ? " ? B *+? ?? ? . ? ? ? ? ? ? ? ? = = ? z *? ? ? ?Y+? ħ ? #Y+? ǰ ? ? ? ? ? ? ? ? > ? ? ? ? ? G # ? ?@ AB
% * ? #C D KLOP Z QS # T % U * V ?
W b
X ? Y ZQ\ ] ?_ ` ?b ceg © 2015 - 2024 Weber Informatics LLC | Privacy Policy