intvec.java

一个数据挖掘软件ALPHAMINERR的整个过程的JAVA版源代码

/*
 *    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 Victor Borichev
 * @author Valentine Stepanenko ([e-mail])
 * @version 1.0
 */

package com.prudsys.pdm.Models.Sequential;

/**
 * Vector of integers for fast data manipulation.
 *
 * @author ZSoft
 * @version 1.0
 */
public class IntVec {

  private int capacity;
  private int elemNum;
  private int[] elements;

  /**
   * default constructor at 100 elements
   */
  public IntVec() {
    elements = new int[100];
    elemNum = 0;
    capacity = 100;
  }

  /**
   * fill vector from input array of ints
   * @param invals input array
   */
  public IntVec(int[] invals) {
    elements = new int[invals.length];
    for(int i = 0; i < invals.length; i++) elements[i] = invals[i];
    elemNum = capacity = invals.length;
  }

  /**
   * add element to the vector
   * @param num int to add
   */
  public void add(int num) {
    if(elemNum==capacity) {
      capacity *= 2;
      int[] newel = new int[capacity];
      System.arraycopy(elements,0,newel,0,elemNum);
      elements = newel;
    }
    elements[elemNum] = num;
    elemNum++;
  }

  /**
   * size of vector
   * @return size of vector
   */
  public int size() {
    return elemNum;
  }

  /**
   * get int at position n
   * @param n position
   * @return int contained at position n
   */
  public int get(int n) {
    if(elemNum!=0) return elements[n];
    return -1;
  }

  /**
   * Does vector contain given item?
   *
   * @param item the item to be checked
   * @return true if item contained, otherwise false
   */
  public boolean contains(int item) {
      for(int i=0;i<elemNum;i++) if(elements[i]==item) return true;
      return false;
  }

  /**
   * make copy
   * @param iv vector to copy into
   */
  public void copy(IntVec iv) {
    iv.elemNum = elemNum;
    iv.elements = new int[elemNum];
    System.arraycopy(elements,0,iv.elements,0,elemNum);
  }

  /**
   * copy vector to array of ints
   * @param array array to copy into
   */
  public void copy(int[] array) {
    System.arraycopy(elements,0,array,0,elemNum);
  }

  /**
   * reset elements counter in zero
   */
  public void clear() {
    elemNum = 0;
  }
}