git-svn-id: https://hudson.dev.java.net/svn/hudson/trunk/hudson/main@10612 71c3de6d-444a-0410-be80-ed276b4c234a
This commit is contained in:
kohsuke committed 2008-07-03 17:57:35 +00:00
1 parent 47f93e2686
commit c19ce4b44c
1 file changed
+46 -48
@@ -314,54 +314,52 @@ public final class DependencyGraph {
public static final DependencyGraph EMPTY = new DependencyGraph(false);
/**
* Sort the given in their Buildorder. Note that there may be more than
* one possible order.
*
* @param list to be ordered
*/
* Sort the given in their Buildorder. Note that there may be more than
* one possible order.
*
* @param list to be ordered
*/
public void sort(List<AbstractProject> list) {
// Record the Ingrade of each Node in the graph
Map<AbstractProject, Integer> inGrade = new HashMap<AbstractProject, Integer>();
// Holds nodes/Projects with ingrade 0
Set<AbstractProject> roots = new HashSet<AbstractProject>();
// For each Project calculate the ingrade
for (AbstractProject p : Hudson.getInstance().getProjects()) {
List<AbstractProject> ancestors = new ArrayList<AbstractProject>(
getUpstream(p));
if (ancestors.size() == 0) {
roots.add(p);
inGrade.put(p, 0);
} else
inGrade.put(p, ancestors.size());
}
public void sort(List<AbstractProject> list) {
// Record the Ingrade of each Node in the graph
Map<AbstractProject, Integer> inGrade = new HashMap<AbstractProject, Integer>();
// Holds nodes/Projects with ingrade 0
Set<AbstractProject> roots = new HashSet<AbstractProject>();
// For each Project calculate the ingrade
for (AbstractProject p : Hudson.getInstance().getProjects()) {
List<AbstractProject> ancestors = new ArrayList<AbstractProject>(
getUpstream(p));
if (ancestors.size() == 0) {
roots.add(p);
inGrade.put(p, 0);
} else
inGrade.put(p, ancestors.size());
}
List<AbstractProject> result = new ArrayList<AbstractProject>(list.size());
while (!roots.isEmpty()) {
AbstractProject current = roots.iterator().next();
// Since we took all existing Projects in account for sorting this may
// contain projects that have not been in the original list.
if (list.contains(current)) {
result.add(current);
}
roots.remove(current);
// Reduce the ingrade of successor of the current node. Some of them may become new roots
for (AbstractProject p : getDownstream(current)) {
Integer newIngrade = inGrade.get(p);
if (newIngrade == null)
continue;
newIngrade = newIngrade - 1;
inGrade.put(p, newIngrade);
if (newIngrade == 0) {
roots.add(p);
}
}
}
// Write the result back to the list
for (int i = 0; i < list.size(); i++) {
list.set(i, result.get(i));
}
}
List<AbstractProject> result = new ArrayList<AbstractProject>(list.size());
while (!roots.isEmpty()) {
AbstractProject current = roots.iterator().next();
// Since we took all existing Projects in account for sorting this may
// contain projects that have not been in the original list.
if (list.contains(current)) {
result.add(current);
}
roots.remove(current);
// Reduce the ingrade of successor of the current node. Some of them may become new roots
for (AbstractProject p : getDownstream(current)) {
Integer newIngrade = inGrade.get(p);
if (newIngrade == null)
continue;
newIngrade = newIngrade - 1;
inGrade.put(p, newIngrade);
if (newIngrade == 0) {
roots.add(p);
}
}
}
// Write the result back to the list
for (int i = 0; i < list.size(); i++) {
list.set(i, result.get(i));
}
}
}