public IMember[] getAdditionalRequiredMembers(IProgressMonitor monitor) throws JavaModelException { IMember[] members= MemberActionInfo.getMembers(getInfosForMembersToBeCreatedInSubclassesOfDeclaringClass()); monitor.beginTask(RefactoringCoreMessages.PushDownRefactoring_calculating_required, members.length);// not // true, // but // not // easy // to // give // anything // better List<IMember> queue= new ArrayList<>(members.length); queue.addAll(Arrays.asList(members)); if (queue.isEmpty()) return new IMember[0]; int i= 0; IMember current; do { current= queue.get(i); addAllRequiredPushableMembers(queue, current, new SubProgressMonitor(monitor, 1)); i++; if (queue.size() == i) current= null; } while (current != null); queue.removeAll(Arrays.asList(members));// report only additional return queue.toArray(new IMember[queue.size()]); }
public IMember[] getAdditionalRequiredMembers(IProgressMonitor monitor) throws JavaModelException { IMember[] members= MemberActionInfo.getMembers(getInfosForMembersToBeCreatedInSubclassesOfDeclaringClass()); monitor.beginTask(RefactoringCoreMessages.PushDownRefactoring_calculating_required, members.length);// not // true, // but // not // easy // to // give // anything // better List<IMember> queue= new ArrayList<>(members.length); queue.addAll(Arrays.asList(members)); if (queue.isEmpty()) return new IMember[0]; int i= 0; IMember current; do { current= queue.get(i); addAllRequiredPushableMembers(queue, current, new SubProgressMonitor(monitor, 1)); i++; if (queue.size() == i) current= null; } while (current != null); queue.removeAll(Arrays.asList(members));// report only additional return queue.toArray(new IMember[queue.size()]); }
public IMember[] getAdditionalRequiredMembers(IProgressMonitor monitor) throws JavaModelException { IMember[] members= MemberActionInfo.getMembers(getInfosForMembersToBeCreatedInSubclassesOfDeclaringClass()); monitor.beginTask(RefactoringCoreMessages.PushDownRefactoring_calculating_required, members.length);// not // true, // but // not // easy // to // give // anything // better List queue= new ArrayList(members.length); queue.addAll(Arrays.asList(members)); if (queue.isEmpty()) return new IMember[0]; int i= 0; IMember current; do { current= (IMember) queue.get(i); addAllRequiredPushableMembers(queue, current, new SubProgressMonitor(monitor, 1)); i++; if (queue.size() == i) current= null; } while (current != null); queue.removeAll(Arrays.asList(members));// report only additional return (IMember[]) queue.toArray(new IMember[queue.size()]); }