blob: 9968d9a3c788cd9c8e16bac6edc09914edcacac3 (
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
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
|
/*******************************************************************************
* Copyright (c) 2000, 2003 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Common Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/cpl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.team.internal.ui.synchronize.sets;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
import org.eclipse.core.resources.IResource;
import org.eclipse.team.core.subscribers.SyncInfo;
/**
* This event keeps track of the changes in a sync set
*/
public class SyncSetChangedEvent {
private SyncSet set;
// List that accumulate changes
// SyncInfo
private Set changedResources = new HashSet();
private Set removedResources = new HashSet();
private Set addedResources = new HashSet();
// IResources
private Set removedRoots = new HashSet();
private Set addedRoots = new HashSet();
private boolean reset = false;
public SyncSetChangedEvent(SyncSet set) {
super();
this.set = set;
}
/* package */ void added(SyncInfo info) {
addedResources.add(info);
}
/* package */ void removed(IResource resource) {
removedResources.add(resource);
}
/* package */ void changed(SyncInfo info) {
changedResources.add(info);
}
public void removedRoot(IResource root) {
if (addedRoots.contains(root)) {
// The root was added and removed which is a no-op
addedRoots.remove(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 = removedRoots.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;
}
}
removedRoots.add(root);
}
}
private boolean isParent(IResource root, IResource element) {
return root.getFullPath().isPrefixOf(element.getFullPath());
}
public void addedRoot(IResource parent) {
if (removedRoots.contains(parent)) {
// The root was re-added which is a no-op
removedRoots.remove(parent);
} else {
// TODO: May be added underneath another added root
addedRoots.add(parent);
}
}
public SyncInfo[] getAddedResources() {
return (SyncInfo[]) addedResources.toArray(new SyncInfo[addedResources.size()]);
}
public IResource[] getAddedRoots() {
return (IResource[]) addedRoots.toArray(new IResource[addedRoots.size()]);
}
public SyncInfo[] getChangedResources() {
return (SyncInfo[]) changedResources.toArray(new SyncInfo[changedResources.size()]);
}
public IResource[] getRemovedResources() {
return (IResource[]) removedResources.toArray(new IResource[removedResources.size()]);
}
public IResource[] getRemovedRoots() {
return (IResource[]) removedRoots.toArray(new IResource[removedRoots.size()]);
}
public SyncSet getSet() {
return set;
}
public void reset() {
reset = true;
}
public boolean isReset() {
return reset;
}
public boolean isEmpty() {
return changedResources.isEmpty() && removedResources.isEmpty() && addedResources.isEmpty() && removedRoots.isEmpty() && addedRoots.isEmpty();
}
}
|
