com.google.javascript.jscomp.graph.GraphReachability.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!
???? 7 |
4com/google/javascript/jscomp/graph/GraphReachability Q(Lcom/google/javascript/jscomp/graph/DiGraph;Lcom/google/common/base/Predicate;)V
java/lang/Object ()V
graph ,Lcom/google/javascript/jscomp/graph/DiGraph;
edgePredicate "Lcom/google/common/base/Predicate;
*com/google/javascript/jscomp/graph/DiGraph clearNodeAnnotations
getNode L(Ljava/lang/Object;)Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode; REACHABLE /Lcom/google/javascript/jscomp/graph/Annotation; " # $ % & 6com/google/javascript/jscomp/graph/DiGraph$DiGraphNode
setAnnotation 2(Lcom/google/javascript/jscomp/graph/Annotation;)V
( ) * + , ;com/google/javascript/jscomp/graph/FixedPointGraphTraversal newTraversal ?(Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;)Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal;
( . / 0 computeFixedPoint A(Lcom/google/javascript/jscomp/graph/DiGraph;Ljava/lang/Object;)V 2 3 4 5 6 ,com/google/javascript/jscomp/graph/GraphNode
getAnnotation 1()Lcom/google/javascript/jscomp/graph/Annotation;
8 9 : ; < $com/google/common/base/Preconditions
checkState (Z)V 2 # " 3 @ >com/google/javascript/jscomp/graph/GraphReachability$EdgeTuple
? B C 9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)V E F G H I com/google/common/base/Predicate apply (Ljava/lang/Object;)Z K 6com/google/javascript/jscomp/graph/GraphReachability$1
J N Hcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback Signature 4Lcom/google/javascript/jscomp/graph/DiGraph; lLcom/google/common/base/Predicate;>; /(Lcom/google/javascript/jscomp/graph/DiGraph;)V Code LineNumberTable LocalVariableTable this 6Lcom/google/javascript/jscomp/graph/GraphReachability; LocalVariableTypeTable >Lcom/google/javascript/jscomp/graph/GraphReachability; MethodParameters 7(Lcom/google/javascript/jscomp/graph/DiGraph;)V ?(Lcom/google/javascript/jscomp/graph/DiGraph;Lcom/google/common/base/Predicate;>;)V RuntimeVisibleTypeAnnotations #Lorg/jspecify/annotations/Nullable; compute (Ljava/lang/Object;)V entry Ljava/lang/Object; TN; (TN;)V recompute
reachableNode newReachable .Lcom/google/javascript/jscomp/graph/GraphNode; 6Lcom/google/javascript/jscomp/graph/GraphNode;
StackMapTable traverseEdge 9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Z destNode source e destination TE; (TN;TE;TN;)Z ?Ljava/lang/Object;Lcom/google/javascript/jscomp/graph/FixedPointGraphTraversal$EdgeCallback;
SourceFile GraphReachability.java NestMembers InnerClasses DiGraphNode EdgeCallback EdgeTuple 1 M O P O Q R S [ *+? ? T
, - U V W X V Y P Z O [ S *? *+? *,? ? T 5 6 7 8 U V W X V Y P Q Z O \ ] ^ _ ` S ? $*? ? *? +? ? ? ! *? '*? +? -? T ; < = > # ? U $ V W $ a b X $ V Y $ a c Z a O d e ` S ? 3*? +? M,? 1 ? ? ? ? 7,? ? = *? '*? +? -? T B C D & E / F 2 G U 3 V W 3 f b * g h X 3 V Y 3 f c * g i j
? 2@ Z f O d k l S U*? +? ? > ? ? C*? ? *? ? ?Y+,-? A? D ? &*? -? :? 1 ? ? ? ? = ?? T K ( M 0 N : O G P Q Q S T U 4 : m h U V W U n b U o b U p b X 4 : m i U V Y U n c U o q U p c j 0" Z
n o p O r s S # ? JY? L? ? T W O t u v w ? J x " " y M ( z ? { J © 2015 - 2024 Weber Informatics LLC | Privacy Policy