View Javadoc
1   /*
2    *
3    * The DbUnit Database Testing Framework
4    * Copyright (C)2005, DbUnit.org
5    *
6    * This library is free software; you can redistribute it and/or
7    * modify it under the terms of the GNU Lesser General Public
8    * License as published by the Free Software Foundation; either
9    * version 2.1 of the License, or (at your option) any later version.
10   *
11   * This library is distributed in the hope that it will be useful,
12   * but WITHOUT ANY WARRANTY; without even the implied warranty of
13   * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
14   * Lesser General Public License for more details.
15   *
16   * You should have received a copy of the GNU Lesser General Public
17   * License along with this library; if not, write to the Free Software
18   * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
19   *
20   */
21  package org.dbunit.database.search;
22  
23  import org.slf4j.Logger;
24  import org.slf4j.LoggerFactory;
25  
26  import java.util.SortedSet;
27  
28  import org.dbunit.database.IDatabaseConnection;
29  
30  import org.dbunit.util.search.SearchException;
31  
32  /**
33   * ISearchCallback implementation that get the nodes using both direct and reverse 
34   * foreign key dependency, i.e, if table C has a FK for a table A and table A has 
35   * a FK for a table B, then getNodes(A) will return B and C.
36   * 
37   * @author Felipe Leme (dbunit@felipeal.net)
38   * @version $Revision$
39   * @since Aug 25, 2005
40   */
41  public class ImportedAndExportedKeysSearchCallback extends AbstractMetaDataBasedSearchCallback 
42  {
43  
44      /**
45  	 * Logger for this class
46  	 */
47  	private static final Logger	logger = LoggerFactory.getLogger(ImportedAndExportedKeysSearchCallback.class);
48  
49  	public ImportedAndExportedKeysSearchCallback(IDatabaseConnection connection)
50  	{
51  		super(connection);
52  	}
53  
54  	public SortedSet getEdges(Object node) throws SearchException
55  	{
56  		logger.debug("getEdges(node={}) - start", node);
57  		return getNodesFromImportAndExportKeys(node);
58  	}
59  
60  }