Package org.dbunit.util.search

Interface Summary

Interface	Description
IEdge	A bidirectional edge on the graph to be searched. It must implement Comparable so the ISearchCallback can properly order the dependencies of a node (so, typically, the implementations will compare the getTo() node).
ISearchAlgorithm	Interface representing an algorithm that searches a graph.
ISearchCallback	Callback used by the search algorithms. This interface is responsible for providing the edges of the graph and it can be notified of some events generated by the search.

Class Summary

Class	Description
AbstractExcludeNodesSearchCallback
AbstractIncludeNodesSearchCallback
AbstractNodesFilterSearchCallback	Super-class for ISearchCallback implementations that needs to filter which nodes should be included or excluded from the search. This class implements the searchNode() based on its internal mode, which could be ALLOW_MODE, DENY_MODE or NO_MODE: NO_MODE is the default mode and means searchNode() always return true ALLOW_MODE is set when setAllowedNodes() is called and it means searchNode() will return true only if the node is contained on the Set (or array) passed to setAllowedNodes() DENY_MODE is set when setDeniedNodes() is called and it means searchNode() will return true only if the node is not contained on the Set (or array) passed to setDeniedNodes()
DepthFirstSearch	Search using depth-first algorithm. An instance of this class must be used only once, as it maintains the internal state of the search.
Edge	Basic implementation of the IEdge interface.

Exception Summary

Exception	Description
SearchException	Base class for exceptions during the search.