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; }