Java EdgeCallback类代码示例

OGeek|极客世界-中国程序员成长平台 › 门户 › 编程› Java›Java编程经验

原作者: [db:作者] 来自: [db:来源] 收藏邀请

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

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

示例1: testGraph8

import com.google.javascript.jscomp.graph.FixedPointGraphTraversal.EdgeCallback; //导入依赖的package包/类
public void testGraph8() {
  maxChange = 2;
  traversal.computeFixedPoint(graph, A);

  try {
    traversal = new FixedPointGraphTraversal<Counter, String>(
      new EdgeCallback<Counter, String>() {
        public boolean traverseEdge(Counter source, String e, Counter dest) {
          return true;
        }
      });
    traversal.computeFixedPoint(graph, A);
    fail("Expecting Error: " +
        FixedPointGraphTraversal.NON_HALTING_ERROR_MSG);
  } catch (IllegalStateException e) {
    assertEquals(e.getMessage(),
        FixedPointGraphTraversal.NON_HALTING_ERROR_MSG);
  }
}

开发者ID:andyjko，项目名称:feedlack，代码行数:20，代码来源:FixedPointGraphTraversalTest.java

示例2: testGraph8

import com.google.javascript.jscomp.graph.FixedPointGraphTraversal.EdgeCallback; //导入依赖的package包/类
public void testGraph8() {
  maxChange = 2;
  traversal.computeFixedPoint(graph, A);

  try {
    traversal = new FixedPointGraphTraversal<Counter, String>(
      new EdgeCallback<Counter, String>() {
        @Override
        public boolean traverseEdge(Counter source, String e, Counter dest) {
          return true;
        }
      });
    traversal.computeFixedPoint(graph, A);
    fail("Expecting Error: " +
        FixedPointGraphTraversal.NON_HALTING_ERROR_MSG);
  } catch (IllegalStateException e) {
    assertEquals(e.getMessage(),
        FixedPointGraphTraversal.NON_HALTING_ERROR_MSG);
  }
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:21，代码来源:FixedPointGraphTraversalTest.java

示例3: testGraph8

import com.google.javascript.jscomp.graph.FixedPointGraphTraversal.EdgeCallback; //导入依赖的package包/类
public void testGraph8() {
  maxChange = 2;
  traversal.computeFixedPoint(graph, A);

  try {
    traversal = new FixedPointGraphTraversal<>(
      new EdgeCallback<Counter, String>() {
        @Override
        public boolean traverseEdge(Counter source, String e, Counter dest) {
          return true;
        }
      });
    traversal.computeFixedPoint(graph, A);
    fail("Expecting Error: " +
        FixedPointGraphTraversal.NON_HALTING_ERROR_MSG);
  } catch (IllegalStateException e) {
    assertThat(e).hasMessageThat().isEqualTo(FixedPointGraphTraversal.NON_HALTING_ERROR_MSG);
  }
}

开发者ID:google，项目名称:closure-compiler，代码行数:20，代码来源:FixedPointGraphTraversalTest.java

示例4: propagateSideEffects

import com.google.javascript.jscomp.graph.FixedPointGraphTraversal.EdgeCallback; //导入依赖的package包/类
/**
 * Propagate side effect information by building a graph based on call site information stored in
 * FunctionInformation and the NameBasedDefinitionProvider and then running GraphReachability to
 * determine the set of functions that have side effects.
 */
private void propagateSideEffects() {
  // Propagate side effect information to a fixed point.
  FixedPointGraphTraversal.newTraversal(
          new EdgeCallback<FunctionInformation, CallSitePropagationInfo>() {
            @Override
            public boolean traverseEdge(
                FunctionInformation source,
                CallSitePropagationInfo edge,
                FunctionInformation destination) {
              return edge.propagate(source, destination);
            }
          })
      .computeFixedPoint(sideEffectGraph);
}

开发者ID:google，项目名称:closure-compiler，代码行数:20，代码来源:PureFunctionIdentifier.java

示例5: testGetDirectedGraph_forwardOnForward

import com.google.javascript.jscomp.graph.FixedPointGraphTraversal.EdgeCallback; //导入依赖的package包/类
/**
 * Test getting a forward directed graph on a forward call graph
 * and propagating over it.
 */
public void testGetDirectedGraph_forwardOnForward() { 
  // For this test we create a simple callback that when, applied until a
  // fixedpoint, computes whether a function is reachable from an initial
  // set of "root" nodes.
  
  String source =
      "function A(){B()};\n" +
      "function B(){C();D()}\n" +
      "function C(){B()};\n" +
      "function D(){};\n" +
      "function E(){C()};\n" +
      "function X(){Y()};\n" +
      "function Y(){Z()};\n" + 
      "function Z(){};" +
      "B();\n";
      
  CallGraph callgraph = compileAndRunForward(source);
  
  final Set<Function> reachableFunctions = Sets.newHashSet();
  
  // We assume the main function and X are our roots
  reachableFunctions.add(callgraph.getMainFunction());
  reachableFunctions.add(callgraph.getUniqueFunctionWithName("X"));
  
  // Propagate reachability from callers to callees
  
  EdgeCallback<CallGraph.Function, CallGraph.Callsite> edgeCallback =
      new EdgeCallback<CallGraph.Function, CallGraph.Callsite>() {
        @Override
        public boolean traverseEdge(Function caller, Callsite callsite,
            Function callee) {
          boolean changed;
          
          if (reachableFunctions.contains(caller)) {
            changed = reachableFunctions.add(callee); // Returns true if added
          } else {
            changed = false;
          }
          
          return changed;
        }
  };
  
  FixedPointGraphTraversal.newTraversal(edgeCallback)
      .computeFixedPoint(callgraph.getForwardDirectedGraph());  
  
  // We expect B, C, D, X, Y, Z and the main function should be reachable.
  // A and E should not be reachable.
  
  assertEquals(7, reachableFunctions.size());

  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("B")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("C")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("D")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("X")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("Y")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("Z")));
  assertTrue(reachableFunctions.contains(
      callgraph.getMainFunction()));
  
  assertFalse(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("A")));
  assertFalse(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("E"))); 
}

开发者ID:ehsan，项目名称:js-symbolic-executor，代码行数:76，代码来源:CallGraphTest.java

示例6: testGetDirectedGraph_forwardOnBackward

import com.google.javascript.jscomp.graph.FixedPointGraphTraversal.EdgeCallback; //导入依赖的package包/类
/**
 * Test getting a backward directed graph on a forward call graph
 * and propagating over it.
 */
public void testGetDirectedGraph_forwardOnBackward() { 
  // For this test we create a simple callback that when, applied until a
  // fixedpoint, computes whether a function is reachable from an initial
  // set of "root" nodes.
  
  String source =
      "function A(){B()};\n" +
      "function B(){C();D()}\n" +
      "function C(){B()};\n" +
      "function D(){};\n" +
      "function E(){C()};\n" +
      "function X(){Y()};\n" +
      "function Y(){Z()};\n" + 
      "function Z(){};" +
      "B();\n";
      
  CallGraph callgraph = compileAndRunBackward(source);
  
  final Set<Function> reachableFunctions = Sets.newHashSet();
  
  // We assume the main function and X are our roots
  reachableFunctions.add(callgraph.getMainFunction());
  reachableFunctions.add(callgraph.getUniqueFunctionWithName("X"));
  
  // Propagate reachability from callers to callees
  
  EdgeCallback<CallGraph.Function, CallGraph.Callsite> edgeCallback =
      new EdgeCallback<CallGraph.Function, CallGraph.Callsite>() {
        @Override
        public boolean traverseEdge(Function caller, Callsite callsite,
            Function callee) {
          boolean changed;
          
          if (reachableFunctions.contains(caller)) {
            changed = reachableFunctions.add(callee); // Returns true if added
          } else {
            changed = false;
          }
          
          return changed;
        }
  };
  
  FixedPointGraphTraversal.newTraversal(edgeCallback)
      .computeFixedPoint(callgraph.getForwardDirectedGraph());  
  
  // We expect B, C, D, X, Y, Z and the main function should be reachable.
  // A and E should not be reachable.
  
  assertEquals(7, reachableFunctions.size());

  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("B")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("C")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("D")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("X")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("Y")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("Z")));
  assertTrue(reachableFunctions.contains(
      callgraph.getMainFunction()));
  
  assertFalse(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("A")));
  assertFalse(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("E"))); 
}

开发者ID:ehsan，项目名称:js-symbolic-executor，代码行数:76，代码来源:CallGraphTest.java

示例7: testGetDirectedGraph_forwardOnForward

import com.google.javascript.jscomp.graph.FixedPointGraphTraversal.EdgeCallback; //导入依赖的package包/类
/**
 * Test getting a forward directed graph on a forward call graph
 * and propagating over it.
 */
public void testGetDirectedGraph_forwardOnForward() {
  // For this test we create a simple callback that, when applied until a
  // fixedpoint, computes whether a function is reachable from an initial
  // set of "root" nodes.

  String source =
      "function A(){B()};\n" +
      "function B(){C();D()}\n" +
      "function C(){B()};\n" +
      "function D(){};\n" +
      "function E(){C()};\n" +
      "function X(){Y()};\n" +
      "function Y(){Z()};\n" +
      "function Z(){};" +
      "B();\n";

  CallGraph callgraph = compileAndRunForward(source);

  final Set<Function> reachableFunctions = Sets.newHashSet();

  // We assume the main function and X are our roots
  reachableFunctions.add(callgraph.getMainFunction());
  reachableFunctions.add(callgraph.getUniqueFunctionWithName("X"));

  // Propagate reachability from callers to callees

  EdgeCallback<CallGraph.Function, CallGraph.Callsite> edgeCallback =
      new EdgeCallback<CallGraph.Function, CallGraph.Callsite>() {
        @Override
        public boolean traverseEdge(Function caller, Callsite callsite,
            Function callee) {
          boolean changed;

          if (reachableFunctions.contains(caller)) {
            changed = reachableFunctions.add(callee); // Returns true if added
          } else {
            changed = false;
          }

          return changed;
        }
  };

  FixedPointGraphTraversal.newTraversal(edgeCallback)
      .computeFixedPoint(callgraph.getForwardDirectedGraph());

  // We expect B, C, D, X, Y, Z and the main function should be reachable.
  // A and E should not be reachable.

  assertEquals(7, reachableFunctions.size());

  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("B")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("C")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("D")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("X")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("Y")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("Z")));
  assertTrue(reachableFunctions.contains(
      callgraph.getMainFunction()));

  assertFalse(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("A")));
  assertFalse(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("E")));
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:76，代码来源:CallGraphTest.java

示例8: testGetDirectedGraph_forwardOnBackward

import com.google.javascript.jscomp.graph.FixedPointGraphTraversal.EdgeCallback; //导入依赖的package包/类
/**
 * Test getting a backward directed graph on a forward call graph
 * and propagating over it.
 */
public void testGetDirectedGraph_forwardOnBackward() {
  // For this test we create a simple callback that, when applied until a
  // fixedpoint, computes whether a function is reachable from an initial
  // set of "root" nodes.

  String source =
      "function A(){B()};\n" +
      "function B(){C();D()}\n" +
      "function C(){B()};\n" +
      "function D(){};\n" +
      "function E(){C()};\n" +
      "function X(){Y()};\n" +
      "function Y(){Z()};\n" +
      "function Z(){};" +
      "B();\n";

  CallGraph callgraph = compileAndRunBackward(source);

  final Set<Function> reachableFunctions = Sets.newHashSet();

  // We assume the main function and X are our roots
  reachableFunctions.add(callgraph.getMainFunction());
  reachableFunctions.add(callgraph.getUniqueFunctionWithName("X"));

  // Propagate reachability from callers to callees

  EdgeCallback<CallGraph.Function, CallGraph.Callsite> edgeCallback =
      new EdgeCallback<CallGraph.Function, CallGraph.Callsite>() {
        @Override
        public boolean traverseEdge(Function caller, Callsite callsite,
            Function callee) {
          boolean changed;

          if (reachableFunctions.contains(caller)) {
            changed = reachableFunctions.add(callee); // Returns true if added
          } else {
            changed = false;
          }

          return changed;
        }
  };

  FixedPointGraphTraversal.newTraversal(edgeCallback)
      .computeFixedPoint(callgraph.getForwardDirectedGraph());

  // We expect B, C, D, X, Y, Z and the main function should be reachable.
  // A and E should not be reachable.

  assertEquals(7, reachableFunctions.size());

  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("B")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("C")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("D")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("X")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("Y")));
  assertTrue(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("Z")));
  assertTrue(reachableFunctions.contains(
      callgraph.getMainFunction()));

  assertFalse(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("A")));
  assertFalse(reachableFunctions.contains(
      callgraph.getUniqueFunctionWithName("E")));
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:76，代码来源:CallGraphTest.java

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

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

Java Text类代码示例发布时间：2022-05-23

Java StempelFilter类代码示例发布时间：2022-05-23

剪的笔顺,诠释剪的笔画,认识剪的部首

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：17917|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：9550|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8120|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8499|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8402|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9289|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8367|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：7794|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8348|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7353|2022-11-06

客服电话

电子邮件

Java EdgeCallback类代码示例

示例1: testGraph8

示例2: testGraph8

示例3: testGraph8

示例4: propagateSideEffects

示例5: testGetDirectedGraph_forwardOnForward

示例6: testGetDirectedGraph_forwardOnBackward

示例7: testGetDirectedGraph_forwardOnForward

示例8: testGetDirectedGraph_forwardOnBackward

请发表评论

全部评论

上一篇：

下一篇：

GitbookIO/gitbook:

CVE-2022-30792

juleswhite/mobile-cloud-asgn1

kevin-wayne/algs4: Algorithms, 4th editi

kyamagu/matlab-json: Use official API: h

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053