EclipseLink Core 4.0.2 · org.eclipse.persistence.internal.sessions.CommitOrderCalculator

This class calculates a commit order for a series of classes based on the dependencies between them. It builds up a graph of dependencies (CommitOrderDependencyNodes) then applies topological sort to them to get an ordering. This is a throwaway class, which exists only for the lifetime of the calculation. The algorithm is described in the method comment for orderCommits(). This class also includes static methods for quicksort, copied from the standard libraries and adapted for these objects, since that seemed like the easiest way to sort.

Field Summary

Modifier and Type	Field and Description
protected int	currentTime
protected Vector<CommitOrderDependencyNode>	nodes
protected Vector<E>	orderedDescriptors
protected AbstractSession	session

Constructor Summary

Access	Constructor and Description
public	CommitOrderCalculator(AbstractSession session)

Method Summary

Modifier and Type	Method and Description
protected void	addNode(ClassDescriptor d)
public void	addNodes(Vector<E> descriptors)
public void	calculateMappingDependencies() Add to each node the dependent nodes
public void	calculateSpecifiedDependencies() Add to each node the dependent nodes
public void	depthFirstSearch()
private static int	doCompare(Object o1, Object o2)
public int	getNextTime()
public Vector<CommitOrderDependencyNode>	getNodes()
public Vector<E>	getOrderedClasses() Return the constraint ordered classes.
public Vector<E>	getOrderedDescriptors() Return the constraint ordered descriptors.
public CommitOrderDependencyNode	nodeFor(Class<?> c)
public CommitOrderDependencyNode	nodeFor(ClassDescriptor d)
public void	orderCommits() Calculate the commit order.
private static void	quicksort(Object[] arr) Perform a sort using the specified comparator object.
private static void	quicksort(Object[] - an array of objects arr, int - the start index - from where to begin sorting left, int - the last index. right) quicksort the array of objects.
private static void	swap(Object[] arr, int i, int j)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

currentTime	back to summary
protected int currentTime

nodes	back to summary
protected Vector<CommitOrderDependencyNode> nodes

orderedDescriptors	back to summary
protected Vector<E> orderedDescriptors

session	back to summary
protected AbstractSession session

Constructor Detail

CommitOrderCalculator	back to summary
public CommitOrderCalculator(AbstractSession session)

Method Detail

addNode	back to summary
protected void addNode(ClassDescriptor d)

addNodes	back to summary
public void addNodes(Vector<E> descriptors)

calculateMappingDependencies	back to summary
public void calculateMappingDependencies() Add to each node the dependent nodes

calculateSpecifiedDependencies	back to summary
public void calculateSpecifiedDependencies() Add to each node the dependent nodes

depthFirstSearch	back to summary
public void depthFirstSearch()

doCompare	back to summary
private static int doCompare(Object o1, Object o2)

getNextTime	back to summary
public int getNextTime()

getNodes	back to summary
public Vector<CommitOrderDependencyNode> getNodes()

getOrderedClasses	back to summary
public Vector<E> getOrderedClasses() Return the constraint ordered classes.

getOrderedDescriptors	back to summary
public Vector<E> getOrderedDescriptors() Return the constraint ordered descriptors.

nodeFor	back to summary
public CommitOrderDependencyNode nodeFor(Class<?> c)

nodeFor	back to summary
public CommitOrderDependencyNode nodeFor(ClassDescriptor d)

orderCommits	back to summary
public void orderCommits() Calculate the commit order. Do a depth first search on the graph, skipping nodes that we have already visited or are in the process of visiting. Keep a counter and note when we first encounter a node and when we finish visiting it. Once we've visited everything, sort nodes by finishing time

quicksort	back to summary
private static void quicksort(Object[] arr) Perform a sort using the specified comparator object.

quicksort	back to summary
private static void quicksort(Object[] arr, int left, int right) quicksort the array of objects. Parameters arr:Object[] - an array of objects left:int - the start index - from where to begin sorting right:int - the last index.

quicksort

back to summary

private static void quicksort(Object[] arr, int left, int right)

quicksort the array of objects.

Parameters

arr:Object[]: - an array of objects
left:int: - the start index - from where to begin sorting
right:int: - the last index.