MDS/openide
1
0
Fork 0
mirror of https://gitflic.ru/project/openide/openide.git synced 2026-09-27 10:03:11 +07:00
Code Issues Packages Projects Releases Wiki Activity

[vcs-log] minor: remove duplication

Browse Source
This commit is contained in:
Julia Beliaeva
2015-02-13 15:52:04 +03:00
parent cadd814e2f
commit b3ffac3cf0
1 changed files with 10 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files
platform/vcs-log/graph/src/com/intellij/vcs/log/graph/linearBek/LinearBekGraphBuilder.java
+10 -13
View File
@@ -37,6 +37,7 @@ import java.util.Set;
class LinearBekGraphBuilder {
private static final int MAX_BLOCK_SIZE = 200;
private static final int MAGIC_SET_SIZE = PrintElementGeneratorImpl.LONG_EDGE_SIZE;
private static final GraphEdgeToDownNode GRAPH_EDGE_TO_DOWN_NODE = new GraphEdgeToDownNode();
@NotNull private final GraphLayout myGraphLayout;
private final LinearBekGraph myLinearBekGraph;
@@ -181,23 +182,12 @@ class LinearBekGraphBuilder {
magicSet = ContainerUtil.newHashSet(MAGIC_SET_SIZE);
PriorityQueue<Integer> magicQueue = new PriorityQueue<Integer>(MAGIC_SET_SIZE);
magicQueue
.addAll(ContainerUtil.map(myLinearBekGraph.getAdjacentEdges(node, EdgeFilter.NORMAL_DOWN), new Function<GraphEdge, Integer>() {
@Override
public Integer fun(GraphEdge graphEdge) {
return graphEdge.getDownNodeIndex();
}
}));
magicQueue.addAll(ContainerUtil.map(myLinearBekGraph.getAdjacentEdges(node, EdgeFilter.NORMAL_DOWN), GRAPH_EDGE_TO_DOWN_NODE));
while (!magicQueue.isEmpty()) {
Integer i = magicQueue.poll();
if (i > node + MAGIC_SET_SIZE) break;
magicSet.add(i);
magicQueue.addAll(ContainerUtil.map(myLinearBekGraph.getAdjacentEdges(i, EdgeFilter.NORMAL_DOWN), new Function<GraphEdge, Integer>() {
@Override
public Integer fun(GraphEdge graphEdge) {
return graphEdge.getDownNodeIndex();
}
}));
magicQueue.addAll(ContainerUtil.map(myLinearBekGraph.getAdjacentEdges(i, EdgeFilter.NORMAL_DOWN), GRAPH_EDGE_TO_DOWN_NODE));
}
return magicSet;
}
@@ -326,4 +316,11 @@ class LinearBekGraphBuilder {
return d1.compareTo(d2);
}
}
private static class GraphEdgeToDownNode implements Function<GraphEdge, Integer> {
@Override
public Integer fun(GraphEdge graphEdge) {
return graphEdge.getDownNodeIndex();
}
}
}