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   */package org.dbunit.database.search;
21  
22  import java.util.SortedSet;
23  
24  import org.dbunit.database.IDatabaseConnection;
25  import org.dbunit.util.search.SearchException;
26  import org.slf4j.Logger;
27  import org.slf4j.LoggerFactory;
28  
29  /**
30   * ISearchCallback implementation that get the nodes using direct foreign key 
31   * dependency, i.e, if table A has a FK for a table B, then getNodes(A) will 
32   * return B.
33   * 
34   * @author Felipe Leme (dbunit@felipeal.net)
35   * @version $Revision$
36   * @since Aug 25, 2005
37   */
38  public class ImportedKeysSearchCallback extends
39      AbstractMetaDataBasedSearchCallback {
40  
41      /**
42       * Logger for this class
43       */
44      private static final Logger logger = LoggerFactory.getLogger(ImportedKeysSearchCallback.class);
45  
46      public ImportedKeysSearchCallback(IDatabaseConnection connection) {
47          super(connection);
48      }
49  
50      public SortedSet getEdges(Object node) throws SearchException {
51          logger.debug("getEdges(node={}) - start", node);
52  
53          return getNodesFromImportedKeys( node );
54      }
55  
56  }