blob: 5a4d9ec5ab54ea66e0e1ecd2d623e0b5cda18494 (
plain) (
blame)
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
|
/*******************************************************************************
* Copyright (c) 2000, 2009 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.team.internal.core.subscribers;
import java.util.*;
import org.eclipse.core.resources.IResource;
import org.eclipse.team.core.synchronize.*;
public class SyncInfoTreeChangeEvent extends SyncInfoSetChangeEvent implements ISyncInfoTreeChangeEvent {
private Set removedSubtrees = new HashSet();
private Set addedSubtrees = new HashSet();
public SyncInfoTreeChangeEvent(SyncInfoSet set) {
super(set);
}
public void removedSubtreeRoot(IResource root) {
if (addedSubtrees.contains(root)) {
// The root was added and removed which is a no-op
addedSubtrees.remove(root);
} else if (isDescendantOfAddedRoot(root)) {
// Nothing needs to be done since no listeners ever knew about the root
} else {
// check if the root is a child of an existing root
// (in which case it need not be added).
// Also, remove any exisiting roots that are children
// of the new root
for (Iterator iter = removedSubtrees.iterator(); iter.hasNext();) {
IResource element = (IResource) iter.next();
// check if the root is already in the list
if (root.equals(element)) return;
if (isParent(root, element)) {
// the root invalidates the current element
iter.remove();
} else if (isParent(element, root)) {
// the root is a child of an existing element
return;
}
}
removedSubtrees.add(root);
}
}
private boolean isParent(IResource root, IResource element) {
return root.getFullPath().isPrefixOf(element.getFullPath());
}
public void addedSubtreeRoot(IResource parent) {
if (removedSubtrees.contains(parent)) {
// The root was re-added. Just removing the removedRoot
// may not give the proper event.
// Since we can't be sure, just force a reset.
reset();
} else {
// only add the root if their isn't a higher root in the list already
if (!isDescendantOfAddedRoot(parent)) {
addedSubtrees.add(parent);
}
}
}
private boolean isDescendantOfAddedRoot(IResource resource) {
for (Iterator iter = addedSubtrees.iterator(); iter.hasNext();) {
IResource root = (IResource) iter.next();
if (isParent(root, resource)) {
// There is a higher added root already in the list
return true;
}
}
return false;
}
public IResource[] getAddedSubtreeRoots() {
return (IResource[]) addedSubtrees.toArray(new IResource[addedSubtrees.size()]);
}
public IResource[] getRemovedSubtreeRoots() {
return (IResource[]) removedSubtrees.toArray(new IResource[removedSubtrees.size()]);
}
public boolean isEmpty() {
return super.isEmpty() && removedSubtrees.isEmpty() && addedSubtrees.isEmpty();
}
}
|