Package org.dellroad.stuff.schema

Class SchemaUpdateEdgeLister<T>

java.lang.Object

org.dellroad.stuff.schema.SchemaUpdateEdgeLister<T>

Type Parameters:

T - database transaction type

All Implemented Interfaces:

TopologicalSorter.EdgeLister<SchemaUpdate<T>>

public class SchemaUpdateEdgeLister<T>
extends Object
implements TopologicalSorter.EdgeLister<SchemaUpdate<T>>

TopologicalSorter.EdgeLister implementation reflecting SchemaUpdate predecessor constraints.

Graph edges will exist from each update to its predecessors. Note, this is the reverse of the actual desired ordering of the updates.

Constructor Summary

Constructors

Constructor	Description
SchemaUpdateEdgeLister()

Method Summary

Modifier and Type	Method	Description
Set<SchemaUpdate<T>>	getOutEdges(SchemaUpdate<T> update)	Get the set of all nodes X for which there is an edge from node to X.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

SchemaUpdateEdgeLister

public SchemaUpdateEdgeLister()

Method Details

getOutEdges

public Set<SchemaUpdate<T>> getOutEdges(SchemaUpdate<T> update)

Description copied from interface: TopologicalSorter.EdgeLister

Get the set of all nodes X for which there is an edge from node to X.

Specified by:

getOutEdges in interface TopologicalSorter.EdgeLister<T>

Parameters:

update - node in question

Returns:

set of outgoing edges from node