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] lambdify, remove finals, add NotNull

Browse Source
This commit is contained in:
Julia Beliaeva
2017-01-25 16:48:23 +03:00
parent 291a2210c5
commit ad01ee7e8e
1 changed files with 22 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files
platform/vcs-log/graph/src/com/intellij/vcs/log/graph/impl/facade/ReachableNodes.java
+22 -32
View File
@@ -50,36 +50,29 @@ public class ReachableNodes {
return nodesVisibility;
}
final UnsignedBitSet result = new UnsignedBitSet();
UnsignedBitSet result = new UnsignedBitSet();
ReachableNodes getter = new ReachableNodes(LinearGraphUtils.asLiteLinearGraph(permanentGraph));
getter.walk(headNodeIndexes, new Consumer<Integer>() {
@Override
public void consume(Integer node) {
result.set(node, true);
}
getter.walk(headNodeIndexes, node -> result.set(node, true));
return result;
}
@NotNull
public Set<Integer> getContainingBranches(int nodeIndex, @NotNull Collection<Integer> branchNodeIndexes) {
Set<Integer> result = new HashSet<>();
walk(Collections.singletonList(nodeIndex), false, node -> {
if (branchNodeIndexes.contains(node)) result.add(node);
});
return result;
}
public Set<Integer> getContainingBranches(int nodeIndex, @NotNull final Collection<Integer> branchNodeIndexes) {
final Set<Integer> result = new HashSet<>();
walk(Collections.singletonList(nodeIndex), false, new Consumer<Integer>() {
@Override
public void consume(Integer integer) {
if (branchNodeIndexes.contains(integer)) result.add(integer);
}
});
return result;
}
public void walk(@NotNull Collection<Integer> headIds, @NotNull final Consumer<Integer> consumer) {
public void walk(@NotNull Collection<Integer> headIds, @NotNull Consumer<Integer> consumer) {
walk(headIds, true, consumer);
}
private void walk(@NotNull Collection<Integer> startNodes, final boolean goDown, @NotNull final Consumer<Integer> consumer) {
private void walk(@NotNull Collection<Integer> startNodes, boolean goDown, @NotNull Consumer<Integer> consumer) {
synchronized (myTempFlags) {
myTempFlags.setAll(false);
@@ -89,19 +82,16 @@ public class ReachableNodes {
myTempFlags.set(start, true);
consumer.consume(start);
myDfsUtil.nodeDfsIterator(start, new DfsUtil.NextNode() {
@Override
public int fun(int currentNode) {
for (int downNode : myGraph.getNodes(currentNode, goDown ? LiteLinearGraph.NodeFilter.DOWN : LiteLinearGraph.NodeFilter.UP)) {
if (!myTempFlags.get(downNode)) {
myTempFlags.set(downNode, true);
consumer.consume(downNode);
return downNode;
}
myDfsUtil.nodeDfsIterator(start, currentNode -> {
for (int downNode : myGraph.getNodes(currentNode, goDown ? LiteLinearGraph.NodeFilter.DOWN : LiteLinearGraph.NodeFilter.UP)) {
if (!myTempFlags.get(downNode)) {
myTempFlags.set(downNode, true);
consumer.consume(downNode);
return downNode;
}
return NODE_NOT_FOUND;
}
return DfsUtil.NextNode.NODE_NOT_FOUND;
});
}
}