|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.eclipse.osgi.internal.resolver.ComputeNodeOrder
public class ComputeNodeOrder
Borrowed from org.eclipse.core.internal.resources.ComputeProjectOrder to be used when computing the stop order. Implementation of a sort algorithm for computing the node order. This algorithm handles cycles in the node reference graph in a reasonable way.
| Method Summary | |
|---|---|
static java.lang.Object[][] |
computeNodeOrder(java.lang.Object[] objects,
java.lang.Object[][] references)
Sorts the given list of projects in a manner that honors the given project reference relationships. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Method Detail |
|---|
public static java.lang.Object[][] computeNodeOrder(java.lang.Object[] objects,
java.lang.Object[][] references)
When there is an arbitrary choice, vertexes are ordered as supplied. Arranged projects in descending alphabetical order generally results in an order that builds "A" before "Z" when there are no other constraints.
Ref: Cormen, Leiserson, and Rivest
objects - a list of projects (element type:
IProject)references - a list of project references [A,B] meaning that A
references B (element type: IProject[])
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||