blob: 194d8a8463a8787cbfed774322be38a16d4ae190 [file] [log] [blame]
package org.eclipse.jdt.internal.core;
/*
* (c) Copyright IBM Corp. 2000, 2001.
* All Rights Reserved.
*/
import org.eclipse.core.resources.*;
import org.eclipse.core.runtime.IAdaptable;
import org.eclipse.jdt.core.*;
/**
* Holds cached structure and properties for a Java element.
* Subclassed to carry properties for specific kinds of elements.
*/
/* package */ class JavaElementInfo {
/**
* Collection of handles of immediate children of this
* object. This is an empty array if this element has
* no children.
*/
protected IJavaElement[] fChildren;
/**
* Shared empty collection used for efficiency.
*/
protected static IJavaElement[] fgEmptyChildren = new IJavaElement[]{};
/**
* Is the structure of this element known
* @see IJavaElement#isStructureKnown()
*/
protected boolean fIsStructureKnown = false;
/**
* Shared empty collection used for efficiency.
*/
static Object[] NO_NON_JAVA_RESOURCES = new Object[] {};
protected JavaElementInfo() {
fChildren = fgEmptyChildren;
}
public void addChild(IJavaElement child) {
if (fChildren == fgEmptyChildren) {
setChildren(new IJavaElement[] {child});
} else {
if (!includesChild(child)) {
setChildren(growAndAddToArray(fChildren, child));
}
}
}
public Object clone() {
try {
return super.clone();
}
catch (CloneNotSupportedException e) {
throw new Error();
}
}
public IJavaElement[] 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 IJavaElement[] growAndAddToArray(IJavaElement[] array, IJavaElement addition) {
IJavaElement[] old = array;
array = new IJavaElement[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(IJavaElement child) {
for (int i= 0; i < fChildren.length; i++) {
if (fChildren[i].equals(child)) {
return true;
}
}
return false;
}
/**
* @see IJavaElement#isStructureKnown()
*/
public 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 IJavaElement[] removeAndShrinkArray(IJavaElement[] array, IJavaElement deletion) {
IJavaElement[] old = array;
array = new IJavaElement[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;
}
public void removeChild(IJavaElement child) {
if (includesChild(child)) {
setChildren(removeAndShrinkArray(fChildren, child));
}
}
public void setChildren(IJavaElement[] children) {
fChildren = children;
}
/**
* Sets whether the structure of this element known
* @see IJavaElement#isStructureKnown()
*/
public void setIsStructureKnown(boolean newIsStructureKnown) {
fIsStructureKnown = newIsStructureKnown;
}
}