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
|
package org.eclipse.cdt.internal.core.model;
/*
* (c) Copyright IBM Corp. 2000, 2001.
* All Rights Reserved.
*/
import java.io.File;
import org.eclipse.cdt.core.model.CModelException;
import org.eclipse.cdt.core.model.ICElement;
import org.eclipse.core.resources.IResource;
/**
* Holds cached structure and properties for a C element.
* Subclassed to carry properties for specific kinds of elements.
*/
class CElementInfo {
protected CElement element;
/**
* Collection of handles of immediate children of this
* object. This is an empty array if this element has
* no children.
*/
protected ICElement[] fChildren;
/**
* Shared empty collection used for efficiency.
*/
protected static ICElement[] fgEmptyChildren = new ICElement[]{};
/**
* Is the structure of this element known
* @see ICElement.isStructureKnown()
*/
protected boolean fIsStructureKnown = false;
protected long modificationStamp = 0;
protected CElementInfo(CElement element) {
this.element = element;
fChildren = fgEmptyChildren;
}
protected CElement getElement() {
return element;
}
protected void addChild(ICElement child) {
if (fChildren == fgEmptyChildren) {
setChildren(new ICElement[] {child});
} else {
if (!includesChild(child)) {
setChildren(growAndAddToArray(fChildren, child));
}
}
}
protected ICElement[] getChildren() {
return fChildren;
}
/**
* Adds the new element to a new array that contains all of the elements of the old array.
* Returns the new array.
*/
protected ICElement[] growAndAddToArray(ICElement[] array, ICElement addition) {
ICElement[] old = array;
array = new ICElement[old.length + 1];
System.arraycopy(old, 0, array, 0, old.length);
array[old.length] = addition;
return array;
}
/**
* Returns <code>true</code> if this child is in my children collection
*/
protected boolean includesChild(ICElement child) {
for (int i= 0; i < fChildren.length; i++) {
if (fChildren[i].equals(child)) {
return true;
}
}
return false;
}
/**
* @see ICElement.isStructureKnown()
*/
protected boolean isStructureKnown() {
return fIsStructureKnown;
}
/**
* Returns an array with all the same elements as the specified array except for
* the element to remove. Assumes that the deletion is contained in the array.
*/
protected ICElement[] removeAndShrinkArray(ICElement[] array, ICElement deletion) {
ICElement[] old = array;
array = new ICElement[old.length - 1];
int j = 0;
for (int i = 0; i < old.length; i++) {
if (!old[i].equals(deletion)) {
array[j] = old[i];
} else {
System.arraycopy(old, i + 1, array, j, old.length - (i + 1));
return array;
}
j++;
}
return array;
}
protected void removeChild(ICElement child) {
if (includesChild(child)) {
setChildren(removeAndShrinkArray(fChildren, child));
}
}
protected void removeChildren () {
fChildren = fgEmptyChildren;
}
protected void setChildren(ICElement[] children) {
fChildren = children;
}
protected boolean hasChildren() {
return fChildren.length > 0;
}
protected void setChanged() {
modificationStamp = 0;
}
protected boolean hasChanged () {
IResource r = null;
boolean b = false;
try {
r = getElement().getUnderlyingResource();
} catch (CModelException e) {
e.printStackTrace();
}
if (r != null && r.exists()) {
long modif = 0;
switch(r.getType()) {
// Adding/Removing does not count as changing, in Eclipse
// Ask the underlying file system
case IResource.FOLDER:
case IResource.PROJECT:
case IResource.ROOT:
File file = r.getLocation().toFile();
modif = file.lastModified();
break;
case IResource.FILE:
modif = r.getModificationStamp();
break;
}
b = (modif != modificationStamp);
modificationStamp = modif;
}
return b;
}
/**
* Sets whether the structure of this element known
* @see ICElement.isStructureKnown()
*/
protected void setIsStructureKnown(boolean newIsStructureKnown) {
fIsStructureKnown = newIsStructureKnown;
}
public Object clone() {
try {
return super.clone();
} catch (CloneNotSupportedException e) {
throw new Error();
}
}
}
|
