Categories:
Audio (13)
Biotech (29)
Bytecode (36)
Database (77)
Framework (7)
Game (7)
General (507)
Graphics (53)
I/O (35)
IDE (2)
JAR Tools (101)
JavaBeans (21)
JDBC (121)
JDK (426)
JSP (20)
Logging (108)
Mail (58)
Messaging (8)
Network (84)
PDF (97)
Report (7)
Scripting (84)
Security (32)
Server (121)
Servlet (26)
SOAP (24)
Testing (54)
Web (15)
XML (309)
Collections:
Other Resources:
JDK 11 jdk.scripting.nashorn.jmod - Scripting Nashorn Module
JDK 11 jdk.scripting.nashorn.jmod is the JMOD file for JDK 11 Scripting Nashorn module.
JDK 11 Scripting Nashorn module compiled class files are stored in \fyicenter\jdk-11.0.1\jmods\jdk.scripting.nashorn.jmod.
JDK 11 Scripting Nashorn module compiled class files are also linked and stored in the \fyicenter\jdk-11.0.1\lib\modules JImage file.
JDK 11 Scripting Nashorn module source code files are stored in \fyicenter\jdk-11.0.1\lib\src.zip\jdk.scripting.nashorn.
You can click and view the content of each source code file in the list below.
✍: FYIcenter
⏎ jdk/nashorn/api/tree/SimpleTreeVisitorES5_1.java
/* * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved. * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. * * * * * * * * * * * * * * * * * * * * */ package jdk.nashorn.api.tree; /** * A simple implementation of the TreeVisitor for ECMAScript edition 5.1. * * <p>The visit methods corresponding to ES 5.1 language constructs walk the * "components" of the given tree by calling accept method passing the * current visitor and the additional parameter. * * <p>For constructs introduced in later versions, {@code visitUnknown} * is called instead which throws {@link UnknownTreeException}. * * <p> Methods in this class may be overridden subject to their * general contract. Note that annotating methods in concrete * subclasses with {@link java.lang.Override @Override} will help * ensure that methods are overridden as intended. * * @deprecated Nashorn JavaScript script engine and APIs, and the jjs tool * are deprecated with the intent to remove them in a future release. * * @param <R> the return type of this visitor's methods. Use {@link * Void} for visitors that do not need to return results. * @param <P> the type of the additional parameter to this visitor's * methods. Use {@code Void} for visitors that do not need an * additional parameter. */ @Deprecated(since="11", forRemoval=true) public class SimpleTreeVisitorES5_1<R, P> implements TreeVisitor<R, P> { @Override public R visitAssignment(final AssignmentTree node, final P r) { node.getVariable().accept(this, r); node.getExpression().accept(this, r); return null; } @Override public R visitCompoundAssignment(final CompoundAssignmentTree node, final P r) { node.getVariable().accept(this, r); node.getExpression().accept(this, r); return null; } /** * Visits a {@code ModuleTree} tree by calling {@code * visitUnknown}. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return the result of {@code visitUnknown} */ @Override public R visitModule(final ModuleTree node, final P p) { return visitUnknown(node, p); } /** * Visits an {@code ExportEntryTree} tree by calling {@code * visitUnknown}. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return the result of {@code visitUnknown} */ @Override public R visitExportEntry(final ExportEntryTree node, final P p) { return visitUnknown(node, p); } /** * Visits an {@code ImportEntryTree} tree by calling {@code * visitUnknown}. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return the result of {@code visitUnknown} */ @Override public R visitImportEntry(final ImportEntryTree node, final P p) { return visitUnknown(node, p); } @Override public R visitBinary(final BinaryTree node, final P r) { node.getLeftOperand().accept(this, r); node.getRightOperand().accept(this, r); return null; } @Override public R visitBlock(final BlockTree node, final P r) { node.getStatements().forEach((tree) -> { tree.accept(this, r); }); return null; } @Override public R visitBreak(final BreakTree node, final P r) { return null; } @Override public R visitCase(final CaseTree node, final P r) { final Tree caseVal = node.getExpression(); if (caseVal != null) { caseVal.accept(this, r); } node.getStatements().forEach((tree) -> { tree.accept(this, r); }); return null; } @Override public R visitCatch(final CatchTree node, final P r) { final Tree cond = node.getCondition(); if (cond != null) { cond.accept(this, r); } node.getParameter().accept(this, r); node.getBlock().accept(this, r); return null; } /** * Visits a {@code ClassDeclarationTree} tree by calling {@code * visitUnknown}. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return the result of {@code visitUnknown} */ @Override public R visitClassDeclaration(final ClassDeclarationTree node, final P p) { return visitUnknown(node, p); } /** * Visits a {@code ClassExpressionTree} tree by calling {@code * visitUnknown}. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return the result of {@code visitUnknown} */ @Override public R visitClassExpression(final ClassExpressionTree node, final P p) { return visitUnknown(node, p); } @Override public R visitConditionalExpression(final ConditionalExpressionTree node, final P r) { node.getCondition().accept(this, r); node.getTrueExpression().accept(this, r); node.getFalseExpression().accept(this, r); return null; } @Override public R visitContinue(final ContinueTree node, final P r) { return null; } @Override public R visitDebugger(final DebuggerTree node, final P r) { return null; } @Override public R visitDoWhileLoop(final DoWhileLoopTree node, final P r) { node.getStatement().accept(this, r); node.getCondition().accept(this, r); return null; } @Override public R visitErroneous(final ErroneousTree node, final P r) { return null; } @Override public R visitExpressionStatement(final ExpressionStatementTree node, final P r) { node.getExpression().accept(this, r); return null; } @Override public R visitForLoop(final ForLoopTree node, final P r) { final Tree init = node.getInitializer(); if (init != null) { init.accept(this, r); } final Tree cond = node.getCondition(); if (cond != null) { cond.accept(this, r); } final Tree update = node.getUpdate(); if (update != null) { update.accept(this, r); } node.getStatement().accept(this, r); return null; } @Override public R visitForInLoop(final ForInLoopTree node, final P r) { node.getVariable().accept(this, r); node.getExpression().accept(this, r); final StatementTree stat = node.getStatement(); if (stat != null) { stat.accept(this, r); } return null; } /** * Visits a {@code ForOfLoopTree} tree by calling {@code * visitUnknown}. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return the result of {@code visitUnknown} */ @Override public R visitForOfLoop(final ForOfLoopTree node, final P p) { return visitUnknown(node, p); } @Override public R visitFunctionCall(final FunctionCallTree node, final P r) { node.getFunctionSelect().accept(this, r); node.getArguments().forEach((tree) -> { tree.accept(this, r); }); return null; } @Override public R visitFunctionDeclaration(final FunctionDeclarationTree node, final P r) { node.getParameters().forEach((tree) -> { tree.accept(this, r); }); node.getBody().accept(this, r); return null; } @Override public R visitFunctionExpression(final FunctionExpressionTree node, final P r) { node.getParameters().forEach((tree) -> { tree.accept(this, r); }); node.getBody().accept(this, r); return null; } @Override public R visitIdentifier(final IdentifierTree node, final P r) { return null; } @Override public R visitIf(final IfTree node, final P r) { node.getCondition().accept(this, r); node.getThenStatement().accept(this, r); final Tree elseStat = node.getElseStatement(); if (elseStat != null) { elseStat.accept(this, r); } return null; } @Override public R visitArrayAccess(final ArrayAccessTree node, final P r) { node.getExpression().accept(this, r); node.getIndex().accept(this, r); return null; } @Override public R visitArrayLiteral(final ArrayLiteralTree node, final P r) { node.getElements().stream().filter((tree) -> (tree != null)).forEach((tree) -> { tree.accept(this, r); }); return null; } @Override public R visitLabeledStatement(final LabeledStatementTree node, final P r) { node.getStatement().accept(this, r); return null; } @Override public R visitLiteral(final LiteralTree node, final P r) { return null; } @Override public R visitParenthesized(final ParenthesizedTree node, final P r) { node.getExpression().accept(this, r); return null; } @Override public R visitReturn(final ReturnTree node, final P r) { final Tree retExpr = node.getExpression(); if (retExpr != null) { retExpr.accept(this, r); } return null; } @Override public R visitMemberSelect(final MemberSelectTree node, final P r) { node.getExpression().accept(this, r); return null; } @Override public R visitNew(final NewTree node, final P r) { node.getConstructorExpression().accept(this, r); return null; } @Override public R visitObjectLiteral(final ObjectLiteralTree node, final P r) { node.getProperties().forEach((tree) -> { tree.accept(this, r); }); return null; } @Override public R visitProperty(final PropertyTree node, final P r) { final FunctionExpressionTree getter = node.getGetter(); if (getter != null) { getter.accept(this, r); } final ExpressionTree key = node.getKey(); if (key != null) { key.accept(this, r); } final FunctionExpressionTree setter = node.getSetter(); if (setter != null) { setter.accept(this, r); } final ExpressionTree value = node.getValue(); if (value != null) { value.accept(this, r); } return null; } @Override public R visitRegExpLiteral(final RegExpLiteralTree node, final P r) { return null; } /** * Visits a {@code TemplateLiteralTree} tree by calling {@code * visitUnknown}. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return the result of {@code visitUnknown} */ @Override public R visitTemplateLiteral(final TemplateLiteralTree node, final P p) { return visitUnknown(node, p); } @Override public R visitEmptyStatement(final EmptyStatementTree node, final P r) { return null; } /** * Visits a {@code SpreadTree} tree by calling {@code * visitUnknown}. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return the result of {@code visitUnknown} */ @Override public R visitSpread(final SpreadTree node, final P p) { return visitUnknown(node, p); } @Override public R visitSwitch(final SwitchTree node, final P r) { node.getExpression().accept(this, r); node.getCases().forEach((tree) -> { tree.accept(this, r); }); return null; } @Override public R visitThrow(final ThrowTree node, final P r) { node.getExpression().accept(this, r); return null; } @Override public R visitCompilationUnit(final CompilationUnitTree node, final P r) { node.getSourceElements().forEach((tree) -> { tree.accept(this, r); }); return null; } @Override public R visitTry(final TryTree node, final P r) { node.getBlock().accept(this, r); node.getCatches().forEach((tree) -> { tree.accept(this, r); }); final Tree finallyBlock = node.getFinallyBlock(); if (finallyBlock != null) { finallyBlock.accept(this, r); } return null; } @Override public R visitInstanceOf(final InstanceOfTree node, final P r) { node.getType().accept(this, r); node.getExpression().accept(this, r); return null; } @Override public R visitUnary(final UnaryTree node, final P r) { node.getExpression().accept(this, r); return null; } @Override public R visitVariable(final VariableTree node, final P r) { if (node.getInitializer() != null) { node.getInitializer().accept(this, r); } return null; } @Override public R visitWhileLoop(final WhileLoopTree node, final P r) { node.getCondition().accept(this, r); node.getStatement().accept(this, r); return null; } @Override public R visitWith(final WithTree node, final P r) { node.getScope().accept(this, r); node.getStatement().accept(this, r); return null; } /** * Visits a {@code YieldTree} tree by calling {@code * visitUnknown}. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return the result of {@code visitUnknown} */ @Override public R visitYield(final YieldTree node, final P p) { return visitUnknown(node, p); } /** * {@inheritDoc} * * @implSpec The default implementation of this method in {@code * SimpleTreeVisitorES5_1} will always throw {@code * UnknownTypeException}. This behavior is not required of a * subclass. * * @param node {@inheritDoc} * @param p {@inheritDoc} * @return abnormal return by throwing exception always * @throws UnknownTreeException * a visitor implementation may optionally throw this exception */ @Override public R visitUnknown(final Tree node, final P p) { // unknown in ECMAScript 5.1 edition throw new UnknownTreeException(node, p); } }
⏎ jdk/nashorn/api/tree/SimpleTreeVisitorES5_1.java
Or download all of them as a single archive file:
File name: jdk.scripting.nashorn-11.0.1-src.zip File size: 1390965 bytes Release date: 2018-11-04 Download
⇒ JDK 11 jdk.scripting.nashorn.shell.jmod - Scripting Nashorn Shell Module
2020-04-25, 83643👍, 0💬
Popular Posts:
What Is jtds-1.2.2.jar? jtds-1.2.2.jar is the JAR files of jTDS Java library 1.2.2, which is a JDBC ...
Provides support for the runtime platform, core utility methods and the extension registry. JAR File...
What Is ojdbc7.jar for Oracle 12c R1? ojdbc7.jar for Oracle 12c R1 is the JAR files of ojdbc.jar, JD...
JDK 11 jrt-fs.jar is the JAR file for JDK 11 JRT-FS (Java RunTime - File System) defined in the "jdk...
What Is HttpComponents httpcore-4.4.6.jar? HttpComponents httpcore-4.4.6.jar is the JAR file for Apa...