Java ITypeHierarchy.exists方法代码示例

import org.eclipse.jdt.core.ITypeHierarchy; //导入方法依赖的package包/类
private static ITypeHierarchy findTypeHierarchyInCache(IType type) {
  synchronized (fgHierarchyCache) {
    for (int i = fgHierarchyCache.size() - 1; i >= 0; i--) {
      HierarchyCacheEntry curr = fgHierarchyCache.get(i);
      ITypeHierarchy hierarchy = curr.getTypeHierarchy();
      if (!hierarchy.exists()) {
        removeHierarchyEntryFromCache(curr);
      } else {
        if (hierarchy.contains(type)) {
          curr.markAsAccessed();
          return hierarchy;
        }
      }
    }
  }
  return null;
}
 

import org.eclipse.jdt.core.ITypeHierarchy; //导入方法依赖的package包/类
private static ITypeHierarchy findTypeHierarchyInCache(IType type) {
	synchronized (fgHierarchyCache) {
		for (int i= fgHierarchyCache.size() - 1; i>= 0; i--) {
			HierarchyCacheEntry curr= fgHierarchyCache.get(i);
			ITypeHierarchy hierarchy= curr.getTypeHierarchy();
			if (!hierarchy.exists()) {
				removeHierarchyEntryFromCache(curr);
			} else {
				if (hierarchy.contains(type)) {
					curr.markAsAccessed();
					return hierarchy;
				}
			}
		}
	}
	return null;
}
 

import org.eclipse.jdt.core.ITypeHierarchy; //导入方法依赖的package包/类
private ITypeHierarchy getSupertypes(final IType type) throws JavaModelException
{
	ITypeHierarchy hierarchy = cache.get(type);
	if (hierarchy == null || !hierarchy.exists())
	{
		hierarchy = type.newSupertypeHierarchy(new NullProgressMonitor());
		hierarchy.addTypeHierarchyChangedListener(new ITypeHierarchyChangedListener()
		{
			@Override
			public void typeHierarchyChanged(ITypeHierarchy typeHierarchy)
			{
				cache.remove(type);
			}
		});
		cache.put(type, hierarchy);
	}
	return hierarchy;
}
 

import org.eclipse.jdt.core.ITypeHierarchy; //导入方法依赖的package包/类
private static void addTypeHierarchyToCache(ITypeHierarchy hierarchy) {
  synchronized (fgHierarchyCache) {
    int nEntries = fgHierarchyCache.size();
    if (nEntries >= CACHE_SIZE) {
      // find obsolete entries or remove entry that was least recently accessed
      HierarchyCacheEntry oldest = null;
      ArrayList<HierarchyCacheEntry> obsoleteHierarchies =
          new ArrayList<HierarchyCacheEntry>(CACHE_SIZE);
      for (int i = 0; i < nEntries; i++) {
        HierarchyCacheEntry entry = fgHierarchyCache.get(i);
        ITypeHierarchy curr = entry.getTypeHierarchy();
        if (!curr.exists() || hierarchy.contains(curr.getType())) {
          obsoleteHierarchies.add(entry);
        } else {
          if (oldest == null || entry.getLastAccess() < oldest.getLastAccess()) {
            oldest = entry;
          }
        }
      }
      if (!obsoleteHierarchies.isEmpty()) {
        for (int i = 0; i < obsoleteHierarchies.size(); i++) {
          removeHierarchyEntryFromCache(obsoleteHierarchies.get(i));
        }
      } else if (oldest != null) {
        removeHierarchyEntryFromCache(oldest);
      }
    }
    HierarchyCacheEntry newEntry = new HierarchyCacheEntry(hierarchy);
    fgHierarchyCache.add(newEntry);
  }
}
 

import org.eclipse.jdt.core.ITypeHierarchy; //导入方法依赖的package包/类
private static void addTypeHierarchyToCache(ITypeHierarchy hierarchy) {
	synchronized (fgHierarchyCache) {
		int nEntries= fgHierarchyCache.size();
		if (nEntries >= CACHE_SIZE) {
			// find obsolete entries or remove entry that was least recently accessed
			HierarchyCacheEntry oldest= null;
			ArrayList<HierarchyCacheEntry> obsoleteHierarchies= new ArrayList<HierarchyCacheEntry>(CACHE_SIZE);
			for (int i= 0; i < nEntries; i++) {
				HierarchyCacheEntry entry= fgHierarchyCache.get(i);
				ITypeHierarchy curr= entry.getTypeHierarchy();
				if (!curr.exists() || hierarchy.contains(curr.getType())) {
					obsoleteHierarchies.add(entry);
				} else {
					if (oldest == null || entry.getLastAccess() < oldest.getLastAccess()) {
						oldest= entry;
					}
				}
			}
			if (!obsoleteHierarchies.isEmpty()) {
				for (int i= 0; i < obsoleteHierarchies.size(); i++) {
					removeHierarchyEntryFromCache(obsoleteHierarchies.get(i));
				}
			} else if (oldest != null) {
				removeHierarchyEntryFromCache(oldest);
			}
		}
		HierarchyCacheEntry newEntry= new HierarchyCacheEntry(hierarchy);
		fgHierarchyCache.add(newEntry);
	}
}