本文整理汇总了Java中com.google.javascript.jscomp.graph.GraphColoring类的典型用法代码示例。如果您正苦于以下问题：Java GraphColoring类的具体用法？Java GraphColoring怎么用？Java GraphColoring使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
GraphColoring类属于com.google.javascript.jscomp.graph包，在下文中一共展示了GraphColoring类的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: testGreedy
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testGreedy() {
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
graph.createNode("A");
graph.createNode("B");
graph.createNode("C");
graph.createNode("D");
graph.connect("A", "--", "C");
graph.connect("B", "--", "C");
graph.connect("B", "--", "D");
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("A", coloring.getPartitionSuperNode("A"));
assertEquals("A", coloring.getPartitionSuperNode("B"));
assertEquals("C", coloring.getPartitionSuperNode("C"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:18，代码来源:GraphColoringTest.java
示例2: testFullyConnected
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testFullyConnected() {
final int count = 100;
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
for (int i = 0; i < count; i++) {
graph.createNode("Node " + i);
for (int j = 0; j < count; j++) {
graph.createNode("Node " + j);
if (i != j) {
graph.connect("Node " + i, null, "Node " + j);
}
}
}
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(count, coloring.color());
validateColoring(graph);
for (int i = 0; i < count; i++) {
assertEquals("Node " + i, coloring.getPartitionSuperNode("Node " + i));
}
}
开发者ID:andyjko，项目名称:feedlack，代码行数:21，代码来源:GraphColoringTest.java
示例3: testAllConnectedToOneNode
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testAllConnectedToOneNode() {
final int count = 10;
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
graph.createNode("Center");
for (int i = 0; i < count; i++) {
graph.createNode("Node " + i);
graph.connect("Center", null, "Node " + i);
}
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("Center", coloring.getPartitionSuperNode("Center"));
for (int i = 0; i < count; i++) {
assertEquals("Node 0", coloring.getPartitionSuperNode("Node " + i));
}
}
开发者ID:andyjko，项目名称:feedlack，代码行数:18，代码来源:GraphColoringTest.java
示例4: testGreedy
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testGreedy() {
Graph<String, String> graph = LinkedUndirectedGraph.create();
graph.createNode("A");
graph.createNode("B");
graph.createNode("C");
graph.createNode("D");
graph.connect("A", "--", "C");
graph.connect("B", "--", "C");
graph.connect("B", "--", "D");
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("A", coloring.getPartitionSuperNode("A"));
assertEquals("A", coloring.getPartitionSuperNode("B"));
assertEquals("C", coloring.getPartitionSuperNode("C"));
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:18，代码来源:GraphColoringTest.java
示例5: testFullyConnected
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testFullyConnected() {
final int count = 100;
Graph<String, String> graph = LinkedUndirectedGraph.create();
for (int i = 0; i < count; i++) {
graph.createNode("Node " + i);
for (int j = 0; j < count; j++) {
graph.createNode("Node " + j);
if (i != j) {
graph.connect("Node " + i, null, "Node " + j);
}
}
}
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(count, coloring.color());
validateColoring(graph);
for (int i = 0; i < count; i++) {
assertEquals("Node " + i, coloring.getPartitionSuperNode("Node " + i));
}
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:21，代码来源:GraphColoringTest.java
示例6: testAllConnectedToOneNode
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testAllConnectedToOneNode() {
final int count = 10;
Graph<String, String> graph = LinkedUndirectedGraph.create();
graph.createNode("Center");
for (int i = 0; i < count; i++) {
graph.createNode("Node " + i);
graph.connect("Center", null, "Node " + i);
}
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("Center", coloring.getPartitionSuperNode("Center"));
for (int i = 0; i < count; i++) {
assertEquals("Node 0", coloring.getPartitionSuperNode("Node " + i));
}
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:18，代码来源:GraphColoringTest.java
示例7: enterScope
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
// TODO(user): We CAN do this in the global scope, just need to be
// careful when something is exported. Liveness uses bit-vector for live
// sets so I don't see compilation time will be a problem for running this
// pass in the global scope.
Scope scope = t.getScope();
if (scope.isGlobal()) {
return;
}
ControlFlowGraph<Node> cfg = t.getControlFlowGraph();
LiveVariablesAnalysis liveness =
new LiveVariablesAnalysis(cfg, scope, compiler);
liveness.analyze();
UndiGraph<Var, Void> interferenceGraph =
computeVariableNamesInterferenceGraph(
t, cfg, liveness.getEscapedLocals());
GraphColoring<Var, Void> coloring =
new GreedyGraphColoring<Var, Void>(interferenceGraph,
coloringTieBreaker);
coloring.color();
colorings.push(coloring);
}
开发者ID:andyjko，项目名称:feedlack，代码行数:28，代码来源:CoalesceVariableNames.java
示例8: testNoEdge
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testNoEdge() {
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
for (int i = 0; i < 5; i++) {
graph.createNode("Node " + i);
// All node with same color.
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(1, coloring.color());
validateColoring(graph);
for (int j = 0; j < i; j++) {
assertEquals("Node 0", coloring.getPartitionSuperNode("Node 0"));
}
}
}
开发者ID:andyjko，项目名称:feedlack，代码行数:15，代码来源:GraphColoringTest.java
示例9: testTwoNodesConnected
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testTwoNodesConnected() {
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
graph.createNode("A");
graph.createNode("B");
graph.connect("A", "--", "B");
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("A", coloring.getPartitionSuperNode("A"));
assertEquals("B", coloring.getPartitionSuperNode("B"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:13，代码来源:GraphColoringTest.java
示例10: enterScope
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
// TODO(user): We CAN do this in the global scope, just need to be
// careful when something is exported. Liveness uses bit-vector for live
// sets so I don't see compilation time will be a problem for running this
// pass in the global scope.
if (t.inGlobalScope()) {
return;
}
Scope scope = t.getScope();
ControlFlowGraph<Node> cfg = t.getControlFlowGraph();
LiveVariablesAnalysis liveness =
new LiveVariablesAnalysis(cfg, scope, compiler);
// If the function has exactly 2 params, mark them as escaped. This is
// a work-around for an IE bug where it throws an exception if you
// write to the parameters of the callback in a sort(). See:
// http://code.google.com/p/closure-compiler/issues/detail?id=58
if (scope.getRootNode().getFirstChild().getNext().getChildCount() == 2) {
liveness.markAllParametersEscaped();
}
liveness.analyze();
UndiGraph<Var, Void> interferenceGraph =
computeVariableNamesInterferenceGraph(
t, cfg, liveness.getEscapedLocals());
GraphColoring<Var, Void> coloring =
new GreedyGraphColoring<Var, Void>(interferenceGraph,
coloringTieBreaker);
coloring.color();
colorings.push(coloring);
}
开发者ID:ehsan，项目名称:js-symbolic-executor，代码行数:35，代码来源:CoalesceVariableNames.java
示例11: enterScope
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
Scope scope = t.getScope();
if (!shouldOptimizeScope(scope)) {
return;
}
ControlFlowGraph<Node> cfg = t.getControlFlowGraph();
LiveVariablesAnalysis liveness =
new LiveVariablesAnalysis(cfg, scope, compiler);
// If the function has exactly 2 params, mark them as escaped. This is
// a work-around for an IE bug where it throws an exception if you
// write to the parameters of the callback in a sort(). See:
// http://code.google.com/p/closure-compiler/issues/detail?id=58
if (scope.getRootNode().getFirstChild().getNext().getChildCount() == 2) {
liveness.markAllParametersEscaped();
}
liveness.analyze();
UndiGraph<Var, Void> interferenceGraph =
computeVariableNamesInterferenceGraph(
t, cfg, liveness.getEscapedLocals());
GraphColoring<Var, Void> coloring =
new GreedyGraphColoring<Var, Void>(interferenceGraph,
coloringTieBreaker);
coloring.color();
colorings.push(coloring);
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:31，代码来源:CoalesceVariableNames.java
示例12: testNoEdge
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testNoEdge() {
Graph<String, String> graph = LinkedUndirectedGraph.create();
for (int i = 0; i < 5; i++) {
graph.createNode("Node " + i);
// All node with same color.
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(1, coloring.color());
validateColoring(graph);
for (int j = 0; j < i; j++) {
assertEquals("Node 0", coloring.getPartitionSuperNode("Node 0"));
}
}
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:15，代码来源:GraphColoringTest.java
示例13: testTwoNodesConnected
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
public void testTwoNodesConnected() {
Graph<String, String> graph = LinkedUndirectedGraph.create();
graph.createNode("A");
graph.createNode("B");
graph.connect("A", "--", "B");
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("A", coloring.getPartitionSuperNode("A"));
assertEquals("B", coloring.getPartitionSuperNode("B"));
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:13，代码来源:GraphColoringTest.java
示例14: enterScope
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
Scope scope = t.getScope();
if (!shouldOptimizeScope(scope)) {
return;
}
ControlFlowGraph<Node> cfg = t.getControlFlowGraph();
LiveVariablesAnalysis liveness =
new LiveVariablesAnalysis(cfg, scope, compiler);
// If the function has exactly 2 params, mark them as escaped. This is
// a work-around for an IE bug where it throws an exception if you
// write to the parameters of the callback in a sort(). See:
// http://code.google.com/p/closure-compiler/issues/detail?id=58
if (scope.getRootNode().getFirstChild().getNext().getChildCount() == 2) {
liveness.markAllParametersEscaped();
}
liveness.analyze();
UndiGraph<Var, Void> interferenceGraph =
computeVariableNamesInterferenceGraph(
t, cfg, liveness.getEscapedLocals());
GraphColoring<Var, Void> coloring =
new GreedyGraphColoring<>(interferenceGraph,
coloringTieBreaker);
coloring.color();
colorings.push(coloring);
}
开发者ID:nicks，项目名称:closure-compiler-old，代码行数:31，代码来源:CoalesceVariableNames.java
示例15: enterScope
import com.google.javascript.jscomp.graph.GraphColoring; //导入依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
Scope scope = t.getScope();
if (!shouldOptimizeScope(t)) {
return;
}
checkState(scope.isFunctionScope(), scope);
// live variables analysis is based off of the control flow graph
ControlFlowGraph<Node> cfg = t.getControlFlowGraph();
liveness =
new LiveVariablesAnalysis(
cfg, scope, null, compiler, new Es6SyntacticScopeCreator(compiler));
if (compiler.getOptions().getLanguageOut() == CompilerOptions.LanguageMode.ECMASCRIPT3) {
// If the function has exactly 2 params, mark them as escaped. This is a work-around for a
// bug in IE 8 and below, where it throws an exception if you write to the parameters of the
// callback in a sort(). See http://blickly.github.io/closure-compiler-issues/#58 and
// https://www.zachleat.com/web/array-sort/
Node enclosingFunction = scope.getRootNode();
if (NodeUtil.getFunctionParameters(enclosingFunction).hasTwoChildren()) {
liveness.markAllParametersEscaped();
}
}
liveness.analyze();
liveAnalyses.push(liveness);
// The interference graph has the function's variables as its nodes and any interference
// between the variables as the edges. Interference between two variables means that they are
// alive at overlapping times, which means that their variable names cannot be coalesced.
UndiGraph<Var, Void> interferenceGraph =
computeVariableNamesInterferenceGraph(cfg, liveness.getEscapedLocals());
// Color any interfering variables with different colors and any variables that can be safely
// coalesced wih the same color.
GraphColoring<Var, Void> coloring =
new GreedyGraphColoring<>(interferenceGraph, coloringTieBreaker);
coloring.color();
colorings.push(coloring);
}
开发者ID:google，项目名称:closure-compiler，代码行数:44，代码来源:CoalesceVariableNames.java
注：本文中的com.google.javascript.jscomp.graph.GraphColoring类示例整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。 |
客服电话
APP下载
官方微信
请发表评论