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
|
/*******************************************************************************
* Copyright (c) 2005 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.debug.internal.ui.viewers.update;
import java.util.ArrayList;
import org.eclipse.debug.internal.ui.viewers.AsynchronousTreeViewer;
import org.eclipse.debug.internal.ui.viewers.IModelChangedListener;
import org.eclipse.debug.internal.ui.viewers.IModelDelta;
import org.eclipse.debug.internal.ui.viewers.TreePath;
import org.eclipse.debug.internal.ui.viewers.TreeSelection;
/**
* Default update policy updates a viewer based on model deltas.
*
* @since 3.2
*/
public class DefaultUpdatePolicy extends AbstractUpdatePolicy implements IModelChangedListener {
// cache of latest tree path for a node
private TreePath fTreePath;
private IModelDelta fNode;
public void modelChanged(IModelDelta delta) {
updateNodes(new IModelDelta[] { delta });
fTreePath = null;
fNode = null;
}
protected void updateNodes(IModelDelta[] nodes) {
AsynchronousTreeViewer viewer = (AsynchronousTreeViewer) getViewer();
if (viewer == null) {
return;
}
for (int i = 0; i < nodes.length; i++) {
IModelDelta node = nodes[i];
int flags = node.getFlags();
if ((flags & IModelDelta.ADDED) != 0) {
handleAdd(viewer, node);
}
if ((flags & IModelDelta.REMOVED) != 0) {
handleRemove(viewer, node);
}
if ((flags & IModelDelta.CHANGED) != 0) {
handleChange(viewer, node);
}
if ((flags & IModelDelta.CONTENT) != 0) {
handleContent(viewer, node);
}
if ((flags & IModelDelta.EXPAND) != 0) {
handleExpand(viewer, node);
}
if ((flags & IModelDelta.SELECT) != 0) {
handleSelect(viewer, node);
}
if ((flags & IModelDelta.STATE) != 0) {
handleState(viewer, node);
}
if ((flags & IModelDelta.INSERTED) != 0) {
// TODO
}
if ((flags & IModelDelta.REPLACED) != 0) {
// TODO
}
updateNodes(node.getNodes());
}
}
protected void handleChange(AsynchronousTreeViewer viewer, IModelDelta delta) {
//do nothing...
}
protected void handleState(AsynchronousTreeViewer viewer, IModelDelta delta) {
viewer.update(delta.getElement());
}
protected void handleSelect(AsynchronousTreeViewer viewer, IModelDelta delta) {
viewer.setSelection(new TreeSelection(getTreePath(delta)));
}
protected void handleExpand(AsynchronousTreeViewer viewer, IModelDelta delta) {
viewer.expand(new TreeSelection(getTreePath(delta)));
}
protected void handleContent(AsynchronousTreeViewer viewer, IModelDelta delta) {
viewer.refresh(delta.getElement());
}
protected void handleRemove(AsynchronousTreeViewer viewer, IModelDelta delta) {
viewer.remove(getTreePath(delta));
}
protected void handleAdd(AsynchronousTreeViewer viewer, IModelDelta delta) {
viewer.add(getTreePath(delta));
}
protected TreePath getTreePath(IModelDelta node) {
if (node != fNode) {
ArrayList list = new ArrayList();
list.add(0, node.getElement());
while (node.getParent() != null) {
node = node.getParent();
list.add(0, node.getElement());
}
fTreePath = new TreePath(list.toArray());
fNode = node;
}
return fTreePath;
}
}
|
