private void addTypeChildren(IType type, List<IMember> children) throws JavaModelException { ArrayList<IType> types= new ArrayList<>(); getTypesInHierarchy(type, types); int len= types.size(); for (int i= 0; i < len; i++) { IType curr= types.get(i); if (isInTree(curr)) { children.add(curr); } } }
private boolean hasTypeChildren(IType type) throws JavaModelException { ArrayList<IType> types= new ArrayList<>(); getTypesInHierarchy(type, types); int len= types.size(); for (int i= 0; i < len; i++) { IType curr= types.get(i); if (isInTree(curr)) { return true; } } return false; }
private void addTypeChildren(IType type, List<IMember> children) throws JavaModelException { ArrayList<IType> types= new ArrayList<>(); getTypesInHierarchy(type, types); int len= types.size(); for (int i= 0; i < len; i++) { IType curr= types.get(i); if (isInTree(curr)) { children.add(curr); } } }
private void addTypeChildren(IType type, List children) throws JavaModelException { ArrayList types= new ArrayList(); getTypesInHierarchy(type, types); int len= types.size(); for (int i= 0; i < len; i++) { IType curr= (IType) types.get(i); if (isInTree(curr)) { children.add(curr); } } }
private boolean hasTypeChildren(IType type) throws JavaModelException { ArrayList types= new ArrayList(); getTypesInHierarchy(type, types); int len= types.size(); for (int i= 0; i < len; i++) { IType curr= (IType) types.get(i); if (isInTree(curr)) { return true; } } return false; }
private boolean hasTypeChildren(IType type) throws JavaModelException { ArrayList<IType> types= new ArrayList<>(); getTypesInHierarchy(type, types); int len= types.size(); for (int i= 0; i < len; i++) { IType curr= types.get(i); if (isInTree(curr)) { return true; } } return false; }
public Object[] getElements(Object parent) { ArrayList types= new ArrayList(); getRootTypes(types); for (int i= types.size() - 1; i >= 0; i--) { IType curr= (IType) types.get(i); try { if (!isInTree(curr)) { types.remove(i); } } catch (JavaModelException e) { // ignore } } return types.toArray(); }
@Override public Object[] getElements(Object parent) { ArrayList<IType> types= new ArrayList<>(); getRootTypes(types); for (int i= types.size() - 1; i >= 0; i--) { IType curr= types.get(i); try { if (!isInTree(curr)) { types.remove(i); } } catch (JavaModelException e) { // ignore } } return types.toArray(); }
@Override public Object[] getElements(Object parent) { ArrayList<IType> types= new ArrayList<>(); getRootTypes(types); for (int i= types.size() - 1; i >= 0; i--) { IType curr= types.get(i); try { if (!isInTree(curr)) { types.remove(i); } } catch (JavaModelException e) { // ignore } } return types.toArray(); }