Uses of Class
org.dbunit.util.search.SearchException

Packages that use SearchException
org.dbunit.database.search   
org.dbunit.util.search   
 

Uses of SearchException in org.dbunit.database.search
 

Methods in org.dbunit.database.search that throw SearchException
protected static ForeignKeyRelationshipEdge AbstractMetaDataBasedSearchCallback.createFKEdge(ResultSet rs, int type, String from, String to, String fkColumn, String pkColumn)
          Creates an edge representing a foreign key relationship between 2 tables.
static IDataSet TablesDependencyHelper.getAllDataset(IDatabaseConnection connection, PrimaryKeyFilter.PkTableMap rootTables)
           
static IDataSet TablesDependencyHelper.getAllDataset(IDatabaseConnection connection, String rootTable, Set allowedPKs)
           
static String[] TablesDependencyHelper.getAllDependentTables(IDatabaseConnection connection, String rootTable)
          Get the name of all tables that depend on a root table ( i.e, all tables whose PK is a FK for the root table) and also the tables the root table depends on (i.e., all tables which have a FK for the root table's PK).
static String[] TablesDependencyHelper.getAllDependentTables(IDatabaseConnection connection, String[] rootTables)
          Get the name of all tables that depend on the root tables ( i.e, all tables whose PK is a FK for any of the root tables) and also the tables the root tables depends on (i.e., all tables which have a FK for any of the root table's PK).
static IDataSet TablesDependencyHelper.getDataset(IDatabaseConnection connection, PrimaryKeyFilter.PkTableMap rootTables)
           
static IDataSet TablesDependencyHelper.getDataset(IDatabaseConnection connection, String rootTable, Set allowedIds)
           
static String[] TablesDependencyHelper.getDependentTables(IDatabaseConnection connection, String rootTable)
          Get the name of all tables that depend on the root tables (i.e, all tables that have FKs pointing to the PK of the root table).
static String[] TablesDependencyHelper.getDependentTables(IDatabaseConnection connection, String[] rootTables)
          Get the name of all tables that depend on the root tables (i.e, all tables that have FKs pointing to the PK of one of the root tables).
static String[] TablesDependencyHelper.getDependsOnTables(IDatabaseConnection connection, String rootTable)
          Get the name of all tables that the given rootTable depends on (i.e, all tables whose PK is a FK for the root table).
static Set TablesDependencyHelper.getDirectDependentTables(IDatabaseConnection connection, String tableName)
          Returns a set of tables which directly depend on the given table.
static Set TablesDependencyHelper.getDirectDependsOnTables(IDatabaseConnection connection, String tableName)
          Returns a set of tables on which the given table directly depends on.
 SortedSet ExportedKeysSearchCallback.getEdges(Object node)
           
 SortedSet ImportedAndExportedKeysSearchCallback.getEdges(Object node)
           
 SortedSet ImportedKeysSearchCallback.getEdges(Object node)
           
protected  SortedSet AbstractMetaDataBasedSearchCallback.getNodesFromExportedKeys(Object node)
          Get the nodes using the reverse foreign key dependency, i.e, if table C has a FK for a table A, then getNodesFromExportedKeys(A) will return C.
NOTE: this method should be used only as an auxiliary method for sub-classes that also use getNodesFromImportedKeys() or something similar, otherwise the generated sequence of tables might not work when inserted in the database (as some tables might be missing).
protected  SortedSet AbstractMetaDataBasedSearchCallback.getNodesFromImportAndExportKeys(Object node)
          Get the nodes using the both direct and reverse foreign key dependency, i.e, if table C has a FK for a table A and table A has a FK for a table B, then getNodesFromImportAndExportedKeys(A) will return B and C.
protected  SortedSet AbstractMetaDataBasedSearchCallback.getNodesFromImportedKeys(Object node)
          Get the nodes using the direct foreign key dependency, i.e, if table A has a FK for a table B, then getNodesFromImportedKeys(A) will return B.
protected  IEdge AbstractMetaDataBasedSearchCallback.newEdge(ResultSet rs, int type, String from, String to, String fkColumn, String pkColumn)
          This method can be overwritten by the sub-classes if they need to decorate the edge (for instance, providing an Edge that contains the primary and foreign keys used).
protected  IEdge ImportedAndExportedKeysSearchCallbackFilteredByPKs.newEdge(ResultSet rs, int type, String from, String to, String fkColumn, String pkColumn)
           
protected  IEdge ImportedKeysSearchCallbackFilteredByPKs.newEdge(ResultSet rs, int type, String from, String to, String fkColumn, String pkColumn)
           
 void ImportedAndExportedKeysSearchCallbackFilteredByPKs.nodeAdded(Object node)
           
 void ImportedKeysSearchCallbackFilteredByPKs.nodeAdded(Object node)
           
 

Uses of SearchException in org.dbunit.util.search
 

Methods in org.dbunit.util.search that throw SearchException
 SortedSet ISearchCallback.getEdges(Object fromNode)
          Get the edges originating from a node.
 void AbstractNodesFilterSearchCallback.nodeAdded(Object fromNode)
          Do nothing...
 void ISearchCallback.nodeAdded(Object fromNode)
          Notifies the callback that a node has been added to the search result.
 org.apache.commons.collections.set.ListOrderedSet DepthFirstSearch.search(Object[] nodesFrom, ISearchCallback callback)
          Alternative option to search() that takes an array of nodes as input (instead of a Set)
 org.apache.commons.collections.set.ListOrderedSet DepthFirstSearch.search(Set nodesFrom, ISearchCallback callback)
           
 org.apache.commons.collections.set.ListOrderedSet ISearchAlgorithm.search(Set nodesFrom, ISearchCallback callback)
          Search all nodes that originates from a set of nodes.
 boolean AbstractNodesFilterSearchCallback.searchNode(Object node)
           
 boolean ISearchCallback.searchNode(Object node)
          Decides if a node should be searched or not
 



Copyright © 2002-2012. All Rights Reserved.