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


Java BranchedFlowState类代码示例

本文整理汇总了Java中com.google.javascript.jscomp.DataFlowAnalysis.BranchedFlowState的典型用法代码示例。如果您正苦于以下问题:Java BranchedFlowState类的具体用法?Java BranchedFlowState怎么用?Java BranchedFlowState使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。


BranchedFlowState类属于com.google.javascript.jscomp.DataFlowAnalysis包,在下文中一共展示了BranchedFlowState类的6个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: inFunction

import com.google.javascript.jscomp.DataFlowAnalysis.BranchedFlowState; //导入依赖的package包/类
private void inFunction(String js) {
  // Parse the body of the function.
  Node n = compiler.parseTestCode("function() {" + js + "}");
  assertEquals("parsing error: " +
      Joiner.on(", ").join(compiler.getErrors()),
      0, compiler.getErrorCount());
  n = n.getFirstChild();
  // Create the scope with the assumptions.
  Scope assumedScope =
      new SyntacticScopeCreator(compiler).createScope(n, null);
  for (Map.Entry<String,JSType> entry : assumptions.entrySet()) {
    assumedScope.declare(entry.getKey(), null, entry.getValue(), null);
  }
  // Create the control graph.
  ControlFlowAnalysis cfa = new ControlFlowAnalysis(compiler, false);
  cfa.process(null, n);
  ControlFlowGraph<Node> cfg = cfa.getCfg();
  // Create a simple reverse abstract interpreter.
  ReverseAbstractInterpreter rai = new SemanticReverseAbstractInterpreter(
          compiler.getCodingConvention(), registry);
  // Do the type inference by data-flow analysis.
  TypeInference dfa =
      new TypeInference(compiler, cfg, rai, assumedScope);
  dfa.analyze();
  // Get the scope of the implicit return.
  BranchedFlowState<FlowScope> rtnState =
      cfg.getImplicitReturn().getAnnotation();
  returnScope = rtnState.getIn();
}
 
开发者ID:andyjko,项目名称:feedlack,代码行数:30,代码来源:TypeInferenceTest.java

示例2: inFunction

import com.google.javascript.jscomp.DataFlowAnalysis.BranchedFlowState; //导入依赖的package包/类
private void inFunction(String js) {
  // Parse the body of the function.
  Node n = compiler.parseTestCode("function() {" + js + "}");
  assertEquals("parsing error: " +
      Joiner.on(", ").join(compiler.getErrors()),
      0, compiler.getErrorCount());
  n = n.getFirstChild();
  // Create the scope with the assumptions.
  Scope assumedScope =
      new SyntacticScopeCreator(compiler).createScope(n, null);
  for (Map.Entry<String,JSType> entry : assumptions.entrySet()) {
    assumedScope.declare(entry.getKey(), null, entry.getValue(), null);
  }
  // Create the control graph.
  ControlFlowAnalysis cfa = new ControlFlowAnalysis(compiler, false);
  cfa.process(null, n);
  ControlFlowGraph<Node> cfg = cfa.getCfg();
  // Create a simple reverse abstract interpreter.
  ReverseAbstractInterpreter rai = new SemanticReverseAbstractInterpreter(
      compiler.getCodingConvention(), registry);
  // Do the type inference by data-flow analysis.
  TypeInference dfa = new TypeInference(compiler, cfg, rai, assumedScope,
      ASSERTION_FUNCTION_MAP);
  dfa.analyze();
  // Get the scope of the implicit return.
  BranchedFlowState<FlowScope> rtnState =
      cfg.getImplicitReturn().getAnnotation();
  returnScope = rtnState.getIn();
}
 
开发者ID:ehsan,项目名称:js-symbolic-executor,代码行数:30,代码来源:TypeInferenceTest.java

示例3: inFunction

import com.google.javascript.jscomp.DataFlowAnalysis.BranchedFlowState; //导入依赖的package包/类
private void inFunction(String js) {
  // Parse the body of the function.
  String thisBlock = assumedThisType == null
      ? ""
      : "/** @this {" + assumedThisType + "} */";
  Node root = compiler.parseTestCode(
      "(" + thisBlock + " function() {" + js + "});");
  assertEquals("parsing error: " +
      Joiner.on(", ").join(compiler.getErrors()),
      0, compiler.getErrorCount());

  Node n = root.getFirstChild().getFirstChild();
  // Create the scope with the assumptions.
  TypedScopeCreator scopeCreator = new TypedScopeCreator(compiler);
  Scope assumedScope = scopeCreator.createScope(
      n, scopeCreator.createScope(root, null));
  for (Map.Entry<String,JSType> entry : assumptions.entrySet()) {
    assumedScope.declare(entry.getKey(), null, entry.getValue(), null, false);
  }
  // Create the control graph.
  ControlFlowAnalysis cfa = new ControlFlowAnalysis(compiler, false, false);
  cfa.process(null, n);
  ControlFlowGraph<Node> cfg = cfa.getCfg();
  // Create a simple reverse abstract interpreter.
  ReverseAbstractInterpreter rai = compiler.getReverseAbstractInterpreter();
  // Do the type inference by data-flow analysis.
  TypeInference dfa = new TypeInference(compiler, cfg, rai, assumedScope,
      ASSERTION_FUNCTION_MAP);
  dfa.analyze();
  // Get the scope of the implicit return.
  BranchedFlowState<FlowScope> rtnState =
      cfg.getImplicitReturn().getAnnotation();
  returnScope = rtnState.getIn();
}
 
开发者ID:SpoonLabs,项目名称:astor,代码行数:35,代码来源:TypeInferenceTest.java

示例4: inFunction

import com.google.javascript.jscomp.DataFlowAnalysis.BranchedFlowState; //导入依赖的package包/类
private void inFunction(String js) {
  // Parse the body of the function.
  String thisBlock = assumedThisType == null
      ? ""
      : "/** @this {" + assumedThisType + "} */";
  Node root = compiler.parseTestCode(
      "(" + thisBlock + " function() {" + js + "});");
  assertEquals("parsing error: " +
      Joiner.on(", ").join(compiler.getErrors()),
      0, compiler.getErrorCount());

  Node n = root.getFirstFirstChild();
  // Create the scope with the assumptions.
  TypedScopeCreator scopeCreator = new TypedScopeCreator(compiler);
  TypedScope assumedScope = scopeCreator.createScope(
      n, scopeCreator.createScope(root, null));
  for (Map.Entry<String,JSType> entry : assumptions.entrySet()) {
    assumedScope.declare(entry.getKey(), null, entry.getValue(), null, false);
  }
  // Create the control graph.
  ControlFlowAnalysis cfa = new ControlFlowAnalysis(compiler, false, false);
  cfa.process(null, n);
  ControlFlowGraph<Node> cfg = cfa.getCfg();
  // Create a simple reverse abstract interpreter.
  ReverseAbstractInterpreter rai = compiler.getReverseAbstractInterpreter();
  // Do the type inference by data-flow analysis.
  TypeInference dfa = new TypeInference(compiler, cfg, rai, assumedScope,
      ASSERTION_FUNCTION_MAP);
  dfa.analyze();
  // Get the scope of the implicit return.
  BranchedFlowState<FlowScope> rtnState =
      cfg.getImplicitReturn().getAnnotation();
  returnScope = rtnState.getIn();
}
 
开发者ID:google,项目名称:closure-compiler,代码行数:35,代码来源:TypeInferenceTest.java

示例5: verifyBranchedInHas

import com.google.javascript.jscomp.DataFlowAnalysis.BranchedFlowState; //导入依赖的package包/类
static void verifyBranchedInHas(GraphNode<Instruction, Branch> node,
    Variable var, Integer constant) {
  BranchedFlowState<ConstPropLatticeElement> fState = node.getAnnotation();
  assertEquals(constant, fState.getIn().constMap.get(var));
}
 
开发者ID:andyjko,项目名称:feedlack,代码行数:6,代码来源:DataFlowAnalysisTest.java

示例6: verifyBranchedInHas

import com.google.javascript.jscomp.DataFlowAnalysis.BranchedFlowState; //导入依赖的package包/类
static void verifyBranchedInHas(GraphNode<Instruction, Branch> node,
    Variable var, Integer constant) {
  BranchedFlowState<ConstPropLatticeElement> fState = node.getAnnotation();
  veritfyLatticeElementHas(fState.getIn(), var, constant);
}
 
开发者ID:google,项目名称:closure-compiler,代码行数:6,代码来源:DataFlowAnalysisTest.java


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