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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/*******************************************************************************
* Copyright (c) 2004, 2006 QNX Software Systems 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:
* QNX Software Systems - initial API and implementation
*******************************************************************************/
package org.eclipse.cdt.internal.ui.dialogs.cpaths;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import org.eclipse.core.resources.IResource;
import org.eclipse.core.runtime.IPath;
public class CPElementGroup {
private CPElement parent;
private final int kind;
private IResource resource;
private Map<Integer, List<CPElement>> childrenListMap;
private List<CPElement> childrenList;
public CPElementGroup(IResource resource) {
this.kind = -1;
this.resource = resource;
this.childrenListMap = new LinkedHashMap<Integer, List<CPElement>>(2);
}
public CPElementGroup(CPElement parent, int kind) {
this.parent = parent;
this.kind = kind;
this.childrenList = new ArrayList<CPElement>();
}
public IResource getResource() {
return resource;
}
public IPath getPath() {
return resource != null ? resource.getFullPath() : parent.getPath();
}
public CPElement getParent() {
return parent;
}
public int getEntryKind() {
return kind;
}
@Override
public boolean equals(Object arg0) {
if (arg0 == this) {
return true;
}
if (arg0 instanceof CPElementGroup) {
CPElementGroup other = (CPElementGroup)arg0;
return (kind == other.kind && ( (parent == null && other.parent == null) || parent.equals(other.parent)) && ( (resource == null && other.resource == null) || resource.equals(other.resource)));
}
return false;
}
@Override
public int hashCode() {
int hashCode = parent != null ? parent.hashCode() : 0;
hashCode += resource != null ? resource.hashCode() : 0;
return hashCode + kind;
}
public int indexof(CPElement element) {
List<CPElement> children = getChildrenList(element.getEntryKind(), false);
return children != null ? children.indexOf(element) : -1;
}
public void addChild(CPElement element, int insertIndex) {
List<CPElement> children = getChildrenList(element.getEntryKind(), true);
children.add(insertIndex, element);
element.setParent(this);
}
public void addChild(CPElement element) {
List<CPElement> children = getChildrenList(element.getEntryKind(), true);
int indx = children.indexOf(element);
if (indx == -1) {
indx = children.size();
if (element.getInherited() == null) {
for (int i = 0; i < children.size(); i++) {
CPElement next = children.get(i);
if (next.getInherited() != null) {
indx = i;
break;
}
}
}
children.add(indx, element);
element.setParent(this);
} else { // add element with closes matching resource path.
CPElement other = children.get(indx);
if (other.getInherited() != null && element.getInherited() != null) {
IPath otherPath = other.getInherited().getPath();
IPath elemPath = element.getInherited().getPath();
if (!otherPath.equals(elemPath) && otherPath.isPrefixOf(elemPath)) {
children.remove(indx);
other.setParent(null);
children.add(element);
element.setParent(this);
}
}
}
}
public void setChildren(CPElement[] elements) {
if (elements.length > 0) {
if (childrenListMap != null) {
childrenListMap.put(new Integer(elements[0].getEntryKind()), new ArrayList<CPElement>(Arrays.asList(elements)));
} else {
childrenList = new ArrayList<CPElement>(Arrays.asList(elements));
}
}
}
public void addChildren(CPElement[] elements) {
for (CPElement element : elements) {
addChild(element);
}
}
public boolean removeChild(CPElement element) {
List<CPElement> children = getChildrenList(element.getEntryKind(), false);
if (children == null) {
return false;
}
boolean removed = children.remove(element);
if (removed) {
element.setParent(null);
}
return removed;
}
public CPElement[] getChildren(int kind) {
List<CPElement> children = getChildrenList(kind, true);
return children.toArray(new CPElement[children.size()]);
}
public CPElement[] getChildren() {
if (childrenList != null) {
return childrenList.toArray(new CPElement[childrenList.size()]);
}
Collection<List<CPElement>> lists = childrenListMap.values();
Iterator<List<CPElement>> iter = lists.iterator();
List<CPElement> children = new ArrayList<CPElement>();
while (iter.hasNext()) {
children.addAll(iter.next());
}
return children.toArray(new CPElement[children.size()]);
}
public boolean contains(CPElement element) {
List<CPElement> children = getChildrenList(element.getEntryKind(), false);
if (children == null) {
return false;
}
return children.contains(element);
}
public void replaceChild(CPElement element, CPElement replaceWith) {
List<CPElement> children = getChildrenList(element.getEntryKind(), false);
if (children == null) {
return;
}
int idx = children.indexOf(element);
if (idx != -1) {
children.remove(idx);
children.add(idx, replaceWith);
}
}
private List<CPElement> getChildrenList(int kind, boolean create) {
List<CPElement> children = null;
if (childrenList != null) {
children = childrenList;
} else {
children = childrenListMap.get(new Integer(kind));
if (children == null && create) {
children = new ArrayList<CPElement>();
childrenListMap.put(new Integer(kind), children);
}
}
return children;
}
}
|
