site.java

为了下东西 随便发了个 datamining 的源代码

/*
 *    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., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

/**
 * Title: XELOPES Data Mining Library
 * Description: The XELOPES library is an open platform-independent and data-source-independent library for Embedded Data Mining.
 * Copyright: Copyright (c) 2002 Prudential Systems Software GmbH
 * Company: ZSoft (www.zsoft.ru), Prudsys (www.prudsys.com)
 * @author Valentine Stepanenko ([e-mail])
 * @version 1.0
 */

package com.prudsys.pdm.Cwm.SoftwareDeployment;

import java.util.Collection;
import java.util.Iterator;

import com.prudsys.pdm.Cwm.BusinessInformation.Location;

/**
 * A Site represents a geographical location. It provides a grouping mechanism for
 * a group of machines at the same location.
 *
 *
 *
 * Sites may be documented at different levels of granularity; containment links
 * may be used to record hierarchical relationships between Sites.
 */
public class Site extends Location // implements org.omg.cwm.foundation.softwaredeployment.Site
{
   public Site containingSite[];
   public Site containedSite[];
   public Machine machine[];

   public Site()
   {

   }

   public Collection getContainingSite() {
     return com.prudsys.pdm.Cwm.Core.CWMTools.ArrayToList(containingSite);
   }

   public void setContainingSite(Collection containingSite) {
     this.containingSite = new Site[ containingSite.size() ];
     Iterator it = containingSite.iterator();
     for (int i = 0; i < containingSite.size(); i++)
       this.containingSite[i] = (Site) it.next();
   }

   public void addContainingSite( org.omg.cwm.foundation.softwaredeployment.Site input) {
     int size = (containingSite == null) ? 0 : containingSite.length;
     Site[] oldData = containingSite;
     containingSite = new Site[size+1];
     if (size > 0) System.arraycopy(oldData, 0, containingSite, 0, size);
     containingSite[size] = (Site) input;
   }

   public void removeContainingSite( org.omg.cwm.foundation.softwaredeployment.Site input) {
     int size = (containingSite == null) ? 0 : containingSite.length;
     if (size == 0)
       return;

     int ipos = -1;
     for (int i = 0; i < size; i++)
       if (containingSite[i].equals(input)) {
         ipos = i;
         break;
       }
     if (ipos == -1)
       return;

     Site[] oldData = containingSite;
     containingSite = new Site[size-1];
     for (int i = 0; i < ipos; i++)
       containingSite[i] = oldData[i];
     for (int i = ipos+1; i < size; i++)
       containingSite[i-1] = oldData[i];
   }
}