Metacat

/**

 *  '$RCSfile$'

 *    Purpose: A Class that represents an XML Text node and its contents,

 *             and can build itself from a database connection

 *  Copyright: 2000 Regents of the University of California and the

 *             National Center for Ecological Analysis and Synthesis

 *    Authors: Matt Jones

 *

 *   '$Author$'

 *     '$Date$'

 * '$Revision$'

 *

 * This program is free software; you can redistribute it and/or modify

 * it under the terms of the GNU General Public License as published by

 * the Free Software Foundation; either version 2 of the License, or

 * (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

 */

package edu.ucsb.nceas.metacat;

import java.sql.PreparedStatement;

import java.sql.SQLException;

import java.sql.ResultSet;

 * A Class that represents an XML Subtree

 */

  protected String subTreeId = null;

  protected String startElementName = null;

  protected long   startNodeId = -1;

  protected long   endNodeId =   -1;

  private static Logger logMetacat = Logger.getLogger(SubTree.class);

     * Defualt constructor

     */

    public SubTree()

    {

     * Constructor of subtree

     */

    {

      this.docId = myDocId;

     * Get subtree node stack

     */

      {

        subTreeNodeStack = getSubTreeNodeList();

      }

      catch (McdbException e)

      {

        throw new SAXException(e.getMessage());

      }

    }

     * Set subtree node stack

     */

    public void setSubTreeNodeStack(Stack myStack)

    {

      this.subTreeNodeStack = myStack;

    }

    public void setDocId(String myId)

    {

    }

    /** Get the docId */

      return this.docId;

    }

    public void setSubTreeId(String myId)

    {

    }

    /** Get the subTreeId */

      return this.subTreeId;

    }

     */

    }

     * Get startElementName

     */

    public String getStartElementName()

    {

      return this.startElementName;

    }

    public void setStartNodeId(long nodeId)

    {

    }

    public long getStartNodeId()

    {

      return this.startNodeId;

    }

    public void setEndNodeId(long nodeId)

    {

    }

    public long getEndNodeId()

    {

      return this.endNodeId;

    }

       // make sure it works

       if ( docId == null || startNodeId == -1 || endNodeId == -1)

       {

         return nodeRecordList;

       }

       DBConnection dbconn = null;

       int serialNumber = -1;

       long parentnodeid = 0;

       long nodeindex = 0;

       String nodetype = null;

       String nodename = null;

       String nodeprefix = null;

       String nodedata = null;

       String sql = "SELECT nodeid, parentnodeid, nodeindex, " +

                    "nodeid <= ? ORDER BY nodeid DESC";

         dbconn=DBConnectionPool.

                    getDBConnection("SubTree.getSubTreeNodeList");

         serialNumber=dbconn.getCheckOutSerialNumber();

         pstmt = dbconn.prepareStatement(sql);

         // Bind the values to the query

         pstmt.setString(1, docId);

         pstmt.setLong(2, startNodeId);

         pstmt.setLong(3, endNodeId);

         pstmt.execute();

         ResultSet rs = pstmt.getResultSet();

         boolean tableHasRows = rs.next();

         while (tableHasRows)

           nodeid = rs.getLong(1);

           parentnodeid = rs.getLong(2);

           nodeindex = rs.getLong(3);

           nodetype = rs.getString(4);

           nodename = rs.getString(5);

           nodeprefix = rs.getString(6);

           nodedata = rs.getString(7);

           nodedata = MetaCatUtil.normalize(nodedata);

           // add the data to the node record list hashtable

           NodeRecord currentRecord = new NodeRecord(nodeid,parentnodeid,nodeindex,

                                      nodetype, nodename, nodeprefix, nodedata);

           nodeRecordList.push(currentRecord);

           // Advance to the next node

           tableHasRows = rs.next();

         }//while

         pstmt.close();

      } //try

        throw new McdbException("Error in SubTree.getSubTreeNodeList 1 " +

                              e.getMessage());

      }//catch

      finally

      {

        try

        {

          pstmt.close();

        }

        catch (SQLException ee)

        {

                                    +ee.getMessage());

        finally

        {

          DBConnectionPool.returnDBConnection(dbconn, serialNumber);

        }

      }//finally

   public int compare(Object o1, Object o2)

   {

     SubTree tree1 = (SubTree) o1;

     SubTree tree2 = (SubTree) o2;

     if (tree1.getStartNodeId() > tree2.getStartNodeId())

     {

       return 1;

     }

     else if (tree1.getStartNodeId() < tree2.getStartNodeId())

     {

       return -1;

     }

     else

     {

       return 0;

     }

   public boolean equals(Object obj)

   {

     SubTree tree = (SubTree)obj;

     if (startNodeId == tree.getStartNodeId())

     {

       return true;

     }

     else

     {

       return false;

     }

   }