com.google.javascript.jscomp.Es6RelativizeImportPaths.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 C
java/lang/Object ()V
5com/google/javascript/jscomp/Es6RelativizeImportPaths compiler /Lcom/google/javascript/jscomp/AbstractCompiler;
com/google/javascript/rhino/Node
getFirstChild $()Lcom/google/javascript/rhino/Node;
.com/google/javascript/jscomp/Es6RewriteModules isEs6ModuleRoot %(Lcom/google/javascript/rhino/Node;)Z >com/google/javascript/jscomp/Es6RelativizeImportPaths$Rewriter
! *com/google/javascript/jscomp/NodeTraversal traverse ?(Lcom/google/javascript/jscomp/AbstractCompiler;Lcom/google/javascript/rhino/Node;Lcom/google/javascript/jscomp/NodeTraversal$Callback;)V
# $ getNext & )com/google/javascript/jscomp/CompilerPass 2(Lcom/google/javascript/jscomp/AbstractCompiler;)V Code LineNumberTable LocalVariableTable this 7Lcom/google/javascript/jscomp/Es6RelativizeImportPaths; MethodParameters process G(Lcom/google/javascript/rhino/Node;Lcom/google/javascript/rhino/Node;)V script "Lcom/google/javascript/rhino/Node; externs root
StackMapTable
SourceFile Es6RelativizeImportPaths.java RuntimeInvisibleAnnotations /Lcom/google/common/annotations/GwtIncompatible; value java.net.URI NestMembers = 7com/google/javascript/jscomp/Es6RelativizeImportPaths$1 InnerClasses Rewriter A 3com/google/javascript/jscomp/NodeTraversal$Callback Callback ! % ' ( F
*? *+? ? ) ' ( ) *
+ ,
- . / ( ? (,?
N-? !-? ? *? -? Y? ? -? "N??? ) - . / - ' 2 * * " 0 1 ( + , ( 2 1 ( 3 1 4 ? ? - 2 3 5 6 7 8 9s : ; <