import org.eclipse.jdt.internal.core.JavaProjectElementInfo.ProjectCache;

	public ProjectCache getProjectCache() throws JavaModelException {

		return ((JavaProjectElementInfo) getElementInfo()).getProjectCache(this);

	}

import org.eclipse.jdt.internal.core.util.HashSetOfArray;

			this.pkgFragmentsCaches = pkgFragmentsCaches;

		/*

		 * A cache of package fragments for each package fragment root of this project

		 * (a map from IPackageFragmentRoot to a set of String[] (the package name))

		 */

		public Map pkgFragmentsCaches;

			}

	private void initializePackageNames(IPackageFragmentRoot root, HashSetOfArray fragmentsCache) {

		IJavaElement[] frags = null;

		try {

			if (!root.isOpen()) {

				PackageFragmentRootInfo info = root.isArchive() ? new JarPackageFragmentRootInfo() : new PackageFragmentRootInfo();

				((PackageFragmentRoot) root).computeChildren(info, new HashMap());

				frags = info.children;

			} else 

				frags = root.getChildren();

		} catch (JavaModelException e) {

			// root doesn't exist: ignore

			return;

		}

		for (int j = 0, length2 = frags.length; j < length2; j++) {

			fragmentsCache.add(((PackageFragment) frags[j]).names);

		}

	}

		HashtableOfArrayToObject allPkgFragmentsCache = cache.allPkgFragmentsCache;

		if (allPkgFragmentsCache == null) {

			HashMap rootInfos = JavaModelManager.getJavaModelManager().deltaState.roots;

			IPackageFragmentRoot[] allRoots = cache.allPkgFragmentRootsCache;

			int length = allRoots.length;

			allPkgFragmentsCache = new HashtableOfArrayToObject();

			for (int i = 0; i < length; i++) {

				IPackageFragmentRoot root = allRoots[i];

				DeltaProcessor.RootInfo rootInfo = (DeltaProcessor.RootInfo) rootInfos.get(root.getPath());

				JavaProject rootProject = rootInfo == null ? project : rootInfo.project;

				HashSetOfArray fragmentsCache;

				if (rootProject.equals(project)) {

					// retrieve package fragments cache from this project

					fragmentsCache = (HashSetOfArray) cache.pkgFragmentsCaches.get(root);

				} else {

					// retrieve package fragments  cache from the root's project

					ProjectCache rootProjectCache;

					try {

						rootProjectCache = rootProject.getProjectCache();

					} catch (JavaModelException e) {

						// project doesn't exit

						continue;

					}

					fragmentsCache = (HashSetOfArray) rootProjectCache.pkgFragmentsCaches.get(root);

				}

				Object[][] set = fragmentsCache.set;

				for (int j = 0, length2 = set.length; j < length2; j++) {

					String[] pkgName = (String[]) set[j];

					if (pkgName == null)

						continue;

					Object existing = allPkgFragmentsCache.get(pkgName);

					if (existing == null || existing == NO_ROOTS) {

						allPkgFragmentsCache.put(pkgName, root);

						// ensure super packages (see https://bugs.eclipse.org/bugs/show_bug.cgi?id=119161)

						// are also in the map

						addSuperPackageNames(pkgName, allPkgFragmentsCache);

					} else {

						if (existing instanceof PackageFragmentRoot) {

							allPkgFragmentsCache.put(pkgName, new IPackageFragmentRoot[] {(PackageFragmentRoot) existing, root});

						} else {

							IPackageFragmentRoot[] roots = (IPackageFragmentRoot[]) existing;

							int rootLength = roots.length;

							System.arraycopy(roots, 0, roots = new IPackageFragmentRoot[rootLength+1], 0, rootLength);

							roots[rootLength] = root;

							allPkgFragmentsCache.put(pkgName, roots);

						}

					}

				}

			}

			cache.allPkgFragmentsCache = allPkgFragmentsCache;

		}

/*******************************************************************************

 * Copyright (c) 2000, 2007 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.jdt.internal.core.util;

/**

 * HashSet of Object[]

 */

public final class HashSetOfArray implements Cloneable {

	// to avoid using Enumerations, walk the individual tables skipping nulls

	public Object[][] set;

	public int elementSize; // number of elements in the table

	int threshold;

	public HashSetOfArray() {

		this(13);

	}

	public HashSetOfArray(int size) {

		this.elementSize = 0;

		this.threshold = size; // size represents the expected number of elements

		int extraRoom = (int) (size * 1.75f);

		if (this.threshold == extraRoom)

			extraRoom++;

		this.set = new Object[extraRoom][];

	}

	public Object clone() throws CloneNotSupportedException {

		HashSetOfArray result = (HashSetOfArray) super.clone();

		result.elementSize = this.elementSize;

		result.threshold = this.threshold;

		int length = this.set.length;

		result.set = new Object[length][];

		System.arraycopy(this.set, 0, result.set, 0, length);

		return result;

	}

	public boolean contains(Object[] array) {

		int length = this.set.length;

		int index = hashCode(array) % length;

		int arrayLength = array.length;

		Object[] currentArray;

		while ((currentArray = this.set[index]) != null) {

			if (currentArray.length == arrayLength && Util.equalArraysOrNull(currentArray, array))

				return true;

			if (++index == length) {

				index = 0;

			}

		}

		return false;

	}

	private int hashCode(Object[] element) {

		return hashCode(element, element.length);

	}

	private int hashCode(Object[] element, int length) {

		int hash = 0;

		for (int i = length-1; i >= 0; i--)

			hash = Util.combineHashCodes(hash, element[i].hashCode());

		return hash & 0x7FFFFFFF;

	}

	public Object add(Object[] array) {

		int length = this.set.length;

		int index = hashCode(array) % length;

		int arrayLength = array.length;

		Object[] currentArray;

		while ((currentArray = this.set[index]) != null) {

			if (currentArray.length == arrayLength && Util.equalArraysOrNull(currentArray, array))

				return this.set[index] = array;

			if (++index == length) {

				index = 0;

			}

		}

		this.set[index] = array;

		// assumes the threshold is never equal to the size of the table

		if (++this.elementSize > threshold)

			rehash();

		return array;

	}

	public Object remove(Object[] array) {

		int length = this.set.length;

		int index = hashCode(array) % length;

		int arrayLength = array.length;

		Object[] currentArray;

		while ((currentArray = this.set[index]) != null) {

			if (currentArray.length == arrayLength && Util.equalArraysOrNull(currentArray, array)) {

				Object existing = this.set[index];

				this.elementSize--;

				this.set[index] = null;

				rehash();

				return existing;

			}

			if (++index == length) {

				index = 0;

			}

		}

		return null;

	}

	private void rehash() {

		HashSetOfArray newHashSet = new HashSetOfArray(elementSize * 2);		// double the number of expected elements

		Object[] currentArray;

		for (int i = this.set.length; --i >= 0;)

			if ((currentArray = this.set[i]) != null)

				newHashSet.add(currentArray);

		this.set = newHashSet.set;

		this.threshold = newHashSet.threshold;

	}

	public int size() {

		return elementSize;

	}

	public String toString() {

		StringBuffer buffer = new StringBuffer();

		Object[] element;

		for (int i = 0, length = this.set.length; i < length; i++)

			if ((element = this.set[i]) != null) {

				buffer.append('{');

				for (int j = 0, length2 = element.length; j < length2; j++) {

					buffer.append(element[j]);

					if (j != length2-1) 

						buffer.append(", "); //$NON-NLS-1$

				}

				buffer.append("}");  //$NON-NLS-1$

				if (i != length-1)

					buffer.append('\n');

			}

		return buffer.toString();

	}

}