blob: 667b8c744fc49cf156491ca2744725ce81a606d9 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/*
* Copyright 2000-2014 JetBrains s.r.o.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.intellij.vcs.log.graph.impl.visible;
import com.intellij.openapi.util.Condition;
import com.intellij.util.Consumer;
import com.intellij.util.SmartList;
import com.intellij.util.containers.MultiMap;
import com.intellij.vcs.log.graph.api.LinearGraph;
import com.intellij.vcs.log.graph.api.LinearGraphWithHiddenNodes;
import com.intellij.vcs.log.graph.api.elements.GraphEdge;
import com.intellij.vcs.log.graph.api.elements.GraphNode;
import com.intellij.vcs.log.graph.utils.Flags;
import com.intellij.vcs.log.graph.utils.ListenerController;
import com.intellij.vcs.log.graph.utils.impl.BitSetFlags;
import com.intellij.vcs.log.graph.utils.impl.SetListenerController;
import org.jetbrains.annotations.NotNull;
import java.util.List;
public class FilterGraphWithHiddenNodes implements LinearGraphWithHiddenNodes {
@NotNull
private final LinearGraphWithHiddenNodes myDelegateGraph;
@NotNull
private final Flags myVisibleNodes;
@NotNull
private final DottedEdges myDottedEdges;
@NotNull
private final SetListenerController<UpdateListener> myListenerController = new SetListenerController<UpdateListener>();
public FilterGraphWithHiddenNodes(@NotNull LinearGraphWithHiddenNodes delegateGraph, @NotNull Condition<Integer> isVisibleNode) {
myDelegateGraph = delegateGraph;
myVisibleNodes = new BitSetFlags(delegateGraph.nodesCount());
for (int i = 0; i < delegateGraph.nodesCount(); i++) {
myVisibleNodes.set(i, delegateGraph.nodeIsVisible(i) && isVisibleNode.value(i)); // todo: think about it: may be drop myVisibleNodes
}
MultiMap<Integer, Integer> edges = DottedEdgesComputer.compute(myDelegateGraph, myVisibleNodes);
myDottedEdges = DottedEdges.newInstance(edges);
addUpdateListener();
}
private void addUpdateListener() {
myDelegateGraph.getListenerController().addListener(new UpdateListener() {
@Override
public void update(final int upNodeIndex, final int downNodeIndex) {
myListenerController.callListeners(new Consumer<UpdateListener>() {
@Override
public void consume(UpdateListener updateListener) {
updateListener.update(upNodeIndex, downNodeIndex);
}
});
}
});
}
@Override
public boolean nodeIsVisible(int nodeIndex) {
return myVisibleNodes.get(nodeIndex);
}
@NotNull
@Override
public GraphNode.Type getNodeType(int nodeIndex) {
return GraphNode.Type.USUAL;
}
@NotNull
@Override
public GraphEdge.Type getEdgeType(int upNodeIndex, int downNodeIndex) {
if (myDottedEdges.getAdjacentNodes(upNodeIndex).contains(downNodeIndex))
return GraphEdge.Type.HIDE;
else
return GraphEdge.Type.USUAL;
}
@NotNull
@Override
public ListenerController<UpdateListener> getListenerController() {
return myListenerController;
}
@Override
public int nodesCount() {
return myDelegateGraph.nodesCount();
}
@NotNull
@Override
public List<Integer> getUpNodes(int nodeIndex) {
List<Integer> upNodes = new SmartList<Integer>();
for (int upNode : myDelegateGraph.getUpNodes(nodeIndex)) {
if (nodeIsVisible(upNode))
upNodes.add(upNode);
}
for (int adjNode : myDottedEdges.getAdjacentNodes(nodeIndex)) {
if (adjNode < nodeIndex)
upNodes.add(adjNode);
}
return upNodes;
}
@NotNull
@Override
public List<Integer> getDownNodes(int nodeIndex) {
List<Integer> downNodes = new SmartList<Integer>();
for (int downNode : myDelegateGraph.getDownNodes(nodeIndex)) {
if (downNode != LinearGraph.NOT_LOAD_COMMIT && nodeIsVisible(downNode))
downNodes.add(downNode);
}
for (int adjNode : myDottedEdges.getAdjacentNodes(nodeIndex)) {
if (adjNode > nodeIndex)
downNodes.add(adjNode);
}
return downNodes;
}
}
|
