当前位置: 首页>>代码示例>>Java>>正文


Java ForNode.isForInOrOf方法代码示例

本文整理汇总了Java中jdk.nashorn.internal.ir.ForNode.isForInOrOf方法的典型用法代码示例。如果您正苦于以下问题:Java ForNode.isForInOrOf方法的具体用法?Java ForNode.isForInOrOf怎么用?Java ForNode.isForInOrOf使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在jdk.nashorn.internal.ir.ForNode的用法示例。


在下文中一共展示了ForNode.isForInOrOf方法的5个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: leaveForNode

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
@Override
public Node leaveForNode(final ForNode forNode) {
    ForNode newForNode = forNode;

    final Expression test = forNode.getTest();
    if (!forNode.isForInOrOf() && isAlwaysTrue(test)) {
        newForNode = forNode.setTest(lc, null);
    }

    newForNode = checkEscape(newForNode);
    if(!es6 && newForNode.isForInOrOf()) {
        // Wrap it in a block so its internally created iterator is restricted in scope, unless we are running
        // in ES6 mode, in which case the parser already created a block to capture let/const declarations.
        addStatementEnclosedInBlock(newForNode);
    } else {
        addStatement(newForNode);
    }
    return newForNode;
}
 
开发者ID:AdoptOpenJDK,项目名称:openjdk-jdk10,代码行数:20,代码来源:Lower.java

示例2: enterForNode

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
@Override
public boolean enterForNode(final ForNode forNode) {
    if(!reachable) {
        return false;
    }

    final Expression init = forNode.getInit();
    if(forNode.isForInOrOf()) {
        final JoinPredecessorExpression iterable = forNode.getModify();
        visitExpression(iterable);
        enterTestFirstLoop(forNode, null, init,
                // If we're iterating over property names, and we can discern from the runtime environment
                // of the compilation that the object being iterated over must use strings for property
                // names (e.g., it is a native JS object or array), then we'll not bother trying to treat
                // the property names optimistically.
                !compiler.useOptimisticTypes() || (!forNode.isForEach() && compiler.hasStringPropertyIterator(iterable.getExpression())));
    } else {
        if(init != null) {
            visitExpressionOnEmptyStack(init);
        }
        enterTestFirstLoop(forNode, forNode.getModify(), null, false);
    }
    assertTypeStackIsEmpty();
    return false;
}
 
开发者ID:AdoptOpenJDK,项目名称:openjdk-jdk10,代码行数:26,代码来源:LocalVariableTypesCalculator.java

示例3: enterForNode

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
@Override
public boolean enterForNode(final ForNode forNode) {
    if(!method.isReachable()) {
        return false;
    }
    enterStatement(forNode);
    if (forNode.isForInOrOf()) {
        enterForIn(forNode);
    } else {
        final Expression init = forNode.getInit();
        if (init != null) {
            loadAndDiscard(init);
        }
        enterForOrWhile(forNode, forNode.getModify());
    }

    return false;
}
 
开发者ID:AdoptOpenJDK,项目名称:openjdk-jdk10,代码行数:19,代码来源:CodeGenerator.java

示例4: leaveForNode

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
@Override
public Node leaveForNode(final ForNode forNode) {
    if (forNode.isForInOrOf()) {
        return forNode.setIterator(lc, newObjectInternal(ITERATOR_PREFIX)); //NASHORN-73
    }

    return end(forNode);
}
 
开发者ID:AdoptOpenJDK,项目名称:openjdk-jdk10,代码行数:9,代码来源:AssignSymbols.java

示例5: enterForNode

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
@Override
public boolean enterForNode(final ForNode forNode) {
    if(forNode.isForInOrOf()) {
        // for..in has the iterable in its "modify"
        tagNeverOptimistic(forNode.getModify());
    } else {
        // Test is never optimistic (always coerced to boolean).
        tagNeverOptimisticLoopTest(forNode);
    }
    return true;
}
 
开发者ID:AdoptOpenJDK,项目名称:openjdk-jdk10,代码行数:12,代码来源:OptimisticTypesCalculator.java


注:本文中的jdk.nashorn.internal.ir.ForNode.isForInOrOf方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。